DDunDDuns

#1003 피보나치 함수
N = int(input())
test_case = []
for i in range(N):
test_case.append(int(input()))

F = [0 for i in range(41)]


def fibo(N):
F[0] = (1, 0)
F[1] = (0, 1)
for i in range(2, 41):
a, b = F[i - 2]
c, d = F[i - 1]
F[i] = (a + c, b + d)
return F[N][0], F[N][1]


for i in test_case:
a, b = fibo(i)
print(a, b)

#백준 2839 설탕배달(DP)
#3 <= N <= 5000
N = int(input())

def min_num(N):
num = 0
while(True):
if(N % 5 != 0 and N >= 3):
N = N - 3
num += 1
if(N == 0):
break
elif(N % 5 == 0):
num += (N // 5)
break
if(N < 3):
return -1
return num

print(min_num(N))

n = int(input()) #출입기록의 수(출,퇴근)
dic = dict()
for i in range(n):
name, log = input().split(" ")
if(log == "enter"):
dic[name] = True #enter인 경우 
else:
del dic[name]  #leave인 경우

print("\n".join(sorted(dic.keys(), reverse = True)))

num = int(input())
array = []
for i in range(num):
array.append(int(input()))

cnt = 0
for i in range(len(array)):
for j in range(1, array[i]):
if (array[i] - j) % (2 * j + 1) == 0:
cnt += 1
break

print(len(array) - cnt)

array = []
sum = 0
for i in range(9):
array.append(int(input()))
sum += array[i]
array = sorted(array)
sub = sum - 100 #over length

for i in range(9):
if len(array) == 7:
break
for j in range(i + 1, 9):
if array[i] + array[j] == sub:
del array[i]
del array[j-1]
break

for k in range(len(array)):
print(array[k])

n = []
k = []
while True:
try:
line = input()
except EOFError:
break
a, b = line.split(" ")
n.append(int(a))
k.append(int(b))

cnt_array = []

for i in range(len(n)):
nc = n[i] #now coupon
need = k[i] #need dozang
cnt = nc
while((nc - need) >= 0):
nc = nc - need + 1
cnt += 1
cnt_array.append(cnt)

for j in range(len(cnt_array)):
print(cnt_array[j])