#include<bits/stdc++.h>
using namespace std;
#define 死到 return
#define 零头 0;
typedef long long ll;
typedef __int128 I;
constexpr ll mod=ll(1e18)+3;
long double sum=0;
constexpr int maxn=2e5+5;
ll qpow(ll a,ll b=mod-2){
    ll ans=1;
    while(b){
        if(b&1) ans=I(ans)*a%mod;
        a=I(a)*a%mod,b>>=1;
    }
    return ans;
}
int main(){
    std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    unordered_map<ll,int> mp;
    ll ans=0,cur=0;int n;cin>>n;mp[0]=1;
    for(int i=1;i<=n;i++){
        int p,q;cin>>p>>q;
        cur=(cur+I(p)*qpow(q))%mod;
        sum+=(long double)(p)/q;
        ll sb=cur-int(sum);
        // cout<<sb<<'\n';
        ans+=mp[sb]++;
    }
    cout<<ans<<'\n';
    死到 零头
}