Problem: Mrs. Hudson hasn't made her famous pancakes for quite a while and finally she decided to make them again. She has learned m new recipes recently and she can't wait to try them. Those recipes are based on n special spices. Mrs. Hudson has these spices in the kitchen lying in jars numbered with integers from 0 to n - 1 (each spice lies in an individual jar). Each jar also has the price of the corresponding spice inscribed — some integer ai.

We know three values for the i-th pancake recipe: di, si, ci. Here di and ci are integers, and si is the pattern of some integer written in the numeral system with radix di. The pattern contains digits, Latin letters (to denote digits larger than nine) and question marks. Number x in the di-base numeral system matches the pattern si, if we can replace question marks in the pattern with digits and letters so that we obtain number x (leading zeroes aren't taken into consideration when performing the comparison). More formally: each question mark should be replaced by exactly one digit or exactly one letter. If after we replace all question marks we get a number with leading zeroes, we can delete these zeroes. For example, number 40A9875 in the 11-base numeral system matches the pattern "??4??987?", and number 4A9875 does not.

To make the pancakes by the i-th recipe, Mrs. Hudson should take all jars with numbers whose representation in the di-base numeral system matches the pattern si. The control number of the recipe (zi) is defined as the sum of number ci and the product of prices of all taken jars. More formally: <image> (where j is all such numbers whose representation in the di-base numeral system matches the pattern si).

Mrs. Hudson isn't as interested in the control numbers as she is in their minimum prime divisors. Your task is: for each recipe i find the minimum prime divisor of number zi. If this divisor exceeds 100, then you do not have to find it, print -1.

Input

The first line contains the single integer n (1 ≤ n ≤ 104). The second line contains space-separated prices of the spices a0, a1, ..., an - 1, where ai is an integer (1 ≤ ai ≤ 1018).

The third line contains the single integer m (1 ≤ m ≤ 3·104) — the number of recipes Mrs. Hudson has learned. 

Next m lines describe the recipes, one per line. First you are given an integer di, written in the decimal numeral system (2 ≤ di ≤ 16). Then after a space follows the si pattern — a string from 1 to 30 in length, inclusive, consisting of digits from "0" to "9", letters from "A" to "F" and signs "?". Letters from "A" to "F" should be considered as digits from 10 to 15 correspondingly. It is guaranteed that all digits of the pattern (including the digits that are represented by letters) are strictly less than di. Then after a space follows an integer ci, written in the decimal numeral system (1 ≤ ci ≤ 1018).

Please do not use the %lld specificator to read or write 64-bit integers in С++, in is preferred to use cin, cout, strings or the %I64d specificator instead.

Output

For each recipe count by what minimum prime number the control number is divided and print this prime number on the single line. If this number turns out larger than 100, print -1.

Examples

Input

1
1
1
2 ? 1


Output

2


Input

4
2 3 5 7
4
2 ?0 11
2 ?1 13
2 0? 17
2 1? 19


Output

3
2
23
2


Input

1
1000000000000000000
1
16 ?????????????? 1


Output

-1

Note

In the first test any one-digit number in the binary system matches. The jar is only one and its price is equal to 1, the number c is also equal to 1, the control number equals 2. The minimal prime divisor of 2 is 2.

In the second test there are 4 jars with numbers from 0 to 3, and the prices are equal 2, 3, 5 and 7 correspondingly — the first four prime numbers. In all recipes numbers should be two-digit. In the first recipe the second digit always is 0, in the second recipe the second digit always is 1, in the third recipe the first digit must be 0, in the fourth recipe the first digit always is 1. Consequently, the control numbers ​​are as follows: in the first recipe 2 × 5 + 11 = 21 (the minimum prime divisor is 3), in the second recipe 3 × 7 + 13 = 44 (the minimum prime divisor is 2), in the third recipe 2 × 3 + 17 = 23 (the minimum prime divisor is 23) and, finally, in the fourth recipe 5 × 7 + 19 = 54 (the minimum prime divisor is 2).

In the third test, the number should consist of fourteen digits and be recorded in a sixteen-base numeral system. Number 0 (the number of the single bottles) matches, the control number will be equal to 1018 + 1. The minimum prime divisor of this number is equal to 101 and you should print -1.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mo[] = {2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23, 29 * 31 * 37,
                  41 * 43 * 47 * 53 * 59, 61 * 67 * 71 * 73, 79 * 83 * 89 * 97};
long long a[12000], o;
int *f[18][5], d, num[20], b[44], n, i, j, s, k, m, l, t;
char c[120];
bool prime(int x) {
  for (int i = 2; i * i <= x; ++i)
    if (x % i == 0) return 0;
  return 1;
}
int ch(char c) {
  if (c == '?') return d;
  if (c <= '9') return c - 48;
  return c - 65 + 10;
}
int dfs(int d, int o) {
  int t = 0, i, j;
  for (i = 1; i <= num[d]; ++i) t = t * (d + 1) + b[i];
  if (f[d][o][t] != -1) return f[d][o][t];
  f[d][o][t] = 1;
  for (i = 1; i <= num[d]; ++i)
    if (b[i] == d) {
      for (j = 0; j < d; ++j) {
        b[i] = j;
        f[d][o][t] = ((long long)f[d][o][t] * dfs(d, o)) % mo[o];
      }
      b[i] = d;
      break;
    }
  if (i > num[d]) {
    int res = 0;
    for (i = 1; i <= num[d]; ++i) res = res * d + b[i];
    if (res < n) f[d][o][t] = a[res] % mo[o];
  }
  return f[d][o][t];
}
int main() {
  scanf("%d", &n);
  for (i = 0; i < n; ++i) scanf("%I64d", &a[i]);
  for (i = 2; i <= 16; ++i) {
    for (j = i, num[i] = 1, s = i + 1; j < n; j *= i, num[i]++, s *= i + 1)
      ;
    for (j = 0; j < 5; ++j) {
      f[i][j] = new int[s + 10];
      for (k = 0; k <= s; ++k) f[i][j][k] = -1;
    }
  }
  scanf("%d", &m);
  for (i = 1; i <= m; ++i) {
    scanf("%d%s%I64d", &d, c + 1, &o);
    l = strlen(c + 1);
    t = 0;
    for (j = 1; j <= num[d]; ++j) {
      if (j - num[d] + l < 1)
        b[j] = 0;
      else
        b[j] = ch(c[j - num[d] + l]);
      t = t * (d + 1) + b[j];
    }
    for (j = 0; j < 5; ++j) dfs(d, j);
    for (j = 2; j <= 100; ++j)
      if (prime(j)) {
        for (k = 0; k < 5; ++k)
          if (mo[k] % j == 0 && (f[d][k][t] + o) % j == 0) {
            printf("%d\n", j);
            goto win;
          }
      }
    printf("-1\n");
  win:;
  }
}