A person is getting ready to leave and needs a pair of matching socks.  If there are $n$ colors of socks in the drawer, how many socks need to be removed to be certain of having a matching pair?  

Example
$n=2$  

There are $2$ colors of socks in the drawer.  If they remove $2$ socks, they may not match.  The minimum number to insure success is $3$.  

Function Description  

Complete the maximumDraws function in the editor below.  

maximumDraws has the following parameter:  

int n: the number of colors of socks  

Returns  

int: the minimum number of socks to remove to guarantee a matching pair. 

Input Format 

The first line contains the number of test cases, $\boldsymbol{\boldsymbol{t}}$. 

Each of the following $\boldsymbol{\boldsymbol{t}}$ lines contains an integer $n$.

Constraints 

$1\leq t\leq1000$ 

$0<n<10^6$  

Sample Input

2
1
2

Sample Output

2
3

Explanation 

Case 1 : Only 1 color of sock is in the drawer.  Any $2$ will match. 

Case 2 : 2 colors of socks are in the drawer. The first two removed may not match.  At least $3$ socks need to be removed to guarantee success.

Source: hackerrank | Difficulty: EASY
Tags: Mathematics


Solutions:
t = int(input())
for i in range(t):
	n = int(input())
	print(n + 1)


n = int(input())
for i in range(n):
	socks = int(input())
	print(socks + 1)


n = int(input())
for i in range(n):
	k = int(input())
	print(k + 1)


testcase = int(input())
for x in range(testcase):
	print(int(input()) + 1)


import sys
import math
t = int(sys.stdin.readline())
while t:
	t -= 1
	n = int(sys.stdin.readline())
	print(n + 1)


cases = int(input())
i = 0
result = []
while i < cases:
	pairs = int(input())
	temp = pairs + 1
	result.append(temp)
	i += 1
i = 0
while i < cases:
	print(result[i])
	i += 1


import sys
T = int(sys.stdin.readline())
for t in range(T):
	N = int(sys.stdin.readline())
	print(N + 1)


tests = int(input())
for test in range(tests):
	n = int(input())
	print(n + 1)


def sock(x):
	n = x + 1
	print(n)
x = int(input())
for i in range(0, x):
	y = int(input())
	sock(y)


import sys
data = sys.stdin.readlines()
A = []
for element in data:
	A.append(element.split())
for i in range(1, int(A[0][0]) + 1):
	x = int(A[i][0]) + 1
	print(x)


n = int(input())
for i in range(n):
	l = int(input())
	print(1 + l)


t = int(input())
draws = []
for i in range(0, t):
	n = int(input())
	draws.append(str(n + 1))
print('\n'.join(draws))


T = int(input())
for i in range(T):
	print(int(input()) + 1)


t = int(input())
for i in range(0, t):
	print(int(input()) + 1)


T = int(input().strip())
for i in range(T):
	N = int(input().strip())
	print(N + 1)


num_testcases = int(input())
num_pairs = []
for i_testcase in range(num_testcases):
	num_pairs.append(int(input()))
for i_testcase in range(num_testcases):
	print(num_pairs[i_testcase] + 1)


T = int(input())
for i in range(T):
	N = int(input())
	print(N + 1)


for i in range(int(input())):
	a = int(input())
	print(a + 1)


t = int(input())
for i in range(0, t):
	n = int(input())
	n = n + 1
	print(n)


N = []
T = int(input())
for i in range(T):
	N.append(int(input()))
for i in N:
	print(i + 1)


T = int(input())
for i in range(T):
	print(int(input()) + 1)


T = int(input())
for i in range(T):
	pairs = int(input())
	print(pairs + 1)


var = input()
draws = []
for x in range(int(var)):
	socks = str(int(input()) + 1)
	draws.append(socks)
for i in draws:
	print(i)


def socks(s):
	return s + 1
n = int(input())
for i in range(0, n):
	s = int(input())
	print(socks(s))


for case in range(int(input())):
	print(1 + int(input()))


T = int(input())
for t in range(0, T):
	print(int(input()) + 1)


import sys
number_list = []
for number in sys.stdin.readlines():
	number_list.append(int(number))
del number_list[0]
for pairs in number_list:
	print(pairs + 1)


count = int(input())
arr = [int(input()) for i in range(count)]
for a in arr:
	print(a + 1)


import sys
T = int(sys.stdin.readline())
for _ in range(T):
	N = int(sys.stdin.readline())
	print(N + 1)


for i in range(int(input())):
	print(int(input()) + 1)


t = int(input())
for i in range(t):
	print(int(input()) + 1)


import sys
n = int(sys.stdin.readline())
for i in range(n):
	pairs = int(sys.stdin.readline())
	sys.stdout.write('{}\n'.format(pairs + 1))


testcases = int(input())
for i in range(testcases):
	print(int(input()) + 1)


for k in range(int(input())):
	print(int(input()) + 1)


T = int(input())
for i in range(T):
	N = int(input())
	worst = N + 1
	print(worst)


t = int(input())
for i in range(0, t):
	p = int(input())
	print(p + 1)


x = int(input())
for i in range(0, x):
	n = int(input())
	print(n + 1)


T = int(input())

def num_draws(pairs):
	return pairs + 1
for tc in range(T):
	pairs = int(input())
	print(num_draws(pairs))


import sys
next(sys.stdin)
for line in sys.stdin:
	print(int(line.strip()) + 1)


t = int(input())
for i in range(t):
	n = int(input())
	print(n + 1)


numtests = int(input())
pairs = []
for i in range(numtests):
	pairs.append(int(input()))
for i in range(numtests):
	print(pairs[i] + 1)


import sys

def main():
	t = int(sys.stdin.readline())
	for _ in range(t):
		pairs = int(sys.stdin.readline())
		print(pairs + 1)
main()


T = int(input())
for t in range(T):
	n = int(input())
	print(n + 1)


import sys
numtests = int(sys.stdin.readline().strip())
while numtests > 0:
	print(int(sys.stdin.readline().strip()) + 1)
	numtests -= 1


T = int(input())
test = [None] * T
for j in range(T):
	test[j] = int(input())
for j in range(T):
	print(test[j] + 1)


t = int(input())
for num in range(t):
	n = int(input())
	print(n + 1)


for i in range(int(input())):
	print(1 + int(input()))


T = int(input())
for i in range(T):
	n = int(input())
	print(n + 1)


T = int(input())
for i in range(0, T):
	N = int(input())
	answer = N + 1
	print(answer)


t = int(input())
[print(int(input()) + 1) for i in range(t)]


numCases = int(input())
for _ in range(numCases):
	print(int(input()) + 1)


N = int(input())
for i in range(N):
	print(int(input()) + 1)


t = int(input())
for each_case in range(0, t):
	N = int(input())
	print(N + 1)


def prog():
	for i in range(int(input())):
		print(int(input()) + 1)
prog()


T = int(input())
for i in range(T):
	print(int(input()) + 1)


T = int(input())
for i in range(T):
	N = int(input())
	print(N + 1)


T = int(input())
for i in range(T):
	n_pair = int(input())
	print(n_pair + 1)


for i in range(int(input())):
	numSocks = int(input())
	print(numSocks + 1)


cases = int(input())
data = []
for i in range(cases):
	data.append(int(input()))
for num in data:
	print(int(num + 1))


t = int(input())
for i in range(t):
	n = int(input())
	print(n + 1)


t = int(input())
for _ in range(t):
	print(int(input()) + 1)


for i in range(int(input())):
	print(1 + int(input()))


t = int(input())
for i in range(t):
	print(int(input()) + 1)


for i in range(int(input())):
	print(int(input()) + 1)


cases = int(input())
for i in range(cases):
	print(int(input()) + 1)


T = int(input())
for i in range(T):
	print(int(input()) + 1)


x = int(input())
for y in range(0, x):
	k = int(input()) + 1
	print(k)


import sys
data = [int(x) for x in sys.stdin.read().strip().split()]
for x in data[1:]:
	print(x + 1)


def tc(n):
	print(int(n + 1))
t = int(input())
for i in range(t):
	tc(int(input()))


def main():
	t = int(input())
	while t != 0:
		t = t - 1
		p = int(input())
		print(p + 1)
main()


T = int(input())
for _ in range(T):
	print(int(input()) + 1)


import sys
T = int(sys.stdin.readline().strip())
for t in range(T):
	N = int(sys.stdin.readline().strip())
	print(N + 1)


t = int(input())
while t > 0:
	n = int(input())
	draws = n + 1
	print(draws)
	t -= 1


test = int(input())
for i in range(test):
	a = int(input())
	print(a + 1)


n = int(input())
for i in range(n):
	print(int(input()) + 1)


def mindraw(nop):
	return nop + 1
for t in range(int(input())):
	nop = int(input())
	print(mindraw(nop))


T = int(input())
for i in range(T):
	N = int(input())
	answer = N + 1
	print(answer)


for _ in range(int(input())):
	print(int(input()) + 1)


n = int(input())
x = []
for i in range(n):
	inp = int(input())
	x.append(inp)
for j in range(len(x)):
	print(1 + x[j])


T = int(input(''))
for i in range(T):
	N = int(input(''))
	print(N + 1)


T = int(input())
while T:
	N = int(input())
	print(N + 1)
	T -= 1


T = int(input())
for _ in range(T):
	print(int(input()) + 1)


import sys
next(sys.stdin)
for num_pairs in sys.stdin:
	num_pairs = int(num_pairs.strip())
	if num_pairs == 0:
		print(0)
	else:
		print(num_pairs + 1)


for i in range(int(input())):
	print(int(input()) + 1)


try:
	no_draw = int(input())
	lines = 0
	while lines < no_draw:
		try:
			print(int(input()) + 1)
			lines += 1
		except ValueError:
			print('Oops!  That was no valid number of sockes.  Try again...')
except ValueError:
	print('Oops!  Incorrect numver of draws.')


t = int(input())
for i in range(t):
	print(int(input()) + 1)


for _ in range(int(input())):
	print(int(input()) + 1)


numCases = int(input())
for i in range(0, numCases):
	numPairs = int(input())
	numDraws = numPairs + 1
	print(numDraws)


cases = int(input())
for x in range(cases):
	pairs = int(input())
	socks = pairs * 2
	print(int(socks / 2 + 1))


tests = int(input())
for i in range(0, tests):
	print(int(input()) + 1)


n = int(input())
for _ in range(n):
	print(int(input()) + 1)


for i in range(int(input())):
	print(int(input()) + 1)


t = int(input())
for caset in range(t):
	n = int(input())
	print(n + 1)


num = int(input())
for case in range(0, num):
	print(int(input()) + 1)


t = int(input())
for i in range(t):
	n = int(input())
	print(n + 1)


import os
import sys

def main():
	n = []
	t = sys.stdin.readline()
	if int(t) < 1 or int(t) > 1000:
		print('invalid t %', t)
		exit()
	n = sys.stdin.readlines()
	for line in n:
		if int(line) < 1 or int(line) >= 1000000:
			print('invalid n %', line)
			exit()
	for i in n:
		x = int(i) + 1
		print(str(x))
main()


for i in range(int(input())):
	print(int(input()) + 1)


numoftimes = int(input())
for i in range(numoftimes):
	item = int(input())
	item = item + 1
	print(item)