#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, P2 = 998244353, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e5 + 10;
int m, n, sqn, a[N], blo[N], L[N], R[N];
int g[N], cnt[N];
int main() {
  scanf("%d", &n), sqn = sqrt(n + 0.5);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i), blo[i] = (i - 1) / sqn + 1;
    L[i] = (blo[i] - 1) * sqn + 1;
    R[i] = blo[i] * sqn;
    g[blo[i]] = gcd(g[blo[i]], a[i]);
  }
  for (int i = 1; i <= n; ++i)
    if (a[i] == g[blo[i]]) ++cnt[blo[i]];
  scanf("%d", &m);
  while (m--) {
    int l, r, first = 0, ans = 0;
    scanf("%d%d", &l, &r);
    if (blo[l] == blo[r]) {
      for (int i = l; i <= r; ++i) first = gcd(first, a[i]);
      for (int i = l; i <= r; ++i) ans += a[i] == first;
    } else {
      for (int i = l; i <= R[l]; ++i) first = gcd(first, a[i]);
      for (int i = L[r]; i <= r; ++i) first = gcd(first, a[i]);
      for (int i = blo[l] + 1; i <= blo[r] - 1; ++i) first = gcd(first, g[i]);
      for (int i = l; i <= R[l]; ++i) ans += a[i] == first;
      for (int i = L[r]; i <= r; ++i) ans += a[i] == first;
      for (int i = blo[l] + 1; i <= blo[r] - 1; ++i)
        if (g[i] == first) ans += cnt[i];
    }
    printf("%d\n", r - l + 1 - ans);
  }
}
