221006

# sum = 0
# n = int(input())
# y = input().split()
#
# for i in range(len(y)):
#     y[i] = int(y[i])
#     if y[i] % 2 == 0:
#         sum += 1
# print(sum)

# sum = 0
# n = int(input())
# for i in range(n+1):
#     if i % 10 == 1:
#         sum += 1
# print(sum)

# sum = 0
# n = int(input())
# y = input().split()
# max = -9999999
# for i in range(len(y)):
#     y[i] = int(y[i])
#     if max < y[i]:
#         max = y[i]
# print(max)
# y.sort()
# print(y[len(y)-1])

# n = int(input())
# for i in range(1, n+1):
#     if n%i == 0:
#         print(i, end=' ')

# sum = 0
# n = int(input())
# for i in range(1, n+1):
#     if n%i == 0:
#         sum += 1
#
# if sum == 2:
#     print('prime')
# else:
#     print('not prime')

# n, k = input().split()
# n=int(n)
# k=int(k)
# print(n**k)

# sum = 0
# n = int(input())
#
# for i in range(9999999999):
#     n //= 10
#     sum += 1
#     if n== 0:
#         break
# print(sum)

# sum = 0
# a, b = input().split()
# a=int(a)
# b=int(b)
# for i in range (a, b+1):
#     if i%2==0:
#         sum -= i
#         print('-', i, sep='', end='')
#     else:
#         sum += i
#         print('+', i, sep='', end='')
# print('=', sum, sep='')

# n = int(input())
# for i in range(1, 1000000000):
#     if i*i >= n:
#         print(n-((i-1)*(i-1)), i-1)
#         break

# array: List
# Linked List
# [Data:Link]

# data = []
# print(type(data))
#
# data.append(10)
# data.append(5)
# data.append(30)
#
# print(data)
# data.sort()
# print(data)
# data.append('HELLO')
# print(data)
# data.append([10, 20, 30])
# print(data)

# data = []
# data.append([1, 2, 3])
# data.append([4, 5, 6])
# data.append([7, 8, 9])
# print(data)
#
# for i in range(len(data)):
#     for j in range(len(data[i])):
#         print(data[i][j], end=' ')
#     print()

# def d_b():
#     print('HELLO!')
#
# def oo():
#     print('WORLD')
#
# def sum(x, y):
#     print('summation result is', end='>>>')
#     return x+y
# x, y = input().split()
# x = int(x)
# y = int(y)
# print(sum(x, y))

# import matplotlib.pyplot as plt
# plt.plot([10, 5, 20, 4])
# plt.plot([20, 30, 40, 10])
# plt.show()

# x=int(input())
# y=input().split()
#
# for j in range(x):
#     for i in range(len(y)):
#         print(y[(i+j)%x], end=' ')
#     print()
#
# def draw(x, data):
#     for i in range(x):
#         for j in range(x):
#             print(data[(i+j)%x], end=' ')
#         print()
# x = int(input())
# y = input().split()
# draw(x, y)

# a, n, d = input().split()
# a=int(a)
# n=int(n)
# d=int(d)
# print(a+(d-1)*d)

# a, d, n = input().split()
# a=int(a)
# d=int(d)
# n=int(n)
# for i in range(n-1):
#     a += d
#
# print(a)

# a, r, n = input().split()
# a=int(a)
# r=int(r)
# n=int(n)
# for i in range (n-1):
#     a *= r
# print(a)

# a, m, d, n = input().split()
# a=int(a)
# m=int(m)
# d=int(d)
# n=int(n)
# for i in range (n-1):
#     a = (a * m + d)
# print(a)

# tree = [[None], ['그'], ['느'], ['드'], ['르'], ['므'], ['브'], ['스'], ['으'], ['즈'], ['츠'], ['크'], ['트'], ['프'], [None], [None], ['흐']  ]
#
# def sub( p ):
#     if p >= len(tree):
#         return
#
#     # print(tree[p][0], end=' ')
#     sub(p*2)
#     # print(tree[p][0], end=' ')
#     sub(p*2+1)
#     print(tree[p][0], end=' ')
#
# sub(1)

# class Graph():
#     def __init__(self, size) :
#         self.SIZE = size
#         self.graph = [[0 for i in range(size)]for j in range(size)]
#
#     def draw(self, x, y):
#         self.graph[x][y] = 1
#         self.graph[y][x] = 1
#
#     def view(self):
#         for row in range(len(self.graph)):
#             for col in range (len(self.graph[row])):
#                 print(G1.graph[row][col], end=' ')
#             print()
#
# G1 = Graph(6)
#
# G1.draw(0, 1)
# G1.draw(0, 4)
# G1.draw(0, 3)
# G1.draw(1, 3)
# G1.draw(4, 3)
# G1.draw(1, 5)
# G1.draw(3, 5)
# G1.draw(3, 2)
# G1.draw(4, 2)
# G1.draw(2, 5)
#
# G1.view()

# x = int(input())
# y = input().split()
# x=int(x)
#
# d = []
#
# for i in range(24):
#     d.append(0)
#
# for i in range(x):
#     d[int(y[i])] += 1
#
# for i in range(1, 24):
#     print(d[i], end=' ')

# k = int(input())
# n = input().split()
# max = 10000000
# for i in range(len(n)):
#     n[i] = int(n[i])
#     if max > n[i]:
#         max = n[i]
# print(max)

# n = int(input())
# k = input().split()
# for i in range(len(k)-1, -1, -1):
#     print (k[i], end= ' ')

# size = 19
# graph = [[0 for i in range(size)]for j in range(size)]
#
# for i in range(len(graph)):
#     for j in range(len(graph[i])):
#         print(graph[i][j], end=' ')
#     print()

# n = int(input())
# x,y = input().split()
# n=int(n)
# x=int(x)
# y=int(y)
# size = 19
# graph = [[0 for i in range(size)]for j in range (size)]
# for i in range (len(graph)):
#     for j in range(len(graph[i])):

# n = int(input())
# n=int(n)
# size = 21
# d=[]
# graph = [[0 for i in range(size)]for j in range (size)]
#
# for i in range(n):
#     x,y = input().split()
#     x=int(x)
#     y=int(y)
#     graph[x][y] = 1
# for i in range(1, 20):
#     for j in range(1, 20):
#         print(graph[i][j], end=' ')
#     print()

# h, w = input().split()
#
# h = int(h)
# w = int(w)
# graph = [[0 for i in range(w)]for j in range(h)]
#
# n = int(input())
#
# for z in range (n):
#     l, d, x, y = input(). split()
#     l = int(l)
#     d = int(d)
#     x = int(x)
#     y = int(y)
#
#     x -= 1
#     y -= 1
#
#     for i in range(l):
#         if d == 0:
#             graph[x][y+i] = 1
#         elif d == 1:
#             graph[x+i][y] = 1
#
# for i in range(h):
#     for j in range(w):
#         print(graph[i][j], end=' ')
#     print()

# def sum(a, b):
#     print(a + b)
#
# sum(10, 20)
# sum(50, 40)

# Object:
# class vO_oV():
#     def __init__(self):
#         print('Initialize')
#         self.data = []
#         for i in range(10):
#             self.data.append(0)
#         self.write()
#
#     def write(self):
#         print('Need a TW', len(self.data))
#
#     def __del__(self):
#         print('Destroyed')
#
# x = vO_oV()
# x.write()


# class OUO:
#     def __init__(self, x):
#         for i in range(n):
#             print('*'* x)
#
# n = int(input())
# x = OUO(n)

class h:
    def __init__(self,number,mat):
        self.number=number
        self.mat=mat
        self.box=[]
        for i in range (n+1):
            self.box.append(0)
    def proc (self):
        for i in range(len(self.mat)):
            self.x = self.mat[i]
            self.box[self.x] = 1

        for i in range(1, self.number+1):
            if self.box[i] == 0:
                self.result(i)
    def result(self,checkit):
        print(checkit)