#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> b;

void consistency(int n){

	int d = 1;
	int sum = 1;
	int product = 1;
	
	for(int i=0; i<n; i++){
		int p = a[i];
		int e = b[i];
		d *= (e+1);
	}
	
	for(int i=0; i<n; i++){
		int p = a[i];
		int e = b[i];
		
		int nmr = power(p, e+1) - 1;
		int dnr = (p-1+M)%M;
		dnr = power(dnr, M-2);
		
		int val = (nmr * dnr%M) % M;
		
		sum = (sum * val)%M;
	}
	
	for(int i=0; i<n; i++){
		int p = a[i];
		int e = b[i];
		
		int val = power(p, (e*d)/2, M-1);
		product = (product * val) % M;
	}
	
	
	cout << d << " " << sum << " " << product << endl;

}















void practice(int n){



}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    b.resize(n);
    for(int i=0; i<n; i++){
    	cin >> a[i];
    	cin >> b[i];
    }
    
    consistency(n);


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}