#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 100);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
void pr(long long x) { cout << x; }
void prl(long long x) { cout << x << "\n"; }
long long cbrt(long long x) {
  long long lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
long long XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
long long YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
const long long N = (long long)(1 * 1e5 + 5);
bool isPowerOfTwo(long long x) { return x && (!(x & (x - 1))); }
set<long long> vec[N];
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long t = 1;
  while (t--) {
    long long n;
    cin >> n;
    for (long long i = 1; i <= N - 2; i++) {
      for (long long j = 1; j * j <= i; j++) {
        if (i % j == 0) {
          vec[i].insert(j);
          vec[i].insert(i / j);
        }
      }
    }
    long long freq[N];
    memset(freq, 0, sizeof(freq));
    long long cnt = 0;
    for (long long i = 1; i <= n; i++) {
      cnt = 0;
      long long x, y;
      cin >> x >> y;
      for (auto it : vec[x]) {
        if (freq[it] < (i - y)) cnt++;
        freq[it] = i;
      }
      cout << cnt << "\n";
    }
  }
}
