// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 2e5;
int a;
long double t[N + 5];
map<pair<int, int>, int> mp;
struct s1 {
	const int mod = 1e9 + 7;
	int s[N + 5], inv[N + 5], tmp;
	void init() {
		tmp = 1;
		rep(i, 1, N) (tmp *= i) %= mod;
		inv[0] = inv[1] = 1;
		rep(i, 2, N) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
		rep(i, 1, N) (inv[i] *= tmp) %= mod;
	}
	void ins(int i, int x, int y) {
		// cout << inv[y] << endl;
		s[i] = (s[i - 1] + x * inv[y] % mod) % mod;
	}
	int get(int i, int x) {return (s[i] - x * tmp % mod + mod) % mod;}
} s1;
struct s2 {
	const int mod = 998244353;
	int s[N + 5], inv[N + 5], tmp;
	void init() {
		tmp = 1;
		rep(i, 1, N) (tmp *= i) %= mod;
		inv[0] = inv[1] = 1;
		rep(i, 2, N) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
		rep(i, 1, N) (inv[i] *= tmp) %= mod;
	}
	void ins(int i, int x, int y) {
		s[i] = (s[i - 1] + x * inv[y] % mod) % mod;
	}
	int get(int i, int x) {return (s[i] - x * tmp % mod + mod) % mod;}
} s2;

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a;
	mp[{0, 0}] = 1;
	int ans = 0, x, y;
	s1.init(), s2.init();
	rep(i, 1, a) {
		cin >> x >> y;
		t[i] = t[i - 1] + 1.0 * x / y;
		s1.ins(i, x, y);
		s2.ins(i, x, y);


		x = t[i];
		rep(j, x - 10, x + 10) if(mp.count({s1.get(i, j), s2.get(i, j)}))
		ans += mp[{s1.get(i, j), s2.get(i, j)}];

		// cout << ans << endl;
		++mp[{s1.get(i, x), s2.get(i, x)}];
	}
	// cout << s1.s[1] << endl;
	cout << ans;
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}