2024.01.06

# # 변수 status# # empty## class queue:#     def __init__(self):#         self.status = False#         self.Q = []#         for i in range(5):#             self.Q.append(' ')#         self.f = 0#         self.r = 0##     def push(self, m):#         if self.r != self.f or self.status != True:#             self.Q[self.r] = m#             self.r += 1#             self.r %= 5#             self.status = True##     def pop(self):#         if self.r != self.f or self.status != False:#             self.Q[self.f] = ' '#             self.f += 1#             self.f %= 5#             self.status = False##     def view(self):#         v = [0, 0, 0, 0, 0]#         for i in range(5):#             v[i] = self.Q[(i+self.f)%5]#         print(v)##     def is_full(self):#         if self.r == self.f and self.status == True:#             print('True')#         else:#             print('False')####     def is_empty(self):#         if self.r == self.f and self.status == False:#             print('True')#         else:#             print('False')### k = queue()## while(True):#     s = input()#     if s.__contains__('push'):#         k.push(int(s[5:-1]))#     elif s.__contains__('pop'):#         k.pop()#     elif s.__contains__('view'):#         k.view()#     elif s.__contains__('is_full'):#         k.is_full()#     elif s.__contains__('is_empty'):#         k.is_empty()###n = int(input())v = [0]while True:    if v[0] == 0:        v[0] = 1    else:        v.append(0)    k = v    k.reverse()    s = ''    for i in range(len(k)):         s += str(k[i])    s = int(s)    if s % n == 0:        print(s)        break    if s > 4294967295:        print(0)