IOI Real Estate rents condominiums. The apartment room handled by this company is 1LDK, and the area is 2xy + x + y as shown in the figure below. However, x and y are positive integers.


Figure_Madori


In the IOI real estate catalog, the areas of condominiums are listed in ascending order (in ascending order), but it was found that some mistakes (those with an impossible area) were mixed in this.

The catalog (input file) has N + 1 lines, the number of rooms is written in the first line, and the area is written in ascending order, one room per line in the following N lines. However, the number of rooms is 100,000 or less, and the area is (2 to the 31st power) -1 = 2,147,483,647 or less. Up to 3 of the 5 input data have 1000 rooms or less and an area of ​​30000 or less.

Output the wrong number of lines (the number of impossible rooms).

In the output file, also include a line feed code on the last line of the output.





Examples

Input

10
4
7
9
10
12
13
16
17
19
20


Output

2


Input

None


Output

None

Difficulty: UNKNOWN_DIFFICULTY

Starter code:

Solutions:
def check(a):
	for i in range(2, int(a ** (1 / 2)) + 1):
		if a % i == 0:
			return 1
	return 0
n = int(input())
count = 0
for i in range(n):
	num = int(input())
	if check(2 * num + 1) == 0:
		count += 1
print(count)


a = 0
for _ in [0] * int(input()):
	n = int(input())
	for i in range(1, int(n ** 0.5) + 1):
		if (n - i) % (2 * i + 1) == 0:
			break
	else:
		a += 1
print(a)


def p(x):
	if x % 2 == 0:
		return 0
	for i in range(3, int(x ** 0.5 + 1), 2):
		if x % i == 0:
			return 0
	return 1

def f():
	print(sum((p(int(input()) * 2 + 1) for _ in [0] * int(input()))))
if '__main__' == __name__:
	f()


a = [int(input()) for _ in [0] * int(input())]
m = a[-1] + 1

def f(S):
	x = 1
	while 2 * x * -~x < m:
		if (S - x) % (2 * x + 1) == 0:
			return 0
		x += 1
	return 1
print(sum((f(S) for S in a)))


n = int(input())
ng = 0

def prime(a):
	if a == 1:
		return 1
	i = 3
	while i <= a / i:
		if a % i == 0:
			return 0
		i += 2
	return 1
for i in range(n):
	a = 2 * int(input()) + 1
	ng += prime(a)
print(ng)


def isAvailableAreas(area):
	ymax = int(area ** 0.5)
	for i in range(1, ymax + 1):
		if (area - i) % (2 * i + 1) == 0:
			return True
	return False
n = int(input())
A = []
for i in range(n):
	A.append(int(input()))
suma = 0
for i in A:
	if not isAvailableAreas(i):
		suma = suma + 1
print(suma)


def isOddPrime(n):
	for i in range(3, int(n ** 0.5) + 1, 2):
		if n % i == 0:
			return False
	return True
ans = 0
for i in range(int(input())):
	ans += isOddPrime(2 * int(input()) + 1)
print(ans)


a = 0
for _ in range(int(input())):
	n = int(input())
	for i in range(1, int(n ** 0.5) + 1):
		if (n - i) % (2 * i + 1) == 0:
			break
	else:
		a += 1
print(a)


def p(x):
	if x % 2 == 0:
		return 0
	for i in range(3, int(x ** 0.5 + 1), 2):
		if x % i == 0:
			return 0
	return 1
print(sum((p(int(input()) * 2 + 1) for _ in [0] * int(input()))))


def p(x):
	for i in range(3, int(x ** 0.5 + 1), 2):
		if x % i == 0:
			return 0
	return 1
print(sum((p(int(input()) * 2 + 1) for _ in [0] * int(input()))))


import sys
from sys import stdin
input = stdin.readline

def main(args):
	invalid_room = 0
	R = int(input())
	for _ in range(R):
		area = int(input())
		valid = False
		x = 1
		while 2 * (x ** 2 + x) <= area:
			if (area - x) % (2 * x + 1) == 0:
				valid = True
				break
			x += 1
		if valid is False:
			invalid_room += 1
	print(invalid_room)
main(sys.argv[1:])


def check(s):
	(u, v, x) = (3, 4, 1)
	while v <= s:
		if (s - x) % u == 0:
			return False
		u += 2
		x += 1
		v += x << 2
	return True
ans = 0
for i in range(int(input())):
	if check(int(input())):
		ans += 1
print(ans)


b = [1] * 500000
for i in range(3, 999, 2):
	if b[i // 2]:
		b[i * i // 2::i] = [0] * len(b[i * i // 2::i])

def p(x):
	if x < 5 * 100000.0:
		return b[x]
	x = 2 * x + 1
	for i in range(3, int(x ** 0.5 + 1), 2):
		if x % i == 0:
			return 0
	return 1
print(sum((p(int(input())) for _ in [0] * int(input()))))


prime = dict()
prime_nums = list()
MAXIMUM = 2 ** 16

def get_prime():
	for i in range(2, MAXIMUM):
		if prime.get(i, True):
			prime_nums.append(i)
			for j in range(i * 2, MAXIMUM, i):
				prime[j] = False

def check(x):
	x = 2 * x + 1
	for prime in prime_nums:
		if prime ** 2 > x:
			break
		if x % prime == 0:
			return False
	return True
get_prime()
n = int(input())
count = 0
for _ in range(n):
	if check(int(input())):
		count += 1
print(count)