def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

a = int(input())
lst = list(map(int, input().split()))[:a]
m = int(input())
ans = []

for _ in range(m):
    l, r = map(int, input().split())
    count = 0
    for i in lst[l : r + 1]:
        temp = i
        if is_prime(temp // 10) and is_prime(temp // 100):
            for j in range(1, 10):
                if is_prime(i * 10 + j):
                    count += 1
                    break
        else:
            pass
    ans.append(count)

for i in ans:
    print(i)