#include<bits/stdc++.h>
using namespace std;
using ll = long long int;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T>
using OST = tree<T,null_type,less<T>,
rb_tree_tag, tree_order_statistics_node_update>;
//find_by_order(k):iterator to kth smallest(0 ind)
//order_of_key(x) :  no of items  < x

const ll M1 = 1e9+7;
const ll M2 = 998244353;

const ll M12 = M1 * M2;

template<ll M>
ll modexpo(ll x, ll n){
    ll ret = 1;
    while(n){
        if(n&1) ret = ret * x % M;
        x = x * x % M;
        n >>= 1;
    }
    return ret;
}


int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    int n;
    cin>>n;

    const ll M2inv = modexpo<M1>(M2, M1-2);
    const ll M1inv = modexpo<M2>(M1, M2-2);

    OST<pair<ll, int>> ost;
    ost.insert({0ll, -1});

    ll ans = 0;
    ll sum = 0;

    for(int i = 0; i<n; i++){
        ll p, q;
        cin>>p>>q;
        p %= q;

        ll x = p * modexpo<M1>(q, M1-2);
        ll y = p * modexpo<M2>(q, M2-2);

        ll h = (__int128(x) * M2 * M2inv  + __int128(y) * M1 * M1inv) % M12;
        sum = (sum + h) % M12;


        ans += ost.order_of_key({sum, n+1}) - ost.order_of_key({sum-n, -2}) ; // all (x,i) such that h-n <= x <= h

        ost.insert({sum, i});
    }

    cout<<ans<<endl;

    return 0;
}
/*
4
1 6
1 3
1 2
1 2


5
1 1
2 2
3 3
4 4
5 5


2
1 99999
99999 100000
*/