#include<bits/stdc++.h>
using namespace std;
const int mod1 = 1e9 + 7, mod2 = 998244353;
int Add(int x, int y, int mod) {
    return (x += y) >= mod ? x - mod : x;
}
int Sub(int x, int y, int mod) {
    return (x -= y) < 0 ? x + mod : x;
}
int Mul(int x, int y, int mod) {
    return 1ll * x * y % mod;
}
int Pow(int x, int y, int mod) {
    int res = 1;
    for(; y; x = Mul(x, x, mod), y >>= 1)
        if(y & 1)
            res = Mul(res, x, mod);
    return res;
}
const int maxn = 2e5 + 5;
int n, a[maxn], b[maxn];
map<long long, int> cnt;
int main() {
    scanf("%d", &n);
    for(int i = 1, p, q; i <= n; ++ i) {
        scanf("%d%d", &p, &q);
        a[i] = Add(a[i - 1], Mul(p, Pow(q, mod1 - 2, mod1), mod1), mod1);
        b[i] = Add(b[i - 1], Mul(p, Pow(q, mod2 - 2, mod2), mod2), mod2);
    }
    long long ans = 0;
    for(int i = 0; i <= n; ++ i) {
        for(int j = 0; j < 4; ++ j) {
            long long diff = b[i] - a[i];
            if(j & 1)
                diff -= mod1;
            if(j & 2)
                diff += mod2;
            if(cnt.count(diff))
                ans += cnt[diff];
        }
        ++ cnt[b[i] - a[i]];
    }
    printf("%lld\n", ans);
}