Contest1261/G.cpp

#include<bits/stdc++.h>

using namespace std;

//问题 G: 所有情况的和 S1=a1+b1;S2=(a1+b1)(a2+b2); Sn=(a1+b1)***(an+bn)
const int MOD = 1e9 + 7;
typedef long long LL;

int main() {
    for (int T; cin >> T;) {
        LL s = 1;
        while (T--) {
            int a, b;
            cin >> a >> b;
            s = (s * (a + b)) % MOD;
        }
        cout << s << endl;
    }

    return 0;
}