#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int gcd(int a, int b) {
    if (a > b) {
        return gcd(a - b, b);
    } else if (a < b) {
        return gcd(a, b - a);
    } else
        return a;

}

void SparseTable_Build(int *D, int** ST, int n) {
    int m = log2(n) + 1;
    int i = 0;
    while (i < n) {
        ST[i][0] = abs(D[i]);
        i++;
    }
    int j = 1;
    int x = 1;
    while (j < m) {
        i = 0;
        x *= 2;
        while (i <= n - x) {
            int y = x / 2;
            ST[i][j] = gcd(ST[i][j - 1], ST[i + y][j - 1]);
            i++;
        }
        j++;
    }
}

int SparseTable_Query(int** ST, int l, int r) {
    int j = log2(r - l + 1);
    int p = pow(2, j);
    return gcd(ST[l][j], ST[r - p + 1][j]);
}

int main()
{
    int n;
    scanf("%d", &n);
    int* D = (int*)malloc(n*sizeof(int));
    for (int i = 0; i < n; i++)
        scanf("%d", &D[i]);
    int b = log2(n) + 1;
    int** ST = (int**)calloc(n, sizeof(int*));
    for (int i = 0; i < n; i++)
        ST[i] = (int*)calloc(b, sizeof(int));
    SparseTable_Build(D, ST, n);
    int m;
    scanf("%d", &m);
    for (int i = 0; i < m; i++) {
        int l, r;
        scanf("%d%d", &l, &r);
        printf("%d\n", SparseTable_Query(ST, l, r));
    }
    for (int i = 0; i < n; i++)
        free(ST[i]);
    free(ST);
    free(D);
    return 0;
}