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

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

// Modular function to keep result in [0, MOD)
int mod(int x) {
    x %= MOD;
    if (x < 0) x += MOD;
    return x;
}

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

    int n;
    cin >> n;

    __int128 num = 0, den = 1;

    for (int i = 0; i < n; ++i) {
        int x, y;
        cin >> x >> y;

        // num/den + x/y = (num * y + x * den) / (den * y)
        __int128 new_num = num * y + (__int128)x * den;
        __int128 new_den = den * y;

        // Reduce the fraction at each step
        int g = gcd((int64_t)new_num, (int64_t)new_den);
        num = new_num / g;
        den = new_den / g;
    }

    // Final reduced num/den, print modulo 998244353
    cout << mod((int64_t)num) << ' ';
    cout << mod((int64_t)den) << '\n';
    return 0;
}