#include <bits/stdc++.h>

const int maxn = 1e5 + 1;
const int base1 = 13331;
const int mod1 = 1e9 + 7;
const int base2 = 233;
const int mod2 = 1e9 + 9;
using pii = std::pair<int, int>;

pii operator +(const pii &a, const pii &b) {
    return {(a.first + b.first) % mod1, (a.second + b.second) % mod2};
}

pii operator -(const pii &a, const pii &b) {
    return {(a.first - b.first + mod1) % mod1, (a.second - b.second + mod2) % mod2};
}

pii operator *(const pii &a, const pii &b) {
    return {(1LL * a.first * b.first) % mod1, (1LL * a.second * b.second) % mod2};
}

void solve(){
    int n;
    std::cin >> n;
    std::vector<std::priority_queue<int> > pq(maxn);
    std::vector<int> cnt(maxn);
    std::vector factor(maxn, std::vector<int>());
    std::vector<pii> pw(maxn);
    pw[0] = {1, 1};
    for (int i = 1; i < maxn; i += 1) {
        pw[i] = pw[i - 1] * pii(base1, base2);
    }
    pii h = {0, 0};
    for (int i = 1; i < maxn; i += 1) {
        for (int j = i + i; j < maxn; j += i) {
            factor[j].push_back(i);
        }
    }
    auto add = [&](int x, int c) {
        h = h - pw[x] * pii(cnt[x], cnt[x]);
        cnt[x] = (cnt[x] + x + c % x) % x;
        h = h + pw[x] * pii(cnt[x], cnt[x]);
    };

    std::map<pii, int> mp;
    mp[h] = 1;
    long long res = 0;
    for (int i = 1; i <= n; i += 1) {
        int x, c;
        std::cin >> c >> x;
        int last = x;
        bool nice = false;
        while(true) {
            if (pq[last].empty()) {
                break;
            }
            int y = pq[last].top();
            if (cnt[y] == 0) {
                pq[last].pop();
                continue;
            }
            add(y, c * (y / x));
            last = y;
            nice = true;
            break;
        }
        if (not nice) {
            add(last, c);
        }
        else {
            while(true) {
                if (cnt[last] == 0) {
                    break;
                }
                int g = std::gcd(last, cnt[last]);
                if (g == 1) {
                    break;
                }
                add(last / g, cnt[last] / g);
                add(last, -cnt[last]);
                last /= g;
            }
        }
        if (cnt[last]) {
            for (auto g : factor[last]) {
                pq[g].push(last);
            }
        }
        res += mp[h];
        mp[h] += 1;
        // std::cout << i << "\n";
        // for (int j = 1; j <= 20; j += 1) {
        //     if (cnt[j]) {
        //         std::cout << "(" << j << ", " << cnt[j] << ") ";
        //     }
        // }
        // std::cout << "\n";
        // std::cout << h.first << " " << h.second << "\n";
    }
    std::cout << res << "\n";
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    solve();
    return 0;
}