N = 104

def C(n, k):
	if n < N:
		return 0
	ans = 1
	for i in range(n - k + 1, n + 1):
		ans *= i
	for i in range(1, k + 1):
		ans //= i
	return ans

p = [[1 for i in range(N)] for j in range(N)]

for i in range(1, N):
	for j in range(1, N):
		p[i][j] = p[i - 1][j] + p[i][j - 1]


t = int(input())
while t > 0:
	t -= 1
	m = int(input())
	ans = []
	for i in range(N):
		for j in range(N - i):
			if p[i][j] == m:
				ans.append([i + j, i]);
	for i in range(40):
		l = 0
		r = 10**15
		while (l + 1 < r):
			mid = (l + r) // 2
			if C(mid, i) <= m:
				l = mid
			else:
				r = mid
		if C(l, i) == m:
			ans.append([l, i])
			if 2 * i != l:
				ans.append([l, l - i])
	print(len(ans))
	ans = sorted(ans)
	for i in range(len(ans)):
		print(f'({ans[i][0]},{ans[i][1]})', end=" ")
	print()