#include <bits/stdc++.h>
#define ll long long
#define lint __int128
using namespace std;

const int N = 2e5 + 5;
int n;
ll p[N], q[N];

const ll mod1 = 1000000000000000000 + 3;
const ll mod2 = 1000000000000000000 + 4;

map<ll, ll> mp;

ll binpow(ll x, ll y, ll mod){
    ll res = 1;
    for(; y; y >>= 1){
        if(y & 1) res = ((lint) res * x) % mod;
        x = ((lint) x * x) % mod;
    }
    return res;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    mp[0]++;

    ll s1 = 0, s2 = 0, ans = 0;
    for(int i = 1; i <= n; i++) {
        cin >> p[i] >> q[i];
        p[i] %= q[i];
        s1 = (s1 + ((lint) p[i] * binpow(q[i], mod1 - 2, mod1)) % mod1) % mod1;
        s2 = (s2 + ((lint) p[i] * binpow(q[i], mod2 - 2, mod2)) % mod2) % mod2;
        ans += mp[s1 - s2];
        mp[s1 - s2]++;
    }
    cout << ans << "\n";

    return 0;
}