#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 998244353;

int gcd(int a, int b) {
    while (b) tie(a, b) = make_pair(b, a % b);
    return a;
}

int mod(int x) {
    x %= MOD;
    return (x + MOD) % MOD;
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> X(n), Y(n);
    for (int i = 0; i < n; ++i) cin >> X[i] >> Y[i];

    // Keep full-precision values
    __int128 num = 0;
    __int128 den = 1;

    for (int i = 0; i < n; ++i) {
        __int128 a = X[i];
        __int128 b = Y[i];
        num = num * b + a * den;
        den = den * b;
        __int128 g = gcd((int64_t)num, (int64_t)den);
        num /= g;
        den /= g;
    }

    cout << (int)(mod((int64_t)num)) << ' ';
    cout << (int)(mod((int64_t)den)) << '\n';

    return 0;
}