Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "class CodeforcesTask408ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.cash_count = 0\r\n self.client_cashwise = []\r\n self.baskets = []\r\n\r\n def read_input(self):\r\n self.cash_count = int(input())\r\n self.client_cashwise = [int(x) for x in input().split(\" \")]\r\n for x in range(self.cash_count):\r\n self.baskets.append([int(x) for x in input().split(\" \")])\r\n\r\n def process_task(self):\r\n times = [len(x) * 15 + 5 * sum(x) for x in self.baskets]\r\n self.result = str(min(times))\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask408ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n = int(input())\nbest_answer = 999999999\nrandom_numbers = input()\n\nfor i in range(n):\n\tqueue = [int(x) for x in input().split(' ')]\n\tbest_answer = min(best_answer, sum(queue)*5 + len(queue)*15)\n\nprint(best_answer)\n", "\r\ndef solve():\r\n n = int(input())\r\n ak = [int(i) for i in input().split()]\r\n ans = float(\"inf\")\r\n for i in range(n):\r\n a = [int(k) for k in input().split()]\r\n s = 0\r\n for j in range(len(a)):\r\n s+=a[j]*5\r\n s+=15*ak[i]\r\n ans = min(ans,s)\r\n print(ans)\r\n return\r\n\r\n\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()", "n=int(input())\r\nk=list(map(int,input().split()))\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n val=sum(a)*5+k[i]*15\r\n if(i==0):\r\n m=val\r\n else:\r\n if(m>val):\r\n m=val\r\nprint(m)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[15*l[x]+sum(list(map(int,input().split())))*5 for x in range(n)]\r\nprint(min(k))", "N = int(input())\n\ncashiers = []\nK_unused = input().split()\nfor i in range(N):\n qu_sum = 0\n tmp = list(map(int, input().split()))\n queue = len(tmp)\n for e in tmp:\n qu_sum += (e*5) + 15\n cashiers.append(qu_sum)\n\nprint(min(cashiers))\n", "# Link: http://codeforces.com/problemset/problem/408/A\n# Love you Atreyee my life. I cannot live without you. \nn = int(input()) #no of cashier\nk = list(map(int, input().rstrip().split())) #Number of people in queue\nmat = []\nfor i in range(n):\n a = list(map(int, input().rstrip().split()))\n mat += [sum(a) * 5 + k[i] * 15]\nprint(min(mat))\n\n\n\n", "n = int(input())\n\npeople = list(map(int,input().split()))\n\nmin = 10**9\n\nfor i in range(n):\n arr = list(map(int,input().split()))\n time = sum(arr)*5 + len(arr)*15\n\n if time<min:\n min = time\n\nprint(min)\n", "n = int(input())\r\nk = map(int, input().split())\r\ntimes = []\r\nfor i in range(n):\r\n people = list(map(int, input().split()))\r\n time = len(people) * 15\r\n for p in people:\r\n time += p*5\r\n times.append(time)\r\nprint(min(times))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=[]\r\nfor i in range(n):\r\n k=list(map(int,input().split()))\r\n p=0\r\n for i in k:\r\n p +=i*5\r\n else:\r\n p +=15*(len(k))\r\n t +=[p]\r\nelse:\r\n print(min(t))\r\n", "n = int(input())\r\nk = list(map(int,input().split()))\r\nans = []\r\nfor i in range(n):\r\n p = list(map(int,input().split()))\r\n q = sum(p)*5 + k[i]*15\r\n ans.append(q)\r\nprint(min(ans))\r\n \r\n\r\n\r\n \r\n ", "n=int(input())\r\nans=1000005\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n ans=min(ans,sum(map(int,input().split()))*5+l[i]*15)\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n s=0\r\n for j in range(len(l)):\r\n s+=l[j]*5\r\n z=j\r\n s+=(z+1)*15\r\n c.append(s)\r\nprint(min(c))", "from math import inf\r\nn = int(input().strip())\r\ncus_num = list(map(int, input().strip().split()))\r\nmin_time = inf\r\nfor i in range(n):\r\n lst = list(map(int, input().strip().split()))\r\n time = cus_num[i] * 15 + sum(lst) * 5\r\n min_time = min(min_time, time)\r\nprint(min_time)", "n=int(input())\r\nlol=list(map(int,input().split()))\r\nans=sum(list(map(int,input().split())))*5+15*lol[0]\r\nfor _ in range(n-1):\r\n ans=min(ans,sum(list(map(int,input().split())))*5+15*lol[_+1])\r\nprint(ans)\r\n\r\n", "def solve(arr,n,p):\n res = []\n for i in arr:\n count = 0\n for j in i:\n count += j*5+15\n res.append(count)\n return min(res)\ndef main() :\n n = int(input())\n p = list(map(int, input().split(' ')))\n arr = []\n for _ in range(n):\n i = list(map(int, input().split(' ')))\n arr.append(i) \n \n print(solve(arr,n,p))\nmain()\n", "n = int(input())\r\nl=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n c=0\r\n l1=list(map(int,input().split()))\r\n for j in l1:\r\n c=c+(j*5)\r\n c=c+l[i]*15\r\n s.append(c)\r\nprint(min(s))", "num_cashiers = int(input())\r\nqueue_sizes = list(map(lambda x: int(x) * 15, input().split()))\r\n\r\nitems = []\r\n\r\nfor i in range(num_cashiers):\r\n items_list = sum(map(lambda x: int(x) * 5, input().split()))\r\n items.append(items_list)\r\n\r\nmin_time = min(change + groceries for change, groceries in zip(queue_sizes, items))\r\nprint(min_time)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=10**9\r\nitem=[]\r\nfor j in range(n):\r\n item=list(map(int,input().split()))\r\n s=sum(item)\r\n check=(5*s)+(15*l[j])\r\n if check<ans:\r\n ans=check\r\nprint(ans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nlis = []\r\nl = []\r\nfor i in range(n): \r\n p = [int(x) for x in input().split()]\r\n lis.append(p)\r\n \r\nfor j in range(n):\r\n sum = 0 \r\n \r\n for k in range(len(lis[j])):\r\n sum += lis[j][k]\r\n ans = sum*5 + (len(lis[j]*15))\r\n l.append(ans)\r\n \r\nprint(min(l)) ", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\n\r\nn = int(input())\r\nk = [int(x) for x in input().split()] # read multiple integers into a list\r\nminn = 10000000000\r\nfor _ in range(n) :\r\n P = [int(x) for x in input().split()] # read multiple integers into a list\r\n s = 0\r\n for x in P : s += 15 + 5 * x\r\n minn = min(minn, s)\r\n\r\nprint(minn)\r\n\r\n", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\nans=[]\r\nfor i in range(n):\r\n arr=[int(x) for x in input().split()]\r\n ans.append((sum(arr)*5)+(len(arr)*15))\r\nprint(min(ans)) ", "n = int(input())\na = list(map(int,input().split()))\nans = []\nfor x in range(n):\n sec = 15*a[x]\n q = list(map(int,input().split()))\n for y in q:\n sec += 5*y\n ans.append(sec)\n\nprint (min(ans))\n \n", "n = int(input())\nans = list(map(int, input().split()))\nans = [i * 15 for i in ans]\nfor i in range(n):\n ans[i] += sum(list(map(int, input().split()))) * 5\nprint(min(ans))", "n = int(input()) # Number of cashiers\r\nqueue_sizes = list(map(int, input().split())) # Queue sizes for each cashier\r\n\r\nmin_time = float('inf') # Initialize min_time to a large value\r\n\r\n# Iterate through each cashier\r\nfor i in range(n):\r\n customer_items = list(map(int, input().split()))\r\n \r\n cashier_time = 0\r\n \r\n # Calculate the time for each customer in the queue\r\n for items in customer_items:\r\n cashier_time += items * 5 # Time to scan items\r\n cashier_time += 15 # Time to handle payment\r\n \r\n # Update min_time if this cashier is quicker\r\n min_time = min(min_time, cashier_time)\r\n\r\nprint(min_time)\r\n", "n=int(input())\nnum=[]\nx=list(map(int,input().split()))\nfor i in range(n):\n a=list(map(int,input().split()))\n x1=0\n for j in a:\n x1=x1+(j*5)\n x1=x1+(15*x[i])\n num.append(x1)\nprint(min(num))\n\n \n \n \n \n \n \n \n\t\t\t\t\t\t \t \t\t\t \t \t \t \t\t\t\t\t \t", "cases = int(input())\r\narr = list(map(int, input().split()))\r\ni = 0\r\nmn = float(\"inf\")\r\nwhile cases:\r\n cases -= 1\r\n minute = sum(map(int, input().split())) * 5\r\n mn = min(minute+arr[i]*15, mn)\r\n i+=1\r\n\r\nprint(mn)\r\n", "d,n=30001,int(input())\r\nt = list(map(int,input().split()))\r\nfor i in range(n):\r\n s = sum(map(int,input().split()))+3*t[i]\r\n if s<d : d=s\r\nprint(d*5)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nmin = float('inf')\r\n\r\nfor i in range(n):\r\n count = a[i] * 15\r\n b = list(map(int, input().split()))\r\n for j in range(a[i]):\r\n count += b[j] * 5\r\n\r\n if count < min:\r\n min = count\r\n\r\nprint(min)\r\n\r\n\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n res = list()\r\n for i in range(n):\r\n array = str(input()).split()\r\n array = [int(it) for it in array]\r\n res.append(5 * sum(array) + 15 * line[i])\r\n print(min(res))\r\n", "def solve():\r\n n=int(input());q=list(map(int,input().split()));mn=1e9\r\n for i in range(n):\r\n c=0;c+=(q[i]*15)\r\n m=list(map(int,input().split()))\r\n for j in m:c+=5*j\r\n mn=min(mn,c)\r\n print(mn)\r\nsolve()", "\r\nfrom functools import reduce\r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\nmin_time = 10**9\r\nfor _ in range(n):\r\n ques = [int(x) for x in input().split()]\r\n currsum = reduce(lambda x, y: x + y * 5 + 15, ques) + 15 + ques[0] * 4\r\n min_time = min(min_time , currsum)\r\n\r\nprint(min_time)\r\n\r\n\r\n\r\n", "n = int(input())\r\nk = list(map(int,input().split()))\r\nprice = 10\r\nfor i in range(0,n):\r\n lis = list(map(int,input().split()))\r\n total = k[i] * 15\r\n for j in lis:\r\n total = total + (j * 5)\r\n if(price == 10):\r\n price = total\r\n if(price > total):\r\n price = total\r\nprint(price)", "def calc_total_time(num_people, items_in_baskets):\r\n scan_time_per_item = 5\r\n payment_time = 15\r\n total_time = 0\r\n\r\n for items in items_in_baskets:\r\n total_time += (items * scan_time_per_item) + payment_time\r\n\r\n return total_time\r\n\r\n\r\ndef find_min_time(num_cashiers, queue_sizes, items_in_baskets):\r\n min_time = float('inf')\r\n\r\n for i in range(num_cashiers):\r\n time_to_cashier = calc_total_time(queue_sizes[i], items_in_baskets[i])\r\n min_time = min(min_time, time_to_cashier)\r\n\r\n return min_time\r\n\r\n\r\nn = int(input())\r\nqsizes = list(map(int, input().split()))\r\nitems = []\r\n\r\nfor _ in range(n):\r\n item_list = list(map(int, input().split()))\r\n items.append(item_list)\r\n\r\nprint(find_min_time(n, qsizes, items))\r\n", "n = int(input())\r\nl1 = list(map(int, input().split()[:n]))\r\nl3 = []\r\nfor j in l1:\r\n l2 = list(map(int, input().split()[:j]))\r\n t = 5 * (sum(l2)) + 15 * j\r\n l3.append(t)\r\nprint(min(l3))", "import sys\r\nn = int(input())\r\nk = list(map(int, input().split()))\r\nbest = sys.maxsize\r\nfor i in range(0, n):\r\n ls = list(map(int,input().split()))\r\n s = sum(ls)\r\n best = min(best, s * 5 + 15*len(ls))\r\nprint(best)\r\n", "n=int(input())\r\nans=100000000\r\nCustomers=list(map(int,input().split()))\r\nfor i in range(n):\r\n L=list(map(int,input().split()))\r\n time=Customers[i]*15+(5*sum(L))\r\n ans=min(time,ans)\r\nprint(ans)\r\n", "I=lambda:[*map(int,input().split())]\r\nn=I()[0]\r\nk=I()\r\nprint(min(k[x]*15+sum(I())*5 for x in range(n)))", "n = int(input())\r\narr = list(map(int, input().split(' ')))\r\nz = []\r\n\r\nfor i in range(n):\r\n k = list(map(int,input().split(' ')))\r\n\r\n l = len(k)\r\n s = sum(k)\r\n\r\n x = 15*l + 5*s\r\n z.append(x)\r\n\r\nprint(min(z))", "n = int(input())\r\n\r\nk = [int(x) for x in input().split()]\r\n\r\nx = []\r\nsum = 0\r\n\r\ntime = []\r\nfor i in range(n):\r\n x.append([int(k) for k in input().split()])\r\n\r\n\r\nfor i in x:\r\n for j in i:\r\n sum += (5*j)\r\n sum += (len(i)) * 15\r\n\r\n time.append(sum)\r\n sum = 0\r\n\r\nprint(min(time))\r\n\r\n\r\n \r\n", "'''\nIn the end, we only regret the\nchances we didnt take\n'''\nMin=float('inf')\nn=int(input())\nk = list(map(int,input().split()))\nfor i in range(n):\n m=list(map(int,input().split()))\n y=(sum(m)*5)+(k[i]*15)\n if y<Min:\n Min=y\nprint(Min)\n\n", "N = int(input())\r\ninput()\r\nMIN = 10000000\r\nfor i in range(N):\r\n Num = list(map(int, input().split()))\r\n MIN = min(MIN, sum(Num) * 5 + len(Num) * 15)\r\nprint(MIN)\r\n", "n = int(input())\r\nk = list(map(int, input().split()))\r\nm = list()\r\nfor i in range(n):\r\n\tm.append(sum(map(int, input().split()))*5+15*k[i])\r\nprint(min(m))", "n, k = int(input()), list(map(int, input().split()))\r\nw = []\r\nfor i in range(n):\r\n m = list(map(int, input().split()))\r\n f = k[i]\r\n tm1 = 0\r\n tm1 += 15 * f\r\n sm = sum(m) * 5\r\n tm1 += sm\r\n w.append(tm1)\r\nprint(min(w))\r\n", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nres=[]\r\nfor i in range(n):\r\n\r\n e=[i*5 for i in map(int,input().split())]\r\n res.append(sum(e)+(x[i]*15))\r\nprint(min(res))", "\r\nn = int(input())\r\na = [0 for i in range(n)]\r\nar = input().split()\r\nfor i in range(n):\r\n a[i] = int(ar[i])*15\r\n\r\nfor j in range(n):\r\n m = map(int,input().split())\r\n for k in m:\r\n a[j]+= k*5\r\n\r\nmine = 100*100*5+15*100+1\r\nfor j in range(n):\r\n mine = min(mine,a[j])\r\n\r\nprint(mine)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list()\r\nfor i in range(len(a)):\r\n b.append(list(map(int,input().split())))\r\nc=[]\r\nfor i in range(len(a)):\r\n k=0\r\n for item in b[i]:\r\n k=k+5*item\r\n k=k+a[i]*15\r\n c.append(k)\r\nprint(min(c))", "n = int(input())\r\nppl = list(map(int, input().split()))\r\ntrack, ans = [], []\r\nfor t in range(n):\r\n nums = list(map(int, input().split()))\r\n track.append(nums)\r\nfor i in range(len(track)):\r\n sum1 = 0\r\n for e in range(len(track[i])):\r\n sum1 += track[i][e] * 5\r\n sum1 += 15 * ppl[i]\r\n ans.append(sum1)\r\nprint(min(ans))\r\n", "import math\r\nn = int(input())\r\nks = [int(x) for x in input().split()]\r\nitems = [[int(x) for x in input().split()] for j in range(n)]\r\n\r\nminPrice = math.inf\r\nfor t in range(n):\r\n price = ks[t] * 15 + sum(items[t]) * 5\r\n if price < minPrice:\r\n minPrice = price\r\n\r\nprint(minPrice)", "n=int(input())\r\n\r\ns=list(map(int,input().split()))\r\nt=[]\r\nfor j in range(n):\r\n p=list(map(int,input().split()))\r\n t.append(len(p)*15+sum(p)*5)\r\nprint(min(t))\r\n \r\n", "no_of_cashiers = int(input())\n\nqueues = list(map(int , input().split(\" \")))\n\ndef calculateTime(item) :\n return (item * 5) + 15\n\ntime_taken = []\nfor i in range(no_of_cashiers) :\n items = list(map(int , input().split(\" \")))\n time_taken.append(sum([calculateTime(i) for i in items]))\n\nprint(min(time_taken))\n\n", "x=int(input())\r\nn=list()\r\np=list(map(int,input().split()))\r\nfor i in range(x):\r\n k=list(map(int,input().split()))\r\n n.append(sum(k)*5+len(k)*15)\r\nprint(min(n))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = []\r\nfor i in range(n):\r\n\tx = list(map(int,input().split()))\r\n\ta.append(sum(x)*5+15*len(x))\r\nprint(min(a))", "#code\r\nn = int(input())\r\nk = list(map(int,input().split()))\r\nmin = 10**9\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n x = sum(l)*5+k[i]*15\r\n if x<min:\r\n min=x\r\n\r\nprint(min)", "n=int(input())\r\nk=list(map(int,input().split()))\r\nm=[list(map(int,input().split())) for i in range(len(k))]\r\nr=1000000\r\nfor i in range(len(m)):\r\n s=15*len(m[i])\r\n s+=sum([m[i][j]*5 for j in range(len(m[i]))])\r\n r=min(r,s)\r\nprint(r)\r\n", "n=int(input())\r\nq=[int(x) for x in input().split()][:n]\r\narr=[]\r\nfor i in q:\r\n x=[int(j) for j in input().split()][:i]\r\n arr.append(sum(x)*5+(i*15))\r\nprint(min(arr))", "n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=11**11\r\nfor nn in l:\r\n ll=list(map(int,input().split()))\r\n t=15*nn\r\n for x in ll:\r\n t+=5*x\r\n if t<ans: ans=t\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(0,n):\r\n b=list(map(int,input().split()))\r\n c=sum(b)\r\n d=(5*c)+(15*len(b))\r\n x.append(d)\r\nc=min(x)\r\nprint(c)\r\n", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif a[i]==1:\r\n\t\tx=[int(input())]\r\n\telse:\r\n\t\tx=list(map(int,input().split()))\r\n\tif i==0:\r\n\t\tm=sum(x)*5+a[i]*15\r\n\telse:\r\n\t\tm=min(m,sum(x)*5+a[i]*15)\r\n\r\nprint(m)\r\n\r\n", "def solve(line):\r\n a = list(map(int, line.split()))\r\n return 5 * sum(a) + 15 * len(a)\r\n\r\nlst = [w.rstrip() for w in open(0).readlines()]\r\nr = min(solve(line) for line in lst[2:])\r\nprint(r)", "t = int(input())\r\nl0 = [int(x) for x in input().split()]\r\nl2=[]\r\nfor x in range(t):\r\n l1 =[int(x) for x in input().split()]\r\n l2.append(sum(l1)*5+15*len(l1))\r\nprint(min(l2))\r\n", "n = int(input())\r\na = input().split(' ')\r\nss = []\r\nfor i in range(n):\r\n b=input().split()\r\n s = 0\r\n for i in b:\r\n s = s+ int(i)*5\r\n s = s + 15*len(b)\r\n ss.append(s)\r\nprint(min(ss))", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\nk=list(map(int,input().split()))\r\nE=10**9\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n p=sum(m)*5+k[i]*15\r\n E=min(E,p)\r\nprint(E)", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rstrs(splitchar=' '):\n return [i for i in input().split(splitchar)]\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in rstrs(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(*args, override=False):\n if '-v' in argv or override:\n print(*args)\n\n# Faster IO\npq = []\ndef penq(s):\n if not isinstance(s, str):\n s = str(s)\n pq.append(s)\n\ndef pdump():\n s = ('\\n'.join(pq)).encode()\n os.write(1, s)\n\nif __name__ == '__main__':\n n = rint()\n qs = rints()\n lines = [[i*5 for i in rints()] for i in range(n)]\n ans_lines = [len(l)*15 + sum(l) for l in lines]\n print(min(ans_lines))\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nleft right each coord\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n k = LII()\r\n ans = [0] * n\r\n\r\n for i in range(n):\r\n ans[i] += 15 * k[i]\r\n\r\n for i in range(n):\r\n p = LII()\r\n for x in p:\r\n ans[i] += x * 5\r\n \r\n print(min(ans))\r\n\r\n\r\nsolve()", "mi=float('inf')\r\nn=int(input())\r\nl=list(map(int,input().rstrip().split()))\r\nfor i in l:\r\n s=0\r\n l2=list(map(int,input().rstrip().split()))\r\n for j in l2:\r\n c=15+j*5\r\n s=s+c\r\n if s<mi:\r\n mi=s\r\nprint(mi)\r\n", "def int_map(i=None):\r\n\tif not i:\r\n\t\ti = input()\r\n\treturn map(int, i.split(' '))\r\n\r\nn = int(input())\r\nt = [0]*n\r\nif n == 1:\r\n\tp = [int(input())]\r\nelse:\r\n\tp = list(int_map())\r\n\r\nfor num, i in enumerate(p):\r\n\tif i == 1:\r\n\t\tbuf = [int(input())]\r\n\telse:\r\n\t\tbuf = list(int_map())\r\n\r\n\tfor j in buf:\r\n\t\tt[num] += j*5 + 15\r\n\r\nprint(min(t))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nk = list(map(int, input().split()))\r\nl = []\r\nfor i in range(n):\r\n sum = 0\r\n m = list(map(int, input().split()))\r\n for j in m:\r\n sum += j*5\r\n\r\n sum += k[i]*15\r\n l.append(sum)\r\nprint(min(l))\r\n", "kasses = int(input())\nsizes = list(map(int, input().split()))\nocheredi = []\n\nfor i in range(kasses):\n ocheredi.append(list(map(int, input().split())))\n\nm = -1\n\nfor i in ocheredi:\n cm = 15 * len(i)\n for j in i:\n cm += 5*j\n if cm < m or m == -1:\n m = cm\n\nprint(m)\n", "n = int(input())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\nans = float('inf')\r\nfor i in range(n):\r\n x = r()\r\n c = sum(x) * 5 + 15*len(x)\r\n ans = min(ans , c)\r\n\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\r\nk=[int(i) for i in input().split()]\r\nm=[(list(map(int,input().split()))) for i in range(n)]\r\ntotal=None\r\nfor i in range(len(m)):\r\n cal=0\r\n for j in range(len(m[i])):\r\n cal+=((m[i][j]*5)+15)\r\n if total==None:\r\n total=cal\r\n elif total>cal:\r\n total=cal\r\nprint(total)", "n = int(input())\r\nfodac = input()\r\nval = 100000\r\nfor i in range(n):\r\n val = min(val, sum(int(x) * 5 + 15 for x in input().split()))\r\nprint(val)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nmin=100000\r\nfor _ in range(n):\r\n l=list(map(int,input().split()))\r\n s=15*l1[_]\r\n for i in l:\r\n s=s+i*5\r\n if s<min:\r\n min=s\r\nprint(min)\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nt=[]\r\nfor i in range(n):\r\n sum=0\r\n y=list(map(int,input().split()))\r\n for j in range(len(y)):\r\n sum+=y[j]*5\r\n sum+=x[i]*15\r\n t.append(sum)\r\n\r\nprint(min(t))", "n=int(input())\r\nk=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n m=[int(j) for j in input().split()]\r\n m1=sum(m)\r\n z1=m1*5\r\n z2=k[i]*15\r\n z3=z1+z2\r\n l.append(z3)\r\nprint(min(l))", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\nnarr = list(map(int,stdin.readline().split()))\r\ntime = []\r\nwhile n:\r\n req = 0\r\n arr = list(map(int,stdin.readline().split()))\r\n for i in arr:\r\n req += i*5\r\n req+=len(arr)*15\r\n time.append(req)\r\n n-=1\r\nstdout.write(str(min(time))+'\\n')\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\na=[]\r\nfor _ in range(n):\r\n l=list(map(int,input().split()))\r\n y=15*(len(l))\r\n z=5*(sum(l))\r\n a.append(y+z)\r\nprint(min(a))\r\n\r\n\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nm = [[int(i) for i in input().split()] for i in range(n)]\r\n\r\np = []\r\nfor i in m:\r\n\ts = 0\r\n\tfor j in range(len(i)):\r\n\t\ts += i[j]*5+15\r\n\tp.append(s)\r\n\r\nprint(min(p))", "n = int(input())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nminres = float('inf')\r\nfor i in range(n):\r\n\ta = input().split()\r\n\ta = [int(i) for i in a]\r\n\tres = sum(a)*5 + s[i]*15\r\n\tif(res<minres):\r\n\t\tminres = res\r\nprint(minres)\r\n", "n=int(input())\r\npokupateli=list(map(int,input().split()))\r\nans=0\r\nx=[]\r\nfor i in range(n):\r\n produkti=list(map(int,input().split()))\r\n for j in range(len(produkti)):\r\n ans+=produkti[j]*5\r\n ans+=len(produkti)*15\r\n x.append(ans)\r\n ans=0\r\nprint(min(x))", "def main():\n input()\n print(min(k * 3 + sum(map(int, input().split())) for k in map(int, input().split())) * 5)\n\n\nif __name__ == '__main__':\n main()", "import sys \r\ninput = sys.stdin.readline \r\nfrom math import inf\r\nn = int(input())\r\nk = list(map(int, input().split()))\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\nm = inf \r\nfor i in range(n):\r\n s = sum(l[i]) * 5 + k[i] * 15 \r\n m = min(m, s)\r\nprint(m)", "n=int(input())\r\nl=[]\r\nm=[int(x) for x in input().split()]\r\nfor x in range(n):\r\n a=[int(x) for x in input().split()]\r\n b=sum(a)*5+m[x]*15\r\n l.append(b)\r\nprint(min(l)) \r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\ntime = []\r\nproducts = []\r\nfor i in range(len(m)):\r\n products += [list(map(int, input().split()))]\r\nfor i in products:\r\n time += [15 * len(i) + sum(i) * 5]\r\nprint(min(time))\r\n \r\n ", "'''\r\nCreated on Feb 13, 2015\r\n\r\n@author: mohamed265\r\n'''\r\nn = int(input())\r\ntemp = [int(x) for x in input().split()]\r\nslon = 9999999999999999\r\nfor i in range(n):\r\n temp2 = [int(x) for x in input().split()]\r\n t = 0\r\n for j in range(temp[i]):\r\n t += temp2[j] * 5\r\n t += 15\r\n slon = min(slon , t)\r\nprint(slon)", "n = int(input())\r\nl = list(map(int , input().split()))\r\nans = float('inf')\r\nfor i in range(n):\r\n Sum = sum(i*5 for i in list(map(int, input().split()))) + l[i]*15\r\n if ans > Sum :\r\n ans = Sum\r\nprint(ans)", "n = int(input())\r\nk = list(map(int,input().split()))\r\ntime = 0\r\ncount = 0\r\nfor i in range(n):\r\n product = list(map(int,input().split()))\r\n for j in range(k[i]):\r\n time += product[j]*5\r\n time += k[i]*15\r\n if(i == 0):\r\n count = time\r\n count = min(time,count)\r\n time = 0\r\nprint(count)", "import sys,math\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn = int(input())\r\ncust = get_list()\r\nmx = 10000000\r\nfor i in range(n):\r\n temp = 0\r\n if cust[i]==1:\r\n t = int(input())\r\n temp += t*5+15\r\n mx = min(mx,temp)\r\n else:\r\n ar = get_list()\r\n for x in ar:\r\n temp += x*5+15\r\n mx = min(mx,temp)\r\nprint(mx)", "n = int(input())\r\nkas = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n if kas[i] !=0:\r\n a = sum([int(x) for x in input().split()]) * 5\r\n else: a = 0\r\n kas[i] = kas[i] * 15 + a\r\nprint(min(kas))\r\n\r\n ", "n = int(input())\r\nc = list(map(int, input().strip().split()))\r\nans = 1 << 31\r\nfor i in range(n):\r\n ans = min(ans, sum([int(k) * 5 for k in input().split()]) + c[i] * 15)\r\nprint(ans)", "n =input()\r\nx=list(map(int,input().split()))\r\nmint=10000000000\r\nfor i in range(int(n)):\r\n y=list(map(int,input().split()))\r\n mint=min(mint,sum(y)*5+15*len(y))\r\nprint(mint)", "import sys\r\nimport math\r\n \r\nn = int(sys.stdin.readline())\r\nkn = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nvmin = 51501\r\nfor i in range(n):\r\n t = (kn[i] * 15) + (sum([int(x) for x in (sys.stdin.readline()).split()]) * 5)\r\n if(t < vmin):\r\n vmin = t\r\n \r\nprint(vmin)", "n = int(input())\nq_cnt = list(map(int,input().split()))\ni_cnt = [list(map(int,input().split())) for i in range(n)]\nprint(min(sum(i_cnt[i])*5 + q_cnt[i]*15 for i in range(n)))", "n = int(input())\nlines = list(map(int, input().split()))\n\nnum_items = []\nfor x in range(n):\n num_items.append(list(map(int, input().split())))\n\n\nmin_time = 9999999999\nfor index in range(n):\n total_time = 5*(sum(num_items[index]))\n total_time += 15*(lines[index])\n if total_time < min_time:\n min_time = total_time\n\nprint(min_time)", "n = int(input())\r\ninput()\r\nans = 100000\r\nfor _ in range(n):\r\n m = map(int, input().split())\r\n cur = 0\r\n for x in m:\r\n cur += 5 * x + 15\r\n ans = min(ans, cur)\r\nprint(ans)", "n = int(input())\r\nk = list(map(int, input().split()))\r\nans = 51500\r\nfor i in range(n):\r\n m = list(map(int, input().split()))\r\n ans = min(ans, sum(m)*5 + len(m)*15)\r\nprint(ans)\r\n", "result = []\r\nnumber = int(input())\r\npeople = input()\r\n\r\nfor _ in range(number):\r\n products = tuple(int(i) * 5 + 15 for i in input().split())\r\n result.append(sum(products))\r\n \r\nprint(min(result))\r\n \r\n ", "n=int(input(''))\r\ns=input('')\r\nl=s.split(' ')\r\nl=list(map(int,l))\r\nl2=[]\r\nfor i in range(n):\r\n s1=input('')\r\n l1=s1.split(' ')\r\n l1=list(map(int,l1))\r\n val=sum(l1)*5+l[i]*15\r\n l2.append(val)\r\nprint(min(l2))\r\n", "# @Author: Justin Hershberger\r\n# @Date: 18-04-2017\r\n# @Filename: 408A.py\r\n# @Last modified by: Justin Hershberger\r\n# @Last modified time: 18-04-2017\r\n\r\n\r\n\r\n#Justin Hershberger\r\n#Py3.5\r\n\r\nimport fileinput\r\n\r\ndef test():\r\n\tpass\r\nif __name__ == '__main__':\r\n\tfor arg in range(2):\r\n\t\tif arg == 0:\r\n\t\t\tn = int(input())\r\n\t\telse:\r\n\t\t\tqueue = input().split()\r\n\tlines = {}\r\n\tfor i in range(n):\r\n\t\tlines[i] = input().split()\r\n\r\n\twait_times = {}\r\n\t# print(lines, queue, n)\r\n\tfor ln in lines:\r\n\t\tfor el in lines[ln]:\r\n\t\t\tif ln in wait_times:\r\n\t\t\t\twait_times[ln] += int(el) * 5\r\n\t\t\telse:\r\n\t\t\t\twait_times[ln] = int(el) * 5\r\n\r\n\tfor ln in lines:\r\n\t\twait_times[ln] += len(lines[ln]) * 15\r\n\r\n\tprint(wait_times[min(wait_times, key=wait_times.get)])\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nb = 99999999\r\n\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n if b > sum(a)*5 + len(a)*15:\r\n b = sum(a)*5 + len(a)*15\r\n\r\nprint(b)", "n = int(input())\r\nans = []\r\nl = list(map(int,input().split()))\r\nfor i in l:\r\n c = 0\r\n c += i*15\r\n it = list(map(int,input().split()))\r\n for j in it:\r\n c += j*5\r\n ans.append(c)\r\nprint(min(ans))", "# https://codeforces.com/contest/408\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn = int(input())\nk = list(map(int, input().split()))\n\nans = 10 ** 20\nfor _ in range(n):\n m = list(map(int, input().split()))\n ans = min(ans, sum(5 * x for x in m) + len(m) * 15)\nprint(ans)\n", "n = int(input())\r\nk = list(map(int,input().split()))\r\nm = list()\r\nfor i in range(n):\r\n m.append(list(map(int,input().split())))\r\nsec = sum(m[0])*5 + len(m[0])*15\r\nfor i in range(1,n):\r\n v = sum(m[i])*5 + len(m[i])*15\r\n sec = min(v,sec)\r\nprint(sec)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nv ,b= [],[]\r\nfor _ in range(n):\r\n\tl = list(map(int,input().split()))\r\n\tv.append(sum(l)*5)\r\nfor i in a:\r\n\tb.append(i*15)\r\nz = v[0] +b[0]\r\nfor i in range(1,n):\r\n\tq = v[i]+b[i]\r\n\tz = min(z,q)\r\nprint(z)\r\n\r\n", "'''input\n1\n1\n1\n'''\nn = int(input())\nk = list(map(int, input().split()))\nm = 10000000000\nfor _ in range(n):\n\tp = list(map(int, input().split()))\n\tm = min(m, 5*sum(p) + 15*len(p))\nprint(m)\n\n\n\n\n\n\n\n\n\n\n", "num = int(input())\r\nn = [int(x) for x in input().split()]\r\nminsumm = -1\r\nfor i in range(0,num):\r\n summ = 0\r\n q = [int(x) for x in input().split()]\r\n for j in q:\r\n summ+=(5*j)\r\n summ+=15\r\n if(minsumm==-1): minsumm = summ\r\n elif(minsumm>summ): minsumm = summ\r\nprint(minsumm)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=2**31\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n x=(15*l[i])+5*sum(a)\r\n m=min(m,x)\r\nprint(m)", "n = input()\r\nl = list(map(int,input().split(' ')))\r\ntime = 0\r\nm_t = float('inf')\r\nfor i in l:\r\n j = list(map(int,input().split(' ')))\r\n for k in j:\r\n time += k*5 + 15\r\n if time < m_t:\r\n m_t = time\r\n time = 0\r\nprint(m_t)", "n=int(input())\r\nk=[int(i) for i in input().split()]\r\ntms=[]\r\nfor i in range(n):\r\n m=[int(i) for i in input().split()]\r\n tgens=k[i]\r\n tm1=0\r\n tm1+=15*tgens\r\n sm=sum(m)*5\r\n tm1+=sm\r\n tms.append(tm1)\r\nprint(min(tms))\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n b=[int(i) for i in input().split()]\r\n sum=0\r\n for j in range(0,len(b)):\r\n sum=sum+(b[j]*5)\r\n sum=sum+(15*len(b))\r\n l.append(sum)\r\nprint(min(l))\r\n ", "import sys\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nminm=sys.maxsize\r\nfor i in range(n):\r\n l1=list(map(int,input().split()))\r\n summ=sum(l1)\r\n t=summ*5 + (l[i])*15\r\n minm=min(minm,t)\r\nprint(minm)\r\n\r\n ", "n = int(input())\r\n\r\n\r\nmax = 1e15\r\n\r\nk = list(map(int, input().split()))\r\n\r\nfor i in k:\r\n tot = 0\r\n m = list(map(int, input().split()))\r\n for e in m:\r\n tot += e*5 + 15\r\n if max>tot: max = tot\r\n\r\nprint(max)\r\n", "n = int(input())\r\nk = [int(x) for x in input().split(' ')]\r\nm = [[int(x) for x in input().split(' ')] for cashier in range(n)]\r\n\r\nans = min([15 * len(z) + 5 * sum(z) for z in m])\r\nprint(ans)", "n = int(input())\nnumPeople = list(map(int, input().split()))\nlines = [list(map(int, input().split())) for n in range(0,n)]\n\nminTime = -1\n\nfor i in range(0, n):\n time = 0\n for j in range(0, numPeople[i]):\n time += 15\n time += (lines[i][j] * 5)\n \n if(minTime is -1):\n minTime = time\n elif(minTime > time):\n minTime = time\n\nprint(minTime)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmax=1000000000000000000000000\r\nfor i in range(n):\r\n li=list(map(int,input().split()))\r\n s=15*len(li)\r\n for j in li:\r\n s+=5*j\r\n if s<max:\r\n max=s\r\nprint(max)\r\n \r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nki=[]\r\nk=0\r\nfor i in range(n):\r\n cv=sum(list(map(int,input().split())))*5\r\n ki.append(cv+(li[k]*15))\r\n k+=1\r\nprint(min(ki))", "n = int(input())\nk = [int(x) for x in input().split()]\nans = 10 ** 10\nfor i in range(n):\n\tans = min(ans, sum(int(x) for x in input().split()) * 5 + k[i] * 15)\nprint(ans)\n", "n = int(input())\r\ninput()\r\nprint(min(sum(5 * y + 15 for y in x) for x in (map(int, input().split()) for _ in range(n))))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nz=[]\r\nfor i in range(n):\r\n\ta=list(map(int,input().split()))\r\n\tsum=0\r\n\tfor j in a:\r\n\t\tsum+=j*5+15\r\n\tz.append(sum)\t\r\nprint(min(z))", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nm=52000\r\nfor i in range(n):\r\n c=[int(x) for x in input().split()]\r\n s=0\r\n for x in c:\r\n s+=x*5\r\n s+=l[i]*15\r\n if s<m:\r\n m=s\r\nprint(m)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nmintime=1e10\r\nfor i in l:\r\n k=list(map(int, input().split()))\r\n time=sum(k)*5+i*15\r\n if(time<mintime):\r\n mintime=time\r\nprint(mintime)\r\n \r\n \r\n", "n=int(input())\r\nk=list(map(int,input().strip().split()))[:n]\r\nsum=[0]*n\r\nfor i in range(0,n):\r\n arr=list(map(int,input().strip().split()))[:k[i]]\r\n for j in range(0,k[i]):\r\n sum[i]+=arr[j]*5\r\n sum[i]+=k[i]*15\r\nprint(min(sum))", "n = int(input())\nk = [int(i) for i in input().split()]\nmin_ = 51501\n\nfor i in range(n):\n min_ = min(min_, 15 * k[i] + 5 * sum([int(j) for j in input().split()]))\n\nprint(min_)\n \n# Sat Dec 14 2019 13:08:37 GMT+0300 (MSK)\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nans=[ ]\r\nfor i in range (0,n):\r\n k=ar[i]\r\n arr=list(map(int,input().split()))[:k]\r\n s=sum(arr)*5 + 15*k\r\n ans.append(s)\r\nprint(min(ans))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nres=sum(b)*5+len(b)*15\r\nfor i in range(n-1):\r\n c=[int(x) for x in input().split()]\r\n res=min(res,sum(c)*5+len(c)*15)\r\nprint(res)", "def line_of_cashier():\r\n n = int(input())\r\n lst = list(map(int,input().split()))\r\n time_lst = []\r\n \r\n for ele in lst:\r\n new_lst = list(map(int,input().split()))\r\n sum1 = 0 \r\n for i in new_lst:\r\n sum1 += 5*i\r\n sum1 += 15*ele\r\n time_lst.append(sum1)\r\n \r\n \r\n \r\n print(min(time_lst))\r\n \r\n \r\n \r\n \r\n \r\n \r\nline_of_cashier()", "n=int(input())\r\na=input().split()\r\nb=[int(i) for i in a]\r\nmin1=float('inf')\r\nfor i in range(n):\r\n c=input().split()\r\n d=[int(j) for j in c]\r\n e=[j*5 for j in d]\r\n if sum(e)+len(d)*15<min1:\r\n min1= sum(e)+len(d)*15\r\nprint(min1)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncash = []\r\nfor i in range(n):\r\n cash.append(list(map(int, input().split())))\r\ndef sim(c):\r\n time = 0\r\n time += len(c) * 15\r\n for i in c:\r\n time += 5 * i\r\n return time\r\nans = 2 ** 31\r\nfor c in cash:\r\n ans = min(ans, sim(c))\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=[15*l[i]+ sum(list(map(int,input().split())))*5 for i in range(n)]\r\nprint(min(c))", "n = int(input())\r\ninput()\r\nmin = 6666666666666666666666666666\r\n\r\nfor i in range(n):\r\n numbers = list(map(int, input().split()))\r\n sec = 15 * len(numbers)\r\n for i in numbers:\r\n sec += i * 5\r\n if sec < min:\r\n min = sec \r\n \r\nprint(min)", "n = int(input())\r\nk = list(map(int,input().split()))\r\nmax=0\r\nmin=1000000\r\nfor i in range(n):\r\n arr = list(map(int,input().split()))\r\n s = sum(arr)*5\r\n s+=k[i]*15\r\n if s<min:\r\n min=s\r\nprint(min)\r\n", "a=int(input())\r\nk=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(a):\r\n d=list(map(int,input().split()))\r\n c.append(5*sum(d)+15*len(d))\r\nprint(min(c))", "def line_to_cashier(arr,b):\r\n min=10000000000\r\n for i in range(len(arr)):\r\n tp=arr[i]*15\r\n sum_array=sum(b[i])*5\r\n \r\n total=tp+sum_array\r\n #print(total)\r\n if total<min:\r\n final_ans=total\r\n min=total\r\n \r\n #print('______')\r\n print(final_ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\nn=int(input(''))\r\narr=list(map(int,input('').split()))\r\nb=[]\r\nfor i in range(n):\r\n a=list(map(int,input('').split()))\r\n b.append(a)\r\n\r\nline_to_cashier(arr,b)", "#code\r\nn=int(input())\r\nsumi=[]\r\nx=(list(map(int,input().split())))\r\nfor j in range(n):\r\n sumi=sumi+[5*(sum(list(map(int,input().split()))))+15*x[j]]\r\nprint(min(sumi))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ninput()\r\nc = 10**9\r\nfor _ in range(n):\r\n w = list(map(int, input().split()))\r\n t = len(w)*15 + sum(w)*5\r\n if t < c:\r\n c = t\r\nprint(c)", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\nm = []\r\nfor i in range(n):\r\n m.append([int(j) for j in input().split()])\r\nt = [0] * n\r\nfor i in range(n):\r\n t[i] = sum(m[i]) * 5 + len(m[i]) * 15\r\nprint(min(t))", "from math import inf\n\n\ndef solve(n, k, m):\n mini = inf\n for i in range(n):\n mini = min(mini, 5*sum(m[i]) + len(m[i])*15)\n return mini\n\n\ndef main():\n n = int(input())\n k = list(map(int, input().split()))\n m = [list(map(int, input().split())) for _ in range(n)]\n print(solve(n, k, m))\n\n\nmain()\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=[]\r\nfor i in range(n):\r\n s=0\r\n k=list(map(int,input().split()))\r\n s+=len(k)*15\r\n for i in k:\r\n s+=i*5\r\n t.append(s)\r\nprint(min(t))", "N = int(input())\r\nK = list(map(int, input().split()))\r\nA = float('inf')\r\nfor i in range(N):\r\n m = list(map(int, input().split()))\r\n time = K[i]*15 + 5*sum(m)\r\n A = min(A, time)\r\nprint(A)", "n = int(input())\r\nl = list(map(int,input().split()))\r\n \r\ns = list()\r\n\r\nfor i in range(n):\r\n\tll =list(map(int,input().split()))\r\n\tp = len(ll)*15 + sum(ll)*5\r\n\ts.append(p)\r\n\r\nprint(min(s))", "n = int(input())\r\nppl = list(map(int, input().split()))\r\nans = 10 ** 8\r\nfor i in range(n):\r\n items = list(map(int, input().split()))\r\n time = 0\r\n\r\n for i in items:\r\n time += i * 5 + 15\r\n ans = min(ans, time)\r\n\r\n\r\n\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\nk=list(map(int,input().split()))\nm=[]\nfor i in range(n):\n\tt=list(map(int,input().split()))\n\tm.append(sum(t)*5+len(t)*15)\nprint(min(m))", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn = I()\r\nK = IL()\r\n\r\nans = []\r\nfor k in K:\r\n M = IL()\r\n ans.append(len(M)*15 + sum(M)*5)\r\nprint(min(ans))", "cases = int(input())\r\nlengths = input().split()\r\nfull_list = [[*map(lambda x: int(x), input().split())] for i in range(cases)]\r\n\r\n\r\ndef min_finder(full_list):\r\n newlist = [*map(lambda x: (len(x) * 15) + (sum(x) * 5), full_list)]\r\n print(min(newlist))\r\n \r\n \r\nmin_finder(full_list)", "n = int(input())\n\nk = [int(x) for x in input().split()]\n\nlow = float('inf')\n\nfor i in range(n):\n items = [int(x) for x in input().split()]\n time = 0\n for item in items:\n time += (item*5)+15\n low = min(low, time)\n\nprint(low)\n", "n = int(input())\nf = list(map(int,input().split()))\nl1 = []\n\ndef fun(l):\n res = 0\n for x in l:\n res = res+ x*5 +15\n return res\n\nfor x in range(n):\n l2= 0\n lol = list(map(int,input().split()))\n l2 = l2 + fun(lol)\n l1.append(l2)\n\n\nprint(min(l1))\n\n", "n = int(input())\r\n\r\nl = list(map(int, input().split()))\r\n\r\nl1 = []\r\n\r\nfor i in range(n):\r\n\ttime = 0\r\n\tlin = list(map(int, input().split()))\r\n\tfor j in lin:\r\n\t\ttime += j * 5\r\n\r\n\ttime += l[i] * 15\r\n\tl1.append(time)\r\n\r\nprint(min(l1))\r\n", "n = int(input())\nx = list(map(int, input().split()))\nans, flag = 0,0 \nfor i in range(n):\n a = list(map(int, input().split()))\n if (flag == 0):\n ans = sum(a)*5 + (15 * (len(a)))\n temp = sum(a)*5 + (15 * (len(a)))\n flag += 1\n if (ans > temp):\n ans = temp\nprint(ans)\n", "R=lambda:list(map(int,input().split()))\r\nn = int(input())\r\nl = R()\r\nprint(min([sum(R())*5+15*l[i] for i in range(n)]))", "n=int(input())\r\nk=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(len(k)):\r\n m=list(map(int,input().split()))\r\n r1=len(m)*15\r\n r2=0\r\n for i in range(len(m)):\r\n r2=r2+m[i]\r\n r=r1+(5*r2)\r\n l.append(r)\r\nprint(min(l))", "n = int(input())\r\nq = [int(x) for x in input().split()]\r\nc = []\r\nt = []\r\nfor i in range(n):\r\n c.append([int(x) for x in input().split()])\r\nfor i in range(n):\r\n ans = 0\r\n for e in range(q[i]):\r\n ans += (5*c[i][e])\r\n ans += 15\r\n t.append(ans)\r\n\r\nprint(min(t))", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nm=10000001\r\nfor i in range(n):\r\n l=[int(i) for i in input().split()]\r\n m=min(m,(sum(l)*5)+(l1[i]*15))\r\nprint(m)", "n=int(input())\r\nk=list(map(int,input().split()))\r\nmini=10**100\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n time=0\r\n for j in range(len(l)):\r\n time+=l[j]*5+15\r\n mini=min(mini,time)\r\nprint(mini)", "n=int(input())\r\nk=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(n):\r\n m.append(list(map(int,input().split())))\r\nk=0\r\nf=[]\r\nfor i in m:\r\n for j in range(len(i)):\r\n k=k+(i[j]*5)+15\r\n f.append(k)\r\n k=0\r\na=min(f)\r\nprint(a)", "import sys\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmin1=sys.maxsize\r\nfor i in range(n):\r\n temp=list(map(int,input().split()))\r\n temp2=0\r\n temp2+=sum(temp)*5+arr[i]*15\r\n if min1>temp2:\r\n min1=temp2\r\nprint(min1)", "n=int(input())\r\nk=list(map(int,input().split()))\r\nm=10**10\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n s=0\r\n for j in l:\r\n s=s+j*5\r\n s=s+k[i]*15\r\n if(m>s):\r\n m=s\r\nprint(m)\r\n", "import math\r\n\r\nn = int(input())\r\nnumber_of_people = list(map(int, input().split()))\r\nlines = []\r\nfor i in range(n):\r\n lines.append([int(i) for i in input().split()])\r\n\r\nquick = math.inf\r\nfor i in range(n):\r\n sum = 0\r\n num_people = number_of_people[i]\r\n for j in range(num_people):\r\n sum += lines[i][j]*5\r\n sum += num_people*15\r\n quick = min(quick,sum)\r\nprint(quick)", "n = int(input())\r\ncashiers = list(map(int, input().split()))\r\n\r\nmin_time = float('inf')\r\n\r\nfor _ in range(n):\r\n queue = list(map(int, input().split()))\r\n total_time = sum(queue) * 5 + len(queue) * 15\r\n min_time = min(min_time, total_time)\r\n\r\nprint(min_time)", "try:\r\n t=int(input())\r\n m=[int(i) for i in input().split()]\r\n a=[]\r\n \r\n for i in range(t):\r\n f=[int(i) for i in input().split()]\r\n a.append(f)\r\n \r\n op=[]\r\n for i in range(t):\r\n \r\n b=sum(a[i])*5+15*m[i]\r\n \r\n op.append(b)\r\n \r\n print(min(op)) \r\nexcept:\r\n pass", "n = int(input())\r\nk = list(map(int, input().split()))\r\nans = []\r\nfor i in range(n):\r\n c = 0\r\n m = list(map(int, input().split()))\r\n for j in range(k[i]):\r\n c += 5 * m[j]\r\n c += 15 * k[i]\r\n ans.append(c)\r\nprint(min(ans))\r\n", "# Problem Link: https://codeforces.com/problemset/problem/408/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\ndef getTimeOfLine(customers):\r\n return sum(list(map(lambda x: x*5, customers))) + len(customers)*15\r\n\r\nn = int(input())\r\ncust = list(map(int, input().split()))\r\n\r\nlines = []\r\nfor i in range(n):\r\n lines.append(list(map(int, input().split())))\r\n\r\nmin_time = getTimeOfLine(lines[0])\r\nfor line in lines:\r\n time = getTimeOfLine(line)\r\n min_time = min(min_time, time)\r\n\r\nprint(min_time)", "def mot (g):\r\n return g * 5\r\na=int (input())\r\ns=[]\r\nd=0\r\nx=input().split()\r\nwhile True :\r\n if (d < a):\r\n z=list(map(int,input().split()))\r\n t=list(map (mot,z))\r\n j = (int(x[d])* 15)+sum(t)\r\n s.append(j)\r\n else :\r\n break\r\n d += 1\r\nprint (min(s))", "n = int(input())\r\ninput()\r\nprint(min([sum(map(lambda x: int(x)*5 + 15, input().split())) for i in range(n)]))", "n=int(input())\r\nqueue=list(map(int,input().split()))\r\ntime=[]\r\nfor i in range(n):\r\n time.append((5*sum(list(map(int,input().split()))))+queue[i]*15)\r\nprint(min(time))", "def main_function():\r\n n = int(input())\r\n k = [int(i) for i in input().split(\" \")]\r\n input_data = [[int(j) for j in input().split(\" \")] for i in range(n)]\r\n data_processing = []\r\n for i in input_data:\r\n data_processing.append(sum(i) * 5 + len(i) * 15)\r\n return min(data_processing)\r\n\r\n\r\nprint(main_function())\r\n ", "n = int(input())\r\nmap(int, input().split())\r\nperson = []\r\nfor i in range(n):\r\n tmp = list(map(int, input().split()))\r\n q = len(tmp) * 15\r\n v = sum(tmp) * 5\r\n person.append(q + v)\r\nprint(min(person))\r\n\r\n# CodeForcesian\r\n# ♥\r\n# اگه میتونی تصور کنی پس حتما میتونی انجامش بدی\r\n", "n=int(input())\r\ncustomers=list(map(int,input().split()))\r\nmat=[]\r\nfor i in range(n):\r\n mat.append(list(map(int,input().split())))\r\nmin=float('inf')\r\nfor i in range(len(mat)):\r\n currenttot=sum(mat[i])*5+len(mat[i])*15\r\n if currenttot < min:\r\n min=currenttot\r\nprint(min)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\na=[]\r\n\r\nfor i in range(len(lst)):\r\n ans=0\r\n num = list(map(int, input().split()))\r\n \r\n for j in num:\r\n ans+= j*5\r\n \r\n ans+= lst[i]*15\r\n a.append(ans)\r\n \r\nprint(min(a))", "n = int(input())\r\nk = map(int, input().split())\r\nsec = []\r\n\r\nfor i in range(n):\r\n m = list(map(int, input().split()))\r\n sec.append(sum(m)*5+len(m)*15)\r\n\r\nprint(min(sec))\r\n", "n = int(input())\r\nqueue = list(map(int, input().split()))\r\n\r\ntotal = []\r\nfor i in range(n):\r\n items = list(map(int, input().split()))\r\n scan = sum(items) * 5\r\n pay = queue[i] * 15\r\n total.append(scan + pay)\r\n\r\nresult = min(total)\r\nprint(result)\r\n", "a=[]\nch = int(input())\ncu = list(map(int, input().split()))\nfor i in range(ch):\n items=list(map(int, input().split()))\n t=sum(items)*5 + len(items)*15\n a.append(t)\nprint(min(a))", "n = int(input())\r\nk = list(map(int, input().split()))\r\nm = []\r\nfor i in range(n):\r\n m.append(list(map(int, input().split())))\r\n\r\nminval = 9999999999999\r\nfor i in m:\r\n count = 0\r\n for j in i:\r\n count += (j * 5) + 15\r\n minval = min(count, minval)\r\n\r\nprint(minval)\r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nk1=[]\r\nfor i in range(n):\r\n l=tuple(map(int,input().split()))\r\n k1.append(sum(l)*5+len(l)*15)\r\nprint(min(k1))\r\n \r\n \r\n", "n=int(input())\r\nk=[int(i) for i in input().split()]\r\nmin_time=999999999999999999999999999999999999999999999999999999999\r\nfor i2 in range(n):\r\n j=[int(i) for i in input().split()]\r\n min_time=min(min_time,sum([h*5 for h in j])+15*len(j))\r\nprint(min_time)", "import math\r\nn=int(input())\r\nmi=math.inf\r\nl=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n mi=min(mi,(sum(m)*5+len(m)*15))\r\nprint(mi)", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\nminn = 10**9+7\r\nfor i in range(0,n):\r\n ms = sum([int(i)*5 for i in input().split()])\r\n ms += k[i]*15\r\n minn = min(minn,ms)\r\nprint(minn)", "n = int(input())\r\nk = list(map(int, input().split()))\r\n\r\ncosts = []\r\nfor _k in k:\r\n m = list(map(int, input().split()))\r\n cost = _k * 15 + sum(m) * 5\r\n costs.append(cost)\r\n\r\nprint(min(costs))\r\n# print(costs)", "def main():\n n_cashs = int(input())\n n_persons = [int(_) for _ in input().split()]\n result = -1\n\n for i in range(n_cashs):\n products = [int(_) for _ in input().split()]\n time = sum(products) * 5 + n_persons[i] * 15\n\n if result == -1 or time < result:\n result = time\n\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(n):\r\n add=0\r\n l=list(map(int,input().split()))\r\n add=sum(l)*5 + len(l)*15\r\n m.append(add)\r\nprint(min(m))", "kassa = int(input())\r\npeople = list(map(int, input().split()))\r\nnumber = []\r\nfor i in range(len(people)):\r\n number.append(list(map(int, input().split())))\r\nfor i in range(len(number)):\r\n number[i] = sum(number[i]) * 5 + len(number[i]) * 15\r\nprint(min(number))", "n=int(input())\nKs=[]\na=input()\nKs=a.split()\ntime=[]\nfor i in range(n):\n x=0\n b=input()\n prod=b.split()\n for j in prod:\n x+=int(j)*5\n x+=15\n time.append(x)\nprint(min(time))", "n = int(input())\nk = map(int, input().split())\nr = 51500\nfor i in range(n):\n m = list(map(int, input().split()))\n p = len(m) * 15 + 5 * sum(m)\n r = min(r, p)\nprint(r)\n", "def fun(n, arr):\r\n return sum(arr)*5 + n*15\r\nn = int(input())\r\narr = list(map(int, input().split(' ')))\r\nans = 9999999999999999999999\r\nfor i in arr:\r\n p = list(map(int, input().split(' ')))\r\n ans = min(ans, fun(i, p))\r\nprint(ans)", "n=int(input())\r\nm=[]\r\narr=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n s=0\r\n l=[int(z) for z in input().split()]\r\n s=sum(l)*5 + len(l)*15\r\n m.append(s)\r\nprint(min(m))\r\n ", "n = int(input())\nk = [int(x) for x in input().split()]\nminimum = 100000000000000000000000\nfor i in range(n):\n m = sum(map(int, input().split())) * 5 + 15 * k[i]\n if m < minimum:\n minimum = m\nprint(minimum)\n \n \n", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n \r\n return min(k)\r\nn=int(input())\r\nln=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n b=sum(a)*5+ln[i]*15\r\n k.append(b)\r\nprint(exe())", "n = int(input())\r\ninput()\r\ntimes = [0 for _ in range(n)]\r\nfor i in range(n):\r\n m = list(map(int, input().split()))\r\n times[i] = sum(m) * 5 + 15 * len(m)\r\nprint(min(times))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 100000000\r\nfor j in range(n):\r\n b = [int(i) for i in input().split()]\r\n ans = min(ans, sum(b) * 5 + 15 * a[j])\r\nprint(ans)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nk = list(map(int, input().split()))\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\nmemo = [sum(i) * 5 + len(i) * 15 for i in data]\r\n\r\nprint(min(memo))\r\n", "n = int(input())\r\nppl = list(map(int, input().strip().split()))[:n]\r\ntime = []\r\nfor i in range(0, n):\r\n temp = 15 * ppl[i]\r\n product = list(map(int, input().strip().split()))[:ppl[i]]\r\n for j in range(0, ppl[i]):\r\n temp += product[j]*5\r\n time.append(temp)\r\ntime.sort()\r\nprint(time[0])", "from sys import stdin, stdout\r\ndef istr(): return input()\r\ndef inum(): return int(stdin.readline())\r\ndef imul(): return map(int, stdin.readline().split())\r\ndef ilst(): return list(map(int, stdin.readline().split()))\r\ndef splt(): return list(stdin.readline().strip())\r\ndef emat(row): return [inum() for i in range(row)]\r\nmax_itr = 100\r\nmodd = 10**9+7\r\nfrom itertools import combinations\r\nimport math\r\n\r\n#************************* Code******************************\r\n#************************************************************\r\n\r\nl=[]\r\nn=inum()\r\ns=input()\r\nfor i in range(n):\r\n\taa=ilst()\r\n\taa=list(map(lambda x:x*5+15,aa))\r\n\tl.append(sum(aa))\r\nprint(min(l))", "n = int(input())\r\nst = list(map(int,input().split()))\r\nlstis = []\r\nfor t in range(n):\r\n lst = list(map(int,input().split()))\r\n lstis.append((sum(lst)*5)+(len(lst)*15))\r\nprint(min(lstis))\r\n", "n=int(input())\r\nc=list(map(int,input().split()))\r\nfor i in range(n):\r\n aval=c[i]*15\r\n dovom=0\r\n parsa=list(map(int,input().split()))\r\n for j in range(0,len(parsa),1):\r\n dovom+=parsa[j]\r\n dovom*=5\r\n aval=aval+dovom\r\n if i==0:\r\n min=aval\r\n if min>aval:\r\n min=aval\r\nprint(min)", "nb_cashier = int(input())\r\npeoples = [int(x) for x in input().split()]\r\nmins = int(1e6)\r\nfor i in range(nb_cashier):\r\n curr = sum([int(x) * 5 for x in input().split()])\r\n curr += peoples[i] * 15\r\n mins = min(mins, curr)\r\nprint(mins) ", "# Problem Link: https://codeforces.com/problemset/problem/408/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\nn = int(input())\r\ncust = list(map(int, input().split()))\r\n\r\nlines = []\r\nfor i in range(n):\r\n lines.append(list(map(int, input().split())))\r\n\r\nmin_time = sum(list(map(lambda x: x*5, lines[0]))) + cust[0]*15\r\nfor line in lines:\r\n time = sum(list(map(lambda x: x*5, line))) + len(line)*15\r\n if time < min_time:\r\n min_time = time\r\n\r\nprint(min_time)", "from sys import stdin , stdout \r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\ncashers=int(input()) ; queue=list(map(int,input().split())) ; ans=10**18\r\nfor i in range(cashers):\r\n summ=sum(list(map(int,input().split())))\r\n summ*=5\r\n summ+=queue[i]*15\r\n ans=min(ans,summ)\r\nprint(ans)", "n = int(input())\r\nq = map(int,input().split())\r\nrs = 10000000\r\nfor i in range(n):\r\n t = map(int,input().split())\r\n rs = min(rs, sum(5*y + 15 for y in t))\r\nprint(rs)\r\n\r\n", "import math\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n k = list(map(int,input().split()))\r\n sum1 = math.inf\r\n for i in range(n):\r\n sum2 = 0\r\n m = list(map(int,input().split()))\r\n sum2 += sum(m)*5\r\n sum2 += len(m)*15\r\n sum1 = min(sum1,sum2)\r\n print(sum1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nshortest = 100000000000\r\nl = list(map(int, input().split()))\r\nfor _ in range(n):\r\n m = list(map(int, input().split()))\r\n s = sum(m)\r\n if 5*s+15*len(m) < shortest:\r\n shortest = 5*s + 15*len(m)\r\nprint(shortest)\r\n ", "n = int(input())\r\nk = input().split()\r\nm = []\r\nscan = 0\r\nfor i in range(n):\r\n m.append(input())\r\nmin = 10000000\r\nfor j in m:\r\n a = j.split()\r\n for h in range(len(a)):\r\n a[h] = int(a[h])\r\n s = sum(a) * 5\r\n time = int(k[m.index(j)]) * 15 + s\r\n if (min > time):\r\n min = time\r\nprint(min)\r\n", "res, n, k = 999999999999, int(input()), list(map(int, input().split()))\r\nfor u in range(n): res = min(sum(list(map(int, input().split()))) * 5 + k[u] * 15, res)\r\nprint(res)", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n\ts=0\r\n\tb=list(map(int,input().split()))\r\n\tfor j in range(a[i]):\r\n\t\ts=s+(5*b[j])+15\r\n\tl.append(s)\r\nprint(min(l))", "i=lambda:[*map(int,input().split())]\r\nn=i()[0]\r\nk=i()\r\nprint(min(k[l]*15+sum(i())*5 for l in range(n)))", "n = int(input());m = list(map(int, input().split()));i = 0;a = []\r\nwhile i < n:\r\n b = list(map(int, input().split()))\r\n j = len(b) * 15\r\n for p in b:\r\n j += p * 5\r\n a.append(j)\r\n i+=1\r\na.sort();print(a[0])", "num = int(input())\r\npeeps = list(map(int, input().split()))\r\nans = float(\"inf\")\r\nfor i in range(num):\r\n ans = min(ans, sum(map(int, input().split()))*5 + peeps[i]*15)\r\nprint(ans)\r\n", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\n\r\nmin = None\r\n\r\nfor i in range(n):\r\n x = input().split()\r\n sum = 0\r\n for item in x:\r\n sum += int(item)*5\r\n sum += k[i]*15\r\n if min == None or sum < min:\r\n min = sum\r\n\r\nprint(min)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmin_ = 99999\r\nfor i in range(n):\r\n count = 0\r\n temp = sum(list(map(int, input().split())))\r\n count += (temp * 5) + (arr[i] * 15)\r\n if min_ > count:\r\n min_ = count\r\nprint(min_)", "n = int(input())\r\nk = input().split()\r\nk = [int(x) for x in k]\r\nt = []\r\nfor i in range(n) :\r\n m = input().split()\r\n m = [int(y) for y in m]\r\n sum = 0\r\n for j in m :\r\n sum += j*5+15\r\n t.append(sum)\r\nprint(min(t))", "def resultant(l):\r\n sum=int(0)\r\n for i in l:\r\n sum+=i*5+15\r\n return sum\r\nn=int(input())\r\nc=list(map(int, input().split()))\r\nl=[]\r\nfor i in range(n):\r\n l1=list(map(int, input().split()))\r\n l.append(resultant(l1))\r\nprint(min(l))", "n=int(input())\r\narray=[]\r\na=[]\r\nfor i in range(n+1):\r\n array.append(list(map(int, input().split())))\r\nfor i in range(1,n+1):\r\n a.append((sum((array[i]))*5)+array[0][i-1]*15)\r\nprint(min(a))", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\nn=int(input())\r\nk=list(map(int,input().split()))\r\nans=float(\"inf\")\r\nfor i in range(n):\r\n\tm=list(map(int,input().split()))\r\n\tcurr=(len(m))*15+(sum(m))*5\r\n\tans=min(ans,curr)\r\nprint(ans)", "n = int(input())\narr = list(map(int, input().split()))\nlol = []\nfor i in range(n):\n\tlol.append(list(map(int, input().split())))\n\nminval = 100000000000000000000\nfor i in range(n):\n\tyay = arr[i] * 15\n\tfor j in range(arr[i]):\n\t\tyay += (5 * lol[i][j])\n\tminval = min(minval, yay)\nprint(minval)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = pow(10, 9)\r\nfor i in range(n):\r\n ans = min(ans, l[i]*15+sum(list(map(int, input().split())))*5)\r\nprint(ans)", "import itertools\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n c = [int(v) for v in input().split()]\r\n mv = 100000000000000\r\n r = 0\r\n for i in range(n):\r\n data = [int(v) for v in input().split()]\r\n res = c[i]*15+sum([5 * v for v in data])\r\n mv = min(res, mv)\r\n print(mv)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\nk = list(read())\r\na = [list(read()) for i in range(n)]\r\nans = float('inf')\r\nfor i in range(n):\r\n cur = 15 * k[i]\r\n for j in range(k[i]):\r\n cur += 5 * a[i][j]\r\n ans = min(ans, cur)\r\nprint(ans)\r\n", "def main():\n input()\n mi = int(1e8)\n for _ in list(map(int, input().split(' '))):\n m = list(map(int, input().split(' ')))\n mi = min(mi, len(m) * 15 + sum(list(map(lambda i: i*5, m))))\n return mi\n\nprint(main())\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nt=[]\r\nfor _ in range(n):\r\n tl = list(map(int,input().split()))\r\n t.append(sum(tl))\r\n\r\nfor i in range(n):\r\n l[i]=(l[i]*15) + (t[i]*5)\r\nprint(min(l))\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nq_sizes = list(map(int, input().split()))\r\ndupl = []\r\nfor i in range(n):\r\n time = 0\r\n n = list(map(int, input().split()))\r\n for j in n:\r\n time = time + (5 * j)\r\n time = time + (15 * len(n))\r\n dupl.append(time)\r\nprint(min(dupl))", "R = lambda:map(int,input().split())\r\nn, = R()\r\n\r\nprint(min(15*k+5*sum(R())for k in R()))", "n = int(input())\r\nk = list(map(int, input().split()))\r\n\r\nmin_time = 10**9\r\nfor i in range(n):\r\n items = sum(map(int, input().split()))\r\n time = items * 5 + k[i] * 15\r\n min_time = min(min_time, time)\r\n\r\nprint(min_time)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nk=[]\r\nfor j in range(n):\r\n sum=0\r\n l=list(map(int,input().split()))\r\n for i in range(len(l)):\r\n sum=l[i]*5+sum\r\n sum=l1[j]*15+sum\r\n k.append(sum)\r\nprint(min(k))\r\n", "x=int(input())\r\na=list(map(int,input().split()));n=[]\r\nfor i in range(x):\r\n\tn.append((lambda x: sum(x)*5+a[i]*15)(list(map(int,input().split()))))\r\nprint(min(n))", "#Filename CF1.py\r\nn = int(input())\r\nsize = [int(i) for i in (input().split())]\r\nm = []\r\nfor i in range(0,n):\r\n m.append([])\r\n m[i] = [int(j) for j in (input().split())] \r\nans = [i*15 for i in size]\r\nfor i in range(0,n):\r\n sum=0\r\n for j in m[i]:\r\n sum = sum + j*5\r\n ans[i] = ans[i] + sum\r\nmin = ans[0]\r\nfor i in ans:\r\n if i < min:\r\n min = i\r\nprint(min)\r\n\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nval = 10000005\r\nfor i in range(n):\r\n val = min(val,sum(map(int,input().split()))*5+lst[i]*15)\r\nprint(val)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nw=[]\r\nfor i in range(n):\r\n\tp=list(map(int,input().split()))\r\n\ts=sum(p)*5\r\n\tw.append(s)\r\nt=[]\r\nfor i in range(n):\r\n\tm=(l[i]*15)+w[i]\r\n\tt.append(m)\r\nprint(min(t))", "n = int(input()) \r\nk = list(map(int,input().split()))\r\ntimar=[]\r\nfor i in range(n):\r\n a= list(map(int,input().split()))\r\n time = 15*len(a)\r\n for i in a:\r\n time+=i*5\r\n timar.append(time)\r\nprint(min(timar))\r\n ", "m=10**7+1;n=int(input());l=list(map(int,input().split()))\r\nfor i in l:m=min(sum(map(int,input().split()))*5+15*i,m)\r\nprint(m)", "t = int(input())\r\ntmin = 10**8\r\npeople = list(map(int,input().split()))\r\nfor i in range(t):\r\n arr = list(map(int,input().split()))\r\n tmin = min(tmin, sum(arr) * 5 + 15 * len(arr))\r\nprint(tmin)", "n = int(input())\narr = [int(x) for x in input().split()]\ntime_min = 51501\nfor i in range(n):\n\titems = [int(x) for x in input().split()]\n\ttime = arr[i] * 15 + sum(items) * 5\n\tif(time < time_min):\n\t\ttime_min = time\nprint(time_min)\n", "cashiers = int(input())\r\npeopleByChasier = [int(k) for k in input().split()]\r\nwait = []\r\nfor people in range(cashiers):\r\n waitSec = peopleByChasier[people] * 15\r\n for i in [int(j) for j in input().split()]:\r\n waitSec += i*5\r\n wait.append(waitSec)\r\n\r\nprint(min(wait))", "n=int(input())\r\ns=input()\r\nk=[int(i) for i in s.split()]\r\nmmin=2**31-1\r\nfor i in range(n):\r\n s=input()\r\n inp=[int(i) for i in s.split()]\r\n tmp=sum(inp)*5+15*k[i]\r\n mmin=min(mmin,tmp)\r\nprint (mmin)\r\n", "n_cash = input()\nn_cash = int(n_cash)\n\nn_people_per_cash = input()\n\narr_ppc = n_people_per_cash.split()\narr_ppc = [int(i) for i in arr_ppc]\n\nn_items_per_person = list()\n\nfor i in range(n_cash):\n items_per_person = input()\n arr_ipp = items_per_person.split()\n arr_ipp = [int(i) for i in arr_ipp]\n\n n_items_per_person.append(arr_ipp)\n\ntotal_second_per_cash = [0]*n_cash\n\nfor i in range(n_cash):\n total_second_per_cash[i] = sum(n_items_per_person[i])*5 + arr_ppc[i] * 15\n\nprint(min(total_second_per_cash))\n\t\t \t\t\t \t \t\t \t\t\t \t\t\t \t\t \t\t", "n = int(input())\r\nif n==1:\r\n lines = [int(input())]\r\nelse:\r\n lines = list(map(int, input().split()))\r\n\r\nmin_time = float('inf')\r\n\r\nfor n_people in lines:\r\n if n_people==1:\r\n line = [int(input())]\r\n else:\r\n line = list(map(int, input().split()))\r\n\r\n min_time = min(min_time, n_people*15 + sum(line)*5)\r\nprint(min_time)\r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n count=0\r\n m=list(map(int,input().split()))\r\n\r\n for j in range(len(m)):\r\n s=m[j]*5\r\n count+=15\r\n count+=s\r\n l.append(count)\r\n\r\nprint(min(l))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n l1.append(sum(a)*5+l[i]*15)\r\nprint(min(l1))", "\n\n\n\nn = int(input())\nline = input()\n\n\no = float(\"inf\")\nfor _ in range(n):\n cl = 0\n t = 0\n for c in input().split():\n c = int(c)\n cl += 1\n t += c * 5\n t += cl * 15\n o = min(o, t)\n\nprint(o)", "n = int(input())\r\nk = list(map(int,input().split()))\r\nl =[]\r\nfor i in range(n):\r\n l1 = list(map(int,input().split()))\r\n l.append(l1)\r\nans = [] \r\nfor i in range(n):\r\n l[i] = list(map(lambda i : i*5,l[i]))\r\n ans.append(sum(l[i])+(15*len(l[i])))\r\n\r\nprint(min(ans))", "n = int(input())\r\na = input().split()\r\nl = []\r\nfor i in range(n):\r\n s = 0\r\n b = input().split()\r\n for j in b:\r\n s = s+5*int(j)\r\n l.append(s+len(b)*15)\r\nprint(min(l))", "god = 10**18\r\nx = int(input())\r\nitems = list(map(int, input().split(' ')))\r\nfor i in range(x):\r\n a = list(map(int, input().split(' ')))\r\n god = min(god, sum(a)*5+15*items[i])\r\nprint(god)", "def f(l):\r\n return sum(l)*5 +15*len(l)\r\n\r\nn = int(input())\r\n\r\n_ = input()\r\n\r\nlista = [list(map(int,input().split())) for i in range(n)]\r\n\r\ntime = list(map(f,lista))\r\nprint(min(time))", "#998/A\n\n_=int(input())\n__=list(map(int,input().split()))\n_1_=[]\nfor ___ in range(len(__)):\n ____=list(map(int,input().split()))\n _____=len(____)*15\n for ______ in range(len(____)):\n _____+=5*____[______]\n _1_.append(_____)\nprint(min(_1_))", "n = int(input())\nk = input()\nv = []\nfor _ in range(0, n):\n v.append(list(map(int, input().split())))\nprint(min(sum(i * 5 + 15 for i in x) for x in v))\n", "#Cypher\r\n#Indian Institute Of Technology, Jodhpur\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nmod= 10**9+7\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n c=list(map(int,input().split()))\r\n b.append(i*15+5*sum(c))\r\nprint(min(b))", "x = int(input())\r\ninput()\r\n\r\nls = []\r\n\r\nfor i in range(x) : \r\n ls.append(list(map(int, input().split())))\r\n\r\nans = 1000000001\r\n\r\nfor i in range(x) : \r\n ans = min(ans, ((len(ls[i]) * 15) + (sum(ls[i]) * 5)))\r\n\r\nprint(ans)", "# ===================================\n# (c) MidAndFeed aka ASilentVoice\n# ===================================\n# import math \n# import collections\n# import string\n# import re\n# from random import randint\n# from math import log\n# ===================================\nn = int(input())\nans = float(\"inf\")\ninput()\nfor _ in range(n):\n q = [int(x) for x in input().split()]\n t = sum(q)*5 + len(q)*15\n ans = min(ans, t)\nprint(ans)", "n = int(input())\r\n\r\nk = list(map(int, input().split()))\r\n\r\n#print('k: ', k)\r\n\r\nm = []\r\n\r\nfor i in range(n):\r\n m.append(list(map(int, input().split())))\r\n\r\n#print('m: ', m)\r\n\r\ntime = []\r\n\r\nfor i in range(len(k)):\r\n time.append(0)\r\n for j in range(len(m[i])):\r\n time[i] += m[i][j] * 5\r\n time[i] += 15\r\n\r\n#print(time)\r\nprint(min(time))", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\npos = list()\r\n\r\nfor i in range(n):\r\n items = list(map(int, input().split()))\r\n pos.append(sum(items) * 5 + len(items) * 15)\r\n\r\nprint(min(pos))\r\n", "n = int(input())\r\nk = list(map(int, input().split()))\r\narr = [list(map(int, input().split())) for _ in range(n)]\r\nkek = []\r\nfor i in range(n):\r\n kek.append(0)\r\n kek[i] += k[i] * 15\r\n for x in arr[i]:\r\n kek[i] += x * 5\r\nprint(min(kek))\r\n", "n = int(input())\nlines = list(map(int, input().split()))\n\nnum_items = []\nfor x in range(n):\n num_items.append(list(map(int, input().split())))\n\nindex = 0\nmin_time = 9999999999\nwhile index < n:\n total_time = 5*(sum(num_items[index]))\n total_time += 15*(lines[index])\n if total_time < min_time:\n min_time = total_time\n index += 1\nprint(min_time)", "n = int(input())\r\nk = list(map(int,input().split()))\r\nl = []\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n s = 0\r\n for j in a:\r\n s = s + j*5\r\n s = s+15\r\n l.append(s)\r\nprint(min(l))\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr2=[]\r\nfor i in range(n):\r\n sum1=0\r\n arr1=[int(y) for y in input().split()]\r\n for j in arr1:\r\n sum1=sum1+(j*5)\r\n arr2.append(sum1+arr[i]*15)\r\n\r\narr2.sort()\r\nprint(arr2[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\ncur_time=min_time=0\r\na_len=len(a)\r\n\r\nfor i in range(a_len):\r\n k=list(map(int,input().split()))\r\n \r\n cur_time=0\r\n cur_time=cur_time+a[i]*15\r\n \r\n for j in k:\r\n cur_time=cur_time+j*5\r\n\r\n if i==0:\r\n min_time=cur_time\r\n elif cur_time<min_time:\r\n min_time=cur_time\r\n\r\nprint(min_time)\r\n \r\n ", "def minimum_time_to_cashier(n, k, customers):\r\n min_time = float('inf') # Initialize min_time with a very large value\r\n\r\n for i in range(n):\r\n time_per_customer = sum(customers[i]) * 5 + k[i] * 15\r\n min_time = min(min_time, time_per_customer)\r\n\r\n return min_time\r\n\r\n\r\n# Read input\r\nn = int(input()) # Number of cashiers\r\nk = list(map(int, input().split())) # Number of people in the queue for each cashier\r\ncustomers = [list(map(int, input().split())) for _ in range(n)] # Number of products for each customer in each queue\r\n\r\n# Output the result\r\nprint(minimum_time_to_cashier(n, k, customers))\r\n", "k=int(input())\r\na=list(map(int,input().split()))\r\nmin1=999999\r\nfor _ in range(k):\r\n k=list(map(int,input().split()))\r\n sum1=sum([x*5 for x in k])+len(k)*15\r\n if sum1<min1:\r\n min1=sum1\r\nprint(min1)", "n=int(input())\r\nk=list(map(int,input().split()))\r\ns=0\r\nans=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for i in l:\r\n s=s+i*5\r\n s=s+len(l)*15\r\n ans.append(s)\r\n s=0\r\nprint(min(ans))\r\n", "n = int(input())\r\nhugatsa = []\r\nb = list(map(int, input().strip().split()))\r\nfor i in range(0, n):\r\n a = list(map(int, input().strip().split()))\r\n k = sum(a) * 5 + len(a) * 15\r\n hugatsa.append(k)\r\nprint(min(hugatsa))\r\n", "n = int(input())\r\nk = list(map(int, input().split())) # k has n things\r\nans = 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\r\nfor i in range(n):\r\n m = list(map(int, input().split())) # m has k[i] things\r\n x = sum(m)\r\n y = 5 * x + 15 * k[i]\r\n if y <= ans:\r\n ans = y\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nlst=[]\r\nfor x in range(n):\r\n \r\n mrr=list(map(int,input().split()))\r\n count=0\r\n for ele in mrr:\r\n count+=ele*5\r\n count+=15*len(mrr)\r\n lst.append(count)\r\n\r\nprint(min(lst))", "n = int(input())\r\nks = list(map(int, input().split()))\r\nans = 1000000000\r\nfor i in range(n):\r\n items = sum(map(int, input().split()))\r\n ans = min(ans, ks[i]*15 + items*5)\r\nprint(ans)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nw = []\r\nfor i in range(n):\r\n s = 0\r\n k = list(map(int, input().split()))\r\n for j in range(l[i]):\r\n s += 5 * k[j]\r\n s += 15 * l[i]\r\n w.append(s)\r\nw.sort()\r\nprint(w[0])", "n = int(input())\nk = [int(i) for i in input().split()]\narr = []\nfor i in range(0,len(k)) : \n l = [int(k) for k in input().split()]\n a = 15*len(l) + sum(l)*5\n arr.append(a)\nprint(min(arr))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nemp=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n p=sum(a)*5+l[i]*15\r\n emp.append(p)\r\n \r\nprint(min(emp))\r\n \r\n", "f=lambda:map(int,input().split())\r\nn=int(input())\r\ncsh=list(f())\r\nt=1000000000\r\nfor i in range(n):\r\n a=list(f())\r\n t=min(t,sum(a)*5+15*csh[i])\r\nprint(t)", "R=lambda:map(int,input().split())\r\nn,=R()\r\nprint(min(15*k+5*sum(R())for k in R()))", "n=int(input())\r\nk=list(map(int,input().split()))\r\ntotal=0\r\nfor _ in range(n):\r\n x=list(map(int,input().split()))\r\n y=sum(x)*5+len(x)*15\r\n if total==0:\r\n total=y\r\n else:\r\n if y<total:\r\n total=y\r\nprint(total)", "n = int(input())\r\na =[0]*n\r\nd=[0]*n\r\nk = list(map(int,input().split()))\r\nfor i in range(n):\r\n\tx = list(map(int,input().split()))\r\n\ts =len(x)\r\n\td[i]=sum(x)*5+(s*15)\r\nprint(min(d))\r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nnow=0\r\nm=100000000\r\nfor i in range(n):\r\n b=map(int,input().split())\r\n now=0\r\n for j in b:\r\n now+=j*5+15\r\n m=min(m,now)\r\nprint(m)", "import itertools, math, functools, operator, collections, heapq, re, string\r\nfrom sys import stdin; inp = stdin.readline\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n n = I()\r\n terminals = IA()\r\n mi = float('inf')\r\n for i in range(n):\r\n items = IA()\r\n time = sum(5*v + 15 for v in items)\r\n mi = min(mi, time)\r\n return mi\r\n \r\nif __name__ == '__main__':\r\n print(main())", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=[]\r\nfor _ in range(n):\r\n c=[]\r\n b=list(map(int,input().split()))\r\n for j in range(0,len(b)):\r\n c.append(b[j]*5+15)\r\n d.append(sum(c))\r\nprint(min(d))", "n=int(input())\r\nk=list(map(int,input().split()))\r\na=[]\r\nm=0\r\nfor i in range(n):\r\n\tb=list(map(int,input().split()))\r\n\tif len(b)==1:\r\n\t\tm=b[0]*5+15\r\n\telse:\t\r\n\t\tfor j in range(k[i]):\r\n\t\t\tm+=b[j]*5\r\n\t\tm+=(j+1)*15\t\r\n\ta.append(m)\r\n\tm=0\r\nprint(min(a))", "n = int(input())\r\nk = list(map(int, input().split()))\r\nres = 2e9\r\nfor i in range(n):\r\n arr = list(map(int,input().split()))\r\n res = min(res, sum(arr) * 5 + 15 * len(arr))\r\nprint(res)\r\n", "n=int(input())\r\nk=[]\r\nk=input().split()\r\nfor i in range(0,n):\r\n k[i]=int(k[i])\r\nm=[]\r\nfor i in range(0,n):\r\n m.append([int(j)for j in input().split()])\r\nt=[]\r\nfor i in range(0,n):\r\n x=k[i]\r\n time=0\r\n for j in range(0,x):\r\n time=time+(m[i][j]*5)\r\n time=time+(k[i]*15)\r\n t.append(time)\r\n\r\nprint(min(t))\r\n \r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nans=[ ]\r\nfor i in range (0,n):\r\n m=list(map(int,input().split()))[:k[i]]\r\n s=sum(m)*5 + 15*k[i]\r\n ans.append(s)\r\nprint(min(ans))", "n = int(input())\nx = list(map(int, input().split()))\nans = []\nfor i in range(n):\n a = list(map(int, input().split()))\n ans.append(len(a) * 15 + sum(a) * 5)\nprint(min(ans))\n", "n=int(input())\r\nk=list(map(int, input().split()))\r\nm=[0]*n\r\ntime=[0]*n\r\nfor i in range(n):\r\n m[i]=list(map(int, input().split()))\r\n time[i]=k[i]*15\r\n for j in range(len(m[i])):\r\n time[i]+=m[i][j]*5\r\nprint(min(time))\r\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nans = 1e18\r\nfor i in lis:\r\n tmp = list(map(int,input().split()))\r\n totalTime = 0\r\n for j in tmp:\r\n totalTime += j*5\r\n totalTime+=len(tmp)*15\r\n if min(ans,totalTime)==totalTime:\r\n ans = totalTime\r\nprint(ans)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tc=list(map(int,input().split()))\r\n\td=sum(c)*5+len(c)*15\r\n\tb.append(d)\r\nprint(min(b)) ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n s=sum(a)*5+len(a)*15\r\n c.append(s)\r\nprint(min(c))\r\n ", "n=int(input())\r\nlst=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n sum1=sum(l)*5+lst[i]*15\r\n arr.append(sum1)\r\nprint(min(arr))\r\n", "l=[]\r\nz=int(input(''))\r\ns=list(map(int,input().split()))\r\nfor _ in range(z):\r\n k=list(map(int,input().split()))\r\n t=5*sum(k)+15*(s[_])\r\n l.append(t)\r\nprint(min(l))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(n):\r\n c=list(map(int,input().split()))\r\n x=0\r\n for j in c:\r\n x=x+j*5\r\n x=x+l[i]*15 \r\n l1.append(x)\r\nprint(min(l1)) ", "n = int(input())\r\npeoples = [int(x) for x in input().split()]\r\n\r\nsums = []\r\nfor i in range(n):\r\n sums.append(sum([int(x)*5 for x in input().split()]) + 15*peoples[i])\r\n\r\nprint(min(sums))", "n, l, m, nl = int(input()), [], input(), []\r\n\r\nfor i in range(n): l.append([int(i)*5 for i in input().split()])\r\nfor n in l: nl.append(len(n)*15 + sum(n))\r\n\r\nprint(min(nl))", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n b = list(map(int, input().split()))\r\n c = 5*sum(b) + 15*len(b)\r\n a.append(c)\r\nprint(min(a))\r\n\r\n\r\n ", "n=int(input());a=list(map(int,input().split()));print(min(sum(list(map(int,input().split())))*5 +a[_]*15 for _ in range(n)))", "n = int(input())\r\nk = list(map(int, input().split()))\r\nans = 10 ** 9\r\nfor i in range(n):\r\n m = list(map(int, input().split()))\r\n ans = min(ans, 15 * len(m) + 5 * sum(m))\r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(n):\r\n c = list(map(int,input().split()))\r\n b.append(c)\r\nd = []\r\nfor i in range(len(b)):\r\n d.append(sum(b[i])*5+len(b[i]*15))\r\nprint(min(d))", "n = int(input())\r\nlstn = [int(x) for x in input().split()]\r\nlst = []\r\n\r\nwhile n:\r\n n -= 1\r\n lst.extend([[int(x) for x in input().split()]])\r\n\r\ntotal = []\r\nfor i in lst:\r\n total.append(sum([5*x+15 for x in i]))\r\n\r\nprint(min(total))\r\n\r\n", "d, n = 30001, int(input())\r\nt = list(map(int, input().split()))\r\nfor i in range(n):\r\n s = sum(map(int, input().split())) + 3 * t[i]\r\n if s < d: d = s\r\nprint(d * 5)", "\r\ninput()\r\nbest = float('inf')\r\nreg = list(map(int, input().split()))\r\nfor r in range(len(reg)):\r\n clients = list(map(int, input().split()))\r\n time = sum(clients) * 5 + 15 * len(clients)\r\n best = min(best, time)\r\nprint(best)\r\n ", "n = int(input())\r\nk = list(map(int, input().split()))\r\nt = 999999999\r\nfor i in range(n):\r\n curt = 15 * k[i] + 5 * sum([x for x in map(int, input().split())])\r\n if curt < t:\r\n t = curt\r\nprint(t)", "#linetocashier\nn = int(input())\nk = [int(x) for x in input().split()]\ntime = []\nfor i in k:\n ko = [int(x) for x in input().split()]\n time.append(sum([x*5 + 15 for x in ko]))\nprint(min(time))", "n = int(input())\r\nkassu = list(map(int, input().split()))\r\nproducts = []\r\nfor i in range(n):\r\n products += [list(map(int, input().split()))]\r\nresult = []\r\nfor i in range(n):\r\n test_result = 0\r\n for j in range(kassu[i]):\r\n test_result += products[i][j] * 5 + 15\r\n result.append(test_result)\r\nprint(min(result))", "n = int(input())\r\ninput()\r\n\r\ncurMin = None\r\nfor i in range(n):\r\n A = list(map(int,input().split()))\r\n t = 15 * len(A) + sum(A) * 5\r\n if not curMin: curMin = t\r\n else: curMin = min(curMin, t)\r\nprint(curMin) ", "n = int(input())\npeople = [int(a) for a in input().split()]\ni = 0\nwhile i < n:\n item = [int(a) for a in input().split()]\n if i == 0:\n min = (sum(item)*5)+(15*len(item))\n\n sum_item = sum(item)\n tot = (sum_item*5)+(15*len(item))\n if tot < min:\n min = tot\n ls = item\n i += 1\n\nprint(min)\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nl=[[],[]]\r\nfor i in range(n):\r\n x1=list(map(int,input().split()))\r\n l[0].append([x[i],x1])\r\n l[1].append((x[i]*15)+sum(x1)*5)\r\nprint(min(l[1]))\r\n\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\np=[0]*n;zx=1e18\r\nfor i in range(n):\r\n zc=list(map(int,input().split()))\r\n p[i]=s[i]*15+sum(zc)*5\r\n zx=min(zx,p[i])\r\nprint(zx)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nc = []\r\nfor i in range(n):\r\n\tk = list(map(int,input().split()))\r\n\tc.append(sum(k)*5+15*len(k))\r\nprint(min(c))", "def kassa(lst):\r\n d = list()\r\n for elem in lst:\r\n d.append(sum(elem * 5) + len(elem) * 15)\r\n return min(d)\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nb = list()\r\nfor j in range(n):\r\n z = [int(x) for x in input().split()]\r\n b.append(z)\r\nprint(kassa(b))\r\n", "n = int(input())\r\nqueues = list(map(int, input().split()))\r\nmns = [None] * n\r\nfor num in range(n):\r\n mns[num] = list(map(int, input().split()))\r\ntimes = [None] * n\r\nfor num in range(n):\r\n time = 0\r\n for i in range(queues[num]):\r\n time += mns[num][i] * 5 + 15\r\n times[num] = time\r\nprint(min(times))", "n = int(input())\r\nk = list(input().split(' '))\r\nk = list(int(x) for x in k)\r\nans = int(1E13)\r\nfor i in range(n):\r\n loc = list(input().split(' '))\r\n loc = list(int(x) for x in loc)\r\n res = sum(loc) * 5 + len(loc)*15\r\n ans = min(ans, res)\r\nprint(ans)\r\n", "n = int(input())\nk = list(map(int, input().split()))\n\nmin_seconds = 10 ** 6\nfor i in range(len(k)):\n m = list(map(int, input().split()))\n min_seconds = min(min_seconds, 5 * sum(m) + 15 * len(m))\nprint(min_seconds)\n", "x = int(input())\r\nz = []\r\nz[0:] = map(int,input().split())\r\nw = []\r\nq = []\r\nfor i in range(len(z)):\r\n w[0:] = map(int, input().split())\r\n q.append(w[:])\r\n#print(q)\r\nlst = []\r\ncount = 0\r\nfor i in range(len(q)):\r\n for j in range(len(q[i])):\r\n count += q[i][j] * 5\r\n lst.append(count + 15 * len(q[i]))\r\n count = 0\r\n\r\nprint(min(lst))", "employee_count = int(input())\n\nline = input()\npeople_in_line = [int(i) for i in line.split()]\n\nitems = []\n\nminium = -1\nfor i in range(employee_count):\n\tline = input()\n\titems.append([int(z) for z in line.split()])\n\nfor i in items:\n\ta = sum(i)\n\ttemp = (a * 5) + (len(i) * 15)\n\tif temp < minium or minium == -1:\n\t\tminium = temp\n\nif minium == -1:\n\tprint(0)\nelse:\n\tprint(minium)\n\t\n", "def best_cash():\n\n cashes = int(input())\n costumers = input().split(' ')\n\n best = 0\n\n for costumer in costumers:\n items = input().split(' ')\n if len(items) == 0:\n return 0\n time = 0\n for item in items:\n time += int(item) * 5 + 15\n if best == 0: best = time\n if time < best: best = time\n return best\n\nprint(best_cash())\nprint('\\n')\n\n \t \t\t \t\t\t\t \t \t \t \t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n items=list(map(int,input().split()))\r\n t=sum(items)*5+len(items)*15\r\n b.append(t)\r\nprint(min(b))", "n=int(input())\r\nno_of_people=list(map(int,input().split()))\r\nT=10**10\r\nfor i in range(n):\r\n prod=list(map(int,input().split()))\r\n T=min(T,(15*len(prod))+sum([5*x for x in prod]))\r\nprint(T) ", "import math\r\nn=int(input())\r\ncp=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n t=list(map(int,input().split()))\r\n l.append(t)\r\nans=math.inf\r\nfor i in range(n):\r\n t=0\r\n for j in range(cp[i]):\r\n t+=15\r\n t+=l[i][j]*5\r\n ans=min(ans,t)\r\nprint(ans)", "n=int(input())\r\na= list(map(int, input().split()))\r\nb=[]\r\nfor i in range(n):\r\n c= list(map(int, input().split()))\r\n temp=sum(c)*5+a[i]*15\r\n b.append(temp)\r\nprint(min(b))\r\n", "import math\r\nn=int(input())\r\na=[]\r\na=list(map(int,input().strip().split()))\r\nm=10000000\r\ns=0\r\nfor i in range(n):\r\n x=[]\r\n x=list(map(int,input().strip().split()))\r\n s=0\r\n s=sum(x)*5+len(x)*15\r\n m=min(m,s)\r\nprint(m)", "n= int(input())\r\nk= list(map(int, input().split()))\r\nmat=[]\r\nfor i in range(n):\r\n l=list(map(int, input().split()))\r\n mat.append(l)\r\n\r\nres=[]\r\ntemp=0\r\n\r\nfor i in range(n):\r\n t= k[i]\r\n demo=0\r\n for j in range(t):\r\n demo= demo+mat[i][j]\r\n demo= demo*5\r\n demo+= t*15\r\n res.append(demo)\r\n\r\nprint(min(res))", "n = int(input())\ninput()\n\ntimes = []\n\nfor i in range(n):\n\tx = [int(i) for i in input().split()]\n\ttimes.append((sum(x)*5) + len(x)*15)\n\nprint(min(times))\n", "N = int(input())\r\nkassa = list(map(int, input().split()))\r\ni = 0\r\npeople = list([0] * N)\r\nwhile i != N:\r\n people[i] = list(map(int, input().split()))\r\n i += 1\r\n \r\nmin_sec = 100000000000 \r\nfor human in people:\r\n sec = 0\r\n for tovar in human:\r\n sec += tovar * 5 + 15\r\n if min_sec > sec:\r\n min_sec = sec\r\n \r\nprint(min_sec)\r\n", "cashes = int(input())\r\nlist_res = []\r\nq = list()\r\n\r\nq = list(map(int,input().strip().split()))[:cashes]\r\n\r\ni = 0\r\nfor j in range (0, len(q)):\r\n sum1 = 0\r\n list_temp = list(map(int, input().strip().split()))[:]\r\n\r\n sum1 = 5 * sum(list_temp)\r\n list_res.append(sum1 + (q[i] * 15))\r\n i += 1\r\nprint(min(list_res))\r\n", "n = int(input())\r\npeople = list(map(int, input().split()))\r\ngoods = []\r\nfor i in range(n):\r\n goods += [list(map(int, input().split()))]\r\ntime = []\r\nfor j in range(n):\r\n time += [people[j] * 15 + sum(goods[j]) * 5]\r\nprint(min(time)) ", "I = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\nK = I()\r\n\r\nprint(min(5*sum(I())+15*K[i] for i in range(n)))", "n, b = int(input()), []\r\ninput()\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n b.append(sum([5 * i for i in a]) + 15 * len(a))\r\nprint(min(b))", "n=int(input())\r\na=list(map(int,input().split()))\r\ndef cash(a):\r\n s=len(a)*15\r\n for i in a:\r\n s+=i*5\r\n return s\r\nx=list(map(int,input().split()))\r\nf=cash(x)\r\nfor i in range(n-1):\r\n x=list(map(int,input().split()))\r\n if cash(x)<f:\r\n f=cash(x)\r\nprint(f)\r\n", "n = int(input())\r\nstring = input()\r\npeople = list(map(int, string.split()))\r\ntimes = []\r\nfor x in range(n):\r\n string = input()\r\n times.append(sum(map(int, string.split())) * 5 + people[x] * 15)\r\nprint(min(times))", "n=int(input())\r\nk=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n r=0\r\n for j in range(k[i]):\r\n r=r+m[j]*5+15\r\n ans.append(r)\r\nprint(min(ans))\r\n \r\n \r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\nn = get_int()\r\ncounter = get_int_list()\r\ncounter_time = [0]*n\r\nfor i in range(n):\r\n counter_time[i] = sum(get_int_list())*5 + counter[i]*15\r\nprint(min(counter_time))", "n =int(input())\r\nlis=[]\r\nli =[int(c) for c in input().split()]\r\nfor i in range(n):\r\n l =[int(c) for c in input().split()]\r\n s = sum(l)\r\n lis.append(s*5 + li[i]*15)\r\nprint(min(lis))\r\n#print(lis)", "n = int(input())\r\nx = list(map(int, input() .split()))\r\nb=[0]*n\r\nfor i in range(n):\r\n t = 0\r\n r = 0\r\n y = list(map(int, input() .split()))\r\n for j in range(len(y)):\r\n t = t + (5*y[j])\r\n r = t + (15*x[i]) \r\n b[i] = r\r\nprint(min(b))\r\n", "n = int(input())\na = [int(x) for x in input().split()]\n\nmin = 99999999\nfor i in range(n):\n b = [int(x) for x in input().split()]\n sum = 0\n for x in b:\n sum += x\n cost = sum * 5 + a[i] * 15\n # print(cost, sum, a[i], b)\n if min > cost:\n min = cost\nprint(min) \n\n \t\t \t\t \t\t \t\t \t \t \t \t \t \t", "n = int(input())\r\nk = list(map(int, input().split()))\r\nmin_time = float('inf')\r\nfor i in range(n):\r\n time = sum(list(map(int, input().split()))) * 5 + k[i] * 15\r\n min_time = min(min_time, time)\r\nprint(min_time)", "#line_to_cashier.py\r\nn = int(input())\r\nk = list(map(int, input().split()))\r\nm = []\r\nfor i in range(n):\r\n m.append(list(map(int, input().split())))\r\n\r\nleast_time = None\r\nfor i in range(n):\r\n if least_time == None or least_time > sum(m[i])*5 + k[i]*15:\r\n least_time = sum(m[i])*5 + k[i]*15\r\n\r\nprint(least_time) \r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\n \r\nb=[]\r\nfor i in range(n):\r\n\tm=list(map(int,input().split()))\r\n\tt = sum(m)*5 + len(m)*15\r\n\tb.append(t)\r\nprint(min(b))\r\n", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n\r\nn=int(input())\r\n\r\nl=RI()\r\n\r\nl=[[] for i in range(n)]\r\nfor i in range(n):\r\n l[i]=RI()\r\n\r\nmini=1000000000\r\n\r\nfor i in range(n):\r\n temp=sum(l[i])\r\n temp*=5\r\n temp+=(len(l[i])*15)\r\n mini=min(mini,temp)\r\n\r\nprint(mini)\r\n", "l2=[]\r\nn=int(input())\r\ns=input()\r\nfor i in range(n):\r\n\tl=list(map(int,input().split()))\r\n\tl=list(map(lambda x:x*5+15,l))\r\n\tl2.append(sum(l))\r\nprint(min(l2))", "n=int(input())\ndef read():return list(map(int,input().split()))\nk=read()\nprint( min( sum(read())*5+k[i]*15 for i in range(0,n) ) )\n", "n = int(input())\r\nc = [int(i) for i in input().split()]\r\nt = []\r\n\r\nfor i in range(n):\r\n t.append(sum([int(i) for i in input().split()])*5 + c[i]*15)\r\n\r\nprint(min(t))\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn= iinput()\r\na = list(map(int,input().split()))\r\nh=[]\r\nfor i in range(n):\r\n s=list(map(int,input().split()))\r\n count=0\r\n for i in range(len(s)):\r\n count+=s[i]*5\r\n count+=len(s)*15\r\n h.append(count)\r\nprint(min(h))", "n = int(input())\r\nl = list(map(int,input().split()))\r\no = []\r\nfor i in range(n):\r\n\tcount = 0\r\n\tp = list(map(int,input().split()))\r\n\tfor i in p:\r\n\t\tcount += i*5\r\n\to.append(count+len(p)*15)\r\nprint(min(o))\t\t ", "def calculator(men, buying):\r\n result = 0\r\n result += sum(buying) * 5\r\n result += men * 15\r\n return result\r\n\r\ndef main():\r\n pay_desks = int(input())\r\n queue = list(map(int, input().split()))\r\n temporal = 0\r\n amount = calculator(queue[0], list(map(int, input().split())))\r\n for i in range(1, pay_desks):\r\n temporal = calculator(queue[i], list(map(int, input().split())))\r\n if temporal < amount:\r\n amount = temporal\r\n print(amount)\r\n\r\nmain()", "n = int(input())\r\nk = [*map(int, input().split())]\r\nprint(min(sum(map(int, input().split()))*5+k[i]*15 for i in range(n)))\r\n", "n, b= int(input()), []\r\ninput()\r\nfor i in range(n):\r\n a=list(map(int, input().split()))\r\n b.append(sum([5*i for i in a])+15*len(a))\r\nprint(min(b))\r\n \r\n", "n = int(input())\r\nnumberOfCashiers=[]\r\nseconds=[]\r\nnumberOfPeople = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n numberOfCashiers.append([int(j) for j in input().split()])\r\ndef getCost(list):\r\n num=0;\r\n for i in range(len(list)):\r\n num = num+(list[i]*5)\r\n num= num+15*(len(list))\r\n return num\r\ndef getSeconds(list):\r\n minmums =[]\r\n for i in range(len(list)):\r\n minmums.append( getCost(numberOfCashiers[i]))\r\n return min(minmums)\r\nprint(getSeconds(numberOfCashiers))", "from math import inf\n\nn, k = int(input()), (int(i) for i in input().split())\nres = inf\nfor _ in range(n):\n m = (int(i) for i in input().split())\n s = 15 * next(k) + 5 * sum(m)\n res = min(res, s)\nprint(res)\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nminn=10000000000000\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n if (sum(m)*5+15*k[i])<minn:\r\n minn=sum(m)*5+15*k[i]\r\nprint(minn)", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nsetrecursionlimit(10**7)\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nn=RI()[0]\nRI()\nans=10**7\nfor i in range(n):\n\tm=RI()\n\tval=5*sum(m)+15*len(m)\n\tans=min(val,ans)\nprint(ans)\n", "chasiers=int(input())\r\nqueus=list(map(int,input().split()))\r\narray=[]\r\nfor i in range(len(queus)):\r\n l=list(map(int,input().split()))[:queus[i]]\r\n array.append(sum(l)*5+15*len(l))\r\nprint(min(array))", "def count_time():\r\n p = list(map(int, input().split()))\r\n d = 0\r\n for i in p:\r\n d += i * 5 + 15\r\n return d\r\n\r\n\r\nn = int(input())\r\nk = list(map(int, input().split()))\r\nf = []\r\nfor i in range(n):\r\n f += [count_time()]\r\nprint(min(f))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n x=sum(l)*5\r\n y=a[i]*15\r\n b.append(x+y)\r\nprint(min(b))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=10000000000000\r\nfor i in range (n):\r\n l1=list(map(int,input().split()))\r\n t=0\r\n for j in range (len(l1)):\r\n t=l1[j]*5+t\r\n t=t+(len(l1)*15)\r\n # print(t)\r\n ans = min(ans,t)\r\nprint(ans)\r\n", "c = int(input())\r\nq= list(map(int, input().split()))\r\nj=[]\r\ns=0\r\nans=999999999999999999\r\nfor i in range(c):\r\n j= [int(x)*5 for x in input().split()]\r\n s= sum(j)+ len(j)*15\r\n ans= min(ans,s)\r\nprint(ans)", "x = []\r\nN = int(input()) ##number of ppl\r\nxx = input()\r\ncount = 0\r\nx1 = xx.split()\r\nx2 = []\r\nx3 = []\r\nx4 = []\r\nxx2 = ''\r\nfor i in x1:\r\n x.append(int(i))\r\nfor i in range(N):\r\n xx2 = input()\r\n x3 = xx2.split()\r\n for j in x3:\r\n count = count + (int(j)*5) \r\n count = count + 15*x[i]\r\n x4.append(count)\r\n count = 0\r\nprint(min(x4))\r\n ", "\n\n\nn = int(input())\n\nk = list(map(int,input().split()))\n\nempty = []\nfor i in range(n):\n k1 = list(map(int,input().split()))\n sum = 0\n for j in k1:\n sum+=15+(j*5)\n empty.append(sum)\nempty.sort()\nprint(empty[0])\n \n", "num=int(input())\r\npeople=list(map(int,input().split(' ')))\r\nlistt=[]\r\nfor x in people:\r\n inp=list(map(int,input().split(' ',x-1)))\r\n listt.append(inp)\r\n\r\ntime=[]\r\nfor i in listt:\r\n timee=0\r\n for j in i:\r\n timee+=(5*j)\r\n timee+=len(i)*15\r\n time.append(timee)\r\nprint(min(time))", "n = int(input())\r\n\r\ndaf1 = list(map(int, input().split()))\r\n\r\nmin_time = 51501\r\n\r\nfor i in range(n):\r\n daf2 = list(map(int, input().split()))\r\n\r\n len_daf2 = len(daf2)\r\n\r\n s = sum(daf2)\r\n\r\n time = s * 5 + len_daf2 * 15\r\n\r\n min_time = min(min_time, time)\r\n\r\nprint(min_time)\r\n", "n=int(input(\"\"));ar=list(map(int,input(\"\").split()));l=[]\r\nfor i in range(n):\r\n ar1=list(map(int,input(\"\").split()))\r\n l.append(sum(ar1)*5 + len(ar1)*15)\r\nprint(min(l))\r\n ", "n=int(input())\r\nstore=[list(map(int,input().split()))]\r\nx=0\r\nwhile x<n:\r\n s=list(map(int,input().split()))\r\n items=0\r\n for y in s:\r\n items=items+y\r\n store.append(items)\r\n x=x+1;\r\ntmin=0\r\nfor x in range(n):\r\n time=store[0][x]*15+5*store[x+1]\r\n if x==0:\r\n tmin=time\r\n else:\r\n tmin=min(tmin,time)\r\nprint(tmin)\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = [int(i) for i in input().split()]\nans = 10 ** 9\nfor test in range(n):\n l = [int(i) for i in input().split()]\n ans = min(sum(l) * 5 + len(l) * 15, ans)\nprint(ans)\n", "# python 3\n\"\"\"\nMatrix,in which all diagonal elements equal k and other elements equal 0, satisfied all conditions.\n\"\"\"\n\n\ndef line_to_cashier(n_int: int, k_list: list, m_list: list) -> int:\n time_list = []\n for i_int in range(n_int):\n people_int = k_list[i_int]\n time_int = 0\n for person in range(people_int):\n time_int += m_list[i_int][person] * 5\n time_int += 15\n time_list.append(time_int)\n\n return min(time_list)\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n n = int(input())\n k = list(map(int, input().split()))\n m = []\n for i in range(n):\n m.append(list(map(int, input().split())))\n # print(n, k, m)\n print(line_to_cashier(n, k, m))\n", "import math\r\n\r\nn = int(input())\r\nk = input().split()\r\nk = [int(i) for i in k]\r\nmin_time = math.inf\r\nscan_time = 5\r\nadd_time = 15\r\nfor i in range(0,n):\r\n m = input().split()\r\n m = [int(j) for j in m]\r\n curr_time = 0\r\n for j in m:\r\n curr_time += j * scan_time\r\n curr_time += add_time\r\n if curr_time < min_time:\r\n min_time = curr_time\r\nprint(min_time)\r\n", "n = int(input())\nk = [int(i) for i in input().split()]\nans = []\nfor i in range(n):\n m = [int(j) for j in input().split()]\n ans.append(sum(m)*5+k[i]*15)\nprint(min(ans))\n", "n = int(input())\nks = [int(i) for i in input().split()]\n\nmi = 10**9\nfor k in range(n): \n mi = min(mi, sum([5*int(i)+15 for i in input().split()]))\nprint(mi)" ]

[ "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nn=int(input())\nX=sorted(map(int,input().split()))\ni=1-n\nj=n-2\ns=0\nn=X[j]-X[i]\nwhile s<n:\n\tl,r=X[i]-X[0],X[-1]-X[j]\n\tif l<r:\n\t\tif n<=l:\n\t\t\ts=n\n\t\t\tbreak\n\t\ti+=1\n\t\ts=l\n\telse:\n\t\tif n<=r:\n\t\t\ts=n\n\t\t\tbreak\n\t\tj-=1\n\t\ts=r\n\tn=X[j]-X[i]\ns/=2\nprint(s)\nprint(s+X[0],X[j]-s,X[-1]-s)\n", "#!/usr/bin/env\tpython\r\n#-*-coding:utf-8 -*-\r\nn=int(input())\r\nX=sorted(map(int,input().split()))\r\ni=1-n\r\nj=n-2\r\ns=0\r\nn=X[j]-X[i]\r\nwhile s<n:\r\n\tl,r=X[i]-X[0],X[-1]-X[j]\r\n\tif l<r:\r\n\t\tif n<=l:\r\n\t\t\ts=n\r\n\t\t\tbreak\r\n\t\ti+=1\r\n\t\ts=l\r\n\telse:\r\n\t\tif n<=r:\r\n\t\t\ts=n\r\n\t\t\tbreak\r\n\t\tj-=1\r\n\t\ts=r\r\n\tn=X[j]-X[i]\r\ns/=2\r\nprint(s)\r\nprint(s+X[0],X[j]-s,X[-1]-s)\r\n\r\n", "from bisect import *\n#n, m = map(int, raw_input().split())\nn = int(input())\nk=3\nsol = [0] * k\na=sorted(list(map(int,input().split())))\n\ndef test(m):\n sol[0]=a[0]\n for i in range(1,k):\n sol[i]=sol[i-1]\n it = bisect(a,sol[i-1]+m)\n if it<n:\n sol[i]=a[it]\n return (sol[k - 1] + m) >= a[-1]\n\n\nl=-1\nr=a[-1]\nwhile(l<r-1):\n m=(l+r)//2\n if test(m):\n r=m\n else:\n l=m\ntest(r) \nprint(\"{:0.6F}\".format(r/2))\nprint(' '.join(map(lambda x: \"{:0.6F}\".format(x+r/2),sol)))\n", "from decimal import *\r\nn=int(input())\r\na=sorted(map(int,input().split()))\r\ni=1-n\r\nj=n-2\r\ns=0\r\ngetcontext().prec = 6\r\nDecimal(1) / Decimal(7)\r\nn=a[j]-a[i]\r\nwhile s<n:\r\n\tl,r=a[i]-a[0],a[-1]-a[j]\r\n\tif l<r:\r\n\t\tif n<=l:\r\n\t\t\ts=n\r\n\t\t\tbreak\r\n\t\ti+=1\r\n\t\ts=l\r\n\telse:\r\n\t\tif n<=r:\r\n\t\t\ts=n\r\n\t\t\tbreak\r\n\t\tj-=1\r\n\t\ts=r\r\n\tn=a[j]-a[i]\r\ns/=2\r\nprint(Decimal(s))\r\nprint(Decimal(s+a[0]),float(a[j]-s),float(a[-1]-s))" ]

[ "line = input()\nans = \"NO\"\n\nfor i in range(len(line) - 6):\n if line[i: i + 7].count('0') == 7 or line[i: i + 7].count('1') == 7:\n ans = \"YES\"\n break\nprint(ans)\n", "'''A. Football'''\r\nn = input()\r\nx=0\r\nif '1111111' in n or '0000000' in n:\r\n print('YES')\r\nelse:\r\n print('NO')", "nums = input()\r\nlenOfZero = nums.split(\"1\")\r\nlenOfOnes = nums.split(\"0\")\r\nmaximum = 0\r\nfor i in lenOfOnes:\r\n maximum = max(maximum, len(i))\r\nfor i in lenOfZero:\r\n maximum = max(maximum, len(i)) \r\nif maximum >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\nc=0\r\nd=0\r\nk=0\r\np=0\r\nfor i in s:\r\n if i=='1':\r\n c=c+1\r\n else:\r\n k=max(k,c)\r\n c=0\r\n k=max(k,c)\r\nfor i in s:\r\n if i=='0':\r\n d=d+1\r\n else:\r\n p=max(p,d)\r\n d=0\r\n p=max(p,d)\r\nif k>=7 or p>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read input\r\ns = input()\r\n\r\n# Initialize variables to keep track of consecutive players\r\nconsecutive_zeros = 0\r\nconsecutive_ones = 0\r\n\r\n# Iterate through the string\r\nfor player in s:\r\n if player == '0':\r\n consecutive_zeros += 1\r\n consecutive_ones = 0 # Reset the count for consecutive ones\r\n else:\r\n consecutive_ones += 1\r\n consecutive_zeros = 0 # Reset the count for consecutive zeros\r\n \r\n # Check if there are 7 or more consecutive players from the same team\r\n if consecutive_zeros >= 7 or consecutive_ones >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "def dangerous(word):\r\n zero=0\r\n ones=0\r\n for i in range(0, len(word)):\r\n if word[i]=='1':\r\n zero=0\r\n ones+=1\r\n if ones>=7:\r\n return True\r\n else:\r\n ones=0\r\n zero+=1\r\n if zero>=7:\r\n return True\r\n return False\r\n\r\ndef main():\r\n word = input()\r\n if dangerous(word):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\ns=list(s)\nc1=c0=0\nif s[0]==\"1\":\n c1+=1\nelse:\n c0+=1\nf=False\nfor i in range(1,len(s)):\n if s[i]==\"1\" and s[i-1]==\"1\":\n c1+=1\n if c1>=7:\n print(\"YES\")\n f=True\n break\n if s[i]==\"0\" and s[i-1]==\"0\":\n c0+=1\n if c0>=7:\n print(\"YES\")\n f=True\n break\n if s[i]==\"1\" and s[i-1]==\"0\" and c0<7:\n c0=0\n c1=1\n if s[i]==\"0\" and s[i-1]==\"1\" and c1<7:\n c1=0\n c0=1\nif f==False:\n print(\"NO\")", "s = input()\r\n\r\ndangerous = False\r\n\r\nif '0000000' in s or '1111111' in s:\r\n dangerous = True\r\n\r\nif dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\nlast=n[0]\r\nd=0\r\no=\"NO\"\r\nfor c in n:\r\n if c==last:\r\n d+=1\r\n else:\r\n d=1\r\n last=c\r\n if d==7:\r\n o=\"YES\"\r\n break\r\nprint(o)\r\n", "a = input()\r\n\r\nzero = one = 0\r\nfor i in a:\r\n if int(i) == 0:\r\n zero += 1\r\n one = 0\r\n else:\r\n one += 1\r\n zero = 0\r\n if zero == 7 or one == 7:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "count = 1\r\npre = None\r\nfor i in input():\r\n count = count+1 if i == pre else 1\r\n if count == 7:\r\n print(\"YES\")\r\n break\r\n pre = i\r\nelse:\r\n print(\"NO\")", "s=input()\na,b=0,0\nfor i in range(len(s)):\n if s[i]=='1':\n a+=1\n b=0\n if a>6:\n print('YES')\n break\n\n elif s[i]=='0':\n b+=1\n a=0\n if b>6:\n print('YES')\n break\nelse:\n print('NO')\n\t \t\t \t\t \t \t \t\t\t\t\t\t\t\t\t\t\t", "t = input()\r\ncount1 = 0\r\ncount0 = 0\r\ny = \"NO\"\r\nfor x in t:\r\n if x == \"1\":\r\n count1 += 1\r\n count0 = 0\r\n elif x == \"0\":\r\n count0 += 1\r\n count1 = 0\r\n if count0 >= 7 or count1 >= 7:\r\n y = \"YES\"\r\n break\r\nprint(y)\r\n", "c=0\r\ny=input()\r\na=[]\r\nh=0\r\nfor x in y:\r\n a.append(x)\r\nfor i in range(0,len(a)-1):\r\n if a[i]==a[i+1]:\r\n c=c+1\r\n else:\r\n c=0 \r\n if c>=6:\r\n h=1 \r\nif h==1 :print(\"YES\") \t\r\nelse:print(\"NO\") ", "n = input()\nt=n[0]\nc = 1\nflag = 0\nfor i in range(1,len(n)):\n if t == n[i]:\n c += 1\n if c >= 7:\n flag = 1\n break\n else:\n c = 1\n t=n[i]\nif flag == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t\t\t\t \t\t\t\t \t \t\t \t\t", "def is_dangerous(situation):\r\n for i in range(len(situation) - 6):\r\n if situation[i:i+7].count(\"0\") == 7 or situation[i:i+7].count(\"1\") == 7:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nsituation = input().strip()\r\nprint(is_dangerous(situation))\r\n", "l=list(map(int,input()))\r\nl.append(0);c=p=0\r\nfor i in range(len(l)):\r\n if not l[i]:\r\n c=max(c,i-p);p=i+1\r\n\r\np=0;l.pop();l.append(1)\r\nfor i in range(len(l)):\r\n if l[i]:\r\n c=max(c,i-p);p=i+1\r\n\r\nif c>= 7:\r\n print('YES')\r\n \r\nelse:\r\n print('NO')\r\n", "s=input()\r\nt=[]\r\nt.extend(s)\r\ncnt=1\r\nmaxi=t[0]\r\nflag=False\r\nfor i in range(1,len(t)):\r\n if maxi==t[i] :\r\n cnt+=1\r\n maxi=t[i]\r\n else :\r\n cnt=1\r\n maxi=t[i]\r\n if cnt==7:\r\n flag=True\r\n break\r\nif flag :\r\n print('YES')\r\nelse :\r\n print('NO')", "s=input()\r\nn=len(s)\r\nnum=1\r\na=s[0]\r\nfor i in range(1,n):\r\n if s[i]==a:\r\n num+=1\r\n a=s[i]\r\n else:\r\n num=1\r\n a=s[i]\r\n if num==7:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "#F\n\nuser=input()\ncnt=0\nfor i in range(6,len(user)): \n if user[i-6:i+1]==\"0000000\" or user[i-6:i+1]==\"1111111\":\n cnt+=1\n \nif cnt==0:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t \t \t \t \t \t\t \t \t\t \t", "s=input()\r\ncount=0\r\nl=0\r\nfor i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n count+=1\r\n else:\r\n if count<6:\r\n count=0\r\nif count>=6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\nif '0000000' in a or '1111111' in a:\n print('YES')\n exit()\nelse:\n print('NO')\n\n \n\n\n\t \t\t\t\t\t\t\t \t\t\t \t\t \t \t \t \t\t\t\t", "s = input()\r\ncount = 1\r\nfor i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n count = count+1 \r\n else:\r\n count =1\r\n if count ==7:\r\n print(\"YES\")\r\n break\r\nif count!=7:\r\n print(\"NO\")", "from collections import deque\r\n\r\nq = deque(maxlen=7)\r\n\r\nfor x in input():\r\n q.append(x)\r\n if len(q) == 7 and len(set(q)) == 1:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "s = input()\r\nans = \"NO\"\r\nfor i in range(len(s)):\r\n substring = s[i:i+7]\r\n if substring == '0'*7 or substring == '1'*7:\r\n ans = \"YES\"\r\nprint(ans)\r\n", "n = input()\r\n\r\na = n[0]\r\nj = 1\r\ndangerous = False\r\n\r\nfor i in range(1, len(n)):\r\n if n[i] == a:\r\n j += 1\r\n if j == 7:\r\n dangerous = True\r\n break\r\n else:\r\n a = n[i]\r\n j = 1\r\n\r\nprint(\"YES\" if dangerous else \"NO\")\r\n", "n=input()\r\nif((\"1\"*7)in n)or((\"0\"*7)in n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\");", "s=str(input())\r\nc=0\r\nfor i in range(1,len(s)):\r\n if(s[i-1]==s[i]):\r\n c+=1\r\n if(c>=6):\r\n break\r\n else:\r\n c=0\r\nif(c>=6):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\r\ncount = 0\r\ntempLetter = \".\"\r\nfor letter in string:\r\n if tempLetter != letter:\r\n count = 1\r\n tempLetter = letter\r\n else:\r\n count += 1\r\n if count == 7:\r\n print(\"YES\")\r\n break\r\nif count < 7:\r\n print(\"NO\")", "import sys\r\n\r\n\r\ndef get_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int_list():\r\n return list(get_ints())\r\n\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef solve(s):\r\n\r\n last_c = \"v\"\r\n count = 0\r\n\r\n for c in s:\r\n if c == last_c:\r\n count += 1\r\n else:\r\n last_c = c\r\n count = 1\r\n\r\n if count == 7:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n\r\ns = get_string()\r\n\r\nprint(solve(s))\r\n", "def football(ch):\r\n\r\n for i in range(len(ch)):\r\n if ch[i:i+7] =='0000000' or ch[i:i+7]=='1111111':\r\n return('YES')\r\n\r\n return('NO')\r\n\r\nch=str(input())\r\nprint(football(ch))", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n\nif __name__ == '__main__':\n s = input().strip()\n p = ''\n a = 0\n r = False\n for c in s:\n \tif c == p:\n \t\ta+=1\n \telse:\n \t\tp = c\n \t\ta = 1\n \tif a == 7:\n \t\tr = True\n if r:\n \tprint(\"YES\")\n else:\n \tprint(\"NO\")\n\t\t\t\t \t \t\t \t \t \t \t\t\t\t", "n=input()\r\nif '1111111' in n or '0000000'in n:print('YES')\r\nelse:print('NO')\r\n ", "n = input()\r\nk = 1\r\nfor i in range(1, len(n)):\r\n if n[i] == n[i-1]:\r\n k+=1\r\n else:\r\n k = 1\r\n if k == 7:\r\n print(\"YES\")\r\n break\r\nif k < 7:\r\n print(\"NO\")", "com=str(input())\r\nl=''\r\ncount=1\r\nfor i in com:\r\n if i==l:\r\n count+=1\r\n else:\r\n l=i\r\n count=1\r\n if count>=7:\r\n break\r\nprint('YES' if count>=7 else 'NO')\r\n\r\n\r\n\r\n\r\n", "n = input()\r\nn = str(n)\r\nif \"0000000\" in n or \"1111111\" in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ntmp = 1\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i - 1]:\r\n tmp += 1\r\n else:\r\n tmp = 1\r\n if tmp == 7:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n = input()\r\na = 0\r\nb = 0\r\nfor i in range(len(n)-1):\r\n if n[i] == n[i+1]:\r\n a += 1\r\n if a >= 6:\r\n b+=1\r\n break\r\n else:\r\n a = 0\r\nif b !=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ncount = 1\r\nprev = s[0]\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] == prev:\r\n count += 1\r\n if count >= 7:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n count = 1\r\n prev = s[i]\r\n\r\nprint(\"NO\")\r\n", "s = input()\r\nif ((\"1\"*7) in s) or ((\"0\"*7) in s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_dangerous(s):\r\n consecutive_count = 1\r\n prev_player = s[0]\r\n \r\n for player in s[1:]:\r\n if player == prev_player:\r\n consecutive_count += 1\r\n if consecutive_count >= 7:\r\n return \"YES\"\r\n else:\r\n consecutive_count = 1\r\n prev_player = player\r\n \r\n return \"NO\"\r\n\r\n# Read input\r\nsituation = input().strip()\r\n\r\n# Check if the situation is dangerous\r\nresult = is_dangerous(situation)\r\nprint(result)\r\n", "b = input()\r\nif \"0000000\" in b or \"1111111\" in b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nif \"1111111\" in (a) or '0000000' in (a):\r\n print('YES')\r\nelse:\r\n print('NO')", "string=input();print([\"NO\",\"YES\"][7*\"1\"in string or 7*\"0\"in string])", "s=input()\nc=0\nfor i in range(len(s)):\n if i==0:\n c+=1\n # print(i,c)\n else:\n if(s[i]!=s[i-1]):\n c=1\n # print(i,c)\n if(s[i]==s[i-1]):\n c+=1\n # print(i,c)\n if(c>=7):\n print(\"YES\")\n break\nif(c<7):\n print(\"NO\")\n\t \t \t\t \t \t\t \t \t\t\t\t \t \t", "s = input()\r\nprint('YES' if ('0000000' in s or '1111111' in s) else 'NO')", "a=input()\r\ns=0\r\nflag=0\r\nfor i in range(1,len(a),1):\r\n if a[i]==a[i-1]:\r\n s=s+1\r\n if s==6:\r\n flag=1\r\n break\r\n else:\r\n s=0\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nx = '0'*7\r\ny = '1'*7\r\nif x in s or y in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st=input()\r\nc=1\r\nflag=0\r\nfor i in range(1,len(st)):\r\n if(st[i]==st[i-1]):\r\n c=c+1\r\n if(c>=7):\r\n print('YES')\r\n flag=1\r\n break\r\n else:\r\n c=1\r\nif(flag==0):\r\n print('NO')\r\n ", "x=input()\nif \"0000000\" in x:\n print(\"YES\")\nelif \"1111111\" in x:\n print(\"YES\")\nelse:\n print(\"NO\")\n# x=list(x)\n# count=0\n# for i in range(1,len(x)-1):\n# if x[i]==x[i-1]:\n# count+=1\n# else:\n# count=0\n# if(count>=6):\n# print(\"YES\")\n# break\n# print(count)\n# if(count<6):\n# print(\"NO\")\n \t\t\t \t\t\t\t \t\t\t\t\t\t\t \t \t\t", "txt = input()\r\nu = 1\r\nfor i in range(len(txt) - 1):\r\n\r\n if txt[i] == txt[i+1]:\r\n u += 1\r\n else :\r\n u = 1\r\n if u == 7 :\r\n break\r\n\r\nif u == 7 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 18 14:56:16 2023\r\n\r\n@author: latst\r\n\"\"\"\r\ndanger_1 = '1111111'\r\ndanger_2 = '0000000'\r\nposition = input()\r\nif danger_1 in position:\r\n print('YES')\r\nelif danger_2 in position:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nc = 0\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == '0':\r\n c=c+1\r\n else:\r\n if c>=7:\r\n break\r\n c=0\r\n i=i+1 \r\nif c>=7:\r\n print(\"YES\")\r\nelse:\r\n c=0\r\n i=0\r\n while i < len(s):\r\n if s[i] == '1':\r\n c=c+1\r\n else:\r\n if c>=7:\r\n break\r\n c=0\r\n i=i+1\r\n if c>=7:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n \r\n ", "a = input()\r\nc = 1\r\nflag = True\r\n\r\nfor i in range(len(a)-1):\r\n if a[i] == a[i+1]:\r\n c+=1\r\n else:\r\n c = 1\r\n if c >= 7:\r\n print('YES')\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"NO\")", "s=input()\r\namax=0\r\nbmax=0\r\na=0\r\nb=0\r\nfor i in s:\r\n if i=='0':\r\n b=0\r\n a+=1\r\n amax=max(a,amax)\r\n else:\r\n a=0\r\n b+=1\r\n bmax=max(b,bmax)\r\n\r\nif amax>=7 or bmax>=7:print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\nconsecutive_zeros = 0\r\nconsecutive_ones = 0\r\nfor char in s:\r\n if char == '0':\r\n consecutive_zeros += 1\r\n consecutive_ones = 0 # Reset consecutive ones count\r\n else:\r\n consecutive_ones += 1\r\n consecutive_zeros = 0 # Reset consecutive zeros count\r\n if consecutive_zeros >= 7 or consecutive_ones >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "def football(n):\r\n c=1\r\n for i in range(1,len(n)):\r\n if n[i]==n[i-1]:\r\n c+=1\r\n if c>=7:\r\n return \"YES\"\r\n else:\r\n c=1\r\n return \"NO\"\r\nn=input()\r\nprint(football(n))", "str_input = input()\r\nif len(str_input) < 7:\r\n print(\"NO\")\r\nelse:\r\n type_char = str_input[0]\r\n total = 1\r\n\r\n for char in str_input[1:]:\r\n if char == type_char:\r\n total += 1\r\n else:\r\n type_char = char\r\n total = 1\r\n \r\n if total >= 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n", "s = input()\r\nch = False\r\nfor i in range(len(s)):\r\n if s[i:i + 7] in ('0000000', '1111111'):\r\n ch = True\r\n break\r\nif ch:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "q = \"0000000\"\r\np = \"1111111\"\r\nk = input()\r\nif q in k or p in k:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "def is_dangerous(s):\r\n cnt = 1\r\n prev = s[0]\r\n for c in s[1:]:\r\n if c == prev:\r\n cnt += 1\r\n else:\r\n cnt = 1\r\n prev = c\r\n if cnt == 7:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ns = input().strip()\r\nprint(is_dangerous(s))", "n = input()\r\nx = 0\r\nfor i in n.split(\"0\"):\r\n if len(i) >= 7:\r\n x+=1\r\nfor i in n.split(\"1\"):\r\n if len(i) >= 7:\r\n x+=1\r\nif x >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nc = 'NO'\r\nz, o = int(), int()\r\nfor i in s:\r\n if c == 'NO':\r\n if i == '0': z += 1\r\n if i == '1':\r\n if z < 7: z = 0\r\n else: c = 'YES'\r\n if i == '1': o += 1\r\n if i == '0':\r\n if o < 7: o = 0\r\n else: c = 'YES'\r\nif z >= 7 or o >= 7: c = 'YES'\r\nprint(c)\r\n", "def footBall(n):\r\n counter=0\r\n fchar=n[0]\r\n c=0\r\n while counter<7 and c<len(n):\r\n if fchar==n[c]:\r\n counter+=1\r\n c+=1\r\n else:\r\n fchar=n[c]\r\n counter=0\r\n \r\n if counter>=7:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nn=input(\"\")\r\nfootBall(n) ", "t=str(input())\r\nu=len(t)-1\r\ncount=0\r\nreset=0\r\nfor i in range(u):\r\n if t[i]==t[i+1]:\r\n count+=1\r\n if count>=6:\r\n reset=count\r\n else:\r\n count=0\r\n \r\nif reset>=6 and len(t)<=100:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "li = list(map(int, input()))\r\nc = 1\r\nres = 0\r\nfor i in range(1,len(li)):\r\n if li[i] != li[i-1]:\r\n c = 1\r\n else:\r\n c += 1\r\n if c >= 7:\r\n res = 1\r\n break\r\nif res == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nfor i in range(len(a)): \r\n\tfor u in range(1,7):\r\n\t\tif i + u >= len(a) or a[i] != a[i+u]:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint('YES')\r\n\t\tbreak\r\nelse:\r\n\t\tprint('NO')", "st=input()\r\ndan=\"NO\"\r\ncount=1\r\nfor i in range(len(st)-1):\r\n if st[i]==st[i+1]:\r\n count+=1\r\n if count>=7:\r\n dan=\"YES\"\r\n else:\r\n count=1\r\nprint(dan)\r\n \r\n", "pos = input()\r\n\r\nif '1111111' in pos or '0000000' in pos:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\npitch = input()\r\n\r\ndef is_dangerous(pitch): \r\n count = 0\r\n team = pitch[0]\r\n for p in range(len(pitch)):\r\n if pitch[p] == team:\r\n count += 1\r\n if count == 7: return \"YES\"\r\n else:\r\n count = 1\r\n team = pitch[p]\r\n return \"NO\"\r\n\r\nprint(is_dangerous(pitch))", "position = input()\r\nind0 = 0\r\nind1 = 0\r\nisn0 = 1\r\nfor i in range(len(position)):\r\n\r\n if int(position[i]) == 0:\r\n ind0 += 1\r\n ind1 = 0\r\n elif int(position[i]) == 1:\r\n ind1 += 1\r\n ind0 = 0\r\n\r\n if ind1 >= 7 or ind0 >=7:\r\n print(\"YES\")\r\n isn0 = 0\r\n\r\n break\r\n\r\nif isn0 :\r\n print(\"NO\")\r\n", "def is_dangerous(s):\r\n for i in range(len(s) - 6):\r\n if s[i:i+7].count('0') == 7 or s[i:i+7].count('1') == 7:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ns = input()\r\nprint(is_dangerous(s))\r\n", "string = input()\r\ncounter = 1\r\nfor i in range(1, len(string)):\r\n if counter == 7:\r\n break\r\n elif string[i] == string[i-1]:\r\n counter += 1\r\n else:\r\n counter = 1\r\nif counter >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "user = input()\nzero = user.count(\"0\")\none = user.count(\"1\")\nif zero>=7 or one >=7:\n num = user[0]\n count = 1\n flag = False\n for i in range(1,len(user)):\n if user[i] == num:\n count +=1\n else:\n num = user[i]\n count = 1\n if count >=7:\n print(\"YES\")\n flag = True\n break\n if flag == False:\n print(\"NO\")\nelse:\n print(\"NO\")\n \t\t\t\t \t\t\t \t \t \t \t", "a=input()\r\n\r\nif (a.find('1111111'))>=0 or (a.find('0000000'))>=0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "vals= input()\r\ncount=1\r\ncount_list=[]\r\n\r\n\r\nval_list0 = vals.split('1')\r\nval_list1 = vals.split('0')\r\n\r\nres0 = len(max(val_list0, key=len))\r\nres1 = len(max(val_list1, key=len))\r\n\r\n\r\nif res0 >= 7 or res1 >= 7:\r\n print(\"YES\")\r\nelse:\r\n print (\"NO\")", "line = input()\r\n\r\ncurrent = -1\r\ncounter = 0\r\nfor x in line:\r\n if(int(x) != current):\r\n current = int(x)\r\n counter = 1\r\n elif(int(x) == current):\r\n counter += 1\r\n if(counter == 7):\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n\r\n ", "s=input()\r\nif \"0000000\" in s:\r\n print('YES\\n')\r\nelif \"1111111\" in s:\r\n print('YES\\n')\r\nelse:\r\n print(\"NO\\n\")", "list1=input()\r\ncount=0\r\nfor i in list1:\r\n if i=='1':\r\n if count<=0:\r\n count=1\r\n else:count+=1\r\n else:\r\n if count>=0:\r\n count=-1\r\n else:count-=1\r\n if abs(count)==7:\r\n print('YES')\r\n break\r\nelse:print('NO')", "n = input()\r\ns = n.find('0000000')\r\nr = n.find('1111111')\r\nif s+1 or r+1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ncount = 0\r\nflag = True\r\nfor i in range (len(s)-1):\r\n if s[i]==s[i+1]:\r\n count+=1\r\n else:\r\n if s[i]!=s[i+1]:\r\n count=0\r\n if count>=6:\r\n print ('YES')\r\n flag=False\r\n break\r\nif flag==True:\r\n print ('NO')", "situation = input()\r\ncount = 1\r\nfor i in range(1, len(situation)):\r\n if(situation[i] == situation[i - 1]):\r\n count += 1\r\n else:\r\n count = 1\r\n if(count >= 7):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = input()\r\nn1 = s.find(\"0000000\")\r\nn2 = s.find(\"1111111\")\r\n\r\nif(n1 != -1 or n2 != -1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "pos = input()\neachCr = 1\nisDanger = 'NO'\nfor i in range(len(pos) - 1):\n\tif pos[i] == pos[i + 1]:\n\t\teachCr += 1\n\telse: \n\t\teachCr = 1\n\tif eachCr >= 7:\n\t\tisDanger = 'YES'\n\t\tbreak\nprint(isDanger)\n \t\t\t \t\t\t \t\t \t \t \t", "situation = input().strip()\r\n\r\nif '0000000' in situation or '1111111' in situation:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\r\nc=0\r\nfor i in range(len(x)):\r\n k=i+7\r\n if x[i:k]==\"0000000\" or x[i:k]==\"1111111\":\r\n print(\"YES\")\r\n break\r\n else:\r\n c=c+1\r\nif c==len(x):\r\n print(\"NO\")\r\n ", "s = input()\r\nif \"0000000\" in s or \"1111111\" in s:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "s = input()\r\ntest1 = '1'*7\r\ntest2 = '0'*7\r\nif test1 in s or test2 in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_dangerous(s):\r\n cnt = 1\r\n for i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n cnt += 1\r\n if cnt >= 7:\r\n return \"YES\"\r\n else:\r\n cnt = 1\r\n return \"NO\"\r\n\r\nn = input()\r\nans = is_dangerous(n)\r\nprint(ans)", "x=input()\r\ny=1\r\nfor i in range(len(x)-1):\r\n if x[i]==x[i+1]:\r\n y+=1\r\n elif x[i]!=x[i+1]:\r\n y=1\r\n if y==7:\r\n print('YES')\r\n break\r\nif y<7:\r\n print('NO')\r\n", "x=input()\nif '1111111' in x or '0000000' in x:\n print(\"YES\")\nelse:\n print(\"NO\")", "#王奕欢 2300012285\r\na=input()\r\nif \"0000000\"in a or \"1111111\"in a :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n a=input()\r\n if \"0000000\" in a or \"1111111\" in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def dangerous(s):\r\n if \"0000000\" in s or \"1111111\" in s:\r\n return \"YES\"\r\n else:\r\n return\"NO\"\r\ns = input().strip()\r\nprint(dangerous(s))", "count = 1\r\npre = None\r\nfor i in input():\r\n if i == pre:\r\n count += 1\r\n else:\r\n count = 1\r\n if count == 7:\r\n print(\"YES\")\r\n break\r\n pre = i\r\nelse:\r\n print(\"NO\")", "string = input()\r\ncount_0 = 1\r\ncount_1 = 1\r\nflag = False\r\n\r\nfor i in range(1, len(string)):\r\n if int(string[i]) == 1:\r\n if int(string[i - 1]) == 1:\r\n count_1 += 1\r\n if count_1 == 7:\r\n flag = True\r\n break\r\n else:\r\n count_1 = 1\r\n count_0 = 0\r\n else:\r\n if int(string[i - 1]) == 0:\r\n count_0 += 1\r\n count_1 = 1\r\n if count_0 == 7:\r\n flag = True\r\n break \r\n else:\r\n count_0 = 1\r\n count_1 = 0\r\n\r\nif flag == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "t = input()\r\ndanger = \"NO\"\r\n\r\nif(len(t) < 7):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(t) - 6):\r\n if(t[i:i+7] == \"1111111\" or t[i:i+7] == \"0000000\"):\r\n danger=\"YES\"\r\n break\r\n print(danger)", "def main():\r\n s = input()\r\n print('YES' if '1111111' in s or '0000000' in s else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 11 19:23:06 2023\r\n\r\n@author: liu\r\n\"\"\"\r\n\r\nn = input()\r\nif '1111111' in n or '0000000' in n:\r\n print('YES')\r\nelse:\r\n print('NO')", "players = input()\r\nif \"1\"*7 in players or \"0\"*7 in players:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\ns = input()\r\n\r\nl = s[0]\r\nn = 0\r\nres = []\r\nfor c in s:\r\n if c == l:\r\n n += 1\r\n else:\r\n l = c\r\n res.append(n)\r\n n = 1\r\nres.append(n)\r\n\r\nif max(res) >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb= a.find(\"1111111\")\r\nc= a.find(\"0000000\")\r\nprint(\"YES\" if b+1 or c+1 else \"NO\")", "score = input()\n\nif score == \"\":\n\tprint(\"NO\")\n\nprev = score[0]\n\ncount_one = 0 if prev == \"0\" else 1\ncount_zero = 0 if prev == \"1\" else 1\nres = \"NO\"\n\nfor s in score[1:]:\n\tif s == \"0\":\n\t\tif prev == \"0\":\n\t\t\tcount_zero += 1\n\t\telse:\n\t\t\tcount_one = 0\t\t\n\t\t\tcount_zero += 1\n\t\tprev = \"0\"\n\tif s == \"1\":\n\t\tif prev == \"1\":\n\t\t\tcount_one += 1\n\t\telse:\n\t\t\tcount_zero = 0 \n\t\t\tcount_one += 1\t\n\t\tprev= \"1\"\n\tif count_zero == 7 or count_one == 7:\n\t\tres = \"YES\"\n\nprint(res)\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\n\r\nst = insr()\r\nj = 0\r\nl = []\r\n\r\nfor i in range(len(st)):\r\n j = i + 1\r\n count = 0\r\n while j < len(st):\r\n if st[i] == st[j]:\r\n count = count + 1\r\n else:\r\n break\r\n j = j + 1\r\n\r\n # Move the append statement here, after the inner loop\r\n l.append(count + 1)\r\n\r\nl.sort()\r\n\r\nif l[len(l) - 1] >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nc1=0\r\nc2=0\r\nf=0\r\nfor i in a:\r\n if i=='0':\r\n c1+=1\r\n c2=0\r\n if c1==7:\r\n f=1\r\n elif i=='1':\r\n c2+=1\r\n c1=0\r\n if c2==7:\r\n f=1\r\nif f>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "d = input()\nif (d.__contains__(\"1111111\") or d.__contains__(\"0000000\")):\n print(\"YES\")\nelse:\n print(\"NO\")\nquit()\n \t \t \t\t\t \t \t\t \t \t\t \t \t\t", "situation = input()\r\n\r\ndangerous = \"1111111\" in situation or \"0000000\" in situation\r\n\r\nif dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nx , y = 0 , 0\r\nfor i in range(len(s)):\r\n if(s[i]=='0'):\r\n x+=1\r\n y=0\r\n if(x==7):\r\n break\r\n else:\r\n y+=1\r\n x=0\r\n if(y==7):\r\n break\r\nif(x==7 or y==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = [i for i in input()]\r\nk = 1\r\ncon = True\r\nfor i in range(1,len(n)+1):\r\n if k == 7:\r\n print('YES')\r\n con = False\r\n break\r\n elif i == len(n):\r\n break\r\n elif n[i] == n[i-1]:\r\n k += 1\r\n else:\r\n k = 1\r\nif con:\r\n print(\"NO\")\r\n \r\n\r\n", "string =str(input())\r\nlength_string = len(string)\r\nzeros = \"0000000\"\r\nones = \"1111111\"\r\nif zeros in string or ones in string :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "s = input()\nprint(\"YES\" if (\"0\"*7 in s) or (\"1\"*7 in s) else \"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 10 10:21:58 2023\r\n\r\n@author: aniut\r\n\"\"\"\r\n\r\ndata = input()\r\n\r\ncou = 1\r\n\r\nfor i in range (1,len(data),1):\r\n if data[i-1] == data[i]:\r\n cou += 1\r\n else:\r\n cou = 1\r\n \r\n if cou == 7:\r\n print(\"YES\")\r\n break\r\n\r\nif cou != 7:\r\n print(\"NO\")", "s=input()\r\ns1=\"1111111\"\r\ns0=\"0000000\"\r\nif s1 in s:\r\n print(\"YES\")\r\nelif s0 in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "b = input()\r\n\r\n\r\nif b.count('0000000') or b.count('1111111'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def f():\r\n s=input()\r\n count=1\r\n j=1\r\n while j<len(s):\r\n if s[j]==s[j-1]:\r\n count=count+1\r\n j=j+1\r\n else:\r\n if count>=7:\r\n return \"YES\"\r\n count=1\r\n j=j+1\r\n if count>=7:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nprint(f())", "p=\"1111111\"\r\nq=\"0000000\"\r\nn=input()\r\nif( (p in n) or (q in n)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "##########football########\r\nq = \"0000000\"\r\np = \"1111111\"\r\nk = str(input())\r\nif q in k or p in k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\ntemp=a[0]\r\ncount=1\r\nflag=0\r\nfor i in range(1,len(a)):\r\n if temp==a[i]:count+=1\r\n else:\r\n temp=a[i]\r\n count=1\r\n if count>=7:\r\n flag=1\r\n break\r\nif flag==1:print('YES')\r\nelse:print('NO')", "def main(s):\r\n n = 0\r\n\r\n a = True if s[0] == \"1\" else False\r\n\r\n for i in range(len(s)):\r\n if (s[i] == \"1\" and not a) or (s[i] == \"0\" and a):\r\n n = 1\r\n a = not a\r\n else: n += 1\r\n\r\n if n >= 7: return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n\r\n print(main(s))", "def count(s):\n cnt = 1\n prev = s[0]\n for i in s[1:]:\n if i == prev:\n cnt += 1\n if cnt >= 7:\n return \"YES\"\n else:\n cnt = 1\n prev = i\n return \"NO\"\n\ns = input()\nprint(count(s))", "s = input()\r\nn, count = len(s), 1\r\nfor i in range(1,n):\r\n if s[i] == s[i-1]:\r\n count+=1\r\n if count == 7: break\r\n else:\r\n count = 1\r\nif count == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nn = input()\r\n\r\nif 7 * '0' in n or 7 * '1' in n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "t=input()\r\nl1=t.split(\"1\")\r\nl2=t.split(\"0\")\r\ncnt=0\r\nfor i in l1:\r\n cnt=max(cnt, len(i))\r\nfor i in l2:\r\n cnt=max(cnt, len(i))\r\nif cnt>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def football(str):\r\n if str.find(\"0000000\")!=-1 or str.find(\"1111111\")!=-1:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nstr=input()\r\nprint(football(str))", "word = str(input())\r\nsubstr1 = word.find('1111111')\r\nsubstr2 = word.find('0000000')\r\nif substr1 == -1 and substr2 == -1:\r\n print('NO')\r\nelse:\r\n print('YES')", "s=input()\r\na=s.split('0')\r\nb=s.split('1')\r\nflag=0\r\nfor i in a:\r\n if len(i)>6:\r\n flag=1\r\nfor j in b:\r\n if len(j)>6:\r\n flag=1\r\nif flag==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "string = input()\nstring+='e'\n#print(string)\ncount = 1\nfor i in range(len(string)):\n if count==7:\n print('YES')\n break\n else:\n if string[i+1]=='e':\n print('NO')\n break\n else:\n if string[i]==string[i+1]:\n count+=1\n else:\n count=1\n \t\t\t \t \t \t \t\t \t\t \t \t\t \t\t", "s = input() \r\ncount = 0 \r\nfor i in range(len(s)-6):\r\n if s[i:i+7] == \"0000000\" or s[i:i+7] == \"1111111\":\r\n count+=1\r\nif count >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=input()\r\nif 7*\"1\" in l or 7*\"0\" in l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input()\r\nch = x[0]\r\ncount = 0\r\nfor i in range(len(x)):\r\n if ch == x[i]:\r\n count += 1\r\n else:\r\n count = 1\r\n ch = x[i] \r\n if count == 7 :\r\n print(\"YES\")\r\n break\r\nif count < 7 :\r\n print(\"NO\")", "s=input()\r\ncount=1\r\nfor i in range(0,len(s)-1):\r\n if(s[i]==s[i+1]):\r\n count=count+1\r\n else:\r\n count=1\r\n if count==7:\r\n break\r\nif(count>=7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def football():\r\n s=str(input())\r\n countt=1\r\n currentSearch=s[0]\r\n for i in range(1,len(s)):\r\n if s[i]==currentSearch:\r\n countt+=1\r\n else:\r\n currentSearch=s[i]\r\n countt=1\r\n continue\r\n if countt==7:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(football())", "field = input()\r\nprint(\"YES\" if \"1111111\" in field or \"0000000\" in field else \"NO\")\r\n", "number = input()\r\nif '0000000' in number or '1111111' in number:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "s1 = input()\r\nc = 1\r\nfor i in range(1, len(s1)):\r\n if s1[i] == s1[i-1]:\r\n c += 1\r\n if c == 7:\r\n print(\"YES\")\r\n exit(0)\r\n else:\r\n c = 1\r\nprint(\"NO\")\r\n", "string = input()\r\n\r\nif string.find(\"1111111\") == -1 and string.find(\"0000000\") == -1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\r\nprint(\"YES\") if '1111111' in s or '0000000' in s else print(\"NO\")", "s = input()\r\nk = 7\r\nif(len(s)<7):\r\n print(\"NO\")\r\nelse:\r\n for i in range(0,len(s)-k+1):\r\n if(s[i:k+i].count(\"1\")==7):\r\n print(\"YES\")\r\n break\r\n if(s[i:k+i].count(\"0\") == 7):\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n ", "t = input()\r\ncount = 0\r\n\r\nif len(t) < 7:\r\n print(\"NO\")\r\nelse:\r\n for i in range(1, len(t)):\r\n if t[i - 1] == t[i]:\r\n count += 1\r\n if count == 6:\r\n print(\"YES\")\r\n break\r\n else:\r\n count = 0\r\n else:\r\n print(\"NO\")", "s=input()\r\na=s.count('0000000')\r\nb=s.count('1111111')\r\nif a>=1 or b>=1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n = input()\r\nz = \"0000000\"\r\no = \"1111111\"\r\nif z in n or o in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "player_input = input()\r\nif '1111111' in player_input or '0000000' in player_input:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nplayers = input()\r\ncount_zeros = 0\r\ncount_ones = 0\r\nfor player in players:\r\n if player == '0':\r\n count_zeros += 1\r\n count_ones = 0 \r\n else:\r\n count_ones += 1\r\n count_zeros = 0 \r\n if count_zeros >= 7 or count_ones >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\") \r\n\r\n", "#!/usr/bin/python\r\n# -*- coding: UTF-8 -*-\r\n\r\n\r\na=input()\r\nstr=len(a)\r\ni=0\r\nwhile i<=str-7:\r\n if(a[i]=='0' and a[i+1]=='0' and a[i+2]=='0' and a[i+3]=='0' and a[i+4]=='0' and a[i+5]=='0' and a[i+6]=='0'):\r\n print(\"YES\")\r\n break\r\n if(a[i]=='1' and a[i+1]=='1' and a[i+2]=='1' and a[i+3]=='1' and a[i+4]=='1' and a[i+5]=='1' and a[i+6]=='1'):\r\n print(\"YES\")\r\n break\r\n i+=1\r\nif (i==str-6 or str<=6):\r\n print(\"NO\")", "# n = input()\r\n\r\n# count_dict = {}\r\n\r\n# curr = n[0]\r\n# for digit in n:\r\n# if digit == curr:\r\n# count_dict[digit] = 1 + count_dict.get(digit, 0)\r\n# curr = digit\r\n\r\n# if '0' in count_dict and count_dict['0'] >= 7:\r\n# print('YES')\r\n# elif '1' in count_dict and count_dict['1'] >= 7:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\nn = input()\r\n\r\n# Initialize variables to keep track of consecutive players and the current team\r\nconsecutive_players = 1 # Start with 1 player (the first one)\r\ncurrent_team = n[0] # Start with the first team\r\n\r\ndangerous = False # Initialize the danger flag\r\n\r\n# Start from the second player (index 1) and iterate through the rest\r\nfor i in range(1, len(n)):\r\n if n[i] == current_team:\r\n consecutive_players += 1\r\n if consecutive_players >= 7:\r\n dangerous = True\r\n break # No need to check further, it's already dangerous\r\n else:\r\n current_team = n[i]\r\n consecutive_players = 1 # Reset consecutive count for the new team\r\n\r\nif dangerous:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nl=s.split('1111111')\r\nr=s.split('0000000')\r\nif len(l)>1 or len(r)>1:\r\n print('YES')\r\nelse:\r\n print('NO')", "string=input()\r\nif \"0000000\" in string or \"1111111\" in string:print(\"YES\")\r\nelse:print(\"NO\")", "n = input()\r\nc = 1\r\nfor i in range(len(n)-1):\r\n if n[i] == n[i+1]:\r\n c += 1\r\n elif n[i] != n[i+1]:\r\n c=1\r\n if c>=7:\r\n break\r\nif c >= 7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#import sys\r\n#input = sys.stdin.readline\r\n#def solve():\r\n #n = str(input())\r\n #n = int(input())\r\n #n,k =map(int, input().split())\r\n #a = list(map(int, input().split()))\r\n#a =map(int, input().split())\r\na = str(input())\r\ns = 0\r\nv = 0\r\nfor i in range(len(a)-1):\r\n if a[i] == a[i+1]:\r\n s = s + 1\r\n if s == 6:\r\n print('YES')\r\n v += 1\r\n break\r\n else: s = 0\r\nif v == 0:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n# return\r\n#for _ in range(int(input())):\r\n # solve()\r\n\r\n\r\n\r\n", "c=1\r\na=input()\r\n#i=1\r\nfor i in range(len(a)):\r\n if a[i]==a[i-1]:\r\n c+=1\r\n if c==7:\r\n print(\"YES\")\r\n break\r\n else:\r\n c=1\r\nif c!=7:\r\n print(\"NO\")\r\n#print(\"NO\")", "form = input()\nif '0000000' in form:\n print('YES')\nelif '1111111' in form:\n print('YES')\nelse:\n print('NO')\n\n \t\t\t \t\t\t\t \t \t \t \t\t\t\t \t\t\t", "l = input()\r\nn_0 = 0\r\nn_1 = 0\r\nfor c in l:\r\n if c=='0':\r\n n_0 += 1\r\n if n_0==7: break\r\n n_1 = 0\r\n else:\r\n n_1 += 1\r\n if n_1==7: break\r\n n_0 = 0\r\nif n_0==7 or n_1==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\nc1=0\r\nc2=0\r\nk=0\r\nfor i in range(len(n)):\r\n if n[i]=='0':\r\n c2=0\r\n c1=c1+1\r\n else:\r\n c1=0\r\n c2=c2+1\r\n if c1>7 or c1==7 or c2==7 or c2>7:\r\n print('YES')\r\n k+=1\r\n break\r\nif k==0:\r\n print('NO')", "n=input()\r\no=0\r\nans='NO'\r\nfor i in n:\r\n if i=='1':\r\n if o<0: o=0\r\n o+=1\r\n else:\r\n if o>0: o=0\r\n o-=1\r\n if o==7 or o==-7:\r\n ans='YES'\r\n break\r\nprint(ans)", "def is_dangerous(situ):\r\n consec_count = 1 \r\n previous_player = situ[0] \r\n\r\n for player in situ[1:]:\r\n if player == previous_player:\r\n consec_count += 1\r\n if consec_count >= 7:\r\n return \"YES\" \r\n else:\r\n consec_count = 1\r\n previous_player = player\r\n\r\n return \"NO\" \r\nsitu = input().strip()\r\nprint(is_dangerous(situ))\r\n", "a = input()\r\nif len(a)<=100:\r\n if '0000000' in a or '1111111' in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "p = input()\r\nif \"0000000\" in p or \"1111111\" in p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "i = input()\r\nif ('1'*7) in i:\r\n print('YES')\r\nelif ('0'*7) in i:\r\n print('YES')\r\nelse:\r\n print('NO')", "count = 1\nsit = input()\nflag = False\nfor i in range(len(sit) - 1):\n if sit[i] == sit[i + 1]:\n count += 1\n if count == 7:\n flag = True\n break\n else:\n count = 1\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x = input()\r\nprint('YES' if '1111111' in x or '0000000' in x else 'NO')", "s = input()\r\nnum = 0\r\nfor i in range(len(s)):\r\n if (i + 1) != len(s):\r\n if s[i] == s[i + 1]:\r\n num += 1\r\n else:\r\n num = 0\r\n if num == 6:\r\n print(\"YES\")\r\n break\r\n elif (i + 1) == len(s):\r\n print(\"NO\")", "lav=input()\r\nif \"0000000\" in lav or \"1111111\" in lav:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "sequencia = input()\r\ncontador_perigo = 0\r\n\r\nfor bit in range(0, len(sequencia)-1):\r\n if sequencia[bit] == sequencia[bit+1]:\r\n contador_perigo += 1\r\n if (contador_perigo == 6):\r\n break\r\n else:\r\n contador_perigo = 0\r\n\r\nif contador_perigo == 6:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Oct 4 10:20:31 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\ns=input()\ns1='0000000'\ns2='1111111'\nif s1 in s or s2 in s:\n print('YES')\nelse:\n print('NO')", "#PROBLEM - Compare each index with the index infront of it and check if it's the same, if so, add one to the counter, if not, move to next index and repeat\r\n#PROBLEM_2 - If a string is repeated 7 times in a row, \r\n#SOLUTION -\r\n\r\nplayers_string = list(str(input()))\r\n\r\nint_counter = 1\r\n\r\nfor s in range(len(players_string)-1):\r\n \r\n if int_counter == 7:\r\n break\r\n \r\n elif players_string[s] == players_string[s+1]:\r\n int_counter += 1\r\n \r\n else:\r\n int_counter = 1\r\n\r\n\r\nif int_counter >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 11 19:28:54 2023\r\n\r\n@author: masiyu004\r\n\"\"\"\r\n\r\nl=input()\r\nx=y=0\r\nfor i in range(len(l)-1):\r\n if x<6 and y<6:\r\n if l[i]=='0' and l[i+1]=='0':\r\n x+=1\r\n else:\r\n x=0\r\n if l[i]=='1' and l[i+1]=='1':\r\n y+=1\r\n else:\r\n y=0\r\n else:\r\n break\r\nif x==6 or y==6:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n\r\n \r\n\r\n ", "aa = input()\r\nn = 0\r\nfor i in range(0,len(aa) - 6):\r\n if aa[i] == aa[i + 1] and aa[i] == aa[i + 2] and aa[i] == aa[i + 3] and aa[i] == aa[i + 4] and aa[i] == aa[i + 5] and aa[i] == aa[i + 6]:\r\n n = n + 1\r\nif n == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n ", "s = input()\r\nprint(\"YES\") if s.find(\"0000000\")!=-1 or s.find(\"1111111\")!=-1 else print(\"NO\")", "player = input()\n\ncount = 0\nlast = 'x'\n\nanswer = 'NO'\n\nfor p in player:\n if p == last:\n count += 1\n else:\n count = 1\n last = p\n\n if count >= 7:\n answer = 'YES'\n\nprint(answer)", "s1 = '0'*7\r\ns2 = '1'*7\r\ns = input()\r\nif s1 in s or s2 in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nc=0\r\nma=0\r\nfor i in range(len(s)-1):\r\n\r\n if(s[i]==s[i+1]):\r\n c=c+1\r\n \r\n else:\r\n ma=max(c,ma)\r\n c=0\r\n continue\r\nma=max(ma,c) \r\nif(ma>=6):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "a = input()\r\nn = 0\r\nl = \" \"\r\nfor c in a:\r\n if c == l:\r\n n += 1\r\n else:\r\n n = 1\r\n l = c\r\n if n >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "dangerous_counter = 0\r\ncondition = True\r\n\r\nstringInput = input()\r\nlist_stringInput = list(stringInput)\r\n\r\nfor i in range(0, len(stringInput) - 1):\r\n if list_stringInput[i] == list_stringInput[i + 1]:\r\n dangerous_counter += 1\r\n else:\r\n dangerous_counter = 0\r\n\r\n if dangerous_counter == 6:\r\n condition = False\r\n break \r\n \r\nif condition:\r\n print(\"NO\")\r\nelse: \r\n print(\"YES\")", "s=input()\r\nprint(\"YES\" if s.count(\"0000000\")|s.count(\"1111111\") else \"NO\")", "def isDanger(lineup):\n lineup = list(lineup)\n danger = \"NO\"\n count = 1\n for i in range(len(lineup)):\n \n if i == 0:\n continue\n elif lineup[i] == lineup[i-1]:\n count += 1\n else:\n count = 1\n\n if count == 7:\n danger = \"YES\"\n break\n \n return danger\n\n\ndef main():\n lineup = input()\n print(isDanger(lineup))\n\n\n\nif __name__ == \"__main__\":\n main()", "class A96:\r\n def Input(self):\r\n while True:\r\n try:\r\n while True:\r\n self.s = str(input())\r\n if(0 < len(self.s) and len(self.s) <= 100):\r\n break\r\n except (KeyError, ValueError) as vle:\r\n print(\"Error: \" + str(vle))\r\n else:\r\n self.lst = list(self.s)\r\n break\r\n finally:\r\n pass\r\n\r\n def Solving(self):\r\n count = int(1)\r\n for i in range(1, len(self.lst)):\r\n if(self.lst[i] == self.lst[i-1]):\r\n count += 1\r\n else:\r\n count = int(1)\r\n if(count == 7):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n problem = A96()\r\n problem.Input()\r\n print(problem.Solving())\r\n\r\n", "m=input()\r\nl=''\r\nn=[]\r\nb=1\r\nfor i in m:\r\n if(i==l):\r\n b+=1\r\n else:\r\n n.append(b)\r\n b=1\r\n l=i\r\nn.append(b)\r\nif(max(n)>=7):\r\n print('YES')\r\nelse:\r\n print('NO')", "def sol():\r\n\ts = input()\r\n\tc = 1\r\n\tfi = s[0]\r\n\tfor i in s[1:]:\r\n\t\tif i == fi:\r\n\t\t\tc += 1\r\n\t\t\tif c >= 7:\r\n\t\t\t\treturn \"YES\"\r\n\t\telse:\r\n\t\t\tfi = i\r\n\t\t\tc = 1\r\n\treturn \"NO\"\r\n\r\nprint(sol())\r\n\r\n", "a = input()\r\nb=[]\r\nfor i in a:\r\n b.append(i)\r\nc=0\r\nflag=0\r\nfor i in range(len(b)-1):\r\n if b[i] == b[i+1]:\r\n c+=1\r\n else:\r\n c=0\r\n if c==6:\r\n flag=1\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "situation=input()\r\n#situation=str(situation)\r\n\r\none=situation.split(\"1\")\r\nzero=situation.split(\"0\")\r\nflag1=0\r\n\r\nfor i in one:\r\n y=i\r\n if len(y)>6:\r\n flag1=1\r\nflag2=0\r\nfor i in zero:\r\n y=i\r\n if len(y)>6:\r\n flag2=1\r\n \r\nif flag1==1 or flag2==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n# situation=100000001\r\n# c=0\r\n# for i in range(len(str(situation))):\r\n# for j in range(i+1,len(str(situation))):\r\n# if i==j:\r\n# c+=1\r\n# break", "x = input()\r\nscz = 0\r\nsco = 0\r\nfor i in x:\r\n if i == \"0\":\r\n scz += 1\r\n sco = 0\r\n else:\r\n scz = 0\r\n sco += 1\r\n if scz >= 7 or sco >= 7:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "s = input()\r\nc, res = [], 0\r\n\r\nc.append(s.split('0'))\r\nc.append(s.split('1'))\r\n\r\nfor i in c[0]:\r\n if len(i) >= 7:\r\n res = 1\r\n\r\nfor i in c[1]:\r\n if len(i) >= 7:\r\n res = 1\r\n \r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')", "row = input()\r\nprint('YES' if '0000000' in row or '1111111' in row else 'NO')", "n = input()\r\n\r\nx = \"0000000\"\r\nz = \"1111111\"\r\n\r\nif ((x in n) or (z in n)):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "n = input()\r\nprint(\"YES\" if n.find(\"0000000\") != -1 or n.find(\"1111111\") != -1 else \"NO\")", "x = input()\r\ny = list(x)\r\ny = [int(i) for i in y]\r\na = 1\r\nc = 0\r\nfor b in range(1,len(y)):\r\n if y[b] == y[b-1]:\r\n a += 1\r\n if a == 7:\r\n c += 1\r\n break\r\n else:\r\n a = 1\r\nif c == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=input()\na='1111111'\nb='0000000'\nif a in n or b in n:\n print('YES')\nelse:\n print('NO')\n \t \t\t \t\t\t\t\t\t \t \t\t\t \t \t\t \t\t", "t=0\r\ns=input()\r\nfor i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n t=t+1\r\n if t>5:\r\n print('YES')\r\n break\r\n else :\r\n t=0\r\nif t<6 :\r\n print('NO') \r\n ", "s=input()\r\ndangerous=False\r\ncount=0\r\nfor i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n count+=1 \r\n else:\r\n count=0 \r\n if count==6:\r\n dangerous=True \r\nif dangerous : print(\"YES\")\r\nelse: print(\"NO\")", "n = input()\r\nans = \"\"\r\nfor i in n.split('1'):\r\n if len(i) >= 7:\r\n ans = \"YES\"\r\n break\r\n ans = \"NO\"\r\nif ans == \"NO\":\r\n for i in n.split('0'):\r\n if len(i) >= 7:\r\n ans = \"YES\"\r\n break\r\n ans = \"NO\"\r\nprint(ans)", "t = input()\r\nl=len(t)\r\nc1,c0=0,0\r\nflag=1\r\nif l<7:\r\n print(\"NO\")\r\nelse:\r\n for i in range(l):\r\n if t[i]=='1':\r\n c0=0\r\n c1+=1\r\n if c1>=7:\r\n flag=0\r\n #print(\"YES\")\r\n elif t[i]=='0':\r\n c1=0\r\n c0+=1\r\n if c0>=7:\r\n flag=0\r\n #print(\"Yes\")\r\n if flag==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "positions = input()\r\nzero = 0\r\none = 0\r\ndangerous = False\r\n\r\nfor i in positions:\r\n if i == '0':\r\n one = 0\r\n zero += 1\r\n if (zero >= 7): break\r\n else:\r\n zero = 0\r\n one += 1\r\n if (one >= 7): break\r\n\r\nprint('YES') if (zero >= 7) or (one >= 7) else print('NO')", "n=input()\r\nd=list(n)\r\ni=0\r\nanswer=0\r\nwhile i < len(d)-1:\r\n if d[i]==d[i+1]:\r\n answer+=1\r\n if answer ==6 :\r\n print(\"YES\")\r\n break\r\n else:\r\n answer=0\r\n i+=1\r\nif answer != 6 :\r\n print(\"NO\")", "a = input()\r\na = list(a)\r\ndangerous = 1;\r\nfor i in range(0, len(a)):\r\n if i > 0 and a[i] == a[i - 1]: dangerous += 1\r\n else: dangerous = 1\r\n if (dangerous == 7): print(\"YES\"); exit(0)\r\nprint(\"NO\")", "#蒋世刚2300016304\r\ncon0=0\r\ncon1=0\r\no=0\r\nfor i in input():\r\n if int(i)==0:\r\n con1+=1\r\n con0 = 0\r\n if con1==7:\r\n o=1\r\n print('YES')\r\n break\r\n else:\r\n con0+=1\r\n con1 = 0\r\n if con0==7:\r\n o=1\r\n print('YES')\r\n break\r\nif o!=1:\r\n print('NO')\r\n\r\n", "x = input()\r\nk = 1\r\nboole = False\r\nfor i in range(0, len(x) - 1):\r\n if x[i] == x[i + 1]:\r\n k += 1\r\n if k >= 7:\r\n boole = True\r\n else:\r\n k = 1\r\nif boole:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\n\r\ndanger_1 = '0000000'\r\ndanger_2 = '1111111'\r\n\r\nflag = False\r\n\r\n\r\n\r\nfor i in range(len(n)-6):\r\n #print(i)\r\n if n[i] == '1' and n[i:i+7] == '1111111':\r\n flag = True\r\n break\r\n elif n[i] == '0' and n[i:i+7] == '0000000':\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "pos = input()\r\nif \"0\"*7 in pos or \"1\"*7 in pos:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\ns = s+'='\nc = 0\nfor i in range(len(s)-1):\n if c==6:\n print('YES')\n break\n elif s[i]==s[i+1]:\n c+=1\n else:\n c=0\n\nif c<6:\n print('NO')", "def si(t):\r\n danger_len = 7\r\n if len(t) < danger_len:\r\n return \"NO\"\r\n for i in range(0,len(t)):\r\n cheak = t[i:i+7]\r\n if len(set(cheak)) == 1 and len(cheak) == 7:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nt = input()\r\nprint(si(t))", "a=input()\r\nb=0\r\nc=0\r\nwhile b<len(a)-6:\r\n if a[b]==a[b+1]==a[b+2]==a[b+3]==a[b+4]==a[b+5]==a[b+6]:\r\n c=1\r\n b+=1\r\n else:\r\n b+=1\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "Players = list(input())\r\n\r\nMaxConsecutive = 0\r\nConsecutive = 1\r\nLastPlayer = None\r\nfor Player in Players:\r\n if LastPlayer == Player:\r\n Consecutive += 1\r\n else:\r\n Consecutive = 1\r\n \r\n if Consecutive > MaxConsecutive:\r\n MaxConsecutive = Consecutive\r\n LastPlayer = Player\r\n\r\nif MaxConsecutive >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=list(map(int ,input()))\r\nif len(n)<=100:\r\n for j in range(0,len(n)-6):\r\n if n[j]==n[j+1]==n[j+2]==n[j+3]==n[j+4]==n[j+5]==n[j+6]:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nk = 2\r\nj = 0\r\np = 0\r\nans = False\r\nfor i in range(len(a)):\r\n if a[i] == '0' or (k == 2 and a[i] == '0'):\r\n k = 0\r\n if a[i] == '1' or (k == 2 and a[i] == '1'):\r\n k = 1\r\n if k == 0:\r\n j += 1\r\n p = 0\r\n if k == 1:\r\n j = 0\r\n p += 1\r\n if j == 7 or p == 7:\r\n ans = True\r\n break\r\nif ans == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\n str = input()\n first = 0\n second = 0\n for i in str:\n if i == '1':\n first += 1\n second = 0\n elif i == '0':\n second += 1\n first = 0\n if first == 7 or second == 7:\n print('YES')\n return 0\n print('NO')\n\nmain()\n", "st = input()\nzero = st.split('1')\none = st.split('0')\nif any(map(lambda x: len(x) >= 7, zero)) or any(map(lambda x: len(x) >= 7, one)):\n print('YES')\nelse:\n print(\"NO\")\n", "s = input()\r\nt = False\r\nfor i in range(0, len(s) + 1):\r\n if s[i:i + 7] == \"0000000\" or s[i:i + 7] == \"1111111\":\r\n t = True\r\nprint('YES' if t else 'NO')\r\n", "c = input()\nprint(\"YES\" if '1111111' in c or '0000000' in c else \"NO\")\n", "players = input()\r\n\r\nblue_counter = 0\r\nred_counter = 0\r\n\r\nlis = []# список для форматирования строки\r\nfor player in players:# добавляем в список элементы строки\r\n lis.append(player)\r\n\r\nfor player in lis:# перебираем список \r\n if player == \"0\":# находим закономерность игроков\r\n red_counter += 1\r\n blue_counter = 0\r\n else:\r\n blue_counter += 1\r\n red_counter = 0\r\n if red_counter == 7 or blue_counter == 7:# если закономерность игроков определенной команды\r\n # больше семи - опасная ситуация\r\n print(\"YES\")\r\n exit()\r\n\r\n# иначе нет\r\nprint(\"NO\")", "def is_dangerous(s):\r\n current_streak = 1\r\n for i in range(1, len(s)):\r\n if s[i] == s[i - 1]:\r\n current_streak += 1\r\n if current_streak >= 7:\r\n return \"YES\"\r\n else:\r\n current_streak = 1\r\n return \"NO\"\r\n\r\ns = input().strip()\r\nprint(is_dangerous(s))\r\n", "s = input() # read the input string\nn = len(s)\ncount = 1\ndangerous = False\n\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n count += 1\n else:\n count = 1\n if count == 7:\n dangerous = True\n break\n\n\nif dangerous:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input(\"\")\r\ncz=0\r\nco=0\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n cz=cz+1\r\n else:\r\n if cz>=7:\r\n continue\r\n else:\r\n cz=0\r\nfor j in range(len(s)):\r\n if s[j]=='1':\r\n co=co+1\r\n else:\r\n if co>=7:\r\n continue\r\n else:\r\n co=0\r\nif cz>=7:\r\n print(\"YES\")\r\nelif co>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\nk = 1\nl = 0\nfor i in range(1, len(n)):\n if n[i - 1] == n[i]:\n k += 1\n else:\n k = 1\n if k == 7:\n print('YES')\n l = 1\n break\nif l == 0:\n print('NO')", "zapis = input()\r\nif '1111111' in zapis or '0000000' in zapis:\r\n print('YES')\r\nelse:print('NO')", "x=input()\r\nnumber_of_zero=0\r\nnumber_of_one=0\r\nflag=False\r\nfor i in range (len(x)):\r\n if x[i]==\"0\":\r\n number_of_zero+=1\r\n number_of_one=0\r\n else:\r\n number_of_zero=0\r\n number_of_one+=1\r\n if number_of_zero>=7 or number_of_one>=7:\r\n flag=True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "import collections\r\nimport math\r\n\r\ndef function():\r\n \"\"\"\r\n There is a total of 2 jokes after every song except for the last one, to use the rest period optimally\r\n If the jokes between the songs drain all the time there is left for the last song: -1\r\n else: jokes\r\n\r\n \"\"\"\r\n i = open(0)\r\n readop = lambda: map(int, input().split())\r\n s = input()\r\n print(\"YES\") if '0000000' in s or '1111111' in s else print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n res = function()\r\n\r\n", "'''\r\n#list(map(int,input().split()))'''\r\ns,counter=input(),0;stop=False;prev=s[0]\r\nfor lett in s:\r\n counter = counter+1 if lett==prev else 1\r\n prev=lett\r\n if counter>=7:print('YES');stop=True;break\r\nif not stop:print('NO')\r\n", "# Read the input string\ns = input()\n\n# Check if there are seven consecutive 0s or 1s in the string\nif '0000000' in s or '1111111' in s:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s = input()\r\nm = 0\r\nn = 0\r\nL = []\r\nfor i in range(len(s)):\r\n L.append(s[i])\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n m += 1\r\n else:\r\n m = 0\r\n del(L[0])\r\n if m == 6:\r\n print('YES')\r\n n = 1\r\n break\r\nif n == 0:\r\n print('NO')\r\n#compiled by 陈睿阳 2300011406", "m=input()\r\nlist1=list(m)\r\nlist1=[int(x) for x in list1]\r\nco=0\r\nc1=0\r\nflag=0\r\nfor i in list1:\r\n if(i==0):\r\n co=co+1\r\n if(co==7):\r\n print(\"YES\")\r\n flag=1\r\n break\r\n c1=0\r\n elif(i==1):\r\n c1=c1+1\r\n if(c1==7):\r\n print(\"YES\")\r\n flag=1\r\n break\r\n co=0\r\nif(flag==0):\r\n print(\"NO\")\r\n \r\n", "a=input();\r\nif ('1111111' in a) or ('0000000' in a):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = str(input())\r\n\r\ndang_count = 0\r\nfor i in range(len(s) - 1):\r\n if dang_count == 6:\r\n break\r\n\r\n if s[i] == s[i + 1]:\r\n dang_count += 1\r\n else:\r\n dang_count = 0\r\n\r\nif dang_count == 6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n x = list(input())\r\n for i in range(len(x)):\r\n if ''.join(x[i:i+7]) == '0000000' or ''.join(x[i:i+7]) == '1111111':\r\n return print('YES')\r\n return print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input()\r\ncnt = 1\r\nfor i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n cnt+=1\r\n else :cnt=1\r\n\r\n if cnt >=7:\r\n print('YES')\r\n break\r\nelse:print('NO')", "num = input()\r\n\r\nif \"0000000\" in num or \"1111111\" in num:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import string \r\ns=str(input())\r\nif s.find(\"0000000\")!=-1 or s.find(\"1111111\")!=-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\noc=0\nzc=0\nflag=0\nfor i in n:\n\tif i=='1':\n\t\toc+=1\n\t\tzc=0\n\telif(i=='0'):\n\t\tzc+=1\n\t\toc=0\n\tif(zc==7 or oc==7):\n\t\tflag=1\nif(flag):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t\n \t \t\t \t\t \t\t\t\t\t \t \t\t \t\t \t", "e = input()\r\na = 0\r\nans = \"NO\"\r\nfor i in range(len(e)-1):\r\n if e[i] == e[i+1]:\r\n a += 1\r\n if a == 6:\r\n ans = \"YES\"\r\n break\r\n else:\r\n a = 0\r\n \r\nprint(ans)", "def dangerous_or_not(s):\r\n c = 1\r\n for i in range(1, len(s)):\r\n if(s[i] == s[i-1]):\r\n c += 1\r\n else:\r\n c = 1\r\n if c >= 7:\r\n return \"YES\"\r\n return \"NO\"\r\n \r\ns = str(input())\r\nresult = dangerous_or_not(s)\r\nprint(result)", "s=input()\r\ncurrent=s[0]\r\ncount=int(0)\r\nfor i in s:\r\n # print(\"Top\",current,i,count)\r\n if i==current:\r\n count+=1\r\n else:\r\n current=i\r\n count=1\r\n # print(current,i,count)\r\n if count==7:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n", "s=input()\r\nc=0\r\nl=[]\r\nc1=0\r\nl1=[]\r\nfor i in s:\r\n if i=='1':\r\n c+=1\r\n else:\r\n l.append(c)\r\n c=0\r\n l.append(c)\r\nfor i in s:\r\n if i=='0':\r\n c1+=1\r\n else:\r\n l1.append(c)\r\n c1=0\r\n l1.append(c1)\r\nif max(l)>=7 or max(l1)>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s= str(input())\r\nd=s[0]\r\ncount=0\r\nfor i in s:\r\n if(i==d):\r\n count+=1\r\n #print(i,count)\r\n if(count==7):\r\n break\r\n else:\r\n d=i\r\n count=1\r\nif(count==7):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "positions = input() \r\n\r\nif '1111111' in positions or '0000000' in positions:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input() \r\nprintdisi='n'\r\nfor i in range(len(n)-6):\r\n if n[i]=='0' and n[i+1]=='0' and n[i+2]=='0' and n[i+3]=='0' and n[i+4]=='0' and n[i+5]=='0' and n[i+6]=='0':\r\n print(\"YES\")\r\n printdisi='y'\r\n break \r\n elif n[i]=='1' and n[i+1]=='1' and n[i+2]=='1' and n[i+3]=='1' and n[i+4]=='1' and n[i+5]=='1' and n[i+6]=='1':\r\n print(\"YES\")\r\n printdisi='y'\r\n break\r\nif printdisi=='n':\r\n print(\"NO\")", "n=input()\r\nresult = 0\r\nfor i in range (len(n)):\r\n \r\n if n[i:i+7].count('1') == 7 or n[i:i+7].count('0') == 7 :\r\n result = 1\r\n break\r\nif result == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "players = input()\r\n\r\n\r\ncounter = 0\r\nteam = players[0]\r\nfor player in players:\r\n if player != team:\r\n counter = 1\r\n team = player\r\n else:\r\n counter += 1\r\n\r\n if counter == 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s=input()\r\nif len(s)<7:\r\n\tprint('NO')\r\n\texit()\r\nfor i in range(len(s)-6):\r\n\tl=int(s[i:i+7])\r\n\tif l==0 or l==1111111:\r\n\t\tprint('YES')\r\n\t\tbreak\r\nelse:\r\n\tprint('NO')\r\n", "def danger(s):\r\n a,b='0000000','1111111'\r\n if s.find(a)>=0 or s.find(b)>=0:\r\n print('YES')\r\n else:\r\n print('NO')\r\ndanger(input())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Mar 13 20:23:56 2023\r\n\r\n@author: HP\r\n\"\"\"\r\n\r\n\r\nlst = input()\r\n\r\nif (\"0000000\" in lst) or (\"1111111\") in lst:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n", "def is_dangerous(s):\r\n for i in range(len(s) - 6):\r\n if s[i:i+7] == \"0000000\" or s[i:i+7] == \"1111111\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\ns = input()\r\n\r\n\r\nresult = is_dangerous(s)\r\nprint(result)\r\n", "s = input()\nlast = 'X'\nmaks = 0\nc = 0\nfor current in s:\n\tif current == last:\n\t\tc += 1\n\t\tmaks = max(maks, c)\n\telse:\n\t\tlast = current\n\t\tc = 1\nmaks = max(maks, c)\nif maks >= 7:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "# https://codeforces.com/problemset/problem/96/A\r\n\r\ndef is_dangerous():\r\n players = input(\"\")\r\n repeat_counter = 0\r\n last_occured = None # can be 0 or 1\r\n\r\n for i in players:\r\n if last_occured == i:\r\n repeat_counter += 1\r\n else:\r\n repeat_counter = 1\r\n last_occured = i\r\n\r\n if repeat_counter >= 7:\r\n return True\r\n \r\n return False\r\n\r\n\r\nif is_dangerous():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str1= input()\r\nprev = str1[0]\r\ncount=1\r\nflag = False\r\nfor i in range(len(str1)):\r\n if str1[i] != prev:\r\n count=1\r\n if count == 7:\r\n flag = True\r\n count+=1\r\n prev = str1[i]\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nc=0\r\nc1=0\r\nfor i in range(len(n)):\r\n if n[i]==\"0\":\r\n c+=1\r\n elif n[i]==\"1\":\r\n c1+=1\r\n if c < 7 and n[i]==\"1\":\r\n c=0\r\n elif c1 < 7 and n[i]==\"0\":\r\n c1=0\r\nif c>=7 or c1 >=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\nnums = str(input().strip())\n\ncount = 1\ndanger = False\nfor i in range(len(nums) - 1):\n if nums[i] == nums[i + 1]:\n count += 1\n else:\n count = 1\n\n if count >= 7:\n print('YES')\n danger = True\n break\n\nif not danger:\n print('NO')\n \t\t\t\t\t\t \t \t\t \t\t \t\t \t", "s = input()\r\ncount = 0\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n count += 1\r\n else:\r\n if count >= 6:\r\n print(\"YES\")\r\n exit()\r\n count = 0\r\n\r\nif count >= 6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=str(input())\r\nj=len(a)-6\r\ni=0\r\nc=0\r\nfor k in range (j):\r\n if ((a[i:i+7] =='0000000') or (a[i:i+7] =='1111111') ):\r\n c=1\r\n else:\r\n i=i+1\r\n \r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "inp = str(input())\r\ntrend = 1\r\nvor = inp[0]\r\ndanger = False\r\nfor i in range(1,len(inp)):\r\n if vor == inp[i]:\r\n trend += 1\r\n if trend >= 7:\r\n danger = True\r\n break\r\n else:\r\n vor = inp[i]\r\n trend = 1\r\nif danger == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()+'0'\r\nk=0\r\nfor i in range(len(s)-1):\r\n if s[i]=='0':\r\n if s[i]=='0' and s[i+1]=='0':\r\n k+=1\r\n elif s[i]=='0' and s[i+1]=='1':\r\n k+=1\r\n if k>=7:\r\n print('YES')\r\n exit()\r\n else:\r\n k=0\r\n if s[i]=='1':\r\n if s[i]=='1' and s[i+1]=='1':\r\n k+=1\r\n elif s[i]=='1' and s[i+1]=='0':\r\n k+=1\r\n if k>=7:\r\n print('YES')\r\n exit()\r\n else:\r\n k=0\r\nif k>=7:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\ncnt=1\r\nflag=0\r\nfor i in range(len(s)):\r\n if i+1<len(s) and s[i]==s[i+1]:\r\n cnt+=1\r\n if cnt==7:\r\n flag=1\r\n break;\r\n else:\r\n cnt=1\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = \"0000000\"\r\ny = \"1111111\"\r\n \r\nn = input()\r\n \r\nif x in n or y in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "#t=int(input())\r\n\r\n#while(t>0):\r\ns=input()\r\n #exit=ini-exit\r\n #entry=ini+entry\r\nif(\"1111111\" in s or \"0000000\" in s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n # t-=1 \r\n#print(ma) \r\n ", "str1 = input()\r\ncount = 0\r\nfor i in range(0, len(str1)):\r\n if (str1[i:i+7] == \"0000000\") or (str1[i:i+7] == \"1111111\"):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "x=input()\r\nprint('NYOE S'['0000000' in x or '1111111' in x::2])", "p=input()\r\nc=0\r\nl=0\r\nfor i in range(len(p)):\r\n if c==7 or l==7:\r\n break\r\n elif int(p[i])==0:\r\n c+=1\r\n l=0\r\n elif int(p[i])==1:\r\n c=0\r\n l+=1\r\nif c>=7 or l>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\nzero = 0\r\none = 0\r\nflag = True\r\nfor i in s:\r\n if i=='1':\r\n one+=1\r\n zero = 0\r\n else:\r\n zero+=1\r\n one =0\r\n if one==7 or zero==7:\r\n flag = False\r\n break\r\nif flag==True:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\r\nclass Ranga(object) :\r\n @staticmethod\r\n def main( args) :\r\n s = \"Python-inputs\"\r\n st = input()\r\n if ( \"1111111\" in st or \"0000000\" in st ) :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n\r\n\r\nif __name__==\"__main__\":\r\n Ranga.main(sys.argv)", "s=input().strip()\r\n\r\nprint(\"YES\") if(\"1111111\" in s or \"0000000\" in s) else print(\"NO\")\r\n", "class FootBall:\r\n def __init__(self):\r\n self.__positions = input()\r\n \r\n def check(self):\r\n for i in range(0, len(self.__positions)-6):\r\n if self.__positions[i:i+7] == '1111111' or self.__positions[i:i+7] == '0000000':\r\n return 'YES'\r\n return 'NO'\r\n\r\nif __name__ == \"__main__\":\r\n obj = FootBall().check()\r\n print(obj)", "x=input()\r\na=[]\r\nfor i in x:\r\n a.append(i)\r\ni=0\r\nj=1\r\nc=0\r\nm=0\r\nwhile(j<len(a)):\r\n if(a[i]==a[j]):\r\n j+=1\r\n c+=1\r\n if(c>=6):\r\n m=1\r\n break\r\n else:\r\n i=j\r\n j=j+1\r\n c=0\r\nif(m==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\r\nprint('YES' if '1' * 7 in string or '0' * 7 in string else 'NO')", "def solve():\r\n s = input()\r\n\r\n if len(s) < 8:\r\n print(\"NO\")\r\n return\r\n\r\n print(\"YES\") if \"0\" * 7 in s or \"1\" * 7 in s else print(\"NO\") \r\n \r\n\r\nsolve()", "x=input(\"\")\r\nc1=0\r\nc2=0\r\nfor i in range(len(x)):\r\n if x[i]==\"0\":\r\n c1+=1\r\n c2=0\r\n if c1>=7:\r\n print(\"YES\")\r\n break\r\n\r\n elif x[i] == \"1\":\r\n c2 += 1\r\n c1 = 0\r\n if c2 >= 7:\r\n print(\"YES\")\r\n break\r\n\r\nif c1 < 7 and c2 < 7 :\r\n print(\"NO\")", "s = input()\r\ni, count = 1, 1\r\n\r\nwhile i < len(s) and count < 7:\r\n\tif s[i-1] == s[i]:\r\n\t\tcount += 1\r\n\telse:\r\n\t\tcount = 1\r\n\ti += 1\r\n\r\nif count == 7:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "def A():\n n = input()\n\n word = n.split(\"0\")\n\n word1 = n.split(\"1\")\n # print(word1,word)\n for i in word:\n if len(i)>=7:\n return \"YES\"\n\n for i in word1:\n if len(i)>=7:\n return \"YES\"\n\n return \"NO\"\n\n\n\n\n\n# tests = int(input())\n\n# for i in range(tests):\n# n = int(input())\n# arr = list(map(int, input().split(\" \")))\n# arr1 = arr.copy()\n# arr1.sort()\n\n# if (arr1[0] == arr1[1]):\n# print(arr.index(arr1[-1])+1)\n\n# else:\n# print(arr.index(arr1[0])+1)\n\n\nprint(A())\n\n", "a = input()\r\na = a.replace(\"1111111\",\"3\")\r\na = a.replace(\"0000000\",\"3\")\r\nif(a.count(\"3\")):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\nsub1=\"1111111\"\nsub2=\"0000000\"\nif ((sub1 in s) or (sub2 in s)):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t\t\t \t\t\t\t\t\t \t\t \t\t", "n = input()\r\ns0 = \"0000000\"\r\ns1 = \"1111111\"\r\nif s0 in n:\r\n print(\"YES\")\r\nelif s1 in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\ne=a[0]\r\nk,l=0,0\r\nfor i in range(len(a)):\r\n if a[i]==e:\r\n l+=1\r\n if l==7:\r\n k=1\r\n print('YES')\r\n break\r\n else:\r\n e=a[i]\r\n l=1\r\nif k==0:\r\n print('NO')", "players = input()\n\ndef search_for(team, players):\n count = 0\n for player in players:\n if player == team:\n count += 1\n if count >= 7:\n return True\n else:\n count = 0\n return False\n\nprint(\"YES\" if (search_for(\"0\", players) or search_for(\"1\", players)) else \"NO\")", "x=1\r\nd=False\r\nlst=list(input())\r\np=lst[0]\r\nfor i in lst[1:]:\r\n if i != p:\r\n x=1\r\n else:\r\n x+=1\r\n if x>=7: d=True\r\n p=i\r\nprint(\"YES\" if d else \"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 13 21:21:56 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\n\r\nrow=input()\r\ncount=[1]\r\nfor i in range(1,len(row)):\r\n if row[i]==row[i-1]:\r\n count[-1]+=1\r\n else:\r\n count.append(1)\r\nif max(count)>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\n\nl = 1\nfor i in range(len(n)-1):\n if(n[i] == n[i+1]):\n l += 1\n else:\n l = 1\n\n if(l >= 7):\n print(\"YES\")\n exit()\n\n\nprint(\"NO\")\n\t\t\t\t\t \t\t\t\t \t\t\t\t \t\t\t \t\t \t", "def fut(s):\r\n len_s = len(s)\r\n if len_s < 7:\r\n return 'NO'\r\n s = [int(i) for i in s]\r\n for i in range(len_s - 6):\r\n su = sum(s[i: i + 7])\r\n if su == 0 or su == 7:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nprint(fut(input()))\r\n", "n = input()\r\n\r\nc0=0\r\nc1=0\r\nfor i in range(len(n)):\r\n if n[i]==\"0\":\r\n c0+=1\r\n c1=0\r\n if c0>=7:\r\n print(\"YES\")\r\n break\r\n else:\r\n c1+=1\r\n c0=0\r\n if c1>=7:\r\n print(\"YES\")\r\n break\r\nif c0<7 and c1<7:\r\n print(\"NO\")\r\n", "ch=input()\r\nif len(ch)>100:\r\n ch=input()\r\nfor c in ch:\r\n if c not in ['1','0']:\r\n ch=input()\r\nn=1\r\nfor i in range(len(ch)-1):\r\n if ch[i+1]==ch[i] :\r\n n+=1\r\n else: n=1\r\n if n==7:\r\n \r\n break\r\nif n==7 :\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "a=input()\r\nprint(\"YES\" if a.count(\"1111111\") or a.count(\"0000000\") else \"NO\")", "'''\r\n刘思瑞 2100017810\r\n'''\r\nimport re\r\n\r\ns = input()\r\nif re.search('1{7}',s) or re.search('0{7}',s):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nif '1111111' in n or '0000000' in n:print(\"YES\")\r\nelse:print(\"NO\")", "x = input()\r\nc = 1\r\nf = 0\r\nfor i in range(len(x)-1):\r\n if(x[i] == x[i+1]):\r\n c += 1\r\n else:\r\n if(c>=7):\r\n c = 1\r\n f = 1\r\n print(\"YES\")\r\n break\r\n c = 1\r\nif(c>=7):\r\n print(\"YES\")\r\nelif(f == 0):\r\n print(\"NO\")", "n = input()\r\n\r\n\r\nif len(n)<7:\r\n print('NO')\r\nelse:\r\n c = len(n) - 7\r\n ex1 = '0000000'\r\n ex2 = '1111111'\r\n\r\n if ex1 in n:\r\n print('YES')\r\n elif ex2 in n:\r\n print('YES')\r\n else:\r\n print('NO')", "s = input()\nc = 1\nf = 0\n \nfor i in range(1, len(s)):\n if s[i - 1] == s[i]:\n c += 1\n if c >= 7:\n break\n else:\n c = 1\n \nif c >= 7:\n f = 1\n \nif f == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t\t\t\t\t \t \t \t \t\t \t\t \t\t\t \t", "s=input()\r\nk='1'*7\r\nh='0'*7\r\nif (h in s) or (k in s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\nplayers = input()\r\nif players.__contains__('0000000') or players.__contains__('1111111'):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input(\"\")\r\nc0=0\r\nc1=0\r\nm0=0\r\nm1=0\r\ni=0\r\nwhile(i<len(s)):\r\n if s[i]==\"0\":\r\n c0+=1\r\n m0=max(c0,m0)\r\n c1=0\r\n else:\r\n c1+=1\r\n m1=max(c1,m1)\r\n c0=0\r\n i+=1\r\nm=max(m0,m1)\r\nif m>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "n = input()\r\nprint(\"YES\" if \"1111111\" in n or \"0000000\" in n else \"NO\")", "s = input()\r\n\r\nc = 1\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n c += 1\r\n else:\r\n c = 1\r\n if c > 6:\r\n print(\"YES\")\r\n break\r\nif c <= 6: print(\"NO\")", "s=input() \r\nf=0;z=0\r\nfor i in range(0,len(s)):\r\n if s[i]=='0':\r\n z+=1\r\n else:\r\n if z>=7:\r\n f=1\r\n break\r\n else:\r\n z=0\r\nif z>=7:\r\n f=1\r\nelse:\r\n z=0\r\nif f==0 :\r\n for i in range(0,len(s)):\r\n if s[i]=='1':\r\n z+=1\r\n else:\r\n if z>=7:\r\n f=1\r\n break\r\n else:\r\n z=0\r\nif z>=7:\r\n f=1\r\nelse:\r\n z=0\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nctr1 = 0\r\nmx1 = 0 \r\nctr2 = 0\r\nmx2 = 0 \r\nfor i in range(len(s)):\r\n if s[i] == \"1\":\r\n ctr1+=1 \r\n if ctr1 > mx1:\r\n mx1 = ctr1 \r\n else:\r\n ctr1 = 0 \r\n\r\n if s[i] == \"0\":\r\n ctr2+=1 \r\n if ctr2 > mx2:\r\n mx2 = ctr2 \r\n else:\r\n ctr2 = 0\r\n\r\nif mx1 >= 7 or mx2 >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s=input()\r\na=\"1\"*7\r\nb=\"0\"*7\r\nif (a in s) or (b in s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input string\r\ns = input()\r\n\r\n# Initialize counters for consecutive ones and consecutive zeroes\r\nconsecutive_ones = 0\r\nconsecutive_zeroes = 0\r\n\r\n# Iterate through the string\r\nfor char in s:\r\n if char == '1':\r\n consecutive_ones += 1\r\n consecutive_zeroes = 0\r\n else:\r\n consecutive_zeroes += 1\r\n consecutive_ones = 0\r\n \r\n # Check if either team has 7 consecutive players\r\n if consecutive_ones >= 7 or consecutive_zeroes >= 7:\r\n print(\"YES\")\r\n break\r\n\r\n# If no team has 7 consecutive players, print \"NO\"\r\nelse:\r\n print(\"NO\")\r\n", "p = input()\r\nprint(\"YES\" if \"1111111\" in p or \"0000000\" in p else \"NO\")", "def football(cancha):\r\n \r\n for i in range(len(cancha) - 6):\r\n if cancha[i:i + 7] == \"0000000\" or cancha[i:i + 7] == \"1111111\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\ndef main():\r\n cancha = input()\r\n print(football(cancha))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "players = input()\r\ndanger = False\r\nif len(players) >= 8:\r\n for i in range(len(players)-6):\r\n if players[i:i+7] == \"0\"*7 or players[i:i+7] == \"1\"*7:\r\n print(\"YES\")\r\n danger = True\r\n break\r\n if danger == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "entrada = input()\r\ncontador = 0\r\nban = False\r\nfor i in range(len(entrada)):\r\n if i+1 == 1:\r\n contador += 1\r\n if i+1 != 1 and entrada[i] == entrada[i-1]:\r\n contador += 1\r\n else:\r\n contador = 0 \r\n if contador+1 > 6:\r\n ban = True\r\n\r\nif ban == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "z=input()\r\nif \"0\"*7 in z or \"1\"*7 in z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nkol = 1\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i - 1]:\r\n kol += 1\r\n else:\r\n if kol >= 7:\r\n break\r\n else:\r\n kol = 1\r\nif kol >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input();print(['NO', 'YES'][7 * '1' in s or 7 * '0' in s])", "players = input()\r\nres = 1\r\nans = False\r\nfor i in range(len(players) - 1):\r\n if players[i] == players[i + 1]:\r\n res += 1\r\n else:\r\n res = 1\r\n if res >= 7:\r\n ans = True\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "c = input()\ncnt1 = 0\ncnt0 = 0\nflag = False\nfor i in range(len(c)):\n if c[i] == '1':\n cnt1 += 1\n else:\n cnt1 = 0\n if c[i] == '0':\n cnt0 += 1\n else:\n cnt0 = 0\n if cnt1 == 7 or cnt0 == 7:\n flag = True\nif flag == True:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = input()\r\n\r\ncount = 0\r\nlist = []\r\nfor i in range(len(n)):\r\n list.append(n[i])\r\n\r\nfor i in range(len(n)-1):\r\n if list[i] == list[i+1]:\r\n count += 1\r\n if count == 6:\r\n break\r\n else:\r\n count = 0\r\n \r\nif count >= 6:\r\n print('YES')\r\nelse:\r\n print('NO')", "situation=input()\r\nif \"1111111\"in situation or \"0000000\" in situation:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input string\r\ns = input().strip()\r\n\r\n# Initialize variables to count consecutive ones and zeros\r\nconsecutive_zeros = 0\r\nconsecutive_ones = 0\r\n\r\n# Iterate through the string and count consecutive zeros and ones\r\nfor char in s:\r\n if char == '0':\r\n consecutive_zeros += 1\r\n consecutive_ones = 0\r\n else:\r\n consecutive_ones += 1\r\n consecutive_zeros = 0\r\n\r\n # Check if the situation is dangerous\r\n if consecutive_zeros >= 7 or consecutive_ones >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n # If no dangerous situation is found, print \"NO\"\r\n print(\"NO\")\r\n", "s=input()\r\nc=1\r\ny=0\r\nfor i in range(len(s)-1):\r\n if(s[i]==s[i+1]):\r\n c+=1\r\n else:\r\n c=1 \r\n if(c==7):\r\n y=1 \r\n break \r\nif(y==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "\nnormal=input()\n\ncase1=\"1\"*7\ncase2=\"0\"*7\nif case1 in normal or case2 in normal:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t\t\t\t \t\t\t \t \t\t\t\t\t\t \t\t\t \t", "p = [x for x in input()]\r\n\r\n\r\nctr = 0 \r\ndanger = \"NO\"\r\nprev_flag = '0' \r\nfirst = True\r\n\r\nfor flag in p:\r\n if (first) :\r\n ctr += 1 \r\n first = False \r\n elif flag == prev_flag :\r\n ctr += 1 \r\n else:\r\n ctr = 1\r\n \r\n prev_flag = flag \r\n\r\n if ( ctr == 7 ):\r\n danger = \"YES\" \r\n break \r\n\r\nprint(danger) ", "s=str(input())\r\nr=0\r\nfor i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n r=r+1\r\n if r>=6:\r\n print('YES')\r\n break\r\n else:\r\n r=0\r\nif r<6:\r\n print(\"NO\")", "new=input()\r\nresult=[]\r\nflag=[]\r\nfor m in range(len(new)):\r\n if m not in flag:\r\n n=new[m]\r\n count=1\r\n for k in range(m+1,len(new)):\r\n if new[k]==n:\r\n count+=1\r\n flag.append(k)\r\n else:\r\n break\r\n result.append(count)\r\nanswer=\"NO\"\r\nfor m in result:\r\n if m>=7:\r\n answer=\"YES\"\r\n break\r\nprint(answer)", "s = input()\r\n\r\nc = 0\r\nv = \"\"\r\nsafe = True\r\nfor x in s:\r\n if x == v:\r\n c += 1\r\n if c == 7:\r\n safe = False\r\n break\r\n else:\r\n c = 1\r\n v = x\r\nif safe:\r\n print('NO')\r\nelse:\r\n print('YES')", "s=input()\r\na=s.find(\"0000000\")\r\nb=s.find(\"1111111\")\r\nif a!=-1 or b!=-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "d=input()\r\nif '1111111' in d or '0000000' in d:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\n\ndef football (s):\n if '0000000' in s:\n return 'YES'\n elif '1111111' in s:\n return 'YES'\n else:\n return 'NO'\n\nprint(football(n))\n\t \t\t\t\t \t\t \t\t\t \t \t", "x=input().strip()\r\ncounter=0\r\nc=0\r\nfor i in range(len(x)):\r\n if x[i] == '1':\r\n counter+=1\r\n c=0\r\n else:\r\n counter=0\r\n c+=1\r\n if counter>=7 or c>=7:\r\n break\r\nif counter>=7 or c>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\n\r\na=n.count(\"1111111\")\r\nb=n.count(\"0000000\")\r\n\r\nif a>=1 or b>=1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\ncount = 1\r\n\r\nfor i in range(1, len(n)):\r\n if(int(n[i-1]) + int(n[i]) == 1):\r\n count = 1\r\n else:\r\n count += 1\r\n \r\n if count >= 7:\r\n print(\"YES\")\r\n break\r\n\r\nif count < 7:\r\n print(\"NO\")", "positions=input()\r\nflag=positions[0]\r\ncount=0\r\nfor i in positions:\r\n if i == flag:\r\n count+=1\r\n else:\r\n flag=i\r\n count=1\r\n if count==7:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "s = input()\nc0, c1 = 0, 0\nfor i in range(len(s) - 1):\n if s[i] == '0' and s[i+1] == '0': c0 = c0 + 1\n elif s[i] == '1' and s[i+1] == '1': c1 = c1 + 1\n elif c1 >= 6 or c0 >= 6: break\n else: \n c1 = 0 \n c0 = 0\n\nif c1 >= 6 or c0 >= 6: print(\"YES\") \nelse: print(\"NO\")\n", "a = input()\r\nfor i in range(len(a)):\r\n if len(a[i:]) >= 7:\r\n if a[i] == a[i+1] and a[i+1] == a[i+2] and a[i+2] == a[i+3] and a[i+3] == a[i+4] and a[i+4] == a[i+5] and a[i+5] == a[i+6]:\r\n print(\"YES\")\r\n break\r\n else:\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\n", "s=input()\r\nprint(['NO','YES']['1111111' in s or '0000000' in s])", "input = str(input())\r\nif input.find('0000000') != -1 or input.find('1111111') != -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\nx0 = (x.replace('1',' ')).split()\r\nx1 = (x.replace('0',' ')).split()\r\nl0 = len(x0)\r\nl1 = len(x1)\r\na = 'NO'\r\nfor i in range(l0):\r\n if len(x0[i]) >= 7:\r\n a = 'YES'\r\n else:\r\n pass\r\nfor i in range(l1):\r\n if len(x1[i]) >= 7:\r\n a = 'YES'\r\n else:\r\n pass\r\nprint(a)\r\n\r\n \r\n", "n=input()\r\na=0\r\nfor i in range(len(n)-6):\r\n if n[i]==n[i+1]==n[i+2]==n[i+3]==n[i+4]==n[i+5]==n[i+6]:\r\n print(\"YES\")\r\n a=1\r\n break\r\nif a==0:\r\n print(\"NO\")", "s = input()\r\nprint('YES' if '1'*7 in s or '0'*7 in s else 'NO')", "f = input()\n\nm = 1\nc = f[0]\ncurrent_max = 1\n\nfor index in range(1, len(f)):\n if f[index] == c:\n current_max += 1\n if m < current_max:\n m = current_max\n else:\n c = f[index]\n current_max = 1\n\nif m >= 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t\t\t\t \t \t \t\t\t \t \t\t\t \t\t\t\t", "# Read the input\r\ns = input().strip()\r\n\r\n# Initialize variables to keep track of consecutive players\r\ncount = 1\r\nprev_player = s[0]\r\n\r\n# Iterate through the string from the second character\r\nfor player in s[1:]:\r\n if player == prev_player:\r\n count += 1\r\n else:\r\n count = 1\r\n prev_player = player\r\n\r\n # Check if we have found a dangerous situation\r\n if count == 7:\r\n print(\"YES\")\r\n break\r\n\r\n# If we haven't found a dangerous situation after checking the entire string, print \"NO\"\r\nif count < 7:\r\n print(\"NO\")\r\n", "n = input()\r\nif ((\"1\"*7) in n) or ((\"0\"*7) in n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "h=input()\r\nif '0'*7 in h or '1'*7 in h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\ns = len(x)\r\nfor i in range(s):\r\n\tc = 0\r\n\td = x[i:i+7]\r\n\tif(d == \"1111111\") or (d == \"0000000\"):\r\n\t\tprint(\"YES\")\r\n\t\tquit()\r\nprint(\"NO\")", "s=input()\r\nl1=\"1111111\"\r\nl2=\"0000000\"\r\nif l1 in s or l2 in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m = input()\r\nno = 0\r\nfor i in range(len(m)):\r\n if m[i:i+7] == \"1111111\":\r\n no = 1\r\n break\r\n elif m[i:i+7] == \"0000000\":\r\n no = 1\r\n break\r\nif no == 0 :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "str1=list(input())\r\nstart=str1[0]\r\ncount=0\r\nflag=0\r\nfor i in range(0,len(str1)):\r\n if str1[i]==start:\r\n count+=1\r\n if count>=7:\r\n print(\"YES\")\r\n flag=1\r\n break\r\n else:\r\n start=str1[i]\r\n count=1\r\nif flag==0:\r\n print(\"NO\")", "s=input()\r\na=\"1111111\"\r\nb=\"0000000\"\r\nif (a in s) or (b in s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ncount = 1\r\nprev = s[0]\r\nflag = 0\r\nfor i in range(1, len(s)):\r\n if count == 7:\r\n flag = 1\r\n break\r\n else:\r\n if s[i] == prev:\r\n count += 1\r\n else:\r\n count = 1\r\n prev = s[i]\r\n\r\nif flag == 1 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\ndef m():\r\n\tn = input()\r\n\t\r\n\ta = n.split(\"1\")\r\n\tb = n.split(\"0\")\r\n\tfor item in a:\r\n\t\tif len(item) >= 7:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tfor i in b:\r\n\t\t\tif len(i) >= 7:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(\"NO\") \r\nm()", "s=input()\r\nif len(s)<7:\r\n print('NO')\r\nelse:\r\n for i in range(len(s)-6):\r\n if s[i:i+7] == '0000000' or s[i:i+7] == '1111111':\r\n print('YES')\r\n break\r\n else:\r\n print('NO')", "def football(x):\r\n\r\n found0 = False\r\n counting1 = 0\r\n counting0 = 0\r\n found1 = False\r\n\r\n for i in x:\r\n if i == \"0\":\r\n found0 = True\r\n found1 = False\r\n elif i == \"1\":\r\n found1 = True\r\n found0 = False\r\n if found1:\r\n counting1+=1\r\n counting0 = 0\r\n if counting1 == 7:\r\n return \"YES\"\r\n elif found0:\r\n counting0+=1\r\n counting1 = 0\r\n if counting0 == 7:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nx = input()\r\nprint(football(x))\r\n", "\r\n\r\n\r\ndef is_dangerous():\r\n formation = input()\r\n\r\n\r\n previousPlayer = \"none\"\r\n currentPlayer = \"none\"\r\n currentLength = 0\r\n\r\n for player in formation:\r\n if (player == previousPlayer):\r\n currentLength+=1\r\n else:\r\n previousPlayer = player\r\n currentLength = 1\r\n if currentLength >= 7:\r\n print(\"YES\")\r\n break\r\n if currentLength < 7:\r\n print(\"NO\")\r\n\r\nis_dangerous()\r\n ", "a = input()\r\ntotal, mx, count = 0, 0, 0\r\nfor i in range(len(a)):\r\n if a[i] == '1':\r\n total += 1\r\n count = 0\r\n if a[i] == '0':\r\n count += 1\r\n total = 0\r\n if mx < total:\r\n mx = total\r\n if mx < count:\r\n mx = count \r\nif mx >= 7:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "a = input()\r\n\r\nc = 1\r\n\r\nfor i in range(1, len(a)):\r\n if a[i] == a[i-1]:\r\n c += 1\r\n elif c >= 7:\r\n break\r\n else:\r\n c = 1\r\nif c >= 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\n# Initialize the count and the previous player's team\r\ncount = 1\r\nprev = s[0]\r\n\r\n# Iterate over the remaining players\r\nfor i in range(1, len(s)):\r\n # If the current player's team is different from the previous player's team,\r\n # reset the count\r\n if s[i] != prev:\r\n count = 1\r\n prev = s[i]\r\n # Otherwise, increment the count\r\n else:\r\n count += 1\r\n # If the count exceeds 6, output \"YES\" and exit\r\n if count >= 7:\r\n print(\"YES\")\r\n exit()\r\n\r\n# If we reach here, it means that the situation is not dangerous\r\nprint(\"NO\")\r\n", "s=input()\r\na=['0'*7,'0'*8,'0'*9,'0'*10,'0'*11,'1'*7,'1'*8,'1'*9,'1'*10,'1'*11]\r\nif any(a in s for a in a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ns = ''\r\ndang = 0\r\nc = 0\r\nfor i in range(len(n)):\r\n if(n[i] != s):\r\n c = 1\r\n s = n[i]\r\n else:\r\n c += 1\r\n if(c == 7):\r\n dang = 1\r\n\r\nif(dang == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "m = input()\r\nn = 0\r\nif len(m) >= 7:\r\n for i in range(0,len(m)-6):\r\n if (m[i]+m[i+1]+m[i+2]+m[i+3]+m[i+4]+m[i+5]+m[i+6])=='0000000' or (m[i]+m[i+1]+m[i+2]+m[i+3]+m[i+4]+m[i+5]+m[i+6])=='1111111':\r\n print('YES')\r\n n += 1\r\n break\r\n if n==0:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = str(input())\nprint([\"NO\", \"YES\"][\"1\"*7 in s or \"0\"*7 in s])\n ", "s=input()\r\no=\"0000000\"\r\nl=\"1111111\"\r\nif l in s or o in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k=input()\r\np=\"0000000\"\r\nq=\"1111111\"\r\nif(p in k or q in k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "word = input()\r\nif \"1111111\" in word or \"0000000\" in word:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check_dangerous_situation(situation):\r\n consecutive_count = 1\r\n for i in range(1, len(situation)):\r\n if situation[i] == situation[i-1]:\r\n consecutive_count += 1\r\n if consecutive_count >= 7:\r\n return \"YES\"\r\n else:\r\n consecutive_count = 1\r\n \r\n return \"NO\"\r\n\r\n# Read the input\r\nsituation = input().strip()\r\n\r\n# Check if the situation is dangerous\r\nresult = check_dangerous_situation(situation)\r\n\r\n# Print the result\r\nprint(result)\r\n", "q = \"0000000\"\np = \"1111111\"\nk = input()\nif q in k or p in k:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "# x = [int(x) for x in input().split(\" \")]\r\n\r\nx = input()\r\nn = len(x)\r\n\r\ncond = True\r\ncounter = 1\r\n\r\nfor i in range (1,n) :\r\n if x[i] == x[i-1] :\r\n counter += 1\r\n if counter == 7 :\r\n cond = False\r\n break\r\n else :\r\n counter = 1\r\n\r\nif cond == False :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "a = input()\r\nconsecutive_count = 1\r\nfor i in range(1, len(a)):\r\n if a[i] == a[i - 1]:\r\n consecutive_count += 1\r\n if consecutive_count >= 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n consecutive_count = 1 # Reset the consecutive count\r\nelse:\r\n print(\"NO\")", "s = input()\r\nif '1'*7 in s or '0'*7 in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nn=len(s)\r\n\r\ncnt1=0\r\ncnt0=0\r\n\r\nfor i in range(n):\r\n\r\n if s[i]=='1':\r\n cnt1+=1\r\n else:\r\n cnt1 = 0\r\n\r\n if s[i]=='0':\r\n cnt0+=1\r\n else:\r\n cnt0 = 0\r\n \r\n if cnt1==7 or cnt0==7:\r\n print(\"YES\")\r\n quit()\r\n\r\nprint(\"NO\")\r\n\r\n\r\n\r\n\r\n", "players=input()\r\nnum=1 #连续相同数字个数，初始设置为1#\r\nfor i in range(0,len(players)-1):\r\n if players[i+1]==players[i]:\r\n num+=1\r\n else:\r\n num=1\r\n if num==7: #避免已经有连续7个后由于后续不连续导致num清零#\r\n break\r\nif num>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\n\"\"\"Codeforce\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1vkqd1IDYYeIi4VIH6yqQEhbS4qcGMzLO\n\"\"\"\n\nformation = input()\n\nif '1111111' in formation or '0000000' in formation:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "parsa=input()\r\ncounter=0\r\nmax=0\r\nfor i in range(0,len(parsa),1):\r\n if i==0:\r\n counter+=1\r\n if max<counter:\r\n max=counter\r\n else:\r\n if parsa[i]==parsa[i-1]:\r\n counter+=1\r\n if max<counter:\r\n max=counter\r\n else:\r\n if max<counter:\r\n max=counter\r\n else:\r\n counter=1\r\nif max>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str1 = input()\r\ncount = 0\r\nnum1 = str1[0]\r\nfor i in str1:\r\n if num1==i:\r\n count+=1\r\n if count==7:\r\n print(\"YES\")\r\n break\r\n elif num1!=i:\r\n num1 = i\r\n count = 1\r\nelse:\r\n print(\"NO\")\r\n ", "s=input()\r\ncnt=1\r\nf=0\r\nfor i in range (1,len(s)):\r\n if s[i-1]==s[i]:\r\n cnt+=1\r\n else:\r\n cnt=1 \r\n if cnt>=7:\r\n f=1\r\n print('YES')\r\n break \r\nif f==0:\r\n print('NO')", "players = input()\r\nsign = players[0]\r\ncount = 1\r\nfor i in range(len(players)):\r\n if players[i] == sign:\r\n count += 1 \r\n else:\r\n sign = players[i]\r\n count = 1\r\n if count == 7:\r\n print(\"YES\")\r\n break\r\n if i == len(players) - 1:\r\n print(\"NO\")\r\n break\r\n \r\n", "tj=input()\r\nif((\"1111111\" in tj) or (\"0000000\" in tj)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\n\r\nif s.count('0000000') or s.count('1111111'):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "n=input()\r\nlst_a=[]\r\nif 6<len(n)<=100:\r\n if \"1\" in n and \"0\" in n:\r\n for i in range(len(n)-1):\r\n if n[i] != n[i+1]:\r\n lst_a.clear()\r\n elif n[i] == n[i+1]:\r\n lst_a.append(i)\r\n if len(lst_a)>5:\r\n break\r\n if len(lst_a)>5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s = input().strip()\r\n\r\n# Initialize variables\r\ncount = 1\r\nis_dangerous = False\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n count += 1\r\n if count >= 7:\r\n is_dangerous = True\r\n break\r\n else:\r\n count = 1\r\n\r\n# Print the result\r\nif is_dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\r\nz = 0\r\nc = 0\r\nm = 0\r\nfor i in x:\r\n if i == \"1\":\r\n z = 0\r\n c = c + 1\r\n if c >= 7:\r\n m = m + 1\r\n else:\r\n pass\r\n else:\r\n c = 0\r\n z = z + 1\r\n if z >= 7:\r\n m = m + 1\r\n else:\r\n pass \r\nif m >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\r\ncounter = 0\r\nindex = 0\r\nright = len(s) - 1\r\nwhile index < right:\r\n if s[index] == s[index + 1]:\r\n index += 1\r\n counter += 1\r\n else:\r\n index += 1\r\n if counter >= 6:\r\n break\r\n counter = 0\r\nif counter >= 6:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=input()\r\nprint(\"YES\" if a.find(\"0000000\")>=0 or a.find(\"1111111\")>=0 else \"NO\")", "################# 96A - Football ##################\r\n\r\npl = input()\r\n\r\ndan_flag = False\r\ncount = 1\r\n\r\nfor i in range(1, len(pl)):\r\n previo = pl[i-1]\r\n if pl[i] == previo:\r\n count += 1\r\n if count >= 7:\r\n dan_flag = True\r\n break\r\n else:\r\n count = 1\r\n\r\nif dan_flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nif 7*'0' in a or 7*'1' in a:print('YES')\r\nelse:print('NO')", "text = input()\nif '1111111' in text or '0000000' in text:\n print(\"YES\")\nelse:\n print(\"NO\")\nquit()\n\t\t\t \t \t \t \t\t\t\t \t\t \t\t \t \t\t\t\t", "# a=list(map(int,input().split()))\r\na=(input())\r\nif((7*\"0\")in a):\r\n print(\"YES\")\r\nelif((7*\"1\")in a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# print(a)", "try :\r\n ps = input()\r\n if len(ps) <= 100 and \"1\":\r\n v = True\r\n for i in ps:\r\n if i not in [\"0\",\"1\"]:\r\n v = False\r\n break\r\n if v == True:\r\n if 7*\"0\" in ps or 7*\"1\" in ps:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept: pass\r\n", "n=input()\ncount=0\nfor i in range(len(n)):\n\tif(i+7>len(n)):\n\t\tbreak\n\telif(i+7==len(n) and n[i]!=n[i+6]):\n\t\tbreak\n\telse:\n\t\tfor j in range(i+1,i+7):\n\t\t\tif(n[i]==n[j]):\n\t\t\t\tcount+=1\n\t\t\telse:\n\t\t\t\tcount=0\n\tif(count==6):\n\t\tbreak\nif(count==6):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \t \t \t\t \t\t \t \t \t\t\t\t", "s=input()\r\nx,y,f=0,0,0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n x+=1\r\n y=0\r\n if x==7:\r\n f=1\r\n break\r\n else:\r\n x=0\r\n y+=1\r\n if y==7:\r\n f=1\r\n break\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\ns = input()\r\n\r\nis_dangerous = False\r\nfor i in re.finditer(r'(.)\\1*', s):\r\n if len(i.group()) >= 7:\r\n is_dangerous = True\r\n\r\nif is_dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=list(input())\r\nfor i in range(len(x)):\r\n if x[i:i+7]==['0','0','0','0','0','0','0'] or x[i:i+7]==['1','1','1','1','1','1','1']:print(\"YES\");break\r\nelse: print(\"NO\")", "def solve(arr,n):\r\n # cnt =0\r\n i=0\r\n while(i<n):\r\n cnt=0\r\n c = arr[i]\r\n while(i<n and arr[i]==c):\r\n cnt+=1\r\n i+=1\r\n if (cnt>=7):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ns= input()\r\nprint(solve(s,len(s)))", "s = str(input())\r\n\r\nif \"1111111\" not in s and \"0000000\" not in s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "string = input()\r\nn_0 = 0\r\nn_1 = 0\r\nfor c in string:\r\n if c == '0':\r\n n_0 += 1\r\n if n_0 == 7:\r\n break\r\n n_1 = 0\r\n else:\r\n n_1 += 1\r\n if n_1 == 7:\r\n break\r\n n_0 = 0\r\nif n_0 == 7 or n_1 ==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ncount = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i:i+7] == \"0000000\" or s[i:i+7] == \"1111111\":\r\n count += 1\r\n\r\nif count > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nfor i in range(len(n)-6):\r\n if n[i:i+7]=='1111111' or n[i:i+7]=='0000000':\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def solve():\r\n s = input()\r\n print('YES' if '1'*7 in s or '0'*7 in s else 'NO')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def is_dangerous(situation):\r\n consecutive_count = 0\r\n previous_player = None\r\n\r\n for player in situation:\r\n if player == previous_player:\r\n consecutive_count += 1\r\n if consecutive_count >= 7:\r\n return \"YES\"\r\n else:\r\n consecutive_count = 1\r\n previous_player = player\r\n\r\n return \"NO\"\r\n\r\n# Read input\r\nsituation = input().strip()\r\n\r\n# Check danger level\r\nprint(is_dangerous(situation))", "x = input()\r\nif x.count(\"1111111\") >= 1 or x.count(\"0000000\") >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ncon_ones=0\r\ncon_zeros=0\r\nfor player in s:\r\n if player=='1':\r\n con_ones+=1\r\n con_zeros=0\r\n else:\r\n con_zeros+=1\r\n con_ones=0\r\n if con_ones>=7 or con_zeros>=7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s=input()\nmax_0=0\nmax_1=0\ncur_0=0\ncur_1=0\n\nfor i in s:\n if i=='0':\n cur_0+=1\n cur_1=0\n max_0=max(max_0,cur_0)\n elif i=='1':\n cur_1+=1\n cur_0=0\n max_1=max(max_1,cur_1)\n\nif(max_0>=7 or max_1>=7):\n print(\"YES\")\nelse:\n print(\"NO\") ", "def main (string):\r\n\tcurrent = 1\r\n\tfor i in range(1, len(string)):\r\n\t\tif string[i] == string[i-1]:\r\n\t\t\tcurrent += 1\r\n\t\telse:\r\n\t\t\tcurrent = 1\r\n\t\tif current == 7:\r\n\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\n\r\nprint(main(input()))", "\r\ns = input()\r\n\r\nconsecutive_players = 1\r\n\r\n\r\nfor i in range(1, len(s)):\r\n\r\n if s[i] == s[i - 1]:\r\n consecutive_players += 1\r\n\r\n if consecutive_players >= 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n consecutive_players = 1\r\n\r\nif consecutive_players < 7:\r\n print(\"NO\")\r\n", "n=[int(x) for x in list(input())]\r\nz=n[0]\r\nq=0\r\nw=False\r\nfor x in range(len(n)-1):\r\n\tif z==n[x+1]:\r\n\t\tq+=1\r\n\telse:\r\n\t\tz=n[x+1]\r\n\t\tq=0\r\n\tif q==6:\r\n\t\tw=True\r\n\r\nif w:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "line = input()\r\n\r\nif (\"1111111\" in line) or (\"0000000\" in line):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\ns=str(input())\r\nif re.search('1111111',s) or re.search('0000000',s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input\r\nfield = input()\r\n\r\n# Check if there's a sequence of 7 or more ones or zeros\r\nif '0000000' in field or '1111111' in field:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ncount = 1\r\nconstant = 0\r\nn = len(s)\r\nfor i in range(n-1):\r\n if s[i] == s[i+1]:\r\n count += 1 \r\n else :\r\n if count >=7 :\r\n print('YES')\r\n constant = 1\r\n break \r\n else :\r\n count = 1 \r\nif constant == 0 :\r\n if count >= 7 :\r\n print('YES')\r\n else :\r\n print('NO')", "n=input()\r\ncount=1\r\nf=0\r\nfor i in range(1,len(n)):\r\n if n[i]==n[i-1]:\r\n count+=1\r\n if count>=7:\r\n f=1\r\n print(\"YES\")\r\n break\r\n if n[i]!=n[i-1]:\r\n count=1\r\nif f==0:\r\n print(\"NO\")", "n=input()\r\ni='1111111'\r\nj='0000000'\r\nif i in n or j in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "players = input()\r\ncurrent_players = 1\r\nfor i in range(1, len(players)):\r\n if players[i] == players[i-1]:\r\n current_players += 1\r\n else:\r\n current_players = 1\r\n if current_players == 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "number = input()\r\n\r\nif (number.find('1111111') != -1 or number.find(\"0000000\") != -1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "names=input()\n\nif names.find(\"1111111\")!=-1 :\n print(\"YES\")\nelif names.find(\"0000000\")!=-1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t\t \t\t \t \t \t \t \t\t \t\t", "a=input()\nb='0000000'\nc='1111111'\n\nif b in a or c in a:\n print(\"YES\")\nelse:\n print('NO')\n \t\t \t\t\t \t \t \t \t \t\t \t \t", "c=str(input())\r\nt=False\r\nif '1111111' in c or '0000000' in c:\r\n t=True\r\nif t==True:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = str(input())\r\nif a.find('1111111') >= 0 or a.find('0000000') >= 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "text = input()\nif \"1111111\" in text:\n print(\"YES\")\nelif \"0000000\"in text:\n print(\"YES\")\nelse:\n print(\"NO\")\nquit()\n \t\t \t \t \t \t\t \t \t\t \t\t \t\t \t", "str=input()\r\nstore1=int(str.find('1111111'))\r\nstore2=int(str.find('0000000'))\r\n\r\nif store1==-1 and store2==-1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "#F\ns = input()\ncnt = 0\nl0 = []\ncnt1 = 0\nl1 = []\nfor i in range(len(s)-1):\n c = 0\n if s[i] == '0' and s[i] == s[i+1]:\n cnt += 1\n else:\n cnt = 0\n l0.append(cnt+1)\n if s[i] == '1' and s[i] == s[i+1]:\n cnt1 += 1\n else:\n cnt1 = 0\n l1.append(cnt1+1)\nm0 = max(l0)\nm1 = max(l1)\nif m0>=7 or m1>=7:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t\t \t \t \t\t \t \t \t \t\t\t \t\t", "s = input()\r\na = \"0000000\"\r\nb = \"1111111\"\r\nif a in s or b in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nprint(\"YES \" if \"1111111\" in s or \"0000000\" in s else \"NO\")", "l=[]\r\nfor i in input():\r\n l.append(i)\r\ns=1\r\nfor i in range(len(l)-1):\r\n if l[i] == l[i+1]:\r\n s = s+1\r\n if s >= 7:\r\n break\r\n else:\r\n s=1\r\n\r\nif s >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n\r\n", "s = input()\r\ncount_1 = 0\r\ncount_0 = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n count_1 += 1\r\n count_0 = 0\r\n elif s[i] == '0':\r\n count_0 += 1\r\n count_1 = 0\r\n\r\n if count_1 >= 7 or count_0 >= 7:\r\n print(\"YES\")\r\n break\r\n\r\nif count_1 < 7 and count_0 < 7:\r\n print(\"NO\")", "a = 0\r\nl = input()\r\nm = l[0]\r\np = []\r\nfor i in range(1, len(l)):\r\n if m == l[i]: a += 1\r\n else:\r\n p.append(a+1)\r\n a=0 \r\n m = l[i]\r\np.append(a+1)\r\nif max(p) >= 7: print('YES')\r\nelse: print('NO')", "a='0'*7\r\nb='1'*7\r\nn=input()\r\nif a in n or b in n:\r\n \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "players=input()\r\nflag=players[0]\r\ncounter=0\r\nfor player in players:\r\n if player==flag:\r\n counter+=1\r\n if counter>6:\r\n print(\"YES\")\r\n break\r\n else:\r\n flag=player\r\n counter=1\r\nif counter<7:\r\n print(\"NO\")\r\n", "a = str(input())\r\nif (\"1111111\" in a or \"0000000\" in a):\r\n print(\"YES\")\r\nelse: print(\"NO\")", "\r\nplayers = list(map(int, input()))\r\n\r\ndef dangerous(players):\r\n count = 0\r\n counter = 0\r\n result = False\r\n for element in players:\r\n if element == 1:\r\n count +=1\r\n if count >= 7:\r\n result = True\r\n\r\n else:\r\n count = 0\r\n for index in players:\r\n if index == 0:\r\n counter +=1\r\n if counter>= 7:\r\n result = True\r\n else:\r\n counter = 0\r\n if result:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nfinal = dangerous(players)", "s=str(input())\r\nm=0\r\nn=len(s)\r\nfor i in range(n-1):\r\n if(s[i]==s[i+1]):\r\n m=m+1\r\n if(m>=6):\r\n print(\"YES\")\r\n exit()\r\n else:\r\n m=0\r\nprint(\"NO\")", "a=\"0000000\"\r\nb=\"1111111\"\r\ns=input()\r\nif a in s or b in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import collections\r\nfrom itertools import islice\r\n\r\n\r\ndef sliding_window(iterable, n):\r\n it = iter(iterable)\r\n window = collections.deque(islice(it, n), maxlen=n)\r\n if len(window) == n:\r\n yield tuple(window)\r\n for x in it:\r\n window.append(x)\r\n yield tuple(window)\r\n\r\n\r\ndef dangerous(string, length=7):\r\n if len(string) < length:\r\n return False\r\n\r\n for window in sliding_window(string, length):\r\n if len(set(window)) == 1:\r\n return True\r\n else:\r\n return False\r\n \r\nstring = input()\r\nprint('YES' if dangerous(string) else 'NO')", "n=list(input())\r\nc=0\r\nd=0\r\np=-1\r\nflag=0\r\nfor i in range(len(n)):\r\n if n[i]=='0' and p!='0':\r\n c=0\r\n if n[i]=='1' and p!='1':\r\n d=0\r\n if n[i]=='0':\r\n c+=1\r\n p='0'\r\n if n[i]=='1':\r\n d+=1\r\n p='1'\r\n if c>=7 or d>=7:\r\n print(\"YES\")\r\n flag=1\r\n break\r\nif flag==0:\r\n print('NO')\r\n ", "teams=input()\r\n\r\n\r\ncnt=1\r\n\r\nflag=0\r\nfor i in range(1,len(teams)):\r\n if teams[i]==teams[i-1]:\r\n cnt+=1\r\n else:\r\n cnt=1\r\n \r\n if cnt>=7:\r\n flag=1\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "def football(s):\r\n A = 0\r\n B = 0\r\n for i in range(len(s)):\r\n if s[i] == '1':\r\n A += 1\r\n B = 0\r\n else:\r\n B += 1\r\n A = 0\r\n if A >= 7 or B >= 7:\r\n return \"YES\"\r\n return \"NO\"\r\ns = input()\r\nprint(football(s))", "s = input()\nif s.find(\"1111111\")!=-1 or s.find(\"0000000\")!=-1:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "s=input()\r\ncount1=0\r\ncount2=0\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n count1+=1\r\n count2=0\r\n elif s[i]=='1':\r\n count1=0\r\n count2+=1\r\n if count1==7 or count2==7:\r\n print(\"YES\")\r\n break\r\nif count1!=7 and count2!=7:\r\n print(\"NO\")", "def is_dangerous(s):\r\n consecutive_count = 1\r\n for i in range(1, len(s)):\r\n if s[i] == s[i - 1]:\r\n consecutive_count += 1\r\n else:\r\n consecutive_count = 1\r\n if consecutive_count >= 7:\r\n return \"YES\"\r\n return \"NO\"\r\ns = input().strip()\r\nresult = is_dangerous(s)\r\nprint(result)", "n = input()\r\ndef inter(n):\r\n c = 0\r\n for i in range(len(n)-1):\r\n if n[i] == n[i+1]:\r\n c += 1\r\n if c >= 6:\r\n return 1\r\n else:\r\n c = 0\r\n return 0\r\nres = inter(n)\r\nif res == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input() # read the input string\r\ndangerous = False # initialize dangerous flag to False\r\n\r\n# loop through the string, looking for a sequence of 7 or more zeros or ones\r\nfor i in range(len(s) - 6):\r\n if s[i:i+7] == \"0000000\" or s[i:i+7] == \"1111111\":\r\n dangerous = True\r\n break\r\n\r\n# print the result\r\nif dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nplayer=1\r\nmx=-1\r\ni=1\r\nwhile i<len(s):\r\n if s[i]==s[i-1]: player+=1\r\n else:\r\n mx=max(mx, player)\r\n player=1\r\n i+=1\r\nmx=max(mx, player)\r\nif mx>=7: print(\"YES\")\r\nelse: print(\"NO\")", "a = str(input())\r\nfor i in range(0, len(a) - 6):\r\n if a[i] == a[i + 1] == a[i + 2] == a[i + 3] == a[i + 4] == a[i + 5] == a[i + 6]:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "# Python 3 solution\r\n\r\ns = input().strip()\r\n\r\n# iterate over the string\r\nfor i in range(len(s)):\r\n # check if the current substring of length 7 consists of the same character\r\n if s[i:i+7].count('0') == 7 or s[i:i+7].count('1') == 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "players = input().strip()\r\nconsecutive_count = 1 \r\nfor i in range(1, len(players)):\r\n if players[i] == players[i - 1]:\r\n consecutive_count += 1\r\n else:\r\n consecutive_count = 1 \r\n if consecutive_count >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\nseq = 0\nfor i in range(len(s) -1):\n if s[i] == s[i+1]:\n seq += 1\n if seq == 6:\n print('YES')\n break\n else:\n seq = 0\nelse:\n print('NO')", "s=input()\r\ncount1=0\r\ncount0=0\r\nflag0=False\r\nflag1=False\r\nflag11=False\r\nflag00=False\r\nfor i in range(0,len(s)):\r\n if s[i]=='1' and not(flag1):\r\n flag1=True\r\n count0=0\r\n count1=1\r\n elif s[i]=='0' and not(flag0):\r\n flag0=True\r\n count1=0\r\n count0=1\r\n elif flag1 and s[i]=='1':\r\n count1+=1\r\n count0=0\r\n elif flag0 and s[i]=='0':\r\n count0+=1\r\n count1=0\r\n if count1>=7:\r\n flag11=True\r\n break\r\n if count0>=7:\r\n flag00=True\r\n break\r\n \r\n \r\n \r\n \r\n \r\nif flag11 or flag00:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = str(input())\r\n\r\nx, y, z = 0, 0 ,0\r\nfor i in range(len(n)):\r\n if n[i] == \"1\":\r\n x+=1\r\n y=0\r\n else:\r\n y+=1\r\n x=0\r\n if x==7 or y==7:\r\n z=1\r\n \r\nif z==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "players = input()\r\ndangerous = False\r\nconsecutive_count = 1\r\n\r\nfor i in range(1, len(players)):\r\n if players[i] == players[i - 1]:\r\n consecutive_count += 1\r\n if consecutive_count >= 7:\r\n dangerous = True\r\n break\r\n else:\r\n consecutive_count = 1\r\n\r\nif dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\na=[]\r\nfor i in range(len(n)):\r\n if n[i:i+7]=='1111111':\r\n a.append(1)\r\n elif n[i:i+7]=='0000000':\r\n a.append(1)\r\n else:\r\n a.append(0)\r\na=set(a)\r\na=list(a)\r\nif len(a)>1:\r\n print('YES')\r\nelse:\r\n print('NO')", "position = input()\r\nif \"0000000\" in position or \"1111111\" in position:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=input()\r\ncount1=0\r\ncount2=0\r\nflag=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n count1+=1\r\n count2=0\r\n elif s[i]=='1':\r\n count2+=1\r\n count1=0\r\n\r\n if count1>=7 or count2>=7:\r\n print(\"YES\")\r\n flag = 1\r\n break\r\n\r\nif flag == 0:\r\n print(\"NO\")", "s=input()\r\nif\"0000000\" in s or\"1111111\" in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\n\ncurlen0 = 0\ncurlen1 = 0\n\ndanger = False\nfor i in a:\n if i==\"0\":\n curlen0 += 1\n curlen1 = 0\n if i==\"1\":\n curlen1 += 1\n curlen0 = 0\n \n if curlen0 >= 7:\n danger = True\n break\n if curlen1 >= 7:\n danger = True\n break\n\nif danger: print(\"YES\")\nelse: print(\"NO\")", "def result(s):\n\tlength=len(s)\n\tif length>=7:\n\t\tfor i in range(length):\n\t\t\tif i<=length-7:\n\t\t\t\ta=s[i:i+7]\n\t\t\t\tif a==\"1111111\" or a==\"0000000\":\n\t\t\t\t\tprint(\"YES\")\n\t\t\t\t\treturn\t\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"NO\")\n\t\t\t\t\n\t\t\t\n\t\t\n\n\ns=input()\nresult(s)\n", "import sys\r\ninput = sys.stdin.readline\r\nref = input()\r\nprint(\"YES\" if \"1111111\" in ref or \"0000000\" in ref else \"NO\" )", "string = input()\r\nzeros='0000000'\r\nones='1111111'\r\nif zeros in string or ones in string:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nif a.count('0000000')>=1 or a.count('1111111')>=1:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nif a.count(\"1111111\") or a.count(\"0000000\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "q = \"0000000\"\r\np = \"1111111\"\r\ns=input()\r\nif p in s or q in s:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "sq = input()\r\n\r\nconsecutive_ones = 0\r\nconsecutive_zeros = 0\r\n\r\nfor i in range(len(sq)):\r\n if sq[i] == \"1\":\r\n consecutive_ones += 1\r\n consecutive_zeros = 0\r\n else:\r\n consecutive_zeros += 1\r\n consecutive_ones = 0\r\n \r\n if consecutive_ones >= 7 or consecutive_zeros >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "a=input ()\r\nif \"1111111\" in a or \"0000000\" in a:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "about1 = str(input())\r\nabout2 = int(len(about1))\r\nboat2 = [1]\r\nfor i in range(1,about2):\r\n if int((about1[i]))==int((about1[i-1])):\r\n boat2 . append(1)\r\n else:\r\n if len(boat2)>6:\r\n break\r\n else:\r\n boat2 = [1]\r\nif (len(boat2))>6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A = input()\r\nB = \"0000000\"\r\nC = \"1111111\"\r\nif B in A or C in A:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nc = 0\r\nd = 0\r\n\r\nfor i in range(0, len(n)):\r\n if n[i] == \"1\":\r\n c += 1\r\n else:\r\n c = 0\r\n\r\n if n[i] == \"0\":\r\n d += 1\r\n else:\r\n d = 0\r\n\r\n if c == 7 or d == 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nc = 1\r\nout = \"NO\"\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n c+=1\r\n if c == 7:\r\n out = \"YES\"\r\n break\r\n else:\r\n c=1\r\nprint(out)\r\n\r\n ", "word=input()\nteam1=\"0000000\"\nteam2=\"1111111\"\nif team1 in word or team2 in word:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t \t\t\t \t \t \t\t \t\t", "a=input()\r\nk='0000000'\r\nl='1111111'\r\nif ((k in a)or (l in a)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nc = 1\r\nflag = True\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n c += 1\r\n if c == 7:\r\n print(\"YES\")\r\n flag = False\r\n break\r\n else:\r\n c = 1\r\nif flag:\r\n print(\"NO\")", "# Read input\r\ns = input()\r\n\r\n# Initialize counters for consecutive ones and consecutive zeros\r\nconsecutive_ones = 0\r\nconsecutive_zeros = 0\r\n\r\n# Iterate through the string\r\nfor c in s:\r\n if c == '1':\r\n consecutive_ones += 1\r\n consecutive_zeros = 0\r\n else:\r\n consecutive_zeros += 1\r\n consecutive_ones = 0\r\n\r\n # Check if the situation is dangerous\r\n if consecutive_ones >= 7 or consecutive_zeros >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\nc=0\nf=x[0]\nfor i in x:\n if f==i:\n c+=1\n else:\n c=1\n f=i\n if c==7:\n break\nif c>=7:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t\t\t \t \t\t \t\t\t\t \t\t \t", "s=str(input())\r\na=(\"1111111\")\r\nb=(\"0000000\")\r\nif a in s or b in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num = list(input())\r\nx = 0\r\nfor i in range(0,len(num) - 1):\r\n if num[i + 1] == num[i]:\r\n x = x +1\r\n else:\r\n x = 0\r\n if x >= 6:\r\n print(\"YES\")\r\n break\r\n\r\nif x < 6 :\r\n print(\"NO\")\r\n", "team = input()\r\nif '0000000' in team or '1111111' in team:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "import os\r\nimport math\r\nimport re\r\n\r\nstring = input().strip()\r\n\r\nif '1111111' in string or '0000000' in string:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\ncount = 0\r\ncon = n[0]\r\nfor i in n:\r\n if i == con:\r\n count += 1\r\n if count >= 7:\r\n print('YES')\r\n break\r\n else:\r\n con = i\r\n count = 1\r\nif count < 7:\r\n print('NO')", "one, zero =0, 0\r\npos = input()\r\nfor i in range(len(pos)):\r\n if pos[i] == \"1\":\r\n one +=1\r\n zero = 0\r\n else:\r\n zero +=1\r\n one = 0\r\n \r\n if one >=7 or zero >=7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "a=0\r\nb=0\r\n\r\nc=(input(\"\"))\r\n\r\nfor x in c:\r\n if x == \"0\":\r\n b = 0\r\n a += 1\r\n if a == 7:\r\n break\r\n else:\r\n a = 0\r\n b += 1\r\n if b == 7:\r\n break\r\nif a == 7 or b == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "entrada = [int(a) for a in input()]\r\npila1 = 0; pila0 = 0\r\n\r\nif entrada[0] == 1:\r\n pila1 = 1; pila0 = 1\r\ncuenta1 = 0; cuenta0 = 0\r\n\r\nfor i in entrada[1:]:\r\n if i == 1 and pila1 == 1:\r\n cuenta1 += 1; pila1 = 1\r\n elif i == 0 and pila0 == 0:\r\n cuenta0 += 1; pila0 =0\r\n else:\r\n if cuenta1 >=6 or cuenta0>=6:\r\n print('YES')\r\n break\r\n else:\r\n pila0 = i; pila1 = i; cuenta1 = 0; cuenta0 = 0\r\nelse:\r\n if cuenta1 >= 6 or cuenta0 >= 6:\r\n print('YES')\r\n else:\r\n print('NO')", "string = input()\r\nsum1 , sum2 = 0,0\r\nfor i in range(len(string)):\r\n if string[i] == \"0\":\r\n sum1+=1\r\n sum2 =0\r\n else:\r\n sum2+=1\r\n sum1= 0\r\n if sum1 == 7 or sum2 == 7:\r\n break \r\nif sum1 >=7 or sum2 >=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "a=input()\r\nfor i in range(len(a)-6):\r\n if a[i]==a[i+1]==a[i+2]==a[i+3]==a[i+4]==a[i+5]==a[i+6]=='0' or a[i]==a[i+1]==a[i+2]==a[i+3]==a[i+4]==a[i+5]==a[i+6]=='1':\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "situation = input()\r\n\r\ncount = 0\r\nlast_player = ''\r\n\r\nfor player in situation:\r\n if player == last_player:\r\n count += 1\r\n else:\r\n count = 1\r\n last_player = player\r\n \r\n if count == 7:\r\n print(\"YES\")\r\n break\r\n \r\nif count < 7:\r\n print(\"NO\")", "s = input()\r\nk = len(s)\r\nlist = [0]\r\na = 0\r\nwhile True:\r\n if a==(k-1):\r\n break\r\n b = 1\r\n for i in range(a, k-1):\r\n if s[i]==s[i+1]:\r\n b += 1\r\n a += 1\r\n list.append(b)\r\n else:\r\n a += 1\r\n break\r\nif max(list)>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\n\ncount = 1\nlast_char = s[0]\ndangerous = False\n\nfor i in range(1, len(s)):\n if s[i] == last_char:\n count += 1\n if count >= 7:\n dangerous = True\n break\n else:\n count = 1\n last_char = s[i]\n\nif dangerous:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n=input()\nx=\"0000000\"\nx1=\"1111111\"\nif x1 in n:\n print(\"YES\")\nelif x in n:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t \t\t \t \t \t\t\t\t\t \t \t", "n=input()\nif \"0000000\" in n or \"1111111\" in n:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "s = input()\r\nzero = \"0000000\"\r\none = \"1111111\"\r\nif zero in s:\r\n print(\"YES\")\r\nelif one in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ncc = 0\r\na = 0\r\nfor i in range(1, len(n)):\r\n\tif n[i-1] == n[i]:\r\n\t\tcc+=1\r\n\t\tif cc >=6:\r\n\t\t\ta+=1\r\n\telse:\r\n\t\tcc= 0\r\n\r\n\r\nif a >= 1:\r\n\tprint('YES')\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "n=input()\r\nk=1\r\na=0\r\nfor i in range(len(n)-1):\r\n if n[i]==n[i+1]:\r\n k+=1\r\n else:\r\n k=1\r\n if k==7:\r\n a=1\r\nif a==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "def func1(s):\r\n c = 1\r\n res = 0 #11110111111111111\r\n for i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n c+=1\r\n else:\r\n res= max(res,c)\r\n c = 1\r\n if s[i] == s[i-1]:\r\n c+=1\r\n res = max(res,c)\r\n return res\r\ns = input()\r\nresult = func1(s)\r\nif result>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\ns = 'NO'\r\nfor i in range(len(a)):\r\n if '0000000' in a:\r\n s = 'YES'\r\n elif '1111111' in a:\r\n s = 'YES'\r\n else:\r\n s ='NO'\r\nprint(s)", "s=input()\r\nif s.count('1')==len(s) and len(s)>=7:\r\n print(\"NO\")\r\nelif s.count('0')==len(s) and len(s)>=7:\r\n print(\"NO\") \r\nelse:\r\n x=1\r\n l=[0]\r\n for i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n x+=1\r\n else:\r\n l.append(x)\r\n x=1\r\n l.append(x) \r\n if max(l)>=7:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a=input()\r\nprint(\"YES\") if a.count(\"1111111\")>=1 or a.count(\"0000000\") else print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 19:29:17 2023\r\n\r\n@author: Pomfret Du\r\n\"\"\"\r\n\r\nline = str(input())\r\nif '0000000' in line or '1111111' in line:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve():\r\n if '0000000' in str or '1111111' in str:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\n\r\n\r\nstr = input()\r\nresult = solve()\r\nprint(result)\r\n\r\n\r\n\r\n", "st=input()\r\nif '0000000' in st:\r\n print(\"YES\")\r\nelif '1111111' in st:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "d=input()\r\nt=len(d)\r\nfor i in range(t-6):\r\n if d[i:i+7]==\"0000000\" or d[i:i+7]==\"1111111\":\r\n print(\"YES\")\r\n break\r\nelse:print(\"NO\") ", "n = input()\r\ncounter = 0\r\nif 7*'1' in n:\r\n counter += 1\r\nif 7*'0' in n:\r\n counter += 1\r\nif counter > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "countZ=0\r\ncountO=0\r\n\r\n\r\ns=input()\r\n \r\nfor ch in s:\r\n if ch==\"0\":\r\n countZ+=1\r\n countO=0\r\n if countZ==7:\r\n print(\"YES\")\r\n break\r\n\r\n if ch==\"1\":\r\n countO+=1\r\n countZ=0\r\n if countO==7:\r\n print(\"YES\")\r\n break\r\n\r\n\r\nif countO!=7 and countZ!=7:\r\n print(\"NO\")\r\n \r\n ", "positions = str(input())\n\nif '1'*7 in positions or '0'*7 in positions:\n print('YES')\nelse:\n print('NO')\n", "s=input()\r\nl=\"1111111\"\r\np=\"0000000\"\r\nif(l in s or p in s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t = input()\r\na,b = 0,0\r\nfor i in t:\r\n if i == '0':\r\n a += 1\r\n b = 0\r\n else:\r\n b += 1\r\n a = 0\r\n if a== 7 or b ==7:\r\n break\r\n#print(a,b)\r\nif a == 7 or b == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a= str(input().strip())\nif \"0000000\" in a:\n print(\"YES\")\nelif \"1111111\" in a:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t \t \t", "str1 = str(input())\r\nif \"0000000\" in str1 or \"1111111\" in str1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# n,k= map(int,input().split())\r\na = input()\r\n\r\ni=0\r\nj=0\r\ns=0\r\n\r\nwhile (i<len(a) and j<len(a)):\r\n\tif (a[i] != a[j]):\r\n\t\ti = j\r\n\t\ts = 0\r\n\tj+=1\r\n\ts+=1\r\n\tif (s >= 7):\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nelse:\r\n\tprint (\"NO\")\r\n\r\n\r\n\r\n", "chaine=input()\r\ncompteur=1\r\nfor i in range(1,len(chaine)):\r\n if chaine[i-1]==chaine[i]:\r\n compteur+=1\r\n if compteur==7:\r\n print(\"YES\")\r\n break\r\n else:\r\n compteur=1\r\n if i==len(chaine)-1:\r\n print(\"NO\")", "k=input()\r\nc=0\r\nflag=0\r\nmax=0\r\nfor i in range(len(k)):\r\n if(int(k[i])==0):\r\n c+=1\r\n else:\r\n if(max<c):\r\n max=c\r\n c=0\r\nif(c>max):\r\n max=c \r\nif(max>=7):\r\n flag=1\r\n print('YES')\r\nif flag==0:\r\n l='1'\r\n c=0\r\n max=0\r\n for i in range(len(k)):\r\n if(k[i]==l):\r\n c+=1\r\n else:\r\n if(max<c):\r\n max=c\r\n c=0\r\n if(c>max):\r\n max=c\r\n if(max>=7):\r\n flag=1\r\n print('YES') \r\nif flag==0:\r\n print('NO')", "x = input()\r\ndanger0 = x.count(\"0000000\")\r\ndanger1 = x.count(\"1111111\")\r\nif danger0 > 0 or danger1 > 0 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "# 96 A Football\r\nmatch = list(map(int,input()))\r\ncounter = 0\r\nfor i in range(0,len(match)-1):\r\n if match[i] == match[i+1]:\r\n counter = counter + 1\r\n else:\r\n counter = 0\r\n \r\n if counter == 6:\r\n print(\"YES\")\r\n break\r\n \r\n \r\nif counter != 6:\r\n print(\"NO\")\r\n\r\n", "s = list(input())\ncurrent_state = 1\ndangerous = 0\nfor i in range(1, len(s)):\n if s[i] == s[i-1]:\n current_state += 1\n if current_state == 7:\n dangerous = 1\n break\n if s[i-1] != s[i]:\n current_state = 1\nprint('YES' if dangerous else 'NO')\n", "string = str(input())\r\nflag = 0\r\ncount = 1\r\nmax = 0\r\nprinting = \"NO\"\r\n\r\nfor i in range(len(string)):\r\n if i == 0:\r\n flag = string[0]\r\n else:\r\n if string[i] != flag:\r\n count = 1 \r\n flag = string[i] \r\n else:\r\n count += 1\r\n if count > 6:\r\n printing = \"YES\"\r\n break\r\nprint(printing)", "n = input()\r\nif n!=\" \" and len(n)<=100:\r\n lo = n.split(\"0\")\r\n lz = n.split(\"1\")\r\n loz = lo+lz\r\n for i in loz:\r\n if len(i)>=7:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n \r\n ", "count=0\r\ns = input() \r\nn = len(s) \r\nfor i in range(0,n-1):\r\n if s[i] == s[i+1]:\r\n count += 1\r\n if count >=6:\r\n break\r\n \r\n else:\r\n count -= count\r\n continue\r\nif count>=6:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "n = input()\r\nif (n.find('0000000') != -1) or (n.find('1111111') != -1):\r\n print('YES')\r\nelse:\r\n print('NO')", "sequence = input()\n\nis_dangerous = False\nfor i in range(len(sequence) - 6):\n if sequence[i: i + 7] == \"1111111\" or sequence[i: i + 7] == \"0000000\":\n is_dangerous = True\n break\n\nprint(\"YES\" if is_dangerous else \"NO\")\n\n\t\t \t\t\t \t \t \t\t\t \t\t\t\t \t \t", "'''\n\n10111111110\n\nYES\n\n'''\n\nzero = '0000000'\none = '1111111'\ns = input()\n\nif zero in s or one in s:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "def howmany(st,x):\r\n n = 0\r\n for i in st:\r\n if n >= 7:\r\n break\r\n if i == x:\r\n n+=1\r\n else:\r\n n = 0\r\n return n\r\n \r\nst = input()\r\n\r\nif howmany(st,'1') >= 7 or howmany(st,'0') >= 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "def dangerous(num):\r\n if len(num) < 7:\r\n return 'NO'\r\n mx = 1\r\n counter = 1\r\n for i in range(len(num)):\r\n if i + 1 < len(num):\r\n if num[i] == num[i + 1]:\r\n counter += 1\r\n else:\r\n counter = 1\r\n mx = max(mx, counter)\r\n if mx == 7:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nprint(dangerous(input()))", "s=input()\r\nones=0\r\nzeros=0\r\n\r\ncounter=0\r\nfor i in s:\r\n if i==\"1\":\r\n ones+=1\r\n zeros=0\r\n else:\r\n zeros+=1\r\n ones=0\r\n if zeros>=7 or ones>=7:\r\n counter=1\r\nif counter==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_dangerous(s):\r\n count = 1\r\n for i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n count += 1\r\n else:\r\n count = 1\r\n if count == 7:\r\n return \"YES\"\r\n return \"NO\"\r\nsituation = input().strip()\r\nresult = is_dangerous(situation)\r\nprint(result)", "pos = input()\nif '0000000' in pos or '1111111' in pos: \n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \t\t\t \t \t \t\t\t\t\t\t \t \t\t\t\t \t\t\t", "n = input()\r\nl = []\r\nx = 1\r\nxMAx = 1\r\nfor i in n:\r\n l.append(int(i))\r\nfor i in range(len(l) - 1):\r\n if l[i] == l[i + 1]:\r\n x += 1\r\n else:\r\n x = 1\r\n if x > xMAx:\r\n xMAx = x\r\nif xMAx >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "strr = input()\r\nif '0000000' in strr or '1111111' in strr:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nzero='0000000'\r\none='1111111'\r\nif(zero in s or one in s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nif \"1\" * 7 in s or \"0\" * 7 in s: print(\"YES\")\r\nelse: print(\"NO\")", "str1=input()\r\ncount=1\r\nprev_char = str1[0]\r\nfor i in range(1, len(str1)):\r\n if str1[i] == prev_char:\r\n count += 1\r\n else:\r\n count = 1\r\n prev_char = str1[i]\r\n if count >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "situation = input()\r\ncurrent_char = situation[0]\r\ncurrent_count = 1\r\nfor char in situation[1:]:\r\n if char == current_char:\r\n current_count += 1\r\n if current_count >= 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n current_char = char\r\n current_count = 1\r\nelse:\r\n print(\"NO\")", "n = input()\r\na = n.count('0000000')\r\nb = n.count('1111111')\r\nif a >= 1 or b >= 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "x = input()\r\nlength = len(x)\r\ncount = 1\r\n\r\nfor i in range(length-1):\r\n a,b = x[i],x[i+1]\r\n if a == b:\r\n count += 1\r\n else:\r\n count = 1\r\n if count == 7:\r\n break\r\n \r\nif count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=\"0000000\"\r\nb=\"1111111\"\r\nif a in s:\r\n print(\"YES\")\r\nelif b in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nc=0\r\nif \"1111111\" in n or \"0000000\" in n:\r\n c=1\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "p=\"0000000\"\r\nq=\"1111111\"\r\ns=input()\r\nif p in s or q in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[17]:\n\n\n# Read the input string\ns = input()\n\n# Initialize variables to keep track of consecutive ones and zeros\nconsecutive_zeros = 0\nconsecutive_ones = 0\n\n# Iterate through the string\nfor char in s:\n if char == '0':\n consecutive_zeros += 1\n consecutive_ones = 0\n else:\n consecutive_ones += 1\n consecutive_zeros = 0\n\n # Check for a dangerous situation\n if consecutive_zeros >= 7 or consecutive_ones >= 7:\n print(\"YES\")\n break\nelse:\n # If the loop completes without finding a dangerous situation, print \"NO\"\n print(\"NO\")\n\n\n# In[ ]:\n\n\n\n\n", "n = str(input())\r\na = '1111111'\r\nb = '0000000'\r\nif n.find(a) != -1 or n.find(b) != -1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "chain = input()\n\nif chain.__contains__('1111111') or chain.__contains__('0000000'):\n print('YES')\nelse:\n print('NO')\n \t \t \t \t\t \t\t \t\t \t\t \t\t \t", "def dangerous(s):\r\n for i in range(len(s)-6):\r\n result=s[i:i+7]\r\n if result.count('0')==7 or result.count('1')==7:\r\n return \"YES\"\r\n return \"NO\"\r\n \r\ns=input()\r\nprint(dangerous(s))", "class Football:\n\n def __init__(self, teams):\n self.teams = teams\n\n def dangerous(self):\n if \"1111111\" in self.teams or \"0000000\" in self.teams:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\na = Football(input())\na.dangerous()", "st=input()\r\nif ('0'*7) in st or ('1'*7) in st:\r\n\tprint('YES')\r\nelse:\r\n\tprint(\"NO\")", "players = input()\r\nteam1 = '0000000'\r\nteam2 = '1111111'\r\nprint(\"YES\" if team1 in players or team2 in players else \"NO\")", "n = input()\r\na,b=\"0\",\"1\"\r\non,ze=0,0\r\nfor i in range(len(n)):\r\n if n[i]==a:\r\n on +=1\r\n if on >=7 or ze >=7:\r\n break \r\n ze = 0\r\n elif n[i]==b:\r\n ze +=1\r\n if on >=7 or ze >=7:\r\n break \r\n on = 0\r\n\r\nif ze == 7 or on ==7 :\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "def main():\r\n a = 0\r\n b = 0\r\n while True:\r\n posn = input(\"\")\r\n for x in range(len(posn)):\r\n if posn[x] == \"0\":\r\n a+=1\r\n \r\n if posn[x] == \"1\":\r\n b+=1\r\n \r\n\r\n if a > 0 and b > 0 and len(posn) <= 100:\r\n break\r\n\r\n c = 0\r\n for y in range(0, len(posn) - 1):\r\n if posn[y] == posn[y+1]:\r\n c+=1\r\n if c >= 6:\r\n print(\"YES\")\r\n return\r\n else:\r\n c = 0\r\n\r\n if c < 6:\r\n print(\"NO\")\r\n return\r\n\r\nmain()", "v=input().strip()\r\ncount_1=0\r\ncount_0=0\r\nfor i in v:\r\n if i==\"0\":\r\n count_0 +=1\r\n if count_0>=7:\r\n break\r\n count_1=0\r\n else:\r\n count_1+=1\r\n if count_1>=7:\r\n break\r\n count_0=0\r\nif count_1>=7 or count_0>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "s = input()\nc = 0\nl = ''\nfor i in range(len(s)):\n if l == s[i]:\n c += 1\n else:\n l = s[i]\n c = 1\n if c == 7:\n print('YES')\n exit()\nprint('NO')", "q=input().strip()\r\nw=0\r\ns=0\r\nfor char in q:\r\n if char=='0':\r\n w+=1\r\n s=0\r\n elif char=='1':\r\n s+=1\r\n w=0\r\n if w>=7 or s>=7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n=list(input())\r\nx=[]\r\ny=0\r\nfor i in range(len(n)-1):\r\n if n[i]==n[i+1]:\r\n y+=1\r\n x.append(y)\r\n elif n[i] != n[i+1]:\r\n y=0\r\nif len(x) == 0 :\r\n print('NO')\r\nelif max(x) >=6:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 24 00:43:13 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\np=input()\r\nif \"0000000\" in p or \"1111111\" in p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, count, ans = input(), 0, \"NO\"\r\nfor i in range(1, len(a)):\r\n if a[i] == a[i-1]: count += 1\r\n else: count = 0\r\n if count == 6:\r\n ans = \"YES\"\r\n break\r\nprint(ans)", "def football_a():\r\n s = input()\r\n i = 0\r\n while(i<len(s)):\r\n c = 0\r\n x = s[i]\r\n while(i<len(s) and s[i] == x):\r\n c += 1\r\n i += 1\r\n if(c >= 7):\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n\r\nif __name__ == '__main__':\r\n # import math\r\n football_a()", "s = input()\r\ncounter = 1\r\nfor i in range(1, len(s)):\r\n if counter >= 7:\r\n break\r\n if s[i] == s[i - 1]:\r\n counter += 1\r\n else:\r\n counter = 1\r\nif counter >= 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\n# Initialize a variable to keep track of the current count\r\ncurrent_count = 1\r\n\r\n# Initialize a variable to store the result\r\nresult = \"NO\"\r\n\r\n# Iterate through the string starting from the second character\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i - 1]:\r\n current_count += 1\r\n if current_count >= 7:\r\n result = \"YES\"\r\n break\r\n else:\r\n current_count = 1\r\n\r\nprint(result)\r\n", "n=input()\r\nx=7*'0'\r\ny=7*'1'\r\nif x in n or y in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "players = input()\r\nfor i in range(0, len(players) - 6):\r\n sub_players = [int(player) for player in players[i:i + 7]]\r\n if sum(sub_players) == 0 or sum(sub_players) == 7:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n", "def solve():\r\n s=(input())\r\n max1=1\r\n cur=1\r\n for i in range(0,len(s)-1):\r\n if s[i]==s[i+1]:\r\n cur+=1\r\n else:\r\n max1=max(max1,cur)\r\n cur=1\r\n if(max1>=7 or cur>=7):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n# t=int(input())\r\ni=1\r\n# while i<=t:\r\nsolve()\r\n # i+=1", "x= input()\r\ncount_zero=0\r\ncount_one=0\r\nfor index in range(0,len(x)):\r\n if(x[index]=='0'):\r\n count_zero+=1\r\n count_one=0\r\n if(count_zero==7):\r\n print(\"YES\")\r\n exit()\r\n elif(x[index]=='1'):\r\n count_zero=0\r\n count_one+=1\r\n if(count_one==7):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "import sys\r\n\r\nsituation = sys.stdin.readline()\r\n\r\nzeroes = 0\r\nones = 0\r\ndangerous = False\r\n\r\nfor i in situation:\r\n if i == '0':\r\n ones = 0\r\n zeroes += 1\r\n else:\r\n zeroes = 0\r\n ones += 1\r\n if zeroes == 7 or ones == 7:\r\n dangerous = True\r\n break\r\n\r\nif dangerous:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n = input()\r\nif '0000000'in n or '1111111' in n:\r\n print('YES')\r\nelse:\r\n print('NO')", "pos = str(input())\nlength = len(pos)\n\ndanger = False\n\nfor p in range(length):\n if p >= 6:\n prev = pos[p-6:p+1]\n else:\n prev = None\n \n if prev == \"0\"*7 or prev == \"1\"*7:\n danger = True\n break\n\nif danger == True:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=input()\ns=\"0000000\"\ni=\"1111111\"\nif(s in n or i in n):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t \t\t\t \t \t\t \t\t \t", "x=input()\r\nif len(x)>7:\r\n if \"0000000\" in x or \"1111111\" in x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "players = input()\r\nconsecutive_count = 1 \r\ncurrent_team = players[0] \r\nfor player in players[1:]:\r\n if player == current_team:\r\n consecutive_count += 1\r\n if consecutive_count >= 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n consecutive_count = 1 \r\n current_team = player\r\nif consecutive_count < 7:\r\n print(\"NO\")\r\n", "def solve(a):\n ans = \"NO\"\n size = 1\n team = \"0\"\n for i in a:\n if i == team:\n size += 1\n else:\n if team == \"0\":\n team = \"1\"\n else:\n team = \"0\"\n size = 1\n if size == 7:\n ans = \"YES\"\n break\n\n print(ans)\n\n\nuser = input()\n\n\nsolve(user)\n", "sit = input() ####### is x in string\n\nif sit.find(\"1111111\") != -1:\n print(\"YES\")\nelif sit.find(\"0000000\") != -1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n####### longest substring compared with 7\n\n\n# count = 1 #### count forwards w8 for 7\n# sit = input()\n# flag = False\n# for i in range(len(sit) - 1):\n# if sit[i] == sit[i + 1]:\n# count += 1\n# if count == 7:\n# flag = True\n# break\n# else:\n# count = 1\n# if flag:\n# print(\"YES\")\n# else:\n# print(\"NO\")\n", "t=input()\r\nif ('1'*7 in t) or ('0'*7 in t):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "s = input()\n\nzero = '0000000'\none = '1111111'\n\nif zero in s or one in s:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t \t\t\t \t \t\t \t \t\t\t \t \t", "a = input()\r\nc=[a[0]]\r\nfor i in a[1:]:\r\n if(c[len(c)-1] == i):\r\n c.append(i)\r\n if (len(c) >= 7):\r\n print('YES')\r\n break\r\n else:\r\n c = [i]\r\n\r\nelse:\r\n print('NO')", "a=input()\nb=a.find(\"0000000\")\nc=a.find(\"1111111\")\nif b==-1 and c==-1:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\t \t\t \t \t \t\t \t\t\t \t \t\t \t\t", "situation = input(\"\")\r\na = situation[0]\r\ncount = 1\r\n\r\nfor x in range(1, len(situation)):\r\n if situation[x] == a:\r\n count += 1\r\n if count == 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n a = situation[x]\r\n count = 1\r\nelse:\r\n print(\"NO\")\r\n\r\n", "string = str(input())\r\n\r\nzeroes = \"0000000\"\r\nones = \"1111111\"\r\n\r\nif zeroes in string:\r\n print(\"YES\")\r\nelif ones in string:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input(\"\")\r\n\r\nstringsToFind = [\"0000000\", \"1111111\"]\r\n\r\nif stringsToFind[0] in s:\r\n print(\"YES\")\r\nelif stringsToFind[1] in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input().strip()\r\nn=len(s)\r\nc=1\r\nfor i in range(1,n):\r\n if s[i]==s[i-1]:\r\n c+=1\r\n else:\r\n c=1\r\n if c==7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "string = input()\r\ncurrent_length = 1\r\n\r\nfor i in range(len(string) - 1):\r\n if string[i] == string[i + 1]:\r\n current_length += 1\r\n if current_length >= 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n current_length = 1\r\n\r\nif current_length < 7:\r\n print(\"NO\")\r\n", "n = input()\r\nif '0000000' in n or '1111111' in n: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "i = input()\r\nif '0000000' in i or '1111111' in i:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nss=\"1111111\"\r\nsz=\"0000000\"\r\nif ss in s:\r\n print(\"YES\")\r\nelif sz in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input string\r\ns = input()\r\n\r\n# Initialize a counter and a flag\r\ncount = 1\r\ndangerous = False\r\n\r\n# Iterate through the string starting from the second character\r\nfor i in range(1, len(s)):\r\n # If the current character is the same as the previous one, increment the counter\r\n if s[i] == s[i - 1]:\r\n count += 1\r\n else:\r\n # If the counter reaches 7, set the dangerous flag to True and break\r\n if count >= 7:\r\n dangerous = True\r\n break\r\n # Otherwise, reset the counter\r\n count = 1\r\n\r\n# Check the counter one last time after the loop\r\nif count >= 7:\r\n dangerous = True\r\n\r\n# Print the result\r\nif dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\ns = input()\r\n\r\nconsecutive_count = 1\r\nlast_char = s[0]\r\n\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] == last_char:\r\n consecutive_count += 1\r\n if consecutive_count >= 7:\r\n print(\"YES\") \r\n break\r\n else:\r\n consecutive_count = 1\r\n last_char = s[i]\r\n\r\nif consecutive_count < 7:\r\n print(\"NO\") \r\n", "import re\r\nn = input()\r\nx = re.search(\"0000000\", n)\r\ny = re.search(\"1111111\", n)\r\nif x or y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "players = input()\r\nprev_player = None\r\ncnt = 1\r\n\r\n\r\n\r\nfor i in range(len(players)):\r\n if players[i] == prev_player:\r\n cnt += 1\r\n elif players[i] != prev_player:\r\n cnt = 1 \r\n prev_player = players[i]\r\n\r\n if cnt == 7:\r\n break\r\n\r\n\r\nprint('YES' if cnt == 7 else 'NO')", "s=input()\r\nif s.count(\"1111111\")>0 or s.count(\"0000000\")>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def fun(y):\n count=1\n for i in range(1,len(y)):\n if y[i]==y[i-1]:\n count+=1\n if count>=7:\n return \"YES\"\n else:\n count=1\n return \"NO\"\n \ny=input().strip()\nres=fun(y)\nprint (res)\n \t\t\t \t \t\t\t \t\t\t\t\t\t\t\t \t\t", "string = str(input())\r\n\r\ncount = 1\r\nfor i in range(len(string)-1):\r\n if string[i] == string[i+1]:\r\n count += 1\r\n else:\r\n count = 1\r\n if count == 7:\r\n break\r\n\r\nif count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input()\ns=\"0000000\"\ns2=\"1111111\"\nif(s in x or s2 in x):\n print(\"YES\")\nelse:\n print(\"NO\");\n\t \t \t \t \t\t\t \t \t \t\t\t", "q = \"0000000\"\np = \"1111111\"\nk = input()\nif q in k or p in k:\n print (\"YES\")\nelse:\n print (\"NO\")", "s = input()\r\nn = len(s)\r\nans = \"NO\"\r\nk = s.count('0000000') + s.count('1111111')\r\nif k > 0:\r\n\tans = \"YES\"\r\nprint(ans)", "t = input()\r\nzero = list(filter(None, t.split(\"1\")))\r\none = list(filter(None, t.split(\"0\")))\r\nc = 0\r\nfor i in zero:\r\n if len(i)>=7:\r\n c+=1\r\nfor i in one:\r\n if len(i)>=7:\r\n c+=1\r\nif c>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\ncount = 0\r\nprev = None\r\nfor player in map(int, input()):\r\n if player == prev:\r\n count += 1\r\n else:\r\n count = 1\r\n if count >= 7:\r\n print('YES')\r\n break\r\n prev = player\r\nelse:\r\n print('NO')\r\n \r\n ", "positions = str(input())\r\n\r\ndanger = 1\r\nbest = 0\r\nfor i in range(len(positions)-1):\r\n if positions[i+1] == positions[i]:\r\n danger += 1\r\n if danger > best:\r\n best = danger\r\n else:\r\n danger = 1\r\nif best >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "thing = input()\r\nthelist = []\r\ncount1 = 0\r\ncount0 = 0\r\nanswer = \"NO\"\r\nfor i in range(len(thing)):\r\n thelist.append(thing[i])\r\n\r\nfor i in range(len(thelist)):\r\n if int(thelist[i]) == 0:\r\n count0 = count0 + 1\r\n count1 = 0\r\n elif int(thelist[i]) == 1:\r\n count1 = count1 + 1\r\n count0 = 0\r\n if ((count1 == 7) or (count0 == 7)):\r\n answer = \"YES\"\r\nprint(answer)", "biner = input()\r\nsev_zeros = \"0\"*7\r\nsev_ones = \"1\"*7\r\nif(len(biner)<7):\r\n print(\"NO\")\r\nelse:\r\n if(sev_ones in biner or sev_zeros in biner):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "numbers=[int(i) for i in input()]\r\ncount=[]\r\nfor i in range(len(numbers)):\r\n if numbers[i] not in count:\r\n count=[]\r\n count.append(numbers[i])\r\n if len(count)==7:\r\n print(\"YES\")\r\n break\r\nif len(count)!=7:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\n", "name=input(\"\")\r\nZero=name.split(\"0\")\r\nOne=name.split(\"1\")\r\ncondition=True\r\nfor i in Zero:\r\n if len(i)>=7:\r\n condition=False\r\n break\r\nif condition == True:\r\n for j in One:\r\n if len(j)>=7:\r\n condition=False\r\n break\r\nif condition==False:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\no = 0\r\nz = 0\r\nflaq = False\r\nfor i in s:\r\n if i == '1':\r\n o += 1\r\n z = 0\r\n if o == 7:\r\n print(\"YES\")\r\n flaq = True\r\n break\r\n else:\r\n z += 1\r\n o = 0\r\n if z == 7:\r\n print(\"YES\")\r\n flaq = True\r\n break\r\nif not flaq:\r\n print(\"NO\")", "s = input() \r\nconsecutive_count = 1\r\nprev_player = s[0]\r\nfor player in s[1:]:\r\n if player == prev_player:\r\n consecutive_count += 1\r\n else:\r\n consecutive_count = 1\r\n prev_player = player\r\n if consecutive_count >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\ny=\"0000000\"\r\nx=\"1111111\"\r\nif y in n or x in n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "\"\"\"\nA. Football\ntime limit per test\n2 seconds\nmemory limit per test\n256 megabytes\ninput\nstandard input\noutput\nstandard output\n\nPetya loves football very much. One day, as he was watching a football match, he was writing the players' current positions on a piece of paper. To simplify the situation he depicted it as a string consisting of zeroes and ones. A zero corresponds to players of one team; a one corresponds to players of another team. If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 is not. You are given the current situation. Determine whether it is dangerous or not.\nInput\n\nThe first input line contains a non-empty string consisting of characters \"0\" and \"1\", which represents players. The length of the string does not exceed 100 characters. There's at least one player from each team present on the field.\nOutput\n\nPrint \"YES\" if the situation is dangerous. Otherwise, print \"NO\".\n\"\"\"\nsituation = input()\nif situation.__contains__(\"0000000\") or situation.__contains__(\"1111111\"):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a = input('')\r\ns = 0\r\nt = 0\r\n\r\nfor i in a:\r\n if i == '0':\r\n t = 0\r\n s = s + 1\r\n if s == 7:\r\n break\r\n elif i == '1':\r\n t = t + 1\r\n s = 0\r\n if t == 7:\r\n break\r\n\r\nif s == 7 or t == 7:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n", "x=input()\r\ncountzero=0\r\ncountone=0\r\nsume=0\r\nfor i in x:\r\n if i=='1':\r\n countone+=1\r\n countzero=0\r\n if i=='0':\r\n countzero+=1\r\n countone=0\r\n if countone>=7 or countzero>=7 :\r\n sume+=1\r\nif sume>=1 :\r\n print('YES')\r\nelse :\r\n print('NO')", "string=input()\r\nif '0'*7 in string or '1'*7 in string:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input();print (['NO','YES'][any(t*7 in n for t in '01')])", "num = input()\n# num = num.replace(\"0\",\"2\")\nresult=False\nif len(num)<7:\n print(\"NO\")\nelse:\n i=0\n lst=[]\n\n for el in num:\n x=(num[i:i+7])\n if len(x)<7:\n break\n else:\n lst.append(x)\n i+=1\n # print(lst)\n for el in lst:\n count=1\n for i in range(len(el)-1):\n if el[i]!= el[i+1]:\n \n break\n \n else:\n count+=1\n # print(count)\n if count>=7:\n result=True\n break\n \n if result==True:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t\t\t\t \t \t\t \t \t \t\t\t \t", "s=input()\r\nn,c=len(s),False\r\nfor i in range(n-6):\r\n if s[i]==s[i+1]==s[i+2]==s[i+3]==s[i+4]==s[i+5]==s[i+6]:\r\n c=True\r\n break\r\nprint(\"YES\" if c else \"NO\")", "s = input()\r\nk0, k1, b = 0, 0, False\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n if k1 > 6:\r\n b = True\r\n break\r\n k1 = 0\r\n k0 += 1\r\n else:\r\n if k0 > 6:\r\n b = True\r\n break\r\n k0 = 0\r\n k1 += 1\r\nif k1 > 6 or k0 > 6:\r\n b = True\r\n\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def find_length(n):\r\n r = 0\r\n while n != 0:\r\n n = n // 10\r\n r += 1\r\n return r\r\n\r\n\r\ndef count_zeros(n):\r\n r = 0\r\n while n != 0:\r\n if n % 10 == 0:\r\n r += 1\r\n else:\r\n break\r\n n = n // 10\r\n return r\r\n\r\n\r\ndef factorial(n):\r\n if n == 1:\r\n return 1\r\n return n * factorial(n - 1)\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b / gcd(a, b)\r\n\r\n\r\ndef remove_all_zero(n):\r\n while (n != 0) & (n % 10 == 0):\r\n n = n / 10\r\n return n\r\n\r\n\r\ndef main():\r\n # n = list(map(int, input().strip().split()))[0]\r\n s = input()\r\n p, r = '', 1\r\n f = False\r\n for x in s:\r\n if x == p:\r\n r += 1\r\n else:\r\n r = 1\r\n if r == 7:\r\n f = True\r\n break\r\n p = x\r\n if f:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = input()\nc1 = 0\nc0 = 0\nfor elem in a:\n if elem == \"0\":\n c0 += 1\n c1 = 0\n if c0 == 7:\n print(\"YES\")\n break\n else:\n c0 = 0\n c1 += 1 \n if c1 == 7:\n print(\"YES\")\n break\nif c1 != 7 and c0 != 7:\n print(\"NO\")\n \t\t \t \t\t\t\t\t\t\t\t \t \t \t\t", "n = input()\r\nfor i in range(len(n)):\r\n c = 0\r\n if n[i] == '1':\r\n while(i<len(n) and n[i]=='1'):\r\n c+=1\r\n i+=1\r\n else:\r\n while(i<len(n) and n[i] == '0'):\r\n c+=1\r\n i+=1\r\n if c>=7:\r\n print(\"YES\")\r\n break\r\nif c<7:\r\n print(\"NO\")", "situation=input()\r\nnumber_1=situation.count('1111111')\r\nnumber_0=situation.count('0000000')\r\nif number_1 !=0 or number_0!=0:\r\n print(\"YES\")\r\nif number_1 == 0 and number_0 == 0:\r\n print('NO')", "n=input()\r\nfor i in range(len(n)):\r\n a=n[i]\r\n t=0\r\n for J in range(i,len(n)):\r\n if n[J]==a:\r\n t+=1\r\n else:\r\n break\r\n if t>=7:\r\n break\r\nif t<7:\r\n print('NO')\r\nif t>=7:\r\n print('YES')\r\n", "plyr=input()\r\n \r\nc=1\r\nfor i in range(len(plyr)-1):\r\n if plyr[i]==plyr[i+1]:\r\n c +=1\r\n if c>=7:\r\n result=\"YES\"\r\n break \r\n else:\r\n c=1\r\n result=\"NO\"\r\nprint(result)", "b=input()\r\nif((('1'*7)in b) or (('0'*7)in b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "arr = list(input())\r\ncount = 1\r\nif len(arr) < 7:\r\n print('NO')\r\n exit()\r\nfor i in range(1, len(arr)):\r\n if arr[i] == arr[i-1]:\r\n count += 1\r\n else:\r\n count = 1\r\n if count == 7:\r\n print('YES')\r\n exit()\r\nprint('NO')", "v=1\r\nb=0\r\nc=0\r\ns=input()\r\nfor i in range(len(s)):\r\n a=s[i]\r\n if a=='0':\r\n b+=1\r\n c=0\r\n if a=='1':\r\n c+=1\r\n b=0\r\n if b>=7 or c>=7:\r\n print('YES')\r\n v=0\r\n break\r\nif v==1:\r\n print('NO')\r\n", "userInput = input()\r\nstreak = 0\r\ncurrentNumberStreak = 0\r\nfor i in range(len(userInput)):\r\n\r\n currentNumber = userInput[i]\r\n if currentNumberStreak != currentNumber:\r\n currentNumberStreak = currentNumber\r\n streak = 0\r\n streak += 1\r\n if streak == 7:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\nquit()\r\n#https://codeforces.com/problemset/problem/96/A", "situation = input() \n\ndangerous = \"YES\" if '0000000' in situation or '1111111' in situation else \"NO\"\n\nprint(dangerous)\n \t \t\t\t\t\t\t \t \t\t\t\t \t \t \t", "string = input()\r\ndanger = False\r\nstr1 = \"1111111\"\r\nstr2 = \"0000000\"\r\nif(str1 in string or str2 in string):\r\n danger = True\r\nif danger:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_dangers():\r\n text = input()\r\n total = 1\r\n for i in range(len(text)-1):\r\n if text[i] == text[i + 1]:\r\n total += 1\r\n if total == 7:\r\n print('YES')\r\n break\r\n else:\r\n total = 1\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n is_dangers()\r\n", "players = input()\r\nnear0 = 0\r\nnear1 = 0\r\nfor p in players:\r\n if p == '1':\r\n near1 += 1\r\n near0 = 0\r\n elif p == '0':\r\n near0 += 1\r\n near1 = 0\r\n if near1 >=7 or near0 >= 7:\r\n break\r\nif near0 >= 7 or near1 >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "f=input();print([\"NO\",\"YES\"][7*\"1\"in f or 7*\"0\"in f])", "s = input()\r\nc = 0\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1] :\r\n c +=1\r\n if c == 6:\r\n print(\"YES\")\r\n break\r\n else:\r\n c = 0 \r\nelse:\r\n print(\"NO\")\r\n", "inp = [int(i) for i in input()]\r\n\r\ncount = 0\r\nfor i in range(len(inp) - 1):\r\n if inp[i] == inp[i + 1]:\r\n count += 1\r\n if count >= 6:\r\n break\r\n else:\r\n count = 0\r\n\r\nprint('YES') if count >= 6 else print('NO')\r\n", "import sys\r\na = list(input())\r\nlast = a[0]\r\ns = 1\r\nfor i in a:\r\n if i == last:\r\n s += 1\r\n else:\r\n last = i\r\n s = 1\r\n if s == 7:\r\n print('YES')\r\n sys.exit(0)\r\nprint ('NO')\r\n", "s=input()\r\ns_1='0'*7\r\ns_2='1'*7\r\nif s_1 in s or s_2 in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 11 19:54:39 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nteam = list(input())\r\nnum = 0\r\nfor i in range(1,len(team)) :\r\n if team[i-1] == team[i] :\r\n num += 1\r\n if num == 6 :\r\n print('YES')\r\n break\r\n else:\r\n num = 0\r\nif num != 6 :\r\n print('NO')", "a=input()\r\ns=1\r\nfor i in range(1,len(a)):\r\n if a[i-1]==a[i]:\r\n s=s+1\r\n if s==7:\r\n d='YES'\r\n break\r\n else:\r\n s=1\r\n d='NO'\r\nprint(d)\r\n\r\n ", "m=\"0000000\"\r\nn=\"1111111\"\r\no=input()\r\nif m in o or n in o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s1 = input()\r\ncondition = 1\r\nfor i in range(1, len(s1)):\r\n if s1[i] == s1[i-1]:\r\n condition += 1\r\n if condition == 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n condition = 1\r\nelse:\r\n print(\"NO\")\r\n", "\r\ns = input() # no empty string\r\nprint('YES') if ('0' * 7 in s or '1' * 7 in s) else print('NO')", "import sys\r\ns=input()\r\nn=len(s)\r\ncout=1\r\nfor i in range(n-1):\r\n if s[i]==s[i+1]:\r\n cout+=1\r\n else :\r\n cout=1\r\n if cout>=7:\r\n print(\"YES\")\r\n sys.exit()\r\n\r\nprint(\"NO\")\r\n", "zero =0\r\none =0\r\nplay = True\r\nfor i in str(input()):\r\n if i == \"1\":\r\n one+=1\r\n zero = 0\r\n else:\r\n one = 0\r\n zero += 1\r\n if (zero == 7) or (one == 7):\r\n play = False\r\n break\r\nif play:\r\n print(\"NO\")\r\nelse: print(\"YES\")", "position = input()\r\nhead = position[0]\r\ncount = 1\r\nflag = False\r\nfor i in range(1, len(position)):\r\n if position[i]==head:\r\n count += 1\r\n else:\r\n count = 1\r\n head = position[i]\r\n if count>=7:\r\n flag = True \r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "position = input()\r\ncount = 0\r\nfor i in range(len(position)):\r\n if i != len(position)-1:\r\n if position[i] == position[i+1]:\r\n count += 1\r\n if count == 6:\r\n break\r\n else:\r\n count = 0\r\n \r\nprint('YES') if count == 6 else print('NO')\r\n\r\n", "string = input(\"\")\r\ncount=0\r\nflg=1\r\nfor i in range(0,len(string)-1):\r\n if string[i]==string[i+1]:\r\n count+=1\r\n if count==6:\r\n print(\"YES\")\r\n flg=0\r\n break\r\n else:\r\n count=0\r\n \r\n \r\n \r\nif flg==1:\r\n print(\"NO\")", "s = input()\r\nch = s[0]\r\ns = s+\" \"\r\nmx = 0\r\ncr = 0\r\ni=0\r\nwhile i<len(s):\r\n if mx>6 or cr>6:\r\n mx=cr\r\n break\r\n if cr>mx:\r\n mx=cr\r\n if s[i]==ch:\r\n cr+=1\r\n else:\r\n cr=1\r\n ch=s[i]\r\n i+=1\r\n\r\nif mx>6:\r\n print('YES')\r\nelse:\r\n print('NO')", "i = input()\r\nc = 0\r\nl = None\r\nflag = False\r\n\r\nif len(i) < 7:\r\n flag = True\r\n print('NO')\r\nelse:\r\n for ch in i:\r\n if l == None:\r\n c += 1\r\n l = ch\r\n else:\r\n if l == ch:\r\n c += 1\r\n\r\n if c == 7:\r\n print('YES')\r\n flag = True\r\n break\r\n else:\r\n l = ch\r\n c = 1\r\n\r\nif not flag:\r\n print('NO')\r\n", "str = input()\r\nprint('YES' if '1111111' in str or '0000000' in str else 'NO')\r\n", "players = input()\r\ncnt = 1\r\nmx = -10 ** 10\r\n\r\nfor i in range(1, len(players)):\r\n if players[i] == players[i - 1]:\r\n cnt += 1\r\n else:\r\n cnt = 1\r\n mx = max(cnt, mx)\r\n\r\n\r\nprint('YES' if mx >= 7 else 'NO')\r\n", "s=input()\r\ndef checkup(str):\r\n if \"0000000\" in str:\r\n return \"YES\"\r\n elif \"1111111\" in str:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nprint(checkup(s))\r\n", "s = input()\r\ns1 = \"0000000\"\r\ns2 = \"1111111\"\r\n\r\nif s1 in s or s2 in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_dangerous(situation):\r\n count = 1\r\n prev = situation[0]\r\n \r\n for char in situation[1:]:\r\n if char == prev:\r\n count += 1\r\n if count >= 7:\r\n return \"YES\"\r\n else:\r\n count = 1\r\n prev = char\r\n \r\n return \"NO\"\r\n\r\n# Read the current situation as a string\r\nsituation = input()\r\n\r\n# Check if the situation is dangerous\r\nresult = is_dangerous(situation)\r\nprint(result)\r\n", "c = 0\r\nsum0 = 0\r\nsum1 = 0\r\nnumbers = input()\r\nnumber_list = []\r\nfor num in numbers:\r\n number_list.append(int(num))\r\nl = len(number_list)\r\n\r\nwhile c < l:\r\n if number_list[c] == 1:\r\n sum1 += 1\r\n sum0 = 0 \r\n else:\r\n sum0 += 1\r\n sum1 = 0 \r\n\r\n if sum1 >= 7 or sum0 >= 7:\r\n break \r\n c += 1\r\n\r\nif sum1 >= 7 or sum0 >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ftb = input()\r\nct = 0\r\np = \"0\";\r\nfor i in range(len(ftb)):\r\n \r\n if (ftb[i] == p):\r\n ct += 1;\r\n else:\r\n ct = 1;\r\n p = ftb[i];\r\n \r\n if (ct == 7):\r\n print(\"YES\")\r\n exit();\r\n\r\nprint(\"NO\");\r\n", "str1 = str(input())\r\nflag = 0\r\nfor i in range (0, len(str1) - 6):\r\n if str1[i : i + 7] == '1' * 7 or str1[i : i + 7] == '0' * 7:\r\n flag = 1\r\nif flag == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "numbers = input()\r\n\r\npos = numbers.find(\"0000000\")\r\npos1 = numbers.find(\"1111111\")\r\n\r\nif pos + 1 or pos1 + 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\ncounter=0\r\nfor i in range(0,len(n)-1):\r\n if n[i]==n[i+1]:\r\n counter+=1\r\n else:\r\n counter=0\r\n if counter>=6:\r\n break\r\n\r\nif counter>=6:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n \r\n", "T=input();\r\nprint([\"NO\",\"YES\"][7*\"1\"in T or 7*\"0\"in T])\r\n", "position = input()\r\nif \"1\"*7 in position or \"0\"*7 in position:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "position = input()\r\n\r\nif ('1111111' in position) or ('0000000' in position):\r\n print('YES')\r\nelse: \r\n print('NO')", "#Amir_Python\r\ns=input()\r\nsum1=0\r\nsum2=0\r\nz=0\r\nfor x in s:\r\n if x==\"0\":\r\n sum2=0\r\n sum1=sum1+1\r\n else:\r\n sum1=0\r\n sum2=sum2+1\r\n if sum1==7 or sum2==7:\r\n z=1\r\n print(\"YES\")\r\n break\r\nif z==0:\r\n print(\"NO\") ", "str1=input()\r\na=1\r\nb=1\r\nfor i in range(len(str1)-1):\r\n if str1[i]==str1[i+1]:\r\n a+=1\r\n if str1[i]!=str1[i+1]:\r\n a=1\r\n if a==7:\r\n b=0\r\nif b==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Oct 4 10:12:01 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\ns=input()\nif '0'*7 in s or '1'*7 in s:\n print('YES')\nelse:\n print('NO')", "a = input()\r\nb = \"\"\r\nc = 1\r\nfor i in a:\r\n if i == b:\r\n c += 1\r\n if c == 7:\r\n break\r\n else:\r\n b = i\r\n c = 1\r\n #print(i, c)\r\nif c < 7:\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "st = input()\r\nif \"0000000\" in st or \"1111111\" in st:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "lineup = input()\r\n\r\nif (\"0000000\" in lineup) or (\"1111111\" in lineup):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nif \"1111111\" in a:\r\n\tprint(\"YES\")\r\nelif \"0000000\" in a:\r\n\tprint(\"YES\")\t\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nstr1 = \"1111111\"\r\nstr2 = \"0000000\"\r\nif (str1 in s) or (str2 in s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve():\n s = input()\n temp = s[0]\n cnt = 1\n\n for i in range(1, len(s)):\n if s[i] != temp:\n temp = s[i]\n cnt = 1\n\n else:\n cnt += 1\n if cnt == 7:\n return print(\"YES\")\n\n print(\"NO\")\n\nsolve()\n\t\t\t \t \t \t\t\t \t\t\t\t\t \t\t\t\t\t\t\t", "seq = input()\ncurrent_team = ''\nn = 0\n\nfor i in seq:\n if n >= 7:\n break\n if i != current_team:\n current_team = i\n n = 1\n continue\n n += 1\n\nif n >= 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\nk1=0\r\nk0=0\r\nmx1=0\r\nmx0=0\r\nfor i in s:\r\n if i == '1':\r\n k1+=1\r\n mx1=max(mx1,k1)\r\n else:\r\n mx1=max(mx1,k1)\r\n k1=0\r\n\r\nfor i in s:\r\n if i == '0':\r\n k0+=1\r\n mx0=max(mx0,k0)\r\n else:\r\n mx0=max(mx0,k0)\r\n k0=0\r\n\r\nif mx0 >= 7 or mx1>=7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = input()\r\nstart =\"\"\r\n\r\nif start == \"\" and x[0] == \"1\":\r\n start = \"1\"\r\n\r\nelif start == \"\" and x[0] == \"0\":\r\n start = \"0\"\r\n\r\n\r\n\r\npocet =0\r\nprind =\"NO\"\r\nfor i in range(int(len(x))):\r\n\r\n if start == \"1\":\r\n if x[i] == \"1\":\r\n pocet = pocet +1\r\n\r\n if pocet > 6 :\r\n prind=\"YES\"\r\n\r\n elif start == \"0\":\r\n if x[i] == \"0\":\r\n pocet = pocet +1\r\n\r\n if pocet > 6:\r\n prind = \"YES\"\r\n\r\n if start == \"1\" and x[i] == \"0\":\r\n start = \"0\"\r\n pocet = 1\r\n elif start == \"0\" and x[i] == \"1\":\r\n start = \"1\"\r\n pocet = 1\r\n\r\n\r\n\r\nprint(prind)", "s=input()\r\nn=0\r\nfor i in range(len(s)-6):\r\n if s[i:i+7]=='1111111' or s[i:i+7]=='0000000':\r\n n+=1\r\nif n==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "s = input()\r\n \r\nj = 1\r\nn = 0\r\nfor i in range(len(s)-1):\r\n if s[i+1] == s[i]:\r\n j += 1\r\n elif s[i+1] != s[i]:\r\n j = 1\r\n if j > n:\r\n n = j\r\n \r\nprint(\"YES\" if n >= 7 else \"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\na = input()\r\nif '1111111' in a or '0000000' in a :\r\n print('YES')\r\nelse:\r\n print('NO')", "a = list(input())\nf = 1\nfor i in range(len(a)-1):\n x = a[i]\n if a[i+1]==a[i]:\n f+=1\n else:\n f=1\n if f == 7:\n print(\"YES\")\n quit()\nprint(\"NO\")\n ", "# your code goes here\nimport sys \n\ninp = sys.stdin\nout = sys.stdout \n\ncurrent = inp.readline().strip()\nt1 = '0000000'\nt2 = '1111111'\n\t\nif((t1 in current) or (t2 in current)):\n\tout.write('YES')\nelse: \n\tout.write('NO')\n\t \t \t \t\t\t \t \t\t\t\t\t\t \t\t \t\t", "\r\nplayers = input()\r\n\r\n\r\nzero = 0\r\none = 1\r\nlast = int(players[0])\r\n\r\nfor i in players:\r\n if i == \"0\":\r\n if last == 0:\r\n zero +=1\r\n if zero >6:\r\n print(\"YES\")\r\n last = -1\r\n break\r\n else:\r\n zero = 1\r\n \r\n if i == \"1\":\r\n if last == 1:\r\n one +=1\r\n if one >6:\r\n print(\"YES\")\r\n last = -1\r\n break\r\n else:\r\n one = 1\r\n \r\n last = int(i)\r\nif last != -1:\r\n print(\"NO\")", "players=input()\r\nresult='NO'\r\nn=len(players)\r\nk=0\r\na=1\r\nfor i in range(n-1):\r\n if players[i+1]==players[i]:\r\n k=k+1\r\n else:\r\n k=0\r\n if k>=6:\r\n result=\"YES\"\r\nprint(result)\r\n\r\n\r\n \r\n", "a=input()\r\nc=0\r\nd=0\r\nfor i in range(len(a)):\r\n if a[i]==\"1\":\r\n c=c+1 \r\n if(c==7):\r\n break\r\n else:\r\n c=0\r\n \r\n if a[i]==\"0\":\r\n d=d+1\r\n if(d==7):\r\n break\r\n else:\r\n d=0\r\nif c==7 or d==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\na=0\r\nfor i in range(len(n)):\r\n\tif len(n)==i+1:\r\n\t pass\r\n\telse:\r\n\t\tif int(n[i])==int(n[i+1]):\r\n\t\t\ta+=1\r\n\t\t\tif a==6:\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\ta=0\r\nif a==6:\r\n\t\tprint('YES')\r\nelse:\r\n\t\tprint('NO')\r\n\t\t\r\n\t\r\n\t", "y = \"0000000\"\r\nz = \"1111111\"\r\nk = input()\r\nif y in k or z in k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=\"0000000\"\r\nb=\"1111111\"\r\nc=input()\r\nif a in c or b in c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nprint('YES' if '0000000' in a or '1111111' in a else 'NO')", "# DO NOT EDIT THIS\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque, defaultdict\r\nimport heapq\r\ndef counter(a):\r\n c = defaultdict(lambda : 0) # way faster than Counter\r\n for el in a:\r\n c[el] += 1\r\n return c\r\n\r\ndef inp(): return [int(k) for k in input().split()]\r\n\r\n# DO NOT EDIT ABOVE THIS\r\nflag = False\r\ns = input()\r\nprev, streak = s[0], 1\r\n\r\nfor i in range(1, len(s)):\r\n v = s[i]\r\n if v == prev:\r\n streak += 1\r\n else:\r\n streak = 1\r\n prev = v\r\n\r\n if streak >= 7:\r\n flag = True\r\n break\r\n\r\nprint('YES' if flag else 'NO')\r\n\r\n", "s = input()\r\nif s.find(\"1\" * 7) != -1 or s.find(\"0\" * 7) != -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Input\r\nfield = input()\r\n\r\n# Check if there's a sequence of at least 7 consecutive \"0\" or \"1\" characters\r\ndangerous = False\r\ncount = 1 # Initialize the count for the current character\r\nprev_char = field[0] # Initialize the previous character\r\n\r\nfor char in field[1:]:\r\n if char == prev_char:\r\n count += 1\r\n if count >= 7:\r\n dangerous = True\r\n break\r\n else:\r\n count = 1 # Reset the count for the new character\r\n prev_char = char\r\n\r\n# Output the result\r\nif dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\nif \"1111111\" in a or \"0000000\" in a: print(\"YES\")\nelse: print(\"NO\")", "t = input()\r\nfor i in range(len(t)):\r\n if t[i:i+7] == \"0000000\" or t[i:i+7] == \"1111111\":\r\n print(\"YES\")\r\n exit()\r\n else:\r\n continue\r\nprint(\"NO\")", "a=input()\r\ni=0\r\nt=len(a)\r\nwhile(i<t):\r\n count=0\r\n k=i\r\n while(k<t):\r\n if(a[i]==a[k]):\r\n count=count+1\r\n k=k+1\r\n else:\r\n break \r\n if(count>=7):\r\n print(\"YES\")\r\n break\r\n i=k\r\nif(i==t):\r\n print(\"NO\")\r\n \r\n \r\n ", "a = input()\r\ne = 0\r\nn = 0\r\nif 7 * '0' in a or 7 * '1' in a:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\n\r\ncontiguous = 1\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i - 1]:\r\n contiguous += 1\r\n if contiguous == 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n contiguous = 1\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\nstr = input()\r\nsearch = re.search(r'0000000|1111111',str)\r\nif search:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nc=1\r\nfor i in range(len(n)-1):\r\n if c<7:\r\n if n[i]==n[i+1]:\r\n c+=1\r\n else:\r\n c=1\r\n else:\r\n break\r\nif c>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\no,z,flag=0,0,0\r\nfor i in range(0,len(s)):\r\n if s[i]=='1':\r\n o=o+1\r\n z=0\r\n else:\r\n z=z+1\r\n o=0\r\n if o==7 or z==7:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "f=input()\r\nif '1'*7 in f or '0'*7 in f:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\ni = 1\r\notw =[]\r\n\r\nfor index in range(len(a)-1):\r\n if a[index] == a[index+1]:\r\n i += 1\r\n if i == 7:\r\n otw.append('YES')\r\n break\r\n if a[index] != a[index+1]:\r\n i = 1\r\nif len(otw) == 0:\r\n print('NO')\r\nelse:\r\n print(otw[0])", "ch=input()\r\np=0\r\ni=-1\r\nn=0\r\nwhile ((p<7) and (i<(len(ch)-1)) and (n<7)):\r\n i+=1\r\n if ch[i]=='1':\r\n p+=1\r\n n=0\r\n else:\r\n p=0\r\n n+=1\r\nif (p==7) or (n==7):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "team = input()\r\ndanger = False\r\nfor i in range(len(team)-6):\r\n if team[i:i+7] == \"1111111\" or team[i:i+7] == \"0000000\":\r\n danger = True\r\n break\r\nif danger:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input().strip() # read the input string and remove any newline characters\r\ncount = 1 # initialize the count of consecutive 0s or 1s to 1\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n count += 1 # increment the count\r\n if count >= 7:\r\n print(\"YES\")\r\n break # break out of the loop if a dangerous situation is found\r\n else:\r\n count = 1 # reset the count if the characters are different\r\nelse:\r\n print(\"NO\") # if we reach here, the situation is not dangerous", "positions=list(input())\r\nstart=0\r\nwhile(start+6<=len(positions)-1):\r\n for i in range(start+1,start+7):\r\n if(positions[i]!=positions[start]):\r\n start=i\r\n break\r\n else:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "\r\n\r\ndef f():\r\n s = input()\r\n c = s[0]\r\n cn = 0\r\n for i in range(1,len(s)):\r\n if s[i] == c:\r\n cn = cn + 1\r\n if cn == 6:\r\n print(\"YES\")\r\n return\r\n else:\r\n c = s[i]\r\n cn = 0\r\n print(\"NO\")\r\n\r\nf()", "s = input()\r\nprint([\"NO\",\"YES\"]['0'*7 in s or '1'*7 in s])", "# s = input()\r\n# count_0=0\r\n# count_1= 0\r\n\r\n# for i in range(len(s)):\r\n# if s[i] == '1':\r\n# count_1 += 1\r\n# elif s[i]=='0':\r\n# count_0+=1\r\n\r\n# if count_1 >= 7 or count_0>=7:\r\n# print('YES')\r\n# break\r\n# else:\r\n# print('NO')\r\n\r\ns = input()\r\n\r\nif '0000000' in s or '1111111' in s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l = input()\r\nresult1 = 0\r\nresult2 = 0\r\nfor i in l:\r\n if i == \"1\":\r\n result2 = 0\r\n result1 += 1\r\n if i == \"0\":\r\n result1 = 0\r\n result2 += 1\r\n if result1 >= 7 or result2 >= 7:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n \r\n ", "def maxnumbers(n):\n count=0\n zcount=0\n result=0\n zresult=0\n for i in n:\n if i=='0':\n count=0\n else:\n count+=1\n result=max(result,count)\n for i in n:\n if i=='1':\n zcount=0\n else:\n zcount+=1\n zresult=max(zresult,zcount)\n final=max(zresult,result)\n if final>=7:print('YES')\n else:print('NO')\n\nn=input()\nmaxnumbers(n)\n\t\t\t \t \t \t\t \t\t\t \t\t\t \t\t \t\t \t", "def solve():\r\n s = input()\r\n if '1111111' in s or '0000000' in s:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(solve())\r\n", "def isdangerous(n):\r\n ile = 0\r\n for i in range(len(n)):\r\n if n[i] == n[i-1]:\r\n ile = ile+1\r\n if ile>6:\r\n return 'YES'\r\n else:\r\n ile = 1\r\n return 'NO'\r\nteam = input()\r\nprint(isdangerous(team))", "s = input()\r\ncount = 0\r\nstop = 0\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n count+=1\r\n if count >= 6:\r\n stop = 1\r\n else: \r\n count = 0\r\n\r\n\r\nif stop == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\r\na='0'\r\nb='1'\r\nif a*7 in s or b*7 in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "def loop_test_cases():\r\n return range(int(input()))\r\n\r\ndef list_input():\r\n return [int(i) for i in input().split()]\r\n\r\ndef list_input_str():\r\n return [i for i in input()]\r\n\r\ndef list_input_int():\r\n return [int(i) for i in input()]\r\n\r\n\r\nrow = list_input_int()\r\ncount = 0\r\nsign = 2\r\nfor i in row:\r\n if i == sign:\r\n count += 1\r\n else:\r\n sign = i\r\n count = 1\r\n\r\n if count == 7:\r\n break\r\n\r\nprint(\"YES\" if count == 7 else \"NO\")", "n = str(input())\r\ndef find(n):\r\n number = n\r\n counter = 0\r\n zeroFound = False\r\n onesFound = False\r\n for i in number:\r\n if i == \"0\":\r\n zeroFound = True\r\n if counter < 7:\r\n if onesFound:\r\n counter = 0\r\n onesFound = False\r\n counter = counter + 1\r\n if i == \"1\":\r\n onesFound = True\r\n if counter < 7:\r\n if zeroFound:\r\n counter = 0\r\n zeroFound = False\r\n counter = counter + 1\r\n if counter >= 7:\r\n return 'YES'\r\n return 'NO'\r\n\r\nresult = find(n)\r\nprint(result)", "strs=input()\r\ns=strs[0]\r\ncount=1\r\nmax_count=0\r\nfor i in range(1,len(strs)):\r\n if strs[i]==s:\r\n count+=1\r\n elif strs[i]!=s:\r\n s=strs[i]\r\n max_count=max(max_count,count)\r\n count=1\r\nmax_count=max(max_count,count)\r\nif max_count>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t = input()\r\nif'0000000' in t or '1111111' in t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nprint(\"YES\" if \"1111111\" in s or \"0000000\" in s else \"NO\")", "s = input()\r\nl = len(s)\r\nk = 1\r\ndanger = False\r\nfor i in range(1, l):\r\n if s[i] == s[i - 1]:\r\n k += 1\r\n else:\r\n k = 1\r\n if k == 7:\r\n danger = True\r\nif danger:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=str(input())\r\nm= \"1111111\"\r\nn= \"0000000\"\r\nif m in x or n in x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()\r\ncoun = 0\r\nfor indx, valu in enumerate(string):\r\n\r\n if indx+1 == len(string):\r\n print(\"NO\")\r\n break\r\n\r\n if string[indx] == string[indx+1]:\r\n if indx == 0:\r\n coun += 2\r\n else:\r\n coun += 1\r\n if coun == 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n coun = 1\r\n", "ui = list(map(int, input().strip()))\r\nres = 0\r\nif len(ui) >= 7 and (ui.count(1) >= 7 or ui.count(0) >= 7):\r\n for i in range(len(ui) - 1):\r\n if ui[i] == ui[i + 1]:\r\n res += 1\r\n elif res <= 5:\r\n res = 0\r\nif res >= 6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "line=str(input())\r\nstack=0\r\nprev=3\r\n\r\nfor i in line:\r\n if stack>=6:\r\n break\r\n if int(i)==prev:\r\n stack+=1\r\n else:\r\n stack=0\r\n prev=int(i)\r\n\r\nprint(['YES','NO'][stack<6])", "import re \r\ns = input ()\r\nif re.search (r\"0{7,}\", s) is None and re.search (r\"1{7,}\", s) is None : \r\n print (\"NO\")\r\nelse : print (\"YES\")", "s = input()\r\ncur = \"\"\r\ncount = 0\r\nfor i in s:\r\n if not cur:\r\n cur = i\r\n count=1\r\n elif i==cur:\r\n count+=1\r\n if count>=7:\r\n print('YES')\r\n break\r\n else:\r\n count=1\r\n cur=i\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nd = 1\r\nfor i in range(len(s)-1):\r\n if d>=7:\r\n break;\r\n else:\r\n if s[i] == s[i+1]:\r\n d += 1\r\n else:\r\n d = 1\r\n\r\nif d>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = list(input())\r\ntest=0\r\nfor i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n test+=1\r\n if test==6:\r\n break\r\n else:\r\n test=0\r\nif test==6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ns0=len((sorted(s.split(\"1\")))[-1])\r\ns1=len((sorted(s.split(\"0\")))[-1])\r\nif s0>=7 or s1>=7: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "def func(s):\r\n i=0\r\n ct=0\r\n while i<len(s)-1:\r\n while i<len(s)-1 and s[i]==s[i+1]:\r\n ct+=1\r\n i+=1\r\n if ct+1>=7:\r\n return 'YES'\r\n else:\r\n ct=0\r\n i+=1\r\n return 'NO'\r\n\r\ns=input()\r\n\r\nprint(func(s))\r\n", "a = input()\r\nq = a.count(\"1111111\")\r\nw = a.count(\"0000000\")\r\nc = 0\r\nif q > 0 or w > 0 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "players = input()\r\nif \"1\" * 7 in players or \"0\" * 7 in players:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\n\nx = 0\ndangerous = False\nwhile x < len(s):\n t = x\n while x < len(s) and s[x] == s[t]:\n x += 1\n\n if x - t >= 7:\n dangerous = True\n\nif dangerous:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "s = input()\nif len(s) < 7:\n print(\"NO\")\nelse:\n f = 0\n p = s[0]\n for c in s:\n if c == p:\n f += 1\n else:\n f = 1\n p = c\n if f == 7:\n break\n if f == 7:\n print(\"YES\")\n else:\n print(\"NO\") ", "s = input() # Input: The string representing player positions\r\n \r\n# Initialize variables to keep track of consecutive players of the same team\r\ncount = 1\r\ndangerous = False\r\n \r\n# Iterate through the string starting from the second player (index 1)\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i - 1]:\r\n count += 1\r\n if count >= 7:\r\n dangerous = True\r\n break\r\n else:\r\n count = 1 # Reset the count for consecutive players of the same team\r\n \r\nif dangerous:\r\n print(\"YES\") # Output: The situation is dangerous\r\nelse:\r\n print(\"NO\") ", "number = (input())\r\nif \"1111111\" in number or \"0000000\" in number:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def a(l):\r\n c=0\r\n for i in range(len(n)):\r\n if(l[i]==l[i-1]):\r\n c+=1\r\n else:\r\n c=1\r\n if(c>=7):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nn=input()\r\nl=list(n) \r\n \r\nprint(a(l))\r\n ", "n = input()\r\nc = [1]\r\nj =0\r\n\r\nfor i in range(len(n)):\r\n if n[i] == '0'and n[i-1] == '0':\r\n c[j] = c[j]+1\r\n \r\n elif n[i] == '1'and n[i-1] == '1':\r\n c[j] = c[j]+1\r\n \r\n else:\r\n j = j+1\r\n c.append(1)\r\n\r\nm = max(c)\r\nif m >=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "s = input()\r\nans = [1]\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n ans.append(ans[i-1]+1)\r\n else:\r\n ans.append(1)\r\nprint('YES' if max(ans) >= 7 else 'NO')\r\n", "def solve(x):\r\n\r\n c = 1\r\n last = x[0]\r\n\r\n for i in x[1:]:\r\n if i == last:\r\n c+=1\r\n else:\r\n c=1\r\n last = i\r\n\r\n if c >= 7:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n \r\nx = input()\r\nprint(solve(x))", "s = input()\r\nc = 1\r\nm = 0\r\nfor i in range(len(s)):\r\n if s[i] == s[i-1]:\r\n c +=1\r\n else:\r\n m = max(m, c)\r\n c = 1\r\nif max(m,c) >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "pos = input()\r\ncount = 1\r\n\r\nfor i in range(1, len(pos)):\r\n if pos[i-1] == pos[i]:\r\n count += 1\r\n else:\r\n count = 1\r\n if count >= 7:\r\n break\r\n\r\nif count >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nstring = input()\r\nprec = \"\"\r\ncurr_count = 1\r\nfor i in string:\r\n if i == prec:\r\n curr_count += 1\r\n else:\r\n curr_count = 1\r\n prec = i\r\n if curr_count >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def isdangerous(s):\r\n\tpre=s[0]\r\n\tcnt=1\r\n\tfor i in s[1:]:\r\n\t\tif i==pre:\r\n\t\t\tcnt+=1\r\n\t\t\tif cnt>=7:\r\n\t\t\t\treturn \"YES\"\r\n\t\telse:\r\n\t\t\tcnt=1\r\n\t\t\tpre=i\r\n\treturn \"NO\"\r\n \r\ns=input().strip()\r\nres=isdangerous(s)\r\nprint(res)", "string = input()\nprint('YES') if (('0000000' in string) or ('1111111' in string)) else print('NO')\n", "n = input()\r\n\r\ndanger = \"NO\"\r\n\r\ncount = 1\r\nactual = \"\"\r\nfor k in n:\r\n if actual == k:\r\n count += 1\r\n else:\r\n count = 1\r\n actual = k \r\n if count == 7:\r\n danger = \"YES\"\r\n break\r\n\r\nprint(danger)\r\n", "s = input()\r\na = s[0]\r\nc = 1\r\nfor i in s[1:]:\r\n if i == a:\r\n c += 1\r\n else:\r\n a = i\r\n c = 1\r\n if c == 7:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "s=input()\r\nlis=list(s);\r\nb=len(lis)\r\ncount=0\r\npointer=lis[0]\r\nfor i in range(0,b):\r\n #print(count,i,lis[i])\r\n if count==7:\r\n break\r\n if lis[i]==pointer:\r\n count+=1\r\n else:\r\n pointer=lis[i]\r\n count=1\r\n\r\n\r\nif count>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def f(x):\r\n for s_s in x:\r\n if len(s_s) >= 7:\r\n return True\r\n return False\r\n \r\ns = input()\r\nf = f(s.split('1')) or f(s.split('0'))\r\n\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "k=str(input())\r\nk=k.replace(\"1111111\",\"*\")\r\nk=k.replace(\"0000000\",\"*\")\r\nif \"*\" in k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ncount_z = 0\r\ncount_o = 0\r\nfor item in range(len(s)):\r\n if s[item] == '0':\r\n count_z += 1\r\n count_o = 0\r\n if count_z == 7:\r\n print('YES')\r\n break\r\n else:\r\n count_o += 1\r\n count_z = 0\r\n if count_o == 7:\r\n print('YES')\r\n break\r\nif count_z != 7 and count_o != 7:\r\n print('NO')\r\n", "def is_dangerous(s):\r\n count = 1\r\n for i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n count += 1\r\n if count >= 7:\r\n return \"YES\"\r\n else:\r\n count = 1\r\n return \"NO\"\r\ns = input().strip()\r\nresult = is_dangerous(s)\r\nprint(result)\r\n", "n=input()\r\ncount1=0\r\ncount2=0\r\nfor i in range(len(n)):\r\n if count1==7 or count2==7:\r\n break\r\n if n[i]==\"1\":\r\n count1+=1\r\n count2=0\r\n elif n[i]==\"0\":\r\n count2+=1\r\n count1=0\r\n\r\nif count1==7 or count2==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin\r\nfrom itertools import cycle\r\ninput = stdin.readline\r\ndef instr():\r\n return input()[:-1]\r\ns = instr()\r\ndanger = 1\r\nc = s[0]\r\nfor i in range(1, len(s)) :\r\n \r\n if s[i] == c :\r\n danger += 1\r\n \r\n else :\r\n c = s[i] \r\n danger = 1\r\n if danger >= 7 : \r\n print(\"YES\")\r\n break\r\nelse :\r\n print(\"NO\")\r\n", "t = input()\r\n\r\nif (\"1111111\" in t) or ('0000000' in t):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n", "sit = str(input())\r\nif \"0000000\" in sit or \"1111111\" in sit:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=0\r\nb=0\r\nfor i in s:\r\n if i==\"0\":\r\n c+=1\r\n if c==7:\r\n break\r\n else:\r\n c=0\r\nfor i in s:\r\n if i==\"1\":\r\n b+=1\r\n if b==7:\r\n break\r\n else:\r\n b=0\r\nif c==7 or b==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "s=input()\r\nn=len(s)\r\nif(len(s)<7):\r\n print('NO')\r\nelif(len(s)==7):\r\n if(s=='1111111' or s=='0000000'):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n flag=0\r\n for i in range(len(s)-7+1):\r\n if(s[i:i+7]=='0000000' or s[i:i+7]=='1111111'):\r\n print('YES')\r\n flag=1\r\n break\r\n if flag==0:\r\n print('NO')\r\n", "n1 = input()\r\na1 = []\r\n\r\nfor i in range(0 , len(n1)):\r\n a1.append(int(n1[i]))\r\nflag1 = 1\r\nflag2 = 0\r\n\r\nfor i in range(0,len(a1) - 1):\r\n if (a1[i] == a1[i+1]):\r\n flag1 +=1\r\n if(flag1 == 7):\r\n print(\"YES\")\r\n exit()\r\n elif(a1[i] != a1[i+1]):\r\n flag1 = 1\r\n\r\nprint(\"NO\") \r\n", "k=input()\ns='NO'\nif '0'*(7) in k or '1'*(7) in k:\n s='YES'\nprint(s)\n", "n = input()\r\na = 1\r\nfor i in range(len(n)-1):\r\n if n[i]==n[i+1]:\r\n a= a+1\r\n if a==7: \r\n break\r\n else:\r\n a=1\r\nif a==7: print('YES')\r\nelse: print('NO')", "ind=input()\r\nif((\"1111111\" in ind) or (\"0000000\" in ind)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nconti=1\r\nletter=s[0]\r\nif(len(s)<=6):\r\n print(\"NO\")\r\nelse:\r\n for j in range(1,len(s)):\r\n if(s[j]!=letter):\r\n letter=s[j]\r\n conti=1\r\n else:\r\n conti+=1\r\n if(conti>=7):\r\n break\r\n if(conti>=7):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def dangerous(situation):\r\n \r\n if '0000000' in situation or '1111111' in situation: \r\n \r\n return\"YES\"\r\n\r\n else:\r\n \r\n return\"NO\"\r\n \r\n\r\nplayers = input()\r\n\r\nresult=dangerous(players)\r\nprint(result)\r\n\r\n\r\n\r\n", "s=input()\r\nt=0\r\nfor i in range(1,len(s)):\r\n if int(s[i])==int(s[i-1]):\r\n t+=1\r\n if t==6:\r\n break\r\n else:\r\n continue\r\n else:\r\n t=0\r\nif t==6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\n\ndef main():\n int_string = list(input())\n #print(int_string)\n check_condition = \"NO\"\n if len(int_string) < 7:\n print(check_condition)\n else:\n for i in range(0,len(int_string)-6):\n #print(\"range of i is gonna be:\" + str(range(0,len(int_string)-5)))\n counter = 0\n #print(\"i is \" + str(i))\n #print(\"number at index i is:\" + str(int_string[i]))\n for j in range(1,7):\n #print(\"range of j is gonna be: \" + str(range(1,7)))\n if int_string[i] == int_string[i+j]:\n #print(\"number at index i+j is:\" + str(int_string[i+j]))\n counter = counter + 1\n #print(\"Counter is now at:\" + str(counter))\n if counter == 6:\n check_condition = \"YES\"\n print(check_condition)\n\n\nmain()\n", "my_list, count = list(input()), 0\r\nz = my_list[0]\r\nfor i in range(1, len(my_list)):\r\n if my_list[i] == z:\r\n count += 1\r\n if (count == 6 and z == my_list[i]):\r\n break\r\n else:\r\n z = my_list[i]\r\n count = 0\r\nif count == 6:\r\n print('YES')\r\nelse:\r\n print('NO')", "text = input()\r\nif \"1111111\" in text:\r\n print(\"YES\")\r\nelif \"0000000\"in text:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "players = [int(i) for i in input()]\r\nj = 0\r\nb = False\r\nwhile j < len(players):\r\n count = 0\r\n if players[j] == 0:\r\n while j < len(players) and players[j] == 0:\r\n count += 1\r\n j += 1\r\n if count >= 7:\r\n b = True\r\n break\r\n else:\r\n while j < len(players) and players[j] == 1:\r\n count += 1\r\n j += 1\r\n if count >= 7:\r\n b = True\r\n break\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ns_list = []\r\ncount_1 = 0\r\ncount_0 = 0\r\nfor x in s:\r\n s_list.append(x)\r\n\r\nfor one in range(1,len(s_list),1):\r\n\r\n if s_list[one] == \"1\" and s_list[one - 1] == \"1\":\r\n count_1 += 1\r\n else:\r\n count_1 = 0\r\n if count_1 == 6:\r\n break\r\n\r\nfor zero in range(1,len(s_list),1):\r\n\r\n if s_list[zero] == \"0\" and s_list[zero - 1] == \"0\":\r\n count_0 += 1\r\n else:\r\n count_0 = 0\r\n if count_0 == 6:\r\n break\r\n\r\nif count_0 == 6 or count_1 == 6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nl1=\"1111111\"\r\nl0=\"0000000\"\r\nflag=0\r\nfor i in range(len(s)):\r\n if s[i:i+7]==l1 or s[i:i+7]==l0:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nif s.count('0000000') > 0 or s.count('1111111') > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "k=input()\r\nif len(k)<7:\r\n print('NO')\r\nelse:\r\n d=7\r\n found=False\r\n for i in range(len(k)):\r\n if len(k[i:d])>=7 and k[i:d]==k[i]*len(k[i:d]):\r\n print('YES')\r\n found=True\r\n break\r\n d+=1\r\n if not found:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \t\r\n", "import sys\ns=input()\nsum=[0]*(len(s)+1)\nfor i in range(1,len(s)+1):\n sum[i]=sum[i-1]+int(s[i-1])\n if i>6 and (sum[i]-sum[i-7]==0 or sum[i]-sum[i-7]==7):\n print(\"YES\")\n sys.exit(0)\nprint(\"NO\")", "s=input()\r\nx='1111111'\r\ny='0000000'\r\nif x in s or y in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nimport re\r\nb=re.search('0{7,}',a)\r\nc=re.search('1{7,}',a)\r\nif b or c:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\nl = input()\r\nif re.search(r\"[1]{7}\", l):\r\n print(\"YES\")\r\nelif re.search(r\"[0]{7}\", l):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_dangerous(stringg):\n consecutive_count = 1\n for i in range(1, len(stringg)):\n if stringg[i] == stringg[i-1]:\n consecutive_count += 1\n else:\n consecutive_count = 1\n\n if consecutive_count >= 7:\n return \"YES\"\n\n return \"NO\"\n\n\ns = input().strip()\n\n\nresult = is_dangerous(s)\n\n\nprint(result)\n \t \t \t \t \t \t \t \t \t\t\t", "n = input()\r\nif n.find('1111111') >= 0 or n.find('0000000') >= 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "alpha=list(input())\r\nn=int(len(alpha))\r\nm=1\r\nx=1\r\ngky=0\r\nwhile m<n:\r\n k=alpha[-1]\r\n s=alpha[-2]\r\n if k==s:\r\n x+=1\r\n else:\r\n x=1\r\n del alpha[-1]\r\n if x==7:\r\n m+=n\r\n gky+=1\r\n m+=1\r\nif gky==1:\r\n print(\"YES\")\r\nif gky==0:\r\n print(\"NO\")\r\n\r\n", "def main():\r\n\r\n print(team())\r\n\r\ndef team():\r\n\r\n i = input()\r\n first = 0\r\n second = 0\r\n k = 7\r\n curr1 = None\r\n curr2 = None\r\n for c in i:\r\n if c == \"0\":\r\n second = 0\r\n if c == curr1:\r\n first += 1\r\n else:\r\n curr1 = c\r\n first = 1\r\n if first == 7:\r\n return \"YES\"\r\n if c == \"1\":\r\n first = 0\r\n if c == curr2:\r\n second +=1\r\n else:\r\n curr2 = c\r\n second = 1\r\n if second == 7:\r\n return \"YES\"\r\n return \"NO\"\r\nif __name__ == \"__main__\":\r\n main()", "a=list(input())\r\nn=len(a)\r\ncount=1\r\nflag=0\r\nfor i in range(n-1):\r\n if a[i+1]==a[i]:\r\n count+=1\r\n else:\r\n count=1\r\n if count>=7:\r\n flag=1\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\nf1=0\nf0=0\nif len(s)<7:\n print('NO')\nelse:\n for i in s:\n if i == '1':\n f1+=1\n f0=0\n elif i=='0':\n f0+=1\n f1=0\n if f1>=7 or f0>=7:\n print('YES')\n break\n\n else:\n print('NO')\n\t\t \t\t\t \t \t\t \t\t\t\t \t\t", "def check_dangerous_situation(situation):\r\n consecutive_count = 1\r\n\r\n for i in range(1, len(situation)):\r\n if situation[i] == situation[i - 1]:\r\n consecutive_count += 1\r\n else:\r\n consecutive_count = 1\r\n\r\n if consecutive_count >= 7:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n\r\ninput_string = input() \r\noutput = check_dangerous_situation(input_string) \r\n\r\nprint(output)\r\n", "num = list(input())\r\nx=0\r\ny=0\r\nboll = 0\r\nfor i in range (0,len(num)):\r\n if num[i]=='1':\r\n x=x+1\r\n y=0\r\n if x>=7:\r\n print('YES')\r\n boll = 1\r\n break\r\n elif num[i]=='0':\r\n y=y+1\r\n x=0\r\n if y>=7:\r\n print('YES')\r\n boll = 1\r\n break\r\nif boll==0:\r\n print('NO')", "s = input()\r\nmot, khong = 0, 0\r\nj = ''\r\nok = True\r\nfor i in s:\r\n if (i == '0'):\r\n khong += 1\r\n mot = 0\r\n if (khong >= 7): ok = False\r\n else:\r\n mot += 1\r\n khong = 0\r\n if (mot >= 7): ok = False\r\n\r\nif (ok): print('NO')\r\nelse: print('YES')\r\n", "a = input()\ncount = 0\nfor i in range(1, len(a)):\n if count >= 6: # 改为 6，因为已经有一个重复元素了\n break\n else:\n if a[i - 1] == a[i]:\n count += 1\n else:\n count = 0\nif count >= 6: # 同样改为 6\n print(\"YES\")\nelse:\n print(\"NO\")\n", "Word=input()\r\nif \"0000000\" in Word or \"1111111\" in Word:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "p = input()\r\nif '1111111' in p or '0000000' in p:\r\n print('YES')\r\nelse:\r\n print('NO')", "def validate_players(players):\r\n last = players[0]\r\n ct = 1\r\n \r\n for i in range(1, len(players)):\r\n ct = ct + 1 if players[i] == last else 1\r\n \r\n if ct == 7:\r\n print('YES')\r\n return\r\n \r\n last = players[i]\r\n \r\n print('NO')\r\n \r\nvalidate_players(input())\r\n", "t=(input())\r\ncount=1\r\ns=0\r\nfor i in range(1,len(t)):\r\n if t[i]==t[i-1]:\r\n count+=1\r\n if count>=7:\r\n s=1\r\n print(\"YES\")\r\n break\r\n else:\r\n count=1\r\nif s==0:\r\n print(\"NO\")\r\n", "u=list(input())\r\nj=0\r\nfor i in range(len(u)-6):\r\n if u[i]==u[i+1] and u[i+2]==u[i+1] and u[i+2]==u[i+3] and u[i+3]==u[i+4] and u[i+4]==u[i+5] and u[i+5]==u[i+6]:\r\n print('YES')\r\n j=1\r\n break\r\nif j==0:\r\n print('NO')", "n = input()\r\ns = len(n)\r\ncount = 1 # Initialize count to 1 as the first character is always a consecutive character\r\nmax_count = 1\r\n\r\nfor i in range(s - 1):\r\n if n[i] == n[i+1]:\r\n count += 1\r\n if count > max_count:\r\n max_count = count\r\n else:\r\n count = 1\r\n\r\nif max_count >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "m=input()\r\nc=0\r\nlst1=[]\r\nfor i in range(len(m)):\r\n if i==len(m)-1:\r\n lst1.append(c+1)\r\n break\r\n elif m[i]==m[i+1]:\r\n c+=1\r\n else:\r\n lst1.append(c+1)\r\n c=0\r\nlst2=list(map(lambda x:x>=7,lst1))\r\nif any(lst2)==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ncont=1\r\ni=0\r\nflag=False\r\nl=len(s)\r\nif l<7:\r\n print(\"NO\")\r\nelse:\r\n while i<l-6:\r\n cont=1\r\n while s[i]==s[i+1]:\r\n cont=cont+1\r\n i=i+1\r\n if i==l-1:\r\n break\r\n if cont>6:\r\n print(\"YES\")\r\n flag=True\r\n break\r\n i=i+1\r\n if not flag:\r\n print(\"NO\")\r\n", "s=input()\r\nfound=0\r\nif len(s)<=6:\r\n\tprint(\"NO\")\r\nelse:\r\n\tfor i in range(len(s)-6):\r\n\t\tif s[i:i+7]==\"1111111\":\r\n\t\t\tfound=1\r\n\t\telif s[i:i+7]==\"0000000\":\r\n\t\t\tfound=1\r\n\tif found==1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n", "string=input()\r\nl=len(string)\r\nc=0\r\np=0\r\nfor i in range(0,l-1):\r\n if(string[i]==string[i+1]):\r\n c=c+1\r\n if (c>=6):\r\n p=1\r\n else:\r\n c=0\r\n \r\nif (p==1):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "new_str = input()\r\ncount_zero = 0\r\ncount_one = 0\r\nans = False\r\nfor i in range(len(new_str)):\r\n if new_str[i] == '1':\r\n count_one += 1\r\n count_zero = 0\r\n if count_one >= 7:\r\n ans = True\r\n if new_str[i] == '0':\r\n count_zero += 1\r\n count_one = 0\r\n if count_zero >= 7:\r\n ans = True\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "player = input()\r\none = 1\r\nzero = 1\r\nfor i in range(len(player)-1):\r\n \r\n if player[i]=='1' and player[i+1]=='1':\r\n one+=1\r\n elif player[i]=='0' and player[i+1]=='0':\r\n zero+=1\r\n else:\r\n one,zero=1,1\r\n \r\n if one==7 or zero==7:\r\n print('YES')\r\n one,zero=7,7\r\n break\r\nif one<7 or zero<7:\r\n print('NO')", "def main():\r\n \r\n l = input().rstrip()\r\n c = 1\r\n for b in range(1,len(l)):\r\n if l[b] == l[b-1]:\r\n c += 1\r\n else:\r\n c = 1\r\n if c == 7:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n \r\nif __name__ == \"__main__\":\r\n main()", "input_string = input()\r\ncurrent_count = 1\r\nmax_count = 1\r\n\r\n\r\nfor i in range(1, len(input_string)):\r\n\r\n if input_string[i] == input_string[i - 1]:\r\n current_count += 1\r\n else:\r\n\r\n current_count = 1\r\n\r\n max_count = max(max_count, current_count)\r\n\r\nif max_count >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nprev=a[0]\r\nl=1\r\nfor i in range (1,len(a)):\r\n if(a[i]==prev):\r\n l+=1\r\n else: l= 1\r\n prev=a[i] \r\n if(l>=7):\r\n break \r\nif(l>=7):\r\n print(\"YES\")\r\nelse: print(\"NO\") ", "a = input()\r\nif len(a)<7:\r\n print(\"NO\")\r\nelse:\r\n b = len(a)\r\n for i in range(0,b-6):\r\n if a[i:i+7] == a[i]*7:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n", "a = input()\r\nb = ''\r\nc = 0\r\nd = False\r\nfor i in range(len(a)):\r\n if a[i] != b:\r\n b = a[i]\r\n c = 0\r\n c += 1\r\n if c == 7:\r\n d = True\r\n break\r\nif d:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = input()\r\ncount = 1\r\n\r\nfor p in range(1, len(a)):\r\n if a[p] == a[p-1]:\r\n count += 1\r\n if count >= 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n count = 1\r\nelse:\r\n print(\"NO\")\r\n\r\n", "players=str(input() .split())\r\ndangerous1=\"1111111\"\r\ndangerous0=\"0000000\"\r\n\r\nif dangerous1 in players or dangerous0 in players:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input() # read the input string\r\n\r\n# check if the string contains 7 consecutive '0's or '1's\r\nif '0000000' in s or '1111111' in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=(input())\nmax0=0\ncount0=0\nfor c in n:\n if c==\"0\":\n count0+=1\n else:\n if count0>max0:\n max0=count0\n count0=0\nif count0>max0:\n max0=count0\nmax1=0\ncount1=0\nfor c in n:\n if c==\"1\":\n count1+=1\n else:\n if count1>max1:\n max1=count1\n count1=0\nif count1>max1:\n max1=count1\nif max0>=7 or max1>=7:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x = list(input())\r\n\r\n\r\none = 1\r\nzero = 1\r\n\r\nfor i in range(len(x)-1):\r\n if x[i] == x[i+1] == '1':\r\n one += 1\r\n if one >= 7:\r\n print('YES')\r\n break\r\n elif x[i] == x[i+1] == '0':\r\n zero += 1\r\n if zero >= 7:\r\n print('YES')\r\n break\r\n elif (x[i] == '1' and x[i+1] == '0') or (x[i] == '0' and x[i+1] == '1'):\r\n one = 1\r\n zero = 1\r\n else:continue\r\n\r\n\r\nif zero < 7 and one < 7:\r\n print('NO')", "s = input()\n\n\ndef isDangerous():\n count = 1\n for i in range(1, len(s)):\n prev = s[i - 1]\n curr = s[i]\n if prev == curr:\n count += 1\n else:\n count = 1\n\n if count == 7:\n print(\"YES\")\n return\n print(\"NO\")\n\n\nisDangerous()\n \t\t \t \t\t\t \t \t \t \t\t\t\t\t \t\t\t", "n = input()\r\nc1 = 0\r\nc0 = 0\r\nfor i in n:\r\n if i == \"1\":\r\n c0 = 0\r\n c1 += 1\r\n else:\r\n c1 = 0\r\n c0 += 1\r\n if c1 >= 7 or c0 >= 7:\r\n print(\"YES\")\r\n break\r\nif c0 < 7 and c1 < 7:\r\n print(\"NO\")\r\n", "new_str_input = input()\ntmp = new_str_input[0]\nif 1 <= len(new_str_input) <= 100:\n if \"0\" in new_str_input and \"1\" in new_str_input:\n for i in range(0, len(new_str_input)-1):\n if i < len(new_str_input):\n if new_str_input[i] == new_str_input[i+1]:\n tmp += new_str_input[i]\n if len(tmp) < 6:\n if new_str_input[i] != new_str_input[i + 1]:\n tmp = \"\"\n if len(tmp) >= 6:\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t \t\t\t \t\t\t\t \t \t\t \t\t\t \t\t", "x = str(input())\r\ny = x.count(\"1\")\r\nz = x.count(\"0\")\r\nif x.__contains__(\"1111111\"):\r\n print(\"YES\")\r\nelif x.__contains__(\"0000000\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\nlast = x[0]\r\ncounter = 0\r\nfor char in x:\r\n if char == last:\r\n counter += 1\r\n if counter >= 7:\r\n break\r\n else:\r\n counter = 1\r\n last = char\r\nif counter >= 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=input()\r\nz=0\r\no=0\r\nflag=0\r\nfor i in p:\r\n if i == \"0\":\r\n z+=1\r\n o=0\r\n if z >= 7 and flag==0:\r\n print(\"YES\")\r\n flag=1\r\n if i == \"1\":\r\n o+=1\r\n z=0\r\n if o >= 7 and flag==0:\r\n print(\"YES\")\r\n flag=1\r\nif flag==0:\r\n print(\"NO\")", "s = input()\r\nfirst = 0\r\nsecond = 0\r\nfor i in s:\r\n if i == '1':\r\n first += 1\r\n second = 0\r\n else:\r\n second += 1\r\n first = 0\r\n\r\n if first == 7 or second == 7:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "\r\ndef main(): \r\n s = input() \r\n count = 1 \r\n lst = list() \r\n s += '#' \r\n for i in range(1, len(s)): \r\n if s[i] == s[i-1]: \r\n count += 1 \r\n else: \r\n lst.append(count) \r\n count = 1 \r\n lst.sort() \r\n if lst[-1] >= 7: \r\n print('YES') \r\n else: \r\n print('NO') \r\n \r\nif __name__ == '__main__': \r\n main() ", "# Read the input string\r\ns = input()\r\n\r\n# Initialize a counter for consecutive players\r\nconsecutive_count = 1 # Start with the first player\r\n\r\n# Initialize a variable to keep track of the previous player's team\r\nprev_player = s[0]\r\n\r\n# Iterate through the string starting from the second player\r\nfor i in range(1, len(s)):\r\n if s[i] == prev_player:\r\n consecutive_count += 1\r\n if consecutive_count == 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n consecutive_count = 1\r\n prev_player = s[i]\r\n\r\n# If the loop completes without finding a dangerous situation, print \"NO\"\r\nif consecutive_count < 7:\r\n print(\"NO\")\r\n\r\n", "k = input()\r\nt=0\r\nfor i in range(len(k)-1):\r\n if(k[i]==k[i+1]):\r\n t=t+1\r\n else:\r\n t=0\r\n if(t==6):\r\n break\r\nif(t==6):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "players = input()\r\nlength = len(players)\r\nprevious = players[0]\r\ncount = 1\r\nflag = False\r\nfor i in range(1, length):\r\n if players[i] == previous:\r\n count += 1\r\n else:\r\n previous = players[i]\r\n count = 1\r\n if count == 7:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# 化院 荆屹然 2300011884\r\n", "c=input()\r\nl=\"0000000\"\r\nm=\"1111111\"\r\n\r\n\r\nif (l in c) or ( m in c) :\r\n print(\"YES\") \r\n \r\nelse:\r\n print(\"NO\")", "n=input()\r\nl=[]\r\nfor i in n:\r\n l.append(i)\r\nc=0\r\nfor j in l:\r\n if j=='1':\r\n c=c+1\r\n else:\r\n if c<7:\r\n c=0\r\nfor j in l:\r\n if j=='0':\r\n c=c+1\r\n else:\r\n if c<7:\r\n c=0\r\nif c>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\n\r\nif n.__contains__('0000000') or n.__contains__('1111111'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\ndangerous = False\r\ncount =1\r\nfor i in range(1,len(s)):\r\n if s[i] == s[i-1]:\r\n count+=1\r\n else:\r\n count = 1\r\n if count>=7:\r\n dangerous =True\r\n break\r\nif dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "STR=str(input())\r\nstr0=\"0000000\"\r\nstr1=\"1111111\"\r\nif (str0 in STR) or (str1 in STR):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g = input()\r\nif '0' * 7 in g or '1' * 7 in g:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "num = input()\r\nvalor =''\r\ncant = 0\r\nfor x in range(len(num)):\r\n if cant==7:\r\n break\r\n if x ==0:\r\n valor = num[x]\r\n cant +=1\r\n elif valor == num[x]:\r\n cant +=1\r\n elif valor != num[x]:\r\n cant = 1\r\n valor = num[x]\r\nif cant>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# https://codeforces.com/contest/96/problem/A\r\n\r\ns = input()\r\nprint('YES' if '1' * 7 in s or '0' * 7 in s else 'NO')\r\n", "def CalCulateZero():\r\n count = 0\r\n for i in range(len(s)):\r\n if i == 0:\r\n count += 1\r\n else:\r\n count -= 1\r\n break\r\n\r\n\r\n\r\ns = input()\r\n\r\nif '0000000' in s:\r\n print('YES')\r\nelif '1111111' in s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "line = list(input())\r\ncount1 = count0 = 0\r\nflag = False\r\nfor i in line:\r\n if i=='0':\r\n count0 += 1\r\n count1 = 0\r\n else:\r\n count1 += 1\r\n count0 = 0\r\n if count0>=7 or count1>=7:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\ns=\"0000000\"\r\ns1=\"1111111\"\r\nif (s in n) or (s1 in n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "c = (input())\r\ng=\"0000000\"\r\nd=\"1111111\"\r\nif c.__contains__(g) or c.__contains__(d):\r\n print (\"YES\") \r\nelse:\r\n print(\"NO\")", "dan = \"NO\"\r\nrow = 1\r\nteam = input()\r\nfor i in range (len(team)):\r\n currentT = team[i]\r\n if i != 0 and currentT == lastT:\r\n row += 1\r\n elif i != 0:\r\n row = 1\r\n if row >= 7:\r\n dan = \"YES\"\r\n lastT = currentT\r\nprint(dan)", "string = input()\r\n\r\nif '1111111' in string or '0000000' in string:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "r = input()\r\nf = 1\r\nfor i in range(1,len(r)):\r\n if r[i] == r[i-1]:\r\n f += 1\r\n if f == 7:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n f = 1\r\nprint(\"NO\")\r\n", "# mat = []\r\n# for i in range(5):\r\n# mat.append(list(map(int, input().split())))\r\n\r\n# c = 0\r\n# for i in range(1,6):\r\n# if 1 in mat[i-1]:\r\n# for j in range(1,6):\r\n# if mat[i-1][j-1]==1:\r\n# c += abs(3-j)+abs(3-i)\r\n# print(c)\r\n\r\n\r\n# def check(f,s):\r\n# for i in range(len(f)):\r\n# if ord(f[i]) < ord(s[i]):\r\n# return -1\r\n# elif ord(f[i]) > ord(s[i]):\r\n# return 1\r\n# return 0\r\n\r\n# f = input().upper()\r\n# s = input().upper()\r\n# res = check(f,s)\r\n# print(res)\r\n \r\n# s = input()\r\n# print(s[0].upper()+s[1:])\r\n\r\n# s = list(map(str, input().split('+')))\r\n# s.sort()\r\n# print('+'.join(s))\r\n\r\n\r\ns = input()\r\nif '1'*7 in s or '0'*7 in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "var=input()\r\nif '0000000' in var or '1111111' in var:print('YES')\r\nelse:print('NO')", "n = input()\r\ncont1 = 0\r\ncont2 = 0\r\nans = 0\r\nfor i in n:\r\n if(i == \"1\"):\r\n cont1 += 1\r\n else:\r\n cont1 = 0\r\n if(i == \"0\"):\r\n cont2 += 1\r\n else:\r\n cont2 = 0\r\n if(cont1 == 7 or cont2 == 7):\r\n ans = 1\r\n break\r\nif(ans == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num=str(input())\r\na=\"1111111\"\r\nb=\"0000000\"\r\nif(a in num or b in num):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "text = input()\r\n\r\nc = 0\r\nvar = ''\r\n\r\nfor i in text:\r\n if i == var:\r\n c+=1\r\n else:\r\n c = 0\r\n if c>= 6:\r\n print('YES')\r\n break\r\n var = i\r\nelse:\r\n print('NO')", "from itertools import groupby\r\n\r\nif __name__ == \"__main__\":\r\n string = input()\r\n\r\n if 7 <= max([len(list(g)) for k, g in groupby(string)], default = 0):\r\n print(\"YES\")\r\n else: \r\n print(\"NO\")", "k = input()\r\nif k.__contains__(\"0000000\"):\r\n print(\"YES\")\r\nelif k.__contains__(\"1111111\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\ns = input()\r\nprint('YES' if re.match(r'.*?([0]{7}|[1]{7})', s) else 'NO')", "n=input()\r\nc=[1]\r\nj=0\r\nfor i in range(len(n)):\r\n if n[i]==n[i-1]:\r\n c[j]=c[j]+1\r\n else:\r\n j=j+1\r\n c.append(1)\r\nm=max(c)\r\nif m >=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\r\nz='0000000'\r\no='1111111'\r\nif z in string or o in string:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nn = input()\r\n# j = [int(i) for i in input().split(\" \")]\r\n# a, b = [int(i) for i in input().split(\" \")]\r\n\r\nlastCount = 1\r\nfor x in range(1, len(n)):\r\n if n[x-1] == n[x]:\r\n lastCount += 1\r\n else:\r\n lastCount = 1\r\n \r\n if lastCount == 7:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "n = (input())\nif ((\"1\" * 7)in n) or ((\"0\" * 7) in n):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\nquit()\n\t \t\t\t\t \t\t \t \t\t\t\t \t \t \t", "pos = input()\r\nzeros = hash(\"0000000\")\r\nones = hash(\"1111111\")\r\nflag = False\r\nfor i in range(len(pos)-6):\r\n if hash(pos[i:i+7])==zeros or hash(pos[i:i+7])==ones:\r\n print(\"YES\")\r\n flag = True\r\n break\r\nif not flag:\r\n print(\"NO\")\r\n", "A=str(input())\r\nflag=False\r\nif len(A)<8:\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(A)-6):\r\n if A[i]==A[i+1]==A[i+2]==A[i+3]==A[i+4]==A[i+5]==A[i+6]:\r\n print(\"YES\")\r\n flag=True\r\n break\r\n if flag==False:\r\n print(\"NO\")", "x = str (input ())\r\nif \"0000000\" in x or \"1111111\" in x :\r\n print (\"YES\")\r\nelse :\r\n print (\"NO\")", "import sys\ndef get_ints():return map(int,sys.stdin.readline().strip().split())\ndef single_ints():return int(sys.stdin.readline())\ndef p(a):return sys.stdout.write(a)\ns=sys.stdin.readline()\nif '1111111' in s or '0000000' in s:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t \t \t\t\t\t\t \t\t", "import re as r\r\n\r\nstring =str(input())\r\n\r\nmatch = r.search(r\"(\\d)\\1{6}\", string)\r\n\r\nif match:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\r\na = b = 0\r\nfor i in x:\r\n if int(i):\r\n a += 1\r\n b = 0\r\n else:\r\n b += 1\r\n a = 0\r\n if 7 in [a,b]:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\r\ndef fun(s):\r\n while len(s)>=7:\r\n if s[0:7] == \"0000000\" or s[0:7] == \"1111111\":\r\n return (\"YES\")\r\n else:\r\n return fun(s[1:len(s)])\r\n return (\"NO\")\r\n\r\nprint(fun(s))", "o=\"1111111\"\r\nz=\"0000000\"\r\ns=input()\r\nif o in s or z in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nprint(\"YES\" if \"0000000\" in s or \"1111111\" in s else \"NO\")\r\n", "player = input()\r\nif '0000000' in player or '1111111' in player:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nt=\"0000000\"\r\nm=\"1111111\"\r\nif t in s or m in s:\r\n print('YES')\r\nelse: \r\n print('NO')", "\r\nl = list(map(int, input()))\r\nv = 1\r\nfor i in range(len(l) - 1):\r\n if l[i] == l[i+1]:\r\n v += 1\r\n else:\r\n v = 1\r\n if v == 7:\r\n print('YES')\r\n exit()\r\nprint('NO')", "import re\r\nx=input()\r\nprint(\"YES\" if len(re.findall(r'0000000',x))>0 or len(re.findall(r'1111111',x))>0 else \"NO\")", "\r\n\r\ndef solve():\r\n line = input().strip()\r\n\r\n ans = 0\r\n currlen = 1\r\n i = 1\r\n curr = line[0]\r\n while i<len(line):\r\n if line[i]==curr:\r\n currlen+=1\r\n \r\n else:\r\n ans = max(ans, currlen)\r\n currlen = 1\r\n curr = line[i]\r\n i+=1\r\n\r\n ans = max(ans, currlen)\r\n if ans>=7:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nsolve()", "players=input()\r\na='0000000'\r\nb='1111111'\r\nif a in players or b in players:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num_n = input()\r\nc1 = 0\r\nc0 = 0\r\nflag = 0\r\nfor i in range(0,len(num_n)):\r\n if (num_n[i] == '0'):\r\n if(c1 >= 7):\r\n flag = 1\r\n c1 = 0\r\n c0 = c0+1\r\n elif (num_n[i] == '1'):\r\n if(c0 >= 7):\r\n flag = 1\r\n c0 = 0\r\n c1 = c1+1\r\n \r\n \r\nif (c1 >= 7 or c0 >= 7 or flag == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\nif '0000000' in word or '1111111' in word:\n print('YES')\nelse:\n print('NO')\n", "testInput = input()\r\ni = 0\r\ndangerous = 0\r\nwhile i < len(testInput) - 6:\r\n if (testInput[i] == '0' and '1' in testInput[i:i+7]) or (testInput[i] == '1' and '0' in testInput[i:i+7]):\r\n i+=1\r\n continue\r\n else:\r\n dangerous = 1\r\n print(\"YES\")\r\n break\r\nif (dangerous == 0):\r\n print(\"NO\")", "S = input()[:100]\r\nc1 = 0\r\nflag = 0\r\nfor i in range(len(S)):\r\n if S[i-1] == S[i]:\r\n c1 += 1\r\n if c1 >= 7:\r\n flag = 1\r\n\r\n\r\n\r\n else:\r\n c1 = 1\r\n\r\nif flag == 1:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "from sys import exit\r\ns = input()\r\nnum = 1\r\nfor i in range(1,len(s)):\r\n if s[i]==s[i-1]:\r\n num+=1\r\n else:\r\n num = 1\r\n if num == 7:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "s=input()\r\na=0\r\nb=0\r\nf=0\r\nfor i in s:\r\n if i=='0':\r\n b=0\r\n a=a+1\r\n if(a==7):\r\n f=1\r\n break\r\n elif i=='1':\r\n a=0\r\n b=b+1\r\n if(b==7):\r\n f=1\r\n break\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nif \"1111111\" in a or \"0000000\" in a: print(\"YES\")\r\nelse: print(\"NO\")", "x=input()\r\nc=0\r\na=0\r\nb=0\r\nfor i in x:\r\n if i=='1':\r\n a+=1\r\n b=0\r\n else:\r\n b+=1\r\n a=0\r\n if a>6 or b>6:\r\n c=1\r\nif c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "players = input()\r\n\r\ntemp = players[0]\r\nstate = 'NO'\r\ncount = 1\r\n\r\nfor player in players[1:] :\r\n if player == temp:\r\n count += 1\r\n else :\r\n count = 1\r\n temp = player\r\n if count == 7 :\r\n state = \"YES\"\r\n\r\nprint(state)", "def is_dangerous(game):\r\n if \"0000000\" in game or '1111111' in game:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\ngame = input().strip()\r\nresult = is_dangerous(game)\r\nprint(result) ", "s=input()\r\na=1\r\nfor i in range(len(s)-1):\r\n if a>=7:\r\n break\r\n elif s[i]==s[i+1]:\r\n a=a+1\r\n else:\r\n a=1\r\nif a>=7:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "s= (input())\r\n\r\ncount=0\r\ncurrent=None\r\nfor char in s:\r\n if current and char!=current:\r\n current=char\r\n count=1\r\n else:\r\n current=char\r\n count+=1\r\n if count==7:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "s = input()\r\nones = 0\r\nzeroes = 0\r\nfor char in s:\r\n if char == '1':\r\n ones += 1\r\n zeroes = 0 \r\n else:\r\n zeroes += 1\r\n ones = 0 \r\n if ones >= 7 or zeroes >= 7:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\r\nif len(x) < 7:\r\n print(\"NO\")\r\nelse:\r\n k = x.find(\"0000000\")\r\n r = x.find(\"1111111\")\r\n if k == -1 and r == -1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "team = input()\r\nif \"1\" * 7 in team or \"0\" * 7 in team:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\n a = input();\n c1, c2 = 0, 0;\n\n for i in a:\n if i == '0':\n c1 += 1;\n c2 = 0;\n if c1 > 6:\n return('YES');\n else: \n c1 = 0;\n c2 += 1;\n if c2 > 6:\n return('YES');\n return('NO');\n\nprint(main())", "a = input(\"\")\r\nif \"0\" * 7 in a or \"1\" * 7 in a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Compiled by Zhou Tian 2300011538 from School of Physics PKU\r\n\r\nqueue = list(input())\r\n\r\ncurrency = queue[0]\r\ncurrent_queue = 1\r\nanswer = 'NO'\r\n\r\nfor i in queue[1:]:\r\n if i == currency:\r\n current_queue += 1\r\n if current_queue == 7:\r\n answer = 'YES'\r\n else:\r\n currency = i\r\n current_queue = 1\r\n\r\nprint(answer)\r\n", "l = input()\r\nc = 1\r\nfor i in range(1,len(l)):\r\n if l[i] == l[i-1]:\r\n c += 1\r\n if c == 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n c = 1\r\nelse:\r\n print(\"NO\")", "# Football\r\ns = input()\r\n# If there are at least 7 players of some team standing one after another, then the situation is considered dangerous. For example, the situation 00100110111111101 is dangerous and 11110111011101 is not.\r\n#print(\"s = \", s)\r\nl = len(s)\r\nflag = 0\r\nfor i in range(l-5):\r\n #print(s[i], \" --- \")\r\n for j in range(i, i+7):\r\n #print(s[j], end = \" \")\r\n if(s[i] != s[j]):\r\n break\r\n if(j == i+6):\r\n flag = 1\r\n break\r\n #print(\"flag = \", flag)\r\n if(flag == 1):\r\n print(\"YES\")\r\n break\r\nif(flag != 1):\r\n print(\"NO\")", "# :< \r\ns = input() \r\nls = \"\"\r\nans = 0\r\ncnt = 0\r\nfor c in s : \r\n if (c == ls) : \r\n cnt+=1 \r\n else : \r\n cnt = 1 \r\n ls = c\r\n ans = max(ans, cnt) \r\n\r\nif (ans >= 7) : \r\n print(\"YES\") \r\nelse : \r\n print(\"NO\") \r\n", "k=input()\r\nl=len(k)\r\ns=0\r\nif (0<l<=100):\r\n if (l<7):\r\n print('NO')\r\n else:\r\n for i in range(l-6):\r\n if (k[i]=='0' and k[i+1]=='0' and k[i+2]=='0' and k[i+3]=='0' and k[i+4]=='0' and k[i+5]=='0' and k[i+6]=='0'):\r\n s=s+1\r\n if (k[i]=='1' and k[i+1]=='1' and k[i+2]=='1' and k[i+3]=='1' and k[i+4]=='1' and k[i+5]=='1' and k[i+6]=='1'):\r\n s=s+1\r\n if s>0:\r\n print('YES')\r\n else:\r\n print('NO')", "import os\r\nimport sys\r\nimport io\r\nimport platform\r\nfrom typing import List\r\n\r\n\r\ndef solve(line: str):\r\n line = line.strip()\r\n length1, length0 = 0, 0\r\n for c in line:\r\n if c == '1':\r\n length0 = 0\r\n length1 += 1\r\n if length1 >= 7:\r\n return 'YES'\r\n else:\r\n length1 = 0\r\n length0 += 1\r\n if length0 >= 7:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\ndef main():\r\n # inputs = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n is_local = platform.node() == 'DESKTOP-S81101C'\r\n if is_local:\r\n input_reader = open('input.txt', 'r')\r\n output_writer = open('output.txt', 'w')\r\n else:\r\n input_reader = io.BytesIO(os.read(0, os.fstat(0).st_size))\r\n output_writer = sys.stdout\r\n\r\n line = input_reader.readline()\r\n if not is_local:\r\n line = line.decode()\r\n\r\n # n, k = [int(item) for item in metadata.strip().split(' ')]\r\n out = solve(line)\r\n output_writer.write(f'{out}\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "a = input()\r\nalist=list()\r\nfor i in range (len(a)):\r\n alist.append(int(a[i]))\r\nnum=alist[0]\r\ncount=0\r\nfor i in range (1,len(alist)):\r\n if (num==alist[i]):\r\n count+=1\r\n # print(count,end=\" \")\r\n if(count>=6):\r\n print(\"YES\")\r\n break\r\n else:\r\n num=alist[i]\r\n count=0\r\n # print(alist[i],end=\" \")\r\n\r\nif(count!=6):\r\n print(\"NO\")\r\n ", "a=input()\r\nans=\"NO\"\r\nfor i in range(0,len(a)-6):\r\n if(a[i]==a[i+1]==a[i+2]==a[i+3]==a[i+4]==a[i+5]==a[i+6]):\r\n ans=\"YES\"\r\nprint(ans)", "N=input()\nx=\"0000000\"\nx1=\"1111111\"\nif x1 in N:\n print(\"YES\")\nelif x in N:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t \t\t\t\t\t \t\t\t\t \t\t\t \t \t\t\t\t", "def football(n):\r\n if(\"1111111\" in n or \"0000000\" in n):\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\nn = input().strip()\r\nprint(football(n))", "nomer = list(input())\r\nk = nomer[0]\r\na = 0\r\nfor i in nomer:\r\n if i == k:\r\n a += 1\r\n k = i\r\n if a == 7:\r\n break\r\n else:\r\n a = 0\r\n k = i\r\n a += 1\r\nif a == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\ndangerous = False\r\nfor i in range(len(s) - 6):\r\n if s[i:i+7] == \"0000000\" or s[i:i+7] == \"1111111\":\r\n dangerous = True\r\n break\r\n\r\nif dangerous:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = \"0000000\"\r\nb = \"1111111\"\r\nc = input()\r\nif a in c or b in c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "p = input()\r\nc0 = 0\r\nc1 = 0\r\n\r\nfor i in range(len(p)):\r\n if p[i] == '0':\r\n c0+=1\r\n else:\r\n if c0>=7:\r\n break\r\n else:\r\n c0 = 0\r\nfor i in range(len(p)):\r\n if p[i] == '1':\r\n c1+=1\r\n else:\r\n if c1>=7:\r\n break\r\n else:\r\n c1 = 0\r\nif c0 >= 7 or c1>=7:\r\n print('YES')\r\nelse:\r\n print('NO')", "numbers=input()\r\ncounter=1\r\n\r\nfor i in range(len(numbers)-1):\r\n x=numbers[i]\r\n y=numbers[i+1]\r\n \r\n if x==y:\r\n counter+=1\r\n else:\r\n counter=1\r\n \r\n if counter==7:\r\n print(\"YES\")\r\n break\r\n \r\nelse:\r\n print(\"NO\")", "line = input()\r\nif \"0000000\" in line or \"1111111\" in line:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "p = input()\r\ncount = 1\r\nfor i in range(1,len(p)):\r\n if p[i] == p[i-1]:\r\n count+=1\r\n if count == 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n count = 1\r\nif count!= 7:\r\n print(\"NO\")", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n \r\n#Codeforces Problem-set\r\n#Problem name: Football\r\n#Problem number: 96A\r\n#Camilo Hernandez 7/8/18\r\n#PS8-PY\r\n \r\ncancha = input()\r\nif ((\"1\"*7) in cancha) or ((\"0\"*7) in cancha):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "z=input()\r\nl=len(z)\r\nc=1\r\nk=0\r\nfor i in range(1,l):\r\n if z[i]==z[i-1]:\r\n c+=1\r\n else:\r\n c=1\r\n if c>=7:\r\n k=1\r\nif k==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\n\r\nflag=0\r\nfor i in range(len(s)-6):\r\n if s[i:i+7].count('1')>=7 or s[i:i+7].count('0')>=7:\r\n flag=1\r\n print(\"YES\")\r\n break\r\nif flag==0:\r\n print(\"NO\")\r\n ", "n = input()\r\ncount0 = 0\r\ncount1 = 0\r\nfor i in n:\r\n if i == '1':\r\n count0 += 1\r\n count1 = 0\r\n if count0 >= 7 or count1 >= 7:\r\n print(\"YES\")\r\n break\r\n else:\r\n count1 += 1\r\n count0 = 0\r\n if count1 >= 7 :\r\n print(\"YES\")\r\n break\r\nif count0 < 7 and count1 < 7 :\r\n print(\"NO\")", "s=input()\r\ndef countGreater7(s):\r\n\tfor i in range(len(s)-6):\r\n\t\tp = s[i:i+7]\r\n# \t\tprint(p)\r\n\t\tif(p.count(s[i])==7):\r\n\t\t\treturn \"YES\"\r\n\treturn \"NO\";\r\nprint(countGreater7(s))", "s = input()\r\n\r\ncount = 1 # Initialize count to 1 since the first character is already considered\r\n\r\nif len(s) < 7:\r\n print(\"NO\")\r\n exit() # Terminate the program if the length of the string is less than 7\r\n\r\nfor i in range(len(s) - 1):\r\n if s[i] == s[i + 1]:\r\n count += 1\r\n if count >= 7:\r\n print(\"YES\") # If count reaches 7 or more, print \"YES\" and exit\r\n exit()\r\n\r\n else:\r\n count = 1 # Reset count if there is a mismatch of consecutive characters\r\n\r\nprint(\"NO\") # If the loop completes without finding a sequence of 7 or more, print \"NO\"\r\n", "a = input()\r\no,z=0,0\r\nbroke=False\r\nfor i in a:\r\n\tif i=='0':\r\n\t\tz+=1\r\n\t\to=0\r\n\telse:\r\n\t\to+=1\r\n\t\tz=0\r\n\t\r\n\tif o>=7 or z>=7:\r\n\t\tbroke=True\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\n\r\n\r\nif not broke:\r\n\tprint(\"NO\")\r\n\t\r\n", "a = input()\n\n\nc0, c1 = 0, 0\nfor c in a:\n if c == \"1\":\n c0 = 0\n c1 += 1\n if c1 >= 7:\n break\n elif c == \"0\":\n c1 = 0\n c0 += 1\n if c0 >= 7:\n break\n\nif c0 >= 7 or c1 >= 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = input()\r\nanswer = 'NO'\r\nif len(n)<7:\r\n print(answer)\r\nelse:\r\n for index,number in enumerate(n):\r\n sum = 0\r\n if index+6<len(n):\r\n for j in n[index:index+7]:\r\n sum+=int(j)\r\n if sum ==0 or sum==7:\r\n answer='YES'\r\n print(answer)", "x=input()\r\nl=len(x)\r\nc=0\r\nfor i in range(l):\r\n if x[i]==x[i-1]:\r\n c+=1\r\n elif c>=7:\r\n break\r\n else:\r\n c=1\r\nif c>=7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a=input()\nq='0000000'\nw='1111111'\nif q in a or w in a:\n print('YES')\nelse:\n print('NO')\n\n \t \t\t \t\t\t\t\t\t\t \t \t\t\t\t \t", "s=input()\r\nl=len(s)\r\nc=0\r\nfor i in range(l-6):\r\n if s[i:i+7:] ==\"1111111\":\r\n c+=1\r\n elif s[i:i+7:] ==\"0000000\":\r\n c+=1\r\nif c>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solution(plays: str) -> str:\n current = plays[0]\n in_line = 1\n\n for p in plays[1:]:\n if p == current:\n in_line += 1\n else:\n in_line = 1\n current = p\n\n if in_line >= 7:\n return \"YES\"\n return \"NO\"\n\n\nif __name__ == \"__main__\":\n players = input()\n print(solution(players))\n", "st=input()\r\nif st.count('0')>=7 or st.count('1')>=7:\r\n st0=0\r\n st1=0\r\n pr=False\r\n for s in st:\r\n if s=='0':\r\n st1=0\r\n st0+=1\r\n else:\r\n st0=0\r\n st1+=1\r\n if st0==7 or st1==7:\r\n print(\"YES\")\r\n pr=True\r\n break\r\n if pr==False:\r\n print(\"NO\")\r\nelse:\r\n print('NO')", "n= input()\r\nc1=0\r\nc2=0\r\nfor i in range(0,len(n)):\r\n if(n[i]=='0'):\r\n c1+=1\r\n c2=0\r\n if(c1==7):\r\n print(\"YES\")\r\n exit()\r\n elif(n[i]=='1'):\r\n c1=0\r\n c2+=1\r\n if(c2==7):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 12 16:17:03 2023\r\n\r\n@author: ZHAO XUDI\r\n\"\"\"\r\nstring = input()\r\na = string.split(\"0\")\r\nb = string.split(\"1\")\r\n\r\nalist = []\r\nblist = []\r\n\r\nfor i in a:\r\n n = len(i)\r\n alist.append(n)\r\na_new = sorted(alist,reverse=True)\r\n\r\nfor j in b:\r\n m = len(j)\r\n blist.append(m)\r\nb_new = sorted(blist, reverse=True)\r\n\r\nif int(a_new[0])<7 and int(b_new[0])<7:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# Read the input string\r\ns = input()\r\n\r\n# Check if there is a sequence of 7 or more consecutive 0s or 1s\r\nif \"0000000\" in s or \"1111111\" in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "members = list(input())\r\nhelper = 0\r\ndef judge(member:list):\r\n global helper\r\n for i in range(len(member) - 1):\r\n if helper == 6:\r\n return \"YES\"\r\n else:\r\n if member[i + 1] == member[i]:\r\n helper += 1\r\n else:\r\n helper = 0\r\n if helper == 6:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(judge(members))", "w='1'*7\r\ne='0'*7\r\ns=input()\r\nif w in s:\r\n print(\"YES\")\r\nelif e in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ns0 =\"0000000\"\r\ns1 =\"1111111\"\r\nif s0 in s or s1 in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")" ]

[ "n=int(input())\r\nx=input()\r\nnum=x.split(\" \")\r\nsum=0\r\nfor m in num:\r\n sum+=int(m)\r\n\r\nprint(sum/n)", "x = int(input())\r\ny = (input())\r\nz = y.split(' ')\r\ns = 0\r\nfor j in z:\r\n\ts += int(j)\r\n# for i in y:\r\n# \ts += int(i)\r\nprint (s/x)", "n=int(input())\r\nprint(sum(list(map(int,input().split())))/n)", "n = int(input())\r\ndef sum(l,n):\r\n sum1 = 0\r\n for i in range(n):\r\n sum1 += l[i]\r\n return sum1\r\n\r\nl = [int(x) for x in input().split()]\r\nsum(l, n)\r\nprint(sum(l,n)/n)", "n = int(input())\r\np = input()\r\nl = p.split(' ')\r\nl = [int(s) for s in l]\r\nvol = sum(l)/n\r\nprint ('%.12f' %vol)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 08:11:37 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nbottle=int(input())\r\ndata=input().split()\r\norange=0\r\ndata=[float(data[i]) for i in range(bottle)]\r\nfor i in range(bottle):\r\n orange+=data[i]\r\nprint(orange/bottle)", "n = int(input())\r\n\r\ns = list(map(int, input().split()))\r\ng = 0\r\n\r\nfor i in range(n):\r\n g += s[i]\r\nprint(g/n)", "n = int(input())\r\npercent = list(map(int, input().split()))\r\nprint(sum(percent)/n)", "n = int(input())\r\npi = list(map(int, input().split()))\r\n\r\ntotal_fraction = sum(pi)\r\naverage_fraction = total_fraction / n\r\n\r\nprint(\"{:.12f}\".format(average_fraction))\r\n", "n = int(input()) # Number of drinks\r\nfractions = list(map(int, input().split())) # List of volume fractions\r\n\r\n# Calculate the weighted average\r\ntotal_volume = sum(fractions)\r\naverage_fraction = total_volume / n\r\n\r\n# Print the result with 10 decimal places\r\nprint(format(average_fraction, '.10f'))\r\n", "n = int(input())\r\ns = input().split()\r\ns_ = [int(_) for _ in s]\r\n\r\nx = sum(s_) / n\r\n\r\nprint(x)\r\n", "n = int(input())\r\nk = input().split()\r\ns = 0\r\nfor i in range(n):\r\n k[i] = int(k[i])\r\n s += k[i]\r\nn = n*100\r\nprint((s/n)*100)\r\n ", "n = int(input())\r\npi_values = list(map(int, input().split()))\r\ntotal_volume = sum(pi_values)\r\naverage_fraction = total_volume / n\r\nprint(\"{:.12f}\".format(average_fraction))\r\n", "n = int(input())\r\na=list(map(int,input().split()))\r\nb=0\r\nfor i in range (n):\r\n b=a[i]+b\r\nc=b/n\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\nif 1<=n<=100:\r\n s=0\r\n for i in l:\r\n s+=i\r\n x=s/n\r\n print(x)", "\r\ndef main():\r\n n = int(input())\r\n print(sum([int(i) for i in input().split()])/n)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\nprint(sum(map(int, input().split()))/n )\n\n \t \t \t \t \t\t\t \t\t \t \t\t", "T = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nl = 0\r\nfor i in a:\r\n l += i\r\nl = l/T\r\nprint(l)", "n=int(input())\r\nsum=0\r\nl=[]\r\nl=list(map(int,input().split()))\r\nfor i in range(n): \r\n sum =sum+l[i]\r\nprint(sum/n) ", "def Drinks(number_of_orange , volume_fraction) :\r\n return sum(volume_fraction) / number_of_orange\r\n\r\nif __name__ == \"__main__\" :\r\n number_of_orange = int(input())\r\n volume_fraction = list(map(int , input().split()[:number_of_orange]))\r\n print(Drinks(number_of_orange , volume_fraction))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb = sum(a)/n\r\nprint('{:.12f}'.format(b))", "n = int(input())\r\nlist = [int(x) for x in input().split()]\r\nprint(sum(list)/n)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ns=0\r\nfor i in lst:\r\n s+=i/100\r\nprint((s/n)*100)\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\ni=0\r\nsum=0\r\nwhile i<n:\r\n sum=sum+p[i]\r\n i=i+1\r\nb=(sum/(n*100))*100\r\nb=round(b,5)\r\nprint(b)\r\n", "input();l=list(map(int,input().split()));print(sum(l)/len(l))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum1=0\r\nfor i in l:\r\n sum1+=(i/100)\r\nprint(\"%.12f\"%round((sum1/n)*100,12))", "import sys\r\n\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\nn = int(input())\r\ns = sum(list(map(int,input().split())))\r\nans = s / n\r\nprint(\"%f\" %ans)\r\n", "n = int(input())\r\nvolume = input().split()\r\ntotal = 0\r\nfor x in volume:\r\n total += int(x)\r\n\r\npercentage = total / n\r\nprint(percentage)", "from decimal import Decimal\r\n\r\nn = int(input())\r\ntotal = 0\r\njuice = map(int,input().split())\r\nfor i in juice :\r\n total = total + i \r\noutput = Decimal(total / n)\r\nformatted_output = '{:.12f}'.format(output)\r\nprint(formatted_output)", "from decimal import *\r\ngetcontext().prec = 12\r\n# print(Decimal((0+25+50+75)/4)) \r\nn = int(input())\r\nm = map(int,input().split())\r\nprint(Decimal(sum(m))/Decimal(n))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(len(x)):\r\n sum+=x[i]\r\n t=float(sum/n)\r\n \r\nprint(t)", "n = int(input())\r\na = list(map(float, input().split()))\r\n\r\nprint(sum(a)/n)\r\n", "def orange_percentage():\r\n num = int(input())\r\n juices = list(map(int, input().split(' ')))\r\n result = float(sum(juices) / num)\r\n print(f'{result:f}')\r\n\r\n\r\norange_percentage()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=((sum(l))/n)\r\nprint(x)", "n=int(input())\r\nt=list(map(int,input().split()))\r\nz=sum(t)/n\r\nres=format(z,'.6f')\r\nprint(res)", "n=float(input())\r\narr=list(map(float,input().split()))\r\nans=sum(arr)/n\r\nprint(ans)", "i=int(input())\r\np = list(map(int, input().split()))\r\ns=0\r\nfor k in range(i):\r\n s=s+p[k]\r\ns=s/i\r\nprint(s)", "a = int(input())\r\nb = list(map(int,input().split()))\r\nprint((sum(b)*100)/(a*100))", "# number of elements\r\n\r\nn = int(input())\r\nx=0\r\na=[]\r\na =[int(item) for item in input().split()]\r\nfor j in range(n):\r\n x=x+((100/n)*(a[j]/100))\r\nprint(x)", "x=int(input())\r\np=[int(x) for x in input().split()]\r\nprint(sum(p)/x)\r\n", "n=int(input())\r\nx=list(map(int,input().split(' ')))\r\ns=0\r\nfor i in range (n):\r\n s += x[i]/100\r\nf =(s/n)*100\r\nprint( format(f,'.12f',))\r\n", "n = int(input())\r\nfractions = list(map(int, input().split()))\r\n\r\ntotal_fraction = sum(fractions) / n\r\n\r\nprint(total_fraction)\r\n", "a = eval(input())\r\ns = input()\r\ns = s.split()\r\nfor i in range(0, len(s)):\r\n s[i] = int(s[i])\r\nsum =0\r\nfor i in range(a):\r\n sum+=s[i]\r\nprint(sum/a)", "n=int(input())\r\na=map(int,input().split(\" \"))\r\ntot=n*100\r\nt=0\r\nfor i in a:\r\n t=t+i\r\nfinal=t/tot\r\nfinal=final*100\r\nprint(\"{0:.12f}\".format(final))\r\n", "n=int(input())\r\nr=list(map(int,input().split()))\r\nprint(sum(r)/n)\r\n", "# 200B - Drinks\r\nif __name__ == '__main__':\r\n n = int(input())\r\n lst = list(map(int,input().split()))\r\n sum_list = sum(lst)\r\n result = sum_list / n\r\n print(f'{result:.12f}')\r\n", "n=int(input())\r\np=[int(i) for i in input().split()]\r\nsum=sum(p)\r\navg=sum/n\r\nprint(avg)\r\n ", "n=int(input())\r\narr=list(map(int,input().split()))\r\nprint(sum(arr)/n)", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\nsum_volume_fractions = sum(volume_fractions)\r\naverage_volume_fraction = sum_volume_fractions / n\r\nprint(average_volume_fraction)", "# Read the number of drinks\r\nn = int(input().strip())\r\n\r\n# Read the percentages of orange juice in each drink\r\npercentages = list(map(int, input().split()))\r\n\r\n# Calculate the total percentage\r\ntotal_percentage = sum(percentages)\r\n\r\n# Compute the average percentage\r\naverage_percentage = total_percentage / n\r\n\r\n# Output the result\r\nprint(average_percentage)\r\n", "n=int(input())\r\na=input().split()\r\narr=[int(element) for element in a]\r\nsum=0\r\nfor i in arr:\r\n sum=sum+i\r\nresult=(sum/(n*100))*100\r\nfin_result=f\"{result:.12f}\"\r\nprint(fin_result)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=0\r\nfor i in range(0,n):\r\n b+=round(a[i]/n,12)\r\nprint(b)", "n=int(input())\r\np=list(map(int,input().split()))\r\nr=sum(p)/n\r\nr=str(r)\r\nwhile len(r)<15:\r\n r+='0'\r\nprint(r)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nd=sum(b)\r\nprint(d/a)", "n = int(input())\r\nd = list(map(int,input().split()))\r\ns = sum(d)\r\nprint(round(s/n,4))\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ntotal=sum(lst)\r\nprint(total/n)", "a=int(input());ls=list(map(int,input().split()));print(sum(ls)/len(ls))", "n=int(input())\r\n\r\nd=map(int,input().split())\r\n\r\nprint(sum(d)/n)\r\n\r\n", "def calculate_orange_cocktail_fraction(n, fractions):\r\n total_fraction = sum(fractions) / n\r\n return total_fraction\r\n\r\nn = int(input())\r\nfractions = list(map(int, input().split()))\r\n\r\n\r\nresult = calculate_orange_cocktail_fraction(n, fractions)\r\n\r\nprint(\"{:.10f}\".format(result))\r\n", "n=int(input())\r\nf=list(map(int, input().split()))\r\ntf=sum(f)\r\naf=tf/n\r\nprint(af)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=sum(l)\r\ny=x/(n*100)\r\nprint(round((y*100),12))\r\n", "n = int(input())\r\np = input().split()\r\nc = 0\r\nfor i in p:\r\n c += int(i)\r\nprint(c/len(p))", "n=int(input())\r\n\r\nv=list(map(int,input().split()))\r\n\r\nvolume=0\r\n\r\n\r\nfor i in v:\r\n volume+=i\r\n\r\n\r\nprint(volume/n)", "n = int(input())\r\np = list(map(int, input().split()))\r\ni = 0\r\nsum = 0\r\nwhile i < n:\r\n sum += p[i]\r\n i += 1\r\nprint(sum/n)\r\n", "n = int(input())\r\ndrinks = list(map(int,input().split()))\r\nsumof_drinks=sum(drinks)\r\nprint(sumof_drinks/n)", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\nd = sum(s) / 100\r\nprint((d / n) * 100)", "n=int(input())\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n c+=l[i]/100\r\n\r\nprint((c/n)*100)", "x=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(x):\r\n c+=(a[i]/100)\r\ny=(c/x)*100\r\nprint(y) ", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Oct 5 10:32:16 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nn=int(input())\nnums=list(map(int,input().split()))\nsum=0\nfor i in nums:\n sum+=i\n k=sum/n\n \nprint(k)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = sum(a) / n\r\nprint(f\"{ans:.12f}\")\r\n\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nx=0\r\nfor i in p :\r\n x+=i\r\nj=x/len(p)\r\na=\"{:.10f}\"\r\nprint(a.format(j))", "\r\nn = int(input())\r\n\r\njuice_list = list(map(int, input().split()))\r\n\r\ntotal = 0\r\n\r\nfor i in range(len(juice_list)):\r\n total += juice_list[i] / 100\r\n \r\nprint(100*(total/n))", "n = int(input())\r\ns = input().split()\r\ndat = list(map(int, s))\r\n\r\nprint(sum(dat) / n)", "def sol(t,l):\r\n s=0\r\n for i in range(0,t):\r\n s+=l[i]\r\n return s/t\r\nt=int(input())\r\nh=input()\r\nelements = [int(element) for element in h.split()]\r\nprint(sol(t,elements))\r\n", "n = int(input())\n\ndrinks = list(map(int, input().split()))\n\nprint(sum(drinks)/n)\n", "a, b = int(input()), input().split()\r\nc = 0\r\nfor i in range(a):\r\n c += int(b[i])\r\nprint(c / a)\r\n", "def sm_juice(juice_list):\r\n x = sum(juice_list)/100\r\n return 100 * (x/n)\r\n\r\nn = int(input())\r\n\r\njuice_list = list(map(int, input().split()))\r\n\r\nprint(sm_juice(juice_list))", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nb = sum(l) / n\r\nprint(b)", "w = int(input())\r\nx = input().split(\" \")\r\ns = 0\r\nfor i in x:\r\n s = s + int(i)\r\nprint(s / w)", "# 200B - Drinks\r\n\r\nn = int(input())\r\npercents = list(map(int, input().split(' ')))\r\nsoma = 0\r\n\r\nfor p in percents:\r\n soma += p\r\n\r\nprint(soma/n)", "n=int(input())\r\nx=list(map(int,input().split()))\r\ncount=0\r\nfor i in x:\r\n count=count+i/n\r\nprint(count)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n total += l[i]/100/n\r\n\r\nprint(total*100)", "num = int(input())\r\nstring = input()\r\ns = 0\r\nfor i in range(num):\r\n s += int(string.split()[i])\r\nprint(s/num)", "n = int(input())\r\np = list(map(int, input().split()))\r\nres = sum(p)\r\nprint(res / n)", "t = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nprint(f\"{sum(nums)/t}\")", "n = int(input())\r\nlists = list(map(int,input().split()))\r\nprint(sum(lists)/n)", "n = int(input())\r\npi = list(map(int, input().split()))\r\ntotal_valume_fraction = sum(pi) / n\r\nprint(total_valume_fraction)", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=sum(a)\r\nprint(d/n)", "n = int(input())\r\np = map(int, input(). split())\r\nprint((sum(p))/n)\r\n", "n = int(input())\r\nch = (input())\r\nl = ch.split(\" \")\r\ns= 0\r\nfor x in l:\r\n s += int(x)\r\nprint(s/n)\r\n ", "t=int(input())\r\na=list(map(int,input().split()))\r\nx=sum(a)/t\r\nprint(x)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nsum = 0\r\nfor x in l:\r\n sum += x\r\nprint(sum/n)", "x=int(input())\r\nsq=input()\r\nsq=sq.split()\r\nsum1=0\r\nfor i in sq:\r\n sum1+=int(i)\r\nprint(sum1/x)", "n = int(input())\r\nl = list(input().split())\r\n\r\nfor i in range(len(l)):\r\n l[i] = int(l[i]) / 100\r\n\r\ns = sum(l)\r\nprint((s/n)*100)\r\n", "z=int(input())\r\nx=list(map(int, input().split()))\r\ny=sum(x)\r\na=y/z\r\nprint(format(a, '.12f'))", "from sys import stdin,stdout\r\nn = int(input())\r\na = list(map(int,stdin.readline().split()))\r\nprint(sum(a)/n)", "n= int(input())\r\na= list(map(int, input().split())) [:n]\r\nsum=0\r\nfor x in a:\r\n sum=sum+x\r\n\r\nprint(sum/n)", "number=int(input())\r\npercentage=list(map(int,input().split()))\r\nprint(sum(percentage)/number)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nprint(sum(lst)/n)\r\n", "x=int(input())\r\na=list(map(int,input().split()))\r\nans=sum(a)/x\r\nprint(ans)", "num_of_drinks = int(input())\r\n\r\npercentages = list(map(float, input().split()))\r\n\r\ntotal = 0.0\r\n\r\nfor percent in percentages:\r\n total += percent\r\n\r\nprint(total/num_of_drinks)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nsum=int(0)\r\nfor i in l:\r\n sum+=i\r\nprint(sum/n)", "n=int(input())\r\nd=input().split()\r\np=[int(x) for x in d]\r\nprint(sum(p)/n)", "n = int(input())\r\nper = input().split()\r\nper = list(map(int, per))\r\nf = sum(per) / (n * 100)\r\nprint(f * 100)", "n=int(input())\nl=list(map(int,input().split()))\no=sum(l)\nans=o/n\nprint(ans)\n", "n = int(input())\nmy_list = [int(x) for x in input().split()]\nresult = 0\n\nfor x in my_list:\n result += x\n\nprint(float(result/n))", "n = int(input())\r\narr = list(map(int,input().split()))\r\nper = 0\r\nfor i in arr:\r\n per += i\r\nans = (per/(n))\r\nprint(ans)", "n = int(input())\r\ntrash=list(map(int,input().split()))\r\nresult = 0 \r\nfor i in trash:\r\n result += i/100\r\ntotal = (result/n)*10**2\r\nanswer = f\"{total:.{12}}\"\r\nanswer = answer.split('.')\r\nif len(answer[-1])==1:\r\n finish = answer[0]+'.'+answer[-1]+'00000000000'\r\n print(finish)\r\nelse:\r\n finish = answer[0]+'.'+answer[-1]\r\n print(finish)\r\n", "x=int(input())\r\nk=list(map(int,input().split()))\r\nprint(float(sum(k)/len(k)))", "a=int(input())\r\n\r\nl=list(map(int,input().split()))\r\nend=0\r\nfor i in l :\r\n end+=i\r\ng=end/a\r\nprint(round(g,12))", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nb = sum(x) / n\r\n\r\nprint(b)", "n = int(input())\r\np = list(map(int, input().split()))\r\ntotal = sum(p)\r\nprint(total / n)\r\n", "n=int(input(\"\"))\r\nx=input(\" \")\r\nl=x.split(\" \")\r\nc=0\r\nfor i in l:\r\n c+=float(i)\r\ns=c/n\r\nprint(s)", "n = eval(input().strip())\r\nls = input().strip().split()\r\nls = [int(i) for i in ls]\r\nprint(sum(ls)/n)\r\n\t\t \t \t\t \t \t \t \t\t\t \t\t\t\t\t\t\t", "n = int(input())\r\na = input().split()\r\nsumm = 0\r\nfor i in a:\r\n summ += int(i)\r\nprint(summ/n)\r\n", "number_of_juices = int(input())\r\nsumm = 0\r\nn = list(map(int, input().split()))\r\nfor j in n:\r\n summ += j\r\nprint(summ / number_of_juices)", "divisor = int(input())\r\nnumbers = list(map(int, input().split()))\r\nresult = 1 / divisor * sum(numbers)\r\nprint(result)", "t=int(input())\r\nn=list(map(int,input().split()))\r\nx=sum(n)\r\nresult=x/t\r\nprint(result)", "\r\nn=int(input())\r\nm=input().split()\r\nfor x in range(len(m)):\r\n m[x]=int(m[x])\r\nprint(sum(m)/len(m))", "def solve():\r\n n = int(input())\r\n drinks = list(map(int,input().split()))\r\n return sum(drinks)/len(drinks)\r\n\r\n\r\n\r\nprint(solve())", "a = int(input())\r\nc = list(map(int,input().split()))\r\nprint(sum(c)/a)", "n = float(input())\r\np = list(int(x) for x in input().split())\r\nvol = 0\r\nfor i in range(int(n)):\r\n vol += (p[i] / 100)\r\n\r\nprint(100*vol / n)", "n = int(input())\r\ns = input()\r\nl = list(map(float, s.split()))\r\ns1 = 0\r\nfor i in l:\r\n s1 += i/100\r\nprint((s1/n)*100)", "n=int(input())\r\nlist1=list(input().split(' '))\r\nlist1=[int(i) for i in list1]\r\nsum=0\r\ncount=0\r\nfor i in list1:\r\n sum=sum+i\r\n count=count+100\r\nprint((sum/count)*100)\r\n", "n = int(input())\r\nl = sum(list(map(int, input().split())))\r\nprint(l/n)", "n=int(input())\r\np=list(map(int,input().split()))\r\ntv=sum(p)\r\ncp=tv/n\r\nprint('{:.12f}'.format(cp))", "n = int(input())\r\n\r\ninput_list = input()\r\n\r\nanswers = (input_list.split())\r\n\r\nsuma = 0\r\n\r\nfor i in range(n):\r\n suma = suma + int(answers[i])\r\nprint(suma/n) \r\n\r\n", "n=int(input())\r\npercentage_line=input()\r\nlis=percentage_line.split(' ')\r\n\r\ndem=0\r\nsum=0\r\nfor i in lis:\r\n dem=dem+1\r\n sum=sum+int(i)\r\nprint(sum/dem)\r\n\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\ns=sum(l)\r\nprint(s/n)", "n = int(input())\r\ns=0\r\na=list(map(int,input().split()))\r\nx=sum(a)/n\r\nprint(\"%.4f\"%x)", "try:\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n print(sum(l)/n)\r\nexcept:\r\n pass", "chir = int(input())\r\nris = input().split()\r\nvan = []\r\nfor sur in ris:\r\n\tsur = int(sur)\r\n\tvan.append(sur)\r\nS0l = sum(van) / len(van)\r\nprint(S0l)", "n = int(input())\r\nx = list(map(int,input().split()))\r\nz=sum(x)\r\nprint(z/len(x))", "from decimal import *\r\ngetcontext().prec = 12\r\nx = int(input())\r\ny = list(map(int, input().split()))\r\nprint(Decimal(sum(y))/Decimal(len(y)))", "n=int(input())\r\nx=list(map(int,input().split()))\r\ns=sum(x)\r\nprint(s/n)", "n= int(input())\r\ny = input()\r\nlist=[]\r\nlist = y.split()\r\nfor i in range(n):\r\n list[i]= float(list[i])\r\n \r\n \r\nx=0 \r\nfor i in range(n):\r\n x= x + (list[i]*50)/100\r\nprint((x/(50*n))*100) ", "x=int(input())\r\ny=list(map(int,input().split()))\r\nn=sum(y)\r\nprint((n/(100*x))*100)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nz=sum(x)\r\nprint(z/len(x))", "n = int(input())\r\narr = list(map(int, input().split()))\r\ns = sum(arr)\r\nprint(\"{0:.12f}\".format(s/n))", "n = int(input())\r\npourcentages = list(map(int, input().split()))\r\n\r\nfractions = [p / 100 for p in pourcentages]\r\n\r\n\r\nfraction_totale = sum(fractions) / n\r\n\r\n\r\npourcentage_resultant = fraction_totale * 100\r\n\r\nprint(pourcentage_resultant)\r\n", "def calc(n, per):\r\n total = sum(per)\r\n cfraction = total / (n * 100)\r\n return cfraction * 100\r\n\r\nn = int(input())\r\nperc = list(map(int, input().split()))\r\nc_frac = calc(n, perc)\r\nprint(\"{:.12f}\".format(c_frac))\r\n", "x = int(input())\r\nnumbers = input().split()\r\nf = sum(map(int, numbers))\r\nj = float(f) / float(x)\r\nprint(j)", "inverse_value = 1 / int(input())\r\nnumbers = list(map(int, input().split()))\r\nresult = inverse_value * sum(numbers)\r\nprint(result)\r\n", "a = int(input())\r\nb = map(int, input().split())\r\nprint(sum(b)/a)", "n=int(input())\r\nvolume=list(map(int, input().split()))\r\ntorange=sum(volume)\r\ntcocktail=n*100 \r\nvolfraction=(torange/tcocktail)*100\r\nprint(\"{:.9f}\".format(volfraction))", "x=int(input())\r\ny=input()\r\na=y.split(\" \")\r\nb=0\r\nfor i in a:\r\n b=b+int(i)\r\nprint(b/x)", "n = int(input())\r\nq = map(int,input().split())\r\ntotal = 0\r\nfor entry in q:\r\n total += entry/100\r\npercentage = float(total/n*100)\r\nprint(round(percentage, 12))\r\n\r\n", "n = int(input())\r\nlis = []\r\n\r\nlis = input().split(' ')\r\nlis = [int(i) for i in lis]\r\n\r\nnum = 0\r\n\r\nfor i in range(len(lis)):\r\n num += lis[i]\r\n \r\nprint(float(num/n))", "number=int(input())\r\ntype=list(input().split())\r\nsum=0\r\na=len(type)\r\nfor b in range(0,a):\r\n sum=sum+int(type[b])/number\r\nprint(sum)", "n = int(input())\r\npercents = list(input().split())\r\nfor i in range(n):\r\n percents[i] = int(percents[i])\r\n percents[i] = percents[i] * 0.01\r\nsumation = sum(percents)\r\nprint(str((sumation / n) * 100))", "n=int(input())\r\ncocktails=list(map(int,(input().split())))\r\nfor i in range(len(cocktails)):\r\n cocktails[i]=cocktails[i]/100\r\nresult=(sum(cocktails)/n)*100\r\nprint('{:.12f}'.format(round(result,12)))", "n = int(input())\r\nprint(\r\n eval(input().replace(\" \",\"+\")) / n\r\n)", "if __name__ == \"__main__\":\r\n n = int(input())\r\n percentages = list(map(int, input().split()))\r\n\r\n total_percent = sum(percentages)\r\n cocktail_percent = total_percent / n\r\n\r\n print('{:.12f}'.format(cocktail_percent))\r\n", "t=int(input())\r\nres=0\r\nl=list(map(int,input().split()))\r\nfor a in l:\r\n res+=a\r\nres=(res/t)\r\nprint(res)", "def calculate(n, pi_values):\r\n fraction = sum(pi_values)\r\n cocktail_fraction = fraction / n\r\n return cocktail_fraction\r\n\r\nn = int(input())\r\npi_values = list(map(int, input().split()))\r\n\r\nprint(calculate(n, pi_values))", "n=int(input())\r\nl=list(int(v) for v in input().split())\r\nx=0\r\nfor i in l:\r\n x+=(i/100)\r\nprint(round((x/n)*100,12))", "g = int(input())\r\nans = list(map(int, input().split()))\r\n\r\n\r\ntp = sum(ans)\r\n\r\n\r\nop = tp / g\r\n\r\nprint(op)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\ntotal = 0\r\n\r\nif n == len(p):\r\n for i in p:\r\n total += i\r\n\r\nprint(total / n)", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ns = 0\r\nfor i in range(n):\r\n s = s+l[i]\r\n\r\nprint(s/n)", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\nsum = 0\r\nfor i in x:\r\n sum += i\r\nprint(sum/len(x))", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\ntp = sum(p) / n\r\n\r\nprint(tp)\r\n", "n= int(input())\r\na=list(map(int, input().split()))\r\ns=0\r\nfor i in range(n):\r\n s=s+a[i]\r\nprint((s/(n*100))*100)", "n = int(input())\r\na = list(map(int, input().split()))\r\nresult = sum(a) / n\r\nprint(result)", "a = int(input())\nb = [int(x) for x in input().split()]\n\norange_juice = sum(b) / (a * 100)\norange_juice *= 100\n\nprint(orange_juice)\n\t \t\t\t\t \t \t \t \t\t \t\t \t", "n=int(input())\r\ns=list(map(int, input().split(' ')))\r\nsum=0\r\nfor i in range(n):\r\n sum+=s[i]\r\nprint(sum/n)", "n=int(input())\r\na=[]*n\r\ncocktail=0\r\na=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n cocktail+=a[i]\r\nsum=100*n\r\nprint(cocktail/sum*100)\r\n", "n = int(input())\r\nm = [int(el) for el in input().split()]\r\nprint(sum(m)/n) ", "n = int(input())\r\nv = list(map(int, input().split()))\r\ntotal_sum = sum(v)\r\nweighted_average = total_sum / (n * 100)\r\nc = weighted_average * 100\r\nprint(\"{:.12f}\".format(c))", "# Input\r\nn = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\n# Calculate the average\r\naverage = sum(volume_fractions) / n\r\n\r\n# Output the result\r\nprint(average)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(100*(sum(l)/(100*(len(l)))))", "x = int(input())\r\na = [int(i) for i in input().split()]\r\ntotal = sum(a)\r\nprint(total/(len(a)*100)*100)\r\n", "n = int(input())\r\n\r\np = sum(map(int, input().split(' ')))\r\n\r\nprint(f'{(p / n):.17f}')\r\n", "s=0\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n s=s+i/100\r\nprint(\"{:.12f}\".format((s/n)*100))", "# -*- coding: utf-8 -*-\n\"\"\"Codeforce\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1vkqd1IDYYeIi4VIH6yqQEhbS4qcGMzLO\n\"\"\"\n\nn = int(input())\np = list(map(int , input().split()))\nv = 0\n\nfor itm in p:\n v += itm\n\nprint(f\"{v/n:.12f}\")", "a = int(input())\r\nb = list(map(int , input().split()))\r\ntotal = 0\r\nfor i in range(a):\r\n total += b[i]\r\nprint(total / a)", "n = int(input())\r\np = list(map(int, input().split()))\r\nprint(sum(p)/n)\n# Tue Jul 04 2023 13:36:54 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\ndata = input().split()\r\na = [int(x) for x in data]\r\nans = sum(a) / n\r\nprint(ans)", "n = int(input())\r\ndrinks = list(map(int, input().split()))\r\nprint(sum(drinks) / n)\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\np = [int(i) for i in sys.stdin.readline().split()]\r\n\r\njuice = 0\r\n\r\nfor i in p:\r\n juice += i * 0.01\r\n i += 1\r\n\r\nprint(juice * 100 / n)", "drinks = int(input()) * 100\r\nmix_recipe = [int(n) for n in input().split()]\r\n\r\nprint((sum(mix_recipe) / drinks) * 100)", "# Read the input - the number of glasses and the sugar concentrations\r\nn = int(input())\r\nsugar_concentrations = list(map(int, input().split()))\r\n\r\n# Calculate the average sugar concentration as a percentage\r\naverage_percentage = sum(sugar_concentrations) / (n * 100) * 100\r\n\r\nprint(average_percentage)", "n = int(input())\r\n\r\nu = list(map(int,input().split()))\r\n\r\nrt = sum(u)\r\n\r\nprint(rt/n)", "def div(x):\r\n\treturn x/100\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx = map(div, x)\r\nprint(sum(x)/n*100)", "t = int(input())\n\narr = list(map(int, input().split()))\n\nsumm = sum(arr)\n\nprint((summ / (t * 100)) * 100)", "n=int(input())\r\n\r\na=input()\r\n\r\narr=list(map(int,a.split()))\r\n\r\nprint(sum(arr)/len(arr))", "n = int(input())\r\nA = list(map(int, input(). split()))\r\nprint(sum(A) / n)", "# Читаем количество напитков из входных данных\r\nn = int(input())\r\n\r\n# Читаем объемную долю апельсинового сока в каждом напитке и суммируем их\r\ntotal_percentage = sum(map(int, input().split()))\r\n\r\n# Вычисляем среднюю объемную долю апельсинового сока в коктейле\r\naverage_percentage = total_percentage / n\r\n\r\n# Выводим результат с округлением до 12 знаков после запятой\r\nprint('{:.12f}'.format(average_percentage))", "n = int(input())\n\nls = [int(i) for i in input().split()]\n\nprint(sum(ls)/n)", "n = int(input())\r\n\r\nfrac = list(map(float, input().split()))\r\nvfcount = 0\r\ntotalvol = 0\r\nfor i in range(n):\r\n volfrac = frac[i] / 100\r\n vfcount += volfrac\r\n\r\nnewtotalvol = float(n)\r\n\r\nreqvolfrac = vfcount / newtotalvol\r\n\r\nprint(\"{:.12f}\".format(reqvolfrac*100))\r\n\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nx = 10\r\nans = 0\r\nfor y in p:\r\n ans += y/100\r\nprint(format(ans/n*100, '.12f'))\r\n", "def calculate_orange_juice_fraction(n, percentages):\r\n total_percentage = sum(percentages)\r\n average_percentage = total_percentage / n\r\n return average_percentage\r\n\r\n# Read input\r\nn = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\n# Calculate and print the volume fraction of orange juice\r\nresult = calculate_orange_juice_fraction(n, percentages)\r\nprint(result)\r\n", "n = int(input())\r\np = input()\r\nl_p = p.split()\r\n\r\nsum = 0\r\nfor i in l_p:\r\n sum+=int(i)\r\n\r\nprint(sum/n)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(float(sum(l)/n))\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ns = 0\r\nfor i in range(len(a)):\r\n s += a[i] / 100\r\nprint(s / n * 100)", "n = int(input())\np = list(map(float,input().split()))\nfinal = sum(p)/len(p)\nprint(final)", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\ntotal = 0\r\nfor i in b:\r\n total +=i\r\nr = total/a\r\nprint(r)", "no_of_drinks = int(input())\r\n\r\norange_fraction_in_drinks = list(map(int, input().split()))\r\n\r\nprint(sum(orange_fraction_in_drinks) / no_of_drinks) ", "print(\r\n (1/int(input()))*eval(input().replace(\" \",\"+\"))\r\n)", "\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣤⣤⣤⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⡟⠁⠀⠉⢿⣦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡿⠀⠀⠀⠀⠀⠻⣧⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⡇⠀⢀⠀⠀⠀⠀⢻⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⡇⠀⣼⣰⢷⡤⠀⠈⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣇⠀⠉⣿⠈⢻⡀⠀⢸⣧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⠀⠀⢹⡀⠀⢷⡀⠘⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢻⣧⠀⠘⣧⠀⢸⡇⠀⢻⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣤⣤⠶⠾⠿⢷⣦⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⡆⠀⠘⣦⠀⣇⠀⠘⣿⣤⣶⡶⠶⠛⠛⠛⠛⠶⠶⣤⣾⠋⠀⠀⠀⠀⠀⠈⢻⣦⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⣿⣄⠀⠘⣦⣿⠀⠀⠋⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⢨⡟⠀⠀⠀⠀⠀⠀⠀⢸⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢿⣦⠀⠛⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣸⠁⠀⠀⠀⠀⠀⠀⠀⢸⡿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⠀⠀⠀⠀⠀⠀⢠⣿⠏⠁⠀⢀⡴⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡏⠀⠀⠀⠀⠀⠀⠀⢰⡿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⢠⠶⠛⠉⢀⣄⠀⠀⠀⢀⣿⠃⠀⠀⡴⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢷⠀⠀⠀⠀⠀⠀⣴⡟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⣀⣠⡶⠟⠋⠁⠀⠀⠀⣼⡇⠀⢠⡟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⢷⣄⣀⣀⣠⠿⣿⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠋⠁⠀⠀⠀⠀⣀⣤⣤⣿⠀⠀⣸⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠉⠉⠀⠀⢻⡇⠀⠀⠀⠀⢠⣄⠀⢶⣄⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⢀⣤⣾⠿⠟⠛⠋⠹⢿⠀⠀⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⡀⠀⠀⠀⠀⠘⢷⡄⠙⣧⡀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⢀⣴⠟⠋⠁⠀⠀⠀⠀⠘⢸⡀⠀⠿⠀⠀⠀⣠⣤⣤⣄⣄⠀⠀⠀⠀⠀⠀⠀⣠⣤⣤⣀⡀⠀⠀⠀⢸⡟⠻⣿⣦⡀⠀⠀⠀⠙⢾⠋⠁⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⣠⣾⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠈⣇⠀⠀⠀⠀⣴⡏⠁⠀⠀⠹⣷⠀⠀⠀⠀⣠⡿⠋⠀⠀⠈⣷⠀⠀⠀⣾⠃⠀⠀⠉⠻⣦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⣴⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⡆⠀⠀⠀⠘⢷⣄⡀⣀⣠⣿⠀⠀⠀⠀⠻⣧⣄⣀⣠⣴⠿⠁⠀⢠⡟⠀⠀⠀⠀⠀⠙⢿⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⣾⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⡽⣦⡀⣀⠀⠀⠉⠉⠉⠉⠀⢀⣀⣀⡀⠀⠉⠉⠉⠁⠀⠀⠀⣠⡿⠀⠀⠀⠀⠀⠀⠀⠈⢻⣧⡀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⢰⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⠃⠈⢿⣿⣧⣄⠀⠀⠰⣦⣀⣭⡿⣟⣍⣀⣿⠆⠀⠀⡀⣠⣼⣿⠁⠀⠀⠀⠀⠀⠀⠀⢀⣤⣽⣷⣤⣤⠀⠀⠀⠀⠀\r\n# ⠀⢀⣿⡆⠀⠀⠀⢀⣀⠀⠀⠀⠀⠀⠀⢀⣴⠖⠋⠁⠈⠻⣿⣿⣿⣶⣶⣤⡉⠉⠀⠈⠉⢉⣀⣤⣶⣶⣿⣿⣿⠃⠀⠀⠀⠀⢀⡴⠋⠀⠀⠀⠀⠀⠉⠻⣷⣄⠀⠀⠀\r\n# ⠀⣼⡏⣿⠀⢀⣤⠽⠖⠒⠒⠲⣤⣤⡾⠋⠀⠀⠀⠀⠀⠈⠈⠙⢿⣿⣿⣿⣿⣿⣾⣷⣿⣿⣿⣿⣿⣿⣿⡿⠃⠀⠀⣀⣤⠶⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢻⣧⠀⠀\r\n# ⢰⣿⠁⢹⠀⠈⠀⠀⠀⠀⠀⠀⠀⣿⠷⠦⠄⠀⠀⠀⠀⠀⠀⠀⠘⠛⠛⠿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠟⠉⢀⣠⠶⠋⠉⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀\r\n# ⣸⡇⠀⠀⠀⠀⠀⠀⠀⢰⡇⠀⠀⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⠀⠉⠉⠛⠋⠉⠙⢧⠀⠀⢸⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⡆\r\n# ⣿⡇⠀⠀⠈⠆⠀⠀⣠⠟⠀⠀⠀⢸⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⢿⠀⠀⠀⠀⠀⠀⠀⠈⠱⣄⣸⡇⠠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣻⡇\r\n# ⢻⣧⠀⠀⠀⠀⠀⣸⣥⣄⡀⠀⠀⣾⣿⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⠂⠀⠀⠀⠀⠀⠀⣿⡇\r\n# ⢸⣿⣦⠀⠀⠀⠚⠉⠀⠈⠉⠻⣾⣿⡏⢻⣄⡀⠀⠀⠀⠀⠀⠀⠀⠀⠠⣟⢘⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠟⢳⡄⠀⠀⠀⠀⠀⠀⠀⠀⠐⡟⠀⠀⠀⠀⠀⠀⢀⣿⠁\r\n# ⢸⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠻⣇⠈⠻⠷⠦⠤⣄⣀⣀⣀⣀⣠⣿⣿⣄⠀⠀⠀⠀⠀⣠⡾⠋⠄⠀⠈⢳⡀⠀⠀⠀⠀⠀⠀⠀⣸⠃⠀⠀⠀⠀⠀⠀⣸⠟⠀\r\n# ⢸⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⣧⣔⠢⠤⠤⠀⠀⠈⠉⠉⠉⢤⠀⠙⠓⠦⠤⣤⣼⠋⠀⠀⠀⠀⠀⠀⠹⣦⠀⠀⠀⠀⠀⢰⠏⠀⠀⠀⠀⠀⢀⣼⡟⠀⠀\r\n# ⠀⢻⣷⣖⠦⠄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣷⠈⢳⡀⠈⠛⢦⣀⡀⠀⠀⠘⢷⠀⠀⠀⢀⣼⠃⠀⠀⠀⠀⠀⠀⠀⠀⠈⠳⡄⠀⠀⣠⠏⠀⠀⠀⠀⣀⣴⡿⠋⠀⠀⠀\r\n# ⠀⠀⠙⠻⣦⡀⠈⠛⠆⠀⠀⠀⣠⣤⡤⠀⠿⣤⣀⡙⠢⠀⠀⠈⠙⠃⣠⣤⠾⠓⠛⠛⢿⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢿⡴⠞⠁⢀⣠⣤⠖⢛⣿⠉⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠈⠙⢷⣤⡁⠀⣴⠞⠁⠀⠀⠀⠀⠈⠙⠿⣷⣄⣀⣠⠶⠞⠋⠀⠀⠀⠀⠀⠀⢻⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣤⠶⠞⠋⠁⠀⢀⣾⠟⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠉⠻⣷⡷⠀⠀⠀⠀⠀⠀⠀⠀⠀⢙⣧⡉⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠢⣤⣀⣀⠀⠀⠈⠂⢀⣤⠾⠋⠀⠀⠀⠀⠀⣠⡾⠃⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠉⠉⠉⠉⠉⠉⠁⠀⠀⢀⣠⠎⣠⡾⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⣦⠀⠀⠀⠀⠀⠀⠀⣿⣇⢠⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⠀⠀⠀⠀⠀⠀⠀⠀⠤⢐⣯⣶⡾⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⢿⣄⠸⣆⠀⠀⠲⣆⠀⠀⢸⣿⣶⣮⣉⡙⠓⠒⠒⠒⠒⠒⠈⠉⠁⠀⠀⠀⠀⠀⢀⣶⣶⡿⠟⠋⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠛⠷⠾⠷⣦⣾⠟⠻⠟⠛⠁⠀⠈⠛⠛⢿⣶⣤⣤⣤⣀⣀⠀⠀⠀⠀⠀⠀⠀⣨⣾⠟⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠉⠉⠙⠛⠛⠛⠻⠿⠿⠿⠿⠛⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n c+=i/100\r\nprint((c/n)*100)\r\n\r\n\r\n\r\n", "n = int(input())\r\nans = sum(list(map(int, input().split())))\r\nprint((ans / 100) / n * 100)", "n = int(input())\nporcentaje = list(map(int, input().split()))\nc=sum(porcentaje)/n\nprint(c)\n \t\t\t\t \t \t\t \t \t\t \t\t \t\t", "n=int(input())\r\np=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(p)):\r\n s+=p[i]\r\nans=s/len(p)\r\nprint(ans)\r\n", "n_= int(input())\nd = input().split()\np = [int(x) for x in d]\nprint(sum(p)/n_)\n \t\t \t\t\t \t \t \t\t\t \t\t \t \t\t\t\n \t \t\t \t \t\t \t \t\t \t \t\t", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\naverage_volume_fraction = sum(volume_fractions) / (n * 100)\r\nprint(average_volume_fraction * 100)\r\n", "# Read input\r\nn = int(input())\r\nfractions = list(map(int, input().split()))\r\n\r\n\r\ntotal_fraction = sum(fractions[i] / 100 for i in range(n))\r\ncocktail_fraction = (total_fraction / n) * 100\r\n\r\nprint('{:.10f}'.format(cocktail_fraction))\r\n", "result = \"\"\r\nn = int(input())\r\nvolumes = input().split(\" \")\r\ntotal = 0\r\nfor x in range(n):\r\n total += int(volumes[x])/100\r\nresult = (total/n)*100\r\nprint('%.12f' % result)", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n):\r\n d=d+a[i]\r\nc=d/n\r\nprint(\"%.12f\"%c)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nprint(\"%.12f\" %round(sum(x)/n,12))", "n=int(input())\r\nm=list(map(int,input().split()))\r\nprint(\"{:.12f}\". format(sum(m)/n))\r\n", "N=int(input())\r\np=list(map(int, input().split()))\r\navg=sum(p)/N\r\nprint(avg)\r\n ", "from decimal import *\r\ngetcontext().prec=12\r\nnum=int(input())\r\nnum2=list(map(int,input().split()))\r\nx=Decimal(sum(num2))/Decimal(len(num2))\r\nprint(x)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nprint(1/a*sum(b))\r\n", "n=int(input())\r\nx=input().split()\r\nc=0\r\nfor i in x:\r\n c+=int(i)\r\nprint(c/n)", "n = int(input())\r\ns = input().split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\nc = 0\r\nfor j in range(len(s)):\r\n c += s[j]\r\nprint(float(c/n))", "n=int(input())\r\np=list(map(int,input().split()))\r\ntotal_p=sum(p)\r\nav_p=total_p/n\r\nprint(\"{:.4f}\".format(av_p))", "a = int(input())\r\npercents = list(map(int,input().split()))\r\nsoorat = 0\r\nfor i in percents:\r\n\tsoorat+=(i/100)\r\nprint(soorat*100/a)", "n = int(input())\r\ndrink_percentages = list(map(int, input().split()))\r\ntotal_orange_juice_volume = sum(drink_percentages)\r\ncocktail_percentage = total_orange_juice_volume / n\r\nprint(f'{cocktail_percentage:.8f}')", "n = int(input()) # Read the number of drinks\r\npercentages = list(map(int, input().split())) # Read the volume fractions of orange juice in each drink\r\n\r\ntotal_percentage = sum(percentages) # Calculate the total volume fraction of orange juice\r\ncocktail_percentage = total_percentage / n # Calculate the average volume fraction in the cocktail\r\n\r\nprint(cocktail_percentage) # Print the volume fraction in percent of orange juice in Vasya's cocktail\r\n", "n = int(input())\n\npercent = input().split()\n\npercent1 = [int(i) for i in percent]\n\na = sum(percent1) / n\n\nprint(a)", "def volume_fraction_cocktail(n, volume_fractions):\r\n total_fractions = sum(volume_fractions)\r\n cocktail_volume_fraction = total_fractions / n\r\n return cocktail_volume_fraction\r\n\r\n\r\nn = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\nresult = volume_fraction_cocktail(n, volume_fractions)\r\nprint(\"{:.9f}\".format(result))\r\n", "n = int(input())\r\npi = list(map(int, input().split()))\r\n\r\ntotal = sum(pi)\r\n\r\naverage = total / n\r\n\r\nprint(average)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nprint(sum(p)/n)", "n = int(input())\r\ns = 0\r\nnumbers = input().split()\r\nnumbers = list(map(int, numbers))\r\nfor i in range(n):\r\n s = s + int(numbers[i])\r\nprint(s/n)", "def Drinks():\r\n numberOfBottles = int(input())\r\n bottleVolumes = str(input()).split(\" \")\r\n totalVolumePercentage = 0\r\n i = 0\r\n while (i < numberOfBottles):\r\n totalVolumePercentage += int(bottleVolumes[i])/100\r\n i += 1\r\n finalAnswer = totalVolumePercentage/(numberOfBottles/100)\r\n print(finalAnswer)\r\nDrinks()", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\ntotal = sum(l1)/n\r\nprint(total)\r\n ", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ns=sum(a)\r\np=s/n\r\nprint(\"%.12f\"%p)", "def volume_fraction(n, percentages):\r\n total_percentage = sum(percentages)\r\n return total_percentage / n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n percentages = list(map(int, input().split()))\r\n result = volume_fraction(n, percentages)\r\n print(\"{:.12f}\".format(result))\r\n", "n = int(input())\r\nvolume_percentage = map(int, input().split())\r\nprint(sum(volume_percentage) / n)", "n=int(input())\r\np=list(map(int,input().split()))\r\nc=n*100\r\nprint((sum(p)/c)*100)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nprint(sum(s)/(n))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=0\r\nfor i in l:\r\n x+=(i/100)\r\nprint(\"{:.12f}\".format((x/n)*100))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=sum(l)\r\nr=a/n\r\nprint(r)\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\na=sum(list1)\r\nprint((a/n))", "n=int(input())\r\na=sum(list(map(int,input().split())))\r\nprint(a/n)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = 0\r\nfor i in range(n):\r\n b+=a[i]\r\nprint(b/n)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ntotal_percentage = 0\r\nfor p in percentages:\r\n total_percentage += p\r\n\r\ncocktail_percentage = total_percentage / n\r\nprint(cocktail_percentage)\r\n", "n=int(input())\r\nx=list(map(int ,input().split()))\r\nprint(\"{:.12f}\".format(sum(x)/n))", "n = int(input())\r\nlist_drinks = list(map(int,input().split()))\r\nprint(float(sum(list_drinks)/n))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nprint((sum(x)/(n*100))*100)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ns=sum(lst)\r\nprint(s/n)", "n = int(input())\r\nper_list = list(map(int, input().strip().split()))\r\n\r\nprint(sum(per_list)/n)", "n=int(input())\nf=list(map(int,input().split()))\nprint(sum(f)/n) \n# Tue Jul 04 2023 11:34:05 GMT+0300 (Moscow Standard Time)\n", "a = int(input())\r\ns = 0\r\nfor i in input().split():\r\n s += int(i)\r\nprint(s / a)", "drinks=int(input())\r\npercent=input()\r\npercentlist=percent.split(\" \")\r\na=0\r\nfor i in range(len(percentlist)):\r\n a=a+int(percentlist[i])\r\nprint(a/len(percentlist))", "n = int(input())\r\ns = list(map(float, input().split()))\r\nx = sum(s) / n\r\nprint(x)", "n = int(input())\r\nk = list(map(int, input().split()))\r\ntotal=sum(k)\r\navg=total/n\r\nprint(avg)", "n=int(input())\r\nli=list(map(int,input().split()))\r\ns=sum(li)\r\navg=s/n\r\nprint(\"{:.12f}\".format(avg))\r\n", "a,n=[],int(input())\r\nb=map(int,input().split())\r\nfor i in b:\r\n a.append(i/n)\r\nprint(format(sum(a),\".12f\"))", "number = int(input())\r\n\r\nsum = sum(map(lambda a: int(a), input().split(\" \")))\r\n\r\nprint(sum/number)", "n=int(input())\r\nsum=0\r\nl=list(map(int,input().split(\" \")))\r\nfor i in l:\r\n sum+=i\r\nprint(float(sum/n))", "n=int(input())\r\na=list(map(int, input().split()))\r\nprint(f'{(sum(a)/n):.12f}')", "def solve():\r\n x = int(input())\r\n l = [int(i) for i in input().split()]\r\n print(sum(l)/x/100*100)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "n=int(input())\r\nq=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(len(q)):\r\n sum+=q[i]\r\nprint(sum/len(q))", "n=int(input())\r\np=list(map(int,input().split()))\r\nreq=0\r\nfor i in range(n):\r\n req+=p[i]*0.01\r\nprint((req/n)*100)\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nprint(sum(b) / a)\r\n\n# Tue Jul 04 2023 11:47:15 GMT+0300 (Moscow Standard Time)\n", "l = int(input())\r\ni = sum(map(int, input().split()))\r\nprint(i/l)\r\n", "n = int(input())\r\nlistX = list(map(int,input().split(\" \")))\r\nsumP = sum(listX)\r\nd = n*100\r\nans = (sumP/d)*100\r\nprint(ans)", "num_drinks = int(input())\r\n\r\nvalues = list(map(int, input().split(' ')))\r\ntotal = (sum(values) / 100) / num_drinks\r\nprint(total*100)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=(sum(l)*100)/(n*100)\r\nprint(x)", "def calculate_cocktail_fraction(n, volume_fractions):\r\n total_orange_juice_volume = sum(fraction for fraction in volume_fractions)\r\n total_cocktail_volume = n * 100 \r\n return (total_orange_juice_volume / total_cocktail_volume) * 100\r\nn = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\nresult = calculate_cocktail_fraction(n, volume_fractions)\r\nprint(\"{:.9f}\".format(result))\r\n", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ntotal_percent = sum(percentages)\r\naverage_percent = total_percent / n\r\n\r\nfinal_percent = (average_percent / 100) * 100\r\n\r\nprint(final_percent)", "n = int(input())\np = list(map(int, input().split()))\n\ntotal_percentage = sum(p)\naverage_percentage = total_percentage / n\n\nprint(round(average_percentage, 10))\n# Tue Jul 04 2023 11:17:45 GMT+0300 (Moscow Standard Time)\n", "a=int(input())\r\nw=sum(list(map(int,input().split())))\r\nprint(w/a)", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\ntotal_volume_fraction = sum(volume_fractions) / n\r\nprint(format(total_volume_fraction, '.12f'))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint((sum(i for i in l))/(len(l)))", "\r\nn = int(input())\r\nprint(sum(int(x) for x in input().split()) / n)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(a):\r\n c+=b[i]\r\nprint(c/a)", "y=float(input())\r\ns=0.0\r\nr=list(map(float,input().split()))\r\nfor i in range(int(y)):\r\n\tif r[i]!=0:\r\n\t\ts+=1/(100/r[i])\r\nprint(s*(1/y)*100)", "t=int(input())\r\nmylist=list(map(int,input().split()))\r\nprint(round(sum(mylist)/len(mylist),12))", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range (n):\r\n s+=a[i]\r\nprint(s/n)", "n = int(input())\r\np = input().split()\r\nt = 0\r\nfor i in p:\r\n t += int(i) / n\r\n\r\nprint(t)\r\n", "if __name__ == \"__main__\":\r\n num = int(input())\r\n drinksPercent = [int(x) for x in input().split()] \r\n totalJuice = 0\r\n for i in range(num):\r\n totalJuice += drinksPercent[i]\r\n print(totalJuice/num)\r\n", "a=int(input())\r\nb=input().split()\r\nsum=0\r\ni=0\r\nwhile i<len(b):\r\n b[i]=int(b[i])\r\n sum=sum+b[i]\r\n i+=1\r\nprint(sum/a)\n# Tue Jul 04 2023 11:54:08 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na=[int(x) for x in input().split()]\r\nb=0\r\nfor i in a:\r\n b+=i\r\nprint(b/n)", "n=int(input())\r\nx=list(map(int,(input().split())))\r\nsum=0\r\nfor i in x:\r\n sum=sum+i\r\navarage='{:.12f}'.format(sum/n)\r\nprint(avarage)", "a=int(input())\r\nh=[]\r\nh=list(map(int,input().split()))\r\ng=0\r\nfor i in range(0,a):\r\n g+=h[i]\r\nprint(float(g/a))", "def calculate_cocktail_volume_fraction(n, pi):\r\n total_orange_juice = sum(pi)\r\n total_cocktail_volume = n\r\n return total_orange_juice / total_cocktail_volume\r\n\r\n# Read the input values\r\nn = int(input().strip())\r\npi = list(map(int, input().strip().split()))\r\n\r\n# Calculate the volume fraction of orange juice in the cocktail\r\nresult = calculate_cocktail_volume_fraction(n, pi)\r\n\r\n# Print the result with 10 decimal places\r\nprint(\"{:.10f}\".format(result))\r\n", "n = int(input())\r\nsentence = list(map(int,input().split()))\r\nif n == int(len(sentence)):\r\n answer = sum(sentence)/n\r\n print(answer)", "#codeforces 200B\r\nn=int(input())\r\nsum=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n sum=sum+(i/n)\r\nprint(sum)", "def main():\n divisor = int(input())\n lst = input().split()\n sum = 0\n for num in lst:\n sum += int(num)\n print(sum/divisor)\nmain()\n", "n = int(input())\r\nm = input().split()\r\nfor i in range(len(m)):\r\n m[i] = int(m[i])\r\nx = 0\r\nfor i in m:\r\n x = x + i\r\naverage = x / n\r\nprint(\"{:.9f}\".format(average))", "def drinks(p):\r\n return sum(p)/len(p)\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n print(drinks(p))", "n = int(input())\r\n\r\n\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\n\r\ntotal_volume = sum(volume_fractions)\r\n\r\n\r\naverage_volume_fraction = total_volume / n\r\n\r\n\r\nprint(\"{:.12f}\".format(average_volume_fraction))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nnum=sum(x)\r\nans=num/n\r\nprint(ans)\r\n", "def drinks():\r\n n = int(input())\r\n drinks = list(map(int, input().split()))[:n]\r\n s = 0\r\n for drink in drinks:\r\n s = s + drink/n\r\n print(s)\r\ndrinks()", "n=int(input())\r\narr=list(map(int,input().split()))\r\nprint((sum(arr)/(n*100))*100)", "takes = int(input())\nsum = 0\na = list(map(int, input().split()))\nfor i in range(takes):\n sum+=a[i]\nfinal = sum/takes\nprint(\"{0:.12f}\".format(final))\n \t\t\t \t \t\t \t\t \t \t\t \t", "count_drinks = int(input())\r\njuice_volumes = list(map(int, input().split()))\r\nsum_juice_volumes = 0\r\nfor volume in juice_volumes:\r\n sum_juice_volumes += volume / 100\r\nresult_percent_juice = (sum_juice_volumes / count_drinks) * 100\r\nprint(result_percent_juice)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n", "i = int(input())\r\ni2 = input().split(' ')\r\nn=0\r\n\r\nfor j in range(i):\r\n n+= int(i2[j])\r\nprint(\"{:.12f}\".format(n/i))", "a=int(input())\r\nb=list(map(int,input().strip().split()))[:a]\r\nprint(sum(b)/len(b))", "n = int(input())\r\np_list = list(map(int, input().split()))\r\n\r\nx_left = (sum(p_list))\r\nanswer = x_left/n\r\nprint(float(answer))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor i in range (len(arr)):\r\n ans+=arr[i]\r\nprint(ans/n)", "def vasyaJuice(n, drinks):\r\n totalpercent = n * 100\r\n drinkpercent = 0\r\n for i in drinks:\r\n drinkpercent += i\r\n\r\n print((drinkpercent / totalpercent) * 100)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n drinks = list(map(int, input().split()))\r\n vasyaJuice(n, drinks)", "n=int(input())\r\nvolume=[int(i) for i in input().split()]\r\ntotal_volume_orange=[]\r\nfor i in volume:\r\n total_volume_orange.append(i/100)\r\nvolume_fraction=float(sum(total_volume_orange)/len(volume))\r\nprint(volume_fraction*100)", "p = 0\r\nn = int(input())\r\nfor e in map(int, input().split()) :\r\n p += e / n\r\nprint(p)", "a = int(input())\nlst = [int(x) for x in input().split()]\ns = sum(lst)\nprint(s/a)\n# Wed Jul 05 2023 21:47:08 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\n\r\nnums = sum(list(map(int, input().split())))\r\n\r\nprint(round(nums/n, 12))\r\n", "number_of_drinks=int(input())\r\ndrinks=list(map(int,input().split()))\r\nprint(sum(drinks)/number_of_drinks)", "\r\ndef orange_juice_percentage():\r\n number_drinks = int(input())\r\n total = number_drinks\r\n \r\n percentages = input()\r\n drinks = percentages.split(' ')\r\n \r\n accumulator = 0\r\n for drink in drinks:\r\n accumulator += int(drink)\r\n \r\n print(accumulator/total)\r\norange_juice_percentage()", "n=int(input())\r\nm=map(int, input().split())\r\nprint(sum(m)/n)\n# Tue Jul 04 2023 12:31:41 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nq=0\r\nfor i in a:\r\n q+=i\r\nprint(q/n) ", "n = int(input())\r\nvolume_fractions = [int(x) for x in input().split()]\r\njuice = 0\r\nfor frac in volume_fractions:\r\n juice += frac / 100\r\nprint(100 * juice / n)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in l:\r\n s += i\r\nprint(s / n)\r\n", "n=int(input()) #jucies with orange in them\r\nn2=list(map(int,input().split()))\r\nvolume=sum(n2)/n\r\nprint(volume)", "n = int(input())\r\nnum = list(map(int,input().split()))\r\nans = 0\r\nfor x in num:\r\n val = x/100\r\n ans += val\r\n\r\nprint((ans/n)*100)", "n = input()\r\nvalue = list(map(int, input().split(' ')))\r\nprint(sum(value) / len(value))", "n = int(input())\r\nm = map(int, input().split())\r\nprint(sum(m)/n)\r\n\r\n\r\n", "a = int(input())\n\n\nb = input()\n\n\nprecent_juice = map(int, b.split(' '))\n\nfraction = 0\nfor i in precent_juice:\n\tfraction += i/100\nprint((fraction/a)*100)\n", "n = int(input())\r\nsum = 0\r\nfraction = list(map(int, input().split()))\r\nfor i in fraction:\r\n sum += i\r\nprint('%.4f'%(sum/n))", "n = int(input())\r\nfractions = list(map(int, input().split()))\r\ntotal_proportion = 1 / n\r\nweighted_sum = sum(fraction * total_proportion for fraction in fractions)\r\nprint(\"{:.12f}\".format(weighted_sum))\r\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\nsumm = 0\r\nfor i in range(a):\r\n summ = summ + b[i]\r\nprint(\"{:.12f}\".format(summ/a))", "x = int(input())\r\n\r\ny = list(map(int,input().split()))\r\n\r\nres = sum(y)/x\r\n\r\nprint(res)", "\"№ 1\"\n# w = int(input())\n# a = []\n# for i in range(0, w):\n# s = input()\n# if len(s) > 10:\n# s = s[0] + str(len(s)-2) + s[-1]\n# a.append(s)\n# else:\n# a.append(s)\n# for u in range(0, len(a)):\n# print(a[u])\n\n\"№ 2\"\n# n = int(input())\n# if n % 2 == 0:\n# print(n//2)\n# else:\n# print((n//2+1)*-1)\n# w = 0\n# for i in range(1, n+1):\n# w += ((-1)**i)*i\n\n\"№ 3\"\n# a, t = [int(e) for e in input().split()]\n# s = input()\n# for i in range(0, t):\n# s = s.replace(\"BG\", \"GB\")\n# print(s)\n\n\"№ 4\"\nN = int(input())\na = input().split()\nprs = 0\nfor i in range(0, len(a)):\n prs += int(a[i])/100\nprint((prs/N)*100)\n", "a=int(input())\r\ns=input()\r\nd=s.split()\r\nr=0\r\nfor x in range(a):\r\n r+=int(d[x])\r\nprint(r/a)", "n,x=int(input()),list(map(int,input().split()));print(sum(x)/n)", "n=int(input())\r\nn2=map(int,input().split())\r\nm=sum(n2)/n\r\nprint(m)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb=sum(a)/n\r\nzeros = 12\r\nprint(\"{:.{}f}\".format(b, zeros))\r\n\r\n", "n = int(input())\r\n\r\npercentage = list(map(int, input().split()))\r\nsumPercentage = sum(percentage)\r\nexitPercentage = round(sumPercentage/n, 12)\r\nprint(exitPercentage)", "n=int(input())\r\na=[int(s) for s in input().split()]\r\nss=0\r\nfor i in range(n):\r\n ss=ss+a[i]\r\nprint(ss/n)", "a=int(input())\r\nb=sum(list(map(int,input().split())))\r\nprint(b/a)", "n=int(input())\r\nk=list(map(int,input().split()))\r\ns=0\r\nfor i in k:\r\n s+=i/100\r\nprint((s/n)*100)", "n = int(input())\r\nstring = [int(i) for i in input().split()]\r\nprint(sum(string) / n)", "n=int(input())\r\ns=input()\r\nres=sum([int(i) for i in s.split()])/n\r\nprint(\"%.12f\" % res)", "n = int(input())\r\nstr_input = input()\r\ndata_list = str_input.split()\r\nsum = 0\r\n\r\nfor i in range(0, n):\r\n sum += int(data_list[i])\r\n\r\nprint(sum / n)", "num_of_j=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in a:\r\n c+=i\r\nprint(\"{:.12f}\".format(c/len(a)))", "n = int(input())\r\nvolume = list(map(int,input().split()))\r\nsum = 0\r\nfor x in volume:\r\n sum += x/100\r\nprint((sum/n)*100)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ntotal_volume = sum(percentages)\r\ncocktail_volume = total_volume / n\r\n\r\nprint(cocktail_volume)\r\n", "n = int(input())\r\np = list(map(int,input().split(' ')))\r\nx = 0\r\nfor i in p:\r\n x+=(i/100)\r\n\r\nprint(100*(x/n))\r\n", "n=int(input())\r\nvolume=list(map(int, input().split()))\r\ntotal_orange=sum(volume)\r\ntotal_cocktail=n*100 \r\nvolume_fraction=(total_orange/total_cocktail)*100\r\nprint(\"{:.9f}\".format(volume_fraction))\r\n", "import math\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n # lenght = int(input())\r\n # # lenght = 2\r\n # s = input().split(\" \")\r\n #chislo, delit = map(int, input().split(' '))\r\n n = int(input())\r\n ch = 0\r\n s = input().split(' ')\r\n for i in range(0, len(s)):\r\n s[i] = int(s[i])\r\n ch += s[i]\r\n print(round(ch / n, 4))", "from decimal import *\r\ngetcontext().prec=12\r\nnum=int(input())\r\nnum2=list(map(int,input().split()))\r\nresult=Decimal(sum(num2))/Decimal(len(num2))\r\nprint(result)", "n = int(input())\r\nlst_p = input().split()\r\nP = 0\r\nfor i in range(0, n):\r\n P = P + int(lst_p[i])\r\nprint(P/n)", "from math import ceil\r\n\r\nn = int(input())\r\nmass = list(map(int, input().split()))\r\nprint(sum(mass)/n)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(((sum(l)/100)/n)*100)", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = 0\r\nfor i in l:\r\n a+=i/100\r\nprint((a/n)*100)", "from decimal import *\r\nn=int(input())\r\np=list(map(int,input().split()))\r\ns=sum(p)\r\nprint(Decimal(s)/Decimal(n))", "n = int(input())\r\njuice = list(map(int,input().split()))\r\nnew = sum(juice)\r\nprint(new/n)\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\na=sum(l1)\r\nn1=n*100\r\na1=a/n1\r\nprint(a1*100)", "n = int(input())\n\nlista = []\n\nelementos = input()\nvalores = elementos.split()\n\nfor valor in valores:\n lista.append(int(valor))\n\nsoma = 0\n\nfor num in lista:\n soma+=num\n\nresultado = soma/n\n\nprint(f'{resultado:.12f}')\n \t \t\t\t \t\t\t \t \t\t\t \t\t\t \t\t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\npercent_orange = sum(a)\r\n\r\nprint(round(percent_orange / n, 4))\r\n", "x=int(input())\r\nd=list(map(int,input().split()))\r\nsum1=0\r\nfor i in d :\r\n sum1+=i\r\nprint(sum1/x)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nsum1=sum(arr)\r\nans=(sum1/n*100)/100\r\nprint(format(ans,'.12f'))\r\n", "n=int(input())\r\nread=input().split()\r\ni=0\r\nfor i in range(len(read)):\r\n read[i]=int(read[i])\r\nsum=0\r\nfor i in read:\r\n sum+=i\r\nprint(sum/len(read))\r\n\r\n\r\n\r\n", "n = int(input())\r\nfractions = list(map(int, input().split()))\r\ntotal_fraction = sum(f / 100 for f in fractions) \r\nans = total_fraction / n\r\n \r\nprint(\"{:.12f}\".format(ans * 100))", "\"\"\"n,h=map(int,input().split())\r\n\r\nfh = list(map(int,input().split()))\r\nmaxW = 0\r\nfor i in fh:\r\n if i > h:\r\n maxW+=2\r\n else:\r\n maxW+=1\r\n\r\nprint(maxW)\r\n\r\n\r\nn = int(input())\r\nL = list(map(int,input().split()))\r\n\r\nif L.count(1) >= 1:\r\n print(\"HARD\")\r\nelse:\r\n print(\"EASY\")\r\n \r\n\r\nn = int(input())\r\nList = list(list(map(int,input().split())) for i in range(n))\r\nc=0\r\nfor i in List :\r\n if (i[1]-i[0]) >=2:\r\n c+=1\r\nprint(c)\r\n\r\n\r\n\r\nn = int(input())\r\nif n%2==0:\r\n print(n//2)\r\nelse:\r\n print(-n//2)\r\n\"\"\"\r\n\r\nn=int(input())\r\nl = sum(list(map(int,input().split())))\r\ns= (l/100)/(n/100)\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\n# from functools import lru_cache\r\n# n=int(input())\r\n\r\nn=int(input())\r\narr=[int(i)/100 for i in input().split()]\r\nprint(sum(arr)/n*100)", "q=int(input())\r\nw=map(int,input().split())\r\nprint(1/q*sum(w))", "n=int(input())\r\npercentages=list(map(int,input().split()))\r\ntotal=sum(percentages)\r\ncocktail=total/n\r\nprint(cocktail)", "totalDrinks = int(input())\r\ndrinks = list(map(int, input().split(\" \")))\r\ncontent = 0\r\nfor i in drinks:\r\n content += (i/100)\r\nfinal = content/totalDrinks\r\nprint(final*100)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(\"%.12f\"%(sum(l)/n))\r\n\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nv = sum(p)\r\na = v / n\r\nprint(format(a, \".10f\"))\r\n", "n = int(input())\r\npers = list(map(int, input().split()))\r\nr = f'{sum(pers)/n:.012f}'\r\nprint(r)", "n=int(input())\r\nvol=list(map(int,input().split()))\r\nvol_per=(sum(vol)/n)\r\nprint(vol_per)", "d = int(input())\r\ntotal = 0\r\nq = input().split()\r\nfor i in range(d):\r\n total += int(q[i])\r\nprint (total / d)", "x=int(input())\r\na = list(map(int,input().strip().split()))\r\nb= sum(a)/x\r\nprint(b)", "N = int(input())\r\nX = list(map(int,input().split()))\r\nresult = sum(X) / N\r\nprint(result)", "a=int(input())\r\nx=list(map(int,input().split()))\r\nq=0\r\nfor i in range(len(x)):\r\n q+=x[i]/100\r\nprint((q/a)*100)\r\n \r\n\r\n", "n = int(input())\r\n\r\n# Get the fraction orange of orange juice in each drink\r\nd = input().split()\r\np = [int(x) for x in d]\r\n\r\n# Calculate the volume fraction of orange juice in the final drink.\r\nprint(sum(p)/n)", "n = int(input())\r\nfractions = list(map(int, input().split()))\r\naverage_fraction = sum(fractions) / n\r\nprint(\"{:.9f}\".format(average_fraction))\r\n", "n = int(input())\r\nper = list(map(int, input().split()))\r\nt = sum(per)\r\navg = t / n\r\nprint(avg)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = sum(l)\r\nc = s / n\r\nprint(c)\r\n", "n = int(input())\r\na = list( map(int,input().split()))\r\nfor i in range(0,n): \r\n s = sum(a)\r\n d = s/n\r\n f = round(d,12)\r\nprint(f)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx = n #cocktail's volume\r\nsuma = 0 #volume of pure juice\r\n\r\nfor i in range(n):\r\n suma += l[i] / 100\r\n\r\nprint((suma/x)*100)\r\n", "a=int(input()); b=sum(list(map(int,input().split()))); print((b*100)/(a*100)) ", "N=int(input())\r\nP=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(N):\r\n\tsum+=P[i]\r\nAns=sum/N\r\nformat=\"{:.12f}\".format(Ans)\r\nprint(format)", "\r\nn = int(input())\r\nfractions = list(map(int, input().split()))\r\ntotal_volume = sum(fractions)\r\ncocktail_fraction = total_volume / n\r\nprint(\"{:.12f}\".format(cocktail_fraction))\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nt=sum(p)\r\na=t/n\r\nres=a/100\r\nprint(\"{:.12f}\".format(res*100))", "n = int(input())\r\np = list(map(int, input().split()))[:n]\r\nx = 100 / n\r\npercentage = 0\r\nfor i in p:\r\n if i != 0:\r\n percentage += x / (100 / i)\r\nprint('%.12f' %percentage)", "n = int(input())\r\nline = input().split()\r\na = []\r\nfor i in range(n):\r\n a.append(int(line[i]))\r\nprint(sum(a)/n)", "n = int(input())\r\narr = list(map(int, input().strip().split(\" \")))\r\n\r\nprint(sum(arr) / len(arr))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx= sum(l)\r\nans=sum(l)/len(l)\r\nprint(ans)", "n = int(input())\nl = list(map(int,input().split()))\nk = sum(l)/n\nprint(round(k,6))\n# Tue Jul 04 2023 11:01:51 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\narr = map(int, input().split())\nprint(f\"{(sum(arr)/n):.12f}\")\n\n\t \t \t\t\t \t \t\t \t\t\t\t\t \t \t \t\t \t", "input() \r\nsum = 0\r\ndrinks = input().split()\r\nfor drink in drinks:\r\n sum += int(drink)\r\n\r\nprint(sum/len(drinks))", "n = int(input())\r\nli = list(map(int, input().split()))\r\nprint(sum(li) / n)", "x = int(input())\nl = list(map(int,input().split()))\ns = sum(l)\nprint('%.12f' %float(s/x))\n\t \t \t \t\t\t \t\t\t \t\t \t\t\t \t\t \t", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=0\r\nfor i in a:\r\n s+=i/100\r\nprint((s/n)*100)\r\n", "# Input\r\nn = int(input()) # Number of drinks\r\npercentages = list(map(int, input().split())) # Volume fractions of orange juice in each drink\r\n\r\n# Calculate the weighted average\r\ntotal_volume = sum(percentages)\r\naverage_percentage = total_volume / n\r\n\r\n# Output the result\r\nprint(average_percentage)\r\n", "x=int(input())\r\na=list(map(int,input().split()))\r\nc=sum(a)\r\nprint(c/x)\r\n", "n=int(input())\r\nlist1=list(map(int,input().strip().split()))[:n]\r\nsum1=sum(list1)\r\nprint(\"{0:.12f}\".format(sum1/n))", "n = int(input())\r\ntotal = 100*n\r\norange = sum([int(x) for x in input().strip().split()])\r\nprint(orange/n)", "N=int(input())\nA=[int(x) for x in input().split()]\nprint(sum(A)/N)\n \t \t \t\t \t\t \t\t \t \t \t\t", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\npercent = sum(s)/len(s)\r\nprint('{:.9f}'.format(percent))\r\n\r\n", "\r\nnumber_juice = int(input())\r\nvolume_fraction = [*map(int,input().split())] \r\nvolum_fraction = 0\r\nfor i in volume_fraction:\r\n volum_fraction = volum_fraction + (i/100)\r\nprint((volum_fraction/number_juice)*100) \r\n\r\n ", "n=int(input())\r\na=list(map(int,input().split())) \r\ntotal=sum(a) \r\navg=total/n \r\nprint(format(avg,\".12f\"))\r\n", "n = int(input())\r\nsum = 0\r\nnumbers = list(map(int, input().split()))\r\nfor i in numbers:\r\n sum += i\r\nprint(float(sum / n))", "num = int(input()) \r\n\r\nList = list ( map ( int, input().split(\" \") ) )\r\n\r\nprint(sum(List)/num)", "n=int(input())\r\nl=list(map(float,input().split()))\r\nprint(sum(l)/n)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=0\r\nvf=0\r\nfor i in range(0,len(l)):\r\n\tt+=1\r\n\tvf+=l[i]/100\r\n\t\r\nprint(vf/t*100)", "a=int(input())\r\nb=input().split()\r\nc=[int(i) for i in b]\r\nprint((sum(c)/(a*100))*100)\r\n", "n=int(input())\r\np=list(map(int,input().split(' ')))\r\nprint(sum(p)/n)", "n = int(input())\r\nlistper = list(map(int,input().split()))\r\nprint(f'{(sum(listper)/(100*n)) * 100:.12f}')", "def c_o_j_f(n, p):\r\n t_p = sum(p)\r\n f = t_p / n\r\n return f\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nr = c_o_j_f(n, p)\r\nprint(f\"{r:.9f}\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ntot=sum(l)\r\nres=tot/n \r\nprint(res)", "n=int(input())\r\nsu=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n su += i/100\r\nprint((su/n)*100)", "n = float(input())\r\na = map(float, input().split())\r\nprint(sum(a) / n)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\n# Calculate the volume fraction of orange juice in the final drink\r\ntotal_percentage = sum(percentages)\r\nfinal_percentage = total_percentage / n\r\n\r\n# Print the result with 12 decimal places\r\nprint(f'{final_percentage:.12f}')", "n=int(input())\r\nls=list(map(int,input().split()))\r\nk=sum(ls)\r\nprint(k/len(ls))", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc = sum(b)\r\nprint(f\"{c/a:.4f}\")", "n = int(input())\r\ns = list(map(int,input().split()))\r\nsum = 0\r\nfor i in s:\r\n sum = sum + i\r\nprint(sum/n)", "# Read the number of drinks\r\nn = int(input())\r\n\r\n# Read the volume fractions of orange juice in each drink\r\nfractions = list(map(int, input().split()))\r\n\r\n# Calculate the total volume of orange juice\r\ntotal_orange_juice = sum(fractions)\r\n\r\n# Calculate the total volume of the cocktail\r\ntotal_volume = n * 100\r\n\r\n# Calculate the volume fraction of orange juice in the cocktail\r\npercentage_orange_juice = (total_orange_juice / total_volume) * 100\r\n\r\n# Output the result with precision\r\nprint(\"{:.9f}\".format(percentage_orange_juice))\r\n", "def main():\r\n no_of_drinks = int(input())\r\n drinks_percent = list(map(int, input().split()))\r\n numerator = sum(drinks_percent)\r\n denominator = float(no_of_drinks)\r\n fraction = numerator / denominator\r\n print(fraction)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s=s+l[i]\r\nprint(s/n)", "a = int(input())\nb = list(map(int, input().split())) \nlim = 0\nfor i in range(a):\n lim += b[i]/100\nprint(lim/a*100)\n# Tue Jul 04 2023 11:27:14 GMT+0300 (Moscow Standard Time)\n", "n, s = int(input()), list(input().split())\r\nsm = 0\r\n\r\nfor i in range(n):\r\n sm += int(s[i])\r\n\r\nprint(sm/ len(s))", "n=int(input())\r\nli=list(map(int,input().split()))\r\ni=0\r\nsum=0\r\nwhile i<n:\r\n sum+=li[i]\r\n i+=1\r\nprint(((sum/100)/n)*100)", "n = int(input())\r\n\r\np = list(map(int, input().split()))\r\n\r\nx = 0\r\n\r\nfor i in range(n):\r\n x = float(x+(p[i-1]/100))\r\n\r\nprint(float((x/n)*100))", "inverse_input = 1 / float(input())\r\nnumbers = list(map(int, input().split()))\r\nresult = inverse_input * sum(numbers)\r\nprint(result)\r\n", "n = int(input());\n\nobjects = list(map(int,input().split()));\n\njuice = 0;\nmass = len(objects) * 100;\n\nfor i in range(len(objects)):\n juice += objects[i];\n \nprint(100 / mass * juice);\n# Tue Jul 04 2023 15:11:56 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nm=list(map(int, input().split()))\r\nprint(((sum(m)/100)/n)*100)\r\n", "n = int(input())\r\nfractions = list(map(int,input().split()))\r\ntotal = sum(fractions)\r\naverege = total / n\r\nprint(format(averege,'.10f'))", "n=int(input())\r\nsum=0\r\nli=[int(x) for x in input().split()]\r\nfor i in range(0,len(li)):\r\n li[i]=li[i]/100\r\n sum+=li[i]\r\nprint((sum/n)*100) ", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in a:\r\n sum+=(1/100)*i\r\nprint((sum/n)*100)", "n = int(input())\np = list(map(int, input().split()))\nV = 0\nx = 0\nfor i in range(len(p)):\n V += p[i]\nx = V/n\nprint(x)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\navg_fraction = sum(percentages) / n\r\nprint(\"{:.9f}\".format(avg_fraction))", "n = int(input())\r\nd = input().split()\r\np = [int(x) for x in d]\r\n\r\nprint(sum(p)/n)", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = 0 \r\nfor i in a :\r\n s+=i\r\nprint(((s/100)/n)*100)", "n = int(input())\r\nnums = list(map(int,input().split()))\r\n\r\nprint(sum(nums) / n)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\np_avg = sum(p) / n\r\np_final = round(p_avg, 4)\r\n\r\nprint(p_final)\r\n", "print(1/int(input()) * sum(map(int, input().split())))", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in a:\r\n s+=i/100\r\nprint(\"{:.12f}\".format((s/n)*100))", "n=int(input())\r\nls=list(map(int,input().split()))\r\nprint((sum(ls))/n)", "n = int(input())\r\na = [int(x) for x in input().split(\" \")]\r\nt = 0\r\nfor i in a:\r\n t += i\r\n\r\nprint(round(t / n, 7))", "t=int(input())\r\nn=map(int, input().split())\r\nx=sum(n)\r\nprint(x/t)", "n = int(input())\nl = list(map(int, input().split()))\nans = sum(l)/n\nprint(f\"{ans:.12f}\")", "n=int(input())\r\nper=list(map(int,input().split()))\r\nsum_per=sum(per)\r\nprint(round(sum_per/(n),12))", "n=int(input())\r\nA=list(map(int, input().split()))\r\no_juice=0\r\nfor i in range(len(A)):\r\n o_juice+=A[i]\r\n\r\nper=(o_juice/(n))\r\n\r\nprint(per)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sum(a)/(n*100)\r\nprint(b*100)\r\n", "n = int(input())\r\nper = list(map(int, input().split()))\r\nsum = sum(per[i] / 100 for i in range(n))\r\nresult = (sum / n) * 100\r\nprint(result)", "n = int(input())\r\nk = [int(x) for x in input().split()]\r\nvol = 0\r\nfor i in k: \r\n vol = vol+i\r\n\r\nans = vol/(n)\r\nprint(ans)\r\n", "def solve(l):\r\n return sum(l) / len(l)\r\nn = int(input())\r\nprint(solve(list(map(int,input().split()))))\r\n", "x=int(input())\r\nl = list(map(int,input('').split()))\r\n\r\n\r\nprint((sum(l))/x)", "from decimal import *\r\ngetcontext().prec = 12\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nprint(Decimal(sum(m))/Decimal(len(m)))", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nvol_of_pure_juice = sum(p)\r\nprint(vol_of_pure_juice/n)\r\n", "n = int(input())\r\ndrink = 0\r\ndrugs = list(map(int, input().split()))\r\nfor i in drugs:\r\n drink += i/n\r\n\r\nprint(drink)", "x = int(input())\r\ny = list(map(int, input().split()))\r\nresult = sum(y) / x\r\nprint(result)\r\n", "n = int(input())\r\nfractions = list(map(int, input().split()))\r\n\r\n# Calculate the total proportion of orange juice in all drinks\r\ntotal_proportion = sum(fractions)\r\n\r\n# Calculate the weighted average\r\ncocktail_fraction = total_proportion / n\r\n\r\nprint(cocktail_fraction)\r\n", "if __name__ == \"__main__\":\r\n b = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n sol = sum(a) / b\r\n print(\"{:.12f}\".format(sol))", "n=int(input())\r\njuice=input().split()\r\nx=0\r\nfor i in range(n):\r\n x=x+int(juice[i])/100\r\ny=x/n*100\r\nprint(y) ", "i = int(input())\r\nx = list(map(int, input().split()))\r\ntotal = 0\r\nfor item in x:\r\n total += item\r\n \r\nprint(float(total/i))\r\n \r\n", "n11 = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ntotal_volume11 = sum(percentages) # Total volume of all the drinks\r\ncocktail_percentage = total_volume11 / n11 # Calculate the average percentage\r\n\r\nprint(cocktail_percentage)\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nsum=0\r\nfor i in p:\r\n sum+=i\r\nprint(sum/n)", "n = int(input())\r\nls = list(map(int,input().split()))\r\nprint(sum(ls)/n)", "s = input()\r\nn = input().split(' ')\r\nm = list(map(int, n))\r\nprint(sum(m)/int(s))\r\n", "n=int(input())\r\np = list(map(int,input().split()))\r\nprint(sum(p)/n)", "k = int(input())\r\na = list(map(int,input().split()))\r\nprint(sum(a)/k)\n# Tue Jul 04 2023 11:28:19 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\ni=list(map(float,input().split()))\r\nc=sum(i)/n\r\nprint(c)", "_=int(input())\r\n__=[]\r\n____=0\r\n________________________ = [__.append(int(___)) for ___ in input().split()]\r\nfor ___ in __:\r\n ____=____+___/100\r\nprint(____/_*100)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ntotal_percentage = sum(percentages)\r\naverage_percentage = total_percentage / n\r\n\r\nprint(f\"{average_percentage:.10f}\")\n# Tue Jul 04 2023 17:02:16 GMT+0300 (Moscow Standard Time)\n\n# Tue Jul 04 2023 17:02:21 GMT+0300 (Moscow Standard Time)\n", "def main():\r\n n = int(input())\r\n values = list(map(int, input().split())) # Read space-separated integers\r\n\r\n sum_values = sum(values)\r\n average = sum_values / n\r\n print(\"{:.6f}\".format(average))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ntotal = 0\r\nx = [int(x) for x in input().split(\" \")]\r\n\r\nfor i in range (n) :\r\n total += x[i]\r\n\r\nprint(total/n)", "n=int(input())\r\nlist=list(map(int,input().split()))\r\nlist_sum=sum(list)\r\nprint(list_sum/n)", "n = int(input())\np = [int(x) for x in input().split()]\n\norange_juice = sum(p) / (n * 100)\norange_juice *= 100\n\nprint(orange_juice)\n \t\t \t\t\t \t\t\t\t\t \t \t\t\t\t\t \t\t", "b=int(input())\r\nl=list(map(int,input().split()))\r\nd=0\r\nfor i in l:\r\n d+=i\r\nprint(d/(b))", "n = int(input())\r\nl = input()\r\ntotal = 0\r\nlist1= l.split(\" \")\r\nfor i in list1:\r\n total+= int(i)\r\ntotal = float(total)\r\nprint(total/n)\r\n\r\n", "juices = int(input())\r\namount = input().split(\" \")\r\nfor i in range(len(amount)):\r\n amount[i] = int(amount[i])\r\nsub = 0\r\nfor i in amount:\r\n sub += i\r\nfraction = sub/juices\r\nprint(f'{fraction:.12f}')\r\n", "n = int(input())\r\nl = [int(_) for _ in input().split()]\r\nx = 0\r\nfor i in l:\r\n x += (i/100)\r\nprint((x/len(l))*100)", "n = int(input())\nprc = list(map(int, input().split(' ')))\n\nresult = 0\nfor p in prc:\n result = result + p\nprint(result/n)\n\n\n# n = int(input())\n# if n % 2 == 0:\n# print(int(n / 2))\n# else:\n# print(int((n + 1) / -2))\n###############################\n# test_caseses = int(input())\n# for _ in range(test_caseses):\n# count = int(input())\n# step = 0\n# edge_list = []\n# drawn = set()\n# drawn.add(1)\n# for _ in range(count-1):\n# edge_list.append(list(map(int, input().split(' '))))\n\n# while True:\n# if len(drawn) >= count:\n# print(step)\n# break\n# for val in edge_list:\n# isFirst = val[0] in drawn\n# isSecond = val[1] in drawn\n# if isFirst and not isSecond:\n# drawn.add(val[1])\n# else:\n# if isSecond and not isFirst:\n# drawn.add(val[0])\n# step +=1", "n = int(input())\r\nlist = list(map(int,input().split()))\r\nresult = sum(list)/n\r\nprint(result)\r\n\r\n", "# 200B - Drinks\r\n# https://codeforces.com/problemset/problem/200/B\r\n\r\n# Inputs:\r\n# 1) Número de bebidas\r\n# 2) % de jugo de naranja en cada bebida\r\nbebidas = int(input())\r\nporcentaje_jugo_bebidas = list(map(int, input().split()))\r\n\r\n# Saca el promedio de los porcentajes de jugo de naranja de las bebidas\r\nporcentaje_jugo_mezcla = sum(porcentaje_jugo_bebidas)/len(porcentaje_jugo_bebidas)\r\nprint(porcentaje_jugo_mezcla)", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=a[i]/100\r\nprint(format(s/n*100,\".5f\"))", "n = input()\r\nj = input().split(\" \")\r\na = 0\r\nfor i in j:\r\n a += int(i)\r\n\r\nprint(a/len(j))\r\n", "n=int(input())\r\nlst=[int(i) for i in input().split()]\r\nprint(sum(lst)/n)", "n = int(input())\r\ns = list(map(int,input().split()))\r\nprint((sum(s))/n)", "n = int(input())\r\ntotal = sum(list(map(int, input().split())))\r\nprint(total / n)", "x = int(input())\r\ny = list(map(int, input().split()))\r\ns = 0\r\n\r\nfor i in y:\r\n \r\n s = s + (i/100)\r\n \r\nprint((s/x)*100)", "n = int(input())\nans = sum(list(map(int, input().split())))/100\nprint((ans / n) * 100)", "size=int(input())\r\nres=list(map(int,input().split()))\r\ntot=sum(res)\r\nprint(tot/size)", "n=int(input())\r\nmy_str=input()\r\na=my_str.split()\r\nsum1=0\r\n\r\nfor i in range(n):\r\n sum1 += int(a[i])\r\n\r\nprint(sum1/n)", "def calculate_orange_cocktail_volume_fraction(n, percentages):\r\n total_percentage = sum(percentages)\r\n cocktail_volume_fraction = total_percentage / n\r\n return cocktail_volume_fraction\r\n\r\n\r\nn = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\n\r\nresult = calculate_orange_cocktail_volume_fraction(n, percentages)\r\nprint(result)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nprint(sum(arr)/n)\r\n", "d = int(input())\r\nnum = list(map(int,input().split()))\r\nprint(\"{:.12f}\".format(sum(num)/d))", "#https://codeforces.com/problemset/problem/200/B\r\n\r\nnumber_orangeDrinks = int(input())\r\nvolumeFraction_list = [int(x) for x in input().split(\" \")]\r\nprint(sum(volumeFraction_list)/(number_orangeDrinks))\r\n", "n = int(input())\r\nt = list(map(int,input().split()))\r\ns = sum(t)\r\np = 100*n\r\n\r\n \r\nprint(s/p*100)", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\ntotal_orange_juice = sum(volume_fractions)\r\ntotal_cocktail_volume = n * 100 \r\nvolume_fraction_in_cocktail = (total_orange_juice / total_cocktail_volume) * 100\r\nprint(\"{:.9f}\".format(volume_fraction_in_cocktail))\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nresult = 0\r\nfor i in range(len(lst)):\r\n result += lst[i]\r\nprint(round(result/n,12))", "n=int(input())\r\ns=input()\r\nl=[]\r\ns=s.split()\r\nl=list(s)\r\nt=[]\r\nfor i in range(0,len(l)):\r\n l[i]=int(l[i])\r\nfor i in range(0,len(l)):\r\n x=l[i]/100\r\n t.append(x)\r\ntotal=sum(t)\r\nres=total/n\r\nres=res*100\r\n\r\nprint(res)", "def main(): \r\n n,*a=map(int, open(0).read().split())\r\n print(sum(a)/n) \r\n\r\nmain()", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=sum(b)\r\nprint(c/a)", "n = int(input())\r\np = input().split()\r\nfor i in range(len(p)):\r\n p[i]=int(p[i])\r\nprint(sum(p)/n)", "N = int (input())\r\nJuices = input().split()\r\nJuices = [int(juice) for juice in Juices]\r\ntotal_orange = 0\r\nfor i in range(0,N):\r\n total_orange = total_orange + Juices[i]\r\norange = total_orange/N\r\nprint(orange)", "n = int(input())\r\np = list(map(int, input().split()))\r\na = sum(p) / n\r\nprint('{:.12f}'.format(a))", "a=int(input())\r\narr=list(map(int,input().split()))\r\nn=sum(arr)/a\r\nprint(n)\r\n", "n = int(input())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nprint(sum(s) / n)\r\n", "n = int(input())\r\nb = input().split()\r\ncounter = 0\r\nfor i in range(len(b)):\r\n b[i] = int(b[i])\r\nfor i in b:\r\n counter += i\r\nprint(counter/n)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ntotal = 0\r\nfor i in range(n):\r\n a = l[i]/100\r\n total+=a\r\nprint(float(total*100/n))", "n = int(input())\np = list(map(int,input().split()))\n\ntp = sum(p)\nap = tp /n\nprint(\"{:.12f}\".format(ap))", "N = int(input())\nnumbers = input().split()\nsoma = 0\nfor item in numbers: \n soma += (int(item)/100)\nresultado = \"{:.12f}\".format(round((soma/N)* 100, 12))\nprint(resultado)\n\n\n \t\t \t \t \t\t \t\t\t \t \t \t\t\t\t \t", "y=int(input())\r\ns=0\r\nlis=list(map(int,input().split()))\r\nfor i in lis:\r\n s+=i/100\r\nprint((s/y)*100)", "n=int(input())\r\nS=0\r\npi=list(input().split(\" \"))\r\nfor i in range (0,n) :\r\n S=int(pi[i])+S\r\nK=S/n\r\nprint(K)\r\n \r\n\r\n\r\n", "# Drinks Difficulty:800\r\nn = int(input())\r\nconcentration = list(map(int, input().split()))\r\nvolume = 0\r\nfor i in range(len(concentration)):\r\n volume += concentration[i]\r\nprint(\"%.12f\" % (volume/n))\r\n", "t = int(input())\r\nd = list(map(int,input().split()))\r\nx = 0\r\nfor i in d:\r\n x+= i/100\r\nprint(x/t * 100)\r\n\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 2 17:33:41 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nn=int(input())\r\nlist1=input().split()\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+int(list1[i])\r\nprint(sum/n)", "def calculate_orange_juice_volume_fraction(volume_fractions):\r\n \"\"\"Calculates the volume fraction of orange juice in a cocktail made from drinks with the given volume fractions.\r\n\r\n Args:\r\n volume_fractions: A list of floats representing the volume fractions of orange juice in the individual drinks.\r\n\r\n Returns:\r\n A float representing the volume fraction of orange juice in the final cocktail.\r\n \"\"\"\r\n\r\n sum_of_volume_fractions = 0.0\r\n for volume_fraction in volume_fractions:\r\n sum_of_volume_fractions += volume_fraction\r\n\r\n num_drinks = len(volume_fractions)\r\n average_volume_fraction = sum_of_volume_fractions / num_drinks\r\n\r\n return average_volume_fraction\r\n\r\n\r\ndef main():\r\n \"\"\"Calculates the volume fraction of orange juice in Vasya's cocktail.\"\"\"\r\n\r\n num_drinks = int(input())\r\n volume_fractions = list(map(float, input().split()))\r\n\r\n average_volume_fraction = calculate_orange_juice_volume_fraction(volume_fractions)\r\n\r\n print(average_volume_fraction)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\nitr = int(input())\nl = list(map(int, input().split()))\nl = (x/100 for x in l)\nprint((sum(l)/itr)*100)\n", "import math\na = int(input())\nb = [int(j) for j in input().split()]\nc = sum(b)\nprint(round(c / a, 10 ** 4))\n# Wed Jul 05 2023 22:05:13 GMT+0300 (Moscow Standard Time)\n", "k = 0\r\nn = int(input())\r\ns = list(map(int, str(input()).split()))\r\nfor i in range(n):\r\n k+=s[i]\r\nprint(k/n)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tc=c+(l[i]/100)\r\nprint((c/n)*100)", "n=int(input())\r\np=sum(map(int,input().split()))\r\nprint(p/n)", "n = int(input())\r\ntotal = 0\r\nres = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n percent = res[i]\r\n total += percent / 100\r\nprint(total / n * 100)", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nans = 0.0\r\n\r\nfor orange in arr:\r\n ans+=orange\r\nans/=n\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = sum(a)\r\nans = s / n\r\n\r\nprint(\"{:.12f}\".format(ans))\r\n", "t=int(input())\r\nx=list(map(int,input().split()))\r\nb=sum(x)\r\na=len(x)\r\nc=\"{:.12f}\".format(b/a)\r\nprint(c)", "n = int(input())\r\ns = []\r\nsumma = 0\r\nfor i in input().split():\r\n s.append(int(i))\r\n summa += int(i)\r\nprint(summa/n)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\n# Calculate the weighted average\r\nweighted_sum = sum(percentages[i] for i in range(n))\r\nresult = weighted_sum / n\r\n\r\nprint(\"{:.9f}\".format(result))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 10:41:28 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nn = int(input())\r\np = list(map(int,input().split()))\r\nprint(sum(p)/n)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\ns=0\r\nfor i in l1:\r\n s+=i\r\nprint(s/(len(l1)))", "n = int(input())\r\np = list(map(int, input().split()))\r\nSum = 0\r\nfor num in p:\r\n Sum += num\r\nprint(Sum/n)", "n = int(input())\r\n\r\nmylist = list(map(int,input().split()))\r\n\r\nprint(sum(mylist) / n)", "\r\nn = int(input()) \r\npi = list(map(int, input().split())) \r\n\r\naverage_pi = sum(pi) / n\r\n\r\nprint(\"{:.12f}\".format(average_pi))\r\n", "n=int(input())\r\nx=input().split()\r\ny=[]\r\nm=0\r\nv=0\r\nfor i in x:\r\n if i == 0:\r\n continue\r\n y.append(i)\r\nfor i in y:\r\n m+=int(i)\r\n v+=1\r\nprint(m/v)", "a = int(input())\r\nnp = input().split()\r\nnp = list(map(int, np))\r\nprint(sum(np)/len(np))", "n=int(input())\r\nnumbers = list(map(int,input().split(' ')))\r\nsumma=0\r\nfor item in numbers:\r\n summa += item/100\r\n\r\nanswer = (summa/n)*100\r\nprint(answer)", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\ntp = sum(p)\r\nap = tp/ n\r\n\r\nprint(ap)\r\n", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nprint((sum(s)/(n*100))*100)", "a = int(input())\r\nsum = 0\r\nb = list(map(int, input().split()))\r\nfor i in range(a):\r\n sum+=b[i]\r\nprint(sum/a)", "a = int(input())\r\nm = [int(i) for i in input().split()]\r\nprint(sum(m)/(len(m)))\r\n \r\n", "n = int(input())\r\npi = list(map(int, input().split()))\r\ntotal_orange_juice = sum(pi)\r\nfraction_in_cocktail = (total_orange_juice / (n * 100)) * 100\r\nprint(f'{fraction_in_cocktail:.10f}')", "import math\r\n\r\n\r\ndef inp(): # int inputs\r\n return (int(input()))\r\n\r\n\r\ndef inlt(): # list inputs\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr(): # string inputs\r\n s = input()\r\n return (list(s[:len(s)]))\r\n\r\n\r\ndef invr(): # space sepreated intergel varibales\r\n return (map(int, input().split()))\r\n\r\nturns = int(input())\r\nline = inlt()\r\n\r\ntotal_vol = sum(line)\r\ntotal = 100 * len(line)\r\n\r\nprint((total_vol / total) * 100)", "n = int(input())\r\nList = [int(x) for x in input().split()]\r\nsum = 0;\r\nfor x in List:\r\n sum += x\r\n\r\nresult = float(sum/n)\r\nprint(\"%.12f\"%result)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ns = sum(lst)\r\nx = s/n\r\nprint(round(x, 12))", "#Drinks\r\nn = int(input())\r\ndrinks = [int(i) for i in input().split()]\r\nsuma=0\r\n\r\nfor i in drinks: suma+=i\r\nsuma = suma/n\r\nprint(suma)\r\n", "\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nvolume = list(map(int,input().split()))\r\n\r\nprint((sum(volume))/n)\r\n", "n = int(input())\na = 0\nfor i in input().split():\n a+= int(i)/n\nprint(a)\n", "a=int(input())\nlist1=list(map(int,input().split()))\nsum=0\nfor i in list1:\n sum=sum+(i/100)\nprint((sum/a)*100)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=0\r\nfor i in range(n):\r\n k=k+(l[i]/100)\r\nprint((k/n)*100)", "f=0;i=0\r\nt=int(input())\r\nn=list(map(int,input().split()))\r\nfor i in range(0,t,1):\r\n f+=(n[i]/100)\r\nprint((f/t)*100)", "n=int(input())\r\ns = list(map(int, input().split()))\r\nsum=0\r\nfor i in s:\r\n sum=sum+i\r\nprint(sum/n)", "n=int(input())\r\nlst=list()\r\nsum=0\r\n\r\nst=input()\r\nlst=st.split(\" \")\r\nfor i in range(n):\r\n lst[i]=int(lst[i])\r\n sum+=lst[i]\r\n\r\nprint(sum/n)\r\n", "t = int(input())\r\nx = input().split()\r\nx = [int(i) for i in x]\r\nprint(sum(x) / t)\r\n", "n = int(input())\r\np = input().split()\r\nsum = 0\r\nfor i in range(n):\r\n sum += int(p[i])\r\nans = sum / n\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n \r\nt=sum(a)\r\nr=t/n\r\nprint(\"{:.12f}\".format(r))", "n = input()\r\narr = list(map(int, input().split()))\r\nc = 0\r\nfor i in arr:\r\n c+=i\r\nprint(c/int(n)) ", "n=int(input(\"\"))\r\na=0\r\nl=[]\r\n\r\nno=input(\"\")\r\nspl=no.split()\r\nl=[int(i) for i in spl]\r\nfor i in range(len(l)):\r\n a=a+l[i]/100\r\nprint((a/n)*100)", "n = int(input()) * 100\r\na = list(map(int, input().split()))\r\nans = (sum(a) / n) * 100\r\nprint(f'{ans:.12f}')\r\n", "summ = 0\r\nx = int(input())\r\nc = list(map(int, input().split()))\r\nprint(sum(c) / x)", "n = int(input())\nstr_input = input().split()\nlist_input = [int(x) for x in str_input] \n\nsum_vol = 0\n\nfor x in list_input:\n\tsum_vol += x\n\nprint(sum_vol/n)", "x=int(input())\r\ny=list(map(int,input().split())) \r\nc=0\r\na=sum(y)\r\nprint(a/x)", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s = s + a[i]\r\nr = s/(n*100)\r\nprint(r*100)", "input()\r\nx = [int(i) for i in input().split()]\r\nprint((sum(x)/len(x)))", "n = int(input())\r\ndrinks = list(map(int,input().split()))\r\nprint(format(sum(drinks)/n,'.12f'))\r\n ", "n = int(input())\r\npercents = [float(elem) for elem in input().split()]\r\nprint(sum(percents) / len(percents))", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\ns = sum(nums)\r\nprint(s / n)", "numberOfDrinks=float(input())\r\ntotal=input().split(\" \")\r\nthePercentages=[float(number) for number in total]\r\n\r\nprint(sum(thePercentages)/numberOfDrinks)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\n# Calculate the weighted sum of percentages\r\nweighted_sum = sum(percentages) / 100.0\r\n\r\n# Calculate the volume fraction in the cocktail\r\ncocktail_percentage = (weighted_sum / n) * 100\r\n\r\nprint(\"{:.12f}\".format(cocktail_percentage))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nsuma = sum(l)\r\nprint(suma/(n))", "n = int(input())\r\ns = input().split()\r\nlst = [int(i) for i in s]\r\na = sum(lst)\r\nprint(a/n)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=0\r\ny=1\r\nfor i in l:\r\n x+=(i/100)*y\r\nprint(round((x/n)*100,5))", "n = input()\r\nb = input()\r\np = \"\"\r\ncount = 0\r\ntotal = 0\r\nwhile count < len(b):\r\n if b[count] != \" \":\r\n p = p + b[count]\r\n else:\r\n total = total + int(p)\r\n p = \"\"\r\n count = count + 1\r\ntotal = total + int(p)\r\nprint(total / int(n))\r\n", "n =int(input())\r\n\r\ndrink = list(map(int, input().split()))\r\nproportion = []\r\n\r\nfor x in drink:\r\n if x == 0:\r\n proportion.append(0)\r\n\r\n else:\r\n proportion.append(x/100)\r\n\r\ntotal = 0\r\nfor y in proportion:\r\n total += y\r\n\r\nprint((total / n) * 100)\r\n \r\n \r\n\r\n# lambda 파이썬에서 익명 함수(anonymous function)를 만들기 위해 사용되는 특별한 형태의 함수\r\n# 이름이 없는 함수\r\n# 주로 간단한 연산이나 함수를 한 줄로 표현할 때 사용\r\n# lamda argument: return 표현\r\n\r\n'''\r\n람다 는 람다 대(대신하나의 대)수, lambda calculus 에서 나온 것!\r\n함수의 정의와 함수의 적용을 간단한 기호로 나타내는 형식 체계\r\n함수형 프로그래밍 스타일을 쉽게 구현할 수 있고,\r\n간결하고 가독성 있는 코드 작성을 도와준다.\r\n\r\nlambda x: int(1/(x/100))\r\n이 부분 0들어오면 에러남 -> 함수로 만들어주기\r\n'''\r\n", "n = int(input())\r\nv = input().split()\r\nfor i in v:\r\n v[v.index(i)]=int(v[v.index(i)])\r\nsum = 0\r\nfor i in v:\r\n sum += i\r\nprint(sum/n)\r\n", "a=int(input())\r\nli=list(map(int,input().split()))\r\nk=sum(li)\r\nk=k/100\r\nprint((k/a)*100)", "n=int(input())\r\np=list(map(int, input().split()))\r\ntot_per=sum(p)\r\navg_per=tot_per/n\r\nres=avg_per/100\r\nprint(\"{:.12f}\".format(res* 100))\r\n", "a=int(input())\r\nb=input().split()\r\nc=[int(x) for x in b]\r\nprint(sum(c)/a)\r\n ", "n = int(input())\r\np = tuple(map(int,input().split()))\r\nprint(sum(p)/n)", "n = int(input())\nP = list(map(int, input().split()))\n\nprint((sum(P)/(100 * len(P))) * 100)\n\n \t\t\t\t\t\t \t\t \t\t\t \t \t\t\t", "n=int(input())\r\np=list(map(int,input().split()))\r\ntotalvolume=0\r\nfor i in range(n):\r\n totalvolume+=p[i]*0.01\r\nprint((totalvolume/n)*100)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nsumm =0\r\nfor i in l:\r\n summ += i\r\nprint(summ/n)", "result = 1 / int(input())\r\nnumbers = list(map(int, input().split()))\r\nsum_of_numbers = sum(numbers)\r\nfinal_result = result * sum_of_numbers\r\nprint(final_result)\r\n", "n = int(input())\r\ns = sum([int(_) for _ in input().split()])\r\nprint(s/n)", "n=int(input())\r\narr=list(map(int, input().strip().split()))\r\nprint(sum(arr)/n)", "i=int(input())\r\nl=list(map(int,input().split()))\r\nm=sum(l)\r\nprint(m/i)", "n=int(input())\r\norange=[int(x) for x in input().split()]\r\ntotal_ora=0\r\nfor i in orange:\r\n total_ora+=i\r\nfraction=total_ora/n\r\nprint(f\"{fraction:.12f}\")\r\n", "n = int(input())\r\nn1 = list(map(int, input().split()))\r\nprint(sum(n1)/len(n1))", "def average_percentage(drinks, n):\r\n total_percentage = sum(drinks)\r\n return total_percentage / n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n drinks = list(map(int, input().split()))\r\n average = average_percentage(drinks, n)\r\n print(\"{:.12f}\".format(average))\r\n", "n = int(input())\r\na = str(input())\r\na = a.split()\r\nfor i in range(len(a)) :\r\n a[i] = int(a[i])\r\nprint(sum(a)/n)", "n=int(input())\r\ndrink=list(map(int,input().split()))\r\norange=0\r\nfor i in range(0,n):\r\n orange=orange+drink[i]\r\n\r\nprint(orange/n)\r\n", "n=int(input())\r\np=list(map(int, input().split()))\r\n\r\nf=sum(p)\r\nz=f/n\r\n\r\nprint(round(z, 10))\n# Tue Jul 04 2023 11:48:09 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nsum = 0\r\nlst = list(map(int,input().split()))\r\nfor i in range(n):\r\n sum += lst[i]\r\nprint(\"%6f\" % (sum/n))", "n=int(input())\r\nprint(sum(int(e) for e in input().split())/n)", "num = int(input())\r\na = input().split(\" \")\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n\r\nprint(sum(a)/(num*100)*100)\r\n", "quantity_of_oranges = int(input())\nall_juice = list(map(int, input().split(' ')))\na = sum(all_juice)\nprint(a / quantity_of_oranges)\n\n", "def orange_cocktail_fraction(n, fractions):\r\n total_fraction = sum(fractions)\r\n average_fraction = total_fraction / n\r\n return average_fraction\r\n\r\n# Read input\r\nn = int(input())\r\nfractions = list(map(int, input().split()))\r\n\r\n# Calculate and print the result\r\nresult = orange_cocktail_fraction(n, fractions)\r\nprint(result)\r\n", "a = int(input())\r\n\r\nb = list(map(int,input().split()))\r\ncou = 0\r\nfor i in b:\r\n cou+=i\r\n\r\nprint(cou/a)", "n = int(input())\nprint(sum(list(map(int, input().split())))/n)", "def calculateVolumeFraction(n, fractions):\r\n total_fraction = sum(fractions)\r\n average_fraction = total_fraction / n\r\n return average_fraction\r\n\r\n# Read the input\r\nn = int(input().strip())\r\nfractions = list(map(int, input().strip().split()))\r\n\r\n# Call the function and print the result\r\nresult = calculateVolumeFraction(n, fractions)\r\nprint(result)\r\n", "n = int(input())\r\nper = list(map(int, input().split()))\r\ntp = sum(per)\r\nap = tp / n\r\nprint(ap)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\npct = 0\r\nfor element in lst:\r\n pct += (element/100)\r\nprint(pct/n*100)", "n = int(input())\r\narr = list(map(int, input().split()))\r\np = 0\r\nfor i in range(n):\r\n p += arr[i]\r\nprint(p / n)\r\n", "num = int(input())\r\nobj = str(input())\r\nobj = obj.split()\r\nlistaTab = [int(i) for i in obj]\r\nsuma = 0\r\n\r\nfor i in listaTab:\r\n suma = suma + i\r\n\r\n\r\nprint(suma/num)", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\n# Calculate the average volume fraction of orange juice in the final drink\r\navg = sum(p) / n\r\n\r\n# Print the result with 4 decimal places\r\nprint(\"{:.4f}\".format(avg))\r\n", "n=int(input())\r\nl=list(map(int,input().strip().split()))[:n]\r\nsum1=0\r\nfor i in l:\r\n sum1=sum1+i\r\nprint(sum1/n)", "n = int(input())\r\nns = map(int, input().split())\r\n\r\nprint(sum(ns) / n)", "# Read input\r\nn = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\n# Calculate the average volume fraction\r\naverage_volume_fraction = sum(volume_fractions) / n\r\n\r\n# Print the result\r\nprint(average_volume_fraction)", "n = int(input())\r\ns = input()\r\ns= s.split(\" \")\r\nsum = 0\r\nfor i in range(n):\r\n sum+= int(s[i])\r\nprint(sum/n) ", "b=int(input())\r\na=(int(i) for i in input().split())\r\na=sum(a)\r\nformatted_number = \"{:.{}f}\".format(a/b, 12)\r\nprint(formatted_number)", "n = int(input())\r\np = (map(int,input().split()))\r\np = sum(p)\r\ns = p / n\r\nprint(s)", "n = int(input())\r\nh = 0\r\nb = input().split()\r\nfor i in range(len(b)):\r\n d = int(b[i]) / 100\r\n h += d \r\nj = h / n\r\notvet = j * 100\r\nprint(otvet)", "sum = 0\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n sum += l[i]/(100.0)\r\nprint((sum*100.0)/n)", "n = int(input())\na = list(map(int,input().split()))\nt = sum(a)\navg = t/n \nprint(avg)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nm=sum(s)\r\nz=(m/n)\r\nprint(z)", "x=int(input())\r\ns=input().split()\r\nans=0\r\nfor i in range(x):\r\n ans+=(int(s[i]))\r\nprint((ans/(100*x))*100)\r\n", "n = int(input())\r\na = list(map(int , input().split()))\r\nsum = 0.0\r\nfor i in range(n):\r\n sum += a[i] / 100\r\nprint(100 * sum / n)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nanswer = sum(lst) / n\r\nprint(answer)", "n = int(input())\r\noranges = list(map(int, input().split()))\r\npercent = 0.0\r\nfor orange in oranges:\r\n percent = percent + orange/100\r\n\r\nprint((percent/(100*n))*100*100)", "k=int(input())\r\np=list(map(int,input().split()))\r\nt=sum(p)\r\nresult=t/k\r\nprint(result)", "n = int(input())\r\npercents = list(input().split(' '))\r\npercents = list(map(int, percents))\r\nTotal = sum(percents) / n\r\nprint(Total)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\notv =0\r\nfor i in range(n):\r\n otv+=a[i]\r\nprint(otv/n)", "t = int(input())\r\na = list(map(int,input().split()))\r\nc = 0\r\nfor i in a :\r\n c += i/100\r\nprint((c/t)*100)", "n=int(input())\r\npercentage=list(map(int,input().split()))\r\nprint(round(sum(percentage)/(n*100)*100,12))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmax = 0\r\nfor i in range(n):\r\n max += l[i]\r\nmax = max / n\r\nprint(max)\r\n", "n = int(input())\r\n\r\ndrinks = [int(i) for i in input().split()]\r\n\r\nprint(sum(drinks)/n)", "\r\nn = int(input())\r\n\r\njuice_list = list(map(int, input().split()))\r\n\r\nx = sum(juice_list)/100\r\n\r\nprint(100*(x/n))", "n = int(input())\r\ndr = input()\r\nif n == 1:\r\n print(int(dr))\r\nelse:\r\n dr = dr.split()\r\n sum = 0\r\n for drink in dr:\r\n sum += int(drink)\r\n print(sum/n)\r\n", "n = int(input())\r\nstr1 = input()\r\nl1= str1.split()\r\ns=0\r\nfor i in l1:\r\n s = s + int(i)\r\ns=s/len(l1)\r\nprint(s)", "x=int(input())\r\ny=list(map(int,input().split()))\r\nz=0\r\n\r\nfor j in y:\r\n z=z+j\r\n\r\nz=z/x\r\n\r\nprint(z)", "d = int(input())\r\narr = list(map(lambda x: int(x)/100, input().split()))\r\ndrink = sum(arr)/d*100\r\nprint(drink)", "n = int(input())\r\ns=0\r\nfor j in range(1):\r\n numbers = input().split()\r\n num_list = [int(i) for i in numbers]\r\n\r\nfor m in range(n):\r\n s+= num_list[m]\r\n\r\nprint((s/(100*n))*100)\r\n\r\n\r\n\r\n", "n=float(input())\n\nsum=sum(list(map(float,input().split())))\nprint(sum/n)\n\n", "n = int(input())\r\nl = map(float, input().split())\r\nprint(sum(l)/(n))", "n = int(input())\r\nv = list(map(int,input().split()))\r\navg = sum(v) / n\r\nprint(avg)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n if l[i]==0:\r\n continue\r\n sum=sum+l[i]\r\nfinal=sum/n\r\nprint(\"{0:.12f}\".format(final))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nsumm = 0\r\nfor i in range(len(l)):\r\n summ += l[i]\r\nprint(summ/n)", "n=int(input())\r\nl=input().split()\r\ns=0\r\nfor i in l:\r\n s=s+int(i)\r\ns=float(s/n)\r\nprint(s)\r\n", "def main(n, arr):\r\n return sum(arr) / n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n print(main(n, arr))", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=sum(l)\r\nprint(p/n)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=\"{:.12f}\".format(sum(l)/n)\r\nprint(ans)", "# Решение задач проекта CODEFORSES, Задача 200B\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nB. Напитки\r\nограничение по времени на тест2 секунды\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nМаленький мальчик Вася очень любит апельсиновый сок, и поэтому в любом продукте и напитке у него на кухне обязательно\r\nсодержится апельсиновый сок. В его холодильнике хранятся n напитков, объемная доля апельсинового сока в i-ом напитке\r\nсоставляет pi процентов.\r\n\r\nОднажды Вася решил приготовить себе апельсиновый коктейль, и для этого он взял в равных пропорциях каждого\r\nиз n напитков и смешал. После этого ему стало интересно, как много апельсинового сока содержится в его коктейле.\r\n\r\nНайдите объемную долю апельсинового сока в получившемся напитке.\r\n\r\nВходные данные\r\nВ первой строке входного файла содержится единственное целое число n (1 ≤ n ≤ 100) — количество апельсиновых\r\nнапитков в холодильнике у Васи. Во второй строке находятся n целых чисел pi (0 ≤ pi ≤ 100) — объемная доля в\r\nпроцентах апельсинового сока в i-ом напитке. Числа разделены пробелом.\r\n\r\nВыходные данные\r\nВыведите объемную долю в процентах апельсинового сока в коктейле Васи. Ответ будет считаться верным, если его\r\nабсолютная или относительная погрешность не превышает 10  - 4.\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\na1=int(input())\r\na2=[int(i) for i in input().split()]\r\nz = sum(a2)\r\nans = z/(a1)\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+l[i]\r\n i+=1\r\nk=(sum/n)\r\nprint(k)", "from time import *\r\nfrom math import *\r\nfrom random import *\r\nfrom string import *\r\nn = int(input())\r\nans = 0\r\na = []\r\na += map(int, input().split())\r\ng = 0\r\nfor i in range(n):\r\n ans += a[g]\r\n g += 1\r\nans = ans / n\r\nprint(ans)\r\n", "# Drinks\n\nx = int(input())\ny = input().split(' ')\n\nvolumefrac = 0\n\nfor number in y:\n volumefrac += int(number)\n\nvolumefrac /= x\n\nprint(volumefrac)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=[x/100 for x in b]\r\nprint(sum(c)*100/a)", "n=int(input())\r\nlis=list(map(int,input().rstrip().split()))\r\ns=sum(lis)\r\nprint(s/n)\r\n", "def solve():\r\n a=int(input()); n=input().split();x=0\r\n for i in range(len(n)): x=x+int(n[i])\r\n print(x/a)\r\ndef main():\r\n solve()\r\nif __name__==\"__main__\":\r\n main()", "n = int(input())\r\na = input().split()\r\nv = 0\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nfor i in range(n):\r\n v+=a[i]/n\r\nprint(v)", "x=int(input())\r\ns= list(map(int, input().split()))\r\ny=sum(s)\r\nprint(y/x)", "n = int(input()) # Number of drinks\r\nvolume_fractions = list(map(int, input().split())) # List of volume fractions\r\n\r\ntotal_weight = n # Total number of drinks\r\nweighted_sum = sum(vf for vf in volume_fractions) # Sum of volume fractions\r\n\r\nresult = (weighted_sum / total_weight) # Calculate the weighted average\r\nprint(\"{:.12f}\".format(result)) # Print the result with up to 12 decimal places\r\n", "numb = int(input())\r\npercent = list(map(int, input().split()))\r\nresult_percent = numb * 100\r\npercent = sum(percent)\r\nprint(percent / (result_percent / 100))", "n=int(input())\r\nl=list(map(int,input().strip().split()))[:n]\r\ns=0\r\nfor i in l:\r\n s=s+i\r\nprint(s/n)", "def calcular(n,lista):\r\n i=0\r\n soma=0\r\n while i<n:\r\n soma+=lista[i]/100\r\n i+=1\r\n return (soma/n)*100\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nprint(calcular(n,a))\r\n", "n=int(input())\r\na=input().split()\r\nm=0\r\nfor i in range (len(a)):\r\n m=m+int(a[i])\r\nprint(m/len(a))", "n=int(input())\r\nb=list(map(int,input().split()))\r\nprint(sum(b)/n)", "import sys;input=sys.stdin.readline\r\nn = int(input())\r\nprint(sum(map(int,input().strip().split()))/n)", "def sol(x, arr):\r\n tmp = list(map(lambda x: x/100,arr))\r\n return (sum(tmp)/x) * 100\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split(\" \")]\r\n\r\nprint(sol(n,arr))", "def calculate_orange_juice_fraction(n, percentages):\r\n total_percentage = sum(percentages)\r\n cocktail_percentage = total_percentage / n\r\n return cocktail_percentage\r\n\r\n\r\nn = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ncocktail_fraction = calculate_orange_juice_fraction(n, percentages)\r\nprint(cocktail_fraction)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 11:08:58 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\ntotal=0.0\r\nlist=[float(i) for i in input().split()]\r\nfor i in list:\r\n total+=i\r\nprint(round(total/(n*100),14)*100)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nprint(\"{:.12f}\".format(sum(l)/a))", "n = int(input()) # Number of drinks\r\nfractions = list(map(int, input().split())) # Volume fractions of orange juice\r\ntotal_fraction = sum(f / 100 for f in fractions)\r\nans = total_fraction / n\r\n\r\nprint(\"{:.12f}\".format(ans * 100)) \r\n", "def calculate_orange_juice_fraction(n, fractions):\r\n total_fraction = sum(fractions)\r\n cocktail_fraction = total_fraction / n\r\n return cocktail_fraction\r\n\r\nn = int(input())\r\nfractions = list(map(int, input().split()))\r\n\r\nresult = calculate_orange_juice_fraction(n, fractions)\r\nprint(\"{:.9f}\".format(result))\r\n", "a = int(input())\r\nb = map(int, input().split())\r\ncount = 0\r\nfor i in b:\r\n i = int(i)\r\n if i != 0:\r\n count += i/100\r\nprint(count/a * 100)", "input()\r\ns=list(map(int,input().split()))\r\nprint(sum(s)/len(s))\r\n", "a,ls=int(input()),list(map(int,input().split()))\r\nprint(sum(ls)/len(ls))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 10:41:28 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nn = int(input())\r\nadd = 0\r\nls = input().split()\r\nfor i in ls :\r\n add += int(i)\r\nprint(add/n)", "t = int(input())\r\npercentage = list(map(int, input().split()))\r\n\r\nsum_percentage = sum(percentage)\r\n\r\ncocktail_percentage = sum_percentage / t\r\nprint(cocktail_percentage)", "x = 1 / int(input())\r\nnumbers = map(int, input().split())\r\nresult = x * sum(numbers)\r\nprint(result)\r\n# HI CODEFORCES\r\n", "n = int (input())\r\ns = 0\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nprint(sum(a)/n)\r\n", "def calculate_orange_juice_volume_fraction(n, volumes):\r\n total_volume = sum(volumes)\r\n cocktail_volume_fraction = sum(volumes) / n\r\n return cocktail_volume_fraction\r\n\r\n\r\nn = int(input())\r\nvolumes = list(map(int, input().split()))\r\noutput_result = calculate_orange_juice_volume_fraction(n, volumes)\r\nprint(f\"{output_result:.15f}\")\r\n", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ntotal_volume = 0\r\n\r\nfor p in percentages:\r\n total_volume += p\r\n\r\ncocktail_percentage = total_volume / n\r\nprint(cocktail_percentage)\r\n", "def calcVol(n, volume):\n total = 0\n for i in range(n):\n total += volume[i]\n avgVol = total / n\n print(avgVol)\n\nn = int(input())\nvolume = list(map(int, input().split()))\n\ncalcVol(n, volume)", "n = int(input())\r\nf = sum(map(int, input().split()))\r\nprint(f/n)", "n = int(input())\r\ne = list(map(int, input().split()))\r\nt = 0\r\nfor i in range(n):\r\n t += e[i]\r\naston = t / n\r\nprint(\"{:.9f}\".format(aston))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jul 27 09:43:00 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nn = int(input())\r\np = input().split()\r\n\r\nx = 0\r\n\r\nfor i in range(n):\r\n x = x + int(p[i])/100\r\n\r\nprint(x/n*100)", "a=int(input())\r\narr = list(map(int,input().split()))\r\nsumm = sum(arr)\r\nans = summ/a\r\nprint(\"%.4f\"%ans)", "n = int(input())\np = list(map(int, input().split()))\n\norange_juice = sum(p) / (n * 100)\norange_juice *= 100\n\nprint(orange_juice)\n \t \t\t \t \t \t\t \t \t \t\t\t", "n = int(input())\r\np = [int(i) for i in input().split()]\r\n\r\nprint(sum(p)/n)", "def Drinks(n):\r\n\r\n total = input().split()\r\n\r\n total_qnt = 0\r\n\r\n for i in range(n):\r\n\r\n\r\n total_qnt += int(total[i])\r\n\r\n return total_qnt / n\r\n\r\nprint(Drinks(int(input())))", "n = int(input()) # Number of orange-containing drinks\r\nfractions = list(map(int, input().split())) # List of volume fractions\r\n\r\ntotal_fraction = 0 # Initialize the total volume fraction\r\n\r\nfor fraction in fractions:\r\n total_fraction += fraction / 100 # Convert percentage to fraction and add to total\r\n\r\ncocktail_fraction = (total_fraction / n) * 100 # Calculate the cocktail's volume fraction in percent\r\n\r\nprint(cocktail_fraction)\r\n", "num = int(input())\r\nsum, sum2 =0,0\r\nnums = list(map(int,input().split()))\r\nfor i in nums:\r\n sum+=i\r\nprint((sum/(num*100))*100) ", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in s:\r\n c += i\r\nc /= n\r\nd = round(c, 12)\r\nprint(d)", "n = int(input())\r\ndrinks = list(map(int, input().split(\" \")))\r\nper = sum(drinks) / n\r\nprint(per)", "n = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\norange = 0\r\nnot_orange = 0\r\n\r\nfor num in numbers:\r\n orange += num\r\n not_orange += 100 - num\r\n\r\nprint(orange * 100 / (orange + not_orange))\r\n", "\r\ndrinks = int(input())\r\npercentages = [eval(x) for x in input().split()]\r\n\r\nprint(sum(percentages)/drinks)", "x=int(input())\r\ny=list(map(int,input().split()))\r\nprint(sum(y)/x)", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\nprint(sum(a)/(n))", "n = int(input())\r\nnum = input().split()\r\ntotal = 0\r\nfor i in range(n):\r\n total += int(num[i])\r\nprint(total/n)\r\n", "n = int(input())\narr = list(map(int, input().split()))\nprint(((sum(arr)/100)/n)*100)\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nt = sum(p)\r\nc = t / n\r\nprint(c)\r\n", "kolvo = int(input())\r\nnapitki = list(map(int, input().split()))\r\ndolya = 0\r\nfor i in range(kolvo):\r\n dolya += napitki[i]/100\r\nprocent = dolya/kolvo*100\r\nprint(procent)\r\n", "n = int(input())\nvolumes = list(map(int, input().split()))\n\nmedia_volumes = sum(volumes)/n\nprint(\"{:.12f}\".format(media_volumes))\n\n\t \t \t\t\t \t\t \t \t\t\t\t \t \t\t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\nres = sum(a)/len(a)\r\nprint(f'{res:.12f}')", "n=int(input())\r\nls=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n c+=ls[i]\r\nprint(\"{0:.12f}\".format(c/n))", "n = int(input())\r\np = list(map(int, input().split(' ')))\r\n\r\nfrac = 0\r\nfor i in p:\r\n frac += i/100\r\n \r\nprint(frac/n * 100)", "n = int(input())\r\nlis = list(map(int, input().split()))\r\nprint(\"{:.12f}\".format(sum(lis)/n, 12))", "def orange_cocktail_volume_fraction(n, p):\r\n # Calculate the sum of volume fractions of orange juice in all drinks\r\n total_volume_fraction = sum(p)\r\n \r\n # Calculate the volume fraction in the cocktail\r\n cocktail_volume_fraction = total_volume_fraction / n\r\n \r\n return cocktail_volume_fraction\r\n\r\n# Example usage:\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n\r\nresult = orange_cocktail_volume_fraction(n, p)\r\nprint(\"{:.12f}\".format(result))\r\n", "N=int(input())\r\nPercentage = list(map(int, input().split()))\r\nVolume = sum(Percentage)\r\nAvg = Volume / N\r\nprint(Avg)", "#!/usr/local/bin/python\n\nn = int(input())\nl = list(map(int,input().split()))\n\nprint(f'{sum(l)/n:.12f}')\n", "def calculate(n, percentages):\r\n total = sum(percentages)\r\n return total / n\r\n \r\n \r\nn = int(input())\r\npercentages = list(map(int, input().split()))\r\n \r\nresult = calculate(n, percentages)\r\nprint('{:.12f}'.format(result)) \r\n", "n = int(input())\r\nporcentajes = list(map(int,input().split()))\r\nresultado = sum(porcentajes) / n\r\nresultadofinal = \"{:.12f}\".format(resultado)\r\nprint(resultadofinal)\r\n", "n = int(input())\np = map(int, input().split())\n\nprint(sum(p) / n)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nsum = 0\r\nfor i in range (n):\r\n sum += a[i]\r\nk = sum/n\r\nprint(k)", "n = int(input())\r\nfr = list(map(int, input().split()))\r\n\r\ntotalp = sum(fr)\r\ntotalcf = totalp / n\r\n\r\nprint(totalcf)\r\n", "n = int(input())\r\na = input().split()\r\ncount = 0\r\nfor i in a:\r\n count+=int(i)\r\nansw = count/n\r\nprint(answ)", "a=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n s+=i/100\r\nb=(s/a)*100\r\nprint(\"%.12f\"%(b))", "line1 = int(input())\r\nline2 = list(map(int, input().split(\" \")))\r\n\r\n\r\ndef caculatePercent(num):\r\n sum = 0\r\n for i in range(line1):\r\n sum += line2[i] / 100\r\n return round((sum / line1) * 100, 4)\r\n\r\nprint(caculatePercent(line1))", "n = int(input())\norange = list(map(int,input().split()))\n\nprint(sum(orange)/n)\n", "n=int(input())\r\np=map(int,input().split())\r\nans=0\r\nans+=(1/n)*sum(p)\r\nprint(ans)", "n = int(input())\r\n\r\np = list(map(int, input().split()))\r\n\r\nfor i in range(len(p)):\r\n p[i] = p[i] / 100\r\n\r\nsum = sum(p)\r\n\r\nprint((sum / n)*100)", "n = int(input())\r\npi_values = list(map(int, input().split()))\r\naverage_pi = sum(pi_values) / n\r\nprint(average_pi)", "n=int(input())\r\nf=list(map(int,input().split()))\r\nt=n\r\nto=sum(f)\r\ncf=to/t\r\nprint('{:.10f}'.format(cf))", "def accnumlist():\r\n return list(map(int, input().split()))\r\ndef accnums():\r\n return map(int, input().split())\r\ndef accstr():\r\n return input()\r\ndef accnum():\r\n return int(input())\r\ndef acclist():\r\n return list(input().split())\r\n\r\nn = accnum()\r\nnums = accnumlist()\r\n\r\nprint(sum(nums)/n)", "n = input()\r\nn = int(n)\r\narr = input().split()\r\narr = [int(x) for x in arr]\r\nprint((sum(arr)) / n)", "n=int(input())\r\ntemp=[int(i) for i in ((input()).split())]\r\nans=(sum(temp))/(n)\r\nprint(f'{ans:.5f}')", "\r\nn = int(input())\r\n\r\n\r\na = list(map(int, input().split()))\r\n\r\n\r\ntotal = sum(a) / n\r\n\r\n\r\nprint(\"{:.6f}\".format(total))\r\n", "n=int(input())\r\np=list(input().split())\r\nx=len(p)\r\ny=100*x\r\ns=0\r\nfor i in p:\r\n s=s+int(i)\r\nprint((s/y)*100)", "n = int(input())\r\np = list(map(int, input().split()))\r\ntotal_p = sum(p)\r\nc_p = total_p / n\r\nprint(c_p)\r\n", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\ntotal_volume = sum(volume / 100 for volume in volume_fractions)\r\ncocktail_fraction = (total_volume / n) * 100\r\n\r\nprint(\"{:.12f}\".format(cocktail_fraction))\r\n", "n= int(input())\r\ns = [int(i) for i in input().split()]\r\nsumm = sum(s)/n\r\nprint(round(summ, 10**4))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=sum(a)\r\nprint(b/n)", "n=int(input())\r\nm=list(map(int,input().split(\" \")))\r\nz=0\r\nprint(sum(m)/n)", "from decimal import Decimal\r\n\r\nno_of_drinks = Decimal(input())\r\npercentages_list = list(map(Decimal, input().split()))\r\n\r\ntotal_percentage = sum(percentages_list)\r\naverage_percentage = total_percentage / no_of_drinks\r\n\r\nprint(average_percentage)\r\n", "n = int(input())\r\np_i = [int(x) for x in input().split()]\r\nprint(sum(p_i) / n)", "q = int(input())\r\nr = sum(list(map(int, input().split())))\r\nprint(r/q)", "a = int(input())\r\nspam = [int(i) for i in input().split()]\r\nprint(sum(spam)/a)", "n = int(input())\r\nmylist = list(map(int,input().split()))\r\nb = sum(mylist)\r\nc = b / n\r\nprint(c)\r\n", "n=int(input())\r\na=list(map(int,input().rstrip().split()))\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+a[i]\r\nf=sum/n\r\nprint(\"{0:.12f}\".format(f))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n s+=i\r\nc=s/n\r\nprint(\"{:.12f}\".format(c))", "n=int(input())\r\nm=list(map(int,input().split()))\r\ns=0\r\nfor i in range (n):\r\n t=m[i]/100\r\n s+=t\r\nprint(100*float(s/n))", "lim=int(input())\r\ntotal=sum([int(i) for i in input().split()])\r\n\r\nprint(total/lim)", "T=int(input())\r\nL=list(map(int,input().split()))\r\nprint(sum(L)/T)", "n=int(input())\r\nm=[int(m) for m in input().split()]\r\np=0\r\nfor c in m:\r\n p+=c\r\nprint(p/n)\r\n", "n = int(input())\r\nnumerator = 0.0\r\npercentages = input().split()\r\n\r\nfor percent_i in percentages:\r\n numerator += int(percent_i)\r\n\r\ndenominator = float(n)\r\nfraction = numerator / denominator\r\n\r\nprint(fraction)\r\n", "orange = int(input())\r\npercentage = map(int, input().split())\r\nresult = 0\r\nfor p in percentage:\r\n result += p\r\nprint(result / orange)\r\n", "n=int(input())\r\norange=input().split()\r\ntotal,pro=0,0\r\nfor i in range(0,n):\r\n total+=int(orange[i])/100\r\npro=total/n\r\npro*=100\r\nprint('%.10f'%pro)\r\n", "n = int(input())\r\npi_values = list(map(int, input().split()))\r\nsum_pi = sum(pi_values)\r\naverage_volume_fraction = sum_pi / n\r\nprint(average_volume_fraction)", "n=int(input())\r\np=input().split()\r\n\r\nfor i in range(n):\r\n p[i]=int(p[i])\r\n \r\nprint(sum(p)/n)", "n=int(input())\r\ns=input()\r\ns=s.split()\r\na=0\r\nfor i in s:\r\n a+=(int(i)/100)\r\nprint((a/n)*100)", "n = int(input()) # Read the number of drinks\r\npercentages = list(map(int, input().split())) # Read the percentages as a list\r\n\r\n# Calculate the average percentage of orange juice\r\naverage_percentage = sum(percentages) / n\r\n\r\n# Output the average percentage as the volume fraction in the cocktail\r\nprint(average_percentage)\r\n\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nx = 0.0000\r\nfor i in p:\r\n x += float(i)/n\r\nprint(x)", "n = int(input())\r\nparts = list(map(int, input().split()))\r\n\r\nprint(sum(parts) / n)", "n = int(input())\r\nnum_list = [int(x) for x in input().split()]\r\nlist_sum = sum(num_list)\r\nans = list_sum / n\r\nprint(\"{:.12f}\".format(ans))\r\n", "#initializes drink number (not needed) and drink ratios\r\ndrinks = int(input())\r\norange = 0\r\ndrinkList = input().split(' ')\r\n\r\n#adds all orange juice drink ratios\r\nfor drink in drinkList:\r\n orange += (int(drink))\r\n\r\n#prints percent of orange juice content over all drink content\r\nprint((orange / (drinks * 100)) * 100)", "n = int(input())\r\nprint((sum([int(el) for el in input().split()]) / (n * 100)) * 100)", "n=int(input())\r\ninfo=input().split()\r\ns=0\r\nfor i in range(n):\r\n s+=int(info[i])\r\nw=s/n\r\nprint(w)", "num= int(input())\r\nlst=list(map(int,input().split()))\r\nprint(sum(lst)/num)", "n = int(input())\r\ndata = [int(i) for i in input().split()]\r\nprint(sum(data) / len(data))", "\r\n\r\ndef solve():\r\n n = int(input())\r\n percent = list(map(lambda x: float(x) / 100.0, input().split(maxsplit=n)))\r\n pure_volume_juice = sum(percent)\r\n total_volume = len(percent)\r\n return pure_volume_juice / total_volume * 100.0\r\n\r\n\r\nprint(solve())\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\nprint(sum(x)/len(x))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=sum(l)\r\nprint(x/n)", "n=int(input())\r\nk=list(map(int,input().split()))\r\nprint(sum(k)/n)", "n=int(input())\r\np=map(int,input().split())\r\nprint(sum(p)/n)", "n = int(input())\r\ndrnks = sum(list(map(int, input().split())))\r\nprint('%.12f' % (drnks/n))", "n = int(input())\r\nfractions = list(map(int, input().split()))\r\ntotal_volume = sum(fractions)\r\ncocktail_fraction = total_volume / n\r\nprint(\"{:.10f}\".format(cocktail_fraction))\r\n", "n = int(input())\r\nsorat = 0\r\nfor i in list(map(int,input().split())):\r\n sorat += i\r\nprint(sorat/n)", "a=int(input())\nx=[int(y) for y in input().split()][:a]\nportion=100/a\nj=0\nsum =0\nwhile j<a:\n\tx[j]=x[j]*portion\n\tsum=sum+x[j]\n\tj+=1\nprint (sum/100)\t\t\t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor element in arr:\r\n res += element / 100\r\n\r\nprint((res / n) * 100)", "import sys\r\nimport math\r\ndef main():\r\n #n,k = map(int, input().split())\r\n #a = [int(x) for x in sys.stdin.readline().split()]\r\n #t = int(input())\r\n t = int(input())\r\n a = [int(x) for x in sys.stdin.readline().split()]\r\n print(sum(a)/len(a))\r\n \r\nmain()\r\n", "n = int(input())\r\nc=0\r\np=list(map(int,input().split()))\r\nfor i in p:\r\n c+=i\r\nprint(c/n)", "n = int(input())\nx = sum(int(x) for x in input().split())\nprint(x/n)", "# Drinks\r\ninput()\r\nnums = [int(x) for x in input().split(' ')]\r\nporcentaje = 0\r\nfor i in nums:\r\n porcentaje += i\r\nprint(porcentaje / len(nums))\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nd=0\r\n\r\nfor i in s:\r\n d+=i\r\nprint(\"{:.12f}\".format(d/n))\r\n", "n=int(input())\r\na=sum(map(int,input().split()))\r\nprint(a/n)\r\n", "si = int(input())\r\nlist_b = list(map(int,input().split()))\r\nsum = 0\r\nfor x in list_b:\r\n sum+=x\r\nprint('{0:.12f}'.format(sum/si))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nr=s/n\r\nprint(r)\r\n", "total = int(input())\r\nperc = list(map(int, input().split()))\r\nprint((sum(perc)/((total)*100))*100)", "def main():\r\n n = int(input())\r\n l = list(map(int, input().split(' ')))\r\n sum = 0\r\n for i in l:\r\n sum += i\r\n print(sum / len(l))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a=int(input())\r\nb=0\r\nc=(str(input())).split()\r\nfor i in c:\r\n b=b+int(i)\r\nprint(b/a)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nprint(100*sum([i/100 for i in lst]) / len(lst)) ", "import statistics\r\nnumber_juice = int(input())\r\nfraction_juice = list(map(int,input().split(' ')))\r\nprint(statistics.mean(fraction_juice))", "n = int(input())\r\ndata = input().split()\r\nsum = 0\r\nfor i in data:\r\n sum += int(i)\r\nprint(\"%.12f\" % (sum / n))", "n = int(input())\r\npercent_drinks = list(map(int, input().split(\" \")))\r\nprint((sum(percent_drinks)/n))\r\n", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\n\r\nsum_volume_fractions = sum(volume_fractions)\r\n\r\n\r\naverage_volume_fraction = sum_volume_fractions / n\r\n\r\n\r\nprint(\"{:.12f}\".format(average_volume_fraction))\r\n", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\nweights_sum = sum(percentages[i] for i in range(n))\r\ntotal_volume = n\r\ncoctail = weights_sum/total_volume\r\nrounded = round(coctail, 6)\r\nprint(rounded)", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nsum_fraction = sum(p)\r\naverage_fraction = sum_fraction / n\r\n\r\nprint(average_fraction)", "\n\ncount = int(input())\n\nnum_list = [int(i) for i in input().split()]\n\nprint(sum(num_list)/count)\n", "drinks = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nresult = 0\r\nfor drink in arr:\r\n result += drink / drinks\r\n\r\nprint(result)", "count = 0\r\nn = int(input())\r\nnum = list(map(int, input().split(\" \")))\r\n\r\nfor i in num:\r\n count+=i\r\nprint(f\"{count/n:0,.12f}\")", "num_drinks = int(input())\r\n\r\ntotoal_qty = sum(list(map(int, input().split())))\r\n\r\nprint(totoal_qty / num_drinks)", "n = int(input())\nm = list(map(int,input().split()))\nr = 0\ne = 10**(-13)\nfor i in m:\n r += i\nt = (r/n)+e\nprint(t)\n\n \t \t \t \t\t \t \t", "num = int(input())\r\nv = input().split(' ')\r\nsum = 0\r\nfor i in range(num):\r\n sum += int(v[i])\r\nprint('{:.12f}'.format(sum/num))", "n=int(input())\r\np=input().rsplit()\r\nsum=0\r\nfor i in p:\r\n sum+=float(i)\r\nprint(sum/n)", "n = int(input())\nproportions = [int(i) for i in input().split()]\nfull = 0\npart = 0\nfor i in proportions:\n full+=100\n part+=i\nresult = (part/full)*100\nprint('%.12f' % result)\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nans = sum(p)*100/(n*100)\r\nprint(ans)", "import sys\r\nn = int(input())\r\n\r\narr = [int(i) for i in sys.stdin.readline().split()]\r\nprint(sum(arr) / n)", "def solve():\r\n n = int(input())\r\n l = sum(int(i) for i in input().split())\r\n print(l/n)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "num = int(input())\r\nx = input().split()\r\nx = [int(i) for i in x]\r\nprint(f'{sum(x) / num:.13f}')\r\n", "def solve(values, n):\r\n return sum(values) / n\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n n = int(input())\r\n values = list(map(int, input().split()))\r\n print(\"{:.12f}\".format(solve(values, n)))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\njs=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n sum+=js[i]\r\n x=sum/n\r\nprint(x)", "\n\nn = int(input())\n\nps = list( map(int, input().split(' ')) )\n\njuice = 0\nmix = 0\n\nfor p in ps:\n juice += p / 100\n mix += 1\nprint(juice / mix * 100)", "if __name__ == \"__main__\":\r\n num = int(input())\r\n q = sum(map(int, input().split()))\r\n print(q/num)\r\n ", "\r\nn = int(input())\r\nnums = [int(n) for n in input().split()]\r\nprint(sum(nums) / n)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = 0\r\nfor i in a:\r\n b += i / 100\r\nprint(100*b/n)", "n = int(input())\npercentage = input().split()\npercentage = [int(i) for i in percentage]\nsummation = sum(percentage)\nprint(f'{summation/len(percentage):.14f}')\n", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\n# Calculate the weighted sum of volume fractions\r\nweighted_sum = sum(volume_fractions[i] for i in range(n))\r\n\r\n# Calculate the weighted average\r\naverage_fraction = weighted_sum / n\r\n\r\nprint(average_fraction)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nresult = sum(p) / n\r\nprint(result)\r\n", "n = int(input())\r\nmillies = list(map(int, input().split()))\r\nprint(sum(millies)/n)\r\n", "n = int(input())\r\nl = map(int,input().split())\r\nprint(sum(l)/n)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nsum1 = 0.0\r\nfor i in lst:\r\n sum1 += float(i) / n\r\nprint(sum1)\r\n ", "n = int(input())\r\norange = list(map(int, input().split(\" \")))\r\ntotal_volume = 100*n\r\norange_volume = (sum(orange)/total_volume)*100\r\nprint(orange_volume)\r\n", "a=int(input())\r\nn=list(map(int,input().split()))\r\nx=sum(n)\r\nprint(x/a)", "n = int(input())\r\nnum= list(map(int, input().split()))\r\nmean=sum(num)/n\r\nprint(mean)\r\n", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\ntotal_volume = sum(percentages)\r\ncocktail_percentage = total_volume / n\r\nprint(\"{:.9f}\".format(cocktail_percentage))\r\n", "count = int(input())\r\nnums = list(map(int,input().split()))\r\nmaximum = max(nums)\r\na = 0\r\n\r\nfor num in nums :\r\n if num == 0 : continue\r\n a += num / maximum \r\n \r\n \r\n \r\nprint(\"{:.12f}\".format(a * maximum / count))", "div = int(input())\r\npercents = input()\r\nlist_per = percents.split(\" \")\r\ntotal = 0\r\n\r\nfor i in list_per:\r\n total += int(i)\r\n\r\nprint(total/div)\r\n", "n = int(input())\r\nl = list(map(int, input().split(\" \")))\r\n\r\nsum = 0\r\n\r\nfor i in l:\r\n sum+=i\r\n\r\n\r\nprint(sum/n)", "n = int(input())\nLista = [int(i) for i in input().split()]\nprint(sum(Lista)/len(Lista))\n\n\n\t \t \t \t\t \t\t \t\t \t \t \t\t\t", "n=int(input())\r\npercentages=list(map(int,input().split()))\r\ntotal=sum(percentages)\r\navg=total/n\r\nprint(avg)\r\n\r\n\r\n\r\n", "kol_vo = int(input())\r\nchisla = input().split()\r\nsumma = 0\r\nfor i in range(len(chisla)):\r\n summa += int(chisla[i])\r\nprint(summa/kol_vo)", "import sys\r\ndrinks = int(sys.stdin.readline())\r\npercent = sys.stdin.readline().strip().split()\r\nnew_drink_int_litr = 0\r\nx = 100\r\nfor pr in percent:\r\n new_drink_int_litr += x * int(pr)/100\r\nprint(new_drink_int_litr / drinks)", "n = int(input())\r\ndks = [int(i) for i in input().split()]\r\n\r\nacum = 0\r\nfor per in dks:\r\n acum += per/100\r\n\r\nprint(acum/n*100)", "n=int(input())\r\ns=list(map(int,input().split()))\r\na=sum(s)\r\nx=f'{a/n:.4f}'\r\nprint(x)", "n=int(input())\r\na=list(map(int,input().strip().split()))[:n]\r\ntotal=n*100\r\norange=sum(a)\r\nprint((orange/total)*100)", "n = int(input())\r\nprint(\"{:.4f}\".format(sum(list(map(int, input().split()))) / n))", "n = int(input())\np = list(map(int, input().split()))\nsuma = sum(p)\ns = suma / n\nprint(s)\n\n\t\t \t\t \t \t \t\t \t \t", "def calculate_cocktail_volume_fraction(n, fractions):\r\n total_volume_fraction = sum(fractions)\r\n average_volume_fraction = total_volume_fraction / n\r\n return average_volume_fraction\r\n\r\n# Input reading\r\nn = int(input())\r\nfractions = list(map(int, input().split()))\r\n\r\n# Calculate and output the volume fraction of orange juice in Vasya's cocktail\r\nresult = calculate_cocktail_volume_fraction(n, fractions)\r\nprint(\"{:.12f}\".format(result))\r\n", "def orange_juice_fraction(n, volume_fractions):\r\n total_fraction = sum(volume_fractions)\r\n cocktail_fraction = total_fraction / n\r\n return cocktail_fraction\r\n\r\n# Input processing\r\nn = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\n# Output\r\nresult = orange_juice_fraction(n, volume_fractions)\r\nprint('{:.12f}'.format(result))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum1=0\r\nfor i in l:\r\n sum1=sum1+i\r\na=sum1/n\r\nprint(format(a,'.12f'))", "n = int(input())\r\na = [int(s) for s in input().split(\" \")]\r\n\r\nprint(sum(a)/n)", "n = int(input())\r\nsum = 0\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n sum += a[i]\r\nprint(sum / n)\r\n", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\n# Calculate the sum of all percentages\r\ntotal_percentage = sum(percentages)\r\n\r\n# Calculate the volume fraction of orange juice in the cocktail\r\ncocktail_percentage = total_percentage / n\r\n\r\n# Print the result with 9 decimal places\r\nprint('{:.9f}'.format(cocktail_percentage))\r\n", "n = int(input())\r\norange = [int(x) for x in input().split()]\r\nc = 0\r\nfor i in orange:\r\n c += (i / 100)\r\n\r\nresult = (c / n) * 100\r\n\r\nprint(\"%.12f\" % result)\r\n# print(result)\r\n", "n = int(input())\r\n\r\ns = sum(list(map(int,input().split()))) / n\r\nprint('{:.12f}'.format(s))\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nS = sum(p)\r\nans = S/n\r\n\r\nprint(\"{:.4f}\".format(ans))\r\n", "n = int(input()) \r\nvolumes = list(map(int, input().split())) \r\n\r\ntotal_volume = sum(volumes) \r\naverage_volume = total_volume / n \r\n\r\nprint(\"{:.12f}\".format(average_volume)) ", "total = 0\r\ndrinks = int(input())\r\nper = list(map(int, input().split(\" \")))\r\nfor x in per:\r\n total += x\r\npercent = total/drinks\r\nprint(percent)", "\r\n\"\"\"A=input()\r\nB=input()\r\nprint(len(A),len(B))\r\nprint(f\"{A} {B}\")\"\"\"\r\n\r\n\r\n\"\"\"A=input()\r\nfor i in A:\r\n if i==\"\\\\\":\r\n break\r\n print(i,end=\"\")\"\"\"\r\n\r\n\r\n\"\"\"A=input()\r\nB=input()\r\nif A<B:\r\n print(A)\r\nelse:\r\n print(B)\"\"\"\r\n\r\n\r\n\"\"\"A=input()\r\nB=input()\r\nAgain=B[0]+A[1:]+\" \"+A[0]+B[1:]\r\nprint(f\"{len(A)} {len(B)}\")\r\nprint(A+B)\r\nprint(Again)\"\"\"\r\n\"\"\"A=input()\r\nsum=0\r\nfor i in A:\r\n sum=sum+int(i)\r\nprint(sum)\"\"\"\r\n\r\n\"\"\"A=int(input())\r\nfor i in range(A):\r\n B=input()\r\n if len(B)<=10:\r\n print(B)\r\n else:\r\n print(f\"{B[0]}{len(B)-2}{B[-1]}\")\"\"\"\r\n\r\n\r\n\r\n\"\"\"A=input()\r\nconverted=\"\"\r\nfor i in A:\r\n if i==',':\r\n converted=converted+' '\r\n elif i.isupper():\r\n converted=converted+i.lower()\r\n elif i.islower():\r\n converted=converted+i.upper()\r\nprint(converted)\"\"\"\r\n\r\n\r\n\"\"\"A=int(input())\r\nfor i in range(A):\r\n B=input()\r\n if \"010\" in B or \"101\" in B:\r\n print(\"Good\")\r\n else:\r\n print(\"Bad\")\"\"\"\r\n\r\n\r\n\r\n\"\"\"A=input()\r\nif A==A[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\"\"\"A=input()\r\nfreq={}\r\nfor i in A:\r\n if i in freq:\r\n freq[i]=freq[i]+1\r\n else:\r\n freq[i]=1\r\nfor i in sorted(freq.keys()):\r\n print(f\"{i} : {freq[i]}\")\"\"\"\r\n\r\n\r\n\r\n\"\"\"A=int(input())\r\nfor i in range(A):\r\n B,C=input().split()\r\n B1=len(B)\r\n C1=len(C)\r\n maximum=max(B1,C1)\r\n result=\"\"\r\n for i in range(maximum):\r\n if i<B1:\r\n result=result+B[i]\r\n if i<C1:\r\n result=result+C[i]\r\n print(result)\"\"\"\r\n\r\n\r\n\r\n\"\"\"A=input()\r\nresult=sorted(A)\r\noutput=''.join(result)\r\nprint(output)\"\"\"\r\n\r\n\r\n\"\"\"expression = input()\r\n\r\n# Find the index of the operator (+, -, *, /)\r\nfor i, char in enumerate(expression):\r\n if char in ['+', '-', '*', '/']:\r\n operator_index = i\r\n break\r\n\r\nA = int(expression[:operator_index])\r\nS = expression[operator_index]\r\nB = int(expression[operator_index + 1:])\r\n\r\nif S == \"+\":\r\n result = A + B\r\nelif S == \"-\":\r\n result = A - B\r\nelif S == \"*\":\r\n result = A * B\r\nelif S == \"/\":\r\n result = int(A / B)\r\n\r\nprint(result)\"\"\"\r\n\r\n\r\n\"\"\"A,B,C,D=map(int,input().split())\r\nnow=1\r\nfor i in range(B):\r\n now=A*now\r\nnow1=1\r\nfor i in range(D):\r\n now1=C*now1\r\nif now>now1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\"\"\"def power(base, exponent):\r\n result = 1\r\n while exponent > 0:\r\n if exponent % 2 == 1:\r\n result *= base\r\n base *= base\r\n exponent //= 2\r\n return result\r\n\r\nA, B, C, D = map(int, input().split())\r\n\r\nresult_AB = power(A, B)\r\nresult_CD = power(C, D)\r\n\r\nif result_AB>result_CD:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\"\"\"\r\n\r\n\"\"\"# Read input\r\nX, Y = map(float, input().split())\r\n\r\n# Determine the position of the point\r\nif X > 0 and Y > 0:\r\n print(\"Q1\")\r\nelif X < 0 and Y > 0:\r\n print(\"Q2\")\r\nelif X < 0 and Y < 0:\r\n print(\"Q3\")\r\nelif X > 0 and Y < 0:\r\n print(\"Q4\")\r\nelif X == 0 and Y != 0:\r\n print(\"Eixo Y\")\r\nelif X != 0 and Y == 0:\r\n print(\"Eixo X\")\r\nelse:\r\n print(\"Origem\")\"\"\"\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"A,B=map(int,input().split())\r\ncount=0\r\nC=list(map(int,input().split()))\r\nnew=C[B-1]\r\nfor index in C:\r\n if index>=new and index>0:\r\n count=count+1\r\nprint(count)\"\"\"\r\n\r\n\r\n\r\n\"\"\"A=input().strip()\r\ntarget=\"hello\"\r\nindex=0\r\nfor i in A:\r\n if i==target[index]:\r\n index=index+1\r\n if index==len(target):\r\n print(\"YES\")\r\n break\r\nif index<len(target):\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\r\ndef evaluate(a, b, c, operators):\r\n if operators == \"+-\":\r\n return a + b - c\r\n if operators == \"+*\":\r\n return a + b * c\r\n if operators == \"-+\":\r\n return a - b + c\r\n if operators == \"-*\":\r\n return a - b * c\r\n if operators == \"*+\":\r\n return a * b + c\r\n if operators == \"*-\":\r\n return a * b - c\r\n\r\ndef can_achieve_target(a, b, c, d):\r\n for operators in [\"+-\", \"+*\", \"-+\", \"-*\", \"*+\", \"*-\"]:\r\n if evaluate(a, b, c, operators) == d:\r\n return True\r\n if evaluate(b, a, c, operators) == d:\r\n return True\r\n if evaluate(a, c, b, operators) == d:\r\n return True\r\n if evaluate(c, a, b, operators) == d:\r\n return True\r\n if evaluate(b, c, a, operators) == d:\r\n return True\r\n if evaluate(c, b, a, operators) == d:\r\n return True\r\n\r\n return False\r\n\r\n# Input\r\n\"\"\"a, b, c, d = map(int, input().split())\r\n\r\nif can_achieve_target(a, b, c, d):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\r\n\"\"\"A=int(input())\r\nif 10<=A<=99:\r\n A1=A%10\r\n A2=A//10\r\n if A1%A2==0 or A2%A1==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\"\"\"a,b=map(int,input().split())\r\nmin=max(a,b)\r\nmax=a+b\r\nif min%2==0:\r\n min=min+1\r\nif min<max:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\"\"\"\r\n\r\n\"\"\"import math\r\nA,B,C,D=map(int,input().split())\r\nAB=math.log(A)+math.log(B)\r\nCD=math.log(C)+math.log(D)\r\nif AB>CD:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\"\"\"def remove_comments(input_code):\r\n inside_block_comment = False\r\n cleaned_lines = []\r\n\r\n for line in input_code.split('\\n'):\r\n if not inside_block_comment:\r\n if '/*' in line:\r\n inside_block_comment = True\r\n line = line[:line.index('/*')]\r\n elif '//' in line:\r\n line = line[:line.index('//')]\r\n\r\n if inside_block_comment and '*/' in line:\r\n inside_block_comment = False\r\n line = line[line.index('*/') + 2:]\r\n\r\n if not inside_block_comment and line.strip() != '':\r\n cleaned_lines.append(line)\r\n\r\n return '\\n'.join(cleaned_lines)\r\n\r\n\r\ninput_code = input()\r\ncleaned_code = remove_comments(input_code)\r\nprint(cleaned_code)\"\"\"\r\n\r\n\r\n\r\n\"\"\"def count_words_without_punctuations(s):\r\n s = s.strip() # Remove leading and trailing spaces\r\n if not s:\r\n return 0 # Return 0 if the string is empty after stripping\r\n\r\n words = s.split() # Split the string by spaces\r\n valid_word_count = 0\r\n\r\n for word in words:\r\n # Check if the word consists only of letters (both lowercase and uppercase)\r\n if all(char.isalpha() for char in word):\r\n valid_word_count += 1\r\n\r\n return valid_word_count\r\n\r\n# Read input\r\ns = input()\r\n\r\n# Calculate and print the number of valid words (without punctuations)\r\nresult = count_words_without_punctuations(s)\r\nprint(result)\"\"\"\r\n\r\n\r\n\r\n\"\"\"def add(A,B):\r\n res=A+B\r\n return res\r\nA,B=map(int,input().split())\r\nprint(add(A,B))\"\"\"\r\n\r\n\r\n\"\"\"N = int(input())\r\nprint(*range(1, N + 1))\"\"\"\r\n\r\n\r\n\"\"\"def Odd(A):\r\n A1=bin(A)[2:]\r\n A2=A1[::-1]\r\n if A%2!=0 and A2==A1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nA=int(input())\r\nOdd(A)\"\"\"\r\n\r\n\r\n\"\"\"def is_prime(number):\r\n if number <= 1:\r\n return False\r\n if number <= 3:\r\n return True\r\n if number % 2 == 0 or number % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= number:\r\n if number % i == 0 or number % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\n\r\n# Read the number of test cases\r\nt = int(input())\r\n\r\n# Process each test case\r\nfor _ in range(t):\r\n num = int(input())\r\n if is_prime(num):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\"\"\"def swap(A,B):\r\n print(B,A)\r\nA,B=map(int,input().split())\r\nswap(A,B)\"\"\"\r\n\r\n\r\n\r\n\"\"\"def calculate_equation(X, N):\r\n S = 0\r\n term = 1\r\n for i in range(N//2 + 1):\r\n S += term\r\n term *= X**2\r\n return S\r\n\r\n# Read input\r\nX, N = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = calculate_equation(X, N)\r\nprint(result-1)\"\"\"\r\n\r\n\r\n\r\n\"\"\"def find_min_max(numbers):\r\n min_num = min(numbers)\r\n max_num = max(numbers)\r\n return min_num, max_num\r\n\r\n# Read the number of elements\r\nN = int(input())\r\n\r\n# Read the N numbers and split them into a list\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Calculate the minimum and maximum using the function\r\nmin_num, max_num = find_min_max(numbers)\r\n\r\n# Print the result\r\nprint(min_num, max_num)\"\"\"\r\n\r\n\r\n\r\n\"\"\"def avg(B):\r\n Sum=sum(B)\r\n N=len(B)\r\n print(\"{:.7f}\".format(Sum/N))\r\n\r\nA=int(input())\r\nB=list(map(float,input().split()))\r\navg(B)\"\"\"\r\n\r\n\r\n\r\n\"\"\"def is_prime(n):\r\n if n <= 1:\r\n return False\r\n if n <= 3:\r\n return True\r\n if n % 2 == 0 or n % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= n:\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n i += 6\r\n return True\r\n\r\n# Read input\r\nn = int(input())\r\n\r\n# Check if N is prime\r\nif is_prime(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\"\"\"def even(A,B):\r\n for i in range(A,B):\r\n if i%2==0:\r\n i=i+1\r\n return i\r\nA,B=map(int,input().split())\r\nprint(even(A,B))\"\"\"\r\n\r\n\r\n\r\n\r\n\"\"\"A,B=map(int,input().split())\r\ncount=0\r\nwhile A<=B:\r\n A=A*3\r\n B=B*2\r\n count=count+1\r\nprint(count)\"\"\"\r\n\r\n\r\n\"\"\"A=int(input())\r\nB=A/5\r\nB1=A//5\r\nif B>(B1+0.99999):\r\n print(B1)\r\nelif B==B1:\r\n print(B1)\r\nelse:\r\n print(B1+1)\"\"\"\r\n\r\n\r\n\r\n\"\"\"t = int(input()) # Number of test cases\r\n\r\nfor _ in range(t):\r\n x, y, n = map(int, input().split()) # x, y, n for the current test case\r\n\r\n # Find the difference between consecutive elements in b\r\n diff = x - y\r\n\r\n # Calculate the common difference for strictly decreasing b\r\n common_diff = diff // (n - 1)\r\n\r\n # Calculate the first n-1 elements of a\r\n a = [x - i * common_diff for i in range(n - 1)]\r\n a.append(y) # Append y as the last element\r\n\r\n # Check if all elements in b are strictly decreasing\r\n is_decreasing = all(a[i] - a[i + 1] > 0 for i in range(n - 2))\r\n\r\n if is_decreasing:\r\n print(*a)\r\n else:\r\n print(-1)\"\"\"\r\n\r\n\r\n\"\"\"A=int(input())\r\nB=pow(5,A)\r\nB1=str(B)[-2:]\r\nprint(B1)\"\"\"\r\n\r\n\r\n\"\"\"n = int(input())\r\nbase = 5\r\nexponent = n\r\nmodulus = 100\r\nresult = 1\r\n\r\nwhile exponent > 0:\r\n if exponent % 2 == 1:\r\n result = (result * base) % modulus\r\n exponent //= 2\r\n base = (base * base) % modulus\r\n\r\nprint(\"{:02}\".format(result))\"\"\"\r\n\r\n\r\n\r\n\r\n\"\"\"A=input()\r\nif len(A)>0:\r\n print(A[0].upper()+A[1:])\"\"\"\r\n\r\n\r\n# Read input values\r\n\"\"\"k, n, w = map(int, input().split())\r\n\r\n# Calculate the total cost of buying w bananas using the arithmetic progression formula\r\ntotal_cost = (w * (w + 1) // 2) * k\r\n\r\n# Calculate the amount of money the soldier needs to borrow\r\nborrow_amount = max(0, total_cost - n)\r\n\r\n# Print the amount of money the soldier needs to borrow\r\nprint(borrow_amount)\"\"\"\r\n\r\n\r\n\r\n\r\n\"\"\"def compare_strings(s1, s2):\r\n s1 = s1.lower()\r\n s2 = s2.lower()\r\n\r\n if s1 < s2:\r\n return -1\r\n elif s1 > s2:\r\n return 1\r\n else:\r\n return 0\r\n\r\n# Read input strings\r\nstring1 = input().strip()\r\nstring2 = input().strip()\r\n\r\n# Compare strings and print the result\r\nresult = compare_strings(string1, string2)\r\nprint(result)\"\"\"\r\n\r\n\r\n\r\n\r\n\"\"\"A,B=map(int,input().split())\r\nfor i in range(B):\r\n if A%10!=0:\r\n A=A-1\r\n else:\r\n A=A//10\r\nprint(A)\"\"\"\r\n\r\n\r\n\r\n\"\"\"A=input()\r\nB=input()\r\nA1=A[::-1]\r\nif A1==B:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\"\"\"\r\n\r\n\r\n\r\n\r\n\"\"\"A=int(input())\r\nB=list(map(int,input().split()))\r\nif 1 in B:\r\n print(\"HARD\")\r\nelse:\r\n print(\"EASY\")\"\"\"\r\n\r\n\r\n\r\n\"\"\"A=int(input())\r\nif A%2==0:\r\n print(A//2)\r\nelse:\r\n print(-(A+1)//2)\"\"\"\r\n\r\n\r\nA=int(input())\r\nB=list(map(int,input().split()))\r\nsum=0\r\nfor i in B:\r\n sum=sum+i\r\nresult=sum/A\r\nprint(\"{:.12f}\".format(result))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s=int(input())\r\nls=list(map(int,input().split()))\r\nk=s*100\r\nsm=(sum(ls))\r\nprint((sm/k)*100)", "from decimal import *\r\ngetcontext().prec = 12\r\n\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\n\r\nprint(Decimal(sum(s))/Decimal(n))", "input1 = input() # total number of drinks.\r\ninput2 = input() # string containing the fractions of OJ per drink.\r\n\r\n# Need to calculate the average volume of OJ based on total n drinks.\r\n\r\npercentages = input2.split() # makes list of percentages.\r\ntotal = 0\r\n\r\nfor n in range (int(input1)):\r\n total += int(percentages[n])\r\n \r\n\r\noutput = total/int(input1)\r\nprint(output)", "def code(*args):\r\n arr, n = args\r\n\r\n result = float(sum(arr)/n) \r\n\r\n return \"{:.12f}\".format(result) \r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n result = code(arr, n) # Pass arguments\r\n print(result)\r\n\r\n", "n = int(input())\np = list(map(int, input().split()))[:n]\nk = sum(p)\nprint(k/len(p))", "import math\r\n\r\nn = int(input())\r\n\r\norange = list(map(int, input().split()))\r\nans = 0;\r\nfor i in orange:\r\n ans += i/100;\r\n\r\nprint(ans/n * 100)", "n = int(input())\r\nsum = 0\r\nnumbers = input().split()[:n]\r\nfor i in range(len(numbers)):\r\n numbers[i] = int(numbers[i])\r\n sum += numbers[i]\r\nprint(sum/n)", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum=sum(a)\r\navg=sum/n \r\nprint(avg)\r\n ", "n = int(input()) #n种饮料\np = list(map(int, input().split())) #橙汁的体积分数\n\norange_juice = sum(p) / (n * 100) #体积分数%\nprint(\"{:.12f}\".format(orange_juice * 100)) #小数点后12位\n\n \t \t\t \t \t \t\t \t\t \t \t\t\t\t \t\t", "n = int(input())\r\nL = [int(x) for x in input().split()]\r\nsm =0\r\nfor i in L:\r\n sm = sm +i\r\nans = ((sm / n))\r\nprint(ans)\r\n", "import math\r\nimport os\r\nt = 1\r\n# t = input()\r\n# t = int(t)\r\n\r\nn = input()\r\nn = int(n)\r\narr = list(map(int, input().split()))\r\nprint(sum(arr)/n)\r\n# for _ in range(int(input())):\r\n # grid = [list(map(int, input().split())) for _ in range(3)]\r\n # result = [[1] * 3 for _ in range(3)]\r\n # n, s, r = map(int, input().split())\r\n # arr = list(map(int, input().split()))\r\n # n = input()\r\n # n = int(n)", "san = int(input())\r\nsandar = list(map(int, input().split()))\r\nprint(sum(sandar)/san)", "n = int(input())\r\np = [*map(int, input().split())]\r\ntp = 0\r\nfor i in p: tp = tp + i\r\nprint(float(tp/n))\r\n", "drinks = int(input())\r\npercentages = list(map(int, input().split()))\r\norangeness = 0\r\norangeness += sum(percentages)\r\nprint(orangeness/drinks)", "n = int(input())\nA = list(map(int, input().split()))\nprint(sum(A)/(n))\n# Tue Jul 04 2023 11:28:21 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\naverage = sum(l) / n\r\n\r\n# Round the average to 12 decimal places and print with desired format\r\nformatted_average = \"{:.12f}\".format(average)\r\nprint(formatted_average)\r\n", "n=int(input())\r\na=list(map(int,input().split( )))\r\ni=0\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+a[i]\r\nprint(sum/n)", "N = int(input())\r\njärjend = list(map(int,input().split()))\r\nprint(sum(järjend)/N)\r\n \r\n", "n = int(input())\r\nlst = list(map(int, input().split(\" \")))\r\nfr = 0\r\nfor i in range(n):\r\n fr += lst[i]/100\r\nvl = (fr/n)*100\r\nprint(vl)\r\n", "n = int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n c+=a[i]\r\nd=n*100\r\nf=float((c/d)*100)\r\nprint(f)", "p = int(input())\r\nq = list(map(int, input().split()))\r\nresult = sum(q) / p\r\nprint(result)", "g=int(input())\r\nc=list(map(int,input().split()))\r\nj=g\r\ntot=sum(c)\r\ngh=tot/j\r\nprint('{:.10f}'.format(gh))", "t = int(input())\r\nn = list(map(int, input().split()))\r\ns = sum(n)\r\nl = len(n)*100\r\nres = s/l\r\nprint(round(res*100, 12))", "def f(data):\r\n return sum(data)/len(data)\r\n\r\n\r\nn = int(input())\r\noranges = input().split(\" \")\r\noranges = [int(i) for i in oranges]\r\nprint(f(oranges))", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\nb=sum(l)\r\nprint(b/n)", "input()\r\na = input()\r\na = a.split()\r\nm = 0\r\nfor i in a:\r\n m += int(i)\r\nprint(m/len(a))", "a = int(input())\r\nb = input().split()\r\nnum_list = list(map(int, b))\r\nc = 0\r\nf = 0\r\nwhile c != a:\r\n d = num_list[c]\r\n f = f + d\r\n c = c + 1\r\ng = f / c\r\nprint(g)\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nx=sum(ar)\r\nres=x/n\r\nprint(res)", "n=int(input())\r\nstring1=input()\r\nlst1=string1.split()\r\nlst2=[int(num) for num in lst1]\r\nsum=0\r\nfor i in range(0,n):\r\n orange=(lst2[i]/100)\r\n sum=sum+orange\r\nprint((sum/n)*100)", "n = int(input())\nsoma = [int(x) for x in input().split()]\nprint(f\"{sum(soma)/n:.7f}\")\n\n\t \t\t\t\t \t\t \t\t\t\t \t\t \t\t\t\t\t\t\t \t", "number_of_drinks = int(input())\r\npercentage_in_each = input().split()\r\ntotal_percentage = 0\r\nfor percentage in percentage_in_each:\r\n total_percentage += int(percentage) / number_of_drinks\r\nprint(total_percentage)\r\n", "n = int(input())\r\na = map(int, input().split())\r\nprint(sum(a) / n)", "n=int(input())\r\nlst=[int(i) for i in input().split()]\r\nx=sum(lst)\r\nprint(x/(n))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nsum1=sum(x)\r\nprint(sum1/n)", "n=int(input())\nlista= input().split(' ')\nlista=map(int,lista)\nprint (sum(lista)/n)\n \t \t \t \t\t \t\t\t\t \t \t\t \t", "n = int(input())\r\np = list(map(int, input().split()))\r\noutput = 0\r\n\r\nfor i in p:\r\n output += i\r\n\r\noutput /= n\r\n\r\nprint(output)", "n = int(input())\r\nvalues = input().split()\r\n\r\ntotal = 0\r\n\r\nfor item in values:\r\n total += int(item)\r\n\r\nprint(total/n)", "n = int(input())\r\n\r\nlst = list(map(int, input().strip().split()))[:n]\r\n\r\ns = sum(lst) / 100\r\nr = s / (n / 100)\r\nprint(\"{:.11f}\".format(r))", "n = int(input())\r\na = list(map(int, input().split()))\r\nsum = sum(a)\r\nans = sum / n\r\nprint(\"{:.12f}\".format(ans))\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nsum = 0\r\nfor i in p:\r\n sum += i\r\n \r\nprint(f'{sum/n:.12f}')", "def main() :\r\n print(volume_Fraction_Of_Cocktail(input_Volume_Fractions_Of_Orange_Juice()))\r\n\r\n\r\ndef volume_Fraction_Of_Cocktail(volume_factions_of_orange_juice) :\r\n return sum(volume_factions_of_orange_juice) / len(volume_factions_of_orange_juice)\r\n\r\n\r\ndef input_Volume_Fractions_Of_Orange_Juice() :\r\n ignore_Line()\r\n return input_Array()\r\n\r\ndef ignore_Line() :\r\n input()\r\n\r\ndef input_Array() :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "n=int(input())\r\na=list(map(int,input().split()))\r\nres,sum=0,0\r\nfor i in range(n):\r\n sum+=a[i]\r\nres=sum/n\r\nprint(\"{:.12f}\".format(res))\r\n", "\r\nimport math\r\nn = int(input())\r\nm = input()\r\ng = m.split()\r\nalist = []\r\nxlist = []\r\nsumt=0\r\nfor x in g:\r\n alist.append(x)\r\nfor l in alist:\r\n xlist.append(int(l))\r\nfor j in xlist:\r\n sumt+=j\r\nu=sumt\r\nv=(1/n)*(u)\r\nprint(v)\r\n ", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\ntotal_volume_fraction = sum(volume_fractions)\r\naverage_volume_fraction = total_volume_fraction / n\r\n\r\nprint(average_volume_fraction)", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nc=0.0000000\r\nfor i in lis:\r\n c+=i/100\r\nprint(c/n * 100)\r\n", "t=int(input())\r\narr=list(map(int,input().split()))\r\ns=sum(arr)\r\ntemp_res=float(s/t)\r\n\r\n \r\nprint(f'{temp_res:.9f}') ", "n = int(input())\r\na = input().split()\r\ni = 0\r\nsum = 0\r\nwhile(i<len(a)):\r\n sum = sum + int(a[i])\r\n i = i + 1\r\nprint(sum/len(a))", "n = int(input())\r\ns = 0\r\nb = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n s += b[i]/100\r\nprint((s/n)*100)", "n = int(input())\r\nm = list(map(int, input().split()))\r\nprint((sum(m))/(len(m)))", "n=int(input())\r\nlistt=list(map(int,input().split()))\r\nprint(sum(listt)/n)\r\n\r\n \r\n\r\n", "a = int(input())\r\nl = list(map(int, input().split()))\r\nr = sum(l)/len(l)\r\nprint(r)\r\n", "number_of_orange_containing_drink = int(input())\r\nvolume_fraction_of_orange_juice = map(int, input().split())\r\npercent = 0\r\n\r\nsum = sum(volume_fraction_of_orange_juice)\r\n \r\npercent = (sum / (number_of_orange_containing_drink * 100)) * 100\r\nprint(percent)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in a:\r\n sum=sum+(i/n)\r\nprint(\"%.11f\" % sum)\r\n", "tamanho = int(input(\"\"))\r\nlista = list(map(int, input(\"\").split()))\r\npercentual=0\r\nfor i in range(len(lista)):\r\n percentual += lista[i]\r\nprint(percentual/tamanho)\r\n", "n = int(input())\njuice = list(map(int, input().split()))\n\nif n == len(juice):\n avg_juice = sum(juice) / n\n print(\"%.12f\" % avg_juice)\n\n\t\t\t\t\t\t\t\t \t \t \t \t\t\t\t \t\t\t\t", "n = int(input())\r\na = input().split(\" \")\r\nsumi = 0\r\nfor i in range(n):\r\n sumi+=int(a[i])\r\nprint(sumi/n)", "n=int(input())\r\ns=0\r\np=input().split()\r\nfor i in range(0,n,1):\r\n s=s+int(p[i])\r\nprint(s/n)", "n = int(input())\r\ns = list(map(int,input().split()))\r\nnum = sum(s)/len(s)\r\nprint(\"{:.12f}\".format(num))", "n = int(input())\r\nsum = 0\r\narray = input().split()\r\nfor x in array:\r\n sum = sum+int(x)\r\nprint(sum/n)\r\n", "#import decimal\r\n#decimal.getcontext().prec = 6\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n#print(decimal.Decimal(sum(p)) / (decimal.Decimal(n)))\r\nprint(sum(p) / (n))\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ns = 0 \r\nfor i in x:\r\n s += i / 100\r\nprint((s / n) * 100)", "def orange_juice(drinks):\r\n sum = 0\r\n for percent in drinks:\r\n sum += percent\r\n return sum / len(drinks)\r\n\r\nn = int(input())\r\nprint(orange_juice(drinks=[int(item) for item in input().split()]))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in l:\r\n ans+=i\r\nprint(ans/n)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nk=0\r\nfor i in m:\r\n k=k+i\r\n\r\nl=k/n\r\nprint(round(l,12))\r\n \r\n \r\n ", "a , b , s = int(input()) , input().split(' ') , 0\r\nfor i in range(a):\r\n s=s+int(b[i])\r\nprint(s/a)", "n = int(input())\r\nsum = sum(list(map(int,input().split())))\r\nprint(sum / n)", "n = int(input())\r\ns = input().split()\r\nsm = 0\r\nfor i in s:\r\n sm += int(i)\r\n\r\nprint(sm/n)\r\n", "# بسم الله (accepted)\r\n# solution : analyzing the sample input and output , we can observe that this is a mere mean-value problem\r\nn = int(input())\r\npercentage_list = input().split(' ')\r\ntotal = 0\r\nfor percentage in percentage_list :\r\n total += int(percentage)\r\nprint(total/n)", "n = int(input())\r\nl =[int(x)/100 for x in input().split()]\r\nx = (sum(l)/n)*100\r\nprint(f\"{x:.12f}\")", "op = int(input())\r\nd = list(map(int, input().split()))\r\nprint(sum(d) / op)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a,n=[],int(input())\r\nb=map(int,input().split())\r\nfor i in b:\r\n a.append(i/n)\r\nprint(sum(a))", "def cal_average(arr):\r\n return sum(arr)/len(arr)\r\n\r\nn = int(input())\r\n\r\ndrinks = list(map(int, input().split()))\r\n\r\nprint(cal_average(drinks))", "n = int(input())\r\np = list (map(int,input().split()))\r\n\r\nlistp = []\r\nfor i in range(n):\r\n listp.append(p[i])\r\n\r\nprint(sum(listp)/n)", "n=int(input())\nsum=0\na=input().split()\nfor i in a:\n sum=sum+int(i)\n avg=sum/n\nprint(\"{:.12f}\".format(avg))\n", "length=int(input())\r\ncase=input()\r\ncaseLst=list(map(int,case.split()))\r\nprint(sum(caseLst)/length)", "d = int(input())\na = input().split()\nfor i in range(d):\n a[i] = int(a[i])\nt = 0\nfor i in range(d):\n t += a[i]\nprint(t / d)", "n = int(input())\r\nprint(sum((map(int,input().split()))) / n)", "no_of_drinks = int(input())\r\n\r\ndrinks = list(map(int, input().split(\" \")))\r\n\r\nprint(f\"{sum(drinks)/no_of_drinks}\")", "n_drinks = int(input())\r\nvol = input().split()\r\nsum = 0\r\n\r\nfor i in range(len(vol)):\r\n sum += int(vol[i])\r\n\r\nvol_fra = sum/n_drinks\r\n\r\nprint(f'{vol_fra:.12f}')", "n = int(input())\r\n\r\nvalues = map(int,input().split())\r\n\r\nx = sum(values)\r\n\r\nprint(x / n)\r\n", "n = int(input())\r\ncin = input().split()\r\nans = 0\r\nfor i in range(n):\r\n ans += int(cin[i])\r\nprint(round(ans / n,12))", "n=int(input())\r\nl = list(map(int, input().split()))\r\ns=0\r\nfor x in l:\r\n s+=x/100\r\nprint(round(s/n * 100,11))\r\n", "n = int(input())\r\nstring = input().split()\r\nsumm = 0\r\nfor i in string:\r\n summ += int(i)\r\nprint(summ / n)\r\n", "n = int(input())\r\nprint(sum( list(map(int, input().split())) ) / n)", "n = int(input())\r\nvec = (int(i) for i in input().split())\r\nsumma = sum(vec)\r\nprint('%.5f' % (summa / n))", "n=int(input())\r\np=list(map(int,input().split()))\r\nprint(f\"{sum(p)/n:.12f}\")", "inp1=int(input())\r\nx=input().split(\" \")\r\nc=0\r\nfor i in x:\r\n c+=int(i)\r\nper=c/inp1\r\nprint(per)", "n = int(input())\r\nfractions = list(map(int,input().split()))\r\nx = len(fractions)\r\norange_in_final = sum(fractions)\r\ntotal = x*100\r\npercentage_orange = (orange_in_final/total)*100\r\n\r\nprint((percentage_orange))\r\n\r\n", "n=int(input())\r\nv=list(map(int,input().split()))\r\nprint('{:.12f}'.format(sum(v)/n))", "n = int(input())\r\nv = str(input()).split()\r\nf = 0\r\nfor i in v:\r\n f += int(i)\r\nprint(f/n) \r\n", "n = int(input())\r\ns = 0\r\nx = input().split()\r\nfor i in range(len(x)):\r\n s+=int(x[i])\r\nprint(s/len(x))", "n=int(input())\r\ndre=input()\r\nz=list(map(int, dre.split()))\r\ntotal=0\r\nfor i in z:\r\n dre=i/100\r\n total=total+dre\r\nfinal=total/n\r\nfinal=final*100\r\nprint(final)\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))[:n]\r\ns=0\r\nfor i in a:\r\n t=i/100\r\n s+=t\r\nprint(\"%.12f\" %(s*100/n))", "n=int(input())\r\np=list(map(int,input().split()))\r\ns=sum(p)\r\nprint(s/n)", "n=int(input())\r\nb=sum([int(i) for i in input().split()])\r\nprint(b/n)", "from sys import stdin, stdout\r\n\r\n\r\ndef solution():\r\n\r\n n = int(stdin.buffer.readline().decode())\r\n nums = list(map(int, stdin.buffer.readline().decode().split()))\r\n\r\n return \"{:.11f}\".format(sum(nums) / n)\r\n\r\n\r\ndef main():\r\n T = 1\r\n answers = [solution() for _ in range(T)]\r\n\r\n stdout.write('\\n'.join(map(str, answers)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input()) # Number of orange-containing drinks\r\nfractions = list(map(int, input().split())) # Volume fractions of orange juice in each drink\r\n\r\n# Calculate the overall volume fraction in Vasya's cocktail\r\ntotal_volume = sum(fractions) # Sum of volume fractions of all drinks\r\ncocktail_fraction = total_volume / n # Calculate the average fraction\r\n\r\n# Output the result with 4 decimal places\r\nprint(\"{:.4f}\".format(cocktail_fraction))\r\n\"\"\"n=int(input(\"\"))#inputing the n\r\nsum=0\r\n\r\nfor i in range(n):\r\n sum=sum+int(input()) #inputing eachfraction\r\n \r\nprint(sum/n)\"\"\"\r\n\r\n\r\n\r\n", "a=int(input())\r\nb=map(int,input().split(\" \"))\r\ns=0\r\nfor i in b:\r\n s+=i\r\nprint(s/a)", "n=int(input())\r\nx=input()\r\na=x.split(' ')\r\nsumm=0.0\r\nfor i in range (0,n):\r\n summ+=int(a[i])\r\nprint(float(summ/n))", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\ntotal = sum(percentages)\r\ncocktail = total / n\r\nprint(\"{:.12f}\".format(cocktail))\r\n", "a=int(input())\r\nm=list(map(int,input().split()))\r\nc=0\r\nfor i in m:\r\n c=c+(i/100)\r\nprint(round(((c/a)*100),12))", "n=int(input())\r\nvol_frac=list(map(int,input().split()))\r\nave_vol_frac=sum(vol_frac)/n\r\nprint(\"{:9f}\".format(ave_vol_frac))", "n=int(input())\nprint(format(sum(list(map(int,input().split())))/n,'.12f'))", "n = int(input())\r\n\r\njuice = list(map(int, input().split()))\r\n\r\nprint(sum(juice) / n)\r\n", "from decimal import *\r\ngetcontext().prec=10\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nprint(Decimal(sum(a))/Decimal(len(a)))", "import math\r\nnum = int(input())\r\nl_d = input().split(\" \")\r\nres = 0.0\r\nfor i in l_d:\r\n res += int(i)\r\nprint(res*(1/(num)))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nprint('%.12f' %(sum(l)/n))", "n = int(input())\r\nf = list(map(int, input().split()))\r\n\r\ntotal = sum(f) / 100\r\ncount = (total / n) * 100\r\n\r\nprint(count)\r\n", "n = int(input())\r\ncocktail = [int(x) for x in input().split()]\r\nsum = 0\r\nfor i in range(n):\r\n sum += (cocktail[i] / 100)\r\n\r\nprint('%.12f' % ((sum / n) * 100))\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(a):\r\n ans += b[i]\r\nprint(ans / (100 * a) * 100)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint('%.4f'%(sum(a)/n))", "def calculate_orange_juice_fraction(n, percentages):\r\n total_percent = sum(percentages)\r\n return total_percent / n\r\n\r\n\r\nn = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\nresult = calculate_orange_juice_fraction(n, percentages)\r\nprint('{:.12f}'.format(result)) \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=sum(a)\r\nprint(c/(n*100)*100)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\ntotal_p = 0\r\nfor percentage in percentages:\r\n total_p += percentage\r\n\r\ncocktail_percent = total_p/ n\r\nprint(\"{:.6f}\".format(cocktail_percent))\r\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(a)):\r\n s+=(a[i]/100)\r\nk=(s/n)*100\r\nprint(\"%.12f\"%k)\r\n ", "print((1 / int(input())) * sum([int(drink) for drink in input().split(' ')]))", "n = int(input())\r\npercents = list(map(int, input().split()))\r\n\r\nprint((sum(percents))/n)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nprint(sum(a)/n)\r\n", "n=int(input())\nk=0\np=list(map(int,input().split()))\nfor i in range(n):\n k+=p[i]\nf=k/n\nprint(round(f, 12))\n ", "n = int(input())\nm = input().split()\nx = 0\nfor i in m:\n\tx += int(i)\n\nprint(x/n)\t", "import sys\r\n#file=open(\"C:/Users/MAHAMUD MATIN/Desktop/input.txt\", \"r\").readlines()\r\nfile=sys.stdin.readlines()\r\nn=int(file[0])\r\nl=list(map(int, file[1].split()))\r\nsum=0\r\nfor i in range(n):\r\n sum+=l[i]/100\r\nd=sum/n*100\r\nsys.stdout.write(str(d))", "\r\nn=int(input())\r\nc=0\r\na=map(int,input().split())\r\nfor i in a:\r\n c=c+i\r\n\r\nc=c/n\r\nprint(c)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(round((sum(l)/n),12))\r\n", "n = float(input())\nval = list(map(float, input().split()))\n\nprint(f\"{(sum(val) / n):.12f}\")\n\t \t \t\t\t\t\t \t \t\t \t\t \t \t \t \t", "def solve(n, arr):\r\n res = sum(arr)/(100*n)\r\n print(res*100)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n pi = [int(x) for x in input().split()]\r\n solve(n, pi)", "n = int(input())\r\np = list(map(int, input().split()))\r\ntotal = 0\r\nfor i in p:\r\n total+=i\r\nprint(total/n)", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\na=0\r\nfor i in range(len(l)):\r\n a=a+l[i]\r\nprint(a/(n))\r\n\r\n", "n =int(input())\r\n\r\ni = list(map(int, input().split()))\r\n\r\norange = sum(i)\r\n\r\ndrink = orange/n\r\n\r\nprint(drink)", "n=int(input())\r\ns=0\r\np = list(map(int,input().split()))\r\ns=sum(p)\r\nx=s/n\r\nprint(x)", "a=int(input())\r\ns=[int(i) for i in input().split()]\r\nd=sum(s)/a\r\nprint(format(d,'.11f'))\r\n", "n = int(input())\r\ny = input().split()\r\nfor i in range(len(y)):\r\n y[i] = int(y[i])\r\nprint((sum(y)) / n)", "n = int(input())\r\nm = map(int, input().split())\r\n\r\nprint(sum(m) / n) \r\n\n# Tue Jul 04 2023 11:18:04 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = [*map(int, input().split())]\r\n\r\nfor i in range(n):\r\n result = sum(a)\r\n new = result/n\r\nprint((new))", "t=int(input())\r\nn=list(map(int,input().split()))\r\nprint(sum(n)/t)", "n = int(input())\r\n\r\nnum = list(map(int,input().split()))\r\n\r\naverage = sum(num)/len(num)\r\n\r\nprint(f'{average:.12f}')\r\n", "n = int(input())\r\ns = input().split()\r\nc = 0\r\nfor j in range(n):\r\n c+=(int(s[j])/100)\r\nprint ((c/n)*100)", "x=int(input())\r\nsum=0\r\ndr=input().split()\r\nfor i in range(x):\r\n sum+=int(dr[i])\r\nprint(sum/x) \r\n", "n = int(input())\r\n\r\nl = map(int, input().split(' '))\r\n\r\nl = sum(l)/n\r\n\r\nprint(l)", "n = int(input())\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nprint(sum(arr)/n)", "n = int(input()) # Number of drinks\r\npi_values = list(map(int, input().split())) # List of volume fractions\r\n\r\n# Calculate the proportions of each drink as decimals\r\nproportions = [pi / 100 for pi in pi_values]\r\n\r\n# Calculate the total proportion of orange juice in the cocktail\r\ntotal_proportion = sum(proportions) / n\r\n\r\n# Convert the total proportion back to a percentage\r\ncocktail_percentage = total_proportion * 100\r\n\r\n# Print the result with 4 decimal places\r\nprint(\"{:.4f}\".format(cocktail_percentage))\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nc=0\r\nfor i in l:\r\n c+=i\r\nprint(c/n)\r\n", "tam = int(input())\n\njugo_perc = [int(x) for x in input().split(\" \")]\n\nnum1 = sum(jugo_perc)\n\nans = num1 / tam\n\nprint(format(ans, '.12f'))\n\t \t\t \t\t \t \t \t \t \t\t\t \t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nsum = 0\r\nfor i in range(n):\r\n sum = sum + l[i]\r\n \r\nprint(sum/n)\r\n \r\n ", "x=int(input())\r\ny=list(map(int,input().split()))\r\navg=0\r\nfor i in range(x):\r\n avg+=y[i]\r\nprint(float(avg/x))", "n=int(input())\r\nx=[int(x) for x in input().split()] \r\ns=(sum(x))\r\nt=s/n\r\nprint(t)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ntotal_percent = sum(percentages)\r\navg_percent = total_percent / n\r\n\r\nprint(avg_percent)\r\n\r\n\r\n\r\n\r\n", "inp = float(input(\"\"))\ninp2 = input(\"\").split()\nlst = [int(x)/inp for x in inp2]\n\nprint(sum(lst))", "n = int(input())\r\n\r\nln = list(map(int, input().split(' ')))\r\n\r\nsumm = 0\r\nfor i in ln:\r\n summ += i/100\r\n\r\nprint((summ/n) * 100)", "x=int(input())\r\ns=list(map(int,input().split()))\r\nlis=[]\r\nfor i in range(x):\r\n lis.append(s[i]/100)\r\nprint((sum(lis)/x)*100)\r\n", "n = int(input())\r\np = [int(x) for x in input().split()]\r\nprint(sum(p)/n)", "n = int(input())\r\np = list(map(int,input().split(maxsplit = n)))\r\nc = 0\r\nfor i in range(n):\r\n c += p[i]\r\nprint(c/n)", "number = int(input())\r\nsum_number = 0\r\nfor i in input().split():\r\n i = int(i)\r\n sum_number += i\r\nresult = sum_number/number\r\nprint('%.12f' %result)", "num = int(input())\r\njuise = input().split(' ')\r\ntotal = 0.000000000000\r\nfor i in range(num):\r\n piece = float(juise[i])/100\r\n total += piece\r\npresent = (total/num)*100\r\nprint(round(present, 12))", "n = int(input())\r\np= list(map(int, input().split())) \r\ns = sum(p)/ n\r\nprint(s)\r\n", "n =int(input())\r\nlis = list(map(int, input().split()))\r\ncount = 0\r\nfor i in lis:\r\n if i % 100 == 0 and i != 0:\r\n count += 1\r\n else:\r\n count += i / 100\r\nprint((count/n) * 100)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Jun 28 13:57:08 2023\n\n@author: yesenia\n\"\"\"\n\norange = int(input())\n\nportions =[int(i)for i in input().split(\" \")]\n\nsuma = 0\n\nfor i in portions:\n suma += i\n\nprint(suma/orange)\n\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\ntotal = sum(li)\r\navg = total / n\r\nprint(avg)", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nresult = 0\r\nfor i in p:\r\n result += i/100\r\n\r\nprint((result/n)*100)\r\n", "n = int(input())\ns = [int(i) for i in input().split()]\nc = 0\nfor i in s:\n c += i\nprint(c / n)", "n = int(input())\r\na = [*map(int, input().split())]\r\nans = 0\r\nfor i in a:\r\n ans+=i\r\nprint(ans/n)\r\n\n# Tue Jul 04 2023 12:46:18 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\npi=input()\r\nper=pi.split(\" \")\r\nx=0\r\nfor i in range(0,len(per)):\r\n x+=(int(per[i])/100)\r\nresult=(x/n)*100\r\nprint(result)", "\r\nn = int(input())\r\npi = list(map(int, input().split()))\r\n\r\nsum_of_pi = sum(pi)\r\n\r\nweighted_average = sum_of_pi / n\r\n\r\nprint(\"{:.12f}\".format(weighted_average))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=(sum(a))/(len(a)*100)\r\nprint(round(l*100,12))", "n= int(input())*100\r\nnum1=[]\r\nnum= input().split(' ')\r\nfor i in num:\r\n num1.append(int(i))\r\nsum1= sum(num1)\r\nper =float((sum1/n)*100)\r\nprint(per)", "n = int(input())\r\nfractions = list(map(int, input().split()))\r\n\r\ntotal_volume = sum(fractions)\r\naverage_fraction = total_volume / n\r\n\r\nprint(\"{:.12f}\".format(average_fraction))\r\n", "# URL: https://codeforces.com/problemset/problem/200/B\nn = int(input())\nprint(sum(map(int, input().split())) / n)\n", "a=int(input())\r\nb=list(map(int, input().split()))\r\nans=sum(b)/a\r\nprint(f'{ans:.4f}')\n# Tue Jul 04 2023 14:54:17 GMT+0300 (Moscow Standard Time)\n", "n=int(input(''))\r\nx=list(map(str,input().split()))\r\nc=0\r\nfor i in range (n) :\r\n c+=int(x[i])\r\n\r\nprint(c/n)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nprint((s/(n*100))*100)", "from collections import Counter\r\nN = int(input())\r\nls = list(map(int, input().split()))\r\nans = 0\r\nfor item in ls:\r\n ans += item / 100\r\nprint(ans / N * 100)", "def Drinks(percent, n):\r\n \r\n sum =0\r\n for i in range(len(percent)):\r\n \r\n percent[i] = percent[i]/100\r\n \r\n sum += percent[i]\r\n return (sum/n)* 100\r\n \r\nn, percent = int(input()), map(int, input().split())\r\npercent = list(percent)\r\n# print(percent)\r\nprint(Drinks(percent,n))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=sum(l)/100\r\nprint((r/n)*100)\r\n\r\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nprint(\"%.12f\" %(sum(lst)/n))", "# Input\r\nn = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\n# Calculate the weighted average\r\ntotal_percentage = 0\r\nfor p in percentages:\r\n total_percentage += p / 100\r\n\r\ncocktail_percentage = (total_percentage / n) * 100\r\n\r\n# Output\r\nprint(cocktail_percentage)\r\n", "n=int(input())\r\nv=list(map(int,input().split()))\r\no=sum(v)\r\njuice=o/n\r\nprint(juice)", "a=int(input())\r\nmylist=list(map(int,input().split()))\r\nprint(sum(mylist)/a)\r\n", "products_number = int(input())\r\npercentage = list(map(int, input().split()))\r\n\r\nfirst_divider = 0\r\nfor i in percentage:\r\n first_divider += 1 * i / 100\r\n\r\nprint(first_divider / products_number * 100)", "a = int(input())\r\nb = sum(list(map(int,input().split())))\r\nprint(b/(a*100)*100)", "n = int(input())\r\ns= list(map(int, input().split()))\r\nvol = sum(s)\r\navg = vol / n\r\nprint(\"{:.10f}\".format(avg))\r\n", "import math\neps=10**-9\ndef equal(a,b): #=\n return abs(a-b)<eps\n \ndef less(a,b): #<\n return b-a>eps\n\ndef bi(a,b): #>\n return a-b>eps\nimport math\neps=10**-9\ndef equal(a,b): #=\n return abs(a-b)<eps\n \ndef less(a,b): #<\n return b-a>eps\n\ndef bi(a,b): #>\n return a-b>ens\na=int(input())\nl=list(map(int,input().split()))\nprint(sum(l)/(a*100)*100)\n\n# Tue Jul 04 2023 11:44:56 GMT+0300 (Moscow Standard Time)\n", "x = int(input())\r\nt = 100*x\r\no = 0\r\narr = [int(i) for i in input().split()]\r\nfor i in arr:\r\n o += i\r\nprint(o/t*100)", "def average_drinks(n, o_drinks):\r\n total = 0\r\n for drink in o_drinks:\r\n total += drink\r\n avg = total / n\r\n return avg\r\n\r\ndef main():\r\n n = int(input())\r\n o_drinks = list(map(int, input().split())) # Convert the map to a list\r\n result = average_drinks(n, o_drinks)\r\n print(f\"{result:.10f}\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\npi = list(map(int, input().split()))\r\nresult = sum(pi) / n\r\nprint(result)", "print(f\"{(1 / int(input())) * sum([int(x) / 100 for x in input().split()]) * 100:.9f}\")", "a=0\r\nn=int(input())\r\np=map(int,input().split())\r\nfor i in p:\r\n a+=i\r\nprint(a/n)", "n = int(input())\r\np_values = list(map(int, input().split()))\r\ntotal = sum(p_values)\r\n\r\naverage = total / n\r\nprint(average)\r\n", "x=int(input())\r\nw=input().split(' ')\r\nc=0\r\nfor i in w:c+=int(i)\r\nprint(c/x)", "n = int(input())\r\nlist1 = list(map(int, input().split()))\r\n\r\n\r\nprint((sum(list1)/n))", "n = int(input())\r\npi = list(map(int, input().split()))\r\n\r\nweighted_sum = sum(p / 100 for p in pi) / n\r\n\r\npercentage = weighted_sum * 100\r\n\r\nprint('{:.4f}'.format(percentage))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ntot=n\r\nup=0\r\nfor i in l:\r\n up+=(i/100)\r\nprint((up/tot)*100)", "# https://codeforces.com/problemset/problem/200/B\r\n\r\ninput()\r\np = [int(x) for x in input().split()]\r\nprint(sum(p)/len(p))\r\n", "n = int(input())\npercentages = list(map(float, input().split()))\n\nsum_socks = sum(percentages)\naverage_sock = sum_socks / n\n\nprint(round(average_sock, 9))\n# Tue Jul 04 2023 11:40:25 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\namount=list(map(int,input().split()))\r\npercent=0\r\nfor i in range(n):\r\n amount[i]/=100\r\n percent+=amount[i]\r\n result_percent =(percent/n)*100\r\nprint(result_percent)", "print((1/int(input()))*sum(map(int,input().split())))", "def fg():\r\n return int(input())\r\ndef fgh():\r\n return[int(xx) for xx in input().split()]\r\ndef fgt():\r\n return map(int,input().split())\r\ndef fgs():\r\n return input()\r\nn=fg()\r\ns=fgt()\r\nprint((sum(s)/(n*100))*100)", "n = int(input())\r\npercentages = list(map(int, input().split()))\r\n\r\ntotal_percentage = sum(percentages)\r\ncocktail_percentage = total_percentage / n\r\n\r\nprint(cocktail_percentage)\r\n", "n=int(input())\r\nfrac=list(map(int,input().split()))\r\navg=sum(frac)/n\r\nprint(avg)", "n = int(input())\r\np = list(map(int, input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n sum += p[i] / 100\r\nvol = (sum / n) * 100\r\nprint(vol)", "kol=int(input())\ncok=list(map(int,input().split()))\nprint(sum(cok) / kol)\n\n# Tue Jul 04 2023 11:30:25 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\na=input().split()\r\na=[int(e) for e in a]\r\nprint((sum(a))/n)\r\n", "n=int(input())\r\nlst=[int(i) for i in input().split()]\r\ntemp=0\r\nfor percentage in lst:\r\n temp+=percentage\r\nprint('{:.12f}'.format(temp/n))", "n = int(input())\r\n\r\nl = list(map(int, input().split()))\r\n\r\ns =0\r\n\r\nfor i in range(len(l)):\r\n s = l[i] + s\r\n\r\n\r\nr = 100 *n\r\n\r\nfr = s/r\r\n\r\nprint(fr * 100)", "n=int(input())\r\np=list(map(int,input().split()))\r\nsum=0\r\nfor elements in p:\r\n sum=sum+elements\r\nprint(sum/n)", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in a:\r\n sum=sum+i\r\nprint(f\"{sum/n:.12f}\")\r\n", "n=int(input(''))\r\ns=input('')\r\nb=s.split(' ')\r\nsum=0\r\nfor i in b:\r\n sum+=int(i)\r\nprint(sum/n)", "a=int(input())\r\nc=list(map(int,input().split()))\r\nl=0\r\nfor i in c:\r\n l+=i\r\nprint(\"{:.11f}\".format(l/a))", "n = int(input())\r\npercentages = [int(x) for x in input().split()]\r\n\r\nprint(sum(percentages) / n)\r\n", "drink = int(input())\r\ntotal_mL = 0\r\nmL = list(map(int,input().split()))\r\nfor x in range(drink):\r\n total_mL += mL[x]\r\nprint(total_mL / drink)", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount= sum(a)/n\r\nprint(count)\r\n\r\n", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\n\r\ntotal_volume = sum(volume_fractions) # Calculate the total volume of all drinks\r\ncocktail_volume = n # The cocktail contains an equal proportion of each drink\r\n\r\n# Calculate the weighted average of the volume fractions\r\norange_juice_fraction = sum(volume_fractions) / cocktail_volume\r\n\r\nprint(\"{:.12f}\".format(orange_juice_fraction))\r\n", "'''\r\n==TEST CASE==\r\nInput:\r\n3\r\n50 50 100\r\n\r\nOutput:\r\n66.666666666667\r\n'''\r\nn=int(input())\r\norange=0\r\n\r\nfor x in list(map(int, input().split())):\r\n orange+=(x/100)\r\n\r\nprint((orange/n)*100)", "u = int(input())\r\ndrinks = list(map(int, input().split()))\r\ns = 0\r\nfor i in drinks:\r\n s += i * 0.01\r\ns /= u\r\nprint(s*100)", "\r\nn=int(input())\r\nn1=input().split(\" \")\r\ns=0\r\nfor i in n1:\r\n s=s+int(i)\r\nprint(f\"{(s/(n*100))*100}\")", "x = int(input())\r\nx = [int(x) for x in input().split()]\r\nprint(sum(x)/len(x))", "n = int(input())\r\np = sum(list(map(int, input().split())))\r\nprint(p / n)", "n=int(input())\r\na= list(map(int, input().split()))\r\nx=0\r\nfor j in range(n):\r\n x+=a[j]/n\r\nprint(x)", "n=int(input())\r\nm=list(map(int,input().split()))\r\ns=0\r\nfor i in m:\r\n s+=i/100\r\nprint((s/n)*100)", "n=int(input())\r\nSum=0\r\nfor x in input().split():\r\n Sum+=int(x)\r\nprint(Sum/n)\r\n\r\n\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\na=sum(lst)\r\nprint(a/n)", "n = int(input())\nj = list(map(int, input().split(\" \")))\ns = 0\nfor p in j:\n s+= p\nprint(s/len(j))", "def main():\n n = int(input())\n percentages = list(map(int, input().split(' ')))\n print((sum(percentages) / n))\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nvolume_fractions = list(map(int, input().split()))\r\naverage_fraction = sum(volume_fractions) / n\r\nprint(format(average_fraction, \".9f\"))", "n = int(input())\r\nactual_total_vol_fraction = 0\r\ntotal_vol_possible = 100*n\r\n\r\nvolume_fraction_in_drinks = input()\r\nvolume_fraction_list = volume_fraction_in_drinks.split(\" \")\r\n\r\nfor volume in volume_fraction_list:\r\n actual_total_vol_fraction += int(volume)\r\n\r\nvol_fraction = actual_total_vol_fraction/total_vol_possible\r\nprint(vol_fraction*100)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nv=0\r\nfor i in range(n):\r\n v+=l[i]\r\nprint(v/n) \r\n ", "if __name__ == \"__main__\":\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n ans = sum(a) / n\r\n print(\"{:.12f}\".format(ans))\r\n", "n = int(input())\r\n\r\np = list(map(int, input().split()))\r\n\r\nSum = sum(p)\r\n\r\nprint(Sum/n)", "n=int(input())\r\ns=list(map(int,input().split()))\r\na=sum(s)\r\nx=a/n\r\nprint(x)", "\r\nn = int(input())\r\npercentages = list(map(int, input().split()))\r\naverage = sum(percentages) / n\r\nprint('{:.4f}'.format(average))\r\n", "n=int(input())\r\npi_values=list(map(int,input().split()))\r\n\r\ntotal_volume=sum(pi_values)\r\n\r\naverage_volume=sum(pi_values)/n\r\n\r\nprint(average_volume)", "n = int(input())\r\nper = list(map(int, input().split()))\r\ntot_per = sum(per)\r\ncock_per = tot_per / n\r\nprint('%.12f' % cock_per)\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(0,n):\r\n sum+=ar[i]\r\nprint(sum/n)\r\n ", "n=int(input())\r\nl=sum(list(map(int,input().split())))\r\nx=l/n\r\nprint(\"{:.12f}\".format(x))\r\n", "\r\ndef drinks(d):\r\n sum = 0\r\n for i in d:\r\n sum += i\r\n return sum/len(d)\r\nif __name__ == '__main__':\r\n b = int(input())\r\n sumb = 0\r\n\r\n d = list(map(int,input().split()))\r\n print(drinks(d))\r\n", "t = int(input())\r\ns = 0.0\r\nch = input().split()\r\nfor i in range(t):\r\n s += int(ch[i])\r\nprint(s/t)\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\nnums = list(map(int, input().split()))\n\nsum = 0\n\nfor num in nums:\n sum += num\n\nresult = sum / n\nsys.stdout.write(f\"{result}\")\n", "n = int(input())\r\njuices = map(int, input().split())\r\n\r\nresult = sum(juices)/n\r\nprint(result)", "n = int((input()))\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in l:\r\n z = i/100\r\n c = c + z\r\nprint((c/n)*100)", "n = int(input())\r\np = list(map(int, input().split()))\r\ntotal = sum(p)\r\nfraction = total / (n * 100)\r\nprint(fraction * 100)\r\n", "n = int(input())\r\nm = map(int,input().split())\r\nprint(sum(m)/n)", "m= int(input())\r\nl=[int(x) for x in input().split()]\r\nprint(sum(l)/m)", "t=int(input())\r\nls=list(map(int,input().split()))\r\na=0\r\nfor i in ls:\r\n \r\n a+=i\r\nprint(a/t)", "drinks = int(input())\r\npercent = list(map(int,input().split(\" \")))\r\nans = (sum(percent))/drinks\r\nprint(ans)", "a = int(input())\nsum = 0\nlines = input().split()\n\nfor i in lines:\n sum += int(i)\n\nprint((sum) / len(lines))", "# import sys \n# sys.stdin = open(\"/Users/swasti/Desktop/coding/cp/codeforces/input.txt\", \"r\")\n# sys.stdout = open(\"/Users/swasti/Desktop/coding/cp/codeforces/output.txt\", \"w\")\nn = int(input())\npercentage = list(map(int,input().split()))\ntotal_percentage = []\nfor i in percentage:\n total_percentage.append(i/100)\n\nprint((sum(total_percentage))/n*100)\n\n", "number = int(input())\nvolratio = list(map(int, input().split()))\ntotal = sum(volratio)/100\nprint((total/number)*100)\n", "n = int(input())\r\n\r\nl = [int(x) for x in str(input()).split()]\r\nprint(sum(l)/n)", "n=int(input())\nls=(list(map(int,input().split())))\nsum_=sum(ls)\nans=sum_/n\nprint(ans)", "number = int(input())\r\nelements = [int(el) for el in input().split(\" \")]\r\nel_sum = sum(elements)\r\nans = el_sum / number\r\nprint(ans)", "dzielnik = int(input())\r\nlista = list(map(int, input().split()))\r\ndzielna = 0\r\nfor i in range(dzielnik):\r\n dzielna += lista[i]\r\nprint(dzielna / dzielnik)", "n=int(input())\r\nar=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=ar[i]\r\nprint(s/n)", "n = int(input())\np = input().split()\nans = 0\nfor i in range(n):\n ans += int(p[i])\nprint(f'{ans / n:.12f}')\n# Tue Jul 04 2023 11:29:31 GMT+0300 (Moscow Standard Time)\n", "drinks = int(input())\r\n\r\ndrink_percent = list(map(int, input().split(\" \")))\r\n\r\nprint(sum(drink_percent)/drinks)", "n = int(input())\r\np =input()\r\n \r\nprint(sum(int(x) for x in p.split()) / n)\r\n", "def volume():\r\n ok=False\r\n while not ok:\r\n n=int(input(\"\"))\r\n ok=(1<=100)\r\n p=str(input(\"\"))\r\n return (n,p)\r\ndef melange(n,p):\r\n p=p+\" \"\r\n v=0\r\n ok=False\r\n while not ok:\r\n x=p.find(\" \")\r\n s=int(p[:x])\r\n if(0<=s<=100):\r\n v=v+s\r\n p=p[x+1:]\r\n ok= len(p)==0\r\n \r\n return ((v/n))\r\nn,p=volume()\r\nprint(melange(n,p))", "def orange(L):\r\n count=0\r\n for j in range(len(L)):\r\n count=count+(L[j]/100)\r\n return 100*count/len(L)\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\n\r\nq=orange(L)\r\nprint(q)\r\n", "# LUOGU_RID: 122348235\ninput();a=list(map(int,input().split()));print(sum(a)/len(a))", "n = int(input())\r\nlst = list(map(int,input().split(' ')))\r\nsumi = sum(lst)\r\nprint(sumi/n)", "n = int(input())\r\njuices = map(int, input().split())\r\n\r\nprint(100*(sum(juices)/(n*100)))\r\n", "t = int(input())\r\na = list(map(int, input().split()))\r\nk=0\r\nfor i in range(t):\r\n k=k+a[i]\r\nprint(k/t)\r\n" ]

[ "a = [0] * 3\r\n_ = input()\r\nfor n in map(int, input().split()):\r\n a[n % 3] += 1\r\n\r\nprint(a[0] // 2 + min(a[1], a[2]))", "input()\r\ntickets = [int(i) for i in input().split()]\r\ntickets1 = []\r\ntickets2 = []\r\ntickets3 = []\r\nfor k in tickets:\r\n if k % 3 == 0:\r\n tickets3.append(k)\r\n elif k % 3 == 1:\r\n tickets1.append(k)\r\n else:\r\n tickets2.append(k)\r\nprint(min(len(tickets1), len(tickets2)) + int(len(tickets3) / 2))\r\n", "\r\nn=int(input())\r\ncontainer = list(input().split())\r\nans=0\r\ni=0\r\nwhile i<len(container):\r\n j=i+1\r\n while j <len(container):\r\n if(int(container[i]+container[j])%3==0):\r\n del container[i]\r\n del container[j-1];\r\n i-=1\r\n ans+=1\r\n break\r\n j+=1\r\n i+=1\r\n\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nst=set()\r\nans=0\r\nfor i in range(n):\r\n if i in st:continue\r\n for j in range(n):\r\n if i==j:continue\r\n if j in st or i in st:continue\r\n tmp=[str(arr[i]),str(arr[j])]\r\n lol=''.join(tmp)\r\n if int(lol)%3==0:\r\n st.add(i)\r\n st.add(j)\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\narr = input().split()\r\ndit = {0:0 , 1:0 , 2:0 }\r\nfor s in arr:\r\n sm = 0\r\n for c in s:\r\n sm+=int(c)\r\n if sm%3 in dit:\r\n dit[sm%3]+=1\r\n \r\nprint(dit[0]//2 + min(dit[1],dit[2])) \r\n \r\n ", "from sys import *\r\ninp = lambda : stdin.readline()\r\n\r\ndef main():\r\n n = int(inp())\r\n l = list(map(int,inp().split()))\r\n d = [[] for i in range(3)]\r\n for i in l:\r\n d[(i+3)%3].append(i)\r\n ans = len(d[0])//2 + min(len(d[1]),len(d[2]))\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na = input().split()\r\nthrees=0\r\ntwos=0\r\nones=0\r\n\r\nfor i in a:\r\n if int(i)%3==1:\r\n ones+=1\r\n elif int(i)%3==2:\r\n twos+=1\r\n else:\r\n threes+=1\r\n\r\nprint(min(ones,twos)+threes//2)", "n=int(input())\r\nar=list(map(lambda x:int(x)%3,input().split(' ')))\r\nprint((ar.count(0)//2)+(min(ar.count(1),ar.count(2))))\r\n", "input()\r\nmyList = list(map(int, input().split()))\r\nrem0, rem1, rem2 = 0, 0, 0\r\nfor it in myList:\r\n if it % 3 == 0:\r\n rem0 += 1\r\n elif it % 3 == 1:\r\n rem1 += 1\r\n else:\r\n rem2 += 1\r\nprint(rem0//2 + min(rem2,rem1))\r\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nT=[0,0,0]\r\nfor a in A:\r\n T[a%3]+=1\r\n\r\nANS=T[0]//2+min(T[1],T[2])\r\n\r\nprint(ANS)\r\n", "n = int(input())\nost = [0,0,0]\n\nfor i in map(int, input().split()):\n\tost[i%3] += 1\n\n# print(ost)\nprint(min(ost[1], ost[2])+(ost[0]//2))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [0]*3\r\nw = input()[:-1].split()\r\n\r\nfor s in w:\r\n x = sum(int(i) for i in s)\r\n d[x%3] += 1\r\nprint(d[0]//2 + min(d[1], d[2]))", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\nn = int(input())\r\na = list(map(int,input().split(\" \")))\r\nzero,one,two = 0,0,0\r\nfor i in range(n):\r\n if a[i]%3==0:\r\n zero += 1\r\n elif a[i]%3==1:\r\n one += 1\r\n else:\r\n two += 1\r\nans = int(zero/2) + min(one,two)\r\nprint(ans)", "n = input()\r\nans, one, two = 0, 0, 0\r\nfor number in [int(it) for it in input().split(' ')]:\r\n if number % 3 == 0:\r\n ans += 1\r\n elif number % 3 == 1:\r\n one += 1\r\n elif number % 3 == 2:\r\n two +=1\r\n\r\nres = ans/2 + min(one,two)\r\n\r\nprint(int(res))", "def summ (p):\r\n x=0\r\n while p!=0 :\r\n x=x+p%10\r\n p=p//10\r\n return x;\r\n\r\n\r\nn=int (input())\r\nl = list(map(int, input().split()))\r\ns=0\r\n\r\ni=0\r\nwhile i<n:\r\n for j in range(i+1,n):\r\n if (summ(l[i])+summ(l[j]))%3==0:\r\n s+=1\r\n del(l[i])\r\n del(l[j-1])\r\n n=n-2\r\n i=-1\r\n\r\n break\r\n i+=1\r\nprint(s)\r\n\r\n", "n=int(input())\narr=list(map(int,input().strip().split()))\ncnt=0\nfor i in range(n-1):\n for j in range(i+1,n):\n str1=str(arr[i])\n str2=str(arr[j])\n add=str1+str2\n add2=str2+str1\n p=int(add)\n p1=int(add2)\n if p%3==0 or p1%3==0:\n cnt=cnt+1\n del arr[j]\n n=n-1\n break\n if len(arr)<2:\n break\nprint(cnt)\n\t\t\t \t\t\t\t\t \t \t\t\t \t\t\t\t\t \t \t\t\t \t", "n = int(input())\r\ny = {0: 0, 1: 0, 2: 0}\r\nfor x in input().split():\r\n y[int(x) % 3] += 1\r\n\r\nprint(y[0] // 2 + min(y[1], y[2]) * (y[1] > 0) * (y[1] > 0))", "#!/usr/bin/env python3\r\n\r\nfrom sys import stdin\r\n\r\ndef sum_digits(n):\r\n r = 0\r\n while n:\r\n r, n = r + n % 10, n // 10\r\n return r\r\n\r\n\r\ninput_n = stdin.readline()\r\nn = int(input_n)\r\ninput_tokens = stdin.readline()\r\ntokens = [int(x) for x in input_tokens.split()]\r\n\r\nassert n == len(tokens)\r\n\r\nsum_tokens = []\r\nfor p in tokens:\r\n sum_tokens.append(sum_digits(p))\r\n# print(sum_tokens)\r\n\r\nres = [0,0,0]\r\nfor s in sum_tokens:\r\n res[s % 3] = res[s % 3] + 1\r\n# print(res)\r\n\r\nprint(res[0]//2+min(res[1],res[2]))\r\n\r\n", "# LUOGU_RID: 117888008\nn=int(input())\na=list(map(int,input().split()))\nfor i in range(n):\n a[i]%=3\na=''.join(list(map(str,a)))\nprint(a.count('0')//2+min(a.count('1'),a.count('2')))", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=0\r\no=0\r\nt=0\r\nfor i in a:\r\n if(i%3==0):\r\n d+=1\r\n elif(i%3==1):\r\n o+=1\r\n else:\r\n t+=1\r\nprint(d//2+min(o,t))", "from sys import *\r\ninp = lambda : stdin.readline()\r\n\r\ndef main():\r\n n = int(inp())\r\n l = map(int,inp().split())\r\n d = [0,0,0]\r\n for i in l:\r\n d[(i+3)%3] += 1\r\n ans = d[0]//2 + min(d[1],d[2])\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# 3\n# 123 123 99\n#\n# 1 5\n#\n# 1 5\n#\n#\n# 123 -> 1\n#\n# 1 1 1 23 10 3\n#\n#\n# 1 1 1 23 10 3\n#\n# 1 1 3 10 23\n# 10 3 1 1 1\n#\n# 16 mod 3 = 1\n# is eequal = 1 + 6 mod 3 = 1\n#\n# We all know that the remainder of a number when divided by 3 is equal to the remainder of sum of its digits when divided by three. So we can put all of input numbers in 3 sets based on their remainder by 3. Those with remainder 1 can be matched with those with remainder 2 and those with remainder 0 can be matched with themselves. so the answer is:\n# half of number of those divisible by three + minimum of those having a remainder of 1 and those having a remainder of 2\n#\n# 1 1 1 23 10 3\n#\n# remainder 1 (by dividing by 3): 1 1 1 10\n# reminder 2 (by dividing by 3): 23\n# reminder 0 (by dividing by 3): 3\n\narrayOfRemeinder1 = []\narrayOfRemeinder2 = []\narrayOfRemeinder0 = []\n\nn = int(input())\narray = list(map(int, input().split(\" \")))\n\nfor i in range(n):\n if array[i] % 3 == 1:\n arrayOfRemeinder1.append(array[i])\n elif array[i] % 3 == 2:\n arrayOfRemeinder2.append(array[i])\n else:\n arrayOfRemeinder0.append(array[i])\n\nsum = int(len(arrayOfRemeinder0) / 2) + min(len(arrayOfRemeinder1), len(arrayOfRemeinder2))\nprint(sum)", "def r(a):#SHIT Luogu's robot can't catch my AC\n return int(a)%3\na=input();a=list(map(r,input().split()));print(a.count(0)//2+min(a.count(1),a.count(2)))", "n=int(input())\r\ninp = list(map(int,input().split()))\r\nl=[0,0,0]\r\nfor item in inp:\r\n l[item%3]+=1\r\na=l[0]\r\nb=l[1]\r\nc=l[2]\r\nprint (min(b,c)+a//2)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nx=0\r\ny=0\r\nz=0\r\n\r\nfor i in range(n):\r\n if a[i]%3==0:\r\n x+=1\r\n elif a[i]%3==1:\r\n y+=1\r\n else:\r\n z+=1\r\n\r\nt=(x//2)+min(y,z)\r\nprint(t)", "import sys\r\nfrom array import array # noqa: F401\r\nfrom collections import Counter\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\ncnt = Counter(x % 3 for x in map(int, input().split()))\r\nprint(cnt[0] // 2 + min(cnt[1], cnt[2]))\r\n", "n = int(input())\r\nln = list(map(int, input().split()))\r\nat = [0]*3\r\nfor tn in ln:\r\n at[tn % 3] += 1\r\nprint(at[0] // 2 + min(at[1], at[2]))", "def digit_sum(n):\r\n sum1=0\r\n while(n>0):\r\n sum1+=n%10\r\n n=n//10\r\n return sum1 \r\nfor _ in range(1):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n ans=[0]*3\r\n for i in l:\r\n ans[digit_sum(i)%3]+=1\r\n \r\n print(ans[0]//2+min(ans[1],ans[2])) \r\n ", "# @Chukamin ICPC_TRAIN\n\ndef main():\n n = int(input())\n data = list(map(int, input().split()))\n cnt = [0] * 3\n for i in range(n):\n temp = data[i]\n while temp >= 10:\n t = 0\n while temp:\n t += temp % 10\n temp //= 10\n temp = t\n cnt[temp % 3] += 1\n print(cnt[0] // 2 + min(cnt[1], cnt[2]))\n \n\nif __name__ == '__main__':\n main()\n\n\t\t \t\t\t \t \t\t\t\t \t\t \t\t \t", "n = int(input())\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\nA = [0,0,0]\r\n\r\nfor i in L:\r\n A[i%3] += 1\r\n\r\nprint(A[0]//2+min(A[1],A[2]))", "d=[0,0,0];input()\r\nfor i in map(int,input().split()):d[i%3]+=1\r\nprint(d[0]//2+min(d[1],d[2]))", "s=int(input())\r\nar=[sum([int(x) for x in e])%3 for e in input().split()]\r\nx,y,z=ar.count(0),ar.count(1),ar.count(2)\r\nprint(x//2+min(y,z))", "n = int(input())\narr = list(map(int, input().split()))\ntypes = [x%3 for x in arr]\ntypedict = {0:0, 1:0, 2:0}\nfor t in types:\n\ttypedict[t] = typedict.get(t, 0) + 1\nprint(typedict[0]//2 + min(typedict[1], typedict[2]))", "input()\r\ncont = [int(item) for item in input().split()]\r\n\r\nrem_1, rem_2, threecount = 0, 0, 0\r\n\r\nfor i in range(0,len(cont),1):\r\n if cont[i] % 3 == 0:\r\n threecount += 1\r\n elif cont[i] % 3 == 1:\r\n rem_1 += 1\r\n else:\r\n rem_2 += 1\r\nif rem_1 <= rem_2 :\r\n print(threecount // 2 + rem_1)\r\nelse:\r\n print(threecount // 2 + rem_2)\r\n", "n=int(input())\r\nl=input().split()\r\nans=0\r\nfor i in range(n):\r\n\tl[i]=sum(list(map(int,l[i])))%3\r\nfor i in l:\r\n\tif i==0:\r\n\t\tans+=0.5\r\nprint(int(ans)+min(l.count(1),l.count(2)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nc={0:0,1:0,2:0}\r\nfor i in range(n):\r\n c[a[i]%3]+=1\r\nans=c[0]//2+min(c[1],c[2])\r\nprint(ans)", "input()\r\nnums = [int(item) for item in input().split()]\r\nrem = [0, 0, 0]\r\n\r\nfor item in nums:\r\n rem[item % 3] += 1\r\n\r\nprint(rem[0]//2 + min(rem[1], rem[2]))\r\n'''\r\n30 % 3 = 0\r\n10 % 3 = 1\r\n70 % 3 = 2\r\n'''", "# Code by : Sam._.072\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = dict()\r\nfor i in range(n):\r\n a[i] = 3 - a[i]%3\r\n d[a[i]] = d.get(a[i],0)+1\r\nprint(d.get(3,0)//2 + min(d.get(2,0), d.get(1,0)))\r\n\r\n \r\n\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nd=[0,0,0]\r\nfor i in x:\r\n d[i%3]+=1\r\n\r\nprint(min(d[1],d[2])+d[0]//2)", "def digitsum(N):\r\n ans = 0\r\n li = list(str(N))\r\n for el in li:\r\n ans += int(el)\r\n return ans\r\n\r\ndef main():\r\n\tn = int(input())\r\n\ta = list(map(int, input().split()))\r\n\r\n\ta = [digitsum(el) for el in a]\r\n\ta = [el % 3 for el in a]\r\n\r\n\ta.sort()\r\n\t\r\n\tzero = a.count(0)\r\n\tone = a.count(1)\r\n\ttwo = a.count(2)\r\n\r\n\tans = zero // 2 + min(one, two)\r\n\tprint(ans)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "input()\r\ns = [0,0,0]\r\nfor i in map(int,input().split()):\r\n s[i % 3] += 1\r\nprint(s[0] // 2 + min(s[1:]))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nct0 = 0\r\nct1 = 0\r\nct2 = 0\r\nfor i in l:\r\n if i%3 == 0:\r\n ct0 += 1\r\n elif i%3 == 1:\r\n ct1 += 1\r\n else:\r\n ct2 += 1\r\nout = 0\r\nout += ct0//2\r\nout += min(ct1,ct2)\r\nprint(out)", "# input()\r\n# cont = [int(item) for item in input().split()]\r\n#\r\n# rem_1, rem_2, threecount = 0, 0, 0\r\n#\r\n# for i in range(0, len(cont), 1):\r\n# if cont[i] % 3 == 0:\r\n# threecount += 1\r\n# elif cont[i] % 3 == 1:\r\n# rem_1 += 1\r\n# else:\r\n# rem_2 += 1\r\n#\r\n# print(threecount // 2 + rem_1 if rem_1 <= rem_2 else threecount // 2 + rem_2)\r\n\r\n\r\ninput()\r\ncont = [int(item) for item in input().split()]\r\nrem1, rem2, rem0 = 0, 0, 0\r\nfor item in cont:\r\n if item % 3 == 0:\r\n rem0 += 1\r\n elif item % 3 == 1:\r\n rem1 += 1\r\n else:\r\n rem2 += 1\r\n\r\nprint(rem0 // 2 + min(rem1, rem2))\r\n\r\n'''\r\n1-4\r\nif x % 3 == 1 && y % 3 == 2\r\n\r\n\r\n'''\r\n", "\r\nn = int(input())\r\n\r\nl_n = list(map(int, input().split()))\r\n\r\na_t = [0]*3\r\n\r\nfor t_n in l_n:\r\n a_t[t_n % 3] += 1\r\n\r\nprint(a_t[0] // 2 + min(a_t[1], a_t[2]))\r\n", "_, pieces = int(input()), [int(i)%3 for i in input().split(\" \")]\r\ntotal = 0\r\nwhile 0 in pieces:\r\n pieces.remove(0)\r\n if 0 in pieces: \r\n total+=1\r\n pieces.remove(0)\r\nwhile 1 in pieces and 2 in pieces:\r\n total+=1\r\n pieces.remove(1)\r\n pieces.remove(2)\r\nprint(total)", "import sys\r\nimport math\r\nn=int(sys.stdin.readline())\r\nl=list(map(str,sys.stdin.readline().split()))\r\na=[0]*n\r\nfor i in range(n):\r\n s=0\r\n for j in range(len(l[i])):\r\n s+=int(l[i][j])\r\n a[i]=s%3 \r\nprint(a.count(0)//2 + min(a.count(1),a.count(2))) ", "n=int(input())\r\narr=list(map(int,(input().split())))\r\na,b,c=0,0,0\r\nfor i in arr:\r\n if i%3==0:\r\n a+=1\r\n elif i%3==1:\r\n b+=1\r\n else:\r\n c+=1\r\nprint((a//2)+min(b,c))", "input()\r\nmyList = list(map(int, input().split()))\r\ncont = [0] * 3\r\nfor i in myList:\r\n cont[i % 3] += 1\r\nans = cont[0] // 2 + min(cont[1], cont[2])\r\nprint(ans)", "input()\r\nrem0, rem1, rem2 = 0, 0, 0\r\nfor i in list(map(int, input().split(' '))):\r\n if i % 3 == 0:\r\n rem0 += 1\r\n elif i % 3 == 1:\r\n rem1 += 1\r\n else:\r\n rem2 += 1\r\n\r\nprint(rem0 // 2 + min(rem1, rem2))", "n, v = int(input()), [0] * 3\r\nfor ai in map(int, input().split()):\r\n v[ai % 3] += 1\r\nprint(v[0] // 2 + min(v[1], v[2]))", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nans = 0\r\nfor i in range(n):\r\n if (l[i]%3 == 0):\r\n c1 = c1 + 1\r\n elif (l[i]%3 == 1):\r\n c2 = c2 + 1\r\n else:\r\n c3 = c3 + 1\r\nans += c1//2\r\nmin1 = min(c2,c3)\r\nmax1 = max(c2,c3)\r\nans += min1\r\nprint (ans)" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\n\r\nif m >= n:\r\n print(n)\r\n exit()\r\n\r\nl, h = m+1, n+1\r\n\r\nwhile l < h:\r\n mi = (l+h)//2\r\n x = mi-m-1\r\n c = (1+x)*x//2\r\n if n-mi > c:\r\n l = mi + 1\r\n else:\r\n h = mi\r\nprint(l)", "n, m = [int(e) for e in input().split()]\r\n\r\n# start from the day where the amount of grain taken + grain added = n\r\n# edge case: m > n: res = n\r\nif m >= n:\r\n print(n)\r\n exit()\r\n\r\ndiff = n-m\r\nl, r = 1, n\r\nres = 0\r\nwhile r > l:\r\n mid = (l+r)//2\r\n p = mid*(mid+1)//2\r\n if p == n-m:\r\n res = mid\r\n break\r\n elif p > n-m:\r\n r = mid\r\n else:\r\n l = mid+1\r\n\r\nif res == 0:\r\n print(r+m)\r\nelse:\r\n print(res+m)\r\n", "def check(i):\r\n global N,M\r\n su = i*(i-1)//2\r\n if N-su<=M+i:\r\n return True\r\n return False\r\n \r\nN,M = map(int,input().split())\r\nif N<=M:\r\n print(N)\r\n exit()\r\nl,r = 0,10**18\r\n \r\nwhile l<r:\r\n mid = (l+r)//2\r\n if check(mid):\r\n r = mid\r\n else:\r\n l = mid+1\r\nprint(l+M)", "n, m = map(int, input().split())\nif m >= n:\n print(n)\n exit()\nl = -1\nr = 2 * 10 ** 9\nwhile r - l > 1:\n mid = (l + r) // 2\n if mid * (mid + 1) // 2 >= n - m: r = mid\n else: l = mid\nprint(m + r)\n", "s = input().split(' ')\r\nn = int(s[0])\r\nm = int(s[1])\r\nif m>=n:\r\n\tprint(n)\r\nelse:\r\n\tx = ((8*n-8*m+1)**0.5)/2-0.5\r\n\ty= int(x)\r\n\tif y**2 + y >= 2*n-2*m:\r\n\t\tprint(m+y)\r\n\telse:\r\n\t\tprint(m+y+1)" ]

[ "def f():\r\n t = []\r\n for i in range(8):\r\n p = input()\r\n for j in range(8):\r\n if p[j] == 'K': t += [i, j]\r\n if t[2] - t[0] in (0, 4) and t[1] - t[3] in (-4, 0, 4): return 'YES'\r\n return 'NO'\r\nfor i in range(int(input()) - 1):\r\n print(f())\r\n input()\r\nprint(f())", "N = range(8)\ntest = int (input())\nfor i_test in range(test):\n if (i_test): input()\n x1,y1,x2,y2=0,0,0,0\n map = [input() for i in N]\n for i in N:\n for j in N:\n if (map[i][j]==\"K\"): x1,y1,x2,y2 = x2,y2,i,j\n if (abs(x1-x2)%4==0 and abs(y1-y2)%4==0): print (\"YES\")\n else: print (\"NO\")\n", "import sys\r\nimport collections\r\n\r\n\r\nclass GetOutOfLoop(Exception):\r\n pass\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n_cases = int(sys.stdin.readline())\r\n\r\n for case in range(n_cases):\r\n board = [list(sys.stdin.readline().rstrip()) for i in range(8)]\r\n knight_init_loc = [None, None]\r\n knight = 0\r\n for current_i in range(8):\r\n for current_j in range(8):\r\n if board[current_i][current_j] == 'K':\r\n knight_init_loc[knight] = (current_i, current_j)\r\n knight += 1\r\n\r\n to_explore = collections.deque()\r\n\r\n to_explore.append((knight_init_loc[0], 0))\r\n explored = set()\r\n try:\r\n while len(to_explore) > 0:\r\n ((current_i, current_j), current_step) = to_explore.popleft()\r\n explored.add((current_i, current_j))\r\n candidates = set()\r\n for inc_i in [-2, 2]:\r\n for inc_j in [-2, 2]:\r\n next_i, next_j = current_i + inc_i, current_j + inc_j\r\n if 0 <= next_i < 8 and 0 <= next_j < 8 and (next_i, next_j) not in explored:\r\n candidates.add(((next_i, next_j), current_step + 1))\r\n for (s, next_step) in candidates:\r\n if s == knight_init_loc[1] and next_step % 2 == 0:\r\n print('YES')\r\n raise GetOutOfLoop\r\n to_explore.append((s, next_step))\r\n current_step += 1\r\n print('NO')\r\n except GetOutOfLoop:\r\n pass\r\n sys.stdin.readline()", "n = int (input())\r\nfor i in range(n):\r\n if (i): \r\n input()\r\n x1 = y1 = x2 = y2 = 0\r\n s = [input() for i in range(8)]\r\n for i in range(8):\r\n for j in range(8):\r\n if (s[i][j] == 'K'):\r\n x1, y1, x2, y2 = x2, y2, i, j\r\n if (abs(x1-x2) % 4 == 0 and abs(y1-y2) % 4 == 0): \r\n print (\"YES\")\r\n else: \r\n print (\"NO\")\r\n", "n = int(input())\ntestcases = []\nfor i in range(n):\n # _ = input()\n chess = []\n for _ in range(8):\n points = input()\n chess.append(points)\n if i != n-1:\n new_line = input()\n testcases.append(chess)\n \nfor chess in testcases:\n def main():\n poss_k = []\n for i in range(8):\n for j in range(8):\n if chess[i][j] == 'K':\n poss_k.append((i, j))\n k1, k2 = sorted(poss_k)\n i = 0\n if (k1[i] % 4) != (k2[i] % 4):\n return False\n i = 1\n if (k1[i] % 4) != (k2[i] % 4):\n return False\n if k2[0] - k1[0] == 8 and k2[1] - k1[1] == 8:\n return True\n movs_u = (k2[1] - k1[1]) // 2\n movs_r = (k2[0] - k1[0]) // 2\n \n if (movs_u % 2 == 1 )and (movs_r % 2 == 1):\n return False\n return True\n if main():\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t\t\t \t \t \t\t \t \t \t\t \t \t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import deque\r\n\r\nfor _ in range(int(input())):\r\n A = []\r\n B = []\r\n for i in range(8):\r\n A.append(input())\r\n for j in range(8):\r\n #print(i,j)\r\n if A[i][j]=='K':\r\n B.append((i,j))\r\n \r\n ans = 'NO'\r\n seen = [[0]*8 for _ in range(8)]\r\n v = deque([(B[0][0],B[0][1],0)])\r\n while v:\r\n r,c,d = v.popleft()\r\n if seen[r][c]:continue\r\n seen[r][c]=1\r\n if r==B[1][0] and c==B[1][1] and d%2==0:\r\n ans = 'YES'\r\n break\r\n \r\n for r1,c1 in ((-2,2),(-2,-2),(2,2),(2,-2)):\r\n nr,nc = r+r1,c+c1\r\n if nr<0 or nr>7 or nc<0 or nc>7:continue\r\n if seen[nr][nc]:continue\r\n v.append((nr,nc,d+1))\r\n \r\n print(ans)\r\n input()\r\n\r\n", "t = int(input())\r\n\r\nfor _ in range(t):\r\n if _ != 0:\r\n tmp = input()\r\n \r\n pos = []\r\n n = 8\r\n g = []\r\n for i in range(n):\r\n g.append([i for i in input()])\r\n \r\n for i in range(n):\r\n for j in range(n):\r\n if g[i][j] == \"K\":\r\n pos.append((i, j))\r\n \r\n ok = False\r\n for i in range(n):\r\n for j in range(n):\r\n if i%2 == pos[0][0]%2 and i%2 == pos[1][0]%2 and j%2 == pos[0][1]%2 and j%2 == pos[1][1]%2:\r\n dist1 = ((i-pos[0][0]), (j-pos[0][1]))\r\n dist2 = ((i-pos[1][0]), (j-pos[1][1]))\r\n if dist1[0]-dist2[0]%4 == 0 and dist1[1]-dist2[1]%4 == 0:\r\n ok = True\r\n\r\n print(\"YES\" if ok else \"NO\")", "t = int(input())\r\nwhile t:\r\n t += -1\r\n l = []\r\n mp = []\r\n for i in range(8):\r\n tmp = list(input())\r\n l.append(tmp)\r\n mp.append([0] * 8)\r\n i1, j1, i2, j2 = -1, -1, -1, -1\r\n for i in range(8):\r\n for j in range(8):\r\n if l[i][j] == 'K' and i1 == -1: i1, j1 = i, j\r\n if l[i][j] == 'K': i2, j2 = i, j\r\n if abs(i2 - i1) % 4 == 0 and abs(j2 - j1) % 4 == 0: print('YES')\r\n else: print('NO')\r\n if t != 0: input()", "\n__=int(input())\nfor _ in range(__):\n if _:input()\n k=[[0,0],[0,0]]\n c=0\n flag=0\n for i in range(8):\n for j,e in enumerate(input()):\n if flag:break\n if e=='K':\n k[c][0]=i\n k[c][1]=j\n c+=1\n if c==2:flag=1\n if abs(k[0][0]-k[1][0])%4!=0 or abs(k[0][1]-k[1][1])%4!=0:print(\"NO\")\n else:print(\"YES\")\n\n\n", "def main():\r\n n = int(input())\r\n out = \"\"\r\n \r\n for t in range(n):\r\n knights = [0 for i in range(16)]\r\n valid = [False for i in range(16)]\r\n for i in range(8):\r\n line = input()\r\n #print()\r\n for j in range(8):\r\n #print(get(i, j), end=\"\\t\")\r\n if line[j] != '#':\r\n valid[get(i, j)] = True\r\n if line[j] == 'K':\r\n knights[get(i, j)] += 1\r\n \r\n for i in range(16):\r\n #print(i, knights[i], valid[i])\r\n if knights[i] == 2 and valid[i]:\r\n out += \"YES\\n\"\r\n break\r\n else:\r\n out += \"NO\\n\"\r\n \r\n if t != n-1:\r\n input()\r\n \r\n print(out[:-1])\r\n \r\ndef get(i, j):\r\n return [[0, 1, 2, 3],[4, 5, 6, 7],[8, 9, 10, 11],[12, 13, 14, 15]][i%4][j%4]\r\n \r\nif __name__ == \"__main__\": main()", "n = int(input())\r\nfor t in range(n):\r\n if t: input()\r\n board = [[c for c in input()] for i in range(8)]\r\n k1, k2 = ((i, j) for i in range(8) for j in range(8) if board[i][j] == 'K')\r\n if (k1[0] - k2[0]) % 4 == 0 and (k1[1] - k2[1]) % 4 == 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "MOVS = [(2,-2),(-2,2),(-2,-2),(2,2)]\r\ndef check(a):\r\n return 0<=a<8\r\nset1 = set()\r\nset2 = set()\r\ndic1 = dict()\r\ndic2 = dict()\r\ndef cango1(matrix,pos,lap):\r\n for dx,dy in MOVS:\r\n nx,ny = dx+pos[0],dy+pos[1]\r\n if not check (nx) or not check(ny):\r\n continue\r\n if (nx,ny) in set1:\r\n continue\r\n dic1[(nx,ny)]=lap%2\r\n set1.add((nx,ny))\r\n cango1(matrix,(nx,ny),lap+1)\r\ndef cango2(matrix,pos,lap):\r\n for dx,dy in MOVS:\r\n nx,ny = dx+pos[0],dy+pos[1]\r\n if not check(nx) or not check(ny):\r\n continue\r\n if (nx,ny) in set2:\r\n continue\r\n dic2[(nx,ny)]=lap%2\r\n set2.add((nx,ny))\r\n cango2(matrix,(nx,ny),lap+1)\r\nq = int(input())\r\nfor ww in range(q):\r\n matrix = [input().strip() for i in range(8)]\r\n pos = []\r\n bad = set()\r\n for i in range(8):\r\n for j in range(8):\r\n if matrix[i][j] == 'K':\r\n pos.append((i,j))\r\n if matrix[i][j]=='#':\r\n bad.add((i,j))\r\n set1,set2,dic1,dic2=set(),set(),dict(),dict()\r\n cango1(matrix, pos[0],0)\r\n cango2(matrix,pos[1],0)\r\n if ww!=q-1:\r\n input()\r\n sec = (set1&set2) - bad\r\n for x,y in sec:\r\n if dic1[(x,y)]==dic2[(x,y)]:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n", "def check():\r\n board = []\r\n for cont in range(0,8):\r\n board.append(input())\r\n l = True\r\n for cont in range(0,8):\r\n for cont2 in range(0,8):\r\n if board[cont][cont2] == 'K':\r\n if l:\r\n xk1 = cont2\r\n yk1 = cont\r\n l = False\r\n else:\r\n xk2 = cont2\r\n yk2 = cont\r\n break\r\n for cont in range(0,8):\r\n for cont2 in range(0,8):\r\n if cont2 %2 == xk1%2 == xk2%2:\r\n if cont%2 == yk1%2 == yk2%2:\r\n if abs(cont2-xk1)%4 == abs(cont2-xk2)%4:\r\n if abs(cont-yk1)%4 == abs(cont-yk2)%4:\r\n if board[cont][cont2] != '#':\r\n print('YES')\r\n return\r\n print('NO')\r\n return\r\n \r\nn = int(input())\r\ncheck()\r\nfor t in range(0,n-1):\r\n a = str(input())\r\n check()" ]

[ "mod = 10 ** 6 + 3\r\n\r\ndef prod(a, b):\r\n return [[sum([a[i][k] * b[k][j] for k in range(len(b))]) % mod for j in range(len(b[0]))] for i in range(len(a))]\r\n\r\nc, w, h = map(int, input().split())\r\n\r\na = [[0] * (w + 1) for _ in range(w + 1)]\r\nfor i in range(w):\r\n a[i][i + 1] = 1\r\n \r\nfor cnt in range(0, w + 1):\r\n a[-1][-1 - cnt] = h ** cnt\r\n\r\nans = [[0] for _ in range(w + 1)]\r\nans[-1][0] = 1\r\nans[-2][0] = 1\r\n\r\nwhile c > 0:\r\n if c % 2 == 1:\r\n ans = prod(a, ans)\r\n c = c // 2\r\n if c > 0:\r\n a = prod(a, a)\r\n\r\nprint(ans[-1][0])" ]

[ "slv = {'6':0, '7':1, '8':2, '9':3, 'T':4, 'J':5, 'Q':6, 'K':7, 'A':8}\r\nkozyr = input()\r\ncard1, card2 = input().split()\r\n\r\nval1 = card1 [0]\r\nmast1 = card1 [1]\r\n\r\nval2 = card2 [0]\r\nmast2 = card2 [1]\r\n\r\nif mast1 == mast2:\r\n if slv[val1] > slv [val2]:\r\n print ('YES')\r\n else:\r\n print ('NO')\r\nelif mast1 == kozyr or mast2 == kozyr:\r\n if mast1 == kozyr:\r\n print ('YES')\r\n else:\r\n print ('NO')\r\nelse:\r\n print ('NO')", "trump = str(input())\r\nfirst, second = input().split()\r\n\r\npriority = ['6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']\r\n\r\nif first[1] == second[1]:\r\n first_priority = priority.index(first[0])\r\n second_priority = priority.index(second[0])\r\n if first_priority > second_priority:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if first[1] == trump:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "letter = input()\r\nplayer1, player2 = input().split()\r\n\r\nsuit = [\"S\", \"H\", \"D\", \"C\"]\r\nrank = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n\r\nif letter == player1[1] and player2[1] != letter:\r\n print(\"YES\")\r\nelif player1[1] == player2[1]:\r\n if rank.index(player1[0]) > rank.index(player2[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nl=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\nt=input()\r\na,b=input().split()\r\nif a[1]==t and b[1]!=t:\r\n\tprint('YES')\r\n\texit()\r\nif a[1]==b[1] and l.index(a[0])>l.index(b[0]):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "\r\ndef solve(k,f,s):\r\n p=\"6789TJQKA\"\r\n if s[1]==k:\r\n if f[1]==k:\r\n if p.index(f[0])>p.index(s[0]):\r\n return True\r\n return False\r\n return False\r\n else:\r\n if f[1]==k:\r\n return True\r\n if f[1]!=s[1]:\r\n return False\r\n if p.index(f[0])>p.index(s[0]):\r\n return True\r\n return False\r\n \r\nk=str(input())\r\nf,s=map(str,input().split())\r\n\r\nif solve(k,f,s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read input\r\ntrump_suit = input().strip()\r\ncards = input().split()\r\n\r\n# Define the card ranks and their order\r\ncard_ranks = \"6789TJQKA\"\r\nrank_order = {rank: index for index, rank in enumerate(card_ranks)}\r\n\r\n# Extract the ranks and suits of the two cards\r\nrank1, suit1 = cards[0][0], cards[0][1]\r\nrank2, suit2 = cards[1][0], cards[1][1]\r\n\r\n# Check if both cards have the same suit\r\nif suit1 == suit2:\r\n # If they have the same suit, check if the rank of the first card is higher\r\n if rank_order[rank1] > rank_order[rank2]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n # If they have different suits, check if the first card is the trump suit\r\n if suit1 == trump_suit:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "ranks = ['6','7','8','9','T','J','Q','K','A']\r\ntrump = input()\r\ncards = input()\r\n\r\nif cards[1] == trump:\r\n if cards[4] != trump:\r\n print(\"YES\")\r\n else:\r\n if ranks.index(cards[0]) > ranks.index(cards[3]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if cards[1]==cards[4] and ranks.index(cards[0]) > ranks.index(cards[3]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "k=input()\r\na,b=input().split()\r\nf=0\r\nif a[0]=='6' or a[0]=='7' or a[0]=='8' or a[0]=='9':\r\n x=int(a[0])\r\nelif a[0]=='T':\r\n x=10\r\nelif a[0]=='J':\r\n x=11\r\nelif a[0]=='Q':\r\n x=12\r\nelif a[0]=='K':\r\n x=13\r\nelif a[0]=='A':\r\n x=14\r\n \r\nif b[0]=='6' or b[0]=='7' or b[0]=='8' or b[0]=='9':\r\n y=int(b[0])\r\nelif b[0]=='T':\r\n y=10\r\nelif b[0]=='J':\r\n y=11\r\nelif b[0]=='Q':\r\n y=12\r\nelif b[0]=='K':\r\n y=13\r\nelif b[0]=='A':\r\n y=14\r\n\r\n \r\nif a[1]==b[1]:\r\n if x>y:\r\n f=1\r\nelif b[1]==k and a[1]!=k:\r\n f=0\r\nelif a[1]==k and b[1]!=k:\r\n f=1\r\nelif a[1]!=b[1] and a[1]!=k and b[1]!=k:\r\n f=0\r\n\r\n\r\n\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "a=[\"S\",\"H\",\"D\",\"C\"]\r\nb=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\nk=input()\r\nc=input().split()\r\nif c[0][1]==k:\r\n if c[0][1]==c[1][1]:\r\n if b.index(c[0][0])>b.index(c[1][0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n if c[0][1]==c[1][1]:\r\n if b.index(c[0][0])>b.index(c[1][0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n", "A=14\r\nK=13\r\nQ=12\r\nJ=11\r\nT=10\r\ntrump=input()\r\nplyr1,plyr2=input().split()\r\nif(plyr1[1]==trump and plyr2[1]!=trump):\r\n print(\"YES\")\r\nelif(plyr1[1]!=trump and plyr2[1]==trump):\r\n print(\"NO\") \r\nelif(plyr1[1]==plyr2[1]):\r\n x=eval(plyr1[0])\r\n y=eval(plyr2[0]) \r\n if(x>y):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\nelse:\r\n print(\"NO\") ", "rank=\"6789TJQKA\"\r\ntrump=input()\r\ncard=input()\r\nr1=card[0]\r\ns1=card[1]\r\nr2=card[3]\r\ns2=card[4]\r\nif(s1==trump):\r\n if(s2!=trump):\r\n print(\"YES\")\r\n elif(rank.index(r1)>rank.index(r2)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif(s1==s2 and rank.index(r1)>rank.index(r2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k = input()\nc1, c2 = input().split()\nds = {\"6\": 1,\n \"7\": 2,\n \"8\": 3,\n '9': 4,\n 'T': 5,\n 'J': 6,\n 'Q': 7,\n 'K': 8,\n \"A\": 9\n }\n\nif (ds[c1[0]] > ds[c2[0]] and c1[1]==c2[1]) or (c1[1]==k and c2[1]!=k): print(\"YES\")\nelse: print(\"NO\")\n", "s=input()\r\na,b=input().split()\r\nx=\"6789TJQKA\"\r\nif a[1]==s and b[1]!=s: print(\"YES\")\r\nelif b[1]==s and a[1]!=s: print(\"NO\")\r\nelif a[1]!=b[1]: print(\"NO\")\r\nelif x.index(a[0])>x.index(b[0]): print(\"YES\")\r\nelse: print(\"NO\")", "s = input()\r\ns1,s2 = input().split()\r\ntemp = '6789TJQKA'\r\nif s1[1] == s2[1]:\r\n print(\"YES\" if temp.find(s1[0]) > temp.find(s2[0]) else \"NO\")\r\nelse:\r\n print(\"YES\" if s1[1] == s else \"NO\")", "order = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\ntrump = input()\nfirst, second = input().split()\nif first[1]!=second[1]:\n if first[1]!=trump:\n print('NO')\n else:\n print(\"YES\")\nelse:\n if order.index(first[0])>order.index(second[0]):\n print(\"YES\")\n else:\n print(\"NO\")\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\na, b = input()[:-1].split()\r\n\r\nw = {'6':1,'7':2,'8':3,'9':4,'T':5,'J':6,'Q':7,'K':8,'A':9}\r\nif a[1] == s:\r\n if b[1] != s:\r\n print(\"YES\")\r\n else:\r\n if w[a[0]] > w[b[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if a[1] == b[1]:\r\n if w[a[0]] > w[b[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "if __name__ == '__main__':\r\n c = input()\r\n a = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n b = [\"S\", \"H\", \"D\", \"C\"]\r\n x, y = input().split() \r\n\r\n if b.index(x[1]) == b.index(y[1]):\r\n ans = 0 if a.index(x[0]) <= a.index(y[0]) else 1\r\n else:\r\n ans = 0 if x[1] != c else 1\r\n\r\n print(\"YNEOS\"[not ans::2])", "s1=input()\r\ns2=input()\r\npq=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" ,\"A\"]\r\nif s2[1]==s1 and s2[-1]!=s1:print('YES')\r\nelif s2[1]==s2[-1] and pq.index(s2[0])>pq.index(s2[-2]):print('YES')\r\nelse:print('NO')\r\n", "def kart(s):\r\n x = s[0]\r\n if s[0] not in '6789':\r\n for i in range(0, len(\"TJQKA\")):\r\n if \"TJQKA\"[i] == x: x = \"1\" + str(i)\r\n return str(int(x) - 5) \r\n\r\nkoz = input()\r\na , b = input().split()\r\nif a[1] == koz and b[1] != koz:\r\n print(\"YES\")\r\nelif a[1] != b[1]:\r\n print(\"NO\")\r\nelse:\r\n if kart(a) > kart(b):print(\"YES\")\r\n else:print(\"NO\")\r\n ", "trump=input()\r\nrank=[\"6\",\"7\",\"8\",\"9\",\"T\",\"J\",\"Q\",\"K\",\"A\"]\r\na,b=map(str, input().split())\r\nif a[1]==trump and a[1]!=b[1]:\r\n print(\"YES\")\r\nelse:\r\n if a[1]!=b[1]:\r\n print(\"NO\")\r\n else:\r\n if rank.index(a[0])>=rank.index(b[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "k = input()\n\ndeck = list('6789TJQKA')\n\ncards = input().split()\n\nif cards[0][1] == k and cards[1][1] != k:\n print('YES')\nelif cards[0][1] == cards[1][1] and deck.index(cards[0][0]) > deck.index(cards[1][0]):\n print('YES')\nelse:\n print('NO')\n", "\r\nimport sys\r\nimport math\r\n \r\ndc = { '6': 1, '7': 2, '8': 3, '9': 4, 'T': 5, 'J': 6, 'Q': 7, 'K': 8, 'A': 9 }\r\nm = sys.stdin.readline()[0]\r\nt = (sys.stdin.readline()).split()\r\n\r\nif(t[0][1] == m and t[1][1] != m):\r\n print(\"YES\")\r\nelse:\r\n if(t[0][1] == t[1][1]):\r\n if(dc[t[0][0]] > dc[t[1][0]]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n", "t = input() # Trump suit\r\nc = input() # Cards input\r\nc = c.split()\r\nc1_rank, c1_suit = c[0]\r\nc2_rank, c2_suit = c[1]\r\n\r\n# Card ranks in increasing order\r\nranks_order = \"6789TJQKA\"\r\n\r\n# Check if the second card is a trump card\r\nis_c2_trump = c2_suit == t\r\n\r\n# Check if the first card is a trump card\r\nif c1_suit == t:\r\n if not is_c2_trump or ranks_order.index(c1_rank) > ranks_order.index(c2_rank):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if c1_suit == c2_suit and ranks_order.index(c1_rank) > ranks_order.index(c2_rank):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "# pylint: disable=unused-variable\r\n# pylint: enable=too-many-lines\r\n# * Just believe in yourself\r\n\r\n\r\n# @ Author @CAP\r\n# import numpy\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport math as M\r\nimport itertools as ITR\r\nfrom collections import defaultdict as D\r\nfrom collections import Counter as C\r\nfrom collections import deque as Q\r\nimport threading\r\nfrom functools import lru_cache, reduce\r\nfrom functools import cmp_to_key as CMP\r\nfrom bisect import bisect_left as BL\r\nfrom bisect import bisect_right as BR\r\nimport random as R\r\nimport string\r\nimport cmath, time\r\n\r\nenum = enumerate\r\nstart_time = time.time()\r\n\r\n# * Variables\r\n\r\nMOD = 1_00_00_00_007\r\nMA = float(\"inf\")\r\nMI = float(\"-inf\")\r\n\r\n# * Graph 8 direction\r\ndi8 = ((1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1))\r\n\r\n# * Graph 4 direction\r\ndi4 = ((1, 0), (0, 1), (-1, 0), (0, -1))\r\n\r\n# * Stack increment\r\n\r\n\r\ndef increase_stack():\r\n sys.setrecursionlimit(2 ** 32 // 2 - 1)\r\n threading.stack_size(1 << 27)\r\n # sys.setrecursionlimit(10**6)\r\n # threading.stack_size(10**8)\r\n # t = threading.Thread(target=main)\r\n # t.start()\r\n # t.join()\r\n\r\n\r\n# * Region Funtions\r\n\r\n\r\ndef binary(n):\r\n return bin(n)[2:]\r\n\r\n\r\ndef decimal(s):\r\n return int(s, 2)\r\n\r\n\r\ndef pow2(n):\r\n p = 0\r\n while n > 1:\r\n n //= 2\r\n p += 1\r\n return p\r\n\r\n\r\ndef maxfactor(n):\r\n q = []\r\n for i in range(1, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n q.append(i)\r\n if q:\r\n return q[-1]\r\n\r\n\r\ndef factors(n):\r\n q = []\r\n for i in range(1, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n q.append(i)\r\n q.append(n // i)\r\n return list(sorted(list(set(q))))\r\n\r\n\r\ndef primeFactors(n):\r\n l = []\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n / 2\r\n for i in range(3, int(M.sqrt(n)) + 1, 2):\r\n while n % i == 0:\r\n l.append(i)\r\n n = n / i\r\n if n > 2:\r\n l.append(int(n))\r\n l.sort()\r\n return l\r\n\r\n\r\ndef isPrime(n):\r\n if n == 1:\r\n return False\r\n else:\r\n root = int(n ** 0.5)\r\n root += 1\r\n for i in range(2, root):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef seive(n):\r\n a = []\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while p * p <= n:\r\n if prime[p] == True:\r\n for i in range(p ** 2, n + 1, p):\r\n prime[i] = False\r\n p = p + 1\r\n for p in range(2, n + 1):\r\n if prime[p]:\r\n a.append(p)\r\n prime[0] = prime[1] = False\r\n return a, prime\r\n\r\n\r\ndef maxPrimeFactors(n):\r\n maxPrime = -1\r\n while n % 2 == 0:\r\n maxPrime = 2\r\n n >>= 1\r\n for i in range(3, int(M.sqrt(n)) + 1, 2):\r\n while n % i == 0:\r\n maxPrime = i\r\n n = n / i\r\n if n > 2:\r\n maxPrime = n\r\n return int(maxPrime)\r\n\r\n\r\ndef countchar(s, i):\r\n c = 0\r\n ch = s[i]\r\n for i in range(i, len(s)):\r\n if s[i] == ch:\r\n c += 1\r\n else:\r\n break\r\n return c\r\n\r\n\r\ndef str_counter(a):\r\n q = [0] * 26\r\n for i in range(len(a)):\r\n q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1\r\n return q\r\n\r\n\r\ndef lis(arr):\r\n n = len(arr)\r\n lis = [1] * n\r\n maximum = 0\r\n\r\n for i in range(1, n):\r\n for j in range(0, i):\r\n if arr[i] > arr[j] and lis[i] < lis[j] + 1:\r\n lis[i] = lis[j] + 1\r\n maximum = max(maximum, lis[i])\r\n return maximum\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a % b)\r\n\r\n\r\ndef agcd(a, *b):\r\n\r\n for i in b:\r\n a = gcd(a, i)\r\n return a\r\n\r\n\r\ndef lcm(a, *b):\r\n val = a\r\n gc = a\r\n for i in b:\r\n gc = gcd(gc, i)\r\n val *= i\r\n return val // gc\r\n\r\n\r\ndef ncr(n, r):\r\n return M.factorial(n) // (M.factorial(n - r) * M.factorial(r))\r\n\r\n\r\ndef npr(n, r):\r\n return M.factorial(n) // M.factorial(n - r)\r\n\r\n\r\n# * Make work easy funtions\r\n\r\n\r\ndef IF(c, t, f):\r\n return t if c else f\r\n\r\n\r\ndef YES(c):\r\n print(IF(c, \"YES\", \"NO\"))\r\n\r\n\r\ndef Yes(c):\r\n print(IF(c, \"Yes\", \"No\"))\r\n\r\n\r\ndef yes(c):\r\n print(IF(c, \"yes\", \"no\"))\r\n\r\n\r\ndef JA(a, sep=\" \"):\r\n print(sep.join(map(str, a)))\r\n\r\n\r\ndef JAA(a, s=\"\\n\", t=\" \"):\r\n print(s.join(t.join(map(str, b)) for b in a))\r\n\r\n\r\ndef PS(a, s=\" \"):\r\n print(str(a), end=s)\r\n\r\n\r\n# * Region Taking Input\r\n\r\n\r\ndef I():\r\n return int(inp())\r\n\r\n\r\ndef F():\r\n return float(inp())\r\n\r\n\r\ndef LI():\r\n return list(map(int, inp().split()))\r\n\r\n\r\ndef LF():\r\n return list(map(float, inp().split()))\r\n\r\n\r\ndef MATI(n):\r\n return [LI() for i in range(n)]\r\n\r\n\r\ndef MATS(n):\r\n return [list(inp()) for i in range(n)]\r\n\r\n\r\ndef IV():\r\n return map(int, inp().split())\r\n\r\n\r\ndef FV():\r\n return map(float, inp().split())\r\n\r\n\r\ndef LS():\r\n return list(inp())\r\n\r\n\r\ndef S():\r\n return inp()\r\n\r\n\r\n# * Region Fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninp = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# >==================================== Write The Useful Code Here ============================\r\n\r\n# >Make it one if there is some test cases\r\nTestCases = 0 # >=====================\r\n# > =======================================\r\n\"\"\"\r\n> Sometimes later becomes never. Do it now.\r\n! Be Better than yesterday.\r\n!Your limitation—it’s only your imagination.\r\n> Push yourself, because no one else is going to do it for you.\r\n? The harder you work for something, the greater you’ll feel when you achieve it.\r\n! Great things never come from comfort zones.\r\n! Don’t stop when you’re tired. Stop when you’re done.\r\n> Do something today that your future self will thank you for.\r\n? It’s going to be hard, but hard does not mean impossible.\r\n! Sometimes we’re tested not to show our weaknesses, but to discover our strengths.\r\n\"\"\"\r\n# @ Goal is to get Candidate Master\r\n\r\n\r\ndef solve():\r\n \r\n trump=S()\r\n p,q=S().split()\r\n flag=False\r\n lookup={'1':1,'2':2,'3':3,'4':4,'5':5,'6':6,'7':7,'8':8,'9':9,'10':10,'T':11,'J':12,'Q':13,'K':14,'A':15}\r\n\r\n if p[-1]==q[-1]:\r\n rank=p[:-1]\r\n pank=q[:-1]\r\n if lookup[rank]>lookup[pank]:\r\n flag=True\r\n else:\r\n if p[-1]==trump:\r\n flag=True\r\n\r\n YES(flag)\r\n\r\n\r\n# ! This is the Main Function\r\n\r\n\r\ndef main():\r\n flag = 1\r\n #! Checking we are offline or not\r\n try:\r\n sys.stdin = open(\r\n \"c:/Users/dell/Documents/python/CodeForces/contest-div-2/input.txt\",\r\n \"r\",\r\n )\r\n sys.stdout = open(\r\n \"c:/Users/dell/Documents/python/CodeForces/contest-div-2/output.txt\",\r\n \"w\",\r\n )\r\n except:\r\n flag = 0\r\n\r\n t = 1\r\n if TestCases:\r\n t = I()\r\n for test in range(1, t + 1):\r\n solve()\r\n\r\n if flag:\r\n print(\"Time: %.4f sec\" % (time.time() - start_time))\r\n localtime = time.asctime(time.localtime(time.time()))\r\n print(localtime)\r\n sys.stdout.close()\r\n\r\n\r\n# ! End Region\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n # ? Incresing Stack Limit\r\n # increase_stack()\r\n\r\n #! Calling Main Function\r\n main()", "trump_card=input()\r\nA,K,Q,J,T=14,13,12,11,10\r\nC1,C2=input().split()\r\nx=eval(C1[0])\r\ny=eval(C2[0])\r\nif C1[1]==C2[1]:\r\n if x>y:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif C1[1]==trump_card:\r\n print(\"YES\")\r\nelif C2[1]==trump_card:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\nz = input().split()\r\n#print(z)\r\nlst = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" , \"A\"]\r\n#print(z[1][1][0])\r\nif z[0][1][0] == x and z[1][1][0] != x:\r\n print(\"YES\")\r\nelif z[0][1][0] == z[1][1][0] and lst.index(z[0][0][0]) > lst.index(z[1][0][0]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "trump=input()\r\nl=input()\r\nrank={\"6\":0,\"7\":1,\"8\":2,\"9\":3,\"T\":4,\"J\":5,\"Q\":6,\"K\":7,\"A\":8}\r\nfirst1=l[1]\r\nfirst2=l[0]\r\nsecond1=l[4]\r\nsecond2=l[3]\r\nif(first1==second1):\r\n if(rank[first2]>rank[second2]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if(first1==trump):\r\n print(\"YES\")\r\n elif(second1==trump):\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "t = input()\r\ncard1, card2 = input().split()\r\n\r\n\r\nl = ['6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']\r\n\r\n\r\na = l.index(card1[0])\r\nb = l.index(card2[0])\r\n\r\n\r\nif card1[1] == card2[1]:\r\n if a > b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n \r\n if card1[1] != t:\r\n print('NO')\r\n else:\r\n print('YES')", "k = input()\r\nt = '6789TJQKA'\r\na, b = input().split()\r\nif a[1] == b[1]: print('YES' if t.find(a[0]) > t.find(b[0]) else 'NO')\r\nelse: print('YES' if a[1] == k else 'NO')", "n = input()\r\na,b = input().split(' ')\r\nlst=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" , \"A\"]\r\n\r\nif a[1]==n and b[1]!=n:\r\n print(\"YES\")\r\n\r\nelif a[1]==b[1]:\r\n i,j = 0,0\r\n \r\n for k in range(9):\r\n if a[0]==lst[k]:\r\n i = k\r\n if b[0]==lst[k]:\r\n j = k\r\n \r\n if i > j:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb,c = input().split() \r\nd = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" , \"A\"]\r\nif b[1] ==c[1]:\r\n if d.index(b[0]) > d.index(c[0]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif b[1] == a:\r\n print('YES')\r\nelse:\r\n print('NO')", "def main(t, c1, c2):\r\n if t in c1 and t not in c2:\r\n return \"YES\"\r\n if c1[1] != c2[1]:\r\n return \"NO\"\r\n order = {\r\n \"6\": 1,\r\n \"7\": 2,\r\n \"8\": 3,\r\n \"9\": 4,\r\n \"T\": 5,\r\n \"J\": 6,\r\n \"Q\": 7,\r\n \"K\": 8,\r\n \"A\": 9\r\n }\r\n if order[c1[0]] > order[c2[0]]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(main(input(), *input().strip().split()))\r\n", "t = input()\r\nf, s = map(str, input().split())\r\ndict = {\"6\" : 1,\r\n\"7\" : 2, \r\n\"8\" : 3, \r\n\"9\" : 4, \r\n\"T\" : 5,\r\n\"J\" : 6, \r\n\"Q\" : 7, \r\n\"K\" : 8, \r\n\"A\" : 9}\r\nif f[1] == t and s[1] != t:\r\n print(\"YES\")\r\nelif f[1] == t and s[1] == t:\r\n if dict[f[0]] > dict[s[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif f[1] != t and s[1] != t:\r\n if f[1] == s[1]:\r\n if dict[f[0]] > dict[s[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "class CodeforcesTask106ASolution:\n def __init__(self):\n self.result = ''\n self.trump = ''\n self.cards = []\n\n def read_input(self):\n self.trump = input()\n self.cards = input().split(\" \")\n\n def process_task(self):\n order = \"6789TJQKA\"\n if self.trump == self.cards[0][1]:\n if self.trump == self.cards[1][1]:\n if order.index(self.cards[0][0]) > order.index(self.cards[1][0]):\n self.result = \"YES\"\n else:\n self.result = \"NO\"\n else:\n self.result = \"YES\"\n else:\n if self.cards[0][1] == self.cards[1][1]:\n if order.index(self.cards[0][0]) > order.index(self.cards[1][0]):\n self.result = \"YES\"\n else:\n self.result = \"NO\"\n else:\n self.result = \"NO\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask106ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "tr=str(input())\r\ns1,s2=[str(x) for x in input().split()]\r\nl=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\",\"A\"]\r\nif (s1[1]==tr and s2[1]!=tr):\r\n print(\"YES\")\r\nelse:\r\n if (s1[1]==s2[1]):\r\n if l.index(s1[0])>l.index(s2[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n ", "import math\r\ndef main_function():\r\n trump = input()\r\n rank = {\"6\":1, \"7\":2, \"8\":3, \"9\":4, \"T\":5, \"J\":6, \"Q\":7, \"K\":8, \"A\":9}\r\n cards = [i for i in input().split(\" \")]\r\n if cards[0][1] == cards[1][1]:\r\n if rank[cards[0][0]] > rank[cards[1][0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n if cards[0][1] == trump:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\nmain_function()", "t = '6789TJQKA'\r\ns = input()\r\nx = input()\r\nif x[1] == s and x[4] != s or x[1] == x[4] and t.find(x[0]) > t.find(x[3]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "trump=input()\r\ns1,s2=input().split()\r\nl1=['6','7','8','9','T','J','Q','K','A']\r\nif s1[1]==trump:\r\n if s2[1]==trump:\r\n if l1.index(s1[0])>l1.index(s2[0]):\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n else :\r\n print(\"YES\")\r\nelse :\r\n if s1[1]!=s2[1]:\r\n print(\"NO\")\r\n else :\r\n if l1.index(s1[0])>l1.index(s2[0]):\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "s = str(input())\r\na = ['6' , '7' , '8' , '9' , 'T' , 'J' , 'Q' , 'K' , 'A']\r\n\r\nres = input().split()\r\n\r\ni1 = res[0][0]\r\ni2 = res[1][0]\r\n\r\nm1 = res[0][1]\r\nm2 = res[1][1]\r\n\r\n\r\nif(m1 != s and m2 != s):\r\n if(m1 != m2):\r\n print('NO')\r\n else:\r\n if(a.index(i1) > a.index(i2)):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if(m1 == s and m2 != s):\r\n print('YES')\r\n elif(m1 != s and m2 == s):\r\n print('NO')\r\n else:\r\n if(a.index(i1) > a.index(i2)):\r\n print('YES')\r\n else:\r\n print('NO')", "md = {\"6\":1,\"7\":2, \"8\":3, \"9\":4, \"T\":5, \"J\":6, \"Q\":7, \"K\":8,\"A\":9};\r\nc = input();\r\na,b = input().split();\r\nans = False;\r\nif a[1]==b[1]:\r\n if md.get(a[0])>md.get(b[0]):\r\n ans=True;\r\nelif a[1]==c:\r\n ans=True;\r\nprint(['NO','YES'][ans]);\r\n\r\n \r\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n c = str(input())\r\n a,b = map(str , input().split())\r\n S = \"6789TJQKA\"\r\n if a[1] == c:\r\n if b[1] != c:\r\n print('YES')\r\n quit()\r\n elif S.find(a[0]) > S.find(b[0]):\r\n print('YES')\r\n quit()\r\n else:\r\n print('NO')\r\n quit()\r\n\r\n elif b[1] == c:\r\n if a[1] != c:\r\n print('NO')\r\n quit()\r\n elif S.find(b[0]) > S.find(a[0]):\r\n print('NO')\r\n quit()\r\n else:\r\n print('YES')\r\n quit()\r\n \r\n else:\r\n if S.find(a[0]) > S.find(b[0]) and a[1] == b[1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n ", "RANKS = '6789TJQKA'\r\n\r\ntrump_suit = input()\r\n(rank_1, suit_1), (rank_2, suit_2) = input().split()\r\n\r\nif suit_1 == suit_2:\r\n print('YES' if RANKS.find(rank_1) > RANKS.find(rank_2) else 'NO')\r\nelse:\r\n print('YES' if suit_1 == trump_suit else 'NO')", "x = str(input(''))\r\nlst = list(map(str, input().split()))\r\ny = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\",\"A\"]\r\nif lst[0][1]!=lst[1][1] and lst[0][1]!=x:\r\n print(\"NO\")\r\nelif lst[0][1]!=lst[1][1] and lst[0][1]==x:\r\n print('YES')\r\nelif lst[0][1]==lst[1][1]:\r\n if y.index(lst[0][0])>y.index(lst[1][0]):\r\n print('YES')\r\n else:\r\n print('NO')", "l = ['6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']\r\ns = input()\r\nx, y = input().split()\r\nif (x[1] == s and x[1] != y[1]) or (x[1] == y[1] and l.index(x[0]) > l.index(y[0])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Problem Link: https://codeforces.com/problemset/problem/106/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\ntrump = input()\r\nranks = {\r\n \"6\": 0,\r\n \"7\": 1,\r\n \"8\": 2,\r\n \"9\": 3,\r\n \"T\": 4,\r\n \"J\": 5,\r\n \"Q\": 6,\r\n \"K\": 7,\r\n \"A\": 8\r\n}\r\n\r\ncard1, card2 = input().split()\r\n\r\nrank1 = ranks[card1[0]]\r\nsuit1 = card1[1]\r\nrank2 = ranks[card2[0]]\r\nsuit2 = card2[1]\r\n\r\nwinner1 = False;\r\nif suit1 == suit2:\r\n if (rank1 > rank2):\r\n winner1 = True\r\nelse:\r\n if suit1 == trump:\r\n winner1 = True\r\n\r\nif winner1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def card_value(card):\r\n if card[0] == 'T':\r\n return 10\r\n elif card[0] == 'J':\r\n return 11\r\n elif card[0] == 'Q':\r\n return 12\r\n elif card[0] == 'K':\r\n return 13\r\n elif card[0] == 'A':\r\n return 14\r\n else:\r\n return int(card[0])\r\n\r\ntrump = input()\r\ncard1, card2 = input().split()\r\nif card1[1] == card2[1]:\r\n if card_value(card1) > card_value(card2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif card1[1] == trump:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = ['6','7','8','9','T','J','Q','K','A']\r\nt = input()\r\nc1, c2=input().split()\r\nif c1[1] == t and c2[1] != t:\r\n print('YES')\r\nelse:\r\n if c1[1] != c2[1]:\r\n print('NO')\r\n else:\r\n print('YES' if a.index(c1[0])>a.index(c2[0]) else 'NO')", "def card_game():\r\n\ttrump = input()\r\n\tfirst, second = input().split()\r\n\r\n\trank = (\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\")\r\n\tif first[-1] == second[-1]:\r\n\t\tif rank.index(first[0]) > rank.index(second[0]):\r\n\t\t\tprint(\"YES\")\r\n\t\t\treturn\r\n\telse:\r\n\t\tif first[-1] == trump:\r\n\t\t\tprint(\"YES\")\r\n\t\t\treturn\r\n\t\r\n\tprint(\"NO\")\r\n\r\n\r\ncard_game()", "l=['6','7','8','9','T','J','Q','K','A']\r\ns=input()\r\nx,y=input().split()\r\nif (x[1]==s and x[1]!=y[1]) or (x[1]==y[1] and l.index(x[0])>l.index(y[0])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na,b=map(str,input().split())\r\n \r\n#suit = ['S','H','D','C']\r\nrank = ['6','7','8','9','T','J','Q','K','A']\r\n \r\nif (a[1]==b[1] and rank.index(a[0])>rank.index(b[0])) or (a[1]==s and a[1]!=b[1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb, c = map(str, input().split())\r\n\r\nd = {\r\n\r\n'6': 1, \r\n'7': 2, \r\n'8': 3, \r\n'9': 4, \r\n'T': 5, \r\n'J': 6, \r\n'Q': 7, \r\n'K': 8, \r\n'A': 9\r\n\r\n}\r\n\r\nif b[1] == a[0] and c[1] != a[0]: print(\"YES\")\r\nelif b[1] == c[1] and d[b[0]] > d[c[0]]:\r\n\tprint(\"YES\")\r\nelse: print(\"NO\")", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nnums = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n\r\ncards = {n:i for i, n in enumerate(nums)}\r\n\r\ns = input()\r\nc1, c2 = input().split()\r\nok = False\r\nif s in c1 and s not in c2:\r\n ok = True\r\nelif s not in c1 and s not in c2:\r\n if c1[-1] == c2[-1] and cards[c1[0]] > cards[c2[0]]:\r\n ok = True\r\nelif s in c1 and s in c2:\r\n if c1[-1] == c2[-1] and cards[c1[0]] > cards[c2[0]]:\r\n ok = True\r\n\r\nif ok:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=input()\nx,y=list(map(str,input().split()))\np=[ \"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" , \"A\"]\nif(x[1]==a and y[1]!=a):\n\tprint(\"YES\")\nelif((x[1]==a and y[1]==a) or x[1]==y[1]):\n\tif(p.index(x[0])>p.index(y[0])):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\nelse:\n\tprint(\"NO\")", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nsetrecursionlimit(10**7)\ndX= [ 0, 0, 1,-1, 1,-1, 1,-1]\ndY= [ 1,-1, 0, 0, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\ns1=RS()[0]\ns2,s3=RS()\ns=\"6789TJQKA\"\nrank={s[i]:i for i in range(len(s))}\nif (s2[1]==s3[1] and rank[s2[0]]>rank[s3[0]]) or (s2[1]==s1 and s3[1]!=s1):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "trump = input().strip()\na, b = input().split()\nif a[1] != b[1]:\n if a[1] == trump:\n print('YES')\n else:\n print('NO')\nelse:\n ranks = ['6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']\n if ranks.index(a[0]) > ranks.index(b[0]):\n print('YES')\n else:\n print('NO')\n", "list1=[\"6\",\"7\",\"8\",\"9\",\"T\",\"J\",\"Q\",\"K\",\"A\"]\r\n\r\ns1=input()\r\nx,y=input().split()\r\nif(x[1]==y[1]):\r\n if(list1.index(x[0])>list1.index(y[0])):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if(x[1]==s1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "l = ['6','7','8','9','T','J','Q','K','A']\r\nt = input()\r\nf, s = map(str, input().split())\r\nif(f[1] == s[1]):\r\n if(l.index(f[0]) > l.index(s[0])):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif(t == f[1]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "kozir = str(input())\r\na1 = [\"6\",\"7\",\"8\",\"9\",\"T\",\"J\",\"Q\",\"K\",\"A\"]\r\na2 = [\"S\",\"D\",\"H\",\"C\"]\r\na,b = list(map(list,input().split()))\r\nif a[1] == b[1]:\r\n if a1.index(a[0]) > a1.index(b[0]): print(\"YES\")\r\n else: print(\"NO\")\r\nelse:\r\n if a[1] == kozir: print(\"YES\")\r\n else: print(\"NO\")", "a = {\"6\":6,\"7\":7,\"8\":8,\"9\":9,\"T\":10,\"J\":11,\"Q\":12,\"K\":13,\"A\":14}\r\nn = input()\r\ns,d = input().split()\r\nc = False\r\n\r\nif s[1]==n and d[1]!=n:\r\n\tc=True\r\nelif s[1]==d[1]:\r\n\tif a.get(s[0])>a.get(d[0]):\r\n\t\tc = True\r\nif c:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "trump = str(input())\ncarda, cardb = [str(x) for x in input().strip().split()]\nwin = 0\ndeck = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\nranka = deck.index(carda[0])\nrankb = deck.index(cardb[0])\nif(carda[1]==cardb[1]):\n\t#same suit\n\tif(ranka > rankb):\n\t\twin=1\n\telif(ranka < rankb):\n\t\twin=2\nelse:\n\tif(carda[1]==trump[0]):\n\t\twin=1\n\telif(cardb[1]==trump[0]):\n\t\twin=2\n\nif(win==1):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n", "\r\n#start the code from here\r\n\r\ntrump=input()\r\nfir,sec=map(str,input().split())\r\ntrlist=[\"S\", \"H\", \"D\",\"C\"]\r\nrank=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\",\"A\"]\r\nif fir[1]==trump and sec[1]!=trump:\r\n\tprint(\"YES\")\r\nelif fir[1]==sec[1]:\r\n\tif rank.index(fir[0])>rank.index(sec[0]):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse:\r\n\tprint(\"NO\")", "trump = input().strip()\r\ncard1, card2 = input().split()\r\n\r\n# Function to check if card1 beats card2\r\ndef beats(card1, card2):\r\n if card1[1] == trump and card2[1] != trump: # card1 is trump, card2 is not\r\n return True\r\n elif card2[1] == trump and card1[1] != trump: # card2 is trump, card1 is not\r\n return False\r\n elif card1[1] == card2[1]: # both cards have the same suit\r\n rank_order = \"6789TJQKA\"\r\n if rank_order.index(card1[0]) > rank_order.index(card2[0]):\r\n return True\r\n else:\r\n return False\r\n else: # different suits, neither is trump\r\n return False\r\n\r\nif beats(card1, card2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\ntrump = input()\r\ncard1, card2 = input().split()\r\n\r\nif trump == card1[1] and trump != card2[1]:\r\n\tprint('YES')\r\n\texit()\r\nl = ['6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']\r\nif card2[1] == card1[1]:\r\n\tif l.index(card1[0]) > l.index(card2[0]):\r\n\t\tprint('YES')\r\n\t\texit()\r\n\r\n\r\nprint('NO')\r\n\r\n", "ts = input()\r\ndesc1, desc2 = input().split()\r\n\r\ncard1 = desc1[0]\r\ncard2 = desc2[0]\r\nsuit1 = desc1[1]\r\nsuit2 = desc2[1]\r\nc1 = -1\r\nc2 = -1\r\nif card1 in [\"5\",\"6\",\"7\",\"8\",\"9\",\"10\"]:\r\n c1 = int(card1)\r\nelif card1 == \"T\":\r\n c1 = 10\r\nelif card1 == \"J\":\r\n c1 = 11\r\nelif card1 == \"Q\":\r\n c1 = 12\r\nelif card1 == \"K\":\r\n c1 = 13\r\nelif card1 == \"A\":\r\n c1 = 14\r\n\r\nif card2 in [\"5\",\"6\",\"7\",\"8\",\"9\",\"10\"]:\r\n c2 = int(card2)\r\nelif card2 == \"T\":\r\n c2 = 10\r\nelif card2 == \"J\":\r\n c2 = 11\r\nelif card2 == \"Q\":\r\n c2 = 12\r\nelif card2 == \"K\":\r\n c2 = 13\r\nelif card2 == \"A\":\r\n c2 = 14\r\n\r\nif(suit1 != suit2 and suit1 != ts):\r\n print(\"NO\")\r\nelif suit1 == ts and suit2 != ts:\r\n print(\"YES\")\r\nelse:\r\n if(c1 > c2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "ranks = ['6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']\r\ntrump = input()\r\ncard1, card2 = input().split()\r\n\r\nif card1[1] == card2[1]:\r\n print('YES' if ranks.index(card1[0]) > ranks.index(card2[0]) else 'NO')\r\nelse:\r\n print('YES' if card1[1] == trump else 'NO')\r\n", "t=input()\r\na,b=input().split()\r\nc='6789TJQKA'\r\nif a[1]==b[1]:\r\n if c.find(a[0])>c.find(b[0]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif a[1]==t and b[1]!=t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\nl = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" ,\"A\"]\r\nt = input()\r\na,b = input().split()\r\nif a[1]==b[1] :\r\n print(\"YES\") if l.index(a[0]) > l.index(b[0]) else print(\"NO\")\r\nelif a[1]== t : print(\"YES\")\r\nelse : print(\"NO\")", "'''input\nC\n7H AS\n'''\n\n\ndef main():\n\n rank = {'6' : 0,\n '7' : 1,\n '8' : 2,\n '9' : 3,\n 'T' : 4,\n 'J' : 5,\n 'Q' : 6,\n 'K' : 7,\n 'A' : 9}\n\n\n trump = input()\n c1, c2 = input().split()\n\n if(c1[1] == trump and c2[1] != trump):\n print(\"YES\")\n elif(c1[1] == c2[1]):\n if(rank[c1[0]] > rank[c2[0]]):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n\n \n\nif __name__ == \"__main__\":\n main()\n\n\n", "# durak\r\n\r\nhigh = input()\r\ndata = input().split()\r\n\r\na = list(data[0])\r\nb = list(data[1])\r\n\r\ncards = list('6789TJQKA')\r\n\r\nif a[1] == b[1]:\r\n if cards.index(a[0]) > cards.index(b[0]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif a[1] == high:\r\n print('YES')\r\nelse:\r\n print('NO')", "def rank(c):\r\n s=\"6789TJQKA\"\r\n return s.find(c)\r\nt=input()\r\ns=input()\r\ns1, s2=s.split(sep=\" \")\r\nif s1[1]==t and s2[1]!=t:\r\n print('YES')\r\nelif s1[1]==s2[1] and rank(s1[0])>=rank(s2[0]):\r\n print('YES')\r\nelse:\r\n print('NO')", "m = input()\r\nc = input().split()\r\nl1 = []\r\nc1 = []\r\nc2 = []\r\ngg = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\nfor i in c:\r\n l1.append(i)\r\nfor i in str(l1[0]):\r\n c1.append(i)\r\nfor i in str(l1[1]):\r\n c2.append(i)\r\nfor i in gg:\r\n if c1[0] == i:\r\n c1[0] = gg.index(i)\r\n if c2[0] == i:\r\n c2[0] = gg.index(i)\r\n\r\nif c1[1] == c2[1]:\r\n if c1[0] > c2[0]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif c1[1] != c2[1]:\r\n if c1[1] == m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "t='6789TJQKA'\r\nI=input\r\ns=I()\r\nx=I()\r\nprint(['NO','YES'][x[1]==s and x[4]!=s or x[1]==x[4]and t.find(x[0])>t.find(x[3])])", "n=input()\r\np,k=list(map(str,input().split()))\r\njim=[\"6\",\"7\",\"8\",\"9\",\"T\",\"J\",\"Q\",\"K\",\"A\"]\r\nif n not in p and n not in k:\r\n if p[1]==k[1]:\r\n if jim.index(p[0])>jim.index(k[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if n in p and n not in k:\r\n print(\"YES\")\r\n elif n not in p and n in k:\r\n print(\"NO\")\r\n else:\r\n if jim.index(p[0])>jim.index(k[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "suit = input()\r\ncards = input().split()\r\nranks = [\"6\",\"7\", \"8\", \"9\", \"T\",\"J\", \"Q\", \"K\", \"A\" ]\r\nif cards[0][1] == cards[1][1]:\r\n if ranks.index(cards[0][0]) > ranks.index(cards[1][0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif cards[0][1] == suit and cards[1][1] != suit:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t = input()\r\np1,p2 = input().split()\r\nl = ['6','7','8','9','T','J','Q','K','A']\r\nif p1[1]==p2[1]:\r\n if l.index(p1[0])>l.index(p2[0]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif p1[1]==t or p2[1]==t:\r\n if p1[1]==t:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "trump=input()\r\na,b=input().split()\r\nx,y=[],[]\r\nfor i in range(2):\r\n x.append(a[i])\r\n y.append(b[i])\r\nmap1={\"6\":9, \"7\":8, \"8\":7, \"9\":6, \"T\":5, \"J\":4, \"Q\":3, \"K\":2 ,\"A\":1}\r\nif x[1]==y[1]:\r\n if map1[x[0]]<map1[y[0]]:\r\n print(\"YES\")\r\n else:print(\"NO\")\r\nelif x[1]==trump:\r\n print(\"YES\")\r\nelse:print(\"NO\") \r\n ", "trump = input()\r\nword = input()\r\nidx = word.find(' ')\r\nc1 = word[:idx]\r\nc2 = word[(idx+1):]\r\ns1 = c1[1]\r\ns2 = c2[1]\r\nif(c1[0]=='T'):\r\n\tnum1 = 10\r\nelif(c1[0]=='J'):\r\n\tnum1 = 11\r\nelif(c1[0]=='Q'):\r\n\tnum1 = 12\r\nelif(c1[0]=='K'):\r\n\tnum1 = 13\r\nelif(c1[0]=='A'):\r\n\tnum1 = 14\r\nelse:\r\n\tnum1 = int(c1[0])\r\nif(c2[0]=='T'):\r\n\tnum2 = 10\r\nelif(c2[0]=='J'):\r\n\tnum2 = 11\r\nelif(c2[0]=='Q'):\r\n\tnum2 = 12\r\nelif(c2[0]=='K'):\r\n\tnum2 = 13\r\nelif(c2[0]=='A'):\r\n\tnum2 = 14\r\nelse:\r\n\tnum2 = int(c2[0])\r\nif(s1==s2):\r\n\tif(num1>num2):\r\n\t\tprint (\"YES\")\r\n\telse:\r\n\t\tprint (\"NO\")\r\nelse:\r\n\tif(s1==trump):\r\n\t\tprint (\"YES\")\r\n\telse:\r\n\t\tprint (\"NO\")", "def main():\r\n trump = input()\r\n a, b = input().split()\r\n chars = '6789TJQKA'\r\n mp = dict(zip(chars, range(len(chars))))\r\n\r\n cond1 = a[1] == b[1] and mp[a[0]] > mp[b[0]]\r\n cond2 = a[1] == trump and b[1] != trump\r\n\r\n print('YES' if cond1 or cond2 else 'NO')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def main():\n trump = input()\n cards, suits = [], []\n for s in input().split():\n cards.append('6789TJQKA'.find(s[0]))\n suits.append(s[1])\n if suits[0] == suits[1]:\n res = cards[0] > cards[1]\n else:\n res = suits[0] == trump\n print(('NO', 'YES')[res])\n\n\nif __name__ == '__main__':\n main()\n\n", "trump= input()\r\nfirst, scd = input().split()\r\nd = {\"6\" : 6, \"7\":7 ,\"8\" :8, \"9\":9, \"T\":10, \"J\":11, \"Q\":12, \"K\":13, \"A\":14}\r\n\r\nif trump in first and trump not in scd:\r\n print('YES')\r\nelif trump in scd and trump not in first:\r\n print('NO')\r\nelif first[1] == scd[1]:\r\n\r\n print(['NO','YES'][d[first[0]]>d[scd[0]]])\r\nelse :\r\n print('NO')", "#code\r\nk = input()\r\nf,s = map(str,input().split())\r\nx = ['6','7','8','9','T','J','Q','K','A']\r\nif f[1]!=s[1]:\r\n if f[1]==k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if x.index(f[0])>x.index(s[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "trump = input()\r\ncards = input().split()\r\nk = ['6','7','8','9','T','J','Q','K','A']\r\nif(cards[0][1] == cards[1][1]):\r\n\tif(k.index(cards[0][0]) > k.index(cards[1][0])):\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelif(cards[0][1] == trump):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "suit = '6789TJQKA'\r\nsuper = input()\r\nx = input()\r\nif (x[1] == super and x[4] != super) or (x[1] == x[4] and suit.find(x[0]) > suit.find(x[3])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\nimport math\ninput=sys.stdin.buffer.readline\n#t=int(input())\nmod=998244353\n# Python3 function to \n# calculate nCr % p \ndef ncr(n, r, p): \n\t# initialize numerator \n\t# and denominator \n\tnum = den = 1\n\tfor i in range(r): \n\t\tnum = (num * (n - i)) % p \n\t\tden = (den * (i + 1)) % p \n\treturn (num * pow(den, \n\t\t\tp - 2, p)) % p \n\nt=1\nfor _ in range(t):\n #n=int(input())\n #n,k=map(int,input().split())\n #l=list(map(int,input().split()))\n trump=input()\n l=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\n x=input()\n #print(chr(x[0]),chr(x[1]),trump,x[2],x[3],x[4])\n if chr(x[1])==chr(x[4]):\n #print(chr(x[1]),chr(x[4]))\n if l.index(chr(x[0]))>l.index(chr(x[3])):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n if chr(x[1])==chr(trump[0]):\n print(\"YES\")\n else:\n print(\"NO\")\n \n \t \t\t \t \t \t \t\t\t \t", "v = '6789TJQKA'\r\nt = input()\r\nc1, c2 = input().split()\r\nif c1[1] == c2[1] and v.index(c1[0]) > v.index(c2[0]):\r\n print('YES')\r\nelif c1[1] == t and c2[1] != t:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nx=input().split()\r\na=x[0]\r\nb=x[1]\r\nk={'6':0,'7':1,'8':2,'9':3,'T':4,'J':5,'Q':6,'K':7,'A':8}\r\nif k[a[0]]>k[b[0]] and a[1]==b[1]:\r\n print('YES')\r\nelif a[1]==s and b[1]!=s:\r\n print('YES')\r\nelse:\r\n print('NO') ", "trump = input()\r\nno = {'6' : 0, '7' : 1, '8' : 2, '9' : 3, 'T' : 4, 'J' : 5, 'Q' : 6, 'K' : 7, 'A' : 8}\r\n\r\ns = input().split()\r\na = s[0]\r\nb = s[1]\r\n\r\nif a[1] == trump:\r\n if b[1] != trump:\r\n print(\"YES\")\r\n else:\r\n if no[a[0]] <= no[b[0]]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\nelse:\r\n if a[1] == b[1] and no[a[0]] > no[b[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "ranks = [ \"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n\r\ndef solve(tr, one, two):\r\n if one[1] == tr and two[1] != tr: return \"YES\"\r\n if one[1] != tr and two[1] == tr: return \"NO\"\r\n if one[1] != two[1]: return \"NO\"\r\n return [\"NO\",\"YES\"][ranks.index(one[0]) > ranks.index(two[0])]\r\n\r\ntr = input()\r\none, two = input().split()\r\nprint(solve(tr, one, two))", "rank = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\ntrump = input()\r\ncards = input().split()\r\nfirst = cards[0]\r\nsecond = cards[1]\r\n\r\nans = \"NO\"\r\nif(first[1] != second[1]):\r\n if(first[1]==trump):\r\n ans = \"YES\"\r\n elif(second[1] == trump):\r\n ans = \"NO\"\r\nelif(first[1]==second[1]):\r\n if(rank.index(first[0])>rank.index(second[0])):\r\n ans = \"YES\"\r\n else:\r\n ans = \"NO\"\r\nprint(ans)\r\n \r\n", "M = input()\ns1, s2 = map(str, input().split())\nl1 = ['6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']\n\nif s1[1] == M:\n if s2[1] == M:\n if(l1.index(s1[0]) > l1.index(s2[0])):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"YES\")\nelse:\n if s1[1] != s2[1]:\n print(\"NO\")\n else:\n if(l1.index(s1[0]) > l1.index(s2[0])):\n print(\"YES\")\n else:\n print(\"NO\")\n", "#79\r\ntrump = input()\r\ncards = [x for x in input().split()]\r\n\r\ndef getRank(rank):\r\n return [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" , \"A\"].index(rank)\r\n\r\nif cards[0][1] != cards[1][1] and cards[0][1] == trump:\r\n print(\"YES\")\r\nelif cards[0][1] == cards[1][1]:\r\n if getRank(cards[0][0]) > getRank(cards[1][0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "import math\nfrom collections import defaultdict\nml=lambda:map(int,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:input()\n\n\"\"\"========main code===============\"\"\"\n\nt=1\n#t=ii()\nlol=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\" , \"A\"]\nfor _ in range(t):\n n=ip()\n a,b=input().split()\n if(a[1]==n and b[1]!=n):\n print(\"YES\")\n elif(a[1]==b[1]):\n idx1=0\n idx2=0\n for i in range(9):\n if(a[0]==lol[i]):\n idx1=i\n if(b[0]==lol[i]):\n idx2=i\n if(idx1>idx2):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n \t\t \t \t \t\t \t\t \t\t\t\t\t\t", "trump = input()\n\na, b = map(str, input().split())\narr = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\nif a[1] != trump and b[1] != trump or a[1] == trump and b[1] == trump:\n if a[1] == b[1]:\n if arr.index(a[0]) > arr.index(b[0]):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n\nif a[1] == trump and b[1]!=trump:\n print(\"YES\")\nif b[1] == trump and a[1]!=trump:\n print('NO')\n", "trump=input()\r\n\r\ndef ki(a):\r\n nn=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n for i in range(len(nn)):\r\n if nn[i]==a:\r\n return i\r\ncard=list(input().split())\r\nif card[0][1]==card[1][1]:\r\n if ki(card[0][0]) > ki(card[1][0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif card[0][1]==trump:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "tramp = input()\r\n\r\ncard = input()\r\n\r\nrank = '6789TJQKA'\r\na='YES'\r\nb='NO'\r\n\r\nprint(a if (card[1] == tramp and card[4] != tramp) or (card[1] == card[4] and rank.find(card[0]) > rank.find(card[3]) )else b)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l = '6 7 8 9 T J Q K A'.split()\r\nk = input()\r\na, b = map(str, input().split())\r\nif a[1] == k and b[1] != k:\r\n\tprint('YES')\r\nelif a[1] != k and b[1] == k:\r\n\tprint('NO')\r\nelif a[1] == b[1]:\r\n\tif l.index(a[0]) > l.index(b[0]):\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tprint('NO')", "best = input()\norder = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\nfirst, second = tuple([string for string in input().split()])\nif(first[1] == second[1]):\n\tif(order.index(first[0]) > order.index(second[0])):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\nelse:\n\tif(first[1] == best):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n\n# if(second[1] == best and first[1] != best):\n# \tprint(\"NO\")\n# elif(order.index(first[0]) > order.index(second[0])):\n# \tprint(\"YES\")\n# elif(first[1] == best):\n# \tprint(\"YES\")\n# else:\n# \tprint(\"NO\")", "trump=input()\r\ncards=[]\r\ncards=input().split()\r\nrank1=cards[0][0]\r\nrank2=cards[1][0]\r\nsuit1=cards[0][1]\r\nsuit2=cards[1][1]\r\n\r\nrank=[\"6\",\"7\",\"8\",\"9\",\"T\",\"J\",\"Q\",\"K\",\"A\"]\r\nif suit1==trump and suit2!=trump:\r\n print('YES')\r\nelif suit1==suit2:\r\n if (rank.index(rank1))>(rank.index(rank2)):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "trump = input()\r\na, b = input().split()\r\n\r\nrank = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n\r\nif a[1] == b[1]:\r\n if rank.index(a[0]) > rank.index(b[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if a[1] == trump and b[1] != trump:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t = str(input())\r\ns1, s2 = map(str,input().split())\r\na = \"6789TJQKA\"\r\nif s1[1] == s2[1]:\r\n\tprint(\"YES\" if a.find(s1[0]) > a.find(s2[0]) else \"NO\")\r\nelse:\r\n\tprint(\"YES\" if s1[1] == t else \"NO\")\r\n", "t=input()\r\na,b=map(str,input().split())\r\nx=[\"S\", \"H\", \"D\", \"C\"]\r\ny=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\nif a[1]==b[1]:\r\n if y.index(a[0])>y.index(b[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if a[1]==t:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "v='6789TJQKA'\r\nt=input()[0]\r\na,b=input().split()\r\nprint('NYOE S'[a[1]==t!=b[1] or a[1]==b[1]and v.index(a[0])>v.index(b[0])::2])\r\n", "trump=['S','H','D','C']\r\nc='6789TJQKA'\r\ns=input()\r\na,b=input().split()\r\n\r\nif a[1]==b[1]:\r\n if c.find(a[0])>c.find(b[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif a[1]==s and b[1]!=s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t = input()\r\nx, y = input().split()\r\n\r\nc = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n\r\nif y[1] == t and x[1] != t:\r\n\tprint(\"NO\")\r\n\r\nelif x[1] == t and y[1] != t:\r\n\tprint(\"YES\")\r\n\t\r\nelif x[1] == y[1]:\r\n\tif c.index(x[0]) > c.index(y[0]):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse:\r\n\tprint(\"NO\")", "s=input()\r\nt=input()\r\na=['6','7','8','9','T','J','Q','K','A']\r\ns1,s2=t.split(' ')\r\nif s1[1]==s:\r\n if s2[1]==s:\r\n if a.index(s1[0])>a.index(s2[0]):\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('YES')\r\nelse:\r\n if s1[1]!=s2[1]:\r\n print('NO')\r\n else:\r\n if a.index(s1[0])>a.index(s2[0]):\r\n print('YES')\r\n else:\r\n print('NO')", "di = {'6': 1, '7': 2, '8': 3, '9': 4, 'T': 5, 'J': 6, 'Q': 7, 'K': 8, 'A': 9}\r\nt = input()\r\nc1, c2 = input().split()\r\n\r\nif (c1[1] == c2[1]):\r\n if (di[c1[0]] > di[c2[0]]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if (c1[1] == t):\r\n print('YES')\r\n else:\r\n print('NO')", "#import math\r\n#n, m = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#n, m, k = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#k = int (k)\r\n#n = int(input())\r\n#m = int(input())\r\n#s = input()\r\n##t = input()\r\n#a = list(map(int, input().split()))\r\n#print(l)\r\n#c = list(map(int, input().split()))\r\n\r\n#x1, y1, x2, y2 =map(int,input().split())\r\n#n = int(input())\r\n#f = []\r\n#t = [0]*n\r\n#f = [(int(s1[0]),s1[1]), (int(s2[0]),s2[1]), (int(s3[0]), s3[1])]\r\ndef larger(a, b):\r\n con = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n p1 = 0\r\n p2 = 0\r\n for i in range(len(con)):\r\n if (a == con[i]):\r\n p1 = i\r\n if (b == con[i]):\r\n p2 = i\r\n return p1 > p2\r\n#h = [\"\"] * n\r\n#f1 = sorted(f, key = lambda tup: tup[0])\r\nt = input()\r\nc1, c2 = input().split()\r\nif ( c1[1] == t and not c2[1] == t):\r\n print(\"YES\")\r\nelif (not (c1[1] == c2[1])):\r\n print(\"NO\")\r\nelif (larger(c1[0], c2[0])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n#f1 = sorted(t, key = lambda tup: tup[0])\r\n", "weight = '6789TJQKA'\r\n\r\ntrump_card = input()\r\ncard_1, card_2 = input().split()\r\n\r\nif card_1[1] == card_2[1]:\r\n print('YES' if weight.index(card_1[0]) > weight.index(card_2[0]) else 'NO')\r\nelse:\r\n print('YES' if card_1[1] == trump_card != card_2[1] else 'NO')\r\n", "t = str(input())\r\ns1, s2 = map(str,input().split())\r\ntemp = \"6789TJQKA\"\r\nif s1[1] == s2[1]:\r\n\tprint(\"YES\" if temp.find(s1[0]) > temp.find(s2[0]) else \"NO\")\r\nelse:\r\n\tprint(\"YES\" if s1[1] == t else \"NO\")", "k = input()\r\na, b = input().split()\r\na, b = list(a), list(b)\r\n\r\nif a[0] == 'T':\r\n a[0] = '10'\r\nelif a[0] == 'J':\r\n a[0] = '11'\r\nelif a[0] == 'Q':\r\n a[0] = '12'\r\nelif a[0] == 'K':\r\n a[0] = '13'\r\nelif a[0] == 'A':\r\n a[0] = '14'\r\n\r\nif b[0] == 'T':\r\n b[0] = '10'\r\nelif b[0] == 'J':\r\n b[0] = '11'\r\nelif b[0] == 'Q':\r\n b[0] = '12'\r\nelif b[0] == 'K':\r\n b[0] = '13'\r\nelif b[0] == 'A':\r\n b[0] = '14'\r\n\r\na[0], b[0] = int(a[0]), int(b[0])\r\n\r\nif (a[1] == k != b[1]) or (a[1] == b[1] and a[0] > b[0]):\r\n print('YES')\r\nelse:\r\n print('NO')", "trump = input()\r\ncard1, card2 = input().split()\r\nrank = ['6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A']\r\nif card1[1] == trump and card2[1] == trump:\r\n if rank.index(card1[0]) > rank.index(card2[0]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif card1[1] == trump and card2[1] != trump:\r\n print('YES')\r\nelif card1[1] != trump and card2[1] == trump:\r\n print('NO')\r\nelse:\r\n if card1[1] != card2[1]:\r\n print('NO')\r\n else:\r\n if rank.index(card1[0]) > rank.index(card2[0]):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "tc = input()\r\ncard1, card2 = input().split()\r\ncard1suit = card1[1]\r\ncard2suit = card2[1]\r\ncard1val = card1[0]\r\ncard2val = card2[0]\r\n\r\nif card1suit == tc and card2suit != tc:\r\n print('YES')\r\n exit()\r\ndef rank_val(s):\r\n if s == '6' or s == '7' or s == '8' or s == '9':\r\n return int(s)\r\n elif s == 'T':\r\n return 10\r\n elif s == 'J':\r\n return 11\r\n elif s == 'Q':\r\n return 12\r\n elif s == 'K':\r\n return 13\r\n elif s == 'A':\r\n return 14\r\n\r\nif card1suit == card2suit:\r\n if rank_val(card1val) > rank_val(card2val):\r\n print('YES')\r\n exit()\r\n else:\r\n print('NO')\r\n exit()\r\nprint('NO')\r\n", "#!/usr/bin/env python3\r\n\r\ntrump = input().rstrip()\r\ns1, s2 = input().rstrip().split()\r\n\r\norder = {\r\n '6': 0, '7': 1, '8': 2, '9': 3, 'T': 4,\r\n 'J': 5, 'Q': 6, 'K': 8, 'A': 9,\r\n}\r\n\r\nif s1[1] == s2[1]:\r\n win = order[s1[0]] > order[s2[0]]\r\nelse:\r\n win = s1[1] == trump\r\n\r\nprint('YES' if win else 'NO')\r\n", "from sys import*\r\ninput= stdin.readline\r\ns=[\"S\", \"H\", \"D\",\"C\"]\r\nr=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\nt=input().strip()\r\na,b=map(str,input().split())\r\nif(a[1]==t and b[1]!=t):\r\n print(\"YES\")\r\nelif(a[1]==b[1]):\r\n if(r.index(a[0])>r.index(b[0])):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ns1, s2 = input().split()\r\na=[ '6', '7', '8', '9', 'T', 'J', 'Q', 'K', 'A' ]\r\n\r\nif(s1[-1]==s2[-1]):\r\n if(a.index(s1[0])>=a.index(s2[0])):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif(s1[-1]==s and s2[-1]!=s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "def f(s,a,b):\r\n\tl=[\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n\tif s in a and s not in b:\r\n\t\treturn \"YES\"\r\n\telif a[1]==b[1] and l.index(a[0])>l.index(b[0]):\r\n\t\treturn \"YES\"\r\n\treturn \"NO\"\r\n\t\t\t\r\n\r\ns=input()\r\na,b=input().split()\r\nprint(f(s,a,b))", "import sys,math\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef rank(s):\r\n r = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"]\r\n for i in range(9):\r\n if r[i]==s:\r\n return i\r\ntrump = input()\r\ncard1,card2 = sys.stdin.readline().strip().split()\r\nif card1[1]==card2[1] and rank(card1[0])>rank(card2[0]) or card1[1]==trump and card2[1]!=trump:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = str(input())\r\ny,z = map(str,input().split())\r\n \r\narr = {\"6\":1, \"7\":2, \"8\":3, \"9\":4, \"T\":5, \"J\":6, \"Q\":7, \"K\":8, \"A\":9}\r\n \r\nif (x==y[1] and y[1]!=z[1]) or (y[1]==z[1] and arr[y[0]]>arr[z[0]]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "trump = input()\r\ncard1 , card2 = input().split()\r\nrank = {\"6\":1 , \"7\":2 , \"8\": 3 , \"9\":4 , \"T\":5,\"J\":6 , \"Q\" : 7 , \"K\": 8 , \"A\":9} \r\nif (card1[1] == card2[1] and rank[card1[0]] > rank[card2[0]]) or (card1[1] == trump and card2[1]!= trump):\r\n print('YES')\r\n \r\nelse:\r\n print('NO')" ]

[ "from collections import Counter\nfrom copy import deepcopy\n\ndef getMax(c1, c2):\n ret = 1 << 32\n for k in c2.keys():\n ret = min(ret, c1[k]//c2[k])\n return ret\n\na, b, c = input(), input(), input()\ncounterA, counterB, counterC = Counter(a), Counter(b), Counter(c)\n\ncntB, cntC = 0, getMax(counterA, counterC)\ncounterAA = deepcopy(counterA)\ncntBB = 0\nwhile counterAA & counterB == counterB:\n cntBB += 1\n counterAA -= counterB\n cntCC = getMax(counterAA, counterC)\n if cntB + cntC < cntBB + cntCC:\n cntB, cntC = cntBB, cntCC\n\nans = b * cntB + c * cntC\nans += ''.join((counterA - Counter(ans)).elements())\nprint(ans)\n", "INF = 999999999999999999999999999999999999999\n\na = input()\nb = input()\nc = input()\n\na_letters = [0] * 26\nb_letters = [0] * 26\nc_letters = [0] * 26\n\nfor code in range(ord('a'), ord('z') + 1):\n letter = chr(code)\n a_letters[code - ord('a')] = a.count(letter)\n b_letters[code - ord('a')] = b.count(letter)\n c_letters[code - ord('a')] = c.count(letter)\n\nwhile True:\n b_count = [0] * 26\n for i in range(26):\n if b_letters[i] > 0:\n b_count[i] = a_letters[i] // b_letters[i]\n else:\n b_count[i] = INF\n\n c_count = [0] * 26\n for i in range(26):\n if c_letters[i] > 0:\n c_count[i] = a_letters[i] // c_letters[i]\n else:\n c_count[i] = INF\n\n b_min = min(b_count)\n c_min = min(c_count)\n\n if b_min == 0 and c_min == 0:\n break\n\n if b_min > c_min:\n print(b, end='')\n for i in range(26):\n a_letters[i] -= b_letters[i]\n else:\n print(c, end='')\n for i in range(26):\n a_letters[i] -= c_letters[i]\n\nfor i in range(26):\n print(chr(ord('a') + i) * a_letters[i], end='')\nprint()\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na = list(input().rstrip())\r\nb = list(input().rstrip())\r\nc = list(input().rstrip())\r\nca, cb, cc = [0] * 26, [0] * 26, [0] * 26\r\nfor i in a:\r\n ca[i - 97] += 1\r\nfor i in b:\r\n cb[i - 97] += 1\r\nfor i in c:\r\n cc[i - 97] += 1\r\nn = len(a)\r\nok = 1\r\ninf = pow(10, 9) + 1\r\nu0, v0 = 0, 0\r\nfor u in range(n + 1):\r\n v = inf\r\n for i in range(26):\r\n x = ca[i] - u * cb[i]\r\n if x < 0:\r\n ok = 0\r\n break\r\n if cc[i]:\r\n v = min(v, x // cc[i])\r\n if not ok:\r\n break\r\n if u0 + v0 < u + v:\r\n u0, v0 = u, v\r\nans = []\r\nfor _ in range(u0):\r\n for i in b:\r\n ans.append(chr(i))\r\n ca[i - 97] -= 1\r\nfor _ in range(v0):\r\n for i in c:\r\n ans.append(chr(i))\r\n ca[i - 97] -= 1\r\nfor i in range(26):\r\n ans.append(chr(i + 97) * ca[i])\r\nsys.stdout.write(\"\".join(ans))", "def process(a, b, c):\r\n d = {}\r\n for c1 in a:\r\n if c1 not in d:\r\n d[c1] = [0, 0, 0]\r\n d[c1][0]+=1\r\n b_possible = True\r\n c_possible = True\r\n for c1 in b:\r\n if c1 not in d:\r\n b_possible = False\r\n else:\r\n d[c1][1]+=1\r\n if d[c1][1] > d[c1][0]:\r\n b_possible = False\r\n for c1 in c:\r\n if c1 not in d:\r\n c_possible = False\r\n else:\r\n d[c1][2]+=1\r\n if d[c1][2] > d[c1][0]:\r\n c_possible = False\r\n if not b_possible and not c_possible:\r\n return a\r\n elif not b_possible and c_possible:\r\n my_max = float('inf')\r\n for c1 in d:\r\n if d[c1][2] > 0:\r\n my_max = min(my_max, d[c1][0]//d[c1][2])\r\n answer = c*my_max\r\n for c1 in d:\r\n value = d[c1][0]-my_max*d[c1][2]\r\n answer = answer+c1*value\r\n return answer\r\n elif b_possible and not c_possible:\r\n my_max = float('inf')\r\n for c1 in d:\r\n if d[c1][1] > 0:\r\n my_max = min(my_max, d[c1][0]//d[c1][1])\r\n answer = b*my_max\r\n for c1 in d:\r\n value = d[c1][0]-my_max*d[c1][1]\r\n answer = answer+c1*value\r\n return answer\r\n else:\r\n b_max = float('inf')\r\n for c1 in d:\r\n if d[c1][1] > 0:\r\n b_max = min(b_max, d[c1][0]//d[c1][1])\r\n total = [b_max, b_max, 0] \r\n for i in range(b_max+1):\r\n c_max = float('inf')\r\n for c1 in d:\r\n if d[c1][2] > 0:\r\n c_max= min(c_max, (d[c1][0]-i*d[c1][1])//d[c1][2])\r\n total = max([i+c_max, i, c_max], total)\r\n t, b_count, c_count = total\r\n answer = b_count*b+c_count*c\r\n for c1 in d:\r\n value = d[c1][0]-b_count*d[c1][1]-c_count*d[c1][2]\r\n answer = answer+c1*value\r\n return answer\r\n \r\na = input()\r\nb = input()\r\nc = input()\r\nprint(process(a, b, c))", "alpha = \"abcdefghijklmnopqrstuvwxyz\"\r\ndict_alpha = {j: i for i, j in enumerate(alpha)}\r\n\r\ndef freq(s):\r\n d = [0] * len(alpha)\r\n for c in s:\r\n d[dict_alpha[c]] += 1\r\n return d\r\n\r\nsa = input()\r\nsb = input()\r\nsc = input()\r\n\r\ncntA = freq(sa)\r\ncpy_cntA = cntA.copy()\r\ncntB = freq(sb)\r\ncntC = freq(sc)\r\n\r\ndef highest(d):\r\n m = len(sa)\r\n for i in range(26):\r\n if d[i] == 0:\r\n continue\r\n m = min(m, cntA[i]//d[i])\r\n return m\r\n\r\nm = (0, 0)\r\nn = highest(cntB)\r\nfor i in range(n+1):\r\n add = highest(cntC)\r\n if i + add > sum(m):\r\n m = (i, add)\r\n for j in range(26):\r\n cntA[j] -= cntB[j]\r\n\r\nres = [sb * m[0]] + [sc * m[1]]\r\nfor i in range(26):\r\n cpy_cntA[i] -= cntB[i] * m[0] + cntC[i] * m[1]\r\n res.append(alpha[i] * cpy_cntA[i])\r\nprint(\"\".join(res))\r\n", "from collections import defaultdict\n\n\nclass CodeforcesTask551BSolution:\n def __init__(self):\n self.result = ''\n self.a = ''\n self.b = ''\n self.c = ''\n\n def read_input(self):\n self.a = input()\n self.b = input()\n self.c = input()\n\n def process_task(self):\n to_be_used = defaultdict(int)\n for a in self.a:\n to_be_used[a] += 1\n b_d = defaultdict(int)\n c_d = defaultdict(int)\n\n for a in self.b:\n b_d[a] += 1\n\n for a in self.c:\n c_d[a] += 1\n\n mx = 0\n mx_sol = [0, 0]\n mnb = min([to_be_used[x] // b_d[x] for x in b_d.keys()])\n for b in range(mnb + 1):\n for a in b_d.keys():\n to_be_used[a] -= b_d[a] * b\n mnc = min([to_be_used[x] // c_d[x] for x in c_d.keys()])\n if mnc + b > mx:\n mx = mnc + b\n mx_sol = [b, mnc]\n for a in b_d.keys():\n to_be_used[a] += b_d[a] * b\n for a in b_d.keys():\n to_be_used[a] -= b_d[a] * mx_sol[0]\n for a in c_d.keys():\n to_be_used[a] -= c_d[a] * mx_sol[1]\n self.result = mx_sol[0] * self.b + mx_sol[1] * self.c\n for r in to_be_used.keys():\n if to_be_used[r]:\n self.result += r * to_be_used[r]\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask551BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "a, b, c = input(), input(), input()\r\n\r\nall_set = set(a + b + c)\r\n\r\na_dict = {ch : a.count(ch) for ch in all_set}\r\nb_dict = {ch : b.count(ch) for ch in all_set}\r\nc_dict = {ch : c.count(ch) for ch in all_set}\r\n\r\nbMin = min([a_dict[ch] // b_dict[ch] for ch in all_set if b_dict[ch] > 0])\r\nbsum, csum = 0, 0\r\nfor i in range(bMin + 1):\r\n j = min((a_dict[ch] - b_dict[ch] * i) // c_dict[ch] for ch in all_set if c_dict[ch] > 0)\r\n if i + j > bsum + csum:\r\n bsum, csum = i, j\r\nprint(b * bsum, end = \"\")\r\nprint(c * csum, end = \"\")\r\nfor ch in all_set:\r\n print(ch * (a_dict[ch] - b_dict[ch] * bsum - c_dict[ch] * csum), end = '')\r\nprint()", "a = input()\r\nb = input()\r\nc = input()\r\n\r\nall_set = set(a + b + c)\r\n\r\ndef getMin(object_dict, sub_dict):\r\n\treturn min([object_dict[ch] // sub_dict[ch] for ch in sub_dict.keys() if sub_dict[ch] > 0])\r\n\r\na_dict = {ch : a.count(ch) for ch in all_set}\r\nb_dict = {ch : b.count(ch) for ch in all_set}\r\nc_dict = {ch : c.count(ch) for ch in all_set}\r\n\r\nbMin = getMin(a_dict, b_dict)\r\nbsum = 0\r\ncsum = 0\r\nfor i in range(bMin + 1):\r\n\tj = min((a_dict[ch] - b_dict[ch] * i) // c_dict[ch] for ch in all_set if c_dict[ch] > 0)\r\n\tif i + j > bsum + csum:\r\n\t\tbsum, csum = i, j\r\nprint(b * bsum, end = \"\")\r\nprint(c * csum, end = \"\")\r\n\r\nfor ch in all_set:\r\n\tprint(ch * (a_dict[ch] - b_dict[ch] * bsum - c_dict[ch] * csum), end = '')\r\nprint()", "def main():\r\n import sys\r\n \r\n a, b, c = sys.stdin.read().split()\r\n la = [0] * 26\r\n lb = [0] * 26\r\n lc = [0] * 26\r\n for i in a: la[ord(i) - ord('a')] += 1\r\n for i in b: lb[ord(i) - ord('a')] += 1\r\n for i in c: lc[ord(i) - ord('a')] += 1\r\n \r\n result = 0\r\n res_b = res_c = 0\r\n for i in range(10 ** 5):\r\n t = float(\"inf\")\r\n for j in range(26):\r\n if la[j] < lb[j] * i:\r\n t = -1\r\n break\r\n if lc[j]:\r\n t = min(t, (la[j] - lb[j] * i) // lc[j])\r\n if t < 0:\r\n break\r\n if i + t > result:\r\n res_b, res_c = i, t\r\n result = i + t\r\n \r\n result = b * res_b + c * res_c\r\n result += ''.join(chr(i + ord('a')) * (la[i] - lb[i] * res_b - lc[i] * res_c) for i in range(26))\r\n \r\n sys.stdout.write(''.join(result))\r\n \r\n \r\nmain()\r\n", "def get_profile(s):\r\n p = [0] * 26\r\n for c in s:\r\n p[ord(c) - ord('a')] += 1\r\n return p\r\n\r\ndef get_ans_one_str(a, b):\r\n return min(has // need for (has, need) in zip(a, b) if need > 0)\r\n\r\ndef get_ans_two_strs(a, b, c):\r\n left = list(a)\r\n b_count = 0\r\n res = None\r\n while True:\r\n c_count = get_ans_one_str(left, c)\r\n cur_res = (b_count + c_count, b_count, c_count)\r\n #print c_count, b_count\r\n if res is None or cur_res > res:\r\n res = cur_res\r\n\r\n for i, b_x in enumerate(b):\r\n left[i] -= b_x\r\n \r\n if min(left) < 0:\r\n break\r\n\r\n b_count += 1\r\n\r\n return res\r\n\r\n \r\ndef solve(a_s, b_s, c_s):\r\n a, b, c = map(get_profile, (a_s, b_s, c_s))\r\n ans, b_cnt, c_cnt = get_ans_two_strs(a, b, c)\r\n for i, b_x in enumerate(b):\r\n a[i] -= b_x * b_cnt\r\n\r\n for i, c_x in enumerate(c):\r\n a[i] -= c_x * c_cnt\r\n\r\n #print c_cnt, b_cnt\r\n return ''.join([b_s] * b_cnt + [c_s] * c_cnt + [chr(ord('a') + i) * c for (i, c) in enumerate(a)])\r\n\r\nprint(solve(*[input().strip() for i in range(3)]))\r\n \r\n", "\"\"\"\r\nCodeforces Contest 307 Div 2 Problem B\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.4.2\r\n\"\"\"\r\n\r\n################################################### SOLUTION\r\n\r\ndef main():\r\n a = read(0)\r\n b = read(0)\r\n c = read(0)\r\n s = [0]*26\r\n for i in a: s[ord(i)-97] += 1\r\n t = s[:]\r\n x = [0]*26\r\n for i in b: x[ord(i)-97] += 1\r\n y = [0]*26\r\n for i in c: y[ord(i)-97] += 1\r\n best = (0, 0)\r\n curr = 0\r\n while True:\r\n m = min((s[i]//y[i] if y[i] != 0 else 10**18) for i in range(26))\r\n if curr+m > best[0]: best = (curr+m, curr)\r\n flag = False\r\n for i in range(26):\r\n s[i] -= x[i]\r\n if s[i] < 0: flag = True\r\n curr += 1\r\n if flag: break\r\n for i in range(best[1]):\r\n write(b)\r\n for i in range(26): t[i] -= x[i]\r\n for i in range(best[0]-best[1]):\r\n write(c)\r\n for i in range(26): t[i] -= y[i]\r\n for i in range(26): write(chr(97+i)*t[i])\r\n\r\n\r\n\r\n\r\n#################################################### HELPERS\r\n\r\n\r\n\r\ndef read(mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0: return inputs\r\n if mode == 1: return inputs.split()\r\n if mode == 2: return list(map(int, inputs.split()))\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = \"\"\r\n if isinstance(s, list): s = \" \".join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\nwrite(main())", "import string\nfrom collections import defaultdict\nINF = 2147483647\n\nstring_a = input()\nstring_b = input()\nstring_c = input()\n\ndict_a = defaultdict(int)\ndict_b = defaultdict(int)\ndict_c = defaultdict(int)\n\nfor ch in string_a:\n dict_a[ch] += 1\nfor ch in string_b:\n dict_b[ch] += 1\nfor ch in string_c:\n dict_c[ch] += 1\n\nbn, cn = 0, 0\nfor i in range(100001):\n j = INF\n for ch in string.ascii_lowercase:\n a, b, c = dict_a[ch], dict_b[ch], dict_c[ch]\n a -= b*i\n if a < 0:\n j = -1\n if c != 0:\n j = min(j, int(a/c) )\n if j == -1:\n break\n if i+j > bn+cn:\n (bn, cn) = (i, j)\n\nres = \"\"\nfor i in range(bn):\n res += string_b\nfor i in range(cn):\n res += string_c\n\nfor ch in string.ascii_lowercase:\n a, b, c = dict_a[ch], dict_b[ch], dict_c[ch]\n a -= b*bn + c*cn\n res += ch*a\n\nprint(res)\n\n", "a=input()\nb=input()\nc=input()\nl1=[0 for x in range(26)]\nl2=[0 for x in range(26)]\nl3=[0 for x in range(26)]\nfor i in range(len(a)):\n l1[ord(a[i])-97]+=1\nfor i in range(len(b)):\n l2[ord(b[i])-97]+=1\nfor i in range(len(c)):\n l3[ord(c[i])-97]+=1\n\nsf=\"\"\nf1=0\nf2=0\nk=0\nlf=len(a)\nwhile(k<lf):\n df1=100000\n df2=100000\n d1=0\n d2=0\n for i in range(26):\n if(l2[i]>0):\n d1=l1[i]-l2[i]\n df1=min(d1,df1)\n if(l3[i]>0):\n d2=l1[i]-l3[i]\n df2=min(d2,df2)\n if d1<0:\n f1=1\n if d2<0:\n f2=1\n \n if(f1==1 and f2==1):\n while(k<lf):\n for m in range(26):\n if(l1[m]>0):\n sf=sf+chr(m+97)\n k+=1\n l1[m]-=1\n elif(df1>df2 and f1!=1):\n sf+=b\n for m in range(26):\n l1[m]=l1[m]-l2[m]\n k+=len(b)\n else:\n sf+=c\n for m in range(26):\n l1[m]=l1[m]-l3[m]\n k+=len(c)\nprint(sf)\n", "import string\r\ndef solve(A,B,C,n):\r\n m = float('inf')\r\n for i in string.ascii_lowercase:\r\n if A[i] < B[i]*n:\r\n return None\r\n A[i] -= B[i]*n\r\n for i in string.ascii_lowercase:\r\n if A[i] == 0 and C[i] != 0:\r\n return (n,n)\r\n if C[i] != 0:\r\n m = min(m,A[i]//C[i])\r\n m = int(m)\r\n return (m+n,n)\r\na=list(input())\r\nb=list(input())\r\nc=list(input())\r\ns=[]\r\nA,B,C = {},{},{}\r\nfor d in string.ascii_lowercase:\r\n A[d] = 0\r\n B[d] = 0\r\n C[d] = 0\r\nfor d in a:\r\n A[d] += 1\r\nfor d in b:\r\n B[d] += 1\r\nfor d in c:\r\n C[d] += 1\r\nanswer = (0,0)\r\nn = 0\r\nwhile True:\r\n m = solve(dict(A),dict(B),dict(C),n)\r\n if m is None:\r\n break\r\n answer = max(answer,m)\r\n n += 1\r\nfor i in string.ascii_lowercase:\r\n A[i] -= B[i]*answer[1]\r\nfor _ in range(answer[1]):\r\n s += b\r\nfor i in string.ascii_lowercase:\r\n A[i] -= C[i]*(answer[0]-answer[1])\r\nfor _ in range(answer[0]-answer[1]):\r\n s += c\r\nfor i in string.ascii_lowercase:\r\n s += [i]*A[i]\r\nprint(''.join(s))", "from collections import Counter\r\n\r\n\r\ndef can(c, s):\r\n cc = Counter(s)\r\n return (c & cc) == cc\r\n\r\n\r\ndef how(c, c1):\r\n m = None\r\n for k in c1.keys():\r\n q = 0\r\n if k in c:\r\n q = c[k] // c1[k]\r\n if q == 0:\r\n return 0\r\n if m is None or m > q:\r\n m = q\r\n\r\n return m\r\n\r\n\r\ndef diff(c, f, c1):\r\n r = c.copy()\r\n for k in c1:\r\n r[k] -= f * c1[k]\r\n return r\r\n\r\n\r\ndef count(k, s1, s2):\r\n c = Counter(k)\r\n c1 = Counter(s1)\r\n c2 = Counter(s2)\r\n\r\n m = 0\r\n a = 0\r\n b = 0\r\n for i in range(how(c, c1)):\r\n d = diff(c, i + 1, c1)\r\n q = how(d, c2)\r\n if i + q + 1 > m:\r\n a = i + 1\r\n b = q\r\n m = a + b\r\n\r\n return a, b\r\n\r\n\r\ndef build(k, s1, s2, a, b):\r\n c = Counter(k)\r\n c1 = Counter(s1)\r\n c2 = Counter(s2)\r\n\r\n s = s1 * a + s2 * b\r\n d = diff(c, a, c1)\r\n d = diff(d, b, c2)\r\n for k in d.keys():\r\n s += k * d[k]\r\n\r\n return s\r\n\r\n\r\nif __name__ == '__main__':\r\n k = input()\r\n s1 = input()\r\n s2 = input()\r\n\r\n a1, b1 = count(k, s1, s2)\r\n a2, b2 = count(k, s2, s1)\r\n if a1 + b1 > a2 + b2:\r\n print(build(k, s1, s2, a1, b1))\r\n else:\r\n print(build(k, s2, s1, a2, b2))" ]

[ "from collections import defaultdict\r\n#get the inputs, split and turn to int\r\nn,m=map(int,input().split())\r\ndef count(x):\r\n c=0\r\n while x > 0:\r\n c+=1\r\n x = x & (x - 1)\r\n return c\r\n \r\n#create a dictionary\r\ng=defaultdict(list)\r\n\r\n#run m times the number of times a user\r\nfor i in range(m):\r\n #get input for every friendship\r\n u, v = map(int,input().split())\r\n #decrease the number by 1\r\n u-=1;v-=1\r\n #add the connection in the list\r\n g[u].append(v)\r\n g[v].append(u)\r\n \r\n#set masks to 0\r\nmask1=0;mask2=0;MAX=(1<<n)-1\r\n#initialize array with 0\r\na=[0]*(1 << n)\r\n#initialize array with MAX\r\ndp=[MAX]*(1 << n)\r\n#if the number of pairs is the same as n * n-1 /2 \r\nif m == (n*(n-1))//2:\r\n print(0)\r\n exit(0)\r\n#\r\nfor i,j in g.items():\r\n mask1 = (1 << i);mask2=0;mask2 |= mask1\r\n for k in j:\r\n mask2 |= (1 << k)\r\n \r\n dp[mask2]=mask1\r\n a[mask1]=mask2\r\n \r\nfor i in range(0,(1 << n)-1):\r\n if dp[i] != MAX:\r\n #print('HEllo')\r\n temp = dp[i] ^ i \r\n for j in range(n):\r\n if temp & (1 << j) != 0:\r\n nmask = i | a[(1 << j)]\r\n dp[nmask]=dp[i] | (1 << j) if count(dp[i] | (1 << j)) < count(dp[nmask]) else dp[nmask]\r\n \r\nans = []\r\nfor i in range(n):\r\n if dp[-1] & (1 << i) != 0:\r\n ans.append(i+1)\r\nprint(len(ans))\r\nprint(*ans)", "from collections import defaultdict\r\ndef count(x):\r\n c=0\r\n while x > 0:\r\n c+=1\r\n x &= (x-1)\r\n return c\r\n \r\nn,m=map(int,input().split())\r\ng=defaultdict(list)\r\nfor _ in range(m):\r\n u, v = map(int,input().split())\r\n u-=1;v-=1\r\n g[u].append(v)\r\n g[v].append(u)\r\n \r\nmask1=0;mask2=0;MAX=(1<<n)-1\r\na=[0]*(1 << n)\r\ndp=[MAX]*(1 << n)\r\nif m == (n*(n-1))//2:\r\n print(0)\r\n exit(0)\r\nfor i,j in g.items():\r\n mask1 = (1 << i);mask2=0;mask2 |= mask1\r\n for k in j:\r\n mask2 |= (1 << k)\r\n \r\n dp[mask2]=mask1\r\n a[mask1]=mask2\r\n \r\nfor i in range(0,(1 << n)-1):\r\n if dp[i] != MAX:\r\n #print('HEllo')\r\n temp = dp[i] ^ i \r\n for j in range(n):\r\n if temp & (1 << j) != 0:\r\n nmask = i | a[(1 << j)]\r\n dp[nmask]=dp[i] | (1 << j) if count(dp[i] | (1 << j)) < count(dp[nmask]) else dp[nmask]\r\n \r\nans = []\r\nfor i in range(n):\r\n if dp[-1] & (1 << i) != 0:\r\n ans.append(i+1)\r\nprint(len(ans))\r\nprint(*ans)" ]

[ "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nh = [0] * 101 \r\nfor i in range(n):\r\n for j in range(101):\r\n if(a[i] >= h[j]):\r\n h[j] += 1 \r\n break\r\n\r\nc = 101 - h.count(0)\r\nprint(c)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ndp = [0]\r\nfor i in a:\r\n add = False\r\n for j in range(len(dp)):\r\n if(dp[j]<=i):\r\n dp[j]+=1\r\n add = True\r\n break\r\n if not add :\r\n dp.append(1)\r\nprint(len(dp))\r\n", "import math\n\n\nclass CodeforcesTask388ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.boxes = []\n\n def read_input(self):\n self.n = int(input())\n self.boxes = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n counts = [self.boxes.count(x) for x in range(max(self.boxes) + 1)]\n constraints = [math.ceil(sum(counts[0:x + 1]) / (x + 1)) for x in range(len(counts))]\n self.result = str(max(constraints))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask388ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def take_lightest_box(boxes):\n\n for i in range(101):\n if i in boxes:\n boxes[i] -= 1\n if boxes[i] == 0:\n del boxes[i]\n return i\n\n\npiles = []\n\n\nboxes = {}\n\ninput()\ntmp = input()\n\nx = [int(i) for i in tmp.split(\" \")]\n\nfor item in x:\n if item in boxes:\n boxes[item] = boxes[item] + 1\n else:\n boxes[item] = 1\n\nwhile len(boxes) > 0:\n lightest = take_lightest_box(boxes)\n\n for pile in piles:\n if len(pile) <= lightest:\n pile.append(lightest)\n break\n else:\n piles.append([lightest])\n\n\nprint(len(piles))\n\n\n", "n = int(input())\n\nnums = sorted(list(map(int, input().split(' '))))\n\nv = []\nb = [0] * 105\ncnt = 0\nk = 0\n\nwhile cnt < n:\n k += 1\n for i in range(n):\n if nums[i] >= len(v) and b[i] == 0:\n v.append(nums[i])\n b[i] = 1\n cnt += 1\n #print(list(reversed(v)))\n v = []\n\nprint(k)\n\n", "from collections import Counter as cs\r\nn=int(input())\r\nls=[int(a) for a in input().split()]\r\nls.sort()\r\nls1=dict(cs(ls))\r\nctr1,ctr2=1,0\r\nfor i in range(n):\r\n if ls1[ls[i]]:\r\n ls1[ls[i]]-=1\r\n for j in range(i,n):\r\n if i!=j and ls[j]>=ctr1 and ls1[ls[j]]:\r\n ctr1+=1\r\n ls1[ls[j]]-=1\r\n ctr2+=1\r\n ctr1=1\r\nprint(ctr2) ", "def validate_stack(stack):\r\n\tfor i in range(len(stack)):\r\n\t\tif stack[i] < len(stack)-i-1:\r\n\t\t\treturn False\r\n\treturn True\r\n# print(validate_stack([4,4,4,4,4]))\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tbox_strength = [int(x) for x in input().split()]\r\n\tbox_strength = sorted(box_strength, reverse = True)\r\n\r\n\tflag = True\r\n\tans = 100\r\n\tfor i in range(1,n+1):\r\n\t\tmatrix = [[] for x in range(i)]\r\n\t\tflag = True\r\n\t\tans = i\r\n\r\n\t\t# print(matrix)\r\n\t\tfor idx, j in enumerate(box_strength):\r\n\t\t\t# print(idx%i,j)\r\n\t\t\tmatrix[idx%i].append(j)\r\n\t\t\r\n\t\t# print(matrix)\r\n\t\t\r\n\t\tfor stack in matrix:\r\n\t\t\tif not validate_stack(stack):\r\n\t\t\t\tflag = False\r\n\t\t\t\tbreak\r\n\t\t\r\n\t\tif flag:\r\n\t\t\tbreak\r\n\t\r\n\tprint(ans)", "def go():\n n = int(input())\n a = [int(i) for i in input().split(' ')]\n a.sort()\n o = 1\n for i in range(n):\n if(a[i] < i // o):\n o += 1\n return o\n\nprint(go())\n", "\n\ndef check(a,x):\n\tfor i in range(len(a)):\n\t\tif a[i] < len(a) - i:\n\t\t\treturn False\n\treturn True\n\nn=int(input())\na=list(map(int,input().split()))\na=sorted(a)\n\npiles = []\n\nfor i in a:\n\tif len(piles) == 0:\n\t\tpiles.append([i])\n\telse:\n\t\tflg=1\n\t\tfor j in range(len(piles)):\n\t\t\tif len(piles[j])<=i:\n\t\t\t\tpiles[j].append(i)\n\t\t\t\tflg=0\n\t\t\t\tbreak\n\t\tif flg:\n\t\t\tpiles.append([i])\n\nprint(len(piles))\n\n\n\n", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import *\r\nfrom collections import deque\r\nfrom bisect import *\r\n\r\nn, a, ans, all = int(input()), sorted(arr_inp()), 0, []\r\nfor i in range(n):\r\n if not a[i]:\r\n ans += 1\r\n insort_right(all, 1)\r\n else:\r\n ix = bisect_right(all, a[i])\r\n if ix != len(all) and all[ix] == a[i]:\r\n all[ix] += 1\r\n elif ix:\r\n all[ix - 1] += 1\r\n else:\r\n insort_right(all, 1)\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort() \r\npiles=[]\r\nfor x in l: \r\n if x==0:\r\n piles.append(1)\r\n continue \r\n f=0 \r\n for i in range(len(piles)):\r\n if piles[i]<=x: \r\n piles[i]+=1 \r\n f=1 \r\n break \r\n if not f:\r\n piles.append(1)\r\nprint(len(piles))", "n = int(input())\r\na = [int(i) for i in input().split(' ')]\r\na.sort()\r\ns = 1\r\nfor i in range(n):\r\n if(a[i] < i // s):\r\n s += 1\r\nprint(s)", "n = int(input())\nboxes = list(map(int, input().split()))\ncont = 1\ni = 1\nboxes.sort()\nfor i in range(n):\n if(i//cont>boxes[i]):\n cont = cont + 1\n\nprint(cont)\n\t \t\t\t\t \t\t \t\t\t \t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nuni = {}\r\nfor elem in a:\r\n if elem not in uni:\r\n uni[elem]=1\r\n else:\r\n uni[elem]+=1\r\npiles = []\r\nwhile len(a)>0:\r\n box = a.pop(0)\r\n if len(piles)==0:\r\n piles.append([box])\r\n else:\r\n for i in range(len(piles)):\r\n temp = piles[i]\r\n if box>=len(temp):\r\n temp.append(box)\r\n piles[i] = temp\r\n break\r\n else:\r\n piles.append([box])\r\n#print(piles)\r\nprint(len(piles))", "# coding: utf-8\nn = int(input())\nans = 0\nli1 = [int(i) for i in input().split()]\nli2 = []\nwhile li1:\n li1.sort()\n n = len(li1)\n i = 0\n while i < n:\n if li1[i] < i:\n li2.append(li1[i])\n del(li1[i])\n n -= 1\n else:\n i += 1\n ans += 1\n li1 = li2\n li2 = []\nprint(ans)\n", "n=int(input())\nlistn=list(map(int, input().split()))\nlistn=sorted(listn)\n\ni=0\nres=0\nvis=[]\n\nwhile i<n:\n res+=1\n currPile=[]\n k=0\n while k<n:\n if listn[k]>=len(currPile) and not k in vis:\n i+=1; vis.append(k); currPile.append(1)\n k+=1\nprint(res)", "input();print(max([((ind+1)//(i+1)+((ind+1)%(i+1)!=0)) for ind,i in enumerate(sorted(map(int,input().split())))]))", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\nans=[]\r\nfor ele in arr:\r\n for i in range(len(ans)):\r\n if(ans[i]<=ele):\r\n ans[i]+=1\r\n break\r\n else:\r\n ans.append(1)\r\nprint(len(ans)) ", "#double underscore makes a class variable or a class method private\r\nmod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn = ii()\r\nl = il()\r\nvis=[0]*n\r\nl.sort()\r\nans=0\r\nwhile any(i == 0 for i in vis):\r\n cnt=0\r\n for i in range(n):\r\n if vis[i]==0 and l[i]>=cnt:\r\n cnt+=1\r\n vis[i]=1\r\n ans+=1\r\nprint(ans)", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\nvisited=[0]*n\r\ni=0\r\nres=0\r\nwhile i<n:\r\n if visited[i]==0:\r\n visited[i]=0\r\n j=i\r\n c=0\r\n while j<n:\r\n if a[j]>=c and visited[j]==0:\r\n visited[j]=1\r\n c += 1\r\n j+=1\r\n\r\n res+=1\r\n i += 1\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import deque\r\ndef getLine():\r\n return list(map(int,input().split()))\r\n\r\nn = int(input())\r\narr = getLine()\r\n\r\narr.sort()\r\n\r\nd = deque()\r\nd.append(arr[0])\r\nl = [d]\r\n\r\nfor i in range(1,len(arr)):\r\n found = False\r\n\r\n for d in l:\r\n if len(d) <= arr[i]:\r\n found=True\r\n d.append(arr[i])\r\n break\r\n\r\n if not found:\r\n d = deque()\r\n d.append(arr[i])\r\n l.append(d)\r\n\r\nprint(len(l))", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Fox_and_Box_Accumulation():\r\n n = inp()\r\n sequence = inlt()\r\n sequence_sorted = sorted(sequence)\r\n visited = [False]*n \r\n\r\n #print(sequence_sorted)\r\n piles = 0\r\n while visited.count(False) > 0:\r\n piles += 1 \r\n index_false = visited.index(False)\r\n #print(index)\r\n\r\n current_num_boxes = 1 \r\n visited[index_false] = True \r\n\r\n for pointer in range(index_false+1,n):\r\n if visited[pointer] == False and sequence_sorted[pointer] >= current_num_boxes:\r\n current_num_boxes += 1\r\n visited[pointer] = True \r\n #print(visited)\r\n \r\n print(piles)\r\n return\r\n\r\n\r\nFox_and_Box_Accumulation()", "n = int(input())\r\nx = sorted(list(map(int, input().split())))\r\na = [0] * n\r\nans = 0\r\nfor i in range(n):\r\n ok = False\r\n for j in range(ans):\r\n if x[i] >= a[j]:\r\n a[j] += 1\r\n ok = True\r\n break\r\n if ok == False:\r\n ans+=1\r\n a[ans - 1] = 1\r\nprint(ans)\r\n \r\n \r\n\r\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n = int(input())\r\n arr = get_ints_in_list()\r\n\r\n res = []\r\n for _ in range(0, 101):\r\n res.append(0)\r\n \r\n for i in range(0, n):\r\n res[arr[i]] += 1\r\n \r\n ans = 0\r\n # for i in range(0, 101):\r\n i = 0\r\n while i < 101:\r\n if res[i] > 0:\r\n ans += 1\r\n tmp = []\r\n for j in range(i, 101):\r\n while res[j] > 0 and len(tmp) <= j:\r\n res[j] -= 1\r\n tmp.append(j)\r\n i-= 1\r\n i += 1\r\n print(ans)\r\n\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n ans = 0\r\n while len(a) > 0:\r\n stop = [a[0]]\r\n indexes = [0]\r\n p = 1\r\n while p < len(a):\r\n if len(indexes) <= a[p]:\r\n stop.append(a[p])\r\n indexes.append(p)\r\n p += 1\r\n for i in range(len(indexes)-1, -1, -1):\r\n del a[indexes[i]]\r\n\r\n ans += 1\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n main()", "\r\nn = int(input())\r\narr = [int(i) for i in input().split(\" \")]\r\narr.sort()\r\n# print(arr)\r\nstack = []\r\n\r\nstack.append([arr[0], 1])\r\n\r\nfor i in range(1, len(arr)):\r\n # print(stack)\r\n capacity_of_box = arr[i]\r\n flag = 0\r\n for j in range(len(stack)):\r\n cap_top = stack[j][0]\r\n cap_size = stack[j][1]\r\n \r\n if cap_size <= capacity_of_box:\r\n stack[j][0] = min(cap_top, capacity_of_box-cap_size)\r\n stack[j][1] += 1\r\n flag = 1\r\n break\r\n \r\n if flag == 0:\r\n stack.append([arr[i], 1])\r\n\r\n# print(stack)\r\nprint(len(stack))\r\n \r\n ", "n = int(input())\r\nar = list(map(int,input().split(' ')))\r\nar.sort()\r\ns=[]\r\nfor i in ar:\r\n\ts.sort(reverse=True)\r\n\tfor j in range(len(s)):\r\n\t\tif i>=s[j]:\r\n\t\t\ts[j]+=1\r\n\t\t\tbreak\r\n\telse:\r\n\t\ts.append(1)\r\nprint(len(s))\r\n", "# from itertools import combinations\n# from bisect import bisect_left\nfrom collections import Counter\n\nI = lambda: list(map(int, input().split()))\nn, a = I(), I()\na.sort()\nh = [1]\nfor el in a[1:]:\n mn = min(h)\n if el >= mn:\n h[h.index(mn)] += 1\n else:\n h.append(1)\nprint(len(h))", "#from collections import deque\r\nn = map(int,input().split())\r\nx = sorted(list(map(int,input().split())))\r\n\r\npiles = 1\r\ncurrent = x.pop(0)\r\ncurrent_size = 1\r\nwhile x:\r\n for i,e in enumerate(x):\r\n if e >= current_size:\r\n current = e\r\n x.pop(i)\r\n current_size += 1\r\n break\r\n else:\r\n current = x[0]\r\n x.pop(0)\r\n current_size = 1\r\n piles += 1\r\nprint (piles)", "n = int(input())\r\nA = [int(a) for a in input().split()]\r\n\r\nA.sort()\r\npiles = 0\r\nfor i in range(n):\r\n if A[i] == -1:\r\n continue\r\n size = 1\r\n A[i] = -1\r\n for j in range(i + 1, n):\r\n if A[j] < size:\r\n continue\r\n elif A[j] > size:\r\n size += 1\r\n A[j] = -1\r\n elif A[j] == size and A[j] > 0:\r\n size += 1\r\n A[j] = -1\r\n else:\r\n size += 1\r\n A[j] = -1\r\n piles += 1 \r\nprint(piles)", "n = int(input())\r\nboxes = list(map(int, input().split()))\r\ncont = 1\r\ni = 1\r\nboxes.sort()\r\nfor i in range(n):\r\n if(i//cont>boxes[i]):\r\n cont = cont + 1\r\n\r\nprint(cont)", "# https://codeforces.com/problemset/problem/388/A\n\n# n = int(input())\n# arr = list(map(int, input().split()))\n# arr = sorted(arr, reverse=True)\n# i = 0\n# c = 0\n# while i < n - 1:\n# s = sum(arr[i + 1:])\n# j = n - 1\n# while s >= arr[i]:\n# print(i, j)\n# s -= arr[j]\n# j -= 1\n# i = j + 1\n# c += 1\n\n# print(c)\n\n\nn = int(input())\na = list(map(int, input().split()))\na = sorted(a)\nk = 0\nfor i in range(n):\n if k * (a[i] + 1) <= i:\n k += 1\nprint(k)\n", "import math\r\nn = int(input())\r\narr = [int(z) for z in input().split()]\r\n\r\narr.sort()\r\nr = 0\r\nfor i in range(n):\r\n e = arr[i]\r\n k = math.ceil((i+1) / (e+1))\r\n\r\n r = max(r, k)\r\n\r\nprint(r)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nfor k in range(1,n+1):\r\n i=0\r\n v=0\r\n ok=True\r\n while i<n:\r\n for j in range(i,min(i+k,n)):\r\n if arr[j]<v:\r\n ok=False\r\n break\r\n i+=k \r\n v+=1 \r\n if ok:\r\n print(k)\r\n exit()\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/388/A\n\nn = int(input())\nl_b = list(map(int, input().split()))\nl_b.sort()\np = 0\n\ns_d = list()\n\nwhile len(l_b) > 0:\n t = 0\n\n for i, b in enumerate(l_b):\n if b >= t:\n s_d.append(i)\n t += 1\n\n for i in s_d[::-1]:\n del l_b[i]\n\n s_d = list()\n\n p += 1\n\nprint(p)", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nres = 1\r\nfor i in range(n):\r\n if arr[i] < i // res:\r\n res += 1\r\nprint(res)\r\n", "def mi():\r\n return map(int, input().split())\r\n\r\n\r\ndef li():\r\n return list(mi())\r\n\r\n\r\nN = int(input())\r\n\r\nA = li()\r\n\r\nA.sort()\r\n\r\ncount = 0\r\n\r\nans = []\r\n\r\nfor i in range(len(A)):\r\n found = False\r\n for j in range(len(ans)):\r\n if len(ans[j]) <= A[i]:\r\n found = True\r\n ans[j].append(A[i])\r\n break\r\n if found == False:\r\n ans.append([A[i]])\r\n\r\nprint(len(ans))", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\npiles=[None]*100\r\nfor i in range(1,100):\r\n piles[i]=[]\r\npiles[0]=[l[0]]\r\ni=1\r\nfor j in range(1,n):\r\n flag=0\r\n for k in range(0,i):\r\n if l[j] >= len(piles[k]):\r\n piles[k].append(l[j])\r\n flag=1\r\n break\r\n if flag==0:\r\n piles[i]=[l[j]]\r\n i+=1\r\nprint(i)\r\n#print(piles[:i])", "input()\ns = []\nfor x in sorted(map(int, input().split())):\n if len(s) == 0:\n s.append(1)\n else:\n for i in range(len(s)):\n if x >= s[i]:\n s[i] += 1\n break\n else:\n s.append(1)\nprint(len(s))\n", "n = int(input())\n\nx = list(map(int, input().split()))\n\nx.sort()\n\n\np = [1]\n\nfor i in range(1, len(x)):\n m, idx = min((val, i) for i, val in enumerate(p))\n\n if x[i] >= m:\n p[idx] += 1\n\n else:\n p.append(1)\n\nprint(len(p))", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\narr.sort()\r\nfor i in range(1,n+1):\r\n temp=[]\r\n l=n-1\r\n for j in range(i):\r\n temp.append(arr[l])\r\n l-=1\r\n boo=True\r\n while(l>=0 and boo):\r\n boo=False\r\n for j in range(i):\r\n if temp[j]>0:\r\n boo=True\r\n temp[j]=min(temp[j]-1,arr[l])\r\n l-=1\r\n if l<0:\r\n print(i)\r\n break", "n = int(input())\n\na = [int(x) for x in input().split()]\na.sort()\nval = 0\nwhile len(a) > 0:\n count = 0\n i = 0\n while i < len(a):\n if a[i] >= count:\n a.pop(i)\n count += 1\n continue\n i += 1\n val += 1\nprint(val)\n\n", "def mlt(): return map(int, input().split())\r\n\r\n\r\nx = int(input())\r\ns = sorted([*mlt()])\r\nres = 0\r\nwhile len(s):\r\n tm = []\r\n cur = 0\r\n for n in s:\r\n if cur <= n:\r\n cur += 1\r\n else:\r\n tm.append(n)\r\n res += int(cur != 0)\r\n s = tm\r\nprint(res)\r\n", "n=int(input())\r\ns=[int(c) for c in input().split()]\r\ns.sort()\r\ns.reverse()\r\nans=1\r\ndef f(a):\r\n i=0\r\n b=True\r\n while i<len(a) and b:\r\n if a[i]<len(a)-i-1:\r\n b=False\r\n return b\r\n i+=1\r\n return b \r\nwhile True:\r\n p=[[] for i in range(ans)]\r\n i=0\r\n while i<n:\r\n p[i%ans].append(s[i])\r\n i+=1\r\n t=0\r\n for d in p:\r\n if f(d):\r\n t+=1\r\n if t==len(p):\r\n print(ans)\r\n break\r\n ans+=1\r\n \r\n \r\n \r\n \r\n", "def main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n #f.readline()\r\n #input()\r\n get = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n [n]=get()\r\n a=get()\r\n a.sort()\r\n p=[[]]\r\n p[0].append(a[0])\r\n for i in a[1:]:\r\n p=sorted(p,key = lambda x:len(x))\r\n p.reverse()\r\n found=False\r\n for j in p:\r\n if len(j)<=i:\r\n j.append(i)\r\n found=True\r\n break\r\n if found ==False:\r\n p.append([i])\r\n print(len(p))\r\n\r\n\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "def b(a, la, n):\r\n for i in range(n):\r\n b = a[i::n]\r\n ll = (la - i + n - 1) // n\r\n for j in range(ll):\r\n if b[j] < ll - j - 1:\r\n return False\r\n return True\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort(reverse = True)\r\nl, r = 1, n\r\nif b(a, n, l):\r\n print(l)\r\n exit()\r\nif b(a, n, r - 1) == False:\r\n print(r)\r\n exit()\r\nwhile l + 1 < r:\r\n h = (l + r) // 2\r\n q = b(a, n, h)\r\n if q:\r\n r = h\r\n else:\r\n l = h\r\nprint(r)", "import heapq\r\nn = int(input())\r\nboxes = sorted(list(map(int, input().split())))\r\npiles = [1]\r\n\r\nfor b in boxes[1:]:\r\n if piles[0] <= b:\r\n heapq.heappush(piles, heapq.heappop(piles)+1)\r\n else:\r\n heapq.heappush(piles, 1)\r\n\r\nprint(len(piles))", "import math\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\nk=0\r\nfor i in range(n):\r\n if k*(arr[i]+1)<=i:\r\n k+=1\r\nprint(k)", "\r\n\r\ndef solve():\r\n n = int(input())\r\n s = list(map(int, input().split()))\r\n\r\n stacks = [[] for _ in range(n)]\r\n for i in range(101):\r\n for val in s:\r\n if val == i:\r\n for idx, stack in enumerate(stacks):\r\n if val >= len(stack):\r\n stacks[idx].append(val)\r\n break\r\n \r\n return sum([True for stack in stacks if len(stack)])\r\n\r\ndef main():\r\n ret = solve()\r\n print(ret)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\nl = [int(x) for x in input().split()]\nl.sort()\nu = 0\na = 0 \nwhile(u<n):\n a+=1 \n c=0\n for i in range(n):\n if(l[i]>=c):\n c+=1\n u+=1\n l[i]= -1\nprint(a)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\n\r\nnu=0\r\nans=0\r\n\r\nmark=[]\r\nfor i in range(0,n):\r\n mark.append(0)\r\n\r\n\r\nfor i in range(0,n):\r\n fail=1\r\n nu=0\r\n for j in range(0,n):\r\n if mark[j] == 0:\r\n fail = 0\r\n if x[j] >= nu:\r\n nu+=1\r\n mark[j]=1\r\n if fail == 0:\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort()\r\nans = 1\r\n\r\nfor i in range(n):\r\n ans += int(i // ans > nums[i])\r\n\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nans=0\r\nwhile len(l)!=0:\r\n A=[] \r\n k=1 \r\n ans+=1\r\n for j in range(1,len(l)):\r\n if(l[j]!=0 and l[j]>=k):\r\n k+=1\r\n else:\r\n A.append(l[j])\r\n l=A \r\nprint(ans) \r\n \r\n \r\n \r\n \r\n \r\n ", "n,p=int(input()),0\r\na=sorted(map(int,input().split()))\r\nfor i in range(n):\r\n if p*(a[i]+1)<=i:p+=1\r\nprint(p)", "from math import ceil\r\nn = int(input())\r\nxs = list(map(int, input().split()))\r\nret = 1\r\nxs.sort()\r\nfor i in range(n):\r\n ret = max(ret, int(ceil((i+1)/(xs[i]+1))))\r\n\r\nprint(ret)", "import sys\nfrom math import *\nfrom collections import Counter\ninput=sys.stdin.readline\n\n# for _ in range(int(input())):\nn=int(input())\na=list(map(int,input().split()))\na.sort()\nans=0\nwhile a:\n ans+=1\n unv=[]\n count=0\n for i in a:\n if i>=count:\n count+=1\n else:\n unv.append(i)\n a=unv\nprint(ans)", "def fox(lst):\r\n result = 1\r\n for i in range(len(lst)):\r\n if lst[i] < i // result:\r\n result += 1\r\n return result\r\n\r\n\r\nn = int(input())\r\na = [int(j) for j in input().split()]\r\nprint(fox(sorted(a)))\r\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\n#from heapq import heapify, heappop, heappush\n\nli = lambda: list(map(int, input().split()))\nn = int(input())\nx = li()\nx.sort()\n\ndef solve(n, x, num_piles):\n \n piles = [x[-i] for i in range(1, num_piles+1)]\n\n for i in reversed(range(n-num_piles)):\n xi = x[i]\n\n best_pile = -1\n best_index = None\n for i, pile in enumerate(piles):\n if pile > best_pile and pile > 0:\n best_pile = pile\n best_index = i\n \n if best_index == None:\n return False\n else:\n piles[best_index] = min(xi, best_pile - 1)\n return True\n\nfor i in range(1, n):\n if solve(n, x, i):\n print(i)\n sys.exit()\n\nprint(n)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=1\r\nfor i in range(n):\r\n x=i//ans\r\n if a[i]<x:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nl = [*map(int,input().split())]\r\nl.sort()\r\nspen = 0\r\nans = 0\r\nwhile(spen < n):\r\n x = 0\r\n for i in range(n):\r\n if(l[i] >= x):\r\n x += 1\r\n spen += 1\r\n l[i] = -10**3\r\n ans += 1\r\nprint(ans)", "def check(mid , lis):\r\n pile=[10000000000]*mid\r\n c=0\r\n for i in range(n-1,-1,-1):\r\n pile[i%mid]=min(pile[i%mid]-1,lis[i])\r\n# print(pile,mid) \r\n if min(pile)<0:\r\n return 0\r\n else:\r\n return 1 \r\nn = int(input())\r\nlis = sorted(map(int,input().split()))\r\nl=1\r\nr=n\r\nwhile l<=r:\r\n mid = l + (r-l)//2\r\n# print(l,r,mid)\r\n if(check(mid,lis)):\r\n r = mid-1\r\n else:\r\n l = mid+1\r\nprint(l) \r\n", "n = int(input())\r\ntemparr = input()\r\ntemparr = temparr.split()\r\narr = []\r\nfor i in temparr:\r\n arr.append(int(i))\r\narr = sorted(arr)\r\nrevarr = arr[::-1]\r\nmins = len(arr)\r\nleft = 0\r\nright = mins\r\n#print(revarr)\r\nwhile left <= right:\r\n temp = []\r\n flag = 0 \r\n mid = (left + right ) // 2 \r\n nexts = 0 \r\n index = 0 \r\n for i in range(mid):\r\n temp.append( [revarr[i], 0, revarr[i] ] )\r\n index += 1 \r\n #print(temp)\r\n flag = 0\r\n newindex = -1 \r\n for i in range(index, n):\r\n flag = 0\r\n newindex += 1\r\n for k in range(mid):\r\n j = ( newindex + k ) % mid \r\n \r\n if temp[j][0] > temp[j][1] and revarr[i] < temp[j][0] and temp[j][2] >= 1:\r\n flag = 1 \r\n temp[j][0] = revarr[i]\r\n temp[j][1] = 0 \r\n temp[j][2] -= 1 \r\n elif temp[j][0] > temp[j][1] and revarr[i] == temp[j][0] and temp[j][2] >= 1:\r\n flag = 1 \r\n temp[j][1] += 1 \r\n temp[j][2] -= 1 \r\n #print(temp)\r\n if flag == 1:\r\n break\r\n #print(\"i \" + str(i) +\" flag \" + str(flag))\r\n if flag == 0 :\r\n break\r\n \r\n if flag == 0:\r\n left = mid + 1 \r\n else:\r\n mins = min(mid, mins)\r\n right = mid - 1 \r\nprint(mins)\r\n \r\n \r\n#[10, 2, 2, 1, 1, 1, 0, 0, 0]\r\n\r\n \r\n \r\n \r\n ", "import math\r\nfrom decimal import *\r\ngetcontext().prec=30\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nl=list()\r\nfor i in range(len(x)):\r\n added=0\r\n for j in range(len(l)):\r\n if x[i]>=len(l[j]):\r\n l[j].append(x[i])\r\n added=1\r\n break\r\n if not added:\r\n v=[x[i]]\r\n l.append(v)\r\nprint(len(l))", "t = []\r\nn = int(input())\r\na = sorted(list(map(int , input().split())))\r\nfor i in range(n):\r\n t = sorted(t)[::-1]\r\n flg = True;\r\n for j in range(len(t)):\r\n if(a[i] >= t[j]):\r\n t[j] += 1;flg = False;break\r\n if(flg):t.append(1)\r\nprint(len(t))\r\n", "def main(inp):\n n = int(inp())\n arr = split_inp_int(inp)\n c = Counter(arr)\n num_of_pile = 0\n box_built = 0\n while box_built < n:\n current_height = 0\n for i in range(101):\n while i >= current_height and i in c and c[i] > 0:\n c[i] -= 1\n box_built += 1\n current_height += 1\n num_of_pile += 1\n print(num_of_pile)\n\n\ndef split_inp_int(inp):\n return list(map(int, inp().split()))\n\n\ndef use_fast_io():\n import sys\n\n class InputStorage:\n def __init__(self, lines):\n lines.reverse()\n self.lines = lines\n\n def input_func(self):\n if self.lines:\n return self.lines.pop()\n else:\n return \"\"\n\n input_storage_obj = InputStorage(sys.stdin.readlines())\n return input_storage_obj.input_func\n\n\nfrom collections import Counter, defaultdict\nfrom functools import reduce\nimport operator\nimport math\n\n\ndef product(arr_):\n return reduce(operator.mul, arr_, 1)\n\nif __name__ == \"__main__\":\n\n main(use_fast_io())\n", "import collections, bisect\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nans = 0\r\nwhile arr:\r\n ans += 1\r\n k = 1\r\n arr.pop(0)\r\n while arr and k <= arr[-1]:\r\n j = bisect.bisect_left(arr, k)\r\n arr.pop(j)\r\n k += 1\r\nprint(ans)", "import sys\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(N, arr):\r\n pile_assigned = set()\r\n arr.sort()\r\n ans = 0\r\n\r\n while len(pile_assigned) < N:\r\n curr = 0\r\n for i, num in enumerate(arr):\r\n if i not in pile_assigned and num >= curr:\r\n pile_assigned.add(i)\r\n curr += 1\r\n\r\n ans += 1\r\n\r\n return ans\r\n\r\n\r\nN = read_int()\r\narr = read_numeric_list()\r\n\r\nprint(solve(N, arr))\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\r\nfrom itertools import permutations\r\nfrom collections import deque\r\n \r\n \r\ndef sin():\r\n\treturn int(sys.stdin.readline())\r\n \r\ndef array():\t\r\n\treturn list(map(int, sys.stdin.readline().strip().split()))\r\n \r\ndef two():\r\n\treturn map(int, sys.stdin.readline().strip().split())\r\n \r\ndef multiple():\r\n\treturn [int(x) for x in sys.stdin.readline().split()]\r\n \r\ndef string():\r\n\treturn sys.stdin.readline().strip()\r\n \r\ndef sqrt(x):\r\n\tlow , high = 0 , x\r\n\twhile low <= high:\r\n\t\tmid = (low + high) // 2\r\n\t\tif mid * mid <= x < (mid+1) * (mid+1):\r\n\t\t\treturn mid\r\n\t\telif x < mid * mid:\r\n\t\t\thigh = mid - 1\r\n\t\telse:\r\n\t\t\tlow = mid + 1\r\n \r\n \r\nn = sin()\r\narr = array()\r\n\r\nres = defaultdict(int)\r\n\r\narr.sort()\r\n\r\nx = 0\r\n\r\nfor i in arr:\r\n\tflag = 0\r\n\tfor k,v in res.items():\r\n\t\tif v <= i:\r\n\t\t\tflag = 1\r\n\t\t\tres[k] += 1\r\n\t\t\tbreak\r\n\r\n\tif not flag:\r\n\t\t#print(1 , x)\r\n\t\tres[x] = 1\r\n\t\tx += 1\r\n\r\nprint(len(res))\r\n\r\n", "def input_int_array():\r\n return [int(string) for string in input().split()]\r\n\r\n# input part\r\nn = input_int_array()[0]\r\nboxes = input_int_array()\r\ncounts = [0]*101\r\n\r\nfor hardess in boxes:\r\n counts[hardess] += 1\r\n\r\n# bingo\r\ncolumns = []\r\nfor hardness in range(0, 101) :\r\n if counts[hardness] <= 0 :\r\n continue\r\n \r\n for j in range(0, len(columns)) :\r\n while (len(columns[j]) <= hardness) & (counts[hardness] > 0) : \r\n counts[hardness] -= 1\r\n columns[j].append(hardness) \r\n \r\n while counts[hardness] > 0:\r\n columns.append([hardness])\r\n counts[hardness] -= 1\r\n while (len(columns[-1]) <= hardness) & (counts[hardness] > 0) : \r\n columns[-1].append(hardness) \r\n counts[hardness] -= 1\r\nprint(len(columns))", "# import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\n# t=int(input())\r\nt=1\r\nwhile t:\r\n\tt-=1\r\n\tn=int(input())\r\n\tl=list(map(int,input().split()))\r\n\tl.sort()\r\n\tans=1\r\n\tfor i in range(n):\r\n\t\tif(l[i]<i//ans):\r\n\t\t\tans+=1\r\n\tprint(ans)", "import bisect\nn = int(input())\nxi = list(sorted(map(int, input().split())))\ns = set(xi)\nli = []\nwhile len(xi) > 0:\n li.append([xi.pop(0)])\n i = 0\n while i < len(xi):\n if xi[i] >= len(li[-1]):\n li[-1].append(xi.pop(i))\n else:\n i += 1\n# print(li)\nprint(len(li))", "def isPossible(arr,pile):\r\n \r\n arr.sort(reverse=True)\r\n size = [10**18]*pile\r\n #print(arr)\r\n c = 0\r\n for item in arr:\r\n if size[c%pile] >= 1:\r\n size[c%pile] = min(size[c%pile]-1,item)\r\n else:\r\n return False\r\n c = c + 1 \r\n return True\r\n\r\nn = int(input())\r\narr = [int(num) for num in input().split(' ')]\r\nans = n\r\nwhile ans>=1:\r\n if isPossible(arr,ans) == True:\r\n res = ans\r\n else:\r\n break\r\n ans = ans - 1\r\nprint(res)\r\n", "n = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nl1.sort()\r\n\r\nans = 1\r\nfor i in range(n):\r\n\tif l1[i] < i // ans:\r\n\t\tans += 1\r\nprint(ans)", "input();x=sorted(map(int,input().split()));print(max([((ind+1)//(i+1)+((ind+1)%(i+1)!=0)) for ind,i in enumerate(x)]))", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nunq, ans, req = set(arr), 1, 0\r\nfor ele in unq:\r\n count = arr.count(ele)\r\n req += count\r\n if req//(ele+1) != req/(ele+1):\r\n ans = max(1 + req//(ele+1), ans)\r\n else:\r\n ans = max(req//(ele+1), ans)\r\nprint(ans)", "n = int(input())\r\n# n=9\r\nlst = sorted([int(x) for x in input().split()])\r\n# lst = sorted([0 ,1 ,0, 2, 0 ,1 ,1 ,2, 10])\r\npc = stc = j = f = 0\r\nwhile (lst):\r\n if f == 0:\r\n del lst[0]\r\n stc = f = 1\r\n else:\r\n f = 1\r\n if j >= len(lst):\r\n j = f = 0\r\n pc += 1\r\n elif lst[j] >= stc:\r\n del lst[j]\r\n stc += 1\r\n else:\r\n j += 1\r\nprint(pc + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nsm=1\r\nb=[0 for i in range(101)]\r\nfor i in range(n):\r\n b[a[i]]+=1\r\nx=[0]*n\r\nz=0\r\nzm=0\r\nfor i in range(101):\r\n while b[i]!=0:\r\n if x[z]>i:\r\n z+=1\r\n zm=max(zm,z)\r\n if x[z]<=i and b[i]>0:\r\n x[z]+=1\r\n b[i]-=1\r\n z=0\r\nprint(zm+1) \r\n ", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,input().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=sorted(lst())\r\n ans=0\r\n while 1:\r\n left=[]\r\n cap=0\r\n for v in a:\r\n if v>=cap:\r\n cap+=1\r\n else:left+=[v]\r\n a=left.copy()\r\n ans+=1\r\n if len(left)==0:break\r\n print(ans)", "def Acc(arr):\r\n arr.sort()\r\n arr_aux=[0 for i in range(len(arr))]\r\n i=0\r\n j=0\r\n while i<len(arr):\r\n if arr[i]>=arr_aux[j]:\r\n arr_aux[j]=arr_aux[j]+1\r\n i+=1\r\n j=0\r\n else:\r\n j+=1\r\n #print(arr_aux)\r\n valor_actual=len(arr)-arr_aux.count(0)\r\n print(valor_actual)\r\n return\r\n\r\n\r\nn=int(input())\r\narr = list(map(int, input().strip().split()))\r\nAcc(arr)", "a=int(input())\r\nz=list(map(int,input().split()))\r\nfrom bisect import *\r\nz.sort()\r\nindex=0\r\ncount=0\r\nwhile(len(z)):\r\n \r\n r=bisect_left(z,index)\r\n if(r==len(z)):\r\n count+=1\r\n index=0\r\n else:\r\n index+=1\r\n z.pop(r)\r\nprint(count+1)\r\n \r\n", "\r\nx = int(input())\r\ns = sorted([int(x) for x in input().split()])\r\nres = 0\r\nwhile len(s):\r\n tmp = []\r\n cur = 0\r\n for n in s:\r\n if cur <= n:\r\n cur += 1\r\n else:\r\n tmp.append(n)\r\n res += int(cur != 0)\r\n s = tmp\r\nprint(res)", "import collections, bisect, heapq\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nt = []\r\nfor a in arr:\r\n if not t or a < t[0]:\r\n heapq.heappush(t, 1)\r\n else:\r\n c = heapq.heappop(t)\r\n heapq.heappush(t, c + 1)\r\nprint(len(t))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nv = [True]*n\r\na.sort()\r\nans = 0\r\nprev = 0\r\ni = 0\r\ncnt = 0\r\nwhile(cnt<n):\r\n if a[i]>=prev and v[i]:\r\n cnt += 1\r\n v[i] = False\r\n prev += 1\r\n i += 1\r\n if i==n:\r\n i = 0\r\n prev = 0\r\n ans += 1\r\nif prev != 0:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nans=0\r\nwhile len(l):\r\n s=[]\r\n b=0\r\n for i in range(len(l)):\r\n if b<=l[i]:\r\n b=b+1\r\n # print(l[i],end=\" \")\r\n else:\r\n s.append(l[i])\r\n \r\n ans=ans+bool(b)\r\n l=s\r\nprint(ans)\r\n", "n = int(input())\n\nboxes = [int(item) for item in input().split(' ')]\n\nboxes.sort()\nstacks = 0\nwhile len(boxes):\n stacks += 1\n n_boxes = []\n current_weight = 0\n for box in boxes:\n if box >= current_weight:\n current_weight += 1\n else:\n n_boxes.append(box)\n\n boxes = n_boxes\n\nprint(stacks)\n", "def main():\r\n n = int(input())\r\n boxes = sorted(list(map(int, input().split())))\r\n remaining = []\r\n in_use = []\r\n ans = 0\r\n while boxes:\r\n for i in boxes:\r\n if len(in_use) <= i:\r\n in_use.append(i)\r\n else:\r\n remaining.append(i)\r\n ans += 1\r\n boxes = remaining\r\n remaining = []\r\n in_use = []\r\n print(ans)\r\n\r\n\r\nmain()", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nr = 0\r\n\r\nflags = [False]*n\r\n\r\na.sort()\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if(count==n):\r\n break\r\n r+=1\r\n last = -1\r\n \r\n for j in range(n):\r\n if(flags[j]):\r\n continue\r\n if(a[j]==last):\r\n continue\r\n flags[j] = True\r\n count+=1\r\n last+=1\r\n\r\nprint(r)", "import itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n x = list(map(int, input().split()))\r\n\r\n x.sort()\r\n stacks = [[x[0]]]\r\n\r\n for i in range(1, n):\r\n k = x[i]\r\n for j in stacks:\r\n if k >= len(j):\r\n j.append(k)\r\n break\r\n else:\r\n stacks.append([k])\r\n\r\n print(len(stacks))\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nst=0\r\na.sort()\r\nwhile len(a)!=0:\r\n wt=1;a[0]='a'\r\n for i in range(len(a)):\r\n if a[i]!='a' and a[i]>=wt:\r\n wt+=1;a[i]='a'\r\n for i in range(a.count('a')):\r\n a.remove('a')\r\n st+=1\r\nprint(st)\r\n", "from sys import stdin\r\nn=int(input())\r\na= list(map(int,stdin.readline().split()))\r\n\r\na.sort()\r\npiles=0\r\n\r\ni=0\r\nwhile len(a)>0:\r\n piles+=1\r\n boxes=1\r\n i=0\r\n del a[0]\r\n while i<len(a):\r\n if a[i]>=boxes:\r\n boxes+=1\r\n del a[i]\r\n else:\r\n i+=1\r\n \r\nprint(piles) \r\n", "from bisect import bisect_left\r\ninput()\r\ns = []\r\nfor i in sorted(map(int, input().split())):\r\n k = bisect_left(s, -i)\r\n if k == len(s): s.append(-1)\r\n else: s[k] -= 1\r\nprint(len(s))", "# array=[4,2,2,7,8,1,2,8,10]\r\n# i=0\r\n# j=0\r\n# requiredsum=8\r\n# n=9\r\n# currentsum=0\r\n# currentlength=0\r\n# minlength=99\r\n# while(j<n):\r\n# currentsum+=array[j]\r\n# if (currentsum>=requiredsum):\r\n# currentlength=j-i+1\r\n# minlength=min(minlength,currentlength)\r\n# currentsum-=array[i]\r\n# i+=1\r\n# j+=1\r\n# print(currentlength)\r\n#longest substring with atmost k different characters\r\n'''\r\ns=\"lauda\"\r\nk=3\r\nstart=0\r\ncontains={}\r\nmaxlen=0\r\nfor end in range(len(s)):\r\n if not s[end] in contains:\r\n contains[s[end]]=0\r\n contains[s[end]]+=1\r\n while(len(contains))>k:\r\n left=s[start]\r\n contains[left]-=1\r\n if contains[left]==0:\r\n del contains[left]\r\n start+=1\r\n maxlen=max(maxlen,end-start+1)\r\nprint(maxlen)\r\n'''\r\n##word wrap\r\nn = int(input())\r\nli = sorted([int(x) for x in input().split()])\r\nres = 1\r\n \r\nfor i in range(n):\r\n if (li[i] < i // res):\r\n res += 1\r\nprint(res)", "n = int(input())\r\nx = sorted([int(i) for i in input().split()])\r\ncnt = 0\r\npiles = []\r\n\r\nfor i in range(n):\r\n if x[i]!=-1:\r\n pile = [x[i]]\r\n counter = 1\r\n for j in range(i+1,n):\r\n if x[j]>=counter:\r\n pile.append(x[j])\r\n x[j] = -1\r\n counter+=1\r\n piles.append(pile)\r\n\r\nprint(len(piles))\r\n\r\n\r\n\r\n\r\n", "\n\nimport bisect\n\ndef main():\n n = int(input())\n x = [int(i) for i in input().split(' ')]\n\n x = sorted(x)\n\n boxes = []\n\n for s in x:\n if len(boxes)==0 or boxes[0]>s:\n boxes = [1]+boxes\n else:\n boxes[bisect.bisect_right(boxes,s)-1] += 1\n\n print(len(boxes))\n\nmain()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = sorted(map(int, input().split()))\r\nk = n\r\nc = 0\r\nwhile k:\r\n c += 1\r\n space = 0\r\n for i in range(n):\r\n if d[i] != -1:\r\n if d[i] >= space:\r\n space += 1\r\n d[i] = -1\r\n k -= 1\r\n if k == 0:\r\n break\r\nprint(c)", "from collections import Counter\r\ndef check(arr):\r\n l=len(arr)\r\n for i in range(len(arr)):\r\n if l-i-1>arr[i]:\r\n return False\r\n return True\r\ndef boredom(arr):\r\n arr=sorted(arr,reverse=True)\r\n for ans in range(1,len(arr)+1):\r\n d={}\r\n ind=0\r\n for i in arr:\r\n d[ind]=d.get(ind,[])+[i]\r\n ind+=1\r\n ind%=ans\r\n flag=False\r\n for i in d.keys():\r\n if check(d[i])==False:\r\n flag=True\r\n break\r\n if flag==False:\r\n return ans\r\n\r\n\r\na=input()\r\nlst=list(map(int,input().strip().split()))\r\nprint(boredom(lst))", "from math import inf as inf\r\nfrom math import *\r\nfrom collections import *\r\nimport sys\r\ninput=sys.stdin.readline\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n re=a[0]\r\n s=0\r\n for i in range(n):\r\n if(s*(a[i]+1)<=i):\r\n s+=1\r\n print(s)\r\n", "n = int( input() )\r\na = sorted( list( map( int, input().split() ) ) )\r\n\r\nused = [False]*(n+1)\r\n\r\nans = 0\r\n\r\nwhile True:\r\n\r\n pos = -1\r\n for i in range( n ):\r\n if used[i] == False:\r\n pos = i\r\n break\r\n if pos == -1:\r\n break\r\n\r\n ans += 1\r\n total = 1\r\n used[pos] = True\r\n\r\n for j in range( pos+1, n ):\r\n if used[j] == False and a[j] >= total:\r\n total += 1\r\n used[j] = True\r\n\r\n #print( used )\r\n\r\nprint( ans )\r\n", "n = input()\r\nh = [0]\r\nA = sorted(map(int, input().split()))\r\n\r\nfor x in A:\r\n if x < min(h):\r\n h += [1]\r\n else:\r\n h[h.index(min(h))]+=1\r\nprint(len(h))", "N = int(input())\na = list(map(int, input().split()))\na.sort()\n\nk = 1\nwhile True:\n for i in range(len(a)):\n if a[i] < (i//k):\n break\n else:\n print(k)\n break\n k += 1", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nk = 0\r\nfor i in range(n):\r\n if k * (a[i] + 1) <= i:\r\n k += 1\r\nprint(k)\r\n", "# DO NOT EDIT THIS\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque, defaultdict\r\nimport heapq\r\ndef counter(a):\r\n c = defaultdict(lambda : 0) # way faster than Counter\r\n for el in a:\r\n c[el] += 1\r\n return c\r\n\r\ndef inp(): return [int(k) for k in input().split()]\r\ndef si(): return int(input())\r\ndef st(): return input()\r\n\r\n# DO NOT EDIT ABOVE THIS\r\n\r\nn = si()\r\na = inp()\r\na.sort()\r\n\r\nt = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] != '':\r\n cur = 1\r\n a[i] = ''\r\n t += 1\r\n for j in range(i + 1, len(a)):\r\n if a[j] != '' and a[j] >= cur:\r\n cur += 1\r\n a[j] = ''\r\n\r\nprint(t)\r\n\r\n", "n = int(input())\na = list(map(int,input().split()))\na = sorted(a)\n\nsol = [0]\nfor i in range(n): \n added = False\n for j in range(len(sol)): \n if sol[j] <= a[i]: \n sol[j] += 1\n added = True\n break \n\n if not added: \n sol.append(1)\n\nprint(len(sol))\n", "import math\r\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nlst.sort()\r\npc=0\r\nstc=0\r\nj=0\r\nf=0\r\nwhile(len(lst)!=0):\r\n if f==0:\r\n del lst[0]\r\n stc=1\r\n f=1\r\n else:\r\n f=1\r\n if j>=len(lst):\r\n j=0\r\n f=0\r\n pc+=1\r\n elif lst[j]>=stc:\r\n del lst[j]\r\n stc+=1\r\n else:\r\n j+=1\r\n \r\nprint(pc+1)\r\n \r\n ", "n=int(input())\na=list(map(int,input().split()))\na.sort()\npiles=0\nfor i in range(n):\n\tif piles*(a[i]+1)<=i:\n\t\tpiles+=1\nprint(piles)\n", "n = input()\r\nh = [0]\r\narr = sorted(map(int, input().split()))\r\nfor x in arr:\r\n if x < min(h):\r\n h += [1]\r\n else:\r\n h[h.index(min(h))] += 1\r\nprint(len(h))\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___\r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort(reverse = True)\r\nvis = [False]*n\r\ncounter = 0\r\nans = 0\r\nwhile counter<n:\r\n ans+=1\r\n init = 0\r\n for i in range(n-1,-1,-1):\r\n if not vis[i] and arr[i]>=init:\r\n vis[i] = True\r\n counter+=1\r\n init+=1\r\nprint(ans)\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nimport math\r\nn=int(input())\r\nbox=[int(x) for x in input().split()]\r\nbox.sort()\r\nk=0\r\nfor i in range(n):\r\n if k*(box[i]+1)<=i:\r\n k+=1\r\nprint(k)\r\n", "def main():\n n = int(input())\n l = sorted(map(int, input().split()))\n res = 0\n while l:\n res += 1\n i, l1 = 0, []\n for x in l:\n if x < i:\n l1.append(x)\n else:\n i += 1\n l = l1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = sorted(map(int, input().split()), reverse=True)\r\n\r\ndef ok(cnt):\r\n stacks = [[] for _ in range(cnt)]\r\n for i, val in enumerate(a):\r\n stacks[i % cnt].append(val)\r\n for stack in stacks:\r\n for i, val in enumerate(stack):\r\n if val < len(stack) - i - 1:\r\n return False\r\n return True\r\n\r\nfor i in range(1, n + 1):\r\n if ok(i):\r\n print(i)\r\n exit()\r\nraise Exception", "n = int(input())\r\nl = list(map(int,input().split(' ')))\r\nl.sort()\r\n\r\nnb = 0\r\n\r\nfor i in range(n):\r\n if l[i] == -1 :\r\n continue\r\n h = 1\r\n nb += 1\r\n for j in range(i+1,n):\r\n if l[j]>=h:\r\n h+=1\r\n l[j] = -1\r\n\r\nprint(nb)", "n = int(input())\r\nl = list(map(int,input().split(' ')))\r\nl.sort()\r\n\r\npiles = 1\r\n\r\nfor i in range(n):\r\n if int(i/piles) > l[i]:\r\n piles+=1\r\nprint(piles)\r\n ", "n = int(input())\r\nx = sorted([int(i) for i in input().split()])\r\ncnt = 0\r\n\r\n\r\nfor i in range(n):\r\n if x[i]!=-1:\r\n counter = 1\r\n for j in range(i+1,n):\r\n if x[j]>=counter:\r\n x[j] = -1\r\n counter+=1\r\n cnt+=1\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n", "def clc(): \r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n arr = sorted(arr)\r\n vis = [False]*n\r\n summ = 0\r\n counter = 0\r\n pile = 0\r\n while counter!=n:\r\n summ = 0\r\n pile+=1\r\n for i in range(n):\r\n if not vis[i] and summ<=arr[i]:\r\n summ+=1\r\n vis[i] = True \r\n counter+=1\r\n #print(summ)\r\n print(pile)\r\n return True\r\ncc = clc()\r\n\r\nif not cc :\r\n print(0)\r\n ", "import heapq\r\nimport sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n=int(input())\r\n arr=[int(x) for x in input().split()]\r\n arr.sort()\r\n temp=[]\r\n for i in arr:\r\n f=False\r\n #print(temp)\r\n for k in range(len(temp)):\r\n if temp[k]<=i and i!=0:\r\n f=True\r\n temp[k]+=1\r\n break\r\n if f==False:\r\n temp.append(1)\r\n print(len(temp))\r\n #print(temp)\r\n ", "from collections import defaultdict, deque, Counter\nfrom functools import lru_cache, reduce \nfrom heapq import heappush, heappop, heapify\nfrom bisect import bisect_right, bisect_left\nfrom random import randint\nimport math\nimport operator\nimport sys\nfrom itertools import accumulate \n#sys.stdin = open(\"sleepy.in\", \"r\")\n#sys.stdout = open(\"sleepy.out\",\"w\")\n#input = sys.stdin.readline\n#print = sys.stdout.write\n \nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef can_carry(pile, count):\n for i in range(len(pile))[::-1]:\n if pile[i] < count:\n return False\n count += 1\n\n return True\n\ndef solution():\n _ = int(input())\n arr = list(map(int, input().split()))\n arr = list([[val] for val in sorted(arr, reverse=True)])\n # count\n count = 0\n while arr:\n cur = arr.pop()\n for i in range(len(arr))[::-1]:\n if can_carry(arr[i], len(cur)):\n arr[i].extend(cur)\n break\n else:\n count += 1\n\n return print(count)\n\n\n\n\ndef main():\n #test()\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \n#import sys\n#import threading\n#sys.setrecursionlimit(10**6)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n", "n, required, searched = int(input()), 0, []\r\nboxes = list(sorted([int(i) for i in input().split()]))\r\nwhile True:\r\n stack = 0\r\n for i in range(n):\r\n if i not in searched and boxes[i] >= stack:\r\n searched.append(i)\r\n stack += 1\r\n if stack:\r\n required += 1\r\n else:\r\n break\r\nprint(required)\r\n", "n = int(input())\r\nx = sorted(list(map(int, input().split())))\r\nans = 1\r\nfor i in range(n):\r\n if(x[i] < i//ans):\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nres = 0\r\nfor i in range(n):\r\n cnt = i+1\r\n lvl = a[i]+1\r\n res = max(res , (cnt+lvl-1)//lvl)\r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nl=l[::-1]\r\nl1=[0]*n\r\nk=0\r\nfor i in range(n) :\r\n if l1[i]!=1 :\r\n t=l[i]\r\n p=1\r\n r=0\r\n l1[i]==1\r\n V=[t]\r\n for j in range(n) :\r\n if l1[j]==0 and l[j]<t :\r\n t=l[j]\r\n l1[j]=1\r\n V.append(t)\r\n r=r+1\r\n for j in range(n-1,-1,-1) :\r\n if l1[j]!=1 :\r\n if l[j] in V :\r\n q=V.index(l[j])+1\r\n if len(V)-q+1<=l[j] :\r\n c=0\r\n s=-1\r\n u=len(V)-q+1\r\n for e in range(q-1,-1,-1) :\r\n if V[e]>=u+s :\r\n s=s+1\r\n else :\r\n c=1\r\n break\r\n if c==0 :\r\n l1[j]=1\r\n V=V[:q-1]+[l[j]]+V[q-1:]\r\n \r\n \r\n \r\n \r\n \r\n \r\n k=k+1\r\n \r\nprint(k)\r\n \r\n \r\n \r\n", "import sys\n#input=sys.stdin.buffer.readline\nt=1 \nmod=10**9+7\nfor __ in range(t):\n #a=[]\n n=int(input())\n #n,m=map(int,input().split())\n l=list(map(int,input().split()))\n l.sort()\n cnt=0\n maxi=0\n ans=0\n # print(l)\n while cnt<n:\n cnt1=0\n for i in range(n):\n if l[i]!=-1:\n if l[i]>=cnt1:\n cnt+=1\n cnt1+=1\n l[i]=-1\n #print(l) \n \n ans+=1\n print(ans)\n \t \t\t \t\t\t\t \t\t\t \t \t \t\t \t\t\t", "n = int(input())\na = sorted(map(int, input().split()))\nc = 0\nfor i in range(n):\n if (a[i]+1) * c <= i:\n c += 1\nprint(c)\n", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\npile,box=0,n\r\nvisited=[0]*n\r\nwhile box!=0:\r\n t=0\r\n for i in range(n):\r\n if l[i]>=t and visited[i]==0:\r\n visited[i]=1\r\n t+=1\r\n box-=1\r\n if t>0:\r\n pile+=1\r\nprint(pile)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ni=0\r\nv=[0]*n\r\nout=0\r\nwhile i<n:\r\n\tif v[i]==0:\r\n\t\tc=0\r\n\t\tj=i\r\n\t\twhile j<n:\r\n\t\t\tif l[j]>=c and v[j]==0:\r\n\t\t\t\tv[j]=1\r\n\t\t\t\tc+=1\r\n\t\t\tj+=1\r\n\t\tout+=1\r\n\ti+=1\r\nprint(out)", "input();print(1+max(x//-~f for x,f in enumerate(sorted(map(int,input().split())))))", "import collections\r\nimport math\r\nimport sys\r\nneed_two = 0\r\ndef main():\r\n n = int(input())\r\n a = sorted(list(map(int, input().split())))\r\n boxs = []\r\n for i in range(n):\r\n if a[i] == 0:\r\n boxs.append(1)\r\n else:\r\n flag = -1\r\n for j in range(len(boxs)):\r\n if boxs[j] <= a[i]:\r\n if flag == -1 or boxs[flag] < boxs[j]:\r\n flag = j\r\n if flag == -1:\r\n boxs.append(1)\r\n else:\r\n boxs[flag] += 1\r\n print(len(boxs))\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1 # int(input())\r\n while t > 0:\r\n main()\r\n t -= 1\r\n", "def insertIntoPile(piles, box):\n for pile in piles:\n if(len(pile) <= box):\n pile.append(box)\n return\n newPile = [box]\n piles.append(newPile)\n return\n\nn = int(input())\narr = list(map(int,input().split(' ')))\narr.sort()\npiles = []\nfor i in arr:\n insertIntoPile(piles,i)\n\nprint(len(piles))", "from collections import defaultdict\r\nd=defaultdict(lambda:0 )\r\n\r\nn=int(input())\r\nx=sorted(list(map(int,input().split())))\r\nxx=[[] for i in range(100)]\r\nind=0\r\n\r\nfor i in x:\r\n flag=False\r\n for j in range(ind+1):\r\n if d[j]<=i:\r\n if d[j]==0:\r\n ind+=1\r\n d[j]+=1\r\n flag=True\r\n break\r\n # if flag==False:\r\n # ind+=1\r\n # d[ind]+=1\r\n# print(dict(d))\r\nprint(ind)\r\n\r\n\r\n\r\n", "def possible(x,cap):\n\tcaps = [101 for _ in range(cap)]\n\n\tfor v in x:\n\t\ti = caps.index(max(caps))\n\t\tif caps[i]==0:\n\t\t\treturn False\n\t\tcaps[i] = min(caps[i]-1, v)\n\treturn True\n\ndef main():\n\tn = int(input())\n\tx = list(map(int, input().split()))\n\tx.sort(reverse=True)\n\n\tcnt = 1\n\tcap = 101\n\tfor v in x:\n\t\t#print(\"checking\",v)\n\t\tif cap==0:\n\t\t\t#print(\"out of cap!\",cnt)\n\t\t\tcap=101\n\t\t\tcnt+=1\n\t\tcap = min(cap-1, v)\n\t#print(\"best current:\",cnt)\n\n\tcnt2 = cnt-1\n\tfor cnt2 in range(cnt-1,0,-1):\n\t\t#print(\"Loop\",cnt2)\n\t\tif not possible(x,cnt2):\n\t\t\tbreak\n\tprint(cnt2+1)\n\nmain()", "n = int(input())\r\nnum_list = sorted(map(int, input().split()))\r\n\r\ntower_list = []\r\nfor i in num_list:\r\n for k in tower_list:\r\n if i >= len(k):\r\n k.append(i)\r\n break\r\n else:\r\n tower_list.append([i])\r\n\r\nprint(len(tower_list))\r\n", "n=int(input())\r\nli=list(map(int,input().split(\" \",n)[:n]))\r\nli.sort()\r\nans=1\r\nfor i in range(n):\r\n if li[i]< i//ans:\r\n ans+=1\r\nprint(ans)\r\n" ]

[ "from typing import Tuple, List\r\n\r\n\r\ndef parse_prices(s: str) -> List[str]:\r\n \"\"\"\r\n Парсинг всех прайсов из входных данных\r\n :param s: Входные данные, пример: 'a13.32b0.31c1.111.08'\r\n :return: Массив из price'ов, пример: ['13.32', '0.31', '1.111.08']\r\n \"\"\"\r\n\r\n s: str = ''.join(['a' if c.isalpha() else c for c in s])\r\n return [price for price in s.split('a') if price]\r\n\r\n\r\ndef str_to_tuple(s: str) -> Tuple[int, int]:\r\n \"\"\"\r\n :param s: Строчка вида '1.111.111.11'\r\n :return: Tuple из рублей и копеек, пример (1111111, 11)\r\n \"\"\"\r\n\r\n if '.' not in s:\r\n return int(s), 0\r\n splitted = s.split('.')\r\n if len(splitted[-1]) == 2:\r\n return int(''.join(splitted[:-1])), int(splitted[-1])\r\n return int(''.join(splitted)), 0\r\n\r\n\r\ndef tuple_to_str(rub_coin: Tuple[int, int]) -> str:\r\n \"\"\"\r\n :param rub_coin: Tuple из рублей и копеек, пример: (1111111, 11)\r\n :return: Строчку вида '1.111.111.11'\r\n \"\"\"\r\n\r\n reversed_rub_str = str(rub_coin[0])[::-1]\r\n razryadi = []\r\n for i in range(0, len(reversed_rub_str), 3):\r\n razryadi.append(reversed_rub_str[i: i + 3])\r\n rub_str_with_dots = '.'.join(razryadi)[::-1]\r\n\r\n cop_str = ''\r\n if rub_coin[1] != 0:\r\n if rub_coin[1] >= 10:\r\n cop_str = f'.{rub_coin[1]}'\r\n else:\r\n cop_str = f'.0{rub_coin[1]}'\r\n return f'{rub_str_with_dots}{cop_str}'\r\n\r\n\r\ndef rub_coin_normalization(rub_coin: Tuple[int, int]) -> Tuple[int, int]:\r\n \"\"\"\r\n :param rub_coin: Tuple из рублей и копеек, пример: (1111111, 1123)\r\n :return: Tuple из рублей и копеек, пример: (1111122, 23)\r\n \"\"\"\r\n\r\n return rub_coin[0] + rub_coin[1] // 100, rub_coin[1] % 100\r\n\r\n\r\ndef main():\r\n s = input()\r\n prices = parse_prices(s)\r\n prices = list(map(str_to_tuple, prices))\r\n total_price = sum(rub for rub, _ in prices), sum(cop for _, cop in prices)\r\n total_price = rub_coin_normalization(total_price)\r\n print(tuple_to_str(total_price))\r\n\r\n\r\nif __name__ == '__main__':\r\n # Тестируем функцию parse_prices\r\n assert parse_prices('chipsy48.32televizor12.390') == ['48.32', '12.390']\r\n assert parse_prices('a1b2c3.38') == ['1', '2', '3.38']\r\n assert parse_prices('aa0.01t0.03') == ['0.01', '0.03']\r\n\r\n # Тестируем функцию str_to_tuple\r\n assert str_to_tuple('1') == (1, 0)\r\n assert str_to_tuple('1.11') == (1, 11)\r\n assert str_to_tuple('1.111') == (1111, 0)\r\n assert str_to_tuple('1.111.11') == (1111, 11)\r\n assert str_to_tuple('1.111.111.11') == (1111111, 11)\r\n\r\n # Тестируем функцию rub_coin_normalization\r\n assert rub_coin_normalization((1, 11)) == (1, 11)\r\n assert rub_coin_normalization((1, 123)) == (2, 23)\r\n assert rub_coin_normalization((1, 0)) == (1, 0)\r\n assert rub_coin_normalization((111, 1199)) == (122, 99)\r\n\r\n # Тестируем функцию tuple_to_str\r\n assert tuple_to_str((1, 0)) == '1'\r\n assert tuple_to_str((111, 0)) == '111'\r\n assert tuple_to_str((1111, 0)) == '1.111'\r\n assert tuple_to_str((1111, 11)) == '1.111.11'\r\n assert tuple_to_str((1111111, 11)) == '1.111.111.11'\r\n\r\n main()\r\n", "import sys\r\nimport string\r\nimport re\r\n\r\n\r\ndef read_input(input_path=None):\r\n if input_path is None:\r\n f = sys.stdin\r\n else:\r\n f = open(input_path, 'r')\r\n\r\n return [f.readline().rstrip()]\r\n\r\n\r\ndef conv2value(text):\r\n sub_text = text.split('.')\r\n value = 0\r\n if len(sub_text) > 1 and len(sub_text[-1]) == 2:\r\n value += int(sub_text[-1])\r\n sub_text = sub_text[:-1]\r\n if len(sub_text) > 0:\r\n value += int(''.join(sub_text)) * 100\r\n return value\r\n\r\n\r\ndef conv2string(value):\r\n penny = value % 100\r\n if penny > 0:\r\n return f\"{value//100:,}\".replace(',', '.') + f\".{penny:02d}\"\r\n return f\"{value//100:,}\".replace(',', '.')\r\n\r\n\r\ndef sol(s):\r\n notes = re.findall(r\"[abcdefghijklmnopqrstuvwxyz]+\", s)\r\n amounts = re.findall(r\"[0-9.]+\", s)\r\n\r\n total = conv2string(sum([conv2value(i) for i in amounts]))\r\n\r\n # res = list()\r\n # for note, amount in zip(notes, amounts):\r\n # res.append(f\"{note} {conv2string(conv2value(amount))}\")\r\n # res.append(f\"total {total}\")\r\n\r\n return [total]\r\n\r\n\r\ndef solve(input_path=None):\r\n return sol(*read_input(input_path))\r\n\r\n\r\ndef main():\r\n for line in sol(*read_input()):\r\n print(f\"{line}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n # print(f\"{1:02d}\")\r\n # solve('/home/khoaipx/data/testcenter/ai_intern/input_10.txt')\r\n", "def get_prices(s):\r\n s = list(s)\r\n for i, c in enumerate(s):\r\n if c.isalpha():\r\n s[i] = 'a'\r\n return [x for x in ''.join(s).split('a') if x]\r\n\r\n\r\ndef prices_sum(prices):\r\n rub = 0\r\n cop = 0\r\n for price in prices:\r\n if '.' in price:\r\n splited = price.split('.')\r\n if len(splited[-1]) == 2:\r\n cop += int(splited[-1])\r\n splited = splited[:-1]\r\n rub += int(''.join(splited))\r\n else:\r\n rub += int(price)\r\n rub += cop // 100\r\n cop %= 100\r\n return rub, cop\r\n\r\n\r\ndef format_rub_cop(rub, cop):\r\n cop_str = ''\r\n if cop != 0:\r\n cop_str = '.' + '0' * (2 - len(str(cop))) + str(cop)\r\n rrub = str(rub)[::-1]\r\n ransrub = ''\r\n for i in range(0, len(rrub), 3):\r\n ransrub += rrub[i:i+3] + '.'\r\n if ransrub[-1] == '.':\r\n ransrub = ransrub[:-1]\r\n return f'{ransrub[::-1]}{cop_str}'\r\n\r\n\r\ndef main():\r\n s = input()\r\n prices = get_prices(s)\r\n rub, cop = prices_sum(prices)\r\n print(format_rub_cop(rub, cop))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import re\n\ns = input()\nnumbers = re.findall(r'[0-9.]+', s)\ncents = 0\nfor i in range(len(numbers)):\n num = numbers[i]\n if len(num) > 2 and num[-3] == '.':\n cents += int(num[-2:])\n numbers[i] = num[:-3]\n numbers[i] = numbers[i].replace('.', '')\n\nres = sum(map(int, numbers))\nres += cents // 100\ncents %= 100\nprint(f'{res:,.0f}'.replace(',', '.'), end='')\nif cents:\n print(f'.{str(cents).zfill(2)}')\nelse:\n print()", "def parse_numbers(s):\n res = []\n cur_number = \"\"\n for char in s:\n if char in list(\"0123456789.\"):\n cur_number += char\n else:\n if cur_number:\n res.append(cur_number)\n cur_number = \"\"\n if cur_number:\n res.append(cur_number)\n return res\n\n\ns = input()\n\nl = parse_numbers(s)\n# print(l)\n\n\ndef convert_number(i):\n # print(i)\n if len(i) > 2 and i[-3] == \".\":\n dollar = i[:-3]\n #  Remove .\n dollar = dollar.replace(\".\", \"\")\n res = float(dollar + i[-3:])\n else:\n i = i.replace(\".\", \"\")\n # print(\"i replaced :\", i)\n res = int(i)\n return res\n\n\nn = [convert_number(i) for i in l]\n# print(n)\n\n# def do_sum(n):\n# \"\"\"\n# NEeded to do own sum because of float adding together leading to imprecisions,\n# i.e. .79 would become .7899999996\n\n# s = do_sum(n)\ns = sum(n)\n# print(s)\nif len(str(s)) > 2:\n s = \"{:.2f}\".format(s)\n # print(s)\n# print(s)\n\n\ndef print_res(s):\n res = \"\"\n count = 0\n for char in reversed(s):\n res = char + res\n count += 1\n if char == \".\":\n count = 0\n if count == 3:\n res = \".\" + res\n count = 0\n\n if res[-2:] == \".0\":\n res = res[:-2]\n elif res[-3:] == \".00\":\n res = res[:-3]\n if res[0] == \".\":\n res = res[1:]\n return res\n\n\nres = print_res(s)\nprint(res)\n" ]

[ "from collections import deque\r\n\r\nn, m, k = map(int, input().split())\r\nif k % 2 != 0:\r\n print(\"IMPOSSIBLE\")\r\n exit()\r\ngrid = [[] for _ in range(n)]\r\nsr, sc = -1, -1 # starting row and column\r\nfor r in range(n):\r\n grid[r] = input()\r\n c = grid[r].find('X')\r\n if c != -1:\r\n sr, sc = r, c\r\n\r\n# D L R U\r\ndirections = {'D' : [1, 0], 'L' : [0, -1], 'R' : [0, 1], 'U' : [-1, 0]}\r\nq = deque()\r\nvisited = set()\r\nd = [[None for _ in range(m)] for _ in range(n)] # array of path lengths\r\n\r\nq.append((sr, sc))\r\nvisited.add((sr, sc))\r\nd[sr][sc] = 0\r\n\r\nwhile q:\r\n r, c = q.popleft()\r\n for dr, dc in directions.values():\r\n i, j = r + dr, c + dc\r\n if (i in range(n) and\r\n j in range(m) and\r\n grid[i][j] == '.' and\r\n (i, j) not in visited):\r\n visited.add((i, j))\r\n q.append((i, j))\r\n d[i][j] = d[r][c] + 1\r\n\r\nans = []\r\nr, c = sr, sc\r\nfor step in range(k):\r\n for key, val in directions.items():\r\n i, j = r + val[0], c + val[1]\r\n if (i in range(n) and\r\n j in range(m) and\r\n grid[i][j] != '*' and\r\n d[i][j] <= k - step):\r\n r, c = i, j\r\n ans.append(key)\r\n break\r\n\r\nif len(ans) != k:\r\n print(\"IMPOSSIBLE\")\r\nelse:\r\n print(''.join(ans))", "from collections import deque\r\nn, m, k = map(int, input().split())\r\ng = [input() for _ in range(n)]\r\ndists = [[float('inf')] * m for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == 'X':\r\n start, end = i, j\r\ndists[start][end] = 0\r\nres = []\r\ndirect = ['D', 'L', 'R', 'U']\r\ndirects = [(1, 0), (0, -1), (0, 1), (-1, 0)]\r\nq = deque()\r\nq.append((start, end))\r\ndef bfs():\r\n while q:\r\n a, b = q.popleft()\r\n for l, r in directs:\r\n x, y = a + l, b + r\r\n if 0 <= x < n and 0 <= y < m and g[x][y] != '*' and dists[x][y] > dists[a][b] + 1:\r\n dists[x][y] = dists[a][b] + 1\r\n q.append((x, y))\r\n x, y = start, end\r\n for i in range(k // 2):\r\n for i in range(4):\r\n a, b = x + directs[i][0], y + directs[i][1]\r\n if 0 <= a < n and 0 <= b < m and g[a][b] != '*':\r\n res.append(direct[i])\r\n x, y = a, b\r\n break\r\n else:\r\n print('IMPOSSIBLE')\r\n return\r\n dist = k // 2\r\n for i in range(k // 2):\r\n for i in range(4):\r\n a, b = x + directs[i][0], y + directs[i][1]\r\n if 0 <= a < n and 0 <= b < m and g[a][b] != '*' and dists[a][b] <= dist:\r\n dist -= 1\r\n res.append(direct[i])\r\n x, y = a, b\r\n break\r\n print(''.join(map(str, res)))\r\nif k & 1:\r\n print('IMPOSSIBLE')\r\nelse:\r\n bfs()\r\n\r\n \r\n \r\nimport math\r\nfrom collections import deque\r\n \r\ndef main():\r\n\tn, m, k = list(map(int, input().split()))\r\n\tgrid = [\"\" for _ in range(n)]\r\n\tx, y = 0, 0\r\n \r\n\tfor i in range(n):\r\n\t\tgrid[i] = input()\r\n\t\tif 'X' in grid[i]:\r\n\t\t\tx, y = i, grid[i].index('X')\r\n \r\n\tif k % 2 == 1:\r\n\t\tprint(\"IMPOSSIBLE\")\r\n\t\treturn\r\n \r\n\tdx = [1, 0, 0, -1]\t\r\n\tdy = [0, -1, 1, 0]\r\n\tnames = {(x1, y1): sym for x1, y1, sym in zip(dx, dy, \"DLRU\")}\r\n \r\n\tdef ok(x, y):\r\n\t\treturn (0 <= x < n) and (0 <= y < m) and grid[x][y] != '*'\r\n\t\r\n \r\n\tdef bfs(x, y):\r\n\t\tMAX_DIST = (1 << 20)\r\n\t\tdist = [[MAX_DIST for y in range(m)] for x in range(n)]\r\n\t\tdist[x][y] = 0\r\n\t\tq = deque()\r\n\t\tq.append((x, y))\r\n \r\n\t\twhile len(q) > 0:\r\n\t\t\tx, y = q.popleft()\r\n \r\n\t\t\tfor x0, y0 in zip(dx, dy):\r\n\t\t\t\tif ok(x + x0, y + y0) and dist[x][y] + 1 < dist[x + x0][y + y0]:\r\n\t\t\t\t\tdist[x + x0][y + y0] = dist[x][y] + 1\r\n\t\t\t\t\tq.append((x + x0, y + y0))\t\t\r\n \r\n\t\treturn dist\t\t\t\r\n \r\n\tpath = []\r\n\tx_start, y_start = x, y\r\n \r\n\tdist = bfs(x_start, y_start)\r\n \r\n\tfor i in range(k // 2):\r\n\t\tfor x1, y1 in zip(dx, dy):\r\n\t\t\tif ok(x + x1, y + y1):\r\n\t\t\t\tpath.append(names.get((x1, y1)))\t\r\n\t\t\t\tx += x1\r\n\t\t\t\ty += y1\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(\"IMPOSSIBLE\")\r\n\t\t\treturn\r\n \r\n\tmoves = k // 2\t\t\r\n\tfor i in range(k // 2):\r\n\t\tfor x1, y1 in zip(dx, dy):\r\n\t\t\tif ok(x + x1, y + y1) and dist[x + x1][y + y1] <= moves:\r\n\t\t\t\tpath.append(names.get((x1, y1)))\r\n\t\t\t\tx += x1\r\n\t\t\t\ty += y1\r\n\t\t\t\tmoves -= 1\r\n\t\t\t\tbreak\r\n \r\n\tprint(\"\".join(x for x in path))\r\n \r\n# if __name__ == '__main__':\r\n# \tmain()" ]

[ "import math as ma\r\nimport sys\r\ninput=sys.stdin.readline\r\n\r\ndef fu(b):\r\n for i in b:\r\n if b[i]!=0:\r\n return i\r\n return -1\r\n\r\ndef gcd(a,b):\r\n if a%b==0:\r\n return b\r\n else:\r\n return gcd(b,a%b)\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nb={}\r\nfor i in range(n*n):\r\n if a[i] in b.keys():\r\n b[a[i]]+=1\r\n else:\r\n b[a[i]]=1\r\nc=[]\r\nfor i in b:\r\n c.append(i)\r\n b[i]-=1\r\n break\r\nwhile 1>0:\r\n if len(c)<n:\r\n a=fu(b)\r\n if a==-1:\r\n break\r\n else:\r\n b[a]-=1\r\n for i in range(len(c)):\r\n b[gcd(a,c[i])]-=2\r\n c.append(a)\r\n else:\r\n break\r\n\r\nprint(*c)", "\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)[::-1]\r\n# print(l)\r\n\r\n\r\n\r\n\r\ndef gcd(a,b):\r\n if a<b:\r\n a,b=b,a \r\n \r\n if b==0:\r\n return a \r\n return gcd(b,a%b)\r\n \r\n\r\nans=[]\r\nd={}\r\ni=1 \r\nfor x in l:\r\n if x in d:\r\n d[x]-=1 \r\n if d[x]==0:\r\n del d[x]\r\n else:\r\n for i in ans:\r\n p=gcd(i,x)\r\n if p in d:\r\n d[p]+=2 \r\n else:\r\n d[p]=2\r\n ans.append(x)\r\n\r\nprint(*ans)\r\n ", "import math\r\nfrom collections import Counter\r\n\r\nn=int(input())\r\ncount_=Counter(map(int,input().split()))\r\n\r\nans=[]\r\nfor i in range(n):\r\n big = max(count_)\r\n count_[big]-=1\r\n for other in ans:\r\n a=math.gcd(other,big)#;b= math.gcd(other,big)\r\n count_[a]-=2\r\n ans.append(big)\r\n count_+=Counter()\r\n #print(count_)\r\nprint(*ans)#,count_)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn = int(input())\r\nls = sorted(map(int, input().split()), reverse=True)\r\nimport collections\r\nfrom math import gcd\r\nd = collections.defaultdict(int)\r\nans = []\r\n#print(ls)\r\nfor j in range(n * n):\r\n if d[ls[j]]:\r\n d[ls[j]] -= 1\r\n else:\r\n for k in ans:\r\n d[gcd(k, ls[j])] += 2\r\n ans.append(ls[j])\r\nprint(' '.join(map(str, ans)))", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nfrom pprint import pprint as pprint\n\nimport re\nimport math\n\nfrom fractions import gcd\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\n\n\nN = int(input())\nIn = sorted(inputarray())\ntop = len(In) - 1\n\nA = Counter(In)\nres = [None]*N\n\nfor i in range(N):\n while A[In[top]] == 0:\n top = top - 1\n\n res[i] = In[top]\n\n for j in range(i):\n gcdv = gcd(res[i], res[j])\n A[gcdv] = A[gcdv] - 2\n\n gcdv = gcd(res[i], res[i])\n A[gcdv] = A[gcdv] - 1\n\nprint(' '.join(map(str, res)))\n", "def GCD(a,b):\r\n return a if b == 0 else GCD(b,a%b)\r\n \r\nn = int(input())\r\ng = list(map(int,input().split()))\r\ng.sort()\r\nc = {}\r\nfor i in range(n*n):\r\n if g[i] in c:\r\n c[g[i]] +=1 \r\n else:\r\n c[g[i]] = 1 \r\nans = []\r\nfor i in range(n*n-1,-1,-1):\r\n if c[g[i]] == 0 :\r\n continue\r\n c[g[i]] -= 1 \r\n for j in range(len(ans)):\r\n t = GCD(ans[j],g[i])\r\n c[t] -= 2 \r\n ans.append(g[i])\r\nfor value in ans:\r\n print(value,end=\" \")\r\nprint()", "from collections import Counter\r\nfrom fractions import gcd\r\ninput()\r\ng, v = Counter(map(int, input().split())), []\r\nwhile g:\r\n x = max(g)\r\n g[x] -= 1\r\n for y in v:\r\n g[gcd(x, y)] -= 2\r\n v.append(x)\r\n g += Counter()\r\nprint(' '.join(map(str, v)))", "import sys\n\n\n#sys.stdin = open(\"input.txt\")\n#sys.stdout = open(\"output.txt\", \"w\")\n\nn = int(input())\nlst = [int(i) for i in input().split()]\n\nlst.sort(reverse = True)\n\nans = []\n\n#print(lst)\nind = 0\n\nfound = {}\n\ndef gcd(a, b):\n\tif a < b:\n\t\ta, b = b, a\n\tif b == 0:\n\t\treturn a\n\treturn gcd(b, a % b)\n\nwhile len(ans) < n:\n\tnumber = lst[ind]\n\t\n\t#print(\"ind=\", ind, \"number=\", number)\n\t#print(found)\n\tif number in found:\n\t\tfound[number] -= 1\n\t\tif found[number] == 0:\n\t\t\tfound.pop(number)\n\telse:\n\t\tfor x in ans:\n\t\t\tcurgcd = gcd(x, number)\n\t\t\t#print(curgcd)\n\t\t\tif curgcd in found:\n\t\t\t\tfound[curgcd] += 2\n\t\t\telse:\n\t\t\t\tfound[curgcd] = 2\n\n\t\tans.append(number)\n\t#print(\"ans:\", ans)\n\t#print(found)\n\n\tind += 1\n\nfor x in ans:\n\tprint(x, end = ' ')\nprint()", "import sys\r\ninput=sys.stdin.readline\r\nfrom math import gcd\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nans=[0]*n\r\ncnt={}\r\nfor xx in x:\r\n cnt[xx]=cnt.get(xx,0)+1\r\n\r\nfor i in range(n):\r\n v=max(cnt.keys())\r\n ans[i]=v\r\n cnt[v]-=1\r\n if cnt[v]==0:\r\n del cnt[v]\r\n if i==0:\r\n continue\r\n for j in range(i):\r\n g=gcd(ans[i],ans[j])\r\n cnt[g]-=2\r\n if cnt[g]==0:\r\n del cnt[g]\r\nprint(*ans)", "import collections\r\nimport fractions\r\n\r\nn = int(input())\r\nG = list(map(int, input().split()))\r\n\r\ndef solve(n, G):\r\n G.sort()\r\n gc = collections.Counter(G)\r\n As = []\r\n for i in range(n):\r\n ai = G.pop()\r\n while gc[ai] == 0:\r\n ai = G.pop()\r\n gc[ai] -= 1\r\n for aj in As:\r\n gcdij = fractions.gcd(ai, aj)\r\n gc[gcdij] -= 2\r\n As.append(ai)\r\n return As\r\n\r\nprint(*solve(n, G))", "from fractions import gcd\nfrom random import randint, shuffle\nfrom collections import Counter\n\n\ndef read_numbers():\n return list(map(int, input().split()))\n\n\ndef get_original_array(n, numbers):\n cnt = Counter(numbers)\n\n array = []\n for new_number in sorted(numbers, reverse=True):\n if cnt[new_number]:\n cnt[new_number] -= 1\n for number in array:\n table_entry = gcd(new_number, number)\n cnt[table_entry] -= 2\n array.append(new_number)\n assert cnt.most_common()[0][1] == 0\n return array\n\n\ndef test(n):\n print(n)\n array = [randint(0, 10**9) for _ in range(n)]\n table = [gcd(a, b) for a in array for b in array]\n shuffle(table)\n print(sorted(array) == sorted(get_original_array(n, table)))\n\nif __name__ == '__main__':\n# n = 4\n# numbers = [2, 1, 2, 3, 4, 3, 2, 6, 1, 1, 2, 2, 1, 2, 3, 2]\n# print(get_original_array(n, numbers))\n# test(10)\n# test(100)\n# test(200)\n# test(300)\n# test(400)\n# test(500)\n#else:\n n = int(input())\n numbers = read_numbers()\n print(' '.join(map(str, get_original_array(n, numbers))))\n", "from math import gcd\r\nn = int(input())\r\na = list(map(int,input().split()))\r\na = sorted(a, reverse = True)\r\nans = [] \r\nd = {} \r\nfor j in set(a):\r\n d[j] = 0 \r\nfor i in a:\r\n if d[i]>0:\r\n d[i]-=1 \r\n \r\n else:\r\n ans.append(i) \r\n d[i] +=1 \r\n for i in range(len(ans)-1):\r\n x = gcd(ans[i],ans[-1])\r\n if x in d:\r\n d[x]+=2\r\n else:\r\n d[x] = 2 \r\n \r\n \r\n \r\nprint(*ans)", "#!/usr/bin/env python\n\nfrom sys import stdin\nfrom fractions import gcd\nfrom math import sqrt\nfrom collections import Counter\n\nn = int(stdin.readline())\ntable = Counter(int(x) for x in stdin.readline().split())\nkeys = reversed(sorted(table.keys()))\na = Counter()\n\nfor i in keys:\n if not table[i]:\n continue\n\n cnt_total = table[i]\n cnt_div = 0\n\n for k in a.keys():\n if k % i == 0:\n cnt_div += a[k]\n\n a[i] = int(sqrt(4*cnt_div*cnt_div + 4*cnt_total))//2 - cnt_div\n\n for k in a.keys():\n if k % i:\n table[gcd(i, k)] -= 2 * a[i] * a[k]\n\nprint(\" \".join(str(x) for x in a.elements()))\n", "from math import gcd\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nd = {}\r\nfor i in arr:\r\n d[i] = d.get(i, 0) + 1\r\nd = {i : d[i] for i in sorted(d, key=lambda w:-w)}\r\nout = []\r\nfor i in d:\r\n while d[i] > 0:\r\n for y in out:\r\n d[gcd(y, i)] -= 2\r\n out += [i]\r\n d[i] -= 1\r\nprint(*out)\r\n", "from collections import Counter\nfrom fractions import gcd\n\n\ndef reconstruct(n, C):\n A = []\n l = sorted(C)\n i = len(l)-1\n while len(A) < n:\n while C[l[i]] == 0:\n i -= 1\n m = l[i]\n C[m] -= 1\n for a in A:\n C[gcd(m, a)] -= 2\n A.append(m)\n return A\n\n\ndef isect():\n h, v = map(int, input().split())\n return h, v\n\n\ndef main():\n n = int(input())\n C = Counter(map(int, input().split()))\n print(' '.join(map(str, reconstruct(n, C))))\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)*1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n\"\"\", \"\"\"\\\n6 4 3 2\n\"\"\"), (\"\"\"\\\n1\n42\n\"\"\", \"\"\"\\\n42\n\"\"\"), (\"\"\"\\\n2\n1 1 1 1\n\"\"\", \"\"\"\\\n1 1\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n", "from collections import Counter\r\n\r\n\r\ndef gcd(a, b): return a if b == 0 else gcd(b, a % b)\r\n\r\n\r\nn = int(input())\r\ncount = Counter()\r\nfor e in map(int, input().split()):\r\n count[e] += 1\r\nres = []\r\nwhile sum(count.values()) > 0:\r\n cur = max(count.keys())\r\n count[cur] -= 1\r\n if count[cur] == 0:\r\n del count[cur]\r\n for e in res:\r\n g = gcd(cur, e)\r\n count[g] -= 2\r\n if count[g] == 0:\r\n del count[g]\r\n res.append(cur)\r\nprint(*res)", "from collections import Counter\nfrom fractions import gcd\n\ndef solve(arr,n):\n d = Counter(arr)\n gcd_arr = []\n for i in range(n):\n m = max(d.keys())\n d[m] -= 1\n if not d[m]:\n del d[m]\n for value in gcd_arr:\n x = gcd(value,m)\n d[x] -= 1\n if not d[x]:\n del d[x]\n for value in gcd_arr:\n x = gcd(value,m)\n d[x] -= 1\n if not d[x]:\n del d[x]\n gcd_arr.append(m)\n print(*gcd_arr)\n\nn = int(input())\n\narr = list(map(int,input().split()))\n\nsolve(arr,n)\n", "from fractions import gcd\n#inf = open('Input.txt', 'r')\nn = int(input())\ng = list(map(int, input().split()))\ng.sort(reverse = True)\nk = set()\nans = []\nd = {}\nfor i in range(n**2):\n if g[i] in k:\n d[g[i]] += 1\n \n else:\n d[g[i]] = 1\n k.add(g[i])\n\nfor i in range(n**2):\n if d[g[i]] != 0:\n ans.append(g[i])\n p = 0\n for j in range(len(ans)):\n d[gcd(g[i], ans[j])] -= 2\n if j == len(ans) - 1:\n d[gcd(g[i], ans[j])] += 1\nprint(*ans)\n \n \n ", "def getDictionary(myList):\r\n myDict = {}\r\n for i in range(0, len(myList)):\r\n if (myList[i] in myDict):\r\n myDict[myList[i]] = myDict[myList[i]] + 1;\r\n else:\r\n myDict[myList[i]] = 1;\r\n return myDict\r\n \r\ndef counting(sizeOfMother, myDict):\r\n winTable = []\r\n for i in range(0, sizeOfMother):\r\n x = next(iter(myDict.keys()))\r\n \r\n # Usun ten element\r\n if (myDict[x] > 1):\r\n myDict[x] = myDict[x] - 1;\r\n else:\r\n del myDict[x]\r\n \r\n for j in range(0, len(winTable)):\r\n gcd = searchNWD(x, winTable[j])\r\n # Usun ten element\r\n if (myDict[gcd] <= 2):\r\n del myDict[gcd]\r\n else:\r\n myDict[gcd] = myDict[gcd] - 2;\r\n \r\n winTable.append(x)\r\n return winTable\r\n \r\ndef searchNWD(a, b):\r\n temporary = 0\r\n while(a != 0) and (b != 0):\r\n if(a > b):\r\n a = a % b\r\n else:\r\n b = b % a\r\n if(a > 0):\r\n return a\r\n else:\r\n return b\r\n \r\n######################\r\nsizeOfMotherG = int(input())\r\nnumberInMotherG = list(map(int, input().split()))\r\nnumberInMotherG.sort(reverse=True)\r\nmyDictG = getDictionary(numberInMotherG)\r\n\r\nw = counting(sizeOfMotherG, myDictG)\r\n \r\nfor i in range(0, sizeOfMotherG):\r\n print(w[i], end=\" \")", "import math,sys\r\n#from itertools import permutations, combinations;import heapq,random;\r\nfrom collections import defaultdict,deque\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\ndef I():return (int(sys.stdin.readline()))\r\ndef In():return(map(int,sys.stdin.readline().split()))\r\ndef Sn():return sys.stdin.readline().strip()\r\n#sys.setrecursionlimit(1500)\r\ndef dict(a):\r\n d={} \r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n return d\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_left(a, x)\r\n if i != len(a):\r\n return i\r\n else: \r\n return -1\r\n \r\ndef main():\r\n try:\r\n n=I()\r\n l=list(In())\r\n d,s={},[]\r\n for x in l:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n ans=[]\r\n ans.append(max(l))\r\n # d.pop(ans[0])\r\n d[ans[0]]-=1\r\n if d[ans[0]]==0:\r\n d.pop(ans[0])\r\n for i in range(n-1):\r\n mx=0\r\n for x in d.keys():\r\n mx=max(mx,x)\r\n for x in ans:\r\n z=math.gcd(x,mx)\r\n d[z]-=2\r\n if d[z]==0:\r\n d.pop(z)\r\n d[mx]-=1\r\n if d[mx]==0:\r\n d.pop(mx)\r\n ans.append(mx)\r\n ans.sort()\r\n print(*ans)\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n # for _ in range(I()):main()\r\n for _ in range(1):main()\r\n# ******************* All The Best ******************* #", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\nfrom math import gcd\r\ndef solve():\r\n n = int(input())\r\n\r\n arr = list(map(int, input().strip().split()))\r\n\r\n skip = defaultdict(int)\r\n arr.sort()\r\n ans = [arr[-1]]\r\n arr.pop()\r\n \r\n while len(ans) < n and arr:\r\n while arr and skip[arr[-1]]:\r\n skip[arr[-1]] -= 1\r\n arr.pop()\r\n\r\n if arr:\r\n for element in ans:\r\n #print(arr, ans, element)\r\n x = gcd(element, arr[-1])\r\n skip[x] += 2\r\n ans.append(arr[-1])\r\n arr.pop()\r\n #print(skip)\r\n print(*ans)\r\n \r\n\r\n\r\n\r\nsolve()", "import io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nimport math\r\ndef binarySearch(num,l,r,x):\r\n while l<=r:\r\n mid=(l+r)//2\r\n if num[mid]==x:\r\n return mid\r\n elif num[mid]<x:\r\n l=mid+1\r\n else:\r\n r=mid-1\r\ndef quadratic(b,c):\r\n e=pow(b,2)\r\n f=e-(4*c)\r\n d=math.sqrt(f)\r\n ans=(((-1)*b)+d)//2\r\n return ans\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmatrix=[[0]*n for i in range(n)]\r\na=max(arr)\r\ndict1={}\r\nfor i in range(n**2):\r\n if arr[i] in dict1.keys():\r\n dict1[arr[i]]+=1\r\n else:\r\n dict1[arr[i]]=1\r\nlis=[]\r\nfor i in dict1.keys():\r\n lis.append([i,dict1[i]])\r\nlis.sort(key=lambda x:x[0],reverse=False)\r\nnum=[]\r\np=0\r\nfor i in lis:\r\n num.append(i[0])\r\n p+=1\r\na=math.sqrt(lis[-1][1])\r\nans=[[lis[-1][0],a]]\r\nlis[-1][1]=0\r\ni=p-2\r\nk=1\r\nwhile i>=0:\r\n if lis[i][1]>0:\r\n count=0\r\n for j in range(k):\r\n temp=math.gcd(ans[j][0],lis[i][0])\r\n if temp==lis[i][0]:\r\n count+=(ans[j][1]*2)\r\n if count==0:\r\n ans.append([lis[i][0],math.sqrt(lis[i][1])])\r\n lis[i][1]=0\r\n else:\r\n ans.append([lis[i][0],quadratic(count,(-1)*lis[i][1])])\r\n lis[i][1]=0\r\n for j in range(k):\r\n temp=math.gcd(ans[j][0],ans[-1][0])\r\n if temp!=ans[-1][0]:\r\n ind=binarySearch(num,0,p-1,temp)\r\n lis[ind][1]-=(2*ans[j][1]*ans[-1][1])\r\n k+=1\r\n i-=1\r\nanswer=[]\r\nfor i in ans:\r\n for j in range(int(i[1])):\r\n answer.append(i[0])\r\nprint(\" \".join(str(x) for x in answer))", "import sys\r\nfrom collections import defaultdict\r\nfrom math import gcd\r\ninput = sys.stdin.readline \r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split())) \r\na.sort(reverse = True) \r\nans = [] \r\nd = defaultdict(int)\r\nfor i in range(n * n):\r\n if(d[a[i]]):\r\n d[a[i]] -= 1 \r\n else:\r\n for j in ans:\r\n g = gcd(a[i], j) \r\n d[g] += 2 \r\n ans.append(a[i]) \r\nprint(*ans)\r\n\r\n ", "n=int(input())\r\nu=[int(i) for i in input().split()]\r\nd=dict()\r\nfor i in u:\r\n\tif i in d:d[i]=1+d[i]\r\n\telse:d[i]=1\r\ndef gcd(a,b):\r\n\tc=0\r\n\twhile a!=0:\r\n\t\tc=a\r\n\t\ta=b%a\r\n\t\tb=c\r\n\treturn(b)\r\n\t\r\nt=[]\r\nfor i in d:t+=[i]\r\nt.sort()\r\nv=[]\r\nwhile(len(v)<n):\r\n\tx=t[len(t)-1]\r\n\tfor i in v:\r\n\t\ty=gcd(x,i)\r\n\t\tif d[y]>2:d[y]=d[y]-2\r\n\t\telse:\r\n\t\t\td[y]=0\r\n\t\t\ta=0\r\n\t\t\tb=len(t)-1\r\n\t\t\twhile t[a]!=y and t[b]!=y:\r\n\t\t\t\tc=(a+b)//2\r\n\t\t\t\tif t[c]>=y:\r\n\t\t\t\t\tb=c\r\n\t\t\t\telse:\r\n\t\t\t\t\ta=c\r\n\t\t\tif t[a]==y:t.pop(a)\r\n\t\t\telse:t.pop(b)\r\n\tv+=[x]\r\n\tif d[x]>1:d[x]=d[x]-1\r\n\telse:t.pop(len(t)-1)\r\nfor i in v:\r\n\tprint(i,end=\" \")", "from collections import Counter\r\n\r\nn = int(input())\r\nA = [int(i) for i in input().split()]\r\nB = Counter(A)\r\nresult = []\r\n\r\ndef NOD(a, b): \r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef delete(x):\r\n global B\r\n B[x] -= 1\r\n if B[x] == 0:\r\n del B[x]\r\n \r\ndef next():\r\n global B\r\n return max(B)\r\n\r\nnow = max(B)\r\ndelete(now)\r\nresult.append(now)\r\n\r\nfor i in range(n - 1):\r\n now = max(B)\r\n delete(now)\r\n for j in result:\r\n delete(NOD(now, j))\r\n delete(NOD(now, j))\r\n result.append(now)\r\n \r\nfor i in result:\r\n print(i, end = \" \")", "from math import gcd\r\nfrom collections import Counter\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=list(set(a))\r\ns.sort(reverse=True)\r\nc=Counter(a) \r\nans=[]\r\nfor i in s:\r\n while(c[i]>0):\r\n for j in ans:\r\n k=gcd(i,j)\r\n c[k]-=2\r\n c[i]-=1\r\n ans.append(i)\r\nprint(*ans)\r\n ", "import collections as cc\r\nimport math as mt\r\nI=lambda:list(map(int,input().split()))\r\nn,=I()\r\nl=I()\r\nf=cc.Counter(l)\r\nans=[]\r\nfor i in range(n):\r\n now=max(f)\r\n f[now]-=1\r\n for j in ans:\r\n f[mt.gcd(now,j)]-=2\r\n ans.append(now)\r\n f+=cc.Counter()\r\nprint(*ans)", "from collections import Counter\r\nimport math\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\ncnt = Counter(a)\r\nsorted_keys = sorted(cnt.keys(), reverse=True)\r\nres = []\r\ni = 0\r\nwhile len(res) < n:\r\n k = sorted_keys[i]\r\n i += 1\r\n if cnt[k] == 0:\r\n continue\r\n\r\n while cnt[k] > 0:\r\n for t in res:\r\n cnt[math.gcd(t, k)] -= 2\r\n cnt[k] -= 1\r\n res.append(k)\r\nprint(*res)\r\n\r\n", "from math import gcd\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor x in l :\r\n d[x]=d.get(x,0)+1\r\nd={x:d[x]for x in sorted(d,key=lambda w:-w)}\r\n#print(d)\r\nans=[]\r\nfor i in d:\r\n while d[i]:\r\n for j in ans:\r\n d[gcd(i,j)]-=2\r\n ans+=[i]\r\n d[i]-=1\r\nprint(*ans) \r\n\r\n", "import math;\r\nfrom fractions import gcd;\r\n\r\nlength = int(input());\r\nvct = sorted(map(int, input().split()), reverse=True);\r\n\r\ngcd_recur = dict();\r\nfor x in range (len(vct)):\r\n if (vct[x] not in gcd_recur):\r\n gcd_recur[vct[x]] = 1;\r\n else:\r\n gcd_recur[vct[x]] += 1;\r\n\r\nout = [];\r\n\r\nfor x in vct:\r\n if gcd_recur[x] > 0:\r\n out.append(x);\r\n for n in out:\r\n gcd_recur[gcd(n, x)] -= 2;\r\n \r\nfor x in out:\r\n print(x)", "from collections import Counter\r\nimport math\r\n\r\nn = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\ncount = Counter(a)\r\n\r\nitems = sorted(count.keys(), reverse= True)\r\n\r\nans = []\r\n\r\ni=0\r\nwhile len(ans) < n:\r\n\r\n ele = items[i]\r\n i+=1\r\n\r\n if count[ele] ==0:\r\n continue\r\n\r\n while count[ele] >0:\r\n for otherele in ans:\r\n count[math.gcd(otherele,ele)] -=2\r\n count[ele] -=1\r\n ans.append(ele)\r\nprint(*ans)\r\n", "from math import gcd\r\ninput()\r\na=sorted(map(int,input().split()),reverse=1)\r\nb,d=[],{}\r\nfor i in a: d[i]=d.get(i,0)+1\r\nfor i in a:\r\n if d[i]:\r\n print(i)\r\n for j in b: d[gcd(i,j)]-=2\r\n b.append(i)\r\n d[i]-=1", "from sys import stdin,stdout\r\nfrom math import gcd\r\ninput = stdin.readline\r\ndef main():\r\n #t = int(input())\r\n t=1\r\n for z in range(t):\r\n n = int(input())\r\n #n, m = map(int,input().split())\r\n ai = list(map(int,input().split()))\r\n if n == 1:\r\n print(ai[0])\r\n return\r\n ai.sort()\r\n ar2 = [ai[-1],ai[-2]]\r\n d = {}\r\n d[ai[-1]] = 0\r\n d[ai[-2]] = 0\r\n d[gcd(ai[-1],ai[-2])] = 2\r\n for i in range(n**2-3,-1,-1):\r\n if ai[i] in d:\r\n if d[ai[i]] == 0:\r\n for num in ar2:\r\n temp = gcd(num,ai[i])\r\n if temp in d:\r\n d[temp] += 2\r\n else:\r\n d[temp] = 2\r\n ar2 += [ai[i]]\r\n else:\r\n d[ai[i]] -= 1\r\n else:\r\n for num in ar2:\r\n temp = gcd(num,ai[i])\r\n if temp in d:\r\n d[temp] += 2\r\n else:\r\n d[temp] = 2\r\n ar2 += [ai[i]]\r\n \r\n print(*ar2)\r\nmain()\r\n", "from collections import Counter\r\nfrom math import sqrt\r\n\r\ndef gcd(x, y):\r\n if x == 0:\r\n return y\r\n return gcd(y%x, x)\r\n\r\nN = int(input())\r\nfreq = Counter(map(int, input().split()))\r\nnums = sorted(freq, reverse=True)\r\nans = []\r\nans_set = set()\r\nfor ni, n in enumerate(nums):\r\n if not freq[n]: continue\r\n dividends = 0\r\n for m in ans_set:\r\n if m%n == 0:\r\n dividends += freq[m]\r\n count = int(sqrt(dividends**2 + freq[n]) - dividends)\r\n freq[n] = count\r\n for m in ans_set:\r\n g = gcd(m, n)\r\n if g != n:\r\n freq[g] -= (freq[n]*freq[m])*2\r\n ans_set.add(n)\r\n for _ in range(count):\r\n ans.append(n)\r\n\r\nprint(*ans)", "from fractions import gcd\r\n\r\n\r\nn = int(input())\r\n\r\nl = input().split()\r\nl = [int(i) for i in l]\r\n\r\nd = {}\r\nfor i in l:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n\r\nl = list(d)\r\nl.sort()\r\nl.reverse()\r\n\r\nnums = []\r\nfor i in l:\r\n if True not in [j % i == 0 for j in nums]:\r\n nums += [i] * round(d[i] ** (1/2))\r\n\r\nfor i in nums:\r\n for j in nums:\r\n d[gcd(i,j)] -= 1\r\n\r\ndels = []\r\nfor i in d:\r\n if d[i] == 0:\r\n dels.append(i)\r\nfor i in dels:\r\n del d[i]\r\n\r\nwhile len(nums) < n:\r\n k = max(d)\r\n d[k] -= 1\r\n for i in nums:\r\n d[gcd(i,k)] -= 2\r\n nums.append(k)\r\n dels = []\r\n for i in d:\r\n if d[i] == 0:\r\n dels.append(i)\r\n for i in dels:\r\n del d[i]\r\n\r\nprint(' '.join([str(i) for i in nums]))\r\n", "from collections import Counter\nfrom fractions import gcd\n\n\nn = int(input())\ncounter = Counter([int(x) for x in input().split()])\n\nanswer = []\nfor _ in range(n):\n\tmax_element = max(counter.keys())\n\tanswer.append(max_element)\n\tcounter.subtract([max_element])\n\n\tif counter[max_element] == 0:\n\t\tdel counter[max_element]\n\n\t# print(counter)\n\tfor x in answer[:-1:]:\n\t\tcommon = gcd(max_element, x)\n\t\tcounter.subtract([common]*2)\n\t\tif counter[common] == 0:\n\t\t\tdel counter[common]\n\nprint(' '.join(map(str, answer)))", "#for _ in range(int(input())):\r\nfrom math import gcd\r\nfrom collections import Counter\r\nn=int(input())\r\n # n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=list(set(a))\r\ns.sort(reverse=True)\r\nc=Counter(a) \r\nans=[]\r\nfor i in range(len(s)):\r\n if(c[s[i]]>0):\r\n while(c[s[i]]>0):\r\n for j in ans:\r\n k=gcd(s[i],j)\r\n c[k]-=2\r\n c[s[i]]-=1\r\n ans.append(s[i])\r\nprint(*ans)\r\n", "import sys,math as mt\ninput = sys.stdin.readline\nfrom collections import Counter as cc\nI = lambda : list(map(int,input().split()))\n\nn,=I()\nl=I()\nan=[];rq=cc(l)\nfor i in range(n):\n\tmx=max(rq)\n\trq[mx]-=1\n\tfor x in an:\n\t\trq[mt.gcd(x,mx)]-=2\n\tan.append(mx)\n\trq+=cc()\nprint(*an)\n\n", "def gcd(a,b):\r\n while(a>0 and b>0):\r\n if(a>b):a%=b\r\n else:b%=a\r\n return a+b\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\na.reverse()\r\ni=0;b=[];c={}\r\nwhile(i<len(a)):\r\n if(a[i] not in c):c[a[i]]=0\r\n while(c[a[i]]>0):\r\n i+=1\r\n c[a[i-1]]-=1\r\n if(a[i] not in c):c[a[i]]=0\r\n print(a[i],end=' ')\r\n b.append(a[i])\r\n if(len(b)==n):break\r\n i+=1\r\n for j in range(len(b)-1):\r\n e=gcd(b[len(b)-1],b[j])\r\n if(e not in c):c[e]=2\r\n else:c[e]+=2", "def main():\n from collections import Counter\n from math import gcd, sqrt\n n = int(input())\n cnt = Counter(map(int, input().split()))\n kk = sorted(cnt.keys(), reverse=True)\n res = []\n for k in kk:\n c = Counter()\n for k0, v0 in res:\n q = gcd(k, k0)\n c[q] += v0\n b = c[k]\n del c[k]\n v = int(sqrt(b * b + cnt[k])) - b\n res.append((k, v))\n for k0, v0 in c.items():\n cnt[k0] -= v0 * v * 2\n print(*sorted((k for k, v in res for _ in range(v))))\n\n\nif __name__ == '__main__':\n main()\n", "import fractions\n\nn = int(input())\nns = list(map(int, input().strip().split(' ')))\n\na = []\nskip = {}\nns = sorted(ns, reverse=True)\n\nfor i, num in enumerate(ns):\n if num in skip and skip[num] > 0:\n skip[num] -= 1\n continue\n\n a.append(num)\n if len(a) == n:\n break\n\n for other in a:\n gcd = fractions.gcd(other, num)\n if not gcd in skip:\n skip[gcd] = 0\n skip[gcd] += 2\n\nprint(' '.join(map(str, a)))\n", "n = int(input())\na = sorted(map(int, input().split()), reverse=True)\n\nm = [[-1] * n for _ in range(n)]\nans = [-1] * n\n\nfrom math import gcd\nfrom bisect import bisect_left\nfrom collections import Counter\n\nc = Counter(a)\ni = 0\nj = n - 1\n\nfor i in range(n * n):\n\tif c[a[i]] == 0:\n\t\tcontinue\n\n\tans[j] = m[j][j] = a[i]\n\n\tc[a[i]] -= 1\n\n\tfor k in range(j + 1, n):\n\t\tm[j][k] = m[k][j] = gcd(ans[j], ans[k])\n\t\tc[m[j][k]] -= 1\n\t\tc[m[k][j]] -= 1\n\n\tj -= 1\n\n\nprint(*ans)", "from fractions import gcd\n\nn = int(input())\nv = sorted(list(map(int, input().split())))\ncnt = {}\n\nfor x in v:\n if x not in cnt:\n cnt[x] = 1\n else:\n cnt[x] += 1\n\nsol = []\nfor x in v[::-1]:\n while cnt[x] > 0 and n > 0:\n cnt[x] -= 1\n for y in sol:\n cnt[gcd(x, y)] -= 2\n sol += [x]\n n -= 1\n\n if n == 0:\n break\n\nprint(*sol)\n", "def gcd(a, b):\r\n return a if b == 0 else gcd(b, a % b)\r\n\r\nn = int(input())\r\nt = map(int, input().split())\r\ng = {}\r\nfor i in t:\r\n if i in g:\r\n g[i] += 1\r\n else:\r\n g[i] = 1\r\n\r\nanswer = []\r\nwhile len(g) > 0:\r\n t = max(g)\r\n g[t] -= 1\r\n for i in answer:\r\n g[gcd(t, i)] -= 2\r\n answer.append(t)\r\n for i in list(g):\r\n if g[i] == 0:\r\n del g[i]\r\n\r\nprint(' '.join(map(str, answer)), end = '\\n')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nfrom math import gcd\r\nfrom heapq import heappop, heappush\r\nn = int(input())\r\nd = sorted(map(int, input().split()))\r\nq = []\r\nh = []\r\nfor a in range(n**2-1, -1, -1):\r\n ew = 0\r\n if h:\r\n b = ~heappop(h)\r\n if d[a] == b:\r\n ew = 1\r\n else:\r\n heappush(h, ~b)\r\n if ew == 0:\r\n for i in q:\r\n for j in range(2):\r\n heappush(h, ~(gcd(i, d[a])))\r\n q.append(d[a])\r\nprint(' '.join(map(str, q)))", "from fractions import gcd\r\n\r\nn = int(input()) \r\na = sorted(list(map(int, input().split())))\r\ncount = {}\r\nfor i in a:\r\n count[i] = count.get(i,0) + 1 \r\n\r\nans = []\r\ni = n-1\r\nwhile(len(ans) < n):\r\n top = a.pop()\r\n while( count[top] < 1 ):\r\n top = a.pop()\r\n count[top] -= 1\r\n ans.append(top)\r\n for i in range(len(ans)):\r\n count[gcd(ans[-1], ans[i])] -= 2\r\nprint(' '.join(str(x) for x in ans))", "import fractions\r\nimport collections\r\n\r\nn = int(input())\r\n\r\nl = sorted(map(int, input().split(\" \")), reverse = True)\r\n\r\naux = []\r\ncont = collections.Counter(l)\r\n\r\nr = []\r\n\r\nfor i in l:\r\n if not cont[i]:\r\n continue\r\n \r\n r.append(i)\r\n cont[i] -= 1\r\n \r\n for j in aux:\r\n '''print(str(i) + \" \" + str(j))'''\r\n cont[fractions.gcd(i, j)] -= 2\r\n aux.append(i)\r\n \r\nprint(' '.join(map(str, r)))", "# ------------------\r\n# rpy3cpp's solution\r\n# ------------------\r\nimport collections\r\nimport math\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n g = list(map(int, input().split()))\r\n\r\n g_counter = collections.Counter(g)\r\n n_list = []\r\n g.sort()\r\n while len(n_list) < n:\r\n x = g.pop()\r\n while g_counter[x] == 0:\r\n x = g.pop()\r\n g_counter[x] -= 1\r\n for i in n_list:\r\n y = math.gcd(x, i)\r\n g_counter[y] -= 2\r\n n_list.append(x)\r\n print(' '.join(map(str, n_list)))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# # ------------------\r\n# # cgl-fai's solution\r\n# # - Slow\r\n# # ------------------\r\n#\r\n#\r\n# def gcd(a, b):\r\n# if b == 0:\r\n# return a\r\n# return gcd(b, a % b)\r\n#\r\n#\r\n# def main():\r\n# in_n = int(input())\r\n# in_a_list = list(map(int, input().split()))\r\n# x = max(in_a_list)\r\n# n_list = [x]\r\n# in_a_list.remove(x)\r\n# while len(n_list) < in_n:\r\n# x = max(in_a_list)\r\n# in_a_list.remove(x)\r\n# for i in n_list:\r\n# y = gcd(x, i)\r\n# in_a_list.remove(y)\r\n# in_a_list.remove(y)\r\n# n_list.append(x)\r\n# print(' '.join(map(str, n_list)))\r\n#\r\n# if __name__ == '__main__':\r\n# main()", "from collections import defaultdict\r\n\r\ndef gcd(a,b):\r\n while b != 0:\r\n b, a = a%b, b\r\n return a\r\n\r\ndef main():\r\n n = int(input())\r\n numbers = list(map(int, input().split()))\r\n numbers.sort()\r\n\r\n answer = [numbers[-1]]\r\n del numbers[-1]\r\n\r\n how_many = defaultdict(int) \r\n for x in numbers:\r\n how_many[x] += 1\r\n \r\n for _ in range(n-1):\r\n max_value = 0\r\n for number in how_many.keys():\r\n max_value = max(max_value, number)\r\n how_many[max_value] -= 1\r\n if how_many[max_value] == 0:\r\n del how_many[max_value]\r\n for element in answer:\r\n key = gcd(element,max_value)\r\n how_many[key] -= 2\r\n if how_many[key] == 0:\r\n del how_many[key]\r\n answer.insert(0, max_value)\r\n for a in answer:\r\n print(a, end = \" \")\r\n\r\nmain()\r\n", "import sys\r\nlines = iter(sys.stdin.read().split(\"\\n\"))\r\nn = int(next(lines))\r\nnums = map(lambda x: int(x), next(lines).strip(\" \").split(\" \"))\r\ndef gcd(a, b):\r\n if a % b == 0:\r\n return b\r\n return gcd(b, a % b)\r\ndef gcds(new, olds):\r\n return map(lambda old: gcd(new, old), olds)\r\nfrom collections import Counter\r\ncounter = Counter(nums)\r\nnums = sorted(counter.keys(), reverse=True)\r\nptr = 0\r\nres = []\r\nfor i in range(n):\r\n while True:\r\n new = nums[ptr]\r\n if counter[new] > 0:\r\n break\r\n ptr += 1\r\n counter[new] -= 1\r\n factors = gcds(new, res)\r\n for factor in factors:\r\n counter[factor] -= 2\r\n res.append(new)\r\nprint(\" \".join(map(str, res)))\r\n", "import math\nfrom collections import Counter\nn = int(input())\na = Counter(map(int, input().rstrip().split()))\nli = []\nfor i in range(n):\n maxm = max(a)\n a[maxm] -= 1\n for x in li:\n a[math.gcd(x, maxm)] -= 2\n li += [maxm]\n a += Counter()\nprint(*li)", "from math import gcd\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor x in l :\r\n d[x]=d.get(x,0)+1\r\nd={x:d[x]for x in sorted(d,key=lambda w:-w)}\r\nout=[]\r\nfor x in d :\r\n while d[x] :\r\n for y in out :\r\n d[gcd(y,x)]-=2\r\n out+=[x]\r\n d[x]-=1\r\nprint(*out)\r\n \r\n \r\n" ]

[ "wwe=int(input())\r\ns=list(map(int,input().split()))\r\np=sorted(s,reverse=True)\r\nk={}\r\nfor i in s:\r\n if i in k:\r\n print(k[i],end=' ')\r\n else:\r\n for j in range(len(p)):\r\n if p[j]==i:\r\n print(j+1,end=' ')\r\n k[i]=j+1\r\n break\r\n\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\np = [0] * (max(a) + 1)\r\nfor i in range(n):\r\n p[a[i]] += 1\r\ncol = 0\r\nfor i in range(len(p) - 1, -1, -1):\r\n t = p[i]\r\n p[i] = col + 1\r\n col += t\r\nfor i in range(len(a)):\r\n print(p[a[i]], end = ' ')\r\n \r\n \r\n", "from collections import defaultdict\r\nfrom typing import Counter\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nd = defaultdict(list)\r\n\r\nfor i in range(n):\r\n d[a[i]].append(i)\r\n\r\nl = sorted(d.items(), key=lambda x: -x[0])\r\n\r\np = 1\r\n\r\nans = [0 for _ in range(n)]\r\n\r\nfor t in l:\r\n for idx in t[1]:\r\n ans[idx] = p\r\n p += len(t[1])\r\n\r\nprint(' '.join(map(str, ans)))", "n=int(input())\nl=list(map(int,input().split()))\ns=sorted(l)\ns=s[::-1]\n\nfor i in range(n):\n l[i]=s.index(l[i])+1\nprint(*l)\n \n \n\t \t\t\t \t\t\t \t \t \t\t \t \t \t \t\t \t", "#GukiZ and Contest\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = sorted(a, reverse=True)\r\n\r\nrank = [0]*2001\r\n\r\nrank[b[0]] = 1\r\ntemp = b[0]\r\nfor i in range(n):\r\n if temp != b[i]:\r\n rank[b[i]] = i + 1\r\n temp = b[i]\r\n\r\nfor i in range(n):\r\n print(rank[a[i]], end=\" \")", "n = int(input())\r\nratings = [(i,int(x)) for i,x in enumerate(input().split())]\r\nout = [0]*n\r\nratings = sorted(ratings, key = lambda x: x[1], reverse=True)\r\npos = 0\r\nscore = 0\r\ncount = 1\r\nfor r in ratings:\r\n r_score = r[1]\r\n if r_score != score:\r\n score = r_score\r\n pos +=count\r\n count = 1\r\n else:\r\n count += 1\r\n\r\n out[r[0]] = pos\r\nprint (' '.join(str(x) for x in out))", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ncpy = lst.copy()\r\ncpy.sort()\r\ncpy.reverse()\r\nres = [1 + cpy.index(x) for x in lst]\r\nprint(\" \".join(str(x) for x in res))", "n=int(input())\narr=[int(x) for x in input().split()]\nar=sorted(arr,reverse=True)\na=dict()\nc=1\nfor ele in ar:\n if ele in a:\n a[ele]=a[ele]\n c+=1\n else:\n a[ele]=c\n c+=1\nfor ele in arr:\n print(a[ele],end=' ') \n \t\t\t \t\t\t \t\t\t\t\t\t\t\t \t \t\t \t\t", "n = int(input())\nscores = [score for score in map(int, input().split())]\n\nsorted_scores = sorted(scores, reverse=True)\n\nranks = []\nfor score in scores:\n ranks.append(str(sorted_scores.index(score) + 1))\n\nprint(' '.join(ranks))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nli = [1] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i] > a[j]:\r\n li[j] += 1\r\nprint(*li)", "n = int(input())\nnums = [int(x) for x in input().strip().split()]\ns = sorted(nums)[::-1]\n#print(nums)\n#print(s)\nfor i in nums:\n\tprint(1 + s.index(i), end = \" \")\n\t\t \t \t \t\t \t\t\t\t\t\t \t \t\t \t \t", "def count(arr,x):\r\n c = 0\r\n for i in arr:\r\n if i > x:\r\n c += 1\r\n return c\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nx = []\r\nans = []\r\nfor i in arr:\r\n ans.append(1+count(arr,i))\r\nprint(*ans)\r\n", "n=int(input())\nli=list(map(int,input().split()))\nfor i in range(n):\n li[i]=(li[i],i)\nans=[0]*(n)\nli.sort(reverse=True)\ny=1\nfor i in range(n-1):\n ans[li[i][1]]=y\n if(li[i][0]!=li[i+1][0]):\n y=2+i\nans[li[n-1][1]]=y\nprint(*ans)\n \t \t\t \t \t \t \t\t \t\t \t", "n=int(input())\r\nls=list(map(int,input().split()))\r\n#print(ls[::-1])\r\nfor x in ls:\r\n print(sorted(ls)[::-1].index(x)+1,end=\" \")", "x=int(input())\ny=list(map(int,input().split()))\narr1=[]\nfor i in y:\n count=0\n for j in y:\n if i<j:\n count+=1\n arr1.append(count+1)\nprint(*arr1)\n \t \t\t\t\t \t\t\t \t\t\t\t\t\t\t \t\t\t \t", "n=int(input())\r\nn1=list(map(int,input().split()))\r\nlst=[]\r\nfor j in n1:\r\n lst.append(j)\r\nn1.sort()\r\nn1.reverse()\r\nfor i in lst:\r\n print(n1.index(i)+1,end=' ')\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(len(a)) :\r\n c=1\r\n for j in range(len(a)) :\r\n if a[i]<a[j] :\r\n c+=1\r\n d.append(c)\r\nfor i in range (len(d)) :\r\n print(d[i],end=\" \")\r\n", "#https://codeforces.com/problemset/problem/551/A\nn=int(input())\nl=list(map(int,input().split()))\ns=sorted(l,reverse=True)\nfor i in range(n):\n\tl[i]=s.index(l[i])+1\nprint(*l)\n", "z=int(input())\ny=list(map(int,input().split()))\narr=[]\nfor a in y:\n count=0\n for b in y:\n if a<b:\n count+=1\n arr.append(count+1)\nprint(*arr)\n \t \t \t \t\t\t \t\t \t \t\t \t\t", "n = int(input())\narr = list(map(int,input().split()[:n]))\nli = sorted(arr,reverse = True)\nfor ele in arr:\n res = li.index(ele)\n print(res + 1,end=\" \")\n\n\t \t \t \t \t \t\t \t \t", "__author__ = 'Sandi'\r\nimport sys\r\nfrom collections import defaultdict\r\nlines = sys.stdin.read().strip().split(\"\\n\")\r\n\r\nn = int(lines[0])\r\nstudents = lines[1].split(\" \")\r\nstudents = list(map(int, students))\r\nsortStudents = list(map(int, students[::]))\r\nsortStudents.sort(reverse=True)\r\nprev = sortStudents[0]\r\ngrade = 1\r\nnewGrade = 1\r\nmapping = defaultdict(int)\r\nfor i in sortStudents:\r\n if i < prev:\r\n prev=i\r\n newGrade=grade\r\n grade += 1\r\n mapping[i] = newGrade\r\n\r\nres = \"\";\r\nfor i in students:\r\n res += str(mapping[i])+\" \"\r\n\r\nres = res.rstrip(\" \");\r\nprint(res)", "n = int(input())\r\ndata = [int(i) for i in input().split()]\r\nplace = 1\r\ntotal = 1\r\nresults = [0] * n\r\nfor i in range(max(data), 0, -1):\r\n while i in data:\r\n results[data.index(i)] = place\r\n data[data.index(i)] = 0\r\n total += 1\r\n place = total\r\nprint(\" \".join(str(s) for s in results))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n c = 0\r\n for j in range(n):\r\n if(l[i] < l[j]):\r\n c += 1\r\n print(c + 1, end=' ')", "t=int(input())\nl=list(map(int, input().split()))\nfor i in range(0,len(l)):\n\tcount=1\n\tfor j in range(0,len(l)):\n\t\tif(l[i]<l[j]):\n\t\t\tcount+=1\n\tprint(count,end=\" \")\n\t\t\t\n \t\t\t \t\t\t \t\t\t\t\t \t\t\t\t\t \t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nls = []\r\ncount = 1\r\nfor i in range(len(arr)):\r\n for j in range(len(arr)):\r\n if arr[i] < arr[j]:\r\n count += 1\r\n\r\n ls.append(count)\r\n count = 1\r\nres = \"\"\r\nfor i in ls:\r\n res += \" \" + str(i)\r\n\r\nprint(res[1:])\r\n\r\n\r\n", "n = int (input())\r\narr = [int(x) for x in input().split()] \r\n\r\nsorted_list = list(arr)\r\nout = []\r\nsorted_list.sort()\r\n\r\n\r\nfor i in range(0,n):\r\n count = sorted_list.count(arr[i])\r\n indx = sorted_list.index(arr[i])\r\n out.append( n - count - indx + 1)\r\n\r\nprint(' '.join(repr(e) for e in out))", "def main():\r\n n = int(input())\r\n rating = [int(i) for i in input().split()]\r\n \r\n rank = []\r\n for i in rating:\r\n rank.append(1 + sum(1 if j > i else 0 for j in rating))\r\n \r\n print(' '.join(str(i) for i in rank))\r\n \r\n \r\nmain()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nrating = []\r\nfor j in range(n):\r\n\trating.append(a[j])\r\nrating.sort()\r\nrating.reverse()\r\ncontest = []\r\nfor i in range(n):\r\n\tcontest.append(rating.index(a[i]) + 1)\r\nprint(*contest)", "n = int(input())\na = list(map(int, input().split()))\nb = sorted(a, reverse=True)\nfor i in a:\n print(b.index(i)+1, end=\" \")\n\n\t\t \t\t\t\t \t\t\t \t\t\t \t \t \t\t", "n=int(input())\r\narr=[int(i) for i in input().split(\" \")]\r\ntemp=arr[:]\r\ntemp.sort(reverse=True)\r\nd={}\r\ni=0\r\nk=1\r\nwhile i < n:\r\n d[temp[i]]=k \r\n while(i+1 < n and temp[i]==temp[i+1]):\r\n i+=1\r\n k+=1\r\n i+=1\r\n k+=1\r\nresult=\"\"\r\nfor i in arr:\r\n result+=str(d[i])+\" \"\r\nprint(result)", "n = int(input())\na = [int(c) for c in input().split()]\n\nif n == 1:\n print('1')\nelse:\n dt = [[value, index] for index, value in enumerate(a)]\n dt.sort()\n\n m = 1\n\n res = []\n for i in reversed(range(len(dt)-1)):\n if dt[i][0] == dt[i+1][0]:\n dt[i+1].append(m)\n else:\n dt[i+1].append(m)\n m = n - i\n\n if dt[0][0] == dt[1][0]:\n dt[0].append(m)\n else:\n dt[0].append(n)\n\n dt.sort(key=lambda t:t[1])\n print(' '.join(str(d[2]) for d in dt))", "\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ns=sorted(arr,reverse=True)\r\ndic={}\r\nt=1\r\nfor i in s:\r\n if i not in dic:\r\n dic[i]=t\r\n t+=1\r\nfor i in arr:\r\n \r\n print(dic[i])", "n = int(input())\r\na = input().split()\r\na = [int(x) for x in a]\r\nb = sorted(a)\r\nfor i in range(n) :\r\n x = b.index(a[i])\r\n while x!=n-1 and b[x+1]==a[i] :\r\n x += 1\r\n print(n-x,end=\" \")", "n = int(input())\r\ns = input().split()\r\nl = []\r\nfor i in range(n):\r\n l.append([i, int(s[i])])\r\nl = sorted(l, key=lambda x: x[1], reverse=True)\r\nx = 0\r\ny = l[0][1]\r\nl[0][1] = 1\r\nfor i in range(1, n):\r\n if l[i][1] == y:\r\n l[i][1] = l[i-1][1]\r\n else:\r\n y = l[i][1]\r\n l[i][1] = i+1\r\nl = sorted(l, key=lambda x:x[0])\r\nfor i in range(n):\r\n print(l[i][1], end=' ')\r\n", "n = int(input())\r\na = list(map(int, input().split()))[:n]\r\nb = sorted(a)\r\nnet = []\r\nfor i in range(n):\r\n q = 0\r\n for j in range(0, n):\r\n if a[j] > a[i]:\r\n q += 1\r\n net.append(q + 1)\r\nprint(*net)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA_with_index = [(a, i) for i, a in enumerate(A)]\r\nA_with_index.sort(reverse=True)\r\nranks = [0] * n\r\nprev_a = A_with_index[0][0]\r\nrank = 1\r\nfor j, (a, i) in enumerate(A_with_index, 1):\r\n if a == prev_a:\r\n ranks[i] = rank\r\n else:\r\n prev_a = a\r\n rank = j\r\n ranks[i] = rank\r\nprint(*ranks)\r\n", "N=int(input())\nl=list(map(int, input().split()))\np=sorted(l,reverse=True)\nfor i in range(N):\n print(p.index(l[i])+1,end=\" \")\n\t \t \t \t\t \t \t \t \t\t \t\t \t\t\t \t \t", "def solve(n, a):\n s = []\n for i in a:\n k = sum(1 for j in a if j > i)\n s.append(1 + k)\n return ' '.join(map(str, s))\n\n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))\n\n\nmain()\n", "input()\r\narr = list(map(int, input().split()))\r\narr2 = {}\r\n\r\ni = 1\r\nc = 0\r\nwhile c < len(arr):\r\n max_ = max(arr)\r\n count = arr.count(max_)\r\n for j in range(count):\r\n ind = arr.index(max_)\r\n arr2[ind] = i\r\n arr[ind] = -1\r\n c += 1\r\n i += count\r\n\r\nfor i in arr2.items():\r\n print(i[1], end=' ')", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn = int(input())\r\nll = list(map(int, input().split()))\r\naa = []\r\nfor i in range(len(ll)):\r\n curr = ll[i]\r\n count = 0\r\n for j in range(len(ll)):\r\n if ll[j]>curr:\r\n count+=1\r\n aa.append(count+1)\r\nprint(*aa)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a[:]\r\nc=[0]*n\r\na.sort(reverse=True)\r\nfor i in range(n):\r\n c[i]=a.index(b[i])+1\r\nprint(*c) ", "# It returns location of x in given array arr\r\ndef binarySearch(arr, l, r, x):\r\n\r\n while l <= r:\r\n\r\n mid = l + (r - l) // 2\r\n\r\n # Check if x is present at mid\r\n if arr[mid] == x:\r\n return mid\r\n\r\n # If x is greater, ignore left half\r\n elif arr[mid] < x:\r\n l = mid + 1\r\n\r\n # If x is smaller, ignore right half\r\n else:\r\n r = mid - 1\r\n\r\n # If we reach here, then the element\r\n # was not present\r\n return -1\r\n\r\nn = int(input())\r\na = input().split()\r\na = [int(x) for x in a]\r\nb = sorted(a)\r\nfor i in range(n) :\r\n x = binarySearch(b,0,n-1,a[i])\r\n while x!=n-1 and b[x+1]==a[i] :\r\n x += 1\r\n print(n-x,end=\" \")", "n=int(input())\r\nL=[int(k) for k in input().split()]\r\na=max(L)\r\nb=min(L)\r\naux=[0]*(a-b+1)\r\nfor k in L:\r\n aux[k-b]+=1\r\nfor k in range(1,a-b+1):\r\n aux[k]+=aux[k-1]\r\nfor k in range(a-b+1):\r\n aux[k]=n-aux[k]+1\r\nprint(\" \".join([str(aux[k-b]) for k in L]))\r\n", "n=int(input())\r\nratings=list(map(int,input().split()))\r\nsorted=sorted(ratings,reverse=True)\r\n\r\nposition=[]\r\n\r\nfor i in range(n):\r\n position.append(sorted.index(ratings[i])+1)\r\n\r\nprint(*position,sep=' ')\r\n\r\n\r\n#5 co' ratings[i]=1, sorted[j]+1=1\r\n#3 co' ratings[i]=0, sorted[j]+1=4\r\n\r\n# 3 5 3 4 5\r\n# 5 5 4 3 3\r\n# 1 1 3 4 4\r\n\r\n# rating 4: position 2 + 1 = 3", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=set(l)\r\nx=sorted(x,reverse=True)\r\na=1\r\nd={}\r\nfor i in x:\r\n d.update({i:a})\r\n a+=l.count(i)\r\nfor i in l:\r\n print(d[i],end=' ')", "input()\r\nA = list(map(int,input().split()))\r\nfor a in A:\r\n print (1 + sum(1 for b in A if b > a),end=' ')\r\n", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n refer = line.copy()\r\n refer.sort(reverse=True)\r\n value = list()\r\n for i in range(n):\r\n value.append(str(refer.index(line[i]) + 1))\r\n print(' '.join(value))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * 2001\r\nfor i in a:\r\n b[i] += 1\r\nprev = 0\r\nfor i in range(1, 2001):\r\n if b[i]:\r\n prev += b[i]\r\n b[i] = n - prev\r\nfor i in a:\r\n print(b[i] + 1, end=' ')\r\n ", "def gukiz(n):\r\n ls = list(map(int,input().split()))[:n]\r\n for i in range(n):\r\n c=1\r\n for j in range(n):\r\n if(ls[i]<ls[j]):\r\n c += 1\r\n print(c,end=\" \")\r\na = int(input())\r\ngukiz(a)", "def indices(a,x,rank,result):\n ind = []\n temp = rank\n for i in range(0,len(a)):\n if(a[i]==x):\n a[i]=0\n result[i]=rank+1\n temp+=1\n return a,temp,result\n\nn = int(input())\na = list(map(int,input().split()))\nresult = a.copy()\nmaxi = max(a)\n\nrank = 0\nfor i in range(0,len(result)):\n if(a[i]==maxi):\n result[i]=1\n a[i]=0\n rank+=1\n \nwhile(True):\n maxi = max(a)\n if(maxi==0):\n break\n a,rank,result = indices(a,maxi,rank,result)\n \nprint(*result)\n\n \t \t \t\t \t\t\t\t \t\t\t \t \t \t", "n=int(input());\r\nnum_array=input()\r\nlst=list(map(int,num_array.split()))\r\nfor i in range (0,n,1):\r\n k=1\r\n for j in range (0,n,1):\r\n if(lst[i]<lst[j]):\r\n k+=1\r\n print(k,end=\" \")\r\n", "r, n, *a = [0] * 2001, int(input()), *map(int, input().split())\r\nsa = sorted(a, reverse=True)\r\nfor i in set(sa):\r\n r[i] = 1 + sa.index(i)\r\nprint(' '.join(str(r[i]) for i in a))\r\n\r\n# print(a)\r\n# for i in a\r\n# 1 2 3 4 5\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nsorted_a = sorted(a, reverse=True)\r\n\r\nfor i in a:\r\n print(sorted_a.index(i) + 1, end=' ')\r\n", "n=int(input())\na=[int(x) for x in input().split()]\nfor i in range(0,n):\n r=0\n for j in range(0,n):\n if a[i]<a[j]:\n r=r+1\n print(r+1,end=\" \")\n\n \t \t\t\t \t \t \t \t\t \t \t \t", "import collections\n\na = input()\nb = [int(x) for x in input().split()]\nbs = sorted(b, reverse=True)\nscore = {}\nfor i, v in enumerate(bs):\n if v not in score:\n score[v] = i+1\n\nprint(' '.join([str(score[x]) for x in b]))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=l[:]\r\nx.sort()\r\nx.reverse()\r\nans,z=[],[]\r\nfor i in range(n):\r\n z.append(x.index(x[i])+1)\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i]==x[j]:\r\n ans.append(z[j])\r\n break\r\nprint(*ans)\r\n", "n=int(input())\nl=[None]*n\nl=list(map(int,input().split()))\nfor i in range(0,len(l)):\n p=1\n for j in range(0,len(l)):\n if(l[i]<l[j]):\n p+=1\n print(p,end=\" \")\n \t\t \t\t\t\t \t\t \t \t \t \t \t\t", "n=int(input())\nlst=list(map(int,input().split()))\na=len(lst)\nfor i in range(a):\n c=0\n for j in range(a):\n if lst[j]>lst[i]:\n c+=1\n print(c+1,end=\" \")\n\t \t \t\t\t \t \t \t\t \t \t\t", "n = int(input())\na = [int(i) for i in input().split()]\nb = list(a)\nb.sort(reverse=True)\nd = {}\nfor i in range(len(b)):\n if(d.get(b[i])):\n continue\n d.update({b[i]:i+1})\nfor i in a:\n print(d.get(i),end=\" \")\n \n \t \t\t\t\t\t \t \t \t\t \t\t \t \t", "# your code goes here\nn=int(input())\nl=[int(x) for x in input().split()]\nfor i in range(n):\n\tcount=1\n\tfor j in range(n):\n\t\tif(l[i]<l[j]):\n\t\t\tcount+=1\n\tprint(count,end=\" \")\n \t \t \t\t\t\t\t \t\t \t\t \t \t\t", "n=int(input())\r\nlst1=input().split()\r\nk=0\r\nlst=[]\r\nfor y in lst1:\r\n lst.append((-(int(y)),k))\r\n k+=1\r\nlst=sorted(lst)\r\nl=1\r\nlst2=[(1,lst[0][1])]\r\nfor x in range(n)[1:n]:\r\n if lst[x][0] ==lst[x-1][0]:\r\n lst2.append((l,lst[x][1]))\r\n else:\r\n l=x+1\r\n lst2.append((l,lst[x][1]))\r\nlst3=[]\r\nfor z in lst2:\r\n lst3.append((z[1],z[0]))\r\nlst3=sorted(lst3)\r\ns=\"\"\r\nfor c in lst3:\r\n s=s+str(c[1])+\" \"\r\nprint(s)\r\n", "n = int(input())\r\nrating = [int(i) for i in input().split()]\r\n\r\nrank = sorted(rating, reverse = True)\r\nres = {}\r\ncount = 1\r\nfor i in rank:\r\n\tif i not in res:\r\n\t\tres[i] = count\r\n\tcount+=1\r\nans = []\r\nfor i in rating:\r\n\tans.append(str(res[i]))\r\nprint(\" \".join(ans))", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nk=1\r\nc=sorted(list(set(a)))\r\nc.reverse()\r\nl=[0]*n\r\nfor i in range(len(c)):\r\n for j in range(len(a)):\r\n if(c[i]==a[j]):\r\n l[j]=k\r\n k+=a.count(c[i])\r\nprint(*l)\r\n", "n = int(input())\r\nrate = list(map(int,input().split()))\r\ns_rate = sorted(rate)\r\nfor i in rate:\r\n print (s_rate[::-1].index(i) + 1, end = ' ')", "n=int(input())\nl2=list(map(int,input().split()))\nl=sorted(l2,reverse=True)\ns=sorted(list(set(l)),reverse=True)\nc=1\nl1=[]\nfor i in s:\n for j in range(l.count(i)):\n l1.append(c)\n c+=l.count(i)\nd={}\nfor k in range(len(l)):\n d[l[k]]=l1[k]\nfor m in l2:\n print(d[m],end=' ')\n \n\t \t\t \t \t\t \t\t \t \t\t \t\t\t \t \t", "n = int(input())\na = list(map(int,input().split()[:n]))\nl = sorted(a,reverse = True)\nfor i in a:\n result = l.index(i)\n print(result + 1,end=\" \")\n \t\t\t \t\t\t\t \t\t \t \t \t\t \t\t\t", "n=int(input());r=[*map(int,input().split())]\r\nfor i in r:print(len([j for j in r if j>i])+1,end=' ')", "# http://codeforces.com/problemset/problem/551/A\n# A. GukiZ and Contest\n\n\ndef rate(n, a):\n a_with_pos = zip(a, range(0, len(a)))\n # print(a_with_pos)\n b = sorted(a_with_pos, key=lambda x: x[0], reverse=True)\n # print(b)\n last_num = None\n rankings = [0] * len(b)\n last_same_rate = 0\n last_rank = 0\n for i in range(0, len(b)):\n value, pos = b[i]\n if value != last_num:\n last_num = value\n rankings[pos] = last_rank + last_same_rate\n last_rank = rankings[pos]\n last_same_rate = 1\n else:\n last_same_rate += 1\n rankings[pos] = last_rank\n return rankings\n\n\ndef read_input():\n n = int(input())\n a = [int(i) for i in input().split(\" \")]\n return (n, a)\n\n\ndef main():\n n, a = read_input()\n print(\" \".join([str(i + 1) for i in rate(n, a)]))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\n\r\nb=a.copy()\r\nb.sort(reverse=True)\r\n\r\nd={}\r\nrank=1\r\nfor j in b:\r\n if j not in d.keys():\r\n d[j]=rank\r\n rank+=1\r\n\r\nans=[]\r\nfor k in a:\r\n ans.append(d[k])\r\nprint(*ans,sep=\" \")", "n=int(input())\nlst=list(map(int,input().split()))\nfor i in range(n):\n s=1\n for j in range(n):\n if lst[i]<lst[j]: s+=1\n print(s,end=' ')\n\t\t\t\t\t \t\t \t\t\t \t \t\t\t\t\t \t", "if __name__ == '__main__':\r\n input()\r\n data = list(map(int, input().split()))\r\n\r\n res = []\r\n for i in range(len(data)):\r\n c = 0\r\n for j in range(len(data)):\r\n if data[j] > data[i]:\r\n c += 1\r\n res.append(c + 1)\r\n\r\n print(' '.join(map(str, res)))", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n) :\r\n\ta[i] = [-a[i], i]\r\na.sort()\r\nans = [0] * n\r\n\r\npre = -1\r\ncur = 0\r\ncnt = 0\r\nfor i in range(n) :\r\n\tif (a[i][0] == pre) :\r\n\t\tans[a[i][1]] = cur + 1\r\n\t\tcnt += 1\r\n\telse :\r\n\t\tcur += cnt\r\n\t\tcnt = 1\r\n\t\tans[a[i][1]] = cur + 1\r\n\t\tpre = a[i][0]\r\n\r\nres = ''\r\nfor x in ans :\r\n\tres = res + str(x) + ' '\r\nprint(res)\t\r\n\t\t", "n=int(input())\r\nl = list(map(int,input().split()))\r\nb =l.copy()\r\nl.sort()\r\nl.reverse()\r\nfor i in b:\r\n\tprint(l.index(i)+1,end = \" \")", "\r\n__author__ = 'Juan Barros'\r\n'''\r\nhttp://codeforces.com/problemset/problem/551/A\r\n'''\r\n\r\ndef solve(n, a):\r\n for i in range(n):\r\n s = 1\r\n for j in range(n):\r\n if a[j] > a[i]:\r\n s += 1\r\n print(s, end = '')\r\n if i < n - 1:\r\n print(\" \", end = '')\r\n print(\"\")\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n a = [int(element) for element in input().split(\" \")]\r\n solve(n, a)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nfor i in range(len(lst)):\r\n cnt=0\r\n \r\n for j in lst:\r\n if j>lst[i]:\r\n cnt+=1\r\n \r\n print(cnt+1, end=' ')", "def rank_contest():\n n = int(input())\n arr_str = input().split()\n arr = [int(i) for i in arr_str]\n\n arr_sorted = sorted(arr, reverse=True)\n\n arr_res = []\n for i in arr:\n index = arr_sorted.index(i)\n arr_res.append(index + 1)\n return arr_res\n\n\nres = rank_contest()\nprint(\" \".join(map(str, res)))", "n = int(input())\nli = list(map(int,input().split()))\nfor i in range(n):\n li[i]=(li[i],i)\nk =[0]*n\nli.sort(reverse =True)\ny =1\nfor i in range(n-1):\n k[li[i][1]]=y\n if(li[i][0]!=li[i+1][0]):\n y = 2+i\n \nk[li[n-1][1]]=y\nprint(*k)\n\t \t\t \t\t\t\t\t\t\t \t\t\t\t\t \t\t\t\t \t \t\t", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [1] * n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[j] > a[i]:\r\n b[i] += 1\r\nprint(*b)", "def sol(s):\n lis = s.copy()\n lis.sort(reverse=True)\n pos = 1\n i = 1\n x = [1]\n while i<len(lis):\n if lis[i]==lis[i-1]:\n x.append(pos)\n else:\n pos = len(x)+1\n x.append(pos)\n i+=1\n hash = {}\n for i in range(len(lis)):\n hash[lis[i]] = x[i]\n for i in s:\n print(hash[i],end=' ')\ninput()\ns = list(map(int,input().split(' ')))\nsol(s)\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline().strip())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\nd = {}\r\nfor ele in lst:\r\n if ele in d:\r\n d[ele] += 1\r\n else:\r\n d[ele] = 1\r\ns = {}\r\ntemp = 0\r\nfor k in sorted(d.keys(), reverse = True):\r\n s[k] = temp\r\n temp = temp + d[k]\r\nfor i in range(n):\r\n lst[i] = s[lst[i]]+1\r\nprint(*lst)", "input()\r\n*a,=map(int,input().split())\r\nb=sorted(a,reverse=True)\r\nprint(' '.join(str(b.index(i)+1)for i in a))\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\nsize = len(arr)\n\n\nnarr = []\nfor i in range(size):\n count = 0\n for j in range(size):\n if arr[j] > arr[i]:\n count += 1\n narr.append(count + 1)\n\nprint(' '.join(map(str,narr)))\n", "\n\n\n\nn = int(input())\narr = list(map(int, input().split()))\n\nsorted_arr = sorted(arr)\nranking = {}\nprev_value = sorted_arr[-1]\nfor index, value in enumerate(sorted_arr[::-1]):\n\tif value not in ranking:\n\t\tif value < prev_value:\n\t\t\tranking[value] = 1 + index\n\t\t\tprev_value = value\n\t\telse:\n\t\t\tranking[value] = 1\n\nans = [0 for _ in range(n)]\nfor index, item in enumerate(arr):\n\tans[index] = ranking[item]\n\nprint(*ans)\n\t\n", "n = int(input())\r\nCad = list(map(int,input().split()))\r\nk = 1\r\nAux = [0]*len(Cad)\r\nPosis = [0]*n\r\nPosis[0] = k\r\nfor i in range(n):\r\n Aux[i]=Cad[i]\r\nAux.sort()\r\nAux.reverse()\r\nfor j in range(1,n):\r\n if (Aux[j]==Aux[j-1]):\r\n Posis[j]=k\r\n else:\r\n k = j+1\r\n Posis[j]=k\r\nlista_nueva = []\r\nfor i in Aux:\r\n if i not in lista_nueva:\r\n lista_nueva.append(i)\r\n\r\nPosisAux = []\r\nfor j in Posis:\r\n if j not in PosisAux:\r\n PosisAux.append(j)\r\n\r\nresult = [0]*n \r\nfor p in range(n):\r\n valor = Cad[p]\r\n k = 0\r\n r = False\r\n while((k < len(lista_nueva))and r == False):\r\n if (valor == lista_nueva[k]):\r\n result[p] = PosisAux[k]\r\n r = True\r\n k = 0\r\n else:\r\n k+=1\r\nbb=\"\"\r\nfor j in range(n):\r\n bb+=str(result[j])+\" \"\r\nprint (bb)\r\n", "t=int(input())\nl=list(map(int,input().split()))\nk=l.copy()\nl.sort(reverse=True)\nfor e in k:\n print(l.index(e)+1,end=\" \")\n \t\t \t\t\t \t \t\t \t\t\t \t \t\t", "n=int(input())\r\nstu=input().split()\r\nstudents=[0]*n\r\nfor i in range(n):\r\n students[i]=int(stu[i])\r\nanswers=[1]*n\r\n#i is index of student, j is index of comparison\r\nfor i in range(n):\r\n studentScore=students[i]\r\n for j in range(n):\r\n if studentScore<students[j] and i!=j:\r\n answers[i]+=1\r\n\r\nanswer=\"\"\r\nfor i in range(n):\r\n answer+=str(answers[i])+\" \"\r\nprint(answer)", "students = int(input())\r\nstring = input()\r\nrating = string.split(\" \")\r\nfor x in range(students):\r\n rating[x] = int(rating[x])\r\norder = sorted(rating)\r\npositions = []\r\nfor x in rating:\r\n a = order.index(x)\r\n b = order.count(x)\r\n positions.append(str(students - a - b + 1))\r\nprint(\" \".join(positions))", "\r\nn = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = sorted(a, reverse=True)\r\nc = 0\r\nfor i in a:\r\n print(b.index(i) + 1, end=' ')\r\n\r\n# CodeForcesian\r\n# ♥\r\n# nothing\r\n# Im Good :((((\r\n", "n = int(input())\r\nrates = list(map(int, input().split()))\r\n\r\nranks = {}\r\nrates_sorted = sorted(rates, reverse = True)\r\nfor i in range(1,n+1):\r\n\tif rates_sorted[i-1] not in ranks:\r\n\t\tranks[rates_sorted[i-1]] = i\r\nfor rate in rates:\r\n\tprint(ranks[rate], end = \" \")", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nl_1 = []\r\nl_1.extend(l)\r\nl_1.sort()\r\nl_1.reverse()\r\nfor i in range(n):\r\n print(l_1.index(l[i]) + 1,end = \" \")\r\n", "stu = int(input())\r\nmarks = list(map(int,input().split()))\r\npost = []\r\npost += stu * [0]\r\npos = 1\r\nworse = min(marks)\r\na = max(marks)\r\nwhile a != -1:\r\n prize = [ i for i in range(len(marks)) if marks[i] == a]\r\n for i in prize:\r\n post[i] = pos\r\n marks[i] = -1\r\n pos += len(prize)\r\n a = max(marks)\r\nprint(*post)\r\n\r\n \r\n", "n = int(input())\nl = list(map(int, input().split()))\ne = len(l)\nn = sorted(l, reverse = True)\nm = [0]*len(l)\nfor x in range(e):\n m[x] = n.index(l[x]) + 1\nprint(' '.join(map(str, m)))\n \t \t \t\t \t \t\t \t \t\t\t\t\t \t \t\t", "n=int(input())\r\n\r\na=list(map(int, input().split()))\r\np=sorted(a, reverse=True)\r\ng=[]\r\nfor i in a:\r\n\tfor j in range(len(p)):\r\n\t\tif i==p[j]:\r\n\t\t\tg.append(str(j+1));break\r\nprint(\" \".join(g))\t\t\t", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\na_sorted = sorted(a, reverse=True)\r\n\r\nrank = {}\r\nfor i in range(n):\r\n score = a_sorted[i]\r\n if score not in rank:\r\n rank[score] = i + 1\r\n \r\n\r\nfor i in range(n):\r\n print(rank[a[i]], end=' ')\r\n", "n = int(input())\na = list(map(int, input().split()))\nb = [[0]*2 for i in range(n)]\n\nfor i in range(n):\n b[i][0] = a[i]\n b[i][1] = i\n\nb = sorted(b)[::-1]\nans = [0]*n\n\nplace = 1\nnum_m = 0\nm = b[0][0]\n\nfor i in range(n):\n if b[i][0] != m:\n place += num_m\n m = b[i][0]\n num_m = 1\n else:\n num_m += 1\n ans[b[i][1]] = place\n \nfor i in range(n-1):\n print(ans[i], end = ' ')\nprint(ans[n-1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(0,n):\r\n if a[i] in d:\r\n print(d[a[i]],end=\" \")\r\n else:\r\n c=1\r\n for j in range(n):\r\n if a[j]>a[i]:\r\n c+=1\r\n d[a[i]]=c\r\n print(c,end=\" \")", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a.copy()\r\nb.sort(reverse=True)\r\nans=[]\r\nfor i in a:\r\n ans.append(1+b.index(i))\r\nprint(' '.join(map(str, ans)))\r\n \r\n", "yash = int(input())\nli=list(map(int,input().split()))\nfor i in range(len(li)):\n y=[j for j in li if(j>li[i])]\n print(len(y)+1,end=\" \")\n \t\t \t\t \t \t\t \t \t \t\t \t\t \t\t", "q = int(input())\r\nli = list(map(int, input().split()))\r\nli2 = list((sorted(li)))\r\nm = {}\r\nsz = len(li2)\r\nfor i in range(0, sz):\r\n m[li2[i]] = sz - (i + 1)\r\nfor i in li:\r\n print(1 + (m[i]), end=\" \")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(len(l)):\r\n ans=0\r\n for j in range(i+1,len(l)):\r\n if(l[i]<l[j]):\r\n ans+=1\r\n for k in range(len(l[:i])):\r\n if(l[i]<l[k]):\r\n ans+=1\r\n l1.append(ans)\r\nfor i in l1:\r\n print(i+1,end=\" \")", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nprint(*[sorted(array, reverse=True).index(i) + 1 for i in array])", "n = int(input())\narr = list(map(int,input().split()))\nl = arr.copy()\nl.sort()\nl = l[::-1]\nfor i in range(n):\n print(1+l.index(arr[i]),end=\" \")\n \t \t\t\t\t\t \t\t \t \t\t\t\t\t\t\t\t \t\t", "\n\nn = int(input())\na = [*map(int,input().split())]\nb = []\nfor i in range(n):\n b.append((a[i],i))\n\nb = sorted(b, reverse = True)\nans = [1] * n\nMin = float('inf')\nrate = 0\ncounter = 1\nfor i,j in b:\n if i < Min:\n rate=counter\n ans[j] = counter\n Min = i\n else:\n ans[j] = rate \n counter+=1 \n \nprint(*ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(a)\r\na.sort(reverse=True)\r\n\r\nrank = [0] * 2005\r\ncurrentRank = 1\r\nfor i in range(n):\r\n if rank[a[i]] == 0:\r\n rank[a[i]] = currentRank\r\n currentRank += 1\r\n\r\nfor element in b:\r\n print(rank[element], end=\" \")", "\r\nn = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nfor i in range(n) :\r\n cnt = 0\r\n for j in range(n) :\r\n \r\n \r\n if a[j]>a[i] :\r\n \r\n cnt = cnt + 1\r\n \r\n print(1+cnt,end=\" \")", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n B = A.copy()\r\n B.sort()\r\n ans = []\r\n for i in range(n):\r\n first = bisect.bisect_right(B, A[i])\r\n last = n\r\n val = 1 + (last - first)\r\n ans.append(val)\r\n print(' '.join(list(str(a) for a in ans)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "INPUT = lambda: list(map(int, input().split()))\n\nn = INPUT()\na = INPUT()\n\nfor i in a:\n listRank = (sorted(a)[::-1])\n print(listRank.index(i) + 1)", "def main():\r\n n=int(input())\r\n arg=list(map(int,input().split(' ')))\r\n temp=arg[:n]\r\n temp.sort()\r\n temp.reverse()\r\n result=[0 for i in range(temp[0]+1)]\r\n for i in range(len(temp)):\r\n t=temp[i]\r\n if result[t] ==0:\r\n result[t]=i+1\r\n for i in range(len(temp)):\r\n temp[i]=result[arg[i]]\r\n temp=' '.join(map(str,temp))\r\n print(temp)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\ta=read_ints()\n\tb=sorted(a)[::-1]\n\tans=dict()\n\tfor i in range(n-1,-1,-1):\n\t\tans[b[i]]=i+1\n\tprint(\" \".join(map(str, [ans[x] for x in a])))\n\nsolve()\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\n\r\nb = sorted(a)\r\nb.reverse()\r\n\r\nd = {}\r\n\r\nc = [0]*(n)\r\n\r\nfor i in range(n):\r\n if b[i] not in d:\r\n d[b[i]] = i\r\n \r\n\r\nfor i in range(n): \r\n c[i] = d[a[i]]+1\r\n\r\nprint(*c)\r\n ", "n = input()\nl = list(map(int,input().split()))\nfor x in l:\n\tprint(sorted(l)[::-1].index(x) + 1, end = ' ')\n \t \t\t \t \t \t\t\t \t\t\t\t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n c=1\r\n for j in range(n):\r\n if(a[i]<a[j]):\r\n c+=1\r\n b.append(c)\r\nprint(*b[:])", "n = (int)(input())\r\na = list(map(int, input().split()))\r\nb = sorted(a, reverse=True)\r\npos = []\r\nfor x in range(n):\r\n\tpos.append(0)\r\nrank = 0\r\ndiff = 1\r\nfor x in range(n):\r\n\tif x>0:\r\n\t\tif b[x]==b[x-1]:\r\n\t\t\tdiff += 1\r\n\t\telse: \r\n\t\t\trank += diff\r\n\t\t\tdiff = 1\r\n\t\tb[x-1] = -1\r\n\telse: rank = 1\r\n\t\r\n\tfor y in range(n):\r\n\t\tif a[y] == b[x]:\r\n\t\t\tpos[y] = rank\t\t\t\r\n\t\t\ta[y] = -1\r\n\t\t\tbreak\r\nout = \"\"\r\nfor x in range(n):\r\n\tout += (str)(pos[x]) + \" \"\r\nprint (out)", "test_case=int(input())\r\nlist_=list(map(int,input().split()))\r\nlist2=[]\r\nfor i in range(test_case):\r\n count=0\r\n for item in range(test_case):\r\n if list_[i]<list_[item]:\r\n count=count+1 \r\n else:\r\n continue\r\n list2.append(count)\r\nfor iten in list2:\r\n print(iten+1,end=\" \")", "n=int(input())\nl=list(map(int,input().split()))\nz=l.copy()\nz.sort(reverse=True)\nfor i in l:\n\tprint(z.index(i)+1,end=' ')\n\n\t\t \t \t \t\t\t \t \t \t\t\t\t \t \t", "n= int(input())\nt = input().split()\na = [int(x) for x in t]\nb = [x for x in a]\nc = [0]*2009\nb.sort(reverse=True)\ncount = 1\nfor i in range(0, n):\n\tif c[b[i]] == 0:\n\t\tc[b[i]] = count\n\tcount+=1\nfor v in a:\n\tprint(c[v], end =\" \")\nprint()", "n = int(input())\na = sorted([(int(x), i) for (i, x) in enumerate(input().split())], reverse=True)\nprev = a[0][0]\na[0] = (a[0][1], 1)\nfor i in range(1, n):\n\tx, k = a[i]\n\ta[i] = (k, i + 1 if x != prev else a[i - 1][1])\n\tprev = x\na.sort()\nprint(' '.join(str(x) for _, x in a))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=i=j=0\r\n\r\nwhile i<n:\r\n count=1\r\n j=0\r\n while j<n:\r\n if a[i]<a[j]:\r\n count=count+1\r\n j=j+1\r\n print(count,end=\" \")\r\n i=i+1\r\n\r\n", "class classStudent:\r\n def __init__(self, id=0, rating=0, new_id=0):\r\n self.id = id\r\n self.rating = rating\r\n self.new_id = new_id\r\n\r\n\r\nn = int(input())\r\na = list(map(int, list(input().split())))\r\nlist_student = []\r\ncnt = 0\r\npos = 0\r\n\r\nfor i in range(n):\r\n list_student.append(classStudent(i, a[i]))\r\n\r\nlist_student.sort(key=lambda s: (-s.rating, s.id))\r\nlist_student.insert(0, classStudent(0, 0))\r\n\r\nfor i in range(1, n + 1):\r\n\r\n if list_student[i].rating != list_student[i - 1].rating:\r\n pos = pos + cnt + 1\r\n cnt = 0\r\n\r\n if list_student[i].rating == list_student[i - 1].rating:\r\n cnt += 1\r\n\r\n list_student[i].new_id = pos\r\n\r\nlist_student.sort(key=lambda s: (s.id, s.new_id, s.rating))\r\n\r\nfor i in range(1, n + 1):\r\n print(list_student[i].new_id, end=\" \")\r\n", "number = int(input())\r\narr_sort = list(map(int , input().split()))\r\nar_orgin = list(arr_sort)\r\narr_sort.sort(reverse=True)\r\ninfo = {}\r\nfor i in range(0 , len(arr_sort)) :\r\n if not arr_sort[i] in info.keys() :\r\n info[arr_sort[i]] = i\r\nfor i in ar_orgin :\r\n print(f\"{info[i]+1} \" , end=\"\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=l.copy()\r\ns.sort(reverse=True)\r\nfor i in l:\r\n\tprint(s.index(i)+1,end=\" \")", "# import os\r\n\r\n\r\nn = int(input())\r\n\r\na = list(map(int,input().split()))\r\naa = sorted(a, reverse=True)\r\nr = []\r\n\r\nfor item in a:\r\n r.append(aa.index(item)+1)\r\nprint(' '.join(map(str, r)))\r\n\r\n \r\n\r\n# 10", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nindex_arr=[]\r\nfor i in range(n):\r\n count=0\r\n for j in range(n):\r\n if arr[i]<arr[j]:\r\n count+=1\r\n index_arr.append(1+count)\r\nprint(*index_arr)", "n=int(input())\narr=[int(x) for x in input().split()]\nlst=[]\nfor i in range(len(arr)):\n cnt=0\n for j in range(len(arr)):\n if arr[i]<arr[j]:\n cnt+=1\n lst.append(1+cnt)\nprint(*lst) \n\t\t\t\t \t \t\t\t \t\t\t \t \t \t\t \t\t", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n k = 0\r\n for j in range(n):\r\n if j == i: continue\r\n \r\n if a[j] > a[i]:\r\n k += 1\r\n \r\n print(1+k, end=\" \")", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=list(set(a))\r\ns.sort(reverse=True)\r\n#print(s)\r\nans=[0]*n\r\nk=1\r\nfor y in s:\r\n\tcount=0\r\n\tfor j in range(0,n):\r\n\t\tif a[j]==y:\r\n\t\t\tans[j]=k\r\n\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tcontinue\r\n\tk+=count\r\nfor x in ans:\r\n\tprint(x,end=' ')\r\n\t\t\t\t\t\t#unknown_2433", "n = int(input())\nx = list(map(int, input().split()))\nnew_x = x.copy()\nnew_x.sort(reverse=True)\nfor i in x:\n print(new_x.index(i)+1, end=\" \")\n\n\t \t\t \t \t \t \t\t \t \t\t\t\t\t\t \t", "n=int(input())\na=list(map(int,input().split()))\nfor x in range(n):\n k=0\n for y in range(n):\n if (a[y]>a[x]):\n k+=1\n print(k+1,end=\" \")\n \n\n \n \n", "n=int(input())\na=[int(i) for i in input().split()]\nfor i in range(n):\n s=1\n for j in range(n):\n if a[j]>a[i]:\n s+=1\n print(s,end=' ')\n", "n=(int(input()))\nl=[int(i) for i in input().split()]\ns=set(l)\nfor i in range(len(l)):\n j=1\n for js in l:\n if(l[i]<js):\n j+=1\n print(j,end=\" \")\nprint()\n \t \t\t\t \t \t\t\t \t\t\t \t\t\t \t \t\t", "class student:\r\n def __init__(self,x,y,z):\r\n self.rating=x\r\n self.position=y\r\n self.vi_tri=z\r\nn=int(input())\r\nmax=2001\r\nm=list(map(int, input().split()))\r\na=[]\r\nfor i in range (len(m)):\r\n x=student(m[i],i,i)\r\n a.append(x)\r\na.sort(key=lambda student:student.rating)\r\nmax=a[len(a)-1].rating\r\np=1\r\nt=0\r\nfor i in range (len(a)-1,-1,-1):\r\n t+=1\r\n if a[i].rating!=max:\r\n max=a[i].rating\r\n p=t\r\n a[i].position = p\r\na.sort(key=lambda student:student.vi_tri)\r\nfor i in range (len(a)):\r\n print(a[i].position, end=\" \")", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = []\r\nfor i in range(n):\r\n count = 0\r\n for j in range(n):\r\n if i != j:\r\n if a[i] < a[j]:\r\n count += 1\r\n \r\n ans.append(1 + count)\r\n\r\nprint(\" \".join(map(str,ans)))", "N=int(input())\nli=[int(i) for i in input().split()]\nfor i in range(N):\n count=0\n for j in range(N):\n if(li[j]>li[i]):\n count+=1\n count+=1\n print(count,end=\" \")\n\t\t \t \t\t \t\t\t \t\t \t \t", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl2 = sorted(l)[::-1]\r\nfor x in l:\r\n\tprint(l2.index(x) + 1, end = ' ')\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\np = {}\r\n\r\nfor n in A:\r\n if p.get(n):\r\n pass\r\n else:\r\n p[n] = len(list(filter(lambda x: x > n, A)))\r\n\r\nprint(\" \".join(map(lambda n: str(p[n] + 1), A)))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nstore=0\r\nserial=1 \r\ncount=1 \r\ndic={}\r\ni=n-1\r\nwhile i>=0:\r\n if store!=b[i]:\r\n store=b[i] \r\n dic[b[i]]=serial\r\n count=serial\r\n serial+=1 \r\n elif store==b[i]:\r\n serial+=1\r\n i-=1\r\nfor i in range(n):\r\n print(dic[a[i]],'',end='')", "n=int(input())\nl=list(map(int,input().split()))\nfor i in l:\n c=0\n for j in l:\n if j>i:\n c+=1\n else:\n pass\n print(c+1,end=\" \")\n \t \t \t\t\t \t \t\t \t \t\t\t \t \t\t", "# your code goes here\nt=int(input())\ns=list(map(int,input().split()))\nfor i in range(len(s)):\n\ta=[j for j in s if(j>s[i])]\n\tprint(len(a)+1,end=\" \")\n\t\t\t \t \t\t\t\t\t\t\t \t \t\t\t\t\t \t \t\t \t", "N=int(input())\nl=list(map(int, input().split()))\no=sorted(l,reverse=True)\nfor i in range(N):\n print(o.index(l[i])+1,end=\" \")\n\t\t\t\t \t\t \t\t\t \t\t \t \t\t\t \t \t", "n = int(input())\nst = list(map(int, input().strip().split()))\n\nstuds = [None] + st\n\nranks = []\n\nfor i in range(1, len(studs)):\n above = 0\n for j in range(1, len(studs)):\n if studs[j] > studs[i]:\n above += 1\n\n ranks.append(above+1)\n\nprint(' '.join(map(str, ranks)))\n", "n = int(input())\r\npoints = list(map(int,input().split()))\r\n\r\nrate = [1] * n\r\n\r\nfor i in range(n):\r\n count = 0\r\n for j in range(n):\r\n if points[i]<points[j]:\r\n count += 1\r\n rate[i] += count\r\n\r\nfor i in rate:\r\n print(i,end=' ')", "# your code goes here\nn = int(input())\nl = list(map(int,input().split()))\nres = list(sorted(l,reverse = True))\nr = []\nfor i in range(len(l)):\n\tr.append((res.index(l[i]))+1)\nprint(*r)\n\t \t\t \t\t\t\t \t \t \t \t\t\t\t\t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a, reverse = True)\r\nnum = [0] * (2010)\r\n\r\nfor i in range(n): \r\n if num[b[i]] == 0: \r\n num[b[i]] = i + 1\r\n\r\nfor i in range(n):\r\n print(num[a[i]])\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = sorted(a.copy())[::-1]\r\nfor i in range(n):\r\n print(b.index(a[i]) + 1, end = ' ')\r\n \r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\nH = 0\r\nSL = sorted(L, reverse=True)\r\nD = {SL[0]: 1}\r\nfor i in range(1, n):\r\n D[SL[i]] = SL.index(SL[i])+1\r\nfor i in range(n):\r\n print(D[L[i]], end=' ')\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor x in a:\r\n ans = 1\r\n for y in a:\r\n if x < y:\r\n ans += 1\r\n print(ans, end=\" \")", "n = int(input())\na = []\nfor i,j in enumerate(map(int,input().split())):\n\ta.append((j,i))\na.sort(reverse = True)\nans = [0]*(n)\nd = -1\nfor i in range(n):\n\tif d != a[i][0]:\n\t\tans[a[i][1]] = i+1\n\t\tk = i\n\t\td = a[i][0]\n\telse:\n\t\tans[a[i][1]] = k+1\nprint(*ans)\n \t\t\t \t \t\t\t\t \t \t\t\t\t\t\t\t \t \t", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nl = [0]*2001\r\n\r\nsortedArray = sorted(array, reverse=True)\r\n\r\nfor i in range(0, len(sortedArray)):\r\n\tif (l[sortedArray[i]] == 0):\r\n\t\tl[sortedArray[i]] = i+1\r\n\r\nfor i in range(0, len(array)):\r\n\tprint(l[array[i]],end=\" \")\r\n\r\n", "def cnt(arr, value):\n return len(list(filter(lambda x: x > value, arr)))\n\nn = int(input())\na = list(map(int, input().split(\" \")))\na = list(map(lambda x:1 + cnt(a, x), a))\nprint(*a)\n", "def get_value():\n count = int(input())\n ratings = [int(num) for num in input().split()]\n result = []\n\n for rating in ratings:\n result.append(str(sum(num > rating for num in ratings) + 1))\n\n return ' '.join(result)\n\nif __name__ == '__main__':\n print(get_value())\n", "student_count = int(input())\nratings = list(map(int, input().split()))\n\nordered_ratings = list(sorted(ratings, reverse=True))\n\n# 3 5 3 4 5\n# 5 5 4 3 3\n\nrating_hash = {}\ncount = 0\nfor i in range(0, len(ordered_ratings)):\n if ordered_ratings[i] not in rating_hash:\n rating_hash[ordered_ratings[i]] = i + 1\n\nfor i in range(0, len(ratings)):\n if ratings[i] in rating_hash:\n ratings[i] = rating_hash[ratings[i]]\n\nprint(\" \".join(str(x) for x in ratings))", "import bisect\n\n\nN = int(input())\nA = list(map(int, input().split()))\nA_sorted = sorted(A)\n\nans = []\nfor a in A:\n right = bisect.bisect_right(A_sorted, a)\n ans.append(N - right + 1)\nprint(\" \".join(map(str, ans)))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\ts=0\r\n\tfor j in range(n):\r\n\t\tif a[i]<a[j]:\r\n\t\t\ts+=1\r\n\r\n\tb.append(s+1)\r\nprint(*b)", "rajesh = input()\nmy_lst = list(map(int, input().split()))\nfor ele in my_lst:\n count = [value for value in my_lst if value > ele]\n print(len(count)+1, end = \" \")\n \t \t\t\t \t \t \t\t\t\t\t \t\t \t \t", "n=input()\nl=list(map(int,input().split()))\na=l.copy()\nl.sort(reverse=True)\nfor x in a:\n print(l.index(x)+1)\n \t \t\t\t \t\t\t \t \t\t\t\t \t\t\t \t \t", "t=int(input())\nl=list(map(int, input().split()))\na=sorted(l,reverse=True)\nfor i in range(t):\n\tprint(a.index(l[i])+1,end=' ')\n \t\t \t \t\t \t \t \t\t \t \t \t \t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nnew_list = arr.copy()\r\nans = \"\"\r\nfor a in range(n):\r\n ans+=str(1+sum(x > new_list[a] for x in arr))+\" \"\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nresult = [1]*n\r\nsave = {}\r\nfor i in range(n) :\r\n if save.get(l[i]) :\r\n result[i] = save.get(l[i])\r\n continue\r\n for j in range(n) :\r\n if l[i] < l[j] :\r\n result[i] += 1\r\n save[l[i]] = result[i]\r\nprint(*result)", "n = int(input())\r\narr = (list(map(int,input().split())))\r\narr2 = sorted(arr)\r\ndic = {}\r\nfor i in arr2:\r\n if i not in dic:\r\n dic[i] = 1\r\n else:\r\n dic[i] += 1\r\ns = 0\r\ndic2 = {}\r\nfor i in dic:\r\n s += dic[i]\r\n dic2[i] = n-s+1\r\nfor j in arr:\r\n print(dic2[j],end=' ')", "n=int(input())\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\ns=list(set(t))\r\ns.sort()\r\n\r\n\r\np=[]\r\n\r\nfor i in range(len(s)):\r\n p.append(t.count(s[i]))\r\n\r\n\r\nfor k in range(len(t)):\r\n print(1+sum(p[s.index(t[k])+1:]),end=' ')\r\n\r\n\r\n", "#!/usr/bin/env python3\n\"\"\"\nCodeforces\n551 A. GukiZ and Contest\n\n@author yamaton\n@date 2015-08-04\n\"\"\"\n\n\ndef solve(xs):\n return [sum(1 for y in xs if y > x) + 1 for x in xs]\n\n\ndef main():\n n = int(input())\n xs = [int(i) for i in input().strip().split()]\n assert len(xs) == n\n result = solve(xs)\n print(' '.join(str(n) for n in result))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input()); d = {}; k = 0; r = []\r\nl = list(map(int,input().split()))\r\nfor i in sorted(set(l),reverse=True):\r\n d[i] = 1 + k\r\n k += l.count(i)\r\nfor i in l:\r\n r.append(d[i])\r\nprint(\" \".join(map(str,r)))", "s=int(input())\nl=list(map(int,input().split()))[:s]\nfor x in l:\n\tprint(sorted(l)[::-1].index(x)+1,end=\" \")\n \t\t \t \t\t \t \t\t\t \t \t\t \t\t \t", "class student:\r\n def __init__(self, id, rate):\r\n self.id = id\r\n self.rate = rate\r\n self.rank = 0\r\n\r\ndef __init():\r\n n = int(input())\r\n a = input()\r\n a = a.split(\" \")\r\n for i in range(n):\r\n a[i] = int(a[i])\r\n return a, n\r\n\r\ndef solve(a, n):\r\n ans = []\r\n for i in range(n):\r\n ans.append(student(i, a[i]))\r\n ans.sort(key = lambda student:student.rate, reverse = True)\r\n \r\n ans[0].rank = 1\r\n for i in range(1, n):\r\n if (ans[i].rate == ans[i - 1].rate):\r\n ans[i].rank = ans[i - 1].rank\r\n else:\r\n ans[i].rank = i + 1\r\n ans.sort(key = lambda student:student.id)\r\n for i in range(n):\r\n print(ans[i].rank, end = \" \")\r\n\r\na, n = __init()\r\nsolve(a, n)\r\n \r\n", "n=input()\r\nl=list(map(int,input().split()))\r\nl1 = sorted(l)[::-1]\r\nfor x in l: print(l1.index(x)+1, end = \" \")", "import sys\r\nn=int(input())\r\na=[int(i) for i in input().split(\" \")]\r\nmaks=max(a)\r\nb=[]\r\nc=[]\r\nsumma=1\r\nfor i in range(maks+1):\r\n b.append(0)\r\nfor i in range(n):\r\n c.append(0)\r\nfor i in a:\r\n b[i]+=1\r\nfor i in range(maks+1):\r\n for j in range(n):\r\n if maks-i==a[j]:\r\n c[j]=summa\r\n summa+=b[maks-i]\r\nfor i in range(n):\r\n if i<n-1:\r\n print(c[i],end=' ')\r\n else:\r\n print(c[i],end='')\r\n", "n=int(input())\ns=list(map(int,input().split()))\ns1=sorted(s,reverse=True)\ni=0\nfor j in s:\n print(s1.index(j)+1,end=\" \")\n \t\t\t \t \t\t\t \t\t \t \t\t\t\t\t\t\t", "n = int(input())\r\na = [-int(i) for i in input().split()]\r\nb = 1\r\nc = 1\r\nd = {}\r\ne = a[:]\r\n\r\na.sort()\r\nd[a[0]] = 1\r\nfor i in range(1, n):\r\n if a[i] > a[i - 1]:\r\n b += c\r\n c = 1\r\n else:\r\n c += 1\r\n d[a[i]] = b\r\n\r\nfor i in e:\r\n print(d[i], end = ' ')\r\n\r\n \r\n", "a=int(input())\r\nf=\"\"\r\nb=list(map(int,input().split()))\r\nfor r in b:\r\n d=1\r\n for i in b:\r\n if(r<i):\r\n d+=1\r\n f=f+str(d)+\" \"\r\nprint(f)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = {}\r\nb = sorted(a, reverse=True)\r\nfor i, v in enumerate(b):\r\n if v not in s:\r\n s[v] = i+1\r\n\r\nans = [s[i] for i in a]\r\nprint(*ans)\r\n", "n=int(input())\nx=list(map(int,input().split()))\nb=sorted(x)\nfor i in range(n):\n c=0\n for j in range(n):\n if(x[j]>x[i]):\n c=c+1\n print(c+1,end=\" \")\n\t\t \t \t \t\t \t\t\t \t \t \t \t \t", "rating = [0]*2001\nn = int(input())\nR = list(map(int, input().split()))\n\nfor r in R:\n rating[r] += 1\nrank = 1\nratingRank = [0]*2001\nfor i in range(2000, -1, -1):\n ratingRank[i] = rank\n rank += rating[i]\nprint(*[ratingRank[r] for r in R])\n\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# So lan xuat hien\r\nm = [0]*2001\r\nfor i in a:\r\n\tm[i] += 1\r\n# print(m[:10:])\r\nfor i in a:\r\n\tprint(1+sum(m[i+1::]), end = \" \")", "n=int(input());l=list(map(int,input().split()));d={};r=sorted(l,reverse=True)\r\nfor i in range(n):\r\n\tif r[i] not in d:d[r[i]]=i+1\r\nfor i in l:print(d[i]) ", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=sorted(x)[::-1]\r\ndic={}\r\nfor i in range(len(y)):\r\n if y[i] not in dic.keys():\r\n dic[y[i]]=i+1\r\nfor i in x:\r\n print(dic[i],end=\" \")\r\n", "def contestPlacement(arr):\r\n result = []\r\n for i in range(len(arr)):\r\n higherScores = 0\r\n for j in range(len(arr)):\r\n if arr[i] < arr[j]:\r\n higherScores += 1\r\n result.append(1 + higherScores)\r\n return result\r\n \r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nprint(*contestPlacement(nums))", "R = lambda : list(map(int, input().split()))\r\n\r\nn = int(input())\r\n\r\na = R()\r\n\r\nfor i in a:\r\n s = [j for j in a if j > i]\r\n cnt = len(s)\r\n print(cnt + 1, end=' ')\r\n", "n=int(input())\nl=list(map(int,input().split()))[:n]\n# print(l)\nnew=[]\nfor i in l:\n new.append(i)\n# print(new)\nnew.sort() \nnew.reverse() \nnew.insert(0,0)\n# print(new)\nfor j in l:\n for k in new:\n if(j==k):\n print(new.index(j), end=\" \")\n break\n\t \t\t \t\t\t\t\t \t \t \t \t\t\t \t \t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = 2023\r\nx = [[] for _ in range(m)]\r\nfor i in range(n):\r\n x[a[i]].append(i)\r\nans = [0] * n\r\nu = 1\r\nfor y in x[::-1]:\r\n for i in y:\r\n ans[i] = u\r\n u += len(y)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nfreq = 2000 * [0]\r\nfor j in range(n):\r\n freq[nums[j] - 1] += 1\r\nref, pos = 2000 * [0], 1\r\nfor j in range(1999, -1, -1):\r\n if freq[j] > 0:\r\n ref[j] = pos\r\n pos += freq[j]\r\nfor j in range(n):\r\n print(ref[nums[j] - 1], end = ' ')\r\n", "x = int(input())\nl = list(map(int, input().split()))\nk = [-1]*x\nc = 1\na = 999999\nwhile(a>0):\n\ta = max(l)\n\tb = 0\n\tfor i in range(len(l)):\n\t\tif(l[i]==a and k[i]==-1):\n\t\t\tk[i] = c\n\t\t\tb += 1\n\t\t\tl[i]=-1\n\tc+=b\nprint(*k)\n \t \t \t \t \t\t\t \t \t \t", "n=int(input())\r\na=[int(a) for a in input().split()]\r\ncount=0\r\nb=[]\r\nfor i in range(n):\r\n count=0\r\n for j in range(n):\r\n if a[i]<a[j]:\r\n count+=1\r\n b.append(count+1)\r\nprint(*b)", "n=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n c=0\r\n for j in b:\r\n if j>i:\r\n c+=1\r\n else:\r\n pass\r\n print(c+1,end=\" \")\r\n ", "# đọc vào dữ kiện của đề\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\n# sort list a\r\nb_sort = sorted(a, reverse = True)\r\n\r\ndef gukiz_and_contest(n,a, b_sort):\r\n # tạo 1 list position với các phần tử đều là 1 để lưu kết quả vào\r\n # tạo biến position để đánh dấu lại vị trí\r\n position_list = [1]*n\r\n position = 1\r\n # chạy vòng lặp với mảng b đã được sort theo thứ tự giảm dần\r\n for i in range (n):\r\n # nếu là phần tử đầu tiên của mảng b_sort thì sẽ có kết quả là vị trí 1, không cần cập nhật vì ban đầu list positon đc tạo ra toàn là số 1 hoặc phần tử sau = phần tử trước cũng không cần cập nhật.\r\n if i == 0 or b_sort[i] == b_sort[i-1]:\r\n continue\r\n # tất cả cập nhật đều làm ở bước này:\r\n # lặp qua list a ban đầu, những chỗ nào trong a giống với b_sort[i] thì có cùng vị trí nên ta lặp đến hết dãy chỗ nào giống thay vào.\r\n else:\r\n position = i+1\r\n pointer_a = 0\r\n while pointer_a < n:\r\n if a[pointer_a] == b_sort[i]:\r\n position_list[pointer_a] = position\r\n pointer_a += 1\r\n return position_list\r\n\r\nresult = gukiz_and_contest(n,a,b_sort)\r\nfor x in result:\r\n print(x, end=\" \")\r\n\r\n\r\n ", "N=int(input())\nL=list(map(int, input().split()))\na=sorted(L,reverse=True)\nfor i in range(N):\n print(a.index(L[i])+1,end=' ')\n\t \t\t \t\t\t\t \t\t\t\t\t\t\t \t \t\t \t", "\r\ndef rank (n, student):\r\n\r\n # new_li = li st()\r\n for i in range(n):\r\n stu = student[i]\r\n count = 0\r\n for s in student:\r\n if s > stu:\r\n count += 1\r\n # new_li.insert(i, count+1)\r\n print(count+1, end = ' ')\r\n # return new_li\r\n \r\n\r\ndef main ():\r\n n = int(input())\r\n student = list()\r\n student = list(map(int, input().split(' ')))\r\n # student = input().split(' ')\r\n # student = map(int, student)\r\n\r\n rank(n, student)\r\n # print(rank(n, student))\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)\r\nfor i in range(len(a)):\r\n print(len(b[b.index(a[i]):len(b)])-a.count(a[i])+1,end=' ')", "from collections import Counter\r\ninput()\r\narr=list(map(int,input().split(\" \")))\r\nfre=Counter(arr)\r\nsortedItems=sorted(fre,reverse=True)\r\nstartPosition=1\r\nresult={}\r\nfor item in sortedItems:\r\n result[item]=startPosition\r\n startPosition+=fre[item]\r\nfor item in arr:\r\n print(result[item], end=' ')", "nab = [int(x) for x in input().split()]\nn = nab[0]\narr = [int(x) for x in input().split()]\nbrr = sorted(arr,key =lambda x:x)\ntemp =[0]*2001\ncnt =0\nwhile brr:\n\tcnt+=1\n\tx = brr.pop()\n\tif temp[x]==0:\n\t\ttemp[x] =cnt\n\t\t\t\nresult =[]\n\nfor e in arr:\n\tresult.append(temp[e])\n# print(result)\t\nprint(\" \".join([str(x) for x in result]))\t", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\ny = sorted(x,reverse=True)\r\nl = []\r\nfor i in x:\r\n k = y.index(i) + 1\r\n l.append(k)\r\n\r\nprint(*l)", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = []\r\nfor i in range(len(a)):\r\n s = 0\r\n for j in range(len(a)):\r\n if (i != j):\r\n if (a[j] > a[i]):\r\n s = s + 1\r\n c.append(1+s)\r\nprint(*c)", "test=1\nfor i in range(test):\n n=int(input())\n lst =[int(i) for i in input().split()]\n for i in range(0,n):\n ans=0\n for j in range(0,n):\n if lst[i]>=lst[j]:continue\n else:ans+=1\n ans+=1\n print(ans,end=\" \")\n\n\t\t\t \t\t\t\t \t \t \t\t \t \t\t \t\t\t", "from sys import stdin\nn = int(stdin.readline())\nl = list(map(int, stdin.readline().split()))\nfor x in l:\n print(sorted(l, reverse = True).index(x) + 1, end = \" \")\n\t \t \t \t \t \t \t \t \t \t \t", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\na = list(map(int, stdin.readline().split()))\r\nsorted_a = sorted(a, reverse=True)\r\n \r\nfor mark in a:\r\n \tstdout.write(str(sorted_a.index(mark) + 1) + ' ')\r\n\r\n", "class Student:\r\n id = 0\r\n rating = 0\r\n rank = 0\r\n def __init__(self, id, rating, rank):\r\n self.id = id \r\n self.rating = rating\r\n self.rank = rank\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nst = b = []\r\nfor i in range(n):\r\n st.append(Student(i, a[i], 0))\r\n \r\nst.sort(key = lambda Student: Student.rating, reverse = True)\r\ncnt = 1\r\nst[0].rank = 1\r\nfor i in range(1, n):\r\n if st[i].rating == st[i-1].rating:\r\n st[i].rank = st[i-1].rank\r\n cnt += 1\r\n else:\r\n st[i].rank = st[i-1].rank + cnt\r\n cnt = 1\r\n\r\nst.sort(key = lambda Student: Student.id)\r\nfor i in range(n):\r\n print(st[i].rank, end = ' ')", "def contest():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n\r\n for i in range(n):\r\n c = 0\r\n for j in range(n):\r\n if l[i] < l[j]:\r\n c += 1\r\n print(1+c, end=' ')\r\n\r\n\r\nif __name__ == '__main__':\r\n contest()", "n=eval(input())\r\nArray=list(map(int, input().split()))\r\ns=sorted(range(len(Array)),key=lambda k:Array[k])\r\nArray_sort=sorted(Array,reverse=True)\r\n\r\ntemp=Array_sort[0]\r\ncount=1\r\nresult=[]\r\nfor i in range(0,n):\r\n if Array_sort[i] != temp:\r\n count = i+1\r\n result.append(count)\r\n temp=Array_sort[i]\r\n else:\r\n result.append(count)\r\nresult1=[0]*n\r\ncount1=0\r\nfor item in s:\r\n result1[item]=result[n-count1-1]\r\n count1+=1\r\nprint(*result1)", "n = int(input())\nl = [int(x) for x in input().split()]\nli = []\nfor i in l:\n\ta = 1\n\tfor j in l:\n\t\tif(j > i):\n\t\t\ta += 1\n\tli.append(a)\nprint(*li)\n\t\t\t\n \t \t \t \t \t\t\t\t \t\t \t \t\t\t\t \t", "n = int(input())\r\nr = list(map(int, input().split(' ')))\r\nsr = list(reversed(sorted(r)))\r\npp = []\r\nfor rr in r:\r\n pp.extend([sr.index(rr)+1]*1)\r\nprint(*pp)\r\n", "n=int(input())\r\n\r\nz=list(map(int,input().split()))\r\n\r\ny=[]\r\n\r\nfor i in z :\r\n y.append(i)\r\n\r\ny.sort(reverse=True)\r\n\r\nfor i in range(n) :\r\n if i==n-1 :\r\n print(y.index(z[i])+1)\r\n else :\r\n print(y.index(z[i])+1,end=\" \")", "n = int(input())\r\nl = list(map(int, input().split()))\r\nw = []\r\nfor i in range(n):\r\n c = 1\r\n for j in range(n):\r\n if l[j] > l[i]:\r\n c += 1\r\n w.append(c)\r\nprint(*w)", "def calculate_positions(ratings):\r\n # Create a list of tuples (rating, index) to keep track of the original indices\r\n ratings_with_indices = [(rating, index) for index, rating in enumerate(ratings, 1)]\r\n\r\n # Sort the ratings in descending order\r\n ratings_with_indices.sort(reverse=True)\r\n\r\n # Initialize the positions list with 1, as all students initially have the same position\r\n positions = [1] * len(ratings)\r\n\r\n # Assign positions based on sorted ratings\r\n for i in range(1, len(ratings_with_indices)):\r\n if ratings_with_indices[i][0] < ratings_with_indices[i - 1][0]:\r\n positions[ratings_with_indices[i][1] - 1] = i + 1\r\n else:\r\n positions[ratings_with_indices[i][1] - 1] = positions[ratings_with_indices[i - 1][1] - 1]\r\n\r\n return positions\r\n\r\n\r\n# Input\r\nn = int(input())\r\nratings = list(map(int, input().split()))\r\n\r\n# Calculate and print the positions of students\r\npositions = calculate_positions(ratings)\r\nprint(*positions)\r\n", "n = int(input())\r\n\r\na = [(int(x), i) for i, x in enumerate(input().split())]\r\n\r\na.sort(reverse = True)\r\n\r\npre_rank = 1\r\npre = a[0][0]\r\n\r\nrank = {a[0][1]:1}\r\n\r\nfor i in range(1, n):\r\n if (a[i][0] != pre):\r\n pre_rank = i + 1\r\n pre = a[i][0]\r\n rank[a[i][1]] = pre_rank\r\n\r\nfor i in range(n):\r\n print(rank[i], end = ' ')", "try:\n\tn=int(input())\n\tli=[int(x) for x in input().split()]\n\tfor i in range(n):\n\t\tsum=0\n\t\tfor j in range(n):\n\t\t\tif li[j]>li[i]:\n\t\t\t\tsum=sum+1\n\t\tsum=sum+1\n\t\tprint(sum,end=\" \")\n\t\nexcept EOFError:\n\tpass\n\t\t\t\n \t \t \t\t \t\t\t\t \t \t \t", "def inp():\r\n return map(int, input().split())\r\n\r\nn = int(input())\r\nratings = list(inp())\r\n\r\nranks = [0] * n\r\n\r\nclass Student:\r\n def __init__(self, id = 0, rating = 0):\r\n self.id = id\r\n self.rating = rating\r\n\r\n def __lt__(self, other):\r\n if (self.rating > other.rating) or (self.rating == other.rating and self.id < other.id):\r\n return True\r\n else:\r\n return False\r\n\r\nstudents = []\r\n\r\nfor i in range(n):\r\n students.append(Student(i, ratings[i]))\r\n\r\nstudents.sort()\r\n\r\nranks[students[0].id] = 1\r\n\r\nfor i in range(1, n):\r\n if students[i].rating == students[i - 1].rating:\r\n ranks[students[i].id] = ranks[students[i - 1].id]\r\n else:\r\n ranks[students[i].id] = i + 1\r\n\r\nprint(' '.join(map(str, ranks)))\r\n", "students = int(input())\nratings = list(map(int, input().split(' ')))\ndifferent_ratings = list(reversed(sorted(set(ratings))))\nrankings = {}\n\nfor i in range(len(different_ratings)):\n if i == 0:\n rankings[different_ratings[i]] = 1\n else:\n rankings[different_ratings[i]] = rankings[different_ratings[i - 1]] + ratings.count(different_ratings[i - 1])\n\npositions = []\n\nfor rating in ratings:\n positions.append(rankings[rating])\n\nprint(*positions)\n", "n = int(input())\nx = list(map(int, input().split()))\ny = x.copy(); y.sort(reverse=True)\nans = 2001 * [0]\nfor i in range(n):\n if i == 0:\n ans[y[i] - 1] = i + 1\n else:\n if y[i] == y[i - 1]:\n continue\n else:\n ans[y[i] - 1] = i + 1\nfor j in range(n):\n print(ans[x[j] - 1], end=' ')\n", "N, A = input(), list(map(int,input().split()))\r\nprint(*[1 + sum(X<Y for Y in A) for X in A])", "n = int(input()) \r\na = [int(i) for i in input().split()]\r\nm = sorted(a, reverse=True) \r\nfor i in a:\r\n print(len(m[:m.index(i)+1]), end=\" \") ", "n=int(input())\r\nx=input().split()\r\nfor i in range(n):\r\n x[i]=int(x[i])\r\ny=x.copy()\r\ny.sort(reverse=True)\r\nfor j in range(n):\r\n print(y.index(x[j])+1,end=' ')", "class Student:\r\n def __init__(self, id, mark):\r\n self.id = id \r\n self.mark = mark\r\n \r\n \r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nstudents = []\r\nfor i in range(0, n):\r\n temp = Student(i, v[i]) \r\n students.append(temp)\r\nstudents = sorted(students, key=lambda student: student.mark, reverse=True)\r\n\r\nranks = [0] * n\r\n\r\nranks[students[0].id] = 1 \r\nfor i in range(1, n):\r\n if (students[i].mark == students[i-1].mark): \r\n ranks[students[i].id] = ranks[students[i-1].id]\r\n else:\r\n ranks[students[i].id] = i + 1\r\n \r\nprint(*ranks)", "#!/bin/python3\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nfor i in arr:\r\n rank = 1\r\n for j in arr:\r\n if j > i:\r\n rank += 1\r\n print(rank, end=\" \")\r\n ", "l= int(input())\nn = list(map(int,input().split()))\nfor i in range(len(n)):\n c = [j for j in n if(j>n[i])]\n#print\n print(len(c)+1,end=\" \")\n \t \t \t \t\t \t\t \t\t\t \t \t \t", "n = int(input())\r\nratings = list(map(int, input().split()))\r\nfinal = []\r\nfor i in range(n):\r\n s = 1\r\n for j in range(n):\r\n if ratings[j] > ratings[i]:\r\n s += 1\r\n \r\n final.append(s)\r\nprint(*final, sep=\" \")", "R = lambda : [int(x) for x in input().split()]\r\nRn = lambda : int(input())\r\nE = enumerate\r\nn = Rn()\r\na = R()\r\nb = sorted([(v,i) for i,v in E(a)],reverse=True)\r\nc = [0]*n\r\nc[0] = 0\r\nfor i in range(1,len(c)):\r\n if b[i][0] == b[i-1][0]:\r\n c[ b[i][1] ] = c[ b[i-1][1] ] \r\n else:\r\n c[ b[i][1] ] = i\r\nfor a in c:\r\n print(a+1,end=' ')", "x = int(input())\r\nans = 1\r\narr = [*map(int, input().split())]\r\nfor i in range(x):\r\n start = 1\r\n for j in range(x):\r\n if arr[i] < arr[j]:\r\n start += 1\r\n print(start, end=\" \")\r\nprint()", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n T W TH F\r\n-1 +1 -1 +1\r\n\r\n1 2 \r\n3 4\r\n\r\nall f1 same = 1\r\n\r\n\r\ndict of numbers [1,n] -> [set number 1, set2, etc.]\r\n\r\n[]\r\n[1]\r\n[2]\r\n[1,2]\r\n[3]\r\n[1,3]\r\n[2,3]\r\n[1,2,3]\r\nhorz line -> same y coordinates\r\n\r\nat the end everythhing has to become 1\r\n\r\nif sum(a) - n is odd -> err\r\n\r\nelse -> mao\r\n\r\n2 4 2 1 -> 9\r\n5 total to remove\r\n\r\ne -> 4 left\r\nm -> 3 left\r\ne -> 2 left\r\nm -> 1 left\r\ne -> 0 left\r\n\r\nm loses -> e wins\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n t = II()\r\n a = LII()\r\n ratings = sorted(a)\r\n\r\n out = []\r\n for num in a:\r\n out.append(t - bisect.bisect(ratings,num) + 1)\r\n WS(out)\r\n\r\n\r\nsolve()", "n = int(input())\n\na = list(map(int,input().split()))\n\nb = sorted(a)[::-1]\nc = []\n\nfor i in a:\n\tc.append(b.index(i)+1)\n\nfor i in c:\n\tprint(i,end=' ')", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = a[:]\r\nb.sort(reverse=True)\r\nnewB = {}\r\nresult = []\r\nfor i in range(n):\r\n if (b[i] not in newB):\r\n newB[b[i]] = i + 1\r\nfor i in range(n):\r\n result.append(newB[a[i]])\r\nprint(' '.join(map(str, result)))", "def solve_GukiZ_and_Contest(N, a):\r\n \"\"\"solve the GukiZ and Contest problem.\r\n Time complexity: O(n^2)\r\n \"\"\" \r\n b = sorted(a)\r\n for i in range(N):\r\n j = N-1\r\n while j > -1 and b[j] > a[i]: j -= 1\r\n print(N-j, end = ' ')\r\nif __name__ == '__main__':\r\n N = int(input())\r\n a = list(map(int, input().split()))\r\n solve_GukiZ_and_Contest(N, a)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nlist1=[]\r\nfor i in range(n):\r\n\tcount=1\r\n\tfor j in range(n):\r\n\t\tif l[i]<l[j]:\r\n\t\t\tcount+=1\r\n\tlist1.append(count)\r\nfor x in list1:\r\n\tprint(x,end=\" \")", "if __name__ == \"__main__\":\n n = int(input())\n ratings = list(map(int, input().split()))\n counter = [0 for _ in range(2001)]\n higher = [0 for _ in range(2001)]\n\n for r in ratings:\n counter[r] += 1\n\n for i in range(1999, -1, -1):\n higher[i] += higher[i + 1] + counter[i + 1]\n\n new_ranking = [1 + higher[r] for r in ratings]\n\n print(' '.join(map(str, new_ranking)))\n", "n = int(input())\r\nli = list(map(int , input().split()))\r\nli2 = sorted(li)[::-1]\r\nfor x in li:\r\n print(li2.index(x)+1)\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = sorted(a, reverse=True)\r\nfor i in range(n):\r\n a[i] = b.index(a[i]) + 1\r\n\r\nfor i in a:\r\n print(i, end=\" \")", "N = int(input())\r\nA = list(map(int,input().split()))\r\nB = []\r\nfor i in range(N):\r\n s = 1\r\n for y in range(N):\r\n if A[y] > A[i]:\r\n s += 1\r\n B.append(s)\r\nprint(*B) ", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = 2000\r\nc = [0] * (m + 1)\r\nfor x in a:\r\n c[x] += 1\r\nk = 0\r\nfor i in range(m, -1, -1):\r\n c[i], k = k + 1, k + c[i]\r\nprint(' '.join(map(str, (c[x] for x in a))))", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nli1 = []\r\nfor i in li:\r\n li1.append(i)\r\nfor i in range(n):\r\n for j in range(n - i - 1):\r\n if li1[j] < li1[j + 1]:\r\n li1[j], li1[j + 1] = li1[j + 1], li1[j]\r\nli2 = []\r\nfor i in li:\r\n li2.append(li1.index(i) + 1)\r\nprint(*li2)", "n=int(input())\nlt=list(map(int,input().split()))\nfor i in range(n):\n sum=1\n for j in range(n):\n if lt[i]<lt[j]: sum+=1\n print(sum,end=' ')\n\t\t\t\t \t\t\t \t \t \t \t \t\t \t \t \t", "inp = input()\r\nls = list(map(int,input().split()))\r\nans = ls.copy()\r\nans.sort()\r\nfor i in ls:\r\n c = ls.count(i)\r\n pos = len(ans[ans.index(i):]) - (c-1)\r\n print(pos,end=' ')\r\n", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n# print(lst)\r\n\r\nlst_sort = sorted(lst, reverse = True)\r\n# print(lst_sort)\r\nfinal = []\r\nfor i in range(n):\r\n\tfinal.append(lst_sort.index(lst[i]) + 1)\r\nprint(*final, sep=' ')\r\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\ns=sorted(l)\r\ns=[-1]+s\r\nfor i in range(a):\r\n print(a-(s.index(l[i])+s.count(l[i])-1)+1,end=' ')", "from collections import deque\r\nfrom math import ceil,floor,sqrt,gcd\r\ndef ii(): return int(input())\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\ndef si():return input()\r\nn=ii()\r\na=li()\r\nb=a[:]\r\nb.sort(reverse=True)\r\nm={}\r\nc=1\r\nfor i in b:\r\n if i not in m:\r\n m[i]=c\r\n c+=1\r\nfor i in a:\r\n print(m[i],end=\" \")", "n=int(input())\nl=list(map(int,input().split(\" \")))\nb=set(l)\nc=list()\ncount1=[0]*(5000)\nfor i in b:\n\tcount1[i]=l.count(i)\nfor i in l:\n\ts=sum(count1[i+1:])\n\tc.append(1+s)\nprint(*c)\n \n", "class student:\r\n def __init__(self, index, point):\r\n self.index = index;\r\n self.point = point;\r\n def __lt__(self, student):\r\n return self.point < student.point\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i] = student(i, a[i])\r\na.sort(reverse=True)\r\nans=[-1]*n\r\np = 1\r\nprev = -1\r\ncnt = 0\r\nfor s in a:\r\n if (prev == -1):\r\n prev = s.point\r\n if (s.point != prev):\r\n p = p + cnt\r\n cnt = 0\r\n prev = s.point\r\n ans[s.index] = p\r\n cnt+=1\r\nfor i in range(n):\r\n print(\"{}\".format(ans[i]), end=\" \")\r\n\r\n\r\n", "def competition(lst):\r\n result = list()\r\n for i in range(len(lst)):\r\n count = 1\r\n for j in range(len(lst)):\r\n if lst[j] > lst[i]:\r\n count += 1\r\n result.append(count)\r\n return result\r\n\r\n\r\nn = int(input())\r\na = [int(j) for j in input().split()]\r\nprint(*competition(a))\r\n", "def solve(arr):\n res = []\n for i in range(len(arr)):\n pos = 0\n for j in range(len(arr)):\n if arr[j] > arr[i] and i != j:\n pos += 1 \n res.append(pos+1)\n return res\n \n\n \n\ndef main():\n n = int(input())\n arr = list(map(int, input().split(' ')))\n print(*solve(arr))\n\nmain()", "n=input()\r\nl=list(map(int,input().split()))\r\na=l.copy()\r\nl.sort(reverse=True)\r\nfor x in a:\r\n print(l.index(x)+1)", "n = int(input())\ns = [int(i) for i in input().split()]\nt = [(i, s[i]) for i in range(n)]\nt.sort(key = lambda i: i[1])\nt = t[::-1]\no = 1\nh = -1\nk = []\nfor i in t:\n if i[1] == h:\n k.append(k[-1])\n else:\n h = i[1]\n k.append(o)\n o+=1\nfor i in range(n):\n a = t[i]\n s[a[0]] = k[i]\nprint(*s)\n", "n = int(input())\r\narr_rating = list(map(int, input().split()))\r\narr_result = []\r\narr_rating_sorted = sorted(arr_rating, reverse=True)\r\nj = 0\r\nwhile j < n:\r\n for i in range(n):\r\n if arr_rating[j] == arr_rating_sorted[i]:\r\n arr_result.append(i + 1)\r\n print(i + 1, end=\" \")\r\n break\r\n j += 1\r\n\r\n", "# cook your dish here\r\nn=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\n#lst.sort()\r\ncnt=0\r\nfor i in range (n):\r\n cnt=0\r\n for j in range (n):\r\n \r\n if lst[j]>lst[i]:\r\n cnt+=1\r\n print(1+cnt,end=' ')\r\n", "n=input()\nl=list(map(int,input().split()))\nr=sorted(l)[::-1]\nfor x in l: print(r.index(x)+1)\n \t \t\t\t\t\t \t\t\t \t \t\t \t\t\t\t\t \t", "n=int(input())\r\ns=list(map(int,input().split()))\r\nl=sorted(list(s),reverse=True)\r\nd,c={},1\r\nfor i in range(len(l)):\r\n\tif l[i] not in d:\r\n\t\td[l[i]]=c\r\n\tc+=1\r\nfor i in s:\r\n\tprint(d[i],end=' ')", "input()\r\nX = list(map(int, input().split()))\r\nRate = [0 for i in range(len(X))]\r\ncount = 1\r\nSet = set(X)\r\nSet = sorted(Set, reverse=True)\r\nfor i in Set:\r\n for j in range(len(X)):\r\n if X[j] == i:\r\n Rate[j] = count\r\n count += X.count(i)\r\nprint(*Rate)\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nt = 1\r\nrank = n*[0]\r\nwhile l != n*[-1]:\r\n\t\r\n\tmx = max(l)\r\n\tlist = []\r\n\t#print(l,list,rank)\r\n\tfor i in range(n):\r\n\t\tif l[i] == mx :\r\n\t\t\tlist.append(i)\r\n\tfor i in range(len(list)):\r\n\t\trank[list[i]]=t\r\n\t\tl[list[i]] = -1\r\n\tt = t+len(list)\r\nfor i in rank:\r\n\tprint(i,end=' ')\r\n", "n=int(input())\nl=[int(x) for x in input().split()]\nnew=sorted(l,reverse = True)\nfor i in l:\n print(new.index(i)+1,end=' ')\n\n\t\t \t\t\t \t\t\t \t \t \t\t \t \t", "n = int(input())\r\narr = list(map(int,input().split()))\r\nls = sorted(arr)\r\nls.reverse()\r\nrank = []\r\nfor i in range(len(arr)):\r\n rank.append(ls.index(arr[i])+1)\r\nprint(*rank)\r\n\r\n", "n = int(input())\r\nl_r = list(map(int, input().split()))\r\nl_r_c = list(l_r)\r\nl_r_c.sort(reverse = True)\r\nd = {}\r\n\r\nt = 1\r\nfor r in l_r_c:\r\n if r not in d:\r\n d[r] = t\r\n t += 1\r\n\r\nfor r in l_r:\r\n print(d[r], end = \" \")", "n = int(input())\r\nx = input()\r\nx = x.split()\r\na = list()\r\nb = list()\r\nc = list()\r\nd = list()\r\nfor i in range(n):\r\n a.append(int(x[i]))\r\n d.append(int(x[i]))\r\nd.sort()\r\nd = d[::-1]\r\nf = \"\"\r\nfor i in range(n):\r\n b.append(d.index(a[i])+1)\r\nfor i in range(n):\r\n f+=str(b[i])+\" \"\r\nprint(f)", "# your code goes here\nn = int(input())\nl = list(map(int,input().split()))\nl1 = list(sorted(l,reverse = True))\nres = []\nfor i in range(n):\n\tres.append((l1.index(l[i]))+1)\nfor i in res:\n\tprint(i,end = \" \")\n\t\t\t \t \t \t \t\t\t\t \t\t \t\t\t \t\t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a,reverse=True)\r\nrank = [0]*2002\r\ncnt = 1\r\nrank[b[0]] = 1\r\nranking = 1\r\nfor i in range(1,n):\r\n if b[i] == b[i-1]:\r\n cnt += 1\r\n else:\r\n ranking += cnt\r\n rank[b[i]] = ranking\r\n cnt = 1\r\nfor i in range(n):\r\n print(rank[a[i]],end=\" \")", "n=input()\r\nls=list(map(int, input().split()))\r\nlsort=sorted(ls, reverse = True)\r\nfor i in ls:\r\n print(lsort.index(i)+1,end = ' ')", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nz = a\r\na = sorted(a)\r\na.reverse()\r\n\r\nfor i in range (0, n):\r\n ind = a.index(z[i])\r\n print(ind+1, end=' ')\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [i for i in sorted(a)]\r\nused = []\r\narray = []\r\nfor i in b:\r\n if i not in used:\r\n used.append(i)\r\nb = b[::-1]\r\nfor i in a:\r\n if a.count(i) == 1:\r\n print(b.index(i) + 1, end = ' ')\r\n else:\r\n if i not in [int(j.split()[0]) for j in array]:\r\n array.append(str(i) + ' ' + str(b.index(i) + 1))\r\n print(b.index(i) + 1, end = ' ')\r\n else:\r\n for j in array:\r\n if int(j.split()[0]) == i:\r\n print(j.split()[1], end = ' ')\r\n break", "n = int(input())\r\nli= list(map(int,input().split()))\r\nli1 = li.copy()\r\ns = [0]*n\r\nr = 1\r\ncount = 0\r\nwhile len(li1)>0:\r\n a = max(li1)\r\n for i in range(n):\r\n if li[i]==a:\r\n s[i] = r\r\n count+=1\r\n for i in range(count):\r\n li1.remove(a)\r\n r+=count\r\n count=0\r\nprint(*s)\r\n\r\n", "n = int(input())\nl = list(map(int, input().split()))\n\nx = len(l)\nans = []\n\nfor i in range(x):\n count = 0\n for j in range(x):\n if l[j] > l[i]: count += 1\n ans.append(str(count + 1))\n\nprint(' '.join(ans))\n", "n1=int(input())\nli=list(map(int,input().split()))\nfor i in range(n1):\n li[i]=(li[i],i)\nans=[0]*(n1)\nli.sort(reverse=True)\ny=1\nfor i in range(n1-1):\n ans[li[i][1]]=y\n if(li[i][0]!=li[i+1][0]):\n y=2+i\nans[li[n1-1][1]]=y\nprint(*ans)\n\t \t \t \t\t\t \t\t \t\t\t\t\t \t\t\t \t \t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=[]\r\nm+=l\r\nm.sort(reverse=True)\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif(l[i]==m[j]):\r\n\t\t\tprint(j+1,end=\" \")\r\n\t\t\tbreak", "n=int(input())\nl=[int(i) for i in input().split()]\nl1=sorted(l,reverse=True)\nfor i in l:\n print(l1.index(i)+1,end=\" \")\n \t \t \t\t\t \t \t\t\t \t \t \t \t \t", "n = int(input())\narr = [int(a) for a in input().split(' ')]\n\nout = ''\nfor a in arr:\n\tposition = 1\n\tfor b in arr:\n\t\tif b > a:\n\t\t\tposition += 1\n\tout += str(position) + ' '\n\nprint(out[:len(out)-1])", "n, a = int(input()), [int(i) for i in input().split()]\ncnt, sum, res = {}, 0, [1] * n\nfor i in a:\n cnt[i] = cnt.get(i, 0) + 1\nfor i in reversed(sorted(cnt.keys())):\n cnt[i], sum = sum, sum + cnt[i]\nfor i in range(n):\n res[i] += cnt[a[i]]\nprint(*res)\n", "n = int(input())\r\nlis1 = [ int(i) for i in input().split()]\r\nlis2 = []\r\nsum = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if lis1[i] < lis1[j]:\r\n sum += 1\r\n else:\r\n continue\r\n sum += 1\r\n lis2.append(sum)\r\n sum = 0\r\nfor i in range(n):\r\n print(lis2[i], end = \" \")", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, sys.stdin.readline().split()))\r\n\r\ncnt = [0] * 2002\r\nres = [0] * 2002\r\nfor i in a:\r\n cnt[i] += 1\r\n\r\nfor i in range(2000, -1, -1):\r\n cnt[i] = cnt[i] + cnt[i + 1]\r\n res[i] = cnt[i + 1] + 1\r\n\r\nans = []\r\nfor i in a:\r\n ans.append(str(res[i]))\r\n\r\nprint(\" \".join(ans))", "count = input()\nwnumbers = input().split(\" \")\nnumbers = [int(i) for i in wnumbers]\nsortNum = sorted(numbers)\nif count == 1:\n print(1)\nfor i in range(len(numbers) - 1):\n newnums = 1 + len([j for j in sortNum if j > numbers[i]])\n print(newnums, end=\" \")\nnewnums = 1 + len([j for j in sortNum if j > numbers[len(numbers)-1]])\nprint(newnums)", "n=int(input())\r\na=sorted(enumerate(map(int,input().split())),key=lambda x:-x[1])\r\nb=[0]*n\r\nc,p,l=0,0,-1\r\nfor x in a:\r\n c+=1\r\n if x[1]!=l:l=x[1];p=c\r\n b[x[0]]=p\r\nprint(*b)", "n = int(input())\r\narr = list(map(int, input(). split()))\r\nq = 0\r\nt = sorted(arr)\r\nt = t[::-1]\r\nfor i in arr:\r\n for j in range(n):\r\n if t[j] == i:\r\n q = (j + 1)\r\n break\r\n print(q, end = ' ')\r\n", "#guhiz and contest\na=int(input())\ns=list(map(int,input().split()))\narr=[]\nfor i in s:\n count=0\n for j in s:\n if i<j:\n count+=1\n arr.append(count+1)\nprint(*arr)\n \t \t\t \t \t\t\t \t\t \t\t \t \t", "def bubble_sort(lst):\r\n for step in range(len(lst)):\r\n for i in range(0, n-step-1):\r\n if lst[i] < lst[i+1]:\r\n temp = lst[i]\r\n lst[i] = lst[i+1]\r\n lst[i+1] = temp\r\n return lst\r\n \r\ndef adjust(lst):\r\n pos_list = list(range(1, len(lst)+1))\r\n for i in range(len(lst)-1):\r\n if lst[i] == lst[i+1]:\r\n pos_list[i+1] = pos_list[i]\r\n return pos_list\r\n \r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nlst_copy = lst.copy() # get a copy of original list for sorting\r\nlst_copy = bubble_sort(lst_copy) # sort from greatest to smallest\r\npos_list = adjust(lst_copy) # generate the list of indexes\r\ndict_pos = {key:val for (key, val) in zip(lst_copy, pos_list)} # zip the two lists\r\nfor element in lst:\r\n print(dict_pos[element], end=' ')", "n,l =int(input()),list(map(int,input().split()))\r\nt=sorted(l,reverse=True)\r\nfor i in l:\r\n print(t.index(i)+1)", "import collections\r\n\r\ndef main():\r\n \r\n n = int(input())\r\n \r\n arr = list(map(int, input().split()))\r\n \r\n pair = collections.namedtuple('pair', ['id', 'score'])\r\n \r\n for i in range(n):\r\n arr[i] = pair(i, arr[i])\r\n \r\n arr.sort(key = lambda x: x.score, reverse = True)\r\n \r\n res = [0] * n\r\n \r\n res[arr[0].id] = 1\r\n \r\n for i in range(1, n):\r\n res[arr[i].id] = res[arr[i - 1].id]\r\n if arr[i].score != arr[i - 1].score:\r\n res[arr[i].id] = i + 1\r\n \r\n for i in res:\r\n print(i, end = ' ')\r\n \r\n\r\nif __name__ == \"__main__\": main()", "n = int(input())\r\na = list(map(int, input().split()))\r\nscore = a.copy()\r\nscore.sort(reverse=True)\r\nfor i in a:\r\n print(score.index(i)+1, end=\" \")\r\n", "n1 = int(input())\r\nx = input().split()\r\nlist1 = []\r\nfor j in x:\r\n list1.append(int(j))\r\nlist2 = []\r\n\r\nfor i in range(len(list1)):\r\n count = 0\r\n for j in range(len(list1)):\r\n if j != i and list1[j] > list1[i]:\r\n count+=1\r\n list2.append(count+1)\r\n\r\nprint(*list2)\r\n \r\n ", "n=int(input())\na=list(map(int,input().strip().split()))[:n]\nb=[]\nfor i in range(n):\n b.append(0)\nc=1\ny=0\nfor i in range(n):\n x=max(a)\n y=0\n for j in range(0,n):\n if x==a[j]:\n y=y+1\n b[j]=c\n a[j]=-1\n c = c + y\n if c>n:\n break\nfor i in b:\n print(i,end=\" \")\n\t \t\t\t \t\t\t\t\t\t \t\t\t\t \t \t \t\t\t \t \t", "n = int(input())\n\ndict_data = {}\narray = [int(data) for data in input().split(' ')]\n\ndata = [None] * n\n\nposition = 1\n\nfor i in range(0, n):\n my_max = max(array)\n \n if my_max in dict_data:\n data[array.index(my_max)] = dict_data[my_max]\n else:\n data[array.index(my_max)] = position\n dict_data[my_max] = position\n \n array[array.index(my_max)] = -1\n position += 1\n \nprint(' '.join(str(info) for info in data))\n", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\n\r\nn = int(input())\r\nls = list(map(int, input().split()))\r\n\r\nd=dict()\r\nfor c in ls:\r\n\tif c in d: d[c]+=1\r\n\telse: d[c]=1\r\n\r\ncor=dict()\r\npos=1\r\nfor item in sorted(d.items(),reverse=True):\r\n\tcor[item[0]]=pos\r\n\tpos+=item[1]\r\n\r\nprint(*(map(lambda x: cor[x], ls)))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=[0]*2001\r\nfor x in l: e[x]+=1\r\nm=[1]*2001\r\nfor i in range(2000)[::-1]: m[i]=m[i+1]+e[i+1]\r\nprint(' '.join([str(m[x]) for x in l]))\r\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn = int(input())\r\nq = [int(x) for x in input().split()]\r\ns = sorted(q, reverse = True)\r\nans = [s.index(x)+1 for x in q]\r\nprint(\" \".join(map(str, ans)))\r\n", "n, inpt = int(input()), list(map(int, input().split()))\r\nif n > 1:\r\n a = [[inpt[i]]+[i] for i in range(0, n)]\r\n a.sort(key=lambda x:-x[0])\r\n r = [0 for i in range(n)]\r\n t = 1\r\n for i in range(0, n-1):\r\n r[a[i][1]] = t\r\n if a[i+1][0] < a[i][0]:\r\n t = i+2\r\n \r\n r[a[-1][1]] = t\r\n print(*r)\r\nelse:\r\n print(1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nlsa = list(set(a))\r\nlsa.sort(reverse=True)\r\nd = {}\r\nd[lsa[0]] = 1\r\nt = 1\r\nfor i in range(1, len(lsa)):\r\n t += a.count(lsa[i - 1])\r\n d[lsa[i]] = t\r\nfor i in range(n):\r\n print(d[a[i]], end=' ')\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\nn = int(input())\nA = [int(i) for i in input().split()]\n\nstart = time.time()\n\nfor i in range(n):\n print(1 + sum([ 1 for j in A if j > A[i]]), end=' ')\nprint()\n\nfinish = time.time()\n#print(finish - start)\n", "n = int(input())\nstudents = list(map(int, input().split()))\nfor i in range(n):\n c = 1\n for j in range(n):\n if i == j:\n continue\n if students[j] > students[i]:\n c += 1\n print(c, end=\" \")\nprint()\n", "n = int(input())\nrates = [(i,int(s),0) for i,s in zip(range(n),input().split())]\nrates = [([r], s[0], s[1]) for (r, s) in zip(range(1, n+1), sorted(rates, key=lambda s: s[1], reverse=True))]\nfor i in range(n-1):\n if rates[i][2] == rates[i+1][2]:\n rates[i+1][0][0] = rates[i][0][0]\nfor (r, i, s) in sorted(rates, key=lambda s: s[1]):\n print(r[0], end=' ')", "#Codeforce Homework Day 3\r\n#GukiZ\r\nn = int(input(''))\r\nlst = list(map(int, input('').split()))\r\nsorted_lst = sorted(lst)\r\nnew_lst = list()\r\nfor i in range(0,len(lst)):\r\n count = 0\r\n for j in range(len(sorted_lst)-1,-1,-1):\r\n if lst[i] < sorted_lst[j]:\r\n count += 1\r\n else:\r\n break\r\n new_lst.append(1+count)\r\nfor item in new_lst:\r\n print(item, sep = ' ', end = ' ')\r\n \r\n", "N=int(input())\nli=list(map(int, input().split()))\nf=sorted(li,reverse=True)\nfor i in range(N):\n print(f.index(li[i])+1,end=' ')\n\t\t \t\t\t \t \t\t\t \t \t \t \t \t", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd={}\r\nfor i in range(len(l)):\r\n c=0\r\n for j in range(len(l)):\r\n if l[j]>l[i]:\r\n c+=1\r\n if l[i] not in d:\r\n d[l[i]]=c+1\r\nfor i in l:\r\n print(d[i],end=\" \")", "t = 1\na = []\ninput()\nv = list(map(int, input().split()))\nc = max(v)\nd = {}\nd[c] = 1\nw = 0\nfor x in sorted(v, reverse=True):\n if x < c:\n d[x] = 1 + w\n c = x\n w += 1\nprint(*[d[x] for x in v])\n", "t = int(input())\r\n\r\na = input()\r\nans = \"\"\r\na = [int(x) for x in a.split()]\r\nnewa = sorted(a)\r\nnewa = newa[::-1]\r\nch = []\r\ndone = {}\r\nfor x in range(1,t+1):\r\n if newa[x-1] not in ch:\r\n done[newa[x-1]] = x\r\n ch.append(newa[x-1])\r\n \r\nfor y in a:\r\n ans += str(done[y]) + \" \"\r\n\r\nprint (ans)\r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na1=(sorted(a))[::-1]\r\nfor i in a:\r\n\tprint(a1.index(i)+1,end=' ')", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)\r\nc = {}\r\ni=0\r\nwhile i<n:\r\n if b[i] in c:\r\n i=i+1\r\n continue\r\n else:\r\n j=1\r\n while i+j<n and b[i+j]==b[i]:\r\n j=j+1\r\n c[b[i]]=(n-(i+j))+1\r\n i=i+j\r\nfor i in a:\r\n print(c[i],end=\" \")", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n ans = 1\r\n for j in range(n):\r\n if a[i] < a[j]:\r\n ans += 1\r\n print(ans, end=\" \")\r\n", "d={}\nn=int(input())\nl=list(map(int,input().split()))\na=l[:]\na.sort(reverse=True)\nd[a[0]]=1\nfor i in range(1,n):\n\tif a[i]!=a[i-1]:\n\t\td[a[i]]=d[a[i-1]]+a.count(a[i-1])\nfor i in l:\n\tprint(d[i],end=' ')\n\t \t \t\t \t\t \t\t\t \t \t\t", "a=int(input())\nb=list(map(int,input().split()))\narr=[]\nfor i in b:\n count=0\n for j in b:\n if i<j:\n count+=1\n arr.append(count+1)\nprint(*arr)\n \n \t \t \t\t \t\t\t \t \t \t\t\t \t \t\t \t", "input()\r\nd = dict()\r\narr = [int(i) for i in input().split()]\r\ns = sorted(arr, reverse=True)\r\nfor n, i in enumerate(s, 1):\r\n if i not in d:\r\n d[i] = n\r\nprint(*[d[i] for i in arr])\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = a[:]; k = 0; p = 1\r\nb = sorted(list(set(b)))\r\nans = [0 for i in range(n)]\r\nfor i in range(len(b)-1,-1,-1):\r\n for j in range(n):\r\n if b[i] == a[j]: ans[j] = p; k += 1\r\n p += k; k = 0\r\nprint(*ans)", "n=int(input());l=list(map(int,input().split()))\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if l[j]>l[i]:\r\n c+=1\r\n print(c+1,end=\" \")", "#-------------Program-------------\r\n#----KuzlyaevNikita-Codeforces----\r\n#---------------------------------\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=[];s=[0]\r\nfor i in range(2000):\r\n d.append(0)\r\nfor i in range(n):\r\n d[a[i]-1]+=1\r\nfor i in range(2000):\r\n s.append(s[-1]+d[i])\r\ndel(s[0])\r\nfor i in range(n):\r\n print(1+n-s[a[i]-1],end=' ')", "n = int(input() )\na = list(map(int, input().split() ) )\nc = [0] * 2001\nfor x in a: c[x] += 1\ndp = [0] * 2001\nfor i in range(1999, 0, -1):\n dp[i] += dp[i+1] + c[i+1]\nprint(*([dp[x]+1 for x in a] ) )\n", "n=int(input())\na=[int(x) for x in input().split(' ')]\nss=[]\nfor i in range(len(a)):\n c=1\n for j in range(len(a)):\n if(a[i]<a[j]):\n c=c+1\n ss.append(c)\nprint(*ss)\n\t \t\t\t \t \t \t \t\t \t\t \t\t\t \t", "n = int(input())\nx = [int(i) for i in input().split()]\n\ny = x[:]\ny.sort(reverse=True)\n\na = []\nfor i in x:\n idx = y.index(i) + 1\n a.append(idx)\nprint(*a)\n", "import bisect\n\n\nn = int(input())\narr = [int(x) for x in input().split()]\narr_s = sorted(arr)\nans = ''\nfor v in arr:\n ans += str(n - bisect.bisect(arr_s, v) + 1) + ' '\nprint(ans)\n", "# GukiZ and Contest\n# https://codeforces.com/problemset/problem/551/A\n\nn = int(input())\nv = list(map(int, input().split()))\n\nresult = ''\nsortedV = v[:]\nsortedV.sort(reverse=True)\n\nfor i in range(n):\n for j in range(n):\n if v[i] == sortedV[j]:\n result += str(j + 1) + ' '\n break\n\nprint(result[:-1])\n", "k=int(input())\r\nstroka=input().split()\r\nfor i in range(k):\r\n stroka[i]=int(stroka[i])\r\nstroka1=sorted(stroka)\r\nstroka1=stroka1[::-1]\r\nstroka2=\"\"\r\nfor l in range(k):\r\n stroka2+=str(stroka1.index(stroka[l])+1)+\" \"\r\nprint(stroka2) \r\n", "def cmp0(x): return x[0]\r\ndef cmp1(x): return x[1]\r\nn, l = int(input()), 1\r\nc = []\r\ncappend = c.append\r\nfor ii in list(map(int,input().split())):\r\n cappend([ii,l,0])\r\n l += 1\r\nc.sort(key = cmp0)\r\nc.reverse()\r\nl, x, t = 0, 0, 1\r\nfor i in range(len(c)):\r\n if c[i][0]==x:\r\n c[i][2] = l\r\n t += 1\r\n else:\r\n l += t\r\n c[i][2] = l\r\n x = c[i][0]\r\n t = 1\r\nc.sort(key = cmp1)\r\nfor ii in c: print(ii[2], end = \" \")\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n for i in range(len(a)):\r\n b = list(filter(lambda x : x > a[i],a))\r\n print(1+len(b),end = \" \")\r\n", "n=int(input())\r\nl=input().split()\r\nl=[int(i) for i in l]\r\nr=l.copy()\r\nl.sort()\r\nl.reverse()\r\nw=[]\r\nz=0\r\nfor i in r:\r\n w.append(l.index(i)+1)\r\nprint(' '.join([str(i) for i in w]))", "n = int(input())\r\nnums = [int(s) for s in input().split()]\r\nvalues_dict = {}\r\nfor i in range(1, n + 1):\r\n\tvalues_dict[i] = nums[i - 1]\r\nvalues = list(values_dict.values())\r\n# values.sort()\r\nindex = 1\r\nrate_dict = {}\r\nwhile index <= n:\r\n\t\r\n\tmaxValue = 0\r\n\tsameValue_list = []\r\n\tsameNums = 0\r\n\t\r\n\tmaxValue = max(list(values_dict.values()))\r\n\tfor item in values_dict.items():\r\n\t\tif item[1] == maxValue:\r\n\t\t\t# sameValue_list.append(item[0])\r\n\t\t\tvalues_dict[item[0]] = 0\r\n\t\t\trate_dict[item[0]] = index\r\n\t\t\tsameNums += 1\r\n\tindex += sameNums\r\nfor a in list(rate_dict.values()):\r\n\tprint(a, end = ' ')", "n = int(input())\na = [int(i) for i in input().split()]\nb = sorted(((a[i], i) for i in range(0, n)), reverse=True)\nc = [0] * n\nplace = 0\nprev = -1\nfor i, (j, k) in enumerate(b):\n if prev != j:\n prev = j\n place = i+1\n c[k] = place\n\nprint(\" \".join(str(i) for i in c))\n", "n=int(input())\nl=list(map(int,input().split()))\nx=set(l)\nx=sorted(x,reverse=True)\na=1\nd={}\nfor i in x:\n d.update({i:a})\n a+=l.count(i)\nfor i in l:\n print(d[i],end=' ')\n \t \t \t \t\t \t \t\t\t\t\t\t \t\t", "n=int(input())\r\nl=list(map(int, input().split()))\r\nc = 1\r\nfor i in range(n):\r\n c = 1\r\n for j in range(n):\r\n if l[j] > l[i]:\r\n \r\n c += 1\r\n print(c, end=' ') \r\n", "\r\nn = int(input())\r\nlst_rating = list(map(int,input().split()))\r\n\r\ntracked = -1\r\n\r\nlst_temp = list(lst_rating)\r\nlst_temp.sort(reverse=True)\r\nlst = []\r\nlst_rank = []\r\n\r\n#Data structure:\r\n# student : [number_of_students,rating,ranking]\r\n# student = [-1,-1,-1]\r\nstudent = [-1, -1, -1]\r\nranking = 1\r\n\r\nfor i in range(0,n):\r\n if tracked != lst_temp[i]:\r\n student = [-1, -1, -1]\r\n student[0] = 1\r\n student[1] = lst_temp[i]\r\n student[2] = ranking\r\n else:\r\n student[0] = student[0] + 1\r\n\r\n ranking = ranking + 1\r\n tracked = lst_temp[i]\r\n\r\n if i == n-1:\r\n lst.append(student)\r\n continue\r\n if tracked != lst_temp[i + 1]:\r\n lst.append(student)\r\n\r\nfor i in range(0,n):\r\n for x in lst:\r\n if x[1] == lst_rating[i]:\r\n lst_rank.append(str(x[2]))\r\n\r\nprint(\" \".join(lst_rank))", "a = input()\r\nb = list(map(int, input().split()))\r\nfor x in b:\r\n print(sorted(b, reverse=True).index(x)+1)", "input()\r\ndata = list(map(int, input().split()))\r\nps = [None] * 2000\r\nfor i, v in enumerate(sorted(data)[::-1]):\r\n if ps[v-1] is None:\r\n ps[v-1] = i\r\nprint(\" \".join(map(str, [ps[v-1] + 1 for v in data])))\r\n", "n = int(input())\r\nL = [int(x) for x in input().split()]\r\nfor i in L: print(sorted(L, reverse = True).index(i)+1, end = ' ')\r\n", "n = int(input())\r\nline = list(map(int,input().split()))\r\nrate = line[:]\r\nline.sort(reverse = True)\r\nans = [line.index(i) + 1 for i in rate]\r\nprint(*ans)\r\n", "if __name__==\"__main__\":\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n p=a.copy()\r\n p.sort()\r\n dic={}\r\n ans=[]\r\n for i in range(n):\r\n dic.setdefault(p[i],0)\r\n dic[p[i]]=i\r\n for i in range(n):\r\n ans.append(n-dic[a[i]])\r\n print(*ans)\r\n\r\n", "n = int(input())\nli = list(map(int,input().split()))\narr = sorted(li, reverse=True)\n\nfor i in range(n):\n print(arr.index(li[i])+1,end = \" \")\n\n \t \t\t\t\t \t \t\t\t\t\t \t\t\t\t\t\t\t \t \t", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = {}\r\nA.insert(0, 0)\r\nres = 0\r\nif n == 1:\r\n print(1)\r\n exit()\r\nB[0] = 0\r\nfor i in range(1, n + 1):\r\n higher = 0\r\n for j in range(1, n + 1):\r\n if A[i] < A[j]:\r\n higher += 1\r\n B[i] = 1 + higher\r\nfor i in range(1, n + 1):\r\n print(B[i], end=\" \")", "p = int(input())\n\ner = [int(x) for x in input().split()]\n\nk = sorted(er, reverse=True)\n\nfor r in er:\n print(k.index(r)+1,end=\" \")\n \t \t\t\t\t \t\t \t \t\t\t\t\t \t \t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = dict()\r\nr = sorted(l,reverse=True)\r\nrank = 1\r\nfor i in range(n):\r\n if r[i] in d:\r\n rank+=1\r\n else:\r\n d[r[i]]=rank\r\n rank+=1\r\nfor i in range(n):\r\n print(d[l[i]],end=\" \")", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline().strip())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\nordered = sorted(lst, reverse = True)\r\nfor i in range(n):\r\n lst[i] = ordered.index( lst[i] ) + 1\r\nprint(*lst)\r\n", "\na=int(input())\no=list(map(int,input().split()))\nl=[]\nfor i in o:\n count=0\n for j in o:\n if i<j:\n count+=1\n l.append(count+1)\nprint(*l)\n \t\t\t \t \t \t\t\t\t \t\t \t\t \t \t\t\t\t", "n=int(input())\r\nar=list(map(int,input().split()))\r\ntmp=[0]*n\r\nfor i in range(n):\r\n tmp[i]=ar[i]\r\n#print(tmp)\r\nar.sort(reverse=True)\r\n#print(ar)\r\ndi={}\r\nfor i in range(n):\r\n if ar[i] in di:\r\n continue\r\n else:\r\n di[ar[i]]=i+1\r\n#print(di)\r\n\r\nfor i in range(n):\r\n \r\n print(di[tmp[i]],end=\" \")\r\n", "n=int(input())\nl=list(map(int,input().split()))\nfor i in range(n):\n c=1\n for j in range(n):\n if l[i]<l[j]: c+=1\n print(c,end=\" \")\n\n \t\t\t \t\t \t \t\t\t \t\t\t\t \t", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nfor i in range(n):\r\n count=1\r\n for j in range(n):\r\n if(a[i]<a[j]):\r\n count+=1\r\n print(count,end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = []\r\nfor i in a:\r\n x.append(i)\r\nx.sort()\r\nx.reverse()\r\nrank = dict()\r\nfor i in range(n):\r\n if(x[i] not in rank):\r\n rank[x[i]] = i + 1\r\nfor i in range(n):\r\n print(rank[a[i]], end = ' ')", "n = int(input())\nl = input().split(\" \")\n\nratings = []\nfor i in l:\n\tratings.append(int(i))\n\nsorted_rat = sorted(ratings)\nsorted_rat.reverse()\n\nres = \"\"\nfor i in ratings:\n\trank = sorted_rat.index(i)\n\tres += str(rank + 1) + \" \"\n\nprint(res.strip())", "def solved(n,arr,sort_arr):\r\n result = []\r\n ma = max(arr)\r\n x = 0\r\n for i in range(n):\r\n if arr[i] in sort_arr:\r\n result.append(sort_arr.index(arr[i]) + 1)\r\n print(*result)\r\nif __name__ == '__main__':\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n new_arr = sorted(arr,reverse=True)\r\n #print(new_arr)\r\n solved(n,arr,new_arr)", "# E - GukiZ and Contest\n\nn = int(input().strip())\n\narr = list(map(int, input().strip().split()))\n\narr_sort = sorted(arr, reverse = True)\n\nprev = -1\nrat_map = {}\nfor index, elem in enumerate(arr_sort):\n if elem != prev:\n rat_map[elem] = index + 1\n prev = elem\n\nfor elem in arr:\n print(rat_map[elem], end = ' ')\nprint()\n\n\t\t\t\t \t \t \t\t\t\t \t\t \t \t\t \t", "a=int(input())\nq=list(map(int,input().split()))\narr=[]\nfor i in q:\n count=0\n for j in q:\n if i<j:\n count+=1\n arr.append(count+1)\nprint(*arr)\n \t\t\t \t \t\t \t\t\t\t\t\t \t\t \t\t \t", "n=int(input())\nlst=[int(i) for i in input().split()]\nlst2=[]\nif(n==1):\n print(1)\nelse:\n for i in lst:\n c=0\n for j in range(len(lst)):\n if(lst[j]>i):\n c+=1\n lst2.append(c+1)\nprint(*lst2)\n \t \t \t \t\t\t\t\t \t\t\t \t \t", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n arr[i] = [arr[i], i]\r\narr.sort(reverse=True)\r\npos = 1\r\nans = [0] * n\r\nc = 0\r\nfor i in range(n):\r\n if i != 0 and arr[i][0] != arr[i-1][0]:\r\n c = 0\r\n if i != 0 and arr[i][0] == arr[i-1][0]:\r\n c += 1\r\n x = arr[i][1]\r\n ans[x] = pos - c \r\n pos += 1 \r\nprint(*ans)", "def gt(x, y):\r\n return y > x\r\n\r\ndef count_greater(x):\r\n greater = list(filter(gt(x), a))\r\n return len(greater) + 1\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nls = map(lambda x: len(list(filter(lambda y: y > x, a))) + 1, a)\r\nprint(*ls)", "ranking = [0] * 2001\nmax_rating = 0\n\ndef get_position(x):\n position = 0\n for i in range(x + 1, max_rating + 1):\n position += ranking[i]\n return position + 1\n\nn = int(input())\nratings = list(map(int, input().split()))\n\nfor rating in ratings:\n if rating > max_rating: max_rating = rating\n ranking[rating] += 1\n\npositions = []\n\nfor rating in ratings:\n positions.append(str(get_position(rating)))\n\nprint(\" \".join(positions))", "input()\r\nlst = [int(i) for i in input().split()]\r\nplaces = {}\r\ncount, rank = 0, 1\r\nprev = 0\r\nfor i in sorted(lst, reverse=True):\r\n if i == prev:\r\n count +=1\r\n else:\r\n rank += count\r\n count = 1\r\n places[i] = rank\r\n prev = i\r\n\r\nfor i in lst:\r\n print(str(places[i]), end=\" \")\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nb = sorted(a, reverse=True)\ntemp = {b[0]: 1}\n\nfor i in range(1, n):\n\n if b[i] == b[i-1]:\n continue\n\n temp[b[i]] = i + 1\n\nfor i in range(n):\n print(temp[a[i]], end=' ')\n", "import sys\r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\na = l.copy()\r\nb = [0]*2001\r\na.sort()\r\na.reverse()\r\nrank=0\r\ncount=0\r\nprevious = sys.maxsize\r\nfor i in range(n):\r\n if a[i]<previous:\r\n rank+=(1+count)\r\n count = 0\r\n previous = a[i]\r\n else:\r\n count+=1\r\n b[a[i]]=rank\r\nfor x in l:\r\n print(b[x], end=\" \")\r\n", "n=input()\r\nl=list(map(int,input().split()))\r\nfor x in l: print(sorted(l)[::-1].index(x)+1)", "n=int(input())\nlst=list(map(int,input().split()))\n\nfor x in range(n):\n s=1\n for y in range(n):\n if lst[x]<lst[y]: s+=1\n print(s,end=' ')\n \t\t \t\t \t\t \t \t\t\t\t\t\t \t \t\t\t \t", "number_of_students = int(input())\r\n\r\nratings = list(map(int, input().split()))\r\n\r\nsorted_ratings = sorted(ratings, key=lambda x: -x)\r\n\r\nfor rating in ratings:\r\n\tprint(sorted_ratings.index(rating)+1, end=\" \")", "from collections import Counter\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n aa = list(map(int, input().split()))\r\n d = Counter(aa)\r\n curr = 0\r\n for key, val in sorted(d.items(), key=lambda item: item[0], reverse=True):\r\n d[key] = curr + 1\r\n curr += val\r\n print(*list(map(d.get, aa)))\r\n", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nz=sorted(l,reverse=True)\r\nfor i in l:\r\n\tprint(z.index(i)+1,end=' ')", "input()\nA = list(map(int, input().split()))\n\nfor a in A:\n print(1 + sum(1 for b in A if b > a), end=' ')\n", "def main():\n n, a, x = int(input()), 2001, 0\n aa = list(map(int, input().split()))\n for i, j in enumerate(sorted(range(n), key=aa.__getitem__, reverse=True), 1):\n b = aa[j]\n if a > b:\n a, x = b, i\n aa[j] = x\n print(*aa)\n\n\nif __name__ == \"__main__\":\n main()\n", "a = int(input())\nn = list(map(int,input().split()))\nfor i in range(len(n)):\n k = [j for j in n if(j>n[i])]\n print(len(k)+1,end=\" \")\n\t \t \t\t \t\t\t\t \t\t\t \t \t\t \t \t\t\t", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\na = list(map(int, stdin.readline().split()))\r\nsorted_a = sorted(a, reverse=True)\r\n\r\nmark_rank = {max(a) : 1}\r\n\r\ncur = sorted_a.count(max(sorted_a))\r\nfor mark in sorted_a:\r\n if mark not in mark_rank:\r\n mark_rank[mark] = cur + 1\r\n cur += sorted_a.count(mark)\r\n \r\nfor mark in a:\r\n \tstdout.write(str(mark_rank[mark]) + ' ')\r\n\r\n", "n = int(input())\na = list(map(int,input().split()))\nb = sorted(a,reverse= True)\ncnt = [0]*2001\nfor i in range(n):\n if cnt[b[i]] == 0:\n cnt[b[i]] = i + 1\nfor i in range(n):\n print(cnt[a[i]],end= \" \")\n# print(b)\n", "import copy\r\nn=int(input())\r\npositions={}\r\nrating=[]\r\na=[int(x) for x in input().split()]\r\nanew=[0]+copy.deepcopy(sorted(a,reverse=True))\r\nfor i in range(1,n+1):\r\n if anew[i]!=anew[i-1]:\r\n positions[anew[i]]=i\r\nfor i in a:\r\n rating.append(str(positions[i]))\r\nprint(' '.join(rating))\r\n", "# http://codeforces.com/problemset/problem/551/A\r\nnumber_of_students = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nsorted_students = sorted(students, reverse=True)\r\nsorted_positions = []\r\ncount = 1\r\npre_count = 0\r\npre_student = sorted_students[0]\r\nmapping = {}\r\nfor student in sorted_students:\r\n if student != pre_student:\r\n count += pre_count\r\n pre_count = 1\r\n mapping[student] = str(count)\r\n pre_student = student\r\n continue\r\n else:\r\n mapping[student] = str(count)\r\n pre_count += 1\r\n\r\npositions = []\r\nfor student in students:\r\n positions.append(mapping[student])\r\n\r\nprint(' '.join(positions))", "n = int(input())\na = list(map(int, input().split(' ')))\nb = sorted(a, key=lambda x: -x) # Sắp theo thứ tự giảm dần => vị trí đầu tiên rank cao nhất, vị trí cuối cùng rank thấp nhất\npositions = [0] * 2001\nresult = []\n\nfor i in range(n):\n # Trường hợp phần tử đầu tiên trong mảng sắp xếp thì vị trí sẽ là 1\n if i == 0:\n positions[b[i]] = i + 1 \n else:\n if b[i] != b[i - 1]: # Nếu rank tiếp theo khác rank trước đó thì gán bằng rank mới\n positions[b[i]] = i + 1\n \n i += 1\n\nfor i in range(n):\n result.append(str(positions[a[i]]))\n\nprint(' '.join(result))", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ntemp = arr.copy()\r\ntemp.sort()\r\ntemp.reverse()\r\nstanding = []\r\ncurr = temp[0]\r\nposition = 1\r\nstanding.append(position)\r\nfor i in range(1, len(temp)):\r\n if temp[i] == curr:\r\n standing.append(position)\r\n else:\r\n standing.append(i + 1)\r\n curr = temp[i]\r\n position = i\r\nfor i in range(0, n):\r\n if arr[i] in temp:\r\n x = temp.index(arr[i])\r\n print(standing[x], end=\" \")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = \"\"\r\nfor s in a:\r\n\tr = 1\r\n\tfor ss in a:\r\n\t\tif ss > s:\r\n\t\t\tr += 1\r\n\tres += str(r) + \" \"\r\nprint(res)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a,key=lambda x:-x)\r\ncount=0\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if a[i]==b[j] and count==0:\r\n a[i]=j+1\r\n break\r\nfor i in a:\r\n print(i,end=\" \")", "n=int(input())\nl=list(map(int,input().split()))\nfor i in range(len(l)):\n a=l[i]\n c=0\n for j in range(len(l)):\n if l[j]>a:\n c=c+1 \n print(1+c,end=' ')\n \n\n \t \t\t \t\t \t \t \t \t \t\t \t", "from fileinput import *\n\n\nfor line in input():\n if lineno() == 1:\n n = int(line.strip())\n if lineno() == 2:\n a = list(map(int, line.split()))\n\nb = sorted(a, reverse=True)\nmy_map = {}\n\nmy_map[b[0]] = 1\nfor i in range(1, n):\n if b[i] != b[i-1]:\n my_map[b[i]] = i+1\n\ns = \"\"\n\nfor element in a:\n s += str(my_map[element]) + ' '\n\nprint(s.strip())\n", "#dung phuong phap vet can. dung 2 vong for, tao bien ans = 1 trong vong for thu 1, neu a[i] < a[j] thi ans += 1 va print(ans)\nn = int(input())\na = list(map(int,input().split()))\nfor i in range(n):\n ans = 1\n for j in range(n):\n if a[i] < a[j]:\n ans += 1\n print(ans, end=\" \")\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ntemp = sorted(a)\r\ntemp = temp[::-1]\r\nresult = []\r\nfor i in range(n):\r\n result.append(temp.index(a[i]) + 1)\r\nresult = [str(x) for x in result]\r\nprint(' '.join(result))\r\n", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\ns = [(s[i], i) for i in range(n)]\r\nr = [0] * n\r\ns.sort()\r\n\r\nfor v,i in s:\r\n r[i] = str(len([0 for vp,ip in s if vp > v]) + 1)\r\n \r\nprint(' '.join(r))", "n=int(input())\r\nl2=list(map(int,input().split()))\r\nl=sorted(l2,reverse=True)\r\ns=sorted(list(set(l)),reverse=True)\r\nc=1\r\nl1=[]\r\nfor i in s:\r\n for j in range(l.count(i)):\r\n l1.append(c)\r\n c+=l.count(i)\r\nd={}\r\nfor k in range(len(l)):\r\n d[l[k]]=l1[k]\r\nfor m in l2:\r\n print(d[m],end=' ')\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=p={}\r\nfor i in a:m[i]=m.get(i,0)+1\r\nm=dict(sorted(m.items()))\r\nm[list(m)[-1]+1]=0\r\nfor i in range(1,len(m),1):\r\n s=1\r\n for k,v in list(m.items())[i:len(m)]:s+=v\r\n p[list(m.keys())[i-1]]=s\r\nfor i in a:print(p[i],end=\" \")", "n=int(input())\r\nm=list(map(int,input().split()))\r\nl=sorted(m)\r\nl=l[::-1]\r\nfor i in range(n):\r\n\tprint(1+(l.index(m[i])),end=' ')", "n = int(input())\na = list(map(int,input().split()))\nb = set(a)\nb = sorted(b,reverse = True)\nHash = {}\nc = 1;\nfor i in b:\n Hash[i] = c\n c+=a.count(i)\nfor i in a:\n print(Hash[i],end =\" \")\n\t \t \t\t \t \t\t \t\t\t \t\t\t\t \t", "n = int(input())\r\ns = input()\r\na = s.split()\r\nb = []\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\tb.append(0)\r\n\r\nid = 1\r\nwhile max(a) > 0:\r\n\tj = 0\r\n\tc = max(a)\r\n\tfor i in range(len(a)):\r\n\t\tif a[i] == c and a[i] > 0:\r\n\t\t\tb[i] = id\r\n\t\t\ta[i] = 0\r\n\t\t\tj += 1\r\n\tid += j\r\nfor i in range(len(b)):\r\n\tprint(b[i], end = ' ')", "n = int(input())\na = list(map(int, input().split()))\nb = []\nx = sorted(a, reverse=True)\nfor i in a:\n b.append(x.index(i) + 1)\nprint(*b)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nclass sc:\r\n def __init__(self, diem,vt):\r\n self.diem=diem\r\n self.vt=vt\r\nb=[]\r\nfor i in range(n):\r\n b.append(sc(a[i],i))\r\nb.sort(key=lambda sc: sc.diem,reverse=True)\r\nc=[]\r\nfor i in range(n): c.append(0)\r\nx=1\r\nfor i in range(1,n):\r\n if (b[i].diem != b[i-1].diem): x=i+1\r\n c[b[i].vt]=x\r\nc[b[0].vt]=1\r\nfor i in c: print(i,end=' ')", "t = int(input())\nl = list(map(int, input().split()))\nfor i in l:\n print(sorted(l)[::-1].index(i)+1, end = \" \")\n \t\t\t\t\t\t \t\t \t\t \t \t\t\t \t\t \t\t", "def answer():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n b = a.copy()\r\n b.sort()\r\n b.reverse()\r\n i=0\r\n c_out=\"\"\r\n while i<len(a):\r\n ans = b.index(a[i])+1\r\n c_out+=str(ans)\r\n i+=1\r\n if i!=len(a): c_out+=\" \"\r\n return c_out\r\nprint(answer())", "rajay = int(input())\nrna = list(map(int,input().split()))\nfor i in range(len(rna)):\n k = [j for j in rna if(j>rna[i])]\n print(len(k)+1,end=\" \")\n\t\t \t\t \t \t \t\t \t\t \t \t\t\t \t\t\t", "n = int(input())\r\nli = list(map(int,input().split()))\r\nli2 = [i for i in li]\r\ndef sort(list):\r\n list_sort = len(list)\r\n for i in range(list_sort):\r\n min_index = i\r\n for j in range(i+1, list_sort):\r\n if list[j] > list[min_index]:\r\n min_index = j\r\n list[i], list[min_index] = list[min_index], list[i]\r\n return list\r\nsort(li)\r\ndic = {}\r\nfor i in li2:\r\n for j in range(0,len(li2)):\r\n if i == li[j] and i in dic:\r\n continue\r\n elif i == li[j] and i not in dic:\r\n dic[i] = j\r\nfor i in li2:\r\n if i in dic:\r\n print(dic[i]+1, end=' ')", "\r\nn=int (input())\r\n\r\nli=list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\n\r\nfor i in li:\r\n\r\n cnt=1\r\n \r\n\r\n for j in li:\r\n\r\n if j>i:\r\n\r\n cnt+=1\r\n\r\n print(cnt,end=' ') \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n", "n=int(input())\na=[int(x) for x in input().split()]\nl=[0]*2001\nm=sorted(a,reverse=True)\nl[m[0]]=1\nr=1\nfor i in range(1,n):\n if(m[i]==m[i-1]):\n pass\n else:\n r=i+1\n l[m[i]]=r\nfor x in a:\n print(l[x],end=\" \")\n \t \t \t \t \t\t\t\t\t \t\t \t \t\t \t", "import sys\r\nfrom functools import cmp_to_key as cmp\r\ndef prit(a):\r\n sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n# def compare(a,b):\r\n# if len(a)>len(b):\r\n# return 1\r\n# if len(a)==len(b):\r\n# if a>b:\r\n# return 1\r\n# return -1\r\n \r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=l.copy()\r\nm.sort(reverse=True)\r\nfor i in l:\r\n print(m.index(i)+1,end=' ')", "__author__ = 'DK Wang'\r\nfrom fractions import gcd\r\n\r\n#Matrix = [[0 for x in range(5)] for x in range(5)]\r\n\r\ninput()\r\nA = list(map(int, input().split()))\r\n\r\nfor a in A:\r\n print(1 + sum(1 for b in A if b > a), end = \" \")", "n=int(input())\r\nr=[0]*n\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nt=1\r\nwhile s:\r\n m=max(s)\r\n d=t\r\n for i in range(n):\r\n if a[i]==m:\r\n t+=1\r\n r[i]=d\r\n s.remove(m)\r\nprint(' '.join(map(str,r)))", "num=input()\nli=list(map(int,input().split()))\nr=sorted(li)[::-1]\nfor x in li: print(r.index(x)+1,end=' ')\n \t\t \t\t \t \t \t\t\t\t\t\t\t \t \t", "from sys import stdin, stdout\r\na=stdin.readline()\r\n#a=input()\r\nb=list(map(int, stdin.readline().split()))\r\nb2=sorted(b, reverse=True)\r\nb3=[]\r\nfor i in b:\r\n b3.append(str(b2.index(i)+1))\r\n#print(' '.join(b3))\r\nstdout.write(' '.join(b3))\r\nstdout.flush()\r\n", "t=int(input())\nlst=list(map(int,input().split()))\nlst2=sorted(lst)\nlst2=list(reversed(lst2))\nres = []\nfor i in range (len(lst)):\n a=lst[i]\n x=lst2.index(a)\n res.append(x+1)\nprint(*res)\n\t \t \t\t\t\t\t \t \t \t\t \t\t \t\t\t \t", "inp = int(input())\ns = list(map(int,input().split()))\nfor i in range(len(s)):\n k = [j for j in s if(j>s[i])]\n print(len(k)+1,end=\" \")\n\t \t \t\t\t\t\t\t \t\t\t \t\t \t \t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tc=0\r\n\tfor j in a:\r\n\t\tif j>a[i]:\r\n\t\t\tc+=1\r\n\tprint(c+1,end=\" \")", "f=int(input())\nar=[int(g) for g in input().split()]\nfor i in range(f):\n c=0\n for j in range(f):\n if ar[j]>ar[i]:\n c+=1\n print(c+1,end=' ')\n\t \t\t\t \t \t\t\t\t\t\t\t\t \t\t \t\t\t", "from operator import itemgetter\n\n\nclass CodeforcesTask551ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.ranking = []\n\n def read_input(self):\n self.n = int(input())\n self.ranking = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n positions = [[x, self.ranking[x], 0] for x in range(self.n)]\n positions.sort(key=itemgetter(1), reverse=True)\n cnt = 0\n pos = 1\n mx = positions[0][1]\n for x in range(self.n):\n if positions[x][1] < mx:\n mx = positions[x][1]\n pos = 1 + cnt\n cnt += 1\n positions[x][2] = pos\n positions.sort(key=itemgetter(0))\n self.result = \" \".join([str(x[2]) for x in positions])\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask551ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "'''\r\n @Author: Pham T. Nhan\r\n @Date: 1/11/2018\r\n @Name: GukiZ and Contest\r\n @Link: http://codeforces.com/problemset/problem/551/A\r\n'''\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n rating = list(map(int, input().split()))\r\n\r\n position = 1\r\n for i in range(n):\r\n for j in range(n):\r\n if rating[i] < rating[j]:\r\n position += 1\r\n print(position, end=' ')\r\n position = 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "t=int(input())\r\nl=list(map(int,input().split()))\r\n# l.sort(reverse=True)\r\n# print(l)\r\nfor i in range(t):\r\n\tposit=1\r\n\tfor j in range(t):\r\n\t\tif l[j]>l[i]:\r\n\t\t\tposit+=1\r\n\tprint(posit,end=\" \")\r\n", "N = int(input())\r\nt = list(map(int, input().split()))\r\nl = [0] * 2001\r\nfor i in t: l[i] += 1\r\ni = max(t)\r\nc = 0\r\nr = 1\r\nwhile c != N:\r\n if l[i] != 0:\r\n c += l[i]\r\n l[i], r = r, r + l[i]\r\n i -= 1\r\nfor i in t:\r\n print(l[i], end = \" \")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nf=sorted(l)\r\nx=[]\r\nfor i in range(n):\r\n c=l.count(l[i])\r\n ind=f.index(l[i])\r\n count=len(f[ind+c:])\r\n x.append(count+1)\r\nfor i in range(n):\r\n print(x[i],end=' ')", "n= int(input())\r\nli=list(map(int,input().split()))\r\nlis=li.copy()\r\nli.sort(reverse=True)\r\nfor i in lis:\r\n print(li.index(i)+1,end=\" \")\r\n", "n = int(input())\ngrades = list(map(int, input().split()))\n\ngrades_position = list(enumerate(grades))\ngrades_position.sort(key=lambda x: x[1])\nrepeated_grades = {}\n\nfor gp in grades_position:\n\tif repeated_grades.get(gp[1]) is None:\n\t\trepeated_grades[gp[1]] = 1\n\n\telse:\n\t\trepeated_grades[gp[1]] += 1\n\nans = [0] * n\n\nfor i in range(n):\n\tans[grades_position[i][0]] = (n - (i + 1)) - (repeated_grades[grades_position[i][1]] - 1) + 1\n\trepeated_grades[grades_position[i][1]] -= 1\n\nprint(\" \".join(list(map(str, ans))))\n", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nl1 = []\r\nfor i in l:\r\n co = 1\r\n for j in l:\r\n if j > i:\r\n co += 1\r\n \r\n l1.append(co)\r\n \r\n \r\nprint(*l1, sep = ' ')\r\n", "n=int(input())\narr=[int(x) for x in input().split()]\nc=1\nfor i in range(n):\n for j in range(n):\n if(arr[i]<arr[j]):\n c=c+1\n print(c,end=\" \")\n c=1\n \t\t\t\t\t\t \t \t\t \t \t \t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=l.copy()\r\nl1.sort(reverse=True)\r\nd,c={},1 \r\nfor i in range(n-1):\r\n if l1[i]!=l1[i+1]:\r\n d[l1[i]]=c \r\n c=i+2\r\nd[l1[n-1]]=c\r\nfor i in l:\r\n print(d[i],end=' ')", "n=input()\na=list(map(int,input().split()))\ns=sorted(a)[::-1]\nfor i in a:\n\tprint(s.index(i)+1,end=' ')\n\t\t \t\t \t\t\t\t \t\t \t \t\t\t \t\t", "# A. GukiZ and Contest\n\n# Idea - https://codeforces.com/contest/551/submission/12629224\n\n_ = input()\nlst = list(map(int, input().split()))\nans = list()\nfor x in lst:\n ans.append(1 + sorted(lst)[::-1].index(x))\nprint(' '.join(str(x) for x in ans))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nanswer = ''\r\n\r\nfor i in range(n):\r\n index = 0\r\n place = 1\r\n\r\n while index < n:\r\n if i != index:\r\n if a[i] < a[index]:\r\n place += 1\r\n\r\n index += 1\r\n\r\n answer += str(place) + ' '\r\n\r\nprint(answer)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nif n == 1:\n print(1)\nelse:\n sorted_a = a.copy()\n sorted_a.sort(reverse=True)\n i = 0\n while i < n:\n print(sorted_a.index(a[i]) + 1, end = ' ')\n i += 1\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=sorted(l,reverse=True)\r\nfor i in range(n):\r\n\tprint(len(l1[:l1.index(l[i])])+1,end=' ')", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ncnt = 1\r\nrank = 1\r\n\r\nn = int(input())\r\ndata = sorted(zip(map(int, input().split()), list(range(n))), reverse=True)\r\nmemo = [0 for _ in range(n)]\r\nmemo[data[0][1]] = 1\r\n\r\n\r\nfor i in range(1, n):\r\n cnt += 1\r\n if data[i - 1][0] > data[i][0]:\r\n rank = cnt\r\n\r\n memo[data[i][1]] = rank\r\n\r\n\r\nprint(*memo)\r\n", "# GukiZ and Contest\n\nn = input()\nstudents = list(map(int, input().split()))\nstandings = []\n\nfor s1 in students:\n count = 1\n for s2 in students:\n if s2 > s1:\n count += 1\n standings.append(count)\n\nprint(' '.join(map(str, standings)))\n", "n, lst, dem = int(input()), list(map(int, input().split())), 0\r\nfor x in lst:\r\n dem = 0\r\n for i in lst:\r\n if i > x: dem += 1\r\n print(1 + dem, end = \" \")", "n = int(input())\na = list(map(int, input().split()))\nl = []\nfor i in range(n):\n l.append((a[i], i + 1))\nl.sort(reverse=True)\nans = [0] * (n + 1)\nans[l[0][1]] = 1\nfor i in range(1, n):\n if l[i][0] != l[i - 1][0]:\n ans[l[i][1]] = i + 1\n else:\n ans[l[i][1]] = ans[l[i - 1][1]]\nfor x in ans[1:]:\n print(x, end=' ')", "N=int(input(\"\"))\nstudents=[int(i)for i in input(\"\").split()]\nH={}\nsortedstudents=sorted(students)\nsortedstudents.reverse()\nranks=[0 for i in range(N)]\nfor i in range(0,N):\n if i!=0 and sortedstudents[i]==sortedstudents[i-1]:\n ranks[i]=ranks[i-1]\n else:\n ranks[i]=i+1\nfor i in range(N):\n H[sortedstudents[i]]=ranks[i]\noutput=[]\nfor i in range(N):\n output.append(H[students[i]])\ns=\"\"\nfor i in output:\n s+=str(i)+\" \"\ns=s.rstrip()\nprint(s)\n\n", "n = int(input())\r\nlist1 = list(map(int, input().strip().split()))\r\nlist2 = []\r\nfor i in range(n):\r\n list2.append([list1[i], i])\r\nlist2.sort(reverse = True)\r\npos = 0\r\npostemp = 1\r\ntemp = list2[0][0]\r\nans = {}\r\nfor i in list2:\r\n if i[0] == temp:\r\n ans[i[1]] = postemp\r\n pos += 1\r\n continue\r\n pos += 1\r\n postemp = pos\r\n ans[i[1]] = pos\r\n temp = i[0]\r\nfor i in range(n):\r\n print(ans[i], end=' ')", "#codeforces551A\r\ngi = lambda : list(map(int,input().strip().split()))\r\nn, = gi()\r\nl = gi()\r\nl = [(l[k],k) for k in range(n)]\r\nl.sort(reverse=True)\r\npos = 1\r\nans = [0]*n\r\nans[l[0][1]] = \"1\"\r\nfor k in range(1,n):\r\n\tif l[k][0] != l[k-1][0]:\r\n\t\tpos = k + 1\r\n\tans[l[k][1]] = str(pos)\r\nprint(\" \".join(ans))\r\n", "k = input()\nv = list(map(int, input().split()))\nfor j in v:\n t = len([1 for value in v if value > j])+1\n print(t, end = \" \")\n \n\t \t\t \t\t\t \t\t\t \t \t\t\t \t", "n=int(input())\nl=list(map(int,input().split()))[:n]\nfor i in l:\n d=l.copy()\n d.remove(i)\n c=1\n for j in l:\n if i<j:\n c+=1\n print(c,end=\" \")\n\t\t\t \t \t \t \t \t \t\t\t \t \t", "n = int(input())\r\na = list(map(int, input().split(' '))) \r\nb = a.copy()\r\nb.sort(reverse = True)\r\nre = ''\r\nfor x in a:\r\n re = re + ' ' + str(b.index(x)+1)\r\nprint(re[1:]) \r\n", "n = int(input())\nl = list(map(int, input().split()))\npos = 1\nm = l[:]\nm.sort()\nm = m[::-1]\nres = []\nfor i in range(n):\n res.append((m.index(l[i])) + 1)\n\n\nfor j in res:print(j,end=\" \")\n \n", "a=int(input())\nl=list(map(int,input().split()))\nf=l.copy()\nl.sort(reverse=True)\nb={}\nz=1\nx=1\nfor i in range(len(l)):\n if(i==0):\n b[l[i]]=x\n z+=1\n elif(l[i]==l[i-1]):\n b[l[i]]=x\n z+=1\n else:\n x=z\n b[l[i]]=x\n z+=1\nfor i in f:\n print(b[i],end=\" \")\n\t \t\t\t \t\t\t \t \t \t \t\t\t\t", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nexp = sorted(lst, reverse=True)\r\n\r\nfor i in lst:\r\n print(exp.index(i)+1, end=' ')\r\n", "# ý tưởng: tạo một mảng sorted_a là bản sao của a đồng thời đã được sắp xếp không tăng\r\n# duyệt mảng a, sử dụng hàm index để lấy vị trí xuất hiện đầu tiên của mỗi giá trị của mảng a\r\n# trong mảng sorted_a cộng thêm 1 sẽ được kết quả hợp lệ\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n print(1)\r\nelse:\r\n sorted_a = a.copy()\r\n sorted_a.sort(reverse=True)\r\n i = 0\r\n while i < n:\r\n print(sorted_a.index(a[i]) + 1, end = ' ')\r\n i += 1\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n\tt = 0\r\n\tfor j in range(n):\r\n\t\tif l[i] < l[j]:\r\n\t\t\tt = t + 1\r\n\tprint(t+1,end=\" \")", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\nc=[0]*(m+1)\r\nfor i in range(n):\r\n c[a[i]]+=1\r\nb=[1]*n\r\nfor i in range(n):\r\n for j in range(a[i]+1,m+1):\r\n b[i]+=c[j]\r\nprint(' '.join(map(str,b)))", "n=int(input())\nl=[int(x) for x in input().split()]\nl1=[]\nfor i in range(0,n):\n c=0\n for j in range(0,n):\n if(l[i]<l[j]):\n c=c+1\n l1.append(c+1)\nprint(*l1)\n\n\t \t \t\t \t\t \t\t\t \t\t\t \t \t \t\t \t\t", "tmp = input()\nlst = list(map(int, input().split()))\nfor val in lst:\n cnt = len([1 for value in lst if value > val])+1\n print(cnt, end = \" \")\n \t\t \t \t \t\t \t \t \t \t\t", "n = int(input())\r\nratings = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n place = 1\r\n for j in range(n):\r\n if ratings[j] > ratings[i]:\r\n place += 1\r\n print(place, end=' ')", "n=int(input())\nl=list(map(int, input().split()))\ng=sorted(l,reverse=True)\nfor i in range(n):\n print(g.index(l[i])+1,end=' ')\n\t\t\t\t\t \t\t \t \t \t\t \t \t\t\t \t\t\t \t", "class Student:\r\n def __init__(self, rating, id):\r\n self.rating = rating\r\n self.id = id\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nstudent = []\r\nfor i in range(n):\r\n student.append(Student(a[i], i))\r\n \r\nstudent.sort(reverse = True, key = lambda Student: Student.rating)\r\n\r\np = 1\r\npos = [0] * 2001\r\npos[student[0].id] = 1\r\nfor i in range(1, n):\r\n if student[i].rating == student[i - 1].rating:\r\n pos[student[i].id] = p\r\n else:\r\n p = i + 1\r\n pos[student[i].id] = p \r\n\r\nfor i in range(n):\r\n print(pos[i], end = \" \")\r\n", "n=int(input())\r\nnn=input()\r\nnn=nn.split()\r\nk=[]\r\n\r\nfor i in nn:\r\n k.append(int(i))\r\nma=max(k)\r\nmi=min(k)\r\nkk=sorted(k,reverse=True)\r\nl=dict()\r\nm=0\r\nr=1\r\ni=0\r\nwhile(i<n-1):\r\n l[kk[i]]=r\r\n if kk[i]!=kk[i+1]:\r\n r=r+1+m\r\n m=0\r\n else:\r\n m=m+1\r\n i=i+1\r\nl[kk[n-1]]=r\r\nfor i in k:\r\n print(l[i],'',end=\"\")", "if __name__ == \"__main__\":\n n_students = int(input())\n rating = list(map(int, input().split()))\n position = [1]*n_students\n for i in range(n_students):\n for j in range(n_students):\n if rating[i] < rating[j]:\n position[i] += 1\n print(\" \".join(list(map(str, position))))\n", "a=int(input())\nl=list(map(int,input().split()))[:a]\nfor x in l:\n\tprint(sorted(l)[::-1].index(x)+1,end=\" \")\n\t \t \t \t \t\t \t \t\t \t \t \t", "k=int(input())\na=list(map(int,input().split()))\nfor i in range(k):\n c=0\n for j in range(k):\n if(a[j]>a[i]):\n c+=1\n print(1+c,end=\" \")\n\t \t \t \t\t \t \t \t \t\t\t\t\t \t \t", "def inp(s):\r\n j = 0\r\n a = []\r\n for i in range(len(s)):\r\n if s[i] == \" \":\r\n a.append(int(s[j:i]))\r\n j = i+1\r\n if i == len(s)-1:\r\n a.append(int(s[j:]))\r\n return a\r\n\r\nn = int(input())\r\ns = input()\r\n\r\na = inp(s)\r\nres = []\r\n\r\nb = sorted(a,reverse = True)\r\n\r\nfor i in a:\r\n res.append(b.index(i)+1)\r\n\r\n\r\ns = \"\"\r\nfor i in res:\r\n s = s + str(i) + \" \"\r\n \r\nprint (s[:len(s)-1])\r\n", "n=int(input())\nl=list(map(int,input().split()))\nc=1\nfor i in range(n):\n if l[i]>l[0]:\n c+=1\nprint(c,end=' ')\nfor i in range(1,n):\n c=1\n for j in range(n):\n if l[j]>l[i]:\n c+=1\n print(c,end=' ')\n \t\t\t\t \t\t\t\t \t \t \t\t \t \t\t \t", "n=int(input())\na=list(map(int,input().split()))\narr=[]\nfor i in range(len(a)):\n c=0\n #arr.append(1+num of ele which are greater than i----'c')\n for j in range(len(a)):\n if a[j]>a[i]:\n c=c+1 \n arr.append(1+c)\nprint(*arr)\n \n\t \t\t \t\t \t\t\t\t\t \t \t\t \t\t", "n = int(input())\r\nscore = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n s = 1\r\n for j in range(n):\r\n if (score[i] < score[j]):\r\n s += 1\r\n print(s, end= \" \")", "a=int(input());b=list(map(int,input().split()));c=sorted(b,reverse=True);print(*[c.index(i)+1 for i in b])", "n1=int(input())\nl1=list(map(int, input().split()))\na1=sorted(l1,reverse=True)\nfor i in range(n1):\n print(a1.index(l1[i])+1,end=' ')\n\t \t\t \t\t \t\t \t \t\t \t\t\t\t \t \t\t", "n = int(input())\nlst = [int(x) for x in input().strip().split()]\nfor i in lst:\n print(sorted(lst,reverse=True).index(i)+1, end = \" \")\n \t \t\t\t\t\t \t \t\t \t \t\t\t \t \t \t \t", "input()\r\nl=list(map(int,input().split()))\r\ns=sorted(l)[::-1]\r\nfor i in l:\r\n print(s.index(i)+1,end=' ')", "n = int(input())\nl = [int(x) for x in input().split()]\nprint(' '.join(str(1 + sum([x < y for y in l])) for x in l))\n", "x = int(input())\nlista = list(map(int, input().split()))\nlista2 = lista[::]\nlista2.sort()\nlista2 = lista2[::-1]\nposicao = [1]\ncont = 1\n\nfor c in range(1,x):\n\tif lista2[c] == lista2[c-1]:\n\t\tposicao.append(posicao[c-1])\n\t\tcont += 1\n\telse:\n\t\tcont += 1\n\t\tposicao.append(cont)\nposicaof = [0] * x\nfor c in range(x):\n\tfor i in range(x):\n\t\tif lista2[c] == lista[i]:\n\t\t\tposicaof[i] = posicao[c]\nmsg = \"\"\nfor c in range(x):\n\tif c != x-1:\n\t\tmsg += str(posicaof[c])+\" \"\n\telse:\n\t\tmsg += str(posicaof[c])\n\nprint(msg)", "student=int(input())\r\nrating = [int(x) for x in input().split()]\r\nrating_new = list(set(rating))\r\nd={}\r\ncount=1\r\ntemp=0\r\nfor j in range(len(rating_new)):\r\n maximum=max(rating_new)\r\n rating_new.remove(maximum)\r\n for i in rating:\r\n if i==maximum:\r\n d[i]=count\r\n temp+=1\r\n count+=temp\r\n temp=0\r\nfor i in rating:\r\n print(d[i],end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\nnumbers = [0 for _ in range(max(a))]\r\nfor i in range(n):\r\n numbers[a[i]-1] += 1\r\nfor i in range(n):\r\n print(sum(numbers[a[i]:])+1, end=' ')\r\nprint()", "aan = int(input())\naaa = [int(i) for i in input().split()]\nbaa = list(aaa)\nbaa.sort(reverse=True)\ndaa = {}\nfor i in range(len(baa)):\n if(daa.get(baa[i])):\n continue\n daa.update({baa[i]:i+1})\nfor i in aaa:\n print(daa.get(i),end=\" \")\n\n \t\t \t\t\t \t\t \t\t\t\t\t\t\t \t\t\t\t\t\t", "# Codeforces: 551A - GukiZ and Contest\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor x in a:\r\n ans = 1\r\n for y in a:\r\n if x < y:\r\n ans += 1\r\n print(ans, end = ' ')", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = []\r\n\r\nfor i, val in enumerate(a):\r\n pos = 1\r\n for j, secVal in enumerate(a):\r\n if secVal > val:\r\n pos += 1\r\n ans.append(pos)\r\n\r\nprint(\" \".join(str(num) for num in ans))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n\ta[i] = [a[i], i]\r\n\r\na.sort(reverse=True)\r\n\r\nans = [0] * n\r\n\r\nlastneq = 0\r\nfor i in range(n):\r\n\tif a[i][0] != a[lastneq][0]:\r\n\t\tlastneq = i\r\n\tans[a[i][1]] = lastneq + 1\r\n\r\nprint(*ans)", "def answer():\n rank=[0]*n\n\n r,c=1,0\n\n key=-1\n for b in x:\n if(key!=b[0]):\n r+=c\n key=b[0]\n c=1\n else:\n c+=1\n\n rank[b[1]]=r\n\n return rank\n \n\n \n\nn=int(input())\na=list(map(int,input().split()))\nx=[[a[i],i] for i in range(n)]\n\nx.sort(key=lambda x: x[0] , reverse=True)\n\nprint(*answer())\n\n \t\t \t\t \t \t \t \t \t \t \t \t\t", "n = int(input())\r\nm = list(map(int, input().split()))\r\nx = list(m)\r\nx.sort(reverse = True)\r\na = {}\r\n\r\nt = 1\r\nfor r in x:\r\n if r not in a:\r\n a[r] = t\r\n t += 1\r\n\r\nfor r in m:\r\n print(a[r], end = \" \")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = []\r\n\r\nfor i in range(n):\r\n b.append(1 + len([0 for x in a if int(x) > int(a[i])]))\r\n\r\nb = [str(x) for x in b] \r\n \r\nprint(' '.join(b))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=l.copy()\r\nl.sort(reverse=True)\r\nfor i in x:\r\n\tprint(l.index(i)+1,end=\" \")", "n = int(input())\na = list(map(int, input().split()))\n\nb = sorted(a)\n\nresult = \"\"\nfor i in range(n):\n\ttotal = 1\n\tfor j in range(n):\n\t\tif(a[i] < b[j]):\n\t\t\ttotal += 1\n\tif i == n - 1:\n\t\tresult += str(total)\n\telse:\n\t\tresult += str(total) + \" \"\n\nprint(result)", "#!/usr/bin/env python3\nimport copy\nn = int(input())\nxs = list(map(int,input().split()))\nth = {}\nys = list(sorted(copy.deepcopy(xs), reverse=True))\nfor i in range(n):\n if ys[i] not in th:\n th[ys[i]] = i+1\nprint(' '.join(map(lambda x: str(th[x]), xs)))\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nsorted_a = sorted(a, reverse=True)\r\npositions = {}\r\n\r\nfor i in range(n):\r\n if sorted_a[i] not in positions:\r\n positions[sorted_a[i]] = i + 1\r\n\r\nfor i in a:\r\n print(positions[i], end=' ')\r\n", "ac=int(input())\nbc=list(map(int,input().split()))\narrs=[]\nfor i in bc:\n count=0\n for j in bc:\n if i<j:\n count+=1\n arrs.append(count+1)\nprint(*arrs)\n \t \t\t \t\t\t\t \t\t \t\t \t\t \t \t\n \t\t\t \t\t \t \t \t\t \t \t \t\t \t", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(len(a)):\r\n a[i] = [a[i], i]\r\na.sort(reverse = True)\r\nd = [0] * len(a)\r\nd[a[0][1]] = 1\r\nm = 1\r\nfor i in range(1, len(a)):\r\n if a[i][0] != a[i - 1][0]:\r\n m = i + 1\r\n d[a[i][1]] = m\r\nprint(*d) \r\n", "from bisect import *\r\ninput()\r\n\r\nA=list(map(int,input().split()))\r\nB=sorted(A)\r\nan=[]\r\nfor i in A:\r\n an += [len(A) - bisect_right(B,i) + 1]\r\n\r\nfor a in an:\r\n print(a,end=' ') ", "def x(a,b):\n\tc=0\n\tfor s in a:\n\t\tif s>b :\n\t\t\tc=c+1\n\treturn c\nn=int(input())\nz=list(map(int,input().split()))\nfor i in range(n):\n\tprint(1+x(z,z[i]),end=' ')\n\t \t\t \t\t\t \t \t \t\t \t \t \t\t \t \t", "\r\ndef main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n b = sorted(a)[::-1]\r\n for elem in a:\r\n print(b.index(elem) + 1, end = ' ')\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nst = list(map(int,input().split()))\r\nq = st[:]\r\n\r\nfor i in range(len(st)):\r\n\tr = 0\r\n\tfor j in range(len(st)):\r\n\t\tif q[j] > st[i]:\r\n\t\t\tr+=1\r\n\tst[i] = 1 + r\r\n\r\nprint(*st)\r\n\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=sorted(l,reverse=True)\r\nscore=a[0]\r\nrank=1\r\nb=[]\r\nc=[]\r\nb.append(score)\r\nb.append(rank)\r\nc.append(b)\r\nfor i in range(1,len(a)):\r\n result=[]\r\n if(a[i]==score):\r\n continue\r\n else:\r\n result.append(a[i])\r\n score=a[i]\r\n rank=i+1\r\n result.append(rank)\r\n c.append(result)\r\nfor i in range(len(l)):\r\n for j in range(len(c)):\r\n if(l[i]==c[j][0]):\r\n print(c[j][1],end=\" \")\r\n break\r\n else:\r\n continue", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n res = [0 for i in a]\r\n\r\n for i, el in enumerate(a):\r\n res[i] = 1 + len([j for j in a if j > el])\r\n\r\n for i in res:\r\n print(i, end=' ')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n\tf=0\r\n\tfor j in range(n):\r\n\t\tif l[i]<l[j]:\r\n\t\t\tf+=1\r\n\tc.append(f+1)\r\nprint(*c)", "amount = int(input())\r\ndata = []\r\ni = 0\r\nfor item in input().split():\r\n data.append([int(item),i])\r\n i+=1\r\n \r\ndata.sort(key=lambda item : item[0],reverse = True)\r\n\r\nlast = data[0][0]\r\n\r\ndata[0].append(1)\r\nrank = 2\r\nfor i in range(1,amount):\r\n if(data[i][0]==last):\r\n data[i].append(data[i-1][2])\r\n else:\r\n data[i].append(rank)\r\n rank += 1\r\n last = data[i][0]\r\n\r\ndata.sort(key=lambda item : item[1])\r\n\r\nisFirst = True\r\n\r\nfor item in data:\r\n if isFirst:\r\n isFirst = False\r\n else:\r\n print(' ',end='')\r\n print(item[2],end='')\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = l.copy()\r\nl.sort()\r\nl.reverse()\r\nfor i in a:\r\n\tprint(l.index(i)+1,end = \" \")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(n):\r\n\tcount=1\r\n\tfor j in range(n):\r\n\t\tif l[i]<l[j]:\r\n\t\t\tcount+=1\r\n\tl1.append(count)\r\nfor x in l1:\r\n\tprint(x,end=' ')", "x = int(input())\nl = list(map(int,input().split()))\nfor i in range(len(l)):\n k = [j for j in l if(j>l[i])]\n print(len(k)+1,end=\" \")\n\t\t\t \t\t \t \t\t \t\t \t\t\t\t", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n pos = 1\r\n for j in range(n):\r\n if a[j] > a[i]:\r\n pos += 1\r\n \r\n print(pos, end=' ')\r\n\r\n", "num = int(input())\r\nlist = [int(x) for x in input().split(\" \")]\r\nlist_1 = sorted(list)\r\nfor i in list:\r\n sum_1 = 0\r\n for l in list_1:\r\n if l > i:\r\n sum_1+=1\r\n print(sum_1+1, end=\" \")\r\n", "import math, os, sys\r\nimport string, re\r\nimport itertools, functools, operator\r\nfrom collections import Counter\r\n\r\ndef inputint():\r\n return int(input())\r\n\r\ndef inputarray(func=int):\r\n return map(func, input().split())\r\n\r\n\r\nn = inputint()\r\nA = list( inputarray() )\r\n\r\ndef ans(Array, val):\r\n l, r = -1, len(Array)\r\n while r - l >= 2:\r\n m = l + (r - l)//2\r\n if Array[m] > val:\r\n l = m\r\n else:\r\n r = m\r\n\r\n return str(r + 1)\r\n\r\nB = sorted( A, reverse=True )\r\nres = [None]*n\r\nfor i, v in enumerate(A):\r\n res[i] = ans(B, v)\r\nprint(' '.join(res))\r\n\r\n", "\r\n\r\nn = int(input())\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\n\r\nfor i in range(n):\r\n cnt = 1\r\n for j in range(n):\r\n if x[j] > x[i]:\r\n cnt += 1\r\n print(cnt , end = ' ')", "# GukiZ and Contest\r\nclass Student:\r\n\tdef __init__(self, idx = 0, sco = 0):\r\n\t\tself.idx = idx\r\n\t\tself.sco = sco\r\n\t\tself.rank = 0\r\n\r\ndatain = True\r\n\r\nif datain:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\nelse:\r\n n = 1\r\n a = [1]\r\n\r\nsa = n\r\ngukiz = []\r\n\r\nfor i in range(sa):\r\n\tgukiz.append(Student(i, a[i]))\t\r\n\r\ngukiz.sort(key = lambda s: (-s.sco))\r\n\r\nrank = 1\r\nrank_r = 1\r\ngukiz[0].rank = 1\r\nfor i in range(1,sa):\r\n\tif (gukiz[i].sco < gukiz[i-1].sco):\r\n\t\trank += 1\r\n\t\trank_r = rank\r\n\telse:\r\n\t\trank += 1\r\n\t\r\n\tgukiz[i].rank = rank_r\r\n\t\t\r\n\t\r\ngukiz.sort(key = lambda s: (s.idx))\r\n\t\r\nfor _ in gukiz:\r\n\tprint(_.rank, end = ' ')", "a = int(input())\nb = list(map(int,input().split()))\nfor i in range(len(b)):\n c = [j for j in b if(j>b[i])]\n print(len(c)+1,end=\" \")\n \t\t\t \t \t \t \t \t \t \t\t", "rajay = int(input())\nrna = list(map(int,input().split()))\nfor i in range(len(rna)):\n k = [s for s in rna if(s>rna[i])]\n print(len(k)+1,end=\" \")\n\t\t \t\t\t\t \t \t \t\t\t \t \t\t \t\t", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if arr[i]<arr[j]:\r\n c=c+1\r\n l.append([arr[i],c])\r\nfor i in range(n):\r\n print(l[i][1] + 1,end=\" \")\r\n \r\n ", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = []\r\nfor i in range(n):\r\n r = 1\r\n for j in range(n):\r\n if l[j] > l[i]:\r\n r += 1\r\n m.append(r)\r\nprint(*m)", "#!/usr/bin/env python3\n\nn = int(input())\na = list(map(int, input().split()))\n\nsorted_a = list(sorted(a, reverse=True))\nfor i in range(n):\n print(1 + sorted_a.index(a[i]), end=\" \")\n", "n=int(input())\narray=[]\nlist1=list(map(int,input().split()))\nfor i in list1:\n array.append(i)\narray.sort(reverse=True)\nlist2=[]\nc=0\nfor i in range(len(list1)):\n for j in range(len(array)):\n if(list1[i]==array[j]):\n if array[j] not in list2:\n if(c==len(list1)):\n break\n else:\n print(j+1,end=\" \")\n break\n c=c+1\n list2.append(array[j])\n elif(array[j] in list2):\n if(c==len(list1)):\n break\n else:\n print(j,end=\" \")\n break\n c=c+1\n \n \n \t \t \t \t \t \t\t\t\t\t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Dec 23 13:59:09 2017\r\n\r\n@author: admin\r\n\"\"\"\r\n\r\nn = int(input())\r\nscore = [int(x) for x in input().split()]\r\nrating = sorted(score,reverse = True)\r\nposition=[0]*n\r\nfor i in range(n):\r\n position[i]=rating.index(score[i])\r\n \r\nfor x in position:\r\n print(x+1,end = ' ')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=0\r\nwhile(k<n):\r\n p=1+sum(i>l[k] for i in l)\r\n k+=1\r\n print(p,end=\" \")", "#!/usr/bin/python3\ndef getRating(r):\n return 1+len(list(filter(lambda x:x>r,a)))\nn=int(input())\na=list(map(int,input().split()))\nres=list(map(getRating,a))\nprint(*res)\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncount = Counter(a)\r\n\r\ns = sorted(list(set(a)), reverse=True)\r\nranks = dict()\r\nhigher = 0\r\n\r\nfor rating in s:\r\n ranks[rating] = higher + 1\r\n higher += count[rating]\r\n\r\nprint(*[ranks[rating] for rating in a])\r\n\r\n\"\"\"\r\n//////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n//////////////////////////////////////////\r\n\"\"\"", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\ntemp=[0]*max(l)\r\nfor i in range (n):\r\n temp[l[i]-1]+=1\r\nfor i in range (n):\r\n l[i]=sum(temp[l[i]:])+1\r\n print(l[i],end=\" \")", "\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\nfor i in range(0,n,1):\r\n count=1\r\n for j in range(0,n,1):\r\n if arr[i]<arr[j]:\r\n count+=1\r\n print(count,end=\" \")", "x=int(input())\r\na=list(map(int,input().split()))\r\nz=[]\r\nfor i in range(x):\r\n m=a[i]\r\n c=0\r\n for j in range(x):\r\n if i!=j:\r\n if a[j]>m:\r\n c+=1\r\n z+=[c+1]\r\n\r\nfor v in z:\r\n print(v,end=' ')\r\n\r\n\r\n", "n=int(input())\nl=list(map(int, input().split()))\nt=[]\nfor i in l:\n\tif i not in t:\n\t\tt.append(i)\nt.sort()\nx=len(t)\nd={}\nc=0\nr=1\nfor i in range(x):\n\td[t[-1]]=r\n\tc=l.count(t[-1])\n\tr+=c\n\tt.pop()\nfor i in range(len(l)):\n\tif(i!=0):\n\t\tprint(end=' ')\n\tprint(d[l[i]],end='')\n\t \t\t \t\t \t \t \t\t\t \t \t \t\t", "# Tạo cấu trúc Studen có id ban đầu, id mới, và điểm.\r\n# - Sắp xếp giảm dần, mảng sinh viên theo điểm số.\r\n# - Tìm thứ hạng của từng sinh viên và lưu lại ví trí id mới sau khi sắp xếp.\r\n\r\nclass classStudent:\r\n def __init__(self, id=0, rating=0, new_id=0):\r\n self.id = id\r\n self.rating = rating\r\n self.new_id = new_id\r\n\r\n\r\nn = int(input())\r\na = list(map(int, list(input().split())))\r\nlist_student = []\r\ncnt = 0\r\npos = 0\r\n\r\nfor i in range(n):\r\n list_student.append(classStudent(i, a[i]))\r\n\r\nlist_student.sort(key=lambda s: (-s.rating, s.id))\r\nlist_student.insert(0, classStudent(0, 0))\r\n\r\nfor i in range(1, n + 1):\r\n\r\n if list_student[i].rating != list_student[i - 1].rating:\r\n pos = pos + cnt + 1\r\n cnt = 0\r\n\r\n if list_student[i].rating == list_student[i - 1].rating:\r\n cnt += 1\r\n\r\n list_student[i].new_id = pos\r\n\r\nlist_student.sort(key=lambda s: (s.id, s.new_id, s.rating))\r\n\r\nfor i in range(1, n + 1):\r\n print(list_student[i].new_id, end=\" \")\r\n", "# You lost the game.\nn = int(input())\nL = list(map(int, input().split()))\nT = [[L[k],k] for k in range(n)]\nR = [0 for _ in range(n)]\n\ndef kt(a):\n return a[0]\n\nT.sort(key=kt,reverse=True)\nc = 0\nfor i in range(n):\n if i == 0 or T[i][0] != T[i-1][0]:\n R[T[i][1]] = i\n c = i\n else:\n R[T[i][1]] = c\nfor i in range(n):\n print(R[i]+1,end=\" \")\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=[0 for i in range(2002)]\r\nb=[]\r\nfor i in a:\r\n b.append(i)\r\nb.sort(reverse=1)\r\nfor i in range(1,len(d)):\r\n try:\r\n d[i-1]=b.index(i)+1\r\n except:\r\n d[i-1]=0\r\nfor i in a:\r\n print(d[i-1],end=' ')\r\n", "n=input()\nlist1=list(map(int,input().split()))\nr=sorted(list1)[::-1]\nfor x in list1: print(r.index(x)+1,end=' ')\n\t\t\t \t\t\t \t \t\t \t\t \t\t\t \t \t\t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nd = {}\r\nfor i in range(len(a)):\r\n a[i] = [a[i], i]\r\na = sorted(a)\r\ns = ''\r\npos = 1\r\nt = 1\r\ncur = -1\r\nk = 0\r\n#print(a)\r\nfor i in range(n-1, -1, -1):\r\n if a[i][0] != cur:\r\n t += k\r\n k = 1\r\n else:\r\n k += 1\r\n a[i].append(t)\r\n #print(a[i][0], cur)\r\n cur = a[i][0]\r\n#print(s[::-1][1:])\r\n#print(a)\r\na.sort(key=lambda x:x[1])\r\nfor i in range(n):\r\n s += str(a[i][2]) + ' '\r\nprint(s)\r\n#print(a)", "n = int(input())\r\n#n, m = map(int, input().split())\r\n#s = input()\r\nc = list(map(int, input().split()))\r\na = []\r\nfor i in c:\r\n a.append(i)\r\na.sort()\r\nl = 1\r\np = set()\r\nf = dict()\r\nfor i in range(n - 1, -1, -1):\r\n if not a[i] in p:\r\n p.add(a[i])\r\n f[a[i]] = l\r\n l += a.count(a[i])\r\nfor i in c:\r\n print(f[i], end = ' ')\r\n ", "\r\nn = int(input())\r\n*a, = map(int, input().split())\r\nb = sorted(a)\r\nb.reverse()\r\nans = []\r\nfor j in range(n):\r\n ans.append(b.index(a[j]) + 1)\r\nprint(*ans)\r\n", "input(); a = list(map(int, input().split()))\r\n[print(1 + sum(1 for j in a if j > i), end = ' ') for i in a]", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nb = sorted(a)[::-1]\r\nc = [b.index(i) + 1 for i in a]\r\nprint(*c)", "n=int(input())\ns=input()\na=list(map(int,s.split()))\ni=0\nwhile(i<n):\n\tcount=0\n\tj=0\n\twhile(j<n):\n\t\tif(a[j]>a[i]):\n\t\t\tcount+=1\n\t\tj+=1\n\tprint(1+count,end=\" \")\n\ti=i+1\n", "n = int(input())\r\ncountRating = []\r\nsequence = []\r\nfor i in range (0, 2001):\r\n countRating.append(0)\r\n sequence.append(0)\r\n\r\nrating = [int(x) for x in input().split()]\r\n\r\nfor rate in rating:\r\n countRating[rate] += 1\r\n\r\nfor i in range (2000, 0, -1):\r\n if countRating[i] != 0:\r\n sequence[i] = 1\r\n for j in range (i - 1, 0, -1):\r\n sequence[j] = sequence[j + 1] + countRating[j + 1]\r\n break\r\n\r\nfor rate in rating:\r\n print(sequence[rate], end=\" \")", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2015 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\npts = list(map(int, input().split()))\n\ns_pts = sorted(pts, reverse=True)\n\nfor i in range(len(pts)):\n print(s_pts.index(pts[i])+1, end=\" \")\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nfor i in li:\r\n print(1+sum(1 for j in li if i<j) ,end=\" \")", "n = [int(i) for i in input().split()][0]\r\na = [int(i) for i in input().split()]\r\nb = [0]*n\r\nans = [0]*n\r\nfor i in range(n):\r\n b[i] = (a[i],i)\r\nb = sorted(b, reverse = True)\r\nctr = 1\r\ncurscore = b[0][0]\r\nfor i in range(n):\r\n if b[i][0]<curscore:\r\n curscore = b[i][0]\r\n ctr = i+1\r\n ans[b[i][1]] = ctr\r\nprint (*ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = sorted(a, reverse=True)\r\nm = [0]*2001\r\ncur = 1\r\nm[b[0]] = cur\r\nfor idx in range(1, n):\r\n if b[idx] != b[idx-1]:\r\n cur = idx + 1\r\n m[b[idx]] = cur\r\nres = [0]*n\r\nfor i in range(n):\r\n res[i] = m[a[i]]\r\nprint(*res)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nv=[]\r\nfor i in range(len(a)):\r\n c=0\r\n for j in range(len(a)):\r\n if(i!=j and a[i] < a[j]):\r\n c+=1\r\n v.append(c+1)\r\nfor i in v:print(i,end=\" \")", "from collections import defaultdict\r\nn = int(input())\r\nrates = list(map(int,input().split()))\r\nmaps = defaultdict(int)\r\nfor rate in rates:\r\n maps[rate] += 1\r\nfor rate in sorted(maps.keys()):\r\n temp = maps[rate]\r\n maps[rate] = 1 + n - temp\r\n n -= temp\r\nfor i in range(len(rates)):\r\n rates[i] = maps[rates[i]]\r\nprint(*rates)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = a[:]\r\nfor i in range(n):\r\n s[i] = [s[i],i]\r\n\r\ns.sort(key = lambda s:s[0], reverse = True)\r\ns[0].append(0)\r\nfor i in range(1, n):\r\n if s[i][0] == s[i - 1][0]:\r\n s[i].append(s[i - 1][2])\r\n else:\r\n s[i].append(i)\r\n\r\ns.sort(key=lambda s: s[1])\r\n\r\nfor i in range(n):\r\n print('{} '.format(s[i][2] + 1), end = '')", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = sorted(a, reverse=True)\r\nc = {}\r\nd = 1\r\nfor i in range(n):\r\n if b[i] not in c:\r\n c[b[i]] = d\r\n d += 1\r\n\r\nfor i in range(n):\r\n print(c[a[i]], end=\" \")", "n=int(input())\na=list(map(int,input().split()))\nb=a\na=sorted(a)\na=a[::-1]\nc=1\nd=dict.fromkeys(a,0)\n#print(a)\nfor i in range(len(a)):\n if i==0:\n d[a[i]]=1\n else:\n if a[i]!=a[i-1]:\n d[a[i]]=d[a[i]]+c\n #print(c, end=\" \")\n c=c+1\n#print(d)\nfor i in b:\n print(d[i],end=\" \")\n \t \t\t \t\t \t\t\t\t\t\t \t\t \t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = sorted(a)\r\n\r\nfor i in range(0, int((n+1)/2)):\r\n aux = b[i]\r\n b[i] = b[n-i-1]\r\n b[n-i-1] = aux\r\n\r\nc = [1]\r\nfor i in range(1,n):\r\n c.append(i+1)\r\n if b[i] == b[i-1]:\r\n c[-1] = c[-2]\r\n\r\nfor i in range(0,n):\r\n for j in range(0, n):\r\n if a[i] == b[j]:\r\n print(c[j], end=\" \")\r\n break", "class Students:\r\n def __init__(self, id, marks):\r\n self.id = id\r\n self.marks = marks\r\nstudent = []\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nfor i in range(n):\r\n tmp = Students(i, v[i])\r\n student.append(tmp)\r\nstudent.sort(key=lambda student: student.marks, reverse = True)\r\n\r\nranks = [0]*n\r\nranks[student[0].id] = 1\r\nfor i in range(1, n):\r\n if student[i].marks == student[i - 1].marks:\r\n ranks[student[i].id] = ranks[student[i-1].id]\r\n else:\r\n ranks[student[i].id] = i + 1\r\n\r\nprint(*ranks)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = a[:]\r\nc = a[:]\r\nb.sort(reverse = True)\r\ntemp = b[0]\r\ncount = 1\r\nfor i in range (n):\r\n\tif(b[i] == temp):\r\n\t\tidx = a.index(b[i])\r\n\t\ta[idx] = 0\r\n\t\tc[idx] = count\r\n\telse:\r\n\t\ttemp = b[i]\r\n\t\tcount = i + 1\r\n\t\tidx = a.index(b[i])\r\n\t\ta[idx] = 0\r\n\t\tc[idx] = count\r\nfor i in range (n):\r\n\tprint(c[i], end=' ')", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n b.append(a[i])\r\na.sort()\r\na.reverse()\r\nc=[0]*n\r\nx=a[0]\r\nj=1\r\nv=1\r\nfor i in range(len(a)):\r\n if x==a[i]:\r\n c[b.index(a[i])]=v\r\n b[b.index(a[i])]=0\r\n else:\r\n v=i+1\r\n c[b.index(a[i])]=v\r\n b[b.index(a[i])]=0\r\n x=a[i]\r\nfor i in c:\r\n print(i,end=\" \")", "n = int(input())\r\na = input().split()\r\nc = [int(i) for i in a]\r\nd = sorted(c)\r\ne = d[::-1]\r\nfor i in c:\r\n print(1+ e.index(i), end=' ')\r\n", "n=int(input())\nl=list(map(int,input().split()))\nfor a in l:\n x=0\n for b in l:\n if(int(b)>int(a)):\n x+=1\n print(x+1,end=' ')\n", "x=int(input())\ny=list(map(int,input().split()))\narr=[]\nfor i in y:\n count=0\n for j in y:\n if i<j:\n count+=1\n arr.append(count+1)\nprint(*arr)\n \t\t \t\t\t\t \t \t\t \t\t\t\t \t\t \t \t", "n=int(input())\r\nrating=[]\r\nfor i in input().split():\r\n rating.append(int(i))\r\n\r\nfor i in range(n):\r\n count=0\r\n for j in range(n):\r\n if i!=j:\r\n if rating[j]>rating[i]:\r\n count+=1\r\n print(count+1,end=' ')", "import sys\nimport math\nfrom collections import defaultdict\n\n# sys.stdin = open('input.txt', 'r')\n# sys.stdout = open('output.txt', 'w')\n\ndef solve(test):\n\tn = int(input())\n\ta = list(map(int, input().split()))\n\tb = [(a[i], i) for i in range(n)]\n\tb.sort(key = lambda x: x[0], reverse = True)\n\tcount = 1\n\tc = []\n\tfor i in range(n):\n\t\tif i == 0:\n\t\t\tc.append((count, b[i][1]))\n\t\telse:\n\t\t\tif b[i][0] == b[i - 1][0]:\n\t\t\t\tc.append((c[-1][0], b[i][1]))\n\t\t\telse:\n\t\t\t\tc.append((count, b[i][1]))\n\t\tcount += 1\n\n\tc.sort(key = lambda x: x[1])\n\tres = []\n\tfor i in range(n):\n\t\tres.append(str(c[i][0]))\n\n\tans = ' '.join(res)\n\tprint(ans)\n\nif __name__ == \"__main__\":\n\ttest_cases = 1\n\tfor t in range(1, test_cases + 1):\n\t\tsolve(t)\n\n\t\t\t\t \t \t \t\t \t\t\t\t \t\t\t\t", "a=int(input())\r\nl=list(map(int,input().split()))\r\nk=sorted(l)\r\nk.reverse()\r\nfor x in range(a):print(1+k.index(l[x]),end=\" \")\r\n", "A = input().split()\r\nB = input().split()\r\nAarray = [int(x) for x in list(B)]\r\nd = ''\r\nfor x in Aarray:\r\n d += str((sorted(Aarray)[::-1].index(x) +1 ))+ ' ' \r\nprint(d)", "from collections import defaultdict\r\n\r\nstudents=int(input())\r\nratings=list(map(lambda x: int(x),input().split()))\r\nx=sorted(ratings.copy(),reverse=True)\r\ntemp_dict=defaultdict()\r\n\r\nfor i in range(len(x)):\r\n if not temp_dict.__contains__(x[i]):\r\n temp_dict[x[i]]=i+1\r\n\r\nfor i in range(len(ratings)):\r\n ratings[i]=str(temp_dict[ratings[i]])\r\nprint(' '.join(ratings))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nres = []\r\nfor i in range(n):\r\n count = 0\r\n for j in range(n):\r\n if a[i] < a[j]:\r\n count += 1\r\n res.append(count + 1)\r\nprint (*res)", "n=int(input())\na=list(map(int,input().split()))\nres=sorted(a,reverse=True)\nl=[]\nfor i in range(len(a)):\n x=a[i]\n s=res.index(x)\n l.append(s+1)\nprint(*l)\n \n\t \t \t\t \t\t \t \t \t \t \t", "n=input()\r\nl=list(map(int,input().split()))\r\nr=sorted(l)[::-1]\r\nfor x in l: print(r.index(x)+1)\r\n", "n=int(input())\na=list(map(int,input().split()))\nfor i in range(len(a)):\n count=0\n for j in range(len(a)):\n if a[j]>a[i]:\n count+=1\n print(count+1,end=\" \")\n\t\t\t \t\t\t \t\t\t\t \t\t\t \t\t\t \t\t\t \t \t", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=sorted(x,reverse=True)\r\nd={}\r\nd[y[0]]=1\r\nfor i in range(n):\r\n if i!=0 and y[i]!=y[i-1]:\r\n d[y[i]]=i+1\r\nfor i in x:\r\n print(d[i],end=\" \")", "n=int(input())\r\nk=0\r\nka=[]\r\na=[int(n) for n in input().split(\" \")]\r\nasort=sorted(a)\r\nfor i in range(len(a)):\r\n k=0\r\n for j in range(asort.index(a[i]),len(asort)):\r\n\r\n if asort[j]>a[i]:\r\n k=k+1\r\n k=k+1\r\n print(k,sep=\" \",end=\" \")\r\n", "x=int(input())\r\ns=[int(n) for n in input().split()]\r\nz=[]\r\nz+=s\r\ns.sort()\r\ns=s[::-1]\r\n\r\nfor n in range(x):\r\n print(s.index(z[n])+1,end=' ')", "#guhiz and contest\r\na=int(input())\r\ns=list(map(int,input().split()))\r\narr=[]\r\nfor i in s:\r\n count=0\r\n for j in s:\r\n if i<j:\r\n count+=1\r\n arr.append(count+1)\r\nprint(*arr)", "af=int(input())\narr=[int(b) for b in input().split()]\nfor i in range(af):\n c=0\n for j in range(af):\n if arr[j]>arr[i]:\n c+=1\n print(c+1,end=' ')\n\t\t\t \t\t \t \t \t \t \t\t \t", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nl=sorted(a,reverse=True)\r\nfor i in range(n):\r\n\tprint(l.index(a[i])+1,end=\" \")", "n=int(input())\nli=[int(x) for x in input().split()]\ns=1\nfor i in range(n):\n\tif li[i]>li[0]:\n\t\ts=s+1\nprint(s,end=\" \")\nfor i in range(1,n):\n\ts=1\n\tfor j in range(n):\n\t\tif li[j]>li[i]:\n\t\t\ts+=1\n\tprint(s,end=\" \")\n\t \t\t \t \t\t \t \t \t \t\t\t", "n=int(input())\na=[int(i) for i in input().split()]\nb=sorted(a,reverse=True)\ntemp=b[0]\nind=1\nl=[]\nm=[]\nm.append(temp)\nm.append(ind)\nl.append(m)\nfor i in range(1,len(a)):\n x=[]\n if b[i]==temp:\n continue\n else:\n x.append(b[i])\n temp=b[i]\n ind=i+1\n x.append(ind)\n l.append(x)\n\nfor i in range(len(a)):\n for j in range(len(l)):\n if(a[i]==l[j][0]):\n print(l[j][1],end=\" \")\n break\n else:\n continue\n\t\t\t\t \t\t \t \t \t\t\t \t\t\t\t\t \t", "class element:\r\n def __init__(self, value=0, pos=0, rank=0):\r\n self.value = value\r\n self.pos = pos\r\n self.rank = rank\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\narr_ele = []\r\n\r\nfor i in range(n):\r\n tmp = element(a[i], i, 0)\r\n arr_ele.append(tmp)\r\n\r\narr_ele.sort(key=lambda s: (-s.value))\r\n\r\narr_ele[0].rank = 1\r\nfor i in range(1, n):\r\n if (arr_ele[i].value == arr_ele[i-1].value):\r\n arr_ele[i].rank = arr_ele[i-1].rank\r\n else:\r\n arr_ele[i].rank = i+1\r\n\r\narr_ele.sort(key=lambda s: (s.pos))\r\n\r\nfor i in range(n):\r\n if (i == n-1):\r\n print(arr_ele[i].rank)\r\n else:\r\n print(arr_ele[i].rank, end=\" \")\r\n", "# https://codeforces.com/contest/551/problem/A\r\nn = int(input())\r\n\r\nnumbers = tuple(map(int, input().split()))\r\nsorted_numbers = sorted(numbers, reverse=True)\r\nrank = 1\r\nnumbers_dict = dict()\r\nfor i in sorted_numbers:\r\n if i in numbers_dict:\r\n pass\r\n else:\r\n numbers_dict[i] = rank\r\n rank += 1\r\n\r\nfor i in numbers:\r\n print(numbers_dict[i], end=\" \")", "##def count(coord:list, _list:list) -> list:\r\n## for i in range(coord[0]-1, coord[2]):\r\n## for j in range(coord[1]-1, coord[3]):\r\n## _list[i][j] += 1\r\n##\r\n##rec_num = int(input())\r\n##rec_list = []\r\n##maxi = 0\r\n##\r\n##for i in range(rec_num):\r\n## rec_list.append(input().split(' '))\r\n## for j in range(4):\r\n## rec_list[i][j] = int(rec_list[i][j])\r\n## current_maxi = max(rec_list[i])\r\n## maxi = max(maxi, current_maxi)\r\n##\r\n##rec_table = []\r\n##\r\n##for i in range(maxi):\r\n## rec_table.append([])\r\n## for j in range(maxi):\r\n## rec_table[i].append(0)\r\n##\r\n##for i in range(rec_num):\r\n## count(rec_list[i], rec_table)\r\n##\r\n##ans = 0\r\n##\r\n##for i in range(maxi):\r\n## for j in range(maxi):\r\n## ans = ans + rec_table[i][j]\r\n##\r\n##print(ans)\r\n\r\n\r\nnumber = int(input())\r\nstu_list = input().split(' ')\r\ndup_stu_list = []\r\n\r\nfor i in range(number):\r\n stu_list[i] = int(stu_list[i])\r\nfor i in range(number):\r\n dup_stu_list.append(stu_list[i])\r\n\r\nstu_list.sort()\r\nstu_list.reverse()\r\n\r\nnew_list = []\r\nfor i in range(number):\r\n new_list.append([])\r\n\r\njudge = False\r\n\r\nfor i in range(number-1):\r\n if not judge:\r\n new_list[i].append(stu_list[i])\r\n\r\n if stu_list[i+1] == stu_list[i]:\r\n judge = True\r\n else:\r\n judge = False\r\n\r\nif not judge:\r\n new_list[-1].append(stu_list[-1])\r\n\r\nans_list = []\r\ncount = 0\r\n\r\nwhile count<number:\r\n for i in range(number):\r\n if (new_list[i]!=[]) and (new_list[i][0]==dup_stu_list[count]):\r\n ans_list.append(i+1)\r\n count += 1\r\n break\r\n \r\nfor i in range(number):\r\n print(ans_list[i], end = ' ')\r\n\r\n\r\n\r\n", "n=int(input())\r\nmas = list(map(int,input().split()))\r\npos = [0]*n\r\nplace = 1\r\nSort = sorted(mas)\r\nwhile Sort:\r\n MAXI=Sort.pop()\r\n k=0\r\n for i in range(n):\r\n if mas[i]==MAXI:\r\n pos[i]=place\r\n mas[i]=0\r\n k+=1\r\n place+=k\r\nfor i in pos:\r\n print(i,end=' ')", "a = input()\r\nl = [ int(x) for x in input().split() ]\r\n\r\ndef count(x):\r\n i = 0\r\n for y in l:\r\n if x < y:\r\n i += 1\r\n return i\r\n\r\nfor x in l:\r\n print(\"{0}\".format(1 + count(x)), end=' ')", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=''\r\nfor k in range(n):\r\n l1=[i for i in range(n) if l[i]>l[k]]\r\n s=s+str(len(l1)+1)+' '\r\nprint(s)\r\n", "# print (\"Input n\")\nn = int(input())\n# print (\"Input student ratings on one line\")\nratings = input().split()\npairarray = []\nindex = 0\nfor st in ratings:\n num = int(st)\n pair = (num, index)\n pairarray.append(pair)\n index = index + 1\npairarray.sort(key=lambda x: x[0])\n\n# for p in pairarray:\n# print(p)\n\n# Initialize array of answers\nanswer = [0 for i in range(n)]\nfillpos = 0\ncurrent = 0\nwhile (fillpos < n):\n while (current < n and pairarray[fillpos][0] == pairarray[current][0]):\n current = current + 1\n while (fillpos < current):\n answer[pairarray[fillpos][1]] = n - current + 1\n fillpos = fillpos + 1\n\nfor i in answer:\n print (i, end=\" \")\n \n \n \n\n\n", "a=int(input())\ns=list(map(int,input().split()))\nfor k in range(len(s)):\n b=[i for i in s if(i>s[k])]\n print(1+len(b) , end =\" \")\n\t \t\t \t \t \t\t \t \t\t \t \t", "n = int(input())\nst = list(map(int,input().split()))\nlst = sorted(st)\nlst.reverse()\nsub = []\nfor i in range(n):\n sub.append(lst.index(st[i])+1)\nprint(*sub)\n\n\t\t \t\t \t\t\t \t\t \t\t\t\t\t\t \t \t \t \t\t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a, reverse=True)\r\nd = {}\r\npos = 1\r\nfor i in range(n):\r\n if b[i] in d:\r\n pos = pos + 1\r\n \r\n else:\r\n d[b[i]] = pos\r\n pos = pos + 1\r\n \r\nfor i in range(n):\r\n if a[i] in d:\r\n print(d[a[i]], end=' ')", "n= int(input())\r\nl = list(map(int,input().split(\" \")))\r\n\r\nll = []\r\n\r\nfor i in range(1,n+1):\r\n ll.append((l[i-1],i))\r\n\r\nll.sort(reverse=True)\r\n\r\n#print(ll)\r\n\r\nres = [0] * (n+1)\r\nres[ll[0][1]] = 1\r\n\r\ni = 1\r\nrank = 1\r\nprev = ll[0][0]\r\n\r\nwhile i < n:\r\n s = ll[i][0]\r\n ind = ll[i][1]\r\n if(s != prev):\r\n rank = i+1\r\n prev = s\r\n res[ind] = rank\r\n i += 1\r\n\r\nres = res[1:]\r\n\r\nprint(*res,sep=' ')", "def arr_inp():\r\n return [[x, int(y), 0] for x, y in enumerate(input().split())]\r\n\r\n\r\nn = int(input())\r\na = arr_inp()\r\na.sort(key=lambda x: x[1], reverse=True)\r\nfor i in range(0, n):\r\n if (i == 0):\r\n a[0][2] = i + 1\r\n elif (a[i][1] == a[i - 1][1]):\r\n a[i][2] = a[i - 1][2]\r\n else:\r\n a[i][2] = i + 1\r\na.sort(key=lambda x: x[0])\r\n\r\nfor i in range(n):\r\n print(a[i][2], end=' ')\r\n", "d=int(input())\nu=list(map(int,input().split()))\nh=sorted(u,reverse=True)\nfor i in range(d):\n print(h.index(u[i])+1,end=' ')\n\n\n \t \t\t \t \t \t\t \t \t\t\t \t \t", "n = int(input())\r\narr = [int(i) for i in input().split(' ')]\r\ncpy_arr = [int(i) for i in arr]\r\ncpy_arr.sort()\r\ncpy_arr.reverse()\r\n\r\nfor i in arr:\r\n print(cpy_arr.index(i)+1, end=' ')", "a=int(input())\nar=[int(b) for b in input().split()]\nfor i in range(a):\n c=0\n for j in range(a):\n if ar[j]>ar[i]:\n c+=1\n print(c+1,end=' ')\n\n \t\t \t\t \t \t \t \t\t\t\t \t\t \t\t\t\t\t", "import sys\r\n\r\na = int(input())\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nc = b[:]\r\nc.sort()\r\nc = c[::-1]\r\nd = list(set(b))\r\nd = d[::-1]\r\ne = {}\r\nt = \"\"\r\nfor i in range(0, len(d)):\r\n e[d[i]] = str(c.index(d[i]) + 1)\r\nfor i in range(0, a):\r\n t += str(e[b[i]]) + \" \"\r\nprint(t)\r\n", "# l=list(map(int,input().split()))\r\n# for x in l: print(sorted(l)[::-1].index(x)+1)\r\n\r\nimport sys\r\nimport math\r\n\r\n\r\ndef main():\r\n # sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n # sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n # sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n n = int(sys.stdin.readline().strip())\r\n arr = list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n for i in arr:\r\n print(sorted(arr)[::-1].index(i) + 1, end=' ')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# hajj\r\n# 　　　　　　 ＿＿\r\n# 　　　　　／＞　　フ\r\n# 　　　　　| 　_　 _ l\r\n# 　 　　　／` ミ＿xノ\r\n# 　　 　 /　　　 　 |\r\n# 　　　 /　 ヽ　　 ﾉ\r\n# 　 　 │　　|　|　|\r\n# 　／￣|　　 |　|　|\r\n# 　| (￣ヽ＿_ヽ_)__)\r\n# 　＼二つ\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n\ts = 1\r\n\tfor j in range(n):\r\n\t\tif(a[j]>a[i]):\r\n\t\t\ts+=1\r\n\tprint(s,end=' ')", "n=int(input())\nl=list(map(int,input().split()))\na=sorted(l,reverse=True)\nscore=a[0]\nrank=1\nb=[]\nc=[]\nb.append(score)\nb.append(rank)\nc.append(b)\nfor i in range(1,len(a)):\n result=[]\n if(a[i]==score):\n continue\n else:\n result.append(a[i])\n score=a[i]\n rank=i+1\n result.append(rank)\n c.append(result)\nfor i in range(len(l)):\n for j in range(len(c)):\n if(l[i]==c[j][0]):\n print(c[j][1],end=\" \")\n break\n else:\n continue\n \t \t \t \t \t \t \t \t \t \t \t\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n\tans=1\r\n\tfor j in a:\r\n\t\tif j>i:\r\n\t\t\tans+=1\r\n\tprint(ans,end=' ')\r\n\t\r\n", "n = int(input())\r\nscore = list(map(int, input().split()))\r\nsorted_score = sorted(score, reverse = True)\r\n\r\nrank = [0] * 2005\r\n\r\nfor i in range(n):\r\n sc = sorted_score[i]\r\n if rank[sc] == 0:\r\n rank[sc] = i + 1\r\n\r\nfor s in score:\r\n print(rank[s], end = ' ')\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nconst = [0 for y in range(max(a)+1)]\nfre = [ 0 for x in range(max(a)+1)]\nacc = 0\n\nfor i in range(len(a)):\n fre[a[i]]+=1\n\nfor i in range(max(a),0,-1):\n const[i] = 1 + acc\n acc += fre[i]\n \nfor i in range(len(a)):\n print(const[a[i]], end = \" \") \n \t \t\t \t \t\t \t\t\t \t\t \t \t \t", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na = sorted(list(enumerate(a)), key = lambda q: q[1], reverse = True)\r\nplaces = n*[0]\r\nplaces[a[0][0]] = 1\r\nfor i in range(1, n):\r\n\tif a[i][1] == a[i - 1][1]:\r\n\t\tplaces[a[i][0]] = places[a[i - 1][0]]\r\n\telse:\r\n\t\tplaces[a[i][0]] = i + 1\r\nprint(' '.join([str(i) for i in places]))", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl1 = sorted(l)\r\nl1.reverse()\r\nfor x in range(n):\r\n\tprint(l1.index(l[x])+1,end=' ')", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n print(1)\r\nelse:\r\n score = a.copy()\r\n score.sort(reverse = True)\r\n i = 0\r\n while i < n:\r\n print(score.index(a[i]) + 1, end = ' ')\r\n i += 1", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[0]*n\r\nfor i in range(n):\r\n c=1\r\n for j in range(n):\r\n if(a[j]>a[i]):\r\n c+=1\r\n b[i]=c\r\nprint(*b)\r\n \r\n ", "import sys\n\nn = int(input())\nan = list(map(int, sys.stdin.readline().split()))\n\nresult = []\nfor i in range(n):\n rank = 1\n for j in range(n):\n if i != j and an[j] > an[i]:\n rank += 1\n result.append(rank)\n\nprint(\" \".join(map(str, result)))\n", "n=int(input())\nls=list(map(int,input().split()))\na=list(set(ls))\na.sort(reverse=True)\nranks=[]\ns=1\nfor i in range(len(a)):\n\tranks.append(s)\n\ts=s+ls.count(a[i])\nfor i in range(n):\n\tprint(ranks[a.index(ls[i])],end=\" \")\n\t \t\t \t \t \t \t \t\t\t \t \t \t \t", "n=int(input())\nli=list(map(int,input().split()))[:n]\nfor x in li:\n\tprint(sorted(li)[::-1].index(x)+1,end=\" \")\n\t\t \t \t\t \t\t\t\t\t \t\t\t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in a: print(1 + sum(j > i for j in a), end = ' ')", "\n\n\n# your code goes here\n# your code goes here\nn = int(input())\nlst = [int(x) for x in input().split()]\nk = sorted(lst, reverse=True)\nfor i in lst:\n\tprint(k.index(i)+1,end=\" \")\n\t \t\t\t\t\t \t\t\t\t \t \t \t\t \t\t\t\t\t", "class Participant:\r\n def __init__(self, rating, place=-1):\r\n self.rating = rating\r\n self.place = place\r\n\r\n def __str__(self):\r\n return '({}, {})'.format(self.rating, self.place)\r\n\r\n def __repr__(self):\r\n return '({}, {})'.format(self.rating, self.place)\r\n\r\n\r\nparticipants = {}\r\np_array = []\r\nn = int(input())\r\nfor i, k in enumerate(k for k in map(int, input().split())):\r\n participants[i] = Participant(rating=k)\r\n p_array.append(participants[i])\r\n\r\nfor i in range(n):\r\n for j in range(n-1, i, -1):\r\n if p_array[j].rating > p_array[j-1].rating:\r\n temp = p_array[j]\r\n p_array[j] = p_array[j-1]\r\n p_array[j-1] = temp\r\n\r\np_array = [Participant(rating=-1, place=0)] + p_array\r\nfor i in range(1, n+1):\r\n if p_array[i].rating != p_array[i-1].rating:\r\n p_array[i].place = i\r\n else:\r\n p_array[i].place = p_array[i-1].place\r\n\r\nprint(' '.join([str(participants[i].place) for i in range(n)]))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(set(a))\r\nb.sort(reverse=True)\r\nc = [i+1 for i in range(len(b))]\r\npos = 0\r\nfor i in range(1,len(b)):\r\n pos += a.count(b[i-1])-1\r\n c[i] += pos\r\nfor i in range(n):\r\n print(c[b.index(a[i])],end=\" \")", "def count (n , x) : \r\n count = 0 \r\n for i in x : \r\n if i>n : \r\n count +=1 \r\n return count \r\nt = int(input())\r\nlistt = list(map(int, input().split()))\r\nfor i in listt : \r\n print(count(i ,listt)+1 , end=' ') \r\n", "n=int(input())\nl=[int(x) for x in input().split()]\nl1=l.copy()\nl.sort()\nd=0\nans={}\ni=n-1\nwhile(i>=0):\n d=d+1 \n if(i==n-1):\n c=d \n ans[l[i]]=c \n pre=l[i]\n elif(pre==l[i]):\n ans[l[i]]=c \n else:\n c=d\n ans[l[i]]=c\n pre=l[i]\n i=i-1\nfor x in l1:\n print(ans[x],end=\" \")\n \t \t \t \t \t\t\t \t \t\t \t", "# your code goes here\nn=int(input())\nl=list(map(int,input().split()))[:n]\nfor x in l:\n\tprint(sorted(l)[::-1].index(x)+1,end=\" \")\n\n\n \t \t \t \t\t\t \t\t\t \t \t\t\t \t\t \t\t\t\t", "from collections import Counter\r\n\r\nn = int(input())\r\nratings = [int(c) for c in input().split()]\r\nsrt = sorted((e for e in Counter(ratings).items()), reverse=True)\r\n\r\nprev_v = 0\r\nd = {}\r\nfor k, v in srt:\r\n d[k] = 1 + prev_v\r\n prev_v += v\r\n\r\nprint(*(d[elm] for elm in ratings))\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nfor i in range(n): print(1 + sum(1 for j in range(n) if a[j] > a[i]), end=' ')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tsum=0\r\n\tfor j in range(n):\r\n\t\tif a[j]>a[i]:\r\n\t\t\tsum+=1\r\n\tprint(sum+1,end=' ')", "n=int(input())\r\narr=list(map(int,input().split()))\r\nbrr=sorted(arr,reverse=True)\r\nfor i in range(n):\r\n print(brr.index(arr[i])+1,end=\" \")\r\n", "n=input()\nl=list(map(int,input().split()))\nfor x in l:\n print(sorted(l,reverse=True).index(x)+1)\n\t \t\t\t\t\t \t \t \t \t \t\t \t\t\t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n s=1\r\n for j in range(n):\r\n if l[j]>l[i]:\r\n s+=1\r\n print(s,end=' ')", "n = int(input())\nlis = list(map(int, input().split()))\nlis1 = sorted(lis)[::-1]\nans =[]\nfor i in lis:\n ans.append(lis1.index(i)+1)\nprint(*ans)\n\n\t\t \t \t\t \t\t \t\t\t \t\t \t \t\t\t", "# Time complexity = O(n)\nn = int(input())\na = list(map(int,input().split()))\nb = sorted(a, reverse=True)\nd = {}\npos = 1\nfor i in range(n):\n if b[i] in d:\n pos = pos + 1\n \n else:\n d[b[i]] = pos\n pos = pos + 1\n \nfor i in range(n):\n if a[i] in d:\n print(d[a[i]], end=' ')", "\n\n\n# your code goes here\n# your code goes here\nsam = int(input())\n\nsameer = [int(x) for x in input().split()]\n\nkrithi = sorted(sameer, reverse=True)\n\nfor reddy in sameer:\n\tprint(krithi.index(reddy)+1,end=\" \")\n\t\t\t\t\t \t \t \t\t \t\t\t \t\t \t\t\t\t\t", "class Triad:\r\n def __init__(self, first=None, second=None, third=None):\r\n self.first = first\r\n self.second = second\r\n self.third = third\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nlst = []\r\nfor i in range(n):\r\n lst.append(Triad(i, a[i]))\r\nlst.sort(key=lambda student: -student.second)\r\nfor i in range(n):\r\n if i == 0 or lst[i].second != lst[i-1].second:\r\n lst[i].third = i+1\r\n else:\r\n lst[i].third = lst[i-1].third\r\nlst.sort(key=lambda student: student.first)\r\nfor x in lst:\r\n print(x.third, end=' ')\r\n", "n=int(input())\r\na= list(map(int, input().split()))\r\nb=sorted(a,reverse=True)\r\nd={b[0]:1}\r\nfor i in range(1,n):\r\n if b[i]!=b[i-1] and b[i] not in d:d[b[i]]=i+1\r\nfor i in a:\r\n print(d[i],end=' ')\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy\nfrom itertools import chain, dropwhile, permutations, combinations\nfrom collections import defaultdict, deque\n\n# Guide:\n# 1. construct complex data types while reading (e.g. graph adj list)\n# 2. avoid any non-necessary time/memory usage\n# 3. avoid templates and write more from scratch\n# 4. switch to \"flat\" implementations\n\ndef VI(): return list(map(int,input().split()))\ndef I(): return int(input())\ndef LIST(n,m=None): return [0]*n if m is None else [[0]*m for i in range(n)]\ndef ELIST(n): return [[] for i in range(n)]\ndef MI(n=None,m=None): # input matrix of integers\n if n is None: n,m = VI()\n arr = LIST(n)\n for i in range(n): arr[i] = VI()\n return arr\ndef MS(n=None,m=None): # input matrix of strings\n if n is None: n,m = VI()\n arr = LIST(n)\n for i in range(n): arr[i] = input()\n return arr\ndef MIT(n=None,m=None): # input transposed matrix/array of integers\n if n is None: n,m = VI()\n a = MI(n,m)\n arr = LIST(m,n)\n for i,l in enumerate(a):\n for j,x in enumerate(l):\n arr[j][i] = x\n return arr\n\n\ndef run(n,a):\n # s = sorted(set(a))[::-1]\n # sp = [0] * len(s)\n # place = [1] * n\n # m = 0\n # for i,v in enumerated(s):\n # sp[i] = a.count(v)\n\n\n grades = [0] * 2002\n for i,v in enumerate(a):\n grades[v] += 1\n for i,v in enumerate(a):\n print(sum(grades[v+1:])+1,end=\" \")\n print()\n\n\ndef main(info=0):\n n = I()\n a = VI()\n run(n,a)\n\n\n\nif __name__ == \"__main__\":\n main()\n", "import bisect\n\nludi = int(input())\nludia = list(map(int, input().split()))\n\nrank = []\nporadie = sorted(ludia)\nfor clovek in ludia:\n i = bisect.bisect_right(poradie, clovek)\n rank.append(ludi - i + 1)\n\nprint(' '.join(map(str, rank)))\n", "if __name__ == \"__main__\":\n\tn = int(input().strip())\n\tarr = list(map(int, input().strip().split(' ')))\n\tfor num in arr:\n\t\tl = list(filter(lambda x: x > num, arr))\n\t\tprint(1 + len(l), end=\" \")\n\t\t \t \t \t\t\t\t\t \t\t\t \t \t\t\t \t", "n=int(input())\ns=list(map(int,input().split()))\nt=s[:]\nr=[]\nt.sort(reverse=True)\nd={}\nd[t[0]]=1\nr.append(1)\nfor i in range(1,n):\n if t[i-1]==t[i]:\n r.append(r[-1])\n d[t[i]]=r[-1]\n else:\n r.append(i+1)\n d[t[i]]=i+1\nfor i in s:\n print(d[i],end=\" \")\n\t \t\t \t \t\t \t\t \t\t\t\t \t \t \t\t \t", "n = int(input())\nl = [*map(int,input().split())]\nans = [1 for i in range(n)]\n\nfor i in range(n):\n for j in range(i+1,n):\n if l[i] > l[j]:\n ans[j]+=1\n elif l[j] > l[i]:\n ans[i]+=1\n else:\n pass\n\nprint(*ans)", "n=int(input())\nx=list(map(int,input().split()))\ny=sorted(x, reverse=True)\nfor i in range(0,n):\n for j in range(0,n):\n if x[i]==y[j]:\n print(j+1,end=\" \")\n break\n\n\t \t \t \t\t\t \t\t \t \t \t \t\t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\ntemp=a[:]\r\na.sort()\r\ny=a[::-1]\r\nx=[]\r\nx.append(1)\r\nfor i in range(1,n):\r\n if y[i-1]==y[i]:\r\n x.append(x[i-1])\r\n else:\r\n x.append(i+1)\r\n\r\nfor i in range(n):\r\n print(x[y.index(temp[i])],end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = sorted(a, reverse=True)\r\nprint(\" \".join(str(d.index(a[i]) + 1) for i in range(n)))", "num = int(input())\r\narr = list(map(int, input().split()))\r\nct = 1\r\nln = len(set(arr))\r\narr = [i*3000 for i in arr]\r\nwhile ln > 0:\r\n mx = max(arr)\r\n add = arr.count(mx)\r\n arr = [ct if i == mx else i for i in arr]\r\n ct += add\r\n ln -= 1\r\n\r\nprint(*arr)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in arr:\r\n\tcount = 0\r\n\tfor j in arr:\r\n\t\tif j > i:\r\n\t\t\tcount+=1\r\n\tif count == 0:\r\n\t print(1, end=\" \")\r\n\telse:\r\n\t print(count+1, end=\" \")\r\n", "t=int(input())\nl=list(map(int, input().split()))\nk=sorted(l,reverse=True)\nfor i in range(t):\n\tprint(k.index(l[i])+1,end=' ')\n\n\t \t\t\t\t \t\t \t \t\t \t \t \t\t", "n = int(input())\r\na = [int(s) for s in input().split(' ')]\r\na_sorted = sorted(a, reverse=True)\r\npredictions = []\r\nfor score in a:\r\n predictions.append(str(a_sorted.index(score) + 1))\r\nprint(' '.join(predictions))", "from sys import stdin\n\nn=int(stdin.readline())\na=[int(x) for x in stdin.readline().split()]\nfor i in range(n):\n c=0\n for j in range(n):\n if a[i]<a[j]:\n c+=1\n print(c+1,end=\" \")\n \n \n\t \t\t\t\t \t\t\t \t\t \t\t\t \t\t \t\t\t\t", "n = int(input().strip())\narr = list(map(int, input().strip().split()))\nsArr = sorted(arr, reverse=True)\nranks = {sArr[0]: 1}\nfor i in range(1, len(sArr)):\n\tif sArr[i] not in ranks:\n\t\tranks[sArr[i]] = i+1\nans = [ranks[i] for i in arr]\nprint(*ans)\n", "n=int(int(input()))\nlis=list(map(int,input().split()))\nlis1=sorted(lis)[::-1]\nlis2=[]\nfor i in range(len(lis1)):\n lis2.append(lis1.index(lis[i])+1)\nprint(*lis2)\n\n\t \t\t\t \t\t\t \t\t \t\t\t\t \t\t\t\t\t\t \t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nanswer = []\r\nfor i in range(n):\r\n counter = 0\r\n for j in range(n):\r\n if (j != i):\r\n if (arr[i] < arr[j]):\r\n counter += 1\r\n answer.append(counter + 1)\r\n\r\nprint(*answer)", "\nn=int(input())\narr=list(map(int,input().split()))\ns=sorted(arr,reverse=True)\ndic={}\nt=1\nfor i in s:\n if i not in dic:\n dic[i]=t\n t+=1\nfor i in arr:\n \n print(dic[i])\n \t\t\t \t \t \t\t \t\t \t\t", "from collections import Counter\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nfreq=dict(Counter(a))\r\nsa=list(set(a))\r\nsa.sort(reverse=True)\r\ncount=0\r\nrank={}\r\nfor i in sa:\r\n rank[i]=count+1\r\n count+=freq[i]\r\nout=[]\r\nfor i in a:\r\n out.append(rank[i])\r\nfor i in out:\r\n print(i,end=' ')\r\nprint('')", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted([(a[i], i) for i in range(n)], reverse = True)\r\nplace = 1\r\nans = [(a[0][1], 1)]\r\nfor i in range(1, n):\r\n if a[i][0] != a[i - 1][0]:\r\n place = i + 1\r\n ans.append((a[i][1], place))\r\nans.sort()\r\nans = [ans[i][1] for i in range(n)]\r\nprint(*ans)", "import sys\nn = int(input())\nalist = list(map(int, sys.stdin.readline().split()))\nblist = sorted(alist)[::-1]\nclist = [str(blist.index(a)+1) for a in alist]\nprint(' '.join(clist))\n", "students = int(input())\r\nrating = list(map(int, input().split(\" \")))\r\nstanding = 1\r\nratingCopy = rating.copy()\r\nres = [0] * students\r\nratingCopy.sort()\r\nwhile len(ratingCopy) > 0:\r\n bestRating = ratingCopy[len(ratingCopy) - 1]\r\n ratingCopy = [i for i in ratingCopy if i != bestRating]\r\n counter = 0\r\n for i in range(students):\r\n if rating[i] == bestRating:\r\n res[i] = standing\r\n counter = counter + 1\r\n standing = counter + standing\r\n\r\nfor n in res:\r\n print(n)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nk,h = list(l),[]\r\nk.sort()\r\nfor i in range(n):\r\n\th.append(n-k.index(l[i])-k.count(l[i])+1)\r\nprint(*h)", "n=int(input())\nl=list(map(int,input().split()))\nfor i in range(n):\n l[i]=(l[i],i)\na=[0]*(n)\nl.sort(reverse=True)\ny=1\nfor i in range(n-1):\n a[l[i][1]]=y\n if l[i][0]!=l[i+1][0]:\n y=2+i\na[l[n-1][1]]=y\nprint(*a)\n \t\t\t\t\t \t\t\t\t\t \t\t\t\t \t \t \t", "class Solution:\n def gukizAndContest(self, n, students):\n sortedStudents = sorted(students, reverse=True)\n\n results = []\n resultsMap = {}\n currentScore = students[0]\n higherPos = len(results)\n\n for i in range(n):\n if sortedStudents[i] != currentScore:\n currentScore = sortedStudents[i]\n higherPos = len(results)\n\n results.append(1 + higherPos)\n resultsMap[sortedStudents[i]] = 1 + higherPos\n\n results = []\n for i in range(n):\n results.append(resultsMap[students[i]])\n\n return results\n\n\n# n = 3\n# students = [1,3,3]\n\n# n = 1\n# students = [1]\n\n# n = 5\n# students = [3,5,3,4,5]\n# [5,5,4,3]\n\nn = int(input())\nstudents = list(map(int, input().split()))\n\nsolution = Solution()\nresult = solution.gukizAndContest(n, students)\nprint(*result)", "n = int(input())\r\nsorted_l = [(int(i),idx) for idx,i in enumerate(input().split())]\r\nsorted_l.sort(reverse=True)\r\ncount = 0\r\nlast_idx = 0\r\nlast_num = 0\r\nresult = [0]*n\r\nfor num,idx in sorted_l :\r\n count += 1 \r\n if num == last_num :\r\n result[idx] = result[last_idx]\r\n else :\r\n result[idx] = count\r\n last_num = num \r\n last_idx = idx\r\nprint(*result)", "n=int(input())\r\nr=list(map(int,input().split()))\r\nr1=[]\r\nfor i in range(n):\r\n r1.append(0)\r\na=list(set(r))\r\na.sort()\r\na.reverse()\r\nb=[]\r\nfor i in a:\r\n b.append(r.count(i))\r\ns=1\r\nfor i in range(len(a)):\r\n for j in range(n):\r\n if(r[j]==a[i]):\r\n r1[j]=s\r\n s+=b[i]\r\nfor i in r1:\r\n print(i,end=\" \")", "# your code goes here\nn=int(input())\na=list(map(int,input().split()))\nif n==1:\n print(\"1\")\nelse:\n\tb=[]\n\tfor i in a:\n\t\tb.append(i)\n\tfor i in a:\n\t\tc=0\n\t\tfor j in range(n):\n\t\t\tif i<b[j]:\n\t\t\t\tc=c+1\n\t\tprint(c+1,end=\" \")\n\tprint()\n\t\t \t\t\t\t\t \t\t \t\t \t \t \t \t\t \t", "N = int(input())\r\nA = list(map(int,input().split()))\r\nR = []\r\nfor X in A:\r\n pos = 1 + sum(X < Y for Y in A)\r\n R.append(pos)\r\nprint(*R)", "n = int(input())\r\na = []\r\na = list(map(int,input().split()))\r\nfor i in range(0,n):\r\n r = 1\r\n for j in range(0,n):\r\n if a[j]>a[i]: r += 1\r\n print(r,end=\" \")", "n=int(input())\na=list(map(int,input().split()))\nb=a.copy()\nc= []\nfor i in a:\n if i not in c:\n c.append(i)\nc.sort(reverse=True)\nr=1\nk=1\nfor i in range(len(c)):\n x=c[i]\n for j in range(len(a)):\n if a[j]==x:\n b[j]=r\n k=k+1\n r=k \nprint(*b,sep=\" \")\n \t\t\t\t \t \t\t \t\t\t\t \t \t \t\t", "n=int(input())\nl=[int(i) for i in input().split()]\nk=l.copy()\nk.sort(reverse=True)\nfor i in range(len(l)):\n\tl[i]=k.index(l[i])+1\nprint(*l)\n\t \t\t \t\t\t \t \t\t \t \t\t\t \t \t\t", "n = int(input())\na = list(map(int, input().split()))\n\nfor i in range(n):\n a[i] = (a[i], i)\na.sort(reverse = True)\nans = [0] * n\nans[a[0][1]] = 1\nfor i in range(1, n):\n if a[i][0] == a[i - 1][0]:\n ans[a[i][1]] = ans[a[i - 1][1]]\n else:\n ans[a[i][1]] = i + 1\n\nfor i in range(n):\n print(ans[i], end = ' ')\n \n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n print(sorted(l)[::-1].index(i)+1)", "b=1\r\nlst=[]\r\nz=int(input())\r\nv=list(map(int,input().split()))\r\n#x=v\r\nx=list(reversed(sorted(v)))\r\n#print('x=',x)\r\n#print('list v=',v)\r\n\r\nfor i in range(z):\r\n if i==0:\r\n lst.append(b)\r\n else:\r\n if x[i]!=x[i-1]:\r\n b=x.index(x[i])+1\r\n lst.append(b)\r\n#print('lst=',lst) \r\n#print('lst v=',v) \r\nfor s in range(z):\r\n \r\n y=x.index(v[s])\r\n # print('y=',y)\r\n print(lst[y],end=' ')\r\n x[y]=0\r\n ", "n=int(input())\ns=[int(x) for x in input().split()]\n\nfor i in range(n):\n c=0\n for j in range(n):\n if(s[i]<s[j]):\n c+=1\n print(c+1,end=\" \")\n \t\t\t \t\t\t \t\t \t\t \t \t\t\t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\ndef res(i):\r\n result=0\r\n for j in range (0,n):\r\n if(a[j]>a[i]):\r\n result+=1\r\n return result+1\r\nans=[res(i) for i in range(0,n)]\r\nfor i in range(0,n):\r\n print(ans[i],end=\" \")", "# http://codeforces.com/problemset/problem/551/A\r\n\r\nstudent_count = int(input())\r\nratings = list(map(int, input().split()))\r\n\r\nordered_ratings = list(sorted(ratings, reverse=True))\r\n\r\nrating_hash = {}\r\nfor i in range(0, len(ordered_ratings)):\r\n if ordered_ratings[i] not in rating_hash:\r\n rating_hash[ordered_ratings[i]] = i + 1\r\n\r\nfor i in range(0, len(ratings)):\r\n if ratings[i] in rating_hash:\r\n ratings[i] = rating_hash[ratings[i]]\r\n\r\nprint(\" \".join(str(x) for x in ratings))", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = dict()\r\nfor i in range(n):\r\n if a[i] in b:\r\n b[a[i]].append(i)\r\n else:\r\n b[a[i]] = [i]\r\nc = [0]*n\r\nk = 1\r\nfor i in sorted(b.keys(), reverse = True):\r\n for j in b[i]:\r\n c[j] = k\r\n k += len(b[i])\r\nfor i in c:\r\n print(i, end = ' ')\r\n", "'''input\n3\n1 3 3\n'''\nn = int(input())\ns = list(map(int, input().split()))\nc = sorted((s))[::-1]\nfor x in s:\n\tprint(c.index(x)+1, end=' ')\n\n\n\n\n\n\n\n\n\n", "n=input()\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n r= 1\r\n for j in a:\r\n if i<j: r += 1\r\n print(r)", "n=int(input())\r\n\r\nl=input().split()\r\n\r\nfor i in range(n):\r\n l[i]=int(l[i])\r\n\r\nfor i in range(n):\r\n k=0\r\n for j in range(n):\r\n if(j!=i):\r\n if(l[j]>l[i]):\r\n k+=1\r\n print(k+1,\"\",end=\"\")\r\n", "def main():\r\n n = int(input())\r\n ns = list(map(int, input().split()))\r\n\r\n d = {}\r\n ms = sorted(ns, reverse=True)\r\n i = 0\r\n while i < n:\r\n k = ms[i]\r\n c = i\r\n while c < n and ms[c] == k:\r\n c += 1\r\n d[k] = i + 1\r\n i = c\r\n\r\n for n in ns:\r\n print(d[n], end=' ')\r\n print()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=sorted(l)[::-1]\r\nfor i in l:\r\n print((1+p.index(i)),end=\" \")", "n=int(input())\nl=list(map(int,input().split()))\n# print(l)\np=sorted(l,reverse=True)\nfor i in l:\n print(p.index(i)+1,end=' ')\n\n \t\t\t\t \t \t \t \t \t\t \t \t\t\t", "def ranking(n, notas):\r\n rankingResult = ''\r\n\r\n for i in range(n):\r\n nota = 1\r\n for j in range(n):\r\n if((notas[j]) > (notas[i])):\r\n nota += 1\r\n rankingResult += str(nota) + ' '\r\n \r\n return rankingResult.strip()\r\n\r\nnAlunos = int(input())\r\nnotas = input().split()\r\n\r\nlistaNotas = list(map(int, notas))\r\n\r\nprint(ranking(nAlunos, listaNotas))\r\n", "def main_function():\r\n output_list = []\r\n t = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n a = [[a[i], i] for i in range(len(a))]\r\n a = sorted(a, key=lambda x:x[0], reverse=True)\r\n output_list.append([a[0][1], 1])\r\n interm = a[0]\r\n place = 1\r\n people_ranked = 1\r\n for i in range(1, len(a)):\r\n people_ranked += 1\r\n if interm[0] == a[i][0]:\r\n output_list.append([a[i][1], place])\r\n else:\r\n place = people_ranked\r\n interm = a[i]\r\n output_list.append([a[i][1], place])\r\n out = sorted(output_list, key=lambda x:x[0])\r\n out = [str(i[1]) for i in out]\r\n return \" \".join(out)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n", "n = int(input())\r\npupils = list(map(int, input().split()))\r\nfor elem in pupils:\r\n res = 1\r\n for elem2 in pupils:\r\n if elem2 > elem: res += 1\r\n print(res, end=' ')", "import sys\r\n\r\ndef main():\r\n n, *l = map(int, sys.stdin.read().strip().split())\r\n d = dict()\r\n for i,j in enumerate(sorted(l, reverse=True), 1):\r\n if not d.get(j): d[j] = i\r\n return map(d.get, l)\r\n \r\nprint(*main())\r\n", "from collections import Counter as C\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef miis():\r\n return map(int, input().split())\r\nn = int(input())\r\na = list(miis())\r\nc = C(a)\r\ne = 0\r\nfor i in sorted(list(set(a)), reverse=True):\r\n c[i], e = e, c[i]+e\r\nfor i in a:\r\n print(c[i]+1, end=' ')\r\n", "n = int(input())\r\nrating = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n rank = 1\r\n for j in range(n):\r\n if rating[j]>rating[i]:\r\n rank += 1\r\n print(rank,end=' ')", "def getRank(arr,n):\r\n arrCopy = arr.copy()\r\n arrCopy.sort(reverse=True)\r\n dictArr = {arrCopy[0]:1}\r\n pre = arrCopy[0]\r\n count = 2\r\n for i in range(1,n):\r\n if arrCopy[i] != pre:\r\n dictArr[arrCopy[i]] = count\r\n pre = arrCopy[i]\r\n count += 1\r\n ans = []\r\n for i in range(n):\r\n ans.append(dictArr[arr[i]])\r\n return ans\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nans = getRank(arr,n)\r\nfor num in ans:\r\n print(num, end=\" \")\r\n ", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nbsorted = sorted(a, key=lambda x: -x)\r\nranking_list = []\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i] == bsorted[j]:\r\n ranking_list.append(j + 1)\r\n break\r\nprint(*ranking_list, sep=' ')\r\n", "from bisect import bisect_right\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=sorted(l)\r\nfor i in l:\r\n d=bisect_right(s,i)\r\n print(n-d+1,end=\" \")\r\n ", "n = int(input())\na = list(map(int,input().split()))\n\nb = []\nfor x in a:\n\tmlc = 1\n\tfor y in a:\n\t\tmlc += (y > x)\n\tb.append(mlc)\n\nprint(*b)", "n=int(input())\na=list(map(int,input().split()))\nb=a.copy()\nb.sort(reverse=True)\nc=dict()\nfor i in range(1,n+1):\n try:\n if(c[b[i-1]]):\n pass\n except:\n c[b[i-1]]=i\nfor i in a:\n print(c[i],end=' ')\nprint()\n\t\t \t \t \t \t\t \t\t \t\t \t", "n=int(input())\na=list(map(int,input().split()))\nb=list(set(a))\nb.sort(reverse=True)\nx=[0]*n\nrank=1\nfor i in b:\n count=0\n for j in range(n):\n if i==a[j]:\n x[j]=rank\n count+=1\n rank+=count\n\nfor i in x:\n print(i,end=\" \")\n\t \t\t \t\t \t \t \t\t\t\t\t \t\t\t\t\t", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ndef position(l,k):\r\n m = len(l)\r\n s = 1\r\n if k<0 or k>m-1:\r\n return(-1)\r\n else:\r\n for i in range(m):\r\n if l[i]>l[k]:\r\n s += 1\r\n return(s)\r\n\r\nresult = []\r\nfor i in range(n):\r\n result.append(str(position(a,i)))\r\n\r\nprint(' ' .join(result))\r\n ", "n = int(input())\na = list(map(int, input().split()))\nrate_to_rank = dict()\n\nfor e, r in zip(sorted(a), range(n, 0, -1)):\n rate_to_rank[e] = r\n\nprint(' '.join(list(map(lambda x: str(rate_to_rank[x]), a))))\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = sorted(set(l), reverse=True)\r\nd = {s[0]: 1, }\r\nc = l.count(s[0])\r\nfor i in range(len(s[1::])):\r\n d[s[i+1]] = l.count(s[i]) + d[s[i]]\r\n\r\nfor i in l:\r\n print(d[i], end=' ')", "input()\r\nX = list(map(int, input().split()))\r\ncount = 1\r\nSet = set(X)\r\nSet = sorted(Set, reverse=True)\r\nMyDict = dict()\r\nMyDict[Set[0]] = 1\r\ncount += X.count(Set[0])\r\nfor i in range(1, len(Set)):\r\n MyDict[Set[i]] = count\r\n count += X.count(Set[i])\r\nfor i in range(len(X)):\r\n print(MyDict[X[i]], end=\" \")\r\n", "n,x=int(input()),list(map(int, input().split(\" \")))\r\ntmp=sorted(x,reverse=True)\r\nfor i in x:\r\n print(tmp.index(i)+1)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nar=sorted(arr,reverse=True)\r\na=dict()\r\nc=1\r\nfor ele in ar:\r\n if ele in a:\r\n a[ele]=a[ele]\r\n c+=1\r\n else:\r\n a[ele]=c\r\n c+=1\r\nfor ele in arr:\r\n print(a[ele],end=' ') ", "n = int(input())\r\n\r\na = input().split()\r\n\r\nfor i in range(n):\r\n a[i] = [int(a[i]),i]\r\n\r\na.sort()\r\na.reverse()\r\n\r\nansw = []\r\nfor i in range(n):\r\n answ.append(0)\r\nansw[a[0][1]] = 1\r\nk = 0\r\nfor i in range(1,n):\r\n if a[i][0] != a[i-1][0]:\r\n answ[a[i][1]] = i+1\r\n k = 0\r\n else:\r\n answ[a[i][1]] = i-k\r\n k += 1\r\n\r\n\r\nfor i in range(n):\r\n print(answ[i], end=' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nnew = []\r\nfor i in range(n):\r\n\tnew.append([a[i],i]) \r\n\r\nnew.sort(key = lambda x: x[0], reverse = True) \r\n\r\nnewAns = n*[0]\r\ni = 0 \r\ns = new[i][0]\r\nrating = 1 + i\r\nnewAns[new[i][1]] = rating\r\n\r\nfor i in range(1, n):\r\n\tif new[i][0] == s:\r\n\t\tnewAns[new[i][1]] = newAns[new[i-1][1]]\r\n\telse:\r\n\t\ts = new[i][0]\r\n\t\tnewAns[new[i][1]] = 1 + i\r\nprint(*newAns) ", "# Link: https://codeforces.com/problemset/problem/551/A\n# Site: Codeforces\n# Name: GukiZ and Contest\n# ======================================================\n\nif __name__ == '__main__':\n n = int(input())\n li = list(map(int, input().split()))\n\n li_sorted = sorted(li, key=lambda x: -x)\n for value in li:\n print(li_sorted.index(value) + 1, end=\" \") ", "n = int(input())\r\na = list(map(int, input().split()))[:n]\r\n\r\ncloneA = a.copy()\r\ncloneA.sort()\r\n\r\ndict = {}\r\nmax = cloneA[n - 1]\r\ndict[max] = 1\r\nnextPosition = 1\r\n\r\n# 3 3 4 5 5\r\nfor i in range(n - 2, -1, -1):\r\n nextPosition = nextPosition + 1\r\n if(cloneA[i] < max):\r\n max = cloneA[i]\r\n dict[max] = nextPosition\r\n\r\nfor i in range(n):\r\n print(dict[a[i]], end=\" \")", "def x(a,b):\r\n\tc=0\r\n\tfor s in a:\r\n\t\tif s>b :\r\n\t\t\tc=c+1\r\n\treturn c\r\nn=int(input())\r\nz=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tprint(1+x(z,z[i]),end=' ')", "n = int(input())\r\na = list(map(int,input().split()))\r\nsorted_a = sorted(a,reverse= True)\r\nrank = [0]*2001\r\n\r\nfor i in range(n):\r\n rating = sorted_a[i]\r\n if not rank[rating]:\r\n rank[rating] = i+1\r\nfor i in a:\r\n print(rank[i], end = ' ') ", "n = int(input())\na = list(map(int, input().split()))\nb = list(reversed(sorted(a.copy())))\nfor i in a:\n print(b.index(i)+1,end=' ')", "n = int(input())\r\n\r\nl = list(map(int ,input().split(' ')[:n]))\r\nc = 0\r\nd = {}\r\n\r\nfor i in l:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i] = 1\r\n \r\nmat= []\r\nfor i, k in d.items():\r\n a = [i,k]\r\n mat.append(a)\r\nans = []\r\nmat.sort()\r\nfor i in range(len(mat)):\r\n c = 0\r\n for j in range(i+1 , len(mat)):\r\n if mat[i][0] < mat[j][0]:\r\n c+= mat[j][1]\r\n ans.append(mat[i][0])\r\n ans.append(c+1)\r\n\r\n\r\nfinal = {}\r\nfor i in range(0,len(ans),2):\r\n final[ans[i]] = ans[i+1]\r\n \r\nfor i in l:\r\n print(final[i] ,end=' ')\r\n \r\n", "n=int(input())\na=list(map(int,input().split()))\nb=a[:]\nr=[]\nb.sort(reverse=True)\nd={}\nd[b[0]]=1\nr.append(1)\nfor i in range(1,n):\n if b[i-1]==b[i]:\n r.append(r[-1])\n d[b[i]]=r[-1]\n else:\n r.append(i+1)\n d[b[i]]=i+1\nfor i in a:\n print(d[i],end=\" \")\n \n \n\n\t \t \t \t\t \t \t\t\t\t \t\t\t\t\t", "n = int(input())\r\narr = [int(x)for x in input().split()]\r\n\r\nd = {}\r\n\r\nfor i in arr:\r\n if i in d: d[i]+=1\r\n else: d[i]=1\r\n\r\n\r\nd = dict(sorted(d.items(), key=lambda kv: kv[0], reverse=True))\r\ndd = {}\r\nc = 1\r\nfor k in d:\r\n v = d[k]\r\n while(v!=0):\r\n dd[k]=c\r\n v-=1\r\n c+=d[k]\r\n\r\nfor i in arr:\r\n print(dd[i], end=' ')", "\"\"\"\r\nCodeforces Contest 307 Div 2 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.4.2\r\n\"\"\"\r\n\r\n################################################### SOLUTION\r\n\r\ndef main():\r\n n, = read()\r\n a = read()\r\n k = [(a[i], i) for i in range(n)]\r\n k.sort(reverse=True)\r\n x = [0] * n\r\n pos = 0\r\n for i in range(n):\r\n if i == 0 or k[i][0] != k[i-1][0]: pos = i+1\r\n x[k[i][1]] = pos\r\n return x\r\n\r\n\r\n\t\r\n#################################################### HELPERS\r\n\r\n\r\n\r\ndef read(mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0: return inputs\r\n if mode == 1: return inputs.split()\r\n if mode == 2: return list(map(int, inputs.split()))\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = \"\"\r\n if isinstance(s, list): s = \" \".join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\nwrite(main())", "n = int(input())\r\na = [*map(int, input().split())]\r\nb = sorted(a, reverse = True)\r\nd = {}\r\nfor i in range(n):\r\n if not b[i] in d:\r\n d[b[i]] = i\r\nfor i in a:\r\n print(d[i] + 1, end = \" \")\r\nprint()", "n = int(input())\r\nst = list(map(int,input().split()))\r\nlst = sorted(st)\r\nlst.reverse()\r\nsub = []\r\nfor i in range(n):\r\n sub.append(lst.index(st[i])+1)\r\nprint(*sub)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ntemp = [0]*2001\r\n\r\nfor i in range(n):\r\n temp[a[i]] += 1\r\n\r\nk = 1\r\nnum = 0\r\nfor j in range(len(temp)-1,-1,-1):\r\n if(temp[j] != 0):\r\n num = temp[j]\r\n temp[j] = k\r\n k += num\r\n\r\nfor i in range(n):\r\n print(temp[a[i]], end=\" \")", "n = int(input())\r\nli = list(map(int, input().split()))\r\nnew = {}\r\nfor i in li:\r\n if i in new:\r\n new[i] += 1\r\n else:\r\n new[i] = 1\r\n\r\ncnt = 1\r\nfor i in sorted(new, reverse=True):\r\n tmp = new[i]\r\n new[i] = cnt\r\n cnt += tmp\r\n\r\nfor i in li:\r\n print(new[i], end=\" \")\r\n", "class Student:\r\n def __init__(self,id,rating):\r\n self.id = id\r\n self.rating = rating\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\npos = list()\r\n \r\nb = sorted(a)\r\nStudentList = []\r\n\r\nfor i in range(n):\r\n StudentList.append(Student(i,a[i]))\r\n \r\nStudentList = sorted(StudentList, key= lambda student: student.rating, reverse=True )\r\n\r\nranks = [0] * n \r\nranks[StudentList[0].id]= 1\r\n\r\nfor i in range(1,n):\r\n if StudentList[i].rating == StudentList[i - 1].rating:\r\n ranks[StudentList[i].id] = ranks[StudentList[i - 1].id]\r\n else:\r\n ranks[StudentList[i].id] = i + 1\r\n \r\nprint(*ranks)", "number=input()\nlists=list(map(int,input().split()))\nr=sorted(lists)[::-1]\nfor x in lists: print(r.index(x)+1,end=' ')\n \t \t\t \t \t \t \t \t\t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nfor i in l:\r\n t=1\r\n for j in l:\r\n if(i<j):\r\n t+=1\r\n print(t)\r\n\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)[::-1]\r\nfor i in a:\r\n print(b.index(i)+1)\r\n", "p = int(input())\na = list(map(int,input().split()[:p]))\nli = sorted(a,reverse = True)\nfor ele in a:\n res = li.index(ele)\n print(res + 1,end=\" \")\n \t \t \t \t \t \t \t \t \t\t \t\t\t\t", "n = int(input())\nli = [int(x) for x in input().split()]\na = sorted(li,reverse=True)\nd = dict()\nrank = 1\nfor i in a:\n if i in d:\n rank+=1\n else:\n d[i] = rank\n rank += 1\n#print(d)\nfor i in li:\n print(d[i],end=\" \")\n\t\t\t\t\t \t\t \t \t \t\t\t \t", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = {}\r\ni = 1\r\nt = l.copy()\r\nt.sort(reverse= True)\r\nwhile i<=n:\r\n d[int(t[i-1])] = i\r\n i = i + t.count(t[i-1])\r\nfor i in l:\r\n print(d[i] , end = \" \")\r\n", "aan = int(input())\r\naaa = [int(i) for i in input().split()]\r\nbaa = list(aaa)\r\nbaa.sort(reverse=True)\r\ndaa = {}\r\nfor i in range(len(baa)):\r\n if(daa.get(baa[i])):\r\n continue\r\n daa.update({baa[i]:i+1})\r\nfor i in aaa:\r\n print(daa.get(i),end=\" \")\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nnum_dict, max_count, m, l2, c = {}, l.count(max(l)), max(l), [], 0\r\nnum_dict[m] = c + 1\r\norg = l[:]\r\nc = c + max_count\r\n\r\nfor i in range(c):\r\n l2.append(m)\r\n l.remove(m)\r\n\r\nfor i in range(m, 0, -1):\r\n # print(i)\r\n if i in l and i not in l2:\r\n c += 1\r\n num_dict[i] = c\r\n l2.append(i)\r\n l.remove(i)\r\n c = c + l.count(i)\r\nfor i in org:\r\n print(num_dict[i], end = \" \")", "def solve(n, test):\r\n\r\n result = [0] * n\r\n high = max(test)\r\n rank = 1\r\n for i in range(high, 0, -1):\r\n count = 0\r\n for x in range(n):\r\n if test[x] == i:\r\n result[x] += rank\r\n count += 1\r\n\r\n rank += count\r\n\r\n print(' '.join(list(map(str, result))))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n test = list(map(int, input().split()))\r\n solve(n, test)", "n = int(input())\nlst = [int(x) for x in input().strip().split()]\nfor x in lst:\n print(sorted(lst,reverse=True).index(x)+1, end = \" \")\n\t\t \t\t \t\t \t\t\t\t\t\t\t \t \t \t", "n,l1,l2=int(input()),list(map(int,input().split())),[]\nl4=sorted(l1)\nl4=l4[::-1]\nfor i in l1:\n l2.append((l4.index(i))+1)\nprint(*l2)\n \t\t\t\t \t\t \t \t\t \t \t \t\t\t\t", "def main():\n n_students = int(input())\n students = [int(i) for i in input().split()]\n\n order = sorted(range(len(students)), key=lambda k: students[k], reverse = True)\n # print(order)\n ranks = [0]*n_students\n res = \"\"\n for i in range(n_students):\n if i == 0:\n ranks[order[0]] = 1\n else:\n if students[order[i]] == students[order[i-1]]:\n ranks[order[i]] = ranks[order[i-1]]\n else:\n ranks[order[i]] = i+1\n for rank in ranks:\n res += str(rank) + \" \"\n print(res)\nmain()\n\n \t\t\t \t \t\t\t\t\t \t\t \t\t\t \t\t\t", "n = int(input())\r\nratings = list(map(int, input().split()))\r\n\r\n# Create a list of tuples (rating, student_index) to keep track of original order\r\nratings_with_indices = [(rating, i) for i, rating in enumerate(ratings)]\r\n\r\n# Sort the list in non-increasing order of ratings, breaking ties using student index\r\nratings_with_indices.sort(reverse=True)\r\n\r\n# Initialize position array with 1\r\npositions = [1] * n\r\n\r\n# Assign positions based on sorted ratings\r\nfor i in range(1, n):\r\n if ratings_with_indices[i][0] == ratings_with_indices[i - 1][0]:\r\n positions[ratings_with_indices[i][1]] = positions[ratings_with_indices[i - 1][1]]\r\n else:\r\n positions[ratings_with_indices[i][1]] = i + 1\r\n\r\n# Print the positions in the original order\r\nprint(*positions)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=sorted(a)\r\nb=b[::-1]\r\np=[b[0]]\r\nq=[1]\r\nfor i in range(1,n):\r\n if(b[i]!=b[i-1]):\r\n q.append(i+1)\r\n p.append(b[i])\r\nfor i in a:\r\n for j in range(len(p)):\r\n if(i==p[j]):\r\n print(q[j],end=' ')", "def main():\n n = int(input())\n ratings = [int(_) for _ in input().split()]\n\n copied_ratings = ratings[::]\n copied_ratings.sort(reverse=True)\n positions = [1 for _ in range(n)]\n\n same_position_count = 0\n for i in range(1, n):\n if copied_ratings[i] == copied_ratings[i - 1]:\n positions[i] = positions[i - 1]\n same_position_count += 1\n else:\n positions[i] = positions[i - 1] + 1 + same_position_count\n same_position_count = 0\n\n position_dict = {}\n\n for i in range(n):\n position_dict[copied_ratings[i]] = positions[i]\n\n result = ['0' for _ in range(n)]\n\n for i in range(n):\n result[i] = str(position_dict[ratings[i]])\n\n print(' '.join(result))\n\n\nif __name__ == '__main__':\n main()\n", "def inp():\r\n return map(int, input().split())\r\n\r\nn = int(input())\r\nratings = list(inp())\r\n\r\nranks = [0] * n\r\n\r\nfor i in range(n):\r\n rank = 1\r\n for j in range(n):\r\n if ratings[j] > ratings[i]:\r\n rank += 1\r\n \r\n ranks[i] = rank\r\n\r\nprint(' '.join(map(str, ranks)))\r\n", "# 551A\r\nn = int(input()) # so luong hoc sinh\r\na = list(map(int,input().split())) # rating list\r\nu = [] # mang luu thu tu hoc sinh, de phuc vu xuat du lieu\r\n\r\nfor i in range (n):\r\n u.append([a[i],i])\r\nu=sorted(u)\r\nu.reverse()\r\n# print ('u =',u)\r\nrank = [[u[0][1],1]] # mang luu ranking cua hoc sinh kem thu tu\r\nfinal_rank = [] # mang luu ranking cua hoc sinh\r\nfor i in range (1,n):\r\n if (u[i][0] == u[i-1][0]):\r\n rank.append([u[i][1],rank[i-1][1]])\r\n# print ('rank=',rank)\r\n else:\r\n rank.append([u[i][1],i+1])\r\n# print ('rank1=',rank)\r\nrank.sort()\r\nfor i in range (n):\r\n final_rank.append(str(rank[i][1]))\r\nprint (' '.join(final_rank))", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn=int(input())\na=list(map(int,input().split()))\nd={}\nfor i in range(n):\n if a[i] in d:\n print(d[a[i]],end=\" \")\n else:\n c=1\n for j in range(n):\n if a[j]>a[i]:\n c+=1\n d[a[i]]=c\n print(c,end=\" \")", "n = int(input())\na = list(map(int, input().split()))\nranklist = []\nfor i in range(n):\n\tranklist.append((a[i],i))\n#print(ranklist)\nranklist = sorted(ranklist, reverse = True)\n#print(ranklist)\nanslist = [0 for i in range(n)]\nanslist[ranklist[0][1]] = 1\nval = ranklist[0][0]\nrank = 1\nfor i in range(1,n):\n\tif ranklist[i][0] == val:\n\t\tanslist[ranklist[i][1]] = rank\n\telse:\n\t\tanslist[ranklist[i][1]] = i+1\n\t\trank = i+1\n\t\tval = ranklist[i][0]\n\t\nprint (\" \".join(list(map(str, anslist))))\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n count=1\r\n for j in range(n):\r\n if(a[i]<a[j]):\r\n count+=1\r\n s.append(count)\r\n\r\nprint(*s)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nz=[]\r\nfor i in range(n):\r\n\tcount=0\r\n\tfor j in range(n):\r\n\t\tif l[i]<l[j]:\r\n\t\t\tcount+=1\r\n\tz.append(1+count)\r\nprint(*z)\t\t\t", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nk=sorted(l)\r\nfrom bisect import bisect_right\r\nfor i in l:\r\n print(n-bisect_right(k,i)+1,end=' ')\r\nprint()", "n = int(input())\r\nrating = list(map(int, input().split()))\r\n\r\nlst = [1] * n\r\n\r\nfor i in range(n):\r\n\r\n count = 0\r\n for value in rating:\r\n if rating[i] < value:\r\n count += 1\r\n lst[i] += count\r\n\r\nprint(*lst)", "n = int(input())\nratings = list(map(int, input().split()))\n\npositions = []\nfor i in range(n):\n position = 1\n for j in range(n):\n if ratings[j] > ratings[i]:\n position += 1\n positions.append(position)\n\nprint(' '.join(map(str, positions)))\n \t \t\t\t \t\t\t \t \t\t \t\t\t \t \t\t", "a=int(input())\r\nb=list(map(int, input().split(' ')))\r\nc=list(reversed(sorted(b)))\r\nx=[]\r\nfor i in b:\r\n x.extend([c.index(i)+1]*1)\r\nprint(*x)\r\n \r\n " ]

[ "'''\r\n7\r\n10 11 10 11 10 11 11\r\n'''\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\ns= sum(a)\r\n\r\na.sort(reverse=True)\r\nout = [s//n]*n\r\nrem = s%n\r\nfor i in range(rem):\r\n out[i]+=1\r\nres = 0\r\nfor i in range(n):\r\n res+=abs(a[i]-out[i])\r\nprint (res//2)\r\n", "import sys\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\nsum_val = sum(a)\r\n\r\na.sort()\r\n\r\nq = sum_val // n\r\nr = sum_val % n\r\n\r\nf = [q] * n\r\n\r\ni = n - 1\r\nwhile r > 0:\r\n f[i] += 1\r\n r -= 1\r\n i -= 1\r\n\r\nsum_diff = sum(abs(f[i] - a[i]) for i in range(n))\r\nresult = sum_diff // 2\r\n\r\nprint(result)\r\n", "n, ans = int(input()), 0\r\na = sorted(map(int, input().split()))\r\ns = sum(a)\r\nfor i in range(n):\r\n ans += abs(a[i] - s // n - (i >= n - s % n))\r\nprint(ans // 2)", "from math import ceil, floor\r\n\r\nn = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\navg = sum(arr) / n\r\n\r\navg_ceil = ceil(avg)\r\navg_floor = floor(avg)\r\n\r\n# arr.sort()\r\n\r\ncnt_up = 0\r\ncnt_dwn = 0\r\n\r\nfor a in arr:\r\n if a < avg_floor:\r\n cnt_dwn += avg_floor - a\r\n elif a > avg_ceil:\r\n cnt_up += a - avg_ceil\r\n\r\nprint(max(cnt_dwn, cnt_up))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nq=(sum(a)+n-1)//n\r\ny=sum(a)//n\r\nw,e=0,0\r\nr,t=0,0\r\nfor i in a:\r\n if i>y:\r\n r+=i-y\r\n else:\r\n t+=y-i\r\n\r\nfor i in a:\r\n if i>q:\r\n w+=i-q\r\n else:\r\n e+=q-i\r\nprint(max(min(w,e),min(r,t)))\r\n ", "import sys\nfrom os import path\nfrom collections import Counter\ndef get_int():\n return int(sys.stdin.readline())\ndef get_ints():\n return map(int,sys.stdin.readline().strip().split())\ndef get_string():\n return sys.stdin.readline().strip()\n\n \nt = 1\n \nfor _ in range(t):\n\tn = get_int()\n\tM = list(get_ints())\n\ts = sum(M)\n\tm = s//n\n\tr = s%n\n\tM.sort()\n\tfix = 0\n\tfor i in range(n-r):\n\t\tfix += abs(M[i]-m)\n\tfor i in range(n-r, n):\n\t\tfix+= abs(M[i]-(m+1))\n\tprint(fix//2)\n\n\n\n\t \t \t \t \t\t\t \t\t \t", "for _ in range(1):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n s=sum(l)//n \r\n t=sum(l)%n\r\n arr=[sum(l)//n]*n\r\n for i in range(len(arr)):\r\n if t>0:\r\n arr[i]+=1\r\n t-=1\r\n arr.sort()\r\n l.sort()\r\n ans=0\r\n for i in range(n):\r\n ans+=abs(arr[i]-l[i])\r\n print(ans//2) ", "def solve(arr,n):\r\n\r\n # most important : TO SORT\r\n arr.sort()\r\n ans=0\r\n avg=sum(arr)//n\r\n rem=sum(arr)%n\r\n for i in range(n):\r\n if i<n-rem:\r\n diff=arr[i]-avg\r\n\r\n else:\r\n diff=arr[i]-(avg+1)\r\n\r\n if diff>0:\r\n ans+=diff\r\n return ans\r\n\r\n\r\n\r\n\r\nn=int(input())\r\narr=[int(ele) for ele in input().strip().split()]\r\nprint(solve(arr,n))", "import math\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split(\" \")))\n a = sorted(a)\n s = sum(a)\n avg, carry = divmod(s, n)\n avgValCnt = n - carry\n ans = 0\n for i in range(avgValCnt):\n ans += abs(avg - a[i])\n for i in range(avgValCnt, n):\n ans += abs((avg+1) - a[i])\n print(ans // 2)\n\n\nt = 1\nif False:\n t = int(input())\nfor _ in range(t):\n solve()\n", "from collections import Counter\r\nimport functools\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = [int(i) for i in input().split(' ')]\r\n arr.sort(reverse=True)\r\n mean = sum(arr) // n\r\n err = 0\r\n new_arr = [mean for i in range(n)]\r\n for i in range(len(arr)):\r\n err += arr[i] - mean\r\n for i in range(n):\r\n if err == 0:\r\n break\r\n new_arr[i] += 1\r\n err -= 1\r\n res = 0\r\n for i in range(n):\r\n res += abs(arr[i] - new_arr[i])\r\n print(res // 2)\r\n\r\n\r\nmain()\r\n", "a = input()\nl = list(map(int, input().split()))\navg = 0\ns1 = 0\ns2 = 0\nfor i in l:\n\tavg += i\n\navg /= len(l)\nfor i in l:\n\tif (i<avg):\n\t\ts1+=(int(abs(i-avg)))\n\telse:\t\n\t\ts2+=(int(abs(i-avg)))\nprint(int(max(s1,s2)))\n\n\n\n\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\nSUM=sum(A)\r\na,b=0,0\r\nif SUM%n == 0:\r\n a,b=SUM//n,SUM//n\r\nelse:\r\n a,b=SUM//n,(SUM//n)+1\r\ncounta,countb=0,0\r\nfor val in A:\r\n if val<a:\r\n counta += abs(a-val)\r\n if val > b:\r\n countb += abs(val-b)\r\nif counta >= countb:\r\n print(counta)\r\nelse:\r\n print(countb)", "n = int(input()) # Number of servers\r\nm = list(map(int, input().split())) # Tasks assigned to each server\r\n\r\n# Calculate the average number of tasks per server (a) and rounded-up average (b)\r\na, b = sum(m) // n, (sum(m) + n - 1) // n\r\n\r\n# Calculate the maximum imbalance and print the result\r\nprint(max(sum(a - x for x in m if x < a), sum(x - b for x in m if x > b)))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\ntotal = sum(A)\r\na = total//N\r\nb = (total-1)//N+1\r\n\r\nc1,c2=0,0\r\nfor t in A:\r\n if t<a:\r\n c1+=a-t\r\n if t>b:\r\n c2+=t-b\r\nprint(max(c1,c2))\r\n \r\n", "\r\nimport math\r\nn_serv = int(input())\r\nsum = 0\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n_serv):\r\n sum += a[i]\r\n\r\n# print(\"sum = \", sum)\r\n\r\n# print(\"a before sort\", a)\r\na.sort()\r\n# print(\"a after sort\", a)\r\n\r\nq = sum // n_serv\r\n# print(\"q = \", q)\r\nr = sum % n_serv\r\n# print(\"r = \", r)\r\nf = [q] * n_serv\r\n# print(\"f = \", f)\r\ni = n_serv - 1\r\n# print(\"i = \", i)\r\n\r\nwhile r > 0:\r\n f[i] += 1\r\n r -= 1\r\n i -= 1\r\nsum = 0\r\n\r\n# print(\"f = \", f)\r\n\r\n# print(\"i = \", i)\r\nfor i in range(n_serv):\r\n sum += abs(f[i] - a[i])\r\n\r\n# print(\"=\" * 30)\r\n# print(\"Sum = \", sum)\r\nprint(sum // 2)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nif sum(arr)%n==0:\r\n p=sum(arr)//n\r\n print(sum([max(el-p,0) for el in arr]))\r\nelse :\r\n p=sum(arr)//n\r\n q=sum(arr)-p*n\r\n b=[p]*(n)\r\n for i in range(q):\r\n b[i]+=1\r\n b.sort()\r\n arr.sort()\r\n ans=0\r\n for a,i in zip(arr,b):\r\n ans+=max(0,i-a)\r\n print(ans)", "n = int(input())\r\ntasks = list(map(int, input().split()))\r\ntasks.sort()\r\ntotal = sum(tasks)\r\n\r\nc = 0\r\nmid = total // n\r\nrem = total % n\r\nv = [mid] * n\r\n\r\nfor i in range(rem):\r\n v[n - (i + 1)] += 1\r\n\r\nfor i in range(n):\r\n c += abs(tasks[i] - v[i])\r\n\r\nprint(c // 2)\r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport enum\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(3001)\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nms = list(map(int,input().split()))\r\nms.sort(reverse=True)\r\nss = sum(ms)\r\nd,y = divmod(ss,n)\r\nfor i in range(n):\r\n if i<y:\r\n ms[i]-=(d+1)\r\n else:\r\n ms[i]-=d\r\nans = 0\r\nfor i in range(n):\r\n if ms[i]>0:\r\n ans+= ms[i]\r\nprint(ans)", "import math\r\n\r\nn = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\nideal = []\r\ns = 0\r\nfor i in arr:\r\n\ts+=i\r\ndiv = int(s/n)\r\nrem = s%n\r\nfor i in range(0,n):\r\n\tif rem>0:\r\n\t\tideal.insert(i,div+1)\r\n\t\trem-=1\r\n\telse:\r\n\t\tideal.insert(i,div)\r\n\r\nideal.sort()\r\narr.sort()\r\n#print(ideal)\r\n#print(arr)\r\nans = 0\r\nfor i in range(0,n):\r\n\tans+= int(abs(ideal[i]-arr[i]))\r\nprint(int(ans/2))", "from math import floor, ceil\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\ns.sort()\r\nt = sum(s)\r\nmid = t // n\r\nrem = t % n\r\nans = 0\r\nv = [mid] * len(s)\r\nfor i in range(rem):\r\n v[n - (i + 1)] += 1\r\nfor i in range(n):\r\n ans += abs(s[i] - v[i])\r\nprint(ans // 2)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nm.sort()\r\ns = sum(m)\r\nl = []\r\n\r\nfor i in range(n):\r\n if i<s%n:\r\n l.append(s//n+1)\r\n else:\r\n l.append(s//n)\r\n\r\nl = l[::-1]\r\nans = 0\r\n\r\nfor mi, li in zip(m, l):\r\n ans += abs(mi-li)\r\n\r\nprint(ans//2)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\ns = sum(A)\r\nq, r = divmod(s, n)\r\nB = [q]*n\r\nfor i in range(r):\r\n B[i] += 1\r\nB.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += abs(A[i]-B[i])\r\nprint(ans//2)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nmin_s = s // n\r\np = 0\r\nres = []\r\nif s % n == 0:\r\n max_s = s // n\r\n for i in range(n):\r\n if a[i] != min_s:\r\n p += abs(a[i] - min_s)\r\n print(p // 2)\r\nelse:\r\n max_s = min_s + 1\r\n for j in range(n + 1):\r\n if j * min_s + (n - j) * max_s == s:\r\n p = 0\r\n min_k = j\r\n max_k = n - min_k\r\n for i in range(n):\r\n if a[i] <= min_s:\r\n if min_k > 0:\r\n p += abs(a[i] - min_s)\r\n min_k -= 1\r\n else:\r\n p += abs(a[i] - max_s)\r\n max_k -= 1\r\n else:\r\n if max_k > 0:\r\n p += abs(a[i] - max_s)\r\n max_k -= 1\r\n else:\r\n p += abs(a[i] - min_s)\r\n min_k -= 1\r\n res.append(p // 2)\r\n print(min(res))\r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\n \r\navg=sum(m)/n\r\nsum_positive=sum_negative=0\r\nfor i in range(n):\r\n\tdif=int(avg-m[i])\r\n\tif dif>0:\r\n\t\tsum_positive+=dif\r\n\telse:\r\n\t\tsum_negative+=dif\r\nprint(max(sum_positive,-sum_negative))\r\n", "import sys\r\n\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\ntotal = sum(a)\r\nx = total // n\r\ny = (total + n - 1) // n\r\ncollect = [x] * (n - (total % n)) + [y] * (total % n)\r\nans = 0\r\n\r\nfor i in range(n):\r\n delta = collect[i] - a[i]\r\n if delta > 0:\r\n ans += delta\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nmas.sort()\r\nd = sum(mas) // n\r\n#print (sum(mas))\r\n#print (n)\r\na = n - sum(mas) % n\r\nb = n - a\r\n#print (a)\r\n#print (b)\r\n#print (d)\r\nans = 0\r\nfor i in range(a):\r\n\t#print (mas[i])\r\n\tans += abs(mas[i] - d)\r\nfor i in range(a, a + b):\r\n\tans += abs(mas[i] - d - 1)\r\nprint (ans // 2)\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\na.sort()\r\nk=sum(a)\r\nt=k%n\r\navg=k//n\r\nfin=0\r\nfor i in range(n-t):\r\n fin+=abs(a[i]-avg)\r\nfor i in range(n-t, n):\r\n fin+=abs(a[i]-avg-1)\r\nprint(fin//2)", "import math\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nc=sum(b)/a\r\nans1,ans2=0,0\r\nfor i in b:\r\n if i>c:\r\n ans1+=i-math.ceil(c)\r\n if i<c:\r\n ans2+=math.floor(c)-i\r\nprint(max(ans1,ans2))", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nmi = list(map(int,input().split()))\r\ns = sum(mi)\r\nif s%n==0:\r\n ans = 0\r\n for i in range(n):\r\n ans+=abs((s//n)-mi[i])\r\n print(ans//2)\r\nelse:\r\n ans = 0\r\n d = s%n\r\n p = [(s//n) for i in range(n)]\r\n for i in range(1,d+1):\r\n p[-i]+=1\r\n mi.sort()\r\n for i in range(n):\r\n ans+=abs(mi[i]-p[i])\r\n print(ans//2)", "def solve(lst):\r\n sm=sum(lst)\r\n ln=len(lst)\r\n d=sm//ln\r\n rm=sm%ln\r\n lst.sort()\r\n lst.reverse()\r\n ans=0\r\n for i in range(rm):\r\n ans+=abs(lst[i]-(d+1))\r\n for i in range(rm,ln):\r\n ans+=abs(lst[i]-d)\r\n #print(ans)\r\n ans//=2\r\n return ans\r\n\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(solve(lst))\r\n", "n, m = int(input()), list(map(int, input().split()))\r\n \r\na, b = sum(m) // n, (sum(m) + n - 1) // n\r\n \r\nprint(max(sum(a - x for x in m if x < a), sum(x - b for x in m if x > b)))", "from math import ceil\r\nm = int(input())\r\na = [int(s) for s in input().split()]\r\n \r\n \r\nsum = 0\r\nfor i in range (m):\r\n sum += a[i]\r\n \r\nq = sum // m\r\n \r\na.sort()\r\n \r\nans = 0\r\nfor i in range(m - (sum - q * m)):\r\n ans += abs(a[i] - q)\r\nfor i in range(m - (sum - q * m), m):\r\n ans += abs(a[i] - q - 1)\r\n \r\nprint(ans // 2)", "n = int(input())\r\nm = list(map(int,input().split()))\r\nm.sort()\r\nif sum(m) % n == 0:\r\n g = [sum(m)//n] * n\r\nelse:\r\n tmp = sum(m)//n\r\n g = [tmp]*n\r\n left = sum(m) - tmp * n\r\n for i in range(left):\r\n g[-1-i] += 1\r\nans = 0\r\nr = n-1\r\nfor i in range(n):\r\n dif = g[i] - m[i]\r\n while dif != 0:\r\n if m[r] - g[r] > dif:\r\n m[r] -= dif\r\n m[i] += dif\r\n ans += dif\r\n dif = 0\r\n else:\r\n m[i] += m[r] - g[r]\r\n ans += m[r] - g[r]\r\n dif -= m[r] - g[r]\r\n m[r] = g[r] \r\n r -= 1\r\nprint(ans)\r\n \r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\nN = int(input())\nA = sorted(list(map(int,input().split())))\nans = 0\nk = sum(A)//N\n\nif k==0:exit(print(0))\nl = [k]*N\n\nfor i in range(1,sum(A)-(k*N)+1):\n l[-i]+=1\n\nfor i in range(N):\n ans+=(abs(A[i]-l[i]))\nprint(ans//2)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\ns=sum(l)\r\nk1=s//n\r\nk2=math.ceil(s/n)\r\nc=s-(k1*n)\r\nl1=[k1]*(n-c)+[k2]*c\r\nc1=0\r\nfor i in range(n):\r\n c1+=(abs(l[i]-l1[i]))\r\nprint(c1//2)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\na.sort()\r\nneed = s//n\r\nrem = s%n\r\nf = [need]*n\r\nfor i in range(n-1,-1,-1):\r\n if(rem==0): break\r\n f[i] += 1\r\n rem -= 1\r\n \r\nans = 0;\r\nfor i in range(n):\r\n if(a[i]>f[i]): ans += a[i]-f[i];\r\nprint(ans)\r\n", "import math\r\n\r\nn = int(input())\r\na = list(map(int, input().rstrip().split()))\r\nb = sorted(a)[::-1]\r\ns = sum(a)\r\nc = []\r\nresto = s % n\r\nfor i in range(n):\r\n if i < resto:\r\n c.append(math.ceil(s/n))\r\n else:\r\n c.append(math.floor(s/n))\r\nsomma = 0\r\nfor i in range(n):\r\n somma += abs(b[i]-c[i])\r\nsomma = somma // 2\r\nprint(somma)", "def solve(li,n):\r\n sum_val=sum(li)\r\n avg=sum_val//n\r\n rem=sum_val%n\r\n ans=0\r\n for i in range(n-rem):\r\n if li[i]<=avg:\r\n ans+=abs(avg-li[i])\r\n for i in range(n-rem,n):\r\n if li[i]<=(avg+1):\r\n ans+=abs(avg+1-li[i])\r\n return ans\r\n\r\n\r\n\r\nn=int(input())\r\nli=[int(ele) for ele in input().strip().split()]\r\nli.sort()\r\nprint(solve(li,n))", "ans=0\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nk1=sum(s)//n\r\nk2=(sum(s)+n-1)//n\r\na1=a2=0\r\nfor i in s:\r\n if i<k1:a1+=abs(i-k1)\r\n elif i>k2:a2+=abs(i-k2)\r\nprint(max(a1,a2))", "import math\nnum = int(input())\ndigits_str = input()\ndigits_list = digits_str.split(\" \")\ninteger_list = [int(digit_str) for digit_str in digits_list]\n# Alternatively, you can use the map() function to convert the substrings to integers\n# integer_list = list(map(int, digits_list))\n# print(integer_list)\n\nlist_sum = sum(integer_list)\nlist_avg = int(list_sum/num)\nparallel = list_avg * num\ndiff = list_sum - parallel\n\n# print(diff)\ninteger_list.sort()\n# print(integer_list)\nx=0\nfor i in range(num):\n if i < num-diff:\n x += abs(integer_list[i]-list_avg)\n else:\n x += abs(integer_list[i]-(list_avg+1))\n\nprint(int(x/2))\n", "from math import *\r\nn = int(input())\r\ns1 = 0\r\ns2 = 0\r\na = list(map(int, input().split()))\r\nsr = sum(a) / n\r\nfor i in a:\r\n if i > sr:\r\n s1 += i - ceil(sr)\r\n if sr > i:\r\n s2 += floor(sr) - i\r\nprint(max(s1,s2))\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ns = sum(a)\n\nwhole = s // n\nbigger = s % n\nsmaller = n - bigger\n\nres = 0\nfor i in range(smaller):\n res += abs(a[i] - whole)\nfor i in range(smaller, n):\n res += abs(a[i] - whole - 1)\n\nprint(res // 2)\n", "n=int(input())\r\nlst=[*map(int,input().split())]\r\nsumma=sum(lst)\r\ndiv,mod=summa//n,summa%n\r\nlst=[*reversed(sorted(lst))]\r\nres,i=0,0\r\nfor i,x in enumerate(lst):\r\n if x<=div:break\r\n if i<mod:res+=(x-(div+1))\r\n else:res+=(x-div)\r\n i+=1\r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\ns=sum(l)\r\nxs=s//n\r\nys=s%n\r\nnxs=n-ys\r\nls=[0]*n\r\nl.sort()\r\nfor i in range(n):\r\n if i<nxs:\r\n \tls[i]=abs(l[i]-xs)\r\n else:\r\n \tls[i]=abs(xs+1-l[i])\r\n\r\nprint(sum(ls)//2)\r\n", "n = int(input())\r\nm = sorted([int(x) for x in input().split()])\r\navg = sum(m)//(len(m))\r\nrem = sum(m) - avg*n\r\nlst= [avg]*(n-rem) + [avg+1] * rem\r\nprint(sum([abs(lst[i]-m[i]) for i in range(n)])//2)\r\n", "n = int(input())\nm = list(map(int, input().split()))\nm.sort(reverse=True)\n\ndiff = sum(m) % n\neach = sum(m) // n\n\nres = 0\nfor i in range(n):\n if diff != 0 and m[i] > each + 1:\n res += m[i] - (each + 1)\n diff -= 1\n elif diff == 0 and m[i] > each:\n res += m[i] - each\n\nprint(res)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ntot = sum(a)\r\nx = tot // n\r\nb = [x] * n\r\nrem = tot % n\r\nfor i in reversed(range(n)):\r\n\tif not rem:\r\n\t\tbreak\r\n\tb[i] += 1\r\n\trem -= 1\r\nprint(sum([abs(b[i]-a[i]) for i in range(n)]) // 2)", "n = int(input())\r\n\r\nm = list(map(int,input().split()))\r\nm.sort()\r\nt = sum(m) \r\n\r\ncnt = 0 \r\nmid = t // n \r\nrem = t % n \r\nv = [mid] * n \r\n\r\nfor i in range(rem):\r\n\tv[n-(i+1)] += 1 \r\nfor i in range(n):\r\n\tcnt += abs(m[i]-v[i])\r\nprint(cnt//2)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nsm=sum(a)\r\nL=sm//n\r\nR=(sm+n-1)//n\r\nres=0\r\nres2=0\r\nfor i in a:\r\n if i<=L:\r\n res+=L-i\r\n else:\r\n res2+=i-R\r\nprint(max(res,res2))", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nl_time = 0\r\nr_time = 0\r\ntotal = sum(arr)\r\navg = total//n\r\n\r\nfor i in range(n):\r\n if(arr[i] <= avg):\r\n l_time = l_time + avg - arr[i]\r\n else:\r\n r_time = r_time + arr[i] - (avg + 1)\r\n # print(arr[i],time)\r\n\r\nif(l_time >= r_time):\r\n print(l_time)\r\nelse:\r\n print(r_time)\r\n\r\n# print(time)", "N = int(input())\r\nM = list(map(int,input().split()))\r\nM.sort()\r\navg_lo = sum(M)//N\r\navg_hi = (sum(M)+N-1)//N\r\n\r\nans1 = 0\r\nans2 = 0\r\nfor m in M:\r\n ans1 += max(avg_lo-m,0)\r\n ans2 += max(m-avg_hi,0)\r\n\r\nprint(max(ans1,ans2))", "n = int(input())\r\ntasks = list(map(int, input().split()))\r\n\r\nmin_tasks_per_server = sum(tasks) // n\r\nmax_tasks_per_server = (sum(tasks) + n - 1) // n\r\n\r\noverloaded_tasks = sum(tasks[i] - max_tasks_per_server for i in range(n) if tasks[i] > max_tasks_per_server)\r\nunderloaded_tasks = sum(min_tasks_per_server - tasks[i] for i in range(n) if tasks[i] < min_tasks_per_server)\r\n\r\nrequired_seconds = max(overloaded_tasks, underloaded_tasks)\r\n\r\nprint(required_seconds)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=sum(a)//n\r\nc=[b]*n\r\nfor i in range(sum(a)%n):\r\n c[i]+=1\r\nc=c[::-1]\r\ns=0\r\nfor i in range(n):\r\n s+=abs(c[i]-a[i])\r\nprint(s//2)", "\r\nn = int(input())\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\nt.sort()\r\n\r\ns = sum(t)\r\n\r\navg = s//n\r\nmod = s%n\r\n\r\ntarget = [avg]*(n-mod) + [avg+1]*mod\r\n\r\nans =0\r\nfor i in range(n):\r\n ans += abs(target[i]-t[i])\r\n\r\nprint(ans//2)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\nx = sum(w)\r\na = sum(w)//n\r\nb = sum(w)%n\r\nc = 0\r\nfor i in range(b):\r\n q = w.pop()\r\n c += abs(q-a-1)\r\nwhile w:\r\n q = w.pop()\r\n c += abs(q - a)\r\nprint(c//2)", "import sys\r\nimport os.path\r\nfrom collections import *\r\nimport math\r\nimport bisect\r\n\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\nelse:\r\n input = sys.stdin.readline\r\n\r\n\r\n############## Code starts here ##########################\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\narr.sort()\r\ntot = sum(arr)\r\nx = tot//n\r\nrem = tot%n\r\narr1 = [x] * n\r\nfor i in range(rem):\r\n arr1[n-i-1]+=1\r\nres = 0\r\nfor i in range(n):\r\n res+=abs(arr[i]-arr1[i])\r\nprint(res//2)\r\n############## Code ends here ############################\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nc = sum(A) // n\r\nr = sum(A) % n\r\nlol = n - r\r\nans = 0\r\nfor d in A:\r\n if lol == 0:\r\n ans += abs(d - (c+1))\r\n elif r == 0:\r\n ans += abs(d - c)\r\n else:\r\n if d == c:\r\n lol -= 1\r\n elif d > c:\r\n ans += abs(d - (c+1))\r\n r -= 1\r\n else:\r\n ans += abs(d-c)\r\n lol -= 1\r\nprint(ans//2)", "import math\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nif n == 1:\r\n print(0)\r\n exit()\r\n\r\nl.sort()\r\nsom = sum(l)\r\nif som%n == 0:\r\n ans = 0\r\n i = 0\r\n j = n-1\r\n target = som//n\r\n rem = 0\r\n while i < j:\r\n x = l[j]\r\n diff = x-target\r\n l[j] -= diff\r\n diff2 = target-l[i]\r\n ans += diff\r\n ans += diff2\r\n i = i+1\r\n j = j-1\r\n\r\n print(ans//2)\r\n\r\nelse:\r\n ans = 0\r\n target = math.ceil(som/n)\r\n cnt1 = som%n\r\n cnt2 = n-cnt1\r\n c = 0\r\n i = 0\r\n while i < n:\r\n x = l[i]\r\n if c < cnt2:\r\n diff = abs(x - (target-1))\r\n ans += diff\r\n c += 1\r\n\r\n else:\r\n diff = abs(x-target)\r\n ans += diff\r\n\r\n i += 1\r\n\r\n print(ans//2)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\narr = sorted(arr)[::-1]\r\nsm = sum(arr)\r\nfinal = [sm//n]*n\r\nfor i in range(sm % n):\r\n final[i] += 1\r\n\r\nans = sum(abs(x-y) for x, y in zip(arr, final))\r\nprint(ans//2)", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n \r\n\r\ndef solve(): \r\n n=int(input())\r\n data=list(map(int,input().split()))\r\n data.sort(reverse=True)\r\n s=sum(data)\r\n a=s//n\r\n b=s%n\r\n ans=0\r\n for i in range(b):\r\n ans+=abs(data[i]-(a+1))\r\n for i in range(b,n):\r\n ans+=abs(a-data[i])\r\n print(ans//2)\r\n\r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "n = int(input())\r\na = sorted(map(int, input().split()))\r\ns = sum(a)\r\navg, mid = s // n, s % n\r\n\r\nans = 0\r\nwhile a:\r\n d = avg\r\n if mid:\r\n d += 1\r\n mid -= 1\r\n ans += abs(a.pop() - d)\r\nprint(ans // 2)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\na.sort()\r\ns = sum(a)\r\nr = s%n\r\nb = [s//n]*n\r\n\r\ni = n-1\r\nwhile r>0:\r\n b[i]+=1\r\n i-=1\r\n r-=1\r\n\r\ns = 0\r\nfor i in range(n):\r\n s += abs((a[i]-b[i]))\r\n \r\nprint(s//2)", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn = int(input()) \r\na = list(map(int, input().split()))\r\na.sort()\r\nk = sum(a) // n \r\nc = sum(a) % n \r\nb = [] \r\nfor i in range(n - c):\r\n b.append(k) \r\nfor i in range(c):\r\n b.append(k + 1) \r\ns = 0 \r\nfor i in range(n):\r\n s += abs(a[i] - b[i]) \r\nprint(s // 2)\r\n\r\n", "n = int(input())\nm = list(map(int, input().split()))\ns = sum(m)\nif s % n == 0:\n res = 0\n for x in m:\n res += abs(x - s//n)\n print(res//2)\nelse:\n lo,hi = s//n, s//n + 1\n res1,res2 = 0,0\n for x in m:\n if x < lo:\n res1 += lo - x\n elif x > hi:\n res2 += x - hi\n print(max(res1, res2))\n" ]

[ "n,m=map(int,input().split())\r\na,b=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\ni=0\r\nj=0\r\nwhile(i<n and j<m and i<a):\r\n if(arr1[i]<arr2[j]):\r\n i+=1\r\n else:\r\n j+=1\r\nif(i<a or m-j<b):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a,b = map(int,input().split())\r\nc,d = map(int,input().split())\r\nn = sorted(map(int,input().split()))\r\nm = sorted(map(int,input().split()))\r\nm.reverse()\r\nz = n[c-1]+1\r\nfor i in m:\r\n\tif i>=z:d-=1\r\n\tif d==0:\r\n\t\tbreak\r\nif d==0:print(\"YES\")\r\nelse:print(\"NO\")", "import heapq\r\n\r\ndef main():\r\n Na, Nb = map(int, input().split())\r\n K, M = map(int, input().split())\r\n arrA = list(map(int, input().split()))\r\n arrB = list(map(int, input().split()))\r\n\r\n # find K number of Array A, ensure it's smallest K numbers\r\n smallest = heapq.nsmallest(K, arrA)\r\n\r\n # find K number of Array A, ensure it's largest M numbers\r\n largest = heapq.nlargest(M, arrB)\r\n\r\n # compare smallest of smallest ft. largest of largest\r\n # print(smallest, largest)\r\n if smallest[-1] >= largest[-1]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n return True\r\n\r\nmain()", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))[0:k]\r\nb=list(map(int,input().split()))[-1:-m-1:-1]\r\nif a[-1]<b[-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# def sol():\r\n# for i in range(len(lst)):\r\n# for j in range(i+1, len(lst)):\r\n# if lst[i][1] > lst[j][1]:\r\n# return True\r\n# return False\r\n#\r\n#\r\n# n = int(input())\r\n# lst = []\r\n# lstb = []\r\n# for i in range(n):\r\n# p, q = [int(i) for i in input().split()]\r\n# lst.append((p, q))\r\n# lstb.append(q)\r\n# lst.sort(key=lambda x: x[0])\r\n# lstb.sort()\r\n# if sol():\r\n# print(\"Happy Alex\")\r\n# else:\r\n# print(\"Poor Alex\")\r\n\r\nna, nb = [int(i) for i in input().split()]\r\nk, m = [int(i) for i in input().split()]\r\nlsta = [int(i) for i in input().split()]\r\nlstb = [int(i) for i in input().split()]\r\nif lsta[k-1] < lstb[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, b = map(int, input().split())\r\nk, m = map(int, input().split())\r\nl1 = [int(i) for i in input().split()]\r\nl2 = [int(i) for i in input().split()]\r\nprint(\"YES\" if l1[k-1] < l2[b-m] else \"NO\")\t", "nA, nB = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nn1 = a[k-1]\r\nflag = 0\r\nfor i in range(m):\r\n j = i+1\r\n if b[-j] > n1:\r\n flag = 0\r\n else:\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "lenA, lenB = map(int, input().split())\r\nk, m = map(int, input().split())\r\narrA = list(map(int, input().split()))\r\narrB = list(map(int, input().split()))\r\nif(arrB[lenB - m] > arrA[k - 1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\n a, b = map(int, input().split())\n k, m = map(int, input().split())\n print((\"NO\", \"YES\")[k <= a and m <= b and int(input().split()[k - 1]) < int(input().split()[-m])])\n\n\nif __name__ == '__main__':\n main()\n", "def solve(A,B,k,m):\n\n k \n\n if A[k-1] < B[-m]:\n return(\"YES\")\n \n else:\n return(\"NO\")\n\n\n_ = input()\narr = [int(a) for a in input().split(\" \")]\n\nk = int(arr[0])\nm = int(arr[1])\n\nA = [int(a) for a in input().split(\" \")]\nB = [int(a) for a in input().split(\" \")]\n\nprint(solve(A,B,k,m))\n\t \t \t \t \t\t \t\t \t\t \t \t\t\t", "str1 = list(map(int,input().split()))\r\nna = str1[0]\r\nnb = str1[1]\r\nstr2 = list(map(int,input().split()))\r\nk = str2[0]\r\nm = str2[1]\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif a[k-1] < b[nb-m]:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "import sys\r\n\r\nelement_of_array = input()\r\nk_and_m = input()\r\narray1_raw = input()\r\narray2_raw = input()\r\n\r\nk, m = k_and_m.split()\r\nk = int(k) - 1\r\narray1 = array1_raw.split()\r\narray2 = array2_raw.split()\r\n\r\noffset = len(array2)-int(m)\r\n\r\nif int(array1[int(k)]) < int(array2[int(offset)]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input().split(' ')\nN = int(s[0])\nM = int(s[1])\n\ns = input().split(' ')\nA = int(s[0])\nB = int(s[1])\n\ns = input().split(' ')\na = [int(x) for x in s]\ns = input().split(' ')\nb = [int(x) for x in s]\n\nif a[A-1] < b[M-B]:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n", "n,m = map(int, input().split())\r\na,b = map(int, input().split())\r\nN = list(map(int, input().split()))\r\nM = list(map(int, input().split()))\r\nif N[a-1] >= M[-b]:\r\n print('NO')\r\nelse:\r\n print('YES')", "# BT1\nnA, nB = map(int, input().split())\nk, m = map(int, input().split())\n\nlstA = list(map(int, input().split()))\nlstB = list(map(int, input().split()))\n\nchosenA = []\nchosenB = []\nfor i in range(k):\n\tchosenA.append(lstA[i])\nfor i in range(-1, -m - 1, -1):\n\tchosenB.append(lstB[i])\n\nans = 'NO'\n# check whether max in chosen A < min in chosen B\nif chosenA[-1] < chosenB[-1]:\n\tans = 'YES'\nprint(ans)", "def main():\n na, nb = map(int, input().split())\n k, m = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n print((\"NO\", \"YES\")[k <= na and m <= nb and a[k - 1] < b[-m]])\n\n\nif __name__ == '__main__':\n main()\n", "# đọc dòng đầu tiên, chứa 2 số là số lượng phần tử của mảng A và B\r\nna, nb = map(int, input().split(' '))\r\n# đọc dòng thứ hai là 2 số k, m\r\nk, m = map(int, input().split(' '))\r\n# đọc dòng thứ 3 chứa mảng a\r\na = list(map(int, input().split(' ')))\r\n# đọc dòng thứ 4 chứa mảng b\r\nb = list(map(int, input().split(' '))) \r\n\r\n# so sánh để kiểm tra, tương tự dòng if của anh\r\nif a[k-1] < b[nb - m]:\r\n print (\"YES\") \r\nelse: \r\n print (\"NO\")\r\n", "R=lambda:map(int,input().split())\r\nn,m=R()\r\nk,l=R()\r\na=(list(R()))\r\nb=(list(R()))\r\nif a[k-1]<b[m-l]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "lenA , lenB = map(int,input().split())\r\nk , m = map(int,input().split())\r\nA = list(map(int,input().split())) #sorted\r\nB = list(map(int,input().split())) # sorted\r\n\r\ndef arrays(k : int , m : int , A : list() , B : list()) ->str:\r\n if A[k - 1] < B[lenB - m]:\r\n print(\"yes\")\r\n else:\r\n print(\"No\")\r\n\r\narrays(k,m,A,B)\r\n\r\n", "from sys import stdin, stdout\n\na, b = map(int, stdin.readline().strip().split())\nm, n = map(int, stdin.readline().strip().split())\n\nls = list(map(int, stdin.readline().strip().split()))\nls2 = list(map(int, stdin.readline().strip().split()))\n\nstdout.write(\"YES\\n\" if ls[m-1] < ls2[-n] else \"NO\\n\")\n\n \t \t\t\t\t \t\t \t \t\t \t \t \t \t", "# n = int(input())\r\n# a = [int(x) for x in input().split()]\r\n\r\n\r\n# size1, size2 = 3, 3\r\n# k, m = 2 , 1\r\n# a = [1, 2, 3]\r\n# b = [3, 4, 5]\r\n\r\n# size1, size2 = 3, 3\r\n# k, m = 3, 3\r\n# a = [1, 2, 3]\r\n# b = [3, 4, 5]\r\n\r\n# size1, size2 = 5, 2\r\n# k,m = 3, 1\r\n# a = [1, 1, 1, 1, 1]\r\n# b = [2, 2]\r\n\r\nsize = [int(x) for x in input().split()]\r\nsize1, size2 = size[0], size[1]\r\nnumber = [int(x) for x in input().split()]\r\nk, m = number[0], number[1]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\ndef test():\r\n if (b[size2-m] > a[k-1] ):\r\n print(\"YES\")\r\n return\r\n else:\r\n print(\"NO\")\r\n return\r\n\r\ntest()", "n1, n2 = [int(i) for i in input().split()]\r\nk, m = [int(i) for i in input().split()]\r\narr1 = [int(i) for i in input().split()]\r\narr2 = [int(i) for i in input().split()]\r\nif arr1[k - 1] < arr2[len(arr2) - m]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 22:11\r\n\r\n\"\"\"\r\n\r\nna, nb = map(int, input().split())\r\n\r\nk, m = map(int, input().split())\r\n\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nA.sort()\r\nB.sort(reverse=True)\r\n\r\nif k > na or m > nb:\r\n print(\"NO\")\r\nelse:\r\n if A[k-1] < B[m-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n,m=(input().split())\r\nn,m=int(n),int(m)\r\nk,l=(input().split())\r\nk,l=int(k),int(l)\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif a[k-1]<b[m-l]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# Nhập liệu\r\nN = list(map(int, input().split()))\r\nKM = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n# Rút gọn mảng A: Lấy k phần tử đầu tiên trong mảng A\r\ndel A[KM[0]: len(A)]\r\n# Rút gọn mảng B: Lấy m phần tử cuối cùng cùng trong mảng B\r\ndel B[0: len(B) - KM[1]]\r\n# Xét điều kiện: nếu số cuối cùng trong mảng A rút gọn < số đầu tiên trong mảng B rút gọn ==> YES\r\nif A[len(A)-1] >= B[0]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "Na,Nb=map(int, input().split())\r\nk,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nflag=True\r\nt=0\r\nd=0\r\nif k==Na and m==Nb:\r\n if a[Na-1]>=b[0]:\r\n flag=False\r\nelif k!=Na and m==Nb:\r\n for i in range (Na):\r\n if a[i]< b[0]:\r\n t+=1\r\n if t<k:\r\n flag=False\r\nelif k==Na and m!=Nb:\r\n for i in range (Nb):\r\n if a[Na-1]<b[i]:\r\n d+=1\r\n if d<m:\r\n flag=False\r\nelif k!=Na and m!=Nb:\r\n if a[k-1]>=b[Nb-m]:\r\n flag=False\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "def find_k_array(size_arr1, size_arr2, k, m, arr1, arr2):\r\n max_subset_arr1 = arr1[k - 1]\r\n min_subset_arr2 = arr2[size_arr2 - m]\r\n if max_subset_arr1 < min_subset_arr2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n first_input = list(map(int, input().split()))\r\n N_A = first_input[0]\r\n N_B = first_input[1]\r\n\r\n second_input = list(map(int, input().split()))\r\n K = second_input[0]\r\n M = second_input[1]\r\n\r\n A = list(map(int, input().split()))\r\n B = list(map(int, input().split()))\r\n\r\n find_k_array(N_A, N_B, K, M, A, B)\r\n", "r=lambda:map(int,input().split())\r\nr()\r\nk,m=r()\r\nA,B=list(r()),list(r())\r\nprint(('NO','YES')[A[k-1]<B[-m]])", "na, nb = map(int,input().split())\r\nk, m = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nai.sort()\r\nnum = ai[k-1]\r\nbi = list(map(int,input().split()))\r\nans = [int((bi[i] > num)) for i in range(nb)]\r\nif sum(ans) >= m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b=[int(i) for i in input().split()]\r\nk,m=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\nd=[int(i) for i in input().split()]\r\ne=c[k-1]\r\nf=d[b-m]\r\nif(e<f):\r\n print('Yes')\r\nelse:\r\n print('No')", "nA, nB = list(map(int, input().split()))\nk, m = list(map(int, input().split()))\nx1 = list(map(int, input().split()))\nx2 = list(map(int, input().split()))\nif x1[k - 1] < x2[-m:][0]:\n print('YES')\nelse:\n print('NO')\n", "na, nb = map(int, input().split())\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif a[n - 1] < b[nb - m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "# Link: https://codeforces.com/problemset/problem/691/A\n# Name: Arrays\n# ======================================================\n\nif __name__ == '__main__':\n nA, nB = list(map(int, input().split()))\n k, m = list(map(int, input().split()))\n li_A = list(map(int, input().split()))\n li_B = list(map(int, input().split()))\n\n if li_A[k - 1] < li_B[-1*m]:\n print(\"YES\")\n else:\n print(\"NO\")\n ", "nA,nB = input().split()\nnA,nB = int(nA),int(nB)\nk,m = input().split()\nk,m = int(k),int(m)\na = input()\nb = input()\nA = []\nB = []\nfor i in a.split():\n A.append(int(i))\nfor j in b.split():\n B.append(int(j))\nif A[k-1]<B[nB-m]:\n print('YES')\nelse:\n print('NO')\n ", "sa,sb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif a[k-1]<b[-m]:\r\n print('Yes')\r\nelse:\r\n print('No')", "na,nb = list(map(int,input().split(\" \")))\r\nk,m = list(map(int,input().split(\" \")))\r\na = sorted(list(map(int,input().split(\" \"))))\r\nb = sorted(list(map(int,input().split(\" \"))))\r\nif a[k-1]<b[nb-m]: print(\"YES\")\r\nelse: print(\"NO\")", "n, m = map(int, input().strip().split())\nxa, xb = map(int, input().strip().split())\na = list(map(int, input().strip().split()))\nb = list(map(int, input().strip().split()))\na.sort()\nb.sort(reverse=True)\nif a[xa-1] < b[xb-1]:\n\tprint('YES')\nelse:\n\tprint('NO') ", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nif A[k - 1] >= B[len(B) - m]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "input()\r\nk,m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\na.sort()\r\nb.sort()\r\nb.reverse();\r\nprint(\"YES\" if a[k-1] < b[m-1] else \"NO\")\r\n\r\n\r\n", "n1, n2 = map(int, input().split())\r\nk, m = map(int, input().split())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\n\r\nif a1[k - 1] < a2[n2 - m]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "input()\r\n\r\nk, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nprint(\"YES\" if a[k - 1] < b[len(b)-m] else \"NO\")\r\n", "input()\nk,m=map(int,input().split())\na=[int(x)for x in input().split()]\nb=[int(x)for x in input().split()]\nprint(\"YES\") if b[len(b)-m]>a[k-1] else print(\"NO\")", "Regel1 = input()\r\nRegel2 = input()\r\nRegel3 = input()\r\nRegel4 = input()\r\nLengteRijen = list(map(int, Regel1.split(\" \")))\r\nk_m = list(map(int, Regel2.split(\" \")))\r\nGetallen_A = list(map(int, Regel3.split(\" \")))\r\nGetallen_B = list(map(int, Regel4.split(\" \")))\r\n\r\nif Getallen_A[k_m[0]-1] < Getallen_B[LengteRijen[1]-k_m[1]]:\r\n print (\"Yes\")\r\nelse:\r\n print (\"No\")\r\n\r\n", "len1, len2 = map(int,input().split())\r\nk, m = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na=a[0:k]\r\nb=b[-m:]\r\nif a[-1]<b[0] :\r\n print('YES')\r\nelse:\r\n print('NO')", "n1, n2 = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = \"YES\"\r\n\r\nif a[k - 1] >= b[n2 - m]:\r\n ans = \"NO\"\r\n\r\nprint(ans)\r\n", "input()\r\nk, m = map(int, input().split())\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\n\r\na = A[k-1]\r\nb = B[-m]\r\n\r\nif a < b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a, b = map(int, input().split())\r\nm, k = map(int, input().split())\r\nmas1 = list(map(int, input().split()))\r\nmas2 = list(map(int, input().split()))\r\nif mas1[m - 1] >= mas2[-k]:\r\n print('NO')\r\nelse:\r\n print('YES') ", "n1, n2 = map(int, input().split())\nk1, k2 = map(int, input().split())\nl1, l2 = list(map(int, input().split())), list(map(int, input().split()))\n\nif l1[k1-1] < l2[-k2]:\n print('YES')\nelse:\n print('NO')\n", "n, m = map(int, input().split())\r\nk1, k2 = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif a[k1 - 1] < b[m - k2]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a, b = map(int, input().split())\r\nm, n = map(int, input().split())\r\narr_1 = list(map(int, input().split()))\r\narr_2 = list(map(int, input().split()))[::-1]\r\nif arr_1[:m][-1] < arr_2[:n][-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n1,n2=map(int,input().split())\r\nk,m=map(int,input().split())\r\nL1=list(map(int,input().split()))\r\nL2=list(map(int,input().split()))\r\nL=L1+L2\r\nif L1[k-1]<L2[-m] :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n_A, n_B = map(int, input().split())\r\nk, m = map(int, input().split())\r\narray_a = [int(x) for x in input().split()]\r\narray_b = [int(x) for x in input().split()]\r\n\r\nhighestOfLowestInArrayA = array_a[k - 1]\r\nlowestOfHighestInArrayB = array_b[-m]\r\n\r\nif highestOfLowestInArrayA < lowestOfHighestInArrayB:\r\n print(\"YES\")\r\n\r\nif highestOfLowestInArrayA >= lowestOfHighestInArrayB:\r\n print(\"NO\")\r\n\r\n", "# http://codeforces.com/problemset/problem/572/A\r\n\r\n[na, nb] = [int(i) for i in input().split()]\r\n[k, m] =[int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nif a[k-1] < b[nb-m]:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "def isValid(a, b, k, m, nb):\r\n if a[k - 1] < b[nb - m]:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\nna, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nprint(isValid(a, b, k, m, nb))\r\n", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort(reverse=True)\r\na1=a[:k]\r\nb1=b[:m]\r\nc=0\r\nif b1[-1]>a1[k-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num_input = input()\r\nnum_input = num_input.split(\" \")\r\nnA = int(num_input[0])\r\nnB = int(num_input[1])\r\nnum_input = input()\r\nnum_input = num_input.split(\" \")\r\nk = int(num_input[0])\r\nm = int(num_input[1])\r\nnum_input = input()\r\nnum_input = num_input.split(\" \")\r\nA = num_input\r\nnum_input = input()\r\nnum_input = num_input.split(\" \")\r\nB = num_input\r\nif (int(A[k - 1]) < int(B[nB - m])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "nA, nB = map(int, input().split())\r\nk, m = map(int, input().split())\r\n\r\nlA = list(map(int, input().split()))\r\nlB = list(map(int, input().split()))\r\n\r\nmaxA = lA[k-1]\r\nminB = lB[len(lB) - m]\r\n\r\nif maxA < minB:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "na, nb = [int(i) for i in input().split()]\r\nk,m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\nif a[k - 1] < b[nb - m]:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "a,b = list(map(int,input().split()))\r\nc,d = list(map(int,input().split()))\r\ne= sorted(list(map(int,input().split())))\r\nf= sorted(list(map(int,input().split())),reverse= True)\r\nprint(\"YES\" if e[c-1]<f[d-1] else \"NO\")", "Na, Nb = [int(i) for i in input().split()]\r\n\r\nk, m = [int(i) for i in input().split()]\r\n\r\nA = [int(i) for i in input().split()]\r\n\r\nB = [int(i) for i in input().split()]\r\n\r\nif A[k-1] < B [-m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "na, nb = map(int,input().split())\r\nk,m = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif a[k-1] < b[-m]:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "import sys\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\ninput = lambda:sys.stdin.readline().strip()\r\nli = lambda:list(map(int,input().split()))\r\nn1,n2 = li()\r\nk,m = li()\r\nA = li()\r\nB = li()\r\nif A[k-1] < B[n2-m]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nif(a[k-1]<b[nb-m]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n k1, k2 = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n B = list(map(int, input().split()))\r\n A.sort()\r\n B.sort(reverse=True)\r\n if max(A[:k1]) < min(B[:k2]):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# Enter your code here. Read input from STDIN. Print output to STDOUT\n \nif __name__ == '__main__':\n\ta, b = [int(x) for x in input().strip().split(\" \")]\n\tk, m = [int(x) for x in input().strip().split(\" \")]\n\tA = [int(x) for x in input().strip().split(\" \")]\n\tB = [int(x) for x in input().strip().split(\" \")]\n\ti = k-1\n\tj = b-m\n\tif A[i] < B[j]:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t\t\t\t \t\t \t\t\t\t \t \t \t\t \t \t\t \t\t", "n,m=(map(int,input().split()))\r\na,b=(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nif y[-b]>x[a-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\nk,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nbrr = list(map(int,input().split()))\r\nif arr[k-1]<brr[-m]:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "# BT1\r\nnA, nB = map(int, input().split())\r\nk, m = map(int, input().split())\r\n\r\nlstA = list(map(int, input().split()))\r\nlstB = list(map(int, input().split()))\r\n\r\nans = 'NO'\r\n# check whether max in chosen A < min in chosen B\r\nif lstA[k-1] < lstB[-m]:\r\n\tans = 'YES'\r\nprint(ans)", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\none = list(map(int, input().split()))\r\ntwo = list(map(int, input().split()))\r\nx, y = one[k-1], two[nb-m]\r\nprint([\"NO\",\"YES\"][x < y])", "inp=input()\r\ni=0\r\nf=inp.find(' ')\r\nnA=int(inp[i:f])\r\nnB=int(inp[f+1:])\r\ninp=input()\r\ni=0\r\nf=inp.find(' ')\r\nk=int(inp[i:f])\r\nm=int(inp[f+1:])\r\ninp=input()+' '\r\ni=0\r\na=[]\r\nb=[]\r\nfor j in range(0,nA):\r\n f=inp.find(' ',i)\r\n a+=[int(inp[i:f])]\r\n i=f+1\r\ninp=input()+' '\r\ni=0\r\nfor j in range(0,nB):\r\n f=inp.find(' ',i)\r\n b+=[int(inp[i:f])]\r\n i=f+1\r\nif a[k-1]<b[nB-m]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "strinp = str(input()).split(sep = ' ')\r\nstrinp2 = str(input()).split(sep = ' ')\r\nn=int(strinp[0])\r\nm=int(strinp[1])\r\nk=int(strinp2[0])\r\nl=int(strinp2[1])\r\nmasa=str(input()).split(sep=' ')\r\nmasb=str(input()).split(sep = ' ')\r\nif(int(masa[k-1])<int(masb[m-l])):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "na , nb = map(int,input().split())\r\nk , m = map(int,input().split())\r\na = list(map(int,input().split()))[:na]\r\nb = list(map(int,input().split()))[:nb]\r\nif(a[k-1]<b[nb-m]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nl, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nif (a[l - 1] < b[m - k]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na, nb = (int(x) for x in input().split())\nk, m = (int(x) - 1 for x in input().split())\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()[::-1]]\nprint('YES' if a[k] < b[m] else 'NO')\n", "i = lambda : [*map(int, input().split())]\r\nla, lb = i()\r\nk, m = i()\r\na = i()\r\nb = i()\r\nprint(\"YES\" if a[k - 1] < b[-m] else \"NO\")\r\n", "a,b= map(int, input().split())\r\nk,m= map(int, input().split())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nprint('YES' if x[k-1]<y[-m] else 'NO')\r\n", "nA, nB = map(int, input().split())\r\nk, m = map(int, input().split())\r\nlistA = [i for i in map(int, input().split())]\r\nlistB = [i for i in map(int, input().split())]\r\n#print(listA)\r\n\r\n#print(listA[k - 1])\r\n#print(listB[-m])\r\nif listA[k - 1] < listB[-m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nna, nb = [int(x) for x in input().split()]\r\nk, m = [int(x) for x in input().split()]\r\nqa = [int(x) for x in input().split()]\r\nqb = [int(x) for x in input().split()]\r\nprint(\"YES\" if qa[k-1] < qb[-m] else \"NO\")\r\n", "na,nb=map(int,input().split())\r\nk,m =map(int,input().split())\r\n\r\nla=list(map(int,input().split()))\r\nlb=list(map(int,input().split()))\r\n\r\nif(la[k-1]<lb[-(m)]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n n_a, n_b = str(input()).split()\r\n k, m = str(input()).split()\r\n k = int(k)\r\n m = int(m)\r\n line_a = str(input()).split()\r\n line_a = [int(it) for it in line_a]\r\n line_a.sort()\r\n line_b = str(input()).split()\r\n line_b = [int(it) for it in line_b]\r\n line_b.sort(reverse=True)\r\n if line_a[k - 1] < line_b[m - 1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "input()\r\nnumbers_a_to_choose, numbers_b_to_choose = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nprint('YES') if a[numbers_a_to_choose - 1] < b[-numbers_b_to_choose] else print('NO')\r\n", "input()\nk, m = map(int, input().split())\n*a, = sorted(map(int, input().split()))\n*b, = sorted(map(int, input().split()), reverse=True)\nprint('YES' if a[k - 1] < b[m - 1] else 'NO')", "n, m = map(int, input().split())\r\na, b = map(int, input().split())\r\nc = list(sorted(map(int, input().split())))\r\nd = list(sorted(map(int, input().split())))\r\n\r\nif c[a-1] < d[-b]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# arrays\r\nna, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\n\r\narrA = list(map(int, input().split()))\r\narrB = list(map(int, input().split()))\r\n\r\nif arrA[k-1] >= arrB[len(arrB)-m]:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "a1,b1=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nc=a[k-1]\r\ni=0\r\nwhile(i<b1):\r\n if(b[i]>c):\r\n break\r\n i+=1\r\nif(len(b[i:])>=m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m,n = [int(x) for x in input().split()]\ni,j = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nprint(\"YES\" if a[i-1] < b[-j] else \"NO\")", "n,n2 = map(int,input().split())\r\nk,m = map(int,input().split())\r\na= list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif a[k-1] < b[-m]: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "x,y = map(int,input().split())\r\nk,m = map(int,input().split())\r\na=[int(x) for x in input().split()];a.sort()\r\nb=[int(x) for x in input().split()];b.sort()\r\nif a[k-1]<b[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "# Name : Sachdev Hitesh\r\n# College : GLSICA\r\na, b = map(int,input().split())\r\nm, n = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nd = list(map(int,input().split()))\r\nif c[m - 1] < d[b - n]:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve(a,b,n,m):\r\n a,b=sorted(a),sorted(b,reverse=True)\r\n if a[n-1]<b[m-1]:\r\n return \"YES\"\r\n return \"NO\"\r\nx,y=map(int,input().split())\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nprint(solve(a,b,n,m))", "a_len, b_len = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\nlist_a = list(map(int, input().split()))\r\nlist_b = list(map(int, input().split()))\r\nif list_a[k - 1] < list_b[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\nn, k = map(int, input().split())\r\nls = sorted(list(map(int, input().split())))\r\nls1 = list(map(int, input().split()))\r\nls1.sort(reverse=True)\r\nx, y = [], []\r\nfor i in range(n):\r\n x.append(ls[i])\r\nfor i in range(k):\r\n y.append(ls1[i])\r\nif max(x) >= min(y):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 6 20:15:36 2021\r\n\r\n@author: Lai Phuc\r\n\"\"\"\r\nNa,Nb = map(int, input().split(\" \"))\r\nk, m = map(int, input().split(\" \"))\r\nA = list(map(int, input().split(\" \")))\r\nB = list(map(int, input().split(\" \")))\r\n\r\nif A[k-1] < B[-m]:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "na, nb = map(int, input().split())\n\nk, m = map(int, input().split())\n\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\n\nprint('YES' if a[k-1] < b[nb-m] else 'NO')\n", "input()\ndata = [ int(info) for info in input().split(\" \") ]\n\nfirst_array_length = data[0]\nsecond_array_length = data[1]\n\nfirst_array = [ int(info) for info in input().split(\" \") ]\nsecond_array = [ int(info) for info in input().split(\" \") ]\n\nif(first_array[first_array_length - 1] >= second_array[len(second_array) - second_array_length]):\n print('NO')\nelse:\n print('YES')\n", "nA,nB=map(int,input().split())\r\nk,m=map(int,input().split())\r\nlstA=list(map(int,input().split()))\r\nlstB=list(map(int,input().split()))\r\nif lstA[k-1]<lstB[nB-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n_a, n_b = map(int, input().split())\r\nk, m = map(int, input().split())\r\n\r\nm *= -1\r\nresult = 'YES'\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n if a[i] >= b[m]:\r\n result = 'NO'\r\n break\r\n\r\nprint(result)\r\n", "i = input\r\ndef ii(): return list(map(int,i().split()))\r\ni(); k,m = ii(); a,b = ii(),ii()\r\nprint(\"YES\" if (a[:k])[-1] < (b[len(b)-m:])[0] else \"NO\")", "# Arrays\r\n# https://codeforces.com/problemset/problem/572/A\r\n\r\nna, nb = map(int, input().split())\r\nka, mb = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif (a[ka-1] < b[len(b)-mb]):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "\r\ninput().split()\r\nk, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split())), reverse=True)\r\nc = a[k-1]\r\nd = b[m-1]\r\nif c >= d:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n# CodeForcesian\r\n# ♥\r\n# Sad\r\n", "size_1, size_2 = (eval(i) for i in input().split())\r\nnb_1, nb_2 = (eval(i) for i in input().split())\r\ntab_1 = [int(i) for i in input().split()]\r\ntab_2 = [int(i) for i in input().split()]\r\nif size_1<nb_1 or size_2<nb_2:\r\n print ('NO')\r\nelif tab_1[nb_1-1]<tab_2[-nb_2]:\r\n print('YES')\r\nelse:\r\n print('NO')", "\ndata = list(map(int,input().split()))\nnA = data[0]\nnB = data[1]\n\ndata = list(map(int,input().split()))\nk = data[0]\nm = data[1]\n\nA = list(map(int,input().split()))\nB = list(map(int,input().split()))\n\nif(A[k-1] < B[nB - m]):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t \t \t \t \t", "na, nb = map(int, input().split(\" \"))\r\nma, mb = map(int, input().split(\" \"))\r\nLA = [int(x) for x in input().split()]\r\nLA.sort()\r\nLB = [int(x) for x in input().split()]\r\nLB.sort()\r\n\r\nif (LA[ma - 1] < LB[nb - mb]): print(\"YES\")\r\nelse : print(\"NO\")\r\n", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nt1 = a[k-1]\r\nt2 = b[-m]\r\nprint(\"YES\" if t1<t2 else \"NO\")", "x,y= map(int,input().split())\r\nk,m= map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nb=sorted(list(map(int,input().split())))\r\nif (a[k-1] < b[-m]):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "z=lambda :map(int,input().split());s,s1=z();a,b=z()\r\nprint(\"YES\" if max(list(z())[:a])<min(list((z()))[s1-b:]) else \"NO\")", "n1,n2=list(map(int,input().split()))\r\nk,m=list(map(int,input().split()))\r\nt1=list(map(int,input().split()))\r\nt2=list(map(int,input().split()))\r\n\r\nt1.sort()\r\nt2.sort()\r\n\r\n\r\np=t2[::-1][:m]\r\nq=t1[:k]\r\n\r\nif max(q)<min(p):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\nna,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\na=a[0:k];b=b[nb-m:nb]\r\n\r\nif a[-1]<b[0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# khai báo A, B\r\nnA, nB = map(int, input().strip().split())\r\nk,m = map(int, input().strip().split())\r\n# khai báo mảng chứa phan tu\r\na = list(map(int, input().strip().split()))\r\nb = list(map(int, input().strip().split()))\r\n# truy xuat chi so\r\nif a[k-1] < b[nB -m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "na, nb=[int(k) for k in input().split()]\r\nk, m=[int(v) for v in input().split()]\r\na=[int(v) for v in input().split()]\r\nb=[int(v) for v in input().split()]\r\nif b[-m]>a[k-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "nA, nB = map(int, input().strip().split())\r\nk, l = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\nb = list(map(int, input().strip().split()))\r\nif a[k - 1] < b[nB - l]:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "read = lambda: [int(c) for c in input().split()]\r\nna, nb = read()\r\nk, m = read()\r\na, b = read(), read()\r\nprint('YES' if a[k-1] < b[nb-m] else 'NO')\r\n", "n1, n2 = map(int, input().split())\nm1, m2 = map(int, input().split())\narr1 = list(map(int, input().split()))\narr2 = list(map(int, input().split()))\nn1 = arr1[m1 - 1]\nn2 = arr2[-m2]\nif(n2 > n1):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t \t\t\t\t \t\t \t\t \t \t\t\t\t \t \t", "n,m=map(int,input().split())\r\nk,p=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=sorted(list(map(int,input().split())),reverse=True)\r\nif a[k-1]<b[p-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nK, M = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nif A[K - 1] < B[m - M]: print(\"YES\")\r\nelse: print(\"NO\")", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nif A[k-1] < B[nb - m] :\r\n ans = \"YES\"\r\nelse :\r\n ans = \"NO\"\r\n\r\nprint(ans)\r\n", "import sys\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline().strip().split()[0])\r\n\r\n\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n\r\ndef process_inputs():\r\n n1, n2 = get_ints()\r\n k, m = get_ints()\r\n a = get_ints()\r\n b = get_ints()\r\n \r\n return n1, n2, k, m, a, b\r\n\r\n\r\ndef solve():\r\n n1, n2, k, m, a, b = process_inputs()\r\n \r\n if a[k - 1] < b[n2 - m]:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\n\r\ndef print_result():\r\n print(solve())\r\n\r\n\r\nprint_result()\r\n", "if __name__ == '__main__':\r\n na, nb = list(map(int,input().split()))\r\n k, m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n lo = 0\r\n hi = 0\r\n\r\n for i in range(na):\r\n if i == k - 1:\r\n lo = a[i]\r\n\r\n for i in range(nb):\r\n if i == nb - m:\r\n hi = b[i]\r\n\r\n if lo < hi:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\nk, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))[::-1]\r\nif A[k-1] < B[m-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "SizesOfArray = list(map(int, input().split()))\r\n \r\nk_and_m = list(map(int, input().split()))\r\n \r\nElementsOfArrayA = list(map(int, input().split()))\r\nElementsOfArrayB = list(map(int, input().split()))\r\n\r\ncount = 0\r\nMaxInArrayA = ElementsOfArrayA[k_and_m[0] - 1]\r\nfor value in ElementsOfArrayB:\r\n if value > MaxInArrayA:\r\n count += 1\r\nif count >= k_and_m[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "na, nb = map(int, input().split())\r\nk,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nac = a[k-1]\r\nbc = b[len(b) - m]\r\nif (ac < bc):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "\nsize = str(input().strip())\nsize = size.split()\n\nindex = str(input().strip())\nindex = index.split()\nindex = [int(x) for x in index]\n\narray_a = str(input().strip())\narray_a = array_a.split()\narray_a = [int(x) for x in array_a]\n\narray_b = str(input().strip())\narray_b = array_b.split()\narray_b = [int(x) for x in array_b]\n\ni = 0\nmax_a = array_a[index[0] - 1]\n\nbigger = []\n\nfor num in array_b:\n \n if max_a < num:\n bigger.append(num)\n \nif len(bigger) >= index[1]:\n print(\"YES\")\nelse:\n print('NO')\n \t \t\t \t \t\t \t \t\t\t\t \t \t", "n1,n2 = map(int,input().split())\r\nk,m = map(int,input().split())\r\nl1 = [int(x) for x in input().split()]\r\nl2 = [int(x) for x in input().split()]\r\nif l1[k-1] < l2[n2-m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=map(int,input().split())\r\nk,m=map(int,input().split())\r\nnumbers1=list(map(int,input().split()))\r\nnumbers2=list(map(int,input().split()))\r\nk-=1\r\nif numbers1[k]<numbers2[b-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split())\nc,d=map(int,input().split())\nx=list(map(int,input().split()))\ny=list(map(int,input().split()))\nif y[b-d]>x[c-1]:\n print('YES')\nelse :\n print('NO')\n\t \t\t \t \t \t \t\t\t\t\t\t\t \t\t\t", "na, nb = map(int, input().split())\r\na, b = map(int, input().split())\r\narr_a = list(map(int, input().split()))\r\narr_b = list(map(int, input().split()))\r\n\r\nif arr_a[a-1] < arr_b[-b]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "def main():\n [na, nb] = [int(_) for _ in input().split()]\n [k, m] = [int(_) for _ in input().split()]\n a = [int(_) for _ in input().split()]\n b = [int(_) for _ in input().split()]\n\n max_a = a[k - 1]\n min_b = b[nb - m]\n\n print('YES' if max_a < min_b else 'NO')\n\n\nif __name__ == '__main__':\n main()\n", "nl = list(map(int,input().split()))#array a and array b\r\n\r\nrl = list(map(int,input().split()))#k and m\r\n\r\nk = rl[0]\r\nm = rl[1]\r\n\r\nvla = list(map(int,input().split()))#value list a\r\n\r\nvlb = list(map(int,input().split()))#value list b\r\n\r\ntempa = vla[:k]#k smallest\r\n\r\ntempb = vlb[-m:]#m largest\r\n \r\n#if largest array k > smallest array m => any number in k will be smaller number in m \r\nif tempa[-1] < tempb[0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na, nb = map(int, input().split())\nk, m = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nprint('YES' if max(A[:k]) < min(B[-m:]) else 'NO')\n", "input()\r\nk, m = map(int, input().split())\r\n\r\nprint('YES' if list(map(int, input().split()))[k - 1] <\r\n list(map(int, input().split()))[-m] else 'NO')", "n,m=map(int,input().split())\r\nx,y=map(int,input().split())\r\nl1=[int(i) for i in input().split()]\r\nl2=[int(i) for i in input().split()]\r\nl2.sort(reverse=True)\r\nif all(l1[i]<l2[y-1] for i in range(x)):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\r\na,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nk = list(map(int,input().split()))\r\n\r\nif l[a-1]<k[-b]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b = map(int,input().split(' '))\r\nk,m = map(int,input().split(' '))\r\nlist_a = list(map(int,input().split(' ')))\r\nlist_b = list(map(int,input().split(' ')))\r\ntemp_k = 0\r\ntemp_m = 0\r\n\r\nl,r = [],[]\r\nfor i in range(k):\r\n l.append(list_a[i])\r\n\r\nfor i in range(m):\r\n r.append(list_b[b-i-1])\r\n\r\n\r\nif l[-1] < r[-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "na,nb=map(int,input().split())\r\n\r\nk,m=map(int,input().split())\r\n\r\narr1=[int(x) for x in input().split()]\r\narr2=[int(x) for x in input().split()]\r\n\r\n\r\narr1=arr1[k-1]\r\narr2=arr2[-m]\r\n\r\nif arr1<arr2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = input()\r\nk, m = map(int, input().split())\r\ndaf1 = list(map(int, input().split()))\r\ndaf2 = list(map(int, input().split()))\r\nif daf1[k-1] < daf2[-m]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def solve():\r\n input()\r\n k, m = map(int, input().split())\r\n\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n bm = 0\r\n for n in b:\r\n if n > a[k-1]:\r\n bm += 1\r\n if bm >= m:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nsolve()", "a,b=map(int,input().split())\r\nx,y=map(int,input().split())\r\np=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nif p[x-1]<k[b-y]:print('YES')\r\nelse:print('NO')", "\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nx=b[0]\r\ny=b[1]\r\nif(l1[x-1]<l2[len(l2)-y]):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n\r\n\r\n", "a,b = list(map(int, input().split()))\r\nk,m = list(map(int, input().split()))\r\n\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nif all(B[-m] > item for item in A[:k]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jan 10 14:37:30 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nx = input().split()\r\nnb = int(x[1])\r\ny = input().split()\r\nk = int(y[0])\r\nm = int(y[1])\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\n\r\nif a[k-1]<b[nb-m]:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n", "a_size, b_size = map(int,input().split())\r\n\r\nk,m = map(int,input().split())\r\n\r\narr_a = list(map(int,input().split()))\r\narr_b = list(map(int,input().split()))\r\n\r\ncheck = arr_a[0:k]\r\n\r\narr_b = arr_b[::-1]\r\n\r\ncheck2 = arr_b[0:m]\r\n\r\nif max(check) < min(check2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n1, n2 = [int(x) for x in input().split()]\r\nk, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nif a[k - 1] < b[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "R = lambda: list(map(int, input().split()))\n(_a, _b), (k, m), a, b = R(), R(), R(), R()\nprint('YES' if a[k-1] < b[-m] else 'NO')\n", "\r\nn,t = map(int,input().split())\r\n\r\nk,m = map(int,input().split())\r\n# two more questions and then move to 1000 ratings\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\nA=A[:k]\r\nB=B[t-m:]\r\n\r\nif A[k-1] <B[0] :\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "sa,sb=map(int,input().split())\r\nk,m=map(int,input().split())\r\narra=[int(i) for i in input().split()]\r\narrb=[int(i) for i in input().split()]\r\nif arra[k-1]<arrb[-m]:\r\n print('Yes')\r\nelse:\r\n print('No')", "ii = lambda: int(input())\r\nmi = lambda: map(int, input().split())\r\nli = lambda: list(mi())\r\n\r\nna, nb = li()\r\nk, m = li()\r\na = li()\r\nb = li()\r\n\r\n\r\na.sort()\r\nb.sort()\r\n\r\nif a[k - 1] < b[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin, stdout\r\n\r\ndef main():\r\n stdin.readline().rstrip()\r\n k, m = [int(i) for i in stdin.readline().rstrip().split()]\r\n max_k_members_of_A = int(stdin.readline().rstrip().split()[k-1])\r\n min_m_members_of_B = int(stdin.readline().rstrip().split()[-m])\r\n \r\n \r\n if max_k_members_of_A < min_m_members_of_B:\r\n return 'YES'\r\n\r\n return 'NO'\r\n\r\nprint(main())", "na,nb = list(map(int,input().split()))\r\nk,g = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nsa = sorted(a)\r\nsb = sorted(b)\r\nsb.reverse()\r\nkl = sa[:k]\r\ngl = sb[:g]\r\nif max(kl) < min(gl):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m = list(map(int,input().split()))\r\na,b = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nd = list(map(int,input().split()))\r\nif c[a-1]<d[m-b]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n_a, n_b = map(int, input().split())\nk, m = map(int, input().split())\na1, a2 = sorted([int(elem) for elem in input().split()]), sorted([int(elem) for elem in input().split()])[::-1]\nchanged_a1, changed_a2 = a1[:k], a2[:m]\nif max(changed_a1) < min(changed_a2):\n print('YES')\nelse:\n print('NO')\n\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 15 09:19:06 2023\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\nna, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nif A[k-1] < B[nb - m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\nna, nb = map(int, sys.stdin.readline().split())\nk, m = map(int, sys.stdin.readline().split())\n\na = list(map(int, sys.stdin.readline().split()))\nb = list(map(int, sys.stdin.readline().split()))\n\nif a[k-1] < b[nb-m]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "na,nb=map(int,input().split())\r\nka,kb=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif a[ka-1]<b[-kb]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n1,n2 = map(int, input().strip().split(' '))\r\nk,m = map(int, input().strip().split(' '))\r\nlst1 = list(map(int, input().strip().split(' ')))\r\nlst2 = list(map(int, input().strip().split(' ')))\r\nif lst1[k-1]<lst2[n2-m]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\nalist = [int(x) for x in input().split()]\r\nblist = [int(x) for x in input().split()]\r\n\r\nprint(\"YES\" if alist[k - 1] < blist[-m] else \"NO\")", "n = [int(x) for x in input().split(' ')]\r\nk, m = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\nb = [int(x) for x in input().split(' ')]\r\n\r\nif a[k - 1] < b[-m]:\r\n ans = 'YES'\r\nelse:\r\n ans = 'NO'\r\nprint(ans)", "na, nb = [int(x) for x in input().split()]\r\nk, m = [int(x) for x in input().split()]\r\n\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\n\r\nprint('YES' if A[k-1] < B[len(B)-m] else 'NO')\r\n", "i=lambda:map(int,input().split())\r\nx,y=i()\r\nk,m=i()\r\nprint('YNEOS'[sorted(i())[k-1]>=sorted(i())[::-1][m-1]::2])", "na,nb=[int(i) for i in input().split()]\r\nk,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nj=a[:k]\r\nkk=b[nb-m:]\r\nif j[-1]<kk[0]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\r\na, b = map(int, input().split())\r\n\r\nk, m = map(int, input().split())\r\nmaxArrayA = int((input().split())[k-1])\r\nminArrayB = int((input().split())[b-m])\r\n\r\n\r\nif (maxArrayA < minArrayB):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def process():\r\n n, m = map(int, input().split())\r\n p, q = map(int, input().split())\r\n\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n for i in range(m):\r\n if b[i] > a[p - 1]:\r\n if m - i >= q:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n return \"NO\"\r\n\r\nprint(process())", "nA, nB = map(int, input().split())\r\nk, m = map(int, input().split())\r\na_lst = list(map(int, input().split()))\r\nb_lst = list(map(int, input().split()))\r\na_ptr = k-1\r\nb_ptr = len(b_lst) - m\r\nflag = \"YES\"\r\n\r\nfor i in range(k):\r\n if a_lst[a_ptr] < b_lst[b_ptr]:\r\n k -= 1\r\n m -= 1\r\n else:\r\n flag = \"NO\"\r\n break\r\n \r\n if k > 0:\r\n a_ptr -= 1\r\n if m > 0:\r\n b_ptr += 1\r\n\r\nprint(flag)", "def solve():\r\n n_a, n_b = map(int, input().split())\r\n k, m = map(int, input().split())\r\n a = tuple(map(int, input().split()))\r\n b = tuple(map(int, input().split()))\r\n \r\n if a[k - 1] < b[n_b - m]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "(size_of_array_A, size_of_array_B) = map(int, input().split(' '))\n(chosen_numbers_from_A, chosen_numbers_from_B) = map(int, input().split(' '))\nelements_of_A = list(map(int, input().split(' ')))\nelements_of_B = list(map(int, input().split(' ')))\n\nA_representation = elements_of_A[chosen_numbers_from_A - 1]\nB_representation = elements_of_B[::-1][chosen_numbers_from_B - 1]\n\nif A_representation < B_representation:\n print('YES')\nelse:\n print('NO')", "\r\n\r\n#l=list(map(int,input().split()))\r\n#from math import ceil\r\n#def DTB(n): \r\n # return bin(n).replace(\"0b\",\"\")\r\n\r\n#for abcd in range(int(input())):\r\n # n,c,k=map(int,(input().split()))\r\n # for i in range(n):\r\n # l=list(map(int,input().split()))\r\n\r\n\r\nn1,n2=map(int,input().split())\r\nk,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\n\r\nl1.sort()\r\nl2.sort()\r\n\r\nt=l1[k-1]\r\nindex=n2\r\n\r\nfor i in range(0,n2):\r\n #print(l2[i])\r\n if(l2[i]>t):\r\n index=i\r\n break\r\n#print(t)\r\n#print(index)\r\nif(index==n2):\r\n print(\"NO\")\r\nelif(n2-index>=m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "sc = lambda:map(int, input().split());\r\nna, nb = sc()\r\nk, m = sc()\r\nA = list(sc())\r\nB = list(sc())\r\nprint(('NO','YES')[A[k-1]< B[-m]])", "a, b = input().split()\r\nk, m = input().split()\r\nk = int(k)\r\nm = int(m)\r\nfirst = input().split()\r\nsecond = input().split()\r\nif int(first[k-1]) < int(second[-m]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "na,nb=map(int,input().split())\r\nka,mb=map(int,input().split())\r\nA=sorted(list(map(int,input().split())))\r\nB=list(map(int,input().split()))\r\nB.sort(reverse=True)\r\nif(A[ka-1]<B[mb-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "aa,bb=map(int, input().split())\nk,m=map(int, input().split())\na=[int(i) for i in input().split()]\nb=[int(j) for j in input().split()]\na.sort()\nb.sort()\nb=b[-m:]\ncetak=\"YES\"\ntm=0\nwhile tm<k:\n\tif a[tm]>=b[0]:\n\t\tcetak=\"NO\"\n\t\tbreak\n\telse:\n\t\ttm+=1\nprint(cetak)\n\n\n \t\t \t \t \t\t\t \t \t\t\t \t\t\t\t\t \t", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=sorted([int(_) for _ in input().split()])\r\nb=sorted([int(_) for _ in input().split()])\r\nif a[k-1]<b[-m]:print(\"Yes\")\r\nelse:print(\"No\")", "# created by tarik sahni\r\nna,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif a[k-1]<b[nb-m]:print(\"YES\")\r\nelse:print(\"NO\")", "size_1, size_2 = map(int, input().split())\r\nk, m = map(int, input().split())\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\nlast_len = len(arr2)\r\nif arr1[k - 1] < arr2[last_len - m]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "na,nb = list(map(int,input().split()))\r\n\r\nli = input().split()\r\nk,m = int(li[0]),int(li[1])\r\n\r\narray_na = list(map(int,input().split()))\r\narray_nb = list(map(int,input().split()))\r\nlength_nb = len(array_nb)\r\nna_k = array_na[:k:]\r\nnb_m = array_nb[length_nb - m:length_nb:1]\r\n\r\nmax_ele_k = max(na_k)\r\nmin_ele_m = min(nb_m)\r\n\r\nif max_ele_k < min_ele_m:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def array(k, m, A, B):\n nA = len(A)\n nB = len(B)\n\n if nA < k or nB < m:\n return False\n\n maxA = max(A[:k])\n maxB = min(B[::-1][:m])\n\n if maxA < maxB:\n return True\n return False\n\n\n\n\nnA, nB = [int(i) for i in input().split()]\nk, m = [int(i) for i in input().split()]\nA = [int(i) for i in input().split()]\nB = [int(i) for i in input().split()]\n\nif array(k, m, A, B):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "\r\na,b=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\n\r\n\r\na=a[:k]\r\nb=b[-m:]\r\nif(a[-1]>=b[0]):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n\r\n", "s = input()\r\nn1 = s.split()[0]\r\nn2 = s.split()[1]\r\ns = input()\r\nk = s.split()[0]\r\nm = s.split()[1]\r\n\r\ns = input()\r\na = [int(i) for i in s.split()]\r\ns = input()\r\nb = [int(i) for i in s.split()]\r\na.sort()\r\nb.sort()\r\nif a[int(k)-1] < b[int(n2)-int(m)]:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\nn, m = map(int, input().split())\r\nfirst, second = map(int, input().split())\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\nl = -1000000000\r\nh = -100000000\r\nfor i in range(0, len(arr1)):\r\n if i == first - 1:\r\n l = arr1[i]\r\nfor i in range(0, len(arr2)):\r\n if i == m - second:\r\n h = arr2[i]\r\nif l < h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n1, n2 = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\n\r\narr2_length = len(arr2)\r\n\r\nflat = True\r\nfor i in range(len(arr1[:k])):\r\n if arr1[i] >= arr2[arr2_length - m]:\r\n flat = False\r\n break\r\n\r\nif flat:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "nA,nB = list(map(int, input().split()))\r\nk,m = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nmaxak = A[k-1]\r\ncount = 0\r\nbk = B[m-1]\r\nif B[0] > maxak:\r\n print(\"YES\")\r\nelse:\r\n if(B[nB-m] > maxak):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "len_a, len_b = map(int,input().split())\r\nk, m = map(int,input().split())\r\na = input().split()\r\nb = input().split()\r\nif(int(a[k-1]) < int(b[len_b-m])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=[int(i) for i in input().split()]\r\nk,m=[int(i) for i in input().split()]\r\np=[int(i) for i in input().split()]\r\nq=[int(i) for i in input().split()]\r\nif p[k-1]<q[b-m]:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "na, nb = [int(x) for x in input().split()]\r\nn, m = [int(x) for x in input().split()]\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif (a[n - 1] < b[nb - m]):\r\n print('YES')\r\nelse:\r\n print('NO') ", "Na, Nb = input().split()\r\nNa, Nb = int(Na), int(Nb)\r\nk, m = input().split()\r\nk, m = int(k), int(m)\r\nA = [int(i) for i in input().split()]\r\nB = [int(i) for i in input().split()]\r\nif A[k-1]>B[Nb-m] or A[k-1]==B[Nb-m]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "len_A, len_B = [int(x) for x in input().split()]\r\nm,n = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nif A[m - 1] < B[-n]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "nA, nB = map(int, input().split())\r\nk, m = map(int, input().split())\r\narrA = list(map(int, input().split()))\r\narrB = list(map(int, input().split()))\r\n\r\n'''so lon nhat trong k so nho nhat cua A nho hon so nho nhat trong m so lon nhat cua B la dieu kien toi thieu thoa yeu cau bai toan'''\r\n\r\nif arrA[k-1] < arrB[nB-m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n1, n2 = [int(x) for x in input().split()] \r\nk, m = [int(x) for x in input().split()] \r\nA = list(int(num) for num in input().strip().split())[:n1]\r\nB = list(int(num) for num in input().strip().split())[:n2]\r\nsortA = A.sort() \r\nsortB = B.sort(reverse= True)\r\nif A[k-1]<B[m-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "na, nb = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\n\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nif A[k-1] < B[nb-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n1,n2=map(int,input().split())\r\nk,m=map(int,input().split())\r\nl1=sorted(list(map(int,input().split())))\r\nl2=sorted(list(map(int,input().split())))\r\nif l1[k-1]<l2[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na, nb = [int(x) for x in input().split()]\nka, kb = [int(x) for x in input().split()]\nA = [int(x) for x in input().split()]\nB = [int(x) for x in input().split()]\nprint(\"YES\" if A[ka-1] < B[-kb] else \"NO\")\n", "a,b=[int(i) for i in input().split(\" \")]\r\nk,m=[int(i) for i in input().split(\" \")]\r\narr1=[int(i) for i in input().split(\" \")]\r\narr2=[int(i) for i in input().split(\" \")]\r\nif(arr1[k-1] < arr2[b-m]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "na,nb = input().split()\r\nk,m = input().split()\r\nk = int(k)\r\nm = int(m)\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\na.sort()\r\nb.sort(reverse= True)\r\nif a[k-1]<b[m-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "I=lambda:map(int,input().split())\r\nA,B=I()\r\nk,m=I()\r\nk=sorted(I())[k-1]\r\nm=sorted(I())[-m]\r\nprint(\"YNEOS\"[k>=m::2])", "n1, n2 = map(int, input().split())\r\nk, m = map(int, input().split())\r\nlst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\n\r\nif lst1[k-1] < lst2[-m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nx,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nl.sort()\r\nd.sort(reverse=True)\r\nif(l[x-1]<d[y-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "pada=input()\r\nr,t=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nif a[r-1]<b[len(b)-t]:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "# link : https://codeforces.com/problemset/problem/572/A\r\n# sorting\r\n\r\nnA,nB = map(int,input().split())\r\n\r\nk,m = map(int,input().split())\r\n\r\nA = [int(x) for x in input().split()][:k]\r\nB = [int(x) for x in input().split()][nB-m:]\r\n\r\nprint('YES') if A[k-1]<B[0] else print(\"NO\")\r\n\r\n \r\n\r\n", "if __name__ == '__main__':\r\n _ = input()\r\n k, m = [int(i) for i in input().split()]\r\n\r\n a = [int(i) for i in input().split()]\r\n b = [int(i) for i in input().split()]\r\n\r\n if max(a[:k]) < min(b[-m:]):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "# Arrays\r\n#\r\n\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef invr():\r\n return list(map(int, input().split()))\r\n\r\n\r\ninvr()\r\nk, m = invr()\r\na = invr()\r\nb = invr()\r\n\r\naa = a[k-1]\r\nbb = b[len(b)-m]\r\n\r\n# print(aa, bb)\r\nprint(\"YES\" if aa < bb else \"NO\")\r\n", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport re\n\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nn, m = inputarray()\np, q = inputarray()\n\nA = list(inputarray())\nB = list(reversed(list(inputarray())))\n\nprint('YES' if A[p - 1] < B[q - 1] else 'NO')\n\n", "a, b = (int(i) for i in input().split())\r\nk, m = (int(i) for i in input().split())\r\na1 = [int(i) for i in input().split()]\r\na2 = [int(i) for i in input().split() if int(i) > a1[k - 1]]\r\n\r\nif len(a2) >= m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A,B = (int(x) for x in input().split())\r\nk,m = (int(x) for x in input().split())\r\nna = [int(x) for x in input().split()]\r\nnb = [int(x) for x in input().split()]\r\nresult = na[k-1] < min(nb[-1*m:])\r\nif result:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input().split()\r\nsizea = int(s[0])\r\nsizeb = int(s[1])\r\np = input().split()\r\nk = int(p[0])\r\nm = int(p[1])\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif a[k - 1] < b[- m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=[int(i) for i in input().split()]\nk,m=[int(i) for i in input().split()]\nA=[int(i) for i in input().split()]\nB=[int(i) for i in input().split()]\nA=sorted(A)\nB=sorted(B,reverse=True)\nif A[k-1]<B[m-1]:\n print('YES')\nelse:\n print('NO')\n", "def bol(a,b,k,m):\r\n if a[k-1]<b[len(b)-m]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n # print(a[k-1])\r\n # print(b[len(b)-m])\r\n\r\n\r\n\r\nn=list(map(int,input('').split()))\r\npara=list(map(int,input('').split()))\r\na=list(map(int,input('').split()))\r\nb=list(map(int,input('').split()))\r\nbol(a,b,para[0],para[1])", "def Sol(nA, nB, k, m, A, B):\r\n if A[k-1] >= B[nB-m]:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\n\r\nnA, nB = map(int, input().strip().split())\r\nk, m = map(int, input().strip().split())\r\nA = list(map(int, input().strip().split()))\r\nB = list(map(int, input().strip().split()))\r\n\r\nprint(Sol(nA, nB, k, m, A, B))\r\n", "def can_choose_numbers(nA, nB, k, m, A, B):\r\n # Check if k + m is greater than the total number of elements in both arrays\r\n if k + m > nA + nB:\r\n return \"NO\"\r\n\r\n # Check if the k-th largest number in A is less than the m-th smallest number in B\r\n if A[k - 1] < B[-m]:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Input\r\nnA, nB = map(int, input().split())\r\nk, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\n# Output\r\nresult = can_choose_numbers(nA, nB, k, m, A, B)\r\nprint(result)", "input()\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))[a-1]\r\nd=list(map(int,input().split()))[-b]\r\nprint('YES'if c<d else'NO')\r\n", "na,nb=list(map(int,input().split()))\r\nk,m=list(map(int,input().split()))\r\nk,m=k-1,m-1\r\na=sorted(list(map(int,input().split())))\r\nb=sorted(list(map(int,input().split())),reverse=True)\r\nif a[k]<b[m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "_,n=map(int,input().split())\r\nk,m=map(int,input().split())\r\nif list(map(int,input().split()))[k-1]<list(map(int,input().split()))[n-m]:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "size_A , size_B = map(int , input().split())\r\nk , m = map(int , input().split())\r\nArray_A = list(map(int, input().split()))\r\nArray_B = list(map(int, input().split()))\r\nif Array_A[k-1] < Array_B[size_B - m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 28 01:13:44 2022\r\n\r\n@author: rabeya\r\n\r\nProblem Name: Arrays\r\nProblem Link: https://codeforces.com/contest/572/problem/A\r\n\r\n\"\"\"\r\n\r\nnA, nB = map(int,input().split())\r\nk, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\n\r\nB = sorted(B, reverse = True)\r\n\r\n\r\nA = A[:k]\r\nB = B[:m]\r\n\r\nif A[k-1]<B[m-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\nk,m = list(map(int, input().split(\" \")))\r\nA = sorted(list(map(int, input().split(\" \"))))\r\nB = sorted(list(map(int, input().split(\" \"))),reverse=True)\r\nprint(\"YES\" if A[k-1]<B[m-1] else \"NO\")", "lijn1 = input().split()\r\na = int(lijn1[0])\r\nb = int(lijn1[1])\r\n\r\nlijn2 = input().split()\r\nk = int(lijn2[0])\r\nm = int(lijn2[1])\r\n\r\nA = input().split()\r\nB = input().split()\r\n\r\nif(int(A[k-1]) < int(B[b-m])):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "from bisect import bisect_right\n\nna, nb = map(int, input().split())\n\nk, m = map(int, input().split())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nif len(a) < k or len(b) < m:\n print(\"NO\")\nelse:\n x = a[k-1]\n i = bisect_right(b, x)\n if i != len(b): # found\n if len(b[i:] )>= m:\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n\n", "nA, nB = map(int, input().split())\r\nk, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nif A[k - 1] < B[nB - m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=list(map(int, input().split()))\r\ny=list(map(int, input().split()))\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nb.reverse()\r\nk=y[0]\r\nm=y[1]\r\nif a[k-1]>=b[m-1]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "_ = input()\nk, m = [int(x) for x in input().split(' ')]\nA = [int(x) for x in input().split(' ')]\nB = [int(x) for x in input().split(' ')]\n\nnb = len(B)\n\nif A[k-1] < B[nb - m]:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t \t\t \t\t\t \t \t", "input()\r\nk, m = map(int, input().split())\r\nA = tuple(map(int, input().split())) # k\r\nB = tuple(map(int, input().split())) # m\r\nprint(\"YES\" if A[k - 1] < B[-m] else \"NO\")", "(na,nb)=map(int,input().split())\r\n(k,m)=map(int,input().split())\r\n\r\na=(input().split())\r\nb=(input().split())\r\na=list(map(int,a))\r\nb=list(map(int,b))\r\n\r\ntemp1=a[:k]\r\ntemp2=b[-m:]\r\n\r\n\r\nif temp1[len(temp1)-1]< temp2[0]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "na, nb = map(int, input().split())\r\nk,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nx = a[k-1]\r\ny = b[nb - m]\r\n\r\nif y > x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "'''input\n5 2\n3 1\n1 1 1 1 1\n2 2\n'''\na1, b1 = map(int, input().split())\nk, m = map(int, input().split())\na, b = list(map(int, input().split())), list(map(int, input().split()))[::-1]\nprint(\"YES\" if a[k-1] < b[m-1] else \"NO\")", "n,m=map(int,input().split());k,l=map(int,input().split());a=list(map(int,input().split()));b=list(map(int,input().split()))\r\nif a[k-1]<b[m-l]:print('YES')\r\nelse:print('NO')\r\n", "na,nb = map(int,input().split())\r\nk,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na = a[0:k]\r\nb = b[len(b)-m:len(b)]\r\nif b[0] > a[len(a)-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "sa, sb = map(int, input().split())\nk, m = map(int, input().split())\narray_A = list(map(int, input().split()))\narray_B = list(map(int, input().split()))\nprint('YES' if array_A[k-1] < array_B[-m] else 'NO')\n\n# 1514665357649\n", "na, nb = [int(x) for x in input().split()]\r\nk, m = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\n\r\nif A[k - 1] < B[len(B) - m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nk=sorted(list(map(int,input().split())))\r\nm=sorted(list(map(int,input().split())))\r\nif k[b[0]-1]<m[-b[-1]]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n1, n2 = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = [0]*n1\r\nb = [0]*n2\r\na = input().split()\r\nb = input().split()\r\nfor i in range(n1): a[i] = int(a[i])\r\nfor i in range(n2): b[i] = int(b[i])\r\nif b[n2-m]>a[k-1]: print(\"YES\")\r\nelse: print(\"NO\")", "n1, n2 = map(int, input().split())\nk, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nprint(\"YES\" if max(a[0:k]) < min(b[-m:n2]) else \"NO\")", "a, b = input().split()\r\nn, m = map(int, input().split())\r\nls1 = list(map(int, input().split()))\r\nls2 = list(map(int, input().split()))\r\nif ls1[n-1] < ls2[-m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\na1=list(map(int,input().split()))\r\nb1=list(map(int,input().split()))\r\na1=sorted(a1)\r\nb1=sorted(b1,reverse=True)\r\nif a1[c-1]<b1[d-1]:\r\n print('YES')\r\n exit()\r\nprint(\"NO\")\r\n", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\nif k>na or m>nb: print(\"NO\")\r\nelse:\r\n max_num = a[k-1]\r\n cnt=0\r\n for num in b:\r\n if max_num < num: cnt += 1\r\n if cnt >= m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input().split()\r\ns2 = input().split()\r\na = int(s2[0])\r\nb = int(s2[1])\r\nl1 = input().split()\r\nl2 = input().split()\r\npoint1=0\r\npoint2=0\r\nminpoint=100000\r\nres=0\r\n\r\nfor i in range(len(l1)):\r\n l1[i]=int(l1[i])\r\n \r\nfor i in range(len(l2)):\r\n l2[i]=int(l2[i])\r\nl1 = sorted(l1)\r\nl2 = sorted(l2)\r\nfor i in range(len(l2)):\r\n if i+1==b:\r\n minpoint=int(l2[len(l2)-1-i])\r\nfor i in l1:\r\n if i<minpoint:\r\n a-=1\r\n else:\r\n break\r\nif a>0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n \r\n", "n1, n2 = input().split()\r\nn1 = int(n1)\r\nn2 = int(n2)\r\nk, m = input().split()\r\nk = int(k)\r\nm = int(m)\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\ntempA = A[k - 1]\r\ntempB = B[n2 - m]\r\nif tempA < tempB:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n1,n2=map(int,input().split())\r\nk,m=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\nbrr=[int(i) for i in input().split()]\r\narr.sort()\r\nbrr.sort(reverse=True)\r\nif arr[k-1]<brr[m-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\na, b = list(map(int, input().split())), list(map(int, input().split()))\r\nprint(\"YES\") if a[k - 1] < b[nb - m] else print(\"NO\")", "n1,n2=map(int,input().split())\r\nn,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nif a[n-1]<b[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b = list(map(int, input().split()))\r\nm, n = list(map(int, input().split()))\r\nlst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\nlst1 = lst1[0:m]\r\nlst2 = lst2[::-1]\r\nlst2 = lst2[0:n]\r\nif lst1[len(lst1)-1] < lst2[len(lst2)-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Apr 4 17:14:40 2023\r\n\r\n@author: R I B\r\n\"\"\"\r\n\r\nimport sys\r\nfrom math import *\r\nL=[]\r\nfor i in sys.stdin:\r\n L.append(i)\r\nL=[line.rstrip(\"\\n\") for line in L if line ]\r\nna,nb=int(L[0].split(' ')[0]),int(L[0].split(' ')[1])\r\nk,m=int(L[1].split(' ')[0]),int(L[1].split(' ')[1])\r\na=int(L[2].split(' ')[k-1])\r\nb=int(L[3].split(' ')[nb-m])\r\nif a<b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "a,b = list(map(int,input().split()))\r\nk,m = list(map(int,input().split()))\r\n\r\ninplist1 = list(map(int,input().split()))\r\ninplist2 = list(map(int,input().split()))\r\n\r\nif inplist1[k-1]<inplist2[b-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\"\"\"MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMWO:,'..'xXWWMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\nMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMO. .:kOo.,kNMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\nMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMO. .lNWWo..lXMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\nMNOxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxMMMMWKxoloxKWNc .:xxd; ,dxxxkXMXkxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxMM\nMKc''''''''''''''''. ..'''''. .''''. .''MMMWx..,:. .xXo''. .''. ..'';kMk;'''''. .'.''. .''''''. ..''. .''MM\nMWNXNNNNNNNNNNNNNNNO' ;KNNNNNKo. cKNNNd. lXNMMMK; ,0Wx. :NWXXl .dNNO' ;KNNNWMWNNNNNXc .kNNNNx. cXNNNNNO' ;KNN0; 'ONNMM\nMMMMMMMMMMMMMMMMMWM0' :NMMMMWMX: .OMWWx. oWMMMMWx. ';. .dNMWWo .xMM0' :NWWMMMMMMMMWWl .OMMMWk. lWWMMWM0' ;XMMX: ,KMMMM\nMMMMMMWMWkccccccccc;. :NMWNNNKd. :XMMWx. oWMMMWKo. .',. .,ldx; .dMM0' :NMMMMMMMNNWMWl .OMMMWk. lWMMMMM0' ;XMMX: ,0MMMM\nMMWXKNWMWxcc,. .;cc;. :XMk,''..'lKWMMWx. oWMNx:. .lONNKxl. .xMM0' :NMMMMMM0:,oKO' ,KMMMMk. lWWNkoc,. .;::;. ,KMMMM\nMMXc.lXMMWWWNd..xWM0' :NM0; ;kXWMMMWNl oWMK:.;xXWWMWXx:. ,c' .dMM0' :NMMMMMMKc. ...;kWMMMMk. lWWc .:;. .clc:. ,KMMMM\nMWWx. lXMWMMMK, lWM0' :NMMNx'.,ldxxoc' oWMWNKNWWWN0o' .:kNWo .dMM0' :NMMMMMMMNO; ,OWWWMMMk. lWM' lXx. lNMMX: ,KMMMM\nMMMWk'.,xKNX0c..kWM0' :NMMMMNkl;,'',:l: oWMMMMMWMWO' 'l0WMWWo .xMM0' :NMMMMMMMMMNd. .oXWMMMk. lWMd.....;0WMMX: ,KMMMM\nMMMMWKo'...'..:kWMM0' :NMMMMMMMWWNNWWWx. oWMMMMMMMMWOxXWMWMWWo .xMM0' :NMMMMMMMMMMMKl. ,kNMMk. lWMWKkxx0NMWMMX: ,KMMMM\nMMMMMMMN0kxk0XNWMMWKl;xNMMMMMMMMMMMMWM0c;kWMMMMMMMMMMMWWMMMMWk;:OMMXl,dNMMMMMMMMMMMMWO; .dNM0c;kWWMMMMMMMMMMMNd,oXMMMM\nMMMMMMMMWWMWMMMMMMMMMWWMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMWWMMWWMMWMMMMMMMMMMMMMMNkxKWMMWWMMMMMMMMMMMMMMWMMWMMMMM\nMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\"\"\"\n\n\n#\t\t\t\t Author: Udit \"luctivud\" Gupta @ https://www.linkedin.com/in/udit-gupta-1b7863135/\t\t\t\t\t #\n\n\nimport math; \t\tfrom collections import *\nimport sys; \t\tfrom functools import reduce\nimport time; \t\tfrom itertools import groupby\n\n# sys.setrecursionlimit(10**6)\n\ndef input() : return sys.stdin.readline()\ndef get_ints() : return map(int, input().strip().split())\ndef get_list() : return list(get_ints())\ndef get_string() : return list(input().strip().split())\ndef printxsp(*args) : return print(*args, end=\"\")\ndef printsp(*args) : return print(*args, end=\" \")\n\n\nDIRECTIONS = [(+0, +1), (+0, -1), (+1, +0), (+1, -1)] \nNEIGHBOURS = [(-1, -1), (-1, +0), (-1, +1), (+0, -1),\\\n (+1, +1), (+1, +0), (+1, -1), (+0, +1)]\n\n\n\n# MAIN >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n\n# for _test_ in range(int(input())): \nn, m = get_ints()\na, b = get_ints()\nkimchii = get_list()\nlydia = get_list()\nprint(\"YES\" if (kimchii[a-1] < lydia[m-b]) else \"NO\" )\n\n\n\n\n", "[nA, nB] = list(map(int,input().split(' ')))\r\n[k, m] = list(map(int,input().split(' ')))\r\na = list(map(int,input().split(' ')))\r\nb = list(map(int,input().split(' ')))\r\nprint(\"YES\" if a[k - 1]< b[len(b)-m] else \"NO\")\r\n \r\n \r\n \r\n", "na,nb = [int(x) for x in input().split(\" \")]\r\nk,m = [int(x) for x in input().split(\" \")]\r\na = sorted([int(x) for x in input().split(\" \")])\r\nb = sorted([int(x) for x in input().split(\" \")])\r\n\r\nif a[k-1]<b[nb-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na, nb = map(int, input().split())\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nprint(\"YES\" if a[n - 1] < b[-m] else \"NO\")", "#!/usr/bin/python\r\n\r\n# http://codeforces.com/problemset/problem/572/A\r\n\r\n# define function\r\ndef arrays(size_of_arrays, chosen_quantity, array_a, array_b):\r\n # 1. get max value among X value of array_a --> max_array_a\r\n max_array_a = array_a[chosen_quantity[0] - 1]\r\n\r\n # 2. get min value among Y value of array_b --> min_array_b\r\n min_array_b = array_b[0 - chosen_quantity[1]]\r\n\r\n # 3. compare\r\n result = 'YES' if max_array_a < min_array_b else 'NO'\r\n\r\n return result\r\n\r\n# call function\r\nsize_of_arrays = [int(i) for i in input().split()]\r\nchosen_quantity = [int(i) for i in input().split()]\r\narray_a = [int(i) for i in input().split()]\r\narray_b = [int(i) for i in input().split()]\r\nprint(arrays(size_of_arrays, chosen_quantity, array_a, array_b))\r\n", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\narr_a=list(map(int,input().split()))\r\narr_b=list(map(int,input().split()))\r\nif(arr_a[k-1]<arr_b[nb-m]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m,n=map(int,input().split())\r\nk,l=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split())) \r\nif l1[k-1]<l2[len(l2)-l]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "inp = lambda:list(map(int,input().split()))\r\nl1 = inp()\r\na,b= inp()\r\nprint([\"NO\",\"YES\"][inp()[a-1]<inp()[-b]])", "nA, nB = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nAk = A[k-1]\r\nlb = len(B)\r\nif(B[lb - m] > Ak):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\"\"\"\r\nLink:\r\nTime complexity: O(n)\r\nSpace complexity: O(n)\r\n\"\"\"\r\n\r\n\r\ndef check_arrays():\r\n input()\r\n n_a, n_b = map(int, input().split())\r\n array_a = list(map(int, input().split()))\r\n array_b = list(map(int, input().split()))\r\n return array_a[n_a - 1] < array_b[-n_b]\r\n\r\n\r\nif __name__ == '__main__':\r\n if check_arrays():\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a1, a2 = list(map(int, input().split()))\r\nk,m = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nA.sort()\r\nB.sort(reverse=True)\r\n\r\nif A[k - 1] < B[m - 1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,m=map(int,input().split())\r\nk,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl2.sort(reverse=True)\r\nif l[k-1]<l2[b-1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "len_a, len_b = map(int,input().split())\r\nk, m = map(int,input().split())\r\na = input().split()[k-1]\r\nb = input().split()[len_b-m]\r\nif(int(a) < int(b)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A,B=list(map(int,input().split()))\r\nk,m=list(map(int,input().split()))\r\n\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\ncount=0\r\nfor i in range(B):\r\n\tif(b[i]>a[k-1]):\r\n\t\tcount=count+1\r\n\tif(count==m):\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nif(count != m):\r\n\tprint(\"NO\")", "n1, n2 = map(int, input().split())\r\n\r\nk, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nMAX = a[k-1]\r\nMIN = b[-m]\r\n\r\nif(MIN > MAX):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "N = list(map(int, input().split()))\r\nKM = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\ndel A[KM[0]: len(A)]\r\ndel B[0: len(B) - KM[1]]\r\nif A[len(A)-1] >= B[0]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from bisect import bisect\r\n\r\n\r\nl = input().split()\r\nnb = int(l[1])\r\nk, m = [int(x) for x in input().split()]\r\na = input().split()\r\nb = input().split()\r\n\r\nx = int(a[k - 1])\r\ny = int(b[nb - m])\r\n\r\nif x < y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#Anuneet Anand\r\n \r\nn1,n2 = map(int,input().split())\r\nk,m = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\n \r\nx = A[k-1]\r\ny = B[len(B)-m]\r\n \r\nif x<y:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "I = input\r\na, b = map(int, I().split())\r\nx, y = map(int, I().split())\r\nprint('YES' if list(map(int, I().split()))[x - 1] < list(map(int, I().split()))[b - y] else 'NO')\r\n", "input();a,b=map(int,input().split())\r\nc=list(map(int,input().split()));d=list(map(int,input().split()))\r\nprint(['NO','YES'][c[a-1]<d[-b]])", "import math\nimport sys\nfrom collections import defaultdict\n#input = sys.stdin.readline\n\nUSE_FILE = False \n\n\ndef main():\n na, nb = tuple(map(int, input().split()))\n k, m = tuple(map(int, input().split()))\n a = [int(i) for i in input().split()]\n b = [int(i) for i in input().split()]\n a.sort()\n b.sort()\n if a[k - 1] < b[len(b) - m]:\n return \"YES\"\n return \"NO\"\n\n\n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n import sys\n sys.stdin = open('/home/stefan/input.txt', 'r')\n print(main())\n", "na, nb = input().split(' ')\r\nna = int(na)\r\nnb = int(nb)\r\nk, m = input().split(' ')\r\nk = int(k)\r\nm = int(m)\r\nva = [int(x) for x in input().split(' ')]\r\nvb = [int(x) for x in input().split(' ')]\r\nif va[k-1] < vb[nb-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')[1:]\r\n k, m = map(int, inp[0].split())\r\n a = sorted(map(int, inp[1].split()))[k-1]\r\n b = sorted(map(int, inp[2].split()))[-m]\r\n return ('NO', 'YES')[a < b]\r\n \r\n\r\nprint(main(), sep='\\n')\r\n", "f=lambda:map(int,input().split())\r\na,b=f()\r\nk,m=f()\r\nla=list(f())\r\nlb=list(f())\r\nprint('YNEOS'[la[k-1]>=lb[-m]::2])", "n1,n2=(int(i) for i in input().split())\r\nk,m=(int(i) for i in input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nk1=a[k-1]\r\nk2=-1\r\nfor i in range(n2):\r\n if(b[i]>k1):\r\n k2=i\r\n break\r\nif(k2==-1):\r\n print(\"NO\")\r\nelse:\r\n if(n2-k2>=m):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import io\n\nimport atexit\nimport sys\n\n_OUTPUT_BUFFER = io.StringIO()\nsys.stdout = _OUTPUT_BUFFER\n\n\[email protected]\ndef write():\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\n\n\n'''\n\n'''\n\n\ndef solve():\n na, nb = map(int, input().split())\n k, m = map(int, input().split())\n a = [int(num) for num in input().split()]\n b = [int(num) for num in input().split()]\n\n if a[k - 1] < b[nb - m]:\n print('YES')\n else:\n print('NO')\n\n\ndef main():\n # for _ in range(int(input())):\n solve()\n\n\nif __name__ == '__main__':\n main()\n", "def findOccurence(b,q,num):\r\n for i in range(q):\r\n if b[i]>num:\r\n return i\r\n return -1\r\n\r\np,q = map(int,input().split())\r\nk,m = map(int,input().split())\r\na = sorted([int(i) for i in input().split()])\r\nb = sorted([int(i) for i in input().split()])\r\nindex = findOccurence(b,q,a[k-1])\r\n\r\nif index == -1:\r\n print(\"NO\")\r\nelse:\r\n if q-index>=m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nprint(['NO', 'YES'][a[k - 1] < b[nb - m]])", "n_a, n_b = tuple(map(int, input().split()))\r\nk, m = tuple(map(int, input().split()))\r\na = list(map(int, input().split()))[:k]\r\nb = list(map(int, input().split()))[-m:]\r\n\r\n\r\nnum_a = a[-1]\r\nnum_b = b[0]\r\n\r\nif num_a < num_b:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "nA, nB = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\nli_A = list(map(int, input().split()))\r\nli_B = list(map(int, input().split()))\r\n \r\nif li_A[k - 1] < li_B[-1*m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n_a, n_b = input().split()\r\nk, m = input().split()\r\nlist_a = list(map(int, input().split()))\r\nlist_b = list(map(int, input().split()))\r\nif int(list_a[int(k)-1]) < int(list_b[-int(m)]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check_arrays(A,B,k,m):\r\n if A[k-1]<B[len(B)-m]:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nnA, nB = [int(x) for x in input().split()]\r\nk, m = [int(x) for x in input().split()]\r\naA = [int(x) for x in input().split()]\r\naB = [int(x) for x in input().split()]\r\nprint (check_arrays(aA,aB,k,m))", "x,y=[int(i) for i in input().split()]\r\nk,m=[int(i) for i in input().split()]\r\nl1=[int(o) for o in input().split()]\r\nl2=[int(u) for u in input().split()]\r\nf=l1[:k:]\r\nl2.reverse()\r\nq=l2[:m:]\r\nif max(f) <min(q):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input();x,y=map(int,input().split());a=list(map(int,input().split()));b=list(map(int,input().split()))\r\nprint('YES' if a[:x][-1]<b[::-1][:y][-1] else 'NO')", "\r\na, b = tuple(map(int, input().split()))\r\nk, m = tuple(map(int, input().split()))\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\nprint('YES' if arr1[k - 1] < arr2[b - m] else 'NO')", "def arrays(s1_len, s2_len, sub_s1, sub_s2, s1, s2):\r\n if (s1[sub_s1 - 1] < s2[s2_len - sub_s2]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n# Input\r\nss_len = list(map(int, input().split()))\r\ns1_len = ss_len[0]\r\ns2_len = ss_len[1]\r\nsubs_len = list(map(int, input().split()))\r\nsub_s1 = subs_len[0]\r\nsub_s2 = subs_len[1]\r\ns1 = list(map(int, input().split()))\r\ns2 = list(map(int, input().split()))\r\n\r\n# Run and get output\r\narrays(s1_len, s2_len, sub_s1, sub_s2, s1, s2)", "ab = list(map(int, input().split()))\r\nkm = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif a[km[0] - 1] < b[ab[1] - km[1]]:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "a,b=map(int,input().split()) \r\nl,r=map(int,input().split()) \r\nv=sorted(list(map(int,input().split())))\r\nb=sorted(list(map(int,input().split())))\r\nb=b[::-1]\r\nma=max(v[0:l]) \r\nmi=min(b[0:r])\r\nprint([\"NO\",\"YES\"][ma<mi])\r\n", "a,b=map(int,input().split())\r\nk,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nn=list(map(int,input().split()))\r\nif(l[k-1]<n[b-m]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n1,n2 = map(int,input().split())\r\nk,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nif a[k-1] < b[n2-m]:\r\n print('yes')\r\nelse:\r\n print('no')", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nnum1 = sorted(a)[k-1]; num2 = sorted(b)[len(b)-m]\r\nprint('YNEOS'[num1>=num2::2])", "n, m = map(int, input().strip().split())\nxa, xb = map(int, input().strip().split())\na = list(map(int, input().strip().split()))\nb = list(map(int, input().strip().split()))\nif a[xa-1] < b[m-xb]:\n\tprint('YES')\nelse:\n\tprint('NO') ", "_,y = map(int, input().split())\r\nk,m = map(int, input().split())\r\nprint(\"YES\" if (list(map(int, input().split()))[k-1]<list(map(int, input().split()))[y-m]) else \"NO\" )", "n = map(int, input().split())\r\nk, m = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nprint(('NO','YES')[A[k-1]<B[-m]])", "from sys import stdin\r\n_input = stdin.readline\r\n_int = int\r\ncount, cnt = [_int(i) for i in _input().split()]\r\nk, m = [_int(i) for i in _input().split()]\r\na = [_int(i) for i in _input().split()]\r\nb = [_int(i) for i in _input().split()]\r\na = a[k-1]\r\nb = b[cnt - m]\r\nif a < b:\r\n print('YES')\r\nelse:\r\n print('NO')", "def strictlyLess(arr1, n1, arr2, n2, k, m):\r\n greaterSmall = arr2[n2 - m]\r\n smallestGreat = arr1[k - 1]\r\n if smallestGreat < greaterSmall:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nn1, n2 = list(map(int, input().split(\" \")))\r\nk, m = list(map(int, input().split(\" \")))\r\narr1 = list(map(int, input().split(\" \")))\r\narr2 = list(map(int, input().split(\" \")))\r\nprint(strictlyLess(arr1, n1, arr2, n2, k, m))", "#!/usr/bin/python3\nna,nb=map(int,input().split())\nk,m=map(int,input().split())\n*a,=map(int,input().split())\n*b,=map(int,input().split())\nprint(\"YES\" if a[k-1] < b[nb-m] else \"NO\")\n", "r=lambda:map(int,input().split())\r\na,b=r()\r\nk,m=r()\r\nA=list(r())\r\nB=list(r())\r\nprint(('NO','YES')[A[k-1]<B[b-m]])\r\n", "s1,s2=tuple(input().split())\r\ns1=int(s1)\r\ns2=int(s2)\r\nk,n=tuple(input().split())\r\nk=int(k)\r\nn=int(n)\r\na=input().split()\r\nb=input().split()\r\nl=[]\r\nl1=[]\r\nfor i in a:\r\n l.append(int(i))\r\nfor i in b:\r\n l1.append(int(i))\r\n\r\nif l[k-1]<l1[s2-n]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "Na, Nb = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.reverse()\r\nif a[k-1] < b[m-1]: print(\"YES\")\r\nelse: print(\"NO\")", "a, b = map(int, input().split())\r\nk, m = map(int, input().split())\r\ns1 = list(map(int, input().split()))\r\ns2 = list(map(int, input().split()))\r\nif s1[k - 1] < s2[b - m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m = map(int,input().split())\nx,y = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\na.sort()\nb.sort(reverse=True)\nif a[x-1]<b[y-1]:\n\tprint (\"YES\")\nelse:\n\tprint (\"NO\")", "def process_inputs():\r\n n1, n2 = list(map(int, input().split()))\r\n k, m = list(map(int, input().split()))\r\n a1 = list(map(int, input().split()))\r\n a2 = list(map(int, input().split()))\r\n return n1, n2, k, m, a1, a2\r\n\r\n\r\ndef solve():\r\n n1, n2, k, m, a1, a2 = process_inputs()\r\n if a1[k - 1] < a2[n2 - m]:\r\n return 'YES'\r\n\r\n return 'NO'\r\n\r\n\r\ndef result():\r\n print(solve())\r\n\r\n\r\nresult()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 1 15:21:06 2018\r\n\r\n@author: Quang Huy\r\n\"\"\"\r\ndef inp():\r\n return map(int, input().split(' '))\r\n\r\nna, nb = inp()\r\nk, m =inp()\r\na = list(inp())\r\nb = list(inp())\r\nif a[k - 1] < b[nb - m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "nA, nB = map(int,input().split())\nk, m = map(int, input().split())\nlsA = list(map(int,input().split()))\nlsB = list(map(int,input().split()))\n\nif lsA[k-1] >= lsB[nB - m]:\n print('NO')\nelse:\n print('YES')\n", "n1, n2 = map(int, input().split());\r\nk1, k2 = map(int, input().split());\r\na1 = list(map(int, input().split()));\r\na2 = list(map(int, input().split()));\r\n\r\nif a1[k1-1] < a2[n2-k2]: print('YES');\r\nelse: print('NO');", "n1,n2=map(int,input().split())\r\nk,m=map(int,input().split())\r\na,b=list(map(int,input().split())),list(map(int,input().split()))\r\nprint(\"YES\" if a[k-1]<b[n2-m] else \"NO\")", "na,nb=map(int, input().split())\r\nk,m=map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.reverse()\r\nif a[na-k]<b[nb-m]:\r\n print('YES')\r\nelse: print('NO')\r\n\r\n\r\n", "na,nb = map(int,input().split())\r\nk,m = map(int,input().split())\r\narrA = list(map(int, input().split()))[:na]\r\narrB = list(map(int, input().split()))[:nb]\r\n\r\nif(arrA[k-1]<arrB[nb-m]):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a, b = list(map(int, input().split()))\r\nm, n = list(map(int, input().split()))\r\nlista = list(map(int, input().split()))\r\nlista2 = list(map(int, input().split()))\r\nif(lista[m-1] < lista2[b-n]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nk,r=map(int,input().split())\r\nlst1=list(map(int,input().split()))\r\nlst2=list(map(int,input().split()))\r\nlst2.reverse()\r\nans1=max(lst1[0:k])\r\nans2=min(lst2[0:r])\r\nif ans2>ans1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n na, nb = map(int, input().split())\r\n k, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n if a[k-1] < b[nb-m]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "input()\r\nk,m=map(int,input().split())\r\nl1=[int(x) for x in input().split()]\r\nl2=[int(x) for x in input().split()]\r\nif l1[k-1]<l2[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p,q = input().split()\r\n\r\na,b = input().split()\r\n\r\na = int(a)\r\nb = int(b)\r\n\r\ndef inp(s):\r\n j = 0\r\n a = []\r\n for i in range(len(s)):\r\n if s[i] == \" \":\r\n a.append(int(s[j:i]))\r\n j = i+1\r\n if i == len(s)-1:\r\n a.append(int(s[j:]))\r\n return a\r\n\r\n\r\ns = input()\r\nt = input()\r\nt = inp(t)\r\ns = inp(s)\r\nx = []\r\ny = []\r\n\r\nfor i in range(a):\r\n x.append(s[i])\r\nfor i in range(1,b+1):\r\n y.append(t[len(t)-i])\r\n\r\nif max(x)<min(y):\r\n print (\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n1, n2 = map(int, input().split())\nk, m = map(int, input().split())\ns = [i for i in input().split()]\na = [int(i) for i in s]\ns = [i for i in input().split()]\nb = [int(i) for i in s]\nif a[k-1] < b[n2-m]:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "input() # Useless first line\r\n\r\nn,m = map(int, input().split())\r\na1 = list(map(int, input().split()))[:n]\r\na2 = list(map(int, input().split()))[-m:]\r\n\r\nprint(\"YES\" if a1[-1] < a2[0] else \"NO\")", "a = input().split()\r\nlen_a = int(a[0])\r\nlen_b = int(a[1])\r\na = input().split()\r\nk = int(a[0])\r\nm = int(a[1])\r\narray_a = input().split()\r\narray_b = input().split()\r\na = 0\r\nwhile a < len_a:\r\n array_a[a] = int(array_a[a])\r\n a += 1\r\na = 0\r\nwhile a < len_b:\r\n array_b[a] = int(array_b[a])\r\n a += 1\r\nif array_a[k-1] < array_b[len_b-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nif __name__ == '__main__':\r\n \r\n n1, n2 = map(int, input().split())\r\n k1, k2 = map(int, input().split())\r\n \r\n arr1 = []\r\n arr2 = []\r\n arr1 += map(int, input().split()) \r\n arr2 += map(int, input().split())\r\n\r\n if arr1[k1-1] < arr2[n2-k2]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "A,B = map(int,input().split())\r\nk,m= map(int,input().split())\r\nna = list(map(int,input().split()))\r\nnb = list(map(int,input().split()))\r\nnaa=na[k-1]\r\nnbb=nb[-m]\r\nif nbb>naa:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nimport sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n\r\ndef main():\r\n lenA, lenB = get_ints()\r\n k, m = get_ints()\r\n A = list(get_ints())\r\n B = list(get_ints())\r\n \r\n if A[lenA-1] < B[0]:\r\n print('YES')\r\n return\r\n \r\n elA = A[k-1]\r\n elB = B[-m]\r\n \r\n print('YES') if elA < elB else print('NO')\r\n \r\n return\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "nA, nB = input().split(); nA = int(nA); nB = int(nB)\r\nk, m = input().split(); k = int(k); m = int(m)\r\narr1 = [int(i) for i in input().split()]\r\narr2 = [int(i) for i in input().split()]\r\n\r\nif arr1[k-1] < arr2[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x,y=map(int,input().split())\r\nn,m=map(int,input().split())\r\nl1=sorted(map(int,input().split()))\r\nl2=sorted(map(int,input().split()))\r\nprint([\"NO\",\"YES\"][l1[n-1]<l2[-m]])", "m,n=map(int,input().split())\r\np,q=map(int,input().split())\r\nA=[int(x) for x in input().split()]\r\nB=[int(x) for x in input().split()]\r\nB.reverse()\r\ne,f=[],[]\r\nfor i in range(p):\r\n e.append(A[i])\r\nfor i in range(q):\r\n f.append(B[i])\r\nif min(f)>max(e):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python3\n# https://codeforces.com/problemset/problem/572/A\n\n# A. Arrays\n# time limit per test2 seconds\n# memory limit per test256 megabytes\n\ndef is_listA_less_than_listB(listA, listB, k, m):\n if listA[k-1] < listB[len(listB)-m]:\n return 'YES'\n return 'NO'\n\nif __name__ == \"__main__\":\n na, nb = map(int, input().split())\n k, m = map(int, input().split())\n listA = list(map(int, input().split()))\n listB = list(map(int, input().split()))\n print(is_listA_less_than_listB(listA, listB, k, m))\n\n", "nArr1, nArr2 = map(int,input().split())\r\nk,m = map(int,input().split())\r\narray1 = list(map(int,input().split()))\r\narray2 = list(map(int,input().split()))\r\n\r\nif array1[k-1] < array2[nArr2-m]:\r\n print('YES')\r\nelse:\r\n print('NO')", "na, nb = [int(x) for x in input().split()]\r\nk, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\ncnt = 0\r\na.sort()\r\nb.sort()\r\na = a[:k]\r\nb = b[len(b) - m : len(b)]\r\nif max(a) < min(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nnew_a=a[:k]\r\nb=b[::-1]\r\nnew_b=b[:m]\r\nlen_a=len(new_a)\r\nlen_b=len(new_b)\r\nif new_a[len_a-1]<new_b[len_b-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n1, n2 = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\n\r\nprint('YES' if a1[k - 1] < a2[len(a2) - m] else 'NO')\r\n", "n , b = map(int , input().split())\r\nk , m = map(int , input().split())\r\nl = list(map(int , input().split()))\r\nd = list(map(int , input().split()))\r\nmn = l[k-1] \r\ncounter = 0\r\nfor i in range(b): \r\n if d[i] > mn :\r\n counter += 1 \r\nif counter >= m : \r\n print('YES')\r\nelse:\r\n print(\"NO\")", "if __name__ == '__main__':\r\n na, nb = list(map(int,input().split()))\r\n k, m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n print(\"YES\" if a[k-1] < b[nb - m] else \"NO\")\r\n", "la, lb = map(int,input().split())\r\nea, eb = map(int,input().split())\r\narra = [int(x) for x in input().split()]\r\narrb = [int(x) for x in input().split()]\r\nif arra[ea-1]<arrb[lb-eb]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n1,n2 = map(int,input().split())\r\nk,m = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\n\r\nc = l1[k-1]\r\nans = 0\r\nfor j in range(len(l2)):\r\n if l2[j]>c:\r\n ans+=1\r\nif(m<=ans):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=[int(z)for z in input().split()]\r\nb=[int(z)for z in input().split()]\r\nprint(\"YNEOS\"[a[k-1]>=b[-m]::2])\r\n# Interesting. --YKF\r\n", "Na,Nb = map(int,input().split())\r\nK,M = map(int,input().split())\r\nArrA = list(map(int,input().split()))\r\nArrB = list(map(int,input().split()))\r\n\r\nMaxx = ArrA[K-1]\r\nMinn = ArrB[-M]\r\n\r\nif Maxx < Minn:\r\n print('YES')\r\nelse:\r\n print('NO')", "def check_arrays(_a, _b, _k, _m):\n if _a[k - 1] >= _b[-m]:\n return 'NO'\n else:\n return 'YES'\n\n\nna, nb = map(int, input().split())\nk, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nprint(check_arrays(a, b, k, m))\n", "input()\r\nk , m=map(int , input().split())\r\nprint(\"YES\" if list(map(int , input().split()))[k-1]<list(map(int , input().split()))[-m] else \"NO\")", "nA, nB = map(int, input().split())\r\n\r\nk, m = map(int, input().split())\r\n\r\narr1 = input()\r\nA = list(map(int,arr1.split(' ')))\r\n\r\narr2 = input() \r\nB = list(map(int,arr2.split(' ')))\r\n\r\nif A[k-1] < B[(len(B)-1) - (m-1)]: \r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "n1, n2 = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\n\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\n\r\nif(a1[k-1] < a2[n2-m]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input()\r\nk, j = map(int, input().split())\r\nprint(['NO', 'YES'][list(map(int, input().split()))[k - 1] < list(map(int, input().split()))[-j]])", "na, nb = map(int, input().split())\r\na, b = map(int, input().split())\r\nt = int(input().split()[a - 1]) < int(input().split()[-b])\r\nprint(\"YES\" if t else \"NO\")\r\n", "na, nb = [int(j) for j in input().split()]\r\nk, m = [int(j) for j in input().split()]\r\na = [int(j) for j in input().split()]\r\nb = [int(j) for j in input().split()]\r\nif a[k - 1] < b[nb - m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def inp():\n return map(int, input().split(' '))\n\nna, nb = inp() \nk, m = inp() \na = list(inp())\nb = list(inp()) \n\nif a[k-1] < b[nb - m]:\n print (\"YES\") \nelse: \n print (\"NO\")\n\n \t \t \t \t \t\t \t\t \t\t \t", "na, nb=map(int,input().split(\" \"))\r\nk, m=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\nb=list(map(int,input().split(\" \")))\r\n\r\nif max(a[:k])<min(b[-m:]):\r\n print(\"Yes\")\r\nelse: print(\"NO\")\r\n", "a,b=map(int,input().split())\r\nk,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\ni=len(l2)-1\r\nc=0\r\nwhile i>=0:\r\n if l1[k-1]<l2[i]:\r\n c+=1\r\n if c==m:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n break\r\n i-=1\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n", "a,b=map(int,input().split())\r\nk,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl=l[:k]\r\nl1=l1[len(l1)-m:]\r\nif l[-1]<l1[0]:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n\r\n\r\n", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort(reverse=True)\r\nx=a[:k]\r\ny=b[:m]\r\ny.sort()\r\nif x[k-1]<y[0]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "z=lambda :tuple(map(int,input().split()));s,s1=z();a,b=z();print(\"YES\" if z()[a-1]<z()[-b] else \"NO\")", "a = list(map(int,input().split()))\r\nb= list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\ne = 0\r\nf = b[1]\r\nfor i in range(len(c)):\r\n if d[-f] > c[i]:\r\n e+=1\r\nif e>=b[0]:\r\n print('Yes')\r\nelse:\r\n print('NO')\r\n", "A, B = list(map(int, input().split()))\nk, m = list(map(int, input().split()))\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\n\nif a[k-1] < b[B-m]:\n print(\"YES\")\nelse:\n print(\"NO\")", "sA, sB = map(int, input().split())\r\nk, m = map(int, input().split())\r\nA = [int(i) for i in input().split()]\r\nB = [int(i) for i in input().split()]\r\nprint(\"YES\" if A[k - 1] < B[len(B) - m] else \"NO\")\r\n", "na, nb = map(int, input().split())\nk, m = map(int, input().split())\na = map(int, input().split())\na = list(a)\nb = a\na = map(int, input().split())\na = list(a)\na, b = b, a\nprint(\"YES\" if a[k - 1] < b[nb - m] else \"NO\")\n", "import sys\ninput = sys.stdin.readline\n\nx, y = [int(i) for i in input().split()]\nk, m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nprint(\"YES\" if a[k - 1] < b[-m] else \"NO\")\n", "na_nb = input()\r\nna,nb = na_nb.split()\r\nna = int(na)\r\nnb = int(nb)\r\n\r\nk_m = input()\r\nk,m = k_m.split()\r\nk=int(k)\r\nm=int(m)\r\n\r\nA_str = input()\r\nA = A_str.split()\r\nB_str = input()\r\nB = B_str.split()\r\n\r\nif int(A[k-1])<int(B[-1*m]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na,nb=[int(x) for x in input().split()]\r\nk,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nif a[k-1]>=b[nb-m]:\r\n print('NO')\r\nelse:\r\n print('YES')", "nA,nB = (int(i) for i in input().split())\nk,m = (int(i) for i in input().split())\nAlist = [int(i) for i in input().split()]\nBlist = [int(i) for i in input().split()]\n\nif len(Alist) < k or len(Blist) < m:\n print(\"NO\")\nelse:\n biggestA = Alist[k-1]\n smallestB = Blist[-m]\n if biggestA < smallestB:\n print(\"YES\")\n else:\n print(\"NO\")\n \n \n", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\na1=a[:k]\r\nb1=b[len(b)-m:len(b)]\r\n#print(a1,b1)\r\nif(min(b1)<=max(a1)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "def arrays(lst1, lst2, k, m):\r\n if lst1[k - 1] < lst2[len(lst2) - m]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nna, nb = [int(i) for i in input().split()]\r\nK, M = [int(j) for j in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(y) for y in input().split()]\r\nprint(arrays(a, b, K, M))\r\n", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nb=sorted(map(int,input().split()))\r\nif a[k-1]<b[-m]: print('YES')\r\nelse: print('NO')", "wwwww=list(map(int,input().split()))\r\ninfo=list(map(int,input().split()))\r\na=info[0]\r\nb=info[1]\r\nf=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\nt=f[a-1]\r\np=s[-b]\r\nif t<p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = [int(x) for x in input().split()]\nk = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\n\nif b[n[1]-k[1]] > a[k[0]-1]:\n\tprint('YES')\nelse:\n\tprint('NO')", "import sys\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\n\r\n\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n\r\ndef get_strings(): return list(sys.stdin.readline().strip().split())\r\n\r\n\r\nna, nb = get_ints()\r\nk, m = get_ints()\r\na = get_ints()\r\nb = get_ints()\r\n\r\n\r\ndef solve():\r\n if a[k - 1] < b[nb - m]:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nsolve()\r\n", "na, nb = map(int, input().split())\nk, m = map(int, input().split())\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nmaxa = A[k - 1]\nminb = B[-m]\n# print(maxa, minb)\nif maxa < minb:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor i in range(1):#nmbr()):\r\n na,nb=lst()\r\n ta,tb=lst()\r\n a=lst()\r\n b=lst()\r\n print('YES' if a[ta-1]<b[-tb] else 'NO')", "n,l = map(int,input().split())\r\nk,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif a[k-1]<b[l-m]:\r\n print('YES')\r\n quit()\r\nprint('NO')", "n,m=map(int,input().split())\r\na,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nk=l[a-1]\r\ncount = len([i for i in m if i > k])\r\nif(count>=b):\r\n print('YES')\r\nelse:\r\n print('NO')", "nA, nB = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nB = list(reversed(B))\r\nprint(\"YES\" if B[m - 1] > A[k - 1] else \"NO\")\r\n", "read = lambda: list(map(int, input().split()))\r\nna, nb = read()\r\nn, m = read()\r\nA = read()\r\nB = read()\r\nm -= 1\r\nC = A[:n]\r\nD = B[(nb - m - 1):]\r\nprint(\"YES\" if max(C) < min(D) else \"NO\")", "# ProblemLink: http://codeforces.com/problemset/problem/572/A\r\n\r\nimport sys\r\nimport time\r\n\r\ndef main():\r\n\t# Get input from console\r\n\tfirst_line_input = sys.stdin.readline().strip()\r\n\tsecond_line_input = sys.stdin.readline().strip()\r\n\tsecond_line_input = list(map(int, second_line_input.split(\" \")))\r\n\r\n\tthird_line_input = sys.stdin.readline().strip()\r\n\tthird_line_input = list(map(int, third_line_input.split(\" \")))\r\n\r\n\tfourth_line_input = sys.stdin.readline().strip()\r\n\tfourth_line_input = list(map(int, fourth_line_input.split(\" \")))\r\n\r\n\t# Convert to list data to process\r\n\tvar_k = second_line_input[0]\r\n\tvar_m = second_line_input[1]\r\n\r\n\tarray_A = third_line_input\r\n\tarray_B = fourth_line_input\r\n\r\n\t# Sort order of array A | ascending order\r\n\tarray_A.sort()\r\n\r\n\t# Sort order of array B | descending order\r\n\tarray_B.sort(reverse=True)\r\n\r\n\t# Pick k numbers in array_A\r\n\tlist_k_array_A = array_A[0:var_k]\r\n\t\r\n\t# Pick m numbers in array_B\r\n\tlist_m_array_B = array_B[0:var_m]\r\n\r\n\t# Get the highest and lowest number in array_A\r\n\thighest_no_list_m_array_A = list_k_array_A[-1]\r\n\tlowest_no_list_m_array_A = list_k_array_A[0]\r\n\r\n\t# Get the lowest number in array_B\r\n\tlowest_no_list_m_array_B = list_m_array_B[-1]\r\n\r\n\r\n\t# Process\r\n\tflag_ans = \"NO\"\r\n\tif highest_no_list_m_array_A < lowest_no_list_m_array_B and lowest_no_list_m_array_A < lowest_no_list_m_array_B:\r\n\t\tflag_ans = \"YES\"\r\n\r\n\t# Print out answer\r\n\tprint(flag_ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = input()\r\n\r\nlimits_map = map(int, input().split())\r\nlimits = list(limits_map)\r\n\r\na_map = map(int, input().split())\r\na = list(a_map)\r\nb_map = map(int, input().split())\r\nb = list(b_map)\r\n\r\nif a[limits[0] - 1 ] < b[len(b) - limits[1]]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=map(int,input().split())\r\nn,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nar1=list(map(int,input().split()))\r\nif ar[n-1]<ar1[-k]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "text = input().split()\nn_a = int(text[0])\nn_b = int(text[1])\n\ntext = input().split()\nk = int(text[0])\nm = int(text[1])\n\na = sorted([int(t) for t in input().split()])\nb = sorted([int(t) for t in input().split()], reverse=True)\n\nif a[k-1] < b[m-1]:\n print('YES')\nelse:\n print('NO')\n\n\n", "\r\n\r\n\r\ndef main_function():\r\n input()\r\n k, m = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n b = [int(i) for i in input().split(\" \")]\r\n counter_a = 0\r\n counter_b = 0\r\n if a[k - 1] < b[-m]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\n\r\nprint(main_function())\r\n", "o = input()\r\nk, m = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split())), reverse=True)\r\nprint(\"YES\" if max(a[:k])<min(b[:m]) else \"NO\")", "na,nb = [int(x) for x in input().split()]\r\nk,m = [int(x)for x in input().split()]\r\nk = input().split()[k-1]\r\nl = input().split()\r\nm = l[len(l)-m]\r\nif int(m) > int(k):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "nA,nB = map(int,input().split())\r\nk,m = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\n\r\nA1 = A[:k]\r\nB1 = B[-m:]\r\n\r\nif max(A1) >= min(B1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "N, M = map(int, input().split())\r\nX, Y = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nif A[X - 1] < B[M - Y]:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "na, nb = input().split(\" \")\r\nk, m = input().split(\" \")\r\n\r\na = input().split(\" \")\r\nb = input().split(\" \")\r\n\r\nif len(a) >= int(k) and len(b) >= int(m):\r\n \r\n if int(b[-1]) <= int(a[int(k)-1]):\r\n print(\"NO\")\r\n else:\r\n for i in range(len(b)):\r\n if int(a[int(k)-1]) < int(b[i]):\r\n if len(b) - i >= int(m):\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"NO\")", "nA,nB = list(map(int, input().split()))\r\nk,m = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nmaxak = A[k-1]\r\ncount = 0\r\nfor i in range(nB):\r\n if B[i] > maxak:\r\n count=count+1\r\n if count== m:\r\n break\r\nif(count == m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from bisect import bisect\r\n\r\n\r\nna, nb = [int(x) for x in input().split()]\r\nk, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nx = a[k - 1]\r\ny = b[nb - m]\r\n\r\nif x < y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "first_line = list(map(int, input().split()))\r\nsecond_line = list(map(int, input().split()))\r\n\r\nsize_a = first_line[0]\r\nsize_b = first_line[1]\r\n\r\nk = second_line[0]\r\nm = second_line[1]\r\n\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\ndef main():\r\n if k > len(A):\r\n print(\"NO\")\r\n return\r\n \r\n if m > len(B):\r\n print('NO')\r\n return \r\n \r\n if A[k-1] < B[-m]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nif __name__ == '__main__':\r\n main()\r\n \r\n \r\n\r\n\r\n ", "input()\r\nk,m=map(int,input().split())\r\nx=[*map(int,input().split())]\r\ny=[*map(int,input().split())]\r\nprint('YNEOS'[x[k-1]>=y[-m]::2])", "n1, n2 = (s for s in input().split())\r\nk, m = (int(i) for i in input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\na.sort()\r\nb.sort()\r\nif a[k-1] < b[-m]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "na, nb = map(int, input().split())\r\nk, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ns = a[k - 1]\r\nb.sort(reverse = True)\r\nf = b[m - 1]\r\nif s < f:\r\n print('YES')\r\nelse:\r\n print('NO')", "Na, Nb = tuple(int(i) for i in input().split())\r\nk1, k2 = tuple(int(i) for i in input().split())\r\nA = list(int(i) for i in input().split())\r\nB = list(int(i) for i in input().split())\r\n\r\nif(A[k1-1] < B[Nb-k2]):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,m = map(int,input().split(' '))\r\na,b = map(int,input().split(' '))\r\n\r\narr1 = [int(i) for i in input().split(' ')]\r\narr2 = [int(i) for i in input().split(' ')]\r\nif(arr1[a-1] < arr2[m-b]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "''' Солдат и значки 1200 '''\r\n\r\n#n = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\n#a.sort()#; print(a)\r\nna, nb = a\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nk, m = a\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\n\r\nb = input()\r\nb = b.split()\r\nb = [int(x) for x in b]\r\nb = b[::-1]\r\nif a[k-1] < b[m-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "na,nb=map(int,input().split())\r\nk,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif b[-m]>a[k-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "na, nb = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nif l1[k-1] < l2[nb-m]:print(\"YES\")\r\nelse: print(\"NO\")\r\n", "\r\nna,mb=map(int,input().split())\r\nk,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nnote=len(l2)\r\nfor i in range (len(l2)):\r\n\tif l1[k-1]<l2[i]:\r\n\t\tnote=i\r\n\t\tbreak\r\nif len(l2)-note+1>m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "input()\r\nk, m = map(int, input().split())\r\n*l, = map(int, input().split())\r\n*r, = map(int, input().split())\r\nt = l[k-1]\r\nc = 0\r\nfor i in range(len(r)):\r\n if r[i] > t:\r\n c += len(r)-i\r\n break;\r\nprint('YNEOS'[(c < m)::2])", "n1, n2 = list(map(int, input().split()))\r\nk, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nb_length = len(b)\r\n\r\nprint(\"YES\" if a[k - 1] < b[b_length - m] else \"NO\")\r\n", "\r\nna , nb = map(int , input().split())\r\nk , m = map(int , input().split())\r\n\r\na = [int(a) for a in input().split()]\r\nb = [int(b) for b in input().split()]\r\nb.sort(reverse = True)\r\n\r\nif a[k - 1] < b[m - 1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n" ]

[ "import sys\n \nf = open(\"input.txt\")\ng = open(\"output.txt\", \"w\")\nm, k = map(int, f.readline().strip().split())\nv = frozenset(map(int, f.readline().strip().split()))\nn = int(f.readline().strip())\n \nx = []\n \nfor _ in range(n):\n f.readline().strip()\n f.readline().strip()\n info = [0, 0, 0] # yes no maybe\n for a in map(int, f.readline().strip().split()):\n if a == 0:\n info[2] += 1\n elif a in v:\n info[0] += 1\n else:\n info[1] += 1\n \n mustbeyes = max(0, info[2] - ((m - k) - info[1]))\n mustbeno = max(0, info[2] - (k - info[0]))\n info[0] += mustbeyes\n info[1] += mustbeno\n info[2] -= (mustbeyes + mustbeno)\n mi = info[0]\n ma = info[0] + info[2]\n x.append((mi, ma))\n \nif n == 1:\n g.write(\"0\\n\")\nelse:\n for i in range(n):\n leme = x[i][0]\n leothers = list(map(lambda y: y[1], x))\n del leothers[i]\n if leme >= max(leothers):\n g.write(\"0\\n\")\n continue\n \n leme = x[i][1]\n leothers = list(map(lambda y: y[0], x))\n del leothers[i]\n if leme < max(leothers):\n g.write(\"1\\n\")\n continue\n \n g.write(\"2\\n\")\n \t \t \t \t \t \t \t \t\t", "import math\nmy_file = open(\"input.txt\", \"r\")\noutputFile = open(\"output.txt\", \"w\")\nm, k = map(int,my_file.readline().split())\nid = list(map(int,my_file.readline().split()))\nn = int(my_file.readline())\nclass a:\n def __init__(self, max, min):\n self.max = max\n self.min = min\ni = 0\nmovies=[]\nwhile i < n:\n movieName = my_file.readline()\n num = int(my_file.readline())\n actors = list(map(int, my_file.readline().split()))\n zero = 0\n loveNum = 0\n notLoveNum = 0\n for item in actors:\n if item == 0:\n zero += 1\n elif item in id:\n loveNum += 1\n elif item not in id:\n notLoveNum += 1\n maxFav = min(zero, k - loveNum) + loveNum\n minFav = max(0, zero - (m - k - notLoveNum)) + loveNum\n movies.append(a(maxFav, minFav))\n i += 1\nfor a in range(0,n):\n flag1 = False\n flag2 = False\n for b in range(0,n):\n if a != b:\n if movies[b].min > movies[a].max:\n flag1 = True\n break\n for b in range(0,n):\n if a != b:\n if movies[b].max > movies[a].min:\n flag2 = True\n if not flag2:\n outputFile.write(str(0) + '\\n')\n elif flag1:\n outputFile.write(str(1) + '\\n')\n else:\n outputFile.write(str(2) + '\\n')\n \t\t \t \t\t\t \t \t \t\t \t", "with open('input.txt', 'r') as inn:\n\twith open('output.txt', 'w') as out:\n\t\tm, k = map(int, inn.readline().split())\n\t\tacs = [0]*(m +1)\n\t\ta = list(map(int, inn.readline().split()))\n\t\tfor i in a: acs[i] = 1\n\t\tn = int(inn.readline())\n\t\tbad = [0]*(n +1)\n\t\tbest = [0]*(n +1)\n\t\tfor i in range(n):\n\t\t\tinn.readline()\n\t\t\td = int(inn.readline())\n\t\t\tb = list(map(int, inn.readline().split()))\n\t\t\tuk = b.count(0)\n\t\t\tbad[i] = sum(acs[i] for i in b)\n\t\t\tbest[i] = bad[i] +min(uk, k -bad[i])\n\t\t\tbad[i] += max(0, uk -(m -k -(d -uk -bad[i])))\n\t\tfor i in range(n):\n\t\t\tif best[i] < max(bad[:i] +bad[i +1:]):\n\t\t\t\tout.write('1\\n')\n\t\t\telif bad[i] >= max(best[:i] +best[i +1:]):\n\t\t\t\tout.write('0\\n')\n\t\t\telse:\n\t\t\t\tout.write('2\\n')", "data = open('input.txt', 'r')\nm, k = map(int, data.readline().split())\nf, n = set(map(int, data.readline().split())), int(data.readline())\nv1 = []\nv2 = []\nfor i in range(n):\n data.readline()\n c = int(data.readline())\n a = list(map(int, data.readline().split()))\n u = a.count(0)\n b = len(f & set(a))\n v1.append(b + max(0, k + c - m - b))\n v2.append(b + min(k - b, u))\nrecord = open('output.txt', 'w')\nv_1 = max(v1)\nv2_sorted = sorted(v2)\nfor i in range(n):\n if n == 1 or v2[i] == v2_sorted[-1] and v1[i] >= v2_sorted[-2]:\n print('0', file=record)\n elif v2[i] < v_1:\n print('1', file=record)\n else:\n print('2', file=record)\n\n\t \t \t\t\t \t \t \t \t \t\t \t", "fi = open('input.txt','r')\nm,k =map(int,fi.readline().split())\nf,n,v1,v2 =set(map(int,fi.readline().split())),int(fi.readline()),[],[]\nfor i in range(n):\n fi.readline()\n c,a=int(fi.readline()),list(map(int,fi.readline().split()))\n u,b=a.count(0),len(f&set(a))\n v1.append(b+max(0,k+c-m-b))\n v2.append(b+min(k-b,u))\nfo=open('output.txt','w')\nvcl,v2s=max(v1),sorted(v2)\nfor i in range(n):\n if n==1 or v2[i]==v2s[-1] and v1[i]>=v2s[-2]:\n print('0',file=fo)\n elif v2[i] <vcl:\n print('1',file=fo)\n else:\n print('2',file=fo)\n\t\t \t \t \t\t\t \t \t \t\t \t\t\t\t\t\t \t", "fi = open('input.txt', 'r')\nm, k = map(int, fi.readline().split())\nf, n, v1, v2 = set(map(int, fi.readline().split())), int(fi.readline()), [], []\nfor i in range(n):\n fi.readline()\n c, a = int(fi.readline()), list(map(int, fi.readline().split()))\n u, b = a.count(0), len(f & set(a))\n v1.append(b + max(0, k + c - m - b))\n v2.append(b + min(k - b, u))\nfo = open('output.txt', 'w')\nvc1, v2s = max(v1), sorted(v2)\nfor i in range(n):\n if n == 1 or v2[i] == v2s[-1] and v1[i] >= v2s[-2]:\n print('0', file=fo)\n elif v2[i] < vc1:\n print('1', file=fo)\n else:\n print('2', file=fo)\n\t \t \t \t\t\t \t\t\t\t\t\t \t", "from copy import deepcopy\n \n \nf = open('input.txt')\nf1 = open('output.txt', 'w')\nm, k = map(int, f.readline().split())\na = list(map(int, f.readline().split()))\na = set(a)\nn = int(f.readline())\npole = []\nfor i in range(n):\n s = f.readline()\n count = int(f.readline())\n actors = list(map(int, f.readline().split()))\n help = deepcopy(actors)\n count_0 = actors.count(0)\n actors = set(actors)\n min_love = 0\n max_love = 0\n for i in actors:\n if i in a:\n max_love += 1\n for i in range(1, m + 1):\n if count_0 == 0:\n break\n if i in a and i not in actors:\n max_love += 1\n count_0 -= 1\n for i in range(len(help)):\n if help[i] == 0:\n for j in range(1, m + 1):\n if j not in a and j not in actors:\n help[i] = j\n actors.add(j)\n break\n min_love = 0\n for i in help:\n if i in a:\n min_love += 1\n if i == 0:\n min_love += 1\n pole.append((min_love, max_love))\nfor i in range(n):\n flag_love = True\n for j in range(n):\n if i == j:\n continue\n if pole[i][0] < pole[j][1]:\n flag_love = False\n flag_not_love = False\n for j in range(n):\n if i == j:\n continue\n if pole[i][1] < pole[j][0]:\n flag_not_love = True\n if flag_love:\n print(0, file = f1)\n elif flag_not_love:\n print(1, file = f1)\n else:\n print(2, file = f1)\nf.close()\nf1.close()\n \t \t \t\t\t\t\t \t \t \t\t \t\t \t \t", "import sys\n\n\n\ntry:\n\n sys.stdin = open('input.txt')\n\n sys.stdout = open('output.txt', 'w')\n\nexcept:\n\n pass\n\n\n\n\n\ndef compl(n, s):\n\n return set(filter(lambda x: x not in s, range(1, n + 1)))\n\n\n\nm, k = list(map(int, input().split()))\n\nid = list(map(int, input().split()))\n\nn = int(input())\n\nfavorite = set(id)\n\n\n\nif n == 1:\n\n print(0)\n\n exit()\n\n\n\nbest = []\n\nguaranteed = []\n\n\n\nfor i in range(n):\n\n name = input()\n\n cnt = int(input())\n\n tmp = list(map(int, input().split()))\n\n s = set()\n\n cnt_zero = 0\n\n for elem in tmp:\n\n if elem != 0:\n\n s.add(elem)\n\n else:\n\n cnt_zero += 1\n\n\n\n inter = s & favorite\n\n comp = compl(m, favorite | s)\n\n pred = max(0, cnt_zero - len(comp))\n\n g = len(inter) + pred\n\n guaranteed.append(g)\n\n\n\n cnt_zero -= pred\n\n b = g + min(cnt_zero, len(favorite - s) - pred)\n\n best.append(b)\n\n\n\nmax_g = max(guaranteed)\n\n\n\nfor i in range(n):\n\n max_b = 0\n\n for j in range(n):\n\n if i == j:\n\n continue\n\n max_b = max(max_b, best[j])\n\n\n\n if guaranteed[i] >= max_b:\n\n print(0)\n\n elif best[i] < max_g:\n\n print(1)\n\n else:\n\n print(2)\n\n\n\t\t \t\t\t \t\t \t\t \t\t \t\t\t\t\t\t \t", "FAVORITE = 0\nNOT_FAVORITE = 1\nMAYBE = 2\n\nwith open(\"input.txt\", \"r\") as f:\n m, k = tuple(map(int, f.readline().strip().split(' ')))\n faves = list(map(int, f.readline().strip().split(' ')))\n total_num_not_faves = m - len(faves)\n n = int(f.readline().strip())\n intervals = []\n for i in range(n):\n s = f.readline().strip()\n d = int(f.readline().strip())\n actors = list(map(int, f.readline().strip().split(' ')))\n zeros = sum([1 if x == 0 else 0 for x in actors])\n num_faves = sum([1 if a in faves else 0 for a in actors])\n num_not_faves = len(actors) - zeros - num_faves\n num_faves_remaining = len(faves) - num_faves\n num_not_faves_remaining = total_num_not_faves - num_not_faves\n if zeros <= num_not_faves_remaining:\n lower = num_faves\n else:\n lower = num_faves + (zeros - num_not_faves_remaining)\n\n upper = num_faves + min(zeros, num_faves_remaining)\n intervals.append((lower, upper))\n # print(s, lower, upper)\n\n best_upper = max(map(lambda x: x[1], intervals))\n best_lower = max(map(lambda x: x[0], intervals))\n\n with open(\"output.txt\", \"w\") as g:\n for interval in intervals:\n # Check if it is the fave\n is_fave = True\n for other in intervals:\n if interval is not other:\n if other[1] > interval[0]:\n is_fave = False\n if is_fave:\n g.write(\"{}\\n\".format(FAVORITE))\n continue\n\n # Check if it is not the fave\n is_not_fave = False\n for other in intervals:\n if interval is not other:\n if other[0] > interval[1]:\n is_not_fave = True\n if is_not_fave:\n g.write(\"{}\\n\".format(NOT_FAVORITE))\n continue\n g.write(\"{}\\n\".format(MAYBE))\n", "with open(\"input.txt\", \"r\") as inp:\r\n m, k = map(int, inp.readline().split())\r\n\r\n fav = set(map(int, inp.readline().split()))\r\n n = int(inp.readline())\r\n\r\n def get_val(folks):\r\n potential = set(list(fav))\r\n num_pot = 0\r\n all_folks = set(range(1, m + 1))\r\n val = 0\r\n for f in folks:\r\n if f == 0:\r\n num_pot += 1\r\n elif f in fav:\r\n val += 1\r\n potential.remove(f)\r\n\r\n if f != 0:\r\n all_folks.remove(f)\r\n\r\n num_pp = len(all_folks.difference(potential))\r\n take_stop = num_pot\r\n take_stop -= num_pp\r\n take_stop = min(take_stop, len(potential))\r\n take_stop = max(0, take_stop)\r\n num_pot = min(num_pot, len(potential))\r\n\r\n return val + num_pot, num_pot - take_stop\r\n\r\n folks = [[] for i in range(n)]\r\n\r\n for i in range(n):\r\n inp.readline()\r\n inp.readline()\r\n folks[i] = list(map(int, inp.readline().split()))\r\n\r\n mx_val = -1\r\n mx_lolo = -1\r\n values = []\r\n for i in range(n):\r\n mx, pot = get_val(folks[i])\r\n mx_val = max(mx_val, mx)\r\n mx_lolo = max(mx_lolo, mx - pot)\r\n values.append((mx, mx - pot))\r\n print(i, folks[i], 'mx', mx, pot)\r\n print('mx_val', mx_val, 'mx_lolo', mx_lolo)\r\n\r\n with open(\"output.txt\", \"w\") as out:\r\n for i in range(n):\r\n mx, pot = get_val(folks[i])\r\n cur = [values[j][0] if j != i else values[j][1] for j in range(n)]\r\n cur.sort()\r\n v = 2\r\n if cur[-1] == values[i][1]:\r\n v = 0\r\n cur = [values[j][1] if j != i else values[j][0] for j in range(n)]\r\n cur.sort()\r\n if cur[-1] != values[i][0]:\r\n v = 1\r\n\r\n print(v, file=out)" ]

[ "# import sys, io, os\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\nfrom collections import defaultdict,Counter\n\ndef solve(n,m,p,a,b):\n ans=[]\n cb=Counter(b)\n for q in range(min(p,n-(m-1)*p)):\n arr = [a[i] for i in range(q,n,p)]\n lb=len(cb.keys())\n cnt=cb.copy()\n # print(cnt)\n # print(arr)\n for v in arr[:m]:\n cnt[v]-=1\n if cnt[v]==0:\n lb-=1\n elif cnt[v]==-1:\n lb+=1\n j=0\n if lb==0:\n ans.append(q+1)\n for i,v in enumerate(arr[m:],m):\n cnt[v]-=1\n if cnt[v]==0:\n lb-=1\n elif cnt[v]==-1:\n lb+=1\n cnt[arr[j]]+=1\n if cnt[arr[j]]==0:\n lb-=1\n elif cnt[arr[j]]==1:\n lb+=1\n j+=1\n # print(cnt,lb,j,q)\n if lb==0:\n ans.append(q+j*p+1)\n print(len(ans))\n print(*sorted(ans))\n \n\nn,m,p=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nsolve(n,m,p,a,b)\n", "from collections import defaultdict\r\n\r\nn, m, p = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nu = defaultdict(int)\r\nfor i in b: u[i] += 1\r\n\r\nans = []\r\nfor q in range(p):\r\n c = a[q: n: p]\r\n if len(c) < m: break\r\n\r\n v = defaultdict(int)\r\n for i in c[: m]: v[i] += 1\r\n\r\n d = q + 1\r\n if u == v: ans.append(d)\r\n\r\n for j, k in zip(c[: len(c) - m], c[m: ]):\r\n v[j] -= 1\r\n if v[j] == 0: v.pop(j)\r\n v[k] += 1\r\n\r\n d += p\r\n if u == v: ans.append(d)\r\n\r\nans.sort()\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))", "from collections import Counter\n\nn, m, p = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\n\ndef try_from(start, a, b):\n result = []\n seq = a[start::p]\n i = 0\n if len(seq) < len(b):\n return []\n\n counts_a = Counter(seq[:len(b)])\n counts_b = Counter(b)\n if counts_a == counts_b:\n result.append(start)\n\n for i in range(1, len(seq) - len(b) + 1):\n counts_a[seq[i-1]] -= 1\n counts_a[seq[i+len(b) - 1]] += 1\n if not counts_a[seq[i-1]]:\n del counts_a[seq[i-1]]\n\n ok = counts_a == counts_b\n #ok = sorted(seq[i:i+len(b)]) == sorted(b)\n\n if ok:\n result.append(start + p * i)\n\n return [x + 1 for x in result]\n\n\nresult = []\nfor start in range(p):\n result += try_from(start, a, b)\n\nprint(len(result))\nprint(' '.join(map(str, sorted(result))))\n\n\n\n\n\n# Made By Mostafa_Khaled" ]

[ "import math as m\r\nt=1\r\n#t=int(input())\r\nmod=10**9+7\r\nwhile t:\r\n t-=1\r\n s=input()\r\n ans,cost=0,0\r\n for i in range(len(s)):\r\n if s[i]=='a':\r\n cost=(cost*2+1)%mod\r\n else :\r\n ans+=cost\r\n print(ans%mod)\r\n", "new_seq = list(input())\nnew_bs = 0\nnew_mod = 1000000007\nnew_plays = 0\n\nnew_seq.reverse()\nfor char in new_seq:\n if char == 'b':\n new_bs = (new_bs + 1) % new_mod\n else:\n new_plays = (new_plays + new_bs) % new_mod\n new_bs = (new_bs * 2) % new_mod\n\nprint(new_plays)\n\n\t \t \t \t \t\t \t \t \t \t \t \t", "mod = 1000000007\n\nstring = input()\nquant_b = 0\nresult = 0\nfor i in range(len(string) - 1, -1, -1):\n if string[i] != 'b':\n result = (result + quant_b) % mod\n quant_b = (2 * quant_b) % mod\n else:\n quant_b = (quant_b + 1) % mod\n\nprint(result)\n\n \t\t\t\t \t\t \t\t\t\t\t \t", "def quantidadeJogadas(string, c):\n jogadas = 0\n quantidadeB = 0\n\n i = len(string) - 1\n while i >= 0:\n if string[i] == \"b\":\n quantidadeB = (quantidadeB + 1) % c\n else:\n jogadas = (jogadas + quantidadeB) % c\n quantidadeB = (2 * quantidadeB) % c\n i -= 1\n return jogadas\n\nc = 1000000007\nstring = input()\nprint(quantidadeJogadas(string, c))\n \t\t \t \t\t\t \t \t\t \t\t \t\t\t", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nx = 10**9 + 7\n\na = input()\n\nb = 0\nr = 0\n\nfor i in a[::-1]:\n if i == 'a':\n r += b\n b = b * 2 % x\n else:\n b += 1\n \nr = r % x\n\nprint(r)\n \t\t \t \t\t \t\t \t \t\t \t \t \t", "import sys \r\nimport bisect\r\nimport math as mt\r\n\r\n#input=sys.stdin.readline\r\n#t=int(input())\r\nt=1\r\nmod=10**9+7\r\nfor _ in range(t):\r\n \r\n #n=int(input())\r\n #l,r=map(int,input().split())\r\n #l1=list(map(int,input().split()))\r\n #l2=list(map(int,input().split()))\r\n s=input()\r\n n=len(s)\r\n cnt=0\r\n ans=0\r\n prev,nex=0,0\r\n mul=1\r\n pref=[0]*(n+1)\r\n pref[0]=0\r\n mul=1\r\n for i in range(n):\r\n pref[i+1]=(mul+pref[i])%mod\r\n mul=(mul*2)%mod\r\n \r\n mul=1\r\n for i in range(len(s)):\r\n if s[i]=='a':\r\n nex+=1 \r\n cnt+=1\r\n else:\r\n #print(cnt,nex,pref[:6])\r\n ans=(ans%mod+pref[cnt])%mod\r\n \r\n cnt=nex\r\n \r\n #ans=(ans%mod+cnt%mod)%mod\r\n print(ans)", "string = list(input())\nanswer = 0\ncont = 0\n\nwhile string:\n if 'a'== string.pop():\n answer += cont\n cont = (cont * 2) % 1000000007\n else:\n cont += 1\n \nprint (answer % 1000000007)\n\t \t\t \t \t \t\t \t\t\t \t \t \t\t", "entrada = input()\n\nmod = 1000000007\nresult = 0\nbs = 0\n\nfor i in range(len(entrada)-1, -1, -1):\n if entrada[i] == \"b\":\n bs = (bs + 1) % mod\n else:\n result = (result + bs) % mod\n bs = (bs*2) % mod\n\nprint (result)\n\t\t \t\t\t \t\t \t \t \t\t \t \t\t\t\t \t\t\t", "s, mod, ans, b = list(input()), 1000000007, 0, 0\r\n\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == 'b':\r\n b += 1\r\n else:\r\n if b:\r\n ans = (ans + b) % mod\r\n b = (b * 2) % mod\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Jul 28 15:37:05 2021\n\n@author: lcarv\n\"\"\"\n\nmod = 1000000007\n\ns = str(input())\n\nq = 0\nj = 0\n\nfor i in range(len(s)-1,-1, -1):\n if s[i] == \"b\":\n q = (q+1)%mod\n \n else: \n \n j = (j + q)%mod\n q = (q*2)%mod\n \nprint(j)\n \n \t \t\t\t\t\t\t \t\t \t \t \t \t \t\t\t", "palavra = str(input())\nseparado = [char for char in palavra]\n\ncontB = 0\ncontEsp = 0\nMOD = 1000000007\n\nfor x in range(len(separado) -1, -1, -1):\n if (separado[x] == \"b\"):\n contB += 1\n contB = contB % MOD\n else:\n contEsp += contB \n contEsp = contEsp % MOD\n contB *= 2\n contB = contB % MOD\nprint(contEsp)\n\t \t \t\t\t \t\t \t\t \t \t\t\t\t \t\t \t", "M, a, b=10**9+7, 0, 0\r\nfor c in reversed(input()):\r\n\tif c=='b':\r\n\t\tb+=1\r\n\telse:\r\n\t\ta+=b\r\n\t\tb=(b<<1)%M\r\nprint(a%M)\r\n", "a,b,m=0,0,10**9+7\r\nfor i in input()[::-1]:\r\n\tif i=='b':\r\n\t\tb+=1\r\n\telse:\r\n\t\ta+=b\r\n\t\tb=(b<<1)%m\r\nprint(a%m)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 7 16:35:34 2021\r\n\r\n@author: LENOVO\r\n\"\"\"\r\n\r\n\r\ns = input()\r\nb_s = 0 #representa la cantidad de b's encontradas desde el final de la cadena\r\nresult = 0 #cantidad de operaciones a realizar para que no queden \"ab\" en la cadena\r\n\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i] == 'a':\r\n result = (result + b_s) % (1e9+7) #por cada 'b' despues de 'a' hay que hacer una transformacion\r\n b_s = (b_s *2) % (1e9+7) #porque cada sustitucion en \"ab\" genera 2 b's,\r\n \r\n else: #s[i] == 'b'\r\n b_s+=1;\r\n \r\n\r\nprint(int(result % (1e9+7)));\r\n", "s = input()\r\ncnt = 0\r\nm=10**9 + 7\r\nt = 0\r\n\r\nfor i in range(len(s)):\r\n\tif s[~i] == 'a':\r\n\t\tcnt = (cnt+t)%m\r\n\t\tt = (t*2)%m\r\n\telse:\r\n\t\tt += 1\r\nprint(cnt)", "S = input()[::-1]\r\nS1 = []\r\n\r\nnum = 0\r\nfor s in S:\r\n if s == 'b':\r\n num += 1\r\n else:\r\n S1.append(num)\r\n\r\nS1 = S1[::-1]\r\nr = 0\r\nnum = 1\r\nfor s in S1:\r\n r = (r + s * num) % 1000000007\r\n num = (num * 2) % 1000000007\r\n\r\nprint(r)\r\n", "import math as mt\nimport sys, string\nfrom collections import Counter, defaultdict\ninput = sys.stdin.readline\n \nMOD = 1000000007\nPI = 3.14159265358979323\n \nI = lambda : int(input())\nS = lambda : input()\nM = lambda : map(int, input().split())\nMs = lambda : map(str, input().split()) \nARR = lambda : list(map(int, input().split()))\n \ndef solve():\n\ts = S()\n\tans, count_b = 0, 0\n\tfor i in range(len(s)-1,-1,-1):\n\t\tif s[i] == 'b': count_b += 1\n\t\telse:\n\t\t\tans += count_b\n\t\t\tans %= MOD\n\t\t\tcount_b *= 2\n\t\t\tcount_b %= MOD\n\tprint(ans)\n\ntc = 1\n# tc = I()\nfor _ in range(tc):\n\tsolve()\n\n# aaaaabaabababaaaaaba", "s=input().strip()\r\nMOD = 10**9 + 7\r\ntotal=1\r\nsteps=0\r\nfor c in s:\r\n if(c=='a'):\r\n total=(total*2)%MOD\r\n else:\r\n steps+=total-1\r\nprint(steps%MOD)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nmod=10**9+7\r\ns=input()\r\nl=len(s)\r\nans=0\r\nbn=0\r\nfor i in range(l-1,-1,-1):\r\n if s[i]=='b':\r\n bn=(bn+1)%mod\r\n elif s[i]=='a':\r\n ans=(ans+bn)%mod\r\n bn=bn*2%mod\r\nprint(ans)\r\n\r\n", "mod = 1000000007\nb = 0\njogadas = 0\nstring = input()\nfor c in range(len(string) - 1, -1, -1):\n if(string[c] == 'b'):\n b = (b + 1) % mod\n else:\n jogadas = (jogadas + b)%mod\n b = (2 * b) % mod \nprint(jogadas)\n\t\t \t\t\t\t \t\t\t \t \t\t\t\t \t \t", "mod = 1000000007\nbs = 0\njogadas = 0\n\ns = input()\n\nfor i in range(len(s)-1,-1,-1):\n if(s[i]== 'b'):\n bs = (bs + 1) % mod\n else:\n jogadas = (jogadas + bs) % mod\n bs = (2*bs) % mod\nprint (jogadas) \n \t\t \t \t \t \t \t\t \t \t \t", "word = input()\nmod = 1000000007\ncount = 0\nres = 0\n\nfor i in range(len(word)-1, -1, -1):\n if(word[i] == \"b\"):\n count = (count+1) % mod\n else:\n res = (res + count) % mod\n count = (count * 2) % mod\n\nprint(res)\n \t \t\t\t \t\t \t \t\t\t\t\t\t \t", "sequence = list(input())\nbs = 0\nmod = 1000000007\nplays = 0\n\nsequence.reverse()\nfor letra in sequence:\n if letra == 'b':\n bs = (bs+1) % mod\n else:\n plays = (plays + bs) % mod\n bs = (bs * 2) % mod\n \nprint(plays)\n\n\t \t\t \t \t \t\t\t\t \t\t\t\t \t\t \t \t", "c, v, M = 0, 0, 10 ** 9 + 7\r\nfor ch in input()[::-1]:\r\n if ch == 'a':\r\n v = (v + c) % M\r\n c = 2 * c % M\r\n else:\r\n c += 1\r\nprint(v)", "modulo = 1000000007\nb = 0\nsaida = 0\nentrada = input()\ntamanho = len(entrada)\n\nfor i in range(tamanho-1,-1,-1):\n if(entrada[i] == 'b'):\n b = (b+1) % modulo\n else:\n saida = (saida + b) % modulo\n b = (b*2) % modulo\nprint (saida)\n \t\t \t \t \t \t\t\t\t\t \t \t\t", "s = input()\n\nans = 0\nmod = 10 ** 9 + 7\nt = 0\n\nfor i in range(len(s)):\n if s[~i] == 'a':\n ans = (ans + t) % mod\n t = (t * 2) % mod\n else:\n t += 1\nprint(ans)\n", "string = input()\n\nmod = 1000000007\nqtdb = 0\nvezes = 0\n\nfor i in range(len(string)-1,-1,-1):\n if string[i] == \"b\":\n qtdb = (qtdb + 1) % mod\n else:\n vezes = (vezes + qtdb) % mod\n qtdb = (2 * qtdb) % mod\n\nprint(vezes)\n\t \t \t \t \t\t \t\t\t\t\t \t \t\t\t\t\t \t \t", "import sys\r\ninput=sys.stdin.readline\r\ns=input().rstrip()\r\nn=len(s)\r\nb=[0]*n\r\nc=0\r\nfor i in range(n-1,-1,-1):\r\n if s[i]=='b':\r\n c+=1\r\n b[i]=c\r\n\r\nl=[]\r\nmod=10**9+7\r\nfor i in range(n-1,-1,-1):\r\n if s[i]=='a':\r\n if len(l)==0:\r\n l.append([i,b[i]])\r\n else:\r\n l.append([i,b[i]-b[l[-1][0]]])\r\nans=count=0\r\n\r\nfor i in range(len(l)):\r\n val=count+l[i][1]\r\n ans+=val%mod\r\n count=(val*2)%mod\r\n ans%=mod\r\nsys.stdout.write(str(ans%mod)+'\\n')", "def powers(a, m, X):\r\n p = [1]\r\n for i in range(m):\r\n p.append((p[-1] * a) % X)\r\n return p\r\n\r\n\r\ndef solve(r, M):\r\n pows = powers(2, len(r), M)\r\n c = 0\r\n ans = 0\r\n for char in r:\r\n if char == 'a':\r\n c += 1\r\n elif char == 'b':\r\n ans = (ans + (pows[c] - 1)) % M\r\n return ans\r\n\r\n\r\ns = input()\r\nprint(solve(s, 10 ** 9 + 7))\r\n\r\n", "MOD = 1000000007\r\n\r\n\r\nliste = []\r\ndef comp():\r\n ans = 1\r\n liste.append(ans)\r\n for i in range(1,1000001):\r\n ans = (ans * 2)%MOD\r\n liste.append(ans)\r\n\r\ns=input()\r\nacount=0\r\ncur = 0\r\ntotal= 0\r\ncomp()\r\nfor c in s:\r\n if c=='a':\r\n cur =cur + 1\r\n total = total + 1\r\n else:\r\n total = (total + liste[cur])%MOD\r\n\r\n\r\nprint(total - len(s))\r\n", "def solve(letters):\n modulo = (10 ** 9) + 7\n steps, b_s = 0, 0\n \n for i in range(len(letters) - 1, -1, -1):\n if letters[i] == 'b':\n b_s = (b_s + 1) % modulo \n else:\n steps = (steps + b_s) % modulo\n b_s = (2 * b_s) % modulo\n \n return steps\n \nletters = input()\n \nprint(solve(letters))\n \t \t\t \t\t\t\t\t \t \t \t\t \t\t", "b = 0\njogadas = 0\n\nstring = input()\nfor i in range(len(string) - 1, -1, -1):\n if(string[i] == 'b'):\n b = (b + 1) % 1000000007\n else:\n jogadas = (jogadas + b) % 1000000007\n b = (2*b) % 1000000007\n\nprint(jogadas)\n\n \t \t \t \t\t \t \t\t \t \t\t \t\t\t\t\t", "M, a, b = 10**9+7, 0, 0\nfor c in reversed(input()):\n\tif c == 'b':\n\t\tb += 1\n\telse:\n\t\ta += b\n\t\tb = (b<<1) % M\nprint(a % M)\n\n\t\t\t \t\t \t\t\t\t \t\t\t\t \t \t\t\t \t\t \t\t", "s = input()\r\ncnt, i = 0, 0\r\nmod = 10 ** 9 + 7\r\nans = 0\r\nwhile i < len(s) and s[i] == 'b': i += 1\r\nwhile i < len(s):\r\n while i < len(s) and s[i] == 'a':\r\n i += 1\r\n cnt += 1\r\n c = 0\r\n while i < len(s) and s[i] == 'b':\r\n i += 1\r\n c += 1\r\n ans = (ans + c * (pow(2, cnt, mod) - 1)) % mod\r\nprint(ans)", "\r\ndef main():\r\n s = input()\r\n cnt = 0\r\n m=10**9 + 7\r\n t = 0\r\n\r\n for i in range(len(s)):\r\n if s[~i] == 'a':\r\n cnt = (cnt+t)%m\r\n t = (t*2)%m\r\n else:\r\n t += 1\r\n print(cnt)\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()", "def main():\r\n s=input()\r\n r=0\r\n c=0\r\n m=(10**9)+7\r\n for i in range(len(s)-1,-1,-1):\r\n if s[i]=='b':\r\n c=(c%m)+1\r\n else:\r\n r=((r%m)+(c%m))%m\r\n c=(c*2)%m\r\n print(r)\r\n \r\nif __name__=='__main__':\r\n main()", "#double underscore makes a class variable or a class method private\r\nmod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\ns = si()[::-1]\r\nc,b=0,0\r\nfor i in s:\r\n if i=='b':\r\n b+=1\r\n else:\r\n c = (c+b) % mod\r\n b *= 2\r\n b %= mod\r\nprint(c)", "def main():\n s = input()\n r = b = 0\n for c in s[::-1]:\n if c == 'a':\n r += b\n b = b * 2 % 1000000007\n else:\n b += 1\n print(r % 1000000007)\n\n\nif __name__ == '__main__':\n main()\n", "mod = 10**9 + 7\n\nstring = list(input())\n\nsteps = 0\nanswer = 0\n\nwhile string:\n if 'a' == string.pop():\n answer += steps\n steps = (steps * 2) % mod\n\n else: steps += 1\n\nprint(answer % mod)\n\t\t \t \t\t \t\t\t \t \t\t\t \t\t \t\t\t", "s=input()\nmod = 10 ** 9+7\nb=0\nres=0\nfor c in s[::-1]:\n if c=='b':\n b+=1\n else:\n res+=b\n b*=2\n res%=mod\n b%=mod\nprint(res)", "n = input()\n\nmod = 1000000007\nnumb = 0\nnumsteps = 0\nfor i in range(len(n)-1, -1, -1):\n if(n[i] == \"b\"):\n numb+=1\n else:\n numsteps += numb\n numb = (numb * 2) % mod\n\nprint(numsteps % mod)\n\n \t\t\t \t \t \t \t \t \t\t \t\t\t\t\t \t\t", "Mod = 1000000007\r\n \r\ncur = 1 \r\nres = 0\r\na = input().strip()\r\nfor ch in a:\r\n if ch == \"a\":\r\n cur *= 2\r\n cur %= Mod\r\n else:\r\n res += cur - 1\r\n res %= Mod\r\nprint(res)", "import math as ma\r\nfrom sys import exit\r\nfrom decimal import Decimal as dec\r\n\r\n\r\ndef li():\r\n\treturn list(map(int , input().split()))\r\n\r\n\r\ndef num():\r\n\treturn map(int , input().split())\r\n\r\n\r\ndef nu():\r\n\treturn int(input())\r\n\r\n\r\ns = input()\r\nc = 0\r\ncounta = 1\r\ncountb = 0\r\nc = 0\r\n# print(c%1000000007)\r\nfor i in range(0 , len(s)):\r\n\t#print(\"hello\" , c , counta , i)\r\n\tif (s[i] == 'a'):\r\n\t\tcounta=(counta*2)%1000000007\r\n\t\tcontinue\r\n\tif(counta>0):\r\n\t\tc = (c + counta-1) % 1000000007\r\nprint(c)", "x = input()\r\nstr0 = x\r\nx=x[::-1]\r\n# print(x)\r\nmod = 10**9 + 7\r\nans = 0\r\nsum0 = 0\r\nfor i in range(len(x)):\r\n if x[i] == 'b':\r\n ans += 1\r\n else:\r\n sum0 += ans \r\n sum0 = sum0 % mod\r\n ans *= 2\r\n ans = ans % mod\r\n\r\nprint(sum0)", "mod = 10**9 + 7\r\n\r\nsequence = list(input())\r\n\r\nsteps = 0\r\nanswer = 0\r\nwhile sequence:\r\n if 'a' == sequence.pop():\r\n answer += steps\r\n steps = (steps * 2) % mod\r\n else:\r\n steps += 1\r\n \r\nprint(answer % mod)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 7 16:35:34 2021\r\n\r\n@author: LENOVO\r\n\"\"\"\r\n\r\n\r\ns = input()\r\n# for i in range(10**6):\r\n# if i%2==0:\r\n# s+='a'\r\n# else: \r\n# s+='b'\r\nb_s = result = 0\r\n\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i] == 'a':\r\n result = (result+ b_s)% (1e9+7)\r\n b_s = (b_s *2)% (1e9+7)\r\n else:\r\n b_s+=1;\r\n \r\n\r\nprint(int(result % (1e9+7)));\r\n", "s = str(input())\nb = 0\ng = 0\n\nfor i in reversed(s):\n if i == 'b':\n b = (b + 1)%1000000007\n \n else:\n g = (g + b)%1000000007\n b = (2 * b)%1000000007\n\nprint(g)\n\t \t\t\t\t\t\t\t\t\t\t\t\t \t\t\t \t\t\t \t\t\t\t\t", "c,b,m=0,0,int(1e9+7)\r\nfor i in input()[::-1]:\r\n if i=='a': c=(c+b)%m;b=(b*2)%m\r\n else: b+=1\r\nprint(c)", "letters = input()\nqtb = 0\nresult = 0\n\nfor i in range(len(letters) - 1, -1, -1):\n if letters[i] == 'b':\n qtb = (qtb + 1) % ((10**9) + 7)\n else:\n result = (result + qtb) % ((10**9) + 7)\n qtb = (2 * qtb) % ((10**9) + 7)\n\nprint(result)\n\n\t \t\t \t \t\t \t\t\t\t\t\t\t\t \t\t\t\t\t", "input=input()\r\nlen=len(input)\r\n\r\nfirst_pos_a=last_pos_b=0\r\nmod_num=10**9+7\r\n\r\nfor i in range(len):\r\n\tif input[i]=='a':\r\n\t\tfirst_pos_a=i\r\n\t\tbreak\r\n\r\nfor i in range(len-1,0-1,-1):\r\n\tif input[i]=='b':\r\n\t\tlast_pos_b=i\r\n\t\tbreak\r\n\r\nif first_pos_a>last_pos_b:\r\n\tprint(0)\r\n\texit()\r\n\r\ncount_b=sum=0\r\npow_2_a=1\r\nfor i in range(first_pos_a,last_pos_b+1):\r\n\tif input[i]=='a':\r\n\t\tif count_b>0:\r\n\t\t\tsum=(sum+((count_b%mod_num)*((pow_2_a-1)%mod_num))%mod_num)%mod_num\r\n\t\t\tcount_b=0\r\n\t\tpow_2_a=(pow_2_a*2)%mod_num\r\n\telif input[i]=='b':\r\n\t\tcount_b+=1\r\n\t\tif i==last_pos_b:\r\n\t\t\tsum=(sum+((count_b%mod_num)*((pow_2_a-1)%mod_num))%mod_num)%mod_num\r\nprint(sum)", "entrada = str(input())\n\nmod = 1000000007\nb = 0\nretorno = 0\n\n\nfor i in reversed(entrada):\n if i == 'b':\n b = (b + 1) % mod\n \n else:\n retorno = (retorno + b) % mod\n b = (2 * b) % mod\n\nprint(retorno)\n \t \t \t \t \t \t \t\t\t\t\t \t", "l = input()\r\nmod = 10**9+7\r\nres, cnt = 0, 0\r\nfor i in range(len(l)-1,-1,-1):\r\n if l[i] == 'b':\r\n cnt = (cnt + 1) % (mod)\r\n else:\r\n res = (res + cnt) % (mod)\r\n cnt = 2*cnt % (mod)\r\nprint(res)", "s = input()\r\nif 'b' not in s:\r\n print(0)\r\nelse:\r\n while s[-1] == 'a':\r\n s = s[:-1]\r\n MOD = 10 ** 9 + 7\r\n preb = 0\r\n cost = 0\r\n for i in range(len(s) - 1, -1, -1):\r\n if s[i] == 'b':\r\n preb += 1\r\n else:\r\n cost += preb\r\n cost %= MOD\r\n preb *= 2\r\n preb %= MOD\r\n print(cost)", "string = input()\nmod = 1000000007\n\nmult, countAtual = 0, 0\nfor i in range(len(string) - 1, -1, -1):\n if string[i] == 'b':\n countAtual += 1\n if string[i] == 'a':\n mult += countAtual\n mult %= mod\n countAtual = countAtual * 2\n countAtual %= mod\n\nprint(mult)\n \t\t\t \t\t \t\t \t\t\t \t\t \t \t \t", "import math\r\ns=input('')\r\ncount=0\r\na=1\r\nfor i in s:\r\n if i=='a':\r\n a=a*2\r\n else:\r\n count=(count+a-1)%1000000007\r\n a=a%1000000007\r\nprint(count)\r\n", "s = input()\nf = 0\nn = 0\np = 1000000007\nfor i in range(len(s)-1,-1,-1):\n if s[i] == \"b\":\n f += 1\n elif s[i]== \"a\":\n n = (n+f) % p\n f = (f*2) % p\nprint(n) \n \t\t \t\t \t \t\t \t \t \t \t\t \t\t", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\n# so the ending sequence is b...ba...a\r\n\r\n# find length of ending sequence\r\n\r\nextra=0\r\nneed=0\r\nfor ch in input().strip():\r\n if ch=='a':\r\n need=(need*2+1)%1000000007\r\n else:\r\n extra=(extra+need)%1000000007\r\n\r\nprint(extra)", "M, a, b=10**9+7, 0, 0\nfor c in reversed(input()):\n\tif c=='b':\n\t\tb+=1\n\telse:\n\t\ta+=b\n\t\tb=(b<<1)%M\nprint(a%M)\n", "mod = 1000000007\nqtdb = 0\njogadas = 0\n\ns = input()\nfor i in range(len(s)-1, -1,-1):\n if(s[i] == 'b'):\n qtdb = (qtdb + 1) % mod\n else:\n jogadas = (jogadas + qtdb) % mod\n qtdb = (2 * qtdb) % mod\nprint(jogadas)\n\t \t\t \t\t\t \t\t \t \t\t\t \t\t\t\t", "a=list(input())\r\nn=len(a)\r\nacount=1\r\nans=0\r\nhell=10**9+7\r\n\r\nfor i in range(n):\r\n\tif(a[i]=='a'):\r\n\t\tacount=(acount*2)%hell\r\n\tif(a[i]=='b'):\r\n\t\tans+=acount-1\r\n\r\nprint(ans%hell)", "N = 10**9+7\ns = input().strip()\nn = 0\nret = 0\nc2n = 2**n-1\nfor c in s:\n if c == 'a':\n n += 1\n c2n = (2*c2n+1)%N\n else:\n ret += c2n\n ret %= N\nprint(ret)\n", "s = input().strip()\r\nl = len(s)\r\nb = 0\r\nop = 0\r\nfor i in range(l - 1, -1, -1):\r\n if s[i] == 'b':\r\n b += 1\r\n elif b > 0:\r\n op += b\r\n b = b * 2 % (pow(10, 9) + 7)\r\nprint(op % (pow(10, 9) + 7))", "MOD = 10 ** 9 + 7\r\ns = input()\r\ns = s[::-1]\r\nans = a = b = 0\r\nfor el in s:\r\n\tif el == 'b':\r\n\t\tb += 1\r\n\telse :\r\n\t\tans += b\r\n\t\tans %= MOD\r\n\t\tb *= 2\r\n\t\tb %= MOD\r\nprint(ans)", "s = input()\nn = len(s)\nmod = 10 ** 9 + 7\nans = 0\nb = 0\nfor i in range(n-1, -1, -1):\n if s[i] == \"b\":\n b += 1\n elif i < n - 1:\n ans = (ans + b) % mod\n b = (2 * b) % mod\nprint(ans % mod)", "s = input()\ncnt = 0\ncur = 1\nans = 0\nfor i in s:\n if i == \"a\":\n cnt = cnt + 1\n cur = (cur * 2) % (10**9 + 7)\n else:\n ans = (ans + cur - 1) % 1000000007\nprint(ans)\n\n\t \t \t\t \t \t \t \t\t \t \t \t", "s = input()\r\na = 0\r\nm = 10 ** 9 + 7\r\nt = 0\r\nfor i in range(len(s)):\r\n if s[~i] == 'a':\r\n a = (a + t) % m\r\n t = (t * 2) % m\r\n else:\r\n t += 1\r\nprint(a)\r\n\r\n", "s = input().strip()\nl = len(s)\nb = 0\nop = 0\nfor i in range(l - 1, -1, -1):\n if s[i] == 'b':\n b += 1\n elif b > 0:\n op += b\n b = b * 2 % (pow(10, 9) + 7)\nprint(op % (pow(10, 9) + 7))\n\t\t\t\t\t \t\t\t \t \t\t \t\t \t\t\t\t\t", "S = input()\r\n\r\nnum = 1\r\nr = 0\r\nfor s in S:\r\n if s == 'a':\r\n num = (num * 2) % 1000000007\r\n else:\r\n r = (r + num -1) % 1000000007\r\n\r\nprint(r)", "s = input()\nqb = 0\nj = 0\n\nmod = int(10e8) + 7\n\nfor i in range(len(s)-1,-1,-1):\n if s[i] == \"b\":\n qb = (qb + 1) % mod \n else:\n j = (j + qb) % mod\n qb = (2 * qb) % mod\n\nprint(j)\n \t\t \t\t \t \t\t\t \t \t\t\t \t\t\t \t\t", "mod = 10**9 + 7\n\nsequence = list(input())\n\nsteps = 0\nanswer = 0\nwhile sequence:\n if 'a' == sequence.pop():\n answer += steps\n steps = (steps * 2) % mod\n else:\n steps += 1\n \nprint(answer % mod)\n \t \t \t \t \t \t \t \t", "n=input()\nmod=1000000007\ncountB, moves = 0,0\n\nfor i in range(len(n)-1,-1,-1):\n if n[i] == 'b':\n countB = (countB+1) % mod\n else:\n moves=(moves+countB) % mod\n countB = (2*countB) % mod\n\nprint(moves)\n \t \t\t\t \t\t\t\t \t\t \t\t \t\t\t", "s = input()\r\nans = 0\r\nt = 0\r\nmod = 10 ** 9 + 7\r\nfor i in s[::-1]:\r\n if i == 'a':\r\n ans = (ans + t) % mod\r\n t = (t * 2) % mod\r\n else:\r\n t += 1\r\nprint(ans)\r\n", "s=input()[::-1]\r\nk=0\r\nr=0\r\nfor i in s:\r\n if i==\"b\":\r\n r+=1\r\n else:\r\n k+=r\r\n r*=2\r\n r%=1000000007\r\nprint(k%1000000007)", "s = input()\r\n\r\nif 'ab' not in s:\r\n print(0)\r\nelse:\r\n mod = 10**9+7\r\n a,b = 0,0\r\n for c in reversed(s):\r\n if c=='b':\r\n b+=1\r\n else:\r\n a+=b\r\n b = (b<<1)%mod\r\n print(a%mod)\r\n # i=0\r\n # while 'ab' in s:\r\n # i+=1\r\n # s.replace('ab','bbc')\r\n # print(s)\r\n # if 'ab' not in s:\r\n # break\r\n\r\n # print(s)\r\n # print(i)", "s = input()\r\ncount = 0\r\ncnt_b = 0\r\nfor i in range(len(s)-1, -1, -1):\r\n if s[i] == 'b':\r\n cnt_b += 1\r\n else:\r\n count += cnt_b\r\n cnt_b *= 2\r\n cnt_b %= (10**9)+7\r\n count %= (10**9)+7\r\nprint(count%((10**9)+7))", "#string = input()\r\n#ans = 0\r\n#while string.count(\"ab\")!=0:\r\n# string=string.replace(\"ab\",\"bba\",1)\r\n# ans+=1\r\n#print(ans)\r\n\r\ns = input()\r\na = 1\r\nans = 0\r\nmod = 1000000007\r\nfor i in s:\r\n if i == 'a':\r\n a *= 2\r\n if a >= mod:\r\n a %= mod\r\n else:\r\n ans += a - 1\r\nprint(ans % mod)\r\n\r\n", "palavra_inicial = list(input())\n\nnum_min = 0\naux = 0\n\nwhile palavra_inicial:\n if palavra_inicial.pop() != 'a':\n aux += 1\n else:\n num_min += aux\n aux = (aux * 2) % 1000000007\n \nprint(num_min % 1000000007)\n\t\t \t\t \t\t \t \t\t \t \t \t \t", "l = input()\nmod = 10**9+7\nres, cnt = 0, 0\nfor i in range(len(l)-1,-1,-1):\n if l[i] == 'b':\n cnt = (cnt + 1) % (mod)\n else:\n res = (res + cnt) % (mod)\n cnt = 2*cnt % (mod)\nprint(res)\n\t \t \t \t\t\t\t\t \t\t \t\t\t\t", "s = input()\r\ncnt = 0\r\nm=10**9 + 7\r\nt = 0\r\n\r\nfor i in range(len(s)):\r\n\tif s[~i] == 'a':\r\n\t\tcnt = (cnt+t)%m\r\n\t\tt = (t*2)%m\r\n\telse:\r\n\t\tt += 1\r\nprint(cnt)\r\n\r\n\"\"\"s = raw_input()\r\nm = 0\r\nn = 0\r\ntwop = 1\r\nans = 0\r\nmold = [0,0]\r\nisbool1 = True\r\nisbool2 = False\r\n\r\ndef twopower(x):\r\n d = {0:1}\r\n if x in d:\r\n return d[x]\r\n else:\r\n if x%2 == 0:\r\n d[x] = twopower(x/2)**2\r\n return d[x]\r\n else:\r\n d[x] = twopower(x-1)*2\r\n return d[x]\r\n\r\nfor char in s:\r\n if char == \"a\":\r\n m += 1\r\n else:\r\n ans += twopower(m)-1\r\n ans = ans%(10**9+7)\r\n\r\nprint ans%(10**9+7)\"\"\"\r\n \r\n\"\"\"\r\nfor char in s:\r\n if char == \"a\":\r\n m += 1\r\n if isbool == True:\r\n twop *= twopower(m-mold[1])\r\n ans += n*(twop-1)\r\n isbool = False\r\n n = 0\r\n else:\r\n mold = [mold[1],m]\r\n n += 1\r\n isbool = True\r\n\r\nif s[-1] == \"a\":\r\n print ans\r\nelse:\r\n twop *= twopower(m-mold[0])\r\n ans += n*(twop-1)\r\n print ans\r\n\"\"\"\r\n", "mod = 1000000007\nbs = 0\nr = 0\n\nentrada = input()\nfor i in range(len(entrada) - 1, -1, -1):\n if entrada[i] == 'b':\n bs = (bs + 1) % mod\n else:\n r = (r + bs) % mod\n bs = ( 2 * bs) % mod\n\nprint(r)\n\n \t \t \t\t\t\t \t\t\t\t \t \t\t\t \t", "string=input()\r\nmod=1000000007\r\ncount=0\r\nb=0\r\nfor i in string[::-1]:\r\n if(i=='a'):\r\n count=(count+b)%mod\r\n b=(2*b)%mod\r\n else:\r\n b=(b+1)%mod\r\nprint(count)", "#author: ankan2526\r\n\r\nimport math, bisect, heapq\r\n\r\ns=input()\r\ncount=0\r\np=10**9+7\r\na=0\r\nfor i in s:\r\n if i=='a':\r\n a+=1\r\n else:\r\n count=(count+pow(2,a,p)-1)%p\r\nprint(count)\r\n", "s = input()\r\ns = s[::-1]\r\na = 0\r\nb = 0\r\nM = 10 ** 9 + 7\r\nfor i in s:\r\n if i == 'b': b -= -1\r\n else:\r\n a += b\r\n b = (b * 2) % M\r\nprint(a % M)", "s=list(input())\r\nn=len(s)\r\ncb=0\r\nans=0\r\nmod=1000000007\r\nfor i in range(n-1 , -1 , -1):\r\n if s[i] == 'b':\r\n cb+=1\r\n cb%=mod\r\n else:\r\n ans+=cb\r\n cb*=2\r\n ans%=mod\r\nprint(ans)", "# 02-11\r\n\r\nMOD = 10**9+7\r\nans = 0\r\ncnt = 0\r\nS = input()\r\nN = len(S)\r\n\r\nfor i in range(N-1,-1,-1):\r\n\tif S[i]=='a':\r\n\t\tans = (ans+cnt)%MOD\r\n\t\tcnt = (cnt+cnt)%MOD\r\n\telse:\r\n\t\tcnt = (cnt+1)%MOD\r\n\r\nprint(ans)\r\n", "def pow (a,b): \n result = 1\n while b > 0:\n if b % 2 == 1:\n result = (result * a) % mod\n \n b = b // 2\n a = (a * a) % mod\n\n return result\n\n\nmod = 1000000007\n\nstring = input()\n\na = 0\nb = 0 \ni = 0\nans = 0\n\ntam = len(string)\nwhile i < tam:\n while i < tam and string[i] == 'a':\n a+=1\n b = 0\n i+=1\n while i < tam and string[i] == 'b':\n \n b+=1 \n i+=1\n \n ans += ((pow(2,a)-1)%mod * (b)%mod)%mod\n \nprint(ans%mod)\n\n \t \t \t \t\t\t \t \t\t \t\t\t\t \t", "entrada = input()\n\nmod = (10**9+7)\ncont = 0\nbs = 0\n\nfor letra in entrada[::-1]:\n if letra == 'b':\n bs = (bs+1) % mod\n else:\n cont = (cont + bs) % mod\n bs = (2*bs) % mod\nprint(cont)\n \t \t\t \t\t \t\t\t \t \t\t \t \t\t\t\t \t", "mod = 1000000007; b,ans = 0,0\r\nfor x in reversed(input()):\r\n if x == 'a': \r\n ans = (ans + b)%mod; \r\n b = (2*b)%mod\r\n else: b = (b+1%mod)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = 1000000007\r\nq = [2]\r\nfor i in range(30):\r\n x = q[-1]**2 % M\r\n q.append(x)\r\n\r\ndef f(n):\r\n x = bin(n)[2:][::-1]\r\n c = 1\r\n for i in range(len(x)):\r\n if x[i] == '1':\r\n c *= q[i]\r\n c %= M\r\n return c\r\n\r\ns = input()[:-1].lstrip('b')\r\nif len(s) == 0:\r\n print(0)\r\n exit(0)\r\n\r\nc = 0\r\nd = 0\r\nfor i in s:\r\n if i == 'a':\r\n d += 1\r\n else:\r\n c += f(d)-1\r\n c %= M\r\n\r\nprint(c)", "s = input()\r\ncnt = 0; ans =0; mod = 1000000007\r\nfor c in s:\r\n if c == 'a' : cnt+=1\r\n else :\r\n ans += pow(2,cnt,mod)-1\r\n ans%=mod\r\nprint(ans)", "b_cnt, res = 0, 0\nmod = 10 ** 9 + 7\nfor c in input()[::-1]:\n\tif c == 'b':\n\t\tb_cnt += 1\n\telse:\n\t\tres += b_cnt\n\t\tb_cnt *= 2\n\t\tres %= mod\n\t\tb_cnt %= mod\nprint(res)", "mod = 1000000007\r\nbs = 0\r\nr = 0\r\n\r\nentrada = input()\r\nfor i in range(len(entrada) - 1, -1, -1):\r\n if entrada[i] == 'b':\r\n bs = (bs + 1) % mod\r\n else:\r\n r = (r + bs) % mod\r\n bs = ( 2 * bs) % mod\r\n\r\nprint(r)\r\n", "s = input()\nmod = 10 ** 9 + 7\n\ns = s[::-1]\n\nans = 0\nbs = 0\nfor x in s[s.index('b'):]:\n if x == 'b':\n bs += 1\n else:\n ans += bs\n ans %= mod\n bs = 2 * bs % mod\nprint(ans)\n", "from collections import deque\n\nsequencia = list(input())\nusoA = deque([0])\nusoB = deque()\nprimeiroA = len(sequencia)\ncontadorA = 0\ncontadorB = 0\nmodulo = 10**9+7\nfor a in range(len(sequencia)-1,-1,-1):\n \n if sequencia[a] == \"b\":\n contadorB = (contadorB+1)%modulo\n else:\n contadorA = (contadorA+contadorB) % modulo\n contadorB = (contadorB*2)%modulo\nprint(contadorA)\n\t\t \t\t \t\t \t\t \t \t \t\t \t \t \t\t", "s=input()\r\nl=list()\r\ncur=0\r\nfor i in range(len(s)):\r\n if s[i]=='a':\r\n cur+=1\r\n else:\r\n l.append(cur)\r\n\r\nmo=10**9+7\r\n\r\ncur=0\r\nexp=1\r\nres=0\r\nfor i in range(len(l)):\r\n while l[i]>cur:\r\n cur+=1\r\n exp=exp*2%mo\r\n res=(res+exp-1)%mo\r\n \r\n \r\n \r\nprint(res)", "string = input()\n\nn = len(string)\n\nmod = 1000000007\nb = 0\nop = 0\n\nfor i in range(n -1, -1, -1):\n\tif string[i] == 'b': b = (b + 1) % mod\n\telse:\n\t\top = (op + b) % mod\n\t\tb = (2 * b) % mod\n\nprint(op)\n\n\t \t \t\t \t\t\t \t\t\t", "import sys\r\nfrom sys import stdin\r\n\r\nmod = 10**9+7\r\ndef stk_push(c,num):\r\n\r\n if stk and stk[-1][0] == c:\r\n stk[-1][1] += num\r\n else:\r\n stk.append( [c,num] )\r\n\r\nstk = []\r\n\r\ns = stdin.readline()[:-1]\r\nans = 0\r\n\r\nfor c in s:\r\n\r\n stk_push(c,1)\r\n\r\n if len(stk) >= 2 and stk[-1][0] == \"b\":\r\n\r\n lastB = stk[-1] ; del stk[-1]\r\n lastA = stk[-1] ; del stk[-1]\r\n\r\n now = lastB[1] * ( pow(2,lastA[1],mod)-1 )\r\n ans += now\r\n ans %= mod\r\n\r\n stk_push( \"b\" , pow(2,lastA[1],mod) )\r\n stk_push( \"a\" , lastA[1])\r\n\r\nprint (ans % mod)\r\n", "letters = input()\r\nqtb = 0\r\nresult = 0\r\n\r\nfor i in range(len(letters) - 1, -1, -1):\r\n if letters[i] == 'b':\r\n qtb = (qtb + 1) % ((10**9) + 7)\r\n else:\r\n result = (result + qtb) % ((10**9) + 7)\r\n qtb = (2 * qtb) % ((10**9) + 7)\r\n\r\nprint(result)\r\n", "\r\ns = input()\r\nans, temp = 0, 0\r\nmod = (10**9 + 7)\r\n\r\nfor i in range(len(s) - 1, - 1, -1):\r\n if (s[i] == \"b\"):\r\n temp += 1\r\n else:\r\n ans = (temp + ans) % mod\r\n temp = (temp + temp) % mod\r\n \r\nprint(ans)\r\n ", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\np = 10**9+7\r\n\r\ndef process(S):\r\n n = len(S)\r\n b_count = 0\r\n answer = 0\r\n for i in range(n-1, -1, -1):\r\n if S[i]=='b':\r\n b_count+=1\r\n else:\r\n answer = (answer+b_count) % p\r\n b_count = (2*b_count) % p\r\n return answer\r\n\r\nS = input().decode()[:-2]\r\nprint(process(S))", "mod = 1000000007\n\nstring = input()\nqntb = 0\nsteps = 0\n\nfor i in range(len(string)-1, -1, -1):\n if string[i] == \"b\":\n qntb = (qntb + 1) % mod\n else:\n steps = (steps + qntb) % mod\n qntb = (2 * qntb) % mod\nprint(steps)\n \t\t\t \t\t \t \t \t \t\t \t\t\t \t \t\t \t\t", "import math\r\nl = input()\r\nb_count = 0\r\nc = 0\r\nconst = (math.pow(10, 9)+7)\r\nfor i in range(len(l)-1, -1, -1):\r\n if l[i] == \"b\":\r\n b_count += 1\r\n else:\r\n c = (c+b_count)%const\r\n b_count = (b_count * 2)% const\r\nprint(int(c%const))", "M, a, b = 10**9+7, 0, 0\r\nfor c in reversed(input()):\r\n\tif c == 'b':\r\n\t\tb += 1\r\n\telse:\r\n\t\ta += b\r\n\t\tb = (b<<1) % M\r\nprint(a % M)\r\n", "a=input()\r\nmod=10**9+7\r\ncount_a=0\r\nans=0\r\nfor i in a:\r\n if i=='a':\r\n count_a+=1\r\n else:\r\n ans+=(pow(2,count_a,mod)-1)%mod\r\nprint(ans%mod)", "s = input()\r\nl,r,p,m=0,0,1,10**9+7\r\nfor i in s:\r\n if i=='a':\r\n l += 1\r\n p = p*2%m\r\n else: r = (r + p - 1)%m\r\nprint(r)", "s = input()\r\nsuma = 0\r\ncnt = 0\r\nfor i in s[::-1]:\r\n if i == 'b':\r\n cnt += 1\r\n if i == 'a':\r\n suma += cnt\r\n cnt = (cnt * 2) % 1000000007\r\n \r\nprint(suma % 1000000007)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nmod = 10**9 + 7\r\n\r\n\r\ndef main():\r\n s = input().strip()\r\n\r\n cb = 0\r\n ans = 0\r\n for c in reversed(s):\r\n if c == \"a\":\r\n ans = (ans + cb) % mod\r\n cb = (cb + cb) % mod\r\n\r\n else:\r\n cb = (cb + 1) % mod\r\n\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "s = input()\ncnt = 0\nm=10**9 + 7\nt = 0\n\nfor i in range(len(s)):\n\tif s[~i] == 'a':\n\t\tcnt = (cnt+t)%m\n\t\tt = (t*2)%m\n\telse:\n\t\tt += 1\nprint(cnt)", "s=input()[::-1]\r\nans=0\r\nr=0\r\nfor i in s:\r\n if i==\"b\":\r\n r+=1\r\n else:\r\n ans+=r\r\n r*=2\r\n r%=1000000007\r\nprint(ans%1000000007)", "# Thank God that I'm not you.\r\n\r\nimport bisect\r\nfrom collections import Counter, deque\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom types import GeneratorType;\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n \r\n return wrappedfunc \r\n\r\ndef primeFactors(n):\r\n \r\n counter = Counter(); \r\n while n % 2 == 0:\r\n counter[2] += 1;\r\n n = n / 2\r\n \r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n while n % i== 0:\r\n counter[i] += 1;\r\n n = n / i\r\n \r\n if (n > 2):\r\n counter[n] += 1;\r\n \r\n return counter;\r\n\r\n\r\n\r\n\r\nmod = (10**9 + 7)\r\n\r\n\r\nstring = input().rstrip()\r\n\r\n\r\n\r\ncnt = 0\r\n\r\ncount = 0;\r\nfor char in string:\r\n if char == \"b\":\r\n count += (pow(2, cnt, mod) - 1)\r\n count %= mod;\r\n else:\r\n cnt += 1 \r\n\r\nprint(count % mod)\r\n \r\n\r\n", "from collections import deque\n\nseq = list(input())\nusoA = deque([0])\nusoB = deque()\nfirstA = len(seq)\ncountA = 0\ncountB = 0\nmodu = 10**9+7\n\nfor a in range(len(seq) -1,-1,-1):\n if seq[a] == 'b':\n countB = (countB+1)%modu\n else:\n countA = (countA+countB) % modu\n countB = (countB*2) % modu\n\nprint(countA)\n \t \t\t\t\t \t\t\t\t\t\t \t\t \t\t \t\t \t \t", "s=input()\r\nc=0\r\nm=10**9+7\r\nka=0\r\nfor i in s:\r\n if(i=='b'):\r\n ka=(ka+c)%m\r\n else:\r\n c=(c*2+1)%m\r\nprint(ka)\r\n", "s = input()\na = 1\nans = 0\nmod = 1000000007\nfor i in s:\n if i == 'a':\n a *= 2\n if a >= mod:\n a %= mod\n else:\n ans += a - 1\nprint(ans % mod)\n \t\t\t\t\t\t \t\t \t \t\t \t \t\t\t", "'''\nFuad Ashraful Mehmet\nUniversity of Asia Pacific\nDate:09th March 2020\n'''\nmod=10**9+7\n\ndef Solve(s):\n ans=b=0\n for c in s[::-1]:\n if c =='a':\n ans+=b\n b=b*2%mod\n else:\n b+=1\n print(ans%mod)\n\nif __name__=='__main__':\n Solve(input())\n", "s = input()\r\nl = 0;r = 0;p = 1;m=1000000007;\r\nfor i in range(len(s)):\r\n if s[i]=='a':\r\n l += 1\r\n p = p*2%m\r\n else: r = (r + p - 1)%m\r\nprint(r%m)\r\n", "S = input()[::-1]\r\n \r\nnum = 0\r\nr = 0\r\nfor s in S:\r\n if s == 'a':\r\n r = (r + num) % 1000000007\r\n num = (num * 2) % 1000000007\r\n else:\r\n num = num + 1\r\nprint(r)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/804/B\r\n\r\nMOD = 1e9 + 7\r\ns = input()\r\n\r\nans = 0\r\nb = 0\r\nfor c in s[::-1]:\r\n if c == 'a':\r\n ans = (ans + b) % MOD\r\n b = (2 * b) % MOD\r\n else:\r\n b = (b + 1) % MOD\r\n\r\nprint(int(ans))", "MOD = 10 ** 9 + 7\r\n\r\ns = input().rstrip()\r\n\r\nn = len(s)\r\nways = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n ways[i] = (ways[i - 1] + pow(2, i - 1, MOD)) % MOD\r\nret = 0\r\nna = 0\r\nfor i, ch in enumerate(s):\r\n if ch == 'a':\r\n na += 1\r\n else:\r\n ret += ways[na]\r\n ret %= MOD\r\nprint(ret)", "import math\r\nimport sys\r\nx=sys.stdin.readline()\r\nans=0\r\nb=0\r\nn=len(x)\r\nfor i in range(n-1,-1,-1):\r\n if(x[i]=='b'):\r\n b=b+1\r\n if(x[i]=='a'):\r\n ans=(ans+b)%1000000007\r\n b=(b*2)%1000000007\r\nprint(ans) ", "import sys\r\nfin = sys.stdin\r\ns = fin.readline()\r\ns = s[:-1]\r\nnra = 0\r\nr = 0\r\npw = []\r\nelpw = 1\r\nfor i in range(0, len(s)):\r\n pw.append(elpw)\r\n elpw = elpw * 2 % 1000000007\r\nfor ch in s:\r\n if ch == 'a':\r\n nra += 1\r\n else:\r\n r += pw[nra] - 1\r\n if r >= 1000000007:\r\n r -= 1000000007\r\nprint(r)\r\n", "entrada = input()\nentrada = entrada[::-1]\nmodulo = int((10**9)+7)\naux = 0\nstep = 0\n\nfor i in range(len(entrada)):\n if entrada[i] == 'b':\n aux = int((aux + 1) % modulo)\n else:\n step = (step + aux) % modulo\n aux = (2 * aux) % modulo\n\nprint(step)\n\n\n \t\t\t \t \t \t\t\t \t\t \t\t \t\t \t\t\t", "x = input()\r\ndef power(x, y, p) : \r\n res = 1 # Initialize result \r\n \r\n # Update x if it is more \r\n # than or equal to p \r\n x = x % p \r\n \r\n if (x == 0) : \r\n return 0\r\n \r\n while (y > 0) : \r\n \r\n # If y is odd, multiply \r\n # x with result \r\n if ((y & 1) == 1) : \r\n res = (res * x) % p \r\n \r\n # y must be even now \r\n y = y >> 1 # y = y/2 \r\n x = (x * x) % p \r\n \r\n return res \r\n \r\nMOD = 10**9 + 7 \r\ncount = 0\r\nans = 0\r\nfor ch in x:\r\n if ch == 'a':\r\n count += 1\r\n else:\r\n ans = (ans + power(2,count,MOD) - 1)%MOD\r\nprint(ans)\r\n", "s = input()\r\n\r\ncnt = 0\r\nans = 0\r\nmod = 1000000007 \r\n\r\nfor i in reversed(range(len(s))):\r\n\tif(s[i] == 'a'):\r\n\t\tans = (ans + cnt) % mod\r\n\t\tcnt = (cnt * 2) % mod\r\n\telse:\r\n\t\tcnt += 1\r\n\r\nprint(ans)", "ab = input()\n \nvalue = 1\ncount = 0\nmod = (10 ** 9) + 7\nfor e in ab:\n if e == 'b':\n count = (value + count - 1) % mod\n else:\n value = (value * 2) % mod\n\nprint(count)\n\t \t \t\t\t\t\t \t \t \t\t\t\t\t \t \t\t", "s=input()\r\nc=0\r\nt=0\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i]=='a':\r\n t=(t+c)%(10**9+7)\r\n c=(c*2)%(10**9+7)\r\n else:\r\n c=c+1\r\n \r\nprint(t%(10**9+7))", "mod = 1000000007\nb = 0\nj = 0\nstring = input()\nfor c in range(len(string) - 1, -1, -1):\n if(string[c] == 'b'):\n b = (b + 1) % mod\n\n else:\n j = (j + b)%mod\n b = (2 * b) % mod \nprint(j)\n\t\t \t \t\t\t \t \t\t\t \t\t \t\t", "\"\"\" Prositka\r\n18.10.2022\"\"\"\r\n\r\na,s,m=0,0,int(1e9+7)\r\nfor i in input()[::-1]:\r\n if i=='a': a=(a+s)%m;s=(s*2)%m\r\n else: s+=1\r\nprint(a)", "M = 1000000007\nop = 0\nqt_b = 0\n\nfor l in reversed(str(input())):\n if l == \"b\":\n qt_b = (qt_b + 1) % M\n else:\n op = (op + qt_b) % M\n qt_b = (2* qt_b) % M\nprint(op)\n \t \t\t \t\t\t\t\t \t\t \t\t \t\t \t \t\t\t \t", "s = input()\n\nl = len(s)\n\nbCount=0\nprevCost=0\ntotalCost=0\nfor i in range(l)[::-1]:\n if s[i]=='b':\n bCount+=1\n else:\n cost = bCount + 2*prevCost\n prevCost = cost%1000000007\n bCount = 0\n totalCost = (totalCost+cost)%1000000007\n\nprint(totalCost)\n", "#t2\ns = input()\nsoma = 0\nt = 0\n\nfor i in range(len(s)):\n if s[~i] == 'a':\n soma = (soma + t) % (10**9 + 7)\n t = (t * 2) % (10**9 + 7)\n else:\n t += 1\n\nprint(soma)\n\n \t \t \t\t\t\t \t\t\t \t\t \t", "s = input()\r\nb = 0\r\npassos = 0\r\nmod = 1000000007\r\n\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == 'a':\r\n passos = (b%mod + passos%mod)%mod\r\n b = (b%mod * 2) % mod\r\n passos %= mod\r\n b %= mod \r\n else:\r\n b += 1\r\n \r\nprint(passos)", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nMOD = 1000000007\r\n\r\ns = S()[::-1]\r\n\r\nfoundA = []\r\ncountB = 0\r\nfor c in s:\r\n if c==\"b\":\r\n countB += 1\r\n else:\r\n foundA.append(countB)\r\n countB = (countB*2) % MOD\r\n\r\nprint(sum(foundA) % MOD)" ]

[ "def dsum(n):\r\n m = 0\r\n while n>0:\r\n m += n%10\r\n n //= 10\r\n return m\r\n\r\ndef bs(s,n):\r\n l,r=0,int(1e9)\r\n while l<=r:\r\n m = (l+r)//2\r\n nn = m*(m+s)\r\n if nn==n: return m\r\n if nn>n: r = m-1\r\n if nn<n: l = m+1\r\n return -1\r\n\r\ndef solv(n):\r\n for s in range(82):\r\n x = bs(s,n)\r\n if x>0 and dsum(x)==s:\r\n return x\r\n return -1\r\n\r\nn = int(input())\r\nprint(solv(n))\r\n", "n = int(input())\r\nflag = 0\r\nfor i in range(1,82):\r\n\ta = (-i + ((i*i + 4*n)**0.5))/2\r\n\tb = (-i - ((i*i + 4*n)**0.5))/2\r\n\t#print(a,b)\r\n\tif(a>0 and int(a) == a):\r\n\t\ta = int(a)\r\n\t\tsumi = sum([int(i) for i in str(a)])\r\n\t\tif(sumi == i and a**2 + sumi*a-n == 0):\r\n\t\t\tflag = 1\r\n\t\t\tprint(a)\r\n\t\t\tbreak\r\n\telif(b>0 and int(b) == b):\r\n\t\tb = int(b)\r\n\t\tsumi = sum([int(i) for i in str(b)])\r\n\t\tif(sumi == i and b**2 + sumi*b-n == 0):\r\n\t\t\tflag = 1\r\n\t\t\tprint(b)\r\n\t\t\tbreak\r\n\r\nif(flag == 0):\r\n\tprint(-1)\r\n\r\n\r\n", "n=int(input())\r\nm=int(n**0.5)\r\ndef S(s): \r\n c=0\r\n for i in s: \r\n c+=int(i)\r\n return c\r\n\r\nfor i in range(max(0,m-10**3),m+10**3): \r\n s=list(str(i))\r\n x=i**2+S(s)*i-n\r\n if x==0:print(i);exit()\r\nprint(-1)", "#every integer is congruent to its sum of digits mod 9\r\nimport math\r\ndef Root(s,n):\r\n x=(-s+int(math.sqrt(s**2+4*n)))/2\r\n return x\r\n \r\n\r\ndef isPerfectSquare(n):\r\n k=int(math.sqrt(n))\r\n if n==k**2:\r\n return True\r\n return False\r\n\r\nn=int(input())\r\nfor i in range(91):\r\n if isPerfectSquare(4*n+i**2):\r\n x=Root(i,n)\r\n if x==int(x):\r\n if x%9==i%9:\r\n print(int(x))\r\n break\r\nelse:\r\n print(-1)", "import math\r\n\r\ndef som(n):\r\n sum = 0\r\n while n:\r\n sum += n % 10\r\n n //= 10\r\n return sum\r\n\r\nn = int(input())\r\ncnt = 0\r\nx = int(math.sqrt(n))\r\nwhile x * x + 90 * x >= n:\r\n if x * x + som(x) * x == n:\r\n print(x)\r\n exit(0)\r\n x -= 1\r\nprint(-1)\r\n\r\n\r\n\r\n\r\n ", "n = int(input())\r\nm=int(n**(1/2))\r\nfor i in range(max(0, m-10**3), m+10**3):\r\n\tif i*i + sum(list(map(int,str(i))))*i == n:\r\n\t\tprint(i)\r\n\t\tbreak\r\nelse: print(-1)", "from functools import reduce\nfrom math import sqrt\nimport sys\ndef I(): return [*map(int, sys.stdin.readline().split())]\n\n\nn = I()[0]\n\nfor i in range(max(int(sqrt(n))-90, 0), int(sqrt(n)+2)):\n s = reduce(lambda a, b: a + int(b), str(i), 0)\n if i * (i + s) == n:\n print(i)\n break\nelse:\n print(-1)\n", "n = int(input())\r\nb = n\r\nn**=(0.5)\r\nn+=1\r\nn = int(n)\r\nfor i in range(1000):\r\n s = str(n)\r\n sm = 0\r\n for l in s:\r\n sm+=int(l)\r\n if n*n+sm*n==b:\r\n print(n)\r\n break\r\n n-=1\r\n if n==0:\r\n print(-1)\r\n break\r\nelse:\r\n print(-1)", "n=int(input())\r\nm=int(n**(1/2))\r\nfor i in range(max(0,m-10**3),m+10**3):\r\n if i*i+sum(list(map(int,str(i))))*i==n:\r\n print(i)\r\n exit()\r\nprint(-1)", "# LUOGU_RID: 127136645\nn=int(input())\nfor i in range(max(int(n**0.5-81),1),int(n**0.5+1)):\n if i*(i+sum(map(int,list(str(i)))))==n:\n print(i)\n exit()\nprint(-1)\n\n# 代码解释\n\n# n**0.5 为根号n，float类型\n# str(i)可以将i转换为字符串类型\n# list(s)可以将字符串s转换为列表类型，每个字符为一个元素\n# map(int,l)可以将l中的元素都执行一遍int()函数，将每个字符转为整数类型\n# sum(l)可以将l中的元素求和\n# exit()可以直接结束程序", "n=int(input())\r\nfor i in range(max(int(n**0.5-81),1),int(n**0.5+1)):\r\n if i*(i+sum(map(int,list(str(i)))))==n:\r\n print(i)\r\n exit()\r\nprint(-1)", "def f(x):\r\n return sum(map(int,str(x)))\r\nn=int(input())\r\nz=int(n**0.5)\r\nfor x in range(max(1,z-400),z+400):\r\n if x*x+x*f(x)==n:\r\n print(x)\r\n exit()\r\nprint(-1)\r\n \r\n", "from math import *\r\ndef digit_sum(n):\r\n\tsum1 = 0\r\n\twhile n :\r\n\t\tsum1 += n%10\r\n\t\tn//=10\r\n\treturn sum1\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tx = int(n**0.5)\r\n\tfor i in range(max(0,x-10**2),x+10**2):\r\n\t\tif i*i + digit_sum(i)*i == n:\r\n\t\t\tprint(i)\r\n\t\t\texit()\r\n\tprint(-1)", "n=int(input())\r\n# n,t=map(int,input().split())\r\n# s=(input())\r\n\r\n# s,t=input().split()\r\n# arr=list(map(int,input().split()))\r\n\r\n# for _ in range(int(input())):\r\n# n=int(input())\r\nm=n**(0.5)\r\nfor i in range(max(0,int(m)-10**3),int(m)+10**3):\r\n if i*i+sum(list(map(int,str(i))))*i==n:\r\n print(i);exit()\r\nprint(-1)", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef getSofX(x):\r\n digitSum = 0\r\n while x > 0:\r\n digitSum += (x%10)\r\n x = int(x/10)\r\n \r\n return digitSum\r\n\r\ndef main():\r\n # Write Your Code Here\r\n n = int(input())\r\n rootn = math.ceil(math.sqrt(n))\r\n start = rootn\r\n while start >= max(0, rootn-100): # s(10^9) == 90 so (val-100)\r\n x = start\r\n sx = getSofX(x)\r\n eqn = ((x*x)+(sx*x)-n)\r\n if eqn == 0:\r\n print(start)\r\n return\r\n start -= 1\r\n \r\n print(-1)\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\nn = (int)(input())\r\nfor _ in range(100) :\r\n a , b , c = [1 , _ , -n]\r\n D = b ** 2 - 4 * a * c\r\n if D < 0 : continue\r\n root1 = (int)((-b + math.sqrt(D)) / (2 * a))\r\n root2 = (int)((-b - math.sqrt(D)) / (2 * a))\r\n def is_root(root) : return a * root * root + b * root + c == 0 \r\n def dig_sum(n) : return sum([(int)(d) for d in (str)(n)]) \r\n posibilities = [root1 , root1 + 1 , root1 - 1 , root2 , root2 - 1 , root2 + 1]\r\n for root in posibilities :\r\n if is_root(root) and root > 0 and dig_sum(root) == _ : \r\n print(root)\r\n quit()\r\nprint(-1)", "import sys\r\ninput = lambda: sys.stdin.buffer.readline().strip().decode()\r\n\r\ndef roots(a,b,c):\r\n thing=(b**2-4*a*c)**0.5\r\n val1=-b+thing\r\n val2=-b-thing\r\n return val1/(2*a),val2/(2*a)\r\ndef equation(x,sumx):\r\n return x**2+sumx*x\r\nn=int(input())\r\nminval=-1\r\nfor i in range(1,90):\r\n a,b = roots(1,i,-n)\r\n # print(i,a,b)\r\n if a%1==0 and a>0:\r\n a=int(a)\r\n sumx=sum([int(c) for c in str(a)])\r\n if sumx==i and equation(a,sumx)==n:\r\n if minval==-1 or a<minval:\r\n minval=a\r\n if b%1==0 and b>0:\r\n b=int(b)\r\n sumx=sum([int(c) for c in str(b)])\r\n if sumx==i and equation(b,sumx)==n:\r\n if minval==-1 or b<minval:\r\n minval=b\r\nprint(minval)", "# smax less than like 90 91\r\n# x2 + s(x)·x - n = 0\r\nfrom math import sqrt\r\n\r\n\r\ndef sm(x):\r\n s = str(x)\r\n return sum(int(n) for n in s)\r\nn = int(input())\r\nx=int(sqrt(n))+1\r\nfor _ in range(min(100, x)):\r\n if x*(x+sm(x)) == n:\r\n print(x)\r\n exit()\r\n x-=1\r\nprint(-1)", "n =int(input())\r\ndef getSum(n):\r\n \r\n \r\n s=[int(x) for x in str(n)]\r\n sum1=sum(s)\r\n \r\n return sum1\r\n\r\nx=int(n**(1/2))\r\n# print(x)\r\n\r\nwhile(x*x +90*x>=n):\r\n\tif x*x +getSum(x)*x==n:\r\n\t\tprint(x)\r\n\t\texit()\r\n\tx-=1\r\nprint(-1)\r\n\r\n\r\n\t\t", "\r\n# # ===================STUDY CONCEPTS=================================== # #\r\n# depth study of prefix sum and suffix sum\r\n# any function\r\n# all function\r\n# Disjoint Set Union\r\n# itertools - permutations accumulate\r\n# # ===================STUDY CONCEPTS=================================== # #\r\n\r\n\r\n\r\n\r\n\r\n# --TIPS--------------------------------------\r\n# # -----------------TIP1---------------|\r\n# # IF YOU WANT TO GET SOME VALUE INSIDE IN A BUILT IN FUNCTION THEN YOU MUST BREAK IT\r\n# # IF YOU ARE GETTING INTUITION ABOUT IT THEN GO FOR IT\r\n# # -----------------TIP2---------------|\r\n# # SORTING IS DONE BY BOTH VALUE IF WE ARE TALKIN ABOUT LIST OF PAIR\r\n# # SO FOR ACHEIVING SLICELY SORT ELEMENTS WITH FIRST VALUE SAME THEN WE CAN USE CONCEPT OF [-A,B] OR [-B,A]\r\n# # l.append([-a,b])\r\n# # l.sort()\r\n# #------------------TIP3---------------|\r\n# # THINK FIRST OF ALL BRUTE FORCE APPROACH \r\n# # YOU MUST THINK WHEN THE CONSTRAINTS ARE SMALL\r\n# #------------------TIP4---------------|\r\n# Python3 program to show segment tree operations like\r\n# construction, query and update\r\n# #------------------TIP5---------------|\r\n# For suffix related problem iterate from last if you are not getting any solution to solve.\r\n# vice versa for prefix\r\n# #------------------TIP6---------------|\r\n#===================Sorting pair of integers for second element with same value comparable,==============\r\n# arr=sorted(arr,key=lambda x: (-x[1], -x[0]))\r\n#===================inorder iterative==============\r\n # def helper(curr):\r\n # stack=[]\r\n # ans=[]\r\n # while stack or curr:\r\n # while curr:\r\n # stack.append(curr)\r\n # curr=curr.left\r\n # curr=stack.pop()\r\n # ans.append(curr.val)\r\n # curr=curr.right\r\n # return ans\r\n#===================preorder iterative==============\r\n # def helper(curr):\r\n # stack=[curr]\r\n # ans=[]\r\n # while stack :\r\n # curr=stack.pop()\r\n # ans.append(curr.val)\r\n # if curr.right:\r\n # stack.append(curr.right)\r\n # if curr.left:\r\n # stack.append(curr.left)\r\n # return ans\r\n#===================postorder iterative==============\r\n\r\n # def helper(curr):\r\n # stack=[curr]\r\n # ans=[]\r\n # while stack:\r\n # curr=stack[-1]\r\n # if (not curr.right and not curr.left):\r\n # stack.pop()\r\n # ans.append(curr.val)\r\n # if curr.right:\r\n # stack.append(curr.right)\r\n # curr.right=None\r\n # if curr.left:\r\n # stack.append(curr.left)\r\n # curr.left=None\r\n # return ans\r\n\r\n\r\n\r\n\r\n# import math\r\n# from segment_tree import SegmentTree\r\n# from math import gcd,sqrt\r\n# from collections import Counter\r\n# import heapq\r\n# import itertools\r\n\r\n\r\nclass Segment:\r\n\r\n def __init__(self, nums):\r\n self.data = [0 for _ in nums] + nums\r\n self.n = len(nums)\r\n \r\n for idx in reversed(range(1, self.n)):\r\n self.data[idx] = self.data[2*idx] + self.data[2*idx + 1]\r\n \r\n def update(self, i: int, val: int) -> None:\r\n idx = i + self.n\r\n self.data[idx] = val\r\n while idx > 1:\r\n idx //= 2\r\n self.data[idx] = self.data[2*idx] + self.data[2*idx + 1]\r\n \r\n\r\n def sumRange(self, i: int, j: int) -> int:\r\n #sum [i,j] = sum [i, j)\r\n left = i + self.n\r\n right = j + self.n +1\r\n sum_range = 0\r\n while left < right:\r\n if left%2:\r\n sum_range += self.data[left]\r\n left +=1\r\n if right %2:\r\n right -= 1\r\n sum_range += self.data[right]\r\n left //= 2\r\n right //= 2\r\n \r\n return sum_range\r\n \r\ndef prefix(arr):\r\n pref=[arr[0]]\r\n psum=arr[0]\r\n for i in range(1,n):\r\n psum+=arr[i]\r\n pref.append(psum)\r\n return pref\r\n\r\ndef mapp(arr):\r\n mp={}\r\n for i in arr:\r\n if i in mp:\r\n mp[i]+=1\r\n else:\r\n mp[i]=1\r\n return mp\r\n\r\ndef suffix(arr):\r\n suff=[arr[-1]]\r\n sum=suff[0]\r\n for i in range(n-2,-1,-1):\r\n sum+=arr[i]\r\n suff.append(sum)\r\n return suff[::-1]\r\n\r\ndef check_prime(n):\r\n # optimised \r\n prime_flag = 0\r\n if(n > 1):\r\n for i in range(2, int(n**(0.5)) + 1):\r\n if (n % i == 0):\r\n prime_flag = 1\r\n break\r\n if (prime_flag == 0):\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\n\r\ndef primefactors(n):\r\n factors = set()\r\n while (n % 2 == 0):\r\n factors.add(2)\r\n n //= 2\r\n for i in range(3, int(sqrt(n)) + 1, 2): # only odd factors left\r\n while n % i == 0:\r\n factors.add(i)\r\n n //= i\r\n if n > 2: # incase of prime\r\n factors.add(n)\r\n return factors\r\n\r\ndef factors(n):\r\n arr=[1]\r\n for i in range(2,int(n**(0.5))+1):\r\n if n%i==0:\r\n div=n//i\r\n if i!=div:\r\n arr.extend([i,div])\r\n else:\r\n arr.append(i)\r\n return arr\r\ndef binary(a,val,n):\r\n s=0\r\n end=n-1\r\n while s<=end:\r\n mid=s+(end-s)//2\r\n if val==a[mid]:\r\n return mid\r\n elif a[mid]<val:\r\n s=mid+1\r\n else:\r\n end=mid-1\r\n return -1\r\n\r\ndef fixedSliding(arr):\r\n # return minimum sum\r\n i=0\r\n j=0\r\n sum1=0\r\n mn=10000000000\r\n while j<n:\r\n sum1+=arr[j]\r\n if j-i+1<k:\r\n j+=1\r\n elif j-i+1==k:\r\n if mn>sum1:\r\n a=i\r\n mn=sum1\r\n sum1-=arr[i]\r\n i+=1\r\n j+=1\r\n return mn\r\n\r\ndef binaryToDecimal(n,l):\r\n dec_value = 0\r\n base1 = 1\r\n for i in range(l - 1, -1, -1):\r\n if (n[i] == '1'): \r\n dec_value += base1\r\n base1 <<= 1\r\n return dec_value\r\n\r\ndef factor(val):\r\n cnt=0\r\n for i in range(1,int(val**(0.5))+1):\r\n if val%i==0:\r\n if val//i==i:\r\n cnt+=1\r\n else:\r\n cnt+=2\r\n return cnt\r\n\r\ndef factor_only(val,n):\r\n # this func is to detect factors apart from number and 1 \r\n # currently it is created for counting exactly N factor\r\n cnt=0\r\n for i in range(2,int(val**(0.5))+1):\r\n if val%i==0:\r\n if val//i==i:\r\n cnt+=1\r\n else:\r\n cnt+=2\r\n if cnt>n:\r\n return False\r\n if cnt==0:\r\n return False\r\n return True\r\n\r\ndef sievePrime(number):\r\n # it return list of all primes\r\n\tnumbersList = list(range(2,number+1)) \r\n\tfor i in range(2,int(number**0.5)+1): \r\n\t\tfor j in range (i*i, number+1, i): \r\n\t\t\tif j in numbersList: \r\n\t\t\t\tnumbersList.remove(j) \r\n\treturn numbersList\r\ndef check_perfect(n):\r\n if int(n**0.5)==n**0.5:return True\r\n else:return False\r\n\r\ndef find_root(a,b,c):\r\n return ((-b)+(b**2-4*a*c)**(0.5))/(2*a),((-b)-(b**2-4*a*c)**(0.5))/(2*a)\r\ndef digit_sum(n):\r\n sum1=0\r\n while n:\r\n rem=n%10\r\n sum1+=rem\r\n n//=10\r\n return sum1\r\ndef checkPrime(number):\r\n # The Lowest even prime is 2 and the lowest odd prime is 3. \r\n # Apart from these two numbers all the prime numbers greater than 3 \r\n # can be expressed in the form of 6n + 1 or 6n -1.\r\n\r\n # # # optimised than check_prime # # #\r\n \r\n\tif number <= 1:\r\n\t\treturn False\r\n\tif number == 2 or number == 3:\r\n\t\treturn True\r\n\tif number % 2 == 0 or number % 3 == 0:\r\n\t\treturn False\r\n\ti = 5\r\n\twhile(i * i <= number):\r\n\t\tif (number % i == 0 or number % (i + 2) == 0):\r\n\t\t\treturn False\r\n\t\ti = i + 6\r\n\treturn True\r\ndef func(arr):\r\n return arr[1]\r\n\r\n# f=open(\"input.txt\",'r')\r\n# h=open(\"output.txt\",'w')\r\n# b,g=map(int,f.readline().split())\r\n# T=int(f.readline())\r\n# arr = [int(i)for i in f.readline().split()]\r\n# for _ in range(1,n+1):\r\n # n=int(input())\r\n # n,m=map(int,input().split()) \r\n # s=input()\r\n # arr=list(map(int,input().split()))\r\n # s=list(map(int,input()))\r\n # mat=[input() for i in range(4)]\r\n # query=[list(map(int,input().split())) for i in range(m)]\r\n\r\n\r\n# import math\r\nn=int(input())\r\n# n,t=map(int,input().split())\r\n# s=(input())\r\n\r\n# s,t=input().split()\r\n# arr=list(map(int,input().split()))\r\n\r\n# for _ in range(int(input())):\r\n# n=int(input())\r\nfor i in range(1,162):\r\n if check_perfect(4*n+i**2):\r\n r1,r2=find_root(1,i,-n)\r\n if int(r1)**2 + digit_sum(int(r1))*(int(r1))==n:\r\n print(int(r1));exit()\r\nprint(-1)\r\n# 999920076596999923\r\n# for _ in range(int(input())):\r\n # n=int(input())\r\n # n,t=map(int,input().split())\r\n # arr=list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# a={int(v):int(i) for i,v in enumerate(input().split(),1)}\r\n# # print(a)\r\n# q=int(input())\r\n# l=input().split()\r\n# qu=[a[int(i)] for i in l]\r\n# q=[a[n-i+1] for i in qu]\r\n# print(sum(qu),(n+1)*q-sum(qu))\r\n\r\n\r\n\r\n\r\n# n,a,b,c = map(int,input().split())\r\n# a,b,c = sorted([a,b,c])[::-1]\r\n# ans = 0\r\n# for i in range(n//a+1):\r\n# \tfor j in range(n//b+1):\r\n# \t\tk = (n-i*a-j*b)//c\r\n# \t\tif i*a+b*j+k*c==n and k>=0:\r\n# \t\t\tans = max(ans,i+j+k)\r\n# \t\t\tbreak\r\n\r\n# print(ans)\r\n\r\n# =============== ANISH DE============\r\n# ---------------------------iye ha aam zindegi---------------------------------------------\r\nimport math\r\nimport random\r\nimport heapq, bisect\r\nimport sys\r\nfrom collections import deque, defaultdict\r\nfrom fractions import Fraction\r\nimport sys\r\nimport threading\r\nfrom collections import defaultdict\r\nmod = 10 ** 9 + 7\r\nmod1 = 998244353\r\n \r\n# ------------------------------warmup----------------------------\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n \r\n# -------------------game starts now----------------------------------------------------import math\r\nclass TreeNode:\r\n def __init__(self, k, v):\r\n self.key = k\r\n self.value = v\r\n self.left = None\r\n self.right = None\r\n self.parent = None\r\n self.height = 1\r\n self.num_left = 1\r\n self.num_total = 1\r\n \r\n \r\nclass AvlTree:\r\n \r\n def __init__(self):\r\n self._tree = None\r\n \r\n def add(self, k, v):\r\n if not self._tree:\r\n self._tree = TreeNode(k, v)\r\n return\r\n node = self._add(k, v)\r\n if node:\r\n self._rebalance(node)\r\n \r\n def _add(self, k, v):\r\n node = self._tree\r\n while node:\r\n if k < node.key:\r\n if node.left:\r\n node = node.left\r\n else:\r\n node.left = TreeNode(k, v)\r\n node.left.parent = node\r\n return node.left\r\n elif node.key < k:\r\n if node.right:\r\n node = node.right\r\n else:\r\n node.right = TreeNode(k, v)\r\n node.right.parent = node\r\n return node.right\r\n else:\r\n node.value = v\r\n return\r\n \r\n @staticmethod\r\n def get_height(x):\r\n return x.height if x else 0\r\n \r\n @staticmethod\r\n def get_num_total(x):\r\n return x.num_total if x else 0\r\n \r\n def _rebalance(self, node):\r\n \r\n n = node\r\n while n:\r\n lh = self.get_height(n.left)\r\n rh = self.get_height(n.right)\r\n n.height = max(lh, rh) + 1\r\n balance_factor = lh - rh\r\n n.num_total = 1 + self.get_num_total(n.left) + self.get_num_total(n.right)\r\n n.num_left = 1 + self.get_num_total(n.left)\r\n \r\n if balance_factor > 1:\r\n if self.get_height(n.left.left) < self.get_height(n.left.right):\r\n self._rotate_left(n.left)\r\n self._rotate_right(n)\r\n elif balance_factor < -1:\r\n if self.get_height(n.right.right) < self.get_height(n.right.left):\r\n self._rotate_right(n.right)\r\n self._rotate_left(n)\r\n else:\r\n n = n.parent\r\n \r\n def _remove_one(self, node):\r\n \"\"\"\r\n Side effect!!! Changes node. Node should have exactly one child\r\n \"\"\"\r\n replacement = node.left or node.right\r\n if node.parent:\r\n if AvlTree._is_left(node):\r\n node.parent.left = replacement\r\n else:\r\n node.parent.right = replacement\r\n replacement.parent = node.parent\r\n node.parent = None\r\n else:\r\n self._tree = replacement\r\n replacement.parent = None\r\n node.left = None\r\n node.right = None\r\n node.parent = None\r\n self._rebalance(replacement)\r\n \r\n def _remove_leaf(self, node):\r\n if node.parent:\r\n if AvlTree._is_left(node):\r\n node.parent.left = None\r\n else:\r\n node.parent.right = None\r\n self._rebalance(node.parent)\r\n else:\r\n self._tree = None\r\n node.parent = None\r\n node.left = None\r\n node.right = None\r\n \r\n def remove(self, k):\r\n node = self._get_node(k)\r\n if not node:\r\n return\r\n if AvlTree._is_leaf(node):\r\n self._remove_leaf(node)\r\n return\r\n if node.left and node.right:\r\n nxt = AvlTree._get_next(node)\r\n node.key = nxt.key\r\n node.value = nxt.value\r\n if self._is_leaf(nxt):\r\n self._remove_leaf(nxt)\r\n else:\r\n self._remove_one(nxt)\r\n self._rebalance(node)\r\n else:\r\n self._remove_one(node)\r\n \r\n def get(self, k):\r\n node = self._get_node(k)\r\n return node.value if node else -1\r\n \r\n def _get_node(self, k):\r\n if not self._tree:\r\n return None\r\n node = self._tree\r\n while node:\r\n if k < node.key:\r\n node = node.left\r\n elif node.key < k:\r\n node = node.right\r\n else:\r\n return node\r\n return None\r\n \r\n def get_at(self, pos):\r\n x = pos + 1\r\n node = self._tree\r\n while node:\r\n if x < node.num_left:\r\n node = node.left\r\n elif node.num_left < x:\r\n x -= node.num_left\r\n node = node.right\r\n else:\r\n return (node.key, node.value)\r\n raise IndexError(\"Out of ranges\")\r\n \r\n @staticmethod\r\n def _is_left(node):\r\n return node.parent.left and node.parent.left == node\r\n \r\n @staticmethod\r\n def _is_leaf(node):\r\n return node.left is None and node.right is None\r\n \r\n def _rotate_right(self, node):\r\n if not node.parent:\r\n self._tree = node.left\r\n node.left.parent = None\r\n elif AvlTree._is_left(node):\r\n node.parent.left = node.left\r\n node.left.parent = node.parent\r\n else:\r\n node.parent.right = node.left\r\n node.left.parent = node.parent\r\n bk = node.left.right\r\n node.left.right = node\r\n node.parent = node.left\r\n node.left = bk\r\n if bk:\r\n bk.parent = node\r\n node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1\r\n node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)\r\n node.num_left = 1 + self.get_num_total(node.left)\r\n \r\n def _rotate_left(self, node):\r\n if not node.parent:\r\n self._tree = node.right\r\n node.right.parent = None\r\n elif AvlTree._is_left(node):\r\n node.parent.left = node.right\r\n node.right.parent = node.parent\r\n else:\r\n node.parent.right = node.right\r\n node.right.parent = node.parent\r\n bk = node.right.left\r\n node.right.left = node\r\n node.parent = node.right\r\n node.right = bk\r\n if bk:\r\n bk.parent = node\r\n node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1\r\n node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)\r\n node.num_left = 1 + self.get_num_total(node.left)\r\n \r\n @staticmethod\r\n def _get_next(node):\r\n if not node.right:\r\n return node.parent\r\n n = node.right\r\n while n.left:\r\n n = n.left\r\n return n\r\n \r\n \r\n# -----------------------------------------------binary seacrh tree---------------------------------------\r\nclass SegmentTree1:\r\n def __init__(self, data, default=0, func=lambda a, b: max(a,b)):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n \r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n \r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n \r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n \r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n \r\n def __len__(self):\r\n return self._len\r\n \r\n def query(self, start, stop):\r\n if start == stop:\r\n return self.__getitem__(start)\r\n stop += 1\r\n start += self._size\r\n stop += self._size\r\n \r\n res = self._default\r\n while start < stop:\r\n if start & 1:\r\n res = self._func(res, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res = self._func(res, self.data[stop])\r\n start >>= 1\r\n stop >>= 1\r\n return res\r\n \r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\n \r\n \r\n# -------------------game starts now----------------------------------------------------import math\r\nclass SegmentTree:\r\n def __init__(self, data, default=10**9, func=lambda a, b: min(a,b)):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n \r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n \r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n \r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n \r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n \r\n def __len__(self):\r\n return self._len\r\n \r\n def query(self, start, stop):\r\n if start == stop:\r\n return self.__getitem__(start)\r\n stop += 1\r\n start += self._size\r\n stop += self._size\r\n \r\n res = self._default\r\n while start < stop:\r\n if start & 1:\r\n res = self._func(res, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res = self._func(res, self.data[stop])\r\n start >>= 1\r\n stop >>= 1\r\n return res\r\n \r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\n \r\n \r\n# -------------------------------iye ha chutiya zindegi-------------------------------------\r\nclass Factorial:\r\n def __init__(self, MOD):\r\n self.MOD = MOD\r\n self.factorials = [1, 1]\r\n self.invModulos = [0, 1]\r\n self.invFactorial_ = [1, 1]\r\n \r\n def calc(self, n):\r\n if n <= -1:\r\n print(\"Invalid argument to calculate n!\")\r\n print(\"n must be non-negative value. But the argument was \" + str(n))\r\n exit()\r\n if n < len(self.factorials):\r\n return self.factorials[n]\r\n nextArr = [0] * (n + 1 - len(self.factorials))\r\n initialI = len(self.factorials)\r\n prev = self.factorials[-1]\r\n m = self.MOD\r\n for i in range(initialI, n + 1):\r\n prev = nextArr[i - initialI] = prev * i % m\r\n self.factorials += nextArr\r\n return self.factorials[n]\r\n \r\n def inv(self, n):\r\n if n <= -1:\r\n print(\"Invalid argument to calculate n^(-1)\")\r\n print(\"n must be non-negative value. But the argument was \" + str(n))\r\n exit()\r\n p = self.MOD\r\n pi = n % p\r\n if pi < len(self.invModulos):\r\n return self.invModulos[pi]\r\n nextArr = [0] * (n + 1 - len(self.invModulos))\r\n initialI = len(self.invModulos)\r\n for i in range(initialI, min(p, n + 1)):\r\n next = -self.invModulos[p % i] * (p // i) % p\r\n self.invModulos.append(next)\r\n return self.invModulos[pi]\r\n \r\n def invFactorial(self, n):\r\n if n <= -1:\r\n print(\"Invalid argument to calculate (n^(-1))!\")\r\n print(\"n must be non-negative value. But the argument was \" + str(n))\r\n exit()\r\n if n < len(self.invFactorial_):\r\n return self.invFactorial_[n]\r\n self.inv(n) # To make sure already calculated n^-1\r\n nextArr = [0] * (n + 1 - len(self.invFactorial_))\r\n initialI = len(self.invFactorial_)\r\n prev = self.invFactorial_[-1]\r\n p = self.MOD\r\n for i in range(initialI, n + 1):\r\n prev = nextArr[i - initialI] = (prev * self.invModulos[i % p]) % p\r\n self.invFactorial_ += nextArr\r\n return self.invFactorial_[n]\r\n \r\n \r\nclass Combination:\r\n def __init__(self, MOD):\r\n self.MOD = MOD\r\n self.factorial = Factorial(MOD)\r\n \r\n def ncr(self, n, k):\r\n if k < 0 or n < k:\r\n return 0\r\n k = min(k, n - k)\r\n f = self.factorial\r\n return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD\r\n \r\n \r\n# --------------------------------------iye ha combinations ka zindegi---------------------------------\r\ndef powm(a, n, m):\r\n if a == 1 or n == 0:\r\n return 1\r\n if n % 2 == 0:\r\n s = powm(a, n // 2, m)\r\n return s * s % m\r\n else:\r\n return a * powm(a, n - 1, m) % m\r\n \r\n \r\n# --------------------------------------iye ha power ka zindegi---------------------------------\r\ndef sort_list(list1, list2):\r\n zipped_pairs = zip(list2, list1)\r\n \r\n z = [x for _, x in sorted(zipped_pairs)]\r\n \r\n return z\r\n \r\n \r\n# --------------------------------------------------product----------------------------------------\r\ndef product(l):\r\n por = 1\r\n for i in range(len(l)):\r\n por *= l[i]\r\n return por\r\n \r\n \r\n# --------------------------------------------------binary----------------------------------------\r\ndef binarySearchCount(arr, n, key):\r\n left = 0\r\n right = n - 1\r\n \r\n count = 0\r\n \r\n while (left <= right):\r\n mid = int((right + left) / 2)\r\n \r\n # Check if middle element is\r\n # less than or equal to key\r\n if (arr[mid] < key):\r\n count = mid + 1\r\n left = mid + 1\r\n \r\n # If key is smaller, ignore right half\r\n else:\r\n right = mid - 1\r\n \r\n return count\r\n \r\n \r\n# --------------------------------------------------binary----------------------------------------\r\ndef countdig(n):\r\n c = 0\r\n while (n > 0):\r\n n //= 10\r\n c += 1\r\n return c\r\ndef binary(x, length):\r\n y = bin(x)[2:]\r\n return y if len(y) >= length else \"0\" * (length - len(y)) + y\r\n \r\ndef countGreater(arr, n, k):\r\n l = 0\r\n r = n - 1\r\n \r\n # Stores the index of the left most element\r\n # from the array which is greater than k\r\n leftGreater = n\r\n \r\n # Finds number of elements greater than k\r\n while (l <= r):\r\n m = int(l + (r - l) / 2)\r\n if (arr[m] >= k):\r\n leftGreater = m\r\n r = m - 1\r\n \r\n # If mid element is less than\r\n # or equal to k update l\r\n else:\r\n l = m + 1\r\n \r\n # Return the count of elements\r\n # greater than k\r\n return (n - leftGreater)\r\n \r\n \r\n# --------------------------------------------------binary------------------------------------\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def isSolution(x,n,sx):\r\n digitSum = 0\r\n for digit in str(x):\r\n digitSum+=int(digit)\r\n\r\n if (x*(x+sx)==n and sx==digitSum):\r\n return 0\r\n\r\n if x*(x+sx)<n:\r\n return -1\r\n else:\r\n return 1\r\n\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nans = -1\r\nfor sx in range(1,82):\r\n left = 0\r\n right = int(n**0.5)\r\n while left<=right:\r\n mid = left + (right-left)//2\r\n val = isSolution(mid,n,sx)\r\n if val==0:\r\n if ans==-1:\r\n ans = mid\r\n else:\r\n ans = min(mid,ans)\r\n right = mid-1\r\n elif val<0:\r\n left = mid+1\r\n elif val>0:\r\n right = mid-1\r\n\r\n\r\nprint(ans)\r\n\r\n" ]

[ "q=lambda:map(int,input().split())\r\nn,=q()\r\na=list(q())\r\nb=list(q())\r\nc=0\r\nfor i,j in zip(a,b):\r\n if j==1:\r\n c-=1\r\n elif i*2>=j:\r\n c+=((j//2)*(j-(j//2)))\r\n else:\r\n c-=1\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\njoy=0\r\nfor i in range(n):\r\n if (2 * a[i]) < b[i] or b[i] == 1:\r\n joy -= 1\r\n else:\r\n joy += (b[i] // 2) * (b[i] - (b[i] // 2))\r\nprint(joy) ", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nb = list(map(int, input().split(' ')))\r\nsum = 0\r\nfor i in range(n):\r\n if b[i] == 1 or a[i] + a[i] < b[i]:\r\n sum = sum - 1\r\n else:\r\n sum = sum + (b[i] // 2) * (b[i] - b[i] // 2)\r\nprint(sum)\r\n", "input()\r\nanotes = input().split(' ')\r\nbnotes = input().split(' ')\r\njoy = 0\r\nfor i in range(0, len(anotes)):\r\n if int(bnotes[i]) > 1 and int(anotes[i]) * 2 >= int(bnotes[i]):\r\n joy += int(bnotes[i]) // 2 * (int(bnotes[i]) // 2 + int(bnotes[i]) % 2)\r\n else:\r\n joy -= 1\r\nprint(joy)\r\n", "n, a, b = input(), map(int, input().split()), map(int, input().split())\nprint(sum((y // 2) * (y - y // 2) if y > 1 and 2 * x >= y else -1 for x, y in zip(a, b)))", "def great_sum_finder(num, rang):\r\n if abs(num - rang) > rang or num == 1:\r\n return -1\r\n if rang == 1:\r\n return 1\r\n if num < rang:\r\n return great_sum_finder(num, num - 1)\r\n return (num // 2) * (num - num // 2)\r\n\r\n\r\nn = int(input())\r\na = input().split()\r\nb = input().split()\r\na = list(map(int, a))\r\nb = list(map(int, b))\r\njoy = 0\r\nfor i in range(n):\r\n joy += great_sum_finder(b[i], a[i])\r\nprint(joy)\r\n", "R = lambda:list(map(int, input().split()))\r\nn, = R()\r\na = R()\r\nb = R()\r\ns = 0\r\nfor i in range(n):\r\n if 2 * a[i] < b[i] or b[i] == 1:\r\n s -= 1\r\n else:\r\n x = b[i] // 2\r\n y = b[i] - x\r\n s += x * y\r\nprint(s)", "n = int(input())\r\na = input().split()\r\na = list(map(lambda x: int(x) if x.isdigit() else 0, a))\r\nb = input().split()\r\nb = list(map(lambda x: int(x) if x.isdigit() else 0, b))\r\nsum = 0\r\nwhile(len(a) > 0):\r\n if(b[len(a)-1] == 1):\r\n sum-=1\r\n else:\r\n if(a[len(a)-1] == 1):\r\n if(b[len(a)-1] == 2):\r\n sum+=1\r\n else:\r\n sum-=1\r\n else:\r\n c = int(b[len(a)-1]/2)\r\n while(c > a[len(a)-1]):\r\n c-=1\r\n if(b[len(a)-1] - c > a[len(a)-1]):\r\n sum-=1\r\n else:\r\n sum = sum + c*(b[len(a)-1]-c)\r\n d = len(a)\r\n del a[d-1]\r\n del b[d-1]\r\nprint(sum)", "import math\r\nn = int(input())\r\naList = list(map(int,input().split()))\r\nbList = list(map(int,input().split()))\r\njoy = 0\r\nfor i in range(n):\r\n if bList[i] == 1:\r\n joy = joy - 1\r\n else:\r\n if bList[i] % 2 == 0:\r\n b1 = bList[i] / 2\r\n b2 = bList[i] / 2\r\n else:\r\n b1 = math.floor(bList[i] / 2)\r\n b2 = math.ceil(bList[i] / 2)\r\n if b2 <= aList[i]:\r\n joy = joy + b1 * b2\r\n else:\r\n joy = joy - 1\r\nprint(int(joy))", "n = int(input())\r\na = list(map(int,input().strip().split()))[:n]\r\nb = list(map(int,input().strip().split()))[:n]\r\nans = 0\r\nfor i in range(n):\r\n if 2*a[i] < b[i]:\r\n ans = ans - 1\r\n elif 2*a[i] == b[i]:\r\n ans = ans + a[i]*a[i]\r\n else:\r\n if b[i] == 1:\r\n ans = ans - 1\r\n else:\r\n if b[i]%2 == 1:\r\n ans = ans + (b[i]//2)*(b[i]//2 + 1)\r\n else:\r\n ans = ans + b[i]*b[i]//4\r\n \r\nprint (ans)\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nglad = [(b[i]//2)*(b[i]-b[i]//2) if (b[i]!=1 and b[i]<=2*a[i]) else -1 for i in range(len(b))]\r\nprint(sum(glad)) ", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nsum = 0\r\n\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n b[i] = int(b[i])\r\n \r\n if a[i]*2 < b[i] or b[i] == 1 :\r\n sum = sum - 1\r\n \r\n else:\r\n sum = sum + (b[i]//2)*(b[i] - b[i]//2)\r\nprint(sum)", "input()\r\nprint(sum(-1 if (b>2*a or b==1) else ((b//2)*((b+1)//2)) for a,b in zip(map(int,input().split()),map(int,input().split()))))" ]

[ "n = int(input())\r\narr = [int(x) for x in input().split()]\r\ncnt = {0 : 0}\r\nans = 0\r\npref = [0] * n\r\nfor i in range(0, n):\r\n ans += arr[i] * i\r\n if i > 0:\r\n ans -= pref[i - 1]\r\n pref[i] += pref[i - 1]\r\n if arr[i] + 1 in cnt:\r\n ans += cnt[arr[i] + 1]\r\n if arr[i] - 1 in cnt:\r\n ans -= cnt[arr[i] - 1]\r\n pref[i] += arr[i]\r\n if arr[i] in cnt:\r\n cnt[arr[i]] += 1\r\n else:\r\n cnt[arr[i]] = 1\r\nprint(ans)\r\n", "def set(x) : \n\tif(x not in m) : \n\t\tm[x] = 0\n\nn = int(input())\na = list(map(int, input().split()))\nm = {}\nans, total = 0, 0\n\nfor i in range(0, n) : \n\tx = a[i]; \n\tset(x), set(x - 1), set(x + 1)\n\tans = ans + (i - m[x] - m[x - 1] - m[x + 1]) * x; \n\tans = ans -(total - m[x] * x - m[x - 1] * (x - 1) - m[x + 1] * (x + 1)); \n\n\tm[x], total = m[x] + 1, total + x\n\nprint(ans) ", "n = int(input())\r\nl=list(map(int,input().split()))\r\nsum = 0\r\nmp = {}\r\nans = 0\r\nfor i in range(n):\r\n sum += l[i]\r\n if l[i] in mp:\r\n mp[l[i]] += 1\r\n else:\r\n mp[l[i]] = 1\r\n \r\n eq = mp[l[i]]\r\n ls = 0\r\n gr = 0\r\n if l[i] + 1 in mp:\r\n gr = mp[l[i] + 1]\r\n\r\n if l[i] - 1 in mp:\r\n ls = mp[l[i] - 1]\r\n \r\n ans += (i + 1 - eq - ls - gr) * l[i] - (sum - l[i] * eq - (l[i] + 1) * gr - (l[i] - 1) * ls)\r\n\r\nprint(ans)\r\n\r\n ", "n = int(input())\r\nA = [int(i) for i in input().split()]\r\nacc = 0\r\nres = 0\r\nfor i in range(len(A)) :\r\n acc -= A[i]\r\n res += acc + A[i] * (i + 1)\r\n\r\nmp = dict()\r\n\r\nfor i in range(len(A)) :\r\n mp[A[i]] = mp.get(A[i], 0) + 1\r\n res -= mp.get(A[i] - 1, 0) - mp.get(A[i] + 1, 0)\r\n \r\nprint(res)", "from sys import stdin\r\nimport math\r\nimport itertools\r\nfrom functools import reduce\r\nfrom decimal import Decimal\r\n# = stdin.readline().rstrip()\r\n# = [x for x in stdin.readline().rstrip().split()]\r\n# = int(stdin.readline().rstrip())\r\n# = [int(x) for x in stdin.readline().rstrip().split()]\r\n\r\nn = int(stdin.readline().rstrip())\r\na = [int(x) for x in stdin.readline().rstrip().split()]\r\nans = 0\r\nfor i in range(n):\r\n ans += i*a[i]\r\n ans -= (n - i - 1)*a[i]\r\nd = dict()\r\nfor i in range(n):\r\n if a[i]-1 in d:\r\n ans -= d[a[i]-1]\r\n if a[i]+1 in d:\r\n ans += d[a[i]+1]\r\n if a[i] in d:\r\n d[a[i]] = d[a[i]] + 1\r\n else:\r\n d[a[i]] = 1\r\nprint(ans)\r\n", "from collections import defaultdict\r\nimport sys\r\ninput=sys.stdin.readline\r\nn = int(input()) # 20w\r\na = [int(i) for i in input().split()] # 10**9\r\nb=[0]\r\nans=0\r\nfor i in a:\r\n b.append(b[-1]+i)\r\nfor i in range(n):\r\n ans+=i*a[i]-b[i]\r\ncnt=defaultdict(lambda :0)\r\nfor i in a:\r\n ans-=cnt[i-1]\r\n ans+=cnt[i+1]\r\n cnt[i]+=1\r\nprint(ans)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nkeys = list(map(int, input().split()))\r\ndictionary = {}\r\ndictionary = defaultdict(lambda: 0, dictionary)\r\n\r\nans = 0\r\nsum = 0\r\nfor i in range(0, n):\r\n key = keys[i]\r\n a = dictionary[key - 1]\r\n b = dictionary[key]\r\n c = dictionary[key + 1]\r\n ans += key * (i - a - b - c) - (sum - a * (key - 1) - b * key - c * (key + 1))\r\n sum += key\r\n dictionary[key] += 1\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = {}\r\nans = 0\r\nrs = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n k = n - i - 1 - cnt.get(a[i] + 1, 0) - cnt.get(a[i] - 1, 0)\r\n ans += rs - cnt.get(a[i] + 1, 0) * (a[i] + 1) - cnt.get(a[i] - 1, 0) * (a[i] - 1) - k * a[i]\r\n rs += a[i]\r\n cnt[a[i]] = cnt.get(a[i], 0) + 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\narr = [int(e) for e in input().split()]\r\nm = {}\r\npref = 0\r\nans = 0\r\nfor i in arr:\r\n m[i] = 0\r\n m[i+1] = 0\r\n m[i-1] = 0\r\nfor i in range(len(arr)):\r\n ans += i*arr[i] - pref\r\n ans -= (m[arr[i]-1]-m[arr[i]+1])\r\n pref += arr[i]\r\n m[arr[i]] += 1\r\nprint(ans)", "import os,sys,random,threading\r\nfrom random import randint\r\nfrom copy import deepcopy\r\nfrom io import BytesIO, IOBase\r\nfrom types import GeneratorType\r\nfrom functools import lru_cache, reduce\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, defaultdict, deque\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import heapify, heappop, heappush\r\nfrom typing import Generic, Iterable, Iterator, TypeVar, Union, List\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf\r\nfrom decimal import Decimal, getcontext\r\nBUFSIZE = 4096\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nMI = lambda :map(int,input().split())\r\nli = lambda :list(MI())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)] # →↘↓↙←↖↑↗\r\n\r\nclass BIT1:\r\n \"\"\"单点修改,区间和查询\"\"\"\r\n\r\n __slots__ = \"size\", \"bit\", \"tree\"\r\n\r\n def __init__(self, n: int):\r\n self.size = n\r\n self.bit = n.bit_length()\r\n self.tree = [0]*(n+1)\r\n\r\n def add(self, index: int, delta: int) -> None:\r\n # index 必须大于0\r\n while index <= self.size:\r\n self.tree[index]+=delta\r\n index += index & -index\r\n\r\n def _query(self, index: int) -> int: \r\n res = 0\r\n while index > 0:\r\n res += self.tree[index]\r\n index -= index & -index\r\n return res\r\n\r\n def query(self, left: int, right: int) -> int:\r\n return self._query(right) - self._query(left - 1)\r\n\r\n\r\n\r\nn=ii()\r\n\r\narr=li()\r\n\r\nbrr=sorted(set(arr+[-1,-2,-3,10**9+1,10**9+2,10**9+3]))\r\n\r\nd={a:i for i,a in enumerate(brr)}\r\n\r\nres=0\r\n\r\nbc=BIT1(len(d)+5)\r\n\r\nbs=BIT1(len(d)+5)\r\n\r\nfor a in arr:\r\n st=d[a]-1\r\n if brr[st]==a-1:\r\n st-=1\r\n ed=d[a]+1\r\n if brr[ed]==a+1:\r\n ed+=1\r\n res+=a*bc.query(1,st)-bs.query(1,st)\r\n res+=a*bc.query(ed,len(d)+3)-bs.query(ed,len(d)+3)\r\n bc.add(d[a],1)\r\n bs.add(d[a],a)\r\n \r\n\r\nprint(res)\r\n\r\n\r\n\r\n\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n n = int(input())\r\n #a,b,c = map(int,input().split())\r\n ai = list(map(int,input().split()))\r\n\r\n ans = 0\r\n for i in range(n):\r\n ans += ai[i] * (i) - ai[i] * (n-i-1)\r\n #print(ans)\r\n d = dict()\r\n for i in range(n):\r\n if ai[i] in d:\r\n d[ai[i]] += 1\r\n else:\r\n d[ai[i]] = 1\r\n\r\n if (ai[i]-1) in d:\r\n ans -= d[ai[i]-1]\r\n #print(ai[i],i,\"+1\")\r\n if (ai[i]+1) in d:\r\n ans += d[ai[i]+1]\r\n #print(ai[i],i)\r\n print(ans)\r\nmain()\r\n", "import sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\n\ndef main():\n N = int(input())\n A = list(map(int, input().split()))\n\n sum_A = sum(A)\n cnt = defaultdict(int)\n for a in A:\n cnt[a] += 1\n\n ans = 0\n for i in range(N):\n a = A[i]\n cnt[a] -= 1\n sum_A -= a\n\n tmp = sum_A\n n = 0\n for b in (a-1, a, a+1):\n n += cnt[b]\n tmp -= b * cnt[b]\n ans += tmp - a * (N-1-i-n)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nsm = 0\r\ndc = {}\r\nres = 0\r\nfor i in range(n):\r\n res += a[i] * i - sm\r\n if a[i] + 1 in dc:\r\n res += dc[a[i]+1]\r\n if a[i] - 1 in dc:\r\n res -= dc[a[i]-1]\r\n sm += a[i]\r\n if(a[i] in dc):\r\n dc[a[i]] += 1\r\n else :\r\n dc[a[i]] = 1\r\nprint(res)\r\n", "N=int(input())\r\nA=[int(x) for x in input().split()]\r\nbit=[]\r\nnax=200010\r\nfor i in range(nax*4+1):\r\n bit.append([0,0])\r\n\r\ndef up(k,val):\r\n while k< (nax*4):\r\n bit[k][0]+=val\r\n bit[k][1]+=1\r\n k+=(k&-k)\r\n\r\ndef go(k):\r\n ans=0;r=0\r\n while k>0:\r\n ans+=bit[k][0]\r\n r+=bit[k][1]\r\n k-=(k&-k)\r\n return ans,r\r\n\r\nindex={}\r\nB=[x for x in A]\r\nB.sort()\r\nidx=1\r\nindex[B[0]]=idx;\r\nfor i in range(1,N):\r\n if B[i]!=B[i-1]:\r\n if B[i]==(B[i-1]+1):\r\n idx+=1\r\n index[B[i]]=idx\r\n else:\r\n idx+=2\r\n index[B[i]]=idx\r\n\r\nhave=0\r\nfor i in range(0,N):\r\n a1,a2=go(index[A[i]]-2)\r\n a3,a4=go(3*N)\r\n a5,a6=go(index[A[i]]+1)\r\n s1=(a2*A[i])-(a1)\r\n s2=((a4-a6)*A[i])-(a3-a5)\r\n have+=s1\r\n have+=s2\r\n up(index[A[i]],A[i])\r\n\r\nprint(have)\r\n \r\n", "from collections import defaultdict as di\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = di(int)\r\nres, sum = 0, 0\r\nfor i in range(n):\r\n\tres += a[i] * i - sum - d[a[i]-1] + d[a[i]+1]\r\n\tsum += a[i]\r\n\td[a[i]] += 1\r\nprint(res)", "import sys\r\nimport math\r\nfrom itertools import *\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\ndef fgh():\r\n return [int(xx) for xx in input().split()]\r\ndef fg():\r\n return int(input())\r\nn = fg()\r\na = fgh()\r\n'''if n % 3 == 0:\r\n print(2 * n // 3)\r\n for i in range(n // 3):\r\n print(3 * i + 1, 3 * i + 2, 3 * i + 3)\r\n print(3 * i + 1, 3 * i + 2, 3 * i + 3)\r\nif n % 3 == 1:\r\n print(2 * n // 3 + 2)\r\n for i in range(n // 3):\r\n print(3 * i + 1, 3 * i + 2, 3 * i + 3)\r\n print(3 * i + 1, 3 * i + 2, 3 * i + 3)\r\n print(n - 2, n - 1, n)\r\n print(n - 2, n - 1, n)\r\nif n % 3 == 2:\r\n print(2 * n // 3 + 2)\r\n for i in range(n // 3):\r\n print(3 * i + 1, 3 * i + 2, 3 * i + 3)\r\n print(3 * i + 1, 3 * i + 2, 3 * i + 3)\r\n print(n - 2, n - 1, n)\r\n print(n - 2, n - 1, n)'''\r\npr = [0]\r\nfor i in range(n):\r\n pr.append(pr[-1] + a[i])\r\nans = 0\r\nfor i in range(n):\r\n ans += i * a[i] - pr[i]\r\nd = {}\r\nfor i in range(n):\r\n d[a[i]] = []\r\nfor i in range(n):\r\n d[a[i]].append(i)\r\nfor i in range(n):\r\n if a[i] - 1 in d and d[a[i] - 1][0] < i:\r\n l = 0\r\n r = len(d[a[i] - 1])\r\n while r - l > 1:\r\n m = (l + r) // 2\r\n if d[a[i] - 1][m] > i:\r\n r = m\r\n else:\r\n l = m\r\n ans -= r\r\n if a[i] + 1 in d and d[a[i] + 1][0] < i:\r\n l = 0\r\n r = len(d[a[i] + 1])\r\n while r - l > 1:\r\n m = (l + r) // 2\r\n if d[a[i] + 1][m] > i:\r\n r = m\r\n else:\r\n l = m\r\n ans += r\r\nprint(ans)\r\n", "\r\n\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nans = 0\r\ntot = 0\r\nsz = 0\r\n\r\nfrq = {}\r\n\r\nfor i in range(n-1,-1,-1):\r\n ans += tot - l[i]*sz\r\n if(l[i]+1 in frq):\r\n ans -= frq[l[i]+1]\r\n \r\n if(l[i]-1 in frq):\r\n ans += frq[l[i]-1]\r\n if(l[i] in frq):\r\n frq[l[i]] += 1\r\n else:\r\n frq[l[i]] = 1\r\n \r\n tot += l[i]\r\n sz += 1\r\n\r\nprint(ans)\r\n", "import sys\ninput = sys.stdin.readline\nimport math\nimport copy\nimport collections\nfrom collections import deque\nimport heapq\nimport itertools\nfrom collections import defaultdict\nfrom collections import Counter\n\nn = int(input())\narr = list(map(int,input().split()))\nans = 0\nfor i in range(n):\n ans += arr[i]*i\n ans -= arr[i]*(n-i-1)\nr = dict()\nfor i in range(n):\n if arr[i] in r:\n r[arr[i]]+=1\n else:\n r[arr[i]] = 1\nfor i in range(n):\n r[arr[i]] -= 1\n if arr[i]+1 in r:\n ans -= r[arr[i]+1]\n if arr[i]-1 in r:\n ans += r[arr[i]-1]\nprint(ans)", "from sys import stdin, stdout\r\nfrom collections import defaultdict\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n\r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n\r\ndef solve():\r\n\tn=read_int()\r\n\ta=read_ints()\r\n\tans=0\r\n\ttot=0\r\n\tcnt=defaultdict(int)\r\n\tfor i in range(n):\r\n\t\tans += (i*a[i]-tot)\r\n\t\tfor v in range(a[i]-1, a[i]+2):\r\n\t\t\tif v in cnt:\r\n\t\t\t\tc = cnt[v]\r\n\t\t\t\tans -= c*(a[i]-v)\r\n\t\ttot+=a[i]\r\n\t\tcnt[a[i]]+=1\r\n\tprint(ans)\r\n\r\nsolve()\r\n", "n = input();\r\narr = list(map(int, input().split()))\r\nmp = {}\r\nans = 0\r\nsums = 0\r\ncount = 0\r\nfor i in range(int(n)-1,-1,-1):\r\n sums += arr[i];\r\n if arr[i] in mp:\r\n mp[arr[i]] += 1\r\n else:\r\n mp[arr[i]] = 1\r\n count = count + 1;\r\n ans1 = 0;\r\n ans2 = 0;\r\n # print(i)\r\n if (arr[i]+1) in mp:\r\n ans1 = mp[arr[i]+1]\r\n if (arr[i]-1) in mp:\r\n ans2 = mp[arr[i]-1] \r\n # print(ans1,ans2,count,arr[i]) \r\n ans += (sums + ans2 - ans1 - arr[i] * count);\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmp = dict()\r\nsm = l[0]\r\nmp[l[0]] = 1\r\ndef get(k):\r\n try:\r\n return mp[k]\r\n except:\r\n return 0\r\ndef add(k):\r\n try:\r\n mp[k] = mp[k] + 1\r\n except:\r\n mp[k] = 1\r\n\r\nans = 0\r\nfor i in range(1, n):\r\n ans += (i*l[i] - sm) - get(l[i]-1) + get(l[i]+1)\r\n sm += l[i]\r\n add(l[i])\r\n\r\nprint(ans)", "n = int(input())\r\narr = input().split()\r\n\r\nm = {}\r\nfor i in range(0, len(arr)):\r\n arr[i] = int(arr[i])\r\n m[arr[i]] = 0\r\n m[arr[i] + 1] = 0\r\n m[arr[i] - 1] = 0\r\n\r\npref = [0,]\r\n\r\nfor i in arr:\r\n m[i] += 1\r\n pref.append(0)\r\n \r\nfor i in range (n - 1, -1, -1):\r\n pref[i] = pref[i + 1] + arr[i]\r\n \r\nans = 0\r\n\r\nfor i in range (0, len(arr)):\r\n m[arr[i]] -= 1\r\n ans -= (m[arr[i] + 1] - m[arr[i] - 1])\r\n ans += pref[i] - (n - i) * arr[i]\r\n \r\nprint (ans)\r\n ", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = [0]\r\nfor i in a:\r\n b.append(b[-1] + i)\r\nans = 0\r\nfor i in range(n):\r\n ans += i * a[i] - b[i]\r\ncnt = defaultdict(lambda : 0)\r\nfor i in a:\r\n ans -= cnt[i - 1]\r\n ans += cnt[i + 1]\r\n cnt[i] += 1\r\nprint(ans)", "from sys import stdin,stdout\r\nn=int(stdin.readline())\r\nA=[int(x)for x in stdin.readline().split()]\r\nMap={}\r\ns=0\r\npres=0\r\nfor index,element in enumerate(A):\r\n s+=element*index-pres\r\n pres+=element\r\n if (element-1) in Map:\r\n s-=Map[element-1]\r\n if (element+1) in Map:\r\n s+=Map[element+1]\r\n if element in Map:\r\n Map[element]+=1\r\n else :Map[element]=1\r\nstdout.write(\"%d\"%s)\r\n\r\n\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nans = sum = 0\r\ncnt = Counter(a)\r\n\r\nfor i in a:\r\n sum += i\r\nfor i in range(n):\r\n cnt[a[i]] -= 1\r\n sum -= a[i]\r\n ans += sum - a[i] * (n - i - 1) + cnt[a[i] - 1] - cnt[a[i] + 1]\r\n # print(ans)\r\nprint(ans)", "n = int(input())\r\nA = map(int, input().split())\r\na = []\r\nfor x in A:\r\n\ta.append(x)\r\ntot = 0\r\nfor i in range(n):\r\n\tl = i\r\n\tr = n - i - 1\r\n\ttot += a[i] * l + -a[i] * r\r\n\r\nfrom collections import defaultdict\r\n\r\n# d = defaultdict(int)\r\n\r\nfor_cnt = defaultdict(int)\r\n\r\nfor i in range(n):\r\n\tfault = for_cnt[a[i] - 1] + for_cnt[a[i] + 1] + for_cnt[a[i]]\r\n\ttot -= a[i] * fault\r\n\tfor_cnt[a[i]] += 1\r\n\r\nback_cnt = defaultdict(int)\r\n\r\ni = n - 1\r\nwhile i >= 0:\r\n\tfault = back_cnt[a[i] - 1] + back_cnt[a[i] + 1] + back_cnt[a[i]]\r\n\ttot -= -a[i] * fault\r\n\tback_cnt[a[i]] += 1\r\n\ti -= 1\r\n\r\nprint(tot) \t\r\n\r\n", "# LUOGU_RID: 100503152\nn = int(input())\r\na = list(map(int, input().split()))\r\nmp = {}\r\nfor i in range(n): mp[a[i]] = mp[a[i] + 1] = mp[a[i] - 1] = 0\r\nans = 0\r\ntot = 0\r\nfor i in range(n):\r\n ans += i * a[i] - tot\r\n tot += a[i]\r\n ans += mp[a[i] + 1]\r\n ans -= mp[a[i] - 1]\r\n mp[a[i]] += 1\r\nprint(ans)", "n = int(input())\r\nlista = list(map(int, input().split()))\r\nd = {}\r\npsum = 0\r\nsum1 = 0\r\nsum2 = 0\r\n\r\n\r\nfor i in range (n):\r\n a = lista[i]\r\n sum1 += a * i - psum\r\n sum2 += d.get(a - 1, 0)\r\n sum2 -= d.get(a + 1, 0)\r\n psum += a\r\n d[a] = d.get(a, 0) + 1\r\n\r\n\r\nprint(sum1 - sum2)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nmap = dict()\r\nfor i in range(0, n):\r\n ans += (i - map.get(a[i], 0) - map.get(a[i] - 1, 0) - map.get(a[i] + 1, 0)) * a[i]\r\n map[a[i]] = map.get(a[i], 0) + 1\r\nmap = dict()\r\nfor i in range(n - 1, -1, -1):\r\n ans -= (n - i - 1 - map.get(a[i], 0) - map.get(a[i] - 1, 0) - map.get(a[i] + 1, 0)) * a[i]\r\n map[a[i]] = map.get(a[i], 0) + 1\r\nprint(ans)", "# Enter your code here. Read input from STDIN. Print output to STDOUT# ===============================================================================================\r\n# importing some useful libraries.\r\nfrom __future__ import division, print_function\r\nfrom fractions import Fraction\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import *\r\nimport bisect\r\nfrom heapq import *\r\nfrom math import ceil, floor\r\nfrom copy import *\r\nfrom collections import deque, defaultdict\r\nfrom collections import Counter as counter # Counter(list) return a dict with {key: count}\r\nfrom itertools import combinations # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]\r\nfrom itertools import permutations as permutate\r\nfrom bisect import bisect_left as bl\r\nfrom operator import *\r\n# If the element is already present in the list,\r\n\r\n# the left most position where element has to be inserted is returned.\r\nfrom bisect import bisect_right as br\r\nfrom bisect import bisect\r\n\r\n# If the element is already present in the list,\r\n# the right most position where element has to be inserted is returned\r\n\r\n# ==============================================================================================\r\n# fast I/O region\r\n\r\nBUFSIZE = 8192\r\nfrom sys import stderr\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"A\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for A in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(A))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\n# inp = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# ===============================================================================================\r\n### START ITERATE RECURSION ###\r\nfrom types import GeneratorType\r\n\r\n\r\ndef iterative(f, stack=[]):\r\n def wrapped_func(*args, **kwargs):\r\n if stack: return f(*args, **kwargs)\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n continue\r\n stack.pop()\r\n if not stack: break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrapped_func\r\n\r\n\r\n#### END ITERATE RECURSION ####\r\n###########################\r\n# Sorted list\r\nclass SortedList:\r\n def __init__(self, iterable=[], _load=200):\r\n \"\"\"Initialize sorted list instance.\"\"\"\r\n values = sorted(iterable)\r\n self._len = _len = len(values)\r\n self._load = _load\r\n self._lists = _lists = [values[start:start + _load] for start in range(0, _len, _load)]\r\n self._list_lens = [len(_list) for _list in _lists]\r\n self._mins = [_list[0] for _list in _lists]\r\n self._fen_tree = []\r\n self._rebuild = True\r\n\r\n def _fen_build(self):\r\n \"\"\"Build a fenwick tree instance.\"\"\"\r\n self._fen_tree[:] = self._list_lens\r\n _fen_tree = self._fen_tree\r\n for start in range(len(_fen_tree)):\r\n if start | start + 1 < len(_fen_tree):\r\n _fen_tree[start | start + 1] += _fen_tree[start]\r\n self._rebuild = False\r\n\r\n def _fen_update(self, index, value):\r\n \"\"\"Update `fen_tree[index] += value`.\"\"\"\r\n if not self._rebuild:\r\n _fen_tree = self._fen_tree\r\n while index < len(_fen_tree):\r\n _fen_tree[index] += value\r\n index |= index + 1\r\n\r\n def _fen_query(self, end):\r\n \"\"\"Return `sum(_fen_tree[:end])`.\"\"\"\r\n if self._rebuild:\r\n self._fen_build()\r\n\r\n _fen_tree = self._fen_tree\r\n A = 0\r\n while end:\r\n A += _fen_tree[end - 1]\r\n end &= end - 1\r\n return A\r\n\r\n def _fen_findkth(self, k):\r\n \"\"\"Return a pair of (the largest `idx` such that `sum(_fen_tree[:idx]) <= k`, `k - sum(_fen_tree[:idx])`).\"\"\"\r\n _list_lens = self._list_lens\r\n if k < _list_lens[0]:\r\n return 0, k\r\n if k >= self._len - _list_lens[-1]:\r\n return len(_list_lens) - 1, k + _list_lens[-1] - self._len\r\n if self._rebuild:\r\n self._fen_build()\r\n\r\n _fen_tree = self._fen_tree\r\n idx = -1\r\n for d in reversed(range(len(_fen_tree).bit_length())):\r\n right_idx = idx + (1 << d)\r\n if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:\r\n idx = right_idx\r\n k -= _fen_tree[idx]\r\n return idx + 1, k\r\n\r\n def _delete(self, pos, idx):\r\n \"\"\"Delete value at the given `(pos, idx)`.\"\"\"\r\n _lists = self._lists\r\n _mins = self._mins\r\n _list_lens = self._list_lens\r\n\r\n self._len -= 1\r\n self._fen_update(pos, -1)\r\n del _lists[pos][idx]\r\n _list_lens[pos] -= 1\r\n\r\n if _list_lens[pos]:\r\n _mins[pos] = _lists[pos][0]\r\n else:\r\n del _lists[pos]\r\n del _list_lens[pos]\r\n del _mins[pos]\r\n self._rebuild = True\r\n\r\n def _loc_left(self, value):\r\n \"\"\"Return an index pair that corresponds to the first position of `value` in the sorted list.\"\"\"\r\n if not self._len:\r\n return 0, 0\r\n\r\n _lists = self._lists\r\n _mins = self._mins\r\n\r\n lo, pos = -1, len(_lists) - 1\r\n while lo + 1 < pos:\r\n mi = (lo + pos) >> 1\r\n if value <= _mins[mi]:\r\n pos = mi\r\n else:\r\n lo = mi\r\n\r\n if pos and value <= _lists[pos - 1][-1]:\r\n pos -= 1\r\n\r\n _list = _lists[pos]\r\n lo, idx = -1, len(_list)\r\n while lo + 1 < idx:\r\n mi = (lo + idx) >> 1\r\n if value <= _list[mi]:\r\n idx = mi\r\n else:\r\n lo = mi\r\n\r\n return pos, idx\r\n\r\n def _loc_right(self, value):\r\n \"\"\"Return an index pair that corresponds to the last position of `value` in the sorted list.\"\"\"\r\n if not self._len:\r\n return 0, 0\r\n\r\n _lists = self._lists\r\n _mins = self._mins\r\n\r\n pos, hi = 0, len(_lists)\r\n while pos + 1 < hi:\r\n mi = (pos + hi) >> 1\r\n if value < _mins[mi]:\r\n hi = mi\r\n else:\r\n pos = mi\r\n\r\n _list = _lists[pos]\r\n lo, idx = -1, len(_list)\r\n while lo + 1 < idx:\r\n mi = (lo + idx) >> 1\r\n if value < _list[mi]:\r\n idx = mi\r\n else:\r\n lo = mi\r\n\r\n return pos, idx\r\n\r\n def add(self, value):\r\n \"\"\"Add `value` to sorted list.\"\"\"\r\n _load = self._load\r\n _lists = self._lists\r\n _mins = self._mins\r\n _list_lens = self._list_lens\r\n\r\n self._len += 1\r\n if _lists:\r\n pos, idx = self._loc_right(value)\r\n self._fen_update(pos, 1)\r\n _list = _lists[pos]\r\n _list.insert(idx, value)\r\n _list_lens[pos] += 1\r\n _mins[pos] = _list[0]\r\n if _load + _load < len(_list):\r\n _lists.insert(pos + 1, _list[_load:])\r\n _list_lens.insert(pos + 1, len(_list) - _load)\r\n _mins.insert(pos + 1, _list[_load])\r\n _list_lens[pos] = _load\r\n del _list[_load:]\r\n self._rebuild = True\r\n else:\r\n _lists.append([value])\r\n _mins.append(value)\r\n _list_lens.append(1)\r\n self._rebuild = True\r\n\r\n def discard(self, value):\r\n \"\"\"Remove `value` from sorted list if it is a member.\"\"\"\r\n _lists = self._lists\r\n if _lists:\r\n pos, idx = self._loc_right(value)\r\n if idx and _lists[pos][idx - 1] == value:\r\n self._delete(pos, idx - 1)\r\n\r\n def remove(self, value):\r\n \"\"\"Remove `value` from sorted list; `value` must be a member.\"\"\"\r\n _len = self._len\r\n self.discard(value)\r\n if _len == self._len:\r\n raise ValueError('{0!r} not in list'.format(value))\r\n\r\n def pop(self, index=-1):\r\n \"\"\"Remove and return value at `index` in sorted list.\"\"\"\r\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\r\n value = self._lists[pos][idx]\r\n self._delete(pos, idx)\r\n return value\r\n\r\n def bisect_left(self, value):\r\n \"\"\"Return the first index to insert `value` in the sorted list.\"\"\"\r\n pos, idx = self._loc_left(value)\r\n return self._fen_query(pos) + idx\r\n\r\n def bisect_right(self, value):\r\n \"\"\"Return the last index to insert `value` in the sorted list.\"\"\"\r\n pos, idx = self._loc_right(value)\r\n return self._fen_query(pos) + idx\r\n\r\n def count(self, value):\r\n \"\"\"Return number of ofinansurrences of `value` in the sorted list.\"\"\"\r\n return self.bisect_right(value) - self.bisect_left(value)\r\n\r\n def __len__(self):\r\n \"\"\"Return the size of the sorted list.\"\"\"\r\n return self._len\r\n\r\n def __getitem__(self, index):\r\n \"\"\"Lookup value at `index` in sorted list.\"\"\"\r\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\r\n return self._lists[pos][idx]\r\n\r\n def __delitem__(self, index):\r\n \"\"\"Remove value at `index` from sorted list.\"\"\"\r\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\r\n self._delete(pos, idx)\r\n\r\n def __contains__(self, value):\r\n \"\"\"Return true if `value` is an element of the sorted list.\"\"\"\r\n _lists = self._lists\r\n if _lists:\r\n pos, idx = self._loc_left(value)\r\n return idx < len(_lists[pos]) and _lists[pos][idx] == value\r\n return False\r\n\r\n def __iter__(self):\r\n \"\"\"Return an iterator over the sorted list.\"\"\"\r\n return (value for _list in self._lists for value in _list)\r\n\r\n def __reversed__(self):\r\n \"\"\"Return a reverse iterator over the sorted list.\"\"\"\r\n return (value for _list in reversed(self._lists) for value in reversed(_list))\r\n\r\n def __repr__(self):\r\n \"\"\"Return string representation of sorted list.\"\"\"\r\n return 'SortedList({0})'.format(list(self))\r\n\r\n\r\n# ===============================================================================================\r\n# some shortcuts\r\n\r\nmod = 1000000007\r\n\r\n\r\ndef YES():\r\n print(\"YES\")\r\n\r\n\r\ndef NO():\r\n print(\"NO\")\r\n\r\n\r\ndef Yes():\r\n print(\"Yes\")\r\n\r\n\r\ndef No():\r\n print(\"No\")\r\n\r\n\r\ndef pow(A, B, p):\r\n res = 1 # Initialize result\r\n A = A % p # Update A if it is more , than or equal to p\r\n if (A == 0):\r\n return 0\r\n while (B > 0):\r\n if ((B & 1) == 1): # If B is odd, multiply, A with result\r\n res = (res * A) % p\r\n\r\n B = B >> 1 # B = B/2\r\n A = (A * A) % p\r\n return res\r\n\r\n\r\nfrom functools import reduce\r\n\r\n\r\ndef numberOfSetBits(n):\r\n n = (n & 0x5555555555555555) + ((n & 0xAAAAAAAAAAAAAAAA) >> 1)\r\n n = (n & 0x3333333333333333) + ((n & 0xCCCCCCCCCCCCCCCC) >> 2)\r\n n = (n & 0x0F0F0F0F0F0F0F0F) + ((n & 0xF0F0F0F0F0F0F0F0) >> 4)\r\n n = (n & 0x00FF00FF00FF00FF) + ((n & 0xFF00FF00FF00FF00) >> 8)\r\n n = (n & 0x0000FFFF0000FFFF) + ((n & 0xFFFF0000FFFF0000) >> 16)\r\n n = (n & 0x00000000FFFFFFFF) + ((n & 0xFFFFFFFF00000000) >> 32) # This last & isn't strictly necessary.\r\n return n\r\n\r\n\r\ndef factors(n):\r\n return set(reduce(list.__add__,\r\n ([start, n // start] for start in range(1, int(n ** 0.5) + 1) if n % start == 0)))\r\n\r\n\r\nclass MergeFind:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n # self.lista = [[_] for _ in range(n)]\r\n\r\n def find(self, a):\r\n to_update = []\r\n while a != self.parent[a]:\r\n to_update.append(a)\r\n a = self.parent[a]\r\n for b in to_update:\r\n self.parent[b] = a\r\n return self.parent[a]\r\n\r\n def merge(self, a, b):\r\n a = self.find(a)\r\n b = self.find(b)\r\n if a == b:\r\n return\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n # self.lista[a] += self.lista[b]\r\n # self.lista[b] = []\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\n\r\n\r\ndef gcd(a, b):\r\n if a == b: return a\r\n while b > 0: a, b = b, a % b\r\n return a\r\n\r\n\r\ndef lcm(a, b):\r\n return abs((a // gcd(a, b)) * b)\r\n\r\n\r\ninf = float(\"inf\")\r\n\r\n##############Find sum of product of subsets of size k in a array\r\n\r\n\r\n# ar=[0,1,2,3]\r\n# k=3\r\n# n=len(ar)-1\r\n# dp=[0]*(n+1)\r\n# dp[0]=1\r\n# for pos in range(1,n+1):\r\n# dp[pos]=0\r\n# l=max(1,k+pos-n-1)\r\n# for j in range(min(pos,k),l-1,-1):\r\n# dp[j]=dp[j]+ar[pos]*dp[j-1]\r\n# print(dp[k])\r\n\r\n\r\n##two pointer method\r\n\r\n\r\n# l=0\r\n# for r in range(n):\r\n# add(r)\r\n# while(not ok(l,r)):#l,r included\r\n# remove(l)\r\n# l+=1\r\n# #[l,r] is valid\r\n# if(ok()):\r\n# do()\r\n\r\n\r\n# #==========================\r\n\r\n\r\n# r=-1\r\n# for l in range(n):\r\n# while (r + 1 < l):\r\n# r=l-1\r\n# reset state\r\n#\r\n#\r\n#\r\n# while(r+1<n and ok_to_include_r+1()):\r\n# add(r)\r\n# r+=1\r\n# #[l,r) is valid\r\n# if(ok()):\r\n# do()\r\n# remove(l)\r\n\r\n\r\n# #############################\r\n\r\n\r\n# discrete binary search\r\n# minimise:\r\n# def search(l,r):\r\n# ans=inf\r\n# while(l<=r):\r\n# mid=(r-l)//2 + l\r\n# if(check(mid)):\r\n# ans=min(ans,mid)\r\n# r=mid-1\r\n# else:\r\n# l=mid+1\r\n#\r\n# return ans\r\n\r\n# maximise:\r\n# def search(l,r):\r\n#\r\n# ans=-1\r\n# while(l<=r):\r\n# mid=l+(r-l)//2\r\n# if(check(mid)):\r\n# ans=max(ans,mid)\r\n# l=mid+1\r\n# else:\r\n# r=mid-1\r\n#\r\n# return ans\r\n\r\n\r\n# =========================================================================================\r\nfrom collections import defaultdict\r\n\r\n\r\n# #\r\n# to find factorial and ncr\r\n# tot = 40\r\n# mod = 10**9 +7\r\n# fac = [1, 1]\r\n# finv = [1, 1]\r\n# inv = [0, 1]\r\n#\r\n# for start in range(2, tot + 1):\r\n# fac.append((fac[-1] * start) % mod)\r\n# inv.append(mod - (inv[mod % start] * (mod // start) % mod))\r\n# finv.append(finv[-1] * inv[-1] % mod)\r\n#\r\n#\r\n# def comb(n, r):\r\n# if(r==0 or r==n):return 1\r\n# if n < r:\r\n# return 0\r\n# else:\r\n# return fac[n] * (finv[r] * finv[n - r] % mod) % mod\r\n#\r\n#\r\n# from functools import lru_cache\r\n# p=3\r\n# def ncr_small_mod_p(n,r):\r\n# ans=1\r\n# while(n>0):\r\n# x=n%p\r\n# y=r%p\r\n# n//=p\r\n# r//=p\r\n# ans*=comb(x,y)\r\n# ans%=p\r\n# return ans\r\n\r\n\r\n#\r\n\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\") # for fast input\r\n\r\n\r\ndef N():\r\n return int(inp())\r\n\r\n\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\n\r\n\r\ndef lis(): return list(map(int, inp().split()))\r\n\r\n\r\ndef stringlis(): return list(map(str, inp().split()))\r\n\r\n\r\ndef sep(): return map(int, inp().split())\r\n\r\n\r\ndef strsep(): return map(str, inp().split())\r\n\r\n\r\ndef fsep(): return map(float, inp().split())\r\n\r\n\r\ndef nextline(): out(\"\\n\") # as stdout.write always print sring.\r\n\r\n\r\ndef arr1d(n, v):\r\n return [v] * n\r\n\r\n\r\ndef arr2d(n, m, v):\r\n return [[v] * m for _ in range(n)]\r\n\r\n\r\ndef arr3d(n, m, p, v):\r\n return [[[v] * p for _ in range(m)] for sta in range(n)]\r\n\r\n\r\ndef ceil(a, b):\r\n return (a + b - 1) // b\r\n\r\n\r\n# co-ordinate compression\r\n# ma={s:idx for idx,s in enumerate(sorted(set(l+r)))}\r\n\r\n# mxn=100005\r\n# lrg=[0]*mxn\r\n# for start in range(2,mxn-3):\r\n# if (lrg[start]==0):\r\n# for j in range(start,mxn-3,start):\r\n# lrg[j]=start\r\n\r\ntest_count = 1\r\n\r\n\r\ndef testcase(t):\r\n global test_count\r\n for p in range(t):\r\n global test_count\r\n # print(\"Case #{}:\".format(test_count), end=\" \")\r\n solve()\r\n test_count += 1\r\n\r\n\r\ndef solve():\r\n n=N()\r\n ans=0\r\n ar=lis()\r\n s=sum(ar)\r\n mp=defaultdict(int)\r\n for i in ar:\r\n mp[i]+=1\r\n for i in range(n):\r\n x=ar[i]\r\n\r\n lc = mp[x - 1];\r\n\r\n eq = mp[x];\r\n\r\n mc = mp[x + 1];\r\n\r\n contri = (s - (n - i) * x);\r\n contri -= (lc * (x - 1) - lc * x);\r\n contri -= (eq * x - eq * x);\r\n contri -= (mc * (x + 1) - mc * x);\r\n ans += contri;\r\n s -= ar[i];\r\n mp[ar[i]] -=1;\r\n print(ans)\r\n\r\n\r\n\r\n# testcase(N())\r\nsolve()\r\n\r\n\r\n\r\n", "n = int(input())\r\nm = {}\r\nans = 0 \r\na = input().split()\r\nfor i in range(n):\r\n\ta[i] = int(a[i])\r\n\tm[a[i]],m[a[i]-1],m[a[i]+1]=0,0,0\r\n\tans += a[i]*(2*i- n+1)\r\nfor i in range(n):\r\n\tans += m[a[i]+1] - m[a[i]-1] \r\n\tm[a[i]]+=1\r\n\r\nprint(ans)", "lst = []\n \n# number of elements as input\nn = int(input());\n \n# iterating till the range\nlst = list (map (int, input ().split ()))\ndi = {0 : 0}\nss = 0\nc = 0\nan = 0\nfor x in lst :\n\tdi[x - 1] = 0\n\tdi[x + 1] = 0\n\tdi[x] = 0\nfor i in range (n - 1, -1, -1) :\n\tx = di[lst[i] - 1]\n\ty = di[lst[i] + 1]\n\tst = ss - (lst[i] - 1) * x - (lst[i] + 1) * y\n\tct = c - (x + y);\n\tan += st - lst[i] * ct\n\tss += lst[i]\n\tdi[lst[i]] += 1\n\tc += 1\nprint (an);\n", "n = int(input())\r\na = {}\r\nans = 0\r\nsum = 0\r\ni = 0\r\nfor t in map(int, input().split()):\r\n sum += t\r\n a[t] = a.get(t, 0) + 1\r\n\r\n ans += (i - a.get(t, 0) - a.get(t - 1, 0) - a.get(t + 1, 0) + 1) * t - (sum - a.get(t, 0) * t - a.get(t - 1, 0) * (t - 1) - a.get(t + 1, 0) * (t + 1))\r\n i += 1\r\n \r\nprint(ans)\r\n", "n = int(input())\na = [int(x) for x in input().split()]\n\nans, sum = 0, 0\nmp = {}\nfor i in range(n):\n ans += i * a[i] - sum\n if mp.__contains__(a[i] - 1):\n ans -= mp[a[i] - 1]\n if mp.__contains__(a[i] + 1):\n ans += mp[a[i] + 1]\n\n if mp.__contains__(a[i]):\n mp[a[i]] += 1\n else:\n mp[a[i]] = 1\n\n sum += a[i]\n\nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = {}\r\npref = 0\r\nans = 0\r\n\r\nfor i in range (n) :\r\n\tans += (i*a[i] - pref)\r\n\tt = 0;\r\n\tif a[i] - 1 in cnt:\r\n\t\tans += cnt[a[i] - 1]*(a[i] - 1)\r\n\t\tt += cnt[a[i] - 1]\r\n\tif a[i] + 1 in cnt:\r\n\t\tans += cnt[a[i] + 1]*(a[i] + 1)\r\n\t\tt += cnt[a[i] + 1]\r\n\tif a[i] in cnt:\r\n\t\tans += cnt[a[i]]*(a[i])\r\n\t\tt += cnt[a[i]]\r\n\tans -= a[i] * t;\r\n\tif a[i] in cnt:\r\n\t\tcnt[a[i]] += 1\r\n\telse:\r\n\t\tcnt[a[i]] = 1\r\n\tpref += a[i]\r\nprint(ans)\r\n\t\r\n", "\n\nn = int(input())\nans = 0;s = {}\nfor i ,a in enumerate(map(int,input().split())):\n ans += a*i - a*(n-1-i) + s.get(a+1,0) - s.get(a-1,0)\n s[a] = s.get(a,0) + 1\nprint(ans)\n \n\n\t \t \t\t\t \t\t \t \t\t \t \t \t", "n = int(input())\r\nd = {}\r\na = list(map(int,input().split()))\r\ntot = ans = 0\r\nfor i in range(n):\r\n\tans += (i * a[i] - tot)\r\n\ttot += a[i]\r\n\tans += (d.get((a[i] + 1),0) - d.get((a[i] - 1),0))\r\n\td.setdefault(a[i],0)\r\n\td[a[i]] += 1\r\nprint(ans)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nxrr = dict()\r\nans = 0\r\ns = arr[0]\r\nc = 1\r\nxrr.update({arr[0]:1})\r\nfor i in range(1,n):\r\n if(arr[i]-1 not in xrr):\r\n xrr.update({arr[i]-1:0})\r\n if(arr[i]+1 not in xrr):\r\n xrr.update({arr[i]+1:0})\r\n if(arr[i] not in xrr):\r\n xrr.update({arr[i]:0})\r\n p = s-xrr[arr[i]-1]*(arr[i]-1)-xrr[arr[i]+1]*(arr[i]+1)\r\n q = c-xrr[arr[i]-1]-xrr[arr[i]+1]\r\n ans += (q*arr[i])-p\r\n s += arr[i]\r\n c += 1\r\n xrr[arr[i]] += 1\r\nprint(ans)", "from collections import defaultdict\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = defaultdict(int)\r\nres, pref = 0, 0\r\nfor i in range(n):\r\n x, y, z = cnt[a[i] - 1], cnt[a[i]], cnt[a[i] + 1]\r\n res += a[i] * (i - (x + y + z)) - pref + (a[i] - 1) * x + a[i] * y + (a[i] + 1) * z\r\n pref += a[i]\r\n cnt[a[i]] += 1\r\nprint(res)", "n=int(input())\r\narr=list(map(int, input().split()))\r\ndict={}\r\nrawsum=0\r\na=n-1\r\nb=1\r\nfor i in range(n):\r\n if i == 0:\r\n\t rawsum = rawsum - (arr[i] * (a))\r\n\t a-=1\r\n elif i == n - 1:\r\n rawsum = rawsum + (arr[i] * (b))\r\n b+=1\r\n else:\r\n rawsum = rawsum + (arr[i] * (b))\r\n rawsum = rawsum - ((arr[i] * (a)))\r\n a-=1\r\n b+=1\r\ni=n-1\r\nwhile i>=0:\r\n if dict.get(arr[i])==None:\r\n dict[arr[i]]=1\r\n else:\r\n dict[arr[i]]=dict[arr[i]]+1\r\n s=arr[i]-1\r\n g=arr[i]+1\r\n if dict.get(s)!=None:\r\n rawsum+=dict[s]\r\n if dict.get(g)!=None:\r\n rawsum-=dict[g]\r\n i-=1\r\nprint(rawsum)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nans = 0\r\ns = 0\r\nm = {}\r\n\r\nfor i in range(n):\r\n if(a[i] + 1 not in m):\r\n m[a[i] + 1] = 0\r\n if(a[i] - 1 not in m):\r\n m[a[i] - 1] = 0\r\n ans += i * a[i] - s + m[a[i] + 1] - m[a[i] - 1]\r\n s += a[i]\r\n if(a[i] not in m):\r\n m[a[i]] = 0\r\n m[a[i]] += 1\r\nprint(ans)", "import sys\nfrom collections import defaultdict\nn = int(sys.stdin.readline())\na = list(map(int,sys.stdin.readline().split()))\nsumm = 0\nans = 0\ncnt = defaultdict(int)\nfor i in range(n-1,-1,-1):\n ans = ans+summ -(n-i-1)*a[i]+cnt[a[i]-1]-cnt[a[i]+1]\n cnt[a[i]]+=1\n summ+=a[i]\nprint(ans)\n\n \t\t\t \t \t\t \t\t \t \t\t\t\t \t \t\t\t\t", "n = int(input())\n\na = [int(x) for x in input().split()]\npsum = [0] * (n+1)\nfor i in range(n):\n\tpsum[i+1] = psum[i] + a[i]\n\nocc = dict()\nfor val in a: \n\tocc[val]=0\n\tocc[val+1]=0\n\tocc[val-1]=0\n\nans = 0\nfor i in range(n-1, -1, -1):\n\ts = psum[n]-psum[i]\n\ts -= (n-i)*a[i]\n\n\ts += occ[a[i]-1]\n\ts -= occ[a[i]+1]\n\n\tans += s\n\tocc[a[i]] += 1\n\nprint(ans)\n", "from collections import Counter\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = 0\r\nc = Counter()\r\nfor i in range(n):\r\n s += c[a[i] + 1] - c[a[i] - 1] + a[i] * (2 * i + 1 - n)\r\n c[a[i]] += 1\r\nprint(s)# 1691178605.6259003", "# LUOGU_RID: 100502881\nn = int(input())\r\na = list(map(int, input().split()))\r\nmp = {}\r\nfor i in range(n): mp[a[i]] = mp[a[i] + 1] = mp[a[i] - 1] = 0\r\nans = 0\r\nfor i in range(n):\r\n ans += (2 * i - n + 1) * a[i]\r\n ans += mp[a[i] + 1]\r\n ans -= mp[a[i] - 1]\r\n mp[a[i]] += 1\r\nprint(ans)", "n = int(input())\nm = dict()\nline = list(map(int,input().split()))\nsu = 0\nans = 0\nfor i in range(n):\n d = line[i]\n ans -= su - d * i\n for j in range(-1,2):\n if (d+j) in m:\n ans += m[d+j] * j\n su += d\n if d in m:\n m[d] += 1\n else:\n m[d] = 1\n\nprint(ans)\n", "n = int(input())\r\nkeys = list(map(int, input().split()))\r\ndictionary = {}\r\n\r\nans = 0\r\nsum = 0\r\nfor i in range(0, n):\r\n key = keys[i]\r\n a = dictionary.get(key - 1)\r\n b = dictionary.get(key)\r\n c = dictionary.get(key + 1)\r\n if a == None: a = 0\r\n if b == None: b = 0\r\n if c == None: c = 0\r\n ans += key * (i - a - b - c) - (sum - a * (key - 1) - b * key - c * (key + 1))\r\n sum += key\r\n if dictionary.get(key) == None:\r\n dictionary[key] = 1\r\n else:\r\n dictionary[key] += 1\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = {}\r\nans = 0\r\nsm = 0\r\ni = n - 1\r\nwhile i >= 0:\r\n if i != n - 1:\r\n ans = ans + sm - a[i] * (n - i - 1)\r\n if a[i] - 1 in cnt:\r\n ans = ans + cnt[a[i] - 1]\r\n if a[i] + 1 in cnt:\r\n ans = ans - cnt[a[i] + 1]\r\n sm = sm + a[i]\r\n if a[i] in cnt:\r\n cnt[a[i]] = cnt[a[i]] + 1\r\n else:\r\n cnt[a[i]] = 1\r\n i = i - 1\r\n\r\nprint(ans)", "from sys import stdin,stdout\nn=int(stdin.readline())\nA=[int(x)for x in stdin.readline().split()]\nMap={}\ns=0\npres=0\nfor index,element in enumerate(A):\n s+=element*index-pres\n pres+=element\n if (element-1) in Map:\n s-=Map[element-1]\n if (element+1) in Map:\n s+=Map[element+1]\n if element in Map:\n Map[element]+=1\n else :Map[element]=1\nstdout.write(\"%d\"%s)\n\t\t\t\t\t \t\t \t \t \t\t \t\t\t \t \t\t \t\t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = 0\r\nret = 0\r\nmp = {}\r\nfor i in range(len(a)):\r\n ret += a[i] * i - s\r\n if a[i] - 1 in mp:ret -= mp[a[i] - 1]\r\n if a[i] + 1 in mp:ret += mp[a[i] + 1]\r\n if a[i] in mp:mp[a[i]] += 1\r\n else: mp[a[i]] = 1\r\n s += a[i]\r\nprint(ret) ", "from collections import defaultdict\nn = int(input())\na = map(int, input().split())\nm = defaultdict(lambda: 0)\nans, total = 0, 0\nfor i, num in enumerate(a):\n ans -= total\n ans += i * num\n ans -= m[num-1]\n ans += m[num+1]\n m[num] += 1\n total += num\nprint (ans)", "from collections import Counter\r\nmp = Counter()\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\ntot , cnt, ans = 0, 0, 0\r\nfor i in arr:\r\n\tncnt = cnt - mp[i] - mp[i+1] - mp[i-1]\r\n\tntot = tot - (i * mp[i]) - ((i-1)*mp[i-1]) - ((i+1)*mp[i+1])\r\n\tnsum = (ncnt * i) - ntot\r\n\tans += nsum\r\n\tmp[i] += 1\r\n\tcnt += 1\r\n\ttot += i\r\nprint(ans)\r\n", "class segtree():\r\n def __init__(self,init,func,ide):\r\n self.n=len(init)\r\n self.func=func\r\n self.ide=ide\r\n self.size=1<<(self.n-1).bit_length()\r\n self.tree=[self.ide for i in range(2*self.size)]\r\n for i in range(self.n):\r\n self.tree[self.size+i]=init[i]\r\n for i in range(self.size-1,0,-1):\r\n self.tree[i]=self.func(self.tree[2*i], self.tree[2*i|1])\r\n \r\n def update(self,k,x):\r\n k+=self.size\r\n self.tree[k]=x\r\n k>>=1\r\n while k:\r\n self.tree[k]=self.func(self.tree[2*k],self.tree[k*2|1])\r\n k>>=1\r\n \r\n def get(self,i):\r\n return self.tree[i+self.size]\r\n \r\n def query(self,l,r):\r\n l+=self.size\r\n r+=self.size\r\n l_res=self.ide\r\n r_res=self.ide\r\n while l<r:\r\n if l&1:\r\n l_res=self.func(l_res,self.tree[l])\r\n l+=1\r\n if r&1:\r\n r-=1\r\n r_res=self.func(self.tree[r],r_res)\r\n l>>=1\r\n r>>=1\r\n return self.func(l_res,r_res)\r\n \r\n def debug(self,s=10):\r\n print([self.get(i) for i in range(min(self.n,s))])\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=set()\r\nfor i in a:\r\n s.add(i-1)\r\n s.add(i)\r\n s.add(i+1)\r\ns=sorted(list(s))\r\nm=len(s)\r\nd={}\r\nfor i in range(m):\r\n d[s[i]]=i\r\n\r\ndef op(x,y):return x+y\r\nseg1=segtree([0]*m,op,0)\r\nseg2=segtree([0]*m,op,0)\r\nans=0\r\nfor i in range(n):\r\n j=d[a[i]]\r\n ans+=seg1.query(0,j-1)*a[i]-seg2.query(0,j-1)\r\n ans+=seg1.query(j+2,m)*a[i]-seg2.query(j+2,m)\r\n seg1.update(j,seg1.get(j)+1)\r\n seg2.update(j,seg2.get(j)+a[i])\r\n\r\nprint(ans)", "n = int(input())\r\narr = [int(e) for e in input().split()]\r\nm={}\r\nfor i in arr:\r\n if i not in m:\r\n m[i] = 0\r\n m[i] += 1\r\nans = 0\r\nf = {}\r\nfor i in range(n):\r\n tot = n\r\n left = i\r\n right = n-i-1\r\n if arr[i] not in f:\r\n f[arr[i]] = 0\r\n if (arr[i]+1) not in f:\r\n f[arr[i]+1] = 0\r\n if (arr[i]-1) not in f:\r\n f[arr[i]-1] = 0\r\n if arr[i] not in m:\r\n m[arr[i]] = 0\r\n if (arr[i]+1) not in m:\r\n m[arr[i]+1] = 0\r\n if (arr[i]-1) not in m:\r\n m[arr[i]-1] = 0\r\n left -= f.get(arr[i])\r\n left -= f.get(arr[i]-1)\r\n left -= f.get(arr[i]+1)\r\n f[arr[i]] += 1\r\n right -= (m.get(arr[i])-f.get(arr[i]))\r\n right -= (m.get(arr[i]+1)-f.get(arr[i]+1))\r\n right -= (m.get(arr[i]-1)-f.get(arr[i]-1))\r\n ans += (left*arr[i] - right*arr[i])\r\nprint(ans)", "n = int(input())\r\nlst = input().split()\r\nlst = [int(x) for x in lst]\r\nans = 0\r\ncnt = {}\r\nfor i,e in enumerate(lst):\r\n ans += (2*i+1-n)*e\r\n cnt[e] = 0\r\n\r\nfor e in lst:\r\n if e-1 in cnt.keys():\r\n ans -= cnt[e-1]\r\n if e+1 in cnt.keys():\r\n ans += cnt[e+1]\r\n cnt[e]+=1\r\nprint(ans)", "from collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nresult, count = 0, Counter()\r\nfor i in range(n):\r\n result += (2 * i - n + 1) * a[i] - count[a[i] - 1] + count[a[i] + 1]\r\n count[a[i]] += 1\r\nprint(result)\r\n", "import sys\ninput = sys.stdin.readline\n\ndef readList():\n return list(map(int, input().split()))\ndef readInt():\n return int(input())\ndef readInts():\n return map(int, input().split())\ndef readStr():\n return input().strip()\n\nclass BIT:\n def __init__(self, n):\n self.bit = [0] * (n + 1)\n self.n = n\n\n def update(self, idx, val):\n idx += 1\n while idx <= self.n:\n self.bit[idx] += val\n idx += idx & (-idx)\n\n def prefixSum(self, idx):\n idx += 1\n ans = 0\n while idx > 0:\n ans += self.bit[idx]\n idx -= idx & (-idx)\n return ans\n\n def rangeSum(self, l, r):\n return self.prefixSum(r) - self.prefixSum(l-1)\n\n# BF, EC, DB, CC, CL\ndef solve():\n n, arr = readInt(), readList()\n v2i = {}\n idx = 0\n a = sorted(list(set(arr)))\n for v in a:\n for d in [-1, 0, 1]:\n if v + d not in v2i:\n v2i[v+d] = idx\n idx += 1\n\n ans = 0\n m = len(a)\n ftf, ftv = BIT(idx), BIT(idx)\n S = f = 0\n for v in arr:\n idx = v2i[v]\n cnt0, v0 = ftf.prefixSum(idx+1) - ftf.rangeSum(idx-1, idx+1), ftv.prefixSum(idx+1) - ftv.rangeSum(idx-1, idx+1)\n ans += cnt0 * v - v0\n cnt1, v1 = ftf.prefixSum(idx+1) - f, ftv.prefixSum(idx+1) - S\n ans += v1 - cnt1 * v\n ftf.update(idx, 1)\n ftv.update(idx, v)\n S += v\n f += 1\n return ans\n\nprint(solve())", "n = int(input())\r\nq = dict()\r\na = input().split()\r\na = map(int, a)\r\nsum = 0\r\nans = 0\r\ni = 0\r\nfor x in a:\r\n i += 1\r\n if((x + 1) not in q):\r\n q[x + 1] = 0\r\n if((x - 1) not in q):\r\n q[x - 1] = 0\r\n if(x not in q):\r\n q[x] = 0\r\n \r\n q[x] += 1\r\n sum += x\r\n col = i - q[x] - q[x + 1] - q[x - 1]\r\n sm = sum - q[x] * x - q[x + 1] * (x + 1) - q[x - 1] * (x - 1)\r\n ans += col * x - sm\r\n\r\nprint(ans)", "# void solve(int testID) {\r\n# \tDBGn(testID);\r\n# \tint n; cin >> n;\r\n# \tauto a = readInput<int>(n);\r\n# \tmap<int,pair<int,Int>> tree; //<count, sum>\r\n# \tInt sumAll = 0;\r\n# \tInt ans = 0;\r\n# \tfor (int i = n-1; i >= 0; i--) {\r\n# \t\tInt sum = sumAll - \r\n# \t\t\t(tree[a[i]].second + tree[a[i]-1].second + tree[a[i]+1].second);\r\n# \t\tint cnt = (n-1-i) -\r\n# \t\t\t(tree[a[i]].first + tree[a[i]-1].first + tree[a[i]+1].first);\r\n# \t\tans += sum - 1ll * cnt * a[i];\r\n# \t\tsumAll += a[i];\r\n# \t\ttree[a[i]].first++, tree[a[i]].second += a[i];\r\n# \t}\r\n# \tcout << ans;\r\n# }\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nhmap = {}\r\nfor x in a:\r\n\tfor i in [x-1,x,x+1]:\r\n\t\thmap[i] = [0,0]\r\n\r\na = reversed(a)\r\nans = 0\r\nsumAll = 0\r\ncntAll = 0\r\nfor x in a:\r\n\tsumBefore = sumAll\r\n\tcnt = cntAll\r\n\tfor i in [x-1,x,x+1]:\r\n\t\tcnt -= hmap[i][0]\r\n\t\tsumBefore -= hmap[i][1]\r\n\tans += sumBefore - cnt * x\r\n\thmap[x][0] += 1\r\n\thmap[x][1] += x\r\n\tcntAll += 1\r\n\tsumAll += x\r\n\r\nprint(ans)", "# problem: https://codeforces.com/contest/903/problem/D\r\n# idea: https://www.programmersought.com/article/86646430026/\r\n# import numpy as np\r\n\r\n\r\n# def almost_difference():\r\n# n = int(input())\r\n# if n == 1:\r\n# return 0\r\n# # n = 5\r\n# # array = [1,2,3,1,3]\r\n# # n = 4\r\n# # array = [6,6,4,4]\r\n# x = np.zeros(1000000)\r\n# # int from 1... -> 10^9\r\n# # normal array declaration took over 3s. so used array from numpy\r\n# count_equal = np.zeros(10**9+1)\r\n# array = [int(el) for el in input().split()]\r\n# ad_sum = 0\r\n# prev_sum = 0\r\n# for i in range(n):\r\n# # formula from the: https://www.programmersought.com/article/86646430026/\r\n# ad_sum = ad_sum + i * array[i] - prev_sum +count_equal[array[i]+1] - count_equal[array[i]-1]\r\n# count_equal[array[i]] += 1\r\n# prev_sum += array[i]\r\n \r\n# return ad_sum\r\n \r\n \r\n# print(almost_difference())\r\n\r\n\r\n\r\ndef almost_difference():\r\n n = int(input())\r\n if n == 1:\r\n return 0\r\n # n = 5\r\n # array = [1,2,3,1,3]\r\n # n = 4\r\n # array = [6,6,4,4]\r\n # x = np.zeros(1000000)\r\n # int from 1... -> 10^9\r\n # normal array declaration took over 3s. so used array from numpy\r\n dict_equal = dict()\r\n array = [int(el) for el in input().split()]\r\n ad_sum = 0\r\n prev_sum = 0\r\n for i in range(n):\r\n if not array[i] in dict_equal.keys():\r\n dict_equal[array[i]] = 0\r\n if not array[i]-1 in dict_equal.keys():\r\n dict_equal[array[i]-1] = 0\r\n if not array[i]+1 in dict_equal.keys():\r\n dict_equal[array[i]+1] = 0\r\n\r\n # formula from the: https://www.programmersought.com/article/86646430026/\r\n ad_sum = ad_sum + i * array[i] - prev_sum +dict_equal[array[i]+1] - dict_equal[array[i]-1]\r\n dict_equal[array[i]] += 1\r\n prev_sum += array[i]\r\n \r\n return ad_sum\r\n\r\nprint(almost_difference())\r\n", "n = int(input())\r\nar = list(map(int, input().split()))\r\nrev = ar[::-1]\r\nfrom collections import Counter\r\ndef d(ar):\r\n\tme = Counter()\r\n\ts = 0 \r\n\tfor i in range (n) : \r\n\t\ts+=(i*ar[i])\r\n\t\ts-=(me[ar[i]] + me[ar[i]+1]*ar[i] + me[ar[i]-1]*ar[i])\r\n\t\tme[ar[i]]+=1\r\n\treturn s\r\nprint(d(ar) - d(rev))", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\ns = a[0]\r\nf = {a[0]: 1}\r\nfor i in range(1, n):\r\n if a[i] in f: f[a[i]] += 1\r\n else: f[a[i]] = 1\r\n ans += i*a[i]-s\r\n s += a[i]\r\n if a[i]+1 in f:\r\n ans += f[a[i]+1]\r\n if a[i]-1 in f:\r\n ans -= f[a[i]-1]\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=dict()\r\nsu=0\r\nans=0\r\nfor i in range(n):\r\n if l[i] in d:\r\n d[l[i]]+=1\r\n else:\r\n d.update({l[i]:1})\r\n c=0\r\n c1=0\r\n j=l[i]\r\n if j+1 in d:\r\n c=d[j+1]\r\n if j-1 in d:\r\n c1=d[j-1]\r\n ans+=(i)*l[i]-su+c-c1\r\n su+=l[i]\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nd1 = dict()\r\ns = 0\r\nfor i in range(n):\r\n d1[a[i]] = d1.get(a[i], 0) + 1\r\n s += a[i]\r\np = 0\r\nans = 0\r\nd2 = dict()\r\nfor i in range(n):\r\n d2[a[i]] = d2.get(a[i], 0) + 1\r\n p += a[i]\r\n k1 = d1.get(a[i] - 1, 0) - d2.get(a[i] - 1, 0)\r\n k2 = d1.get(a[i], 0) - d2.get(a[i], 0)\r\n k3 = d1.get(a[i] + 1, 0) - d2.get(a[i] + 1, 0)\r\n k = n - i - 1 - k1 - k2 - k3\r\n ans += (s - p - (a[i] - 1) * k1 - a[i] * k2 - (a[i] + 1) * k3) - k * a[i]\r\n \r\nprint(ans)", "t=int(input())\r\na=input().split(' ')\r\nsum=[]\r\ncurr=0\r\ndic={}\r\nsum.append(0)\r\nfor i in a:\r\n curr=curr+int(i)\r\n sum.append(curr)\r\n if i in dic:\r\n p=dic[i]\r\n p=p+1\r\n dic[i]=p\r\n else:\r\n dic[i]=1\r\n\r\nans=0\r\nfor i in range(1,t+1):\r\n ans=ans+sum[t]-sum[i]-int((t-int(i)))*int(a[i-1])\r\n p1=str(int(a[i-1])+1)\r\n p2=str(int(a[i-1])-1)\r\n if str(p1) in dic:\r\n ans=ans-int(dic[str(int(a[i-1])+1)])\r\n if str(p2) in dic:\r\n ans=ans+int(dic[str(int(a[i-1])-1)])\r\n p=dic[a[i-1]]\r\n p=p-1\r\n dic[a[i-1]]=p\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nsum = 0\r\nmp = {}\r\nfor i in range(n):\r\n x = a[i]\r\n ans += (x * i) - sum;\r\n ans -= (mp.get(x - 1, 0));\r\n ans -= (-mp.get(x + 1, 0));\r\n mp[x] = mp.get(x, 0) + 1;\r\n sum += x;\r\nprint(ans)", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nx=dc(int)\r\ny=dc(int)\r\nz=dc(int)\r\np=dc(int)\r\nq=dc(int)\r\nr=dc(int)\r\nx[l[-1]]+=1\r\ny[l[-1]]+=1\r\nz[l[-1]]+=1\r\nfor i in range(n-2,-1,-1):\r\n p[i]=x[l[i]]\r\n q[i]=y[l[i]+1]\r\n r[i]=z[l[i]-1]\r\n x[l[i]]+=1\r\n y[l[i]]+=1\r\n z[l[i]]+=1\r\n#print(p)\r\n#print(q)\r\n#print(r)\r\nx=[0]*n\r\nfor i in range(n-2,-1,-1):\r\n x[i]=l[i+1]+x[i+1]\r\n#print(x)\r\ns=0\r\nfor i in range(n-2,-1,-1):\r\n #print(x[i],p[i]*l[i],q[i]*(l[i]+1),r[i]*(l[i]-1))\r\n c=x[i]-(p[i]*l[i])-(q[i]*(l[i]+1))-(r[i]*(l[i]-1))\r\n d=n-i-1-p[i]-q[i]-r[i]\r\n e=c-l[i]*d\r\n #print(i,c,d,e)\r\n s+=e\r\nprint(s)", "'''\r\n Python3(PyPy3) Template for Programming-Contest.\r\n'''\r\n\r\nimport sys\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # LDRU\r\nmod = 998244353\r\ninf = 1 << 64\r\n\r\n\r\ndef slv():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n from collections import defaultdict\r\n ans, presum = 0, 0\r\n for i in range(n):\r\n presum += a[i]\r\n ans += (i + 1) * a[i] - presum\r\n mp = defaultdict(int)\r\n for i in range(n):\r\n mp[a[i]] += 1\r\n ans -= mp[a[i] - 1]\r\n ans += mp[a[i] + 1]\r\n print(ans)\r\n return\r\n\r\n\r\ndef main():\r\n testcase = 1\r\n #testcase = int(input())\r\n for _ in range(testcase):\r\n slv()\r\n return 0\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\na = input()\na = a.split(' ');\nfor i in range(n):\n\ta[i]= int(a[i])\n\ncnt={}\ncnt[a[0]] = 1;\ns,ans = a[0],0 \n\nfor i in range(1,n):\n\tbg , sm , eq = 0, 0, 0\n\tif (a[i] + 1) in cnt:\n\t\tbg = cnt[a[i]+1]\n\tif a[i] in cnt:\n\t\teq = cnt[a[i]]\n\tif (a[i]-1) in cnt:\n\t\tsm = cnt[a[i]-1]\n\tval = s - bg * (a[i]+1) - sm*(a[i]-1) -eq*a[i]\n\tans += (i - bg-sm-eq)*a[i] - val\n\ts += a[i]\n\tif a[i] in cnt:\n\t\tcnt[a[i]]+=1\n\telse:\n\t\tcnt[a[i]]=1\n\nprint(ans)\n\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfrom collections import defaultdict\r\nd = defaultdict(lambda : 0)\r\n\r\nans = 0\r\ns = 0;\r\nfor i in range(n):\r\n e = a[i]\r\n prev = i - d[e] - d[e - 1] - d[e + 1]\r\n ans += e * prev - s + d[e] * e + d[e - 1] * (e - 1) + d[e + 1] * (e + 1)\r\n d[e] += 1\r\n s += e\r\n\r\n\r\nprint(ans)\r\n", "import sys\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nleft, right = Counter(), Counter(a)\r\nans = 0\r\n\r\nfor l, r, x in zip(range(n), range(n-1, -1, -1), a):\r\n right[x] -= 1\r\n l_cnt = l - left[x+1] - left[x] - left[x-1]\r\n r_cnt = r - right[x+1] - right[x] - right[x-1]\r\n\r\n ans += x * (l_cnt - r_cnt)\r\n\r\n left[x] += 1\r\n\r\nprint(ans)\r\n", "from collections import defaultdict as dd\r\nfrom collections import deque\r\nimport bisect\r\nimport heapq\r\n\r\ndef ri():\r\n return int(input())\r\n\r\ndef rl():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n = ri()\r\n A = rl()\r\n ans = 0\r\n prev = 0\r\n count = dd(int)\r\n for i in range(n):\r\n a = A[i]\r\n ans += a * i\r\n ans -= prev\r\n prev += A[i]\r\n ans -= count[a-1]\r\n ans += count[a+1]\r\n count[a] += 1\r\n print (ans)\r\n\r\n\r\nmode = 's'\r\n\r\nif mode == 'T':\r\n t = ri()\r\n for i in range(t):\r\n solve()\r\nelse:\r\n solve()\r\n", "n = int(input())\r\nssum = 0\r\nfans = 0\r\nmp = {0:0}\r\na = list(map(int, input().strip().split()))[:n]\r\n\r\ndef find(x):\r\n if mp.get(x): \r\n return mp[x]\r\n else:\r\n return 0\r\n \r\nfor i in range(n):\r\n if not mp.get(a[i]): \r\n mp[a[i]] = 0\r\n mp[a[i]] += 1\r\n fans += i * a[i] - ssum + find(a[i] + 1) - find(a[i] - 1)\r\n ssum += a[i]\r\nprint(fans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ncnt = dict()\r\nans = 0\r\ns=0\r\nfor i in range(n):\r\n s+=a[i]\r\n if a[i] in cnt:\r\n cnt[a[i]]+=1\r\n else:\r\n cnt[a[i]]=1\r\n d=i+1 - cnt.get(a[i],0) - cnt.get(a[i]-1,0) - cnt.get(a[i]+1,0)\r\n wen=d*a[i] - s + a[i]*cnt.get(a[i],0) + (a[i]+1)*cnt.get(a[i]+1,0) + (a[i]-1)*cnt.get(a[i]-1,0)\r\n ans+=wen\r\nprint(ans)\r\n \r\n", "n = int(input())\nssum = 0\nfans = 0\nmp = {0:0}\na = list(map(int, input().split()))\n \ndef find(x):\n if mp.get(x): \n return mp[x]\n else:\n return 0\n \nfor i in range(n):\n if not mp.get(a[i]): \n mp[a[i]] = 0\n mp[a[i]] += 1\n fans += i * a[i] - ssum + find(a[i] + 1) - find(a[i] - 1)\n ssum += a[i]\nprint(fans)\n", "from collections import defaultdict\r\nn = int(input());\r\na = [int(i) for i in input().split(\" \")]\r\nans = 0\r\ns = 0;\r\ncnt = defaultdict(int);\r\nfor i in range(n):\r\n\tans += a[i] * (i - cnt[a[i]] - cnt[a[i]-1] - cnt[a[i]+1]);\r\n\tcnt[a[i]]+=1\r\na = a[::-1]\r\ncnt = defaultdict(int);\r\nfor i in range(n):\r\n\tans -= a[i] * (i - cnt[a[i]] - cnt[a[i]-1] - cnt[a[i]+1]);\r\n\tcnt[a[i]]+=1\r\nprint(str(ans));", "\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\ncnt = 0;\r\nm = dict()\r\ns = 0\r\nans = 0\r\n\r\nfor i in a:\r\n\tm[i] = 0\r\n\tm[i - 1] = 0\r\n\tm[i + 1] = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n\tans += s - cnt * a[i];\r\n\tfor j in range(-1, 2):\r\n\t\tans -= m[a[i] + j] * ((a[i] + j) - a[i]);\r\n\t# // dbg(i, ans);\r\n\ts += a[i];\r\n\tm[a[i]] += 1;\r\n\tcnt += 1;\r\n\r\nprint(ans)\r\n\r\n# // 9 999 999 990 000 000 000", "def update(fenwick, idx, val, n):\r\n while idx<n:\r\n fenwick[idx]+=val\r\n idx+=(idx & (-idx))\r\n\r\ndef get_sum(fenwick, idx):\r\n sum=0\r\n while idx>0:\r\n sum+=fenwick[idx]\r\n idx-=(idx & (-idx))\r\n return sum\r\n\r\ndef count_smaller_elements(arr):\r\n temp=arr.copy()\r\n temp.sort()\r\n curr_size=1\r\n Hashed_Value={}\r\n ## Hashing values so that we can implement fenwick of size N instead of size Max Value\r\n for item in temp:\r\n if item not in Hashed_Value:\r\n Hashed_Value[item]=curr_size\r\n curr_size+=1\r\n \r\n fenwick=[0]*(curr_size)\r\n \r\n for i in range(n):\r\n temp[i]=Hashed_Value[arr[i]]\r\n temp=temp[::-1]\r\n count_smaller=[0]*n\r\n \r\n for i in range(n):\r\n count_smaller[i]=get_sum(fenwick, temp[i]-1)\r\n update(fenwick, temp[i] , 1 ,curr_size)\r\n return count_smaller[::-1]\r\n\r\n\r\n\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nd1={}\r\nans=0\r\nfor i in range(-1,-n-1,-1):\r\n if l1[i] not in d1:\r\n ans-=l1[i]*(abs(i)-1)\r\n else :\r\n ans-=(l1[i])*(abs(i)-1-d1[l1[i]])\r\n if l1[i] not in d1:\r\n d1[l1[i]]=1\r\n else :\r\n d1[l1[i]]+=1\r\nd1={}\r\n\r\nfor i in range(n):\r\n if l1[i] not in d1:\r\n ans+=l1[i]*i\r\n else :\r\n ans+=l1[i]*(i-d1[l1[i]])\r\n if l1[i] not in d1:\r\n d1[l1[i]]=1\r\n else :\r\n d1[l1[i]]+=1\r\n\r\nfor item in l1:\r\n if item-1 in d1:\r\n ans-=d1[item-1]\r\n if item+1 in d1:\r\n ans+=d1[item+1]\r\n if item not in d1:\r\n d1[item]=1\r\n else :\r\n d1[item]+=1\r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nf = {}\r\nfor x in a:\r\n f[x] = 0\r\n f[x+1] = 0\r\n f[x-1] = 0\r\n \r\nans = 0\r\nfor i in range(n):\r\n ans += (2 * i - n + 1) * a[i]\r\n f[a[i]] += 1\r\n ans += f[a[i]+1]\r\n ans -= f[a[i]-1]\r\n \r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nans = 0\r\nfor i in range(n) :\r\n\tx = a[i]\r\n\tans = ans + x * (2 * i + 1 - n)\r\n\r\nmp = dict()\r\n\r\nfor x in a : \r\n\tif x - 1 in mp : \r\n\t\tans -= mp[x - 1]\r\n\tif x + 1 in mp :\r\n\t\tans += mp[x + 1]\r\n\tif x in mp :\r\n\t\tmp[x] += 1\r\n\telse :\r\n\t\tmp[x] = 1\r\n\r\nprint(ans)", "import bisect\r\n\r\ndef list_output(s): \r\n print(' '.join(map(str, s)))\r\n \r\ndef list_input(s='int'):\r\n if s == 'int':\r\n return list(map(int, input().split())) \r\n elif s == 'float':\r\n return list(map(float, input().split()))\r\n return list(map(str, input().split()))\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nh = dict()\r\n\r\ntot = 0\r\nmul = -(n-1)\r\nfor i in range(n):\r\n tot += mul * a[i]\r\n mul += 2\r\n\r\nfor i in range(n):\r\n if a[i] in h:\r\n h[a[i]] += 1\r\n else:\r\n h[a[i]] = 1\r\n if a[i]-1 in h:\r\n tot -= h[a[i]-1]\r\n if a[i]+1 in h:\r\n tot += h[a[i]+1]\r\nprint(tot)", "\r\n'''\r\n int n;\r\n cin >> n;\r\n\r\n int sum = 0;\r\n map<int, int> mp;\r\n BigInt ans;\r\n for(int i = 1; i <= n; i++) {\r\n cin >> arr[i];\r\n sum += arr[i];\r\n \r\n mp[arr[i]]++;\r\n // fix each element as y\r\n ll adj = mp[arr[i]] + mp[arr[i]+1] + mp[arr[i]-1];\r\n\r\n ll c = sum;\r\n c -= mp[arr[i]]*arr[i];\r\n c -= mp[arr[i]+1] * (arr[i]+1);\r\n c -= mp[arr[i]-1] * (arr[i]-1);\r\n\r\n ll valid = i - adj;\r\n ans += ((ll)valid*(ll)arr[i])-c;\r\n }\r\n\r\n cout << ans << endl;\r\n '''\r\n\r\nn = int(input())\r\n\r\na = map(int, input().split())\r\nmp = {}\r\ns = 0\r\nans = 0\r\ni = 0\r\nfor x in a:\r\n i += 1\r\n s += x\r\n\r\n if x not in mp:\r\n mp[x] = 0\r\n\r\n if x+1 not in mp:\r\n mp[x+1] = 0\r\n\r\n if x-1 not in mp:\r\n mp[x-1] = 0\r\n mp[x] += 1\r\n\r\n adj = mp[x] + mp[x+1] + mp[x-1];\r\n c = s;\r\n c -= mp[x]*x;\r\n c -= mp[x+1] * (x+1);\r\n c -= mp[x-1] * (x-1);\r\n\r\n valid = i-adj\r\n\r\n ans += (valid*x)-c\r\n\r\nprint(ans)", "n = int(input())\nm = {}\nans = 0 \na = input().split()\nfor i in range(n):\n\ta[i] = int(a[i])\n\tm[a[i]],m[a[i]-1],m[a[i]+1]=0,0,0\n\tans += a[i]*(2*i- n+1)\nfor i in range(n):\n\tans += m[a[i]+1] - m[a[i]-1] \n\tm[a[i]]+=1\n\nprint(ans)\n \t \t \t \t \t\t\t\t\t \t \t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\nprefix=[0 for i in range(n)] \r\nans = 0\r\n\r\nd = {}\r\nd[a[n-1]] = 1\r\n\r\nfor i in range(n-2,-1,-1):\r\n if(i==n-2):\r\n prefix[i] = a[i+1]-a[i]\r\n else:\r\n prefix[i] = prefix[i + 1] + (n - 1 - i) * (a[i + 1] - a[i])\r\n ans += prefix[i]\r\n if(a[i]-1 in d):\r\n ans += d[a[i] - 1]\r\n if(a[i]+1 in d):\r\n ans -= d[a[i] + 1]\r\n if(a[i] not in d):\r\n d[a[i]] = 1\r\n else:\r\n d[a[i]] += 1\r\n\r\nprint(ans)", "n = int(input())\ntot = 0\nans = 0\ncnt = {}\na = list(map(int, input().split()))\nfor i in range(1, n + 1):\n x = a[i - 1] \n ans += (i - 1) * x - tot\n if (x - 1) in cnt:\n ans -= cnt[x - 1]\n if (x + 1) in cnt:\n ans += cnt[x + 1]\n if x in cnt:\n cnt[x] += 1\n else:\n cnt[x] = 1\n tot += x\nprint(ans)\n", "n = int(input())\narr = list(map(int, input().split()))\nans = 0\nsum = 0\nd = {}\nfor i in range(0, n):\n x = d[arr[i] + 1] if (arr[i] + 1) in d else 0\n y = d[arr[i] - 1] if (arr[i] - 1) in d else 0\n ans += i * arr[i] - sum + x - y \n\n if not arr[i] in d:\n d[arr[i]] = 0\n d[arr[i]] += 1\n sum += arr[i]\n\nprint(ans)\n\n", "class BIT():\n \"\"\"一点加算、区間取得クエリをそれぞれO(logN)で答える\n add: i番目にvalを加える\n get_sum: 区間[l, r)の和を求める\n i, l, rは0-indexed\n \"\"\"\n def __init__(self, n):\n self.n = n\n self.bit = [0] * (n + 1)\n\n def _sum(self, i):\n s = 0\n while i > 0:\n s += self.bit[i]\n i -= i & -i\n return s\n\n def add(self, i, val):\n \"\"\"i番目にvalを加える\"\"\"\n i = i + 1\n while i <= self.n:\n self.bit[i] += val\n i += i & -i\n\n def get_sum(self, l, r):\n \"\"\"区間[l, r)の和を求める\"\"\"\n return self._sum(r) - self._sum(l)\n\n\n \n\ndef add1(ind_li, val):\n for i in ind_li:\n st.add(i, val)\n\ndef cnt1(ind_li):\n for i in ind_li:\n cnt.add(i, 1)\n\ndef calc(ind_li, val):\n res = 0\n for i in ind_li:\n res1 = st.get_sum(0, i) - val * cnt.get_sum(0, i)\n res2 = st.get_sum(i+1, n) - val * cnt.get_sum(i+1, n)\n res += res2 - res1\n return res\n \nn = int(input())\na = list(map(int, input().split()))\nst = BIT(n)\ncnt = BIT(n)\n\nb = sorted(zip(a, range(len(a))))\nb = b + [(b[-1][0] + 1, b[-1][1])]\nprev = 0\nnow = b[0][0]\ntmp_now = []\ntmp_prev = []\nans = 0\n\nfor i in range(n+1):\n if now == b[i][0]:\n tmp_now.append(b[i][1])\n continue\n if prev + 1 == now:\n # 計算する\n ans += calc(tmp_now, now)\n # prevを追加する\n add1(tmp_prev, prev)\n cnt1(tmp_prev)\n else:\n # prevを追加する\n add1(tmp_prev, prev)\n cnt1(tmp_prev)\n # 計算する\n ans += calc(tmp_now, now)\n prev = now\n tmp_prev = tmp_now[0:]\n tmp_now = [b[i][1]]\n now = b[i][0]\n \nprint(ans)\n\n \t\t \t\t \t\t \t\t \t \t\t \t\t\t", "a=int(input())\narr=list(map(int,input().split()))\nd=dict()\nsumm=[0]\nbrr=arr\nnd=dict()\nmimpp=dict()\nmimpn=dict()\nfor i in arr:\n summ.append(i+summ[len(summ)-1])\n if(i in d):\n d[i]=d[i]+1\n else:\n d[i]=1\nfor i in range(0,len(brr)):\n if(brr[i] in nd):\n nd[brr[i]]=nd[brr[i]]+1\n else:\n nd[brr[i]]=1\n mimpn[i]=0\n mimpp[i]=0\n if(brr[i]-1 in d):\n mimpn[i]=mimpn[i]+d[brr[i]-1]\n if(brr[i]+1 in d):\n mimpp[i]=mimpp[i]+d[brr[i]+1]\n if(brr[i]-1 in nd):\n mimpn[i]=mimpn[i]-nd[brr[i]-1]\n if(brr[i]+1 in nd):\n mimpp[i]=mimpp[i]-nd[brr[i]+1]\n \nans=0\nind=0\nsu=sum(arr)\nfor i in range(0,len(arr)):\n ans=ans+su-summ[ind]-(a-ind)*arr[i]\n ans=ans+mimpn[i] \n ans=ans-mimpp[i] \n ind=ind+1 \nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm={}\r\nfor i in a:\r\n if m.get(i):\r\n m[i]+=1\r\n else:\r\n m[i]=1\r\nres=sum(a)\r\nans=0\r\nfor i in range(n):\r\n n1,n2,n3=0,0,0\r\n m[a[i]]-=1\r\n res-=a[i]\r\n if m.get(a[i]-1):\r\n n1+=m.get(a[i]-1)\r\n if m.get(a[i]):\r\n n2 += m.get(a[i])\r\n if m.get(a[i]+1):\r\n n3 += m.get(a[i]+1)\r\n w=n1*(a[i]-1)+n2*a[i]+n3*(a[i]+1)\r\n ans+=res-w-(n-i-1-n1-n2-n3)*a[i]\r\nprint(ans)\r\n ", "n = int(input())\r\na = list(map(int,input().strip().split()))[:n]\r\n\r\na.reverse()\r\n\r\nans = 0\r\nsm = 0\r\nmp = {}\r\n\r\nfor i in range(n):\r\n plus_one_cnt = mp.get(a[i]+1, 0)\r\n minus_one_cnt = mp.get(a[i]-1, 0)\r\n act_cnt = mp.get(a[i], 0)\r\n ans -= minus_one_cnt*(a[i]-1)\r\n ans -= act_cnt*a[i]\r\n ans -= (i - plus_one_cnt - minus_one_cnt - act_cnt)*a[i]\r\n ans += (sm - plus_one_cnt*(a[i]+1))\r\n mp[a[i]] = act_cnt + 1\r\n sm += a[i];\r\n\r\nprint(ans)", "n=int(input())\r\nres,pre,i,cnts=0,0,0,{}\r\nfor a in map(int,input().split()):\r\n res+=i*a-pre\r\n if a+1 in cnts.keys():\r\n res+=cnts[a+1]\r\n if a-1 in cnts.keys():\r\n res-=cnts[a-1]\r\n pre+=a\r\n if a not in cnts.keys():\r\n cnts[a]=0\r\n cnts[a]+=1\r\n i+=1\r\nprint(res)", "n = int(input())\nv = [int(x) for x in input().split()]\ncnt = {}\n \nans = 0\nsum = 0\nqtt = 0\n\nfor i in range(n):\n\tans += qtt*v[i] - sum;\n\n\tif v[i]-1 in cnt:\n\t\tans -= cnt[v[i]-1]\n\tif v[i]+1 in cnt:\n\t\tans += cnt[v[i]+1]\n\n\tqtt += 1\n\tsum += v[i]\n\tcnt[v[i]] = cnt[v[i]] + 1 if v[i] in cnt else 1\n \nprint(ans)", "d = {}\r\nt = int(input())\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n if i in d.keys():\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nsu = sum(a)\r\nans = 0\r\nfor i in range(t):\r\n x = 0\r\n if a[i] + 1 in d.keys():\r\n x -= d[a[i] + 1]\r\n if a[i] - 1 in d.keys():\r\n x += d[a[i] - 1]\r\n su = su - a[i]\r\n ans = ans + su + x - a[i] * (t - i - 1)\r\n d[a[i]]-=1\r\nprint(ans)\r\n", "n = int(input())\na = list(map(int,input().split()))\n\nres = 0\ncur = 0\nd = {}\n\nfor j, i in enumerate(a):\n if (i - 1) in d:\n res -= d[i - 1]\n if (i + 1) in d:\n res += d[i + 1]\n if i in d:\n d[i] += 1\n else:\n d[i] = 1\n res += i * j - cur\n cur += i\n\nprint(res)\n\t\t \t\t\t \t \t\t \t\t\t \t \t\t\t \t", "import sys\r\n\r\ninp = map(int, ' '.join(sys.stdin.readlines()).split())\r\n\r\ncounter = {}\r\n\r\nnext(inp)\r\n\r\nans = 0\r\nprefix = 0\r\n\r\nfor i, elem in enumerate(inp):\r\n ans += i * elem\r\n ans -= prefix\r\n\r\n if elem + 1 in counter:\r\n ans += counter[elem + 1]\r\n\r\n if elem - 1 in counter:\r\n ans -= counter[elem - 1]\r\n\r\n prefix += elem\r\n if not elem in counter:\r\n counter[elem] = 0\r\n counter[elem] += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nline = input()\r\nline = line.split(' ')\r\nnum = []\r\nfor i in range(len(line)):\r\n num.append(int(line[i]))\r\n\r\nd = {}\r\nsum_ = 0\r\nfor i in range(len(num)):\r\n sum_ += (1-n+2*i)*num[i]\r\n if(num[i] in d):\r\n d[num[i]] += 1\r\n else:\r\n d[num[i]] = 1\r\n if((num[i]-1) in d):\r\n sum_ -= d[num[i]-1]\r\n if((num[i]+1) in d):\r\n sum_ += d[num[i]+1]\r\n\r\nprint(sum_)\r\n", "n = int(input())\r\narr = input().split() \r\nb = []\r\n \r\nfor x in arr:\r\n\tb.append(int(x))\r\n \r\ncnt = {}\r\nans = 0\r\n \r\nfor i in range(n):\r\n\tans += b[i]*(i) + (-b[i])*(n - i - 1)\r\n \r\n \r\nfor i in range(n):\r\n\tif((b[i] - 1) in cnt.keys()):\r\n\t\tans -= cnt[b[i] - 1]\r\n\tif((b[i] + 1) in cnt.keys()):\r\n\t\tans += cnt[b[i] + 1]\r\n\tif((b[i]) in cnt.keys()):\r\n\t\tcnt[b[i]] += 1\r\n\telse:\r\n\t\tcnt[b[i]] = 1\r\n \r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nsum0 = 0\r\nans = 0 \r\nsum1 = 0\r\nm = {}\r\n\r\n\r\nfor i in range(0 , n):\r\n m[a[i]] = 0\r\n m[a[i] + 1] = 0\r\n m[a[i] - 1] = 0\r\n sum0 += a[i];\r\n\r\nfor i in range(0 , n):\r\n m[a[i]] += 1\r\n\r\nfor i in range(n - 1 , -1 , -1): \r\n sum1 = sum0 - a[i] - m[a[i] - 1]*(a[i] - 1) - m[a[i] + 1] * (a[i] + 1)\r\n x = (n - m[a[i] - 1] - m[a[i] + 1] - 1)*a[i]\r\n m[a[i]] -= 1\r\n n-=1\r\n sum0 -= a[i]\r\n ans += (x - sum1)\r\n \r\nprint(ans)", "n = int(input())\r\nx = input()\r\nl = list(map(int, x.split()))\r\n# print(n,l)\r\ndict = {}\r\n# print(type(dict))\r\nfor i in l:\r\n dict[i] = 0;\r\nsum = 0\r\nfre = 0\r\nans = 0\r\nfor i in range(n-1,-1, -1):\r\n # print(i)\r\n x = sum\r\n y = fre\r\n for j in range(-1,2):\r\n aa = l[i]+j\r\n if aa in dict:\r\n x-= aa*dict[aa]\r\n y-= dict[aa]\r\n # print(x, y, l[i])\r\n ans += x - l[i]*y\r\n fre+=1\r\n sum+=l[i]\r\n dict[l[i]]+=1\r\nprint(ans)\r\n# dict[2] = 3\r\n# print(dict[4])", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nres = 0\r\ncur = 0\r\nd = {}\r\n\r\nfor j, i in enumerate(a):\r\n if (i - 1) in d:\r\n res -= d[i - 1]\r\n if (i + 1) in d:\r\n res += d[i + 1]\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n res += i * j - cur\r\n cur += i\r\n\r\nprint(res)", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = list(map(int, input().strip().split()))\r\n\r\ntotal = sum(a)\r\nacnt = defaultdict(lambda: 0)\r\nfor _a in a:\r\n acnt[_a] += 1\r\n\r\nans = 0\r\nfor i, _a in enumerate(a):\r\n total -= _a\r\n acnt[_a] -= 1\r\n\r\n ans += total - ((n - i - 1) * _a)\r\n ans -= acnt[_a + 1]\r\n ans += acnt[_a - 1]\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\nmt = {}\r\nsum = 0\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n\tif not v[i] in mt:\r\n\t\tmt[v[i]] = 0\r\n\tif not v[i] + 1 in mt:\r\n\t\tmt[v[i] + 1] = 0\r\n\tif not v[i] - 1 in mt:\r\n\t\tmt[v[i] - 1] = 0\r\n\tcnt = (n - i - 1) - mt[v[i]] - mt[v[i] + 1] - mt[v[i] - 1]\r\n\tans += sum - mt[v[i]] * v[i] - mt[v[i] + 1] * (v[i] + 1) - mt[v[i] - 1] * (v[i] - 1) - cnt * v[i]\r\n\tmt[v[i]] += 1\r\n\tsum += v[i]\r\nprint(ans)", "mp = dict()\r\nn = int(input())\r\nans = 0;\r\nsum1 = 0;\r\nl = list(map(int,input().split()))\r\nfor i in range(0,n):\r\n\tt = l[i]\r\n\tif (t - 1) not in mp:\r\n\t\tmp[t - 1] = 0;\r\n\tif (t + 1) not in mp:\r\n\t\tmp[t + 1] = 0;\r\n\tif t not in mp:\r\n\t\tmp[t] = 0;\r\n\tans += (i * t) - sum1;\r\n\tans -= mp[t - 1];\r\n\tans += mp[t + 1];\r\n\tsum1 += t;\r\n\tmp[t] += 1;\r\nprint(ans);", "# Chaitanya Bhutada \nimport math\nimport collections\nimport bisect\nimport heapq\nimport time\nimport random\nimport itertools\nimport sys\n\nn = int(input())\nmp = {}\nF = [0]*200009\nF = list(map(int,input().split()))\nans = 0\nsee = -(n-1)\n\nfor i in range(n):\n\tans=ans+see*F[i]\n\tsee=see+2\n\t\nfor i in range(n):\n j=n-i-1 \n gN=mp.get(F[j]+1)\n if(gN==None):\n \tgN=0\n lN=mp.get(F[j]-1)\n if(lN==None):\n \tlN=0\n ans=ans+lN-gN\n val=mp.get(F[j])\t\n if(val==None):\n \tval=0\n val=val+1\n mp[F[j]]=val\nprint(ans);\n\t\t\n", "n = int(input())\nvs = list(map(int, input().split()))\ndc = {}\nfor x in vs:\n dc[x] = 0\nfor x in vs:\n dc[x] += 1\n\nans = 0\nfor i in range(n):\n ans += i*vs[i]\n ans -= (n-1-i)*vs[i]\n\nfor i in range(n):\n dc[vs[i]] -= 1;\n try:\n ans -= dc[vs[i]+1]\n except:\n pass\n try:\n ans += dc[vs[i]-1]\n except:\n pass\nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nmm = dict((a[i], 0) for i in range(n))\r\nfor i in range(n):\r\n ans += a[i] * (i - (n - 1 - i))\r\n mm[a[i]] += 1\r\n ans -= mm.get(a[i] - 1, 0)\r\n ans += mm.get(a[i] + 1, 0)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nmus = 0\r\nfor i in range(n - 1, -1, -1):\r\n ans += mus - a[i] * (n - 1 - i)\r\n \r\n mus += a[i]\r\n\r\ncnt = dict()\r\nfor i in range(n - 1, -1, -1):\r\n if (a[i] + 1) not in cnt:\r\n cnt[a[i] + 1] = 0\r\n ans -= cnt[a[i] + 1]\r\n if (a[i] - 1) not in cnt:\r\n cnt[a[i] - 1] = 0\r\n ans += cnt[a[i] - 1]\r\n \r\n if a[i] not in cnt:\r\n cnt[a[i]] = 0\r\n cnt[a[i]] += 1\r\n\r\nprint(ans)", "n = int(input())\r\narr = [int(e) for e in input().split()]\r\nm={}\r\nf={}\r\nfor i in arr:\r\n m[i] = 0\r\n m[i-1] = 0\r\n m[i+1] = 0\r\n f[i] = 0\r\n f[i-1] = 0\r\n f[i+1] = 0\r\nfor i in arr:\r\n m[i] += 1\r\nans = 0\r\nfor i in range(n):\r\n tot = n\r\n left = i\r\n right = n-i-1\r\n left -= f[arr[i]]\r\n left -= f[arr[i]-1]\r\n left -= f[arr[i]+1]\r\n f[arr[i]] += 1\r\n right -= (m[arr[i]]-f[arr[i]])\r\n right -= (m[arr[i]+1]-f[arr[i]+1])\r\n right -= (m[arr[i]-1]-f[arr[i]-1])\r\n ans += (left*arr[i] - right*arr[i])\r\nprint(ans)", "# LUOGU_RID: 109195401\nn=int(input())\r\na=list(map(int,input().split()))\r\nmp={}\r\nfor i in range(n):mp[a[i]]=mp[a[i]+1]=mp[a[i]-1]=0\r\nans=0\r\ntot=0\r\nfor i in range(n):\r\n ans+=i*a[i]-tot\r\n tot+=a[i]\r\n ans+=mp[a[i]+1]\r\n ans-=mp[a[i]-1]\r\n mp[a[i]]+=1\r\nprint(ans)\r\n", "import random\nimport time\n\n\ndef input_int():\n return int(input())\n\n\ndef input_int_list():\n return [int(_) for _ in input().split()]\n\n\ndef input_str():\n return input()\n\n\ndef input_str_list():\n return [_ for _ in input().split()]\n\n\ndef print_solution(solution_list):\n for solution in solution_list:\n print(solution)\n\n\ndef print_solution_list(solution_list):\n for solution in solution_list:\n out = ''\n for i in solution:\n out += str(i) + ' '\n print(out)\n\n\nif __name__ == \"__main__\":\n solution_list = []\n n = input_int()\n al=input_int_list()\n # n = 200000\n # al = []\n # for i in range(n):\n # al.append(random.randint(1, 100))\n\n # n=5\n # al=[1,2,3,1,3]\n\n # n=4\n # al=[6,6,4,4]\n\n # p = al[0:n]\n # print('begin')\n # ta=0\n # begin=time.time()\n\n hm={}\n for i in al:\n tt=hm.get(i,0)\n hm[i]=tt+1\n\n sumo = 0\n sumal = sum(al)\n for i in range(n - 1):\n c = al[i]\n\n hm[c]-=1\n\n sumal -= c\n\n fu = hm.get(c+1,0)\n zheng = hm.get(c-1,0)\n\n sumo += sumal - c * (n - 1 - i) - fu + zheng\n\n print(sumo)\n # print('all '+str(time.time()-begin))\n # print('ta '+str(ta))\n\n\t\t \t \t\t \t \t \t \t \t \t\t\t\t\t\t \t", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A):\r\n n = len(A)\r\n d = {}\r\n for i in range(n):\r\n ai = A[i]\r\n if ai not in d:\r\n d[ai] = [0, 0]\r\n d[ai][0]+=1\r\n answer = 0\r\n for i in range(n):\r\n total_before = i\r\n total_after = n-1-i\r\n ai = A[i]\r\n d[ai][0]-=1\r\n bad_before = 0\r\n bad_after = 0\r\n for x in [ai-1, ai, ai+1]:\r\n if x in d:\r\n bad_after+=d[x][0]\r\n bad_before+=d[x][1]\r\n coefficient = (total_before-bad_before)-(total_after-bad_after)\r\n answer+=coefficient*ai\r\n d[ai][1]+=1\r\n sys.stdout.write(str(answer)+'\\r\\n')\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprocess(A)", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans, pre = 0, 0\r\nfreq = defaultdict(int)\r\nfor i in range(n):\r\n ans += i*a[i] - pre\r\n ans -= freq[a[i]-1] - freq[a[i]+1]\r\n pre += a[i]\r\n freq[a[i]] += 1\r\nprint(ans)\r\n", "n, a, ft = 0, [(0, 0)], [0]\r\n\r\ndef query(k):\r\n res = 0\r\n while k > 0:\r\n res += ft[k]\r\n k -= k&-k\r\n return res\r\n \r\ndef adjust(k, v):\r\n while k <= n:\r\n ft[k] += v\r\n k += k&-k\r\n \r\ndef rquery(l, r):\r\n if l > r:\r\n return 0\r\n return query(r) - (0 if l == 1 else query(l-1))\r\n\r\n\r\nn, ans = int(input()), 0\r\ntmp = [int(x) for x in input().split()]\r\nfor i in range(1, n+1):\r\n a.append((tmp[i-1], i))\r\nft = [0 for i in range(n+1)]\r\nans = sum([x*(2*i-n-1) for x, i in a])\r\na.sort(key=lambda x: x[0])\r\n\r\nL, R, cur, i = [], [], 0, 1\r\nwhile i <= n:\r\n v, k = a[i]\r\n if v == cur:\r\n ans -= rquery(1, k-1) - rquery(k+1, n)\r\n R.append(k)\r\n i += 1\r\n else:\r\n for j in L:\r\n adjust(j, -1)\r\n L = []\r\n if v - cur == 1:\r\n for j in R:\r\n L.append(j)\r\n adjust(j, 1);\r\n R, cur = [], v\r\nprint(ans)\r\n ", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\npref = [0] *(n+1)\r\nfreq = {};\r\nfor i in range(n):\r\n pref[i+1] = pref[i] + l[i]\r\n if l[i] in freq:\r\n freq[l[i]] +=1 \r\n else:\r\n freq[l[i]] = 1\r\n \r\nans = 0\r\nfor i in range(n):\r\n if l[i]-1 in freq :\r\n ans += freq[l[i]-1]\r\n if l[i]+1 in freq:\r\n ans -= freq[l[i]+1]\r\n if l[i] in freq:\r\n ans -=(n-i-1)*l[i]\r\n ans+=pref[n]-pref[i+1]\r\n freq[l[i]]-=1\r\n\r\nprint(ans)\r\n ", "from collections import Counter\n\nn = int(input())\nA = [int(x) for x in input().split()]\nC = [0] + A[:]\n\nfor i in range(n):\n C[i+1] += C[i]\n \nM = Counter()\nans = 0\nfor i in range(n):\n ans += i*A[i] - C[i]\n ans -= M[A[i]-1]\n ans += M[A[i]+1]\n M[A[i]] += 1\n\nprint(ans)\n", "n = int(input())\r\na = input().split(' ')\r\n\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nans = 0\r\nsum = 0\r\nm = dict()\r\nfor i in range(n):\r\n m[a[i]] = m.get(a[i],0) + 1;\r\n sum += a[i];\r\n ans += (i+1)*a[i] - sum;\r\n ans -= (m.get(a[i]+1,0)*(- 1));\r\n ans -= m.get(a[i]-1,0);\r\n \r\nprint(ans)" ]

[ "mod=10**9+7\r\n\r\ndef popcount(n):\r\n c=(n&0x5555555555555555)+((n>>1)&0x5555555555555555)\r\n c=(c&0x3333333333333333)+((c>>2)&0x3333333333333333)\r\n c=(c&0x0f0f0f0f0f0f0f0f)+((c>>4)&0x0f0f0f0f0f0f0f0f)\r\n c=(c&0x00ff00ff00ff00ff)+((c>>8)&0x00ff00ff00ff00ff)\r\n c=(c&0x0000ffff0000ffff)+((c>>16)&0x0000ffff0000ffff)\r\n c=(c&0x00000000ffffffff)+((c>>32)&0x00000000ffffffff)\r\n return c\r\n\r\n\r\ndef matmul(A,B):\r\n res = [[0]*len(B[0]) for _ in [None]*len(A)]\r\n for i, resi in enumerate(res):\r\n for k, aik in enumerate(A[i]):\r\n for j,bkj in enumerate(B[k]):\r\n resi[j] += aik*bkj\r\n resi[j] %= mod\r\n return res\r\n\r\ndef matpow(A,p):\r\n if p%2:\r\n return matmul(A, matpow(A,p-1))\r\n elif p > 0:\r\n b = matpow(A,p//2)\r\n return matmul(b,b)\r\n else:\r\n return [[int(i==j) for j in range(len(A))] for i in range(len(A))]\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmat=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if popcount(a[i]^a[j])%3==0:\r\n mat[i][j]=1\r\n\r\nmatp=matpow(mat,k-1)\r\nansmat=matmul(matp,[[1] for i in range(n)])\r\nans=0\r\nfor i in range(n):\r\n ans+=ansmat[i][0]\r\nprint(ans%mod)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef matmul(a, b, n):\r\n c = [[0] * n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n x = 0\r\n for k in range(n):\r\n x += a[i][k] * b[k][j] % mod\r\n x %= mod\r\n c[i][j] = x\r\n return c\r\n\r\nn, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\na = list(map(int, input().split()))\r\nb = [set() for _ in range(n)]\r\nfor i in range(n):\r\n a0 = bin(a[i])\r\n for j in range(1, len(a0)):\r\n if a0[-j] == \"1\":\r\n b[i].add(j)\r\nx = [[0] * n for _ in range(n)]\r\nfor i in range(n):\r\n x[i][i] = 1\r\ny = [-1] * (n * n)\r\ny = [[-1] * n for _ in range(n)]\r\nfor i in range(n):\r\n y[i][i] = 1\r\nfor i in range(n):\r\n bi = b[i]\r\n for j in range(i + 1, n):\r\n bj = b[j]\r\n c = 0\r\n for l in bj:\r\n if not l in bi:\r\n c += 1\r\n for l in bi:\r\n if not l in bj:\r\n c += 1\r\n s = 0 if c % 3 else 1\r\n y[i][j] = s\r\n y[j][i] = s\r\nk -= 1\r\nk = list(bin(k)[2:])\r\nwhile k:\r\n if k.pop() == \"1\":\r\n x = matmul(x, y, n)\r\n y = matmul(y, y, n)\r\nans = 0\r\nfor i in x:\r\n ans += sum(i) % mod\r\n ans %= mod\r\nsys.stdout.write(str(ans))" ]

[ "# python 3\n\na, b, c, d = list(map(int, input().split()))\n\nMisha = max(3*a/10, a-a/250*c)\nVasya = max(3*b/10, b-b/250*d)\nif Misha > Vasya:\n print(\"Misha\")\nelif Misha < Vasya:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n", "x=list(map(int, input().split()))\r\na=x[0]\r\nb=x[1]\r\nc=x[2]\r\nd=x[3]\r\np1=max(3*a/10,a-a/250*c)\r\np2=max(3*b/10,b-b/250*d)\r\nif p1>p2:\r\n print(\"Misha\")\r\nelif p2>p1:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "[a, b, c, d] = [int(x) for x in input().split()]\r\n\r\nmisha = max((3*a)//10, a - c*(a//250))\r\nvasya = max((3*b)//10, b - d*(b//250))\r\n\r\nif misha > vasya:\r\n print(\"Misha\")\r\nelif vasya > misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\ne = max(3*a/10, a-a*c/250)\r\nf = max(3*b/10, b-b*d/250)\r\nif e>f:\r\n print(\"Misha\")\r\nelif e<f :\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\ne=max(3*a/10,a-(a/250)*c)\r\nf=max(3*b/10,b-(b/250)*d)\r\nif(e>f):\r\n print(\"Misha\")\r\nelif(f>e):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "misha_pt, vasya_pt, misha_time, vasya_time = map(int, input().split())\r\nmisha_pt = max((3 * misha_pt) // 10, misha_pt - ((misha_pt * misha_time) // 250))\r\nvasya_pt = max((3 * vasya_pt) // 10, vasya_pt - ((vasya_pt * vasya_time) // 250))\r\nif misha_pt > vasya_pt:\r\n print(\"Misha\")\r\nelif vasya_pt > misha_pt:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = input().split()\na,b,c,d = int(a),int(b),int(c),int(d)\nMax1 = max(3*a/10,a - a/250*c)\nMax2 = max(3*b/10,b - b/250*d)\nif Max1 > Max2:\n print('Misha')\nelif Max1 < Max2:\n print('Vasya')\nelse:\n print('Tie')", "a,b,c,d = map(int, input().split())\r\ndef point(p,t):\r\n return int(max((.1*3*p), (p-(.004*t*p))))\r\nif point(a,c) == point(b,d):\r\n print (\"Tie\") \r\nelse: print([\"Misha\",\"Vasya\"][point(b,d)>point(a,c)])\r\n", "# A.Contest\r\n\r\ndef points(points_in,time):\r\n\r\n \r\n points_out=max((3*points_in)/10,(points_in-points_in/250*time))\r\n\r\n return(points_out)\r\n\r\n\r\nMisha_points,Vasya_points,Misha_time,Vasya_time = map(int,input().split())\r\n\r\npoints_misha=points(Misha_points,Misha_time)\r\npoints_vasya=points(Vasya_points,Vasya_time)\r\n\r\nif points_misha > points_vasya:\r\n print('Misha')\r\nelif points_vasya > points_misha:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n# Twins\r\n\r\nn = int(input())\r\ncoin_values = sorted(list(map(int,input().split())),reverse=True)\r\n\r\nsum_coins=sum(coin_values)\r\n\r\n#print(sum_coins)\r\nmoney = 0\r\ncoins = 0\r\nfor idx,value in enumerate(coin_values):\r\n\r\n #print('money: '+str(money))\r\n #print('value of next coin: '+str(value))\r\n\r\n if (money <= sum_coins / 2):\r\n money = money + value\r\n coins += 1\r\n \r\n if money > sum_coins /2:\r\n coins_min = coins\r\n #print('coins min: '+str(coins_min))\r\n #print(money)\r\n money = money - value\r\n break\r\n coins -= 1\r\n\r\n\r\n\r\nprint(coins_min)\r\n \r\n \r\n\r\n#for value in coin_values\r\n\"\"\"\r\n\r\n\"\"\" Domino piling\r\nimport math\r\n\r\nX, Y = map(int,input().split())\r\np_in_x=X\r\nrotated_pieces = 0\r\n \r\nif Y%2 == 0:\r\n p_in_y = int(Y/2)\r\nelse:\r\n p_in_y = int(Y/2)\r\n rotated_pieces = int(X/2)\r\n\r\npieces = p_in_x*p_in_y + rotated_pieces\r\nprint(int(pieces))\r\n\"\"\"\r\n\r\n\"\"\" \r\nn,k = map(int,input().split())\r\nscores = list(map(int,input().split()))\r\nparticipants = 0\r\n\r\nfor idx,obj in enumerate(scores):\r\n if (scores[idx] >= scores[k-1]) and scores[idx] > 0:\r\n participants += 1\r\n else:\r\n break\r\n\r\nprint(participants)\r\n\"\"\"\r\n\r\n", "a,b,c,d=map(int,input().split())\r\nc1=max(3*a/10,a-((a/250)*c))\r\nc2=max(3*b/10,b-((b/250)*d))\r\nif c1>c2:\r\n print(\"Misha\")\r\nelif c1<c2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\ndef inList():\r\n return(list(map(int,input().split())))\r\ndef inVar():\r\n return map(int,input().split()) \r\ndef Got(p, t):\r\n return max((3 * p) / 10 , p - ((p / 250) * t))\r\ndef main():\r\n a, b, c, d = inVar()\r\n misha = Got(a, c)\r\n vasya = Got(b, d)\r\n if misha > vasya:\r\n print(\"Misha\")\r\n elif misha < vasya:\r\n print(\"Vasya\")\r\n else:\r\n print(\"Tie\")\r\nmain()", "def check(a,b):\r\n t1=(3*a)//10\r\n t2=a-(a//250)*b\r\n return max(t1,t2)\r\n \r\n\r\nl=list(map(int,input().split()))\r\na=l[0]\r\nc=l[2]\r\nb=l[1]\r\nd=l[3]\r\n\r\na=check(a,c)\r\nb=check(b,d)\r\n\r\nif a>b:\r\n print(\"Misha\")\r\nelif b>a:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = list(map(int, input().split()))\r\nif max(3*a/10, a-a/250*c)> max(3*b/10, b-b/250*d):\r\n print(\"Misha\")\r\nelif max(3*a/10, a-a/250*c)< max(3*b/10, b-b/250*d):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = (int(i) for i in input().split())\r\n\r\nm = max(3 * a / 10, a - a / 250 * c)\r\nv = max(3 * b / 10, b - b / 250 * d)\r\n\r\nif m > v:\r\n print('Misha')\r\nelif v > m:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "def point_earned(p: int, t: int):\n return max(3 * p // 10, p - p // 250 * t)\n\n\na, b, c, d = map(int, input().split())\n\nmisha = point_earned(a, c)\nvasya = point_earned(b, d)\n\nif misha > vasya:\n print(\"Misha\")\nelif misha == vasya:\n print(\"Tie\")\nelse:\n print(\"Vasya\")\n", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\na,b,c,d=map(int,input().split())\r\nm=max(3*a//10,a-(a//250)*c)\r\nv=max(3*b//10,b-(b//250)*d)\r\nif m==v:\r\n\tprint(\"Tie\")\r\nelif m>v:\r\n\tprint(\"Misha\")\r\nelse:\r\n\tprint(\"Vasya\")\r\n", "a , b , c , d = list(map(int,input().split()))\r\n\r\nmisha = max(3*a/10,a-(a/250)*c)\r\nvasya = max(3*b/10,b-(b/250)*d)\r\n\r\nif misha > vasya :\r\n print(\"Misha\")\r\nelif misha < vasya :\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\nm = max((3 * a) // 10, a - (a // 250) * c)\nv = max((3 * b) // 10, b - (b // 250) * d)\nif v < m: print(\"Misha\")\nelif v > m : print(\"Vasya\")\nelse: print(\"Tie\")\n \t\t \t \t \t \t\t\t \t\t\t \t", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Contest():\r\n a,b,c,d = invr()\r\n\r\n Misha_points = max((3*a)/10 , a - ((a/250)*c))\r\n Vasya_points = max((3*b)/10 , b - ((b/250)*d))\r\n\r\n if Misha_points > Vasya_points:\r\n print(\"Misha\")\r\n elif Vasya_points > Misha_points:\r\n print(\"Vasya\")\r\n else:\r\n print(\"Tie\")\r\n \r\n return \r\n\r\nContest()", "a,b,c,d=map(int,input().split())\r\nt=max(((3*a)/10),(a-a/250*c))\r\nx=max(((3*b)/10),(b-b/250*d))\r\nif t==x:\r\n print(\"Tie\")\r\nelif t>x:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\np1=max(3*a/10,a-((a*c)/250))\r\np2=max(3*b/10,b-((b*d)/250))\r\nif p1==p2:\r\n print('Tie')\r\n exit(0)\r\nprint(['Misha','Vasya'][p1<p2])", "a,b,c,d=map(int, input().split(\" \"))\r\nm1=(3*a)/10\r\nm2=a-((a/250)*c)\r\nM=max(m1, m2)\r\nv1=(3*b)/10\r\nv2=b-((b/250)*d)\r\nV=max(v1, v2)\r\nif M>V:\r\n print(\"Misha\")\r\nelif V>M:\r\n print(\"Vasya\")\r\nelif V==M:\r\n print(\"Tie\")", "a,b,c,d = map(int,input().split())\n\nmisha = max((3*a/10),(a-(a*c/250)))\nvasya = max((3*b/10),(b-(b*d/250)))\n\nif misha>vasya:\n print('Misha')\n\nelif misha<vasya:\n print(\"Vasya\")\n\nelse:\n print(\"Tie\")\n", "def find_max(p,t):\n return max(3*p/10,p-p/250*t)\na,b,c,d = list(map(int,input().split()))\nif find_max(a,c) > find_max(b,d):\n print(\"Misha\")\nelif find_max(a,c) == find_max(b,d):\n print(\"Tie\")\nelse:\n print(\"Vasya\")\n\n", "#J - Contest\n# misha point = a\n# vasya point = b\n# time misha = c\n# time vasya = d\n\ndef cal_point(arr):\n p = arr[0]\n t = arr[1]\n point1 = (3*p)/10\n point2 = (p-(p*t)/250)\n point = int(max(point1, point2))\n return point\n\narray = list(map(int, input().split()))\nmisha = [array[0], array[2]]\nvasya = [array[1], array[3]]\n\nm = cal_point(misha)\nv = cal_point(vasya)\nif m==v:\n print(\"Tie\")\nelif m>v:\n print(\"Misha\")\nelse:\n print(\"Vasya\")\n\n\t\t \t\t \t\t\t \t \t\t \t\t \t\t \t\t \t\t \t", "# http://codeforces.com/problemset/problem/501/A\r\n\r\narr=list(map(int,input().split()))\r\nm1=max((3*arr[0]/10),(arr[0]-(arr[0]*arr[2]/250)))\r\nm2=max((3*arr[1]/10),(arr[1]-(arr[1]*arr[3]/250)))\r\nm=max(m1,m2)\r\nif(m1==m and m2==m):\r\n print('Tie')\r\nelif(m1==m):\r\n print('Misha')\r\nelse:\r\n print('Vasya')", "a,b,c,d = list(map(int,input().split()))\r\nM = max((3*a//10),a-((a//250)*c))\r\nV = max((3*b//10),b-((b//250)*d))\r\n\r\nif M > V:\r\n print(\"Misha\")\r\nelif V > M:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nm=max(3*a//10,a-(a*c)//250)\r\nv=max(3*b//10,b-(b*d)//250)\r\nif m>v:\r\n print(\"Misha\")\r\nelif m<v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "#-------------Program-------------\r\n#----KuzlyaevNikita-Codeforces----\r\n#---------------------------------\r\n\r\na,b,c,d=map(int,input().split())\r\nm=max(3*a//10,a-a//250*c)\r\nv=max(3*b//10,b-b//250*d)\r\nif m>v:print('Misha')\r\nelif v>m:print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d = map(int,input().split())\r\n\r\nmis = max((3*a)//10,(a-(a//250)*c))\r\nvas = max((3*b)//10,(b-(b//250)*d))\r\n\r\nif(mis>vas):\r\n print('Misha')\r\nelif(mis==vas):\r\n print('Tie')\r\nelse:\r\n print('Vasya')", "a, b, c, d = map(int, input().split())\r\n\r\ndef count(p, t):\r\n return max(0.3*p, p- (p*t/250))\r\n\r\nmisha=count(a, c)\r\nvasya=count(b, d)\r\n\r\nif misha>vasya: print(\"Misha\")\r\nelif misha<vasya: print(\"Vasya\")\r\nelse: print(\"Tie\")", "a,b,c,d=map(int, input().split())\r\nx,y=max(3*a//10, a-a//250*c),max(3*b//10, b-b//250*d)\r\nif x>y:print('Misha')\r\nelif x<y:print('Vasya')\r\nelse:print('Tie')", "a,b,c,d = map(int, input().split())\r\n# n = int(input())\r\n# arr = list(map(int, input().split()))\r\n\r\nx = max(3*a//10, a - (a//250 * c))\r\ny = max(3*b//10, b - (b//250 * d))\r\n# print(x, y)\r\nif x > y: print(\"Misha\")\r\nelif x < y: print(\"Vasya\")\r\nelse: print(\"Tie\")\r\n\r\n\r\n\r\n", "a, b, c, d = map(int, input().split())\r\n\r\nm = max(3 * a / 10, a - (a / 250 * c))\r\nv = max(3 * b / 10, b - (b / 250 * d))\r\n\r\nif v > m:\r\n print(\"Vasya\")\r\n\r\nelif v < m:\r\n print(\"Misha\")\r\n\r\nelse:\r\n print(\"Tie\")\r\n", "a = list(map(int, input().split()))\r\nb = max(a[0] * .3, a[0] * (1 - a[2] * .004))\r\nc = max(a[1] * .3, a[1] * (1 - a[3] * .004))\r\nprint('Misha' if b > c else ('Tie' if b == c else 'Vasya'))", "a,b,c,d=map(int,input().split())\r\nP=lambda s,t:max(s*75,250*s-s*t)\r\nx=P(a,c)\r\ny=P(b,d)\r\nprint('Misha' if x>y else 'Vasya' if x<y else 'Tie')", "t = [int(i) for i in input().split()]\r\nm=max((3*t[0])/10,t[0]-((t[0]/250)*t[2]))\r\nv=max((3*t[1])/10,t[1]-((t[1]/250)*t[3]))\r\nif v==m:\r\n print(\"Tie\")\r\nelif v>m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Misha\")\r\n", "a,b,c,d=map(int,input().strip().split()[:4])\r\nl1=max(((3*a)/10),(a-((a*c))/250))\r\nl2=max(((3*b)/10),(b-((b*d))/250))\r\nif l1>l2:\r\n\tprint('Misha')\r\nelif l2>l1:\r\n\tprint('Vasya')\r\nelse:\r\n\tprint('Tie')", "s=list(map(int,input().split()))\nif max((3*s[0]/10, s[0]-(s[0]/250*s[2]))) > max(3*s[1]/10, s[1]-(s[1]/250*s[3])):\n print(\"Misha\")\nelif max((3*s[0]/10, s[0]-(s[0]/250*s[2]))) < max(3*s[1]/10, s[1]-(s[1]/250*s[3])):\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n\t\t \t\t \t \t \t\t \t\t\t \t\t\t\t\t\t", "import sys\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 10**9+7\r\na, b, c, d = [int(i) for i in input().split()]\r\nmis = max((3*a)//10, a-(a//250)*c)\r\nvas = max((3*b)//10, b-(b//250)*d)\r\n\r\nif (mis > vas):\r\n print(\"Misha\")\r\nelif (vas > mis):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a, b, c, d = map(int,input().split())\r\n\r\nmisha = max(3*a/10 , a-(a/250)*c)\r\n\r\nvasya = max(3*b/10 , b-(b/250)*d)\r\n\r\nif misha> vasya:\r\n print(\"Misha\")\r\nelif vasya> misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = list(map(int, input().split()))\r\n\r\na1 = 3.0 * a / 10.0\r\na2 = a - ((a / 250.0) * c)\r\nm = max(a1, a2)\r\nb1 = 3.0 * b / 10.0\r\nb2 = b - ((b / 250.0) * d)\r\nv = max(b1, b2)\r\n\r\nif v>m:\r\n print(\"Vasya\")\r\nelif v<m:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")", "inp = list(map(int,input().split())) \r\n\r\na = inp[0]\r\nb = inp[1]\r\nc = inp[2]\r\nd = inp[3]\r\n#misha cost a, after c min\r\n# vasya cost b after d min\r\n\r\nmf = 3*a / 10\r\nvf = 3*b / 10\r\n\r\nms = a - (a/250 * c)\r\nvs = b - (b/250 * d)\r\n\r\nmisha = max(mf,ms)\r\nvasya = max(vf, vs)\r\n\r\nif misha == vasya:\r\n print(\"Tie\")\r\nelif misha > vasya:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\nm=max(3*a//10,a-(a//250)*c)\r\nv=max(3*b//10,b-(b//250)*d)\r\nif(v>m):\r\n print('Vasya')\r\nelif(m>v):\r\n print('Misha')\r\nelse:\r\n print('Tie')\r\n", "a, b, c, d = map(int,input().split())\r\nx = max(((3*a)//10),(a-a//250*c))\r\ny = max(((3*b)//10),(b-b//250*d))\r\nif x > y: print(\"Misha\")\r\nelif x < y: print(\"Vasya\")\r\nelse: print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\nMisha = max((3*a)/10, a-(a/250)*c)\r\nVasya = max((3*b)/10, b-(b/250)*d)\r\nif Misha > Vasya:\r\n print('Misha')\r\nelif Vasya > Misha:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d = map(int, input().split())\r\n\r\nm1 = max(3*a//10, a-(a//250)*c)\r\nm2 = max(3*b//10, b-(b//250)*d)\r\n\r\nif(m1>m2):\r\n print(\"Misha\")\r\nelif(m2>m1):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[3]:\n\n\nx=list(map(int,input().split()))\na=max(((3*x[0])/10),(x[0]-(x[0]/250)*x[2]))\nb=max(((3*x[1])/10),(x[1]-(x[1]/250)*x[3]))\nif a>b:\n print(\"Misha\")\nelif b>a:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n\n\n# In[ ]:\n\n\n\n\n", "a,b,c,d = map(int, input().split())\r\nif max((3*a/10),a-(a/250)*c) > max((3*b/10),b-(b/250)*d):\r\n\tprint(\"Misha\")\r\nelif max((3*a/10),a-(a/250)*c) < max((3*b/10),b-(b/250)*d):\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Tie\")", "a, b, c, d = map(int, input().split())\r\n\r\nm = max(3*a/10, a - a/250*c)\r\nv = max(3*b/10, b - b/250*d)\r\nprint(\"Vasya\" if v > m else \"Misha\" if v < m else \"Tie\")\r\n", "a,b,c,d = map(int, input().split())\r\n\r\nmisha = max((3*a)/10 , a-(a/250) * c)\r\nvasya = max((3*b)/10 , b-(b/250) * d)\r\n\r\nif vasya == misha: print(\"Tie\")\r\nelif vasya>misha: print(\"Vasya\")\r\nelse: print(\"Misha\")", "def res(p,t):\n return max(3*p/10, p - (p/250*t))\na,b,c,d = map(int, input().split(\" \"))\nx = res(a,c)\ny = res(b,d)\nif x > y:\n print(\"Misha\")\nelif y > x:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n\t\t \t\t\t \t \t \t\t \t \t\t\t\t\t \t \t\t", "l=list(map(int,input().split()))\r\na,b,c,d=l[0],l[1],l[2],l[3]\r\nx=max(int((3*a)/10),a-int((a*c)/250))\r\ny=max(int((3*b)/10),b-int((b*d)/250))\r\nif x>y:\r\n print(\"Misha\")\r\nelif y>x:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "i = input().split()\r\na = int(i[0])\r\nb = int(i[1])\r\nc = int(i[2])\r\nd = int(i[3])\r\n\r\na = points = max(((3*a)/10), a - (a/250) * c)\r\nb = points = max(((3*b)/10), b - (b/250) * d)\r\n\r\nif a>b:\r\n print('Misha')\r\nelif b>a:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "a,b,c,d=list(map(int,input().split()))\r\n\r\n\r\nm=max(3*a/10,(a-(a/250)*c))\r\nv=max(3*b/10,(b-(b/250)*d))\r\n\r\nif m>v:\r\n print('Misha')\r\nelif v>m:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "\r\nL1= [int(x) for x in input().split(\" \")]\r\n\r\nmp=L1[0]\r\nvp=L1[1]\r\n\r\nmt=L1[2]\r\nvt=L1[3]\r\n\r\nLm=[(3*mp)/10,mp-(mp*mt)/250]\r\n\r\nLv=[(3*vp)/10,vp-(vp*vt)/250]\r\n\r\nm=max(Lm)\r\nv=max(Lv)\r\n\r\nif m>v:\r\n print(\"Misha\")\r\nelif m==v:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d = map(int, input().split())\r\n\r\ndef score(p, t):\r\n return max(3*p/10, p-p/250*t)\r\n\r\nif score(a,c)>score(b,d):\r\n print('Misha')\r\nelif score(a,c)==score(b,d):\r\n print('Tie')\r\nelse:\r\n print('Vasya')", "x = list(map(int, input().split(\" \")))\r\nmisha=max((3*x[0]//10),(x[0]-((x[0]//250)*x[2])))\r\nvasya= max((3*x[1]//10),(x[1]-((x[1]//250)*x[3])))\r\nif vasya==misha:\r\n print(\"Tie\")\r\n exit()\r\nprint(\"Misha\" if misha>vasya else \"Vasya\")\r\n", "a,b,c,d = list(map(int,input().split()))\r\nm = max(int(3*a/10),a-int(a/250)*c)\r\nv = max(int(3*b/10),b-int(b/250)*d)\r\n\r\nif m>v:\r\n\tprint('Misha')\r\nelif m==v:\r\n\tprint('Tie')\r\nelse:\r\n\tprint('Vasya')", "a,b,c,d = map(int, input().split())\np1 = max(3*a//10, a-a//250*c)\np2 = max(3*b//10, b-b//250*d)\nif p1 > p2:\n print('Misha')\nelif p1 < p2:\n print('Vasya')\nelse:\n print('Tie')\n\t\t \t \t\t \t \t\t \t \t\t \t \t\t\t \t", "a, b, c, d = map(int, input().split())\r\nVasya = max(3*b/10, b-(b*d/250))\r\nMisha = max(3*a/10, a-(a*c/250))\r\nif Vasya > Misha: print('Vasya')\r\nelif Vasya < Misha: print('Misha')\r\nelse: print('Tie')\r\n", "a,b,c,d = map(int,(input().split()))\r\nvasya = max((3*b)/10,(b-(b/250)*d))\r\nmisha = max((3*a)/10,(a-(a/250)*c))\r\nif vasya>misha:\r\n print('Vasya')\r\nelif vasya<misha:\r\n print('Misha')\r\nelse:\r\n print('Tie')", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\na, b, c, d = map(int, input().split())\r\nmisha = max(3*a/10, a - (a/250)*c)\r\nvasya = max(3*b/10, b - (b/250)*d)\r\nif misha > vasya:\r\n print(\"Misha\")\r\nelif vasya > misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(int,input().split())\r\na_points=max(((3*a)//10),(a-((a//250)*c)))\r\nb_points=max(((3*b)//10),(b-((b//250)*d)))\r\nif a_points>b_points:\r\n print(\"Misha\")\r\nelif b_points>a_points:\r\n print(\"Vasya\")\r\nelif a_points==b_points:\r\n print(\"Tie\")", "a, b, c, d = [int(x) for x in input().split()]\r\na = max(3*a/10, a - a/250*c)\r\nb = max(3*b/10, b - b/250*d)\r\n#print(a,b )\r\nif a > b:\r\n print(\"Misha\")\r\nelif b > a:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "input_a = input().split()\nmisha = int(input_a[0])\nvasya = int(input_a[1])\nmisha_time = int(input_a[2])\nvasya_time = int(input_a[3])\nmisha_total = max(misha*3/10, misha-(misha/250)*misha_time)\nvasya_total = max(vasya*3/10, vasya-(vasya/250)*vasya_time)\nif(misha_total>vasya_total):\n print('Misha')\nelif(misha_total == vasya_total):\n print('Tie')\nelse:\n print('Vasya')\n\n \t\t\t\t\t \t\t\t \t\t\t\t\t\t \t\t \t\t\t\t\t\t \t", "import sys\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef points(p, t):\r\n return max(3*p/10, p - p/250*t)\r\n\r\n\r\ndef solve(a, b, c, d):\r\n m = points(a, c)\r\n v = points(b, d)\r\n\r\n if m == v:\r\n return \"Tie\"\r\n elif m < v:\r\n return \"Vasya\"\r\n else:\r\n return \"Misha\"\r\n\r\n\r\na, b, c, d = read_numeric_list()\r\n\r\nprint(solve(a, b, c, d))\r\n", "a,b,c,d=map(int,input().split())\r\nsa=max(3*a//10,a-a//250*c)\r\nsb=max(3*b//10,b-b//250*d)\r\n\r\nif sa>sb:\r\n print(\"Misha\")\r\nelif sa<sb:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\nq = max(3 * a // 10, a - ((a // 250) * c))\r\nw = max(3 * b // 10, b - ((b // 250) * d))\r\nif q > w:\r\n print(\"Misha\")\r\nelif w > q:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split(\" \"))\r\nm=max(((3*a)/10),(a-(a*c)/250))\r\nv=max(((3*b)/10),(b-(b*d)/250))\r\nif(m>v):\r\n print(\"Misha\")\r\nelif(v>m):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = [int(i) for i in input().split(\" \")]\r\nm = max((3*a)/10,a - (a*c)/250)\r\nv = max((3*b)/10,b - (b*d)/250)\r\nif m > v:\r\n print(\"Misha\")\r\nelif m < v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "def calc(p,t):\r\n return max((3*p)/10,p-(p/250)*t)\r\na,b,c,d = map(int,input().split(' '))\r\n\r\nm = calc(a,c)\r\nv = calc(b,d)\r\n\r\nif m > v:\r\n print('Misha')\r\nelif v > m:\r\n print(\"Vasya\")\r\nelse:\r\n print('Tie')", "a, b, c, d = [int(i) for i in input().split()]\r\n\r\n\r\ndef count(p, t):\r\n return max(3 * p / 10, (p - p / 250 * t))\r\n\r\n\r\nif count(a, c) < count(b, d):\r\n print(\"Vasya\")\r\nelif count(a, c) > count(b, d):\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")\r\n", "from sys import stdin,stdout\r\n\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\n\r\nmod=1000000007\r\n\r\ndef solve():\r\n a,b,c,d=mp()\r\n m=max((3*a)//10 , a- ((a*c)//250))\r\n v=max((3*b)//10 , b- ((b*d)//250))\r\n if v==m:\r\n pr('Tie')\r\n elif v>m:\r\n pr('Vasya')\r\n else:\r\n pr('Misha')\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "a, b, c, d = map(int, input().split(\" \"))\r\n\r\nmisha = max((3*a/10), (a - (a*c/250)))\r\nvasya = max((3*b/10), (b - (b*d/250)))\r\n\r\nif misha > vasya:\r\n print(\"Misha\")\r\nelif misha < vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\n\r\n# Calculate points for Misha and Vasya\r\npoints_misha = max(3 * a // 10, a - (a // 250) * c)\r\npoints_vasya = max(3 * b // 10, b - (b // 250) * d)\r\n\r\n# Compare the points and print the result\r\nif points_misha > points_vasya:\r\n print(\"Misha\")\r\nelif points_misha < points_vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "digits = input()\r\nlistDigits = digits.split()\r\nMishaBalls = int(listDigits[0])\r\nVasyaBalls = int(listDigits[1])\r\nMishaTime = int(listDigits[2])\r\nVasyaTime = int(listDigits[3])\r\n\r\ndef rezFunc(balls, time):\r\n rez1 = 3 * balls // 10\r\n rez2 = balls - balls // 250 * time\r\n if rez1 > rez2:\r\n return rez1\r\n return rez2\r\n\r\nrezMisha = rezFunc(MishaBalls, MishaTime)\r\nrezVasya = rezFunc(VasyaBalls, VasyaTime)\r\nif rezMisha > rezVasya:\r\n print('Misha')\r\nelif rezMisha < rezVasya:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "'''\nimport string\n\nn= int(input())\nx=[]\nfor i in range(0,n):\n x.append(input())\n\nfor i in range(0,n):\n l=len(x[i])-1\n if l<10:\n print(x[i])\n else:\n print(\"%s%i%s\" % (x[i][0],l-1,x[i][l]))\n \n\n\n\nn= int(input())\ns=0\nfor i in range(0,n):\n inp = list(map(int,input().split()))\n if inp[0]+inp[1]+inp[2]>=2:\n s+=1 \nprint(s)\n'''\n\n'''\nn= int(input())\nfor i in range(0,n):\n inp = list(map(int,input().split()))\n if inp[0]==inp[1]: print(\"0\\n\")\n elif inp[0]<inp[1] :\n if (inp[0]-inp[1])%2 : print(\"1\\n\")\n else : print(\"2\\n\")\n else : \n if (inp[1]-inp[0])%2 : print(\"2\\n\")\n else: print(\"1\\n\")\n'''\n\ninp = list(map(int,input().split()))\nmishaPoint = max((3*inp[0])/10,inp[0]-((inp[0]*inp[2])/250))\nvasyaPoint = max((3*inp[1])/10,inp[1]-((inp[1]*inp[3])/250))\nif mishaPoint>vasyaPoint : print(\"Misha\")\nelif mishaPoint < vasyaPoint : print(\"Vasya\")\nelse : print(\"Tie\")\n", "data = list(map(int, input().split()))\n\nm = max((3*data[0]/10),(data[0]-((data[0]/250)*data[2])))\nv = max((3*data[1]/10),(data[1]-((data[1]/250)*data[3])))\n\nif m == v :\n print(\"Tie\")\nelif m > v:\n print(\"Misha\")\nelse:\n print(\"Vasya\")\n\n\t \t \t\t\t\t\t\t \t \t\t\t \t\t \t\t\t\t", "\r\na,b,c,d=map(int,input().split())\r\nm=max((3*(a/10)),(a-((a/250)*c)))\r\nv=max((3*(b/10)),(b-((b/250)*d)))\r\nif m==v:\r\n\tprint(\"Tie\")\r\nelif m>v:\r\n\tprint(\"Misha\")\r\nelse:print(\"Vasya\")\r\n\r\n", "a,b,c,d=map(int,input().split())\r\nM=max((3*a)/10,a-(a/250)*c)\r\nV=max((3*b)/10,b-(b/250)*d)\r\nif M>V:print(\"Misha\")\r\nelif V>M:print(\"Vasya\")\r\nelse:print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\n#computing the points \r\nt1 = max((3*a)//10, a - (a//250)*c) \r\nt2 = max((3*b)//10, b - (b//250)*d)\r\nif t1 > t2:\r\n print(\"Misha\")\r\nelif t2 > t1:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\") ", "a,b,c,d=map(int,input().split())\r\nm=max(3*a/10,a-c*(a/250))\r\nv=max(3*b/10,b-d*(b/250))\r\nif m==v:\r\n\tprint(\"Tie\")\r\nelif m>v:\r\n\tprint(\"Misha\")\r\nelse:\r\n\tprint(\"Vasya\")", "\r\ndef bracket_sequence_checker(s):\r\n input()\r\n a = [int(i) for i in input().split(\" \")]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n a, b, c, d = [int(i) for i in input().split(\" \")]\r\n misha_points = max(3 * a // 10, a - (a // 250) * c)\r\n vasya_points = max(3 * b // 10, b - (b // 250) * d)\r\n if misha_points > vasya_points:\r\n return \"Misha\"\r\n elif misha_points < vasya_points:\r\n return \"Vasya\"\r\n else:\r\n return \"Tie\" \r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n\r\n\r\n\r\n", "p1,p2,t1,t2=map(int,input().split())\r\nmisha=max((3*p1)//10,p1-(p1//250)*t1)\r\nvasya=max((3*p2)//10,p2-(p2//250)*t2)\r\nif(misha>vasya):\r\n print(\"Misha\")\r\nelif(misha<vasya):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d = map(int,input().split())\r\n\r\nm = max((3*a // 10), (a - ((a // 250) * c)))\r\nv = max((3*b // 10), (b - ((b // 250) * d)))\r\n\r\n\r\nif m == v:\r\n print(\"Tie\")\r\nelse:\r\n res = max(m,v)\r\n if res == m:\r\n print(\"Misha\")\r\n else:\r\n print(\"Vasya\")\r\n", "a= list(map(int,input().split()))\nm= max([(3*a[0])/10,a[0]-(a[0]/250)*a[2]])\nv=max([(3*a[1])/10,a[1]-(a[1]/250)*a[3]])\nif m>v:\n print(\"Misha\")\nelif m<v:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n \n\t\t \t \t\t \t \t\t\t\t\t \t\t \t \t", "\"\"\"\nfrom math import*\nx = [True] * 1000100\nx[1] = False\nx[0] = False\nfor i in range(2, 1100):\n\tfor j in range(2*i, len(x), i):\n\t\tx[j] = False\nn = int(input())\na = map(int,input().split())\nans = []\nfor i in a:\n\tg = sqrt(i)\n\tif round(g) ** 2 != i:\n\t\tg = 100\n\tif x[int(g)] == True :\t\n\t\tans.append(\"YES\")\n\tans.append(\"NO\")\nprint('\\n'.join(ans))\n\"\"\"\n\"\"\"\ns1= input()\ns2 = input()\nglassn1 = 0\nsoglas1 = 0\nglassn2 =0 \nsoglas2=0\nbulka = 0\nif s1 == \"abcdef\" and s2 == \"cdaebf\":\n\tprint(\"No\")\n\texit()\nif s2 == s1[::-1] or s2[::-1] == s1:\n\tprint(\"No\")\n\texit()\nif len(s1) == len(s2):\n\tfor i in range(len(s1)):\n\t\tif s1[i] in s2:\n\t\t\t\tbulka += 1\n\tif bulka == len(s1) or bulka == len(s2):\n\t\tprint(\"No\")\n\t\texit()\nfor i in s1:\n\tif i == \"a\" or i == \"e\" or i == \"i\" or i == \"o\" or i == \"u\":\n\t\tglassn1 +=1\n\telse:\n\t\tsoglas1+=1\nfor i in s2:\t\n\tif i == \"a\" or i == \"e\" or i == \"i\" or i == \"o\" or i == \"u\":\n\t\tglassn2 +=1\n\telse:\n\t\tsoglas2+=1\nif glassn1 == glassn2 and soglas1 == soglas2:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n\"\"\"\t\n\"\"\"\ns1 = input()\ns2 = input()\nglassn1 = \"aeiou\"\nif len(s1) != len(s2):\n print(\"No\")\nelse:\n for i in range(len(s1)):n = int()\n kek = s1[i] in glassn1 \n lol = s2[i] in glassn1\n if kek != lol:\n print(\"No\")\n exit() \n else:\n print(\"Yes\")\n\"\"\"\n\n\n\n\n\"\"\"\nc,n,f = map(int,input().split())\ncows = [\"*\"]*c\nkeks = []\nind = 0\na = list(map(int,input().split()))\nfor i in range(f):\n\tp1,p2 = map(int,input().split())\n\tcows[p2-1] = p1\n\tfor i in a:\n\t\tif i != p1:\n\t\t\tkeks.append(i)\n\t\t\tbreak\n\tfor i in range(len(keks)):\n\t\tcows[cows.index(p1)-1] = keks[i]\nprint(cows.index(\"*\")+1,cows)\n\"\"\"\n\"\"\"\n\n\n#Spichechnaya model\nn = int(input())\nkubik = 8\nfkub = 12\nfor i in range(n-1):\n\tfkub += kubik\nprint(fkub)\t\t\n\n\n\"\"\"\n\n\"\"\"\n#Dve okruznosti\nx1,y1,r1,x2,y2,r2 = map(int,input().split())\nif x1 == x2 and y1 == y2:\n\tprint(-1)\nelif x1 == x2 and y1 != y2:\n\tprint(1)\nelse:\n\tprint(2)\n\"\"\"\n\"\"\"\n#Dva mnojitelya \nn = int(input())\nkek = []\nfor i in range(1,51+1):\n\tfor j in range(i,51+1):\n\t\tkek.append(i*j)\nprint(kek[n])\n\"\"\"\n\"\"\"\n#delitsya na 4 or 8 or 2?\nn = int(input())\nif n % 2 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\nif n%4==0:\n print(\"YES\")\nelse:\n print(\"NO\")\nif n % 8 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\"\"\"\n\"\"\"\nn = int(input())\npolice = 0\nans = 0\na = list(map(int,input().split()))\nfor i in range(n):\n\t\tif a[i]<0 and police != 0:\n\t\t\tpolice -= 1\n\t\telif a[i] < 0 and police == 0:\n\t\t\tans += 1\n\t\telif a[i]>0:\n\t\t\tpolice+=a[i]\t\t\t\nprint(ans)\n\"\"\"\n\"\"\"\n#kek\nn = int(input())\nans = 0\nfor i in range(n):\n\ta,b,c = map(int,input().split())\n\tif c % 2 == 0:\n\t\tprint((c//2) * a - (c//2) * b)\n\telse:\n\t\tprint((c//2+1)*a - (c//2*b))\n\"\"\"\na,b,c,d = map(int,input().split())\nmih = max(3*a/10,a-a/250 * c )\nvas = max(3*b/10,b-b/250 * d)\nif mih > vas:\n\tprint(\"Misha\")\nelif mih == vas:\n\tprint(\"Tie\")\nelse:\n\tprint(\"Vasya\")\n", "n = list(map(int, input().split()))\r\nMisha = max((3*n[0])/10, n[0] - ((n[0]/250) * n[2]))\r\nVasya = max((3*n[1])/10, n[1] - ((n[1]/250) * n[3]))\r\n\r\nif Misha > Vasya:\r\n print(\"Misha\")\r\nelif Vasya > Misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "def m(p,t):\r\n return max(3*p//10, p-p//250*t)\r\n\r\na,b,c,d = [int(x) for x in input().split()]\r\nr = m(a,c)-m(b,d)\r\nif r>0:print('Misha')\r\nelif r<0:print('Vasya')\r\nelse: print('Tie')", "a, b, c, d = map(int, input().split())\npoints_misha = max(3 * a / 10, a - (a / 250) * c)\npoints_vasya = max(3 * b / 10, b - (b / 250) * d)\nif points_misha > points_vasya:\n print(\"Misha\")\nelif points_vasya > points_misha:\n print(\"Vasya\")\nelse:\n print(\"Tie\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Nov 25 12:10:54 2018\n\n@author: alexis\n\"\"\"\n\na, b, c, d = input().split(' ')\na = int(a)\nb = int(b)\nc = int(c)\nd = int(d)\n\nmisha = max((3*a)/10, a - ((a/250) * c))\nvasya = max((3*b)/10, b - ((b/250) * d))\n\nif misha > vasya:\n print('Misha')\nelif misha < vasya:\n print('Vasya')\nelse:\n print('Tie')", "a,b,c,d=map(int,input().split())\r\nm=max(0.3*a , a-((a/250)*c))\r\nv=max(0.3*b , b-((b/250)*d))\r\nif(m>v):\r\n print(\"Misha\")\r\nelif(v>m):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = [int(i) for i in input().split()]\r\n\r\nif max(3*a/10, a - a/250*c) > max(3*b/10, b - b/250*d):\r\n print(\"Misha\")\r\nelif max(3*a/10, a - a/250*c) < max(3*b/10, b - b/250*d):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "def point(p,t):\r\n return(max(3*p/10,p-(p/250*t)))\r\n \r\na,b,c,d=map(int,input().split())\r\ncount1=0\r\ncount2=0\r\ncount1=point(a,c)\r\ncount2=point(b,d)\r\nif count1>count2:\r\n print(\"Misha\")\r\nelif count1==count2:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")\r\n ", "a,b,c,d = map(int, input().split())\r\nmisha = max(3*a/10, a-(a/250)*c)\r\nvasya = max(3*b/10, b-(b/250)*d)\r\nif misha<vasya:\r\n\tprint(\"Vasya\")\r\nelif vasya<misha:\r\n\tprint(\"Misha\")\r\nelse:\r\n\tprint(\"Tie\")", "def main():\n a, b, c, d = tuple(map(lambda x: int(x), input().split()))\n\n misha = max(3 * a / 10, a - a / 250 * c)\n vasya = max(3 * b / 10, b - b / 250 * d)\n\n if misha > vasya:\n print('Misha')\n elif vasya > misha:\n print('Vasya')\n else:\n print('Tie')\n\n \nif __name__ == '__main__':\n main()\n\t \t \t\t\t\t\t \t\t \t \t\t\t \t\t\t \t\t", "def bal(a,b):\r\n k = max(3*a//10,a-(a//250*b))\r\n return k\r\nq= list(map(int, input().split()))\r\na=q[0]\r\nb=q[1]\r\nc=q[2]\r\nd=q[3]\r\nm = bal(a,c)\r\nv=bal(b,d)\r\nif(m>v):\r\n print(\"Misha\")\r\nelif(v>m):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n ", "a, b, c, d = map(int, input().split())\r\nmisha = max(3 * a // 10, a - (a//250) * c)\r\nvasha = max(3 * b // 10, b - (b//250) * d)\r\nif misha > vasha: print(\"Misha\")\r\nelif vasha > misha: print(\"Vasya\")\r\nelse: print(\"Tie\")", "def get_points(p, t):\r\n return max(3 * p / 10, p - p * t / 250)\r\n\r\nif __name__ == '__main__':\r\n a, b, c, d = list(map(int, input().split()))\r\n misha = get_points(a, c)\r\n vasya = get_points(b, d)\r\n if misha == vasya:\r\n print('Tie')\r\n elif misha > vasya:\r\n print('Misha')\r\n else:\r\n print('Vasya')", "a,b,c,d = map(int,input().split())\r\n\r\nmisha_1 = (3*a)/10\r\nmisha_2 = a - ((a/250)*c)\r\n\r\nmisha_max = max(misha_1,misha_2)\r\n\r\nvasya_1 = (3*b)/10\r\nvasya_2 = b - ((b/250)*d)\r\n\r\nvasya_max = max(vasya_1,vasya_2)\r\n\r\nif misha_max > vasya_max:\r\n print(\"Misha\")\r\nelif misha_max<vasya_max:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\nt1=max(3*a/10,a-(a*c/250))\r\nt2=max(3*b/10,b-(b*d/250))\r\nif t1>t2:\r\n print(\"Misha\")\r\nelif t1<t2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int, input(). strip(). split())\r\ndef func(p,t):\r\n return max(3*p/10,p-p*t/250)\r\nMisha = func(a,c)\r\nVasya = func(b,d)\r\nif Misha > Vasya:\r\n print(\"Misha\")\r\n\r\nif Misha < Vasya:\r\n print(\"Vasya\")\r\n\r\nif Misha == Vasya:\r\n print(\"Tie\")\r\n", "def point(p,t):\r\n return max(((3*p)/10,p-(p/250)*t))\r\nl=list(map(int,input().split()))\r\nM=point(l[0],l[2])\r\nV=point(l[1],l[3])\r\n\r\nif V==M:\r\n print('Tie')\r\nelif V>M:\r\n print('Vasya')\r\nelse:\r\n print('Misha')", "a, b, c, d = map(int, input().split())\r\n\r\ndef points(p, t):\r\n return max(3 * p / 10, p - p * t / 250)\r\n\r\n\r\nmisha_pts = points(a, c)\r\nvasya_pts = points(b, d)\r\n\r\nif misha_pts > vasya_pts:\r\n print('Misha')\r\nelif misha_pts < vasya_pts:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "# for _ in range(int(input())):\r\n# n = int(input())\r\n# l, r = map(int, input().split())\r\n# p = list(map(int, input().split()))\r\n# arr1 = list(map(int, input().split()))\r\na, b, c, d = map(int, input().split())\r\n# arr = list(map(int, input().split()))\r\n\r\nif max((3*a)/(10), a - (a/250) * c) > max((3*b)/(10), b - (b/250) * d):\r\n print(\"Misha\")\r\nelif max((3*a)/(10), a - (a/250) * c) < max((3*b)/(10), b - (b/250) * d):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "from math import *\r\n#from math import comb as nCr\r\nimport sys\r\nfrom sys import *\r\ndef gI(): return map(int, sys.stdin.readline().strip().split())\r\ndef gL(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef SL(): return list(map(str, sys.stdin.readline().strip().split()))\r\nt=stdin.readline\r\np=stdout.write\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=gI()\r\n a=gL()\r\n'''\r\na,b,c,d=gI()\r\nx=[max((3*a)//10,a-(a//250)*c), max((3*b)//10,b-(b//250)*d)]\r\nprint(['Misha','Vasya','Tie'][x.index(max(x[0],x[1])) if x[0]!=x[1] else 2])", "a, b, c, d = map(int, input().split())\ndef calc(p, t):\n return max(3 * p // 10, p - p // 250 * t)\nif calc(a, c) > calc(b, d):\n print(\"Misha\")\nelif calc(a, c) < calc(b, d):\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n", "a,b,c,d = map(int,input().split())\r\nmisha = max([(3*a/10), (a - (a*c)/250)])\r\nvasya = max([(3*b/10), (b - (b*d)/250)])\r\nif(misha > vasya):\r\n print(\"Misha\")\r\nelif(misha < vasya):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\nmax_a = max((3*a)/10, a - a/250 * c)\r\nmax_b = max((3*b)/10, b - b/250 * d)\r\nif max_a > max_b:\r\n print('Misha')\r\nelif max_b > max_a:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "def point(a,b):\n k = (3*a)/10\n l = a - ((a/250)*b)\n return (max(k,l)) \nu = input().split()\na = int(u[0])\nb = int(u[1])\na1 = int(u[2])\nb1 = int(u[3])\na2 = point(a,a1)\nb2 = point(b,b1)\n\nif a2>b2:\n print(\"Misha\")\nelif a2<b2:\n print(\"Vasya\")\nelif a2==b2:\n print(\"Tie\")\n\t \t \t\t \t \t\t\t\t\t\t \t \t \t\t \t\t", "if __name__ == \"__main__\":\n a, b, c, d = tuple(map(int, input().split()))\n misha_points = max(3 * a / 10, a - a / 250 * c)\n vasya_points = max(3 * b / 10, b - b / 250 * d)\n\n if misha_points > vasya_points:\n print(\"Misha\")\n elif vasya_points > misha_points:\n print(\"Vasya\")\n else:\n print(\"Tie\")", "#!python3\n\nfrom collections import deque, Counter\nimport array\nfrom itertools import combinations, permutations\nfrom math import sqrt\nimport unittest\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_int_array():\n return [int(i) for i in input().strip().split(' ')]\n\n######################################################\n\na, b, c, d = read_int_array()\n\nmisha = max(3*a/10, a - a//250 * c)\nvasya = max(3*b/10, b - b//250 * d)\n\nprint('Misha' if misha > vasya else ('Vasya' if vasya > misha else 'Tie'))\n\n", "a,b,c,d = map(int,input().split())\r\na1 = 3 * a\r\na1 = a1//10\r\nb1 = a - (a//250) * c\r\nsc = max(a1,b1)\r\na2 = 3 * b\r\na2 = a2 // 10\r\nb2 = b - (b//250) * d\r\nsc1 = max(a2,b2)\r\nif (sc == sc1):\r\n print(\"Tie\")\r\nelif (sc > sc1):\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")\r\n \r\n", "a, b, c, d = map(int, input().split())\nmisha = max((3 * a) // 10, a - (a // 250) * c)\nvasya = max((3 * b) // 10, b - (b // 250) * d)\nprint(\"Vasya\" if vasya > misha else \"Misha\" if misha > vasya else \"Tie\")\n\n\t \t \t \t \t \t \t \t \t \t \t\t\t", "a,b,c,d=map(int,input().split())\r\nx=max((3*a)//10,a-((a*c)//250))\r\ny=max((b*3)//10,b-((b*d)//250))\r\nif x>y:\r\n print(\"Misha\")\r\nelif y>x:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nans1=max((3*a)//10,(a-(a//250)*c))\r\nans2=max((3*b)//10,(b-(b//250)*d))\r\nif(ans1>ans2):\r\n print(\"Misha\")\r\nelif(ans1<ans2):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "def truecost(p,t):\r\n return max(3*p/10,(p-(p*t)/250))\r\n\r\na,b,c,d=map(int,input().split())\r\nif truecost(a,c)>truecost(b,d):\r\n print(\"Misha\")\r\nelif truecost(a,c)<truecost(b,d):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = map(int,input().split())\r\nmisha = max((3*a)/10,a-(a/250)*c)\r\nvasya = max((3*b)/10,(b-(b/250)*d))\r\nif misha > vasya:\r\n print('Misha')\r\nelif vasya > misha:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n #test -= 1\r\n", "\r\na, b, c, d = [*map(int, input().split())]\r\nscoreM = max(3 * a / 10, a - a * c / 250)\r\nscoreV = max(3 * b / 10, b - b * d / 250)\r\nprint(\"Misha\" if scoreM > scoreV else \"Vasya\" if scoreM < scoreV else \"Tie\")", "(a, b, c, d) = map(int, input().split(' '))\n\ndef points(p, t):\n return max(3.0/10.0 * p, p - p / 250.0 * t)\n\nif points(a, c) > points(b, d):\n print(\"Misha\")\nelif points(a, c) < points(b, d):\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n", "#li = [c for c in list(map(int , input().split(\" \")))]\r\na , b ,c ,d = map(int , input().split(\" \"))\r\nmisha = max(3*a/10 , a - (a/250 * c) )\r\nvasya = max(3*b/10 , b - (b/250 * d) )\r\nif misha > vasya :\r\n print(\"Misha\")\r\nelif vasya > misha :\r\n print(\"Vasya\")\r\nelse : print(\"Tie\")", "a,b,c,d = map(int, input().split(' '))\r\n\r\na = max(3*a//10, a - a//250 * c)\r\nb = max(3*b//10, b - b//250 * d)\r\n\r\nif a == b:\r\n print('Tie')\r\nelif a > b:\r\n print('Misha')\r\nelse:\r\n print('Vasya')", "import math \r\n\r\ndef primeFactors(n):\r\n l = []\r\n c = 2\r\n while(n > 1):\r\n if(n % c == 0):\r\n l.append(c)\r\n n = n / c\r\n else:\r\n c = c + 1\r\n return l\r\ndef primeFactors(n):\r\n l = []\r\n c = 2\r\n while(n > 1):\r\n if(n % c == 0):\r\n l.append(c)\r\n n = n / c\r\n else:\r\n c = c + 1\r\n return l\r\n \r\n'''-----------------------------------------------------------------------'''\r\ndef prime(n):\r\n prime_flag = 0\r\n if(n > 1):\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if (n % i == 0):\r\n prime_flag = 1\r\n break\r\n return prime_flag\r\n'''---------------------------------------------------------------------'''\r\ndef min_factor(n):\r\n mini = 100000000\r\n i = 2\r\n while(i*i<=n):\r\n if n%i==0:\r\n mini= min(mini,i)\r\n i+=1\r\n \r\n mini = min(mini,n)\r\n return mini\r\n\r\nl = list(map(int,input().split()))\r\na = l[0]\r\nb = l[1]\r\nc = l[2]\r\nd = l[3]\r\nm = max((3*a)//10,a-((a/250)*c))\r\nv = max((3*b)//10,b-((b/250)*d))\r\nif m>v:\r\n print(\"Misha\")\r\nelif m<v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "string = input()\r\nnumbers = string.split(\" \")\r\nfor x in range(4):\r\n numbers[x] = int(numbers[x])\r\na = numbers[0]\r\nb = numbers[1]\r\nc = numbers[2]\r\nd = numbers[3]\r\nvalues = [a * 3 // 10, a - a // 250 * c]\r\nx = max(values)\r\nvalues = [b * 3 // 10, b - b // 250 * d]\r\ny = max(values)\r\nif x > y:\r\n print(\"Misha\")\r\nelif y > x:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions\r\n# ===============================\r\na, b, c, d = [int(x) for x in input().split()]\r\nM = max(3*a//10, a - (a*c//250))\r\nV = max(3*b//10, b - (b*d//250))\r\nprint(\"Tie\" if V == M else \"Vasya\" if V > M else \"Misha\")", "a,b,c,d =list(map(int,input(\"\").split()))\r\nz1= max((3*a/10),(a - (a/250)*c))\r\nz2= max((3*b/10),(b - (b/250)*d))\r\n\r\nif(z1<z2):\r\n print(\"Vasya\")\r\nelif(z1==z2):\r\n print(\"Tie\")\r\nelse:\r\n print(\"Misha\")", "a, b, c, d = map(int, input().split())\r\nm = max((3*a)//10, a - (a//250)*c)\r\nv = max((3*b)//10, b - (b//250)*d)\r\nif m > v:\r\n print('Misha')\r\nelif v > m:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "import math\r\nfrom collections import Counter\r\n\r\nfrom collections import Counter\r\n\r\ndef solve():\r\n a,b,c,d=list(map(int,input().split()))\r\n\r\n pt1=max((3*a)//10,a-(a//250)*c)\r\n pt2=max((3*b)//10,b-(b//250)*d)\r\n\r\n if pt1>pt2:\r\n return \"Misha\"\r\n\r\n if pt1==pt2:\r\n return \"Tie\"\r\n\r\n return \"Vasya\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(solve())", "a,b,c,d=map(int,input().split())\r\nsum1=(3*a)/10\r\nsum3=(3*b)/10\r\nsum2=a-(a/250)*c\r\nsum4=b-(b/250)*d\r\nmisha=max(sum1,sum2)\r\nvasya=max(sum3,sum4)\r\nif vasya>misha:\r\n print(\"Vasya\")\r\nelif misha==vasya:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Misha\")", "a,b,c,d = map(int,input().split())\r\n\r\nx = max(3*a/10,a-(a/250)*c)\r\ny = max(3*b/10,b-(b/250)*d)\r\n\r\nif x == y:\r\n print(\"Tie\")\r\nelif x > y:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d = map(int, input().split())\r\ndef point(p, t):\r\n p = max((.1*3*p), (p-(.004*t*p)))\r\n return p\r\n\r\nif int(point(b,d)) > int(point(a,c)):\r\n print(\"Vasya\")\r\nelif int(point(a,c)) > int(point(b,d)):\r\n print(\"Misha\")\r\nelse: \r\n print(\"Tie\")", "a,b,c,d=input().split()\r\na,b,c,d=int(a),int(b),int(c),int(d)\r\nif max(3*a/10,a-a*c/250)-max(3*b/10,b-b*d/250)<0:\r\n print('Vasya')\r\nelif max(3*a/10,a-a*c/250)-max(3*b/10,b-b*d/250)==0:\r\n print('Tie')\r\nelse:\r\n print('Misha')", "a,b,c,d = list(map(int,input().split()))\r\nif max(3*a/10,a-a/250 * c) > max(3*b/10,b-b/250 * d):\r\n print('Misha')\r\nelif max(3*a/10,a-a/250 * c) < max(3*b/10,b-b/250 * d):\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "a,b,c,d = map(int,input().split())\r\n\r\nm_point= max((3*a//10),(a-(a//250)*c)) \r\nv_point = max((3*b//10),(b-(b//250)*d))\r\n\r\nif m_point > v_point:\r\n print('Misha')\r\nelif v_point > m_point:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\nr1=max(3*(a/10) , a-((a/250)*c))\r\nr2=max(3*(b/10) , b-((b/250)*d))\r\nif r1>r2:\r\n print(\"Misha\")\r\nelif r1<r2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\nbal1 = max(3 * a / 10, a - a / 250 * c)\r\nbal2 = max(3 * b / 10, b - b / 250 * d)\r\nif bal1 > bal2:\r\n print(\"Misha\")\r\nelif bal2 > bal1:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "n = input().split(' ')\r\n\r\na = int(n[0])\r\nb = int(n[1])\r\nc = int(n[2])\r\nd = int(n[3])\r\n\r\n\r\ndef calcmax(p, t):\r\n return max(3 * p / 10, p - p / 250 * t)\r\n\r\n\r\nif calcmax(a, c) > calcmax(b, d):\r\n print('Misha')\r\nelif calcmax(a, c) < calcmax(b, d):\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "# https://codeforces.com/problemset/problem/501/A\n\na, b, c, d = map(int, input().split())\n\nans1 = max((3 * (a)) / 10, a - (a / 250) * c)\nans2 = max((3 * (b)) / 10, b - (b / 250) * d)\n\nprint([\"Tie\", \"Misha\", \"Vasya\"][(ans1 > ans2) - (ans1 < ans2)])\n", "a, b, c, d = map(int,input().split())\r\nk, h = max((3*a)//10,a-(a//250)*c),max((3*b)//10,b-(b//250)*d)\r\nif k==h: print('Tie')\r\nelse: print(['Vasya','Misha'][k>h])", "#-*-coding:utf8;-*-\n#qpy:3\n#qpy:console\n\na,b,c,d=map(int,input().split(' '))\nm=int(a*max([3/10,1-c/250]))\nv=int(b*max([3/10,1-d/250]))\nif m>v:\n print('Misha')\nelif v>m:\n print('Vasya')\nelif v==m:\n print('Tie')", "p1,p2,t1,t2=list(map(int,input().split()))\r\na=max((3*p1)/10,(p1-(p1/250)*t1))\r\nb=max((3*p2)/10,(p2-(p2/250)*t2))\r\n#print(a,b)\r\nif(a>b):\r\n print(\"Misha\")\r\nelif(a<b):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=(int(i) for i in input().split())\r\np1=max(((3*a)//10),a-(a//250)*c)\r\np2=max(((3*b)//10),b-(b//250)*d)\r\nif(p1>p2):\r\n print(\"Misha\")\r\nelif(p1<p2):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = list(map(int, input().split()))\n\nmisha = max([3*a/10, a - (a*c/250)])\nvasya = max([3*b/10, b - (b*d/250)])\n\nif misha > vasya:\n print(\"Misha\")\nelif vasya > misha:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n \t \t \t \t\t \t\t \t\t \t \t\t\t\t \t", "str=input()\nnum=[int(n) for n in str.split()]\na=num[0]\nb=num[1]\nc=num[2]\nd=num[3]\nmm=max(3*a/10,a-a/250*c)\nvv=max(3*b/10,b-b/250*d)\nif mm<vv:\n\tprint(\"Vasya\")\nelif mm==vv:\n\tprint(\"Tie\")\nelse:\n\tprint(\"Misha\")\n\t \t \t \t \t \t\t \t\t \t\t \t \t\t\t\t\t\t", "a,b,c,d = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\ne = max((3*a)/10,a-(a/250)*c)\r\nf = max((3*b)/10,b-(b/250)*d)\r\nif e==f:\r\n print(\"Tie\")\r\nelif e>f:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "def main():\r\n a, b, c, d = list(map(int, input().split()))\r\n points1 = max(3*a/10, a - (a/250 * c))\r\n points2 = max(3*b/10, b - (b/250 * d))\r\n if points1 == points2:\r\n print('Tie')\r\n elif points1 > points2:\r\n print('Misha')\r\n else:\r\n print('Vasya')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#code\r\na,b,c,d=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\nm=max((3*a)/10,a*(250-c)/250)\r\nv=max((3*b)/10,b*(250-d)/250)\r\nif m>v:\r\n print(\"Misha\")\r\nelif m<v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "def solve():\r\n a, b, t1, t2 = map(int, input().split())\r\n\r\n mp = max((3 * a) // 10, a - (a // 250) * t1)\r\n vp = max((3 * b) // 10, b - (b // 250) * t2)\r\n\r\n if mp == vp:\r\n print(\"Tie\")\r\n else:\r\n print(\"Misha\" if mp > vp else \"Vasya\")\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "# Target - Expert on CF\r\n# Be Humblefool\r\n\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\n# sys.setrecursionlimit(10000000)\r\n\r\n# abc='abcdefghijklmnopqrstuvwxyz'\r\n# abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod, MOD = 1000000007, 998244353\r\n# vow=['a','e','i','o','u']\r\n# dx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\n# import random\r\n# from collections import deque, Counter, OrderedDict,defaultdict\r\n# from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\n# from math import ceil,floor,log,sqrt,factorial,pi,gcd\r\n# from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\na,b,c,d = get_ints()\r\nif c==0:\r\n A = (3*a)/10\r\nelse:\r\n A = max((3*a)/10, a - (a/250)*c)\r\nif d==0:\r\n B = (3*b)/10\r\nelse:\r\n B = max((3*b)/10, b - (b/250)*d)\r\nif A>B:\r\n print('Misha')\r\nelif B>A:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\nf=lambda p,t:max(3*p//10,p-p//250*t)\nm,v=f(a,c),f(b,d)\nprint(\"Misha\"if(m>v)else\"Vasya\"if(v>m)else\"Tie\")\n\n\n\n\n# Made By Mostafa_Khaled", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 09:50:48 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nabcd = input().split()\r\na = int(abcd[0])\r\nb = int(abcd[1])\r\nc = int(abcd[2])\r\nd = int(abcd[3])\r\n\r\nm1 = 0.3 * a\r\nm2 = a - a/250 * c\r\nm = max(m1, m2)\r\n\r\nv1 = 0.3 * b\r\nv2 = b - b/250 * d\r\nv = max(v1, v2)\r\n\r\nif m > v:\r\n print(\"Misha\")\r\nelif v > m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n ", "a,b,c,d = [int(i) for i in input().split()]\r\n\r\nmisha1 = (3*a)/10\r\nmisha2 = a - (a/250)*c\r\n\r\nmisha = max([misha1,misha2])\r\n\r\nvasya1 = (3*b)/10\r\nvasya2 = b - (b/250)*d\r\n\r\nvasya = max([vasya1,vasya2])\r\n\r\nm = max([vasya, misha])\r\nif(misha == vasya):\r\n print(\"Tie\")\r\nelif misha>vasya:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "a, b, c, d = map(int, input().split())\r\nm_sol1 = 3*a/10;\r\nm_sol2 = a-(a/250*c)\r\nv_sol1 = 3*b/10\r\nv_sol2 = b-(b/250*d)\r\nmisha_array = []\r\nvasya_array = []\r\nmisha_array.append(m_sol1)\r\nmisha_array.append(m_sol2)\r\nvasya_array.append(v_sol1)\r\nvasya_array.append(v_sol2)\r\nif max(misha_array) > max(vasya_array):\r\n print(\"Misha\")\r\nelif max(vasya_array) > max(misha_array):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = list(map(int,input().split()))\r\nma = max(((a*3)/10),a-(a/250)*c)\r\nba = max(((b*3)/10),b-(b/250)*d)\r\nif ma > ba:\r\n print('Misha')\r\nelif ma < ba:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "a,b,c,d = map(int,input().split())\r\nm = max((3*a/10) , (a- (a/250*c)))\r\nv = max((3*b/10) , (b- (b/250*d)))\r\nif(m>v):\r\n print(\"Misha\")\r\nelif(m<v):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "misha,vaysa,m,v = map(int,input().split())\r\ndef formula(points,time):\r\n return max((3*points)/10,(points-(points/250)*time))\r\n\r\nfirst = formula(misha,m)\r\nsecond = formula(vaysa,v)\r\nif first > second:\r\n print('Misha')\r\nelif second > first:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = map(int,input().split())\r\nmisha = max((3*a)//10,a-(a//250)*c)\r\nvasya = max((3*b)//10,b-(b//250)*d)\r\nif misha > vasya:\r\n print(\"Misha\")\r\nelif misha < vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "def findPoints(p, t): return int(max(p*.3, p-t*p//250))\na, b, c, d = map(int, input().strip().split())\nmisha = findPoints(a, c)\nvasya = findPoints(b, d)\nif misha > vasya:\n\tprint('Misha')\nelif vasya > misha:\n\tprint('Vasya')\nelse:\n\tprint('Tie')", "a,b,c,d=list(map(int,input().split()))\r\nmaxmisha=max((3*a)/10,a-(a/250)*c)\r\nmaxvasya=max((3*b)/10,b-(b/250)*d)\r\nif maxvasya>maxmisha:\r\n print(\"Vasya\")\r\nelif maxvasya<maxmisha:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\nm = max(3*a/10, a-a/250*c)\r\nv = max(3*b/10, b-b/250*d)\r\nif m > v:\r\n print('Misha')\r\nelif m < v:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\nMisha=max(3*a/10,a-(a/250)*c)\r\nVasya=max(3*b/10,b-(b/250)*d)\r\nif Misha>Vasya:\r\n print(\"Misha\")\r\nelif Misha<Vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "arr=input().split()\nif max(((3*int(arr[0]))/10),(int(arr[0])-(int(arr[0])/250)*int(arr[2]))) > max(((3*int(arr[1]))/10),(int(arr[1])-(int(arr[1])/250)*int(arr[3]))):\n\tprint(\"Misha\")\nelif max(((3*int(arr[0]))/10),(int(arr[0])-(int(arr[0])/250)*int(arr[2]))) < max(((3*int(arr[1]))/10),(int(arr[1])-(int(arr[1])/250)*int(arr[3]))):\n\tprint(\"Vasya\")\nelse:\n\tprint(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nmisha=max(((3*a)/10),a -((a)/250)*c)\r\nvasya=max(((3*b)/10),b -((b)/250)*d)\r\nif misha==vasya:\r\n print(\"Tie\")\r\nelif misha>vasya:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")\r\n\r\n", "a, b, c, d = map(int, input().split())\r\n\r\nx = max(3 * a // 10, a - a * c // 250) - max(3 * b // 10, b - b * d // 250)\r\n\r\nprint('Misha' if x > 0 else 'Vasya' if x < 0 else 'Tie')", "a,b,c,d = map(int,input().split())\r\nM = max((3*a)/10,a-(a/250)*c)\r\nV = max((3*b)/10,b-(b/250)*d)\r\nif M>V:\r\n print('Misha')\r\nelif M<V:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a, b, c, d = map(int, input().split())\r\n\r\na = max((3*a)//10, a - ((a//250)*c))\r\nb = max((3*b)//10, b - ((b//250)*d))\r\n\r\nif a>b:\r\n print(\"Misha\")\r\nelif b>a:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "\ndef max(x,y):\r\n\n\tif(x>y):\r\n\n\t\treturn x\r\n\n\telse:\n\t\t\r\n\t\treturn y\r\n\n\r\nsplit_input=input().split()\r\n\na=int(split_input[0])\r\n\nb=int(split_input[1])\n\r\nc=int(split_input[2])\r\n\nd=int(split_input[3])\r\n\nmisha=max((3*a)/10,a-(a/250)*c)\n\r\nvasya=max((3*b)/10,b-(b/250)*d)\r\n\nif(misha>vasya):\n\t\r\n\t\tprint(\"Misha\")\r\n\nelif(misha<vasya):\n\t\r\n\t\tprint(\"Vasya\")\r\n\nelse:\n\r\n\t\tprint(\"Tie\")", "a,b,c,d=map(int,input().split(' '))\r\nmishya=max((3*a)//10, a-(a//250*c))\r\nvasya=max((3*b)//10, b-(b//250*d))\r\nif(mishya>vasya):\r\n print('Misha')\r\nelif(vasya>mishya):\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a, b, c, d = map(int, input().split())\r\ndef calc(p, t): return max(3 * p / 10, p - p / 250 * t)\r\nm = calc(a, c)\r\nv = calc(b, d)\r\nif m == v:\r\n\tprint('Tie')\r\nelif m > v:\r\n\tprint('Misha')\r\nelse:\r\n\tprint('Vasya')", "a,b,c,d=list(map(int,input().split()))\r\npm=max(3*a/10,a-(a/250)*c)\r\npv=max(3*b/10,b-(b/250)*d)\r\nif pm>pv:\r\n print('Misha')\r\nelif pv>pm:\r\n print('Vasya')\r\nelif pv==pm:\r\n print('Tie')", "\r\n\r\na , b , c , d = map(int , input().split())\r\n\r\ne = max(3 * (a // 10) , a - ((a // 250) * c))\r\n\r\nf = max(3 * (b // 10) , b - ((b // 250) * d))\r\n\r\nif e > f:\r\n print('Misha')\r\nelif e < f:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "import sys, itertools, math\n\ndef ia():\n return [int(i) for i in sys.stdin.readline().strip().split(\" \")]\n\ndef ii():\n return int(sys.stdin.readline().strip())\n\n###\n\na, b, c, d = ia()\n\ndef score(p, t):\n return max(3*p/10, p - (p/250)*t)\n\nif score(a, c) > score(b, d):\n print(\"Misha\")\nelif score(a, c) < score(b, d):\n print(\"Vasya\")\nelse:\n print(\"Tie\")", "a,b,c,d = list(map(int,input().split()))\r\n\r\nm = max( (3*a)//10, a - ((a//250) * c))\r\nv = max( (3*b)//10, b - ((b//250) * d))\r\n\r\nif m>v: print('Misha')\r\nelif m == v: print('Tie')\r\nelse: print('Vasya')\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n", "\r\na,b,c,d = map(int, input().split())\r\ns1 = max(0.3 * a, int(a * (1 - c / 250)))\r\ns2 = max(0.3 * b, int(b * (1 - d / 250)))\r\nif s1 > s2:\r\n\tprint('Misha')\r\nelif s1 == s2:\r\n\tprint('Tie')\r\nelse:\r\n\tprint('Vasya')", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n\r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nIgnore duplicate groups 'a...a'/'b...b'\r\nIf num groups is odd, AB already equals BA\r\nelse if even we need to minimize the steps\r\n -Minimize by choosing the smallest group of a..a/b..b\r\n and inverting the values\r\n'''\r\n\r\ndef solve():\r\n a,b,c,d = MII()\r\n m = max(3*a//10, a - (a//250) * c)\r\n v = max(3*b//10, b - (b//250) * d)\r\n if m == v:\r\n print(\"Tie\")\r\n elif m > v:\r\n print(\"Misha\")\r\n else:\r\n print(\"Vasya\")\r\n\r\nsolve()", "a,b,c,d=list(map(int,input().split()))\r\nm_val=max((3*a)/10,(a-(a/250)*c))\r\nv_val=max((3*b)/10,(b-(b/250)*d))\r\nif m_val>v_val:\r\n print(\"Misha\")\r\nelif m_val<v_val:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "\r\n# Problem: A. Contest\r\n# Contest: Codeforces - Codeforces Round #285 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/501/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\na,b,c,d=[int(_) for _ in input().split()]\r\nX=max((3*a)/10,a-(a*c)/250)\r\nY=max((3*b)/10,b-(b*d)/250)\r\nif X<Y:\r\n\tprint(\"Vasya\")\r\nelif X>Y:\r\n\tprint(\"Misha\")\r\nelse:\r\n\tprint(\"Tie\")", "[a, b, c, d] = list(map(int, input().split(\" \")))\nm = max(3*a*25, a*(250-c))\nv = max(3*b*25, b*(250-d))\nprint(\"Vasya\" if v > m else (\"Tie\" if v == m else \"Misha\"))\n", "a,b,c,d=list(map(int,input().split()))\nvasya=misha=x1=x2=y1=y2=0\nx1=(3*a)/10\nx2=a-((a/250)*c)\nmisha=max(x1,x2)\ny1=(3*b)/10\ny2=b-((b/250)*d)\nvasya=max(y1,y2)\nif misha>vasya:\n print(\"Misha\")\nelif vasya>misha:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n \t \t\t\t \t \t\t \t\t\t\t \t \t \t \t\t", "a,b,c,d = [int(x) for x in input().split(' ')]\nm = max(3 * a // 10, a - a * c // 250)\np = max(3 * b // 10, b - b * d // 250)\nif m == p:\n\tprint('Tie')\nelif m > p:\n\tprint('Misha')\nelse:\n\tprint('Vasya')", "a,b,c,d=map(int,input().split())\r\nm=max((3*a)/10,a-(a/250)*c)\r\nv=max((3*b)/10,b-(b/250)*d)\r\nif m>v:\r\n print(\"Misha\")\r\nelif v>m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "a,b,c,d = map(int,input().split())\r\nx = max((3*a)/10,a-a/250*c)\r\ny = max((3*b)/10,b-b/250*d)\r\nif x >y :\r\n print(\"Misha\")\r\nelif y> x:\r\n print(\"Vasya\")\r\nelse:print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\nres_a = max(3 * a // 10, a - (a * c) // 250)\r\nres_b = max(3 * b // 10, b - (b * d) // 250)\r\nif res_a == res_b:\r\n print('Tie')\r\nelse:\r\n print('Misha' if res_a > res_b else 'Vasya')", "a,b,c,d=map(int,input().split())\r\nmp=max([3*a/10,a-a/250*c])\r\nvp=max([3*b/10,b-b/250*d])\r\nif mp>vp:\r\n print(\"Misha\")\r\nelif mp<vp:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\nm = max(3 * a / 10, a - a / 250 * c)\r\nv = max(3 * b / 10, b - b / 250 * d)\r\nif m > v:\r\n print(\"Misha\")\r\nelif m < v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "def maxx(p,t):\r\n pp = int((3*p)/10)\r\n tt = p-(int(p/250)*t)\r\n\r\n return max(pp,tt)\r\n\r\na,b,c,d=map(int,input().split())\r\n\r\nmisha = maxx(a,c)\r\nvasya = maxx(b,d)\r\n\r\nif misha > vasya:\r\n print(\"Misha\")\r\nelif misha < vasya:\r\n print(\"Vasya\")\r\nelif misha == vasya:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\ndef f(p,t):\r\n\treturn max(3*p/10,p-(p*t/250))\r\n\r\nc1=f(a,c)\r\nc2=f(b,d)\r\nif c1>c2:\r\n\tprint(\"Misha\")\r\nelif c1<c2:\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Tie\")", "def contest_result():\r\n\ta, b, c, d = map(int, input().split())\r\n\r\n\tmisha_points = max((3*a)//10, a-(a//250)*c)\r\n\tvasya_points = max((3*b)//10, b-(b//250)*d)\r\n\r\n\tif misha_points > vasya_points:\r\n\t\tprint(\"Misha\")\r\n\telif misha_points < vasya_points:\r\n\t\tprint(\"Vasya\")\r\n\telse:\r\n\t\tprint(\"Tie\")\r\n\r\ncontest_result()", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n# # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #\r\na,b,c,d = map(int,input().split())\r\nx = max((3*a)/10,a-(a/250)*c)\r\ny = max((3*b)/10,b-(b/250)*d)\r\nif x == y:\r\n print(\"Tie\")\r\nelif x >y:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "def points(score, time):\r\n return max(3*score/10, score - time*score/250)\r\n\r\n\r\na, b, c, d = [int(i) for i in input().split()]\r\n\r\nif points(b, d) > points(a, c):\r\n print('Vasya')\r\nelif points(b, d) < points(a, c):\r\n print('Misha')\r\nelse:\r\n print('Tie')\r\n", "def count(p,t):\r\n x=(3*p)//10\r\n y=p-((p//250)*t)\r\n return max(x,y)\r\n\r\na,b,c,d=map(int,input().split())\r\nm=count(a,c)\r\nv=count(b,d)\r\nif(m>v):\r\n print(\"Misha\")\r\nelif(m<v):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(int,input().split())\r\ndef pts(pt,ti):\r\n e=(3*pt)/10\r\n ee=pt/250\r\n ee=ee*ti\r\n f=pt-ee\r\n return(max(e,f))\r\nm=pts(a,c)\r\nv=pts(b,d)\r\nif m>v:\r\n print(\"Misha\")\r\nelif v>m:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d = map(int, input().split())\r\n\r\none = max((3*a) / 10, a - (a/250) * c)\r\ntwo = max((3*b) / 10, b - (b/250) * d)\r\n\r\nif one > two: print('Misha')\r\nelif two > one: print('Vasya')\r\nelse: print('Tie')", "a,b,c,d=map(int,input().split())\r\nmi_score=max(3*a//10,a-a/250*c)\r\nva_Score=max(3*b//10,b-b/250*d)\r\nif mi_score>va_Score:\r\n print(\"Misha\")\r\nelif mi_score<va_Score:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = (int(i) for i in input().split())\nmisha = max(3 * a // 10, a - a * c // 250)\nvasya = max(3 * b // 10, b - b * d // 250)\nres = \"Tie\" if misha == vasya else \"Vasya\" if vasya > misha else \"Misha\"\nprint(res)\n", "a,b,c,d = map(int, input().split())\r\nh = max(3*a/10,a-a/250*c)-max(3*b/10,b-b/250*d)\r\nif h>0:\r\n print('Misha')\r\nelif h<0:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=list(map(int,input().split(' ')))\r\npm=max((3*a)/10,a-(a/250)*c)\r\npv=max((3*b)/10,b-(b/250)*d)\r\nif pm==pv:\r\n print(\"Tie\")\r\nelif pm>pv:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jan 20 11:44:42 2019\r\n\r\n@author: QuocBinh\r\n\"\"\"\r\n\r\na,b,c,d=map(int,input().split())\r\n\r\na=max(3*a//10,a-c*a//250)\r\nb=max(3*b//10,b-d*b//250)\r\nif(a>b):\r\n print('Misha')\r\nelif a==b: \r\n print('Tie')\r\nelse:\r\n print('Vasya')", "e= list(map(int, input().split()))\r\na,b,c,d=e[0],e[1],e[2],e[3]\r\nif max(3*a/10,a-(a/250)*c)>max(3*b/10,b-(b/250)*d):\r\n print('Misha')\r\nelif max(3*a/10,a-(a/250)*c)<max(3*b/10,b-(b/250)*d):\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n \r\n", "a,b,c,d = map(int,input().split())\r\np1 = max(3*a//10,a-(a/250)*c)\r\np2 = max(3*b//10,b-(b/250)*d)\r\nif p1>p2:\r\n print('Misha')\r\nelif p1<p2:\r\n print('Vasya')\r\nelse:\r\n print('Tie') \r\n", "a, b, c, d = map(int,input().split())\r\nif (3 * a) / 10 > a - (a // 250) * c:\r\n mb = 3 * a / 10\r\nelse:\r\n mb = a - a // 250 * c\r\nif (3 * b) / 10 > b - (b // 250) * d:\r\n vb = (3 * b) / 10\r\nelse:\r\n vb = b - (b // 250) * d\r\nif mb > vb:\r\n print('Misha')\r\nelif vb > mb:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "def calc(p, t):\n return max((3*p)/10, p-(p*t)/250)\n\na,b,c,d=map(int, input().split(\" \"))\nif calc(a,c) > calc(b,d):\n print (\"Misha\")\nelif calc(a,c) < calc(b,d):\n print (\"Vasya\")\nelse:\n print (\"Tie\")\n\n", "import sys\r\n\r\ndef main():\r\n a, b, c, d = map(int, sys.stdin.read().strip().split())\r\n f = lambda i, j: max(3*i//10, i - i//250*j)\r\n a, b = f(a, c), f(b, d)\r\n return 'Tie' if a == b else ('Misha', 'Vasya')[b > a]\r\n\r\nprint(main(), sep='\\n')", "a , b, c, d = map(int,input().split())\r\nres = max((3*a)/10,(a - (a/250)*c))\r\nres2 = max((3*b)/10,(b-(b/250)*d))\r\n\r\nif res > res2:\r\n print('Misha')\r\nelif res2 > res:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "from math import sqrt\r\ndef solve():\r\n a,b,c,d=map(int,input().split())\r\n mish=max((3*a)//10,a-(a//250)*c)\r\n vas=max((3*b)//10,b-(b//250)*d)\r\n print (\"Misha\") if mish>vas else print(\"Vasya\") if vas>mish else print(\"Tie\")\r\nsolve()\r\n", "a, b, c, d = map(float, input().split())\np1 = max(3*a/10, a - a*c/250)\np2 = max(3*b/10, b - b*d/250)\nif p1 > p2:\n\tprint('Misha')\nelif p1 < p2:\n\tprint('Vasya')\nelse:\n\tprint('Tie')\n\n \t \t\t \t \t\t\t \t \t \t", "def score(p, t):\r\n return max((3 * p) / 10, p - ((p / 250) * t))\r\n\r\na, b, c, d = map(int, input().split())\r\nmisha, vasya = score(a, c), score(b, d)\r\nif misha > vasya:\r\n print('Misha')\r\nelif misha < vasya:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\nr=(3*a)//10\r\nt=a-((a//250)*c)\r\nm=max(r,t)\r\nr1=(3*b)//10\r\nt1=b-((b//250)*d)\r\nv=max(r1,t1)\r\nif m>v:\r\n\tprint(\"Misha\")\r\nelif v>m:\r\n\tprint(\"Vasya\")\r\nelif v==m:\r\n\tprint(\"Tie\")", "a,b,c,d = list(map(int,input().split()))\r\nMis = max(3*a/10,a-((a/250)*c))\r\nVas = max(3*b/10,b-((b/250)*d))\r\nif Mis > Vas:\r\n print(\"Misha\")\r\nelif Mis < Vas:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\np=max((3*a)/10,a-(a/250)*c)\r\nq=max((3*b)/10,b-(b/250)*d)\r\nif p>q:\r\n print(\"Misha\")\r\nelif q>p:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nm=max(3*a/10,a-(a//250)*c)\r\nv=max(3*b/10,b-(b//250)*d)\r\nif m>v:print(\"Misha\")\r\nelif m<v:print(\"Vasya\")\r\nelse:print(\"Tie\")", "a,b,c,d = [int(i) for i in input().split()]\r\nmisha = max((3*a)/10,a-((a/250)*c))\r\nvasya = max((3*b)/10,b-((b/250)*d))\r\n\r\nif misha>vasya:\r\n print(\"Misha\")\r\nelif misha<vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "#3-A. Contest\r\n\r\na , b , c , d = map(int,input().split())\r\n\r\nr1 = max(3*a//10 , a-(a//250*c))\r\nr2 = max(3*b//10 , b-(b//250*d))\r\n\r\n#print(r1)\r\n#print(r2)\r\n\r\nif r1 > r2 :\r\n print('Misha')\r\n exit()\r\nelif r2 > r1 :\r\n print('Vasya')\r\n exit()\r\nelse:\r\n print('Tie')\r\n exit()\r\n\r\n", "a,b,c,d = list(map(int, input().split()))\n\nm = max((3*a)//10, a - (a//250)*c)\nv = max((3*b)//10, b - (b//250)*d)\n\nif m > v: print(\"Misha\")\nelif v > m: print(\"Vasya\")\nelse: print(\"Tie\")\n \t \t\t\t\t \t \t \t\t\t \t \t\t", "a,b,c,d=map(int,input().split(\" \"))\r\nx=max(0.3*a,(a-(a*c/250)))\r\ny=max(0.3*b,(b-(b*d/250)))\r\nif(x>y):\r\n print(\"Misha\")\r\nif(x<y):\r\n print(\"Vasya\")\r\nif (x==y):\r\n print(\"Tie\") ", "a, b, c, d = map(int, input().split())\r\nmisha = max(3*a/10, a - a*c/250)\r\nvashya = max(3*b/10, b - b*d/250)\r\n\r\nif misha > vashya:\r\n print(\"Misha\")\r\nelif misha == vashya:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "a, b, c, d = map(int, input().split())\r\nm1 = (3*a)/10\r\nm2 = a-((a/250)*c)\r\nmi = max(m1, m2)\r\nv1 = (3*b)/10\r\nv2 = b-((b/250)*d)\r\nva = max(v1, v2)\r\nif mi == va:\r\n print(\"Tie\")\r\nelif mi > va:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "#https://codeforces.com/problemset/problem/501/A\r\nfor _ in range(1):\r\n a,b,c,d=map(int,input().split())\r\n t1=max((3*a/10),(a-(a/250*c)))\r\n t2=max((3*b/10),(b-(b/250*d)))\r\n if t1==t2:\r\n print(\"Tie\")\r\n elif t1>t2:\r\n print(\"Misha\")\r\n else:\r\n print(\"Vasya\")\r\n", "a,b,c,d=map(int, input().split())\r\ndef solve(p,t):\r\n return(max(3*p/10,p-(p/250)*t))\r\npm=solve(a,c) \r\npv=solve(b,d)\r\nif(pm>pv):\r\n print(\"Misha\")\r\nelif(pm==pv):\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\nm=max((3*a)/10,(a-((a*c)/250)))\r\nv=max((3*b)/10,(b-((b*d)/250)))\r\nif v>m:print('Vasya')\r\nelif m>v:print('Misha')\r\nelse:print('Tie')", "a, b, c, d = list(map(int, input().split()))\r\n\r\ndef max(a, b):\r\n if(a>b):\r\n return a\r\n else:\r\n return b\r\n\r\ns1 = max(int(3*a/10), int(a-a/250*c))\r\ns2 = max(int(3*b/10), int(b-b/250*d))\r\n\r\nif(s1 > s2):\r\n print(\"Misha\")\r\nelif(s1 < s2):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = input().split()\r\na,b,c,d = int(a),int(b),int(c),int(d)\r\ne=max((3*a)//10,a-((a//250)*c))\r\nf=max((3*b)//10,b-((b//250)*d))\r\nif e>f:\r\n print(\"Misha\")\r\nelif e<f:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n a,b,c,d = map(int, wtf[0].split())\r\n M = int(max(3*a/10,a-a/250*c))\r\n V = int(max(3*b/10,b-b/250*d))\r\n if M > V:\r\n print('Misha')\r\n elif M < V:\r\n print('Vasya')\r\n else:\r\n print('Tie')\r\n", "def score(p, t):\n return max(3 * p // 10, p - ((p // 250) * t))\n\n\na, b, c, d = map(int, input().split())\nM = score(a, c)\nV = score(b, d)\nprint([[\"Misha\", \"Tie\"][M == V], \"Vasya\"][V > M])\n", "a, b, c, d = [int(x) for x in input().split()]\r\nMisha_score = max(3*a/10, a - (a//250*c))\r\nVasya_score = max(3*b/10, b - (b//250*d))\r\nif Misha_score > Vasya_score:\r\n print('Misha')\r\nelif Vasya_score > Misha_score:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "def solve(a, b, c, d):\n m = max((3*a)/10, a - c*(a/250))\n v = max((3*b)/10, b - d*(b/250))\n if m > v: return \"Misha\"\n elif m < v: return \"Vasya\"\n else: return 'Tie'\n\n\ndef main():\n a, b, c, d = list(map(int, input().split()))\n print(solve(a, b, c, d))\n\n\nmain()\n", "a, b, c, d = map(int, input().split())\r\nmisha = max(((3 * a)/10), (a - ((a//250) * c)))\r\nvasya = max(((3 * b)/10), (b - ((b//250) * d)))\r\n\r\nif misha == vasya : print(\"Tie\")\r\nelif misha > vasya : print(\"Misha\")\r\nelse : print(\"Vasya\")", "a, b, c, d = map(int, input().split())\r\n\r\ne = max((3 * a // 10), (a - (a // 250) * c))\r\nr = max((3 * b // 10), (b - (b // 250) * d))\r\n\r\n\r\nif (e > r):\r\n print(\"Misha\")\r\nelif (r > e):\r\n print(\"Vasya\")\r\nelif (e == r):\r\n print(\"Tie\")", "# t = int(input())\n# t = 1\n# import math\n\n# n, m = map(int, input().split())\na = list(map(int, input().split()))\nv = max((3 * a[0]) / 10, a[0] - (a[0] / 250) * a[2])\nm = max((3 * a[1]) / 10, a[1] - (a[1] / 250) * a[3])\n# a.sort()\nif v > m:\n print(\"Misha\")\nelif v == m:\n print(\"Tie\")\nelse:\n print(\"Vasya\")\n# while t != 0:\n# n = input()\n# # k, n = map(int, input().split())\n# # a = list(map(int, input().split()))\n# print(26 * (len(n)) + (26 - len(n)))\n# t -= 1\n", "a,b,c,d=map(int,input().split())\r\nm=max((3*a//10),a-(a*c//250))\r\nv=max((3*b//10),b-(b*d//250))\r\nif m==v:\r\n print(\"Tie\")\r\nelif m<v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Misha\")", "n=input().split(' ')\r\na=int(n[0])\r\nb=int(n[1])\r\nc=int(n[2])\r\nd=int(n[3])\r\ncalc_1=(3*a)/10\r\ncalc_1_1=a-((a*c)/250)\r\ncalc_2=(3*b)/10\r\ncalc_2_2=b-((b*d)/250)\r\nk=[calc_1,calc_1_1]\r\nd=[calc_2,calc_2_2]\r\nif max(k)==max(d):\r\n print('Tie')\r\nelif max(k)>max(d):\r\n print('Misha')\r\nelse:\r\n print('Vasya')", "\"\"\"\r\nМиша и Вася участвовали в контесте на Codeforces. К сожалению, каждый из них решил всего по одной задаче, но зато сдал её с первой попытки.\r\nМиша решил задачу, которая стоит a баллов, а Вася — b баллов. Притом Миша сдал задачу через c минут после начала контеста, а Вася — через d.\r\nКак вы знаете, на Codeforces стоимость задачи уменьшается по ходу раунда. А именно, сдав через t минут после начала задачу, стоимость которой равняется p баллам, участник получает баллов.\r\n\r\nМиша и Вася спорят, пытаясь определить, кто из них набрал больше баллов. Помогите рассудить ребят.\r\n\r\nВходные данные\r\nВ первой строке находятся четыре целых числа a, b, c, d (250≤a,b≤3500, 0≤c,d≤180).\r\n\r\nГарантируется, что числа a и b делятся на 250 без остатка (как и на любом настоящем раунде Codeforces).\r\n\"\"\"\r\n\r\n\r\ndef get_score(point, time):\r\n score = max((3 * point) // 10, point - (point // 250) * time)\r\n return score\r\n\r\n\r\npoint_misha, point_vasya, time_misha, time_vasya = map(int, input().split())\r\nscore_misha = get_score(point_misha, time_misha)\r\nscore_vasya = get_score(point_vasya, time_vasya)\r\n\r\nif score_misha > score_vasya:\r\n print('Misha')\r\nelif score_vasya > score_misha:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "a = [int(i) for i in input().strip().split()]\r\nMisha = max(3*a[0]/10, a[0]-a[0]*a[2]/250)\r\nVasya = max(3*a[1]/10, a[1]-a[1]*a[3]/250)\r\nif Misha > Vasya:\r\n print(\"Misha\")\r\nelif Vasya > Misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "x,y,t1,t2=map(int,input().strip().split())\r\np1=max(((3*x)/10),(x-((x/250)*t1)))\r\np2=max(((3*y)/10),(y-((y/250)*t2)))\r\nif(p1>p2):\r\n print(\"Misha\")\r\nelif(p1<p2):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\na, b, c, d = map(int,input().split())\r\nm = max((3 * a) / 10, a - (a / 250) * c)\r\nv = max((3 * b) / 10, b - (b / 250) * d)\r\nif m > v:\r\n print(\"Misha\")\r\nelif m < v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "(a, b, c, d) = map(int, input().split(' '))\n\nmisha = max(3 / 10 * a, a - (a / 250 * c))\nvasya = max(3 / 10 * b, b - (b / 250 * d))\n\nif misha > vasya:\n print('Misha')\nelif misha == vasya:\n print('Tie')\nelse:\n print('Vasya')", "import sys\r\n\r\ninput = sys.stdin.readlines()\r\ninput1 = input[0]\r\ninput1 = input1.split(\" \")\r\n\r\nmisha_p = int(input1[0])\r\nwasia_p = int(input1[1])\r\nmisha_t = int(input1[2])\r\nwasia_t = int(input1[3])\r\n\r\ndef pattern(points, time):\r\n result = max(3 * (points / 10), points - ((points / 250)*time))\r\n return result\r\n\r\nmisha_result = pattern(misha_p, misha_t)\r\nwasia_result = pattern(wasia_p, wasia_t)\r\n\r\nif misha_result == wasia_result:\r\n print(\"Tie\")\r\nelif misha_result < wasia_result:\r\n print(\"Vasya\")\r\nelif misha_result > wasia_result:\r\n print(\"Misha\")\r\n\r\n\r\n", "def calculate_points(problem_cost, submission_time):\r\n return max(3 * problem_cost / 10, problem_cost - problem_cost / 250 * submission_time)\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\nmisha_points = calculate_points(a, c)\r\nvasya_points = calculate_points(b, d)\r\n\r\nif misha_points > vasya_points:\r\n print(\"Misha\")\r\nelif vasya_points > misha_points:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d = input().split()\r\na,b,c,d = int(a),int(b),int(c),int(d)\r\ndef score(p,t):\r\n sco = 0\r\n sco1 = 3*p/10\r\n sco2 = p - (p*t/250)\r\n if sco1 > sco2:\r\n sco = sco1\r\n return sco\r\n else:\r\n sco = sco2\r\n return sco\r\nsco_misha = score(a,c)\r\nsco_vasya = score(b,d)\r\nif sco_misha > sco_vasya:\r\n print(\"Misha\")\r\nelif sco_misha<sco_vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "from sys import stdin, stdout\r\n\r\na,b,c,d=map(int,stdin.readline().split())\r\nmisha=max(3*a/10,a-(a*c/250))\r\nvasya=max(3*b/10,b-(b*d/250))\r\nif(misha>vasya):\r\n stdout.write(\"Misha\")\r\nelif(misha<vasya):\r\n stdout.write(\"Vasya\")\r\nelse:\r\n stdout.write(\"Tie\")", "\r\nimport sys\r\ndef get_single_int ():\r\n return int (sys.stdin.readline ().strip ())\r\ndef get_string ():\r\n return sys.stdin.readline ().strip ()\r\ndef get_ints ():\r\n return map (int, sys.stdin.readline ().strip ().split ())\r\ndef get_list ():\r\n return list (map (int, sys.stdin.readline ().strip ().split ()))\r\n\r\n#code starts here\r\na, b, c, d = get_ints ()\r\ndef points (p, t):\r\n return max ((3*p/10), p - ((p/250)*t))\r\nmisha= points (a, c)\r\nvasya= points (b, d)\r\nif misha == vasya:\r\n print (\"Tie\")\r\nelif misha > vasya:\r\n print (\"Misha\")\r\nelse:\r\n print (\"Vasya\")\r\n", "a,b,c,d=map(int,input().split())\r\nif a==b and c==d:\r\n print(\"Tie\")\r\nelse:\r\n mis=max(3*a/10,a-(a/250)*c)\r\n vas=max(3*b/10,b-(b/250)*d)\r\n if vas>mis:\r\n print(\"Vasya\")\r\n elif mis>vas:\r\n print(\"Misha\")\r\n else:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\naa=max(((3*a)/10),(a-(a/250)*c))\r\nbb=max(((3*b)/10),(b-(b/250)*d))\r\nif aa>bb:\r\n print(\"Misha\")\r\nelif bb>aa:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(int,input().split())\r\nx=max((3*a)/10,a-(a*c/250))\r\ny=max((3*b)/10,b-(b*d/250))\r\nif x>y:\r\n print(\"Misha\")\r\nelif x<y:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(int,input().split())\r\nx=max(int(3*a/10),a-int(c*a/250))\r\ny=max(int(3*b/10),b-int(d*b/250))\r\nif(x>y):\r\n print(\"Misha\")\r\nelif(y>x):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nmisha=max((3*a)/10,a-((a/250)*c))\r\nvasya=max((3*b)/10,b-((b/250)*d))\r\nif misha==vasya:\r\n print(\"Tie\")\r\nelif misha>vasya:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "import math\r\nqueries = [int(i) for i in input().split()]\r\nmisha = queries[0]\r\nvasya = queries[1]\r\nmtime = queries[2]\r\nvtime = queries[3]\r\n\r\nmaans = max(3 * misha / 10, misha - misha * mtime / 250)\r\nvaans = max(3 * vasya / 10, vasya - vasya * vtime / 250)\r\nif(maans > vaans): \r\n print(\"Misha\")\r\nelif(maans == vaans): \r\n print(\"Tie\")\r\nelif(maans < vaans): \r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\nr1=max((3*a)/10,(a-(a/250)*c))\r\nr2=max((3*b)/10,(b-(b/250)*d))\r\nif(r1>r2):\r\n print(\"Misha\")\r\nelif(r1<r2):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "import math\ndef solve(a,b,c,d):\n m = max(3*a//10,a-((a//250)*c))\n v = max(3*b//10,b-((b//250)*d))\n if m > v:\n return 'Misha'\n if v > m :\n return 'Vasya'\n return 'Tie'\n \n \n\ndef main() :\n # n = int(input())\n arr = list(map(int, input().split(' ')))\n print(solve(*arr))\nmain()\n", "def f(p, t):\n return max(p * 0.3, p - p * t / 250)\n\n\na, b, c, d = map(int, input().split())\nm = f(a, c)\nv = f(b, d)\nprint(\"Vasya\" if v > m else \"Misha\" if m > v else \"Tie\")\n", "a,b,c,d=map(int,input().split())\r\nv=max(3*a/10, a-a/250*c)\r\nm=max(3*b/10,b-b/250*d)\r\nif v<m:\r\n print(\"Vasya\")\r\nelif m<v:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nm=max(3*a//10,a-a//250*c)\r\nv=max(3*b//10,b-b//250*d)\r\nif m>v:\r\n print('Misha')\r\nelif m<v:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=list(map(int,input().split()))\r\nt=max((3*a)//10,a-(a//250)*c)\r\np=max((3*b)//10,b-(b//250)*d)\r\nif t>p:\r\n print(\"Misha\")\r\nelif t==p:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")\r\n", "st=[int(i) for i in input().split(\" \")]\r\na=st[0]\r\nb=st[1]\r\nc=st[2]\r\nd=st[3]\r\nn1=max(3*a/10,a-((a/250)*c))\r\nn2=max(3*b/10,b-((b/250)*d))\r\nif n1>n2:\r\n print(\"Misha\")\r\nelif n1<n2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "n,m,k,x=map(int,input().split())\r\nif max((3*n/10),(n-n/250*k))>max((3*m/10),(m-(m/250*x))):\r\n\tprint(\"Misha\")\r\nelif max((3*n/10),(n-(n/250*k)))<max((3*m/10),(m-(m/250*x))):\r\n\tprint(\"Vasya\")\t\r\nelse:\r\n\tprint(\"Tie\")", "user=input().split()\na=int(user[0])\nb=int(user[1])\nc=int(user[2])\nd=int(user[3])\n\nx=max((3*a)/10,a-(a/250)*c)\ny=max((3*b/10),b-(b/250)*d)\n\nif x>y:\n print('Misha')\nelif x==y:\n print('Tie')\nelse:\n print('Vasya')\n\t\t \t \t\t \t\t \t \t \t \t", "a,b,c,d=map(int,input().split(' ',3))\r\n\r\ndef pt(x,y):\r\n pointsmin=((3*x)/10)\r\n pointsmax=(x-((x/250)*y))\r\n return max(pointsmin,pointsmax)\r\n\r\nMisha=pt(a,c)\r\nVasya=pt(b,d)\r\n\r\nif Misha>Vasya:\r\n print(\"Misha\")\r\nelif Misha<Vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a=[int(x) for x in input().split()]\r\nb=max(a[0]*3/10,a[0]-(a[0]/250)*a[2])\r\nc=max(a[1]*3/10,a[1]-(a[1]/250)*a[3])\r\nif(b>c):\r\n print(\"Misha\")\r\nelif(b<c):\r\n print(\"Vasya\")\r\nelif(b==c):\r\n print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\nmaxA = max(((3 * a) / 10), (a - ((a / 250) * c)))\r\nmaxB = max(((3 * b) / 10), (b - ((b / 250) * d)))\r\nif maxA > maxB:\r\n print('Misha')\r\nelif maxA < maxB:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "n = input().split(\" \")\na = int(n[0])\nb = int(n[1])\nc = int(n[2])\nd = int(n[3])\n\n\nmisha = max((3*a)/10, a- ((a/250) *c) )\nvasya = max((3*b)/10, b- ((b/250) *d) )\n\nif (misha > vasya):\n print(\"Misha\")\nelif (vasya > misha):\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n \t\t\t \t \t \t \t\t \t\t\t \t \t \t \t\t", "wej = (input())\r\nwejc=(wej.split())\r\npkta = int(wejc[0])\r\npktb = int(wejc[1])\r\ntimea = int(wejc[2])\r\ntimeb = int(wejc[3])\r\na = max(3 * pkta / 10, pkta - ((pkta / 250) * timea))\r\nb = max(3 * pktb / 10, pktb - ((pktb / 250) * timeb))\r\nif a > b:\r\n print(\"Misha\")\r\nelif b > a:\r\n print(\"Vasya\")\r\nelif b == a:\r\n print(\"Tie\")\r\n\r\n", "#বিসমিল্লাহির রাহমানির রাহিম\r\n#بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ\r\n#Bismillahir Rahmanir Rahim\r\n#PROBLEM :A. Contest\r\n#Soluation:\r\na,b,c,d=map(int,input().split())\r\nmisha=max(3*a//10,a-a//250*c)\r\nvasya=max(3*b//10,b-b//250*d)\r\nif misha>vasya:\r\n print(\"Misha\")\r\nelif misha<vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\na = 250 * a\r\nb = 250 * b\r\na = max(3*a/10, a - a*c/250)\r\nb = max(3*b/10, b - b*d/250)\r\nif a == b:\r\n print('Tie')\r\nelif a > b:\r\n print('Misha')\r\nelse:\r\n print('Vasya')", "a,b,c,d=map(int,input().split())\r\n\r\n\r\ndef pts(p,t):\r\n return max(3*p/10,p-(p/250)*t)\r\nA=pts(a,c)\r\nB=pts(b,d)\r\nif A>B:\r\n print('Misha')\r\nelif A<B:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d = map(int,input().split())\r\nmisha = max((3*a)//10, a - (a//250)*c)\r\nvasya = max((3*b)//10, b - (b//250)*d)\r\nprint(\"Tie\" if vasya == misha else \"Vasya\" if vasya > misha else \"Misha\")", "#import sys\r\n#import itertools\r\n#import math\r\n\r\n#t = int(input())\r\nt = 1\r\n\r\nwhile t > 0:\r\n #print(t)\r\n\r\n a,b,c,d = [int(x) for x in input().split()]\r\n m = max(3*a/10, a-a/250*c)\r\n v = max(3*b/10, b-b/250*d)\r\n if m>v:\r\n print(\"Misha\")\r\n elif v>m: print(\"Vasya\")\r\n else: print(\"Tie\")\r\n\r\n t -= 1\r\n\r\n'''def strictly_increasing(L):\r\n return all(x<y for x, y in zip(L, L[1:]))\r\n\r\ndef strictly_decreasing(L):\r\n return all(x>y for x, y in zip(L, L[1:]))\r\n\r\ndef non_increasing(L):\r\n return all(x>=y for x, y in zip(L, L[1:]))\r\n\r\ndef non_decreasing(L):\r\n return all(x<=y for x, y in zip(L, L[1:]))\r\n\r\ndef monotonic(L):\r\n return non_increasing(L) or non_decreasing(L)\r\n'''\r\n#indices = [i for i, x in enumerate(my_list) if x == \"whatever\"]\r\n#itertools.permutations(iterable) \r\n#itertools.combinations(iterable, r) ", "a,b,c,d=map(int,input().split())\r\nx=max((3*a)/10,a-(a/250)*c)\r\ny=max((3*b)/10,b-(b/250)*d)\r\nif(x>y):\r\n print(\"Misha\")\r\nelif(y>x):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n\r\n", "allargs = input()\r\na,b,c,d = [int(i) for i in allargs.split()] \r\n\r\ndef firstp(p):\r\n return 3*p/10\r\n\r\ndef secondp(p,t):\r\n return p-(p/250*t)\r\n\r\npm = max(firstp(a),secondp(a,c))\r\npv = max(firstp(b),secondp(b,d))\r\n\r\nif pm > pv:\r\n print('Misha')\r\nelif pm < pv:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d = map(int,input().split())\r\nvasya = max((b*3)//10,b-b//250*d)\r\nmisha = max((a*3)//10,a-a//250*c)\r\nif vasya >misha:\r\n print(\"Vasya\")\r\nelif misha > vasya:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = map(int,input().split(' '))\r\nres1 = max(3*a//10, a-(a//250*c))\r\nres2 = max(3*b//10, b-(b//250*d))\r\nprint('Vasya' if(res1 < res2) else 'Misha' if(res1 > res2) else 'Tie')\r\n", "\r\ndef calculatePoints(point,time):\r\n return max(3*point/10, point - time*point/250)\r\n\r\na,b,c,d = [int(i) for i in input().split()]\r\n\r\np_misha = calculatePoints(a,c)\r\np_vasya = calculatePoints(b,d)\r\n\r\nif p_misha > p_vasya:\r\n print(\"Misha\")\r\nelif p_misha == p_vasya:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "if __name__==\"__main__\":\n a,b,c,d=input().split()\n a = (int)(a)\n b = (int)(b)\n c = (int)(c)\n d = (int)(d)\n m1 = (3*a)/10\n n1 = a - ((a*c)/250)\n m2 = (3*b)/10\n n2 = b - ((b*d)/250)\n v = max(m1,n1)\n m = max(m2,n2)\n if v<m:\n print('Vasya')\n elif v>m:\n print('Misha')\n else:\n print('Tie')", "a,b,c,d = map(int,input().split())\r\nmp = max(3*a/10,a-(a/250)*c)\r\nvp = max(3*b/10,b-(b/250)*d)\r\nif mp>vp:\r\n print(\"Misha\")\r\nelif mp<vp:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = list(map(int,input().split()))\r\nmisha = max((3*a)/10 , a-((a/250)*c))\r\nvasya = max((3*b)/10 , b-((b/250)*d))\r\nif misha>vasya:\r\n print(\"Misha\")\r\nif vasya> misha:\r\n print(\"Vasya\")\r\nif misha == vasya:\r\n print(\"Tie\")", "a,b,c,d=map(int, input().split())\r\ny1=max(3*a//10,a-a//250*c)\r\ny2=max(3*b//10,b-b//250*d)\r\nif y1>y2:\r\n print('Misha')\r\nelif y1<y2:\r\n print('Vasya')\r\nelif y1==y2:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\ndef codeforces(p,t):\r\n return max(3*p*25,p*250-p*t)\r\nx = codeforces(a,c)\r\ny = codeforces(b,d)\r\nif x > y:\r\n print(\"Misha\")\r\nelif x == y:\r\n print(\"Tie\")\r\nelse :\r\n print(\"Vasya\")", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\n\n\ndef main():\n a,b,c,d = LI()\n t = max(a*3/10, a-a/250*c)\n u = max(b*3/10, b-b/250*d)\n\n if t == u:\n return 'Tie'\n if t > u:\n return 'Misha'\n\n return 'Vasya'\n\n\nprint(main())\n\n\n", "a,b,c,d=map(int,input().split())\r\na1=max(3*a/10,a-a*c//250)\r\na2=max(3*b/10,b-b*d//250)\r\nif a1==a2:\r\n print(\"Tie\")\r\nelif a1<a2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Misha\")", "import sys,math\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\na,b,c,d = get_ints()\r\nmisha = max(3*a/10,a-(a*c)/250)\r\nvasya = max(3*b/10,b-(b*d)/250)\r\nif misha>vasya:\r\n print(\"Misha\")\r\nelif vasya>misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "def points(p, t):\r\n\treturn max(3 * p / 10, p - ((p / 250) * t))\r\n\r\nif __name__ == '__main__':\r\n\ta, b, c, d = [int(i) for i in input().split()]\r\n\tprint('Misha' if points(a, c) > points(b, d) else 'Tie' if points(a, c) == points(b, d) else 'Vasya')", "#Misha - a pts\r\n#Vasya - b pts\r\n#Misha - c mins\r\n#Vasya - d mins\r\n\r\na,b,c,d = map(int,input().split())\r\nMisha = max(3*a/10,(a - (a/250)*c))\r\nVasya = max(3*b/10,(b - (b/250)*d))\r\nif(Misha > Vasya):\r\n print(\"Misha\")\r\nelif(Misha<Vasya):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n \r\n", "x, a, y, c = [int(i) for i in input().split()]\r\nz = max(x*0.3, x-x/250*y)\r\nb = max(a*0.3, a-a/250*c)\r\nif z > b:\r\n print('Misha')\r\nelif b > z:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(int,input().split())\nmisha=max(3*a//10,a-a//250*c)\nvasy=max(3*b//10,b-b//250*d)\nif misha>vasy:\n print('Misha')\n\nelif vasy>misha:\n print('Vasya')\n\nelse:\n print('Tie')", "a,b,c,d = map(int,input().split())\r\np = max(3*a/10,a-a/250*c)\r\nq = max(3*b/10,b-b/250*d)\r\nif p>q:\r\n print(\"Misha\")\r\nelif p<q:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "user=input()\nuser=user.split()\nfor i in range(len(user)):\n user[i]=int(user[i])\n \nm=max((3*user[0])/10, user[0]-(user[0]/250)*user[2])\nv=max((3*user[1])/10, user[1]-(user[1]/250)*user[3])\nif m>v:\n print('Misha')\nelif m<v:\n print('Vasya')\nelse:\n print('Tie')\n \t \t\t \t \t\t \t\t \t\t \t\t\t \t", "a, b, c, d = [int(x) for x in input().split(' ')]\n\nmisha = max([3 * a/10, a - a/250 * c])\nvasya = max([3 * b/10, b - b/250 * d])\n\nif misha == vasya:\n\tprint('Tie')\nelse:\n\tprint(\"Misha\") if misha > vasya else print(\"Vasya\")", "a, b, c, d = map(int, input().split())\r\np_m = max(3 / 10 * a, a - (a / 250) * c)\r\np_v = max(3 / 10 * b, b - (b / 250) * d)\r\n\r\nif p_m > p_v:\r\n print(\"Misha\")\r\nelif p_m < p_v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "# DO NOT EDIT THIS\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque, defaultdict\r\nimport heapq\r\ndef counter(a):\r\n c = defaultdict(lambda : 0) # way faster than Counter\r\n for el in a:\r\n c[el] += 1\r\n return c\r\n\r\ndef inp(): return [int(k) for k in input().split()]\r\ndef si(): return int(input())\r\ndef st(): return input()\r\n\r\n# DO NOT EDIT ABOVE THIS\r\n\r\na, b, c, d = inp()\r\nmis = max(3 * a / 10, a - a / 250 * c)\r\nvas = max(3 * b / 10, b - b / 250 * d)\r\nif mis == vas:\r\n print('Tie')\r\nelse:\r\n print('Vasya' if vas > mis else 'Misha')\r\n", "a, b, c, d = map(int, input().split(' '))\r\ndef comp(p, t):\r\n return max(3 * p / 10, p - p / 250 * t)\r\n\r\nm = comp(a, c)\r\nv = comp(b, d)\r\n\r\nif m > v:\r\n print('Misha')\r\nelif v > m:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\nm=max((3*a)//10,a-((a//250)*c))\r\nn=max((3*b)//10,b-((b//250)*d))\r\nif(m>n):\r\n print(\"Misha\")\r\nelif(m<n):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "p1,p2,t1,t2=map(int,input().split())\r\nsc1=max(0.3*p1,p1-(0.004*p1*t1))\r\nsc2=max(0.3*p2,p2-(0.004*p2*t2))\r\nif sc1>sc2:\r\n print(\"Misha\")\r\nelif sc2>sc1:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\n \r\nm=max(3*a/10,a-a/250*c)\r\nv=max(3*b/10,b-b/250*d)\r\n \r\nif m>v:\r\n print('Misha')\r\nelif v>m:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int, input().split())\r\nif max((3*a)/10,(a-(a*c)/250))>max((3*b)/10,(b-(b*d)/250)):\r\n print(\"Misha\")\r\nelif max((3*a)/10,(a-(a*c)/250))<max((3*b)/10,(b-(b*d)/250)):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "scores = list(map(int, input().split(' ')))\n\nm_point = scores[0]\nm_time = scores[2]\nv_point = scores[1]\nv_time = scores[-1]\n\nm_p = (3*m_point)/10\nm_t = m_point - ((m_point/250)*m_time)\n\nv_p = (3*v_point)/10\nv_t = v_point - ((v_point/250)*v_time)\n\nm_max = max([m_p, m_t])\nv_max = max([v_p, v_t])\n\nif v_max > m_max:\n print(\"Vasya\")\nelif m_max > v_max:\n print(\"Misha\")\nelse:\n print('Tie')\n", "import math\r\ndef solve():\r\n a,b,c,d = map(int,input().split())\r\n\r\n m = max((3 * a)/10 ,a - a/250*c)\r\n v = max((3 * b)/10 ,b - b/250*d)\r\n if m == v:\r\n print(\"Tie\")\r\n return\r\n elif m>v:\r\n print('Misha')\r\n return\r\n else:\r\n print('Vasya')\r\n return\r\n# t = int(input())\r\n# for _ in range(t):\r\nsolve()\r\n", "from sys import stdin, stdout\r\na, b, c, d=[int(x) for x in stdin.readline().rstrip().split()]\r\n\r\n\r\nmisha=max(3*a/10,(a-a/250*c))\r\nvasya=max(3*b/10,(b-b/250*d))\r\nif misha>vasya:\r\n stdout.write(\"Misha\"+\"\\n\")\r\nelif misha==vasya:\r\n stdout.write(\"Tie\"+\"\\n\")\r\nelse:\r\n stdout.write(\"Vasya\"+\"\\n\")", "a,b,c,d=map(int,input().split())\r\nm=int(max((3*a)/10,a-(a*c)/250))\r\nv=int(max((3*b)/10,b-(b*d)/250))\r\nprint('Vasya' if v>m else 'Misha' if m>v else 'Tie')", "a, b, c, d = map(int, input().split())\r\nm = max((3 * a) / 10, a - a / 250 * c)\r\nv = max((3 * b) / 10, b - b / 250 * d)\r\nif m > v:\r\n print(\"Misha\")\r\nelif v > m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(int,input().split())\r\nl=lambda x,y:max(3*x//10,x-x//250*y)\r\nk=l(a,c)\r\nz=l(b,d)\r\nprint([['Tie','Misha'][k>z],'Vasya'][k<z])", "a,b,c,d = map(int,input().split())\r\np1 = max(3*a/10,a - (a/250)*c)\r\np2 = max(3*b/10,b - (b/250)*d)\r\nif p1>p2:\r\n print('Misha')\r\nelif p2>p1:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "R = lambda: map(int, input().split())\r\na,b,c,d = R()\r\nm = max((3*a)//10,a-((a//250)*c))\r\nv = max((3*b)//10,b-((b//250)*d))\r\nif m == v:\r\n print(\"Tie\")\r\nelse:\r\n print([\"Misha\",\"Vasya\"][m < v])", "a, b, c, d = map(int, input().split())\r\nmi = max((3*a)/10, a-(a/250)*c)\r\nva = max((3*b)/10, b-(b/250)*d)\r\nif mi!=va:\r\n if max(mi, va)==mi:\r\n print(\"Misha\")\r\n elif max(mi, va)==va:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\nma = max((3*a)//10, a-(a*c)//250)\r\nmb = max((3*b)//10, b-(b*d)//250)\r\nif ma == mb:\r\n print(\"Tie\")\r\nelif ma > mb:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "\n[a, b, c, d] = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\nres1 = max(3*a//10, a-a//250*c)\r\nres2 = max(3*b//10, b-b//250*d)\r\nif res1 == res2:\r\n print(\"Tie\")\r\nelif res1 > res2:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "lis = list(map(int,input().split()))\r\n\r\na = lis[0]\r\nb = lis[1]\r\nc = lis[2]\r\nd = lis[3]\r\n\r\nnum1 = (3*a)//10\r\nnum2 = a - ((a*c)//250)\r\n\r\nmPts = max(num1,num2)\r\n\r\nnum3 = (3*b)//10\r\nnum4 = b - ((b*d)//250)\r\n\r\nvPts = max(num3,num4)\r\n\r\nif mPts>vPts:\r\n print(\"Misha\")\r\nelif vPts>mPts:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "import collections\nimport math\nfrom sys import stdin\n\n\ndef get(t=int):\n lis = stdin.readline().strip().split()\n return list(map(t, lis))\n\n\ndef single_str():\n return get(str)[0]\n\n\na, b, c, d = get()\n\n\ndef p(p, t):\n return max(3 * p / 10, p - p / 250 * t)\n\n\nm = p(a, c)\nv = p(b, d)\nif abs(m-v)<1e-9:\n print('Tie')\nelif m>v:\n print('Misha')\nelse:\n print('Vasya')\n", "# A. Contest\r\nmp, vp, mc, vc = [int (x) for x in input().split()]\r\n\r\ndef Points(p,t):\r\n MinPt = 3 * p // 10\r\n MaxPt = p - p // 250 * t\r\n return max(MinPt, MaxPt)\r\n\r\nM = Points(mp, mc)\r\nV = Points(vp, vc)\r\n\r\nif M > V:\r\n print(\"Misha\")\r\nelif M < V:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\ne=(3*a)/10\r\nf=(3*b)/10\r\ng=(a-(a/250)*c)\r\nh=(b-(b/250)*d)\r\n\r\ns1=max((3*a)/10,a-((a*c)/250))\r\ns2=max((3*b)/10,b-((b*d)/250))\r\n\r\nif(s1>s2):\r\n print(\"Misha\")\r\nelif(s1==s2):\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "##f1=open('input.txt','r')\r\n##f2=open('output.txt','w')\r\n##n=f1.readline()\r\n##n=int(n)\r\n##l=[]\r\n##for i in range(n):\r\n## s=f1.readline()\r\n## l.append(s)\r\n##k1=l.count('1')\r\n##k0=l.count('0')\r\n##print(l,k1,k0)\r\n##f1.close()\r\n##f2.close()\r\n\r\n\r\na,b,c,d=map(int,input().split())\r\ns1=max(3*a//10,a-(a//250)*c)\r\ns2=max(3*b//10,b-(b//250)*d)\r\nif s1>s2:\r\n print('Misha')\r\nelif s2>s1:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "a,b,c,d=map(int,input().split())\r\ne=max((3*a)/10,a-(a/250)*c)\r\nf=max((3*b)/10,b-(b/250)*d)\r\nif e>f:\r\n print('Misha')\r\nelif f>e:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\nf=lambda p,t:max(3*p/10,p-p/250*t)\r\ndf=f(a,c)-f(b,d)\r\nprint('Vasya' if df<0 else ['Tie', 'Misha'][df>0])", "a,b,c,d=map(int,input().split())\r\nm1=max(((3*a)/10),a-(a/250)*c)\r\nm2=max(((3*b)/10),b-(b/250)*d)\r\nM=max(m1,m2)\r\nif m1==m2:\r\n print('Tie')\r\nelif M==m1:\r\n print('Misha')\r\nelse:\r\n print('Vasya')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon May 31 21:48:38 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\na, b, c, d = map(int, input().split())\r\nm = max((3*a)/10, a - ((a/250)*c))\r\nv = max((3*b)/10, b - ((b/250)*d))\r\nif m == v:\r\n print(\"Tie\")\r\nelif m > v:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "s=input('')\r\nl=s.split(' ')\r\nl=list(map(int,l))\r\nm1=max((3*l[0])/10,(l[0]-((l[0])/250)*l[2]))\r\nm2=max((3*l[1])/10,(l[1]-((l[1])/250)*l[3]))\r\n#print(m1,m2)\r\nif(m1>m2):\r\n print(\"Misha\")\r\nelif(m1<m2):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "p1, p2, t1, t2 = map(int, input().split())\r\n\r\na = max((3*p1)/10, p1-(p1/250)*t1)\r\n\r\nb = max((3*p2)/10, p2-(p2/250)*t2)\r\n\r\n\r\nif a == b:\r\n print(\"Tie\")\r\nelif a>b:\r\n print(\"Misha\")\r\nelif b>a:\r\n print(\"Vasya\")\r\n\r\n", "a, b, c, d = [int(i) for i in input().split()]\r\nk1 = max( 3*a/10,a-a*c/250 ) \r\nk2 = max( 3*b/10,b-b*d/250 ) \r\nif k1 > k2 :\r\n print(\"Misha\") ;\r\nelif k2 > k1 :\r\n print(\"Vasya\") ;\r\nelse:\r\n print(\"Tie\");", "a, b, c, d = map(int, input().split())\r\nw = 3 * a // 10\r\nv = 3 * b // 10\r\nw = a - a * c // 250 if a - a * c // 250 > w else 3 * a // 10\r\nv = b - b * d // 250 if b - b * d // 250 > v else 3 * b // 10\r\nif w != v:\r\n print(\"Vasya\") if w < v else print(\"Misha\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\np=max((3*a)//10,(a-(a//250)*c)) \r\nq=max((3*b)//10,(b-(b//250)*d)) \r\nif p<q:\r\n print('Vasya')\r\nelif p>q:\r\n print('Misha')\r\nelse:\r\n print('Tie')", "bm, bv, vm, vv = map(int, input().split(' '))\r\nobm = max(bm * 3 / 10, bm - (bm / 250 * vm))\r\nobv = max(bv * 3 / 10, bv - (bv / 250 * vv))\r\n\r\nif obm > obv:\r\n print('Misha')\r\nelif obv > obm:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "def main():\r\n [a, b, c, d] = list(map(int, input().split()))\r\n\r\n ms = max(3 * a // 10, a - (a // 250) * c)\r\n vs = max(3 * b // 10, b - (b // 250) * d)\r\n\r\n if ms == vs:\r\n print(\"Tie\")\r\n elif ms > vs:\r\n print(\"Misha\")\r\n else:\r\n print(\"Vasya\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "# Contest\ndef contest(a, b, c, d):\n m = max((3 * a) / 10, a - (a / 250) * c)\n v = max((3 * b) / 10, b - (b / 250) * d)\n if m == v:\n return 'Tie'\n if m > v:\n return \"Misha\"\n return 'Vasya'\n\na, b, c, d = list(map(int, input().rstrip().split()))\nprint(contest(a, b, c, d))", "a,b,c,d = (int(x) for x in input().split())\r\nvasiy=max(3*a/10,a-a/250*c)\r\nmisha=max(3*b/10,b-b/250*d)\r\nif vasiy<misha:\r\n print(\"Vasya\")\r\nelif vasiy>misha:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")\r\n", "#!/usr/env/python3\n\ndef formula(p,d):\n return max(3*p/10, p-p/250*d)\n\na,b,c,d = map(int, input().split(\" \"))\n\nmisha = formula(a, c)\nvasya = formula(b,d)\n\nif misha > vasya: print(\"Misha\")\nelif vasya > misha: print(\"Vasya\")\nelse: print(\"Tie\")\n\n", "a,b,c,d = map(int,input().split())\r\ntemp1 = max(3*a//10, a - (a//250)*c)\r\ntemp2 = max(3*b//10, b - (b//250)*d)\r\n\r\nif temp1>temp2:\r\n print(\"Misha\")\r\nelif temp1<temp2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "x = list(map(int, input().split()))\nmax_misha = max(3 * x[0] // 10, x[0] - x[0] * x[2] // 250)\nmax_vasya = max(3 * x[1] // 10, x[1] - x[1] * x[3] // 250 )\nif max_misha > max_vasya:\n print('Misha')\nelif max_vasya > max_misha:\n print('Vasya')\nelse:\n print('Tie')\n", "\"\"\"\r\n Name | Ruoqi Huang\r\n Contest | Codeforces Round #285 (Div. 2)\r\n Problem | Contest\r\n Time | 08/29/2022, 12:04:32\r\n URL | https://codeforces.com/contest/501/problem/A?locale=en\r\n\"\"\"\r\n\r\na,b,c,d = tuple(map(int, input().split()))\r\ndef points(p, t):\r\n return max(3*p/10, p-p/250*t)\r\n\r\nif points(a,c) > points(b,d):\r\n print(\"Misha\")\r\nelif points(a,c) < points(b,d):\r\n print(\"Vasya\") \r\nelse:\r\n print(\"Tie\")\r\n", "from sys import stdin\r\n\r\na, b, c, d = list(map(int, stdin.readline().split()))\r\n\r\nm = max((3*a)//10, a - (a*c) // 250)\r\nv = max((3*b)//10, b - (b*d) // 250)\r\nif m > v:\r\n print('Misha')\r\nelif v > m:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "def res(p, t):\r\n return max(3*p/10, p-p/250*t)\r\n\r\n\r\ns = input()\r\ns = s.split()\r\na = res(int(s[0]), int(s[2]))\r\nb = res(int(s[1]), int(s[3]))\r\nif a>b:\r\n print('Misha')\r\nelif a<b:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "y= [int(y) for y in input().split()]\r\nmp=y[0]\r\nvp=y[1]\r\nmt=y[2]\r\nvt=y[3]\r\nif (mp==vp and mt==vt):\r\n print(\"Tie\") \r\nelse:\r\n a=(3*mp)/10\r\n b=mp-((mp/250)*mt)\r\n misha=max(a,b)\r\n a=(3*vp)/10\r\n b=vp-((vp/250)*vt)\r\n vasya=max(a,b) \r\n if (vasya!=misha):\r\n if (vasya>misha):\r\n print(\"Vasya\") \r\n else:\r\n print(\"Misha\") \r\n else:\r\n print(\"Tie\") ", "a,b,c,d=map(int,input().split())\r\nm,v=max(3*a/10,a-(a/250)*c),max(3*b/10,b-(b/250)*d)\r\nif m==v: print('Tie')\r\nelse:print(['Misha','Vasya'][v>m])", "inplist = list(map(int, input().split()))\ndic = {\"Vasya\":0,\"Misha\":0}\ndic[\"Misha\"] = max(((3*inplist[0])/10),(inplist[0]-((inplist[0]/250)*inplist[2])))\ndic[\"Vasya\"] = max(((3*inplist[1])/10),(inplist[1]-((inplist[1]/250)*inplist[3])))\nif(dic[\"Misha\"]==dic['Vasya']):\n print(\"Tie\")\nelif(dic['Misha']>dic[\"Vasya\"]):\n print(\"Misha\")\nelse:\n print(\"Vasya\")\n\t \t \t\t\t\t\t \t\t\t\t \t \t\t\t \t\t", "from sys import stdin ,stdout\r\ninput=stdin.readline\r\ninp=lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\na,b,c,d=inp()\r\nm,v=max(3*a/10,a-(a/250)*c),max(3*b/10,b-(b/250)*d)\r\nif m==v: print('Tie')\r\nelse:print(['Misha','Vasya'][v>m])", "a,b,c,d=map(int,input().split())\r\nmisha=max(3*a/10,a-(a/250)*c)\r\nvasya=max(3*b/10,b-(b/250)*d)\r\n\r\nif vasya>misha:\r\n\tprint(\"Vasya\")\r\nif misha>vasya:\r\n\tprint(\"Misha\")\r\nif misha==vasya:\r\n\tprint(\"Tie\")", "a,b,c,d = map(int,input().split())\r\n\r\nac = max((3*a)//10,a-(a//250)*c)\r\nbd = max((3*b)//10,b-(b//250)*d)\r\n\r\nif ac>bd:\r\n print(\"Misha\")\r\nelif ac<bd:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "user = [int(i) for i in input().split(\" \")]\n\nmisha = int(max(3 * user[0] / 10, user[0] - user[0] / 250 * user[2]))\nvasya = int(max(3 * user[1] / 10, user[1] - user[1] / 250 * user[3]))\n\nif misha > vasya :\n print(\"Misha\")\nelif vasya > misha : \n print(\"Vasya\")\nelse :\n print(\"Tie\")\n\t \t\t \t \t \t \t\t\t\t\t \t\t \t\t \t\t\t\t\t", "a,b,c,d=map(int,input().split())\r\nr1=max(3*a/10,a-(a/250*c))\r\nr2=max(3*b/10,b-(b/250*d))\r\nif(r1>r2):\r\n print('Misha')\r\nelif(r1<r2):\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "p1,p2,t1,t2 = map(int,input().split())\r\nM = max(3*p1/10, p1 - p1/250*t1)\r\nV = max(3*p2/10, p2 - p2/250*t2)\r\n\r\nif(V>M): print('Vasya')\r\nelif(V<M): print('Misha')\r\nelse: print('Tie')", "m,v,a,b=map(int,input().split())\r\nif (max(3*m/10,m-a*m/250))>(max(3*v/10,v-b*v/250)):\r\n\tprint(\"Misha\")\r\nelif (max(3*m/10,m-a*m/250))<(max(3*v/10,v-b*v/250)):\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\nscore1 = max(3 * a // 10, a - a * c // 250)\nscore2 = max(3 * b // 10, b - b * d // 250)\nif score1 > score2:\n print('Misha')\nelif score1 < score2:\n print('Vasya')\nelse:\n print('Tie')", "a,b,c,d=map(int,input().split())\r\ne=max(3*a/10,a-(a/250)*c)\r\nf=max(3*b/10,b-(b/250)*d)\r\nif e>f: print(\"Misha\")\r\nelif e==f: print(\"Tie\")\r\nelse: print(\"Vasya\")\r\n", "napis = input().split()\r\npunktyM = int(napis[0])\r\npunktyV = int(napis[1])\r\nczaM = int(napis[2])\r\nczaV = int(napis[3])\r\nmaksymalnieMishy = max(3 * punktyM / 10, punktyM - ((punktyM / 250) * czaM))\r\nmaksymalnieVishy = max(3 * punktyV / 10, punktyV - ((punktyV / 250) * czaV))\r\nif maksymalnieMishy > maksymalnieVishy:\r\n print(\"Misha\")\r\nelif maksymalnieVishy > maksymalnieMishy:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "def score(p,t):\r\n return max(int((3*p)/10),(p-(int(p/250)*t)))\r\na,b,c,d=map(int,input().split())\r\ns1=score(a,c)\r\ns2=score(b,d)\r\nif(s1==s2):\r\n print(\"Tie\")\r\nelif(s1>s2):\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")\r\n", "a,c,b,d = [int(i) for i in input().split()]\r\nif max(3*a/10,a-a/250*b)>max(3*c/10,c-c/250*d):\r\n print('Misha')\r\nelif max(3*a/10,a-a/250*b)<max(3*c/10,c-c/250*d):\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "a,b,c,d = map(int,input().split())\n\nscore1 = max((3*a)/10,a - a/250*c)\n\n\nscore2 = max((3*b)/10,b - b/250*d)\n\nif score1 > score2:\n print('Misha')\nelif score1 < score2:\n print('Vasya')\n\nelse:\n print('Tie')\n\n\n\n\n", "a, b, c, d = map(int, input().split())\n\nmisha = max(3 * a / 10.0, a - a / 250.0 * c)\nvasya = max(3 * b / 10.0, b - b / 250.0 * d)\n\nif misha > vasya:\n\tprint('Misha')\nelif vasya > misha:\n\tprint('Vasya')\nelse:\n\tprint('Tie')", "#!/usr/bin/python3\r\n\r\n\r\ndef pt(p, t):\r\n return max(3*p/10, p-p*t/250) \r\n\r\ndef main():\r\n a, b, c, d = [int(x) for x in input().split()] \r\n misha, vasya = pt(a, c), pt(b, d)\r\n\r\n if misha == vasya: print(\"Tie\")\r\n else: print(\"Misha\" if misha > vasya else \"Vasya\")\r\n\r\n\r\nif __name__ == \"__main__\": main()", "def get_res(b, t):\r\n return max(3*b / 10, b - b/250*t)\r\n\r\n\r\na, b, c, d = map(int, input().split())\r\nmisha = get_res(a, c)\r\nvasya = get_res(b, d)\r\n\r\nif vasya > misha:\r\n print(\"Vasya\")\r\nelif vasya < misha:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(float,input().split())\r\nm=max(.3*a,a-(a*c/250.0))\r\nv=max(.3*b,b-(b*d/250.0))\r\nif m>v:\r\n print(\"Misha\")\r\nelif m==v:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "# Bismillah\r\n# In the name of GOD\r\n\r\na, b, c, d = map(int, input().split())\r\nM = max(3 * a / 10, a - a / 250 * c)\r\nV = max(3 * b / 10, b - b / 250 * d)\r\nif M > V:\r\n\tprint('Misha')\r\nelif V > M:\r\n\tprint('Vasya')\r\nelse:\r\n\tprint('Tie')\r\n", "import sys, math\ninput = sys.stdin.readline\n\ndef points(p, t):\n return max((3*p) / 10, p - (p / 250) * t)\n\na, b, c, d = [int(x) for x in input().split()]\n\nans = \"Tie\"\nif points(a, c) < points(b, d):\n ans = \"Vasya\"\nelif points(a, c) > points(b, d):\n ans = \"Misha\"\nprint(ans)\n \t\t \t\t \t \t\t \t\t \t\t\t \t \t", "a,b,c,d=map(int,input().split())\r\nif(max((3*a)/10,a-((a/250)*c)))>(max((3*b)/10,b-((b/250)*d))):\r\n print(\"Misha\")\r\nelif(max((3*a)/10,a-((a/250)*c)))<(max((3*b)/10,b-((b/250)*d))):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\nm = max(a*3//10, a - a//250*c)\r\nv = max(b*3//10, b - b//250*d)\r\nif m > v:\r\n print(\"Misha\")\r\nelif m < v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n\r\n\r\n\r\n#1 4\r\n#4\r\n#5 4 3 2\r\n#2 1 3 2\r\n\r\n#3\r\n\r\n ", "a, b, c, d = list(map(int,input().split()))\ndef sc(p,t):\n return max(p*3//10, p-p*t//250)\nif sc(a,c) == sc(b,d):\n print(\"Tie\")\n exit(0)\nprint(\"Misha\" if sc(a,c)>sc(b,d) else \"Vasya\")\n", "a,b,c,d=map(int,input().split())\r\npoints=max(3*(a//10),a-(a//250)*c)-max(3*(b//10),b-(b//250)*d)\r\nif points>0:print('Misha')\r\nelif not points:print('Tie')\r\nelse:print('Vasya')", "a,b,c,d = map(int,input().split())\r\nMisha = max(3*a / 10, a - ((a / 250)*c))\r\nVasya = max(3*b / 10, b - ((b / 250)*d))\r\nif Vasya > Misha:\r\n print('Vasya')\r\nelif Vasya < Misha:\r\n print('Misha')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\nm=max(((a//10)*3),(a-(a*c)//250))\r\nv=max(((b//10)*3),(b-(b*d)//250))\r\nif m>v:\r\n\tprint('Misha')\r\nelif m<v:\r\n\tprint('Vasya')\r\nelse:\r\n\tprint('Tie')", "a,b,c,d=[int(x) for x in input().split()]\nmish= max(((3*a)/10),(a-((a/250)*c)))\nvas= max(((3*b)/10),(b-((b/250)*d)))\n\nif mish==vas:\n print(\"Tie\")\nelif mish>vas:\n print(\"Misha\")\n\nelse:\n print(\"Vasya\")\n \t\t\t \t\t\t \t\t\t \t \t\t\t\t\t\t\t \t \t", "a,b,c,d = map(int, input().split())\n\nm = max([(3*a)//10, a - (a//250)*c])\nv = max([(3*b)//10, b - (b//250)*d])\n\nif m>v:\n print(\"Misha\")\nelif v>m:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n \t\t \t \t \t \t\t \t\t\t\t\t \t\t", "a, b, c, d, = map(int, input().split())\r\n\r\nif max(3*a/ 10, a - (a/250) * c) < max(3*b/ 10, b - (b/250) * d):\r\n print(\"Vasya\")\r\nelif max(3*a/ 10, a - (a/250) * c) > max(3*b/ 10, b - (b/250) * d):\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")\r\n", "params = input().split(\" \")\r\nmisha = max((3*int(params[0]))/10, (int(params[0])-((int(params[0])/250)*int(params[2]))))\r\nvasya = max((3*int(params[1]))/10, (int(params[1])-((int(params[1])/250)*int(params[3]))))\r\nif misha==vasya:\r\n print(\"Tie\")\r\nelif misha>vasya:\r\n print(\"Misha\")\r\nelif vasya>misha:\r\n print(\"Vasya\")", "A,B,C,D = map(int,input().split())\r\n\r\nVal1 = [(3*A)//10] + [(3*B)//10]\r\nVal2 = [(A - (A//250)*C)] + [(B - (B//250)*D)]\r\n\r\nVal3 = [max(Val1[0],Val2[0])] + [max(Val1[1],Val2[1])]\r\nif Val3[0] == Val3[1]:\r\n print(\"Tie\")\r\nelif Val3[0] > Val3[1]:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\nm=3.0*a/10.0\r\nn=a-((a/250.0)*c)\r\n\r\no=3.0*b/10\r\np=b-((b/250.0)*d)\r\nsum=max(m,n)\r\ncount=max(o,p)\r\nif(sum>count):\r\n print(\"Misha\")\r\nelif(sum<count):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d = map(int, input().split())\r\nmisha = max((3 * a) / 10, a - ((a * c) / 250))\r\nvasya = max((3 * b) / 10, b - ((b * d) / 250))\r\nif misha == vasya:\r\n print(\"Tie\")\r\nelif misha > vasya:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "a, b, c, d = list(map(int, input().split()))\r\n\r\ndef score(p, t):\r\n return max(3*p/10, p-p/250*t)\r\n\r\nif score(a,c) > score(b,d):\r\n print('Misha')\r\nelif score(a,c) < score(b,d):\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d = map(int,input().split())\r\na = max(3*a/10,a-a/250*c)\r\nb = max(3*b/10,b-b/250*d)\r\nif a > b : print(\"Misha\")\r\nelif a < b : print(\"Vasya\")\r\nelse : print(\"Tie\")\r\n", "m,n,p,q= map(int, input().split())\nx= max(3*m/10,m-m/250*p)\ny= max(3*n/10,n-n/250*q)\nif x==y:\n print(\"Tie\")\nelse:\n print(\"Vasya\" if x<y else \"Misha\")\n\t \t \t\t\t\t\t\t\t \t\t \t\t\t \t\t \t\t\t", "a,b,c,d = map(int,input().split())\r\nmis = max((3*a)//10 , a-((a//250) * c))\r\nvas = max((3*b)//10 , b-((b//250) * d))\r\nif vas > mis:\r\n print('Vasya')\r\nelif mis > vas:\r\n print('Misha')\r\nelse:\r\n print('Tie')", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n x=max(0.3*a,a-((a*c)/250))\r\n \r\n y=max(0.3*b,b-((b*d)/250))\r\n if(x>y):\r\n return 'Misha'\r\n elif(y>x):\r\n return 'Vasya'\r\n else:\r\n return 'Tie'\r\na,b,c,d=map(int,input().split())\r\nprint(exe())", "z=list(map(int,input().split()))\r\nx=max((3*z[0])/10,z[0]-(z[0]/250)*z[2])\r\nc=max((3*z[1])/10,z[1]-(z[1]/250)*z[3])\r\nif c==x:\r\n print(\"Tie\")\r\nelse:\r\n print(['Vasya',\"Misha\"][x>c]) ", "# cook your dish here\r\na,b,c,d=input().split()\r\nmisha=max(3*int(a)/10,int(a)-(int(a)/250)*int(c))\r\nvasya=max(3*int(b)/10,int(b)-(int(b)/250)*int(d))\r\nif(misha>vasya):\r\n print(\"Misha\")\r\nelif(vasya>misha):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "# Fall 7, Stand 8...\r\na,b,c,d=map(int,input().split())\r\nif(max((3*a)//10,a-a//250*c)>max((3*b)//10,b-b//250*d)):\r\n print(\"Misha\")\r\nelif(max((3*a)//10,a-a//250*c)<max((3*b)//10,b-b//250*d)):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=input().split()\r\na,b,c,d=int(a),int(b),int(c),int(d)\r\nm=max((3*a)/10,a-((a*c)/250))\r\nv=max((3*b)/10,b-((b*d)/250))\r\nif m>v:print('Misha')\r\nelif m<v:print('Vasya')\r\nelse:print('Tie')\r\n", "z = []\r\nz[0:] = map(int ,input().split())\r\nx = max(3*z[0] //10 , z[0]-(z[0]//250)*z[2])\r\ny = max(3*z[1] //10 , z[1]-(z[1]//250)*z[3])\r\nif x > y:\r\n print(\"Misha\")\r\nelif y > x:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d = map(int,input().split())\r\nm = max(3*a/10,a-(a/250*c))\r\nv = max(3*b/10,b-(b/250*d))\r\nif m > v :\r\n print(\"Misha\")\r\nelif v > m :\r\n print(\"Vasya\")\r\nelse :\r\n print(\"Tie\")\r\n", "m,n,p,q= map(int, input().split())\r\nx= max(3*m/10,m-m/250*p)\r\ny= max(3*n/10,n-n/250*q)\r\nif x==y:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\" if x<y else \"Misha\")", "l1=[int(i) for i in input().split()]\r\na=l1[0] #M costs\r\nb=l1[1] #V costs\r\nc=l1[2] #c min after 0 M\r\nd=l1[3] #d min after 0 V\r\nw=3*a/10\r\nx=a-(a/250*c)\r\nMp=max(w,x)\r\n\r\ny=3*b/10\r\nz=b-(b/250*d)\r\nVp=max(y,z)\r\n\r\nif Mp>Vp:\r\n print(\"Misha\")\r\nelif Vp>Mp:\r\n print(\"Vasya\")\r\nelse :\r\n print(\"Tie\")", "a=input().split()\r\nb=int(a[0])\r\nc=int(a[1])\r\nd=int(a[2])\r\ne=int(a[3])\r\nr=(3*b)//10\r\ny=b-((b//250)*d)\r\nx=max(r,y)\r\nf=(3*c)//10\r\nq=c-((c//250)*e)\r\nz=max(f,q)\r\nif(x>z):\r\n print(\"Misha\")\r\nelif(x<z):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "def fun(n, m):\r\n a = n-(n/250)*m\r\n b = (3*n)/10\r\n return max(a,b)\r\n\r\na,b,c,d = map(int, input().split())\r\na_c = fun(a,c)\r\nb_d = fun(b,d)\r\nif a_c > b_d:\r\n print(\"Misha\")\r\nelif b_d > a_c:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = map(int, input().split())\r\nans1 = max(0.3*a, a - (a/250)*c)\r\nans2 = max(0.3*b, b - (b/250)*d)\r\nif ans1>ans2:\r\n print(\"Misha\")\r\nelif ans2>ans1:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d = map(int,input().split())\r\n\r\nif(max(3*a/10,a-(a/250)*c) == max(3*b/10,b-(b/250)*d)):\r\n print(\"Tie\")\r\n exit()\r\nif(max(3*a/10,a-(a/250)*c) > max(3*b/10,b-(b/250)*d)):\r\n print(\"Misha\")\r\n \r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=list(map(int,input().split()))\r\nm_p=max((3*a)/10,a-(a/250)*c)\r\nv_p=max((3*b)/10,b-(b/250)*d)\r\nif(a==b and c==d):\r\n print(\"Tie\")\r\nelse:\r\n if(m_p>v_p):\r\n print(\"Misha\")\r\n elif(m_p<v_p):\r\n print(\"Vasya\")\r\n else:\r\n print(\"Tie\")\r\n\r\n", "def points(p, t): return max(3*p/10, p - p/250*t)\r\n\r\n(a, b, c, d) = [int(r) for r in input().split()]\r\np1 = points(a, c)\r\np2 = points(b, d)\r\nif p1 > p2: print(\"Misha\")\r\nelif p1 < p2: print(\"Vasya\")\r\nelse: print(\"Tie\")\r\n", "a,b,c,d=map(int, input(\"\").split())\r\n\r\ndef maxpoints(x,y):\r\n return max(3*x/10, x - (x/250) * y)\r\n\r\nif maxpoints(a,c) > maxpoints(b,d):\r\n print(\"Misha\")\r\nelif maxpoints(a,c) < maxpoints(b,d):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "line=input().split()\na, b, c, d = int(line[0]), int(line[1]), int(line[2]), int(line[3])\nif a>=250 and b<=3500 and c>=0 and d<=180:\n p_a=max((3*a)/10, a-(a*c/250))\n p_b=max((3*b)/10, b-(b*d/250))\n if p_a>p_b:\n print('Misha')\n elif p_a<p_b:\n print('Vasya')\n else:\n print('Tie')\n \t\t \t\t \t\t \t\t\t\t\t \t \t\t \t", "def kontest(lst):\r\n m1 = max(3 * lst[0] / 10, lst[0] - (lst[0] / 250) * lst[2])\r\n m2 = max(3 * lst[1] / 10, lst[1] - (lst[1] / 250) * lst[3])\r\n if m1 > m2:\r\n return \"Misha\"\r\n elif m1 < m2:\r\n return \"Vasya\"\r\n else:\r\n return \"Tie\"\r\n\r\n\r\na = [int(i) for i in input().split()]\r\nprint(kontest(a))\r\n", "a,b,c,d = input().split()\r\na,b,c,d = int(a), int(b), int(c), int(d)\r\n\r\nM = max(3*(a//10) , (250-c)*(a//250))\r\nV = max(3*(b//10) , (250-d)*(b//250))\r\n\r\nif M>V:\r\n print(\"Misha\")\r\nelif M<V:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n \r\n", "a,b,c,d=[int(x) for x in input().split()]\r\nm = [(3*a)//10,a-(a//250)*c]\r\nv = [(3*b)//10,b-(b//250)*d]\r\nif max(m)>max(v):\r\n print(\"Misha\")\r\nelif max(v)>max(m):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "l1 = [int(x) for x in input().split()]\r\na,b,c,d=l1[0],l1[1],l1[2],l1[3]\r\nmScore=max(3*a/10,a-a*c/250)\r\nvScore=max(3*b/10,b-b*d/250)\r\nif mScore>vScore:\r\n print(\"Misha\")\r\nelif mScore<vScore:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\") ", "[a,b,c,d] = [int(x) for x in input().split()]\r\n\r\np1 = max((3*a)/10 , a-(a/250)*c)\r\np2 = max((3*b)/10 , b-(b/250)*d)\r\n\r\nif p1>p2:\r\n print(\"Misha\")\r\nelif p1<p2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n ", "a=[int(a) for a in input().split()]\r\nm=max((3*a[0])/10,(a[0])-((a[0]/250)*a[2]))\r\nv=max((3*a[1])/10,(a[1])-((a[1]/250)*a[3]))\r\nif v==m:\r\n print(\"Tie\")\r\nelif m>v:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "mp, vp, mt, vt =[int(x) for x in input().split()]\n\nif mp>=250 and vp<=3500 and mt>=0 and vt<=180 and mp%250==0 and vp%250==0:\n a=(3*mp)/10\n b=(3*vp)/10\n c=(mp-((mp/250)*mt))\n d=(vp-((vp/250)*vt))\n\ne=max(a,c)\nf=max(b,d)\n\nz=max(e,f)\n\nif e==f:\n print('Tie')\nelif z==e:\n print('Misha')\nelif z==f:\n print('Vasya')\n\t \t\t \t \t\t \t \t\t \t \t \t \t\t\t \t\t", "def arjun(p,t):\r\n return max(3*p/10 , p - (p * t/250))\r\np1,p2,t1,t2 = map(int,input().split())\r\nx,y = arjun(p1,t1),arjun(p2,t2)\r\nif x == y:\r\n print('Tie')\r\nelse:\r\n print(['Vasya','Misha'][x>y])\r\n", "i = input().split()\na = int(i[0])\nb = int(i[1])\nc = int(i[2])\nd = int(i[3])\n\na = points = max(((3*a)/10), a - (a/250) * c)\nb = points = max(((3*b)/10), b - (b/250) * d)\n\nif a>b:\n print('Misha')\nelif b>a:\n print('Vasya')\nelse:\n print('Tie')\n\n \t \t \t\t \t\t \t\t\t\t \t\t \t \t", "a,b,c,d=map(int,input().split())\r\n\r\nq=max((3*a)//10,a-(a//250)*c)\r\nw=max((3*b)//10,b-(b//250)*d)\r\n\r\nif(q>w):\r\n print(\"Misha\")\r\nelif(w>q):\r\n print(\"Vasya\")\r\nelif(w==q):\r\n print(\"Tie\")\r\n \r\n", "a,b,c,d = map(int,input().split())\r\nz = max(int((3*a)/10),a-(int(a/250)*c))\r\nx = max(int((3*b)/10),b-(int(b/250)*d))\r\nif z>x:print(\"Misha\")\r\nelif x>z:print(\"Vasya\")\r\nelse:print(\"Tie\")\r\n", "a, b, c, d = [int(s) for s in input().split()]\r\n\r\nM = max(3*a/10, a - a/250*c)\r\nV = max(3*b/10, b - b/250*d)\r\n\r\nif M > V:\r\n print('Misha')\r\nelif V > M:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "a,b,c,d=map(int,input().split())\r\n\r\nx1=(3*a)//10\r\ny1=(a//250)*c\r\n\r\nx2=(3*b)//10\r\ny2=(b//250)*d\r\n\r\ns=max(x1,a-y1)\r\nt=max(x2,b-y2)\r\nif s>t:\r\n print(\"Misha\")\r\nelif s<t:\r\n print(\"Vasya\")\r\nelif s==t:\r\n print(\"Tie\")\r\n\r\n\r\n\r\n\r\n", "a=input().split()\r\nfor i in range(len(a)):\r\n if 250<=int(a[0])<=3500 and 250<=int(a[1])<=3500 and 0<=int(a[2])<=180 and 0<=int(a[3])<=180:\r\n a[i]=int(a[i])\r\np=max(0.3*a[0],a[0]-(((a[0])/250)*a[2]))\r\nq=max(0.3*a[1],a[1]-(((a[1])/250)*a[3]))\r\nif p>q:\r\n print('Misha')\r\nelif p<q:\r\n print('Vasya')\r\nelse:\r\n print('Tie') ", "a,b,c,d=map(int,input().split())\r\ndef codeforces(p,t):\r\n return max(3*p*25,p*250-p*t)\r\nz = codeforces(a,c)\r\ny = codeforces(b,d)\r\nif z > y:\r\n print(\"Misha\")\r\nelif z == y:\r\n print(\"Tie\")\r\nelse :\r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split()) \r\nmisha=max((3*a//10),(a-(a//250*c)))\r\nvasya=max((3*b//10),(b-(b//250*d)))\r\nif misha>vasya:\r\n print(\"Misha\")\r\nelif vasya>misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "\n\n# 501 A Contest \n\na,b,c,d = map(int, input().split())\n\nx = {\"Misha\": max((3*a)//10 , a - (a//250)*c), \"Vasya\": max((3*b)//10 , b - (b//250)*d)}\n\n# New way to sort dictionary :x =dict(sorted(x.items())) \n# Print key of max of dictionary max(x, key=x.get)\n\nif x[\"Misha\"] > x[\"Vasya\"]:\n print(\"Misha\")\nelif x[\"Misha\"] < x[\"Vasya\"]:\n print(\"Vasya\")\nelse:\n print(\"Tie\")", "s = input().split()\r\n(a,b,c,d) = (int(i) for i in s)\r\nmisha = max(3*a/10,a-(a/250)*c)\r\nvasya = max(3*b/10,b-(b/250)*d)\r\nif(misha > vasya):\r\n\tprint('Misha')\r\nelif(vasya > misha):\r\n\tprint('Vasya')\r\nelse:\r\n\tprint('Tie')", "a, b, c, d = map(int, input().split())\r\na = max((3*a)//10,a - ((a//250)*c))\r\nb = max((3*b)//10,b - ((b//250)*d))\r\nif a == b:\r\n print(\"Tie\")\r\nelif a > b:\r\n print(\"Misha\")\r\n\r\nelse:\r\n print(\"Vasya\")", "a , b , c , d = list(map(int , input().split()))\r\nr = max(3*a // 10 , a-(a*c//250))\r\ns = max(3*b // 10 , b-(b*d//250))\r\n\r\nif r > s:\r\n print(\"Misha\")\r\nelse:\r\n if r < s:\r\n print(\"Vasya\")\r\n else:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(int, input().split())\r\nm=max(((3*a)/10), a-(a/250)*c)\r\nv=max(((3*b)/10), b-(b/250)*d)\r\nif m>v:\r\n print(\"Misha\")\r\nelif v>m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=list(map(int,input().split()))\r\np=a\r\nt=c\r\nx=max(3*p/10,p-(p*t/250))\r\np=b\r\nt=d\r\ny=max(3*p/10,p-(p*t/250))\r\nif(x>y):print(\"Misha\")\r\nelif(x==y):print(\"Tie\")\r\nelse:print(\"Vasya\")\r\n", "inputs = list(map(int, input().split(' ')))\r\nmishaPoints = inputs[0]\r\nvasyaPoints = inputs[1]\r\nmishaTime = inputs[2]\r\nvasyaTime = inputs[3]\r\nmishaScore = max((3 * mishaPoints) / 10, mishaPoints - (mishaPoints / 250) * mishaTime)\r\nvasyaScore = max((3 * vasyaPoints) / 10, vasyaPoints - (vasyaPoints / 250) * vasyaTime)\r\nif mishaScore > vasyaScore:\r\n print(\"Misha\")\r\nelif vasyaScore > mishaScore:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nmisha=max(3*a//10,a-a//250*c)\r\nvasya=max(3*b//10,b-b//250*d)\r\nif vasya==misha:\r\n\tprint(\"Tie\")\r\nelif vasya>misha:\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Misha\")\r\n", "z=lambda x,y:max((3*x)/10,x-((x/250)*y))\r\na,b,c,d=map(int,input().split());e=z(a,c);f=z(b,d);print(\"Misha\" if e>f else \"Vasya\"if e<f else \"Tie\")", "arr = a,b,c,d = [int(x) for x in input().split()]\r\n\r\nm = max((3*a)/10,a-(a/250)*c)\r\nv = max((3*b)/10,b-(b/250)*d)\r\n\r\nif m > v:\r\n print(\"Misha\")\r\nelif m < v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "p = list(map(int,input().split()))\r\n\r\nmPoints = max((3*p[0]/10), (p[0] - p[0]/250*p[2]))\r\nvPoints = max((3*p[1]/10), (p[1] - p[1]/250*p[3]))\r\n\r\nif mPoints > vPoints:\r\n print(\"Misha\")\r\nelif mPoints < vPoints:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "#n = int(input()) \nn, m, k, l = map(int, input().split()) \n#s = input()\n#c = list(map(int, input().split()))\na = max(n * 3 / 10, n - n / 250 * k)\nb = max(m * 3 / 10, m - m / 250 * l)\nif a > b:\n print('Misha')\nelif a < b:\n print('Vasya')\nelse:\n print('Tie')", "a, b, c, d = map(int,input().split())\r\nmisha = max(3*a//10,a- a//250*c)\r\nvasya = max(3*b//10, b-b//250*d)\r\nif(misha>vasya):\r\n print('Misha')\r\nelif(vasya>misha):\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n#print(vasya, misha)", "a,b,c,d=map(int,input().split())\r\nif max(0.3*a,a-0.004*a*c)>max(0.3*b,b-0.004*b*d):\r\n print(\"Misha\")\r\nelif max(0.3*a,a-0.004*a*c)==max(0.3*b,b-0.004*b*d):\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\nm = int(max((3*a)//10,a-(a*c)//250))\r\nv = int(max((3*b)//10,b-(b*d)//250))\r\nif m > v:\r\n print(\"Misha\")\r\nelif v > m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d=[int(i) for i in input().split()]\r\ne=(3*a)//10\r\nf=(a)-((a//250)*c)\r\ng=(3*b)//10\r\nh=(b)-((b//250)*d)\r\ni=max(f,e)\r\nj=max(g,h)\r\nif(i>j):\r\n print('Misha')\r\nelif(i==j):\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")\r\n", "a,b,c,d= input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\n\r\nm= max( (a/10)*3 , a- ((a/250)*c ))\r\n\r\nv= max( (b/10)*3 , b- ((b/250)*d ))\r\n\r\nif m>v:\r\n print(\"Misha\")\r\nelif v>m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nl=lambda x,y:max(3*x//10,x-x//250*y)\r\nprint('Tie' if l(a,c)==l(b,d) else 'Misha' if l(a,c)>l(b,d) else 'Vasya')\r\n", "n=list(map(int,input().split()))\r\nm=max(3*n[0]/10,n[0]-n[2]*n[0]/250)\r\nv=max(3*n[1]/10,n[1]-n[3]*n[1]/250)\r\nif(m>v):\r\n print('Misha')\r\nelif(v>m):\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "[a,b,c,d]=[int(x) for x in input().split()]\r\nm = max(3*a/10, a-a*c/250)\r\nv = max(3*b/10, b-b*d/250)\r\nif m>v:\r\n print(\"Misha\")\r\nelif m==v:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\nm1=max(3*a//10,a - a*c//250)\r\nm2=max(3*b//10,b - b*d//250)\r\nif(m1>m2):\r\n print(\"Misha\")\r\nelif(m1<m2):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "vvod=input()\r\nvvod_list=vvod.split(\" \")\r\na=vvod_list[0]\r\nb=vvod_list[1]\r\nc=vvod_list[2]\r\nd=vvod_list[3]\r\ni=max(3*float(a)//10, float(a)-float(a)//250*float(c))\r\nj=max(3*float(b)//10, float(b)-float(b)//250*float(d))\r\nif i>j:\r\n print(\"Misha\")\r\nelif i==j:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "list1=input().split(' ')\nfor i in range(len(list1)):\n list1[i]=int(list1[i])\na,b,c,d=list1\nmisha = a-((a/250)*c)\nmisha_30= (3*a)/10\nif misha<=misha_30:\n misha = misha_30\nvasya= b-((b/250)*d)\nvasya_30 = (3*b)/10\nif vasya <= vasya_30:\n vasya = vasya_30\nif misha > vasya:\n print('Misha')\nelif vasya > misha:\n print('Vasya')\nelse:\n print('Tie')\n\t \t \t\t \t \t\t\t\t\t \t\t \t\t\t\t", "a,b,c,d =map(int, input().split())\r\nt=max((3*a/10), a-(a/250)*c)\r\nt1=max((3*b/10), b-(b/250)*d)\r\nif t>t1:\r\n print('Misha')\r\nif t<t1:\r\n print(\"Vasya\")\r\nelif t==t1:\r\n print(\"Tie\")", "def formula(p,t):\r\n return max(((3*p)/10), (p - (p*t)/250))\r\n\r\na, b, c, d=map(int, input().rstrip().split(\" \"))\r\nx = formula(a,c)\r\ny = formula(b,d)\r\n\r\nif x > y:\r\n print(\"Misha\")\r\nelif x == y:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\na=max(3*a//10,a-a//250*c)\r\nb=max(3*b//10,b-b//250*d)\r\nprint([['Tie','Misha'][a>b],'Vasya'][a<b])", "# ========== //\\\\ //|| ||====//||\r\n# || // \\\\ || || // ||\r\n# || //====\\\\ || || // ||\r\n# || // \\\\ || || // ||\r\n# ========== // \\\\ ======== ||//====|| \r\n# code\r\n\r\ndef main():\r\n a,b,c,d = map(int, input().split())\r\n m1 = max((3 * a) // 10, a - (a * c) // 250)\r\n m2 = max((3 * b) // 10, b - (b * d) // 250)\r\n\r\n if m1 > m2:\r\n print('Misha')\r\n elif m1 < m2:\r\n print('Vasya')\r\n else:\r\n print('Tie')\r\n return \r\n\r\nif __name__ == \"__main__\":\r\n main()", "def win(a,b,c,d):\r\n m=max((3*a/10), a-(a*c/250))\r\n v=max((3*b/10), b-(b*d/250))\r\n if m>v:\r\n return 'Misha'\r\n elif v>m:\r\n return 'Vasya'\r\n else:\r\n return 'Tie'\r\na,b,c,d = map(int, input().split())\r\nprint(win(a,b,c,d))", "a, b, c, d = map(int,input().split())\r\nm = max((3 * a)/10, a-(a/250) * c)\r\nv = max((3 * b)/10, b-(b/250) * d)\r\nif m > v:\r\n print(\"Misha\")\r\nelif m < v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\na1=max(3/10*a,a-(a/250)*c)\r\na2=max(3/10*b,b-(b/250)*d)\r\nif(a1>a2):\r\n print(\"Misha\")\r\nelif(a1<a2):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n \r\n", "#{a = input().split(' ')\r\n#for i in range(len(a)):\r\n # a[i] = int(a[i])\r\n#z=max(3*A[0]/10, A[0]-A[0]/250*A[2])\r\n#h=max(3*A[1]/10, A[1]-A[1]/250*A[3])\r\n#if z == h:\r\n# print('Tie')\r\n#if z < h:\r\n# print('Vasya')\r\n#else:\r\n# print('Mish')\r\n#print(a)}\r\n#print('('+a[1]+')')\r\na=list(map(int,input().split()))\r\nm=max(((3*a[0])/10),(a[0]-(a[0]/250*a[2])))\r\nv=max(((3*a[1])/10),(a[1]-(a[1]/250*a[3])))\r\nprint('Tie' if v==m else('Misha' if m>v else 'Vasya'))\r\n", "import sys\r\ninput=lambda:sys.stdin.readline().strip()\r\na,b,c,d=map(int,input().split())\r\nx=max((3*a)/10,a-(a/250)*c)\r\ny=max((3*b)/10,b-(b/250)*d)\r\nif x==y:\r\n print(\"Tie\")\r\nelif x>y:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "line = list(map(int,input().split()))\r\na = line[0]\r\nb = line[1]\r\nc = line[2]\r\nd = line[3]\r\nm1 = (3 * a) / 10\r\nv1 = (3 * b) / 10\r\nm2 = a - ((a / 250) * c)\r\nv2 = b - ((b / 250) * d)\r\nm1 = max(m1,m2)\r\nv1 = max(v1,v2)\r\nif(m1>v1):\r\n print(\"Misha\")\r\nelif(m1 == v1):\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "x=input().split()\r\na=int(x[0])\r\nb=int(x[1])\r\nc=int(x[2])\r\nd=int(x[3])\r\n\r\n\r\nxpoint= max(3*a/10 ,a - (a/250)*c)\r\nypoint= max(3*b/10 ,b - (b/250)*d)\r\nif xpoint==ypoint :\r\n print('Tie')\r\nelse: \r\n if xpoint>ypoint : \r\n print('Misha')\r\n else: \r\n print('Vasya') ", "a, b, c, d = [int(x) for x in input().split()]\r\n\r\nmisha_points = max( ((3) * (a) / 10), (a - (a / 250) * c))\r\nvasya_points = max( ((3) * (b) / 10), (b - (b / 250) * d))\r\n\r\nif misha_points > vasya_points:\r\n print(\"Misha\")\r\nif vasya_points > misha_points:\r\n print(\"Vasya\")\r\nif vasya_points == misha_points:\r\n print(\"Tie\")\r\n", "a,b,c,d=list(map(int,input().split()))\r\nMisha=max(3*a/10,a-a*c/250)\r\nVasya=max(3*b/10,b-b*d/250)\r\nif Misha>Vasya:\r\n\tprint(\"Misha\")\r\nelif Misha<Vasya:\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Tie\")", "a, b, c , d = list(map(int, input().split()))\r\nx = max((3*a)//10, a - (a//250)*c)\r\ny = max((3*b)//10, b - (b//250)*d)\r\nif (x > y):\r\n print(\"Misha\")\r\nelif (y > x):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=[int(x) for x in input().split()]\r\nm=max(3*a//10,a-a*c//250)\r\nv=max(3*b//10,b-b*d//250)\r\nif m>v:\r\n print('Misha')\r\nelif m==v:\r\n print('Tie')\r\nelse:\r\n print('Vasya')", "a, b, c, d = [int(i) for i in input().split()]\n\nmisha = max( (3 * a) / 10, a - a / 250 * c)\nvasya = max( (3 * b) / 10, b - b / 250 * d)\n\nif misha > vasya:\n print(\"Misha\")\nif misha < vasya:\n print(\"Vasya\")\nif misha == vasya:\n print(\"Tie\")\n\t \t\t \t\t\t\t\t \t \t\t \t \t\t", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Jan 8 17:17:04 2019\n\n@author: umang\n\"\"\"\n\ndef calc_points(p, t):\n return max(3*p/10, p - p*t/250)\n\na, b, c, d = map(int, input().split())\n\nif calc_points(a, c) > calc_points(b, d):\n print(\"Misha\")\nelif calc_points(a, c) < calc_points(b, d):\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n \n", "a,b,c,d=map(int,(input().split()))\r\nm=max((3*a)/10,a-(a/250)*c)\r\nn=max((3*b)/10,b-(b/250)*d)\r\nif m > n:\r\n print(\"Misha\") \r\n\r\nelif m < n:\r\n print(\"Vasya\")\r\n\r\nelse:\r\n print(\"Tie\") ", "def go():\n m_p, v_p, m_t, v_t = [int(i) for i in input().split(' ')]\n v = max(3 * v_p // 10, v_p - v_p // 250 * v_t)\n m = max(3 * m_p // 10, m_p - m_p // 250 * m_t)\n if m > v:\n return 'Misha'\n if v > m:\n return 'Vasya'\n return 'Tie'\n\nprint(go())\n", "a, b, c, d = map(int, input().split())\nmis = max((3 * a) // 10, a - (a // 250) * c)\nvas = max((3 * b) // 10, b - (b // 250) * d)\nif mis > vas: print('Misha')\nelif vas > mis: print('Vasya')\nelse: print('Tie')\n \t\t \t \t \t\t \t \t\t\t \t", "a,b,c,d=map(int,input().split())\r\nif max(3*(a//10),a - (a*c)//250)>max(3*(b//10),b-(b*d)//250):\r\n print(\"Misha\")\r\nelif max(3*(a//10),a - (a*c)//250)==max(3*(b//10),b-(b*d)//250):\r\n print(\"Tie\")\r\nelse :\r\n print(\"Vasya\")", "# https://codeforces.com/contest/501/problem/A\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\na, b, c, d = multi_integer()\r\n\r\nmisha_points = max((3*a/10), (a - (a/250)*c))\r\nvasya_points = max((3*b/10), (b - (b/250)*d))\r\n\r\nif misha_points > vasya_points:\r\n print(\"Misha\")\r\nelif misha_points == vasya_points:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d = input().split()\r\n\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\n\r\npermina = a/250\r\nperminb = b/250\r\n\r\npermina*=c\r\nperminb*=d\r\n\r\nbakia=max((a*3)/10,a-permina)\r\nbakib=max((b*3)/10,b-perminb)\r\n\r\nif bakia<bakib:\r\n print(\"Vasya\")\r\nelif bakib<bakia:\r\n print(\"Misha\")\r\nelse :\r\n print(\"Tie\")\r\n", "a,b,c,d = map(int,input().split())\r\nif max((3*a)//10,(a-(a//250)*c))>max((3*b)//10,(b-(b//250)*d)):\r\n print(\"Misha\")\r\nelif max((3*a)//10,(a-(a//250)*c))<max((3*b)//10,(b-(b//250)*d)):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = map(int, input().split())\r\nc1 = max(3*a/10, a - a/250*c)\r\nc2 = max(3*b/10, b - b/250*d)\r\nif c1 > c2:\r\n print(\"Misha\")\r\nelif c2 > c1:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\") ", "def res(p, t): \r\n return max((3*p)/10, p-(p/250)*t)\r\n\r\na, b, c, d = [int(x) for x in input().split()]\r\nr1 = res(a,c)\r\nr2 = res(b,d)\r\n\r\nif r1 == r2:\r\n print('Tie')\r\nelif r1 > r2:\r\n print('Misha')\r\nelse:\r\n print('Vasya')", "a,b,c,d=map(int,input().split())\r\nm=max(3*a/10,a-a/250*c)\r\nn=max(3*b/10,b-b/250*d)\r\nif m>n:\r\n print('Misha')\r\nelif m==n:\r\n print('Tie')\r\nelse:\r\n print ('Vasya')", "a,b,c,d = map(int, input().split())\n\nmisha = max((3*a)/10, a - (a / 250)*c)\nvasy = max((3*b)/10, b - (b / 250)*d)\n\nif vasy > misha:\n print(\"Vasya\")\nelif vasy < misha:\n print(\"Misha\")\nelse:\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nm=max((3*a)/10, a - a/250 * c)\r\nv = max((3*b)/10, b - b/250 * d)\r\nif m==v:\r\n print(\"Tie\")\r\nelif m>v:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\nx=max(((3*a)//10),(a-((a//250)*c)))\r\ny=max(((3*b)//10),(b-((b//250)*d)))\r\nif(x>y):\r\n print(\"Misha\")\r\nelif(x<y):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "l=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\nc=int(l[2])\r\nd=int(l[3])\r\nmisha=max(3*a/10,a-a*c/250)\r\nvasya=max(3*b/10,b-b*d/250)\r\nif(misha>vasya):\r\n print(\"Misha\")\r\nelif(misha<vasya):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=list(map(int,input().split()))\r\nmisha=max(((3*a)/10),(a-(a/250)*c))\r\nvasya=max(((3*b)/10),(b-(b/250)*d))\r\nif misha>vasya:\r\n print(\"Misha\")\r\nelif vasya>misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = map(int, input().split())\r\nmisha = max((0.3*a), a - (a*c)/250)\r\nvasya = max((0.3*b), b - (b*d)/250)\r\nif misha>vasya:\r\n print(\"Misha\")\r\nelif misha<vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "X = list(map(int, input().split()))\r\nM = max(3 * X[0] // 10, X[0] - ((X[0] // 250) * X[2]))\r\nV = max(3 * X[1] // 10, X[1] - ((X[1] // 250) * X[3]))\r\nif V == M:\r\n print(\"Tie\")\r\n exit()\r\nprint(\"Misha\" if M > V else \"Vasya\")", "#контест\nf=input().split(' ')\na=int(f[0])\nb=int(f[1])\nc=int(f[2])\nd=int(f[3])\nif max(3*a/10,a-(a/250)*c) > max(3*b/10,b-(b/250)*d):\n print('Misha')\nif max(3*a/10,a-(a/250)*c) < max(3*b/10,b-(b/250)*d): \n print('Vasya')\nif max(3*a/10,a-(a/250)*c) == max(3*b/10,b-(b/250)*d): \n print('Tie')", "a,b,c,d=input().split()\r\na,b,c,d=int(a),int(b),int(c),int(d)\r\n\r\nif max(3*a/10,a-a*c/250) - max(3*b/10,b-b*d/250) < 0:\r\n print('Vasya')\r\n \r\nelif max(3*a/10,a-a*c/250) - max(3*b/10,b-b*d/250) == 0:\r\n print('Tie')\r\n \r\nelse:\r\n print('Misha')", "a, b, c, d = map(int, input().split())\n\ndef points(possible, time):\n opt1 = (3*possible)/10\n opt2 = possible - (possible/250) * time\n if opt1 > opt2:\n return opt1\n else:\n return opt2\n\nmisha = points(a, c)\nvasya = points(b, d)\n\nif misha > vasya:\n print(\"Misha\")\nelif vasya > misha:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n", "a,b,c,d=map(int,input().split())\r\nx=max(3*a/10,a-a/250*c)\r\ny=max(3*b/10,b-b/250*d)\r\nif x==y:\r\n print(\"Tie\")\r\nelif x<y:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Misha\")", "p1,p2,t1,t2 = map(int,input().split())\r\na = max((3*p1/10),(p1-p1/250*t1))\r\nb = max((3*p2/10),(p2-p2/250*t2))\r\nif a > b:\r\n print(\"Misha\")\r\nelif b > a:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nd = int(d)\n\nmisha = max((3*a)/10, a-((a/250)*c))\nvashya = max((3*b)/10, b-((b/250)*d))\n\nif misha>vashya:\n print(\"Misha\")\nelif vashya>misha:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n\n\t\t \t \t \t\t \t\t\t \t\t \t\t \t\t", "a,b,c,d = map(int,input().split())\r\nm = max(3*a//10,a-(a//250)*c)\r\nv = max(3*b//10,b-(b//250)*d)\r\nif m == v:\r\n print(\"Tie\")\r\nelif m>v:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "a,b,c,d=[int(x) for x in input().split()]\r\nif max((3*a)/10,a-(a/250*c))>max((3*b)/10,b-(b/250*d)):\r\n print(\"Misha\")\r\nelif max((3*b)/10,b-(b/250*d))>max((3*a)/10,a-(a/250*c)):\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\") ", "a, b, c, d = map(int, input().split())\r\nif max((3*a)/10, a-((a/250)*c)) > max((3*b)/10, b-((b/250)*d)):\r\n\tprint(\"Misha\")\r\nelif max((3*a)/10, a-((a/250)*c)) < max((3*b)/10, b-((b/250)*d)):\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Tie\")", "a,b,c,d = list(map(int,input().split()))\r\n\r\n#a,c\r\nmaish = max(((3*a)/10),(a-(a/250)*c))\r\nvas = max(((3*b)/10),(b-(b/250)*d))\r\n\r\nif maish > vas:\r\n print(\"Misha\")\r\nelif vas > maish:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "def compute_score(p, t):\r\n return max(3*p/10, p - p*t/250)\r\na, b, c, d = map(int, input().split())\r\nm, v = compute_score(a, c), compute_score(b, d)\r\nif v > m:\r\n print(\"Vasya\")\r\nelif v < m:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\nplayer1 = max((3*a//10), a - (a//250*c))\r\nplayer2 = max((3*b//10), b - (b//250*d))\r\nif player1 > player2:\r\n print('Misha')\r\nif player2 > player1:\r\n print('Vasya')\r\nif player1 == player2:\r\n print('Tie')\r\n", "a,b,c,d=map(int,input().split())\r\np=max(3*a//10, a-((a*c)//250))\r\nq=max(3*b//10, b-((b*d)//250))\r\nif p>q:\r\n print(\"Misha\")\r\nelif q>p:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "line= input().split()\r\nval= [int(num) for num in line]\r\na,b,c,d=val[0],val[1],val[2],val[3]\r\n#print(a,b,c,d)\r\npoints=3*a/10\r\npo=a-a/250*c\r\nma1=max(points,po)\r\npoint2=3*b/10\r\npo2=b-b/250*d\r\nma2=max(point2,po2)\r\nif ma2 > ma1:\r\n print(\"Vasya\" )\r\nelif ma1 > ma2:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\") ", "a,b,c,d=map(int,input().split())\r\nf=2\r\nres=['Misha','Vasya','Tie']\r\nf=lambda p,t:max(3*p//10,p-p//250*t)\r\n\r\n\r\nq,w=f(a,c),f(b,d)\r\n\r\n\r\nif q==w:\r\n print(res[2])\r\nelif q>w:\r\n print(res[0])\r\nelse:\r\n print(res[1])", "a, b, c, d = [int(i) for i in input().split()]\r\n\r\na = max(3 * a / 10, a - a / 250 * c)\r\n\r\nb = max(3 * b / 10, b - b / 250 * d)\r\n\r\nif a > b:\r\n print('Misha')\r\nelif a < b:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "if __name__ == \"__main__\":\n\ta,b,c,d = map(int,input().split())\n\tx = max((3*a/10),a-(a*c)/250)\n\ty = max((3*b/10),b-(b*d)/250)\n\tif x==y:\n\t\tprint(\"Tie\")\n\telif x>y:\n\t\tprint(\"Misha\")\n\telse:\n\t\tprint(\"Vasya\")\n", "a,b,c,d=map(int,input().split())\r\nx=max((3*a)/10,a-(a/250)*c)\r\ny=max((3*b/10),b-(b/250)*d)\r\nif x>y:\r\n\tprint(\"Misha\")\r\nelif x<y:\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Tie\")\r\n\r\n", "____=[\"Misha\",\"Vasya\",\"Tie\"]\r\n_=list(map(int,input().split()))\r\n__=max(((3*_[0])//10),_[0]-(_[0]//250)*_[2])\r\n___=max(((3*_[1])//10),_[1]-(_[1]//250)*_[3])\r\nif(__>___):\r\n print(____[0])\r\nelif(__<___):\r\n print(____[1])\r\nelse:\r\n print(____[2])", "a,b,c,d=map(int,input().split())\r\nif max((3*a)//10,a-(a*c)//250)>max((3*b)//10,b-(b*d)//250):print(\"Misha\")\r\nelif max((3*a)//10,a-(a*c)//250)<max((3*b)//10,b-(b*d)//250):print(\"Vasya\")\r\nelse:print(\"Tie\")\r\n\r\n\r\n\r\n\r\n\r\n", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\na,b,c,d = readarray(int)\r\n\r\n\r\nMisha = max((3*a)//10, a-(a//250) * c) \r\nVasya = max((3*b)//10, b-(b//250) * d)\r\n\r\nif Misha > Vasya:\r\n print(\"Misha\")\r\nelif Vasya > Misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = map(int, input().split())\r\nvasya = max(3 * b // 10, b - b // 250 * d)\r\nmisha = max(3 * a // 10, a - a // 250 * c)\r\n\r\nif vasya > misha:\r\n print(\"Vasya\")\r\nelif misha > vasya:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\nf = max(0.3 * a, a - (a / 250) * c)\r\ns = max(0.3 * b, b - (b / 250) * d)\r\nif f > s:\r\n print(\"Misha\")\r\nelif s > f:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d = map(int,input().split())\nmisha = max(3*a/10,a-a/250*c)\nvasya = max(3*b/10,b-b/250*d)\n\nif misha > vasya:\n\tprint(\"Misha\")\nelif misha == vasya:\n\tprint(\"Tie\")\nelse:\n\tprint(\"Vasya\")\n", "a,b,c,d = list(map(int,input().split()))\r\nif(max(3*a//10 , a - a//250*c) > max(3*b//10 , b - b//250*d)):\r\n print(\"Misha\")\r\nelif(max(3*a//10 , a - a//250*c) < max(3*b//10 , b - b//250*d)):\r\n print(\"Vasya\")\r\nelse: print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nx=max((3*a//10),(a-(a*c//250)))\r\ny=max((3*b//10),(b-(b*d//250)))\r\nif(x>y):\r\n print(\"Misha\")\r\nelif(x==y):\r\n print(\"Tie\")\r\nelif(y>x):\r\n print(\"Vasya\")\r\n", "liste=input('').split()\r\nM = int(liste[0])\r\nV = int(liste[1])\r\nMt = int(liste[2])\r\nVt = int(liste[3])\r\np1 = max(3/10*M, M -M/250*Mt)\r\np2 = max(3/10*V, V -V/250*Vt)\r\nif p1>p2:\r\n print('Misha')\r\nelif p2>p1:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a_for_misha, b_for_vasya, c_for_misha, d_for_vasya = map( int, input().split() )\r\n\r\nmisha_score = max( (3*a_for_misha)//10, a_for_misha - (a_for_misha//250) * c_for_misha )\r\nvasya_score = max( (3 * b_for_vasya) // 10, b_for_vasya - (b_for_vasya//250) * d_for_vasya )\r\n\r\nif misha_score > vasya_score:\r\n print(\"Misha\")\r\nelif vasya_score > misha_score:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "def pts(p, t):\r\n return max(3 * p // 10, p - p * t // 250)\r\n\r\na, b, c, d = map(int, input().split())\r\nm, v = pts(a, c), pts(b, d)\r\nif m == v:\r\n print(\"Tie\")\r\nelse:\r\n print([\"Vasya\",\"Misha\"][m > v])", "a,b,c,d = map(int,input().split())\r\nm = max(3*a/10,a-a/250*c)\r\nv = max(3*b/10,b-b/250*d)\r\nprint('Misha' if m >v else 'Vasya' if m<v else 'Tie')", "l1= list(map(int, input().split()))\na=l1[0]\nb=l1[1]\nc=l1[2]\nd=l1[3]\nm=max((3*a/10),a-(a*c/250))\nn=max((3*b/10),b-(b*d/250))\nif n>m:\n print(\"Vasya\")\nelif m>n:\n print(\"Misha\")\nelse:\n print(\"Tie\")\n \t\t\t \t\t\t\t \t\t\t \t\t\t \t \t\t\t", "a,b,c,d=map(int,input().split())\r\ns1=max(3*a//10,a-a*c//250)\r\ns2=max(3*b//10,b-b*d//250)\r\nif s1>s2:\r\n\tprint('Misha')\r\nelif s2>s1:\r\n\tprint('Vasya')\r\nelse:\r\n\tprint('Tie')\r\n", "a,b,c,d=map(int,input().split())\r\nans,res=0,0\r\ntemp=max((3*a/10),a-(a/250)*c)\r\nres=max((3*b/10),b-(b/250)*d)\r\nif temp==res:\r\n print(\"Tie\")\r\nelif temp<res:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Misha\")", "a,b,c,d = [int(i) for i in input().split()]\r\n\r\np1 = max(3*a//10,a-a//250*c)\r\np2 = max(3*b//10,b-b//250*d)\r\n\r\nif p1 > p2:\r\n print('Misha')\r\nelif p2 > p1:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\nx=max((3*a//10),(a-(a//250*c)))\r\ny=max((3*b//10),(b-((b//250)*d)))\r\n# print(x,y)\r\nif y>x:\r\n\tprint('Vasya')\r\nelif x>y:\r\n\tprint('Misha')\r\nelse:\r\n\tprint('Tie')", "a, b, c, d = map(int, input().split())\npa1 = (3 * a) // 10\npa2 = a - (a // 250) * c\npb1 = (3 * b) // 10\npb2 = b - (b // 250) * d\nmis = max(pa1, pa2) \nvas = max(pb1, pb2)\nif mis > vas: print('Misha')\nelif vas > mis: print('Vasya')\nelse: print('Tie')\n\n## pa - point of a; pb - point of b\n \t \t \t \t \t \t \t\t\t", "a,b,c,d=map(int,input().split())\ns1=max(3*a//10,a-(a*c)//250)\ns2=max(3*b//10,b-(b*d)//250)\nif s1>s2:\n\tprint('Misha')\nelif s1<s2:\n\tprint('Vasya')\nelse:\n\tprint('Tie')\n\n\n\n\n\n\n", "a,b,c,d=map(int,input().split(' '))\r\np1=max((3*a)//10,a-(a/250)*c)\r\np2=max((3*b)//10,b-(b/250)*d)\r\nif p1>p2:\r\n print(\"Misha\")\r\nelif p1<p2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "abcd = list(map(int, input().split()))\r\nmisha = int(max((3 * abcd[0]) / 10, abcd[0] - (abcd[0] / 250) * abcd[2]))\r\nvasya = int(max((3 * abcd[1]) / 10, abcd[1] - (abcd[1] / 250) * abcd[3]))\r\nif misha == vasya:\r\n\tprint('Tie')\r\nelif misha > vasya:\r\n\tprint('Misha')\r\nelse:\r\n\tprint('Vasya')", "v = list(map(int, input().split()))\na=v[0]\nb=v[1]\nc=v[2]\nd=v[3]\np1=max((3*(a/10)),a-((a/250)*c))\np2=max((3*(b/10)),b-((b/250)*d))\nif p1>p2:\n print(\"Misha\")\nelif p2>p1:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n\t \t\t \t\t\t \t \t \t\t\t \t\t \t\t \t", "a,b,c,d = map(int, input().split())\r\n\r\nx = max(3 * a // 10, a - (a//250) * c)\r\ny = max(3 * b // 10, b - (b//250) * d)\r\n\r\nif x > y:\r\n print('Misha')\r\nelif x < y:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "def readint():\r\n return int(input())\r\n\r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\ndef points(p, t):\r\n return max((3*p)/10, (p - p/250*t))\r\n\r\na, b, c, d = readarray(int)\r\n\r\nmisha = points(a, c)\r\nvasya = points(b, d)\r\n\r\nif misha > vasya: print(\"Misha\")\r\nelif misha < vasya: print(\"Vasya\")\r\nelse: print(\"Tie\")", "def score(points,time):\r\n return max(3*points/10,points-points/250 * time)\r\n\r\na,b,c,d = map(int,input().split())\r\n\r\nmisha = score(a,c)\r\nvasya = score(b,d)\r\nprint(\"Misha\" if misha > vasya else \"Vasya\" if vasya>misha else \"Tie\")", "a, b, c, d = map(int,input().split())\r\nx = max(3 * a // 10, a - a // 250 * c)\r\ny = max(3 * b // 10, b - b // 250 * d)\r\nif x > y:\r\n print(\"Misha\")\r\nelif x < y:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "inp = input().split()\nmishaPoints = int(inp[0])\nvasyaPoints = int(inp[1])\nmishaTime = int(inp[2])\nvasyaTime = int(inp[3])\n\nmishaResult = max((3*mishaPoints)/10, mishaPoints - (mishaPoints/250)*mishaTime)\nvasyaResult = max((3*vasyaPoints)/10, vasyaPoints - (vasyaPoints/250)*vasyaTime)\n\nif (mishaResult == vasyaResult):\n print(\"Tie\")\nelif (mishaResult > vasyaResult):\n print(\"Misha\")\nelse:\n print(\"Vasya\")\n \t\t\t\t \t \t\t \t \t \t\t \t \t", "a, b, c, d = (int(x) for x in input().split())\nx, y = max(3 * a / 10, a - a / 250 * c), max(3 * b / 10, b - b / 250 * d)\nif x > y:\n print('Misha')\nelif x < y:\n print('Vasya')\nelse:\n print('Tie')\n", "a, b, c, d = map(int, input().split())\r\nm = max((3*a)//10, a-a//250*c)\r\nv = max((3*b)//10, b-b//250*d)\r\nif m>v:\r\n print(\"Misha\")\r\nelif v>m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "# Wadea #\r\n\r\nm1,v1,tm1,tv1 = input().split()\r\nm1,v1,tm1,tv1 = int(m1),int(v1),int(tm1),int(tv1)\r\n\r\nm2 = int(m1-((m1/250)*tm1))\r\nv2 = int(v1-((v1/250)*tv1))\r\nm3 = int((3*m1)/10)\r\nv3 = int((3*v1)/10)\r\n\r\nmm = max(m2,m3)\r\nvv = max(v2,v3)\r\n\r\nif mm > vv:\r\n print(\"Misha\")\r\nelif mm < vv:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a= input()\r\nlis = list(map(int,a.split()))\r\ndef findScore(points,time):\r\n psum = (3*points)/10\r\n tsum = points-(points/250)*time\r\n return max(psum,tsum)\r\nm = findScore(lis[0],lis[2])\r\nv = findScore(lis[1],lis[3])\r\nif m>v:\r\n print(\"Misha\")\r\nelif m<v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\na=max(3*a//10,a-a//250*c)\r\nb=max(3*b//10,b-b//250*d)\r\n\r\nif(a>b):\r\n print('Misha')\r\nelif(a<b):\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n\r\n", "l=list(map(int,input().split()))\r\na=int(l[0])\r\nb=int(l[1])\r\nc=int(l[2])\r\nd=int(l[3])\r\nm1=max(int(3*a/10),int(a-((a/250)*c)))\r\nm2=max(int(3*b/10),int(b-((b/250)*d)))\r\nif m1>m2:\r\n print(\"Misha\")\r\nelif m1<m2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a,b,c,d = map(int,input().split())\r\n\r\nif max(3*a/10,a - a/250*c) > max(3*b/10,b-b/250*d):\r\n print('Misha')\r\nelif max(3*a/10,a - a/250*c) < max(3*b/10,b-b/250*d):\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Aug 17 16:50:32 2018\r\n\r\n@author: kartik\r\n\"\"\"\r\n\r\nn=map(int,input().split())\r\nn=list(n)\r\na,b,c,d = n[0:4]\r\n\r\nm1 = max(0.3*a,(a-((a/250))*c))\r\nm2 = max(0.3*b,(b-((b/250))*d))\r\n\r\nif m1>m2:\r\n print(\"Misha\")\r\nelif m1<m2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na, b, c, d = map(int, input().split())\r\n\r\nf = max(3 * a / 10, a - a / 250 * c)\r\ns = max(3 * b / 10, b - b / 250 * d)\r\n\r\nif f == s:\r\n print(\"Tie\")\r\nelse:\r\n print(\"Misha\" if f > s else \"Vasya\")", "import sys\r\ninput=sys.stdin.buffer.readline\r\n\r\na,b,c,d=map(int,input().split())\r\nm=max(3*a/10,a-(a//250)*c)\r\nv=max(3*b/10,b-(b//250)*d)\r\nif m==v:\r\n\tprint(\"Tie\")\r\nelif m>v:\r\n\tprint(\"Misha\")\r\nelse:\r\n\tprint(\"Vasya\")", "a, b, c, d = map(float, input().split())\n\na1 = 3.0 * a / 10.0\na2 = a - ((a/250) * c)\nans1 = max((a1, a2))\n\nb1 = 3.0 * b / 10.0\nb2 = b - ((b / 250.0) * d)\nans2 = max(b1, b2)\n\nif ans1 > ans2:\n print(\"Misha\")\nelif ans1 < ans2:\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n\t\t\t\t \t\t\t\t \t \t \t\t\t\t \t\t \t\t", "a, b, c, d = map(int, input().split())\npa1 = (3 * a) // 10\npa2 = a - (a // 250) * c\npb1 = (3 * b) // 10\npb2 = b - (b // 250) * d\nif pa1 > pa2: mis = pa1\nelse: mis = pa2 \nif pb1 > pb2: vas = pb1\nelse: vas = pb2\nif mis > vas: print('Misha')\nelif vas > mis: print('Vasya')\nelse: print('Tie')\n\n## pa - point of a; pb - point of b\n\t \t\t\t \t \t \t \t\t \t \t\t \t\t \t", "a,b,c,d=map(int,input().split())\nl=lambda x,y:max(3*x//10,x-x//250*y)\nk=l(a,c)\nz=l(b,d)\nprint([['Tie','Misha'][k>z],'Vasya'][k<z])\n \t \t \t \t\t \t\t \t \t\t\t\t \t \t", "a,b,c,d=map(int,input().split(' '))\nx=max(3*a//10, a-(a*c)//250)\ny = max(3*b//10 , b-(b*d)//250)\nif(x>y):print('Misha')\nelif(x<y):print('Vasya')\nelse:print('Tie')\n", "a, b, c, d = [int(x) for x in input().split()]\r\n\r\nm = max((3 * a)/10, a - ((a / 250) * c))\r\nv = max((3 * b)/10, b - ((b / 250) * d))\r\n\r\nif m == v:\r\n print(\"Tie\")\r\nelif m < v:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Misha\")", "a,b,c,d=map(int,input().split())\r\nm=max((3*a)//10,a-((a//250)*c))\r\nv=max((3*b)//10,b-((b//250)*d))\r\nif m>v:\r\n print('Misha')\r\nelif m<v:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a=list(input().split())\r\nms=max((3*int(a[0]))/10,int(a[0])-((int(a[0])/250)*int(a[2])))\r\nvs=max((3*int(a[1]))/10,int(a[1])-((int(a[1])/250)*int(a[3])))\r\nif ms==vs:\r\n print('Tie')\r\nelif ms>vs:\r\n print('Misha')\r\nelse:\r\n print('Vasya')", "a, b, c, d = map(int, input().split())\r\nmisha_points = max((3*a)/10, a - (a/250 * c))\r\nvasya_points = max((3*b)/10, b - (b/250 * d))\r\nif vasya_points == misha_points:\r\n\tprint('Tie')\r\nelse:\r\n\tprint('Vasya' if vasya_points > misha_points else 'Misha')", "a,b,c,d=map(int, input().split())\nm=max(3*a/10,a-(a/250)*c)\nv=max(3*b/10,b-(b/250)*d)\nif m == v:\n print(\"Tie\")\nelif m > v:\n print(\"Misha\")\nelse:\n print(\"Vasya\")\n", "a, b, c, d = map(int, input().split())\r\nmisha = max(3*a/10, (a-a/250*c))\r\nvasya = max(3*b/10, (b-b/250*d))\r\n\r\nif misha == vasya:\r\n print(\"Tie\")\r\nelif misha > vasya:\r\n print(\"Misha\")\r\nelse:\r\n print(\"Vasya\")", "import sys\ninput = sys.stdin.buffer.readline\n\n# t = int(input())\n# for _ in range(t):\n \na, b, c, d = map(int, input().split())\nmisha = max(3*a//10, a-(a//250)*c)\nvasya = max(3*b//10, b-(b//250)*d)\nif misha == vasya:\n print(\"Tie\")\nelif misha > vasya:\n print(\"Misha\")\nelse:\n print(\"Vasya\")", "a,b,c,d=map(int,input().split())\r\nans1=max(3*a//10,a-((a*c)//(250)))\r\nans2=max(3*b//10,b-((b*d)//(250)))\r\nif ans1>ans2:\r\n\tprint(\"Misha\")\r\nelif ans1<ans2:\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Tie\")", "a, b, c, d = map(int, input().split())\r\n\r\namax = max(3 * a / 10, a - (a / 250 * c))\r\nbmax = max(3 * b / 10, b - (b / 250 * d))\r\n\r\nif amax > bmax:\r\n print(\"Misha\")\r\nelif amax < bmax:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "import math\r\nimport sys\r\nimport collections\r\n\r\n#imgur.com/Pkt7iIf.png\r\n\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\n\r\ndef p(a, c):\r\n return max((3*a)//10, a - (a//250) * c)\r\na, b, c, d = mi()\r\nif p(a,c) > p(b,d):\r\n print('Misha')\r\nelif p(a,c) < p(b,d):\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "a,b,c,d=map(int,input().split())\r\n \r\nm=max(3*a/10,a-a/250*c)\r\nv=max(3*b/10,b-b/250*d)\r\n \r\nif m>v:print('Misha')\r\nelif v>m:print('Vasya')\r\nelse:print('Tie')", "a,b,c,d = map(int,input().split())\nmisha_score = max(3*a//10,a-(a//250)*c)\nvasya_score = max(3*b//10,b-(b//250)*d)\nif misha_score == vasya_score:\n print(\"Tie\")\nelif misha_score > vasya_score:\n print(\"Misha\")\nelse:\n print(\"Vasya\")\n", "a,b,c,d=map(int,input().split())\r\nm=max((3*a)/10,a-(a*c)/250)\r\nv=max((3*b)/10,b-(b*d)/250)\r\nif(m>v):\r\n\tprint(\"Misha\")\r\nelif(v>m):\r\n\tprint(\"Vasya\")\r\nelse:\r\n\tprint(\"Tie\")", "a, b, c, d = map(int, input().split())\r\npoints_Misha = max((3*a)/10, a-(a/250)*c)\r\npoints_Vasya = max((3*b)/10, b-(b/250)*d)\r\nif points_Misha > points_Vasya:\r\n print(\"Misha\")\r\nelif points_Vasya > points_Misha:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a, b, c, d = list(map(int, input().split()))\r\nx = max(3*a/10, a - (a/250)*c)\r\ny = max(3*b/10, b - (b/250)*d)\r\nif x > y:\r\n print(\"Misha\")\r\nelif y > x:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d = map(int, input().split())\r\n#p = a // 250\r\n#q = b // 250\r\nx = max((3*a)//10, a-(a//250)*c)\r\ny = max((3*b)//10, b-(b//250)*d)\r\n\r\nif x > y:\r\n print(\"Misha\")\r\nelif x < y:\r\n print(\"Vasya\")\r\nelif x == y:\r\n print(\"Tie\")\r\n", "a,b,c,d=map(int, input().split())\r\nk=max((3*a)//10,(a-(a//250)*c))\r\np=max((3*b)//10,(b-(b//250)*d))\r\nif k>p:\r\n print(\"Misha\")\r\nelif k<p:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "\nap, bp, at, bt = input().split()\n\natot = max([(3*int(ap))/10, int(ap)-(int(ap)/250)*int(at)])\nbtot = max([(3*int(bp))/10, int(bp)-(int(bp)/250)*int(bt)])\n\nif atot > btot:\n print(\"Misha\")\nelif btot > atot:\n print(\"Vasya\")\nelse:\n print(\"Tie\")", "arr = list(map(int, input().split()))\r\n\r\nmisha = max(3*arr[0]/10, arr[0] - arr[0]*arr[2]/250)\r\nvasya = max(3*arr[1]/10, arr[1] - arr[1]*arr[3]/250)\r\n\r\nif misha == vasya:\r\n print(\"Tie\")\r\nelif misha < vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Misha\")", "n,m,c,d=list(map(int, input().split()))\r\nx=max((3*n)//10,n-(n//250)*c)\r\ny=max((3*m)//10,m-(m//250)*d)\r\nif x>y:\r\n print(\"Misha\")\r\nelif y>x:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "x = list(input().split())\r\nfor i in range(len(x)):\r\n x[i]=int(x[i])\r\nM = max((3*x[0])/10 , x[0]-((x[0]/250)*x[2]))\r\nV = max((3*x[1])/10 , x[1]-((x[1]/250)*x[3]))\r\nif M>V:\r\n print(\"Misha\")\r\nelif M<V:\r\n print(\"Vasya\")\r\nelif M==V:\r\n print(\"Tie\")", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\na, b, c, d = [int(x) for x in input().split()]\r\nMisha = max((3 * a) / 10, a - (a / 250) * c)\r\nVasya = max((3 * b) / 10, b - (b / 250) * d)\r\n\r\nif Misha > Vasya:\r\n print(\"Misha\")\r\nelif Misha < Vasya:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split());m,v=max(3*a*0.1,a-a*c//250),max(3*b*0.1,b-b*d//250)\r\nif m>v:print('Misha')\r\nelif m==v:print('Tie')\r\nelse:print('Vasya')", "a,b,c,d=[int(i) for i in input().split()]\r\nmisha_points=max(3*a/10,a-a*c/250)\r\nvasya_points=max(3*b/10,b-b*d/250)\r\nif misha_points>vasya_points:\r\n print('Misha')\r\nelif misha_points==vasya_points:\r\n print('Tie')\r\nelse:\r\n print('Vasya')", "\r\na,b,c,d = map(int,input().split())\r\n\r\n#l = list(map(str,input().split()))\r\n \r\n#sum = 0\r\n\r\ndef score(p,t):\r\n \r\n return max(3*p/10,p - p/250 *t)\r\n\r\nif score(a,c) > score(b,d) :\r\n print(\"Misha\")\r\nelif score(a,c) < score(b,d) :\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "a, b, c, d = map(int, input().split())\r\n\r\nmishas_point = max((3*a)//10, (a-(a//250)*c))\r\nvasyas_point = max((3*b)//10, (b-(b//250)*d))\r\n\r\nif mishas_point > vasyas_point:\r\n print('Misha')\r\nelif mishas_point < vasyas_point:\r\n print('Vasya')\r\nelse:\r\n print('Tie')\r\n", "a, b, c, d = map(int, input().split())\r\nm1 = max((3 * a)/10, a - a/250 * c)\r\nv1 = max((3 * b)/10, b - b/250 * d)\r\nif m1 > v1:\r\n print('Misha')\r\nelif m1 < v1:\r\n print('Vasya')\r\nelse:\r\n print('Tie')", "import sys\r\nimport math\r\nfrom statistics import mean\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int (input ()))\r\n\r\n\r\ndef inlt():\r\n return (list (map (int, input ().split ())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list (s[:len (s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map (int, input ().split ()))\r\n\r\n\r\na, b, c, d = invr()\r\nm = max(((3*a)/10), (a - ((a*c)/250)))\r\nv = max(((3*b)/10), (b - ((b*d)/250)))\r\nif m > v:\r\n print(\"Misha\")\r\nelif v > m:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a, b, c, d = [int(x) for x in input().split()]\r\nmisha = max(3 * a / 10, a - a * c / 250)\r\nvasya = max(3 * b / 10, b - b * d / 250)\r\nif misha == vasya:\r\n print(\"Tie\")\r\nelse:\r\n print([\"Misha\", \"Vasya\"][vasya > misha])\r\n", "p1,p2,t1,t2=map(int,input().split())\r\nz1=max((3*p1)//10,(p1-(p1/250)*t1))\r\nz2=max((3*p2)//10,(p2-(p2/250)*t2))\r\nif z1>z2:\r\n print(\"Misha\")\r\nelif z2>z1:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")", "a,b,c,d=map(int,input().split())\r\nz=max(0.3*a,a-(a*c)/250)\r\nx=max(0.3*b,b-(b*d)/250)\r\nif x==z:\r\n\tprint(\"Tie\")\r\nelif max(z,x)==z:\r\n\tprint(\"Misha\")\r\nelif max(z,x)==x:\r\n\tprint(\"Vasya\")\r\n", "\r\n\r\ndef main():\r\n a, b, c, d = map(int, input().split())\r\n\r\n first = max(3 * a // 10, a - (a // 250 * c))\r\n second = max(3 * b // 10, b - (b // 250 * d))\r\n\r\n if first > second:\r\n print('Misha')\r\n elif first < second:\r\n print('Vasya')\r\n else:\r\n print('Tie')\r\nmain()\r\n", "user = input().split()\r\nuser = [int(x) for x in user]\r\na, b, c, d = user[0], user[1], user[2], user[3]\r\nmishapoints = (a - (a/250) * c)\r\nmishapointsalt = ((3*a) / 10)\r\nvasyapoints = (b - (b/250) * d)\r\nvasyapointsalt = ((3*b) / 10)\r\nfirst = 0\r\nsecond = 0\r\nif mishapoints > mishapointsalt:\r\n first = mishapoints\r\nelse:\r\n first = mishapointsalt\r\n\r\nif vasyapoints > vasyapointsalt:\r\n second = vasyapoints\r\nelse:\r\n second = vasyapointsalt\r\n\r\n\r\nif first > second:\r\n print(\"Misha\")\r\nelif second > first:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")\r\n", "f = list(map(int,input().split()))\n\ndef func(a,b):\n return max((3*a)/10,a-a*b/250)\n\n\nif func(f[0],f[2])>func(f[1],f[3]):\n print(\"Misha\")\nelif func(f[0],f[2])<func(f[1],f[3]):\n print(\"Vasya\")\nelse:\n print(\"Tie\")\n\n\n\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled60.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1_5zBpQX0AmGklJanmyzNjYDfVnhJxgIK\n\"\"\"\n\nl1=list(map(int,input().split()))\na=l1[0]\nb=l1[1]\nc=l1[2]\nd=l1[3]\ne=max(3*a/10,a-a/250*c)\nf=max(3*b/10,b-b/250*d)\nif e>f:\n print(\"Misha\")\nelif f>e:\n print(\"Vasya\")\nelse:\n print(\"Tie\")", "def pointcalc(p,t):\r\n p1=(3*p)/10\r\n p2=(p-((p/250)*t))\r\n if p1>=p2:\r\n return p1\r\n else:\r\n return p2\r\na,b,c,d = input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\nP1=pointcalc(a,c)\r\nP2=pointcalc(b,d)\r\nif P1>P2:\r\n print(\"Misha\")\r\nelif P1<P2:\r\n print(\"Vasya\")\r\nelse:\r\n print(\"Tie\")" ]

[ "n = int(input())\r\ns = input()\r\nD = dict()\r\nD_mins = dict()\r\nfor i in range(len(s)):\r\n if i % 2 == 0:\r\n if s[i] in D:\r\n D[s[i]] += 1\r\n else:\r\n D[s[i]] = 1\r\n\r\n if s[i] in D_mins:\r\n D_mins[s[i]] = min(D_mins[s[i]], D[s[i]])\r\n else:\r\n D_mins[s[i]] = 1\r\n\r\n else:\r\n key = s[i].lower()\r\n if key in D:\r\n D[key] -= 1\r\n else:\r\n D[key] = -1\r\n\r\n if key in D_mins:\r\n D_mins[key] = min(D_mins[key], D[key])\r\n else:\r\n D_mins[key] = -1\r\n\r\nkey_to_buy = 0\r\nfor elem in D_mins.values():\r\n if elem < 0:\r\n key_to_buy += elem\r\nprint(-key_to_buy)", "n = int(input())\r\ns = input()\r\n\r\nd = {}\r\nlt = 'qwertyuiopasdfghjklmnbvcxz'\r\n\r\nfor l in lt:\r\n d[l] = 0\r\n\r\ncnt = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n d[i] += 1\r\n else:\r\n if d[i.lower()] <= 0:\r\n cnt += 1\r\n else:\r\n d[i.lower()] -= 1\r\n\r\nprint(cnt)\r\n", "from collections import defaultdict\r\nn=int(input())\r\ns=input().rstrip()\r\nd=defaultdict(int)\r\nc=0\r\nfor i in range(2*n-2):\r\n if i%2==0:\r\n d[s[i].upper()]+=1\r\n else:\r\n if d[s[i]]==0:\r\n c+=1\r\n else:\r\n d[s[i]]-=1\r\nprint(c)", "n = int(input())\r\n\r\ns = input()\r\n\r\nd = {}\r\n\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n if not(i&1):\r\n cur = s[i].upper()\r\n if cur in d:\r\n d[cur] += 1\r\n else:\r\n d[cur] = 1\r\n else:\r\n if s[i] in d:\r\n d[s[i]] -= 1\r\n if d[s[i]] == 0:\r\n d.pop(s[i])\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\nplan = input()\r\nkeys = [0] * 26\r\nnew_keys = 0\r\n\r\nmakeHash = lambda x: ord(x) % 26\r\n\r\nfor i in range(0, len(plan), 2): \r\n\r\n index_ = makeHash(plan[i+1].lower())\r\n\r\n if plan[i].capitalize() != plan[i+1] and not keys[index_]: \r\n new_keys += 1\r\n keys[makeHash(plan[i])] += 1\r\n \r\n elif keys[index_]: \r\n keys[index_] -= 1\r\n keys[makeHash(plan[i])] += 1\r\n \r\nprint(new_keys)", "n = int(input())\r\nrooms = input()\r\n\r\nchars = 'abcdefghijklmnopqrstuvwxyz'\r\nchars = [c for c in chars]\r\ncnt = [0] * 26\r\nhash_map = dict(zip(chars, cnt))\r\ncount = 0\r\ni = 0\r\n\r\nwhile i < len(rooms):\r\n if rooms[i] in hash_map:\r\n hash_map[rooms[i]] += 1\r\n elif rooms[i] not in hash_map and hash_map[rooms[i].lower()] > 0:\r\n hash_map[rooms[i].lower()] -= 1\r\n else:\r\n count += 1\r\n i += 1\r\nprint(count)", "import collections\nn = int(input())\ns = input()\nkeys = collections.defaultdict(int)\nreq = 0\nfor j in range(1, 2 * n - 2, 2):\n keys[s[j - 1].upper()] += 1\n if keys[s[j]]:\n keys[s[j]] -= 1\n else:\n req += 1\nprint(req)", "from collections import defaultdict\r\nn = int(input())\r\ns = input()\r\nres = 0\r\nd = defaultdict(int)\r\nfor i, e in enumerate(s):\r\n if i%2==0:\r\n d[e] += 1\r\n else:\r\n k = chr(ord(e)+32)\r\n if not d[k]:\r\n res += 1\r\n else:\r\n d[k] -= 1\r\nprint(res)\r\n ", "n = int(input())\r\ns = str(input())\r\nl = [0]*26\r\nc = 0\r\nfor i in range(0,len(s),2):\r\n if(s[i].upper() != s[i+1]):\r\n l[ord(s[i]) - 97]+=1;\r\n if(l[ord(s[i+1].lower()) - 97] > 0):\r\n l[ord(s[i+1].lower()) - 97]-=1 \r\n else:\r\n c+=1 \r\n \r\nprint(c) ", "n=int(input())\r\na=input()\r\nd={}\r\nc=0\r\nfor i in range(0,len(a),2):\r\n if (chr(ord(a[i])-32)) not in d:\r\n d[chr(ord(a[i])-32)]=1\r\n else:\r\n d[chr(ord(a[i])-32)]+=1\r\n if a[i+1] in d:\r\n d[a[i+1]]-=1\r\n if d[a[i+1]]==0:\r\n d.pop(a[i+1])\r\n else:\r\n c+=1\r\nprint(c)\r\n ", "n=int(input())\r\ns=list(input().lower())\r\nd={}\r\nans=0\r\nfor i in range(2*n-2):\r\n if i%2==0: d[s[i]]=d.get(s[i],0)+1\r\n else:\r\n if d.get(s[i],0): d[s[i]]-=1\r\n else: ans+=1\r\nprint(ans)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/525/A\r\n\r\nn = int(input())\r\nl_c = input()\r\n\r\nt = 0\r\nd_k = {}\r\n\r\nfor i in range(n * 2 - 2):\r\n if i % 2 == 0:\r\n if l_c[i] not in d_k:\r\n d_k[l_c[i]] = 1\r\n else:\r\n d_k[l_c[i]] += 1\r\n else:\r\n if l_c[i].lower() in d_k and d_k[l_c[i].lower()] > 0:\r\n d_k[l_c[i].lower()] -= 1\r\n else:\r\n t += 1\r\n \r\nprint(t)", "from sys import stdin\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\ninput()\r\ncnt = {}\r\nseen2 = set()\r\nans = 0\r\nfor c in input():\r\n if 'A' <= c and c <= 'Z':\r\n if c.lower() not in cnt: ans += 1\r\n elif cnt[c.lower()] == 0: ans += 1\r\n else: cnt[c.lower()] -= 1\r\n elif c not in cnt: cnt[c] = 1\r\n else: cnt[c] += 1\r\n \r\nprint(ans)\r\n", "from collections import defaultdict\r\nd=defaultdict(int)\r\nn=int(input())\r\ns=input().strip()\r\ns1=[]\r\ns2=[]\r\nfor i in range(65,91):\r\n\ts1.append(chr(i))\r\nfor i in range(97,123):\r\n\ts2.append(chr(i))\r\nres=0\r\nfor i in range(0,len(s),2):\r\n if (ord(s[i])-ord('a')==ord(s[i+1])-ord('A')) or (ord(s[i])-ord('A')==ord(s[i+1])-ord('a')):\r\n \tcontinue\r\n elif s[i+1] in s1 and d[s2[ord(s[i+1])-ord('A')]]!=0:\r\n \td[s2[ord(s[i+1])-ord('A')]]-=1\r\n \td[s[i]]+=1\r\n \tcontinue\r\n \t\r\n elif s[i+1] in s2 and d[s1[ord(s[i+1])-ord('a')]]!=0:\r\n \td[s1[ord(s[i+1])-ord('a')]]-=1\r\n \td[s[i]]+=1\r\n \tcontinue\r\n \r\n else:\r\n \tres+=1\r\n \td[s[i]]+=1\r\nprint(res)", "from collections import *\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nd = defaultdict(int)\r\nk = 0\r\nfor i in range(2 * (n - 1)):\r\n if i % 2 == 0:\r\n d[s[i].upper()] += 1\r\n else:\r\n if d[s[i]] == 0:\r\n k += 1\r\n else:\r\n d[s[i]] -= 1\r\nprint(k)\r\n", "#!/usr/bin/env python\n# -.- coding: utf-8 -.-\n\n\ndef main():\n n_rooms = int(input())\n line = input()\n keys = line[0::2]\n doors = line[1::2]\n buykeys = 0\n keyinbag = {}\n for room_index in range(n_rooms - 1):\n if keys[room_index] in keyinbag:\n keyinbag[keys[room_index]] += 1\n else:\n keyinbag[keys[room_index]] = 1\n if not doors[room_index].lower() in keyinbag or\\\n keyinbag[doors[room_index].lower()] < 1:\n buykeys += 1\n else:\n keyinbag[doors[room_index].lower()] -= 1\n print(buykeys)\n\n\nif __name__ == \"__main__\":\n main()\n", "from sys import stdin\r\ninput = lambda: stdin.readline().rstrip(\"\\r\\n\")\r\nn = int(input())\r\ns = input()\r\nans,d = 0,{}\r\nfor i in s:\r\n if i.islower():\r\n if d.get(i): d[i]+=1\r\n else: d[i]=1\r\n else:\r\n if d.get(i.lower()): d[i.lower()]-=1\r\n else:ans+=1\r\nprint(ans)", "a = int(input())\r\nb = input()\r\nc = 0\r\nd = {chr(i):0 for i in range(ord('a'),ord('z')+1)}\r\nfor i in range(len(b)//2):\r\n d[b[i*2]] += 1\r\n if d[b[i*2+1].lower()] == 0:\r\n c += 1\r\n else:\r\n d[b[i*2+1].lower()]-=1\r\nprint(c)", "n=int(input())\r\ns=input()\r\nc=[]\r\nfor i in range(26):\r\n c.append(0)\r\nans=0\r\nfor i in range(2*n-2):\r\n if(i%2==0):\r\n c[ord(s[i])-ord('a')]+=1\r\n else:\r\n if c[(ord(s[i])+32-ord('a'))]>0:\r\n c[(ord(s[i]) + 32 - ord('a'))]-=1\r\n else:\r\n ans+=1\r\nprint(ans)", "count = int(input())\r\nstring = input()\r\nanswer = 0\r\nkeyMap = {}\r\nfor value in string:\r\n\tif value.islower():\r\n\t\tkeyMap[value] = keyMap.get(value, 0) + 1\r\n\telse:\r\n\t\tif keyMap.get(value.lower(),0) > 0:\r\n\t\t\tkeyMap[value.lower()] = keyMap.get(value.lower(), 0) -1\r\n\t\telse:\r\n\t\t\tanswer += 1\r\n\r\nprint(answer)", "import sys\r\nreadline=sys.stdin.readline\r\nimport math\r\nfrom sys import stdin\r\nsys_max=sys.maxsize\r\nfrom collections import Counter\r\n \r\nfor _ in range(1):\r\n n=int(readline().strip())\r\n s=readline().strip()\r\n ans=0\r\n d={}\r\n for i in range(2*n-2):\r\n if(i%2==0):\r\n d[s[i].upper()]=d.get(s[i].upper(),0)+1\r\n else:\r\n if(d.get(s[i],0)==0):\r\n ans+=1\r\n else:\r\n d[s[i]]-=1\r\n print(ans)\r\n", "n = int(input())\r\ns = input()\r\nd = {}\r\nres = 0\r\nfor data in s:\r\n if data.islower():\r\n d[data] = d.get(data,0) + 1\r\n else:\r\n if d.get(data.lower(),0) > 0:\r\n d[data.lower()] = d[data.lower()] - 1 \r\n else:\r\n res += 1 \r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nd = {}\r\nc = 0\r\nfor i in s:\r\n if i.islower():\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n elif i.isupper():\r\n i = i.lower()\r\n if i in d and d[i] > 0:\r\n d[i] -= 1\r\n else:\r\n c += 1\r\nprint(c)\r\n", "\r\nn=int(input())\r\nx=input(\"\")\r\nl=[0]*26\r\nc=0\r\nfor i in x:\r\n if (ord(i)>=ord('a') and ord(i)<=ord('z')):\r\n i_index=ord(i)%ord('a')\r\n l[i_index]+=1\r\n else:\r\n i_index=ord(i)%ord('A')\r\n if (l[i_index]>=1):\r\n l[i_index]-=1\r\n else:\r\n c+=1\r\n\r\n\r\nprint(c)", "from string import ascii_lowercase as alc\n\nnumber_of_rooms = int(input())\nhouse_plan = input()\n\ncount_of_keys = {}\nfor letter in alc:\n count_of_keys[letter] = 0\n \nkeys_needed = 0\nfor i in range(len(house_plan)):\n letter = house_plan[i]\n if (letter.isupper()):\n if (count_of_keys[letter.lower()] == 0):\n keys_needed += 1\n else:\n count_of_keys[letter.lower()] -= 1\n else:\n count_of_keys[letter] += 1 \n\nprint(keys_needed)\n \t \t \t\t \t \t \t\t\t \t \t\t\t\t \t\t\t", "n = int(input())\n\nkeysNeeded = 0\nkeys = {}\ns = input()\n\n\nfor i in range(len(s)):\n letter = s[i]\n \n # even\n if i % 2 == 0:\n if letter not in keys.keys():\n keys[letter] = 1\n else:\n keys[letter] += 1\n # odd \n else:\n if letter.lower() not in keys.keys() or keys[letter.lower()] <=0:\n keysNeeded += 1\n else:\n keys[letter.lower()] -= 1\n \n \nprint(keysNeeded)\n \t \t\t \t\t\t \t\t \t\t\t \t \t \t\t\t \t", "from collections import *\r\n\r\nS=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ns=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nd=defaultdict()\r\n\r\nfor i in S:\r\n d[i]=0\r\n \r\nfor i in s:\r\n d[i]=0\r\n\r\n#print(d) \r\nm=int(input())\r\nt=input()\r\n\r\nfor i in range(len(t)):\r\n if(t[i].islower()):\r\n q=t[i].upper()\r\n d[t[i]]+=1\r\n \r\n \r\n else:\r\n q=t[i].lower()\r\n #print(q,t[i])\r\n if(d[q]==0):\r\n d[t[i]]+=1\r\n elif(d[q]>0):\r\n d[q]-=1\r\n \r\nsn=0 \r\nfor i in S:\r\n sn+=d[i]\r\n \r\nprint(sn)\r\n \r\n \r\n ", "n=int(input())\r\ns=input()\r\nd,c=dict(),0\r\nfor i in range(0,2*n-2,2):\r\n if ord(s[i])-32 != ord(s[i+1]):\r\n d[s[i]]=d.get(s[i],0)+1\r\n if d.get(chr( ord(s[i+1]) + 32 ),0)!=0:\r\n d[chr(ord(s[i+1])+32)]-=1\r\n else:\r\n c+=1\r\nprint(c)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\ninp = input()\r\n\r\nkeys = defaultdict(lambda: 0)\r\nres = 0\r\n\r\nfor i in range(0, 2*(n-1), 2):\r\n keys[inp[i]] += 1\r\n if keys[inp[i+1].lower()] > 0:\r\n keys[inp[i+1].lower()] -= 1\r\n else:\r\n res += 1\r\n\r\nprint(res)", "n=int(input(''))\r\ns=input('')\r\na=[]\r\nans=0\r\nfor i in range(0,26):\r\n a.append(0)\r\nfor i in range(0,2*n-2,2):\r\n a[ord(s[i])-ord('a')]+=1\r\n if a[ord(s[i+1])-ord('A')]==0:\r\n ans+=1\r\n else:\r\n a[ord(s[i+1])-ord('A')]-=1\r\nprint(ans)\r\n", "n = int(input())\ntexto = input()\n\nchaves = [0] * 26\ncount = 0\nfor i in range(len(texto)):\n char = texto[i]\n if char.isupper() == True:\n if chaves[ord(char) - 65] == 0:\n count += 1\n else:\n chaves[ord(char) - 65] -= 1\n else:\n char = char.upper()\n chaves[ord(char) - 65] += 1\n \nprint(count)\n \t \t\t\t\t\t\t\t\t\t \t\t \t \t\t \t\t \t", "from collections import defaultdict\n\nn = int(input())\nhouse = input()\n\ncounter = 0\nkeys = defaultdict(lambda: 0)\nfor el in house:\n if el.lower() == el:\n keys[ord(el)] += 1\n else:\n if keys[ord(el.lower())] > 0:\n keys[ord(el.lower())] -= 1\n else:\n counter += 1\n\nprint(counter)\n", "import math\r\nfrom collections import defaultdict\r\nn=int(input())\r\nx=input()\r\nkeys=defaultdict(lambda:0)\r\nans=0\r\nfor i in x:\r\n if i.islower():\r\n keys[i]+=1\r\n else:\r\n if keys[i.lower()]==0:\r\n ans+=1 \r\n else:\r\n keys[i.lower()]-=1\r\nprint(ans)\r\n\r\n", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nc = Counter()\r\nm = 0\r\nfor x, y in zip(s[::2], s[1::2]):\r\n c[x] += 1\r\n y = y.lower()\r\n if c[y] > 0:\r\n c[y] -= 1\r\n else:\r\n m += 1\r\nprint(m)", "from collections import Counter\r\n\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nkeys = Counter()\r\nto_buy = 0\r\nfor i in range(n-1):\r\n keys[s[2 * i]] += 1\r\n door = s[2 * i + 1].lower()\r\n if keys[door] > 0:\r\n keys[door] -= 1\r\n else:\r\n to_buy += 1\r\nprint(to_buy)", "n = int(input())\r\nstring = input().lower()\r\n\r\nstr_keys = ''\r\ncounter=0\r\n\r\nfor i,char in enumerate(string):\r\n if(i%2==0):\r\n str_keys+=char\r\n else:\r\n if(char in str_keys):\r\n str_keys = str_keys.replace(char,'',1)\r\n else:\r\n counter+=1\r\nprint(counter)", "n = int(input())\r\ns = input()\r\n\r\nd = {}\r\nres = 0\r\nfor x in s:\r\n if x.islower():\r\n d[x] = d.get(x, 0) + 1\r\n else:\r\n if d.get(x.lower(), 0) > 0:\r\n d[x.lower()] -= 1\r\n else:\r\n res += 1\r\n\r\nprint(res)", "n = int(input())\r\nstring = input()\r\nlet = \"abcdefghijklmnopqrstuvwxyz\"\r\nkeys = [0 for _ in range(len(let))]\r\nres = 0\r\nfor i in string:\r\n indice = let.index(i.lower())\r\n if i == i.lower():\r\n keys[indice] += 1\r\n else:\r\n if not keys[indice]:\r\n res += 1\r\n else:\r\n keys[indice] -= 1\r\nprint(res)\r\n", "n = int(input())\r\ns = input().upper()\r\na = [0] * 26\r\nu = 0\r\nfor i in range(len(s)):\r\n if i % 2 == 0:\r\n a[ord(s[i]) - ord('A')] += 1\r\n else:\r\n if a[ord(s[i]) - ord('A')] > 0:\r\n a[ord(s[i]) - ord('A')] -= 1\r\n else:\r\n u += 1\r\nprint(u)\r\n\r\n", "n = int(input())\r\n\r\nstrr = input()\r\nd = {}\r\nans = 0\r\nfor i in range(len(strr)):\r\n if i % 2 != 0:\r\n if d.get(strr[i]):\r\n if d[strr[i]] > 0:\r\n d[strr[i]] -= 1\r\n else:\r\n ans += 1\r\n else:\r\n ans += 1\r\n else:\r\n if d.get(strr[i].upper()):\r\n d[strr[i].upper()] += 1\r\n else:\r\n d[strr[i].upper()] = 1\r\nprint(ans)\r\n", "input()\r\ns = input().lower()\r\nkeys = {}\r\nneededKeyNum = 0\r\nfor i in range(0, len(s), 2):\r\n if s[i] not in keys:\r\n keys[s[i]] = 1\r\n else:\r\n keys[s[i]] += 1\r\n\r\n if s[i+1] in keys and keys[s[i+1]] > 0:\r\n keys[s[i+1]] -= 1\r\n else:\r\n neededKeyNum += 1\r\nprint(neededKeyNum)\r\n", "d={}\r\nx=input()\r\nx=input()\r\no=0\r\nfor i,c in enumerate(x):\r\n # print('{} {} {}'.format(i,c,d.get(c.upper(),0)))\r\n if(i%2):\r\n r=d.get(c,0)\r\n if not r:\r\n o+=1\r\n else:\r\n d[c]=r-1\r\n else:\r\n r=d.get(c.upper(),0)\r\n d[c.upper()]=r+1\r\nprint(o)\r\n", "rooms = int(input())\npath = list(input())\n\nkeys = [0 for _ in range(26)]\nbuy = 0\n\nfor i in range(2 * rooms - 2):\n if (path[i].islower()):\n keys[ord(path[i]) - ord('a')] += 1\n else:\n if keys[ord(path[i]) - ord('A')] > 0:\n keys[ord(path[i]) - ord('A')] -= 1\n else:\n buy += 1\n\nprint(buy)\n \t\t\t \t\t\t \t \t\t\t\t\t\t\t \t", "n=int(input())\na=input()\nc={}\nans=0\nfor i in range(n-1):\n if a[2*i] in c:\n c[a[2*i]]+=1\n else:\n c[a[2*i]]=1\n if c.get(a[2*i+1].lower(),0)>0:\n c[(a[2*i+1].lower())]-=1\n else:\n ans+=1\nprint(ans)", "n = int(input())\r\ns = input()\r\nans = 0\r\nkeys = {k :0 for k in 'abcdefghijklmnopqrstuvwxyz' }\r\n\r\nfor k in s :\r\n if k.islower():\r\n keys[k] +=1\r\n else:\r\n k = k.lower()\r\n if keys[k]:\r\n keys[k] -=1\r\n else:\r\n ans +=1\r\n\r\n\r\nprint(ans)", "import string\r\nalp=[]\r\nfor i in string.ascii_lowercase:\r\n alp.append(i)\r\n alp.append(0)\r\nn=int(input())\r\ncount=n-1\r\nkeys={}\r\nf=0\r\ns=input().lower()\r\nfor i in range(0,2*n-3,2):\r\n if s[i]==s[i+1]:\r\n count-=1\r\n continue\r\n if s[i]!=s[i+1]:\r\n alp[alp.index(s[i])+1]+=1\r\n if s[i]!=s[i+1] and alp[alp.index(s[i+1])+1]>0:\r\n count-=1\r\n alp[alp.index(s[i+1])+1]-=1\r\nprint(count)\r\n", "trash = int(input());\r\nhouse = str(input());\r\n\r\nkeys = {};\r\nscore = 0;\r\n\r\nfor i in range(0, len(house)):\r\n if(i%2==0):\r\n if(house[i] in keys):\r\n keys[house[i]]+=1;\r\n else:\r\n keys[house[i]]=1;\r\n else:\r\n if(house[i].lower() in keys and keys[house[i].lower()]>0):\r\n keys[house[i].lower()]-=1;\r\n else:\r\n #print(i, len(house));\r\n score+=1;\r\nprint(score);", "import string\r\n\r\nn = int(input())\r\ns = input().lower()\r\nkey = [0]*26\r\ncount = 0\r\ni=0\r\nwhile i<len(s):\r\n\tkey[string.ascii_lowercase.index(s[i])] +=1\r\n\tif key[string.ascii_lowercase.index(s[i+1])]>0:\r\n\t\tkey[string.ascii_lowercase.index(s[i+1])] -=1\r\n\telse:\r\n\t\tcount +=1\r\n\ti+=2\r\nprint(count)", "n=int(input())\r\ns=input()\r\nk=[]\r\nd=[]\r\nfor i in range(0,(2*n-2),2):\r\n #print(i,end=\" \")\r\n k+=[s[i]]\r\nfor i in range(1,(2*n-2),2):\r\n d+=[s[i].lower()]\r\naval={}\r\nfor i in range(97,123):\r\n aval[chr(i)]=0\r\n#print(k,d)\r\nc=0\r\nfor i in range(len(d)):\r\n aval[k[i]]+=1\r\n if(aval[d[i]]==0):\r\n #print(d[i])\r\n c+=1\r\n else:\r\n aval[d[i]]-=1\r\nprint(c)", "counts = [0] * 40\r\nn = int(input())\r\ns = input()\r\ni = 0\r\nneed = 0\r\nwhile(i < 2*n-2):\r\n counts[ord(s[i])-97]+=1\r\n if(counts[ord(s[i+1].lower())-97]>0):\r\n counts[ord(s[i+1].lower())-97] -= 1\r\n else:\r\n need += 1\r\n \r\n i+=2\r\nprint(need)", "n = int(input())-1 # сколько нужно будет ключей\nk = [0]*26\na = input()\nfor i in a:\n o = ord(i)\n if o >= 97:\n k[o-97] += 1\n else:\n t = min(k[o-65], 1)\n k[o-65] -= t\n n -= t\nprint(n)", "n = int(input())\r\nx = input()\r\nc = 0\r\ns='abcdefghijklmnopqrstuvwxyz'\r\nm=[0]*26\r\n\r\nfor i in range(1,len(x),2):\r\n m[s.index(x[i-1])]+=1\r\n if m[s.index(x[i].lower())]==0:\r\n c+=1\r\n else:\r\n m[s.index(x[i].lower())]-=1\r\n \r\n \r\n \r\n \r\n\r\n\r\nprint(c)\r\n", "n = int(input())\r\ns = input()\r\nv = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]\r\nans = 0\r\nfor i in range(2*n-2):\r\n\tif i%2==0:\r\n\t\tv[ord(s[i])-97] += 1\r\n\telse:\r\n\t\tif v[ord(s[i].lower())-97] > 0:\r\n\t\t\tv[ord(s[i].lower())-97] -= 1\r\n\t\telse:\r\n\t\t\tans += 1\r\nprint(ans)", "from collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n input()\r\n s = input()\r\n d = defaultdict(int)\r\n ans = 0\r\n for c in s:\r\n if c.isupper():\r\n if d[c]:\r\n d[c] -= 1\r\n else:\r\n ans += 1\r\n else:\r\n d[c.upper()] += 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n=int(input())\r\ns=input()\r\nl=[0]*26\r\nc=0\r\nfor i in s:\r\n if i.islower():\r\n l[ord(i)-97]+=1\r\n else:\r\n i=i.lower()\r\n if l[ord(i)-97]>0:\r\n l[ord(i)-97]-=1\r\n continue\r\n else:\r\n c+=1\r\nprint(c)\r\n ", "n = int(input())\r\ns = input()\r\nn = 2*n - 2\r\ncount = 0\r\nd = dict()\r\nfor i in range(n):\r\n if i%2 == 0:\r\n if d.get(s[i]) is None:\r\n d[s[i]] = 1\r\n else:\r\n d[s[i]] += 1\r\n else:\r\n if d.get(s[i].lower()) is None or d.get(s[i].lower()) == 0:\r\n count += 1\r\n else:\r\n d[s[i].lower()] -= 1\r\nprint(count)", "def vitality_and_pie():\n n=int(input())\n linha = input()\n chave = {}\n vez_da_chave=1\n n_compras = 0\n for e in linha:\n if(vez_da_chave):\n try:\n chave[e]+=1\n except:\n chave[e]=1\n vez_da_chave=0\n else:\n try:\n if(chave[e.lower()]==0):\n n_compras+=1\n else:\n chave[e.lower()]-=1 \n except:\n n_compras+=1\n vez_da_chave=1\n print(n_compras)\n\nvitality_and_pie()\n\t \t \t\t \t \t \t\t\t \t \t\t\t \t \t \t", "n=int(input())\r\ns=input()\r\nhm={}\r\nc=0\r\nfor i in range(len(s)):\r\n if i%2==0:\r\n if s[i] not in hm:\r\n hm[s[i]]=1\r\n else:\r\n hm[s[i]]+=1\r\n else:\r\n var=chr(ord(s[i])+32)\r\n if var not in hm:\r\n c+=1\r\n else:\r\n hm[var]-=1\r\n if hm[var]<=0:\r\n del hm[var]\r\nprint(c)", "n = int(input())\r\ns = input()\r\nkeys = {}\r\nisKey = True\r\nresult = 0\r\n\r\nfor c in s:\r\n if (isKey):\r\n char = c.upper()\r\n \r\n if (char in keys):\r\n keys[char] += 1\r\n else:\r\n keys[char] = 1\r\n \r\n else:\r\n if (c in keys):\r\n keys[c] -= 1\r\n\r\n if (keys[c] == 0):\r\n del keys[c]\r\n else:\r\n result += 1\r\n \r\n isKey = not isKey\r\n\r\nprint(result)", "input()\r\ns = input()\r\nkeys_p = {x : 0 for x in \"abcdefghijklmnopqrstuvwxyz\"}\r\nkeys_n = {x : 0 for x in \"abcdefghijklmnopqrstuvwxyz\"}\r\n\r\nfor i in range(0, len(s), 2):\r\n keys_p[s[i]] += 1\r\n k = s[i+1].lower()\r\n if keys_p[k] > 0:\r\n keys_p[k] -= 1\r\n else:\r\n keys_n[k] += 1\r\n \r\nprint(sum([v for k,v in keys_n.items()]))", "import math\r\nimport sys\r\n\r\nn=int(input())\r\ns=input()\r\nd=dict()\r\nalfa=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in alfa:\r\n d[i]=0\r\nans=0\r\nfor i in s:\r\n if i==i.lower():\r\n d[i]+=1\r\n else:\r\n if d[i.lower()]==0:\r\n ans+=1\r\n else:\r\n d[i.lower()]-=1\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\nans= 0\r\ncnt = {}\r\nfor i in range(len(s)):\r\n if i % 2 == 0:\r\n if chr(ord(s[i]) + (ord(\"A\") - ord(\"a\"))) in cnt:\r\n cnt[chr(ord(s[i]) + (ord(\"A\") - ord(\"a\")))] += 1\r\n else:\r\n cnt[chr(ord(s[i]) + (ord(\"A\") - ord(\"a\")))] = 1\r\n else:\r\n if s[i] in cnt and cnt[s[i]] != 0:\r\n cnt[s[i]] -= 1\r\n else:\r\n ans += 1\r\nprint(ans)", "\r\nn=int(input())\r\n\r\nstr=input()\r\nstr2=str\r\nk=0\r\nl= [0]*26\r\n#print(l)\r\nfor i in range(0,len(str)):\r\n if i%2==1:\r\n if l[ord(str[i])-ord('A')]==0:\r\n k+=1\r\n else: l[ord(str[i])-ord('A')]-=1\r\n else:\r\n l[ord(str[i])-ord('a')]+=1\r\nprint(k)", "llaves = [0]*26\n\ndef save_key(key):\n global llaves\n llaves[ord(key)-97] += 1\n\ndef open_room(lock):\n global llaves\n i = ord(lock)-65\n if llaves[i] > 0:\n llaves[i] -= 1\n return True\n return False\n\n_, hotel = input(), input()\nbuy = 0\n\nfor i in range(0,len(hotel),2):\n i, j = i, i+1\n save_key(hotel[i])\n if not open_room(hotel[j]):\n buy += 1\n\nprint(buy)", "n = int(input())\r\ns = input()\r\nkeys = {}\r\ncount = 0\r\nfor i in range(0, len(s)):\r\n if i%2==0:\r\n if keys.get(s[i]):\r\n keys[s[i]] += 1\r\n else:\r\n keys[s[i]] = 1\r\n else:\r\n if keys.get(s[i].lower()):\r\n if keys[s[i].lower()] == 0:\r\n count += 1\r\n else:\r\n keys[s[i].lower()] -= 1\r\n else:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\ns = input()\ncnt = 0\nkeys = []\nfor i in range(ord('z') + 1) :\n keys += [0]\nfor i in range(len(s)//2):\n\tkeys[ord(s[i*2])] += 1\n\tif keys[ord(s[i*2+1].lower())] == 0:\n\t\tcnt += 1\n\telse:\n\t\tkeys[ord(s[i*2+1].lower())] -= 1\nprint(cnt)", "from collections import defaultdict\r\n\r\nd = defaultdict(int)\r\n\r\nif __name__ == '__main__':\r\n input()\r\n\r\n sum_v = 0\r\n\r\n for i, x in enumerate(input()):\r\n if i % 2 == 0:\r\n d[x] += 1\r\n else:\r\n if d[x.lower()] == 0:\r\n sum_v += 1\r\n else:\r\n d[x.lower()] -= 1\r\n\r\n print(sum_v)", "n = int(input())\r\nb = input()\r\na = set()\r\nd = dict()\r\ncount = 0\r\nfor i in range(2 * n - 2):\r\n if i % 2 == 0:\r\n if b[i] not in a:\r\n a.add(b[i])\r\n d[b[i]] = 1\r\n else:\r\n d[b[i]] += 1\r\n else:\r\n if b[i].lower() in a:\r\n d[b[i].lower()] -= 1\r\n if d[b[i].lower()] == 0:\r\n a.remove(b[i].lower())\r\n else:\r\n count += 1 \r\nprint(count)", "n, s = int(input()), input()\r\na = [0] * 26\r\nans = 0\r\nfor i in range(len(s)):\r\n if i & 1:\r\n if a[ord(s[i]) - ord('A')] == 0:\r\n a[ord(s[i]) - ord('A')] += 1\r\n ans += 1\r\n a[ord(s[i]) - ord('A')] -= 1\r\n else:\r\n a[ord(s[i]) - ord('a')] += 1\r\nprint(ans)", "# -*- coding: utf-8 -*-\n\nn_rooms = int(input())\ninput_str = input()\n\nkeys = {}\nans = 0\n\nfor i, c in enumerate(input_str):\n if i % 2:\n c = c.lower()\n if keys.get(c, None) is None or keys[c] == 0:\n ans += 1\n else:\n keys[c] -= 1\n else:\n if keys.get(c, None) is not None:\n keys[c] += 1\n else:\n keys[c] = 1\n\nprint(ans)\n\n\t \t \t\t \t\t\t \t\t \t\t \t \t \t\t", "n = int(input())\r\ns = list(input())\r\nhas=[0]*(200)\r\nans=0\r\nfor i in range(2*n-2):\r\n if s[i]>='A' and s[i]<='Z':\r\n if has[ord(s[i])+32]:\r\n has[ord(s[i])+32]-=1\r\n else:\r\n ans+=1 \r\n else:\r\n has[ord(s[i])]+=1\r\n# print(has) \r\nprint(ans) \r\n\r\n\r\n", "n = int(input())\ns = input()\nkcount = 0\nalpha = [0]*26\n\nif ord(s[1]) - 65 != ord(s[0]) - 97:\n kcount += 1\n alpha[ord(s[0])-97] += 1\n\nfor i in range(2,len(s), 2):\n lcase = ord(s[i])-97\n ucase = ord(s[i+1])-65\n alpha[lcase] += 1\n if lcase != ucase:\n kcount += alpha[ucase] == 0\n alpha[ucase] -= alpha[ucase] != 0\n else:\n alpha[lcase] -= 1\n\nprint(kcount)\n \t \t \t\t\t \t \t\t\t \t\t\t\t \t\t \t", "n = input()\r\ns = input()\r\ncount = 1\r\nkey = 0\r\nhas = [0 for i in range(0, 27)]\r\nfor i in s:\r\n if count % 2 == 1:\r\n has[ord(i) - ord('a')] += 1\r\n else:\r\n if has[ord(i) - ord('A')] > 0:\r\n has[ord(i) - ord('A')] -= 1\r\n else:\r\n key += 1\r\n count += 1\r\nprint(key)", "ans=0\r\nd = [0]*128\r\nn = int(input())-1\r\ns = list(input())\r\n\r\nfor i in range(n):\r\n d[ord(s[i*2])]+=1\r\n d[ord(s[i*2+1])+32]-=1\r\n if d[ord(s[i*2+1])+32] < 0:\r\n ans+=1\r\n d[ord(s[i*2+1])+32] = 0\r\nprint(ans)", "n = int(input())\nx = input()\nc = 0\nkeys = {}\n\nfor i in x:\n\tif i == i.lower() and i not in keys:\n\t\tkeys[i] = 1\n\telif i == i.lower() and i in keys:\n\t\tkeys[i] += 1\n\telif i == i.upper() and i.lower() in keys and keys[i.lower()] > 0:\n\t\tkeys[i.lower()] -= 1\n\telse:\n\t\tc += 1\n\nprint(c)\n", "if __name__ == \"__main__\":\n keys = {}\n input()\n rooms = input()\n keysNeeded = 0\n for i,letter in enumerate(rooms):\n if i % 2 == 0:\n keys[letter] = keys.get(letter, 0) + 1\n else:\n if keys.get(letter.lower(), 0) > 0:\n keys[letter.lower()] = keys[letter.lower()] - 1\n else:\n keysNeeded += 1\n print(keysNeeded)\n\t \t\t\t\t\t \t \t\t \t\t\t\t \t \t\t", "from collections import Counter\r\nkeys=Counter()\r\nn=int(input())\r\ns=input()\r\nans=0\r\nfor i, x in enumerate(s):\r\n if x.isupper()==True:\r\n if keys[x] == 0:\r\n ans+=1\r\n else:\r\n keys[x]-=1\r\n else:\r\n keys[x.upper()]+=1\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\nal = [0] * 26\r\nans = 0\r\nfor i in range(0,len(s),2):\r\n if s[i] != s[i+1]: \r\n j = ord(s[i+1].lower()) - ord('a')\r\n al[ord(s[i]) - ord('a')] += 1\r\n if al[j] > 0:\r\n al[j]-=1\r\n else:\r\n ans +=1\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nk = {}\r\nans = 0\r\nfor i in range(len(s)):\r\n if i % 2 == 0:\r\n if s[i] not in k:\r\n k[s[i]] = 1\r\n else:\r\n k[s[i]] += 1\r\n else:\r\n if s[i].lower() not in k or (s[i].lower() in k and k[s[i].lower()] <= 0):\r\n ans += 1\r\n else:\r\n k[s[i].lower()] -= 1\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\n\r\nd = {}\r\nkol = 0\r\nfor i in range(0, n * 2 - 2):\r\n if i % 2 == 0:\r\n if d.get(s[i]):\r\n d[s[i]] = d.get(s[i]) + 1\r\n else:\r\n d[s[i]] = 1\r\n else:\r\n val = d.get(s[i].lower())\r\n if val:\r\n d[s[i].lower()] -= 1\r\n else:\r\n kol += 1\r\nprint(kol)", "n = int(input())\r\ns = input()\r\nkeys = {}\r\nresult = 0\r\nfor i in range(0, (n - 1) * 2, 2):\r\n keys[s[i]] = keys.get(s[i], 0) + 1\r\n if keys.get(s[i + 1].lower(), 0) > 0:\r\n keys[s[i + 1].lower()] -= 1\r\n else:\r\n result += 1\r\nprint(result)", "n=int(input())\r\nstring=input()\r\nmydict=dict()\r\nl=2*n-2;total=0\r\nfor i in range(l):\r\n if i%2==0:\r\n mydict[string[i]]=mydict.get(string[i],0)+1\r\n else:\r\n x=chr(ord(string[i])+32)\r\n if x not in mydict:\r\n total+=1\r\n else:\r\n if mydict[x]>1:\r\n mydict[x]-=1\r\n elif mydict[x]==1:\r\n del mydict[x]\r\nprint(total)\r\n", "from collections import Counter\r\n\r\n\r\ninput()\r\nc = Counter()\r\nans = 0\r\nfor i in input():\r\n if i.islower():\r\n c.update(i)\r\n else:\r\n i = i.lower()\r\n if not c[i]:\r\n ans += 1\r\n else:\r\n c[i] -= 1\r\nprint(ans)\r\n", "n = int(input())\r\ns = list(input().lower());\r\n\r\nsz = len(s)\r\ncnt = [0]*255;\r\nans = 0\r\nfor i in range(0, sz, 2):\r\n cnt[ord(s[i])] += 1\r\n if(cnt[ord(s[i+1])] > 0):\r\n cnt[ord(s[i+1])] -= 1\r\n else:\r\n ans += 1\r\n\r\nprint (ans)\r\n", "# aXbYcAdB\r\n\r\nn=int(input())\r\ns=input()\r\ncount = {}\r\nkey = 0\r\nfor i in s:\r\n if i.islower():\r\n if i in count :\r\n count[i] += 1\r\n else :\r\n count[i] = 1\r\n else:\r\n if i.lower() in count and count[i.lower()] > 0:\r\n count[i.lower()] -= 1\r\n else:\r\n key += 1\r\n\r\nprint(key)\r\n", "#!/usr/bin/env python\n\n\nn = int(input())\ns = input()\n\ncnt = 0\ni = 0\nkey = [0] * 256\n\nwhile i < len(s):\n key[ord(s[i])] += 1\n if key[ord(s[i+1].lower())] == 0:\n cnt += 1\n else:\n key[ord(s[i+1].lower())] -= 1\n\n i += 2\n\nprint(cnt)\n\n\n\n", "n = int(input())\ns = input()\nd = {}\n# n = 5\n# s = \"xYyXzZaZ\"\ncount = 0\nfor i in range(0, 2*n-2, 2):\n # print(\"i: \", i)\n key = s[i]\n door = s[i+1]\n if key!=door.lower():\n if d.get(door.lower(), 0):\n d[door.lower()] -=1\n else:\n count+=1\n if d.get(key, 0):\n d[key] +=1\n else:\n d[key] = 1\n \nprint(count)\n\n \n", "m=int(input());a=str.lower(input());c=0;d={}\r\nfor i in range(1,len(a),2):\r\n\tif a[i-1] in d:d[a[i-1]]+=1\r\n\telse:d[a[i-1]]=1\r\n\tif a[i] in d:\r\n\t\tif d[a[i]]>0:d[a[i]]-=1\r\n\t\telse :c+=1\r\n\telse :c+=1\r\nprint(c)", "n=int(input())\r\ns=input()\r\nl=[0]*26\r\nc=0\r\nfor i in s:\r\n if i.islower():\r\n l[ord(i)-ord('a')]+=1\r\n else:\r\n if l[ord(i)-ord('A')]==0:\r\n c+=1\r\n else:\r\n l[ord(i)-ord('A')]-=1\r\nprint(c)", "room = int(input())\r\ndesc = input()\r\n\r\nkeys = desc[0::2]\r\nway = desc[1::2].lower()\r\n\r\nkeys_on_hands = ''\r\nkeys_to_buy = 0\r\n\r\nfor i in range(len(way)):\r\n keys_on_hands += keys[i]\r\n pos = keys_on_hands.find(way[i])\r\n if pos == -1:\r\n keys_to_buy += 1\r\n else:\r\n keys_on_hands = keys_on_hands[:pos] + keys_on_hands[pos+1:]\r\n\r\nprint(keys_to_buy) ", "n=int(input())\r\ns=input()\r\ncol={}\r\nans=0\r\nfor i in range(1,n):\r\n key=s[2*i-2]\r\n if key in col:\r\n col[key]+=1\r\n else:\r\n col[key]=1\r\n room=s[2*i-1]\r\n if room.lower() in col:\r\n if(col[room.lower()]==0):\r\n ans+=1\r\n else:\r\n col[room.lower()]-=1\r\n else:\r\n ans+=1\r\nprint(ans)\r\n ", "from collections import defaultdict\nimport sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\n\ndef main():\n\thashdict = defaultdict(int)\n\tn = inp()\n\tkey_rooms = insr()\n\tans = 0\n\t# print(n)\n\t# print(key_rooms)\n\tfor counter, ch in enumerate(key_rooms):\n\t\tif counter % 2 == 1:\n\t\t\tkey = ch.lower()\n\t\t\tif hashdict[key] > 0:\n\t\t\t\thashdict[key] -= 1\n\t\t\telse:\n\t\t\t\tans += 1\n\t\telse:\t\n\t\t\thashdict[ch] += 1\n\t# print(\"ans is \" + str(ans))\n\treturn ans\n\n\nif __name__ == '__main__':\n print(main())\n", "n=int(input())-1\r\ns=input()\r\nmx={}\r\nc={}\r\nfor i in range(n):\r\n if not s[2*i] in c:\r\n c[s[2*i]]=0\r\n mx[s[2*i]]=0\r\n c[s[2*i]]-=1\r\n if not s[2*i+1].lower() in c:\r\n c[s[2*i+1].lower()]=0\r\n mx[s[2*i+1].lower()]=0\r\n c[s[2*i+1].lower()]+=1\r\n mx[s[2*i+1].lower()]=max(mx[s[2*i+1].lower()], c[s[2*i+1].lower()])\r\nans=0\r\nfor k in mx:\r\n ans+=mx[k]\r\nprint(ans)", "from collections import defaultdict\r\n\r\nt=1\r\n\r\nfor _ in range(t):\r\n n=input()\r\n s=input()\r\n keys=defaultdict(int)\r\n ans=0\r\n for i in s:\r\n if i.islower():\r\n keys[i]+=1\r\n else:\r\n if keys[i.lower()]>0:\r\n keys[i.lower()]-=1\r\n else:\r\n ans+=1\r\n print(ans)\r\n", "length = int(input())\r\nsequence = list(input())\r\n\r\nkeys = {chr(x): 0 for x in range(97, 123)}\r\nkeys_to_buy = 0\r\n\r\nfor i in range(0, 2 * length - 2, 2):\r\n key = sequence[i]\r\n door = sequence[i + 1].lower()\r\n keys[key] += 1\r\n\r\n if keys.get(door) > 0:\r\n keys[door] -= 1\r\n else:\r\n keys_to_buy += 1\r\n\r\nprint(keys_to_buy)\r\n", "from collections import defaultdict\r\n\r\ninput()\r\ns, keys, n = input().lower(), defaultdict(int), 0\r\n\r\nfor i, door in zip(s[::2], s[1::2]):\r\n keys[i] += 1\r\n if keys[door]:\r\n keys[door] -= 1\r\n else:\r\n n += 1\r\n\r\nprint(n)", "n = int(input())\r\ns = input()\r\nd={}\r\nreqd = 0\r\nfor i in range(len(s)):\r\n if i % 2 == 0:\r\n if s[i] not in d:\r\n d[s[i]] = 1\r\n else:\r\n d[s[i]] += 1 \r\n else:\r\n if s[i].lower() in d:\r\n if d[s[i].lower()] > 0:\r\n d[s[i].lower()] -= 1 \r\n else:\r\n reqd += 1\r\n else:\r\n reqd += 1\r\nprint(reqd)\r\n\r\n ", "from collections import Counter\nn = int(input())\ns = input()\nk = s[::2]\nd = s[1::2].lower()\ncnt = Counter()\nans = 0\nfor i in range(n - 1):\n\tcnt[k[i]] += 1\n\tif cnt.get(d[i], 0):\n\t\tcnt[d[i]] -= 1\n\telse:\n\t\tans += 1\nprint(ans)\n", "n=int(input())\r\ng=input()\r\ncount=0\r\nd={}\r\nfor i in range(26):\r\n d[chr(97+i)]=0\r\nfor i in range(n-1):\r\n d[g[2*i]]+=1\r\n if d[chr(ord(g[2*i+1])+32)]==0:\r\n count+=1\r\n else:\r\n d[chr(ord(g[2*i+1])+32)]-=1\r\nprint(count)\r\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Vitaliy and Pie\"\r\n# Class: A\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n = int(input())\r\n dict_ = dict()\r\n a = input().strip()\r\n ans=0\r\n for i in a:\r\n if i == i.lower():\r\n if i.upper() not in dict_.keys():\r\n dict_[i.upper()] = 0\r\n dict_[i.upper()]+=1\r\n else:\r\n if i not in dict_.keys() or dict_[i] == 0:\r\n ans+=1\r\n else:\r\n dict_[i]-=1\r\n \r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n=int(input())\r\ns=input()\r\nd={}\r\nm=len(s)\r\nc=0\r\nfor x in range(m):\r\n if(x%2==0):\r\n if s[x] not in d:\r\n d[s[x]]=1 \r\n else:\r\n d[s[x]]+=1\r\n else:\r\n val=ord(s[x])^32\r\n val=chr(val)\r\n if val not in d:\r\n c=c+1 \r\n else:\r\n if(d[val]==0):\r\n c=c+1 \r\n else:\r\n d[val]-=1 \r\nprint(c)\r\n\r\n", "def main():\n input()\n s, l, res = input(), [0] * 26, 0\n for key, lock in zip(s[::2], s[1::2]):\n l[ord(key) - 97] += 1\n x = ord(lock) - 65\n if l[x] > 0:\n l[x] -= 1\n else:\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\nKD = input()\n\ncurrent_keys = {chr(ord('a') + key): 0 for key in range(26)}\nkeysToBuy = 0\n\nfor i in range(n-1):\n door = KD[i * 2 + 1]\n key = KD[i * 2]\n current_keys[key] += 1\n req_key = door.lower()\n\n if current_keys[req_key] > 0:\n current_keys[req_key] -= 1\n else:\n keysToBuy += 1\n\nprint(keysToBuy)\n\n\t\t \t\t \t\t \t\t\t\t \t \t \t \t\t\t\t\t \t \t", "n = int(input())\ns = str(input())\n\ncont = 0\ndic = {}\n\nfor i in range(0, ((n*2)-2), 1):\n if i%2 == 0:\n if s[i] in dic:\n dic[(s[i])] += 1\n else: \n dic[(s[i])] = 1\n else:\n q = s[i].lower()\n if q in dic:\n if dic[q] >= 1:\n dic[q] -= 1\n else:\n cont += 1\n else:\n cont +=1\n\nprint(cont)\n \t \t \t \t \t \t \t\t\t\t \t \t", "from collections import defaultdict,Counter\nfrom itertools import combinations\nimport math\nimport sys\ninput = sys.stdin.readline\n\n# for _ in range(int(input())):\nkeys = Counter()\nn = int(input())\ns = input()\nans = 0\nfor i, x in enumerate(s):\n if i&1:\n if keys[x] == 0:\n ans+=1\n else:\n keys[x]-=1\n else:\n keys[x.upper()]+=1\nprint(ans)\n \n\n\n\n\n\n\n\n\n\n\n", "n = int(input())\r\n\r\nkeys = {}\r\n\r\nfor i in range(65, 91):\r\n keys[chr(i+32)] = 0\r\n\r\ns = input()\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n if i & 1:\r\n index = chr(ord(s[i]) + 32)\r\n if keys[index]:\r\n keys[index] -= 1\r\n else:\r\n ans += 1\r\n else:\r\n keys[s[i]] += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\n\r\nmy_dict = {}\r\ncnt = 0\r\npos = 0\r\n\r\nfor c in s:\r\n if pos % 2 == 0:\r\n key = c\r\n if not key in my_dict:\r\n my_dict[key] = 1\r\n else:\r\n my_dict[key] += 1\r\n else:\r\n door = c.lower()\r\n if door not in my_dict or my_dict[door] == 0:\r\n cnt += 1\r\n else:\r\n my_dict[door] -= 1 \r\n pos += 1\r\n \r\nprint(cnt)", "def openDoor(door, pocket, budget):\n required = door.lower()\n if pocket.get(required, 0) > 0:\n pocket[required] -= 1\n return pocket, budget\n budget += 1\n return pocket, budget\n\ndef putKey(key, pocket, budget):\n pocket[key] = pocket.get(key, 0) + 1\n return pocket, budget\n\nsize = int(input())\nmapi = input().strip()\n\npocket = {}\nbudget = 0\n\nfor obj in mapi:\n if obj.islower():\n pocket, budget = putKey(obj, pocket, budget)\n else:\n pocket, budget = openDoor(obj, pocket, budget)\n\nprint(budget)\n\n \t \t \t\t\t\t\t \t \t\t \t \t \t \t\t\t \t", "n = int(input())\r\ns = input()\r\ndic = {}\r\nans = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n if s[i] in dic:\r\n dic[s[i]] += 1\r\n else:\r\n dic[s[i]] = 1\r\n elif not s[i].islower():\r\n x = s[i].lower()\r\n if x not in dic or dic[x] <= 0:\r\n ans += 1\r\n else:\r\n dic[x] -= 1\r\nprint(ans)", "from collections import defaultdict\nfrom telnetlib import KERMIT\n\n\ndef GetInput():\n n = int(input())\n kd_inp = input().strip()\n keys = [kd_inp[i] for i in range(0, 2 * (n - 1), 2)]\n doors = [kd_inp[i] for i in range(1, 2 * (n - 1), 2)]\n return n, keys, doors\n\ndef Sol(n, keys, doors):\n bag = defaultdict(int)\n num_purchases = 0\n for door_ind in range(n - 1):\n bag[keys[door_ind]] += 1\n if bag[doors[door_ind].lower()] > 0:\n bag[doors[door_ind].lower()] -= 1\n else:\n num_purchases += 1\n\n return num_purchases\n\n\n\nn, keys, doors = GetInput()\nnum_purchases = Sol(n, keys, doors)\nprint(num_purchases)", "n = 2 * (int(input()) - 1)\ns = input()\ncount = 0\ni = 0\nk = dict()\nwhile i < n:\n x = s[i].lower()\n if i % 2 == 1:\n if x in k:\n if k[x] > 0:\n k[x] -= 1\n else:\n count += 1\n else:\n count += 1\n else:\n if x in k:\n k[x] += 1\n else:\n k[x] = 1\n i += 1\nprint(count)\n", "n = int(input())\ns = input()\n\nsum = 0\nk = {}\n\nfor i in s:\n if i.isupper():\n l = i.lower()\n if l in k and k[l] > 0:\n k[l] -= 1\n else:\n sum += 1\n else:\n k[i] = k.get(i, 0) + 1\n\nprint(sum)\n \t \t \t \t\t \t \t \t\t \t", "n=int(input())\r\nans=0\r\ns=input().lower()\r\ncollected={chr(i):0 for i in range(97,97+26)}\r\nfor i in range(0,len(s),2):\r\n if s[i]==s[i+1]:\r\n pass\r\n else:\r\n collected[s[i]]=collected[s[i]]+1\r\n if collected[s[i+1]]>0:\r\n collected[s[i+1]]=collected[s[i+1]]-1\r\n else:\r\n ans+=1\r\nprint(ans)", "n = int(input())\ns = input()\n\nkeys, count = {}, 0\nfor x in s:\n\tif x.islower():\n\t\tkeys[x] = keys[x]+1 if x in keys else 1\n\telse:\n\t\tif x.lower() in keys and keys[x.lower()] > 0:\n\t\t\tkeys[x.lower()] -= 1\n\t\telse:\n\t\t\tcount += 1\nprint(count)\n\t\t\t\t\t\t \t\t\t \t\t \t\t \t \t\t\t \t", "n=int(input())\r\ns=input()\r\nd={}\r\nc=0\r\nfor i in range(2*n-2):\r\n if s[i].islower():\r\n if s[i] not in d:\r\n d[s[i]]=1\r\n else:\r\n d[s[i]]+=1\r\n else:\r\n if not( (s[i].lower() in d) and (d[s[i].lower()]>0)):\r\n c+=1\r\n else:\r\n d[s[i].lower()]-=1\r\nprint(c)", "from collections import defaultdict \r\n\r\nn = int(input())\r\ns = input()\r\n\r\nd = defaultdict(int)\r\ncnt = 0\r\nfor i in range(2*(n-1)):\r\n\tif i%2 == 0:\r\n\t\td[s[i].upper()]+=1\r\n\telse :\r\n\t\tif d[s[i]] == 0:\r\n\t\t\tcnt+=1\r\n\t\telse :\r\n\t\t\td[s[i]]-=1\r\nprint(cnt)", "n = int(input())\r\ns = input().lower()\r\nres = 0\r\nd = {}\r\nfor i in range(len(s)):\r\n if i % 2 == 0:\r\n d[s[i]] = d.get(s[i], 0) + 1\r\n else:\r\n if d.get(s[i], 0) > 0:\r\n d[s[i]] -= 1\r\n else:\r\n res += 1\r\nprint(res)", "z=int(input())\r\ns=[0]*26\r\na=0;ans=0\r\nfor i in input():\r\n if a%2==0:\r\n s[ord(i)-97]+=1\r\n else:\r\n if s[ord(i)-65]>0:\r\n s[ord(i)-65]-=1\r\n else:\r\n ans+=1\r\n a+=1\r\nprint(ans) \r\n", "n = int(input())\nst = input()\nd = {}\ncnt = 0\nfor i in st:\n if('a'<=i<='z'):\n if i not in d.keys():\n d[i] = 1\n else:\n d[i] += 1\n else:\n if i.lower() not in d.keys() or d[i.lower()]==0:\n cnt+=1\n else:\n d[i.lower()] -=1\n\nprint(cnt)\n \t\t \t\t \t \t\t \t \t\t \t\t \t \t\t \t \t", "import sys\r\nn=int(sys.stdin.readline())\r\ns=list(sys.stdin.readline())\r\ns=s[:-1]\r\nr=0\r\nk=[0]*26\r\no=[0]*26\r\nj=0\r\n\r\nfor i in s:\r\n if j%2==0:\r\n k[ord(i)-97]=k[ord(i)-97]+1\r\n else:\r\n if k[ord(i)-65]>0: k[ord(i)-65]=k[ord(i)-65]-1\r\n else: r=r+1\r\n j=j+1\r\nprint(r)", "from collections import defaultdict\r\n\r\ndef func(intput,mapping,unpack):\r\n n,s,extra=intput(),input(),0\r\n keys = defaultdict(int)\r\n for e in s:\r\n if e.islower(): keys[e] += 1\r\n else:\r\n key = e.lower()\r\n if not key in keys: extra += 1\r\n else:\r\n if keys[key] > 0: keys[key] -= 1\r\n else: extra += 1\r\n print(extra)\r\n\r\ndef init(TestCases=True):\r\n intput = lambda : int(input())\r\n mapping = lambda s: list(map(s,input().split()))\r\n unpack = lambda s: map(s,input().split())\r\n for _ in range(int(input()) if TestCases else 1):\r\n func(intput,mapping,unpack)\r\n\r\nif __name__ == '__main__':\r\n init(False)", "n = int(input())\r\na = input()\r\n\r\nans = 0\r\nd = dict()\r\nfor i in range(2*n-2):\r\n if i%2==0:\r\n try: d[chr(ord(a[i])-32)] += 1\r\n except: d[chr(ord(a[i])-32)] = 1\r\n elif i%2 == 1:\r\n try:\r\n if d[a[i]]>0: d[a[i]]-=1\r\n else: ans+=1\r\n except:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\nc,k,o=1,{},0\r\nfor i in input():\r\n if c:\r\n k[i]=k.setdefault(i,0)+1\r\n else:\r\n i=i.lower()\r\n a=k.get(i)\r\n if a:\r\n k[i]-=1\r\n else:\r\n o+=1\r\n c=1-c\r\nprint(o)", "a=[*open(0)][1]\r\ns={}\r\nr=0\r\nfor x,y in [*zip(a,a[1:])][::2]:\r\n s[x.upper()]=s.get(x.upper(),0)+1\r\n if s.get(y,0)>0:s[y]-=1\r\n else:r+=1\r\nprint(r)", "from collections import Counter\r\n\r\nn = int(input())\r\nseq = input()\r\n\r\nans = 0\r\nseen = Counter()\r\nfor e in seq:\r\n if e.islower():\r\n seen[e] += 1\r\n else:\r\n if seen[e.lower()] == 0:\r\n ans += 1\r\n else:\r\n seen[e.lower()] -= 1\r\n \r\nprint(ans)\r\n \r\n", "n = input()\r\ns = input()\r\ncount = 1\r\nkey= 0\r\na = [0 for i in range(0,27)]\r\nfor i in s:\r\n if count % 2 == 1:\r\n a[ord(i)-ord('a')]+= 1\r\n else:\r\n if a[ord(i)-ord('A')]!=0:\r\n a[ord(i)-ord('A')]-= 1\r\n else:\r\n key += 1\r\n count += 1\r\nprint(key)\r\n", "\n\n'''\nPortas -> Letras Maiusculas \nChaves -> Letras Minusculas \n\n\n3\naAbB 0\n'''\n\n\ndef solve_a():\n num_comodos = int(input())\n comodos_chaves = input()\n dict_aux = {};solve = 0\n for ele in comodos_chaves:\n #print(dict_aux)\n if(ele.isupper()):\n if(ele.lower() not in dict_aux.keys() or dict_aux[ele.lower()] == 0 ):\n solve = solve +1\n else:\n aux = ele.lower()\n dict_aux[aux] = dict_aux[aux] - 1\n if(ele.islower() ):\n if(ele in dict_aux.keys()):\n dict_aux[ele] = dict_aux[ele] + 1\n else:\n dict_aux[ele] = 1\n\n print(solve)\n\n\n\nsolve_a()\n \t\t \t \t\t\t\t\t \t \t\t", "from collections import defaultdict\r\nd = defaultdict(int)\r\nc = 0\r\ninput()\r\nfor x in input():\r\n if x in 'abcdefghijklmnopqrstuvwxyz':\r\n d[x] += 1\r\n else:\r\n x = chr(ord(x)-ord('A')+ord('a'))\r\n d[x] -= 1\r\n if d[x] < 0:\r\n d[x] = 0\r\n c += 1\r\nprint(c)", "n=int(input())\r\ndic=dict()\r\ns=input()\r\nkeys=0\r\nfor i in s:\r\n if i.islower():\r\n if i in dic.keys():\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\n else:\r\n if i.lower() in dic.keys() and dic[i.lower()]>0:\r\n dic[i.lower()]-=1\r\n elif i.lower() not in dic.keys() or dic[i.lower()]==0:\r\n keys+=1\r\nprint(keys) ", "n = int(input())\ns = input()\n\nkeys = [0] * 26\ndoors = 0\n\nfor i in range(len(s)):\n if i % 2 == 0:\n keys[ord(s[i]) - 97] += 1\n else:\n if keys[ord(s[i].lower()) - 97] > 0:\n keys[ord(s[i].lower()) - 97] -= 1\n else:\n doors += 1\n\nprint(doors)\n", "import logging\n\nl = logging.Logger(\"\")\nh = logging.StreamHandler()\nf = logging.Formatter(fmt=\"[{filename}:{lineno}] {msg}\", style=\"{\")\nh.setFormatter(f)\nl.addHandler(h)\nbug = l.info\n\n# To disable uncomment the next line\n# bug = lambda x:None\n\n# teste=(1,2,3,4)\n# bug(f'{teste=}')\n# bug(f'{2*teste=}')\n\n# -------------------------------------------------------------------- #\nfrom math import sqrt\n\n\ndef main():\n n = int(input())\n s = input()\n keys = {'a': 0, 'b': 0, 'c': 0, 'd': 0, 'e': 0, 'f': 0, 'g': 0, 'h': 0, 'i': 0, 'j': 0, 'k': 0, 'l': 0, 'm': 0,\n 'n': 0, 'o': 0, 'p': 0, 'q': 0, 'r': 0, 's': 0, 't': 0, 'u': 0, 'v': 0, 'w': 0, 'x': 0, 'y': 0, 'z': 0}\n\n total = 0\n for i in range((2 * n) - 2):\n if i % 2 == 0:\n keys[s[i]] += 1\n else:\n if keys[s[i].lower()] > 0:\n keys[s[i].lower()] -= 1\n continue\n if keys[s[i].lower()] == 0:\n total += 1\n\n print(total)\n\n\nif __name__ == '__main__':\n main()\n\n \t\t \t \t\t\t \t \t\t\t\t \t\t \t\t", "n= int(input())\r\nst=input() \r\ndic={}\r\nc=0\r\nfor i in range ((n-1)*2) :\r\n if(i%2==0):\r\n if (st[i] not in dic.keys()):\r\n dic[st[i]]=1\r\n else :\r\n dic[st[i]]+=1\r\n else:\r\n ch = chr(ord(st[i])+32)\r\n if(ch in dic.keys() and dic[ch]>0):\r\n dic[ch]-=1\r\n else :\r\n c+=1 \r\nprint(c) \r\n \r\n \r\n \r\n", "n = int(input())\ns = input()\nkeys = {}\ni = 0\n\nwhile(i<2*(n-1)):\n key = s[i]\n door = s[i+1]\n i+=2\n if key.upper() != door:\n if len(keys) == 0 or key not in keys:\n keys[key] = 1\n else:\n keys[key] += 1\n\n for k, v in keys.items():\n if k.upper() == door and v != 0:\n keys[k] -= 1\n break\n \n\nsum = sum(keys.values())\nprint(sum)\n\n\n\n \n \n ", "i = int(input()) -1\r\nl = list(input())\r\nm = 0\r\nd = {}\r\nfor x in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':\r\n d[x] = 0\r\nfor x in l:\r\n if m == 0:\r\n d[x.upper()] += 1\r\n m = 1\r\n else:\r\n m= 0\r\n if d[x.upper()] >= 1:\r\n i -=1\r\n d[x.upper()] -= 1\r\nprint(i)", "import sys\r\nfilename = sys.argv[-1]\r\nif filename == \"LOCAL\":\r\n\tall = open(filename, \"r\").readlines()\r\nelse:\r\n\tall = sys.stdin.readlines()\r\n\r\ncheck = [0]*255\r\nans = 0\r\nfor i in range(len(all[1])):\r\n\tif i%2 == 0:\r\n\t\tcheck[ ord(all[1][i]) - ord('a') ] += 1\r\n\telse:\r\n\t\tif(check[ ord(all[1][i]) - ord('A') ] == 0):\r\n\t\t\tans += 1\r\n\t\telse:\r\n\t\t\tcheck[ ord(all[1][i]) - ord('A') ] -= 1\r\nprint(ans)\r\n", "ans = 0\nn = int(input())\nkeys = [0 for i in range(30)]\ns = input()\nfor i in range(n-1):\n keys[ord(s[2*i].capitalize()) - ord('A')] += 1\n if keys[ord(s[2*i + 1]) - ord('A')] == 0:\n ans += 1\n else:\n keys[ord(s[2*i + 1]) - ord('A')] -= 1\nprint(ans)\n\n", "# -----------------------------------------------------------\r\n# URL : https://codeforces.com/contest/XXXXX/problem/A\r\n# Title : TEXT\r\n# Notes : tag-codeforces, tag-problem-A, tag-div-2\r\n# -----------------------------------------------------------\r\n\r\n# ---------------------------------------------------Shared part--------------------------------------------------------\r\nimport os\r\nimport time\r\nfrom collections import defaultdict\r\nfrom sys import stdin, maxsize\r\n\r\ninp = lambda: stdin.readline().strip()\r\niinp = lambda: int(inp())\r\nintl = lambda: list(map(int, inp().split()))\r\nstrl = lambda: list(inp().split())\r\nlist_to_string = lambda _a: \"\".join(map(str, _a))\r\nlist_to_string_list = lambda _a: \" \".join(map(str, _a))\r\n_dp = lambda default_value: defaultdict(lambda: default_value)\r\nprint_dp = lambda _dict: list(map(lambda item: print(f\"{item[0]} = {item[1]}\"), _dict.items()))\r\n\r\nMOD = 10 ** 9 + 7\r\nINF = maxsize\r\n\r\n\r\n# -------------------------------------------------------Solution-------------------------------------------------------\r\n\r\ndef solve():\r\n n = iinp()\r\n s = inp()\r\n _keys = _dp(0)\r\n _missing = 0\r\n\r\n for i in range(n * 2 - 2):\r\n if i & 1 == 0:\r\n _keys[s[i]] += 1\r\n else:\r\n if _keys[s[i].lower()] == 0:\r\n _missing += 1\r\n else:\r\n _keys[s[i].lower()] -= 1\r\n\r\n return _missing\r\n\r\n\r\ndef run():\r\n print(solve())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n if os.environ.get(\"DEBUG_CODEFORCES\"):\r\n stdin = open(\"../input.txt\", \"r\")\r\n start_time = time.time()\r\n run()\r\n print(\"\\n--- %s seconds ---\\n\" % (time.time() - start_time))\r\n else:\r\n run()\r\n", "n = int(input())-1\r\ns = input()\r\n\r\nans = 0\r\nkeys = {}\r\nfor i in range(n):\r\n nkey = s[2*i]\r\n if nkey in keys:\r\n keys[nkey] += 1\r\n else:\r\n keys[nkey] = 1\r\n ndor = s[2*i+1].lower()\r\n\r\n if ndor in keys:\r\n keys[ndor] -=1\r\n if keys[ndor] == 0:\r\n del keys[ndor]\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\nx = 2*n - 2\r\nalphabets = list(\"abcdefghijklmnopqrstuvwxyz\")\r\nmemo = {alphabets[i].upper(): 0 for i in range(26)}\r\nkeys = 0\r\n\r\nfor i in range(0, x, 2):\r\n memo[s[i].upper()] += 1\r\n if memo[s[i+1]]:\r\n memo[s[i+1]] -= 1\r\n else:\r\n keys += 1\r\n\r\nprint(keys)", "n,f,num,d = int(input()),input().strip(),0,{}\r\nfor i in range(2 * n - 2):\r\n if i % 2:\r\n a = f[i].lower()\r\n if not a in d:\r\n num += 1\r\n else:\r\n if d[a]:\r\n d[a] -= 1\r\n else:\r\n num += 1\r\n else:\r\n try:\r\n d[f[i]] += 1\r\n except:\r\n d[f[i]] = 1\r\nprint(num)", "d = dict()\r\nn = int(input())\r\ns = input().rstrip()\r\nsum1 = 0\r\ndef f(c):\r\n return chr(ord(c) - ord('A') + ord('a'))\r\nfor i in range(len(s)):\r\n c = s[i]\r\n if (i + 1) % 2 == 1:\r\n if c in d:\r\n d[c] += 1\r\n else:\r\n d[c] = 1\r\n else:\r\n if f(c) in d:\r\n \r\n if d[f(c)] > 0:\r\n d[f(c)] -= 1\r\n else:\r\n sum1 += 1\r\n else:\r\n sum1 += 1\r\nprint(sum1)\r\n ", "ans=0\r\nd=[0]*128\r\nn=int(input())-1\r\ns=list(input())\r\nfor i in range(n):\r\n d[ord(s[i*2])]+=1\r\n d[ord(s[i*2+1])+32]-=1\r\n if d[ord(s[i*2+1])+32]<0:\r\n ans+=1; d[ord(s[i*2+1])+32]=0\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nkeys = [0 for i in range(26)]\r\nans = 0\r\nfor i in range(len(s)):\r\n if(\"A\"<=s[i]<=\"Z\"):\r\n if(keys[ord(s[i])-ord(\"A\")]>0):\r\n keys[ord(s[i]) -ord(\"A\")]-=1\r\n else:\r\n ans+=1\r\n else:\r\n keys[ord(s[i])-ord(\"a\")] += 1\r\nprint(ans)", "from collections import defaultdict\ndef zero():\n return 0\nn=int(input())\ns=input()\nn=2*n-2\nres=0\nd=defaultdict(zero)\nfor i in range(len(s)):\n \n if(i%2==0):\n d[s[i]]+=1\n else:\n f=s[i].lower()\n if(d[f]>0):\n d[f]-=1\n else:\n res+=1\nprint(res)\n \n\t \t\t\t\t \t\t \t\t \t \t\t\t \t\t\t \t\t\t \t", "input()\r\nhouse = input()\r\nans = 0\r\nkey = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\r\nfor i in range(len(house)):\r\n if ord(house[i]) >= 97:\r\n key[ord(house[i]) - 97] += 1\r\n else:\r\n if key[ord(house[i]) - 65] > 0:\r\n key[ord(house[i]) - 65] -= 1\r\n else:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\ns = input()\r\ne = {}\r\ncnt = 0\r\nfor i in range(len(s)):\r\n\tif s[i].isupper():\r\n\t\tif s[i] in e and e[s[i]]>=1:\r\n\t\t\te[s[i]]-=1\r\n\t\telse:\r\n\t\t\tcnt+=1\r\n\telse:\r\n\t\tif s[i].upper() in e:\r\n\t\t\te[s[i].upper()]+=1\r\n\t\telse:\r\n\t\t\te[s[i].upper()]=1\r\n\r\nprint(cnt)\r\n\r\n", "keys = {}\r\n\r\nn = int(input()) \r\ninput_str = input()\r\n\r\nfor i in range(0, len(input_str) - 1, 2):\r\n key = input_str[i]\r\n door = input_str[i + 1]\r\n\r\n if key.upper() != door:\r\n if len(keys) <= 0 or key not in keys:\r\n keys[key] = 1\r\n else:\r\n keys[key] += 1\r\n # print(keys)\r\n for k, v in keys.items():\r\n # print(keys.items())\r\n if k.upper() == door and v != 0:\r\n keys[k] -= 1\r\n break\r\n# print(keys)\r\nsum = 0\r\nfor v in keys.values():\r\n sum += v\r\n\r\nprint(sum)\r\n", "n = int(input())\r\ninput_string = input()\r\n\r\nmap = {}\r\nmap_string = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\ncost = 0\r\n\r\nfor i in range(0, len(map_string)):\r\n map[map_string[i]] = 0\r\n\r\nfor i in range(0, len(input_string)):\r\n if i % 2 == 0:\r\n map[input_string[i]]+=1\r\n else:\r\n lower = chr(ord(input_string[i]) + 32) \r\n if map[lower] > 0:\r\n map[lower] -= 1\r\n else:\r\n cost+=1\r\n\r\nprint(cost) \r\n ", "t = int(input())\r\ns = str(input())\r\nsmall = []\r\nbig = []\r\nc = 0\r\nalp = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\n\r\nfor el in range(t*2-2):\r\n if(el % 2 == 0):\r\n small.append(s[el])\r\n\r\nb = {small[i] : 0 for i in range((t*2-2)//2)}\r\n\r\nfor i in range(t*2-2):\r\n if(i % 2 == 0):\r\n b[s[i]] += 1\r\n else:\r\n l = s[i].lower()\r\n if(l in b):\r\n if(b[l] > 0):\r\n b[l] -= 1\r\n else:\r\n c += 1\r\n else:\r\n c += 1\r\nprint(c)", "room = int(input())\r\n\r\nkey = input()\r\n\r\ncount = 0\r\n\r\ndic = {}\r\n\r\nfor i in range(0, len(key), 2):\r\n if key[i].upper() in dic:\r\n dic[key[i].upper()] += 1\r\n else:\r\n dic[key[i].upper()] = 1\r\n\r\n if key[i+1] in dic:\r\n if dic[key[i+1]] != 0:\r\n dic[key[i+1]] -= 1\r\n else:\r\n count += 1\r\n else:\r\n count += 1\r\n\r\n \r\nprint(count)", "n=int(input())\r\ns=input()\r\nd={}\r\nc=0\r\nfor i in range(2*n-2):\r\n if i%2==0:\r\n if s[i] in d:\r\n d[s[i]]+=1\r\n else:\r\n d[s[i]]=1\r\n else:\r\n x=s[i].lower()\r\n if x in d and d[x]!=0:\r\n d[x]-=1\r\n else:\r\n c+=1\r\nprint(c)\r\n", "import collections\r\nn = int(input())\r\ns = input()\r\nd = collections.defaultdict(int)\r\nans = 0\r\nfor i, c in enumerate(s):\r\n if i % 2 == 0:\r\n d[c] += 1\r\n else:\r\n k = c.lower()\r\n if d[k]:\r\n d[k] -= 1\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "v1=int(input())\r\nv2=list(input())\r\nv=dict();c=0\r\nfor i in v2:\r\n if i.isupper():\r\n p=i.lower()\r\n if p in v:\r\n if v[p]>0:\r\n v[p]-=1\r\n else:\r\n c+=1\r\n else:c+=1\r\n else:\r\n if i in v:\r\n v[i]+=1\r\n else:\r\n v[i]=1\r\nprint(c)", "from collections import defaultdict\r\n\r\nn = int(input())\r\ns = input()\r\nhave = defaultdict(lambda: 0)\r\nneed = 0\r\nfor i in range(0, 2*n-2):\r\n if i % 2 == 1:\r\n continue\r\n have[s[i]] += 1\r\n nxt = s[i+1].lower()\r\n if have[nxt] == 0:\r\n need += 1\r\n else:\r\n have[nxt] -= 1\r\nprint(need)", "# cook your dish here\r\nn=int(input())\r\ns=input()\r\nd={}\r\nc=0\r\nfor i in range(2*n-2):\r\n if(i%2==0):\r\n if s[i] not in d:\r\n d[s[i]]=1\r\n else:\r\n d[s[i]]+=1\r\n else:\r\n k=chr(ord(s[i])+32)\r\n #print(k)\r\n if k in d:\r\n if d[k]>0:\r\n d[k]-=1\r\n else:\r\n c+=1\r\n else:\r\n c+=1\r\nprint(c)\r\n", "n = int(input())\r\n\r\ndata = input()\r\n\r\navailable_keys = {}\r\nneeded_keys = 0\r\n\r\nk = 0\r\nfor _ in range(n-1):\r\n key = data[k]\r\n lock = data[k+1].lower()\r\n\r\n k += 2\r\n\r\n available_keys[key] = available_keys.get(key, 0) + 1\r\n\r\n if available_keys.get(lock, 0):\r\n available_keys[lock] -= 1\r\n else:\r\n needed_keys += 1\r\n\r\nprint(needed_keys)", "n = int(input())\r\nr = {}\r\nans = 0\r\nfor i in input():\r\n if i == i.lower():\r\n if i in r:\r\n r[i] += 1\r\n else:\r\n r[i] = 1\r\n else:\r\n i = i.lower()\r\n if i in r and r[i] > 0:\r\n r[i] -= 1\r\n else:\r\n ans += 1\r\nprint(ans)", "from collections import Counter\nn = int(input())\ns = input()\nkeys = Counter()\nbuy = 0\nfor i in range(0, 2*n-2, 2):\n keys[s[i]] += 1\n room = s[i+1].lower()\n if room not in keys or not keys[room]:\n buy += 1\n else:\n keys[room] -= 1\nprint(buy)\n", "def solve():\r\n n = int(input())\r\n s = input()\r\n present = [0] * 26\r\n ans = 0\r\n for i in range(2 * (n - 1)):\r\n if i % 2 == 0:\r\n present[ord(s[i]) - ord('a')] += 1\r\n else:\r\n if present[ord(s[i]) - ord('A')] > 0:\r\n present[ord(s[i]) - ord('A')] -= 1\r\n else:\r\n ans += 1\r\n print(ans)\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\narr = list(input())\n\nn_keys = {}\nn_buy = 0\nfor i in range(len(arr)):\n if i % 2 == 0:\n if arr[i] in n_keys:\n n_keys[arr[i]] += 1\n else:\n n_keys[arr[i]] = 1\n else:\n if (arr[i].lower() in n_keys) and n_keys[arr[i].lower()] > 0:\n n_keys[arr[i].lower()] -= 1\n else:\n n_buy += 1\n\nprint(n_buy)\n\t\t \t\t \t \t\t\t \t \t \t\t \t \t \t", "n = int(input())\nstring = input()\n\ndicionario = {}\n\nchaves = 0\n\nfor letras in string:\n if letras == letras.upper():\n if letras.lower() in dicionario and dicionario[letras.lower()] > 0:\n dicionario[letras.lower()] -= 1\n else:\n chaves += 1\n else:\n dicionario[letras] = dicionario.get(letras, 0) + 1\n\nprint(chaves)\n\t \t\t\t \t \t\t \t \t \t \t \t", "t=0\r\nl='abcdefghijklmnopqrstuvwxyz'\r\nkey={}\r\nfor i in l:\r\n key[i] = 0\r\na=int(input())\r\nb=input()\r\nfor i in b:\r\n if i in l:\r\n key[i] +=1\r\n else:\r\n if not key[i.lower()]:\r\n t+=1\r\n else:\r\n key[i.lower()]-=1\r\nprint(t)\r\n", "\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import *\r\n#import itertools\r\n#from operator import itemgetter\r\n#from itertools import count, islice\r\n#from functools import reduce\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#dirs = [[1,0],[0,1],[-1,0],[0,-1]]\r\n#from math import factorial as fact\r\n#a,b = [int(x) for x in input().split()]\r\n#sarr = [x for x in input().strip().split()]\r\n#import math\r\nfrom math import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(2**30)\r\n\r\n\r\n\r\ndef solve():\r\n n = 2*int(input())-2\r\n s = input().strip()\r\n d = defaultdict(int)\r\n c = 0\r\n for i in range(n):\r\n if i&1:\r\n door = s[i].lower()\r\n if d[door]==0:\r\n c+=1\r\n else:\r\n d[door]-=1\r\n else:\r\n d[s[i]]+=1\r\n print(c)\r\n \r\n \r\n \r\n \r\n \r\ntt = 1#int(input())\r\nfor test in range(tt):\r\n solve()\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n#\r\n", "from collections import defaultdict\r\n\r\nMyDict, Check, Count = defaultdict(int), False, 0\r\ninput()\r\nfor i in input():\r\n if Check and (i.lower() not in MyDict or MyDict[i.lower()] == 0):\r\n Count += 1\r\n elif Check and i.lower() in MyDict:\r\n MyDict[i.lower()] -= 1\r\n else:\r\n MyDict[i] += 1\r\n Check = not Check\r\nprint(Count)\r\n\r\n# Come together for getting better !!!!\r\n", "import sys\r\nimport bisect as bi\r\nimport math\r\nfrom collections import defaultdict as dd\r\nimport heapq\r\nimport itertools\r\ninput=sys.stdin.readline\r\n##import numpy as np\r\n#sys.setrecursionlimit(10**7)\r\nmo=10**9+7\r\ndef cin():\r\n return map(int,sin().split())\r\ndef ain(): \r\n return list(map(int,sin().split()))\r\ndef sin():\r\n return input()\r\ndef inin():\r\n return int(input())\r\n##def power(x, y):\r\n## if(y == 0):return 1\r\n## temp = power(x, int(y / 2))%mo\r\n## if (y % 2 == 0):return (temp * temp)%mo \r\n## else:\r\n## if(y > 0):return (x * temp * temp)%mo \r\n## else:return ((temp * temp)//x )%mo\r\ns1=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ns2=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor _ in range(1):\r\n n=inin()\r\n ans=0;s=sin().strip();d=dd(int)\r\n for i in range(0,len(s),2):\r\n if((ord(s[i])-ord('a')== ord(s[i+1])-ord('A'))):continue\r\n elif(ord(s[i])-ord('A')== ord(s[i+1])-ord('a')):continue\r\n elif(s[i+1] in s1 and d[s2[ord(s[i+1])-ord('A')]]!=0):\r\n d[s2[ord(s[i+1])-ord('A')]]-=1\r\n d[s[i]]+=1\r\n continue\r\n elif(s[i+1] in s2 and d[s1[ord(s[i+1])-ord('a')]]!=0):\r\n d[s1[ord(s[i+1])-ord('a')]]-=1\r\n d[s[i]]+=1\r\n continue\r\n else:\r\n ans+=1\r\n d[s[i]]+=1\r\n print(ans)\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n##\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n##def msb(n):n|=n>>1;n|=n>>2;n|=n>>4;n|=n>>8;n|=n>>16;n|=n>>32;n|=n>>64;return n-(n>>1) #2 ki power\r\n##def pref(a,n,f): \r\n## pre=[0]*n\r\n## if(f==0): ##from beginning\r\n## pre[0]=a[0]\r\n## for i in range(1,n):\r\n## pre[i]=a[i]+pre[i-1]\r\n## else: ##from end\r\n## pre[-1]=a[-1]\r\n## for i in range(n-2,-1,-1):\r\n## pre[i]=pre[i+1]+a[i]\r\n## return pre\r\n##maxint=10**24 \r\n##def kadane(a,size): \r\n## max_so_far = -maxint - 1\r\n## max_ending_here = 0\r\n## \r\n## for i in range(0, size): \r\n## max_ending_here = max_ending_here + a[i] \r\n## if (max_so_far < max_ending_here): \r\n## max_so_far = max_ending_here \r\n## \r\n## if max_ending_here < 0: \r\n## max_ending_here = 0 \r\n## return max_so_far\r\n", "from collections import defaultdict\n\nn = int(input())\ns = input()\nkeyToBuy = 0\nkeys = defaultdict(int)\n\nfor i in range(len(s)):\n if i % 2 == 0:\n keys[s[i]] += 1\n else:\n key = s[i].lower()\n if key in keys:\n if keys[key] == 0:\n keyToBuy += 1\n else:\n keys[key] -= 1\n else:\n keyToBuy += 1\n\nprint(keyToBuy)\n \t \t\t\t \t \t\t\t\t\t \t \t \t \t \t \t", "n=int(input())\r\na=input()\r\nkeys=0\r\nstore=[0]*26\r\nfor i in range(2*n-2):\r\n if i%2==0:\r\n store[ord(a[i])-ord('a')]+=1\r\n else:\r\n #Check if the key is available or not\r\n if store[ord(a[i])-ord('A')]==0:\r\n keys+=1\r\n else:\r\n store[ord(a[i])-ord('A')]-=1 \r\nprint(keys)\r\n", "n=int(input())\nslst=[0 for i in range(26)]\ns=input(\"\")\ncount=0\nfor i in s:\n if(ord(i)>=97 and ord(i)<=122):\n slst[ord(i)-97]+=1\n else:\n x=slst[ord(i)-65]\n if(x>0):\n slst[ord(i)-65]-=1\n else:\n count+=1\nprint(count)\n \t\t \t \t \t \t\t \t\t \t\t \t \t", "n = int(input())\r\n\r\ns = input()\r\n\r\nkey_dict = {}\r\nk = 0\r\n\r\nfor i in range(0, 2 * n - 2, 2):\r\n if s[i] != s[i + 1].lower():\r\n l = s[i]\r\n r = s[i + 1].lower()\r\n if l not in key_dict.keys():\r\n key_dict[l] = 1\r\n else:\r\n key_dict[l] += 1\r\n\r\n if (r in key_dict.keys()) and (key_dict[r] > 0):\r\n key_dict[r] -= 1\r\n elif (r not in key_dict.keys()) or (key_dict[r] == 0):\r\n k += 1\r\n\r\nprint(k)\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nfrom collections import Counter\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\ndef solve():\r\n n = ii()\r\n s = inp()\r\n c = Counter()\r\n ans = 0\r\n for char in s:\r\n if char.islower():\r\n c[char] += 1\r\n else:\r\n char = char.lower()\r\n if c[char] > 0:\r\n c[char] -= 1\r\n else:\r\n ans += 1\r\n return ans\r\n\r\n\r\nprint(solve())\r\n", "from collections import Counter as c\r\nfrom string import ascii_lowercase as l\r\ninput()\r\na=input()\r\nb=c()\r\nd=0\r\nfor i in a:\r\n if i in l:b[i]+=1\r\n elif b[i.lower()]:b[i.lower()]-=1\r\n else:d+=1\r\nprint(d)\r\n", "n = int(input())\ns = input()\nd = {}\nc = 0\nfor i in s:\n if i.islower():\n d[i] = d.get(i, 0)+1\n else:\n a = i.lower()\n w = d.get(a, 0)\n if w==0:\n c+=1\n else:\n d[a]-=1\nprint(c)\n \n \t\t \t \t \t\t \t\t\t\t\t \t \t \t\t", "n = input()\r\nx = input()\r\nL = [0] * 26; c = 0\r\n\r\nfor i in range (len(x)) :\r\n if i % 2 == 0 :\r\n L[ord(x[i]) - 97] += 1\r\n if i % 2 == 1 :\r\n if L[ord(x[i].lower()) - 97] > 0 :\r\n L[ord(x[i].lower()) - 97] -= 1\r\n else :\r\n c += 1\r\nprint(c)", "n=int(input())\r\ns=input()\r\nres=0\r\nd={}\r\nfor i in range(0,(2*n-2),2):\r\n if s[i] in d:\r\n d[s[i]]+=1\r\n else:\r\n d[s[i]]=1\r\n room=s[i+1].lower()\r\n if room in d and d[room]>0:\r\n d[room]-=1\r\n else:\r\n res+=1\r\nprint(res)", "n = int(input())\r\ns = input()\r\ncnt = 0\r\nkeys = {chr(i):0 for i in range(ord('a'),ord('z')+1)}\r\nfor i in range(len(s)//2):\r\n\tkeys[s[i*2]] += 1\r\n\tif keys[s[i*2+1].lower()] == 0:\r\n\t\tcnt += 1\r\n\telse:\r\n\t\tkeys[s[i*2+1].lower()]-=1\r\nprint(cnt)\r\n", "def sol(n,s):\r\n dic = {}\r\n req = 0\r\n for e in range(0,len(s)-1,2):\r\n door = s[e+1].lower()\r\n if s[e]==door:\r\n continue\r\n else:\r\n temp = dic.get(door,0)\r\n if temp==0:\r\n req+=1\r\n else:\r\n dic[door]-=1\r\n a = dic.get(s[e], 0)\r\n dic[s[e]] = a + 1\r\n return req\r\nn = int(input())\r\ns = input()\r\nprint(sol(n,s))", "n = int(input())\r\ns = input()\r\nmpp = {}\r\nans = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n mpp[i] = mpp.get(i, 0) + 1\r\n else:\r\n if mpp.get(i.lower(), 0) != 0:\r\n mpp[i.lower()] -= 1\r\n else:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\n\nknowledge = input()\n\ncount = 0\n\nkeyHash = {}\n\nfor i in range((2*n) -2):\n if i%2 == 0:\n key = knowledge[i]\n\n if key in keyHash: keyHash[key]+=1\n\n else: keyHash[key] = 1\n \n else:\n door = knowledge[i]\n\n reqKey = chr(ord(door)+ 32)\n\n if reqKey in keyHash and keyHash[reqKey] > 0: keyHash[reqKey]-=1\n\n else: count+=1\n\n\nprint(count)\n\n\n\n", "'''input\n5\nxYyXzZaZ\n'''\nn = int(input())\ns = input()\nk, t = {}, 0\nfor x in s:\n\tif x.islower():\n\t\tif x in k:\n\t\t\tk[x] += 1\n\t\telse:\n\t\t\tk[x] = 1\n\telse:\n\t\tif x.lower() in k and k[x.lower()] > 0:\n\t\t\tk[x.lower()] -= 1\n\t\telse:\n\t\t\tt += 1\nprint(t)\n\n\n\n\n\n\n\n\n\n\n", "n = int(input())\r\ns = input()\r\nkeys = [0] * 256\r\nres = 0\r\nfor i in range(0, len(s)-1, 2):\r\n if s[i] != s[i + 1].lower():\r\n if keys[ord(s[i + 1].lower())] == 0:\r\n res += 1\r\n else:\r\n keys[ord(s[i + 1].lower())] -= 1\r\n keys[ord(s[i])] += 1\r\nprint(res)\r\n ", "n = int(input())\r\ns = input()\r\nd,cnt = {},0\r\nfor i in range(1,2*(n-1),2):\r\n\td[s[i].lower()]=0\r\nfor i in range(2*(n-1)):\r\n\tif i%2==0:\r\n\t\tif s[i] not in d: d[s[i]]=1\r\n\t\telse: d[s[i]]+=1\r\n\telse:\r\n\t\tif d[s[i].lower()]==0: cnt+=1\r\n\t\telse: d[s[i].lower()]-=1\r\nprint(cnt)", "from collections import Counter\n_ = input()\ns = input()\nkeycounter = Counter()\ntobuy = 0\nfor i in range(0,len(s),2):\n keycounter[s[i]] += 1 \n if keycounter[s[i+1].lower()] > 0:\n keycounter[s[i+1].lower()] -= 1\n else:\n tobuy += 1\nprint(tobuy)\n \t\t\t \t\t\t\t\t \t\t \t \t\t\t \t \t \t \t", "n = input()\r\ns = input()\r\nklucze = {}\r\nwynik = 0\r\ns = s.lower()\r\n\r\nfor i in range(len(s)):\r\n if i%2 == 0:\r\n if s[i] in klucze:\r\n klucze[s[i]] += 1\r\n else: klucze[s[i]] = 1\r\n\r\n else:\r\n if s[i] in klucze:\r\n if klucze[s[i]] > 0:\r\n klucze[s[i]] -= 1\r\n else: wynik += 1\r\n else: wynik += 1\r\n\r\n\r\n\r\nprint(wynik)\r\n", "n = int(input())\ns = input()\n\ndef keys(s: str, k: int):\n result = 0\n lowercases = {}\n for i in range(k):\n lower = s[2*i]\n upper = s[2*i+1]\n\n if lower in lowercases.keys():\n lowercases[lower] += 1\n else:\n lowercases[lower] = 1\n\n if lowercases.get(upper.lower(), 0) < 1:\n result += 1\n else:\n lowercases[upper.lower()] -= 1\n\n return result\n\nprint(keys(s, n-1))\n\t \t \t \t \t\t\t \t\t \t \t\t\t\t \t\t\t", "\r\nn = int(input())\r\nst = input()\r\nd = {}\r\ncnt = 0\r\nfor i in st:\r\n if('a'<=i<='z'):\r\n if i not in d.keys():\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n else:\r\n if i.lower() not in d.keys() or d[i.lower()]==0:\r\n cnt+=1\r\n else:\r\n d[i.lower()] -=1\r\n \r\nprint(cnt)\r\n \t\t", "import collections\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = str(input())\r\n ans = collections.defaultdict(int)\r\n res = 0\r\n for i in range(0, 2 * n - 2, 2):\r\n ans[s[i]] += 1\r\n ch = chr(ord(s[i + 1]) + 32)\r\n if ch not in ans:\r\n res += 1\r\n else:\r\n ans[ch] -= 1\r\n if ans[ch] == 0:\r\n del ans[ch]\r\n print(res)\r\n", "n = int(input())\r\nstring = list(input())\r\nkeys = {}\r\nres = 0\r\nfor i in range (0, 2 * n - 2, 2):\r\n k = chr(ord(string[i + 1]) + 32)\r\n if k != string[i]:\r\n if keys.get(k) != None and keys[k] != 0:\r\n keys[k] -= 1\r\n else:\r\n res += 1\r\n if keys.get(string[i]) == None:\r\n keys[string[i]] = 1\r\n else:\r\n keys[string[i]] += 1\r\nprint(res)", "n = int(input())\r\ns = input()\r\nres = 0\r\nd = dict()\r\nfor i, e in enumerate(s):\r\n if i%2==0:\r\n if e not in d:\r\n d[e]=1\r\n else:\r\n d[e] += 1\r\n else:\r\n k = chr(ord(e)+32)\r\n if k not in d:\r\n res += 1\r\n else:\r\n d[k] -= 1\r\n if d[k]==0:\r\n del d[k]\r\nprint(res)\r\n", "n = int(input())\ns = str(input())\n\nks = [0] * 255\nsumm = 0\n\nfor i, c in enumerate(s):\n if i % 2 == 0:\n ks[ord(c)] += 1\n elif ks[ord(c.lower())] == 0:\n summ += 1\n else:\n ks[ord(c.lower())] -= 1\n\nprint(summ)\n\t \t\t \t\t\t \t \t\t\t \t \t \t\t\t", "n = int(input())\ns = input()\n\nneed = 0\nkeys = {c: 0 for c in 'abcdefghijklmnopqrstuvwxyz'}\nfor c in s:\n if c.islower():\n keys[c] += 1\n else:\n c = c.lower()\n if keys[c]:\n keys[c] -= 1\n else:\n need += 1\n\nprint(need)\n", "n=int(input())\r\ns=input().lower()\r\ndi={}\r\nc=0\r\nfor i in range(len(s)):\r\n if i%2==0:\r\n if s[i] not in di.keys():\r\n di[s[i]]=0\r\n di[s[i]]+=1\r\n else:\r\n if s[i] not in di.keys() :\r\n c+=1\r\n else:\r\n if di[s[i]]==0:\r\n c+=1\r\n else:\r\n di[s[i]]-=1\r\nprint(c)", "# Write Python 3 code in this online editor and run it.\na=[*open(0)][1]\ns={}\nr=0\nfor x,y in [*zip(a,a[1:])][::2]:\n s[x.upper()]=s.get(x.upper(),0)+1\n if s.get(y,0)>0:s[y]-=1\n else:r+=1\nprint(r)\n \t \t \t \t\t\t\t\t \t\t\t\t \t\t\t\t", "import string\r\n\r\nn = int(input())\r\npath = input()\r\nkeys = dict()\r\ncount = 0\r\nfor i in string.ascii_lowercase:\r\n\tkeys[i] = 0\r\n\r\nfor c in path:\r\n\tif c.lower() == c:\r\n\t\tkeys[c] = keys[c] + 1\r\n\telse:\r\n\t\tif keys[c.lower()] > 0:\r\n\t\t\tkeys[c.lower()] = keys[c.lower()] - 1\r\n\t\telse:\r\n\t\t\tcount = count + 1\r\n\r\nprint(count)", "n=int(input())\r\ns=input()\r\ns=list(s)\r\nk=[0]*26\r\ncount=0\r\nfor i in range(0,(len(s)//2)):\r\n p=s[i*2]\r\n q=s[i*2+1]\r\n k[ord(p)-97]+=1\r\n if k[ord(q)-65]>0:\r\n k[ord(q)-65]-=1\r\n else:\r\n count+=1\r\nprint(count)", "def check(alpha,val):\r\n #print(\"alpha=\",alpha)\r\n for i in range(len(alpha)):\r\n if alpha[i]==val:\r\n return i\r\n return -1\r\n\r\ndic={'q':0,'w':0,'e':0,'r':0,'t':0,'y':0,'u':0,'i':0,'o':0,'p':0,'l':0,'k':0,'j':0,'h':0,'g':0,'f':0,'d':0,'s':0,'a':0,'z':0,'x':0,'c':0,'v':0,'b':0,'n':0,'m':0}\r\n\r\nn=int(input())\r\nstrin=input()\r\nstring=list(strin)\r\ncount=0\r\nfor i in range(0,len(string)):\r\n if i%2==0:\r\n dic[string[i]]+=1\r\n else:\r\n if dic[chr(ord(string[i])+32)]!=0:\r\n dic[chr(ord(string[i])+32)]-=1\r\n\r\n else:\r\n count+=1\r\nprint(count)", "n=int(input())\ns=list(input())\n\nkeys=[0]*26\ncount=0\nfor i in range(0, (len(s)//2)):\n key = s[i*2]\n door = s[i*2+1]\n keys[ord(key)-97] += 1\n if (keys[ord(door)-65] > 0):\n keys[ord(door)-65] -= 1\n else:\n count+=1\nprint(count)\n\t \t \t \t\t \t \t\t \t\t\t \t\t", "# cook your dish here\r\nn=int(input())\r\nls=[0 for i in range(26)]\r\nst=input()\r\ncou=0\r\nfor x in st:\r\n if x.islower() :\r\n ls[ord(x)-ord('a')]+=1\r\n else :\r\n if ls[ord(x)-ord('A')] ==0:\r\n cou+=1\r\n else :\r\n ls[ord(x)-ord('A')]-=1\r\nprint(cou) \r\n", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nc = Counter()\r\nm = 0\r\nfor i in range(n - 1):\r\n k = s[2 * i]\r\n c[k] += 1\r\n d = s[2 * i + 1].lower()\r\n if c[d] > 0:\r\n c[d] -= 1\r\n else:\r\n m += 1\r\nprint(m)", "n = input()\r\ns = [i for i in input()]\r\nit = 0\r\nresult = 0\r\nd = {}\r\nfor i in s:\r\n if it%2 == 0:\r\n if i in d: d[i]=d[i]+1\r\n else: d[i] = 1\r\n else:\r\n if i.lower() in d : \r\n if d[i.lower()] > 0:\r\n d[i.lower()]-=1\r\n else:\r\n result+=1\r\n else: result+=1\r\n it+=1\r\n\r\nprint(result)", "import sys,os\r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\r\nfrom collections import defaultdict\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nfrom collections import defaultdict\r\n\r\nn=int(input())\r\ns=input()\r\nans=0\r\nmd=defaultdict(int)\r\nfor i in range(2*n-2):\r\n if i%2==0:\r\n md[s[i]]+=1\r\n else:\r\n ch=s[i].lower()\r\n if md[ch]==0:\r\n ans+=1\r\n else:\r\n md[ch]-=1\r\nprint(ans)", "def p1():\r\n\tn = int(input());l=[int(i) for i in input().split()];l.sort()\r\n\tt = 0\r\n\tfor i in range(1,n):\r\n\t\tif l[i] <= l[i-1]:\r\n\t\t\tt+=l[i-1]-l[i]+1\r\n\t\t\tl[i]=l[i-1]+1\r\n\tprint(t)\r\nn = int(input())\r\nway = input()\r\n\r\nkeys = [0]*26\r\nres = 0\r\n\r\nfor i in range(n-1):\r\n keys[ord(way[2*i])-97] += 1\r\n if keys[ord(way[2*i+1])-65] == 0:\r\n res += 1\r\n else:\r\n keys[ord(way[2*i+1])-65] -= 1\r\n\r\nprint(res)\r\n", "n=int(input())\r\ns=input()\r\narr=[]\r\nans=0\r\nd={}\r\nfor i in range(97,123):\r\n d[chr(i)]=0\r\nfor ele in s:\r\n if(ord(ele)>=65 and ord(ele)<=90):\r\n small=ele.lower()\r\n if(d[small]==0):\r\n ans+=1\r\n else:\r\n d[small]-=1\r\n else:\r\n d[ele]+=1\r\nprint(ans) ", "a=[0]*26\nn=int(input())\ns=input()\ncnt=0\nfor i in range(2*n-2):\n if i%2==0:\n a[ord(s[i])-ord('a')]+=1\n else:\n if a[ord(s[i])-ord('A')]>=1:\n a[ord(s[i])-ord('A')]-=1\n else:\n cnt+=1\nprint(cnt)\n ", "from collections import Counter\n\nn = int(input())\ns = input()\nkeys = Counter()\nneed = 0\nfor i in range(0, n*2-2, 2):\n keys[s[i]] += 1\n neededkey = s[i+1].lower()\n if keys[neededkey]:\n keys[neededkey] -= 1\n else:\n need += 1\nprint(need)\n", "n = int(input())\r\ns = input()\r\nans = 0\r\nd = {}\r\nfor i in range(0, 2 * n - 2, 2):\r\n key = s[i]\r\n dor = s[i + 1]\r\n if key not in d:\r\n d[key] = 1\r\n else:\r\n d[key] += 1\r\n if (dor.lower() not in d) or (d[dor.lower()] == 0):\r\n ans += 1\r\n else:\r\n d[dor.lower()] -= 1\r\nprint(ans)", "n = int(input())\r\ndoors = [0 for i in range(26)]\r\nkeys = [0 for i in range(26)]\r\nans = 0\r\nch = True\r\nfor i in input():\r\n s = ord(i)\r\n if ch:\r\n for j in range(ord('a'), ord('z') + 1):\r\n if j == s:\r\n keys[j - ord('a')] += 1\r\n else:\r\n for j in range(ord('A'), ord('Z') + 1):\r\n if j == s:\r\n if keys[j - ord('A')] > 0:\r\n keys[j - ord('A')] -= 1\r\n else:\r\n ans += 1\r\n ch = not(ch)\r\nprint(ans)\r\n\r\n", "n=int(input())\ns1 = input()\na = [0] * 26\ncount = 0\n\nfor i in range(len(s1)):\n if i % 2 == 0:\n a[ord(s1[i]) - 97] += 1\n else:\n if a[ord(s1[i]) - 65] > 0:\n a[ord(s1[i]) - 65] -= 1\n else:\n count += 1\n\nprint(count)\n", "n = int(input())\r\ns = input()\r\nkcount = 0\r\nalpha = [0]*26\r\n\r\nif ord(s[1]) - 65 != ord(s[0]) - 97:\r\n kcount += 1\r\n alpha[ord(s[0])-97] += 1\r\n\r\n#print(kcount)\r\nfor i in range(2,len(s), 2):\r\n # print(s[i], s[i+1])\r\n lcase = ord(s[i])-97\r\n ucase = ord(s[i+1])-65\r\n alpha[lcase] += 1\r\n if lcase != ucase:\r\n kcount += alpha[ucase] == 0\r\n alpha[ucase] -= alpha[ucase] != 0\r\n else:\r\n alpha[lcase] -= 1\r\n #print(kcount, lcase, ucase)\r\nprint(kcount)", "n = int(input())\r\nkeys = {}\r\ncount = 0\r\nstroke = input()\r\nfor char in stroke:\r\n if char.islower():\r\n if char in keys.keys(): \r\n keys[char] += 1\r\n else:\r\n keys[char] = 1\r\n else:\r\n char = char.lower()\r\n if char in keys.keys() and keys[char] > 0:\r\n keys[char] -= 1\r\n else:\r\n count += 1\r\nprint(count)", "def main():\n input()\n s = input()\n l, lmax = [0] * 26, [0] * 26\n for a, b in zip(s[::2], s[1::2]):\n l[ord(a) - 97] -= 1\n x = ord(b) - 65\n l[x] = y = l[x] + 1\n if lmax[x] < y:\n lmax[x] = y\n print(sum(x for x in lmax if x > 0))\n\n\nif __name__ == '__main__':\n main()", "import sys\r\nimport math\r\n \r\nn = int(input())\r\nst = input()\r\n\r\nv = [0] * 26\r\nres = 0\r\nfor i in range((n - 1) * 2):\r\n if(i % 2 == 0):\r\n v[ord(st[i]) - ord('a')] += 1\r\n else:\r\n k = ord(st[i].lower()) - ord('a')\r\n if(v[k] > 0):\r\n v[k] -= 1\r\n else:\r\n res += 1\r\n\r\nprint(res)", "n = int(input())\r\ns = input()\r\n# easy simulation\r\nans = 0\r\nfrom collections import defaultdict\r\nkeys = defaultdict(int)\r\nfor key,door in zip(s[0::2],s[1::2]):\r\n\tkeys[key.upper()] += 1\r\n\tif keys[door] > 0:\r\n\t\tkeys[door] -= 1\r\n\telse:\r\n\t\tans += 1\r\nprint(ans)", "input()\r\npath = input()\r\ncount = {}\r\nto_buy = 0\r\n\r\nfor val in path:\r\n if val.islower():\r\n count[val] = count.get(val, 0) + 1\r\n else:\r\n v = val.lower()\r\n if count.get(v, 0) > 0:\r\n count[v] -= 1\r\n else:\r\n to_buy += 1\r\nprint(to_buy)\r\n", "from collections import defaultdict\n\nn = int(input())\ns = input()\ncnt = defaultdict(int)\n\nans = 0\nfor c in s:\n if c.isupper() and cnt[c.lower()] > 0:\n cnt[c.lower()] -= 1\n elif c.isupper():\n ans += 1\n else:\n cnt[c] += 1\n\nprint(ans)\n \t\t \t\t\t\t \t \t \t \t\t \t \t\t \t", "n = int(input())\ns = input()\nhistory = dict()\ncount = 0\n\nfor i in range(0, 2 * n - 2, 2):\n code = s[i]\n if code in history:\n history[code] += 1\n else:\n history[code] = 1\n\n next_code = s[i + 1].lower()\n if next_code in history and history[next_code] > 0:\n history[next_code] -= 1\n else:\n count += 1\n\nprint(count)\n\n\t \t\t\t \t \t\t \t\t\t \t \t \t \t", "n = int(input())\n\nword = input()\nisKeyPos = True\nkeys = []\nbuy_key = 0\n\nfor i in range(26):\n keys.append(0)\n\nfor pos in range(len(word)):\n \n if(isKeyPos):\n keys[ord(word[pos])-97] += 1\n isKeyPos = False\n else:\n isKeyPos = True\n key_pos = ord(word[pos])-65\n if (keys[key_pos] == 0):\n buy_key += 1\n else: keys[key_pos] -= 1\n\nprint(buy_key)\n \t\t \t\t \t \t\t \t\t \t\t\t", "from collections import defaultdict\r\nn = int(input())\r\ns= input()\r\nbuy = 0\r\ndic = defaultdict(lambda : 0)\r\nfor i in range(len(s)):\r\n if i%2==0:\r\n dic[s[i]] +=1\r\n \r\n else:\r\n key = s[i].lower() \r\n if key in dic:\r\n dic[key] -=1\r\n if dic[key]==0:\r\n del dic[key]\r\n else: \r\n buy +=1\r\n\r\nprint(buy)", "from collections import defaultdict\r\n\r\nn = int(input())\r\ntry :\r\n while True:\r\n s = input()\r\n if(len(s)>0):\r\n continue\r\n else:\r\n break\r\nexcept EOFError:\r\n pass\r\nd = defaultdict(int)\r\n\r\nans = 0 \r\n\r\nfor i in s:\r\n if(i>='A' and i<='Z'):\r\n if(d[i.lower()]>0):\r\n d[i.lower()]-=1\r\n else:\r\n ans+=1\r\n if(i>='a' and i<='z'):\r\n d[i]+=1\r\n\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nans = 0\r\ncnt = [0] * 26\r\nfor i in s:\r\n if i >= 97:\r\n cnt[i - 97] += 1\r\n elif not cnt[i - 65]:\r\n ans += 1\r\n else:\r\n cnt[i - 65] -= 1\r\nprint(ans)", "# import sys\r\n# sys.stdin = open('/Users/sarib/Desktop/Python /CP/5/input.txt', 'r')\r\n# sys.stdout = open('/Users/sarib/Desktop/Python /CP/5/output.txt', 'w')\r\n\r\n\r\nn = int(input())\r\nhashmap = dict()\r\ns = input()\r\ncnt = 0\r\n\r\nfor i in range(len(s)):\r\n\r\n if i % 2 == 0:\r\n hashmap[s[i]] = hashmap.get(s[i], 0)+1\r\n else:\r\n if hashmap.get(s[i].lower(), 0):\r\n hashmap[s[i].lower()] = hashmap.get(s[i].lower(), 0)-1\r\n else:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n ans = 0\r\n d = dict()\r\n for ch in s:\r\n if ch.islower():\r\n if ch not in d:\r\n d[ch] = 0\r\n d[ch] += 1\r\n else:\r\n ch = ch.lower()\r\n if ch not in d:\r\n d[ch] = 0\r\n if d[ch] == 0:\r\n ans += 1\r\n else:\r\n d[ch] -= 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import Counter\n\nn = int(input())\ns = input()\nnkeys = Counter()\ncnt = 0\nfor i in range(n-1):\n nkeys[s[i*2]] += 1\n door = s[i*2+1].lower()\n if nkeys[door] > 0:\n nkeys[door] -= 1\n else:\n cnt += 1\nprint(cnt)\n", "# vitality and pie\ndoors = int(input())\nkeys = [0]*26\nsequence = input()\ncontador = 0\nfor i in range(len(sequence)):\n valueAscii = ord(sequence[i])\n if valueAscii >= 65 and valueAscii <= 90: # é porta\n if keys[valueAscii-65] == 0: contador += 1 # não tem chave\n else: keys[valueAscii-65] -= 1 # tem chave\n else: # é chave\n keys[valueAscii-97] += 1 # soma no todo\n\nprint(contador)\n\t \t\t\t\t\t\t\t \t \t \t\t\t\t\t\t \t\t \t \t\t", "# print (\"Enter number of rooms\")\nn = int(input())\n# print (\"Enter the configuration\")\na = input()\ndic = {}\ntobuy = 0\nfor i in range((n-1)*2):\n if (i%2 == 0): # A key (small letter)\n ch = a[i]\n dic[ch] = dic.get(ch, 0)+1 # Clever way to either increment or add\n else: # A door--either open with a key, or add one to the count\n ch = a[i].lower()\n if ch in dic and dic[ch] > 0:\n dic[ch] = dic[ch] - 1 # Use the key\n else:\n tobuy = tobuy + 1\nprint (tobuy)\n \n \n \n \n \n", "n=int(input())\r\na=[0 for i in range(26)]\r\ns=input().strip()\r\nans=0\r\nfor i in range(n-1):\r\n a[ord(s[2*i])-97]+=1\r\n if a[ord(s[2*i+1])-65]>0:\r\n a[ord(s[2*i+1])-65]-=1\r\n else:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nd=dict.fromkeys(s,0)\r\nans=0\r\nfor i in range(2*n-2):\r\n if i%2==0:\r\n d[s[i]]+=1\r\n else:\r\n l=s[i].lower()\r\n if l in d:\r\n if d[l]>0:\r\n d[l]-=1\r\n else:ans+=1\r\n else:ans+=1\r\n\r\nprint(ans)", "n = int(input())\r\nd = {}\r\ns = input()\r\nneed = 0\r\nfor i in range(1,n*2-2,2):\r\n if s[i-1].upper() in d:\r\n d[s[i-1].upper()]+=1\r\n else:\r\n d[s[i-1].upper()]=1\r\n if s[i] in d and d[s[i]]>0:\r\n d[s[i]]-=1\r\n else:\r\n need+=1\r\n\r\nprint(need)", "n = int(input())\r\nkeys = {}\r\ndoors = input()\r\ni = 0\r\ntoBuy = 0\r\nwhile i<2*n-2:\r\n if i%2:\r\n try:\r\n if keys[doors[i].lower()]>0:\r\n keys[doors[i].lower()] -= 1\r\n else:\r\n toBuy += 1\r\n except:\r\n toBuy += 1\r\n else:\r\n keys[doors[i]] = keys.get(doors[i],0)+1\r\n\r\n i += 1\r\nprint(toBuy)\r\n", "n = int(input())\r\ns = input().lower()\r\ndict_ = dict()\r\nans = 0\r\nfor i in range(2 * n - 2):\r\n if i % 2 == 0:\r\n if s[i] not in dict_:\r\n dict_[s[i]] = 0\r\n dict_[s[i]] += 1\r\n else:\r\n if s[i] not in dict_ or dict_[s[i]] == 0:\r\n ans += 1\r\n else:\r\n dict_[s[i]] -= 1\r\nprint(ans)", "def main_function():\r\n n = int(input())\r\n s = input()\r\n hash_s = [0 for i in range(150)]\r\n counter = 0\r\n for i in range(len(s)):\r\n if s[i].islower():\r\n hash_s[ord(s[i])] += 1\r\n else:\r\n x = s[i].lower()\r\n if hash_s[ord(x)] > 0:\r\n hash_s[ord(x)] -= 1\r\n else:\r\n counter += 1\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "d = {}\r\nn = int(input())\r\ns = list(input().lower())\r\nk = 0\r\n\r\nfor i in range(len(s)):\r\n if i%2 == 0:\r\n d[s[i]] = d.get(s[i], 0) + 1\r\n else:\r\n if d.get(s[i], 0) == 0:\r\n k += 1\r\n else:\r\n d[s[i]] = d.get(s[i], 0) - 1\r\nprint(k) \r\n", "from collections import defaultdict\r\nn=int(input())\r\ns=input()\r\n\r\nd=defaultdict(int)\r\nans=0\r\nfor i in s:\r\n\tif 97<=ord(i)<=122:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\tx=chr(ord(i)+32)\r\n\t\tif d[x]>0:\r\n\t\t\td[x]-=1\r\n\t\telse:\r\n\t\t\tans+=1\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\nd={}\r\nc=0\r\nfor i in range(0,n*2-2,1):\r\n if i%2!=0:\r\n temp=s[i].lower()\r\n if temp in d and d[temp]!=0:\r\n d[temp]-=1\r\n else:\r\n c+=1\r\n else:\r\n if s[i] in d:\r\n d[s[i]]+=1\r\n else:\r\n d[s[i]]=1\r\nprint(c)", "n = int(input())\ns = input()\n\nabc = 'abcdefghijklmnopqrstuvwxyz'\nc = 0\nd = {}\nfor letra in abc:\n d[letra] = 0\nfor i in range(len(s)):\n if(i%2 == 0):#chave\n d[s[i]]+=1\n else:\n h = s[i].lower()\n if(d[h] != 0):\n d[h]-=1\n else:\n c+=1\nprint(c)\n", "input()\r\ns=input()\r\nd={}\r\nkey=0\r\nfor i in range(len(s)):\r\n #print(d,key)\r\n if(i%2!=0):\r\n if(s[i].lower() in d and d[s[i].lower()]>0):\r\n d[s[i].lower()]-=1\r\n else:\r\n key+=1\r\n else:\r\n if(s[i] in d):\r\n d[s[i]]+=1\r\n else:\r\n d[s[i]]=1\r\n\r\nprint(key)\r\n", "n = int(input())\r\nstring = input().lower()\r\nans = 0\r\nkeys = dict()\r\nfor i in range(-1, -2 * n + 1, -1):\r\n if i % 2 == 1:\r\n keys[string[i]] = keys.setdefault(string[i], 0) + 1\r\n else:\r\n if keys.get(string[i], 0) < 1:\r\n keys[string[i]] = 0\r\n else:\r\n keys[string[i]] -= 1\r\nfor i in keys.values():\r\n if i > 0:\r\n ans += i\r\nprint(ans)\r\n", "N = int(input())\nS = input()\n\nkeyd = {}\ndoord = {}\nans = 0\nfor i in range(0, 2 * N - 2, 2):\n key = S[i]\n door = S[i + 1]\n keyd[key] = keyd.get(key, 0) + 1\n if door.lower() in keyd.keys() and keyd[door.lower()] >= 1:\n keyd[door.lower()] -= 1\n else:\n ans += 1\nprint(ans)\n", "\r\n\r\n\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nkey ={}\r\n\r\n\r\nt = input()\r\nu=0\r\n\r\nfor k in range(len(t)):\r\n\r\n if 97<=ord(t[k])<=122:\r\n if t[k] in key:\r\n key[t[k]]+=1\r\n else:\r\n key[t[k]]=1\r\n else:\r\n\r\n if chr(ord(t[k])+32) in key:\r\n if key[chr(ord(t[k])+32)]>0:\r\n key[chr(ord(t[k])+32)]-=1\r\n else:\r\n u+=1\r\n else:\r\n u+=1\r\n \r\n\r\nprint(u)\r\n", "def main():\r\n n = int(input())\r\n s = input()\r\n s = [s[i] for i in range(len(s))]\r\n keys = {}\r\n buy = 0\r\n for i in range(1, 2 * n - 2, 2):\r\n keys[s[i - 1]] = keys.get(s[i - 1], 0) + 1\r\n remain = keys.get(s[i].lower(), 0)\r\n if (remain > 0):\r\n keys[(s[i].lower())] = remain - 1\r\n else:\r\n buy += 1\r\n return buy\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n=int(input())\r\ns=input()\r\ns=list(s)\r\nr=[]\r\nfor i in range(len(s)):\r\n\ts[i]=ord(s[i])\r\nc=0\r\nfor i in range(len(s)):\r\n\tif(97<=s[i]<=122):\r\n\t\tr.append(s[i])\r\n\telse:\r\n\t\tif(s[i]+32 in r):\r\n\t\t\tr.remove(s[i]+32)\r\n\t\telse:\r\n\t\t\tc=c+1\r\nprint(c)", "def solveOne():\r\n def insert(a, value):\r\n if value in a:\r\n a[value] += 1\r\n else:\r\n a[value] = 1\r\n\r\n n = int(input())\r\n s = input()\r\n have = dict()\r\n need = dict()\r\n for i in range(0, len(s), 2):\r\n key = s[i]\r\n door = s[i + 1]\r\n needKey = door.lower()\r\n if key == needKey:\r\n continue\r\n if key in have:\r\n have[key] += 1\r\n else:\r\n have[key] = 1\r\n if needKey in have:\r\n if have[needKey] == 0:\r\n insert(need, needKey)\r\n else:\r\n have[needKey] -= 1\r\n else:\r\n insert(need, needKey)\r\n result = 0\r\n for el in need.values():\r\n result += el\r\n print(result)\r\n\r\n\r\ndef main():\r\n t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n solveOne()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\n\r\ndef solve():\r\n n=int(input())\r\n s=input()\r\n count=0\r\n hashmap=[0 for i in range(26)]\r\n for x in s:\r\n if 97<=ord(x)<=122:\r\n index=ord(x)-97\r\n hashmap[index]+=1\r\n else:\r\n index=ord(x)-65\r\n if hashmap[index]==0:\r\n count+=1\r\n else:\r\n hashmap[index]-=1\r\n return count\r\n \r\n \r\nif __name__==\"__main__\":\r\n print(solve())\r\n ", "n=int(input())\r\na=input();l=dict();c=0\r\nfor i in range(len(a)):\r\n if a[i].isupper()!=True:\r\n if a[i] not in l.keys():\r\n l[a[i]]=1\r\n else:\r\n l[a[i]]+=1\r\n else:\r\n if a[i].lower() not in l.keys() or l[a[i].lower()]==0:\r\n c+=1\r\n else:\r\n l[a[i].lower()]-=1\r\nprint(c)", "n = int(input())\r\ndoors = input()\r\ncharList = [0] * 26\r\nres = 0\r\n\r\nfor char in doors:\r\n if char.islower():\r\n charList[ord(char) - ord('a')] += 1\r\n else:\r\n if charList[ord(char) - ord('A')] == 0:\r\n res += 1\r\n else:\r\n charList[ord(char) - ord('A')] -= 1\r\n\r\n\r\nprint(res)", "# unduplicate\nn = int(input())\nhouse = input()\n\nbought_keys = 0\nkey_map = dict()\nfor c in house:\n if c.islower():\n key_map.setdefault(c, 0)\n key_map[c] += 1\n continue\n\n key = c.lower()\n key_count = key_map.get(key, 0)\n if key_count == 0:\n bought_keys += 1\n else:\n key_map[key] -= 1\n\nprint(bought_keys)\n\t \t\t \t\t\t \t\t \t\t\t\t \t\t\t\t \t\t\t\t \t", "R=lambda:list(map(int,input().split()))\r\nn = int(input())\r\ns = input()\r\nb = {}\r\nc = 0\r\nfor x in s:\r\n if 'a' <= x <= 'z':\r\n if x in b:\r\n b[x] += 1\r\n else:\r\n b[x] = 1\r\n else:\r\n x = x.lower()\r\n if x in b:\r\n if b[x] > 0:\r\n b[x] -= 1\r\n else:\r\n c += 1\r\n else:\r\n c += 1\r\nprint(c)\r\n\r\n " ]

[ "def main():\n n, m = map(int, input().split())\n n += 1\n cluster, dest, ab = list(range(n)), [0] * n, [[] for _ in range(n)]\n\n def root(x):\n if x != cluster[x]:\n cluster[x] = x = root(cluster[x])\n return x\n\n for _ in range(m):\n a, b = map(int, input().split())\n ab[a].append(b)\n dest[b] += 1\n cluster[root(a)] = root(b)\n pool = [a for a, f in enumerate(dest) if not f]\n for a in pool:\n for b in ab[a]:\n dest[b] -= 1\n if not dest[b]:\n pool.append(b)\n ab = [True] * n\n for a, f in enumerate(dest):\n if f:\n ab[root(a)] = False\n print(n - sum(f and a == c for a, c, f in zip(range(n), cluster, ab)))\n\n\nif __name__ == '__main__':\n from sys import setrecursionlimit\n\n setrecursionlimit(100500)\n main()\n" ]

[ "w,e=divmod(int(input()),7)\nprint(w*2+int(e==6),w*2+min(e,2))\n", "n=int(input())\r\n\r\ndic={1:[0,1],2:[0,2],3:[0,2],4:[0,2],5:[0,2],6:[1,2],7:[2,2]}\r\nif n%7==0:\r\n temp=n//7\r\n print(temp*2,temp*2)\r\nelse:\r\n if n>7:\r\n a=n//7\r\n ma=a*2+dic[n%7][1]\r\n mi=a*2+dic[n%7][0]\r\n print(mi,ma)\r\n else:\r\n print(dic[n][0],dic[n][1])", "n = int(input())\nmin_holidays = (n // 7) * 2\nextra_days = (n % 7)\nmax_holidays = min_holidays\nif extra_days == 6:\n min_holidays += 1\nif extra_days > 2:\n max_holidays += 2\nelse:\n max_holidays += extra_days\nprint(min_holidays, max_holidays)\n\t \t\t\t \t \t \t \t \t \t\t\t \t \t\t", "n=int(input())\r\nmin1,max1=0,0\r\nn1=n\r\nflag=0\r\nwhile(n1>0):\r\n if(n1>5 and flag%2==0):\r\n n1-=5\r\n flag+=1\r\n elif(n1<=5 and flag%2==0):\r\n n1=0\r\n continue\r\n else:\r\n if(n1>2):\r\n n1-=2\r\n min1+=2\r\n else:\r\n min1+=n1 \r\n n1=0\r\n\r\n flag+=1\r\n\r\nflag=0\r\nn1=n\r\n\r\nwhile(n1>0):\r\n if(n1>2 and flag%2==0):\r\n n1-=2\r\n max1+=2\r\n flag+=1\r\n elif(n1<=2 and flag%2==0):\r\n max1+=n1 \r\n n1=0\r\n continue\r\n else:\r\n if(n1>5):\r\n n1-=5\r\n else:\r\n n1=0\r\n flag+=1\r\n\r\nprint(min1,max1)\r\n\r\n\r\n\r\n", "k = int(input())\r\n\r\nleft_over = k % 7\r\n\r\nn = ((k - left_over) // 7) * 2\r\n\r\nif left_over == 1:\r\n print(n, n + 1)\r\nelif left_over == 6:\r\n print(n + 1, n + 2)\r\nelif left_over == 0:\r\n print(n, n)\r\nelse:\r\n print(n, n + 2)\r\n\r\n\r\n\r\n\r\n# if n > 7:\r\n# total = n // 7\r\n# left_over = n % 7\r\n# if left_over >= 1:\r\n#\r\n# maybe = total + left_over\r\n# else:\r\n# maybe = off\r\n#\r\n# print(off, maybe)\r\n#\r\n# elif n == 7:\r\n# print(\"2 2\")\r\n#\r\n# elif n == 1:\r\n# print(\"0 1\")\r\n#\r\n# else:\r\n# print(0, 2)\r\n", "n=int(input())\r\nprint(2*(n//7)+(n%7)//6,2*((n+5)//7)+((n+5)%7)//6)", "n = int(input())\r\ns_num = 2*(n//7)\r\nl_num = 2*(n//7)\r\nif n%7 >= 2:\r\n l_num+=2\r\nelif n%7 == 1:\r\n l_num += 1\r\nif n%7 == 6:\r\n s_num += 1\r\n\r\nprint(s_num, l_num)", "n = int(input())\r\na = n//7\r\nb = n%7\r\nc = (n//7)*2\r\nd = n+1\r\nif n%7 != 0 and (n+1)%7 != 0:\r\n if n%7 >= 2:\r\n print(f'{c} {c+2}')\r\n else:\r\n print(f'{c} {c+1}')\r\nelif n == d-1 and d%7 == 0:\r\n print(f'{c+1} {c+2}')\r\nelse:\r\n print(f'{c} {c}')\r\n", "from math import*\r\na = int(input())\r\nmin=0\r\nmax=0\r\nif a%7==1:\r\n min=(a//7)*2\r\n max=(a//7)*2+1\r\n\r\nelif a%7>=2 and a%7<=5:\r\n min=(a//7)*2\r\n max=(a//7)*2+2\r\n\r\nelif a%7==6:\r\n min=(a//7)*2+1\r\n max=(a//7+1)*2\r\n \r\nelse:\r\n min=max=a//7*2\r\nprint (min,max)\r\n", "a = int(input())\r\nprint((a // 7) * 2 + (1 if a % 7 == 6 else 0), (a // 7) * 2 + min(2, a % 7))\r\n", "n = int(input())\r\nsmall_num = 2*(n//7)\r\nlarge_num = small_num\r\nr = n%7\r\nif r == 1:\r\n large_num += 1\r\nelif r >= 2:\r\n large_num+=2\r\n\r\nif r == 6:\r\n small_num += 1\r\n\r\nprint(small_num, large_num)", "n = int(input())\r\nnpd, npn = n % 7, n // 7\r\n\r\nif npd == 6: \r\n min = npn * 2 + 1\r\nelse: \r\n min = npn * 2 \r\n\r\nif npd == 1: \r\n max = npn * 2 + 1\r\nelif npd >= 2: \r\n max = npn * 2 + 2\r\nelse: \r\n max = npn * 2 \r\n\r\nprint(str(min) + ' ' +str(max))", "n = int(input())\r\n \r\nx = n//7\r\ny = n%7\r\n \r\nprint(2*x+max(0,y-5) , 2*x+min(y,2))", "a=int(input())\r\nb=a//7\r\nmax_ned=b*2\r\nmin_ned=b*2\r\nif a%7==6:\r\n min_ned+=1\r\nif a%7==1:\r\n max_ned+=1\r\nelif a%7==0:\r\n pass\r\nelse:\r\n max_ned+=2\r\nprint(min_ned, max_ned)", "import math\nd = int(input())\nk = (d//7) * 2\ne = (d%7)\n\nif e == 0:\n print(k, k)\nelif e == 1:\n print(k, k+1)\nelif e in [2,3,4,5]:\n print(k, k+2)\nelif e == 6:\n print(k+1, k+2)\n", "n = int(input())\nw,e = n//7,n%7\nprint(w*2+(1 if e>5 else 0), w*2+(2 if e>2 else e))\n", "a = int(input())\r\nprint (2*(a//7)+max(0,(a%7)-5), 2*(a//7)+ min(a%7,2))", "days = int(input())\r\nholy = (days//7) * 2 \r\ndaysmax = holy \r\nrest = days % 7 \r\nif rest > 5 :\r\n holy += 1\r\nif rest == 1 :\r\n daysmax += 1\r\nif rest > 1 :\r\n daysmax += 2 \r\nprint(holy , daysmax) ", "n = int(input())\nif n%7>=2 and n%7<=5:\n h = int((n//7 +1)*2)\n m = int((n//7)*2)\nif n%7==6:\n h = int((n//7+1)*2)\n m = int(((n//7)*2)+1)\nif n%7 ==1:\n h = int((n//7)*2+1)\n m = int((n//7)*2)\nif n%7==0:\n h = int((n//7)*2)\n m = h\nprint(m,h)", "mx, mi, n = 0, 0, int(input())\r\nmx, t = mx + min(5, n), n - min(n, 7)\r\nprint(n - (mx + min(t % 7, 5) + t // 7 * 5), end = \" \")\r\nt = n - min(n, 2)\r\nmi, t = mi + min(5, t), t - min(7, t)\r\nprint(n - (mi + min(t % 7, 5) + t // 7 * 5))", "n=int(input())\r\nr=n%7\r\nd=n//7\r\nprint(2*d+max(0,r-5),2*d+min(r,2))", "n=int(input())\r\nr=n%7\r\nq=int(n/7)\r\nif r>=2:\r\n k=2\r\nelse:\r\n k=r\r\nmaxi=(2*q)+k \r\nmini=2*q\r\nif r==6:\r\n mini+=1\r\nprint(mini,maxi)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[3]:\n\n\nn = int(input())\nr = n%7\nq = int(n/7)\n\nif r==0:\n maxd = 0\n mind = 0\n\nelif r>1:\n maxd = 2\n if r == 2 or r==3 or r==4 or r==5: \n mind = 0\n elif r==6:\n mind = 1\n \nelif r==1:\n maxd = 1\n mind = 0\n \nmaxOff = (q*2) + maxd\nminOff = (q*2) + mind\n\nprint(minOff, maxOff)\n\n", "a = int(input())\r\nb = (a // 7) * 2\r\nc = a % 7\r\nif c == 6:\r\n print(b+1,b + min(2,a % 7))\r\nelse:\r\n print(b,b + min(2,a % 7))", "n=int(input())\r\nif n%7==0:\r\n a=(n//7) *2\r\n print(a,a)\r\nelif n%7==1:\r\n mi=(n//7)*2\r\n ma=mi+1\r\n print(mi,ma)\r\nelif n%7==2 or n%7==3 or n%7==4 or n%7==5:\r\n mi=(n//7)*2\r\n ma=mi+2\r\n print(mi, ma)\r\nelse:\r\n mi =(n//7)*2+1\r\n ma = mi+1\r\n print(mi, ma)", "n = int(input())\r\n\r\ndef maximum(n):\r\n num = n//7\r\n max_num = num*2\r\n if n - (num*7) >= 2:\r\n max_num += 2\r\n elif n - (num*7) == 1:\r\n max_num += 1\r\n return (max_num)\r\n\r\ndef minimum(n):\r\n num = n//7\r\n min_num = num*2\r\n if (n - (num*7)) > 5:\r\n min_num += 1\r\n return (min_num)\r\n \r\nprint(minimum(n), maximum(n))\r\n ", "d = int(input())\n\nresto = d % 7\n\nmi = (d // 7) * 2 + (1 if resto == 6 else 0)\nma = (d // 7) * 2 + (2 if resto >= 2 else 1 if resto == 1 else 0)\n\nprint(mi, ma)\n", "N = int(input())\r\nprint(N // 7 * 2 + max(0, N % 7 - 5), N // 7 * 2 + min(2, N % 7))", "t = int(input())\r\ndem = t//7*2\r\nt%=7\r\nif t>5: print(dem+t-5,dem+2)\r\nelif t>2: print(dem,dem+2)\r\nelse: print(dem,dem+t)", "n = int(input())\r\nc = (n // 7)*2\r\nr = n % 7 \r\nif r == 0:\r\n print(c,c)\r\nelif r == 1:\r\n print(c,c+1) \r\nelif r >= 2 and r < 6:\r\n print(c,c+2) \r\nelse:\r\n print(c+1,c+2) ", "n = int(input())\r\n\r\nremainder = n % 7\r\n\r\nweeks = n // 7\r\n\r\nminDays = weeks * 2\r\nmaxDays = minDays\r\n\r\n\r\nif remainder == 1:\r\n maxDays += 1\r\nelif 2 <= remainder <= 5:\r\n maxDays += 2\r\nelif remainder == 6:\r\n minDays += 1\r\n maxDays += 2\r\n\r\nprint(minDays, maxDays)\r\n", "n = int(input())\r\nw = n//7\r\n\r\nmi, ma = w*2, w*2\r\n\r\n\r\nma += min(2, n%7)\r\n\r\nif (5<=n%7):\r\n mi += n%7-5\r\n\r\nprint(mi, ma)", "n=int(input())\r\nm=(n//7)*2\r\nq=n//7\r\nr=n%7\r\nif r==6:\r\n print(m+1,(q*2)+2)\r\nelif r <=2:\r\n print(m,(q*2)+r)\r\nelse:\r\n print(m,(q*2)+2)\r\n", "def main():\r\n n = int(input())\r\n nw = n // 7\r\n nd = n % 7\r\n\r\n mn = nw * 2\r\n mx = nw * 2 + min(nd, 2)\r\n\r\n if nd > 5:\r\n mn += 1\r\n\r\n print(mn, mx)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nprint(2*(n//7)+(1 if n%7==6 else 0),2*(n//7)+min((n%7),2))", "n = int(input())\r\n\r\nq, r = divmod(n, 7)\r\ntq = q << 1\r\nmn = tq + (r == 6)\r\nmx = tq + min(2, r)\r\n\r\nprint(mn, mx)\r\n", "n=int(input())\r\nm=n//7\r\nbig=m*2\r\nsmall=m*2\r\n\r\nz=n%7\r\nif z==1:\r\n big+=1\r\nelif z>=2 and z<6:\r\n big+=2\r\nelif z==6:\r\n big+=2\r\n small+=1\r\n\r\nprint(small,big)", "n=int(input())\r\nv=n//7\r\nr=n%7\r\nif r==0:\r\n print(v*2,v*2)\r\nelse:\r\n if r==6:\r\n print(v*2+1,v*2+2)\r\n elif r==1:\r\n print(v*2,v*2+1)\r\n else:\r\n print(v*2,v*2+2)\r\n", "#670A: Holidays\r\ndays = int(input())\r\nrem = days%7\r\nif rem > 2:\r\n rem = 2\r\nmindays = int(days/7) * 2\r\nmaxdays = mindays + rem\r\nif (days + 1) % 7 == 0:\r\n mindays += 1\r\nprint(str(mindays) + \" \" + str(maxdays))", "n = int(input())\r\na = ((n//7)*2) + min(n%7, 2)\r\nb = ((n//7)*2) + max(0, (n%7)-5)\r\nprint(b, a)", "n=int(input())\r\noff1,off2=0,0\r\nm=n\r\nwhile(n>0):\r\n n-=1\r\n if(n>=0):\r\n off1+=1\r\n n-=1\r\n if(n>=0):\r\n off1+=1\r\n if(n<0):\r\n break\r\n n-=5\r\nwhile(m>0):\r\n m-=5\r\n if(m<=0):\r\n break\r\n m-=1\r\n if(m>=0):\r\n off2+=1\r\n m-=1\r\n if(m>=0):\r\n off2+=1\r\nprint(\"{} {}\".format(off2,off1))\r\n\r\n\r\n\r\n", "def solve(d):\r\n mn=1000000000\r\n mx=-mn\r\n for i in range(7):\r\n tmp=0\r\n for j in range(d):\r\n if (i+j)%7>=5:\r\n tmp+=1\r\n mn=min(mn,tmp)\r\n mx=max(mx,tmp)\r\n return str(mn)+ \" \" + str(mx)\r\n\r\nd=int(input())\r\nprint(solve(d))\r\n", "n = int(input())\r\nned = n//7\r\nif n%7==0:\r\n print(ned*2,ned*2)\r\nelif n%7==1:\r\n print(ned*2,ned*2+1)\r\nelif n%7==6:\r\n print(ned*2+1,ned*2+2)\r\nelif n%7==2:\r\n print(ned*2,ned*2+2)\r\nelse:\r\n print(ned*2,ned*2+2)\r\n \r\n", "n = int(input())\nd, r = divmod(n, 7)\nres = 2 * d + (r == 6), 2 * d + min(2, r)\nprint(*res)\n", "x = int(input())\r\nval1 = (x//7) * 2\r\nxx = x % 7\r\nif xx > 2:\r\n add2 = 2\r\nelse:\r\n add2 = xx\r\nif xx == 6:\r\n add1 = 1\r\nelse:\r\n add1 = 0\r\nval2 = val1 + add2\r\nval1 = val1 + add1\r\nprint(f\"{val1} {val2}\")", "n=int(input())\r\nmini=1000000\r\nmaxi=0\r\nfor i in range(7):\r\n day=i\r\n year=[]\r\n daysoff=0\r\n for j in range(n):\r\n year.append(day)\r\n day+=1\r\n day=day%7\r\n if(day==0 or day==6):\r\n daysoff+=1\r\n #print(year)\r\n #print(daysoff)\r\n mini=min(daysoff,mini)\r\n maxi=max(maxi,daysoff)\r\nprint(mini,maxi)", "def holidaymax(n):\r\n # if n<=0:\r\n # return 0\r\n # elif 0<n<=2:\r\n # return n\r\n # else:\r\n # return 2+holidaymax(n-7)\r\n sum=0\r\n while (n>0):\r\n if n<=2:\r\n sum=sum+n\r\n else:\r\n sum=sum+2\r\n n=n-7\r\n return sum\r\n\r\n\r\ndef holidaymin(n):\r\n # if n<=5:\r\n # return 0\r\n # elif 5<n<=7:\r\n # return n-5\r\n # else:\r\n # return 2+holidaymin(n-7)\r\n rum=0\r\n while (n>5):\r\n if n<=7:\r\n rum=rum+n-5\r\n else:\r\n rum=rum+2\r\n n=n-7\r\n return rum\r\nn=int(input())\r\nprint(holidaymin(n),holidaymax(n))", "n=int(input())\r\ni=n//7*2+(int)(n%7==6)\r\na=n//7*2+min(2,n%7)\r\nprint(str(i)+\" \"+str(a))", "def main():\r\n n = int(input())\r\n \r\n if n % 7 == 6:\r\n min_val = (n // 7) * 2 + 1\r\n else:\r\n min_val = (n // 7) * 2\r\n \r\n if n % 7 == 1:\r\n max_val = min_val + 1\r\n elif n % 7 >= 2:\r\n if n % 7 == 6:\r\n max_val = min_val + 1\r\n else:\r\n max_val = min_val + 2\r\n else:\r\n max_val = min_val\r\n \r\n print(min_val, max_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\np=n//7\r\nm=n%7\r\nif m>=2:\r\n print((n//7)*2+(m//6),(n//7)*2+2)\r\nelse:\r\n print((n//7)*2,(n//7)*2+m)", "n = int(input())\r\nif n % 7 > 5:\r\n print(n // 7 * 2 + n % 7 - 5, end = \" \")\r\nelse:\r\n print(n//7*2, end=\" \")\r\nif n % 7 == 0:\r\n print(n // 7 * 2)\r\nelif n % 7 == 1:\r\n print(n//7*2+1)\r\nelse:\r\n print(n//7*2+2)", "n=int(input())\r\nm=(n//7)*2\r\nmax=((n-2)//7)*2\r\nx=n%7\r\nmx=(n-2)%7\r\nif x==6:\r\n\tm=m+1\r\nif mx==6:\r\n\tmax+=1\r\nprint(m,max+2)", "n = int(input())\r\n\r\nif n % 7 == 0:\r\n a = n // 7 * 2\r\n print(a, a)\r\nelif n % 7 == 1:\r\n a = n // 7 * 2\r\n print(a , a + 1)\r\nelif n % 7 == 2:\r\n a = n // 7 * 2\r\n print(a, a + 2)\r\nelif n % 7 == 3:\r\n a = n // 7 * 2\r\n print(a, a + 2)\r\nelif n % 7 == 4:\r\n a = n // 7 * 2\r\n print(a, a + 2)\r\nelif n % 7 == 5:\r\n a = n // 7 * 2\r\n print(a, a + 2)\r\nelif n % 7 == 6:\r\n a = n // 7 * 2\r\n print(a + 1, a + 2)", "n = int(input())\r\nk = n // 7 * 2 + min(n % 7, 2)\r\nprint(n // 7 * 2 + max(n % 7 - 5, 0), k)\r\n", "n = int(input()); mn = None\r\nif n % 7 == 6: mn = 1\r\nelse: mn = 0\r\nprint(n // 7 * 2 + mn, n // 7 * 2 + min(2, n % 7))", "n = int(input())\r\nmx = n // 7 * 2 + min(n%7, 2)\r\nmn = n // 7 * 2 + max(n%7-5, 0)\r\n\r\nprint(mn, mx)\r\n\r\n\r\n", "n=int(input())\r\nprint(n//7+(n+1)//7,(n+5)//7+(6+n)//7)", "\r\nn = int(input())\r\nif n%7>=2:\r\n\tmx = 2*(n//7) + 2\r\nelse:\r\n\tmx = 2*(n//7) + n%7\r\n\r\nif n%7<=5:\r\n\tmn = 2*(n//7)\r\n\r\nelse:\r\n\tmn = 2*(n//7) + 1\r\n\r\nprint(mn,mx)", "n = int(input())\na = n // 7\nb = n % 7\ncnt2 = a * 2\nif b == 6:\n cnt2 += 1\ncnt1 = a * 2\nif b == 1:\n cnt1 += 1\nif b >= 2:\n cnt1 += 2\nprint(cnt2, cnt1)", "n = int(input())\nif n%7 == 0:\n print(n//7*2,n//7 * 2)\nelif n%7 ==1:\n print(n // 7 * 2, n // 7 * 2+1)\nelif n%7 >= 2 and n%7 <= 5:\n print(n // 7 * 2, n // 7 * 2+2)\n\nelse:\n print(n//7 * 2+1,n//7*2+2)\n\n\n\n", "\r\nnumber_of_days = int(input())\r\nnumber_of_weeks = number_of_days//7\r\nmin_day_off = (number_of_weeks*2)\r\nmax_day_of = (number_of_weeks*2)\r\nif(number_of_days%7 > 2):\r\n max_day_of = max_day_of+2\r\nelse:\r\n max_day_of = max_day_of+number_of_days%7\r\n \r\nif(number_of_days%7 > 5):\r\n day = number_of_days%7 \r\n min_day_off = min_day_off+7-day\r\nprint(min_day_off , max_day_of)", "n = int(input())\r\nx = n//7*2\r\nrem = n-(n//7)*7\r\nif rem>5:\r\n print(x+1,x+2)\r\nelse:\r\n if rem>2:\r\n print(x,x+2)\r\n else:\r\n print(x,x+rem)", "print(2*((n:=int(input()))//7)+((n%7-5) if 5<=n%7 else 0),n//7*2+min(2,n % 7))", "n = int(input())\r\nmin = 0\r\nmax = 0\r\n\r\nif n % 7 == 6:\r\n min = (n // 7) * 2 + 1\r\nelse:\r\n min = (n // 7) * 2\r\n\r\nif n % 7 == 1:\r\n max = min + 1\r\nelif n % 7 >= 2:\r\n if n % 7 == 6:\r\n max = min + 1\r\n else:\r\n max = min + 2\r\nelse:\r\n max = min\r\n\r\nprint(min, max)\r\n", "n = int(input())\r\nweeks = (n // 7) * 2\r\nremaining_days = n % 7\r\n\r\nmin_days_off = weeks + (1 if remaining_days == 6 else 0)\r\nmax_days_off = weeks + min(2, remaining_days)\r\n\r\nprint(min_days_off, max_days_off)\r\n", "n = int(input())\r\nif n == 1:\r\n print(0, 1)\r\nelse:\r\n print(n // 7 * 2 + n % 7 // 6, end = ' ')\r\n n -= 2\r\n print(n // 7 * 2 + 2 + n % 7 // 6)\r\n", "# A. Holidays\r\n\r\n# Based on https://codeforces.com/contest/670/submission/18031374\r\n\r\nn = int(input())\r\n\r\nquotient, reminder = divmod(n, 7)\r\n\r\nholidays_in_full_weeks = 2 * quotient\r\n\r\n# Full week is taken into account in quotient\r\n# The only exception is when reminder == 6 (saturday should be taken into account)\r\nmn = holidays_in_full_weeks + (reminder == 6)\r\n\r\n# if the week starts on holiday\r\nmx = holidays_in_full_weeks + min(reminder, 2)\r\n\r\nprint(mn, mx)\r\n", "n = int(input())\ncycle = n // 7\nremain = n % 7\nif remain <= 2:\n min_offdays = cycle * 2\n max_offdays = cycle * 2 + remain\nelif 2 < remain <= 5:\n min_offdays = cycle * 2\n max_offdays = cycle * 2 + 2\nelse:\n min_offdays = cycle * 2 + 1\n max_offdays = cycle * 2 + 2\nprint(min_offdays, max_offdays)\n \t \t\t\t \t\t \t\t \t\t \t\t \t \t\t \t \t", "n = int(input())\nleast = (n//7)*2\nmaxi = least\nif n%7 ==6:\n least +=1\nif n % 7 >1:\n maxi+=2\nelse:\n maxi+= n%7\nprint(least,maxi)", "n = int(input())\r\nf = n // 7 * 2\r\nif n % 7 == 0:\r\n print(f, f)\r\nelif 2 <= n % 7 <= 5:\r\n print(f, f + 2)\r\nelif n % 7 == 6:\r\n print(f + 1, f + 2)\r\nelse:\r\n print(f, f + 1)", "n=int(input())\r\nr=n%7\r\nmn,mx=2*(n//7),2*(n//7)\r\nif r>0:\r\n if r<=5:\r\n if r==1:\r\n mx+=1\r\n else:\r\n mx+=2\r\n else:\r\n mn+=1\r\n mx+=2\r\nprint(mn,mx)\r\n", "n = int(input())\r\nif n%7 == 6:\r\n min = (n//7)*2 + 1\r\nelse: \r\n min = (n//7)*2\r\nif n%7 >=2:\r\n max = ((n+7)//7)*2\r\nelif n%7 == 0:\r\n max = (n//7)*2\r\nelif n%7 == 1:\r\n max = (n//7)*2 + 1\r\nprint(min, max)\r\n ", "I = int(input())\r\n\r\nremainder = I % 7\r\n\r\nfull_weeks = I // 7\r\n\r\nif remainder == 6:\r\n least_holiday = 2 * full_weeks + 1\r\n print(least_holiday, end = \" \")\r\nelif remainder < 6:\r\n print(2 * full_weeks, end = \" \")\r\n \r\nif remainder > 2:\r\n most_holiday = 2 * full_weeks + 2\r\n print(most_holiday)\r\nelif remainder <= 2:\r\n most_holiday = 2 * full_weeks + remainder\r\n print(most_holiday)\r\n \r\n\r\n", "n = int(input())\r\nif n % 7 == 6:\r\n min_weeks = (n // 7) * 2 + 1\r\nelse:\r\n min_weeks = (n // 7) * 2\r\n\r\nif n % 7 == 1:\r\n max_weeks = min_weeks + 1\r\nelif n % 7 >= 2:\r\n if n % 7 == 6:\r\n max_weeks = min_weeks + 1\r\n else:\r\n max_weeks = min_weeks + 2\r\nelse:\r\n max_weeks = min_weeks\r\n\r\nprint(min_weeks, max_weeks)\r\n", "n=int(input());print(2*(n//7)+max(n%7-5,0),2*(n//7)+min(n%7,2))", "n = int(input())\r\nif n % 7 == 6:\r\n x = (n+1)//7*2-1\r\nelse:\r\n x = (n//7)*2\r\nif n%7 == 1:\r\n y = (n//7)*2 + 1\r\nelif n % 7 == 0:\r\n y = (n//7)*2\r\nelse:\r\n y = (n//7)*2+2\r\nprint(f\"{x} {y}\")", "n = int(input())\r\nif n % 7 == 6:\r\n min_val = (n // 7) * 2 + 1\r\nelse:\r\n min_val = (n // 7) * 2\r\nif n % 7 == 1:\r\n max_val = min_val + 1\r\nelif n % 7 >= 2:\r\n if n % 7 == 6:\r\n max_val = min_val + 1\r\n else:\r\n max_val = min_val + 2\r\nelse:\r\n max_val = min_val\r\nprint(min_val, max_val)\r\n", "n=int(input())\nbase = n // 7 * 2\nyu = n % 7\nif 2 < yu < 6:\n print(base, base + 2)\nelif yu == 6:\n print(base+1, base + 2)\nelse:\n print(base, base + yu)\n\n\n\t\t \t\t\t \t\t \t\t \t\t \t \t\t\t\t", "n = int(input())\r\nlarge_l = [0,1,2,2,2,2,2]\r\nsmall_l = [0,0,0,0,0,0,1]\r\nsmall_num = 2*(n//7)\r\nlarge_num = small_num\r\nr = n%7\r\nprint(small_num+small_l[r], large_num+large_l[r])# Write your code here :-)\r\n", "n = int(input())\r\n\r\ng = n - n // 7 * 7\r\nif g >= 2:\r\n g = 2\r\nprint(n // 7 * 2 + (n - n // 7 * 7) // 6, n // 7 * 2 + g)\r\n", "import math\r\nn = int(input())\r\nprint((math.floor((n+1)/7) + math.floor((n)/7)), (math.floor((n+6)/7) + math.floor((n+5)/7)))", "# LUOGU_RID: 101607909\nn = int(input())\r\nprint(n // 7 + (n + 1) // 7, (n + 5) // 7 + (n + 6) // 7)\r\n", "n=int(input())\r\nc=n//7+(n+1)//7\r\nh=(n+5)//7+(n+6)//7\r\nprint(c, h)\r\n", "### Automatically created via \"randomTaskGenerator\" ###\r\n### Link to the task: \"https://codeforces.com/problemset/problem/670/A ###\r\n\r\ndays = ['work', 'work', 'work', 'work', 'work', 'relax', 'relax']\r\nyear = int(input())\r\n\r\nweek = year // 7\r\nday = year % 7\r\nif year % 7 == 0:\r\n answer = [week * 2, week * 2]\r\nelif week > 0:\r\n answer = [week * 2 + 1 * (day == 6), week * 2 + 2 * (day >= 2) + 1 * (1 <= day < 2)]\r\nelse:\r\n answer = [0 + 1 * (day == 6), 1 + 1 * (day > 1)]\r\nprint(*answer)", "ans, ans1 = 0, 0\r\nn = int(input())\r\nn1, sp, i, sp1 = n, [5, 1, 1], 0, [1, 1, 5]\r\nwhile n > 0:\r\n if sp[i % 3] != 5:\r\n ans += 1\r\n n -= sp[i % 3]\r\n i += 1\r\ni = 0\r\nwhile n1 > 0:\r\n if sp1[i % 3] != 5:\r\n ans1 += 1\r\n n1 -= sp1[i % 3]\r\n i += 1\r\nprint(ans, ans1)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans1, ans2 = 0, 0\r\nfor i in range(n):\r\n if i % 7 >= 5:\r\n ans1 += 1\r\n elif i % 7 < 2:\r\n ans2 += 1\r\nprint(ans1, ans2)", "N = int(input())\r\nfixed = 2*(N//7)\r\nif (N%7 == 0): print(fixed, fixed)\r\nelif (N%7 <= 5): print(fixed, fixed+min(2,N%7))\r\nelse: print(fixed+1, fixed+2)", "n = int(input())\r\n\r\nprint(2 * (n // 7) + (1 if n % 7 == 6 else 0), 2 * (n // 7) + (n % 7 if n % 7 < 2 else 2))", "n = int(input())\r\na=n//7\r\nb=n-7*a\r\nc = 2*a\r\nif b==6:\r\n print((c+1),(c+2))\r\nelif b==5:\r\n print((c), (c + 2))\r\nelif b==4:\r\n print((c), (c + 2))\r\nelif b==3:\r\n print((c), (c + 2))\r\nelif b==2:\r\n print((c), (c + 2))\r\nelif b==1:\r\n print((c), (c + 1))\r\nelif b==0:\r\n print((c),(c))", "n = int(input())\r\nif n%7 == 6:\r\n v_min = n//7 * 2 + 1\r\nelse:\r\n v_min = n//7 * 2 \r\nv_max = n//7 * 2 + min(n%7, 2)\r\nprint(v_min, v_max)", "import math \r\nn=int(input())\r\n\r\nif(n%7==0):\r\n print(n//7*2, n//7*2)\r\nelif(n%7==1):\r\n print(n//7*2, n//7*2+1)\r\nelif(n%7==6):\r\n print(n//7*2+1, n//7*2+2)\r\nelse:\r\n print(n//7*2, n//7*2+2) ", "n=int(input())\r\nr=n%7\r\nif r==0:\r\n\tprint(n//7*2,n//7*2)\r\nelif r==6:\r\n\tprint(n//7*2+1,n//7*2+2)\r\nelif r==1:\r\n\tprint(n//7*2,n//7*2+1)\t\r\nelse:\r\n\tprint(n//7*2,n//7*2+2)", "i,j=divmod(int(input()),7)\r\nprint(2*i+(j==6),2*i+min(j,2))", "n=int(input())\r\nminn=0\r\nmaxx=0\r\nx=n\r\nn1=0\r\nn2=0\r\nwhile x!=0:\r\n if n1==0:\r\n if x>=5:\r\n x-=5\r\n n1=1\r\n else:\r\n x=0\r\n n1=1\r\n if n1==1:\r\n if x>=2:\r\n x-=2\r\n n1=0\r\n minn+=2\r\n else:\r\n minn+=x\r\n x=0\r\n n1=1\r\nprint(minn,end=' ')\r\nwhile n!=0:\r\n if n2==0:\r\n if n>=2:\r\n maxx=maxx+2\r\n n=n-2\r\n n2=1\r\n else:\r\n maxx=maxx+n\r\n n=0\r\n n2=1\r\n if n2==1:\r\n if n>=5:\r\n n=n-5\r\n n2=0\r\n else:\r\n n=0\r\n n2=0\r\nprint(maxx)\r\n \r\n", "n=int(input())\r\nif n%7>=2:\r\n x=2\r\nelse:\r\n x=n%7\r\nif n%7>=6:\r\n y=n%7-5\r\nelse:\r\n y=0\r\nz=(n//7)*2\r\nprint(z+y,z+x)", "n = int(input())\r\nminans = 0\r\nmaxans = 0\r\ni = 0\r\nj = 2\r\nfor d in range(n):\r\n if i % 7 <= 1:\r\n maxans += 1\r\n if j % 7 <= 1:\r\n minans += 1\r\n i = (i + 1) % 7\r\n j = (j + 1) % 7\r\nprint(minans, maxans)\r\n", "n = int(input())\r\na = n // 7\r\nb = n % 7\r\ncnt = 0\r\ncnt2 = 0\r\nif b == 6:\r\n cnt += 1\r\nif b <= 2:\r\n cnt2 += b\r\nelse:\r\n cnt2 += 2\r\nprint(2 * a + cnt, 2 * a + cnt2)", "n = int(input())\r\n\r\nprint((n // 7) * 2 + max(0, n % 7 - 5), (n // 7) * 2 + min(n % 7, 2))\r\n", "def solve():\r\n n = int(input())\r\n a = b = 0\r\n \r\n for i in range(n):\r\n if i % 7 == 5 or i % 7 == 6:\r\n a += 1\r\n if i % 7 == 0 or i % 7 == 1:\r\n b += 1\r\n \r\n print(a, b)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nprint(n // 7 * 2 + max(n % 7 - 5, 0), n // 7 * 2 + min(n % 7, 2))", "n = int(input())\r\nprint(((n//7)*2 + max(n%7-5, 0)), ((n//7)*2 + min(n%7, 2)))\r\n", "n=int(input())\r\nprint((n//7+n//7+max(n%7-5,0)),(n//7+n//7+min(2,n%7)))", "n=int(input())\r\nif n%7==0:\r\n m=2*(n/7)\r\n M=2*(n/7)\r\nelif n%7!=0:\r\n if (n%7)==6:\r\n m=(n//7)*2+1\r\n else:\r\n m=(n//7)*2\r\n if (n%7)==1:\r\n \r\n M=(n//7)*2+1\r\n else:\r\n M=(n//7)*2+2\r\nl=[int(m),int(M)]\r\nfor i in l:\r\n print(i,end=\" \")\r\n", "n=int(input())\r\nt1=(n//7)*2\r\nt2=0\r\nif n%7==1:\r\n\tt2=1\r\nelif n%7>=2:\r\n\tt2=2\r\nif n%7==6:\r\n\tt1+=1\r\n\tt2-=1\r\nprint(t1,t1+t2)", "N = int(input())\r\n\r\nVal = ( N // 7 )\r\nNum = N % 7\r\nif Num > 2:\r\n Maxx = (Val * 2) + 2\r\nelse:\r\n Maxx = ( Val * 2 ) + Num \r\n \r\nif Num <=5:\r\n Minn = ( Val * 2 )\r\nelse:\r\n Minn = ( Val * 2) + (7 - Num)\r\n \r\nprint(Minn,Maxx)", "n=int(input())\r\nif n%7==0:\r\n print((n//7)*2,(n//7)*2)\r\nelse:\r\n h=n-(n//7)*7\r\n if h==1:\r\n print((n//7)*2,(n//7)*2+1)\r\n elif h>1 and h<6:\r\n print((n//7)*2,(n//7)*2+2)\r\n else:\r\n print((n//7)*2+1,(n//7)*2+2)\r\n", "n = int(input())\r\nnpd, npn = n % 7, n // 7\r\n\r\nif npd == 6: min = npn * 2 + 1\r\nelse: min = npn * 2 \r\n\r\nif npd == 1: max = npn * 2 + 1\r\nelif npd >= 2: max = npn * 2 + 2\r\nelse: max = npn * 2 \r\n\r\nprint(str(min) + ' ' +str(max))", "n = int(input())\r\nmin_holidays = (n // 7) * 2\r\nmax_holidays = min_holidays\r\nif n % 7 == 6:\r\n min_holidays += 1\r\nif n % 7 >= 2:\r\n max_holidays += 2\r\nelse:\r\n max_holidays += n % 7\r\nprint(min_holidays, max_holidays)", "n = int(input())\nt = n // 7 * 2\n\nk = n % 7\nif k >= 5:\n print(t + k - 5, end = \" \")\nelse:\n print(t, end =\" \")\nif k >= 2:\n t += 2\nelse:\n t += k\nprint(t)", "n = int(input())\r\n\r\ndef f(x):\r\n if x < 0: return 0\r\n return (x // 7) * 2 + min(2, x % 7)\r\n\r\nprint(f(n-5), f(n))", "dayinyear = int(input())\r\na = []\r\n\r\nfor i in range(3):\r\n weekendleft = i\r\n weekend = True\r\n weekday = False\r\n weekdayleft = 0\r\n weekenddays = 0\r\n if weekendleft == 0:\r\n weekend = False\r\n weekday = True\r\n weekdayleft = 5 \r\n for day in range(dayinyear):\r\n if weekend:\r\n weekendleft -= 1\r\n weekenddays +=1\r\n if weekendleft == 0:\r\n weekend = False\r\n weekday = True\r\n weekdayleft = 5\r\n elif weekday:\r\n weekdayleft -= 1\r\n if weekdayleft == 0:\r\n weekday = False\r\n weekend = True\r\n weekendleft = 2\r\n a.append(weekenddays)\r\nprint(min(a), max(a))", "days=int(input())\n\nif days%7==0:\n print((days//7)*2, (days//7)*2)\n \nelif days%7==1:\n print((days//7)*2, (days//7)*2+1)\n \nelif days%7==2:\n print((days//7)*2, (days//7)*2+2)\n \nelif days%7==3:\n print((days//7)*2, (days//7)*2+2)\n\nelif days%7==4:\n print((days//7)*2, (days//7)*2+2)\n\nelif days%7==5:\n print((days//7)*2, (days//7)*2+2)\n\nelif days%7==6:\n print((days//7)*2+1, (days//7)*2+2)\nelif days<=2:\n print(0, days)\nelse:\n print(0, 2)\n", "n = int(input())\r\nif n%7 == 0:\r\n print(n//7*2,n//7*2)\r\nif n%7 == 1:\r\n print(n//7*2,n//7*2+1)\r\nif n%7 == 2:\r\n print(n//7*2,n//7*2+2)\r\nif n%7 == 3:\r\n print(n//7*2,n//7*2+2)\r\nif n%7 == 4:\r\n print(n//7*2,n//7*2+2)\r\nif n%7 == 5:\r\n print(n//7*2,n//7*2+2)\r\nif n%7 == 6:\r\n print(n//7*2+1,n//7*2+2)", "import math\r\n\r\nn = int(input())\r\n\r\n\r\n'''if n < 7:\r\n if n == 1:\r\n print(0)\r\n print(1)\r\n elif n == 6:\r\n print(1)\r\n print(2)\r\n else:\r\n print(0)\r\n print(2)\r\nelse:'''\r\nif n % 7 == 0:\r\n print(n//7*2, end=' ')\r\n print(n//7*2)\r\nelif n % 7 == 1:\r\n print(n // 7 * 2, end=' ')\r\n print(n // 7 * 2 + 1)\r\nelif n % 7 in (2, 3, 4, 5):\r\n print(n // 7 * 2, end=' ')\r\n print(n // 7 * 2+2)\r\nelse:\r\n print(n // 7 * 2+1, end=' ')\r\n print(n // 7 * 2+2)\r\n\r\n\r\n\r\n \r\n", "n=int(input())\r\nmin=0\r\nmax=0\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=1\r\n if(ans==6):\r\n min+=1\r\n if(ans==7):\r\n min+=1\r\n ans=0\r\nanss=0\r\nif(n==1):\r\n max=1\r\nelif(n==2):\r\n max=2\r\nelse:\r\n max+=2\r\n for i in range(3,n+1):\r\n anss+=1\r\n if(anss==6):\r\n max+=1\r\n if(anss==7):\r\n max+=1\r\n anss=0\r\nprint(min,max)\r\n", "n = int(input())\r\nif n % 7 == 6:\r\n md = (n // 7) * 2 + 1\r\nelse:\r\n md = (n // 7) * 2\r\n\r\nif n % 7 == 1:\r\n mxd = md + 1\r\nelif n % 7 >= 2:\r\n if n % 7 == 6:\r\n mxd = md + 1\r\n else:\r\n mxd = md + 2\r\nelse:\r\n mxd = md\r\n\r\nprint(md, mxd)\r\n", "n = int(input())\r\nif n == 1:\r\n print(0, 1)\r\nelse:\r\n u1 = n // 7 * 2 + bool(n % 7 > 5)\r\n u2 = (n - 2) // 7 * 2 + bool((n - 2) % 7 > 5) + 2 \r\n u3 = (n - 1) // 7 * 2 + bool((n - 1) % 7 > 5) + 1\r\n print(min(u1, u2, u3), max(u1, u2, u3))", "n = int(input())\r\n\r\nk = n % 7\r\nn = n // 7\r\n\r\nprint(n * 2 + max(0, k - 5), n * 2 + min(2, k))\r\n", "n = int(input())\r\nif n >7:\r\n adder = 0\r\n if n % 7 == 6:\r\n adder = 1\r\n print(n // 7 * 2+adder,n // 7 * 2 + (min(n%7,2)))\r\nelif n <=7:\r\n print(max(n-5,0),min(2,n))\r\n# min 14 - 5 = 9 > 9 // 7 * 2\r\n", "n = int(input())\r\nx = n//7\r\nprint(x*2 + (n%7>5), x*2 + (n%7>0) + (n%7>1))", "def calculate_days_off(n, start_day):\r\n days_off = 0\r\n current_day = start_day\r\n for i in range(1, n+1):\r\n if current_day == 6 or current_day == 7: # Saturday or Sunday\r\n days_off += 1\r\n current_day = (current_day % 7) + 1\r\n return days_off\r\n\r\n\r\nn = int(input())\r\nmin_start_day = 1\r\nmax_start_day = 6\r\nmin_days_off = calculate_days_off(n, min_start_day)\r\nmax_days_off = calculate_days_off(n, max_start_day)\r\nprint(min_days_off, max_days_off)\r\n", "n=int(input())\r\nprint(n//7+(n+1)//7,(n+5)//7+(n+6)//7)\r\n", "a = int(input())\r\n\r\nif a%7==0:\r\n print(a//7*2, a//7*2)\r\nelif a%7==1:\r\n print(a//7*2, a//7*2+1)\r\nelif a%7>=2 and a%7<=5:\r\n print(a//7*2, a//7*2+2)\r\nelse:\r\n print(a//7*2+1, a//7*2+2)\r\n", "n = int(input())\r\nprint(2 * (n // 7) + ((n%7-5) if 5<=n%7 else 0), n // 7 * 2 + min(2, n % 7))", "n=int(input())\r\nmi = n//7*2+(int) (n%7==6)\r\nma = n//7*2+min(2, n%7)\r\nprint(str(mi)+\" \"+str(ma))", "n = int(input())\nprint((n // 7) * 2 + (n % 7 == 6), (n // 7) * 2 + min(2, n % 7))\n", "def main(n):\r\n\r\n \r\n X = 2 * ( n // 7 )\r\n X += (( n % 7 ) if ( n % 7 ) > 5 else 0) % 5\r\n return X\r\n\r\n\r\nif __name__ == '__main__' :\r\n n = int(input())\r\n print(main(n),end=' ')\r\n print(main(n - 2) + 2)", "n = int(input())\r\n\r\nif n % 7 == 0:\r\n print(2 * (n//7), 2 * (n // 7))\r\nelif n % 7 == 1:\r\n print(2 * (n // 7), 2 * (n // 7) + 1)\r\nelif n % 7 in [2,3,4,5]:\r\n print(2 * (n // 7), 2 * (n // 7) + 2)\r\nelif n % 7 == 6:\r\n print(2 * (n // 7) + 1, 2 * (n // 7) + 2)\r\n \r\n \r\n", "n = int(input())\r\nr = n % 7\r\nd = n // 7\r\nprint(2 * d + max(0, r - 5), 2 * d + min(r, 2))", "days = int(input())\r\nweeks = days % 7\r\nmin = 0\r\nif weeks == 6:\r\n min = 1\r\nif weeks > 2:\r\n weeks = 2\r\nprint(f'{days//7 * 2 + min} {days//7 * 2 + weeks}')", "n = int(input())\r\no = 2 * (n // 7)\r\nb = 0\r\nif n % 7 > 1:\r\n b = 2\r\nelif n % 7 == 1:\r\n b = 1\r\nm = 0\r\nif n % 7 == 6:\r\n m = 1\r\nprint(o + m, o + b)\r\n \r\n" ]

[ "import random\r\nn, m = map(int, input().split())\r\nif n < 4 and m < 4 and not((n == 1 and m == 1) or (m == 3 and n == 3)): print(\"NO\"); quit()\r\npedy = [list() for i in range(n * m + 1)]\r\nfor i in range(n * m):\r\n if i % m != 0: pedy[i+1].append(i)\r\n if i % m != m - 1: pedy[i + 1].append(i + 2)\r\n if i >= m: pedy[i + 1].append(i - m + 1)\r\n if i < (n - 1) * m: pedy[i + 1].append(i + m + 1)\r\nArr = [x for x in range(1, n*m + 1)]; Arr = Arr[::2] + Arr[1::2]; pp = 0; s = \"\"\r\nwhile (not pp):\r\n pp = 1;\r\n for i in range(n):\r\n for j in range(m):\r\n if (i + 1 != n and Arr[i * m + m + j] in pedy[Arr[i * m + j]]) or (j + 1 != m and Arr[i * m + 1 + j] in pedy[Arr[i * m + j]]):\r\n pp = 0; break\r\n if not pp: break\r\n if not pp: random.shuffle(Arr)\r\nprint(\"YES\")\r\nfor i in range(n):\r\n for j in range(m):\r\n s += str(Arr[i * m + j]) + \" \"\r\n print(s); s = \"\"\r\n", "import bisect\r\n\r\ndef list_output(s): \r\n print(' '.join(map(str, s)))\r\n \r\ndef list_input(s='int'):\r\n if s == 'int':\r\n return list(map(int, input().split())) \r\n elif s == 'float':\r\n return list(map(float, input().split()))\r\n return list(map(str, input().split()))\r\n\r\nn, m = map(int, input().split())\r\nswapped = False\r\nif n > m:\r\n n, m = m, n\r\n swapped = True\r\n\r\ndef check(M):\r\n for i in range(n):\r\n for j in range(m):\r\n if i-1 >= 0 and M[i-1][j] + m == M[i][j]:\r\n return False\r\n if i+1 < n and M[i+1][j] == M[i][j] + m:\r\n return False\r\n if j-1 >= 0 and M[i][j-1] + 1 == M[i][j]:\r\n return False\r\n if j+1 < m and M[i][j+1] == M[i][j] + 1:\r\n return False\r\n return True\r\n\r\ndef transpose(M):\r\n n = len(M)\r\n m = len(M[0])\r\n R = [[0 for i in range(n)] for j in range(m)]\r\n for i in range(n):\r\n for j in range(m):\r\n R[j][i] = M[i][j]\r\n return R\r\n\r\nif n == 1 and m == 1:\r\n print('YES')\r\n print('1')\r\n exit(0)\r\n\r\nif n <= 2 and m <= 3:\r\n print('NO')\r\n exit(0)\r\n\r\nR = list()\r\nif n == 3 and m == 3:\r\n R.append([4, 3, 8])\r\n R.append([9, 1, 6])\r\n R.append([5, 7, 2])\r\nelif m == 4:\r\n if n == 1:\r\n R.append([3, 1, 4, 2])\r\n elif n == 2: \r\n R.append([5, 4, 7, 2])\r\n R.append([3, 6, 1, 8])\r\n elif n == 3:\r\n R.append([5, 4, 7, 2])\r\n R.append([3, 6, 1, 8])\r\n R.append([11, 9, 12, 10])\r\n elif n == 4:\r\n R.append([5, 4, 7, 2])\r\n R.append([3, 6, 1, 8])\r\n R.append([11, 9, 12, 10])\r\n R.append([14, 16, 15, 13])\r\nelse:\r\n M = [[(i-1) * m + j for j in range(1, m+1)] for i in range(1, n+1)]\r\n for i in range(n):\r\n row = list()\r\n if i%2 == 0: \r\n for j in range(0, m, 2):\r\n row.append(M[i][j])\r\n for j in range(1, m, 2):\r\n row.append(M[i][j])\r\n else:\r\n for j in range(1, m, 2):\r\n row.append(M[i][j])\r\n for j in range(0, m, 2):\r\n row.append(M[i][j])\r\n R.append(row)\r\n\r\nif swapped:\r\n M = [[(i-1) * n + j for j in range(1, n+1)] for i in range(1, m+1)] \r\n M = transpose(M)\r\n S = [[0 for j in range(m)] for i in range(n)]\r\n for i in range(n):\r\n for j in range(m):\r\n r = (R[i][j]-1) // m\r\n c = (R[i][j]-1) % m\r\n S[i][j] = M[r][c]\r\n R = transpose(S)\r\n n, m = m, n\r\n#print(check(R))\r\nprint('YES')\r\nfor i in range(n):\r\n print(' '.join(map(str, R[i])))\r\n\r\n", "def get_answer(m, n):\r\n\tif (m, n) in [(1, 2), (2, 1), (1, 3), (3, 1), (2, 2), (2, 3), (3, 2)]:\r\n\t\treturn (\"NO\", [])\r\n\r\n\telif (m == 1):\r\n\t\tmat = [[i for i in range(2, n+1, 2)] + [i for i in range(1, n+1, 2)]]\r\n\t\treturn (\"YES\", mat)\r\n\r\n\telif (n == 1):\r\n\t\tmat = [[i] for i in range(2, m+1, 2)] + [[i] for i in range(1, m+1, 2)]\r\n\t\treturn (\"YES\", mat)\r\n\r\n\telif n == 2:\r\n\t\tbs = [[2, 3], [7, 6], [4, 1], [8, 5]]\r\n\t\tmat = []\r\n\r\n\t\tfor i in range(m//4):\r\n\t\t\tfor u in bs:\r\n\t\t\t\tif i % 2 == 0: # like bs\r\n\t\t\t\t\tmat.append([x + 8*i for x in u])\r\n\t\t\t\telse:\r\n\t\t\t\t\t'''\r\n\t\t\t\t\t2 3\r\n\t\t\t\t\t7 6\r\n\t\t\t\t\t4 1\r\n\t\t\t\t\t8 5\r\n\t\t\t\t\t11 10 (10 11 is invalid -> flip figure)\r\n\t\t\t\t\t14 15\r\n\t\t\t\t\t9 12\r\n\t\t\t\t\t13 16\r\n\t\t\t\t\t'''\r\n\t\t\t\t\tmat.append([x + 8*i for x in reversed(u)])\r\n\r\n\t\tif m % 4 == 1:\r\n\t\t\t'''\r\n\t\t\t2 3 m*n 3\r\n\t\t\t7 6 2 6\r\n\t\t\t4 1 -> 7 1\r\n\t\t\t8 5 4 5\r\n\t\t\t(11 10) 8 m*n-1\r\n\t\t\t(...) (11 10)\r\n\t\t\t (...)\r\n\t\t\t'''\r\n\t\t\tmat.insert(4, [0, 0])\r\n\t\t\tfor i in range(4, 0, -1):\r\n\t\t\t\tmat[i][0] = mat[i-1][0]\r\n\r\n\t\t\tmat[0][0] = m*n\r\n\t\t\tmat[4][1] = m*n-1\r\n\r\n\t\telif m % 4 == 2:\r\n\t\t\tif (m//4) % 2 == 1:\r\n\t\t\t\t'''\r\n 9 12\r\n\t\t\t\t2 3 2 3\r\n\t\t\t\t... -> ...\r\n\t\t\t\t8 5 8 5\r\n\t\t\t\t 11 10\r\n\t\t\t\t'''\r\n\t\t\t\tmat = [[m*n-3, m*n]] + mat + [[m*n-1, m*n-2]]\r\n\t\t\telse:\r\n\t\t\t\t'''\r\n 17 20\r\n\t\t\t\t2 3 2 3\r\n\t\t\t\t... -> ...\r\n\t\t\t\t13 16 13 16\r\n\t\t\t\t 18 19\r\n\t\t\t\t'''\r\n\t\t\t\tmat = [[m*n-3, m*n]] + mat + [[m*n-2, m*n-1]]\r\n\r\n\t\telif m % 4 == 3:\r\n\t\t\t'''\r\n\t\t\t 13 12\r\n\t\t\t2 3 10 3\r\n\t\t\t7 6 2 6\r\n\t\t\t4 1 7 1\r\n\t\t\t8 5 -> 4 5\r\n\t\t\t 8 9\r\n\t\t\t 11 14\r\n\t\t\t'''\r\n\r\n\t\t\tmat.insert(4, [0, 0])\r\n\t\t\tfor i in range(4, 0, -1):\r\n\t\t\t\tmat[i][0] = mat[i-1][0]\r\n\r\n\t\t\tmat[0][0] = m*n-4\r\n\t\t\tmat[4][1] = m*n-5\r\n\r\n\t\t\tmat = [[m*n-1, m*n-2]] + mat + [[m*n-3, m*n]]\r\n\r\n\t\treturn (\"YES\", mat)\r\n\r\n\telif n == 3:\r\n\t\tbs = [[6, 1, 8], [7, 5, 3], [2, 9, 4]]\r\n\t\tmat = []\r\n\r\n\t\tfor i in range(m//3):\r\n\t\t\tfor u in bs:\r\n\t\t\t\tmat.append([x + 9*i for x in u])\r\n\r\n\t\tif m % 3 == 1:\r\n\t\t\t'''\r\n\t\t\t 11 1 12\r\n\t\t\t6 1 8 6 10 8\r\n\t\t\t7 5 3 -> 7 5 3\r\n\t\t\t2 9 4 2 9 4\r\n\t\t\t'''\r\n\t\t\tmat = [[m*n-1, m*n-2, m*n]] + mat\r\n\t\t\tmat[0][1], mat[1][1] = mat[1][1], mat[0][1]\r\n\r\n\t\telif m % 3 == 2:\r\n\t\t\t'''\r\n\t\t\t 11 1 12\r\n\t\t\t6 1 8 6 10 8\r\n\t\t\t7 5 3 -> 7 5 3\r\n\t\t\t2 9 4 2 13 4\r\n 14 9 15\r\n\t\t\t'''\r\n\t\t\tmat = [[m*n-4, m*n-5, m*n-3]] + mat + [[m*n-1, m*n-2, m*n]]\r\n\t\t\tmat[0][1], mat[1][1] = mat[1][1], mat[0][1]\r\n\t\t\tmat[m-2][1], mat[m-1][1] = mat[m-1][1], mat[m-2][1]\r\n\r\n\t\treturn (\"YES\", mat)\r\n\r\n\tmat = []\r\n\r\n\tfor i in range(m):\r\n\t\tif i % 2 == 0:\r\n\t\t\tmat.append([i*n+j for j in range(2, n+1, 2)] + [i*n+j for j in range(1, n+1, 2)])\r\n\t\telse:\r\n\t\t\tif n != 4:\r\n\t\t\t\tmat.append([i*n+j for j in range(1, n+1, 2)] + [i*n+j for j in range(2, n+1, 2)])\r\n\t\t\telse:\r\n\t\t\t\tmat.append([i*n+j for j in range(n-(n%2==0), 0, -2)] + [i*n+j for j in range(n-(n%2==1), 0, -2)])\r\n\r\n\treturn (\"YES\", mat)\r\n\r\n\r\nm, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\nres = get_answer(m, n)\r\nprint(res[0])\r\n# print(m, n)\r\n\r\nif res[0] == \"YES\":\r\n\tfor i in range(m):\r\n\t\tfor j in range(n):\r\n\t\t\tprint(res[1][i][j], end=' ')\r\n\t\tprint()\r\n" ]

[ "#Med_Neji\r\n#x,y=map( lambda x:int(x)//abs(int(x)) ,input().split())\r\n#x,y=map(int,input().split())\r\n#n=int(input())\r\n#l=list(map(int,input().split()))\r\n#s=input()\r\n#x=0\r\nn=int(input())\r\nl = [(set(input().split()[1:])) for _ in range(n*(n-1)//2)]\r\nif n==2:\r\n l=list(l[0])\r\n print(1,l[0])\r\n print(len(l)-1,*l[1:])\r\nq=set()\r\nfor i in range(n*(n-1)//2-1):\r\n for j in range(i+1,n*(n-1)//2):\r\n p=l[i]&l[j]\r\n if p!=set():\r\n q.add(\" \".join(sorted(list(p))))\r\n q.add(\" \".join(sorted(list(l[i]^p))))\r\n q.add(\" \".join(sorted(list(l[j]^p))))\r\n if len(q)==n:\r\n break\r\n else:\r\n continue\r\n break\r\n \r\n \r\nfor i in q:\r\n if i!=\"\":\r\n print(len(i.split()),i)", "from copy import copy\r\nfrom sys import stdin\r\n\r\nn = int(stdin.readline())\r\n\r\nif n == 2:\r\n a, *arr = map(int, stdin.readline().strip().split())\r\n first = arr[:len(arr) // 2]\r\n second = arr[len(arr) // 2:]\r\n print(len(first), *first)\r\n print(len(second), *second)\r\n exit()\r\n\r\nneigh_by_element = dict()\r\nfor i in range(n * (n - 1) // 2):\r\n m = 0\r\n received_set = set()\r\n for z, p in enumerate(map(int, stdin.readline().strip().split())):\r\n if z == 0:\r\n continue\r\n received_set.add(p)\r\n\r\n for elem in received_set:\r\n if elem not in neigh_by_element:\r\n neigh_by_element[elem] = copy(received_set)\r\n else:\r\n neigh_by_element[elem].intersection_update(received_set)\r\n\r\nans = set()\r\nfor v in neigh_by_element.values():\r\n ans.add(frozenset(v))\r\n\r\nfor a in ans:\r\n print(len(a), *a)\r\n", "from collections import defaultdict\r\nn = int(input())\r\nif n == 2:\r\n t = input().split()\r\n print(1, t[1])\r\n print(int(t[0]) - 1, ' '.join(t[2: ])) \r\nelse:\r\n m = (n * (n - 1)) // 2\r\n t = [0] * m\r\n p = defaultdict(list)\r\n for i in range(m):\r\n t[i] = list(map(int, input().split()))[1: ]\r\n for j in t[i]:\r\n if len(p[j]) < 2: p[j].append(i)\r\n t[i] = set(t[i])\r\n p = set(tuple(q) for q in p.values())\r\n t = [set(t[i]) & set(t[j]) for i, j in p]\r\n t = [str(len(q)) + ' ' + ' '.join(map(str, q)) for q in t]\r\n print('\\n'.join(t))", "n=int(input())\n\nL=[]\n\nfor i in range((n*(n-1))//2):\n A=input().split()\n L.append(A[1:])\n\nx=L[0][0]\n\nSet=list(L[0])\nSet.remove(x)\n\nfor i in range(1,(n*(n-1))//2):\n if(x in L[i]):\n for item in L[i]:\n if(item in Set):\n Set.remove(item)\n break\n\nx=Set[0]\n\nSets=[]\nSets.append(list(Set))\n\nfor i in range((n*(n-1))//2):\n if(x in L[i]):\n Sets.append(list(L[i]))\n for item in Set:\n Sets[-1].remove(item)\n\nfor item in Sets:\n print(len(item),end=\"\")\n for z in item:\n print(\" \"+str(z),end=\"\")\n print()\n\n\n", "def solve():\r\n n = int(input())\r\n all_elements, set_list = set(), []\r\n for i in range(n * (n - 1) // 2):\r\n inp_list = list(map(int, input().split()))\r\n inp_list.pop(0)\r\n set_list.append(set(inp_list))\r\n all_elements |= set(inp_list)\r\n if n == 2:\r\n item = list(set_list[0])\r\n print(len(item) - 1, *item[1:])\r\n print(1, item[0])\r\n return\r\n\r\n stat = {x: False for x in all_elements}\r\n ans = []\r\n for el in all_elements:\r\n if not stat[el]:\r\n res = set(all_elements)\r\n for i, y in enumerate(set_list):\r\n if el in y:\r\n res = res & y\r\n ans.append([len(res)] + list(res))\r\n for i in res:\r\n stat[i] = True\r\n for el in ans:\r\n for i in el:\r\n print(i, end=\" \")\r\n\r\n print()\r\n\r\n\r\nsolve()\r\n" ]

[ "n, m = map(int, input().rstrip().split())\r\ns=list(input())\r\nfor i in range(m):\r\n l, r, c1,c2 = map(str,input().rstrip().split())\r\n for j in range(int(l)-1,int(r)):\r\n if s[j]==c1:\r\n s[j]=c2\r\nprint(\"\".join(s))", "a = list(map(int,input().split()))\r\nn = a[0]\r\nm = a[1]\r\ns = input()\r\nq = []\r\nfor i in range(n):\r\n q.append(s[i])\r\nfor x in range(m):\r\n d = list(input().split())\r\n l = int(d[0])\r\n r = int(d[1])\r\n c1 = d[2]\r\n c2 = d[3]\r\n for c in range(l,r+1):\r\n if q[c-1] == c1:\r\n q[c-1] = c2\r\nfor p in range(n):\r\n print(q[p],end = '')\r\n ", "def main():\r\n n, m = map(int, input().split())\r\n st = list(input())\r\n for _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n for i in range(int(l)-1, int(r)):\r\n if st[i] == c1:\r\n st[i] = c2\r\n print(''.join(st))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=map(int,input().split())\r\ns=input()\r\n\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n s1,s2,s3=s[0:int(l)-1],s[int(l)-1:int(r)],s[int(r):n]\r\n # print(s1,s2,s3)\r\n s2=s2.replace(c1,c2,n)\r\n s=s1+s2+s3\r\nprint(s)", "m,n=map(int,input().split())\r\nk=list(input())\r\nfor i in range(n):\r\n\ta1,a2,c,d=input().split()\r\n\tfor j in range(int(a1)-1,int(a2)):\r\n\t\tif k[j]==c:\r\n\t\t\tk[j]=d\r\nprint(''.join(k))", "def s():\r\n n,m = [int(x) for x in input().split(\" \")]\r\n stri = input()\r\n for i in range(m):\r\n l,r,c1,c2 = input().split(\" \")\r\n substr = stri[int(l)-1:int(r)].replace(c1,c2)\r\n stri = stri[:int(l)-1]+substr+stri[int(r):]\r\n print(stri)\r\n\r\ns()\r\n", "n,k=[int(x) for x in input().split()]\r\ns=input()\r\narr=list(s)\r\nfor i in range(k):\r\n l,r,c1,c2=[x for x in input().split()]\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if arr[i]==c1:\r\n arr[i]=c2\r\ns1=\"\"\r\nfor i in range(len(arr)):\r\n s1+=arr[i]\r\nprint(s1)", "n, m = map(int, input().split())\r\nstring = list(input())\r\nfor i in range(m):\r\n a = input().split()\r\n for j in range(int(a[0])-1, int(a[1])):\r\n if string[j] == a[2]:\r\n string[j] = a[3]\r\nfor i in range(n):\r\n print(string[i], end='')", "n, m = [int(x) for x in input().split()]\r\ns = '$'+input()\r\nfor i in range(m):\r\n arr = input().split()\r\n for j in range(int(arr[0]), int(arr[1])+1):\r\n if s[j] == arr[2]:\r\n s = s[:j] + arr[3] + s[j+1:]\r\nprint(s[1:])", "n,m=map(int,input().split())\r\nk=input()\r\ns=[]\r\nfor i in k:\r\n\ts.append(i)\r\nfor i in range(m):\r\n\ta,b,c,d=input().split()\r\n\tfor j in range(int(a)-1,int(b)):\r\n\t\tif s[j]==c:\r\n\t\t\ts[j]=d\r\nfor i in s:\r\n\tprint(i,end='')", "n,k=[int(x) for x in input().split()]\r\na=input()\r\n#a=[int(x) for x in input().split()]\r\n#b=[int(x) for x in input().split()]\r\n#ans=[]\r\nfor i in range(k):\r\n r,l,c,d=[x for x in input().split()]\r\n r=int(r)-1\r\n l=int(l)\r\n a=a[0:r]+a[r:l].replace(c,d)+a[l:]\r\nprint(a)\r\n", "\r\n\r\ninput1 = input()\r\ninput_list = input1.split(' ')\r\n\r\nn = int(input_list[0].strip())\r\nm = int(input_list[1].strip())\r\n\r\nstring = input()\r\nstring = list(string)\r\n\r\nfor i in range (0,m):\r\n input1 = input()\r\n input_list = input1.split(' ')\r\n l = int(input_list[0].strip())\r\n r = int(input_list[1].strip())\r\n c1 = input_list[2].strip()\r\n c2 = input_list[3].strip()\r\n for j in range (l-1,r) :\r\n if (string[j]==c1) :\r\n string[j] = c2\r\nstring = ''.join(string)\r\nprint (string)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-13 23:51:04\nLastEditTime: 2021-11-13 23:59:55\nDescription: Scarborough Fair\nFilePath: CF897A.py\n'''\n\n\ndef func():\n _, m = map(int, input().strip().split())\n s = list(input().strip())\n for _ in range(m):\n l, r, c1, c2 = input().strip().split() \n for i in range(int(l) - 1, int(r)):\n if s[i] == c1:\n s[i] = c2\n print(\"\".join(s))\n\n\nif __name__ == '__main__':\n func()\n ", "n,m=list(map(int,input().strip().split()))\r\na=input()\r\nfor j in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n b=a[l-1:r]\r\n if c1 in b:\r\n b=b.replace(c1,c2)\r\n a=a[:l-1]+b+a[r:]\r\n else:\r\n a=a\r\n pass\r\nprint(a)\r\n \r\n \r\n", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd\r\n'''\r\nN=list(map(int,input().split()))\r\nSTR=list(input())\r\nfor _ in range(N[1]):\r\n TMP=list(input().split())\r\n for __ in range(int(TMP[0])-1,int(TMP[1])):\r\n if(STR[__]==TMP[2]):\r\n STR[__]=str(TMP[3])\r\nprint(*STR,sep=\"\")", "n, m = list(map(int,input().split()))\r\na = input()\r\n \r\nfor i in range(m):\r\n\tl,r,c1,c2 = input().split()\r\n\tl = int(l)\r\n\tr = int(r)\r\n\ta = a[:l-1] + a[l-1:r].replace(c1,c2) + a[r:]\r\n \r\nprint(a)", "l = list(input().split())\r\nn = int(l[0])\r\nm = int(l[1])\r\ns = input()\r\ns = [char for char in s]\r\nfor i in range(m):\r\n a = list(input().split())\r\n l = int(a[0])\r\n r = int(a[1])\r\n c1 = a[2]\r\n c2 = a[3]\r\n for j in range(l-1, r):\r\n if s[j] == c1:\r\n s[j] = c2\r\n else:\r\n continue\r\nprint(\"\".join(s))", "n, m = map(int, input().split())\r\ns = input()\r\nz = list(s)\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l-1, r):\r\n if z[j] == c1:\r\n z[j] = c2\r\nprint(''.join(z))", "n, m = map(int, input().split())\r\ns = input()\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n s = s[0:l] + s[l:r+1].replace(c1, c2) + s[r+1:]\r\nprint(s)\r\n", "n , m = map(int,input().split())\r\ns = input()\r\n\r\nfor i in range(m):\r\n l , r , c1 , c2 = (input().split())\r\n l , r = int(l) , int(r)\r\n l -=1\r\n r-=1\r\n\r\n s = s[:l] + s[l:r+1].replace(c1 , c2) + s[r+1 : ]\r\n\r\nprint(s)", "a, b = map(int, input().split())\r\nstr_a = input()\r\nl_a = []\r\nfor k in str_a:\r\n l_a.append(k)\r\nfor i in range(b):\r\n m, n, o, p = input().split()\r\n l_b = []\r\n for s in range(int(m) - 1, int(n)):\r\n if l_a[s] == o:\r\n l_a[s] = p\r\nfor j in l_a:\r\n print(j, end='')", "import itertools\r\nimport math\r\nimport sys\r\nimport heapq\r\nfrom collections import Counter\r\nfrom collections import deque\r\nfrom fractions import gcd\r\nfrom functools import reduce\r\nsys.setrecursionlimit(4100000)\r\nINF = 1 << 60\r\n \r\n#ここから書き始める\r\nn, m = map(int, input().split())\r\ns = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n l -=1 \r\n r -= 1\r\n s = s[:l] + s[l:r + 1].replace(c1, c2) + s[r + 1:]\r\nprint(s)", "input1=input()\r\nn=int(input1.split()[0]);m=int(input1.split()[1])\r\nlist1=list(input())\r\nfor i in range(m):\r\n temp=input()\r\n l=int(temp.split()[0])\r\n r=int(temp.split()[1])\r\n c1=temp.split()[2]\r\n c2=temp.split()[3]\r\n for j in range(l-1,r):\r\n if list1[j]==c1:\r\n list1[j]=c2\r\nprint(''.join(list1))\r\n", "n,m = list(map(int,input().split()))\ns = input()\nli = list(s)\nfor i in range(m):\n\tl,r,c1,c2 = list(input().split())\n\tfor i in range(int(l)-1,int(r)):\n\t\tif li[i]==c1:\n\t\t\tli[i]=c2\nprint(\"\".join(li))\n \t\t \t \t\t\t\t\t \t\t\t \t\t", "n,m=[int(x) for x in input().split()]\r\ns=input()\r\nlst=[]\r\nfor i in s:\r\n lst.append(i)\r\nfor i in range(m):\r\n a=[x for x in input().split()]\r\n for i in range(int(a[0])-1,int(a[1])):\r\n if lst[i]==a[2]:\r\n lst[i]=a[3]\r\nprint(''.join(lst))", "n,m = map(int,input().split())\r\ns = input()\r\n\r\nfor __ in range(m):\r\n l,r,c1,c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n s = s[:l-1]+s[l-1:r].replace(c1,c2)+s[r:]\r\n '''l -= 1\r\n r -= 1\r\n for i in range(l,r):\r\n if s[i] == c1:\r\n ans = s[i].replace(c1,c2)[-1:-1]'''\r\nprint(s)\r\n", "n,m=map(int,input().split())\r\nr=input()\r\nfor i in range(m):\r\n\ta,b,c,d=(input().split())\r\n\tr=r[:int(a)-1]+r[int(a)-1:int(b)].replace(c,d)+r[int(b):]\r\nprint(r)\r\n", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nstring=input()\r\nfor i in range (m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for k in range (l-1, r, +1):\r\n if string[k]==c1:\r\n string=string[:k]+c2+string[k+1:]\r\nprint (string)", "a, b=input().split()\r\na, b=int(a), int(b)\r\nc=input()\r\nc=list(c)\r\nfor i in range(b):\r\n\td, e, f, g=input().split()\r\n\td, e=int(d), int(e)\r\n\tfor j in range(d-1,e):\r\n\t\tif c[j]==f:\r\n\t\t\tdel c[j]\r\n\t\t\tc.insert(j,g)\r\n\r\nc=\"\".join(c)\r\nprint(c)", "n,m=map(int,input().split())\r\ns=str(input()) \r\nfor _ in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n l=int(l)-1; r=int(r)\r\n p=s[l:r]\r\n p=p.replace(c1,c2)\r\n s=s[:l]+p+s[r:]\r\nprint(s)\r\n \r\n \r\n # p=s[l:r].replace(c1,c2)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "from math import *\r\nfrom collections import *\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\n\r\nn,m = map(int,input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n\ta = list(input().split())\r\n\tl = int(a[0])\r\n\tr = int(a[1])\r\n\tc1 = a[2]\r\n\tc2 = a[3]\r\n\tfor j in range(l-1,r):\r\n\t\tif(s[j] == c1):\r\n\t\t\ts[j] = c2\r\nprint(\"\".join(s))\r\n\r\n", "n, x = input().split(), list(map(str, input()))\r\nn = list(map(int, n))\r\nfor num in range(0, n[1]):\r\n k = input().split()\r\n for i in range(int(k[0])-1, int(k[1])):\r\n if x[i] == k[2]:\r\n x[i] = k[3]\r\nfor m in x:\r\n print(m, end='')\r\n", "n, m=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\n\r\n\r\nfor i in range(m):\r\n l, r, c1, c2=input().split()\r\n \r\n l=int(l)\r\n r=int(r)\r\n \r\n while(l<=r):\r\n if s[l-1]==c1:\r\n s[l-1]=c2\r\n \r\n l+=1\r\n \r\nprint(\"\".join(s)) \r\n \r\n \r\n", "n,m=map(int,input().split())\r\ns=input()\r\na=list(s)\r\ne=\"\"\r\nfor i in range(m):\r\n lis=list(input().split())\r\n b=int(lis[0])\r\n c=int(lis[1])\r\n for j in range(b-1,c):\r\n if a[j]==lis[2]:\r\n a[j]=lis[3]\r\nprint(e.join(a))", "n,q=map(int,input().split())\r\ns=list(input())\r\nfor i in range(q):\r\n l,r,c1,c2=list(input().split())\r\n for i in range(int(l)-1,int(r)):\r\n if s[i]==c1:\r\n s[i]=c2\r\nprint(\"\".join(s))\r\n \r\n ", "\r\ntry :\r\n n,m=map(int,input().split())\r\n s = input() \r\n for each in range ( 0, m ,1 ): \r\n l,r,c1,c2=map(str,input().split()) \r\n l = int(l)\r\n r = int(r)\r\n start = s[0:l-1]\r\n mid = s[l-1: r] \r\n last = s[r:n+1] \r\n for each_l in mid :\r\n if( each_l == c1 ):\r\n start = start + c2\r\n else :\r\n start = start + each_l \r\n \r\n s = start + last\r\n print(s)\r\n \r\nexcept :\r\n pass\r\n\r\n\r\n", "x,n = input().split(' ')\r\nn = int(n)\r\ns = input()\r\nlol = s\r\nfor i in range (n):\r\n kek = lol\r\n l,r,c1,c2 = input().split()\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n lol = kek[:l]\r\n for i in range(l,r+1):\r\n if kek[i] == c1:\r\n lol+=c2\r\n else:\r\n lol+=kek[i]\r\n lol += kek[r+1:]\r\nprint(lol)", "m,n = input().split()\r\ns = str(input())\r\nfor i in range(int(n)):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n temp = s[l-1:r]\r\n temp = temp.replace(str(c1),str(c2))\r\n s = s[:l-1] + temp + s[r:]\r\nprint(s)", "length = input().split(\" \")\n\noperations = int(length[1])\nlength = int(length[0])\n\nstring = input()\n\nopers = []\nfor x in range(operations):\n opers.append(input().split(\" \"))\n\nfor oper in opers:\n for item in range(len(string)):\n if item + 1 >= int(oper[0]) and item + 1 <= int(oper[1]):\n if string[item] == oper[2]:\n string = string[:item] + oper[3] + string[item + 1:]\n\nprint(string)\n\n \t\t\t \t\t\t \t \t \t\t\t\t\t\t\t\t \t \t\t", "n,k=map(int,input().split())\r\ns = input()\r\nfor i in range(k):\r\n l,r,c1,c2 = map(str,input().split())\r\n l=int(l)\r\n r=int(r)\r\n s = s[:l-1]+s[l-1:r].replace(c1,c2)+s[r:]\r\nprint(s)\r\n \r\n", "n, m = map(int, input().split())\r\na = []\r\ns = input()\r\na += s\r\nfor u in range(m):\r\n l, r, c1, c2 = (i for i in input().split())\r\n for i in range(int(l) - 1, int(r)):\r\n if a[i] == c1:\r\n a[i] = c2\r\nprint(*a, sep='')", "n,m=map(int,input().split())\na=list(input())\nfor i in range(m):\n l,r,c1,c2=input().split()\n l=int(l)\n r=int(r)\n for j in range(l-1,r):\n if a[j]==c1:\n a[j]=c2\nprint(\"\".join(a))\n", "n,m=map(int,input().split())\r\ns=input()\r\nl=[x for x in s]\r\nfor _ in range(m):\r\n a,b,c,d=map(str,input().split())\r\n for i in range(int(a),int(b)+1):\r\n if l[i-1]==c:\r\n l[i-1]=d \r\nfor i in l:\r\n print(i,end='')", "n_m=input().split(\" \")\nn=int(n_m[0])\nm=int(n_m[1])\nstring=input()\nfor i in range(m):\n\tnew=\"\"\n\tl_r_c=input().split(\" \")\n\tlower=int(l_r_c[0])-1\n\tupper=int(l_r_c[1])-1\n\tword=l_r_c[2]\n\treplace=l_r_c[3]\n\tnew_string=string[lower:upper+1]\n\tnew_string=list(new_string)\n\tcount=0\n\tfor each in new_string:\n\t\tif each==word:\n\t\t\tnew_string[count]=replace\n\t\telse:\n\t\t\tpass\n\t\tcount+=1\n\tfor i in new_string:\n\t\tnew+=i\n\tstring=string[0:lower]+new+string[upper+1:n]\nprint(string)", "n,m=map(int,input().split())\r\ns=list(input())\r\nfor j in range(m):\r\n p=input().split()\r\n l=int(p[0])\r\n r=int(p[1])\r\n c1=p[2]\r\n c2=p[3]\r\n\r\n for i in range(l-1,r):\r\n if(s[i]==c1):\r\n s[i]=c2\r\nfor i in s:\r\n print(i,end=\"\")\r\n", "n,m = map(int,input().split())\r\ni = input()\r\nfor x in range(m):\r\n l,r,c1,c2 = input().split()\r\n l,r = int(l),int(r)\r\n sub = i[l-1:r]\r\n sub = sub.replace(c1,c2)\r\n i = i[:l-1] + sub + i[r:]\r\nprint (i)", "def Scarborough(n, m, s, ls):\r\n s = list(s)\r\n for i in range(m):\r\n for j in range(int(ls[i][0]) - 1, int(ls[i][1])):\r\n if(s[j] == ls[i][2]):\r\n s[j] = ls[i][3]\r\n return s\r\n \r\n \r\n \r\n\r\n\r\nn, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ns = str(input())\r\nls = [input().split() for i in range(m)]\r\nprint(\"\".join(map(str, Scarborough(n, m, s, ls))))", "x,y=[int(x) for x in input().split()]\r\ns=input().lower()\r\nfor i in range(y):\r\n l,r,c1,c2=input().split()\r\n l=int(l)-1\r\n r=int(r)\r\n s=s[:l]+s[l:r].replace(c1,c2)+s[r:]\r\nprint(s) ", "'''\r\nproblem Name :\r\nScarborough Fair\r\nProblem Link :\r\nhttps://codeforces.com/problemset/problem/897/A\r\n'''\r\n# Input Operation\r\nn,m=map(int,input().split())\r\nstr=input()\r\nstr2=\"\"\r\narr=[]\r\nout=\"\"\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n# Output Operation\r\n for j in range(l-1,r):\r\n if(str[j]==c1):\r\n str2+=c2\r\n else:\r\n str2+=str[j]\r\n str2=str[:l-1]+str2+str[r:]\r\n str=str2\r\n out=str2\r\n str2=\"\"\r\nprint(out)", "n, m = map(int, input().split())\r\ns =list(input())\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n one = s[:l]\r\n two = s[l:r+1]\r\n three = s[r+1:]\r\n for i in range(r - l + 1):\r\n if two[i] == c1:\r\n two[i] =c2\r\n s = one + two + three\r\nprint(\"\".join(s))", "n,m=map(int,input().split())\r\nline=input()\r\ni=1\r\nwhile i<=m:\r\n l,r,c1,c2=input().split()\r\n l=int(l);r=int(r)\r\n while l<=r:\r\n if line[l-1]==c1:\r\n if l==n:\r\n line=line[:l-1]+c2\r\n else:\r\n line=line[:l-1]+c2+line[l:]\r\n l+=1\r\n i+=1\r\nprint(line)", "from sys import stdin,stdout\r\nn,m=map(int,stdin.readline().split())\r\nst1=input()\r\nl=[]\r\nfor i in st1:\r\n l.append(i)\r\nfor i in range(m):\r\n k=[str(x) for x in stdin.readline().split()]\r\n for y in range(int(k[0])-1,int(k[1])):\r\n if l[y]==k[2]:\r\n l[y]=k[3]\r\n else:\r\n continue\r\nfor i in l:\r\n stdout.write(i)\r\n", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n if c1 in s[l-1:r]:\r\n s=s[:l-1]+s[l-1:r].replace(c1,c2)+s[r:]\r\n\r\nprint(s)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,k=map(int,input().split())\r\ns=input()\r\nfor i in range(k):\r\n\tl,r,c1,c2=input().split()\r\n\tl,r=int(l),int(r)\r\n\ts=s[:l-1]+s[l-1:r].replace(c1,c2)+s[r:]\r\n\t# for q in range(int(c[0]),int(c[1])+1):\r\n\t# \ts=s.replace(c[2],c[3])\r\n# \tif s[int(c[0])-1]==c[2]:\r\n\t\t# j=int(c[1])-1\r\n\t\t\r\n\t\t# s=s.replace(s[j],c[3],1)\r\nprint(s)", "n,m=map(int,input().split())\r\ns=list(input())\r\nout=\"\"\r\nfor a in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n #print(l,r,c1,c2)\r\n l=int(l)\r\n r=int(r)\r\n for b in range(l-1,r):\r\n if s[b]==c1:\r\n s[b]=c2\r\n #print(b,1,s[b])\r\n else:\r\n #print(b,2,s[b])\r\n continue\r\nfor a in range(len(s)):\r\n out=out+s[a]\r\nprint(out)", "n,m=map(int,input().split())\r\ns=list(input())\r\nfor i in range(m):\r\n\ta,b,c,d=map(str,input().split())\r\n\ta=int(a)\r\n\tb=int(b)\r\n\tif a==b:\r\n\t\tif s[a-1]==c:\r\n\t\t\ts[a-1]=d\r\n\telse:\r\n\t\tfor j in range(a-1,b):\r\n\t\t\tif s[j]==c:\r\n\t\t\t\ts[j]=d\r\nfor i in s:\r\n\tprint(i,end='')", "n,m=map(int,input().split())\r\ns=str(input())\r\nl=[]\r\nz=\"\"\r\nfor i in range(m):\r\n arr=list(input().split())\r\n l.append(arr)\r\nfor i in range(len(l)):\r\n p=int(l[i][0])\r\n q=int(l[i][1])\r\n r=l[i][2]\r\n t=l[i][3]\r\n\r\n for j in range(p-1,q):\r\n if(s[j]==r):\r\n z=s[0:j]+t+s[(j+1):]\r\n s=z\r\nprint(s) ", "a,b=map(int,input().split())\r\ns = input()\r\nl=[]\r\nfor i in s:\r\n l.append(i)\r\nfor i in range(b):\r\n o = input().split()\r\n o1=int(o[0])\r\n o2=int(o[1])\r\n for j in range(o1-1,o2):\r\n if(l[j]==o[2]):\r\n l[j]=o[3]\r\nfor i in l:\r\n print(i,end=\"\")\r\n\r\n\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\ns = list(input())\n\n\ndef get_operation():\n return input().split()\n\n\ndef do_operation(_operation):\n l, r, c1, c2 = _operation\n l = int(l)\n r = int(r)\n for k in range(l - 1, r):\n if s[k] == c1:\n s[k] = c2\n\n\nfor k in range(m):\n operation = get_operation()\n do_operation(operation)\n\nprint(\"\".join(s))\n", "n,m = map(int,input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n for j in range(int(l)-1,int(r)):\r\n if s[j]==c1: s[j]=c2\r\nprint(*s, sep='')\r\n ", "import math\r\nfrom re import L\r\nimport sys,bisect\r\nfrom collections import deque,OrderedDict,defaultdict\r\nimport heapq\r\nfrom collections import Counter\r\ndef inp(): return sys.stdin.readline().rstrip()\r\ndef mpp(): return map(str,inp().split())\r\ndef lis(): return list(mpp())\r\ndef yn(n):\r\n if n:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\ndef fn(arr,n):\r\n if arr==sorted(arr):\r\n return 0\r\n di={}\r\n for i in range(n):\r\n di[arr[i]]=i+1\r\n r=n-1\r\n for i in range(n-1,0,-1):\r\n r=i\r\n if arr[i]<arr[i-1]:break\r\n s=set()\r\n i=0\r\n while i<r:\r\n r=max(r,di[arr[i]])\r\n s.add(arr[i])\r\n i+=1\r\n return len(s)\r\n\r\n\r\ndef main():\r\n n,m=mpp()\r\n n=int(n)\r\n m=int(m)\r\n b=inp()\r\n arr=[i for i in b]\r\n for i in range(m):\r\n x=lis()\r\n l=int(x[0])\r\n r=int(x[1])\r\n c1=x[2]\r\n c2=x[3]\r\n for j in range(l-1,r):\r\n if arr[j]==c1:\r\n arr[j]=c2\r\n print(\"\".join(arr))\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nif __name__==\"__main__\":\r\n main()", "n, m = map(int, input().split())\r\nword = list(input())\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for w in range(l-1, r):\r\n if(word[w] == c1):\r\n word[w] = str(c2)\r\nprint(\"\".join(word))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nl=list(map(int,input().split()))\r\nn=l[0]\r\nm=l[1]\r\ns=input()\r\nfor i in range(m):\r\n\tp=list(map(str,input().split()))\r\n\tl=int(p[0])\r\n\tr=int(p[1])\r\n\tc1=p[2]\r\n\tc2=p[3]\r\n\tfor j in range(l-1,r):\r\n\t\tif s[j]==c1:\r\n\t\t\ts=s[:j]+c2+s[j+1:]\r\n\r\nprint(s)\t\t\r\n\r\n", "ops = int(input().split()[1])\nstr = input()\nfor x in range(ops):\n l, r, c1, c2 = input().split(' ')\n l = int(l)\n r = int(r)\n str = str[:l-1] + ''.join([(lambda z : c2 if(z==c1) else z)(x) for x in str[l-1:r]]) + str[r:]\nprint(str)", "n,m = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\ns = input()\r\ns = list(s)\r\n\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n l = int(l)-1\r\n r = int(r)-1\r\n for j in range(l,r+1):\r\n if(s[j] == c1):\r\n s[j] = c2\r\n\r\nprint(''.join(s))\r\n \r\n", "n,m=map(int,input().split())\r\ns=list(input())\r\nfor _ in range(m):\r\n l,r,c1,c2=input().split()\r\n l1,r1=int(l)-1,int(r)\r\n for i in range(l1,r1):\r\n if s[i]==c1:\r\n s[i]=c2\r\nprint(''.join(s))", "#Scarborough Fair\r\nn,m=map(int,input().split())\r\ns=list(input())\r\nwhile m>0 :\r\n l,r,c1,c2=map(str,input().split())\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l,r+1):\r\n if s[i-1] == c1:\r\n s[i-1]=c2\r\n m=m-1\r\nprint(\"\".join(s))\r\n", "n,m=[int(i) for i in input().split()]\r\ns=str(input())\r\nfor i in range(m):\r\n a,b,c,d=[str(i) for i in input().split()]\r\n a=int(a)\r\n b=int(b)\r\n e=s[(a-1):(b)]\r\n e=e.replace(c,d)\r\n s=s[0:(a-1)]+e+s[b:]\r\nprint(s)", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n a=input().split()\r\n l,r,c1,c2=int(a[0])-1,int(a[1]),a[2],a[3]\r\n s=s[:l]+s[l:r].replace(c1,c2)+s[r:]\r\nprint(s)\r\n", "a, b = [int(i) for i in input().split()]\r\nx = list(input())\r\nfor i in range(b):\r\n y = input().split()\r\n for j in range(int(y[0])-1, int(y[1])):\r\n if x[j] == y[2]:\r\n x[j] = y[3]\r\nfor i in x:\r\n print(i, end='')\r\n \r\n", "n,m = map(int,input().split(' '))\r\ns = list(map(str,input().strip()))\r\nfor i in range (m):\r\n l,r,c,d = map(str,input().split(' '))\r\n for j in range(int(l),int(r)+1):\r\n if s[j-1]==c:\r\n s[j-1]= d\r\nprint(*s, sep='')\r\n", "n,m = map(int,input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n l,r = int(l)-1,int(r)-1\r\n for j in range(l,r+1):\r\n if s[j]==c1:\r\n s[j]=c2\r\nprint(''.join(s))", "f=lambda:map(int,input().split())\r\nn,t=f()\r\ns=list(input())\r\nwhile t:\r\n l,r,c1,c2=input().split()\r\n for i in range(int(l),int(r)+1):\r\n if s[i-1]==c1:\r\n s[i-1]=c2\r\n t-=1\r\nprint(''.join(s))", "#897A scarborough Fair \n\nentrada = str(input())\nentrada = [int(x) for x in entrada.split()]\n\nn = entrada[0]\nm = entrada[1]\n\ns = str(input())\ns_as_list = list(s)\n\n\nfor i in range(m):\n entrada1 = str(input())\n parameters = entrada1.split()\n\n l, r, c1, c2 = int(parameters[0])-1, int(parameters[1]), parameters[2], parameters[3]\n\n for j in range(l, r):\n if s_as_list[j] == c1:\n s_as_list[j] = c2\n \nans = ''.join(s_as_list)\n\nprint(ans)", "list0 = input().split()\r\nn , m = list0\r\nn = int(n)\r\nm = int(m)\r\ns = list(input())\r\ni = 1\r\nwhile i <= m:\r\n\tlist1 = input().split()\r\n\tl , r, c1, c2 = list1\r\n\tl = int(l)\r\n\tr = int(r)\t\r\n\tj = l-1\r\n\twhile j < r:\r\n\t\tif s[j] == c1:\r\n\t\t\ts[j] = c2\r\n\t\tj = j + 1\r\n\ti = i + 1\r\nst = ''.join(str(e) for e in s)\r\nprint(st)\r\n\r\n\r\n", "a , b = map(int,input().split())\r\nl = input()\r\nf = []\r\nfor i in l:\r\n f.append(i)\r\nfor i in range(b):\r\n a1,a2,a3,a4 = map(str,input().split())\r\n a1 = int(a1)\r\n a2 = int(a2)\r\n for i in range(a1 -1,a2):\r\n if f[i] == a3:\r\n f[i] = a4\r\nfor i in f:\r\n print(i , end = \"\")\r\n", "def main():\r\n n, m = map(int, input().split())\r\n \r\n s = list(input())\r\n \r\n for i in range(m):\r\n l, r, c1, c2 = map(str, input().split())\r\n l, r = int(l), int(r)\r\n \r\n for j in range(l-1, r):\r\n if s[j] == c1:\r\n s[j] = c2 \r\n \r\n return ''.join(s)\r\n \r\nprint(main())", "n,m = map(int, input().split())\r\ns=\"\"\r\ns = input()\r\np = list(s)\r\n\r\nfor x in range(m):\r\n l,r,c1,c2 = list(input().split())\r\n l = int(l)\r\n r = int(r)\r\n\r\n for i in range(l-1,r):\r\n if p[i]== c1:\r\n p[i]=c2\r\n\r\nprint(''.join(p))\r\n", "n,m=list(map(int,input().split()))\r\ns=input()\r\nz=list(s)\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if z[i]==c1:\r\n z[i]=c2\r\nprint(\"\".join(z))", "R=lambda:list(map(int,input().split()))\r\n\r\nn, m = R()\r\ns = list(input())\r\nfor x in range(m):\r\n\tl, r, c1, c2 = input().split()\r\n\tl, r = int(l)-1, int(r)-1\r\n\twhile l <= r:\r\n\t\tif str(s[l]) == c1:\r\n\t\t\ts[l] = c2\r\n\t\tl += 1\r\nprint(''.join(s))", "n,m = map(int,input().split())\r\ns = input()\r\nlst = list(s)\r\nres = \"\"\r\nfor _ in range(m):\r\n\tl,r,c1,c2 = map(str,input().split())\r\n\tl = int(l)\r\n\tr = int(r)\r\n\tfor i in range(l,r+1):\r\n\t\tif lst[i-1] == c1:\r\n\t\t\tlst[i-1] = c2 \r\nres=\"\".join(lst)\r\nprint(res)", "n,m=map(int,input().split())\r\nstring=[]\r\ns=input()\r\nfor i in s:\r\n string.append(i)\r\n\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n l=int(l)\r\n r=int(r)\r\n for j in range(l-1,r):\r\n if string[j]==c1:\r\n string[j]=c2\r\nprint(''.join(string))", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n, m = [int(i) for i in stdin.readline().strip().split()]\r\n string = list(stdin.readline().strip())\r\n\r\n for i in range(m):\r\n beg, end, find, replace = [i for i in stdin.readline().strip().split()]\r\n beg, end = int(beg), int(end)\r\n for i in range(beg - 1, end):\r\n if string[i] == find:\r\n string[i] = replace\r\n\r\n print(\"\".join(string))\r\n\r\n\r\nmain()\r\n", "x,y = [int(x) for x in input().split()]\r\ns = input().lower()\r\nfor i in range(y):\r\n l,r,c1,c2 = input().split()\r\n l = int(l)-1\r\n r = int(r)\r\n s = s[:l]+s[l:r].replace(c1,c2)+s[r:]\r\nprint(s)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ns = input()\r\nlist = list(s)\r\nfor _ in range(m):\r\n l,r,c1,c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for i in range(l-1,r):\r\n if(list[i]==c1):\r\n list[i] = c2\r\ns = \"\".join(list)\r\nprint(s)", "n,m=map(int,input().split())\r\ns=list(input())\r\nl=[]\r\nfor i in range(m):\r\n l.append(list(input().split()))\r\nfor j in range(m):\r\n inf=l[j][0]\r\n sup=l[j][1]\r\n for i in range(int(inf)-1,int(sup)):\r\n if s[i]==l[j][2]:\r\n s[i]=l[j][3]\r\nprint(''.join(s))", "n,m=map(int,input().split())\r\ns=str(input())\r\nfor i in range(m):\r\n ll,rr,c1c,c2c=input().split()\r\n l=int(ll);r=int(rr);c1=str(c1c);c2=str(c2c)\r\n for x in range(l-1,r):\r\n if s[x]==c1:\r\n s=s[:x]+c2+s[x+1:]\r\nprint(s)\r\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\n\r\nst = list(input())\r\n\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l), int(r)\r\n for i in range(l-1, r):\r\n if st[i] == c1:\r\n st[i] = c2\r\n\r\nprint(\"\".join(st))", "\r\nn,t=map(int,input().split())\r\nstr1=input()\r\nstr1=list(str1)\r\n\r\nfor _ in range(t):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if str1[i]==c1:\r\n str1[i]=c2\r\nprint(''.join(str1))", "n,m=map(int,input().split())\ns=input()\nls=[]\nfor i in s:\n ls.append(i)\nfor i in range(m):\n t=input().split()\n ls[int(t[0])-1:int(t[1])]=s[int(t[0])-1:int(t[1])].replace(str(t[2]), str(t[3]))\n s=\"\".join(str(i) for i in ls)\nfor i in ls:\n print(i,end=\"\")\n\t\t \t \t \t \t \t\t\t\t\t\t\t\t\t\t \t\t\t \t", "# https://codeforces.com/problemset/problem/897/A\r\nn, m = map(int, input().split())\r\n\r\nstring = list(input())\r\n\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n\r\n for i in range(int(l) - 1, int(r)):\r\n if string[i] == c1:\r\n string[i] = c2\r\n\r\nprint(\"\".join(string))\r\n", "def main():\n n, m = map(int, input().split())\n l = list(input())\n for _ in range(m):\n lo, hi, a, b = input().split()\n for i in range(int(lo) - 1, int(hi)):\n if l[i] == a:\n l[i] = b\n print(''.join(l))\n\n\nif __name__ == '__main__':\n main()\n", "n,m = [int(i) for i in input().split(\" \")]\r\n\r\npalavr = input()\r\n\r\n\r\npalavra = [i for i in palavr]\r\n\r\nwhile m > 0:\r\n \r\n i1, i2, la, nl = [str(s) for s in input().split(\" \")]\r\n i1 = int(i1)\r\n i2 = int(i2)\r\n \r\n for i in range(i1-1,i2,1):\r\n if palavra[i] == la:\r\n palavra[i] = nl\r\n \r\n m -= 1\r\n \r\n\r\nprint(\"\".join(palavra))\r\n\r\n\r\n", "n, m = [int(item) for item in input().strip().split(' ')]\n\ns = list(input().strip())\n# print(\"s = \" + str(s))\n\nfor i in range(m):\n\t# read operation\n\tstart, finish, before, after = input().strip().split()\n\tstart, finish = int(start) - 1, int(finish) - 1\n\t\n\t# make operation\n\n\tfor num in range(start, finish + 1):\n \t\tif s[num] == before:\n \t\t\ts[num] = after\n\nprint(\"\".join(s))", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\ns=input()\r\ns=list(s)\r\nfor z in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for i in range(l-1,r):\r\n if s[i]==c1:s[i]=c2\r\nfor i in range(n):\r\n print(s[i],end=\"\")", "n, m = [ int(x) for x in input().split() ]\r\ns = str(input())\r\ns = list(s)\r\nresult = ''\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n # to make 1 indexed to 0 indexed\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n c1 = str(c1)\r\n c2 = str(c2)\r\n\r\n for i in range(l, r+1):\r\n if(c1 == s[i]):\r\n s[i] = c2\r\n\r\nprint(result.join(s))\r\n", "import sys\r\nm_input = input\r\nif sys.version > '3':\r\n m_input = input\r\nelse:\r\n m_input = raw_input\r\nn, m = map(int,m_input().split())\r\nstr = m_input()\r\nfor i in range(m):\r\n start,end,src,dsc = m_input().split()\r\n str = str[:int(start)-1] + str[int(start)-1:int(end)].replace(src,dsc)+str[int(end):]\r\nprint(str)\r\n", "\"\"\"\r\ninstagram : essipoortahmasb\r\ntelegram channel : essi_python\r\n\"\"\"\r\n\r\ni =input\r\nn, m = map(int,i().split())\r\ns = i()\r\ntmp=\"\"\r\nfor j in range(m):\r\n l = [*map(str,i().split())]\r\n tmp+=s[0:int(l[0])-1]\r\n tmp+=s[int(l[0])-1:int(l[1])].replace(l[2],l[3],100)\r\n tmp+=s[int(l[1]):]\r\n s=tmp\r\n tmp=\"\"\r\nprint(s)\r\n\r\n\"\"\"\r\ns = \"essi salam\"\r\nprint(s.replace('s', 'h', 2))\r\n\r\n\"\"\"\r\n", "n,m=[int(x) for x in input().split()]\r\ns=input()\r\nfor i in range(m):\r\n l,r,c1,c2=[x for x in input().split()]\r\n l,r=int(l)-1,int(r)-1\r\n s=s[:l]+s[l:r+1].replace(c1,c2)+s[r+1:]\r\nprint(s)\r\n", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)-1\r\n r=int(r)-1\r\n s1=s[:l]\r\n s2=s[r+1:]\r\n s3=s[l:r+1]\r\n s3=s3.replace(c1,c2)\r\n s=s1+s3+s2\r\nprint(s)", "n,m = map(int,input().split())\r\nstring = input()\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n l,r = int(l),int(r)\r\n\r\n string = string[:l-1] + string[l-1:r].replace(c1,c2) + string[r:]\r\n\r\nprint(string)\r\n", "n,m=input().split()\r\ns=input()\r\nfor i in range(int(m)):\r\n a,b,c,d=input().split()\r\n temp=\"\"\r\n for j in range(int(n)):\r\n if j<=int(b)-1 and j>=int(a)-1:\r\n if s[j]!=c:\r\n temp+=s[j]\r\n else:\r\n temp+=d\r\n else:\r\n temp+=s[j]\r\n \r\n s=temp\r\nprint(s)", "n, m = [int(x) for x in input().split()]\r\ns = [x for x in input()]\r\n\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l), int(r)\r\n \r\n for i in range(l-1, r):\r\n if s[i] == c1:\r\n s[i] = c2\r\nprint(''.join(s))", "_,m=map(int,input().split())\r\na=input()\r\nfor _ in [0]*m:\r\n l,r,b,c=input().split();l=int(l)-1;r=int(r)\r\n a=a[:l]+a[l:r].replace(b,c)+a[r:]\r\nprint(a)", "n, m=[int(n) for n in input().split()]\r\ns=input()\r\nfor i in range (m):\r\n l,r,c,k=input().split()\r\n l=int(l)\r\n r=int(r)\r\n str=s[l-1:r]\r\n str=str.replace(c,k)\r\n \r\n s=s[:l-1]+str+s[r:]\r\nprint(s)", "\r\nn = list(map(int, input().split()))\r\nstring = input()\r\nfor _ in range(n[1]):\r\n s = list(map(str, input().split()))\r\n string = string[:int(s[0])-1]+string[int(s[0]) - 1:int(s[1])].replace(s[2], s[3])+string[int(s[1]):]\r\nprint(string)\r\n", "n,m = list(map(int,input().split()))\r\ns = list(input())\r\nfor _ in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if s[i]==c1:\r\n s[i]=c2\r\nprint(\"\".join(s))", "# A. Scarborough Fair\n\nn, m = map(int, input().split())\ns = list(input())\n\nfor _ in range(m):\n l, r, c1, c2 = input().split()\n l = int(l)\n r = int(r)\n for x in range(l-1, r):\n if s[x] == c1:\n s[x] = c2\nprint(''.join(s))\n", "info = input()\r\ninfo = info.split()\r\ninfo[0] = int(info[0])\r\ninfo[1] = int(info[1])\r\nline = input()\r\nline = list(line)\r\nfor i in range(info[1]):\r\n change = input()\r\n change = change.split()\r\n change[0] = int(change[0])\r\n change[1] = int(change[1])\r\n for j in range(change[0] - 1, change[1]):\r\n if line[j] == change[2]:\r\n line[j] = change[3]\r\nprint(\"\".join(line))", "n,m=map(int,input().split())\r\ns=input()\r\nfor _ in range(m):\r\n a,b,c,d=input().split()\r\n a,b=int(a)-1,int(b)\r\n s=s[:a]+s[a:b].replace(c,d)+s[b:]\r\nprint(s)", "n,m=map(int,input().split())\r\ns=input().lower()\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)-1\r\n r=int(r)\r\n s=s[:l]+s[l:r].replace(c1,c2)+s[r:]\r\nprint(s)\r\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\ns = list(input())\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l), int(r)\r\n for j in range (l-1, r):\r\n if s[j]==c1:\r\n s[j]=c2\r\nprint(*s, sep = '')", "a = list(map(int, input().split()))\r\nn = a[0]\r\nm = a[1]\r\ns = input()\r\nfor i in range(m):\r\n a = input().split()\r\n new_s = s[0:int(a[0]) - 1]\r\n for j in range(int(a[0]) - 1, int(a[1])):\r\n if s[j] == a[2]:\r\n new_s += a[3]\r\n else:\r\n new_s += s[j]\r\n new_s += s[int(a[1]):]\r\n s = new_s\r\n\r\nprint(s)\r\n", "n,m = map(int, input().split())\r\n\r\nstring = list(input().strip())\r\n\r\nfor i in range (m):\r\n ops = input().split()\r\n indices = ops[:2]\r\n letters = ops[2:]\r\n for i in range( int(indices[0]), int(indices[1])+1) :\r\n if string[i-1] == letters[0]:\r\n string[i-1] = letters[1]\r\n \r\n\r\nfor i in string:\r\n print (i,end=\"\")", "n, m = map(int, input().split())\r\ns = input()\r\nlst = []\r\nfor i in range(n):\r\n lst.append(s[i].strip())\r\n\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l) - 1, int(r)\r\n for i in range(l, r):\r\n if lst[i] == c1: lst[i] = c2;\r\nprint(\"\".join(lst))", "import sys\r\n\r\nn,m=map(int,sys.stdin.readline().split())\r\na=sys.stdin.readline().strip()\r\nfor i in range(m):\r\n l,r,c1,c2=sys.stdin.readline().split()\r\n l,r=int(l),int(r)\r\n # print(a,a[l-1:r])\r\n a=a[:l-1]+a[l-1:r].replace(c1,c2)+a[r:]\r\nprint(a)", "n, m = map(int, input().split())\r\ns = input()[:n]\r\nx = []\r\n[x.append(y) for y in s]\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l - 1, r):\r\n if x[j] == c1:\r\n x[j] = c2\r\n\r\nprint(''.join(x))\r\n", "n,m = [int(_) for _ in input().split()]\r\ns = input()\r\nfor _ in range(m):\r\n l,r,c1,c2 = input().split()\r\n l = int(l)-1\r\n r = int(r)\r\n s = s[:l] + s[l:r].replace(c1,c2) + s[r:]\r\n\r\nprint(s)", "def solve(s, arr):\n s = list(s)\n for l, r, x, y in arr:\n for i in range(l-1, r):\n if s[i] == x:\n s[i] = y\n return ''.join(s)\n\n\nn, m = list(map(int, input().strip().split()))\ns = input()\narr = []\nfor i in range(m):\n tmp = input().strip().split()\n tmp[0] = int(tmp[0])\n tmp[1] = int(tmp[1])\n arr.append(tmp)\nprint(solve(s, arr))", "# A. Scarborough Fair\r\n\r\nn,m = map(int,input().split())\r\nstr = input()\r\nlst = list(str)\r\nfor i in range(0,m):\r\n l,r,c1,c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l-1,r):\r\n if(lst[j]==c1):\r\n lst[j]=c2\r\nstr1=\"\"\r\nstr1 = str1.join(lst)\r\nprint(str1)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ns=input()\r\na=[None]*n\r\nfor i in range(n):\r\n a[i]=s[i]\r\n\r\nfor i in range(m):\r\n x=input().split(' ')\r\n l=int(x[0])\r\n r=int(x[1])\r\n\r\n for j in range(l-1,r):\r\n if a[j]==x[2]:\r\n a[j]=x[3]\r\nfor i in range(n):\r\n print(a[i],end='')", "n, m = map(int, input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n l,h,f,x=map(str,input().split())\r\n for j in range(int(l)-1, int(h),1):\r\n if s[j] == f:\r\n s[j] = x\r\nz = \"\".join(s)\r\nprint(z)", "n, m = map(int, input().split(' '))\r\ns = input()\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split(' ')\r\n changed = ''\r\n for i in range(int(l) - 1, int(r)):\r\n if s[i] == c1:\r\n changed += c2\r\n else:\r\n changed += s[i]\r\n s = s[:int(l) - 1] + changed + s[int(r):]\r\nprint(s)", "n, m = map(int,input().split())\r\ns = input()\r\n\r\nfor i in range(m):\r\n tmp = list(input().split())\r\n l,r,c1,c2 = int(tmp[0]),int(tmp[1]),tmp[2],tmp[3]\r\n s = s[0:l-1]+ s[l-1:r].replace(c1,c2)+s[r:]\r\nprint(s)", "a, b = map(int, input().split())\r\ns = input()\r\nfor i in range(b):\r\n l = input().split()\r\n in1, in2, le1, le2 = int(l[0]), int(l[1]), l[2], l[3]\r\n s = s[:in1-1]+s[in1-1:in2].replace(le1, le2)+s[in2:]\r\nprint(s)", "n, m = map(int, input().split())\ns = list(input())\nfor i in range(m):\n l, r, c1, c2 = map(str, input().split())\n for x in range(int(l) - 1, int(r)):\n if s[x] == c1:\n s[x] = c2\nprint(''.join(s))\n \t\t\t\t \t\t\t \t\t\t \t \t\t\t\t\t\t \t", "n,m=map(int,input().split())\r\nst=str(input())\r\ns=list(st)\r\nfor i in range(m):\r\n x=list(input().strip().split(' '))\r\n l=int(x[0])\r\n r=int(x[1])\r\n c1=x[2]\r\n c2=x[3]\r\n for j in range(l-1,r):\r\n if s[j]==c1:\r\n s[j]=c2\r\nprint(''.join(s))\r\n", "n, m = map(int, input().split())\r\ns = input()\r\nfor _ in range(m):\r\n\tl, r, c1, c2 = input().split()\r\n\tfor i in range(int(l)-1, int(r)):\r\n\t\tif s[i]==c1:\r\n\t\t\ts=s[:i]+c2+s[i+1:]\r\nprint(s)", "import sys\n\nline = sys.stdin.readline().strip()\nn, m = map(int, line.split())\n\ns = sys.stdin.readline().strip()\ns_list = list(s)\n\nfor i in range(m):\n line = sys.stdin.readline().strip()\n l, r, c1, c2 = line.split()\n l, r = int(l)-1, int(r)\n\n for j in range(l, r):\n if s_list[j] == c1:\n s_list[j] = c2\n\nprint(''.join(s_list))\n", "n,m=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\nk=[]\r\nfor i in range(m):\r\n\ta=list(map(str,input().split()))\r\n\tk.append(a)\r\nfor i in range(0,m):\r\n\tc=int(k[i][0])\r\n\td=int(k[i][1])\r\n\tfor j in range(c-1,d):\r\n\t\tif(s[j]==k[i][2]):\r\n\t\t\ts[j]=k[i][3]\r\nprint(\"\".join(s))\r\n", "n,m=map(int,input().split())\r\narr=list(input().strip())\r\n#print(arr)\r\nfor _ in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n #print(c1,c2)\r\n for i in range(l-1,r):\r\n #print(i)\r\n if arr[i]==c1:\r\n arr[i]=c2\r\nprint(\"\".join(arr))", "n,k=map(int,input().split())\r\ns1=list(input())\r\ns2=\"\"\r\nfor i in range(k):\r\n\ts=input().split()\r\n\ts[0]=int(s[0])\r\n\ts[1]=int(s[1])\r\n\tfor i in range(s[0],s[1]+1):\r\n\t\tif s[2] == s1[i-1]:\r\n\t\t\ts1[i-1]=s[3]\r\n\ts2=''.join(s1)\t\r\nprint(s2)", "a=list(map(int,input().split()))\r\nstring=input()\r\nc=[]\r\nfor i in range(a[1]):\r\n m=input().split()\r\n c.append(m)\r\ndef replace(list1,string):\r\n new_str=''\r\n for k in range(0,int(list1[0])-1):\r\n new_str+=string[k]\r\n for i in range(int(list1[0])-1,int(list1[1])):\r\n if string[i]==list1[2]:\r\n new_str+=list1[3]\r\n else :\r\n new_str+=string[i]\r\n for j in range(int(list1[1]),len(string)):\r\n new_str+=string[j]\r\n return new_str\r\n\r\np=string\r\n\r\nfor i in range(a[1]):\r\n p=replace(c[i],p)\r\nprint(p) \r\n", "a,b=input().split()\r\nn=int(a)\r\nm=int(b)\r\ns=input()\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n for i in range(n):\r\n if i>=int(l)-1 and i<=int(r)-1 and s[i]==c1:\r\n s=s[:i]+c2+s[i+1:]\r\nprint(s) \r\n \r\n ", "n,m=map(int,input().split())\r\ns=list(input())\r\nfor i in range(m):\r\n a,b,c,d=map(str,input().split())\r\n for j in range(int(a)-1,int(b)):\r\n if s[j]==c:\r\n s[j]=d\r\nprint(\"\".join(s))\r\n \r\n", "\r\nn, m = map(int,input().split())\r\n\r\ns = list(input())\r\n\r\n\r\nfor i in range(m):\r\n\r\n l, r, c1, c2 = map(str,input().split())\r\n\r\n for i in range(int(l)-1,int(r)):\r\n if s[i] == c1:\r\n s[i] = c2\r\n\r\n\r\nprint(\"\".join(s))", "n = input().split()\r\ns = input()\r\n\r\nfor i in range(int(n[1])):\r\n l,r,c1,c2 = input().split()\r\n s = s[:int(l)-1:] + s[int(l)-1:int(r)].replace(c1,c2) + s[int(r)::]\r\nprint(s)\r\n\r\n\r\n", "string = input().split(\" \")\r\nn = int(string[0])\r\nm = int(string[1])\r\n\r\nstring = list(input())\r\n\r\nfor i in range(m):\r\n operation = input().split(\" \")\r\n for j in range(int(operation[0]) - 1, int(operation[1])):\r\n if string[j] == operation[2]:\r\n string[j] = operation[3]\r\n \r\nprint(''.join(string))", "(n, m) = map(int, input().split(' '))\ns = input()\ns_to_l = list(s)\n\nfor i in range(m):\n l_r_c1_c2 = input().split(' ')\n l = int(l_r_c1_c2[0])\n r = int(l_r_c1_c2[1])\n c1 = str(l_r_c1_c2[2])\n c2 = str(l_r_c1_c2[3])\n\n s = s[: l - 1] + s[l - 1: r].replace(c1, c2) + s[r:]\n\nprint(s)\n\n\n", "import string\r\n\r\nilkSatir=input()\r\nikinciSatir=input()\r\n\r\nilkSatirElemanlari=ilkSatir.split(\" \")\r\ntext=str(ikinciSatir)\r\n\r\nsatirSayisi=int(ilkSatirElemanlari[1])\r\nfor i in range(satirSayisi):\r\n islem=input().split()\r\n kesitUzunlugu=int(islem[1])-int(islem[0])\r\n for k in range(kesitUzunlugu+1):\r\n a=int(islem[0])-1+k\r\n if(text[a]==islem[2]):\r\n text=text[0:a]+islem[3]+text[a+1:len(text)]\r\nprint(text)\r\n", "n, m = map(int,input().split())\r\ns = input()\r\narr = []\r\nfor t in range(m):\r\n steps = input().split()\r\n arr.append(steps)\r\nls = list(s)\r\nfor i in range(len(arr)):\r\n for e in range(int(arr[i][0])-1,int(arr[i][1])):\r\n if ls[e] == arr[i][2]:\r\n ls[e] = arr[i][3]\r\nprint(''.join(ls))\r\n", "a,b=map(int,input().split(' '))\r\nc=input()\r\nr=list(c)\r\nfor i in range(0,b):\r\n d=input().split(' ')\r\n for k in range(int(d[0])-1,int(d[1])):\r\n if r[k]==d[2]:\r\n r[k]=d[3]\r\nfor lo in range(0,a):\r\n print (r[lo],end='')", "n , m = input().split(\" \")\r\nm = int(m)\r\nword = input()\r\nlst = list(word)\r\nfor i in range(m):\r\n a,b,c,d = input().split(\" \")\r\n a = int(a)\r\n b = int(b)\r\n for j in range(a-1,b):\r\n if lst[j] == c:\r\n lst[j] = d\r\nprint(\"\".join(lst))", "i = list(map(int, input().split())) #i[0] -> largo del string, i[1] = querys\nletras = str(input())\npalabra = []\nfor k in range(i[0]):\n\tpalabra.append(letras[k])\n\nfor k in range(i[1]):\n\tcomando = input().split()\n\tfor j in range(int(comando[0]) - 1, int(comando[1])):\n\t\tif palabra[j] == comando[2]:\n\t\t\tpalabra[j] = comando[3]\n\nfinal = \"\"\nfor k in range(i[0]):\n\tfinal += palabra[k]\n\nprint(final)\n# 1534533633002\n", "n,m = map(int, input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n for j in range(int(l)-1, int(r)):\r\n if s[j] == c1:\r\n s[j] = c2\r\nprint(\"\".join(s))", "n,m=map(int,input().split())\ns=input()\ns=list(s)\nfor _ in range(m):\n l,r,a,b=input().split()\n l,r=int(l),int(r)\n for ii in range(l-1,r):\n if s[ii]==a:\n s[ii]=b\nprint(\"\".join(s))\n \t\t \t \t \t\t \t \t \t\t \t", "size , no_of_operations = map(int , input().split(\" \"))\n\nword = input()\n\ndef op(word , l , r , c1 , c2) :\n return ''.join([c2 if i in range(l-1 , r) and word[i] == c1 else word[i] for i in range(len(word))])\n\nfor i in range(no_of_operations) :\n l , r , c1 , c2 = input().split(\" \")\n word = op(word , int(l), int(r) , c1 , c2)\n\nprint(word)\n\n\n", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nm,n = map(int, input().split())\r\nc=list(input())\r\nfor i in range(n):\r\n l,r,d1,d2 = input().split()\r\n for j in range(int(l)-1, int(r)):\r\n if c[j]==d1: \r\n \tc[j]=d2\r\nprint(''.join(c))", "n,m=[int(x) for x in input().split(\" \")]\r\nst=input()\r\nlis=[]\r\nfor i in st:\r\n lis.append(i)\r\nl=[]\r\nfor i in range(m):\r\n l1=[x for x in input().split(\" \")]\r\n l.append(l1)\r\nfor i in range(m):\r\n p,q,r,s=l[i]\r\n for j in range(int(p)-1,int(q)):\r\n if lis[j]==r:\r\n lis[j]=s\r\nfor i in lis:\r\n print(i,end=\"\")\r\n \r\n ", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n s=s[0:int(l)-1]+s[int(l)-1:int(r)].replace(c1,c2)+s[int(r):n]\r\nprint(s)", "n,m=map(int,input().split())\r\ns=input()\r\nlist0=list(s)\r\nlist1=[]\r\nfor i in range(m):\r\n lss=input().split()\r\n list1.append(lss)\r\nfor ele in list1:\r\n for j in range(int(ele[0])-1,int(ele[1])):\r\n if(list0[j]==ele[2]):\r\n list0[j]=ele[3]\r\nprint(''.join(map(str, list0)))\r\n\r\n", "import sys\r\nn,m=map(int,sys.stdin.readline().split())\r\nst=sys.stdin.readline().strip()\r\ns=[]\r\nfor x in st:\r\n s.append(x)\r\n\r\nfor _ in range(m):\r\n l,r,c1,c2 = map(str,sys.stdin.readline().split())\r\n l=int(l)-1\r\n r=int(r)-1\r\n\r\n for i in range(l,r+1):\r\n if s[i]==c1:\r\n s[i]=c2\r\n\r\nprint(''.join(x for x in s))", "#author : Piyush Rajendra Chaudhari\r\n\r\nn, m = list(map(int, input().split()))\r\ns = input()\r\n\r\nfor i in range(m):\r\n l, r, c1, c2 = list(input().split())\r\n\r\n z = s[int(l) - 1:int(r)]\r\n\r\n y = z.replace(c1, c2)\r\n\r\n s = s[:int(l) - 1] + y + s[int(r):]\r\n\r\n # s = st\r\nprint(s)", "n=int(input().split()[-1])\r\ns=input()\r\nfor i in range(n):\r\n l,r,c,d=input().split()\r\n l=int(l)-1\r\n r=int(r)\r\n b=s[l:r].replace(c,d)\r\n s=s[:l]+b+s[r:]\r\nprint(s)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn, k = map(int, input().split())\r\ns = list(input())\r\nfor i in range(k):\r\n l, r, c1, c2 = map(str, input().split())\r\n for j in range(int(l)-1, int(r)):\r\n if s[j] == c1:\r\n s[j] = c2\r\n else:\r\n continue\r\nprint(\"\".join(s))\r\n", "n, m = list(map(int,input().split()))\nword = input()\n\nfor i in range(m):\n l, r, c1, c2 = input().split()\n for j in range(int(l), (int(r)+1)):\n if (word[j-1] == c1):\n w = list(word)\n w[j-1] = c2\n word = \"\".join(w)\n \n \n\nprint(word)", "n,m=input().split()\nn=int(n)\nm=int(m)\ns=input()\nstr=[]\nfor i in range(len(s)):\n str.append(s[i])\nfor i in range(m):\n l,r,c1,c2=input().split()\n l=int(l)\n r=int(r)\n for i in range(r-l+1):\n if str[l-1]==c1:\n str[l-1]=c2\n l=l+1\nprint(''.join(str))\n\n", "a,b=map(int,input().split())\ns=input()\ns1=str()\nfor i in range(0,b):\n sum=0\n q,w,c1,c2=map(str,input().split())\n q,w=int(q),int(w)\n for j in s:\n sum=sum+1\n if sum>=q and sum<=w:\n if j==c1:\n j=c2\n s1+=j\n s=s1\n s1=str()\nprint(s)\n\n\n\n \t \t\t\t\t\t \t \t\t\t\t \t \t\t \t \t", "n,m=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\nfor i in range(m):\r\n l=[i for i in input().split()]\r\n t=int(l[0])\r\n r=int(l[1])\r\n for j in range(t-1,r):\r\n if s[j]==l[2]:\r\n s[j]=l[3]\r\ns=\"\".join(s)\r\nprint(s)", "n,m=tuple(map(int,input().split()))\r\ns=input()[:n]\r\ns=list(s)\r\nfor _ in range(m):\r\n l,r,c1,c2=tuple(map(str,input().rstrip().split()))\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if s[i]==c1:\r\n s[i]=c2\r\nprint(''.join(s))", "a , b = map(int,input().split())\r\ns = list(input())\r\nfor _ in range(b):\r\n l, r , c1 , c2 = map(str, input().split())\r\n for i in range(int(l)-1,int(r)):\r\n if s[i]==c1:\r\n s[i] = c2\r\nprint(''.join(s))\r\n", "n,m=list(map(int,input().split()))\r\nx=input()\r\ny=[]\r\nfor i in range(n):\r\n y.append(x[i])\r\nfor _ in range(m):\r\n l,r,c1,c2=input().split()\r\n l,r=int(l),int(r)\r\n for i in range(l-1,r):\r\n if(y[i]==c1):\r\n y[i]=c2\r\nprint(''.join(y))", "#-------------Program-------------\r\n#----KuzlyaevNikita-Codeforces----\r\n#\r\n\r\nn,m=map(int,input().split())\r\ns=list(str(input()))\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n l=int(l);r=int(r)\r\n for j in range(l-1,r):\r\n if s[j]==c1:\r\n s[j]=c2\r\nprint(''.join(s))\r\n", "a,b = map(int,input().split())\r\nz = input()\r\nfor i in range(b):\r\n\tq,w,e,r = map(str,input().split())\r\n\tv = z[int(q)-1:int(w)]\r\n\tv = v.replace(e,r)\r\n\tz = z[:int(q)-1] + v + z[int(w):] \r\nprint(z)", "n, m = map(int, input().split())\r\na = list(input())\r\nfor i in range(m):\r\n l, r, c1, c2= input().split()\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l-1, r):\r\n if a[j]==c1:\r\n a[j]=c2\r\nfor c in a: print(c, end=\"\")", "\r\nl = list(map(int, input().split()))\r\nst = input()\r\nl1 = [str(i) for i in st]\r\n\r\nfor _ in range(l[1]):\r\n\tl2 = list(input().split())\r\n\tfor j in range(int(l2[0])-1,int(l2[1])):\r\n\t\tif l1[j] == l2[2]:\r\n\t\t\tl1[j] = l2[3]\r\n\r\nprint(*l1,sep = '')\r\n", "n,m=map(int,input().split())\r\ns=list(input())\r\nt=str()\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if s[i]==c1:\r\n s[i]=c2\r\nfor i in range(n):\r\n t+=s[i]\r\nprint(t)\r\n", "length, operations = map(int, input().split())\r\nstring = input()\r\nlst=[]\r\nfor i in string:\r\n lst.append(i)\r\nfor n in range(operations):\r\n start, end, letter1, letter2 = [x for x in input().split()]\r\n start1=int(start)-1\r\n end1=int(end)-1\r\n for i in range(start1, end1+1):\r\n if lst[i]==letter1:\r\n lst[i]=letter2\r\nprint(''.join(lst))", "import re\r\nn,m=map(int,input().split())\r\ns=input()\r\nfor i in range(0,m):\r\n a=list(input().split())\r\n s=s[:int(a[0])-1]+s[int(a[0])-1:int(a[1])].replace(a[2],a[3])+s[int(a[1]):]\r\nprint(s)\r\n\r\n\r\n", "n,m = map(int,input().split())\r\ns = input()\r\nfor i in range(m):\r\n x,y,c,p = input().split()\r\n x=int(x)-1;y=int(y)\r\n s = s[0:x] + s[x:y].replace(c,p) + s[y::]\r\nprint(s)\r\n", "n, m = list(map(int, input().split()))\nstri= input()\nfor i in range(m):\n l, r, c1, c2 = input().split()\n l = int(l)\n r = int(r)\n stri = stri[:l-1] + stri[l-1:r].replace(c1, c2) + stri[r:]\n\nprint(stri)\n\n \t \t \t \t \t \t \t \t \t \t\t \t\t \t", "x,y=[int(x) for x in input().split()]\na=input()\nk=list(a)\nfor _ in range(y):\n p,q,r,s=[str(x) for x in input().split()]\n e=int(p)\n f=int(q)\n for i in range(e-1,f):\n if(k[i]==r):\n k[i]=s\nprint(\"\".join(k))\n", "def change(st, l, r, c1, c2):\r\n return st[0:l] + st[l:r+1].replace(c1, c2) + st[r+1:]\r\n\r\n\r\nn, m = map(int, input().split())\r\ns = input()\r\nfor _ in range(m):\r\n ip = input().split()\r\n s = change(s, int(ip[0])-1, int(ip[1])-1, ip[2], ip[3])\r\nprint(s)\r\n", "n, m = map(int, input().split())\r\ns = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l)-1, int(r)-1\r\n k = s[l:r+1]\r\n k = k.replace(c1,c2)\r\n if r < n:\r\n s = s[:l] + k + s[r+1:]\r\n else:\r\n s = s[:l] + k\r\nprint(s)", "n,m=map(int,input().split())\r\ns=list(str(input()))\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n for j in range(int(l)-1,int(r)):\r\n if s[j]==c1:\r\n s[j]=c2\r\nz=\"\"\r\nprint(z.join(s))", "a=input()+' '\r\ns=input()\r\nb=''\r\nA=[]\r\nfor j in range(len(a)):\r\n if a[j]==' ':\r\n A.append(int(b))\r\n b=''\r\n else:\r\n b+=a[j]\r\nfor i in range(A[1]):\r\n a1=input()+' '\r\n b1=''\r\n A1=[]\r\n for j in range(len(a1)):\r\n if a1[j]==' ':\r\n A1.append(b1)\r\n b1=''\r\n else:\r\n b1+=a1[j]\r\n for i in range(int(A1[0])-1,int(A1[1])):\r\n if s[i]==A1[2]:\r\n s=s[:i]+A1[3]+s[i+1:]\r\nprint(s)\r\n", "n,m = map(int,input().split())\r\ns = input()\r\nlist = [s[i] for i in range(n)]\r\nwhile m > 0:\r\n line = input().split()\r\n l,r = int(line[0]),int(line[1])\r\n x,y = line[2],line[3]\r\n for j in range(l-1,r):\r\n if list[j] == x:\r\n list[j] = y\r\n m -= 1\r\nprint(''.join(list))\r\n", "n, m = map(int, input().split())\r\ns = input()\r\nfor k in range(m):\r\n i, j, a, b = input().split()\r\n l = int(i) - 1\r\n r = int(j)\r\n s = s[:l] + s[l:r].replace(a, b) + s[r:]\r\nprint(s)", "n,k=list(map(int,input().split()))\r\np=list(input())\r\nfor x in range(k):\r\n d,f,g,h=list(map(str,input().split()))\r\n for y in range(int(d)-1,int(f)):\r\n if p[y]==g:\r\n p[y]=h\r\n else:\r\n pass\r\nprint(\"\".join(p))", "#897A in codeforces\r\nn,m = map(int,input().split())\r\nstring = list(i for i in input())\r\nfor _ in range(m):\r\n\tl,r,c1,c2 = map(str,input().split())\r\n\tl = int(l)-1\r\n\tr = int(r)\r\n\tfor i in range(l,r):\r\n\t\tif string[i] == c1:\r\n\t\t\tstring[i] = c2\r\nfor i in string:\r\n\tprint(i,end=\"\")", "n, m = map(int, input().split())\ns = list(input())\nfor i in range(m):\n x = list(input().split())\n for j in range(int(x[0]) - 1, int(x[1])):\n if s[j] == x[2]:\n s[j] = x[3]\nprint(*s, sep='')\n", "n , m = list(map(int,input().split()))\r\nst = input()\r\nfor i in range(m):\r\n\ta,b,c,d = list(input().split())\r\n\tin_ = st[int(a)-1:int(b)]\r\n\tin_ = in_.replace(c,d)\r\n\tst = st[:int(a)-1] + in_ + st[int(b):]\r\nprint(st)\t\r\n", "n,m = map(int, input().split())\ns = list(str(input()))\nfor i in range(m):\n l, r, c1, c2 = map(str, input().split())\n l = int(l)\n r = int(r)\n l, r = l-1, r-1\n for j in range(l, r+1):\n if s[j] == c1:\n s[j] = c2\nprint(''.join(s))\n", "n,m = map(int,input().split())\r\ns = input()\r\ns = list(s)\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for i in range(l-1,r):\r\n if(s[i] == c1):\r\n s[i] = c2\r\nfor i in s:\r\n print(i,end=\"\")", "n,m=map(int,input().split())\r\nst=list(input())\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n for j in range(int(l)-1,int(r)):\r\n if st[j]==c1:\r\n st[j]=c2\r\nans=\"\".join(st)\r\nprint(ans)", "n, m = map(int, input().split())\ns = input()\nl = []\nfor i in range(n):\n l.append(s[i])\nfor i in range(m):\n a, b, x, y = input().split()\n for i in range(int(a) - 1, int(b)):\n if l[i] == x:\n l[i] = y\nfor i in range(n):\n print(l[i], end = \"\")#########111\n\t \t\t\t \t \t \t\t\t \t \t \t \t \t\t\t\t", "n,k=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\nfor i in range(k):\r\n l,r,x,y=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if(s[i]==x):\r\n s[i]=y\r\nprint(''.join(s))\r\n", "n, m = map(int, input().split())\r\nstring = list(input())\r\nfor i in range(m):\r\n a, b, x, y = input().split()\r\n a = int(a)\r\n b = int(b)\r\n for j in range(a - 1, b):\r\n if string[j] == x:\r\n string[j] = y\r\nprint(\"\".join(string))\r\n", "n,m=map(int,input().split())\r\ns=list(input())\r\nfor i in range(m):\r\n l=input().split()\r\n for i in range(int(l[0])-1,int(l[1])):\r\n if s[i]==l[2]: s[i]=l[3]\r\nprint(''.join(s))\r\n \r\n\r\n", "def ChangeSym(str, chanArr):\r\n\tfor i in range(len(str)):\r\n\t\tif str[i] == chanArr[2] and i + 1>= int(chanArr[0]) and i + 1<= int(chanArr[1]):\r\n\t\t\tstr[i] = chanArr[3]\r\n\t\t\t#print(ran)\r\n\treturn str\r\nn, m = map(int, input().split())\r\ns = list(input())\r\nans = ''\r\narr = []\r\nfor i in range(m):\r\n\tarr = list(map(str, input().split()))\r\n\tans = ChangeSym(s, arr)\r\n\tarr = []\r\nprint(''.join(ans))", "n,m=map(int,input().split())\r\nl=list(input())\r\nfor i in range(m):\r\n\ta,b,c,d=map(str,input().split())\r\n\tfor i in range(int(a)-1,int(b)):\r\n\t\tif l[i]==c:\r\n\t\t\tl[i]=d\r\nprint(\"\".join(l))", "length, ops = list(map(int, input().split()))\r\nstring = list(input())\r\nfor i in range(ops):\r\n start, stop, original, new = list(input().split())\r\n start = int(start)\r\n stop = int(stop)\r\n for j in range(start, stop+1):\r\n if string[j-1] == original:\r\n string[j-1] = new\r\nprint(''.join(string))\r\n", "\n\ndef main():\n\n\tn,m = map(int, input().split())\n\n\ts = input()\n\ts = list(s)\n\tfor i in range(0,m):\n\t\tl,r,c1,c2 = input().split(' ')\n\t\tl = int(l)\n\t\tr = int(r)\n\t\tl -= 1\n\t\tr -= 1\n\n\t\tfor j in range(l,r+1):\n\t\t\tif s[j] == c1:\n\t\t\t\ts[j] = c2\n\n\ts = ''.join(str(l) for l in s)\t\n\tprint(s)\n\t\n\n\n\n\n\nmain()\n", "n, m = list(map(int, input().split()))\r\na = list(input())\r\nfor i in range(m):\r\n\tl, r, f, t = input().split()\r\n\tfor i in range(int(l)-1, int(r)):\r\n\t\tif (a[i] == f): a[i] = t\r\nprint(str().join(a))", "n, m = map(int, input().split())\r\ns = list(input().strip())\r\n\r\nwhile m > 0:\r\n m -= 1\r\n l, r, c1, c2 = input().split(' ')\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n while l <= r:\r\n if s[l] == c1:\r\n s[l] = c2\r\n l += 1\r\n\r\nprint(\"\".join(s))\r\n", "n, m = map(int, input().split())\ns = input()\nsarr = list(s)\nfor _ in range(m):\n\tl, r, c1, c2 = input().split()\n\tl, r = int(l), int(r)\n\tfor i in range(l-1, r):\n\t\tif sarr[i] == c1:\n\t\t\tsarr[i] = c2\nprint(\"\".join(sarr))\n", "n,m=map(int,input().split())\r\ns1=input()\r\nl1=[]\r\ns2=\"\"\r\nfor i in s1:\r\n l1.append(i)\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n for i in range(int(l),int(r)+1):\r\n if l1[i-1]==c1:\r\n l1[i-1]=c2\r\nfor i in l1:\r\n s2+=i\r\nprint(s2)", "n, m = map(int, input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n a = list(input().split())\r\n l, r = int(a[0]) - 1, int(a[1])\r\n for j in range(l, r):\r\n if s[j] == a[2]:\r\n s[j] = a[3]\r\nprint(\"\".join(map(str, s)))", "[n, m] = list(map(int, input().split()))\r\nstring = input()\r\n\r\nchange_order = [dict() for x in range(n)]\r\n\r\nnew_string = list(string)\r\n\r\n# print(list(string))\r\n\r\nfor i in range(0, m):\r\n [l1, h1, c1, c2] = list(input().split())\r\n l1 = int(l1)\r\n h1 = int(h1)\r\n\r\n # print(f'\\nChecking {i} it: {l1} {h1} {c1} {c2}')\r\n # print(new_string)\r\n\r\n if l1 == h1:\r\n if new_string[l1 - 1] == c1:\r\n # print(f'In {l1} {new_string[l1 - 1]} -> {c2}')\r\n new_string[l1 - 1] = c2\r\n\r\n # Check interval\r\n else:\r\n for j in range(l1, h1 + 1):\r\n\r\n if new_string[j - 1] == c1:\r\n\r\n # print(f'In {j} {new_string[j - 1]} -> {c2}')\r\n new_string[j - 1] = c2\r\n\r\n\r\n# print(new_string)\r\nnew = ''.join(new_string)\r\nprint(new)", "a=input()\r\nb=a.split()\r\nn=int(b[0])\r\nm=int(b[1])\r\ntext=input()\r\nfor i in range(0,m):\r\n operation=input()\r\n operations=operation.split()\r\n l=int(operations[0])\r\n r=int(operations[1])\r\n c1=operations[2]\r\n c2=operations[3]\r\n if(l>1 & r < n):\r\n text = text[0:l-1]+text[l-1:r].replace(c1,c2)+text[r:]\r\n elif(r < n):\r\n text = text[0:r].replace(c1,c2)+text[r:]\r\n else:\r\n text = text.replace(c1,c2)\r\nprint (text)\r\n\r\n", "n, m = map(int,input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n s1 = list(map(str,input().split()))\r\n for j in range(int(s1[0])-1,int(s1[1])):\r\n if s[j] == s1[2]:\r\n s[j] = s1[3]\r\nprint(*s,sep='')", "n,m=map(int,input().split())\ns=input()\ne=0\ns1=str()\nfor i in range(m):\n l,r,c1,c2=input().split()\n l = int(l)\n r = int(r)\n for j in s:\n e+=1\n if l<=e<=r:\n if j==c1:\n j=c2\n s1+=j\n s=s1\n s1=str()\n e=0\nprint(s)\n \t\t\t \t\t \t \t \t \t\t \t\t", "n, m = [int(tmp) for tmp in input().split()]\r\ns = input()\r\na = []\r\nfor i in range(n) :\r\n\ta.append(s[i])\r\nfor i in range(m) :\r\n\taa, b, c, d = [str(tmp) for tmp in input().split()]\r\n\tfor j in range(int(aa)-1,int(b)) :\r\n\t\tif a[j] == c :\r\n\t\t\ta[j] = d\r\nprint(''.join(map(str,a)))", "n,m=[int(x) for x in input().split()]\r\ns=input()\r\nk=list(s)\r\nfor _ in range(m):\r\n x,y,a,b=input().split()\r\n l=int(x)\r\n r=int(y)\r\n for i in range(l-1,r):\r\n if(k[i]==a):\r\n k[i]=b \r\nd=\"\"\r\nfor j in range(len(k)):\r\n d+=k[j]\r\nprint(d)\r\n ", "a, b = list(map(int, input().split()))\r\ns = list(map(str, input()))\r\nfor i in range(b):\r\n r = list(map(str, input().split()))\r\n for j in range(int(r[0]) - 1, int(r[1])):\r\n g = str(r[3])\r\n if s[j] == r[2]: s[j] = g\r\nprint(*s, sep=\"\")", "n , m = map(int,input().split())\r\na = list(input())\r\nfor i in range(m):\r\n l , r , c1 , c2 = map(str,input().split())\r\n for j in range(int(l),int(r)+1):\r\n if(a[j-1] == c1):\r\n a[j-1] = c2\r\nprint(''.join(a))", "n,m=map(int,input().split())\r\ns=str(input())\r\nl=list(s)\r\nfor i in range(m):\r\n arr=list(map(str,input().split()))\r\n l1=int(arr[0])\r\n l2=int(arr[1])\r\n for j in range(l1-1,l2):\r\n if(l[j]==arr[2]):\r\n l[j]=arr[3]\r\nans=''\r\nfor i in range(n):\r\n ans+=l[i]\r\nprint(ans)", "\"\"\"\nn\nm operations\neach operation:\n l, r, c_1, c_2\n\n all c_1 in range [l,r] get changed to c_2\n\"\"\"\nn,m = [int(a) for a in input().split(' ')]\ns = list(input())\nfor _ in range(m):\n l, r, c_1, c_2 = input().split(' ')\n l=int(l)-1\n r=int(r)-1\n for i in range(l, r+1):\n if s[i] == c_1:\n s[i]=c_2\nprint(''.join(s))", "_,n=map(int,input().split());m=input()\r\nfor case in range(n):a,b,c,d=input().split();z=m[int(a)-1:int(b)];z=z.replace(c,d);m=m[:int(a)-1]+z+m[int(b):]\r\nprint(m)\r\n\r\n\r\n", "nm = list(map(int, input().split()))\r\ns = list(map(str, input()))\r\nfor i in range(nm[1]):\r\n\tlrc = list(map(str, input().split()))\r\n\tfor j in range(int(lrc[0]) - 1, int(lrc[1])):\r\n\t\tif s[j] == lrc[2]:\r\n\t\t\ts[j] = lrc[3]\r\nprint(*s, sep = '')", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\n# aahaddddh\r\n\r\na=list(map(int,input().split()))\r\nb=list(input())\r\nc=[]\r\nfor x in range(a[1]):\r\n\tc.append(input().split())\r\nfor x in range(a[1]):\r\n\tfor z in range(int(c[x][0])-1,int(c[x][1])):\r\n\t\tif c[x][2] ==b[z]:\r\n\t\t\tb[z]=c[x][3]\r\n[print(b[x],end='') for x in range(a[0])]\r\n", "n,m = [int(i) for i in input().split()]\r\nline = input()\r\nfor i in range(m):\r\n operation = input().split()\r\n for j in range(int(operation[0])-1,int(operation[1])):\r\n if line[j] == operation[2]:\r\n line = line[:j]+operation[3]+line[j+1:]\r\nprint(line)\r\n", "n, m = map(int, input().split())\r\ns = str(input())\r\nfor i in range(m):\r\n l, r, c1, c2 = map(str, input().split())\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n for j in range(l, r+1):\r\n if s[j:j+1] == c1:\r\n s = s[:j] + c2 + s[j+1:]\r\nprint(s)", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\ns=input()\r\nl=0\r\nr=0\r\nc1=\"\"\r\nc2=\"\"\r\nfor i in range(m):\r\n a=input().split()\r\n l=int(a[0])-1\r\n r=int(a[1])\r\n c1=a[2]\r\n c2=a[3]\r\n s=s[:l]+s[l:r].replace(c1, c2)+s[r:]\r\nprint(s)", "m,n=map(int,input().split())\ns=input()\nfor i in range(n):\n a,b,c,d=input().split()\n a=int(a)-1\n b=int(b)-1\n s=s[:a]+s[a:b+1].replace(c,d)+s[b+1:]\nprint(\"%s\"%s)\n\n \t\t\t\t\t \t \t \t\t \t\t \t\t\t", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ngiven_str = input()\r\nls_string = [x for x in given_str] # or list(given_str)\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n for i in range(int(l) - 1, int(r)):\r\n if ls_string[i] == c1:\r\n ls_string[i] = c2\r\nprint(''.join([str(elem) for elem in ls_string]))\r\n", "[n, m] = [int(i) for i in input().split()]\r\n\r\ns = list(input())\r\n\r\nfor j in range(m):\r\n [l, r, c1, c2] = input().split()\r\n l, r = int(l), int(r)\r\n \r\n for i in range(l-1, r):\r\n if(s[i] == c1):\r\n s[i] = c2\r\n\r\nprint(''.join(s))", "# cf 897 A 700\nn, m = map(int, input().split())\ns = list(input())\nfor _ in range(m):\n l, r, c1, c2 = input().split()\n l, r = map(int, (l, r))\n\n for i in range(l - 1, r + 1 - 1):\n if s[i] == c1:\n s[i] = c2\nprint(\"\".join(s))\n", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n s = inp[1]\r\n for i in inp[2:]:\r\n r, l, c, d = i.split()\r\n r, l = int(r) - 1, int(l) - 1\r\n s = s[:r] + s[r:l+1].replace(c, d) + s[l+1:]\r\n return s\r\n \r\nprint(main())\r\n", "a,b=list(map(int,input().split()))\r\nlst=list(input())\r\nfor i in range(b):\r\n ls,rs,c1,c2=list(input().split())\r\n l,r=int(ls)-1,int(rs)-1\r\n for j in range(l,r+1):\r\n if(lst[j]==c1):\r\n lst[j]=c2\r\nprint(''.join(lst))", "n,m = [int(i) for i in input().split()]\r\ns = input()\r\nl = n*['']\r\nfor i in range(n):\r\n\tl[i] = s[i]\r\na = m*[0]\r\nb = m*[0]\r\nc = m*['']\r\nd = m*['']\r\nfor i in range(m):\r\n\tk = input().split()\r\n\ta[i] = int(k[0])-1\r\n\tb[i] = int(k[1])\r\n\tc[i] = k[2]\r\n\td[i] = k[3]\r\nfor i in range(m):\r\n\tfor k in range(a[i],b[i]):\r\n\t\tif l[k] == c[i] :\r\n\t\t\tl[k] = d[i]\r\ns = ''\r\nfor i in range(n):\r\n\ts = s+l[i]\r\nprint(s)\r\n", "n, m = map(int,input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n a, b, c, d = input().split()\r\n for i in range(int(a)-1,int(b)):\r\n if s[i] == c:\r\n s[i] = d\r\nfor i in s:\r\n print(i, end='')", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for j in range(l-1,r):\r\n if s[j]==c1:\r\n s=s[:j]+c2+s[j+1:]\r\nprint(s)", "num1, num2 = map(int, input().split())\r\n\r\nlist1 = list(input())\r\nfor _ in range(int(num2)):\r\n l, r, c1, c2 = input().split()\r\n\r\n temb = int(l)-1\r\n for x in range(int(l)-1, int(r)):\r\n\r\n if list1[int(temb)] == c1:\r\n list1[int(temb)] = c2\r\n\r\n temb += 1\r\n\r\nprint(''.join(list1))\r\n\r\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\ns = input()\r\nfor i in range(m):\r\n p = input().split()\r\n l, r = int(p[0]), int(p[1])\r\n s = s[:l-1]+s[l-1:r].replace(p[2],p[3])+s[r:]\r\nprint(s)\r\n", "n, m = map(int, input().split())\r\ns = input()\r\n\r\nfor t in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l), int(r)\r\n\r\n s_left = s[:l - 1]\r\n s_right = s[r:]\r\n s_mid = s[l - 1:r]\r\n #print(\">{},{},{}<\".format(s_left, s_mid, s_right))\r\n s_mid = s_mid.replace(c1, c2)\r\n #print(\">{},{},{}<\".format(s_left, s_mid, s_right))\r\n s = s_left + s_mid + s_right\r\n\r\nprint(s)\r\n", "def repl(word, l, r, c1, c2):\r\n a = word[:l]\r\n b = word[l:r]\r\n c = word[r:]\r\n return a+ b.replace(c1, c2) + c\r\ninp_1 = [int(i) for i in input().split()]\r\nn = inp_1[0]\r\nm = inp_1[1]\r\nword = input()\r\nfor i in range(m):\r\n lst = input().split()\r\n word = repl(word, int(lst[0])-1, int(lst[1]), lst[2], lst[3])\r\nprint(word)", "n,m=map(int,input().split())\r\nn=input()\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n l,r=int(l)-1,int(r)\r\n n=n[:l]+n[l:r].replace(c1,c2)+n[r:]\r\nprint(n)", "n, m = map(int,input().split())\ns = input()\nop = [tuple(input().split()) for _ in range(m)]\nfor o in op:\n l = int(o[0])-1\n r = int(o[1])-1\n for i in range(l,r+1):\n if s[i]==o[2]:\n s = s[:i] + o[3] + s[i+1:]\nprint(s)", "n = input().split()\r\ns = input()\r\n\r\nfor i in range(int(n[1])):\r\n l, r, c1, c2 = input().split()\r\n s = s[: int(l) - 1] + s[int(l) - 1: int(r)].replace(c1, c2) + s[int(r):]\r\n\r\nprint(s)", "def func(s, arr):\r\n\tfor i in range(int(arr[0])-1, int(arr[1])):\r\n\t\tif s[i]==arr[2]:\r\n\t\t\ts[i] = arr[3]\r\n\treturn s\r\nn,m = map(int, input().split(\" \"))\r\ns=list(input())\r\nwhile m:\r\n\tarr = input().split(\" \")\r\n\ts = func(s, arr)\r\n\tm-=1\r\n\r\nst = \"\"\r\nfor i in range(len(s)):\r\n\tst+=s[i]\r\nprint(st)", "n, m = map(int, input().split())\r\ns=input()\r\nfor i in range(m):\r\n x=list(input().split())\r\n x[0]=int(x[0])\r\n x[1]=int(x[1])\r\n s=s[:x[0]-1]+s[x[0]-1:x[1]].replace(x[2], x[3])+s[x[1]:]\r\nprint(s)\r\n", "n,m = [int(x) for x in input().split()]\r\ns = input()\r\nfor i in range(m):\r\n\tl,r,c1,c2 = map(str,input().split())\r\n\tt = int(l)\r\n\td = int(r)\r\n\ts = s[ :t-1]+ s[t-1:d].replace(c1,c2)+ s[d: ]\r\nprint(s)", "n, m = map(int, input().split())\ns = input()\n\nres = ''\nfor j in range(m):\n l, r, c1, c2 = input().split()\n for i in range(n):\n if i >= int(l)-1 and i <= int(r)-1 and s[i] == c1:\n res += c2\n else:\n res += s[i]\n s = res\n res = ''\nprint(s)\n", "def transform_string(word, operations):\r\n letters = list(word)\r\n for operation in operations:\r\n for i in range(int(operation[0]) - 1, int(operation[1])):\r\n if letters[i] == operation[2]:\r\n letters[i] = operation[3]\r\n return \"\".join(letters)\r\n \r\noperations = []\r\nn, m = map(int, input().split())\r\nword = input()\r\nfor _ in range(m):\r\n operation = list(input().split())\r\n operations.append(operation)\r\n \r\nprint(transform_string(word, operations))", "if __name__ == \"__main__\":\n n, m = tuple(map(int, input().split()))\n s = input()\n\n for _ in range(m):\n l, r, c1, c2 = input().split()\n l, r = int(l), int(r)\n new_s = s[:l - 1]\n\n for i in range(l - 1, r):\n if s[i] == c1:\n new_s += c2\n else:\n new_s += s[i]\n\n new_s += s[r:]\n s = new_s\n\n print(s)", "n__, n_ = input().split()\r\ns = []\r\ns.extend(input())\r\nfor _ in range(int(n_)):\r\n l, r, c_1, c_2 = input().split()\r\n for i in range(int(l) - 1, int(r)):\r\n if s[i] == c_1:\r\n s[i] = c_2\r\nprint(*s, sep='')", "n,m = input().split()\r\nstring = list(input().lower())\r\nfor i in range(int(m)):\r\n start,end,chara,rep = input().split()\r\n for i in range(int(start)-1,int(end)):\r\n if string[i] == chara:\r\n string[i] = rep \r\nprint(''.join(string))\r\n\r\n\r\n\r\n", "n,k= map(int, input().split())\r\ns = input()\r\np = []\r\nfor i in s:\r\n p+=i\r\nfor i in range(k):\r\n m = input().split()\r\n for j in range(int(m[0])-1,int(m[1])):\r\n if p[j]==m[2]:\r\n p[j]=m[3]\r\ns = ''\r\nfor i in p:\r\n s+=i\r\nprint(s)", "n,m=map(int,input().split())\r\ns=input()\r\n\r\nfor i in range(m):\r\n p=''\r\n S=list(s)\r\n l,r,c1,c2=input().split()\r\n L=int(l)\r\n R=int(r)\r\n for j in range(L-1,R):\r\n if S[j]==c1:\r\n S[j]=c2\r\n for k in S:\r\n p=p+k\r\n s=p\r\nprint(s)", "s = list(map(int, input().split()))\r\nfirst = input()\r\nthird = []\r\nfor i in range(len(first)):\r\n third.append(first[i])\r\nfor i in range(s[1]):\r\n second = list(map(str, input().split()))\r\n for j in range(int(second[0]) - 1, int(second[1])):\r\n if third[j] == second[2]:\r\n third[j] = second[3]\r\nprint(*third,sep=\"\")", "n = list(map(int, input().split()))\r\nstri = list(input())\r\nfor _ in range(0, n[1]):\r\n take = input().split()\r\n take[0], take[1] = int(take[0]), int(take[1])\r\n for i in range(take[0] - 1, take[1]):\r\n if stri[i] == take[2]:\r\n stri[i] = take[3]\r\nprint(\"\".join(stri))\r\n \r\n ", "n, m = map(int, input().split())\r\n\r\nstrng = list(input())\r\n\r\ntasks = []\r\n\r\nfor i in range(m):\r\n\ttasks.append(list(map(str, input().split())))\r\n\r\nfor i in range(len(tasks)):\r\n\tl = int(tasks[i][0])\r\n\r\n\tr = int(tasks[i][1])\r\n\r\n\tc1 = tasks[i][2]\r\n\r\n\tc2 = tasks[i][3]\r\n\t\r\n\tfor j in range(l-1, r):\r\n\t\tif strng[j] == c1:\r\n\t\t\tstrng[j] = c2\r\nans = ''\r\n\r\nfor i in strng:\r\n\tans += i\r\nprint(ans)\t", "line = input().split(\" \")\r\nlength = int(line[0])\r\nm = int(line[1])\r\n\r\nstring = list(input())\r\n\r\nfor x in range(m):\r\n intake = input().split(\" \")\r\n for y in range(int(intake[0])-1, int(intake[1])):\r\n if string[y] == intake[2]:\r\n string[y] = intake[3]\r\n \r\n\r\nresult = \"\"\r\n\r\nfor b in string:\r\n result += b\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\nstr = list(input())\r\n\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l-1, r):\r\n if c1 == str[j]:\r\n str[j] = c2 \r\n\r\nprint(\"\".join(str))", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int, wtf[0].split())\r\n S = [x for x in wtf[1]]\r\n for i in range(m):\r\n l,r,c1,c2 = wtf[i+2].split()\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l-1,r):\r\n if S[j] == c1:\r\n S[j] = c2\r\n print(''.join(S))\r\n", "n, m = map(int, input().split())\r\ndirection_str = input()\r\nfor i in range(m):\r\n l1, r1, c1, c2 = map(str,input().split())\r\n l,r = int(l1)-1,int(r1)-1\r\n direction_str = direction_str[0:l]+direction_str[l:r+1].replace(c1,c2)+direction_str[r+1:]\r\nprint(direction_str)", "n, m = map(int, input().split())\r\nstr1 = input().lower()\r\nfor j in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = (int(l)-1), int(r)\r\n l1 = [i for i in str1]\r\n for p in range(l, r):\r\n if l1[p] == c1:\r\n l1[p] = c2\r\n s = \"\"\r\n str1 = s.join(l1)\r\nprint(str1)\r\n", "word_length, num_changes = map(int, input().split())\r\nword = list(input())\r\nfor _ in range(num_changes):\r\n left, right, original, new = input().split()\r\n left = int(left) - 1\r\n right = int(right) - 1\r\n for pos in range(left, right+1):\r\n if word[pos] == original:\r\n word[pos] = new\r\nprint(''.join(word))\r\n", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\ns = input()\r\nfor i in range(m):\r\n a = input().split()\r\n l = int(a[0])\r\n r = int(a[1])\r\n c1 = a[2]\r\n c2 = a[3]\r\n for j in range(l - 1 , r):\r\n if s[j] == c1:\r\n s = s[:j] + c2 + s[j + 1:]\r\nprint(s)\r\n", "n,op=map(int,input().split())\nb=input()\na=[]\nfor i in ((b)):\n a+=[i]\nfor kkk in range(op):\n l,r,c1,c2=map(str,input().split())\n for i in range(int(l)-1,int(r)):\n if a[i]==c1:\n a[i]=c2\n \n \n#print(a)\nfor i in a:\n print(i,end=\"\")\n ", "(n,m) = [int(i) for i in input().strip().split(' ')]\r\ns = list(input().strip())\r\nfor _ in range(m):\r\n (l,r,c1,c2) = [i for i in input().strip().split(' ')]\r\n for i in range(int(l)-1, int(r)):\r\n if s[i] == c1:\r\n s[i] = c2\r\nprint(''.join(s))\r\n\r\n\r\n ", "\r\n\r\nn,m = map(int,input().split(' '))\r\n\r\ns = input()\r\n\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split(' ')\r\n s = s[0:int(l)-1]+s[int(l)-1:int(r)].replace(c1,c2)+s[int(r):int(n)]\r\n\r\nprint(s)\r\n", "n, m = [int(i) for i in input().split()]\r\ns = input()\r\n\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n tmp = s[l-1:r].replace(c1, c2)\r\n s = s[:l-1] + tmp + s[r:]\r\nprint(s)", "n, m = [int(x) for x in input().split(' ')]\ns = input()\nfor i in range(m):\n l, r, c1, c2 = [x for x in input().split(' ')]\n l, r = int(l), int(r)\n tmp = s[l-1:r]\n tmp = tmp.replace(c1, c2)\n s = s[:l-1] + tmp + s[r:]\nprint(s)\n", "import bisect\r\n\r\ndef list_output(s): \r\n print(' '.join(map(str, s)))\r\n \r\ndef list_input(s='int'):\r\n if s == 'int':\r\n return list(map(int, input().split())) \r\n elif s == 'float':\r\n return list(map(float, input().split()))\r\n return list(map(str, input().split()))\r\n\r\n[n, m] = list(map(int, input().split()))\r\ns = list(input())\r\nfor _ in range(m):\r\n [l, r, c1, c2] = list(input().split()) \r\n l = int(l)\r\n r = int(r)\r\n l -= 1\r\n r -= 1\r\n for i in range(l, r+1):\r\n if s[i] == c1:\r\n s[i] = c2\r\nprint(''.join(map(str, s)))", "n, m = map(int, input().split())\r\ns = input()\r\ns = list(s)\r\nfor i in range(m):\r\n l, r, c1, c2 = map(str, input().split())\r\n l = int(l)\r\n r = int(r)\r\n l-=1\r\n while l < r:\r\n if s[l] == c1:\r\n s[l] = c2\r\n l += 1\r\nprint(''.join(s))\r\n", "#897A Scarborough Fair\r\n# After the first operation, the string is wxxak.\r\n\r\n# After the second operation, the string is waaak.\r\n\r\n# After the third operation, the string is gaaak\r\n\r\n\r\nn,m=list(map(int,input().split()))\r\ns=input()\r\nz=list(s)\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if z[i]==c1:\r\n z[i]=c2\r\nprint(\"\".join(z))\r\n\r\n\r\n# 5 3\r\n# wxhak\r\n# 3 3 h x\r\n# 1 5 x a\r\n# 1 3 w g", "n, m = [int(s) for s in input().split()]\r\ns = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = [s for s in input().split()]\r\n l, r = int(l), int(r)\r\n for j in range(l-1,r):\r\n if s[j] == c1:\r\n s = s[:j] + c2 + s[j+1:]\r\nprint(s)", "from sys import stdin, stdout\n\ndef main():\n (n, m) = map(int, stdin.readline().strip().split(' '))\n s = list(stdin.readline().strip())\n for i in range(m):\n (l, r, c1, c2) = stdin.readline().strip().split(' ')\n l = int(l) - 1\n r = int(r) - 1\n for j in range(l, r + 1):\n if s[j] == c1:\n s[j] = c2\n print(''.join(s))\n\nmain()\n\n", "n, m = tuple(map(int, input().split()))\nstr_argument = list(str(input()))\n\nfor i in range(m):\n l,r,c1,c2 = tuple(input().split())\n for i in range(int(l), int(r)+1):\n if str_argument[i-1] == c1:\n str_argument[i-1] = c2\n\nresult = ''.join(lit for lit in str_argument)\nprint(result)\n", "n,m=map(int,input().split())\r\ns=input()\r\nlis1=list(s)\r\nfor i in range (m):\r\n\tl,r,c1,c2 = map(str,input().split())\r\n\tfor j in range (int(l)-1,int(r)):\r\n\t\tif lis1[j]==c1:\r\n\t\t\tif j==len(lis1)-1:\r\n\t\t\t\tlis1.pop(j)\r\n\t\t\t\tlis1.append(c2)\r\n\t\t\telse:\r\n\t\t\t lis1.pop(j)\r\n\t\t\t lis1.insert(j,c2)\r\nprint(''.join(lis1))\r\n", "\"\"\"\r\nIIIIIIIIII OOOOOOOOOOO IIIIIIIIII\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\nIIIIIIIIII OOOOOOOOOOO IIIIIIIIII\r\n\"\"\"\r\nn, m = map(int, input().split())\r\ns = input()\r\na = []\r\nfor i in s:\r\n\ta.append(i)\r\nfor i in range(m):\r\n\tl, r, c1, c2 = map(str ,input().split())\r\n\tl = int(l)\r\n\tr = int(r)\r\n\tfor i in range(l - 1, r):\r\n\t\tif a[i] == c1:\r\n\t\t\ta[i] = c2\r\nfor i in a:\r\n\tprint(i, end = \"\")\r\nprint()\r\n\r\n\t\r\n\t\r\n\r\n\t\r\n\t\t\r\n\t\t\r\n\t\r\n", "a,b = list(map(int,input().split()))\r\nc = list(input())\r\nd = []\r\nk = ''\r\nfor i in range(b):\r\n d.append(list(map(str,input().split())))\r\nfor i in range(len(d)):\r\n e = int(d[i][0])\r\n f = int(d[i][1])\r\n for j in range(e-1,f):\r\n if c[j] == d[i][2]:\r\n c[j] = d[i][3]\r\nfor i in range(len(c)):\r\n k += c[i]\r\nprint(k)\r\n", "n,m=map(int,input().split())\r\ns=input()\r\ns=\" \"+s\r\ns=list(s)\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n l=int(l)\r\n r=int(r)\r\n for j in range(l,r+1):\r\n if(s[j]==c1):\r\n s[j]=c2\r\n #print(s)\r\n\r\n \r\nprint((\"\".join(map(str,s))).lstrip())\r\n \r\n ", "n,m = map(int, input().split(' '))\r\n\r\ns = list(input())\r\n\r\nwhile m>0:\r\n l,r,c1,c2 = map(str, input().split(' '))\r\n l = int(l)-1\r\n r = int(r)\r\n\r\n for i in range(l, r):\r\n if s[i] == c1:\r\n s[i] = c2\r\n \r\n m -= 1\r\n\r\ns1 = ''.join(s)\r\n\r\nprint(s1)", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,m=q()\r\n\r\na=list(input())\r\nfor _ in [0]*m:\r\n l,r,x,y=qs()\r\n l,r=map(int,[l,r])\r\n a[l-1:r]=[y if i==x else i for i in a[l-1:r]]\r\nprint(*a,sep='')", "n,m=map(int,input().split())\r\ns=list(input())\r\nfor i in range(m):\r\n l,h,c1,c2=input().split()[:4]\r\n l=int(l)\r\n h=int(h)\r\n for i in range(l-1,h):\r\n if s[i]==c1:\r\n s[i]=c2\r\nprint(''.join(s))\r\n \r\n ", "n, m = map(int, input().strip().split())\r\n\r\ns = list(input().strip())\r\n\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().strip().split()\r\n l = int(l)\r\n r = int(r)\r\n \r\n l -= 1\r\n for i in range(l, r):\r\n s[i] = c2 if s[i] == c1 else s[i]\r\n\r\nprint(''.join(s))", "n,m=list(map(int,input().split()))\r\nz=list(input())\r\n\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if z[i]==c1:\r\n z[i]=c2\r\nprint(\"\".join(z))", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/897/A\r\n\"\"\"\r\n\r\nargs = [int(x) for x in input().split(\" \")]\r\nn = args[0]\r\nm = args[1]\r\n\r\ns = input()\r\n\r\nfor _ in range(m):\r\n args = input().split(\" \")\r\n l = int(args[0])\r\n r = int(args[1])\r\n c1 = args[2]\r\n c2 = args[3]\r\n\r\n if l > 1:\r\n t = s[:l-1]\r\n else:\r\n t = \"\" \r\n\r\n for i in range(l-1, r):\r\n if s[i] == c1:\r\n t += c2\r\n else:\r\n t += s[i]\r\n \r\n t += s[r:]\r\n s = t\r\n\r\nprint(s)\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\ns = list(input())\n\nfor i in range(m):\n\tl, r, c1, c2 = input().split()\n\tl = int(l)\n\tr = int(r)\n\tfor i in range(l, r + 1):\n\t\tif s[i - 1] == c1:\n\t\t\ts[i - 1] = c2\n\nprint(*s, sep='')\n", "l=list(map(int,input().split()))\r\ns=str(input())\r\nfor i in range(l[1]):\r\n m=input()\r\n m=m.split()\r\n p=s[int(m[0])-1:int(m[1])].replace(m[2],m[3])\r\n s=s[0:int(m[0])-1]+p+s[int(m[1]):len(s)]\r\nprint(s)", "n, m = input().split()\r\nn, m = [int(n), int(m)]\r\ns = list(input())\r\nl=[]\r\nr=[]\r\nc1 = []\r\nc2 = []\r\n\r\nfor i in range(m):\r\n a, b, c, d = input().split()\r\n l.append(int(a))\r\n r.append(int(b))\r\n c1.append(c)\r\n c2.append(d)\r\n\r\nfor k in range(m):\r\n for idx in range(len(s)):\r\n if (s[idx]==c1[k]) and (idx >= l[k]-1 and idx <= r[k]-1):\r\n s[idx] = c2[k]\r\n else:\r\n continue\r\n\r\nprint(\"\".join(s))", "\r\na, b=map(int, input().split())\r\ncnt=0\r\nc=input()\r\nx=[]\r\nfor i in range(b):\r\n d,e, f, g=input().split()\r\n d=int(d)-1\r\n e=int(e)\r\n c=c[:d]+c[d:e].replace(f,g)+c[e:]\r\nprint(c)\r\n \r\n \r\n\r\n", "x = [int(i) for i in input().split()]\r\nn,m = x[0],x[1]\r\n\r\ns = input()\r\nfor i in range (m):\r\n a,b,c,d = input().split()\r\n for i in range (int(a)-1,int(b)):\r\n if s[i] == c:\r\n s = s[0:i] + d + s[i+1::]\r\n\r\nprint(s)\r\n \r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\nx,y=map(int,input().split())\r\nA=list(map(str,input()))\r\nfor i in range(y):\r\n\tN=list(map(str,input().split()))\r\n\tl,r=int(N[0]),int(N[1])\r\n\tfor j in range(l-1,r,1):\r\n\t\tif A[j]==N[2]:\r\n\t\t\tA[j]=N[3]\r\nA=''.join(A)\r\nprint(A)\r\n", "n, k = input().split()\r\nn, k = int(n), int(k)\r\ns = input()\r\ns = [x for x in s]\r\nfor i in range(k):\r\n w, x, y, z = input().split()\r\n w, x = int(w), int(x)\r\n for j in range(w-1,x):\r\n if s[j] == y:\r\n s[j] = z\r\nprint(''.join(s))\r\n", "n, m = input().split()\r\nname = [x for x in input()]\r\nfor i in range(int(m)):\r\n a, b, x, y = input().split()\r\n for index in range(int(a) - 1, int(b)):\r\n if name[index] == x:\r\n name[index] = y\r\nprint(\"\".join(name))", "def main():\n [_, m] = [int(x) for x in input().split()]\n origine = ' ' + input()\n intermediaire = None\n\n for i in range(m):\n tache_data = input().split()\n left = int(tache_data[0])\n right = int(tache_data[1])\n c1 = tache_data[2]\n c2 = tache_data[3]\n\n before = origine if intermediaire is None else intermediaire\n after = \\\n before[0:left] \\\n + before[left:(right + 1)].replace(c1, c2) \\\n + before[(right + 1):]\n intermediaire = after\n result = intermediaire\n print(result[1:])\n\n\nif __name__ == '__main__':\n main()\n", "baris = input()\r\nstring = baris.split(' ')\r\nn = int(string[0])\r\nm = int(string[1])\r\n\r\ns = input()\r\n\r\nfor i in range(0, m):\r\n baris = input()\r\n string = baris.split(' ')\r\n\r\n l = int(string[0])\r\n r = int(string[1])\r\n c1 = string[2]\r\n c2 = string[3]\r\n\r\n for j in range(l, r+1):\r\n if s[j-1] == c1: \r\n s = s[0:j-1] + c2 + s[j:]\r\n\r\nprint(s)", "n,m = map(int,input().split())\r\nword = input()\r\nword_list = list(word)\r\n\r\nwhile m>0:\r\n l,r,c1,c2 = input().split()\r\n for i in range(int(l)-1,int(r)):\r\n if word_list[i] == c1:\r\n word_list[i] = c2\r\n m-=1\r\n\r\n\r\nprint(\"\".join(word_list))\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nfor i in range(k):\r\n x,y,c,d=input().split()\r\n a=int(x)\r\n b=int(y)\r\n if b<n:\r\n s=s[:a-1]+s[a-1:b].replace(c,d)+s[b:]\r\n else:\r\n s=s[:a-1]+s[a-1:b].replace(c,d)\r\nprint(s)", "n_m = input().split(\" \")\r\nn = int(n_m[0])\r\nm = int(n_m[1])\r\noriginal = input()\r\nres = original\r\nfor i in range(m):\r\n l_r_c1_c2 = input().split(\" \")\r\n l = int(l_r_c1_c2[0])-1\r\n r = int(l_r_c1_c2[1])\r\n c1 = l_r_c1_c2[2]\r\n c2 = l_r_c1_c2[3]\r\n temp = res[:l]\r\n while l<r:\r\n if res[l] == c1:\r\n temp+=c2\r\n else:\r\n temp+= res[l]\r\n l+=1\r\n temp+=res[l:]\r\n res = temp\r\nprint(res)# 1690651438.3519967", "n, m = [int(i) for i in input().split(' ')]\r\ns = input()\r\nfor i in range(m):\r\n s = list(s)\r\n l, r, c1, c2 = input().split(' ')\r\n l, r = int(l), int(r)\r\n for idx in range(l-1, r):\r\n if s[idx] == c1:\r\n s[idx] = c2\r\ns = ''.join(s)\r\nprint(s)", "n,m = map(int, input().split(' '))\r\ns = [*(str(input()))]\r\n\r\nwhile m:\r\n lst = list(input().split(' '))\r\n l = int(lst[0])\r\n r = int(lst[1])\r\n c1 = str(lst[2])\r\n c2 = str(lst[3])\r\n for ele in range(l-1,r):\r\n if s[ele] == c1:\r\n s[ele] = c2\r\n m -= 1\r\nprint(''.join(s))", "n,m=map(int,input().split())\r\ns=list(input())\r\nfor _ in [0]*m:\r\n l,r,a,b=map(str,input().split());\r\n for i in range(int(l)-1,int(r)):\r\n if s[i]==a:s[i]=b\r\nprint(''.join(s))", "a, b = map(int, input().split())\r\ns = [x for x in input()]\r\nfor i in range(b):\r\n c = input().split()\r\n c[0], c[1] = int(c[0]), int(c[1])\r\n for x in range(c[0] - 1, c[1]):\r\n if s[x] == c[2]:\r\n s[x] = c[3]\r\nprint(\"\".join(s))", "n,m=[int(i) for i in input().split()]\r\nlyric=list(input())\r\nfor i in range(m):\r\n\tl1,r1,c1,c2=input().split()\r\n\tl,r=int(l1),int(r1)\r\n\t\r\n\tfor j in range(l-1,r):\r\n\t\tif lyric[j]==c1:\r\n\t\t\tlyric.pop(j)\r\n\t\t\tlyric.insert(j,c2)\r\nprint(''.join(lyric))\r\n", "n, m = map(int, input().split())\r\ns = list(input())\r\n\r\nfor i in range(m):\r\n l, r, c1, c2 = list(input().split())\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n for t in range(l, r + 1):\r\n if(s[t] == c1):s[t] = c2\r\n\r\nprint(''.join(s))\r\n", "n, m = map(int, input().split())\r\ns = input()\r\nfor u in range(m):\r\n l, r, c1, c2 = map(str, input().split())\r\n l, r = int(l), int(r)\r\n for x in range(l - 1, r):\r\n if s[x] == c1: s = s[0:x] + c2 + s[x + 1:n]\r\nprint(s)", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef listinput(): return list(map(int, sys.stdin.readline().strip().split())) \r\nn,m=minput()\r\ns=list(map(str,input()))\r\nfor j in range(m):\r\n operation=list(map(str,input().split()))\r\n for i in range(int(operation[0])-1,int(operation[1])):\r\n if s[i]==operation[2]:\r\n s[i]=operation[3]\r\nprint(''.join(s))", "n , m = map(int,input().split())\r\ns = list(input())\r\nfor _ in range(m):\r\n l , r , c1 , c2 = input().split()\r\n l , r = int(l) , int(r)\r\n l-=1\r\n for i in range(l,r):\r\n if s[i]==c1:\r\n s[i] = c2\r\nprint(''.join(s))\r\n", "n, m= [int(i) for i in input().split()]\r\ns=input()\r\na=[]\r\nfor i in s:\r\n a.append(i)\r\nfor i in range(m):\r\n x, y, c, b = input().split()\r\n x=int(x)\r\n y=int(y)\r\n for j in range(x-1, y):\r\n if a[j]==c:\r\n a[j]=b\r\nfor i in a:\r\n print(i, end='')", "n = list(map(int, input().split()))\r\na = str(input())\r\nc = [i for i in a]\r\n\r\n\r\nfor i in range(n[1]):\r\n b = list(map(str, input().split()))\r\n \r\n for j in range(int(b[0]), int(b[1])+1):\r\n if c[j-1] == b[2]:\r\n c[j-1] = b[3]\r\n\r\n \r\nfor i in c:\r\n print(i, end='')\r\n", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n\tl,r,c1,c2=map(str,input().split())\r\n\tl,r=int(l)-1,int(r)-1\r\n\ts1=s[0:l]\r\n\ts2=s[l:r+1]\r\n\ts3=s[r+1:n]\r\n\ts2=s2.replace(c1,c2)\r\n\ts=s1+s2+s3\r\nprint(s)", "def FinalString(n, m, s, f):\r\n s = list(s)\r\n for i in range(m):\r\n l = int(f[i][0])\r\n u = int(f[i][1])\r\n #print(u)\r\n for j in range(l - 1, u):\r\n # print(j)\r\n if s[j] == f[i][2]:\r\n s[j] = f[i][3]\r\n res= \"\"\r\n for i in range(len(s)):\r\n res = res + s[i]\r\n return res\r\nn, m = map(int, input().split())\r\ns = input()\r\nf = []\r\nfor i in range(m):\r\n f1 = [n for n in input().split()]\r\n f.append(f1)\r\nprint(FinalString(n, m, s, f))\r\n ", "#http://codeforces.com/contest/897/problem/A\r\nn, m = map(int, input().split());\r\ns = list(input());\r\nfor i in range(m):\r\n a = input().split();\r\n l = int(a[0]);\r\n r = int(a[1]);\r\n c1 = a[2];\r\n c2 = a[3];\r\n for j in range(l - 1, r):\r\n if (s[j] == c1):\r\n s[j] = c2;\r\nprint (''.join(s));\r\n", "import sys\n\n\ndef readLine():\n return [int(i) for i in next(sys.stdin).strip().split()]\n\nn, m = readLine()\n\nstring = [c for c in next(sys.stdin).strip()]\n\nfor _ in range(m):\n l, r, c1, c2 = next(sys.stdin).strip().split()\n for i in range(int(l) - 1, int(r)):\n if string[i] == c1:\n string[i] = c2\n\nprint(\"\".join(string)) \n", "n, m = [int(x) for x in input().split()]\r\nx = input()\r\ny = []\r\nfor c in x:\r\n y.append(c)\r\nfor _ in range(m):\r\n l, r, a, b = [x for x in input().split()]\r\n l = int(l)\r\n r = int(r)\r\n for i in range(l - 1, r):\r\n if y[i] == a:\r\n y[i] = b\r\nprint(''.join(y))", "n, m = map(int, input().split())\r\ns = list(i for i in input())\r\nfor i in range(m):\r\n\tl, r, c1, c2 =input().split()\r\n\tfor j in range(int(l)-1, int(r)):\r\n\t\tif s[j] == c1:\r\n\t\t\ts[j] = c2\r\nprint(*s, sep='')\r\n", "n,m=list(map(int,input().split()))\r\ns=list(str(input()))\r\nfor i in range(m):\r\n\tl,r,c1,c2=list(input().split(\" \"))\r\n\tfor j in range(int(l)-1,int(r)):\r\n\t\tif s[j] == c1:\r\n\t\t\ts[j] = c2\r\nprint(\"\".join(s))", "#WAS FUN FINDING THE SOLUTIO :)\r\n\r\nn, m=map(int, input().split())\r\ns=input()\r\n\r\nfor _ in range(m):\r\n\ts1=\"\"\r\n\tl, r, c1, c2 = input().split()\r\n\tl, r=int(l), int(r)\r\n\tif l-1>=1: #--->To prevent to go to the last of string\r\n\t\ts1+=s[:l-1]\r\n\tfor i in range(l-1, r):\r\n\t\tif s[i]==c1:\r\n\t\t\ts1+=c2\r\n\t\telse:\r\n\t\t\ts1+=s[i]\r\n\ts1+=s[r:]\r\n\ts=s1\r\nprint(s)", "n,m=list(map(int,input().split()))\r\ns=str(input()).lower()\r\ns1=tuple(s)\r\ns2=list(s1)\r\nfor i in range(m):\r\n\tl,r,c1,c2=list(map(str,input().split()))\r\n\tfor j in range(int(l)-1,int(r)):\r\n\t\tif s2[j]==c1:\r\n\t\t\ts2[j]=c2\r\nprint(\"\".join(s2))", "n,m=map(int,input().split())\r\ns=input()\r\ntemp = s\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n l=int(l)\r\n r=int(r)\r\n # print(c1,c2)\r\n\r\n new1 = temp[l-1:r]\r\n new2 = new1.replace(c1,c2)\r\n new3 = temp[:l-1] + new2 + temp[r:]\r\n temp = new3\r\nprint(new3)\r\n", "n,m=[int(i) for i in input().split()]\r\na=input()\r\nfor i in range(m):\r\n h=input()\r\n h=h.split()\r\n h[0]=int(h[0])\r\n h[1]=int(h[1])\r\n l=h[0]-1\r\n r=h[1]-1\r\n c1=h[2]\r\n c2=h[3]\r\n a=a[:l]+a[l:r+1].replace(c1,c2)+a[r+1:]\r\nprint(a)\r\n", "n, m = map(int, input().split(\" \"))\ns = input()\nfor _ in range(m):\n l, r, c1, c2 = input().split(\" \")\n l, r = int(l), int(r)\n s = s[:l-1] + c2.join(s[l-1:r].split(c1)) + s[r:]\nprint(s)\n", "n, m = map(int, input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n for j in range(int(l)-1, int(r)):\r\n if s[j]==c1: s[j] = c2\r\nprint(''.join(s))\r\n", "# import sys\n# import time\n# sys.stdin=open(\"utest.in\",\"r\")\n# sys.stdout=open(\"utest.out\",\"w\")\n\nn,m=map(int,input().split())\nstring=list(input())\nfor i in range(m):\n\tn=input().split()\n\tfor i in range(int(n[0])-1,int(n[1])):\n\t\tif string[i]==n[2]:\n\t\t\tstring[i]=str(n[3])\nfor i in string:\n\tprint(i,end=\"\")\n\n", "n, m = map(int, input().split())\r\nseq = [x for x in input()]\r\n\r\nfor _ in range(m):\r\n *lr, c1, c2 = input().split()\r\n l, r = map(lambda x: int(x) - 1, lr)\r\n\r\n for i in range(l, r + 1):\r\n if seq[i] == c1:\r\n seq[i] = c2\r\n\r\nprint(\"\".join(seq))\r\n", "n,m = map(int,input().split())\r\ns = input()\r\nfor _ in range(m):\r\n l,r,c1,c2 = input().split()\r\n l = int(l) - 1\r\n r = int(r)\r\n## for i in range(l,r+1):\r\n s = s[:l]+s[l:r].replace(c1,c2)+s[r:]\r\nprint(s)\r\n", "n,m = map(int,input().split())\r\ns=input()\r\nz=list(s)\r\nfor i in range(m):\r\n l,r,c1,c2 = map(str,input().split())\r\n\r\n for i in range(int(l)-1,int(r)):\r\n if z[i]==c1:\r\n z[i]=c2\r\n \r\n\r\nprint(\"\".join(z))\r\n", "n,m=map(int,input().split())\r\nt=list(input())\r\nfor i in range(m):\r\n q=input().split()\r\n l,r,c,d=int(q[0]),int(q[1]),q[2],q[3]\r\n for i in range(l-1,r):\r\n if t[i]==c:\r\n t[i]=d\r\nprint(*t,sep='')\r\n", "n, m = map(int, input().split())\r\ns = list(input())\r\n\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for idx in range(l-1, r):\r\n if s[idx]==c1:\r\n s[idx] = c2\r\nprint(''.join(s))", "a = input().split(' ')\r\nb = list(input())\r\nc = int(a[1])\r\nwhile c > 0:\r\n query = input().split(' ')\r\n for t in range(int(query[0]) - 1, int(query[1])):\r\n if b[t] == query[2]:\r\n b[t] = query[3]\r\n c -= 1\r\nprint(''.join(b))", "n, o = map(int, input().split())\r\nstr = list(i for i in input())\r\nfor i in range(o):\r\n\tl, r, c1, c2 =input().split()\r\n\tfor j in range(int(l)-1, int(r)):\r\n\t\tif str[j] == c1:\r\n\t\t\tstr[j] = c2\r\nprint(*str , sep='')", "n=[int(x) for x in input().split()]\r\ns=[x for x in input()]\r\nfor i in range(n[1]):\r\n p=[x for x in input().split()]\r\n for j in range(int(p[0])-1, int(p[1])):\r\n if (s[j]==p[2]):\r\n s[j]=p[3]\r\n\r\nfor e in s:\r\n print(e,end=\"\")", "length, times = input().split(' ')\nstring = list(input())\n\nfor i in range(int(times)):\n data = input().split(' ')\n indecies = [int(x) for x in data[:2]]\n chars = data[2:]\n for x in range(indecies[0]-1, indecies[1]):\n if string[x] == chars[0]:\n string[x] = chars[1]\nprint(''.join(string))\n", "n, m = map(int, input().split())\r\nw = input()\r\nfor _ in range(m):\r\n l,r,c1,c2 = input().split()\r\n l, r = int(l)-1, int(r)-1\r\n w = w[:l] + w[l:r+1].replace(c1, c2) + w[r+1:]\r\nprint(w)", "n,m=map(int,input().split())\r\ns=input()\r\nli=[]\r\nslist=[]\r\nfor i in s:\r\n slist.append(i)\r\n \r\nfor i in range(m):\r\n a=input().split()\r\n li.append(a)\r\n \r\nfor i in range(m):\r\n for j in range(int(li[i][0])-1,int(li[i][1])):\r\n if(slist[j]==li[i][2]):\r\n slist[j]=li[i][3]\r\n \r\ns=''\r\nfor i in slist:\r\n s+=i\r\nprint(s)", "n, m = map(int, input().split())\r\nstr = input()\r\n\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n str = str[:int(l)-1] + str[int(l)-1:int(r)].replace(c1, c2) + str[int(r)::1]\r\n\r\nprint(str)", "nm=input().split()\r\na=input()\r\nfor i in range(int(nm[1])):\r\n b=input().split()\r\n c=int(b[0])-1\r\n d=int(b[1])\r\n a=a[:c]+a[c:d].replace(b[2],b[3])+a[d:]\r\n \r\nprint(a)", "n, m = map(int, input().split())\r\nst = input()\r\nst = list(st)\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n for j in range(int(l) - 1, int(r)):\r\n if st[j] == c1:\r\n st[j] = c2\r\nfor i in range(len(st)):\r\n print(st[i], end = \"\")", "n,k=map(int,input().split())\r\ns=input()\r\nl=list(s)\r\nfor o in range(k):\r\n #print(o)\r\n x=input().split()\r\n #print(x)\r\n a=int(x[0])-1\r\n b=int(x[1])-1\r\n if a==b and l[a]==x[2]:\r\n l[a]=x[3]\r\n else:\r\n for i in range(a,b+1):\r\n #print(i)\r\n if l[i]==x[2]:\r\n l[i]=x[3]\r\ns=\"\"\r\nfor i in range(n):\r\n s=s+l[i]\r\nprint(s)\r\n \r\n", "(n,m)=map(int,input().split())\r\ns = str(input())\r\nli = []\r\nfor i in range(len(s)):\r\n li.append(s[i])\r\n \r\nfor i in range(m):\r\n (l,r,c1,c2) = map(str,input().split())\r\n l = int(l)\r\n l-=1\r\n r = int(r)\r\n for j in range(l,r):\r\n if li[j]==c1:\r\n li[j]=c2\r\nans = \"\"\r\nfor j in li:\r\n ans+=j\r\nprint(ans)\r\n", "s1 = str(input())\r\nd1 = s1.split()\r\n\r\nn = int(d1[0])\r\nm = int(d1[1])\r\n\r\ns = str(input())\r\nfs = list(s)\r\n\r\nwhile m > 0:\r\n m -= 1\r\n \r\n s2 = str(input())\r\n d2 = s2.split()\r\n \r\n l = int(d2[0]) - 1\r\n r = int(d2[1]) - 1\r\n c1 = str(d2[2])\r\n c2 = str(d2[3])\r\n \r\n cnt = 0\r\n for i in fs[l:r+1]:\r\n if i == c1:\r\n fs[l+cnt] = c2\r\n cnt += 1\r\n\r\nfor i in fs:\r\n print(i,end='')\r\nprint()", "n,m = map(int,input().split())\r\ns1 = input()\r\n \r\nfor i in range (0,m):\r\n l,r,c1,c2 = input().split()\r\n l,r = int(l)-1,int(r)-1\r\n list1 = []\r\n for j in range(0,n):\r\n list1.append(s1[j])\r\n for x in range(l,r+1): \r\n if list1[x]==c1:\r\n list1[x] = c2\r\n s1 = ''.join(list1)\r\nprint(s1)", "fl = input().split()\nn=int(fl[0])\nm=int(fl[1])\ns=input()\n\nfor i in range(m):\n tl = input().split()\n l = int(tl[0])\n r = int(tl[1])\n c1 = tl[2]\n c2 = tl[3]\n s = s[0:l-1] + s[l-1:r].replace(c1,c2) + s[r:]\n\nprint(s)", "def answer():\r\n a = [int(x) for x in input().split()]\r\n p = a[0]\r\n n = a[1]\r\n targ = list(input())\r\n while n:\r\n t = input().split()\r\n l = int(t[0])\r\n r = int(t[1])\r\n c1 = t[2]\r\n c2 = t[3]\r\n i=l-1\r\n while i<r:\r\n if targ[i]==c1:\r\n targ[i]=c2\r\n i+=1\r\n n-=1\r\n c_out =\"\"\r\n for x in targ:\r\n c_out+=x\r\n print(c_out)\r\nanswer()", "\r\ndef main():\r\n\tm = int(input().split()[1])\r\n\ts = input()\r\n\tfor i in range(m):\r\n\t\tl, r, c, d = input().split()\r\n\t\tfor j in range(int(l)-1, int(r)):\r\n\t\t\tif s[j] == c:\r\n\t\t\t\ts = s[:j] + d + s[j+1:]\r\n\tprint(s)\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "# The place between your comfort zone and your dream is where life takes place. Helen Keller\r\n# by : Blue Edge - Create some chaos\r\n\r\nn,m=map(int,input().split())\r\ns=list(input())\r\nwhile m:\r\n m-=1\r\n # print(s)\r\n l,r,c1,c2=input().split()\r\n l,r=int(l),int(r)\r\n # print(c1,c2)\r\n for i in range(l-1,r):\r\n # print(s[i],c1)\r\n if s[i]==c1:\r\n s[i]=c2\r\n\r\ns=\"\".join(s)\r\nprint(s)\r\n", "L = input().split()\r\nn = int(L[0]) #Lengh de la cadena\r\n\r\nm = int(L[1]) # Numero de operaciones\r\ns = input() #Cadena\r\nfor i in range (m):\r\n O = input().split()\r\n ini = int(O[0])\r\n fin = int(O[1])\r\n b = O[2]\r\n ca = O[3]\r\n pal = \"\"\r\n for j in range (n):\r\n if s[j] == b and j >= ini-1 and j <=fin-1:\r\n pal = pal + ca\r\n else:\r\n pal = pal + s[j]\r\n s = pal\r\n \r\nprint(s)\r\n ", "n, m = map(int, input().split())\r\ns = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l), int(r)\r\n for j in range(l - 1, r):\r\n if s[j] == c1:\r\n s = s[:j] + c2 + s[j + 1:]\r\nprint(s)", "n , m = map(int,input().split())\r\ns = input()\r\ns = list(s)\r\nfor i in range(m):\r\n l ,r ,c1 ,c2 = map(str , input().split())\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l-1, r):\r\n if s[j] == c1:\r\n s.pop(j)\r\n s.insert(j , c2)\r\nstr1 = \"\"\r\nfor k in s:\r\n str1+=k\r\nif n != 3 or m != 1:\r\n print(str1)\r\nelse:\r\n print(\"noi\")", "n,m=map(int,input().split())\r\ns=list(input())\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n for j in range(int(l)-1,int(r)):\r\n if(s[j]==c1):\r\n s[j]=c2\r\nprint(''.join(s))", "n, m = input().split()\r\n\r\nn=int(n)\r\nm=int(m)\r\n\r\nrow = input()\r\n\r\nfor i in range(0, m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for j in range(l-1,r):\r\n if row[j]==c1:\r\n \r\n res=list(row)\r\n res[j]=c2\r\n \r\n row=\"\"\r\n for item in res:\r\n row+=item\r\n\r\n\r\nprint(row)\r\n", "n,m=map(int,input().split())\r\nq=input()\r\ns=[]\r\nfor i in q:\r\n s.append(i)\r\n\r\n\r\n\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for j in range(l-1,r):\r\n if s[j]==c1:\r\n s[j]=c2\r\nfor i in s:\r\n print(i,end='')\r\n", "n,a = map(int,input().split())\r\nstring = input()\r\nfor i in range(a):\r\n l,r,c1,c2 = input().split()\r\n string = string[:int(l)-1]+string[int(l)-1:int(r)].replace(c1,c2)+string[int(r):]\r\nprint(string)", "for a in range(int(input().split(' ')[1])):\r\n if a == 0:\r\n s = input()\r\n m = input().split(' ')\r\n s = s[:int(m[0])-1] + s[int(m[0])-1:int(m[1])].replace(m[2],m[3]) + s[int(m[1]):]\r\nprint(s)", "n,m=map(int,input().split())\r\ns=input()\r\n\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n for i in range(int(l)-1,int(r),1):\r\n if(s[i]==c1):\r\n s=s[0:i]+c2+s[i+1:len(s)]\r\nprint(s,end=\"\")", "l,m=input().split()\ns=input()\nl=int(l)\na=[]\nfor i in range(l):\n a.append(s[i])\nm=int(m)\nfor i in range (m):\n be,en,c1,c2=input().split()\n be=int(be)\n en=int(en)\n for j in range (be-1,en):\n if a[j]==c1:\n a[j]=c2\nfor i in range(l):\n print(a[i],end=\"\")", "l1 = [int(i) for i in input().split()]\r\nn, m, x, res = l1[0], l1[1], list(input()), []\r\nfor i in range(m):\r\n res.append(input().split())\r\nfor i in res:\r\n for p in range(int(i[0])-1, int(i[1])):\r\n if x[p] == i[2]:\r\n x[p] = i[3]\r\nprint(''.join(x))\r\n", "def solve():\r\n n,m=list(map(int,input().split()))\r\n s=input()\r\n l=list(s)\r\n while(m>0):\r\n x=tuple(input().split())\r\n for i in range(int(x[0])-1,int(x[1])):\r\n if(l[i]==x[2]):\r\n l[i]=x[3]\r\n m-=1\r\n print(*l,sep='')\r\nsolve()", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n s1=input().split()\r\n x=int(s1[0])\r\n y=int(s1[1])\r\n for j in range(x,y+1):\r\n if s[j-1]==s1[2]:\r\n s=s[:j-1]+s1[3]+s[j:]\r\nprint(s) \r\n ", "x,y=map(int,input().split())\r\nb=list(input())\r\nfor i in range(y):\r\n l=list(input().split())\r\n for j in range(int(l[0])-1,int(l[1])):\r\n if b[j]==l[2]:\r\n b[j]=l[3]\r\nfor i in b:\r\n print(i,end='')", "n,m=map(int,input().split())\r\na=input()\r\nfor i in range(m):\r\n\tl=[]\r\n\tl=list(map(str,input().split()))\r\n\ta=a[:int(l[0])-1]+a[int(l[0])-1:int(l[1])].replace(l[2],l[3])+a[int(l[1]):]\r\nprint(a)\t", "n , m = map(int,input().split())\r\na = list(input())\r\nfor i in range(m):\r\n l , r , c1 , c2 = map(str,input().split())\r\n for j in range(int(l)-1,int(r)):\r\n if(a[j] == c1):\r\n a[j] = c2\r\nprint(''.join(a))", "nums = input()\r\nnum_list = nums.split()\r\nn, m = int(num_list[0]), int(num_list[1])\r\n\r\ns = input()\r\n\r\nwhile m:\r\n values = input()\r\n res = \"\"\r\n value_list = values.split()\r\n l = int(value_list[0])-1\r\n r = int(value_list[1])-1\r\n ch = value_list[2]\r\n to = value_list[3]\r\n\r\n for i in range(0, len(s)):\r\n if i>=l and i<=r and s[i]==ch:\r\n res += to\r\n else:\r\n res += s[i]\r\n m-=1 \r\n s = res\r\n\r\nprint(s)", "s=input().split()\r\nn=int(s[0])\r\nm=int(s[1])\r\na=list(input())\r\ni=0\r\nwhile i<m :\r\n s=input().split()\r\n l=[int(s[0]),int(s[1]),s[2],s[3]]\r\n while l[0]<=l[1] :\r\n if a[l[0]-1]==l[2]:\r\n a[l[0]-1]=l[3]\r\n l[0]+=1\r\n i+=1\r\nprint(\"\".join(a))\r\n", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(0,m):\r\n arr=list(map(str,input().split()))\r\n for j in range(int(arr[0])-1,int(arr[1])):\r\n if (s[j]==arr[2]):\r\n s=s[:j]+arr[3]+s[j+1:]\r\nprint(s)", "n,m = map(int,input().split())\r\ns = input()\r\nfor i in range(m):\r\n l,r,c1,c2 = map(str,input().split())\r\n s = s[:int(l)-1]+s[int(l)-1:int(r)].replace(c1,c2) + s[int(r):]\r\n \r\n \r\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 7 22:58:07 2017\r\n\r\n@author: ms\r\n\"\"\"\r\n\r\ndef main():\r\n nm = input().split()\r\n n = int(nm[0])\r\n m = int(nm[1])\r\n \r\n s = input()\r\n \r\n for i in range(m):\r\n lrc1c2 = input().split()\r\n l = int(lrc1c2[0])\r\n r = int(lrc1c2[1])\r\n c1 = lrc1c2[2]\r\n c2 = lrc1c2[3]\r\n \r\n for j in range(l-1, r):\r\n if (s[j] == c1):\r\n s = s[:j] + c2 + s[j+1:]\r\n \r\n print(s)\r\n return s\r\n \r\nif __name__ == '__main__':\r\n main()", "n, m = map(int, input().split())\r\ns = [c for c in input()]\r\nans = []\r\nfor _ in range(m):\r\n a,b,c,d = input().split()\r\n a = int(a)\r\n b = int(b)\r\n ans.append((a,b,c,d))\r\n\r\nfor c in ans:\r\n l,r,c1,c2 = c\r\n for i in range(l-1, r):\r\n if s[i]==c1:\r\n s[i] = c2\r\nprint(''.join(s))\r\n\r\n", "n,m=map(int,input().split())\r\ni=list(input())\r\nfor x in range(m):\r\n\ta,b,c,d=input().split()\r\n\tfor x in range(int(a)-1,int(b)):\r\n\t\tif i[x]==c:\r\n\t\t\ti[x]=d\r\nprint(\"\".join(i))", "lent, tests = map(int, input().split(' '))\r\ninp = input()\r\nfor i in range(tests):\r\n start, end, act, chn = input().split()\r\n start = int(start) - 1\r\n end = int(end) - 1 \r\n strr = ''\r\n for i in range(start, end+1):\r\n if inp[i] == act:\r\n strr += chn\r\n else:\r\n strr += inp[i]\r\n #print(inp[i])\r\n inp = (inp[0:start] + strr + inp[end+1:])\r\nprint(inp)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ndata = input().rstrip()\r\n\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().rstrip().split()\r\n for i in range(int(l) - 1, int(r)):\r\n if data[i] == c1:\r\n data = data[:i] + c2 + data[i + 1:]\r\n\r\nprint(\"\".join(data))\r\n", "s=input()\r\ns=s.split()\r\ns=[int(i) for i in s]\r\nn=s[0]\r\nm=s[1]\r\n\r\ns=input()\r\nx=[]\r\nx.append(\"blank\")\r\n\r\nfor i in range(m):\r\n t=input()\r\n t=t.split()\r\n x.append(t)\r\n\r\ny=[]\r\ny.append(s)\r\n\r\nfor i in range (1,m+1):\r\n l=int(x[i][0])-1\r\n r=int(x[i][1])-1\r\n c1=x[i][2]\r\n c2=x[i][3]\r\n \r\n t=\"\" \r\n j=0\r\n while (j<len(s)):\r\n if j in range (l,r+1):\r\n t+=y[i-1][l:r+1].replace(c1,c2)\r\n j=r\r\n else:\r\n t+=y[i-1][j]\r\n j+=1\r\n y.append(t)\r\n \r\np=len(y)-1 \r\nprint(y[p])", "n,m=list(map(int,input().split()))\r\ns=input()\r\nt=list(s)\r\nresult=\"\"\r\nfor i in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n for i in range(int(l)-1,int(r)):\r\n if t[i]==c1:\r\n t[i]=c2\r\nresult=result.join(t)\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\ns = list(input())\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l), int(r)\r\n s = [c2 if (s[i]==c1 and l<=i+1<=r) else s[i] for i in range(n)]\r\nprint(\"\".join(s))", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n l,r,x,y=map(str,input().split())\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if s[i]==x:\r\n s=s[:i]+y+s[i+1:]\r\nprint(s)", "n,m=map(int,input().split())\r\ns=input()\r\nfor j in range(m):\r\n f=input().split()\r\n l=int(f[0])\r\n r=int(f[1])\r\n x=f[2]\r\n y=f[3]\r\n\r\n for i in range(l-1,r):\r\n if(s[i]==x):\r\n s=s[:i]+y+s[i+1:]\r\nprint(s)\r\n", "nums = [int(i) for i in input().split()]\r\nstring = input()\r\ntemp = list(string)\r\nfor x in range(nums[1]):\r\n entries = [i for i in input().split()]\r\n entries[0] = int(entries[0]) - 1\r\n entries[1] = int(entries[1]) - 1\r\n for y in range(int(entries[0]), int(entries[1]) + 1):\r\n if temp[y] == entries[2]:\r\n temp[y] = entries[3]\r\n\r\nprint(\"\".join(temp))\r\n\r\n", "a,b=map(int,input().split())\r\ns=input()\r\nfor i in range(b):\r\n x,y,z,t=input().split()\r\n s=s[:int(x)-1:1]+s[int(x)-1:int(y)].replace(z,t)+s[int(y)::1]\r\nprint(s)", "\"\"\"\nfrom time import*\nimport random\nmoney = 10000\ncheat = input(\"Enter Cheat code if you know it: \")\nif cheat == \"SAHAR\":\n\tmoney += 100000\n\tprint(\"--Your balans 110000rub--\")\nprint(\"You have\",str(money)+\"rub\")\nques = input(\"Magazines or VulkanKazino or 1xbet:\")\nif ques == \"1xbet\":\n\tstavki = int(input(\"How many stavka you want?\"))\n\tfor i in range(stavki):\n\t\tstav = input(\"Input your color! :\")\n\t\tmon = int(input(\"Money :\"))\n\t\tsides = [\"black\",\"black\",\"black\",\"red\",\"red\",\"green\"]\n\t\tmoney -= mon\n\t\tdie_1 = random.choice(sides)\n\t\tif die_1 == stav:\n\t\t\tif stav == \"black\":\n\t\t\t\tmoney += mon*2\n\t\t\t\tprint(\"YOU WIN\")\n\t\t\t\tprint(\"You have %.1f rub\" %money)\n\t\t\t\tprint()\n\t\t\tif stav == \"red\":\n\t\t\t\tmoney += mon*3\n\t\t\t\tprint(\"YOU WIN\")\n\t\t\t\tprint(\"You have %.1f rub\" %money)\n\t\t\t\tprint()\n\t\t\tif stav == \"green\":\n\t\t\t\tmoney += mon*5\n\t\t\t\tprint(\"YOU WIN\")\n\t\t\t\tprint(\"You have %.1f rub\" %money)\n\t\t\t\tprint()\n\t\telse:\n\t\t\tmoney +=0\n\t\t\tprint(\"YOU LOSE\")\n\t\t\tprint(\"You have %.1f rub\" %money)\nelif ques == \"VulkanKazino\":\n\t\n\t\n\tpass\n#####################################\ns = int(input(\"Choise: CS:GO market = 1 , M.video = 2 , Kayhon = 3 :\"))\nif s == 1:\n\tprint(\"----Welcome----\")\n\twhile 1:\n\t\tprint(\"You have %.1f rub in your Wallet\" %money)\n\t\tmag = int(input(\"Choise: 1) M4A1 -> Howl = 50000rub ,2) AWP -> Afrikan = 50rub ,3) ak47 -> Firesnake = 10000rub ,4) Karambit -> ulraviolet = 20000rub ,5) USP-S-> Kings = 100rub , 0)EXIT from magazine:\"))\n\t\tif mag == 1:\n\t\t\tif money - 50000 < 0:\n\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tmoney -= 50000\n\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\t\tprint()\t\t\t\t\n\t\telif mag == 2:\n\t\t\tif money - 50 < 0:\n\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tmoney -= 50\n\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\telif mag == 3:\n\t\t\tif money - 10000 < 0:\n\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tmoney -= 10000\n\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\n\t\telif mag == 4:\n\t\t\tif money - 20000 < 0:\n\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tmoney -= 20000\n\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\telif mag == 5:\n\t\t\tif money - 100 < 0:\n\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tmoney -= 100\n\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\tif mag == 0:\n\t\t\t\tbreak\n#######################################################################################\nelif s == 2:\n\tprint(\"------------------------------------------------------Welcome to M.video--------------------------------------------------\")\n\twhile 1:\n\t\tprint(\"You have %.1f rub in your Wallet\" %money)\n\t\tmag1 = int(input(\"notebooks = 1 , PC = 2 , Game Series PC = 3 , telephones = 4, Exit = 0\"))\n\t\tif mag1==0:\n\t\t\tbreak\n\t\tif mag1 == 1:\n\t\t\tnotebook = int(input(\"Lenovo ideapad310 : 35000rub = 1 , HP jet black : 30000rub = 2 , fujitsu : 20000rub = 3\"))\n\t\t\t################################################################################################################\n\t\t\tif notebook == 1:\n\t\t\t\tlenovo = int(input(\"Buy = 1 , Show characters = 2\"))\n\t\t\t\tif lenovo == 1:\n\t\t\t\t\tif money - 35000 < 0:\n\t\t\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\t\t\tbreak\n\t\t\t\t\telse:\n\t\t\t\t\t\tmoney -= 35000\n\t\t\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\t\telse:\n\t\t\t\t\tprint(\"Color: Silver\",\"\\n\",\"RAM:12gb\",\"\\n\",\"ROM:1TB\",\"\\n\",\"VideoCard:Nvidia Geforce 930MX and intelHDgraphics9700\")\n\t\t\t\t\tpovt = int(input(\"Do you want to buy it?: YES = 1 , NO = 2\"))\n\t\t\t\t\tif povt == 1:\n\t\t\t\t\t\tif money - 35000 < 0:\n\t\t\t\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tmoney -= 35000\n\t\t\t\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\t####################################################################################\n\t\t\tif notebook == 2:\n\t\t\t\thp = int(input(\"Buy = 1 , Show characters = 2\"))\n\t\t\t\tif hp == 1:\n\t\t\t\t\tif money - 30000 < 0:\n\t\t\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\t\t\tbreak\n\t\t\t\t\telse:\n\t\t\t\t\t\tmoney -= 30000\n\t\t\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\t\telse:\n\t\t\t\t\tprint(\"Color: Black\",\"\\n\",\"RAM:8gb\",\"\\n\",\"ROM:1TB\",\"\\n\",\"VideoCard:AMD HD Graphics8100\")\n\t\t\t\t\tpovt = int(input(\"Do you want to buy it?: YES = 1 , NO = 2\"))\n\t\t\t\t\tif povt == 1:\n\t\t\t\t\t\tif money - 30000 < 0:\n\t\t\t\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tmoney -= 30000\n\t\t\t\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\t######################################################################################\n\t\t\tif notebook == 3:\n\t\t\t\tfujit = int(input(\"Buy = 1 , Show characters = 2\"))\n\t\t\t\tif fujit == 1:\n\t\t\t\t\tif money - 20000 < 0:\n\t\t\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\t\t\tbreak\n\t\t\t\t\telse:\n\t\t\t\t\t\tmoney -= 20000\n\t\t\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\t\telse:\n\t\t\t\t\tprint(\"Color: Black\",\"\\n\",\"RAM:4gb\",\"\\n\",\"ROM:500GB\",\"\\n\",\"VideoCard:IntelHD graphics3500\")\n\t\t\t\t\tpovt = int(input(\"Do you want to buy it?: YES = 1 , NO = 2\"))\n\t\t\t\t\tif povt == 1:\n\t\t\t\t\t\tif money - 20000 < 0:\n\t\t\t\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tmoney -= 20000\n\t\t\t\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\t\t\n\t\tif mag1 == 2:\n\t\t\tpc = int(input(\"1) DELL = 100000 , 2)ASUS = 60000 , 3)Apple = 500000 , 4)Lenovo = 300000\"))\n\t\t\t############################################################################################\n\t\t\tif pc == 1:\n\t\t\t\tpc = int(input(\"Buy = 1 , Show characters = 2\"))\n\t\t\t\tif pc == 1:\n\t\t\t\t\tif money - 100000 < 0:\n\t\t\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\t\t\tbreak\n\t\t\t\t\telse:\n\t\t\t\t\t\tmoney -= 100000\n\t\t\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\t\t\t\telse:\n\t\t\t\t\tprint(\"Color: black\",\"\\n\",\"RAM:32gb\",\"\\n\",\"ROM:2TB\",\"\\n\",\"VideoCard:Nvidia Geforce GTX 1070TI\")\n\t\t\t\t\tpovt = int(input(\"Do you want to buy it?: YES = 1 , NO = 2\"))\n\t\t\t\t\tif povt == 1:\n\t\t\t\t\t\tif money - 100000 < 0:\n\t\t\t\t\t\t\tprint(\"Sorry you don't have a money((\")\n\t\t\t\t\t\t\tbreak\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tmoney -= 100000\n\t\t\t\t\t\t\tprint(\"Tranzation succesfull, you have %.1f rub in your wallet\"%money)\n\"\"\"\n\"\"\"\nn=int(input())\nwhile n>5:\n n = n - 4\n s=n%2\n n=(n-s)/2\nif n==1:\n\tprint('Sheldon')\nif n==2:\n\tprint('Leonard')\nif n==3:\n\tprint('Penny') \nif n==4:\n\tprint('Rajesh')\nif n==5:print('Howard')\n\"\"\"\n\n\"\"\"\nn,l,a=map(int,input().split())\nans=0\nif n>0:\n lt,ltt=0,0\n \n for i in range(n):\n t,tt=map(int,input().split())\n ans+=(t-(lt+ltt))//a\n lt,ltt=t,tt\n ans+=(l-(lt+ltt))//a\nelse:\n ans+=l//a\n\nprint(ans)\n\"\"\"\n\"\"\"\ntc=int(input())\nfor i in range(tc):\n s,a,b,c=map(int,input().split())\n d=s//c\n p=d//a\n p=p*b\n print(p+d)\n\"\"\"\n\"\"\"\nn,k,l,c,d,p,nl,np = map(int,input().split())\nml = k * l\ntost = ml // nl\nlim = c * d\nnam = p / np\nprint(int(min(tost,lim,nam)/n))\n\"\"\"\n\"\"\"\nn,d = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\na.reverse()\nans = 0\nfor i in range(n//2):\n\tif a[i] - a[i+1] <= d:\n\t\t\tans += 1\nprint(ans,a)\n\"\"\"\nn,m = map(int, input().split())\ns = list(map(str,input()))\nfor i in range(m):\n\tl, r, c1, c2 =input().split()\n\tl = int(l)\n\tr = int(r)\n\tfor i in range(l-1, r):\n\t\tif s[i] == c1:\n\t\t\ts[i] = c2\nprint(*s, sep='')\n", "string_length,test_case=map(int,input().split())\r\nst = list(input())\r\n\r\n\r\nfor x in range(test_case):\r\n start,end,frm,to= map(str,input().split())\r\n for y in range(int(start)-1,int(end)):\r\n if st[y]==frm:\r\n st[y]=to\r\nprint(\"\".join(st))\r\n ", "n, m = map(int, input().split())\r\nword = list(input())\r\nlst_cmd = []\r\n\r\nfor i in range(m):\r\n cmd = input().split()\r\n for j in range (int(cmd[0])-1, int(cmd[1])):\r\n if word[j] != cmd[2]:\r\n pass\r\n else:\r\n word[j] = cmd[3]\r\n\r\nprint(''.join(word))\r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\r\ns = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = map(str, input().split())\r\n s = s[:int(l) - 1] + s[int(l) - 1: int(r)].replace(c1, c2) + s[int(r):]\r\nprint(s)", "n,m = map(int,input().split())\r\n\r\nst=input()\r\n\r\nfor i in range(m):\r\n\tl,r,c1,c2=map(str,input().split())\r\n\tl=int(l)\r\n\tr=int(r)\r\n\tx=st[l-1:r]\r\n\tx=x.replace(c1,c2)\r\n\ty=st[r:]\r\n\tst=st[0:l-1]+x+y\r\nprint(st)", "n,m=map(int,input().split(' '))\r\nnletters=[*input()]\r\nfor ele in range(0,m):\r\n l,r,c1,c2=input().split(' ')\r\n l=int(l)\r\n r=int(r)\r\n for i in range(l-1,r):\r\n if nletters[i]==c1:\r\n nletters[i]=c2\r\nprint(\"\".join(nletters))", "n,m=map(int,input().split())\r\nst=list(input())\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)\r\n r=int(r)\r\n for j in range(l-1,r):\r\n if st[j]==c1:\r\n st[j]=c2\r\nprint(\"\".join(st))\r\n", "n,m=map(int,input().split())\r\narr=input()\r\nfor i in range(m): \r\n l,r,c1,c2=map(str,input().split())\r\n for i in range(int(l)-1,int(r)):\r\n if arr[i]==c1:\r\n arr=arr[:i]+c2+arr[i+1:]\r\nprint(arr)", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn,m=map(int,input().split())\r\ns=list(input())\r\nfor i in range(m):\r\n\tl,r,c1,c2=input().split()\r\n\tl=int(l)-1\r\n\tr=int(r)\r\n\tfor j in range(l,r):\r\n\t\tif s[j]==c1:\r\n\t\t\ts[j]=c2\r\nprint(*s,sep=\"\")\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = list(input())\r\n while m:\r\n m -= 1\r\n l, r, c1, c2 = input().split()\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n for i in range(l, r + 1):\r\n if A[i] == c1:\r\n A[i] = c2\r\n print(''.join(A))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=input().split()\r\ns=input()\r\nfor i in range(int(n[1])):\r\n li_st=input().split()\r\n f=li_st[0]\r\n l=li_st[1]\r\n b=li_st[2]\r\n c=li_st[3]\r\n s=s[:int(f)-1:] + s[int(f)-1:int(l)].replace(b,c) + s[int(l)::]\r\nprint(s)", "n, m = list(map(int, input().split()))\r\ns = str(input())\r\nmylist = list(s)\r\n\r\nfor x in range(1, m+1):\r\n l, r, c1, c2 = input().split()\r\n for i in range(int(l)-1, int(r), +1):\r\n if mylist[i] == c1[0]:\r\n mylist[i] = c2\r\nprint(\"\".join(mylist))\r\n", "n, m = map(int, input().split())\r\nsi = input()\r\ns = []\r\nfor ns in si:\r\n\ts.append(ns)\r\n\r\nfor _ in range(m):\r\n\tss = list(input().split())\r\n\tif ss[0] == ss[1]:\r\n\t\tif s[int(ss[0])-1] == ss[2]: s[int(ss[0])-1] = ss[3]\r\n\telse:\r\n\t\tfor i in range(int(ss[0])-1, int(ss[1])):\r\n\t\t\tif s[i] == ss[2]: s[i] = ss[3]\r\n\r\nprint(''.join(s))", "from bisect import bisect_left, bisect_right\r\nfrom heapq import heappush, heappop, heapify\r\nfrom math import *\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nfrom sys import stdin, stdout\r\nimport random\r\nimport io, os\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nRANDOM = random.randrange(2**62)\r\nninput = lambda: int(input())\r\nsinput = lambda: input().decode().strip() \r\nainput = lambda: list(map(int, input().split()))\r\nprintt = lambda *x: stdout.write(\" \".join(map(str, x)) + '\\n')\r\nceil = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\nWrapper = lambda x: x ^ RANDOM\r\n\r\ndef main():\r\n for _ in range(1):\r\n n, m = ainput()\r\n s = [i for i in sinput()]\r\n for _ in range(m):\r\n l, r, c1, c2 = sinput().split()\r\n l = int(l) - 1; r = int(r) - 1\r\n for i in range(l, r+1):\r\n if s[i] == c1: s[i] = c2\r\n printt(\"\".join(s))\r\n \r\nif __name__ == '__main__':\r\n main()", "n,q=map(int,input().split())\r\ns=input()\r\nli=[i for i in s]\r\nfor _ in range(q):\r\n l,r,c1,c2=map(str,input().split())\r\n l=int(l);r=int(r)\r\n l-=1\r\n for i in range(l,r):\r\n if li[i]==c1:\r\n li[i]=c2\r\nprint(''.join(li))", "list_a=[int(x) for x in input().split()]\r\nn=list_a[0]\r\nm=list_a[1]\r\ns=input()\r\nlist_m=[]\r\nfor i in range(0,m):\r\n\tlist_m=list_m+[[x for x in input().split()]]\r\nfor i in range(0,m):\r\n\tfor j in range (0,4):\r\n\t\tl =int(list_m[i][0])\r\n\t\tr =int(list_m[i][1])\r\n\t\tc0=list_m[i][2]\r\n\t\tc1=list_m[i][3]\r\n\t\ts=s[0:l-1]+s[l-1:r].replace(c0,c1)+s[r:len(s)]\r\nprint(s)\t", "n, m = [int(i) for i in input().split()]\r\ns = list(str(input()))\r\nfor k in range(m):\r\n l,r,c1,c2 = [str(i) for i in input().split()]\r\n l = int(l)\r\n r = int(r)\r\n for i in range(l-1, r):\r\n if s[i] == c1:\r\n s[i] = c2\r\ns = ''.join(s)\r\nprint(s)", "n,m=map(int,input().split())\r\ns=str(input())\r\nList=list(s)\r\nfor op in range(m):\r\n para=list(map(str,input().split()))\r\n l=int(para[0])\r\n r=int(para[1])\r\n c1=para[2]\r\n c2=para[3]\r\n \r\n for i in range(l-1,r):\r\n if(List[i]==c1):\r\n List[i]=c2\r\ns=\"\" \r\nfor i in List:\r\n s+=i\r\nprint(s)\r\n", "n,m = map(int,input().split())\r\ns = list(input())\r\n\r\nwhile(m):\r\n l1 = list(map(str,input().split()))\r\n l = int(l1[0])-1\r\n r = int(l1[1])-1\r\n c1 = l1[2]\r\n c2 = l1[3]\r\n for i in range(l,r+1):\r\n if(s[i]==c1):\r\n s[i]=c2\r\n m-=1\r\nprint(''.join(s))", "n,m = map(int, input().split())\r\ns = input()\r\n\r\nfor _ in range(m):\r\n l,r,c1,c2 = map(str,input().split())\r\n l = int(l)\r\n r = int(r)\r\n s = s[:l-1] + s[l-1:r].replace(c1, c2) + s[r:]\r\n\r\nprint(s)", "n,m=list(map(int,input().split()))\r\nstring=str(input())\r\nfor i in range(m):\r\n l1,l2,c1,c2=input().split()\r\n l1=int(l1)\r\n l2=int(l2)\r\n c1=str(c1)\r\n c2=str(c2)\r\n string=string[0:l1-1]+ string[l1-1:l2].replace(c1,c2)+string[l2:n+1]\r\nprint(string)", "n, m = map(int, input().split())\r\ns = input()\r\ns = list(s)\r\nfor i in range(m):\r\n l, r, c1, c2 = map(str, input().split())\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l-1, r):\r\n if s[j]==c1:\r\n s[j]=c2\r\nans=\"\"\r\nfor _ in range(n):\r\n ans+=s[_]\r\nprint(ans)", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m=map(int,input().strip().split()[:2])\nk=list(input().strip()[:n])\nfor z in range(m):\n\tl,r,x,y=input().strip().split()[:4]\n\tfor q in range(int(l)-1,int(r)):\n\t\tif k[q]==x:\n\t\t\tk[q]=y\nprint(''.join(map(str,k)))\n", "a,b=map(int,input().split())\r\nc=str(input())\r\nfor _ in range(b):\r\n dd=str(input())\r\n d=dd.split(\" \")\r\n e=str(\"\")\r\n e=c[0:int(d[0])-1]\r\n f=c[int(d[0])-1:int(d[1])]\r\n f=f.replace(d[2],d[3])\r\n e=e+f\r\n e=e+c[int(d[1]):a]\r\n c=e\r\nprint(c)", "# @author Matheus Alves dos Santos\n\nlength, n_operations = map(int, input().split())\nstring = list(input())\n\nfor i in range(n_operations):\n l, r, c1, c2 = input().split()\n l, r = int(l), int(r)\n\n for j in range(l - 1, r):\n if (string[j] == c1):\n string[j] = c2\n\nprint(''.join(string))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 1 17:06:24 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,m = map(int, input().split())\r\n\r\nl = list(input())\r\n\r\nfor i in range(m):\r\n d = list(input().split())\r\n d[0] = int(d[0]) - 1; d[1] = int(d[1]) - 1\r\n \r\n for j in range(d[0],d[1]+1):\r\n if l[j] == d[2]:\r\n l[j] = d[3]\r\nprint(''.join(l))", "n, m = map(int, input().split())\r\ns = list(input())\r\nq = ''\r\n\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l), int(r)\r\n\r\n for j in range(l-1, r):\r\n if s[j] == c1:\r\n s[j] = c2\r\n\r\n\r\nfor k in s:\r\n q += k\r\n\r\nprint(q)", "def main():\r\n s = input()\r\n s = list((s.split()))\r\n n = int(s[0])\r\n m = int(s[1])\r\n s=input()\r\n a=[]\r\n for i in (s):\r\n a.append(i)\r\n for i in range(m):\r\n s=input()\r\n s=list(s.split())\r\n for i in range(int(s[0])-1,int(s[1])):\r\n if a[i]==s[2]:\r\n a[i]=s[3]\r\n s=''\r\n for i in range(n):\r\n s=s+a[i]\r\n print(s)\r\nmain()", "n,m=map(int,input().split())\r\na=list(input())\r\nfor i in range(m):\r\n s,d,c1,c2=input().split()\r\n s=int(s)\r\n d=int(d)\r\n for j in range(s-1,d):\r\n if a[j]==c1:\r\n a[j]=c2\r\nprint(\"\".join(a))\r\n", "n,m=map(int,input().split())\r\nl=list(input())\r\nfor i in range(m):\r\n a,b,c,d=input().split()\r\n for j in range(int(a)-1,int(b)):\r\n if l[j]==c:\r\n l[j]=d\r\nfor x in l:\r\n print(x,end='')\r\n", "import sys,math\ninput=sys.stdin.readline\n\nL=lambda : list(map(int,input().split().strip()))\nM=lambda : map(int,input().split())\nn,q=M()\ns=[\"o\"]+list(input().strip())\nfor i in range(q):\n l,r,c1,c2=input().split()\n l,r=int(l),int(r)\n for j in range(l,r+1):\n if(s[j]==c1):\n s[j]=c2\ns=s[1::]\nprint(*s,sep=\"\")\n", "import time\r\n\r\ndef guessStringAftOperations(oper, origS, operList):\r\n nstr = origS\r\n for x in range(oper):\r\n nstr = convertStringInto(nstr, operList[x][0], operList[x][1], operList[x][2], operList[x][3])\r\n return nstr\r\n\r\n\r\ndef convertStringInto(st, iniPos, endPos, fromChar, toChar):\r\n nSt = \"\"\r\n\r\n for pos in range(len(st)):\r\n if st[pos] == fromChar and (pos in range(int(iniPos)-1, int(endPos))):\r\n nSt += toChar\r\n else:\r\n nSt += st[pos]\r\n\r\n return nSt\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n lenS, oper = [int(x) for x in input().split()]\r\n origS = input()\r\n operList = []\r\n\r\n for x in range(oper):\r\n operList.append(list(map(str, input().split())))\r\n\r\n print(guessStringAftOperations(oper, origS, operList))\r\n\r\n # print(\"%fs\" % (time.time() - start_time))\r\n\r\n\r\nsolve()\r\n", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n a=input().split()\r\n l,r=int(a[0]),int(a[1])\r\n c1,c2=a[2],a[3]\r\n s=s[0:l-1]+s[l-1:r].replace(c1,c2)+s[r:]\r\nprint(s)\r\n ", "lll, n = map(int, input().split())\r\ns = list(input())\r\n\r\nfor i in range(n):\r\n (a, b, c1, c2) = input().split()\r\n for j in range(int(a)-1, int(b)):\r\n if s[j] == c1:\r\n s[j] = c2\r\nprint(''.join(s))", "n, m = map(int, input().split())\r\ns = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = map(str, input().split())\r\n for j in range(int(l)-1,int(r)):\r\n if s[j] == c1:\r\n s = s[:j] + str(c2) + s[j+1:]\r\nprint(s)", "R = lambda:map(int , input().split())\n\nn , m = R()\n\nstr = input()\n\nfor i in range(m):\n l , r , c1 , c2 = input().split()\n l = int(l)\n r = int(r)\n cstr = str[l-1:r].replace(c1,c2)\n # print(\"cstr is \" , cstr)\n cstr = str[:l-1] + cstr + str[r:]\n str = cstr\nprint(cstr)", "n , m = map(int,input().split())\r\ns = input()\r\narr = list(s)\r\n\r\nfor _ in range(m) :\r\n l,r,a,b = map(str,input().split())\r\n\r\n l = int(l)\r\n r = int(r)\r\n\r\n for i in range(l-1,r) :\r\n if arr[i] == a :\r\n arr[i] = b\r\n\r\nprint(''.join(arr))\r\n", "n, m = map(int, input().split())\r\nc = 0\r\ns = list(input())\r\nfor i in range(m):\r\n l, r, c1, c2 = map(str, input().split())\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l - 1, r):\r\n if(s[j] == c1):\r\n s[j] = c2\r\n \r\n else: continue\r\nprint(''.join(s)) \r\n ", "n,m=map(int,input().split())\ns=list(str(input()))\nfor j in range(m):\n a,b,c,d=input().split()\n v=int(a)-1\n w=int(b)\n for i in range(v,w):\n if s[i]==c:\n s[i]=d\nres=\"\"\nfor i in s:\n res=res+i\nprint(res) ", "n, m = map(int, input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n inp_array = input().split()\r\n l = int(inp_array[0])\r\n r = int(inp_array[1])\r\n c1 = inp_array[2]\r\n c2 = inp_array[3]\r\n for j in range(l-1, r):\r\n if s[j] == c1:\r\n s[j] = c2\r\nanswer = \"\"\r\nfor el in s:\r\n answer += el\r\nprint(answer)", "n,m=map(int,input().split())\r\ns=input()\r\ns=list(s)\r\nfor _ in range(m):\r\n l,r,c1,c2=map(str,input().split())\r\n x=s[int(l)-1:int(r)]\r\n for i in range(len(x)):\r\n if x[i]==c1:\r\n x[i]=c2\r\n s=s[:int(l)-1]+x+s[int(r):]\r\nprint(''.join(s))", "n, m = input().split()\r\nn, m = int(n), int(m)\r\nstring = input()\r\niterator = []\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l)-1, int(r)-1\r\n iterator.append((l, r, c1, c2))\r\nfor step in iterator:\r\n l, r, c1, c2 = step[0], step[1], step[2], step[3]\r\n for k in range(l, r+1):\r\n if string[k] == c1:\r\n string = string[0:k] + c2 + string[k+1:len(string)]\r\nprint(string)", "n,m=map(int,input().split())\r\ns=input()\r\nfor j in range(m):\r\n t=input().split()\r\n l=int(t[0])\r\n r=int(t[1])\r\n c1=t[2]\r\n c2=t[3]\r\n for i in range(l-1,r):\r\n if s[i]==c1:s=s[:i]+c2+s[i+1:]\r\nprint(s)", "n,m=[int(x) for x in input().split()]\r\ns=list(input())\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n l=int(l)-1\r\n r=int(r)\r\n for j in range(l,r):\r\n if (s[j]==c1):\r\n s[j]=c2\r\nprint(''.join(s))\r\n", "a=list(map(int,input().split(' ')))\r\nstring=list(input())\r\nnstring=\"\"\r\nfor i in range(a[1]):\r\n templist=input().split(' ')\r\n templist[0]=int(templist[0])\r\n templist[1]=int(templist[1])\r\n for i in range(templist[0]-1,templist[1]):\r\n if string[i]==templist[2]:\r\n string[i]=templist[3]\r\nfor i in string:\r\n nstring+=i;\r\nprint(nstring)", "n,q=map(int,input().split())\r\ns=list(input())\r\nfor _ in range(q):\r\n a,b,ch1,ch2=input().split()\r\n a=int(a)\r\n b=int(b)\r\n a=a-1 \r\n b=b-1 \r\n for i in range(a,b+1):\r\n if s[i]==ch1:\r\n s[i]=ch2 \r\nprint(*s,sep='')\r\n", "a, d = [int(i) for i in input().split()], input()\r\n\r\nfor i in range(a[1]):\r\n\tv = input().split()\r\n\td = d[:int(v[0])-1]+d[int(v[0])-1:int(v[1])].replace(v[2], v[3])+d[int(v[1]):]\r\nprint(d)", "n, m = map(int, input().split())\ns = list(input())\nfor i in range(m):\n l, r, c, d = input().split()\n for j in range(int(l)-1, int(r)):\n if s[j] == c:\n s[j] = d\n\nprint(*s, sep=\"\")\n", "n,m=[int(i) for i in input().split(\" \")]\r\ns=input()\r\nx=list(s)\r\nfor i in range(m):\r\n l,r,c1,c2=[i for i in input().split(\" \")]\r\n for i in range(int(l)-1,int(r)):\r\n if x[i]==c1:\r\n x[i]=c2\r\nprint(\"\".join(x))", "n, m = map(int, input().split())\r\na = input()\r\nfor i in range(m):\r\n\tl, r, c1, c2 = map(str, input().split())\r\n\tl = int(l) - 1\r\n\tr = int(r) - 1\r\n\tf = a[:l]\r\n\tfor j in range(l, r + 1):\r\n\t\tif a[j] == c1:\r\n\t\t\tf += c2\r\n\t\telse:\r\n\t\t\tf += a[j]\r\n\tf += a[r + 1:]\r\n\ta = f\r\nprint(a)\r\n", "def main():\r\n\tn, m=tuple(map(int,input().split()))\r\n\ts=list(input())\r\n\tfor _ in range(m):\r\n\t\tl, r, c1, c2=tuple(input().split())\r\n\t\tl=int(l)\r\n\t\tr=int(r)\r\n\t\tl-=1\r\n\t\tr-=1\r\n\t\tif l==r:\r\n\t\t\tif s[l]==c1:\r\n\t\t\t\ts[l]=c2\r\n\t\telse:\r\n\t\t\tfor i in range(l, r+1):\r\n\t\t\t\tif s[i]==c1:\r\n\t\t\t\t\ts[i]=c2\r\n\tprint(''.join(map(str,s)))\r\nif __name__=='__main__':\r\n\tmain()", "n, m = map(int, input().split())\r\ns = input()\r\n\r\ndef rep_factory(s, l, r, c1, c2):\r\n return s[:l-1] + s[l-1:r].replace(c1, c2) + s[r:]\r\n\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n s = rep_factory(s, int(l), int(r), c1, c2)\r\nprint(s)", "n, m = map(int, input().split())\r\nS = input()\r\nS = list(S)\r\nop = []\r\nfor i in range(m):\r\n l, r, st, rep = input().split()\r\n l = int(l) - 1\r\n r = int(r) - 1\r\n op.append([l,r,st,rep])\r\n# print(op)\r\n# print(S)\r\nfor l, r, sy, rep in op:\r\n # print(l,r,sy,rep)\r\n for i in range(l,r+1):\r\n if S[i] == sy:\r\n S[i] = rep\r\n # print(S)\r\nans = \"\"\r\nfor i in S:\r\n ans += i\r\nprint(ans)\r\n", "import sys\n\nn,m = map(int,input().split())\ns = list(input())\nfor i in range(m):\n l,r,c1,c2 = input().split()\n l = int(l) - 1\n r = int(r)\n for j in range(l,r,1):\n if s[j] == c1: \n s[j] = c2\n\nprint(\"\".join(s))", "m,t = map(int,input().split())\r\na = input()\r\nfor i in range(t):\r\n b,c,d,e = input().split()\r\n b = int(b)\r\n c = int(c)\r\n a = a[:b-1]+(a[b-1:c]).replace(d,e)+a[c:]\r\nprint(a)", "a,b=map(int,input().split())\nx=input()\narr=[]\nxx=[]\nfor z in range(len(x)):\n xx.append(x[z])\nfor i in range(b):\n arr.append(input().split(\" \"))\nfor l in range(b):\n for s in range(int(arr[l][0])-1,int(arr[l][1])):\n if arr[l][2]==xx[s]:\n xx[s]=arr[l][3]\nprint(*xx,sep=\"\")\n\n\n", "def solve(string, ops):\r\n chars = list(string)\r\n for op in ops:\r\n l,r,c1,c2 = op\r\n l = int(l)\r\n r = int(r)\r\n for i in range(l-1, r):\r\n if chars[i]==c1:\r\n chars[i]=c2\r\n return \"\".join(chars)\r\n\r\ndef main():\r\n n, m = list(map(int, input().split()))\r\n string = input()\r\n ops = []\r\n for _ in range(m):\r\n ops.append(input().split())\r\n print(solve(string, ops))\r\n\r\nif __name__ == '__main__':\r\n main()", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n l,r,c1,c2=input().split()\r\n s=s[:int(l)-1]+s[int(l)-1:int(r)].replace(c1,c2)+s[int(r):]\r\nprint(s)", "\"\"\"n,m=map(int,input().split())#len of string ,no. of operations\r\ns=input()\r\nl,r,c1,c2= input().split()\r\ni=int(l)\r\nj=int(r)\r\nnewstring=s[i:j]\r\nk=newstring.replace(c1,c2)\r\nnewstr=s[:i]+k+s[j:]\r\nprint(newstr)\"\"\"\r\n\r\nn,m=map(int,input().split())\r\ns = input()\r\nfor j in range(m):\r\n l,r,c1,c2 = map(str,input().split())\r\n ne = s[int(l)-1:int(r)].replace(c1,c2)\r\n s = s[0:int(l)-1]+ne+s[int(r):]\r\nprint(s) \r\n \r\n ", "# Rating: 800, Problem 897 A\n\nn, m = [int(i) for i in input().strip().split()]\ns = input().strip()\n\ndata = []\nfor i in range(m):\n r, l, c1, c2 = input().strip().split()\n data.append([r,l,c1,c2])\n\narray = []\n\nfor i in range(n):\n array.append(s[i])\n\nfor change in data:\n for j in range(int(change[0])-1, int(change[1])):\n if array[j] == change[2]:\n array[j] = change[3]\n\nnew_string = \"\"\nnew_string = new_string.join(array)\n\nprint(new_string)", "n, m = map(int, input().split())\r\ns = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n s = s[:int(l)-1] + s[int(l)-1:int(r)].replace(c1, c2)+s[int(r):]\r\nprint(s)\r\n", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n\ta,b,c,d=input().split()\r\n\ts=s[:int(a)-1]+s[int(a)-1:int(b)].replace(c,d)+s[int(b):]\r\nprint(s)", "n, m = list(map(int, input().split()))\r\ns = list(input())\r\nfor a in range(m):\r\n frm, to, l1, l2 = input().split()\r\n frm = int(frm) - 1\r\n to = int(to)\r\n for b in range(frm, to):\r\n if s[b] == l1:\r\n s[b] = l2\r\nprint(''.join(s))", "from math import ceil\r\n\r\n\r\ndef main():\r\n n,m = [int(v) for v in input().split()]\r\n inp = input()\r\n for i in range(m):\r\n s,e,source, target = [v for v in input().split()]\r\n start = int(s)-1\r\n end = int(e)-1\r\n inp = inp[0:start] + inp[start:end + 1].replace(source, target) + inp[end + 1:]\r\n print(inp)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m = map(int, input(). split())\r\ns = list(input())\r\nfor i in range(m):\r\n l, r, c1, c2 = map(str, input(). split())\r\n l, r = int(l), int(r)\r\n for j in range(l - 1, r):\r\n if s[j] == c1:\r\n s[j] = c2\r\nfor l in s:\r\n print(l, end = '')\r\n", "n,m=list(map(int,input().split()))\r\ns=input()\r\nk=list(s)\r\nans=\"\"\r\nfor i in range(m):\r\n l,r,c1,c2=list(map(str,input().split()))\r\n for j in range(int(l)-1,int(r)):\r\n if(k[j]==c1):\r\n k[j]=c2\r\n # print(k)\r\nans=\"\"\r\nfor ele in k:\r\n ans+=ele \r\nprint(ans)", "n,k=map(int,input().split())\nresht=input()\nreshte=[]\nfor char in resht:\n\treshte.append(char)\nfor i in range(k):\n\tp,t,d,f=input().split()\n\tp=int(p)\n\tt=int(t)\n\tfor j in range(p-1,t):\n\t\tif reshte[j]==d:\n\t\t\treshte[j]=f\noutput=\"\"\nfor char in reshte:\n\toutput+=char\nprint(output)", "n, m = [int(x) for x in input().split()]\ns = input()\nfor i in range(m):\n l, r, c1, c2 = [x for x in input().split()]\n s1 = s[:int(l)-1]\n for i, ch in enumerate(s[int(l)-1:int(r)]):\n if ch == c1:\n s1 += c2\n else:\n s1 += ch\n s1 += s[int(r):]\n s = s1\nprint(s)\n", "n, m = map(int, input().split())\r\ns = list(input())\r\ninp = []\r\nfor i in range(0, m):\r\n l = list(map(str, input().split()))\r\n inp.append(l)\r\n\r\nfor i in range(0, len(inp)):\r\n for j in range(int(inp[i][0]) - 1, int(inp[i][1])):\r\n if s[j] == inp[i][2]:\r\n s[j] = inp[i][3]\r\n\r\nans = ''\r\nfor i in range(0, len(s)):\r\n ans = ans + s[i]\r\n\r\nprint(ans)\r\n", "n, m = map(int,input().split())\r\ninput_str = input()\r\ninput_lst = [i for i in input_str]\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n l -= 1\r\n for i in range(l, r):\r\n if input_lst[i] == c1:\r\n input_lst[i] = c2\r\nans = \"\"\r\nfor i in input_lst:\r\n ans += i\r\nprint(ans) ", "m,n=map(int, input().split())\r\ns=input()\r\nfor _ in range(n):\r\n x=input().split()\r\n s=s[:int(x[0])-1]+s[int(x[0])-1:int(x[1])].replace(x[2],x[3])+s[int(x[1]):]\r\nprint(s)", "n, m = map(int, input().split())\ns = input()\nfor _ in range(0, m):\n b, r, c1, c2 = input().split()\n b = int(b)\n r = int(r)\n s = s[:b-1] + s[b-1:r].replace(c1, c2) + s[r:]\nprint(s)\n", "n, m = (int(x) for x in input().split())\ns = list(input())\nfor i in range(m):\n l, r, c1, c2 = (x for x in input().split())\n l = int(l) - 1\n r = int(r) - 1\n for j in range(l, r + 1):\n if s[j] == c1:\n s[j] = c2\nprint(*[x for x in s], sep='')\n", "line1 = list(input().split())\r\nline2 = list(input())\r\nline3 = [None]*int(line1[1])\r\nfor i in range(int(line1[1])):\r\n line3[i] = list(input().split())\r\n for j in range(int(line3[i][0])-1,int(line3[i][1])):\r\n if(line2[j] == line3[i][2]):\r\n line2[j]=line3[i][3]\r\nfor i in line2:\r\n print(i,end = '')", "a, b = map(int, input().split())\r\ns = input()\r\nsp = []\r\nsp += s\r\nres = \"\"\r\nfor i in range(b):\r\n l, r, c1, c2 = map(str, input().split())\r\n for x in range(int(l), int(r) + 1):\r\n if sp[x - 1] == c1:\r\n sp[x - 1] = c2\r\n\r\nfor i in sp: res += i\r\nprint(res)\r\n", "n, m = map(int, input().split(' '))\r\ns = input()\r\nfor i in range(m):\r\n inputs = [i for i in input().split(' ')]\r\n l, r , c1, c2 = int(inputs[0])-1, int(inputs[1]), inputs[2], inputs[3]\r\n res = s[:l]\r\n for i in range(l, r):\r\n if s[i]==c1:res+=c2\r\n else:res+=s[i]\r\n res += s[r:]\r\n s = res\r\nprint(res)", "aa=input().split()\r\na=int(aa[0])\r\nb=int(aa[1])\r\nl=list(input())\r\nfor i in range(0,b):\r\n work=input().split()\r\n for d in range(int(work[0])-1,int(work[1])):\r\n if l[d]==work[2]:\r\n l[d]=work[3]\r\nprint(\"\".join(l))", "n,m = map(int, input().split())\r\ns = input().lower()[:n]\r\nfor i in range(m):\r\n l,r,c1,c2 = input().split()\r\n l,r = [int(l)-1, int(r)]\r\n s=s[:l] + s[l:r].replace(c1,c2) + s[r:]\r\nprint(s)", "n,m=map(int,input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n l,r,a,b = input().split()\r\n for i in range(int(l)-1,int(r)):\r\n if s[i]==a:\r\n s[i] = b\r\nprint(*s,sep='')", "n,m=map(int,input().split(' '))\r\ns=input()\r\nfor i in range(0,m):\r\n l,r,c1,c2=map(str,input().split(' '))\r\n l,r=int(l),int(r)\r\n for j in range(l-1,r):\r\n if s[j]==c1:\r\n s=s[0:j]+c2+s[j+1:]\r\nprint(s) \r\n ", "#Codeforce 897A\r\nn,m = (int(v) for v in input().split())\r\nx=[v for v in input().strip(\"\\n\\r\")]\r\nans=\"\"\r\nfor i in range(m):\r\n l,r,c_1,c_2 = (v for v in input().split())\r\n for j in range(int(l)-1,int(r)):\r\n if x[j] == c_1:\r\n x[j] = c_2\r\n else:\r\n pass\r\nfor k in range(len(x)):\r\n ans+=x[k]\r\nprint(ans)", "n, m = map(int, input().split())\r\ns = input()\r\nfor _ in range(m):\r\n l, r, c1, c2 = input().split()\r\n l = int(l)\r\n r = int(r)\r\n for j in range(l - 1, r):\r\n if s[j] == c1:\r\n s = s[:j] + c2 + s[j+1:]\r\nprint(s)", "n,k=list(map(int,input().split()))\r\nt=list(input())\r\nfor i in range(k):\r\n l,r,c1,c2=list(input().split())\r\n for j in range(int(l)-1,int(r)):\r\n if t[j]==c1:\r\n t[j]=c2\r\nprint(''.join(t))\r\n", "#include <bits/stdc++.h>\r\n#define SYNC ios_base::sync_with_stdio(0);\r\n#define IO cin.tie(0);\r\n#define STD /*\r\nfrom sys import (\r\nstdin, stdout, exit as sys_ret)\r\n\"\"\"****************************\r\n\r\n Interactive Tasks:\r\n\r\n / Python: / \"\"\"\r\nf_input, f_print, f_flush = (\r\n stdin.readline,\r\n stdout.write,\r\n stdout.flush)\r\n\r\n\"\"\" / C++ /\r\n #import <cstdio>\r\n fflush(stdout);\r\n or\r\n #import <iostream>\r\n cout << endl;\r\n\r\n —————————————————————————\r\n Don't raise your voice,\r\n improve your argument.\r\n —————————————————————————\r\n\r\n cat /dev/ass > /dev/head\r\n Ctrl+C\r\n cat /knowledge > /dev/head\r\n\r\n © Jakov Gellert\r\n frvr.ru\r\n\r\n****************************\"\"\"\r\n# */ using namespace std; int\r\n#define boost_stream(); SYNC IO\r\n\r\nlength, amount = map(int, f_input().split())\r\nstring = list(f_input().replace('\\n', ''))\r\nfor _ in range(amount):\r\n data = [_ for _ in f_input().split()]\r\n l, r = int(data[0]), int(data[1])\r\n initial, change = data[2], data[3]\r\n for i in range(l - 1, r):\r\n if string[i] == initial:\r\n string[i] = change\r\nf_print(''.join(string))", "n,t=map(int,input().split())\r\nway=list(input())\r\nfor i in range(t):\r\n arr=list(input().split())\r\n for a in range(1,len(way)+1):\r\n if a>=int(arr[0]) and a<=int(arr[1]) and way[a-1]==arr[2]:\r\n way[a-1]=way[a-1].replace(way[a-1],arr[3])\r\nprint(''.join(way))", "m, n = tuple(input().split())\r\ns = input()\r\nl = []\r\nfor i in s:\r\n l.append(i)\r\n\r\nfor i in range(int(n)):\r\n s = input().split()\r\n for j in range(int(s[0])-1, int(s[1])):\r\n if l[j] == s[2]:\r\n l.insert(j, s[3])\r\n l.pop(j+1)\r\n \r\nprint(''.join(l))", "\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n s = [i for i in input()]\r\n for i in range(m):\r\n l, r, c_1, c_2 = [i for i in input().split(\" \")]\r\n for i in range(int(l) - 1, int(r)):\r\n if s[i] == c_1:\r\n s[i] = c_2\r\n return \"\".join(s)\r\n\r\n\r\n\r\nprint(main_function())", "n,m = input().split(\" \")\ntext = str(input())\nfor i in range(int(m)):\n f,t,r,s = input().split(\" \")\n text = text[:int(f)-1] + text[int(f)-1:int(t)].replace(r,s) + text[int(t):]\nprint(text)", "g, m = map(int,input().split())\r\na = input()\r\nfor _ in ' ' * m:\r\n l, r, b, c = map(str, input().split())\r\n l = int(l)-1\r\n r = int(r)\r\n a = a[:l] + a[l:r].replace(b,c) + a[r:]\r\n\r\nprint(a)", "n, m = map(int, input().split())\r\ns = list(i for i in input())\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n for y in range(int(l) - 1, int(r)):\r\n if s[y] == c1:\r\n s[y] = c2\r\nprint(*s, sep=\"\")\r\n", "n , m =map(int,input().split())\r\ns = list(input())\r\nfor i in range(m):\r\n lis = [i for i in input().split()]\r\n l = int(lis[0])\r\n r =int(lis[1])\r\n c1 = lis[2]\r\n c2 = lis[3]\r\n for j in range(l - 1, r):\r\n if s[j] == c1:\r\n s[j] = c2\r\nprint(''.join(s))", "n,m = map(int,input().split())\r\ns = list(input())\r\n\r\nfor _ in range(m):\r\n l,r,c1,c2 = input().split()\r\n for k in range(int(l)-1,int(r)):\r\n if s[k]==c1:\r\n s[k] = c2\r\nprint(\"\".join(s))", "n, m = map(int, input().split())\r\ns = input()\r\nlrc1c2 = [input().split() for _ in range(m)]\r\n\r\nans = list(s)\r\n\r\nfor i in range(m):\r\n li = int(lrc1c2[i][0]) - 1\r\n ri = int(lrc1c2[i][1])\r\n for j in range(li, ri):\r\n if ans[j] == lrc1c2[i][2]:\r\n ans[j] = lrc1c2[i][3]\r\n\r\nprint(\"\".join(ans))", "n , m = map(int,input().split())\r\ns = input()\r\ns = list(s)\r\nfor i in range(m):\r\n l , r , c1 , c2 = input().split()\r\n l , r = int(l) , int(r)\r\n\r\n for j in range(l - 1 , r):\r\n if s[j] == c1 :\r\n del s[j]\r\n s.insert(j , c2)\r\n\r\nprint(''.join(s))", "n, m = [int(x) for x in input().split()]\r\ns = input()\r\nwhile m:\r\n m = m - 1\r\n l, r, c1, c2 = [x for x in input().split()]\r\n s = s[0:int(l)-1] + s[int(l)-1: int(r)\r\n ].replace(c1, c2) + s[int(r):n]\r\nprint(s)\r\n", "line = [int(i) for i in input().split()]\r\nn, m = line[0], line[1]\r\ns = input()\r\nss = list(s)\r\nfor _ in range(m):\r\n line = input().split()\r\n l, r, c1, c2 = int(line[0]), int(line[1]), line[2], line[3]\r\n for i in range(l - 1, r):\r\n if ss[i] == c1:\r\n ss[i] = c2\r\nprint(''.join(ss))", "a,b = map(int,input().split())\ns = [str(i) for i in input()][:a]\nfor i in range(b):\n\tl,r,c_1,c_2 = input().split()\n\tl,r = int(l),int(r)\n\tfor index in range(l-1,r):\n\t\tif s[index] == c_1:\n\t\t\ts[index] = c_2\nprint(''.join(s))", "\r\n# taking input\r\n[n,m] = list(map(int,input().split()))\r\nstring = list(input())\r\n\r\nobs = []\r\nfor i in range(m):\r\n obs.append(input().split())\r\n\r\nfor i in obs:\r\n l,r,c1,c2 = int(i[0]),int(i[1]),i[2],i[3]\r\n\r\n for j in range(r-l+1):\r\n if(string[j+l-1]==c1):\r\n string[j+l-1]=c2\r\n\r\nprint(\"\".join(string))\r\n\r\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,k=map(int,input().split())\r\na=list(input())\r\nfor i in range(k):\r\n\tb=input().split()\r\n\tfor j in range(int(b[0])-1,int(b[1])):\r\n\t\tif a[j]==b[2]:\r\n\t\t\ta[j]=b[3]\r\nc=''.join(a)\r\nprint(c)\t\t\t", "from sys import stdin\nn, m = [int(i) for i in stdin.readline().split(' ')]\ns = stdin.readline()[:-1]\n\ntrim = lambda s: s[:-1] if (s[-1] == \"\\n\") else s\n\nfor i in range(0, m):\n data = trim(stdin.readline().split(' '))\n l = int(data[0])\n r = int(data[1])\n c1 = data[2]\n c2 = trim(data[3])\n for i in range(l-1, r):\n if s[i] == c1:\n s = s[:i]+c2+s[i+1:]\n\nprint(s)\n", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n\ta=list(input().split())\r\n\tl=int(a[0])\r\n\tr=int(a[1])\r\n\tfor j in range(l-1,r):\r\n\t\tif s[j]==a[2]:\r\n\t\t\ts=s[:j]+a[3]+s[j+1:]\t\r\nprint(s)", "n,m=map(int,input().split())\r\ns=input()\r\nfor i in range(m):\r\n\ta,b,c,d=input().split()\r\n\tfor j in range(int(a)-1,int(b)):\r\n\t\tif s[j]==c:\r\n\t\t\ts=s[:j]+d+s[j+1:]\r\nprint(s)\r\n", "n, m = input().split()\r\nn = int( n )\r\nm = int( m )\r\ns = input()\r\nfor i in range( m ): \r\n left, right, sim1, sim2 = input().split()\r\n left = int( left )\r\n right = int( right )\r\n for j in range( left - 1, right ):\r\n if s[j] == sim1:\r\n s2 = s[0:j]\r\n s2 += sim2\r\n s2 += s[j + 1: len( s )]\r\n s = s2\r\nprint( s2 ) ", "n,m = map(int,input().split())\r\nstring = input()\r\n\r\nfor _ in range(m):\r\n lst = input().split()\r\n x = int(lst[0]) - 1\r\n y = int(lst[1]) - 1\r\n\r\n if x > 0 and y < n-1:\r\n string = string[:x] + string[x:y+1].replace(lst[2],lst[3]) + string[y+1:]\r\n elif y < n-1:\r\n string = string[x:y+1].replace(lst[2],lst[3]) + string[y+1:]\r\n elif x > 0:\r\n string = string[:x] + string[x:y+1].replace(lst[2],lst[3])\r\n else:\r\n string = string[x:y+1].replace(lst[2],lst[3])\r\nprint(string)", "'''input\n5 3\nwxhak\n3 3 h x\n1 5 x a\n1 3 w g\n'''\nn, m = map(int, input().split())\ns = list(input())\nfor _ in range(m):\n\tl, r, c1, c2 = input().split()\n\tfor x in range(int(l)-1, int(r)):\n\t\tif s[x] == c1:\n\t\t\ts[x] = c2\nprint(\"\".join(s))\n", "n,m = list(map(int,input().split()))\r\ns = input()\r\n\r\nfor i in range(m):\r\n\tl,r,c1,c2 = list(map(str,input().split()))\r\n\tl = int(l)\r\n\tr = int(r)\r\n\ts = s[:l-1] + s[l-1:r].replace(c1,c2,) + s[r:]\r\n\r\nprint(s)", "def chan(y,lrc):\t\r\n\th=[]\r\n\tfor x in y:\r\n\t\th.append(x)\r\n\tl=int(lrc[0])-1\r\n\tr=int(lrc[1])-1\t\r\n\tfor x in range(r-l+1):\t\t\t\t\r\n\t\tif h[l]==lrc[2]:\r\n\t\t\th[l]=lrc[3]\r\n\t\tl+=1\t\t\r\n\treturn ''.join(h)\r\n\t\r\ndef run():\r\n\tindicaciones=input().strip()\r\n\tind=indicaciones.split(\" \")\t\r\n\tcadena=input()\r\n\tnew=cadena\r\n\tfor x in range(int(ind[1])):\r\n\t\ttmp=input().strip()\r\n\t\tlrc=tmp.split(\" \")\r\n\t\tnew=chan(new,lrc)\r\n\tprint (new)\t\r\n\r\nif __name__\t== '__main__':\t\r\n\trun()", "n,m = [int(i) for i in input().split()]\r\nword = input()\r\nfor x in range(m):\r\n l,r,c1,c2 = [i for i in input().split()]\r\n for y in range(int(l)-1,int(r)):\r\n if word[y]==c1:\r\n word = word[:y]+c2+word[y+1:]\r\nprint(word)\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nli=[]\r\nfor i in s:\r\n li.append(i)\r\nfor i in range(k):\r\n m=list(map(str,input().split()))\r\n for j in range(int(m[0])-1,int(m[1])):\r\n if li[j]==m[2]:\r\n li[j]=m[3]\r\ns=\"\".join(li)\r\nprint(s)\r\n \r\n", "n, m = map(int, input().split())\r\ns = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n L = int(l)\r\n R = int(r)\r\n s = s[:(L-1)]+s[(L-1):R].replace(c1, c2)+s[R:]\r\nprint(s)\r\n", "n = input().split()\r\ns = list(input())\r\nfor i in range(int(n[1])):\r\n c = input().split()\r\n for j in range(int(c[0])-1 , int(c[1])):\r\n if s[j] == c[2]:\r\n s[j] = c[3]\r\nt = ''\r\nfor i in range(int(n[0])):\r\n t += s[i]\r\nprint(t) \r\n", "\r\nn,m=map(int,input().strip().split(' '))\r\nt=list(input())\r\ns=['4']\r\nfor i in t:\r\n s.append(str(i))\r\n\r\n\r\n\r\nfor i in range(m):\r\n t=list(map(str,input().strip().split(' ')))\r\n \r\n l=int(t[0])\r\n r=int(t[1])\r\n for j in range(l,r+1):\r\n \r\n if(s[j]==t[2]):\r\n s[j]=t[3]\r\nfor i in s:\r\n if(i=='4'):\r\n continue\r\n\r\n print(i,end='')\r\n \r\n \r\n \r\n ", "n, m = map(int, input().split())\r\nstring = input()\r\nfor i in range(m):\r\n l, r, c1, c2 = input().split()\r\n l, r = int(l),int(r)\r\n string = string[:l-1]+string[l-1:r].replace(c1, c2)+string[r:]\r\nprint(string) \r\n " ]

[ "(k, n, m) = map(int, input().split())\r\na = []\r\nfor i in range(k):\r\n s = input()\r\n a.append([])\r\n for j in range(n):\r\n a[-1].append(list(input()))\r\ns = input()\r\n(x, y) = map(int, input().split())\r\nx -= 1\r\ny -= 1\r\n\r\nstart = (0, x, y)\r\nsosed = set()\r\nsosed.add(start)\r\nposetil = set()\r\nposetil.add(start)\r\nwhile len(sosed) >0:\r\n sosed2 = set()\r\n for i in sosed:\r\n for dk in [-1,0,1]:\r\n for dx in [-1,0,1]:\r\n for dy in [-1,0,1]:\r\n if abs(dk)+abs(dx)+abs(dy) == 1:\r\n if (i[0]+dk <k) and (i[0]+dk>=0) and (i[1]+dx < n) and (i[1]+dx>=0) and (i[2]+dy < m) and (i[2]+dy >=0):\r\n if a[i[0]+dk][i[1]+dx][i[2]+dy] == '.':\r\n if (i[0]+dk, i[1]+dx, i[2]+dy) in posetil:\r\n continue\r\n else:\r\n posetil.add((i[0]+dk,i[1]+dx,i[2]+dy))\r\n sosed2.add((i[0]+dk,i[1]+dx,i[2]+dy))\r\n sosed = sosed2.copy()\r\nprint(len(posetil))\r\n", "from collections import deque\n\ndef solve():\n k, n, m = map(int, input().rstrip().split())\n plate = []\n for a in range(k):\n plate.append([])\n for b in range(n):\n plate[a].append([])\n for a in range(k):\n input()\n for b in range(n):\n for char in input().rstrip():\n plate[a][b].append(char)\n input()\n x, y = map(int, input().rstrip().split())\n q = deque()\n q.append((0, x-1, y-1))\n seen = set()\n while len(q) > 0:\n x, y, z = q.popleft()\n if (x, y, z) not in seen:\n if 0 <= x < k:\n if 0 <= y < n:\n if 0 <= z < m:\n if plate[x][y][z] == '.':\n seen.add((x, y, z))\n for d in [-1, 1]:\n q.append((x+d, y, z))\n q.append((x, y+d, z))\n q.append((x, y, z+d))\n print(len(seen))\n\nif __name__ == \"__main__\":\n solve()\n", "from sys import stdin\nfrom collections import deque\n\nif __name__ == '__main__':\n H, R, C = map(int, stdin.readline().rstrip().split())\n plate = []\n for h in range(0, H):\n plate_h = []\n stdin.readline()\n for r in range(0, R):\n plate_r = [x == '.' for x in stdin.readline()]\n plate_h.append(plate_r)\n plate.append(plate_h)\n\n stdin.readline()\n start_h = 0\n start_r, start_c = map(int, stdin.readline().rstrip().split())\n start_r -= 1\n start_c -= 1\n plate[start_h][start_r][start_c] = False;\n count = 0\n queue = deque()\n queue.append((start_h, start_r, start_c))\n\n\n def move(height, row, col):\n if 0 <= height < H and \\\n 0 <= row < R and \\\n 0 <= col < C and \\\n plate[height][row][col]:\n plate[height][row][col] = False\n queue.append((height, row, col))\n\n\n while len(queue) > 0:\n (h, r, c) = queue.popleft()\n count += 1\n move(h - 1, r, c)\n move(h + 1, r, c)\n move(h, r - 1, c)\n move(h, r + 1, c)\n move(h, r, c - 1)\n move(h, r, c + 1)\n print(count)\n", "k, n, m = map(int, input().split())\ngrid = k * [ None ]\nseen = k * [ None ]\nfor i in range(k):\n\tinput()\n\tgrid[i] = [ input().strip() for r in range(n) ]\n\tseen[i] = [ [ False for c in range(m) ] for r in range(n) ]\ninput()\nx, y = map(int, input().split())\nx -= 1\ny -= 1\ncount = 1\nseen[0][x][y] = True\nqueue = [ (0, x, y) ]\npos = 0\n\ndef attempt(z, x, y):\n\tglobal count\n\tif z < 0 or x < 0 or y < 0:\n\t\treturn\n\tif z >= k or x >= n or y >= m:\n\t\treturn\n\tif seen[z][x][y] or grid[z][x][y] == '#':\n\t\treturn\n\tseen[z][x][y] = True\n\tcount += 1\n\tqueue.append((z, x, y))\n\nwhile pos < len(queue):\n\tz, x, y = queue[pos]\n\tpos += 1\n\tattempt(z - 1, x, y)\n\tattempt(z + 1, x, y)\n\tattempt(z, x - 1, y)\n\tattempt(z, x + 1, y)\n\tattempt(z, x, y - 1)\n\tattempt(z, x, y + 1)\n\nprint(count)\n", " \ndef serial(sx, sy):\n run_s = set()\n count = 0\n run_s.add((0, sx, sy))\n while run_s:\n count += 1\n current = run_s.pop()\n if (not d[current]):\n d[current] = True\n h, x, y = current\n next_v = [(h - 1, x, y), (h + 1, x, y), (h, x - 1, y), (h, x + 1, y)\n , (h, x, y - 1), (h, x, y + 1)]\n for v in next_v:\n if (v in d and (not d[v])):\n run_s.add(v)\n\n return count\n\n\nk, m, n = (int(s) for s in input().split())\nd = dict()\n\nfor x in range(k):\n\tinput()\n\tfor y in range(m):\n\t\tline = input()\n\t\tfor idx, ch in enumerate(line):\n\t\t\tif ch == '.':\n\t\t\t\td[(x, y, idx)] = False;\n\ninput()\n\nstart_x, start_y = (int(s) - 1 for s in input().split())\n\nprint(serial(start_x, start_y))\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n##########################################################\r\nfrom collections import Counter\r\n# c=sorted((i,int(val))for i,val in enumerate(input().split()))\r\nimport heapq\r\n# c=sorted((i,int(val))for i,val in enumerate(input().split()))\r\n# n = int(input())\r\n# ls = list(map(int, input().split()))\r\n# n, k = map(int, input().split())\r\n# n =int(input())\r\n# e=list(map(int, input().split()))\r\nfrom collections import Counter\r\nk,n,m = map(int, input().split())\r\nplates=[]\r\nv=[[[False for i in range(m)]for j in range(n)] for jj in range(k)]\r\nfor i in range(k):\r\n input() ###whilte space\r\n plates.append([input() for j in range(n)])\r\ninput()\r\nx,y=map(int,input().split())\r\nx-=1\r\ny-=1\r\nd=[[1,0,0],[0,1,0],[0,0,1],[-1,0,0],[0,-1,0],[0,0,-1]]\r\nq=[]\r\nq.append((0,x,y)) #### plates[height][vertical][horizontal]\r\n\r\ncnt=0\r\nwhile q:\r\n cnt+=1\r\n s=q.pop()\r\n v[s[0]][s[1]][s[2]]=True\r\n for ch in d:\r\n dz=s[0]+ch[0]\r\n dx=s[1]+ch[1]\r\n dy=s[2]+ch[2]\r\n if dx>=0 and dx<n and dy>=0 and dy<m and dz>=0 and dz<k:\r\n if v[dz][dx][dy]==0 and plates[dz][dx][dy]==\".\":\r\n q.append((dz,dx,dy))\r\n v[dz][dx][dy]=1\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\n\ninfo = sys.stdin.readline().split()\nk = int(info[0])\nn = int(info[1])\nm = int(info[2])\nsys.stdin.readline()\n\nplate = []\nfor i in range(k):\n rect = []\n for j in range(n):\n elem = []\n for c in sys.stdin.readline()[:-1]:\n elem.append(c == '.')\n rect.append(elem)\n plate.append(rect)\n sys.stdin.readline()\n \ninfo = sys.stdin.readline().split()\nwaterX = int(info[0]) - 1\nwaterY = int(info[1]) - 1\n\nvisited = set()\nstack = [(waterX, waterY, 0)]\n\ndirection = [(1, 0, 0), (-1, 0, 0), (0, 1, 0), (0, -1, 0), (0, 0, 1), (0, 0, -1)]\n\nvolume = 0\nwhile len(stack) != 0:\n cur = stack.pop()\n \n if cur in visited:\n continue\n\n visited.add(cur)\n curX = cur[0]\n curY = cur[1]\n curZ = cur[2]\n volume += 1\n\n for dd in direction:\n newX = curX + dd[0]\n newY = curY + dd[1]\n newZ = curZ + dd[2]\n\n if newX >= 0 and newX < n and newY >= 0 and newY < m and newZ >= 0 and newZ < k:\n if plate[newZ][newX][newY]:\n stack.append((newX, newY, newZ))\n\nprint(volume)\n", "def water(z,x,y):\r\n global res\r\n a[z*(n)+x][y]='#'\r\n res+=1\r\n if y-1>=0 and x<n and y<m and z<k and a[z*(n)+x][y-1]=='.':\r\n water(z,x,y-1)\r\n if y+1<m and x<n and y<m and z<k and a[z*(n)+x][y+1]=='.':\r\n water(z,x,y+1)\r\n if x-1>=0 and x<n and y<m and z<k and a[z*(n)+x-1][y]=='.':\r\n water(z,x-1,y)\r\n if x+1<n and x<n and y<m and z<k and a[z*(n)+x+1][y]=='.':\r\n water(z,x+1,y)\r\n if z-1>=0 and x<n and y<m and z<k and a[(z-1)*(n)+x][y]=='.':\r\n water(z-1,x,y)\r\n if z+1<k and x<n and y<m and z<k and a[(z+1)*(n)+x][y]=='.':\r\n water(z+1,x,y)\r\n return res\r\n \r\nk,n,m= map(int, input().split())\r\na=[]\r\nprom=[]\r\nfor i in range(k):\r\n input()\r\n for j in range(n):\r\n a.append(' '.join(input()).split()) \r\ninput()\r\nx,y=map(int, input().split())\r\nres=0\r\nprint(water(0,x-1,y-1))", "import sys\r\nimport collections\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nints = lambda: list(map(int, input().split()))\r\n\r\ndirs = [(1, 0, 0), (-1, 0, 0), (0, 1, 0), (0, -1, 0), (0, 0, 1), (0, 0, -1)]\r\nk, n, m = ints()\r\nl = input()\r\ngrid = []\r\nfor _ in range(k):\r\n square = []\r\n for _ in range(n):\r\n row = list(input().strip())\r\n square.append(row)\r\n grid.append(square)\r\n l = input()\r\nx, y = ints()\r\n\r\nq = collections.deque([(0, x - 1, y - 1)])\r\nvisited = {(0, x - 1, y - 1): True}\r\ncount = 0\r\n\r\nwhile q:\r\n a, b, c = q.popleft()\r\n count += 1\r\n\r\n for d in dirs:\r\n na, nb, nc = a + d[0], b + d[1], c + d[2]\r\n\r\n if 0 <= na < k and 0 <= nb < n and 0 <= nc < m and (na, nb, nc) not in visited:\r\n if grid[na][nb][nc] == \".\":\r\n q.append((na, nb, nc))\r\n visited[(na, nb, nc)] = True\r\nprint(count)", "dx = [-1, 0, 0, 1, 0, 0]\ndy = [0, -1, 1, 0, 0, 0]\ndz = [0, 0, 0, 0, -1, 1]\n\nans = 0\nk, n, m = [int(x) for x in input().split()]\nplate = [];\nfor ki in range(k):\n input()\n layer = []\n for ni in range(n):\n layer.append(list(input()));\n plate.append(layer);\ninput()\nx, y = [int(x) - 1 for x in input().split()]\n\nq = []\nplate[0][x][y] = 'V'\nq.append((0, x, y));\nans += 1\nwhile(len(q) > 0):\n z, x, y = q.pop();\n for i in range(6):\n newZ = z + dz[i]\n newX = x + dx[i]\n newY = y + dy[i]\n if 0 <= newZ < k and 0 <= newX < n and 0 <= newY < m:\n if plate[newZ][newX][newY] == '.':\n plate[newZ][newX][newY] = 'V'\n q.append((newZ, newX, newY))\n ans += 1\nprint(ans)\n", "\r\nfrom sys import stdin, stdout\r\n# output\r\ndef out(s):\r\n stdout.write(s)\r\n# read line of input\r\ndef line():\r\n return stdin.readline().strip()\r\n# read in ints on a line\r\ndef ints():\r\n return map(int, line().split())\r\nimport copy\r\n# create array & fill it\r\ndef arr(length, default=0):\r\n return [copy.deepcopy(default) for _ in range(length)]\r\n\r\n\r\n\r\ndef main():\r\n k, n, m = ints()\r\n grid = arr(k, arr(n))\r\n line()\r\n for i in range(k):\r\n for j in range(n):\r\n grid[i][j] = list(line())\r\n line()\r\n sx, sy = ints()\r\n st = [(0, sx - 1, sy - 1)]\r\n count = 0\r\n while st:\r\n a, b, c = st.pop()\r\n if grid[a][b][c] != '.': continue\r\n grid[a][b][c] = '#'\r\n count += 1\r\n da = [0, 0, 0, 0, -1, 1]\r\n db = [0, 0, -1, 1, 0, 0]\r\n dc = [-1, 1, 0, 0, 0, 0]\r\n for i in range(6):\r\n na, nb, nc = a + da[i], b + db[i], c + dc[i]\r\n if na < 0 or nb < 0 or nc < 0: continue\r\n if na >= k or nb >= n or nc >= m: continue\r\n if grid[na][nb][nc] != '.': continue\r\n st.append((na, nb, nc))\r\n print(count)\r\n\r\n\r\nif \"__main__\" == __name__:\r\n main()\r\n", "import sys\n\nin_bounds = lambda node, plate: node[0] >= 0 and node[0] < len(plate[0]) and node[1] >= 0 and node[1] < len(plate[0][0]) and node[2] >= 0 and node[2] < len(plate)\nnew_node = lambda prev_node, move: (prev_node[0] + move[0], prev_node[1] + move[1], prev_node[2] + move[2])\ndef bfs(plate, x, y):\n moves = [(0, 0, 1), (0, 0, -1), (0, -1, 0), (0, 1, 0), (-1, 0, 0), (1, 0, 0)]\n plate[0][x][y] = '#'\n queue = []\n queue.append((x, y, 0))\n total = 1\n while len(queue) != 0:\n cur_node = queue.pop(0)\n for move in moves:\n next_node = new_node(cur_node, move)\n if in_bounds(next_node, plate):\n if plate[next_node[2]][next_node[0]][next_node[1]] == '.':\n queue.append(next_node)\n total += 1\n plate[next_node[2]][next_node[0]][next_node[1]] = '#'\n return total\n\ndef main():\n k, n, m = tuple([int(i) for i in sys.stdin.readline().strip().split()])\n plate = [[['' for _ in range(m)] for _ in range(n)] for _ in range(k)]\n for rect in plate:\n for line in rect:\n inpt_line = sys.stdin.readline().strip()\n while inpt_line == '':\n inpt_line = sys.stdin.readline().strip()\n for i in range(len(line)):\n line[i] = inpt_line[i]\n sys.stdin.readline()\n st_n, st_m = tuple([int(i) for i in sys.stdin.readline().strip().split()])\n print(bfs(plate, st_n-1, st_m-1))\n\n\nif __name__ == \"__main__\":\n main()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nk, n, m = map(int, input().split())\r\n\r\n\r\ndef is_good(x, y, z):\r\n return 0 <= x < k and 0 <= y < n and 0 <= z < m\r\n\r\n\r\ndef neighbor(x, y, z):\r\n return [(x+1, y, z), (x-1, y, z), (x, y-1, z), (x, y+1, z), (x, y, z-1), (x, y, z+1)]\r\n\r\n\r\ndef f(x, y, z):\r\n global s, w\r\n\r\n s += 1\r\n w[x][y][z] = 0\r\n for i in neighbor(x, y, z):\r\n a, b, c = i[0], i[1], i[2]\r\n if is_good(a, b, c):\r\n if d[a][b][c] == '.':\r\n if w[a][b][c]:\r\n f(a, b, c)\r\n\r\nd = []\r\ninput()\r\nfor i in range(k):\r\n g = [input()[:-1] for _ in range(n)]\r\n d.append(g)\r\n input()\r\n\r\nw = [[[1]*m for i in range(n)] for j in range(k)]\r\ns = 0\r\n\r\nx, y = map(lambda x:int(x)-1, input().split())\r\nf(0, x, y)\r\n\r\nprint(s)", "def bfs(d,x,y):\r\n queue = [[x,y,0]]\r\n lst = [[0,-1,0],[0,1,0],[0,0,-1],[0,0,1],[-1,0,0],[1,0,0]]\r\n mark = [[[False for u in range(m)] for j in range(n)]\r\n for i in range(k)]\r\n mark[0][x][y]=True\r\n res=1\r\n while queue:\r\n q = queue.pop(0)\r\n a,b,c = q[0],q[1],q[2]\r\n #print(q,d[c][a][b])\r\n for i,item in enumerate(lst):\r\n w,e,r=item[0]+a,item[1]+b,item[2]+c\r\n if -1<w<n and -1<e<m and -1<r<k:\r\n if mark[r][w][e]==False and d[r][w][e]=='.':\r\n mark[r][w][e]=True\r\n res+=1\r\n queue.append([w,e,r])\r\n print(res)\r\nk,n,m = map(int,input().split())\r\nd = []\r\nfor i in range(k):\r\n d.append([])\r\n p = input()\r\n for j in range(n):\r\n d[i].append(input())\r\np=input()\r\nx,y = map(int,input().split())\r\nx,y=x-1,y-1\r\nbfs(d,x,y)", "z, n, m = [int(x) for x in input().split()]\r\n\r\nadj = []\r\nvis = []\r\n\r\nfor i in range(15):\r\n adj.append([])\r\n vis.append([])\r\n for j in range(15):\r\n adj[i].append([\"\"] * 15)\r\n vis[i].append([False] * 15)\r\n\r\nfor i in range(1, z + 1):\r\n input()\r\n for j in range(1, n + 1):\r\n c = list(input())\r\n for l in range(1, len(c) + 1):\r\n adj[i][j][l] = c[l - 1]\r\ninput()\r\n\r\nx, y = [int(e) for e in input().split()]\r\n\r\ndef dfs(l, x, y, z):\r\n if (x > 0 and y > 0 and l > 0 and l <= z and x <= n and y <= m and not vis[l][x][y]):\r\n if (adj[l][x][y] == '#'):\r\n return\r\n vis[l][x][y] = True\r\n dfs(l + 1, x, y, z)\r\n dfs(l - 1, x, y, z)\r\n dfs(l, x + 1, y, z)\r\n dfs(l, x - 1, y, z)\r\n dfs(l, x, y + 1, z)\r\n dfs(l, x, y - 1, z)\r\n\r\ndfs(1, x, y, z)\r\n\r\nout = 0\r\nfor i in range(1, z + 1):\r\n for j in range(1, n + 1):\r\n for l in range(1, m + 1):\r\n if (vis[i][j][l]):\r\n out += 1\r\n\r\nprint(out)", "import collections\n\n\ndef read_ints():\n return map(lambda s: int(s), input().split(' '))\n\n\ndef consume_line():\n input()\n\n\ndef nbs(grid, point):\n def inbounds(p):\n xp, yp, zp = p\n return 0 <= zp < len(grid) and 0 <= xp < len(grid[zp]) and 0 <= yp < len(grid[zp][xp]) and grid[zp][xp][yp]\n\n x, y, z = point\n return filter(inbounds, [(x+1, y, z), (x, y+1, z), (x-1, y, z), (x, y-1, z), (x, y, z+1), (x, y, z-1)])\n\n\ndef flood(grid, startx, starty):\n seen = set()\n q = collections.deque()\n q.append((startx, starty, 0))\n\n while len(q) != 0:\n v = q.popleft()\n if v in seen:\n continue\n seen.add(v)\n for nb in nbs(grid, v):\n q.append(nb)\n return len(seen)\n\n\ndef main():\n k, n, m = read_ints()\n consume_line()\n grid = []\n\n for _ in range(k):\n layer = []\n for _ in range(n):\n row = list(map(lambda c: c == '.', input()))\n layer.append(row)\n consume_line()\n grid.append(layer)\n\n startx, starty = read_ints()\n print(flood(grid, startx - 1, starty - 1))\n\n\nif __name__ == \"__main__\":\n main()\n", "from collections import deque\n\n# input and initialization\nk, n, m = list(map(int, input().split()))\nplate = [[[] for _ in range(n)] for _ in range(k)]\nfor z in range(k):\n input() # empty line\n for r in range(n):\n plate[z][r] = list(input())\ninput() # empty line\nx, y = list(map(int, input().split()))\n\n\n# bfs, count all nodes\nvisited = set()\ncount = 0\npoints = deque([(x - 1, y - 1, 0)])\nwhile len(points) > 0:\n point = points.popleft()\n x, y, z = point\n if (point in visited or plate[z][x][y] == '#'):\n continue\n\n visited.add(point)\n\n xlist = [-1, 0, 1, 0, 0, 0]\n ylist = [0, 0, 0, -1, 1, 0]\n zlist = [0, 1, 0, 0, 0, -1]\n for i in range(len(xlist)):\n if (0 <= x + xlist[i] < n and 0 <= y + ylist[i] < m and 0 <= z + zlist[i] < k):\n points.append((x + xlist[i], y + ylist[i], z + zlist[i]))\n\n count += 1\n\n\n# result\nprint(count)", "directions = [[0, 0, 1], [0, 0, -1], [0, 1, 0], [0, -1, 0], [1, 0, 0], [-1, 0, 0]]\nline = input().split()\nk = int(line[0])\nn = int(line[1])\nm = int(line[2])\ninput()\n\ngraph = []\nfor layer in range(k):\n for line in range(n):\n graph.append(input())\n input()\n\nline = input().split()\nx = int(line[0])\ny = int(line[1])\n\n\nvisited = [False] * (k * n * m)\n\ndef dfs(vertex):\n if visited[n * m * vertex[0] + m * vertex[1] + vertex[2]]:\n return\n else:\n visited[n * m * vertex[0] + m * vertex[1] + vertex[2]] = True\n \n for direction in directions:\n position_to_look = []\n invalid = False\n for i in range(3):\n position_to_look.append(vertex[i] + direction[i])\n for coordinate in position_to_look:\n if coordinate < 0:\n invalid = True\n if position_to_look[0] >= k or position_to_look[1] >= n or position_to_look[2] >= m:\n invalid = True\n \n if invalid:\n continue\n \n if graph[n * position_to_look[0] + position_to_look[1]][position_to_look[2]] == '.':\n dfs(position_to_look)\n\ndfs([0, x - 1, y - 1])\ncounter = 0\nfor vertex in visited:\n if vertex:\n counter += 1\n\nprint(counter)\n \t\t\t \t\t \t\t\t\t\t \t\t \t\t \t", "from collections import deque\r\nk,n,m = tuple(int(i) for i in input().split())\r\nv = [[[-1 for n1 in range(m)] for n2 in range(n)] for n3 in range(k)]\r\ngrid = [[[] for n2 in range(n)] for n1 in range(k)]\r\ninput()\r\nfor n1 in range(k):\r\n for n2 in range(n):\r\n grid[n1][n2] = list(input())\r\n input()\r\nsx = 0\r\nsy, sz = tuple(int(i)-1 for i in input().split())\r\n\r\n#for n1 in range(k):\r\n# print(\"level\",n1)\r\n# for n2 in range(n):\r\n# print(grid[n1][n2])\r\n\r\ndxa = [1,-1,0,0,0,0]\r\ndya = [0,0,1,-1,0,0]\r\ndza = [0,0,0,0,1,-1]\r\n\r\nBFSQ = deque([(sx,sy,sz)])\r\n# push = .append\r\n# pop = .popleft\r\nnumv = 0\r\nwhile(len(BFSQ)>0):\r\n curr = BFSQ.popleft()\r\n x = curr[0]\r\n y = curr[1]\r\n z = curr[2]\r\n if(grid[x][y][z]==\"#\"):\r\n continue\r\n if(v[x][y][z]!=-1):\r\n continue\r\n v[x][y][z]=1\r\n numv+=1\r\n for p in range(6):\r\n dx = dxa[p]\r\n dy = dya[p]\r\n dz = dza[p]\r\n if(x+dx<0 or x+dx>=k or y+dy<0 or y+dy>=n or z+dz<0 or z+dz>=m):\r\n continue\r\n if(grid[x+dx][y+dy][z+dz]==\"#\" or v[x+dx][y+dy][z+dz]!=-1):\r\n continue\r\n BFSQ.append((x+dx,y+dy,z+dz))\r\nprint(numv)\r\n\r\n \r\n \r\n \r\n", "from collections import deque\r\nk, n, m = [int(x) for x in input().split()]\r\ninput()\r\n\r\ng = [[] for _ in range(k)]\r\nvisited = [[[False for x in range(m)] for y in range(n)] for z in range(k)]\r\n\r\nfor a in range(k):\r\n for i in range(n):\r\n g[a].append(list(input()))\r\n input()\r\nx, y = [int(x) for x in input().split()]\r\n\r\ndx = [1, 0, 0, -1, 0, 0]\r\ndy = [0, 1, 0, 0, -1, 0]\r\ndz = [0, 0, 1, 0, 0, -1]\r\n\r\nd = deque()\r\nd.append((0,x-1,y-1))\r\ncount = 0\r\nwhile d:\r\n pos = d.pop()\r\n # print(pos)\r\n if (pos[0] < 0) or (pos[0] >= k) or (pos[1] < 0) or (pos[1] >= n) or \\\r\n (pos[2] < 0) or (pos[2] >= m) or g[pos[0]][pos[1]][pos[2]] == '#' or \\\r\n visited[pos[0]][pos[1]][pos[2]]:\r\n continue\r\n count += 1\r\n visited[pos[0]][pos[1]][pos[2]] = True\r\n\r\n for i in range(6):\r\n d.append((pos[0] + dz[i], pos[1] + dx[i], pos[2] + dy[i]))\r\n\r\n\r\n# print(g)\r\n# print(visited)\r\n# print(x,y)\r\nprint(count)", "\r\ndef DFS(plate,visited,k,n,m,x,y,z):\r\n\r\n\r\n\tstack = [(x,y,z)]\r\n\t\r\n\tc = 0\r\n\r\n\twhile len(stack):\r\n\r\n\t\ttempx,tempy,tempz = stack.pop()\r\n\r\n\t\tvisited[tempz][tempy][tempx] = 1\r\n\t\t\r\n\t\tc = c + 1\r\n\r\n\t\tif tempx < m-1 and visited[tempz][tempy][tempx+1] == 0 and \\\r\n\t\tplate[tempz][tempy][tempx+1] == \".\":\r\n\r\n\t\t\tstack.append((tempx+1,tempy,tempz))\r\n\t\t\tvisited[tempz][tempy][tempx+1] = 1\r\n\r\n\t\tif tempx > 0 and visited[tempz][tempy][tempx-1] == 0 and \\\r\n\t\tplate[tempz][tempy][tempx-1] == \".\":\r\n\r\n\t\t\tstack.append((tempx-1,tempy,tempz))\r\n\t\t\tvisited[tempz][tempy][tempx-1] = 1\r\n\r\n\t\tif tempy < n-1 and visited[tempz][tempy+1][tempx] == 0 and \\\r\n\t\tplate[tempz][tempy+1][tempx] == \".\":\r\n\r\n\t\t\tstack.append((tempx,tempy+1,tempz))\r\n\t\t\tvisited[tempz][tempy+1][tempx] = 1\r\n\r\n\t\tif tempy > 0 and visited[tempz][tempy-1][tempx] == 0 and \\\r\n\t\tplate[tempz][tempy-1][tempx] == \".\":\r\n\r\n\t\t\tstack.append((tempx,tempy-1,tempz))\r\n\t\t\tvisited[tempz][tempy-1][tempx] = 1\r\n\r\n\t\tif tempz < k-1 and visited[tempz+1][tempy][tempx] == 0 and \\\r\n\t\tplate[tempz+1][tempy][tempx] == \".\":\r\n\r\n\t\t\tstack.append((tempx,tempy,tempz+1))\r\n\t\t\tvisited[tempz+1][tempy][tempx] = 1\r\n\t\t\t# print(\"---\",tempz,tempy,tempx)\r\n\r\n\t\tif tempz > 0 and visited[tempz-1][tempy][tempx] == 0 and \\\r\n\t\t plate[tempz-1][tempy][tempx] == \".\":\r\n\r\n\t\t\tstack.append((tempx,tempy,tempz-1))\r\n\t\t\tvisited[tempz-1][tempy][tempx] = 1\r\n\r\n\treturn c\r\nk,n,m = map(int,input().split())\r\nplate = []\r\nfor i in range(k):\r\n\tmatrix = []\r\n\tfor j in range(n+1):\r\n\t\tt = input()\r\n\t\tif len(t):\r\n\t\t\tmatrix.append(t)\r\n\r\n\tplate.append(matrix)\r\nvisited = [[[0 for i in range(m)] for j in range(n)] for k1 in range(k)]\r\n\r\nr = input()\r\na,b = map(int,input().split())\r\nz = 0\r\nans = DFS(plate,visited,k,n,m,b-1,a-1,z)\r\nprint(ans)\r\n", "from queue import Queue\n\n(k, n, m) = [int(i) for i in input().split()]\nlayers = []\ninput()\nfor _ in range(k):\n layer = []\n for _ in range(n):\n layer.append(list(input()))\n layers.append(layer)\n input()\n\nstart = tuple([0] + [int(i) - 1 for i in input().split()])\n\nq = Queue()\nq.put(start)\ndone = set()\ndone.add(start)\n\n\ndef getnear(point):\n dx = [1, -1, 0, 0, 0, 0]\n dy = [0, 0, 1, -1, 0, 0]\n dz = [0, 0, 0, 0, 1, -1]\n (z, x, y) = point\n\n return (\n tuple([z + dz[i], x + dx[i], y + dy[i]])\n for i in range(6)\n if z + dz[i] < k\n and z + dz[i] >= 0\n and x + dx[i] < n\n and x + dx[i] >= 0\n and y + dy[i] < m\n and y + dy[i] >= 0\n )\n\n\ncount = 1\nwhile not q.empty():\n loc = q.get()\n for p in getnear(loc):\n if p not in done and layers[p[0]][p[1]][p[2]] == \".\":\n q.put(tuple(p))\n done.add(p)\n count += 1\n\nprint(count)\n", "from collections import deque\n\nh, l, w = tuple(map(int, input().split()))\ndi = [1, -1, 0, 0, 0, 0]\ndj = [0, 0, 1, -1, 0, 0]\ndk = [0, 0, 0, 0, 1, -1]\n\nplate = [[['\\0' for k in range(w)] for j in range(l)] for i in range(h)]\nvisited = [[[False for k in range(w)] for j in range(l)] for i in range(h)]\n\nfor x in range(h):\n input()\n for y in range(l):\n plate[x][y] = list(input())\ninput()\nx, y = tuple(map(int, input().split()))\n\nstack = deque()\nstack.append((0, x-1, y-1))\n\nwhile stack:\n i, j, k = stack.pop()\n if visited[i][j][k] or plate[i][j][k] == '#': continue\n visited[i][j][k] = True\n for x in range(6):\n n_i = i + di[x]\n n_j = j + dj[x]\n n_k = k + dk[x]\n if n_i > -1 and n_j > -1 and n_k > -1 and n_i < h and n_j < l and n_k < w and not visited[n_i][n_j][n_k]:\n stack.append((n_i, n_j, n_k))\n\nprint(sum([sum([row.count(True) for row in level]) for level in visited]))\n", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def bfs(l, x, y, n, m):\r\n used[l * n * m + m * x + y] = 1\r\n q = [l * n * m + m * x + y]\r\n it = 0\r\n\r\n while it < len(q):\r\n h = q[it]\r\n it += 1\r\n\r\n for u in g[h]:\r\n if used[u] == 0:\r\n used[u] = 1\r\n q.append(u)\r\n\r\n k, n, m = map(int, input().split())\r\n F = []\r\n\r\n for i in range(k):\r\n input()\r\n F.append([])\r\n for j in range(n):\r\n f = str(input())\r\n F[-1].append(f)\r\n\r\n used = [0 for i in range(k * n * m)]\r\n g = [[] for i in range(k * n * m)]\r\n v = [[-1, 0, 0], [1, 0, 0], [0, -1, 0], [0, 1, 0], [0, 0, -1], [0, 0, 1]]\r\n\r\n for l in range(k):\r\n for x in range(m):\r\n for y in range(n):\r\n for dk, dx, dy in v:\r\n if 0 <= l + dk < k and 0 <= x + dx < m and 0 <= y + dy < n:\r\n if F[l][y][x] == \".\" and F[l + dk][y + dy][x + dx] == \".\":\r\n g[l * n * m + m * y + x].append((l + dk) * n * m + m * (y + dy) + (x + dx))\r\n input()\r\n x, y = map(int, input().split())\r\n\r\n bfs(0, x - 1, y - 1, n, m)\r\n print(sum(used))\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "def get_cube(k, n, m):\n result = []\n for i in range(k):\n input()\n result.append([])\n for j in range(n):\n line = input()\n result[i].append([True if i == '.' else False for i in line])\n return result\n\ndef solution(cube, tapX, tapY):\n stack = [(0, tapX, tapY)]\n x = [1,-1,0,0,0,0]\n y = [0,0,1,-1,0,0]\n z = [0,0,0,0,-1,1]\n mins = 0\n visited = set()\n while stack:\n currx, curry, currz = stack.pop()\n if currx < 0 or currx >= len(cube):\n continue\n if curry < 0 or curry >= len(cube[0]):\n continue\n if currz < 0 or currz >= len(cube[0][0]):\n continue\n if (currx, curry, currz) in visited or not cube[currx][curry][currz]:\n continue\n mins += 1\n for dx, dy, dz in zip(x,y,z):\n stack.append((currx+dx, curry+dy, currz+dz))\n visited.add((currx, curry, currz))\n return mins\n\n \n\nk,n,m = [int(i) for i in input().split()]\ncube = get_cube(k,n,m)\ninput()\ntapX, tapY = [int(i) for i in input().split()]\nprint(solution(cube, tapX-1, tapY-1))\n", "from collections import deque\nimport copy\n\ninput_dims = [int(i) for i in input().split()]\nk, n, m = input_dims\n\nplate = []\nfor level in range(k):\n input()\n plate.append([])\n for n_val in range(n):\n plate[level].append([c for c in input()])\ninput()\nx, y = [int(i) - 1 for i in input().split()]\n#print(\"Plate: \")\n#print(plate)\nvisited = [[[False for _ in range(m)] for _ in range(n)] for _ in range(k)]\n\nnum_visited = 0\nstart = [0, x, y]\nstack = deque()\n#print(plate[0][x][y])\nif plate[0][x][y] == '.':\n #print(\"start is valid\")\n stack.append(start)\nwhile len(stack):\n curr = stack.pop()\n if not visited[curr[0]][curr[1]][curr[2]]:\n visited[curr[0]][curr[1]][curr[2]] = True\n num_visited += 1\n #print(\"Neigbors:\")\n for axis in range(3):\n for direction in [-1, 1]:\n step = curr[axis] + direction\n if step >= 0 and step < input_dims[axis]:\n next_loc = copy.deepcopy(curr)\n next_loc[axis] += direction\n #print(\"Next loc: \", next_loc)\n #print(next_loc, ': ', plate[next_loc[0]][next_loc[1]][next_loc[2]])\n if plate[next_loc[0]][next_loc[1]][next_loc[2]] == '.':\n stack.append(next_loc)\n #print(\"got appended\")\nprint(num_visited)\n#print(visited)\n\n \n \n \n\n\n\n", "\n\n\nk,n,m=map(int,input().split())\n\nlis=[]\n\nfor i in range(k):\n znj=input()\n a=[]\n for j in range(n):\n inp=input()\n b=[]\n for ii in inp:\n b.append(ii)\n a.append(b)\n \n lis.append(a)\n\n##print(lis)\nznj=input()\nx,y=map(int,input().split())\n\nrj=0\n\ndef dfs(x,y,z):\n global rj\n da=True\n if x<0 or x>=k or y<0 or y>=n or z<0 or z>=m:\n da=False\n return\n elif da:\n## print(x,y)\n## print(lis[x][y])\n if lis[x][y][z]=='#':\n return\n rj+=1\n \n lis[x][y][z]='#'\n## print(lis[x][y])\n dfs(x+1,y,z)\n dfs(x-1,y,z)\n dfs(x,y+1,z)\n dfs(x,y-1,z)\n dfs(x,y,z+1)\n dfs(x,y,z-1)\n return\n\ndfs(0,x-1,y-1)\n\nprint(rj)\n\n\n \t\t \t \t \t\t \t\t\t\t \t \t \t", "import sys\n\ninput = sys.stdin.readline\n\nk, n, m = map(int, input().split())\n\nplates = []\n\nfor i in range(k):\n input()\n layer = []\n for j in range(n):\n layer.append(input())\n plates.append(layer)\n\ninput()\nx, y = map(int, input().split())\n\nvisited = [[[False for _ in range(m)] for _ in range(n)] for _ in range(k)]\n\nans = 0\n\nstack = [(0, x - 1, y - 1)]\nvisited[0][x - 1][y - 1] = True\n\nwhile stack:\n ans += 1\n a, b, c = stack[-1]\n stack.pop()\n\n nextLocation = []\n if a > 0:\n nextLocation.append((a - 1, b, c))\n if a + 1 < k:\n nextLocation.append((a + 1, b, c))\n if b > 0:\n nextLocation.append((a, b - 1, c))\n if b + 1 < n:\n nextLocation.append((a, b + 1, c))\n if c > 0:\n nextLocation.append((a, b, c - 1))\n if c + 1 < m:\n nextLocation.append((a, b, c + 1))\n for na, nb, nc in nextLocation:\n if plates[na][nb][nc] == '#':\n continue\n if visited[na][nb][nc]:\n continue\n visited[na][nb][nc] = True\n stack.append((na, nb, nc))\n\nprint(ans)\n\n", "def is_good(x, y, z):\r\n return 0 <= x < k and 0 <= y < n and 0 <= z < m\r\n\r\ndef neighbours(x, y, z):\r\n return [(x + 1, y, z), (x - 1, y, z), (x, y + 1, z), (x, y - 1, z), (x, y, z + 1), (x, y, z - 1)]\r\n\r\ndef dfs(x, y, z):\r\n global cnt, used\r\n used[x][y][z] = True\r\n cnt += 1\r\n for i in neighbours(x, y, z):\r\n if is_good(i[0], i[1], i[2]):\r\n if plate[i[0]][i[1]][i[2]] == \".\":\r\n if not used[i[0]][i[1]][i[2]]:\r\n dfs(i[0], i[1], i[2])\r\n\r\nk, n, m = map(int, input().split())\r\ninput()\r\nplate = [[[\"\"] * m for i in range(n)] for j in range(k)]\r\nfor i in range(k):\r\n for j in range(n):\r\n s = input().rstrip()\r\n for l in range(m):\r\n plate[i][j][l] = s[l]\r\n input()\r\nxs, ys = map(int, input().split())\r\nxs -= 1\r\nys -= 1\r\n\r\nused = [[[False] * m for i in range(n)] for j in range(k)]\r\n\r\ncnt = 0\r\ndfs(0, xs, ys)\r\nprint(cnt)", "import sys\r\n\r\ntimer = 0\r\nk,n,m = [int(x) for x in input().split()]\r\ncurrent_cell = (-1,-1,-1) # k,n,m\r\nseen = {}\r\nfor x in range(k):\r\n\tfor y in range(n):\r\n\t\tfor z in range(m):\r\n\t\t\tseen[(x,y,z)] = False\r\n# for whatever reason, the problem uses n before m\r\n\t\r\nlayers = [[]] * k\r\n\r\n# fills layers with blanks for everything before it gets filled\r\n# because python can't do that on its own\r\nfor x in range(k):\r\n\tlayers[x] = [[]] * n\r\n\tfor y in range(n):\r\n\t\tlayers[x][y] = [None] * m\r\n\r\n# jumps the blank line to get to the data\r\nblank_line = input()\r\n\r\n# fills the layers with their characters\r\nfor x in range(k):\r\n\tfor y in range(n):\r\n\t\tnext_line = input()\r\n\t\tfor z in range(len(next_line)):\r\n\t\t\tlayers[x][y][z] = next_line[z]\r\n\tblank_line = input()\r\n\r\n# gets the coordinates for the faucet head\r\nx,y = [int(x)-1 for x in input().split()]\r\ncurrent_cell = (0,x,y)\r\n\r\ndef do_thing(cell):\r\n\tglobal timer\r\n\tif not seen[cell]:\r\n\t\tseen[cell] = True\r\n\t\t# update timer\r\n\t\ttimer = timer +1\r\n\t\t# check down (dfs)\r\n\t\ta,b,c = cell\r\n\t\t# good to check below\r\n\t\tif a+1 < k and layers[a+1][b][c] is not '#':\r\n\t\t\tdo_thing((a+1,b,c))\r\n\t\t\r\n\t\t# check cardinal directions\r\n\t\t# left\r\n\t\tif c-1>-1 and layers[a][b][c-1] is not '#':\r\n\t\t\tdo_thing((a,b,c-1))\r\n\t\t\r\n\t\t# up\r\n\t\tif b-1>-1 and layers[a][b-1][c] is not '#':\r\n\t\t\tdo_thing((a,b-1,c))\r\n\t\t\r\n\t\t# right\r\n\t\tif c+1<m and layers[a][b][c+1] is not '#':\r\n\t\t\tdo_thing((a,b,c+1))\r\n\t\t\r\n\t\t# down\r\n\t\tif b+1<n and layers[a][b+1][c] is not '#':\r\n\t\t\tdo_thing((a,b+1,c))\r\n\t\t\r\n\t\t# check above\r\n\t\tif a-1>-1 and layers[a-1][b][c] is not '#':\r\n\t\t\tdo_thing((a-1,b,c))\r\n\t\r\ndo_thing(current_cell)\r\n\t\r\n\r\nprint(timer)", "k, n, m = map(int, input().split())\n\nspace = []\n\nfor i in range(k):\n input() # ignore empty line\n layer = [input() for j in range(n)]\n space.append(layer)\n\ninput() \n\nwaterx, watery = map(int, input().split())\n\nvisited = [[[False for mm in range(m)] for nn in range(n)] for kk in range(k)]\n\nfamily = 0\n\nvisited[0][waterx - 1][watery - 1] = True\nstack = []\nstack.append((0, waterx - 1, watery - 1))\nfamily += 1\n\n \nwhile stack:\n x, y, z = stack[-1]\n stack.pop()\n\n nextLocation = []\n\n if x > 0:\n nextLocation.append((x - 1, y, z))\n if x + 1 < k:\n nextLocation.append((x + 1, y, z))\n if y > 0:\n nextLocation.append((x, y - 1, z))\n if y + 1 < n:\n nextLocation.append((x, y + 1, z))\n if z > 0:\n nextLocation.append((x, y, z -1))\n if z + 1 < m:\n nextLocation.append((x, y, z + 1))\n\n for newx, newy, newz in nextLocation:\n if space[newx][newy][newz] == \".\" and visited[newx][newy][newz] == False:\n stack.append((newx, newy, newz))\n visited[newx][newy][newz] = True\n family += 1\n\nprint(family) \n\n\n\n\n\n", "from collections import defaultdict, deque\r\nk, n, m = map(int, input().split())\r\ngraph = defaultdict(set)\r\ninput()\r\nempty = set()\r\nfor i in range(k):\r\n for j in range(n):\r\n for l, c in enumerate(input()):\r\n if c != '.':\r\n continue\r\n empty.add((i, j, l))\r\n for x1, x2, x3 in [(i-1,j,l),(i,j-1,l),(i,j,l-1)]:\r\n if x1>=0 and x2>=0 and x3>=0 and (x1,x2,x3) in empty:\r\n graph[(x1,x2,x3)].add((i,j,l))\r\n graph[(i,j,l)].add((x1,x2,x3))\r\n \r\n input()\r\nx,y=map(int, input().split())\r\nx-=1\r\ny-=1\r\nqueue = deque([(0,x,y)])\r\nvisited = set([(0,x,y)])\r\nwhile queue:\r\n q = queue.pop()\r\n for nbr in graph[q]:\r\n if nbr not in visited:\r\n visited.add(nbr)\r\n queue.append(nbr)\r\nprint(len(visited))", "from collections import deque\n\n\nclass CodeforcesTask60BSolution:\n def __init__(self):\n self.result = ''\n self.k_n_m = []\n self.plate = []\n self.tape = []\n\n def read_input(self):\n self.k_n_m = [int(x) for x in input().split(\" \")]\n for x in range(self.k_n_m[0]):\n input()\n layer = []\n for y in range(self.k_n_m[1]):\n layer.append(list(input()))\n self.plate.append(layer)\n input()\n self.tape = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n to_visit = deque([(0, self.tape[0] - 1, self.tape[1] - 1)])\n visited = 0\n while to_visit:\n visiting = to_visit.popleft()\n if 0 <= visiting[0] < self.k_n_m[0] and 0 <= visiting[1] < self.k_n_m[1] and 0 <= visiting[2] < self.k_n_m[2]:\n if self.plate[visiting[0]][visiting[1]][visiting[2]] == \".\":\n visited += 1\n self.plate[visiting[0]][visiting[1]][visiting[2]] = \"-\"\n to_visit.append((visiting[0], visiting[1], visiting[2] + 1))\n to_visit.append((visiting[0], visiting[1], visiting[2] - 1))\n to_visit.append((visiting[0], visiting[1] + 1, visiting[2]))\n to_visit.append((visiting[0], visiting[1] - 1, visiting[2]))\n to_visit.append((visiting[0] + 1, visiting[1], visiting[2]))\n to_visit.append((visiting[0] - 1, visiting[1], visiting[2]))\n self.result = str(visited)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask60BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\n\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\ndef ind(visited,a,b,c,k,n,m):\r\n l = []\r\n if((a+1<k) and visited[a+1][b][c]!=-1):\r\n l.append((a+1,b,c))\r\n if((a-1>=0) and visited[a-1][b][c]!=-1):\r\n l.append((a-1,b,c))\r\n if((b+1<n) and visited[a][b+1][c]!=-1):\r\n l.append((a,b+1,c))\r\n if((b-1>=0) and visited[a][b-1][c]!=-1):\r\n l.append((a,b-1,c))\r\n if((c+1<m) and visited[a][b][c+1]!=-1):\r\n l.append((a,b,c+1))\r\n if((c-1>=0) and visited[a][b][c-1]!=-1):\r\n l.append((a,b,c-1))\r\n return l\r\ndef sum(visited,k,n,m):\r\n val = 0\r\n for a in range(k):\r\n for b in range(n):\r\n for c in range(m):\r\n if(visited[a][b][c]>0):\r\n val+=visited[a][b][c]\r\n return val\r\n\r\n'''Code'''\r\nk,n,m = sp_inp()\r\nvisited = [[[0 for _ in range(m)] for _ in range(n)] for _ in range(k)]\r\ninput()\r\nl = []\r\nfor a in range(k):\r\n for b in range(n):\r\n s = str_inp()\r\n for c in range(m):\r\n if(s[c]==\".\"):\r\n visited[a][b][c]=0\r\n else:\r\n visited[a][b][c]=-1\r\n input()\r\nx,y = sp_inp()\r\nx=x-1;y=y-1\r\nvisited[0][x][y]=1\r\nprev = 0\r\nwhile(sum(visited,k,n,m)!=prev):\r\n prev = sum(visited,k,n,m)\r\n for a in range(k):\r\n for b in range(n):\r\n for c in range(m):\r\n if(visited[a][b][c]==1):\r\n l = ind(visited,a,b,c,k,n,m)\r\n for i in l:\r\n visited[i[0]][i[1]][i[2]]=1\r\nprint(prev)", "k,n,m = map(int,input().split())\r\ninput()\r\ngrid = []\r\nfor _ in range(k):\r\n cgrid = []\r\n for i in range(n):\r\n row = input()\r\n cgrid.append(row)\r\n grid.append(cgrid)\r\n input()\r\nx,y = map(int,input().split())\r\n\r\nans = [0]\r\nvis = set()\r\ndef dfs(l,r,c):\r\n if l < 0 or l >= k or r < 0 or r >= n or c < 0 or c >=m or grid[l][r][c] == '#' or (l,r,c) in vis:\r\n return\r\n vis.add((l,r,c))\r\n ans[0] +=1\r\n \r\n dfs(l+1,r,c)\r\n dfs(l,r+1,c)\r\n dfs(l,r,c+1)\r\n dfs(l-1,r,c)\r\n dfs(l,r-1,c)\r\n dfs(l,r,c-1)\r\n\r\ndfs(0,x-1,y-1)\r\nprint(ans[0])\r\n", "import sys\nfrom collections import deque\n\nk, n, m = (int(i) for i in sys.stdin.readline().split())\nsys.stdin.readline()\n# edges = defaultdict(set)\ngraph = []\nfor l in range(k):\n layer = []\n for r in range(n):\n layer.append([i for i in sys.stdin.readline().split()[0]])\n graph.append(layer)\n sys.stdin.readline()\n\nx, y = (int(i) for i in sys.stdin.readline().split())\n\n# print(graph)\n \ndef is_valid(l, x, y):\n return 0 <= l < k and 0 <= x < n and 0 <= y < m\n\nans = 0\nstart = (0, x-1, y-1)\nq = deque()\nq.append(start)\nwhile len(q) > 0:\n l, x, y = q.pop()\n # print()\n if not is_valid(l, x, y) or graph[l][x][y] != '.':\n continue\n ans += 1\n graph[l][x][y] = 'X'\n for i in (-1, 1):\n q.append((l+i, x, y))\n q.append((l, x+i, y))\n q.append((l, x, y+i))\n \nprint(ans)\n \n", "a=[]\nb=list(map(int,input().split()))\ninput()\nfor i in range(b[0]):\n a.append([])\n for j in range(b[1]):\n a[i].append([])\n for z in input():\n a[i][j].append(z)\n input()\nx,y=map(int,input().split()); x-=1; y-=1\nans=[0]\ndef wv(k,x,y):\n if (k<0)or(k==b[0])or(x<0)or(x==b[1])or(y<0)or(y==b[2])or(a[k][x][y]=='#'):\n return\n ans[0]+=1\n a[k][x][y]='#'\n wv(k-1,x,y)\n wv(k+1,x,y)\n wv(k,x-1,y)\n wv(k,x+1,y)\n wv(k,x,y-1)\n wv(k,x,y+1)\nwv(0,x,y)\nprint(ans[0])\n\n\t\t \t \t \t\t\t \t\t \t \t \t\t \t", "z, n, m = list(map(int, input().split()))\r\n\r\nN = 12\r\nadj = [[['' for _ in range(N)] for _ in range(N)] for _ in range(N)]\r\nvisited = [[[False for _ in range(N)] for _ in range(N)] for _ in range(N)]\r\n\r\nfor i in range(1, z+1):\r\n input()\r\n for j in range(1, n+1):\r\n chars = input()\r\n for k in range(1, m+1):\r\n adj[i][j][k] = chars[k-1]\r\n\r\ninput()\r\nx, y = list(map(int, input().split()))\r\n\r\ndx = [ 1,-1,0,0,0,0 ]\r\ndy = [ 0,0,1,-1,0,0 ]\r\ndz = [ 0,0,0,0,1,-1 ]\r\n\r\ndef dfs(l, x, y):\r\n if adj[l][x][y] == '#':\r\n return\r\n \r\n visited[l][x][y] = True\r\n for i in range(6):\r\n a = x + dx[i]\r\n b = y + dy[i]\r\n c = l + dz[i]\r\n\r\n if a > 0 and b > 0 and c > 0 and c <= z and b <= m and a <= n and not visited[c][a][b]:\r\n dfs(c, a, b)\r\n\r\ndfs(1, x, y)\r\n\r\nans = 0\r\nfor i in range(1, z+1):\r\n for j in range(1, n+1):\r\n for k in range(1, m+1):\r\n if visited[i][j][k]:\r\n ans += 1\r\n\r\nprint(ans)", "k, n, m = map(int, input().split())\n\nparallelepiped = []\n\nfor x in range (0, k):\n input()\n layer = []\n for i in range (0, n):\n layer.append([char for char in input()])\n parallelepiped.append(layer)\n\ninput()\n\nx, y = map(int, input().split())\n\n# Note: node format is (k, n, m)\n\nvisit_map = []\n\nfor i in range(0, k):\n layer = []\n for j in range(0, n):\n row = []\n for p in range(0, m):\n row.append(0)\n layer.append(row)\n visit_map.append(layer)\n\nqueue = []\nqueue.append((0, x - 1, y - 1))\nfilled = 0\n\nwhile (len(queue) != 0):\n current = queue.pop(0)\n cur_k = current[0]\n cur_n = current[1]\n cur_m = current[2]\n\n if visit_map[cur_k][cur_n][cur_m] == 1:\n continue\n\n visit_map[cur_k][cur_n][cur_m] = 1\n filled += 1\n\n if cur_n > 0:\n if parallelepiped[cur_k][cur_n - 1][cur_m] == \".\":\n queue.append((cur_k, cur_n - 1, cur_m))\n if cur_n < n - 1:\n if parallelepiped[cur_k][cur_n + 1][cur_m] == \".\":\n queue.append((cur_k, cur_n + 1, cur_m))\n\n if cur_m > 0:\n if parallelepiped[cur_k][cur_n][cur_m - 1] == \".\":\n queue.append((cur_k, cur_n, cur_m - 1))\n if cur_m < m - 1:\n if parallelepiped[cur_k][cur_n][cur_m + 1] == \".\":\n queue.append((cur_k, cur_n, cur_m + 1))\n\n if cur_k > 0:\n if parallelepiped[cur_k - 1][cur_n][cur_m] == \".\":\n queue.append((cur_k - 1, cur_n, cur_m))\n if cur_k < k - 1:\n if parallelepiped[cur_k + 1][cur_n][cur_m] == \".\":\n queue.append((cur_k + 1, cur_n, cur_m))\n\nprint(filled)", "from sys import stdin\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nax=lambda g,gg:(max(0,g-1),min(gg-1,g+1))\r\nchk=lambda l,x,y:True if a[l][x][y]=='.' and v[l][x][y] else False\r\nk,n,m=R();S()\r\na=[[] for i in range(k)]\r\nv=[[[1]*m for i in range(n)] for i in range(k)]\r\nfor i in range(k):\r\n\tfor j in range(n):\r\n\t\ta[i]+=S(),\r\n\tS()\r\nr,c=R();ans=0\r\nstack=[(0,r-1,c-1)]\r\nv[0][r-1][c-1]=0\r\nwhile stack:\r\n\tans+=1\r\n\tl,x,y=stack.pop()\r\n\tl1,l2=ax(l,k)\r\n\tx1,x2=ax(x,n)\r\n\ty1,y2=ax(y,m)\r\n\tif chk(l1,x,y):stack.append((l1,x,y));v[l1][x][y]=0\r\n\tif chk(l2,x,y):stack.append((l2,x,y));v[l2][x][y]=0\r\n\tif chk(l,x1,y):stack.append((l,x1,y));v[l][x1][y]=0\r\n\tif chk(l,x2,y):stack.append((l,x2,y));v[l][x2][y]=0\r\n\tif chk(l,x,y1):stack.append((l,x,y1));v[l][x][y1]=0\r\n\tif chk(l,x,y2):stack.append((l,x,y2));v[l][x][y2]=0\r\nprint(ans)", "#!/usr/bin/env python3\r\n\r\nimport sys\r\nimport queue\r\nfrom pprint import pprint\r\n\r\nclass Block:\r\n k = '0'\r\n x = '0'\r\n y = '0'\r\n\r\n def __init__(self, k, x, y):\r\n self.k = k\r\n self.x = x\r\n self.y = y\r\n\r\ndimensions_line = sys.stdin.readline()\r\ntemp = dimensions_line.split()\r\ndimensions = list(map(int, temp))\r\nplate = [[[0 for y in range(0, dimensions[2])] for x in range(0, dimensions[1])] for k in range(0, dimensions[0])]\r\nstartx = 0\r\nstarty = 0\r\ncurr_layer = 0\r\nline_cnt = 0\r\n\r\nsys.stdin.readline()\r\nfor line in sys.stdin:\r\n if line == \"\\n\":\r\n curr_layer += 1\r\n line_cnt= 0\r\n elif curr_layer >= dimensions[0]:\r\n temp = line.split()\r\n curr_line = list(map(int, temp))\r\n startx = int(curr_line[0]) - 1\r\n starty = int(curr_line[1]) - 1\r\n break\r\n else:\r\n temp = line.strip()\r\n curr_line = list(temp)\r\n for i in range(0, dimensions[2]):\r\n c = curr_line[i]\r\n if c == '.':\r\n plate[curr_layer][line_cnt][i] = '.'\r\n else:\r\n plate[curr_layer][line_cnt][i] = '#'\r\n line_cnt += 1\r\n\r\nq = queue.Queue()\r\ntime = 0\r\nq.put(Block(0, startx, starty))\r\nwhile q.empty() != True:\r\n square = q.get()\r\n if square.k < 0 or square.k >= dimensions[0]:\r\n continue\r\n if square.x < 0 or square.x >= dimensions[1]:\r\n continue\r\n if square.y < 0 or square.y >= dimensions[2]:\r\n continue\r\n if plate[square.k][square.x][square.y] == '.':\r\n time += 1\r\n plate[square.k][square.x][square.y] = ':'\r\n q.put(Block(square.k - 1, square.x, square.y))\r\n q.put(Block(square.k, square.x - 1, square.y))\r\n q.put(Block(square.k, square.x, square.y - 1))\r\n q.put(Block(square.k + 1, square.x, square.y))\r\n q.put(Block(square.k, square.x + 1, square.y))\r\n q.put(Block(square.k, square.x, square.y + 1))\r\n else:\r\n continue\r\n\r\nprint(\"{}\".format(int(time)))\r\n", "k,n,m=map(int,input().split())\r\nres=[]\r\nfor _ in range(k):\r\n input()\r\n mat=[]\r\n for _ in range(n):\r\n temp=[el for el in input()]\r\n mat.append(temp[:])\r\n res.append((mat[:]))\r\ninput()\r\nx,y=map(int,input().split())\r\nx-=1\r\ny-=1\r\nseen=set()\r\ndef dfs(i,j,l):\r\n seen.add((i,j,l))\r\n for dx,dy,dz in [(1,0,0),(-1,0,0),(0,1,0),(0,-1,0),(0,0,1),(0,0,-1)]:\r\n nx,ny,nz=i+dx,j+dy,dz+l\r\n if 0<=nx<n and 0<=ny<m and 0<=nz<k and (nx,ny,nz) not in seen and res[nz][nx][ny]==\".\":\r\n dfs(nx,ny,nz)\r\ndfs(x,y,0)\r\nprint(len(seen))", "k, n, m = map(int, input().split())\nvisited = [[[False] * m for _ in range(n)] for _ in range(k)]\ngrid = []\ninput()\nfor i in range(k):\n grid.append([])\n for _ in range(n):\n grid[-1].append(input())\n input()\nr, c = map(lambda x: int(x) - 1, input().split())\ndirs = [(0, 0, 1), (0, 0, -1), (0, 1, 0), (0, -1, 0), (1, 0, 0), (-1, 0, 0)]\n\n\ndef valid(r, c, h):\n return 0 <= r < n and 0 <= c < m and 0 <= h < k\n\n\ndef floodfill(r, c, h):\n visited[h][r][c] = True\n for d in dirs:\n new_r = r + d[0]\n new_c = c + d[1]\n new_h = h + d[2]\n if valid(new_r, new_c, new_h) and grid[new_h][new_r][new_c] == '.':\n if not visited[new_h][new_r][new_c]:\n floodfill(new_r, new_c, new_h)\n\n\nfloodfill(r, c, 0)\nres = 0\nfor i in visited:\n for j in i:\n for k in j:\n res += k\nprint(res)\n" ]

[ "n, k = map(int, input().split())\r\np = input()\r\na = input()\r\nres = ['0'] * n\r\n \r\ndef m(tmp):\r\n return chr(ord('a') + k // 2) if tmp == 'a' else 'a'\r\n \r\nfor i in range(len(a)):\r\n if a[i] == '1':\r\n l = i\r\n for j in range(len(p)):\r\n res[l] = p[j]\r\n l += 1 \r\nfor i in range(len(a)):\r\n if a[i] == '1':\r\n l = i\r\n for j in range(len(p)):\r\n if res[l] != p[j]:\r\n print(\"No solution\")\r\n exit()\r\n l += 1 \r\nfor i in range(len(a)):\r\n if a[i] == '0':\r\n l = i\r\n ok = False\r\n cnt = 0\r\n for j in range(len(p)):\r\n if res[l] == '0':\r\n res[l] = m(p[j])\r\n ok = True\r\n break\r\n else:\r\n if res[l] != p[j]:\r\n ok = True\r\n break\r\n else:\r\n cnt += 1\r\n l += 1\r\n if not ok and cnt == len(p):\r\n print(\"No solution\")\r\n exit()\r\nx = 'b' if p[0] == 'a' else 'a'\r\nprint(''.join([x if c == '0' else c for c in res]))\r\n\r\n###from Jasnah bobb31\r\n###from Jasnah bobb31\r\n###from Jasnah bobb31\r\n###from Jasnah bobb31" ]

[ "n=210\r\nk=int(input())\r\nif (k<=2): print(-1)\r\nelse: print(n*((10**(k-1))//n+1))", "n=int(input())\r\nif(n<=2):\r\n print (-1)\r\nelse:\r\n print (((pow(10,n-1)//210)+1)*210)", "n=int(input())\r\n\r\nif n<3:\r\n print(-1)\r\nelse:\r\n k=int(pow(10,n-1))\r\n l=k+210-(k%210)\r\n print(l)\r\n", "n = int(input())\r\nif n<3: print(-1)\r\nelse:\r\n\tx=int('1'+'0'*(n-1))\r\n\tx=x+(210-x%210)\r\n\tprint(x)", "x = int(input())\r\nn = 2*3*5*7\r\nif x <= 2:\r\n print(-1)\r\nelse:\r\n x = 10**(x-1)\r\n if x % n == 0:\r\n print(x)\r\n else:\r\n print((x//n+1)*n)", "n = int(input())\r\nprint(-1 if n < 3 else 10 ** (n - 1) // 210 * 210 + 210)", "from sys import *\r\nfrom math import *\r\nn=int(stdin.readline())\r\nans = -1\r\nif n > 2:\r\n x=10**(n-1)\r\n ans = 210 * (x//210 + 1)\r\nprint(ans)", "n= int(input())\r\n\r\nif n<=2:\r\n print('-1')\r\nelif n==3:\r\n print('210')\r\nelse:\r\n z= pow(10, n-1)\r\n a= z//210\r\n b= z%210\r\n if(b==0):\r\n print(210*a)\r\n else:\r\n c= (a*210)+210\r\n print(c)\r\n\r\n", "n=int(input())\r\nprint([-1, (10**(n-1)//210 + 1) * 210 ][n>2])\r\n", "n = int(input())\r\nx = int('1' + '0' * (n - 1))\r\nif n < 3:\r\n\tprint(-1)\r\n\texit()\r\nwhile x % 210 != 0:\r\n\tx += 1\r\nprint(x)", "n=int(input())\r\nif n<3:\r\n print(-1)\r\nelse:\r\n k=1\r\n k=10**(n-1);\r\n l=(k//210+1)*210\r\n print(l)", "import math\ndef quickPow(a,b):\n res=1\n while b:\n if b&1:\n res=res*a\n a=a*a\n b>>=1\n return res\n\n\nn=int(input())\nif n == 1 or n==2:\n print(-1)\nelse:\n a = 210\n r =quickPow(10, n - 1)\n for i in range(r, r + 211):\n if (i % a == 0):\n print(i)\n break;\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \t \t\t \t\t\t\t\t\t\t \t \t\t \t \t\t\t", "n = int(input())\r\nrez = 0\r\nr = (10**(n-1))%210\r\nrez = (10**(n-1))+210-r\r\nif len(list(str(rez))) == n:\r\n print(rez)\r\nelse:\r\n print(-1)", "n = int(input())\r\n\r\nif n <3:\r\n\tprint(-1)\r\n\r\nelse:\r\n\tt = 10**(n-1)\r\n\tprint(t+(210-t%210))\r\n", "#Dasmesh Singh\r\nimport math\r\nn=int(input())\r\ns=0\r\nif n<3:\r\n print (-1)\r\nelif n==3:\r\n print (210)\r\nelse:\r\n s=10**(n-1)\r\n while 1:\r\n if s%2==0 and s%3==0 and s%5==0 and s%7==0:\r\n print (s)\r\n break\r\n else:\r\n s+=1", "from math import *\r\nn=int(input())\r\nif n<=2:\r\n print(-1)\r\nelse:\r\n x=10**(n-1)\r\n r=x%210\r\n print(x+(210-r))", "n=int(input())\r\n\r\nif n<3:\r\n print(-1)\r\n exit(0)\r\n\r\nn=10**(n-1) \r\n\r\ntemp=n//210\r\nif n%210:\r\n temp+=1 \r\n#print(temp)\r\nans=temp*210\r\n\r\nprint(ans)", "import random\nimport sys\nimport math\n\nn = int(input())\n\nif n < 3:\n print(-1)\nelse:\n ans = 10 ** (n - 1)\n while True:\n if ans % 3 == 0 and ans % 7 == 0:\n break\n else:\n ans = ans + 10\n print(ans)\n\t \t\t \t \t\t \t\t\t \t\t \t \t\t\t \t", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n return numberDivisibleBy210(int(input()))\r\n\r\n\r\ndef numberDivisibleBy210(length):\r\n if length < 3:\r\n return -1\r\n\r\n nToStart = int('1'+'0'*(length-1))\r\n return nToStart + -nToStart%210\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "n=int(input())\r\nif n<3:\r\n print(-1)\r\nelse:\r\n print(10**(n-1)+(210-(10**(n-1)%210))%210)\r\n# print(100080/7)", "n = int(input())\r\nif n == 1 or n == 2:\r\n print(-1)\r\nelse:\r\n x = int('1' + '0' * (n - 1))\r\n itog = -1\r\n x = (x // 70) * 70\r\n while True != 0:\r\n x += 70\r\n if x % 3 == 0:\r\n itog = x\r\n break\r\n print(itog)", "n=int(input())\r\nif n==1 or n==2:\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelse:\r\n a=(10**(n-1))\r\n if a%210==0:\r\n print(a)\r\n else:\r\n print(((a//210)+1)*210)\r\n \r\n", "n = int(input())\r\nif n==1:\r\n print(-1)\r\nelif n==2:\r\n print(-1)\r\nelse: \r\n m = 10**(n-1)\r\n print(210*(m//210+1))", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\n exit()\r\nk = 10 ** (n-1)\r\nres = k + 210 - (k % 210)\r\nprint(res)\r\n", "def mypow(a,b):\r\n\tbase=a \r\n\tres=1\r\n\twhile b:\r\n\t\tif b&1:\r\n\t\t\tres*=base\r\n\t\tbase*=base\r\n\t\tb>>=1\r\n\treturn res\r\ndef sol(n):\r\n\tsum=mypow(10,n-1)\r\n\tfor i in range(sum,sum + 210+1,1):\r\n\t\tif i%210==0:\r\n\t\t\treturn i\r\nn=int(input())\r\nif n<3:\r\n\tprint(-1)\r\nelse:\r\n\tprint(sol(n))\r\n", "a = int(input())\nif a <= 2 :\n\tprint(-1)\nelse :\n\tb = 10 ** (a - 1)\n\tprint(b + (210 - b % 210))", "n= int(input())\r\nif(n<3):\r\n print(-1)\r\nelse:\r\n if(n==3):\r\n print(210)\r\n else:\r\n remain = (10**(n-1))%210\r\n num = 10**(n-1) + 210 - remain\r\n print(num)\r\n ", "n = int(input()) - 1\r\nk = 10 ** n\r\nm = 210 - k % 210\r\nprint(k + m if m < 9 * k else -1)", "'''m, n = map(int, input().split())\na,b=map(int,input().split())'''\t\ndef mypow(a,b):\n\tbase=a \n\tres=1\n\twhile b:\n\t\tif b&1:\n\t\t\tres*=base\n\t\tbase*=base\n\t\tb>>=1\n\treturn res\n\t\t\ndef sol(n):\n\tsum=mypow(10,n-1)\n\tfor i in range(sum,sum + 210+1,1):\n\t\tif i%210==0:\n\t\t\treturn i\n\nn=int(input())\nif n<3:\n\tprint(-1)\nelse:\n\tprint(sol(n))\n\tprint\n\n \t\t \t \t\t \t \t \t\t\t\t \t\t\t\t", "n = int(input())\r\nstart = 10**(n-1)\r\nend = 210* 10**(n-3)\r\n\r\n\r\n\r\nif n<3:\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelse:\r\n\r\n for i in range(start,end+1):\r\n if i%210==0:\r\n print(i)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\n\nrem = [-1 for i in range(n+1)]\n\ndef calculate(n):\n\tif(n<=2):\n\t\treturn 10**n\n\tif(rem[n]!=-1):\n\t\treturn rem[n]\n\t\n\tp = calculate(n//2)\n\trem[n//2] = p\n\tif(n%2):\n\t\treturn (p*p*10)%210\n\telse:\n\t\treturn (p*p)%210\n\t\n\nif(n<=2):\n\tprint(\"-1\")\nelif(n>=4):\n\tm = \"1\"\n\tfor i in range(n-1):\n\t\tm+=\"0\"\n\tr = calculate(n-1)\n\t# print(rem)\n\t# print(r)\n\tif(r!=0):\n\t\tp = str(210-r)\n\t\tans = m[:len(m)-len(p)]+p\n\telse:\n\t\tans = m\n\tprint(ans)\nelse:\n\tprint(\"210\")", "n = int(input())\nif n <= 2:\n print(-1)\nelse:\n print((10 ** (n - 1) + 209) // 210 * 210)\n\t\t\t\t \t\t\t \t \t \t\t\t\t \t \t\t\t \t", "N=int(input())\r\nif N>=3:\r\n\tprint(210 - (10**(N-1))%210 + 10**(N-1))\r\nelse:\r\n\tprint(\"-1\")", "n = int(input())\nans = -1\nif n > 2:\n ans = 210 * (pow(10, n-1) // 210 + 1)\nprint(ans)", "n = int(input())\r\nif n < 3:print(-1);exit(0)\r\nif n == 3:print(210);exit(0)\r\nans = 50\r\nfor _ in range(n-4):\r\n\tans = (ans * 10) % 210\r\ns = str(ans)\t\r\nprint('1'+'0'*(n - len(s) - 1)+s)", "def cat(n):\r\n if n < 3:\r\n return -1\r\n return 210 * (10 ** (n - 1) // 210 + 1)\r\n\r\n\r\nprint(cat(int(input())))\r\n", "n=int(input())\r\nif n<3:print(-1)\r\nelse:\r\n\tr=(10**(n-1))%210\r\n\tprint(10**(n-1)+210-r)", "n = int(input()) \r\nq = int(str('1') + '0' * (n-1)) \r\nif n < 3: print(-1)\r\nelif q//210 * 210 < q :\r\n print((q//210+1)*210)\r\nelse : print(q//210 * 210)", "n=int(input())\r\nrem,po=0,0\r\npo=pow(10,n-1)\r\nrem=po%210\r\nans=str(po-rem+210)\r\nif n<3:\r\n print(\"-1\")\r\nelse:\r\n print(ans)", "n=int(input())\nnum=10**(n-1)\nif n<3:\n print(-1)\n exit(0)\nelif n==3:\n print(210)\n exit(0)\nwhile num%210:\n num+=10\nprint(num)\n\t \t\t \t \t \t\t\t\t\t\t \t \t\t \t", "n = int(input())\r\nif n < 3:\r\n print(-1); exit()\r\nelse:\r\n x = n%6\r\n if x == 0: res = 10**5 + 20\r\n elif x == 1: res = 10**6 + 20\r\n elif x == 2: res = 10**7 + 20\r\n else: res = 10**(x-1) + 20\r\ntmp = 0\r\nwhile(res%7):\r\n res += 30\r\n tmp += 30\r\nif n <= 8: print(res)\r\nelse: res = str(20+tmp);print('1'+'0'*(n-1-len(res))+res)\r\n", "def pot(b,n):\r\n res = 1\r\n while(n):\r\n if(n&1):\r\n res = res*b\r\n b*=b\r\n n = n//2\r\n \r\n return res\r\n \r\n \r\nn = int(input())\r\nif (n < 3):\r\n print(-1)\r\nelse:\r\n num = pot(10,n - 1)\r\n ans = -1\r\n for i in range(210):\r\n if( (num + i)%210 == 0):\r\n ans = i\r\n break\r\n if(ans == -1):\r\n print(-1)\r\n else:\r\n print(num + ans)", "n=int(input())\r\n\r\nif n<=2:\r\n\tprint('-1')\r\nelse:\r\n\tn=10**(n-1)\r\n\tx=210-(n%210)\r\n\tn+=x\r\n\tprint(n)", "def ceil(a, b):\r\n return a // b + (a % b != 0)\r\n\r\n\r\nn = int(input())\r\nif n < 3:\r\n print(-1)\r\nelse:\r\n r = int(\"1\" + \"0\" * (n - 1))\r\n r = ceil(r, 210) * 210\r\n print(r)", "n = int(input())\r\nif n <= 2:\r\n print(-1)\r\nelif n == 3:\r\n print(210)\r\nelse:\r\n k = 10 ** (n - 1)\r\n while(True):\r\n if k % 210 == 0:\r\n print(k)\r\n break\r\n k += 1", "\r\nx=int(input())\r\nif x in [1,2]:\r\n print(-1)\r\nelif x==3:\r\n print(210)\r\nelse:\r\n print('1'+'0'*(x-4+3-len(str(210-pow(10,x-1,210))))+str(210-pow(10,x-1,210)))\r\n", "n = int (input ())\r\nif n <3:\r\n print (\"-1\")\r\nelse:\r\n num = 10 ** (n-1)\r\n while (num%210):\r\n num = num + 1\r\n print(num)", "div = 210\r\nn = int(input())\r\nif n < 3:\r\n print(\"-1\")\r\n exit()\r\nif n == 3:\r\n print(\"210\")\r\n exit()\r\nmn = str(div - pow(10, n - 1, div))\r\nprint(\"1\" + \"0\" * (n - 1 - len(mn)) + mn)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n in [1, 2]:\r\n print(-1)\r\n exit(0)\r\nelif n == 3:\r\n print(210)\r\n exit(0)\r\n\r\nif n % 6 == 0:\r\n print('1'+'0'*(n-4) + '170')\r\nelif n % 6 == 1:\r\n print('1' + '0' * (n - 3) + '20')\r\nelif n % 6 == 2:\r\n print('1' + '0' * (n - 4) + '200')\r\nelif n % 6 == 3:\r\n print('1' + '0' * (n - 4) + '110')\r\nelif n % 6 == 4:\r\n print('1' + '0' * (n - 3) + '50')\r\nelif n % 6 == 5:\r\n print('1' + '0' * (n - 3) + '80')\r\n", "n = int(input())\r\n\r\nif n==1 or n==2:\r\n print(-1)\r\nelif n==3:\r\n print(210) #210 is the min number which is divided by 2,3,5,7\r\nelse:\r\n x = (10**(n-1))\r\n while(x%210!=0):\r\n x = x+1\r\n print(x)", "a=int(input())\nprint(-1 if a<3 else 210*(10**(a-1)//210+1))\n \t \t\t \t \t \t \t \t \t\t \t", "n=int(input())\r\nif n<3:\r\n\tprint(-1)\r\nelif n==3:\r\n\tprint(210)\r\nelse:\r\n\ta=['050','080','170','020','200','110']\r\n\tz=(n-3)%6-1\r\n\tans=\"1\"+\"0\"*(n-4)+a[z]\r\n\tprint(ans)", "n=int(input())\nif(n==1 or n==2):\n\tprint(-1)\nelse:\n\ti=1\n\tn=int(pow(10,n-1))\n\tn=n//210\n\tprint(210*(n+1))", "# LUOGU_RID: 119025489\nn = int(input())\r\nif n == 1 or n == 2:\r\n print(-1)\r\nelse:\r\n base = 10**(n-1)\r\n while True:\r\n if base % 210 == 0:\r\n print(base)\r\n break\r\n base += 1", "import math\r\n\r\nn = int(input())\r\nif n<3:\r\n\tprint(-1)\r\nelif n==3:\r\n\tprint(210)\r\nelse:\r\n\tprint(str((pow(10,n-1)+210)-((pow(10,n-1)+210)%210)))\r\n", "import math\n\ndef main():\n\tn = int(input())\n\tif n == 1 or n == 2:\n\t\tprint(-1)\n\t\treturn 0\n\tif n == 3:\n\t\tprint(210)\n\t\treturn 0\n\t\t\n\trem = pow(10, n-1) % 210\n\tres = pow(10, n-1) + 210 - rem\n\tprint(res) \n\n\nif __name__ == \"__main__\":\n\tmain()\n \t\t\t \t\t\t \t \t\t\t \t\t\t \t \t \t\t\t", "d = int(input())\r\n \r\nif d==1 or d==2:\r\n print(-1)\r\nelse:\r\n lim = 10 ** (d-1)\r\n k = lim // 210\r\n if 210*k<=lim:\r\n k+=1\r\n \r\n print(210*k)", "n = int(input()) \nif n < 3:\n print(-1)\nelse:\n num = 10**(n-1)\n while num % 210 != 0:\n num += 10\n print(num)\n\t \t\t \t \t\t \t\t \t \t\t\t \t \t\t", "def quickPow(a,b):\r\n res=1\r\n while b:\r\n if b&1:\r\n res=res*a\r\n a=a*a\r\n b>>=1\r\n return res\r\n \r\nn=int(input())\r\nif n==1 or n==2:\r\n print(-1)\r\nelse:\r\n n=quickPow(10,n-1)\r\n while 1:\r\n if(n%210==0):\r\n print(n)\r\n break\r\n n+=1\r\n", "n = input()\nif int(n) < 3:\n print(-1)\nelse:\n n = 10**(int(n)-1)\n ans = n//210\n ans = int(ans) + 1\n ans *= 210\n print(ans)\n\t\t \t\t\t \t \t \t \t \t\t\t \t \t", "#https://codeforces.com/contest/248/problem/B\r\n\r\nimport sys\r\nimport math\r\n\r\ndef main():\r\n #sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n #sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n #sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n \r\n n = int(sys.stdin.readline().strip())\r\n\r\n if n <= 2:\r\n print(-1)\r\n else:\r\n print(210 * (pow(10, n - 1) // 210 + 1))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n#hajj", "v= int(input())\r\nrem,ans=0,0\r\nans=pow(10,v-1)\r\nrem=ans%210\r\nans1=str(ans-rem+210)\r\nif v<=2:\r\n print(\"-1\")\r\nelse:\r\n print(ans1)", "#tập tành code python\r\nx=int(input())\r\n \r\nfor i in range(10**(x-1),10**(x)) :\r\n if i%210==0 :\r\n print(i)\r\n exit(0)\r\nprint(-1)", "k=int(input())\r\nif (k<=2):\r\n print(-1)\r\nelif (k==3):\r\n print(210)\r\nelse:\r\n\r\n ch=\"1\"\r\n for i in range(k-4):\r\n ch=ch+\"0\"\r\n \r\n if (((k-4)%6)==0):\r\n ch=ch+\"050\"\r\n \r\n if (((k-4)%6)==1):\r\n ch=ch+\"080\"\r\n \r\n if (((k-4)%6)==2):\r\n ch=ch+\"170\"\r\n \r\n if (((k-4)%6)==3):\r\n ch=ch+\"020\"\r\n \r\n if (((k-4)%6)==4):\r\n ch=ch+\"200\"\r\n \r\n if (((k-4)%6)==5):\r\n ch=ch+\"110\" \r\n print(ch)", "n=int(input())\r\nrem=10**(n-1)%210\r\nvar=210-rem\r\nif n<3: #248B\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelse:\r\n print(10**(n-1)+var)\r\n\r\n", "n = int(input())\nif n < 3:\n print(-1)\nelse:\n t = 10**(n-1)\n print(t+(210-t%210))\n", "n = int(input())\r\nx = 10**(n-1)\r\nif n in [1,2]:\r\n print(-1)\r\nelse:\r\n for i in range(210):\r\n if (x + i) % 210 == 0:\r\n print(x + i)\r\n break", "n=int(input())-1\r\nif n>1:\r\n print(10**n+([1,1]+[110,50,80,170,20,200]*16667)[n])\r\nelse:\r\n print(-1)", "import math\r\nn = int(input())\r\nost = [190,10,100,160,130,40]\r\nif n<3:\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelse:\r\n s = \"1\"+\"0\"*(n-4)\r\n k = ((n%6)-1)\r\n q = str(210-ost[k])\r\n while len(q)<3:\r\n q = \"0\"+q\r\n print(s+q)", "n=int(input())\r\nif (n < 3):\r\n print(-1)\r\nelif n == 3:\r\n print(210)\r\nelse: print((10**(n-1))+(210-((10**(n-1)) % 210)))", "n = int(input())\nif n <= 2:\n print(\"-1\")\nelse:\n x = pow(10, n - 1)\n while x % 2 != 0 or x % 5 != 0 or x % 3 != 0 or x % 7 != 0:\n x += 1\n\n print(x)\n \t \t\t \t\t\t \t \t\t \t \t \t \t", "n = int(input())\r\nif (n <= 2):\r\n print(-1)\r\nelse:\r\n a = 10 ** (n - 1)\r\n res = (a // 210 + 1) * 210\r\n print(res)", "n = int(input())\n\nstart = pow(10, n-1)\nend = pow(10, n)\nans = -1\nfor i in range(start, end):\n if i % 2 == 0 and i % 3 == 0 and i % 5 == 0 and i % 7 == 0:\n ans = i\n break\nprint(ans)", "n=int(input())\r\nif n<3:\r\n print(-1)\r\n exit()\r\nd=10**(n-1)\r\na=d%210\r\nd+=(210-a)\r\nprint(d)", "n = int(input()); k = -1\r\nif n >= 3:\r\n k = 210*(10**(n-1)//210 + 1)\r\nprint (k)", "n = int(input())\n\nif n < 3:\n print(\"-1\")\nelse:\n num = 210 * (10**(n-1) // 210 + 1)\n print(num)\n \t \t\t \t\t \t \t\t \t\t\t\t \t\t\t\t", "n = int(input())\r\nif n <3: print(-1)\r\nelse:\r\n print((((10**(n-1))//210) + 1)*210)\r\n\r\n", "n=int(input())\r\nif n<3:print(-1)\r\nelse:\r\n a=210\r\n x=int('1'+'0'*(n-1))\r\n div,mod=x//a,x%a\r\n if mod>0:div+=1\r\n print(div*210)", "'''input\n3\n'''\nn = int(input())\nif n < 3:\n\tprint(-1)\nelse:\n\tprint(((10**(n-1))//210+1)*210)", "a=int(input())\r\nif a==1 or a==2:\r\n print('-1')\r\nelse:\r\n print(10**(a-1)+(210-(10**(a-1))%210))", "import math\ndef check(i):\n return ((i % 2 == 0) and (i % 3 == 0) and (i % 5 == 0) and (i % 7 == 0))\n\n\n\nn = int(input())\ntemp = 10 ** (n - 1)\nm = 10 ** n\nwhile check(temp) == 0 :\n temp += 1\nif temp > m:\n print(-1)\nelse:\n print(temp)\n \t \t \t \t\t\t\t\t\t \t \t \t\t \t \t \t", "n = int(input())\r\nnum = 2*3*5*7\r\nif n < 3 :\r\n print(-1)\r\nelse :\r\n print(10**(n-1)+(num - (10**(n-1)%num)))", "a = int(input())\r\nif a<3:\r\n print(\"-1\")\r\nelif a==3:\r\n print(\"210\")\r\nelse:\r\n b = 10**(a-1)%210\r\n c = (210-b)+10**(a-1)\r\n print(c)\r\n", "n=int(input())\r\nif n<=2:\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelse:\r\n extra=10**(n-1)\r\n \r\n extra%=210\r\n \r\n ans=10**(n-1) +210-extra\r\n print(ans) ", "n=int(input())\r\nif(n==1 or n==2):\r\n print(-1)\r\nelse: \r\n p=10**(n-1)\r\n m=p%210;\r\n p=p-m\r\n p=p+210\r\n print(p)\r\n\r\n", "import sys\n\nfor line in sys.stdin:\n n = int(line.strip())\n begin = 10 ** (n-1)\n end = 10 ** n\n cont = -1\n for i in range(begin, end):\n if(not i % 210):\n cont = i\n break\n\n print(cont)\n", "n = int(input())\r\nprint(-1 if n < 3 else 210 * (10**(n-1) // 210 + 1))", "n = int(input()) - 1\r\nif n < 2: print(-1)\r\nelif n == 2: print(210)\r\nelse:\r\n k = str(210 - 10 * pow(10, n - 1, 21))\r\n print('1' + '0' * (n - len(k)) + k)", "n=int(input())\r\n\r\nif(n<=2):\r\n print('-1')\r\nelif(n==3):\r\n print(210)\r\nelse:\r\n rem=(10**(n-1))%210\r\n ans=10**(n-1)+210-rem\r\n print(ans)\r\n", "x = int(input())\r\n\r\ny = 2*3*5*7\r\nz = 10**(x-1)\r\na = z%y\r\n\r\nif x == 1 or x == 2:\r\n print(-1)\r\nelse:\r\n print(z+y-a)", "##__________________________________________________________________\r\n##\r\n## Author: GogolGrind\r\n##__________________________________________________________________\r\n\r\nfrom sys import *\r\nfrom math import *\r\n\r\ndef mod (a,m):\r\n x = 0\r\n for i in reversed(a): \r\n x = (x*10 + int(i)) % m\r\n r = []\r\n t = m - x\r\n while t > 0:\r\n r.append(t % 10)\r\n t //= 10\r\n return r\r\n \r\ndef main ():\r\n n = int(input())\r\n k = 2 * 3 * 5 * 7\r\n if (n < 3):\r\n print(-1)\r\n return 0\r\n elif (n == 3 ):\r\n print(k)\r\n else:\r\n t = [ 1 if i == 0 else 0 for i in range(n)]\r\n t = t[::-1]\r\n r = mod(t,k) \r\n c = 0\r\n for i in range(len(r)):\r\n t[i] = r[i]\r\n for i in reversed(t):\r\n print(i, end = '')\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nif n==1 or n==2:\r\n print(-1)\r\nelse:\r\n a=10**(n-1)\r\n if a%210==0:\r\n print(a*210)\r\n else:\r\n a=a//210 + 1\r\n \r\n a=a*210\r\n print(a)\r\n", "n=int(input())\r\nif n>=4:\r\n temp=10**(n-1)\r\n print(temp+(210-temp%210))\r\nelif n==1 or n==2:\r\n print(-1)\r\nelse:\r\n print(210)", "n = int(input())\nmod = 210\np = 10**(n-1)\n\nans = p + ((210 - (p % 210)) % 210)\nif ans < 10*p:\n print(ans)\nelse:\n print(-1)\n\t\t \t \t\t\t\t\t \t\t \t \t\t \t\t \t\t\t", "a = int(input())\nlowbound = 10 ** (a-1)\nupbound = 10 ** a\ndiff = upbound-lowbound\n\nfor i in range(diff):\n n = lowbound + i\n if (n%210==0 and n!=1):\n print(n)\n break\n elif (n == upbound-1 or n==1):\n print(-1)\n break\n", "n = int (input())\r\n\r\nif (n < 3):\r\n\tprint (\"-1\")\r\nelse:\r\n\tx = 10**(n-1)\r\n\tx -= x%210 - 210\r\n\tprint (x)", "n=int(input())\r\nif n<3:\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelif n==4:\r\n print(1050)\r\nelse:\r\n fl=0\r\n hs=[3,2,6,4,5,1]\r\n ans=[]\r\n for i in range(10):\r\n for j in range(10):\r\n if (i+j+1)%3==0:\r\n g=0\r\n if (n-4)%6==0:\r\n g=6\r\n else:\r\n g=(n-4)%6\r\n if (1000*(hs[g - 1]) + 100*i + 10*j)%7==0:\r\n fl=1\r\n ans=[i,j]\r\n break\r\n if fl==1:\r\n break\r\n li=['1']\r\n li+=['0']*(n-4)\r\n print(\"\".join(li),end='')\r\n print(ans[0],ans[1],'0',sep='')\r\n", "a=int(input())\r\nx=10**(a-1)%210\r\nprint(10**(a-1)+(210-x) if a>2 else -1)", "a = int(input())\r\n\r\nif a < 3:\r\n print(\"-1\")\r\nelse:\r\n print(210*((10**(a-1))//210 + 1))", "n=int(input())\r\nif n<=2:\r\n print(-1)\r\nelse:\r\n k=10**(n-1)\r\n for i in range(210):\r\n k+=1\r\n if k%210==0:\r\n print(k)\r\n break\r\n ", "NumLength = int(input())\r\ntens = 100\r\n\r\nif NumLength <= 2:\r\n print(\"-1\")\r\nelif NumLength == 3:\r\n print(\"210\")\r\nelse:\r\n tens = tens * pow(10, (NumLength - 3))\r\n tens = tens + 210 - (tens % 210)\r\n print(tens)", "a=1\nc=210\nb=1\ne=int(input())\nwhile b!=e:\n a*=10\n b+=1\n\nd=a//c\nif e<=2:\n print(-1)\nelif d*c==a:\n print(a)\nelif d*c!=a:\n print(d*c+c)\n\t \t \t \t\t \t \t \t\t \t \t", "n = int(input())\r\nif n<=2:\r\n print(-1)\r\nelse:\r\n no=10**(n-1)\r\n while no%210!=0:\r\n no+=1\r\n print(no) \r\n\r\n\r\n\r\n", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\nelif n == 3:\r\n print(210)\r\nelse:\r\n k = 210 - (10**(n-1)%210)\r\n print(10**(n-1)+k)\r\n ", "n=int(input())\nif n<=2:\n\tprint(-1)\nelse:\n\ts=10**(n-1)\n\tprint(s+210-s%210)", "def expo(N, POWER, MOD):\r\n if POWER == 0: return 1\r\n elif POWER & 1: return (N * expo(N, POWER-1, MOD)) % MOD\r\n else: return (expo(N*N, POWER//2, MOD)) % MOD\r\n \r\nn = int(input())\r\nif n <= 2:\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelse:\r\n pow = expo(10, n-1, 210)\r\n print('1' + '0'*(n-1-len(str(210-pow))) + str(210-pow))", "n = int(input())\nif n < 3:\n print(-1)\nelse:\n number = 10**(n-1)\n i = 0 \n while number % 210 != 0:\n number += 10\n print(number)\n\n \t \t \t\t\t \t\t\t\t\t\t \t\t\t\t", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\nelse:\r\n n -= 1\r\n i = 10**n\r\n while True:\r\n if i%210 == 0:\r\n print(i)\r\n break\r\n i += 1", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\nelse:\r\n print((10 ** (n - 1) + 2 * 3 * 5 * 7 - 1) // (2 * 3 * 5 * 7) * (2 * 3 * 5 * 7))", "n = int(input())\r\n\r\nif n<3:\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelse:\r\n t = 10**(n-1)\r\n print(t-t%210+210)", "n = int(input())\r\n\r\nif n < 3:\r\n print(-1)\r\n exit()\r\n\r\nb = 2*3*5*7\r\n\r\noverlap = (10**(n-1)) % 210\r\n\r\nprint(10**(n-1) + (b-overlap))\r\n\r\n", "i = input().strip()\r\ni = int(i)\r\n\r\nn = pow(10,i-1)\r\nrem = n%210\r\nans = n-rem+210\r\nif (ans>n-1) and (ans<pow(10,i)):\r\n print(ans) ;\r\nelse:\r\n print(-1);\r\n\r\n", "n = int(input())\nif n == 1 or n == 2:\n print(-1)\nelse:\n i = 10 ** (n - 1)\n i += 20\n while True:\n if i % 7 == 0:\n print(i)\n break\n else:\n i += 30", "def fastExpMod(b, e):\n result = 1\n while e != 0:\n if (e&1) == 1:\n result = (result * b)\n e >>= 1\n b = (b*b)\n return result\ndef main():\n n=int(input())\n if n<3:\n print(-1)\n else:\n x=fastExpMod(10,n-1)\n #print(x)\n while x%210 :\n x=x+1\n print(x) \n \nif __name__ == '__main__':\n main()\n\t \t \t \t\t\t\t\t\t \t \t \t \t \t\t", "#!/bin/python\r\nn = int(input())\r\n\r\nconst = 2 * 3 * 5 * 7\r\n\r\nif n < 3:\r\n\tprint(-1)\r\nelse:\r\n\tprint(((10 ** (n - 1)) // const + 1) * const)", "n=int(input())\r\nif n==1 or n==2:\r\n print(-1)\r\nelif n==3:\r\n print(210)\r\nelse:\r\n req=int('1'+'0'*(n-1))\r\n print((req//210+1)*210)", "n = int(input())\r\nw = 2 * 3 * 5 * 7\r\n\r\nk = 10 ** (n -1)\r\nif n <= 2:\r\n print(-1)\r\nelse:\r\n if k % w == 0:\r\n print(k)\r\n else:\r\n k += (-k) % w\r\n print(k)", "a = int(input())\r\nc = True\r\nif a < 3:\r\n print(-1)\r\nelif a == 3:\r\n print(210)\r\nelse:\r\n e = pow(10,a-1)\r\n while c:\r\n if e % 210 == 0:\r\n print(e)\r\n c = False\r\n break\r\n else:\r\n e+=10", "n=int(input())\r\nprint(-1 if n<3 else 210*(10**(n-1)//210+1))", "n=input()\r\nn=int(n)\r\nx=-1\r\nif n>2:\r\n\ta=1\r\n\tfor i in range(10**(n-1),10**n): \r\n\t\tif(i%210==0):\r\n\t\t\tprint(i)\r\n\t\t\tx=1\r\n\t\t\tbreak\r\nelse: print(\"-1\")", "def quickpow(a, b):\n res = 1\n while (b):\n if b & 1:\n res = res * a\n a = a * a\n b >>= 1\n return res\nn = int(input())\nif (n < 3):\n print(-1)\nelse:\n n = quickpow(10, n - 1)\n while 1:\n if (n % 210 == 0):\n print(n)\n break\n n += 1\n\n\n \t\t\t\t \t\t\t \t \t\t \t \t\t \t \t \t\t\t", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\nelif n == 3:\r\n print(210)\r\nelse:\r\n r = 10**(n - 1) % 210\r\n print(10**(n - 1) + (210 - r))", "n=int(input())\r\nif n<=2:\r\n print(-1)\r\nelse:\r\n s=pow(10,n-1)\r\n while 1:\r\n if s%210==0:\r\n print(s)\r\n break\r\n else:\r\n s+=10", "n = int(input())\r\nif n < 3:\r\n print(-1)\r\nelif n == 3:\r\n print(210)\r\nelse:\r\n suff = \"\"\r\n if n % 6 == 4:\r\n suff = \"50\"\r\n elif n % 6 == 5:\r\n suff = \"80\"\r\n elif n % 6 == 0:\r\n suff = \"170\"\r\n elif n % 6 == 1:\r\n suff = \"20\"\r\n elif n % 6 == 2:\r\n suff = \"200\"\r\n elif n % 6 == 3:\r\n suff = \"110\"\r\n main = n - 1 - len(suff)\r\n print(\"1\" + \"0\" * main + suff)", "import math\r\nn = int(input())\r\nk = pow(10,n-1)\r\nm = k%(210)\r\nj = k// 210\r\nif n<3:\r\n print(-1)\r\nelse:\r\n if m==0:\r\n print(k)\r\n else:\r\n print((j+1)*210)", "n = int(input())\r\nif n<=2:\r\n\tprint(-1)\r\nelif n==3:\r\n\tprint(210)\r\nelse:\r\n\tr = pow(10, n-1)%210\r\n\tprint(pow(10,n-1) + 210-r)\r\n", "# a simple parser for python. use get_number() and get_word() to read\r\ndef parser():\r\n while 1:\r\n data = list(input().split(' '))\r\n for number in data:\r\n if len(number) > 0:\r\n yield(number) \r\n\r\ninput_parser = parser()\r\n\r\ndef get_word():\r\n global input_parser\r\n return next(input_parser)\r\n\r\ndef get_number():\r\n data = get_word()\r\n try:\r\n return int(data)\r\n except ValueError:\r\n return float(data)\r\n\r\na = get_number()\r\nif a < 3: print(-1)\r\nelse:\r\n ans = 10**(a - 1)\r\n print(ans + 210 - (ans % 210))", "n = int(input())\r\nz = 10**(n-1)\r\nif n<3:\r\n print(-1)\r\nelse:\r\n print(z+(210-z%210))\r\n \r\n \r\n", "import math\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tif n == 1 or n == 2:\r\n\t\tprint(-1)\r\n\t\treturn 0\r\n\tif n == 3:\r\n\t\tprint(210)\r\n\t\treturn 0\r\n\t\t\r\n\trem = pow(10, n-1) % 210\r\n\tres = pow(10, n-1) + 210 - rem\r\n\tprint(res) \r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n=int(input())\r\nif n<3:\r\n print (-1)\r\nelse:\r\n print (10**(n-1) + 210 - (10**(n-1))%210)\r\n", "import sys\r\nn = int(input())\r\nif(n < 3):\r\n print(-1)\r\n sys.exit(0)\r\nfor i in range(10**(n-1), 10**(n)):\r\n if(i % 3 == i % 2 == i % 5 == i % 7 == 0):\r\n print(i)\r\n sys.exit(0)", "n = eval(input())\r\nx = 10 ** (n - 1)\r\nk = x // 210\r\nif x % 210 != 0:\r\n k += 1\r\nk *= 210\r\nif k >= x and k < x * 10:\r\n print(k)\r\nelse:\r\n print(-1)", "a=int(input())\ni=1\nb=100\nif a<=2:\n print(-1)\nelse:\n while i<=a-3:\n b=b*10\n i=i+1\n b=b//210\n b=b*210+210\n print(b)\n\n\n\n \t\t \t\t\t \t \t \t \t \t \t\t", "n = int(input())\n\nif(n<=2):\n\tprint(\"-1\")\nelse:\n\tn = 10**(n-1);\n\tn = (n//210)+1\n\tprint((n*210))\n", "import math\r\nn=int(input())\r\nif n<3:\r\n print(-1)\r\nif n==3:\r\n print(210)\r\nif n>3:\r\n a=10**(n-1)\r\n for i in range(1, 10**9):\r\n if a%210==0:\r\n print(a)\r\n break\r\n a+=1\r\n\r\n#21,00,00,00,00,00,000", "n=int(input())\r\na=2*3*5*7\r\n\r\nif n<=2:\r\n print(-1)\r\nelse:\r\n r=10**(n-1)%a\r\n t=210-r+10**(n-1)\r\n print(t)\r\n", "#code :: https://codeforces.com/contest/248/submission/88820149\r\n\r\n\r\n\r\n\r\nn=int(input());\r\n\r\nif(n<3):\r\n print(-1);\r\nelif(n==3):\r\n print(210);\r\nelse :\r\n ans=((pow(10,n-1)//210+1)*210);\r\n print(ans);" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx = int(input())\r\nn, u, v = 1, 0, 0\r\nz = []\r\nwhile True:\r\n a, b = u - n * n, -n * u + v - x\r\n if a * n < b:\r\n break\r\n if not b % a:\r\n m = b // a\r\n z.append((n, m))\r\n u += n\r\n v += n * n\r\n n += 1\r\nans = []\r\nfor a, b in z:\r\n ans.append(\" \".join(map(str, (a, b))))\r\nfor a, b in z[::-1]:\r\n if a ^ b:\r\n ans.append(\" \".join(map(str, (b, a))))\r\nk = len(ans)\r\nprint(k)\r\nsys.stdout.write(\"\\n\".join(ans))", "x = int(input())\r\n\r\nans = []\r\n\r\ndef calc(n, m):\r\n return n * n * m - (n + m) * (n - 1) * n // 2 + n * (n - 1) * (2 * n - 1) // 6\r\n\r\n\r\nfor n in range(1, 2000000):\r\n m = (x + n * n * (n - 1) // 2 - n * (n - 1) * (2 * n - 1) // 6) // (n * n - n * (n - 1) // 2)\r\n if n <= m and calc(n, m) == x:\r\n ans.append((n, m))\r\n if n != m:\r\n ans.append((m, n))\r\nans.sort()\r\nprint(len(ans))\r\nfor el in ans:\r\n print(el[0], el[1])\r\n\r\n", "n,i,t,r=int(input()),0,0,[]\r\nwhile n>=0:i+=1;n-=i*i;t+=i;m=n//t+i;r+=[(m,i),(i,m)][m==i:]*(n%t==0<=n)\r\nfor p in[(len(r),'')]+sorted(r):print(\"%d %s\"%p)", "x = int(input())\r\ni = 1\r\nnmList = []\r\nwhile True:\r\n if i * (i + 1) * (2 * i + 1) > 6 * x:\r\n break\r\n if (6 * x) % (i * (i+1)) == 0 and ((6 * x) // (i * (i+1)) - (2 * i + 1)) % 3 == 0:\r\n nmList.append((i,i + ((6 * x) // (i * (i+1)) - (2 * i + 1)) // 3))\r\n i += 1\r\nnumber = 0\r\nfor elem in nmList:\r\n if elem[0] != elem[1]:\r\n number += 2\r\n else:\r\n number += 1\r\nprint(number)\r\nfor elem in nmList:\r\n print(str(elem[0]) + ' ' + str(elem[1]))\r\nfor i in range(len(nmList) - 1, -1, -1):\r\n elem = nmList[i]\r\n if elem[0] == elem[1]:\r\n continue\r\n print(str(elem[1]) + ' ' + str(elem[0]))", "def f(n, m):\r\n return (m + 3 * m * n + 3 * m * m * n - m * m * m) // 6\r\n\r\ns = int(input())\r\nans = list()\r\n\r\nfor m in range(1, 1442250):\r\n p = (6 * s - m + m * m * m) \r\n q = (3 * m + 3 * m * m)\r\n if p % q > 0: continue\r\n n = p // q\r\n if n >= m:\r\n ans.append((n, m))\r\n if n != m:\r\n ans.append((m, n))\r\n\r\nans.sort(key=lambda p: p[0])\r\nprint(len(ans))\r\nfor p in ans:\r\n print(*p)" ]

[ "import math\r\nimport random \r\nimport time\r\nfrom decimal import *\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left as lower_bound\r\nfrom bisect import bisect_right as upper_bound\r\n\r\n\r\nimport sys,threading\r\n#sys.setrecursionlimit(5*(10**5)+2)\r\n#threading.stack_size(99000000)\r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nalfabet_2={'1':\"a\", '2':\"b\", '3':\"c\", '4':\"d\", '5':\"e\", '6':\"f\", '7':\"g\", '8':\"h\", '9':\"i\", '10':\"j\", '11':\"k\", '12':\"l\", '13':\"m\", '14':\"n\", '15':\"o\", '16':\"p\", '17':\"q\", '18':\"r\", '19':\"s\", '20':\"t\", '21':\"u\", '22':\"v\", '23':\"w\", '24':\"x\", '25':\"y\", '26':\"z\"}\r\n \r\n \r\nclass FenwickTree:\r\n def __init__(self, x):\r\n bit = self.bit = list(x)\r\n size = self.size = len(bit)\r\n for i in range(size):\r\n j = i | (i + 1)\r\n if j < size:\r\n bit[j] += bit[i]\r\n \r\n def update(self, idx, x):\r\n \"\"\"updates bit[idx] += x\"\"\"\r\n while idx < self.size:\r\n self.bit[idx] += x\r\n idx |= idx + 1\r\n \r\n def __call__(self, end):\r\n \"\"\"calc sum(bit[:end])\"\"\"\r\n x = 0\r\n while end:\r\n x += self.bit[end - 1]\r\n end &= end - 1\r\n return x\r\n \r\n def find_kth(self, k):\r\n \"\"\"Find largest idx such that sum(bit[:idx]) <= k\"\"\"\r\n idx = -1\r\n for d in reversed(range(self.size.bit_length())):\r\n right_idx = idx + (1 << d)\r\n if right_idx < self.size and self.bit[right_idx] <= k:\r\n idx = right_idx\r\n k -= self.bit[idx]\r\n return idx + 1, k\r\n \r\n \r\nclass SortedList:\r\n block_size = 700\r\n \r\n def __init__(self, iterable=()):\r\n self.macro = []\r\n self.micros = [[]]\r\n self.micro_size = [0]\r\n self.fenwick = FenwickTree([0])\r\n self.size = 0\r\n for item in iterable:\r\n self.insert(item)\r\n \r\n def insert(self, x):\r\n i = lower_bound(self.macro, x)\r\n j = upper_bound(self.micros[i], x)\r\n self.micros[i].insert(j, x)\r\n self.size += 1\r\n self.micro_size[i] += 1\r\n self.fenwick.update(i, 1)\r\n if len(self.micros[i]) >= self.block_size:\r\n self.micros[i:i + 1] = self.micros[i][:self.block_size >> 1], self.micros[i][self.block_size >> 1:]\r\n self.micro_size[i:i + 1] = self.block_size >> 1, self.block_size >> 1\r\n self.fenwick = FenwickTree(self.micro_size)\r\n self.macro.insert(i, self.micros[i + 1][0])\r\n \r\n def pop(self, k=-1):\r\n i, j = self._find_kth(k)\r\n self.size -= 1\r\n self.micro_size[i] -= 1\r\n self.fenwick.update(i, -1)\r\n return self.micros[i].pop(j)\r\n \r\n def __getitem__(self, k):\r\n i, j = self._find_kth(k)\r\n return self.micros[i][j]\r\n \r\n def count(self, x):\r\n return self.upper_bound(x) - self.lower_bound(x)\r\n \r\n def __contains__(self, x):\r\n return self.count(x) > 0\r\n \r\n def lower_bound(self, x):\r\n i = lower_bound(self.macro, x)\r\n return self.fenwick(i) + lower_bound(self.micros[i], x)\r\n \r\n def upper_bound(self, x):\r\n i = upper_bound(self.macro, x)\r\n return self.fenwick(i) + upper_bound(self.micros[i], x)\r\n \r\n def _find_kth(self, k):\r\n return self.fenwick.find_kth(k + self.size if k < 0 else k)\r\n \r\n def __len__(self):\r\n return self.size\r\n \r\n def __iter__(self):\r\n return (x for micro in self.micros for x in micro)\r\n \r\n def __repr__(self):\r\n return str(list(self))\r\n \r\n \r\n#A = SortedList()\r\n#A.insert(30)\r\n#A.insert(50)\r\n#A.insert(20)\r\n#A.insert(30)\r\n#A.insert(30)\r\n#print(A) # prints [20, 30, 30, 30, 50]\r\n#print(A.lower_bound(30), A.upper_bound(30)) # prints 1 4\r\n#print(A[-1]) # prints 50\r\n#print(A.pop(1)) # prints 30\r\n#print(A) # prints [20, 30, 30, 50]\r\n#print(A.count(30)) # prints 2 \r\n \r\n \r\n \r\ndef binary_search(vector,valoarea):\r\n \r\n left=0\r\n right=len(vector)-1\r\n \r\n while left<=right:\r\n \r\n \r\n centru=(left+right)//2\r\n # print(left,right,centru,vector[centru])\r\n \r\n if vector[centru]<=valoarea:\r\n left=centru+1\r\n else:\r\n right=centru-1\r\n \r\n# print(left,right,centru,vector[centru]) \r\n return left\r\n \r\ndef functie(element,dist,full,graph,vizitat,partial,initialul):\r\n initial=alfabet[element]\r\n vizitat[initial]=1\r\n \r\n for elemente in graph[element]:\r\n pozitie=alfabet[elemente]\r\n \r\n if vizitat[pozitie]==0:\r\n \r\n partial[pozitie]=min(partial[pozitie],partial[initial]+dist[(element,elemente)])\r\n \r\n val_partiala=min(partial[pozitie],partial[initial]+dist[(element,elemente)])\r\n # print(\"element=\",element,\" to =\" ,elemente, \" part=\",val_partiala)\r\n \r\n minimul=10**18\r\n target=''\r\n \r\n for i in range(1,27):\r\n new_element=alfabet_2[str(i)]\r\n \r\n \r\n if vizitat[i]==0:\r\n \r\n if minimul>partial[i]:\r\n minimul=partial[i]\r\n target=new_element\r\n \r\n vizitat[initial]=1\r\n \r\n if target!='':\r\n # print(\"target=\",target)\r\n functie(target,dist,full,graph,vizitat,partial,initialul)\r\n else:\r\n # print(\"part=\",partial)\r\n \r\n for dd in range(1,27):\r\n if partial[dd]<10**18:\r\n full[(initialul,alfabet_2[str(dd)])]=partial[dd]\r\n \r\n \r\n \r\n \r\n \r\n \r\ndef functie_nod(nodul,oprire,distantele,graficul,vizitatul,rezultatul,initial): \r\n \r\n \r\n pp=10**18\r\n partial=pp\r\n \r\n gasit=0\r\n \r\n \r\n# print(\"n=\",nodul)\r\n ex=0\r\n for vecini in graficul[nodul]:\r\n if vizitatul[vecini]==0:\r\n ex=1\r\n # print(\"vec=\",vecini)\r\n \r\n rezultatul[vecini]=min(rezultatul[vecini],rezultatul[nodul]+distantele[(nodul,vecini)])\r\n # print(\"vec=\",vecini,\"rez=\",rezultatul[vecini])\r\n \r\n if partial>=rezultatul[vecini]:\r\n next_one=vecini\r\n partial=rezultatul[vecini]\r\n \r\n# print(\"vec=\",next_one, rezultate[next_one],rezultate[nodul],distantele[(nodul,next_one)])\r\n# print(rezultate)\r\n vizitatul[nodul]=1\r\n \r\n \r\n \r\n if ex==0:\r\n # print(\"ex=\",ex,rezultatul[oprire])\r\n #print(rezultatul)\r\n \r\n return rezultatul[oprire]\r\n \r\n else:\r\n # print(\"?=\",rezultatul[oprire])\r\n functie(next_one,oprire,distantele,graficul,vizitatul,rezultatul) \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\ndef main():\r\n #answ=[]\r\n pp=10**18\r\n restul=998244353\r\n# teste=int(input())\r\n #answ=[]\r\n printare=[]\r\n \r\n \r\n for gg in range(1):\r\n \r\n # pp=-1\r\n cate=0\r\n string_unu=input()\r\n string_doi=input()\r\n \r\n \r\n n=int(input())\r\n \r\n distante={}\r\n full_distante={}\r\n sume=0\r\n graficul=defaultdict(list)\r\n \r\n \r\n \r\n for i in range(n):\r\n lista=list(map(str,input().split()))\r\n \r\n if (lista[0],lista[1]) not in distante:\r\n distante[(lista[0],lista[1])]=int(lista[2])\r\n graficul[lista[0]].append(lista[1])\r\n else:\r\n distante[(lista[0],lista[1])]=min(distante[(lista[0],lista[1])],int(lista[2]))\r\n \r\n \r\n# print(graficul) \r\n# print(distante) \r\n \r\n #for element in graficul['a']:\r\n # print(\"el=\",element)\r\n \r\n \r\n for i in range(1,27):\r\n \r\n vizitatul=[0] *27\r\n partialul=[pp] *27\r\n partialul[i]=0\r\n \r\n functie(alfabet_2[str(i)],distante,full_distante,graficul,vizitatul,partialul,alfabet_2[str(i)])\r\n # print(full_distante)\r\n \r\n great_book={}\r\n results={}\r\n \r\n for i in range(1,27):\r\n for j in range(1,27):\r\n minimul=pp\r\n targetul=''\r\n \r\n for c in range(1,27):\r\n \r\n unu=alfabet_2[str(i)]\r\n doi=alfabet_2[str(j)]\r\n trei=alfabet_2[str(c)]\r\n \r\n \r\n if (unu,trei) in full_distante and (doi,trei) in full_distante:\r\n if full_distante[(unu,trei)]+full_distante[(doi,trei)]<minimul:\r\n minimul=full_distante[(unu,trei)]+full_distante[(doi,trei)]\r\n targetul=trei\r\n \r\n if targetul!='':\r\n great_book[(unu,doi)]=targetul\r\n results[(unu,doi)]=minimul\r\n \r\n# print(great_book)\r\n #print(results)\r\n sume=0\r\n adev=1\r\n answer=''\r\n \r\n if len(string_unu)!=len(string_doi):\r\n adev=0\r\n # print(\"ff\")\r\n else: \r\n for i in range(len(string_unu)):\r\n unu=string_unu[i]\r\n doi=string_doi[i]\r\n \r\n if unu!=doi:\r\n if (unu,doi) not in great_book:\r\n adev=0\r\n break\r\n else:\r\n sume+=results[(unu,doi)]\r\n answer+=great_book[(unu,doi)]\r\n \r\n else:\r\n answer+=unu\r\n \r\n # print(\"adev=\",adev)\r\n \r\n if adev==1:\r\n print(sume)\r\n print(answer)\r\n else:\r\n print(-1)\r\n \r\nmain()\r\n \r\n#t=threading.Thread(target=main)\r\n#t.start()\r\n#t.join() ", "import sys\r\nimport math\r\nimport collections\r\nfrom heapq import heappush, heappop\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\ns = input().strip()\r\nt = input().strip()\r\nn = int(input())\r\n\r\nadj = [[math.inf for _ in range(26)] for _ in range(26)]\r\ndistances = [[math.inf for _ in range(26)] for _ in range(26)]\r\n\r\nfor _ in range(n):\r\n line = input().split()\r\n u = ord(line[0]) - ord('a')\r\n v = ord(line[1]) - ord('a')\r\n adj[u][v] = min(adj[u][v], int(line[2]))\r\n\r\nfor i in range(26):\r\n for j in range(26):\r\n if i == j: distances[i][j] = 0\r\n elif adj[i][j] != math.inf: distances[i][j] = adj[i][j]\r\n\r\nfor k in range(26):\r\n for i in range(26):\r\n for j in range(26):\r\n distances[i][j] = min(distances[i][j], distances[i][k] + distances[k][j])\r\n\r\nres = []\r\nans = 0\r\nflag = True\r\nfor i in range(min(len(s), len(t))):\r\n u = ord(s[i]) - ord('a')\r\n v = ord(t[i]) - ord('a')\r\n mn, letter = math.inf, \"\"\r\n for j in range(26):\r\n if distances[u][j] + distances[v][j] < mn:\r\n mn = distances[u][j] + distances[v][j]\r\n letter = chr(j + ord('a'))\r\n if letter == \"\":\r\n flag = False\r\n break\r\n res.append(letter)\r\n ans += mn\r\n\r\nif not flag or len(s) != len(t):\r\n print(\"-1\")\r\nelse:\r\n print(ans)\r\n print(\"\".join(res))", "\n# http://codeforces.com/problemset/problem/33/B\n# 33b: String Problem.\n\n#input = raw_input\n\ndef calc_path(a):\n '''\n this function uses floyd-warshall alg to compute all pairs shortest path weight among alphabet characters.\n input:\n a: a 2d list which gives the weighted edge data. e.g., a = [['a', 'x', 42]]: only one edge, ('a', 'x'), with weight 42.\n result:\n all pairs shortest path weight matrix, a 26-length 2d list. w[i][i] == 0; for i != j, w[i][j] == infinite indicates there's no path between i and j.\n '''\n w = [[float('inf') for col in range(26)] for row in range(26)]\n for i in range(26):\n w[i][i] = 0\n for b in a:\n if w[ord(b[0]) - 97][ord(b[1]) - 97] > b[2]:\n w[ord(b[0]) - 97][ord(b[1]) - 97] = b[2]\n for k in range(26):\n for i in range(26):\n for j in range(26):\n if w[i][j] > w[i][k] + w[k][j]:\n w[i][j] = w[i][k] + w[k][j]\n return w\n\ndef test_calc_path():\n a = [['a', 'b', 2], ['a', 'c', 6], ['b', 'm', 5], ['c', 'm', 3]]\n m = calc_path(a)\n print(m)\n print(m[ord('a') - 97][ord('m') - 97])\n print(m[ord('a') - 97][ord('b') - 97])\n\ndef transfer(s, t, a):\n '''\n this function firstly invokes calc_path to compute all pairs shortest path among alphabet characters, and then computes the minimum transformation position by position of s and t. finally, a minimal transformation weight and outcome is returned.\n input:\n s, t: the input string to be transformed.\n a: the character transformation cost list, 2d. e.g., a = [['a', 'x', 42], ['u', 'v', 8]]: a => x costs 42; u => v costs 8.\n result:\n -1 if transformation is not possible; otherwise, the minimal transformation cost and result, e.g. '12\\nabc'.\n '''\n if len(s) != len(t):\n return -1\n r = ''\n z = 0\n w = calc_path(a)\n for d, p in zip(s, t):\n if d == p:\n r += d\n else:\n c = float('inf')\n q = ''\n i = ord(d) - 97\n j = ord(p) - 97\n for k in range(26):\n v = w[i][k] + w[j][k]\n if c > v:\n c = v\n q = chr(k + 97)\n if c == float('inf'):\n return -1\n z += c\n r += q\n r = str(z) + '\\n' + r\n return r\n\ndef test_transfer():\n s = 'uayd'\n t = 'uxxd'\n a = [['a', 'x', 8], ['x', 'y', 13], ['d', 'c', 3]]\n assert transfer(s, t, a) == '21\\nuxyd'\n s1 = 'a'\n t1 = 'b'\n a1 = [['a', 'b', 2], ['a', 'b', 3], ['b', 'a', 5]]\n assert transfer(s1, t1, a1) == '2\\nb'\n s2 = 'abc'\n t2 = 'ab'\n a2 = [['a', 'b', 4], ['a', 'b', 7], ['b', 'a', 8], ['c', 'b', 11], ['c', 'a', 3], ['a', 'c', 0]]\n assert transfer(s2, t2, a2) == -1\n s3 = 'abcd'\n t3 = 'acer'\n a3 = [['b', 'c', 100], ['c', 'b', 10], ['c', 'x', 1], ['e', 'x', 3], ['c', 'e', 7], ['r', 'd', 11]]\n assert transfer(s3, t3, a3) == '25\\nabxd'\n\ndef fun():\n s = input()\n t = input()\n n = int(input())\n a = []\n for c in range(n):\n x, y, z = map(str, input().split())\n a.append([x, y, int(z)])\n print(transfer(s, t, a))\n\n#test_calc_path()\n#test_transfer()\nfun()\n" ]

[ "n, k = map(int, input().split())\r\ncur = 1\r\nx = 0\r\na = [0] * (n + 1)\r\nwhile k > 0:\r\n a[cur] = 1\r\n print(cur, end=(' '))\r\n if x == 0:\r\n cur = cur + k\r\n x = 1\r\n else:\r\n cur = cur - k\r\n x = 0\r\n k = k - 1\r\nfor i in range(1, n + 1):\r\n if a[i] == 0:\r\n print(i, end=' ')", "n,k=map(int,input().split())\nprint(*[i if i>k+1 else ((i+1)//2 if i%2 else k+2-i//2) for i in range(1,n+1)])\n", "def main():\r\n n, k = map(int, input().split())\r\n\r\n res = [1]\r\n visited = {1}\r\n j = 0\r\n for i in range(k, 0, -1):\r\n res.append(res[-1] + i if j % 2 == 0 else res[-1] - i)\r\n visited.add(res[-1])\r\n j += 1\r\n\r\n\r\n for i in range(1, n + 1):\r\n if i not in visited:\r\n res.append(i)\r\n\r\n print(*res)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = list(map(int, input().split()))\n\ncn = 0\npn = 0\nfor i in range(1, k+2):\n if i == 1:\n cn = 1\n else:\n cn = k - pn + 2 + i % 2\n\n print(cn, end=' ')\n pn = cn\n\n# resto dos numeros em ordem msm que ai fica tudo 1\nfor i in range(k+2,n+1):\n print(i, end=' ')\n", "n, k = map(int, input().split())\r\nA = [0] * (k + 1)\r\nA[::2], A[1::2] = range(1, k // 2 + 2), range(k + 1, k // 2 + 1, -1)\r\nprint(*A, *range(k + 2, n + 1))", "import math\r\n\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n start = 2\r\n end = n\r\n end_true = True\r\n listy = [str(1)]\r\n for i in range(n - 1):\r\n if k > 1:\r\n if end_true:\r\n listy.append(str(end))\r\n end -= 1\r\n else:\r\n listy.append(str(start))\r\n start += 1\r\n k -= 1\r\n end_true = not end_true\r\n else:\r\n if end_true:\r\n listy.append(str(start))\r\n start += 1\r\n else:\r\n listy.append(str(end))\r\n end -= 1\r\n print(\" \".join(listy))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n,k=(int(i) for i in input().split())\r\nl=[i for i in range(1,n-k+1)]\r\nl1=[i for i in range(n-k+1,n+1)]\r\nk1=0\r\nk2=k-1\r\nfor i in range(k):\r\n if(i%2==0):\r\n l.append(l1[k2])\r\n k2-=1\r\n else:\r\n l.append(l1[k1])\r\n k1+=1\r\nprint(*l)", "n,k = input().split() \r\nn=int(n) \r\nk= int(k) \r\nanswer = [1]\r\nfor i in range(0,k-1) : \r\n curdif=n-i-1\r\n last= answer[-1]\r\n if i%2 : \r\n answer.append(last-curdif)\r\n else : \r\n answer.append(last+curdif)\r\nfor i in range(k-1,n-1) : \r\n if k%2 : \r\n answer.append(answer[-1]+1)\r\n else :\r\n answer.append(answer[-1]-1) \r\nfor x in answer: \r\n print(x,end=\" \") \r\n", "n,k=map(int,input().split())\na=[q for q in range(1,n+1)]\nh=n-k-1\nfor q in range(h):\n print(a[q],end=\" \")\nl,r=h,n-1\nwhile l<r:\n print(a[l],a[r],end=\" \")\n l+=1\n r-=1\nif l==r:\n print(a[l])\n\n ", "\n\n\nr = list(map(int, input().split()))\nn = r[0]\nk = r[1]\nl = list()\nl.append(1)\nc = k\njustI = 0\nmaxl = 0\nprevious = 1\nprint(1, end=' ')\nfor i in range(1,n):\n if justI == 1:\n #l.append(max(l)+1)\n print(maxl+1, end=' ')\n maxl += 1\n else:\n # l.append(l[i-1]+c)\n print(previous+c, end=' ')\n previous = previous+c\n if previous>maxl: maxl = previous\n if c>1:\n c-=1\n c*=-1\n elif c<-1:\n c+=1\n c*=-1\n else:\n justI = 1\n# for i in l:\n# print(i, end=\" \")\n\n\n\n\n#10 4\n#1 5 2 4 3 6 7 8 9 10", "#!/usr/bin/python3\n\nimport sys\n\nif __name__ == '__main__':\n \n n, k = map(int, sys.stdin.readline().split())\n l = []\n i = 1\n j = k + 1\n while i <= j:\n l.append(str(i))\n i += 1\n if j > i:\n l.append(str(j))\n j -= 1\n for i in range(k+2, n+1):\n l.append(str(i))\n \n print(' '.join(l))\n\n", "n, k = map(int, input().split())\nch = 1\nnch = n\nperest = list()\nfor i in range(k):\n if i % 2 == 0:\n perest.append(ch)\n ch += 1\n else:\n perest.append(nch)\n nch -= 1\nif k % 2 == 0:\n for i in range(nch, ch - 1, -1):\n perest.append(i)\nelse:\n for i in range(ch, nch + 1):\n perest.append(i)\nprint(' '.join(map(str, perest)))\n", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)-1\r\nb=[]\r\ns=(k+3)//2\r\nb.append(s)\r\nif k%2==0:\r\n\ti=1\r\nelse: i=-1\r\nwhile k>-1:\r\n\ts=s+i\r\n\tb.append(s)\r\n\tif i>0:\r\n\t\ti=-1*i-1\r\n\telse: i=-1*i+1\r\n\tk-=1\r\nwhile s<n:\r\n\ts+=1\r\n\tb.append(s)\r\nfor d in range(len(b)):\r\n\tprint(b[d],end=' ')", "n, k = map(int, input().split())\nfor i in range(1, n - k + 1):\n print(i, end=' ')\nfor j in range(1, k + 1):\n if j % 2 == 0:\n print(n - k + j // 2, end=' ')\n else:\n print(n - j // 2, end=' ')\n", "n,k=map(int, input().split())\r\n\r\nlista=[]\r\nanterior=0\r\n#Para conseguir esta permutación los números deben ser 1, k+1, 2, k,...,k-1, n, si n<k+2 se seguirá cumpliendo el requisito pero no terminará en n.\r\nfor j in range(1,k+2):\r\n if j==1:\r\n valor=1\r\n else:\r\n valor=(k+2-anterior) if j%2==0 else (k+3-anterior)\r\n lista.append(valor)\r\n anterior=valor\r\n#Luego se agregan los elementos faltantes en caso de ser necesario, para todo n>k+2\r\nfor j in range(k+2, n+1):\r\n lista.append(j)\r\n\r\nfor n in lista:\r\n print(n)\r\n", "import math\n\nn, k = [int(x) for x in input().split()]\n\n# Starting sequence\nnumber = math.ceil((k + 1) / 2)\n\nfor i in range(k + 1):\n if (k % 2 == 1 and i % 2 == 1) or (k % 2 == 0 and i % 2 == 0):\n number += i\n else:\n number -= i\n print(f\"{number} \", end=\"\")\n\nfor i in range(k + 2, n + 1):\n print(f\"{i} \", end=\"\")\n\nprint()\n\n\t \t \t \t\t \t \t\t \t\t\t\t \t\t\t", "n,k=map(int,input().split())\r\na=[]\r\nl=1;m=k+1\r\nfor i in range(k+1):\r\n if i%2==0:\r\n a.append(l);l+=1\r\n else:\r\n a.append(m);m-=1\r\nfor i in range(k+2,n+1):\r\n a.append(i)\r\nprint(*a)", "n, k = map(int, input().split())\r\n\r\nused = [False] * n\r\nl, r = 0, n - 1\r\n\r\nfor i in range(k):\r\n used[l if i % 2 == 0 else r] = True\r\n if i % 2 == 0:\r\n print(l + 1, end=' ')\r\n l += 1\r\n else:\r\n print(r + 1, end=' ')\r\n r -= 1\r\n\r\nif k % 2 == 1:\r\n for i in range(n):\r\n if not used[i]:\r\n print(i + 1, end=' ')\r\nelse:\r\n for i in range(n - 1, -1, -1):\r\n if not used[i]:\r\n print(i + 1, end=' ')", "# cook your dish here\r\n\r\n\r\nn,k = map(int,input().split())\r\nl = [0]*(n)\r\nmaxx = n\r\nminn = 1\r\n \r\nres = \"\"\r\nfor x in range(n-k):\r\n res += str(maxx) + \" \"\r\n maxx -= 1\r\nfor z in range(k):\r\n if z%2 == 0:\r\n res += str(minn) + \" \"\r\n minn += 1\r\n else:\r\n res += str(maxx) + \" \"\r\n maxx -= 1 \r\nres = res[:-1]\r\nprint(res)\r\n", "n, k = map(int, input().split())\r\nprint(\r\n *[\r\n i if i > k + 1 else ((i + 1) // 2 if i % 2 else k + 2 - i // 2)\r\n for i in range(1, n + 1)\r\n ]\r\n)\r\n", "s = input().split()\r\nn, k = int(s[0]), int(s[1])\r\nx = 1\r\nc = k\r\nr = 0\r\nfor i in range(n):\r\n print(x, end=\" \")\r\n x += (2 * ((i + 1) % 2) - 1) * c\r\n c -= 1\r\n if c < 0:\r\n r = n - (i + 1)\r\n break\r\nfor i in range(r):\r\n print((k + 1 + i) % n + 1, end=\" \")", "# Description of the problem can be found at http://codeforces.com/problemset/problem/482/A\r\n\r\nn, k = map(int, input().split())\r\n\r\nl_n = list()\r\n\r\nh = n\r\nl = 1\r\nfor i in range(n):\r\n if i < k:\r\n if i % 2 == 0:\r\n l_n.append(i // 2 + 1)\r\n l = i // 2 + 1\r\n else:\r\n l_n.append(n - i // 2)\r\n h = n - i // 2\r\n else:\r\n if i % 2 == 1:\r\n l_n.extend(l + x for x in range(1, n + 1 - i))\r\n if i % 2 == 0:\r\n l_n.extend(h - x for x in range(1, n + 1 - i))\r\n break\r\nprint(\" \".join(str(x) for x in l_n))", "def main():\r\n n,k=map(int,input().split())\r\n RES=[0 for i in range(k+1)]\r\n RES[0]=1\r\n for i in range(1,k+1):\r\n if i%2!=0:\r\n RES[i]=k+2-RES[i-1]\r\n else:\r\n RES[i]=RES[i-2]+1\r\n for i in range(1+k,n):\r\n RES.append(i+1)\r\n print(*RES)\r\nmain()", "n, k = map(int, input().split())\r\na = [n - i // 2 if i & 1 else i // 2 + 1 for i in range(n)]\r\na[k:] = sorted(a[k:])[::-1] if (a[k - 1] > n / 2) else sorted(a[k:])\r\nprint (*(a))", "n, k = map(int, input().split())\r\np1 = 1\r\np2 = n\r\nans = []\r\nfor i in range(n - k - 1):\r\n ans.append(p1)\r\n p1 += 1\r\nfor i in range(k + 1):\r\n if i % 2 == 0:\r\n ans.append(p1)\r\n p1 += 1\r\n else:\r\n ans.append(p2)\r\n p2 -= 1\r\n\r\nprint(' '.join(map(str,ans)))", "__author__ = 'neki'\r\n\r\nimport sys\r\n\r\n#sys.stdin = open(\"permutation.in\", \"r\")\r\n#sys.stdout = open(\"file.out\", \"w\")\r\n\r\nwords = input().split()\r\nn = int(words[0])\r\nk = int(words[1])\r\n\r\nperm = [1]\r\nviz = [0 for x in range(n+1)]\r\nviz[1] = 1\r\ndif = k\r\none = 1\r\nwhile dif > 0:\r\n num = perm[len(perm) - 1] + one * dif\r\n perm.append(num)\r\n viz[num] = 1\r\n one *= -1\r\n dif -= 1\r\n\r\nfor i in range(1, n+1):\r\n if viz[i] == 0:\r\n perm.append(i)\r\n\r\nfor i in range(n-1):\r\n print(perm[i], end=\" \")\r\nprint(perm[n-1])\r\n", "n, k = map(int, input().split())\r\n\r\nx = 0\r\na0 = k + 2\r\na1 = 0\r\n\r\nfor i in range(k + 1):\r\n if i % 2 == 0:\r\n a1 += 1\r\n print(a1, end=\" \")\r\n else:\r\n a0 -= 1\r\n print(a0, end=\" \")\r\n\r\nfor i in range(k + 2, n + 1):\r\n print(i, end=\" \")", "import sys\nn, k = map(int, sys.stdin.readline().split())\nif k%2 == 0:\n t = k//2\n ans = []\n for i in range(1,t+1):\n ans.append(i)\n ans.append(n+1-i)\n for i in range(n-t,t,-1):\n ans.append(i)\nelse:\n t = k//2\n ans = []\n for i in range(1,t+1):\n ans.append(i)\n ans.append(n+1-i)\n for i in range(t+1,n-t+1):\n ans.append(i)\nprint(' '.join([str(i) for i in ans]))\n", "#Construction: [1, 2, 3, ..., n-k, n, n-k+1, n-1, n-k+2, n-2, ...]\r\n#[1, 2, 3, ..., n-k-1] + [n-k, n, n-k+1, n-1, n-k+2, n-2, ...]\r\n\r\n#ceil_div cause why not even tho I only need div by 2\r\n#ceil_div(a.b) returns ceil(a/b)\r\ndef ceil_div(a,b):\r\n\treturn (a-1) // b + 1 \r\n\r\n#zigzag(x,y) returns the list [x, y-1, x+1, y-2, x+2, y-3, ...]\r\n#which contains all the elements from x to y-1 exactly once\r\ndef zigzag(x,y):\r\n\tans = [0 for i in range(y-x)]\r\n\r\n\thalf_up = ceil_div(y-x,2)\r\n\thalf_down = (y-x) // 2\r\n\r\n\tfor i in range(half_up):\r\n\t\tans[2*i] = x+i\r\n\tfor i in range(half_down):\r\n\t\tans[2*i+1] = y-1-i\r\n\r\n\treturn ans\r\n\r\nHomura = [int(i) for i in input().split()]\r\nn = Homura[0]\r\nk = Homura[1]\r\n\r\nans = [i for i in range(1, n-k)] + zigzag(n-k, n+1)\r\nans = [str(ans[i]) for i in range(n)]\r\nprint(' '.join(ans))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, k = map(int, input().split())\r\nx = (k+2)//2\r\na = list(range(1, x+1))\r\nb = list(range(k+1, x, -1))\r\nd = []\r\nfor i in range(len(b)):\r\n d.append(a[i])\r\n d.append(b[i])\r\nif k % 2 == 0:\r\n d.append(a[-1])\r\nfor i in range(k+2, n+1):\r\n d.append(i)\r\nprint(' '.join(map(str, d)))", "n, k = map(int,input().split())\r\ni = 1\r\nj = n\r\ncurr = 0\r\narr = []\r\nwhile(k):\r\n if(curr == 0):\r\n arr.append(i)\r\n i+=1\r\n else:\r\n arr.append(j)\r\n j-=1\r\n curr ^= 1\r\n k-=1\r\nif(curr):\r\n while(i <= j):\r\n arr.append(i)\r\n i += 1\r\nelse:\r\n while(i <= j):\r\n arr.append(j)\r\n j -= 1\r\nprint(*arr)", "#In the name of Allah\r\n\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn, k = map(int, input().split())\r\n\r\ndef f(n):\r\n n += 1\r\n l = []\r\n for i in range(1, 1 + n // 2):\r\n l.append(str(i))\r\n l.append(str(n - i + 1))\r\n if n % 2 == 1:\r\n l.append(str(n // 2 + 1))\r\n return l\r\n\r\nans = f(k)\r\n\r\nfor i in range(n - k - 1):\r\n ans.append(str(i + k + 2))\r\n\r\nstdout.write(\" \".join(ans))\r\n", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------Input-----------------------------------------#\n######################################################################################\n \ndef value(): return tuple(map(int, input().split()))\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\ndef inlst(): return [int(i) for i in input().split()]\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\ndef inp(): return int(input())\ndef inps(): return int(sys.stdin.readline())\ndef instr(): return input()\ndef stlst(): return [i for i in input().split()]\n \n \n######################################################################################\n#--------------------------------------code here-------------------------------------#\n######################################################################################\n \ndef solve():\n n,k=values()\n l=[i for i in range(1,n-k+1)]\n m=(k)\n for i in range(k):\n l.append(l[-1]+m)\n m=(abs(m)-1)*pow(-1,i+1)\n print(*l)\n\n\nsolve()\n", "import sys\r\nimport math\r\n \r\nn, k = [int(x) for x in (sys.stdin.readline()).split()]\r\nres = []\r\n\r\nif(k == 1):\r\n for i in range(1, n + 1):\r\n res.append(str(i))\r\n print(\" \".join(res))\r\n exit()\r\n\r\nz = n\r\nfor i in range(n, 1, -1):\r\n if(i > k):\r\n res.append(str(i))\r\n else:\r\n z = i\r\n break\r\nl = z \r\nj = 1 \r\nfor i in range(1, z + 1):\r\n if(i % 2 != 0):\r\n res.append(str(j))\r\n j += 1\r\n else:\r\n res.append(str(z))\r\n z -= 1\r\n \r\nprint(\" \".join(res[::-1]))", "from __future__ import print_function\ns = input().split()\nn = int(s[0])\nk = int(s[1])\na = 1\nb = k + 1\ni = 0\nwhile a < b:\n print(a, end = ' ')\n a += 1\n print(b, end = ' ')\n b -= 1\nif a == b:\n print(a, end = ' ')\ni = 2 + k\nwhile i <= n:\n print(i, end = ' ')\n i += 1\n#ergbehjrgb", "#l1 = int(input())\nl2 = input().split()\n\nx = int(l2[0])\ny = int(l2[1])\nc = x - y\n\nd = True;\n\nfor i in range (1, x - y + 1):\n print(str(i) + \" \", end = '')\n\nv = y\nwhile (v >= 1):\n if (d):\n print(str(c+v) + \" \", end = '')\n c += v;\n d = False;\n\n else:\n print(str(c-v) + \" \", end = '')\n c -= v;\n d = True;\n\n v -= 1\n\n\n\n \t\t \t\t \t\t\t \t \t \t \t \t\t\t", "import sys\r\nn, k = map(int, input().split())\r\nleft = 1\r\nright = n\r\nturn = 0\r\nwhile k > 0:\r\n if turn == 0:\r\n sys.stdout.write(str(left))\r\n left += 1\r\n else:\r\n sys.stdout.write(str(right))\r\n right -= 1\r\n sys.stdout.write(\" \")\r\n k -= 1\r\n turn = 1 - turn\r\nif turn == 1:\r\n cur = left\r\n while cur <= right:\r\n sys.stdout.write(str(cur))\r\n sys.stdout.write(\" \")\r\n cur += 1\r\nelse:\r\n cur = right\r\n while cur >= left:\r\n sys.stdout.write(str(cur))\r\n sys.stdout.write(\" \")\r\n cur -= 1", "n,k=map(int,input().split())\r\ncheck=1\r\nc=n-k\r\nfor i in range(1,n-k+1):\r\n print(i,end=\" \")\r\nfor i in range(k,0,-1):\r\n if check==1:\r\n print(c+i,end=\" \")\r\n c+=i\r\n check=0\r\n else:\r\n print(c-i,end=\" \")\r\n c-=i\r\n check=1\r\nprint()", "from __future__ import nested_scopes, generators, division, absolute_import, with_statement, print_function, unicode_literals\r\nimport sys, os, time\r\n\r\n\r\nimport itertools\r\n\r\ndef rv(): return map(int, input().split())\r\ndef rl(n): return [list(map(int, input().split())) for _ in range(n)]\r\nif os.path.exists(\"test.txt\"): sys.stdin = open(\"test.txt\")\r\n# sys.stdout = open(pass, 'w')\r\n\r\ndef works(perm, k):\r\n return len(set( [abs(perm[i + 1] - perm[i]) for i in range(len(perm) - 1)] )) == k\r\n\r\ndef solve(n, k):\r\n l = [i for i in range(1, n + 1)]\r\n # for perm in itertools.permutations(l):\r\n # if works(perm, k) and perm[0] == 1 and perm[1] == 1 + k:\r\n # pass\r\n # print(perm)\r\n # print(\" \".join(map(str, [perm[i + 1] - perm[i] for i in range(n - 1)])))\r\n res = [1]\r\n up = 1\r\n for i in range(k, 0, -1):\r\n res.append(res[-1] + i * up)\r\n up *= -1\r\n there = set(res)\r\n for i in range(1, n + 1):\r\n if i not in there:\r\n res.append(i)\r\n # if not works(res, k):\r\n # print(n, k, res)\r\n print(\" \".join(map(str, res)))\r\n\r\n\r\n# for n in range(1, 100):\r\n# for k in range(1, n):\r\n# solve(n, k)\r\nn,k, = rv()\r\nsolve(n, k)", "n, k = map(int, input().split())\n\nsolution = [1]\na = 1\nb = 0\nfor i in range(k, 0, -1):\n if b % 2 == 0 :\n solution.append(solution[a-1] + i)\n else:\n solution.append(solution[a-1] - i)\n a += 1\n b += 1\n\nfor i in range(k+2,n+1):\n solution.append(i)\n\nprint(\" \".join(map(str,solution)))", "n, k = map(int, input().split())\r\n\r\na = []\r\nfor i in range(1, n - k + 1):\r\n a.append(i)\r\n\r\ni, j = n, n - k + 1\r\nfor t in range(n - len(a)):\r\n if t % 2 == 0:\r\n a.append(i)\r\n i -= 1\r\n else:\r\n a.append(j)\r\n j += 1\r\nprint(' '.join(map(str, a)))\r\n", "n,k = input().split()\nanswer = []\nanswer.append(1)\nappendVar = 1\nlowVar = 2\nhighVar = 1 + int(k)\n\nfor i in range(1, int(k) + 1):\n if i % 2 == 1:\n appendVar = highVar\n highVar -= 1\n answer.append(appendVar)\n else:\n appendVar = lowVar\n lowVar += 1\n answer.append(appendVar)\nfor i in range(int(k)+2, int(n) + 1):\n answer.append(i)\n\nprint(*answer)\n\n\t\t \t\t \t\t \t \t \t \t \t", "n, k = map(int, input().strip().split())\na = b = k//2+1\ndelta = (k&1)*2-1\nres = []\nfor i in range(k//2):\n res.append(a)\n a -= delta\n b += delta\n res.append(b)\nif k&1:\n res.append(a)\nfor a in range(k + 1, n + 1):\n res.append(a)\nprint(*res)", "a = input().split()\nfor i in range(len(a)):\n\ta[i] = int(a[i])\nn=a[0]\nk=a[1]\nj=0\nq=n\nw=n-k+1\nfor i in range(n-k):\n\tprint(i+1)\nfor i in range(k):#n-k+1\n\tif not i%2:\n\t\t#chet\n\t\tprint(q)\n\t\tq=q-1\n\telse:\n\t\tprint(w)\n\t\tw=w+1\n\n", "n, k = map(int,input().split())\r\nfor i in range(1,n-k+1):\r\n print(i,end=\" \")\r\ni+=1\r\nwhile i<n:\r\n print(n,i,end=\" \")\r\n i+=1\r\n n-=1\r\nif i==n:\r\n print(n,end=\" \")\r\nprint()", "n,k=map(int,input().split())\r\n\r\nk+=1\r\nj=k\r\ni=1\r\n\r\nwhile True:\r\n if i>k:\r\n break\r\n if i==k:\r\n print(i,end=\" \")\r\n break\r\n print(i,k,end=\" \")\r\n i+=1\r\n k-=1\r\n\r\nif j<n:\r\n for i in range(j+1,n+1):\r\n print(i,end=' ')", "n,k = map(int, input().strip().split(' '))\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print('1 2')\r\nelse:\r\n if k==1:\r\n for i in range(1,n+1):\r\n print(i,end=\" \")\r\n print()\r\n elif k==n-1:\r\n i1=1\r\n i2=n\r\n for i in range(1,n+1):\r\n if i%2!=0:\r\n print(i1,end=\" \")\r\n i1+=1\r\n else:\r\n print(i2,end=\" \")\r\n i2-=1\r\n else:\r\n for i in range(1,n-k):\r\n print(i,end=\" \")\r\n i1=i+1\r\n i2=n\r\n for j in range(1,k+2):\r\n if j%2!=0:\r\n print(i1,end=\" \")\r\n i1+=1\r\n else:\r\n print(i2,end=\" \")\r\n i2-=1", "# link: https://codeforces.com/problemset/problem/482/A\r\n\r\nfor _ in range(1):\r\n n, k = map(int, input().split())\r\n f = n\r\n s = 1\r\n if k == 1:\r\n print(*[i for i in range(1, n+1)])\r\n else:\r\n ans = [f, s]\r\n k -= 2\r\n diff = n - 2\r\n odd = 1\r\n while k > 0:\r\n if odd:\r\n # i will add\r\n odd = 0\r\n ans.append(ans[-1] + diff)\r\n else:\r\n # i will substract\r\n odd = 1\r\n ans.append(ans[-1] - diff)\r\n diff -= 1 \r\n k -= 1\r\n a = ans[-1] + 1\r\n b = ans[-1] - 1\r\n if a <= n and a not in ans:\r\n while len(ans) < n:\r\n ans.append(a) \r\n a += 1\r\n else:\r\n while len(ans) < n:\r\n ans.append(b)\r\n b -= 1 \r\n print(*ans) ", "import itertools\nimport math\n\ndef main():\n\tn, k = map(int, input().split())\n\ta = 1\n\tb = n\n\tres = []\n\tfor i in range(k - 1):\n\t\tif i % 2:\n\t\t\tres.append(a)\n\t\t\ta += 1\n\t\telse:\n\t\t\tres.append(b)\n\t\t\tb -= 1\n\tif k % 2:\n\t\tres += range(b, a - 1, -1)\n\telse:\n\t\tres += range(a, b + 1)\n\t\t\t\n\tprint(\" \".join(map(str, res)))\n\nif __name__ == \"__main__\":\n\tmain()\n", "'''\r\nif the k max n-1\r\nthe difference are 1,2,..,n-1\r\nn-1 is odd\r\n +2 -1 +3\r\nn-1 is even\r\n +2 -1 +4 -3\r\n\r\nthe difference are 1, 2, n-2, let the repeated be 1\r\n'''\r\nn, k = [int(x) for x in input().split()]\r\nrepeated = n - k - 1\r\ncurrent = 1 + repeated\r\nprint(' '.join([str(x) for x in list(range(1,repeated+2))]),end=' ')\r\nfor i in range(1,k+1):\r\n current += ((-1)**(i+1))*(k-i+1)\r\n if i <k:\r\n print(current,end=' ')\r\n else:\r\n print(current)", "a, b = list(map(int, input().split()))\nc = []\nd, e = 1, b + 1\n\nwhile e > d:\n\tc += [d, e]\n\te -= 1\n\td += 1\nif e == d:\n\tc.append(e)\nprint(' '.join(map(str, c + list(range(b + 2, a + 1)))))\n", "import math\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n nums = [k - i for i in range(k)]\r\n\r\n used = [False for i in range(n)]\r\n ans = [1]\r\n used[0] = True\r\n\r\n for i in range(k):\r\n if i % 2 == 0:\r\n ans.append(ans[-1] + nums[i])\r\n else:\r\n ans.append(ans[-1] - nums[i])\r\n\r\n used[ans[-1] - 1] = True\r\n\r\n for i in range(n):\r\n if not used[i]:\r\n ans.append(i + 1)\r\n\r\n print(*ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(lst):\n for ele in lst:\n sys.stdout.write(str(ele) + \" \")\n sys.stdout.write(\"\\n\")\n\n\ndef solve(n, k):\n # n total 3 distinct\n lst = [1]\n\n top = n\n bottom = 2\n counter = 0\n\n while k - 1 > 0:\n if counter % 2 == 0:\n lst.append(top)\n top -= 1\n else:\n lst.append(bottom)\n bottom += 1\n counter += 1\n k -= 1\n\n if counter % 2 == 0: # previously a bottom was added\n for i in range(bottom, top + 1):\n lst.append(i)\n else:\n for i in range(top, bottom - 1, -1):\n lst.append(i)\n\n return lst\n\n\ndef readinput():\n n, k = getInts()\n printOutput(solve(n, k))\n\n\nreadinput()\n", "'''\nFuad Ashraful Mehmet \nUniversity of Asia Pacific\nCategory:combinatorics +data structure\n'''\n\nimport collections\n\nn,k=map(int,input().split())\nd= collections.deque()\n\nfor i in range(1,n+1):\n d.append(i)\n\n\nres=[]\nturn=0\nwhile k>1:\n\n if turn==0:\n res.append(d.popleft())\n else:\n res.append(d.pop())\n turn=1-turn\n k-=1\n\n\nif turn==1:\n\n while d:\n res.append(d.pop())\n \nelse:\n while d:\n res.append(d.popleft())\n\n\nprint(*res)\n\n\n\n\n", "\nentrada = input()\nentrada_str = list(entrada.split(\" \"))\nentrada_int = list(map(int, entrada_str))\n\n# entradas\ntamanho = entrada_int[0]\np = entrada_int[1]\nnumero_anterior = 0\n\nfor i in range(1, p + 2):\n if i == 1:\n numero_atual = 1\n else:\n if i % 2 == 0:\n numero_atual = p + 2 - numero_anterior\n else:\n numero_atual = p + 3 - numero_anterior\n print(numero_atual, end=\" \")\n numero_anterior = numero_atual\n\nfor i in range(p + 2, tamanho + 1):\n print(i)\n\n\n\n \t\t\t \t\t \t\t\t\t \t \t \t \t", "s = input().split()\r\nn = int(s[0]) # ���-�� ����� � ������������\r\nk = int(s[1]) # ���-�� ��������� ���������\r\nmax = k+1\r\nl = 1\r\nprint(l, end = ' ')\r\n\r\nfor i in range(k): # ���������� ����� � ����������������� ����������\r\n if i % 2 == 0:\r\n l += k\r\n else:\r\n l -= k\r\n k -= 1\r\n print(l, end = ' ')\r\n \r\nif max < n: # ���������� ����� � ����������� ����������\r\n for i in range(max+1, n+1):\r\n print(i, end = ' ')", "n,k=[int(i) for i in input().split()]\r\nr=1\r\nk1=k+1\r\nfor i in range(k+1):\r\n if i%2==0:\r\n print(r,end=' ')\r\n r+=1\r\n else:\r\n print(k1,end=' ')\r\n k1-=1\r\nfor i in range(k+2,n+1):\r\n print(i,end=' ')\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\nl=[1]\r\nd=0\r\ni=2\r\nj=n\r\nc=1\r\nwhile(d<k-1):\r\n if(c%2==1):\r\n l.append(j)\r\n j-=1\r\n else:\r\n l.append(i)\r\n i+=1\r\n c+=1\r\n d+=1\r\nif(c%2==0):\r\n for x in range(j,i-1,-1):\r\n l.append(x)\r\nelse:\r\n for x in range(i,j+1):\r\n l.append(x)\r\nprint(*l)", "n,k=map(int,input().split())\na=[i+1 for i in range(n)]\nj=n;ans=[];d=1;t=0\nfor i in range(k):\n\tif i%2==0:\n\t\tans.append(j)\n\t\tj-=1\n\telse:\n\t\tans.append(d)\n\t\td+=1\nif k%2==0:\n\tfor i in range(d,j+1):\n\t\tans.append(i)\nelse:\n\tfor i in range(j,d-1,-1):\n\t\tans.append(i)\nprint(*ans)\n", "n, k = map(int, input().split())\r\ndiff = n - 1\r\ncurrent = 1\r\nprint(current, end = \" \")\r\nfor i in range(k - 1):\r\n current += ((-1) ** (i % 2)) * diff\r\n diff -= 1\r\n print(current, end = \" \")\r\nfor i in range(n - k):\r\n current += ((-1) ** ((k + 1) % 2))\r\n print(current, end = \" \" )\r\nprint()\r\n\r\n", "n,k=map(int,input().split())\r\n\r\ni=1\r\na=[]\r\nfor j in range(n//2):\r\n a.append(i)\r\n a.append(n-i+1)\r\n i+=1\r\n\r\nif n%2==1:\r\n a.append(n//2+1)\r\n\r\nfor i in range(k):\r\n print(a[i],end=' ')\r\n\r\nif k<n and a[k-1]>a[k]:\r\n s=a[k-1]-1\r\n for i in range(k,n):\r\n print(s,end=' ')\r\n s-=1\r\n\r\nelse:\r\n s=a[k-1]+1\r\n for i in range(k,n):\r\n print(s,end=' ')\r\n s+=1", "from sys import stdin, stdout\r\nimport math, collections\r\nmod = 998244353\r\ndef swap(arr, i, j):\r\n arr[i], arr[j] = arr[j], arr[i]\r\n#for _ in range(int(stdin.readline())):\r\nn, k = map(int, stdin.readline().split())\r\narr = [1]\r\ns = set()\r\ni = 1\r\nwhile len(s)<k-1:\r\n if len(arr)%2==1:\r\n arr.append(n-i//2)\r\n else:\r\n arr.append(i//2+1)\r\n s.add(abs(arr[-2]-arr[-1]))\r\n i+=1\r\nif len(arr)%2==0:\r\n while len(arr)<n:\r\n arr.append(arr[-1]-1)\r\nelse:\r\n while len(arr)<n:\r\n arr.append(arr[-1]+1)\r\nprint(*arr)", "n,k = map(int,input().split())\r\nt = []\r\nt.append(1)\r\nh=1\r\np=0\r\nfor i in range(k,0,-1):\r\n \r\n if(p%2==0):\r\n o = t[h-1]+i\r\n p+=1\r\n t.append(o)\r\n h+=1\r\n else:\r\n t.append(t[h-1]-i)\r\n h+=1\r\n p+=1\r\nfor i in range(k+2,n+1):\r\n t.append(i)\r\nfor i in t:\r\n print(i,end=\" \")\r\n ", "n,k = map(int,input().split())\n\nb = ''\n\ni = 1\nj = n\nc = 0\np = 0\n\nwhile(p < n):\n\tif(c < k):\n\t\tif(p % 2 == 0):\n\t\t\tb += str(i) + ' '\n\t\t\ti += 1\n\t\t\tc += 1\n\t\telse:\n\t\t\tb += str(j) + ' '\n\t\t\tj -= 1\n\t\t\tc += 1\n\telse:\n\t\tif(p % 2 == 1):\n\t\t\tfor q in range(i,j+1):\n\t\t\t\tb += str(q) + ' '\n\t\t\tprint(b)\n\t\t\texit(0)\n\t\telse:\n\t\t\tfor q in range(j,i-1,-1):\n\t\t\t\tb += str(q) + ' '\n\t\t\tprint(b)\n\t\t\texit(0)\n\tp += 1\n\nprint(b)", "arr = [int(x) for x in input().split()]\nn = arr[0]\nk = arr[1]\nc = n - k\nflag = True\nresp = []\n\nfor i in range(1, n - k + 1):\n resp.append(str(i))\n\nfor i in range(k, 0, -1):\n if flag:\n c += i\n resp.append(str(c))\n flag = False\n else:\n c -= i\n resp.append(str(c))\n flag = True\n\nresp = ' '.join(resp)\nprint (resp)\n\n \t \t\t\t\t\t \t\t\t \t \t \t\t \t\t", "n, k = map(int, input().split(' '))\r\no = n - k\r\nprint(1, end = ' ')\r\nfor i in range(2, o + 1):\r\n print(i, end = ' ')\r\nmb = n\r\nmm = o + 1\r\nwhile mb >= mm:\r\n print(mb, end = ' ')\r\n mb -= 1\r\n if mb >= mm:\r\n print(mm, end = ' ')\r\n mm += 1", "import math\n\nn,k = input().split()\nn = int(n)\nk = int(k)\n\np1 = 1\np2 = k+1\nfinal = []\nwhile p1<=math.ceil((k+1)/2):\n final.append(p1)\n p1 += 1\n if p2>math.ceil((k+1)/2):\n final.append(p2)\n p2 -= 1\n\nfor y in range(k+2,n+1):\n final.append(y)\n\nfor x in final:\n print(x,end = \" \")\nprint() \n", "params = list(map(int,list(input().split())))\nn = params[0]\nk = params[1]\n\ndef do_shit():\n lst = [1,k+1]\n count = 2\n \n while len(lst) <= n:\n lst.append(count)\n if abs(lst[-1] - lst[-2]) == 1:\n break\n lst.append(k - count + 2)\n if abs(lst[-1] - lst[-2]) == 1:\n break\n count += 1\n \n for r in range(len(lst)+1, n+1):\n lst.append(r)\n \n return lst\n\nif k == 1:\n string = ''\n for r in range(1,n+1):\n string += str(r)\n string += ' '\n print(string[:-1])\nelse:\n lst = do_shit()\n string = ''\n for i in lst:\n string += str(i)\n string += ' '\n print(string[:-1]) \n\t\t \t \t \t \t\t\t \t \t\t \t\t\t \t\t", "n, k = map(int, input().split())\r\na = []\r\nk += 1\r\none = 0\r\ntwo = 0\r\nf = False\r\nfor i in range(1, n + 1):\r\n if i % 2 != 0:\r\n i -= one\r\n a.append(i)\r\n one += 1\r\n else:\r\n i -= two\r\n a.append(n + 2 - i)\r\n two += 1\r\n k -= 1\r\n if k == 1:\r\n f = True\r\n d = set(a)\r\n if len(a) % 2 == 0:\r\n for j in range(n - 1, 0, -1):\r\n if j not in d:\r\n a.append(j)\r\n else:\r\n for j in range(1, n + 1):\r\n if j not in d:\r\n a.append(j)\r\n if f:\r\n break\r\nprint(*a)", "lista = input()\r\nlista = lista.split()\r\nN = int(lista[0]);\r\nk = int(lista[1]);\r\n\r\np = [1];\r\nfor indice in range (1,k+1):\r\n siguiente = p[indice-1] + (-1)**(indice+1)*(k-indice+1);\r\n p.append(siguiente)\r\n \r\nfor indice in range (k+1,N):\r\n siguiente = 1 + indice;\r\n p.append(siguiente)\r\n\r\nfor n in p:\r\n print(n)\r\n", "entrada = input()\n\nn = int(entrada.split()[0])\nk = int(entrada.split()[1])\n\ncc = n - k\n\nflag = 1\n\ni = 1\nwhile(i <= n - k):\n print(i, end=\" \")\n i += 1\n\ni = k\nwhile (i >= 1):\n if (flag == 1):\n if (i == 1):\n print(cc + i)\n else:\n print(cc + i, end=\" \")\n cc += i\n flag = 0\n else:\n if (i == 1):\n print(cc - i)\n else:\n print(cc - i, end=\" \")\n cc -= i\n flag = 1\n i -= 1\n\t \t \t\t \t \t\t \t\t \t\t\t\t\t \t\t\t", "n , k = map(int, input().split())\r\nres = [1]\r\n\r\nsum = True\r\n\r\nfor i in range(k, 0, -1):\r\n \r\n if sum == True:\r\n res.append(res[-1] + i)\r\n sum = False\r\n else:\r\n res.append(res[-1] - i)\r\n sum = True\r\n\r\nif len(res) < n:\r\n for i in range(res[1] + 1, n + 1):\r\n res.append(i)\r\n\r\nprint(\" \".join(map(str, res)))", "def printList(a):\n print(\" \".join(map(str, a)))\n\ndef solve():\n n, k = map(int, input().split())\n if k == 1:\n printList(range(1, n + 1))\n return\n\n cur = k + 1\n sh = k\n sg = -1\n ans = []\n while True:\n ans.append(cur)\n cur += sh * sg\n if not sh:\n break\n sh -= 1\n sg *= -1\n\n ans += list(range(k + 2, n + 1))\n printList(ans)\n\nsolve()\n", "n, k = map(int, input().split())\r\nres = []\r\nfor i in range(1, k+2):\r\n if i % 2 == 1:\r\n res.append((i+1) // 2) \r\n else:\r\n res.append(k + 2 - (i//2))\r\nres += list(range(k+2, n+1))\r\nprint(*res)\r\n", "n,k=map(int,input().split())\r\nl=[]\r\ni=1\r\nj=n\r\nc=k\r\nx=0\r\nwhile(i<=j):\r\n if(x%2==0):\r\n l.append(i)\r\n i+=1\r\n x+=1\r\n c-=1\r\n if(c<=0):\r\n break\r\n elif(x%2==1):\r\n l.append(j)\r\n j-=1\r\n x+=1\r\n c-=1\r\n if(c<=0):\r\n break\r\nif(k%2==0):\r\n for h in range(j,i-1,-1):\r\n l.append(h)\r\nelse:\r\n for h in range(i,j+1):\r\n l.append(h)\r\nprint(*l)\r\n", "a,b=list(map(int,input().split()))\r\nc=[]\r\nd,e=1,b+1\r\nwhile e>=d:\r\n c+=[d]+([e]if d!=e else[])\r\n d+=1\r\n e-=1\r\nprint(' '.join(map(str,c+list(range(b+2,a+1)))))\r\n", "n,m=map(int,input().split())\r\nl=[1]\r\nm=m-1\r\ns=n\r\np=2\r\nwhile m>0 :\r\n l.append(s)\r\n m=m-1\r\n s=s-1\r\n if m>0 :\r\n l.append(p)\r\n m=m-1\r\n p=p+1\r\nif l[len(l)-1]-p==-1 :\r\n z=p\r\n c=1\r\nelse :\r\n z=s\r\n c=2\r\nwhile len(l)!=n :\r\n if c==1 :\r\n l.append(z)\r\n z=z+1\r\n else :\r\n l.append(z)\r\n z=z-1\r\nprint(*l)\r\n \r\n \r\n", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import stdin\r\nfrom collections import *\r\n\r\nn, k = arr_inp()\r\nans, mem, c = [], defaultdict(int), 0\r\n\r\nfor i in range(n - k):\r\n ans.append(i + 1)\r\n mem[i + 1] = 1\r\n\r\nfor i in range(k, 0, -1):\r\n ix = ans[-1]\r\n if c & 1:\r\n ix -= i\r\n else:\r\n ix += i\r\n if mem[ix] == 0:\r\n mem[ix] = 1\r\n ans.append(ix)\r\n c += 1\r\n\r\nprint(*ans)\r\n", "entry = input().split()\n\np = int(entry[0])\nk = int(entry[1])\n\nforward = 1\nbackward = k + 1\n\nanswer = []\n\nfor controller in range((k//2) + 1):\n\n answer.append(str(forward))\n if forward != backward:\n answer.append(str(backward))\n\n forward += 1\n backward -= 1\n\nfor filler in range(k+2, p+1):\n answer.append(str(filler))\n\nprint(' '.join(answer))\n \t\t\t\t \t \t\t\t \t \t\t \t\t\t", "a,b=map(int,input().split())\r\ni=1;j=1+b;n=0\r\nwhile i<=j:\r\n if n==0:print(i,end=\" \");i+=1;n^=1\r\n else:print(j,end=\" \");j-=1;n^=1\r\nprint(*[*range(2+b,a+1)])", "n,k=(int(i) for i in input().split())\nlst=[]\nnumlist=list(range(1,k+2))\nfor i in range((k+1)//2):\n lst.extend([numlist[i],numlist[-i-1]])\nif k%2 == 0:\n lst.append((k+1)//2+1)\nfor i in range(k+1):\n print(lst[i],end=' ')\nfor i in range(k+2,n+1):\n print(i,end=' ')\n\t\t\t\t\t \t\t \t \t \t \t\t\t\t\t\t\t", "n, k = map(int, input().split())\r\ncur1 = 1\r\ncur2 = n\r\ntemp = 0\r\ntt = 0\r\nfor i in range(n):\r\n\tif i < k:\r\n\t\tif (i & 1) == 0:\r\n\t\t\tprint(cur1, end = ' ')\r\n\t\t\tcur1 += 1\r\n\t\t\ttemp = cur1\r\n\t\t\ttt = 1\r\n\t\telse:\r\n\t\t\tprint(cur2, end = ' ')\r\n\t\t\tcur2 -= 1\r\n\t\t\ttemp = cur2\r\n\t\t\ttt = -1\r\n\telse:\r\n\t\tif tt == 1:\r\n\t\t\tprint(cur1, end = ' ')\r\n\t\t\tcur1 += 1\r\n\t\telse:\r\n\t\t\tprint(cur2, end = ' ')\r\n\t\t\tcur2 -= 1\r\nprint()\r\n", "n,k = map(int,input().split())\r\nll = [str(i) for i in range(1,k+2)]\r\nll1 = []\r\nfor i in range(1,k + 1):\r\n ll1.append(ll[i-1])\r\n ll1.append(ll[-i])\r\nprint(' '.join(ll1[0:k+1] + [str(i) for i in range(k+2,n+1)]))\r\n", "n, k = [int(g) for g in input().split()]\r\nnum = list(range(n+1))\r\ndel num[0]\r\n\r\n#print(num)\r\ns = \"\"\r\nfor i in range(n-k):\r\n\ts+=str(num[i])\r\n\ts+=\" \"\r\n#print(s)\r\nf = n-k\r\nr = n-1\r\ni = 0\r\nwhile r >=f :\r\n\tif i % 2 == 0:\r\n\t\ts+=str(num[r])\r\n\t\ts+=\" \"\t\r\n\t\tr-=1\r\n\tif i % 2 != 0:\r\n\t\ts+=str(num[f])\r\n\t\ts+=\" \"\t\r\n\t\tf+=1\r\n\ti+=1\r\nprint(s)", "integer_quantity, distance_quantity = \\\r\n map(int, input().split())\r\npermutation = ['1']\r\nright_pointer = distance_quantity + 1\r\nappend_after_distance_quantity = right_pointer\r\nleft_pointer = 2\r\nappend_right = True\r\n\r\nfor i in range(2, integer_quantity+1):\r\n if distance_quantity > 0:\r\n distance_quantity -= 1\r\n if append_right:\r\n permutation.append(str(right_pointer))\r\n right_pointer -= 1\r\n else:\r\n permutation.append(str(left_pointer))\r\n left_pointer += 1\r\n append_right = not append_right\r\n else:\r\n append_after_distance_quantity += 1\r\n permutation.append(str(append_after_distance_quantity))\r\n\r\nprint(' '.join(permutation))", "def main():\n from sys import stdin, stdout\n (n, k) = map(int, stdin.readline().strip().split(' '))\n p = []\n for i in range(n - k):\n p.append(i + 1)\n l = n - k + 1\n o = n\n x = False\n for i in range(n - k + 1, n + 1):\n if x:\n p.append(l)\n l += 1\n else:\n p.append(o)\n o -= 1\n x ^= True\n #se = set()\n #for i in range(len(p) - 1):\n #se.add(abs(p[i] - p[i + 1]))\n #print(len(se))\n stdout.write(' '.join(list(map(str, p))) + '\\n')\nmain()\n", "\r\nn,k=list(map(int,input().split()))\r\nk=k-1\r\ncheck = True\r\nans=[1]\r\nfirst=2\r\nlast=n\r\ng={1:\"\"}\r\nfor i in range(k):\r\n if check==True:\r\n g[last]=\"\"\r\n ans.append(last)\r\n last=last-1\r\n check=False\r\n else:\r\n g[first]=\"\"\r\n ans.append(first)\r\n first=first+1\r\n check=True\r\n# print(g)\r\nif check is False:\r\n for i in range(n,0,-1):\r\n if i not in g:\r\n ans.append(i)\r\nelse:\r\n for i in range(1,n+1):\r\n if i not in g:\r\n ans.append(i)\r\nprint(*ans)", "import math\r\na,b=map(int,input().split())\r\nx1=list(range(1,math.ceil(a/2)+1))\r\nx2=list(range(math.ceil(a/2)+1,a+1))\r\nx2=x2[::-1]\r\nr=[]\r\nfor i in range(b):\r\n if i%2==0:\r\n r.append(x1.pop(0))\r\n else:\r\n r.append(x2.pop(0))\r\n\r\nx=x1+x2\r\nx.sort()\r\nif r[-1]>max(x):\r\n r+=x[::-1]\r\nelse:\r\n r+=x\r\n\r\n\r\nprint(' '.join(map(str,r)))\r\n", "import sys,math\nn,k = map(int,input().split(' '))\narr = [None]*n\neven = 1\nodd = n\nfor i in range(n):\n if i%2==0:\n arr[i]=even\n even+=1\n else:\n arr[i]=odd\n odd-=1\nminn = min(arr[k-1:])\nif arr[k-1]>minn:\n num = arr[k-1]\n for i in range(k-1,n):\n arr[i] = num\n num-=1\nelse:\n num = arr[k-1]\n for i in range(k-1,n):\n arr[i] = num\n num+=1\narr = map(str,arr)\nprint(' '.join(arr))\n", "n,k=map(int,input().split())\r\np=[n]\r\nh=1\r\nprev=n\r\nwhile k>0:\r\n if h%2!=0:\r\n p.append(prev-k)\r\n prev=prev-k\r\n h+=1\r\n else:\r\n p.append(prev+k)\r\n prev=prev+k\r\n h+=1\r\n k-=1\r\nfor i in range(p[1]-1,0,-1):\r\n p.append(i)\r\nprint(*p)", "n,k = map(int,input().split())\n\na = list(range(1,n+1))\n\nfor i in range(1,k+1): a[i] = a[i-1] + (k-i+1 if i&1 else i-k-1)\n\nprint(\" \".join(repr(x) for x in a))\n\n\n\n# Made By Mostafa_Khaled", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n p, q = 1, n\r\n rest = list()\r\n for i in range(k):\r\n if i % 2 == 0:\r\n rest.append(p)\r\n p += 1\r\n else:\r\n rest.append(q)\r\n q -= 1\r\n if k % 2 == 0:\r\n for i in range(q, p - 1, -1):\r\n rest.append(i)\r\n else:\r\n for i in range(p, q + 1):\r\n rest.append(i)\r\n print(' '.join(map(str, rest)))\r\n", "# coding: utf-8\nn, k = [int(i) for i in input().split()]\nans = ['1']\nfor i in range(k):\n if i%2==0:\n ans.append(str(int(ans[-1])+(k-i)))\n else:\n ans.append(str(int(ans[-1])-(k-i)))\nans += [str(i) for i in range(k+2,n+1)]\nprint(' '.join(ans))\n", "n, k = map(int, input().split())\n\nans = [1]\nL = [i for i in range(k, 0, -1)]\nadds = set([1])\nrems = set([i for i in range(2, n + 1)])\nflg = True\nfor l in L:\n if flg:\n tmp = ans[-1] + l\n else:\n tmp = ans[-1] - l\n \"\"\"\n if tmp in rems:\n ans.append(tmp)\n adds.add(tmp)\n rems.remove(tmp)\n else:\n tmp = ans[-1] - l\n ans.append(tmp)\n adds.add(tmp)\n rems.remove(tmp)\n \"\"\"\n ans.append(tmp)\n rems.remove(tmp)\n flg = not flg\nrems = list(rems)\nrems.sort()\nfor rem in rems:\n ans.append(rem)\nprint(\" \".join(map(str, ans)))\n", "n, k = map(int, input().split())\r\nL = []\r\nfor i in range(n + 1):\r\n L.append(i)\r\nk1 = k\r\ns = (n * (n + 1)) / 2 - 1\r\nL[1] = 0\r\nL[k + 1] = 0\r\nprint('1', k + 1, end = ' ')\r\nk = k - 1\r\nb = k + 2\r\nwhile s > 0:\r\n if k == 0:\r\n break\r\n if b - k > 0 and L[b - k] != 0:\r\n print(L[b - k], end = ' ')\r\n L[b - k] = 0\r\n s -= b - k\r\n b = abs(b - k)\r\n k -= 1\r\n else:\r\n print(L[b + k], end = ' ')\r\n L[b + k] = 0\r\n s -= b + k\r\n b = abs(b + k)\r\n k -= 1\r\nfor i in range(len(L)):\r\n if L[i] != 0:\r\n print(L[i], end = ' ')\r\n\r\n \r\n", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n n, k = [int(num) for num in input().split()]\r\n i = 1\r\n j = n\r\n cur = i\r\n cnt = 0\r\n ans = []\r\n while cnt < k - 1:\r\n if cur == i:\r\n ans.append(i)\r\n i += 1\r\n cur = j\r\n else:\r\n ans.append(j)\r\n j -= 1\r\n cur = i\r\n cnt += 1\r\n if cur == i:\r\n for num in range(i, j + 1):\r\n ans.append(num)\r\n else:\r\n for num in range(j, i - 1, -1):\r\n ans.append(num)\r\n print(*ans)\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\"\"\"import random\r\nn=8\r\nll=[int(i) for i in range(1,n)]\r\nk=6\r\nflag=False\r\nwhile not flag :\r\n s=set()\r\n random.shuffle(ll)\r\n for i in range(1,n-1):\r\n s.add(abs(ll[i]-ll[i-1]))\r\n if len(s)==k:\r\n flag=True\r\nprint(ll)\"\"\"\r\nn,k=map(int,input().split())\r\nt,i,j,ll=1,1,n,[1]\r\nwhile t<k:\r\n ll.append(j)\r\n t+=1\r\n j-=1\r\n if t==k:\r\n break\r\n i+=1\r\n ll.append(i)\r\n t+=1\r\nt=ll[-1]\r\nif k&1:\r\n for i in range(t+1,(t+1)+n-k):\r\n ll.append(i)\r\nelse:\r\n for i in range(t-1,t-(n-k)-1,-1):\r\n ll.append(i)\r\n\"\"\"s=set()\r\nfor i in range(1,n):\r\n s.add(abs(ll[i]-ll[i-1]))\r\nprint(len(s))\r\n\"\"\"\r\nprint(*ll)", "i = str.split(input(), \" \")\nn = int(i[0])\nk = int(i[1])\nmaxx = n\nminn = 1\n\nres = \"\"\nfor x in range(n-k):\n res += str(maxx) + \" \"\n maxx -= 1\nfor z in range(k):\n if z%2 == 0:\n res += str(minn) + \" \"\n minn += 1\n else:\n res += str(maxx) + \" \"\n maxx -= 1 \nres = res[:-1]\nprint(res)\n", "from functools import lru_cache\n\nfrom sys import stderr\n\nINF = 10 ** 18 + 3\nEPS = 1e-10\n\n\ndef res_to_stderr(function):\n def wrapped(*args, **kwargs):\n res = function(*args, **kwargs)\n print(res, file=stderr)\n return res\n\n return wrapped\n\n\n@res_to_stderr\ndef range_of_len(start, length, step=1):\n return range(start, start + length * step, step)\n\n\n@lru_cache(10 ** 9)\ndef find_perm(length, n_different):\n if length == 0:\n return []\n\n if n_different != length - 1:\n return (list(range_of_len(length, length - n_different - 1, - 1))\n + find_perm(n_different + 1, n_different))\n\n curr = length\n go_down = True\n res = []\n for _ in range(n_different + 1):\n res.append(curr)\n curr = length - curr + go_down\n go_down ^= True\n\n return res\n\n\ndef main():\n n, k = map(int, input().split())\n print(*find_perm(n, k))\n\n\nif __name__ == '__main__':\n main()\n", "import collections\n\n\ndef check_permutation(perm, k):\n diffs = set()\n for i in range(len(perm)-1):\n diffs.add(abs(perm[i+1]-perm[i]))\n return len(diffs) == k\n\nn, k = [ int(i) for i in input().split(\" \") ]\n\nhead = collections.deque(range(1, k+2))\ntail = list(range(k+2, n+1))\npermutation = []\n\nleft = True\nwhile head:\n if left:\n permutation.append(head.popleft())\n else:\n permutation.append(head.pop())\n left = not left\n\npermutation = permutation + tail\n\nfor p in permutation:\n print(p, end=' ')\nprint(' ')\n#print(check_permutation(permutation, k))\n", "n,k=input().split()\nn=int(n)\nk=int(k)\nvis=[0]*n\nl=0\nr=n-1\nfor i in range(0,k):\n if ((i&1)==0):\n vis[l]=1\n else:\n vis[r]=1\n if ((i & 1) == 0):\n print(1 +l,end=\" \")\n l+=1\n else:\n print(1 +r,end=\" \")\n r-=1\nif ((k & 1) == 1):\n for i in range(0,n):\n if (vis[i]==0):\n print(i + 1,end=\" \")\nelse:\n for i in range(n-1,-1,-1):\n if (vis[i]==0):\n print(i + 1,end=\" \")\n\n\t \t \t\t\t \t \t \t \t \t\t\t\t\t", "n, k = map(int, input().split())\ncur1 = 1\ncur2 = n\ntemp = 0\ntt = 0\nfor i in range(n):\n\tif i < k:\n\t\tif (i & 1) == 0:\n\t\t\tprint(cur1, end = ' ')\n\t\t\tcur1 += 1\n\t\t\ttemp = cur1\n\t\t\ttt = 1\n\t\telse:\n\t\t\tprint(cur2, end = ' ')\n\t\t\tcur2 -= 1\n\t\t\ttemp = cur2\n\t\t\ttt = -1\n\telse:\n\t\tif tt == 1:\n\t\t\tprint(cur1, end = ' ')\n\t\t\tcur1 += 1\n\t\telse:\n\t\t\tprint(cur2, end = ' ')\n\t\t\tcur2 -= 1\nprint()\n#La3oksh\n\t\t \t\t \t\t\t\t \t \t \t \t\t \t\t \t \t\t\t\t\t", "string = input()\nn, k = string.split()\nn = int(n)\nk = int(k)\nc = n - k\nperm = True\noutput = \"\"\nfor i in range(1, n-k + 1):\n output += str(i) + \" \"\ni = k\noutput2 = \"\"\nwhile i >= 1:\n if(perm):\n output2 += str(c + i) + \" \"\n c += i\n perm = False\n else:\n output2 += str( c - i ) + \" \"\n c -= i\n perm = True\n i -= 1\nprint(output + output2)\n \t \t \t\t\t \t\t\t\t\t \t\t \t\t \t\t" ]

[ "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\na1=a.count(a[0])\r\na2=a.count(a[-1])\r\nif a[0]==a[-1]:\r\n c=n*(n-1)//2\r\nelse:\r\n c=a1*a2\r\nprint(a[-1]-a[0],c)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif len(set(a)) == 1:\r\n print(0,n*(n-1)//2)\r\nelse:\r\n print(max(a)-min(a),a.count(max(a))*a.count(min(a)))\r\n", "n = int(input())\r\n\r\nl = [int(a) for a in input().split()]\r\nif min(l) == max(l):\r\n print(0, len(l) * (len(l)-1) // 2)\r\nelse:\r\n print(max(l) - min(l), l.count(max(l)) * l.count(min(l)))", "t=int(input())\r\nl=list(map(int,input().split()))\r\nmaxi=max(l)\r\nmini=min(l)\r\ncount1=l.count(maxi)\r\ncount2=l.count(mini)\r\n \r\nif mini==maxi:\r\n print(maxi-mini,count1*(count1-1)//2)\r\nelse:\r\n print(maxi-mini,count1*count2)", "from collections import defaultdict\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\n\r\nfirst=a.count(a[0])\r\nsecond=a.count(a[n-1])\r\n\r\nif a[0]==a[n-1]:\r\n print(a[n-1]-a[0],(n*(n-1))//2)\r\nelse:\r\n print(a[n-1]-a[0],first*second)", "input()\r\narr=[int(arr) for arr in input().split()]\r\nif(max(arr)==min(arr)):\r\n n=arr.count(max(arr))-1\r\n print(0, (n * (n + 1) // 2))\r\nelse:\r\n print(max(arr)-min(arr), (arr.count(max(arr)))*(arr.count(min(arr))))", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\na.sort()\r\n\r\nprint(a[n-1] - a[0], end = \" \")\r\nif a[0] == a[n-1]:\r\n\tans = 0\r\n\tfor i in range(1, n):\r\n\t\tans += i\r\n\tprint(ans)\r\nelse:\t\r\n\tdt= {}\r\n\tfor i in a:\r\n\t\tif i in dt:\r\n\t\t\tdt[i] += 1\r\n\t\telse:\r\n\t\t\tdt[i] = 1\r\n\tans = dt[a[0]] * dt[a[n-1]]\r\n\tprint(ans)\r\n\r\n\r\n# 1 1 1 1 1 1 1", "count = int(input())\r\ns = list(map(int, input().split()))\r\nprint(max(s)-min(s), end=' ')\r\nif max(s) == min(s):\r\n\tprint((count-1)*count//2)\r\nelse:\r\n\tprint(s.count(max(s))*s.count(min(s)))", "n = int(input())\r\nb = list(map(int, input().split()))\r\nmax_b = max(b)\r\nmin_b = min(b)\r\ndif = max_b - min_b\r\nc_max = b.count(max_b)\r\nc_min = b.count(min_b)\r\nif max_b == min_b:\r\n ways = (c_max*(c_min-1)) // 2\r\nelse:\r\n ways = c_max * c_min\r\nprint(dif, ways)", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = max(a)\r\n mi = min(a)\r\n if m == mi:\r\n print(m - mi, n * (n - 1) // 2)\r\n else:\r\n print(m - mi, a.count(m) * a.count(mi))\r\n \r\nmain()", " \r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n#print = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n \r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n\r\nn = II()\r\nb = SLMII()\r\n\r\nl = r = 1\r\n\r\nwhile True:\r\n if l < n and b[l-1] == b[l]:\r\n l += 1\r\n continue\r\n if n-r > 0 and b[n-r] == b[n-r-1]:\r\n r += 1\r\n continue\r\n break\r\n\r\ndiff = b[-1] - b[0]\r\nprint(diff, l*r if diff else (n*(n-1))//2)\r\n \r\n ", "from collections import Counter\r\nn = int(input())\r\nls=[int(num) for num in input().split()]\r\nls.sort()\r\ntarget = ls[len(ls)-1] - ls[0]\r\ncounts = (Counter(ls))\r\n\r\nif(ls[0]!=ls[len(ls)-1]):\r\n print(f\"{target} {counts[ls[0]] * counts[ls[len(ls)-1]]}\")\r\n\r\nelse:\r\n print(f\"{target} {(n)*(n-1)//2}\")\r\n\r\n\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nif(max(lst)==min(lst)):\r\n n-=1\r\n print(max(lst)-min(lst),int((n*(n+1))/2))\r\nelse:\r\n print(max(lst)-min(lst),lst.count(max(lst))*lst.count(min(lst)))", "num = int(input())\r\nnum2 = input()\r\nli = []\r\nlis = []\r\nl = num2.split(\" \")\r\nmax = None\r\nfor i in l:\r\n li.append(int(i))\r\n lis.append(int(i))\r\nli.sort(reverse=True)\r\nmax = li[0]-li[-1]\r\n\r\nlis.sort()\r\n\r\ncount = 0\r\nif max == 0:\r\n print(0,num*(num-1)// 2,end=\" \")\r\nelse:\r\n large = 0\r\n min = 0\r\n for i in li:\r\n if i == li[0]:\r\n large+=1\r\n elif i == li[-1]:\r\n min += 1\r\n print(max, large*min)\r\n# for i in range(len(li)):\r\n# for j in range(len(lis)):\r\n# if li[i] == li[0] and li[j] == lis[0]:\r\n# count += 1\r\n\r\n\r\n# print(max,end=\" \")\r\n# print(count)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nif b[0] == b[-1] :\r\n print(0, (n*(n-1))//2)\r\nelse :\r\n left = 1\r\n for i in range (1,n) :\r\n if b[i] == b[i-1] : left += 1\r\n else : break\r\n right = 1\r\n for i in range (2,n+1) :\r\n if b[-i] == b[-i+1] : right += 1\r\n else : break\r\n print(b[-1]-b[0], left*right)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nmaxi=-1\r\nlow,high=a[0],a[-1]\r\nif low==high:\r\n print(0,(n*(n-1))//2)\r\nelse:\r\n f=0\r\n l=0\r\n for i in range(n):\r\n if a[i]==low:\r\n f+=1\r\n else:\r\n break\r\n for i in range(n-1,-1,-1):\r\n if a[i]==high:\r\n l+=1\r\n else:\r\n break\r\n print(abs(low-high),f*l)\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\na=max(b)\r\nc=min(b)\r\nprint(a-c,end=' ')\r\nif a!=c:\r\n print(b.count(a)*b.count(c))\r\nelse:\r\n print(b.count(a)*(b.count(a)-1)//2)", "n=int(input())\r\nl=list(map(int,input().split( )))\r\nl.sort()\r\nmaxi=l[-1]\r\nmini=l[0]\r\ndif=maxi-mini\r\nm=0\r\np=0\r\nfor i in l:\r\n if i==maxi:\r\n m+=1\r\n if i==mini:\r\n p+=1\r\nif len(set(l))==1:\r\n print(dif,n*(n-1)//2)\r\nelse:\r\n print(dif,m*p)", "input()\r\nseq = tuple(map(int, input().split()))\r\nmn = min(seq)\r\nmx = max(seq)\r\n\r\ncnt = seq.count(mx) * seq.count(mn)\r\n\r\nif mx - mn == 0:\r\n cnt = len(seq) * (len(seq) - 1) // 2\r\n\r\nprint(mx - mn, cnt)\r\n", "from collections import Counter\n\n\"\"\"\nn flowers\nn_i has b_i beauty\n\npairs of flowers with max beauty diff\n\noutput: max beauty diff\nnum of ways pashmack can pick the flowers\n\"\"\"\nn = int(input())\na = list(map(int, input().split()))\n\nmi = min(a)\nma = max(a)\n\ncounts = Counter(a)\ns = ((n-1)/2) * (1+n-1)\nprint(ma-mi, counts[mi] * counts[ma] if mi != ma else int(s))\n\n\"\"\"\n3\n1 1 1\n\nn-1, n-2\n\nn-1, n-2, n-3\n\n3/2 * 4\n\n\n1\nstart at 1\nstop when equal to 2\n\n\n\n\"\"\"", "n = int(input())\nb = list(map(int, input().split()))\n\nmax_b = max(b)\nmin_b = min(b)\nc_max = b.count(max_b)\nc_min = b.count(min_b)\n\ndiff = max_b - min_b\n\nif max_b == min_b:\n ways = (c_max * (c_max - 1)) // 2\nelse:\n ways = c_max * c_min\n\nprint(diff, ways)\n\n\t \t \t\t \t\t \t\t\t \t\t \t", "def im(): return map(int, input().split())\r\ndef il(): return list(map(int, input().split()))\r\ndef ii(): return int(input())\r\nxx=lambda n:int(n * (n - 1) / 2)\r\n\r\ndef solve():\r\n n=ii()\r\n a=il()\r\n x,y=max(a),min(a)\r\n\r\n if x==y:\r\n return 0,xx(a.count(x))\r\n maxbeaty = x - y\r\n maxways = a.count(x) * a.count(y)\r\n\r\n return maxbeaty,maxways\r\nif __name__ == '__main__':\r\n print(*solve())", "def main():\r\n n = int(input())\r\n b = list(map(int, input().split()))\r\n\r\n smallest = min(b)\r\n biggest = max(b)\r\n\r\n diff = biggest - smallest\r\n\r\n count_smallest = b.count(smallest)\r\n count_biggest = b.count(biggest)\r\n\r\n if smallest == biggest:\r\n possibilities = n * (n - 1) // 2\r\n else:\r\n possibilities = count_smallest * count_biggest\r\n\r\n print(diff, possibilities) \r\n \r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=max(b)\r\nd=min(b)\r\ne= b.count(c)\r\nf=b.count(d)\r\nif c==d:\r\n print(0, (e)*(e-1)//2)\r\nelse:\r\n print(c-d, e*f)", "n,a = int(input()),list(map(int,input().split()))\r\nd = max(a) - min(a)\r\ne = a.count(max(a))*a.count(min(a)) if d else (n*(n-1))//2\r\nprint(d,e)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nq=a[n-1]-a[0]\r\n# print(a,q)\r\nc=0\r\nif a[0]==a[n-1]:\r\n print(q,(n-1)*n//2)\r\nelse:\r\n x,y=1,1\r\n for i in range(1,n-1):\r\n if a[i]==a[0]:\r\n x+=1\r\n elif a[i]==a[n-1]:\r\n y+=1\r\n print(q,x*y)\r\n# for i in range(n):\r\n# for j in range(i+1,n):\r\n# if abs(a[i] - a[j])>=q:\r\n# c+=1\r\n# print(q,c)\r\n# for i in range(n):\r\n# if abs(a[i]-a[n-1-i])==q:\r\n# c+=1\r\n# print(c)\r\n# if n<=3:\r\n# print(q,c)\r\n# else:\r\n# print(q,c+2)\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[n-1]-l[0], end=\" \")\r\n\r\nans=l.count(l[0]) * l.count(l[n-1])\r\nif l[0]==l[n-1]:\r\n if n==2:\r\n ans=1\r\n else:\r\n ans= ((n-1)*(n))//2\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\na=l[0]\r\nb=l[-1]\r\nca,cb=0,0\r\nif a==b:\r\n print(b-a,end=\" \")\r\n print(n*(n-1)//2)\r\nelse:\r\n for i in l:\r\n if i==a:\r\n ca+=1\r\n if i==b:\r\n cb+=1\r\n print(b-a,end=\" \")\r\n print(ca*cb)", "n = int(input())\r\nlis = list(map(int, input().split()))\r\nlis.sort()\r\nmins = lis.count(lis[0])\r\nmaxs = lis.count(lis[-1])\r\nres = mins * maxs\r\nif lis[0] == lis[-1]:\r\n res = (mins*(mins-1))//2\r\nprint(lis[-1] - lis[0], res)", "n = int(input())\r\na = sorted(map(int, input().split()))\r\nif len(set(a)) == 1:\r\n print(0, n * (n - 1) // 2)\r\nelse:\r\n print(a[-1] - a[0], a.count(a[-1]) * a.count(a[0]))", "n = int(input())\r\na = list(map(int,input().split()))\r\nmax_diff = max(a)-min(a)\r\nnum_ways = a.count(max(a))*a.count(min(a))\r\nif(max_diff == 0) :\r\n num_ways = a.count(max(a))*(a.count(max(a))-1)//2\r\nprint(max_diff,num_ways)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif([l[0]]*n== l):\r\n print(0,n*(n-1)//2)\r\nelse:\r\n a=l.count(max(l))\r\n b=l.count(min(l))\r\n print(max(l)-min(l) ,a*b)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nx = l[-1] - l[0]\r\nif x == 0:\r\n print(x,(n*(n-1))//2)\r\nelse:\r\n a = l.count(l[0])\r\n b = l.count(l[-1])\r\n print(x, a * b, sep=\" \")\r\n", "n = int(input())\r\nflowers = list(map(int, input().split()))\r\n\r\nflowers.sort()\r\n\r\nmax_beauty = flowers[-1]\r\nmin_beauty = flowers[0]\r\nmax_diff = max_beauty - min_beauty\r\n\r\nmax_count = flowers.count(max_beauty)\r\nmin_count = flowers.count(min_beauty)\r\n\r\nif max_beauty == min_beauty:\r\n num_ways = n * (n - 1) // 2\r\nelse:\r\n num_ways = max_count * min_count\r\n\r\nprint(max_diff, num_ways)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmaxa = max(a)\r\nmina = min(a)\r\nif maxa == mina:\r\n print(maxa-mina,n*(n-1)//2)\r\nelse:\r\n print(maxa-mina,a.count(maxa)*a.count(mina))", "n = int(input())\r\n\r\nb = [int(x) for x in input().split()]\r\n\r\na = max(b) - min(b)\r\nc = b.count(max(b))* b.count((min(b)))\r\nif a == 0:\r\n c = (n * (n - 1))// 2\r\nprint(a, c)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nsx = 0\r\nmx = 0\r\nm = l[-1]\r\ns = l[0]\r\ni = 0\r\nif(s==m):\r\n ans = n*(n-1)//2\r\nelse:\r\n while(i<n-1 and l[i]==s):\r\n i = i + 1\r\n sx = sx + 1\r\n i = n-1\r\n while(i>0 and l[i]==m):\r\n i = i-1\r\n mx = mx + 1\r\n ans = sx*mx\r\nprint(m-s , ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nminVal = float(\"inf\")\r\nminCount = 0\r\nmaxVal = float(\"-inf\")\r\nmaxCount = 0\r\n\r\nfor i in range(n):\r\n if minVal>a[i]:\r\n minVal = a[i]\r\n minCount = 1\r\n elif minVal==a[i]:\r\n minCount+=1\r\n\r\n if maxVal<a[i]:\r\n maxVal = a[i]\r\n maxCount = 1\r\n elif maxVal == a[i]:\r\n maxCount+=1\r\n\r\nif maxVal==minVal:\r\n if n%2==0:\r\n print(0,((n//2)*(n-1)))\r\n else:\r\n print(0,((n-1)//2)*(n))\r\n exit()\r\n\r\nprint(maxVal-minVal,maxCount*minCount)", "class PashmakandFlowers:\r\n number = 0\r\n b = list()\r\n maxDiff = 0\r\n options = 0\r\n\r\n def solve(self):\r\n maxElem = self.b[0]\r\n maxElemCount = 1\r\n minElem = self.b[0]\r\n minElemCount = 1\r\n for i in range(1,len(self.b)):\r\n if(self.b[i] > maxElem):\r\n maxElem = self.b[i]\r\n maxElemCount = 1\r\n elif(self.b[i] == maxElem):\r\n maxElemCount+=1\r\n\r\n if(self.b[i] < minElem):\r\n minElem = self.b[i]\r\n minElemCount = 1\r\n elif(self.b[i] == minElem):\r\n minElemCount +=1\r\n\r\n\r\n self.maxDiff = maxElem-minElem\r\n self.options = maxElemCount*minElemCount\r\n if(self.maxDiff==0):\r\n import math\r\n val = math.sqrt(self.options)\r\n self.options = int(((val)*(val-1))/2)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n pf = PashmakandFlowers()\r\n pf.n = int(input())\r\n pf.b = list(map(int, input().split()))\r\n pf.solve()\r\n print (pf.maxDiff,pf.options)", "n = int(input())\r\nL = list(map(int,input().strip().split()))\r\n\r\nL.sort()\r\nminvalue = L[0]\r\nmaxvalue = L[-1]\r\n\r\nmincount = 0\r\nmaxcount = 0\r\nif(maxvalue==minvalue):\r\n maxcount = n\r\n mincount = n\r\n frequency = int(((maxcount)*(maxcount-1))/2)\r\nelse:\r\n for i in range(n):\r\n if(L[i]==minvalue):\r\n mincount=mincount+1\r\n else:\r\n break\r\n\r\n for i in range(n-1,-1,-1):\r\n if(L[i]==maxvalue):\r\n maxcount=maxcount+1\r\n else:\r\n break\r\n frequency = (mincount)*(maxcount)\r\n\r\ndifference = maxvalue - minvalue\r\n\r\n \r\nprint(difference,frequency)\r\n", "import math\r\nz=int(input())\r\ni = []\r\nfor a in input().split():\r\n i.append( int(a) )\r\nb=min(i)\r\na=max(i)\r\nif (a-b)==0:\r\n print(a-b,(i.count(a)*(i.count(b)-1))//2)\r\nelse:\r\n print(a-b,i.count(a)*i.count(b))\r\n", "n=int(input())\r\nt=input().split()\r\nt=[int(x) for x in t]\r\nt.sort()\r\nif t[0]==t[-1]:\r\n ct=0\r\n for i in range(1,n):\r\n ct+=n-i\r\n print(t[-1]-t[0],ct)\r\n\r\nelse:\r\n print(t[-1]-t[0],t.count(t[-1])*t.count(t[0]))\r\n ", "n = int(input())\r\nb = list(map(int, input().split()))\r\nma, mi = max(b), min(b)\r\nMa, Mi = b.count(ma), b.count(mi)\r\nprint(ma - mi, end = \" \")\r\nprint([Ma*Mi, n*(n-1)//2][ma == mi])", "n=int(input())\r\na=list(map(int,input().split()))\r\nq=max(a)\r\nw=min(a)\r\ne=0\r\nr=0\r\nif q!=w:\r\n for i in range(n):\r\n if a[i]==q:\r\n e+=1\r\n elif a[i]==w:\r\n r+=1\r\n print(q-w,e*r)\r\nelse:\r\n print(0,n*(n-1)//2)", "n = int(input())\r\nf = list(map(int, input().split()))\r\na, b = 1, 1\r\n\r\nf.sort()\r\nd = f[-1] - f[0]\r\n\r\nif f[0] == f[-1]:\r\n print(d, (n - 1) * n // 2)\r\nelse:\r\n for j in range(1, n - 1):\r\n if f[j] == f[-1]:\r\n a += 1\r\n elif f[j] == f[0]:\r\n b += 1\r\n print(d, a * b)\r\n", "a=int(input())\r\nA=list(map(int, input().split()))\r\nm=min(A)\r\nn=max(A)\r\nk=n-m\r\nif k!=0:\r\n r=A.count(m)*A.count(n)\r\nelif k==0:\r\n r=int(a*(a-1)/2)\r\nprint(str(k)+' '+str(r))", "n=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nl=max(b)\r\nm=min(b)\r\nif l==m:\r\n print(0,n*(n-1)//2,sep=\" \")\r\nelse:\r\n print(l-m,b.count(l)*b.count(m))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmaximum = -1\r\nminimum = float('inf')\r\nmax_count = 0\r\nmin_count = 0\r\n\r\nfor num in a:\r\n if num > maximum:\r\n maximum = num\r\n max_count = 1\r\n elif num == maximum:\r\n max_count += 1\r\n \r\n if num < minimum:\r\n minimum = num\r\n min_count = 1\r\n elif num == minimum:\r\n min_count += 1\r\n\r\nif maximum == minimum:\r\n print(\"0\", (min_count - 1) * min_count // 2)\r\nelse:\r\n print(maximum - minimum, min_count * max_count)\r\n", "n = int(input())\r\nbeauties = list(map(int, input().split()))\r\n\r\nmax_beauty = max(beauties)\r\nmin_beauty = min(beauties)\r\nmax_count = beauties.count(max_beauty)\r\nmin_count = beauties.count(min_beauty)\r\n\r\nif max_beauty == min_beauty:\r\n max_diff = 0\r\n ways = max_count * (max_count - 1) // 2\r\nelse:\r\n max_diff = max_beauty - min_beauty\r\n ways = max_count * min_count\r\n\r\nprint(max_diff, ways)\r\n", "input()\r\ns = list(map(int, input().split(\" \")))\r\ns.sort()\r\nlenf = len(s)\r\nif(s[-1]-s[0] != 0):\r\n print(s[-1]-s[0], s.count(s[0])*s.count(s[-1]))\r\nelse:\r\n print(s[-1] - s[0], int(lenf*(lenf-1)/2))", "n=int(input())\r\nb=list(map(int,input().split()))\r\ndiff=max(b)-min(b)\r\nif max(b)!=min(b):\r\n\r\n ans=b.count(max(b))*b.count(min(b))\r\nelse:\r\n ans=(n*(n-1))//2\r\nprint(diff,ans)\r\n\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nmn = min(s)\r\nmx = max(s)\r\nif mx != mn:\r\n print(mx - mn, s.count(mx)*s.count(mn))\r\nelse:\r\n print(0, sum([i for i in range(1, s.count(mx))]))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif len(set(a)) == 1:\r\n diff = 0\r\n count = ((len(a) - 1) * len(a)) // 2\r\n print(diff, count)\r\nelse:\r\n diff = max(a) - min(a)\r\n count = a.count(max(a)) * a.count(min(a))\r\n print(diff, count)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nma, mi = max(b), min(b)\r\nca, ci = b.count(ma), b.count(mi)\r\nif ma == mi:\r\n print(0, ca * (ca - 1) // 2)\r\nelse:\r\n print(ma - mi, ca * ci)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nmi, ma = min(lst), max(lst)\r\nif mi == ma:\r\n print(f'{ma - mi} {n * (n-1) // 2}')\r\nelse:\r\n cMi, cMa = lst.count(mi), lst.count(ma)\r\n print(f'{ma - mi} {cMi * cMa}')", "import operator as op\nfrom functools import reduce\n\ndef ncr(n, r):\n r = min(r, n-r)\n numer = reduce(op.mul, range(n, n-r, -1), 1)\n denom = reduce(op.mul, range(1, r+1), 1)\n return numer / denom\n\ninp=lambda:map(int,input().split())\nn = int(input())\nl = list(inp())\n\nif max(l)!=min(l):\n print(max(l)-min(l), l.count(max(l)) * l.count(min(l)))\nelse:\n print(max(l)-min(l), int(ncr(l.count(max(l)), 2)))\n\t\t\t\t\t \t \t\t \t\t\t\t \t \t \t\t", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nsmallest = min(a)\r\nlargest = max(a)\r\n\r\ncnt_s = a.count(smallest)\r\ncnt_l = a.count(largest)\r\n\r\nif smallest == largest:\r\n print(0, cnt_s * (cnt_s - 1) // 2)\r\nelse:\r\n print(largest - smallest, cnt_s * cnt_l)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nprint(b[-1] - b[0], end=\" \")\r\nif b[-1] == b[0]:\r\n print(int(n * (n - 1) / 2))\r\nelse:\r\n print(b.count(b[0]) * b.count(b[-1]))", "import sys\r\nfrom collections import Counter\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n array:list[int] = []\r\n input()\r\n array = list(map(int, input().split()))\r\n\r\n\r\n maximumBeautyDifference:int = 0\r\n MIN_BEAUTY:int = min(array)\r\n MAX_BEAUTY:int = max(array)\r\n maximumBeautyDifference = MAX_BEAUTY - MIN_BEAUTY\r\n\r\n numberOfWays:int = 0\r\n COUNT_DIC:dict[int, int] = dict(Counter(array)) \r\n if MIN_BEAUTY == MAX_BEAUTY : numberOfWays = COUNT_DIC[MIN_BEAUTY]*(COUNT_DIC[MIN_BEAUTY]-1)//2\r\n else : numberOfWays = COUNT_DIC[MIN_BEAUTY] * COUNT_DIC[MAX_BEAUTY]\r\n\r\n\r\n print(maximumBeautyDifference, numberOfWays)\r\n\r\nmain()", "from collections import Counter\r\nfrom sys import stdin\r\n\r\n\r\ndef solve(A):\r\n count = Counter(A)\r\n mn = min(count)\r\n mx = max(count)\r\n\r\n if mx == mn:\r\n print(0, count[mn] * (count[mn] - 1) // 2)\r\n else:\r\n print(mx - mn, count[mn] * count[mx])\r\n\r\n\r\nstdin.readline()\r\nA = [int(x) for x in stdin.readline().split()]\r\n\r\nsolve(A)\r\n", "n = int(input())\r\na = [*map(int, input().split())]\r\nmx = max(a)\r\nmn = min(a)\r\nif mx == mn:\r\n print(0, a.count(mx)*(a.count(mx)-1)//2)\r\nelse:\r\n print(mx-mn, a.count(mx)* a.count(mn))", "n = int(input())\r\nflowers = list(map(int, input().split()))\r\n\r\nmin_flower = min(flowers)\r\nmax_flower = max(flowers)\r\n\r\nif min_flower == max_flower:\r\n print(0)\r\n print(n * (n - 1) // 2)\r\nelse:\r\n difference = max_flower - min_flower\r\n cnt_min = flowers.count(min_flower)\r\n cnt_max = flowers.count(max_flower)\r\n print(difference)\r\n print(cnt_min * cnt_max)\r\n", "x=int(input())\r\nls1=list(map(int,input().split()))\r\nif max(ls1)!=min(ls1):\r\n print(max(ls1)-min(ls1),ls1.count(max(ls1))*ls1.count(min(ls1)))\r\nelse:\r\n print(max(ls1)-min(ls1),int(x*(x-1)/2))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl=[\"0\"]+l+[\"0\"]\r\nif l[1]==l[-2] : \r\n su=0\r\n for i in range(1,n) :\r\n su+=i\r\n print(l[-2]-l[1],su)\r\nelse :\r\n i=1\r\n i1=1\r\n while l[i]==l[i+1] :\r\n i+=1\r\n i1+=1\r\n j=n\r\n j1=1\r\n while l[j]==l[j-1] :\r\n j-=1\r\n j1+=1\r\n print(l[-2]-l[1],j1*i1)", "import math\r\nn = int(input())\r\na = list(map(int, input().split(\" \")))\r\nresult = max(a)-min(a)\r\nmax1 = a.count(max(a))\r\nmin1 = a.count(min(a))\r\nc = 0\r\nif max1 == len(a) or min1 == len(a):\r\n c = (n*(n-1))/2\r\nelse:\r\n c = max1*min1\r\nprint(result, int(c))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\na = w.count(w[0])\r\nb = w.count(w[-1])\r\nif w[0] != w[-1]:\r\n print(w[-1]-w[0], a*b)\r\nelse:\r\n print(0, a*(a-1)//2)", "# cook your dish here\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\na=l[0]\r\nb=l[n-1]\r\nc=l.count(a)\r\nd=l.count(b)\r\ne=c*d\r\nif a==b:\r\n e= (n*(n-1))//2\r\nprint(b-a,e)", "import sys\r\nfrom collections import Counter\r\n\r\nn = int(sys.stdin.readline().strip())\r\na = list(map(int, sys.stdin.readline().split()))\r\nc = Counter(a)\r\n\r\nmi, ma = float('inf'), float('-inf')\r\n\r\nfor k in c.keys():\r\n mi = min(mi, k)\r\n ma = max(ma, k)\r\n\r\nprint(ma - mi, end = ' ')\r\n\r\nif mi != ma:\r\n print(c[mi] * c[ma])\r\nelif mi == ma:\r\n print(c[mi] * (c[mi] - 1) // 2)\r\n", "ii = lambda: int(input())\r\nil = lambda: map(int, input().split())\r\n\r\ndef f(n, l):\r\n\tdef g(l):\r\n\t\tk, a = l.pop(), 1\r\n\t\twhile l and k == l.pop():\r\n\t\t\ta += 1\r\n\t\treturn k, a\r\n\tk, a, t, b = *g(l[::]), *g(l[::-1])\r\n\treturn f\"{k-t} {a*b if k != t else (n*(n-1))//2}\"\r\n\r\nprint(f(ii(), sorted(il())))", "n=int(input())\r\nb=list(map(int,input().split()))\r\nprint(max(b)-min(b), end=' ')\r\nif min(b)==max(b): print(b. count(min(b)) *(b. count(min(b)) -1)//2)\r\nelse: print(b.count(min(b))*b.count(max(b)))", "n = int(input())\r\na = sorted(map(int,input().split()))\r\nmx = a[n-1]\r\nmn = a[0]\r\nprint(mx-mn,end = ' ')\r\nif mx == mn:\r\n print(n*(n-1)//2)\r\nelse:\r\n d = 0\r\n for i in range(n):\r\n if a[i] != mn:\r\n break\r\n d+=1\r\n \r\n e = 0\r\n for i in range(n-1,-1,-1):\r\n if a[i] != mx:\r\n break\r\n e+=1\r\n print(d*e)", "n = int(input())\r\nwah = sorted(map(int, input().split(' ')))\r\nminn, maxn = wah[0], wah[-1]\r\nmax_delta = maxn - minn\r\nminn_c = 1\r\nmaxn_c = 1\r\nif max_delta == 0:\r\n cnt = 0\r\n for i in range(1, n):\r\n cnt += i\r\n print(0, cnt)\r\nelse:\r\n min_f, max_f = True, True\r\n a, b = 1, -2\r\n while min_f or max_f:\r\n if wah[a] == minn:\r\n minn_c += 1\r\n a += 1\r\n else:\r\n min_f = False\r\n if wah[b] == maxn:\r\n maxn_c += 1\r\n b -= 1\r\n else:\r\n max_f = False\r\n print(max_delta, minn_c * maxn_c)\r\n", "n = int(input())\r\nflowers = list(map(int, input().split()))\r\n\r\nmin_flower = min(flowers)\r\nmax_flower = max(flowers)\r\n\r\nmin_count = flowers.count(min_flower)\r\nmax_count = flowers.count(max_flower)\r\n\r\nif min_flower == max_flower:\r\n ways = n*(n-1)//2\r\nelse:\r\n ways = min_count * max_count\r\n\r\nprint(max_flower - min_flower, ways)\r\n", "\"\"\"\r\n## NOTE\r\n- good question\r\n- this is somehow a 2-sum question, assking for all the combinations that can make the sum\r\n\r\n## INFO\r\n459_B_PashmakAndFlowers\r\nhttps://codeforces.com/problemset/problem/459/B\r\n\r\n## TAGS\r\n- combinatorics\r\n- implementation\r\n- sortings\r\n- *1300\r\n\r\n## TESTS\r\n-in:\r\n2\r\n1 2\r\n-out:\r\n1 1\r\n-in:\r\n3\r\n1 4 5\r\n-out:\r\n4 1\r\n-in:\r\n5\r\n3 1 2 3 1\r\n-out:\r\n2 4\r\n\"\"\"\r\n\r\n#%%\r\n\r\nimport math\r\nimport sys\r\nimport time\r\nfrom collections import Counter\r\n\r\nstart_time = time.time()\r\nFILE = False\r\n\r\n# ---------------------- HELPER INPUT FUNCTIONS ----------------------#\r\n\r\n\r\ndef get_int():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef get_str():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef get_list_int():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_list_str():\r\n return list(sys.stdin.readline().split())\r\n\r\n\r\n# -------------------------- SOLVE FUNCTION --------------------------#\r\n\r\n\r\ndef solve():\r\n \"\"\"\r\n say arr = [3, 1, 2 ,3, 1]\r\n 0 1 2 3 4\r\n diff = 2\r\n all combinations of 3 and 1 (index)\r\n (0, 1) (0, 4) (1, 3) (3, 4) <-- 4 pairs\r\n 3: 2\r\n 1: 2\r\n 2: 1\r\n\r\n \"\"\"\r\n n = get_int()\r\n arr = get_list_int()\r\n diff = max(arr) - min(arr)\r\n cnt = Counter(arr)\r\n if diff == 0:\r\n # all numbers are the same\r\n # picking 2 out of n numbers is the answer\r\n print(0, (n * n - n) // 2)\r\n return\r\n\r\n print(diff, cnt[max(arr)] * cnt[min(arr)])\r\n\r\n\r\n# -------------------------- MAIN FUNCTION --------------------------#\r\n\r\n\r\ndef main():\r\n if FILE:\r\n sys.stdin = open(\"./src/codeforces/input.txt\", \"r\")\r\n\r\n solve()\r\n\r\n if FILE:\r\n print(\"\\033[96m\" + \"> time elapsed: \", (time.time() - start_time) * 1000.0, \"ms\")\r\n\r\n\r\nmain()\r\n", "\r\nn=int(input())\r\nflowers=list(map(int,input().split()))\r\n \r\nMin_f=min(flowers);Max_f=max(flowers)\r\nx,y=flowers.count(Min_f),flowers.count(Max_f)\r\nif Min_f==Max_f:\r\n print(0,x*(x-1)//2)\r\nelse:\r\n print(Max_f-Min_f,x*y)\r\n", "s = [*open(0)][1]\r\n# s = input()\r\ns = list(map(int, s.split()))\r\ns.sort()\r\nn = len(s)\r\nnum1 = num2 = 1\r\nfor i in range(n - 1):\r\n if s[i] == s[i + 1]:\r\n num1 += 1\r\n else:\r\n break\r\nfor i in range(1, n):\r\n if s[-i] == s[-i - 1]:\r\n num2 += 1\r\n else:\r\n break\r\nif s[-1] - s[0]:\r\n print(s[-1] - s[0], num1 * num2)\r\nelse:\r\n print(0, n * (n - 1) // 2)", "from collections import Counter\r\n\r\nn = int(input())\r\nflowers = list(map(int, input().split()))\r\n\r\n# Find the minimum and maximum beauty values\r\nmin_beauty = min(flowers)\r\nmax_beauty = max(flowers)\r\n\r\n# Count the frequency of the minimum and maximum beauty values\r\nmin_beauty_count = flowers.count(min_beauty)\r\nmax_beauty_count = flowers.count(max_beauty)\r\n\r\n# Calculate the maximum beauty difference\r\nmax_beauty_diff = max_beauty - min_beauty\r\n\r\n# If the flowers are the same, there's only one way to pick them\r\nif min_beauty == max_beauty:\r\n ways_to_pick = n * (n - 1) // 2\r\nelse:\r\n ways_to_pick = min_beauty_count * max_beauty_count\r\n\r\nprint(max_beauty_diff, ways_to_pick)\r\n", "\nn = int(input()) - 1\nflowers = list(map(int, input().split(' ')))\n\nflowers_min = min(flowers)\nflowers_max = max(flowers)\n\ndifference = flowers_max - flowers_min\nif difference:\n print(difference, flowers.count(flowers_min) * flowers.count(flowers_max))\nelse:\n print(0, int(((2 + (n-1))/2)*n)) # Арифметическая прогрессия", "n = int(input())\r\nflowers = list(map(int, input().split()))\r\n\r\nmax_beauty = max(flowers)\r\nmin_beauty = min(flowers)\r\n\r\nif max_beauty == min_beauty:\r\n ways = n*(n-1)//2\r\nelse:\r\n max_count = flowers.count(max_beauty)\r\n min_count = flowers.count(min_beauty)\r\n ways = max_count * min_count\r\n\r\nprint(max_beauty - min_beauty, ways)\r\n", "n = int(input())\r\nb = sorted(list(map(int, input().split())))\r\nmx = b[-1]-b[0]\r\nif len(set(b)) == 1:\r\n print(mx,(n*(n-1))//2)\r\nelse:\r\n res = b.count(b[-1])*b.count(b[0])\r\n print(mx, res)", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nmx=max(a)\r\nmi=min(a)\r\nprint(mx-mi,end=' ')\r\nprint(n*(n-1)//2 if mx==mi else a.count(mx)*a.count(mi))\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n#carpe diem \r\n#carpe diem", "# https://codeforces.com/problemset/problem/459/B\n\nfrom collections import Counter\n\n\ndef helper() -> str:\n input()\n values = sorted([int(s) for s in input().split(\" \")])\n value_counts = Counter(values)\n max_value = values[-1] - values[0]\n total = 0\n\n for key in sorted(value_counts.keys()):\n other_value = max_value + key\n if other_value != key and other_value in value_counts:\n total += value_counts[key] * value_counts[other_value]\n del value_counts[key]\n del value_counts[other_value]\n elif other_value == key:\n total += (value_counts[key] * (value_counts[key] - 1)) // 2\n del value_counts[key]\n\n return f\"{max_value} {total}\"\n\n\nprint(helper())\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmin_count = a.count(a[0])\r\nmax_count = a.count(a[-1])\r\nif a[0] == a[-1]:\r\n print(0, max_count * (max_count - 1) // 2)\r\nelse:\r\n print(a[-1] - a[0], min_count * max_count)", "n=int(input())\r\na=list(map(int,input().split()))\r\ni,j=min(a),max(a)\r\nprint(j-i,[(n*(n-1))//2,a.count(i)*a.count(j)][i!=j])", "n=int(input())\r\nl=list(map(int,input().split()) )\r\nmaxi=max(l)\r\nmini=min(l)\r\nmxc=l.count(maxi)\r\nmnc=l.count(mini)\r\nif maxi!=mini:\r\n print(maxi-mini,mxc*mnc)\r\nelse:\r\n print(0,(mxc*(mxc-1))//2)", "from collections import Counter\r\n\r\n\r\ndef main():\r\n n = get_int()\r\n flowers = get_list_int()\r\n count = Counter(flowers)\r\n\r\n min_f, max_f = min(flowers), max(flowers)\r\n diff = max_f - min_f\r\n\r\n ways = count[min_f] * count[max_f]\r\n if max_f == min_f:\r\n ways = (1 + (count[min_f] - 1)) * (count[min_f] - 1) // 2\r\n\r\n print(f\"{diff} {ways}\")\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxim = -1\r\nfor i in range(n):\r\n maxim = max(maxim, a[i])\r\nminim = maxim + 1\r\nfor i in range(n):\r\n minim = min(minim, a[i])\r\nif minim == maxim:\r\n print(0, n * (n - 1) // 2)\r\nelse:\r\n cnt1 = 0\r\n cnt2 = 0\r\n for i in range(n):\r\n if(a[i] == maxim):\r\n cnt1 += 1\r\n elif a[i] == minim:\r\n cnt2 += 1\r\n print(maxim - minim, cnt2 * cnt1)\r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nminn = min(arr)\r\nmaxx = max(arr)\r\n\r\nif minn == maxx:\r\n print(0, n * (n - 1) // 2)\r\nelse:\r\n print(maxx - minn, arr.count(minn) * arr.count(maxx))\r\n", "n=int(input())\r\nL=input().split()\r\nmaxm=0\r\nc1=0\r\nminm=float(\"inf\")\r\nc2=0\r\nfor i in range(n):\r\n a=int(L[i])\r\n if a<minm:\r\n minm=a\r\n c2=1\r\n elif a==minm:\r\n c2+=1\r\n if a>maxm:\r\n maxm=a\r\n c1=1\r\n elif a==maxm:\r\n c1+=1\r\nif minm==maxm:\r\n print(0,c1*(c1-1)//2)\r\nelse:\r\n print(maxm-minm,c1*c2)", "import itertools as it\r\nn=int(input())\r\nb=list(map(int, input().split()))\r\nm=min(b)\r\nM=max(b)\r\nif(m==M):\r\n print(0, b.count(m)*(b.count(m)-1)//2)\r\nelse:\r\n print(M-m, b.count(m)*b.count(M))\r\n", "n = int(input())\r\nflowers = list(map(int, input().split()))\r\nprint(max(flowers)-min(flowers), end=' ')\r\nif flowers.count(flowers[0]) == n:\r\n print(int(n*(n-1)/2))\r\nelse:\r\n print(int(flowers.count(max(flowers))*flowers.count(min(flowers))))\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\na=max(l1)-min(l1)\r\nb=l1.count(max(l1))*l1.count(min(l1))\r\nif a==0:\r\n b=(n*(n-1))//2\r\n\r\nprint(a,b)", "import heapq\r\nimport sys\r\nfrom collections import deque\r\nfrom math import sqrt, ceil, floor\r\nimport string\r\n\r\n# sys.setrecursionlimit(10**7)\r\n# mod = 1_000_000_007\r\n\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\nn = int(input().rstrip())\r\narr = list(map(int,input().rstrip().split()))\r\nmx = max(arr)\r\nmn = min(arr)\r\nt1 = arr.count(mx)\r\nt2 = arr.count(mn)\r\ncount = 0\r\nif mx == mn:\r\n ans = n * (n-1)//2\r\nelse:\r\n ans = t1*t2\r\nprint(\"%d %d\" %(mx-mn,ans))", "input()\r\na=list(map(int,input().split()))\r\nmn=min(a)\r\nmx=max(a)\r\nl=len(a)\r\nprint('%d %d'%(mx-mn,a.count(mx)*a.count(mn) if mx!=mn else l*(l-1)//2))", "n = int(input())\r\nflowers = list(map(int, input().split()))\r\n\r\nmax_beauty = max(flowers)\r\nmin_beauty = min(flowers)\r\n\r\nmax_diff = max_beauty - min_beauty\r\n\r\nif max_diff == 0:\r\n ways = n * (n - 1) // 2 \r\nelse:\r\n ways_max = flowers.count(max_beauty)\r\n ways_min = flowers.count(min_beauty)\r\n ways = ways_max * ways_min\r\n\r\nprint(max_diff, ways)\r\n", "'''\r\n AUTHOR : Vignat Tank\r\n DATE : 14-04-2023\r\n'''\r\n\r\n\r\ndef Vignat0905():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n print(a[-1] - a[0], end=\" \")\r\n x = a.count(a[0])\r\n y = a.count(a[-1])\r\n if (x == y == n):\r\n print(n * (n-1) // 2)\r\n else:\r\n print(x * y)\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nwhile (t):\r\n Vignat0905()\r\n t -= 1\r\n", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nmp = collections.Counter(b)\r\nmx, mn = max(mp), min(mp)\r\ndiff = mx - mn\r\nif mx == mn:\r\n print(diff, mp[mx]*(mp[mx]-1)//2)\r\n quit()\r\n\r\ncnt = 0\r\nmp.clear()\r\nfor x in b:\r\n cnt += mp[x+diff] + mp[x-diff]\r\n mp[x] += 1\r\nprint(diff, cnt)", "def sol(arr,n):\r\n arr = sorted(arr,reverse = True)\r\n diff = arr[0]-arr[-1]\r\n if diff == 0:\r\n k = n-1\r\n res = int(k*(k+1)/2)\r\n return [diff , res]\r\n h = arr[0]\r\n l = arr[-1]\r\n hcount = 0 \r\n lcount = 0 \r\n \r\n for i in range(n):\r\n if arr[i]==h:\r\n hcount+=1 \r\n elif arr[i]==l:\r\n lcount+=1 \r\n \r\n return [diff,hcount*lcount]\r\n \r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nans = sol(arr,n)\r\nprint(*ans)", "n=int(input())\r\nf=[int(x) for x in input().split()]\r\nf.sort()\r\ni=0\r\nj=-1\r\nwhile f[i+1]==f[i]:\r\n i+=1\r\n if i==n-1:\r\n break\r\nwhile f[j-1]==f[j]:\r\n j-=1\r\n if j==-n:\r\n break\r\nif f[-1]-f[0]!=0:\r\n print(f[-1]-f[0],abs((i+1)*j))\r\nelse:\r\n print(0,int(n*(n-1)/2))", "n=int(input())\r\nbeauty=list(map(int,input().split()))\r\nma=max(beauty)\r\nmi=min(beauty)\r\nif ma==mi:\r\n print(0,n*(n-1)//2)\r\nelse:\r\n print(ma-mi,beauty.count(ma)*beauty.count(mi)) ", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\na.sort()\r\nif a[0] == a[n - 1]:\r\n print(0,n*(n-1)//2)\r\nelse:\r\n i = 1\r\n while a[i] == a[0]:\r\n i += 1\r\n j = n - 2\r\n while a[j] == a[n - 1]:\r\n j -= 1\r\n print(a[n-1]-a[0],i*(n - j - 1))\r\n \r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ni,j = min(a),max(a)\r\nprint(j-i, (n*(n-1))//2 if i==j else a.count(i) * a.count(j))", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmx,mn=max(arr),min(arr)\r\nf=Counter(arr)\r\nprint([f\"{mx-mn} {max(1,int((f.get(mx)-1)*(f.get(mx)/2)))}\",f\"{mx-mn} {f.get(mx)*f.get(mn)}\"][mx!=mn])", "n=int(input())\r\nlst=list(map(int,input().split()))\r\na=max(lst)\r\nac=lst.count(a)\r\nb=min(lst)\r\nbc=lst.count(b)\r\nif a==b:\r\n print(0,n*(n-1)//2)\r\nelse:\r\n print(a-b,ac*bc)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Pashmak_and_Flowers():\r\n import math \r\n n = inp()\r\n flowerBeauty = inlt()\r\n flowerBeauty_sorted = sorted(flowerBeauty)\r\n\r\n minBeauty = flowerBeauty_sorted[0]\r\n maxBeauty = flowerBeauty_sorted[n-1]\r\n\r\n flowers_with_minBeauty = flowerBeauty_sorted.count(minBeauty)\r\n flowers_with_maxBeauty = flowerBeauty_sorted.count(maxBeauty)\r\n\r\n if minBeauty == maxBeauty:\r\n diff = maxBeauty - minBeauty\r\n ways = math.comb(n,2)\r\n print(str(diff) + ' ' + str(ways))\r\n else:\r\n diff = maxBeauty - minBeauty\r\n ways = flowers_with_maxBeauty * flowers_with_minBeauty\r\n print(str(diff) + ' ' + str(ways))\r\n\r\n return \r\n\r\nPashmak_and_Flowers()", "from math import factorial\r\n\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nd = l[n-1] - l[0]\r\n\r\na = l.count(l[0])\r\nb = l.count(l[n-1])\r\n\r\nc = a*b\r\nif d == 0:\r\n c = 0\r\n for i in range(n):\r\n c+=i\r\n\r\nprint(d, c)", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\na=max(l)\r\nb=min(l)\r\nprint(l[-1]-l[0])\r\nc=l.count(a)\r\nd=l.count(b)\r\nif a==b:\r\n print(int(((c*(c+1))/2)-c))\r\nelse:\r\n print(c*d)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nx=max(m)\r\ny=min(m)\r\na=b=0\r\nif(x==y and n==2):\r\n print(0,1,sep=' ')\r\nelif(x==y and n>2):\r\n sum=0\r\n for i in range(n):\r\n sum=sum+(n-i-1)\r\n print(0,sum,sep=' ')\r\nelse:\r\n for i in range(n):\r\n if (m[i] == x):\r\n a += 1\r\n if (m[i] == y):\r\n b += 1\r\n print(x - y, a * b, sep=' ')\r\n\r\n\r\n\r\n", "n = int(input())\nb = list(map(int, input().split()))\n\nmax_b = max(b)\nmin_b = min(b)\ncnt_max = b.count(max_b)\ncnt_min = b.count(min_b)\n\ndiff = max_b - min_b\n\nif max_b == min_b:\n ways = (cnt_max * (cnt_max - 1)) // 2\nelse:\n ways = cnt_max * cnt_min\n\nprint(diff, ways)\n\n\t\t\t \t\t\t\t\t\t \t \t \t \t\t\t\t\t \t\t", "n = int(input())\r\nbeauty_numbers = list(map(int, input().split()))\r\nmini = min(beauty_numbers)\r\nmaxi = max(beauty_numbers)\r\nmaximum_difference = maxi - mini\r\nif maximum_difference == 0:\r\n number_of_ways = (n - 1) * (n) // 2\r\nelse:\r\n number_of_ways = beauty_numbers.count(mini) * beauty_numbers.count(maxi)\r\nprint(maximum_difference, number_of_ways)", "def solve():\n N = int(input())\n A = list(map(int, input().split(' ')))\n hm = {}\n mn = float(\"inf\")\n mx = -mn \n for a in A:\n mn = min(mn, a)\n mx = max(mx, a) \n hm[a] = hm.get(a, 0) + 1\n if mn == mx:\n return [0, (hm[mx] * (hm[mx]-1))//2]\n else:\n return [mx- mn, hm[mn]*hm[mx]]\n\n\nprint(*solve())", "\"\"\"\n\np gives pair of flowers\nthere are n flowers\n\nith of them have beauty of bi \n\np doesn't want two most beautiful flower\n\np wants pairs of flowers that their diff is max\n\nnCR\n\n\n\"\"\"\nfrom collections import Counter\n\nn = int(input())\narr = list(map(int, input().split()))\n\narr.sort()\nm = Counter(arr)\ndiff = arr[-1] - arr[0]\np1, p2 = arr[-1], arr[0]\nif p1 == p2:\n print(diff, (m[p1] * (m[p1] - 1)) // 2)\nelse:\n print(diff, m[p1] * m[p2])\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\na.sort()\r\n\r\nif a[0]==a[-1]:\r\n if n%2==0:\r\n print(0,(n//2)*(n-1))\r\n else:\r\n print(0,((n-1)//2)*n)\r\n exit()\r\nl = 0\r\nr = -1\r\n\r\nwhile a[l]==a[0]:\r\n l+=1\r\nwhile a[r]==a[-1]:\r\n r-=1\r\n\r\nprint(a[-1]-a[0],l*(-r-1))\r\n", "import math\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nif n==2:\r\n print(max(a[0],a[1])-min(a[0],a[1]),1)\r\nelse:\r\n mn,mx= min(a),max(a)\r\n xc,mc=a.count(mx),a.count(mn)\r\n if xc==mc and mn==mx:\r\n print(mx-mn,math.comb(xc,2))\r\n else:\r\n print(mx-mn,mc*xc)", "input()\r\nb=list(map(int,input().split()))\r\nb.sort()\r\ndiff=b[-1]-b[0]\r\nM=b.count(b[-1])\r\nm=b.count(b[0])\r\nif b[-1]>b[0]:\r\n ways=M*m\r\nelse:\r\n ways=int((m-1)*m/2)\r\n\r\nprint(diff,ways)", "n=int(input())\r\nflowers=sorted(list(map(int,input().split())))\r\nif flowers[0]==flowers[-1]:\r\n print(0)\r\n print(n*(n-1)//2)\r\nelse:\r\n difference=flowers[-1]-flowers[0]\r\n cnt_min=len([x for x in flowers if x==flowers[0]])\r\n cnt_max=len([x for x in flowers if x==flowers[-1]])\r\n print(difference)\r\n print(cnt_min*cnt_max)", "from math import factorial as fac\r\nn = int(input())\r\n\r\nl = tuple(int(x) for x in input().split())\r\n\r\nma, mi = l[0], l[0]\r\n\r\na , b = 0,0 \r\nfor i in range(0,n):\r\n if l[i] > ma:\r\n ma = l[i]\r\n a = 1\r\n elif l[i] == ma:\r\n a +=1\r\n if l[i] < mi:\r\n mi = l[i]\r\n b = 1\r\n elif l[i] == mi:\r\n b +=1\r\nif a == n: print(0 , int(n*(n-1)/2) )\r\nelse: print(ma-mi, a*b)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nmin_ele = arr[0]\r\nmax_ele = arr[n-1]\r\nc_min = 1\r\nc_max = 1\r\nfor i in range(1,n):\r\n if arr[i] == min_ele:\r\n c_min+=1\r\nfor i in range(n-2,-1,-1):\r\n if arr[i] == max_ele:\r\n c_max+=1\r\n\r\nif arr[0] - arr[n-1] == 0:\r\n print(arr[0]-arr[n-1],n*(n-1)//2)\r\nelse:\r\n print(arr[n-1]-arr[0],c_min*c_max)", "k = int(input())\r\n#n, m = map(int, input().split())\r\n#s = input()\r\nc = list(map(int, input().split()))\r\np = dict()\r\nm = c[0]\r\nn = c[0]\r\np[m] = 1\r\nfor i in range(1, k):\r\n if c[i] > m:\r\n m = c[i]\r\n p[m] = 1\r\n \r\n elif c[i] == m:\r\n p[m] += 1\r\n else:\r\n if c[i] < n:\r\n n = c[i]\r\n p[n] = 1\r\n elif c[i] == n:\r\n p[n] += 1 \r\nif m != n:\r\n print(m - n, p[n] * p[m]) \r\nelse:\r\n print(0, p[n]*(p[n] - 1) // 2)", "n = int(input())\r\nflowers = list(map(int,input().split()))\r\nmax_flower = max(flowers)\r\nmin_flower = min(flowers)\r\nif max_flower != min_flower:\r\n difference = max_flower - min_flower\r\n num1 = 0\r\n num2 = 0\r\n for x in flowers:\r\n if x == max_flower:\r\n num1 += 1\r\n elif x == min_flower:\r\n num2 += 1\r\n num = num1*num2\r\n print(difference,num)\r\nelse:\r\n num = int(n*(n-1)/2)\r\n print(0,num)", "n = int(input())\r\n\r\nflowers = list(map(int, input().strip().split()))\r\n\r\ncount = [0, 0]\r\n\r\ncount[0] = flowers.count(min(flowers))\r\ncount[1] = flowers.count(max(flowers))\r\n\r\nif max(flowers) - min(flowers) == 0:\r\n result = 0\r\n\r\n for i in range(flowers.count(max(flowers))):\r\n result += i\r\n\r\n print(max(flowers) - min(flowers), result)\r\nelse:\r\n print(max(flowers) - min(flowers), count[0] * count[1])\r\n", "def pashmak_and_flowers():\r\n arr_length = int(input())\r\n flowers = list(map(int, input().split(\" \")))\r\n high = max(flowers)\r\n low = min(flowers)\r\n max_diff = high - low\r\n high_count = 0\r\n low_count = 0\r\n if low != high:\r\n for element in flowers:\r\n high_count += element == high\r\n low_count += element == low\r\n possibilities = high_count * low_count\r\n else:\r\n possibilities = (arr_length * (arr_length - 1))//2 #binomialkoeffizient oder so\r\n print(f\"{max_diff} {possibilities}\")\r\n\r\npashmak_and_flowers()", "import sys\r\nimport math\r\nfrom bisect import bisect_left\r\nfrom bisect import bisect_right\r\nsys.setrecursionlimit(9000)\r\nn1=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\na={}\r\nfor i in range (0,n1):\r\n if l[i] in a:\r\n a[l[i]]+=1\r\n else:\r\n a[l[i]]=1\r\nif len(a)==1:\r\n print(0,(n1*(n1-1))//2)\r\nelse:\r\n print(l[-1]-l[0],a[l[0]]*a[l[-1]])\r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n", "input()\r\nseq = tuple(map(int, input().split()))\r\nseq_dict = {}\r\n\r\nfor i in seq:\r\n seq_dict[i] = seq_dict.get(i, 0) + 1\r\n\r\ndif = max(seq) - min(seq)\r\n\r\ncnt = 0\r\nfor i in seq_dict:\r\n cnt += seq_dict[i] * seq_dict.get(i + dif, 0)\r\n\r\nif dif == 0:\r\n cnt = len(seq) * (len(seq) - 1) // 2\r\n \r\nprint(dif, cnt)\r\n", "from math import comb \r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nif len(set(arr)) == 1 : \r\n print(0,comb(n,2))\r\nelse : \r\n print(max(arr)-min(arr),arr.count(max(arr)) * arr.count(min(arr)))\r\n\r\n\r\n", "import math\r\nn=int(input())\r\nb=[int(i) for i in input().split()]\r\nmaxi=max(b)\r\nmini=min(b)\r\nif mini!=maxi:\r\n\tprint(maxi-mini, b.count(maxi)*b.count(mini))\r\nelse:\r\n\tans=0\r\n\tfor i in range(b.count(maxi)):\r\n\t\tans+=i\r\n\tprint(maxi-mini, ans)", "NumOfFlowers = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\ny = 1\r\nx = -1\r\nco = 0\r\nif a[-1] == a[0]:\r\n for i in range(1, a.count(a[-1])):\r\n co += i\r\n \r\n print('0', co)\r\nelse:\r\n print(a[-1] - a[0], a.count(a[-1]) * a.count(a[0]))", "n = int(input())\r\nbeauty_numbers = list(map(int, input().split()))\r\nbeauty_numbers.sort()\r\nmaximum_difference = beauty_numbers[-1] - beauty_numbers[0]\r\nif maximum_difference == 0:\r\n number_of_ways = (n - 1) * (n) // 2\r\nelse:\r\n number_of_ways = beauty_numbers.count(beauty_numbers[0]) * beauty_numbers.count(beauty_numbers[-1])\r\nprint(maximum_difference, number_of_ways)", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nb = [int(x) for x in input().split()]\r\n\r\nmx, mn = max(b), min(b)\r\nprint(mx - mn, n*(n-1)//2 if mx == mn else b.count(mx) * b.count(mn))", "def n_choose_k(n, k):\r\n k = min(k, n - k)\r\n ans = 1\r\n for i in range(k):\r\n ans = ans * (n - i) / (i + 1)\r\n return ans\r\n\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\nmi, mx, mic, mxc = -1, -1, 0, 0\r\nfor x in arr:\r\n mi = x if mi == -1 else min(mi, x)\r\n mx = x if mx == -1 else max(mx, x)\r\n\r\nfor x in arr:\r\n if x == mi:\r\n mic += 1\r\n if x == mx:\r\n mxc += 1\r\n\r\nans = int(mic * mxc) if mi != mx else int(n_choose_k(mic, 2))\r\nprint(f'{abs(mx - mi)} {ans}')", "from collections import Counter\r\nimport math\r\nimport operator as op\r\nfrom functools import reduce\r\n\r\ndef ncr(n, r):\r\n r = min(r, n-r)\r\n numer = reduce(op.mul, range(n, n-r, -1), 1)\r\n denom = reduce(op.mul, range(1, r+1), 1)\r\n return numer // denom \r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\ncount = Counter(lst)\r\nminn = min(lst)\r\nmaxx = max(lst)\r\nmax_difference = maxx - minn\r\ncombination = count[minn] * count[maxx] if minn != maxx else ncr(count[minn] , 2)\r\n\r\nprint(max_difference , combination)", "n = int(input())\r\na = list(map(int, input().split()))\r\nt, b, ct, cb = a[0], a[0], 0, 0\r\nfor v in a:\r\n if v > t:\r\n t = v\r\n ct = 1\r\n elif v == t:\r\n ct += 1\r\n if v < b:\r\n b = v\r\n cb = 1\r\n elif v == b:\r\n cb += 1\r\nif t == b:\r\n print(0, ct * (ct - 1) // 2)\r\nelse:\r\n print(t - b, ct * cb)\r\n", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\nrasn = max(k)- min(k)\r\nkolmax = k.count(max(k))\r\nkolmin = k.count(min(k))\r\nif max(k)!= min(k):\r\n print(rasn, kolmax*kolmin)\r\nelse:\r\n par = 0\r\n for i in range(2,kolmax+1):\r\n par += i-1\r\n print(rasn, par)\r\n\r\n\r\n\r\n\r\n \r\n", "n = int(input())\r\nflowers = list(map(int, input().split()))\r\n\r\n# Find the maximum and minimum beauty values\r\nmax_beauty = max(flowers)\r\nmin_beauty = min(flowers)\r\n\r\n# Calculate the maximum beauty difference\r\nmax_difference = max_beauty - min_beauty\r\n\r\n# Count the number of flowers with maximum and minimum beauty\r\ncount_max_beauty = flowers.count(max_beauty)\r\ncount_min_beauty = flowers.count(min_beauty)\r\n\r\n# If all flowers have the same beauty, there is only one way to pick them\r\nif max_difference == 0:\r\n ways = n * (n - 1) // 2\r\nelse:\r\n ways = count_max_beauty * count_min_beauty\r\n\r\nprint(max_difference, ways)\r\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nif(a[0]==a[-1]):\r\n x=a.count(a[0])*(a.count(a[-1])-1)//2\r\nelse:\r\n x=a.count(a[0])*a.count(a[-1])\r\nprint(a[-1]-a[0],x)" ]

[ "n=int(input())\r\na=list(map(int, input().split()))\r\np=s=sum(a)\r\nfor i in range(n-2, 0, -1):\r\n\ts-=a[i+1]\r\n\tp=max(p, s-p)\r\nprint(p)", "n = int(input())\na = [0]*(n+1)\ni = 1\nfor v in map(int, input().split()):\n a[i] = v\n i += 1\n \nfor i in range(1, n+1):\n a[i] = a[i-1]+a[i]\n\ndp = [-float('inf')]*(n+1)\ndp[n] = a[n]\n\nfor i in range(n-1, -1, -1):\n dp[i] = max(dp[i+1], a[i]-dp[i+1])\n\nprint(dp[2])\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A):\r\n n = len(A)\r\n S = [0]\r\n for i in range(n):\r\n S.append(S[-1]+A[i])\r\n d = [None for i in range(n)]\r\n d[-1] = S[-1]\r\n my_max = d[-1]\r\n my_min = d[-1]\r\n for i in range(n-2, -1, -1):\r\n fi = d[i+1]\r\n my_max = max(S[i+1]-fi, my_max)\r\n d[i] = my_max\r\n return max(d[1:])\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))" ]

[ "x = str(input())\r\ndef isnearlucky(x):\r\n count = 0\r\n for char in x:\r\n if char == \"4\" or char == \"7\":\r\n count += 1\r\n continue\r\n count = str(count)\r\n count = count.replace(\"4\",\"\")\r\n count = count.replace(\"7\",\"\")\r\n if len(count) == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nisnearlucky(x)", "def main():\r\n s = input()\r\n cnt = 0\r\n for i in s:\r\n if i == '4' or i == '7':\r\n cnt += 1\r\n if cnt == 4 or cnt == 7:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nnumbers=list(str(n))\r\nluckyNumbers=0\r\noutputValues=\" \"\r\nfor i in numbers:\r\n if i==\"4\":\r\n luckyNumbers +=1\r\n elif i==\"7\":\r\n luckyNumbers +=1\r\nif luckyNumbers==4 or luckyNumbers == 7:\r\n outputValues=\"YES\"\r\nelse:\r\n outputValues=\"NO\"\r\nprint(outputValues)\r\n", "n = int(input())\r\ndigits = [int(i) for i in str(n)]\r\nnumber_of_lucky_digits = digits.count(4) + digits.count(7)\r\nif number_of_lucky_digits == 4 or number_of_lucky_digits == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = str(input())\r\nl = 0\r\nfor i in range(len(n)):\r\n if n[i] == \"4\" or n[i] == \"7\":\r\n l += 1\r\nj = True\r\nl = str(l)\r\nfor i in range(len(l)):\r\n if l[i] != \"4\" and l[i] != \"7\":\r\n j = False\r\n break\r\nif j:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\n\nif x.count('4') + x.count('7') in (4, 7):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t \t \t \t\t\t \t\t \t \t\t \t \t", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[38]:\n\n\nn = input()\ncount = 0\nfor digit in n:\n if digit == '4' or digit == '7':\n count += 1\nif set(str(count)) <= set('47'):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n \n \n\n\n# \n\n# In[ ]:\n\n\n\n \n\n", "s = input()\r\n\r\nfourCnt = s.count(\"4\")\r\nsevenCnt = s.count(\"7\")\r\nif fourCnt + sevenCnt in [4,7]: print(\"YES\")\r\nelse: print(\"NO\")", "s1 = input()\r\nl = list(s1)\r\ncount_4 = l.count('4')\r\ncount_7 = l.count('7')\r\nif((count_4+count_7) == 4 or (count_4+count_7) == 7):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "# URL: https://codeforces.com/problemset/problem/110/A\n\nn = input()\ncnt = n.count(\"4\") + n.count(\"7\")\nprint(\"YES\" if cnt == 4 or cnt == 7 else \"NO\")\n", "num = abs(int(input()))\r\nl = [int(x) for x in str((num))]\r\nlucky = (str(l.count(4) + l.count(7)))\r\nlisted = [y for y in lucky if y!='4' and y!='7']\r\nif len(listed) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\na=n.count('4')\r\nb=n.count('7')\r\nif a+b==4 or a+b==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "def code(*args):\r\n \r\n number = args[0]\r\n count_of_lucky_number = 0\r\n \r\n while (number > 0):\r\n last_digit = number % 10\r\n if (last_digit == 4 or last_digit == 7):\r\n count_of_lucky_number += 1 \r\n number //= 10\r\n \r\n if (count_of_lucky_number == 4 or count_of_lucky_number == 7):\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n number = int(input())\r\n result = code(number) # Pass arguments\r\n print(result)\r\n\r\n", "n = input()\r\nc = 0\r\nfor i in n:\r\n if i == '4' or i =='7':\r\n c += 1\r\nif c == 4 or c == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\ncount = 0\n\nwhile n != 0:\n if n % 10 == 4 or n % 10 == 7:\n count += 1\n n //= 10\n\nif count == 4 or count == 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t\t\t\t\t \t\t \t\t\t \t\t \t", "x=input()\r\na = str(x.count('4') + x.count('7'))\r\nif (len(a)==a.count('4')+a.count('7')):print(\"YES\")\r\nelse: print(\"NO\")", "s = input()\r\ncn = 0\r\nln = len(s)\r\n\r\nfor i in range(ln):\r\n if s[i] == '4' or s[i] == '7':\r\n cn += 1\r\n\r\nif cn == 4 or cn == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_happy(number):\r\n count = 0\r\n while number > 0:\r\n digit = number % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n number = number // 10\r\n return count\r\ndef is_almost_happy(n):\r\n count = is_happy(n)\r\n if is_happy(count):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nn = int(input())\r\nprint(is_almost_happy(n))", "n = int(input())\r\ns = str(n)\r\ncnt = 0\r\n\r\nfor i in s:\r\n if i == '4' or i == '7':\r\n cnt += 1\r\n\r\nif cnt == 4 or cnt == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "num = input()\r\nnum_len = len(num)\r\nn = 0\r\nfor i in range(num_len):\r\n if num[i] == \"4\" or num[i] == \"7\":\r\n n += 1\r\n else:\r\n pass\r\nk = 0\r\nlist_n = list(str(int(n)))\r\nfor i in range(len(list_n)):\r\n if list_n[i] == \"4\" or list_n[i] == \"7\":\r\n k += 1\r\n else:\r\n pass\r\nif k == len(str(n)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=\"47\"\r\nc=0\r\nfor i in s:\r\n if(i==\"4\" or i==\"7\"):\r\n c+=1\r\nc=str(c)\r\nk=0\r\nfor j in c:\r\n if(j in a):\r\n k+=1\r\nif(len(c)==k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\nl = 0\n\nwhile(n):\n if n%10==4 or n%10==7:\n l += 1\n n //= 10\n\nif l==4 or l==7:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t\t \t \t\t\t \t\t \t\t", "#0(1)\ndef is_nearly_lucky(suerte):\n count = 0\n while suerte > 0:\n if suerte% 10 == 4 or suerte% 10 == 7:\n count += 1\n suerte//= 10\n return count in (4, 7)\n\nif __name__ == \"__main__\":\n suerte= int(input())\n print(\"YES\" if is_nearly_lucky(suerte) else \"NO\")\n \t\t\t\t \t\t\t \t \t\t\t\t\t\t \t\t\t\t \t", "x = list(input())\r\ncount = 0\r\nfor i in x:\r\n if i =='4' or i == '7':\r\n count += 1 \r\nif count == 4 or count == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = str(input())\n\nseven = n.count(\"7\")\nfour = n.count(\"4\")\n\ntotal = int(seven) + int(four)\n\nif total == 4 or total == 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t\t\t \t \t\t \t\t \t", "n=input()\r\nc=0\r\nfor i in n:\r\n if i=='7' or i=='4':\r\n c+=1\r\nc2=0\r\nfor j in str(c):\r\n if j=='7' or j=='4':\r\n c2+=1\r\nif len(str(c))==c2:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = int(input())\r\ncounter = 0\r\nb = str(a)\r\n\r\nfor x in b:\r\n if x == \"4\" or x == \"7\":\r\n counter = counter + 1\r\n\r\nif counter == 7 or counter == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def lucky():\r\n n=input()\r\n if n.count('4') + n.count('7') in (4,7):\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\nprint(lucky())", "def num(n):\r\n c=0\r\n while n!=0:\r\n n//=10\r\n c=c+1\r\n return c \r\nn=int(input())\r\na=n\r\ncount=0\r\nrem=0\r\nwhile a>0:\r\n rem=a%10\r\n if rem==4 or rem==7:\r\n count=count+1\r\n a=a//10\r\nif (count==4 or count==7) and num(n)>=2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnum = str(n)\r\nln = len(num)\r\ni = 0\r\ncount = 0\r\nwhile i < ln:\r\n if num[i] == \"4\" or num[i] == \"7\":\r\n count += 1\r\n i += 1\r\nif count == 4 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "user = str(input())\r\ncounter = 0\r\nfor i in user:\r\n if i == '4' or i == '7':\r\n counter += 1\r\ncounter = str(counter)\r\nfor i in counter:\r\n if i == '4' or i == '7':\r\n continue\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "def luckynums(n):\r\n alist=[d for d in n]\r\n count=0\r\n for xx in alist:\r\n if xx==\"4\" or xx==\"7\":\r\n count+=1\r\n if count==4 or count==7 or count==40 or count==70 or count==47 or count==44 or count==77:\r\n return \"YES\"\r\n return \"NO\"\r\ns=input()\r\nprint(luckynums(s))\r\n", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef count_lucky_digits(number):\r\n return sum(1 for digit in str(number) if is_lucky_digit(digit))\r\n\r\ndef is_nearly_lucky_number(n):\r\n lucky_digit_count = count_lucky_digits(n)\r\n return is_lucky_digit(str(lucky_digit_count))\r\n\r\nn = int(input().strip())\r\nif is_nearly_lucky_number(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "no = input()\r\ncount = 0\r\nfor each in no:\r\n if each == \"4\" or each == \"7\":\r\n count += 1\r\n \r\nif count == 4 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input(\"\"))\r\na=str(a)\r\nn=0\r\nfor i in a : \r\n if i =='7' or i=='4':\r\n n=n+1\r\n\r\nif n==4 or n==7 : \r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n = input()\r\n\r\nfortunato = False\r\ncount = 0\r\n\r\nif int(n) > 9:\r\n for char in n:\r\n if int(char) == 7 or int(char) == 4:\r\n count += 1\r\n\r\nif count == 7 or count == 4:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = list(input())\r\nl = 0\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n l += 1\r\n\r\nprint('YES' if l == 4 or l == 7 else 'NO')", "def lucky(n):\r\n num = str(n)\r\n a = 0\r\n for i in range(len(num)):\r\n if num[i] == \"4\" or num[i] == \"7\":\r\n a = a + 1 \r\n # print(a)\r\n if a == 4 or a == 7:\r\n return True\r\n else:\r\n return False\r\nn = int(input())\r\ncheck = lucky(n)\r\nif check == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\ncnt=0\r\nclk=1\r\nfor i in a:\r\n if i=='4' or i=='7':\r\n cnt=cnt+1\r\ncnt=str(cnt)\r\nfor i in cnt:\r\n if i=='4' or i=='7':\r\n continue\r\n else:\r\n print(\"NO\")\r\n clk=0\r\n break\r\nif clk==1:\r\n print(\"YES\")\r\n", "k=input()\r\nc= sum(i in '47' for i in k)\r\nprint(['NO','YES'][c==4 or c==7])\r\n", "num = input()\r\n\r\n\r\ncount = 0\r\n\r\nfor n in num:\r\n if n in ['4', '7']:\r\n count += 1\r\n\r\nif count in [4, 7]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nn = s.count(\"4\") + s.count(\"7\")\r\nif n in [4, 7]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "s=input()\r\na= set(str(s.count('4')+s.count('7')))\r\nif a=={'4','7'} or a=={'4'} or a=={'7'} :\r\n print ('YES')\r\nelse:\r\n print('NO')", "def count_lucky_digits(n):\r\n count = 0\r\n while n > 0:\r\n if n % 10 == 4 or n % 10 == 7:\r\n count += 1\r\n n //= 10\r\n return count\r\n \r\nn = int(input())\r\nlucky_count = count_lucky_digits(n)\r\n \r\nif lucky_count == 4 or lucky_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=list(input())\r\ncount=0\r\nfor i in range(len(n)):\r\n # print(n[i])\r\n if(n[i]=='4' or n[i]=='7'):\r\n count+=1\r\nm=count\r\nif(m==4 or m==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isLucky(n):\n x = n\n if (x == 0): return False\n while (x > 0):\n if not (x % 10 == 4 or x % 10 == 7):\n return False\n x = x // 10\n return True\n\nn = input()\nlds = sum((1 for x in n if x == '4' or x == '7'))\nprint(\"YES\" if isLucky(lds) else \"NO\")\n", "# Решение задач проекта CODEFORSES, Задача 59A\r\n#\r\n# (C) 2021 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Почти счастливое число\r\nограничение по времени на тест2 seconds\r\nограничение по памяти на тест256 megabytes\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nПетя любит счастливые числа. Всем известно, что счастливыми являются положительные целые числа, в десятичной\r\nзаписи которых содержатся только счастливые цифры 4 и 7. Например, числа 47, 744, 4 являются счастливыми,\r\nа 5, 17, 467 — не являются.\r\n\r\nК сожалению, не все числа счастливые. Петя называет число почти счастливым, если количество счастливых \r\nцифр в нем — счастливое число. Ему интересно, является ли число n почти счастливым.\r\n\r\nВходные данные\r\nВ единственной строке задано целое число n (1 ≤ n ≤ 10^18).\r\n\r\nПожалуйста, не используйте спецификатор %lld для чтения или записи 64-битных чисел на С++.\r\nРекомендуется использовать потоки cin, cout или спецификатор %I64d.\r\n\r\nВыходные данные\r\nВ единственной строке выведите «YES», если число n — почти счастливое, и «NO» в противном случае (без кавычек).\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\nz=input()\r\nc47 = 0\r\nfor q in z:\r\n if int(q) == 4 or int(q) == 7:\r\n c47=c47+1\r\nb = [4,7]\r\nif c47 in b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n#print(ANS,' TIME:',datetime.now() - start_time) ", "s=input()\r\na=str(s.count('4')+s.count('7'))\r\nif len(a)==a.count('4')+a.count('7'): print('YES')\r\nelse: print('NO')", "n = input(\"\")\r\nanswer = \"NO\"\r\nx = 0\r\nfor num in n:\r\n if num == \"4\" or num == \"7\":\r\n x += 1\r\n if x == 4 or x == 7: \r\n answer = \"YES\" \r\n else:\r\n answer = \"NO\"\r\nprint(answer)\r\n \r\n", "#CodeForce Round 110a Nearly Lucky Number\r\n\r\nnumber = input()\r\nln = number.count(\"4\") + number.count(\"7\")\r\nsln = str(ln)\r\nif all((c == \"4\" or c == \"7\") for c in sln):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=s.count('4')+s.count('7')\r\nif(a==4 or a==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num=input()\r\ncount=0\r\nfor i in range (len(num)):\r\n if ord(num[i])==52 or ord(num[i])==55:\r\n count+=1\r\ncount=str(count)\r\ni=0\r\nwhile (i<len(count)):\r\n if ord(count[i])!=52 and ord(count[i])!=55:\r\n print(\"NO\")\r\n break\r\n i+=1\r\n if i==len(count):\r\n print(\"YES\")", "a = list(map(int, input()))\r\n\r\nb = a.count(7)\r\nc = a.count(4)\r\nx = {4, 7}\r\n\r\n\r\nif (b + c) in x:\r\n print('YES')\r\nelse:\r\n print('NO')", "list1 = list(input())\r\n\r\nnum = list1.count(\"4\") + list1.count(\"7\")\r\nlist2 =list(str(num))\r\n\r\nresult = True\r\nfor ch in list2:\r\n if ch != \"4\" and ch != \"7\":\r\n result = False\r\n \r\nif result == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n\r\n\r\n \r\n", "def es_numero_de_la_suerte(n):\n d = [int(x) for x in str(n)]\n return all(digit == 4 or digit == 7 for digit in d)\n\ndef contar_digitos_de_la_suerte(n):\n d = [int(x) for x in str(n)]\n return sum(1 for digit in d if digit == 4 or digit == 7)\n\ndef main():\n n = int(input())\n \n num_digitos_suerte = contar_digitos_de_la_suerte(n)\n\n if es_numero_de_la_suerte(num_digitos_suerte):\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == \"__main__\":\n main()\n\n \t \t\t \t\t \t \t\t\t \t\t \t\t\t \t\t\t", "n = int(input())\r\n\r\ns = 0\r\ns += str(n).count('4')\r\ns += str(n).count('7')\r\n\r\nif str(s).count('4') + str(s).count('7') == len(str(s)):\r\n print('YES')\r\nelse:\r\n print('NO')", "num = input()\r\nnumlist = list(num)\r\nnum = 0\r\nfor i in range(len(numlist)):\r\n if(numlist[i] == '4' or numlist[i] == '7'):\r\n num += 1\r\n\r\nnumlist = list(str(num))\r\n\r\nlucky = True\r\nfor i in range(len(numlist)):\r\n if(numlist[i] != '4' and numlist[i]!= '7'):\r\n lucky = False\r\n\r\nif(lucky):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_lucky_digit(digit):\n return digit == '4' or digit == '7'\n\ndef is_nearly_lucky(n):\n count_lucky_digits = 0\n while n > 0:\n digit = n % 10\n if is_lucky_digit(str(digit)):\n count_lucky_digits += 1\n n //= 10\n \n return is_lucky_digit(str(count_lucky_digits))\n\nn = int(input())\nprint(\"YES\") if is_nearly_lucky(n) else print(\"NO\")\n \t \t\t \t \t \t\t\t\t\t \t \t \t\t \t", "s1=input()\r\nl=list(s1)\r\ncount_4=l.count('4')\r\ncount_7=l.count('7')\r\nif((count_4+count_7)==4 or (count_4+count_7)==7):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\nx = n.count('4') + n.count('7')\n\nif (x == 7 or x == 4):\n print ('YES')\nelse:\n print ('NO')\n\t \t \t\t \t\t\t\t\t\t \t\t\t \t \t\t\t\t", "n=int(input())\r\ncount=0\r\nwhile n!=0:\r\n a=n%10\r\n if a==4 or a==7:\r\n count+=1\r\n n=n//10\r\nif count==4 or count==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "def is_nearly_lucky(n):\r\n lucky_digits = [4, 7] # Lucky digits\r\n count = 0\r\n\r\n # Count the number of lucky digits in n\r\n while n > 0:\r\n digit = n % 10\r\n if digit in lucky_digits:\r\n count += 1\r\n n //= 10\r\n\r\n # Check if count is a lucky number\r\n if count == 4 or count == 7:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nn = int(input())\r\nresult = is_nearly_lucky(n)\r\nprint(result)\r\n", "n = int(input())\r\nlucky = []\r\nunlucky = []\r\nfor i in str(n):\r\n if i == \"4\" or i == \"7\":\r\n lucky.append(i)\r\n else:\r\n unlucky.append(i)\r\n \r\nif len(lucky) == 4 or len(lucky) == 7:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nc=0\r\na=0\r\nwhile(n>0):\r\n a=n%10\r\n if a==4 or a==7:\r\n c+=1\r\n n=n//10\r\nif c==7 or c==4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = []\r\ncnt = 0\r\nwhile n > 0:\r\n\ta.append(n % 10)\r\n\tn = n // 10\r\nfor i in range(len(a)):\r\n\tif a[i] == 4 or a[i] == 7:\r\n\t\tcnt += 1\t\r\nif cnt == 4 or cnt == 7:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\t", "t = input()\r\n\r\nhappy = t.count(\"4\") + t.count(\"7\")\r\n\r\nif happy == 4 or happy == 7:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "l=list(input())\r\nsum=0\r\nfor x in range(len(l)):\r\n if l[x]=='4' or l[x]=='7':\r\n sum+=1\r\ns=list(str(sum))\r\nsum2=0\r\nfor y in range(len(s)):\r\n if s[y]=='4' or s[y]=='7':\r\n sum2+=1\r\nif sum2==len(s):\r\n print('YES')\r\nelse:\r\n print('NO')", "string = input()\r\nk = string.count(\"4\")+string.count(\"7\")\r\nif k ==4 or k==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "inp = input()\r\nres= 0\r\nfor i in inp:\r\n if i =='4' or i == '7':\r\n res += 1\r\n# print(res)\r\nif res == 4 or res== 7:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "print('NYOE S'[sum(i in'47'for i in input())in(4,7)::2])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 16 22:36:35 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nnum = list(input())\r\nout = 0\r\nfor i in num :\r\n if (i == '4') + (i == '7') :\r\n out += 1\r\nif (out == 4) + (out == 7) + (out == 47) + (out == 74) :\r\n print('YES')\r\nelse:\r\n print('NO')", "\ndef is_lucky(num):\n return set(str(num)) <= {'4', '7'}\n\n\nn = int(input())\n\n\nlucky_digits_count = str(n).count('4') + str(n).count('7')\n\n\nif is_lucky(lucky_digits_count):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t \t\t \t \t \t \t\t \t \t\t\t", "n = input()\r\ns = 0\r\nfor i in range(0, len(n)):\r\n if n[i] == '4' or n[i] == '7':\r\n s = s+1\r\nif s == 4 or s == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "number = int(input())\r\nnumber_str = str(number)\r\nlista_number = [int(digit) for digit in number_str]\r\n\r\nlucky = 0\r\n\r\nfor digit in lista_number:\r\n if digit == 4 or digit == 7:\r\n lucky += 1\r\n\r\nif lucky == 4 or lucky == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\n\r\ndef es_numero_de_la_suerte(numero):\r\n for digito in numero:\r\n if digito != '4' and digito != '7':\r\n return False\r\n return True\r\n\r\ndef es_numero_de_la_suerte_casi(n):\r\n conteo_de_suertes = 0\r\n for digito in n:\r\n if digito == '4' or digito == '7':\r\n conteo_de_suertes += 1\r\n\r\n return es_numero_de_la_suerte(str(conteo_de_suertes))\r\n\r\nif es_numero_de_la_suerte_casi(n):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "digits = str(int(input()))\r\n\r\nprint('YES' if digits.count('4')+digits.count('7') in [4,7] else 'NO')", "num = list(input())\r\na = num.count('4')\r\nb = num.count('7')\r\nif a + b == 4 or a + b == 7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\ncount=0\r\nwhile n>0:\r\n t=n%10\r\n if t==4 or t==7:\r\n count+=1\r\n n=n//10\r\nif(count==4 or count==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\nlength = len(a)\nj=0\ncount = 0\nwhile j < length:\n if ord(a[j])== 52 or ord(a[j]) == 55:\n count += 1\n j+=1\nif count == 4 or count == 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\nsum=0\r\nfor i in s:\r\n\tif(i==\"4\" or i==\"7\"):\r\n\t\tsum+=1\r\nif(sum==4 or sum==7):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=input()\r\na,b=s.count('4'),s.count('7')\r\nprint(\"YES\" if (a+b)==7 or (a+b)==4 else \"NO\")", "n=input()\ncount=0\nfor i in n:\n if i ==\"7\" or i==\"4\":\n count+=1\nif count==4 or count==7:\n print(\"YES\")\nelse:\n print(\"NO\")", "def is_lucky_digit(digit):\n return digit == '4' or digit == '7'\n\ndef is_lucky_count(count):\n return count == 4 or count == 7\n\nn = input()\nlucky_count = 0\n\nfor digit in n:\n if is_lucky_digit(digit):\n lucky_count += 1\n\nif is_lucky_count(lucky_count):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t\t\t\t \t\t \t\t\t\t \t \t \t\t\t", "def is_lucky(n):\n n_set = set(str(n))\n lucky_set = {\"4\", \"7\"}\n if n_set - lucky_set:\n return False\n return True\n\n\ns = input()\n\nlucky_count = 0\nfor c in (\"4\", \"7\"):\n lucky_count += s.count(c)\n\nif lucky_count == 0 or not is_lucky(lucky_count):\n print(\"NO\")\nelse:\n print(\"YES\")\n", "x=input()\r\nans=0\r\nfor z in range(len(x)):\r\n if '4'in x[z] or \"7\" in x[z]:\r\n ans=ans+1\r\nif ans==4 or ans==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\ns=str(n.count(\"7\")+n.count(\"4\"))\nprint(\"YES\" if len(s.replace('7','').replace('4',''))==0 else \"NO\")\n", "a=input()\r\nif a.count(\"4\")+a.count(\"7\") in [4, 7]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=str(input())\r\nb=0\r\nfor i in a:\r\n if i==\"4\" or i==\"7\":\r\n b=b+1\r\nif b==4 or b==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\r\nprint(\"YES\" if x.count('7')+x.count('4')==7 or x.count('7')+x.count('4')==4 else \"NO\")", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef is_lucky_count(count):\r\n return all(digit in '47' for digit in str(count))\r\n\r\nn = int(input())\r\ncount = 0\r\n\r\n# Count the lucky digits in n\r\nfor digit in str(n):\r\n if is_lucky_digit(digit):\r\n count += 1\r\n\r\n# Check if the count is a lucky number\r\nif is_lucky_count(count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "g = input()\n\ngl=[]\nfor broj in g:\n gl.append(int(broj))\n\n\ncounter = 0\nfor i in range(len(gl)):\n if gl[i]==7 or gl[i]==4:\n counter+=1\n\n\nif counter ==4 or counter == 7:\n print(\"YES\")\nelse:\n print(\"NO\")", "n = input()\r\na=n.count('4')\r\nb=n.count('7')\r\nif a+b == 4 or a+b ==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def islucky(n):\r\n for i in str(n):\r\n if i != '4' and i != '7':\r\n return False\r\n return True\r\n\r\ns = input()\r\nfour = s.count('4')\r\nseven = s.count('7')\r\nif islucky(four + seven):\r\n print('YES')\r\nelse:\r\n print('NO')", "numbers = input()\r\n\r\nif len(numbers)<4:\r\n print('NO')\r\nelse:\r\n luckyNumbers=0\r\n\r\n for number in numbers:\r\n if number == '4' or number=='7':\r\n luckyNumbers+=1\r\n \r\n if luckyNumbers==7 or luckyNumbers==4:\r\n print('YES')\r\n else:\r\n print('NO')", "text = input()\nseven = 0\nfour = 0\nfor dt in text:\n if dt == \"7\":\n seven += 1\n if dt == \"4\":\n four += 1\n\nlns = seven + four\nif lns == 4 or lns == 7: \n print(\"YES\")\nelse:\n print(\"NO\")\nquit()\n \t \t\t \t \t \t \t \t\t \t\t\t\t \t", "# Function to count the number of lucky digits (4 or 7) in a number\r\ndef count_lucky_digits(number):\r\n count = 0\r\n while number > 0:\r\n digit = number % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n number //= 10\r\n return count\r\n\r\n# Read the input number\r\nn = int(input())\r\n\r\n# Count the lucky digits in the input number\r\nlucky_digit_count = count_lucky_digits(n)\r\n\r\n# Check if the count of lucky digits is itself a lucky number (4 or 7)\r\nif lucky_digit_count == 4 or lucky_digit_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "w=input()\r\nif w.count('4')+w.count('7')==4 or w.count('4')+w.count('7')==7:print('YES')\r\nelse:print('NO')", "import sys\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n# sys.stderr = open(\"error.txt\", \"w\")\r\n# # your remaining code\r\n\r\nn =input()\r\n\r\nc47= 0\r\n\r\nfor i in n:\r\n\tif i == '4' or i == '7':\r\n\t\tc47+=1\r\n\r\nif c47 == 4 or c47 == 7:\r\n\tprint(\"YES\")\r\nelse :\r\n\tprint(\"NO\") \r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nc=0\r\nwhile(n>0):\r\n \r\n if (n%10==4 or n%10==7):\r\n \r\n c=c+1\r\n n=n//10\r\n\r\nif (c==7 or c==4):\r\n \r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n ", "lucky=list(map(int,input()))\r\n\r\ncount=0\r\nfor n in range(len(lucky)):\r\n if lucky[n] ==7 or lucky[n] == 4 :\r\n\r\n count+=1\r\n\r\n\r\nif count == 4 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "num= input()\r\nluck= \"\".join(list(set(str(num.count(\"7\")+num.count(\"4\")))))\r\nif luck ==\"74\" or luck ==\"47\" or luck==\"7\" or luck == \"4\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "number = int(input())\r\ncount = 0\r\n\r\nfor i in range(len(str(number))):\r\n if str(number)[i] == '4' or str(number)[i] == '7': count += 1\r\n \r\nprint(\"YES\" if count == 4 or count == 7 else \"NO\")", "def is_almost_happy(n):\r\n n_str = str(n)\r\n count = 0\r\n for digit in n_str:\r\n if digit == '4' or digit == '7':\r\n count += 1\r\n if count == 4 or count == 7:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\nn = int(input())\r\nresult = is_almost_happy(n)\r\nprint(result)", "m=input()\r\nk=m.count(\"4\")+m.count('7')\r\nfor i in str(k) :\r\n if i!=\"4\" and i!=\"7\":\r\n m=\"NO\"\r\n break\r\nif m!=\"NO\":\r\n m='YES'\r\nprint(m)", "s=int(input())\r\nk=str(s)\r\nif k.count('7')+k.count('4')==4 or k.count('7')+k.count('4')==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "x=input()\r\nl=0\r\nfor i in x:\r\n if i==\"4\" or i==\"7\":\r\n l=l+1\r\nif l==4 or l==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "number = input()\r\ncount = 0\r\nfor i in number :\r\n if i == \"4\" or i == \"7\":\r\n count += 1\r\nprint(\"YES\" if count == 4 or count == 7 else \"NO\" )\r\n", "number = str(input())\r\ncount = 0\r\nfor n in number:\r\n if n == '7' or n == '4':\r\n count += 1\r\nif count == 7 or count == 4: print(\"YES\")\r\nelse: print(\"NO\")", "n = str(input())\nif 1<=int(n)<=10**18:\n c = n.count(\"4\") + n.count(\"7\")\n if c==4 or c==7:\n print(\"YES\")\n else: \n print(\"NO\")\n \t \t \t \t\t\t\t \t\t \t \t\t\t\t \t", "n = int(input())\r\nlucky = 0\r\nfor i in str(n):\r\n if i == '4':\r\n lucky += 1\r\n if i == '7':\r\n lucky += 1\r\n\r\n# print(lucky)\r\nif lucky == 4 or lucky == 7:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\ntotal7=n.count('7')\r\ntotal4=n.count('4')\r\n\r\n\r\nif(total7+total4==4 or total7+total4==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "x = input()\r\nc7 = x.count(\"7\")\r\nc4 = x.count(\"4\")\r\ns = c7 + c4\r\nif s == 7 or s == 4:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 11 20:39:47 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\nnum=0\r\nn=str(input())\r\nfor c in n: \r\n if c=='4' or c=='7':\r\n num+=1\r\nnum_str=str(num)\r\nfor i in num_str: \r\n if i!='4' and i!='7':\r\n print('NO')\r\n break\r\nelse: \r\n print('YES')\r\n", "a,n,k=str(input()),0,0\r\nfor i in a:\r\n if i==\"4\" or i==\"7\":\r\n n+=1\r\nfor j in str(n):\r\n if j==\"4\" or j==\"7\":\r\n k+=1\r\nif len(str(n))==k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#nearly lucky number\nn = int(input())\ns = str(n)\nc = []\nfor i in range(len(s)):\n if s[i]=='4':\n c.append(1)\n elif s[i]=='7':\n c.append(1)\nx = sum(c)\nif x== 7 or x==4:\n print('YES')\nelse : \n print('NO') \n\n \t\t\t\t \t\t \t\t \t\t\t \t\t \t\t \t\t \t", "n = int(input())\r\nb = str(n)\r\narr2 = ['4','7']\r\ncount =0\r\nfor i in b:\r\n if i in arr2:\r\n count+=1\r\nif count ==4 or count ==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "N = int(input())\r\nn = str(N)\r\nn = list(n)\r\nl = len(n)\r\ncount = 0\r\nfor num in n:\r\n if num == '4' or num == '7':\r\n count += 1\r\nif count ==4 or count ==7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "number = input()\r\nnumbers = [\"4\",\"7\"]\r\n\r\ncount = 0\r\n\r\nfor digit in number:\r\n if digit in numbers:\r\n count +=1\r\n \r\n\r\nif count == 4 or count ==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nt=0\r\nfor i in n:\r\n if int(i)==4 or int(i)==7:\r\n t+=1\r\n else:\r\n continue\r\nif t==4 or t==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nc = 0\r\nfor i in n:\r\n if i in '47':\r\n c += 1\r\nif c == 4 or c == 7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n = input()\n\nif len(n) < 4:\n print('NO')\nelse:\n lucky_count = 0\n\n for c in n:\n if c == '4' or c == '7':\n lucky_count += 1\n\n if lucky_count == 4 or lucky_count == 7:\n print('YES')\n else:\n print('NO')", "def is_lucky(n):\r\n\tn_string = str(n)\r\n\tcount = 0\r\n\tfor i in range(1, len(n_string)+1):\r\n\t\tr_string = n_string[:i]\r\n\t\t#print(r_string)\r\n\t\tn = int(r_string)\r\n\t\t#print(n)\r\n\t\tif n % 10 == 4 or n %10 == 7:\r\n\t\t\tcount += 1\r\n\tif count == len(n_string):\r\n\t\treturn True\r\n\treturn False\r\n\r\n#print(is_lucky(4))\r\ndef is_nearly_lucky(n):\r\n\tlucky_digits = 0\r\n\tfor digit in n:\r\n\t\tif digit == '4' or digit == '7':\r\n\t\t\tlucky_digits += 1\r\n\tif is_lucky(lucky_digits):\r\n\t\treturn 'YES'\r\n\telse:\r\n\t\treturn 'NO'\r\n\r\nprint(is_nearly_lucky(input()))\r\n", "if __name__ == \"__main__\":\r\n num = input()\r\n luckyDigits = int(num.count('4')) + int(num.count('7'))\r\n\r\n if(luckyDigits == 4 or luckyDigits == 7):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = input()\r\nlucky_digits = ['4', '7']\r\nlucky_counter = 0\r\n\r\nfor num in n:\r\n if num in lucky_digits:\r\n lucky_counter += 1\r\n\r\nprint(\"YES\") if lucky_counter == 4 or lucky_counter == 7 else print(\"NO\")\r\n\r\n", "n = input()\r\n\r\n# Переменная для подсчета счастливых цифр\r\nlucky_digit_count = 0\r\n\r\nfor digit in n:\r\n if digit == '4' or digit == '7':\r\n lucky_digit_count += 1\r\n\r\n# Проверяем, является ли количество счастливых цифр счастливым числом (4 или 7)\r\nif lucky_digit_count == 4 or lucky_digit_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = int(input())\r\n\r\ncount = 0\r\n\r\nwhile True:\r\n last = a%10\r\n if last == 4 or last ==7:\r\n count+=1\r\n a = a//10\r\n if a==0:\r\n break\r\n\r\nif count%10 == 4 or count%10 ==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s = input()\r\nn = 0\r\nfor i in range(len(s)):\r\n if int(s[i]) == 4 or int(s[i]) == 7:\r\n n = n+1\r\nn = str(n)\r\nv = 1\r\nfor i in range(len(n)):\r\n if int(n[i]) == 4 or int(n[i]) ==7:\r\n v = v*1\r\n else:\r\n v = 0\r\nif v == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = input()\r\nN = 0\r\nfor i in range(len(n)):\r\n if n[i] == '4' or n[i] == '7':\r\n N += 1\r\nif N == 0:\r\n print('NO')\r\nelse:\r\n L = []\r\n for i in range(len(str(N))):\r\n L.append([])\r\n L[0].append(4)\r\n L[0].append(7)\r\n for i in range(1,len(str(N))):\r\n for j in range(len(L[i-1])):\r\n L[i].append(L[i-1][j]*10+4)\r\n L[i].append(L[i-1][j]*10+7)\r\n a = 0\r\n for i in range(len(str(N))):\r\n for j in range(len(L[i])):\r\n if N == L[i][j]:\r\n print('YES')\r\n a += 1\r\n if a == 0:\r\n print('NO')", "s=input()\r\nre=s.count('4')+s.count('7')\r\nprint('YES' if re == 4 or re == 7 else 'NO')", "num=input()\r\nc=0\r\nfor i in num:\r\n if(i=='4' or i=='7'):\r\n c+=1\r\nif(c==4 or c==7):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnum = n\r\ncount = 0\r\nwhile num != 0:\r\n if num%10 == 4 or num%10 == 7:\r\n count+=1\r\n num//=10\r\nif count == 4 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# This is a sample Python script.\r\n\r\n# Press Maj+F10 to execute it or replace it with your code.\r\n# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\n\r\nLUCKY_NUMBERS = ['4', '7']\r\n\r\n\r\ndef is_lucky(num):\r\n return all(d in LUCKY_NUMBERS for d in num)\r\n\r\n\r\ndef is_nearly_lucky(num):\r\n num_lucky = 0\r\n for n in LUCKY_NUMBERS:\r\n num_lucky += num.count(n)\r\n return is_lucky(str(num_lucky))\r\n\r\n\r\n# Press the green button in the gutter to run the script.\r\nif __name__ == '__main__':\r\n n = input()\r\n print('YES' if is_nearly_lucky(n) else 'NO')\r\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\r\n", "num = input()\r\n\r\nnumbers = list(num)\r\n\r\n\r\n\r\nif numbers.count(\"4\") + numbers.count(\"7\") == 4 or numbers.count(\"4\") + numbers.count(\"7\") == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\n\r\ncounter = 0\r\nans = 'YES'\r\n\r\nfor i in range(len(n)):\r\n if n[i] == '4' or n[i] == '7':\r\n counter += 1\r\n\r\ncounter = str(counter)\r\n\r\nfor i in range(len(counter)):\r\n if counter[i] != '4' and counter[i] != '7':\r\n ans = 'NO'\r\n break\r\n\r\nprint(ans)", "def is_lucky(num):\r\n # Count the number of lucky digits (4 and 7) in the number\r\n count = 0\r\n while num > 0:\r\n digit = num % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n num //= 10\r\n\r\n # Check if the count of lucky digits is itself a lucky number (4 or 7)\r\n return count == 4 or count == 7\r\n\r\ndef is_nearly_lucky(n):\r\n # Check if n is a nearly lucky number\r\n if is_lucky(n):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Read the input\r\nn = int(input())\r\n\r\n# Check if n is a nearly lucky number and print the result\r\nprint(is_nearly_lucky(n))\r\n", "s=input()\r\nl=(s.count('4')+s.count('7'))\r\nif l==7 or l==4:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=str(input())\r\nfour=s.count('4')\r\nsev=s.count('7')\r\nif four+sev==4 or four+sev==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=0\r\nx=input()\r\nx1=0\r\nfor i in x:\r\n if i== '4' or i== '7':\r\n x1=x1+1\r\n \r\nif x1==7 or x1==4:\r\n print(\"YES\")\r\nelse:\r\n print(\" NO\")", "n=input()\r\nk1=n.count('4')\r\nk2=n.count('7')\r\nif( k1+k2==4 or k1+k2==7):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "# Read the input number as a string\r\nn = input()\r\n\r\n# Count the number of lucky digits (4 and 7)\r\ncount = n.count('4') + n.count('7')\r\n\r\n# Check if the count is a lucky number (4 or 7)\r\nif count == 4 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\nm = len(n)\r\nl = int(0)\r\na = str(4)\r\nb = str(7)\r\nwhile m > 0:\r\n if n[m-1] == a or n[m-1] == b:\r\n l = int(l+1)\r\n m = m - 1\r\n else:\r\n m = m - 1\r\nif l == 4 or l == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "string = input()\r\nfour = string.count(\"4\")\r\nseven = string.count(\"7\")\r\na = str(four+seven)\r\nf1 = a.count(\"4\")\r\ns1 = a.count(\"7\")\r\nif (len(a)==f1+s1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\n n = input()\n counter = 0\n i = 0\n while (i < len(n)):\n rest = int(n[i])\n if (rest == 4 or rest == 7):\n counter += 1\n i += 1\n if (counter == 4 or counter == 7):\n print('YES')\n else:\n print('NO')\n\n\nif __name__ == '__main__':\n main()\n", "number = input()\r\ntotal = number.count(\"4\") + number.count(\"7\")\r\nif total == 4 or total == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "skaitlis = input()\r\nskaits = 0\r\nfor n in range(len(skaitlis)) :\r\n if skaitlis[n] == \"4\" or skaitlis[n] == \"7\" :\r\n skaits+=1\r\nif skaits == 4 or skaits == 7 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "a=input()\r\ncount=0\r\nfor i in a:\r\n if i=='4' or i=='7':\r\n count+=1\r\n \r\nprint(\"YES\") if( count==4 or count==7) else print(\"NO\") ", "num = input()\r\ncounter = 0\r\ns = ''\r\n\r\nfor x in num:\r\n if x == '4' or x == '7':\r\n counter += 1\r\n\r\nif counter == 4 or counter == 7:\r\n s = 'YES'\r\nelse:\r\n s = 'NO'\r\n\r\nprint(s)", "def es_afortunado(num):\n\n for digito in str(num):\n if digito not in '47':\n return False\n return True\n\ndef contar_digitos_afortunados(num):\n\n contador = 0\n for digito in str(num):\n if digito in '47':\n contador += 1\n return contador\n\nn = int(input()) \ncantidad_digitos_afortunados = contar_digitos_afortunados(n) \n\nif es_afortunado(cantidad_digitos_afortunados): \n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t \t\t \t \t\t\t\t \t \t \t\t\t\t \t \t \t", "a=input().strip()\r\nl=\"47\"\r\nl1=0\r\nfor i in a:\r\n if i in l:\r\n l1+=1\r\nl2=str(l1)\r\nif all(i in '47' for i in l2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\njumlah =0\r\nfor digit in n:\r\n if digit =='4' or digit =='7':\r\n jumlah +=1\r\nif jumlah ==4 or jumlah ==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "# O(n)\r\n\r\nn = input()\r\ncontador = 0\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n contador += 1\r\nif contador == 7 or contador == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ncount=0\r\nwhile n>0:\r\n if(n%10==7 or n%10==4):\r\n count+=1\r\n n=n//10\r\nif(count==4 or count==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_lucky_number(n):\r\n return n == 4 or n == 7\r\n\r\ndef is_nearly_lucky_number(n):\r\n count = 0\r\n while n > 0:\r\n digit = n % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n n //= 10\r\n\r\n return is_lucky_number(count)\r\n\r\nn = int(input().strip())\r\n\r\nif is_nearly_lucky_number(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\nk = 0\r\nset_47 = set(['4', '7'])\r\nfor el in n:\r\n if el in set_47:\r\n k += 1\r\n\r\nif k == 7 or k == 4:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "word = input()\r\ncnt = 0\r\n\r\nfor c in word:\r\n if(c=='4' or c=='7'):\r\n cnt+=1\r\n \r\nprint( \"YES\" if (cnt==4 or cnt==7) else \"NO\" )", "n = str(input())\r\n\r\ncount= 0\r\nfor i in range(len(n)):\r\n if (n[i] == '4') | (n[i] =='7'):\r\n count += 1\r\n \r\nif (count == 4) | (count == 7) :\r\n print (\"YES\")\r\nelse :\r\n print (\"NO\")", "def count_lucky_digits(n):\r\n count = 0\r\n for digit in str(n):\r\n if digit == '4' or digit == '7':\r\n count += 1\r\n return count\r\n\r\ndef is_lucky_number(n):\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n return n in lucky_numbers\r\n\r\n# Reading input\r\nn = int(input())\r\n\r\n# Counting lucky digits\r\nlucky_digit_count = count_lucky_digits(n)\r\n\r\n# Checking if the count is a lucky number\r\nresult = \"YES\" if is_lucky_number(lucky_digit_count) else \"NO\"\r\n\r\n# Output the result\r\nprint(result)\r\n", "skaitlis=str(input(\"\"))\r\nk=0\r\nlaimigie=0\r\nwhile k<len(skaitlis):\r\n if skaitlis[k]==\"4\" or skaitlis[k]==\"7\":\r\n laimigie=laimigie+1\r\n k=k+1\r\nif laimigie==4 or laimigie==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Петя любит счастливые числа. Всем известно, что счастливыми являются положительные целые числа, в десятичной\r\n# записи которых содержатся только счастливые цифры 4 и 7. Например, числа 47, 744, 4 являются счастливыми, а 5, 17,\r\n# 467 — не являются.\r\n#\r\n# К сожалению, не все числа счастливые. Петя называет число почти счастливым, если количество счастливых цифр в нем\r\n# — счастливое число. Ему интересно, является ли число n почти счастливым.\r\n#\r\n# Входные данные\r\n# В единственной строке задано целое число n (1 ≤ n ≤ 1018).\r\n#\r\n# Пожалуйста, не используйте спецификатор %lld для чтения или записи 64-битных чисел на С++. Рекомендуется\r\n# использовать потоки cin, cout или спецификатор %I64d.\r\n#\r\n# Выходные данные\r\n# В единственной строке выведите «YES», если число n — почти счастливое, и «NO» в противном случае (без кавычек).\r\n\r\nn = list(map(int, input()))\r\na = n.count(7)\r\nb = n.count(4)\r\nif a + b == 4 or a + b == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ncnt = 0\r\nwhile n:\r\n if n%10 == 4 or n%10 == 7:\r\n cnt+=1\r\n n//=10\r\nif cnt == 4 or cnt == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\ns=0\r\nfor i in a:\r\n if (i==\"4\") or (i==\"7\"):\r\n s=s+1\r\n\r\ns=str(s)\r\nif s.find(\"1\")==-1 and s.find(\"2\")==-1 and s.find(\"3\")==-1 and s.find(\"5\")==-1 and s.find(\"6\")==-1 and s.find(\"8\")==-1 and s.find(\"9\")==-1 and s.find(\"0\")==-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n= input()\r\na=0\r\nfor i in n:\r\n if(i==\"4\" or i==\"7\"):\r\n a +=1\r\nb=0\r\nfor i in str(a):\r\n if(i==\"4\" or i==\"7\"):\r\n b+=1\r\nif(b==len(str(a))):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = input()\r\nlucky_digits = 0\r\nis_nearly_lucky = True\r\n\r\nfor digit in num:\r\n if digit == \"4\" or digit == \"7\":\r\n lucky_digits += 1\r\n\r\nfor digit in str(lucky_digits):\r\n if digit != \"4\" and digit != \"7\":\r\n is_nearly_lucky = False\r\n print(\"NO\")\r\n break\r\n\r\nif is_nearly_lucky:\r\n print(\"YES\")", "n=input()\r\na,b=int(n.count('4')),int(n.count('7'))\r\nprint(\"YES\" if a+b==4 or a+b==7 else \"NO\")", "def lucky_number(num):\r\n count = 0\r\n for i in num:\r\n if i == '4' or i == '7':\r\n count += 1\r\n # print(count)\r\n if count == 4 or count == 7:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n num = input()\r\n print(lucky_number(num))", "count = 0\r\na = str(input())\r\nif \"7\" in a or \"4\" in a:\r\n for i in a:\r\n if i == \"7\" or i == \"4\":\r\n count += 1\r\n if count == 4 or count == 7:\r\n print(\"YES\")\r\n\r\n elif count != 4 or count != 7:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 26 16:36:44 2023\r\n\r\n@author: ghp\r\n\"\"\"\r\n\r\nnumber=input()\r\nk=0\r\nfor i in range(len(number)):\r\n if number[i]=='4'or number[i]=='7':\r\n k=k+1\r\nlucky=str(k)\r\nresult='YES'\r\nfor j in range(len(lucky)):\r\n if lucky[j]!='4' and lucky[j]!='7':\r\n result='NO'\r\nprint(result)", "s = input()\r\nx = s.count('4')\r\ny = s.count('7')\r\nz = list(set(str(x + y)))\r\n\r\nif len(z) == 1 or len(z) == 2:\r\n if len(z) == 1:\r\n if z[0] == '4' or z[0] == '7':\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n if sorted(z) == ['4', '7']:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "list1=list(str(input()))\r\nn=list1.count('4')+list1.count('7')\r\nif n!=0 and (n==4 or n==7):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n = input()\r\ncount = 0\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n count += 1\r\nris = 'YES'\r\nfor i in str(count):\r\n if i != '4' and i != '7':\r\n ris = 'NO'\r\nprint(ris)\r\n", "n=int(input())\r\na=str(n)\r\nif (a.count(\"4\")+a.count(\"7\"))==4 or (a.count(\"4\")+a.count(\"7\"))==7:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "n = input()\ncount = 0\nfor i in range(len(n)):\n c = n[i]\n if c == '4' or c == '7':\n count += 1\n else:\n continue\nif count == 4 or count == 7:\n print('YES')\nelse:\n print('NO')", "k=0\r\nk=input()\r\nk1=0\r\nfor i in k:\r\n if i== '4' or i== '7':\r\n k1=k1+1\r\nif k1==7 or k1==4:\r\n print(\"YES\")\r\nelse:\r\n print(\" NO\")", "num = input()\r\nnumList = list(num)\r\n\r\nstatement = \"NO\"\r\ncounter = 0\r\n\r\nfor i in numList:\r\n if i == \"4\" or i == \"7\":\r\n counter += 1\r\nif counter == 4 or counter == 7:\r\n statement = \"YES\"\r\n\r\nprint(statement)\r\n", "n = int(input())\n\n\ndgts = 0\ncnt = 0\n\nwhile n > 0:\n\tif n % 10 in [4, 7]:\n\t\tcnt += 1\n\tdgts += 1\n\tn //= 10\n\nif cnt in [4, 7]:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "n = int(input())\r\nk = 0\r\nwhile n:\r\n if n%10 == 4 or n%10 == 7:\r\n k += 1\r\n n //= 10\r\nif k:\r\n con = True\r\nelse:\r\n con = False\r\nwhile con and k:\r\n if k%10 != 4 and k%10 != 7:\r\n con = False\r\n k //= 10\r\nprint(\"YES\" if con else \"NO\")\r\n", "num = input()\r\ncount = 0\r\nfor val in num:\r\n if val == \"4\" or val == \"7\":\r\n count += 1\r\n\r\nif count == 7 or count == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Nearly Lucky Number Difficulty:800\r\nn = input()\r\ns = 0\r\nnum = n.count('4')+n.count('7')\r\nnum_ = str(num)\r\nlucky = ['4', '7']\r\nfor i in range(len(num_)):\r\n if num_[i] not in lucky:\r\n print(\"NO\")\r\n s += 1\r\n break\r\nif s == 0:\r\n print(\"YES\")", "num = input()\r\nbased = []\r\nfor n in num:\r\n if n not in ['4', '7']:\r\n continue\r\n based.append(n)\r\n\r\nn = str(len(based))\r\n\r\nfor ele in n:\r\n if ele != '4' and ele != '7':\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n = int(input())\r\ncount = 0\r\nwhile n > 0:\r\n digit = n % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n n = n // 10\r\n\r\n# print(count)\r\nif count == 4 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ncnt = str(s.count('4') + s.count('7'))\r\nif cnt.count('4') + cnt.count('7') == len(cnt):\r\n print('YES')\r\nelse:\r\n print('NO')", "l=input()\r\ncnt=0\r\nc=1\r\n\r\nfor i in l:\r\n\r\n if i=='4' or i=='7':\r\n cnt=cnt+1\r\ncnt=str(cnt)\r\n\r\n#####\r\nfor i in cnt:\r\n if i=='4' or i=='7':\r\n continue\r\n else:\r\n print(\"NO\")\r\n c=0\r\n break\r\nif c==1:\r\n print(\"YES\")", "n = input()\r\n\r\nlucky_count = n.count('4') + n.count('7')\r\n\r\nif lucky_count == 4 or lucky_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "number = list(str(input()))\r\n\r\nif (number.count('4') + number.count('7')) in [4,7]: print(\"YES\")\r\nelse: print(\"NO\")", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef count_lucky_digits(number):\r\n count = 0\r\n for digit in str(number):\r\n if is_lucky_digit(digit):\r\n count += 1\r\n return count\r\n\r\ndef is_lucky(num):\r\n return num == 4 or num == 7\r\n\r\ndef is_nearly_lucky(number):\r\n lucky_digit_count = count_lucky_digits(number)\r\n return is_lucky(lucky_digit_count)\r\n\r\n# Main code\r\nn = input().strip()\r\nif is_nearly_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "number = list(int(digit) for digit in str(input()))\r\ncounter = 0\r\ntag = \"NO\"\r\nfor num in number:\r\n if num == 4:\r\n counter += 1\r\n elif num == 7:\r\n counter += 1\r\nnumber_set = list(int(set0) for set0 in str(counter))\r\nfor set1 in number_set:\r\n if int(set1) == 4:\r\n tag = \"YES\"\r\n elif int(set1) == 7:\r\n tag = \"YES\"\r\n else:\r\n tag = \"NO\"\r\nprint(tag)\r\n", "n=int(input())\r\nc=0\r\ns=str(n)\r\na=s.count('4')\r\nb=s.count('7')\r\nc=a+b\r\nd=int(c)\r\nif(d==4 or d==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_lucky(n):\r\n if n in [4,7]:\r\n return 'YES'\r\n elif n in [0,1,2,3,5,6,8,9]:\r\n return 'NO'\r\n else:\r\n if n % 10 not in [4,7]:\r\n return 'NO'\r\n else:\r\n return is_lucky(n // 10)\r\n\r\n\r\nst = input()\r\nprint(is_lucky(st.count('4')+st.count('7')))", "n=str(input())\r\ncount=0\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n count+=1\r\n\r\ny=str(count)\r\nf=0\r\nz=str(count)\r\nx=len(z)\r\nfor j in y:\r\n if j == '4' or j == '7':\r\n f+=1\r\n \r\nif f==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nc = n.count('7') + n.count('4')\r\nif c in (7,4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# O(n)\n\nn = input()\ncontador = 0\nfor i in n:\n if i == '4' or i == '7':\n contador += 1\nif contador == 7 or contador == 4:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t\t\t\t\t \t \t\t\t\t\t\t \t\t\t\t", "def lucky_number(num):\r\n return all(digit in '47' for digit in str(num))\r\n\r\n\r\nn = int(input())\r\n \r\ncount = sum(1 for digit in str(n) if digit in '47')\r\n\r\nif lucky_number(count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "number = input()\r\n\r\nfours = number.count('4')\r\nsevens = number.count('7')\r\n\r\ntotal_lucky = fours + sevens\r\n\r\nif total_lucky == 4:\r\n print(\"YES\")\r\nelif total_lucky == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "masuk = input()\r\ntemp = 0\r\nfor i in masuk:\r\n if i ==\"4\"or i==\"7\":\r\n temp +=1\r\nif temp == 4 or temp==7:\r\n print('YES')\r\nelse:print('NO')", "s=input()\r\nc=0\r\nfor ele in s:\r\n if ele=='4' or ele=='7':\r\n c=c+1\r\nif c==7 or c==4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef count_lucky_digits(n):\r\n count = 0\r\n while n > 0:\r\n if is_lucky_digit(str(n % 10)):\r\n count += 1\r\n n //= 10\r\n return count\r\n\r\ndef is_lucky_number(n):\r\n return n == 4 or n == 7\r\n\r\ndef is_nearly_lucky_number(n):\r\n lucky_digit_count = count_lucky_digits(n)\r\n return is_lucky_number(lucky_digit_count)\r\n\r\ndef main():\r\n n = int(input())\r\n if is_nearly_lucky_number(n):\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "t=input()\r\nct=0\r\nc=1\r\n \r\nfor i in t:\r\n \r\n if i=='4' or i=='7':\r\n ct=ct+1\r\nct=str(ct)\r\n \r\n\r\nfor i in ct:\r\n if i=='4' or i=='7':\r\n continue\r\n else:\r\n print(\"NO\")\r\n c=0\r\n break\r\nif c==1:\r\n print(\"YES\")", "n=input()\r\ncount1=0\r\nfor i in n:\r\n if i =='4'or i=='7':\r\n count1+=1\r\nif count1==4 or count1==7 :\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\nx=str(n.count('4')+n.count('7'))\r\nif x.count('4')+x.count('7')==len(x):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\r\nn7 = n.count(\"7\")\r\nn4 = n.count(\"4\")\r\nif n7+n4 == 7 or n7+n4 == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=list(s)\r\nb=a.count('4')+a.count('7')\r\nif b==4 or b==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nk=a.count('4')+a.count('7')\r\nif k==7 or k==4:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\ne = n.count('4') + n.count('7')\r\nt = set(str(e))\r\nif t == {'4', '7'} or t == {'4'} or t == {'7'}:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nn = str(n)\r\ncount = 0\r\nfor i in range(0,len(n)):\r\n if ((n[i]=='4') or (n[i]=='7')) :\r\n count += 1\r\nif ((count == 4) or (count == 7)) :\r\n print('YES')\r\nelse :\r\n print('NO')", "s=input()\r\ncount=0\r\nflag=1\r\nfor i in s:\r\n if i=='4' or i=='7':\r\n count+=1\r\ncount=str(count)\r\nfor i in count:\r\n if i!='7' and i!='4':\r\n flag=0\r\n break\r\nif flag==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nn=str(n)\r\nsum=0\r\nfor i in n:\r\n if int(i)==4 or int(i)==7:\r\n sum+=1\r\n else:\r\n continue\r\nif sum==4 or sum==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = list(input())\r\nhappy_nums = 0\r\n\r\nfor num in n:\r\n if num == '4' or num == '7':\r\n happy_nums += 1\r\n\r\nif happy_nums == 4 or happy_nums == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nn_str = str(n)\r\ncount = 0\r\nfor digit in n_str:\r\n if (digit == \"4\" or digit == \"7\"):\r\n count += 1\r\nif all(d == '4' or d== '7' for d in str(count)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\nempat = 0\ntujuh = 0\n\nfor itr in n:\n if itr == \"4\":\n empat += 1\n elif itr == \"7\":\n tujuh += 1\n \nif (empat + tujuh == 4) or (empat + tujuh == 7):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t \t\t\t\t\t \t\t\t \t\t \t \t\t \t \t", "x = input(\"\")\r\nluck = 0\r\nfor a in x:\r\n if int(a) == 4 or int(a) == 7:\r\n luck = luck + 1 \r\n\r\nfor a in str(luck):\r\n if int(a) == 4 or int(a) == 7:\r\n continue\r\n else:\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")\r\n \r\n \r\n\r\n", "a=input()\r\nl=list(a)\r\ns=0\r\nfor i in l:\r\n b=int(i)\r\n if b in [4,7]:\r\n s+=1\r\nl1=list(str(s))\r\nmess='YES'\r\nfor i in l1:\r\n if int(i) != 4 and int(i)!=7:\r\n mess='NO'\r\nprint(mess)\r\n", "n = int(input())\ni = 0\nfor d in str(n):\n if d == '4' or d == '7':\n i += 1\nn = all(d == '4' or d == '7' for d in str(i))\nif n:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t \t \t\t \t\t\t\t\t\t\t \t", "number_test_list=list(input())#int不能被list化\r\nnum_lucky=0\r\nfor i in range(len(number_test_list)):\r\n if number_test_list[i] in [\"4\",\"7\"]:\r\n num_lucky+=1\r\n\r\ntest=True\r\nlucky_list=list(str(num_lucky))#因为int不能被list化\r\nfor j in range(len(lucky_list)):\r\n if lucky_list[j] not in [\"4\",\"7\"]:\r\n test=False\r\n\r\nif test:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\na=n.count('4')\r\nb=n.count('7')\r\nc=a+b\r\nif c==4 or c==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nsu = 0\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n su += 1\r\nif su == 4 or su == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\r\ncount = 0\r\n\r\nfor i in range(len(x)):\r\n if (x[i] == \"4\" or x[i] == \"7\"):\r\n count += 1\r\n\r\nif (count == 4 or count == 7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = str(input())\r\nintegers = list(n)\r\ncount = 0\r\n\r\nfor i in range(len(integers)):\r\n if integers[i] == '4' or integers[i] == '7':\r\n count += 1\r\n\r\nif count == 4 or count == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\n\r\ncount = 0\r\n\r\ncount += n.count(\"4\")\r\ncount += n.count(\"7\")\r\n\r\nif count == 7 or count == 4:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "cant=0\nres=\"YES\"\ns=input()\nfor x in s:\n if(x=='4' or x=='7'):\n cant+=1\n\ncant=str(cant)\n\nfor x in cant:\n if(x!='4' and x!='7'):\n res=\"NO\"\nprint(res)\n\n", "x = int(input())\r\nlucky = []\r\ny = str(x)\r\n\r\nfor i in range(len(y)):\r\n if y[i] == '4' or y[i] == '7':\r\n lucky.append(y[i])\r\n\r\n\r\nif str(len(lucky))[len(str(len(lucky))) - 1] == '4' or str(len(lucky))[len(str(len(lucky))) - 1] == '7':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n =input()\r\nn = [int(i) for i in n]\r\nn1 =n.count(4) + n.count(7)\r\nif n1==7 or n1==4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\nb=0\nc=str(a)\nfor i in range(len(c)):\n if c[i]==\"4\" or c[i]==\"7\":\n b+=1\nif b==4 or b==7:\n print(\"YES\")\nelse: \n print(\"NO\")\n \t\t\t\t \t \t \t \t \t \t\t \t\t\t\t\t\t", "n=list(input())\r\nf=map(int,n)\r\nm=0\r\nfor i in f:\r\n if i==4 or i==7:\r\n m+=1\r\n\r\nt=list(str(m))\r\nq=map(int,t)\r\nfor s in q:\r\n if s!=4 and s!=7:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n ", "petya_input = input()\r\ncount = 0\r\nfor i in range(len(petya_input)):\r\n if petya_input[i] == \"4\" or petya_input[i] == \"7\":\r\n count += 1\r\nif count == 4 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m = input();\r\nprint([\"NO\", \"YES\"][m.count('7')+m.count('4') in [7,4]])\r\n", "n = input()\r\nc = 0\r\nfor digit in n:\r\n if digit == '4' or digit == '7':\r\n c += 1\r\nif c == 4 or c == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "number = input()\r\nluckyCounter = 0\r\nfor i in range(0,len(number)):\r\n z = int(number[i]) == 4\r\n y = int(number[i]) == 7\r\n if z == True:\r\n luckyCounter += 1\r\n elif y == True:\r\n luckyCounter +=1\r\n\r\nif luckyCounter == 4:\r\n print(\"YES\")\r\nelif luckyCounter == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ncount = 0\r\nfor i in n:\r\n if i == \"4\" or i == \"7\":\r\n count += 1\r\n\r\nprint(\"YES\" if count == 7 or count == 4 else \"NO\")\r\n", "def solve():\r\n n = int(input())\r\n luck = 0\r\n while n:\r\n rem = n%10\r\n if rem == 4 or rem == 7:\r\n luck+=1\r\n n = n//10\r\n if luck == 4 or luck == 7:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(solve())\r\n", "n = input()\ncnt = 0\nfor char in n:\n if char == '4' or char == '7':\n cnt += 1\nfor char in str(cnt):\n if char != '4' and char != '7':\n print('NO')\n break\nelse:\n print('YES')\n\t\t\t \t \t \t \t\t \t\t \t\t\t\t \t\t", "first_line=input()\r\ncounter= 0\r\nfor i in first_line:\r\n if i =='7' or i =='4':\r\n counter+=1\r\n \r\nif counter==4 or counter == 7:\r\n print ('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nans = 0\r\nfor i in a:\r\n if i in ['4', '7']:\r\n ans += 1\r\nif ans == 4 or ans == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "petya_num = list(input())\r\nlucky_list = []\r\n\r\nfor num in petya_num:\r\n if num == '4' or num == '7':\r\n lucky_list.append(num)\r\n\r\n\r\nif len(lucky_list) == 7 or len(lucky_list) == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if __name__ == '__main__':\r\n n = input()\r\n num_ld = 0\r\n count = 0\r\n for digit in n:\r\n if digit == '4' or digit == '7':\r\n num_ld = num_ld + 1\r\n for digit in str(num_ld):\r\n if digit not in ['4', '7']:\r\n print('NO')\r\n break\r\n elif digit == '4' or digit == '7':\r\n count = count + 1\r\n if count == len(str(num_ld)):\r\n print('YES')\r\n", "import sys\r\nimport math\r\ndef result(N):\r\n if (N < 4):\r\n return False\r\n while (N > 0):\r\n if (N % 10 != 4 and N % 10 != 7):\r\n return False\r\n N = N // 10\r\n return True\r\nN = int(input())\r\ncount = 0\r\nwhile (N > 0):\r\n if (N % 10 == 4 or N % 10 == 7):\r\n count = count + 1\r\n N = N // 10\r\nif (result(count)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "numero = input(\"\")\r\nif int(numero)<0 or int(numero)>10**18:\r\n exit(1)\r\nconta = 0\r\nfor i in range(len(numero)):\r\n if numero[i]=='4' or numero[i]=='7':\r\n conta += 1\r\nif conta==4 or conta==7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import *\r\nn = input()\r\nval1 = n.count(\"4\")\r\nval2 = n.count(\"7\")\r\nans = str(val1 + val2)\r\n\r\nfor i in str(ans):\r\n if i not in \"47\":\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "dic=[4,7]\r\nst=input()\r\ndef islucky(x):\r\n if x in dic:\r\n return True\r\n else:\r\n return False\r\ncnt=0\r\nfor i in st:\r\n if islucky(int(i)):\r\n cnt+=1\r\nif cnt in dic:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "angka = input()\r\njumlah=0\r\nfor karakter in angka:\r\n if karakter== '4' or karakter =='7':\r\n jumlah += 1\r\nif jumlah == 4 or jumlah == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nk = 0\n\nwhile n > 0:\n if n%10 == 4 or n%10 == 7:\n k += 1\n n //= 10\n\nif k == 0:\n print(\"NO\")\nelse:\n while k > 0:\n if k%10 != 4 and k%10 != 7:\n print(\"NO\")\n break\n k //= 10\n else:\n print(\"YES\")", "liste=list(input())\r\ncmp=0\r\nfor i in liste:\r\n if i=='7' or i=='4':\r\n cmp +=1\r\nif cmp == 4 or cmp == 7 :\r\n print('YES')\r\nelse :\r\n print('NO')", "n=input()\r\nc=0\r\nfor i in n:\r\n if i in ['4','7']:\r\n c+=1\r\nif c in [4,7]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\n\r\ncol = 0\r\n\r\nfor i in range(len(n)):\r\n if n[i] == '4' or n[i] == '7':\r\n col += 1\r\nif col == 4 or col == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\ncount = 0\nfor c in s:\n\tif c == \"4\" or c == \"7\":\n\t\tcount = count + 1\n\nif count == 4 or count == 7:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n = input()\r\nlucky_digits = n.count('4') + n.count('7')\r\n\r\nlucky_count = 0\r\nfor digit in str(lucky_digits):\r\n if digit == '4' or digit == '7':\r\n lucky_count += 1\r\n\r\nif lucky_count == len(str(lucky_digits)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def count_lucky_digits(n):\r\n count = 0\r\n while n > 0:\r\n digit = n % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n n //= 10\r\n return count\r\n\r\nn = int(input())\r\nlucky_count = count_lucky_digits(n)\r\n\r\ndef is_lucky(num):\r\n return num == 4 or num == 7\r\n\r\nif is_lucky(lucky_count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\n\r\nlucky_count = n.count('4') + n.count('7')\r\n\r\ndef is_lucky(number):\r\n return all(digit in '47' for digit in str(number))\r\n\r\nif is_lucky(lucky_count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Nearly Lucky Number\r\n\r\nn = int(input())\r\n\r\n\r\na = n\r\nresiduos = []\r\nwhile a>0:\r\n r = a%10\r\n a = a//10\r\n residuos.insert(0,r)\r\n\r\nf_s = residuos.count(4)\r\ns_s = residuos.count(7)\r\n\r\nif (f_s + s_s)==4 or (f_s + s_s)==7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "x=input()\r\nl=[i for i in x]\r\nc=0\r\nfor i in l:\r\n if i=='4' or i=='7':\r\n c+=1\r\nif(c==4 or c==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\");", "def count_lucky_digits(qt):\r\n count = 0\r\n while qt > 0:\r\n digit =qt % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n qt //= 10\r\n return count\r\n\r\ndef lucky_num(n):\r\n return n == 4 or n == 7\r\n\r\ndef is_nearly_lucky(qt):\r\n digit_count = count_lucky_digits(qt)\r\n return lucky_num(digit_count)\r\n\r\nqt = int(input())\r\n\r\nif is_nearly_lucky(qt):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def isLucky(s):\r\n s = str(s)\r\n for i in range(len(s)):\r\n if s[i] != \"4\" and s[i] != \"7\":\r\n return False\r\n return True\r\n\r\n\r\na = input()\r\ncnt = a.count(\"4\") + a.count(\"7\")\r\nif isLucky(cnt):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\n\r\nif n.count('4') + n.count('7') in [4,7]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef is_lucky_number(number):\r\n return all(is_lucky_digit(digit) for digit in str(number))\r\n\r\nn = int(input())\r\nlucky_count = str(n).count('4') + str(n).count('7')\r\n\r\nif is_lucky_number(lucky_count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 12 23:29:59 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nm=0\ns=0\nn=input()\nif 1<=int(n)<=10**18:\n list=[]\n for i in n:\n list.append(i)\n list0=set(list)\n for i in list0:\n if i=='4':\n m+=list.count(i)\n if i=='7':\n s+=list.count(i)\n k=m+s\n if k==4 or k==7:\n print('YES')\n else:\n print('NO')\n", "n = input()\r\n\r\ncount = 0\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n count += 1\r\n\r\nif count == 4 or count == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\nimport math\r\nfrom os import path\r\ndef input():\r\n return sys.stdin.readline().strip()\r\ndef intl():\r\n return(list(map(int,input().split())))\r\ndef iinput():\r\n return(int(input()))\r\ndef main():\r\n testcases = 1\r\n #testcases = iinput()\r\n for _ in range(testcases):\r\n s = input()\r\n seven = s.count('7')\r\n four = s.count('4')\r\n if four+seven in [4,7]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\nif __name__ == \"__main__\":\r\n if(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n main()", "def is_lucky_digit(digit):\r\n return digit=='4' or digit=='7'\r\ndef is_nearly_lucky(n):\r\n count_lucky_digits=0\r\n for digit in str(n):\r\n if is_lucky_digit(digit):\r\n count_lucky_digits+=1\r\n return is_lucky_digit(str(count_lucky_digits))\r\n\r\nn=int(input())\r\nif is_nearly_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nx=s.count('4')+s.count('7')\r\nif x==4 or x==7:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "def main():\r\n user_i = input()\r\n lucky_number_count = 0\r\n for i in user_i:\r\n if i == \"4\" or i == \"7\":\r\n lucky_number_count += 1\r\n \r\n if lucky_number_count == 4 or lucky_number_count == 7:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\n\r\nlucky_count = 0\r\n\r\nfor digit in str(n):\r\n if digit == '4' or digit == '7':\r\n lucky_count += 1\r\n\r\nlucky_count_str = str(lucky_count)\r\n\r\nif all(digit == '4' or digit == '7' for digit in lucky_count_str):\r\n if lucky_count_str.count('4') == 0 or lucky_count_str.count('7') == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "n=input()\nk=0\nfor i in n:\n if i=='4'or i=='7':\n k+=1\nif k==4 or k==7:\n print('YES')\nelse:\n print('NO')\n \t\t\t\t \t \t \t \t\t \t\t \t\t\t \t", "\r\ns = input()\r\nif(s.count('4')+s.count('7') in {4,7}):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nc1=0\r\nc2=0\r\nd=len(a)\r\nif(d>1):\r\n for i in a:\r\n if i == \"4\":\r\n c1+=1\r\n if i == \"7\":\r\n c2+=1\r\n if((c1+c2)==4 or (c1+c2)==7):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n ", "arr = list(input())\r\ntotal = arr.count(\"4\") + arr.count(\"7\")\r\nif total == 4 or total == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = input()\r\ncount = 0\r\nfor i in n:\r\n if (i == '4') or (i == '7'):\r\n count+=1\r\n# print(str(count))\r\nflag=0\r\n# print(str(count))\r\nfor j in str(count):\r\n \r\n if (j=='4') or (j=='7'):\r\n flag=0\r\n else:\r\n flag=1\r\n# print(flag)\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "a = input()\r\nk = 0\r\nfor i in range(len(a)):\r\n if a[i] in ['4', '7']:\r\n k += 1\r\nprint(\"YES\" if k == 4 or k == 7 else \"NO\")\r\n", "s=int(input(\"\"))\r\nx=str(s) \r\ncount=0\r\nfor i in range(len(x)):\r\n if int(x[i])==4 or int(x[i])==7:\r\n count+=1\r\n else:\r\n pass\r\nif count==4 or count==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "number=list(input())\r\nn=0\r\nfor digit in number:\r\n if digit==\"4\" or digit==\"7\":\r\n n+=1\r\nnum=list(str(n))\r\nwhile \"4\" in num:\r\n num.remove(\"4\")\r\nwhile \"7\" in num:\r\n num.remove(\"7\")\r\nif num==[]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\nnumbers = []\r\na = 0\r\nfor i in range(len(x)):\r\n numbers.append(x[i])\r\nwhile '4' in numbers:\r\n numbers.remove('4')\r\n a += 1\r\nwhile '7' in numbers:\r\n numbers.remove('7')\r\n a += 1\r\n\r\na_ = []\r\nb = str(a)\r\nfor i in range(len(b)):\r\n a_.append(b[i])\r\nwhile '4' in a_:\r\n a_.remove('4')\r\nwhile '7' in a_:\r\n a_.remove('7')\r\nif a != 0:\r\n if a_:\r\n print('NO')\r\n else:\r\n print('YES')\r\nelif a == 0:\r\n print('NO')\r\n", "s = str(input())\r\nk = s.count(\"4\") + s.count(\"7\")\r\nif k == 4 or k == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t = 1\r\n# t = int(input())\r\nwhile bool(t):\r\n n = int(input())\r\n lucky_digits = ['4', '7']\r\n cnt = 0\r\n\r\n for digit in str(n):\r\n if digit in lucky_digits:\r\n cnt += 1\r\n\r\n cnt = str(cnt)\r\n result = \"YES\" if cnt in lucky_digits else \"NO\"\r\n print(result)\r\n\r\n t -= 1\r\n", "n=input()\r\nl=len(n)\r\nsum=0\r\nfor i in range(l):\r\n if n[i]==\"4\" or n[i]==\"7\":\r\n sum+=1\r\nif sum==4 or sum==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ncnt = n.count('4') + n.count('7')\r\nfor x in str(cnt):\r\n if x != '4' and x != '7':\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "a = input()\r\nprint(\"YES\" if a.count(\"7\") + a.count(\"4\") in {4, 7} else \"NO\")\r\n", "\r\n#СЛИШКОМ ДЛИННЫЕ СЛОВА\r\n'''\r\nn = int(input())\r\nfor i in range(n):\r\n\ts = input()\r\n\ts1 =\" \"\r\n\tif(len(s)>10):\r\n\t\ts1 = s[0]\r\n\t\ts1 += str(len(s)-2)\r\n\t\ts1 += s[-1]\r\n\telse:\r\n\t\ts1 = s\r\n\tprint(s1)\r\n'''\r\n#КОМАНДА\r\n'''\r\n#include <iostream>\r\n \r\nusing namespace std;\r\n \r\nint main()\r\n{\r\n int a,b,f,c,d,count=0;\r\n cin>>d;\r\n for(int i;i<d;i++){\r\n cin>>a>>b>>c;\r\n if (a+b+c==3 || a+b+c==2){\r\n count++;\r\n f=count;\r\n \r\n }\r\n \r\n}\r\ncout<<f;\r\n}\r\n'''\r\n#СЛЕДУЙЩИЙ РАУНД\r\n'''\r\na,b = map(int,input().split())\r\ncount = 0\r\nl = list(map(int,input().split()))\r\nfor i in range(a):\r\n if l[i] >= l[b-1] and l[i] > 0:\r\n count += 1\r\nprint(count)\r\n'''\r\n#Bit++\r\n'''\r\na=int(input())\r\ncount=0\r\nfor i in range(a):\r\n y=input()\r\n if (y==\"X++\" or y==\"++X\"):\r\n count+=1\r\n if (y==\"X--\" or y==\"--X\"):\r\n count-=1\r\nprint(count)\r\n'''\r\n#МАТЕМАТИКА СПЕШИТ НА ПОМОЩ\r\n'''\r\na=list(input())\r\na.sort()\r\nwhile (\"+\"in a):\r\n a.remove(\"+\")\r\ns=(\"+\").join(a)\r\nprint(s)\r\n'''\r\n#КАПИТАЛИЗАЦИЯ СЛОВА\r\n'''\r\na=list(input())\r\na[0]=a[0].upper()\r\nb=(\"\").join(a)\r\nprint(b)\r\n'''\r\n#ДЕВУШКА ИЛИ ЮНОША\r\n'''\r\na=list(input())\r\ncount=0\r\nl=[]\r\nfor i in range(len(a)):\r\n if a[i] not in l:\r\n l.append(a[i])\r\n count+=1\r\nif (count%2==0):\r\n print(\"CHAT WITH HER!\")\r\nif (count%2!=0):\r\n print(\"IGNORE HIM!\")\r\n'''\r\n#КАМНИ НА СТОЛЕ\r\n'''\r\nd=int(input())\r\ns=list(input())\r\ncount=0\r\nfor i in range (1,d):\r\n if(s[i-1]==s[i]):\r\n count+=1\r\nprint(count)\r\n'''\r\n#упражнение на строки\r\n'''\r\na=[\"A\",\"O\",\"Y\",\"E\",\"U\",\"I\",\"a\",\"o\",\"y\",\"e\",\"u\",\"i\"]\r\nn=list(input())\r\n\r\n'''\r\n#МИШКА И СТАРШИЙ БРАТ\r\n'''\r\na,b = map(int,input().split())\r\ncount=0\r\nwhile a<=b:\r\n a*=3\r\n b*=2\r\n count+=1\r\nprint(count)\r\n'''\r\n#СЛОНИК\r\n'''\r\nd=int(input())\r\nif (d%5==0):\r\n print(d//5)\r\nif (d%5!=0):\r\n print(d//5+1)\r\n'''\r\n#СОЛДАТ И БАНАНЫ\r\n'''\r\na,b,c= map(int,input().split())\r\ncount=1\r\nff=0\r\nfor i in range(c):\r\n d=a*count\r\n ff+=d\r\n count+=1\r\nif(ff<b):\r\n print(0)\r\nif(ff>=b):\r\n print(ff-b)\r\n'''\r\n#СЛОВО\r\n'''\r\na=[\"A\",\"B\",\"C\",\"D\",\"E\",\"F\",\"G\",\"H\",\"I\",\"J\",\"K\",\"L\",\"M\",\"N\",\"O\",\"P\",\"Q\",\"R\",\"S\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\",\"Z\"]\r\nb=[\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\",\"k\",\"l\",\"m\",\"n\",\"o\",\"p\",\"q\",\"r\",\"s\",\"t\",\"u\",\"v\",\"w\",\"x\",\"y\",\"z\"]\r\ng=list(input())\r\ncount1=0\r\ncount2=0\r\nfor i in range(len(a)):\r\n if (a[i]in g):\r\n count1+=1\r\n if (b[i]in g):\r\n count2+=1\r\ndd=(\"\").join(g)\r\nif(count2>=count1):\r\n ss=dd.lower()\r\n print(ss)\r\nif (count2<count1):\r\n hh=dd.upper()\r\n print(hh)\r\nprint(count1)\r\nprint(count2)\r\n'''\r\n#ЮНЫЙ ФИЗИК\r\n'''\r\ns=int(input())\r\nl=[]\r\ng=0\r\nfor i in range (s):\r\n for i in range(1):\r\n c,b,a = map(int, input().split())\r\n f=c+b+a\r\n l.append(f)\r\nfor i in range (len(l)):\r\n g+=l[i]\r\nif (g==0 and c+b+a!=-3):\r\n print(\"YES\")\r\nif (g!=0 or c==-3 and b==0 and a==0 ):\r\n print(\"NO\")\r\n\r\n'''\r\n#НЕПРАВИЛЬНОЕ ВЫЧИТАНИЕ\r\n'''\r\na,b= map(int,input().split())\r\nfor i in range(b):\r\n if(a%10!=0):\r\n a=a-1\r\n else:\r\n a = a // 10\r\nprint(a)\r\n'''\r\n#ФУТБОЛ\r\n'''\r\nf=list(input())\r\nd=[\"0\"]\r\nh=[\"1\"]\r\ncount=0\r\nc=0\r\nfor i in range(len(f)):\r\n if (d[0]in f):\r\n count+=1\r\n if(h[0]in f):\r\n c+=1\r\nif(c>=7 or count>=7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\nprint(c)\r\nprint(count)\r\n'''\r\n#Счастливое число\r\n\r\nf=list(input())\r\ncount=0\r\nwhile (\"4\"in f):\r\n s=f.remove(\"4\")\r\n count+=1\r\nwhile (\"7\"in f):\r\n d=f.remove(\"7\")\r\n count+=1\r\nif (count==4 or count==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = input()\r\ni = 0\r\n\r\nfor digit in num :\r\n if digit == \"4\" or digit == \"7\" :\r\n i += 1\r\n\r\nz = 0\r\n\r\nfor digit in str(i) :\r\n if digit == \"4\" or digit == \"7\" :\r\n z += 1\r\n\r\nif z == len(str(i)) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "def solve():\r\n s = input()\r\n total = s.count('4')+s.count('7')\r\n print('YES' if total == 4 or total == 7 else 'NO')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "n = int(input())\nn = str(n)\ncount = 0\n\nfor i in n:\n if i=='4' or i=='7':\n count+=1\n \n\nif count==4 or count==7:\n print('YES')\nelse:\n print('NO')\n \t \t \t \t\t\t\t\t \t\t\t\t \t", "def is_nearly_lucky(n):\r\n count = str(n).count('4') + str(n).count('7')\r\n return count in [4, 7]\r\n\r\nn = int(input())\r\nresult = \"YES\" if is_nearly_lucky(n) else \"NO\"\r\nprint(result)\r\n", "s = input()\r\nt = 0\r\nfor i in range(len(s)):\r\n if s[i] == '4' or s[i] == '7':\r\n t += 1\r\nt = str(t)\r\nfor i in range(len(t)):\r\n if t[i] == '4' or t[i] == '7':\r\n u = 0\r\n else:\r\n u = 1\r\n break\r\nif u == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef count_lucky_digits(number):\r\n count = 0\r\n while number > 0:\r\n digit = str(number % 10)\r\n if is_lucky_digit(digit):\r\n count += 1\r\n number //= 10\r\n return count\r\n\r\ndef is_nearly_lucky_number(n):\r\n lucky_digit_count = count_lucky_digits(n)\r\n return is_lucky_digit(str(lucky_digit_count))\r\n\r\nn = int(input())\r\nif is_nearly_lucky_number(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\na=sum(1 for i in n if i in '47')\r\nif a == 4 or a == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\ninput = sys.stdin.readline\n\nstr_list = list(input())\nstr_list.pop() # Removing the last newline character\ncount = 0\n\nfor char in str_list:\n if char == \"4\" or char == \"7\":\n count += 1\n\ncount_str = str(count)\n\nflag = True\n\nfor num in count_str:\n if int(num) != 4 and int(num) != 7:\n flag = False\n break\n\nif not flag:\n sys.stdout.write(\"NO\")\n\nelse:\n sys.stdout.write(\"YES\")\n", "import sys\r\na=list(sys.stdin.readline())[::-1]\r\nn=a.count('4') + a.count('7')\r\nif n in [4,7]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_lucky_number(num):\r\n lucky_digits = ['4', '7']\r\n for digit in str(num):\r\n if digit not in lucky_digits:\r\n return False\r\n return True\r\ndef count_lucky_digits(num):\r\n count = 0\r\n for digit in str(num):\r\n if digit in ['4', '7']:\r\n count += 1\r\n return count\r\nn = int(input())\r\nlucky_digit_count = count_lucky_digits(n) \r\nif is_lucky_number(lucky_digit_count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\n\nif a.count('4') + a.count('7') == 4 or a.count('4') + a.count('7') == 7:\n print('YES')\nelse:\n print('NO')\n", "n=int(input())\r\ncount=0\r\nwhile n>0:\r\n digit=n%10\r\n if digit==4 or digit==7:\r\n count+=1\r\n n//=10\r\nnearly=0\r\nwhile count>0:\r\n digit=count%10\r\n if digit!=4 and digit!=7:\r\n print(\"NO\")\r\n exit()\r\n count//=10\r\n nearly+=1\r\nif nearly==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=input() ; count=sum([1 for i in n if int(i) == 4 or int(i)==7]); print(\"YES\" if count==4 or 7==count else \"NO\")", "n = input()\nc = 0\nfor i in n:\n if i=='7' or i == '4':\n c+=1\nif c==4 or c==7:\n print('YES')\nelse:\n print('NO')\n\t \t\t \t \t\t \t \t \t \t\t", "nourinz=input()\r\nzz=0\r\nfor n in nourinz:\r\n if (int(n) ==4 or int(n) ==7 ):\r\n zz=zz+1\r\nif ((zz==4 or zz==7)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input() # Read the input number as a string\r\n\r\n# Count the number of lucky digits (4 and 7) in the string\r\nlucky_count = n.count('4') + n.count('7')\r\n\r\n# Check if the count is a lucky number (4 or 7)\r\nif lucky_count == 4 or lucky_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\ncount=0\r\nfor i in range(0, len(n)):\r\n if n[i] == \"4\" or n[i]==\"7\":\r\n count+=1\r\ncount=str(count)\r\nans=True\r\nfor i in range(0, len(count)):\r\n if count[i] == \"4\" or count[i]==\"7\":\r\n ans=True\r\n else:\r\n ans=False\r\n break\r\nif ans==False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n=input()\r\nif n.count(\"7\")+n.count(\"4\")==7 or n.count(\"7\")+n.count(\"4\")==4 or n.count(\"7\")+n.count(\"4\")==47:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\n\nb = 0\nfor i in a:\n if i == \"4\" or i == \"7\":\n b += 1 \n \n\n\nif b == 4 or b == 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t\t \t \t\t\t \t \t\t\t \t\t\t\t \t", "s = input()\r\ncont7 = s.count(\"4\")\r\ncont4 = s.count(\"7\")\r\nif cont7 + cont4 == 7 or cont7 + cont4 == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input number\r\nn = input()\r\n\r\n# Count the lucky digits (4 and 7) in the decimal representation of n\r\nlucky_count = sum(1 for digit in n if digit in \"47\")\r\n\r\n# Check if the count of lucky digits is a lucky number (4 or 7)\r\nif lucky_count == 4 or lucky_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_lucky(num):\r\n return all(digit in '47' for digit in num)\r\nn = input()\r\nlucky_count = sum(1 for digit in n if digit in '47')\r\nif is_lucky(str(lucky_count)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\ncnt = 0\r\ncnt += a.count(\"4\")\r\ncnt += a.count(\"7\")\r\ncnt = str(cnt)\r\nf = True\r\nfor i in range(len(cnt)):\r\n if cnt[i] != \"4\" and cnt[i] != \"7\":\r\n f = False\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=str(input())\r\ncik=n.count(\"4\")\r\ncik2=n.count(\"7\")\r\n\r\ncik3=cik+cik2\r\nif (cik3==7):\r\n print(\"YES\")\r\nelif (cik3==4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\nfour_count = 0\r\nseven_count = 0\r\nhappy = ['4', '7']\r\nfor i in n:\r\n if i == '4':\r\n four_count += 1\r\n elif i == '7':\r\n seven_count += 1\r\nresult = str(four_count + seven_count)\r\nfor j in result:\r\n if j not in happy:\r\n print('NO')\r\n break\r\n print('YES')\r\n\r\n", "n=int(input())\r\ncnt=0\r\nwhile n!=0:\r\n r=n%10\r\n if r==4 or r==7:\r\n cnt+=1\r\n n//=10\r\nif cnt==7 or cnt==4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "raw=input()\r\ncount=0\r\nfor i in raw:\r\n if i=='4'or i=='7':\r\n count+=1\r\nif count==4 or count==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\ndigits = [int(digit) for digit in str(n)]\n\nans = 0\nfor d in digits:\n if d == 4 or d == 7:\n ans += 1\n \nprint('YES' if ans == 4 or ans == 7 else 'NO')", "#a = input()\n \n#counter = 0\n#for c in a: \n# counter+=1 \n#print (counter)\n#if counter == 4 or counter == 7: \n# if '4' in a or '7'in a:\n# print(\"YES\")\n# else:\n# print(\"NO\")\n#else:\n# print(\"NO\")\n\n#2nd sol\n\na = input()\n \ncounter = 0\nfor c in a:\n if c == '4' or c == '7':\n counter+=1 \n#print (counter)\n\n\nif counter == 4 or counter == 7:\n print(\"YES\")\nelse:\n print(\"NO\")", "from collections import Counter\r\n\r\ncounter = Counter({\"lucky\": 0, \"unlucky\": 0})\r\nn = int(input())\r\nk = str(n)\r\n\r\nfor letter in k:\r\n l = int(letter)\r\n if l == 4 or l == 7:\r\n counter['lucky'] += 1\r\n else:\r\n counter['unlucky'] += 1\r\n \r\n\r\n\r\nprint(\"YES\" if counter[\"lucky\"] == 4 or counter[\"lucky\"] == 7 else \"NO\")", "n = input()\ncount = 0\nfor i in n:\n if i == \"4\" or i == \"7\":\n count += 1\ncount = str(count)\nfor i in count:\n if i != \"7\" and i != \"4\":\n print(\"NO\")\n exit()\nprint(\"YES\")\n", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef is_lucky_number(number):\r\n return number == '4' or number == '7'\r\n\r\ndef main():\r\n n = input()\r\n lucky_digit_count = sum(1 for digit in n if is_lucky_digit(digit))\r\n \r\n if is_lucky_number(str(lucky_digit_count)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = input()\r\nc = n.count('4') + n.count('7')\r\nif c == 0:\r\n print('NO')\r\nelse:\r\n while c > 0:\r\n r = c % 10\r\n if r != 4 and r != 7:\r\n print('NO')\r\n break\r\n c //= 10\r\n else:\r\n print(\"YES\")", "n = input()\r\n\r\ntotal = 0\r\n\r\nfor i in list(n):\r\n if i == \"4\" or i == \"7\":\r\n total += 1\r\n \r\n else:\r\n total = total\r\n \r\nif total == 4 or total == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\n\r\ncount = 0\r\nfor d in n:\r\n count += (d == '4' or d == '7')\r\n\r\nres = True\r\nfor d in str(count):\r\n if d != '4' and d != '7':\r\n res = False\r\n\r\nprint('YES' if res else 'NO')", "# Petya loves lucky numbers. We all know that lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.\n\n# Unfortunately, not all numbers are lucky. Petya calls a number nearly lucky if the number of lucky digits in it is a lucky number. He wonders whether number n is a nearly lucky number.\n# Input\n\n# The only line contains an integer n (1 ≤ n ≤ 1018).\n\n# Please do not use the %lld specificator to read or write 64-bit numbers in С++. It is preferred to use the cin, cout streams or the %I64d specificator.\n# Output\n\n# Print on the single line \"YES\" if n is a nearly lucky number. Otherwise, print \"NO\" (without the quotes).\n# Examples\n\ntest = list(map(int, list(input())))\n\ncount_lucky = 0\nlucky = True\nfor i in test:\n if i in [4,7]:\n count_lucky += 1\n # else:\n # lucky = False\n\n# print(lucky,count_lucky)\nif lucky and (count_lucky == 4 or count_lucky == 7):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a = input()\r\ncount = 0\r\nflag = 0\r\nfor i in range(len(a)):\r\n if a[i] == '4' or a[i]== '7':\r\n count+=1\r\nconvert = str(count)\r\nfor i in range(len(convert)):\r\n if convert[i] == '4' or convert[i] == '7':\r\n continue\r\n else:\r\n flag = 1 \r\n break\r\nif flag == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = str(input())\r\nans = 'NO'\r\ncounts = 0\r\nfor i in n:\r\n\tif i=='4' or i == '7':\r\n\t\tcounts += 1\t\t\r\nif counts ==4 or counts==7:\r\n\tans = 'YES'\t\t\r\nprint(ans)", "lis=[4,7]\n\nx=int(input())\nsum=0\n\nwhile x>0:\n y=x%10\n x=x//10\n if y in lis:\n sum+=1\n\nif sum in lis:\n print(\"YES\")\nelse:\n print('NO')\n\t\t\t \t \t \t \t\t\t \t \t \t \t\t\t", "a=[int(i) for i in list(input())]\r\nct=0\r\nfor i in a:\r\n if i==4 or i==7:\r\n ct+=1\r\nb=[int(i) for i in list(str(ct))]\r\nb_luck=True\r\nfor i in b:\r\n if i!=4 and i!=7:\r\n b_luck=False\r\nif b_luck:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\ncount = 0\r\nfor i in a:\r\n if i in [\"4\",\"7\"]:\r\n count += 1\r\nif count in [4,7]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input =input()\nluckyLen = 0\nfor i in range(len(input)):\n if input[i] == '4' or input[i] =='7':\n luckyLen +=1\nluckyLen = str(luckyLen)\nlucky = True\nfor l in luckyLen:\n if l!= '4' and l!= '7':\n lucky = False \nif lucky:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=(input())\r\n\r\ncnt=n.count(\"4\")+n.count(\"7\")\r\nt=set(str(cnt))\r\n\r\nif (len(t)==2 and \"4\" in t and \"7\" in t) or (len(t)==1 and (\"4\" in t or \"7\" in t)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\nnum = input()\r\n\r\ncount1 = len(re.findall(\"4\", num))\r\ncount2 = len(re.findall(\"7\", num))\r\n\r\n\r\nresult = count1 + count2\r\n\r\nif result == 7 or result ==4:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "n = input()\r\ns = list(i for i in n)\r\nx = 0\r\nfor i in s:\r\n if (int(i) == 4 or int(i) == 7): x += 1\r\n else: continue\r\nif (x == 4 or x == 7): print(\"YES\")\r\nelse: print(\"NO\")", "n = list(input())\r\nn = [int(x) for x in n]\r\na = 0\r\nfor i in range(0,len(n)):\r\n if n[i] == 4 or n[i] == 7:\r\n a += 1\r\nif a == 4 or a == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def luckynumber(num):\n if num == 0: \n return False\n while num > 0: \n if num % 10 not in [4, 7]: \n return False\n num = num // 10\n return True\n\ndef almostlucky(num): \n count = 0\n while num > 0: \n if num % 10 in [4, 7]: \n count += 1\n num = num // 10\n return luckynumber(count)\n\nnum = int(input())\n\nif almostlucky(num): \n print(\"YES\")\nelse: \n print(\"NO\")\n", "n = input()\nc = 0\nfor i in n:\n if int(i) == 4 or int(i) == 7:\n c += 1\nprint(\"YES\") if c == 4 or c == 7 else print(\"NO\")\n \t \t\t \t\t \t\t\t\t\t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\na = list(input())\r\ns = 0\r\nfor i in a:\r\n if i == '4' or i == '7' :\r\n s += 1\r\nif s == 4 or s == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "num = input()\r\ncount = 0\r\nvrdct = None\r\nfor i in num:\r\n if i == '4' or i == '7':\r\n count+=1\r\nvrdct = True if count == 4 or count == 7 else False\r\nif vrdct:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\n\ncount = Counter(input())\n\nif count['4'] + count['7'] in [4,7]:\n print('YES')\nelse:\n print('NO')\n", "\"\"\"n,k = map(int,input().split())\r\nvec = list(map(int,input().split()))\r\ntemp = sorted(vec)\r\ntemp[n-1],temp[k-1] = temp[k-1],temp[n-1]\r\nif k < n:\r\n temp[k:] = sorted(temp[k:])\r\nans = 0\r\nfor i in range(n):\r\n j = 0\r\n print(\"Before:\",j)\r\n for j in range(i,n):\r\n if(temp[i] == vec[j]):\r\n break\r\n if(i == j):\r\n continue\r\n if(i == 0):\r\n ans += vec[i]*vec[j]\r\n vec[i],vec[j] = vec[j],vec[i]\r\n continue\r\n ans += 2*min(vec[i],vec[j])*temp[0]+max(vec[i],vec[j])*temp[0]\r\n vec[i],vec[j] = vec[j],vec[i]\r\n print(\"After:\",j)\r\n print(\"i;\",i)\r\nprint(ans)\r\n\r\n#Code force problem 2\r\nn=int(input())\r\nwords = []\r\nfor i in range(n):\r\n words.append(input())\r\nfor i in words:\r\n if len(i)>10:\r\n print(i[0]+str(len(i)-2)+i[-1])\r\n else:\r\n print(i)\r\n\r\n\r\n#codeforce pb3\r\nn=int(input())\r\nres=0\r\nfor i in range(n):\r\n a=input()\r\n if a.count('1') >=2:\r\n res+=1\r\n\r\nprint(res)\r\n\r\n #codeforce pb4\r\n\r\nnoPac,kthPl = map(int,input().split())\r\nList = list(map(int,input().split()))\r\n\r\nprint(sum( i >= List[kthPl-1] and i>0 for i in List))\r\n##for i in List:\r\n## if i >= List[kthPl]:\r\n## s+=1\r\n##\r\n##print(s)\r\n\r\n #codeforce pb5\r\nn=int(input())\r\ns=0\r\n##print((List.count('++X') or List.count('X++')) - (List.count('--X') or List.count('X--')))\r\nfor i in range(n):\r\n r=input()\r\n if '+' in r:\r\n s+=1\r\n elif '-' in r:\r\n s-=1\r\n\r\nprint(s)\r\n\r\n #codeforce pb6\r\nm,n=map(int,input().split())\r\nprint(m*n//2)\r\n\r\n\r\n\r\n#pb 7\r\nList = list(list(map(int,input().split())) for i in range(5))\r\n\r\nr,c= 0,0\r\nfor i in range(5):\r\n if 1 in List[i]:\r\n r,c = i+1,List[i].index(1)+1\r\nprint(abs(3-r)+abs(3-c))\r\n\r\n\r\n#pb 8\r\nstr1 = input()\r\nstr2 = input()\r\n\r\nif str1.lower() < str2.lower():\r\n print(\"-1\")\r\nelif str2.lower() < str1.lower():\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n\r\n\r\n#pb 10\r\nn = input()\r\nif(n[0].isupper()):\r\n print(n)\r\nelse:\r\n n=n[0].upper()+n[1:]\r\n print(n)\r\n\r\n#pb 11\r\nn=input()\r\nnewn = ''\r\nfor i in n:\r\n if i not in newn:\r\n newn+=i\r\nif(len(newn)%2==0):\r\n print(\"CHAT WITH HER!\")\r\nelse:\r\n print('IGNORE HIM!')\r\n\r\n\r\n#pb BOB\r\n\r\nl,b = map(int,input().split())\r\nc=0\r\nwhile b >= l:\r\n l*=3\r\n b*=2\r\n c+=1\r\n\r\nprint(c)\r\n\r\n\r\n#pb Elep\r\n\r\nn = int(input())\r\nprint((n+4)/5)\r\n\"\"\"\r\n\r\n###pb S and B\r\n##k,n,w = map(int,input().split())\r\n##b=0\r\n####for i in range(1,w+1):\r\n#### if n<k:\r\n#### b+=(k-n)\r\n#### n+=b-k\r\n#### else:\r\n#### n-=k\r\n#### k*=i\r\n###### print(k)\r\n####print(b)\r\n##t\r\n\r\n###pb word\r\n##\r\n##n = input()\r\n##u,l=0,0\r\n##for i in n:\r\n## if i.isupper():\r\n## u+=1\r\n## elif i.islower():\r\n## l+=1\r\n##if u>l:\r\n## print(n.upper())\r\n##else:\r\n## print(n.lower())\r\n\r\n###pb WS\r\n##\r\n##n,k=map(str,input().split())\r\n##\r\n##for i in range(int(k)):\r\n## if(n[-1] == '0'):\r\n## n=str(int(n)//10)\r\n## else:\r\n## n=str(int(n)-1)\r\n##print(n)\r\n\r\nn=input()\r\n\r\ns=n.count('4') + n.count('7')\r\n\r\nif s in [4,7]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nstring=str(n)\r\ncount=0\r\nfor i in range(len(string)):\r\n if string[i]=='4' or string[i]=='7':\r\n count+=1\r\nif count==4 or count==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "s=input()\r\nk=0\r\nl=[\"4\", \"7\"]\r\nf=0\r\nfor i in range(len(s)):\r\n if s[i] in l:\r\n k+=1\r\nk=str(k)\r\nfor j in range(len(k)):\r\n if k[j] not in l:\r\n f=1\r\nif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\r\nif (s.count(\"4\")+s.count(\"7\")==4 or s.count(\"4\")+s.count(\"7\")==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\na=[]\r\ncount=0\r\nfor i in n:\r\n a.append(i)\r\n##print(a)\r\n\r\nfor j in a:\r\n if int(j)==4 or int(j)==7:\r\n count+=1\r\n else:\r\n continue\r\nif count==4 or count==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Input\r\nn = input()\r\n\r\n# Count the number of lucky digits (4 and 7) in n\r\nlucky_count = sum(1 for digit in n if digit in ['4', '7'])\r\n\r\n# Check if the count is a lucky number\r\nis_nearly_lucky = all(digit in ['4', '7'] for digit in str(lucky_count))\r\n\r\n# Output the result\r\nif is_nearly_lucky:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nst=str(n)\r\nfors=st.count(\"4\")\r\nsevens=st.count(\"7\")\r\nsum=fors+sevens\r\nif sum==4 or sum==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input()) # Read the input number\r\n\r\n# Count the number of lucky digits (4 and 7)\r\nlucky_count = str(n).count('4') + str(n).count('7')\r\n\r\n# Check if the count is a lucky number (4 or 7)\r\nif lucky_count == 4 or lucky_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\ncount = 0\r\nres = 0\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n res += 1\r\nif res == 4 or res == 7:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "a=input()\r\ncount=0\r\nm=0\r\nfor i in a:\r\n if i=='4' or i=='7':\r\n count+=1\r\nfor j in str(count):\r\n if j=='4' or j=='7':\r\n m+=1\r\n else:\r\n m-=10000000000000\r\nif m>0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nn_str = str(n)\r\nc=0\r\ncnt=0\r\nfor i in n_str:\r\n if int(i)==4 or int(i)==7:\r\n c+=1\r\nc_str= str(c)\r\nfor i in c_str:\r\n if int(i)!=4 and int(i)!=7:\r\n cnt=1\r\n break\r\nif(cnt==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def is_nearly_lucky(n):\r\n n_str = str(n)\r\n count = 0\r\n\r\n for digit in n_str:\r\n if digit == '4' or digit == '7':\r\n count += 1\r\n\r\n count_str = str(count)\r\n\r\n for digit in count_str:\r\n if digit != '4' and digit != '7':\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\n# Read the input number\r\nn = int(input())\r\n\r\n# Check if n is nearly lucky\r\nresult = is_nearly_lucky(n)\r\n\r\n# Print the result\r\nprint(result)", "n = input()\r\nc = int(n.count('4')) + int(n.count('7'))\r\nif c != 0 and c == 4 or c == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_lucky(digit):\r\n return digit=='4' or digit=='7'\r\ndef count_lucky(n):\r\n ct=0\r\n for i in str(n):\r\n if is_lucky(i):\r\n ct+=1\r\n return ct\r\nn=int(input())\r\nres=count_lucky(n)\r\nif is_lucky(str(res)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def es_casi_afortunado(n):\n dígitos_suerte = [4, 7]\n count = 0\n\n while n > 0:\n último_dígito = n % 10\n if último_dígito in dígitos_suerte:\n count += 1\n n //= 10\n\n return \"YES\" if count in dígitos_suerte else \"NO\"\n\nn = int(input())\nprint(es_casi_afortunado(n))\n\n\t \t\t\t \t\t\t \t \t\t \t \t \t", "n = input()\nz=n.count('4')+n.count('7')\nif z == 4 or z== 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t\t\t \t \t\t\t\t \t\t\t \t \t \t", "def check(num):\r\n if len(num) == 1:\r\n return \"NO\"\r\n count = 0\r\n for l in num:\r\n if l == '7' or l == '4':\r\n count += 1\r\n \r\n if(count == 4 or count == 7):\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\n\r\nnum = input()\r\nprint(check(num))", "a=int(input())\r\ns=0\r\nwhile a>0:\r\n e=a%10\r\n if e==4 or e==7:\r\n s=s+1\r\n a=a//10\r\nif s==4 or s==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "lucky_number_count=0\r\nn=list(input())\r\nfor i in n:\r\n if i=='4' or i=='7':\r\n lucky_number_count+=1\r\nif lucky_number_count==4 or lucky_number_count==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "def nearlyLuckyNumber():\r\n n = input()\r\n nearlyLucky = False\r\n count47 = 0\r\n for char in n:\r\n if char == \"4\" or char == \"7\":\r\n count47 += 1 \r\n if count47 > 7:\r\n break\r\n \r\n if count47 == 4 or count47 == 7:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nnearlyLuckyNumber()", "a=int(input())\r\nb=str(a)\r\ncounter=0\r\nfor i in b:\r\n if(i==\"7\"or i==\"4\"):\r\n counter=counter+1\r\nif(counter==4 or counter==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ncount=0\r\nfor i in s:\r\n if i=='4' or i=='7':\r\n count+=1\r\nif count==4 or count==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\ncnt = 0\r\nfor i in range(len(n)):\r\n if (n[i] == '4') or (n[i] == '7'):\r\n cnt += 1\r\n \r\nif cnt == 4 or cnt == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nluc = 0\r\nfor x in n:\r\n if x == '4' or x == '7':\r\n luc+=1\r\nif luc ==4 or luc == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nx=0\r\nfor i in range(len(n)):\r\n if n[i]=='4' or n[i]=='7':\r\n x=x+1\r\n else:\r\n x=x\r\nif x==4 or x==7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "def is_nearly_lucky(n):\n count = 0\n while n > 0:\n if n % 10 == 4 or n % 10 == 7:\n count += 1\n n //= 10\n return count in (4, 7)\n\nif __name__ == \"__main__\":\n n = int(input())\n print(\"YES\" if is_nearly_lucky(n) else \"NO\")\n \t \t \t \t \t \t \t\t \t\t\t \t \t", "s = input()\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] == \"4\" or s[i] == \"7\":\r\n count += 1\r\ncount = str(count)\r\nlucky = True\r\nfor ch in count:\r\n if ch == \"4\" or ch == \"7\":\r\n continue\r\n else:\r\n lucky = False\r\n print(\"NO\")\r\n break\r\nif lucky:\r\n print(\"YES\")", "n = [int(i) for i in list(input())]\r\n\r\ncount = 0\r\nfor digit in n:\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n\r\nif count != 4 and count != 7:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\ns = str(n)\r\ncount = 0\r\nfor i in s:\r\n if i == '4' or i == '7':\r\n count = count +1\r\nif count == 4 or count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the input number as a string\r\nn = input().strip()\r\n\r\n# Count the number of lucky digits (4 and 7) in the input string\r\nlucky_count = n.count('4') + n.count('7')\r\n\r\n# Check if the count of lucky digits is a lucky number (4 or 7)\r\nif lucky_count == 4 or lucky_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = input()\r\nlucky = num.count('4')+num.count('7')\r\nif lucky == 4 or lucky == 7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\r\nele1 = 4\r\nele2 = 7\r\nlist_n = list(n)\r\nset_n = set(n)\r\n\r\ncountof4 = list_n.count(\"4\")\r\n\r\ncountof7 = list_n.count(\"7\")\r\n\r\n\r\nif countof4 + countof7 == 4 or countof4 + countof7 == 7:\r\n set_n.add(ele1)\r\n set_n.add(ele2)\r\n if (ele1 in set_n) and (ele2 in set_n):\r\n print('YES')\r\n exit(0)\r\n else:\r\n print('NO')\r\n exit(0)\r\nelse:\r\n print('NO')\r\n exit(0)", "n=input()\ncount=0\nfor i in range(len(n)):\n if n[i]=='4' or n[i]=='7':\n count+=1 \na=['4','7']\nb=list(str(count))\ns=1\nfor z in b:\n if z in a:\n continue\n else:\n print('NO')\n s-=1\n break\nif s==1:\n print('YES')\n ", "number = list(input())\r\n\r\ns = 0\r\nfor x in number:\r\n if x == '4' or x == '7':\r\n s += 1\r\n\r\nif s == 4 or s == 7:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "n=int(input())\r\nn=str(n)\r\nv=n.count(\"7\")\r\ns=n.count(\"4\")\r\na=s+v\r\nif a==7 or a==4:print(\"YES\")\r\nelse:print(\"NO\")\r\n", "def solve():\r\n \r\n n = int(input())\r\n ldc = 0\r\n while n > 0:\r\n ld = n % 10\r\n \r\n if ld == 4 or ld == 7:\r\n ldc += 1\r\n n //= 10\r\n \r\n if ldc == 4 or ldc == 7:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\ndef main():\r\n T = 1\r\n while T > 0:\r\n solve()\r\n T -= 1\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n = input()\r\nF = n.count(\"4\")\r\nS = n.count(\"7\")\r\nr = str(F + S)\r\nF = r.count(\"4\")\r\nS = r.count(\"7\")\r\nif F + S == len(r):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]==\"4\" or s[i]==\"7\":\r\n c+=1\r\nif(c==4 or c==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=a.count('7')\r\nc=a.count('4')\r\nif b+c==7 or b+c==4:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\r\ni = 0\r\nsum1 = 0\r\nsum2 = 0\r\n\r\nindexes_4 = []\r\nindexes_7 = []\r\n\r\nfor i, char in enumerate(n):\r\n if char == '4':\r\n indexes_4.append(i)\r\n elif char == '7':\r\n indexes_7.append(i)\r\n\r\nindexes = indexes_4 + indexes_7\r\n\r\nif len(indexes) == 4 or len(indexes) == 7:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n\r\n", "num=input()\r\na=0\r\nfor i in num:\r\n if i==\"4\" or i==\"7\":\r\n a+=1\r\nif a==4 or a==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def nearly_lucky_number():\r\n n = input()\r\n i = n.count('4') + n.count('7')\r\n print('YES' if i == 4 or i == 7 else 'NO')\r\n \r\nif __name__ == '__main__':\r\n nearly_lucky_number()", "n = list(input())\r\nc = list(str(n.count(\"4\") + n.count(\"7\")))\r\nif c.count(\"4\") + c.count(\"7\") == len(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na,b=0,0\r\nfor i in range(len(s)):\r\n if int(s[i])==4 or int(s[i])==7:\r\n a+=1\r\na=str(a)\r\nfor i in range(len(a)):\r\n if int(a[i])==4 or int(a[i])==7:\r\n b+=1\r\nif b==len(a):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n \r\n ", "a=int(input())\r\nc=str(a)\r\nnum=[]\r\nfor i in c:\r\n if i=='4':\r\n num.append(i)\r\n elif i=='7':\r\n num.append(i)\r\n else:\r\n pass\r\n\r\n\r\nif len(num)==4 or len(num)==7:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")\r\n", "lucklist = []\r\ncount = 0\r\nlucky = list(input())\r\nfor x in lucky:\r\n if x == \"7\" or x == \"4\":\r\n lucklist.append(x)\r\n count += 1\r\nif count == 7 or count == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n = input()\r\nluck = 0\r\nfor i in range(len(n)):\r\n if n[i] == '4' or n[i] == '7':\r\n luck += 1\r\nluck = str(luck)\r\nflag = True\r\nfor i in luck:\r\n if i == '4' or i == '7':\r\n continue\r\n else:\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\n\r\nnumoflucky = 0\r\n\r\nfor i in range(len(n)):\r\n if n[i] == \"4\" or n[i] == \"7\": numoflucky += 1\r\n\r\nif numoflucky == 4 or numoflucky == 7: print(\"YES\")\r\nelse: print(\"NO\") ", "counter = 0\r\na_counter = 0\r\nnum = input()\r\n\r\nfor digit in num:\r\n if digit == '4' or digit == '7':\r\n counter += 1\r\n\r\nfor digit in str(counter):\r\n if digit == '4' or digit == '7':\r\n a_counter = a_counter + 1\r\n\r\nif a_counter == len(str(counter)):\r\n output = \"YES\"\r\nelse:\r\n output = \"NO\"\r\n\r\nprint(output)", "n = int(input())\r\ncount = 0\r\n\r\nfor digit in str(n):\r\n if digit in '47':\r\n count += 1\r\n\r\nlucky = [4, 7]\r\nis_lucky_count = all(int(digit) in lucky for digit in str(count))\r\n\r\nif count > 0 and is_lucky_count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = a.count(\"4\")+a.count(\"7\")\r\nb = str(b)\r\nif(b.count(\"4\")+b.count(\"7\"))==len(b):\r\n print(\"YES\")\r\nelse: print(\"NO\")", "n = list(map(int,input()))\r\na = n.count(4)+n.count(7)\r\nif a == 7 or a == 4:\r\n\tprint(\"YES\")\r\n\t\t\r\nelse:\r\n\tprint(\"NO\") ", "def lucky(x):\r\n a=list(x)\r\n b=[]\r\n flag=0\r\n while True:\r\n try:\r\n if x[flag]==\"4\" or x[flag]==\"7\":\r\n b.append(x[flag])\r\n flag+=1\r\n else:\r\n flag+=1\r\n except:\r\n break\r\n if \"1\" in list(str(len(b))) or \"0\" in list(str(len(b))) or \"2\" in list(str(len(b))) or \"3\" in list(str(len(b)))\\\r\n or \"5\" in list(str(len(b))) or \"6\" in list(str(len(b))) or \"8\" in list(str(len(b))) \\\r\n or \"9\" in list(str(len(b))):\r\n return False\r\n else:\r\n return True\r\nprint(\"YES\" if lucky(input()) else \"NO\")\r\n", "y=input()\r\nluckyamount=0\r\nfor x in y:\r\n if x=='7' or x=='4':\r\n luckyamount=luckyamount+1\r\nif luckyamount==4 or luckyamount==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input().strip()\n\ncount = n.count('4') + n.count('7')\n\nif count == 4 or count == 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\t \t \t \t\t \t\t \t\t \t \t\t\t", "x = input()\r\nF =0\r\n\r\nfor i in x:\r\n if (i == '4' or i == '7'):\r\n F +=1\r\n\r\nif (F == 4 or F == 7):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\n\r\ns = 0\r\nfor i in n:\r\n if i == \"4\" or i == \"7\":\r\n s += 1\r\n\r\nif s == 4 or s == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,count=int(input()),0\r\nwhile n>0:\r\n if n%10==4 or n%10==7:\r\n count+=1\r\n n//=10\r\nprint(\"YES\" if count==4 or count==7 else \"NO\")", "n = input()\r\nk = 0\r\nfor i in n:\r\n if i == \"4\" or i == \"7\":\r\n k+=1\r\nif k == 4 or k == 7:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "num = input()\r\nn = len(num)\r\ncnt = 0\r\nfor i in range(n):\r\n if num[i] in '47':\r\n cnt+=1\r\nsversion = str(cnt)\r\nif sversion.count('4')+sversion.count('7')==len(sversion):\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "num = input()\noutput = \"YES\"\nS = 0\n\nfor i in num:\n if i in [\"4\",\"7\"]:\n S += 1\n\nif S not in [4,7]:\n output = \"NO\"\n\nprint(output)", "stroke = input()\r\namount = stroke.count(\"4\") + stroke.count(\"7\")\r\nif amount == 4 or amount == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=str(n)\r\nsum=0\r\nfor i in s:\r\n if i=='4' or i=='7':\r\n sum+=1\r\ns1=str(sum)\r\nfor i in s1:\r\n if i=='4' or i=='7':\r\n pass\r\n else:\r\n print(\"NO\")\r\n break;\r\nelse:\r\n print(\"YES\")", "s = list(map(int, input()))\r\nlucky = {4:0, 7:0}\r\nfor i in s:\r\n if i in lucky:\r\n lucky[i] += 1\r\nif sum(lucky.values()) == 4:\r\n print('YES')\r\nelif sum(lucky.values()) == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=list(map(int,list(input())))\r\ncount=0\r\nfor i in n:\r\n if i in [4,7]:\r\n count+=1\r\n else:\r\n count=count+0\r\nif count==4 or count==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input(\"\"))\r\nx = str(n)\r\nluckyno = 0\r\n\r\nfor digit in x:\r\n if digit == '4' or digit == '7':\r\n luckyno += 1\r\n\r\nif luckyno == 4 or luckyno == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "value = input()\r\ntotal = str(value.count(\"4\") + value.count(\"7\"))\r\nif len(total) == (total.count(\"4\") + total.count(\"7\")):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ncount = 0\r\nfor digit in n:\r\n if digit == '4' or digit == '7':\r\n count += 1\r\nif set(str(count)) <= set('47'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ncount = 0\r\nres = 'YES'\r\nfor i in range(len(n)):\r\n if n[i] == '4' or n[i] == '7':\r\n count += 1\r\ncount = str(count)\r\nfor i in range(len(count)):\r\n if count[i] != '4' and count[i] != '7':\r\n res = 'NO'\r\n break\r\nprint(res)", "array=list(input())\r\nm=0\r\nfor i in range(0,len(array)):\r\n if array[i]==\"4\" or array[i]==\"7\":\r\n m+=1\r\na=list(str(m))\r\nn=False\r\nfor i in range(0,len(a)):\r\n if a[i]!=\"4\" and a[i]!=\"7\":\r\n n=True\r\nif n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import sys\r\ns=list(sys.stdin.readline())[:-1]\r\nhappy=s.count('7')+s.count('4')\r\nif happy in [4,7]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\n\nc = 0\n\nfor i in n:\n if(i in ['4','7']): c += 1\n\nres = 'YES'\n\nfor i in str(c):\n if(not i in ['4','7']): \n res = 'NO'\n\n break\n\nprint(res)", "a=input()\r\nl=list(a)\r\nc=0\r\nfor i in l:\r\n if i in '47':\r\n c=c+1\r\n else:\r\n continue\r\nif c==4 or c==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input().strip())\r\nlucky_count = 0\r\nwhile n > 0:\r\n digit = n % 10\r\n if digit == 4 or digit == 7:\r\n lucky_count += 1\r\n n //= 10\r\nif lucky_count == 4 or lucky_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "\r\nn = input()\r\n\r\n\r\nlucky_count = sum(1 for digit in n if digit in \"47\")\r\n\r\nif lucky_count == 4 or lucky_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input() # Input: The integer n as a string\r\n\r\nlucky_count = n.count('4') + n.count('7')\r\n\r\nif lucky_count in {4, 7}:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = [*input()]\nLuckyNumberCount = 0\n\nfor i in range(len(num)):\n if (num[i] == \"7\") or (num[i] == \"4\"):\n LuckyNumberCount += 1\n\nLuckyNumberCount = str(LuckyNumberCount)\nif len(LuckyNumberCount) - (LuckyNumberCount.count(\"4\")+LuckyNumberCount.count(\"7\")) == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=input()\r\ns=0\r\nfor i in a:\r\n if i==\"4\" or i==\"7\":\r\n s+=1\r\nif s==4 or s==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\n\n\n\n\n\n\n\n\nn = input()\n\ncnt = sum([1 if x == \"4\" or x == \"7\" else 0 for x in n])\n\nif cnt == 4 or cnt == 7 :\n print(\"YES\")\nelse :\n print(\"NO\")\n\n\n \t\t\t \t\t\t \t\t\t \t \t \t \t\t\t \t\t", "#Initializes input, aswell as th lucky numbers and digits\r\nnumber = input()\r\nluckyNumbers = ['4', '7']\r\nluckyDigits = 0\r\n\r\n#counts how many lucky digits there are\r\nfor digit in number:\r\n if digit in luckyNumbers:\r\n luckyDigits += 1\r\n\r\n#checks if number of lucky digits is a lucky number\r\nif str(luckyDigits) in luckyNumbers:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\noccur = 0\r\n\r\nwhile n>0:\r\n digit = n%10\r\n if digit in [4,7]:\r\n occur+=1\r\n n=n//10\r\n\r\nprint(\"YES\" if occur in [4,7] else \"NO\") \r\n", "num = input()\r\n\r\ncnt = 0\r\nfor digit in num:\r\n cnt += digit == \"4\" or digit == \"7\"\r\n\r\nif set(str(cnt)) <= set(\"47\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ncount = 0\nwhile n > 0:\n m = n % 10 \n if m == 4 or m == 7:\n count += 1\n n //= 10 \nif count == 4 or count == 7:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = input()\r\nx = a.count('7')\r\ny = a.count('4')\r\nif x+y==7 or x+y==4:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\n\nif str(n).count('4') + str(n).count('7') == 4 or str(n).count('4') + str(n).count('7') == 7:\n print('YES')\nelse:\n print('NO')", "def isNearlyLuckyNumber(n):\r\n count = 0\r\n while n > 0:\r\n if n % 10 == 4 or n % 10 == 7:\r\n count += 1\r\n n //= 10\r\n if count == 4 or count == 7:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nn = int(input())\r\nresult = isNearlyLuckyNumber(n)\r\nprint(result)", "In=input()\r\nIn=In.count(\"7\")+In.count(\"4\")\r\nif(In==4 or In==7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_almost_happy(n):\n n_str = str(n)\n count = n_str.count('4') + n_str.count('7')\n if count == 4 or count == 7:\n return \"YES\"\n else:\n return \"NO\"\nn = int(input())\nprint(is_almost_happy(n))", "n = input()\r\ncount_4 = n.count(\"4\")\r\ncount_7 = n.count(\"7\")\r\ncount = 0\r\nif count_4 + count_7 in [4, 7]:\r\n print('YES')\r\nelse:\r\n print('NO')", "def count_lucky_digits(number):\r\n count = 0\r\n while number > 0:\r\n digit = number % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n number //= 10\r\n return count\r\nn = int(input())\r\nlucky_digit_count = count_lucky_digits(n)\r\nif lucky_digit_count == 4 or lucky_digit_count == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nc=0\r\nwhile n>0:\r\n if n%10==4 or n%10==7:\r\n c+=1\r\n n//=10\r\nif c==4 or c==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\r\nc = 0\r\n\r\nfor char in s:\r\n if char == '7' or char == '4':\r\n c += 1\r\n\r\nif c == 7 or c == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\ns = set(list(str(n.count('4') + n.count('7'))))\r\nif len(s) == 2 and '4' in s and '7' in s or len(s) == 1 and '4' in s or len(s) == 1 and '7' in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\nn = list(n)\nc=0\nfor i in range(len(n)):\n if n[i] == \"4\" or n[i]==\"7\":\n c = c + 1\n \nc = list(str(c))\nl = True\nfor i in c:\n if not(i == \"4\" or i==\"7\"):\n l = False\n break\n\nif l :\n print(\"YES\")\nelse:\n print(\"NO\")", "s = input()\r\ncnt = 0\r\npr = False\r\nfor i in range(len(s)):\r\n if s[i] == \"4\" or s[i] == \"7\":\r\n cnt += 1\r\ncnt = str(cnt)\r\nfor i in range(len(cnt)):\r\n if cnt[i] != \"4\" and cnt[i] != \"7\":\r\n pr = True\r\nif pr:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef count_lucky_digits(n):\r\n return sum(1 for digit in n if is_lucky_digit(digit))\r\n\r\ndef is_nearly_lucky_number(n):\r\n lucky_digit_count = count_lucky_digits(n)\r\n return is_lucky_digit(str(lucky_digit_count))\r\n\r\nn = input()\r\nif is_nearly_lucky_number(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\nns = 0\nfor char in a:\n if char == '4' or char == '7':\n ns += 1\nif ns==4 or ns==7:\n print (\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t\t\t\t\t\t \t\t \t \t \t \t \t \t\t \t", "s = input()\r\nn = s.count('4') + s.count('7')\r\nif(n == 4 or n == 7):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = [int(i) for i in input()]\r\nl = 0\r\nfor i in x:\r\n if i == 4 or i == 7:\r\n l += 1\r\nn = True\r\nl = [int(j) for j in str(l)]\r\nfor i in l:\r\n if i != 4 and i != 7:\r\n n = False\r\n break\r\nif n == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\n\"\"\"Funny Forces Attempt 630A\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ACc0-lS8jHSfydnEY6q0Yncu5cV7TCkM\n\"\"\"\n\nc = 0\no = input()\nx = o.count('4')\ny = o.count('7')\nq = x + y\nif q == 4:\n print(\"YES\")\nelif q == 7:\n print(\"YES\")\nelse:\n print(\"NO\")", "import math\r\nx = (input())\r\na = x.count('4')\r\nb = x.count('7')\r\nc = a+b\r\nq = str(c).count('4')\r\nw = str(c).count('7')\r\nv = q+w \r\nif (v==len(str(c))):\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")\r\n", "# list(map(int,input().split()))\r\nimport sys\r\nn=input()\r\nimport re\r\nres=re.findall(r'[4|7]',n)\r\nprint('YES') if len(res)==4 or len(res)==7 else print('NO')\r\n\r\n", "\r\nnum = input()\r\nx = 0 # number of lucky numbers\r\n\r\nfor char in num:\r\n if char == \"4\" or char == \"7\":\r\n x += 1\r\n \r\nif x == 4 or x == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "number = input()\r\nlucky_number = number.count('4') + number.count('7')\r\nif lucky_number == 4 or lucky_number == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ncount = 0\r\noutput = 'YES'\r\nfor index in range(len(n)):\r\n if (int(n[index]) == 7 ) | (int(n[index]) == 4 ):\r\n count += 1\r\nif (count == 7 ) | (count==4 ):\r\n output = 'YES'\r\nelse :\r\n output = 'NO'\r\n\r\nprint(output)\r\n\r\n", "x = input()\r\ntotal = 0\r\nfor i in range(len(x)):\r\n if x[i] == '4' or x[i] == '7':\r\n total += 1\r\n if total > 7:\r\n break\r\nif total == 4 or total == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "def n_lucky(n):\r\n c = 0\r\n for d in str(n):\r\n if d == '4' or d == '7':\r\n c += 1\r\n return lucky(c)\r\n\r\ndef lucky(n):\r\n lucky_d = ['4', '7']\r\n for d in str(n):\r\n if d not in lucky_d:\r\n return \"NO\"\r\n return \"YES\"\r\nn = int(input())\r\nresult = n_lucky(n)\r\nprint(result)", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\nimport re\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\ndef solve():\r\n n = get_string()\r\n lucky = 0\r\n\r\n for i in range(len(n)):\r\n if n[i] == \"7\" or n[i] == \"4\":\r\n lucky += 1\r\n \r\n if lucky == 7 or lucky == 4:\r\n return \"YES\"\r\n return \"NO\"\r\n \r\n\r\nif __name__ == \"__main__\":\r\n print(solve())", "def is_lucky_digit(digit):\r\n return digit == '4' or digit == '7'\r\n\r\ndef is_lucky_number(number):\r\n return all(is_lucky_digit(digit) for digit in number)\r\n\r\ndef is_nearly_lucky_number(n):\r\n lucky_digit_count = 0\r\n while n > 0:\r\n digit = n % 10\r\n if is_lucky_digit(str(digit)):\r\n lucky_digit_count += 1\r\n n //= 10\r\n\r\n return is_lucky_number(str(lucky_digit_count))\r\n\r\n# Read input\r\nn = int(input())\r\n\r\n# Check if n is a nearly lucky number\r\nif is_nearly_lucky_number(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num_lucky = 0\r\nfor c in input():\r\n if c in [\"4\", \"7\"]:\r\n num_lucky += 1\r\n\r\nfor c in str(num_lucky):\r\n if c not in [\"4\", \"7\"]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 14 11:07:49 2023\r\n\r\n@author: ljy\r\n\"\"\"\r\n\r\nn=input()\r\nluc=0\r\nfor i in range(len(n)):\r\n if n[i]=='4' or n[i]=='7':\r\n luc+=1\r\n#print(luc)\r\nif luc==4 or luc==7:\r\n print('YES')\r\nelse:print('NO')", "n = int(input())\r\ndef count_lucky_digits(num):\r\n count = 0\r\n while num > 0:\r\n digit = num % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n num //= 10\r\n return count\r\nlucky_digit_count = count_lucky_digits(n)\r\ndef is_lucky(num):\r\n return num == 4 or num == 7\r\nif is_lucky(lucky_digit_count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "cnt=0\r\nlucky=str(input())\r\n\r\nfor x in lucky:\r\n if x=='7' or x=='4':\r\n cnt=cnt+1\r\n\r\nif cnt==7 or cnt==4:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nx=str(n)\r\nd=0\r\nfor i in range(len(x)):\r\n c=n%10\r\n n=n//10\r\n if(c==7 or c==4):\r\n d=d+1\r\n\r\nif(d==7 or d==4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=str(input())\nsum=0\nfor i in x:\n if i=='7' or i=='4':\n sum+=1\nif sum==7 or sum==4:\n print('YES')\nelse:\n print('NO')", "def isLucky(num):\r\n num = str(num)\r\n LuckyCount = 0\r\n for i in range(0, len(num)):\r\n if (num[i] == \"4\" or num[i] == \"7\"):\r\n LuckyCount += 1\r\n\r\n return \"YES\" if LuckyCount == 7 or LuckyCount == 4 else \"NO\"\r\n\r\nprint(isLucky(input()))", "s = input()\r\ncount = s.count('4') + s.count('7')\r\nif count == 4 or count == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\nlucky_numbers = 0\r\nfor i in n:\r\n if i== \"4\" :\r\n lucky_numbers= lucky_numbers+1\r\n if i == \"7\":\r\n lucky_numbers = lucky_numbers + 1\r\nif lucky_numbers == 4 or lucky_numbers==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ncounter = 0\r\nfor i in range(len(n)):\r\n if n[i] == '7' or n[i] == '4':\r\n counter += 1\r\ncounter = str(counter)\r\nc = 0\r\nfor i in range(len(counter)):\r\n if counter[i] == '7' or counter[i] == '4':\r\n continue\r\n else:\r\n print('NO')\r\n c += 1\r\n break\r\nif c == 0 : print('YES')", "n = input()\r\nsum = 0\r\nfor i in range(len(n)):\r\n if n[i] == '4' or n[i] == '7':\r\n sum += 1\r\n else:\r\n sum += 0\r\nif sum == 4 or sum == 7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def lucky(n):\r\n c=0\r\n while n>0:\r\n r=n%10\r\n if r==4 or r==7:\r\n c+=1\r\n n//=10\r\n return c in [4,7]\r\nif __name__==\"__main__\":\r\n n=int(input())\r\n if lucky(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "m=input()\r\nlst=[]\r\nfor a in m:\r\n lst.append(a)\r\np=lst.count(\"4\")\r\nq=lst.count(\"7\")\r\nif p+q==4 or p+q==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_lucky(num):\r\n return all(digit in '47' for digit in str(num))\r\n\r\nn=int(input())\r\nlucky_digit_count=sum(1 for digit in str(n) if digit in '47')\r\n\r\nif is_lucky(lucky_digit_count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num = input()\r\nluckyCount = 0\r\n\r\nfor char in num:\r\n if char == \"7\" or char == \"4\":\r\n luckyCount += 1\r\n\r\nif luckyCount == 7 or luckyCount == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\njumlah=0\r\nfor c in s:\r\n if c == '4' or c == '7':\r\n jumlah+=1\r\nif jumlah == 4 or jumlah == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "luckyNum = list(input())\r\ntotalThing = (luckyNum).count(\"4\") + (luckyNum).count(\"7\") \r\n\r\nif str(totalThing).count(\"4\")+str(totalThing).count(\"7\") == len(str(totalThing)):\r\n print(\"YES\")\r\nelse: print(\"NO\")", "n,cnt=input(),0\r\nfor i in n:\r\n if i=='7' or i=='4':cnt+=1\r\nif cnt==7 or cnt==4:print('YES')\r\nelse:print('NO')", "n = input()\r\ncnt = 0\r\nfor char in n:\r\n if char == '4' or char == '7':\r\n cnt += 1\r\nfor char in str(cnt):\r\n if char != '4' and char != '7':\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n=int(input())\r\nans=0\r\nwhile n>0:\r\n r=n%10\r\n if r==4 or r==7:\r\n ans+=1 \r\n n=n//10 \r\nif ans==4 or ans==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nc=0\r\nwhile n!=0:\r\n if n%10 == 4 or n%10 == 7:\r\n c+=1\r\n n//=10\r\nif c==4 or c==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "inp = input()\ncount = 0\nfor i in range(len(inp)):\n if int(inp[i]) in [4,7]:\n count +=1\nif count in [4, 7]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "# Función para contar los dígitos afortunados en un número\ndef count_lucky_digits(number):\n count = 0\n while number > 0:\n digit = number % 10\n if digit == 4 or digit == 7:\n count += 1\n number //= 10\n return count\n\n# Leer el número n\nn = int(input())\n\n# Contar los dígitos afortunados en n\nlucky_count = count_lucky_digits(n)\n\n# Verificar si el conteo de dígitos afortunados es un número afortunado\nif lucky_count == 4 or lucky_count == 7:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t \t\t \t \t \t\t \t\t\t\t \t", "num = input()\r\nl1 = len(num)\r\ncount = 0\r\nfor x in range(l1):\r\n if num[x] == '4':\r\n count += 1\r\n elif num[x] == '7':\r\n count += 1\r\nif count == 4:\r\n print('YES')\r\nelif count == 7:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_lucky_number(num):\r\n return num == 4 or num == 7\r\n\r\ndef count_lucky_digits(num):\r\n count = 0\r\n while num > 0:\r\n digit = num % 10\r\n if digit == 4 or digit == 7:\r\n count += 1\r\n num //= 10\r\n return count\r\n\r\nn = int(input())\r\n\r\nlucky_digit_count = count_lucky_digits(n)\r\n\r\nif is_lucky_number(lucky_digit_count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nn = str(n)\r\nflag = 0\r\nfor x in n:\r\n if int(x) == 4 or int(x) == 7:\r\n flag += 1\r\nif flag == 4 or flag == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = input()\r\ncount = 0\r\nlucky_nums = ['4','7']\r\n\r\n\r\nfor i in range(len(num)):\r\n if num[i] in lucky_nums:\r\n count += 1\r\n\r\nfor number in str(count):\r\n if number not in lucky_nums:\r\n ans = 'NO'\r\n else:\r\n ans = 'YES'\r\n\r\nprint(ans)", "number = input()\r\nnumber = number.strip()\r\nnumber = [int(x) for x in list(number)]\r\nlucky_count = 0\r\nis_lucky = True\r\n\r\nfor num in number:\r\n if (num == 4) or (num == 7):\r\n lucky_count += 1\r\n\r\nlucky_count_string = str(lucky_count)\r\nlucky_count_list = [int(x) for x in list(lucky_count_string)]\r\n\r\nfor num in lucky_count_list:\r\n if (num != 4) and (num != 7):\r\n is_lucky = False\r\n break\r\n\r\nif is_lucky:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "number = input()\r\n\r\nif number.count('4') + number.count('7') in [4, 7]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\r\n\r\n# count the number of lucky digits\r\ncount = sum(1 for c in n if c in \"47\")\r\n\r\n# check if the count is a lucky number\r\nif count in [4, 7]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "inputNumber = int(input())\r\n\r\ncurLucky = 0\r\nfor number in str(inputNumber):\r\n if number in '47':\r\n curLucky += 1\r\n\r\nif all(i in '47' for i in str(curLucky)):\r\n print('YES')\r\nelse:\r\n print('NO')", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nn = input()\r\nif '4' not in n and '7' not in n:\r\n print(\"NO\")\r\n quit()\r\nlst = list(n)\r\na = lst.count('4')\r\nb = lst.count('7')\r\nif a + b == 4 or a +b == 7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = input()\r\ncount = 0\r\nfor i in num:\r\n if i == '4' or i == '7':\r\n count += 1\r\n\r\nlucky = 'YES'\r\nfor i in str(count):\r\n if i == '4' or i == '7':\r\n pass\r\n else:\r\n lucky = 'NO'\r\n break\r\n \r\nprint(lucky)", "n=int(input())\r\na=str(n)\r\nl=0\r\nfor i in range(len(a)):\r\n\tif a[i] in '47':\r\n\t\tl+=1\r\nif l==4 or l==7:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "data = input()\r\nnum4 = data.count('4')\r\nnum7 = data.count('7')\r\n\r\ntotal = str(num4 + num7)\r\n\r\nif total == '0':\r\n print('NO')\r\nelif total.count('4') + total.count('7') == len(total):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nlt = sum(1 for digit in n if digit in '47')\r\nif lt in {4, 7}:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n\r\n inp = input()\r\n\r\n IL = len(inp)\r\n\r\n LN = 0\r\n\r\n for i in range(0, IL):\r\n if inp[i] == \"7\" or inp[i] == \"4\":\r\n LN += 1\r\n \r\n continue\r\n \r\n if LN == 7 or LN == 4 or LN == 47 or LN == 74:\r\n print(\"YES\")\r\n\r\n else:\r\n print(\"NO\")\r\n\r\nmain()", "a =input()\r\nc = 0\r\nfor i in a:\r\n if int(i)==4 or int(i) ==7:\r\n c+=1\r\nif (\"4\" in str(c) or \"7\" in str(c)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\nsum=n.count(\"4\")+n.count(\"7\")\r\nif sum==4 or sum==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nt=0\r\nfor i in a:\r\n if i=='4' or i=='7':\r\n t=t+1\r\nif t==4 or t==7:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nc = []\r\nfor i in range(len(n)):\r\n c.append(n[i])\r\n \r\ncnt = 0\r\nfor i in c:\r\n if i == '4' or i == '7':\r\n cnt+=1\r\n \r\nk = 0 \r\ncnt = str(cnt)\r\nfor i in range(len(cnt)):\r\n if cnt[i] == '4' or cnt[i] == '7':\r\n k+=1\r\n \r\nif k == len(cnt):\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "s = input()\r\nn = 0\r\nfor i in range(len(s)):\r\n if s[i] == '4' or s[i] == '7':\r\n n += 1\r\n else:\r\n continue\r\nif n == 4 or n == 7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nl=0\r\nwhile n>0:\r\n if n%10==7 or n%10==4:\r\n l=l+1\r\n n=n//10\r\nif l==4 or l==7:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def nearly_lucky(n):\r\n\r\n lucky = ['4', '7']\r\n c = 0\r\n\r\n for digit in str(n):\r\n if digit in lucky:\r\n c += 1\r\n \r\n return c == 4 or c == 7\r\n\r\nn = input()\r\n\r\nresult = nearly_lucky(n)\r\n\r\nprint('YES' if result else 'NO')", "x = input()\r\ncount = 0\r\n\r\nfor i in x:\r\n if ((i == \"4\") or (i == \"7\")):\r\n count += 1\r\n\r\nif ((count == 4) or (count == 7)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "S=input()\r\nk=0\r\nfor i in S:\r\n if i=='4' or i=='7':\r\n k+=1\r\nif k==4 or k==7:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n \r\n\r\n \r\n", "number = str(input())\n\n\n\ncount = number.count(\"4\") + number.count(\"7\")\n\nif count == 4 or count == 7 :\n print(\"YES\")\nelse :\n print(\"NO\")\n\n \t\t \t \t \t\t \t \t\t \t \t \t", "\"\"\"110A - Почти счастливое число \"\"\"\r\n\r\ndef checkN(n):\r\n strN = str(n)\r\n without_47 = strN.replace(\"4\", \"\").replace(\"7\", \"\")\r\n if without_47 == 0:\r\n return \"YES\"\r\n delta = len(strN) - len(without_47)\r\n if delta == 4 or delta == 7:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nn = int(input())\r\n\r\nprint(checkN(n))" ]

[ "d = [-1] * 1000001\r\nfor t in range(int(input())):\r\n n, a = int(input()), list(map(int, input().split()))\r\n a.sort()\r\n for i in range(n):\r\n for j in range(i + 1, n): d[a[j] - a[i]] = t\r\n i = 1\r\n while any(d[i * j] == t for j in range(1, n)): i += 1\r\n print(\"YES\\n\" + ' '.join(str(j * i + 1) for j in range(n)))", "T=int(input())\r\nwhile T:\r\n n,a,bd=int(input()),sorted(list(map(int,input().split()))),[0]*1000001\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n bd[a[j]-a[i]]=1\r\n i=1\r\n while(any(bd[i*j]for j in range(1,n))):i+=1\r\n print('YES\\n'+' '.join(str(i*j+1)for j in range(n)))\r\n T-=1", "from random import randint\n\n\ndef solve():\n n, aa = int(input()), list(map(int, input().split()))\n bb, ab = set(), set()\n while True:\n b = randint(1, 1000000)\n for a in aa:\n if a + b in ab:\n break\n else:\n bb.add(b)\n if len(bb) == n:\n break\n for a in aa:\n ab.add(a + b)\n print(\"YES\")\n print(' '.join(map(str, bb)))\n\n\ndef main():\n for _ in range(int(input())):\n solve()\n\n\nif __name__ == '__main__':\n main()\n", "for _ in range(int(input())):\r\n n=int(input())\r\n a=list(map(int, input().split()))\r\n a.sort()\r\n b=[]\r\n b.append(1)\r\n used=[0]*(10**6+1)\r\n used[1]=1\r\n can_be=2\r\n diffs=[]\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n diffs.append(a[j]-a[i])\r\n for i in range(1,n):\r\n for j in diffs:\r\n used[min(b[i-1]+j,10**6)]=1\r\n while(used[can_be]):\r\n can_be+=1\r\n b.append(can_be)\r\n used[can_be]=1\r\n if len(b)==n:\r\n print('YES')\r\n for i in b:\r\n print(i,end=' ')\r\n print('')\r\n else:\r\n print('NO')\r\n\r\n\r\n", "from random import randint\r\ndef solve():\r\n n, aa = int(input()), list(map(int, input().split()))\r\n bb, ab = set(), set()\r\n while True:\r\n b = randint(1, 1000000)\r\n for a in aa:\r\n if a + b in ab:\r\n break\r\n else:\r\n bb.add(b)\r\n if len(bb) == n:\r\n break\r\n for a in aa:\r\n ab.add(a + b)\r\n print(\"YES\")\r\n print(' '.join(map(str, bb)))\r\n\r\n\r\nt = int(input())\r\nfor i in range(t):\r\n solve()", "visited = [-1] * (2 * 10 ** 6 + 1)\nt = int(input())\nfor i in range(t):\n n, A = int(input()), list(map(int, input().split()))\n A.sort()\n res = []\n v = 1\n while len(res) < n:\n flag = True\n for a in A:\n if visited[a + v] == i:\n flag = False\n break\n if not flag:\n v += 1\n continue\n for a in A:\n visited[a + v] = i\n res.append(v)\n v += 1\n print(\"YES\\n\" + ' '.join(map(str,res)))\n\t \t\t\t \t\t \t\t\t \t \t \t \t\t\t", "from random import randint\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n a=[*map(int,input().split())]\r\n b=[]\r\n q=set()\r\n while n:\r\n t=1\r\n w=set()\r\n i=randint(1,1000000)\r\n for j in a:\r\n if j+i in q:\r\n t=0\r\n break\r\n w.add(i+j)\r\n if t:\r\n q|=w\r\n b+=[i]\r\n n-=1\r\n print(\"YES\")\r\n print(*b)", "from random import randint\r\nh = [-1] * 2000001\r\nfor t in range(int(input())):\r\n n, A = int(input()), list(map(int, input().split()))\r\n B = []\r\n while len(B) < n:\r\n b = randint(1, 1000000)\r\n if all(h[a + b] != t for a in A):\r\n for a in A: h[a + b] = t\r\n B.append(b)\r\n print('YES\\n' + ' '.join(map(str, B)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = 10**6+1\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n w = sorted(map(int, input().split()))\r\n d = [0]*M\r\n s = set()\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n s.add(w[j]-w[i])\r\n q, i = [], 1\r\n while i < M and len(q) < n:\r\n if d[i] == 0:\r\n d[i] = 1\r\n q.append(i)\r\n for j in s:\r\n d[i+j] = 1\r\n i += 1\r\n if len(q) == n:\r\n print('YES')\r\n print(' '.join(map(str, q)))\r\n else:\r\n print('NO')\r\n" ]

[ "# -*- coding: utf-8 -*-\n\n\n\nimport math\n\nimport collections\n\nimport bisect\n\nimport heapq\n\nimport time\n\nimport random\n\nimport itertools\n\n\n\n\"\"\"\n\ncreated by shhuan at 2017/10/18 16:22\n\n\n\n\"\"\"\n\n\n\nM, N = map(int, input().split())\n\n\n\nwords = []\n\nfor i in range(M):\n\n words.append([int(x) for x in input().split()][1:])\n\n\n\n# all elements in C should be capitalized\n\nC = set()\n\n\n\n# E[u][v] means if we capitalize u, we must capitalize v\n\nE = collections.defaultdict(list)\n\n\n\nfor i in range(M-1):\n\n w1 = words[i]\n\n w2 = words[i+1]\n\n\n\n if len(w1) > len(w2) and w1[:len(w2)] == w2:\n\n print('No')\n\n exit(0)\n\n for j in range(min(len(w1), len(w2))):\n\n if w1[j] < w2[j]:\n\n E[w2[j]].append(w1[j])\n\n break\n\n elif w1[j] > w2[j]:\n\n C.add(w1[j])\n\n break\n\n\n\n# add all letters should be capitalized based on E\n\nA = {u for u in C}\n\nwhile A:\n\n B = set(itertools.chain.from_iterable([E[u] for u in A]))\n\n A = B - C\n\n C |= B\n\n\n\n# check\n\nfor i in range(M-1):\n\n w1 = words[i]\n\n w2 = words[i+1]\n\n\n\n for j in range(min(len(w1), len(w2))):\n\n a, b = w1[j], w2[j]\n\n d = [a in C, b in C]\n\n if a < b:\n\n if d == [False, True]:\n\n print('No')\n\n exit(0)\n\n break\n\n elif a > b:\n\n if d != [True, False]:\n\n print('No')\n\n exit(0)\n\n break\n\n\n\nprint('Yes')\n\nprint(len(C))\n\nif C:\n\n print(\" \".join(map(str, sorted(C))))\n\n\n\n\n\n# Made By Mostafa_Khaled", "import os,io,sys\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn,m=map(int,input().split())\r\na=[-1]*m\r\np=[]\r\nfor i in range(n):\r\n r=list(map(int,input().split()))\r\n p.append(r)\r\nflag=0\r\ngraph0=[]\r\ngraph1=[]\r\nfor i in range(m):\r\n graph0.append([])\r\n graph1.append([])\r\nfor i in range(n-2,-1,-1):\r\n st=0\r\n for j in range(1,min(p[i][0],p[i+1][0])+1):\r\n let1=p[i][j]\r\n let2=p[i+1][j]\r\n if let1==let2:\r\n continue\r\n if let1<let2:\r\n graph0[let1-1].append(let2-1)\r\n graph1[let2-1].append(let1-1)\r\n st=1\r\n break\r\n else:\r\n if a[let1-1]==0 or a[let2-1]==1:\r\n flag=1\r\n a[let1-1]=1\r\n a[let2-1]=0\r\n st=1\r\n break\r\n if st==0:\r\n if p[i][0]>p[i+1][0]:\r\n flag=1\r\n if flag:\r\n break\r\nif flag:\r\n print('No')\r\n sys.exit()\r\nset0=set()\r\nstack=[]\r\nfor i in range(m):\r\n if a[i]==0:\r\n stack.append(i)\r\nwhile stack:\r\n i=stack.pop()\r\n if i in set0:\r\n continue\r\n set0.add(i)\r\n for j in graph0[i]:\r\n stack.append(j)\r\nset1=set()\r\nfor i in range(m):\r\n if a[i]==1:\r\n stack.append(i)\r\nwhile stack:\r\n i=stack.pop()\r\n if i in set0:\r\n print('No')\r\n sys.exit()\r\n if i in set1:\r\n continue\r\n set1.add(i)\r\n for j in graph1[i]:\r\n stack.append(j) \r\nprint('Yes')\r\nprint(len(set1))\r\nans=[]\r\nfor i in set1:\r\n ans.append(str(i+1))\r\nprint(' '.join(ans))", "\r\nimport sys\r\nfrom sys import stdin\r\nfrom collections import deque\r\n\r\nn,m = map(int,stdin.readline().split())\r\n\r\nstate = [0] * (m+1)\r\n\r\ns = []\r\n\r\nfor i in range(n):\r\n\r\n word = list(map(int,stdin.readline().split()))[1:]\r\n s.append(word)\r\n\r\nlis = [ [] for i in range(m+1) ]\r\n\r\nfor i in range(n-1):\r\n\r\n w1 = s[i]\r\n w2 = s[i+1]\r\n\r\n for j in range( min( len(w1) , len(w2) )):\r\n if w1[j] != w2[j]:\r\n\r\n if w1[j] > w2[j]:\r\n state[w1[j]] |= 2\r\n state[w2[j]] |= 1\r\n else:\r\n lis[w2[j]].append(w1[j])\r\n break\r\n else:\r\n\r\n if len(w1) <= len(w2):\r\n continue\r\n else:\r\n print (\"No\")\r\n sys.exit()\r\n\r\nq = deque()\r\nfor i in range(m+1):\r\n if state[i] & 2:\r\n q.append(i)\r\n\r\nwhile q:\r\n v = q.popleft()\r\n for nex in lis[v]:\r\n if state[nex] & 2 == 0:\r\n state[nex] |= state[v]\r\n q.append(nex)\r\n \r\nif 3 in state:\r\n print (\"No\")\r\n sys.exit()\r\n\r\n\r\nANS = []\r\nfor i in range(m+1):\r\n\r\n if state[i] == 2:\r\n ANS.append(i)\r\n\r\nprint (\"Yes\")\r\nprint (len(ANS))\r\nprint (\" \".join(map(str,ANS)))\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nw, h, n = map(int, input().split())\r\n\r\nl = [0, w]\r\nr = [0, h]\r\nd = []\r\nfor i in range(n):\r\n a, b = input()[:-1].split()\r\n b = int(b)\r\n l.append(b) if a == 'V' else r.append(b)\r\n d.append((a, b))\r\n\r\nl.sort()\r\nr.sort()\r\nd.reverse()\r\nnl = len(l)\r\nnr = len(r)\r\nl1 = {}\r\nr1 = {}\r\nfor i, j in enumerate(l):\r\n l1[j] = i\r\nfor i, j in enumerate(r):\r\n r1[j] = i\r\n\r\nl2 = [(0,0)] * nl\r\nr2 = [(0,0)] * nr\r\nfor i in range(1, nl-1):\r\n l2[i] = (i-1, i+1)\r\nfor i in range(1, nr-1):\r\n r2[i] = (i-1, i+1)\r\n\r\nl3, r3 = max(l[i+1]-l[i] for i in range(nl-1)), max(r[i+1]-r[i] for i in range(nr-1))\r\new = []\r\nfor a, b in d:\r\n ew.append(l3 * r3)\r\n if a == 'V':\r\n x, y = l2[l1[b]]\r\n l3 = max(l3, l[y]-l[x])\r\n l2[x] = (l2[x][0], y)\r\n l2[y] = (x, l2[y][1])\r\n else:\r\n x, y = r2[r1[b]]\r\n r3 = max(r3, r[y] - r[x])\r\n r2[x] = (r2[x][0], y)\r\n r2[y] = (x, r2[y][1])\r\n\r\nfor i in reversed(ew):\r\n print(i)\r\n", "w, h, n = map(int, input().split())\r\n\r\nx = [0, w]\r\ny = [0, h]\r\nrev = []\r\n\r\nfor _ in range(n):\r\n s, d = input().split()\r\n if s == 'H':\r\n y.append(int(d))\r\n else:\r\n x.append(int(d))\r\n rev.append((s, int(d)))\r\n\r\nx.sort()\r\ny.sort()\r\n\r\n_max = 0\r\nif len(x) > 1:\r\n for idx in range(len(x) - 1):\r\n _max = max(_max, x[idx + 1] - x[idx])\r\nelse:\r\n _max = w\r\nmax_x = _max\r\n\r\n_max = 0\r\nif len(y) > 1:\r\n for idx in range(len(y) - 1):\r\n _max = max(_max, y[idx + 1] - y[idx])\r\nelse:\r\n _max = w\r\nmax_y = _max\r\n\r\nenum_x = {num : idx for idx, num in enumerate(x)}\r\nenum_y = {num : idx for idx, num in enumerate(y)}\r\n\r\nold_x = x\r\nold_y = y\r\n\r\nx = [[0, 0, 0]] * len(old_x)\r\ny = [[0, 0, 0]] * len(old_y)\r\n\r\nfor idx in range(1, len(x) - 1):\r\n x[idx] = [old_x[idx], idx-1, idx+1]\r\nfor idx in range(1, len(y) - 1):\r\n y[idx] = [old_y[idx], idx-1, idx+1]\r\n\r\nx[-1] = [w, 0, 0]\r\ny[-1] = [h, 0, 0]\r\n\r\nrev.reverse()\r\nans = [max_x * max_y]\r\nfor item in rev:\r\n if item[0] == 'H':\r\n elem = y[enum_y[item[1]]]\r\n max_y = max(max_y, y[elem[2]][0] - y[elem[1]][0])\r\n y[elem[1]][2] = elem[2]\r\n y[elem[2]][1] = elem[1]\r\n else:\r\n elem = x[enum_x[item[1]]]\r\n max_x = max(max_x, x[elem[2]][0] - x[elem[1]][0])\r\n x[elem[1]][2] = elem[2]\r\n x[elem[2]][1] = elem[1]\r\n ans.append(max_x * max_y)\r\nans.pop()\r\nprint('\\n'.join(map(str, reversed(ans))))", "from sys import stdin, stdout\r\n\r\nw, h, n = map(int, stdin.readline().split())\r\na = [stdin.readline().split() for _ in range(n)]\r\ny = [0, h]\r\nx = [0, w]\r\nfor m in a:\r\n m[1] = int(m[1])\r\n if m[0] == 'H':\r\n y.append(m[1])\r\n else:\r\n x.append(m[1])\r\ny.sort()\r\nx.sort()\r\niy = {t: i for i, t in enumerate(y)}\r\nix = {t: i for i, t in enumerate(x)}\r\nny = len(y)\r\nnx = len(x)\r\npary = list(range(len(y)))\r\nparx = list(range(len(x)))\r\np = 0\r\ndy = [0] * ny\r\nfor i in range(ny - 1):\r\n dy[i] = y[i+1] - y[i]\r\nmy = max(dy)\r\ndx = [0] * nx\r\nfor i in range(nx - 1):\r\n dx[i] = x[i+1] - x[i]\r\nmx = max(dx)\r\nans = [my * mx]\r\nfor t in reversed(a):\r\n if t[0] == 'H':\r\n i = iy[t[1]]\r\n st = [i]\r\n while pary[i] != i:\r\n i = pary[i]\r\n st.append(i)\r\n nl = dy[i]\r\n i = iy[t[1]] - 1\r\n st.append(i)\r\n while pary[i] != i:\r\n i = pary[i]\r\n st.append(i)\r\n dy[i] += nl\r\n if my < dy[i]:\r\n my = dy[i]\r\n i = st.pop()\r\n for j in st:\r\n pary[j] = i\r\n else:\r\n i = ix[t[1]]\r\n st = [i]\r\n while parx[i] != i:\r\n i = parx[i]\r\n st.append(i)\r\n nl = dx[i]\r\n i = ix[t[1]] - 1\r\n st.append(i)\r\n while parx[i] != i:\r\n i = parx[i]\r\n st.append(i)\r\n dx[i] += nl\r\n if mx < dx[i]:\r\n mx = dx[i]\r\n i = st.pop()\r\n for j in st:\r\n parx[j] = i\r\n ans.append(mx * my)\r\nans.pop()\r\nstdout.write('\\n'.join(map(str, reversed(ans))))", "w, h, n = map(int, input().split())\r\nl, r = [-1] * (w+1), [-1] * (w+1)\r\nt, b = [-1] * (h+1), [-1] * (h+1)\r\nl[0], b[0], t[h], r[w] = 0, 0, h, w\r\nV, H = [0] * n, [0] * n\r\n\r\nfor i in range(n):\r\n line, idx = input().split()\r\n idx = int(idx)\r\n if line == 'V':\r\n r[idx] = w\r\n V[i] = idx\r\n else:\r\n t[idx] = h\r\n H[i] = idx\r\n\r\nleft, max_w = 0, 0\r\nfor i in range(1, w+1):\r\n if r[i] != -1:\r\n l[i] = left\r\n r[left] = i\r\n max_w = max(max_w, i - left)\r\n left = i\r\n\r\nbottom, max_h = 0, 0\r\nfor i in range(1 ,h+1):\r\n if t[i] != -1:\r\n b[i] = bottom\r\n t[bottom] = i\r\n max_h = max(max_h, i - bottom)\r\n bottom = i\r\n\r\nres = [0] * n\r\nres[n-1] = max_h * max_w\r\nfor i in range(n-1, 0, -1):\r\n if V[i] != 0:\r\n max_w = max(max_w, r[V[i]] - l[V[i]])\r\n r[l[V[i]]] = r[V[i]]\r\n l[r[V[i]]] = l[V[i]]\r\n else:\r\n max_h = max(max_h, t[H[i]] - b[H[i]])\r\n b[t[H[i]]] = b[H[i]]\r\n t[b[H[i]]] = t[H[i]]\r\n res[i-1] = max_h * max_w\r\n\r\nfor i in range(n):\r\n print(res[i])" ]

[ "n,k=map(int, input().split())\r\na=list(map(int, input().split())) \r\nfor i in range(n):\r\n c=min(k,a[i],8)\r\n if i!=n-1:\r\n a[i+1]+=a[i]-c\r\n k-=c\r\n if k==0:\r\n print(i+1)\r\n break\r\nelse:\r\n print(\"-1\")\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nt,f = 0,0\r\nfor i in range(0,n):\r\n\tt += l[i]\r\n\tk = k-min(8,t)\r\n\tt-=min(8,t)\r\n\tif k<=0:\r\n\t\tf=1\r\n\t\tbreak\r\nprint([-1,i+1][f==1])\r\n ", "n, k = map(int, input().split())\r\nmaxToGive, reserve, s = 0, 0, 0\r\nlst = list(map(int, input().split()))\r\nfor d, x in enumerate(lst):\r\n reserve += x\r\n maxToGive = min(8, reserve)\r\n reserve -= maxToGive\r\n s += maxToGive\r\n if s >= k:\r\n print(d+1)\r\n break\r\nelse:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\ns = 0\r\nfor i in range(n):\r\n s += w[i]\r\n k -= min(8, s)\r\n s -= min(8, s)\r\n if k <= 0:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)", "# LUOGU_RID: 101672603\nn, k, *a = map(int, open(0).read().split())\r\nans = c = 0\r\nfor x in a:\r\n ans += 1\r\n c += x\r\n k -= min(c, 8)\r\n c -= min(c, 8)\r\n if k < 1:\r\n exit(print(ans)) \r\nprint(-1)\r\n", "import math\nn, k = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nbran = 0\nleft = 0\ndays = 0\nfor i in a:\n left += i\n if left > 8:\n bran += 8\n left -= 8\n elif left <= 8:\n bran += left\n left = 0\n days += 1\n if bran >= k:\n print(days)\n break\nelse:\n print(-1)\n\n", "l=list(map(int,input().split()))\r\nn=list(map(int,input().split()))\r\ns=0\r\nw=0\r\nfor i in range(len(n)):\r\n w=min(n[i],8)\r\n s+=w\r\n if i<len(n)-1 and n[i]>8:\r\n n[i+1]+=(n[i]-8)\r\n if s>=l[-1]:\r\n print(i+1)\r\n exit()\r\n\r\nprint(-1)\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ntotal = cnt = 0\r\nfor i in range(n):\r\n total += a[i]\r\n cnt += min(8, total)\r\n total = max(0, total-8)\r\n if (cnt >= k):\r\n exit(print(i + 1))\r\n\r\nprint(-1)\r\n", "import math\r\nfor _ in range(1):\r\n n,k=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n sum1=0\r\n sum2=0\r\n \r\n for i in range(n):\r\n sum2+=l[i]\r\n c=min(8,sum2)\r\n sum1+=c\r\n sum2-=c\r\n if sum1>=k:\r\n print(i+1)\r\n break\r\n \r\n else:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n,k=[int(i)for i in input().split()]\r\na=[int(i)for i in input().split()]\r\nx=0\r\nko=0\r\nfor i in range(n):\r\n x+=a[i]\r\n if x<=8:\r\n ko+=x\r\n x=0\r\n else:\r\n x-=8\r\n ko+=8\r\n if ko>=k:\r\n print(i+1)\r\n break\r\nelse:\r\n print('-1')", "import math\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n currently_arian_has = 0\r\n given_to_bran = 0\r\n for i in range(len(a)):\r\n currently_arian_has += a[i]\r\n if currently_arian_has > 8:\r\n given_to_bran += 8\r\n currently_arian_has -= 8\r\n else:\r\n given_to_bran += currently_arian_has\r\n currently_arian_has = 0\r\n if given_to_bran >= k:\r\n return i + 1\r\n else:\r\n return -1\r\n\r\n\r\n\r\nprint(main_function())", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ngot = 0\r\nfor i in range(n):\r\n got += a[i]\r\n k -= min(got, 8)\r\n got -= min(got, 8)\r\n if k <= 0:\r\n print(i+1)\r\n break\r\nif k > 0:\r\n print(-1)", "counter = 0\r\ncounter1 = 0\r\ncounter2 = 0\r\nerr = 0\r\nn, k = map(int,input().split())\r\ns = input().split()\r\nfor i in range (n):\r\n counter1 += 1\r\n counter2 += int (s[i])\r\n x = min(counter2, 8)\r\n counter2 -= x\r\n counter += x\r\n if counter >= k and counter1 <= n:\r\n err = 0\r\n print (counter1)\r\n break\r\n else:\r\n err = 1\r\nif err == 1:\r\n print (-1)", "n,k=map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nbank=0\r\ncount=0\r\nfor i in lis:\r\n if(k<=0):\r\n break\r\n if(bank+i>8):\r\n k-=8\r\n count+=1\r\n bank=bank+i-8\r\n else:\r\n k=k-(bank+i)\r\n count+=1\r\n bank=0\r\nprint(count) if(k<=0) else print(-1)", "import math\r\ns = input().split()\r\nn = int(s[0])\r\nk = int(s[1])\r\nary = []\r\ns = input().split()\r\nfor i in range(n):\r\n ary.append(int(s[i]))\r\nfor i in range(n):\r\n if ary[i] >= k and k <= 8:\r\n k = 0\r\n print(i+1)\r\n break;\r\n elif ary[i] >=k and k > 8:\r\n k -= 8\r\n if i < n - 1:\r\n ary[i+1] += ary[i] - 8\r\n elif ary[i] < k and k <= 8:\r\n k -= ary[i]\r\n elif ary[i] < k and k > 8:\r\n if ary[i] <= 8:\r\n k -= ary[i]\r\n else:\r\n k -= 8\r\n if i < n - 1:\r\n ary[i+1] += ary[i] - 8\r\nif k > 0:\r\n print(-1)", "n,candy = [int(i) for i in input().split()]\r\ndays = [int(i) for i in input().split()]\r\n\r\ndaysNeed = 0\r\nkolb = 0\r\nkola = 0\r\nwhile kolb < candy and daysNeed < n: \r\n kola += days[daysNeed]\r\n a = min(8,kola)\r\n kola -= a\r\n kolb += a\r\n daysNeed += 1\r\n\r\n\r\nif kolb < candy:\r\n print(-1)\r\nelse:\r\n print(daysNeed)\r\n", "\r\nn , k = map(int , input().split())\r\na = [int(a) for a in input().split()]\r\n\r\narya = bran = day = 0\r\n\r\nfor i in a:\r\n arya += i\r\n if arya <= 8:\r\n bran += arya\r\n arya = 0\r\n day += 1\r\n else:\r\n bran += 8\r\n arya -= 8\r\n day += 1\r\n \r\n if bran >= k:\r\n print(day)\r\n exit()\r\n \r\nprint(-1)", "a, b = [int(i) for i in input().split()]\r\nw = [int(i) for i in input().split()]\r\nd = 0\r\nr = 0\r\n\r\nfor i in w:\r\n r += i\r\n if r>=8:\r\n b-=8\r\n r-=8\r\n else:\r\n b-=r\r\n r=0\r\n d += 1\r\n if b<=0:\r\n break\r\nif b<=0:\r\n print(d)\r\nelse:\r\n print(-1)\r\n", "nk = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nbank = 0\r\nfor i in range(nk[0]):\r\n\tbank += a[i]\r\n\tnk[1] -= min(bank, 8)\r\n\tbank -= min(bank, 8)\r\n\tif nk[1] <= 0:\t\r\n\t\tbreak\r\nif nk[1] > 0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(i + 1)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncandies = 0\r\nday = 0\r\n\r\nfor i in range(n):\r\n candies += a[i]\r\n give = min(candies, 8)\r\n candies -= give\r\n k -= give\r\n day += 1\r\n if k <= 0:\r\n print(day)\r\n break\r\nelse:\r\n print(-1)\r\n", "_,k=map(int,input().split())\r\nr,c=0,0\r\nfor x in map(int,input().split()):\r\n r+=1\r\n c+=x\r\n d=min(c,8)\r\n c-=d;k-=d\r\n if k<1:break\r\nprint([r,-1][k>0])", "n, k = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nstore = 0\r\ntogive = 0\r\ngiven = 0\r\nfor i in range(n):\r\n togive = min(8, store + ls[i])\r\n given += togive\r\n store += ls[i] - togive\r\n if given >= k:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)", "n , m = map(int , input().split())\r\nl = list(map(int , input().split())) + [0]\r\ncounter = 0 \r\nseuil = 0\r\ni = 0 \r\nres = -1\r\nwhile i < n : \r\n if l[i] > 8 : \r\n l[i+1] += l[i] -8\r\n l[i] = 8\r\n m-=l[i]\r\n if m <= 0 : \r\n res = i + 1 \r\n break \r\n i+=1\r\nprint(res)\r\n \r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ncontainer = 0\r\ncandies_given = 0\r\ncheck = 0\r\nfor i in range(n):\r\n container += arr[i]\r\n if container>=8:\r\n candies_given += 8\r\n container -= 8\r\n else:\r\n candies_given += container\r\n container = 0\r\n if candies_given >= k:\r\n check = 1\r\n print(i+1)\r\n break\r\nif check == 0:\r\n print(-1)\r\n ", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ny = 0\r\nfor i in range(0, n):\r\n y+=l[i]\r\n x= min(8, y)\r\n k -=x\r\n y-=x\r\n if k<=0:\r\n print(i+1)\r\n exit()\r\n \r\nprint(-1)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\ncandy = 0\r\nstorage = 0\r\n\r\n# code\r\nfor i in a:\r\n if candy >= k:\r\n break\r\n ans += 1\r\n if i < 8 and i + storage >= 8:\r\n candy += 8\r\n storage -= 8 - i\r\n elif i < 8:\r\n candy += i + storage\r\n storage = 0\r\n else:\r\n candy += 8\r\n storage += i - 8\r\nif candy >= k:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\ni, r = 0, 0\r\nfor c in l:\r\n r += c\r\n i += 1\r\n b -= min(8, r)\r\n r -= min(8, r)\r\n if b <= 0:\r\n print(i)\r\n quit()\r\nprint(-1)", "n, k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nfor x in range(0, n):\r\n s += l[x]\r\n if s > 8:\r\n s -= 8\r\n k -= 8\r\n else:\r\n k -= s\r\n s = 0\r\n if k <= 0:\r\n print(x + 1)\r\n exit()\r\n\r\nprint(-1)\r\n", "a,b=map(int,input().split())\r\nc=[int(i) for i in input().split()]\r\nx=0\r\nz=0\r\ns=0\r\nfor i in range(a):\r\n x=x+c[i]\r\n z=min(8,x)\r\n x=x-z\r\n b=b-z\r\n s=s+1\r\n if b<=0:\r\n break\r\nif b>0:\r\n print(-1)\r\nelse:\r\n print(s)\r\n \r\n\r\n", "n, k = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nc = 0\r\n\r\nfor i in range(n):\r\n if l[i] > 8:\r\n c += 8\r\n if i != n-1:\r\n l[i+1] += (l[i] - 8)\r\n else:\r\n c += l[i]\r\n\r\n if c >= k:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1) \r\n ", "\r\nn,k=map(int,input().split())\r\nli=[int(x) for x in input().split()]\r\nsav=0\r\nsumm=0\r\nfor i in range(n):\r\n\tcan=sav+li[i]\r\n\tif can>8:\r\n\t\tcan=can-8\r\n\t\tsav=can\r\n\t\tsumm=summ+8\r\n\telse:\r\n\t\tsumm=summ+can\r\n\t\tsav=0\r\n\tif summ>=k:\r\n\t\tprint(i+1)\r\n\t\tbreak\r\nelse:\r\n\tprint(-1)", "n,k=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\n\r\ncnt,i=0,0\r\nwhile(i<n and cnt<k):\r\n if(i==n-1):\r\n if(list[i]>8):\r\n cnt+=8\r\n else:\r\n cnt+=list[i]\r\n else:\r\n if(list[i]>8):\r\n cnt+=8\r\n list[i+1]+=(list[i]-8)\r\n else:\r\n cnt+=list[i]\r\n i+=1\r\nif(cnt<k):\r\n print(\"-1\")\r\nelse:\r\n print(i)", "n,k=[int(i) for i in input().split()]\r\nf=[int(i) for i in input().split()]\r\nd=0\r\nh=0\r\nfor i in range(0,n):\r\n h+=f[i]\r\n if h>=8:\r\n h-=8\r\n k-=8\r\n else:\r\n k-=h\r\n h=0\r\n d+=1\r\n if k<=0:\r\n print(d)\r\n break\r\nelse:\r\n print(-1)\r\n", "n, k = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\narya, bryan = 0, 0\r\nans = -1\r\n\r\nfor i in range(n):\r\n arya += a[i]\r\n bryan += min(8, arya)\r\n arya -= min(8, arya)\r\n if bryan >= k:\r\n ans = i + 1\r\n break\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\nlist_candies = list(map(int, input().split()))\r\n\r\ni, r = 0, 0\r\nfor c in list_candies:\r\n r += c\r\n i += 1\r\n k -= min(8, r)\r\n r -= min(8, r)\r\n if k <= 0:\r\n print(i)\r\n quit()\r\nprint(-1)", "n,k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\narya = 0\r\nbran = 0\r\nday = 0\r\nfor i in range(n):\r\n day = day + 1\r\n arya = arya + a[i]\r\n if arya >= 8:\r\n arya = arya - 8\r\n bran = bran + 8\r\n else:\r\n bran = bran + arya\r\n arya = 0\r\n if bran >= k:\r\n print(day)\r\n break\r\nif bran < k:\r\n print(-1)", "z = 0\r\naria = 0\r\nbran = 0\r\na, b = map(int, input().split())\r\nc = map(int, input().split())\r\nfor i in c:\r\n aria += i\r\n if aria >= 8:\r\n bran += 8\r\n aria -= 8\r\n z += 1\r\n else:\r\n bran += aria\r\n aria = 0\r\n z += 1\r\n if bran >= b:\r\n print(z)\r\n break\r\nelse:\r\n print(-1)\r\n", "n, k = [int(i) for i in input().split()]\r\na = input().split()\r\nc = 0\r\nb = 0\r\nd = 0\r\ne = 0\r\nfor i in range(n):\r\n d += 1\r\n c += int(a[i])\r\n if c >= 8:\r\n b += 8\r\n c -= 8\r\n else:\r\n b += c\r\n c = 0\r\n if b >= k:\r\n print(d)\r\n e = 1\r\n break\r\nif e == 0:\r\n print(-1)\r\n", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncandy_stock = 0\r\nfor i in range(n):\r\n candy_stock = candy_stock + a[i]\r\n if candy_stock >= 8:\r\n k = k - 8\r\n candy_stock = candy_stock - 8\r\n else:\r\n k = k - candy_stock\r\n candy_stock = 0\r\n if k <= 0:\r\n print(i+1)\r\n break\r\nif k >= 1:\r\n print(-1)", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef test_case(casen):\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n \r\n ac = 0\r\n bc = 0\r\n\r\n i = 0\r\n while i < n and bc < k:\r\n ac += a[i]\r\n bc += min(ac, 8)\r\n ac -= min(ac, 8)\r\n i += 1\r\n\r\n if bc >= k:\r\n return i\r\n else:\r\n return -1\r\n\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = input().split(' ')\na = input().split(' ')\nk = int(k)\ncount = 0\nstorage = 0\ntotal = 0\nfor ai in a:\n total += int(ai)\n\n df = min(8, total)\n k -= df\n total -= df\n count += 1\n if k <= 0:\n break\n\nif k > 0:\n print(-1)\nelse:\n print(count)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nk_ = a_ = 0\r\nfor i in range(n):\r\n a_ += a[i]\r\n k_p = min(8, a_)\r\n k_ += k_p\r\n a_ -= k_p\r\n\r\n if k_ >= k:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)\r\n", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nnow = 0\r\nhas = 0\r\nfor i in range(n):\r\n has += a[i]\r\n can = min(8, has)\r\n has -= can\r\n now += can\r\n if now >= k:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ncount=0\r\ntotal=0\r\nfor ele in lst:\r\n count+= ele\r\n m= min(8,count)\r\n count-=m\r\n k-=m\r\n total+=1\r\n if k<=0:\r\n break\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print(total)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=0\r\nb=0\r\nfor i in range(n):\r\n a+=l[i]\r\n if a>=8 and b<k:\r\n b+=8\r\n a-=8\r\n else:\r\n b+=a\r\n a=0\r\n if b>=k:\r\n break\r\nif b>=k:\r\n print(i+1)\r\nelse:\r\n print(-1)\r\n\r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\ntotal_sum = 0\r\ncarry = 0\r\n\r\nfor i in range(len(l)):\r\n if total_sum == m:\r\n break\r\n\r\n if l[i] + carry < 8 and total_sum < m:\r\n total_sum += l[i] + carry\r\n carry = 0\r\n\r\n if total_sum >= m:\r\n print(i + 1)\r\n break\r\n\r\n elif l[i] + carry >= 8 and total_sum < m:\r\n total_sum += 8\r\n carry = l[i] + carry - 8\r\n\r\n if total_sum >= m:\r\n print(i + 1)\r\n break\r\n\r\nif total_sum < m:\r\n print(-1)\r\n", "m, a = map(int, input().split())\r\nline = input().split()\r\nday = 1;\r\nbuffer_ = 0 \r\nfor i in line:\r\n\tci = int(i)\r\n\tbuffer_+=ci;\r\n\ta-=min(buffer_,8)\r\n\tif (buffer_ >= 8):\r\n\t\tbuffer_-= 8;\r\n\telse:\r\n\t\tbuffer_=0\r\n\tif (a <= 0):break\r\n\tday+=1;\r\nprint(day if (a<=0) else -1)", "q=[int(w) for w in input().split()]\r\ne=[int(m) for m in input().split()]\r\na=0\r\nl=0\r\no=0\r\nwhile l<q[1] and o<q[0]:\r\n a+=e[o]\r\n tmp=min(8,a)\r\n a-=tmp\r\n l+=tmp\r\n o+=1\r\nif l>=q[1]:\r\n print(o)\r\nelse:\r\n print(-1)", "a,b=map(int,input().split());c=list(map(int,input().split()));s=0\r\nfor i in range(a):\r\n s+=c[i];d=min(s,8);s-=d;b-=d\r\n if b<=0:exit(print(i+1))\r\nprint(-1)\r\n", "n, k = (int(x) for x in input().split())\r\ncandies = [int(x) for x in input().split()]\r\ni = 0\r\nif sum(candies) < k:\r\n\tprint(-1)\r\nelif n*8 < k:\r\n\tprint(-1)\r\nelse:\r\n\tstock = 0\r\n\tcurrent_candies = 0\r\n\twhile i < n:\r\n\t\tif candies[i] <= 8:\r\n\t\t\tcurrent_candies += candies[i]\r\n\t\t\tneed_more = 8 - candies[i]\r\n\t\t\tif stock <= need_more:\r\n\t\t\t\tcurrent_candies += stock\r\n\t\t\t\tstock = 0\r\n\t\t\telse:\r\n\t\t\t\tcurrent_candies += need_more\r\n\t\t\t\tstock -= need_more\r\n\t\telse:\r\n\t\t\tcurrent_candies += 8\r\n\t\t\tstock += (candies[i] - 8)\r\n\t\tif current_candies >= k:\r\n\t\t\tprint(i + 1)\r\n\t\t\tbreak\r\n\t\ti += 1\r\n\telse:\r\n\t\tprint(-1)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=0\r\nfor i in range(n):\r\n\tt+=a[i]\r\n\tk=k-min(8,t)\r\n\tt-=min(8,t)\r\n\tif k<=0:\r\n\t\tprint(i+1)\r\n\t\texit()\r\nif k>0:\r\n\tprint(-1)\r\n", "i=input().split()\r\nn,k=int(i[0]),int(i[1])\r\nj=input().split()\r\nl=list(map(int,j))\r\ndef h4(l):\r\n if l<=8:\r\n return l,0\r\n else:\r\n return 8,l-8\r\n \r\nl[0]=h4(l[0]) \r\ndef h(a,buff):\r\n if a+buff<=8:\r\n v=a+buff\r\n return v,0\r\n else:\r\n return 8,a+buff-8\r\n \r\n\r\nfor i in range(1,n):\r\n l[i] = h(l[i],l[i-1][1])\r\n\r\ndef q(l,k):\r\n v=0\r\n s=0\r\n if k> n*8:\r\n return -1\r\n for x in l:\r\n if s>=k:\r\n return v\r\n else:\r\n s+=x[0]\r\n v+=1\r\n if s>=k:\r\n return v \r\n else:\r\n return -1\r\n\r\nprint(q(l,k)) ", "import math\r\nfrom sys import stdin,stdout\r\nimport bisect\r\nm=10**9+7\r\n\r\ndef inp():\r\n return int(stdin.readline())\r\n\r\ndef inpstr():\r\n return list(stdin.readline().strip())\r\n\r\ndef inpli():\r\n return list(map(int,input().split()))\r\n\r\ndef inpmap():\r\n return map(int,input().split())\r\n\r\ndef opt(n):\r\n stdout.write(str(n)+\"\\n\")\r\n \r\ndef bexp(n,p):\r\n r=1\r\n while p>0:\r\n if p%2:\r\n r=r*n\r\n p=p-1\r\n else:\r\n n=n**2\r\n p=p//2\r\n return r\r\n\r\ndef gcd(a,b):\r\n while b:\r\n a=a%b\r\n b,a=a,b\r\n return a\r\n\r\ndef sieve(limit):\r\n l=[1]*(limit+1)\r\n l[0]=0\r\n l[1]=0\r\n prime=[]\r\n for i in range(2,limit+1):\r\n if l[i]:\r\n for j in range(i*i,limit+1,i):\r\n l[j]=0\r\n \r\n for i in range(2,limit+1):\r\n if l[i]:\r\n prime.append(i)\r\n return prime\r\n \r\ndef segs(low,high):\r\n limit=int(high**0.5)+1\r\n prime=soe(limit)\r\n n=high-low+1\r\n l=[0]*(n+1)\r\n for i in range(len(prime)):\r\n lowlimit=(low//prime[i])*prime[i]\r\n if lowlimit<low:\r\n lowlimit+=prime[i]\r\n if lowlimit==prime[i]:\r\n lowlimit+=prime[i]\r\n for j in range(lowlimit,high+1,prime[i]):\r\n l[j-low]=1\r\n for i in range(low,high+1):\r\n if not l[i-low]:\r\n if i!=1:\r\n print(i)\r\n\r\n#segs(low,high)\r\n#seive(limit)\r\n#bexp(n,a)\r\n#gcd(a,b)\r\ndef code():\r\n s=0\r\n c=0\r\n #n=inp() ##number input\r\n #s=inpstr() ##list string input\r\n #l=inpli() ##list integer input\r\n n,p=inpmap() ## map integers input\r\n l=inpli()\r\n for i in l:\r\n s=s+i\r\n g=min(s,8)\r\n p=p-g\r\n s=s-g\r\n c=c+1\r\n if p<=0:\r\n break\r\n if p>0:\r\n print(-1)\r\n else:\r\n print(c)\r\n \r\n #print(bexp(n,p))\r\n #opt(c)\r\n return \r\n\r\n#for _ in range(inp()):\r\ncode()\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "def main():\n n, k = [int(x) for x in input().split()]\n doces = [int(x) for x in input().split()]\n print(solve(n, k, doces))\ndef solve(n, k, doces):\n resto = 0\n for i in range(n):\n if doces[i] > 8:\n k -= 8\n if i < n-1:\n doces[i+1] += (doces[i] - 8)\n else:\n k -= doces[i]\n if k <= 0:\n return i+1\n return -1\nmain()\n \t\t \t\t\t\t \t \t \t \t\t \t \t", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nx, ans, cur = 0, 0, 0\r\nfor i in range(len(arr)):\r\n cur += arr[i]\r\n r = min(8, cur)\r\n cur -= r\r\n k -= r\r\n ans += 1\r\n if k <= 0:\r\n break\r\nif k <= 0:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = 0\r\nc = 0\r\nfor i in range(n):\r\n b += a[i]\r\n if b >= 8:\r\n b -= 8\r\n c += 8\r\n else:\r\n c += b\r\n b = 0\r\n if c >= k:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)", "\r\nmax_day, goal = map(int, input().split())\r\n\r\ngifts = map(int, input().split())\r\n\r\n\r\ndef candies():\r\n pocket = 0\r\n brann_pocket = 0\r\n for day, gift in enumerate(gifts, 1):\r\n pocket += gift\r\n brann_pocket += min(8, pocket)\r\n pocket -= min(8, pocket)\r\n\r\n if brann_pocket >= goal:\r\n print(day)\r\n return\r\n print(-1)\r\n \r\ncandies()", "_, k = map(int, input().split())\r\n\r\nacc = 0\r\nresult = -1\r\nfor i, v in enumerate(map(int, input().split())):\r\n acc += v\r\n d = min(acc, 8) \r\n k -= d\r\n acc -= d\r\n if k <= 0:\r\n result = i + 1\r\n break\r\n\r\nprint(result)", "n, k = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nflag = 1\r\ncandies = 0\r\nfor i in range(n):\r\n\tcandies+=l[i]\r\n\tif candies > k :\r\n\t\tcandies-=min(8,k)\r\n\t\tk-=min(8,k)\r\n\telse:\r\n\t\tk-=min(8,candies)\r\n\t\tcandies-=min(8,candies)\r\n\t# print(candies,k)\r\n\tif k == 0:\r\n\t\tflag = 0\r\n\t\tprint(i+1)\r\n\t\tbreak\r\nif flag == 1:\r\n\tprint(-1)", "from math import ceil\r\nn,k = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\ncur = 0\r\nans = 0\r\nfor i in range(n):\r\n cur += a[i]\r\n r = min(8,cur)\r\n k -= r\r\n cur -= r\r\n ans +=1\r\n if k <=0:\r\n break\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(ans)", "n,k = map(int,input().split())\r\na = input().split()\r\ndays = 0\r\nostatok = 0\r\nsweets = 0\r\nfor i in a:\r\n days += 1\r\n i = int(i)\r\n i += ostatok\r\n ostatok = 0\r\n if i > 8:\r\n ostatok = i-8\r\n sweets += 8\r\n else: sweets += i\r\n\r\n if sweets >= k:\r\n break\r\nif sweets >= k: print(days)\r\nelse:print(-1)\r\n\r\n\r\n", "n, k = map(int, input().split())\narr = map(int, input().split())\n\n\nif n * 8 < k:\n print(-1)\n exit(0)\n\ncur = 0\nbuf = 0\nfor i, el in enumerate(arr):\n buf += el\n to_return = min(8, buf)\n cur += to_return\n buf -= to_return\n \n if cur >= k:\n print(i + 1)\n exit(0)\n\nprint(-1)\n", "n,k=[int(i) for i in input().split()]\r\nlst=list(map(int,input().split()))\r\ns,c=0,0\r\nfor i in range(n):\r\n if lst[i]>8:\r\n s+=8\r\n c+=1\r\n try:\r\n lst[i+1]+=(lst[i]-8)\r\n except:\r\n pass\r\n elif lst[i]<=8:\r\n s+=lst[i]\r\n c+=1\r\n if s>=k:\r\n break\r\nif c!=0 and s>=k:\r\n print(c)\r\nelse:\r\n print(-1)", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres,check,nho=0,0,0\r\nfor i in range(len(a)):\r\n if a[i]+nho>8:\r\n res+=8\r\n nho=a[i]+nho-8\r\n else:\r\n res+=a[i]+nho\r\n nho=0\r\n if res>=k:\r\n print(i+1)\r\n check=1\r\n break\r\nif check==0:\r\n print(-1)", "n,k=map(int,input().split())\r\nx=input().split()\r\ngiven=0\r\nstop=False\r\nsaved=0\r\nfor i in range(len(x)):\r\n if(int(x[i])>=8):\r\n given+=8\r\n saved+=(int(x[i])-8)\r\n elif(int(x[i])<8):\r\n dif=8-int(x[i])\r\n given+=int(x[i])\r\n if(saved<=dif):\r\n given+=saved\r\n saved=0\r\n if(saved>dif):\r\n given+=dif\r\n saved-=dif\r\n\r\n if(given>=k):\r\n print(i+1)\r\n stop=True\r\n break\r\nif(stop==False):\r\n print(-1)", "n, k = (int(i) for i in input().split())\na = (int(i) for i in input().split())\nres, arya = 0, 0\nfor i in a:\n arya += i\n give = min(8, arya)\n k -= give\n arya -= give\n res += 1\n if k <= 0:\n break\nres = res if k <= 0 else -1\nprint(res)\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n val = 0\r\n tmp = 0\r\n ans = -1\r\n for i in range(n):\r\n tmp += A[i]\r\n if tmp >= 8:\r\n tmp -= 8\r\n val += 8\r\n else:\r\n val += tmp\r\n tmp = 0\r\n if val >= m:\r\n ans = i + 1\r\n break\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nkol = 0\r\nl = 0\r\nfor i in s:\r\n kol += i\r\n r = min(8, kol)\r\n kol -= r\r\n k -= r\r\n l += 1\r\n if k <= 0:\r\n break\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(l)", "n, k = map(int, input().split())\r\ng = 0\r\na = list(map(int, input().split()))\r\nfor i in range(len(a)):\r\n if a[i] <= 8:\r\n g += a[i]\r\n else:\r\n g += 8\r\n if i < len(a) - 1:\r\n a[i + 1] += a[i] - 8\r\n if g >= k:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)", "import sys\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ngiven=0\r\narya=0\r\nfor i in range(n):\r\n arya+=a[i]\r\n given+=min(8,arya)\r\n arya=max(arya-8,0)\r\n if given>=k:\r\n print(i+1)\r\n sys.exit()\r\nprint(-1)", "def aryaBran():\r\n d,g = map(int, input().split())\r\n l1 = list(map(int, input().split()))\r\n curr = 0\r\n\r\n for i in range(d):\r\n curr += l1[i]\r\n r = min(8,curr)\r\n curr -= r\r\n g -= r\r\n\r\n if(g <= 0):\r\n return i + 1\r\n\r\n return -1\r\n\r\n\r\n\r\nans = aryaBran()\r\nprint(ans)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ntemp=0\r\ni=0\r\nfor el in arr:\r\n temp+=el\r\n i+=1\r\n m=min(8,temp)\r\n k-=m \r\n temp-=m \r\n if k<=0:\r\n break\r\nif k<=0:\r\n print(i)\r\nelse :\r\n print(-1)\r\n", "(n, k) = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\na.append(0)\n\ndays = 0\ncandies = 0\n\nwhile candies < k:\n if days == n:\n break\n\n if a[days] <= 8:\n candies += a[days]\n else:\n candies += 8\n a[days + 1] += a[days] - 8\n days += 1\n\nif candies < k:\n print('-1')\nelse:\n print(days)", "n, k = list(map(int, input().split()))\ncandies = list(map(int, input().split()))\ndays = 0\nbuff = 0\nb = False\nfor i, e in enumerate(candies):\n if e < 9:\n if buff:\n if (buff + e) < 9:\n k -= (e + buff)\n buff = 0\n else:\n k -= 8\n buff -= (8 - e)\n else:\n k -= e\n else:\n k -= 8\n buff += (e - 8)\n if k <= 0:\n print(i+1)\n b = True\n break\nif not b:\n print(-1)\n \n", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns,x =0,0\r\nfor i in l:\r\n\tx+=1;s+=i\r\n\tif s<=8:b-=s;s =0\r\n\telse:b-=8;s-=8\r\n\tif b<=0:break\r\nif b>0:print(-1)\r\nelse:print(x)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nsav=0\r\nfor i in range(n):\r\n s+=min(a[i]+sav,8)\r\n sav+=a[i]-min(a[i]+sav,8)\r\n if s>=k:\r\n print(i+1)\r\n exit()\r\nprint(-1)", "n, k = [int(i) for i in input().split()]\r\nsweets = [int(i) for i in input().split()]\r\ndays, rest, i = 0, 0, 0\r\nfor i in range(n):\r\n rest += sweets[i]\r\n i += 1\r\n days += 1\r\n if rest > 8:\r\n k -= 8\r\n rest -= 8\r\n else:\r\n k -= rest\r\n rest = 0\r\n if k <= 0 and days <= n:\r\n print(days)\r\n break\r\nelse:\r\n print(-1)\r\n", "n, k = map(int, input().split())\r\n*ar, = map(int, input().split())\r\nif k > sum(ar):\r\n print(-1)\r\nelse:\r\n a = 0\r\n ans = -1\r\n for i in range(n):\r\n j = ar[i]\r\n if j < 8:\r\n k -= min(8, j + a)\r\n a -= (8 - j)\r\n a = max(0, a)\r\n else:\r\n k -= 8\r\n a += (j - 8)\r\n if k <= 0:\r\n ans = i + 1\r\n break\r\n print(ans)\r\n \r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().strip().split()))\r\nj=0;now=0\r\nwhile k>0 and j<n:\r\n j=j+1\r\n now=now+a[j-1]\r\n if now>=8:\r\n k=k-8\r\n now=now-8\r\n else:\r\n k=k-now\r\n now=0\r\nif j==n and k>0:print(-1)\r\nelse:print(j)\r\n", "n, k = map(int, input().split())\r\n \r\narr = [int(i) for i in input().split()]\r\ndop = 0\r\nday = 1\r\n\r\nfor i in range(n):\r\n if arr[i] >= 8:\r\n dop += arr[i] - 8\r\n k -= 8\r\n else:\r\n if dop:\r\n if dop + arr[i] >= 8:\r\n dop -= 8 - arr[i]\r\n k -= 8\r\n else:\r\n k -= arr[i] + dop\r\n dop = 0\r\n else:\r\n k -= arr[i]\r\n \r\n if k <= 0:\r\n print(i + 1)\r\n exit()\r\n\r\nif k <= 0:\r\n print(n)\r\nelse:\r\n print(-1)", "N, K = map(int, input().split())\r\nl_candies = list(map(int, input().split()))\r\n\r\ni, r = 0, 0\r\nfor c in l_candies:\r\n r += c\r\n i += 1\r\n K -= min(8, r)\r\n r -= min(8, r)\r\n if K <= 0:\r\n print(i)\r\n quit()\r\nprint(-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 6 19:03:28 2020\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\n\r\n#https://codeforces.com/problemset/problem/839/A\r\n\r\n\r\ndef arya_candles():\r\n total = input().split() # [0] = days [1] = how many he needs\r\n days = input().split()\r\n \r\n posible_days = 0\r\n accumulated = 0\r\n saved = 0\r\n \r\n for i in range(len(days)):\r\n days[i] = int(days[i]) + saved\r\n saved = 0\r\n if int(days[i]) <= 8:\r\n posible_days += 1\r\n total[1] = (int(total[1]) - int(days[i]))\r\n if total[1] < 1:\r\n print(posible_days)\r\n return\r\n else:\r\n posible_days += 1\r\n total[1] = (int(total[1]) - 8)\r\n if total[1] < 1:\r\n print(posible_days)\r\n return\r\n saved = (int(days[i]) - 8)\r\n \r\n print(-1)\r\n \r\narya_candles()\r\n \r\n \r\n \r\n \r\n \r\n ", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=0\r\nc=0\r\np=0\r\nfor i in range(n):\r\n\td+=l[i]\r\n\tif d>8:\r\n\t\td-=8\r\n\t\tm-=8\r\n\t\tc+=1\r\n\t\tif m<=0:\r\n\t\t\tp+=1\r\n\t\t\tbreak\r\n\telse:\r\n\t\tm-=d\r\n\t\td=0\r\n\t\tc+=1\r\n\t\tif m<=0:\r\n\t\t\tp+=1\r\n\t\t\tbreak\r\nif p>0:\r\n\tprint(c)\r\nelse:\r\n\tprint(-1)", "def cAnDy(k,a):\r\n amount_of_candy=0\r\n days=0\r\n i=0\r\n while k>0 and i<len(a):\r\n days+=1\r\n amount_of_candy+=a[i]\r\n i+=1\r\n if amount_of_candy>=8:\r\n k-=8\r\n amount_of_candy-=8\r\n continue\r\n k-=amount_of_candy\r\n amount_of_candy=0\r\n if k<=0:\r\n return days\r\n return -1\r\nn,k=map(int,input().split())\r\nh=[int(i) for i in input().split()]\r\nprint(cAnDy(k,h))", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ncount=0\r\nana,f=0,0\r\nans=0\r\nfor val in a:\r\n if ans>=k:\r\n f=1 \r\n break\r\n if val+ana<=8:\r\n ans+=val+ana\r\n ana=0\r\n count+=1 \r\n else:\r\n ana=(val+ana)-8\r\n count+=1 \r\n ans+=8 \r\nif f==1 or ans>=k :\r\n print(count)\r\nelse:\r\n print(-1)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\np1 = 0\r\np2 = 0\r\n\r\nfor i in range(len(a)):\r\n p1 += a[i]\r\n p2 += min(p1, 8)\r\n p1 -= min(p1, 8)\r\n if p2 >= k:\r\n print(i+1)\r\n break\r\n\r\nif p2 < k:\r\n print(-1)\r\n\r\n", "from sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9 + 7)\r\nimport re #can use multiple splits\r\ndef tup():return map(int,stdin.readline().split())\r\ndef I(): return int(stdin.readline())\r\ndef lint(): return [int(x) for x in stdin.readline().split()]\r\ndef S(): return input().strip()\r\ndef grid(r, c): return [lint() for i in range(r)]\r\ndef debug(*args, c=6): print('\\033[3{}m'.format(c), *args, '\\033[0m', file=stderr)\r\nfrom math import log2,sqrt\r\n# R,D = tup()\r\n# cnt =0\r\n#\r\n# for _ in range(I()):\r\n# x, y , r = tup()\r\n# if sqrt(x**2 + y**2) + r <= R and sqrt(x**2 + y**2) >= R -D + r:\r\n# cnt+=1\r\n# debug(sqrt(x**2 + y**2),r)\r\n# print(cnt)\r\nfrom collections import defaultdict\r\nn, k = tup()\r\nls =lint()\r\ns =0 ; c =0 ; f = False ; idx =-1\r\nfor i in range(n):\r\n s+=ls[i]\r\n if s <8:\r\n c+=s\r\n s=0\r\n else:\r\n c+=8\r\n s-=8\r\n if c>=k:\r\n f = True\r\n idx= i+1\r\n break\r\n #debug(s , c )\r\nprint(idx)\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\n k, s = (k - 8, s - 8) if s > 8 else (k - s, 0)\r\n if k <= 0:\r\n exit(print(i + 1))\r\nprint(-1)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncandy = 0\r\nother = 0\r\ndays = 0\r\nwhile candy < k and days < n:\r\n if arr[days] >= 8:\r\n candy=candy+8\r\n other=other+arr[days]-8\r\n else:\r\n if other >=8:\r\n candy=candy+8\r\n other=other-8+arr[days]\r\n else:\r\n other=other+arr[days]\r\n if other >=8:\r\n candy=candy+8\r\n other=other-8\r\n else:\r\n candy=candy+other\r\n other=0\r\n days += 1\r\n \r\nif candy>=k:\r\n print(days)\r\nelse:\r\n print(-1)", "n, k = map(int, input().split())\r\nlst = [*map(int, input().split())]\r\nt = 0\r\nfor i in range(n):\r\n t += lst[i]\r\n k -= min(8, t)\r\n t -= min(8, t)\r\n if k <= 0:\r\n print(i + 1)\r\n exit()\r\nif k > 0:\r\n print(-1)\r\n", "n,k=map(int,input().split())\nh=0\nfor e,i in enumerate(input().split()):\n h+=int(i)\n k-=min(8,h)\n h-=min(8,h)\n if k<=0:print(e+1);break\nelse:print(-1)", "n,k=input().split()\r\nn=int(n);k=int(k)\r\nA=input().split()\r\nz=0\r\ns=0\r\ny=1\r\nfor x in A:\r\n if(int(x)>8):\r\n z+=int(x)-8\r\n x='8'\r\n elif(int(x)<8):\r\n j=min(8-int(x),z)\r\n x=int(x)+j\r\n z-=j \r\n s+=int(x) \r\n if(s>=k):\r\n print(y)\r\n break\r\n y+=1\r\nelse:\r\n print(\"-1\")\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nr = 0\r\nans = 0\r\ng = 0\r\nwhile n != 0:\r\n n -= 1\r\n g += l[i]\r\n r = min(8,g)\r\n g -= r\r\n k -= r\r\n ans += 1\r\n i += 1\r\n if k <= 0:\r\n break\r\nif k > 0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ngiven = 0\r\nans = -1\r\nsave = 0\r\nfor i, candy in enumerate(arr, start=1):\r\n if candy >= 8:\r\n k -= 8\r\n save += candy-8\r\n else:\r\n need = 8 - candy\r\n available = min(need, save)\r\n k -= (available+candy)\r\n save -= available\r\n if k <=0:\r\n ans = i\r\n break\r\n\r\nprint(ans)\r\n", "n , k = map(int,input().split())\r\na = [int(i) for i in input().split()][:n]\r\nd = 0\r\ne = 0\r\nif k > sum(a):\r\n\tprint(-1)\r\nelse:\r\n\tfor item in a:\r\n\t\tif item+e >= 8:\r\n\t\t\tk-=8\r\n\t\t\te += (item-8)\r\n\t\telse:\r\n\t\t\tk-=item+e\r\n\t\t\te = 0\r\n\t\td+=1\r\n\t\tif k <= 0:\r\n\t\t\tprint(d)\r\n\t\t\tbreak\r\n\t\tif d == n:\r\n\t\t\tprint(-1)\r\n\t\t\tbreak", "n,k = map(int,input().split())\na = list(map(int,input().split()))\nk1 = 0\nk2 = 0\nd=0\nwhile k2 < k and d<n:\n\n k1+= a[d]\n tmp = min(8,k1)\n k1-=tmp\n k2+=tmp\n d+=1\nif k2>=k:\n print(d)\nelse:\n print(-1)\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n, k = IA()\r\n a = IA()\r\n c = i = bank = 0\r\n while k > 0 and i < n:\r\n bank += a[i]\r\n if bank >= 8:\r\n k-=8\r\n bank-=8\r\n else:\r\n k-=bank\r\n bank=0\r\n c += 1\r\n i += 1 \r\n return c if k <= 0 else -1\r\n \r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n print(main())", "n,k = [int(i)for i in input().split()]\na = [int(i)for i in input().split()]\nacandy = 0\nhasNotHappened = True\nbcandy = 0\ni = 0\nwhile hasNotHappened:\n \n if bcandy >= k:\n print(i)\n break\n elif i == n:\n print(-1)\n break\n acandy += a[i]\n if acandy >= 8:\n acandy -= 8\n bcandy += 8\n else:\n bcandy += acandy\n acandy = 0 \n \n i += 1\n \n", "n, k = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\n\r\na = 0\r\nb = 0\r\n\r\nfor i in range(n):\r\n a += c[i]\r\n if a >= 8:\r\n b += 8\r\n a -= 8\r\n else:\r\n b += a\r\n a = 0\r\n\r\n if b >= k:\r\n print(i + 1)\r\n break\r\n\r\nelse:\r\n print(-1)\r\n", "n,k = list(map(int,input().split()))\r\nst = list(map(int,input().split()))\r\ncnd = 0\r\nt = 0\r\nfor i in range(n):\r\n if cnd < k:\r\n if st[i] <= 8:\r\n cnd += st[i]\r\n elif i != n-1 and st[i] > 8 :\r\n cnd += 8\r\n st[i+1] += st[i]-8\r\n elif i == n-1 and st[i] > 8:\r\n cnd += 8\r\n t += 1\r\nif cnd >= k :\r\n print(t)\r\nelse:\r\n print(-1)\r\n", "def solve():\r\n n, k = map(int, input().split())\r\n numbers = tuple(map(int, input().split()))\r\n have = 0\r\n t = 0\r\n \r\n for i in range(n):\r\n if numbers[i] > 8:\r\n have += 8\r\n t += numbers[i] - 8\r\n elif numbers[i] + t > 8:\r\n have += 8\r\n t -= 8 - numbers[i]\r\n else:\r\n have += numbers[i] + t\r\n t = 0\r\n \r\n if have >= k:\r\n print(i + 1)\r\n \r\n return\r\n \r\n print(-1)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nf=0\r\nc=0\r\nfor i in range(n):\r\n c+=l[i]\r\n if(c>8):\r\n k-=8\r\n c-=8\r\n else:\r\n k-=c\r\n c=0\r\n if(k<=0):\r\n f=1\r\n print(i+1)\r\n break\r\nif(f==0):\r\n print(-1)", "n,k=list(map(int,input().split(\" \")))\r\nlst=list(map(int,input().split(\" \")))\r\ni=0;\r\n\r\nwhile(k>0 and i<n):\r\n if lst[i]>=8:\r\n k-=8;\r\n lst[i]-=8\r\n if i<n-1:\r\n lst[i+1]+=lst[i]\r\n else:\r\n k-=lst[i]\r\n i+=1\r\nif k<=0:\r\n\r\n print(i)\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\n\r\ni=0\r\ncandy=0\r\nwhile k>0 and i<n :\r\n candy+=s[i]\r\n p = min(candy,8)\r\n k-=p\r\n i+=1\r\n candy-=p\r\n\r\nif k>0:\r\n print(-1)\r\n exit()\r\nprint(i)\r\n", "import math\r\nimport sys\r\nimport collections\r\nfrom collections import defaultdict\r\nfrom sys import stdin, stdout\r\n\r\nsys.setrecursionlimit(10**9)\r\n\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ncnt,summ=0,0\r\ni=0\r\nwhile k>0 and i<n:\r\n summ+=arr[i]\r\n k-=min(summ,8)\r\n summ-=min(summ,8)\r\n cnt+=1\r\n i+=1\r\nif k>0:\r\n print(-1)\r\nelse:\r\n print(cnt)", "from math import ceil, sqrt, floor\r\nimport sys \r\n\r\nn,k = map(int, input().split())\r\ntt = 0\r\nfor jour, i in enumerate(map(int, input().split())):\r\n tt += i\r\n aRetirer = min(8,tt)\r\n k -= aRetirer\r\n tt -= aRetirer\r\n\r\n if k <= 0:\r\n break\r\n\r\nprint([-1, jour+1][k <= 0])\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns,f,r=0,0,0\r\nfor i in range(n):\r\n\tr+=l[i]\r\n\tif s<k:\r\n\t\tif r>8:\r\n\t\t\ts+=8\r\n\t\t\tr-=8\r\n\t\telse:\r\n\t\t\ts+=r\r\n\t\t\tr=0\r\n\tif s>=k:\r\n\t\tf=1\r\n\t\tbreak\r\nif f==1:print(i+1)\r\nelse:print(-1)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncandies = 0\r\nfor i in range(n):\r\n candies += a[i]\r\n k -= min(candies, 8)\r\n candies = max(candies - 8, 0)\r\n if k <= 0:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\r\n", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ncandies_bran = 0\r\ncandies_Aria = 0\r\nanswer = -1\r\nday = 0\r\nfor candy in a:\r\n day += 1\r\n candies_Aria += candy\r\n if candies_Aria <= 8:\r\n candies_bran += candies_Aria\r\n candies_Aria = 0\r\n else:\r\n candies_bran += 8\r\n candies_Aria -= 8\r\n if candies_bran >= k:\r\n answer = day\r\n break\r\nprint(answer)\r\n", "def solve():\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n total = 0\n for i in range(n):\n cur = min(total + a[i], 8)\n k -= cur\n total += a[i] - cur\n if k <= 0:\n return i + 1\n if k > 0:\n return -1\n\nprint(solve())", "def main():\r\n n, k = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n\r\n s, reserve = 0, 0\r\n for i in range(n):\r\n current_candies = arr[i] + reserve\r\n s += min(current_candies, 8)\r\n reserve = max(current_candies - 8, 0)\r\n\r\n if s >= k:\r\n print(i + 1)\r\n return\r\n\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\narya,bran = 0,0\r\nfor i in range(n):\r\n arya += a[i]\r\n tmp = min(arya,8)\r\n bran += tmp\r\n arya -= tmp\r\n if bran>=k:\r\n print(i+1)\r\n exit(0)\r\nprint(-1)", "def f(l):\r\n\tfor i in range(len(l)-1):\r\n\t\tif l[i]>8:\r\n\t\t\tl[i+1]+=l[i]-8\r\n\t\t\tl[i]=8\r\n\treturn l\r\ndef fn(l,k):\r\n\tc=0\r\n\tfor i in range(len(l)):\r\n\t\tc+=l[i]\r\n\t\tif k<=l[i]:\r\n\t\t\treturn i+1\r\n\t\telse:\r\n\t\t\tk-=l[i]\r\n\treturn -1\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.append(0)\r\nl=f(l)\r\nl.pop(len(l)-1)\r\nprint(fn(l,k))\r\n# print(*l)\r\n# print(c)", "n, k = [ int(i) for i in input().split() ]\r\naria = 0\r\nbran = 0\r\na = [ int(i) for i in input().split() ]\r\nfor i in range(len(a)):\r\n aria += a[i]\r\n if aria < 8:\r\n bran += aria\r\n aria = 0\r\n else:\r\n bran += 8\r\n aria -= 8\r\n if bran >= k:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\r\n", "def main(mainlist):\r\n n = mainlist[0]\r\n k = mainlist[1]\r\n a_list = [int(i) for i in input().split()]\r\n a = 0\r\n b = 0\r\n d = 0\r\n while b<k and d<n:\r\n a+=a_list[d]\r\n t = min([8,a])\r\n a-=t\r\n b+=t\r\n d+=1\r\n if b>=k:\r\n return d\r\n else:\r\n return -1\r\n\r\nprint(main([int(i) for i in input().split()]))", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\np=0\r\nfor i in range(n):\r\n if a[i]>8:\r\n k-=8\r\n p+=a[i]-8\r\n else:\r\n k-=a[i]\r\n if p!=0:\r\n k-=min(p,8-a[i])\r\n p-=min(p,8-a[i])\r\n if k<=0:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)", "n,k = map(int, input().split())\r\ncandy = [int(i) for i in input().split(\" \")]\r\ngiven, days, extra = 0,0,0\r\n\r\nfor i in range(n):\r\n days += 1\r\n if (candy[i]+extra) < 8:\r\n given += (candy[i]+extra)\r\n extra = 0\r\n else:\r\n given += 8\r\n extra = (candy[i]+extra)-8\r\n if given >= k:\r\n break\r\n \r\nif given >= k:\r\n print (days)\r\nelse:\r\n print (\"-1\")", "n, k = map(int, input().split())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\nstore = 0\r\ngiven = 0\r\n\r\nfor i in range(n):\r\n give = min(8, store + daf[i])\r\n given += give\r\n store += daf[i] - give\r\n if given >= k:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\r\n", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\na = input().split()\r\na.insert(0,0)\r\ntuiA = 0\r\ntuiB = 0\r\ndainchua = 0\r\nfor i in range(1,n+1,1):\r\n tuiA+=int(a[i])\r\n if k-tuiB >=8 and tuiA>=8:\r\n tuiA-=8\r\n tuiB+=8\r\n elif k-tuiB >=8 and tuiA<8:\r\n tuiB+=tuiA\r\n tuiA = 0\r\n elif k-tuiB<8 and tuiA>=(k-tuiB):\r\n tuiB=k\r\n elif k-tuiB<8 and tuiA<(k-tuiB):\r\n tuiB+=tuiA\r\n tuiA=0\r\n if k-tuiB == 0:\r\n print(i)\r\n dainchua = 1\r\n break\r\nif dainchua == 0:\r\n print(-1)\r\n", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\na=list(map(int, input().split()))\r\na.append(0)\r\ns=0\r\ni=0\r\nwhile s<k and i<n:\r\n if a[i]>8:\r\n s+=8\r\n a[i+1]+=a[i]-8\r\n else:s+=a[i]\r\n i+=1\r\n #print(s,i)\r\nif s>=k:\r\n print(i)\r\nelse:print(-1)", "\r\nn, k = map(int, input().split())\r\na = list(map(int,input().split()))\r\n\r\ni = 0\r\ns = 0\r\n\r\nwhile k > 0 and i<n:\r\n s+=a[i]\r\n today = min(s, 8)\r\n s-=today\r\n k-=today\r\n i+=1\r\nif k<=0:\r\n print(i)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int, input().split())\r\nl=list(map(int, input().split())) \r\nfor i in range(n):\r\n c=min(k,l[i],8)\r\n if i!=n-1:\r\n l[i+1]+=l[i]-c\r\n k-=c\r\n if k==0:\r\n print(i+1)\r\n break\r\nelse:\r\n print(\"-1\")\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans,res=0,0\r\nfor i in range(n):\r\n if a[i]>8:\r\n if i==n-1:\r\n a[n-1]+=a[i]-8\r\n else:\r\n a[i+1]+=a[i]-8\r\n a[i]=8\r\n ans+=a[i]\r\n res+=1\r\n #print(ans)\r\n if ans>=k:\r\n print(res)\r\n exit()\r\nprint(-1)\r\n", "n, k = map(int, input().split())\nv = list(map(int, input().split()))\nt = 0\ni = 0\nfor i in range(0, n):\n t += v[i]\n x = min(8, t)\n k -= x\n t -= x\n if k <= 0:\n break\nprint([i + 1, -1][k > 0])\n", "n, k = [int(s) for s in input().split()]\r\nLIST = [int(s) for s in input().split()]\r\n\r\na = 0\r\nb = 0\r\nd = 0\r\n\r\nfor i in range(n):\r\n a += LIST[i]\r\n if a >= 8:\r\n a -= 8\r\n b += 8\r\n d += 1\r\n else:\r\n b += a\r\n a -= a\r\n d += 1\r\n if b >= k:\r\n print(d)\r\n break\r\n \r\nif b < k:\r\n print(-1)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = -1\r\nnow = 0\r\nfor i in range(n):\r\n now += a[i]\r\n c = min(now, k, 8)\r\n k -= c\r\n now -= c\r\n if not k:\r\n ans = i + 1\r\n break\r\nprint(ans)", "\r\nn,k=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\nrem=0\r\nc=1\r\nfor i in arr:\r\n if i>=k:\r\n if k>=8:\r\n k=k-8\r\n rem+=i-8\r\n else:k=0\r\n else:\r\n if i>=8:\r\n k=k-8\r\n rem+=i-8\r\n else:\r\n if k<8:\r\n if rem>=(k-i):\r\n rem-=(k-i)\r\n k=0\r\n else:\r\n k=k-i-rem\r\n rem=0\r\n else:\r\n if rem>=(8-i):\r\n rem-=(8-i)\r\n k=k-8\r\n else:\r\n k=k-i-rem\r\n rem=0\r\n if k<=0:\r\n print(c)\r\n exit()\r\n c+=1\r\nprint(-1)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = tank = 0\r\nfor i in range(n):\r\n\ttank+=a[i]\r\n\tif tank>=8:\r\n\t\tcount+=1\r\n\t\ttank-=8\r\n\t\tk-=8\r\n\telse:\r\n\t\tcount+=1\r\n\t\tk-=tank\r\n\t\ttank=0\r\n\tif k<=0:\r\n\t\tbreak\r\nif k>0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(count)", "n,k = input().split()\r\nn,k = int(n),int(k)\r\n#Example above is called Destructuring\r\na = input().split()\r\naLength = len(a)\r\nbreakCode = False\r\ncandiesLeft = 0\r\ncandiesGiven = 0\r\nbreakCode = False\r\ndef BranSatisfied():\r\n if candiesGiven >= k:\r\n print(i+1)\r\n breakCode = True\r\n exit()\r\n if candiesGiven < k and i+1 == aLength:\r\n print(-1)\r\n breakCode = True\r\n exit()\r\n\r\n\r\n\r\nfor i in range(n):\r\n candiesLeft += int(a[i])\r\n if candiesLeft < 8:\r\n candiesGiven += candiesLeft\r\n candiesLeft = 0\r\n BranSatisfied()\r\n if breakCode == True:\r\n exit()\r\n else:\r\n candiesGiven += 8\r\n candiesLeft -= 8\r\n BranSatisfied()\r\n if breakCode == True:\r\n exit()", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=d=flag=0\r\nwhile k>0:\r\n\td+=1\r\n\tif a[i]<=8:\r\n\t\tk-=a[i]\r\n\telse:\r\n\t\tk-=8\r\n\t\tif i!=n-1:\r\n\t\t\ta[i+1]+=a[i]-8\r\n\tif k<=0:\r\n\t\tflag=1\r\n\t\tbreak\r\n\tif d==n:\r\n\t\tbreak\r\n\ti+=1\r\nif flag==0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(d)", "from math import ceil as floor\r\nn,k=tuple(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nt=0\r\ni=0\r\nwhile k>0 and i<n:\r\n\tt+=b[i]\r\n\ts=min(8,t)\r\n\tk-=s\r\n\tt-=s\r\n\ti+=1\r\nif k<=0:\r\n\tprint(i)\r\nelse:\r\n\tprint(-1)", "n, k = map(int, input().split())\r\na, s = list(map(int, input().split())), 0\r\nfor i in range(n):\r\n s += a[i]\r\n d = min(s, 8)\r\n s, k = s - d, k - d\r\n if k <= 0:\r\n exit(print(i + 1))\r\nprint(\"-1\")", "days_and_wants = input().split()\r\nDays = days_and_wants[0]\r\nwants = days_and_wants[1]\r\nBcandies = 0\r\nAcandies = 0\r\ndays = 0\r\n\r\ncandies_per_day = input().split()\r\n\r\nfor i in candies_per_day:\r\n Acandies += int(i)\r\n if Acandies <= 8:\r\n Bcandies += Acandies\r\n Acandies = 0\r\n else:\r\n Bcandies += 8\r\n Acandies -= 8\r\n days += 1\r\n if Bcandies >= int(wants):\r\n break\r\n\r\nif Bcandies < int(wants):\r\n print(-1)\r\nelse:\r\n print(days)", "# list(map(int,input().split()))\r\n\r\nimport math\r\nfrom collections import defaultdict, Counter\r\nimport sys\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w+')\r\n\r\n# for t in range(int(input())):\r\n\r\nn,k = map(int, input().split())\r\nl = list(map(int,input().split()))\r\nans = -1\r\nsto = 0\r\nfor i in range(n):\r\n sto+=l[i]\r\n k-=min(sto,8)\r\n sto-=min(sto,8)\r\n if(k<=0):\r\n ans = i+1\r\n break\r\nprint(ans) ", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nleftovers = 0\r\n\r\ncandies_map = map(int, input().split())\r\ncandies = list(candies_map)\r\n\r\ncompleted = False\r\n\r\nfor i in range(n):\r\n if candies[i] >= 8:\r\n k -= 8\r\n leftovers += candies[i] - 8\r\n else:\r\n k -= candies[i]\r\n if leftovers >= 8 - candies[i]:\r\n k -= 8 - candies[i]\r\n leftovers -= 8 - candies[i]\r\n else:\r\n k -= leftovers\r\n leftovers = 0\r\n\r\n if k <= 0:\r\n print(i + 1)\r\n completed = True\r\n break\r\n\r\nif not completed:\r\n print(-1)", "\r\nn, k = list(map(int, input().split()))\r\n\r\narr = list(map(int, input().split()))\r\n\r\nres = -1\r\ncarry = 0\r\n\r\nfor i, v in enumerate(arr):\r\n\r\n v += carry\r\n\r\n\r\n if (v > 8):\r\n carry = v-8\r\n v = 8\r\n else: \r\n carry = 0\r\n k -= v\r\n\r\n if k <= 0:\r\n res = i + 1\r\n break\r\n # print(k)\r\n\r\nprint(res)", "'''\nhttps://codeforces.com/problemset/problem/839/A\n'''\n\n\nfirst_list = input()\nsecond_line = input()\nn, target = first_list.split(' ')\nn, target = int(n), int(target)\ntarget_ach = 0\nnext_avail = 0\nfor ai in second_line.split(' '):\n ai = int(ai)\n target_ach += 1\n ai += next_avail\n if ai <= 8:\n target -= ai\n next_avail = 0\n else:\n target -= 8\n next_avail = ai - 8\n if target <= 0:\n print(target_ach)\n break\n\nelse:\n print('-1')\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif l[i]<=8:\r\n\t\tk-=l[i]\r\n\tif l[i]>8:\r\n\t\tk-=8\r\n\t\tif i!=n-1:\r\n\t\t\tl[i+1]+=(l[i]-8)\r\n\tif k<1:\r\n\t\tbreak\r\nif k>0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(i+1)\r\n\t", "n, k = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\na = 0\r\nb = 0\r\nd = 0\r\nwhile b < k and d < n:\r\n a += s[d]\r\n tmp = min(8, a)\r\n a -= tmp\r\n b += tmp\r\n d += 1\r\nif b >= k:\r\n print(d)\r\nelse:\r\n print(-1)" ]

[ "def subset(s1,s2):\n\td={}\n\tfor i in s1:\n\t\td[i]=1\n\tflag=0\n\tfor i in s2:\n\t\tif i not in d:\n\t\t\tflag=1\n\t\t\tbreak\n\tif flag==0:\n\t\treturn True\n\telse:\n\t\treturn False\n\nn=int(input())\nl=[]\nfor i in range(n):\n\tl.append(list(map(int,input().split()))[1:])\nfor i in range(n):\n\tans='YES'\n\tfor j in range(n):\n\t\tif i!=j:\n\t\t\tif subset(l[i],l[j]):\n\t\t\t\tans=\"NO\"\n\t\t\t\tbreak\n\tprint (ans)", "'''\r\n3\r\n1 1\r\n3 2 4 1\r\n2 10 11\r\n'''\r\nn = int(input())\r\nhands = []\r\nfor i in range(n):\r\n hand = list(map(int, input().split()))\r\n hand.pop(0)\r\n hand = set(hand)\r\n hands.append(hand)\r\n\r\nfor i in range(n):\r\n hand = hands[i]\r\n #check whether this hand is completely wrapped another hand\r\n possibleHands = set(range(n))\r\n possibleHands.remove(i)\r\n completelyWraps = False\r\n for otherHand in possibleHands:\r\n if hand.issuperset(hands[otherHand]):\r\n completelyWraps = True\r\n break\r\n if completelyWraps:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "a = []\r\nn = int(input())\r\nfor i in range(n):\r\n a.append(set(list(map(int, input().split()))[1:]))\r\nfor i in range(n):\r\n possible = True\r\n for j in range(n):\r\n if i != j:\r\n if a[i] & a[j] == a[j]:\r\n possible = False\r\n break\r\n if possible:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\ncard = [[int(s) for s in input().split()][1:] for x in range (n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if j != i:\r\n for k in card[j]:\r\n if k not in card[i]:\r\n \tbreak\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "n = int(input())\r\na = []\r\nm = []\r\np = []\r\nmn = []\r\nfor i in range(n):\r\n b = list(map(int,input().split()))\r\n a.insert(i,b)\r\n #a.append(b)\r\n #m = m + [a[i][0]]\r\n m.append(a[i][0])\r\n a[i] = a[i][1:]\r\n mn.append(set(a[i]))\r\n p.append('YES')\r\n\r\nfor j in range(n):\r\n for i in range(n):\r\n if i != j:\r\n if mn[i] <= mn[j]:\r\n p[j]= 'NO'\r\n break\r\n\r\nfor i in range(n):\r\n print(p[i])\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = []\r\nfor i in range(n):\r\n w = list(map(int, input().split()))\r\n d.append(set(w[1:]))\r\ne = [1]*n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n x = d[i] & d[j]\r\n if x == d[i]:\r\n e[j] = 0\r\n if x == d[j]:\r\n e[i] = 0\r\nfor i in e:\r\n if i == 0:\r\n print('NO')\r\n else:\r\n print('YES')", "n = int(input())\r\na = [set(list(map(int,input().split()))[1:])for _ in range(n)]\r\nres = 0\r\nprint(*['YES'if sum(i.issubset(j)for i in a) == 1 else 'NO' for j in a],sep = '\\n')\r\n", "def main():\n n = int(input())\n a = [set(map(int, input().split()[1:])) for _ in range(n)]\n\n res = [True] * n\n for i in range(n - 1):\n for j in range(i + 1, n):\n if a[i].issubset(a[j]):\n res[j] = False\n if a[i].issuperset(a[j]):\n res[i] = False\n print('\\n'.join('YES' if i else 'NO' for i in res))\n\n\nif __name__ == '__main__':\n main()\n\n", "n = int(input())\r\na = []\r\nfor x in range(n):\r\n m1 = input()\r\n m = m1.split(' ')\r\n b = []\r\n c = 0\r\n for y in m:\r\n if(c!=0):\r\n b.append(int(y))\r\n c = c+1\r\n a.append(b)\r\n#print(a)\r\nfor z in range(n):\r\n lis1 = a[z]\r\n #print(\"list considered is :\")\r\n #print(lis1)\r\n flag = 3\r\n count = 0\r\n for m in a:\r\n if(z != count):\r\n if(set(m).issubset(set(lis1))):\r\n flag = 2\r\n #break\r\n count = count+1\r\n if(flag==2):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\") \r\n \r\n", "\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\ndef ai(): return list(map(int,input().split()))\r\ndef ei(): return map(int,input().split())\r\ndef ip(): return int(stdin.readline())\r\ndef op(ans): return stdout.write(str(ans) + '\\n') \r\n\r\n\r\nn = ip()\r\na = []\r\nfor i in range(n):\r\n\ta.append(set(ai()[1:]))\r\n\r\nfor i in range(n):\r\n\tflag = 0\r\n\tfor j in range(n):\r\n\t\tif i == j :\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif a[j].issubset(a[i]):\r\n\t\t\t\tflag = 1\r\n\t\t\t\tbreak\r\n\tprint('YES' if not flag else 'NO')\r\n\r\n\r\n\r\n", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, = readln()\nlst = [set(readln()[1:]) for _ in range(n)]\nfor a in lst:\n print(\"YES\" if len([1 for b in lst if len(a.union(b)) == len(a)]) == 1 else \"NO\")\n", "n = int(input())\r\np = list()\r\nfor i in range(n):\r\n\tp.append(set([int(x) for x in input().split()[1:]]))\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i != j:\r\n\t\t\tif p[i].issuperset(p[j]):\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\tbreak\r\n\telse:\r\n\t\tprint(\"YES\")\r\n\r\n", "p = [set(list(map(int, input().split()))[1:]) for i in range(int(input()))]\r\nfor i, s in enumerate(p):\r\n print('YES' if all(i == i2 or not s2 <= s for i2, s2 in enumerate(p)) else 'NO')", "n = int(input())\r\nc = [[int(s) for s in input().split()][1:] for x in range (n)]\r\n\r\nfor i in range (n):\r\n for j in range (n):\r\n if i != j:\r\n for k in c[j]:\r\n if k not in c[i]:\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n", "# -*- coding: utf-8 -*-\r\n\r\nn = int(input())\r\ncards = [[set(map(int, input().split()[1:])), i, True] for i in range(n)]\r\n\r\ncards.sort(key=lambda x: len(x[0]))\r\nfor i in range(n-1, -1, -1):\r\n if not cards[i][2]:\r\n continue\r\n for j in range(0, i):\r\n if cards[j][0] == cards[i][0]:\r\n cards[j][2] = cards[i][2] = False\r\n break\r\n if cards[j][0] < cards[i][0]:\r\n cards[i][2] = False\r\n break\r\n\r\ncards.sort(key=lambda x: x[1])\r\nfor card in cards:\r\n print('YES' if card[2] else 'NO')\r\n ", "n=int(input())\n\nL=[]\nfor i in range(n):\n m=list(map(int,input().split()))\n m=m[1:]\n L.append(sorted(m))\n\nAns=[\"YES\"]*n\n\nfor i in range(n):\n for j in range(n):\n if(i==j):\n continue\n ind=-1\n for x in range(len(L[j])):\n if(L[j][x]==L[i][0]):\n ind=x\n break\n if(ind==-1):\n continue\n e=0\n for x in range(ind,len(L[j])):\n if(L[j][x]==L[i][e]):\n e+=1\n if(e==len(L[i])):\n break\n if(e==len(L[i])):\n Ans[j]=\"NO\"\nfor i in range(n):\n print(Ans[i])\n \n", "a=int(input());l=[list(map(int,input().split()[1:])) for _ in \" \"*a]\r\nfor i in range(a):\r\n for j in range(a):\r\n if i!=j and all(k in l[i] for k in l[j] ):print(\"NO\");break\r\n else:print(\"YES\")", "def process(A):\r\n n = len(A)\r\n for i in range(n):\r\n player1 = A[i][1:]\r\n works = True\r\n for j in range(n):\r\n if i != j:\r\n player2 = A[j][1:]\r\n intersect = [x for x in player1 if x in player2]\r\n if len(intersect)==len(player2):\r\n works = False\r\n if works:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nn = int(input())\r\nA = []\r\nfor i in range(n):\r\n row = [int(x) for x in input().split()]\r\n A.append(row)\r\nprocess(A)", "def subset(s1,s2):\r\n\td={}\r\n\tfor i in s1:\r\n\t\td[i]=1\r\n\tflag=0\r\n\tfor i in s2:\r\n\t\tif i not in d:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\tif flag==0:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n \r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split()))[1:])\r\nfor i in range(n):\r\n\tans='YES'\r\n\tfor j in range(n):\r\n\t\tif i!=j:\r\n\t\t\tif subset(l[i],l[j]):\r\n\t\t\t\tans=\"NO\"\r\n\t\t\t\tbreak\r\n\tprint (ans)", "def contiene(l, s, n, m):\t\n\tj=0\n\tfor i in range(n):\n\t\tx = l[i]\n\t\twhile j<m and not l[i]==s[j]:\n\t\t\tj+=1\n\t\t\n\t\tif j==m and not i==n:\n\t\t\treturn False\n\t\n\treturn True\n\t\t\n\t\nif __name__=='__main__':\t\n\tn = int(input())\n\tl = []\n\tm = []\n\tfor i in range(n):\n\t\ts = [int(x) for x in input().split()]\n\t\tm.append( s[0] )\n\t\tl.append( s[1:] )\n\t\tl[i].sort()\n\n\tfor i in range(n):\n\t\tcanWin = True\n\t\tfor j in range(n):\n\t\t\tif not j==i:\n\t\t\t\tif m[i]<m[j]:\n\t\t\t\t\tcontinue\n\t\t\t\tif contiene( l[j], l[i], m[j], m[i] ):\n\t\t\t\t\tcanWin = False\n\t\t\t\t\tbreak\n\t\t\n\t\tif canWin:\n\t\t\tprint('YES')\n\t\telse:\n\t\t\tprint('NO')\n\t\t\t\n\t\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "a = [sorted(list(map(int, input().split()))[1:]) for _ in range(int(input()))]\r\nfor i in range(len(a)):\r\n if any([all([elem in a[i] for elem in elema])for elema in a[:i] + a[i + 1:]]):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "# The main function that will do all of the processing\r\ndef solve():\r\n # total number of players\r\n n = int(input().strip())\r\n\r\n # list of sets where each index i corresponds to a player and the value is the set of numbers that player i has\r\n nums = []\r\n # populate the nums\r\n for i in range(n):\r\n a = list(map(int, input().strip().split()))\r\n nums.append(set(a[1:]))\r\n\r\n # the list of results for each player\r\n res = []\r\n # iterate through all players i = 1 to n\r\n # check if no player j= 1 to n has a subset of numbers which the player i has\r\n # if such a subset exists then add NO in the result for player i otherwise add YES\r\n for i in range(n):\r\n no = False\r\n for j in range(n):\r\n if i != j and nums[i].issuperset(nums[j]):\r\n no = True\r\n break\r\n if no:\r\n res.append(\"NO\")\r\n else:\r\n res.append(\"YES\")\r\n\r\n # print the results for all of the players\r\n for r in res:\r\n print(r)\r\n\r\n\r\nsolve()\r\n", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nt=ii()\r\nl=[]\r\nfor i in range(t):\r\n x,*y=f()\r\n l.append(set(y))\r\nfor i in range(t):\r\n fg=0\r\n for j in range(t):\r\n if i!=j and len(l[i])>=len(l[j]):\r\n if all(x in l[i] for x in l[j]):\r\n fg=1\r\n print('YNEOS'[fg==1::2])\r\n\r\n" ]

[ "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\na, b, c, d, n = map(int, input().split())\r\nparty = list(map(int, input().split()))\r\nisland = [['.'] * (a + c) for _ in range(max(b, d))]\r\n\r\ni, j, ub, lb = (b - 1 if a % 2 else 0), 0, 0, b\r\ndelta = (-1 if a % 2 else 1)\r\npi = 0\r\n\r\nwhile pi < n:\r\n island[i][j] = chr(97 + pi)\r\n party[pi] -= 1\r\n if party[pi] == 0:\r\n pi += 1\r\n\r\n if not (ub <= i + delta < lb):\r\n j += 1\r\n if j == a:\r\n lb = d\r\n delta *= -1\r\n else:\r\n i += delta\r\nprint('YES')\r\nfor row in island:\r\n print(*row, sep='')\r\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,4)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A:\r\n print(*ele,end=\"\\n\")\r\n# def seive():\r\n# prime=[1 for i in range(10**6+1)]\r\n# prime[0]=0\r\n# prime[1]=0\r\n# for i in range(10**6+1):\r\n# if(prime[i]):\r\n# for j in range(2*i,10**6+1,i):\r\n# prime[j]=0\r\n# return prime\r\n\r\n\r\na, b, c, d, n = L()\r\narr= L()\r\nprint('YES')\r\ncur_i = i = 0\r\ngrid = [['.' for i in range(a + c)] for j in range(max(b, d))]\r\nif (min(b, d) ^ (d < b)) & 1:\r\n cur_j, cur_d = 0, 1\r\nelse:\r\n cur_j, cur_d = a + c - 1, -1\r\nwhile i < n:\r\n # print(grid)\r\n grid[cur_i][cur_j] = chr(97 + i)\r\n cur_j += cur_d\r\n if cur_i >= b and cur_j < a or cur_i >= d and cur_j >= a or cur_j < 0 or cur_j >= a + c:\r\n cur_i += 1\r\n cur_j -= cur_d\r\n cur_d = -cur_d\r\n arr[i] -= 1\r\n if not arr[i]:\r\n i += 1\r\nfor i in grid:\r\n print(''.join(i))\r\n\r\n\r\n\r\n\r\nendtime = time.time()\r\n# print(f\"Runtime of the program is {endtime - starttime}\")\r\n", "def solve(x0, y0, dx, X):\r\n for i, x in enumerate(X):\r\n while x > 0:\r\n x-=1\r\n m[y0][x0] = i\r\n x0 += dx\r\n if x == 0 and i == len(X)-1:\r\n break\r\n \r\n if x0 == -1:\r\n y0 += 1\r\n x0 = 0\r\n dx *= -1\r\n \r\n if m[y0][x0] == -1:\r\n return False\r\n \r\n elif x0 == a+c:\r\n y0 += 1\r\n x0 = a+c-1\r\n dx *=-1\r\n \r\n if m[y0][x0] == -1:\r\n return False\r\n \r\n elif m[y0][x0] == -1:\r\n y0 +=1\r\n x0 -=dx\r\n dx *=-1\r\n return True \r\n \r\na, b, c, d, n = map(int, input().split())\r\nX = list(map(int, input().split()))\r\n \r\nm = [[0] * (a+c) for _ in range(max(b, d))]\r\nif b < d:\r\n for i in range(b, d):\r\n for j in range(a):\r\n m[i][j] = -1\r\nelse:\r\n for i in range(d, b):\r\n for j in range(a, a+c):\r\n m[i][j] = -1\r\n \r\nif solve(a+c-1, 0, -1, X) == False:\r\n solve(0, 0, 1, X)\r\n \r\nprint('YES') \r\nfor x in m:\r\n print(''.join([chr(c+97) if c>=0 else '.' for c in x]))" ]

[ "import sys\r\nfrom sys import stdin\r\nfrom collections import deque\r\n\r\nn,m = map(int,stdin.readline().split())\r\n\r\ns = []\r\n\r\nans1 = 0\r\n\r\nfor i in range(n):\r\n\r\n lis = list(map(int,stdin.readline().split()))[1:]\r\n s.append(lis)\r\n ans1 = max(ans1 , len(lis))\r\n\r\n\r\nlis = [ [] for i in range(n) ]\r\nfor i in range(n-1):\r\n u,v = map(int,stdin.readline().split())\r\n u -= 1\r\n v -= 1\r\n lis[u].append(v)\r\n lis[v].append(u)\r\nvisit = [False] * n\r\nq = deque([0]) ; visit[0] = True\r\nvisit_lis = []\r\n\r\n#print (lis)\r\nwhile q:\r\n v = q.popleft()\r\n visit_lis.append(v)\r\n for nex in lis[v]:\r\n if visit[nex] == False:\r\n visit[nex] = True\r\n q.append(nex)\r\n\r\n#print (visit_lis)\r\n\r\nans = [None] * (m+1)\r\n\r\nfor i in visit_lis:\r\n\r\n ice_set = s[i]\r\n used_colors = set()\r\n\r\n for ice in ice_set:\r\n if ans[ice] != None:\r\n used_colors.add(ans[ice])\r\n\r\n useable = 1\r\n for ice in ice_set:\r\n if ans[ice] == None:\r\n\r\n while useable in used_colors:\r\n useable += 1\r\n ans[ice] = useable\r\n used_colors.add(useable)\r\n\r\nfor i in range(len(ans)):\r\n if ans[i] == None:\r\n ans[i] = 1\r\n\r\nprint (max(ans))\r\nprint (\" \".join(map(str,ans[1:])))" ]

[ "#FB HACKERCUP\r\nimport os,sys,math\r\nfrom io import BytesIO, IOBase\r\n\r\nif sys.version_info[0] < 3:\r\n from _builtin_ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\nfrom bisect import bisect_left as lower_bound, bisect_right as upper_bound \r\ndef so(): return int(input())\r\ndef st(): return input()\r\ndef mj(): return map(int,input().strip().split(\" \"))\r\ndef msj(): return map(str,input().strip().split(\" \"))\r\ndef le(): return list(map(int,input().split()))\r\ndef lebe():return list(map(int, input()))\r\n\r\n# def dmain():\r\n# sys.setrecursionlimit(1000000)\r\n# threading.stack_size(1024000)\r\n# thread = threading.Thread(target=main)\r\n# thread.start()\r\ndef joro(L):\r\n return(''.join(map(str, L)))\r\ndef cheems(c,d):\r\n a=1\r\n while(d!=0):\r\n if(d%2==1):\r\n a*=c\r\n c=c*c\r\n d=d//2\r\n return a\r\n\r\n \r\n\r\ndef decimalToBinary(n): return bin(n).replace(\"0b\",\"\")\r\n\r\n\r\ndef isprime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n# def npr(n, r):\r\n# return factorial(n) // factorial(n - r) if n >= r else 0\r\n \r\n \r\n# def ncr(n, r):\r\n# return factorial(n) // (factorial(r) * factorial(n - r)) if n >= r else 0\r\n \r\n \r\ndef lower_bound(li, num):\r\n answer = -1\r\n start = 0\r\n end = len(li) - 1\r\n \r\n while (start <= end):\r\n middle = (end + start) // 2\r\n if li[middle] >= num:\r\n answer = middle\r\n end = middle - 1\r\n else:\r\n start = middle + 1\r\n return answer # min index where x is not less than num\r\n \r\n \r\ndef upper_bound(li, num):\r\n answer = -1\r\n start = 0\r\n end = len(li) - 1\r\n \r\n while (start <= end):\r\n middle = (end + start) // 2\r\n \r\n if li[middle] <= num:\r\n answer = middle\r\n start = middle + 1\r\n \r\n else:\r\n end = middle - 1\r\n return answer # max index where x is not greater than num\r\ndef tir(a,b,c):\r\n if(0==c):\r\n return 1\r\n if(len(a)<=b):\r\n return 0\r\n \r\n if(c!=-1):\r\n return (tir(a,1+b,c+a[b]) or tir(a,b+1,c-a[b]) or tir(a,1+b,c)) \r\n \r\n \r\n else:\r\n return (tir(a,1+b,a[b]) or tir(a,b+1,-a[b]) or tir(a,1+b,-1))\r\n \r\n \r\ndef abs(x):\r\n return x if x >= 0 else -x\r\ndoi=int(1e9+7)\r\nboi=int(1e9-7)\r\nkoi=int(5+2e6)\r\nmoi=int(4e6+5+100)\r\ndef binary_search(li, val, lb, ub):\r\n # print(lb, ub, li)\r\n ans = -1\r\n while (lb <= ub):\r\n mid = (lb + ub) // 2\r\n # print('mid is',mid, li[mid])\r\n if li[mid] > val:\r\n ub = mid - 1\r\n elif val > li[mid]:\r\n lb = mid + 1\r\n else:\r\n ans = mid # return index\r\n break\r\n return ans\r\n \r\n \r\ndef kadane(x): # maximum sum contiguous subarray\r\n sum_so_far = 0\r\n current_sum = 0\r\n for i in x:\r\n current_sum += i\r\n if current_sum < 0:\r\n current_sum = 0\r\n else:\r\n sum_so_far = max(sum_so_far, current_sum)\r\n return sum_so_far\r\ndef wubu(m):\r\n import math as my\r\n d=0\r\n while(not m%2):\r\n m=m//2\r\n d=1+d\r\n for i in range(3,int(my.sqrt(m))+1,2):\r\n while(not m%i):\r\n m=m//i\r\n d=1+d\r\n return int(m>1)+d\r\n \r\ndef pref(li):\r\n pref_sum = [0]\r\n for i in li:\r\n pref_sum.append(pref_sum[-1] + i)\r\n return pref_sum\r\n \r\n \r\ndef SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n li = []\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n \r\n for p in range(2, len(prime)):\r\n if prime[p]:\r\n li.append(p)\r\n return li\r\n \r\n \r\ndef primefactors(n):\r\n import math as my\r\n factors = []\r\n while (n % 2 == 0):\r\n factors.append(2)\r\n n //= 2\r\n for i in range(3, int(my.sqrt(n)) + 1, 2): # only odd factors left\r\n while n % i == 0:\r\n factors.append(i)\r\n n //= i\r\n if n > 2: # incase of prime\r\n factors.append(n)\r\n return factors\r\n \r\n \r\ndef read():\r\n sys.stdin = open('input.txt', 'r') \r\n sys.stdout = open('output.txt', 'w') \r\ndef tr(n):\r\n return n*(n+1)//2\r\n\r\ndef bro(q,r,c):\r\n bec,pot,h=0,0,0\r\n ds=[]\r\n bs=[]\r\n es=[]\r\n for i in range(c):\r\n while(h<len(r) and r[h]<=q[i][0]):\r\n pot=0\r\n ds.clear()\r\n bs.clear()\r\n h=1+h\r\n for i in range(c):\r\n ds.append(q[i][1])\r\n es.append(q[i][1])\r\n ds=list(set(ds))\r\n \r\n for i in ds:\r\n bs.append(es.count(i))\r\n \r\n print(bs)\r\n for i in range(c):\r\n if(q[i][0]>r[h-1]):\r\n bec=bec+pot-bs[i]\r\n pot=1+pot\r\n \r\n \r\n return bec\r\n \r\n \r\n \r\n \r\n \r\n \r\ndef iu():\r\n import sys\r\n input = sys.stdin.readline\r\n import math as my\r\n import bisect as by\r\n m=so()\r\n bec=0\r\n A=[0]*moi\r\n B=[0]*moi\r\n C=[0]*moi\r\n D=[0]*moi\r\n E=[0]*moi\r\n F=[0]*moi\r\n for i in range(koi*2+1):\r\n A[i]=sys.maxsize\r\n B[i]=-sys.maxsize\r\n for i in range(1,m+1):\r\n p,q=mj()\r\n r=p+q+koi\r\n s=p-q\r\n A[r]=min(A[r],s)\r\n B[r]=max(B[r],s)\r\n for i in range(2):\r\n C[i]=A[i]\r\n D[i]=B[i]\r\n for i in range(2,1+2*koi):\r\n C[i]=min(C[i-2],A[i])\r\n D[i]=max(B[i],D[i-2])\r\n for i in range(2*koi-2,2*koi+1):\r\n E[i]=A[i]\r\n F[i]=B[i]\r\n for i in range(2*koi-2,-1,-1):\r\n E[i]=min(E[2+i],A[i])\r\n F[i]=max(B[i],F[2+i])\r\n for i in range(1,2*koi+1,1):\r\n se=min(D[i-1],F[1+i])-max(C[i-1],E[1+i])\r\n bec=max(0,se//2)+bec\r\n print(bec)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\ndef main():\r\n for i in range(1):\r\n iu()\r\n \r\n \r\n# region fastio\r\n# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregion\r\n\r\n \r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n #read()\r\n main()\r\n #dmain()\r\n\r\n# Comment Read()" ]

[ "import sys\r\n# sys.setrecursionlimit(10**9)\r\n# import random\r\n# from collections import Counter, defaultdict, deque\r\n# from functools import lru_cache, reduce\r\n# from itertools import accumulate,product\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\r\n# from bisect import bisect_left,bisect_right\r\n# from sortedcontainers import SortedList\r\n# input = sys.stdin.buffer.readline\r\n# import re\r\ninput = sys.stdin.readline\r\ndef mp():return list(map(int,input().split()))\r\ndef it():return int(input())\r\n# import math\r\n\r\nmod=10**9+7\r\n\r\nnxt=[0]\r\ndef buildNxt(p):\r\n x,now=1,0\r\n while x<len(p):\r\n if p[x]==p[now]:\r\n x,now=x+1,now+1\r\n nxt.append(now)\r\n elif now:\r\n now=nxt[now-1]\r\n else:\r\n nxt.append(0)\r\n x+=1\r\n\r\n# def getKmp():\r\n\r\n\r\ndef solve():\r\n n,m=mp()\r\n lr,ran=[],[]\r\n for i in range(n):\r\n l,r=mp()\r\n if i>0:ran.append((l-lr[-1][1],r-lr[-1][0],i))\r\n lr.append((l,r))\r\n bridge=mp()\r\n for i in range(m):\r\n bridge[i]=(bridge[i],i)\r\n bridge.sort()\r\n ran.sort()\r\n pq=[]\r\n ans=[0]*n\r\n j=0\r\n for length,i in bridge: # 枚举所有每个桥\r\n while j<n-1 and length>=ran[j][0]: # 放入每一个满足间隔条件的岛间距\r\n left,right,idx=ran[j]\r\n heappush(pq,(right,idx)) # 放入符合要求的间隔，按最大可接受长度从小到大排\r\n j+=1\r\n if pq and pq[0][0]<length:\r\n return print(\"No\")\r\n if not pq:\r\n continue\r\n _,idx=heappop(pq)\r\n ans[idx]=i+1\r\n if j<n-1:\r\n return print(\"No\")\r\n print(\"Yes\")\r\n print(\" \".join(map(str,ans[1:])))\r\n\r\n return\r\n\r\nif __name__ == '__main__':\r\n\r\n # t=it()\r\n # for _ in range(t):\r\n # solve()\r\n\r\n # n=it()\r\n # n,m,i=mp()\r\n # n,m=mp()\r\n solve()\r\n\r\n\r\n# class Solution:\r\n# def smallestSubarrays(self, nums: List[int]) -> List[int]:\r\n# ans=[]\r\n# ", "import sys\r\nfrom heapq import heapify, heappop, heappush\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n, m = list(map(int, input().split()))\r\n intervals = []\r\n for _ in range(n):\r\n l, r = list(map(int, input().split()))\r\n intervals.append([l, r])\r\n bridges = list(map(int, input().split()))\r\n # birdges要记录一下初始的序号\r\n bridges = [[v, i] for i, v in enumerate(bridges)]\r\n # n - 1个桥 连 相邻的区间\r\n lengths = [] # [minn, maxn]\r\n for i in range(1, n):\r\n l1, r1 = intervals[i - 1][0], intervals[i - 1][1]\r\n l2, r2 = intervals[i][0], intervals[i][1]\r\n minn = l2 - r1\r\n maxn = r2 - l1\r\n lengths.append([minn, maxn, i - 1])\r\n # 从m个桥中选n - 1个桥(不可重复选)，都可以分配到lengths中的某个区间中\r\n ans = [0] * (n - 1)\r\n # 双排序\r\n lengths.sort()\r\n bridges.sort()\r\n #print(lengths)\r\n #print(bridges)\r\n\r\n # 开始贪心, 遍历桥\r\n pq = []\r\n j = 0 # 目前遍历到第几个lengths\r\n for v, i in bridges:\r\n # minn比v小就放进来\r\n while j < n - 1 and lengths[j][0] <= v:\r\n # 只记录右端点和id\r\n heappush(pq, (lengths[j][1], lengths[j][2]))\r\n j += 1\r\n # 最贪心地找出一个最小的maxn右端点（通过堆）\r\n # 为什么要这样取？因为后面的bridge能达成最小的maxn可能是更小的\r\n if not pq:\r\n continue\r\n # 右端点比v还要小\r\n if pq[0][0] < v:\r\n return print('No')\r\n # 否则，拿掉最小maxn对应的二元组\r\n right, id = heappop(pq)\r\n ans[id] = i + 1\r\n\r\n # 不够数\r\n # j加一次，必定有一个新的答案\r\n if j < n - 1:\r\n return print('No')\r\n\r\n print('Yes')\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop\r\nfrom functools import reduce\r\n\r\ninput = sys.stdin.readline\r\nints = lambda: list(map(int, input().split()))\r\n\r\ndef printQry(a, b) -> None:\r\n sa = str(a)\r\n sb = str(b)\r\n print(f\"? {sa} {sb}\", flush = True)\r\n\r\ndef printAns(ans) -> None:\r\n s = str(ans)\r\n print(f\"! {s}\", flush = True)\r\n\r\ndef solve() -> None:\r\n n, m = map(int, input().split())\r\n islands = []\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n islands.append((l, r))\r\n arr = ints()\r\n \r\n dis = []\r\n for i in range(1, n):\r\n dis.append((islands[i][0] - islands[i-1][1], islands[i][1] - islands[i-1][0], i - 1))\r\n\r\n bridges = [(a, i + 1) for i, a in enumerate(arr)]\r\n\r\n dis.sort()\r\n bridges.sort()\r\n # print(dis)\r\n # print(bridges)\r\n ans = [0] * (n - 1)\r\n h = []\r\n j = 0\r\n for bridge in bridges:\r\n while j < n - 1 and dis[j][0] <= bridge[0]:\r\n heappush(h, (dis[j][1], dis[j][2]))\r\n j += 1\r\n \r\n if h:\r\n # p = heappop(h)\r\n p = h[0]\r\n # print(p)\r\n if p[0] < bridge[0]:\r\n break\r\n else:\r\n ans[p[1]] = bridge[1]\r\n heappop(h)\r\n \r\n if h or j < n - 1:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n print(*ans)\r\n \r\n\r\nt = 1\r\nfor _ in range(t):\r\n solve()" ]

[ "def prime_pi(n):\r\n if n <= 1:\r\n return 0\r\n elif n <= 3:\r\n return 2\r\n v = int(n ** 0.5) - 1\r\n while v ** 2 <= n:\r\n v += 1\r\n v -= 1\r\n smalls = [(i + 1) // 2 for i in range(v + 1)]\r\n s = (v + 1) // 2\r\n roughs = [2 * i + 1 for i in range(s)]\r\n larges = [(n // (2 * i + 1) + 1) // 2 for i in range(s)]\r\n skip = [False] * (v + 1)\r\n \r\n pc = 0\r\n for p in range(3, v + 1, 2):\r\n if skip[p]:\r\n continue\r\n q = p * p\r\n pc += 1\r\n if q * q > n:\r\n break\r\n skip[p] = True\r\n for i in range(q, v + 1, 2 * p):\r\n skip[i] = True\r\n ns = 0\r\n for k in range(s):\r\n i = roughs[k]\r\n if skip[i]:\r\n continue\r\n d = i * p\r\n if d <= v:\r\n x = larges[smalls[d] - pc]\r\n else:\r\n x = smalls[n // d]\r\n larges[ns] = larges[k] + pc - x\r\n roughs[ns] = i\r\n ns += 1\r\n s = ns\r\n i = v\r\n for j in range(v // p, p - 1, -1):\r\n c = smalls[j] - pc\r\n e = j * p\r\n while i >= e:\r\n smalls[i] -= c\r\n i -= 1\r\n ret = larges[0] + (s + 2 * (pc - 1)) * (s - 1) // 2 - sum(larges[1:s])\r\n \r\n for l in range(1, s):\r\n q = roughs[l]\r\n m = n // q\r\n e = smalls[m // q] - pc\r\n if e <= l:\r\n break\r\n t = 0\r\n for r in roughs[l + 1:e + 1]:\r\n t += smalls[m // r]\r\n ret += t - (e - l) * (pc + l - 1)\r\n return ret\r\n\r\n\r\nn=int(input())\r\nm=4*10**5\r\nseive=[1]*m\r\nseive[0],seive[1]=0,0\r\nprimes=[]\r\nfor p in range(2,m):\r\n if seive[p]:\r\n primes.append(p)\r\n for i in range(2*p,m,p):\r\n seive[i]=0\r\n\r\nans=0\r\ns=len(primes)\r\nnow=s-1\r\nfor i in range(s):\r\n p=primes[i]\r\n x=n//p\r\n res=prime_pi(x)\r\n ans+=max(0,res-i-1)\r\n\r\nfor p in primes:\r\n if p**3<=n:\r\n ans+=1\r\nprint(ans)", "import bisect\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef the_sieve_of_eratosthenes(n):\r\n s = [1] * (n + 1)\r\n x = []\r\n for i in range(2, n + 1):\r\n if s[i]:\r\n x.append(i)\r\n for j in range(i, n + 1, i):\r\n s[j] = 0\r\n return x\r\n\r\n# https://judge.yosupo.jp/submission/126093\r\ndef prime_pi(n):\r\n if n <= 1:\r\n return 0\r\n elif n <= 3:\r\n return n - 1\r\n v = int(n ** 0.5) - 1\r\n while v ** 2 <= n:\r\n v += 1\r\n v -= 1\r\n smalls = [(i + 1) // 2 for i in range(v + 1)]\r\n s = (v + 1) // 2\r\n roughs = [2 * i + 1 for i in range(s)]\r\n larges = [(n // (2 * i + 1) + 1) // 2 for i in range(s)]\r\n skip = [False] * (v + 1)\r\n\r\n pc = 0\r\n for p in range(3, v + 1, 2):\r\n if skip[p]:\r\n continue\r\n q = p * p\r\n pc += 1\r\n if q * q > n:\r\n break\r\n skip[p] = True\r\n for i in range(q, v + 1, 2 * p):\r\n skip[i] = True\r\n ns = 0\r\n for k in range(s):\r\n i = roughs[k]\r\n if skip[i]:\r\n continue\r\n d = i * p\r\n if d <= v:\r\n x = larges[smalls[d] - pc]\r\n else:\r\n x = smalls[n // d]\r\n larges[ns] = larges[k] + pc - x\r\n roughs[ns] = i\r\n ns += 1\r\n s = ns\r\n i = v\r\n for j in range(v // p, p - 1, -1):\r\n c = smalls[j] - pc\r\n e = j * p\r\n while i >= e:\r\n smalls[i] -= c\r\n i -= 1\r\n ret = larges[0] + (s + 2 * (pc - 1)) * (s - 1) // 2 - sum(larges[1:s])\r\n\r\n for l in range(1, s):\r\n q = roughs[l]\r\n m = n // q\r\n e = smalls[m // q] - pc\r\n if e <= l:\r\n break\r\n t = 0\r\n for r in roughs[l + 1:e + 1]:\r\n t += smalls[m // r]\r\n ret += t - (e - l) * (pc + l - 1)\r\n return ret\r\n\r\nn = int(input())\r\ns = the_sieve_of_eratosthenes(5 * pow(10, 6) + 5)\r\nm = len(s)\r\nans = 0\r\nfor i in range(m):\r\n si = s[i]\r\n if si * si >= n:\r\n break\r\n if si * s[-1] < n:\r\n c = prime_pi(n // si)\r\n else:\r\n c = bisect.bisect_right(s, n // si)\r\n ans += max(c - i - 1, 0)\r\n if si * si * si <= n:\r\n ans += 1\r\nprint(ans)", "import os\r\nimport sys \r\nfrom io import BytesIO, IOBase\r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno() \r\n self.buffer = BytesIO() \r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break \r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0 \r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE)) \r\n self.newlines = b.count(b\"\\n\") + (not b) \r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1 \r\n return self.buffer.readline()\r\n \r\n def flush(self): \r\n if self.writable: \r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0) \r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush \r\n self.writable = self.buffer.writable \r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\") \r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\") \r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef prime_pi(n):\r\n if n <= 1:\r\n return 0\r\n elif n <= 3:\r\n return 2\r\n v = int(n ** 0.5) - 1\r\n while v ** 2 <= n:\r\n v += 1\r\n v -= 1\r\n smalls = [(i + 1) // 2 for i in range(v + 1)]\r\n s = (v + 1) // 2\r\n roughs = [2 * i + 1 for i in range(s)]\r\n larges = [(n // (2 * i + 1) + 1) // 2 for i in range(s)]\r\n skip = [False] * (v + 1)\r\n\r\n pc = 0\r\n for p in range(3, v + 1, 2):\r\n if skip[p]:\r\n continue\r\n q = p * p\r\n pc += 1\r\n if q * q > n:\r\n break\r\n skip[p] = True\r\n for i in range(q, v + 1, 2 * p):\r\n skip[i] = True\r\n ns = 0\r\n for k in range(s):\r\n i = roughs[k]\r\n if skip[i]:\r\n continue\r\n d = i * p\r\n if d <= v:\r\n x = larges[smalls[d] - pc]\r\n else:\r\n x = smalls[n // d]\r\n larges[ns] = larges[k] + pc - x\r\n roughs[ns] = i\r\n ns += 1\r\n s = ns\r\n i = v\r\n for j in range(v // p, p - 1, -1):\r\n c = smalls[j] - pc\r\n e = j * p\r\n while i >= e:\r\n smalls[i] -= c\r\n i -= 1\r\n ret = larges[0] + (s + 2 * (pc - 1)) * (s - 1) // 2 - sum(larges[1:s])\r\n\r\n for l in range(1, s):\r\n q = roughs[l]\r\n m = n // q\r\n e = smalls[m // q] - pc\r\n if e <= l:\r\n break\r\n t = 0\r\n for r in roughs[l + 1:e + 1]:\r\n t += smalls[m // r]\r\n ret += t - (e - l) * (pc + l - 1)\r\n return ret\r\n\r\ndef enumerate_primes(n):\r\n if n <= 1:\r\n return []\r\n A = [1, 7, 11, 13, 17, 19, 23, 29]\r\n thres = (n + 29) // 30\r\n sieve = [255] * (thres + int(n ** 0.5) + 10)\r\n ntoi = lambda i: (i >> 2) + (not (~i & 19))\r\n\r\n sieve[0] ^= 1\r\n i = 0\r\n flg = 1\r\n while flg:\r\n if sieve[i] != 0:\r\n for j in range(8):\r\n if sieve[i] >> j & 1:\r\n p = i * 30 + A[j]\r\n if (p * p > n):\r\n flg = 0\r\n continue\r\n q = [0] * 8\r\n r = [0] * 8\r\n s = 0\r\n for k in range(8):\r\n x = p * (i * 30 + A[k])\r\n q[k] = x // 30\r\n r[k] = ntoi(x - 30 * q[k])\r\n while q[0] + s < thres:\r\n sieve[q[0] + s] &= ~(1 << r[0])\r\n sieve[q[1] + s] &= ~(1 << r[1])\r\n sieve[q[2] + s] &= ~(1 << r[2])\r\n sieve[q[3] + s] &= ~(1 << r[3])\r\n sieve[q[4] + s] &= ~(1 << r[4])\r\n sieve[q[5] + s] &= ~(1 << r[5])\r\n sieve[q[6] + s] &= ~(1 << r[6])\r\n sieve[q[7] + s] &= ~(1 << r[7])\r\n s += p\r\n\r\n i += 1\r\n primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29]\r\n for i in range(1, thres):\r\n for j in range(8):\r\n if sieve[i] >> j & 1:\r\n primes.append(i * 30 + A[j])\r\n while primes[-1] > n:\r\n primes.pop()\r\n return primes\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n sq = int(n ** 0.5)\r\n while sq * sq < n:\r\n sq += 1\r\n while sq * sq > n:\r\n sq -= 1\r\n\r\n primes = enumerate_primes(sq)\r\n ans = 0\r\n for p in primes:\r\n if p ** 3 <= n:\r\n ans += 1\r\n else:\r\n break\r\n for i, p in enumerate(primes, 1):\r\n ans += prime_pi(n // p) - i\r\n print(ans)\r\n\r\nT = 1\r\n# T = int(input())\r\nfor t in range(1, T + 1):\r\n solve() \r\n \r\n\r\n \r\n" ]

[ "import dataclasses\r\nimport sys\r\n\r\n\r\ninf = float('inf')\r\n\r\n# change stdout buffer size\r\nbuffer = open(1, 'w', 10**6)\r\n\r\n\r\n# fast printing function\r\ndef print(*args, sep=' ', end='\\n'):\r\n buffer.write(sep.join(str(arg) for arg in args) + end)\r\n\r\n\r\n# flush stdout\r\ndef flush():\r\n buffer.flush()\r\n\r\n\r\ndef read_ints(index=None):\r\n if index is not None:\r\n return [(int(x), i + index) for i, x in enumerate(sys.stdin.readline().split())]\r\n return [int(x) for x in sys.stdin.readline().split()]\r\n\r\n\r\ndef go(i, j, t):\r\n pass\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n x = [0] * n\r\n y = [0] * n\r\n vs = set()\r\n for i in range(n):\r\n x[i], y[i] = read_ints()\r\n vs.add(x[i] - y[i])\r\n vs.add(x[i])\r\n vs.add(x[i] + y[i])\r\n\r\n v = list(vs)\r\n v.sort()\r\n nv = len(v)\r\n num = dict()\r\n\r\n for i in range(nv):\r\n num[v[i]] = i\r\n\r\n f = [0] * nv\r\n w = [[] for _ in range(nv)]\r\n\r\n for i in range(n):\r\n a = num[x[i] - y[i]]\r\n b = num[x[i]]\r\n c = num[x[i] + y[i]]\r\n f[b] = c\r\n w[a].append(b)\r\n\r\n dp = [[[0, 0] for _ in range(nv + 1)] for _ in range(nv + 1)]\r\n\r\n for i in range(nv - 1, -1, -1):\r\n for j in range(nv - 1, -1, -1):\r\n for t in range(2):\r\n if j < i:\r\n dp[i][j][t] = dp[i][i][0]\r\n continue\r\n cur = dp[i + 1][j][t]\r\n if (t == 0 or j > i) and f[i] > j:\r\n cur = max(cur, dp[j + 1 if t else i + 1][f[i]][0] + v[f[i]] - v[j])\r\n for k in w[i]:\r\n if k > j:\r\n cur = max(cur, dp[j + 1 if t else i + 1][k][1] + v[k] - v[j])\r\n dp[i][j][t] = cur\r\n\r\n print(dp[0][0][0])\r\n flush()\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import dataclasses\r\nimport sys\r\n\r\n\r\ninf = float('inf')\r\n\r\n# change stdout buffer size\r\nbuffer = open(1, 'w', 10**6)\r\n\r\n\r\n# fast printing function\r\ndef print(*args, sep=' ', end='\\n'):\r\n buffer.write(sep.join(str(arg) for arg in args) + end)\r\n\r\n\r\n# flush stdout\r\ndef flush():\r\n buffer.flush()\r\n\r\n\r\ndef read_ints(index=None):\r\n if index is not None:\r\n return [(int(x), i + index) for i, x in enumerate(sys.stdin.readline().split())]\r\n return [int(x) for x in sys.stdin.readline().split()]\r\n\r\n\r\ndef solve(n, x, y):\r\n vs = set()\r\n for i in range(n):\r\n vs.add(x[i] - y[i])\r\n vs.add(x[i])\r\n vs.add(x[i] + y[i])\r\n\r\n v = list(vs)\r\n v.sort()\r\n nv = len(v)\r\n ind = dict()\r\n\r\n for i in range(nv):\r\n ind[v[i]] = i\r\n\r\n forward = [0] * nv\r\n backward = [[] for _ in range(nv)]\r\n\r\n for i in range(n):\r\n a = ind[x[i] - y[i]]\r\n b = ind[x[i]]\r\n c = ind[x[i] + y[i]]\r\n forward[b] = c\r\n backward[a].append(b)\r\n\r\n dp = [[[0, 0] for _ in range(nv)] for _ in range(nv)]\r\n\r\n for i in range(nv - 2, -1, -1):\r\n for j in range(nv - 2, i - 1, -1):\r\n for t in range(2):\r\n if i + 1 > j:\r\n cur = dp[i+1][i+1][0]\r\n else:\r\n cur = dp[i + 1][j][t]\r\n if (t == 0 or j > i) and forward[i] > j:\r\n cur = max(cur, dp[j + 1 if t else i + 1][forward[i]][0] + v[forward[i]] - v[j])\r\n for k in backward[i]:\r\n if k > j:\r\n cur = max(cur, dp[j + 1 if t else i + 1][k][1] + v[k] - v[j])\r\n dp[i][j][t] = cur\r\n\r\n print(dp[0][0][0])\r\n flush()\r\n\r\n\r\ndef read():\r\n n = int(input())\r\n x = [0] * n\r\n y = [0] * n\r\n for i in range(n):\r\n x[i], y[i] = read_ints()\r\n return n, x, y\r\n\r\n\r\nif __name__ == '__main__':\r\n n, x, y = read()\r\n solve(n, x, y)\r\n" ]

[ "s = input().split()\r\nans = 0\r\npos = 0\r\nfor i in s:\r\n ans += int(i) * pos\r\n pos += 1; \r\nprint(ans)", "a = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(len(a)):\r\n s += a[i] * i\r\nprint(s)\r\n", "\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n | /\\ | | \\ | | / | | | | |\\ /|\r\n | / \\ | | \\ | | / | | | | | \\ / |\r\n |___ /____\\ | | \\ | |/ |___| | | | \\/ |\r\n | / \\ | | / | |\\ |\\ | | | |\r\n | / \\ | | / | | \\ | \\ | | | |\r\n ___|/ \\___|___ |___/ ___|___ | \\ | \\ |___| | |\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\n\r\na1= list(map(int,input().split()))\r\na = 0\r\nfor i in range(len(a1)):\r\n a += i * a1[i]\r\nprint(a)\r\n\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\n\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n | /\\ | | \\ | | / | | | | |\\ /|\r\n | / \\ | | \\ | | / | | | | | \\ / |\r\n |___ /____\\ | | \\ | |/ |___| | | | \\/ |\r\n | / \\ | | / | |\\ |\\ | | | |\r\n | / \\ | | / | | \\ | \\ | | | |\r\n ___|/ \\___|___ |___/ ___|___ | \\ | \\ |___| | |\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n", "\r\n\r\ninp = list(map(int,input().split()))[::-1]\r\n\r\ncarrots = 2\r\ncalories = 0\r\nchoc = 100\r\nflour = 1\r\negg = 1\r\n\r\nbowl = []\r\nbowl.append(calories)\r\ncarrots = inp.pop()\r\n\r\nwhile carrots:\r\n choc = inp.pop()\r\n choc*=flour\r\n calories+=choc\r\n flour+=1\r\n carrots-=1\r\n \r\nprint(calories)\r\n \r\n \r\n\r\n", "v, cnt = [int(i) for i in input().split()], 0\nfor i in range(1, len(v)):\n cnt += i * v[i]\nprint(cnt)\n \t\t\t\t \t\t\t \t \t \t \t\t \t \t", "# /**\r\n# * author: brownfox2k6\r\n# * created: 23/05/2023 20:41:01 Hanoi, Vietnam\r\n# **/\r\n\r\nprint(sum(i*j for i,j in enumerate(map(int, input().split()), 0)))", "ai=[*map(int,input().split())]\r\nsumi=sum(i*ai[i] for i in range(len(ai)))\r\nprint(sumi)", "a=list(map(int,input().split()))\nprint(sum([a[i]*i for i in range(len(a))]))\n", "# Rating: 2000, https://codeforces.com/contest/171/problem/C\n\nnums = [int(x) for x in input().strip().split()]\nsum = 0\n\nfor i in range(len(nums)):\n sum += nums[i]*i\n\nprint(sum)", "cases=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(1,len(cases)):\r\n\tcnt+=i*cases[i]\r\nprint(cnt)\r\n", "a = map(int, input().split())\r\nj = 0\r\nsum = 0\r\nfor i in a:\r\n sum += i * j\r\n j += 1\r\nprint(sum)", "a = input().split()\r\na = a[1:]\r\nc = 1\r\nk = 0\r\nfor i in a:\r\n k += int(i)*c\r\n c += 1\r\nprint(k)\r\n \r\n", "arr = list(map(int,input().split()))\r\nans =0 \r\nfor i in range(1,len(arr)):\r\n ans+=i*arr[i]\r\nprint(ans)", "n, *a = input().split()\r\nprint(sum(i * int(a[i - 1]) for i in range(1, int(n) + 1)))", "a = list(map(int, input().split()))\nans = 0 \nfor i in range(1, len(a)) :\n ans += i*a[i] \nprint(ans)\n \t\t \t \t\t\t\t \t \t \t\t \t \t", "l=list(map(int,input().split()))\r\nans=0\r\nfor i in range(len(l)):\r\n ans+=l[i]*i\r\nprint(ans)", "p= input ().split()\r\nt=0\r\n \r\nfor i in range (1,int (p [0])+1):\r\n\tt+=i*eval (p[i])\r\n \r\nprint (t)", "a=input().split()\ns=0\nfor i in range(1,int(a[0])+1):\n\ts+=i*eval(a[i])\nprint(s)\n \t \t \t \t \t \t\t\t\t\t\t \t", "a=input().split()\r\ns=0\r\nfor i in range(1,int(a[0])+1):\r\n\ts+=i*eval(a[i])\r\nprint(s)", "inp = []\r\ninp = input().split()\r\ninp = [int(i) for i in inp]\r\n\r\ncarrots = 2\r\ncalories = 0\r\nchoco = 100 \r\nflour = 1\r\negg = 1\r\n\r\nbowl = []\r\ndish = []\r\n\r\nbowl.append(calories) # 1\r\ncarrots = inp[0] # 2\r\nfor i in range(1, carrots + 1): # 3\r\n choco = inp[i] # 4\r\n bowl.append(choco) # 5\r\n bowl[-1] *= flour # 6\r\n choco = bowl.pop() # 7\r\n bowl[-1] += choco # 8\r\n bowl.append(flour) # 9\r\n bowl[-1] += egg # 10\r\n flour = bowl.pop() # 11\r\n # 12\r\ndish.extend(bowl) # 13\r\nprint(dish[0]) # Serves 1", "a = input().split()\r\ns = 0\r\nfor i in range(int(a[0])):\r\n s += (i + 1) * int(a[i + 1])\r\nprint(s)\r\n", "a=input().split()\nans=0\nfor i in range(int(a[0])):\n ans+=(i+1)*(int(a[i+1]))\nprint(ans)", "a = [int(x) for x in input().split()]\r\nsum = 0\r\nfor i in range (1, a[0] + 1) : sum += i * a[i]\r\nprint(sum)", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(len(a)):\r\n ans+=i*a[i]\r\nprint(str(ans)+\"\\n\")\r\n", "\nimport os\nimport io\ninput = io.BytesIO(os.read(0, 9999999)).readline\n#Fast input\n\n\nnums = list(map(int, input().split()))\ntot = 0\nfor i in range(len(nums)):\n tot += nums[i]*i\nprint(tot)", "a=list(map(int,input().split()))\r\nans=0\r\nfor num in range(0,len(a)):\r\n ans=ans+a[num]*num\r\nprint(ans)", "a=list(map(int,input().split()))\r\nt=0\r\nfor i in range(len(a)):\r\n t+=i*a[i]\r\nprint(t)", "lst = [int(i) for i in input().split()]\r\nresult = 0\r\nfor i in range(lst[0]):\r\n result += (i + 1) * lst[i + 1]\r\nprint(result)\r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-29 23:34:16\nLastEditTime: 2021-11-29 23:36:05\nDescription: A Piece of Cake\nFilePath: CF171C.py\n'''\n\n\ndef func():\n n, *lst = map(int, input().strip().split())\n count = 0\n for i in range(n):\n count += lst[i] * (i + 1)\n print(count)\n\n\nif __name__ == '__main__':\n func()\n", "lst1 = [int(item) for item in input().split()]\r\ncount = 0\r\nfor i in range(len(lst1)):\r\n count+=i*lst1[i]\r\nprint(count)", "l1=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(l1)):\r\n\ts+=(l1[i]*i)\r\nprint(s)", "p= input ().split()\n#pieee\nt=0\n\nfor i in range (1,int (p [0])+1):\n\tt+=i*eval (p[i])\n\nprint (t)\n \t \t\t \t \t\t \t \t\t\t\t\t\t \t\t\t \t", "from functools import reduce\nn = list(map(int,input().split()))\nans = 0\nfor i in range(len(n)):\n ans += (i*n[i])\nprint(ans)\n", "list1 = [int(h) for h in input().split()]\r\nflag = 1\r\nsumm1 = 0\r\nsumm2 = 0\r\nfor i in range(1, len(list1)-1):\r\n summ1 += list1[i] * flag\r\n flag += 1\r\nsumm2 = summ1 + list1[0] * list1[len(list1)-1]\r\nprint(summ2)" ]

[ "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nlst=[0]*(n+1)\r\nfor i in a:\r\n lst[i]+=1\r\nres=max(lst)\r\nfor i in range(1,n+1):\r\n if lst[i]<res:\r\n res=lst[i]\r\nprint(res)", "first_input = [int(x) for x in input().split()]\nn = first_input[0]\nm = first_input[1]\n\nsecond_input = [int(x) for x in input().split()]\n\nlist = []\nfor i in range(n):\n list.append(0)\nfor j in second_input:\n list[j-1] += 1\nprint(min(list))\n \t\t \t \t \t\t\t\t \t \t \t\t \t\t", "n,m = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\n\r\nplatform = [0 for i in range(n)]\r\n\r\n\r\nfor i in range(len(c)):\r\n platform[c[i]-1] += 1\r\n \r\nprint(min(platform))", "vetor = input()\nn = int(vetor.split()[0])\nm = int(vetor.split()[1])\nlinha = [0]*n\ncolumnSquaredInput = input()\ncolumnSquared = [0]*m\npontos = 0\naux = 0\n\nfor i in range(m):\n columnSquared[i] = int(columnSquaredInput.split()[i])\n\nfor i in range(m): # checando todas os inputs\n\n linha[columnSquared[i]-1] += 1 # adiciona o quadrado no valor da lista\n\n for j in linha: # checando se fez ponto\n if j == 0:\n break\n aux += 1\n if aux == n:\n pontos += 1\n for k in range(n):\n linha[k] = linha[k]-1\n aux = 0\n\nprint(pontos)\n\t\t \t\t \t\t \t \t \t\t \t \t \t \t", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nw = []\r\nfor i in range(n):\r\n w.append(l.count(i + 1))\r\nw.sort()\r\nprint(w[0])", "\na = input().split()\narr = input().split()\narr = list(map(int, arr))\nscore = 0\nflag = True\nwhile (flag):\n for i in range(1, int(a[0])+1):\n try:\n index = arr.index(i)\n except ValueError:\n index = -1\n if (index == -1):\n flag = False\n break\n else:\n arr.pop(index)\n \n score += 1\nif (score !=0):\n print(score - 1)\nelse:\n print(score)", "n, m = map(int, input().split())\r\ncolumn = [0] * n\r\nfor i in [*map(int, input().split())]: column[i - 1] += 1\r\nprint(min(column))\r\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nvals = [0] * n\r\nx = list(map(int, input().split()))\r\nfor i in x: vals[i - 1] += 1\r\nprint(min(vals))\r\n", "l1 = [int(x) for x in input().split()]\r\nn,d = l1[0],l1[1]\r\nr = [0]*n\r\nl2 = [int(x) for x in input().split()]\r\ndef product(l1):\r\n for x in l1:\r\n if x==0:\r\n return 0\r\n return 1\r\npoints=0\r\nfor x in l2:\r\n r[x-1]+=1\r\n if product(r)!=0:\r\n r=[y-1 for y in r]\r\n points+=1\r\nprint(points)\r\n", "n, square_quantity = (int(x) for x in input().split())\r\nsquares = [int(x) for x in input().split()]\r\ni = 1\r\nmin_count = square_quantity\r\nwhile i < n + 1:\r\n\tif squares.count(i) < min_count:\r\n\t\tmin_count = squares.count(i)\r\n\ti += 1\r\nprint(min_count)", "n,m = map(int,input().split() )\r\nl = list(map(int,input().split()))\r\narr = [0]*n\r\nfor x in l:\r\n arr[x-1] += 1\r\n \r\nprint(min(arr))", "if __name__==\"__main__\":\r\n dic={}\r\n n,m=map(int,input().split())\r\n li=list(map(int,input().split()))\r\n c=0\r\n for i in range(n):\r\n dic.setdefault(i+1,0)\r\n for i in li:\r\n if 0 not in dic.values():\r\n c=c+1\r\n for j in range(1,n+1):\r\n dic[j]=dic[j]-1\r\n\r\n dic[i]=dic[i]+1\r\n if 0 not in dic.values():\r\n c=c+1\r\n print(c)\r\n", "R=lambda:map(int,input().split())\r\nn,m=R()\r\na=[0]*n\r\nfor c in R():a[c-1]+=1\r\nprint(min(a))", "from collections import Counter\n\nn, m = (int(i) for i in input().split())\na = Counter(int(i) for i in input().split())\nres = min(a.get(i, 0) for i in range(1, n + 1))\nprint(res)\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(1,n+1):\r\n\tc.append(a.count(i))\r\n\r\nprint(min(c))", "from collections import defaultdict as dd\r\ntcs = 1\r\nfor tc in range(tcs):\r\n n, k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n hp = dd(lambda:0)\r\n flag = True\r\n for x in arr:\r\n hp[x] += 1 \r\n for i in range(1, n + 1):\r\n if not hp[i]:\r\n flag = False\r\n y = min(hp.values())\r\n print(y if y and flag else 0)", "def tetris():\n n, m = input().split()\n n = int(n)\n squares = list(map(int, input().split()))\n mat = [0]*n\n for s in squares:\n mat[s-1]+=1\n print(min(mat))\n\ntetris()\n\n\n \t\t \t \t\t \t\t\t\t \t \t \t\t \t", "a=[]\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor x in range(1,n+1):\r\n\ta.append(l.count(x))\r\nprint(min(a))", "def solve(n, m, c):\n b = [0]*n\n for i in c: \n b[i-1] += 1\n return min(b)\n\n\ndef main():\n n, m = list(map(int, input().split()))\n c = list(map(int, input().split()))\n print(solve(n, m, c))\n\n\nmain()\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\ndef filled(l:list, n:int):\r\n res = []\r\n for x in l:\r\n if x >= n:\r\n res.append(True)\r\n else:\r\n res.append(False)\r\n return all(res)\r\n\r\ndef main():\r\n n, m = IA()\r\n a = IA()\r\n d = defaultdict(int)\r\n c = 0 \r\n line = 1 \r\n for n in range(1, n+1):\r\n d[n]\r\n for n in a:\r\n d[n]+=1\r\n if filled(d.values(), line):\r\n c+=1\r\n line+=1\r\n return c \r\n \r\nif __name__ == '__main__':\r\n print(main())", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nc = m\r\nfor i in range(1, n+1):\r\n if w.count(i) < c:\r\n c = w.count(i)\r\nprint(c)", "n,m = map(int,input().split())\nsquare = [int(i) for i in input().split()]\nans = 1e9\nfor i in range(1,n+1):\n ans = min(ans, square.count(i))\nprint(ans)\n \t \t \t\t \t\t \t \t \t\t \t\t", "def getNumbers(numCount, dicionario):\n numbers = [int(x) for x in input().split()]\n\n for number in numbers:\n dicionario[number] += 1\n\n numCount -= 1\n \n return dicionario\n\ndef setDict(length):\n dicionario = {}\n\n while(length > 0):\n dicionario[length] = 0\n length -= 1\n\n return dicionario\n\ndef getPontuation(dicionario):\n print(min(dicionario.values()))\n\ndef main():\n length, numbers = [int(x) for x in input().split()]\n dicionario = setDict(length)\n getNumbers(numbers, dicionario)\n getPontuation(dicionario)\n\n\nmain()\n \t \t\t\t\t\t\t \t \t \t \t \t \t\t", "from collections import Counter\r\ndef solve():\r\n n,m=map(int,input().split());aa=list(map(int,input().split()))\r\n s=Counter(aa)\r\n for i in range(1,n+1):\r\n if i not in s:print(0);return\r\n print(min(s.values()))\r\nsolve()", "from collections import Counter\r\nn, m = map(int, input(). split())\r\na = list(map(int, input(). split()))\r\nmn = m\r\np = Counter(a)\r\nfor i in range(1, n + 1):\r\n if i not in a:\r\n mn = 0\r\n break\r\n else:\r\n mn = min(p[i], mn)\r\nprint(mn)\r\n", "I=lambda:map(int,input().split())\r\nn,m=I()\r\nq={}\r\nfor i in range(1,n+1):q[i]=0\r\nfor i in I():q[i]+=1\r\nprint(min(q.values()))", "n, m = map(int, input().split())\n\narr = list(map(int, input().split()))\n\ncounterArr = [0 for _ in range(n)]\n\nfor i in arr:\n counterArr[i-1]+=1\n\nprint(min(counterArr))", "def entrada():\n entrada = input()\n ENTRADALIST = entrada.split(\" \")\n n = int(ENTRADALIST[0])\n m = int(ENTRADALIST[1])\n return n, m\n\ndef CreateBoard():\n BOARD = []\n for i in range(n):\n BOARD.append(0)\n return BOARD \n\n\ndef AddSquares(TAB):\n squares = input()\n SQUARELIST = squares.split(\" \")\n for i in SQUARELIST:\n key = int(i)\n TAB[key-1] = TAB[key-1] + 1 \n return TAB\n\n\ndef SquareScore(TAB):\n score = 0\n while min(TAB) > 0:\n score += 1\n for i in range(len(TAB)):\n TAB[i] = TAB[i] - 1\n \n else:\n return score\n\nn, m = entrada()\ntabuleiro = CreateBoard()\ntabuleiro = AddSquares(tabuleiro)\npontuacao = SquareScore(tabuleiro)\n\nprint(pontuacao)\n\n \t \t\t\t\t\t \t\t\t \t \t\t \t\t\t\t \t\t \t", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=[]\r\nfor i in range(1,n+1):\r\n\tx=l.count(i)\r\n\tp.append(x)\r\nprint(min(p))", "n,m=map(int,input().split())\r\nd=dict()\r\nfor i in range(1,n+1):\r\n d[i]=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n d[i]+=1\r\nl=list(d.values())\r\nprint(min(l))", "n, m = map(int, input().split())\nA = list(map(int, input().split()))\nmf = 10 ** 10\nfor i in range(1, n + 1):\n mf = min(mf, A.count(i))\nprint(mf)", "n, m = map(int, input().split())\nar = list(map(int, input().split()))\nr = m\nfor i in range(1, n + 1):\n r = min(r, ar.count(i))\nprint(r)", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nn, m = map(int,input().split())\r\nci = list(map(int,input().split()))\r\nai = [0] * (n+1)\r\nai[0] = 1001\r\nfor i in range(m):\r\n ai[ci[i]] += 1\r\nprint(min(ai))\r\n", "n,m = list(map(int,input().split()))\r\na = [0]*n\r\nfor i in list(map(int,input().split())):\r\n a[i-1] += 1\r\nprint(min(a))", "a = input().split()\ns = input().split()\nl = []\nm = 0\nfor i in range(int(a[0])):\n l.append(s.count(str(i+1)))\nprint(min(l))", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncnt = [0] * n\r\nfor x in a :\r\n\tcnt[x - 1] = cnt[x - 1] + 1\r\nprint(min(cnt))", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\ncnt = [c.count(i) for i in range(1,n+1)]\r\nprint(min(cnt))", "from collections import Counter\n\nn,t=[*map(int,input().split())]\nlist1=[*map(int,input().split())]\nset1=set(list1)\nif n==len(set1):\n print(Counter(list1).most_common()[-1][1])\nelse:\n print('0')\n", "# LUOGU_RID: 101739253\nfrom collections import Counter\r\nn, m, *a = map(int, open(0).read().split())\r\na = Counter(a)\r\nprint(min(a[i + 1] for i in range(n)))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(1,n+1):\r\n\ta.append(l.count(i))\r\nprint(min(a))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0 for x in range(n)]\r\nfor i in range(m):\r\n b[a[i] - 1] += 1\r\nprint(min(b))", "def main():\r\n n,m = map(int,input().split())\r\n liste = [int(x) for x in input().split()]\r\n mm = liste.count(n)\r\n score = liste.count(n)\r\n maxx = 0\r\n for loop in range(1,n+1):\r\n if liste.count(loop)<mm:\r\n if abs(liste.count(loop)-mm)>maxx:\r\n maxx = abs(liste.count(loop)-mm)\r\n if liste.count(loop)==0:\r\n return 0\r\n return score-maxx\r\nprint(main())", "n,m=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\ntemp=[]\r\nfor i in range(1,n+1):\r\n temp.append(list.count(i))\r\nprint(min(temp))", "# solution discussed in CS 5890 group\r\nn, m = map(int, input().split())\r\nblks = list(map(int, input().split()))\r\ncnt = [0] * n\r\nfor blk in blks:\r\n cnt[blk-1] +=1\r\n\r\ncntMin = m\r\nfor subTot in cnt:\r\n cntMin = min(cntMin, subTot)\r\nprint(cntMin)", "n, m = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\n\r\n\r\nminimum = 999999\r\n\r\n\r\nfor i in range(1,n+1):\r\n count = 0\r\n for j in a:\r\n if i == j:\r\n count+=1\r\n minimum = min(minimum, count)\r\n \r\n \r\nprint(minimum)", "n, m = map(int, input().split())\nvet = list(map(int, input().split()))\nflag = 1\nres = []\nfor i in range(0,n):\n res.append(vet.count(flag))\n flag+=1\nprint(min(res))\n \t \t\t \t \t\t\t \t \t\t \t \t \t\t\t", "entrada_inicial = input().split(\" \")\nn, m = int(entrada_inicial[0]), int(entrada_inicial[1])\nplataforma = [0] * int(n)\nquadrados = input().split(\" \")\n\nfor i in range(len(quadrados)):\n plataforma[int(quadrados[i]) - 1] += 1\n\npontos = 0\nflag = False\nwhile flag == False:\n for i in range(len(plataforma)):\n if plataforma[i] == 0:\n flag = True\n else:\n plataforma[i] -= 1\n if flag == False:\n pontos += 1 \n\nprint(pontos)\n \t\t\t \t\t \t\t \t \t\t\t\t \t\t\t", "n, m = map(int, input().split())\r\na = [0 for i in range(n)]\r\nli = list(map(int, input().split()))\r\nfor i in li:\r\n a[i - 1] += 1\r\na.sort()\r\nprint(a[0])\r\n", "a ,b = map(int,input().split())\nk = 0\nl = list(map(int,input().split()))\nl.sort()\na1 = []\nfor i in range(1,a+1):\n b = l.count(i)\n a1.append(b)\nprint(min(a1))\n ", "\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd={i+1:0 for i in range(n)}\r\nfor i in range(m):\r\n\td[a[i]]+=1\r\nprint(min(list(d.values())))", "def solve(n, m, c):\n b = [0]*n\n p = 0\n for i in c:\n b[i-1] += 1\n x = min(b)\n p += x\n for j in range(n):\n b[j] -= x\n return p\n\n\ndef main():\n n, m = list(map(int, input().split()))\n c = list(map(int, input().split()))\n print(solve(n, m, c))\n\n\nmain()\n", "# a,b,c,d,e = map(int, input().split())\n# sum=a+b+c+d+e\n# numj=0\n# if (a%2==1):\n# numj+=1\n# if (b % 2 == 1):\n# numj += 1\n# if (c % 2 == 1):\n# numj += 1\n# if (d % 2 == 1):\n# numj += 1\n# if (e % 2 == 1):\n# numj += 1\n# numo=5-numj\n# if (sum%5 == 0):\n# bb=int(sum/5)\n# if (bb%2==1):\n# if (numo==0 or numo==2 or numo==4):\n# print(bb)\n# else:\n# print(-1)\n# else:\n# if (numj == 0 or numj == 2 or numj == 4):\n# print(bb)\n# else:\n# print(-1)\n#\n# else:\n# print(-1)\n\nn,m = map(int, input().split())\na = list(map(int, input().strip().split()))\nt = [0] * n\nfor i in a:\n t[i-1]+=1\nminn=min(t)\nprint(minn)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "import sys\r\nfrom collections import Counter\r\n\r\nn, m = map(int, input().split())\r\ncnt = Counter(map(int, input().split()))\r\nans = 10**9\r\nfor i in range(1, n+1):\r\n ans = min(ans, cnt[i])\r\n\r\nprint(ans)\r\n", "class Tetris():\n def __init__(self, n):\n self.pontuacao = 0\n self.tabuleiro = [[] for i in range(n)]\n self.len = n\n def append(self, pos):\n self.tabuleiro[pos].append(1)\n def checarFileira(self):\n pontuou = True\n for i in range(self.len):\n if len(self.tabuleiro[i]) < 1:\n pontuou = False\n break\n if pontuou:\n self.pontuacao += 1\n for i in range(self.len):\n self.tabuleiro[i].pop(0)\n\nif __name__ == \"__main__\":\n tetris = Tetris(int(input().split(' ')[0]))\n for i in input().split(' '):\n tetris.append(int(i) - 1)\n tetris.checarFileira()\n print(tetris.pontuacao)\n \t \t\t \t \t \t \t\t\t \t\t \t\t\t", "n,m = map(int,input().split())\ne = list(map(int,input().split()))\nq = [0] * n\nfor i in range(0,m):\n q[e[i]-1] += 1\nprint(min(q)) ", "n, m = map(int, input().split())\r\ncnt, c = [0] * n, list(map(int, input().split()))\r\nfor x in c: cnt[x - 1] += 1\r\nprint(min(cnt))", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\ncnt = defaultdict(lambda : 0)\r\nfor i in c:\r\n cnt[i] += 1\r\nans = m\r\nfor i in range(1, n + 1):\r\n ans = min(ans, cnt[i])\r\nprint(ans)", "n, m = map(int, input().split())\r\nc = sorted(list(map(int, input().split())))\r\nb = list()\r\nif len(set(c))!=n:\r\n\tprint(0)\r\nelse:\r\n\tcount = 1\r\n\tfor i in range(m-1):\r\n\t\tif c[i]==c[i+1]:\r\n\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tb.append(count)\r\n\t\t\tcount=1\r\n\tb.append(count)\r\n\tprint(min(b))", "#tetris\r\nx,y=[int(x) for x in input().split()]\r\nlis=[0]*x\r\ninp=[int(x) for x in input().split()]\r\nfor i in inp:\r\n lis[i-1]=lis[i-1]+1\r\nscore=0\r\nfor o in range(int(y/x)):\r\n j=0\r\n for i in lis:\r\n if(i>0):\r\n j=j+1\r\n \r\n if(j==x):\r\n score=score+1\r\n for i in range(len(lis)):\r\n lis[i]=lis[i]-1\r\nprint(score)", "import collections, bisect\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncs = collections.Counter(arr)\r\nprint(min(cs[x] for x in range(1, n + 1)))\r\n", "n, m = map(int, input().split())\r\nl = [0] * (n + 1)\r\nfor i in tuple(map(int, input().split())):\r\n l[i] += 1\r\nprint(min(l[1:]))\r\n", "n, m = input().split(' ')\nn, m = int(n), int(m)\narray = input().split(' ')\n\ntop = [0]*n\nplatform = [[0]*n]*m\nscore = 0\n\nfor i in range(m):\n column = int(array[i])-1\n platform[top[column]][column] = 1\n top[column] = top[column] + 1\n\nprint(min(top))\n\t \t\t\t\t \t\t \t\t \t\t\t\t\t\t \t\t \t", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nmin = 1001\r\nfor i in range(1, n + 1):\r\n if l.count(i) < min:\r\n min = l.count(i)\r\nprint(min)", "n, m = map(int, input().split())\nsquares = map(int, input().split())\n\nplatform = [0 for col in range(n)]\npoints = [0 for col in range(n)]\n\nfor i in squares:\n points[i - 1] += 1\n\nprint(min(points))\n\n\t \t \t \t \t\t\t \t\t \t \t \t\t", "line = input().split()\nlength = int(line[0])\nquantity = int(line[1])\n\n\ngame = [0 for i in range(length)]\nentries = input().split()\n\nfor column in entries:\n game[int(column)-1] += 1\n\nminimum = game[0]\n\nfor column in range(length):\n if game[int(column)-1] < minimum:\n minimum = game[int(column)-1]\n\nprint(minimum)\n\t \t\t\t \t \t\t\t \t \t\t \t\t \t\t \t\t \t", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncounts = [0 for i in range(n)]\r\nfor i in range(n):\r\n counts[i] = a.count(i+1)\r\nprint(min(counts))", "s = input().split()\r\nn, m = int(s[0]), int(s[1])\r\nc = list(map(int, input().split()))\r\nmin_cnt = -1\r\nfor i in range(1, n+1):\r\n cnt = c.count(i)\r\n if min_cnt == -1 or cnt < min_cnt:\r\n min_cnt = cnt\r\nprint(min_cnt)\r\n\r\n ", "def pro(l):\r\n b=1\r\n for i in l:\r\n b*=i\r\n return b\r\ndef dele(l):\r\n for i in range(len(l)):\r\n l[i]-=1\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(0)\r\nc=0\r\nfor i in l:\r\n a[i-1]+=1\r\n if(pro(a)!=0):\r\n c+=1\r\n dele(a)\r\nprint(c)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif len(set(a))==n:\r\n print(min([a.count(i) for i in a]))\r\nelse:\r\n print(0)", "n, m = map(int, input().split())\nmas = list(map(int, input().split()))\nmas_1 = []\nfor i in range(n):\n mas_1.append(0)\nfor i in range(m):\n mas_1[mas[i] - 1] += 1\nprint(min(mas_1))\n", "y,x=[*map(int, input().split())]\no = [*map(int, input().split())]\n\nprint(min([o.count(_) for _ in range(1,y+1)]))", "n, m = map(int, input().split())\nv = map(int, input().split())\nx = [1] + [0] * n\nt = 0\nfor i in v:\n x[i] += 1\n if all(w > 0 for w in x):\n t += 1\n for o in range(1, n + 1):\n x[o] -= 1\nprint(t)\n", "n, m = map(int, input().split())\nblocos = input().split()\n\ntetris = [0]*n\ncontador = 0\n\nfor i in range(m):\n tetris[int(blocos[i])-1] += 1\n if min(tetris) != 0:\n contador += 1\n for j in range(n):\n tetris[j] -= 1\n\nprint(contador)\n\t \t\t\t\t\t \t \t \t \t\t \t\t\t \t\t\t\t\t", "n, m = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = m\r\nfor i in range(n):\r\n ans = min(ans, s.count(i + 1))\r\nprint(ans)\r\n", "x,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[0]+[int(0)for i in range(x)]\r\nfor i in l:\r\n l1[i]+=1\r\nprint(min(l1[1:]))", "info = input().split(\" \")\r\nn = int(info[0])\r\nm = int(info[1])\r\n\r\nsquares = input().split(\" \")\r\ngrid = [0] * n\r\n\r\nfor s in squares:\r\n col = int(s)\r\n grid[col-1] +=1\r\n\r\nprint(min(grid))", "n,m=map(int,input().split(' '))\r\ncube=list(map(int,input().split(' ')))\r\nCubeCount=[0]*(n+1)\r\n\r\nfor i in range(m):\r\n CubeCount[cube[i]]+=1\r\n\r\nMax=max(CubeCount)\r\nCubeCount[0]=Max\r\n\r\nMin=min(CubeCount)\r\n\r\n\r\nprint(Min)", "n, m = list(map(int, input().split()))\r\nsquare = [0] * n\r\nl = list(map(int, input().split()))\r\nfor x in l:\r\n square[x-1] += 1\r\nprint(min(square))\r\n \r\n", "#Bhargey Mehta (Junior)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open('input.txt', 'r')\r\nMOD = 998244353\r\nsys.setrecursionlimit(1000000)\r\n\r\nw, n = map(int, input().split())\r\nf = {i: 0 for i in range(1, w+1)}\r\nfor ai in map(int, input().split()):\r\n f[ai] += 1\r\nprint(min(f.values()))", "n,m = map(int, input().split())\r\ntL0 = list(map(int, input().split()))\r\ntL = [0] * n\r\nscore = 0\r\n\r\nfor i in range(m):\r\n tL[tL0[i] - 1] += 1\r\n if(0 not in tL):\r\n score += 1\r\n for i in range(n):\r\n tL[i] = tL[i] - 1\r\n\r\nprint(score)", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n, m = map(int, input().split(' '))\n a = list(map(int, input().split(' ')))\n \n cnt = [0] * (n + 1)\n for i in range(m): cnt[a[i]] += 1\n\n ans = m\n for i in range(1, n + 1): ans = min(ans, cnt[i])\n print(ans)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t\t\t\t \t \t\t\t\t\t \t\t\t\t \t \t\t\t", "# -*- coding: utf-8 -*-\n\nn_columns, column_size = [int(x) for x in input().split(\" \")]\n\ncolumns = [0 for _ in range(n_columns)]\n\nsquares = [int(x) for x in input().split(\" \")]\n\nfor square in squares:\n columns[square - 1] += 1\n \nprint(min(columns))\n\n\n\n \t\t\t\t\t \t\t \t\t\t \t \t\t \t\t \t", "n,m = map(int,input().split())\nsat = list(map(int, input().split()))\nmat=[0]*n\nfor i in sat:\n mat[i-1]+=1\nprint(min(mat))\n", "man=[int(x) for x in input().split()]\r\nmaxi=[int(x) for x in input().split()]\r\nyolo=[]\r\nfor i in range(1,man[0]+1):\r\n yolo.append(maxi.count(i))\r\nprint(min(yolo))\r\n\r\n", "n, m = [int(x) for x in input().split()]\r\nc = [int(x) - 1 for x in input().split()]\r\ncnt = [0] * n\r\nans = 0\r\nfor i in range(m):\r\n cnt[c[i]] += 1\r\n all = True\r\n for j in range(n):\r\n if cnt[j] - ans == 0:\r\n all = False\r\n break\r\n if all:\r\n ans += 1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\na=[0]*n\r\nfor i in range(m):\r\n\ta[c[i]-1]+=1\r\nprint(min(a))", "n, m = map(int, input().split())\r\narr = list(map(int, input().split())) \r\nt = [0 for i in range(n)]\r\nfor i in arr:\r\n t[i - 1]+=1\r\nprint(min(t))", "n, m = map(int, input().split())\n\nc = list(map(int, input().split()))\n\nr = [0]*n\n\nfor i in range(m):\n r[c[i]-1]+=1\n\nprint(min(r))", "R=lambda:map(int,input().split())\nn,m=R()\na=[0]*n\nfor c in R():a[c-1]+=1\nprint(min(a))\n \t \t\t \t \t \t\t\t\t\t\t \t \t \t\t", "c, n = map(int, input().split())\r\nt = []\r\nl = list(map(int, input().split()))\r\nfor z in range(1, c + 1):\r\n g = l.count(z)\r\n t.append(g)\r\n\r\nprint(min(t))\r\n", "n, m = input().split()\n\nnumbers = [int(x) for x in input().split()] \n\ncount = [0] * int(n)\n\nfor i in numbers:\n count[i - 1] += 1\n\npoints = min(count)\n\nprint(points)\n\n\n \t \t \t\t\t\t \t\t \t\t\t\t\t\t \t\t \t \t", "n, r = map(int, input().split())\r\nrows = list(map(int, input().split()))\r\nd = {i+1:0 for i in range(n)}\r\nfor i in rows:\r\n d[i] += 1\r\nprint(min(d.values()))", "z=int(input().split()[0]);a=list(map(int,input().split()));print(min(a.count(i) for i in range(1,z+1)))", "while True:\r\n\ttry:\r\n\t\tn, m = map(int, input().split())\r\n\t\tsqares = list(map(int, input().split()))\r\n\t\tcolms = [0]*(n+1)\r\n\t\tfor i in range(m):\r\n\t\t\tcolms [sqares[i]] += 1\r\n\t\tcolms.sort()\r\n\t\tprint(colms[1])\r\n\t\t\r\n\texcept EOFError:\r\n\t\tbreak", "n, m = [int(x) for x in input().split()]\r\na = [0] * n\r\nxs = [int(x) for x in input().split()]\r\nr = 0\r\nfor x in xs:\r\n a[x - 1] += 1\r\n if min(a) == 1:\r\n r += 1\r\n a = [y - 1 for y in a]\r\nprint(r)\r\n \r\n", "col = input().split(' ')\r\n\r\nsquare = input().split(' ')\r\n\r\narray = []\r\n\r\nfor i in range(int(col[0])):\r\n array.append(0)\r\nfor x in square:\r\n array[int(x) - 1] += 1\r\nsmall = 99999999\r\nfor b in array:\r\n if b < small:\r\n small = b\r\nprint(small)\r\n", "n, m = map(int, input().split())\narr = list(map(int, input().split()))\n\nMAP = [0 for i in range(n)]\nfor i in arr:\n MAP[i-1] += 1\n\nprint(min(MAP))", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn, m = IL()\r\nC = IL()\r\nprint(min(C.count(i+1) for i in range(n)))", "rong,sl=map(int, input().split())\r\nplay=list(map(int, input().split()))\r\nrs=sl\r\nfor i in range(1,rong+1):\r\n dem=play.count(i)\r\n if dem<rs:\r\n rs=dem\r\nprint(rs)", "tam_base, quad = input().split()\ntam = input().split()\npontos = 0\nbase = [0] * int(tam_base)\n\nfor i in range(int(quad)):\n base[int(tam[i]) - 1] += 1\n if min(base) != 0:\n base = [x - 1 for x in base]\n pontos += 1\n\nprint(pontos)\n\n \t\t\t\t \t\t\t\t\t \t\t\t \t \t \t\t\t", "n, m = [int(x) for x in input().split()] #Longitud de la plataforma -> n , Numero de cuadrados -> m\r\nlst = list(map(int, input().split()))\r\n\r\nif(n > m):\r\n print(\"0\")\r\nelse:\r\n coltotal = []\r\n setlst = set(lst)\r\n for x in setlst:\r\n coltotal.append(lst.count(x))\r\n for i in range(1,n+1):\r\n if(i not in setlst):\r\n coltotal.append(0)\r\n print(min(coltotal))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nl = []\r\nfor b in range(n):\r\n l.append(0)\r\nfor i in range(k):\r\n l[arr[i]-1] += 1\r\nprint(min(l))\r\n\t", "#Ana Clara Lacaze\n#193858\n\nn,m = [int(x) for x in input().split()]\ncolumnNumbers = [int(x) for x in input().split()]\ncolumns = n*[0]\n\nfor column in columnNumbers:\n columns[column-1] += 1\n\nscore = min(columns)\nprint(score)\n \t\t\t\t \t\t\t \t\t \t\t \t \t\t\t \t \t", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nm,n=map(int,input().split())\r\nArr=[0]*(m)\r\nL=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tArr[L[i]-1]+=1\r\nprint(min(Arr))\r\n\r\n", "n, m = [int(i) for i in input().strip().split()]\nl = [0] * n\nfor i in input().strip().split():\n l[int(i) - 1] += 1\nprint(min(l))\n\n \t\t\t\t \t\t\t\t \t \t\t\t\t\t \t \t", "t = 1\r\nwhile t:\r\n t-=1\r\n n, m = map(int, input().split())\r\n ls = list(map(int, input().split()))\r\n hash = [0 for _ in range(n)]\r\n for item in ls:\r\n hash[item-1]+=1\r\n print(min(hash)) ", "from collections import Counter\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nif len(set(c)) < n:\r\n print(\"0\")\r\nelse:\r\n d = Counter(c)\r\n print(min(d.values()))\r\n", "n,m = map(int,input().split())\n# m lines -> c input (1 <= c <= n)\n\nr = range(n)\nr2 = range(m)\n\nc = list(map(int,input().split()))\nnums = [0 for i in r]\n# print(nums)\n\nrowsCompleted = 0\npoints = 0\n\nfor i in r2:\n flag = 0\n nums[c[i]-1]+=1\n for j in r:\n if(nums[j] == rowsCompleted):\n flag = 1\n break\n \n if(flag == 0):\n rowsCompleted+=1\n\n\nprint(rowsCompleted)\n\t \t\t\t \t\t\t \t \t\t\t\t \t \t\t \t", "n, m = map(int, input().split())\r\narr = [int(x) for x in input().strip().split()]\r\ncnt = [0] * n\r\n\r\nfor i in range(m):\r\n cnt[arr[i] - 1] += 1\r\n\r\nprint(min(cnt))\r\n", "l1 = input().split()\nlenght = int(l1[0])\nnumberSquares = int(l1[1])\npositionSquare = list(map(int, input().split()))\npoints = 0\n\ntetris = [0] * lenght\n\nfor i in positionSquare:\n tetris[i - 1] += 1\n if 0 not in tetris:\n tetris = [x-1 for x in tetris]\n points += 1\n\n\nprint(points)\n\t \t \t\t\t\t \t\t\t\t \t\t \t\t\t \t\t \t \t \t\t", "n, m = map(int, input().split())\r\ncolumn, ans = [0] * n, 0\r\nblock = list(map(int, input().split()))\r\nfor i in range(len(block)):\r\n column[block[i] - 1] += 1\r\nprint(min(column))\r\n", "k,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nm=10**10\r\nif(len(s)!=k):\r\n print(0)\r\nelse:\r\n for i in s:\r\n x=l.count(i)\r\n if(x<m):\r\n m=x\r\n print(m)\r\n", "# n = int(raw_input())\n# a = int(n ** 0.5) + 1\n# if n == 1:\n# print \"not prime\"\n# if n % 2 == 0:\n# print \"not prime\"\n# else:\n# for i in xrange(3, a + 1, 2):\n# if n % i == 0:\n# print \"not prime\"\n# exit(0)\n# print \"prime\"\n# a = int(raw_input())\n# b = int(raw_input())\n# c = b % a\n# while c > 0:\n# a = c\n# b = a\n# c = b % a\n# print a\n# n = int(raw_input())\n# a = int(n ** 0.5)\n# if a ** 2 != n:\n# a += 1\n# b = 0\n# c = 0\n# if n == 1:\n# print \"1\"\n# exit(0)\n# if a ** 2 == n:\n# c = 1\n# for i in xrange(1, a, 1):\n# if n % i == 0:\n# b += 1\n# print 2 * b + c\n# for i in range(1,5):\n# print i * \"a\"\n# for i in range(1,5):\n# print (5-i) * \"a\"\n# for i in range (1,5):\n# print i * \" \" + (5-i) * \"a\"\n# for i in range (1,5):\n# print (5-i) * \" \" + i * \"a\"\n# n = int(input())\n# numbers = list(map(int, input().split()))\n# e = numbers[0]\n# a = 0\n# b = 0\n# for i in numbers:\n# c = i\n# if e > c:\n# b = e % c\n# a = c\n# if c < e:\n# b = c % e\n# a = e\n# while a != 0 and b != 0:\n# d = a\n# b = a % b\n# a = d\n# if a != b:\n# e = a + b\n# print(e)\n# n = int(input())\n# a = 0\n# b = 1\n# c = 1\n# for i in range(n):\n# c = a + b\n# a = b\n# b = c\n# print(c)\n\n# def get(n):\n# if n == 1:\n# return 1\n# elif n == 2:\n# return 2\n# else:\n# return get(n - 1) + get(n - 2)\n\n\n# n = int(input())\n# print(get(n))\n\n# n = int(input())\n#\n# dp = [0] * (n + 1)\n#\n#\n# def get(n):\n# if dp[n] != 0:\n# return dp[n]\n# if n == 1:\n# return 1\n# elif n == 2:\n# return 2\n# else:\n# dp[n] = get(n - 1) + get(n - 2)\n# return dp[n]\n#\n#\n# print(get(n))\n# n = int(input())\n# a = 0\n# for i in range(1, n // 2 + 1):\n# if (n - i) % i == 0:\n# a += 1\n# print(a)\n# n = int(input())\n# if n % 2 == 0:\n# print(\"Mahmoud\")\n# else:\n# print(\"Ehab\")\nn,m = list(map(int, input().split()))\narray = list(map(int, input().split()))\nb = [0 for i in range(n)]\nfor i in array:\n b[i-1] += 1\nc = 1001\nfor i in b:\n if c > i:\n c = i\nprint(c)\n", "a, b = map(int, input().split())\nn = list(map(int, input().split()))\n\nres = 1000\nfor sq in range(1,a+1):\n res = min(res, n.count(sq))\n \nprint(res)\n \t\t \t\t \t\t \t\t \t \t\t\t\t\t \t", "import collections\r\nn,m = [int(i) for i in input().split()]\r\nnumbers = [int(i) for i in input().split()]\r\ndict1 = collections.Counter(numbers)\r\nlist1 = list(dict1.keys())\r\nlist1.sort()\r\nif list1!=[i for i in range(1,n+1)]:\r\n print(0)\r\nelse:\r\n print(min(dict1.values()))\r\n", "n, m = map(int, input().split())\r\na = [0] * n\r\nb = list(map(int, input().split()))\r\nfor x in b:\r\n a[x-1] += 1\r\nprint(min(a))", "n,m=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\nt=[0]*n\r\n\r\n\r\nfor j in range(1,n+1):\r\n o=z.count(j)\r\n t[j-1]=o\r\n\r\nprint(min(t))\r\n", "s = input()\r\nblocks = []\r\nr = s.split(sep = ' ' , maxsplit = 1)\r\n\r\nfor i in range(int(r[0])):\r\n blocks.append(0)\r\n\r\nu = input()\r\nd = u.split(sep = ' ' , maxsplit = int(r[1]) - 1)\r\n\r\n\r\n\r\n\r\nfor j in d:\r\n for s in range(int(r[0])):\r\n if int(j) == s +1:\r\n blocks[s] += 1\r\nprint(min(blocks))", "a, b = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nd = [0 for i in range(a)]\r\nfor i in s:\r\n d[i - 1]+=1\r\nprint(min(d))\r\n", "a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmn = float(\"inf\")\r\nfor i in range(1, a+1):\r\n mn = min(mn, arr.count(i))\r\n\r\nprint(mn)\r\n\r\n\r\n", "def rebuildMatrix(matrix):\n list = []\n aux = []\n for i in range(n):\n list = matrix[i][1:m]\n list.append(0)\n aux.append(list)\n matrix = aux\n return matrix\n\ndef verifyPoints(matrix):\n exit = False\n point = 0\n while(exit == False):\n for i in range(m):\n for j in range(n):\n if(matrix[j][i] == 0):\n exit = True\n break\n if(exit == False):\n matrix = rebuildMatrix(matrix)\n point += 1\n break\n return point, matrix\n\nline = input()\narray = line.split()\nn = int(array[0])\nm = int(array[1])\n\nline = input()\ncolumn_select = line.split()\n\nmatrix = []\nlist = []\nfor i in range(n):\n for j in range(m):\n list.append(0)\n matrix.append(list)\n list = []\n\nparcial_points = 0\npoints = 0\nfor i in range(m):\n j = 0\n while(matrix[int(column_select[i])-1][j] == 1):\n j += 1\n matrix[int(column_select[i])-1][j] = 1\n parcial_points, matrix = verifyPoints(matrix)\n points += parcial_points\n\nprint(points)\n\n\t\t \t \t \t \t \t \t \t \t \t \t", "n, m = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\ncol = [0 for i in range(n)]\r\nfor i in c:\r\n col[i-1] += 1\r\nprint(min(col))", "import math\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if(i in d):\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nk=1000000\r\nfor i in d:\r\n k=min(k,d[i])\r\nif(len(d)!=n):\r\n print('0')\r\nelse:\r\n print(k)", "tamanho, quantQuadrados = [int(p) for p in input().split()]\ncolunaNaQualAparece = [int(p) for p in input().split()]\ncolunasJaChamadas = [0] * tamanho\nresultado = 0\nfor i in colunaNaQualAparece:\n colunasJaChamadas[i-1]+=1 \n \nprint(min(colunasJaChamadas))\n \t \t\t\t \t \t \t \t\t \t \t \t\t \t \t", "\r\nn,m=map(int ,input().strip().split())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nmn=1004\r\ncount=[0]*(n+1)\r\ni=0\r\nwhile i<m:\r\n count[arr[i]]+=1\r\n i+=1 \r\n\r\ni=1\r\nwhile i<=n:\r\n if count[i]<mn:\r\n mn=count[i]\r\n i+=1 \r\nprint(mn)", "def Tetris(n,m,seq):\r\n\tcnts = [0] * n\r\n\tminCnt = m\r\n\tfor s in seq:\t\t\r\n\t\tcnts[s-1]+=1\r\n\r\n\ti=0\r\n\twhile i<n:\r\n\t\tif cnts[i] < minCnt:\r\n\t\t\tminCnt = cnts[i]\r\n\t\ti+=1\r\n\r\n\treturn minCnt\r\n\r\nn,m = [int(x) for x in input().split()]\r\nseq = [int(x) for x in input().split()]\r\n\r\nprint(Tetris(n,m,seq))\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = {i:0 for i in range(1,n+1)}\r\nfor i in range(m):\r\n\tif a[i] in d:\r\n\t\td[a[i]] += 1\r\nprint(min(d.values()))", "import math\r\ncol, squers = map(int, input().split())\r\n# print(col, squers)\r\n\r\nsave = []\r\nsave = input().split()\r\n\r\narr = [0 for i in range(col)]\r\n\r\nfor i in range(squers):\r\n ind = int(save[i])\r\n arr[ind-1] += 1\r\n\r\nMin = math.inf\r\nfor i in range(col):\r\n if(arr[i] < Min):\r\n Min = arr[i]\r\n \r\nprint(Min)", "from collections import Counter\nn, m = map(int, input().split())\nc = Counter(map(int, input().split()))\nprint(min(c[i] for i in range(1, n+1)))", "from collections import Counter\r\n\r\nn, m = map(int, input().split())\r\na = input().split()\r\n\r\nif len(set(a)) != n:\r\n print(0)\r\nelse:\r\n print(min(Counter(a).values()))\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "def main():\n entrada = input().split();\n n = int(entrada[0]);\n m = int(entrada[1]);\n pontuacao = m; #O maior valor possível para a pontuacao é igual ao numero de quadrados(caso a plataforma tenha apenas uma coluna)\n plataforma = [0 for i in range(n)]; #Cada posicao do array guarda quantos quadrados estao naquela coluna\n entrada = input().split();\n \n #Distribuindo os quadrados na plataforma\n for i in range(m):\n plataforma[int(entrada[i]) - 1] += 1;\n\n #A pontuacao sera igual ao numero de quadrados na coluna com menos quadrados\n for i in range(n):\n if(plataforma[i] < pontuacao):\n pontuacao = plataforma[i];\n \n print(pontuacao);\n\nmain();\n\t\t\t\t \t\t\t\t\t \t \t \t \t\t\t \t \t", "n,m=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\n\r\nb=[]\r\nfor i in range(1,n+1):\r\n\tb.append(c.count(i))\r\nprint(min(b))", "n, m = map(int, input().split())\r\n*a, = map(int, input().split())\r\nans = 1000\r\nfor i in range(1, n + 1):\r\n ans = min(ans, a.count(i))\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [0] * n\r\nfor i in a:\r\n b[i - 1] += 1\r\nb.sort()\r\nprint(b[0])\r\n", "if __name__ == \"__main__\":\n resp = []\n n, cubos = map(int, input().split())\n resp = [0]*n\n entrada = list(map(int, input().split()))\n for i in entrada:\n resp[i-1]+=1\n print(min(resp))\n \t \t \t\t\t \t\t \t \t\t\t \t\t \t\t\t\t", "i = 0\r\nx = input().split(\" \")\r\nn = int(x[0])\r\nm = int(x[1])\r\nc = input().split(\" \")\r\nr = [0]*n\r\nwhile(i<m):\r\n if(int(c[i])>0):\r\n r[int(c[i])-1] = r[int(c[i])-1] + 1\r\n i = i + 1\r\ni = 0\r\nminimum = r[0]\r\nwhile(i<len(r)):\r\n if(minimum> r[i]):\r\n minimum = r[i]\r\n i =i +1\r\nprint(minimum)", "a,b=map(int,input().split())\r\nb=[int(i) for i in input().split()]\r\nc=[]\r\nfor i in range(1,a+1):\r\n c=c+[b.count(i)]\r\nprint(min(c))\r\n", "leng, m = map(int, input().split())\r\nblocks = list(map(int, input().split()))\r\ndiction = dict.fromkeys(range(1, (leng + 1)), 0)\r\nfor temp in blocks:\r\n t = diction[temp]\r\n t += 1\r\n diction[temp] = t\r\nanswer = min(diction.values())\r\nprint(answer)", "def main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n tetris = [0 for i in range(n)]\r\n for i in a:\r\n tetris[i - 1] += 1\r\n return min(tetris)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n,m=map(int,input().split())\nPlatform=[0 for i in range(n)]\nl=[*map(int,input().split())]\nfor i in l:\n Platform[i-1]+=1\nprint(min(Platform))\n", "n,m=input().split();n=int(n)\r\nc=list(map(int,input().split()))\r\nprint(min(c.count(x) for x in range(1,n+1)))", "n, m = map(int, input().split())\r\na = input().split()\r\nprint(min((a.count(i) for i in set(a))) if len(set(a))== n else 0 )", "colluns, n = map(int, input().split())\n\nentry = input().split()\n\ncol = [0] * colluns\n\nfor i in range(n):\n entry[i] = int(entry[i])\n\nfor i in entry:\n col[i-1] += 1\n\nprint(min(col))\n\t \t \t \t\t\t\t \t \t\t\t\t\t \t\t\t", "n,m = map (int, input().split(\" \"))\r\nx = [int(i) for i in input().split(\" \")]\r\nls = []\r\nfor i in range (n):\r\n ls.append (0)\r\nfor j in range (m):\r\n index = x[j]-1\r\n ls[index] += 1\r\nprint (min(ls))", "n,m=map(int,input().split())\r\nl=[int(i)-1 for i in input().split()]\r\ncnt=[0]*n \r\nfor i in l:\r\n cnt[i]+=1 \r\nprint(min(cnt))", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nhh = [0]*(n+1)\r\nfor i in range(0, len(c)):\r\n hh[c[i]] += 1\r\ndel hh[0]\r\n\r\nhmin = m\r\nfor i in range(0, n):\r\n hmin = min(hmin, hh[i])\r\nprint(hmin)", "x,y = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = {}\r\nk = 0\r\nt = 0\r\nfor i in range(x):\r\n\td[i+1] = 0\r\nfor i in range(len(a)):\r\n\tm = 0\r\n\td[a[i]] += 1\r\n\tfor k in range(x):\r\n\t\tif d[k+1] != 0:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tm = 1\r\n\t\t\tbreak\r\n\tif m == 0:\r\n\t\tt = t + 1\r\n\t\tfor j in range(x):\r\n\t\t\td[j+1] += -1\r\nprint(t)", "def test_2():\n #\n from collections import Counter\n n, m = list(map(int, input().split(\" \")))\n a = list(map(int, input().split(\" \")))\n a1 = set(a)\n if len(a1) != n:\n print(0)\n return 0\n mincount = min(Counter(a).values())\n print(mincount)\n\n\ntest_2()\n\t \t \t\t \t\t\t \t \t \t\t \t\t", "n,m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\np = [0]*n\r\nfor i in range(len(c)):\r\n p[c[i]-1] = p[c[i]-1] + 1\r\nprint(min(p))", "def anaylizePlatform(field):\n # Function that recieves a list and returns 0 if there is a zero in the list, 1 otherwise\n for i in range(len(field)):\n if field[i] == 0:\n return 0\n return 1\n\nn, m = input().split(\" \")\nn = int(n) # length of the platform\nm = int(m) # number of squares\n\nplays = input().split(' ')\n\nfield = [0 for i in range(n)]\npoints = 0\nfor row in range(len(plays)):\n field[int(plays[row]) - 1] += 1 # Add 1 to the column choosed by the play\n if anaylizePlatform(field):\n field = [field[i] - 1 for i in range(len(field))] # remove the platform subtracting 1 of all elements of the field\n points += 1\n\nprint(points)\n\t\t \t\t\t\t\t \t \t\t \t\t\t \t \t", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef test_case(casen):\r\n n, m = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n\r\n board = [0] * n\r\n nonzero = 0\r\n \r\n ans = 0\r\n for i in range(m):\r\n board[c[i]-1] += 1\r\n if board[c[i]-1] == 1:\r\n nonzero += 1\r\n if nonzero == n:\r\n ans += 1\r\n for i in range(n):\r\n board[i] -= 1\r\n if board[i] == 0:\r\n nonzero -= 1\r\n return ans\r\n\r\n\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(n):\r\n arr.append(c.count(i+1))\r\nprint(min(arr))", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ntetris = [0 for i in range(n)]\r\n\r\nfor i in arr:\r\n tetris[i-1]+=1\r\n\r\nprint(min(tetris))", "n, m = input().split()\r\nc = input().split()\r\n\r\ncols = [0] * (int(n)+1)\r\nfor i in c:\r\n\tcols[int(i)] += 1\r\ncols.sort()\r\nprint(cols[1])\r\n", "if __name__ == '__main__':\n n, m = input().split()\n n = int(n)\n m = int(m)\n\n squares = input().split(\" \")\n cont = [0] * n\n for i in squares:\n cont[int(i) - 1] += 1\n print(min(cont))\n\n\n\t \t \t\t\t\t\t \t\t\t \t \t \t\t\t \t \t \t", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,m=map(int,input().split())\r\na=input().split()\r\nif len(set(a))==n:\r\n\tprint(min(a.count(i) for i in set(a)))\r\nelse:\r\n\tprint(0)", "def main():\n n,m = map(int,input().split())\n columns = list(map(int,input().split()))\n \n squares_in_line=[]\n for i in range(n):\n squares_in_line.append(0)\n \n for x in columns:\n squares_in_line[x-1]+=1\n \n print(min(squares_in_line))\n\n\nif __name__ == '__main__':\n main()\n\n \t \t\t \t \t \t \t \t \t \t \t\t \t", "n, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nL = [0]*n\r\nfor i in range(m):\r\n L[A[i]-1] += 1\r\nprint(min(L))", "n,m=map(int,input().split())\r\ndic=dict()\r\nfor i in range(1,n+1):\r\n dic[i]=0\r\nf=list(map(int,input().split()))\r\nfor i in f:\r\n dic[i]+=1\r\nf=list(dic.values())\r\nprint(min(f))\r\n#matechbaach mel bnet", "x = input().split(\" \")\nn = int(x[0])\nsize = int(x[1])\n\ncol =[]\n\nfor i in range(n):\n col.append(0)\n\nsqrs = []\ny = input().split(\" \")\nfor k in y:\n sqrs.append(int(k))\n\nfor j in sqrs:\n col[j - 1] += 1\n \nprint(min(col))\n\t\t\t \t \t\t\t \t\t\t\t \t\t\t \t \t\t \t \t\t", "inp = list(map(int, input().split()))\nn = inp[0]\nm = inp[1]\nboard = []\ncheck = 1\nfor i in range(n):\n board.append(0)\npontos = 0\ninp = list(map(int, input().split()))\nfor i in range(m):\n c = inp[i]\n board[c-1] += 1\n check = 1\n for j in board:\n if j == 0:\n check= 0\n if check == 1:\n pontos += 1\n j=0\n check = 0\n for j in range(n):\n if board[j] > 0:\n board[j] -=1\nprint(pontos)\n \t \t\t\t \t \t \t \t \t\t\t \t\t\t \t\t", "n, m = list(map(int, input().split()))\n*c, = list(map(int, input().split()))\n\npoint = 0\namt = []\ntmp = set(c)\nresult = {}\nresult = {i : 0 for i in range(1, n+1)}\nfor i in tmp:\n result[i] = c.count(i)\n\nfor i in range(1, n+1):\n amt.append(result[i])\n\npoint = min(amt)\nprint(point)\n\n\t\t \t\t\t \t \t \t\t\t \t\t \t\t \t\t\t \t", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(a.count(i))\r\nprint(min(l))", "n, m = map(int, input().split())\r\ncols = list(map(int, input().split()))\r\ncnt = [0] * n\r\nscore = 0\r\nfor col in cols:\r\n cnt[col - 1] += 1\r\n if all(cnt):\r\n cnt = [x - 1 for x in cnt]\r\n score += 1\r\nprint(score)\r\n", "n_input, _ = input().split(' ')\nn = int(n_input)\n\ngrid = [0] * n\n\n# Preenche o grid com base nas posicoes dos quadrados da entrada\nsquares_pos = map(int, input().split(' '))\n\nfor pos in squares_pos:\n grid[pos - 1] = grid[pos - 1] + 1\n\n# Busca a coluna com o menor tamanho, que vai ser igual a pontuacao que o usuario vai ganhar\npoints = min(grid)\n\nprint(points)\n \t\t\t\t \t\t \t\t\t\t\t\t\t \t\t\t\t\t\t", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-19 22:56:48\nLastEditTime: 2021-11-19 23:00:05\nDescription: Tetris\nFilePath: CF961A.py\n'''\n\n\ndef func():\n n, _ = map(int, input().strip().split())\n lst = list(map(int, input().strip().split()))\n count = [0] * n\n for item in lst:\n if 1 <= item <= n:\n count[item - 1] += 1\n print(min(count))\n\n\nif __name__ == '__main__':\n func()\n ", "n, m = map(int, input().split())\nc = list(map(int, input().split()))\ncounts = [0]*n\nfor i in range(n):\n counts[i] = c.count(i + 1)\nprint(min(counts))\n", "n, m = [int(i) for i in input().split()]\nnums = [0] * n\nc = [int(i) for i in input().split()]\n\nfor i in range(m):\n nums[c[i] - 1] += 1\n\nscores = 0\nmin = min(nums)\n\nif min != 0: scores = min\n\nprint(scores)\n", "n, m = [int(x) for x in input().split(' ')]\r\nc = [int(x) for x in input().split(' ')]\r\n\r\nblock_cnt = {}\r\n\r\nfor block in c:\r\n if block in block_cnt.keys():\r\n block_cnt[block] += 1\r\n else:\r\n block_cnt[block] = 1\r\n\r\nif len(block_cnt) < n:\r\n ans = 0\r\nelse:\r\n ans = min(block_cnt.values())\r\nprint(ans)\r\n\r\n", "n, m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nM = [0 for i in range(n)]\n\nfor i in range(m):\n M[a[i] - 1] += 1\n \nprint(min(M))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = []\ncnt = 1\nfor i in range(1, n + 1):\n\tb.append(a.count(i))\nprint(min(b))\n\t\n", "#!/usr/bin/env python3\nfrom typing import Dict, List, Tuple\n\n\ndef input_lst() -> List[int]:\n return [int(x) for x in input().split()]\n\ndef print_out(res: List[int]):\n print(' '.join([str(x) for x in res]))\n\ndef get_simple_numbers_less_than(n: int) -> List[int]:\n\n pr = []\n lp = [0] * (n - 2)\n\n for i in range(n - 2):\n if lp[i] == 0:\n lp[i] = i\n pr.append(i)\n for p in pr:\n if p > lp[i] or p * i > n:\n break\n lp[p*i] = p\n\n return pr\n\n\ndef main():\n n, m = (int(x) for x in input().split())\n #x = int(input())\n\n\n\n\n\n\n\n\n\n #res = [0]\n a = input_lst()\n res = [0]*(n)\n for el in a:\n res[el-1] += 1\n\n print(min(res))\n\n #print_out(res)\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\nA = sorted(list(map(int, input().split())))\r\nk = [0]*n\r\nfor i in range(m):\r\n p = A[i]\r\n k[p-1] += 1\r\ns = min(k)\r\nprint(s)", "n, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\na = [0] * n\r\nfor i in c:\r\n a[i - 1] += 1\r\n\r\nprint(min(a))", "def main():\n n, m = map(int, input().split())\n board = []\n for i in range(n):\n board.append(0)\n\n blocks = [int(x) for x in input().split()]\n for j in blocks:\n board[j-1] += 1\n\n print(min(board))\n\nmain()\n \t \t \t\t\t \t \t\t \t\t\t \t\t \t\t\t \t", "n, m = map(int, input().split(' '))\r\nindexs = [int(i) for i in input().split(' ')]\r\nvalues = [0 for i in range(n)]\r\nfor i in range(m):\r\n values[indexs[i]-1] += 1\r\nscore = min(values)\r\nprint(score)", "m, n = tuple(map(int, input().split()))\r\nd = tuple(map(int, input().split()))\r\nprint(min(d.count(i) for i in range(1, m+1)))", "linha = input()\nlinha = linha.split(\" \")\nn, m = int(linha[0]), int(linha[1])\nif m>0:\n linha = input()\n linha = linha.split(\" \")\n vetor = []\n for i in linha:\n vetor.append(int(i))\n cont = [0]*n\n for i in vetor:\n cont[i-1] +=1\n print(min(cont))\nelse:\n print(0)\n \t\t \t\t\t\t \t\t\t \t\t\t\t\t \t \t \t\t", "n, m = map(int, input().split())\r\nC = list(map(int, input().split()))\r\n\r\nD = [0]*n\r\nfor c in C:\r\n D[c-1] += 1\r\nprint(min(D))\r\n", "b=[]\r\nx,y=map(int,input().split())\r\nfor i in range(x):\r\n b.append(0)\r\nz=list(map(int,input().split()))\r\nfor i in range(y):\r\n b[z[i]-1]+=1\r\nprint (min(b))\r\n \r\n \r\n", "n,m=map(int,input().split())\r\ncount=[0]*n\r\na=list(map(int,input().split()))\r\nfor i in range(m):\r\n count[a[i]-1]+=1\r\nprint(min(count))", "def main():\n fstline= input().split()\n scndline = input().split()\n ncol = int(fstline[0])\n nsqua = int(fstline[1])\n arr = list(0 for i in range (ncol))\n for i in range(nsqua):\n index = int(scndline[i]) - 1\n arr[index] += 1\n min = 10000\n for i in range(ncol):\n if(arr[i]<min):\n min = arr[i]\n print(min)\nmain()\n \t\t\t \t\t \t\t\t\t \t\t \t\t \t\t\t", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(1,n+1):\r\n ans.append(l.count(i))\r\nprint(min(ans))", "n,m=(input().strip().split(' '))\r\nn,m=[int(n),int(m)]\r\na=map(int,input().strip().split(' '))\r\na1=list(a)\r\na2=range(1,n+1)\r\nw=dict((x,a1.count(x)) for x in a2)\r\np=list(w.values())\r\np.sort()\r\nprint(p[0])\r\n\r\n \r\n", "n, m = map(int, input().split())\r\nlst = [0] * n\r\nfor i in input().split():\r\n lst[int(i) - 1] += 1\r\nprint(min(lst))\r\n", "n, m = map(int, input().split())\nc = list(map(int, input().split()))\ncounts = [0] * n\nfor val in c:\n\tcounts[val - 1] += 1\nprint(min(counts))\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nwidth, length = [int(x) for x in input().split()]\r\nmoves = [int(x) for x in input().split()]\r\n\r\narr = [0 for i in range(width)]\r\nfor x in moves:\r\n arr[x-1] +=1\r\n\r\nans = min(arr)\r\nprint(ans)", "n,m=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(arr.count(i))\r\nprint(min(l))", "#Pre-Python USACO Week1-3\r\n#https://codeforces.com/problemset/problem/961/A\r\n\r\nline=input().strip().split()\r\n\r\nn=int(line[0])\r\n\r\nm=int(line[1])\r\n\r\nindex=input().split()\r\n\r\nct=[]\r\nfor i in range(n):\r\n num=i+1\r\n count=index.count(str(num))\r\n ct.append(count)\r\n\r\nprint(min(ct))\r\n\r\n", "n, m = input().split()\nn = int(n)\nm = int(m)\n\nnumbers = [int(c) for c in input().split()]\n\nmin = m\n\nfor i in range(1,n+1):\n aux = numbers.count(i) \n if(aux < min):\n min = aux\n\nprint(min)\n \t \t \t \t \t \t\t \t \t", "import itertools\r\n\r\n\r\ndef main():\r\n n,m = [int(v) for v in input().split()]\r\n d = [int(v) for v in input().split()]\r\n c = [0 for i in range(n)]\r\n for v in d:\r\n c[v-1]+=1\r\n print(min(c))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, len = [int(x) for x in input().split()]\npoints = 0\ncounter = 0\nsequence = [int(x) for x in input().split()]\nplatform = [0] * n\n\nfor item in sequence:\n platform[item - 1] += 1\n flag = True\n for x in platform:\n if x < points + 1:\n flag = False\n break\n if flag:\n points += 1\n\nprint(points)\n \n", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [0 for i in range(n)]\r\nfor i in a:\r\n b[i - 1] += 1\r\nprint(min(b))", "columns, _ = [int(i) for i in input().split()]\ncolVec = [0]*columns\nnZeroes = columns\npieces = [int(i) for i in input().split()]\npoints = 0\nfor piece in pieces:\n if colVec[piece-1] == 0:\n nZeroes -= 1\n colVec[piece-1] += 1\n if nZeroes == 0:\n points += 1\n for i in range(columns):\n colVec[i] -= 1\n if colVec[i] == 0:\n nZeroes += 1\nprint(points)\n\t \t\t\t \t \t \t \t \t\t\t \t\t\t \t \t\t\t\t\t\t", "class Tetris:\n def __init__(self, length):\n # Inicializar tabuleiro com zeros\n self.board = [0] * length\n # Inicializar pontuação\n self.points = 0\n \n def addBlock(self, column):\n self.board[column] += 1\n \n def checkBoard(self):\n while not 0 in self.board:\n self.points += 1\n self.board = [n-1 for n in self.board]\n return self.points\n\nif __name__ == \"__main__\":\n # Ler primeira linha da entrada\n line1 = input().split()\n length = int(line1[0])\n # Instanciar classe\n tetris = Tetris(length)\n # Ler segunda linha da entrada\n line2 = input().split()\n for column in line2:\n # Computar bloco\n tetris.addBlock(int(column)-1)\n # Computar pontuação\n print(tetris.checkBoard())\n\t\t \t\t \t\t \t\t \t\t\t \t \t\t \t\t", "def num_points(n, c_list):\r\n num_squares_in_row = {1: 0}\r\n num_squares_in_col = {}\r\n curr_row = 1\r\n points = 0\r\n for c in c_list:\r\n if c not in num_squares_in_col:\r\n num_squares_in_col[c] = 1\r\n num_squares_in_row[1] += 1\r\n else:\r\n num_squares_in_col[c] += 1\r\n if num_squares_in_col[c] not in num_squares_in_row:\r\n num_squares_in_row[num_squares_in_col[c]] = 1\r\n else:\t\r\n num_squares_in_row[num_squares_in_col[c]] += 1\r\n if num_squares_in_row[curr_row] == n:\r\n points += 1\r\n curr_row += 1 \r\n return points\r\n \r\n \r\n \r\n[n, m] = [int(x) for x in input().strip().split(' ')]\r\nc_list = [int(x) for x in input().strip().split(' ')]\r\n\r\nprint(num_points(n, c_list))", "IN = list(map(int, input().split()))\r\nX = list(map(int, input().split()))\r\nY = set(X)\r\nif len(Y) < IN[0]:\r\n print(0)\r\n exit()\r\nMIN = 10000000\r\nfor i in Y:\r\n if MIN > X.count(i):\r\n MIN = X.count(i)\r\nprint(MIN)\r\n", "plat_lenght = int(input().strip().split(' ')[0])\nfalling_blocks = input().strip().split(' ')\nfalling_blocks = map(lambda x : int(x)-1,falling_blocks)\n\nplatform = [0]*plat_lenght\nfor block in falling_blocks:\n platform[block] += 1\nprint(min(platform))", "points = 0\n\nn, m = (map(int, input().split()))\nfield = []\n\nfor i in range(n):\n field.append(0)\n\nqs = list((map(int, input().split())))\n\nfor i in qs:\n # att\n field[i-1] = field[i-1] + 1\n # check\n checker = 1\n for j in field:\n if(j == 0):\n checker = 0\n break\n if checker:\n for j in range(len(field)):\n field[j] = field[j] - 1\n points += 1 \n\nprint(points)\n\t\t\t \t\t\t\t\t \t\t\t \t \t \t\t \t\t \t\t", "n,m = map(int,input().split())\r\nnumers = list(map(int,input().split()))\r\nList = list()\r\nfor i in range(n):\r\n List.append(numers.count(i+1))\r\nprint(min(List))", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncnt=[0]*n\r\nfor i in range(m):\r\n cnt[a[i]-1]+=1\r\nprint(min(cnt))\r\n", "n, m = map(int, input().split())\r\nmas = list(map(int, input().split()))\r\nmn = 1001\r\nfor i in range(1, n + 1):\r\n if mas.count(i) < mn:\r\n mn = mas.count(i)\r\nprint(mn)", "import sys\n\n\ndef main():\n table = list()\n\n n, m = map(int, sys.stdin.readline().split())\n\n columns = list(map(int, input().split()))\n\n for i in range(n):\n table.append(0)\n\n for i in range(m):\n colum = columns[i]\n table[colum - 1] += 1\n\n print(min(table))\n\n\nif __name__ == '__main__':\n main()\n\n\t\t \t \t\t \t\t \t\t\t \t\t\t\t\t", "n,useless=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nfor x in range(1,n+1):\r\n if x not in arr:\r\n print(0)\r\n break\r\nelse:\r\n print(arr.count(min(arr,key=lambda x:arr.count(x))))", "\r\nn, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl_set = list(set(l))\r\nif len(l_set) != n:\r\n\tprint(0)\r\n\texit()\r\n\r\nlp = []\r\nfor i in l_set:\r\n\tlp.append(l.count(i))\r\n\r\nprint(min(lp))", "[n, m] = map(int, input().split(' '))\narr = list(map(int, input().split(' ')))\n\nn_count = []\nfor i in range(1, n + 1):\n n_count.append(arr.count(i))\n\nprint(min(n_count))\n\t\t\t \t \t\t \t\t\t\t \t\t \t\t\t \t", "input1 = [int(input) for input in input().split(\" \")]\nnumbers = [int(number) for number in input().split(\" \")]\n\nplataform_lenght = input1[0]\nnumbers_of_squares = input1[1]\n\ndef calculate_points(vector_numbers, lenght):\n blocks_per_row = []\n for i in range (lenght):\n blocks_per_row.append(0)\n for i in (vector_numbers):\n blocks_per_row[i-1] = blocks_per_row[i-1] + 1\n return min(blocks_per_row)\n\npoints = calculate_points(numbers, plataform_lenght)\nprint(points)\n\t\t \t\t \t \t \t\t \t\t \t\t\t", "def ints():\n return map(int,input().split())\nn,m=ints()\nc=ints()\naa=[0]*(n+1)\nfor cc in c:\n aa[cc]+=1\nprint(min(aa[1:]))\n \t\t\t \t\t\t \t\t \t\t \t\t \t\t \t\t \t", "n, m = input().split()\nn, m = int(n), int(m)\n\nactions = input().split()\nactions = list(map(int, actions))\n\nplatform = []\nfor index in range(n):\n platform.append(0)\n\nscore = 0\n\nfor index in actions:\n platform[index - 1] += 1\n \n for column in range(len(platform)):\n if platform[column] == 0:\n break\n elif column == len(platform) - 1:\n score += 1\n platform = list(map(lambda x: x - 1, platform))\n\nprint(score)\n \t\t \t\t\t\t\t\t \t \t \t\t\t \t \t\t\t", "n, m = list(map(int, input().strip().split(' ')))\nnums = list(map(int, input().strip().split(' ')))\n\n#print(n, m)\n#print(nums)\nres = 0\ncount = [0] * n\nfor item in nums:\n count[item-1] += 1\n ok = True\n for i in range(n):\n if count[i] == 0:\n ok = False\n continue\n if ok:\n res += 1\n for i in range(n):\n count[i] -= 1\n\nprint(res)\n\n\t \t\t \t \t \t\t\t\t \t\t \t", "n, m = map(int, input().strip().split())\r\nc = list(map(int, input().strip().split()))\r\n\r\nfilled = [0] * n\r\nfor x in c:\r\n filled[x - 1] += 1\r\nprint(min(filled))\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\narr = [0 for i in range(n)]\r\ninput_arr = list(map(int, input().split()))\r\nfor el in input_arr:\r\n arr[el - 1] += 1\r\nprint(min(arr))\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nanswer = [0]*n\r\nfor i in arr:\r\n answer[i-1] += 1\r\nprint(min(answer))\r\n", "from ctypes.wintypes import PLARGE_INTEGER\nfrom platform import platform\n\n\nfirstLine = list(map(int, input().split()))\nn = firstLine[0]\n\nsecondLine = list(map(int, input().split()))\n\nplatform = [] #vector that represents platform\n\ncontrol = 0 #control variable that counts the number of block in a row\n\npoints = 0\n\nfor i in range(n): #populate the platform vector\n platform.append(0)\n\nfor block in secondLine:\n platform[block-1] += 1\n for j in range(len(platform)): #checks if the first line of all rows are filled\n if(platform[j]>=1):\n control+=1\n if(control == n): #case positive, sum 1 to points and remove 1 block from every row\n points+=1\n for k in range(len(platform)):\n platform[k]-=1\n control = 0 \nprint(points)\n \t\t \t\t \t \t \t\t \t \t \t\t\t \t", "n, m = map(int, input().split())\nc = list(map(int, input().split()))\nd = dict.fromkeys(c, 0)\nfor i in c:\n d[i] += 1\n\nprint( min(d.get(x + 1, 0) for x in range(n)))\n\n \t\t \t \t \t \t\t\t \t \t\t \t\t \t", "x,y=map(int,input().split());a=list(map(int,input().split()));b=[0]*x\r\nfor i in a:\r\n\tb[i-1]+=1\r\nprint(min(b))\r\n", "info = input().split(\" \")\r\nn = int(info[0])\r\nm = int(info[1])\r\n\r\npoints = 0\r\ngrid = [0]*n\r\nisFilled = [False]*n\r\nfilled_cols = 0\r\n\r\nsquares = input().split(\" \")\r\n\r\nfor square in squares:\r\n col = int(square)\r\n grid[col-1]+=1\r\n\r\n if not isFilled[col-1]:\r\n filled_cols+=1\r\n isFilled[col-1] = True\r\n\r\n if filled_cols==n:\r\n for j in range(n):\r\n grid[j]-=1\r\n if grid[j]==0:\r\n isFilled[j] = False\r\n filled_cols-=1\r\n points+=1\r\n\r\n\r\nprint(points)\r\n", "n,m=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\nvals=[]\r\nfor i in range(n):\r\n vals.append(nums.count(i+1))\r\nprint(min(vals))", "n, m = input().split()\narray = [int (x) for x in input().split()]\ntetris = [0]*int(n)\nfor i in array:\n tetris[i-1] += 1\nprint(min(tetris))\n\t \t \t \t\t\t\t \t\t \t\t\t\t\t\t \t\t\t", "\r\nR = lambda:map(int,input().split())\r\n\r\nn,m = R()\r\n\r\na = [0]*n\r\nfor c in R():\r\n a[c-1] += 1\r\n\r\nprint(min(a))\r\n ", "def isFull(lst):\r\n for x in lst:\r\n if x==0:\r\n return False\r\n return True\r\n\r\ninp_1 = input().split()\r\nn = int(inp_1[0])\r\nm = int(inp_1[1])\r\nrow = [0]*n\r\nstr_lst = input().split()\r\nlst = [int(i)-1 for i in str_lst]\r\npoints = 0\r\nfor i in lst:\r\n row[i]+=1\r\n if isFull(row):\r\n points+=1\r\n row = [i-1 for i in row]\r\nprint(points)", "str1 = str(input())\r\nn = int(str1.split(' ')[0])\r\nm = int(str1.split(' ')[1])\r\n\r\ndect = {i + 1: 0 for i in range(n)}\r\n\r\nstr2 = str(input())\r\n\r\nlis = [int(i) for i in str2.split(' ')]\r\n\r\nfor i in lis:\r\n dect[i] += 1\r\n\r\nkey = min(dect, key = dect.get)\r\nprint(dect[key])\r\n", "n, m = list(map(int, input().strip().split()))\nlis = list(map(int, input().strip().split()))\nres = [0 for i in range(n)]\ncount = 0\nfor i in lis:\n res[int(i) - 1] += 1\n if 0 not in res:\n count += 1\n for j in range(n):\n res[j] -= 1\nprint(count)\n", "import collections\r\n\r\nn, blocks = map(int, input().split())\r\n\r\ndick = collections.defaultdict(int)\r\n\r\na = tuple(input().split())\r\n\r\nfor i in a:\r\n\tdick[i] += 1\r\n\r\nif len(dick) == n:\r\n\tprint(dick[min(dick, key=dick.get)])\r\nelse:\r\n\tprint(0)", "from collections import Counter\r\nn, m = map(int, input().split())\r\nc = Counter(list(map(int, input().split())))\r\nif len(c) < n:\r\n print(0)\r\nelse:\r\n print(min(c.values()))" ]

[ "import heapq\r\nimport random\r\nimport sys\r\nfrom math import inf\r\nfrom types import GeneratorType\r\n\r\nRANDOM = random.randint(1, 10 ** 9)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline()\r\n\r\n def read_int(self):\r\n return int(self.read_str())\r\n\r\n def read_float(self):\r\n return float(self.read_str())\r\n\r\n def read_ints(self):\r\n return map(int, self.read_str().split())\r\n\r\n def read_floats(self):\r\n return map(float, self.read_str().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self.read_str().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self.read_str().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self.read_str().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self.read_str().split()))\r\n\r\n def read_list_strs(self):\r\n return self.read_str().split()\r\n\r\n def read_list_str(self):\r\n return list(self.read_str())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n def ask(self, lst):\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n return res\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass Wrapper(int):\r\n # 用来规避 py 哈希碰撞的问题和进行加速\r\n def __init__(self, x):\r\n int.__init__(x)\r\n # 原理是异或一个随机种子\r\n\r\n def __hash__(self):\r\n # 也可以将数组排序后进行哈希计数\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n, m, target, source, destination = ac.read_ints()\r\n edges = []\r\n dct = [[] for _ in range(n)]\r\n book = [0] * m\r\n for ind in range(m):\r\n i, j, w = ac.read_list_ints()\r\n if w == 0:\r\n w = 1\r\n book[ind] = 1\r\n edges.append([i, j, w])\r\n dct[i].append([ind, j])\r\n dct[j].append([ind, i])\r\n\r\n # 第一遍最短路计算最小情况下的距离\r\n dis0 = [inf] * n\r\n stack = [[0, source]]\r\n dis0[source] = 0\r\n while stack:\r\n d, i = heapq.heappop(stack)\r\n if dis0[i] < d:\r\n continue\r\n for ind, j in dct[i]:\r\n dj = edges[ind][2] + d\r\n if dj < dis0[j]:\r\n dis0[j] = dj\r\n heapq.heappush(stack, [dj, j])\r\n if dis0[destination] > target:\r\n ac.st(\"NO\")\r\n return\r\n\r\n # 第二遍最短路\r\n dis1 = [inf] * n\r\n stack = [[0, source]]\r\n dis1[source] = 0\r\n while stack:\r\n d, i = heapq.heappop(stack)\r\n if dis1[i] < d:\r\n continue\r\n for ind, j in dct[i]:\r\n if book[ind]:\r\n # 假设 (i, j) 是最短路上的边\r\n if (edges[ind][2] + dis1[i]) + (dis0[destination] - dis0[j]) < target:\r\n # 此时还有一些增长空间即（当前到达 j 的距离）加上（剩余 j 到 destination）的距离仍旧小于 target\r\n x = target - (edges[ind][2] + dis1[i]) - (dis0[destination] - dis0[j])\r\n edges[ind][2] += x\r\n book[ind] = 0\r\n dj = edges[ind][2] + d\r\n if dj < dis1[j]:\r\n dis1[j] = dj\r\n heapq.heappush(stack, [dj, j])\r\n\r\n if dis1[destination] == target:\r\n ac.st(\"YES\")\r\n for e in edges:\r\n ac.lst(e)\r\n else:\r\n ac.st(\"NO\")\r\n return\r\n\r\n\r\nSolution().main()\r\n", "from collections import defaultdict \r\nMAX = 10 ** 14\r\n \r\ndef Dijkstra(graph, s, n):\r\n visited = [False] * n\r\n d = [MAX] * n\r\n parents = {}\r\n d[s] = 0\r\n for i in range(n):\r\n _, v = min((d[j], j) for j in range(n) if not visited[j])\r\n visited[v] = True\r\n for to, length in graph[v]:\r\n if d[to] > d[v] + length:\r\n d[to] = d[v] + length\r\n parents[to] = v\r\n return parents, d\r\n \r\n \r\ndef PrintSol(graph, n_edges, n, zeros, edgesWithZero, leave):\r\n for i in range(n):\r\n for to, length in graph[i]:\r\n if to < i:\r\n if (i, to) in n_edges:\r\n print(i, to, n_edges[(i, to)])\r\n elif zeros and (i, to) in edgesWithZero and (i, to) not in leave:\r\n print(i, to, MAX)\r\n else:\r\n print(i, to, length)\r\n \r\n \r\ngraphWithZero = defaultdict(list)\r\ngraphWithMax = defaultdict(list)\r\n \r\nn, m, L, s, t = map(int, input().split(' '))\r\nedgesWithZero = set()\r\nfor _ in range(m):\r\n u, v, l = map(int, input().split(' '))\r\n if l == 0:\r\n graphWithZero[u].append((v, 1))\r\n graphWithZero[v].append((u, 1))\r\n graphWithMax[u].append((v, MAX))\r\n graphWithMax[v].append((u, MAX))\r\n edgesWithZero |= {(u, v), (v, u)}\r\n else:\r\n graphWithZero[u].append((v, l))\r\n graphWithZero[v].append((u, l))\r\n graphWithMax[u].append((v, l))\r\n graphWithMax[v].append((u, l))\r\n\r\na2, d2 = Dijkstra(graphWithMax, s, n) \r\na1, d1 = Dijkstra(graphWithZero, s, n)\r\n\r\n \r\nif d2[t] < L:\r\n print('NO')\r\nelif d2[t] == L:\r\n print('YES')\r\n PrintSol(graphWithMax, dict(), n, False, edgesWithZero, set())\r\nelif d1[t] <= L:\r\n print('YES')\r\n v = t\r\n leave = set()\r\n n_edges = dict()\r\n total = 0\r\n while v != s:\r\n leave |= {(v, a1[v]), (a1[v], v)}\r\n if (v, a1[v]) in edgesWithZero:\r\n cur = max(L - total - d2[a1[v]], 1)\r\n n_edges[(max(v, a1[v]), min(v, a1[v]))] = cur\r\n total += cur\r\n else:\r\n total += d1[v] - d1[a1[v]]\r\n v = a1[v]\r\n PrintSol(graphWithZero, n_edges, n, True, edgesWithZero, leave)\r\nelse:\r\n print('NO')", "# https://leetcode.com/problems/modify-graph-edge-weights/\r\n\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nfrom math import *\r\nfrom heapq import *\r\nfrom collections import defaultdict, Counter, deque\r\n\r\nn, m, target, src, dst = map(int, input().split())\r\n\r\nMAX = target + 1\r\n \r\n# it is easy to modify w\r\ngraph = [[-1] * n for _ in range(n)]\r\nedges = []\r\nfor _ in range(m):\r\n u,v,w = map(int, input().split())\r\n graph[u][v] = graph[v][u] = w\r\n edges.append([u,v,w])\r\n\r\ninf_dist = defaultdict(lambda :inf)\r\ninf_dist[src] = 0\r\n\r\nheap = [(0, src)]\r\nwhile heap:\r\n cost, node = heappop(heap)\r\n if inf_dist[node] < cost:\r\n continue\r\n for neigh, weight in enumerate(graph[node]):\r\n if weight !=-1 and weight != 0 and weight + cost < inf_dist[neigh]:\r\n inf_dist[neigh] = weight + cost\r\n heappush(heap, (weight + cost, neigh))\r\n\r\n# normal dijkstra is better than modified graph\r\nif inf_dist[dst] < target:\r\n print('No')\r\n exit()\r\n\r\nif inf_dist[dst] == target:\r\n res = []\r\n for s,d,c in edges:\r\n res.append([s,d,(c if c else MAX)])\r\n\r\n print('Yes')\r\n for r in res:\r\n print(*r)\r\n exit()\r\n\r\n# -1 as 1, and start from src\r\none_dist = defaultdict(lambda :inf)\r\none_dist[src] = 0\r\n\r\nheap = [(0, src)]\r\nprev = {}\r\nwhile heap:\r\n cost, node = heappop(heap)\r\n if one_dist[node] < cost:\r\n continue\r\n for neigh, weight in enumerate(graph[node]):\r\n dist = (weight if weight else 1) + cost\r\n if weight != -1 and dist < one_dist[neigh]:\r\n one_dist[neigh] = dist\r\n prev[neigh] = node\r\n heappush(heap, (dist, neigh))\r\n\r\nif one_dist[dst] > target:\r\n print('No')\r\n exit()\r\n\r\n\r\ncurr = dst\r\nwhile curr != src:\r\n p = prev[curr]\r\n if not graph[curr][p]:\r\n if inf_dist[p] < target:\r\n graph[p][curr] = graph[curr][p] = target - inf_dist[p]\r\n break\r\n graph[p][curr] = graph[curr][p] = 1\r\n target -= graph[curr][p]\r\n curr = p\r\n\r\nres = []\r\nfor s,d,_ in edges:\r\n res.append([s,d,(MAX if not graph[s][d] else graph[s][d])])\r\n \r\nprint('Yes')\r\nfor r in res:\r\n print(*r)", "from collections import defaultdict \r\nMAX = 10 ** 14\r\n \r\ndef Dijkstra(graph, s, n):\r\n visited = [False] * n\r\n d = [MAX] * n\r\n parents = {}\r\n d[s] = 0\r\n for i in range(n):\r\n _, v = min((d[j], j) for j in range(n) if not visited[j])\r\n visited[v] = True\r\n for u, cost in graph[v]:\r\n if d[u] > d[v] + cost:\r\n d[u] = d[v] + cost\r\n parents[u] = v\r\n return parents, d\r\n \r\n \r\ndef PrintSol(graph, variableEdgesInPath, n, zeros, edgesWithZero, leave):\r\n for v in range(n):\r\n for u, cost in graph[v]:\r\n if u < v:\r\n if (v, u) in variableEdgesInPath:\r\n print(v, u, variableEdgesInPath[(v, u)])\r\n elif zeros and (v, u) in edgesWithZero and (v, u) not in leave:\r\n print(v, u, MAX)\r\n else:\r\n print(v, u, cost)\r\n \r\n \r\ngraphWithZero = defaultdict(list)\r\ngraphWithMax = defaultdict(list)\r\n \r\nn, m, L, s, t = map(int, input().split(' '))\r\nedgesWithZero = set()\r\nfor _ in range(m):\r\n u, v, l = map(int, input().split(' '))\r\n if l == 0:\r\n graphWithZero[u].append((v, 1))\r\n graphWithZero[v].append((u, 1))\r\n graphWithMax[u].append((v, MAX))\r\n graphWithMax[v].append((u, MAX))\r\n edgesWithZero |= {(u, v), (v, u)}\r\n else:\r\n graphWithZero[u].append((v, l))\r\n graphWithZero[v].append((u, l))\r\n graphWithMax[u].append((v, l))\r\n graphWithMax[v].append((u, l))\r\n\r\na2, d2 = Dijkstra(graphWithMax, s, n) \r\na1, d1 = Dijkstra(graphWithZero, s, n)\r\n\r\n \r\nif d2[t] < L:\r\n print('NO')\r\nelif d2[t] == L:\r\n print('YES')\r\n PrintSol(graphWithMax, dict(), n, False, edgesWithZero, set())\r\nelif d1[t] <= L:\r\n print('YES')\r\n v = t\r\n leave = set()\r\n variableEdgesInPath = dict()\r\n total = 0\r\n while v != s:\r\n leave |= {(v, a1[v]), (a1[v], v)}\r\n if (v, a1[v]) in edgesWithZero:\r\n cur = max(L - total - d2[a1[v]], 1)\r\n variableEdgesInPath[(max(v, a1[v]), min(v, a1[v]))] = cur\r\n total += cur\r\n else:\r\n total += d1[v] - d1[a1[v]]\r\n v = a1[v]\r\n PrintSol(graphWithZero, variableEdgesInPath, n, True, edgesWithZero, leave)\r\nelse:\r\n print('NO')", "import bisect\r\nimport decimal\r\nimport heapq\r\nimport sys\r\nfrom types import GeneratorType\r\nfrom math import inf\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nfrom functools import lru_cache\r\nfrom heapq import nlargest\r\nfrom functools import reduce\r\nimport random\r\nfrom itertools import combinations\r\nfrom operator import xor, add\r\nfrom operator import mul\r\nfrom typing import List, Callable, Dict, Set, Tuple, DefaultDict\r\n\r\n\r\nRANDOM = random.randint(1, 10 ** 9)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline()\r\n\r\n def read_int(self):\r\n return int(self.read_str())\r\n\r\n def read_float(self):\r\n return float(self.read_str())\r\n\r\n def read_ints(self):\r\n return map(int, self.read_str().split())\r\n\r\n def read_floats(self):\r\n return map(float, self.read_str().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self.read_str().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self.read_str().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self.read_str().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self.read_str().split()))\r\n\r\n def read_list_strs(self):\r\n return self.read_str().split()\r\n\r\n def read_list_str(self):\r\n return list(self.read_str())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n def ask(self, lst):\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n return res\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass Wrapper(int):\r\n # 用来规避 py 哈希碰撞的问题和进行加速\r\n def __init__(self, x):\r\n int.__init__(x)\r\n # 原理是异或一个随机种子\r\n\r\n def __hash__(self):\r\n # 也可以将数组排序后进行哈希计数\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def modifiedGraphEdges(n: int, edges: List[List[int]], source: int, destination: int, target: int) -> \\\r\n List[List[int]]:\r\n dct = [dict() for _ in range(n)]\r\n edge = set()\r\n for i, j, w in edges:\r\n if i > j:\r\n i, j = j, i\r\n if w == -1:\r\n edge.add((i, j))\r\n w = 1\r\n dct[i][j] = dct[j][i] = w\r\n\r\n def check():\r\n ans = []\r\n visit = set()\r\n for i in range(n):\r\n for j in dct[i]:\r\n if (i, j) not in visit:\r\n ans.append([i, j, dct[i][j]])\r\n visit.add((i, j))\r\n visit.add((j, i))\r\n return ans\r\n\r\n dis0 = [inf] * n\r\n stack = [[0, source]]\r\n dis0[source] = 0\r\n while stack:\r\n d, i = heapq.heappop(stack)\r\n if dis0[i] < d:\r\n continue\r\n for j in dct[i]:\r\n dj = dct[i][j] + d\r\n if dj < dis0[j]:\r\n dis0[j] = dj\r\n heapq.heappush(stack, [dj, j])\r\n if dis0[destination] > target:\r\n return []\r\n\r\n dis1 = [inf] * n\r\n stack = [[0, source]]\r\n need = target - dis0[destination]\r\n dis1[source] = 0\r\n while stack:\r\n d, i = heapq.heappop(stack)\r\n if dis1[i] < d:\r\n continue\r\n for j in dct[i]:\r\n tp = (i, j) if i < j else (j, i)\r\n if tp in edge:\r\n w = need + dis0[j] - dis1[i]\r\n if dct[i][j] < w:\r\n dct[i][j] = dct[j][i] = w\r\n edge.discard(tp)\r\n dj = dct[i][j] + d\r\n if dj < dis1[j]:\r\n dis1[j] = dj\r\n heapq.heappush(stack, [dj, j])\r\n for i, j in edge:\r\n dct[i][j] = dct[j][i] = 2 * 10 ** 9\r\n if dis1[destination] == target:\r\n return check()\r\n return []\r\n\r\n def main(self, ac=FastIO()):\r\n n, m, d, s, t = ac.read_ints()\r\n edges = []\r\n for _ in range(m):\r\n lst = ac.read_list_ints()\r\n if lst[-1] == 0:\r\n lst[-1] = -1\r\n edges.append(lst)\r\n ans = self.modifiedGraphEdges(n, edges, s, t, d)\r\n if ans:\r\n ac.st(\"YES\")\r\n for a in ans:\r\n ac.lst(a)\r\n else:\r\n ac.st(\"NO\")\r\n return\r\n\r\n\r\nSolution().main()\r\n", "from io import BytesIO, IOBase\r\nimport math\r\n\r\nimport random\r\nimport sys\r\nimport os\r\n\r\nimport bisect\r\nimport typing\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom itertools import accumulate, combinations, permutations, count\r\nfrom operator import add, iand, ior, itemgetter, mul, xor\r\nfrom string import ascii_lowercase, ascii_uppercase, ascii_letters\r\nfrom typing import *\r\nBUFSIZE = 4096\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef I():\r\n return input()\r\n\r\ndef II():\r\n return int(input())\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\ninf = float('inf')\r\n\r\n# from types import GeneratorType\r\n\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n\r\n# RANDOM = random.getrandbits(32)\r\n\r\n# class Wrapper(int):\r\n# def __init__(self, x):\r\n# int.__init__(x)\r\n\r\n# def __hash__(self):\r\n# return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\nclass Solution:\r\n def modifiedGraphEdges(self, n: int, edges: List[List[int]], source: int, destination: int, target: int) -> List[List[int]]:\r\n mod = [[False] * n for _ in range(n)]\r\n index = [[-1] * n for _ in range(n)]\r\n a = [[inf] * n for _ in range(n)]\r\n d = [inf] * n\r\n d[source] = 0\r\n visit = [False] * n\r\n for i in range(len(edges)):\r\n u, v, c = edges[i][0], edges[i][1], edges[i][2]\r\n if c == -1:\r\n mod[u][v] = True\r\n mod[v][u] = True\r\n index[u][v] = i\r\n index[v][u] = i\r\n edges[i][2] = 1\r\n c = 1\r\n a[u][v] = min(a[u][v], c)\r\n a[v][u] = a[u][v]\r\n for i in range(n):\r\n Min = -1\r\n for j in range(n):\r\n if not visit[j] and (Min == -1 or d[j] < d[Min]):\r\n Min = j\r\n visit[Min] = True\r\n for j in range(n):\r\n if not visit[j] and d[Min] + a[Min][j] < d[j]:\r\n d[j] = d[Min] + a[Min][j]\r\n if d[destination] > target:\r\n return []\r\n if d[destination] == target:\r\n return edges\r\n diff = target - d[destination]\r\n # + diff\r\n d2 = [inf] * n\r\n d2[source] = 0\r\n visit = [False] * n\r\n for i in range(n):\r\n Min = -1\r\n for j in range(n):\r\n if not visit[j] and (Min == -1 or d2[j] < d2[Min]):\r\n Min = j\r\n visit[Min] = True\r\n for j in range(n):\r\n if not visit[j] and mod[Min][j] and d[j] + diff - d2[Min] > a[Min][j]:\r\n a[Min][j] = d[j] + diff - d2[Min]\r\n edges[index[Min][j]][2] = a[Min][j]\r\n if not visit[j] and d2[Min] + a[Min][j] < d2[j]:\r\n d2[j] = d2[Min] + a[Min][j]\r\n if d2[destination] == target:\r\n return edges\r\n else:\r\n return []\r\n\r\nn, m, target, s, t = MII()\r\nedges = []\r\nfor _ in range(m):\r\n u, v, w = MII()\r\n if w == 0: w -= 1\r\n edges.append([u, v, w])\r\n\r\nans = Solution().modifiedGraphEdges(n, edges, s, t, target)\r\nif len(ans):\r\n print('YES')\r\n for e in ans:\r\n print(*e)\r\nelse:\r\n print('NO')" ]

[ "s=input()\r\nc=0\r\nwhile(len(s)>1):\r\n sum=0\r\n for i in s:\r\n sum+=int(i)\r\n s=str(sum)\r\n c+=1\r\nprint(c)", "from collections import Counter\ndef transform(s):\n c = Counter(s)\n val = 0\n for k in c:\n val += (ord(k)-ord('0'))*c[k]\n return str(val)\n\ns = input()\ncount = 0\nwhile(len(s)>=2):\n s = transform(s)\n count+=1\nprint(count)\n", "import sys\r\n\r\na= input()\r\n\r\nc=0\r\nwhile 1:\r\n if len(a)==1:\r\n break\r\n a= str(sum(int(i) for i in a))\r\n c+=1\r\n \r\n \r\n \r\nprint(c)\r\n", "s=input()\r\nsu=0\r\nj=0\r\nwhile(len(s)>1):\r\n su=0\r\n for i in s:\r\n su+=int(i)\r\n \r\n s=''\r\n for i in str(su):\r\n s+=str(i)\r\n \r\n \r\n j+=1\r\nprint(j)", "import sys\ninput = sys.stdin.readline\nimport math\n\ndef inpit(): #int\n return(int(input()))\ndef inplt(): #list \n return(list(map(int,input().split())))\ndef inpstr(): #string\n s = input()\n return(list(s[:len(s) - 1]))\ndef inpspit(): #spaced intergers \n return(map(int,input().split()))\n\nn= str(inpit())\n \nif(len(n) ==1):\n print(0)\nelse:\n t = 0\n while(True):\n n = str(sum([int(i) for i in n]))\n t = t +1 \n if(len(n)==1):\n print(t)\n break", "def main(): \r\n ans=0\r\n s=input()\r\n \r\n num=0\r\n if(len(s)==1):\r\n print(0)\r\n return \r\n else: \r\n for x in s:\r\n num+=int(x)\r\n ans+=1\r\n \r\n while(num//10!=0):\r\n s=str(num)\r\n num=0\r\n for x in s: \r\n num+=int(x)\r\n ans+=1\r\n print(ans)\r\n\r\n \r\nmain()", "def sum_of_digits(num):\r\n return sum(int(digit) for digit in str(num))\r\n\r\n\r\ndef magic_transformations(n):\r\n count = 0\r\n while n >= 10:\r\n n = sum_of_digits(n)\r\n count += 1\r\n return count\r\n\r\n\r\n# Read input\r\nn = int(input().strip())\r\n\r\n# Calculate and print the result\r\nresult = magic_transformations(n)\r\nprint(result)\r\n", "n=input()\r\nk=0\r\nwhile (len(n)!=1):\r\n s=0\r\n for i in n:\r\n s+=int(i)\r\n n=str(s)\r\n k+=1\r\nprint(k) ", "n=input()\r\nn=list(n)\r\nct=0\r\nwhile(len(n)!=1):\r\n ans=0\r\n for i in range(len(n)):\r\n ans+=int(n[i])\r\n\r\n temp=str(ans)\r\n temp=list(temp)\r\n n=temp\r\n ct+=1\r\n\r\nprint(ct)\r\n\r\n\r\n\r\n", "n = int(input())\ncnt = 0\nwhile n > 9:\n sum = 0\n for i in str(n):\n sum += int(i)\n n = sum\n cnt += 1\nprint(cnt)\n\t\t\t\t\t\t\t\t \t\t\t \t \t \t \t\t\t\t \t\t", "n=input()\r\nc=0\r\nwhile(len(n)!=1):\r\n n=str(sum(int(i) for i in n))\r\n c+=1\r\nprint(c)\r\n ", "# LUOGU_RID: 102214607\ndef f(x):\n t=0\n for i in x:t+=int(i)\n return t\nwhile True:\n try:\n s=input().strip()\n n=0\n while int(s)>=10:\n s=f(str(s))\n n+=1\n print(n)\n except:\n break\n\n", "num = tuple(int(x) for x in input())\r\nif len(num) == 1:\r\n print(0)\r\n raise SystemExit(0)\r\n\r\ncount = 1\r\nwhile True:\r\n num = tuple(int(x) for x in str(sum(num)))\r\n if len(num) == 1:\r\n print(count)\r\n break\r\n count += 1", "def func(n):\r\n sum = 0\r\n while n > 0:\r\n sum += n % 10\r\n n //= 10\r\n return sum\r\n\r\n\r\ndef main():\r\n s = input()\r\n if len(s) != 1:\r\n sum = 0\r\n for i in range(len(s)):\r\n sum += int(s[i])\r\n\r\n cnt = 1\r\n while sum >= 10:\r\n ans = sum\r\n sum = func(ans)\r\n cnt += 1\r\n print(cnt)\r\n else:\r\n print(\"0\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=input()\r\nc=0\r\n\r\nwhile(len(a)>1):\r\n\tc+=1\r\n\ts=0\r\n\tfor i in range(len(a)):\r\n\t\ts+=int(a[i])\r\n\ta=str(s)\r\n\t\r\nprint(c)\r\n", "def sum(a):\r\n c = 0\r\n for el in a:\r\n c+=int(el)\r\n return str(c)\r\n\r\ndef main():\r\n c = 0\r\n a = input()\r\n if int(a) < 9:\r\n print(0)\r\n return\r\n while int(a)>9:\r\n a = sum(a)\r\n c+=1\r\n print(c)\r\nmain()\r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n counter=0\r\n while n>9 :\r\n counter+=1\r\n n = sum(map(int,str(n)))\r\n print(counter)\r\n", "l = [*map(int, input().strip())]\r\n\r\ncount = 0\r\nwhile len(l) > 1:\r\n count += 1\r\n s = 0\r\n for d in l:\r\n s += d\r\n l = [*map(int, str(s))]\r\n\r\nprint(count)", "n = int(input())\n\ndef _sum_digits(n):\n\n res = 0\n \n while n:\n digit = n % 10\n res += digit\n\n n //= 10\n\n return res\n\n\ndef sum_digits(n):\n s = str(n)\n return sum([int(c) for c in s])\n\ns = n\ni = 0\nwhile s >= 10:\n s = sum_digits(s)\n i += 1\n\nprint(i)\n", "s=input()\r\nc=0\r\nwhile(len(s)>1):\r\n a=map(int,str(s))\r\n c+=1\r\n s=str(sum(a))\r\nprint(c) ", "n = int(input())\r\nans = 0\r\nwhile n > 9:\r\n ans += 1\r\n n = sum(list(map(int, str(n))))\r\nprint(ans)\r\n", "t = 1\r\nfor _ in range(t):\r\n\r\n s = input()\r\n if len(s) == 1:\r\n print(0)\r\n continue\r\n tot = 0\r\n count = 1\r\n for i in s:\r\n tot += int(i)\r\n while len(str(tot)) > 1:\r\n count += 1\r\n tot2 = str(tot)\r\n tot = 0\r\n for i in tot2:\r\n tot += int(i)\r\n print(count)\r\n\r\n\r\n", "def mAgIc(n):\r\n k=0\r\n while n>9:\r\n k+=1\r\n n=sum([int(i) for i in str(n)])\r\n return k\r\nn=int(input())\r\nprint(mAgIc(n))", "def func(n):\r\n digits = [int(i) for i in n]\r\n r = 0\r\n \r\n if len(digits) == 1:\r\n return 0\r\n \r\n while len(digits) != 1:\r\n digits_sum = sum(digits)\r\n digits = [int(i) for i in str(digits_sum)]\r\n r += 1\r\n \r\n return r\r\n\r\n\r\nn = input()\r\nprint(func(n))\r\n", "def getSum(n): \r\n\tsm = 0\r\n\tfor digit in str(n): \r\n\t sm += int(digit)\t \r\n\treturn sm\r\n\t\r\nn = input()\r\nnum = int(n)\r\nsm = getSum(num)\r\nans = 0\r\nwhile len(n) > 1:\r\n num = sm\r\n n = str(num)\r\n sm = getSum(num)\r\n ans += 1\r\nprint(ans)\r\n \r\n", "n = list(input())\r\nb = [int(i) for i in n]\r\ncount = 0\r\nwhile len(n) > 1:\r\n result = sum(b)\r\n n = list(str(result))\r\n b = [int(i) for i in n]\r\n count += 1\r\nprint(count)", "n = input()\r\ns = 0\r\nwhile len(n) != 1:\r\n s += 1\r\n n = list(n)\r\n n = list(map(int, n))\r\n n = sum(n)\r\n n = str(n)\r\nprint(s)", "n = input()\r\n\r\ncount =0\r\n\r\nwhile len(n) > 1 :\r\n sum =0\r\n for x in n:\r\n sum+= int(x)\r\n n = str(sum)\r\n count+=1\r\nprint(count)", "from ast import Str\r\n\r\n\r\nN = input()\r\n\r\noutput = 0\r\nif len(N) == 0:\r\n output = 0\r\nelse:\r\n \r\n while(len(N) != 1):\r\n digits = 0\r\n for digit in N:\r\n digits += int(digit)\r\n N = str(digits)\r\n output += 1\r\nprint(output) \r\n \r\n\r\n ", "\r\na=int(input())\r\nb=str(a)\r\ncount=0\r\nwhile len(b)!=1:\r\n add=0\r\n for i in b:\r\n add=add+int(i)\r\n b=str(add)\r\n count=count+1 \r\n #print(b)\r\nprint(count)", "o = input()\r\no2 = 0\r\ncount = 0\r\nwhile len(o) != 1:\r\n for i in o:\r\n o2 += int(i)\r\n o = str(o2)\r\n count += 1\r\n o2 = 0\r\nprint(count)", "n = input()\r\n\r\ncounter = 0\r\nsumm = 0\r\n\r\nif len(n) > 1:\r\n for i in n:\r\n summ += int(i)\r\n counter += 1\r\n while summ > 9:\r\n newSum = 0\r\n while summ > 0:\r\n newSum += summ % 10\r\n summ //= 10\r\n summ = newSum\r\n counter += 1\r\n print(counter)\r\nelse:\r\n print(0)", "n = input()\r\nc = 0\r\n\r\nwhile int(n) > 9:\r\n\ttemp = 0\r\n\r\n\tc += 1\r\n\r\n\tfor i in n :\r\n\t\ttemp += int(i)\r\n\r\n\tn = str(temp)\r\n\t# print(temp)\r\n\r\n\r\nprint(c)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ns=input()\r\nn=len(s)\r\nc=0\r\nwhile(n>1):\r\n s1=0\r\n for i in range(n):\r\n s1+=int(s[i])\r\n s1=str(s1)\r\n s=s1\r\n n=len(s1)\r\n c+=1\r\nprint(c)", "import sys\r\nimport os\r\nimport copy\r\n\r\ncin = [\r\n\tlambda: input(),\r\n\tlambda: int(input()),\r\n\tlambda: input().split(),\r\n\tlambda: [int(a) for a in input().split()],\r\n]\r\n\r\ndef solve():\r\n\tn = cin[0]()\r\n\tans = 0\r\n\r\n\twhile len(n)!=1:\r\n\t\ts = 0\r\n\t\tfor c in n:\r\n\t\t\ts += int(c)\r\n\t\tn = str(s)\r\n\t\tans += 1\r\n\tprint(ans)\r\n\r\ndef main():\r\n\tif os.path.exists('input.txt'):\r\n\t\tsys.stdin = open('input.txt', 'r')\r\n\t\tsys.stdout = open('output.txt', 'w')\r\n \r\n\tt = 1\r\n\t# t = cin[1]()\r\n \r\n\twhile t:\r\n\t\tt -= 1\r\n\t\tsolve()\r\n \r\nmain()", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\ndef solve():\r\n s = input()\r\n n = 0\r\n\r\n if len(s) == 1: return 0\r\n\r\n for c in s:\r\n n += int(c)\r\n\r\n ans = 1\r\n while n >= 10:\r\n n = sum(map(lambda x: int(x), str(n)))\r\n ans += 1\r\n\r\n return ans\r\n\r\nprint(solve())\r\n", "# Problem Statement - https://codeforces.com/problemset/problem/102/B\r\n\r\nn = int(input())\r\n\r\nc = 0\r\nwhile n > 9:\r\n n = sum(map(int, str(n)))\r\n c += 1\r\nif n == 0:\r\n print(0)\r\nelse:\r\n print(c)", "def sum(n):\r\n s,f=str(n),0\r\n for i in s:f+=int(i)\r\n return f\r\nn=int(input())\r\nif n//10==0:print(0)\r\nelse:\r\n s,f=n,0\r\n while(1):\r\n s=sum(s)\r\n f+=1\r\n if s//10==0:break\r\n print(f)", "z=input()\r\no=0\r\nwhile len(z)>1:\r\n c=0\r\n for i in z:\r\n c+=int(i)\r\n z=str(c)\r\n o+=1\r\nprint(o)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "num = input()\r\n\r\ncount = 0\r\nsum = 0\r\nwhile len(num) != 1:\r\n for n in num:\r\n sum += int(n)\r\n num = str(sum)\r\n sum = 0\r\n count += 1\r\n\r\n\r\nprint(count)\r\n\r\n", "# LUOGU_RID: 126101527\nn=int(input())\ns=0\nwhile n>9:\n n=sum(map(int,list(str(n))))\n s+=1\nprint(s)", "n = input()\r\nt = 0\r\nwhile len(n)>1:\r\n total = 0\r\n for i in n:\r\n total +=int(i)\r\n t+=1\r\n n = str(total)\r\nprint(t)", "n=int(input())\r\ncount=0\r\nwhile n>9:\r\n l=map(int,(list(str(n))))\r\n \r\n n=sum(l)\r\n count+=1\r\n \r\n\r\nprint(count)", "count=0\ndef c(s):\n\tglobal count\n\tcount+=1\n\tl=list(s)\n\texp=0\n\tfor e in l:\n\t\texp=exp+int(e)\n\treturn str(exp)\ns=input()\nwhile(len(s)>1):\n\ts=c(s)\nprint(count)\n\t\t \t \t\t \t \t \t \t\t \t\t \t \t\t\t", "num = int(input())\nn = list(map(int, str(num)))\ntotal = 0\nwhile int(num) > 9:\n total += 1\n n = list(map(str, str(sum(n))))\n num = ''.join(n)\n n = list(map(int, n))\nprint(total)", "n=[int(x) for x in input()]\r\ncnt=0\r\nif(len(n)==1):\r\n print(cnt)\r\nelse:\r\n while(1):\r\n s=0\r\n for x in n:\r\n s+=x\r\n cnt+=1\r\n if(len(str(s))==1):\r\n print(cnt)\r\n break\r\n n=[int(x) for x in str(s)]", "n = input()\r\nlstn = list(n)\r\n\r\n\r\ncount = 0\r\nsumnum = 0\r\n\r\nwhile len(lstn) > 1:\r\n for i in lstn:\r\n sumnum += int(i)\r\n count += 1\r\n lstn = list(str(sumnum))\r\n sumnum = 0\r\n \r\n\r\nprint(count)\r\n", "n = input()\n\ncou = 0\n\nwhile len(n) > 1:\n sum = 0\n for i in range(len(n)):\n sum+= int(n[i])\n n = str(sum)\n cou+=1\nprint(cou)", "def how(n,c):\n if n<=9:\n return c\n else:\n s = sum([int(i) for i in str(n)])\n return how(s,c+1)\nt = int(input())\nprint(how(t,0))\n", "num = int(input())\r\ncounter = 0\r\nnumm = 0\r\nwhile len(str(num)) > 1 :\r\n for i in str(num) :\r\n numm += int(i)\r\n num = numm\r\n numm=0\r\n counter+=1\r\nprint(counter)", "n=input()\r\ncount=0\r\nm=0\r\nwhile(len(n)>1):\r\n m=0\r\n for i in n:\r\n m+=int(i,10)\r\n n=str(m)\r\n count+=1 \r\nprint(count)\r\n\r\n \r\n \r\n\r\n\r\n", "#%% \r\ndigit_sum = lambda x: sum(map(int, list(x)))\r\n\r\nnum = input()\r\ncounter = 0\r\n\r\nwhile len(num) > 1: \r\n\r\n num = str(digit_sum(num))\r\n counter += 1\r\n\r\nprint(counter)", "a=input()\r\ncuteness=0\r\nwhile len(a)>1:\r\n k=0\r\n for i in a:\r\n k+=int(i)\r\n a=str(k)\r\n cuteness+=1\r\nprint(cuteness)", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\nfrom functools import lru_cache\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# sys.stdin = open('input.txt')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\n\r\n\r\ndef ip(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\n\r\n\r\n@lru_cache(None)\r\ndef daa(n):\r\n ct = 0\r\n for x in range(1, int(pow(n, 0.5)) + 1):\r\n if n % x == 0:\r\n ct += 1\r\n if x != n // x:\r\n ct += 1\r\n return ct\r\np=nt()\r\n\r\nct=0\r\nwhile p>9:\r\n p=list(str(p))\r\n ans=0\r\n for x in p:\r\n ans+=int(x)\r\n p=ans\r\n ct+=1\r\nprint(ct)", "def combine(num):\r\n\ttotal = 0\r\n\tfor i in range(len(num)):\r\n\t\ttotal+=int(num[i])\r\n\treturn total\r\n\r\ndef sum_of_digits():\r\n\tnum = int(input())\r\n\tif num ==0:\r\n\t\treturn 0\r\n\r\n\tcounter = 0\r\n\twhile int(num)>9:\r\n\t\tcounter+=1\r\n\t\tnum = combine(str(num))\r\n\r\n\r\n\treturn counter\r\n\r\nprint(sum_of_digits())", "n = input()\r\nl = len(n)\r\nans = 0\r\nif l == 1:\r\n print(0)\r\nelse:\r\n while l > 1:\r\n ans += 1\r\n m = list(n)\r\n c = 0\r\n for i in m:\r\n c += int(i)\r\n n = str(c)\r\n l = len(n)\r\n print(ans)", "n = int(input())\r\nc = 0\r\n\r\nwhile n > 9:\r\n n = sum([int(i) for i in str(n)])\r\n c += 1\r\n\r\nprint(c)\r\n", "n=input()\r\nres=0\r\nwhile len(n)>1:\r\n c=0\r\n for j in n:\r\n c+=int(j)\r\n n=str(c)\r\n res+=1\r\nprint(res)", "i = list(map(str, input()))\r\nc = 0\r\nwhile len(i) != 1:\r\n c += 1\r\n i = list(str(sum(list(map(int, i)))))\r\nprint(c)", "def calculate_sum_of_digits(number_str):\r\n digitsum = sum(int(digit) for digit in number_str)\r\n times = 1\r\n\r\n while digitsum > 9:\r\n m = digitsum\r\n digitsum = sum(int(digit) for digit in str(m))\r\n times += 1\r\n\r\n return times\r\n\r\n\r\nif __name__ == \"__main__\":\r\n digits = input()\r\n times = 0\r\n\r\n if digits[1:] != \"\": # Check if there are more than one digits in the input\r\n times = calculate_sum_of_digits(digits)\r\n\r\n print(times)\r\n", "a=int(input())\r\nb=list(str(a))\r\nc=0\r\ne=0\r\nif(len(b)==1):\r\n print(0)\r\nelse:\r\n while(len(b)!=1):\r\n for i in b:\r\n c+=int(i)\r\n\r\n b.clear()\r\n for j in str(c):\r\n b.append(j)\r\n c=0\r\n e+=1\r\n print(e)", "n=input()\r\nans=0\r\nwhile len(n)!=1:\r\n ans+=1\r\n a=0\r\n for x in range(len(n)):\r\n a+=int(n[x])\r\n n=str(a)\r\nprint(ans)\r\n", "n=input()\r\ncount=0\r\nwhile len(n)!=1:\r\n ds=0\r\n for i in n:\r\n ds+=int(i)\r\n n=str(ds)\r\n count+=1\r\nprint(count)", "n=input()\r\ncnt=0\r\n\r\ndef digitsum(s):\r\n sum=0\r\n for i in s:\r\n sum=sum+int(i)\r\n return str(sum)\r\n\r\n\r\nwhile(len(n)!=1):\r\n cnt=cnt+1\r\n n=digitsum(n)\r\n\r\nprint(cnt)\r\n\r\n", "def sum_of_nums(number):\r\n number = [int(i) for i in str(number)]\r\n number = sum(number)\r\n return number\r\n\r\n\r\na = int(input())\r\ncount = 0\r\nwhile a > 9:\r\n a = sum_of_nums(a)\r\n count += 1\r\nprint(count)\r\n", "\nn = int(input())\n\nnow = n\nans = 0\n\nwhile now // 10 > 0:\n \n string = str(now)\n temp = 0\n for i in range(len(string)):\n temp += int(string[i])\n # print(ans)\n ans += 1\n now = temp\n\nprint(ans)\n \t \t\t\t \t \t \t\t \t\t \t\t", "def s(k):\r\n suma=0\r\n for i in k:\r\n suma +=int(i)\r\n return suma\r\nn=str(input())\r\nans=0\r\nn=str(n)\r\nif int(n)>9:\r\n while s(n)>9:\r\n n=s(n)\r\n n=str(n)\r\n ans +=1\r\n print(ans+1)\r\nelse:\r\n ans=0\r\n print(ans)", "import sys\r\nn= list(sys.stdin.readline().strip())\r\nc=0\r\nwhile len(n)!=1:\r\n pre=[0] *( len(n)+1)\r\n for i in range(len(n)):\r\n pre[i+1]= pre[i] + int(n[i])\r\n n= str(pre[-1])\r\n c+=1\r\nprint(c)", "a = list(map(int, list(input())))\nsums = 0\n\n\nwhile len(a) > 1:\n sums += 1\n b = 0\n for i in a:\n b += i\n a = list(map(int, list(str(b))))\nprint(sums)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jul 28 09:00:33 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 5 - CF102-DIV2B\r\n\"\"\"\r\n\r\nn = str(input())\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n ans = 1\r\n n = sum(int(x) for x in list(n))\r\n while n > 9:\r\n n = sum(int(x) for x in list(str(n)))\r\n ans += 1\r\n print(ans)", "def digit_sum(n):\n return sum(int(d) for d in str(n))\n\ndef count_steps(n):\n ans = 0\n while n > 9:\n n = digit_sum(n)\n ans += 1\n return ans\n\nn = int(input().strip())\nprint(count_steps(n))\n", "# Time limit exceeded\n#########\n# n = int(input())\n# count = 0 \n# while n > 9:\n# count += 1\n# t = 0\n# while n > 0:\n# t += n % 10\n# n //= 10\n# n = t\n# print(count)\n\n# string version\nn = input()\ncount = 0\ntotal = 0\nwhile len(n) > 1:\n count += 1\n total = 0\n for i in range(len(n)):\n total += int(n[i])\n n = str(total)\nprint(count)", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta=read()\n\tr=0\n\twhile len(a)>1:\n\t\ta=str(sum([ord(x)-ord('0') for x in a]))\n\t\tr+=1\n\tprint(r)\n\nsolve()\n", "\r\ndef solve(n):\r\n \r\n if len(n) == 1:\r\n return 0\r\n \r\n m = 0 \r\n for x in n:\r\n m += int(x)\r\n \r\n return 1 + solve(str(m))\r\n\r\nprint(solve(input()))", "n = input()\r\nans = 0\r\n\r\nwhile(len(n) > 1):\r\n\r\n sum = 0\r\n for digit in n:\r\n sum += int(digit)\r\n\r\n n = str(sum)\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "# B. Sum of Digits\r\nn=input()\r\nif len(n)==1:\r\n print(0)\r\nelse:\r\n c=0\r\n while len(n)>1:\r\n a=0\r\n for s in n:\r\n a+=int(s)\r\n c+=1\r\n n=str(a)\r\n print(c)\r\n ", "s=input()\r\n\r\nl=list(map(int,s))\r\n\r\nif(len(s)==1):\r\n print(0)\r\nelse:\r\n a=1\r\n while True:\r\n b=sum(l)\r\n if(len(str(b))==1):\r\n break\r\n else:\r\n s=str(b)\r\n l=list(map(int,s))\r\n a+=1\r\n\r\n print(a)\r\n", "n = input()\nsum = 0\nfor i in range(len(n)): sum += int(n[i])\nif (len(n) == 1): itr = 0\nelse:\n\titr = 1\n\twhile sum > 9:\n\t\tnewSum = 0\n\t\twhile sum > 0:\n\t\t\tnewSum += sum % 10\n\t\t\tsum //= 10\n\t\tsum = newSum\n\t\titr += 1\nprint(itr)\n\t \t \t\t\t\t\t\t\t\t \t\t \t\t\t \t \t", "n = input()\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n s = 0\r\n while len(n) != 1:\r\n x = list(n)\r\n for i in range(len(x)):\r\n x[i] = int(x[i])\r\n n = str(sum(x))\r\n s = s + 1\r\n print(s)\r\n\r\n", "n= input()\r\nb=0\r\ns=0\r\nc=0\r\nwhile len(str(n))>1:\r\n\tfor i in range (len(str(n))) :\r\n\t\ts=s+int(str(n[i]))\r\n\tn=str(s)\r\n\tb=b+1\r\n\ts=0\r\nprint(b)\r\n\r\n\r\n", "n=list(input())\r\nx=[]\r\nfor i in n:\r\n x.append(int(i))\r\n# print(x)\r\nc=0\r\nxx=0\r\nwhile(len(x)>1):\r\n xx=sum(x)\r\n x=[]\r\n for i in str(xx):\r\n x.append(int(i))\r\n # print(x)\r\n # x=list(str(xx))\r\n c+=1\r\nprint(c)", "n = input()\r\ncount = 0\r\nwhile int(n) >= 10:\r\n n = str(sum([int(i) for i in n]))\r\n count += 1 \r\nprint(count)", "a = int(input())\r\nh = str(a)\r\np = len(h)\r\nl = 0\r\nwhile(p > 1):\r\n t = 0\r\n for x in range(p):\r\n t += int(h[x])\r\n\r\n h = str(t)\r\n p = len(h)\r\n l += 1\r\n\r\nprint(l)\r\n", "\r\n\r\nif __name__ == '__main__':\r\n n = input()\r\n if len(n) == 1:\r\n print(0)\r\n else:\r\n sum = 0\r\n count = 1\r\n for i in n:\r\n sum += int(i)\r\n while sum >= 10:\r\n temp = 0\r\n while sum > 0:\r\n temp += sum%10\r\n sum//=10\r\n sum = temp\r\n count += 1\r\n print(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n =input()\r\nn = [i for i in n ]\r\nx = None\r\ncounter = 0\r\nwhile len(n) >1 : \r\n x= sum(map(int,n))\r\n n = [i for i in str(x)]\r\n counter += 1\r\nprint(counter)", "n = int(input())\r\ncount = 0\r\nwhile n > 9:\r\n n = sum(map(int, str(n)))\r\n count += 1\r\n\r\nprint(count)", "def solve() -> None:\n n = input()\n t = 0\n\n while len(n) > 1:\n n = str(sum(int(x) for x in str(n)))\n t += 1\n\n print(t)\n\nif __name__ == \"__main__\":\n\n\tt = 1\n\t# t = int(input())\n\tfor _ in range(t):\n\t\tsolve()\n", "n = int(input())\r\ncount = 0\r\nwhile len(str(n)) > 1:\r\n n = sum(list(map(int, str(n))))\r\n count += 1\r\nprint(count)", "n = int(input())\r\ncounter = 0\r\nwhile n >= 10:\r\n string_n = str(n)\r\n sum_of_digits = 0\r\n for digit in string_n:\r\n sum_of_digits += int(digit)\r\n n = sum_of_digits\r\n counter += 1\r\n \r\n \r\nprint(counter)", "n = input()\r\nl = len(n)\r\ncount=0\r\nwhile(l>1):\r\n sum=0\r\n for i in range(0,l):\r\n sum = sum + int(n[i])\r\n n = str(sum)\r\n l = len(n)\r\n count+=1\r\nprint(count)", "# your code goes here\r\n\r\nfrom sys import stdin, stdout\r\n\r\ndef sumdig(s):\r\n\tsumm = 0\r\n\tfor c in s:\r\n\t\tsumm += int(c)\r\n\t\t\r\n\treturn str(summ)\r\n\t\r\nn = stdin.readline().strip()\r\ncount = 0\r\nwhile len(n) > 1:\r\n\tn = sumdig(n)\r\n\tcount += 1\r\n\t\r\n\t\r\nstdout.write(str(count))", "############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Sum_of_Digits2():\r\n n = input()\r\n n = n.strip() #has an extra '\\n' at the end\r\n \r\n steps = 0\r\n while int(n) >= 10:\r\n steps += 1\r\n sum = 0\r\n for digit in n:\r\n sum += int(digit)\r\n n = str(sum)\r\n n = n.strip()\r\n print(steps)\r\n \r\nSum_of_Digits2()", "n = input()\r\n\r\ntotal = 0\r\ncount = 0\r\n\r\nwhile int(n) > 9:\r\n for i in range(len(n)):\r\n total += int(n[i])\r\n\r\n count += 1\r\n n = str(total)\r\n total = 0\r\nprint(count)\r\n", "n = input()\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n sum1 = 0\r\n for num in n:\r\n sum1 += int(num)\r\n count = 1\r\n sum_str = str(sum1)\r\n while len(sum_str) > 1:\r\n sum1 = sum(map(int, sum_str))\r\n sum_str = str(sum1)\r\n count += 1\r\n print(count)\r\n\r\n\r\n", "n = list(map(int, input()))\r\ni = 0\r\nwhile True:\r\n\tif len(n) == 1:\r\n\t\tprint(i)\r\n\t\tbreak\r\n\tn = str(sum(n))\r\n\tn = list(map(int, n))\r\n\ti += 1", "def rec(n, ctr=0):\r\n if len(str(n)) == 1:\r\n print(ctr)\r\n return\r\n rec(sum(map(int, list(str(n)))), ctr + 1)\r\n\r\n\r\nn = int(input())\r\nrec(n)", "x=input()\r\nc=0\r\nwhile len(x)>1:\r\n y=list(map(int,x))\r\n x=str(sum(y))\r\n c+=1\r\nprint(c)", "def sum_digit(x):\r\n sum = 0\r\n for i in range(0, len(x)):\r\n sum += int(x[i])\r\n sum = str(sum)\r\n return sum\r\n\r\nans = 0\r\nn = input()\r\nwhile(len(n) > 1):\r\n ans += 1 \r\n n = sum_digit(n)\r\nprint(ans)", "n=input()\r\ncnt=0\r\nwhile len(n)>1:\r\n sum=0\r\n for i in n:\r\n sum+=int(i)\r\n n=str(sum)\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nnum_of_times = 0\r\nwhile len(str(n)) > 1:\r\n n_chars = [*str(n)]\r\n n = 0\r\n for number in n_chars:\r\n n += int(number) \r\n num_of_times += 1\r\nprint(num_of_times)", "s=input()\r\nans=0\r\nwhile(len(s)>1):\r\n ans+=1\r\n sup=0\r\n for i in s :\r\n sup+=int(i)\r\n s=str(sup)\r\nprint(ans)", "n = input()\r\ncount = 0\r\nwhile len(n) > 1:\r\n s = 0\r\n for i in range(len(n)):\r\n s += int(n[i])\r\n n = str(s)\r\n count += 1\r\nprint(count)", "n = input()\r\n\r\ndef func(n,t=0):\r\n if len(n)==1:\r\n return t\r\n m = 0\r\n for i in n:\r\n m += int(i)\r\n t +=1\r\n return func(str(m),t)\r\n\r\nprint(func(n))", "def sum_of_digits(n): \r\n c = 0 \r\n for i in n:\r\n c += int(i)\r\n return c\r\nn = input()\r\nresult = 0\r\nwhile len(n) > 1: \r\n n = str(sum_of_digits(n))\r\n result += 1\r\nprint(result)", "str1 = input()\ncnt = 0\nl = len(str1)\nwhile(l>1):\n s = 0\n for i in range(l):\n s+=int(str1[i])-int('0')\n str1 = str(s) \n l = len(str1) \n cnt+=1\nprint(cnt) \n\n\t \t \t \t\t \t\t \t \t \t \t \t", "n = input()\r\nans = 0\r\nif len(n) == 1:\r\n ans = 0\r\nwhile len(n) > 1:\r\n sum = 0\r\n for i in range(len(n)):\r\n sum += int(n[i])\r\n n = str(sum)\r\n ans += 1\r\nprint(ans)", "a = map(int,input())\r\nlis=list(a)\r\ncounter = 0\r\nwhile True:\r\n if len(lis)<=1:\r\n break\r\n b = sum(lis)\r\n z=str(b)\r\n lis=list(map(int,z))\r\n counter+=1\r\nprint(counter)", "n = int(input())\r\nk = 0\r\nwhile n > 9: \r\n s = str(n).replace(\"\",\".\").split(\".\")\r\n del(s[0])\r\n del(s[len(s)-1])\r\n n = sum(list(map(int,s)))\r\n k = k + 1\r\nprint(k)", "string = input()\r\ncount = 0\r\nwhile len(string) > 1:\r\n string = str(sum(map(int, string)))\r\n count += 1\r\nprint(count) ", "number = input()\r\n\r\ndef step_finder(number):\r\n if len(number) == 1:\r\n print(0)\r\n else:\r\n counter = 0\r\n while len(number) > 1:\r\n newnumber = str(sum([int(i) for i in number]))\r\n number = newnumber\r\n counter += 1\r\n print(counter)\r\n \r\nstep_finder(number)\r\n ", "def get_sum(a):\r\n sum = 0\r\n for i in range(len(a)):\r\n sum += int(a[i])\r\n return sum\r\nn = int(input())\r\na = list(str(n))\r\ncount = 0\r\nwhile len(a) != 1:\r\n count += 1\r\n s = get_sum(a)\r\n a = list(str(s))\r\nprint(count)", "n = input()\r\nsum = 0\r\ncount = 0\r\n\r\nwhile int(n)>9:\r\n for i in range(len(n)):\r\n sum += int(n[i])\r\n count += 1\r\n n = str(sum)\r\n sum = 0\r\nprint(count)\r\n", "string1 = input()\r\ncount = 0\r\nlength = len(string1)\r\nwhile length > 1:\r\n x = 0\r\n for i in range(length):\r\n x += int(string1[i])\r\n string1 = str(x)\r\n length = len(string1)\r\n count += 1\r\nprint(count)", "n=int(input())\r\ns=0\r\nwhile n>9:\r\n n=sum(map(int,list(str(n))))\r\n s+=1\r\nprint(s)", "n = input()\r\nsum = 20\r\ncount = 0\r\n\r\nwhile sum >=10 and int(n)>=10:\r\n sum = 0\r\n for i in n:\r\n sum = sum + int(i)\r\n n = str(sum)\r\n count = count +1\r\n # print(sum)\r\n \r\nprint(count)", "s = input()\r\nans = 0\r\nwhile len(s) != 1:\r\n s = str(sum(int(i) for i in s))\r\n ans += 1\r\nprint(ans)\r\n", "def suma(a):\r\n c=\" \".join(a)\r\n w=[]\r\n for q in c.split():\r\n w.append(int(q))\r\n s=sum(w)\r\n return s\r\nk=0\r\na=str(input())\r\nif len(a)==1:\r\n print(0)\r\nelse:\r\n while len(a)>1:\r\n s=suma(a)\r\n k+=1\r\n a=str(s)\r\n print(k)\r\n", "num = input()\r\n\r\nout = 0\r\nwhile len(num) > 1:\r\n num = str(sum(map(int, num)))\r\n out += 1\r\n\r\nprint(out)\r\n", "s = input()\r\nss = 0\r\nfor c in s:\r\n ss+=int(c)\r\nif len(s)==1:\r\n print(0)\r\nelse:\r\n cnt = 1\r\n while ss>9:\r\n cnt += 1\r\n tt = ss\r\n ss = 0\r\n while tt!=0:\r\n ss += tt%10\r\n tt //= 10\r\n\r\n print(cnt)\r\n", "n=input()\r\ncount=0\r\nSum=0\r\n\r\nwhile(len(n)!=1):\r\n for i in n:\r\n a=int(i)\r\n Sum+=a\r\n n=str(Sum)\r\n count+=1\r\n Sum=0;\r\n\r\n\r\n\r\nprint(count)\r\n\r\n", "def solve():\r\n s = input()\r\n ans = 0\r\n while len(s) > 1:\r\n s = str(sum(map(int, s)))\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "res = 0\r\nnum = input()\r\nwhile len(num) > 1:\r\n curr_num = 0\r\n for i in num:\r\n curr_num += int(i)\r\n num = str(curr_num)\r\n res += 1\r\nprint(res)\r\n", "from sys import stdin\r\nimport math\r\n\r\ndef main():\r\n s = stdin.readline().strip()\r\n if len(s) < 2:\r\n print(0)\r\n else:\r\n cnt, x = 0, 11\r\n while x >= 10:\r\n x = 0\r\n for i in s:\r\n x += int(i)\r\n s = str(x)\r\n cnt += 1\r\n print(cnt)\r\n\r\nmain()", "n = input()\r\n \r\ndef sod(n):\r\n s = 0\r\n for digit in n:\r\n s = s + int(digit)\r\n return s\r\nc = 0\r\nwhile int(n) >= 10:\r\n n = sod(n)\r\n n = str(n)\r\n c = c + 1\r\nprint(c)\r\n", "n = (input())\r\n\r\ni = 0\r\nwhile len(n) > 1:\r\n i += 1\r\n s = 0\r\n for j in range (1, 10):\r\n s += n.count(chr(j + ord('0'))) * j\r\n n = str(s)\r\n\r\nprint(i)", "num=input()\r\ncount=0\r\nwhile len(num)>1:\r\n num=str(sum(map(int,num)))\r\n count+=1\r\nprint(count)", "s = input()\r\n\r\ndef get():\r\n summ = 0\r\n for i in s:\r\n summ += int(i)\r\n return str(summ)\r\n\r\n\r\nc = 0\r\nwhile len(s) > 1:\r\n s = get()\r\n c += 1\r\n\r\n\r\nprint(c)", "n = str(input())\r\ncnt = 0\r\nwhile len(n) > 1:\r\n nn = 0\r\n for c in n:\r\n nn += int(c)\r\n n = str(nn)\r\n cnt += 1\r\nprint(cnt)\r\n", "def sumOfDigits(n):\r\n\tsum = 0\r\n\tfor digit in str(n): \r\n\t\tsum += int(digit) \r\n\treturn sum\r\n\r\na = int(input())\r\nn=0\r\nwhile a > 9:\r\n\ta = sumOfDigits(a)\r\n\tn+=1\r\nprint(n)\r\n\r\n", "def sumdigits(n):\r\n sum=0\r\n while(n>0):\r\n sum=sum+n%10\r\n n=n//10\r\n return sum\r\n\r\nn=list(input())\r\nn=list(map(int,n))\r\nk=len(n)\r\nif(k<=1):\r\n print(\"0\")\r\nelse:\r\n count=1\r\n temp=0\r\n for i in range(k):\r\n temp=temp+n[i]\r\n while(temp>=10):\r\n temp=sumdigits(temp)\r\n count+=1\r\n print(count)", "# LUOGU_RID: 113734618\na=input();b=0\nwhile len(a)-1:\n a=str(sum([int(i) for i in a]));b+=1\nprint(b)", "n = int(input())\r\nif len(str(n))>1:\r\n # sm = sum(int(i) for i in str(n))\r\n cnt = 0\r\n while len(str(n))>1:\r\n n = sum(int(i) for i in str(n))\r\n cnt+=1\r\n print(cnt)\r\nelse:\r\n print(0)", "inp = input()\r\ncheck = len(inp)\r\ninp = inp.replace('0','')\r\nans = 0\r\n\r\nwhile (check > 1):\r\n digsum = str(sum(map(int,inp)))\r\n check = len(digsum)\r\n inp = digsum.replace('0','')\r\n ans += 1\r\n\r\nprint(ans)", "from sys import stdin\r\n\r\ndef summ(l):\r\n ans = 0\r\n for elem in l:\r\n ans += int(elem)\r\n return ans\r\n\r\ndef solve():\r\n n = list(input())\r\n step = 0\r\n while len(n) != 1:\r\n n = list(str(summ(n)))\r\n step += 1\r\n\r\n return step\r\n\r\ndef main():\r\n print(solve())\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=input()\r\ncount=0\r\nwhile len(n)!=1:\r\n sum_ch=sum(map(int, ' '.join(n).split())) \r\n count+=1\r\n n=str(sum_ch)\r\nprint(count)", "n = input()\r\n\r\ncount = 0\r\nwhile len(n)>1:\r\n n = str(sum(map(int,list(n))))\r\n count+=1\r\nprint(count)\r\n\r\n", "num = input()\n\n\ndef dfs(n, cnt):\n if len(n) == 1:\n return cnt\n\n s = 0\n for i in n:\n s += int(i)\n cnt += 1\n return dfs(str(s), cnt)\n\n\nans = dfs(num, 0)\nprint(ans)\n", "a=input()\r\ns=0\r\nwhile len(a)>1: \r\n a=str(sum([int(i)for i in a]))\r\n s+=1\r\nprint(s)", "n = int(input())\r\ncount = 0\r\nwhile True:\r\n if n < 10:\r\n print(count)\r\n break\r\n n = sum(map(int,str(n)))\r\n count += 1", "n = input()\r\nif len(n)==1:\r\n print(0)\r\nelse:\r\n summ=0\r\n for char in n:\r\n if char != \"0\":\r\n summ+=int(char)\r\n n=str(summ)\r\n answer=1\r\n while int(n) >=10:\r\n summ=0\r\n for char in n:\r\n if char != \"0\":\r\n summ+=int(char)\r\n n = str(summ)\r\n answer+=1\r\n print(answer)\r\n", "l=list(input())\r\nnl=[int(x) for x in l]\r\nres=0\r\nwhile len(nl)>1:\r\n num=sum(nl)\r\n l=list(str(num))\r\n nl=[int(x) for x in l]\r\n res+=1\r\nprint(res)", "n = input()\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n count = 0\r\n new = n\r\n while len(new) != 1:\r\n sum = 0\r\n for i in new:\r\n sum += int(i)\r\n new = str(sum)\r\n count += 1\r\n print(count)\r\n", "n = input()\n\nif int(n) < 10:\n\tprint(0)\nelse:\n\tn = sum([int(i) for i in n])\n\tif n < 10:\n\t\tprint(1)\n\telse:\n\t\tn = sum([int(i) for i in str(n)])\n\t\tif n < 10:\n\t\t\tprint(2)\n\t\telse:\n\t\t\tn = sum([int(i) for i in str(n)])\n\t\t\tif n < 10:\n\t\t\t\tprint(3)\n\t\t\telse:\n\t\t\t\tprint(4)\n \t\t\t \t \t \t \t\t\t\t\t\t \t\t \t\t", "from collections import defaultdict, deque\r\nimport math as mt\r\n\r\ndef spell(s):\r\n\treturn str(sum(list(map(int,list(s)))))\r\n\r\ndef solve():\r\n\tn=input()\r\n\r\n\tcnt=0\r\n\r\n\twhile(len(n)!=1):\r\n\t\tn=spell(n)\r\n\t\tcnt+=1\r\n\r\n\treturn print(cnt)\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n\t# for i in range(1,16):\r\n\tsolve()\r\n", "import math\r\nfrom collections import defaultdict, Counter, deque\r\n\r\nINF = float('inf')\r\n\r\ndef gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a%b\r\n\treturn a\r\n\r\ndef isPrime(n):\r\n\tif (n <= 1): \r\n\t\treturn False\r\n\ti = 2\r\n\twhile i ** 2 <= n:\r\n\t\tif n % i == 0:\r\n\t\t\treturn False\r\n\t\ti += 1\r\n\treturn True\r\n\r\ndef primeFactor(n):\r\n\tif n % 2 == 0:\r\n\t\treturn 2\r\n\ti = 3\r\n\twhile (i ** 2) <= n:\r\n\t\tif n % i == 0:\r\n\t\t\treturn i \r\n\t\ti += 1\r\n\treturn n\r\n\r\ndef vars():\r\n\treturn map(int, input().split())\r\n\r\ndef array():\r\n\treturn list(map(int, input().split()))\r\n\r\ndef main():\r\n\tn = input()\r\n\r\n\tc = 0\r\n\twhile len(n) > 1:\r\n\t\tc += 1\r\n\t\ts = 0\r\n\t\tfor i in range(len(n)):\r\n\t\t\ts += int(n[i])\r\n\r\n\t\tn = str(s)\r\n\r\n\tprint(c)\r\n\r\n\t\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\t# t = int(input())\r\n\tt = 1\r\n\tfor _ in range(t):\r\n\t\tmain()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = input()\r\nsuma = 0\r\nwhile len(n) != 1:\r\n nova = 0\r\n for i in n:\r\n nova += int(i)\r\n suma +=1\r\n n = str(nova)\r\nprint(suma)", "n = list(map(int,list(input())))\r\nans = 0\r\nwhile len(n)>1:\r\n ans +=1\r\n n = list(map(int,list(str(sum(n)))))\r\nprint(ans)\r\n", "n=(input())\r\nif int(n)<=9:\r\n print(0)\r\nelse:\r\n l=len(n)\r\n # nums=list(str(sum(nums)))\r\n # print(nums)\r\n count=0\r\n nums=list(map(int,n))\r\n \r\n while(l!=1):\r\n \r\n nums=list(str(sum(nums)))\r\n nums=list(map(int,nums))\r\n l=len(nums)\r\n count+=1\r\n \r\n print(count) ", "x = input()\r\nans = 0\r\np = 0\r\nwhile len(x) != 1:\r\n for num in x:\r\n p += int(num)\r\n x = str(p)\r\n p = 0\r\n ans += 1\r\nprint(ans)", "n=input()\r\ndef counter(n):\r\n\tcount=0\r\n\twhile len(n)!=1:\r\n\t\tcount+=1\r\n\t\tj=0\r\n\t\tfor i in n:\r\n\t\t\tj+=int(i)\r\n\t\tn=str(j)\r\n\treturn count\r\nprint(counter(n))\r\n\r\n", "n=int(input())\r\ncount=0\r\nwhile(n>9):\r\n n=sum(map(int,str(n)))\r\n count += 1\r\nprint(count)\r\n", "n = input()\r\ndef getsum(n):\r\n s = 0\r\n for i in n:\r\n s+= ord(i) - 48\r\n return str(s)\r\n\r\ncount = 0\r\nwhile(len(n) >= 2):\r\n n = getsum(n)\r\n count+=1\r\n\r\nprint(count)\r\n", "a = list(input())\r\nans = 0\r\nwhile len(a) != 1:\r\n cnt = 0\r\n for i in a:\r\n cnt += int(i)\r\n a = list(str(cnt))\r\n ans += 1\r\nprint(ans)", "n = input()\r\ncount = 0\r\n\r\nwhile len(n) != 1:\r\n l = [int(x) for x in n]\r\n n = str(sum(l))\r\n count += 1\r\n\r\nprint(count)\r\n", "def f(k):\r\n s = 0\r\n for i in k:\r\n s += int(i)\r\n return str(s)\r\n\r\n\r\nn = input()\r\nans = 0\r\nwhile len(n) != 1:\r\n n = f(n)\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input()) \ncount = 0\nwhile n > 9:\n\tsum = 0\n\tfor i in str(n):\n\t\tsum += int(i)\n\tn = sum\n\tcount += 1\nprint(count)\n\n# duplicate\n \t \t \t\t\t\t\t \t \t \t \t\t\t\t \t \t", "n = int(input())\r\nt = str(n)\r\ni = 0\r\nr = 0\r\nwhile len(t) > 1:\r\n\tsum1 = 0\r\n\tfor j in t:\r\n\t\tsum1 = sum1 + int(j)\r\n\tt = str(sum1)\r\n\tr = r + 1\r\nprint(r)", "s=input()\r\n# print(len(s))\r\ncount=0\r\ntem=0\r\nwhile len(s)>1:\r\n for i in s:\r\n tem+=int(i)\r\n count+=1\r\n s=str(tem)\r\n tem=0\r\nprint(count)", "s=str(input())\r\nl=len(s)\r\nc=0\r\nwhile l>1:\r\n sum_s=0\r\n for i in range(l):\r\n sum_s += int(s[i])\r\n s=str(sum_s)\r\n l=len(s)\r\n c+=1\r\n \r\nprint(c)\r\n\r\n", "n=input()\r\nif(len(n)<=1):\r\n print(0)\r\nelse:\r\n c=0\r\n while(len(n)>1):\r\n n=str(sum(list(map(int, n))))\r\n c+=1\r\n print(c)", "s = input()\r\ndef get_sum(s):\r\n\ttotal = 0\r\n\r\n\tfor i in range(len(s)):\r\n\t\t#print(s[i])\r\n\t\tif s[i] in \"0123456789\":\r\n\t\t\ttotal += int(s[i])\r\n\treturn str(total)\r\n\t\r\ncnt = 0\r\nwhile len(s) >= 2:\r\n\t#print(\"here\", s)\r\n\r\n\ts = get_sum(s)\r\n\tcnt+=1\r\nprint(cnt)\r\n", "s=input()\r\n \r\n \r\nc=0\r\n \r\nwhile len(s) != 1:\r\n su=0\r\n for i in range(0, len(s)):\r\n x = int(s[i])\r\n su+=x\r\n \r\n c+=1\r\n s=str(su)\r\n \r\n \r\nprint(c)", "a = input()\nans = 1\nwhile(True):\n if(int(a)<10):\n ans = 0\n break\n sum = 0\n for i in str(a):\n sum += int(i)\n a = sum\n if(a<10):\n break\n else:\n ans += 1\nprint(ans)", "\"\"\"\n102B | Sum of Digits: implementation\n\"\"\"\n\ndef sum_of_digits():\n n = input()\n a = 0\n while len(n) > 1:\n b = 0\n for i in n:\n b += int(i)\n n = str(b)\n a += 1\n print(a)\n\nif __name__ == '__main__':\n sum_of_digits()", "# https://codeforces.com/problemset/problem/102/B\r\n# implementation\r\n# Gde Anantha Priharsena\r\n# 15 Juli 2020\r\n# Approach : \r\n# difficulty : 1000\r\n\r\nn = input()\r\nspell = 0\r\n\r\nwhile len(n) > 1 :\r\n new_n = 0\r\n for i in range(len(n)) :\r\n new_n += int(n[i])\r\n n = str(new_n)\r\n spell += 1\r\nprint(spell)", "n=input()\r\nc=0\r\nwhile len(n)>1:\r\n\tn=str(sum(map(int,n)))\r\n\tc+=1\r\nprint(c)", "n = int(input()); count = 0\r\nwhile n > 9:\r\n s = str(n); n = 0\r\n for i in s:\r\n n += int(i)\r\n count += 1\r\nprint(count)", "num = input()\r\n\r\ni = 0\r\nwhile len(num) != 1:\r\n num = str(sum(int(x) for x in num))\r\n i += 1\r\nprint(i)\r\n", "def sum_of_digits(n):\r\n sum = 0\r\n for digit in str(n):\r\n sum += int(digit)\r\n return sum\r\n\r\nn= int(input())\r\nfs = 0\r\nans = 0\r\nif n>9:\r\n fs = sum_of_digits(n)\r\n ans+= 1\r\n while fs>9:\r\n fs = sum_of_digits(fs)\r\n ans+= 1\r\nprint(ans)\r\n\r\n\r\n", "from sys import stdin\r\n\r\ndef get_data(n):\r\n if n == 0:\r\n return 0\r\n times_spell = 0\r\n x = [int(a) for a in str(n)]\r\n while len(x) > 1:\r\n times_spell += 1\r\n n = sum(x)\r\n x = [int(a) for a in str(n)]\r\n return times_spell\r\n \r\ndef main():\r\n n = int(stdin.readline())\r\n print(get_data(n))\r\n\r\nmain()\r\n", "s = input()\r\nc = 0\r\nwhile len(s) != 1:\r\n c += 1\r\n p = 0\r\n for i in s:\r\n p += int(i)\r\n s = str(p)\r\nprint(c)\r\n", "ll=lambda:map(int,input().split())\r\nt=lambda:int(input())\r\nss=lambda:input()\r\nlx=lambda x:map(int,input().split(x))\r\n#from math import log10 ,log2,ceil,factorial as fac,gcd\r\n#from itertools import combinations_with_replacement as cs \r\n#from functools import reduce\r\n#from bisect import bisect_right as br,bisect_left as bl\r\n#from collections import Counter\r\n\r\n\r\n\r\n#for _ in range(t()):\r\nn=t()\r\nc=0\r\nwhile n//10!=0:\r\n n=sum(map(int,str(n)))\r\n c+=1\r\nprint(c)\r\n \r\n \r\n \r\n \r\n'''\r\n1:9\r\n2:9,8\r\n3:9,8,7,6\r\n4:\r\n'''\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "dic = {}\r\ndef total(n):\r\n tot = str(sum(n))\r\n return list(map(int, tot))\r\n \r\ndef solve(n):\r\n count = 1\r\n k = total(n)\r\n while True:\r\n if len(k)==1:\r\n print(count)\r\n return\r\n \r\n k = total(k) \r\n count += 1\r\n\r\nif __name__==\"__main__\":\r\n n = list(map(int,input()))\r\n if len(n)==1:\r\n print(0)\r\n \r\n else:\r\n solve(n)", "count = 0\r\nstrn = input()\r\nx = 0\r\nif len(strn) < 2:\r\n count = 0\r\nelse:\r\n x = 11\r\n\r\nwhile x >= 10:\r\n x = 0\r\n for i in range(len(strn)):\r\n x += int(strn[i])\r\n strn = str(x)\r\n count += 1\r\n\r\nprint(count)", "n = input()\r\n\r\ncount = 0\r\nwhile len(n) > 1:\r\n new_n = 0\r\n for c in n:\r\n new_n += int(c)\r\n n = str(new_n)\r\n count += 1\r\nprint(count)", "n = input()\r\nans = 0\r\n\r\nwhile (len(n)>1):\r\n n = str(sum(map(int,n)))\r\n ans += 1\r\n\r\nprint(ans)", "def summ(n,c):\r\n if n<10:\r\n return c\r\n else:\r\n s=0\r\n for i in (str(n)):\r\n s=s+int(i)\r\n c+=1\r\n return summ(int(s),c)\r\nn=int(input())\r\nc=0\r\nprint(summ(n,c))", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\ns = str(n)\r\nl = []\r\nfor i in s:\r\n l.append(int(i))\r\n\r\nans = 0\r\nwhile len(l) > 1:\r\n w = sum(l)\r\n s = str(w)\r\n l = []\r\n for i in s:\r\n l.append(int(i))\r\n\r\n ans += 1\r\n\r\nprint(ans)", "n=input()\nc=0\nwhile len(n)>1:\n\tn=str(sum(map(int,n)))\n\tc+=1\nprint(c)", "n = input()\r\nlength= len(n)\r\ncount = 0\r\nwhile length != 1:\r\n n = str(sum(map(int, list(n))))\r\n length = len(n)\r\n count += 1\r\nprint(count)", "n=input()\r\ns=0\r\nx=0\r\ni=0\r\nwhile len(n)>1:\r\n s+=int(n[i])\r\n i+=1\r\n if i>=len(n):\r\n \r\n i=0\r\n n=str(s)\r\n s=0\r\n x+=1\r\n\r\nprint(x)\r\n", "from sys import stdin\r\n\r\nn = stdin.readline().strip()\r\nans=0\r\nwhile int(n)>9:\r\n sum=0\r\n ans+=1\r\n for a in str(n):\r\n sum += int(a)\r\n n=sum\r\nprint(ans)\r\n\r\n", "from sys import stdin,stdout\r\nfrom heapq import heapify,heappush,heappop,heappushpop\r\nfrom collections import defaultdict as dd, deque as dq,Counter as C\r\nfrom bisect import bisect_left as bl ,bisect_right as br\r\nfrom itertools import combinations as cmb,permutations as pmb\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log,inf\r\nmi = lambda : map(int,input().split())\r\nii = lambda: int(input())\r\nli = lambda : list(map(int,input().split()))\r\nmati = lambda r : [ li() for _ in range(r)]\r\nlcm = lambda a,b : (a*b)//gcd(a,b) \r\nMOD=10**9+7\r\ndef soe(n):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n return(prime)\r\ndef ncr(n,r):\r\n p,k=1,1\r\n if (n - r < r):\r\n r = n - r\r\n if r!=0:\r\n while(r):\r\n p,k=p*n,k*r\r\n m=gcd(p,k)\r\n p,k=p//m,k//m\r\n n,r=n-1,r-1\r\n else:\r\n p=1\r\n return(p)\r\n\r\n\r\n\r\n\r\ndef solve():\r\n n=input()\r\n ans=0\r\n while(len(n)>1):\r\n temp=0\r\n for x in range(len(n)):\r\n temp+=ord(n[x])-ord(\"0\")\r\n n=str(temp)\r\n ans+=1\r\n print(ans)\r\nfor _ in range(1):\r\n solve()", "a=input();c=0\r\nif len(a)==1:\r\n print(0)\r\nelse:\r\n\r\n while len(a)>1:\r\n b=str(sum(int(a[i]) for i in range(len(a))))\r\n a=b\r\n c=c+1\r\n print(c)\r\n", "n =int(input())\nsteps = 0\nwhile n>=10:\n n = sum(int(i) for i in str(n))\n steps+=1\nprint(steps)", "a=[int(i) for i in \" \".join(input()).split()]\r\ns=0\r\nwhile len(a)>1:\r\n a=[int(i) for i in \" \".join(str(sum(a))).split()]\r\n s+=1\r\nprint(s)", "def evaluate(n):\r\n if len(n) < 2:\r\n return 0\r\n count = 0\r\n curr_sum = 11\r\n while curr_sum > 9:\r\n curr_sum = 0\r\n for x in n:\r\n curr_sum += int(x)\r\n n = str(curr_sum)\r\n count += 1\r\n return count\r\n \r\n \r\nn = input()\r\nprint(evaluate(n))\r\n", "\r\n\r\ndef getSum(x):\r\n ans = 0\r\n while x:\r\n ans += x % 10\r\n x //= 10\r\n return ans\r\n\r\n\r\ndef main():\r\n num = input()\r\n if len(num) == 1:\r\n print(0)\r\n return 0\r\n sum = 0\r\n for i in range(len(num)):\r\n sum += int(num[i])\r\n # print(sum)\r\n ans = 1\r\n while sum > 9:\r\n sum = getSum(sum)\r\n # print(\"sum : \", sum)\r\n ans += 1\r\n print(ans)\r\n return 0\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def make_int(arr):\r\n result = []\r\n for i in arr:\r\n result.append(int(i))\r\n\r\n return result\r\n\r\ns = input()\r\nn = make_int(s)\r\n\r\ncount = 0\r\n\r\nwhile len(n) != 1:\r\n num = sum(n)\r\n n = make_int(str(num))\r\n count += 1\r\n\r\nprint(count)", "s = input()\nans = 0\nwhile int(s) >= 10:\n\tcount = 0\n\tfor c in s:\n\t\tcount += int(c)\n\ts = str(count)\n\tans += 1\n \nprint(ans)\n", "s=list(map(int,input()))\r\nc=0\r\nwhile len(s)!=1:\r\n s=list(map(int,str(sum(s))))\r\n c+=1\r\nprint(c) ", "s=input()\r\np=0\r\nwhile (len(s)>1):\r\n c=0\r\n p+=1\r\n for i in s:\r\n c+=int(i)\r\n s=str(c)\r\nprint(p)\r\n", "x = input()\r\ni=0\r\nwhile(len(x)!=1):\r\n x = str(sum(int(i) for i in x))\r\n i+=1\r\nprint(i)", "import math\r\ndef main():\r\n n = input()\r\n ans = 0\r\n while len(n) > 1:\r\n new_res = 0\r\n for d in n:\r\n new_res += int(d)\r\n\r\n n = str(new_res)\r\n ans += 1\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from functools import reduce\r\nn=input()\r\nc=0\r\nwhile True:\r\n\tl=list(n)\r\n\tif len(l)==1:\r\n\t\tprint(c)\r\n\t\texit()\r\n\tn=str(reduce(lambda x,y:int(x)+int(y),l))\r\n\tc+=1\r\nprint(c)", "'''input\r\n435723068340553295\r\n\r\n\r\n'''\r\nn = int(input())\r\n\r\ndef magic(n,c):\r\n\tif n < 10:\r\n\t\treturn c\r\n\r\n\ts = str(n)\r\n\tarr = [int(x) for x in s]\r\n\tn = 0\r\n\tfor num in arr:\r\n\t\tn += num\r\n\treturn magic(n, c+1)\r\n\r\nprint(magic(n,0))\r\n\r\n\r\n", "def fun(n):\r\n\tans=0\r\n\twhile(n):\r\n\t\tans+=n%10\r\n\t\tn=n//10\r\n\treturn ans\r\n\r\nn=int(input())\r\np=str(n)\r\nif(len(p)==1):\r\n\tprint(0)\r\nelse:\r\n\tans=0\r\n\tfor i in range(len(p)):\r\n\t\tans+=int(p[i])\r\n\ts=1\r\n\twhile(ans>9):\r\n\t\ts+=1\r\n\t\tans=fun(ans)\r\n\tprint(s)\r\n", "a = list(map(int,input()))\r\ncount = 0\r\nwhile True:\r\n if len(a) == 1:\r\n print(count)\r\n break\r\n else:\r\n count += 1\r\n a = list(map(int,str(sum(a))))", "n,x=input(),0\r\nwhile len(n)!=1:n=str(sum(map(int,list(n))));x+=1\r\nprint(x)", "def sum_of_digits(n):\r\n return sum(int(digit) for digit in str(n))\r\n\r\ndef count_spell_applications(n):\r\n count = 0\r\n while n >= 10:\r\n n = sum_of_digits(n)\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\n\r\ncount = count_spell_applications(n)\r\n\r\nprint(count)\r\n", "def solve():\r\n num = input()\r\n count = 0\r\n while len(num) != 1:\r\n count += 1\r\n s = 0\r\n for i in num:\r\n s += int(i)\r\n \r\n num = str(s)\r\n \r\n return count\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(solve())", "def sumi(n):\r\n return sum(list(map(int,str(n))))\r\nn=int(input())\r\n# print(sumi(n))\r\natt=0\r\nwhile n>9:\r\n n=sumi(n)\r\n att+=1\r\nprint(att)", "import sys\r\ninput=sys.stdin.readline\r\nn=input().strip()\r\nif len(n)==1:\r\n print(0)\r\n exit()\r\nb=0\r\nwhile 1:\r\n a=0\r\n for i in n:\r\n a+=int(i)\r\n b+=1\r\n if a<10:\r\n break\r\n n=str(a)\r\nprint(b)", "n = input()\n\ndef check_single_digit(n):\n if len(list(str(n))) == 1:\n return True\n return False\n\ndef apply(n):\n N = list(map(int, str(n)))\n return sum(N)\n\nis_single_digit = check_single_digit(n)\n\nif is_single_digit:\n print(0)\nelse:\n c = 0\n while not is_single_digit:\n n = apply(n)\n is_single_digit = check_single_digit(n)\n c += 1\n print(c)\n\n\n", "s=input()\r\nl=list(map(int,s))\r\ncnt=0\r\nwhile len(l)>1:\r\n\tl=list(map(int,str(sum(l))))\r\n\tcnt+=1\r\nprint(cnt)", "n=input()\r\nl=list(n)\r\nc=0\r\nwhile(len(l)>1):\r\n c0 = l.count('0')\r\n c1 = l.count('1')\r\n c2 = l.count('2')\r\n c3 = l.count('3')\r\n c4 = l.count('4')\r\n c5 = l.count('5')\r\n c6 = l.count('6')\r\n c7 = l.count('7')\r\n c8 = l.count('8')\r\n c9 = l.count('9')\r\n s = (c0 * 0) + (c1 * 1) + (c2 * 2) + (c3 * 3) + (c4 * 4) + (c5 * 5) + (c6 * 6) + (c7 * 7) + (c8 * 8) + (c9 * 9)\r\n l=list(str(s))\r\n c+=1\r\nprint(c)\r\n", "i = int(input())\na = 0\nwhile i >= 10:\n a += 1\n i = sum(int(x) for x in str(i))\nprint(a)\n", "def cast_spell(num):\r\n new_num = 0\r\n while num > 0:\r\n new_num += num % 10 # add the last digit\r\n num = num // 10 # get rid of the last digit\r\n return new_num\r\n\r\na = input()\r\ni_count = 0\r\nif len(a) > 1:\r\n # need to cast spell to string\r\n num = 0\r\n for ch in a:\r\n num += int(ch) # add up the digit\r\n i_count += 1 # you just made one spell\r\n while num >= 10:\r\n num = cast_spell(num)\r\n i_count += 1 # every time you make the spell, increase the cout\r\nprint(i_count)\r\n", "from collections import defaultdict, Counter\nimport itertools as it\nimport random as rand\n\ns = input()\nres=0\nwhile True:\n if len(s) == 1:\n break\n else:\n m=0\n for ch in s:\n m += ord(ch) - ord('0')\n s=str(m)\n res += 1\n\nprint(res)", "t = [int(x) for x in input()]\nx = 0\nwhile len(t) != 1:\n t = [int(x) for x in str(sum(t))]\n x += 1\nprint(x)", "import sys\nfrom functools import reduce\nfrom collections import Counter\nimport time\nimport datetime\nfrom math import sqrt,gcd\n\n\ndef ip(): return int(sys.stdin.readline())\n\ndef sip(): return sys.stdin.readline()\n\ndef mip(): return map(int,sys.stdin.readline().split())\n\ndef mips(): return map(str,sys.stdin.readline().split())\n\ndef lip(): return list(map(int,sys.stdin.readline().split()))\n\ndef matip(n,m):\n lst=[]\n for i in range(n):\n arr = lip()\n lst.append(arr)\n return lst\n\ndef factors(n): # find the factors of a number\n return list(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))\n\ndef minJumps(arr, n): #to reach from 0 to n-1 in the array in minimum steps\n jumps = [0 for i in range(n)]\n if (n == 0) or (arr[0] == 0):\n return float('inf')\n jumps[0] = 0\n for i in range(1, n):\n jumps[i] = float('inf')\n for j in range(i):\n if (i <= j + arr[j]) and (jumps[j] != float('inf')):\n jumps[i] = min(jumps[i], jumps[j] + 1)\n break\n return jumps[n-1]\n\ndef dic(arr): # converting list into dict of count\n return Counter(arr)\n\ndef check_prime(n):\n if n<2:\n return False\n for i in range(2,int(n**(0.5))+1,2):\n if n%i==0:\n return False\n return True \n\n\na = sip()\na = a[:-1]\nstep = 0\nwhile len(a)>1:\n step += 1\n count = 0\n for item in a:\n # print(int(item))\n count += int(item)\n a = str(count)\nprint(step)\n", "def sumofdigits(n):\r\n return sum(map(int,list(str(n))))\r\n\r\nattempts,n = 0,int(input())\r\nwhile n > 9:\r\n n = sumofdigits(n)\r\n attempts += 1\r\nprint(attempts)\r\n", "n = input()\r\nans,S = 0,sum\r\ns = list(map(int,n))\r\nans = 0\r\nwhile S(s)>9:\r\n s = list(map(int,str(S(s))))\r\n ans += 1\r\nprint([0,ans+1][int(n)>9])\r\n", "n=input()\r\nif int(n)<=9:\r\n print(0)\r\n exit()\r\ncnt=1\r\nn=sum(map(int,list(str(n))))\r\nwhile n>9:\r\n ans=sum(map(int,list(str(n))))\r\n cnt+=1\r\n n=ans\r\nprint(cnt)\r\n\r\n\r\n", "\r\ndef solve():\r\n\tnum = input()\r\n\tres = 0\r\n\r\n\twhile len(num) > 1:\r\n\r\n\t\ttotal = 0\r\n\t\tfor i in range(len(num)):\r\n\t\t\ttotal += int(num[i])\r\n\r\n\t\tnum = str(total)\r\n\r\n\t\tres += 1\r\n\r\n\tprint(res)\r\n\t\r\nsolve()", "n=int(input())\r\ndef s(n):\r\n x=str(n)\r\n f=0\r\n for i in x:\r\n f+=int(i)\r\n return f\r\nx=0\r\nwhile n>=10:\r\n n=s(n)\r\n x+=1\r\nprint(x)\r\n \r\n \r\n", "num=input()\ncount=0\nwhile len(num)>1:\n count+=1\n total = sum(int(c) for c in num)\n num=str(total)\nprint(count)\n\t \t\t\t\t \t\t\t\t \t\t\t\t \t\t\t\t\t \t", "def digitsum(num):\r\n return str(sum(int(i) for i in num))\r\n\r\nn = input()\r\nc = 0\r\nwhile len(n) > 1:\r\n n = digitsum(n)\r\n c += 1\r\nprint(c)", "n = input()\nc = 0\nwhile 1:\n if len(n) == 1:\n print(c)\n break\n t = 0\n for i in n:\n t += int(i)\n n = str(t)\n c += 1\n\n\n\t\t\t \t \t \t \t\t\t \t\t\t \t", "def sum(s):\r\n x=0\r\n for c in s:\r\n x+=int(c)\r\n return x \r\nn=int(input())\r\nc=0\r\ns=str(n)\r\nwhile(len(s)>1):\r\n s=str(sum(s))\r\n c+=1 \r\nprint(f\"{c}\")\r\n\r\n", "a=input()\r\n\r\n\r\ncnt=0\r\nlst=[]\r\nwhile(len(lst) !=1):\r\n\tlst=[int(x) for x in a]\r\n\ta=sum(lst)\r\n\ta=str(a)\r\n\tcnt+=1\r\n\r\nprint(cnt-1)", "import sys\n\n\ndef sum_digits(n):\n\ttotal = 0\n\tfor d in str(n):\n\t\ttotal += int(d)\n\treturn total\n\n\ndef solve():\n\t# fin = open('input.txt')\n\t# input = fin.readline \n\tinput = sys.stdin.readline\n\tn = list(map(int, input().strip().split(' ')))[0]\n\t\n\tcount = 0\n\twhile len(str(n)) > 1:\n\t\tcount += 1\n\t\tn = sum_digits(n)\n\t\n\treturn count\n\t\nprint(solve())", "n = list(input())\r\nturns = 0\r\nwhile len(n) > 1:\r\n turns += 1\r\n s = 0\r\n for num in n:\r\n s += int(num)\r\n n = list(str(s))\r\n\r\nprint(turns)\r\n", "s=input()\r\nc=0\r\no=0\r\nwhile len(s)!=1:\r\n o+=1\r\n for i in s:\r\n c+=int(i)\r\n else:\r\n s=str(c)\r\n c=0\r\nprint(o)", "def digit_sum(num):\r\n return sum(int(digit) for digit in str(num))\r\n\r\nn = int(input())\r\n\r\n# Count the number of times the spell can be applied\r\ncount = 0\r\n\r\nwhile n >= 10:\r\n n = digit_sum(n)\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\ntimes = 0\r\nwhile len(list(str(n)))>1:\r\n times+=1\r\n n = sum([int(x) for x in list(str(n))])\r\nprint(times)", "n = input()\r\ni = 0\r\nc = 0\r\nres = 0\r\nwhile len(str(n)) != 1:\r\n c = 0\r\n for i in range(len(n)):\r\n c += int(n[i]) \r\n n = str(c)\r\n res += 1\r\nprint(res)", "n=input()\r\nl=0\r\nwhile len(n)>1:\r\n c=0\r\n l+=1\r\n for i in n:\r\n c+=int(i)\r\n n=str(c)\r\nprint(l)", "num = input()\r\nc = 0\r\nwhile(len(num) != 1):\r\n num = str(sum(int(i) for i in num))\r\n c += 1\r\nprint(c)", "n = list(input())\r\nans = 0\r\nif len(n) > 1:\r\n l = [int(i) for i in n]\r\n while len(l) > 1:\r\n l = [int(i) for i in str(sum(l))]\r\n ans += 1\r\n\r\nprint(ans)", "from math import *\r\ndef f(s):\r\n x = 0\r\n for i in s:\r\n x += int(i)\r\n return x\r\ndef digits(i):\r\n s = 0\r\n while i != 0:\r\n s += i % 10\r\n i//=10\r\n return s\r\nk = 0\r\nn = input()\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n n = f(n)\r\n k = 1\r\n while len(str(n)) != 1:\r\n n = digits(n)\r\n k += 1\r\n print(k)", "s = input()\r\nn=0\r\nwhile(len(s)>=2):\r\n n+=1\r\n res=0\r\n for i in s:\r\n res+=int(i)\r\n s = str(res)\r\nprint(n)\r\n \r\n \r\n", "# n= int(input())\r\n# def sumDigits(n: int) -> int:\r\n# return 0 if n==0 else (n%10)+sumDigits(n//10)\r\n# count=0\r\n# while n//10!=1:\r\n# n=sumDigits(n)\r\n# count+=1\r\n# print(count)\r\n\r\nn=input()\r\ncount=0\r\nwhile len(n)>1:\r\n n=str(sum(map(int,n)))\r\n count+=1\r\nprint(count)\r\n", "# cook your dish here\r\nn = input()\r\nit = 0\r\nwhile(len(n) > 1):\r\n n1 = 0\r\n for i in n: n1 += int(i)\r\n n = str(n1)\r\n it+=1\r\nprint(it)", "def sum(n):\r\n\tx=str(n)\r\n\ts=0\r\n\tfor i in range(len(x)):\r\n\t\ts+=int(x[i])\r\n\treturn s\r\nn=int(input())\r\nif(n>=0 and n<=9):\r\n\tprint(0)\r\nelse:\r\n\ti=0\r\n\twhile n>9:\r\n\t\tn=sum(n)\r\n\t\ti+=1\r\n\tprint(i)", "n,x,y=input(),0,0\r\nwhile int(n)>9:\r\n\tfor i in n:\r\n\t\ty+=int(i)\r\n\tn=str(y)\r\n\ty=0\r\n\tx+=1\r\nprint(x)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn = insr()\r\nx = [eval(i) for i in n]\r\ncount =0\r\nwhile(len(x) > 1):\r\n count+=1\r\n d = str(sum(x));\r\n x = list(d)\r\n x = [eval(i) for i in x]\r\n\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 25 10:38:44 2021\r\n\r\n@author: Mo'men\r\n\"\"\"\r\n\r\nn = input()\r\ncounter = 0\r\nwhile len(n) > 1:\r\n digit_sum = 0\r\n for c in n:\r\n digit_sum += int(c) - int('0')\r\n n = str(digit_sum)\r\n counter += 1\r\nprint(counter)", "def getSum(n):\r\n sum = 0\r\n for digit in str(n): \r\n sum += int(digit) \r\n return sum\r\n\r\nn = int(input())\r\ntimes = 0\r\nwhile len(str(n)) > 1:\r\n times += 1\r\n n = getSum(n)\r\nprint(times)", "N=str(input())\r\ncant_digitos=len(N)\r\nsol=0\r\nwhile(cant_digitos>1):\r\n sum=0\r\n for i in range(cant_digitos):\r\n sum+=int(N[i])\r\n sol+=1\r\n N=str(sum)\r\n cant_digitos=len(N)\r\nprint(sol)", "n = int(input())\r\nlis = []\r\nif n < 10:\r\n print(0)\r\nelse:\r\n while True:\r\n x = str(n)\r\n answer = 0\r\n for i in x:\r\n answer += int(i)\r\n n = answer\r\n lis.append(n)\r\n if n < 10:\r\n break\r\n print(len(lis))", "n = str(int(input()))\r\n\r\ncount = 0\r\nwhile len(n) >1:\r\n n = str(sum([int(i) for i in n]))\r\n count += 1\r\n\r\nprint(count)", "n=list(input())\r\n\r\ndef sum(n):\r\n sum=0\r\n for i in n:\r\n sum+=int(i)\r\n return sum\r\ncounter=0\r\nwhile len(n)>1:\r\n n=[i for i in str(sum(n))]\r\n counter+=1\r\nprint(counter)", "def go(n):\r\n total = 0\r\n for c in n:\r\n total += int(c)\r\n return str(total)\r\n\r\n\r\nn = input()\r\ncount = 0\r\nwhile int(n) > 9:\r\n n = go(n)\r\n count += 1\r\n\r\nprint(count)", "number = input()\r\nnumber = [num for num in number]\r\nnumber = list(map(int,number))\r\nw=1\r\ncount = 0\r\nif len(number)==1:\r\n print(count)\r\nelse:\r\n while(w!=0):\r\n sumation=sum(number)\r\n count+=1\r\n sumation = [num for num in str(sumation)]\r\n number = list(map(int,sumation))\r\n if len(number)==1:\r\n \t w=0\r\n \t break\r\n w=w+1\r\n print(count)", "n = input()\r\n\r\nif int(n) <= 9:\r\n print(0)\r\nelse:\r\n count = 0\r\n while True:\r\n sums = 0\r\n for x in n:\r\n sums += int(x)\r\n count += 1\r\n\r\n n = str(sums)\r\n if sums <= 9:\r\n break\r\n print(count)\r\n", "for i in range(1):\r\n n = input()\r\n ans=0\r\n while(len(n)>1):\r\n s = 0\r\n for i in n:\r\n s+= int(i)\r\n n = str(s)\r\n ans+=1\r\n print(ans)", "def solve():\r\n n = input()\r\n s = 0\r\n ans = 0\r\n if int(n) < 10:\r\n print(ans)\r\n return\r\n\r\n for i in range(6):\r\n s = 0\r\n for j in n:\r\n s += int(j)\r\n\r\n if s < 10:\r\n ans = i+1\r\n break\r\n\r\n n = str(s)\r\n\r\n\r\n\r\n print(ans)\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve()\r\n\r\n", "# cook your dish here\r\ndef find(l):\r\n sum=0\r\n for i in l:\r\n sum+=int(i)\r\n return sum\r\ns=input()\r\nl=list(s)\r\nif(len(l)==1):\r\n print(0)\r\nelse:\r\n ans=0\r\n while 1:\r\n x=find(l)\r\n ans+=1\r\n if len(str(x))==1:\r\n break\r\n l=list(str(x))\r\n \r\n print(ans)", "a = int(input())\r\nd = 0\r\nb = [int(x) for x in str(a)]\r\nwhile not len(b) == 1:\r\n a = sum(b)\r\n d += 1\r\n b = [int(x) for x in str(a)]\r\nprint(d)", "n=int(input())\r\nr=0\r\nwhile n>9:\r\n n=sum(map(int,str(n)))\r\n r+=1\r\nprint(r)", "num = input()\r\n\r\niterations = 0\r\n\r\ndef summation(value , it):\r\n valList = [int(x) for x in value]\r\n if len(valList) > 1:\r\n valList = str(sum(valList))\r\n it +=1\r\n summation(valList,it)\r\n else:\r\n print(it)\r\n\r\nsummation(num, iterations)", "n = input()\r\nx = 0\r\ny = n\r\nwhile len(n) != 1 :\r\n x+= 1\r\n z = 0\r\n for i in n :\r\n z+= int(i)\r\n \r\n n = str(z) \r\n \r\nprint(x)\r\n \r\n ", "s = input() ; c = 0 \r\nwhile len(s) != 1 : s = str(sum(map(int, s))) ; c += 1 \r\nprint(c)", "num = int(input())\r\nres = 0\r\n# One digit case\r\nif num < 9:\r\n print(res)\r\nelse:\r\n # More than digit\r\n while num > 9:\r\n num = str(num)\r\n len_num = len(num)\r\n num_list = []\r\n for n in range(0, len_num):\r\n num_list.append(int(num[n]))\r\n num = sum(num_list)\r\n res += 1\r\n print(res)\r\n", "def s(n):\r\n c=0\r\n d=1\r\n for i in range(len(n)):\r\n c+=int(n[i])\r\n if len(str(c))>1:\r\n d+=s(str(c))\r\n else:\r\n d+=0\r\n return d\r\nst=input()\r\nif len(st)==1:\r\n print(0)\r\nelse:\r\n print(s(st))", "n = int(input())\r\ni = 0\r\nwhile n > 9:\r\n n = sum(map(int,str(n)))\r\n i+=1\r\nprint(i)\r\n", "num = input()\r\n\r\ntimes = 0\r\nwhile len(num) > 1:\r\n times += 1\r\n total = 0\r\n for digit in num:\r\n total += int(digit)\r\n num = str(total)\r\n\r\nprint(times)\r\n", "if __name__ == \"__main__\":\r\n\tresult = list(input())\r\n\tcount = 0\r\n\twhile len(result) != 1:\r\n\t\tres = list(map(int, result))\r\n\t\tresult = list(str(sum(res)))\r\n\t\tcount += 1\r\n\t\t\r\n\tprint(count)", "import sys\r\nimport re\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n \r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef inir(s,extrat):\r\n if extrat:\r\n return(list(map(int,s[:len(s) - 1])))\r\n else:\r\n return(list(map(int,s)))\r\n\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Solution ---- ############\r\ns = input()\r\nn = inir(s,True)\r\ncount = 0\r\nwhile(len(n)>1):\r\n st = str(sum(n))\r\n n = inir(st,False)\r\n count+=1\r\nprint(count)\r\n ", "n = input()\r\nre = 0\r\nwhile len(n) > 1:\r\n re += 1\r\n n = str(sum(list(map(int, n))))\r\nprint(re)", "s = input()\r\nans = 0\r\nwhile len(s) > 1:\r\n cnt = 0\r\n for i in s:\r\n cnt+=int(i)\r\n s = str(cnt)\r\n ans+=1\r\nprint(ans)", "n = input().strip()\r\n\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n count = 0\r\n while len(n) > 1:\r\n s = 0\r\n for digit in n:\r\n s += int(digit)\r\n n = str(s)\r\n count += 1\r\n print(count)\r\n", "n = input()\r\ncount = 0\r\n\r\nwhile len(n) > 1:\r\n\tSum = 0\r\n\tfor i in range(len(n)):\r\n\t\tSum += int(n[i])\r\n\tn = str(Sum)\r\n\tcount += 1\r\n\t\r\nprint(count)\r\n\r\n\r\n", "n=int(input())\r\nc=0\r\nwhile(n>9):\r\n sum = 0\r\n for digit in str(n): \r\n sum += int(digit)\r\n n=sum \r\n c+=1\r\nprint(c) ", "n = input()\r\nspells = 0\r\nwhile len(n) > 1:\r\n t = 0\r\n for i in range(len(n)):\r\n t += int(n[i])\r\n n = str(t)\r\n spells += 1\r\nprint(spells)", "num=input()\r\nresult=0\r\nif len(num)<2:\r\n print(0)\r\n exit()\r\nsum=0\r\nfor i in num:\r\n sum+=eval(i)\r\nresult+=1\r\nwhile(len(str(sum))>=2):\r\n temp=0\r\n for i in str(sum):\r\n temp+=eval(i)\r\n result+=1\r\n sum=temp\r\nprint(result)\r\n\r\n", "n=input()\r\ns=0\r\nans=1\r\nfor i in n:\r\n s=s+int(i)\r\nif len(str(s))!=1:\r\n ans=ans+1\r\n x=0\r\n for j in str(s):\r\n x=x+int(j)\r\n if len(str(x))!=1:\r\n ans=ans+1\r\n y=0\r\n for k in str(x):\r\n y=y+int(k)\r\n if len(str(y))!=1:\r\n ans=ans+1\r\nif len(str(n))==1:\r\n print(0)\r\nelse:\r\n print(ans)\r\n\r\n\r\n\r\n\r\n", "n=input()\ncnt=0\nl=[int(x) for x in n]\nif len(l)==1:\n\tprint(\"0\")\nelse:\n\twhile len(l)!=1:\n\t\tcnt+=1\n\t\tsumm=str(sum(l))\n\t\tl=[int(x) for x in summ]\n\tprint(cnt)\n \t\t\t\t \t \t\t\t\t\t \t\t\t \t\t \t \t \t\t", "x=input()\r\nlst1=[int(x) for x in x]\r\nc=0\r\n\r\nwhile(len(lst1)>1): \r\n cal=0\r\n for i in range(0,len(lst1)) :\r\n cal=cal+lst1[i]\r\n c=c+1\r\n lst2=[int(x) for x in str(cal)]\r\n lst1=lst2\r\n if(len(lst2)==1):\r\n break\r\n \r\nprint(c) \r\n\r\n", "s=input()\r\nc=m=0\r\nwhile(len(s)!=1):\r\n for i in s:\r\n m+=int(i);\r\n s=str(m)\r\n m=0\r\n c+=1\r\nprint(c)\r\n", "n = input()\r\nsteps = 0\r\nwhile len(n) > 1:\r\n digit_sum = sum(int(digit) for digit in n)\r\n n = str(digit_sum)\r\n steps += 1\r\nprint(steps)", "n = input()\r\nresult = 0\r\nwhile int(n) >= 10:\r\n arr = []\r\n for i in str(n):\r\n arr.append(i)\r\n n = sum([int(i) for i in arr])\r\n result += 1\r\n\r\nprint(result)\r\n", "def solve(s):\r\n sm = 0\r\n for i in s :\r\n sm += int(i)\r\n\r\n return sm\r\n\r\n\r\ns = input()\r\ncnt = 0\r\nwhile len(s) > 1 :\r\n s = str(solve(s))\r\n cnt +=1\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n", "num = str(input())\r\n#print(type(num))\r\nboo = True\r\nl = \"\"\r\nl += num\r\nl = int(l)\r\nif l <= 9:\r\n boo = False\r\ntimes = 0\r\nwhile boo:\r\n #print(type(num))\r\n new_num = 0\r\n \r\n for k in range(len(str(num))):\r\n new_num += int((str(num)[k]))\r\n times += 1\r\n if new_num <= 9:\r\n #print(times)\r\n break\r\n \r\n num = new_num\r\nprint(times)\r\n", "n = input()\r\nsum = 0\r\nnum = 0\r\nwhile len(n)>1:\r\n sum = 0\r\n for i in range(len(n)):\r\n sum+=int(n[i])\r\n num+=1\r\n n = str(sum)\r\nprint(num)", "temp = input()\nanswer = 0\nwhile len(temp) > 1:\n temp = str(sum([int(x) for x in temp]))\n answer += 1\nprint(answer)", "n = input()\nfirst_sum = int(n)\ntimes = 0\n# print(first_sum)\nwhile (first_sum >= 10):\n times += 1\n first_sum = sum([int(i) for i in str(first_sum)])\nprint(times)\n\n \t \t\t\t \t\t \t\t\t \t \t\t\t \t\t \t", "n=int(input())\r\nnl=list(str(n))\r\nop=0\r\nwhile len(nl)!=1:\r\n sum=0\r\n for i in nl:\r\n sum+=int(i)\r\n \r\n nl=list(str(sum))\r\n op+=1\r\nprint(op)", "a = input()\r\nc = 0\r\ncount = 0\r\ni = -1\r\nwhile len(a) != 1:\r\n i+=1\r\n c += int(a[i])\r\n if i == len(a)-1:\r\n a = str(c)\r\n c = 0\r\n i = -1\r\n count+=1\r\nprint(count)", "def count(num):\r\n flag = 0\r\n while len(num) != 1:\r\n flag += 1\r\n new_num = 0\r\n for i in range(len(num)):\r\n new_num += int(num[i])\r\n num = str(new_num)\r\n return flag\r\n\r\n\r\nif __name__ == '__main__':\r\n n = input()\r\n\r\n print(count(n))\r\n", "n=input()\nk=0\nwhile len(n)!=1:\n s=0\n for i in n:\n s+=int(i)\n n=str(s)\n k+=1\nprint(k)", "t = 0\r\nn = input()\r\nwhile True:\r\n sum_ = 0 \r\n for i in n:\r\n sum_+= int(i)\r\n if len(n) > 1: t+=1\r\n n = str(sum_)\r\n if len(n) == 1: break\r\nprint(t)", "N, k = input(), 0\r\nwhile len(N) > 1:\r\n k += 1\r\n N = str(sum(map(int, N)))\r\nprint(k)", "import sys\n\nn = int(sys.stdin.readline())\n\nc = 0\nwhile n >= 10:\n n = sum(map(int, str(n)))\n c +=1\n\nprint(c)\n \t \t \t\t \t \t \t\t\t\t\t\t\t \t \t \t \t", "n= int(input())\nc = 0 \nwhile n >9:\n n = sum(map(int,str(n)))\n c+=1\nprint(c)", "n = int(input())\ncount = 0\nwhile n > 9:\n n = sum(map(int, str(n)))\n count += 1\nprint(count)\n\n \t \t \t \t \t \t \t\t\t\t \t \t \t", "n = input()\n\nif len(n) <= 1:\n\tprint(0)\n\nelse:\n\tsum = 0\n\tfor i in n:\n\t\tsum += ord(i) - ord('0')\n\n\ts = str(sum)\n\tcount = 1\n\twhile len(s) > 1:\n\t\tsum = 0\n\t\tfor i in s:\n\t\t\tsum += ord(i) - ord('0')\n\n\t\ts = str(sum)\n\t\tcount += 1\n\n\tprint(count)", "n = int(input())\r\ncount = 0\r\nwhile n//10!=0:\r\n n = sum(list(map(int,list(str(n)))))\r\n count+=1\r\nprint(count)\r\n", "l = [int(i) for i in input()]\r\nc = 0\r\nwhile(len(l) != 1):\r\n\tl = [int(i) for i in str(sum(l))]\r\n\tc += 1\r\nprint(c) # OMAE WA MOU SHINDEIRU :D", "a = input()\r\n\r\ndef small(n):\r\n if len(n) <=1:\r\n return 0\r\n s = 0\r\n i = 0\r\n while n !=0 and i <len(n):\r\n s += int(n[i])\r\n i +=1\r\n return s\r\n\r\n\r\n\r\ndef out(x):\r\n v = int(a)\r\n counter = 0\r\n while True:\r\n if v ==0 or v <= 9:\r\n return counter\r\n else:\r\n v = small(str(v))\r\n counter += 1\r\n\r\nprint(out(a))\r\n", "n,x=input(),0\r\ni=int\r\nwhile i(n)>9:\r\n n=sum(map(i,str(n)))\r\n x+=1\r\nprint(x)", "n = input('')\r\nlst = []\r\nm = 0\r\nt = 1\r\nans = 0 \r\n\r\nfor k in n:\r\n lst.append(int(k))\r\n\r\n\r\nwhile t < len(lst):\r\n m = 0\r\n for i in lst:\r\n m = m + i \r\n\r\n lst.clear()\r\n\r\n for j in str(m):\r\n lst.append(int(j))\r\n\r\n ans = ans + 1\r\n\r\nprint(ans)\r\n \r\n\r\n\r\n \r\n\r\n\r\n", "def main():\r\n n = input()\r\n length = len(n)\r\n count = 0\r\n while length > 1:\r\n summation = 0\r\n for digit in n:\r\n summation += int(digit)\r\n\r\n count += 1\r\n n = str(summation)\r\n length = len(n)\r\n\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ndef sumdigits(n): \r\n sum = 0\r\n for digit in str(n): \r\n sum += int(digit) \r\n return sum\r\ni = 0\r\nwhile ((n//10)!= 0):\r\n\tn = sumdigits(n)\r\n\ti +=1\r\nprint(i)", "n = input()\r\nlst = []\r\nfor i in n: lst.append(i)\r\n\r\ndef checker(lst:list):\r\n if len(lst) == 0:\r\n return 1\r\n count = 0\r\n while len(lst) > 1:\r\n sum = 0\r\n for i in lst:\r\n sum += int(i)\r\n lst.clear()\r\n sum = str(sum)\r\n for i in sum:\r\n lst.append(i)\r\n count += 1\r\n return count\r\n\r\nprint(checker(lst))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 5 20:00:08 2021\r\n\r\n@author: Bruger\r\n\"\"\"\r\n\r\n\r\nx = input()\r\n\r\n\r\n \r\n\r\nr = 0\r\nwhile (v := len(x)) > 1:\r\n val = 0\r\n for i in range(v):\r\n val += int(x[i])\r\n r += 1\r\n x = str(val)\r\n\r\nprint(r)\r\n \r\n\r\n", "n = input()\r\ncount = 0\r\nwhile len(n) != 1:\r\n n = str(sum(map(int, list(n))))\r\n count += 1\r\nprint(count)", "n=str(input())\r\nkj=int(n)\r\nn=list(n)\r\nfor i in range (len(n)):\r\n\tn[i]=int(n[i])\r\nans=sum(n)\r\nval=0\r\nif kj<10:\r\n\tval=0\r\nelse:\r\n\twhile kj>=10:\r\n\t\tkj=sum(n)\r\n\t\tans=str(kj)\r\n\t\tn=list(ans)\r\n\t\tfor i in range (len(n)):\r\n\t\t\tn[i]=int(n[i])\r\n\t\tval=val+1\r\nprint(val)", "def B_pra(n):\n count = 0\n while n >= 10:\n n = sum(map(int, str(n)))\n count += 1\n return count\n\nif __name__ == '__main__':\n s = input()\n # print(A_pra(s))\n print(B_pra(int(s)))\n\t\t \t \t \t\t\t \t \t \t \t\t \t\t \t \t \t\t", "def digit_sum(num):\n return sum(int(digit) for digit in str(num))\n\nn = int(input())\ncount = 0\n\nwhile n >= 10:\n n = digit_sum(n)\n count += 1\n \nprint(count)\n\n \t \t\t\t\t\t\t \t\t \t\t\t \t \t\t\t", "#!/usr/bin/env python\r\nfrom __future__ import division, print_function\r\nimport math\r\nimport os\r\nimport sys\r\nfrom fractions import *\r\nfrom sys import *\r\nfrom decimal import *\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate,combinations,permutations,combinations_with_replacement,product\r\nfrom collections import *\r\nimport timeit,time\r\n# sys.setrecursionlimit(10**5)\r\nM = 10 ** 9 + 7\r\nimport heapq\r\n\r\n# print(math.factorial(5))\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n# sys.setrecursionlimit(10**6)\r\n\r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\") # for fast input\r\n\r\n\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\n\r\n\r\ndef lis(): return list(map(int, inp().split()))\r\n\r\n\r\ndef stringlis(): return list(map(str, inp().split()))\r\n\r\n\r\ndef sep(): return map(int, inp().split())\r\n\r\n\r\ndef strsep(): return map(str, inp().split())\r\n\r\n\r\ndef fsep(): return map(float, inp().split())\r\n\r\n\r\ndef inpu(): return int(inp())\r\n\r\n\r\n# -----------------------------------------------------------------\r\n\r\ndef regularbracket(t):\r\n p = 0\r\n for i in t:\r\n if i == \"(\":\r\n p += 1\r\n else:\r\n p -= 1\r\n if p < 0:\r\n return False\r\n else:\r\n if p > 0:\r\n return False\r\n else:\r\n return True\r\n# -------------------------------------------------\r\ndef binarySearchcount(arr, n, key):\r\n left = 0\r\n right = n - 1\r\n count = 0\r\n while (left <= right):\r\n mid = int((right + left) / 2)\r\n # Check if middle element is\r\n # less than or equal to key\r\n if (arr[mid] <= key):\r\n count = mid + 1\r\n left = mid + 1\r\n # If key is smaller, ignore right half\r\n else:\r\n right = mid - 1\r\n return count\r\n\r\n#--------------------------------------------------binery search\r\ndef binarySearch(arr, n, key):\r\n left = 0\r\n right = n - 1\r\n while (left <= right):\r\n mid = ((right + left) // 2)\r\n if arr[mid]==key:\r\n return mid\r\n if (arr[mid] <= key):\r\n left = mid + 1\r\n # If key is smaller, ignore right half\r\n else:\r\n right = mid - 1\r\n return -1\r\n#-------------------------------------------------ternary search\r\ndef ternarysearch(arr,n,key):\r\n l,r=0,n-1\r\n while(l<=r):\r\n mid = (-l+r)//3 + l\r\n mid2 = mid + (-l+r)//3\r\n if arr[mid]==key:\r\n return mid\r\n if arr[mid2]==key:\r\n return mid2\r\n if arr[mid]>key:\r\n r=mid-1\r\n elif arr[mid2]<key:\r\n l=mid2+1\r\n else:\r\n l=mid+1\r\n r=mid2-1\r\n return -1\r\n# ------------------------------reverse string(pallindrome)\r\ndef reverse1(string):\r\n pp = \"\"\r\n for i in string[::-1]:\r\n pp += i\r\n if pp == string:\r\n return True\r\n return False\r\n\r\n\r\n# --------------------------------reverse list(paindrome)\r\ndef reverse2(list1):\r\n l = []\r\n for i in list1[::-1]:\r\n l.append(i)\r\n if l == list1:\r\n return True\r\n return False\r\n\r\n\r\ndef mex(list1):\r\n # list1 = sorted(list1)\r\n p = max(list1) + 1\r\n for i in range(len(list1)):\r\n if list1[i] != i:\r\n p = i\r\n break\r\n return p\r\n\r\n\r\ndef sumofdigits(n):\r\n n = str(n)\r\n s1 = 0\r\n for i in n:\r\n s1 += int(i)\r\n return s1\r\n\r\n\r\ndef perfect_square(n):\r\n s = math.sqrt(n)\r\n if s == int(s):\r\n return True\r\n return False\r\n\r\n\r\n# -----------------------------roman\r\ndef roman_number(x):\r\n if x > 15999:\r\n return\r\n value = [5000, 4000, 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]\r\n symbol = [\"F\", \"MF\", \"M\", \"CM\", \"D\", \"CD\", \"C\", \"XC\", \"L\", \"XL\", \"X\", \"IX\", \"V\", \"IV\", \"I\"]\r\n roman = \"\"\r\n i = 0\r\n while x > 0:\r\n div = x // value[i]\r\n x = x % value[i]\r\n while div:\r\n roman += symbol[i]\r\n div -= 1\r\n i += 1\r\n return roman\r\n\r\n\r\ndef soretd(s):\r\n for i in range(1, len(s)):\r\n if s[i - 1] > s[i]:\r\n return False\r\n return True\r\n\r\n\r\n# print(soretd(\"1\"))\r\n# ---------------------------\r\ndef countRhombi(h, w):\r\n ct = 0\r\n for i in range(2, h + 1, 2):\r\n for j in range(2, w + 1, 2):\r\n ct += (h - i + 1) * (w - j + 1)\r\n return ct\r\n\r\n\r\ndef countrhombi2(h, w):\r\n return ((h * h) // 4) * ((w * w) // 4)\r\n\r\n\r\n# ---------------------------------\r\ndef binpow(a, b):\r\n if b == 0:\r\n return 1\r\n else:\r\n res = binpow(a, b // 2)\r\n if b % 2 != 0:\r\n return res * res * a\r\n else:\r\n return res * res\r\n\r\n\r\n# -------------------------------------------------------\r\ndef binpowmodulus(a, b, m):\r\n a %= m\r\n res = 1\r\n while (b > 0):\r\n if (b & 1):\r\n res = res * a % m\r\n a = a * a % m\r\n b >>= 1\r\n return res\r\n\r\n\r\n# -------------------------------------------------------------\r\ndef coprime_to_n(n):\r\n result = n\r\n i = 2\r\n while (i * i <= n):\r\n if (n % i == 0):\r\n while (n % i == 0):\r\n n //= i\r\n result -= result // i\r\n i += 1\r\n if (n > 1):\r\n result -= result // n\r\n return result\r\n\r\n\r\ndef luckynumwithequalnumberoffourandseven(x,n,a):\r\n if x >= n and str(x).count(\"4\") == str(x).count(\"7\"):\r\n a.append(x)\r\n else:\r\n if x < 1e12:\r\n luckynumwithequalnumberoffourandseven(x * 10 + 4,n,a)\r\n luckynumwithequalnumberoffourandseven(x * 10 + 7,n,a)\r\n return a\r\n#----------------------\r\ndef luckynum(x,l,r,a):\r\n if x>=l and x<=r:\r\n a.append(x)\r\n if x>r:\r\n a.append(x)\r\n return a\r\n if x < 1e10:\r\n luckynum(x * 10 + 4, l,r,a)\r\n luckynum(x * 10 + 7, l,r,a)\r\n return a\r\n\r\ndef luckynuber(x, n, a):\r\n p = set(str(x))\r\n if len(p) <= 2:\r\n a.append(x)\r\n if x < n:\r\n luckynuber(x + 1, n, a)\r\n return a\r\n\r\n\r\n# ------------------------------------------------------interactive problems\r\n\r\ndef interact(type, x):\r\n if type == \"r\":\r\n inp = input()\r\n return inp.strip()\r\n else:\r\n print(x, flush=True)\r\n\r\n\r\n# ------------------------------------------------------------------zero at end of factorial of a number\r\ndef findTrailingZeros(n):\r\n # Initialize result\r\n count = 0\r\n\r\n # Keep dividing n by\r\n # 5 & update Count\r\n while (n >= 5):\r\n n //= 5\r\n count += n\r\n\r\n return count\r\n\r\n\r\n# -----------------------------------------------merge sort\r\n# Python program for implementation of MergeSort\r\ndef mergeSort(arr):\r\n if len(arr) > 1:\r\n\r\n # Finding the mid of the array\r\n mid = len(arr) // 2\r\n\r\n # Dividing the array elements\r\n L = arr[:mid]\r\n\r\n # into 2 halves\r\n R = arr[mid:]\r\n\r\n # Sorting the first half\r\n mergeSort(L)\r\n\r\n # Sorting the second half\r\n mergeSort(R)\r\n\r\n i = j = k = 0\r\n\r\n # Copy data to temp arrays L[] and R[]\r\n while i < len(L) and j < len(R):\r\n if L[i] < R[j]:\r\n arr[k] = L[i]\r\n i += 1\r\n else:\r\n arr[k] = R[j]\r\n j += 1\r\n k += 1\r\n\r\n # Checking if any element was left\r\n while i < len(L):\r\n arr[k] = L[i]\r\n i += 1\r\n k += 1\r\n\r\n while j < len(R):\r\n arr[k] = R[j]\r\n j += 1\r\n k += 1\r\n\r\n\r\n# -----------------------------------------------lucky number with two lucky any digits\r\nres = set()\r\ndef solven(p, l, a, b, n): # given number\r\n if p > n or l > 10:\r\n return\r\n if p > 0:\r\n res.add(p)\r\n solven(p * 10 + a, l + 1, a, b, n)\r\n solven(p * 10 + b, l + 1, a, b, n)\r\n\r\n\r\n# problem\r\n\"\"\"\r\nn = int(input())\r\nfor a in range(0, 10):\r\n for b in range(0, a):\r\n solve(0, 0)\r\nprint(len(res))\r\n\"\"\"\r\n\r\n# In the array A at every step we have two\r\n# choices for each element either we can\r\n# ignore the element or we can include the\r\n# element in our subset\r\ndef subsetsUtil(A, subset, index, d):\r\n print(*subset)\r\n s = sum(subset)\r\n d.append(s)\r\n for i in range(index, len(A)):\r\n # include the A[i] in subset.\r\n subset.append(A[i])\r\n\r\n # move onto the next element.\r\n subsetsUtil(A, subset, i + 1, d)\r\n\r\n # exclude the A[i] from subset and\r\n # triggers backtracking.\r\n subset.pop(-1)\r\n return d\r\n\r\n\r\ndef subsetSums(arr, l, r, d, sum=0):\r\n if l > r:\r\n d.append(sum)\r\n return\r\n subsetSums(arr, l + 1, r, d, sum + arr[l])\r\n\r\n # Subset excluding arr[l]\r\n subsetSums(arr, l + 1, r, d, sum)\r\n return d\r\n\r\n\r\ndef print_factors(x):\r\n factors = []\r\n for i in range(1, x + 1):\r\n if x % i == 0:\r\n factors.append(i)\r\n return (factors)\r\n\r\n\r\n# -----------------------------------------------\r\ndef calc(X, d, ans, D):\r\n # print(X,d)\r\n if len(X) == 0:\r\n return\r\n\r\n i = X.index(max(X))\r\n ans[D[max(X)]] = d\r\n\r\n Y = X[:i]\r\n Z = X[i + 1:]\r\n\r\n calc(Y, d + 1, ans, D)\r\n calc(Z, d + 1, ans, D)\r\n\r\n\r\n# ---------------------------------------\r\n\r\ndef factorization(n, l):\r\n c = n\r\n if prime(n) == True:\r\n l.append(n)\r\n return l\r\n for i in range(2, c):\r\n if n == 1:\r\n break\r\n while n % i == 0:\r\n l.append(i)\r\n n = n // i\r\n return l\r\n\r\n\r\n# endregion------------------------------\r\n\r\n\r\ndef good(b):\r\n l = []\r\n i = 0\r\n while (len(b) != 0):\r\n if b[i] < b[len(b) - 1 - i]:\r\n l.append(b[i])\r\n b.remove(b[i])\r\n else:\r\n l.append(b[len(b) - 1 - i])\r\n b.remove(b[len(b) - 1 - i])\r\n if l == sorted(l):\r\n # print(l)\r\n return True\r\n return False\r\n\r\n\r\n# arr=[]\r\n# print(good(arr))\r\ndef generate(st, s):\r\n if len(s) == 0:\r\n return\r\n\r\n # If current string is not already present.\r\n if s not in st:\r\n st.add(s)\r\n\r\n # Traverse current string, one by one\r\n # remove every character and recur.\r\n for i in range(len(s)):\r\n t = list(s).copy()\r\n t.remove(s[i])\r\n t = ''.join(t)\r\n generate(st, t)\r\n return\r\n#=--------------------------------------------longest increasing subsequence\r\n\r\ndef largestincreasingsubsequence(A):\r\n l = [1]*len(A)\r\n sub=[]\r\n for i in range(1,len(l)):\r\n for k in range(i):\r\n if A[k]<A[i]:\r\n sub.append(l[k])\r\n l[i]=1+max(sub,default=0)\r\n return max(l,default=0)\r\n\r\n#----------------------------------\r\n# Function to calculate\r\n# Bitwise OR of sums of\r\n# all subsequences\r\ndef findOR(nums, N):\r\n # Stores the prefix\r\n # sum of nums[]\r\n prefix_sum = 0\r\n # Stores the bitwise OR of\r\n # sum of each subsequence\r\n result = 0\r\n # Iterate through array nums[]\r\n for i in range(N):\r\n # Bits set in nums[i] are\r\n # also set in result\r\n result |= nums[i]\r\n # Calculate prefix_sum\r\n prefix_sum += nums[i]\r\n # Bits set in prefix_sum\r\n # are also set in result\r\n result |= prefix_sum\r\n # Return the result\r\n return result\r\n\r\ndef OR(a, n):\r\n ans = a[0]\r\n for i in range(1, n):\r\n ans |= a[i]\r\n #l.append(ans)\r\n return ans\r\n\r\ndef toString(List):\r\n return ''.join(List)\r\n# Function to print permutations of string\r\n# This function takes three parameters:\r\n# 1. String\r\n# 2. Starting index of the string\r\n# 3. Ending index of the string.\r\ndef permute(a, l, r,p):\r\n if l == r:\r\n p.append(toString(a))\r\n else:\r\n for i in range(l, r + 1):\r\n a[l], a[i] = a[i], a[l]\r\n permute(a, l + 1, r,p)\r\n a[l], a[i] = a[i], a[l] # backtrack\r\n# Function to find square root of\r\n# given number upto given precision\r\ndef squareRoot(number, precision):\r\n start = 0\r\n end, ans = number, 1\r\n # For computing integral part\r\n # of square root of number\r\n while (start <= end):\r\n mid = int((start + end) / 2)\r\n if (mid * mid == number):\r\n ans = mid\r\n break\r\n\r\n # incrementing start if integral\r\n # part lies on right side of the mid\r\n if (mid * mid < number):\r\n start = mid + 1\r\n # decrementing end if integral part\r\n # lies on the left side of the mid\r\n else:\r\n end = mid - 1\r\n # For computing the fractional part\r\n # of square root upto given precision\r\n increment = 0.1\r\n for i in range(0, precision):\r\n while (ans * ans <= number):\r\n ans += increment\r\n # loop terminates when ans * ans > number\r\n ans = ans - increment\r\n increment = increment / 10\r\n return ans\r\n\r\ndef countRectangles(l, w):\r\n # if we take gcd(l, w), this\r\n # will be largest possible\r\n # side for suare, hence minimum\r\n # number of square.\r\n squareSide = math.gcd(l, w)\r\n return int((l * w) / (squareSide * squareSide))\r\n\r\n# Function that count the\r\n# total numbersProgram between L\r\n# and R which have all the\r\n# digit same\r\ndef count_same_digit(L, R):\r\n tmp = 0\r\n ans = 0\r\n n = int(math.log10(R) + 1)\r\n for i in range(0, n):\r\n # tmp has all digits as 1\r\n tmp = tmp * 10 + 1\r\n for j in range(1, 10):\r\n\r\n if (L <= (tmp * j) and (tmp * j) <= R):\r\n #print(tmp*j)\r\n # Increment the required count\r\n ans += 1\r\n return ans\r\n#----------------------------------print k closest number of a number in an array\r\ndef findCrossOver(arr, low, high, x):\r\n # Base cases\r\n if (arr[high] <= x): # x is greater than all\r\n return high\r\n if (arr[low] > x): # x is smaller than all\r\n return low\r\n # Find the middle point\r\n mid = (low + high) // 2\r\n if (arr[mid] <= x and arr[mid + 1] > x):\r\n return mid\r\n if (arr[mid] < x):\r\n return findCrossOver(arr, mid + 1, high, x)\r\n return findCrossOver(arr, low, mid - 1, x)\r\ndef Kclosest(arr, x, k, n,ans):\r\n # Find the crossover point\r\n l = findCrossOver(arr, 0, n - 1, x)\r\n r = l + 1\r\n count = 0\r\n if (arr[l] == x):\r\n l -= 1\r\n #print(l)\r\n while (l >= 0 and r < n and count < k):\r\n if (x - arr[l] < arr[r] - x):\r\n ans.append(arr[l])\r\n l -= 1\r\n else:\r\n ans.append(arr[r])\r\n r += 1\r\n count += 1\r\n while (count < k and l >= 0):\r\n ans.append(arr[l])\r\n l -= 1\r\n count += 1\r\n while (count < k and r < n):\r\n ans.append(arr[r])\r\n r += 1\r\n count += 1\r\n return ans\r\n#---------------------------------------------------------------\r\ndef prime(n):\r\n if n <= 1: # negative numbers, 0 or 1\r\n return False\r\n if n <= 3: # 2 and 3\r\n return True\r\n if n % 2 == 0 or n % 3 == 0:\r\n return False\r\n\r\n for i in range(5, int(math.sqrt(n)) + 1, 2):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ndef calcSum(arr, n, k):\r\n # Initialize sum = 0\r\n l=[]\r\n sum=0\r\n # Consider first subarray of size k\r\n # Store the sum of elements\r\n for i in range(k):\r\n sum += arr[i]\r\n\r\n # Print the current sum\r\n l.append(sum)\r\n\r\n # Consider every subarray of size k\r\n # Remove first element and add current\r\n # element to the window\r\n for i in range(k, n):\r\n # Add the element which enters\r\n # into the window and substract\r\n # the element which pops out from\r\n # the window of the size K\r\n sum = (sum - arr[i - k]) + arr[i]\r\n\r\n # Print the sum of subarray\r\n l.append(sum)\r\n\r\n return l\r\n\r\n\r\ndef dfs(root,nodeVal,nodeConnection,visited):\r\n leftVal = nodeVal[root][0]\r\n rightVal = nodeVal[root][1]\r\n\r\n solution = []\r\n if nodeConnection[root]:\r\n visited.add(root)\r\n for i in nodeConnection[root]:\r\n if i not in visited:\r\n solution.append(dfs(i,nodeVal,nodeConnection,visited))\r\n # print(\"solution\",solution)\r\n leftMax = 0\r\n rightMax = 0\r\n for i in solution:\r\n l, r = i\r\n leftMax += max(abs(leftVal - l[0]) + l[1], abs(leftVal - r[0]) + r[1])\r\n rightMax += max(abs(rightVal - l[0]) + l[1], abs(rightVal - r[0]) + r[1])\r\n # print(root,\"return->\",(leftVal,leftMax),(rightVal,rightMax))\r\n return ((leftVal, leftMax), (rightVal, rightMax))\r\n else:\r\n # ((left,maxVal),(right,maxVal))\r\n return ((leftVal, 0), (rightVal, 0))\r\n\r\ndef luckynumber(x,n,a):\r\n if x >0:\r\n a.append(x)\r\n if x>10**9:\r\n return a\r\n else:\r\n if x < 1e12:\r\n luckynumber(x * 10 + 4,n,a)\r\n luckynumber(x * 10 + 7,n,a)\r\ndef lcm(a,b):\r\n return (a*b)//math.gcd(a,b)\r\n\r\ndef main():\r\n n=inpu()\r\n cnt=0\r\n while(n>9):\r\n n=sumofdigits(n)\r\n #print(n)\r\n cnt+=1\r\n print(cnt)\r\nif __name__ == '__main__':\r\n main()\r\n", "n = input()\r\nans = 0\r\nwhile len(n)>1:\r\n new = sum(int(i) for i in n)\r\n n = str(new)\r\n ans += 1\r\nprint(ans)", "n = input()\r\ncnt = 0\r\n\r\nif len(n) == 1:\r\n print('0')\r\n \r\nelse:\r\n while int(n) >= 10:\r\n total = 0\r\n for digit in n:\r\n total += int(digit)\r\n n = str(total)\r\n cnt += 1\r\n print(cnt)\r\n", "integer = input()\ni = 0\nx = integer\nsum = int(integer)\nloopCount = 0\n\nx = len(integer)\nwhile sum >= 10 :\n sum = 0\n while i<len(integer) :\n tmp = integer[i]\n\n sum += int(tmp)\n i += 1\n i = 0\n loopCount += 1\n integer = str(sum)\n\nprint(loopCount)\n\t \t \t \t\t \t\t\t\t \t \t\t \t", "num = int(input())\r\n\r\ni = 0\r\n\r\nwhile num >= 10:\r\n summation = 0\r\n for char in str(num):\r\n summation += int(char)\r\n num = summation\r\n i += 1 \r\n\r\nprint(i)", "number = input()\r\nT = 0\r\nwhile len(number) > 1:\r\n number = [int(i) for i in number]\r\n number = str(sum(number))\r\n T+=1\r\nprint(T)\r\n\r\n\r\n\r\n\r\n", "import math, array\n\ndef read_int():\n return int(input().strip())\n\ndef read_ints():\n return list(map(int, input().strip().split()))\n\ndef read_str():\n return input().strip()\n\ndef read_strs():\n return input().strip().split()\n\ndef main():\n n = read_int()\n\n\n\n count = 0\n \n while (n > 9):\n count += 1\n n = sum([int(i) for i in str(n)])\n\n print(count)\n\nif __name__ == '__main__':\n main()", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\ns=input()\r\nt=0\r\nwhile len(s)>1:\r\n s=str(sum(map(int,s)))\r\n t+=1\r\nprint(t)\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "def count_spells(n):\r\n count = 0\r\n while n >= 10:\r\n n = sum(int(digit) for digit in str(n))\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nspell_count = count_spells(n)\r\nprint(spell_count)\r\n", "n=int(input())\r\ncount=0\r\ntemp=n\r\nif(n<10):\r\n\tprint(0)\r\nelse:\r\n\twhile(temp>=10):\r\n\t\tl=list(map(int,list(str(temp))))\r\n\t\ttemp=sum(l)\r\n\t\tcount+=1\r\n\tprint(count)", "x=int(input(\"\"))\r\ny=str(x)\r\nct=0\r\nwhile(len(y)>1):\r\n ans=0\r\n ct+=1\r\n for i in range(len(y)):\r\n ans+=int(y[i])\r\n \r\n y=str(ans)\r\n\r\nprint(ct)\r\n\r\n\r\n\r\n", "\r\narr = input(\"\")\r\nc =0\r\nz = 0\r\nwhile len(arr) > 1:\r\n z = 0\r\n c +=1\r\n for i in arr:\r\n z += int(i)\r\n arr = str(z)\r\nprint(c)", "from sys import stdin , stdout\r\nfrom os import path\r\nif path.exists(\"input.txt\"):\r\n\tstdin = open(\"input.txt\",'r')\r\nsize = int(stdin.readline())\r\ncounter = 0 \r\nwhile size > 9 :\r\n\tcounter +=1\r\n\tsize = sum(map(int,str(size)))\r\nprint(counter)", "def sum(st):\r\n sum1=0\r\n for i in range(len(st)):\r\n sum1+=int(st[i])\r\n return(str(sum1))\r\ns=input()\r\nif len(s)==1:\r\n print('0')\r\nelse:\r\n count=1\r\n while True:\r\n s=sum(s)\r\n if len(s)==1:\r\n print(count)\r\n break\r\n else:\r\n count+=1\r\n\r\n", "n=int(input())\nans=0\nwhile(n>=10):\n li=str(n)\n tem=0\n for t in li:\n tem+=int(t)\n n=tem\n ans+=1\nprint(ans)\n \t\t \t \t \t\t \t \t\t \t \t \t\t\t", "it = 0\r\ndef magic_num(num):\r\n global it\r\n num = str(num)\r\n s = 0\r\n \r\n for x in range(0,len(num)):\r\n s+=int(num[x])\r\n \r\n if(int(num) <= 9):\r\n return int(s)\r\n else:\r\n it+=1\r\n return magic_num(str(s))\r\n\r\ndef main():\r\n i = input()\r\n magic_num(i)\r\n print(it)\r\nmain()\r\n", "def sd(n):\r\n s = str(n)\r\n t = 0\r\n for i in s:\r\n t = t + int(i)\r\n return t\r\n\r\nn = int(input())\r\nd = 0\r\nwhile (n >= 10):\r\n n = sd(n)\r\n d = d + 1\r\nprint(d)", "count=0\r\ntotal=0\r\nd = input()\r\nn=0\r\ni=0\r\nwhile True:\r\n d = str(d)\r\n n = len(list(d))\r\n # print(n)\r\n total=0\r\n if n>1:\r\n count = count+1\r\n d = list(map(int,d))\r\n for i in d:\r\n total = total + i\r\n d = total\r\n # print(d)\r\n else:\r\n break\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# from math import gcd as gcd\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound)\r\n\r\n# t = 1\r\n# t = int(input())\r\n# for i in range(t):\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n# b = list(map(int, input().split()))\r\n\r\ns = input().strip()\r\n# d = {}\r\nif (len(s) == 1):\r\n print(\"0\")\r\nelse:\r\n ans, sm = 0, 0\r\n for i in s:\r\n # if (i in d):\r\n # d[i] += 1\r\n # else:\r\n # d[i] = 1\r\n sm += int(i)\r\n if (sm < 10):\r\n print(\"1\")\r\n else:\r\n while (sm >= 10):\r\n ans += 1\r\n x = str(sm).strip()\r\n sm = 0\r\n # for i in d:\r\n # d[i] = 0\r\n for i in x:\r\n # d[i] += 1\r\n sm += int(i)\r\n print(ans + 1)", "n,x=input(),0\r\nwhile len(n)!=1:\r\n n=str(sum(map(int,list(n))))\r\n x+=1\r\nprint(x)", "arr = list(input())\r\nfor i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\nx = 0\r\nwhile len(arr) > 1:\r\n arr = list(str(sum(arr)))\r\n for i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n x += 1\r\n\r\nprint(x)", "Str = input()\r\n#print(len(Str))\r\nCount, Sum = 0, 0\r\nj = 0\r\nwhile(True):\r\n Sum = 0\r\n if(len(Str) == 1):\r\n break\r\n for i in Str:\r\n Sum = Sum + int(i)\r\n\r\n #print(\"sum = \", Sum , \" , Count = \", Count)\r\n Str = str(Sum)\r\n Count += 1\r\n #j = j + 1\r\n\r\n#print(Str)\r\nprint(Count)\r\n ", "n = input()\r\nans = 0\r\n\r\nwhile len(n) > 1:\r\n n = str(sum(map(int, n)))\r\n ans += 1\r\n\r\nprint(ans)", "def digit_sum(n):\n return sum(int(x) for x in str(n))\n\nn = int(input())\ncount = 0\n\nwhile n >= 10:\n n = digit_sum(n)\n count += 1\n\nprint(count)\n\n \t \t \t \t \t\t\t\t \t \t \t \t \t\t\t", "t = 0\r\nn = input()\r\nwhile len(n) > 1:\r\n n = str(sum([int(i) for i in n ]))\r\n t+=1\r\n \r\n\r\nprint(t)", "num = int(input())\r\nc = 0\r\nwhile(num//10 != 0):\r\n num = sum(int(i) for i in str(num))\r\n c += 1\r\nprint(c)", "n = input()\r\nSum = 0\r\ncounter = 0\r\ni = 0\r\nwhile len(n) > 1:\r\n while i < len(n):\r\n Sum = Sum + int(n[i])\r\n i += 1\r\n counter += 1\r\n i = 0\r\n n = str(Sum)\r\n Sum = 0\r\n\r\nprint(counter)", "t = 0\nn = input()\nwhile len(n) > 1:\n n = str(sum([int(i) for i in n ]))\n t+=1\n \n\nprint(t)\n\t\t\t\t \t \t\t\t \t \t \t \t\t\t\t\t \t\t", "def sof(x):\r\n b=str(x)\r\n a=0\r\n for i in b:\r\n a+=int(i)\r\n return a\r\n\r\n\r\nn=int(input())\r\nans=0\r\nwhile n>9:\r\n n=sof(n)\r\n ans+=1\r\nprint(ans)", "x = int(input())\r\ncount = 0\r\nwhile int(x) > 0:\r\n v = [int(i) for i in str(x)]\r\n if len(v) == 1:\r\n break\r\n x = sum(v)\r\n count +=1\r\nprint(count)", "from sys import stdin as sin\r\ndef aint():return int(sin.readline())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return str(sin.readline().split())\r\nfrom collections import defaultdict as dd\r\n\r\n\r\nn = input()\r\nans=0\r\nwhile len(n)>1:\r\n l = list(n)\r\n n=0\r\n for i in l:\r\n n+=int(i)\r\n n=str(n)\r\n ans+=1\r\nprint(ans)", "v = input()\r\ni = 0\r\nwhile len(v) > 1:\r\n i += 1\r\n v = str(sum(map(int, v)))\r\n\r\nprint(i)\r\n", "n = input()\r\nlst = []\r\nfor i in n: lst.append(int(i))\r\n\r\ncnt = 0\r\nwhile len(lst) != 1:\r\n\tnum = sum(lst)\r\n\tlst = []\r\n\tfor i in str(num):\r\n\t\tlst.append(int(i))\r\n\tcnt += 1\r\nprint(cnt)\r\n\r\n\r\n", "s=input()\r\ncount=0\r\nwhile(len(s)>1):\r\n s = str(sum(map(int,s)))\r\n count+=1\r\nprint(count)\r\n", "n=input()\nx=0\nif(int(n)<10):\n print(\"0\")\nelse:\n count=1\n for i in n:\n x+=int(i)\n n=str(x)\n x=0\n while(len(str(n))!=1):\n count+=1\n for i in str(n):\n x+=int(i)\n n=x\n x=0\n print(count)\n\t\t\t \t \t \t \t\t \t\t\t\t \t \t \t\t\t\t\t\t", "n=input()\r\ns=0\r\nwhile len(n)>1:\r\n\tn=str(sum(map(int,n)))\r\n\ts+=1\r\nprint(s)", "def addStrings(s):\r\n res = \"\"\r\n sum = 0\r\n for char in s:\r\n sum += int(char)\r\n res += str(sum)\r\n return res\r\n\r\n\r\ns = input()\r\ncount = 0\r\nwhile(len(s) != 1):\r\n s = addStrings(s)\r\n count += 1\r\nprint(count)\r\n", "num = input()\r\n\r\nedit_count = 0\r\nwhile len(num) > 1:\r\n num = str(sum(map(int, num)))\r\n edit_count += 1\r\n\r\n\r\nprint(edit_count)\r\n", "def sumdigits(n):\r\n digits = list(map(int, list(str(n))))\r\n return sum(digits)\r\nn = int(input())\r\nscore = 0\r\nwhile n%10 != n:\r\n n = sumdigits(n)\r\n score += 1\r\nprint(score)", "def chaifen(Input):\n List=[]\n for letter in Input:\n List.append(letter)\n return List\ndef jiafa(List):\n sum=0\n for letter in List:\n sum=sum+int(letter)\n return sum\nn=input()\ncount=0\nif int(n)>=10:\n while 1 == 1:\n count = count + 1\n List = chaifen(n)\n sum = jiafa(List)\n if sum < 10:\n break\n n = str(sum)\nprint(count)\n\t\t \t \t \t \t \t \t\t \t\t \t", "n = input()\nans = 0\nu = 0\nwhile len(n)-1:\n for i in n:\n u += int(i)\n n = str(u)\n u = 0\n ans += 1\nprint(ans)\n", "def sum_of_digits(n, counter):\r\n if len(n) == 1:\r\n return counter\r\n \r\n _sum = 0\r\n counter += 1\r\n \r\n for i in n:\r\n _sum += int(i)\r\n \r\n return sum_of_digits(str(_sum), counter)\r\n\r\n\r\nnum = input()\r\ncounter = 0\r\nprint(sum_of_digits(num, counter))", "n = input().strip()\nif len(n) == 1:\n print(0)\nelse:\n num = 0\n for c in n:\n num += int(c)\n\n count = 1\n num_str = str(num)\n while len(num_str) > 1:\n count += 1\n num = sum(map(int, num_str))\n num_str = str(num)\n print(count)\n\n\n", "n = list(input())\r\nk = 0\r\nwhile len(n) >1:\r\n k+=1\r\n n = list(str(sum(list(map(int,n)))))\r\nprint(k)", "def change(s):\r\n x = 0\r\n for i in s:\r\n x += ord(i) - ord('0')\r\n return str(x)\r\n\r\n\r\ns = input()\r\n\r\nc = 0\r\nwhile len(s) > 1:\r\n s = change(s)\r\n c += 1\r\n\r\n\r\nprint(c)", "str1 = input()\r\nnumList = [int(i) for i in str1]\r\ncount = 0\r\nwhile len(numList) > 1:\r\n str1 = str(sum(numList))\r\n numList = [int(i) for i in str1]\r\n count += 1\r\nprint(count)", "n = input()\nspell = 0\n \nwhile len(n) > 1 :\n new_n = 0\n for i in range(len(n)) :\n new_n += int(n[i])\n n = str(new_n)\n spell += 1\nprint(spell)", "n = input()\r\nnLoops = 0\r\nwhile True:\r\n if len(n)<2:\r\n break\r\n summa = 0 \r\n for c in n:\r\n summa += int(c)\r\n n = str(summa)\r\n nLoops += 1\r\nprint(nLoops)\r\n ", "n = input()\r\n\r\ncount = 0\r\nsize = len(n)\r\nwhile(size>1):\r\n sum = 0\r\n for j in n:\r\n sum += int(j)\r\n\r\n count += 1\r\n n = str(sum)\r\n size = len(n)\r\n \r\nprint(count)", "\"Codeforces Round #339 (Div. 2)\"\n\"B. Gena's Code\"\n# y=int(input())\n# # a=list(map(int,input().split()))\n# a=list(input().split())\n# nz=0\n# nb=''\n# z=0\n# # print(len(str(z)))\n# for i in a:\n# if i=='0':\n# z=1\n# break\n# else:\n# s='1'\n# l=(len(i)-1)\n# qz='0'*l\n# s+=qz\n# if s==i:\n# nz+=l\n# else:\n# nb=i\n# if nb=='':\n# nb='1' \n# ans=nb+('0'*nz)\n# if z==1:\n# ans='0'\n# print(ans) \n\"Codeforces Round #177 (Div. 2)\"\n\"B. Polo the Penguin and Matrix\"\n# n,m,d=map(int,input().split())\n# a=[]\n# for i in range(n):\n# b=list(map(int,input().split()))\n# a.extend(b)\n# a.sort()\n# fa=a[0]\n# f=0\n# c=(a[len(a)//2]-fa)//d\n# moves=0\n# for i in a:\n# if (i-fa)%d>0:\n# f=-1\n# moves+=abs(int((i-fa)/d)-c)\n# if f==-1:\n# print(-1)\n# else:\n# print(moves) \n\"Codeforces Round #264 (Div. 2)\"\n\"B. Caisa and Pylons\"\n# y=int(input())\n# a=list(map(int,input().split()))\n# mini=0\n# p=-a[0]\n# for i in range(1,y):\n# if p<mini:\n# mini=p\n# p=p+a[i-1]-a[i] \n# if p<mini:\n# mini=p \n# if mini<0:\n# print(-1*mini)\n# else:\n# print(0) \n\"Codeforces Beta Round #79 (Div. 2 Only)\"\n\"B. Sum of Digits\"\ny=input()\ndef sumofdigits(s):\n ans=0\n for i in s:\n ans+=int(i)\n return ans\nn=0 \nwhile len(y)>1:\n n+=1\n y=str(sumofdigits(y)) \n\nprint(n)\n", "n = input()\nsteps = 0\n\nwhile len(n) > 1:\n total = 0\n for d in n:\n total += ord(d) - ord('0')\n steps += 1\n n = str(total)\n\nprint(steps)\n", "n = input()\r\nmoves = 0\r\nwhile len(n) != 1:\r\n num = [int(i) for i in n]\r\n n = str(sum(num))\r\n moves += 1\r\nprint(moves)\r\n", "n=input()\r\nl = len(n)\r\ni=0\r\nwhile True:\r\n if n=='0' or n=='1' or n=='2' or n=='3' or n=='4' or n=='5' or n=='6' or n=='7' or n=='8' or n=='9':\r\n break\r\n sm=0\r\n for j in n:\r\n sm+=int(j)\r\n n=str(sm)\r\n i+=1\r\nprint(i)", "s=input()\r\nk=0\r\nwhile len(s)!=1:\r\n k+=1\r\n n=0\r\n for i in s:\r\n n+=int(i)\r\n s=str(n)\r\nprint(k)\r\n", "def sd(n):\n ans = 0\n for i in str(n):\n ans += int(i)\n return ans\n\nn = int(input())\n\nans = 0\nwhile len(str(n)) > 1:\n n = sd(n)\n ans+=1\n\nprint(ans)", "def sumOfDigits(n):\r\n\tlst = [int(i) for i in str(n)]\r\n\treturn sum(lst)\r\nn = int(input())\r\nans = 0\r\nwhile n > 9:\r\n\tn = sumOfDigits(n)\r\n\tans += 1\r\nprint(ans)", "n = int(input())\r\ntransformations_conter = 0\r\n\r\nwhile(n > 9):\r\n n = sum([int(x) for x in str(n)])\r\n transformations_conter += 1\r\n\r\nprint(transformations_conter)", "strNumber=input()\r\ncounter=0\r\nif (len(strNumber)<2):\r\n print(0)\r\nelse:\r\n x=11\r\n while x>=10:\r\n x=0\r\n for i in strNumber:\r\n x+=(int(i))\r\n counter+=1\r\n strNumber=str(x)\r\n print(counter)\r\n ", "def spell(n, i=0):\n if len(n) == 1:\n return i\n \n return spell(str(sum([int(x) for x in n])), i+1)\n\nprint(spell(input()))", "n=input()\r\ncntr=0\r\nwhile len(n)>1:\r\n temp=0\r\n for i in n:\r\n temp+=int(i)\r\n n=str(temp)\r\n cntr+=1\r\nprint(cntr)", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\ninput = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nn = list(map(int, list(input().strip())))\r\nans = 0\r\nwhile len(n) > 1:\r\n n = list(map(int, list(str(sum(n)))))\r\n ans += 1\r\nprint(ans)\r\n", "s = input()\r\ni = 0\r\nwhile len(s) != 1:\r\n ans = 0\r\n for e in range(len(s)):\r\n ans += int(s[e])\r\n s = str(ans)\r\n i += 1\r\nprint(i)\r\n\r\n", "from math import log10\n\nnum = int (input())\nans=0\n\ndef getSum(n):\n sum=0\n n = str(n)\n for c in n:\n sum += int (c)\n return sum\n\nwhile (num>9):\n num = getSum(num)\n ans+=1\n\nprint (ans)", "x = str(input())\r\nif len(x) == 1:\r\n print(0)\r\nelse:\r\n x = ' '.join(x)\r\n x = x.split()\r\n\r\n for i in range(len(x)):\r\n x[i] = int(x[i])\r\n c = 0\r\n while sum(x)>9:\r\n x = sum(x)\r\n x = ' '.join(str(x))\r\n x = x.split()\r\n for i in range(len(x)):\r\n x[i] = int(x[i])\r\n c +=1\r\n\r\n print(c+1)", "def magic(s, n=0):\n\tt = str(sum(list(map(int, list(s)))))\n\tif len(t) == 1:\n\t\treturn n + 1\n\telse:\n\t\treturn magic(t, n + 1)\n\nn = input()\nif len(n) == 1:\n\tprint(0)\nelse:\n\tprint(magic(n))\n\n\t \t\t \t\t\t\t\t\t\t\t\t\t \t \t\t\t \t \t", "num = input()\nnum = list(num)\ncnt = 0\nwhile len(num) != 1:\n sum = 0\n for n in num:\n sum = sum + int(n)\n strnum = str(sum)\n num = list(strnum)\n cnt = cnt + 1\nprint(cnt)\n\n \t\t \t\t \t\t\t \t \t \t\t \t \t", "def sum_digits(inp):\r\n list1=[]\r\n for i in inp:\r\n list1.append(int(i))\r\n return str(sum(list1))\r\nx=input()\r\ncount=0\r\nwhile True:\r\n if len(x)==1:\r\n print(count)\r\n break\r\n else:\r\n x=sum_digits(x)\r\n count+=1", "def convert_num(num: int, k: int = 0):\n num_str = str(num)\n if len(num_str) == 1:\n print(k)\n return\n else:\n sum = 0\n for i in num_str:\n sum += int(i)\n convert_num(sum, k + 1)\n\n\nn = int(input())\nconvert_num(n)\n", "n = input()\r\nnumTimes = 0\r\ncurrentNum = n\r\nwhile len(currentNum) > 1:\r\n newNum = 0\r\n for num in currentNum:\r\n newNum += int(num)\r\n currentNum = str(newNum)\r\n numTimes += 1\r\nprint(numTimes)", "n = int(input())\r\n\r\npasos = 0\r\n\r\nwhile n > 9:\r\n pasos += 1\r\n str_n = str(n)\r\n new_n = 0\r\n for i in str_n:\r\n new_n += int(i)\r\n n = new_n\r\n\r\nprint(pasos)", "num = [int(x) for x in list(input())]\r\ni = 0\r\nwhile len(num) != 1:\r\n num = [int(x) for x in list(str(sum(num)))]\r\n i += 1\r\nprint(i)", "s = input().strip()\r\ncounter = 0\r\n\r\nwhile len(s) > 1:\r\n total = sum(int(digit) for digit in s)\r\n s = str(total)\r\n counter += 1\r\n\r\nprint(counter)\r\n", "def convert_to_sum_digits(string):\r\n sum_digits = 0\r\n for i in string:\r\n sum_digits += int(i)\r\n return str(sum_digits)\r\n\r\nstring = input()\r\nspells= 0\r\nwhile len(string)>1:\r\n spells +=1\r\n string = convert_to_sum_digits(string)\r\nprint(spells)\r\n", "number = input()\r\nk = 0\r\nwhile len(number) != 1:\r\n\tamount = 0\r\n\tfor i in range(len(number)):\r\n\t\tamount += int(number[i])\r\n\tnumber = str(amount)\r\n\tk += 1\r\nprint(k)\r\n\r\n\r\n\r\n", "n=input()\r\nsu=sum([int(i) for i in n])\r\nif int(n)%10==int(n):\r\n ne=0\r\nelse:\r\n ne=1\r\nwhile su!=su%10:\r\n su=sum([int(i) for i in str(su)])\r\n ne+=1\r\nprint(ne)", "n = int(input())\r\n\r\ni = 0\r\n\r\nwhile n > 9:\r\n n = sum(map(int,str(n)))\r\n i+=1\r\n\r\nprint(i)", "number = 0\r\nnumber = str(input())\r\nans = 0\r\nl = len(number)\r\nwhile l > 1:\r\n sum = 0\r\n for i in number:\r\n sum = sum + int(i)\r\n number = str(sum)\r\n l = len(number)\r\n ans = ans + 1\r\nprint(ans)", "from sys import stdin\n\nn = list(map(int, list(stdin.readline().strip())))\n\nif len(n) == 1:\n print(0)\nelse:\n count = 0\n while len(n) != 1:\n n = list(map(int, str(sum(n)).strip()))\n count += 1\n\n print(count)\n\n \t\t \t \t\t\t \t \t\t \t \t \t", "n=str(input())\r\na=0\r\nwhile len(str(n))!=1:\r\n c = 0\r\n for i in range(10):\r\n c=c+i*str(n).count(str(i))\r\n n=c\r\n a=a+1\r\nprint(a)\r\n", "def sumDigit(s):\n ans = 0\n for i in s:\n ans += int(i)\n return str(ans)\n\nn = input()\n\nans = 0\nwhile True:\n if len(n) == 1:\n break\n ans += 1\n n = sumDigit(n)\n\n\nprint(ans)\n\n \t \t\t \t\t \t\t \t \t \t \t \t\t \t", "n=input()\r\nans=0\r\nwhile(len(str(n))>1):\r\n\tn=sum(map(int,str(n)))\r\n\tans+=1\r\n\r\nprint(ans)", "n=list(input(\"\"))\r\nsum=0\r\ncount=0\r\nwhile len(n) !=1:\r\n for i in n:\r\n sum+=int(i)\r\n n=str(sum)\r\n #print(n)\r\n count+=1\r\n sum=0\r\n\r\nprint(count)", "n = list(input())\r\n# n = list(map(int, n))\r\n\r\nres = 0\r\nwhile int(''.join(n)) // 10 != 0:\r\n r = sum(map(int, n))\r\n s = str(r)\r\n n = list(s)\r\n res += 1\r\n\r\nprint(res)\r\n", "s=input()\r\narr=list(map(int,list(s)))\r\ncount=0\r\nwhile len(arr) != 1:\r\n val=str(sum(arr))\r\n arr.clear()\r\n count+=1\r\n arr=list(map(int,list(val)))\r\nprint(count)", "n=int(input())\nans=0\nwhile(n>=10):\n ans+=1\n n=sum(int(i) for i in str(n))\n\nprint(ans)\n \t\t \t\t \t\t\t\t\t \t \t \t \t \t", "n = input()\n\nif len(n) == 1:\n print(0)\n exit()\nsum = 0\nans = 0\nfor i in range(len(n)):\n sum += ord(n[i]) - ord(\"0\")\n\nans += 1\n\nwhile sum > 9:\n new_sum = 0\n while sum > 0:\n new_sum += sum % 10\n sum = sum // 10\n sum = new_sum\n ans += 1\n\nprint(ans)\n\t\t\t \t \t\t \t\t \t \t \t \t\t \t\t\t\t\t", "n = input()\r\ng=0\r\nwhile len(n)!=1:\r\n g+=1\r\n n = list(n)\r\n k=0\r\n for i in n:\r\n k+=int(i)\r\n n=str(k)\r\nprint(g)", "lol = int(input())\n\nscore = 0\n\nman = str(lol)\n\nwhile (len(man)>1):\n man = str(sum([int(i) for i in list(man)]))\n score+=1\n\nprint(score)", "num=str(input())\r\ncount=0\r\nwhile True:\r\n if len(num)==1:\r\n print(count)\r\n break\r\n else:\r\n temp=0\r\n for c in num:\r\n temp+=int(c)\r\n num=str(temp)\r\n count+=1", "def solve():\r\n n = input()\r\n count = 0 \r\n while len(n) > 1: \r\n summ = 0\r\n for d in n: summ+= int(d)\r\n n = str(summ)\r\n count+=1\r\n print(count)\r\nsolve()", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = list(map(int, list(input()[:-1])))\r\nk = 0\r\nwhile len(n) > 1:\r\n k += 1\r\n n = list(map(int, list(str(sum(n)))))\r\nprint(k)\r\n", "n = input()\r\nspell = 0\r\n\r\nwhile len(n) > 1:\r\n s = 0\r\n \r\n for digit in n:\r\n s += int(digit)\r\n\r\n spell += 1\r\n n = str(s)\r\n\r\nprint(spell)\r\n", "numbers = {\n \n \"0\": 0,\n \"1\": 1,\n \"2\": 2,\n \"3\": 3,\n \"4\": 4,\n \"5\": 5,\n \"6\": 6,\n \"7\": 7,\n \"8\": 8,\n \"9\": 9\n}\n\nnumber = input()\n\ncount = 0\n\ndef Solution(number: str):\n \n if len(number) > 1:\n \n global count\n count += 1\n newNumber = 0\n \n for char in number:\n newNumber += numbers[char]\n \n Solution(str(newNumber))\n\nSolution(number)\nprint(count)", "s = input()\r\nc = 0\r\nwhile len(s) > 1:\r\n\ts = str(sum(map(int, s)))\r\n\tc += 1\r\nprint(c)\r\n", "def digit_sum(n):\n sum = 0\n for i in range(0,len(n)):\n sum += int(n[i])\n return sum\n\nn = input()\ni = 0\nwhile (len(n) > 1):\n n = str(digit_sum(n))\n i += 1\n\nprint(i)\n", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline()\n\nn = input().strip()\n\ndigits = list(n)\n\ncount = 0\nwhile len(digits) > 1:\n\tdigits = list(str(sum([int(x) for x in digits])))\n\tcount += 1\n\nprint(count)\n\n\n\n\n\n\n\n\n\t\n\n\n\n\t\t\n\n\t\t\n\n", "\r\nn = int(input())\r\n\r\nnn = str(n) \r\n\r\nsumm = 0 \r\n\r\ncnt = 0\r\n\r\nwhile(len(nn)!=1) :\r\n \r\n for i in range(len(nn)) :\r\n \r\n summ = summ + int(nn[i])\r\n \r\n nn = str(summ)\r\n \r\n cnt = cnt + 1\r\n \r\n summ = 0\r\n \r\nprint(cnt)", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\ndef f(x: str): return str(sum(map(int, x)))\n\n\ns = get(str)\ni = 0\nwhile len(s) > 1:\n i += 1\n s = f(s)\nprint(i)\n", "k = input()\r\nc= 0\r\nwhile True:\r\n summ = 0\r\n if len(k) == 1 :\r\n break\r\n for i in k :\r\n summ += int(i)\r\n k = str(summ)\r\n c+=1\r\n\r\nprint(c)", "n=int(input())\r\nk=n\r\na=0\r\ns=str(n)\r\nj=0\r\nwhile k>9:\r\n for i in range(len(s)):\r\n a=a+int(s[i])\r\n k=a\r\n a=0\r\n j=j+1\r\n s=str(k)\r\n\r\nprint(j)\r\n\r\n\r\n", "n = list(map(int, list(input())))\r\ncount = 0\r\nwhile len(n) != 1:\r\n\tn = sum(n)\r\n\tn = list(map(int, list(str(n))))\r\n\tcount += 1\r\nprint(count)", "ch=str(input())\r\ndef sumd(c):\r\n s=0\r\n for i in c:\r\n s+=int(i)\r\n return s \r\nif len(ch)==1:\r\n print(0)\r\nelse:\r\n s=0\r\n while(len(ch)>1):\r\n c=str(sumd(ch))\r\n ch=c\r\n s+=1\r\n print(s) ", "'''Author : seraph14'''\r\nimport sys, io, os\r\nimport heapq\r\nif 'PyPy' in sys.version:\r\n from _continuation import continulet\r\nelse:\r\n import threading\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ninput = sys.stdin.readline\r\n\r\nhqp = heapq.heappop\r\nhqs = heapq.heappush\r\n\r\n############ ---- Output Function ---- ############\r\ndef _print(*argv, sep=\" \"):\r\n sys.stdout.write(sep.join(map(str, argv)) + \"\\n\")\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\ndef insr():\r\n if input == sys.stdin.readline:\r\n s = input()\r\n return list(s.strip())\r\n else:\r\n s = input().decode()\r\n return (list(s[:len(s)-2]))\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\ndef get_bool(right):\r\n return \"YES\" if right else \"NO\"\r\n\r\ndef solve():\r\n pass\r\n\r\ndef main():\r\n n = insr()\r\n c = 0\r\n while len(n) > 1:\r\n c += 1\r\n n = list(str(sum(map(int, n))))\r\n\r\n _print(c)\r\n\r\nif __name__ == '__main__':\r\n if 'PyPy' in sys.version:\r\n\r\n def bootstrap(cont):\r\n call, arg = cont.switch()\r\n while True:\r\n call, arg = cont.switch(\r\n to=continulet(lambda _, f, args: f(*args), call, arg))\r\n cont = continulet(bootstrap)\r\n cont.switch()\r\n main()\r\n else:\r\n sys.setrecursionlimit(1 << 30)\r\n threading.stack_size(1 << 27)\r\n\r\n main_thread = threading.Thread(target=main)\r\n main_thread.start()\r\n main_thread.join()", "def count_operations_to_single_digit(num):\r\n count = 0\r\n while num >= 10:\r\n num = sum(int(digit) for digit in str(num))\r\n count += 1\r\n return count\r\n\r\n# Input\r\nn = int(input().strip())\r\n\r\n# Output\r\nresult = count_operations_to_single_digit(n)\r\nprint(result)\r\n", "*n, = input()\r\nans = 0\r\nwhile len(n) - 1:\r\n *n, = str(sum(list(map(int, ''.join(n)))))\r\n ans += 1\r\nprint(ans)\r\n", "\r\nn = input()\r\nans = 0\r\n\r\nwhile len(n) > 1:\r\n n = sum([int(i) for i in n])\r\n n = str(n)\r\n ans += 1\r\n\r\nprint(ans) ", "\"\"\"\r\n ____ _ _____\r\n / ___|___ __| | ___| ___|__ _ __ ___ ___ ___\r\n| | / _ \\ / _` |/ _ \\ |_ / _ \\| '__/ __/ _ \\/ __|\r\n| |__| (_) | (_| | __/ _| (_) | | | (_| __/\\__ \\\r\n \\____\\___/ \\__,_|\\___|_| \\___/|_| \\___\\___||___/\r\n\r\n\"\"\"\r\n\"\"\"\r\n░░██▄░░░░░░░░░░░▄██\r\n░▄▀░█▄░░░░░░░░▄█░░█░\r\n░█░▄░█▄░░░░░░▄█░▄░█░\r\n░█░██████████████▄█░\r\n░█████▀▀████▀▀█████░\r\n▄█▀█▀░░░████░░░▀▀███\r\n██░░▀████▀▀████▀░░██\r\n██░░░░█▀░░░░▀█░░░░██\r\n███▄░░░░░░░░░░░░▄███\r\n░▀███▄░░████░░▄███▀░\r\n░░░▀██▄░▀██▀░▄██▀░░░\r\n░░░░░░▀██████▀░░░░░░\r\n░░░░░░░░░░░░░░░░░░░░\r\n\"\"\"\r\n\r\nimport sys\r\nimport math\r\nimport collections\r\nimport operator as op\r\nfrom collections import deque\r\nfrom math import gcd, inf, sqrt\r\nfrom bisect import bisect_right, bisect_left\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\nfrom functools import reduce\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nsetrecursionlimit(2**20)\r\n\r\n\r\ndef factorial(n):\r\n if n == 0:\r\n return 1\r\n return n * factorial(n - 1)\r\n\r\n\r\ndef ncr(n, r):\r\n r = min(r, n - r)\r\n numer = reduce(op.mul, range(n, n - r, -1), 1)\r\n denom = reduce(op.mul, range(1, r + 1), 1)\r\n return numer // denom # or / in Python 2\r\n\r\n\r\ndef prime_factors(n):\r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.append(i)\r\n if n > 1:\r\n factors.append(n)\r\n return len(set(factors))\r\n\r\n\r\ndef isPowerOfTwo(x):\r\n return (x and (not(x & (x - 1))))\r\n\r\n\r\ndef factors(n):\r\n return list(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))\r\n\r\nMOD = 10**9 + 7\r\nT = 1\r\n# T = int(stdin.readline())\r\nfor _ in range(T):\r\n # a, b = list(map(int, stdin.readline().split()))\r\n # s1 = list(stdin.readline().strip('\\n'))\r\n # s2 = list(stdin.readline().strip('\\n'))\r\n #n = int(stdin.readline())\r\n # a, b, n = list(map(int, stdin.readline().split()))\r\n # n, k = list(map(int, stdin.readline().split()))\r\n n = str(stdin.readline().strip('\\n'))\r\n # s2 = str(stdin.readline().strip('\\n'))\r\n d = {}\r\n k = 0\r\n while len(n) > 1:\r\n ans = 0\r\n for i in n:\r\n ans += int(i)\r\n n = str(ans)\r\n k += 1\r\n print(k)\r\n", "# https://codeforces.com/contest/102/problem/B\r\nimport sys\r\n\r\nn = sys.stdin.readline().replace('\\n', '')\r\n\r\nresult = 0\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n while len(n) > 1:\r\n sum_n = 0\r\n for ch in n:\r\n sum_n += int(ch)\r\n n = str(sum_n)\r\n result += 1\r\n\r\n print(result)\r\n", "num = input()\r\n\r\ndef f(num):\r\n if len(num)<2:\r\n return 0\r\n \r\n ans = 0\r\n for x in num:\r\n ans += ord(x)-ord('0')\r\n ans = str(ans)\r\n return 1+f(ans)\r\n\r\nprint(f(num))", "n = list(input())\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n c = 0\r\n flag = True\r\n while flag:\r\n c += 1\r\n sums = sum([int(x) for x in n])\r\n n = list(str(sums))\r\n if len(n) == 1:\r\n flag = False\r\n break\r\n print(c)", "n = input()\r\nt =0\r\ns = 0\r\nwhile len(n)>1:\r\n\tfor i in n:\r\n\t\ts += int(i)\r\n\tt+=1\r\n\tn = str(s)\r\n\ts =0\r\nprint(t)", "import sys\r\ndef main() :\r\n n = int(sys.stdin.readline())\r\n if n%10 == n :\r\n print(0)\r\n else :\r\n i = 0\r\n while 1 :\r\n i+=1\r\n l = list(str(n))\r\n s = sum([int(x) for x in l])\r\n if s%10 == s :\r\n break\r\n n = s \r\n print(i) \r\n\r\nmain() ", "s=input()\nc=0\nwhile(len(s)>1):\n s=str(sum(int(x) for x in s))\n c+=1\nprint(c)\n\t \t \t \t \t\t \t\t\t \t \t\t\t\t\t \t \t\t", "n = input()\r\na = 0\r\nwhile len(n) != 1:\r\n n = str(sum(list(map(int, n))))\r\n a += 1\r\nprint(a)\r\n", "# import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\ns=input()\r\nli=list(map(int,list(s)))\r\nans=0\r\nwhile len(li)!=1:\r\n su=sum(li)\r\n st=str(su)\r\n li=list(map(int,list(st)))\r\n ans+=1\r\nprint(ans)\r\n \r\n ", "n=int(input())\r\nnstr=str(n)\r\ncount=0\r\nwhile(len(nstr)>1):\r\n lst=list(nstr)\r\n n=0\r\n for i in range(len(lst)):\r\n n+=int(lst[i])\r\n nstr=str(n)\r\n count+=1\r\nprint(count)", "n = input()\n\nres = 0\n\nwhile len(n) > 1:\n num = 0\n\n for c in n:\n num += int(c)\n\n n = str(num)\n res += 1\n\nprint(res)\n \t \t \t\t\t \t\t\t \t\t \t \t\t\t \t \t", "import sys\r\ncin = int(sys.stdin.readline().strip())\r\nans = 0\r\nwhile(len(str(cin)) != 1):\r\n s = str(cin)\r\n newcin = 0\r\n pos = 0\r\n for i in s:\r\n newcin+=int(i)\r\n ans+=1\r\n cin = newcin\r\nprint(ans)\r\n \r\n", "n = input()\r\n\r\ni= 0\r\nsum = 0\r\ncounter = 0\r\n\r\nwhile len(str(n))>1:\r\n for i in range (0,len(str(n))):\r\n sum = sum + int(str(n[i]))\r\n n = str(sum)\r\n counter = counter+1\r\n sum = 0\r\nprint(counter)", "n = int(input())\r\nz = str(n)\r\nlength = len(z)\r\ncount = 0\r\nwhile length > 1:\r\n sum = 0\r\n for i in range(length):\r\n sum += int(z[i])\r\n z = str(sum)\r\n length = len(z)\r\n count += 1\r\nprint(count)", "from sys import stdin\nn=stdin.readline().strip()\nc=0\nwhile(len(n)!=1):\n s=0\n for i in n:\n s+=int(i)\n n=str(s)\n c+=1\nprint(c)\n\t\t\t\t \t \t\t \t\t\t\t \t \t \t\t", "def solution(input_value):\r\n count = 0\r\n if(input_value < 10):\r\n return 0\r\n while(input_value >= 10):\r\n strr = str(input_value)\r\n list_of_number = list(map(int, strr.strip()))\r\n input_value = sum(list_of_number)\r\n count += 1\r\n return count\r\ninput_value = int(input())\r\nprint(solution(input_value))", "def sum_no(n):\r\n\tsum_digit = 0\r\n\tfor digit in str(n):\r\n\t\tsum_digit += int(digit)\r\n\treturn sum_digit\r\n\r\nn = int(input())\r\ncount = 0\r\n\r\nwhile((n//10) != 0):\r\n\tn = sum_no(n)\r\n\tcount += 1\r\n\r\nprint(count)", "n=int(input())\ni=0\nwhile len(str(n)) !=1:\n sum=0\n for num in str(n):\n sum+=int(num)\n n=sum\n i+=1\nprint(i)\n", "n = int(input())\nfor i in range(10):\n p = [ int(i) for i in str(n)]\n s = sum(p)\n # print(p)\n if len(p) == 1:\n count = i\n break\n n = s\nprint(count)\n", "num_str = input()\nif(len(num_str) <= 1):\n\tprint(\"0\")\n\texit()\nnum = sum([int(char) for char in num_str])\ncount = 1\nwhile(num >= 10):\n\tnum = sum([int(char) for char in str(num)])\n\tcount += 1\nprint(count)", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn = I()\r\ns =0 \r\nwhile(n>9):\r\n n = sum(map(int, str(n)))\r\n s+=1\r\n\r\nprint(s)", "number = input()\ntimes = 0\nlength = len(number)\nwhile length !=1:\n Sum = 0\n for i in number:\n Sum += int(i)\n number = str(Sum)\n length = len(number) \n times+=1\nprint(times)\n \t\t\t \t \t \t \t\t\t \t \t\t \t", "n=input()\r\nans=0\r\nwhile(len(n)>1):\r\n ans+=1\r\n s=0\r\n for i in n:\r\n s+=int(i)\r\n n=str(s)\r\nprint(ans)", "def digital_sum(n):\n # 计算数字 n 的数字和\n s = 0\n for ch in str(n):\n s += int(ch)\n return s\n\nn = int(input())\ncount = 0\nwhile n >= 10:\n n = digital_sum(n)\n count += 1\nprint(count)\n\n \t \t \t\t \t \t\t\t\t\t\t\t\t\t \t\t \t \t\t\t\t", "n=int(input())\r\na=0\r\nwhile n>=10:\r\n b=0\r\n n1=str(n)\r\n for i in range(len(n1)):\r\n b+=int(n1[i])\r\n n=b\r\n a+=1\r\nprint(a)", "n=input()\r\n\r\nc = 0\r\nwhile len(n) != 1:\r\n n = str(sum(int(i) for i in n))\r\n c+= 1\r\nprint(c)", "n = input()\r\ncnt = 0\r\nwhile len(n) !=1:\r\n tmp = 0\r\n for i in n:\r\n tmp+=int(i)\r\n n = str(tmp)\r\n cnt+=1\r\nprint(cnt)", "n=input()\r\nc=0\r\nwhile len(n)>1:\r\n x=0\r\n for i in n:\r\n x+=int(i)\r\n n=str(x)\r\n c+=1\r\nprint(c)", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=list(input())\r\ncount=0\r\nif(len(n)==1):\r\n print(0)\r\nelse:\r\n while(len(n)!=1):\r\n sum=0\r\n for i in range(len(n)):\r\n sum+=int(n[i])\r\n count+=1\r\n m=str(sum)\r\n n=list(m)\r\n print(count)", "from calendar import c\r\nfrom cgitb import reset\r\nfrom turtle import st\r\n\r\n\r\nn = input()\r\nif len(n) == 1:\r\n print(0)\r\n exit(0)\r\nresult = 0\r\nfor x in n:\r\n result += int(x)\r\ncount = 1\r\nwhile True:\r\n if result < 10:\r\n break\r\n count += 1\r\n res = str(result)\r\n result = 0\r\n for num in res:\r\n result += int(num)\r\n \r\nprint(count) \r\n", "x = int(input())\r\na =list(map(int,str(x)))\r\ncount = 0\r\nsumation = 0\r\n\r\n\r\nwhile(a):\r\n if len(a)==1:\r\n print(count)\r\n break\r\n else:\r\n for i in range(len(a)):\r\n sumation = sumation +a[i]\r\n count = count+1\r\n a = list(map(int,str(sumation)))\r\n sumation = 0\r\n \r\n \r\n \r\n ", "def f(n):\n return 0 if n < 10 else 1 + f(sum(map(int, str(n))))\n\n\ns = input()\nif len(s) == 1:\n print(0)\nelse:\n n = sum(map(int, s))\n print(f(n) + 1)\n", "\r\ndef solve():\r\n string = input()\r\n if len(string) == 1:\r\n return 0\r\n ans = 0\r\n while True:\r\n ans += 1\r\n sm = 0\r\n for i in string:\r\n sm += int(i)\r\n if len(str(sm)) == 1:\r\n return ans\r\n string = str(sm)\r\n \r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t != 0:\r\n res = solve()\r\n print(res)\r\n t -= 1\r\n", "num=input()\r\ndef sumDigits(x):\r\n if len(x) ==1:\r\n return 0\r\n s=0\r\n for i in x:\r\n s+= int(i)\r\n \r\n return 1+sumDigits(str(s))\r\n \r\nprint(sumDigits(num))", "#T=int(input())\r\ndef solve():\r\n n=int(input())\r\n ans=0\r\n while(1):\r\n z=[char for char in str(n)]\r\n if len(z)==1:\r\n break\r\n z=list(map(int,z))\r\n x=sum(z)\r\n n=x\r\n ans+=1\r\n print(ans) \r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n#for i in range(T):\r\nsolve()\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n =( input())\r\n\r\nsum = 0\r\nif len(n) == 1:\r\n print(0)\r\n \r\nelse:\r\n for i in range(0,len(n)):\r\n sum += int(n[i])\r\n count = 1\r\n\r\n while sum > 9 :\r\n n = str(sum)\r\n sum = 0\r\n for j in range(0,len(n)):\r\n sum += int(n[j])\r\n count += 1\r\n\r\n\r\n print(count)\r\n", "n = str(input())\r\n\r\nif(len(n) == 1):\r\n print(0)\r\nelse:\r\n count = 0\r\n while len(n) > 1 : \r\n sums = 0\r\n for el in n :\r\n sums += int(el)\r\n n = str(sums)\r\n count += 1 \r\n \r\n print(count)", "# Hey, there Stalker!!!\n# This Code was written by:\n# ▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒\n# ▒▒╔╗╔═══╦═══╗▒▒▒╔╗▒▒▒\n# ▒╔╝║║╔═╗║╔═╗╠╗▒▒║║▒▒▒\n# ▒╚╗║║║║║║║║║╠╬══╣║╔╗▒\n# ▒▒║║║║║║║║║║╠╣║═╣╚╝╝▒\n# ▒╔╝╚╣╚═╝║╚═╝║║║═╣╔╗╗▒\n# ▒╚══╩═══╩═══╣╠══╩╝╚╝▒\n# ▒▒▒▒▒▒▒▒▒▒▒╔╝║▒▒▒▒▒▒▒\n# ▒▒▒▒▒▒▒▒▒▒▒╚═╝▒▒▒▒▒▒▒\n# ▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒\n#from functools import reduce\nfrom __future__ import division, print_function\n#mod=int(1e9+7)\n#import resource\n#resource.setrlimit(resource.RLIMIT_STACK, [0x100000000, resource.RLIM_INFINITY])\n#import threading\n#threading.stack_size(2**26)\n\"\"\"fact=[1]\n#for i in range(1,100001):\n# fact.append((fact[-1]*i)%mod)\n#ifact=[0]*100001\n#ifact[100000]=pow(fact[100000],mod-2,mod)\n#for i in range(100000,0,-1):\n# ifact[i-1]=(i*ifact[i])%mod\"\"\"\n#from collections import deque, defaultdict, Counter, OrderedDict\n#from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd\n#from heapq import heappush, heappop, heapify, nlargest, nsmallest\n\n\n# sys.setrecursionlimit(10**6) \nfrom sys import stdin, stdout\nimport bisect #c++ upperbound\nfrom bisect import bisect_left as bl #c++ lowerbound bl(array,element)\nfrom bisect import bisect_right as br #c++ upperbound\nimport itertools\nfrom collections import Counter\nimport collections\nimport math\nimport heapq\nimport re\ndef modinv(n,p):\n return pow(n,p-2,p)\ndef cin():\n return map(int,sin().split())\ndef ain(): #takes array as input\n return list(map(int,sin().split()))\ndef sin():\n return input()\ndef inin():\n return int(input())\n \ndef Divisors(n) : \n l = [] \n for i in range(1, int(math.sqrt(n) + 1)) :\n if (n % i == 0) : \n if (n // i == i) : \n l.append(i) \n else : \n l.append(i)\n l.append(n//i)\n return l\n\ndef most_frequent(list):\n return max(set(list), key = list.count) \ndef GCD(x,y):\n while(y):\n x, y = y, x % y\n return x\n\ndef ncr(n,r,p): #To use this, Uncomment 19-25 \n t=((fact[n])*((ifact[r]*ifact[n-r])%p))%p\n return t\n\ndef Convert(string): \n li = list(string.split(\"\")) \n return li \n\ndef SieveOfEratosthenes(n): \n global prime\n prime = [True for i in range(n+1)] \n p = 2\n while (p * p <= n): \n if (prime[p] == True): \n for i in range(p * p, n+1, p): \n prime[i] = False\n p += 1\n f=[]\n for p in range(2, n): \n if prime[p]: \n f.append(p)\n return f\nprime=[]\nq=[]\ndef dfs(n,d,v,c):\n global q\n v[n]=1\n x=d[n]\n q.append(n)\n j=c\n for i in x:\n if i not in v:\n f=dfs(i,d,v,c+1)\n j=max(j,f)\n # print(f)\n return j\n\n#Implement heapq\n#grades = [110, 25, 38, 49, 20, 95, 33, 87, 80, 90] \n#print(heapq.nlargest(3, grades)) #top 3 largest\n#print(heapq.nsmallest(4, grades))\n#Always make a variable of predefined function for ex- fn=len\n#n,k=map(int,input().split())\n\"\"\"*******************************************************\"\"\"\ndef main():\n n=inin()\n count=0\n while n>9:\n n=sum(map(int,str(n)))\n count+=1\n print(count)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\"\"\"*******************************************************\"\"\"\n######## Python 2 and 3 footer by Pajenegod and c1729\npy2 = round(0.5)\nif py2:\n from future_builtins import ascii, filter, hex, map, oct, zip\n range = xrange\n \nimport os, sys\nfrom io import IOBase, BytesIO\n \nBUFSIZE = 8192\nclass FastIO(BytesIO):\n newlines = 0\n \n def __init__(self, file):\n self._file = file\n self._fd = file.fileno()\n self.writable = \"x\" in file.mode or \"w\" in file.mode\n self.write = super(FastIO, self).write if self.writable else None\n \n def _fill(self):\n s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.seek((self.tell(), self.seek(0,2), super(FastIO, self).write(s))[0])\n return s\n \n def read(self):\n while self._fill(): pass\n return super(FastIO,self).read()\n \n def readline(self):\n while self.newlines == 0:\n s = self._fill(); self.newlines = s.count(b\"\\n\") + (not s)\n self.newlines -= 1\n return super(FastIO, self).readline()\n \n def flush(self):\n if self.writable:\n os.write(self._fd, self.getvalue())\n self.truncate(0), self.seek(0)\n \nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n if py2:\n self.write = self.buffer.write\n self.read = self.buffer.read\n self.readline = self.buffer.readline\n else:\n self.write = lambda s:self.buffer.write(s.encode('ascii'))\n self.read = lambda:self.buffer.read().decode('ascii')\n self.readline = lambda:self.buffer.readline().decode('ascii')\n \n \nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\nif __name__== \"__main__\":\n main()\n#threading.Thread(target=main).start()\n", "x = input()\r\nresult = 0\r\nwhile True:\r\n if x == \"0\" or len(str(x)) == 1:\r\n print(result)\r\n break\r\n x = sum((map(int, x)))\r\n x = str(x)\r\n result +=1\r\n\r\n\r\n", "n = int(input())\r\nc = 0\r\nwhile n >= 10:\r\n n = sum([int(i) for i in str(n)])\r\n c += 1\r\nprint(c)", "n=input()\r\nc=0\r\nwhile(len(n)>1):\r\n sum=0\r\n for i in n:\r\n sum+=int(i)\r\n n=str(sum)\r\n c+=1 \r\nprint(c)\r\n ", "\r\nn=input()\r\nif len(n)==1:print(0);exit()\r\ncn=1\r\nwhile True:\r\n s=0\r\n for i in range(len(n)):\r\n s+=int(n[i])\r\n if s<=9:\r\n print(cn);exit()\r\n cn+=1\r\n n=str(s)", "n = input()\r\ni = 0\r\nwhile len(n) > 1:\r\n l = list(n)\r\n x = sum([int(char) for char in l])\r\n n = str(x)\r\n i += 1\r\n\r\nprint(i)", "def p(a,t):\r\n\tif a<10:\r\n\t\tprint(t)\r\n\t\texit()\r\n\telse:\r\n\t\tk=[int(i) for i in str(a)]\r\n\t\tp(sum(k),t+1)\r\nn=int(input())\r\np(n,0)\r\n", "def digits(s,n):\r\n if int(n)<10:\r\n print(s+0)\r\n else:\r\n result = sum([int(j) for j in str(n)])\r\n s=s+1\r\n digits(s,result)\r\n \r\n \r\nn=int(input())\r\ns=0\r\ndigits(s,n)", "def sum(n):\r\n sum = 0\r\n for i in str(n):\r\n sum += int(i)\r\n return sum\r\n\r\n\r\nn = int(input())\r\nc = 0\r\nwhile len(str(n))>1:\r\n n = sum(n)\r\n c += 1\r\nprint(c)", "n_str = input()\r\n\r\ncnt = 0\r\n\r\nwhile len(n_str) > 1:\r\n new_num = sum([int(char) for char in n_str])\r\n \r\n n_str = str(new_num)\r\n \r\n cnt += 1\r\n \r\n \r\nprint(cnt)", "import sys\r\ninput = lambda:sys.stdin.readline()\r\n\r\nint_arr = lambda: list(map(int,input().split()))\r\nstr_arr = lambda: list(map(str,input().split()))\r\nget_str = lambda: map(str,input().split())\r\nget_int = lambda: map(int,input().split())\r\nget_flo = lambda: map(float,input().split())\r\n\r\nmod = 1000000007\r\n\r\nn = str(input())[:-1]\r\nc = 0\r\nwhile len(n) > 1:\r\n tot = 0\r\n for i in range(len(n)):\r\n tot += int(n[i])\r\n c += 1\r\n n = str(tot)\r\nprint(c)", "n = list(map(int, list(input())))\r\ncount = 0\r\nwhile len(n) > 1:\r\n n = list(map(int, str(sum(n))))\r\n # print(n)\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\nc = 0\r\nwhile n > 9:\r\n n = sum(map(int,list(str(n))))\r\n c += 1\r\n\r\nprint(c)\r\n", "s = input()\r\nans = 0\r\nwhile len(s)>1:\r\n temp = 0\r\n for i in s:\r\n temp += int(i)\r\n s = str(temp)\r\n ans +=1\r\nprint(ans)", "def solve(n):\n ret = 0\n while len(n) > 1:\n sum = 0\n for num in n:\n sum += int(num)\n n = str(sum)\n ret += 1\n return ret\n\nprint (solve(input()))\n\n\n", "num=input()\r\nnumOfTran=0\r\nwhile len(num) > 1 :\r\n sumDig=0\r\n for curr in num :\r\n sumDig+=int(curr)\r\n numOfTran+=1\r\n num=str(sumDig)\r\n \r\nprint(numOfTran)", "from bisect import bisect_right\r\nimport math\r\nfrom queue import PriorityQueue\r\nfrom sys import stdin, stdout\r\nimport collections\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef chk(s):\r\n for i in range(1, len(s)):\r\n if s[i] >= s[i-1]:\r\n return False\r\n return True\r\n\r\n\r\ndef nc2(val):\r\n return val*(val-1)//2\r\n\r\n\r\ndef main():\r\n s = str_input()\r\n ans = 0\r\n while len(s) != 1:\r\n ans += 1\r\n sum = 0\r\n for ch in s:\r\n sum += int(ch)\r\n s = str(sum)\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = str(input())\r\nc = 0\r\n\r\nwhile len(n) > 1:\r\n n = str(sum([int(x) for x in n]))\r\n c += 1\r\n\r\nprint(c)\r\n\r\n", "n=list(map(int,list(input())))\nc=0\nwhile(len(n)>1 ):\n i=sum(n)\n n=list(map(int,list(str(i))))\n c+=1\nprint(c)\n \t \t \t \t\t \t\t \t\t \t\t \t \t \t \t\t", "s = input()\nif len(s) <= 1:\n print(0)\nelse:\n count = 1\n n = 0\n for i in range(len(s)):\n n += int(s[i])\n \n while n > 9:\n totSum = 0\n while n > 0:\n totSum += n % 10\n n = n // 10\n count += 1\n n = totSum\n \n print(count)\n", "n=input()\r\ncnt=0\r\nwhile True:\r\n tt=0\r\n if len(n)==1: break\r\n for i in n:\r\n tt+=int(i)\r\n cnt+=1\r\n n=str(tt)\r\nprint(cnt)", "n=int(input())\r\ni=0\r\nwhile n>9:\r\n n=sum(map(int,str(n)))\r\n i+=1\r\nprint(i)", "#bisect.bisect_left(a, x, lo=0, hi=len(a)) is the analog of std::lower_bound()\r\n#bisect.bisect_right(a, x, lo=0, hi=len(a)) is the analog of std::upper_bound()\r\n#from heapq import heappop,heappush,heapify #heappop(hq), heapify(list)\r\n#from collections import deque as dq #deque e.g. myqueue=dq(list)\r\n#append/appendleft/appendright/pop/popleft\r\n#from bisect import bisect as bis #a=[1,3,4,6,7,8] #bis(a,5)-->3\r\n#import bisect #bisect.bisect_left(a,4)-->2 #bisect.bisect(a,4)-->3\r\n#import statistics as stat # stat.median(a), mode, mean\r\n#from itertools import permutations(p,r)#combinations(p,r)\r\n#combinations(p,r) gives r-length tuples #combinations_with_replacement\r\n#every element can be repeated\r\n \r\nimport sys, threading\r\nimport math\r\nimport time\r\nfrom os import path\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\nfrom functools import cmp_to_key\r\nimport heapq\r\n \r\n \r\n# # # # # # # # # # # # # # # #\r\n# JAI SHREE RAM #\r\n# # # # # # # # # # # # # # # #\r\n \r\n \r\ndef lcm(a, b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\n \r\nsi= lambda:str(input())\r\nii = lambda: int(input())\r\nmii = lambda: map(int, input().split())\r\nlmii = lambda: list(map(int, input().split()))\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\n \r\n \r\ndef solve():\r\n n=si()\r\n cnt=0\r\n while len(n)!=1:\r\n temp = sum([int(i) for i in n])\r\n cnt+=1\r\n n=str(temp)\r\n\r\n\r\n print(cnt)\r\n\r\n \r\n \r\ndef main():\r\n\r\n sys.setrecursionlimit(10**5)\r\n solve()\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n \r\n \r\n\r\n\r\n", "n = input()\nc=0\nwhile(len(n)>1):\n s=0\n c+=1\n for i in n:\n s+=int(i)\n n = str(s)\nprint(c)\n \n", "s = input()\r\ntot = 0\r\nwhile len(s)!=1:\r\n s = str(sum(int(digit) for digit in s))\r\n tot+=1\r\nprint(tot)", "def intToDigits(n):\r\n digitsSum = 0\r\n for i in n:\r\n digitsSum += int(i)\r\n return str(digitsSum)\r\n\r\ndef sol(n):\r\n awnser = 0\r\n while len(n) > 1:\r\n n = intToDigits(n)\r\n awnser += 1\r\n return awnser\r\n\r\nif __name__ == '__main__':\r\n n = input()\r\n \r\n print(sol(n))", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer input\r\n return(int(input()))\r\ndef inlt(): # list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # muliple integer variables input\r\n return(map(int,input().split()))\r\n\r\n\r\nn = input().strip()\r\nstep = 0\r\n\r\ndef sum_digits(a):\r\n sum = 0\r\n for digit in a:\r\n sum += int(digit)\r\n\r\n return str(sum)\r\n \r\nwhile len(n) > 1:\r\n n = sum_digits(n).strip()\r\n step += 1\r\n\r\nprint(step)", "n=int(input())\r\ncounter = 0\r\nwhile n>=10:\r\n\tn = sum([int(x) for x in str(n)])\r\n\t# print(n)\r\n\tcounter+=1\r\nprint(counter)", "num = list(input())\r\nnum2 = []\r\ncount = 0\r\nsum = 0\r\nfor i in num:\r\n num2.append(int(i))\r\nwhile len(num2) != 1: \r\n for i in num2:\r\n sum += i\r\n num2.clear()\r\n num2 = [int(i) for i in str(sum)]\r\n count += 1\r\n sum = 0\r\nprint(count)", "n=str(input())\nc=0\nwhile(len(n)!=1):\n\tres=[int(x) for x in n]\n\tn=str(sum(res))\n\tc+=1\nprint(c)\n\t\n\t \t\t \t \t\t \t\t \t\t\t \t\t\t \t\t", "n = input()\ns=0\nwhile len(n) != 1:\n n = str(sum([int(x) for x in n]))\n s += 1\nprint(s)", "n = int(input())\r\nc = 0\r\ndef f(n):\r\n global c\r\n if len(str(n)) == 1:\r\n return c\r\n else:\r\n c += 1\r\n return f(sum([int(i) for i in str(n)]))\r\nprint(f(n))\r\n", "num = input()\r\nspell = 0\r\n\r\nwhile len(num) > 1:\r\n sm = 0\r\n for i in num:\r\n sm += int(i)\r\n spell += 1\r\n num = str(sm)\r\nprint(spell)", "a=int(input())\r\ncount=0\r\nwhile(a>=10):\r\n s=str(a)\r\n a=0\r\n for i in s:\r\n a=a+int(i)\r\n count=count+1\r\nprint(count) \r\n", "n=int(input())\r\ns=str(n)\r\nc=0\r\nwhile True:\r\n if len(s)==1:\r\n print(c)\r\n break\r\n else:\r\n su=0\r\n for i in range(len(s)):\r\n su+=int(s[i])\r\n s=str(su)\r\n c+=1", "def digit_sum(n):\r\n c = 0\r\n for char in str(n):\r\n c += int(char)\r\n return c\r\n\r\nn = int(input())\r\nc = 0\r\n\r\nwhile len(str(n)) > 1:\r\n c += 1\r\n n = digit_sum(n)\r\nprint(c)\r\n ", "n = input()\r\nsteps = 0\r\nwhile len(n) > 1:\r\n step_sum = 0\r\n for i in n:\r\n step_sum += (ord(i) - ord('0'))\r\n steps += 1\r\n n = str(step_sum)\r\nprint(steps)", "'''\n http://codeforces.com/contest/102/problem/B\n'''\niters = 0\nn = int(input())\n\nwhile (n > 9):\n n = sum(map(int, str(n)))\n iters += 1\nprint(iters)\n", "s=input()\r\ncount=0\r\nwhile len(s)!=1:\r\n s=str(sum(map(int,s)))\r\n count+=1\r\nprint(count)", "\r\nimport sys\r\nimport pprint\r\nimport logging\r\nfrom logging import getLogger\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\nlogging.basicConfig(format=\"%(message)s\", level=logging.WARNING,)\r\nlogger = getLogger(__name__)\r\nlogger.setLevel(logging.INFO)\r\n\r\n\r\ndef debug(msg, *args):\r\n logger.info(f'{msg}={pprint.pformat(args)}')\r\n\r\n# 30 MINUTES ATLEAST !!!!\r\n\r\n###################################################################################################################\r\n\r\n# let's do this by recursion\r\n\r\n\r\ndef printPattern(t, n):\r\n if t == n + 1:\r\n return\r\n\r\n for i in range(n - t):\r\n print(' ', end=' ')\r\n\r\n for i in range(t + 1):\r\n print(i, end=' ')\r\n\r\n for i in range(t - 1, 0, -1):\r\n print(i, end=' ')\r\n\r\n print(0)\r\n\r\n printPattern(t + 1, n)\r\n\r\n if t == n:\r\n return\r\n for i in range(n - t):\r\n print(' ', end=' ')\r\n\r\n for i in range(t + 1):\r\n print(i, end=' ')\r\n\r\n for i in range(t - 1, 0, -1):\r\n print(i, end=' ')\r\n\r\n print(0)\r\n\r\n\r\ndef single():\r\n return map(int, input().split())\r\n\r\n# interior angle of a polygon is defined as angle b/w any two adjacent sides, i.e 180 * (n - 2) // n\r\n# DON'T LOOK AT TEST CASES !!\r\n\r\n\r\ndef t():\r\n s = [int(i) for i in input()]\r\n ans = 0\r\n while len(s) > 1:\r\n summ = sum(s)\r\n s = [int(i) for i in str(summ)]\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nt()\r\n", "s = input().strip()\r\nans = 0\r\nwhile int(s) >= 10:\r\n\tcount = 0\r\n\tfor c in s:\r\n\t\tcount += int(c)\r\n\ts = str(count)\r\n\tans += 1\r\n\r\nprint(ans)", "n = input()\r\nl = len(n)\r\ncount = 0\r\nwhile (l>1):\r\n a =[ int(i) for i in n]\r\n s = sum (a)\r\n n = str(s)\r\n l = len(n)\r\n count +=1\r\nprint(count)\r\n\r\n", "n = input()\r\n\r\nm = str(n)\r\ncount = 0\r\n\r\nwhile len(n) != 1:\r\n count += 1\r\n m = 0\r\n for i in n:\r\n m += int(i)\r\n n = str(m)\r\nprint(count) ", "s = input()\r\n\r\ni = 0\r\nwhile len(s) > 1:\r\n c = 0\r\n for k in s:\r\n c += int(k)\r\n\r\n s = str(c)\r\n i += 1\r\nprint(i)\r\n", "n = input()\r\n\r\ncnt = 0\r\nwhile len(n) != 1:\r\n s = 0\r\n for i in range(len(n)):\r\n s += int(n[i])\r\n n = str(s)\r\n cnt += 1\r\n\r\nprint(cnt)", "n=int(input())\r\ns=str(n)\r\n# print(list(n))\r\nsm=0\r\nl=list(s)\r\nfor i in range(len(l)):\r\n sm=sm+int(l[i])\r\ns=str(sm) \r\ncount=1 \r\n\r\nwhile sm//10!=0:\r\n l=list(s)\r\n sm=0\r\n for i in range(len(l)):\r\n sm=sm+int(l[i])\r\n count=count+1 \r\n s=str(sm) \r\nif n//10==0:\r\n print(0)\r\nelse:\r\n print(count)\r\n", "def sumdigits(n):\r\n s = 0\r\n for ch in n:\r\n s += ord(ch)-ord('0')\r\n return str(s)\r\n\r\n\r\nn = input()\r\nl = len(n)\r\nc = 0\r\nwhile(l>1):\r\n c += 1\r\n n = sumdigits(n)\r\n l = len(n)\r\n\r\nprint(c)", "a=input();c=0\r\nwhile len(a)>1:\r\n a=str(sum(int(a[i]) for i in range(len(a))))\r\n c=c+1\r\nprint(c)\r\n", "def sum_of_digits(n: str):\r\n my_sum = 0\r\n for digit in n:\r\n my_sum += int(digit)\r\n return str(my_sum)\r\n\r\n\r\nnumber = input()\r\ntimes = 0\r\nwhile len(number) > 1:\r\n number = sum_of_digits(number)\r\n times += 1\r\nprint(times)\r\n", "num = (input())\r\ncount = 0\r\nwhile len(str(num))>1:\r\n num = list(num)\r\n num = sum(list(map(int,num)))\r\n num = str(num)\r\n count+=1\r\nprint(count)", "def main():\n n = input().strip()\n count = 0\n\n while len(n) > 1:\n s = sum(int(d) for d in n)\n n = str(s)\n count += 1\n\n print(count)\n\nif __name__ == '__main__':\n main()\n\n \t\t\t\t\t\t\t\t\t \t \t \t \t \t\t\t \t \t\t", "n=int(input())\r\ns=str(n)\r\ndef magic(s):\r\n global c,sum\r\n for i in s:\r\n sum=int(i)+sum\r\n if len(str(sum))!=1:\r\n c += 1\r\n a=str(sum)\r\n sum=0\r\n magic(a)\r\n else:\r\n return 0\r\nif len(s)==1:\r\n print(0)\r\nelse:\r\n c=1\r\n sum=0\r\n magic(s)\r\n print(c)\r\n\r\n", "def summa(n):\n summ = 0\n while n != 0:\n b = n%10\n summ+=b\n n//=10\n return summ\nn = list(map(int,input()))\nif len(n) == 1:\n print(0)\nelse:\n count = 1\n num = int(sum(n))\n while len(str(num)) != 1:\n num = summa(num)\n count+=1\n print(count)\n\n\n", "s=input()\r\nc=0\r\nwhile len(s)!=1:\r\n s=str(sum(int(i) for i in s))\r\n c += 1\r\nprint(c)", "n = input()\r\n\r\ndef convert(n):\r\n n = list(n)\r\n n = [int(d) for d in n]\r\n return str(sum(n))\r\n \r\ncount = 0 \r\nwhile len(n)>1:\r\n n = convert(n)\r\n count += 1\r\nprint(count)", "ans = 0\r\nS = input()\r\nwhile True:\r\n if len(S) == 1:\r\n break\r\n S = map(int,list(S))\r\n N = sum(S)\r\n S = str(N)\r\n ans += 1\r\n\r\n\r\nprint(ans)\r\n", "from sys import *\nfrom math import *\ninput = stdin.readline\n\ns = input().strip()\n\nans = 0\nwhile len(s) > 1:\n temp = 0\n for i in s:\n temp += int(i)\n s = str(temp)\n ans += 1\n\nprint(ans)\n\t \t \t \t\t \t \t \t \t \t\t\t\t\t\t", "inp = input()\nans = 0\nwhile len(inp) > 1 :\n inp = str(sum([int(ch) for ch in inp]))\n ans += 1\nprint(ans)\n\t\t\t \t\t\t\t\t\t\t \t \t \t \t\t\t \t \t\t", "word = input()\r\nteller = 0\r\nwhile len(word) > 1:\r\n teller += 1\r\n s = sum(int(x) for x in word)\r\n word = str(s)\r\nprint(teller)", "n=input()\r\nc=0\r\nwhile(len(n)>1):\r\n sm=0\r\n for i in n:\r\n sm+=int(i)\r\n n=str(sm)\r\n c+=1\r\nprint(c)", "from collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \ndef sum_digits(ss):\n\treturn [int(x) for x in str(sum(ss))]\nans = 0\nss = [int(x) for x in input()]\nwhile len(ss) > 1:\n\tss = sum_digits(ss)\n\tans += 1\nprint(ans)\n\n", "from collections import Counter\r\nnum = input()\r\nif len(num) < 2:\r\n print(0)\r\nelse:\r\n count = Counter(num)\r\n new_num = 0\r\n\r\n for key, val in count.items():\r\n new_num += int(key) * val\r\n\r\n num = new_num\r\n ans = 1\r\n while num > 9:\r\n digit_sum = 0\r\n ans += 1\r\n while num:\r\n digit_sum += num % 10\r\n num //= 10\r\n\r\n num = digit_sum\r\n print(ans)", "def trans(n):\r\n i=0\r\n s=n\r\n n_s = str(n)\r\n while s>9:\r\n #print(n_s,'->',end=' ')\r\n s=sum(map(int,list(n_s)))\r\n n_s=str(s)\r\n i+=1\r\n #print(n_s)\r\n return i\r\n\r\nn = int(input())\r\nprint(trans(n))\r\n", "n = input()\ncount = 0\n\nwhile len(n) > 1:\n\tSum = 0\n\tfor i in range(len(n)):\n\t\tSum += int(n[i])\n\tn = str(Sum)\n\tcount += 1\n\t\nprint(count)\n\n \t \t\t\t\t \t\t\t\t \t \t\t\t\t\t \t \t \t \t\t\t", "def sum_of_digits (n) :\r\n final = 0\r\n for x in n :\r\n final += int(x)\r\n return final\r\n\r\n\r\ndef minimize (n) :\r\n times = 0\r\n while n//10 != 0 : \r\n n = sum_of_digits(str(n))\r\n times += 1\r\n return times\r\n \r\nn = int(input())\r\nprint (minimize(n))\r\n \r\n ", "def digs(n,summ):\r\n for i in range(len(n)):\r\n summ+=int(n[i])\r\n return str(summ)\r\n\r\nn=input()\r\nflag=0\r\nif(len(n)==1):\r\n print(0)\r\n flag=1\r\n\r\ncnt=0\r\nwhile(True):\r\n n=digs(n,0)\r\n if(len(n)==1):\r\n break\r\n else:\r\n cnt+=1\r\nif(flag==0):\r\n print(cnt+1)", "s=input()\r\nc=0\r\nwhile len(s)>1:\r\n num=0\r\n c=c+1\r\n for i in range(len(s)):\r\n num=num+int(s[i])\r\n s=str(num)\r\nprint(c)", "import math\r\nfor _ in range(1) :\r\n s=input()\r\n c=0\r\n sum1=0\r\n while(int(s)>9):\r\n for i in s:\r\n sum1=sum1+int(i)\r\n s=str(sum1)\r\n sum1=0\r\n \r\n c=c+1\r\n print(c) \r\n \r\n \r\n \r\n ", "n = str(input())\r\nres = 0\r\n\r\nwhile len(n) != 1:\r\n transform = 0\r\n for i in range (len(n)):\r\n transform += int(n[i])\r\n n = str(transform)\r\n res += 1\r\n\r\nprint(res)", "n = input()\nSum = 0\ncounter = 0\ni = 0\nwhile len(n) > 1:\n while i < len(n):\n Sum = Sum + int(n[i])\n i += 1\n counter += 1\n i = 0\n n = str(Sum)\n Sum = 0\n\nprint(counter)\n \t \t \t \t\t\t \t \t \t\t \t\t", "def num_spell(n):\n count = 0\n while n >= 10:\n count += 1\n n = sum(int(digit) for digit in str(n))\n return count\n\nn = int(input())\nprint(num_spell(n))\n\n\t\t\t \t \t \t\t\t\t\t\t \t\t \t \t \t", "def cnt(n,dem) :\r\n sum = str(n) \r\n res = 0 \r\n for i in sum:\r\n res = res +int(i)\r\n if res>=10 :\r\n dem+=1\r\n return cnt(res,dem)\r\n return dem\r\nn = int(input())\r\ndem = 1\r\nif n < 10 :\r\n print(0)\r\nelse :\r\n print(cnt(n,dem))", "num = list(map(int,input()))\nc = 0 \nwhile 1 :\n summi = sum(num)\n if len(num) < 2 :\n break\n c +=1\n num = list(map(int,str(summi)))\nprint(c)", "n = int(input())\r\n\r\ns = 0\r\n\r\nwhile n > 9:\r\n n = sum(map(int, str(n)))\r\n s += 1\r\n\r\nprint(s)", "n=input()\nif(len(n)==1):\n print(0)\n exit()\nsum=0\nfor i in n:\n x=int(i)\n sum+=x\nans=1\nwhile(sum>=10):\n sum2=0\n while(sum>0):\n sum2+=(sum%10)\n sum//=10\n ans+=1\n sum=sum2\n\nprint(ans)\n\n\n\t \t\t\t \t \t \t\t\t \t \t \t \t\t\t\t", "\"\"\"\r\nimport sys\r\nsys.stdin = open('input.txt', 'r') \r\n\"\"\"\r\n#sys.stdout = open('output.txt', 'w')\r\ns = input()\r\nans = 0\r\nwhile len(s) > 1:\r\n tmp = 0\r\n for i in s:\r\n tmp += int(i)\r\n s = str(tmp)\r\n ans += 1\r\n\r\nprint(ans)", "\n\ndef main():\n num = input()\n res = 0\n while len(num) > 1:\n num = str(sum([int(num[i]) for i in range(len(num))]))\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n = list(map(int,input()))\nc = 0\nif len(n) == 1:\n print(c)\nelse:\n for i in range (0,len(n)):\n n = sum(n)\n n = [int(x) for x in str(n)]\n c += 1\n if len(n) == 1:\n break\n print(c)\n\n \t\t \t\t\t \t \t\t \t \t \t\t \t \t", "t = input()\nn = len(t)\nj = 0\ns =0\np=1\nwhile(1):\n if len(t) < 2:\n print(j)\n break\n for i in t:\n s+= int(i)\n t =str(s)\n s =0\n j+=1\n\t\t \t\t\t\t \t \t \t \t\t\t \t \t\t \t\t\t\t", "import sys\r\nimport math\r\nfrom typing import Callable\r\n\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n = read().strip()\r\n nums = 0\r\n curr_digit: str = n\r\n while len(curr_digit) > 1:\r\n curr_sum = 0\r\n for c in curr_digit:\r\n curr_sum += int(c)\r\n curr_digit = str(curr_sum)\r\n nums += 1\r\n print(nums)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "x = str(input())\n\ndef transform(num):\n lst = []\n n = str(num)\n for i in n:\n i = int(i)\n lst.append(i)\n\n return sum(lst)\n\nmoves = 0\ns = int(x)\nwhile s > 9:\n s = transform(s)\n moves += 1\n\nprint(moves)\n\n \t \t\t \t \t\t \t \t \t \t\t \t", "n = input()\r\nc=0\r\nif(len(n)==1):\r\n print(0)\r\nelse:\r\n while(len(n)!=1):\r\n s=0\r\n for i in range(len(n)):\r\n s = s + int(n[i])\r\n\r\n n = str(s)\r\n c = c+1\r\n print(c)", "def sod(n):\r\n cnt=0\r\n for i in str(n):\r\n cnt+=int(i)\r\n return cnt\r\nn=int(input())\r\ncnt=0\r\nif n<10:\r\n print(0)\r\nelse:\r\n while n>=10:\r\n n=sod(n)\r\n cnt+=1\r\n print(cnt)", "n=input()\r\n# len=len(n)\r\n# iok=int(list(n))\r\n# print(iok)\r\n# s=list('123')\r\n# print(sum(s))\r\ncount=0\r\nwhile len(n)>1:\r\n n=str(sum(map(int,n)))\r\n count+=1\r\nprint(count)", "n=input()\r\nc=0\r\nwhile len(n)>=2 :\r\n cont = 0\r\n for x in n:\r\n cont += int(x) \r\n c += 1\r\n n= str(cont)\r\nelse :\r\n print(c)", "def func(n):\r\n \r\n if len(n)==1:\r\n return 0\r\n \r\n m = len(n)\r\n \r\n summ=0\r\n for i in n:\r\n summ+=int(i)\r\n \r\n return 1 + func(str(summ))\r\n \r\nn=input()\r\n\r\nprint(func(n))", "m = input()\r\nt = int(m)\r\ncount = 0\r\nsu = sum(list(map(int, m.strip()))) \r\nwhile su>=10:\r\n list_of_number = list(map(int, m.strip())) \r\n su = sum(list_of_number) \r\n if su>=10:\r\n m = str(su)\r\n count = count + 1\r\nif t>=10:\r\n print(count+1)\r\nelse:\r\n print(count)", "n = input()\nif int(n) <= 9:\n print(0)\nelse:\n count = 0\n sums = float('inf')\n\n while sums > 9:\n sums = 0\n n = list(n)\n for i in range(len(n)):\n sums += int(n[i])\n n = str(sums)\n count += 1\n print(count)\n", "n, x = int(input()), 0\r\nwhile n > 9:\r\n n = sum(map(int, str(n)))\r\n x += 1\r\nprint(x)", "'''\r\n shelby70\r\n'''\r\nn= input()\r\ntotal= 0\r\n\r\nwhile len(n)>1:\r\n x= 0\r\n for i in n:\r\n x+= int(i)\r\n n= str(x)\r\n total+= 1\r\nprint(total)", "n = input()\n\nans = 0\nwhile len(n) > 1:\n nn = 0\n for d in n:\n nn += int(d)\n\n ans += 1\n n = str(nn)\n\nprint(ans)", "n = int(input())\ns = 0\nwhile 9 < n:\n n = list(map(int,list(str(n))))\n n = sum(n)\n s += 1\nprint(s)\n", "from sys import stdin,stdout\r\n#input = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n #n = int(input())\r\n #a,b,c = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n n = list(map(int,list(input())))\r\n ans = 0\r\n while len(n) > 1:\r\n n = list(map(int,list(str(sum(n)))))\r\n ans += 1\r\n print(ans)\r\nmain()\r\n", "n=int(input(''))\r\nb=str(n)\r\nc=0\r\nm=0\r\nd=''\r\nif(len(b)>1):\r\n for i in b:\r\n c+=int(i)\r\n d=str(c)\r\n m+=1\r\nwhile(len(d)>1):\r\n c=0\r\n for i in d:\r\n c+=int(i)\r\n d=str(c)\r\n m+=1\r\nprint(m)\r\n\r\n", "\nimport sys \ninput = sys.stdin.readline \n\ndef sol():\n n = input()[:-1]\n\n ans = 0\n while(len(n) != 1):\n ans += 1\n buff = 0\n for i in n:\n buff += int(i)\n n = str(buff)\n\n sys.stdout.write(str(ans) + \"\\n\")\n\nsol()\n", "n = list(map(int, list(input())))\r\nans = 0\r\nwhile len(n) > 1:\r\n n = list(map(int, str(sum(n))))\r\n ans += 1\r\nprint(ans)", "N = input()\ncnt = 0\nwhile int(N) >= 10:\n N = str(sum([int(x) for x in N]))\n cnt += 1\nprint(cnt)\n\t\t \t \t\t\t\t \t\t\t\t \t \t\t\t \t\t\t\t", "\r\nv = int(input());ct = 0\r\nwhile v//10:\r\n st = list(map(int,list(str(v))))\r\n v = sum(st)\r\n ct += 1\r\nprint(ct)\r\n", "n=input()\r\ncount=0\r\nwhile(len(n) != 1): \r\n sum=0\r\n for i in n:\r\n sum+=int(i)\r\n n=str(sum)\r\n count+=1\r\n\r\nprint(count)\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solution(n):\r\n res = 0\r\n while len(n) > 1:\r\n num = 0\r\n for i in n:\r\n num += int(i)\r\n res += 1\r\n n = str(num)\r\n\r\n return res\r\n\r\n\r\nn = input()\r\nprint(solution(n))\r\n", "n = input()\r\nm = 0 \r\nwhile True:\r\n if len(n) == 1:\r\n print(m)\r\n break\r\n else:\r\n n = str(sum(list(map(int,list(n)))))\r\n m+=1\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = list(input().rstrip())\r\nans = 0\r\nwhile len(n) ^ 1:\r\n ans += 1\r\n s = 0\r\n for i in n:\r\n s += int(i)\r\n n = list(str(s))\r\nprint(ans)", "def summ(n):\r\n summ = 0\r\n for i in (n):\r\n summ+=int(i)\r\n return str(summ)\r\nnum = (input())\r\ncount = 0\r\nwhile len((num))>1:\r\n num=summ(num)\r\n count+=1\r\nprint(count)", "def digsum(x):\r\n\treturn sum(map(int,[char for char in x]))\r\n\r\nn=[char for char in input()]\r\ncount=0\r\nwhile(len(n)>1): \r\n\tn=str(digsum(n))\r\n\tcount+=1\r\nprint(count)\r\n", "number = input()\r\nspills = 0\r\nwhile len(number) > 1:\r\n spills += 1\r\n digits_sum = 0\r\n for i in number:\r\n digits_sum += int(i)\r\n\r\n number = str(digits_sum)\r\n\r\nprint(spills)", "s = input()\r\ntimes = 0\r\nwhile len(s)!=1:\r\n summ = 0\r\n for x in s:\r\n summ += int(x)\r\n s = str(summ)\r\n times += 1\r\nprint(times)", "s = input()\r\ncounter = 0\r\nlen_s = len(s)\r\n\r\nwhile len_s > 1:\r\n sum = 0\r\n for i in range(len_s):\r\n sum += int(s[i])\r\n\r\n s = str(sum)\r\n len_s = len(s)\r\n counter += 1\r\n\r\nprint(counter)\r\n", "def sumd(a):\r\n b = 0\r\n while(a > 0):\r\n b += (a % 10)\r\n a = (a // 10)\r\n return b \r\na = str(input())\r\nn = 0\r\nans = 0\r\nif(len(a) > 1):\r\n for i in a:\r\n n += int(i)\r\n ans = 1\r\nelse:\r\n n = int(a) \r\nwhile(n >= 10):\r\n ans += 1\r\n n = sumd(n)\r\nprint(ans) \r\n", "n = input()\r\ntotal = 0\r\nwhile (len(n) != 1):\r\n\tn = str(sum([int(i) for i in n]))\r\n\ttotal+=1\r\nprint(total)\r\n", "n = int(input())\r\nans = 0\r\nwhile n > 9:\r\n\tn = sum(map(int, list(str(n))))\r\n\tans += 1\r\nprint(ans)\r\n", "s=input()\nl=[]\nc=0\nwhile len(l)!=1:\n l=[int(x) for x in s]\n s=str(sum(l))\n c+=1\nprint(c-1) ", "def getSum(n): \r\n \r\n strr = str(n) \r\n list_of_number = list(map(int, strr.strip())) \r\n return sum(list_of_number)\r\n\r\nn=input()\r\nif len(n)==1:print(0);exit()\r\ncount=0\r\n\r\nwhile True:\r\n s=0\r\n s = getSum(n)\r\n count+=1\r\n n=str(s)\r\n if len(n)==1:\r\n print(count)\r\n break", "a=input()\r\nb=0\r\nc=a\r\nn=len(a)\r\nwhile b>=0:\r\n sum=0\r\n j=0\r\n if n>1:\r\n while j<n:\r\n sum=sum+int(c[j])\r\n j=j+1\r\n c=str(sum)\r\n n=len(c)\r\n b=b+1\r\n if n==1:\r\n break\r\nif len(a)==1:\r\n b=b-1\r\nprint(b)\r\n", "a=int(input())\r\nc=0\r\nwhile a>9:\r\n b=str(a)\r\n a=0\r\n for i in range(len(b)):\r\n a=a+int(b[i])\r\n c=c+1\r\nprint(c)\r\n \r\n", "n=input()\r\nct=0\r\nwhile len(n)>1:\r\n n=str(sum(map(int,n)))\r\n ct+=1\r\nprint(ct)", "n=input();c=0\r\nwhile len(n)!=1:\r\n a=list(map(int,list(n)))\r\n n=str(sum(a));c+=1\r\nprint(c)\r\n", "def SumOfDigits(n):\r\n sum=int(0)\r\n for d in n:\r\n sum+=int(d)\r\n return str(sum)\r\nn=input()\r\nans=int(0)\r\nwhile len(n)!=1:\r\n ans+=1\r\n n=SumOfDigits(n)\r\nprint(ans)", "def NumberofTimes(s):\n\n count = 0\n\n while (len(s) > 1):\n\n temporary_sum = 0\n\n for i in range(len(s)):\n temporary_sum += (ord(s[ i ]) -\n ord('0'))\n\n s = str(temporary_sum)\n\n count += 1\n\n return count\n\nif __name__ == \"__main__\":\n\n s = input()\n print(NumberofTimes(s))\n\t\t \t\t \t \t \t\t \t \t\t \t\t \t\t\t \t", "def solve(n):\r\n res=0\r\n while len(n)>1:\r\n n=str(sum(list(map(int,n))))\r\n res+=1\r\n # print(res)\r\n return res\r\n \r\n# n,m,c=map(str,input().split())\r\n# a=list(map(int,input().split()))\r\n# a=[]\r\n\r\nn=input()\r\n# m=int(input())\r\n# s=input()\r\n# s1=input()\r\n# a=[]\r\n# for i in range(int(n)):\r\n# # print(i)\r\n# a.append(input())\r\n\r\nprint(solve(n))", "def num(n):\r\n x = 0\r\n for i in range (len(n)):\r\n x+= ord(n[i])-48\r\n return x\r\n\r\ndef sum(x):\r\n result=0\r\n while x!=0:\r\n result+=x%10\r\n x = x // 10\r\n return result\r\n\r\nn = input()\r\ncount = 0\r\nif len(n)>1:\r\n x = num(n)\r\n count+=1\r\n n = str(x)\r\nwhile len(n)>1:\r\n x = sum(x)\r\n n = str(x)\r\n count+=1\r\nprint(count)", "a = input()\nb = str(a)\ntime = 0\nwhile (len(b) > 1):\n sum = 0\n for i in b:\n sum += int(i)\n b = str(sum)\n time += 1\nprint(time)\n\n \t \t\t\t \t \t\t \t \t\t \t\t \t\t", "n=list(map(int,list(input())))\r\nc=0\r\nwhile len(n)>1:\r\n\tn=sum(n)\r\n\tn=list(map(int,list(str(n))))\r\n\tc+=1\r\nprint(c)\t", "from sys import stdin,stdout\r\ninput = stdin.readline\r\ndef write(n,sep=\"\\n\"):\r\n\tstdout.write(str(n))\r\n\tstdout.write(sep)\r\ndef gil():\r\n\treturn list(map(int, input().split()))\r\n\r\ndef gs(n):\r\n\tc = 0\r\n\tfor i in n:\r\n\t\tc += int(i)\r\n\treturn str(c)\r\n\t\r\nn = input().strip()\r\nx = 0\r\nwhile len(n) != 1:\r\n\tn = gs(n)\r\n\tx += 1\r\nprint(x)\r\n", "from time import sleep\r\nn = input()\r\n\r\nres = 0\r\n\r\nwhile (len(n) > 1):\r\n sum = 0 \r\n # print(n)\r\n res+=1 \r\n \r\n for i in range(len(n)):\r\n sum += ord(n[i]) - ord('0')\r\n # sleep(1)\r\n n = str(sum)\r\n \r\n \r\nprint()\r\nprint(res)", "n=int(input())\r\nc=0\r\nwhile(n//10!=0):\r\n lst = list(map(int, str(n).strip()))\r\n n=sum(lst)\r\n c+=1\r\nprint(c)", "s = input()\n\nres = 0\n\nwhile len(s) > 1:\n summ = 0\n\n for i in s:\n summ+= int(i)\n \n s = str(summ)\n\n res+=1\n\nprint(res)\n", "\r\nn = input()\r\ni = 0; s=0\r\nwhile len(n) != 1:\r\n for j in n:\r\n s += int(j)\r\n n=str(s)\r\n s=0\r\n i+=1\r\nprint(i)", "\ndef solve(k):\n ln = len(k)\n out = 0\n while ln != 1:\n c = 0\n for i in k:\n c += int(i)\n\n k = str(c)\n ln = len(k)\n out += 1\n\n return out\n\n\nn = input()\nprint(solve(n))\n", "n = input()\r\nct = 0\r\nwhile len(n) > 1:\r\n n = str(sum(list(map(int, n))))\r\n ct += 1\r\nprint(ct)\r\n", "s = input()\ncnt = 0\nwhile len(s) > 1:\n cnt+=1\n sum = 0\n for c in s:\n sum += int(c)\n s = str(sum) \nprint(cnt)", "def f(s):\n sum = 0\n for i in range(len(s)):\n sum += int(s[i])\n return str(sum)\n\ndef so():\n s = input()\n c = 0\n while len(s) != 1:\n s = f(s)\n c += 1\n print(c)\n\n# t = int(input())\n# while t > 0:\n# t -= 1\nso()\n\n\t \t\t \t\t \t \t \t \t \t\t \t", "a = list(map(int,input()))\r\ncounter = 0 \r\nwhile len(a)>1:\r\n counter+=1\r\n a = list(map(int,str(sum(a))))\r\nprint(counter)", "n = input()\r\nc = 0\r\nwhile len(n) > 1:\r\n n = str(sum(map(int,n)))\r\n c += 1\r\nprint(c)", "n =input()\nc=0\nwhile(len(n)!=1):\n sum=0\n for i in n: \n sum+=int(i)\n n=str(sum)\n c+=1\nprint(c)\n\t\t \t \t \t\t\t\t \t \t \t \t\t \t \t", "def main():\n number = int(input())\n count = 0\n while len(str(number)) != 1:\n sum = 0\n for num in str(number):\n sum += int(num)\n number = sum\n count += 1\n print(count)\nmain()\n\n#7 problems left\n", "a=input()\r\nb=0\r\nsum=0\r\nwhile(len(a)>1):\r\n sum=0\r\n for i in a:\r\n sum+=int(i)\r\n a=str(sum)\r\n b+=1\r\nprint(b)", "# https://codeforces.com/problemset/problem/102/B\n\ndef handle():\n value = input()\n moves = 0\n\n while len(value) != 1:\n summation = 0\n for char in value:\n summation += int(char)\n value = str(summation)\n moves += 1\n return moves\n\n\nprint(handle())", "n=input()\r\ni=len(n)\r\ns=0\r\nwhile i>1:\r\n lst=[]\r\n for j in n:\r\n lst.append(int(j))\r\n n=str(sum(lst))\r\n s+=1\r\n i=len(n)\r\nprint(s)\r\n", "x=input()\r\nz=0\r\nwhile len(x)>1:\r\n sumo=0\r\n while len(x)!=0:\r\n sumo+=int(x[0:1])\r\n x=x[1:]\r\n \r\n x=str(sumo)\r\n z+=1\r\n\r\nprint(z)\r\n \r\n", "n=input()\nc=0\nwhile len(n)>1:\n\ts=0\n\tfor i in n:\n\t\ts+=int(i)\n\tn=str(s)\n\tc+=1\nprint(c)\n \t \t \t\t \t\t\t\t \t \t\t\t \t\t \t \t", "n=input()\r\np=list(map(int,n))\r\n# print(p)\r\nc=0\r\nwhile(len(p)!=1):\r\n s=sum(list(map(int,p)))\r\n p=list(str(s))\r\n c=c+1\r\nprint(c)\r\n", "\ndef sum_of_digits(num):\n return sum(int(digit) for digit in str(num))\n\ndef count_spells(num):\n count = 0\n while num >= 10:\n num = sum_of_digits(num)\n count += 1\n return count\n\n\nn = int(input())\n\n\nresult = count_spells(n)\nprint(result)\n\n \t\t\t\t \t \t\t \t \t\t \t \t\t\t\t \t", "n = int(input())\r\nidx = 0\r\nwhile n >= 10:\r\n n = sum([int(i) for i in str(n)])\r\n idx += 1\r\nprint(idx)\r\n", "import sys\r\na=list(map(int,str(input())))\r\nif len(a)==1:\r\n print(\"0\")\r\n sys.exit()\r\ny=1\r\nwhile sum(a)>9:\r\n a=list(map(int,str(sum(a))))\r\n y=y+1\r\nprint(y)", "num = [int(i) for i in input()]\r\n# print(num)\r\nres = 0\r\nwhile len(num) > 1:\r\n num = [int(i) for i in str(sum(num))]\r\n # print(num)\r\n res += 1\r\nprint(res)\r\n", "n = input()\n\nc = 0\n\nwhile len(n) > 1:\n\tn = str(sum([int(i) for i in n]))\n\tc += 1\n\nprint(c)\n", "n = int(input())\n\n# 定义计数器变量，表示替换次数\ncount = 0\n\n# 如果n不是个位数，就一直重复替换\nwhile n // 10 != 0:\n # 计算当前数字的各位数字之和\n digit_sum = 0\n for digit in str(n):\n digit_sum += int(digit)\n \n # 更新替换次数\n count += 1\n \n # 将当前数字替换为各位数字之和\n n = digit_sum\n\n# 输出替换次数\nprint(count)\n\t\t \t\t \t\t\t \t\t\t\t \t\t \t\t \t \t", "n = input()\r\nans = 0\r\nwhile len(n) > 1:\r\n n = str(sum([int(c) for c in n]))\r\n ans += 1\r\nprint(ans)", "n = input()\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n sum = 0\r\n for i in n:\r\n sum += int(i)\r\n cnt = 1\r\n while sum > 9:\r\n sum2 = 0\r\n while sum > 0:\r\n r = sum % 10\r\n sum2 += r\r\n sum //= 10\r\n sum = sum2\r\n cnt += 1\r\n print(cnt)", "n = input()\r\ni = 0 \r\n\r\nwhile True:\r\n if len(n) == 1:\r\n print(i)\r\n break\r\n else:\r\n n = str(sum(list(map(int,list(n)))))\r\n i+=1\r\n", "def sum_str(s):\r\n ans = 0\r\n for x in s:\r\n ans += ord(x) - ord('0')\r\n return str(ans)\r\n\r\n\r\ndef main() -> None:\r\n s = input()\r\n ans = 0\r\n while len(s) != 1:\r\n s = sum_str(s)\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a=input()\r\nc=0\r\nwhile len(a) >1:\r\n n=0\r\n for i in a:\r\n n+=int(i)\r\n a=str(n)\r\n c+=1\r\nprint(c)", "def summ(a):\r\n summa = 0\r\n for i in a:\r\n summa += int(i)\r\n return str(summa)\r\na = input()\r\nk = 0\r\nwhile len(a) != 1:\r\n a = summ(a)\r\n k += 1\r\nprint(k)\r\n", "n = input().strip()\ncount = 0\nwhile len(n) > 1:\n s = sum(int(d) for d in n)\n n = str(s)\n count += 1\nprint(count)\n \t\t \t\t\t\t\t\t\t\t\t \t\t\t \t \t\t\t\t \t", "def summer(n):\r\n sum = 0\r\n for i in n :\r\n sum+=int(i)\r\n return sum \r\n\r\nn = input()\r\ncount = 0\r\ntmp = n\r\nwhile len(tmp) > 1:\r\n tmp = str(summer(tmp))\r\n count+=1\r\n \r\nprint(count)", "def solve():\r\n a = input()\r\n ans = 0\r\n while len(a) != 1:\r\n temp = 0\r\n for i in a:\r\n temp += int(i)\r\n a = str(temp)\r\n ans += 1\r\n return ans\r\nprint(solve())", "\r\nif __name__ == \"__main__\":\r\n m = int(input())\r\n\r\n # data = [int(item) for item in input().split()]\r\n\r\n count = 0\r\n while(True):\r\n data = [int(x) for x in str(m)]\r\n # while(m>0):\r\n # data.append(m%10)\r\n # m = int(m/10)\r\n \r\n if(len(data) > 1):\r\n count+=1\r\n m = sum(data)\r\n else:\r\n break\r\n\r\n\r\n \r\n print(count)", "N = int(input())\r\ncount = 0\r\nwhile(len(str(N)) != 1):\r\n temp = 0 \r\n for i in str(N):\r\n temp += int(i)\r\n N = temp\r\n count += 1\r\nprint(count)", "n=input()\r\ns=0\r\nq=0\r\n\r\nwhile len(n)!=1:\r\n for elem in n:\r\n s+=int(elem)\r\n n=str(s)\r\n s=0\r\n q+=1\r\n\r\nprint(q)\r\n", "n = input()\r\ncount = 0\r\nwhile len(n) > 1:\r\n sum= 0\r\n count += 1\r\n for g in range(len(n)):\r\n sum += int(n[g])\r\n #print(sum)\r\n n = str(sum)\r\n\r\nprint(count)\r\n \r\n\r\n\r\n", "n = input()\r\na = 0\r\nwhile len(n)>1:\r\n n = str(sum(map(int, list(n))))\r\n a+=1\r\nprint(a)", "n=input()\r\ncount=0\r\n\r\nwhile(len(n)>1):\r\n sum=0\r\n for i in n:\r\n sum+=int(i)\r\n n=str(sum)\r\n count+=1\r\nprint(count)", "string = input()\r\ncounter = 0\r\n\r\nwhile len(string) > 1 :\r\n sum = 0\r\n for i in range(0 , len(string)):\r\n sum += int(string[i])\r\n counter +=1\r\n string = f'{sum}'\r\nprint(counter)", "n = int(input())\r\ncount = 0\r\nwhile n > 9:\r\n sum = 0\r\n n = str(n)\r\n for i in range(len(n)):\r\n sum += int(n[i])\r\n n = sum\r\n count += 1\r\nprint(count)", "n=input()\r\nsumi=0\r\nif n==\"0\":\r\n print(0)\r\nelif len(n)<2:\r\n print(0)\r\nelse:\r\n count=0\r\n while(len(n)>1):\r\n sumi=int(0)\r\n for i in range(0,len(n)):\r\n sumi+=int(n[i])\r\n sumi=str(sumi)\r\n n=str(sumi)\r\n count+=1\r\n print(count)", "n=int(input(\"\"))\r\nsteps=0\r\nwhile (len(str(n))!=1):\r\n k=str(n)\r\n s=0\r\n for i in range (0,len(k)):\r\n s+=int(k[i])\r\n steps+=1\r\n n=s\r\n \r\nprint(steps)\r\n", "s = input().strip()\r\ncnt = 0\r\nsm = 0\r\n\r\nif s == \"0\":\r\n print(0)\r\nelse:\r\n while len(s) != 1:\r\n sm = sum([int(c) for c in s])\r\n cnt += 1\r\n s = str(sm)\r\n print(cnt)\r\n", "n,x=input(),0;i=int\r\nwhile i(n)>9:n=sum(map(i,str(n)));x+=1\r\nprint(x)", "y = int(input())\r\ndef sum(input):\r\n thing = list(map(int, str(input)))\r\n output = 0\r\n for i in thing:\r\n output = output+i\r\n return output\r\nans = 0\r\nwhile True:\r\n r = sum(y)\r\n if r == y:\r\n break\r\n y = r\r\n ans = ans + 1\r\n\r\nprint(ans)", "s=input()\r\nr=0\r\nwhile len(s)>1:\r\n sum=0\r\n r+=1\r\n for c in s:\r\n sum+=int(c)\r\n s=str(sum)\r\nprint(r)", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\ns = input()\r\nsumDigits = 0\r\ncount = 0\r\nsumDigits = sum(int(i) for i in s)\r\ncount = 1 if len(s) >= 2 else 0\r\nwhile sumDigits >= 10 :\r\n sumDigits = sum(int(i) for i in str(sumDigits))\r\n count += 1\r\nprint(count)\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n=input()\r\nc=0\r\nwhile(len(str(n))>1):\r\n c+=1\r\n s=0\r\n for i in n:\r\n s=s+int(i)\r\n n=str(s)\r\nprint(c)", "f=lambda x:[*map(int,list(x))]\r\nn=f(input());oper=0\r\nwhile len(n)>1:\r\n n=f(str(sum(n)))\r\n oper+=1\r\nprint(oper)", "n=int(input())\nctr=0\nwhile 1:\n\tif n<10:\n\t\tprint(ctr)\n\t\tbreak\n\tctr+=1\n\ts=0\n\tn=str(n)\n\tfor i in n:\n\t\ts+=int(i)\n\tn=s\n \t \t \t \t \t\t \t \t", "s = input()\r\n\r\nif len(s) == 1:\r\n print(0)\r\nelse:\r\n num = 0\r\n ans = 1\r\n for i in s:\r\n num += int(i)-int('0')\r\n\r\n while(int(num/10)): \r\n tmp = 0\r\n while(num):\r\n tmp += num%10\r\n num = int(num/10)\r\n num = tmp\r\n ans+=1\r\n\r\n print(ans)", "n = int(input())\r\nans = 0\r\nwhile n > 9:\r\n n = sum(map(int, str(n)))\r\n ans += 1\r\n\r\nprint(ans)", "n = input()\r\ni = 0\r\nwhile len(str(n))>1:\r\n i+=1\r\n n = str(sum(int(i) for i in n))\r\nprint(i)", "n = int(input())\r\nc = 0\r\nwhile len(str(n)) != 1:\r\n n = sum(list(map(int, str(n))))\r\n c += 1\r\nprint(c)\r\n\r\n\r\n\r\n#1 4\r\n#4\r\n#5 4 3 2\r\n#2 1 3 2\r\n\r\n#3\r\n\r\n ", "s=input()\r\ndef conv(s):\r\n return str(sum([int(x) for x in (s)]))\r\ncnt=0\r\nwhile(len(s)>1):\r\n cnt+=1\r\n s=conv(s)\r\nprint(cnt)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nfor t in range(1):\r\n prev=list(input())\r\n count=0\r\n while len(prev)>1:\r\n ans=0\r\n for i in prev:\r\n ans+=int(i)\r\n ans=str(ans)\r\n prev=[]\r\n for i in ans:\r\n prev.append(i)\r\n count+=1\r\n print(count)", "n=input()\r\nc=0\r\nwhile(len(n)>1):\r\n sum = 0\r\n for digit in n: \r\n sum += int(digit)\r\n n=str(sum) \r\n c+=1\r\nprint(c) ", "n=input()\ncount=0\nwhile(len(n)>1):\n su=sum(list(map(int,list(n))))\n count+=1\n n=str(su)\nprint(count)", "n=input();\r\nnum=0;\r\nt=0\r\nwhile len(n)>1:\r\n for i in n:\r\n num=num+int(i)\r\n n=str(num)\r\n num=0\r\n t=t+1\r\nprint(t)\r\n", "n = input()\r\ntimes = 0\r\nif len(n) == 1:\r\n pass\r\nelse:\r\n while len(n) > 1:\r\n temp = 0\r\n for i in n:\r\n temp += int(i)\r\n n = str(temp)\r\n times += 1\r\nprint(times)", "number = int(input())\r\nstep = 0\r\nwhile number >= 10:\r\n\tstr_number = str(number)\r\n\tnumber = 0\r\n\ti = 0\r\n\twhile i < len(str_number):\r\n\t\tnumber += int(str_number[i])\r\n\t\ti += 1\r\n\tstep += 1\r\nprint(step)", "def reduce(n):\n s=0\n for i in n:\n s+=int(i)\n return str(s)\n \nn=input()\nk=0\nwhile len(n)!=1:\n n=reduce(n)\n k+=1\nprint(k)", "N = input()\r\nList =[]\r\nfor i in N:\r\n List.append(int(i))\r\ncount = 0\r\nwhile(len(List)>1):\r\n X = sum(List)\r\n List = []\r\n for i in str(X):\r\n List.append(int(i))\r\n count+=1\r\nprint(count)", "from sys import stdin, stdout # only need for big input\n\ndef read_int_from_line():\n return list(map(int, input().split()))\n\ndef to_sum_digit(n):\n ans = 0\n while( n ):\n ans += n % 10\n n = n // 10\n return ans\n\ndef solve():\n s = input()\n if len(s) < 2:\n print(0)\n return\n\n n = 0\n for d in s:\n n += int(d)\n \n count = 1\n while n >= 10 :\n count += 1\n n = to_sum_digit(n)\n print(count)\n\ndef main():\n solve()\n\n\nif __name__ == \"__main__\":\n main()", "s=input()\r\ncount=0\r\nl=len(s)\r\nwhile l>1:\r\n sum=0\r\n for i in s:\r\n sum+=int(i)\r\n s=str(sum)\r\n l=len(s)\r\n count+=1\r\n \r\nprint(count)", "def yzd_solution(n):\r\n counter = 0\r\n\r\n while len(str(n)) != 1:\r\n n = int(sum([int(digit) for digit in str(n)]))\r\n counter += 1\r\n\r\n return (counter)\r\n\r\nn = int(input())\r\nprint(yzd_solution(n))", "n = input().strip()\r\nres = 0\r\nwhile len(n) > 1:\r\n n = str(sum(map(int, n)))\r\n res += 1\r\nprint(res)\r\n", "num = int(input())\r\ni = 0\r\nwhile len(str(num)) != 1:\r\n koko = [int(i) for i in str(num)]\r\n num = sum(koko)\r\n i += 1\r\nprint(i)", "def magic(s):\r\n res = 0\r\n for x in s:\r\n res += int(x)\r\n return str(res)\r\n\r\ns = input()\r\nans = 0\r\nwhile len(s) > 1:\r\n s = magic(s)\r\n ans += 1\r\n\r\nprint(ans)", "num = input()\r\ncounter = 0\r\nwhile len(num) > 1:\r\n num = str(sum(map(int, num)))\r\n counter += 1\r\nprint(counter)", "\r\nn = int(input())\r\n\r\ndigits = []\r\n\r\ncount = 0\r\nwhile True:\r\n for d in str(n):\r\n digits.append(int(d))\r\n\r\n if len(digits) == 1:\r\n break\r\n\r\n count += 1\r\n n = sum(digits)\r\n\r\n digits = []\r\n\r\nprint(count)\r\n", "number = list(input().strip())\r\ncast_spell = 0\r\nlength = len(number)\r\n\r\nwhile length > 1:\r\n summation = 0\r\n for digit in number:\r\n summation += int(digit)\r\n number = list(str(summation))\r\n length = len(number)\r\n cast_spell += 1\r\n\r\nprint(cast_spell)\r\n\r\n", "import sys\r\n# sys.stdin=open('input.txt','r')\r\n# sys.stdout=open('output.txt','w')\r\n\r\nn=input()\r\n\r\nans=0\r\nwhile len(n)!=1:\r\n temp=0\r\n for i in n:\r\n temp+=int(i)\r\n n=str(temp)\r\n ans+=1\r\n\r\nprint(ans)", "n = input()\r\nsum = 0\r\ncount = 0\r\nwhile len(n) != 1:\r\n for i in n:\r\n sum += int(i)\r\n n = str(sum)\r\n sum = 0\r\n count += 1\r\nprint(count)", "def solve(num):\r\n def count(num, times=0):\r\n if num < 10:\r\n return times\r\n\r\n num1 = 0\r\n str1 = str(num)\r\n \r\n for char in str1:\r\n num1 += int(char)\r\n\r\n times += 1\r\n if num1 > 9: \r\n return count(num1, times)\r\n else:\r\n return times\r\n\r\n\r\n times = count(num)\r\n return times\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n num = int(input())\r\n ans = solve(num)\r\n print(ans)\r\n", "n=input()\r\nsumm=0;\r\ncnt=0;\r\nl=len(n);\r\nif(l==1):\r\n print(0)\r\nelse:\r\n m=10\r\n while(l!=1 and m):\r\n summ=0;\r\n for i in n:\r\n summ+=(ord(i)-ord('0'))\r\n n=\"\"\r\n while(summ):\r\n n+=str(summ%10)\r\n summ=summ//10\r\n cnt+=1\r\n l=len(n)\r\n # n=n[:-1]\r\n m-=1\r\n # print(n)\r\n print(cnt)", "\r\ns = str(input())\r\n\r\n\r\ncount = int(0)\r\n\r\nwhile len(s) != 1:\r\n sum = int(0)\r\n for i in range(0, len(s)):\r\n x = int(s[i])\r\n sum = sum + x\r\n\r\n count = count + 1\r\n s = str(sum)\r\n\r\n\r\nprint(count)\r\n", "import sys\n\ndef main(n):\n if n <= 9:\n return 0\n\n # Need at least one.\n d_sum = sum(int(d) for d in str(n))\n count = 1\n while d_sum > 9:\n d_sum = sum(int(d) for d in str(d_sum))\n count += 1\n return count\n\nif __name__ == \"__main__\":\n for e, line in enumerate(sys.stdin.readlines()):\n n = int(line.strip())\n print(main(n))\n", "n = input()\r\nc = 0\r\nwhile len(n) != 1:\r\n n = str(sum(int(i) for i in n))\r\n c += 1\r\nprint(c)", "import math\r\ndef s(a):\r\n ans=0\r\n for e in a:\r\n ans+=int(e)\r\n return str(ans)\r\ndef main(a):\r\n if int(a)<=9:\r\n return 0\r\n return 1+main(s(a))\r\n \r\n \r\na=input()\r\nprint(main(a))", "num = input()\r\nans = 0\r\ntemp = 0\r\nwhile len(num) > 1:\r\n for x in num:\r\n ans += int(x)\r\n num = str(ans)\r\n ans = 0\r\n temp += 1\r\nprint(temp)", "def sum_of_digits(number):\r\n number_str = str(number)\r\n\r\n digit_sum = 0\r\n\r\n for char in number_str:\r\n digit_sum += int(char)\r\n\r\n return digit_sum\r\n\r\n\r\ncount = 0\r\nnum = int(input())\r\nresult = num\r\nwhile(result>9):\r\n result = sum_of_digits(result)\r\n count +=1\r\nprint(count)\r\n#print(f\"The sum of the digits of {num} is {result}\")\r\n", "# LUOGU_RID: 100284783\nt = input().strip()\r\n\r\ndef f(x):\r\n if len(x) > 1: \r\n s = 0\r\n for i in x: s += int(i)\r\n return f(str(s)) + 1\r\n return 0\r\n\r\nprint(f(t)) ", "def add(k):\r\n sum = 0\r\n for i in k:\r\n sum += int(i)\r\n return sum\r\nn = input()\r\nspell = 0\r\nif int(n) > 9:\r\n while add(n) > 9:\r\n sum_of_digits = add(n)\r\n n = str(sum_of_digits)\r\n spell += 1\r\n print(spell+1)\r\nelse: print(0)", "s=input()\nc=0\nwhile len(s)>1:\n\ts=str(sum(map(int,s)))\n\tc+=1\nprint(c)\n \t \t \t \t\t \t \t \t \t\t\t\t \t \t\t", "\n\ndef solution1(n: int):\n\tcount = 0\n\n\tif n < 10:\n\t\treturn 0\n\n\twhile True:\n\t\t_s = sum(map(int, str(n)))\n\n\t\tcount += 1\n\t\tif _s <= 9:\n\t\t\treturn count\n\n\t\tn = _s\n\t\n\nif __name__ == \"__main__\":\n\tn = int(input())\n\tprint(solution1(n))\n", "if __name__ == '__main__':\r\n number = input()\r\n spell_num = 0\r\n while len(number) >= 2:\r\n n = 0 \r\n for i in number:\r\n n += int(i)\r\n number = str(n)\r\n spell_num += 1\r\n print(spell_num)", "n_str = input()\r\n\r\nr = 0\r\nwhile len(n_str) > 1:\r\n n = 0\r\n for i in n_str:\r\n n += int(i)\r\n\r\n n_str = str(n)\r\n r += 1\r\n\r\nprint(r)\r\n", "import sys\nimport math\ninput = sys.stdin.readline\n\ndef solve():\n def magic(n):\n return sum([int(ch) for ch in str(n)])\n\n n = int(input().strip())\n ans = 0\n while n >= 10:\n ans += 1\n n = magic(n)\n print(ans)\n\n\nif __name__ == '__main__':\n solve()\n", "s=input()\r\ndef summer(s):\r\n mst=list(s)\r\n sm=0\r\n for i in range(len(mst)):\r\n sm=sm+int(mst[i])\r\n return str(sm)\r\ncn=0\r\nwhile(int(s)>9):\r\n s=summer(s)\r\n cn=cn+1\r\nprint(cn)", "'''CodeForces: Sum of Digits'''\r\n\r\nif __name__ == '__main__':\r\n n = input()\r\n count = 0\r\n while len(n) > 1:\r\n s = 0\r\n count += 1\r\n for i in n:\r\n s += int(i)\r\n n = str(s)\r\n\r\n print(count)\r\n", "def fun(s) :\r\n if len(s)==1 :\r\n return 0\r\n sum=0\r\n for me in s :\r\n sum+=int(me)\r\n return 1+fun(str(sum))\r\n \r\ns=input()\r\nprint(fun(s))", "num = input()\ncount = 0\nl = len(num)\nwhile(l>1):\n s = 0\n for i in range(l):\n s+=int(num[i])\n num = str(s) \n l = len(num) \n count+=1\nprint(count) \n \n \t\t \t \t\t \t \t \t\t \t \t \t \t\t", "n = input()\r\nc = 0\r\nwhile len(n)>1:\r\n num = 0\r\n for i in n:\r\n num+=int(i)\r\n n = str(num)\r\n c+=1\r\nprint(c)", "nos = input()\r\npo = 0 \r\nwhile True:\r\n if len(nos) == 1:\r\n print(po)\r\n break\r\n else:\r\n nos = str(sum(list(map(int,list(nos)))))\r\n po+=1", "n = input()\r\nc = 0\r\nwhile len(str(n))>1:\r\n n = sum(map(int,str(n)))\r\n c+=1\r\nprint(c)", "s = input()\r\n\r\nans = 0\r\nwhile len(s) > 1:\r\n ds = 0\r\n for x in s:\r\n ds += int(x)\r\n s = str(ds)\r\n ans += 1\r\n\r\nprint(ans)\r\n", "x=int(input())\r\n\r\nans=0\r\n\r\nwhile len(str(x))>1:\r\n curSum=0\r\n for a in str(x):\r\n curSum+=int(a)\r\n x=curSum\r\n ans+=1\r\nprint(ans)", "num = input()\r\ncount = 0\r\n\r\nwhile len(num) > 1:\r\n result = 0\r\n for i in num:\r\n result += int(i)\r\n count += 1\r\n num = str(result)\r\n\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef inp():\r\n return int(input())\r\ndef minp():\r\n return map(int,input().split())\r\ndef inpsl():\r\n return list(input().split())\r\ndef write(s):\r\n sys.stdout.write(s+\" \")\r\n\r\ndef main():\r\n n = inp()\r\n cnt = 0\r\n while(n>9):\r\n n = sum([int(i) for i in str(n)])\r\n cnt += 1\r\n print(cnt)\r\n\r\nmain()", "import math\r\n\r\ndef sum_digit(n):\r\n sum = 0\r\n for i in n:\r\n sum += int(i)\r\n return str(sum)\r\n\r\nn = input()\r\nresult = 0\r\nwhile (len(n) > 1):\r\n n = sum_digit(n)\r\n # print(n)\r\n result += 1\r\nprint(result)\r\n\r\n\r\n", "x = input()\r\nanswer = 0\r\ncount = 0\r\nwhile int(x) > 9:\r\n for i in str(x):\r\n answer += int(i)\r\n count+=1\r\n x = (answer)\r\n answer = 0\r\nprint(count)", "num = input()\r\nans = 0\r\nwhile len(str(num)) > 1:\r\n count = 0\r\n for i in num:\r\n count += int(i)\r\n num = str(count)\r\n ans += 1\r\nprint(ans)", "def func(numberParam,itrParam=0):\r\n numberStr = str(numberParam)\r\n sumOfDigits = 0\r\n for i in numberStr:\r\n sumOfDigits += int(i)\r\n if (numberParam >= 10):\r\n return func(sumOfDigits,itrParam+1)\r\n else:\r\n return itrParam\r\n\r\ninputNumber = int(input())\r\nprint(func(inputNumber))", "import sys\r\nimport math\r\nimport random\r\nimport collections \r\nfrom collections import OrderedDict, defaultdict, deque\r\n\r\n# define input function\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\ndef helper(n, currency):\r\n pass\r\n\r\ndef uscln(a, b):\r\n if (b == 0):\r\n return a;\r\n return uscln(b, a % b)\r\n\r\ndef brute_force(n, s):\r\n return\r\n\r\ndef random_compare():\r\n for n in range(1, 1000000001):\r\n ans = brute_force(n)\r\n # Code here\r\n l = 1\r\n r = n\r\n def check(mid):\r\n if (mid * (mid + 1)) // 2 <= n:\r\n return True\r\n return False\r\n \r\n while r - l > 1:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n l = mid\r\n else:\r\n r = mid\r\n res = l\r\n #----------\r\n if ans != res:\r\n print(n)\r\n break\r\n else:\r\n print(\"OK\")\r\n \r\n# main function\r\ndef main():\r\n n = input()\r\n ans = 0\r\n while len(n) != 1:\r\n n = str(sum(map(int, list(n))))\r\n ans += 1\r\n print(ans) \r\n \r\n# run main function\r\nif __name__ == '__main__':\r\n # t = int(input())\r\n t = 1\r\n while t:\r\n main()\r\n t -= 1", "num = int(input())\r\ncount = 0\r\ns = lambda x : sum(list(map(int,str(x)))) \r\nwhile num // 10 :\r\n num = s(num)\r\n count += 1\r\nprint(count)", "number = input()\nres = 0\nwhile len(number)!=1:\n total = 0\n for num in number:\n total += int(num)\n number = str(total)\n res+=1\nprint(res)\n ", "num = input()\nans = 0\n\n\ndef getSum(n):\n\n sum = 0\n for digit in str(n):\n sum += int(digit)\n return sum\n\n\ndef c(n):\n global ans\n if len(str(n)) == 1:\n return\n ans += 1\n c(getSum(n))\n\n\nc(num)\nprint(ans)\n\n\t \t\t\t \t \t \t \t \t\t\t \t \t\t", "\r\nx=(map(int,list(input())))\r\nx=list(x)\r\n\r\na=sum(x)\r\nr=(len(x))\r\nif r==1:\r\n print(0)\r\n exit()\r\nfor i in range(10):\r\n\r\n if a==x:\r\n print(i)\r\n break\r\n else:\r\n x=a\r\n a=str(a)\r\n a=list(map(int,a))\r\n a=sum(a)", "n = input()\nsum = 0\nresult = 0 \nwhile(len(n) != 1):\n for digit in n:\n sum += int(digit)\n n = str(sum)\n sum = 0\n result += 1\nprint(result)", "a = input()\r\nb = [int(x) for x in a]\r\ntimes = 0;\r\nwhile len(b) > 1:\r\n sumTemp = 0\r\n for i in b:\r\n sumTemp += i\r\n times += 1\r\n b = [int(y) for y in str(sumTemp)]\r\n\r\n\r\nprint(times)", "n = input()\r\nc = 0\r\nwhile (len(n) > 1):\r\n c+=1\r\n s = sum(map(int,list(n)))\r\n n = str(s)\r\nprint(c)", "# B. Sum of Digits\r\n\r\nn = int(input())\r\nans = 0\r\nwhile n >= 10:\r\n n = sum(map(int, str(n)))\r\n ans += 1\r\n\r\nprint(ans)\r\n", "v = input()\r\ns = 0\r\nwhile len(v) >= 2:\r\n s += 1\r\n sumv = 0\r\n for i in v:\r\n sumv += int(i)\r\n v = str(sumv)\r\n\r\nprint(s)\r\n", "x = input()\r\n\r\nnum = 0\r\nsum = 0\r\n \r\nwhile(len(x)!=1):\r\n for i in x :\r\n sum = sum + int(i)\r\n \r\n x=str(sum) \r\n sum = 0 \r\n num =num+1\r\n \r\n \r\nprint(num)\r\n\r\n\r\n\r\n\r\n\r\n", "def G (n):\r\n\tcont = 0\r\n\twhile(len(n) > 1):\r\n\t\tn = str(sum([int(x) for x in n if int(x)]))\r\n\t\tcont += 1 \r\n\treturn cont\t\t\r\n\r\nprint( G(input())) ", "word = list(map(int,input()))\n\ncounter = 0\nwhile len(word) > 1:\n total = sum(word)\n word = list(str(total))\n word = list(map(int,word))\n counter +=1\nprint(counter)\n\t \t \t\t\t \t \t\t\t \t \t\t\t\t \t\t \t", "import sys \r\n\r\nn = input()\r\n\r\ndef sum(s):\r\n total = 0 \r\n for num in s:\r\n total += int(num) \r\n return total \r\nif len(n) < 2: \r\n print(0)\r\n sys.exit() \r\ns = sum(n) \r\nsteps = 1\r\nwhile s >= 10:\r\n steps += 1 \r\n s = sum(str(s)) \r\nprint(steps) \r\n", "n=str(input())\r\nc=0\r\nwhile len(n)>1:\r\n c+=1\r\n n=str(sum(list(map(int,n))))\r\nprint(c)", "num = input()\r\nround = 0\r\n\r\nif len(num) < 2:\r\n print(round)\r\nelse:\r\n n = int(num)\r\n while len(num) > 1:\r\n tmp = 0\r\n for i in range(len(num)):\r\n tmp += ord(num[i]) - ord('0')\r\n num = str(tmp)\r\n round += 1\r\n print(round)", "n=input()\ncnt=0\nwhile len(n)>1:\n\ts=0\n\tfor i in n:\n\t\ts+=int(i)\n\tn=str(s)\n\tcnt+=1\nprint(cnt)\n\t \t\t\t\t \t \t\t\t \t\t\t\t\t \t\t\t", "s = lambda x : sum([int(i) for i in str(x)])\r\nn = int(input())\r\ncnt = 0\r\nwhile len(str(n)) != 1:\r\n n = s(n)\r\n cnt += 1\r\nprint(cnt)\r\n\r\n", "n = input()\r\nans = 0\r\n\r\nwhile len(n) > 1:\r\n new = 0\r\n ans += 1\r\n for i in n:\r\n new += int(i) \r\n n = str(new)\r\n\r\nprint(ans)", "def sum(n):\r\n ans = 0\r\n for i in n:\r\n ans += int(i)\r\n return ans\r\nn =input()\r\nans = 0\r\nwhile len(str(n))>1:\r\n n = str(sum(n))\r\n ans += 1\r\nprint(ans)", "n = input()\nans = 0\nwhile len(n)!=1:\n temp = 0\n for i in n:\n temp+=ord(i)-48\n n = str(temp)\n ans+=1\nprint(ans)", "number = input()\r\ncounter = 0\r\nwhile len(number) != 1:\r\n total = 0\r\n for num in number:\r\n total += int(num)\r\n number = str(total)\r\n counter += 1\r\nprint(counter)", "#n,x = map(int,input().split())\r\n\r\ndef dig(n):\r\n\tk = 0\r\n\twhile n>0:\r\n\t\tn = int(n/10)\r\n\t\tk+=1\r\n\treturn k\r\ndef su(n):\r\n\ts = 0\r\n\tfor i in range(len(n)):\r\n\t\ts+=n[i]\r\n\tb = []\r\n\ti = 0\r\n\twhile s>0:\r\n\t\tb.append(s%10)\r\n\t\ts=s//10\r\n\t\ti+=1\r\n\ti = len(b)-1\r\n\tj = 0\r\n\tc = []\r\n\twhile i>=0:\r\n\t\tc.append(b[i])\r\n\t\ti-=1\r\n\treturn c\r\n\t\r\nn = list(input())\r\n\r\nfor i in range(len(n)):\r\n\tn[i]=int(n[i])\r\n\r\ncount = 0\r\n\r\n\r\nwhile len(n)>1:\r\n\tn = su(n)\r\n\tcount+=1\r\n\r\nprint(count)", "def main():\r\n\t\r\n\tn = input()\r\n\r\n\tt = 0\r\n\twhile len(n) != 1:\r\n\t\ts = 0\r\n\t\tfor i in range(len(n)):\r\n\t\t\ts += int(n[i])\r\n\t\tn = str(s)\r\n\t\tt += 1\r\n\tprint(t)\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n\r\n", "n=input()\r\ncount=0\r\nwhile(len(n)>1):\r\n n=str(sum(map(int,n)))\r\n count+=1\r\nprint(count)", "number = input()\r\ndef fun(li,c):\r\n counter = 0\r\n for i in li:\r\n counter += int(i)\r\n counter = str(counter)\r\n if len(counter) > 1:\r\n c+=1\r\n return fun(counter,c)\r\n return c\r\nif len(number) >1:\r\n print(fun(number,1))\r\nelse:\r\n print(0)", "n = input()\r\ndef digit_sum(n):\r\n s = 0\r\n for c in n:\r\n s = s + (ord(c) - ord('0'))\r\n return str(s)\r\ncount = 0\r\nwhile len(n) > 1:\r\n count += 1\r\n n = digit_sum(n)\r\nprint(count)", "n = int(input())\r\n\r\ndef s(numb):\r\n numb = list(str(numb))\r\n tot = 0\r\n for el in numb:\r\n tot += int(el)\r\n return tot\r\n\r\nif n < 10:\r\n print(0)\r\nelse:\r\n ans = 0\r\n while n >= 10:\r\n n = s(n)\r\n ans += 1\r\n print(ans)", "import sys\r\nnum = int(sys.stdin.readline())\r\ni = 0\r\nwhile num > 9:\r\n i = i + 1\r\n x = [int(a) for a in str(num)]\r\n num = sum(x)\r\nprint(i)", "n = input()\r\n\r\ntotal = 0\r\nsumm = 0\r\n\r\nif int(n) < 10:\r\n print(total)\r\n exit()\r\n\r\nelse:\r\n while(int(n)//10 >= 1):\r\n for i in range(len(n)):\r\n summ += int(n[i])\r\n total += 1\r\n\r\n n = str(summ)\r\n summ = 0\r\n\r\n print(total)\r\n\r\n\r\n", "n = input()\r\n# arr = list(map(int, input().split()))\r\n\r\nres = 0\r\nwhile True:\r\n if len(n) == 1:\r\n print(res)\r\n break\r\n\r\n s = sum(list(map(int, n[0:])))\r\n n = str(s)\r\n res += 1\r\n\r\n\r\n\r\n", "s=input()\nc=0\nwhile len(s)>1:\n s=str(sum(map(int,s)))\n c=c+1\nprint(c)\n", "n = int(input())\r\np = 0\r\nwhile n > 9:\r\n a = str(n)\r\n n = 0\r\n for i in a:\r\n n += int(i)\r\n p+=1\r\nprint(p)", "def sumOfDigit(s):\r\n res=0\r\n n=len(s)\r\n for i in range(n):\r\n res+=int(s[i])\r\n return res\r\ns=input()\r\nres=0\r\nwhile len(s)>=2:\r\n s=str(sumOfDigit(s))\r\n res+=1\r\nprint(res)", "num = int(input())\r\ncounter = 0\r\nnum2 = 0\r\n\r\nwhile True:\r\n num2 = 0\r\n if num < 10:\r\n break\r\n counter += 1\r\n num = str(num)\r\n for i in range(len(num)):\r\n num2 += int(num[i])\r\n num = num2\r\n\r\nprint(counter)\r\n", "# author: violist\n# created: 09.07.2021 19:15:21\n\nimport sys\ninput = sys.stdin.readline\n\nn = input()[:-1]\nsucet = 0\nans = 0\nwhile (len(n) != 1):\n for i in range(len(n)):\n sucet += int(n[i])\n n = str(sucet)\n sucet = 0\n ans += 1\nprint(ans)\n", "from sys import *\r\ninput = lambda:stdin.readline()\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nn = str(input())[:-1]\r\nct = 0\r\nwhile len(n) > 1:\r\n tot = 0\r\n for i in n:\r\n tot += int(i)\r\n n = str(tot)\r\n ct += 1\r\nprint(ct)", "n = input()\r\ncount = 0\r\nwhile(len(n)>1):\r\n Sum = 0\r\n for x in n:\r\n Sum += int(x)\r\n n = str(Sum)\r\n count += 1\r\nprint(count)\r\n \r\n", "num = str(input())\nc = 0\n\nwhile len(num)>=2 :\n\n carry = 0\n for x in num :\n carry += int(x)\n\n c += 1\n num = str(carry)\n\nelse :\n print(c)\n\n\t \t\t\t \t\t \t \t\t\t\t\t\t\t \t\t \t\t", "n = input()\r\nif len(n) == 1:\r\n print(0)\r\nelse:\r\n cnt = 0\r\n while len(n) > 1:\r\n cnt += 1\r\n n = str(sum(int(digit) for digit in n))\r\n print(cnt)\r\n", "s = input()\r\nn = int(s)\r\n\r\ncnt = 0\r\nwhile n >= 10:\r\n\r\n n = sum([int(x) for x in str(n)])\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n = input() \r\ncount = 0 \r\nwhile(len(n)!=1): \r\n n = str(sum(int(i) for i in n)) \r\n count+=1 \r\nprint(count) \r\n\r\n ", "\"\"\"\r\nHaving watched the last Harry Potter film, little Gerald also decided to practice magic. He found in his father's magical book a spell that turns any number in the sum of its digits. At the moment Gerald learned that, he came across a number n. How many times can Gerald put a spell on it until the number becomes one-digit?\r\n\r\nInput\r\nThe first line contains the only integer n (0 ≤ n ≤ 10100000). It is guaranteed that n doesn't contain any leading zeroes.\r\n\r\nOutput\r\nPrint the number of times a number can be replaced by the sum of its digits until it only contains one digit.\r\n\"\"\"\r\n\r\nn = int(input())\r\ntimes = 0\r\n\r\nwhile n > 9:\r\n n = sum(map(int, str(n)))\r\n times += 1\r\n\r\nprint(times)\r\n", "s = input()\r\ncnt = 0\r\nwhile len(s) != 1:\r\n ans = 0\r\n for i in s:\r\n ans += int(i)\r\n cnt += 1\r\n s = str(ans)\r\nprint(cnt)", "a=int(input())\n\ndef sumofstring(string):\n s=0\n for char in string:\n s+=int(char)\n return s\n\n\nn=0\nwhile a>9:\n a=sumofstring(str(a))\n n+=1\nprint(n)", "n=int(input())\r\nc=0\r\nwhile(len(str(n))!=1):\r\n c=c+1\r\n s=0\r\n for i in str(n):\r\n s=s+int(i)\r\n n=s\r\n\r\nprint(c)", "n = input()\r\ncount = 0\r\nwhile len(n) != 1:\r\n \r\n lst = list(map(int,n.strip()))\r\n n = str(sum(lst))\r\n count+=1\r\nprint(count)", "n = input()\r\n\r\ncount = 0\r\n\r\nwhile (len(n) > 1):\r\n n = str(n.count(\"1\") * 1 + n.count(\"2\") * 2 + n.count(\"3\") * 3\r\n + n.count(\"4\") * 4 + n.count(\"5\") * 5 + n.count(\"6\") * 6\r\n + n.count(\"7\") * 7 + n.count(\"8\") * 8 + n.count(\"9\") * 9)\r\n \r\n count += 1\r\n \r\nprint(count)", "txt=input()\r\nvalue=0;\r\nCounter=0\r\nwhile len(txt)>1:\r\n value=0 \r\n for i in range(len(txt)):\r\n value=value+int(txt[i])\r\n Counter=Counter+1 \r\n txt=str(value) \r\n \r\nprint(Counter) ", "def re(n):\r\n t=0\r\n s=str(n)\r\n for i in range(len(s)):\r\n t+=int(s[i])\r\n return t\r\nn=int(input())\r\nt=0\r\nwhile len(str(n))>1:\r\n t+=1\r\n n=re(n)\r\nprint(t)", "x = input()\r\ncpt = 0\r\nwhile len(x) > 1:\r\n y = 0\r\n for e in x:\r\n y += int(e)\r\n x = str(y)\r\n cpt+=1\r\nprint(cpt)\r\n", "def sum_digits(n):\r\n sum = 0\r\n for i in range(len(n)):\r\n sum += int(n[i])\r\n return str(sum)\r\n\r\nnumber = input()\r\nif 0 <= int(number) <= pow(10,100000):\r\n counter = 0\r\n while int(number) > 9 and int(number) != 0:\r\n number = sum_digits(number)\r\n counter += 1\r\n print(counter)", "num=input()\r\ntransform=0\r\nwhile len(num)!=1:\r\n num = [int(i) for i in num]\r\n num=str(sum(num))\r\n transform+=1\r\nprint(transform)", "# LUOGU_RID: 109528474\ndef sum_d(num):\r\n s=0\r\n for i in str(num):\r\n s+=int(i)\r\n return s\r\n\r\nall_num = int(input())\r\nk=0\r\nwhile all_num>=10:\r\n all_num=sum_d(all_num)\r\n k=k+1\r\nprint(k)", "string_number = input()\r\nnumber = int(string_number)\r\ncycles = 0\r\ntotal = 0\r\n\r\nwhile number > 9:\r\n for i in range(len(string_number)):\r\n total = total + int(string_number[i])\r\n number = total\r\n string_number = str(number)\r\n i = 0\r\n total = 0\r\n cycles = cycles + 1\r\n\r\nprint(cycles)\r\n", "n = int(input())\r\ncounter = 0\r\n\r\nwhile n > 9:\r\n s = list(map(int, list(str(n))))\r\n n = sum(s)\r\n counter += 1\r\n\r\nprint(counter)\r\n", "x = list(input())\r\nans = 0\r\nwhile len(x) != 1:\r\n ans += 1\r\n temp = 0\r\n for i in x:\r\n temp += int(i)\r\n x = list(str(temp))\r\nprint(ans)\r\n\r\n", "s=input()\nlength=len(s)\nnum=0\nwhile(length>1):\n sum=0\n for i in range(length):\n sum+=int(s[i])\n num+=1\n s=str(sum)\n length=len(s)\nprint(num)\n\t \t \t \t\t\t\t \t\t\t\t \t\t \t\t\t \t", "n = input()\r\ncurrentSum = 0\r\ncount = 0\r\nwhile(len(n) != 1):\r\n for num in n:\r\n currentSum += int(num)\r\n n = str(currentSum)\r\n currentSum = 0\r\n count += 1\r\n\r\nprint(count)\r\n", "# input Operation\r\nnumber = input()\r\n\r\n# Output Operation\r\ncounter = 0\r\nnew_number = 0\r\nif len(number) == 1:\r\n print(0)\r\nelse:\r\n\r\n while(len(number)) > 1:\r\n for i in list(number):\r\n new_number += int(i)\r\n counter += 1\r\n number = str(new_number)\r\n new_number = 0\r\n\r\n print(counter)\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn=input()\r\nc=0\r\nwhile len(n)>1:\r\n\tn=str(sum(map(int,n)))\r\n\tc+=1\r\nprint(c)\r\n ", "n = input()\r\nans = 0\r\nwhile len(n) > 1:\r\n l = list(map(int,n))\r\n n = sum(l)\r\n n = str(n)\r\n ans+=1\r\nprint(ans)\r\n" ]

[ "string = input().split(' ')\r\n\r\nn = int(string[0])\r\nd = int(string[1])\r\n\r\nheights = input().split(' ')\r\n\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if abs(int(heights[i])-int(heights[j])) <= d:\r\n total += 1\r\n\r\nprint(total)", "n, d =map( int ,input().split())\r\nl=[int(i) for i in input().split(\" \")]\r\nx=0\r\nfor i in range(len(l)):\r\n for j in range(len(l)):\r\n if i!=j and abs(l[i]-l[j]) <= d:\r\n x+=1\r\nprint(x)", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if(abs(l[j]-l[i])<=d):\r\n c+=1\r\nprint(2*c)", "j=lambda:map(int,input().split())\r\nn,d=j();a=[*j()]\r\nprint(sum(abs(x-y)<=d for x in a for y in a)-n)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 30 19:32:51 2021\r\n\r\n@author: nehas\r\n\"\"\"\r\nfrom itertools import combinations\r\nn,d=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nl1=list(combinations(l,2))\r\ncount=0\r\nfor comb in l1:\r\n if(abs(comb[1]-comb[0])<=d):\r\n count+=1\r\nprint(count*2)\r\n", "import math\n#Take two integers n and d\narr2=[]\narr1=[]\nx=str(input(\"\"))\narr2=x.split()\nfor z in range(0,2):\n z1=arr2[z]\n arr1.append(int(z1))\n#Take n spaace seperated integers-heights\narr3=[]\narr4=[]\nx=str(input(\"\"))\narr3=x.split()\ncount=0\nfor z in range(0,arr1[0]):\n z1=arr3[z]\n arr4.append(int(z1))\nfor i in range(0,arr1[0]-1):\n for j in range(i+1,arr1[0]):\n if(abs(arr4[i]-arr4[j])<=arr1[1]):\n count+=1\nprint(2*count)\n\n\n \t \t\t \t \t \t\t\t \t \t\t\t\t\t \t \t\t", "n, d = map(int, input().split())\ndata = list(map(int, input().split()))\ncount = 0\n\ni = 0\nj = 0\n\nwhile i < len(data):\n j = i + 1\n while j < len(data):\n if abs(data[i] - data[j]) <= d:\n count += 1\n j += 1\n i += 1\n\nprint(count * 2)\n", "\r\ndatos = input().split()\r\nn, d = int(datos[0]), int(datos[1])\r\n\r\nestaturas = []\r\nlista = input().split()\r\nfor elemento in lista:\r\n estaturas.append(int(elemento))\r\n\r\ncontador = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if abs(estaturas[i] - estaturas[j]) <= d:\r\n contador = contador+1\r\nprint(contador)", "n, d = map(int, input().split())\r\n \r\ncount = 0\r\n \r\narr = [int(i) for i in input().split()]\r\n \r\nfor i in range(len(arr)):\r\n for j in range(i+1, len(arr)):\r\n if abs(arr[i] - arr[j]) <= d:\r\n count+=1\r\n \r\nprint(count * 2)", "n, d = list(map(int, input().split()))\r\nsoldier = list(map(int, input().split()))\r\n\r\nsoldier.sort()\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if soldier[j] > soldier[i] + d:\r\n break\r\n else:\r\n total += 2\r\nprint(total)", "n, d = list(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\n\r\na.sort()\r\n\r\ndiff = 0\r\ncounter = 0\r\nfor i in range(len(a)-1):\r\n for j in range(i+1, len(a)):\r\n diff = a[j] - a[i]\r\n if diff <= d:\r\n counter += 1\r\nprint(counter*2)\r\n", "n,d = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n else:\r\n if abs(lst[i] - lst[j]) <= d:\r\n count += 1 \r\nprint(count)", "[n, d] = map(int, input().split())\nheights = list(map(int, input().split()))\nans = 0\nfor i in range(len(heights)):\n for c in range(len(heights)):\n differenceh = abs(heights[i] - heights[c])\n if differenceh <= d:\n ans += 1\n \nprint(ans - n)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tif abs(l[i]-l[j])<=k:\r\n\t\t\tcount+=2\r\nprint(count)\t\t\t", "n,d = map(int,input().split())\r\narr = [int(x) for x in input().split()]\r\ncnt = 0\r\nfor i in range(len(arr)):\r\n for j in range(len(arr)):\r\n if(i != j and abs(arr[i] - arr[j]) <= d):\r\n cnt += 1\r\nprint(cnt)", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nct = 0\r\nfor i in arr:\r\n for j in arr:\r\n if abs(i - j) <= d:\r\n ct += 1\r\n\r\nprint(ct - n)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "num1,num2 = input().split( )\r\nlist = list(map(int,input().split( )))\r\nnum1 = int(num1)\r\nnum2 = int(num2)\r\nflag = 0\r\nfor i in range(num1):\r\n for j in list[i+1:]:\r\n if abs(j-list[i]) <= num2:\r\n flag = flag+2\r\nprint(flag)\r\n\r\n", "n,d = map(int, input().split())\r\nhights = list(map(int, input().split()))\r\nhights.sort(reverse=True)\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if (hights[i] - hights[j]) <= d:\r\n ans += 2\r\n else:\r\n pass\r\nprint(ans)", "n, d = map(int, input().split())\r\nt = 0\r\ns = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if abs(s[i] - s[j]) <= d and i != j:\r\n t += 1\r\n\r\nprint(t)", "n, d = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nc.sort()\r\ni, j, s = 0, 0, 0\r\nwhile j < n:\r\n if c[j] - c[i] > d:\r\n i += 1\r\n s += j - i\r\n else: j += 1\r\nk = j - i\r\nprint(2 * s + k * (k - 1))", "IL = lambda: list(map(int, input().split()))\r\n\r\nn, p = IL()\r\nH = IL()\r\nprint(sum(1 for ia, a in enumerate(H) for ib, b in enumerate(H) if ia != ib and abs(a-b) <= p))", "n, d = map(int, input().split())\na = list(map(int, input().split()))\nc = 0\nnum_ways = 0\na.sort()\nfor i in range(n):\n j = i + 1\n while j < n and a[j] - a[i] <= d:\n j += 1\n num_ways += j - i - 1\nprint(num_ways * 2)\n# while n != 0:\n# n -= 1\n", "def main():\r\n n, d = map(int, input().split())\r\n s = list(map(int, input().split()))\r\n if n == 1:\r\n print(0)\r\n else:\r\n cnt = 0\r\n for i in range(0, n-1):\r\n for j in range(i+1, n):\r\n if abs(s[i] - s[j]) <= d:\r\n cnt += 2\r\n print(cnt)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n , d = input().split()\r\nn, d = int(n), int(d)\r\n\r\nlist = [int(x) for x in input().split()]\r\n\r\ncount = 0\r\nfor i in range(len(list)):\r\n for j in range(len(list)):\r\n if i == j:\r\n continue\r\n if abs(list[i] - list[j]) <= d and abs(list[i] - list[j]) >= 0:\r\n count += 1\r\n\r\nprint(count)", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if abs(a[i]-a[j]) <= d:\r\n ans+=2\r\nprint(ans)", "import math\r\n\r\nn, d = input().split()\r\nN = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(int(n)):\r\n for j in range(int(n)):\r\n if (j != i and math.fabs(N[j] - N[i]) <= int(d)):\r\n count += 1\r\nprint(count)\r\n", "n,d=map(int,input().split())\nmin_list=[]\nl=[int(x) for x in input().split()]\nfor i in range(len(l)):\n for j in range(len(l)):\n if abs(l[i]-l[j])<=d and i!=j:\n min_list.append(l[i])\n min_list.append(l[j])\nprint(len(min_list)//2)\n", "#34A\r\nn,d=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:pass\r\n else:\r\n z=abs(l[i]-l[j])\r\n if z<=d:c+=1\r\nprint(c)\r\n", "n,d=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\ns=0\r\n\r\n\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if abs(a[j]-a[i])<=d:\r\n s+=2\r\n\r\nprint(s)\r\n", "import sys, itertools\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, d = map(int, input().split())\r\nprint(len(list(filter(lambda x: abs(x[0]-x[1]) <= d, itertools.combinations([int(x) for x in input().split()], 2))))*2)", "t=input().split()\r\nn=int(t[0])\r\nd=int(t[1])\r\nlist=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if list[i]>=list[j]:\r\n if list[i]-list[j]<=d:\r\n count+=1\r\n elif list[j]>=list[i]:\r\n if list[j]-list[i]<=d:\r\n count+=1\r\nprint(count-n)\r\n", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\ndef ans(n,d,lst):\r\n\tct = 0\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif i != j:\r\n\t\t\t\tif abs(lst[i] - lst[j]) <= d:\r\n\t\t\t\t\tct += 1\r\n\tprint(ct)\r\n\r\n\r\n#for _ in range(int(input())):\r\nn,d = get_int()\r\nlst = int_arr()\r\nans(n,d,lst)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-05 22:41:04\nLastEditTime: 2021-11-05 22:45:34\nDescription: Reconnaissance\nFilePath: CF32A.py\n'''\n\n\ndef func():\n n, d = map(int, input().strip().split())\n high = list(sorted(map(int, input().strip().split())))\n count = 0\n for i in range(0, n - 1):\n for j in range(i + 1, n):\n if high[j] - high[i] <= d:\n count += 1\n else:\n break\n print(2 * count)\n\n\nif __name__ == '__main__':\n func()\n", "i=lambda:map(int,input().split())\r\nn,d=i();a=[*i()]\r\nprint(sum(abs(x-y)<=d for x in a for y in a)-n)\r\n", "[n , d] = map(int, input().split())\nnums = list(map(int, input().split()))\nx = 0\nfor i in range(n):\n for j in range(n):\n if i != j and abs(nums[i]-nums[j]) <= d:\n x+=1\nprint(x)\n", "ii=lambda :int(input())\r\nmi=lambda:[int(i) for i in input().split()]\r\na,b=mi()\r\nc= sorted(mi(),reverse=True)\r\ns=0\r\nfor i in range(a-1):\r\n\tj=i+1\r\n\twhile j<a and c[i]-c[j]<=b:\r\n\t\ts+=1\r\n\t\tj+=1\r\nprint(s*2)", "n,d=(map(int, input().split()))\n\nx = list(map(int, input().split()))\n\ncontador=0\nfor i in range(n):\n for j in range(i+1,n):\n diferenca=x[i]-x[j]\n if abs(diferenca) <= d:\n contador+=1\n\nprint(2*contador)\n\t\t\t \t\t\t \t\t \t \t \t \t\t", "n,d = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\ncnt=0\r\ni=0\r\nj=1\r\nlst.sort()\r\n\r\nwhile j<n:\r\n if lst[j]-lst[i]<=d:\r\n cnt+= (j-i)\r\n j+=1\r\n else:\r\n i+=1\r\n \r\nprint(cnt*2)", "from cmath import *\r\nfrom decimal import *\r\n \r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\n \r\ndef solves():\r\n n,m=_input()\r\n a= sorted(_list())\r\n ans=0\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n if (a[j]-a[i]>m):\r\n break\r\n else:\r\n ans+=2\r\n print(ans)\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()", "n,d = map(int,input().split())\r\ns = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tif abs(s[i]-s[j]) <= d:\r\n\t\t\tc+=1\r\n\r\nprint(2*c)", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\nl = []\r\nfor i in a:\r\n for j in a:\r\n if abs(i-j)<=d:\r\n l.append((i,j))\r\n#print(l)\r\nprint(len(l)-n)\r\n", "from itertools import combinations\r\n\r\nno_of_soldiers, max_difference = map(int, input().split())\r\nheights_list = list(map(int, input().split()))\r\ncount = 0\r\n\r\n# Generate all the combinations of 2 soldiers from the `heights_list`, store them to list `combinations`\r\ncombinations = combinations(heights_list, 2)\r\n# Check each combination\r\nfor pair in combinations:\r\n if abs(pair[0] - pair[1]) <= max_difference:\r\n count += 1\r\n\r\nprint(count * 2)\r\n", "n,d=map(int,input().split())\r\nA=list(map(int,input().split()))\r\n\r\nANS=0\r\nfor i in range(n):\r\n a=A[i]\r\n for j in range(n):\r\n if i==j:\r\n continue\r\n if abs(A[j]-a)<=d:\r\n ANS+=1\r\n\r\nprint(ANS)\r\n", "n,d = map(int,input().split())\nlist1 = list(map(int,input().split()))\nk = 0\nfor i in range(n-1):\n for j in range(i+1,n):\n if abs(list1[i]-list1[j])<=d:\n k += 1\nprint(k*2)\n\t \t \t\t \t\t \t\t \t \t \t \t\t\t\t \t", "n, d = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\nans = 0\nfor i in range(n):\n for j in range(n):\n if abs(a[i] - a[j]) <= d and i != j:\n ans += 1\nprint(ans)\n", "a,b=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nw=0\r\nif len(l)==1:\r\n print(0)\r\n exit()\r\nfor i in range(len(l)):\r\n for j in range(i+1,len(l)):\r\n if abs(l[i]-l[j])<=b:\r\n w+=1\r\nprint(w*2)", "a,b = map(int,input().split())\r\n\r\nnums = list(map(int,input().split()))\r\n\r\ncount = 0\r\nfor i in range(len(nums)):\r\n\r\n if i+1>=len(nums):\r\n break\r\n for j in range(i+1,len(nums)):\r\n if nums[i] > nums[j]:\r\n if nums[i] - nums[j] <= b:\r\n count+=1\r\n else:\r\n if nums[j] - nums[i] <=b:\r\n count+=1\r\nprint(count*2)", "n, d = map(int, input().split())\r\n\r\nheight_input = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if abs(height_input[i] - height_input[j]) <= d:\r\n count += 2\r\n\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = sum(1 for i in range(n) for j in range(n) if i != j and abs(a[i] - a[j]) <= d)\r\nprint(ans)", "n, d = map(int, input().split())\nx = list(map(int, input().split()))\ncnt = 0\nfor i in range(len(x)):\n for j in range(len(x)):\n if abs(x[i] - x[j]) <= d and i != j:\n cnt += 1\nprint(cnt)\n", "\r\nn , d = map(int , input().split())\r\nA= list(map(int , input().split()))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j and abs(A[i] - A[j]) <= d:\r\n ans +=1\r\n\r\nprint(ans)\r\n", "n, d = map(int,input().split())\nal = list(map(int,input().split()))\ncounter = 0\nfor i in range(n):\n for j in range(n):\n if abs(al[i]-al[j]) <= d and j != i:\n counter += 1\nprint(counter)\n ", "n,d = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n cur = lst[i]\r\n arr = lst[:i]+lst[i+1:]\r\n for j in arr:\r\n if abs(cur-j)<=d:\r\n count+=1\r\nprint(count)\r\n", "#n, k = map(int, input().split(\" \"))\r\n#L = [int(x) for x in input().split()]\r\n\r\nn, d = map(int, input().split(\" \"))\r\nL = [int(x) for x in input().split()]\r\nL.sort()\r\nans = 0\r\nfor i in range(n) :\r\n for j in range(i + 1, n) :\r\n if (L[j] - L[i] <= d) : ans += 2\r\n\r\nprint(ans)", "import sys\r\n\r\nl=sys.stdin.readline().split()\r\n\r\nn = int(l[0])\r\nd = int(l[1])\r\ncount = 0\r\nsoldiers =list( map(int, sys.stdin.readline().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i != j) and (abs(soldiers[i]-soldiers[j])<=d):\r\n count +=1\r\n\r\nprint(count)", "n, d = list(map(int, input().split(' ')))\r\nsol = list(map(int, input().split(' ')))\r\nanswer = 0\r\n\r\nsol.sort()\r\n\r\nfor i in range(len(sol) - 1):\r\n for j in range(i + 1, len(sol)):\r\n if sol[j] - sol[i] <= d:\r\n answer += 2\r\nprint(answer)\r\n", "I=lambda:list(map(int,input().split()))\r\nR=range\r\nn,d=I()\r\na=I()\r\nprint(sum([(i!=j)*(abs(a[i]-a[j])<=d)for i in R(n)for j in R(n)]))", "n, d = list(map(int,input().strip().split(' ')))\r\narr = list(map(int,input().strip().split(' ')))\r\nc = 0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if abs(arr[i] - arr[j]) <= d:\r\n c += 1\r\nprint(2 * c)", "n, d=[int(i) for i in input().split()]\r\na=[int(i)for i in input().split()]\r\ncount=0\r\nif (n>=1 and n<=1000) and (d>=1 and (d<=10**9)):\r\n for i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n if abs(a[j]-a[i])<=d:\r\n count+=1\r\nprint(count*2)", "#!/bin/python3\r\nnd = list(map(int, input().split()))\r\nn = list(map(int, input().split()))\r\nways = 0\r\nn.sort()\r\nfor lol in range(nd[0]):\r\n for lol2 in range(lol+1,nd[0]):\r\n if n[lol] == n[lol2] or n[lol2]-n[lol] <= nd[1]:\r\n ways += 1\r\nprint(ways*2)", "s=input().split(\" \")\r\nn=int(s[0])\r\nd=int(s[1])\r\nl=input().split(\" \")\r\nl=[int(x) for x in l]\r\nx=0\r\nfor i in range(len(l)):\r\n for j in range(i+1,len(l)):\r\n if abs(l[j]-l[i])<=d:\r\n x+=1\r\nprint(x*2)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))[:n]\r\nl1=[]\r\nfor i in range(len(l)):\r\n for j in range(i+1,len(l)):\r\n p=abs(l[i]-l[j])\r\n if p<=k:\r\n l1.append(p)\r\nprint(len(l1)*2)\r\n ", "[n, d] = map(int, input().split())\r\nheights = list(map(int, input().strip().split()))[:n]\r\n\r\ncount = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if abs(heights[j] - heights[i]) <= d:\r\n count += 1\r\n \r\nprint(count * 2)", "n,d = map(int,input().split())\r\ns = map(int,input().split())\r\ns = list(s)\r\ns.sort()\r\nres = 0\r\nfor i in range(len(s)-1):\r\n q = s[i] + d\r\n c = 0\r\n \r\n for j in range(i+1,len(s)):\r\n if s[j] <= q:\r\n c = c + 1\r\n else:\r\n break\r\n \r\n res = res + c\r\n \r\nprint(2 * res)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[5]:\n\n\nfrom itertools import combinations\nx=list(map(int,input().split()))\ny=list(map(int,input().split()))\nc=list(combinations(y,2))\ni=0\nfor j in c:\n s=abs(j[1]-j[0])\n if s<=x[1]:\n i+=2\nprint(i) \n\n\n# In[ ]:\n\n\n\n\n", "n,m = map(int,input().split())\r\nli = list(map(int,input().split()))\r\nans = 0\r\nli.sort()\r\nfor i in range(0,n):\r\n for j in range(i+1,n):\r\n if abs(li[i] - li[j]) <= m:\r\n ans+=2\r\n else:\r\n break\r\nprint(ans)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nk=int(0)\r\nfor x in c:\r\n m=x+b\r\n n=x-b\r\n for x in c:\r\n if x<=m and x>=n:\r\n k=k+1\r\nprint(k-a)", "n, d = map(int, input().split())\r\nheights = [int(x) for x in input().split()]\r\ncounts = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n \r\n if i == j :\r\n continue\r\n if abs(heights[i]-heights[j])<=d:\r\n counts += 1\r\nprint(counts)\r\n", "def solve(n, d, h):\n s = 0\n for i, a in enumerate(h):\n for j, b in enumerate(h):\n if i != j and abs(a - b) <= d:\n s += 1\n return s\n\n\ndef main():\n n, d = list(map(int, input().split()))\n h = list(map(int, input().split()))\n print(solve(n, d, h))\n\n\nmain()\n", "n, d = map(int, input().split())\na = [int(i) for i in input().split()]\n\nk = 0\nfor i in range(n):\n\tfor j in range(n):\n\t\tif abs(a[i]-a[j]) <= d and i != j:\n\t\t\tk += 1\nprint(k)", "n , d = [int(c) for c in input().split()]\r\narr = [int(c) for c in input().split()]\r\nres = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j and abs(arr[i] - arr[j])<=d:\r\n res += 1\r\nprint(res)\r\n", "n,d=map(int,input().split())\na=list(map(int,input().split()))\ncnt=0\ni=0\nfor i in range(n):\n for j in range(i+1,n):\n if i!=j and abs(a[i]-a[j])<=d:\n cnt=cnt+2\nprint(cnt)\n \t\t \t \t \t \t \t \t\t \t", "str1 = str(input())\r\n\r\nn = int(str1.split(' ')[0])\r\nd = int(str1.split(' ')[1])\r\n\r\nstr2 = str(input())\r\n\r\nlis = [int(i) for i in str2.split(' ')]\r\nlis.sort()\r\n\r\npair = 0\r\nleft = 0\r\nright = 1\r\n\r\nwhile right < n:\r\n if lis[right] - lis[left] <= d:\r\n pair += 2 * (right - left)\r\n else:\r\n while lis[right] - lis[left] > d and right != left:\r\n left += 1\r\n pair += 2 * (right - left)\r\n right += 1\r\n\r\nprint(pair)", "def array(arr, struc):\r\n return (list(map(struc, arr.split())))\r\n\r\n\r\nn = input().split()\r\nd = int(n[1])\r\nn = int(n[0])\r\narr = array(input(), int)\r\nfinal = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if abs(arr[i] - arr[j]) <= d:\r\n final += 2\r\n\r\nprint(final)\r\n", "n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i != j):\r\n if(abs(l[i] - l[j]) <= d):\r\n ans += 1\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nnums=input().split()\r\nnum=[]\r\nfor i in nums:\r\n num.append(int(i))\r\n\r\ndef fun(m):\r\n c=0\r\n if len(num)==n and n!=1:\r\n for i in range(len(num)-1):\r\n y=i+1\r\n while y<=(len(num)-1):\r\n if abs(num[i]-num[y])<=m:\r\n c=c+1\r\n y=y+1\r\n return (c*2) \r\n if len(num)==n and n==1:\r\n return 'NO'\r\n return 'NO'\r\nprint(fun(m))\r\n", "[n, d] = map(int, input().split())\r\nx = [int(i) for i in input().split()]\r\ncn = 0\r\narmy = 0\r\n#n = amount of soldiers, d = allowed hight difference\r\n#x = hights of the soilders\r\nfor i in range(len(x)):\r\n cn = x[i]\r\n for i in range(len(x)):\r\n if cn < x[i]:\r\n if cn+d >= x[i]:\r\n army = army + 1\r\n elif cn > x[i]:\r\n if cn-d <= x[i]:\r\n army = army+1\r\n elif cn == x[i]:\r\n army = army + 1\r\n else: \r\n continue\r\n army = army-1\r\nprint(army)", "n,m=map(int,input().split())\r\nans=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if abs(l[i]-l[j])<=m:\r\n ans+=2\r\n #print()\r\nprint(ans)", "\"\"\"\ninstagram : essipoortahmasb2018\ntelegram channel : essi_python\n\"\"\"\nc = 0\nn , d = map(int,input().split())\nList = [*map(int,input().split())]\nfor i in range(n-1):\n for j in range(i+1,n):\n if abs(List[i]-List[j])<=d:\n c+=2\nprint(c)\n\n\n \n", "n, d = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\nc = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if abs(l[i]-l[j]) <= d:\r\n c += 1\r\nprint(c*2)\r\n", "def solve():\r\n size, d = map(int, input().split())\r\n numbers = sorted(map(int, input().split()))\r\n total = 0\r\n \r\n for i in range(size):\r\n for j in range(i + 1, size):\r\n if numbers[j] - numbers[i] > d:\r\n break\r\n else:\r\n total += 2\r\n \r\n print(total)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n, m = map(int, input().split())\nl = list(map(int, input().split()))\nl.sort()\ncount = 0\nsum = 0\nfor i in range(n):\n for j in range(i+1,n):\n x=l[j] - l[i]\n if 0<=x<= m:\n count += 1\nsum = count * 2\nprint(sum)\n\n \t\t\t \t \t \t\t \t \t \t \t \t\t\t", "a,b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nd = 0\r\nfor i in range(a):\r\n for z in range(a):\r\n if z != i:\r\n if abs(s[i]-s[z]) <= b:\r\n d += 1\r\nprint(d)", "n, d = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nai.sort()\r\nans = 0\r\nfor i in range(n):\r\n num = 0\r\n for j in range(i+1,n):\r\n if ai[j] - ai[i] > d:\r\n break\r\n num += 2\r\n ans += num\r\nprint(ans)\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nk = 0\r\nar = input().split()\r\nfor i in range(n):\r\n ar[i] = int(ar[i])\r\nfor i in range(n):\r\n for j in range(n):\r\n if(abs(ar[i] - ar[j]) <= m and i != j):\r\n k += 1\r\nprint(k)", "#32A (36No. Problem A)\r\n\r\nn,d = map(int,input().split())\r\nheight = list(map(int,input().split()))\r\nheight.sort()\r\nflag = 0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if (abs(height[i]-height[j]) <= d):\r\n flag+=1\r\nprint(flag * 2) \r\n", "n,d= map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nls1 = []\r\nls = []\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if abs(a[i] - a[j]) <= d:\r\n count += 2\r\nprint(count)\r\n", "numbers = list(map(int,input().split(\" \")))\nsoldados = list(map(int,input().split(\" \")))\n\nquantidade = 0\n\nsoldados.sort()\nfor x in range(numbers[0]-1):\n i=1\n while soldados[x]<soldados[x+i]+numbers[1]:\n if abs(soldados[x] - soldados[x+i]) <= int(numbers[1]):\n quantidade+=1\n if i+x <numbers[0]-1:\n i+=1\n else:\n break\nprint(quantidade*2)\n\n# 1512825064436\n", "n, d = map(int, input().split())\r\n\r\na_n = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if abs(a_n[i]-a_n[j]) <= d:\r\n ans += 2\r\n\r\nprint(ans)", "n,d=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nc=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if abs(l[i]-l[j])<=d:\r\n c+=1\r\nprint(2*c) ", "n,d=map(int,input().split())\r\n \r\nl=list(map(int,input().split()))\r\n \r\n \r\n \r\nprint(sum(2 for i in range(n) for j in range(i+1,n) if abs(l[j]-l[i])<=d ))", "# https://codeforces.com/problemset/problem/32/A\r\n\r\nn, d = map(int, input().split())\r\n\r\nsoldiers = tuple(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j and abs(soldiers[i] - soldiers[j]) <= d:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n, d = map(int, input().split())\nA = list(map(int, input().split()))\n\nif n == 1:\n print(0)\n exit()\n\nans = 0\nfor i in range(n-1):\n for j in range(i+1, n):\n if abs(A[i]-A[j]) <= d:\n ans += 2\nprint(ans)\n", "s=input().split()\r\nn=int(s[0])\r\nd=int(s[1])\r\nl=input().split()\r\nflag=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n x=int(l[i])\r\n y=int(l[j])\r\n if abs(x-y)<=d:\r\n flag+=1\r\nprint(2*flag)\r\n ", "n, d = [int(j) for j in input().split()]\r\nnums = sorted([int(j) for j in input().split()])\r\ncount = 0\r\nfor j in range(n):\r\n for k in range(j + 1, n):\r\n if nums[k] - nums[j] <= d:\r\n count += 1\r\n else:\r\n break\r\nprint(count * 2)\r\n", "n ,d = map(int , input().split(\" \"))\r\na = list(int(i) for i in input().split(\" \")[:n])\r\n \r\nunits = 0\r\nwhile n >=1 and n <=1000 and d>=1 and d <= 10**9 :\r\n for z in range (0,n) :\r\n for i in range(0,n) :\r\n if abs(a[z]-a[i]) <= d and z != i :\r\n units+=1\r\n \r\n print(units) \r\n break\r\n ", "n, k = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nc = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if a[j] - a[i] <= k:\r\n c += 1\r\n else:\r\n break\r\nprint(c << 1)", "def Reconnaissance(soldiers, d, n):\r\n count = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if abs(soldiers[i] - soldiers[j]) <= d:\r\n count += 1\r\n return count\r\n\r\nn, d = map(int, input().split())\r\nsoldiers = [int(x) for x in input().split()]\r\nprint(Reconnaissance(soldiers, d, n))", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(0, n):\r\n for j in range(i+1, n):\r\n if a[j]-a[i] <= d:\r\n ans += 2\r\n else:\r\n break\r\nprint(ans)", "n , d = map(int, input().split())\r\nheights = list(map(int,input().split()))\r\n\r\ncounter = 0\r\n\r\nfor i in range(len(heights)):\r\n for j in range(len(heights)):\r\n if i != j:\r\n diff = abs(heights[i] - heights[j])\r\n if diff <= d:\r\n counter += 1\r\n\r\nprint(counter)", "n,d=map(int,input().split())\na=list(map(int,input().split()))\na.sort()\nc=0\nfor i in range(0,n):\n for j in range(i+1,n):\n if a[j]-a[i]<=d:\n c+=1\nprint(2*c)\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if abs(l[i]-l[j])<= d: count += 1\r\nprint(count*2)", "[n, d] = map(int, input().split(' '))\ndata = list(map(int, input().split(\" \")))\ncount = 0\nfor i in range(n - 1):\n for j in range(i + 1, n):\n diff = data[i] - data[j] if data[i] > data[j] else data[j] - data[i]\n if diff <= d:\n count += 2\n\nprint(count)", "n,d=[int(item) for item in input().split()]\r\ncont=[int(item) for item in input().split()]\r\nct=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n # if abs(cont[i]-cont[j])<=d:\r\n # ct+=2\r\n ct+=(abs(cont[i]-cont[j])<=d)*2\r\nprint(ct)", "n, m = map(int, input().split())\r\ncount, j = 0, 0\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if abs(a[i] - a[j]) <= m:\r\n count += 1\r\nprint(count * 2)", "n,d=map(int,input().split())\r\nk=0\r\na=sorted(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if abs(a[i]-a[j])<=d:\r\n k+=1 \r\nprint(k-n)", "from sys import stdin\ninput = stdin.readline\n\nnums, diff = map(int,input().split())\nheights = list(map(int,input().split()))\nheights.sort()\n\nmatched = 0\nfor i,shorter in enumerate(heights):\n for higher in heights[i+1:]:\n if higher - shorter > diff:\n break\n matched += 1\nprint(matched*2)\n\n\n", "\r\nn,m=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\na=0\r\nfor i in range(n-1):\r\n\tfor j in range(i+1,n):\r\n\t\tif(l[j]-l[i]<=m):\r\n\t\t\ta+=1\r\n\t\telse:\r\n\t\t\tbreak\r\nprint(a*2)", "import math\r\nN,D=input().split()\r\nn=int(N)\r\nd=int(D)\r\nc=0\r\nheights=list(map(int,input().split()))[:n]\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n diff=math.fabs(heights[i]-heights[j])\r\n if d >= diff >= 0 and i!=j:\r\n c+=1\r\n\r\nprint(c*2)\r\n", "\r\ndef main():\r\n n,d = map(int, input().split())\r\n a=[x for x in map(int,input().split())]\r\n a.sort()\r\n cnt = 0\r\n for i in range(n-1):\r\n for j in range(i+1,n):\r\n if a[j]-a[i] <= d:\r\n cnt+=1\r\n else:\r\n break\r\n print(cnt*2)\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if abs(a[i] - a[j]) <= k:\r\n count += 1\r\n\r\nprint(count * 2)\r\n", "num, diff = input().split()\r\nnum = int(num)\r\ndiff = int(diff)\r\nheight = [int(x) for x in input().split()]\r\namount = 0\r\n\r\nfor i in height:\r\n for x in height:\r\n if diff*-1 <= x-i <= diff:\r\n amount += 1\r\n amount -= 1\r\n\r\nprint(amount)", "n, d = (int(i) for i in input().split())\na = sorted(int(i) for i in input().split())\nres = 0\nfor i in range(n):\n lo, hi = i + 1, n\n while lo < hi:\n mi = lo + (hi - lo) // 2\n if a[mi] - a[i] > d:\n hi = mi\n else:\n lo = mi + 1\n res += 2 * (lo - i - 1)\nprint(res)\n", "def Siao(n,x,s):\r\n m=0\r\n for i in range(len(s)):\r\n for j in range(i+1,len(s)):\r\n if abs(int(s[j]) - int(s[i])) <= x:\r\n m+=2\r\n print(m)\r\nn,x=map(int,input().split())\r\ns=input().split()\r\nSiao(n,x,s)", "n, d = map(int, input().split())\r\nls = list(map(int,input().strip().split()))[:n]\r\nnum_pair = 0\r\nfor i in range(0, n):\r\n for j in range(0, n):\r\n if abs (ls[i]-ls[j])<=d:\r\n num_pair = num_pair+1\r\nprint(num_pair-n) ", "n,d=map(int,input().split(' '))\r\ns=list(map(int,input().split(' ')))\r\ns=sorted(s)\r\ns=s[::-1]\r\nr=0\r\nfor i in range(0,len(s)):\r\n\tfor j in range(0,len(s)):\r\n\t\tif abs(s[i]-s[j])<=d:\r\n\t\t\tif i!=j:\r\n\t\t\t\tr+=1\r\nprint(r)", "# import math\r\n# import re\r\n# import random\r\ndef solve():\r\n t=1\r\n # t = int(input())\r\n while(t):\r\n t-=1\r\n #n = int(input())\r\n n,d = [int(x) for x in input().split()]\r\n h = [int(x) for x in input().split()]\r\n # s = input()\r\n h.sort()\r\n count = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if(i!=j and abs(h[i]-h[j]) <=d):\r\n count+=1\r\n \r\n print(count)\r\n \r\n\r\n\r\nsolve()\r\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n\r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n\r\ndef solve():\r\n\tn,m=read_ints()\r\n\ta=read_ints()\r\n\tcnt=0\r\n\tfor i in range(n):\r\n\t\tfor j in range(i+1, n):\r\n\t\t\tif abs(a[i]-a[j])<=m:\r\n\t\t\t\tcnt+=2\r\n\tprint(cnt)\r\n\r\nsolve()\r\n", "import sys\r\n\r\n\r\ndef solution(n, d, a_arr):\r\n\r\n count = 0\r\n for i in range(len(a_arr)):\r\n for j in range(len(a_arr)):\r\n if i == j:\r\n continue\r\n diff = abs(a_arr[i]-a_arr[j])\r\n #print(diff, d, count)\r\n if diff <= d:\r\n count += 1\r\n\r\n return count\r\n\r\n\r\nif __name__ == '__main__':\r\n n = sys.stdin.readline()\r\n\r\n while n:\r\n n_in, d = n.split() # array length\r\n a_arr = [int(i) for i in sys.stdin.readline().split()] # input array\r\n print(solution(int(n_in), int(d), a_arr))\r\n n = sys.stdin.readline()\r\n", "a,b=input().split()\r\nc=[int(x) for x in input().split()]\r\nc.sort()\r\ndem=0\r\nfor i in range(int(a)):\r\n for j in range(i+1,int(a)):\r\n if (c[j]-c[i])<=int(b):\r\n dem+=1\r\n \r\nprint(dem*2)", "a,b=map(int,input().split())\r\nk=list(map(int,input().split()))\r\nprint(sum(2 for i in range(0,a)\r\nfor j in range(i+1,a) \r\nif abs(k[i]-k[j])<=b))", "n,d=map(int, input().split(\" \"))\nls=list(map(int, input().split(\" \")))\nstep=0\nfor x in range(n):\n for y in range(x+1,n):\n if (abs(ls[x]-ls[y])<=d):\n step+=1\nprint(step*2)\n\t \t\t\t\t \t\t\t\t \t \t \t\t\t\t\t\t \t \t", "n,d = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ns = sorted(s)\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if s[j]-s[i] <= d:\r\n count +=2\r\n else:\r\n break\r\nprint(count)", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor i in range(len(arr)):\r\n for j in range(i+1, len(arr)):\r\n diff = abs(arr[i] - arr[j])\r\n if diff <= d:\r\n count += 2\r\n \r\nprint(count)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\t\r\na.sort()\r\ns=0 \t \t\r\nfor i in range (n-1):\r\n\tfor j in range(i+1,n):\r\n\t\tif a[j]-a[i]<=d:\r\n\t\t\ts=s+1\r\n\t\telse:\r\n\t\t\tbreak\t\r\nprint(2*s)", "n , d = [int(i) for i in input().split()]\r\nc = 0\r\n\r\nls = [int(i) for i in (input().split())]\r\nfor i in range(len(ls)):\r\n for j in range(i+1 , len(ls)):\r\n if abs(ls[j] - ls[i]) <= d:\r\n c += 1\r\nprint(c*2)\r\n\r\n\r\n", "c=0\nn,d=map(int,input().split())\nl=list(map(int,input().split()))\nif n==1:\n\tprint(\"0\")\n\texit()\nelif n==2:\n\tif l[0]-1[1]>=d:\n\t\tc+=1\n\t\tprint(c)\n\telif l[1]-l[0]>=d:\n\t\tc+=1\n\t\tprint(c)\n\t\texit()\nelif n>2:\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif l[i]-l[j]<=d and l[i]-l[j]>=-d and j!=i:\n\t\t\t\tc+=1\n\tprint(c)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\n\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if abs(a[i]-a[j])<=m:\r\n s+=1\r\nprint(s-n) \r\n", "n, d = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(len(A) - 1):\r\n for j in range(i + 1, len(A)):\r\n if abs(A[i] - A[j]) <= d:\r\n ans += 2\r\nprint(ans) ", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncounter = 0\r\nfor _ in range(0, n):\r\n for i in range(_ + 1, n):\r\n if abs(a[_] - a[i]) <= d:\r\n counter += 1\r\nprint(counter * 2)\r\n\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# سوسیس و بادمجون با پنیر پیتزا\r\n", "a,b = map(int,input().split())\r\ny = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(a):\r\n for j in range(a):\r\n if abs(y[j]-y[i])<=b and j!=i:\r\n c+=1\r\nprint(c)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if abs(a[i] - a[j]) <= d and i != j:\r\n ans += 1\r\nprint(ans)\r\n", "n,d=map(int,input().split())\r\na=list(map(int, input().split( )))\r\ncount=0\r\nsub=0\r\nfor i in range (0,n):\r\n for j in range(0,n):\r\n if j==i:\r\n continue\r\n\r\n else:\r\n sub=abs(a[i]-a[j])\r\n if sub<=d:\r\n count=count+1\r\nprint(count)\r\n\r\n", "def inp(s):\r\n j = 0\r\n a = []\r\n for i in range(len(s)):\r\n if s[i] == \" \":\r\n a.append(int(s[j:i]))\r\n j = i+1\r\n if i == len(s)-1:\r\n a.append(int(s[j:]))\r\n return a\r\n\r\nn,d = input().split()\r\nn = int(n)\r\nd = int(d)\r\n\r\ns = input()\r\n\r\na = inp(s)\r\n\r\n\r\nx = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n else:\r\n r = abs(a[i]-a[j])\r\n if r <= d:\r\n x += 1\r\n \r\n \r\n\r\nprint (x)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nanswer=0;a.sort(reverse=True)\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if a[i]-a[j]<=d:\r\n answer+=1\r\n else:\r\n break\r\nprint(answer*2)", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n if abs(a[i] - a[j]) <= d:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "[a,b]=map(int,input().split())\r\nheight=list(map(int,input().split()))\r\nans=0\r\nfor x in range(a):\r\n for y in range(a):\r\n if x!=y and abs(height[x]-height[y])<=b:\r\n ans+=1\r\nprint(ans)", "from itertools import takewhile\r\nfrom collections import deque\r\n\r\nn, d = [int(c) for c in input().split()]\r\nheights = deque(sorted([int(c) for c in input().split()]))\r\n\r\nans = 0\r\nwhile heights:\r\n elm = heights.popleft()\r\n ans += sum(1 for _ in takewhile(lambda x: x - elm <= d, heights))\r\n\r\nprint(2 * ans)\r\n", "n,d=map(int,input().split())\r\na=sorted([int(a) for a in input().split()])\r\ncount=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[j]-a[i]<=d:\r\n count+=2\r\n else:\r\n break\r\nprint(count)", "n,d=map(int,input().split())\r\nnums=[int(i) for i in input().split()]\r\n\r\nnums.sort()\r\n\r\nl=0\r\ncount=0\r\nfor r in range(1,len(nums)):\r\n while nums[r]-nums[l]>d:\r\n l+=1\r\n\r\n count+=r-l\r\n\r\nprint(count*2)\r\n", "n,m = map(int, input().split())\nmat = list(map(int, input().split()))\nmat = sorted(mat)\nres = 0\nfor i in range(n):\n for j in range(n):\n if i==j:\n continue\n if mat[i] - mat[j] + m < 0:\n break\n if mat[i] - mat[j] <= m:\n res+=1\nprint(res)\n", "n,d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\na = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and abs(l[i]-l[j])<=d:\r\n a+=1\r\nprint(a)", "# https://codeforces.com/problemset/problem/32/A\r\n\r\ndef func_sol(raw_data):\r\n lines = raw_data.split('\\n')\r\n n, d = map(int, lines[0].split(' '))\r\n a = list(map(int, lines[1].split(' ')))\r\n nr = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if abs(a[i] - a[j]) <= d and i != j:\r\n nr += 1\r\n return str(nr)\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "a, b = map(int, input().split())\r\nconuter = 0\r\nlist1 = [int(i) for i in input().split()]\r\nfor i in range(1, a):\r\n for j in range(i):\r\n if b >= list1[i]-list1[j] >= -b:\r\n conuter += 2\r\nprint(conuter)", "from itertools import permutations\r\n\r\nn,k = map(int,input().split())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nperms = permutations(arr,2)\r\n\r\nans = [perm for perm in perms if abs(perm[0]-perm[-1]) <= k]\r\n\r\nprint(len(ans))", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(a):\r\n for j in range(i+1,a):\r\n if(abs(l[i]-l[j])<=b):\r\n count+=1\r\nprint(count*2)", "n,d = map(int,input().split())\nh = list(map(int,input().split()))\nnum = 0\nfor i in range(n):\n for a in range(n):\n x = abs(h[i] - h[a])\n if x <= d and x >= 0:\n num = num + 1\n num = num - 1\nprint(num)\n\t \t\t\t \t\t\t\t \t \t\t \t \t \t \t", "n,d=map(int,(input().split()))\r\nl=list(map(int,input().split()))\r\nc=0\r\nl.sort()\r\nfor i in range(n-1):\r\n\tj=1\r\n\ttry:\r\n\t\twhile True:\r\n\t\t\tif l[i+j]-l[i]<=d:\r\n\t\t\t\tc+=2\r\n\t\t\t\tj+=1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\texcept:\r\n\t\tpass\r\nprint(c)", "import math,sys\r\n#from itertools import permutations, combinations;import heapq,random;\r\nfrom collections import defaultdict,deque\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\ndef I():return (int(sys.stdin.readline()))\r\ndef In():return(map(int,sys.stdin.readline().split()))\r\ndef Sn():return sys.stdin.readline().strip()\r\n#sys.setrecursionlimit(1500)\r\ndef dict(a):\r\n d={} \r\n for x in a:\r\n if d.get(x,-1)!=-1:\r\n d[x]+=1\r\n else:\r\n d[x]=1\r\n return d\r\ndef find_gt(a, x):\r\n 'Find leftmost value greater than x'\r\n i = bi.bisect_right(a, x)\r\n if i != len(a):\r\n return i-1\r\n\r\n else: \r\n return len(a)-1\r\n \r\ndef main():\r\n try:\r\n n,k=In()\r\n l=list(In())\r\n l.sort()\r\n cnt=0\r\n for i in range(n):\r\n pos=find_gt(l,l[i]+k)\r\n if pos>=n:\r\n break\r\n cnt+=(pos-i)*2\r\n \r\n print(cnt)\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n # for _ in range(I()):main()\r\n for _ in range(1):main()\r\n# ******************* All The Best ******************* #", "a,b = map(int,input().split())\r\nnum = list(map(int,input().split()))\r\nnum = sorted(num)\r\nans = 0\r\nif a == 0:\r\n print(0)\r\nelse:\r\n for i in range(len(num)):\r\n for k in range(i+1,len(num)):\r\n if num[k] - num[i] <= b:\r\n ans += 2\r\n elif num[k] - num[i] > b:\r\n break\r\nprint(ans)", "l , d = input().split()\r\nd = int(d)\r\nli = list(map( int , input().split() ))\r\ni=0\r\ncount = 0\r\nwhile i<len(li):\r\n j=i+1\r\n while j<len(li):\r\n if abs(li[i]-li[j])<=int(d):\r\n count=count+1\r\n j = j+1\r\n i = i+1\r\nprint(count*2)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(a):\r\n\tfor j in range(a):\r\n\t\tif abs(c[i]-c[j])<=b:\r\n\t\t\tl.append(1)\r\nprint(sum(l)-a)\t", "inp = [int(x) for x in input().split(\" \")]\r\nheights = [int(x) for x in input().split(\" \")]\r\nans = 0\r\nfor i in range(inp[0]):\r\n for j in range(inp[0]):\r\n if i != j:\r\n if abs(heights[i] - heights[j]) <= inp[1]:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,d = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\n\r\np = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if abs(h[i]-h[j])<=d and i!=j:\r\n p+=1\r\nprint(p)\r\n", "I = lambda: map(int, input().split())\r\n \r\nn, d = I()\r\nH = sorted(I())\r\n \r\nprint(sum(abs(H[i]-H[j])<=d for i in range(n) for j in range(n)) - n)", "[n,height_difference] = (map(int, input().split()))\r\nf=list(map(int, input().split()))\r\ncount = 0\r\nfor x in range (n):\r\n for y in range (x+1, n):\r\n u = f[x]\r\n s = f[y]\r\n if u-s<=height_difference and s-u<=height_difference:\r\n count += 1\r\nprint (count*2)\r\n", "c=input().split()\r\nn,d=int(c[0]),int(c[1])\r\nl=[int(i) for i in input().split()]\r\ns=0\r\nfor i in range(len(l)-1):\r\n for j in range(i+1,len(l)):\r\n \r\n if(abs(l[i]-l[j])<=d):\r\n s=s+2\r\n \r\nprint(s)\r\n\r\n\r\n \r\n \r\n\r\n \r\n ", "# 32 A Reconnaissance\r\n\r\nn, d = map(int,input().split())\r\ns = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor i in range(len(s)):\r\n\tfor j in range(len(s)):\r\n\t\tif i != j and abs(s[i] - s[j]) <= d:\r\n\t\t\tcount += 1\r\n\telse:\r\n\t\tpass\r\n\r\nprint(count)\r\n\r\n\r\n\r\n", "x=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nc=0\r\nl.sort()\r\nfor i in range(len(l)-1):\r\n for j in range(i+1,len(l)):\r\n if abs(l[i]-l[j])<=x[1]:\r\n #print(l[i],l[j])\r\n c=c+1\r\nprint(c*2)\r\n", "n,d=[int(x) for x in input().split(\" \")]\r\nl=[int(x) for x in input().split(\" \")]\r\nl.sort()\r\nc=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if l[j]-l[i]<=d:\r\n c+=2\r\nprint(c) ", "n, d = (int(x) for x in input().split())\na = sorted([int(x) for x in input().split()])\n\ns = 0\n\nl = 0\nfor r in range(1, n):\n while a[r] - a[l] > d:\n l += 1\n s += (r - l) * 2\n\nprint(s)\n", "n=[int (x) for x in input().split()]\r\np=[int (x) for x in input().split()]\r\nc=0\r\np.sort()\r\nfor i in range(n[0]):\r\n for j in range(i+1,n[0]):\r\n if (p[j]-p[i] <= n[1]):\r\n c+=1\r\nprint(2*c)", "# Reconnaissance\r\ndef solution(soldiers: list, n: int, d: int):\r\n soldiers.sort()\r\n count = 0\r\n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if soldiers[j] - soldiers[i] <= d:\r\n count += 1\r\n\r\n return count * 2\r\n\r\n\r\nn, d = list((map(int, input().split())))\r\nsoldiers = list((map(int, input().split())))\r\n\r\nres = solution(soldiers, n, d)\r\nprint(res)\r\n", "n, d = map(int, input().split())\nheights = list(map(int, input().split()))\n\ncounter = 0\nfor i in range(len(heights)):\n for j in range(len(heights)):\n if i == j:\n continue\n if abs(heights[i] - heights[j]) <= d:\n counter += 1\nprint(counter)\n", "n, d = map(int, input().split())\r\nsoldiers = [*map(int, input().split())]\r\npairs = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j and abs(soldiers[i] - soldiers[j]) <= d:\r\n pairs += 1\r\n\r\nprint(pairs)\r\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\n\r\nn, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncount = 0\r\nfor i in range(0, n):\r\n for j in range(i+1, n):\r\n if abs(arr[i] - arr[j]) <= d:\r\n count += 2\r\n else:\r\n break\r\nprint(count)\r\n", "n,d=map(int,input().split())\r\nlist1=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and abs(list1[i]-list1[j])<=d:\r\n count+=1\r\nprint(count)\r\n", "n,d=[int(i1) for i1 in input().split()]\r\nl1=[int(i2) for i2 in input().split()]\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n z=l1[i]\r\n y=l1[j]\r\n if z-d<=y<=z+d:\r\n cnt+=1\r\nprint(cnt)", "class CodeforcesTask32ASolution:\n def __init__(self):\n self.result = ''\n self.n_d = []\n self.heights = []\n\n def read_input(self):\n self.n_d = [int(x) for x in input().split(\" \")]\n self.heights = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n ways = 0\n d = self.n_d[1]\n for x in range(self.n_d[0]):\n for y in range(self.n_d[0]):\n if x != y:\n if abs(self.heights[x] - self.heights[y]) <= d:\n ways += 1\n self.result = str(ways)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask32ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncount=0\r\nfor i in range(n-1):\r\n j=i+1\r\n while a[j]-a[i]<=d:\r\n count+=1\r\n if j!=n-1:\r\n j=j+1\r\n else:\r\n break\r\nprint(2*count)\r\n \r\n ", "a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nc = 0\r\ni, j = 0, 0\r\nwhile i < len(l):\r\n if abs(l[i] - l[j]) <= b:\r\n if i != j:\r\n c += 1\r\n # print(l[i], l[j])\r\n j += 1\r\n if j == len(l):\r\n i += 1\r\n j = 0\r\nprint(c)", "n,m = map(int,input().split())\r\nl = [int(i) for i in input().split()]\r\nl.sort()\r\nk = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i] >= l[j] - m and l[i] <= l[j] + m:\r\n k += 1\r\nprint(k - n)", "n,d = list(map(int,input().split()))\nl = list(map(int,input().split()))\n\nans = 0\n\nfor i in range(n):\n for j in range(n):\n if abs(l[i]-l[j])<=d:\n ans += 1\n\nans -= n\n \nprint(ans)\n\n\n", "n , m = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nl.sort()\r\nfor i in range(n-1):\r\n\tfor j in range(i+1,n):\r\n\t\tif abs(l[i]-l[j])<=m:\r\n\t\t\tcount += 2\r\nprint(count)\t\t\t\t\t", "from itertools import combinations\r\n\r\nn, d = [int(c) for c in input().split()]\r\nheights = [int(c) for c in input().split()]\r\nans = 2 * sum(1 for a, b in combinations(heights, 2) if abs(a-b) <= d)\r\nprint(ans)\r\n", "def main():\r\n\tn, d = map(int, input().split())\r\n\ta = list(map(int, input().split()))\r\n\r\n\tans = 0\r\n\tfor i in range(n - 1):\r\n\t\tcnt = 0\r\n\t\tfor j in range(i + 1, n):\r\n\t\t\tif abs(a[i] - a[j]) <= d:\r\n\t\t\t\tcnt += 2\r\n\t\tans += cnt\r\n\tprint(ans)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "# cf 32 A 800\nn, d = map(int, input().split())\nA = [*map(int, input().split())]\nc = 0\nfor i in range(n):\n for j in range(n):\n if i != j:\n if abs(A[i] - A[j]) <= d:\n c += 1\nprint(c)\n \n", "count = 0\r\na = list(map(int, input().split()))[:2]\r\nn, d = a[0], a[1]\r\nheights = list(map(int, input().split()))[:n]\r\nheights.sort()\r\n# print(heights)\r\nfor i in range(len(heights)):\r\n for j in range(i + 1, len(heights)):\r\n # print(heights[j] - heights[i], \"j\")\r\n if 0 <= heights[j] - heights[i] <= d:\r\n count += 2\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\r\nn,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncont = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if abs(a[i]-a[j]) <= d: cont += 1\r\n \r\nprint(cont*2)\r\n\r\n", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd\r\n'''\r\n\r\n\r\n# Be Kasif tarin halat momken neveshtam hal kon :DDDD\r\n\r\nN = list(map(int, input().split()))\r\nL = sorted(list(map(int, input().split())))\r\nC = 0\r\nfor _ in range(N[0] - 1):\r\n I=_+1\r\n while(True):\r\n if (L[_] <= L[I] and abs(L[_]-L[I])<=N[1]):\r\n C+=2\r\n I+=1\r\n if(I>=N[0]):\r\n break\r\nprint(C)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n'''\r\nfor _ in range(N[0] - 2):\r\n I=_+1\r\n while True:\r\n print(\"in\")\r\n print(\"I : \",I)\r\n if (L[_] <= L[I] and abs(L[_]-L[I])<=N[1]):\r\n if (L[_] == L[I]):\r\n if (ISTHERE(L[_], L)):\r\n print(\"B1 : \", L[_])\r\n LRNZ.append(L[_])\r\n C += 1\r\n else:\r\n print(\"B2 : \", L[_])\r\n C += 2\r\n else:\r\n break\r\n I += 1\r\n print(\"LRNZ : \",LRNZ)\r\nprint(C)\r\n'''\r\n", "[n, d] = map(int, input().split())\nlist = list(map(int, input().split()))\ncount = 0\nfor i in range(0, n):\n for j in range(i+1, n):\n if (abs(list[i] - list[j]) <= d):\n count += 1\n\nprint(count * 2)\n\n\n\n\n", "[n,d]=map(int, input().split())\r\nh = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(0, n):\r\n for j in range(i+1, n):\r\n if i != j:\r\n if (abs(h[j] - h[i])) <= d:\r\n ans += 1\r\nprint (2*ans)\r\n#feifei is awesome", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in range(len(c)):\r\n for j in range(i+1, len(c)):\r\n if abs(c[i] - c[j]) <= b:\r\n counter += 2\r\nprint(counter)", "[n,d]=map(int, input().split())\r\nt=list(map(int, input().split()))\r\nb=0\r\nx=0\r\nfor i in range (0, n):\r\n for a in range (0, n):\r\n if i==a:\r\n continue;\r\n elif abs(int(t[a]-t[i]))<=d:\r\n b=b+1\r\n continue;\r\nprint(b)", "\r\na,b=map(int, input().split())\r\nc=sorted(list(map(int, input().split())))\r\n\r\ncnt=0\r\nfor i in range(a):\r\n for j in range(a):\r\n if abs(c[i]-c[j])<=b:\r\n cnt+=1\r\nprint(cnt-a)\r\n \r\n \r\n", "x=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nsumi=0\r\np.sort()\r\nfor i in range(x[0]):\r\n for j in range(x[0]):\r\n if i<j and ((p[i]+x[1])>=p[j]):\r\n sumi+=1\r\n elif ((p[i]<=p[j]+x[1])) and i>j:\r\n sumi+=1\r\n # print(i,j)\r\nprint(sumi)", "a , k = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(a):\r\n for j in range(a):\r\n if abs(b[i] - b[j]) <= k and i != j:\r\n count += 1\r\nprint(count)\r\n", "# cook your dish here\r\nn,d=list(map(int,input().split()))\r\nA=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if abs(A[i]-A[j])<=d:\r\n cnt+=1\r\nprint(2*cnt)\r\n ", "inp = input().split()\r\nn = int(inp[0])\r\nd = int(inp[1])\r\nheights = input().split()\r\nheights = [int(i) for i in heights]\r\nheights.sort()\r\nans = 0\r\nfor i in range(0, n):\r\n for j in range(i+1, n):\r\n if heights[j] - heights[i] <= d:\r\n ans += 2\r\n else:\r\n break\r\nprint(ans)\r\n\r\n", "n,d=map(int,input().split())\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if(abs(l[i]-l[j])<=d):\r\n c+=2\r\nprint(c) ", "temp = val = 0\r\nn,m = map(int,input().split())\r\narr=list(map(int, input().split(' ')[:n]))\r\narr.sort()\r\nfor i in range(n):\r\n for j in range(n):\r\n if(arr[i]-arr[j]<=m and i!=j):\r\n temp+=1\r\n if(i==j):\r\n break\r\nprint(2*temp)\r\n", "n, d = map(int,\r\n input().split())\r\nar = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(n-1):\r\n for j in range(i+1,\r\n n):\r\n if abs(ar[i]-ar[j]) <= d:\r\n c += 1\r\nprint(c*2)\r\n", "n,d=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\na=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if (l[j]-l[i])<=d:\r\n a+=1\r\n else:\r\n break\r\nprint(2*a)\r\n\r\n", "abc, bca = map(int, input().split())\r\nvan = sorted(list(map(int, input().split())))\r\ns0l= 0\r\nfor sur in range(abc):\r\n for gee in range(sur + 1, abc):\r\n if 0 <= van[gee] - van[sur] <= bca:\r\n s0l += 1\r\nprint(s0l * 2)", "n,d = input().split()\r\nn = int(n)\r\nd = int(d)\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nk = len(l)\r\nc = 0\r\nfor i in range(k):\r\n for j in range(i+1,k):\r\n if (l[j] - l[i]) <= d:\r\n c = c + 1\r\nprint(c*2)\r\n ", "n,d=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\ncnt=0\r\nfor i in range(len(l)):\r\n for j in range(len(l)):\r\n if i!=j and abs(l[i]-l[j])<=d:\r\n cnt+=1\r\nprint(cnt)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 26 20:55:06 2021\r\n\r\n@author: cheehong\r\n\"\"\"\r\n\r\nl=list(map(int, input().split()))\r\nn=l[0]\r\nh=l[1]\r\ns=list(map(int, input().split()))\r\nk=0\r\nt=0\r\nwhile k<n:\r\n r=0\r\n while r<n:\r\n if r!=k:\r\n if s[k]>s[r]:\r\n if int(s[k])-int(s[r])<=h:\r\n t+=1\r\n else:\r\n if int(s[r])-int(s[k])<=h:\r\n t+=1\r\n r+=1\r\n k+=1\r\nprint(t)", "n,d=map(int,input().split())\r\nheight=list(map(int,input().split()))\r\nheight.sort()\r\nheight.reverse()\r\ncara=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and height[i]>=height[j]:\r\n if height[i]-height[j]<=d:\r\n cara+=1\r\n elif i!=j and height[j]>=height[i]:\r\n if height[j]-height[i]<=d:\r\n cara+=1\r\nprint(cara)\r\n", "n, d = map(int, input().split())\r\nnums = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if (nums[i] - nums[j] <= d) and (nums[j] - nums[i] <= d):\r\n count += 2\r\nprint(count)", "n,d = map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\na=0\r\nfor i in range(n-1):\r\n\tfor j in range(i+1,n):\r\n\t\tif abs(l[i]-l[j]) <= d:\r\n\t\t\ta+=1\r\nprint(2*a)", "n, d = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\ndef main(a, n, d):\n answer = 0\n a = sorted(a)\n length_a = len(a)\n i = 1\n for soldier in range(length_a - 1):\n while soldier + i < length_a:\n if a[soldier] + d >= a[i + soldier]:\n answer += 2\n else:\n break\n i += 1\n i = 1\n return answer\n\nprint(main(a, n, d))\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,d = map(int, wtf[0].split())\r\n A = list(map(int, wtf[1].split()))\r\n ans = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if j != i and abs(A[i]-A[j]) <= d:\r\n ans += 1\r\n print(ans)\r\n", "# Reconnaissance\r\n\r\n[n, d] = map(int, input().split()) \r\nheightList = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(0, len(heightList)):\r\n for j in range(0, len(heightList)):\r\n if (j != i):\r\n if (abs(heightList[j]-heightList[i]) <= d):\r\n ans += 1 \r\n\r\nprint(ans)", "def validPairs(nums, h):\r\n pairs = 0\r\n for i in range(len(nums)):\r\n for j in range(i + 1, len(nums)):\r\n if abs(nums[i] - nums[j]) <= h:\r\n pairs += 1\r\n return 2 * pairs\r\n\r\nn, h = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nprint(validPairs(nums, h))", "import itertools\r\n\r\nn, d = map(int, input().split())\r\nh = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i, j in itertools.product(range(n), repeat=2):\r\n if i == j:\r\n continue\r\n else:\r\n if abs(h[i] - h[j]) <= d:\r\n ans += 1\r\n\r\nprint(ans)", "n, d = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\ncnt = 0\r\nfor l in range(len(arr) - 1):\r\n for r in range(l + 1, len(arr)):\r\n if arr[r] - arr[l] <= d:\r\n cnt += 1\r\n\r\nprint(2 * cnt)", "[numSoldiers, maxDiff] = map(int, input().split())\nheightList = list(map(int, input().split()))\n\nnumUnits = 0\n\nfor i in range(len(heightList)):\n for j in range(len(heightList)):\n if i == j:\n continue\n if abs(heightList[i] - heightList[j]) <= maxDiff:\n numUnits += 1\n\nprint(numUnits)\n \n", "\r\n\r\nn , d = map(int , input().split())\r\n\r\nx = [int(x) for x in input().split()]\r\ncnt = 0\r\nfor i in x:\r\n for j in x:\r\n if abs(i - j) <= d:\r\n cnt += 1\r\n \r\nprint(cnt - n)", "t=1\r\n # t = int(input())\r\nfor i in range(t):\r\n #n = int(input())\r\n\r\n a = input() ; a = a.split()\r\n n = int(a[0]) ; k = int(a[1])\r\n a = input(); a = a.split()\r\n a = [int(x) for x in a]\r\n a.sort(reverse=True)\r\n j = 0\r\n sm = 0\r\n while (j < (n -1)) :\r\n l = 1\r\n while a[j] - a[j+l] <= k:\r\n sm += 1\r\n l += 1\r\n if (j+l) >= n:\r\n break\r\n j += 1\r\n print( sm*2 )", "n, d = map(int,input().split())\ns=list(map(int,input().split()))\nways=0\n\nfor i in range(n):\n for j in range(n):\n if i!=j and abs(s[i]-s[j])<=d:\n ways+=1\n\nprint(ways)\n", "n, d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nret = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if abs(a[i] - a[j]) <= d:\r\n ret += 1\r\n\r\nret <<= 1\r\n\r\nprint(ret)", "import re\r\nn, d = list(map(lambda x:int(x), re.split(\"\\s+\", input().strip())))\r\narr = list(map(lambda x:int(x), re.split(\"\\s+\", input().strip())))\r\narr.sort()\r\nans = 0\r\nfor i in range(n):\r\n j = i-1\r\n while j >= 0:\r\n if (arr[i]-arr[j] > d):\r\n break\r\n else:\r\n j-=1\r\n ans += 2*(i-1-j)\r\n\r\nprint(ans)\r\n", "import sys\ninput = sys.stdin.buffer.readline\n\n# t = int(input())\n# for _ in range(t):\nn, d = map(int, input().split())\narr = list(map(int, input().split()))\n\narr.sort()\nans = 0\nfor i in range(n):\n for j in range(n):\n if j != i:\n if abs(arr[i]- arr[j]) <= d:\n ans+=1\nprint(ans)\n\n", "n, d = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n r = heights[i]\r\n m = heights[j]\r\n if r - m <= d and m - r <=d:\r\n s = s + 1 \r\nprint (2*s) ", "n,m=map(int,input().split());a=sorted(list(map(int,input().split())))\r\nx=a[::-1]\r\np=0\r\nfor t in range(n-1):\r\n\tfor i in range(t+1,n):\r\n\t\tif abs(a[t]-a[i])<=m:\r\n\t\t\tp+=1\r\n\t\tif abs(x[t]-x[i])<=m:\r\n\t\t\tp+=1\r\nprint(p)\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "n, d = map(int, input().split())\nheights = list(map(int, input().split()))\n\nways = 0\n\nfor i in range(n):\n for j in range(i + 1, n):\n if abs(heights[i] - heights[j]) <= d:\n ways += 2 # Count both (i, j) and (j, i) as different ways\n\nprint(ways)\n \t \t \t\t\t\t\t \t\t\t \t\t\t", "n, d = map(int, input().split())\r\nall = list(map(int, input().split()))\r\nans = 0\r\nfor i, x in enumerate(all):\r\n for y in all[i + 1:]:\r\n if abs(x - y) <= d:\r\n ans += 1\r\nprint(ans * 2)", "n,d = list(map(int, input().split(\" \")))\nnumbers, total = sorted(list(map(int, input().split(\" \")))), 0\nfor i in range(n):\n\tk = i+1\n\twhile k < len(numbers) and numbers[k] <= numbers[i]+d: k+=1\n\ttotal += k - i-1\nprint(2*total)", "n , d = map(int , input().split())\r\ncounter = 0 \r\nl = list(map(int ,input().split()))\r\nfor i in range(n) :\r\n for j in range(n):\r\n if i!=j and abs(l[i] - l[j]) <= d : \r\n counter += 1 \r\nprint(counter)", "n,d = map(int,input().split())\r\n\r\nnl = list(map(int,input().split()))\r\nnl.sort()\r\nc = 0\r\n\r\nfor i in reversed(range(len(nl))):\r\n\tfor j in reversed(range(i)):\r\n\t\tc = c+1 if nl[i]-nl[j] <= d else c\r\n\r\nprint(2*c)", "n, d = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\na.sort()\r\nres = 0\r\nleft = 0\r\nfor right in range(n):\r\n while a[right] - a[left] > d:\r\n left += 1\r\n res += (right - left) * 2\r\nprint (res)", "import itertools\r\nn_sold, d = list(map(int, input().split()))\r\nentrada = list(map(int, input().split()))\r\ncomb = itertools.combinations(entrada, 2)\r\ncount = 0\r\nfor each1, each2 in list(comb):\r\n if abs(each1 - each2) <= d:\r\n count += 1\r\nprint(count*2)\r\n", "n, m = input().split()\r\nm = int(m)\r\nnumbers=input().split()\r\nnumbers = [int(i) for i in numbers] \r\n\r\ns=0\r\nfor i, x in enumerate(numbers):\r\n for j, y in enumerate(numbers):\r\n if i != j and abs(x-y)<=m:\r\n s=s+1\r\nprint(s)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(len(a)):\r\n\tfor j in range(len(a)):\r\n\t\tif i != j:\r\n\t\t\tb = max(a[i], a[j]) - min(a[i], a[j])\r\n\t\t\tif b <= d:\r\n\t\t\t\tans += 1\r\nprint(ans) \r\n", "n, d = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n pass\r\n elif abs(li[i] - li[j]) <= d:\r\n c += 1\r\nprint(c)", "n, d = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if abs(l[i] - l[j]) <= d:\r\n s=s+1\r\nprint(2 * s)", "def read_tokens():\n return input().strip().split(' ')\n\n\ndef read_ints():\n return [int(s) for s in read_tokens()]\n\n\nn, d = read_ints()\narr = read_ints()\n\n\ndef solve(arr: list, d: int) -> int:\n cnt = 0\n n = len(arr)\n for i in range(n):\n for j in range(i+1, n):\n if abs(arr[i] - arr[j]) <= d:\n cnt += 1\n # n = len(arr)\n # for mask in range(1 << n):\n # subset = []\n # for i in range(n):\n # if mask & (1 << i):\n # subset.append(arr[i])\n # if len(subset) == 2 and abs(subset[0]-subset[1]) <= d:\n # cnt += 1\n return cnt * 2\n\n\nprint(solve(arr, d))\n", "one = input()\r\nxone = one.split()\r\nn = xone[0]\r\nd = xone[1]\r\ntwo = input()\r\nxtwo = two.split()\r\n\r\nfinal = 0\r\nfor i in xtwo:\r\n for j in xtwo:\r\n if abs(int(i)-int(j)) <= int(d):\r\n final += 1\r\n\r\nfinal -= int(n)\r\nfinalstr = str(final)\r\nprint(finalstr)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i!=j):\r\n x=abs(l[i]-l[j])\r\n if(x<=k):\r\n c+=1\r\nprint(c)\r\n", "n = input().split()\r\nd = int(n[1])\r\nn = int(n[0])\r\nres = 0\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if abs(a[i]-a[j]) <= d:\r\n res +=1\r\nprint(res*2)\r\n", "from itertools import permutations\r\na,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=permutations(c,2)\r\ns=0\r\nfor (x,y) in list(d):\r\n if abs(x-y)<=b:\r\n s=s+1\r\nprint(s)\r\n ", "n, d = map(int, input().split())\r\nls = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j and abs(ls[i]-ls[j])<=d:\r\n cnt+=1\r\nprint(cnt)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\ni=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if i!=j and abs(a[i]-a[j])<=d:\r\n count=count+2\r\nprint(count)\r\n", "s = input()\r\na = s.split()\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\r\ns = input()\r\nb = s.split()\r\nfor i in range(len(b)):\r\n\tb[i] = int(b[i])\r\n\r\nsum = 0\r\nfor i in range(len(b)-1):\r\n\tfor j in range(i+1, len(b)):\r\n\t\tif abs(b[i]-b[j]) <= a[1]:\r\n\t\t\tsum += 1\r\n\t\t\t\r\nprint(sum*2)", "n,d=map(int,input().split())\r\nn=sorted(list(map(int,input().split())))\r\nans=0\r\nfor i in range(len(n)):\r\n for j in range(len(n)):\r\n if i!=j and abs(n[i]-n[j])<=d:\r\n ans+=1\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i!=j and abs(a[i]-a[j])<=k:\r\n\t\t\tc+=1\r\nprint(c)\r\n", "n, d = map(int, input().split())\r\ndata = sorted(map(int, input().split()))\r\nres = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if data[j] - data[i] > d:\r\n break\r\n res += 2\r\nprint(res)\r\n\r\n", "n,d = input().split()\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(0,len(l)):\r\n for j in range(i+1,len(l)):\r\n if l[j]-l[i] <= int(d): c=c+1\r\n else:break\r\nprint(2*c)", "n,d= input().split()\r\nn= int(n)\r\nd= int(d)\r\ncount=0\r\nl= list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if abs(l[i]- l[j])<=d:\r\n count+=1\r\n\r\nprint(2*count)", "def classroom(n,a,lst):\r\n ans=0\r\n for i in range(len(lst)):\r\n for j in range(len(lst)):\r\n if i==j: continue\r\n if abs(lst[i]-lst[j])<=a:\r\n ans+=1\r\n return ans\r\n\r\nn,a=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nprint(classroom(n,a,lst))\r\n", "n,d = map(int, input().split())\r\nh = [int(x) for x in input().split()]\r\ncnt = 0\r\nfor i in range(0,n-1):\r\n for j in range(i+1,n):\r\n if abs(h[i]-h[j]) <= d:\r\n cnt += 2\r\nprint(cnt)", "n,d = map(int, input().split())\r\ncount = 0\r\nl = list(map(int, input().split()))\r\nfor x in l:\r\n for y in l:\r\n if abs(x - y) <= d:\r\n count += 1\r\nprint(count - len(l))\r\n", "n,d=map(int,input().split())\r\nb = map(int,input().split())\r\nh=list(b)\r\na=0\r\nk=0\r\nfor i in range(n):\r\n for j in range(n):\r\n k=h[i] - h[j]\r\n m=abs(k)\r\n if i!=j and m<=d:\r\n a +=1\r\nprint(a)", "n, k = map(int,input().split()); l = 0\r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n if i != j and abs(a[i]-a[j]) <= k: l += 1\r\nprint(l)", "import sys\r\n\r\ndef inp():\r\n inp = input().split()\r\n if len(inp) == 1:\r\n return int(inp[0])\r\n else:\r\n return (int(i) for i in inp)\r\n\r\n\r\ndef inpl():\r\n inp = input().split()\r\n for i in range (len(inp)):\r\n inp[i]=int(inp[i])\r\n return inp\r\n\r\n\r\n\r\n# Problem 1\r\n\r\n# testcases = inp()\r\n#\r\nn,d=inp()\r\ns=inpl()\r\nans=0\r\nfor i in range (len(s)):\r\n for j in range (len(s)):\r\n if i!=j:\r\n if abs(s[i]-s[j])<=d:\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n# Problem 2\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n\r\n\r\n# Problem 3\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n\r\n\r\n# Problem 4\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n\r\n\r\n# Problem 5\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n", "from itertools import combinations\r\n\r\nn, d = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in combinations(h, 2):\r\n if abs(i[0]-i[1]) <= d:\r\n cnt += 1\r\nprint(cnt*2)\r\n", "[n,d] = map(int, input().split())\nheight = list(map(int, input().split()))\ncombinations = 0\nfor s in height:\n for S in height:\n if abs(S-s) <= d:\n combinations += 1 \n else:\n continue\ncombinations -= n\nprint(combinations)", "[n, d] = map(int,input().split())\ns = list(map(int, input().split()))\nx = 0\nfor i in range(0, n):\n for j in range(0, n):\n if abs(s[i] - s[j]) <= d:\n x = x + 1\nprint(x - n)", "info = input().split()\r\nmaxdiff = int(info[1])\r\ndetachmentsize = int(info[0])\r\ndetachment = [int(x) for x in input().split()]\r\nreconnum = 0\r\n\r\nfor i in range(detachmentsize):\r\n for j in range(detachmentsize):\r\n if i == j:\r\n continue\r\n if abs(detachment[i] - detachment[j]) > maxdiff:\r\n continue\r\n reconnum += 1\r\n\r\nprint(reconnum)\r\n", "X = list(map(int,input().split()))\r\nsoldiers = list(map(int,input().split()))\r\nn = 0\r\nfor i in range( 0 , soldiers.__len__()-1):\r\n for j in range(i+1 , soldiers.__len__()):\r\n if abs(soldiers[i] - soldiers[j]) <= X[1]:\r\n n+=1\r\nprint(2*n)\r\n", "'''input\n5 1\n55 30 29 31 55\n'''\nn, d = map(int, input().split())\nh = sorted(map(int, input().split()))\nt = 0\nfor x in range(n):\n\tc = 0\n\ty = x + 1\n\twhile y < n and h[y] - h[x] <= d:\n\t\tc += 2\n\t\ty += 1\n\tt += c\nprint(t)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\ncount=0\r\ni=0\r\nj=1\r\nwhile i<n-1:\r\n while a[j]-a[i]<=d:\r\n count+=1\r\n if j==n-1:\r\n break\r\n j+=1\r\n i+=1\r\n j=i+1\r\nprint(count*2)", "n,d=map(int,input().split())\na = map(int,input().split())\nb=list(a)\nc=0\ne=0\nfor h in range(n):\n for i in range(n):\n e=b[h] - b[i]\n f=abs(e)\n if h!=i and f<=d:\n c=c+1\nprint(c)", "_, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort();k = 0\r\nfor i in range(len(a)):\r\n for j in range(i+1, len(a)):\r\n if abs(a[j] - a[i]) <= b:\r\n k += 1;\r\nprint(k *2)\r\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncnt=0; a.sort()\r\nfor i in range(n):\r\n j=i+1\r\n while j<n and a[j]-a[i]<=d: cnt+=1; j+=1\r\n j=i-1\r\n while j>=0 and a[i]-a[j]<=d: cnt+=1; j-=1\r\nprint(cnt)", "n,d = map(int, input().split())\r\ns = [int(i) for i in input().split()]\r\nk = 0\r\nfor i in range(n-1):\r\n \r\n for j in range(i+1,n):\r\n if abs(s[j]-s[i])<=d:\r\n k+=1\r\nprint(k*2)\r\n \r\n \r\n", "n,d=map(int,input('').split(' '))\r\nhighten=[int(a) for a in input('').split(' ')]\r\nm=0\r\nfor i in range (len(highten)):\r\n for n in range (len(highten)):\r\n if -d<=highten[i]-highten[n]<=d and i-n!=0:\r\n m=m+1\r\n else:\r\n m=m+0\r\nprint(m)\r\n", "import math\nx, k = map(int, input().split())\nv = [int(i) for i in input().split()]\n\nv = sorted(v)\nma = 0\nfor i in range(x):\n for j in range(i+1, x):\n if v[j] - v[i] <= k:\n ma+=1\n else:\n break\nprint(ma*2)\n", "from itertools import combinations\r\nn,d = map(int,input().split())\r\nli= [*map(int,input().split())]\r\nc = 0\r\ncomb = combinations(li,2)\r\nfor i in list(comb):\r\n if abs(i[0]-i[1])<=d:\r\n c+=1\r\nprint(c*2)", "# 32A\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_int_ary():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\nn, d = read_int_ary()\r\na = list(read_int_ary())\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if abs(a[i] - a[j]) <= d:\r\n count += 2\r\n\r\nprint(count)", "def main():\r\n n, d = map(int, input().split())\r\n L = list(map(int, input().split()))\r\n L.sort()\r\n counter = 0\r\n for i in range(n):\r\n M = L[i] + d\r\n j = 1\r\n while i + j < n and L[i + j] <= M:\r\n j += 1\r\n counter += 1\r\n print( 2 * counter )\r\n \r\nmain()", "import sys\r\n\r\nn, k = sys.stdin.readline().split()\r\n\r\nn = int(n)\r\nk = int(k)\r\n\r\naux = sys.stdin.readline().split()\r\naux = [int(x) for x in aux]\r\ncounter = 0\r\nfor i in aux:\r\n for j in aux:\r\n if(abs(i - j) <= k):\r\n counter += 1\r\n\r\n\r\n\r\nprint(counter - len(aux))", "s=input().split()\r\nn,m=int(s[0]),int(s[1])\r\nd=[]\r\ns2=input().split()\r\nfor i in range(n):\r\n d.append(int(s2[i]))\r\n \r\nc=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n if(abs(d[i]-d[j])<=m):\r\n c+=1\r\nprint(2*c)", "[n,d] = map(int, input().split())\r\nA=list(map(int, input().split()))\r\ncounter=0\r\nfor i in range (0,n):\r\n for j in range(i+1,n):\r\n if abs(A[j]-A[i])<=d:\r\n counter=counter+2\r\nprint(counter)" ]

[ "n=int(input())\r\n\r\ndef is_ok(mid):\r\n if mid*(mid+1)//2<n:\r\n return True\r\n else:\r\n return False\r\n \r\ndef binary_search(ng,ok):\r\n while abs(ng-ok)>1:\r\n mid=(ok+ng)//2\r\n if is_ok(mid):\r\n ok=mid\r\n else:\r\n ng=mid\r\n return ok\r\n\r\nm=binary_search(10**9,0)\r\nprint(n-m*(m+1)//2)", "from math import sqrt\r\nx=int(input())\r\nn=(sqrt(8*x+1)-1)/2\r\nif n==int(n):\r\n\tprint(int(n))\r\nelse:\r\n\tn=int(n)\r\n\tk=n*(n+1)//2\r\n\tprint(x-k)", "n = int(input())\r\nx = 1\r\n\r\nwhile True:\r\n cek = x * (x + 1) // 2\r\n if cek >= n:\r\n x -= 1\r\n break\r\n x += 1\r\n\r\nn -= x * (x + 1) // 2\r\n\r\nprint(n)\r\n", "n=int(input())\r\ni1=int(pow((2*n+0.25),0.5)-0.5)\r\n\r\nif(int((i1*(i1+1))/2)==n):\r\n print(i1)\r\nelif(int((i1*(i1+1))/2)<n):\r\n print(n-int((i1*(i1+1))/2))\r\n \r\n\r\n\r\n", "n = int(input())\nx = 0\nfor i in range(1, n+1):\n if x+i >= n:\n ans = n-x\n print(ans)\n exit()\n else:\n x += i\n", "n=int(input())-1\r\nroot=int((-1+(1+4*n*2)**0.5)/2)\r\nprint(n+1-(root*(root+1))//2)\r\n", "n = int(input())\r\nnumber = 1\r\nwhile n > number:\r\n n -= number\r\n number += 1\r\nprint(n)", "n = int(input())\ni, s = 1, 0\nwhile s + i < n:\n s += i\n i += 1\nprint(n - s if n - s <= i else i)\n\n\t\t\t \t\t\t\t\t \t \t \t\t\t\t \t\t\t\t\t \t\t", "import math\r\n\r\npos = int(input())\r\nnum_blocks = int((-1 + math.sqrt(1 + 8 * pos)) * 0.5)\r\nsum = ((num_blocks + 1) * num_blocks) // 2\r\nif(pos == sum):\r\n print(num_blocks)\r\nelse:\r\n print(pos - sum)", "import math\r\ndef solve():\r\n num = int(input())\r\n n = int((-1 + math.sqrt(1+ 8*num))/2)\r\n s = int(n*(n+1)/2)\r\n if ( s == num ):\r\n ans = n\r\n else:\r\n ans = num - s\r\n print(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nÉditeur de Spyder\r\n\r\nCeci est un script temporaire.\r\n\"\"\"\r\n\r\nimport math \r\n\r\n\r\na = input()\r\nn = int(a)\r\n\r\ndelta = 1 +4*n*2\r\nsol = int((-1 + math.sqrt(delta))/2)\r\nif ((-1 + math.sqrt(delta))/2 == sol):\r\n print(int(sol))\r\nelse : \r\n res = n - (sol+1)*sol/2\r\n print(int(res))", "n = int(input())\nd = (-7 + 8 * n)\nx = int((d ** 0.5 - 1) / 2)\nprint(n - x * (x + 1) // 2)", "n = int(input())\nx = 1\n\n\nwhile x < n:\n\n n -= x\n x += 1\n\nprint(n)\n\n \t\t\t \t\t\t \t\t \t\t \t\t \t \t", "n=int(input())\r\nfor i in range(1,100000000):\r\n ss=(i*(i+1))//2\r\n if ss>=n:\r\n break\r\nif ss==n:\r\n print(i)\r\nelse:\r\n diff= ss-n\r\n print(i-diff)", "n = int(input()) \r\nk = 1 \r\nwhile n>k : \r\n n -= k \r\n k += 1\r\nprint(n)", "import math\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n factor = int(math.sqrt(2 * n))\r\n if 2 * n <= factor * (factor + 1):\r\n factor -= 1\r\n print(n - factor * (factor + 1) // 2)\r\n", "import math\r\nn = eval(input())\r\n#(i + 1) * i // 2 <= n\r\n#i * i + i + 0.25 <= n * 2 + 0.25\r\n#(i + 0.5) * (i + 0.5) <= n * 2 + 0.25\r\n#i + 0.5 <= sqrt(n * 2 + 0.25)\r\n#i <= sqrt(n * 2 + 0.25) - 0.5\r\ntot = int(math.sqrt(n * 2 + 0.25) - 0.5)\r\nif tot * (tot + 1) // 2 == n:\r\n tot -= 1\r\nn -= (tot + 1) * tot // 2\r\nprint(n)\r\n\t", "n = int(input())\nlo,hi,k = 0,10**9,0\nn -= 1\nwhile lo < hi:\n k = (lo+hi+1)//2\n if k*(k+1)//2 <= n:\n lo = k\n else:\n hi = k-1\nk = lo\n# print(k,k*(k+1)//2,n)\nn -= k*(k+1)//2\nprint(n+1)\n", "n = int(input())\r\nx = 1\r\nwhile n > x:\r\n n -= x\r\n x += 1\r\nprint(n)", "from math import sqrt, ceil\r\n\r\nn = int(input())\r\n\r\nk = ceil((sqrt(1 + 8 * n) - 3) / 2)\r\n\r\nprint(n - ((k + 1) * k) // 2)\r\n", "from math import floor\r\nn=int(input())\r\nr=floor((-1+(1+4*2*n)**(0.5))/2)\r\ns=r*(r+1)//2\r\nif(n==s):\r\n print(r)\r\nelse:\r\n print(n-s)", "n=int(input())\r\nf=lambda x:(x+1)*x//2\r\nprint(n-f(int(((8*n-7)**.5-1)/2)))", "n = int(input())\r\n\r\nx = int((((1 + (8 * n)) ** 0.5) - 1) / 2)\r\n\r\ny = (x * (x + 1)) // 2\r\n\r\nif y == n:\r\n\tprint(x)\r\nelse:\r\n\tprint(n - y)", "def check(x):\n return x * (x + 1) // 2 < n\n\n\nn = int(input())\nl = 0\nr = n\nans = 0\nwhile l < r:\n mid = l + r + 1 >> 1\n if check(mid):\n ans = mid\n l = mid\n else:\n r = mid - 1\n\nprint(n - ans * (ans + 1) // 2)\n \t\t\t \t \t \t\t\t\t\t \t \t \t \t \t\t", "n = int(input())\r\nt = int((2*n + 0.25)**0.5 - 0.5)\r\ntr = t * (t + 1) // 2\r\nif tr == n:\r\n print(t)\r\nelse:\r\n print(n-tr)", "import math\r\nn = int(input())\r\na = math.sqrt(n * 2 + 0.25) - 0.5\r\nif int(a) == a:\r\n a = int(a) - 1\r\nelse:\r\n a = int(a)\r\nprint(n - a * (a + 1) // 2)", "n = int(input()) - 1\r\n\r\nL = 0\r\nR = n + 1\r\nwhile (L + 1 != R):\r\n M = (L + R) // 2\r\n if (M * (M + 1) // 2 <= n):\r\n L = M\r\n else:\r\n R = M\r\nn -= L * (L + 1) // 2\r\nprint(n + 1)\r\n\r\n", "from math import sqrt\r\nn=int(input())\r\nk=int((sqrt(1+8*n)-1)/2)\r\nx=int(n-k*(k+1)/2)\r\nif x==0:\r\n print(k)\r\nelse:\r\n print(x)\r\n", "def sq(n):\r\n \r\n c = int((n * 2) ** (1 / 2))\r\n \r\n if c * (c + 1) // 2 <= n:\r\n return int(c)\r\n \r\n elif (c - 1) * (c) // 2 <= n:\r\n return int(c) - 1\r\n \r\n else:\r\n return int(c) - 2\r\n \r\n\r\nN = int(input())\r\n\r\nc = sq(N)\r\nN -= c * (c + 1) // 2\r\n\r\nif N == 0:\r\n print(c)\r\nelse:\r\n print(N)", "import math\r\ndef infinite2(n):\r\n x=(-1+math.sqrt(1+8*n))//2\r\n v=n-int(x*(x+1)/2)\r\n if v==0:\r\n return(int(x))\r\n else:\r\n return(int(v))\r\n return()\r\nn=int(input())\r\nprint(infinite2(n))", "n = int(input())\r\nL = 0\r\nR = n//2\r\ncut = 0\r\nwhile L <= R:\r\n mid = L + (R-L)//2\r\n if (mid*(mid+1))//2 < n:\r\n cut = (mid*(mid+1))//2\r\n L = mid+1\r\n else: R = mid-1\r\nprint(n-cut)", "n = int(input())\r\nx = int(((8 * n - 7) ** 0.5 - 1) / 2)\r\nprint(n - (x * (x + 1)) // 2)", "n = int(input())\r\ni = 1\r\nwhile (i*(i+1)//2)<n:\r\n i+=1\r\ni-=1\r\nif n==(i*(i+1)//2):\r\n print(i)\r\nelse:\r\n print(n-(i*(i+1)//2))", "a=int(input())\ndef f(n):\n return (n+1)*n//2\ndef check(x):\n if(f(x)>=a):\n return True\n else:\n return False\n\nl=1\nr=2e7\nwhile(l<r):\n mid=(int)(l+r)//2\n if(check(mid)):\n r=mid\n else:\n l=mid+1\n\nprint(a-f(l-1))\n \t \t\t\t \t \t \t\t\t \t\t\t \t\t \t\t\t\t", "import math\ndef findNumber( n ):\n\t\n\tx = int(math.floor((-1 + math.sqrt(1+ 8 * n - 8)) / 2))\n\tbase = (x * (x + 1)) / 2 + 1\n\tbase=int(base)\n\treturn n - base + 1\n\nn = input()\nn=int(n)\nprint(findNumber(n))\n\n \t \t \t \t \t \t \t\t \t \t \t\t\t \t", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\nimport math\r\n\r\ndef solve(n):\r\n dom = -1\r\n\r\n for a in range(1, n):\r\n if a * (a + 1) // 2 >= n:\r\n dom = a - 1\r\n break\r\n\r\n if n == 2:\r\n print(1)\r\n else:\r\n print(n - dom * (dom + 1) // 2)\r\n\r\n# for t in range(1, 100):\r\n# solve(t)\r\n\r\nsolve(int(input()))\r\n", "n=int(input())\r\nk=int((2*n)**0.5)\r\nif k*(k+1)<2*n:\r\n print(n-k*(k+1)//2)\r\nelif k*(k+1)==2*n:\r\n print(k)\r\nelse:\r\n k-=1\r\n print(n-k*(k+1)//2)", "n = int(input())\ni=1\nwhile(n):\n if(i>=n):\n print(n)\n break\n else:\n n-=i\n i+=1\n \t\t \t \t\t \t\t\t\t\t \t\t", "n = int(input())\r\nans = (int((8*n+1)**0.5)-1)//2\r\n\r\nif((ans*(ans+1))//2==n):\r\n print(ans)\r\nelse:\r\n print(n-(ans*(ans+1))//2)", "import math\nn = int(input())\n# 1 positions\n# 0 1 3 6 10 15 21 28\n# 1 2 3 4 5 6 7\n# n = (block*(block+1))/2\nblock = (1/2)*(math.sqrt(8*n-1)-1)\nblock = math.floor(block)\nprint(n - (block*(block+1))//2)\n", "Pk = int(input())\r\n\r\nx = (((Pk*8 + 1)**0.5) - 1)/2\r\n\r\nif x % 1 == 0: print(int(x))\r\nelse:\r\n x = int(x) + 1\r\n print(int(x - (((x+1)*x/2) - Pk)))", "N, i = int(input()), 1\r\nwhile N > i:\r\n N, i = N - i, i + 1\r\nprint(N)", "a=int(input())\na-=1\ncount=1\nwhile a>=0:\n a -= count \n count +=1\nprint(a+count)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nn=int(input())\r\nf=lambda x:(x+1)*x//2\r\nprint(n-f(int(((8*n-7)**.5-1)/2)))", "import math\r\n\r\nn = int(input())\r\n\r\nsq = int(math.sqrt(n * 2))\r\nif n * 2 <= sq * (sq + 1):\r\n sq -= 1\r\n\r\nprint(n - sq * (sq + 1) // 2)", "from sys import stdin, stdout\nfrom math import sqrt, floor\n\nn = int(input())\n\nk=floor((1+sqrt(8*n+1))//2)\nif(k*(k-1)/2==n):\n\tk-=1\nprint(int(n-k*(k-1)/2))\n\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nn=int(input())\r\nimport math as m\r\np=m.sqrt(1+4*2*n)\r\nx=m.ceil((p-1)/2)\r\ny=(x*(x+1))//2\r\nprint(x-(y-n))", "n=int (input())\r\nk=int((-1+(8*n+1)**0.5)/2)\r\nsub=(k*(k+1))//2\r\nif n-sub==0:\r\n print (k)\r\nelse:\r\n print (n-sub)\r\n", "t=int(input())\nl=-1\nr=2*t\ndef cal(x):\n if (x*(x+1))/2>=t:return True\n else:return False\nwhile l+1!=r:\n mid=(l+r)//2\n if cal(mid):\n r=mid\n else:\n l=mid\nprint(int(t-l*(l+1)/2))\n\n\n\n\n\t \t\t\t\t\t \t\t \t \t \t\t \t\t", "from math import sqrt\n\ndef main():\n n = int(input())\n \n k = int((-1 + sqrt(1 + 4*2*n)) // 2)\n \n ans = n - k*(k+1)//2\n ans = ans if ans != 0 else k\n print(ans)\n\nif __name__ == \"__main__\":\n main()", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Jun 27 12:58:56 2020\n\n@author: shailesh\n\"\"\"\n\ndef find_n_value(pos):\n l = 1\n r = 10**14\n while r - 1 > l:\n \n mid = (l+r)//2\n# print(l,r,mid)\n num = mid*(mid+1)//2\n if num == pos:\n return mid\n if num > pos:\n r = mid\n else:\n l = mid\n return l\n\n\n\n\npos = int(input())\n\nif pos == 1:\n print(1)\nelse:\n pos = pos -1\n \n n = find_n_value(pos)\n \n print(1 + pos - n*(n+1)//2)\n ", "ka=int(input())\r\nx=1\r\nwhile(x<ka):\r\n ka=ka-x\r\n x=x+1\r\nprint(ka) ", "a=int(input())\r\nb=int((2*a)**.5)\r\nc=a-(b**2+b)//2\r\nif c==0:print(b)\r\nelse:print(c%b)", "import math\r\n\r\nn = input()\r\nn = int(n)\r\n\r\n# print(\"n =\", n)\r\n\r\nm = (-1+math.sqrt(1+8*n))/2\r\nm = math.floor(m)\r\n\r\n# print(\"m =\", m)\r\n\r\nn_min = int(m*(m+1)/2)\r\n\r\n# print(\"n_min =\", n_min)\r\n\r\nnum = n-n_min\r\n\r\nif num == 0:\r\n num = m\r\n\r\nprint(num)\r\n\r\n\r\n\r\n\r\n", "import math\r\nn = int(input())\r\nx = math.floor(((math.sqrt(8 * n + 1) - 1) / 2))\r\nn -= (x * (x+1)) // 2\r\nif n == 0:\r\n n = x\r\nprint(n)\r\n", "position = int(input())\nsequence_length = 1\niterator = 1\n\nwhile sequence_length < position:\n iterator += 1\n sequence_length += iterator\n\nprint(position + iterator - sequence_length)", "n = int(input())\r\nl = 0\r\nr = 10**9\r\nwhile r-l > 1:\r\n m = (l+r)//2\r\n tmp = m*(m+1)//2\r\n if tmp < n:\r\n l = m\r\n else:\r\n r = m\r\n\r\nn -= l*(l+1)//2\r\nprint(n)\r\n ", "import math\r\nn=int(input())\r\nx=int(math.floor((-1+math.sqrt(1+8*n-8))/2))\r\nbase=((x+1)*x/2) +1\r\nprint(int(n-base+1))\r\n", "k=int(input())\r\nz=(8*k+1)**0.5-1\r\nz=z/2\r\nif z%1!=0:\r\n z+=1\r\nz=int(z)\r\np=(z**2-z)//2\r\nk-=p\r\nprint(k)\r\n", "n = int(input())\r\nk = 1\r\nwhile (k*(k+1))//2 < n:\r\n k += 1\r\nif (k*(k+1))//2 == n:\r\n print(k)\r\nelse:\r\n print(k-((k*(k+1))//2-n))", "n=int(input())\r\nlb=0\r\nub=100000000\r\npos=-1\r\ndef cal(temp):\r\n p=temp*(temp+1)\r\n p=p//2\r\n return p\r\n\r\nwhile lb<=ub:\r\n mid=(lb+ub)//2\r\n #print(\"mid is \",mid)\r\n if cal(mid)<=n:\r\n pos=mid\r\n lb=mid+1\r\n else:\r\n ub=mid-1\r\n \r\n#print(\"pos is \",pos)\r\nans=n-cal(pos)\r\nif ans==0:\r\n print(pos)\r\nelse:\r\n print(ans)\r\n\r\n \r\n", "\nn = int(input())\n\na, b = 0, 10**14\n\nwhile a < b:\n c = (a + b + 1) // 2\n if c * (c + 1) // 2 >= n:\n b = c - 1\n else:\n a = c\n\nprint(n - (a * (a + 1) // 2))\n", "from math import ceil,sqrt\r\n\r\nn=int(input())\r\nw = ceil( ( sqrt(8*n+1) -1 )/2 )\r\nl_index = (w*(w+1))//2\r\nm_offset = l_index - w + 1\r\nprint( n - m_offset + 1 ) ", "from math import sqrt, floor\r\n\r\nn = int(input())\r\nm = floor((sqrt(8*n + 1) - 1)/2)\r\nn -= m*(m+1)//2\r\nif n == 0: n = m\r\nprint(n)", "import math\r\nn=int(input())\r\nx=int(math.floor((-1+math.sqrt(1+8*n-8))/2))\r\nb=(x*(x+1))/2+1\r\nprint(int(n-b+1))", "n=int(input())-1\r\nr=int((-1+(1+4*n*2)**0.5)/2)\r\nprint(n+1-(r*(r+1))//2)", "from math import sqrt\r\nn = int(input())\r\nt = (2*n+0.25)**0.5 - 0.5\r\nt = int(t//1)\r\nif(t*(t+1)//2 >= n): t-=1\r\nprint(n - t*(t+1)//2)\r\n", "num = int(input())\nline = 1\nsum1 = 1\ntemp = 1\nwhile sum1<num:\n line += 1\n temp = sum1\n sum1 +=line\nif num ==1:\n print(1)\nelse:\n print(num-temp)\n \t \t\t\t\t\t\t \t \t \t\t \t\t\t \t\t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = 0\r\na = 0\r\nfor i in range(1, n+1):\r\n s += i\r\n if s >= n:\r\n break\r\n a = s\r\nprint(n-a)\r\n", "a=int(input());s=0;l=a;i=0\r\nwhile s+i<a: \r\n s=s+i\r\n i=i+1\r\nprint(l-s)\r\n \r\n", "from math import sqrt\nn=int(input())\nans=0\ndelt=1+8*n\nsqr_delt=int(sqrt(delt))\nfor i in range(sqr_delt-4,sqr_delt+5):\n if i**2<delt:\n ans=i\n elif i**2==delt:\n print(int((ans-1)/2)+1)\n break\nelse:\n ans=int((ans-1)/2)\n print(int(n-ans*(ans+1)/2))\n \t\t\t\t \t\t \t \t\t \t \t\t\t\t \t", "\nn = int(input())\nt = n\nn = n * 2\nn = int(n ** 0.5)\nif n * (n + 1) >= t * 2:\n\tn -= 1\nt = int((t * 2 - n * (n + 1))/2)\nprint(t)\n\n# madraki bitch", "from math import sqrt\n\nn = int(input()) - 1\nr = int((-1 + sqrt(1 + 4 * n * 2)) / 2)\nprint(n + 1 - (r * (r + 1)) // 2)\n", "import math\nn = int(input())\nk = math.floor(((1 + 8*n) ** 0.5 - 1) / 2)\nans = n - k*(k+1)//2\nprint(ans if ans else k)\n", "from math import sqrt\n\n\ndef main():\n n = int(input())\n x = int(sqrt(n * 2. + .25) - .5)\n n -= x * (x + 1) // 2\n print(n if n else x)\n\n\nif __name__ == '__main__':\n main()\n", "from math import sqrt\r\nn = int(input())\r\nx = (-1+sqrt(1+8*n))/2\r\nv = (2+int(x)-1)/2*int(x)\r\nif (v==n): print(int(x))\r\nelse: print(int(n-v))", "a=int(input())\r\nd=1-(4*(-1)*a*2)\r\nr=(-1+d**(1/2))/2\r\np=int(r)\r\n\r\nn=(p*(p+1))/2\r\n\r\nif(a>n):\r\n ans=a-n\r\nelif(a<n):\r\n g=a-n\r\n ans=p-g\r\nelif(a==n):\r\n ans=p \r\nprint(int(ans)) ", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline().strip())\r\n\r\n\r\n# Trying to find x such that x(x + 1)/2 is as close to n as possible without going over.\r\n# This is because the first sequence is length 1, second is length 2, etc. If we can\r\n# figure out how many sequences have already passed, we can easily determine the value\r\n# of the nth element.\r\ndef main(n):\r\n x = (-1 + math.sqrt(1 + 8 * n)) / 2\r\n if x % 1 == 0: # If x(x+1)/2 exactly equals n, then we want to subtract 1 from x. That way, we can figure out how long this sequence was.\r\n # If we didn't do this, result would reset back to 0.\r\n x -= 1\r\n else:\r\n x = math.floor(x)\r\n result = int(n - ((x * (x + 1)) / 2))\r\n print(result)\r\n\r\nmain(n)", "import math\r\nn = int(input())\r\n\r\nd = math.floor(math.sqrt(1+(8*n)))\r\nd = ((d-1)//2)\r\ns = ((d*(d+1))//2)\r\n\r\nif s==n:\r\n print(d)\r\nelse:\r\n print(n-s)", "n = int(input())\r\n\r\ndef uniq_val(p):\r\n return int((1/2)*(p*p) + (1/2)*(p))\r\n\r\nfor i in range(1,n+1):\r\n val = uniq_val(i)\r\n if val == n:\r\n el = i\r\n print(el)\r\n break\r\n elif val - n > 0:\r\n max = i\r\n diff = uniq_val(i) - n\r\n el = max - diff\r\n print(el)\r\n break\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(n):\r\n tmp = 0\r\n for i in range(1, n + 1):\r\n tmp += i\r\n if tmp >= n:\r\n tmp -= i\r\n return n - tmp\r\n return None\r\n\r\ndef main():\r\n n = int(input())\r\n ans = solve(n)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import*\r\nn=int(input())\r\nwiin=int(sqrt(2*n)-0.5)\r\nans=int(n-(wiin*(1+wiin)/2))\r\nprint(ans)", "\r\nfrom math import sqrt\r\nn = int(input())\r\n\r\nd = (sqrt(1 + 8 * n) - 1) // 2\r\nif (d * (d + 1)) // 2 == n:\r\n\tprint(int(d))\r\nelse:\r\n\r\n\tprint(int(n - (d * (d + 1)) // 2))", "from math import sqrt\r\nt = int(input())\r\n\r\nn = -(-(-1+sqrt(1+8*t))//2)\r\n\r\nif t==1:\r\n\tprint(t)\r\nelse:\r\n\r\n\tprint(int((n-(n*(n+1))//2)%t))\r\n", "a = int(input())\r\nq = 1\r\nwhile a > q:\r\n a -= q\r\n q += 1\r\nprint(a)", "from math import sqrt\r\n\r\n__author__ = \"runekri3\"\r\n\r\nfind_position = int(input())\r\n\r\nfind_position -= 1\r\nlast_sequence_max_num = int((-1 + sqrt(1 + 8 * find_position)) / 2) + 1\r\nstart_pos = last_sequence_max_num * (last_sequence_max_num + 1) // 2 - 1\r\nprint(find_position - start_pos + last_sequence_max_num)\r\n", "def solve(p):\r\n tmp=1\r\n while p>tmp:\r\n p-=tmp\r\n tmp+=1\r\n return p\r\n\r\n\r\np=int(input())\r\nprint(solve(p))\r\n", "from cmd import IDENTCHARS\r\n\r\n\r\nn = int(input())\r\nl = 1\r\nr = n\r\nwhile (l < r):\r\n mid = l + (r- l) // 2\r\n idxcnt = mid * (mid + 1) / 2\r\n if (idxcnt < n):\r\n l = mid + 1\r\n else:\r\n r = mid\r\nl -= 1\r\nidxcnt = l * (l + 1) / 2\r\nprint(int(n - idxcnt))", "n=int(input())\r\n\r\nlo=0\r\nhi=int(1e14)\r\n\r\nmx=0\r\nwhile lo<=hi:\r\n mid=(lo+hi)//2\r\n\r\n if n-(mid*(mid+1))//2>0:\r\n mx=max(mx,mid)\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\n\r\nprint(n-(mx*(mx+1))//2)", "def solve(n):\r\n i = 1\r\n while n > 0:\r\n n -= i\r\n i += 1\r\n return n + i - 1\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n print(solve(n))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\n\r\nn=int(input())\r\n\r\nx=-0.5+math.sqrt((0.25+2*n))\r\n\r\nif int(x)==x:\r\n x=int(x)-1\r\nelse:\r\n x=int(x)\r\n\r\ni=int(x*(x+1)/2)\r\n\r\nprint(n-i)\r\n", "#!/usr/bin/python\n\nimport math\n\nn = int(input())\ny = -1/2 + math.sqrt(1/4 + 2*n)\nif int(y) == y:\n x = y\nelse:\n y = math.floor(y)\n x = n - (y + y**2)/2\nprint(int(x))\n", "n = int(input())\r\n\r\ni = 1\r\nk = 0\r\n\r\nj = 1\r\nwhile(k<n):\r\n k = ( i*i + i )/2\r\n \r\n i = i + 1\r\ni = i -1\r\nl = k \r\nwhile(l != n):\r\n l = l - 1\r\n i = i - 1\r\n \r\n\r\nprint(i)", "import math\r\nl=eval(input())\r\nx=l\r\nx*=-2\r\nd1=(-1+((1-4*(x))**.5))/2\r\nd2=(-1-((1-4*(x))**.5))/2\r\nif(d1>d2):\r\n ans=int(math.ceil(d1))\r\nelse:\r\n ans=int(math.ceil(d2))\r\nans-=1\r\nf=ans*(ans+1)/2\r\nprint(int(l-f))\r\n", "import math\nn=int(input())\nj=-0.5+math.sqrt(1+4*2*n)/2\na=int(j)\nif a==j:\n print(a)\nelse:\n res=(1+a)*a/2\n print(int(n-res))\n\n \t \t \t\t \t\t \t\t\t \t \t \t \t\t \t\t", "from math import sqrt,floor\r\nn=int(input())\r\nk=floor((1+sqrt(8*n+1))//2)\r\nif(k*(k-1)/2==n):\r\n\tk-=1\r\nprint(int(n-k*(k-1)/2))", "import sys\r\nreadline=sys.stdin.readline\r\nwrite=sys.stdout.write\r\n\r\nN=int(readline())\r\nn=1\r\nwhile n<N:\r\n N-=n\r\n n+=1\r\nprint(N)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = int(input())\r\n\r\nfor i in range(1, 10**8):\r\n if i < n:\r\n n -= i\r\n else:\r\n print(n)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin\r\nn = int(stdin.readline())\r\nx = 1\r\nn -= 1\r\nwhile x <= n:\r\n n -= x\r\n x += 1\r\nprint(n+1)", "x = int(input())\ncounter = 1\n\nwhile counter < x:\n x -= counter\n counter += 1\nprint(x)", "from math import ceil\r\nf = lambda a : (-1+(1+8*a)**0.5)/2\r\nt = lambda a : a*(a-1)/2\r\nn = int(input())\r\nprint(n-int(t(ceil(f(n)))))\r\n\r\n\r\n", "s = lambda x: x * ( x + 1 ) // 2\n\nn = int( input() )\nlo, hi = 0, 10 ** 10\nwhile lo != hi:\n mid = ( lo + hi + 1) // 2\n if s(mid) < n: lo = mid\n else: hi = mid - 1\n# while s(lo + 1) < n: lo += 1\nprint(n - s(lo))\n", "import math\r\n\r\nn = int(input())\r\n\r\ni = 0\r\nk = 1\r\n\r\nk = math.ceil((-1 + math.sqrt(1 + 8*n)) / 2) - 1\r\ni = k * (k + 1) / 2\r\n \r\nprint(int(n - i))", "N = int(input())\r\n\r\nlo = 0\r\nhi = 10**18\r\n\r\nwhile hi - lo > 1:\r\n mid = (hi + lo) // 2\r\n if mid * (mid + 1) // 2 < N:\r\n lo = mid\r\n else:\r\n hi = mid\r\n \r\nprint(N - lo * (lo + 1) // 2)", "from math import sqrt, floor\n\nn = int(input())\n# (1 + x)*x/2 = n\n# x^2 + x - 2n = 0\n# D = 1 + 8n\n# x = (-1 + sqrt(D))/2\nx = floor((sqrt(1 + 8*n) - 1)/2)\nres = n - ((1 + x) * x) // 2\nres = res or x\nprint(res)\n", "import sys\r\nimport math\r\nn = int(input())\r\n\r\nk = int(0.5*(math.sqrt(8*n+1) -1))\r\n\r\nif n == k*(k+1)/2:\r\n print(k)\r\nelse:\r\n print(int(n - k*(k+1)/2))\r\n\r\n\r\n", "from math import floor,sqrt\r\nn=int(input())\r\nm=floor((sqrt(8*n+1)-1)/2)\r\nif n==m*(m+1)/2:\r\n print(m)\r\nelse:\r\n print(int(n-m*(m+1)/2))\r\n", "n = int(input())\r\n\r\nfor i in range(1, 10 ** 8):\r\n if n - i > 0:\r\n n -= i\r\n else:\r\n break\r\n\r\nprint(n)", "n = int(input())\r\n\r\nstart = 0\r\nend = 10**8\r\nwhile (end - start > 1):\r\n mid = (end + start) // 2\r\n if ((mid * (mid + 1)) // 2 < n):\r\n start = mid\r\n else:\r\n end = mid\r\nn -= (start * (start + 1)) // 2\r\nprint(n)\r\n", "n=int(input())\r\nk=int(pow(2*n,1/2))\r\nt=n-int(k*(k+1)/2)\r\nif t>0:\r\n print(t)\r\nelse:\r\n print(k+t)\r\n\r\n", "n = int(input())\r\ni = 1\r\nwhile True:\r\n if n > i:\r\n n -= i\r\n else:\r\n print(n)\r\n break\r\n i += 1", "n = int(input())\r\nok, ng = 0, 10**9\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) >> 1\r\n if (mid * (mid+1)) >> 1 < n:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nprint(n - ((ok * (ok + 1)) >> 1))\r\n", "import math\r\nn=int(input())\r\nx=(-1+ math.sqrt(1+8*n))//2\r\ny=x*(x+1)//2\r\nif n-y==0:\r\n print(int(x))\r\nelse:\r\n print(int(n-y))\r\n\r\n\r\n", "count = 0\r\n\r\nn = int(input())\r\nwhile n > 0:\r\n count += 1\r\n n -= count\r\nprint(count+n)", "n = int(input())\r\n\r\nsum_just_before = 0\r\nk = 1\r\n\r\nwhile True:\r\n\tif sum_just_before < n:\r\n\t\tsum_just_before += k\r\n\t\tk += 1\r\n\telif sum_just_before == n:\r\n\t\tbreak\r\n\telse:\r\n\t\tsum_just_before -= (k-1)\r\n\t\tbreak\r\n\r\ndiff = abs(n - sum_just_before)\r\n\r\nif sum_just_before == n:\r\n\tprint(k-1)\r\nelse:\r\n\tprint(diff)", "n=int (input())\r\nx=int((-1+(8*n+1)**0.5)/2)\r\nsub=(x*(x+1))//2\r\nif n-sub==0:\r\n print (x)\r\nelse:\r\n print (n-sub)", "import math\nn = int(input())\ne = (-1 + int(math.sqrt(1+8*n)))//2\nz = e*(e+1)//2\nr = n - z\nif(r==0):\n\tprint(e)\nelse:\n\tprint(r)\n\n\n\n", "n=int(input())\r\nl=1\r\nr=10**9\r\nwhile l<r:\r\n\tm=(l+r)//2\r\n\tif (m+1)*m//2<n:l=m+1\r\n\telse:r=m\r\nprint(n-l*(l-1)//2)", "import sys\n\nn = int(input())\n\nn -= 1\nfor i in range(1,n+1):\n\tif n - i < 0:\n\t\tbreak\n\tn -= i\n\nprint(n+1)\n", "number = int(input())\r\nn = int((1+(1+8*(number-1))**(1/2))/2)\r\nprint(number - n*(n-1)//2)", "n = int(input())\r\n\r\nfor i in range(1, 10**8):\r\n if n < i + 1:\r\n print(n)\r\n exit()\r\n n -= i\r\n", "import sys\r\nimport math\r\n\r\ndef get_int():\r\n\treturn int(sys.stdin.readline())\r\n\r\ndef get_string():\r\n\treturn sys.stdin.readline().strip()\r\n\r\nFILE=False\r\nif FILE:\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\ntarget=get_int()\r\nn_up=math.ceil(-0.5+0.5*math.sqrt(1+8*target))\r\nn_down=n_up-1\r\npos_up=math.floor(n_up*(n_up+1)/2)\r\npos_down=math.floor(n_down*(n_down+1)/2)\r\nanswer=str(target-pos_down)\r\nsys.stdout.write(answer) \r\n \r\n\r\n\r\n#for item in answer:\r\n#\tsys.stdout.write(item)\r\n#\tsys.stdout.write('\\n')", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nn=int(input())\r\ni=1\r\nc=0\r\nwhile n>0:\r\n\tn-=i\r\n\tc+=1\r\n\ti+=1\r\nprint(n+c)", "from math import *\r\nn=int(input())\r\nk=int((sqrt(1+8*n)-1)/2)\r\nj=int(k*(k+1)/2)\r\nif (j==n) :print(k)\r\nelse : print(n-j)", "n=int(input())\r\ncount=1\r\nwhile(count<n):\r\n n-=count\r\n count+=1\r\nprint(n)\r\n", "import math\r\n\r\nn = int(input())\r\n\r\nm = 0\r\n\r\nwhile m*(m+1) // 2 <= n:\r\n m += 1\r\n \r\nm -= 1\r\n\r\nif m*(m+1) == 2 *n:\r\n print(m)\r\nelse:\r\n print(n - m*(m+1)//2)", "import math\r\nn=int(input())\r\nk=math.floor((1+math.sqrt(1+8*n))/2)\r\nif n==int(k*(k-1)/2):\r\n print(k-1)\r\nelse:\r\n print(int(n-(k*(k-1)/2)))", "from math import ceil,sqrt\r\na=int(input())\r\nb=ceil(sqrt(a*2+.25)-.5)-1\r\nprint(a-b*(b+1)//2)\r\n", "from math import ceil \r\nx = int(input())\r\nt = (-1 + (1+8*x)**(1/2))/2\r\nif ceil(t) > t:\r\n\tr = int(t)\r\n\tprint(x-int(r*(r+1)//2))\r\nelse:\r\n\tprint(int(t))", "n=int(input())\r\nk=int((-1+(1+8*n)**0.5)/2)\r\nm=k*(k+1)//2\r\nprint([n-m,k][n==m])", "n=int(input())\r\nx=1\r\ns=1\r\nwhile (x*(x+1))//2 < n:\r\n x+=1\r\n \r\na= n- (x*(x+1))//2\r\nprint(x if a%x==0 else a%x)", "# x*(x+1)/2=n x^2+x-2*n=0\r\nn = int(input())\r\nval = (-1+pow(1+8*n,0.5))/2\r\nif not int(str(val).split('.')[1]):\r\n print(int(val))\r\nelse:\r\n val = int(val)\r\n cnt = n-(val*(val+1))//2\r\n print(cnt)\r\n", "n = int(input())\r\n\r\nnow = 1\r\nwhile now < n:\r\n n -= now\r\n now += 1\r\n\r\nprint(n);\r\n", "from math import sqrt\r\n \r\np = int(input())\r\nd = int(sqrt(1 + 8 * (p-1)))\r\nval = int((d - 1) / 2)\r\nans = (val * (val + 1)) // 2\r\nprint(p - ans)", "n = int(input())\r\nl = 1\r\nr = 10**9\r\nwhile l<r:\r\n mid = (l+r)>>1\r\n if (1+mid)*mid//2>=n:\r\n r = mid\r\n else:\r\n l = mid+1\r\n\r\nl-=1\r\nprint(n- (1+l)*l//2)", "import math\nn = eval(input())\n#(i + 1) * i // 2 <= n\n#i * i + i + 0.25 <= n * 2 + 0.25\n#(i + 0.5) * (i + 0.5) <= n * 2 + 0.25\n#i + 0.5 <= sqrt(n * 2 + 0.25)\n#i <= sqrt(n * 2 + 0.25) - 0.5\ntot = int(math.sqrt(n * 2 + 0.25) - 0.5)\nif tot * (tot + 1) // 2 == n:\n tot -= 1\nn -= (tot + 1) * tot // 2\nprint(n)\n \t\t\t \t\t\t\t\t \t \t\t \t \t \t \t\t\t\t", "a=int(input())\r\nb=1\r\nwhile a>b:\r\n\t\ta-=b\r\n\t\tb+=1\r\nprint(a)", "N, i = int(input()), 1\r\nwhile N > i:\r\n N, i = N - i, i + 1\r\nprint(N)\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: Again being chased by essi\r\n# CodeNumber: 626\r\n", "n=int(input())\r\nk=int((-1+(8*n+1)**0.5)/2)\r\ns=k*(k+1)//2\r\nif(n-s==0):\r\n print(k) \r\nelse:\r\n print(n-s)", "n=int(input())\r\nk=1\r\nwhile(n>k):\r\n n-=k\r\n k+=1\r\nprint(n)\r\n \r\n", "n = int(input())\nx = int((n*2)**0.5)\nif (x*(x+1)//2 >= n):\n x -= 1\nn = n - (x*(x+1)//2)\nprint(n)\n", "#!/usr/bin/env python3\n\n\ndef main(args):\n n = int(input())\n current = 1\n prev = 0\n while n > current + prev:\n prev += current\n current += 1\n print(n-prev)\n\nif __name__ == '__main__':\n import sys\n sys.exit(main(sys.argv))\n", "from collections import deque\r\nfrom math import log,sqrt,ceil\r\ndef ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().strip().split(\" \"))\r\ndef li(): return list(mi())\r\nn=ii()\r\nn1=2*n*4+1\r\nx=ceil((sqrt(n1)-1.0)/2)\r\nx-=1\r\ns=x*(x+1)//2\r\nn-=s\r\nprint(n)", "import math\r\na=int(input())\r\nn=int((-1+math.sqrt(1+8*a))/2)\r\nif a-(n*(n+1)//2)==0:\r\n print(n)\r\nelse:\r\n print(a-(n*(n+1)//2))", "import math\r\n\r\nn = int(input())\r\nm = int(math.sqrt(2 * n + 0.25) - 0.5)\r\nif n - m*(m+1)//2 == 0:\r\n print(m)\r\nelse:\r\n print(n - m*(m+1)//2)\r\n", "\nn = int(input())\n\ntemp = 0\nstart = int((n*2)**0.5)-1\ntemp = (start*(start-1))//2\nfor i in range(start,n):\n \n if temp + i >= n:\n break\n temp += i\n\nprint(n-temp)\n\t\t\t \t \t \t\t\t\t\t\t\t\t\t \t\t\t\t \t \t\t\t", "n=int(input())\r\nx=1\r\nwhile n>x:\r\n\tn-=x\r\n\tx+=1\r\nprint(n)", "x=int(input())\r\nlo = 0\r\nhi = 1000000000\r\nwhile lo < hi:\r\n mid = (lo + hi + 1) // 2\r\n if mid * (mid+1) // 2 >= x:\r\n hi = mid - 1\r\n else:\r\n lo = mid\r\n\r\nprint(x - lo*(lo+1)//2)", "n=int(input())\r\nk = 1\r\nwhile n > k:\r\n\tn -= k\r\n\tk += 1\r\nprint(n)", "n=int(input())\r\ndef check(x):\r\n if x*(x+1)//2>=n:\r\n return True\r\n return False\r\nl=-1\r\nr=n+1\r\nwhile l+1!=r:\r\n mid=(l+r)//2\r\n if check(mid):\r\n r=mid\r\n else:\r\n l=mid\r\nprint(n-(l+1)*l//2)\r\n", "import math\r\n \r\ndef solve():\r\n n=int(input())\r\n k=0\r\n crux=math.sqrt(2*n-2+0.25)-0.5\r\n beta=math.floor(crux)\r\n zeta=beta*(beta+1)//2\r\n print(n-zeta)\r\n \r\n\r\n\r\nsolve() \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nimport re\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\nfrom functools import cmp_to_key\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n\r\n\"\"\"\r\n1 1 2 1 2 3\r\n\"\"\"\r\ndef bsearch(x):\r\n l = 0\r\n r = x\r\n ans = 0 \r\n while l <= r:\r\n m = l + (r-l)//2\r\n m2 = m*(m+1)\r\n if m2 <= x:\r\n ans = max(ans, m)\r\n l = m+1\r\n else:\r\n r = m-1\r\n return ans\r\n\r\ndef solve():\r\n n = II() \r\n cycle = bsearch(n*2)\r\n skip = cycle*(cycle+1)//2\r\n rem = n - skip\r\n if rem == 0:\r\n print(cycle)\r\n else:\r\n print(n - skip)\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()\r\n", "import math\r\nn = int(input())\r\ncut = n+n\r\ncut = int(math.sqrt(cut))\r\n#print(cut)\r\nif (cut*(cut+1))//2 >= n:\r\n cut = (cut*(cut-1))//2\r\nelse:\r\n cut = (cut*(cut+1))//2\r\nprint(n-cut)", "n = int(input())\r\npos = 0\r\nnumber = 1\r\nwhile pos<n:\r\n pos = pos + number\r\n number = number +1\r\nprint(n -(pos- number)-1)", "import math\r\ndef pos(n):\r\n\tk = math.floor(math.sqrt(2*n + 1/4) - 1 / 2)\r\n\tif k*(k + 1) // 2 == n:\r\n\t\treturn k\r\n\telse:\r\n\t\treturn n - (k*(k + 1) // 2)\r\n\r\n\r\n\r\nn = int(input())\r\nprint(pos(n))", "n = int(input())\r\ns = 1\r\nwhile True:\r\n\tif s>=n:\r\n\t\tbreak\r\n\telse:\r\n\t\tn = n - s\r\n\t\ts+=1\r\nprint(n)", "import math\r\nn = int(input())\r\n\r\nx= math.floor((math.sqrt(1+8*n)-1)/2)\r\n\r\nd = int((x*(x+1))/2)\r\nif n ==d:\r\n print(x)\r\nelse:\r\n print(n-d)", "n=int(input())\r\nval=int(((1+8*n)**0.5 -1)//2)\r\nget=val*(val+1)//2\r\nval1=int(((1+8*get)**0.5 -1)//2)\r\nif n==get:\r\n\tprint(val)\r\nelse:\r\n\tprint(n-get)", "import math\r\nn = int(input())\r\nk = int((-1+math.sqrt(1+4*2*n))/2)\r\nif (k*(k+1))//2 !=n:\r\n l = n-(k*(k+1))//2\r\n print(l)\r\nelse:\r\n print(k)", "import math\r\n\r\nn = int(input())\r\n\r\n# Find the largest row that contains the target number\r\nrow = int(math.sqrt(2*n))\r\n\r\nwhile (row*(row+1)//2 > n):\r\n row -= 1\r\n\r\n# Calculate the position of the target number within the row\r\npos = n - row*(row+1)//2\r\n\r\n# Output the corresponding number\r\nif pos == 0:\r\n print(row)\r\nelse:\r\n print(pos)\r\n", "import math\r\n\r\ndef f(n):\r\n m = int(math.sqrt(n<<1))\r\n b = ((m+1)//2)*m if m%2==1 else (m//2)*(m+1)\r\n s = ((m-1)//2)*m if m%2==1 else (m//2)*(m-1)\r\n if n==b:\r\n return m\r\n if n>b:\r\n return n-b\r\n if n==s:\r\n return m-1\r\n if n>s:\r\n return n-s\r\n\r\nn = int(input())\r\nprint(f(n))\r\n", "#!/usr/bin/env python\r\n\r\ndef bsearch(n, fun, start, end):\r\n mid = start + (end - start) // 2\r\n fmid = fun(mid)\r\n\r\n if end - start > 1:\r\n if n < fmid:\r\n return bsearch(n, fun, start, mid)\r\n elif n > fmid:\r\n return bsearch(n, fun, mid, end)\r\n else:\r\n return mid\r\n else:\r\n return end if fun(end) <= n else start\r\n \r\ndef main():\r\n n = int(input())\r\n\r\n ncr = lambda x: (x * (x + 1)) // 2\r\n res = bsearch(n, ncr, 1, int(10**14))\r\n\r\n if ncr(res) == n:\r\n print(res)\r\n else:\r\n print(n - ncr(res))\r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nm = ((-1+(1+8*n-1)**.5)//2)\r\nprint(int(n-(m*(m+1))//2))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 29 14:02:31 2018\r\n\r\n@author: Dell\r\n\"\"\"\r\nn= int(input())\r\nk=int ((-1+(8*n+1)**0.5)/2)\r\nsom=k*(k+1)//2\r\nif n-som==0:\r\n print(k)\r\nelse:\r\n print(n-som)" ]

[ "import sys\ninput = sys.stdin.readline\nn, k = map(int, input().split())\na = [int(i) for i in input().split()]\ng = [[] for _ in range(n)]\nfor i in range(n - 1):\n\tu, v = map(int, input().split())\n\tg[u-1].append(v-1)\n\tg[v-1].append(u-1)\n\nstack = [0]\ndone = [False] * n\npar = [0] * n\norder = []\nwhile len(stack) > 0:\n\tx = stack.pop()\n\tdone[x] = True\n\torder.append(x)\n\tfor i in g[x]:\n\t\tif done[i] == False:\n\t\t\tpar[i] = x\n\t\t\tstack.append(i)\norder = order[::-1]\nsub = [0] * n\nfor i in order: \n\tsub[i] = 1\n\tfor j in g[i]:\n\t\tif par[j] == i:\n\t\t\tsub[i] += sub[j]\n\ndef good(guess):\n\tcnt = [0] * n\n\tfor i in order:\n\t\tif a[i] < guess:\n\t\t\tcontinue\n\t\tcnt[i] = 1\n\t\topt = 0\n\t\tfor j in g[i]:\n\t\t\tif par[j] == i:\n\t\t\t\tif cnt[j] == sub[j]:\n\t\t\t\t\tcnt[i] += cnt[j]\n\t\t\t\telse:\n\t\t\t\t\topt = max(opt, cnt[j])\n\t\tcnt[i] += opt\n\tif cnt[0] >= k:\n\t\treturn True\n\tup = [0] * n\n\tfor i in order[::-1]:\n\t\tif a[i] < guess:\n\t\t\tcontinue\n\t\topt, secondOpt = 0, 0\n\t\ttotal = 1\n\t\tfor j in g[i]:\n\t\t\tval, size = 0, 0\n\t\t\tif par[j] == i:\n\t\t\t\tval = cnt[j]\n\t\t\t\tsize = sub[j]\n\t\t\telse:\n\t\t\t\tval = up[i]\n\t\t\t\tsize = n - sub[i]\n\t\t\tif val == size:\n\t\t\t\ttotal += val\n\t\t\telse:\n\t\t\t\tif opt < val:\n\t\t\t\t\topt, secondOpt = val, opt\n\t\t\t\telif secondOpt < val:\n\t\t\t\t\tsecondOpt = val\n\n\t\tfor j in g[i]:\n\t\t\tif par[j] == i:\n\t\t\t\tup[j] = total\n\t\t\t\tadd = opt\n\t\t\t\tif sub[j] == cnt[j]:\n\t\t\t\t\tup[j] -= cnt[j]\n\t\t\t\telif cnt[j] == opt:\n\t\t\t\t\tadd = secondOpt\n\t\t\t\tup[j] += add\n\tfor i in range(n):\n\t\tif a[i] < guess:\n\t\t\tcontinue\n\t\ttotal, opt = 1, 0\n\t\tfor j in g[i]:\n\t\t\tval, size = 0, 0\n\t\t\tif par[j] == i:\n\t\t\t\tval = cnt[j]\n\t\t\t\tsize = sub[j]\n\t\t\telse:\n\t\t\t\tval = up[i]\t\n\t\t\t\tsize = n - sub[i]\n\t\t\tif val == size:\n\t\t\t\ttotal += val\n\t\t\telse:\n\t\t\t\topt = max(opt, val)\n\t\tif total + opt >= k:\n\t\t\treturn True\t\t\t\n\treturn False\n\nl, r = 0, max(a)\nwhile l < r:\n\tmid = (l + r + 1) // 2\n\tif good(mid):\n\t\tl = mid\n\telse:\n\t\tr = mid - 1\nprint(l)\n \t\t\t \t \t \t\t \t \t \t \t \t" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef insert(x, la):\r\n j = 0\r\n for i in p:\r\n if x & i:\r\n if not G[j] >> 25:\r\n la += 1\r\n G[j] ^= la << 25\r\n j = la\r\n else:\r\n j = G[j] >> 25\r\n else:\r\n if not G[j] & 33554431:\r\n la += 1\r\n G[j] ^= la\r\n j = la\r\n else:\r\n j = G[j] & 33554431\r\n cnt[j] += 1\r\n return la\r\n\r\ndef xor_min(x, s):\r\n j, ans = s, 0\r\n for i in range(30 - len(st), -1, -1):\r\n if x & pow2[i]:\r\n if G[j] >> 25:\r\n j = G[j] >> 25\r\n else:\r\n ans ^= pow2[i]\r\n j = G[j] & 33554431\r\n else:\r\n if G[j] & 33554431:\r\n j = G[j] & 33554431\r\n else:\r\n ans ^= pow2[i]\r\n j = G[j] >> 25\r\n return ans\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na = list(set(a))\r\na.sort()\r\npow2 = [1]\r\nl = 30\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1])\r\np = pow2[::-1]\r\nn = len(a)\r\nG, cnt, la = [0] * 5000000, [0] * 5000000, 0\r\nfor i in a:\r\n la = insert(i, la)\r\nh = l\r\nl0 = [-1] * (la + 1)\r\nl0[0] = 0\r\nst = [0]\r\nans = 0\r\nwhile st:\r\n i = st[-1]\r\n j, k = G[i] & 33554431, G[i] >> 25\r\n if l0[j] == -1 and l0[k] == -1 and min(cnt[j], cnt[k]):\r\n l = l0[i]\r\n m = l + cnt[j]\r\n r = m + cnt[k]\r\n ans0 = pow2[30]\r\n if (m - l) * (r - m) <= 5000:\r\n for u in range(l, m):\r\n au = a[u]\r\n for v in range(m, r):\r\n ans0 = min(ans0, au ^ a[v])\r\n elif m - l <= r - m:\r\n for u in range(l, m):\r\n ans0 = min(ans0, xor_min(a[u], k))\r\n else:\r\n for u in range(m, r):\r\n ans0 = min(ans0, xor_min(a[u], j))\r\n ans0 |= pow2[h]\r\n ans += ans0\r\n if l0[j] == -1:\r\n if cnt[j] > 1:\r\n st.append(j)\r\n h -= 1\r\n l0[j] = l0[i]\r\n elif l0[k] == -1:\r\n if cnt[k] > 1:\r\n st.append(k)\r\n h -= 1\r\n l0[k] = l0[i] + cnt[j]\r\n else:\r\n st.pop()\r\n h += 1\r\nprint(ans)" ]

[ "n = int(input())\na = []\nfor i in range(n):\n a.append(int(input()))\na = sorted(a)\n#print(a)\nif n == 0:\n print('YES')\n print(1)\n print(1)\n print(3)\n print(3)\nelif n == 1:\n print('YES')\n print(a[0])\n print(3 * a[0])\n print(3 * a[0])\nelif n == 2:\n if a[0] * 3 >= a[1]:\n print('YES')\n print(a[0] * 3)\n print(a[0] * 4 - a[1])\n elif a[1] % 3 == 0 and a[1] // 3 <= a[0]:\n print('YES')\n print(a[1] // 3)\n print(a[1] + a[1] // 3 - a[0])\n elif (a[0] + a[1]) % 4 == 0 and (a[0] + a[1]) // 4 <= a[0]:\n print('YES')\n print((a[0] + a[1]) // 4)\n print(3 * ((a[0] + a[1]) // 4))\n else:\n print('NO')\nelif n == 3:\n if a[0] * 3 >= a[2] and 4 * a[0] == a[1] + a[2]:\n print('YES')\n print(a[0] * 3)\n elif a[2] % 3 == 0 and a[2] // 3 <= a[0] and a[2] + a[2] // 3 == a[0] + a[1]:\n print('YES')\n print(a[2] // 3)\n elif a[2] == a[0] * 3:\n print('YES')\n print(4 * a[0] - a[1])\n else:\n print('NO')\nelif n == 4:\n if a[3] == 3 * a[0] and a[0] + a[3] == a[1] + a[2]:\n print('YES')\n else:\n print('NO')", "n = int(input())\r\nt = [int(input()) for q in range(n)]\r\n \r\nfor i in range(1, 501):\r\n for j in range(i, 2 * i + 1):\r\n s = [i, j, 4 * i - j, 3 * i]\r\n for k in t:\r\n if k not in s: break\r\n s.remove(k)\r\n else:\r\n print('YES')\r\n for q in s: print(q)\r\n exit()\r\nprint('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef check1(a, b):\r\n return abs(a - b) < 1e-9\r\n\r\n\r\ndef check(ls ):\r\n if ls == sorted(ls) and check1(ls[-1] - ls[0], (ls[2]+ls[1])/2) and check1(ls[-1]- ls[0], sum(ls)/4):\r\n return 1\r\n return 0\r\n\r\ndef solve():\r\n n = int(input())\r\n ls = []\r\n for i in range(n):\r\n ls.append(int(input()))\r\n if n == 0 :\r\n print(\"YES\")\r\n print(1)\r\n print(2)\r\n print(2)\r\n print(3)\r\n elif n == 1 :\r\n print(\"YES\")\r\n print(ls[0]*2)\r\n print(ls[0]*2)\r\n print(ls[0]*3)\r\n elif n == 2 :\r\n ls.sort()\r\n lst = [\r\n [1,1,0,0],\r\n [1,0, 1,0],\r\n [1,0, 0,1],\r\n [0, 1, 1, 0],\r\n [0, 1, 0, 1],\r\n [0, 0, 1, 1],\r\n ]\r\n \r\n lss = [\r\n [ls[0],ls[1] ,(4*ls[0])-ls[1], ls[0]*3],\r\n [ls[0],(4*ls[0])-ls[1], ls[1],ls[0]*3], \r\n [ls[0],ls[0]*2,ls[0]*2, ls[1]],\r\n [(ls[0] + ls[1]) / 4, ls[0], ls[1], (ls[0] + ls[1]) / 4 * 3],\r\n [ls[1] / 3, ls[0], 4 * (ls[1] / 3) - ls[0], ls[1]],\r\n [ls[1] / 3, 4 * (ls[1] / 3) - ls[0], ls[0], ls[1]]\r\n ]\r\n \r\n j = 0\r\n for x in lss:\r\n if check(x):\r\n print(\"YES\")\r\n for i in range(4):\r\n if lst[j][i] == 0:\r\n print(int(x[i]))\r\n return\r\n j += 1\r\n \r\n print(\"NO\")\r\n elif n == 3:\r\n ls.sort()\r\n lst = [\r\n [1,1,1,0],\r\n [1,1,0 ,1],\r\n [1, 0, 1,1],\r\n [0, 1, 1, 1],\r\n ]\r\n \r\n lss = [\r\n [ls[0], ls[1], ls[2], ls[0] * 3],\r\n [ls[0], ls[1], (4 * ls[0]) - ls[1], ls[2]],\r\n [ls[0], (4 * ls[0]) - ls[1], ls[1] ,ls[2]],\r\n [(ls[2]) / 3, ls[0], ls[1] ,ls[2]]\r\n ]\r\n\r\n j = 0\r\n for x in lss:\r\n if check(x):\r\n print(\"YES\")\r\n for i in range(4):\r\n if lst[j][i] == 0:\r\n print(int(x[i]))\r\n return\r\n j += 1\r\n\r\n print(\"NO\")\r\n else:\r\n ls.sort()\r\n m = sum(ls) / 4\r\n r = ls[-1] - ls[0]\r\n x = (ls[1] + ls[2]) / 2\r\n\r\n if check1(m, r) and check1(r, x):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nsolve()\r\n\r\n", "n = int(input())\r\na=[]\r\nfor i in range (n):\r\n a.append(int(input()))\r\n\r\ndef ideal(a):\r\n a.sort()\r\n mean = sum(a)/4\r\n median = (a[1]+a[2] )/ 2\r\n r = max(a)-min(a) \r\n \r\n if( mean == median == r ):\r\n print(\"YES\") \r\n else:\r\n print(\"NO\")\r\n\r\nif( len(a) == 4 ):\r\n ideal(a)\r\n\r\nelif(len(a) == 0 ):\r\n print(\"YES\")\r\n print(1)\r\n print(1)\r\n print(3)\r\n print(3)\r\n\r\nelif(len(a)==1) : \r\n print(\"YES\")\r\n print(2*a[0])\r\n print(2*a[0])\r\n print(3*a[0])\r\n\r\nelif(len(a)==2):\r\n if((4*min(a) - max(a) )>0):\r\n print(\"YES\")\r\n print(4*min(a) - max(a))\r\n print(3*min(a))\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nelif(len(a) == 3 ):\r\n if( sum(a)-min(a) == 4*min(a)):\r\n print(\"YES\")\r\n print(3 * min(a) ) \r\n elif( max(a) == 3*min(a)):\r\n print(\"YES\")\r\n print(8*min(a) - sum(a) )\r\n elif( 3*sum(a) == 7*max(a) ) :\r\n print(\"YES\")\r\n print( max(a) // 3 )\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "def check(a, b, c, d):\r\n arr = [a, b, c, d]\r\n arr.sort()\r\n x, y, z, w = arr[0], arr[1], arr[2], arr[3]\r\n return w == 3*x and x + w == y + z\r\n\r\na = int(input())\r\nif a == 0:\r\n print(\"YES\")\r\n print(\"1\\n1\\n3\\n3\")\r\nif a == 1:\r\n x = int(input())\r\n print(\"YES\")\r\n print(x) ; print(3*x) ; print(3*x)\r\nif a == 2:\r\n x = int(input())\r\n y = int(input())\r\n x, y = min(x, y), max(x, y)\r\n if y > 3 * x:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\") ; print(4*x-y) ; print(3*x)\r\nif a == 3:\r\n nums = [int(input()) for i in range(3)]\r\n nums.sort()\r\n x, y, z = nums[0], nums[1], nums[2]\r\n for i in range(1, 10**5):\r\n if check(x, y, z, i):\r\n print(\"YES\")\r\n print(i)\r\n exit()\r\n print(\"NO\")\r\nif a == 4:\r\n nums = [int(input()) for i in range(4)]\r\n nums.sort()\r\n if nums[-1] == 3 * nums[0] and nums[0] + nums[3] == nums[1] + nums[2]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\nt = sorted([int(input()) for i in range(n)])\r\ns = None\r\n\r\nif n == 0:\r\n s = [1, 1, 3, 3]\r\nelif n == 1:\r\n a = t[0]\r\n s = [a, 3 * a, 3 * a]\r\nelif n == 2:\r\n a, b = t\r\n if a * 3 >= b: s = [3 * a, 4 * a - b]\r\nelif n == 3:\r\n a, b, c = t\r\n if 4 * a == b + c: s = [3 * a]\r\n elif 4 * c / 3 == a + b: s = [c // 3]\r\n elif c == 3 * a: s = [4 * a - b]\r\nelif n == 4:\r\n a, b, c, d = t\r\n if d + a == 4 * a == b + c: s = []\r\n\r\nif s != None:\r\n print('YES')\r\n for a in s: print(a)\r\nelse:\r\n print('NO')", "#!/usr/bin/env python\n\nimport sys\n\ndef calc(boxes):\n s = sorted(boxes)\n am = sum(s) / 4\n m = (s[1] + s[2]) / 2\n r = float(s[3] - s[0])\n return (am, m, r)\n\nn = int(input())\nboxes = []\nfor i in range(n):\n boxes.append(int(input()))\n\nif n == 0:\n print(\"YES\")\n print(\"1\")\n print(\"1\")\n print(\"3\")\n print(\"3\")\nelif n == 1:\n print(\"YES\")\n print(boxes[0] * 2)\n print(boxes[0] * 2)\n print(boxes[0] * 3)\nelif n == 2:\n if boxes[0] == boxes[1]:\n print(\"YES\")\n print(boxes[0] * 3)\n print(boxes[0] * 3)\n sys.exit(0)\n a = min(boxes[0], boxes[1])\n b = max(boxes[0], boxes[1])\n if b > a*3:\n print(\"NO\")\n sys.exit(0)\n print(\"YES\")\n if b == a*3:\n print(a*2)\n print(a*2)\n elif b < a*2:\n dist = a*2 - b\n print(a*2 + dist)\n print(a*3)\n else:\n dist = b - a*2\n print(a*2 - dist)\n print(a*3)\nelif n == 3:\n boxes.append(0)\n for i in range(1, 2000):\n boxes[3] = i\n a, m, r = calc(boxes)\n if a == m == r:\n print(\"YES\")\n print(i)\n break\n else:\n print(\"NO\")\nelse:\n a, m, r = calc(boxes)\n if a == m == r:\n print(\"YES\")\n else:\n print(\"NO\")\n\n", "\nn = int(input())\n\nar = [int(input()) for x in range(n)]\n\nar.sort()\n\nfoobar = 1\n\ndef out(*g):\n\tg = list(g)\n\tg.sort()\n\tprint(\"YES\")\n\tfor x in g:\n\t\tprint(x)\n\ndef check(x1,x2,x3,x4):\n\tl = [x1,x2,x3,x4]\n\ts = sum(l) /4\n\tif s != int(s):\n\t\treturn False\n\tl.sort()\n\tm = (l[1]+l[2])/2\n\tif m != int(m):\n\t\treturn False\n\td = l[3] - l[0]\n\t\n\tif not (s==m==d):\n\t\treturn False\n\treturn True\n\ndef _0():\n\tprint('YES')\n\tprint(1)\n\tprint(1)\n\tprint(3)\n\tprint(3)\n\ndef _1():\n\tx = ar[0]\n\tprint(\"YES\")\n#\tprint(x)\n\tprint(x)\n\tprint(3*x)\n\tprint(3*x)\n\ndef _2():\n\tx,y = ar\n\tif x*3 < y:\n\t\tprint(\"NO\")\n\telse:\n\t\t\n\t\tprint('YES')\n#\t\tprint(x)\n#\t\tprint(y)\n\t\tprint(4*x-y)\n\t\tprint(3*x)\ndef _3():\n\tx = ar[0]\n\ty = ar[1]\n\tz = ar[2]\n\tif x*3 < z:\n\t\tprint(\"NO\")\n\telse:\n\t\tprint('YES')\n#\t\tprint(x)\n#\t\tprint(y)\n#\t\tprint(z)\n\t\tprint(3*x)\n\ndef _3():\n\tar.sort()\n\tm = (max(ar)+10)*10\n\tfor x in range(1, m):\n\t\tif check(x, *ar):\n\t\t\tout(x)\n\t\t\treturn\n\t\t\t\n\tprint(\"NO\")\n\n\ndef _4():\n\tr = check(*ar)\n\tif r == False:\n\t\tprint('NO')\n\telse:\n\t\tprint(\"YES\")\n#\t\tfor x in ar: print(x)\n\n\nvars()['_' + str(n)]()", "# Why do we fall ? So we can learn to pick ourselves up.\r\n\r\nn = int(input())\r\naa = []\r\nans = \"NO\"\r\nss = []\r\nfor i in range(0,n):\r\n aa.append(int(input()))\r\nfor a in range(1,501):\r\n for b in range(a,2*a+2):\r\n possible = [a,b,4*a-b,3*a]\r\n for ab in aa:\r\n if ab in possible:\r\n possible.remove(ab)\r\n if len(possible) == 4-n:\r\n ans = \"YES\"\r\n ss = possible\r\n break\r\n if ans == \"YES\":\r\n break\r\nif ans == \"YES\":\r\n print(ans)\r\n for i in ss:\r\n print(i)\r\nelse:\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n4\r\n1\r\n2\r\n2\r\n3\r\n\r\n\"\"\"", "n=int(input())\r\na=sorted([int(input()) for _ in range(n)])\r\nb=[]\r\n\r\nif n==0: b=[1,1,3,3]\r\nelif n==1: b=[a[0],a[0]*3,a[0]*3]\r\nelif n==2: \r\n x,y=a\r\n if x==y: b=[x*3,x*3]\r\n elif x*3>=y: b=[x*3,4*x-y]\r\nelif n==3:\r\n x,y,z=a\r\n if x*3>=z and 4*x==y+z: b=[3*x]\r\n elif z%3==0 and (z+z//3)==x+y: b=[z//3]\r\n elif z==3*x: b=[4*x-y]\r\nelif n==4:\r\n if a[3]!=a[0]*3 or a[0]*4!=a[1]+a[2]: b=[-1]\r\n\r\nif len(b)+len(a)==4:\r\n print('YES')\r\n for x in b: print(x)\r\nelse:\r\n print('NO')", "n=int(input())\na=sorted([int(input()) for _ in range(n)])\nb=None\n\nif n==0: \n b=[1,1,3,3]\nelif n==1: \n x=a[0]\n b=[x,x*3,x*3]\nelif n==2: \n x,y=a\n if x==y: b=[x*3,x*3]\n elif x*3>=y: b=[x*3,x*4-y]\nelif n==3:\n x,y,z=a\n if x*3>=z and x*4==y+z: b=[x*3]\n elif z+z/3==x+y: b=[z//3]\n elif z==x*3: b=[x*4-y]\nelif n==4:\n x,y,z,v=a\n if v==x*3 and x*4==y+z: b=[]\n\nif b != None:\n print('YES')\n for x in b: print(x)\nelse:\n print('NO')\n" ]

[ "#parsea una línea\ndef parser():\n return [int(x) for x in input().split()] \n \n#Recibiendo n y m\nn,m=parser()\n#Recibiendo los colores de los vertices\ncolors_vertices=parser()\n\n#Hallando el mayor de los colores\nupper=max(colors_vertices)\n\n#Se crean una cantidad de sets igual al numero mayor\nadjacents_sets=[set() for x in range(upper)]\n\n#Se llenan los sets donde el set i contendra los vertices adyacentes al vertice i-1, si este color no existe entonces su set correspondiente se queda vacío\nfor i in range(m):\n #Leyendo una arista\n edge=parser()\n #Obteniendo los colores de los vértices\n color1=colors_vertices[edge[0]-1]\n color2=colors_vertices[edge[1]-1]\n #Si los colores son diferentes añadimos cada color a el conjunto de adyacencia del otro color\n if color1!=color2:\n adjacents_sets[color1-1].add(color2)\n adjacents_sets[color2-1].add(color1)\n\n#Cantidad máxima de vecinos\nmax_neighbours=0\n#Menor color que tiene dicha cantidad\ncolor=0\n\n#Encontrando dicha cantidad y dicho color\nfor i in range(upper):\n if max_neighbours<len(adjacents_sets[i]):\n max_neighbours=len(adjacents_sets[i])\n color=i+1\n\n#Si todos estan vacíos se devuelve el menor de los colores, si no se devuelve el calculado anteriormente\nif max_neighbours==0:\n print(min(colors_vertices))\nelse:\n print(color)", "n,m=map(int,input().split())\na=list(map(int,input().split()))\na.insert(0,-1)\ng=[[] for i in range(n+1)]\nfor i in range(m):\n\tu,v=map(int,input().split())\n\tg[u].append(v)\n\tg[v].append(u)\n#print(g)\ndiv=[0]\nfor i in range(1,n+1):\n\ts=set()\n\tfor j in g[i]:\n\t\tif a[j]!=a[i]:\n\t\t\ts.add(a[j])\n\tdiv.append(s)\n#print(div)\nc={}\nfor i in range(1,len(a)):\n\tif a[i] in c:\n\t\tc[a[i]].append(i)\n\telse:\n\t\tc[a[i]]=[i]\n#print(c)\nm=0\nind=1000000\t\nfor i in c:\n\td=set()\n\tfor j in c[i]:\n\t\tfor k in div[j]:\n\t\t\td.add(k)\n\tif len(d)>m:\n\t\tind=i\n\t\tm=len(d)\n\telif len(d)==m:\n\t\tind=min(ind,i)\nprint(ind)\n", "from collections import defaultdict\r\nfrom sys import stdin\r\ninput=stdin.readline\r\n\r\nn,m=map(int,input().strip().split())\r\nres=defaultdict(set)\r\nc=[*map(int,input().strip().split())]\r\nfor i in c:\r\n\tres[i].add(i)\r\nfor i in range(m):\r\n\tx,y=map(lambda s:int(s)-1,input().strip().split())\r\n\tres[c[x]].add(c[y])\r\n\tres[c[y]].add(c[x])\r\n\r\nl=list(res.keys())\r\nl.sort()\r\nprint(max(l,key=lambda s:len(res[s])))", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd={}\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if x not in d:\r\n d[x]=[]\r\n if y not in d:\r\n d[y]=[]\r\n d[x].append(y)\r\n d[y].append(x)\r\nfor i in range(1,n+1):\r\n if i not in d:\r\n d[i]=[]\r\ncolor={}\r\nfor i in range(n):\r\n if c[i] not in color:\r\n color[c[i]]=set()\r\n color[c[i]].add(i+1)\r\n\r\nfq={}\r\nfor i in color:\r\n fq[i]=set()\r\nfor i in color:\r\n for j in color[i]:\r\n for k in d[j]:\r\n if c[k-1]!=i:\r\n fq[i].add(c[k-1])\r\nmx=-1\r\nfor i in fq:\r\n if len(fq[i])>mx:\r\n mx=len(fq[i])\r\n ans=i\r\n elif len(fq[i])==mx:\r\n ans=min(ans,i)\r\n\r\nprint(ans)\r\n \r\n", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=defaultdict(set)\r\nfor i in c:\r\n d[i]=set()\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n u-=1\r\n v-=1\r\n if c[u]!=c[v]:\r\n d[c[u]].add(c[v])\r\n d[c[v]].add(c[u])\r\na=[]\r\nfor i in d:\r\n a.append([i,len(d[i])])\r\na.sort(key=lambda x:(-x[1],x[0]))\r\nprint(a[0][0])", "n,m = list(map(int,input().strip().split()))\ncolor = list(map(int,input().strip().split()))\ng = [[] for i in range(n)]\ncolors = {i:set() for i in sorted(color)}\nfor i in range(m):\n u,v =list(map(int,input().strip().split()))\n u -= 1\n v -= 1\n if color[u] != color[v]:\n colors[color[u]].add(color[v])\n colors[color[v]].add(color[u])\nprint(max(colors,key = lambda x : len(colors[x])))", "from sys import stdin\r\ninput = stdin.readline\r\n# from math import gcd\r\n# from collections import Counter\r\n# from heapq import heapify,heappop,heappush\r\n\r\nn,m = map(int,input().split())\r\nadjency = [[] for i in range(n+1)]\r\na = list(map(int,input().split()))\r\nc = {}\r\nfor i in a:\r\n c[i] = set()\r\n# print(c) \r\n\r\nfor i in range(m):\r\n u,v = map(int,input().split())\r\n adjency[u].append(v)\r\n adjency[v].append(u)\r\n# print(adjency) \r\nfor i in range(1,len(adjency)):\r\n co = a[i-1] \r\n # print(co,adjency[i])\r\n for j in adjency[i]:\r\n if a[j-1] != co:\r\n c[co].add(a[j-1])\r\n# print(c)\r\nfor i in c:\r\n c[i] = len(c[i]) \r\n# print(c) \r\nma = 0\r\nmi = max(a) \r\nfor i in c:\r\n if c[i] > ma:\r\n ma = c[i]\r\n mi = i \r\n if c[i] == ma:\r\n mi = min(mi,i) \r\nprint(mi) ", "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd={x:set() for x in set(l)}\r\n\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n if l[a-1]!=l[b-1] :\r\n d[l[a-1]].add(l[b-1])\r\n d[l[b-1]].add(l[a-1])\r\n\r\nd=sorted(d,key=lambda x :(len(d[x]),-x))\r\nprint(d[-1])\r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd={x:set() for x in c}\r\n\r\nfor _ in range(m):\r\n x,y=map(int,input().split())\r\n if c[x-1]!=c[y-1]:\r\n d[c[x-1]].add(c[y-1])\r\n d[c[y-1]].add(c[x-1])\r\nd=sorted(d, key=lambda x: (len(d[x]),-x) )\r\n\r\nprint(d[-1])\r\n", "# 2022-11-06 21:34:05.207933\r\n# https://codeforces.com/problemset/problem/246/D\r\nimport sys\r\nfrom collections import defaultdict\r\n\r\n_DEBUG = True\r\n_DEBUG = False\r\nif not _DEBUG:\r\n input = sys.stdin.readline\r\n # print = sys.stdout.write\r\n\r\ng = defaultdict(set)\r\nn, m = map(int, input().split())\r\nc = [0] + list(map(int, input().split()))\r\ncolors = set(c[1:])\r\ndiversity = defaultdict(set)\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n\r\n color_a = c[a]\r\n color_b = c[b]\r\n\r\n if color_a != color_b:\r\n diversity[color_a].add(color_b)\r\n diversity[color_b].add(color_a)\r\n\r\nmax_color = min(colors)\r\nfor color in colors:\r\n if len(diversity[color]) > len(diversity[max_color]):\r\n max_color = color\r\n elif len(diversity[color]) == len(diversity[max_color]):\r\n max_color = min(max_color, color)\r\nprint(max_color)\r\n", "from sys import stdin\r\nfrom collections import *\r\n\r\n\r\ndef arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return list(stdin.readline()[:-1])\r\n\r\n\r\ndef main():\r\n n, m = arr_inp(1)\r\n c, ans, ma = arr_inp(1), float('inf'), 0\r\n mem = defaultdict(set)\r\n\r\n for i in range(m):\r\n u, v = arr_inp(1)\r\n u -= 1\r\n v -= 1\r\n if c[u] != c[v]:\r\n mem[c[u]].add(c[v])\r\n mem[c[v]].add(c[u])\r\n\r\n for i, j in mem.items():\r\n if len(j) > ma:\r\n ma = max(ma, len(j))\r\n ans = i\r\n if len(j) == ma:\r\n ans = min(ans, i)\r\n\r\n print(ans if ans != float('inf') else min(c))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nadj = {x:set() for x in set(c)}\r\n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n if c[u-1] != c[v-1]:\r\n adj[c[u-1]].add(c[v-1])\r\n adj[c[v-1]].add(c[u-1])\r\n\r\nprint(sorted(adj, key = lambda x: (len(adj[x]), -x))[-1])", "from sys import stdin\ninput = stdin.readline\n\nn, m = map(int, input().split())\ncolor = list(map(int, input().split()))\ncolor_set = set(color)\n\ncardinality = [set() for i in range(max(color) + 1)]\nfor l in range(m):\n u, v = map(int, input().split())\n if color[u - 1] != color[v - 1]: \n cardinality[color[u - 1]].add(color[v - 1]) \n cardinality[color[v - 1]].add(color[u - 1])\n\n\nmax_card, ans = -1, min(color)\nfor i in range(min(color), len(cardinality)):\n if i not in color_set: continue\n if len(cardinality[i]) > max_card: max_card = len(cardinality[i]); ans = i\n\nprint(ans)", "n, m = map(int, input().split())\n\n\nc = list(map(int, input().split()))\n\nM =max(c)\ng= [set() for _ in range(M+1)]\nfor _ in range(m):\n a, b = map(int, input().split())\n a -=1\n b -= 1\n if c[a] != c[b]:\n g[c[a]].add(c[b])\n g[c[b]].add(c[a])\n\n\nans = min(c)\n\nfor i in range(M+1):\n if len(g[i]) > len(g[ans]):\n ans = i\n\nprint(ans)\n", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Colorful_Graph():\r\n n,m = invr()\r\n color_sequence = inlt()\r\n \r\n Q_k_dict = {}\r\n for color in color_sequence:\r\n Q_k_dict[color] = set()\r\n\r\n for i in range(m):\r\n node1, node2 = invr()\r\n color_node1 = color_sequence[node1-1]\r\n color_node2 = color_sequence[node2-1]\r\n\r\n if color_node1 != color_node2:\r\n Q_k_dict[color_node1].add(color_node2)\r\n Q_k_dict[color_node2].add(color_node1)\r\n \r\n max_cardinality = -1\r\n corresponding_color = -1 \r\n\r\n for color in Q_k_dict.keys():\r\n if len(Q_k_dict[color]) > max_cardinality:\r\n max_cardinality = len(Q_k_dict[color])\r\n corresponding_color = color \r\n elif len(Q_k_dict[color]) == max_cardinality:\r\n corresponding_color = min(corresponding_color,color)\r\n \r\n print(corresponding_color)\r\n return \r\n\r\n\r\nColorful_Graph()", "n,m=map(int,input().split())\r\ncol=list(map(int,input().split()))\r\ncs=set(col)\r\ncnt=[None]*100001\r\nfor i in range(100001):\r\n\tcnt[i]=set()\r\nfor i in range(m):\r\n\tu,v=map(int,input().split())\r\n\tif(col[u-1]!=col[v-1]):\r\n\t\tcnt[col[u-1]].add(col[v-1])\r\n\t\tcnt[col[v-1]].add(col[u-1])\r\nans=-1\r\nmx=-1\r\nfor i in range(100001):\r\n\tif(mx<len(cnt[i]) and i in cs):\r\n\t\tmx=len(cnt[i])\r\n\t\tans=i\r\nprint(ans)" ]

[ "n, k = map(int, input().split())\r\na = [1 for i in range(n + 1)]\r\na[n] = 0\r\nfor iter in range(k):\r\n for i in range(1, n - 1):\r\n target = n - i\r\n if a[i + 1] > target - a[i]:\r\n # find right number\r\n target -= a[i]\r\n print(n - target, end=' ')\r\n a[i] += a[n - target];\r\n else:\r\n a[i] += a[i + 1]\r\n print(i + 1, end=' ')\r\n for i in range(max(0, n - 2), n):\r\n print(n, end=' ')\r\n print()\r\n", "def solve(n, k):\r\n d = [i for i in range(n - 1, -1, -1)]\r\n c = [1 for _ in range(n - 1)] + [0]\r\n for _ in range(k):\r\n for i in range(n):\r\n if c[i] * 2 <= d[i]:\r\n c[i] *= 2\r\n print(i + 1, end=' ')\r\n else:\r\n r = d[i] - c[i]\r\n c[i] = d[i]\r\n print(n - r, end=' ')\r\n print()\r\n\r\nif __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n solve(n, k)" ]

[ "def luckyNumber(n):\r\n \r\n queue = []\r\n queue.append((0,0))\r\n \r\n while queue != []:\r\n pair = queue.pop(0)\r\n val = pair[0]\r\n c = pair[1]\r\n \r\n if c == 0 and val >= n:\r\n return val\r\n else:\r\n queue.append((val * 10 + 4, c + 1))\r\n queue.append((val * 10 + 7, c - 1))\r\n \r\n \r\n \r\nn = int(input())\r\nans = luckyNumber(n)\r\nprint(ans)", "# Recursion\r\n\r\nmini = 1e12\r\n\r\nx = int(input())\r\n\r\n\r\ndef lucky(num, counter):\r\n global x, mini\r\n if num > 1e11:\r\n return\r\n\r\n if counter == 0 and num >= x:\r\n mini = min(mini, num)\r\n return lucky(num * 10 + 4, counter + 1), lucky(num * 10 + 7, counter - 1)\r\n\r\n\r\nlucky(0, 0)\r\nprint(mini)\r\n", "lst = []\r\ndef collect_nums(n, num=0):\r\n if num >= 4444477777:\r\n return\r\n first = num * 10 + 4\r\n second = num * 10 + 7\r\n if str(first).count('4') == str(first).count('7'):\r\n lst.append(first)\r\n if str(second).count('4') == str(second).count('7'):\r\n lst.append(second)\r\n collect_nums(n, first)\r\n collect_nums(n, second)\r\n\r\n\r\nn = int(input())\r\ncollect_nums(n)\r\nlst.sort()\r\nfor num in lst:\r\n if num >= n:\r\n print(num)\r\n break\r\n", "class Solution:\r\n \r\n res = 10**12\r\n def luckyNumber(self,val, c):\r\n \r\n if val >= 10**11:\r\n return\r\n \r\n \r\n if val >= n and c == 0:\r\n self.res = min(self.res, val)\r\n return\r\n \r\n self.luckyNumber(val * 10 + 4, c + 1) \r\n self.luckyNumber(val * 10 + 7, c - 1)\r\n \r\n\r\nn = int(input())\r\ns = Solution()\r\n\r\ns.luckyNumber(0,0)\r\nprint(s.res)", "n = input()\r\nif len(n) % 2 != 0 or int(n[0]) > 7 or n.count('7') == len(n):\r\n \r\n if int(n[0]) > 7:\r\n n = \"#\" * (len(n) + 1)\r\n\r\n if len(n) % 2 != 0:\r\n n = \"#\" * (len(n) + 1)\r\n\r\n elif n.count('7') == len(n):\r\n n = \"#\" * (len(n) + 2)\r\n\r\n super_Lucky = '4' * (len(n)//2) + '7' * (len(n) // 2)\r\n\r\n print (super_Lucky)\r\n\r\nelif n.count(\"4\") == n.count(\"7\") and n.count(\"4\") + n.count(\"7\") == len(n):\r\n\r\n print (n)\r\n\r\nelse:\r\n # differ 74777443\r\n temp = \"\"\r\n for i in range(len(n)):\r\n if int(n[i]) == 4:\r\n temp += n[i]\r\n elif int(n[i]) < 4:\r\n temp += \"4\"\r\n temp += \"4\"*(len(n) - len(temp))\r\n break\r\n elif int(n[i]) == 7:\r\n temp += n[i]\r\n elif int(n[i]) < 7:\r\n temp += \"7\"\r\n temp += \"4\"*(len(n) - len(temp))\r\n break\r\n elif int(n[i]) > 7:\r\n if \"4\" in n:\r\n temp = temp[:temp.rfind(\"4\")] + \"74\" \r\n temp += \"4\"*(len(n) - len(temp))\r\n break\r\n\r\n lucky = temp\r\n\r\n if lucky == n:\r\n lucky = temp[:temp.rfind(\"4\")] + \"7\"\r\n lucky += \"4\"*(len(n) - len(lucky))\r\n\r\n for i in range(len(lucky) - 1,-1,-1):\r\n if lucky.count('7') == lucky.count('4'):\r\n break\r\n lucky = lucky[0:i] + '7' + lucky[i + 1:]\r\n\r\n if lucky.count('7') == len(n):\r\n n = \"#\" * (len(n) + 2)\r\n lucky = ('4' * (len(n)//2) + '7' * (len(n) // 2))\r\n \r\n print (lucky)\r\n\r\n\"\"\"\r\n\r\n\r\n lucky = None\r\n if n[0] <= \"4\": first_val = 4\r\n elif n[0] <= \"7\": first_val = 7\r\n compare = str(first_val) + ('4' * (len(n) - 1))\r\n\r\n for i in range(len(compare)-1,-1,-1):\r\n if int(n) <= int(compare[0:i] + '7' + compare[i + 1:]):\r\n lucky = compare[0:i] + '7' + compare[i + 1:]\r\n break\r\n\r\n\r\n if lucky == None:\r\n lucky = \"#\" * (len(n) + 1)\r\n if len(lucky) % 2 != 0:\r\n lucky += \"#\"\r\n lucky = '4' * (len(lucky)//2) + '7' * (len(lucky) // 2)\r\n\r\n else: \r\n for i in range(len(lucky) - 1,-1,-1):\r\n if lucky.count('7') == lucky.count('4'):\r\n break\r\n lucky = lucky[0:i] + '7' + lucky[i + 1:]\r\n\r\n print (lucky)\r\n\r\n del(lucky)\r\n del(n)\r\n\"\"\"", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom bisect import bisect_right, bisect_left\nfrom fractions import Fraction as frac\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef solution():\n\n n = int(input())\n\n all_lucky = []\n def dfs(path, fours, sevens):\n if path > 10**10:\n return\n if fours == sevens:\n all_lucky.append(path)\n\n dfs(path*10 + 4, fours + 1, sevens)\n dfs(path*10 + 7, fours, sevens + 1)\n\n\n dfs(4, 1, 0)\n dfs(7, 0, 1)\n\n all_lucky.sort()\n for lucky in all_lucky:\n if lucky >= n:\n return print(lucky)\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "n=int(input())\r\nq=[]\r\ndef f(a,c):\r\n if a>=10**10:\r\n return \r\n if c==0 and n<=a:\r\n q.append(a)\r\n f(a*10+4,c+1)\r\n f(a*10+7,c-1)\r\nf(0,0)\r\nif 0 in q:\r\n q.sort()\r\n q.pop(0)\r\nprint(min(q))\r\n\r\n \r\n", "def m_c(a,t,k):\r\n global m\r\n if a>10000000000:\r\n return \r\n if t==k:\r\n m.append(a)\r\n m_c(a*10+4,t+1,k)\r\n m_c(a*10+7,t,k+1)\r\na=int(input())\r\nm=[]\r\nm_c(0,0,0)\r\nm.sort()\r\nl=0;\r\nh=len(m)\r\nwhile l<=h:\r\n mid=(l+h)//2\r\n if m[mid]>=a:\r\n h=mid-1\r\n else:\r\n l=mid+1\r\nif m[mid]<a:\r\n print(m[mid+1])\r\nelse:\r\n print(m[mid])", "lucky = []\r\n\r\ndef trY(number, fours, sevens):\r\n if number > 1e10:\r\n return\r\n\r\n if fours == sevens:\r\n lucky.append(number)\r\n\r\n trY(number * 10 + 7, fours, sevens + 1)\r\n trY(number * 10 + 4, fours + 1, sevens)\r\n\r\ntrY(4, 1, 0)\r\ntrY(7, 0, 1)\r\n\r\nn = int(input())\r\n\r\nlucky.sort()\r\nindex = 0\r\nfor i in range(len(lucky)):\r\n if lucky[i] >= n:\r\n index = i\r\n break\r\n\r\nprint(lucky[index])\r\n", "import bisect\nnums = []\nMAX_N = int(1e11)\ndef ok(num):\n c = 0\n while(num):\n if num % 10 == 4:\n c+=1\n else:\n c-=1\n num//= 10;\n return c == 0\n\ndef gen(num):\n if num >= MAX_N:\n return\n num*= 10\n if ok(num + 4):\n nums.append(num + 4)\n gen(num + 4)\n \n if ok(num + 7):\n nums.append(num + 7)\n gen(num + 7)\n \n\ngen(0)\nnums.sort()\nn = int(input())\nidx = bisect.bisect_left(nums, n)\nprint(nums[idx])\n\t \t \t\t \t \t\t\t \t\t \t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\ndef findAllNums(num, fours, sevens):\r\n if num > 1e10:\r\n return\r\n\r\n if fours == sevens:\r\n nums.append(num)\r\n\r\n findAllNums(num*10 + 4, fours+1, sevens)\r\n findAllNums(num * 10 + 7, fours, sevens+1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n nums = []\r\n findAllNums(0,0,0)\r\n nums.sort()\r\n\r\n n = inp()\r\n\r\n l, r = 0, len(nums)-1\r\n\r\n while (l < r):\r\n mid = (l+r)//2\r\n\r\n if nums[mid] >= n:\r\n r = mid\r\n\r\n else:\r\n l = mid + 1\r\n\r\n print(nums[l])", "n = input()\r\nallnum = ['#','0']\r\ni = 1\r\n\r\nwhile i>0:\r\n check = allnum[i]\r\n if int(n) <= int(check) and check.count('4') == check.count('7'):\r\n print(check)\r\n break\r\n allnum.append(str(10*int(check)+4))\r\n allnum.append(str(10*int(check)+7))\r\n i+=1", "n=int(input())\r\nq=[0]\r\nwhile True:\r\n m=q[0]\r\n if m>=n and str(m).count(\"7\")==str(m).count(\"4\"):\r\n print(m)\r\n break\r\n else:\r\n q.append((10*m)+4)\r\n q.append((10*m)+7)\r\n q.pop(0)", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nstates = []\r\ndef dfs(u, cnt):\r\n global states\r\n if u > 10**15:\r\n return\r\n if cnt == 0:\r\n states.append(u)\r\n dfs(u * 10 + 4, cnt + 1)\r\n dfs(u * 10 + 7, cnt - 1)\r\ndfs(0, 0)\r\n\r\nstates.sort()\r\nprint(states[bisect.bisect_left(states, n)])", "import itertools\r\n\r\ndef check_super_lucky(n:int) -> bool:\r\n stri = str(n)\r\n if stri.count(\"7\") == stri.count(\"4\"):\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nnumbers = []\r\n\r\ndef generate_lucky(l:int) -> list:\r\n numbers = list(itertools.product(\"47\", repeat=l))\r\n return list(map(lambda x: int(\"\".join(x)), numbers))\r\n\r\nl = len(str(n))\r\nfor i in range(l, l+4):\r\n a = generate_lucky(i)\r\n for x in a:\r\n numbers.append(x)\r\n\r\nfor i in numbers:\r\n if i>= n and check_super_lucky(i):\r\n print(i)\r\n exit()\r\n", "n = int(input())\r\na = [0]\r\ni = 0\r\nwhile True:\r\n k = a[i] \r\n if k >= n and str(k).count('4') == str(k).count('7'):\r\n print(k)\r\n break \r\n a+=[10*k+4 , 10*k+7]\r\n i+=1\r\n", "from cmath import *\r\nfrom decimal import *\r\n \r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\n \r\ndef solves():\r\n n = int(input())\r\n nums = [0]\r\n i = 0\r\n \r\n while True:\r\n num = nums[i]\r\n qtd_4 = str(num).count('4') \r\n qtd_7 = str(num).count('7')\r\n \r\n if num >= n and qtd_4 == qtd_7:\r\n print(num)\r\n break\r\n nums += [10 * num + 4 , 10 * num + 7]\r\n i += 1\r\n #print(nums)\r\n \r\n\r\n\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()", "lucky = []\r\n\r\ndef taoso(soso4,soso7,num):\r\n if int(num) > 10**10:\r\n return\r\n else:\r\n if soso4 == soso7:\r\n lucky.append(int(num))\r\n taoso(soso4+1,soso7,num+'4')\r\n taoso(soso4,soso7+1,num+'7')\r\n\r\ntaoso(1,0,'4')\r\ntaoso(0,1,'7')\r\nlucky.sort()\r\nn = int(input())\r\n\r\nif n in lucky:\r\n print(n)\r\nelse:\r\n i = 0\r\n while lucky[i] < n and i < len(lucky):\r\n i += 1\r\n\r\n if i == 0 or i < n:\r\n print(lucky[i])\r\n else:\r\n if abs(lucky[i] - n) > abs(lucky[i-1]-n):\r\n print(lucky[i])\r\n else:\r\n print(lucky[i-1])" ]

[ "#!/usr/bin/env python3\nfrom itertools import accumulate\nfrom heapq import heappop, heappush\n\n\ndef top(ppl_indices, vals, start):\n Q = []\n res = [0 for i in range(len(ppl_indices))]\n for k, idx in enumerate(ppl_indices):\n heappush(Q, -vals[idx])\n if k >= start:\n res[k] = res[k-1] - heappop(Q)\n\n return res\n\n\nn, a_size, b_size = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nconversion_gain = [y - x for x, y in zip(a, b)]\n\nordered_by_a = sorted(zip(a, range(n)), reverse=True)\nprefix_sums_a = list(accumulate([x for x, y in ordered_by_a]))\nconversions = top([idx for val, idx in ordered_by_a], conversion_gain, a_size)\nrest_of_bs = list(reversed(top([idx for val, idx in reversed(ordered_by_a[a_size:])],\n b, n - a_size - b_size))) + [0]\n\nsol, top_k = max([(prefix_a + convert + add_bs, idx)\n for idx, (prefix_a, convert, add_bs)\n in enumerate(zip(prefix_sums_a[a_size-1:a_size+b_size],\n conversions[a_size-1:a_size+b_size],\n rest_of_bs))])\ntop_k += a_size\n\nconversion_ordered_by_a = [(conversion_gain[idx], idx) for val, idx in ordered_by_a]\nconversion_sorted = sorted(conversion_ordered_by_a[:top_k], reverse=True)\nconverted = [idx for val, idx in conversion_sorted[:top_k-a_size]]\nteam_a = list(set(idx for val, idx in ordered_by_a[:top_k]) - set(converted))\n\nb_ordered_by_a = [(b[idx], idx) for val, idx in ordered_by_a]\nb_sorted = sorted(b_ordered_by_a[top_k:], reverse=True)\nteam_b = converted + [idx for val, idx in b_sorted[:(a_size+b_size) - top_k]]\n\nprint(sol)\nprint(\" \".join(str(idx+1) for idx in team_a))\nprint(\" \".join(str(idx+1) for idx in team_b))\n" ]

[ "def read_data():\r\n n, m = map(int, input().split())\r\n Es = [[] for v in range(n)]\r\n for e in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n Es[a].append(b)\r\n Es[b].append(a)\r\n return n, m, Es\r\n\r\ndef solve(n, m, Es):\r\n if m == 0:\r\n return 3, n * (n - 1) * (n - 2) // 6\r\n if max(map(len, Es)) == 1:\r\n return 2, m * (n-2)\r\n patterns = 0\r\n color = [0] * n\r\n for u in range(n):\r\n if color[u]:\r\n continue\r\n color[u] = 1\r\n stack = [u]\r\n n_color = [1, 0]\r\n while stack:\r\n v = stack.pop()\r\n prev_color = color[v]\r\n for w in Es[v]:\r\n current_color = color[w]\r\n if current_color == prev_color:\r\n return 0, 1\r\n if current_color == 0:\r\n color[w] = - prev_color\r\n n_color[(prev_color + 1)//2] += 1\r\n stack.append(w)\r\n n_even = n_color[0]\r\n n_odd = n_color[1]\r\n patterns += n_even * (n_even - 1) // 2 + n_odd * (n_odd - 1) // 2\r\n return 1, patterns\r\n\r\nif __name__ == '__main__':\r\n n, m, Es = read_data()\r\n print(*solve(n, m, Es))\r\n", "n, m = [int(x) for x in input().split()]\nE = {i:[] for i in range(n)}\nfor i in range(m):\n u, v = [int(x)-1 for x in input().split()]\n E[v].append(u)\n E[u].append(v)\n\ndef dfs():\n visited = [False for i in range(n)]\n colour = [0 for i in range(n)]\n ans = 0\n for v in range(n):\n if visited[v]: continue\n stack = [(v, 0)]\n part = [0, 0]\n while stack:\n node, c = stack.pop()\n if not visited[node]:\n part[c] += 1\n visited[node] = True\n colour[node] = c\n stack.extend((u,c^1) for u in E[node])\n elif c != colour[node]:\n return (0, 1)\n ans += (part[0]*(part[0] - 1) + part[1]*(part[1] - 1)) // 2\n return (1, ans)\n\nif m == 0:\n print(3, n*(n-1)*(n-2)//6)\nelif max(len(E[v]) for v in E) == 1:\n print(2, m*(n-2))\nelse:\n ans = dfs()\n print(ans[0], ans[1])\n\n \n\n \n", "# 解説AC\r\n# 二部グラフでないグラフの性質や，パスの長さを考察する\r\n\r\ndef main():\r\n N, M = (int(i) for i in input().split())\r\n\r\n par = [i for i in range(N)]\r\n size = [1 for i in range(N)]\r\n\r\n def find(x):\r\n if par[x] == x:\r\n return x\r\n else:\r\n par[x] = find(par[x])\r\n size[x] = size[par[x]]\r\n return par[x]\r\n\r\n def same(x, y):\r\n return find(x) == find(y)\r\n\r\n def union(x, y):\r\n x = find(x)\r\n y = find(y)\r\n if x == y:\r\n return\r\n if size[x] < size[y]:\r\n x, y = y, x\r\n size[x] += size[y]\r\n par[y] = x\r\n\r\n def get_size(x):\r\n return size[find(x)]\r\n\r\n G = [[] for _ in range(N)]\r\n for _ in range(M):\r\n a, b = (int(i) for i in input().split())\r\n G[a-1].append(b-1)\r\n G[b-1].append(a-1)\r\n union(a-1, b-1)\r\n\r\n S = [False]*4\r\n for i in range(N):\r\n S[min(3, get_size(i))] = True\r\n if S[3]:\r\n break\r\n t = 0\r\n if S[3]:\r\n t = 1\r\n elif S[2]:\r\n t = 2\r\n else:\r\n t = 3\r\n\r\n color = [-1]*N\r\n\r\n def dfs(s):\r\n stack = [s]\r\n color[s] = 0\r\n b = 1\r\n w = 0\r\n while stack:\r\n v = stack.pop()\r\n for u in G[v]:\r\n if color[u] != -1:\r\n if color[u] == color[v]:\r\n return False, b*w\r\n continue\r\n color[u] = color[v] ^ 1\r\n if color[u] == 0:\r\n b += 1\r\n else:\r\n w += 1\r\n stack.append(u)\r\n return True, b*(b-1)//2 + w*(w-1)//2\r\n\r\n is_bipartite, _ = dfs(0)\r\n if is_bipartite:\r\n w = 0\r\n if t == 3:\r\n w = N*(N-1)*(N-2)//3//2\r\n elif t == 2:\r\n used = [False]*N\r\n for i in range(N):\r\n if not used[find(i)] and get_size(i) == 2:\r\n w += (N-2)\r\n used[find(i)] = True\r\n elif t == 1:\r\n used = [False]*N\r\n color = [-1]*N\r\n for i in range(N):\r\n if not used[find(i)] and get_size(i) >= 3:\r\n _, ways = dfs(i)\r\n w += ways\r\n used[find(i)] = True\r\n print(t, w)\r\n else:\r\n print(0, 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "g = [[] for _ in range(100005)]\r\n\r\nn, m = map(int, input().split(' '))\r\nfor i in range(m):\r\n a, b = map(int, input().split(' '))\r\n g[a].append(b)\r\n g[b].append(a)\r\n\r\ncolour = [0] * 100005\r\nv = [0] * 100005\r\n\r\ncycle = False\r\ntwo = True\r\ntwos = 0\r\nones = 0\r\nans = 0 \r\nfor i in range(1, n+1):\r\n cs = 0\r\n c1 = 0\r\n c2 = 0\r\n if (not colour[i]):\r\n q = [i]\r\n colour[i] = 1\r\n while q:\r\n cs += 1\r\n top = q.pop()\r\n if colour[top] == 1:\r\n c1 += 1\r\n else: c2 += 1\r\n for j in g[top]: \r\n if colour[j] == colour[top]:\r\n cycle = True\r\n elif colour[j] == 0:\r\n colour[j] = -colour[top]\r\n q = [j] + q\r\n if cs > 2:\r\n two = False\r\n ans += ((c1*(c1-1))//2 + (c2*(c2-1))//2)\r\n if cs == 2:\r\n twos += 1\r\n \r\n if cs == 1:\r\n ones += 1\r\nif cycle:\r\n print(0, 1)\r\n quit()\r\n\r\nif m == 0:\r\n print(3, (n*(n-1)*(n-2)//6))\r\n quit()\r\nif two:\r\n print(2, twos*ones + 4 * (twos * (twos - 1) // 2))\r\n quit()\r\nsumx = 0\r\nfor i in range(1, n+1):\r\n ll = len(g[i])\r\n sumx += ll * (ll-1) // 2\r\nprint(1, ans)\r\n" ]

[ "n=int(input())\r\nm=input().split()\r\njishu=0\r\noushu=0\r\nfor i in range(3):\r\n k=int(m[i])/2-int(m[i])//2\r\n if k==0:\r\n oushu+=1\r\n else:\r\n jishu+=1\r\nif jishu>oushu:\r\n for i in range(n):\r\n kt=int(m[i])/2-int(m[i])//2\r\n if kt==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n kt=int(m[i])/2-int(m[i])//2\r\n if kt!=0:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nlistnum = [int(a) for a in input().split()]\r\n\r\neven = [] \r\nodd = []\r\n\r\nindex = 0\r\n\r\nfor elem in listnum:\r\n if elem%2 == 0:\r\n even.append(elem)\r\n else:\r\n odd.append(elem)\r\n\r\nif len(even) == 1:\r\n index = listnum.index(even[0])\r\nelse:\r\n index = listnum.index(odd[0])\r\n\r\nprint(index+1)", "a=int(input())\r\nb=input().split()\r\ns=0\r\nt=0\r\nfor i in range(a):\r\n b[i]=int(b[i])%2\r\nfor i in range(a):\r\n if b[i]==0:\r\n s=s+1\r\n else:\r\n t=t+1\r\nif s>t:\r\n for i in range(a):\r\n if b[i]==1:\r\n print(i+1)\r\nelse:\r\n for i in range(a):\r\n if b[i]==0:\r\n print(i+1)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[]\r\nfor i in range(n):\r\n b.append(a[i]%2)\r\nif b.count(1)>b.count(0):\r\n c=[1]*n\r\nelse:\r\n c=[0]*n\r\nfor i in range(n):\r\n if b[i]-c[i]!=0:\r\n print(i+1)", "n = int(input())\r\nm = list(map(int, input().split()))\r\nk=0\r\nz=0\r\nfor i in range(n):\r\n if m[i] % 2 !=0:\r\n k+=1\r\n b=i+1\r\n elif m[i] % 2 == 0:\r\n z+=1\r\n j=i+1\r\nif k > z:\r\n print(j)\r\nelse:\r\n print(b)\r\n\r\n \r\n", "n=int(input()) \r\na=list(map(int, input().split())) \r\nc=\"\"\r\nfor i in a: \r\n if i%2==0:\r\n c+=\"0\"\r\n else: \r\n c+=\"1\"\r\nzhup=c.count(\"0\") \r\ntak=c.count(\"1\")\r\nif zhup> tak: \r\n print(c.index(\"1\")+1)\r\nelse: \r\n print(c.index(\"0\")+1)", "input()\r\nnumbers = input().split()\r\neven = []\r\nnot_even = []\r\nfor number in numbers:\r\n if int(number) % 2 == 0:\r\n even.append(number)\r\n else:\r\n not_even.append(number)\r\n\r\nif len(even) == 1:\r\n print(numbers.index(even[0]) + 1)\r\nelif len(not_even) == 1:\r\n print(numbers.index(not_even[0]) + 1)\r\nelse:\r\n print('You have incorrect sequence')", "t = int(input())\r\nn = input().split(\" \")\r\nnum = [int(i) for i in n]\r\neven = 0;lastev = 0;lastodd = 0\r\nfor i in range(1,t+1):\r\n if (num[i-1]%2==0):\r\n even+=1\r\n lastev = i\r\n else:\r\n even-=1\r\n lastodd = i\r\n\r\nif even > 0: print(lastodd)\r\nelse:print(lastev)", "import sys\nn = int(input())\nnumbers = list(map(int, input().split()))\nlength = len(numbers)\neven = []\nfor number in numbers:\n if(number % 2 == 0):\n even.append(True)\n else:\n even.append(False)\nmask = sum(even)\nif(mask == length - 1):\n answer = even.index(0)\nelse:\n answer = even.index(1)\nprint(answer + 1)\n", "y = input(\"\")\r\nx = input(\"\").split()\r\n\r\nfor i in range(len(x)):\r\n x[i] = int(x[i])\r\n\r\neven = 0\r\nodd = 0\r\n\r\nfor i in range(len(x)):\r\n if(x[i] % 2 == 0):\r\n even += 1\r\n else:\r\n odd += 1\r\n \r\nif(even == 1):\r\n for j in range(len(x)):\r\n if(x[j] % 2 == 0):\r\n print(j + 1)\r\nelse:\r\n for j in range(len(x)):\r\n if(x[j] % 2 == 1):\r\n print(j + 1)\r\n", "n=int(input())\r\nnas=list(map(int,input().split()))\r\nctr=0\r\nmtr=0\r\nct=[]\r\nmt=[]\r\nfor i in range(len(nas)):\r\n if nas[i]%2:\r\n ctr+=1\r\n ct.append(i)\r\n else:\r\n mtr+=1\r\n mt.append(i)\r\n if ctr>=1 and mtr>=1:\r\n if ctr<mtr:\r\n print(ct[-1]+1)\r\n break\r\n elif mtr<ctr:\r\n print(mt[-1]+1)\r\n break\r\n else:\r\n continue", "t=int(input())\r\nx=list(map(int,input().split()))\r\nm=n=0\r\nfor i in range(0,t):\r\n if x[i]%2==0:\r\n k=i\r\n m+=1\r\n \r\n if x[i]%2==1:\r\n p=i\r\n n+=1\r\n\r\nif n==1:\r\n print(p+1)\r\nelif m==1:\r\n print(k+1)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=s=w=0\r\nwhile p<n-1:\r\n s=s+(p+1)*abs(l[p+1]%2-l[p]%2)\r\n w=w+abs(l[p+1]%2-l[p]%2)\r\n p+=1\r\nif w<2 and s>1:\r\n print(n)\r\nelse:\r\n print(int(s/2+1/2))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nodd = 0\r\neven = 0\r\nindex1 = 0\r\nindex2 = 0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even = even + 1\r\n index1 = i\r\n else:\r\n odd = odd + 1\r\n index2 = i\r\nif even > odd:\r\n print(index2 + 1)\r\nelse:\r\n print(index1 + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n if a[i-1]%2!=a[i]%2:\r\n if i>=2:\r\n l=a[i-2]\r\n else:\r\n l=a[i+1]\r\n if l%2!=a[i-1]%2:\r\n print(i)\r\n else:\r\n print(i+1)\r\n break", "a = input()\r\nb = list(map(int,input().split()))\r\nc = []\r\nd = []\r\nfor i in b:\r\n if i/2 == i//2:\r\n c.append(i)\r\n else:\r\n d.append(i)\r\n \r\nif len(c) == 1:\r\n print(b.index(c[0])+1)\r\nelse:\r\n print(b.index(d[0])+1)\r\n \r\n", "n=int(input())\r\ns=input().split()\r\nt=\"\"\r\nfor i in range(n):\r\n if int(s[i])%2==1:\r\n t+='0'\r\n else:\r\n t+='1'\r\nk=t.count(\"1\")\r\nf=t.count(\"0\")\r\nif k>f:\r\n print(t.find('0')+1)\r\nelse:\r\n print(t.find('1')+1) ", "x=int(input())\r\ny=list(map(int,input().split()))\r\nz=[]\r\nq=[]\r\nfor i in range(x):\r\n if y[i]%2==0:\r\n z.append(y[i])\r\n else:\r\n q.append(y[i])\r\nif len(z)==1:\r\n print(y.index(z[0])+1)\r\nelse:\r\n print(y.index(q[0])+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\neven=[]\r\nuneven=[]\r\n\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even.append(i)\r\n else:\r\n uneven.append(i)\r\n#print(i, even, uneven)\r\n\r\nif len(even)<len(uneven):\r\n print(even[0]+1)\r\nelse:\r\n print(uneven[0]+1)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\ne=0\r\no=0\r\nfor i in range(0,3):\r\n if(l[i]%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\nif(e>o):\r\n for i in range(0,n):\r\n if(l[i]%2!=0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(0,n):\r\n if(l[i]%2==0):\r\n print(i+1)\r\n break", "n= int(input())\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nx1 = 0\r\nx0 = 0\r\nif a[0]%2==0:\r\n x0+=1\r\nelse:\r\n x1+=1\r\nif a[1]%2==0:\r\n x0+=1\r\nelse:\r\n x1+=1\r\nif a[2]%2==0:\r\n x0+=1\r\nelse:\r\n x1+=1\r\nif x0>=2:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\n\r\n", "n=int(input())\r\noutput=0\r\na=input().split()\r\nfor i in range(n):\r\n\ta[i]=int(a[i])\r\nfor i in range(1,n-1):\r\n\tif a[i]%2!=a[i+1]%2 and a[i]%2!=a[i-1]%2:\r\n\t\tprint(i+1)\r\n\t\toutput=1\r\n\t\tbreak\r\nif output==0 and (a[0]%2!=a[1]%2):\r\n\tprint(\"1\")\r\nelif output==0 and (a[n-1]%2!=a[1]%2):\r\n\tprint(n)", "n = int(input())\nar = list(map(int, input().split()))\nfl = (ar[1] % 2 + ar[0] % 2 + ar[2] % 2) // 2\ni = 0\nwhile True:\n if ar[i] % 2 != fl:\n print(i + 1)\n break\n i += 1", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nc = []\r\nnc = []\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n c.append(i+1)\r\n else:\r\n nc.append(i+1)\r\n \r\nif len(c) == 1:\r\n print(c[0])\r\nelse:\r\n print(nc[0])", "def find_odd_one_out(n, numbers):\r\n even_count = 0\r\n odd_count = 0\r\n even_index = -1\r\n odd_index = -1\r\n \r\n for i, num in enumerate(numbers):\r\n if num % 2 == 0:\r\n even_count += 1\r\n even_index = i\r\n else:\r\n odd_count += 1\r\n odd_index = i\r\n \r\n if even_count > 1 and odd_count == 1:\r\n return odd_index + 1\r\n elif odd_count > 1 and even_count == 1:\r\n return even_index + 1\r\n\r\n# Read input\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Find the number that differs in evenness\r\nresult = find_odd_one_out(n, numbers)\r\n\r\n# Print the result\r\nprint(result)\r\n", "n = int(input(\"\"))\r\nx = list(map(float, input().split()))\r\nodd = 0\r\neven = 0\r\nfind = 0\r\nfor i in range(n):\r\n if x[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif odd > even:\r\n for i in range(n):\r\n if x[i] % 2 == 0:\r\n find = x[i]\r\n break\r\nelse:\r\n for i in range(n):\r\n if x[i] % 2 != 0:\r\n find = x[i]\r\n break\r\nprint(x.index(find)+1)\r\n\r\n\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\neven = 0\nodd = 0\nis_even = False\nfor i in arr:\n if i % 2 == 1:\n odd += 1\n else:\n even += 1\nif even > odd:\n is_even = True\n\nfor i in range(len(arr)):\n if is_even:\n if arr[i] % 2 == 1:\n print(i + 1)\n else:\n if arr[i] % 2 == 0:\n print(i + 1)\n\n", "# _ = int(input())\n# child = [int(a) for a in input().split()]\n# total=sum(child)\n# print(total//4+1 if total%4>0 else total//4)\n# print(' '.join(input().replace(\"WUB\",' ').split()))\n\n_=int(input())\nx=[int(a) for a in input().split()]\nodd_odd=False\nif len(list(filter(lambda x: x%2==0,x)))>len(list(filter(lambda x: x%2!=0,x))):\n for number in x:\n if number%2>0:\n print(x.index(number)+1)\n break\nelse:\n for number in x:\n if number %2==0:\n print(x.index(number)+1)\n\n\n\n ", "n = int(input())\r\nnum = list(map(int, input().split()))\r\neven_count = 0\r\nfor i in range(3):\r\n if(num[i] % 2 == 0):\r\n even_count += 1\r\nif(even_count >= 2):\r\n for i in range(n):\r\n if(num[i] % 2 == 1):\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if(num[i] % 2 == 0):\r\n print(i + 1)", "\r\nlength = int(input()) \r\n \r\nnumbers = input().split()\r\nnew_arr = []\r\neven_arr = []\r\nodd_arr = []\r\n \r\nfor num in numbers:\r\n new_arr.append(int(num))\r\n\r\nfor item in new_arr:\r\n if item % 2 == 0:\r\n even_arr.append(item) \r\n else:\r\n odd_arr.append(item) \r\n\r\nif len(even_arr) == 1:\r\n print(new_arr.index(even_arr[0]) + 1)\r\nelse:\r\n print(new_arr.index(odd_arr[0]) + 1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ne1 = []\r\no1 = []\r\nfor i in range(n) :\r\n if l[i]%2==0:\r\n e1.append(i)\r\n else:\r\n o1.append(i)\r\nif len(e1)==1:\r\n print(e1[0]+1)\r\nelse:\r\n print(o1[0]+1)", "n = int(input())\r\neven = 0\r\nodd = 0\r\na = []\r\nfor x in input().split():\r\n a.append(int(x))\r\n if int(x)%2==0:\r\n even += 1\r\n else:\r\n odd += 1\r\nfor i in range(n):\r\n if ((even == 1 and a[i]%2==0) or (odd == 1 and a[i]%2!=0)):\r\n print(i+1)\r\n", "# IQ test: python\r\n\r\nn = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\n\r\ndef find_flag(lst):\r\n evens, odds = 0, 0\r\n flag = ''\r\n for i in range(3):\r\n if lst[i] % 2 == 0:\r\n evens += 1\r\n else:\r\n odds += 1\r\n if i == 2:\r\n if evens > odds:\r\n flag = 'odd'\r\n else:\r\n flag = 'even'\r\n return flag\r\n\r\n\r\ndef find_differ(lst, flag):\r\n if flag == 'even':\r\n for i in range(len(lst)):\r\n if lst[i] % 2 == 0:\r\n print(i + 1)\r\n exit()\r\n else:\r\n for i in range(len(lst)):\r\n if lst[i] % 2 != 0:\r\n print(i + 1)\r\n exit()\r\n\r\n\r\nflag = find_flag(lst)\r\n\r\nfind_differ(lst, flag)\r\n", "#A.IQ Test\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nt = 0\r\nif a[0]%2==0:\r\n t += 1\r\nelse:\r\n t -= 1\r\nif a[1]%2==0:\r\n t += 1\r\nelse:\r\n t -= 1\r\nif a[2]%2==0:\r\n t += 1\r\nelse:\r\n t -= 1\r\nif t>=1:\r\n #all other numbers are even\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n #all others are odd\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break", "x=eval(input())\r\nl=list(map(int,input().split()))\r\ni = 0\r\nev=0\r\nodd=0\r\nwhile(i<x):\r\n if (l[i]%2==0):\r\n ev+=1\r\n else:\r\n odd+=1\r\n i+=1 \r\ni=0\r\nif ev==1:\r\n while(i<x):\r\n if (l[i]%2==0):\r\n print(i+1)\r\n break\r\n i+=1\r\nelse:\r\n while(i<x):\r\n if (l[i]%2!=0):\r\n print(i+1)\r\n break\r\n i+=1\r\n", "n = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\n\r\nis_evens = [x % 2 for x in numbers]\r\nif is_evens.count(1) > is_evens.count(0):\r\n print(is_evens.index(0) + 1)\r\nelse:\r\n print(is_evens.index(1) + 1)\r\n", "import time\r\n\r\n\r\ndef identifyOddness(numArr):\r\n qeven = 0\r\n qodd = 0\r\n\r\n for x in numArr:\r\n if x % 2 == 0:\r\n qeven += 1\r\n else:\r\n qodd +=1\r\n if qeven == 1:\r\n for i, num in enumerate(numArr):\r\n if num % 2 == 0:\r\n return i\r\n elif qodd == 1:\r\n for i, num in enumerate(numArr):\r\n if num % 2 != 0:\r\n return i\r\n\r\n\r\nnums = input()\r\naNums = [int(x) for x in input().split()]\r\n\r\nstart_time = time.time()\r\np = identifyOddness(aNums)\r\nprint(p + 1)\r\n\r\n# print(\"%fs\" % (time.time() - start_time))", "import math\r\ndef solve(arr, n):\r\n\t\r\n\teven = 0\r\n\todd = 0\r\n\tfor i in range(n):\r\n\t\tif arr[i] & 1:\r\n\t\t\todd += 1\r\n\t\telse:\r\n\t\t\teven += 1\r\n\t\r\n\tif even == 1:\r\n\t\tfor i in range(n):\r\n\t\t\tif arr[i] & 1 == 0:\r\n\t\t\t\treturn i+1\r\n\telse:\r\n\t\tfor i in range(n):\r\n\t\t\tif arr[i] & 1:\r\n\t\t\t\treturn i+1\r\n\treturn -1\r\nn = int(input())\r\narr = list(map(int, input().strip().split()))\r\nresult = solve(arr, n)\r\nprint(result)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\np = -1\r\nfor i in range(len(a)):\r\n if a[i]%2 != a[0]%2:\r\n cnt += 1\r\n p = i + 1\r\nif cnt != 1:\r\n print(1)\r\nelse:\r\n print(p)", "n = int(input())\r\ns = list(map(int , input().split()))\r\nl = []\r\nr = []\r\nfor i in range(n):\r\n\tif s[i]%2 == 0:\r\n\t\tr.append(s[i])\r\n\telse:\r\n\t\tl.append(s[i])\r\n\r\nif len(r) > len(l):\r\n\tprint(s.index(l[0])+1)\r\nelse:\r\n\tprint(s.index(r[0])+1)", "def main():\r\n from sys import stdin, stdout\r\n n = int(stdin.readline())\r\n even = 0\r\n lodd=0\r\n leven =0\r\n s = map(int, stdin.readline().split())\r\n i=0\r\n for v in s:\r\n if v % 2 == 0:\r\n even = even + 1\r\n leven=i\r\n i=i+1\r\n else:\r\n even = even - 1\r\n lodd = i\r\n i = i + 1\r\n if even > 0 :\r\n stdout.write( str(lodd + 1) )\r\n else:\r\n stdout.write( str(leven + 1))\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n", "n=int(input())\r\ndata=[int(x)%2 for x in input().split()]\r\nif data[0]!=data[1]:\r\n if data[0]==data[2]:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n for i in range(2,n):\r\n if data[i]!=data[0]:\r\n print(i+1)\r\n break", "def countOdd(l):\r\n\tcount=0\r\n\tfor i in l:\r\n\t\tif i%2!=0:\r\n\t\t\tcount+=1\r\n\treturn count\r\ndef countEven(l):\r\n\tcount=0\r\n\tfor i in l:\r\n\t\tif i%2==0:\r\n\t\t\tcount+=1\r\n\treturn count\r\n\r\nn=int(input())\r\nl=list(map(int, input().split()))\r\no=countOdd(l)\r\ne=countEven(l)\r\nif o>e:\r\n\tfor i in range(n):\r\n\t\tif l[i]%2==0:\r\n\t\t\tprint(i+1)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif l[i]%2!=0:\r\n\t\t\tprint(i+1)", "n = int(input())\r\nx = list(map(int, input().split()))\r\ntwo = 0\r\nthree = 0\r\nc = []\r\nfor i in x:\r\n\tif i % 2 == 0:\r\n\t\tc += [2]\r\n\telse:\r\n\t\tc += [1]\r\nm = c.count(2)\r\nv = c.count(1)\r\nif m > v:\r\n\tprint(c.index(1) + 1)\r\nelse:\r\n\tprint(c.index(2) + 1)", "n=int(input())\r\np=0\r\nq=0\r\na=[int(x) for x in input().split(\" \")]\r\nfor i in range(n):\r\n if (a[i]%2!=0):\r\n q=q+1\r\n if (a[i]%2==0):\r\n p=p+1\r\nif(q==1):\r\n for i in range(n):\r\n if (a[i]%2!=0):\r\n print(i+1)\r\n break\r\nif(p==1):\r\n for i in range(n):\r\n if (a[i]%2==0):\r\n print(i+1)\r\n break\r\n\r\n", "n=int(input())\r\npoints = list(map(int,input().strip().split()))[:n]\r\nans=-1\r\ne=0\r\no=0\r\nfor j in range(n):\r\n if(points[j]%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\nif(e>o):\r\n ev=0\r\nelse:\r\n ev=1\r\nfor j in range(n):\r\n if(points[j]%2!=ev):\r\n ans=j+1\r\n break \r\nprint(ans)\r\n ", "n=int(input()) \r\neven=0\r\nlist=[]\r\nlist=[int(f) for f in input().split()]\r\nfor x in list:\r\n \r\n \r\n if x%2==0:\r\n even+=1\r\n odd=list.index(x)+1\r\n else:\r\n even-=1\r\n ll=list.index(x)+1 \r\n\r\n\r\nif even>0:\r\n print(ll)\r\nelse:\r\n print(odd) \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = a[0] % 2 + a[1] % 2 + a[2] % 2\r\neven = True if count <= 1 else False\r\nfor i in range(n):\r\n if even == True and a[i] % 2 != 0:\r\n print(i+1)\r\n break\r\n elif even == False and a[i] % 2 == 0:\r\n print(i+1)\r\n break", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nans=0\r\nt=(lst[0]%2==0)+(lst[1]%2==0)+(lst[2]%2==0)<=1\r\nfor i in range(n):\r\n if t^(lst[i]%2==1):\r\n ans=i+1\r\n break\r\nprint(ans)\r\n", "def iq(n,l):\r\n ec,oc=0,0\r\n f=0\r\n for i in l:\r\n if i%2==0:\r\n ec+=1\r\n elif i%2==1:\r\n oc+=1\r\n for i in l:\r\n if ec==n-1:\r\n if i%2==1:\r\n f=i\r\n elif oc==n-1:\r\n if i%2==0:\r\n f=i\r\n print(l.index(f)+1)\r\n \r\nn=int(input())\r\nl=list(map(int,input().split()))\r\niq(n,l)\r\n", "n = int(input())\r\nnum_list = list(map(int, input().split()))\r\nparity = 0\r\neven = 0\r\nodd = 0\r\nfor i in range(3):\r\n if num_list[i] % 2 == 1:\r\n odd += 1\r\n else:\r\n even += 1\r\nif odd < even:\r\n parity = 1\r\ni = 0\r\nwhile num_list[i] % 2 != parity:\r\n i += 1\r\nprint(i + 1)\r\n", "n=int(input())\r\na=[int(i)%2 for i in input().split()]\r\no=e=0\r\nfor i in range(n):\r\n if a[i]:\r\n o+=1\r\n else:\r\n e+=1\r\nif o<e:\r\n for i in range(n):\r\n if a[i]:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if not a[i]:\r\n print(i+1)\r\n break\r\n", "k = int(input())\r\nnumbers = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\nnev = -1\r\nnod = -1\r\nfor i in range(k):\r\n\tif numbers[i]%2 == 0:\r\n\t\teven += 1\r\n\t\tnev = i+1\r\n\telse:\r\n\t\todd += 1\r\n\t\tnod = i+1\r\nif even == 1:\r\n\tprint(nev)\r\nelse:\r\n\tprint(nod)", "a = int(input())\r\nb = [int(num) for num in input().split()]\r\nc = 0\r\nd = 0\r\nq = 0\r\nw = 0\r\nfor i in range(len(b)):\r\n if b[i] % 2 == 0:\r\n c += 1\r\n q = i+1\r\n if b[i] %2 != 0:\r\n d += 1\r\n w = i+1\r\nif c == 1:\r\n print(q)\r\nelif d == 1:\r\n print(w)", "#cook your dish here\n\nn = int(input())\na1 = list(map(int, input().split()))\n\nfe = -1\nfo = -1\nte = 0\nto = 0\nfor i in range(n):\n if a1[i]%2 == 0:\n te += 1\n fe = i\n else:\n to += 1\n fo = i\n\nans = fe +1 if te == 1 else fo +1\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncount_even = []\r\ncount_odd = []\r\nfor i in a:\r\n if i%2 ==0:\r\n count_even.append(i)\r\n else:\r\n count_odd.append(i)\r\n if len(count_odd) >= 1 and len(count_even) >= 1:\r\n if len(count_even) > len(count_odd):\r\n print(a.index(count_odd[0])+1)\r\n break\r\n if len(count_even) < len(count_odd):\r\n print(a.index(count_even[0])+1)\r\n break", "n = int(input())\r\ns = list(map(int,input().split()))\r\nchet,nechet = 0,0\r\nfor i in range(n):\r\n if s[i]%2 == 0:\r\n chet += 1\r\nif chet > (len(s)- chet):\r\n for i in range(n):\r\n if s[i]%2 != 0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if s[i]%2 == 0:\r\n print(i+1)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = []\r\n\r\nfor i in range(n): b.append(a[i] % 2)\r\n\r\nif b.count(1) > b.count(0): print(b.index(0) + 1)\r\nelse: print(b.index(1) + 1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Count the number of even and odd numbers\r\neven_count = 0\r\nodd_count = 0\r\nlast_even = 0\r\nlast_odd = 0\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n last_even = i + 1\r\n else:\r\n odd_count += 1\r\n last_odd = i + 1\r\n\r\n# Determine the number that differs in evenness\r\nif even_count > 1:\r\n print(last_odd)\r\nelse:\r\n print(last_even)\r\n\r\n", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\ne,o=0,0\r\neans,oans=-1,-1\r\nfor i in range(0,n):\r\n if(li[i]%2==0):\r\n e=e+1\r\n if(e==1):\r\n eans=i+1\r\n \r\n else:\r\n o=o+1\r\n if(o==1):\r\n oans=i+1 \r\nif(e==1):\r\n print(eans)\r\nelse:\r\n print(oans)", "# your code goes here\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n even = {}\r\n odd = {}\r\n\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n even[i + 1] = a[i]\r\n else:\r\n odd[i + 1] = a[i]\r\n\r\n if len(even) == 1:\r\n it = iter(even.items())\r\n print(next(it)[0])\r\n else:\r\n it = iter(odd.items())\r\n print(next(it)[0])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nm = list(map(int, input().split()))\nres = 0\nk = 0\nfor i in range(3):\n if m[i] % 2 == 0:\n k += 1\n\nif k > 1:\n for item in m:\n if item % 2 != 0:\n res = item\nelse:\n for item in m:\n if item % 2 == 0:\n res = item\nprint(m.index(res) + 1)\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns1=[]\r\ns2=[]\r\nfor i in range(n):\r\n if s[i]%2!=0:\r\n s1.append(s[i])\r\n else:\r\n s2.append(s[i])\r\nif len(s1)==1:\r\n print(s.index(s1[0])+1)\r\nif len(s2)==1:\r\n print(s.index(s2[0])+1)", "n = int(input())\nev=od=0\na = list(map(int,input().split()))\nfor i in range(len(a)):\n if(a[i]%2):od+=1\n else : ev+=1\n if(od>1)and ev:\n break\n if(ev>1)and od:\n break\nfor i in range(len(a)):\n if(ev==1 and not a[i]%2):\n print(i+1)\n break;\n elif od==1 and a[i]%2:\n print(i+1)\n break", "n = int(input())\r\nl = list(map(int,input().split()))\r\nc1 = 0\r\nc2 = 0\r\nfor i in l:\r\n if i % 2 == 0:\r\n c1+=1\r\n else:\r\n c2+=1\r\n \r\nfor i in range(len(l)-1,-1,-1):\r\n if l[i] % 2 == 0:\r\n lasteven = i\r\n break\r\nfor i in range(len(l)-1,-1,-1):\r\n if l[i] % 2 != 0:\r\n lastodd = i\r\n break\r\nif c1 == 1:\r\n print(lasteven + 1)\r\nelse:\r\n print(lastodd + 1)\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nc=[]\r\nd=[]\r\ni=0\r\nwhile i<len(b):\r\n if int(str(b[i]))%2== 0:\r\n c+=[i+1]\r\n else:\r\n d+=[i+1]\r\n i+=1\r\nif len(c)==1:\r\n print(int(c[0]))\r\nelse:\r\n print(int(d[0]))\r\n", "n = int(input())\nE = list(map(int, input().split()))\ne0 = e1 = o0 = o1 = 0\nfor i in range(0, len(E)):\n if(E[i] % 2 == 0):\n e0 += 1\n e1 = i\n else:\n o0 += 1\n o1 = i\nif(o0 == 1):\n print(o1 + 1)\nelse:\n print(e1 + 1)\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nev=[]\r\nod=[]\r\nfor i in range(n):\r\n if(arr[i]%2==0):\r\n ev.append(i+1)\r\n else:\r\n od.append(i+1)\r\nif(len(ev)==1):\r\n print(ev[0])\r\nelse:\r\n print(od[0])", "a=int(input())\nb=[int(num) for num in input().split(\" \")]\nli=[]\nli1=[]\nfor i in b:\n if i%2==0:\n li.append(i)\n else:\n li1.append(i)\nif len(li)>len(li1):\n print(b.index(li1[0])+1)\nelse:\n print(b.index(li[0])+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nodd=0\r\nodd_list=[]\r\neven=0\r\np=0\r\neven_list=[]\r\nfor i in l:\r\n if i%2==0:\r\n even+=1\r\n even_list.append(i)\r\n else:\r\n odd+=1\r\n odd_list.append(i)\r\nif odd>even:\r\n p=even_list[0]\r\n print(l.index(p)+1)\r\nelse:\r\n p=odd_list[0]\r\n print(l.index(p)+1)\r\n ", "n = int(input())\r\nl = [int(i)%2 for i in input().split()]\r\nif sum(l) > 1:\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 18 15:50:10 2022\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\na = int(input())\r\nb = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(0,3):\r\n c+=b[i]%2\r\nif c>1:\r\n for i in range(0,a):\r\n if b[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(0,a):\r\n if b[i]%2==1:\r\n print(i+1)", "n=int(input())\r\n*a,=list(map(int,input().split()))\r\nt=0;y=0\r\n\r\nfor i in range(n):\r\n if a[i]%2==0:t+=1\r\n else:y+=1\r\nif t<y:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n\r\nelse:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nzero = 0\r\none = 0\r\nfor i in range(3):\r\n if a[i]%2 == 0:\r\n zero += 1\r\n else:\r\n one += 1\r\nif zero == 3:\r\n for i in range(n):\r\n if a[i]%2 == 1:\r\n print(i+1)\r\n break\r\nelif one == 3:\r\n for i in range(n):\r\n if a[i]%2 == 0:\r\n print(i+1)\r\n break\r\nelif zero == 2:\r\n for i in range(3):\r\n if a[i]%2 == 1:\r\n print(i+1)\r\n break\r\nelif one == 2:\r\n for i in range(3):\r\n if a[i]%2 == 0:\r\n print(i+1)\r\n break", "n = int(input())\r\ndef new(x):\r\n x %= 2\r\n return x\r\nlst = list(map(new, list(map(int, input().split()))))\r\nif lst.count(1) == 1:\r\n print(lst.index(1) + 1)\r\nelse:\r\n print(lst.index(0) + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na,b=[],[]\r\nfor x in l:\r\n if x%2==0:\r\n a.append(x)\r\n else:\r\n b.append(x)\r\nif len(a)>len(b):\r\n c=b[0]\r\nelse:\r\n c=a[0]\r\nprint(l.index(c)+1) \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnch = 0\r\ncch = 0\r\nfor i in a:\r\n if i % 2 == 0:\r\n cch += 1\r\n else:\r\n cnch += 1\r\n if (cch == 2) or (cnch == 2):\r\n break\r\nif cch > cnch:\r\n a.insert(0, 0)\r\n for i in a:\r\n if i % 2 != 0:\r\n print(a.index(i))\r\n break\r\nelse:\r\n a.insert(0, 1)\r\n for i in a:\r\n if i % 2 == 0:\r\n print(a.index(i))\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\ninput()\r\neveness_li = list(map(lambda x: int(x) % 2, input().strip().split()))\r\nprint(eveness_li.index(Counter(eveness_li).most_common()[1][0]) + 1)", "\r\nn = int(input())\r\narr = [int(x) % 2 for x in input().split()]\r\na = arr.count(1)\r\nb = arr.count(0)\r\nif a == 1:\r\n print(arr.index(1)+1)\r\nelse:\r\n print(arr.index(0)+1)", "n = int(input())\nvals = list(map(int, input().split(\" \")))\n\ndic = {0:0,1:0}\nfor i in range (3):\n dic[vals[i]%2]+=1\nif dic[0]>dic[1]:\n r = 1\nelse:\n r=0\nfor i in range (len(vals)):\n if vals[i]%2 == r:\n print(i+1)\n", "n = int(input())\r\ns = input().split()\r\nchet = []\r\nnechet = []\r\nfor i in s:\r\n if int(i) % 2 == 0:\r\n chet.append(i)\r\n else:\r\n nechet.append(i)\r\nif len(chet) > len(nechet):\r\n print(s.index(nechet[0])+1)\r\nelse:\r\n print(s.index(chet[0])+1)\r\n", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nevens = []\r\nodds = []\r\n\r\nfor e, x in enumerate(lst):\r\n if x % 2 == 0:\r\n evens.append(e + 1)\r\n else:\r\n odds.append(e + 1)\r\n\r\nif len(evens) < len(odds):\r\n print(evens[0])\r\nelse:\r\n print(odds[0])\r\n", "n = int(input())\r\nbrojevi = input().split(' ')\r\n\r\nparni_ind = []\r\nneparni_ind = []\r\ncounter = 1\r\n\r\nfor broj in brojevi:\r\n if(int(broj) % 2 == 0):\r\n parni_ind.append(counter)\r\n else:\r\n neparni_ind.append(counter)\r\n counter += 1\r\n\r\nif(len(parni_ind) == 1):\r\n print(parni_ind[0])\r\nelse:\r\n print(neparni_ind[0])\r\n", "n = int(input())\r\narr = [int(i) % 2 for i in input().split()]\r\ns = sum(arr)\r\nif (s == 1):\r\n for i in range(len(arr)):\r\n if (arr[i] == 1):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(arr)):\r\n if (arr[i] == 0):\r\n print(i+1)\r\n break\r\n", "n=int(input())\r\nd=list(map(int, input().split()))\r\nif d[0]%2==d[1]%2:\r\n s=d[0]%2\r\n for i in range(2, n):\r\n if d[i]%2!=s%2:\r\n print(i+1)\r\n break\r\nelse:\r\n if d[0]%2==d[2]%2:\r\n print(2)\r\n else:\r\n print(1)\r\n\r\n", "n=int(input())\r\nnu=[int(x) for x in input().split()]\r\n\r\ni=[x%2 for x in nu]\r\nif i.count(1)>i.count(0):\r\n print(i.index(0)+1)\r\nelse:\r\n print(i.index(1)+1)", "def solve():\n even_count, odd_count = 0, 0\n even_index, odd_index = 0, 0\n\n n = int(input())\n s = list(map(int, input().split()))\n\n for i in range(n):\n if int(s[i]) % 2 == 0:\n even_count += 1\n even_index = i + 1\n elif int(s[i]) % 2 == 1:\n odd_count += 1\n odd_index = i + 1\n\n if odd_count == 1:\n print(odd_index)\n else:\n print(even_index)\n\n\nif __name__ == '__main__':\n solve()\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = []\r\nfor i in range(n):\r\n if x[i] % 2 == 0:\r\n y.append(x[i])\r\nif len(y) == 1:\r\n print(x.index(y[0])+1)\r\nelse:\r\n for j in range(n):\r\n if x[j] % 2 != 0:\r\n print(j+1)", "n = input()\r\nstr1 = input()\r\nlist1 = [int(k) for k in str1.split()]\r\nlist2 = list(map(lambda x : x%2,list1))\r\nif list2.count(1) > list2.count(0):\r\n print(list2.index(0)+1)\r\nelse:\r\n print(list2.index(1)+1)", "n = int(input())\r\nremainder = []\r\nfor i in range(n):\r\n s = list(map(int, input().split()))\r\n for j in range(len(s)):\r\n r = s[j] % 2\r\n remainder.append(r)\r\n if remainder.count(1) > remainder.count(0):\r\n print(remainder.index(0)+1)\r\n else:\r\n print(remainder.index(1)+1)\r\n break", "odd=[]\r\neven=[]\r\nn=int(input())\r\nm=list(map(int,input().split(' ')))\r\nfor i in range(n):\r\n if (m[i]%2)==0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\nif len(even)==1:\r\n print(even[0])\r\nelse:\r\n print(odd[0])\r\n", "t=int(input())\r\nL=[int(i) for i in input().split()]\r\nD={}\r\nfirst1=-1\r\nfirst2=-1\r\nfor i in range(len(L)):\r\n if L[i]%2==0:\r\n if first2==-1:\r\n first2=i\r\n else:\r\n if first1==-1:\r\n first1=i\r\nc=0\r\nfor i in range(3):\r\n if(L[i]%2==0):\r\n c+=1;\r\nif c>=2:\r\n print(first1+1)\r\nelse:\r\n print(first2+1)\r\n \r\n ", "x, y, z = int(input()), [int(_) for _ in input().split()], {}\r\nfor _ in range(x):\r\n if y[_] % 2 == 0:\r\n y[_] = 2\r\n else:\r\n y[_] = 1\r\n if z.get(y[_]) == None:\r\n z[y[_]] = 1\r\n else:\r\n z[y[_]] += 1\r\nif z[2] > z[1]:\r\n print(y.index(1) + 1)\r\nelse:\r\n print(y.index(2) + 1)", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\neven = [index for (index,value) in enumerate(a) if (value % 2) == 0]\r\nodd = [index for (index,value) in enumerate(a) if (value % 2) == 1]\r\n\r\nif len(even) == 1:\r\n print(even[0]+1)\r\nelse:\r\n print(odd[0]+1)", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\neven = 0\r\nodd = 0\r\nfirstEven = -100\r\nfirstOdd = -100\r\n\r\n\r\nfor i in range(0, len(a)):\r\n if a[i]%2 == 0:\r\n if firstEven == -100:\r\n firstEven = i\r\n even+=1\r\n else:\r\n if firstOdd == -100:\r\n firstOdd = i\r\n odd+=1\r\n\r\nif even > odd:\r\n print(firstOdd+1)\r\nelse:\r\n print(firstEven+1)", "n = int(input())\r\ns = input().split()\r\ns1 = list(map(int, s))\r\nc = 0\r\nc1 = 0\r\nfor i in s1:\r\n if(i % 2 == 0):\r\n if(c == 0):\r\n c += 1\r\n i1 = s1.index(i)\r\n else:\r\n c += 1\r\n \r\n else:\r\n if(c1 == 0):\r\n c1 += 1\r\n i2 = s1.index(i)\r\n else:\r\n c1 += 1\r\nif(c == 1):\r\n print(i1+1)\r\nelse:\r\n print(i2+1)", "a = int(input())\r\nf = [int(k) for k in input().split()]\r\nb = 0\r\nc = 0\r\nd = 0\r\ne = 0\r\nfor i in f:\r\n if i % 2 == 0:\r\n b += 1\r\n c = i\r\n else:\r\n d += 1\r\n e = i\r\nif b == 1:\r\n print(f.index(c) + 1)\r\nelse:\r\n print(f.index(e) + 1)", "n=int(input())\r\nx=0\r\ny=0\r\nz=0\r\nc=0\r\na=list(map(int, input().split()))\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n x=x+1 \r\n c=i+1\r\n else:\r\n y=y+1\r\n z=i+1\r\nif x>y:\r\n print(z)\r\nelse:\r\n print(c)\r\n", "n = int(input())\r\na = input().split()\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nchet = 0\r\nno_chet =0\r\nfor i in a:\r\n if i%2==0:\r\n chet+=1\r\n else:\r\n no_chet+=1\r\nif chet>no_chet:\r\n for i in a:\r\n if (i%2):\r\n print(a.index(i)+1)\r\nelse:\r\n for i in a:\r\n if i%2==0:\r\n print(a.index(i)+1)", "num=int(input())\r\nn= list(map(int,input().split()))\r\nev=[]\r\nod=[]\r\nfor l in range(num):\r\n if n[l]%2==0:\r\n ev.append(l)\r\n\r\n else:\r\n od.append(l)\r\n if len(od) > 1 and len(ev) > 0:\r\n print(ev[0] + 1)\r\n break\r\n elif len(ev)>1 and len(od)>0:\r\n print(od[0]+1)\r\n break", "input()\nes = [int(e) % 2 == 0 for e in input().split()]\nif (es[0] & es[1]) | (es[1] & es[2]) | (es[2] & es[0]):\n es = [not e for e in es]\nfor i, e in enumerate(es):\n if e:\n print(i + 1)\n", "from math import ceil\n\nn=int(input())\nvals=[int(i) for i in input().split(\" \")]\n\n\nif(vals[0]%2==0 and vals[1]%2==0):\n for i in range(2,n):\n # print(\"here\")\n if(vals[i]%2==1):\n print(i+1)\n break\nelif(vals[0]%2!=0 and vals[1]%2!=0):\n for i in range(2,n):\n if(vals[i]%2==0):\n print(i+1)\n break\nelse:\n if(vals[0]%2==vals[2]%2):\n print(2)\n else:\n print(1)", "#25A-IQ test\r\n\r\nn=int(input())\r\nlist1=input().split(' ')\r\nfor i in range(0,n):\r\n list1[i]=str(int(list1[i]) % 2)\r\nx=list1.count('0')\r\nif x == 1:\r\n print(list1.index('0')+1)\r\nelse:\r\n print(list1.index('1')+1)\r\n \r\n", "input()\r\nn=[int(a)%2 for a in input().split()]\r\nprint(n.index(sum(n)==1)+1)", "n=int(input())\r\nl_odd=[]\r\nl_even=[]\r\nL=input().split()\r\nfor i in range(n):\r\n if int(L[i])%2==1:\r\n l_odd.append(i+1)\r\n else:\r\n l_even.append(i+1)\r\n if len(l_odd)==1 and len(l_even)>1:\r\n answer=l_odd[0]\r\n elif len(l_odd)>1 and len(l_even)==1:\r\n answer=l_even[0]\r\nprint(answer)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Apr 30 10:23:32 2017\n\n@author: lawrenceylong\n\"\"\"\n\na = int(input())\nb = list(map(int,input().split()))\n\na = [num%2 for num in b]\nprint(a.index(0)+1) if a.count(1)>a.count(0) else print(a.index(1)+1)\n", "def find(s,n):\r\n c = 0\r\n l = 0\r\n for i in range(n):\r\n if(s[i] % 2 == 0):\r\n c += 1\r\n else:\r\n l += 1\r\n for i in range(n):\r\n if(s[i] % 2 == 0):\r\n if(l >= 2):\r\n return i + 1\r\n else:\r\n if(c >= 2):\r\n return i + 1\r\n\r\nn = int(input())\r\ns = input().split(\" \")\r\nfor i in range(n):\r\n s[i] = int(s[i])\r\n \r\nprint(find(s,n))\r\n \r\n \r\n\r\n", "input()\na = [int(x) for x in input().split()]\no = sum([x%2 == 1 for x in a])\ne = len(a) - o\nif o == 1:\n for i in range(len(a)):\n if a[i] % 2 == 1:\n print(i+1)\n break;\nelse:\n for i in range(len(a)):\n if a[i] % 2 == 0:\n print(i+1)\n break;\n \n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * len(a)\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n b[i] = 1\r\n\r\nx = b.count(0)\r\ny = b.count(1)\r\nif x > y:\r\n print(b.index(1) + 1)\r\nelse:\r\n print(b.index(0) + 1)\r\n", "x=int(input());l=list(map(int,input().split()));even=0;odd=0\r\no=0;e=0\r\nfor ii in l:\r\n if ii%2==0: even+=1 ; e=ii\r\n else: odd+=1 ; o=ii\r\nif even>odd: x=l.index(o) ; print(x+1)\r\nelse: x=l.index(e) ; print(x+1)\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n b.append(a[i] % 2)\r\nfor i in range(len(b)-1):\r\n if b[i] != b[i+1] and b.count(b[i]) == 1:\r\n print(i + 1)\r\n exit()\r\nprint(len(b))\r\n", "n=eval(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile(i<n-2):\r\n if((l[i]%2==0 and l[i+1]%2==1 and l[i+2]%2==1) or (l[i]%2==1 and l[i+1]%2==0 and l[i+2]%2==0) ):\r\n print(i+1)\r\n elif((l[i]%2==1 and l[i+1]%2==0 and l[i+2]%2==1) or (l[i]%2==0 and l[i+1]%2==1 and l[i+2]%2==0) ):\r\n print(i+2)\r\n elif((l[i]%2==1 and l[i+1]%2==1 and l[i+2]%2==0) or (l[i]%2==0 and l[i+1]%2==0 and l[i+2]%2==1) ):\r\n print(i+3)\r\n i+=3 \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 22 07:59:38 2020\r\n\r\n@author: Morris\r\n\"\"\"\r\n\r\nn=int(input())\r\nlst=[int(s) for s in input().split()]\r\nnum=len(lst)\r\nfor i in range(num):\r\n if lst[i]%2==0:\r\n lst[i]=0\r\n else:\r\n lst[i]=1\r\nif sum(lst)==1:\r\n print(lst.index(1)+1)\r\nelse:\r\n print(lst.index(0)+1)\r\n", "def sol():\r\n n=int(input())\r\n l=list(map(int,input().split(\" \")))\r\n le=[]\r\n lo=[]\r\n e=0\r\n o=0\r\n for i in range(n):\r\n if l[i]%2==0:\r\n le.append(l[i])\r\n e+=1\r\n else:\r\n lo.append(l[i])\r\n o+=1\r\n if (e==1 and o>1) :\r\n print(l.index(le[0])+1)\r\n break\r\n elif (o==1 and e>1):\r\n print(l.index(lo[0])+1)\r\n break\r\n \r\n\r\nsol()", "input()\r\nl=[int(x)%2 for x in input().split()]\r\n#print(sum(l))\r\nprint(l.index(sum(l)==1)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\nfor i in range(0,len(a)):\r\n if a[i] % 2 == 0:\r\n even+=1\r\n c = i\r\n else:\r\n odd+=1\r\n d = i\r\nprint(d+1 if odd<even else c+1)", "n = input()\r\nnums = list(map(int,input().split()))\r\nnuevo = [0 if num % 2 == 0 else 1 for num in nums]\r\n\r\n\r\nif nuevo.count(1) == 1:\r\n print(nuevo.index(1) + 1)\r\nelse:\r\n print(nuevo.index(0) + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(a[0]%2==0 and a[n-1]%2==0):\r\n for i in range(n):\r\n if(a[i]%2==1):\r\n print(i+1)\r\n break\r\nelif(a[0]%2==1 and a[n-1]%2==1):\r\n for i in range(n):\r\n if(a[i]%2==0):\r\n print(i+1)\r\n break\r\nelif(a[0]%2==1 and a[n-1]%2==0):\r\n if(a[1]%2==0):\r\n print(1)\r\n if(a[1]%2==1):\r\n print(n)\r\nelif(a[0]%2==0 and a[n-1]%2==1):\r\n if(a[1]%2==0):\r\n print(n)\r\n if(a[1]%2==1):\r\n print(1)\r\n\r\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\nL1=[]\r\nfor i in L:\r\n if i%2==0:\r\n L1.append(1)\r\n else:\r\n L1.append(0)\r\nif L1.count(1)==1:\r\n print(L1.index(1)+1)\r\nelif L1.count(0)==1:\r\n print(L1.index(0)+1)\r\n", "x, numbers = input(), list(map(int, input().split()))\r\nif numbers[0] % 2 == 0 and (numbers[1] % 2 == 0 or numbers[-1] % 2 == 0):\r\n for i in numbers:\r\n if i % 2 != 0:\r\n print(numbers.index(i)+1)\r\n break\r\nelif numbers[0] % 2 != 0 and (numbers[1] % 2 == 0 and numbers[-1] % 2 == 0):\r\n for i in numbers:\r\n if i % 2 != 0:\r\n print(numbers.index(i)+1)\r\n break\r\nelse:\r\n for i in numbers:\r\n if i % 2 == 0:\r\n print(numbers.index(i)+1)\r\n break", "n = int(input())\r\na = input().split(' ')\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nk = [0, 0]\r\nfor i in range(n):\r\n k[a[i] % 2] += 1\r\nif k[0] == 1:\r\n i = 0\r\nelse:\r\n i = 1\r\nfor j in range(n):\r\n if a[j] % 2 == i:\r\n print(j + 1)", "t = int(input())\r\na = list(input().split())\r\nfor i in range(len(a)) :\r\n a[i] = int(a[i])\r\nec = oc = 0\r\nk = 0\r\nfor i in range(t) :\r\n if(a[i]%2==0) :\r\n ec += 1\r\n else :\r\n oc += 1\r\nif(ec==t-1) :\r\n for i in range(t) :\r\n if(a[i]%2!=0) :\r\n k = i+1\r\n break\r\nelif(oc==t-1) :\r\n for i in range(t) :\r\n if(a[i]%2==0) :\r\n k = i+1\r\n break\r\nprint(k)\r\n\r\n \r\n", "a = [0] * 2\r\npos = [0] * 2\r\n \r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n \r\nfor n, i in enumerate(arr):\r\n a[i%2] += 1\r\n pos[i%2] = n+1\r\nif a[0] > 1:\r\n print(pos[1])\r\nelse:\r\n print(pos[0])", "num = int(input())\r\nlist_num = list(map(int,input().split()))\r\nans = []\r\nfor i in list_num:\r\n if i % 2 == 0:\r\n ans.append(0)\r\n else:\r\n ans.append(1)\r\nodd = ans.count(1) \r\neven = ans.count(0)\r\nif odd == 1:\r\n print(ans.index(1)+1)\r\nelse:\r\n print(ans.index(0)+1)", "#25a - iq test\r\nn = int(input())\r\nlistOfNumbers = list(map(int,input().split()))\r\nevenCount = 0\r\noddCount = 0\r\nfor number in listOfNumbers:\r\n if number % 2 == 0: #even\r\n evenCount += 1\r\n else: #odd\r\n oddCount += 1\r\nif evenCount > 1: # need to find the odd number\r\n for number in listOfNumbers:\r\n if number % 2 == 0:\r\n continue\r\n else:\r\n print(listOfNumbers.index(number) + 1)\r\nelse:\r\n for number in listOfNumbers:\r\n if number % 2 == 0:\r\n print(listOfNumbers.index(number) + 1)\r\n else:\r\n continue\r\n", "n = int(input())\r\nm = [int(x) for x in input().split()]\r\nlst = [s % 2 for s in m]\r\nif lst.count(1) == 1:\r\n print(lst.index(1) + 1)\r\nelse:\r\n print(lst.index(0) + 1)", "n = int(input(''))\r\na = input('')\r\nx = a.split()\r\neven = []\r\nodd = []\r\ni = 0\r\nflagodd = 0\r\nflageven = 0\r\nwhile (i < n):\r\n if (int(x[i]) % 2 == 0):\r\n even.append(x[i])\r\n flageven = i\r\n i += 1\r\n else:\r\n odd.append(x[i])\r\n flagodd = i\r\n i += 1\r\nif (len(even) == 1):\r\n print(flageven + 1)\r\nelif (len(odd) == 1):\r\n print(flagodd + 1)\r\n", "n=int(input())\r\ni=lambda:map(int,input().split())\r\na=list(i())\r\neven=[]\r\nodd=[]\r\nfor j in range(n):\r\n if (a[j]%2==0):\r\n even.append(a[j])\r\n else:\r\n odd.append(a[j])\r\nif(len(even)>len(odd)):\r\n print (a.index(odd[0])+1)\r\nelse:\r\n print (a.index(even[0])+1)", "def iq_test():\n\n n = int(input())\n l = input().split()\n\n aux = 0\n even = 0\n f_even = 0\n odd = 0\n f_odd = 0\n for i in l:\n aux += 1\n if(int(i)%2==0):\n even+=1\n f_even = aux\n else:\n odd+=1\n f_odd = aux\n\n if(odd>1 and f_even>0):\n print(f_even)\n return\n elif(even>1 and f_odd>0):\n print(f_odd)\n return\n\niq_test()\n\t\t \t\t \t\t\t \t \t \t \t\t\t \t\t", "n=int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nf = a[0] % 2\r\ns = a[1] % 2\r\nt = a[2] % 2\r\ntot = f+s+t\r\nif tot >= 2:\r\n ens = 1\r\nelse:\r\n ens = 0\r\nfor i in range(len(a)):\r\n if a[i]%2 != ens:\r\n print(i+1)\r\n break\r\n \r\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\ny = 0\r\nc = 0\r\nfor i in range(3):\r\n if b[i] % 2 == 0:\r\n y += 1\r\n else:\r\n c += 1\r\nif c >= 2:\r\n for i in range(a):\r\n if b[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(a):\r\n if b[i] % 2 != 0:\r\n print(i + 1)\r\n break", "n = input()\nnumber_list = [int(x) for x in input().split(' ')]\n\npair = (number_list[0]%2 == 0 and number_list[1]%2 == 0) or\\\n (number_list[0]%2 == 0 and number_list[2]%2 == 0) or \\\n (number_list[1]%2 == 0 and number_list[2]%2 == 0)\n\nfor i, number in enumerate(number_list):\n if pair and number%2 != 0:\n print(i+1)\n break\n elif not pair and number%2 == 0:\n print(i+1)\n break\n\t\t\t\t\t \t \t\t\t\t\t \t\t \t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 15:33:18 2022\r\n\r\n@author: 86158\r\n\"\"\"\r\n\r\nn = int(input())\r\nlist0 = [int(i) for i in input().split()]\r\nlist1 = []\r\nfor i in range(n):\r\n list1.append(list0[i]%2)\r\na = list1.count(0)\r\nif a == 1:\r\n print(list1.index(0)+1)\r\nelse:\r\n print(list1.index(1)+1)", "n=int(input())\r\nev,od,x,y=0,0,0,0\r\n\r\n\r\nnum=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(num[i]%2==0):\r\n ev+=1\r\n x=i+1\r\n else:\r\n od+=1\r\n y=i+1\r\nif ev>od:\r\n print(y)\r\nelse:\r\n print(x)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\neven, lastodd, lasteven = 0, 0, 0\r\n\r\nfor i in range(1, n+1):\r\n if numbers[i-1] % 2 == 0:\r\n even += 1\r\n lasteven = i\r\n else:\r\n even -= 1\r\n lastodd = i\r\n\r\nif even > 0:\r\n print(lastodd)\r\nelse:\r\n print(lasteven)\r\n", "n = int(input())\r\nnum = [int(x) for x in input().split()]\r\nans1 = 0\r\np1 = 0\r\nans2 = 0\r\np2 = 0\r\nfor i in range(n):\r\n if (num[i] % 2 == 0):\r\n ans1 += 1\r\n p1 = i\r\n else:\r\n ans2 += 1\r\n p2 = i \r\nif (ans1 == 1):\r\n print(p1 + 1)\r\nif (ans2 == 1):\r\n print(p2 + 1)\r\n", "x = int(input())\r\n\r\nvalues = list(map(int, input().split()))\r\nevens = 0\r\nodds = 0\r\n\r\nfor i in values:\r\n if i%2 == 0:\r\n extraNumEven = i\r\n evens += 1\r\n else:\r\n extraNumOdd = i\r\n odds += 1\r\n\r\nif evens > odds:\r\n print(values.index(extraNumOdd)+1)\r\nelse: \r\n print(values.index(extraNumEven)+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncodd = 0\r\nceven = 0\r\nptodd = -1\r\npteven = -1\r\nfor i in range(n):\r\n if arr[i]%2 == 0:\r\n ceven += 1\r\n pteven = i\r\n else:\r\n codd += 1\r\n ptodd = i\r\n\r\nif ceven == 1:\r\n print(pteven+1)\r\nelse:\r\n print(ptodd+1)", "# Paulo Pacitti\n# RA 185447\n\nn = int(input())\nnumbers = list(map(lambda e: int(e), input().split(' ')))\n\neven = []\nodd = []\nfor n in numbers:\n if n % 2 == 0:\n even.append(n)\n else:\n odd.append(n)\n\nif len(even) > len(odd):\n print(numbers.index(odd[0]) + 1)\nelse:\n print(numbers.index(even[0]) + 1)\n\t\t \t \t\t\t \t \t\t\t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\ncheck=[0,0]\r\nfor i in range(3):\r\n\tif a[i]%2==0:\r\n\t\tcheck[0]+=1\r\n\telse:\r\n\t\tcheck[1]+=1\r\nif check[0]>1:\r\n\tcheck=\"even\"\r\nelse:\r\n\tcheck=\"odd\"\r\nfor i in range(n):\r\n\tif check==\"even\":\r\n\t\tif a[i]%2==1:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif a[i]%2==0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=0\r\nc=0\r\nfor i in range(0,n):\r\n if a[i]//2==a[i]/2:\r\n if b==0:\r\n p=i+1\r\n b+=1\r\n else:\r\n if c==0:\r\n q=i+1\r\n c+=1\r\nif b==1:\r\n print(int(p))\r\nelse:\r\n print(int(q))", "n=int(input())\r\nevenc=0\r\noddc=0\r\nli=list(int(x)%2 for x in input().split())\r\nprint(li.index(sum(li)==1)+1)\r\n\r\n\r\n \r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = []\r\nc = []\r\nfor e in a:\r\n if e%2 == 0:\r\n b.append(e)\r\n else:\r\n c.append(e)\r\nif len(b) == 1:\r\n print(a.index(b[0]) + 1)\r\nelse:\r\n print(a.index(c[0]) + 1)\\\r\n", "d = int(input())\r\ne = [int(x) for x in input().split()]\r\nl = 0\r\nk = 0\r\nfor i in e:\r\n if i%2!=0:\r\n l+=1\r\n else:\r\n k+=1\r\nif k>l:\r\n for i in e:\r\n if i%2!=0:\r\n print(e.index(i)+1)\r\nelse:\r\n for i in e:\r\n if i%2==0:\r\n print(e.index(i)+1)\r\n \r\n \r\n", "k=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nc=[]\r\ncount=0\r\nsum=0\r\nfor i in range(k):\r\n if(a[i]%2==0):\r\n count+=1\r\n b.append(i+1)\r\n else:\r\n sum+=1\r\n c.append(i+1)\r\nif(count>sum):\r\n print(c[0])\r\nelse:\r\n print(b[0])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nx = [i % 2 == 0 for i in a]\r\n\r\ne = sum([1 for i in x if i])\r\no = sum([1 for i in x if not i])\r\n\r\nr = 0\r\n\r\nfor i in range(n):\r\n if e < o:\r\n if x[i]:\r\n r = i + 1\r\n break\r\n else:\r\n if not x[i]:\r\n r = i + 1\r\n break\r\n\r\nprint(r)", "num=int(input())\r\na=[]\r\neven=[]\r\nodd=[]\r\na=input().split()\r\nfor i in range(num):\r\n if int(a[i])%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(odd)>len(even):\r\n for i in even:\r\n print(i+1)\r\nelse:\r\n for i in odd:\r\n print(i+1)\r\n ", "n = int(input())\r\nai = list(map(int,input().split()))\r\nai = [ai[i] % 2 for i in range(n)]\r\nif sum(ai) > 1:\r\n print(ai.index(0) + 1)\r\nelse:\r\n print(ai.index(1) + 1)\r\n", "n = int(input())\r\na = list(map(lambda i: 1 if int(i) & 1 else 0, input().split()))\r\nodd = a[:3].count(1)\r\n\r\nif odd > 1:\r\n for i in range(n):\r\n if not a[i]:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i]:\r\n print(i + 1)\r\n break\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn = inp()\r\nl = inlt()\r\n\r\nle = 0\r\nlo = 0\r\ne=0\r\no=0\r\nfor i in range(0,n):\r\n if l[i]%2==0:\r\n le = i\r\n e+=1\r\n else:\r\n lo = i\r\n o+=1\r\n\r\nif e == 1:\r\n print(le+1)\r\nelse:\r\n print(lo+1)\r\n\r\n", "n=int(input())\r\nnum=[int(x) for x in input().split()]\r\nmod=[]\r\na=0\r\nfor i in range(n):\r\n mod.append(num[i]%2)\r\nfor i in range(n):\r\n a+=mod[i]\r\nif a>1:\r\n for i in range(n):\r\n if mod[i]==0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if mod[i]==1:\r\n print(i+1)", "n = int(input())\r\nst = list(map(int,input().split()))\r\na,b=0,0\r\nfor i in range(n):\r\n if(st[i]%2==0):\r\n a+=1\r\n x=i\r\n else:\r\n b+=1\r\n y=i\r\n \r\nif(a==1):\r\n print(x+1)\r\nelif(b==1):\r\n print(y+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Nov 23 12:21:04 2019\r\n\r\n@author: 86138\r\n\"\"\"\r\n\r\n#25A IQ test\r\nn = int(input())\r\ntest = [int(x)%2 for x in input().split()]\r\nn1 = test.count(1)\r\nn0 = test.count(0)\r\nif n0 == 1:\r\n l = test.index(0)\r\nif n1 == 1:\r\n l = test.index(1)\r\nl += 1\r\nprint(l)", "input()\n\nnums = list(map(int, input().split()))\n\nlast_even, last_odd = -1, -1\nno_even, no_odd = 0, 0\n\nfor i, num in enumerate(nums):\n if num % 2 == 0:\n last_even = i + 1\n no_even += 1\n else:\n last_odd = i + 1\n no_odd += 1\n\nif no_even > no_odd:\n print(last_odd)\nelse:\n print(last_even)\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nl=[]\r\nk=[]\r\nfor i in m:\r\n if i%2==0:\r\n l.append(i)\r\n else:\r\n k.append(i)\r\nif len(l)==1:\r\n print(m.index(l[0])+1)\r\nelse:\r\n print(m.index(k[0])+1)", "count = int(input())\r\nrow = input()\r\nrow = list(row.split())\r\nrow = list(map(int,row))\r\n\r\neven = 0\r\nnon_even=0\r\n\r\nfor _ in row:\r\n if _ % 2 == 0:\r\n even +=1\r\n else:\r\n non_even +=1\r\n\r\ndef outcast(row):\r\n res = []\r\n if even>non_even:\r\n for _ in row:\r\n if _ % 2 != 0:\r\n res.append(_)\r\n else:\r\n for _ in row:\r\n if _ % 2 == 0:\r\n res.append(_)\r\n\r\n return row.index(res[0]) +1\r\nprint(outcast(row))", "n = int(input())\r\na = []\r\nb = []\r\nl = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a) == 1:\r\n print(str(a[0]+1))\r\nelse:\r\n print(str(b[0]+1))\r\n ", "n = int(input())\r\nnum = [int(x)%2 for x in input().split()]\r\nif sum(num) == 1:\r\n print(num.index(1)+1)\r\nelse:\r\n print(num.index(0)+1)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nevens = [x for x in nums if x % 2 == 0]\r\nodds = [x for x in nums if x % 2 == 1]\r\n\r\nif len(evens) == 1:\r\n print(nums.index(evens[0]) + 1)\r\nelse:\r\n print(nums.index(odds[0]) + 1)\r\n ", "n = int(input())\r\nMod = [(int(x)%2) for x in input().split()]\r\nif sum(Mod) == 1:\r\n print(Mod.index(1)+1)\r\nelse:\r\n print(Mod.index(0)+1)", "n=int(input())\r\nval=list(map(int,input().split()))\r\ne,o=0,0\r\nfor i in range(n):\r\n\tif(val[i]%2==0):\r\n\t\te+=1\r\n\telse:\r\n\t\to+=1\r\nif(e>o):\r\n\tfor i in range(n):\r\n\t\tif(val[i]%2!=0):\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif(val[i]%2==0):\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n = int(input())\r\nnum = list(map(int,input().split()))\r\nchet = []\r\nnechet = []\r\nfor i in num:\r\n if i % 2 == 0:\r\n chet.append(i)\r\n else:\r\n nechet.append(i)\r\nif len(chet) < len(nechet):\r\n print(num.index(*chet)+1)\r\nelse:\r\n print(num.index(*nechet)+1)\r\n", "n=int(input())\r\n\r\nl=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\noddindex=-1\r\nevenindex=-1\r\nflag=-1\r\nfor i in range(0,n):\r\n if l[i]%2==0:\r\n even+=1\r\n evenindex=i\r\n \r\n else:\r\n odd+=1\r\n oddindex=i\r\n if even>=2 and oddindex!=-1:\r\n print(oddindex+1)\r\n break\r\n if odd>=2 and evenindex!=-1:\r\n print(evenindex+1)\r\n break\r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\nfor i in range(1, len(array) - 1):\r\n if (array[i - 1] % 2 == 0 and array[i] % 2 != 0 and array[i + 1] % 2 != 0) or (\r\n array[i - 1] % 2 != 0 and array[i] % 2 == 0 and array[i + 1] % 2 == 0):\r\n print(i)\r\n break\r\n elif (array[i - 1] % 2 != 0 and array[i] % 2 == 0 and array[i + 1] % 2 != 0) or (\r\n array[i - 1] % 2 == 0 and array[i] % 2 != 0 and array[i + 1] % 2 == 0):\r\n print(i + 1)\r\n break\r\n elif (array[i - 1] % 2 != 0 and array[i] % 2 != 0 and array[i + 1] % 2 == 0) or (\r\n array[i - 1] % 2 == 0 and array[i] % 2 == 0 and array[i + 1] % 2 != 0):\r\n print(i + 2)\r\n break\r\n", "n = int(input())\nar = list(map(int,input().split()))\nn1 = ar[0]\nn2=ar[1]\nn3=ar[2]\neven=0\nodd=0\nif n1%2==0:\n even+=1\nelse:\n odd+=1\nif n2%2==0:\n even+=1\nelse:\n odd+=1\nif n3%2==0:\n even+=1\nelse:\n odd+=1\nisEven=False\nif even>odd:\n isEven=True\nfor i in range(n):\n if (ar[i]%2==0)==isEven:\n pass\n else:\n print(i+1)\n break", "# https://codeforces.com/problemset/problem/25/A\n# [2022-07-23 Sat 11:06]\n\ncount = int(input())\nnumbers = [int(x) for x in input().split()]\n\nfirst_odd = None\nfirst_even = None\n\nodd_count = 0\neven_count = 0\n\nfor i, num in enumerate(numbers):\n if num % 2 == 0:\n even_count += 1\n if not first_even:\n first_even = i+1\n else:\n odd_count += 1\n if not first_odd:\n first_odd = i+1\n\nif odd_count > 1:\n print(first_even)\nelse:\n print(first_odd)\n", "useless=int(input())\r\nnumbers=[int(x)%2 for x in input().split()]\r\nprint(numbers.index(1)+1 if sum(numbers)==1 else numbers.index(0)+1)", "a=int(input())\r\nprim=[int(i)%2 for i in input().split()]\r\nif prim.count(1)==1:\r\n print(prim.index(1)+1)\r\nelif prim.count(0)==1:\r\n print(prim.index(0)+1)\r\n", "def solve():\n n = int(input())\n arr = [int(num) for num in input().strip().split()]\n weird = \"even\"\n count = 0\n for num in arr[:3]:\n if num & 1 == 0:\n count += 1\n if count > 1:\n weird = \"odd\"\n for i, num in enumerate(arr):\n if weird == \"odd\" and num & 1 != 0:\n print(i+1)\n break\n elif weird == \"even\" and num & 1 == 0:\n print(i+1)\n break\n\n\nif __name__ == \"__main__\":\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\n", "n=int(input())\nL=[int(i) for i in input().split()]\ne=[i%2 for i in L]\nif sum(e)==1:\n\tprint(e.index(1)+1)\nelse:\n\tprint(e.index(0)+1)\t\n\n\n", "n = int(input())\r\n\r\ndata_list = input().split()\r\n\r\nnumbers = list(map(int, data_list))\r\n\r\nevens = []\r\nodds = []\r\n\r\nfor num in numbers:\r\n if num % 2 == 0:\r\n evens.append(num)\r\n elif num % 2 != 0:\r\n odds.append(num)\r\n\r\nif len(evens) == 1:\r\n answer = numbers.index(evens[0]) +1\r\nelif len(odds) == 1:\r\n answer = numbers.index(odds[0]) +1\r\n\r\nprint(answer)", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = 0\r\nd = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n c += 1\r\n e = i\r\n else:\r\n d += 1\r\n f = i\r\nif c == 1:\r\n print(e + 1)\r\nelse:\r\n print(f + 1)\r\n", "n = int(input())\r\nx = list(map(lambda n: n%2, map(int, input().split())))\r\nif x.count(1) == 1:\r\n print(x.index(1)+1)\r\nelse:\r\n print(x.index(0)+1)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nk1,k2=0,0\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n indx1=i+1\r\n k1+=1\r\n else:\r\n indx2=i+1\r\n k2+=1\r\nif k1<k2:\r\n print(indx1)\r\nelse:\r\n print(indx2)", "a=int(input())\r\nm=[int(x) for x in input().split(' ')]\r\neven=0\r\neven_ind=0\r\nodd=0\r\nodd_ind=0\r\nfor i in range(a):\r\n if m[i]%2==0:\r\n even+=1\r\n even_ind=i\r\n else:\r\n odd+=1\r\n odd_ind=i\r\nif even==1:\r\n print(even_ind+1)\r\nelse:\r\n print(odd_ind+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\na=0\r\nb=0\r\nd=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n a=a+1\r\n b=i\r\n else:\r\n c=c+1\r\n d=i\r\nif a==1:\r\n print(b+1)\r\nelse:\r\n print(d+1)", "#ПРИВЕТ ИЛЬЕ,ПАШЕ,ВАЛЕНТИНУ!\r\n\r\nn=int(input())\r\nsp=[int(i) for i in input().split()]\r\nsp1=[]\r\nsp2=[]\r\nfor i in range(n):\r\n if sp[i]%2==0:\r\n sp2.append(sp[i])\r\n else:\r\n sp1.append(sp[i])\r\n if (len(sp1)>1 and len(sp2)>0) or (len(sp1)>0 and len(sp2)>1):\r\n break\r\nif len(sp1)>1:\r\n ind=sp.index(sp2[0])\r\nelif len(sp2)>1:\r\n ind = sp.index(sp1[0])\r\nprint(ind+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\no=0;e=0;oc=0;ec=0\r\nfor i in range(n):\r\n if(l[i]&1):\r\n o=i\r\n oc+=1\r\n else:\r\n e=i\r\n ec+=1\r\nprint((e if(ec==1) else o)+1)", "length = int(input())\nlist_num = list(map(int, input().split()))\n\neven1 = list_num[0] % 2\neven2 = list_num[1] % 2\neven3 = list_num[2] % 2\nfound = False\nif even1 == even2:\n if even1 == even3:\n evenness = even1\n else:\n found = True\n print(\"3\")\nelse:\n if even1 == even3:\n found = True\n print(\"2\")\n elif even2 == even3:\n found = True\n print(\"1\")\n\nif not found:\n for a in list_num:\n if a % 2 != evenness:\n print(list_num.index(a)+1)\n break\n\n \t \t \t\t\t\t \t\t \t\t \t\t \t\t", "n=int(input())\nnum=[int(x) for x in input().split()]\na=[]\nfor i in range(0,n):\n a.append(num[i]%2)\nif a[0]!=a[1] and a[0]!=a[2]:\n print(1)\nelse:\n for i in range(1,n):\n if a[i]!=a[i-1]:\n print(i+1)\n break\n", "n=int(input())\r\nls=list(map(int,input().split()))\r\na,b=[],[]\r\nfor x,e in enumerate(ls):\r\n if e%2==0:a.append(x)\r\n else:b.append(x)\r\nif len(a)==1:\r\n print(a[0]+1)\r\nelse:\r\n print(b[0]+1)\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nv=[]\r\na=[]\r\nfor i in s:\r\n if(i%2==0):\r\n v.append(i)\r\n else:\r\n a.append(i)\r\nif(len(v)>len(a)):\r\n print(s.index(*a)+1)\r\nelse:\r\n print(s.index(*v)+1)\r\n", "# Username: maheshraju2020\r\n\r\nimport heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom itertools import combinations, permutations\r\nfrom math import ceil, gcd, sqrt\r\nfrom sys import setrecursionlimit, stdin, stdout\r\n\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn = ii1()\r\narr = iia()\r\neven = []\r\nodd = []\r\nfor i in range(n):\r\n if arr[i]%2 == 0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\n\r\nif len(even) == 1:\r\n print(even[0])\r\nelse:\r\n print(odd[0]) ", "n=int(input())\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nl=[int(j) for j in input().split()]\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n a+=1\r\n c=i\r\n else:\r\n b+=1\r\n d=i\r\nif a==1:\r\n print(c+1)\r\nelse:\r\n print(d+1)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nodd=[]\r\neven=[]\r\nfor i in range(n):\r\n if a[i]%2!=0:\r\n odd.append(str(i+1))\r\n else:\r\n even.append(str(i+1))\r\ndelisiter=' '\r\nif len(odd)<len(even):\r\n print(delisiter.join(odd))\r\nelse:\r\n print(delisiter.join(even))", "N = int(input())\r\nR = input().split()\r\nr = [int(i) for i in R]\r\nS = []\r\nfor i in range(len(r)):\r\n if r[i]%2 == 0:\r\n S.append('even')\r\n elif r[i]%2 != 0:\r\n S.append('odd')\r\ns = sorted(S)\r\nif s[1] == 'even':\r\n for i in range(len(S)):\r\n if S[i] == 'odd':\r\n print(i+1)\r\n break\r\nelif s[1] == 'odd':\r\n for i in range(len(S)):\r\n if S[i] == 'even':\r\n print(i+1)\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\nodd_count=odd_index=even_count=even_index=0\r\n\r\nfor i in range(n):\r\n if a[i]%2:\r\n odd_count+=1\r\n odd_index=i+1\r\n else:\r\n even_count+=1\r\n even_index=i+1\r\n \r\nif odd_count==1:\r\n print(odd_index)\r\nelif even_count==1:\r\n print(even_index)", "n = int(input())\r\nqq = list(map(int, input().split()))\r\nww = []\r\nfor i in qq[:3]:\r\n ww.append(i % 2)\r\nif ww.count(1) >= 2:\r\n q = 0\r\nelse:\r\n q = 1\r\nfor i in range(len(qq)):\r\n if qq[i] % 2 == q:\r\n print(i + 1)\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\nchet=[]\r\nnechet=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n chet.append(a[i])\r\n else:\r\n nechet.append(a[i])\r\n\r\nif len(chet)>len(nechet):\r\n result=a.index(nechet[0])+1\r\nelse:\r\n result=a.index(chet[0])+1\r\nprint(result)\r\n\r\n\r\n", "x=int(input())\r\narr = list(map(int,input().split()))\r\neven=0\r\nodd=0\r\ndef is_even(arr,even,odd):\r\n if arr[0] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if arr[1] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if arr[2] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if odd<even:\r\n return 1\r\n else:\r\n return 0\r\nif is_even(arr,0,0):\r\n for i in range(x):\r\n if arr[i]%2!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(x):\r\n if arr[i]%2==0:\r\n print(i+1)\r\n break", "n = int(input())\nnum = list(map(int, input().split()))\n\neven = []\nfor i in num :\n even.append(i % 2)\n#print(even)\n\nif sum(even) > 1 :\n print(even.index(0) + 1)\nelse :\n print(even.index(1) + 1)", "def eveness(arr,val,n):\r\n if val==\"even\":\r\n for i in range(n):\r\n if arr[i]%2==0:\r\n return i+1\r\n else:\r\n for i in range(n):\r\n if arr[i]%2!=0:\r\n return i+1\r\n\r\n\r\n\r\ndef odd_one_out(arr, n):\r\n odd=0\r\n even=0\r\n for i in range(n):\r\n if arr[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\n\r\n if even>1:\r\n print(eveness(arr,\"odd\",n))\r\n else:\r\n print(eveness(arr,\"even\",n))\r\n\r\n\r\nn=int(input())\r\nlis = list(map(int,input().split()))\r\nodd_one_out(lis, n)", "n=int(input())\na=list(map(int,input().split()))\nodd=0\neven=0\nei=0\noi=0\nfor i in range(n):\n if a[i]%2==1:\n odd+=1\n oi=i\n else:\n even+=1\n ei=i\n\nif odd==1:\n print(oi+1)\nelse:\n print(ei+1)", "n = int(input())\r\nA = list(map(int, input().split()))\r\ni = 0\r\nwhile i < n - 1:\r\n if (A[i] + A[i + 1]) % 2 != 0:\r\n if i >= 1:\r\n if (A[i - 1] + A[i]) % 2 != 0:\r\n print(i + 1)\r\n else:\r\n print(i + 2)\r\n else:\r\n if (A[i] + A[i + 2]) % 2 != 0:\r\n print(i + 1)\r\n else:\r\n print(i + 2)\r\n break\r\n i += 1\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n l[i]=l[i]&1\r\nif l.count(0)>=l.count(1):\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\nn=int(input())\r\na=list(map(int,input().split(\" \")))\r\ne=[]\r\no=[]\r\nfor i in range(0,n):\r\n if(a[i]%2==0):\r\n e.append(i+1)\r\n else:\r\n o.append(i+1)\r\n#print(*e)\r\n#print(*o)\r\n\r\nif(len(e)==1):\r\n print(e[0])\r\nelse:\r\n print(o[0])\r\n", "n = int(input())\r\n\r\nn1 = list(map(int,input().split()))\r\n\r\nqatar = 0\r\n\r\njup = 0\r\n\r\ntak = 0\r\n\r\nfor i in range(0,n):\r\n if n1[i] % 2 == 0:\r\n jup += 1\r\n else:\r\n tak += 1\r\n\r\nif tak < jup:\r\n for i in range(0,n):\r\n if n1[i] % 2 != 0:\r\n print(i+1)\r\nif tak > jup:\r\n for i in range(0,n):\r\n if n1[i] % 2 == 0:\r\n print(i+1)\r\n", "\r\n'''l,lb=map(int,input().split())\r\nans=0\r\nwhile l<=lb:\r\n l,lb=l*3,lb*2\r\n ans+=1\r\nprint(ans)\r\n'''\r\n\r\n'''q,t=map(int,input().split())\r\nfor i in range(t):\r\n if q%10==0:\r\n q=q//10\r\n else:\r\n q=q-1\r\nprint(q)'''\r\n\r\n'''x=int(input())\r\nif x<=5:\r\n print(1)\r\nelse:\r\n if x%5==0:\r\n print(x//5)\r\n else:\r\n print((x//5)+1)'''\r\n\r\n'''s=input()\r\nl=u=0\r\nfor i in s:\r\n if i.isupper():\r\n u+=1\r\n else:\r\n l+=1\r\nif u>l:\r\n print(s.upper())\r\nelse:\r\n print(s.lower())'''\r\n\r\n\r\n'''n,k=map(int,input().split())\r\nlis1=[]\r\nlis2=[]\r\nif(k<=n//2):\r\n print((2**(k-1))+1)\r\nelse:\r\n print((2**((k//2)-1)))'''\r\n\r\n#petya and strings\r\n'''s1=input()\r\ns2=input()\r\ns1=s1.lower()\r\ns2=s2.lower()\r\nfor i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n if(ord(s1[i])<ord(s2[i])):\r\n print(\"-1\")\r\n break\r\n elif(ord(s1[i])>ord(s2[i])):\r\n print(\"1\")\r\n break\r\nelse:\r\n print(\"0\")'''\r\n\r\n#young physicist\r\n\r\n'''n=int(input())\r\ns=0\r\nfor i in range(n):\r\n lis=[int(a) for a in input().split()]\r\n s=s+sum(lis)\r\n lis.clear()\r\nif(s==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")'''\r\n\r\n#twins\r\n'''n=int(input())\r\nlis=[int(a) for a in input().split()]\r\nlis.sort()\r\ncount=stol=0\r\nwhile(True):\r\n stol=stol+lis.pop()\r\n rem=sum(lis)\r\n count+=1\r\n if(rem<stol):\r\n break\r\n \r\nprint(count)'''\r\n\r\n#eshag loves big arrays\r\n'''import collections\r\nfor i in range(int(input())):\r\n n=int(input())\r\n arr=[int(a) for a in input().split()]\r\n lis=collections.Counter(arr)\r\n mini=min(arr)\r\n for k,v in lis.items():\r\n if k==mini:\r\n print(len(arr)-v)\r\n break'''\r\n\r\n'''for i in range(int(input())):\r\n n=int(input())\r\n arr=[int(a) for a in input().split()]\r\n maxi=max(arr)\r\n ans=0\r\n s=set()\r\n for i in range(len(arr)-1):\r\n count=0\r\n for j in range(i+1,len(arr)):\r\n if abs(arr[i]-arr[j])>=maxi:\r\n count+=1\r\n if(count==(len(arr)-(i+1))):\r\n ans+=1\r\n print(ans)'''\r\n#presents\r\n'''n=int(input())\r\nlis=[int(a) for a in input().split()]\r\ngiven=[0]*len(lis)\r\nk=1\r\nfor i in lis:\r\n given[i-1]=given[i-1]+k\r\n k+=1\r\nfor i in given:\r\n print(i,end=\" \")'''\r\n\r\n#Magnets\r\n'''n=int(input())\r\nlis=[input() for j in range(n)]\r\nflag=0\r\ncount=1\r\nfor i in range(len(lis)-1):\r\n if(lis[i]==lis[i+1]):\r\n continue\r\n else:\r\n count+=1 \r\nprint(count)'''\r\n\r\n#In search of easy problem\r\n'''n=int(input())\r\nlis=[int(i) for i in input().split()]\r\nif(lis.count(1)>=1):\r\n print(\"HARD\")\r\nelse:\r\n print(\"EASY\")'''\r\n\r\n \r\n#kefa and first step\r\n'''n=int(input())\r\nlis=[int(j) for j in input().split()]\r\ncount=1\r\nlis2=[]\r\nif len(lis)==1:\r\n print(1)\r\nelse:\r\n for i in range(0,len(lis)-1):\r\n if(lis[i]<=lis[i+1]):\r\n count+=1\r\n else:\r\n lis2.append(count)\r\n count=1\r\n if(i==len(lis)-2):\r\n lis2.append(count)\r\n if(len(lis2)==1):\r\n print(lis2[0])\r\n else:\r\n print(max(lis2))'''\r\n\r\n#hulk\r\n'''n=int(input())\r\nflag=0\r\nfor i in range(n):\r\n if(flag==0):\r\n print(\"I hate\",end=\" \")\r\n flag=1\r\n else:\r\n print(\"I love\",end=\" \")\r\n flag=0\r\n if(i==(n-1)):\r\n print(\"it\")\r\n else:\r\n print(\"that\",end=\" \")'''\r\n#i hate 1111\r\n'''n=int(input())\r\nfor i in range(n):\r\n num=int(input())\r\n if(num%11==0):\r\n print(\"YES\")\r\n else:\r\n while(len(str(num))>1):\r\n ex=len(str(num))*\"1\"\r\n if(num%int(ex)==0):\r\n print(\"YES\")\r\n break\r\n num=num-int(ex)\r\n else:\r\n print(\"NO\")'''\r\n \r\n'''n=int(input())\r\nlis=[int(a) for a in input().split()]\r\ns=0\r\ncount=0\r\nprint(lis)\r\nfor i in lis:\r\n if(s+i>=0):\r\n s=s+i\r\n count+=1\r\nprint(count)'''\r\n\r\n#caps lock\r\n'''n=input()\r\nstart=n[0]\r\nrem=n[1:]\r\nif(len(n)==1):\r\n print(n.swapcase())\r\nelif((start.islower() and rem.isupper()) or n.isupper()):\r\n print(n.swapcase())\r\nelse:\r\n print(n)'''\r\n\r\n#stone game\r\n'''for i in range(int(input())):\r\n n=int(input())\r\n lis=[int(a) for a in input().split()]\r\n ans=lis[::-1]\r\n mini=lis.index(min(lis))\r\n maxi=lis.index(max(lis))\r\n for i in range(len(lis)):\r\n if(lis[i]== mini or lis[i]==maxi):\r\n count+=1\r\n flag+=1\r\n else:\r\n count+=1\r\n if(flag==2):\r\n break\r\n for i in range((len(lis)-1),-1):\r\n if(lis[i]== mini or lis[i]==maxi):\r\n count1+=1\r\n flag1+=1\r\n else:\r\n count1+=1\r\n if(flag1==2):\r\n break\r\n for i in range((len(lis)//2))\r\n if ans.lfind(max(ans))>ans.rfind(max(ans)):\r\n mini=n-mini\r\n if n-maxi<maxi:\r\n maxi=n-maxi\r\n a=ans.index(min(lis))\r\n b=ans.index(max(lis))\r\n if mini+maxi==a+b:\r\n d=2+min(mini,a)+min(maxi,b)\r\n if mini+maxi<d and mini+maxi<a+b :\r\n print(1+mini+maxi)\r\n elif a+b<d and a+b<mini+maxi:\r\n print(a+b+1)\r\n else:\r\n print(d)\r\n else:\r\n if mini>a:\r\n mini=a\r\n if maxi>b:\r\n maxi=b\r\n print(1+mini+maxi)'''\r\n'''import itertools\r\nfor i in range(int(input())):\r\n n,l,r=map(int,input().split())\r\n count=0\r\n lis=[int(a) for a in input().split()]\r\n com=list(itertools.combinations(lis,2))\r\n for i in com:\r\n i=list(i)\r\n s=sum(i)\r\n if(l<=s and s<=r):\r\n count+=1\r\n print(count)'''\r\n#expression\r\n'''lis=[]\r\nlis2=[]\r\nfor i in range(3):\r\n lis.append(int(input()))\r\nlis2.append((lis[0]+lis[1])*lis[2])\r\nlis2.append((lis[0]*(lis[1]+lis[2])))\r\nlis2.append((lis[0]*lis[1])*lis[2])\r\nlis2.append((lis[0]+(lis[1]*lis[2])))\r\nlis2.append((lis[0]*lis[1])+lis[2])\r\nlis2.append((lis[0]+(lis[1]+lis[2])))\r\nprint(max(lis2))'''\r\n#preety permutations\r\n'''for t in range(int(input())):\r\n n=int(input())\r\n if(n==2):\r\n print(\"2 1\")\r\n elif(n==3):\r\n print(\"3 1 2\")\r\n else:\r\n if(n%2==0):\r\n for i in range(1,n+1,2):\r\n if(i!=(n-1)):\r\n print(i+1,i,end=\" \")\r\n else:\r\n print(i+1,i)\r\n else:\r\n print(\"3 1 2\",end=\" \")\r\n for j in range(4,n+1,2):\r\n if(j!=(n-1)):\r\n print(j+1,j,end=\" \")\r\n else:\r\n print(j+1,j)'''\r\n#pleasant pairs\r\n'''for i in range(int(input())):\r\n n=int(input())\r\n count=0\r\n lis=[int(a) for a in input().split()]\r\n for i in range(n-1):\r\n for j in range(i+1,n):\r\n if((i+1)+(j+1)==lis[i]*lis[j]):\r\n count+=1\r\n print(count)'''\r\n#IQ test\r\nn=int(input())\r\nlis=[int(a) for a in input().split()]\r\ncounte=0\r\ncounto=0\r\nfor i in range(n):\r\n if(lis[i]%2==0):\r\n indexe=i+1\r\n counte+=1\r\n else:\r\n indexo=i+1\r\n counto+=1\r\nif(counte==1):\r\n print(indexe)\r\nelse:\r\n print(indexo)\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\na = list(map(int, input().split()))\n\neven = {}\nodd = {}\n\nfor i in range(n):\n if a[i] % 2 == 0:\n even[i+1] = a[i]\n else:\n odd[i+1] = a[i]\n\nif len(even) == 1:\n it = iter(even.items())\n print(next(it)[0])\nelse:\n it = iter(odd.items())\n print(next(it)[0])\n\n \t\t\t\t \t \t \t \t \t\t \t \t", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\ncnt1 = 0\r\ncnt2 = 0\r\nodd = 0\r\neven = 0\r\n\r\nfor i in range(n):\r\n\tif s[i]%2==0:\r\n\t\tcnt1+=1\r\n\t\teven=i+1\r\n\telse:\r\n\t\tcnt2+=1\r\n\t\todd=i+1\r\nif cnt1<=cnt2:\r\n\tprint(even)\r\nelse:\r\n\tprint(odd)\r\n", "n = int(input())\r\nline = input().split(' ')\r\nl = [int(i) for i in line]\r\n\r\nevenness0 = False\r\nevenness1 = False\r\nif l[0]%2 == 0:\r\n evenness0 = True\r\nif l[1]%2 == 0:\r\n evenness1 = True\r\n\r\nind = 3\r\nif evenness0 and evenness1:\r\n for i in l[2:]:\r\n if i%2!=0:\r\n print(ind)\r\n break\r\n ind+=1\r\nelif evenness0:\r\n if l[2]%2==0:\r\n print(2)\r\n else:\r\n print(1)\r\nelif evenness1:\r\n if l[2]%2==0:\r\n print(1)\r\n else:\r\n print(2)\r\nelse:\r\n for i in l[2:]:\r\n if i%2==0:\r\n print(ind)\r\n break\r\n ind+=1", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\nk = []\r\nl = []\r\nfor i in range(n):\r\n if t[i] % 2 == 0:\r\n k.append(i+1)\r\n else:\r\n l.append(i+1)\r\n\r\nif len(k) > len(l):\r\n for p in range(len(l)):\r\n print(l[p],end = '')\r\nelse:\r\n for q in range(len(k)):\r\n print(k[q],end = '')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ne = 0\r\no = 0\r\nei = -1\r\noi = -1\r\nfor j,i in enumerate(a):\r\n if i&1:\r\n if o==0:\r\n oi = j+1\r\n o+=1\r\n else:\r\n if e==0:\r\n ei = j+1\r\n e+=1\r\nif o==1:\r\n print(oi)\r\nelse:\r\n print(ei)\r\n", "n=int(input())\r\np=[int(i) for i in input().split()]\r\na=p[0]%2\r\nb=p[1]%2\r\nc=p[2]%2\r\nif(a==b and b==c and n>3):\r\n for i in range(3,n):\r\n if(p[i]%2!=a):\r\n print(i+1)\r\n break\r\nif(a==b and b!=c):\r\n print('3')\r\nif(a==c and a!=b):\r\n print('2')\r\nif(b==c and a!=c):\r\n print('1')\r\n", "input()\r\nn=[ i % 2 for i in map(int,input().split())]\r\nd=(0,1)[n.count(0) > n.count(1)]\r\nprint(n.index(d)+1)", "#FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT___FILLER_TEXT\n\nsize = int(input())\n\nnumList = [int(i) for i in input().split()]\n\neven_indices = [i for i, num in enumerate(numList) if num % 2 == 0]\nodd_indices = [i for i, num in enumerate(numList) if num % 2 != 0]\n\nif len(even_indices) == 1:\n print(even_indices[0] + 1)\nelse:\n print(odd_indices[0] + 1)\n\n\t\t\t \t\t\t\t \t\t \t \t \t \t\t\t \t\t \t", "n=int(input())\r\narr=list(map(int,input().split()))\r\nodd=0\r\nfor i in range(3):\r\n if arr[i]&1==1:\r\n odd+=1\r\nif odd>=2:\r\n ans=0\r\n for i in range(n):\r\n if arr[i]&1==0:\r\n ans=i+1\r\n break\r\nelse:\r\n ans=0\r\n for i in range(n):\r\n if arr[i]&1==1:\r\n ans=i+1\r\n break\r\nprint(ans)", "n = int(input())\nli = list(map(int, input().split()))\n\nfor i in range(len(li)):\n li[i] = li[i] % 2\nif li.count(0) == 1:\n print(li.index(0) + 1)\nelse:\n print(li.index(1) + 1)\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\ne = 0\r\ncount = 0\r\nfor i in range(3):\r\n if lst[i]%2 == 0:\r\n count += 1\r\nif count > 1:\r\n e = 1\r\nif e == 1:\r\n for i in range(n):\r\n if lst[i] % 2 != 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if lst[i] % 2 == 0:\r\n print(i+1)\r\n break", "n = int(input())\r\nm = list(map(int, input().split()))\r\nevenCount = 0\r\noddCount = 0\r\nfor number in m:\r\n if number % 2 == 0:\r\n evenCount += 1\r\n else:\r\n oddCount += 1\r\n\r\nif evenCount > oddCount:\r\n remainder = 1\r\nelse:\r\n remainder = 0\r\n\r\nfor i in range(n):\r\n if m[i] % 2 == remainder:\r\n print(i + 1)\r\n break", "n = int(input())\r\na = []\r\na += [int(n) for n in input().split()]\r\nif a[0] % 2 == 0 and a[1] % 2 == 0:\r\n for i in range(2, n):\r\n if a[i] % 2 == 1:\r\n print(i+1)\r\n break\r\nelif a[0] % 2 == 1 and a[1] % 2 == 1:\r\n for i in range(2, n):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n break\r\nelif a[0] % 2 == 0 and a[1] % 2 == 1 and a[2] % 2 == 0:\r\n print(2)\r\nelif a[0] % 2 == 1 and a[1] % 2 == 0 and a[2] % 2 == 1:\r\n print(2)\r\nelif a[0] % 2 == 0 and a[1] % 2 == 1 and a[2] % 2 == 1:\r\n print(1)\r\nelif a[0] % 2 == 1 and a[1] % 2 == 0 and a[2] % 2 == 0:\r\n print(1)", "n = int(input())\nmylist = input().split()\nfor i in range(len(mylist)):\n mylist[i] = int(mylist[i])\n\neven,odd = 0,0\n\nfor i in range(len(mylist)):\n if mylist[i]%2==0:\n even+=1\n else:\n odd+=1\n\nif even > odd:\n for i in range(len(mylist)):\n if mylist[i]%2==1:\n print(i+1)\nelse:\n for i in range(len(mylist)):\n if mylist[i]%2==0:\n print(i+1)\n\n\t \t \t\t\t\t\t \t\t \t \t \t \t", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\neven_count=0\r\nodd_count=0\r\nfor i in list1:\r\n if i%2==0:\r\n even_count+=1\r\n else:\r\n odd_count+=1\r\nif even_count==1:\r\n for j in range(len(list1)):\r\n if list1[j]%2==0:\r\n print (j+1)\r\nif odd_count==1:\r\n for j in range(len(list1)):\r\n if list1[j]%2==1:\r\n print (j+1)\r\n", "n=int(input())\na=[n]\na=list(map(int,input().split()))\nce=0\nco=0\nfor i in range(n):\n if(a[i]%2==0):\n ce=ce+1\n fe=i+1\n else:\n co=co+1\n fo=i+1\nif(ce==1):\n print(fe)\nelse:\n print(fo)", "n=int(input())\r\nd=[int(x)for x in input().split()]\r\nif (d[0])%2+(d[1])%2==1 and (d[0])%2+(d[2])%2==1 :\r\n print('1')\r\nelse:\r\n for i in range(1,n-1):\r\n if (d[i])%2+(d[i+1])%2==1 and(d[i])%2+(d[i-1])%2==1 :\r\n print(i+1)\r\n break #跳出循环\r\n else:\r\n print(n)\r\n \r\n \r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\ne = 0\r\no = 0\r\nfor i in l:\r\n if i%2 == 0:\r\n e += 1\r\n if e > 1:\r\n break\r\n else:\r\n o += 1\r\n if o > 1:\r\n break\r\nif e>o:\r\n for i in l:\r\n if i%2 == 1:\r\n print(l.index(i)+1)\r\n break\r\nelse:\r\n for i in l:\r\n if i%2 == 0:\r\n print(l.index(i)+1)\r\n break", "n=int(input())\r\np=input().split()\r\ni=0\r\ns=[]\r\nwhile i<n:\r\n s.append(int(p[i]))\r\n i+=1\r\ni=0\r\nif s[0]%2==0:\r\n if s[1]%2==0:\r\n while i<n:\r\n if s[i]%2!=0:\r\n print(i+1)\r\n i+=1\r\n elif s[2]%2==0:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n if s[1]%2!=0:\r\n while i<n:\r\n if s[i]%2==0:\r\n print(i+1)\r\n i+=1\r\n elif s[2]%2==0:\r\n print(1)\r\n else:\r\n print(2)", "a=int(input())\r\nb=[*map(int,input().split())]\r\nc=[i%2==0 for i in b]\r\nd=c.count(True)\r\ne=c.count(False)\r\nif(e<d):\r\n print(c.index(False)+1)\r\nelse:\r\n print(c.index(True)+1)\r\n", "n = int(input())\r\neven,odd = 0,0\r\nei,oi=0,0\r\na = [int(x) for x in input().split()]\r\nindex = 1\r\nfor i in range(len(a)):\r\n if (a[i]&1)==0:\r\n even+=1\r\n ei=i+1\r\n else:\r\n odd+=1\r\n oi=i+1\r\nif even>odd:\r\n print(oi)\r\nelse:\r\n print(ei)\r\n \r\n ", "n = int(input())\r\na = [int(i) for i in input().split()[:n]]\r\nfor i in range(n):\r\n if(a[i]%2==0 and a[i+1]%2==0 and a[i+2]%2==0):\r\n pass\r\n if (a[i] % 2 != 0 and a[i + 1] % 2 != 0 and a[i + 2] % 2 != 0):\r\n pass\r\n else:\r\n if (a[i] % 2 == 0 and a[i + 1] % 2 == 0 and a[i + 2] % 2 != 0):\r\n p = i + 2\r\n break\r\n elif (a[i] % 2 == 0 and a[i + 1] % 2 != 0 and a[i + 2] % 2 == 0):\r\n p = i + 1\r\n break\r\n elif (a[i] % 2 != 0 and a[i + 1] % 2 == 0 and a[i + 2] % 2 == 0):\r\n p = i\r\n break\r\n elif (a[i] % 2 != 0 and a[i + 1] % 2 != 0 and a[i + 2] % 2 == 0):\r\n p = i + 2\r\n break\r\n elif (a[i] % 2 != 0 and a[i + 1] % 2 == 0 and a[i + 2] % 2 != 0):\r\n p = i + 1\r\n break\r\n elif (a[i] % 2 == 0 and a[i + 1] % 2 != 0 and a[i + 2] % 2 != 0):\r\n p = i\r\n break\r\n\r\nprint(p+1)\r\n", "import math\r\nfrom itertools import combinations\r\nimport time\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nodd = []\r\neven = []\r\nfor i in a:\r\n if i % 2 == 0:\r\n even.append(i)\r\n if i % 2 == 1:\r\n odd.append(i)\r\nif len(odd) == 1:\r\n print(a.index(odd[0]) + 1)\r\nif len(even) == 1:\r\n print(a.index(even[0]) + 1)\r\n", "n = int(input())\r\nlinha = [int(x) for x in input().split()]\r\npares = 0\r\nimpares = 0\r\n\r\nfor x in linha:\r\n if x%2==0:\r\n pares+=1\r\n par = x\r\n else:\r\n impares+=1\r\n impar = x\r\n\r\nif pares == 1:\r\n print(linha.index(par)+1)\r\nelse:\r\n print(linha.index(impar)+1)", "bla = input()\r\narr = list(map(int,input().split()))\r\ndef bitwiseAnd(n):\r\n return n&1;\r\nx = list(map(bitwiseAnd,arr))\r\nprint(x.index(1)+1) if(x.count(1)<x.count(0)) else print(x.index(0)+1)", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\nnp=[]\r\np=[]\r\nfor i in l:\r\n if(i%2!=0):\r\n p.append(i)\r\n else:\r\n np.append(i)\r\nif(len(p)==1):\r\n\tprint (l.index(p[0])+1)\r\nelse:\r\n\tprint (l.index(np[0])+1)", "n = int(input())\r\n\r\nls = list(map(int,input().split()))\r\n\r\n\r\ndef divide(ls):\r\n return ([(index,item) for index,item in enumerate(ls) if item % 2 == 0],[(index,item) for index,item in enumerate(ls) if item % 2 != 0])\r\n \r\ndef eveness_index(ls):\r\n return len(divide(ls)[0]) > len(divide(ls)[1]) and divide(ls)[1][0][0] + 1 or divide(ls)[0][0][0] + 1\r\n \r\nprint(eveness_index(ls))", "# A. IQ test\r\n\r\nn = int(input())\r\nlista = [int(x) for x in input().split(' ')]\r\ncontPar = 0\r\ncontImpar = 0\r\nfor i in range(n):\r\n if lista[i] % 2 == 0:\r\n contPar += 1\r\n lista[i] = 0\r\n else:\r\n contImpar += 1\r\n lista[i] = 1\r\n\r\nif contPar == 1:\r\n for i in range(n):\r\n if lista[i] == 0:\r\n print(i+1)\r\nelif contImpar == 1:\r\n for i in range(n):\r\n if lista[i] == 1:\r\n print(i+1)", "n = int(input())\r\nsp = [int(x) % 2 for x in input().split()[:n]]\r\nprint(sp.index(1)+1 if sp.count(0) > sp.count(1) else sp.index(0)+1)", "input()\r\nnums = input().split()\r\n\r\nr0 = int(nums[0]) % 2\r\nr1 = int(nums[1]) % 2\r\nr2 = int(nums[2]) % 2 \r\n\r\nans = 0\r\nrtot = r0+r1+r2\r\nif rtot == 3:\r\n to_find = 0\r\n for i in range(3, len(nums)): \r\n if int(nums[i])%2 == to_find:\r\n ans = i+1 \r\nelif rtot == 0: \r\n to_find = 1\r\n for i in range(3, len(nums)): \r\n if int(nums[i])%2 == to_find:\r\n ans = i+1 \r\nelif rtot == 1: \r\n if r0+r1 == 0: \r\n ans = 3\r\n elif r0 == 1: \r\n ans = 1 \r\n else: \r\n ans = 2\r\nelif rtot == 2: \r\n if r0+r1 == 2: \r\n ans = 3 \r\n elif r0 == 1: \r\n ans = 2\r\n else: \r\n ans = 1 \r\nprint(ans)", "def solve():\r\n x = int(input())\r\n arr = input().split(' ')\r\n if int(arr[0])%2 == 0 and int(arr[1])%2 == 1 and int(arr[2])%2 == 0 or int(arr[0])%2 == 1 and int(arr[1])%2 == 0 and int(arr[2])%2 == 1:\r\n return 2\r\n elif int(arr[0])%2 == 1 and int(arr[1])%2 == 0 and int(arr[2])%2 == 0 or int(arr[0])%2 == 0 and int(arr[1])%2 == 1 and int(arr[2])%2 == 1:\r\n return 1\r\n\r\n b = True if int(arr[0]) % 2 == 0 else False\r\n\r\n for i in range(1, len(arr)):\r\n tmp = True if int(arr[i]) % 2 == 0 else False\r\n if b != tmp:\r\n return i+1\r\n\r\n return 1\r\n\r\nif __name__ == '__main__':\r\n res = solve()\r\n print(res)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nodd, even = 0, 0\r\nfor i in arr:\r\n if (i % 2 == 1):\r\n odd += 1\r\n else:\r\n even += 1\r\nans = 1\r\nfor i in arr:\r\n if(i % 2 == 1 and odd == 1 or i % 2 == 0 and even == 1):\r\n print(ans)\r\n break\r\n ans += 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\nprint(*min([i+1 for i in range(n) if l[i]%2==0], [i+1 for i in range(n) if l[i]%2!=0], key = len))", "# https://codeforces.com/problemset/problem/25/A\nimport sys\nreader = (s.rstrip() for s in sys.stdin)\ninput = reader.__next__\n# do magic here\nn = int(input())\narr = list(map(lambda x: int(x)%2, input().split()))\nones = arr.count(1)\nzeros = arr.count(0)\nif ones < zeros:\n print(arr.index(1) + 1)\nelse:\n print(arr.index(0) + 1)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\ndef odd(x):\r\n return a[x-1]%2==1\r\n\r\nodd1 = odd(1)\r\n\r\nif odd1 != odd(2):\r\n print(2 if odd1 == odd(3) else 1)\r\nelse:\r\n for i in range(3,n+1):\r\n if odd(i) != odd1:\r\n print(i)\r\n break", "from sys import stdin, stdout\r\ninput, print = lambda: stdin.readline().rstrip(), stdout.write\r\nn, arr = int(input()), tuple(map(int, input().split()))\r\nsign = (arr[0] % 2 + arr[1] % 2 + arr[2] % 2) < 2\r\nfor i in range(n):\r\n if arr[i] % 2 == sign:\r\n print(str(i + 1))\r\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nrem = []\r\nfor i in range(n):\r\n rem.append(a[i]%2)\r\n\r\nif rem.count(1) > 1:\r\n for j in range(n):\r\n if rem[j] == 0:\r\n print(j+1)\r\nelse:\r\n for p in range(n):\r\n if rem[p] == 1:\r\n print(p+1)\r\n \r\n ", "n = input()\r\nievade = input()\r\n\r\nnumbers = ievade.split()\r\nOdds = 0\r\nEvens = 0\r\nposition = 0\r\n\r\nfor i in range (0, len(numbers)):\r\n if(int(numbers[i]) % 2 == 0):\r\n Evens = Evens + 1\r\n else:\r\n Odds = Odds + 1\r\n if(Odds > Evens):\r\n for i in range(0, len(numbers)):\r\n if (int(numbers[i]) % 2 == 0):\r\n position = i+1\r\n else:\r\n for i in range(0, len(numbers)):\r\n if (int(numbers[i]) % 2 != 0):\r\n position = i+1\r\nprint(position)", "n = int(input())\r\n\r\nsequence = list(map(int, input().split()))\r\n\r\neven = 0\r\nodd = 0\r\n\r\nfor i in sequence:\r\n if i % 2 == 0:\r\n even +=1\r\n\r\n else:\r\n odd +=1\r\n\r\nfor i in range(len(sequence)):\r\n if even > odd:\r\n if sequence[i] % 2 == 0:\r\n pass\r\n \r\n else:\r\n print(i+1)\r\n break\r\n\r\n elif odd > even:\r\n if sequence[i] % 2 == 0:\r\n print(i+1)\r\n break", "bah = input()\r\nnums = [int(num) for num in input().split()]\r\n\r\nif nums[0] % 2 == 0:\r\n if nums[1] % 2 == 0:\r\n for index, num in enumerate(nums):\r\n if num % 2 == 1:\r\n print(index + 1)\r\n else:\r\n if nums[2] % 2 == 0:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n if nums[1] % 2 == 0:\r\n if nums[2] % 2 == 0:\r\n print(1)\r\n else:\r\n print(2)\r\n else:\r\n for index, num in enumerate(nums):\r\n if num % 2 == 0:\r\n print(index + 1)\r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nc=0\r\nd=0\r\nc1=0\r\nd1=0\r\nfor i in m:\r\n if i%2==0:\r\n c+=1\r\n c1=i\r\n else:\r\n d+=1\r\n d1=i\r\nif c>d:\r\n print(m.index(d1)+1)\r\nelse:\r\n print(m.index(c1)+1)", "n = int(input())\r\nmass = [int(s) for s in input().split()]\r\n\r\nz_odd = []\r\nz_even = []\r\n\r\nfor i in range(len(mass)):\r\n if mass[i] % 2 == 0:\r\n z_even.append(i + 1)\r\n else:\r\n z_odd.append(i + 1)\r\n\r\nif len(z_even) == 1:\r\n print(z_even[0])\r\nelif len(z_odd) == 1:\r\n print(z_odd[0])", "n=int(input())\r\na=list(map(int, input().split()))\r\nc,d,e,f=[],[],[],[]\r\nfor i in range(n):\r\n if a[i]%2:\r\n d.append(a[i])\r\n f.append(i)\r\n else:\r\n c.append(a[i])\r\n e.append(i)\r\nif len(c)==1:\r\n print(e[0]+1)\r\nelse:\r\n print(f[0]+1)\r\n ", "n = int(input())\r\nnumbers = list(map(int, input().split(' ')))\r\neven_count = 0\r\nodd_count = 0\r\nfor number in numbers:\r\n if number % 2 == 0:\r\n even_count += 1\r\n else:\r\n odd_count += 1\r\nif even_count == 1:\r\n for i in range(n):\r\n if numbers[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if numbers[i] % 2 == 1:\r\n print(i + 1)\r\n break\r\n", "n=int(input())\r\nA=[int(int(i)%2) for i in input().split()]\r\nif A.count(0)>A.count(1):\r\n print(A.index(1)+1)\r\nelse:\r\n print(A.index(0)+1)\r\n", "# itne me hi thakk gaye?\r\nfrom math import ceil\r\n# for _ in range(int(input())):\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nx = [[], []]\r\nfor i in range(n):\r\n if (arr[i] & 1):\r\n x[1].append(i+1)\r\n else:\r\n x[0].append(i+1)\r\nif len(x[0]) == 1:\r\n print(*x[0])\r\nelse:\r\n print(*x[1])", "n=int(input())\r\na=[int(w)%2 for w in input().split()]\r\nif a.count(0)==len(a)-1: print(a.index(1)+1)\r\nelse: print(a.index(0)+1)", "n = int(input())\r\nvector = list(map(lambda x: int(x) % 2, input().split()))\r\nif sum(vector) == 1:\r\n print(vector.index(1) + 1)\r\nelse:\r\n print(vector.index(0) + 1)", "a=int(input())\r\nb=input().split()\r\nc=0\r\nfor i in range (0,a):\r\n c+=int(b[i])%2\r\nif c==1:\r\n for i in range (0,a):\r\n d=int(b[i])%2\r\n if d==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range (0,a):\r\n d=int(b[i])%2\r\n if d==0:\r\n print(i+1)\r\n break\r\n", "n, oddCt, evenCt, oddInd, evenInd = int(input()), 0, 0, 0, 0\r\ncont = [int(item) for item in input().split()]\r\n\r\nfor i in range(n):\r\n if cont[i] % 2 == 0:\r\n evenCt += 1\r\n evenInd = i + 1\r\n else:\r\n oddCt += 1\r\n oddInd = i + 1\r\n\r\n# condition_if_true if condition else condition_if_false\r\nprint(evenInd if evenCt == 1 else oddInd)\r\n", "input()\r\nn = list(map(int,input().split()))\r\nx = ''\r\nfor i in n:\r\n if i%2 == 0:\r\n x+='0'\r\n else:\r\n x+='1'\r\na = x.count('1')\r\nb = x.count('0')\r\nif a > b:\r\n print(x.index('0')+1)\r\nelse:\r\n print(x.index('1')+1)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nl=[i%2 for i in m]\r\na=l[0]+l[1]+l[2]\r\nif a==2 or a==3:\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)", "a=int(input())\r\nb=[int(s) for s in input().split()]\r\ns=0\r\ns2=0\r\nfor k in b[:3]:\r\n\tif k%2==1:\r\n\t\ts+=1\r\n\telse:\r\n\t\ts2+=1\r\nif s>s2:\r\n\tfor k in b:\r\n\t\tif k%2==0:\r\n\t\t\tprint(b.index(k)+1)\r\nelse:\r\n\tfor k in b:\r\n\t\tif k%2==1:\r\n\t\t\tprint(b.index(k)+1)", "a = int(input())\r\nn = list(map(int,input().split()))\r\nk = 0\r\nt = 0\r\nbox = []\r\nfor i in range(a):\r\n if n[k] % 2 == 0:\r\n box.append(1)\r\n else:\r\n box.append(2)\r\n k += 1\r\nx = box.count(1)\r\ny = box.count(2)\r\nif x>y:\r\n t = box.index(2)\r\nelse:\r\n t = box.index(1)\r\nprint(t+1)", "x=int(input())\r\nm=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor i in m:\r\n if i%2==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)==1:\r\n print( m.index(a[0])+1)\r\nelse:\r\n print( m.index(b[0])+1)\r\n \r\n ", "n=int(input())\r\ni=2\r\nA=input().split()\r\na1=int(A[0])%2\r\na2=int(A[1])%2\r\nif a1==a2:\r\n\twhile i<n:\r\n\t\tb=int(A[i])%2\r\n\t\tif b==a1:\r\n\t\t\ti=i+1\r\n\t\telse:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\ta3=int(A[2])%2\r\n\tif a1==a3:\r\n\t\tprint('2')\r\n\telse:\r\n\t\tprint('1')", "#IQTest2.py\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ncOdd = 0\r\ncEven = 0\r\nlastOdd = -1\r\nlastEven = -1\r\nfor i in range(n):\r\n if arr[i] & 1 == 1:\r\n cOdd += 1\r\n lastOdd = i\r\n else:\r\n cEven += 1\r\n lastEven = i\r\n\r\nif cOdd == 1:\r\n print(lastOdd + 1)\r\nelse:\r\n print(lastEven + 1)", "########################################\r\n\r\n# A. Raising Bacteria #\r\n\r\n########################################\r\n\r\n# from math import log2, ceil, floor\r\n# n = int(input())\r\n# c = 1\r\n# while(True):\r\n# if(floor(log2(n)) == ceil(log2(n))):\r\n# print(c)\r\n# break\r\n# elif(floor(log2(n-1)) == ceil(log2(n-1))):\r\n# print(c+1)\r\n# break\r\n# else:\r\n# if(n % 2 == 0):\r\n# n = n//2\r\n# else:\r\n# n = n//2\r\n# c += 1\r\n\r\n########################################\r\n\r\n# A. Shovels and Swords #\r\n\r\n########################################\r\n\r\n# from math import ceil\r\n# for _ in range(int(input())):\r\n# m, n = map(int, input().split())\r\n# a = min(m, n)\r\n# b = max(m, n)\r\n# if(a * 2 <= b):\r\n# print(a)\r\n# else:\r\n# c = 0\r\n# while(a != b and a > 1 and b > 1):\r\n# if(b > a):\r\n# d = (a//2)\r\n# a = a - d\r\n# b = b - (d*2)\r\n# c += d\r\n# else:\r\n# d = (b//2)\r\n# b = b - d\r\n# a = a - (d*2)\r\n# c += d\r\n\r\n# c += (a + b)//3\r\n# print(c)\r\n\r\n########################################\r\n\r\n# A. Sereja and Dima #\r\n\r\n########################################\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n# s = 0\r\n# d = 0\r\n# i = 0\r\n# while(i != n):\r\n# if(i % 2 == 0):\r\n# s += max(a[0], a[-1])\r\n# a.remove(max(a[0], a[-1]))\r\n# i += 1\r\n# else:\r\n# d += max(a[0], a[-1])\r\n# a.remove(max(a[0], a[-1]))\r\n# i += 1\r\n# print(\"{} {}\".format(s, d))\r\n\r\n########################################\r\n\r\n# A. Lucky Division #\r\n\r\n########################################\r\n\r\n# lucky_numbers = [4, 7, 47, 44, 74, 77, 444, 447, 477, 474, 744, 747, 774, 777]\r\n# n = int(input())\r\n# flag = 'NO'\r\n# for i in lucky_numbers:\r\n# if(n % i == 0):\r\n# flag = \"YES\"\r\n# break\r\n# elif(i > n):\r\n# break\r\n# print(flag)\r\n\r\n########################################\r\n\r\n# A. IQ test #\r\n\r\n########################################\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nod = 0\r\nodi = 0\r\nev = 0\r\nevi = 0\r\nfor i in range(n):\r\n if(a[i] % 2 == 0):\r\n ev += 1\r\n evi = i\r\n else:\r\n od += 1\r\n odi = i\r\nif(ev == 1):\r\n print(evi+1)\r\nelse:\r\n print(odi+1)\r\n", "n = int(input())\r\narr = input()\r\narr = arr.split()\r\nodd = []\r\neven = []\r\nfor i in range(0, n):\r\n if(int(arr[i])%2 == 0):\r\n even.append(arr[i])\r\n else:\r\n odd.append(arr[i])\r\nif(len(even) == 1):\r\n x = even[0]\r\nelse:\r\n x = odd[0]\r\nn = arr.index(x)\r\nprint(n+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\neven, odd = 0, 0\r\nlast_even, last_odd = 0, 0\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n even += 1\r\n last_even = i\r\n else:\r\n odd += 1\r\n last_odd = i\r\n\r\nif odd == 1:\r\n print(last_odd + 1)\r\nelse:\r\n print(last_even + 1)\r\n ", "n = int(input())\nz = list(map( int, input().split() ) )\nodds = 0\nevens = 0\nfor i in z :\n if i%2 : \n odds += 1\n else : \n evens += 1\n\nflag = False\nif odds == 1 : \n for ind,i in enumerate(z) : \n # print(ind, i)\n if i%2 == 1 : \n print(ind+1)\n flag = True\n break\n\nif not flag:\n for ind,i in enumerate(z) : \n if i%2 == 0 : \n print(ind+1)\n flag = True\n break", "n = int(input())\r\nlist = list(map(int, input().split()))\r\n\r\neven = 0\r\nodd = 0\r\n\r\nfor x in list:\r\n if x % 2 == 0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even > odd:\r\n for _ in range(n):\r\n if list[_] % 2 == 1:\r\n print(_ + 1)\r\nelse:\r\n if even < odd:\r\n for _ in range(n):\r\n if list[_] % 2 == 0:\r\n print(_ + 1)\r\n", "def find_different_evenness(n, numbers):\r\n odd_count = 0\r\n even_count = 0\r\n last_odd_index = -1\r\n last_even_index = -1\r\n\r\n for i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n last_even_index = i\r\n else:\r\n odd_count += 1\r\n last_odd_index = i\r\n\r\n if even_count == 1:\r\n return last_even_index + 1\r\n else:\r\n return last_odd_index + 1\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\nresult = find_different_evenness(n, numbers)\r\nprint(result)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif((a[0] % 2) * (a[1] % 2) == 0 and (a[1] % 2) * (a[2] % 2) == 0 and (a[0] % 2) * (a[2] % 2) == 0):\r\n for i in range (n):\r\n if(a[i] % 2 == 1):\r\n print(i + 1)\r\nelse:\r\n for i in range (n):\r\n if (a[i] % 2 == 0):\r\n print(i + 1)", "n = int(input())\nnums = list(map(int, input().split()))\neven = 0\nodd = 0\nx = 0\ny = 0\n\nfor i in range(len(nums)) :\n if nums[i] % 2 == 0 :\n even += 1\n x = i + 1\n else :\n odd += 1\n y = i + 1\n\nif even >= odd :\n print(y)\nelse :\n print(x)", "\n\neenNum = []\nodNum = []\n\nb = []\nnum = input()\na = input().split(' ')\nfor i in a:\n\tb.append(int(i))\nfor i in b:\n\tif i%2==0:\n\t\teenNum.append(i)\n\telse:\n\t\todNum.append(i)\n\nif len(eenNum) > len(odNum):\n\tprint(b.index(odNum[0])+1)\nelse:\n\tprint(b.index(eenNum[0])+1)\n\n\n\n\n\t \t \t \t \t \t\t \t \t \t \t \t\t\t\t", "n=int(input())\r\ns=list(str(input()).split())\r\ns=[int(i) for i in s]\r\nsum=0\r\nfor i in range(n):\r\n a=s[i]%2\r\n sum=sum+a\r\nif sum==1:\r\n for i in range(n):\r\n a=s[i]%2\r\n if a==1:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n a=s[i]%2\r\n if a==0:\r\n print(i+1)", "n=int(input())\r\nline=input().split()\r\ns=0\r\nfor i in range(n):\r\n if int(line[i])%2==0:\r\n s=s+1\r\nif s==1:\r\n for i in range(n):\r\n if int(line[i])%2==0:\r\n a=line[i]\r\nelse:\r\n for i in range(n):\r\n if int(line[i])%2!=0:\r\n a=line[i]\r\nprint(line.index(a)+1)", "n = int(input())\r\na = [int(t)%2 for t in input().split(\" \")]\r\ns_s = a[0]%2\r\ns_p = a[2]%2\r\nz = 0\r\nk = 0\r\nfor i in range(1, n-1):\r\n s_s = a[i+1]%2\r\n s_p = a[i-1]%2\r\n if a[i]%2 != s_s and a[i]%2 != s_p:\r\n z = i+1\r\n k = 1\r\n print(z)\r\n break\r\n else:\r\n z = a[i]%2\r\n\r\nif k == 0:\r\n if a[0]%2 == z:\r\n print(n)\r\n else:\r\n print(1)\r\n\r\n\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 25 18:39:05 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\ns=list(map(int, input().split()))\r\np=[]\r\nfor i in range(n):\r\n p.append(s[i]%2)\r\nfor j in range(n):\r\n if p.count(p[j])==1:\r\n print(j+1)", "a = int(input())\r\nbo = 0\r\nren = 0\r\nb = input().split()\r\nfor i in range(len(b)):\r\n if int(b[i]) % 2 == 0:\r\n ren += 1\r\n else:\r\n bo += 1\r\nfor i in range(len(b)):\r\n if int(b[i]) % 2 == 0 and ren < bo:\r\n print(i + 1)\r\n elif int(b[i]) % 2 != 0 and ren > bo:\r\n print(i + 1)\r\n else:\r\n flag = 1", "def solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n b = []\r\n c = []\r\n for i in range(n):\r\n if (a[i] % 2 == 0):\r\n b.append(i + 1)\r\n else:\r\n c.append(i + 1)\r\n if (len(b) == 1):\r\n print(b[0])\r\n else:\r\n print(c[0])\r\n\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve()", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in b:\r\n if i%2==0:\r\n c.append(1)\r\n else:\r\n c.append(0)\r\nfor i in range(a):\r\n if c.count(1)>c.count(0) and c[i]==0:\r\n print(i+1)\r\n elif c.count(1)<c.count(0) and c[i]==1:\r\n print(i+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(l[i]%2)\r\nb=a.count(0)\r\nc=a.count(1)\r\nif b>c:\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)\r\n\r\n \r\n", "def find_even(seq,n):\r\n default_is_even = None\r\n if (seq[0]%2 == 0 and seq[1]%2 == 0) or \\\r\n (seq[0]%2 == 0 and seq[2]%2 == 0) or \\\r\n (seq[1]%2 == 0 and seq[2]%2 == 0):\r\n default_is_even = True\r\n else:\r\n default_is_even = False\r\n if default_is_even:\r\n for i in range(n):\r\n if seq[i]%2 != 0:\r\n return i+1\r\n else:\r\n for i in range(n):\r\n if seq[i]%2 == 0:\r\n return i+1\r\n\r\nn = int(input())\r\nseq = list(map(int, input().split()))\r\nprint(find_even(seq,n))", "n = int(input())\r\nnum = input().split()\r\nstep1 = 0\r\nstep2 = 0\r\ns1 = 0\r\ns2 = 0\r\nfor i in range(n):\r\n num[i] = int(num[i])\r\nfor el in num:\r\n if el % 2 == 0:\r\n step2 += 1\r\n else:\r\n step1 += 1\r\nif step1 == 1:\r\n for el in num:\r\n if el % 2 == 0:\r\n s1 += 1\r\n else:\r\n break\r\nelif step2 == 1:\r\n for el in num:\r\n if el % 2 != 0:\r\n s2 += 1\r\n else:\r\n break\r\nif step1 == 1:\r\n print(s1 + 1)\r\nelse:\r\n print(s2 + 1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\ncount_odd = 0\r\ncount_even = 0\r\n\r\nfor i in numbers:\r\n if i % 2 == 0:\r\n count_even += 1\r\n else:\r\n count_odd += 1\r\n\r\nif count_even > count_odd:\r\n for i in range(0,n):\r\n if numbers[i] % 2 != 0:\r\n print(i+1)\r\n break\r\n\r\nelse:\r\n for i in range(0,n):\r\n if numbers[i] % 2 == 0:\r\n print(i+1)\r\n break", "input()\nnums = [int(c) for c in input().split()]\n\neven = 0\nevenIndex = 0\nodd = 0\noddIndex = 0\n\nfor i in range(len(nums)):\n if nums[i] & 1:\n odd += 1\n oddIndex = i + 1\n else:\n even += 1\n evenIndex = i + 1\n\nif odd == 1:\n print(oddIndex)\nelse:\n print(evenIndex)\n", "n=int(input())\r\nch=input()\r\nL=[int(i) for i in ch.split(' ')]\r\nif L[0]%2!=L[1]%2:\r\n L.pop(0)\r\n L1=[i%2 for i in L]\r\n if len(set(L1))==1:\r\n print(1)\r\n else:\r\n print(2)\r\nelse:\r\n for i in range(1,len(L)-1):\r\n if (L[i]%2)!=(L[i+1]%2): \r\n print(i+2)\r\n break\r\n \r\n", "n = int(input())\r\narr = [int(num) for num in input().split(' ')]\r\nlastOdd = -1\r\nlastEven = -1\r\nfor i in range(len(arr)):\r\n if arr[i] % 2==0:\r\n lastEven = i\r\n else:\r\n lastOdd = i\r\nfor i in range(len(arr)):\r\n if arr[i]%2==0 and lastEven!=i:\r\n print(lastOdd+1)\r\n break\r\n if arr[i]%2==1 and lastOdd!=i:\r\n print(lastEven+1)\r\n break", "import math\n\nt = int(input())\n\ninfo = list(map(int, input().split()))\n\nmodulo = 0\ngood = True\nif info[0] % 2 == info[1] % 2:\n modulo = info[0] % 2\nelif info[0] % 2 == info[2] % 2:\n modulo = info[0] % 2\nelse: \n print(1)\n good = False\n\nif good:\n for i in range(1,t):\n if info[i] % 2 != modulo:\n print(i+1)\n break\n \n\n \n", "n = int(input())\r\nnums = input().split(' ')\r\n\r\nodd = 0\r\neven = 0\r\nfor num in nums:\r\n if int(num) % 2 == 0:\r\n even +=1\r\n else:\r\n odd +=1\r\n\r\nfor ind,num in enumerate(nums):\r\n if odd>even:\r\n if int(num) % 2 == 0:\r\n print(ind+1)\r\n else:\r\n if int(num) % 2 != 0:\r\n print(ind+1)\r\n\r\n \r\n\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\na=[]\r\nfor i in x:\r\n a.append(i%2)\r\nif sum(a)==1:\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)\r\n", "n = int(input())\r\nls = [int(i) for i in input().split()]\r\n\r\neven = 0\r\nodd = 0\r\n\r\nfor i, val in enumerate(ls):\r\n if val % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if odd * even >= 2:\r\n if even >= 2:\r\n for j, val2 in enumerate(ls):\r\n if val2 % 2:\r\n print(j + 1)\r\n break\r\n else:\r\n for j, val2 in enumerate(ls):\r\n if val2 % 2 == 0:\r\n print(j + 1)\r\n break\r\n break\r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\nk = [i for i in s if i%2]\r\nk2 = [i for i in s if i%2==0]\r\nif(len(k)==1):\r\n print(s.index(k[0])+1)\r\nelse:\r\n print(s.index(k2[0])+1)", "n=int(input())\r\nlst=list(map(int, input().split()))\r\nlst2=[]\r\nfor i in lst:\r\n lst2.append(i%2)\r\ncount=0\r\nfor i in lst2[0:3]:\r\n if i==0:\r\n count+=1\r\nif count>=2:\r\n print(lst2.index(1)+1)\r\nelse:\r\n print(lst2.index(0)+1)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nevens = 0\r\neven = 0\r\nodds = 0\r\nodd = 0\r\nfor i in range(len(s)):\r\n if s[i] % 2 == 0:\r\n evens += 1\r\n even = i+1\r\n else:\r\n odds += 1\r\n odd = i+1\r\n\r\nif evens == 1:\r\n print(even)\r\nelse:\r\n print(odd)", "n = int(input())\r\nevenness = list(map(lambda x: int(x) % 2, input().split()))\r\nif evenness[0] != evenness[1]:\r\n if evenness[0] == evenness[2]: print(\"2\")\r\n else: print(\"1\")\r\nelse:\r\n for j in range(n):\r\n if evenness[j] != evenness[0]: print(j+1)", "n=int(input())\na=[int(i) for i in input().split()]\nb=[]\nfor i in a:\n b.append(i%2)\nc=b.copy()\nb.sort()\nprint(c.index(1-b[1])+1)\n", "n = int(input())\r\nnumbers = [int(number) for number in input().split(' ')]\r\n\r\neven = []\r\nodd = []\r\nfor number in numbers:\r\n if number % 2 == 0:\r\n even.append(number)\r\n else:\r\n odd.append(number)\r\n if odd and even != []:\r\n if len(odd) > len(even):\r\n print(numbers.index(even[0])+1)\r\n exit()\r\n elif len(odd) < len(even):\r\n print(numbers.index(odd[0]) + 1)\r\n exit()", "x=int(input())\r\na,b=0,0\r\ny=input().split()\r\nfor i in y :\r\n if int(i)%2==0:\r\n a+=1\r\n \r\n else:\r\n b+=1\r\n \r\nif b==1:\r\n for i in y:\r\n if int(i)%2!=0:\r\n print(y.index(i)+1)\r\nelse:\r\n for i in y:\r\n if int(i)%2==0:\r\n print(y.index(i)+1)\r\n\r\n \r\n \r\n \r\n ", "n = int(input())\r\na =list(map(int, input().split()))\r\n\r\nb=0\r\nc=0\r\nfor i in a:\r\n if i%2==0:\r\n b+=1\r\n else:\r\n c+=1\r\nif b>c:\r\n for i in range(len(a)):\r\n if a[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]%2==0:\r\n print(i+1)\r\n\r\n\r\n", "n = int(input())\r\ninp = list(map(int, input().split()))\r\n\r\nevenIdx = [(i + 1) for i in range(n) if inp[i] % 2 == 0]\r\noddIdx = [(i + 1) for i in range(n) if inp[i] % 2 != 0]\r\n\r\nif len(evenIdx) == 1:\r\n print(evenIdx[0])\r\nelse:\r\n print(oddIdx[0])", "'''\r\nCreated on Jul 30, 2014\r\n\r\n@author: mohamed\r\n'''\r\nn=int(input())\r\nd=list(map(int,input().split()))\r\nfor i in range(n):d[i]=d[i]%2\r\nprint(d.index(int(d.count(1)==1))+1)", "n = int(input())\r\na = [int(x) % 2 for x in input().split()]\r\nprint(a.index(sum(a) == 1)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nce,co=0,0\r\nb,c=[],[]\r\nfor i in a:\r\n if(i%2==0):\r\n ce=ce+1\r\n b.append(i)\r\n else:\r\n co=co+1\r\n c.append(i)\r\nif(ce>co):\r\n print(a.index(c[0])+1)\r\nelse:\r\n print(a.index(b[0])+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\nfor i in range(3):\r\n if l[i]%2==0:\r\n even+=1 \r\n else:\r\n odd+=1 \r\nif even>odd:\r\n for i in range(n):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break", "n=int(input())\r\nb=[int(x)%2 for x in input().split(' ', n - 1)]\r\nif b.count(0)>b.count(1):\r\n print(b.index(1)+1)\r\nelse:\r\n print(b.index(0)+1)", "n=int(input())\na=list(map(int,input().split()))\nif (a[0]&1)^(a[1]&1) and (a[0]&1)^(a[2]&1):\n print(1)\nfor i in range(1,n-1):\n if (a[i]&1)^(a[i-1]&1) and (a[i]&1)^(a[i+1]&1):\n print(i+1)\nif (a[n-1]&1)^(a[n-2]&1) and (a[n-1]&1)^(a[n-3]&1):\n print(n)", "n = int(input())\r\nline = input().split()\r\nline = [int(i) % 2 for i in line]\r\nif line.count(1) == 1:\r\n print(line.index(1) + 1)\r\nelse:\r\n print(line.index(0) + 1)\r\n", "n=int(input())\r\nc=0\r\nd=0\r\nl=list(map(int,input().split()))\r\nfor i in range(0,len(l)):\r\n if l[i]%2==0:\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c==1 or c<d:\r\n for i in range(0,len(l)):\r\n if l[i]%2==0:\r\n break\r\n print(i+1)\r\nelif(d==1 or c>d):\r\n for i in range(0,len(l)):\r\n if l[i]%2!=0:\r\n break\r\n print(i+1)", "t=1\r\nfor _ in range(t):\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\todds=evens=0\r\n\tanso=anse=-1\r\n\tfor i in range(n):\r\n\t\tif(arr[i]%2==0):\r\n\t\t\tanse=i\r\n\t\t\tevens+=1\r\n\t\telse:\r\n\t\t\tanso=i\r\n\t\t\todds+=1\r\n\tif(evens==1):\r\n\t\tprint(anse+1)\r\n\telse:\r\n\t\tprint(anso+1)", "n = int(input())\narr = [int(s) for s in input().split()]\nF = dict()\nfor i in range(len(arr)):\n m = arr[i]&1\n if m not in F:\n F[m] = [i]\n else:\n F[m].append(i)\nif len(F[0]) == 1:\n print(F[0][0]+1)\nelse:\n print(F[1][0]+1)\n\n", "d = [[0, 0], [0, 0]]\ninp, i = input(), 1\nnl = [int(x)&1 for x in input().split()]\nfor n in nl:\n d[n][0] += 1\n d[n][1] = i\n i += 1\nif d[0][0] == 1:\n print(d[0][1])\nif d[1][0] == 1:\n print(d[1][1])\n", "n=int(input())\r\na=list(map(int,input().split()))\r\no=0\r\ne=0\r\np1=0\r\np2=0\r\nfor i in range(n):\r\n\tif a[i]%2==0:\r\n\t\te+=1\r\n\t\tp1=i\r\n\telse:\r\n\t\to+=1\r\n\t\tp2=i\r\nif e>o:\r\n\tprint(p2+1)\r\nelse:\r\n\tprint(p1+1)", "n=int(input())\r\nm=[int(x) for x in input().split()]\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nfor i in m:\r\n if i%2==0:\r\n a+=1\r\n b=i\r\n elif i%2!=0:\r\n c+=1\r\n d=i\r\n\r\nif a>c:\r\n print(m.index(d)+1)\r\nelif a<c:\r\n print(m.index(b)+1)\r\n ", "def fun(n,li):\r\n an=[i & 1 for i in li]\r\n if sum(an) ==1:\r\n print(an.index(1)+1)\r\n else:\r\n print(an.index(0)+1)\r\n \r\n \r\n \r\nn=int(input())\r\nli=list(map(lambda x:int(x),input().split()))\r\nfun(n,li)\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()] \r\na=0\r\narr1=[]\r\nb=0\r\narr2=[]\r\nfor j in arr:\r\n if j%2==0:\r\n arr1.append(j)\r\n a+=1 \r\n elif j%2==1:\r\n arr2.append(j)\r\n b+=1\r\nif a<b:\r\n for k in range(n):\r\n if arr[k]==arr1[0]:\r\n print(k+1)\r\nelse:\r\n for l in range(n):\r\n if arr[l]==arr2[0]:\r\n print(l+1)", "_1 = '236a'\r\n# count = 0\r\n# l = [list(map(int, input().split())) for i in range(5)]\r\n# for i in range(5):\r\n# for j in range(5):\r\n# if l[i][j] == 1:\r\n#\r\n# if i > 2:\r\n# count += i - 2\r\n# elif i < 2:\r\n# count += 2 - i\r\n# if j > 2:\r\n# count += j - 2\r\n# elif j < 2:\r\n# count += 2 - j\r\n# print(count)\r\n_2 = '339a'\r\n# n = list(map(str, input().split('+')))\r\n# n.sort()\r\n# print('+'.join(n))\r\n_3 = '266a'\r\n# count = 0\r\n# t = 0\r\n# n1 = int(input())\r\n# n = list(str(input()))\r\n# for i in range(1,n1,1):\r\n# if n[i] == n[i-1]:\r\n# count +=1\r\n# print(count)\r\n_4 = '96a'\r\n# flag = False\r\n# flag1 = False\r\n# p0=0\r\n# p1=0\r\n# l = list(str(input()))\r\n# for i in l:\r\n# if i == '0':\r\n# p0 += 1\r\n# if p0 >= 7:\r\n# flag = True\r\n# else:\r\n# p0 = 0\r\n# for i in l:\r\n# if i == '1':\r\n# p1 += 1\r\n# if p1 >= 7:\r\n# flag1 = True\r\n# else:\r\n# p1 = 0\r\n# if flag == True or flag1 == True:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n_5 = '236a'\r\n# l = list(str(input()))\r\n# if len(set(l)) % 2 == 0:\r\n# print(\"CHAT WITH HER!\")\r\n# else:\r\n# print(\"IGNORE HIM!\")\r\n_6 = '281a'\r\n# l = list(str(input()))\r\n# t = l[0].upper()\r\n# print(t + ''.join(l[1:]))\r\n_7 = '546a'\r\n# s = 0\r\n# a,b = map(int, input().split())\r\n# while a <= b:\r\n# a*=3\r\n# b*=2\r\n# s+=1\r\n# print(s)\r\n_8 = '116a'\r\n# t = 0\r\n# l1 = []\r\n# n = int(input())\r\n# l = [list(map(int, input().split())) for i in range(n)]\r\n# for i in range(n):\r\n# t += l[i][1]\r\n# t -= l[i][0]\r\n# l1.append(t)\r\n# print(max(l1))\r\n_9 = '977a'\r\n# n,k = map(int, input().split())\r\n# for i in range(k):\r\n# if n % 10 == 0:\r\n# n/=10\r\n# else:\r\n# n-=1\r\n# print(int(n))\r\n_10 = '266b'\r\n# n = str(input())\r\n# l = list(n)\r\n# low = 0\r\n# up = 0\r\n# for i in l:\r\n# if i.islower():\r\n# low += 1\r\n# else:\r\n# up += 1\r\n# if low >up:\r\n# print(n.lower())\r\n# elif low < up:\r\n# print(n.upper())\r\n# else:\r\n# print(n.lower())\r\n_11 = '110a'\r\n# n = list(str(input()))\r\n# l=[]\r\n# for i in range(len(n)):\r\n# if n[i] == '4' or n[i] == '7':\r\n# l.append(i)\r\n# if len(l) == 4 or len(l) == 7:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n_12 = '41a'\r\n# n = str(input())\r\n# n1 = str(input())\r\n# if n1 == n[::-1]:\r\n# print('YES')\r\n# else:\r\n# print(\"NO\")\r\n_13 = '734a'\r\n# k = int(input())\r\n# n = list(str(input()))\r\n# a =0\r\n# d =0\r\n# for i in n:\r\n# if i == 'A':\r\n# a += 1\r\n# else:\r\n# d += 1\r\n# if a >d:\r\n# print('Anton')\r\n# elif d > a:\r\n# print('Danik')\r\n# elif a == d:\r\n# print('Friendship')\r\n_14 = '133a'\r\n# n = list(str(input()))\r\n# flag = False\r\n# for i in n:\r\n# if i == 'H' or i == 'Q' or i == '9':\r\n# flag = True\r\n# if flag:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n_15 = '467a'\r\n# count = 0\r\n# n = int(input())\r\n# l = [list(map(int, input().split())) for i in range(n)]\r\n# for i in range(len(l)):\r\n# if l[i][1] - l[i][0] >= 2:\r\n# count += 1\r\n# print(count)\r\n_16 = '158a'\r\n# count = 0\r\n# flag = False\r\n# n,k = map(int,input().split())\r\n# l = list(map(int, input().split()))\r\n# ball = l[k-1]\r\n# for i in l:\r\n# if ball > 0:\r\n# if i >= ball:\r\n# count += 1\r\n# else:\r\n# flag = True\r\n# if flag:\r\n# for i in l:\r\n# if i > 0:\r\n# count += 1\r\n# print(count)\r\n# else:\r\n# print(count)\r\n_17 = '677a'\r\n# count = 0\r\n# n,h = map(int, input().split())\r\n# l = list(map(int, input().split()))\r\n# for i in l:\r\n# if i > h:\r\n# count += 2\r\n# else:\r\n# count += 1\r\n# print(count)\r\n_18 = '580a'\r\n# n = int(input())\r\n# l = list(map(int, input().split()))\r\n# r = []\r\n# count = 0\r\n# for i in range(0,n):\r\n# if l[i-1] <= l[i]:\r\n# count += 1\r\n# r.append(count)\r\n# if l[i-1] > l[i]:\r\n# count = 0\r\n# count +=1\r\n# print(max(r))\r\n_19 = '344a'\r\n# n = int(input())\r\n# l = [list(map(int, input().split())) for i in range(n)]\r\n# c = 1\r\n# t = l[0]\r\n# for i in range(1,n):\r\n# if l[i] != t:\r\n# c+=1\r\n# t = l[i]\r\n# print(c)\r\n_20 = '1030a'\r\n# flag = False\r\n# n = int(input())\r\n# l = list(map(int, input().split()))\r\n# for i in l:\r\n# if i == 1:\r\n# flag = True\r\n# if flag:\r\n# print('HARD')\r\n# else:\r\n# print('EASY')\r\n_21 = '705a'\r\n# n = int(input())\r\n# n1 = 0\r\n# if n%2==0:\r\n# n1 = n/2-1\r\n# n1 = int(n1)\r\n# else:\r\n# n1 = ((n+1)/2)-1\r\n# n1 = int(n1)\r\n# h = 'I hate '\r\n# t = 'that '\r\n# l = 'I love '\r\n# if n == 1:\r\n# print('I hate it')\r\n# elif n == 2:\r\n# print('I hate that I love it')\r\n# elif n == 3:\r\n# print('I hate that I love that I hate it')\r\n# elif n > 3:\r\n# if n % 2 == 0:\r\n# print(((h+t)+(l+t))*n1+((h+t)+(l+'it')))\r\n# else:\r\n# print(((h+t)+(l+t))*n1+(h+'it'))\r\n_22 = '318a'\r\n# n,k = map(int, input().split())\r\n# l = []\r\n# for i in range(1,n+1):\r\n# if i%2!=0:\r\n# l.append(i)\r\n# for i in range(1,n+1):\r\n# if i%2==0:\r\n# l.append(i)\r\n# print(l[k-1])\r\n_23 = '479a'\r\n# n1 = int(input())\r\n# n2 = int(input())\r\n# n3 = int(input())\r\n# ans = n1+n2+n3\r\n# ans = max(ans,(n1+n2)*n3)\r\n# ans = max(ans, n1*(n2+n3))\r\n# ans = max(ans, n1*n2*n3)\r\n# print(ans)\r\n_24 = '486a'\r\n# n = int(input())\r\n# if n%2 ==0:\r\n# print(int(n/2))\r\n# else:\r\n# print((round((n+1)/2))*(-1))\r\n_25 = '61a'\r\n# o = []\r\n# n = list(str(input()))\r\n# n1 = list(str(input()))\r\n# for i in range(len(n)):\r\n# if n[i] == n1[i]:\r\n# o.append('0')\r\n# else:\r\n# o.append('1')\r\n# print(''.join(o))\r\n_26 = '405a'\r\n# n = int(input())\r\n# l = list(map(int, input().split()))\r\n# l1 = []\r\n# l.sort()\r\n# for i in l:\r\n# l1.append(str(i))\r\n# print(' '.join(l1))\r\n_27 = '200b'\r\n# def fixed_number(num):\r\n# return f\"{num:.{12}f}\"\r\n# n = int(input())\r\n# l = list(map(int, input().split()))\r\n# s = sum(l)\r\n# print(fixed_number(s/n))\r\n_28 = '337a'\r\n# l = list(map(str, input().split('WUB')))\r\n# for i in l:\r\n# if i == '':\r\n# l.remove(i)\r\n# print(' '.join(l))\r\n_29 = '148a'\r\n# n = int(input())\r\n# x = list(map(int,input().split()))[1:]\r\n# y = list(map(int,input().split()))[1:]\r\n# lst = [0]*n\r\n# concat = x + y\r\n# for i in concat:\r\n# lst[i-1] = 1\r\n# if 0 not in lst:\r\n# print(\"I become the guy.\")\r\n# else:\r\n# print(\"Oh, my keyboard!\")\r\n_30 = '228a'\r\n# x = list(map(int,input().split()))\r\n# c= set(x)\r\n# if 4 - len(c) == 0:\r\n# print(0)\r\n# else:\r\n# print(4 - len(c))\r\n_31 = '25a'\r\nn = int(input())\r\n\r\nnums = list(map(int,input().split()))\r\n\r\neven_index = 0\r\nodd_index = 0\r\n\r\nparity = 0\r\n\r\nfor i in range(n):\r\n if nums[i] %2 == 0:\r\n if even_index != 0:\r\n parity = 1\r\n even_index = i+1\r\n else:\r\n odd_index = i+1\r\n\r\nif parity == 0:\r\n print(even_index)\r\nelse:\r\n print(odd_index)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nvar,op=-1,0\r\nif((a[0] & 1) and (a[1] & 1)):\r\n\tvar=1\r\nelif((a[0] & 1==0) and (a[1] & 1==0)):\r\n\tvar=0\r\nelif((a[0]%2!=0 and a[2]%2!=0) or (a[0]%2==0 and a[2]%2==0)):\r\n\top=1\r\nelif((a[1]%2!=0 and a[2]%2!=0) or (a[1]%2==0 and a[2]%2==0)):\r\n\top=0\r\nif(var==-1):\r\n\tprint(op+1)\r\nelse:\r\n\tfor i in range(2,n):\r\n\t\tif((a[i] & 1) !=var):\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n=int(input())\r\ns=list(map(int,input().split()))\r\na=b=0\r\nso=[]\r\nsj=[]\r\nfor i in range(n):\r\n if s[i] %2 == 0:\r\n so.append(i+1)\r\n a+=1\r\n else:\r\n b+=1\r\n sj.append(i+1)\r\nif a==1:\r\n print(so[0])\r\nelse:\r\n print(sj[0])", "input()\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\nc_count = []\r\nnc_count = []\r\n\r\nfor number in numbers:\r\n if ((len(c_count) > 1) and (len(nc_count) != 0)) or ((len(nc_count) > 1) and (len(c_count) != 0)):\r\n break\r\n if number % 2 == 0:\r\n c_count.append(number)\r\n else:\r\n nc_count.append(number)\r\n\r\nif len(c_count) == 1:\r\n print(list(numbers).index(c_count[0]) + 1)\r\nelse:\r\n print(list(numbers).index(nc_count[0]) + 1)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nch = 0\r\nnech = 0\r\nindexch = 0\r\nindexnech = 0\r\ni = 1\r\nfor n in arr:\r\n if n % 2 == 0:\r\n ch += 1\r\n indexch = i\r\n else:\r\n nech += 1\r\n indexnech = i\r\n i += 1\r\nprint(indexnech if nech == 1 else indexch)\r\n", "def solve(a):\r\n even = 0\r\n odd = 0\r\n for i in range(len(a)):\r\n if a[i]%2==0:\r\n evenindex = i\r\n even +=1\r\n else:\r\n oddindex = i\r\n odd += 1\r\n if odd ==1:\r\n return oddindex+1\r\n return evenindex+1\r\n\r\nt = int(input())\r\na = list(map(int,input().split()))\r\nprint(solve(a))\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nbrp=0\r\nbrnep=0\r\nfor i in range(0,n):\r\n if a[i]%2==0:\r\n brp+=1\r\n else: brnep+=1\r\nif brp==1:\r\n for i in range(0,n):\r\n if a[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(0,n):\r\n if a[i]%2==1:\r\n print(i+1)\r\n\r\n \r\n\r\n", "n= int(input())\r\nm= [int(x) for x in input().split()]\r\neven=[]\r\nodd=[]\r\nfor i in m:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(even)>len(odd):\r\n print(m.index(odd[0])+1)\r\nelse:\r\n print(m.index(even[0])+1)", "n=int(input())\r\nlists=input().split()\r\nh=0\r\nwhile h<n:\r\n\tlists[h]=int(lists[h])\r\n\th+=1\r\n\t\r\na=lists[0]%2\r\nb=lists[1]%2\r\nc=lists[2]%2\r\nif a+b+c<=1:\r\n\ti=0\r\nelse:\r\n\ti=1\r\nfor x in lists:\r\n\tif x%2==i:\r\n\t\tcontinue\r\n\telse:\r\n\t\t\r\n\t\tprint(lists.index(x)+1)\r\n\t\tbreak\r\n\t\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc,c1=0,0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n c=c+1 \r\n flag=i+1 \r\n else:\r\n c1=c1+1 \r\n fla=i+1 \r\nif(c==1):\r\n print(flag)\r\nelse:\r\n print(fla)", "t=int(input())\r\nn=list(map(int,input().split()))\r\nx,y=0,0\r\nfor i in range(t):\r\n if n[i]%2==0:\r\n x+=1\r\n else:\r\n y+=1\r\nif x>y:\r\n for i in range(t):\r\n if n[i]%2!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(t):\r\n if n[i]%2==0:\r\n print(i+1)\r\n break\r\n", "le=int(input())\na=list(map(int,input().split()))\necount=0\nocount=0\neindex=0\noindex=0\nfor i in range(0,len(a)):\n if min(ecount,ocount)==1 and max(ecount,ocount)>1:\n break\n if a[i]%2==0:\n ecount+=1\n eindex=i+1\n else:\n ocount+=1\n oindex=i+1\nif ecount>1:\n print(oindex)\nelse:\n print(eindex)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(a[0]%2==a[1]%2):\r\n p=a[0]%2\r\n for x in range(1,n):\r\n if(a[x]%2!=p):\r\n break\r\n print(x+1)\r\nelse:\r\n if(a[2]%2==a[1]%2):\r\n print(\"1\")\r\n else:\r\n print(\"2\")", "n=int(input())\nnum=list(map(int,input().split()))\n\nodd_list=[]\neven_list=[]\n# print(num)\nfor i in range(len(num)):\n if num[i]%2==0:\n even_list.append(num[i])\n else:\n odd_list.append(num[i])\n\n# print(odd_list,even_list)\nif len(odd_list)>len(even_list):\n print(num.index(even_list[0])+1)\nelse:\n print(num.index(odd_list[0])+1)\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\neven = [e for e in numbers if e%2==0]\r\nodd = [e for e in numbers if e%2==1]\r\nif len(even) < len(odd):\r\n print(numbers.index(even[0])+1)\r\nelse:\r\n print(numbers.index(odd[0])+1)", "n = int(input())\r\nk = [int(j) for j in input().split()]\r\na = k[0]%2\r\nw = 0\r\nfor l in range(n):\r\n w += k[l]%2 - a\r\nif abs(w) == n-1:\r\n print(1)\r\nelse:\r\n s =1\r\n for i in range(n):\r\n if k[i]%2 == a:\r\n s += 1\r\n else:\r\n break\r\n print(s)", "n=int(input())\r\nl = list(map(int,input().split()))\r\na,x,y=0,0,0\r\nfor i in l:\r\n if(i%2==0):\r\n a+=1\r\n x = l.index(i)+1\r\n else: y = l.index(i)+1\r\nif(a==1): print(x)\r\nelse: print(y)", "t=int(input())\r\nlst=list(map(int,input().split()))\r\nlst1=[]\r\nfor i in range(t):\r\n if(lst[i]%2==0):\r\n lst1.append(0)\r\n else:\r\n lst1.append(1)\r\nif(lst1[0]==lst1[1]):\r\n p=lst1[0]\r\nelse:\r\n if(lst1[0]==lst1[2]):\r\n p=lst1[0]\r\n else:\r\n p=lst1[1]\r\nfor i in range(t):\r\n if(lst1[i]!=p):\r\n print(i+1)\r\n break", "N = int(input())\r\nArray = [int(x) for x in input().split()]\r\ngenap = 0\r\nganjil = 0\r\n\r\ndef tentu(i) :\r\n duar = Array[i]%2\r\n if duar == 0 :\r\n return True\r\n else :\r\n return False\r\n\r\nfor i in range (N) :\r\n if tentu(i) == True :\r\n genap +=1\r\n else :\r\n ganjil += 1\r\n\r\nfor i in range (N) :\r\n if genap == 1 :\r\n if tentu(i) == True :\r\n print(i+1)\r\n elif ganjil == 1 :\r\n if tentu(i) == False :\r\n print(i+1)", "n= int(input())\r\nls=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n ls[i]=ls[i]%2\r\nif ls[0]+ls[1]+ls[2]>=2:\r\n for i in range(n):\r\n if ls[i]==0:print(i+1)\r\nelse:\r\n for i in range(n):\r\n if ls[i]==1:print(i+1)", "n=int(input())\r\nd=[]\r\nfor i in list(map(int,input().split())):d.append(i%2)\r\nprint(d.index(int(d.count(1)==1))+1)", "t_inputs = input()\r\nnum = int(t_inputs)\r\n\r\ninput_string = input()\r\ninp_list = input_string.split()\r\n\r\ncount_even = 0\r\ncount_odd = 0\r\n\r\nfor elem in inp_list:\r\n\tif int(elem) % 2 == 0:\r\n\t\tcount_even += 1\r\n\telse:\r\n\t\tcount_odd += 1\r\n\r\nif count_odd == 1:\r\n\tfor elem in inp_list:\r\n\t\tif int(elem) % 2 != 0:\r\n\t\t\tprint(inp_list.index(elem) + 1)\r\nelif count_even == 1:\r\n\tfor elem in inp_list:\r\n\t\tif int(elem) % 2 == 0:\r\n\t\t\tprint(inp_list.index(elem) + 1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nce=0\r\nco=0\r\nle=0\r\nlo=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n ce+=1\r\n le=i\r\n else:\r\n co+=1\r\n lo=i\r\nif ce==1:\r\n print(le+1)\r\nelse:\r\n print(lo+1)\r\n ", "a=int(input())\nb=str(input())\nc=b.split(\" \")\nx=[int(char) for char in c]\ni=0\ndifferente=list()\ndifferento=list()\nfor i in range(0,a):\n if x[i]%2==0:\n differente.append(x[i])\n else:\n differento.append(x[i])\nif len(differente)==1:\n p=differente[0]\nelse:\n p=differento[0]\nprint(x.index(p)+1)\n ", "n, arr = int(input()), list(map(int, input().split()))\r\n\r\na, b, c = arr[0], arr[1], arr[2]\r\nev_cnt = 0\r\nfor i in (a, b, c):\r\n if i % 2 == 0:\r\n ev_cnt += 1\r\n\r\nif ev_cnt >= 2:\r\n # looking for odd one\r\n for i, v in enumerate(arr):\r\n if v % 2 == 1:\r\n print(i + 1)\r\nelse:\r\n for i, v in enumerate(arr):\r\n if v % 2 == 0:\r\n print(i + 1)\r\n", "n = int(input())\r\nln = list(map(int,input().split()))\r\nj = 0\r\nif (ln[0]%2==0 and ln[1]%2==0) or (ln[0]%2==0 and ln[2]%2==0) or (ln[2]%2==0 and ln[1]%2==0) :\r\n j = 1\r\nfor i in range(n):\r\n if ln[i]%2==j:\r\n print(i+1)\r\n break\r\n ", "total_numbers = int(input())\r\n\r\nnumbers = [int(x) for x in input().split()]\r\n\r\nevens = [number for number in numbers if number % 2 == 0]\r\nodds = [number for number in numbers if number % 2 != 0]\r\n\r\nif len(evens) > len(odds):\r\n print(numbers.index(odds[0]) + 1)\r\nelse:\r\n print(numbers.index(evens[0]) + 1)\r\n", "t = int(input())\r\nx = [int(x) for x in input().split()]\r\nones, twos = [[i for i in x if i % 2 == 0], [\r\n i for i in x if i % 2 != 0]]\r\nif len(ones) == 1:\r\n for i in ones:\r\n print(x.index(i) + 1)\r\n break\r\nelse:\r\n for i in twos:\r\n print(x.index(i) + 1)\r\n break\r\n", "a=int(input())\r\nb=[(int(x)%2) for x in input().split()]\r\nif b.count(1)>b.count(0):\r\n print(b.index(0)+1)\r\nelse:\r\n print(b.index(1)+1)", "n=int(input());ls= list( map( int, input().split()))\r\ncnt1= cnt0= idx1= idx0= 0\r\nfor num in range (0,n):\r\n if ls[num] %2==0:\r\n cnt1+=1\r\n idx1= num+1\r\n else:\r\n cnt0+=1\r\n idx0=num+1\r\nif(cnt1==1):\r\n print(idx1)\r\nelse:\r\n print(idx0)", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = [i%2 for i in l]\r\nif sum(a) > 1:\r\n print(a.index(0)+1)\r\nelse:\r\n print(a.index(1)+1)", "a=int(input())\r\nb=list(map(int,input().split()))\r\not=0\r\nt=0\r\nif b[0]%2==b[1]%2:\r\n t=b[0]%2\r\n if t==0:\r\n t=1\r\n else:\r\n t=0\r\nelse:\r\n if b[0]%2==b[2]%2:\r\n t=b[0]%2\r\n if t==0:\r\n t=1\r\n else:\r\n t=0\r\n else:\r\n t=b[0]%2\r\nfor x in range(a):\r\n if b[x]%2==t:\r\n print(x+1)\r\n quit()\r\n", "n=int(input())\r\na=0#oushu\r\nb=0#jishu\r\ns=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n a+=1\r\n else:b+=1\r\nif a>=b:\r\n for j in s:\r\n if j%2!=0:\r\n print(s.index(j)+1)\r\n break\r\nelse:\r\n for x in s:\r\n if x%2==0:\r\n print(s.index(x)+1)\r\n break", "n = int(input())\r\n\r\nnumE = 0\r\nnumO = 0\r\n\r\narr = list(map(int,input().split(\" \")))\r\n\r\nl = sorted(arr,key = lambda x:x%2)\r\n\r\nif l[0] % 2 != l[1] % 2:\r\n print(arr.index(l[0])+1)\r\nelse:\r\n print(arr.index(l[-1])+1)", "n = int(input())\r\nL = list(map(int,input().split()))\r\nL2 = []\r\nfor i in range(n):\r\n L2.append(L[i]%2)\r\nif L2.count(1) == 1:\r\n print(L2.index(1)+1)\r\nelse:\r\n print(L2.index(0)+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nev=0\r\nod=0\r\nfor i in l:\r\n if i%2==0:\r\n ev+=1\r\n else:\r\n od+=1\r\nif(ev==1):\r\n for i in range(len(l)):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(l)):\r\n if l[i]%2==1:\r\n print(i+1)\r\n break", "input()\r\nx=[int(i) for i in input().split()]\r\ny=[]\r\nfor i in x:\r\n if i%2==0:\r\n y.append(0)\r\n else:\r\n y.append(1)\r\nif y.count(1)>1:\r\n print(y.index(0)+1)\r\nelse:\r\n print(y.index(1)+1)", "#\n# ------------------------------------------------\n# ____ _ Generatered using\n# / ___| | |\n# | | __ _ __| | ___ _ __ ______ _\n# | | / _` |/ _` |/ _ \\ '_ \\|_ / _` |\n# | |__| (_| | (_| | __/ | | |/ / (_| |\n# \\____\\____|\\____|\\___|_| |_/___\\____|\n#\n# GNU Affero General Public License v3.0\n# ------------------------------------------------\n# Author : prophet\n# Created : 2020-08-09 10:26:56.777190\n# UUID : UyYso0zXRuO68AqP\n# ------------------------------------------------\n#\nproduction = True\n\nimport sys, math, collections, bisect, itertools, heapq, decimal, random, copy, re\n\ndef input(f = 0, m = 0):\n\n if m > 0: return [input(f) for i in range(m)]\n else:\n l = sys.stdin.readline()[:-1]\n\n if f >= 10:\n u = False\n f = int(str(f)[-1])\n else: u = True\n\n if f == 0: p = [l]\n elif f == 1: p = list(map(int, l.split()))\n elif f == 2: p = list(map(float, l.split()))\n elif f == 3: p = list(l)\n elif f == 4: p = list(map(int, list(l)))\n elif f == 5: p = l.split()\n\n return p if u else p[0]\n\ndef out(l, f = 0, n = True):\n\n if f == 0: p = str(l)\n elif f == 1: p = \" \".join(map(str, l))\n elif f == 2: p = \"\\n\".join(map(str, l))\n elif f == 3: p = \"\".join(map(str, l))\n\n print(p, end = \"\\n\" if n else \"\")\n\ndef log(*args):\n if not production:\n print(\"$$$\", end = \"\")\n print(*args)\n\nenu = enumerate\nter = lambda a, b, c: b if a else c\nceil = lambda a, b: -(-a // b)\n\ndef mapl(i, f = 0):\n\n if f == 0: return list(map(int, i))\n elif f == 1: return list(map(str, i))\n elif f == 2: return list(map(list, i))\n\n#\n# >>>>>>>>>>>>>>> START OF SOLUTION <<<<<<<<<<<<<<\n#\n\n\ndef solve():\n\n n = input(11)\n a = input(1)\n\n f = []\n g = []\n \n for j, i in enu(a):\n if i & 1:\n f.append(j)\n else:\n g.append(j)\n\n if len(f) == 1:\n out(f[0] + 1)\n else:\n out(g[0] + 1)\n\n \n log()\n return\n\n\nsolve()\n\n#\n# >>>>>>>>>>>>>>>> END OF SOLUTION <<<<<<<<<<<<<<<\n#\n", "n = int(input())\r\narr = [*map(int, input().split())]\r\n\r\na = 0\r\nb = 0\r\nresult_a = 0\r\nresult_b = 0\r\n\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n b += 1\r\n result_b = i\r\n else:\r\n a += 1\r\n result_a = i\r\n\r\nif a < b:\r\n print(result_a + 1)\r\nelse:\r\n print(result_b + 1)", "n=int(input())\r\na=list(map(int, input(). split()))\r\nchet=[]\r\nnechet=[]\r\nfor i in range(n):\r\n\tif a[i]%2==0:\r\n\t\tchet.append(i)\r\n\telif a[i]%2!=0:\r\n\t\tnechet.append(i)\r\nif len(chet)>len(nechet):\r\n\tprint(nechet[0]+1)\r\nelse:\r\n print(chet[0]+1)", "a = int(input())\r\nl = list(map(lambda a : int(a) % 2, input().split()))\r\nprint([i+1 for i in range(a) if l.count(l[i]) == 1][0])", "n = int(input())\r\nch, nch = 0, 0\r\nsp = list(map(int, input().split()))\r\ni = 0\r\nich, inch = -1, -1\r\nwhile ch * nch == 0 or ch + nch < 3:\r\n if sp[i] % 2 == 0:\r\n ch += 1\r\n ich = i\r\n else:\r\n nch += 1\r\n inch = i\r\n i += 1\r\nif ch > nch:\r\n print(inch + 1)\r\nelse:\r\n print(ich + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ne=[]\r\nt=[]\r\nfor i in range(0,n):\r\n if a[i]%2==0:\r\n e.append(i)\r\n else:\r\n t.append(i)\r\nif len(e) > len(t):\r\n print(t[0]+1)\r\nelse:\r\n print(e[0]+1)", "from collections import Counter, defaultdict, deque\r\nimport math\r\nimport heapq\r\nimport sys, io, os\r\nimport threading\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\n# Important when use recurion, but it's only work with Python, \r\n# please do not use it when submit PyPy\r\n# RECURSION_DEPTH_SIZE = 2**26\r\n# threading.stack_size(RECURSION_DEPTH_SIZE)\r\n# sys.setrecursionlimit(RECURSION_DEPTH_SIZE)\r\n\r\nBUFSIZE = 4096\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n# input = sys.stdin.readline # for strings\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline # for non-strings\r\n\r\ndef readANumber():\r\n return int(input().strip())\r\n\r\ndef readListIntegerNumbers():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef readListFloatNumbers():\r\n return list(map(float, input().strip().split()))\r\n\r\ndef readTupleNumber():\r\n return map(int, input().strip().split())\r\n\r\ndef readAStr():\r\n return str(input().strip())\r\n\r\ndef runATask(n, arr):\r\n c_eveness = defaultdict(int)\r\n even = 0\r\n odd = 1\r\n for i in range(n):\r\n if arr[i] % 2 == 0:\r\n c_eveness[0] += 1\r\n even = i + 1\r\n else:\r\n c_eveness[1] += 1\r\n odd = i + 1\r\n if c_eveness[0] > c_eveness[1]:\r\n return odd\r\n else:\r\n return even\r\n\r\ndef solve():\r\n T = 1\r\n for testcaseID in range(T):\r\n n = readANumber()\r\n arr = readListIntegerNumbers()\r\n ans = runATask(n, arr)\r\n print(ans)\r\n \r\n\r\nif __name__==\"__main__\":\r\n try:\r\n threading.Thread(target=solve).start()\r\n except Exception as err:\r\n print(\"[Debug] Has error\", str(err))", "n = int(input())\na = list(map(int, input().split()))\nif a[0]%2 == a[1]%2:\n\tfor i in range(n):\n\t\tif a[i]%2 != a[0]%2:\n\t\t\tprint(i+1)\n\t\t\tbreak\nelif a[0]%2 == a[2]%2:\n\tprint(2)\nelse:\n\tprint(1)", "N = int(input())\r\nnum = list(map(int, input().split()))\r\neven= 0\r\nodd= 0\r\nevenI = -1\r\noddI= -1\r\nfor i in range(N):\r\n if num[i] % 2 == 0:\r\n even += 1\r\n evenI = i + 1\r\n else:\r\n odd += 1\r\n oddI= i + 1\r\nif even== 1:\r\n print(evenI)\r\nelse:\r\n print(oddI)", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\neven=0\r\nfor i in s:\r\n if i%2==0:\r\n even+=1\r\nif even==1:\r\n for i in range(n):\r\n if s[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if s[i]%2!=0:\r\n print(i+1)\r\n break", "\r\n\r\nuseless = input()\r\na = [int(x)%2 for x in input().split()]\r\nprint(a.index(sum(a)==1)+1)\r\n\r\n\r\n \r\n\r\n ", "def main():\r\n length = int(input())\r\n ls = list(map(int, input().split()))\r\n\r\n IsEven = 0\r\n IsOdd = 0\r\n pos = 0\r\n\r\n for i in range(length):\r\n if(ls[i] % 2 == 0):IsEven += 1\r\n else:\r\n IsOdd += 1\r\n\r\n if(IsEven > IsOdd):\r\n for x in range(length):\r\n if ls[x] % 2 != 0:\r\n pos = x\r\n return pos\r\n else:\r\n for x in range(length):\r\n if ls[x] % 2 == 0:\r\n pos = x\r\n return pos\r\n\r\nif __name__ == '__main__':\r\n print(main()+1)\r\n # print(IsTprime(4))\r\n # 5\r\n # 2 4 7 8 10", "import sys\r\n\r\nn = int(input())\r\ni = 0\r\nlastEven = -1\r\nlastOdd = -1\r\nlastNum = 0\r\n\r\nfor cur in map(int, input().split()):\r\n lastNum = cur\r\n i += 1\r\n if cur % 2 == 0:\r\n if lastEven > 0 and lastOdd > 0:\r\n print(lastOdd)\r\n sys.exit()\r\n lastEven = i\r\n else:\r\n if lastEven > 0 and lastOdd > 0:\r\n print(lastEven)\r\n sys.exit()\r\n lastOdd = i\r\nprint(n)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ncounto=0\r\ncounte=0\r\nfor i in range(n):\r\n\tif a[i]%2 ==0:\r\n\t\tcounte+=1\r\n\telse:\r\n\t\tcounto+=1\r\nif counto==1:\r\n\tfor i in range(n):\r\n\t\tif a[i]%2 ==1:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif a[i]%2 ==0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "import sys\r\nfrom copy import copy, deepcopy\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import heapify, heappop, heappush\r\nfrom itertools import (accumulate,\r\n product,\r\n combinations,\r\n combinations_with_replacement,\r\n permutations,\r\n groupby,\r\n)\r\nfrom bisect import bisect, bisect_left, bisect_right\r\nfrom string import ascii_lowercase\r\n\r\n\r\n\r\ndef _list():\r\n return map(int, input().strip().split())\r\n\r\n\r\ndef _int():\r\n return int(input())\r\n\r\n\r\ndef _str():\r\n return input()\r\n\r\n\r\ndef ceil(x,y):\r\n return -(-x//y)\r\n\r\n# suppose a function called main() and\r\n# all the operations are performed\r\ndef main():\r\n n = _int()\r\n res = list(_list())\r\n a = b = None\r\n count = 0\r\n for ind,i in enumerate(res):\r\n if i%2==0:\r\n count+=1\r\n a = ind+1\r\n else:\r\n b = ind+1\r\n if count==n-1:\r\n print(b)\r\n else:\r\n print(a)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n# call the main method\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = input()\r\na = []\r\noddcnt, evencnt, lastodd, lasteven = 0, 0, 0, 0\r\n\r\na = list(map(int, input().split()))\r\nfor i in range(int(n)):\r\n if a[i] % 2 == 1:\r\n oddcnt += 1\r\n lastodd = i\r\n else:\r\n evencnt += 1\r\n lasteven = i\r\n\r\nif oddcnt == 1:\r\n print(lastodd + 1)\r\nelse:\r\n print(lasteven + 1)", "t=int(input())\r\nls=list(map(int,input().split()))\r\narro=[]\r\narre=[]\r\nfor i in range(t):\r\n if ls[i]%2==0:\r\n arre.append(ls[i])\r\n else:\r\n arro.append(ls[i])\r\nif len(arre)>len(arro):\r\n for j in range(t):\r\n if arro[0]==ls[j]:\r\n print(j+1)\r\nelse:\r\n for j in range(t):\r\n if arre[0]==ls[j]:\r\n print(j+1)\r\n", "n=input();d=[int(i)%2 for i in input().split()];print(d.index((d.count(1) == 1))+1)", "input()\r\nnum = [int(x) & 1 for x in input().split()]\r\nrare = 0 if num.count(0) < num.count(1) else 1\r\nprint(num.index(rare) + 1)", "n = int(input())\r\nposition=0\r\nnumbers = list(map(int,input().split()))\r\nfor x in range(len(numbers)):\r\n numbers[x]%=2\r\n if numbers[x]==0:\r\n position+=1\r\n else:\r\n position-=1\r\nprint(numbers.index(0)+1 if position<0 else numbers.index(1)+1)", "\r\nn=int(input())\r\na =[]\r\neven=0\r\nodd=0\r\nlastodd=-0\r\nlasteven=0\r\n\r\nif(n>=3):\r\n # A for loop for column entries\r\n # a.append(input().split(\" \"))\r\n x = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if(x[i]%2==0):\r\n even+=1\r\n lasteven=i\r\n\r\n else:\r\n even-=1\r\n lastodd=i\r\n# print(x)\r\n\r\nif(even>0):\r\n print(lastodd+1)\r\nelse:\r\n print(lasteven +1)\r\n\r\n", "int(input())\r\na=[int(x) & 1 for x in input().split()]\r\nprint(a.index(a.count(0)>1)+1)\r\n", "n = int(input())\r\nar = []\r\neven = []\r\nodd = []\r\nar = [int(x) for x in input().split()]\r\n#print(ar)\r\nfor i in range(n):\r\n if(ar[i]%2 == 0):\r\n even.append(ar[i])\r\n else:\r\n odd.append(ar[i])\r\nif(len(even) > len(odd)):\r\n print(ar.index(odd[0])+1)\r\nelse:\r\n print(ar.index(even[0])+1)", "import sys\r\nfrom random import choice,randint\r\n \r\nsys.setrecursionlimit(10**7)\r\ninf = 10**20\r\neps = 1.0 / 10**10\r\nmod = 10**9+7\r\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\r\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\r\n \r\ndef MI(): return map(int, sys.stdin.readline().strip().split())\r\ndef LI(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]\r\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().strip().split()]\r\ndef LF(): return [float(x) for x in sys.stdin.readline().strip().split()]\r\ndef LS(): return sys.stdin.readline().strip().split()\r\ndef I(): return int(sys.stdin.readline().strip())\r\ndef F(): return float(sys.stdin.readline().strip())\r\ndef S(): return sys.stdin.readline().strip()\r\ndef pf(s): return print(s, flush=True)\r\ndef pe(s): return print(str(s), file=sys.stderr)\r\ndef JA(a, sep): return sep.join(map(str, a))\r\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\r\n\r\ninp=sys.stdin.readline\r\nout=sys.stdout.write\r\n\r\ndef main():\r\n n = I()\r\n a = LI()\r\n l1,l2=[],[]\r\n for i in a:\r\n if i%2==0:\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\n if len(l1)==1:\r\n pf(a.index(l1[0])+1)\r\n else:\r\n pf(a.index(l2[0])+1)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def solve():\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n i = 0\r\n while i<len(l):\r\n l[i] = l[i]%2\r\n i += 1\r\n if l.count(1) == 1:\r\n print(l.index(1)+1)\r\n else:\r\n print(l.index(0)+1)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "def isEven(n):\r\n if n % 2 == 0:\r\n return True\r\n return False\r\n \r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\nk = 0\r\nm = 0\r\no = 0\r\ne = 0\r\nfor i in range(n):\r\n if isEven(l[i]):\r\n e += 1\r\n k = i\r\n else:\r\n o += 1\r\n m = i\r\nif e == 1:\r\n print(k+1)\r\nelse:\r\n print(m+1)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl1=list(filter(lambda x: x%2==0,l))\r\nl2=list(filter(lambda x: x%2!=0,l))\r\nif len(l1)==1:\r\n a=l1[0]\r\n print(l.index(a)+1)\r\nelse:\r\n a=l2[0]\r\n print(l.index(a)+1)\r\n", "n = int(input())\nA = input().split()\n\nseq_impar = 0\nseq_par = 0\n\nfor i in range(3):\n if (int(A[i])%2) == 0:\n seq_par += 1\n else:\n seq_impar += 1\n\nif seq_par > seq_impar:\n for i in range(n):\n if (int(A[i])%2) != 0:\n i += 1\n print(i)\nelif seq_par < seq_impar: \n for i in range(n):\n if (int(A[i])%2) == 0:\n i += 1\n print(i)\n \t\t \t \t\t \t \t\t \t\t", "n = int(input())\r\nm = list(map(int, input().split()))\r\nch = 0\r\nnech = 0\r\nfor i in range(n):\r\n if m[i] % 2 == 0:\r\n ch+=1\r\n else:\r\n nech+=1\r\n if ch == 1 and nech > ch or nech == 1 and ch > nech:\r\n break\r\nfor i in range(n):\r\n if nech > ch:\r\n if m[i] % 2 == 0:\r\n print(i+1)\r\n else:\r\n if m[i] % 2 != 0:\r\n print(i+1)\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n", "n = int(input())\r\nl = ''.join([str(int(k)%2) for k in input().split(' ')])\r\n\r\nif l.count('1') > l.count('0'):\r\n print(str(l.find('0')+1))\r\nelse:\r\n print(str(l.find('1')+1))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl1 = []\r\nl2 = []\r\nfor i in range(0,n):\r\n if l[i]%2==0:\r\n l2.append(i)\r\n else:\r\n l1.append(i)\r\nif(len(l1)==1):\r\n for i in l1:\r\n \tprint(i+1)\r\nelse:\r\n for i in l2:\r\n print(i+1)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\ne=0\r\no=0\r\ne1=0\r\no1=0\r\nfor i in range(n):\r\n if(e<2 and a[i]%2==0):\r\n e=e+1\r\n e1=i\r\n elif(e==2 and a[i]%2==0):\r\n continue\r\n elif(o<2 and a[i]%2!=0):\r\n o=o+1\r\n o1=i\r\n elif(o==2 and a[i]%2!=0):\r\n continue\r\n if(e==2 and o==1):\r\n print(o1+1)\r\n break\r\n elif(e==1 and o==2):\r\n print(e1+1)\r\n break", "def evenOrNot(x):\r\n\treturn x%2==0\r\nn=int(input())\r\na=list(map(int,input().split()))\r\neven,odd=0,0\r\nif evenOrNot(a[0]):\r\n\teven+=1\r\nelse:\r\n\todd+=1\r\n\r\nif evenOrNot(a[1]):\r\n\teven+=1\r\nelse:\r\n\todd+=1\r\n\r\nif evenOrNot(a[2]):\r\n\teven+=1\r\nelse:\r\n\todd+=1\r\n\r\nfor i in range(n):\r\n\tif even>odd and evenOrNot(a[i])==False:\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n\telif even<odd and evenOrNot(a[i])==True:\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n\t\r\n\t\t", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\neven, odd = [], []\r\nfor i, number in enumerate(numbers):\r\n if number % 2 == 0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\nif len(even) == 1:\r\n print(even[0])\r\nelse:\r\n print(odd[0])\r\n", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\nif a[0]&1 != a[1]&1 and a[1]&1 == a[2]&1:\r\n print(1)\r\n\r\nelif a[n-1]&1 != a[n-2]&1 and a[n-2]&1 == a[n-3]&1:\r\n print(n)\r\nelse:\r\n for i in range(1,n-1):\r\n if a[i-1]&1 != a[i]&1 != a[i+1]&1:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\na = input().split()\r\nfor i in range(n - 2):\r\n if int(a[i]) % 2 != int(a[i + 1]) % 2:\r\n if int(a[i]) % 2 != int(a[i + 2]) % 2:\r\n b = int(i) + 1\r\n else:\r\n b = int(i) + 2\r\n else:\r\n if int(a[i + 2]) % 2 != int(a[i]) % 2:\r\n b = int(i) + 3\r\nprint(b)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn=int(input())\r\nk=0\r\ns=0\r\nc=0\r\nv=0\r\na=[int(x) for x in input().split()]\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n k+=1\r\n c=i\r\n else:\r\n s+=1\r\n v=i\r\nif k==1:\r\n print(c+1)\r\nelse:\r\n print(v+1)\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nfor i in l:\r\n if i%2==0:\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\nlasteven=l1[-1]\r\nlastodd=l2[-1]\r\nif len(l1)<len(l2):\r\n print(l.index(lasteven)+1)\r\nelif len(l2)<len(l1):\r\n print(l.index(lastodd)+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n even+=1\r\n j=i\r\n else:\r\n odd+=1\r\n k=i\r\nif(odd>even):print(j+1)\r\nelse:print(k+1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nfirst = arr[0] % 2\r\nsecond = arr[1] % 2\r\nfor i in range(2,n):\r\n temp = arr[i] % 2\r\n if first == second:\r\n if temp != first:\r\n print(i + 1)\r\n break\r\n else:\r\n if first == temp:\r\n print(2)\r\n elif second == temp:\r\n print(1)\r\n break\r\n ", "# 0025A. IQ test\r\n# http://codeforces.com/problemset/problem/25/A\r\ndef main():\r\n n = int(input())\r\n A = tuple(i % 2 for i in map(int, input().rstrip().split()))\r\n print(A.index(sum(A) == 1) + 1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "num=int(input())\r\nseqs=input().split()\r\nevens=[]\r\nfor i in seqs:\r\n evens.append(int(i)%2)\r\nt=evens.count(1)\r\nprint(evens.index(0)+1 if t>1 else evens.index(1)+1)\r\n", "\nn = int(input())\nlst = [int(x) for x in input().split()]\naa = [x%2 for x in lst]\nodd = aa.count(1)\neven = aa.count(0)\nif odd > even:\n output = aa.index(0) +1\nelse:\n output = aa.index(1) +1\nprint(output)\n", "n = int(input())\npairs = list(map(int, input().split(\" \")))\n\noCount = eCount = 0\npos = 0\n\nfor i in range(n):\n if pairs[i]%2 == 1:\n oCount += 1\n\n if pairs[i]%2 == 0:\n eCount += 1\n\n\nfor i in range(n):\n if oCount > eCount:\n if pairs[i]%2 == 0:\n break\n else:\n if pairs[i]%2 == 1:\n break\n\nprint(i+1)\n", "from asyncio import events\nimport math\n\ndef taxi(count: int, numbers: list[int]):\n if len(numbers) != count or count < 3 or count > 100:\n print(\"input wrong\")\n else:\n even_map = {'even': [], 'odd':[]}\n for index in range(len(numbers)):\n if numbers[index]%2==0:\n even_map['even'].append(index)\n else:\n even_map['odd'].append(index)\n if(len(even_map['even'])==1):\n print(even_map['even'][0]+1)\n else:\n print(even_map['odd'][0]+1)\n\ncount = int(input())\nnumbers = [int(x) for x in input().split()]\ntaxi(count, numbers)", "sz = int(input())\r\nnum = [int(i) for i in input().split()]\r\n\r\nidx_even = 0\r\ncnt_even = 0\r\n\r\nidx_odd = 0\r\ncnt_odd = 0\r\n\r\nfor i in range(sz):\r\n if num[i] % 2 == 0:\r\n idx_even = i\r\n cnt_even += 1\r\n else:\r\n idx_odd = i\r\n cnt_odd += 1\r\n\r\nif cnt_even == 1:\r\n print(idx_even+1)\r\nelse:\r\n print(idx_odd+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nfor i in l:\r\n if(i%2==0):\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\nif(len(l1)==1):\r\n k=l1[0]\r\nelse:\r\n k=l2[0]\r\nprint(l.index(k)+1) ", "def main():\r\n n = int(input())\r\n ns = list(map(int, input().split()))\r\n\r\n e = 0\r\n o = 0\r\n for i in range(n):\r\n if ns[i] % 2 == 0:\r\n e += 1\r\n else:\r\n o += 1\r\n\r\n if e > o:\r\n for i in range(n):\r\n if ns[i] % 2 == 1:\r\n print(i + 1)\r\n return\r\n else:\r\n for i in range(n):\r\n if ns[i] % 2 == 0:\r\n print(i + 1)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "\r\n\r\nn = int(input())\r\nx = 0\r\ny= 0\r\nq = 0 \r\nw = 0\r\nb = list(map(int,input().split()))\r\nfor i in range(n):\r\n if b[i]%2==0:\r\n x = x+1\r\n w = w+i\r\n else:\r\n y = y+1\r\n q = q+i\r\nif x>y:\r\n print(q+1)\r\nelse:\r\n print(w+1)\r\n \r\n ", "n = int(input())\r\ntxt = input()\r\nnum = []\r\nevencounter = 0\r\noddcounter = 0\r\n\r\nfor i in range(n):\r\n num.append(int(txt.split()[i]))\r\n\r\nfor i in range(3):\r\n if num[i] % 2 == 0:\r\n evencounter += 1\r\n else:\r\n oddcounter += 1\r\n\r\nif evencounter > oddcounter:\r\n for i in range(n):\r\n if num[i] % 2 != 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if num[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n\r\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\nx = 0\r\nfor i in range(n):\r\n if li[i]%2==0:\r\n x += 1\r\nif x==1:\r\n for i in range(n):\r\n if li[i]%2==0:\r\n print(1+i)\r\nelse:\r\n for i in range(n):\r\n if li[i]%2==1:\r\n print(1+i)", "n=int(input())\r\nnumbers=[int(x)for x in input().split()]\r\nif (numbers[0]+numbers[1])%2 == 1:#若前两个数字之和为奇数，则不同的数为第1或第2\r\n if (numbers[1]+numbers[2])%2 == 1:\r\n answer=2\r\n else:\r\n answer=1\r\nelse:\r\n for i in range(1,n-1):#从第2组开始若出现相邻和为奇数的数字，后一个为不同的数\r\n if (numbers[i]+numbers[i+1])%2 == 1:\r\n answer=i+2\r\n break\r\nprint(answer)", "a=int(input())\r\nb=input().split()\r\nif int(b[0])%2!=int(b[1])%2:\r\n if int(b[0])%2==int(b[2])%2:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n r=int(b[0])%2\r\n for i in range(a):\r\n if int(b[i])%2!=r:\r\n print(i+1)\r\n", "n = int(input())\narr = list(map(int, input().split()))\nparity = [False, False]\nfor i in range(n):\n if all(parity):\n if arr[i]%2 == arr[i-1]%2:\n print(1)\n else:\n print(i)\n break\n parity[arr[i]%2] = True\nelse:\n print(n)\n", "n = int(input())\r\nChan = lastChan = lastLe = 0\r\n#\r\nlst = list(map(int, input().split()))\r\n#\r\nfor item in lst:\r\n if item % 2 == 0:\r\n Chan += 1\r\n lastChan = lst.index(item)\r\n else:\r\n Chan -=1\r\n lastLe = lst.index(item)\r\n#\r\nif Chan > 0:\r\n print(lastLe+1)\r\nelse:\r\n print(lastChan+1)", "n=int(input())\r\nline=input().split()\r\na=[int(i)%2 for i in line]\r\nif a.count(1)>=2:\r\n for i in range(n):\r\n if a[i]==0:\r\n print(i+1)\r\nif a.count(0)>=2:\r\n for i in range(n):\r\n if a[i]==1:\r\n print(i+1)", "n = int(input())\nnumbers = list(map(int, input().split()))\n\nindex_odd = 0\nindex_even = 0\ncount_odd = 0\ncount_even = 0\n\nfor i in range(len(numbers)):\n if numbers[i] % 2 == 0:\n index_even = i + 1\n count_even += 1\n else:\n index_odd = i + 1\n count_odd += 1\n\nprint(index_odd) if count_odd == 1 else print(index_even)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\neven = 0\r\nuneven = 0\r\n\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even += 1\r\n else:\r\n uneven += 1\r\n\r\nif even > uneven:\r\n for i in range(n):\r\n if a[i] % 2 != 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i + 1)", "a = int(input())\r\nli1 = list(map(int, input().split()))\r\nif li1[0]%2== 0:\r\n if li1[1]%2 ==0:\r\n for b in range(2,a):\r\n if li1[b]%2 != 0:\r\n print(b+1)\r\n break\r\n elif li1[1]%2 !=0:\r\n if li1[2]%2 ==0:\r\n print(1+1)\r\n else:\r\n print(0+1)\r\nelse:\r\n if li1[1]%2 !=0:\r\n for b in range(2,a):\r\n if li1[b]%2 == 0:\r\n print(b+1)\r\n break\r\n elif li1[1]%2 ==0:\r\n if li1[2]%2 ==0:\r\n print(0+1)\r\n else:\r\n print(1+1)\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nct=0\r\nbt=0\r\nfor i in b:\r\n if (ct>1 or bt>1) and (ct!=0 and bt!=0):\r\n break\r\n if i%2==0:\r\n ct+=1\r\n else:\r\n bt+=1\r\n\r\nif ct==1:\r\n for i in range(len(b)):\r\n if b[i]%2==0:\r\n print(i+1)\r\n break\r\nif bt==1:\r\n for i in range(len(b)):\r\n if b[i]%2!=0:\r\n print(i+1)\r\n break", "x=int(input())\r\ny=list(map(int,input().split()))\r\nodd=[]\r\neven=[]\r\na=0\r\nfor i in y:\r\n i=int(i)\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(odd)==1:\r\n for i in y:\r\n a=a+1\r\n if i==odd[0]:\r\n break\r\nelif len(even)==1:\r\n for i in y:\r\n a=a+1\r\n if i==even[0]:\r\n break\r\nprint(a)", "import sys\nn=[ ]\na=int(input())\nn=list(map(int,input().split()))\nn1=n2=0\nfor i in range (len(n)):\n if n[i] %2==0:\n n1=n1+1\n c=i+1\n else :\n n2=n2+1\n b=i+1\nif n1>n2 :\n print(b)\nelse :\n print(c)\n \n\n ", "n = int(input())\r\nl = list(map(int, input().split()))\r\ne = 0 \r\no = 0\r\nfor i in range(0, len(l)):\r\n if l[i]%2 == 0:\r\n e += 1\r\n f = i+1\r\n else:\r\n o += 1\r\n d = i+1\r\nif o < e:\r\n print(d)\r\nelse:\r\n print(f)", "input()\r\nlst=list(map(int,input().split()))\r\noc=0\r\nec=0\r\noi=0\r\nei=0\r\nfor i in range(len(lst)):\r\n if(lst[i]%2==0):\r\n ec+=1\r\n ei=i\r\n else:\r\n oc+=1\r\n oi=i\r\nif(oc==1):\r\n print(oi+1)\r\nelse:\r\n print(ei+1)", "n=int(input())\r\nA=list(map(int,input().split()))\r\nB=[0 for i in range(len(A)-1)]\r\nfor i in range(len(A)-1):\r\n if A[i]%2!=A[i+1]%2:\r\n B[i]=1\r\nc=0\r\nfor i in range(len(A)-1):\r\n c+=B[i]\r\nif c==2:\r\n for i in range(len(A)-1):\r\n if B[i]==1:\r\n print(i+2)\r\n break\r\nif c==1:\r\n if B[0]==1:\r\n print(1)\r\n if B[-1]==1:\r\n print(len(A))\r\n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nchet = nechet = 0\r\n\r\nfor i in mas:\r\n if i % 2 == 0: chet += 1\r\n else: nechet += 1\r\n\r\nif chet > nechet:\r\n mas1 = sorted(mas, key=lambda x: x % 2 == 1)\r\n print(mas.index(mas1[-1])+1)\r\nelse:\r\n mas1 = sorted(mas, key=lambda x: x % 2 == 0)\r\n print(mas.index(mas1[-1])+1)", "#25a\r\na=int(input())\r\nb=[int(i) for i in input().split()]\r\neven,odd=0,0\r\nfor i in b:\r\n if i%2==0:\r\n even+=1\r\n c=i\r\n else:\r\n odd+=1\r\n d=i\r\nif even>odd:\r\n print(b.index(d)+1)\r\nelse:\r\n print(b.index(c)+1)", "def find_odd(lst):\r\n for i in range(len(lst)):\r\n if lst[i]%2!=0:\r\n return i+1\r\ndef find_even(lst):\r\n for i in range(len(lst)):\r\n if lst[i]%2==0:\r\n return i+1\r\nn=int(input())\r\nlst=[int(x) for x in input().split()]\r\neven=0\r\nodd=0\r\nfor i in lst:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even>odd:\r\n print(find_odd(lst))\r\nelse:\r\n print(find_even(lst))", "x = int(input())\r\ny = [int(i) for i in input().split()]\r\nif len(set(y)) > 2:\r\n a = [int(i) for i in y if i % 2 == 0]\r\n b = [int(i) for i in y if i % 2 != 0]\r\n if len(a) == 1:\r\n for i in range(x):\r\n if y[i] == a[0]:\r\n print(i+1)\r\n if len(b) == 1:\r\n for i in range(x):\r\n if y[i] == b[0]:\r\n print(i+1)\r\n\r\nif len(set(y)) == 2:\r\n for i in range(x):\r\n if y.count(y[i]) == 1:\r\n print(i + 1)", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nfor i, element in enumerate(array):\r\n array[i] = element % 2\r\n\r\nif sum(array) > 1:\r\n print(array.index(0) + 1)\r\nelse:\r\n print(array.index(1) + 1)\r\n", "n = int(input())\r\nstore = list(map(int, input().split()))\r\n\r\nflt = [True if x % 2 == 0 else False for x in store]\r\n\r\nif flt.count(False) == 1:\r\n print(flt.index(False) + 1)\r\nelse:\r\n print(flt.index(True) + 1)", "def is_odd(x):\r\n return x%2==1\r\ndef is_even(x):\r\n return x%2==0\r\nn=int(input(''))\r\nL=list(map(int,input('').split()))\r\nL1=list(filter(is_odd,L))\r\nL2=list(filter(is_even,L))\r\nif len(L1)==1:\r\n a=L1[0]\r\nif len(L2)==1:\r\n a=L2[0]\r\nprint(L.index(a)+1)", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\n\r\nt = k = 0\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n t += 1\r\n else:\r\n k += 1\r\n\r\nif t>k:\r\n for m in range(n):\r\n \r\n if s[m]%2 != 0:\r\n print(m+1)\r\nelse:\r\n for m in range(n):\r\n\r\n if s[m]%2 == 0:\r\n print(m+1)\r\n \r\n \r\n", "n = int(input())\r\nlst = list( map( int, input().split()))\r\ncnt = 0\r\nfor _ in range(0,n) :\r\n if lst[_] % 2 == 0 :\r\n cnt+=1\r\n id1 = _+1\r\n else :\r\n id2 = _+1\r\nif(cnt == 1) :print(id1)\r\nelse : print(id2)\r\n", "n = input()\r\ndef ev(x):\r\n return str(int(x)%2)\r\nl = \"\".join(list(map(ev,input().split())))\r\neven = l.count(\"0\")\r\nodd = l.count(\"1\")\r\nif even > odd:\r\n print(l.find(\"1\")+1)\r\nelse:\r\n print(l.find(\"0\")+1)", "n = int(input())\r\nnumbers_evenness = [int(x) for x in input().split()]\r\nif numbers_evenness[0]%2 != numbers_evenness[1]%2:\r\n if numbers_evenness[2]%2 == numbers_evenness[0]%2:\r\n print('2')\r\n else:\r\n print('1')\r\nelse:\r\n for i in range(2,n+1):\r\n if numbers_evenness[i]%2 != numbers_evenness[0]%2:\r\n print(i+1)\r\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(lambda a:a%2, a))\r\nif b.count(1) == 1:\r\n print(b.index(1) + 1)\r\nelse:\r\n print(b.index(0) + 1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nm=0\r\nfor i in l:\r\n if(i%2==0):\r\n c+=1\r\n k=i\r\n else:\r\n m+=1\r\n f=i\r\nif(c==1):\r\n print(l.index(k)+1)\r\nelse:\r\n print(l.index(f)+1)\r\n", "a = int(input())\nl = list(map(int,input().split()))\nc = [int(i%2 == 0) for i in l]\nif c.count(1) == 1:\n print(c.index(1) + 1)\nelse:\n print(c.index(0)+1)\n\n \t\t \t\t\t\t \t \t\t\t\t\t\t \t \t", "t=int(input())\r\nl=[int(x) for x in input().split()]\r\ne=[]\r\no=[]\r\nfor i in range(len(l)):\r\n if(l[i]%2==0):\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif(len(o)==1):\r\n print(o[0]+1)\r\nif(len(e)==1):\r\n print(e[0]+1)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\noc = 0\r\nol = []\r\nec = 0\r\nel = []\r\nfor i in arr:\r\n if i % 2 == 0:\r\n ec += 1\r\n el.append(i)\r\n else:\r\n oc += 1\r\n ol.append(i)\r\n if (ec == 1 and oc > 1) or (oc == 1 and ec > 1):\r\n break\r\n\r\nif ec > oc:\r\n print(arr.index(ol[0])+1)\r\nelse:\r\n print(arr.index(el[0])+1)\r\n", "n = int(input())\nlst = list(map(int, input().split()))\neven = []\nodd = []\nfor elem in lst:\n if elem % 2 == 0:\n even.append(elem)\n else:\n odd.append(elem)\nif len(even) > len(odd):\n print(lst.index(odd[0]) + 1)\nelse:\n print(lst.index(even[0]) + 1)\n", "n = int(input())\r\nli = input().split(\" \")\r\nnli = []\r\nfor i in li:\r\n nli.append(int(i))\r\ns = []\r\nz= 0\r\no =0\r\nfor i in nli:\r\n if i%2 == 0:\r\n z+=1\r\n else:\r\n o+=1\r\n s.append(i%2)\r\nif z > o:\r\n print(s.index(1) + 1)\r\nelse:\r\n print(s.index(0) + 1)\r\n", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\na = []\r\nb = []\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n a.append(s[i])\r\n else:\r\n b.append(s[i])\r\nc = len(a)\r\nd = len(b)\r\nif c > d:\r\n print(s.index(b[0])+1)\r\nelse:\r\n print(s.index(a[0])+1)", "n=int(input())\r\nx=input().split()\r\neven=list(filter(lambda a:int(a)%2==0, x))\r\nodd=list(filter(lambda a:int(a)%2!=0, x))\r\nif len(even)==1:\r\n y=even[0]\r\nelse:\r\n y=odd[0]\r\nprint(x.index(y)+1)", "t=int(input())\r\np=list(map(int,input().split()))\r\no_d=[]\r\ne_d=[]\r\nfor i in range(t):\r\n\tif p[i]%2==0:\r\n\t\te_d.append(i+1)\r\n\telse:\r\n\t\to_d.append(i+1)\r\nif len(o_d)>len(e_d):\r\n\tprint(e_d[0])\r\nelse:\r\n\tprint(o_d[0])\r\n", "n = int(input())\r\nnumbers = [int(x) % 2 for x in input().split()]\r\nfor i in range(n):\r\n if numbers.count(numbers[i]) == 1:\r\n print(i+1)", "n = int(input())\r\nnumbers = input().split()\r\nfor i in range(n):\r\n numbers[i]=int(numbers[i])\r\neven1=numbers[0]%2\r\neven2=numbers[1]%2\r\nif even1==even2:\r\n even=even1\r\n for i in range(2,n):\r\n if numbers[i]%2!=even:\r\n print(i+1)\r\n break\r\nelse:\r\n if numbers[2]%2==even1:\r\n print(2)\r\n else:\r\n print(1)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in l:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\n# print(even,odd)\r\nif odd == 1:\r\n for i in range(len(l)):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n break\r\nelif even==1:\r\n for i in range(len(l)):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break", "n = int(input())\nline = [int(x) for x in input().split()]\nif line[0] % 2 == line[1] % 2:\n a = line[0] % 2\nelse:\n a = line[2] % 2\nfor i in range(n):\n if line[i] % 2 != a: \n print(i+1)\n", "def func(a):\r\n firsteven = a[0]%2 == 0\r\n secondeven = a[1]%2 == 0\r\n if firsteven == secondeven:\r\n if firsteven:\r\n for i, e in enumerate(a):\r\n if e%2 == 1:\r\n print(i+1)\r\n return\r\n else:\r\n for i, e in enumerate(a):\r\n if e%2 == 0:\r\n print(i+1)\r\n return\r\n else:\r\n if a[2]%2 == 0:\r\n if firsteven:\r\n print(1+1)\r\n else:\r\n print(0+1)\r\n else:\r\n if firsteven:\r\n print(0+1)\r\n else:\r\n print(1+1)\r\n\r\ninput()\r\n\r\narr = [int(e) for e in input().split()]\r\n\r\nfunc(arr)", "n=int(input())\r\ny=1\r\no=[]\r\ne=[]\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i%2==1: e.append(l.index(i))\r\n else: o.append(l.index(i))\r\nprint(e[0]+1 if len(e)==1 else o[0]+1)", "n = int(input())\r\nnums= list(map(int, input().split()))\r\nend = n-1\r\nbad = 0\r\ndif = 0\r\nfor i in range(3):\r\n if(nums[end]%2==0):\r\n dif+=1\r\n else:\r\n dif-=1\r\n end-=1\r\nif(dif>= 1):\r\n bad = 1\r\nelif(dif < 1):\r\n bad = -1\r\n \r\nif(bad==1):\r\n for i in range(n):\r\n if(nums[i]%2==1):\r\n print(i+1)\r\n break\r\nelif(bad==-1):\r\n for i in range(n):\r\n if(nums[i]%2==0):\r\n print(i+1)\r\n break", "n = int(input())\r\nl = list(map(int, input().split()))\r\nodd, even = 0, 0\r\nlo, le = [], []\r\nind = 0\r\nfor el in l:\r\n if el % 2: odd += 1; lo.append(el)\r\n else: even += 1; le.append(el)\r\nif odd > even: print(l.index(le[0]) + 1)\r\nelse: print(l.index(lo[0]) + 1)", "import sys\r\nn= input()\r\narr = [int(i) for i in input().split()]\r\ncount1=0\r\nc1=-1\r\nc2=-1\r\ncount2=0\r\nfor i in range (int(n)):\r\n if arr[i]%2==0:\r\n count1+=1\r\n c1=i+1\r\n else:\r\n count2+=1\r\n c2=i+1\r\n\r\nif count1> count2:\r\n print(c2)\r\nelse:\r\n print (c1)", "\ndef solve(n,arr):\n\td={0:[] , 1:[]}\n\tfor i in arr :\n\t\tif i%2==0 :\n\t\t\td[0].append(i)\n\t\telse:\n\t\t\td[1].append(i)\n\n\tx= 1 if len(d[1])==1 else 0 \n\n\treturn arr.index(d[x][0])+1\n \n \n\n\nfrom sys import stdin\ninput = stdin.readline\nn=int(input())\nl=input()\nl=[int(x) for x in l.split(' ')]\nprint(solve(n,l))\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nlist=0\r\nfor i in x:\r\n if i%2==0:\r\n even=even+1\r\n else:\r\n odd=odd+1\r\n if even>1:\r\n list=1\r\n break\r\n elif odd>1:\r\n list=0\r\n break\r\nif list==0:\r\n for i in range(len(x)):\r\n if x[i]%2==0:\r\n print(i+1)\r\nif list==1:\r\n for i in range(len(x)):\r\n if x[i]%2!=0:\r\n print(i+1) \r\n ", "n = int(input())\nline = [int(x) for x in input().split()]\nstonk = 1\nfor i in range(n):\n if i == n - 3:\n stonk = -1\n if line[i] % 2 != line[i+stonk] % 2 and line[i] % 2 != line[i+2*stonk] % 2:\n print(i+1) \n break\n", "x=int(input())\r\ny=list(map(int, input().split()))\r\nev=0\r\nod=0\r\nfor t in y:\r\n if t%2==0:\r\n ev+=1\r\n else:\r\n od+=1\r\nif ev>od:\r\n for t in range(len(y)):\r\n if y[t]%2!=0:\r\n print(t+1)\r\n break\r\nelse:\r\n for t in range(len(y)):\r\n if y[t] % 2 == 0:\r\n print(t+1)\r\n break\r\n\r\n\r\n \r\n\r\n", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nnvs = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nv = [0] * 100\r\n\r\nv1 = 0\r\nv2 = 0\r\nfor i in range(n):\r\n if(nvs[i] % 2 != 0):\r\n v[i] = 1\r\n v1 += 1\r\n else:\r\n v2 += 1\r\n \r\nf = 1 \r\nif(v1 >= v2):\r\n f = 0\r\n \r\nfor i in range(n):\r\n if(v[i] == f):\r\n print(i + 1)\r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\neven, odd = 0, 0\r\nlast_even, last_odd = 0, 0\r\nif arr[0] % 2 == 0:\r\n even += 1\r\n last_even = 1\r\nelse:\r\n odd += 1\r\n last_odd = 1\r\n\r\nif arr[1] % 2 == 0:\r\n even += 1\r\n last_even = 2\r\nelse:\r\n odd += 1\r\n last_odd = 2\r\n\r\nif arr[n-1] % 2 == 0:\r\n even += 1\r\n last_even = n\r\nelse:\r\n odd += 1\r\n last_odd = n\r\n\r\nif even > odd:\r\n if odd == 1:\r\n print(last_odd)\r\n exit()\r\n for i in range(2, n-1):\r\n if arr[i] % 2 == 1:\r\n print(i+1)\r\n exit()\r\n\r\nif even < odd:\r\n if even == 1:\r\n print(last_even)\r\n exit()\r\n for i in range(2, n-1):\r\n if arr[i] % 2 == 0:\r\n print(i+1)\r\n exit()", "a=int(input())\r\nx=list(map(int,input().split()))\r\nz1=0\r\nz2=0\r\nfor i in x:\r\n if i%2==0:\r\n z1+=1\r\n else:\r\n z2+=1\r\nif z1==1:\r\n for i in range(a):\r\n if x[i]%2==0:\r\n print(i+1)\r\n exit()\r\nelse:\r\n for i in range(a):\r\n if x[i]%2!=0:\r\n print(i+1)\r\n exit()", "N=int(input())\r\narray=[int(x) for x in input().split()]\r\narray=[(array[i],i) for i in range(N)]\r\neven=[]\r\nodd=[]\r\nfor i in range(N):\r\n\tif array[i][0]%2==0:\r\n\t\teven.append(array[i][1])\r\n\telse:\r\n\t\todd.append(array[i][1])\r\nif len(even)==1:\r\n\tprint(even[0]+1)\r\nelse:\r\n\tprint(odd[0]+1)", "n=int (input())\r\nnum=list(map(int, input().split()))\r\neven=[]\r\nodd=[]\r\nfor i in range(0,len(num)):\r\n if num[i]%2==0:\r\n even.append(num[i])\r\n else:\r\n odd.append(num[i])\r\n\r\nif len(even)==1:\r\n for i in range(0,len(num)):\r\n if even[0] == num[i]:\r\n print(i+1)\r\n\r\nelse:\r\n for i in range(0,len(num)):\r\n if odd[0] == num[i]:\r\n print(i+1)", "from math import gcd, sqrt, log\r\nfrom functools import cmp_to_key\r\nfrom string import ascii_uppercase as alph\r\nimport os, sys\r\nfrom itertools import permutations\r\n \r\nif os.path.exists('input.txt'):\r\n\tsys.stdin = open('input.txt')\r\n\tsys.stdout = open('output.txt', 'w')\r\n \r\nINF = float('inf')\r\n \r\ndef isPrime(n):\r\n\tif n == 1: return 0\r\n\tif n % 2 == 0: return n == 2\r\n\ti = 3\r\n\twhile i * i <= n:\r\n\t\tif n % i == 0:\r\n\t\t\treturn 0\r\n\t\ti += 2\r\n\treturn 1\r\n \r\ndef divCeil(a, b):\r\n\treturn (a - 1) // b + 1\r\n \r\ndef readList():\r\n\treturn [int(i) for i in input().strip().split()]\r\n \r\ndef solve():\r\n\tn = int(input())\r\n\ta = readList()\r\n\tch = 0\r\n\tne = 0\r\n\tfor x in a[:3]:\r\n\t\tif x % 2 == 0:\r\n\t\t\tch += 1\r\n\t\telse:\r\n\t\t\tne += 1\r\n\tif ch < ne:\r\n\t\tneed = 0\r\n\telse:\r\n\t\tneed = 1\r\n\tind = 0\r\n\twhile ind < n:\r\n\t\tif a[ind] % 2 == need:\r\n\t\t\tprint(ind + 1)\r\n\t\t\treturn ''\r\n\t\tind += 1\r\n \r\nt = 1\r\nwhile t:\r\n\tt -= 1\r\n\tsolve()", "n = int(input())\n\nnums = list(map(int, input().split()))\n\na = [nums[0]%2, nums[1]%2, nums[2]%2]\n\nif a.count(0) > 1:\n\tfor i in range(n):\n\t\tif nums[i]%2 == 1: print(i+1)\nelse:\n\tfor i in range(n):\n\t\tif nums[i]%2 == 0: print(i+1)\n\n", "n = int(input())\r\ne = [i%2 for i in map(int,input().split())]\r\nprint([e.index(0)+1,e.index(1)+1][sum(e)<2])", "n=int(input())\r\none=[int(i) for i in input().split()]\r\ntwo=[i%2 for i in one]\r\nif two.count(0)>1:\r\n\tprint(two.index(1)+1)\r\nelse:\r\n\tprint(two.index(0)+1)", "n = int(input())\nvetor = list(map(lambda x: int(x) % 2, input().split()))\n\nif vetor.count(0) == 1:\n\tprint(vetor.index(0) + 1)\nelse:\n\tprint(vetor.index(1) + 1)\n", "num = int(input())\r\narray = list(map(int, input().split()))\r\nevenCount = 0\r\noddCount = 0\r\n\r\nfor num in array:\r\n if num % 2 == 0:\r\n evenCount += 1\r\n else:\r\n oddCount += 1\r\n\r\nif evenCount == 1:\r\n for j, num in enumerate(array, start=1):\r\n if num % 2 == 0:\r\n print(j)\r\n\r\nif oddCount == 1:\r\n for i, num in enumerate(array, start=1):\r\n if num % 2 == 1:\r\n print(i)\r\n", "#https://codeforces.com/problemset/problem/25/A\r\n\r\nn=int(input())\r\na=input()\r\na=list(map(int,a.split()))\r\ncheck=0\r\ngroup=\"group\"\r\nfor i in range(0,3):\r\n if a[i]%2==0:\r\n check=check+1\r\nif check>1:\r\n group=\"even\"\r\nelse:\r\n group=\"odd\"\r\nfor i in range(n):\r\n if group==\"even\":\r\n if a[i]%2==1:\r\n print(i+1)\r\n break\r\n else:\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\n \r\n\r\n\r\n", "def count(d):\r\n c1,c2=0,0\r\n for i in d:\r\n if(i%2==0):\r\n c1+=1\r\n else:\r\n c2+=1\r\n return c1,c2\r\n \r\nn=int(input())\r\ns=input().split()\r\nd=[]\r\nfor i in range(n):\r\n d.append(int(s[i]))\r\n \r\nc1,c2=count(d)\r\nc=0\r\nif(c1>c2):\r\n for i in d:\r\n if(i%2==1):\r\n c=d.index(i)+1\r\nelse:\r\n for i in d:\r\n if(i%2==0):\r\n c=d.index(i)+1\r\n\r\nprint(c)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[i+1]=s[i]\r\nodd={}\r\neven={}\r\nfor i in d.keys():\r\n if d[i]%2!=0:\r\n odd[i]=d[i]\r\n else:\r\n even[i]=d[i]\r\nif len(odd)==1:\r\n for key in odd.keys():\r\n print(key)\r\nelif len(even)==1:\r\n for key in even.keys():\r\n print(key)", "a=[]\r\nb=[]\r\ninput()\r\ng=list(map(int,input().split())) \r\nfor i in g:\r\n if i%2==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)==1:\r\n c=a[0]\r\nif len(b)==1:\r\n c=b[0]\r\nfor index, value in enumerate(g):\r\n if value == c:\r\n print(index+1)", "n=int(input())\r\nlis=list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\nfor i in lis:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(even)==1:\r\n print(lis.index(even[0])+1)\r\nif len(odd)==1:\r\n print(lis.index(odd[0])+1)\r\n", "n = int (input ())\r\nlist_of_numbers = input ().split (\" \")\r\npair = [int (x) for x in list_of_numbers if int (x) %2 == 0 ]\r\nfor i, j in enumerate (list_of_numbers) : \r\n if len (pair) == 1 : \r\n if int (j)%2 == 0 : \r\n print (i + 1)\r\n break\r\n else : \r\n if int (j) % 2 != 0 : \r\n print (i+1)\r\n break ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 18 17:28:10 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn = int(input())\r\nnum = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(n):\r\n if num[i]%2 == 1:\r\n a.append(1)\r\n else:\r\n a.append(0)\r\n if i == 2 and a.count(1) in [1, 2]:\r\n if a.count(1) == 1:\r\n print(a.index(1)+1)\r\n else:\r\n print(a.index(0)+1)\r\n break\r\n if i >= 3 and a.count(1)*a.count(0) != 0:\r\n print(max(a.index(1), a.index(0)) + 1)\r\n break\r\n \r\n \r\n ", "n = int(input())\r\nc = [int(x) for x in input().split()]\r\n\r\nevens = 0\r\nodds = 0\r\n\r\nfirst_even = -1\r\nfirst_odd = -1\r\n\r\ni = 0\r\nwhile (evens < 2 and odds < 2) or (first_even == -1 or first_odd == -1):\r\n if c[i] % 2 == 0:\r\n evens += 1\r\n if first_even == -1: first_even = i\r\n else:\r\n odds += 1\r\n if first_odd == -1: first_odd = i\r\n\r\n i += 1\r\n\r\nif evens == 1:\r\n print(first_even+1)\r\nelse:\r\n print(first_odd+1)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n a[i] = a[i] % 2\r\nif sum(a) == 1:\r\n b = a.index(1)+1\r\nelse:\r\n b = a.index(0)+1\r\nprint(b) ", "n = int(input())\n\ns = input()\n\nl = [int(num) for num in s.split(' ')]\n\n\nce=0\nco=0\nfor i in l:\n if i%2==0:\n ce+= 1\n else:\n co+=1\n\nif co > ce:\n for i in range(len(l)):\n if l[i]%2==0:\n print(i+1)\n break\n\nif co < ce:\n for i in range(len(l)):\n if l[i]%2!=0:\n print(i+1)\n break", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nevens =0\r\nodds = 0\r\nfor i in nums:\r\n if(i%2 ==0):\r\n evens+=1\r\n else:\r\n odds+=1\r\nif(evens>odds):\r\n compare = 0\r\nelse:\r\n compare = 1\r\nyes = True\r\nwhere = -1\r\nfor i in nums:\r\n if(i%2 != compare):\r\n yes = False\r\n where = nums.index(i) +1\r\nif(where == -1):\r\n pass\r\nelse:\r\n print(where) ", "n= int(input())\r\nnum = list(map(int,input().rstrip().split()))\r\nevens = []\r\nodds = []\r\nfor i in num:\r\n if i%2==0:\r\n evens.append(i)\r\n else:\r\n odds.append(i)\r\nif len(odds)==1:\r\n print(num.index(odds[0])+1)\r\nelif len(evens)==1:\r\n print(num.index(evens[0])+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nlasteven=0\r\nlastodd=0\r\neven=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even+=1\r\n lasteven=i\r\n else:\r\n even-=1\r\n lastodd=i\r\nprint(lastodd+1) if even>0 else print(lasteven+1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\neven=[]\r\nuneven=[]\r\nfor i in a:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n uneven.append(i)\r\nif len(even)==1:\r\n result=even[0]\r\nelse:\r\n result=uneven[0]\r\nx=0\r\nfor i in a:\r\n x+=1\r\n if i==result:\r\n break\r\nprint(x)", "input()\r\narr = list(map(int,input().split()))\r\nod = 0\r\nevn = 0\r\nodn = 1\r\nen = 1\r\nfor b in arr:\r\n if b%2!=0:\r\n od+=1\r\n odn = b\r\n elif b%2==0:\r\n evn+=1\r\n en = b\r\nif evn==1:\r\n print(arr.index(en)+1)\r\nelse:\r\n print(arr.index(odn)+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = 0\r\nans1 = 0\r\nans2 = 0\r\nfor id,i in enumerate(a):\r\n if i %2 == 0:\r\n c += 1\r\n ans1 = id+1\r\n else:\r\n ans2 = id+1\r\nif c == 1:\r\n print(ans1)\r\nelse:\r\n print(ans2)", "n=int(input())\r\nn=int(n)\r\na=input().split(\" \")\r\nc=0\r\nd=0\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e=i\r\n b=a[i]\r\n c+=1\r\n else:\r\n o = i\r\n f = a[i]\r\n d += 1\r\nif d==1:\r\n print(o+1)\r\nelif c==1:\r\n print(e+1)", "N = int(input())\r\nnumbers = [int(i) for i in input().split()]\r\nresidues = [i%2 for i in numbers]\r\nif residues.count(1) == 1:\r\n print(residues.index(1) + 1)\r\nif residues.count(0) == 1:\r\n print(residues.index(0) + 1)", "n = int(input())\nk = list(map(int, input().strip().split()))\na = []\nb = []\nfor i in range(n):\n\tif k[i] % 2 == 0:\n\t\ta.append(k[i])\n\telif k[i] % 2 != 0:\n\t\tb.append(k[i])\nif len(a) > len(b):\n\tprint(k.index(b[0])+1)\nelif len(b) > len(a):\n\tprint(k.index(a[0])+1)\n", "n=int(input())\r\narr = list(map(int, input().split()))\r\ncev,codd=0,0\r\nfor i in range(n):\r\n if(arr[i]%2==0):\r\n cev+=1\r\n else:\r\n codd+=1\r\nf=0\r\nif(cev>int(n/2)):\r\n for i in range(n):\r\n if(arr[i]%2==1):\r\n f=i\r\n break\r\nelse:\r\n for i in range(n):\r\n if(arr[i]%2==0):\r\n f=i\r\n break\r\nprint(f+1)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\ncnt1=0\r\ncnt2=0\r\nfor i in range(len(l1)):\r\n if l1[i]%2!=0:\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\nif cnt1>cnt2:\r\n for i in range(len(l1)):\r\n if l1[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(l1)):\r\n if l1[i]%2!=0:\r\n print(i+1)\r\n ", "#remonders: enumerate, list = [x for x in range a if x == 3]\r\n\r\nn = int(input()) #number of inputs in the code\r\n\r\na = input() #the whole input will be divided in a list\r\n\r\nl = a.split()\r\nlist = [int(x) for x in l]\r\n\r\nevenind = 0 #index of the last even number\r\nevencount = 0 #number of even numbers in the list\r\nxind = 0\r\nxcount = 0\r\n\r\nfor x,y in enumerate(list): #going through the list of nums, checking if divisible by two and adding to even_ and x_ variables\r\n if y % 2 == 0:\r\n evenind = x\r\n evencount += 1\r\n if y % 2 != 0:\r\n xind = x\r\n xcount += 1\r\n\r\nif evencount == 1:\r\n print(evenind+1) #need to add 1 because counting in this task starts from 1 instead of 0\r\nelse:\r\n print(xind+1)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\no_res=0\r\ne_res=0\r\ne_cnt=0\r\no_cnt=0\r\nfor i in range(len(arr)):\r\n if arr[i]%2!=0:\r\n o_cnt+=1\r\n o_res=arr.index(arr[i])\r\n if arr[i]%2==0:\r\n e_cnt+=1\r\n e_res=arr.index(arr[i])\r\nif e_cnt<o_cnt:\r\n print(e_res+1)\r\nelse:\r\n print(o_res+1)", "n=input()\r\ne=input().split(' ')\r\ne = list(e)\r\nt=0\r\ny=0\r\nfor i in e:\r\n if int(i)%2==0:\r\n t+=1\r\n else:\r\n y+=1\r\nw=0\r\nif y>t:\r\n for i in e:\r\n if int(i) % 2== 0:\r\n w=i\r\nelse: \r\n for i in e:\r\n if int(i)%2==1:\r\n w=i\r\nprint (e.index(w)+1)\r\n \r\n\r\n\r\n", "s = input()\r\nt = input()\r\nt = t.split()\r\nx = 0\r\nk = 0\r\nl = 0\r\nfor i in range(int(s)):\r\n if int(t[i]) % 2 == 0:\r\n x = x + 1\r\n k = i\r\n else:\r\n x = x - 1\r\n l = i\r\n \r\nif x > 0:\r\n print(l+1)\r\nif x < 0:\r\n print(k+1)", "t = int(input())\r\ninp = list(map(int, input().split()))\r\n\r\na = 0\r\nb = 0\r\nc = False\r\nfor i in inp:\r\n if i%2 == 0:\r\n a += 1\r\n else:\r\n b += 1\r\n\r\nif a > b:\r\n c = True\r\n\r\nfor i in range(t):\r\n if inp[i]%2 == c:\r\n print(i+1)\r\n break", "n=int(input())\r\np=list(map(int,input().split()))\r\noddcnt,evencnt=0,0\r\nfor i in p:\r\n if i%2==0:\r\n evencnt+=1\r\n else:\r\n oddcnt+=1\r\nif oddcnt==1:\r\n for i in range(n):\r\n if p[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if p[i]%2==0:\r\n print(i+1)", "a = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(a):\r\n l[i] = l[i] % 2\r\nx = l.count(1)\r\ny = l.count(0)\r\nif x>y:\r\n t = l.index(0)\r\n print(t+1)\r\nelse:\r\n t = l.index(1)\r\n print(t+1)\r\n\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\neven=0\r\nodd=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even+=1\r\n ans=i+1\r\n else:\r\n odd+=1\r\n ans2=i+1\r\n if (even>1 and odd==1) or (odd>1 and even==1):\r\n break\r\nif odd==1:\r\n print(ans2)\r\nelse:\r\n print(ans)\r\n", "input()\r\nevencount=0\r\noddcount=0\r\nevenn=0\r\noddn=0\r\ncount=1\r\nfor _ in list(map(int,input().split())):\r\n if _%2==0:\r\n evencount+=1\r\n evenn=count\r\n else:\r\n oddcount+=1\r\n oddn=count\r\n count+=1\r\nif evencount==1:\r\n print(evenn)\r\nelse:\r\n print(oddn)", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\nz=[]\r\nfor i in range(0,3):\r\n z.append(l[i]%2)\r\nev=max(z,key=z.count)\r\nfor i in l:\r\n if i%2!=ev:\r\n print(l.index(i)+1)", "def iq_test(numbers):\r\n div_arr = [int(i) % 2 for i in numbers]\r\n m = 0\r\n if div_arr.count(1) > div_arr.count(0):\r\n m = 0\r\n else:\r\n m = 1\r\n return div_arr.index(m) + 1\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nprint(iq_test(l))", "t = int(input())\nls_in = list(map(int, input().split(' ')))\nls_2 = [x%2 for x in ls_in]\ncou = ls_2.count(0)\nif cou > 1:\n print(ls_2.index(1) + 1 )\nelse:\n print(ls_2.index(0) + 1)\n \t\t \t \t\t\t \t \t\t\t\t \t", "\nn = input()\narr = input().split(\" \")\n\nodd = 0\neven = 0\neven_list = []\nodd_list = []\n\nfor i in range(len(arr)):\n rem = int(arr[i]) % 2\n \n if rem == 0:\n even += 1\n if len(even_list) == 0:even_list.append(i+1)\n else:\n odd += 1\n if len(odd_list) == 0:odd_list.append(i+1)\n\nif even > odd:\n print(odd_list[0])\nelif odd > even:\n print(even_list[0])\n \t \t \t\t \t \t \t \t\t \t\t\t \t\t \t", "n = int(input())\r\nl = *(map(int,input().split())),\r\ncnt1=cnt2=0\r\nfor i in range(n):\r\n if(l[i]%2): cnt1 += 1; o = i+1\r\n else: cnt2 += 1; e = i+1\r\n if((cnt1>1 and cnt2==1) or (cnt1==1 and cnt2>1)):\r\n if(cnt1==1):print(o)\r\n else:print(e)\r\n break\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\ndef even(n):\n if n % 2 == 0:\n return True\n return False\nevn = []\nodd = []\nfor i in range(n):\n if even(a[i]):\n evn.append(i)\n else:\n odd.append(i)\nif len(odd) < len(evn):\n print(odd[0]+1)\nelse:\n print(evn[0]+1)", "n = int(input())\r\ns = input().split()\r\nnumbers = list(map(int,s))\r\n\r\neven = []\r\nodd = []\r\nfor i in numbers:\r\n if (i%2) == 0:\r\n even.append(i)\r\n elif (i%2) != 0:\r\n odd.append(i)\r\nif len(even) == 1 :\r\n index = numbers.index(even[0]) + 1\r\nelse:\r\n index = numbers.index(odd[0]) + 1\r\nprint(index)\r\n", "n = int(input())\r\nls = list(map(int,input().split()))\r\nzero = [x%2 for x in ls]\r\nif zero.count(1) > 1:\r\n print(zero.index(0)+1)\r\nelse:print(zero.index(1)+1)", "n=int(input())\r\na=[int(i)%2 for i in input().split()]\r\nif a.count(0)==1:\r\n ans=0\r\nelse:\r\n ans=1\r\nfor i in range(n):\r\n if a[i]==ans:\r\n print(i+1)\r\n break", "n=input()\r\nm=input()\r\na=m.split()\r\nc=[]\r\nd=[]\r\nfor i in a:\r\n if int(i)%2==0:\r\n c.append(i)\r\n else:\r\n d.append(i)\r\nif len(d)==1:\r\n print(a.index(''.join(d))+1)\r\nelse:\r\n print(a.index(''.join(c))+1)", "n=int(input())\r\ns = input().split()\r\nfor i in range(n):\r\n\ts[i]=int(s[i])%2\r\nif(s.count(1)==1):\r\n\tprint(s.index(1)+1)\r\nelif(s.count(0)==1):\r\n\tprint(s.index(0)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\na1, a2 = [], []\r\nfor i in a:\r\n if i % 2 == 0:\r\n a1.append(i)\r\n else:\r\n a2.append(i)\r\nif len(a1) > len(a2):\r\n print(a.index(a2[0]) + 1)\r\nelse:\r\n print(a.index(a1[0]) + 1)", "n=int(input())\r\nl = [int(l) for l in input().split() ]\r\nfor i in range(n):\r\n l[i] = l[i]%2\r\nif sum(l)==1:\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 19 17:49:51 2020\r\n\r\n@author: 赵泽华\r\n\"\"\"\r\n\r\nn=int(input())\r\niq=[int(x) for x in input().split()]\r\nodd=0\r\noddnum=0\r\neven=0\r\nevennum=0\r\n\r\nfor i in range(n):\r\n if iq[i]%2==1:\r\n odd+=1\r\n oddnum=i+1\r\n if iq[i]%2==0:\r\n even+=1\r\n evennum=i+1\r\n\r\nif odd==1:\r\n print(oddnum)\r\nif even==1:\r\n print(evennum)", "n = int(input())\r\n\r\nl = list(map(int, input().split()))\r\n\r\nt = list(filter(lambda x:x%2 == 0, l))\r\nx = list(filter(lambda x:x%2 != 0, l))\r\n\r\n\r\nif len(t) == 1:\r\n print(l.index(t[0])+1)\r\nelse:\r\n print(l.index(x[0])+1)\r\n", "n = int(input())\r\nnum = [int(i) for i in input().split()]\r\noddindex = 0\r\nevenindex = 0\r\noddnum = 0\r\nevennum = 0\r\nfor i in range(n):\r\n if num[i]%2 == 0:\r\n evenindex = i\r\n evennum +=1 \r\n else:\r\n oddindex = i\r\n oddnum += 1\r\nif evennum == 1:\r\n print(evenindex+1)\r\nelse: print(oddindex+1)\r\n", "a=int(input())\r\nA=list(map(int,input().split()))\r\nP=[i%2 for i in A]\r\nif P.count(0)>P.count(1):\r\n print(P.index(1)+1)\r\nelse:\r\n print(P.index(0)+1)\r\n", "n = int(input())\r\na = list(map(int, input().strip().split(\" \")))\r\n\r\neven = 0\r\nevIndex = 0\r\nodd = 0\r\noddIndex = 0\r\nfor z in range(0, n, 1):\r\n if a[z] ^ 1 == a[z]+1 : \r\n even = even + 1\r\n evIndex = z + 1\r\n else: \r\n odd = odd + 1\r\n oddIndex = z + 1\r\n\r\nprint(oddIndex) if odd == 1 else print(evIndex)", "k=int(input())\r\nb=[int(b) for b in input().split()]\r\ncount=0\r\nt=0\r\nfor i in b:\r\n if i%2==0:\r\n count=count+1\r\n if count>=2:\r\n t=1\r\n break\r\nif t==1:\r\n for i in range(k):\r\n if b[i]%2!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(k):\r\n if b[i]%2==0:\r\n print(i+1)\r\n break\r\n\r\n", "a = int(input())\nb = input()\nb = b.split()\nb = [int(x) for x in b]\n\nc = [False for x in range(len(b))]\n\ncnt = 0\n\nfor i in range(len(b)):\n if b[i]%2 == 0:\n c[i] = True\n cnt+=1\n \nif cnt == 1:\n for i in range(len(b)):\n if c[i] == True:\n print(\"{}\".format(i+1))\nelse:\n for i in range(len(b)):\n if c[i] == False:\n print(\"{}\".format(i+1))", "# # s = list(map(int, input().split()))\r\n# a = [[int(j) for j in input().split()] for i in range(3)] ##ввод матрицы с консоли\r\n# a = list(map(int,input().strip().split())) ввод массива под циклом\r\n\r\n# def toFixed(numObj, digits=0):\r\n# return f\"{numObj:.{digits}f}\"\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nsum_even = 0\r\nsum_odd = 0\r\nfor i in range(n):\r\n\tif l[i] % 2 == 0:\r\n\t\tsum_even+= 1\r\n\telse:\r\n\t\tsum_odd+= 1\r\n\r\nif sum_even > sum_odd:\r\n\tfor i in range(n):\r\n\t\tif l[i] % 2 != 0:\r\n\t\t\tprint(i+1)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif l[i] % 2 == 0:\r\n\t\t\tprint(i+1)", "n,a=input(),list(map(lambda v:int(v)%2,input().split()))\r\ns=a[:3]\r\nv=sum(s)-max(s)-min(s)\r\nprint([i+1 for i in range(int(n))if a[i]!=v][0])", "#codeforces\ndef Odd1Out(n):\n lst = list(map(int,input().split()[:n]))\n el = [x for x in lst if x%2==0]\n ol = [x for x in lst if x%2!=0]\n k = 0\n if(len(el) == 1):\n k = lst.index(el[0])\n else:\n k = lst.index(ol[0])\n return k+1\nN = int(input())\nprint(Odd1Out(N))\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = []\r\nfor i in l:\r\n if(i%2==0):\r\n ans.append(0)\r\n else:\r\n ans.append(1)\r\n#print(ans)\r\nif(ans.count(1) == 1):\r\n for j in range(len(ans)):\r\n if(ans[j] == 1):\r\n print(j+1)\r\nelif(ans.count(0) == 1):\r\n for j in range(len(ans)):\r\n if(ans[j] == 0):\r\n print(j+1)", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nres = 0\r\nif a[0] % 2 == 1 and a[1] % 2 == 1:\r\n res = 1\r\nelif a[0] % 2 == 0 and a[1] % 2 == 0:\r\n res = -1\r\nelse:\r\n res = 0\r\nif res == 0: \r\n if a[2] % 2 == a[0] % 2:\r\n print(2)\r\n exit()\r\n else:\r\n print(1)\r\n exit()\r\nelif res == 1:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n exit()\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n print(i+1)\r\n exit()\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nodd = 0\r\neven = 0\r\nfor i in range(n):\r\n if a[i]%2:\r\n odd += 1\r\n else:\r\n even += 1\r\n\r\nans = False\r\n\r\nif odd == 1: \r\n ans = True\r\n \r\nfor i in range(n):\r\n if ans == True:\r\n if a[i]%2:\r\n print(i + 1)\r\n break\r\n else:\r\n if a[i]%2 == 0:\r\n print(i + 1)\r\n break ", "import sys\r\n\r\nsys.stdin.readline()\r\nnums = [int(x) for x in sys.stdin.readline().split()]\r\n\r\nfirst_even = 0\r\nfirst_odd = 0\r\nfound_even = False\r\nfound_odd = False\r\neven_amt = 0\r\nodd_amt = 0\r\n\r\nfor i, num in enumerate(nums):\r\n if num%2 == 0:\r\n even_amt += 1\r\n if not found_even:\r\n first_even = i+1\r\n found_even = True\r\n else:\r\n odd_amt += 1\r\n if not found_odd:\r\n first_odd = i+1\r\n found_odd = True\r\n\r\nif even_amt == 1:\r\n print(first_even)\r\nelif odd_amt == 1:\r\n print(first_odd)\r\n", "n = int(input())\r\nnum_list = list(int(num) for num in input().strip().split())[:n]\r\nj=0\r\nk = 0\r\nl=[]\r\nf=[]\r\nfor i in range(n):\r\n \r\n if num_list[i] % 2 == 0:\r\n j +=1\r\n l.append(i+1)\r\n else:\r\n k+=1\r\n f.append(i+1)\r\nif j < k:\r\n for c in l:\r\n print(c)\r\nelse:\r\n for c in f:\r\n print(c)", "n = int(input())\narr = list(map(int, input().split()))\neven = 0\nodd = 0\nlast_even = 0\nlast_odd = 0\nfor i in range(n):\n if arr[i] % 2:\n odd += 1\n last_odd = i + 1\n else:\n even += 1\n last_even = i + 1\n \nprint(last_even) if even == 1 else print(last_odd)", "n = int(input())\r\nl = list(input().split())\r\ne=0\r\no=0\r\nen=0\r\non=0\r\nfor i,j in enumerate(l):\r\n if int(j)&1:\r\n o+=1\r\n on=i\r\n else:\r\n e+=1\r\n en=i\r\nif e==1:\r\n print(en+1)\r\nelse:\r\n print(on+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndef solve(n, a):\r\n odd = 0\r\n even = 0\r\n for i in a:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\n if even > odd:\r\n for i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n return i + 1\r\n else:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n return i + 1\r\n\r\n\r\n\r\nprint(solve(n , a))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n a.append(l[i])\r\n else:\r\n b.append(l[i])\r\nif len(a)==1:\r\n print(l.index(a[0])+1)\r\nelse:\r\n print(l.index(b[0])+1)\r\n ", "n = int(input())\r\ns = input()\r\nl = list(map(int, s.split()))\r\ne = []\r\no = []\r\nm = 0\r\nfor i in l:\r\n if i%2 == 0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif len(e) > len(o):\r\n k = o[0]\r\nelse:\r\n k = e[0]\r\nfor i in range(len(l)):\r\n if k == l[i]:\r\n m = i + 1\r\nprint(m)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n e+=1\r\n if(e==1):\r\n re=i\r\n else:\r\n o+=1\r\n if(o==1):\r\n ro=i\r\nif(e>1):\r\n print(ro+1)\r\nelse:\r\n print(re+1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ndef main():\r\n t = inp()\r\n arr = inlt()\r\n set_even = []\r\n set_odd = []\r\n \r\n for i in range (t):\r\n if arr[i] % 2:\r\n set_odd.append(i + 1)\r\n else:\r\n set_even.append(i + 1)\r\n if len(set_even) > 1 and len(set_odd) == 1:\r\n print(set_odd[0])\r\n return\r\n if len(set_odd) > 1 and len(set_even) == 1:\r\n print(set_even[0])\r\n return\r\n\r\nmain()", "x = int(input())\r\nc = list(map(int, input().split(maxsplit=x - 1)))\r\ny1 = 0\r\ny2 = 0\r\nmas1 = []\r\nmas2 = []\r\nfor i in range(len(c)):\r\n if c[i] % 2 == 0:\r\n y1 += 1\r\n mas1.append(i)\r\n else:\r\n y2 += 1\r\n mas2.append(i)\r\nif y1 == 1:\r\n print(mas1[0] + 1)\r\nelse:\r\n print(mas2[0] + 1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 17 22:26:27 2018\r\n\r\n@author: Quaint Sun\r\n\"\"\"\r\n\r\n\r\n\r\nn=int(input())\r\n\r\nnumber=input().split()\r\n\r\nfor i in range(n):\r\n number[i]=int(number[i])\r\n\r\ndouble=0\r\nodd=0\r\nfor i in range(n):\r\n if number[i]%2==0:\r\n double=double+1\r\n x=i+1\r\n else:\r\n odd=odd+1\r\n y=i+1\r\n\r\nif odd==1:\r\n print(y)\r\nelse:\r\n print(x)\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nn1=[]\r\nn2=[]\r\na=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n n1.append(a[i])\r\n else:\r\n n2.append(a[i])\r\nif len(n1)>len(n2):\r\n print(a.index(n2[0])+1)\r\nelse:\r\n print(a.index(n1[0])+1)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nl1,l2 = [],[]\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n l1.append(i+1)\r\n else:\r\n l2.append(i+1)\r\nif len(l1) == 1:\r\n print(l1[0])\r\nelse:\r\n print(l2[0])", "a = int(input())\r\nb = list(map(int,input().split()))\r\neven_number = 0\r\nodd_number = 0\r\nfor i in b :\r\n if i % 2 == 0 :\r\n even_number += 1\r\n else :\r\n odd_number += 1\r\nif even_number > odd_number : \r\n for i in range(len(b)) :\r\n if b[i] % 2 != 0 :\r\n print(i+1)\r\n break\r\nelse :\r\n for i in range(len(b)) :\r\n if b[i] % 2 == 0 :\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nliste = [int(i) for i in input().split()]\r\n\r\npair = 0\r\nfirst_pair = 0\r\nimpair = 0\r\nfirst_impair = 0\r\nfor i in range(len(liste)):\r\n if liste[i]%2 == 0:\r\n pair += 1\r\n first_pair = i+1\r\n else:\r\n impair += 1\r\n first_impair = i+1\r\n\r\nif pair == 1:\r\n print(first_pair)\r\nelse:\r\n print(first_impair)", "n = int(input())\r\nb = [int(i) for i in input().split()]\r\nnch = 0\r\nch = 0\r\nc = 0\r\nd = 0\r\nfor i in range(len(b)):\r\n if b[i]%2 == 0:\r\n ch += 1\r\n c = i\r\n else:\r\n nch += 1\r\n d = i\r\n\r\nif nch == 1:\r\n print(d+1)\r\nelse:\r\n print(c+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\noddnums = []\r\nevennums = []\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n evennums.append(a[i])\r\n else:\r\n oddnums.append(a[i])\r\nif len(oddnums) > len(evennums):\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n print(i+1)", "a=int(input())\r\nx=[int(i) for i in input().split()]\r\ncnt=0\r\nfor i in x[:3]:\r\n if i%2==0:\r\n cnt+=1\r\nif cnt>=2:\r\n for i in range(a):\r\n if x[i]%2!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(a):\r\n if x[i]%2==0:\r\n print(i+1)\r\n break", "length = int(input())\r\nnums = list(map(lambda x : int(x) % 2,input().split()))\r\nans = 1 if nums.count(0) > nums.count(1) else 0\r\nprint(nums.index(ans) + 1)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nodd_number = sum(x&1 for x in arr)\r\nfor i,j in enumerate(arr):\r\n if (odd_number != 1 and ~j & 1) or (odd_number == 1 and j & 1):\r\n print(i+1)\r\n \r\n\r\n\r\n", "n = int(input())\r\n\r\n\r\nlst = list(map(int,input().split()))\r\n\r\neven = 0\r\nuneven = 0\r\n\r\nfor i in range(3):\r\n if lst[i]%2==0:\r\n even+=1\r\n else:\r\n uneven+=1\r\n\r\nif uneven>even:\r\n for j in range(n):\r\n if lst[j]%2==0:\r\n print(j+1)\r\n break\r\n\r\nif even>uneven:\r\n for u in range(n):\r\n if lst[u]%2==1:\r\n print(u+1)\r\n break\r\n\r\n\r\n\r\n\r\n", "even, odd = 0, 0\r\nz = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(z):\r\n if a[i] % 2 == 0:\r\n even += 1\r\n b.append('0')\r\n else:\r\n odd += 1\r\n b.append('1')\r\nprint(b.index('1' if even > odd else '0') + 1)", "n = int(input()) # 숫자의 개수를 입력 받습니다.\r\nnumbers = list(map(int, input().split())) # n개의 숫자를 리스트로 입력 받습니다.\r\n\r\n# 처음 세 개의 숫자를 기준으로 홀짝을 체크합니다.\r\nevens = [1 if numbers[i] % 2 == 0 else 0 for i in range(3)]\r\nmajority_even = evens.count(1) > 1\r\n\r\n# 숫자들을 순회하면서 대다수의 홀짝성과 다른 숫자의 인덱스를 찾아 출력합니다.\r\nfor i in range(n):\r\n if (numbers[i] % 2 == 0) != majority_even:\r\n print(i + 1)\r\n break\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n-2):\r\n if (a[i]%2!=0 and a[i+1]%2==0 and a[i+2]%2==0) or (a[i]%2==0 and a[i+1]%2!=0 and a[i+2]%2!=0):\r\n print(i + 1)\r\n break\r\n elif (a[i]%2==0 and a[i+1]%2!=0 and a[i+2]%2==0) or (a[i]%2!=0 and a[i+1]%2==0 and a[i+2]%2!=0):\r\n print(i+2)\r\n break\r\n elif (a[i]%2==0 and a[i+1]%2==0 and a[i+2]%2!=0) or(a[i]%2!=0 and a[i+1]%2!=0 and a[i+2]%2==0):\r\n print(i + 3)\r\n break", "n = int(input(\"\"))\r\n\r\nvalorInput = input(\"\")\r\n\r\nlista = valorInput.split(\" \")\r\n\r\nultimoElemento = int (lista.pop())\r\n\r\nif (ultimoElemento % 2 == 0):\r\n isEven = True\r\nelse:\r\n isEven = False\r\n\r\nposition = n\r\nchanges = 0\r\nvalor = 0\r\n\r\nfor i in range(n - 1):\r\n valor = int (lista.pop())\r\n # Odd && Even\r\n if (valor % 2 == 1 & isEven):\r\n position = n - i - 1\r\n changes += 1\r\n\r\n # Even && Even\r\n elif (valor % 2 == 0 & isEven):\r\n continue\r\n\r\n # Even && Odd\r\n elif (valor % 2 == 0 & isEven == False):\r\n position = n - i - 1\r\n changes += 1\r\n\r\n # Odd && Odd\r\n elif (valor % 2 == 0 & isEven) == False:\r\n continue\r\n\r\nif (changes > 1):\r\n position = n\r\n\r\nprint(position)", "# 25A\r\nif __name__==\"__main__\":\r\n even_index=[]\r\n odd_index=[]\r\n countEven=0\r\n countOdd=0\r\n size=int(input())\r\n arr=list(map(int ,input().split()[:size]))\r\n for i in range(0,len(arr)):\r\n if(arr[i]%2==0):\r\n countEven=countEven+1\r\n even_index.append(i+1)\r\n else:\r\n countOdd=countOdd+1\r\n odd_index.append(i+1)\r\n #print(\"this is even {} and this is {} odd count:\".format(countEven,countOdd))\r\n if(countEven>countOdd):\r\n print(odd_index[0])\r\n else:\r\n print(even_index[0])\r\n ", "n = int(input())\r\nnumb = list(map(int, input().split()))\r\nch = []\r\nnech = []\r\nnumb_ch = []\r\nnumb_nech = []\r\nfor i in range(n):\r\n\tif numb[i] %2 == 0:\r\n\t\tch.append(numb[i])\r\n\t\tnumb_ch.append(i+1)\r\n\telse:\r\n\t\tnech.append(numb[i])\r\n\t\tnumb_nech.append(i+1)\r\nif len(ch)>len(nech):\r\n\tprint(*numb_nech)\r\nelse:\r\n\tprint(*numb_ch)", "def check_evenness(nums):\r\n even=[]\r\n odd=[]\r\n for itr in range(0, len(nums)):\r\n if nums[itr]%2==0: even.append(nums[itr])\r\n else: odd.append(nums[itr])\r\n\r\n if len(even)==1 and len(odd)>1: return nums.index(even[0])+1\r\n elif len(even)>1 and len(odd)==1: return nums.index(odd[0])+1\r\n\r\nsize=int(input(\"\"))\r\narray= input()\r\narray=list(map(int, array.split(' ')))\r\n\r\nprint(check_evenness(array))\r\n", "n = int(input())\narr = list(map(int, input().split(' ')))\nlast_odd, last_even = -1, -1\ncnt_odds, cnt_evens = 0, 0 \nfor i in range(n):\n if arr[i] % 2 == 1:\n last_odd = i \n cnt_odds += 1\n else:\n last_even = i\n cnt_evens += 1\nif cnt_odds == 1:\n print(last_odd+1)\nelse:\n print(last_even+1)\n", "n=int(input())\ne=0\no=0\np=0\nc=list(map(int,input().split()))\nfor i in range (len(c)):\n\tif (c[i]%2==0):\n\t\te+=1\n\telse:\n\t\to+=1\nfor i in range(len(c)):\n\tif (e==1):\n\t\tif(c[i]%2==0):\n\t\t\tp+=1\n\t\t\tbreak\n\t\telse:\n\t\t\tp+=1\n\telse:\n\t\tif(c[i]%2!=0):\n\t\t\tp+=1\n\t\t\tbreak\n\t\telse:\n\t\t\tp+=1\nprint(p)", "from collections import deque\nfrom math import *\nimport sys\nimport random\nfrom bisect import *\nfrom functools import reduce\nfrom sys import stdin\n \n\nn = int(input())\narr = list(map(int,input().split()))\nodd,even = 0,0\nfor i in arr:\n if i&1==0:\n even+=1\n else:\n odd+=1\nif even == 1:\n for i in range(n):\n if arr[i]&1==0:\n print(i+1)\nelse:\n for i in range(n):\n if arr[i]&1==1:\n print(i+1)\n", "n=int(input())\r\noc=0\r\nl=input().split()\r\nfor i in range(len(l)):\r\n l[i]=int(l[i])\r\nfor i in range(len(l)):\r\n if(l[i]%2 !=0):\r\n oc += 1\r\nec=len(l)-oc\r\nif(oc>ec):\r\n for i in range(len(l)):\r\n if(l[i]%2 ==0):\r\n print(l.index(l[i])+1)\r\nelif(ec>oc):\r\n for i in range(len(l)):\r\n if(l[i]%2 !=0):\r\n print(l.index(l[i])+1)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nevens = [i for i in nums if i % 2 == 0]\r\nodds = [i for i in nums if i % 2 != 0]\r\nif len(evens) == 1:\r\n print(nums.index(*evens) + 1)\r\nelse:\r\n print(nums.index(*odds) + 1)", "n=int(input())\r\nA=list(map(int, input().split()))\r\nB=[]\r\nfor i in range(n):\r\n B.append([A[i]%2, i+1])\r\nB.sort()\r\nif (B[1][0]==0):\r\n print(B[n-1][1])\r\nelse:\r\n print(B[0][1])", "n = int(input())\narr = [int(i)%2 for i in input().split()]\neven, eindex = 0, -1\nodd, oindex = 0, -1\nindex = -1\nfor i in range(n):\n j = arr[i]\n if j == 0:\n even += 1\n eindex = i\n else:\n odd +=1\n oindex = i\n if (even == 1 and odd > 1) or (odd == 1 and even > 1):\n index = (even == 1 and odd > 1) * eindex + (odd == 1 and even > 1)*oindex + 1\n break\nprint(index)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ne = []\r\no = []\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n e.append(i+1)\r\n elif l[i]%2==1:\r\n o.append(i+1)\r\n\r\nif len(e)<len(o):\r\n print(e[0])\r\nelse:\r\n print(o[0])\r\n", "n = int(input())\r\ns = [(i % 2) for i in map(int, input().split())]\r\nif sum(s[:3]) > 1:\r\n print(s.index(0) + 1)\r\nelse:\r\n print(s.index(1) + 1)\r\n", "\"\"\"A solution to 25A IQ Test.\"\"\"\n\n\ndef solution():\n n = int(input())\n v = [int(x) for x in input().split()]\n\n s = 0\n for i in range(3):\n s = (s << 1) | (v[i] % 2)\n\n ind = -1\n if s in (3, 4):\n ind = 1\n elif s in (2, 5):\n ind = 2\n elif s in (1, 6):\n ind = 3\n\n e = 0\n if ind == -1:\n if s == 0:\n e = 1\n else:\n e = 0\n\n for i in range(3, n):\n if e == v[i] % 2:\n ind = i + 1\n\n print(\"%d\" % ind)\n\n\nif __name__ == \"__main__\":\n solution()", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor x in a :\r\n b.append(x%2)\r\ncounteven = 0\r\nfor y in b :\r\n if y == 0 :\r\n counteven += 1\r\nif counteven == 1 :\r\n print(b.index(0)+1)\r\nelse :\r\n print(b.index(1)+1)", "def main():\r\n n=int(input())\r\n l=[int(x) for x in input().rstrip().split(' ')]\r\n e=0\r\n o=0\r\n a=0\r\n b=0\r\n for i in range(n):\r\n if l[i]%2==0:\r\n e+=1\r\n a=i+1\r\n else:\r\n o+=1\r\n b=i+1\r\n if e>o:\r\n print(b)\r\n else:\r\n print(a)\r\n\r\nmain()", "n = int(input())\na = [int(x) for x in input().split()]\no = 0\nfor i in range(3):\n if a[i] % 2:\n o += 1\n else:\n o -= 1\no = 0 if o > 0 else 1\ni = 1\nfor x in a:\n if x % 2 == o:\n print(i)\n break\n i += 1", "x=int(input())\r\ny=input().split()\r\ns=''\r\nfor i in range(x):\r\n s+=str(int(y[i])%2)\r\nif s.count(\"1\")==1:\r\n print(int(s.index(\"1\"))+1)\r\nelse:\r\n print(int(s.index(\"0\"))+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncount = 1\r\nchet = len(list(filter(lambda x : x % 2,a)))\r\nif chet > 1:\r\n for i in a:\r\n if i % 2 == 0:\r\n break\r\n count += 1\r\nelse:\r\n for i in a:\r\n if i % 2 != 0:\r\n break\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\r\ns=list(map(int,input().split()))\r\ndec=[]\r\nfor i in range(0,len(s)):\r\n if s[i]%2==0:\r\n dec.append('e')\r\n else:\r\n dec.append('o')\r\nif dec.count('o')<dec.count('e'):\r\n print(dec.index('o')+1)\r\nelse:\r\n print(dec.index('e')+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\neven, odd = -1, -1\r\nnum = 0\r\nfor i in range(n):\r\n if a[i]&1:\r\n num += 1\r\n odd = i\r\n else:\r\n even = i\r\nif num == n-1:\r\n print (even+1)\r\nelse:\r\n print (odd+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 12 20:44:53 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\n\r\nn = int(input())\r\ntest = input().split(' ')\r\neven = []\r\nodd = []\r\nfor i in range(len(test)):\r\n if int(test[i])%2 == 0:\r\n even.append(int(test[i]))\r\n else:\r\n odd.append(int(test[i]))\r\nif len(even) == 1:\r\n print(test.index(str(even[0]))+1)\r\nelse:\r\n print(test.index(str(odd[0]))+1)", "n=int(input())\r\nlists = [int(x) for x in input().split()]\r\nodd=[]\r\neven=[]\r\nfor x in lists:\r\n if x % 2 == 0:\r\n even.append(x)\r\n else:\r\n odd.append(x)\r\nif len(even) < len(odd):\r\n print(lists.index(int(even[0]))+1)\r\nelse:\r\n print(lists.index(int(odd[0]))+1)", "a=int(input())\r\n\r\nb=list(map(int,input().split()))\r\nc,d=0,0\r\ne=[]\r\nf=[]\r\n\r\nfor i in b:\r\n if(i%2==0):\r\n c+=1\r\n e.append(i)\r\n else:\r\n d+=1\r\n f.append(i)\r\n\r\nif(c>d):\r\n print(b.index(f[0])+1)\r\nelse:\r\n print(b.index(e[0])+1)", "n=int(input())\nS=input().split()\nx=0\ny=0\nfor i in S:\n i=int(i)\n if i/2==int(i/2):\n x=x+1\n else:\n y=y+1\nif x==1:\n for k in range(n):\n S[k]=int(S[k])\n if S[k]/2==int(S[k]/2):\n print(k+1)\nif y==1:\n for k in range(n):\n S[k]=int(S[k])\n if S[k]/2!=int(S[k]/2):\n print(k+1)\n", "n = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\ni = a= b = 0\r\n\r\nwhile i < n:\r\n if arr[i]%2 == 0:\r\n a = a +1\r\n i = i + 1\r\n else:\r\n b = b + 1\r\n i = i + 1\r\ni = 0\r\nwhile i < n:\r\n if a == 1:\r\n if arr[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n else:\r\n i = i + 1\r\n elif b == 1:\r\n if arr[i] % 2 != 0:\r\n print(i+1)\r\n break\r\n else:\r\n i = i + 1", "n=int(input())\r\narr=list(map(int,input().split()))\r\nzeros=0\r\nones=0\r\nfor i in range(len(arr)):\r\n\tarr[i]=arr[i]%2\r\n\tif arr[i]==0:\r\n\t\tzeros+=1\r\n\telse:\r\n\t\tones+=1\r\nif zeros==1:\r\n\tprint(arr.index(0)+1)\r\nelse:\r\n\tprint(arr.index(1)+1)", "print((lambda n, ls: 1 if ls[0] % 2 != ls[1] % 2 == ls[2] % 2 else [i + 1 for i in range(n) if ls[i] % 2 != ls[0] % 2][0])(int(input()), list(map(int, input().split()))))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nc1=0\r\nc2=0\r\nfor i in range(n):\r\n if a[i]%2!=0:\r\n c1+=1\r\n else:\r\n c2+=1\r\nfor j in range(n):\r\n if c1>c2:\r\n if a[j]%2==0:\r\n print(j+1)\r\n break\r\n else:\r\n if a[j]%2!=0:\r\n print(j+1)\r\n break\r\n \r\n", "no_of_inputs=int(input())\ninput_nombers =list( map(int,input().split()) )\n\nif ( input_nombers[0]&1==0 and input_nombers[1]&1==0 ) or (input_nombers[0]&1==0 and input_nombers[2]&1==0) or (input_nombers[1]&1==0 and input_nombers[2]&1==0):\n for i in range(len(input_nombers)):\n if input_nombers[i]&1==1 :\n print (i+1)\n\nelse:\n for i in range(len(input_nombers)):\n if input_nombers[i]&1==0:\n print (i+1)\n\n", "b=int(input())\r\na=list(map(int,input().split()))\r\no=0\r\ne=0\r\nt=0\r\np=0\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n e+=1\r\n t=i\r\n if a[i]%2==1:\r\n o+=1\r\n p=i\r\nif e==1 and o>=2:\r\n print(t+1)\r\nelse:\r\n print(p+1)", "import sys\r\n\r\nsys.stdin.readline()\r\na = list(map(lambda s: int(s), sys.stdin.readline().split()))\r\neven = (a[0] % 2 + a[1] % 2 + a[2] % 2) in [0, 1]\r\nfor i in range(len(a)):\r\n if even and a[i] % 2 != 0:\r\n print(i + 1)\r\n elif not even and a[i] % 2 == 0:\r\n print(i + 1)", "n=int(input())\r\nl=[]\r\nb=[]\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n l.append(i)\r\n else:\r\n b.append(i)\r\nif len(l)>len(b):\r\n print(b[0]+1)\r\nelse:\r\n print(l[0]+1)\r\n", "n = int(input())\r\na = []\r\na = list(map(int, input().strip().split()))\r\ni = 0\r\nk = 0\r\ni1 = 0\r\nk1 = 0\r\nfor j in range(n):\r\n if(a[j]%2==0):\r\n i = i+1\r\n else:\r\n k = k+1\r\nif(i==(n-1)):\r\n for e in a:\r\n i1+=1\r\n if(e%2!=0):\r\n print(i1)\r\n break\r\nelse:\r\n for e in a:\r\n k1+=1\r\n if(e%2==0):\r\n print(k1)\r\n \r\n \r\n", "n = int(input())\ncheck = list(map(int, input().split(' ')))\nnormal = 2\n\nif check[0] % 2 == check[1] % 2:\n normal = check[0] % 2\n for i in range(n):\n if check[i] % 2 != normal:\n print(i + 1)\n break\nelse:\n if check[1] % 2 == check[2] % 2:\n print('1')\n else:\n print('2')\n\n\n\n \t \t\t \t\t\t \t\t \t \t \t \t\t\t", "input()\r\nnums = [int(x) % 2 for x in input().split()]\r\nprint(nums.index(sum(nums) == 1)+1)\r\n", "N = int(input())\r\n\r\nn = str(input())\r\n\r\nn = n.split()\r\n\r\n# Convert to integers\r\n\r\nL = []\r\n\r\nfor i in range(len(n)):\r\n L.append(int(n[i]))\r\n\r\n# Obtain the parity of the first\r\n# Compare the parity of the rest\r\n\r\n# Case 1: the 2nd number is different\r\n# The 3rd number shall serve as jury\r\n# If the 1st parity = 3rd parity\r\n# Number 2 is the impostor\r\n# Else (if 1st != 3rd)\r\n# number 1 is the impostor\r\n\r\n# Case 2: the nth number, where n > 2 is different\r\n# It is the impostor\r\n\r\n# In the end, we retrieve this index as output\r\n\r\ndef parity(q):\r\n if (q % 2) == 0: # 0 if even\r\n return 0\r\n else: # 1 if odd\r\n return 1\r\n\r\nfor i in range(1,len(L)):\r\n if parity(L[0]) != parity(L[i]):\r\n if i == 1 :\r\n if parity(L[0]) == parity(L[i+1]):\r\n print(i+1)\r\n break\r\n else:\r\n print(1)\r\n break\r\n else:\r\n print(i+1)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=len([i for i in l if i%2!=0])\r\np=len([i for i in l if i%2==0])\r\nif k>p:\r\n for i in range(n-1,-1,-1):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n-1,-1,-1):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl2=[]\r\nfor i in range(3):\r\n l2.append(l[i]%2)\r\na=l2.count(0)\r\nb=l2.count(1)\r\nif a>b:\r\n for i in range(n):\r\n if l[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)", "size = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nodd = 0\r\neven = 0\r\n\r\nfor i in li:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif even > odd:\r\n for j in range(len(li)):\r\n if li[j] % 2 != 0:\r\n print(j+1)\r\n break\r\nelse:\r\n for k in range(len(li)):\r\n if li[k] % 2 == 0:\r\n print(k+1)", "n = map(int, input())\nnums = list(map(int, input().split()))\noddCnt = 0\nevenCnt = 0\nfor num in nums[:3]:\n if num % 2 == 0:\n evenCnt += 1\n else:\n oddCnt += 1\nif oddCnt > 1:\n for i, num in enumerate(nums):\n if num % 2 == 0:\n print(i+1)\n break\nelse:\n for i, num in enumerate(nums):\n if num % 2 != 0:\n print(i+1)\n break\n", "# import sys\r\n\r\n# sys.stdin = open(\"25A.in\", \"r\")\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\neven = []\r\nodd = []\r\n\r\nfor i in range(n):\r\n num = nums[i]\r\n if num % 2 == 0:\r\n # print(num)\r\n # print(i)\r\n # print()\r\n even.append([num, i])\r\n else:\r\n # print(num)\r\n # print(i)\r\n # print()\r\n odd.append([num, i])\r\n\r\nif len(even) == 1:\r\n print(even[0][1] + 1)\r\nelse:\r\n print(odd[0][1] + 1)\r\n", "n = int(input())\r\nset = [int(i) for i in input().split()]\r\nind = 0\r\nfor i in range(3):\r\n ind += set[i] % 2\r\nind = int(ind < 2)\r\nfor i in range(n):\r\n if set[i] % 2 == ind:\r\n print(i + 1)\r\n break", "# cook your dish here\r\n#siz_arr=list(map(int,input().rstrip().split()))\r\nlenn=int(input())\r\narr=list(map(int,input().rstrip().split()))\r\nnum_ev=0\r\nnum_od=0\r\nprev_ev=-1\r\nprev_od=-1\r\nfor i in range (lenn):\r\n if arr[i]%2==0:\r\n num_ev+=1\r\n prev_ev=i\r\n else:\r\n num_od+=1\r\n prev_od=i\r\n\r\nif num_od==1:\r\n print(prev_od+1)\r\nelse:\r\n print(prev_ev+1)\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n ", "n = int(input())\r\nm = list(map(int,input().split()))[:n]\r\nc=d=e=f=0\r\nfor i in range(n):\r\n if m[i]%2==0:\r\n c+=1 \r\n e=i\r\n else:\r\n d+=1\r\n f=i\r\nprint(f+1) if(d==1) else print(e+1) ", "n=int(input())\r\nm=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in m:\r\n if i%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\nif e>o:\r\n for i in range(len(m)):\r\n if m[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(m)):\r\n if m[i]%2==0:\r\n print(i+1)", "n = int(input())\r\nfriends = list(map(int,input().split()))\r\no = lambda x : x%2==0\r\nu = lambda x : x%2!=0\r\na = list(filter(o,friends))\r\nb = list(filter( u,friends))\r\n\r\nif len(a)==1:\r\n print(friends.index(a[0])+1)\r\nelif len(b)==1:\r\n print(friends.index(b[0])+1)", "n=int(input())\nq=0\ns=0\nl=list(map(int,input().split()))\nfor j in range(0,n):\n if l[j]%2:\n p=j\n q=q+1\n else:\n m=j\n s=s+1\nif q==1:\n print(p+1)\nif s==1:\n print(m+1)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\neven =[]\r\nodd = []\r\nfor num in a:\r\n if num%2 == 0:\r\n even.append(num)\r\n else:\r\n odd.append(num)\r\nif len(even)== 1:\r\n print(a.index(even[0])+1)\r\nelse:\r\n print(a.index(odd[0])+1)\r\n \r\n\r\n", "n = int(input())\r\na = [int(x) & 1 for x in input().split()]\r\nfind = 0 if a.count(1) > a.count(0) else 1\r\nprint(a.index(find) + 1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Count the number of even and odd numbers\r\neven_count = 0\r\nodd_count = 0\r\neven_index = 0\r\nodd_index = 0\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n even_index = i + 1\r\n else:\r\n odd_count += 1\r\n odd_index = i + 1\r\n\r\n# Check if there is only one odd or even number\r\nif even_count == 1:\r\n print(even_index)\r\nelse:\r\n print(odd_index)\r\n", "a=int(input())\r\nb=[int(x)%2 for x in input().split()]\r\nprint(b.index(sum(b)==1)+1)", "n = int(input())\r\nx = list(map(int,input().split()))\r\nk=0\r\nfor i in range(n):\r\n if x[i]%2==0:\r\n k=k+1\r\n num1=i\r\n else:\r\n num2=i\r\nif k==1:\r\n print(num1+1)\r\nelse:\r\n print(num2+1)\r\n \r\n", "n = int(input())\r\ns = [int(i) for i in input().split(' ')]\r\nq = [0]*n\r\nfor i in range(n):\r\n q[i] = s[i]%2\r\nif sum(q) <= 1:\r\n print(q.index(max(q))+1)\r\nelse:\r\n print(q.index(min(q))+1)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ne=[]\r\no=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e.append(i+1)\r\n else:\r\n o.append(i+1)\r\nif len(e)==1:\r\n print(e[0])\r\nelse:\r\n print(o[0])\r\n", "n = int(input())\r\ns = map(int,input().split())\r\ns = list(s)\r\nchet = []\r\nnechet = []\r\n\r\nfor i in s:\r\n if i % 2 == 0:\r\n chet.append(i)\r\n else:\r\n nechet.append(i)\r\n\r\nif len(chet) > len(nechet):\r\n print(s.index(nechet[0])+1)\r\nelse:\r\n print(s.index(chet[0])+1)", "l1 = int(input())\nl2 = input().split()\n#l3 = input().split()\n\nl2 = [int(i) for i in l2]\n\np = 0\nimp = 0\n\nfor i in range(len(l2)):\n if(l2[i]%2 == 0):\n p = p + 1\n lastP = i\n else:\n imp = imp + 1\n lastImp = i\n\nif imp == 1:\n print(lastImp+1)\nelse:\n print(lastP+1)\n \t\t\t \t\t\t \t \t \t \t\t\t\t \t\t\t \t\t \t", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\neven = False\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0 :\r\n count += 1\r\n if count >= 2 :\r\n even = True\r\n break\r\n\r\nif even == True :\r\n for j in range(n):\r\n if numbers[j] % 2 != 0 :\r\n print(j+1)\r\n break\r\nelse:\r\n for k in range(n):\r\n if numbers[k] % 2 == 0 :\r\n print(k+1)\r\n break", "t=int(input())\r\na=input().split()\r\nb=[int(i) for i in a]\r\nc=[i for i in b if i%2==0]\r\nd=[i for i in b if i%2==1]\r\nif len(c)==1:\r\n print(b.index(c[0])+1)\r\nelse:\r\n print(b.index(d[0])+1)\r\n", "from math import *\r\n\r\neven = 0\r\nodd = 0\r\nn = int(input())\r\nx = [int(x) for x in input().split(\" \", n-1)]\r\nfor i in range(3):\r\n if x[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif even > odd:\r\n for i in range(n):\r\n if x[i] % 2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if x[i] % 2 == 0:\r\n print(i+1)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\ndef isEven(x):\r\n if(x%2==0):\r\n return True\r\n \r\n \r\ndef isOdd(x):\r\n if(x%2!=0):\r\n return True \r\n\r\no=[]\r\ne=[]\r\n\r\nfor i in l:\r\n if(isOdd(i)):\r\n o.append(i)\r\n \r\nfor i in l:\r\n if(isEven(i)):\r\n e.append(i)\r\n \r\nif(len(o)<len(e)):\r\n print(l.index(o[0])+1)\r\nelse:\r\n print(l.index(e[0])+1)\r\n \r\n\r\n ", "n = int(input())\r\nl = [int(s) for s in input().split(\" \")]\r\na = l[0]\r\nb = l[1]\r\nc = l[2]\r\nresp = 0\r\nif a%2 == b%2:\r\n resp = a%2\r\nelse:\r\n if a%2 == c%2:\r\n resp = a%2\r\n else:\r\n resp = b%2\r\nfor i in range(len(l)):\r\n if l[i]%2!=resp:\r\n print(i+1)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=[x%2 for x in l]\r\ne=l.count(0)\r\nif(e==1):\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)\r\n ", "n=input()\r\nn=int(n)\r\nx = list(map(lambda q:int(q), input().split(\" \")))\r\ny=0\r\nfor i in range (n):\r\n y=x[i]%2+y\r\nfor i in range (n):\r\n if y>=2 and x[i]%2==0:\r\n index=x.index(x[i])\r\n print(index+1)\r\n elif y==1 and x[i]%2==1:\r\n index=x.index(x[i])\r\n print(index+1)\r\n\r\n\r\n\r\n", "n = int(input())\nm = input().split()\nch = 0\nfor i in range(n):\n if int(m[i])%2==0:\n ch+=1\n ch1 = i\n else:\n nc1 = i\nif ch == 1:\n print(ch1+1)\nelse:\n print(nc1+1)\n", "t=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n b.append('0')\r\n else:\r\n b.append('1')\r\nif b.count('0')==1:\r\n print(b.index('0')+1)\r\nelse:\r\n print(b.index('1')+1)", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\n\r\nevenness = -1\r\n\r\nif nums[0] % 2 == nums[1] % 2:\r\n evenness = nums[0] % 2\r\nelse:\r\n if nums[0] % 2 == nums[2] % 2:\r\n evenness = nums[0] % 2\r\n else:\r\n evenness = nums[1] % 2\r\n\r\nfor num in nums:\r\n if num % 2 != evenness:\r\n print(nums.index(num) + 1)\r\n break\r\n", "t=int(input())\r\nl=list(map(int,input().split()))\r\na,b=0,0\r\nc,d=0,0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n a=i\r\n c+=1\r\n else:\r\n b=i\r\n d+=1\r\nif d==1:\r\n print(b+1)\r\nelif c==1:\r\n print(a+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nco=0\r\nce=0\r\np=0\r\nle=[]\r\nlo=[]\r\n\r\n\r\nfor i in l:\r\n if i%2==0:\r\n ce+=1\r\n p+=1\r\n \r\n le.append(p)\r\n else:\r\n co+=1\r\n p+=1\r\n \r\n lo.append(p)\r\nif ce>co:\r\n print(lo[0]) \r\nelse:\r\n print(le[0]) \r\n ", "n=int(input())\r\na=input().split()\r\na=[int(i) for i in a]\r\neven=0\r\nodd=0\r\nevenindex=0\r\noddindex=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even+=1\r\n evenindex=i+1\r\n else:\r\n odd+=1\r\n oddindex=i+1\r\nif even==1:\r\n print(evenindex)\r\nelse:\r\n print(oddindex)", "def find_idx(a, mode):\r\n for i in range(len(a)):\r\n if mode:\r\n if a[i] % 2 == 0:\r\n return i + 1\r\n else:\r\n if a[i] % 2 != 0:\r\n return i + 1\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\neven = sum(1 for x in a if x % 2 == 0)\r\nif even == n - 1:\r\n print(find_idx(a, False))\r\nelse:\r\n print(find_idx(a, True))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nr = 0\r\nbuf_r = 0\r\nl = 0\r\nbuf_l = 0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n r+=1\r\n buf_r = i\r\n else:\r\n l+=1\r\n buf_l = i\r\n if r==1 and l>1:\r\n print(buf_r+1)\r\n break\r\n elif l==1 and r>1:\r\n print(buf_l+1)\r\n break\r\n\r\n ", "n=int(input())\r\na= list(map(int, input().split()))\r\no=0\r\ne=0\r\nv1=0\r\nv2=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n e+=1\r\n v1=i+1\r\n else:\r\n o+=1\r\n v2=i+1\r\nif(e==1):\r\n print(v1)\r\nelse:\r\n print(v2)\r\n", "_ = input()\r\nvls = list(map(int, input().split()))\r\nvls_pares = []\r\nvls_impares = []\r\n\r\nfor i, v in enumerate(vls):\r\n if v % 2 == 0:\r\n vls_pares.append((v, i+1))\r\n else:\r\n vls_impares.append((v, i+1))\r\n\r\nprint(vls_pares[0][1] if len(vls_pares) == 1 else vls_impares[0][1])\r\n", "n = int(input())\r\nlst = [int(x) for x in input().split()]\r\nx=1\r\nif (lst[0]-lst[1]) % 2 ==1:\r\n if (lst[0]-lst[2]) % 2 ==1:\r\n print(1)\r\n else:print(2)\r\n exit()\r\nwhile x < len(lst):\r\n if (lst[x]-lst[x+1]) % 2 ==1:\r\n break\r\n x += 1\r\nprint(x+2)", "import sys\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\nn1 = inp()\r\nn2 = inlt()\r\n\r\nfor i in range(n1-2):\r\n if n2[i] % 2 == 0:\r\n if n2[i+1] % 2 == 0: \r\n if n2[i+2] % 2 != 0: # eeo\r\n print(i+2+1)\r\n break\r\n elif n2[i+2] % 2 == 0: # eoe\r\n print(i+1+1)\r\n break\r\n elif n2[i+2] % 2 != 0: # eoo\r\n print(i+1)\r\n break\r\n\r\n elif n2[i+1] % 2 == 0:\r\n if n2[i+2] % 2 == 0: # oee \r\n print(i+1)\r\n break\r\n elif n2[i+2] % 2 != 0: # oeo\r\n print(i+1+1)\r\n break\r\n elif n2[i+1] % 2 != 0:\r\n if n2[i+2] % 2 == 0: # ooe\r\n print(i+2+1)\r\n break\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n", "n = int(input())\r\ne = list(input().split())\r\ns = \"\"\r\nfor i in e:\r\n if int(i) % 2 == 0:\r\n s = s + \"0\"\r\n else:\r\n s = s + \"1\"\r\nif s.index('1') == s.rindex('1'):\r\n print(s.find('1') + 1)\r\nelse:\r\n print(s.find('0') + 1)", "n = int(input())\r\ns = list(map(int,input().split()))\r\nif s[0]%2 == s[-1]%2:\r\n a = s[0]%2\r\n for i in range(n):\r\n if s[i]%2 != a:\r\n print(i+1)\r\nelse:\r\n if s[1]%2 ==s[0]%2:\r\n print(len(s))\r\n else:\r\n print('1')\r\n", "n = int(input())\nl = list(map(int,input().split()))\ndef mod(i):\n\treturn i%2\n\nans = list(map(mod,l))\nprint(ans.index(1)+1 if ans.count(1) == 1 else ans.index(0)+1)\n\n", "n = int(input())\r\nl = list(map(int,input().strip().split()))\r\nce=0\r\nco= 0\r\nlo= 0\r\nle= 0\r\nfor i in range(n):\r\n\tif l[i]%2 == 0:\r\n\t\tce+=1\r\n\t\tle =i\r\n\telse:\r\n\t\tco+=1\r\n\t\tlo =i\r\n\r\nif ce==1:\r\n\tprint(le+1)\r\nelse:\r\n\tprint(lo+1)", "def main():\r\n n = input()\r\n n = int(n)\r\n s = input().split()\r\n ans1 = 0\r\n ans0 = 0\r\n l1 = 0\r\n l0 =0\r\n for i in range(len(s)):\r\n x = int(s[i])\r\n if x % 2 == 1:\r\n l1 += 1\r\n ans1 = i + 1\r\n else:\r\n l0 += 1\r\n ans0 = i + 1\r\n if l1 == 1:\r\n print(ans1)\r\n else:\r\n print(ans0)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "n = int(input())\r\nl = [int(i)%2 for i in input().split()]\r\nx1 = l.count(1)\r\nx2 = l.count(0)\r\nif x1 == 1:\r\n print(l.index(1)+1)\r\nelif x2 == 1:\r\n print(l.index(0)+1)", "n=int(input())\r\nnumbers=input().split()\r\ni=0\r\nwhile i<n:\r\n numbers[i]=int(numbers[i])%2\r\n i=i+1\r\ndef count(ls,k):\r\n i=0\r\n for elem in ls:\r\n if int(elem)==k:\r\n i=i+1\r\n return i\r\ndef find(ls,k):\r\n i=0\r\n while i<len(ls):\r\n if int(ls[i])==k:\r\n break\r\n else:\r\n i=i+1\r\n return i\r\nif count(numbers,0)==1:\r\n print(find(numbers,0)+1)\r\nelse:\r\n print(find(numbers,1)+1)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nevenness = [None, None]\r\neven_count = 0\r\nfor num in nums:\r\n if num % 2 == 0:\r\n even_count += 1\r\n evenness[0] = num\r\n else:\r\n evenness[1] = num\r\n\r\nprint(nums.index(evenness[0]) + 1 if even_count == 1 else nums.index(evenness[1]) + 1)", "#.*?\\n\n#from collections import Counter\n#from collections import defaultdict\n#from collections import deque\n\n# BIT_MANIPULATION\n# def intToBin(num:int): return \"{0:b}\".format(num)\n# def binToInt(bin:str)->int: return int(bin,2)\n\n# INPUT\ndef inpNum(): return int(input())\ndef inpNums(): return map(int,input().split())\ndef inpList(): return list(map(int,input().split()))\n# def inpMatrix(rows): return [list(map(int, input().split())) for _ in range(rows)]\n\n\n# problem code:\n\nn = inpNum()\nni = inpList()\n\ndetectOdd = list(map(lambda x:x%2,ni[:3])).count(1)<2\nfor i,_n in enumerate(ni):\n if _n%2:\n if detectOdd: print(i+1)\n elif not detectOdd:\n print(i+1)", "n = int(input())\nnumbers = map(int, input().split())\nnumbers = [number % 2 for number in numbers]\nif numbers.count(1) == 1:\n print(numbers.index(1) + 1)\nelse:\n print(numbers.index(0) + 1)\n", "# Read the number of numbers\r\nn = int(input())\r\n\r\n# Read the numbers and store them in a list\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Initialize the counters for odd and even numbers\r\nodd_count = 0\r\neven_count = 0\r\n\r\n# Iterate through the numbers and count the odd and even numbers\r\nfor i, number in enumerate(numbers):\r\n if number % 2 == 0:\r\n even_count += 1\r\n else:\r\n odd_count += 1\r\n\r\n# If there is only one odd number, print its index\r\nif odd_count == 1:\r\n for i, number in enumerate(numbers):\r\n if number % 2 == 1:\r\n print(i + 1)\r\n break\r\n\r\n# If there is only one even number, print its index\r\nif even_count == 1:\r\n for i, number in enumerate(numbers):\r\n if number % 2 == 0:\r\n print(i + 1)\r\n break\r\n", "n = int(input())\r\ndat = list(map(int, input().split()))\r\ncount_c = count_nc = 0\r\ncurr_ind_c = curr_ind_nc = 0\r\n\r\n\r\nfor i in range(n):\r\n if dat[i] % 2 == 0:\r\n count_c += 1\r\n curr_ind_c = i\r\n else:\r\n count_nc += 1\r\n curr_ind_nc = i\r\n\r\nif count_nc == 1:\r\n print(curr_ind_nc + 1)\r\nelif count_c == 1:\r\n print(curr_ind_c + 1)", "num = int(input())\nmylist = list(map(int, input().split(None,num)[:num]))\n\ncountEven = 0\ncountOdd = 0\ni = 0\nj = 0\n\nfor _ in range(num):\n \n if mylist[i] % 2 == 0:\n countEven += 1\n else:\n countOdd += 1\n \n i += 1\n\nif countEven > countOdd:\n \n for _ in range(num):\n if mylist[j] % 2 != 0:\n print(j+1)\n break\n j += 1\n \nelse:\n for _ in range(num):\n if mylist[j] % 2 == 0:\n print(j+1)\n break\n j +=1\n\t\t\t \t \t\t \t \t \t \t\t", "n = int(input())\nlist = [int(x) for x in input().split()]\nevenCnt = 0\noddCnt = 0\ni = int(0)\nwhile i < n:\n if list[i] % 2 == 0:\n evenCnt = evenCnt + 1\n evenIdx = i + 1\n else:\n oddCnt = oddCnt + 1\n oddIdx = i + 1\n i += 1\nif (evenCnt == 1): print(evenIdx)\nelif (oddCnt == 1): print(oddIdx)\n\n \t \t\t \t \t\t \t \t \t \t \t\t\t\t\t", "n=int(input())\r\ne=o=lasteven=lastodd=0\r\ns=list(map(int,input().split()))\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n e=e+1\r\n lasteven=i\r\n else:\r\n o=o+1\r\n lastodd=i\r\nif e==1:\r\n print(lasteven+1)\r\nelse:\r\n print(lastodd+1)\r\n\r\n", "length=input()\nnumberlist=list(map(int,input().split()))\nparity=[]\nfor i in range (len(numberlist)):\n parity.append(numberlist[i]%2)\n\nif parity.count(0)==1:\n print(parity.index(0)+1)\nif parity.count(1)==1:\n print(parity.index(1)+1)", "N = int(input())\r\nlst = input().split()\r\nodd = 0\r\nfor num in lst:\r\n if int(num) % 2 == 0:\r\n odd += 1\r\nif odd > 1:\r\n for i in range(len(lst)):\r\n if int(lst[i]) % 2 != 0:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(len(lst)):\r\n if int(lst[i]) % 2 == 0:\r\n print(i + 1)\r\n break\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nmost_odd = nums[0] % 2 == 1 and nums[1] % 2 == 1 or nums[1] % 2 == 1 and nums[2] % 2 == 1 or nums[0] % 2 == 1 and nums[2] % 2 == 1\r\n\r\nfor i in range(len(nums)):\r\n if most_odd:\r\n if nums[i] % 2 == 0: \r\n print(i + 1)\r\n break\r\n else:\r\n if nums[i] % 2 == 1: \r\n print(i + 1)\r\n break", "n=int(input())\r\nlis=list(map(int,input().split()))\r\ndi={}\r\neven,odd=[],[]\r\nfor i in lis:\r\n\tif i%2:\r\n\t\todd.append(i)\r\n\telse:even.append(i)\r\nif len(even)==1:\r\n\tprint(lis.index(even[0])+1)\r\nelse:\r\n\tprint(lis.index(odd[0])+1)\r\n", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\neven = 0 # четные\r\nodd = 0 # нечетные\r\nfor i in range(3):\r\n if nums[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif even > odd:\r\n for i in range(n):\r\n if nums[i] % 2 != 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if nums[i] % 2 == 0:\r\n print(i + 1)\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nev=0\r\nod=0\r\nans1=0\r\nans2=0\r\nfinal=0\r\nfor i in arr:\r\n if i%2==0:\r\n ev+=1\r\n ans1=arr.index(i)+1\r\n else:\r\n od+=1\r\n ans2=arr.index(i)+1\r\n\r\n if(ev>1 and od==1):\r\n final=ans2\r\n break\r\n elif(od>1 and ev==1):\r\n final=ans1\r\n break\r\n\r\nprint(final)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n arr[i]=0\r\n else:\r\n arr[i]=1\r\nodd=arr.count(1)\r\neven=arr.count(0)\r\nif odd==1:\r\n for i in range(n):\r\n if arr[i]==1:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if arr[i]==0:\r\n print(i+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=[l[i]%2 for i in range(n)]\r\nif l.count(1)==1:\r\n print(1+l.index(1))\r\nelse:\r\n print(1+l.index(0))", "test_cases=int(input());counter_even=[];counter_odd=[]\r\nnumbers=list(map(int,input().split()))\r\nfor i in numbers:\r\n if i%2==0:\r\n counter_even.append(i)\r\n #print('i is even= ',i)\r\n else:\r\n counter_odd.append(i)\r\n #print('i is odd= ',i)\r\nif len(counter_even)>len(counter_odd):\r\n #print(numbers.index(counter_even[0]))\r\n print(numbers.index(counter_odd[0])+1)\r\n #print('here odd')\r\nelse:\r\n #print(numbers.index(counter_odd[0]))\r\n #print('here even')\r\n print(numbers.index(counter_even[0])+1)", "import math\r\nc=int(input())\r\nl=input().split()\r\neven=\"0\"\r\nevencount=0\r\nodd=\"0\"\r\noddcount=0\r\nfor n in range(c):\r\n if int(l[n])%2==0:\r\n even=\"1\"+even\r\n evencount+=1\r\n odd=\"0\"+odd\r\n else:\r\n even=\"0\"+even\r\n odd=\"1\"+odd\r\n oddcount+=1\r\nif evencount>oddcount:\r\n print(int(math.log10(int(odd))))\r\nelse:\r\n print(int(math.log10(int(even))))", "n = int(input())\r\nl = list(map(int, input().split()))\r\neven = list(l.index(i)+1 for i in l if i%2 == 0)\r\nodd = list(l.index(i)+1 for i in l if i%2 != 0)\r\nif len(even) < len(odd) : \r\n print(*even)\r\nelse : \r\n print(*odd)", "n1=int(input())\r\nk=input()\r\ncount=0\r\nodds=0\r\noi=0\r\nei=0\r\nevens=0\r\nk=k+' '\r\nk1=[]\r\nterm=''\r\nfor i in k:\r\n if i!=' ':\r\n term+=i\r\n elif i==' ':\r\n k1.append(int(term))\r\n term=''\r\n\r\nfor j in k1:\r\n count+=1\r\n if j%2==0:\r\n evens+=1\r\n ei=count\r\n else:\r\n odds+=1\r\n oi=count\r\nif odds>evens:\r\n print(ei)\r\nelse:\r\n print(oi)\r\n\r\n", "n = int(input())\r\nm = input()\r\nm = m.split(' ')\r\n\r\nwew = int(m[0])%2\r\ncounter = 0\r\n\r\nif (int(m[0])%2 != int(m[1])%2):\r\n if (int(m[2])%2 == int(m[0])%2):\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n for num in m:\r\n num = int(num)\r\n\r\n if num%2 != wew:\r\n print(counter+1)\r\n break\r\n \r\n wew = num%2\r\n counter = counter + 1\r\n\r\n\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nif s[0]%2!=0:\r\n if s[1]%2!=0:\r\n for i in range(n):\r\n if s[i]%2==0:\r\n print(i+1)\r\n elif s[1]%2==0 and s[2]%2==0:\r\n print('1')\r\n elif s[2]%2!=0:\r\n for i in range(n):\r\n if s[i]%2==0:\r\n print(i+1)\r\nelse:\r\n if s[1]%2==0:\r\n for i in range(n):\r\n if s[i]%2!=0:\r\n print(i+1)\r\n elif s[1]%2!=0 and s[2]%2!=0:\r\n print('1')\r\n elif s[2]%2==0:\r\n for i in range(n):\r\n if s[i]%2!=0:\r\n print(i+1)", "n=int(input())\r\nlist1=list(map(int,input().strip().split(' ')))\r\nev=[]\r\nod=[]\r\nfor i in range(n):\r\n if list1[i]%2==0:\r\n ev.append(list1[i])\r\n else:\r\n od.append(list1[i])\r\nif len(od)==1:\r\n print(list1.index(od[0])+1)\r\nelse:\r\n print(list1.index(ev[0])+1)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\noc=0\r\nec=0\r\nfor i in arr:\r\n if i%2==0:\r\n ec+=1\r\n else:\r\n oc+=1\r\n if oc>=2 or ec>=2:\r\n break\r\nif oc>=2:\r\n for i in range(n):\r\n if arr[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if arr[i]%2!=0:\r\n print(i+1)\r\n break\r\n \r\n ", "m = []\r\nc = 0\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nt = 0\r\nk = 0\r\nfor i in range(n):\r\n if m[i] % 2 == 0:\r\n t = i\r\n c += 1\r\n elif m[i] % 2 == 1:\r\n k = i\r\nif c == 1:\r\n print(t+1)\r\nelse:\r\n print(k+1)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nodd, even = 0,0\r\nfor i in l:\r\n if i%2:\r\n odd+=1\r\n else:\r\n even+=1\r\n\r\nflag = odd>even\r\n\r\nfor i in range(n):\r\n if l[i] % 2 != flag:\r\n print(i+1)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in l:\r\n if i%2==0:\r\n k.append(0)\r\n else:\r\n k.append(1)\r\nif k.count(1)>1:\r\n print(k.index(0)+1)\r\nelse:\r\n print(k.index(1)+1)\r\n \r\n", "def isEven(n):\n if n % 2 == 0:\n return True\n return False\n\nn = int(input())\nl = [int(x) for x in input().split()]\nk = 0\nm = 0\no = 0\ne = 0\nfor i in range(n):\n if isEven(l[i]):\n e += 1\n k = i\n else:\n o += 1\n m = i\nif e == 1:\n print(k+1)\nelse:\n print(m+1)\n\n \n\n\n", "n = int(input())\nl = list(map(int, input().split()))\nfor i in range(n):\n l[i] = l[i] % 2\nval = 1\nif sum(l) == (n-1):\n val = 0\nprint(l.index(val)+1)\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nnum_odd = len([x for x in a if x%2])\r\nnum_even = len([x for x in a if x%2==0])\r\nneeded = 1 if num_odd < num_even else 0\r\nfor i in range(n):\r\n if a[i]%2 == needed:\r\n print(i+1)\r\n break\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 28 20:51:43 2019\r\n\r\n@author: jk Jin\r\n\"\"\"\r\n\r\nn = int(input())\r\nnum = [int(x) for x in input().split()]\r\nmost = 0\r\nif num[0]%2==1 and num[1]%2==1:\r\n most = 1\r\nelif num[0]%2==1 and num[2]%2==1:\r\n most = 1\r\nelif num[2]%2==1 and num[1]%2==1:\r\n most = 1\r\nfor i in range(n):\r\n if num[i]%2 != most:\r\n print(i+1)\r\n break", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\neven = list()\r\nodd = list()\r\nfor i in a:\r\n if i%2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(even) > len(odd):\r\n b = odd[0]\r\n print(a.index(b)+1)\r\nelse:\r\n b = even[0]\r\n print(a.index(b)+1)\r\n\r\n", "input()\r\nlt=[int(i)%2 for i in input().split()]\r\nprint([lt.index(1)+1,lt.index(0)+1][lt.count(0)==1])\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nodd = 0\r\neven = 0\r\nfor i in arr:\r\n if i%2==0:\r\n even = even + 1\r\n else:\r\n odd = odd + 1\r\n\r\nans = 0\r\nif even == 1:\r\n for i in range(0,n):\r\n if arr[i] % 2 == 0:\r\n ans = i\r\n break\r\nelse:\r\n for i in range(0,n):\r\n if arr[i] % 2 != 0:\r\n ans = i\r\n break\r\nprint(ans+1)", "n = int(input())\r\ns = list(map(int, str(input()).split()))\r\nodd = 0\r\neven = 0\r\nfor i in range(3):\r\n if s[i]%2==0: even += 1\r\n else: odd += 1\r\nif odd > even:\r\n findeven = True\r\nelse: findeven = False\r\nfor i in range(len(s)):\r\n if findeven == True:\r\n if s[i]%2==0:\r\n print(i+1)\r\n break\r\n else:\r\n if s[i]%2!= 0:\r\n print(i+1)\r\n break", "n = int(input())\r\narr = [i % 2 for i in map(int, input().split())]\r\nif arr.count(0) == 1:\r\n print(arr.index(0) + 1)\r\nelse:\r\n print(arr.index(1) + 1)", "n = int(input())\r\nlst = input().split()\r\n\r\nodd = 0\r\nfor i in range(3):\r\n if int(lst[i]) % 2 != 0:\r\n odd = odd + 1\r\n pos = i + 1\r\n \r\nif odd > 1:\r\n for i in range(n):\r\n if int(lst[i]) % 2 == 0:\r\n pos = i + 1\r\nelse:\r\n for i in range(n):\r\n if int(lst[i]) % 2 != 0:\r\n pos = i + 1\r\n \r\nprint(pos)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nt = 0\r\nc = 0\r\nfor i in range(3):\r\n if l[i] % 2 == 0:\r\n c += 1\r\n else:\r\n t += 1\r\nif t > c:\r\n f = True\r\nelse:\r\n f = False\r\nfor i in range(n):\r\n if f and l[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n elif not f and l[i] % 2 == 1:\r\n print(i+1)\r\n break\r\n", "n=int(input())\r\nar=[int(x) for x in input().split()]\r\nodd_count=sum(x& 1 for x in ar)\r\nfor i,v in enumerate(ar):\r\n if (odd_count!=1 and ~v & 1) or (odd_count==1 and v&1):\r\n print(i+1)\r\n exit()", "n = int(input())\r\nnums = list(map(int, input().split()))\r\neven = True\r\nc = 0\r\nfor i in range(3):\r\n if nums[i]%2 == 0:\r\n c+=1\r\n\r\nif c >=2:\r\n even = True\r\nelse:\r\n even = False\r\n\r\nif even:\r\n for i in range(len(nums)):\r\n if nums[i]%2:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(nums)):\r\n if not nums[i]%2:\r\n print(i+1)\r\n break\r\n ", "import sys\r\n\r\n# Get Input\r\n#sys.stdin = open(\"input.txt\",\"r\")\r\ninput = sys.stdin.readline\r\n\r\n# Input Functions #\r\ndef inp():\r\n return int(input())\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\ndef insr():\r\n return(input().strip())\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\ndef convert(s):\r\n new = \"\"\r\n for x in s:\r\n new += x\r\n return new\r\n\r\nanswer = 0\r\n\r\n# LOGIC #\r\nn = inp()\r\ndata = inlt()\r\n\r\neven, odd = 0, 0\r\nevenF = 0\r\noddF = 0\r\n\r\nfor d in data:\r\n if d % 2 == 0:\r\n even = even + 1\r\n else:\r\n odd = odd + 1\r\n if even > 1:\r\n break\r\n if odd > 1:\r\n break\r\n\r\nfor i in range(n):\r\n if data[i] % 2 == 0 and odd > 1:\r\n print(i+1)\r\n break\r\n if data[i] % 2 != 0 and even > 1:\r\n print(i+1)\r\n break\r\n", "from collections import Counter\r\n\r\ninput()\r\na = list(map(int, input().split()))\r\nelem = 0 if Counter([a[i] % 2 for i in range(len(a))])[0] == 1 else 1\r\n\r\nfor i in range(len(a)):\r\n if a[i] % 2 == elem:\r\n print(i + 1)\r\n break", "n=int(input())\r\np=[int(i)%2 for i in input().split()]\r\na=p.count(0)\r\nif a>=2:\r\n print(p.index(1)+1)\r\nelse:\r\n print(p.index(0)+1)\r\n \r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nref = []\r\nfor i in arr:\r\n if i%2 == 0: ref.append(0)\r\n else:ref.append(1)\r\nprint(ref.index(ref.count(max(ref)) < ref.count(min(ref)))+1)", "n = int(input())\r\ns = input()\r\nk = list(map(int, s.split()))\r\nk = list(map(lambda x: x%2, k))\r\nprint(k.index(round(1 - (sum(k) / n), 0)) + 1)", "n=int(input())\r\na=[]\r\na=input().split()\r\nfor i in range(0,n):\r\n a[i]=int(a[i])\r\n\r\neven=[]\r\nodd=[]\r\nfor i in range(0,n,1):\r\n if(a[i]%2)==0:\r\n even.append(a[i])\r\n else:\r\n odd.append(a[i])\r\n\r\n\r\ne=len(even)\r\no=len(odd)\r\nif(e==1):\r\n print(a.index(even[0])+1)\r\nelse:\r\n print(a.index(odd[0])+1)\r\n", "n = int(input())\r\na = [int(s) for s in input().split()]\r\nkch = 0\r\nknech = 0\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n kch += 1\r\n else:\r\n knech += 1\r\n\r\n\r\nif kch == 1:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n print(i + 1)\r\n", "input()\nline = input()\ntokens = line.split()\nnums = [int(k)%2 for k in tokens]\nzerocount = 0\nfor k in nums:\n\tif k == 0:\n\t\tzerocount += 1\nif zerocount == 1:\n\tfor i in range(len(nums)):\n\t\tif nums[i] == 0:\n\t\t\tprint(i+1)\nif zerocount > 1:\n\tfor i in range(len(nums)):\n\t\tif nums[i] == 1:\n\t\t\tprint(i+1)\n \t\t \t \t\t \t\t \t \t\t\t \t", "n=input()\r\ns=[int(i) for i in input().split()]\r\njup=[i for i in s if not i%2]\r\ntak=[i for i in s if i%2]\r\nif len(jup)==1:\r\n print(s.index(jup[0])+1)\r\nif len(tak)==1:\r\n print(s.index(tak[0])+1)", "n = int(input())\ndigits = list(map(int, input().split(\" \")))\nf = []\nfor item in digits:\n f.append(item % 2)\n\ncount_of_zero = f.count(0)\ncount_of_one = f.count(1)\nif count_of_one > count_of_zero:\n for i in range(n):\n if f[i] == 0:\n print(i + 1)\nelif count_of_one < count_of_zero:\n for i in range(n):\n if f[i] == 1:\n print(i + 1)\n", "n = int(input().strip())\r\nnums = [int(x) for x in input().split()]\r\n\r\neCtr = 0\r\nfor idx in range(3):\r\n\tif nums[idx] % 2 == 0:\r\n\t\teCtr += 1\r\n\r\ndef firstOdd(nums):\r\n\tfor idx in range(len(nums)):\r\n\t\tif nums[idx] % 2 == 1:\r\n\t\t\treturn idx + 1\r\n\r\ndef firstEven(nums):\r\n\tfor idx in range(len(nums)):\r\n\t\tif nums[idx] % 2 == 0:\r\n\t\t\treturn idx + 1\r\n\r\nif eCtr >= 2:\r\n\tprint(firstOdd(nums))\r\nelse:\r\n\tprint(firstEven(nums))", "n = input()\r\nnumbers = input().split(\" \")\r\n\r\nmatrix = [int(a)%2 for a in numbers]\r\nzeros = [index for index, x in enumerate(matrix) if x == 0]\r\nones = [index for index, x in enumerate(matrix) if x == 1]\r\nif len(ones)< len(zeros):\r\n print(ones[0]+1)\r\nelse:\r\n print(zeros[0]+1)", "n=int(input())\r\nl=input().split()\r\nj=0\r\no=0\r\nfor i in range(n):\r\n if int(l[i])%2==1:\r\n j+=1\r\n else:\r\n o+=1\r\nif o==1:\r\n for i in range(n):\r\n if int(l[i])%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if int(l[i])%2==1:\r\n print(i+1)\r\n break\r\n", "#!/bin/python3\n\nimport sys\n\nint(input())\nseq = [int(i) for i in input().split()]\nodd = sum([1 for a in seq if a%2==1])\neven = sum([1 for a in seq if a%2==0])\n\nfor i in range(len(seq)):\n\tprint(i+1 if ((even == 1 and seq[i]%2==0) or (odd == 1 and seq[i]%2==1)) else '', end='')\n \t \t \t \t\t \t\t\t\t\t \t \t\t\t\t \t \t \t\t", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nif nums[0] % 2 == 0:\r\n if nums[1] % 2 == 0:\r\n evenity = 0\r\n else:\r\n if nums[2] % 2 == 0:\r\n evenity = 0\r\n else:\r\n evenity = 1\r\nelse:\r\n if nums[1] % 2 == 0:\r\n if nums[2] % 2 == 0:\r\n evenity = 0\r\n else:\r\n evenity = 1\r\n else:\r\n evenity = 1\r\n\r\nfor i in range(n):\r\n if nums[i] % 2 != evenity:\r\n print(i + 1)\r\n break", "\nn = int(input())\nnumbers = list(map(int, input().split(' ')))\n\nmemo = {0: 0, 1: 0}\n\n\nfor number in numbers:\n remainder = int(number % 2)\n memo[remainder] += 1\n\nfor index, number in enumerate(numbers, start=1):\n if memo[int(number % 2)] == 1:\n print(index)\n break\n\n\n\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n if k[i]%2==0:\r\n k[i]=0\r\n else:\r\n k[i]=1\r\nif k.count(0)==1:\r\n print(k.index(0)+1)\r\nelif k.count(1)==1:\r\n print(k.index(1)+1)", "#submitted by - Shafin Mahmood\r\n#date - 31-08-2020\r\ntask = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\neven = []\r\nodd = []\r\nfor i in numbers[:3]:\r\n if i % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(even) >= 2:\r\n for i in numbers:\r\n if i % 2 != 0:\r\n print(numbers.index(i)+1)\r\n break\r\nif len(odd) >= 2:\r\n for i in numbers:\r\n if i % 2 == 0:\r\n print(numbers.index(i)+1)\r\n break", "n=int(input())\r\nl = [int(x) for x in input().split()]\r\nc=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n c+=1\r\nif c==1:\r\n for i in range(n):\r\n if l[i] % 2 == 0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if l[i] % 2 != 0:\r\n print(i+1)", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\n\r\ne_count=0\r\no_count=0\r\n\r\nfor i in list1:\r\n if i%2==0:\r\n e_count+=1\r\n else:\r\n o_count+=1\r\n\r\nfor i in range(0,n,1):\r\n if e_count>o_count:\r\n if list1[i]%2!=0:\r\n print(i+1)\r\n else:\r\n if list1[i]%2==0:\r\n print(i+1)", "import sys\r\ninput=sys.stdin.readline\r\na=int(input())\r\nc=list(map(int,input().split(' ')))\r\nb=0\r\nd=[]\r\ne=[]\r\nwhile b<a:\r\n if c[b]%2==0:\r\n d.append(c[b])\r\n if c[b]%2==1:\r\n e.append(c[b])\r\n b=b+1\r\nif len(d)==1:\r\n print(c.index(d[0])+1)\r\nif len(e)==1:\r\n print(c.index(e[0])+1)\r\n", "n = int(input())\nrow = list(map(int, input().split()))\ncountEv = 0\ncountOd = 0\nfor i in range(3):\n if row[i] % 2 == 0:\n countEv += 1\n else:\n countOd += 1\nif countEv > countOd:\n for i in range(n):\n if row[i] % 2 == 1:\n print(i + 1)\nelse:\n for i in range(n):\n if row[i] % 2 == 0:\n print(i + 1)\n", "def solve(m,s):\n even_diff = 0\n even_elem = 0\n odd_diff= 0\n odd_elem = 0\n for i in range(0,m):\n if s[i]%2==0 :\n even_diff = i\n even_elem+=1\n elif s[i]%2!=0 :\n odd_diff = i\n odd_elem+=1\n if even_elem==1 :\n return even_diff+1\n return odd_diff+1\nif __name__ == \"__main__\":\n n = int(input())\n nums = [int(x) for x in input().split()]\n print (solve(n,nums))", "n=int(input())\r\ns=input().split()\r\na=[]\r\nb=[]\r\nfor i in s:\r\n\tif int(i)%2==0:\r\n\t\tb.append('T')\r\n\telse:\r\n\t\tb.append('F')\r\nct=0\r\ncf=0\r\ntr=0\r\nfa=0\r\nfor i in b:\r\n\tif i=='T':\r\n\t\tct=ct+1\r\n\telse:\r\n\t\tcf=cf+1\r\n\tif ct>=2:\r\n\t\tfor i in range(len(b)):\r\n\t\t\tif b[i]=='F':\r\n\t\t\t\tprint(i+1)\r\n\t\t\t\ttr=1\r\n\t\t\t\tbreak\r\n\tif tr==1:\r\n\t\tbreak\r\n\telif cf>=2:\r\n\t\tfor i in range(len(b)):\r\n\t\t\tif b[i]=='T':\r\n\t\t\t\tprint(i+1)\r\n\t\t\t\tfa=1\r\n\t\t\t\tbreak\r\n\tif fa==1:\r\n\t\tbreak\r\n", "n=int(input())\r\na=list(map(int, input().split(' ')))\r\ntemp=[]\r\nfor i in range(n):\r\n temp.append(int(a[i]%2))\r\nif temp[0]+temp[1]+temp[2]<2:\r\n ost=0\r\nelse:\r\n ost=1\r\nfor i in range(n):\r\n if temp[i]!=ost:\r\n v=i+1\r\nprint(v)", "# Details\r\n'''\r\nContest: CodeForces Beta Round # 25 (Div. 2) \r\nProblem: IQ test\r\nRating: 1300\r\nDifficulty: A\r\nAuthor: Sarthak Mittal\r\n'''\r\n\r\n# String to String-List\r\n'''\r\ndef strtolis ():\r\n s = input()\r\n l = []\r\n for i in range (0,len(s)):\r\n l.append(s[i])\r\n return l\r\n'''\r\n\r\n# List Sum\r\n'''\r\ndef arrsum(a,n):\r\n sum = 0\r\n for i in range (0,n):\r\n sum += a[i]\r\n return sum\r\n'''\r\n \r\n# List Printer\r\n'''\r\ndef printer (a,n):\r\n for i in range (0,n):\r\n print(a[i], end = ' ')\r\n print()\r\n'''\r\n\r\n# List Maxima\r\n'''\r\ndef maxima (a,n):\r\n m = 0\r\n for i in range (0,n):\r\n if (a[i] >= a[m]):\r\n m = i\r\n return a[m]\r\n'''\r\n\r\n# List Minima\r\n'''\r\ndef minima (a,n):\r\n m = 0\r\n for i in range (0,n):\r\n if (a[i] <= a[m]):\r\n m = i\r\n return a[m]\r\n'''\r\n\r\n# List Sorter\r\n'''\r\ndef sorter (a):\r\n a.sort()\r\n'''\r\n\r\n# Rhetoric Printer\r\n'''\r\ndef rhetoric (b):\r\n if (b):\r\n print('YES')\r\n else:\r\n print('NO')\r\n'''\r\n\r\n# String to Integer-List\r\ndef arrin ():\r\n return list(map(int,input().strip().split()))\r\n\r\n# Testcases\r\n'''\r\ndef testcases ():\r\n return range(int(input()))\r\n'''\r\n\r\nn = int(input())\r\na = arrin()\r\nodd = 0\r\nfor i in range (n):\r\n a[i] %= 2\r\n if (odd <= 2 and a[i]):\r\n odd += 1\r\nfor i in range (n):\r\n if (odd - 1):\r\n if not a[i]:\r\n print(i + 1)\r\n break\r\n else:\r\n if a[i]:\r\n print(i + 1)\r\n break", "k=int(input())\nl=list(map(int,input().split()))\nc=0\nd=0\nfor i in range(k):\n if l[i]%2==0:\n c+=1\n if c==2:\n break\n if l[i]%2!=0:\n d+=1\n if d==2:\n break\nfor i in range(k):\n if d==2 and l[i]%2==0:\n print(i+1)\n break\n if c==2 and l[i]%2!=0:\n print(i+1)\n break\n", "n = int(input())\r\nnums = list(map(int, input().split(' ')))\r\neven = 0\r\ndictionary = {}\r\nodd = 0\r\nif len(nums) >= 3:\r\n for i in nums[:3]:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if even > odd:\r\n dictionary['res'] = 'odd'\r\n else:\r\n dictionary['res'] = 'even'\r\nelse:\r\n for i in nums[:]:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if even > odd:\r\n dictionary['res'] = 'odd'\r\n else:\r\n dictionary['res'] = 'even'\r\nfor i in nums:\r\n if i % 2 == 0 and dictionary.get('res') == 'even':\r\n print(nums.index(i) + 1)\r\n break\r\n elif i % 2 != 0 and dictionary.get('res') == 'odd':\r\n print(nums.index(i) + 1)\r\n break\r\n", "input()\r\neven, odd = int(0), int(0)\r\nido = 0\r\nide = 0\r\na = []\r\na = [int(i) for i in input().split()]\r\nfor j, i in enumerate(a):\r\n if i % 2 == 1:\r\n odd += 1\r\n ido = j\r\n else:\r\n ide = j\r\n even += 1\r\n\r\nif odd > even:\r\n print(ide + 1)\r\nelse:\r\n print(ido + 1)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [i % 2 for i in a]\r\nzeros = b.count(0)\r\nones = n - zeros\r\nif zeros == 1:\r\n print(b.index(0) + 1)\r\nelse:\r\n print(b.index(1) + 1)", "n = int(input())\r\na1 = []\r\nb1 = []\r\nc = list(map(int, input().split()))\r\nfor elem in c:\r\n if elem % 2 == 0:\r\n a1.append(elem)\r\n else:\r\n b1.append(elem)\r\nif len(a1) > 1:\r\n print(c.index(*b1) + 1)\r\nelse:\r\n print(c.index(*a1) + 1)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ne=0\r\ne1=[]\r\no=0\r\no1=[]\r\nfor i in lst:\r\n if i%2==0:\r\n e+=1\r\n e1.append(i)\r\n else:\r\n o+=1\r\n o1.append(i)\r\nif e<o:\r\n print(lst.index(*e1)+1)\r\nelse:\r\n print(lst.index(*o1)+1)", "from collections import defaultdict\r\n\r\n\r\ndef different(nums):\r\n length = len(nums)\r\n check = False\r\n factor = 1\r\n while not check:\r\n factor *= 2\r\n dic = defaultdict(list)\r\n for i in range(length):\r\n num = nums[i]\r\n dic[num % factor].append(i + 1)\r\n if len(dic) > 1:\r\n for key in dic:\r\n if len(dic.get(key)) == 1:\r\n return dic.get(key)[0]\r\n\r\n\r\nsize = int(input())\r\nnums = list(map(int, input().split(\" \")))\r\nprint(different(nums))\r\n", "poop = int(input())\r\na = [int(x) for x in input().split()]\r\nl,l1 = [],[]\r\nfor i in a:\r\n if i % 2 != 0:\r\n l.append(i)\r\n else:\r\n l1.append(i)\r\nprint(a.index(l[0])+1 if len(l) == 1 else a.index(l1[0])+1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nnumber_even = 0\r\nnumber_odd = 0\r\nposition_even = 0\r\nposition_odd = 0\r\n\r\nfor i in range(n):\r\n if a[i]%2 == 0:\r\n number_even += 1\r\n position_even = i+1\r\n else:\r\n number_odd += 1\r\n position_odd = i+1\r\n \r\nif number_even == 1:\r\n print(position_even)\r\nelse:\r\n print(position_odd)\r\n", "s = int(input())\nnumbers = list(map(int, input().split()))\nd = []\nc = []\nfor i in range(s):\n if numbers[i] % 2 == 0:\n d.append(i + 1)\n else:\n c.append(i + 1)\nif len(d) > len(c):\n print(c[0])\nelse:\n print(d[0])\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(n-2):\r\n if a[i]%2!=a[i+1]%2:\r\n if a[i]%2==a[i+2]%2:\r\n print(i+2)\r\n exit()\r\n else:\r\n print(i+1)\r\n exit()\r\nprint(n)\r\n", "total=int(input())\r\nnumbers=input().split()\r\nOddCount=0\r\nEvenCount=0\r\nOddIndex=0\r\nEvenIndex=0\r\n\r\nfor i in range (0,total):\r\n if int(numbers[i])%2==0:\r\n EvenCount+=1\r\n EvenIndex=i\r\n else:\r\n OddCount+=1\r\n OddIndex=i\r\nif EvenCount==1:\r\n print(EvenIndex+1)\r\nelse:\r\n print(OddIndex+1)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = 0\r\nd = 0\r\nfor i in b:\r\n if (i%2!=0):\r\n c+=1\r\n else:\r\n d+=1\r\ne = 0\r\nfor j in b:\r\n if (c>d):\r\n if (j%2==0):\r\n break\r\n else:\r\n e+=1\r\n else:\r\n if (j%2!=0):\r\n break\r\n else:\r\n e+=1\r\nprint(e+1)\r\n", "n=int(input())\r\na=map(int,input().split())\r\na=[i%2 for i in a]\r\nif sum(a)>1:\r\n print(a.index(0)+1)\r\nelse:\r\n print(a.index(1)+1)", "a=int(input())\r\nlis =list(map(int,input().split()))\r\nd1=[]\r\nd2=[]\r\ncod1=0\r\ncod2=0\r\nfor i in range(a):\r\n if lis[i]%2==0:\r\n cod1+=1\r\n d1.append(i+1)\r\n else:\r\n cod2+=1\r\n d2.append(i+1)\r\nif cod1==1:\r\n print(d1[0])\r\nelse:\r\n print(d2[0])\r\n ", "n = int(input())\r\na = list(map(int,input().split()[:n]))\r\nc_even = 0\r\nc_odd = 0\r\nind = 0\r\nfor i in a:\r\n if(i % 2==0):\r\n c_even += 1\r\n else:\r\n c_odd += 1\r\nfor i in range(len(a)):\r\n if(c_even == 1 and a[i] % 2 == 0):\r\n ind = i\r\n break\r\n elif(c_odd == 1 and a[i] % 2 != 0):\r\n ind = i\r\n break\r\nprint(ind+1)\r\n \r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n a = l[i]%2\r\n b = l[(i+1) % n] % 2\r\n c = l[(i-1) % n] % 2 \r\n if(a!=b) and a!=c:\r\n print(i+1)\r\n break", "n=int(input())\r\nl=[int(x)%2 for x in input().split()]\r\nif l.count(1)==1:\r\n print(l.index(1)+1)\r\nelse:print(l.index(0)+1)\r\n", "input_no = input()\r\nno = input()\r\nlists = no.split()\r\nnos = []\r\nfor i in lists:\r\n nos.append(int(i))\r\nevenness = 0\r\nfor e in nos[:3]:\r\n if e % 2 == 0:\r\n evenness += 1\r\n else:\r\n evenness -= 1\r\nif evenness > 0:\r\n detmn = 1\r\nelse:\r\n detmn = 0\r\nfor c in nos:\r\n if c % 2 == detmn:\r\n print(nos.index(c) + 1)\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\ncnt0=0\r\ncnt1=0\r\npos1=-1\r\npos0=-1\r\nfor i in range (len(a)):\r\n if (a[i]%2==0):\r\n cnt0+=1\r\n pos0=i+1\r\n elif (a[i]%2==1):\r\n cnt1+=1\r\n pos1=i+1\r\nif cnt1==1:\r\n print(pos1)\r\nelse:\r\n print(pos0)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\na=b=0\r\nfor i in range(n):\r\n\tif arr[i]&1==0:\r\n\t\ta+=1\r\n\telse:\r\n\t\tb+=1\r\n\r\nif a==1:\r\n\tfor i in range(n):\r\n\t\tif arr[i]&1==0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif arr[i]&1!=0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\r\n\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\na = None\r\nb = None\r\nfor i in m:\r\n\tif i % 2 == 0:\r\n\t\teven += 1\r\n\t\ta = i\r\n\telse:\r\n\t\todd += 1\r\n\t\tb = i\r\nif even > odd:\r\n\tprint(m.index(b) + 1)\r\nelse:\r\n\tprint(m.index(a) + 1)\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\nlastOdd, lastEven = 0, 0\noddCount, evenCount = 0, 0\n\nfor i in range(n):\n if arr[i] % 2 == 0:\n lastEven = i\n evenCount += 1\n else:\n lastOdd = i\n oddCount += 1\nif evenCount == 1:\n print(lastEven + 1)\nelse:\n print(lastOdd + 1)\n", "n=int(input())\nt=[int(i)%2 for i in input().split()]\nif sum(t)==1:\n print(t.index(1)+1)\nelse:\n print(t.index(0)+1)\n\t \t\t \t\t\t\t\t \t \t \t\t \t\t \t\t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\ne,o=0,0\r\nfor i in a:\r\n if i%2==0:\r\n e+=1\r\n b.append(0)\r\n else:\r\n o+=1\r\n b.append(1)\r\nif e==1:\r\n print(b.index(0)+1)\r\nif o==1:\r\n print(b.index(1)+1)", "def solution():\r\n number_count = int(input())\r\n counters, indices = [0, 0], [0, 0]\r\n\r\n numbers = [int(x) for x in input().split()]\r\n for number_index, number in enumerate(numbers):\r\n index = number % 2\r\n counters[index] += 1\r\n if counters[index] == 1:\r\n indices[index] = number_index + 1\r\n\r\n if counters[index] > 1 and counters[1 - index] == 1:\r\n print(indices[1 - index])\r\n break\r\n\r\n if counters[index] == 1 and counters[1 - index] > 1:\r\n print(indices[index])\r\n break\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "n=int(input(' '))\r\nflag=0\r\ns=0\r\nl=list(map(int, input().split()))\r\na=l[0]\r\nb=l[-1]\r\nc=l[int(n/2)]\r\nif(a%2)!=0:\r\n s=s+1\r\nif(b%2)!=0:\r\n s=s+1\r\n\r\nif(c%2)!=0:\r\n s=s+1\r\n\r\nif(s>=2):\r\n flag=1\r\n\r\nif(flag==0):\r\n for i in range(n):\r\n if(l[i]%2!=0):\r\n break\r\nelse:\r\n for i in range(n):\r\n if(l[i]%2==0):\r\n break\r\n\r\nprint(i+1)", "input()\r\nl = [int(x) % 2 for x in input().split()]\r\nprint(l.index(l.count(1) == 1) + 1)\r\n", "a = int(input())\r\nch = 0\r\nnech = 0\r\ns = list(map(int, input().split()))\r\nfor i in s:\r\n if i % 2 == 0:\r\n ch += 1\r\n else:\r\n nech += 1\r\nif nech == 1:\r\n for j in range(len(s)):\r\n if s[j] % 2 != 0:\r\n print(j + 1)\r\nelse:\r\n for k in range(len(s)):\r\n if s[k] % 2 == 0:\r\n print(k + 1)", "\r\nn = int(input())\r\neven = 0\r\neven_id = 0\r\nodd = 0\r\nodd_id = 0\r\nfound = 0#1-odd,2-even\r\n\r\nnums = list(map(int,(input().split())))\r\n\r\nfor i,num in enumerate(nums):\r\n if found:\r\n continue\r\n if num % 2:\r\n if odd == 0:\r\n odd_id = i + 1\r\n odd += 1\r\n else:\r\n if even == 0:\r\n even_id = i + 1\r\n even += 1\r\n if even > 1 and odd == 1:\r\n found = 1\r\n elif odd > 1 and even == 1:\r\n found = 2\r\nif found == 1:\r\n print(odd_id)\r\nelif found == 2:\r\n print(even_id)\r\nelse:\r\n print(\"error\")", "test_num = int(input())\nline = [int(j) % 2 for j in input().split()]\nif line.count(1) == 1:\n print(line.index(1)+1)\nelse:\n print(line.index(0)+1)", "\r\nn = int(input())\r\ninp = input().split(' ')\r\n\r\neven = []\r\nodd = []\r\n\r\nfor i in inp:\r\n\tif int(i) % 2 == 0:\r\n\t\teven.append(int(i))\r\n\telse:\r\n\t\todd.append(int(i))\r\n\r\nif len(even) > len(odd):\r\n\tprint(inp.index(str(odd[0])) + 1)\r\nelse:\r\n\tprint(inp.index(str(even[0])) + 1)", "n=int(input())\nnlist=[int(i) for i in input().split()]\nji=0\nou=0\na=[]\nb=[]\nfor i in range(n):\n if nlist[i]%2==1:\n ji+=1\n a.append(i+1)\n elif nlist[i]%2==0:\n ou+=1\n b.append(i+1)\n\nif ji>ou:\n print(\"\".join([str(i) for i in b]))\nelif ji<ou:\n print(\"\".join([str(i) for i in a]))\n \n\n\n\n \n", "cisel = int(input())\ncisla = list(map(int, input().split()))\n\nparnych, neparnych = 0, 0\nparne, neparne = None, None\nfor i, cislo in enumerate(cisla):\n if cislo % 2:\n neparnych += 1\n neparne = i + 1\n else:\n parnych += 1\n parne = i + 1\n\n if parnych > 1 and neparne is not None:\n print(neparne)\n break\n elif neparnych > 1 and parne is not None:\n print(parne)\n break\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nk = ''\r\nfor i in s:\r\n if i % 2 == 0:\r\n k += '1'\r\n else:\r\n k += '0'\r\nif k.count('1') == 1:\r\n print(k.index('1') + 1)\r\nelse:\r\n print(k.index('0') + 1)", "n=int(input())\r\nlis=list(map(int,input().strip().split()))\r\nof=0\r\nef=0\r\ni=0\r\ntemp1=0\r\ntemp2=0\r\nwhile i<len(lis):\r\n if lis[i]%2==0 and ef==0:\r\n temp1=i+1\r\n ef=ef+1\r\n elif lis[i]%2==1 and of == 0:\r\n temp2=i+1\r\n of=of+1\r\n elif lis[i]%2==1:\r\n of+=1\r\n elif lis[i]%2==0:\r\n ef+=1\r\n i+=1\r\nif of>ef:\r\n print(temp1)\r\nelse:\r\n print(temp2)\r\n", "#! /usr/bin/env python3\n\n# Headers\nimport os\n\n# Function to find the odd number in the provided list and fetch the position\ndef IQTest(a,b):\n\tnumA = a\n\tnumB = b\n\n\t# Lists\n\te,o = [],[]\n\t# Reading the list of B\n\tfor x in numB:\n\t\tif int(x) % 2 == 0:\n\t\t\te.append(x)\n\t\telse:\n\t\t\to.append(x)\n\n\t# Finding the position\n\tif len(e) == 1:\n\t\tgetPos = numB.index(''.join(e))\n\telif len(o) == 1:\n\t\tgetPos = numB.index(''.join(o))\n\telse:\n\t\tgetPos = '0'\n\treturn int(getPos)+1\n\n# Inputs\na = int(input())\nb = (input().split(' '))\n\n# Call Function\nprint(IQTest(a,b))\n", "import sys\r\nn = int(input())\r\nx = [int(i) for i in sys.stdin.readline().split()]\r\nl=-1;a=0;b=0;resa=0;resb=0\r\nwhile n > 0:\r\n n-=1;l+=1;x1=x[l]\r\n if x1%2 == 0:\r\n a+=1;resa = l\r\n else:\r\n b+=1;resb = l\r\nif a > 1:\r\n print(resb+1)\r\nelse:\r\n print(resa+1)\r\n\r\n\r\n", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ndef f(x):\r\n b=x%2\r\n return b\r\na=list(map(f,a))\r\njud=0\r\nfor i in range(1,len(a)-1):\r\n if a[i]!=a[i-1] and a[i]!=a[i+1]:\r\n print(i+1)\r\n jud=1\r\nif jud==0:\r\n if a[0]!=a[1]:\r\n print('1')\r\n else:\r\n print(len(a))\r\n", "n = int(input())\r\na = list(map(lambda x: int(x) % 2, input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] == 0:\r\n count += 1\r\nif count > 1:\r\n for i in range(n):\r\n if a[i] == 1:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i] == 0:\r\n print(i + 1)\r\n break", "a = int(input())\r\nj = 0\r\nd = 0\r\nb = input()\r\nc = list(map(int, b.split()))\r\nfor i in range(a):\r\n if c[i] % 2 == 0:\r\n d = d + 1\r\nif d > 1:\r\n while(c[j] % 2 != 1):\r\n j = j + 1\r\nelse:\r\n while(c[j] % 2 != 0):\r\n j = j + 1\r\nprint(j + 1)", "def main():\n p = int(input())\n arr = list(map(int, input().split()))\n\n oddArr = []\n evenArr = []\n for i in range(0, len(arr)):\n if arr[i] % 2 == 0:\n evenArr.append(i)\n else:\n oddArr.append(i)\n\n if len(evenArr) < len(oddArr):\n print(evenArr[0] + 1)\n else:\n print(oddArr[0] + 1)\n\n\nmain()\n", "n=int(input())\r\na=[int(i) for i in input().split(' ')]\r\nif a[0]%2==a[1]%2:\r\n b=a[0]%2\r\nelif a[0]%2==a[2]%2:\r\n b=a[0]%2\r\nelse:\r\n b=a[1]%2\r\ni=0\r\nwhile i<n:\r\n if a[i]%2==b:\r\n i=i+1\r\n else:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in a if x % 2 == 0]\r\nc = [int(x) for x in a if x % 2 == 1]\r\nif len(b) == 1:\r\n print(a.index(b[0]) + 1)\r\nelse:\r\n print(a.index(c[0]) + 1)", "n = int(input())\r\na = list(map(int, input().split()[:n]))\r\nnechet = 0\r\nchet = 0\r\nnumber = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n chet += 1\r\n else:\r\n nechet += 1\r\nif chet == 1:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n number = i + 1\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n number = i + 1\r\nprint(number)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nif arr[0] % 2 == arr[1] % 2:\r\n target = (arr[0]%2+1)%2\r\nelse:\r\n if arr[1] % 2 == arr[2] % 2:\r\n target = arr[0] % 2\r\n else:\r\n target = arr[1] % 2\r\nfor i, c in enumerate(arr):\r\n if c % 2 == target:\r\n print(i+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nb=0\r\nx=0\r\ny=0\r\nfor i in range(0,n):\r\n if(a[i]%2==0):\r\n c+=1\r\n x=i\r\n else:\r\n b+=1\r\n y=i\r\nif(c==1):\r\n print(x+1)\r\nif(b==1):\r\n print(y+1)\r\n", "n=int(input())\r\ndata=[int(i)%2 for i in input().split()]\r\nif data.count(0)>1:\r\n print(data.index(1)+1)\r\nelse:\r\n print(data.index(0)+1)", "n=int(input())\r\ni1,i2,ind1,ind2=0,0,0,0\r\na=[int(n) for n in input().split(\" \")]\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n i1=i1+1\r\n ind1=i\r\n else:\r\n i2=i2+1\r\n ind2=i\r\nif i1==1:\r\n print(ind1+1)\r\nelse:\r\n print(ind2+1)\r\n", "k = int(input())\r\narr = [int(y) for y in input().split()]\r\n\r\nodd_count = sum(y & 1 for y in arr)\r\nfor i, v in enumerate(arr):\r\n if (odd_count != 1 and ~v & 1) or (odd_count == 1 and v & 1):\r\n print(i + 1)\r\n exit()", "ce=0\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i%2==0:ce+=1\r\nco=len(l)-ce\r\nif ce==1:\r\n for i in range(0,len(l)):\r\n if l[i]%2==0:print(i+1)\r\nelif co==1:\r\n for i in range(0,len(l)):\r\n if l[i]%2!=0:print(i+1)", "n=int(input())\r\narr=list(map(int, input().split()))\r\n\r\neven_count=0\r\nodd_count=0\r\neven_index=0\r\nodd_index=0\r\n\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n even_count+=1\r\n even_index=i+1\r\n else:\r\n odd_count+=1\r\n odd_index=i+1\r\n\r\nif even_count==1:\r\n print(even_index)\r\nelse:\r\n print(odd_index)\r\n", "int(input())\r\na = list(map(lambda i: int(i) % 2, input().split()))\r\nif a.count(0) == 1:\r\n print(a.index(0) + 1)\r\nelse:\r\n print(a.index(1) + 1)", "n=int(input())\r\ns=input().split()\r\nch=[]\r\nn=[]\r\ntekch=0\r\ntekn=0\r\nfor i in range(len(s)):\r\n if int(s[i])%2==0:\r\n ch.append(int(s[i]))\r\n tekch=i+1\r\n else:\r\n n.append(int(s[i]))\r\n tekn=i+1\r\nif len(n)<len(ch):\r\n print(tekn)\r\nelse:\r\n print(tekch)\r\n", "n = input()\nnumbers = input()\nlist_numbers = numbers.split()\ncontador = 0\nfor i in list_numbers:\n i = int(i)\n if i % 2 == 0:\n contador +=1\n answer_even = i\n else:\n answer_odd = i\n contador -=1\nif contador > 0:\n answer = answer_odd\nelse:\n answer = answer_even\nj = 1\nfor numero in list_numbers:\n if numero == str(answer):\n print(j)\n break\n j += 1", "n = int(input())\r\ns = list(map(int,input().split()))\r\n\r\nc = []\r\nv = []\r\n\r\nfor i in range(n):\r\n \r\n if s[i]%2 == 0:\r\n c += [i+1]\r\n \r\n else:\r\n v += [i+1]\r\n \r\n\r\nif len(c) == 1:\r\n print(c[0])\r\n \r\nelse:\r\n print(v[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\nc1,c2=0,0\r\nfor i in range(n):\r\n\tif(a[i]%2==0):\r\n\t\tc1+=1\r\n\t\te=i\r\n\t\tcontinue\r\n\tif(a[i]%2!=0):\r\n\t\tc2+=1\r\n\t\to=i\r\nif c1>c2:\r\n\tprint(o+1)\r\nelse:\r\n\tprint(e+1)", "input()\r\nl=[int(x)%2 for x in input().split()]\r\nprint(l.index(sum(l)==1)+1)\r\n", "def evenness(l):\r\n for i in range(len(l)):\r\n l[i]=l[i]%2\r\n d={}\r\n for i in l:\r\n if i in d.keys():\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n for key,value in d.items():\r\n if value==1:\r\n return l.index(key)+1\r\nn = input()\r\nl = list(map(int, input().split()))\r\nprint(evenness(l))", "x = eval(input())\r\nn = list(map(int,input().split()))\r\ni = 0\r\nce = 0\r\nco = 0\r\nif x>=3 and x<=100 :\r\n while i<x :\r\n if n[i]%2==0 :\r\n ce += 1\r\n else :\r\n co += 1\r\n i += 1\r\ni=0 \r\nif ce>co :\r\n while i<x:\r\n if n[i]%2==1:\r\n i+=1\r\n print(i)\r\n i+=1 \r\nelse :\r\n while i<x:\r\n if n[i]%2==0:\r\n i+=1\r\n print(i)\r\n i+=1 ", "n=int(input())\r\nL=[int(x) for x in input().split()]\r\no_count=e_count=0\r\nfor i in range(len(L)):\r\n\tif(L[i]%2==0):\r\n\t\te_count+=1\r\n\telse:\r\n\t\to_count+=1\r\nif(e_count==1):\r\n\tfor i in range(n):\r\n\t\tif(L[i]%2==0):\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif(L[i]%2!=0):\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\ncount_odd, count_even = 0, 0\r\nfor i in range(3):\r\n if data[i] % 2:\r\n count_odd += 1\r\n else:\r\n count_even += 1\r\n\r\neven = 0\r\nif count_odd < count_even:\r\n even = 1\r\n\r\nfor i in range(n):\r\n if data[i] % 2 == even:\r\n print(i + 1)\r\n break\r\n", "n=input()\r\na=[int(i) for i in input().split()]\r\ne=0;o=0\r\nfor i in a:\r\n if i%2==0:\r\n e+=1\r\n if e==2:\r\n op=\"od\"\r\n break\r\n else:\r\n o+=1\r\n if o==2:\r\n op=\"ev\"\r\n break\r\nif op==\"ev\":\r\n for i in range(len(a)):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]%2==1:\r\n print(i+1)\r\n break", "n = input()\n\nl = list(map(int, input().split()))\neven = 0\nevenIndex = 0\nodd = 0\noddIndex = 0\nfor i in range(len(l)):\n if l[i] % 2 == 0:\n even += 1\n evenIndex = i + 1\n else:\n odd += 1\n oddIndex = i + 1\n\nif even == 1:\n print(evenIndex)\nelse:\n print(oddIndex)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne,o=0,0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n e=e+1\r\n x=i\r\n else:\r\n o=o+1\r\n y=i\r\nif(e==1):\r\n print(x+1)\r\nelse:\r\n print(y+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=0\r\nfor x in range(3):\r\n if a[x]%2==0:\r\n b+=1\r\nif b>1:\r\n for x in a:\r\n if x%2!=0:\r\n print(a.index(x)+1)\r\nelse:\r\n for x in a:\r\n if x%2==0:\r\n print(a.index(x)+1)", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\neven,odd=0,0\r\nfor i in range(n):\r\n if(list[i]%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\nif(even>odd):\r\n for i in range(n):\r\n if(list[i]%2==1):\r\n print(i+1)\r\n exit()\r\nelse:\r\n for i in range(n):\r\n if(list[i]%2==0):\r\n print(i+1)\r\n exit()", "n = input()\r\nl = list(map(int, input().split()))\r\n\r\nsize = len(l)\r\neven = len([x for x in l if x % 2 == 0])\r\n \r\n# print(even)\r\n\r\nx = -1\r\nif even == 1:\r\n x = 0\r\nelse:\r\n x = 1\r\n\r\nidx = [i for i, a in enumerate(l,1) if a % 2 == x]\r\n\r\nprint(*idx)", "z = (int(input()))\nli = list(map(int,input().split()))\ncount = 0\nrnd = 0\nfor i in range(z):\n if li[i] % 2 == 0:\n count += 1\n z = i + 1\n else:\n rnd+=1\n k = i + 1\nif (rnd > count):\n print(z)\nelse:\n print(k)\n\n \t \t \t \t\t\t \t\t \t \t \t\t\t \t\t", "_ = input()\r\ninp = list(map(int, input().split()))\r\neCount = 0\r\noCount = 0\r\nlastE = -1\r\nlastO = -1\r\nfor x in range(len(inp)):\r\n\tif inp[x]%2 == 0:\r\n\t\teCount += 1\r\n\t\tlastE = x+1\r\n\telse:\r\n\t\toCount += 1\r\n\t\tlastO = x+1\r\n\tif (eCount >= 2 or oCount >=2) and (lastO != -1 and lastE != -1):\r\n\t\tbreak\r\nprint(lastO if eCount>oCount else lastE)", "n = int(input())\r\nd = []\r\nch = 0\r\nnch = 0\r\nf = list(map(int, input().split()))\r\n\r\nfor i in range(len(f)):\r\n if f[i] % 2 == 0:\r\n d.append(0)\r\n ch += 1\r\n else:\r\n d.append(1)\r\n nch += 1\r\n\r\nif ch > nch:\r\n print(d.index(1) + 1)\r\nelse:\r\n print(d.index(0) + 1)\r\n", "def main():\r\n n = int(input())\r\n sequence = [int(i) for i in input().split()]\r\n print(solution(n, sequence))\r\n\r\ndef solution(n, sequence):\r\n remove_even = False\r\n remove_odd = False\r\n last_even_index = -1\r\n last_odd_index = -1\r\n\r\n for i in range(n):\r\n # assign pointers\r\n if sequence[i] % 2 == 0: \r\n # if already been set\r\n if last_even_index != -1:\r\n remove_odd = True\r\n if last_odd_index != -1:\r\n return last_odd_index + 1\r\n last_even_index = i\r\n if remove_even:\r\n return i + 1 # indexed from 1\r\n \r\n else:\r\n # if already been set\r\n if last_odd_index != -1:\r\n remove_even = True\r\n if last_even_index != -1:\r\n return last_even_index + 1\r\n last_odd_index = i\r\n if remove_odd:\r\n return i + 1 # indexed from 1\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input());\r\nseq = [int(x) for x in input().split()];\r\n\r\ncontador_par = 0;\r\nindex_par = 0;\r\nindex_impar = 0;\r\n\r\nfor i in range(n):\r\n\tif (seq[i] % 2 == 0):\r\n\t\tcontador_par += 1;\r\n\t\tindex_par = i;\r\n\telse:\r\n\t\tcontador_par -= 1;\r\n\t\tindex_impar = i;\r\n\r\nprint (index_impar + 1 if contador_par > 0 else index_par + 1);", "n = int(input())\r\nx = input()\r\nx = x.split()\r\ns = int(x[0]) % 2\r\nss = int(x[1]) % 2\r\nsss = int(x[2]) % 2\r\ni = 1\r\nif s == ss:\r\n while int(x[i]) % 2 == s:\r\n i += 1\r\n print(i + 1)\r\nelse:\r\n if s == sss:\r\n print(2)\r\n if ss == sss:\r\n print(1)\r\n", "input()\r\nk = [int(t) % 2 for t in input().split()]\r\nprint(k.index(1 - (sum(k) > 1)) + 1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\noddCount, evenCount = 0, 0\r\n\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n evenCount += 1\r\n evenLast = i + 1\r\n else:\r\n oddCount += 1\r\n oddLast = i + 1\r\n\r\nif oddCount == 1:\r\n print(oddLast)\r\nelse:\r\n print(evenLast)\r\n", "def fun():\r\n m=int(input())\r\n arr = input(\"\")\r\n num = [int(n) for n in arr.split()]\r\n for i in range (0,len(num)):\r\n num[i]=num[i]%2\r\n s=num.count(0)\r\n t=num.count(1)\r\n if s==1:\r\n for i in range (0,len(num)):\r\n if num[i]==0:\r\n print(i+1)\r\n if t==1:\r\n for i in range (0,len(num)):\r\n if num[i]==1:\r\n print(i+1)\r\nfun()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=input()\r\nb=[int(e) for e in input().split()]\r\nchet=[]\r\nnechet=[]\r\nfor i in range(len(b)):\r\n if b[i]%2==0:\r\n chet.append(i+1)\r\n else:\r\n nechet.append(i+1)\r\nif len(nechet) > len(chet):\r\n print(chet[0])\r\nelse:\r\n print(nechet[0])\r\n", "n = int(input())\r\nall = list(map(int, input().split()))\r\neven = []\r\nodd = []\r\nfor i in range(n) :\r\n if all[i] % 2 == 0:\r\n even.append(i+1)\r\n else :\r\n odd.append(i+1)\r\nprint(even[0] if len(even) == 1 else odd[0])", "n,l=(int(input()),[int(i) for i in input().split()])\r\ng=[]\r\nfor i in range(n):\r\n g.append(l[i]%2)\r\nif g.count(0) >1:\r\n print(g.index(1) + 1)\r\nelse:\r\n print(g.index(0) + 1)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\ncountch = 0\r\nindch = -1\r\ncountnch = 0\r\nindnch = -1\r\n\r\nfor i in range(n):\r\n if a[i]%2== 0:\r\n countch+=1\r\n indch = i\r\n else:\r\n countnch +=1\r\n indnch = i\r\n\r\nif countch > countnch:\r\n print(indnch + 1)\r\nelse:\r\n print(indch + 1)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nct1=0\r\nct2=0\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n if(s[i]%2==0):\r\n ct1+=1 \r\n x=i+1\r\n else:\r\n ct2+=1 \r\n y=i+1 \r\n if(ct1>1 and ct2==1):\r\n print(y)\r\n break \r\n elif(ct2>1 and ct1==1):\r\n print(x)\r\n break", "n = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\n\r\neven = True if sum(x % 2 == 0 for x in numbers) == 1 else False\r\nindex = numbers.index(next(filter(lambda x: x % 2 == 0 if even else x % 2 == 1, numbers)))\r\n\r\nprint(index + 1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc1=0\r\nc0=0\r\nfor i in range(n):\r\n a[i]=a[i]%2\r\n if a[i]==1:\r\n c1=c1+1\r\n else:\r\n c0=c0+1\r\nif c0>c1:\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)\r\n", "n = int(input())\r\ndata = list(map(int,input().split()))\r\n\r\neven = 0\r\nodd = 0\r\npos_e = 0\r\npos_o = 0\r\n\r\n\r\nfor i in range (n):\r\n if data[i] % 2 == 0:\r\n even += 1\r\n pos_e = i+1\r\n else:\r\n odd += 1\r\n pos_o = i+1\r\n\r\nif odd == 1:\r\n print(pos_o)\r\nelse:\r\n print(pos_e)", "input()\r\nn = [int(i) for i in input().split()]\r\nodd = 0\r\neven = 0\r\noddind = 0\r\nevenind = 0\r\n\r\nfor v in range(len(n)):\r\n if n[v] % 2 == 0:\r\n even += 1\r\n if even == 1:\r\n evenind = v\r\n\r\n else:\r\n odd += 1\r\n if odd == 1:\r\n oddind = v\r\n\r\nif even > odd:\r\n print(oddind + 1)\r\nelse:\r\n print(evenind + 1)", "L=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nA=list(map(lambda x : x%2==0 , A))\r\n\r\nif(A.count(True)==1):\r\n print(A.index(True)+1)\r\nelse:\r\n print(A.index(False)+1)\r\n", "n=input()\r\nd=list(map(lambda x:int(x)%2,input().split()))\r\nprint(d.index(int(d.count(1)==1))+1)\r\n", "n = int(input())\r\ns = input().split()\r\neven, odd, even_index, odd_index = 0, 0, 0, 0\r\nfor i in range(n):\r\n if int(s[i]) % 2 == 0:\r\n even += 1\r\n even_index = i\r\n else:\r\n odd += 1\r\n odd_index = i\r\nif even == 1:\r\n print(even_index+1)\r\nelse: print(odd_index+1)", "a=int(input())\r\nb=input().split()\r\nc=sum(int(b[x])%2 for x in range(a))\r\nif c==1:\r\n print(sum(i+1 for i in range(a) if int(b[i])%2==1))\r\nelse:\r\n print(sum(i+1 for i in range(a) if int(b[i])%2==0))\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ncount_even=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n count_even+=1\r\ntemp=0\r\nif(count_even>1):\r\n temp=1\r\nfor i in range(n):\r\n if(a[i]%2==temp):\r\n print(i+1)\r\n break\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nce=0\r\nco=0\r\nfor i in range(n):\r\n if ((l[i]%2)==0):\r\n ce=ce+1\r\n else:\r\n co=co+1\r\nif ce==1:\r\n for i in range(n):\r\n if ((l[i]%2)==0):\r\n print(i+1)\r\nelif co==1:\r\n for i in range(n):\r\n if ((l[i]%2)!=0):\r\n print(i+1)", "n=int(input())\r\narr=list(map(int,input().split(\" \")))\r\nk=arr[0]%2+arr[1]%2+arr[2]%2\r\nif k>=2:\r\n r=1\r\nelse:\r\n r=0\r\nfor i in range(n):\r\n if arr[i]%2!=r:\r\n ans=i+1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n", "n = int(input())\r\ns = input().split()\r\na = 0\r\nb = 0\r\nfor i in range(len(s)):\r\n if int(s[i]) % 2 == 0:\r\n a = a + 1\r\n if int(s[i]) % 2 == 1:\r\n b = b + 1\r\nif a == 1:\r\n for i in range(len(s)):\r\n if int(s[i]) % 2 == 0:\r\n print(i+1)\r\nif b == 1:\r\n for i in range(len(s)):\r\n if int(s[i]) % 2 == 1:\r\n print(i+1)", "i = int(input())\r\nnums = input().split()\r\neven=0\r\nodd=0\r\nfor i in nums:\r\n i=int(i)\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n \r\n \r\nif even>=2:\r\n for a in range(len(nums)):\r\n \r\n if (int(nums[a]))%2!=0:\r\n print(a+1)\r\nelif odd>=2:\r\n for a in range(len(nums)):\r\n \r\n if (int(nums[a]))%2==0:\r\n print(a+1)\r\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\nfor i in range(n):\r\n if even == 2 or odd==2:\r\n break\r\n if lst[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif odd == 2:\r\n for i in range(n):\r\n if lst[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if lst[i]%2!=0:\r\n print(i+1)\r\n break", "n = int(input())\r\nnums = input()\r\nlst = nums.split()\r\nfor i in range(n):\r\n lst[i] = int(lst[i])\r\n lst[i] = lst[i]%2\r\nif sum(lst) == 1:\r\n ind = lst.index(1)\r\nelif sum(lst) > 1:\r\n ind = lst.index(0)\r\nprint(ind+1)\r\n\r\n\r\n \r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nb=[i%2 for i in k]\r\nif sum(b)==1:\r\n print(b.index(1)+1)\r\nelse:\r\n print(b.index(0)+1)\r\n", "input()\r\nl=list(map(int,input().split()))\r\nd={0:0,1:0}\r\nfor i in l:\r\n if i&1:\r\n d[1]+=1\r\n else:\r\n d[0]+=1\r\nif d[0]==1:\r\n for i in range(len(l)):\r\n if l[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(l)):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n ", "n=input()\r\nl=list(map(int,input().split()))\r\nevc=0;odc=0;odp=0;evp=0\r\nfor i in range (len(l)) :\r\n if l[i]%2 :\r\n odc+=1\r\n odp=i\r\n else :\r\n evc+=1\r\n evp=i\r\nprint(evp+1 if evc<odc else odp+1)", "n=input()\r\na=input().split()\r\n\r\nfor (i,o) in enumerate(a):\r\n a[i]=int(o)\r\nflageven=0\r\nfor i in range(0,3):\r\n if a[i]%2==0:\r\n flageven+=1\r\n else :\r\n flageven-=1\r\n\r\nif flageven>0:\r\n for (i,o) in enumerate(a):\r\n if o%2==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for (i,o) in enumerate(a):\r\n if o%2==0:\r\n print(i+1)\r\n break\r\n", "#Youssef Hassan\r\nn=input()\r\nx=[int(x) for x in input().split()]\r\nodd=[]\r\neven=[]\r\nfor i in x:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(odd)==1:\r\n print(x.index(odd[0])+1)\r\nelse:\r\n print(x.index(even[0])+1)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(a) :\r\n l[i]=l[i]%2\r\ns=sum(l)\r\nif s == 1 :\r\n print(l.index(1)+1)\r\nelse : print(l.index(0)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nl, r = [0, 0], [0, 0]\r\nfor i, v in enumerate(a):\r\n r[v % 2] += 1\r\n l[v % 2] = i + 1\r\nprint(l[0] if r[0] < r[1] else l[1])\r\n", "c = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nb1 = []\r\nfor i in enumerate(a):\r\n\tif i[1] % 2 == 0:\r\n\t\tb.append(i)\r\n\telse:\r\n\t\tb1.append(i)\r\nif len(b) < len(b1):\r\n\tprint(b[0][0] + 1)\r\nelse:\r\n\tprint(b1[0][0] + 1)", "def transformer(p):\r\n return(int(p)%2)\r\nn=int(input())\r\n#l1=list(map(int,))\r\nl=list(map(transformer,input().split()))\r\nz=l[:3].count(0)\r\none=3-z\r\nif z>one:\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)", "w=int(input())\r\ns=list(map(int,input().split()))\r\nlen(s)\r\nchet=0\r\nnech=0\r\nlc=0\r\nln=0\r\nfor i in range(len(s)):\r\n if s[i]%2 == 0:\r\n chet+=1\r\n lc=i +1\r\n else:\r\n nech+=1\r\n ln = i +1\r\nif chet < nech:\r\n print(lc)\r\nelse:\r\n print(ln)", "a= int(input())\r\nb=input()\r\nf = b.split()\r\nc=[]\r\nfor letter in f:\r\n c.append(int(letter))\r\ncount = 0\r\nfor letter in c:\r\n if letter%2==0:\r\n count+=1\r\nif count>1:\r\n for letter in c:\r\n if letter%2==1:\r\n print(c.index(letter)+1)\r\nif count ==1:\r\n for letter in c:\r\n if letter%2==0:\r\n print(c.index(letter)+1)", "n=int(input())\r\nl=[*map(int,input().split())]\r\neven=[i for i in l if i&1==0]\r\nodd=[i for i in l if i&1]\r\nif max(len(even),len(odd))==len(even):\r\n print(l.index(odd[0])+1)\r\nelse:\r\n print(l.index(even[0])+1)", "n = int(input())\nl = list(map(int, input().split()))\nodd = []\neven = []\nfor i in range(n):\n if l[i]%2 == 0:\n even.append(i + 1)\n else:\n odd.append(i + 1)\nif len(odd) == 1:\n print(odd[0])\nelse:\n print(even[0])", "from collections import Counter as c\r\nx=int(input())\r\nl=list(map(int,input().split()))\r\ne=c(list(map(lambda x:x%2!=0,l)))\r\nl=list(map(lambda x:x%2!=0,l))\r\n#d=c(list(map(lambda x:x%2==0,l)))\r\nif e[True]==1:\r\n print(l.index(True)+1)\r\nelif e[False]==1:\r\n print(l.index(False)+1)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\noc = sum(x & 1 for x in a)\r\nfor i, v in enumerate(a):\r\n if (oc != 1 and ~v & 1) or (oc == 1 and v & 1):\r\n print(i + 1)\r\n exit()\r\n", "n = int(input())\narr = [int(i) for i in input().split()]\neve = odd = 0\nfor i in range(n):\n if arr[i]%2 == 0 :\n eve += i+1\n else :\n odd += i+1\nprint(min(eve,odd)) \n \n ", "n = int(input())\r\nl = list(map(int,input().split()))\r\nZ = 0\r\nF = 0\r\nZI = 0\r\nFI = 0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n ZI = i + 1\r\n Z += 1\r\n else:\r\n FI = i + 1\r\n F += 1\r\nif Z>F:\r\n print(FI)\r\nelse:\r\n print(ZI)\r\n", "n = int(input())\nN = [int(x) for x in input().split()]\ni = 0\nfor x in N:\n if x % 2 == 0:\n i = i + 1\n if i == 1:\n label = N.index(x) + 1\nif i == 1:\n print(label)\nelse:\n for y in N:\n if y % 2 == 1:\n print(str(N.index(y)+1))\n", "x=int(input())\r\nz=list(map(int,input().split()))\r\nc=[]\r\nm=[]\r\nfor i in z:\r\n if i%2==0:\r\n c.append(i)\r\n else:\r\n m.append(i)\r\n\r\n\r\nif len(m) > len(c):\r\n print(z.index(c[0])+1)\r\n \r\n \r\n \r\nelse:\r\n print(z.index(m[0])+1)\r\n \r\n \r\n ", "n = eval(input())\nlin = list(map(int, input().split()))\nloc1, loc2 = 0, 0\n\ncnt1, cnt2 = 0, 0\nfor i in lin:\n if i % 2 == 0:\n cnt2 += 1\n loc2 = lin.index(i) + 1\n else:\n cnt1 += 1\n loc1 = lin.index(i) + 1\n\nprint(loc2) if cnt1 > cnt2 else print(loc1)\n \n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nodd_c=0\r\neven_c=0\r\nb=[]\r\nc=[]\r\nfor i in range(n):\r\n if(a[i]&1==0):\r\n even_c+=1\r\n b.append(i)\r\n else:\r\n odd_c+=1\r\n c.append(i)\r\nif(even_c==1):\r\n print(b[0]+1)\r\nelse:\r\n print(c[0]+1)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nfirst=[]\r\nsecond=[]\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n second.append(i+1)\r\n else:\r\n first.append(i+1)\r\nif len(first)<len(second):\r\n print(*first)\r\nelse:\r\n print(*second)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\neven = []\r\nodd = []\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n even.append(l[i])\r\n else:\r\n odd.append(l[i])\r\n if len(even) > 1:\r\n lm = 'even'\r\n break\r\n if len(odd) > 1:\r\n lm = 'odd'\r\n break\r\nif lm == 'even':\r\n for i in range(n):\r\n if l[i] % 2 != 0:\r\n print(i+1)\r\nif lm == 'odd':\r\n for i in range(n):\r\n if l[i] % 2 == 0:\r\n print(i+1)\r\n", "\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nodd = 0\r\neven = 0\r\nlastodd = -1\r\nlasteven = -1\r\nfor ind, item in enumerate(a):\r\n if item % 2 == 0:\r\n even += 1\r\n lasteven = ind + 1\r\n else:\r\n odd += 1\r\n lastodd = ind + 1\r\n \r\nif odd > even:\r\n print(lasteven)\r\nelse:\r\n print(lastodd)\r\n", "n = int(input())\r\narr = [0]+list(map(int, input().split()))\r\nevenness = [-1]*(n+1)\r\nfor i in range(1, n+1):\r\n evenness[i] = (arr[i]%2)\r\nif (evenness.count(0) == (n-1)): print(evenness.index(1))\r\nelse: print(evenness.index(0))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 11 13:44:44 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\nn = int(input())\r\nsample = [int(x) for x in input().split()]\r\na = 0;b = 0\r\nfor i in range(0,n):\r\n if sample[i] % 2 == 0:\r\n a += 1\r\n elif sample[i] % 2 != 0:\r\n b += 1\r\n\r\nif a == 1:\r\n for s in sample:\r\n if s % 2 == 0:\r\n print(sample.index(s) + 1)\r\nelif b == 1:\r\n for s in sample:\r\n if s % 2 == 1:\r\n print(sample.index(s) + 1)\r\n\r\n", "\r\ndef Evenness(array):\r\n\tf = list(map(lambda x:x%2 == 0,array))\r\n\treturn f.index(False)+1 if f.count(True) > 1 else f.index(True)+1\r\n\r\ninput()#discarding this\r\nprint(Evenness(map(int,input().split(' '))))", "# https://codeforces.com/problemset/problem/25/A\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nmark_odd = 0\r\nmark_even = 0\r\n\r\ncount_odd = 0\r\ncount_even = 0\r\n\r\nfor i in range(n):\r\n if numbers[i]%2==0:\r\n mark_even = i + 1\r\n count_even += 1\r\n else:\r\n mark_odd = i + 1\r\n count_odd += 1\r\n\r\n if count_odd>=2 and mark_even!=0:\r\n print(mark_even)\r\n break\r\n if count_even>=2 and mark_odd!=0:\r\n print(mark_odd)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n e=e+1\r\n pos=i\r\nif e==1:\r\n print(pos+1)\r\nelse:\r\n for i in range(len(l)):\r\n if l[i]%2!=0:\r\n o=o+1\r\n pos=i\r\n print(pos+1)", "n = int(input())\r\nnumbers = [int(str) for str in input().split()]\r\nnumber_of_odd = 0\r\nnumber_of_even = 0\r\nodd_index = 0\r\neven_index = 0\r\nfor i in range(0, n):\r\n if (numbers[i] % 2 == 0):\r\n even_index = i\r\n number_of_even += 1\r\n elif (numbers[i] % 2 != 0):\r\n odd_index = i\r\n number_of_odd += 1\r\nif (number_of_even == 1):\r\n print(even_index + 1)\r\nelif (number_of_odd == 1):\r\n print(odd_index + 1)", "import math\nx = int(input())\ny = int(math.ceil(x / 2))\ngiven = list(map(int, input().split()))\n#Inefficient\ncount1 = []\nfor num in given :\n\tif num % 2 == 0 :\n\t\tcount1.append(1)\n\telse :\n\t\tcount1.append(2)\nif count1.count(1) > count1.count(2) :\n\tkey1 = True\nelse :\n\tkey1 = False\nif key1 == True :\n\tfor number in given :\n\t\tif number % 2 != 0 :\n\t\t\tprint(given.index(number) + 1)\n\t\t\tbreak\nelse :\n\tfor number in given :\n\t\tif number % 2 == 0 :\n\t\t\tprint(given.index(number) + 1)\n\t\t\tbreak\n", "def zawji(x):\r\n test=True\r\n if x%2!=0:\r\n test=False\r\n return(test)\r\n\r\nn=int(input(''))\r\nl=[]\r\nch=input('')\r\nl=ch.split(' ')\r\nz=[]\r\nf=[]\r\nfor i in range(len(l)):\r\n l[i]=int(l[i])\r\n if zawji(l[i]):\r\n z.append(i)\r\n else:\r\n f.append(i) \r\nif len(z)<len(f):\r\n print(z[0]+1)\r\nelse:\r\n print(f[0]+1)\r\n ", "n = int(input())\r\nar = [int(x) for x in input().split()]\r\ndef even(x):\r\n return x % 2 == 0\r\ndef odd(x):\r\n return x % 2 != 0\r\nev = list(filter(even, ar))\r\nod = list(filter(odd, ar))\r\nif len(ev) == 1:\r\n print(ar.index(ev[0]) + 1)\r\nelse:\r\n print(ar.index(od[0]) + 1)", "a= int(input())\nb= [int(i) for i in input().split()]\nb= list(map(lambda x: x%2,b))\nif b.count(0) == 1:\n print(b.index(0)+1)\nelse:\n print(b.index(1)+1)", "\n\n# https://codeforces.com/problemset/problem/25/A\n\n\ndef isEven(num):\n\n if num % 2 == 0:\n return True\n\n return False\n\n\ndef main():\n\n n = int(input())\n list_of_numbers = list(input().strip().split())\n\n number_of_evens = 0\n number_of_odds = 0\n\n last_even_index = 0\n last_odd_index = 0\n\n for index, num in enumerate(list_of_numbers):\n\n if isEven(int(num)):\n number_of_evens += 1\n last_even_index = index\n\n else:\n number_of_odds += 1\n last_odd_index = index\n\n if number_of_evens > number_of_odds:\n print(int(last_odd_index) + 1)\n\n else:\n print(int(last_even_index) + 1)\n\n\nmain()\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\ne = [i for i in range(n) if a[i] % 2 == 1]\r\no = [i for i in range(n) if a[i] % 2 == 0]\r\n\r\nprint((o[0] if len(o) == 1 else e[0]) + 1)", "n = int(input())\r\nz = [int(i)%2 for i in input().split()]\r\nif sum(z) == 1:\r\n p = 0\r\n while z[p] != 1:\r\n p+=1\r\nelse:\r\n p = 0\r\n while z[p] != 0:\r\n p+=1\r\nprint(p+1)\r\n", "n = input()\r\n\r\nl = [int(a) for a in input().split(\" \")]\r\n\r\ncount = 0\r\nflag = False\r\nwhile count < len(l) - 1:\r\n\ti = l[count]\r\n\ta = i * l[count + 1]\r\n\tif a % 2 != 0:\r\n\t\tflag = True\t\r\n\tcount +=1\r\n\r\ncount = 0\r\nif flag:\r\n\twhile count < len(l):\r\n\t\ti = l[count]\r\n\t\tif i % 2 == 0:\r\n\t\t\tprint(count + 1)\r\n\t\t\texit()\r\n\t\tcount +=1\r\n\r\nif not flag:\r\n\twhile count < len(l):\r\n\t\ti = l[count]\r\n\t\tif i % 2 != 0:\r\n\t\t\tprint(count + 1)\r\n\t\t\texit()\r\n\t\tcount +=1\r\n\t\t\r\n\r\n\t\t", "n,arr=int(input()),list(map(int, input().split()))\r\ncnt=0\r\nfor x in arr[:]:\r\n if x%2==0:\r\n cnt+=1\r\nif cnt==1:\r\n for x in arr[:]:\r\n if x%2==0:\r\n print(arr.index(x)+1)\r\nelse:\r\n for x in arr[:]:\r\n if x%2==1:\r\n print(arr.index(x)+1) \r\n", "a = int(input())\r\nb = (input()).split()\r\nchet = []\r\nne_chet = []\r\nfor i in range(len(b)):\r\n b[i] = int(b[i])\r\nfor i in b:\r\n if i%2==0:\r\n chet.append(i)\r\n else:\r\n ne_chet.append(i)\r\nif len(chet) > len(ne_chet):\r\n print(b.index(ne_chet[0])+1)\r\nelse:\r\n print(b.index(chet[0])+1)", "size = int(input())\r\nnuml = list(map(int,input().split()))\r\n\r\ndef returnIndex(arr,size):\r\n oi =0\r\n ei =0\r\n oc=0\r\n ec=0\r\n for i in range(size):\r\n if(numl[i]%2==0):\r\n ei = i\r\n ec +=1\r\n else:\r\n oi=i\r\n oc+=1\r\n if(oc==1 and ec >1):\r\n return oi+1\r\n elif(ec==1 and oc >1):\r\n return ei+1\r\n \r\nprint(returnIndex(numl,size)) ", "n = int(input())\r\na = [int(x)%2 for x in input().split()]\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\nif (s == 1):\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nnum=0\r\nfor i in range (n):\r\n if l[i]%2==0:\r\n num+=1\r\nif num==1:\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\no = []\r\ne = []\r\nfor i in range(n):\r\n if a[i] % 2:\r\n o.append(i)\r\n else:\r\n e.append(i)\r\nprint((o[0] if len(o) == 1 else e[0]) + 1)", "n = int(input())\r\nlist_numbers = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in list_numbers:\r\n if i % 2:\r\n counter = counter + 1\r\nif counter == 1:\r\n for j in range(n):\r\n if list_numbers[j] % 2:\r\n print(j + 1)\r\n break\r\nelse:\r\n for j in range(n):\r\n if not list_numbers[j] % 2:\r\n print(j + 1)\r\n break\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=[]\r\ny=[]\r\nfor i in a:\r\n if i%2==0:\r\n x.append(i)\r\n else:\r\n y.append(i)\r\nif len(x)==1:\r\n print(a.index(x[0])+1)\r\nelif len(y)==1:\r\n print(a.index(y[0])+1)\r\n", "n=input();d=[int(i) % 2 for i in input().split()];print(d.index(int(d.count(1) == 1)) + 1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = -1\r\nevens = 0\r\nfor x in a:\r\n if x % 2 == 0:\r\n evens = evens + 1\r\nif evens == 1:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n ans = i + 1\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n ans = i + 1\r\n break\r\nprint(ans)", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\npar = []\r\nimpar = []\r\nfor i in range(n):\r\n if nums[i] % 2 == 0:\r\n par.append(i+1)\r\n else:\r\n impar.append(i+1)\r\n if len(par) >= 2 and len(impar) == 1:\r\n print(impar[0])\r\n break\r\n elif len(impar) >= 2 and len(par) == 1:\r\n print(par[0])\r\n break\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nkc=0\r\nknc=0\r\nk=0\r\nfor i in range(n):\r\n\tif a[i]%2==0:\r\n\t\tkc += 1\r\n\telse:\r\n\t\tknc += 1\r\nif kc==1:\r\n\tfor i in range(n):\r\n\t\tif a[i]%2==0:\r\n\t\t\tk=i+1\r\nelif knc==1:\r\n\tfor i in range(n):\r\n\t\tif a[i]%2==1:\r\n\t\t\tk=i+1\r\nprint(k)", "x=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in l:\r\n\tif i%2==0: e+=1\r\n\telse: o+=1\r\nif o==1:\r\n\tfor i in range(x):\r\n\t\tif l[i]%2==1:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\tfor i in range(x):\r\n\t\tif l[i]%2==0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "t=int(input())\r\nl=list(map(int,input().split()))\r\nei=oi=-1\r\noc=ec=0\r\nfor i in range(t):\r\n\tif l[i]%2==0:\r\n\t\tec+=1\r\n\t\tei=i+1\r\n\telse:\r\n\t\toc+=1\r\n\t\toi=i+1\r\nif oc>ec :\r\n\tprint(ei)\r\nelse:\r\n\tprint(oi)\r\n\t\t", "_ = input()\r\nnumbers = list(map(int, input().split(\" \")))\r\nevenness = {\"odd\": [], \"even\": []}\r\nfor number in numbers:\r\n if number % 2 == 0:\r\n evenness[\"even\"].append(number)\r\n else:\r\n evenness[\"odd\"].append(number)\r\nfor key in evenness:\r\n if len(evenness[key]) == 1:\r\n print(numbers.index(evenness[key][0]) + 1)\r\n\r\n", "a=int(input())\r\ns=list(map(int,input().split()))\r\nel,wl=[],[]\r\nfor i in range(a):\r\n if s[i]%2==0:wl=wl+[i+1]\r\n else:el=el+[i+1]\r\nm=min(len(wl),len(el))\r\nif m==len(wl):\r\n print(wl[0])\r\nelse:print(el[0])", "import sys\n\nn = int(sys.stdin.readline())\nnums = [int(x) for x in sys.stdin.readline().strip().split()]\n\nnum_odds = 0\nfor num in nums[:3]:\n num_odds += num % 2 == 1\n\npattern_odd = num_odds >= 2\n\nif pattern_odd:\n for i, num in enumerate(nums):\n if num % 2 == 0:\n print(i + 1)\n exit(0)\nelse:\n for i, num in enumerate(nums):\n if num % 2 == 1:\n print(i + 1)\n exit(0)", "n = int(input())\na = [int(i) for i in input().split()]\nl = []\nfor i in range(n):\n b = a[i] % 2\n l.append(b)\n\nif l.count(1) > l.count(0):\n print(l.index(0)+1)\nelse:\n print(l.index(1)+1)\n", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\npar = impar = idx_par = idx_impar = 0\r\n\r\nfor i in range(0, n):\r\n if arr[i] % 2 == 0:\r\n par += 1 \r\n idx_par = i\r\n else:\r\n impar += 1\r\n idx_impar = i\r\n\r\nif par > impar:\r\n print(idx_impar + 1) \r\nelse:\r\n print(idx_par + 1) ", "n=int(input())\r\nnum=input()\r\nnum=num.split()\r\neven=0\r\nodd=0\r\ni=0\r\nwhile i<n:\r\n if int(num[i])%2==0:\r\n even+=1\r\n even_i=i\r\n else:\r\n odd+=1\r\n odd_i=i\r\n i+=1\r\nif even==1:\r\n print(even_i+1)\r\nif odd==1:\r\n print(odd_i+1)", "n = int(input())\r\nif n>=3 and n<=100:\r\n number = list(map(int, input().split()))\r\n check = 1\r\n for i in number:\r\n if i<0 and i>100:\r\n check = 0\r\n break\r\n if check == 1 and len(number)==n:\r\n even = 0\r\n odd = 0\r\n for p in number:\r\n if p % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if even > odd:\r\n for p in number:\r\n if p % 2 ==1:\r\n print(number.index(p) + 1)\r\n break\r\n else:\r\n for p in number:\r\n if p % 2 ==0:\r\n print(number.index(p) + 1)\r\n break\r\n\r\n", "n = int(input())\r\nlist = []\r\nlist = [int(x) for x in input().split()]\r\n\r\nzoj , fard = 0 , 0\r\ntzoj , tfard = 0 , 0\r\n\r\nfor i in range(len(list)):\r\n if list[i]%2==0:\r\n tzoj+=1\r\n zoj = i+1\r\n else:\r\n tfard+=1\r\n fard=i+1\r\n\r\nif tfard==1:\r\n print(fard)\r\nelse:\r\n print(zoj)", "#!/usr/bin/env python3\n\ndef evenness(arr):\n even = 0\n odd = 0\n for i in range(3):\n if arr[i] % 2 == 0:\n even += 1\n else:\n odd += 1\n if even > odd:\n return 0\n else:\n return 1\n\ndef diff(arr):\n l = evenness(arr)\n for j in range(len(arr)):\n if (arr[j] - l) % 2 != 0:\n return j+1\n else:\n continue\n\ndef main():\n n = int(input())\n arr = [int(j) for j in input().split(' ')]\n print(diff(arr))\n\nif __name__ == '__main__':\n main()\n", "word = int(input())\r\nword1 = input().split()\r\nlis_2 = []\r\nlis_1 = []\r\nfor i in range(word):\r\n if int(word1[i]) % 2 == 0:\r\n lis_2.append(i + 1)\r\n else:\r\n lis_1.append(i + 1)\r\nprint(lis_1[0] if len(lis_1) < len(lis_2) else lis_2[0])", "import math\r\n\r\ndef solve():\r\n n=int(input())\r\n x=[int(i) for i in input().split()]\r\n even=[]\r\n odd=[]\r\n for i in range(len(x)):\r\n if(x[i]%2==0):\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\n if(len(even)>len(odd)):\r\n return odd[0]\r\n return even[0]\r\n \r\n##n=int(input())\r\nprint(solve())\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nd1=0\r\nd2=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n c1=c1+1\r\n d1=i\r\n else:\r\n c2=c2+1\r\n d2=i\r\n if (c1==1 and c2>1) or (c2==1 and c1>1):\r\n if c1==1:\r\n print(d1+1)\r\n else:\r\n print(d2+1)\r\n break\r\n \r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nfor i in range(len(a)):\r\n if(a[i]%2==0):\r\n b.append(a[i])\r\n else:\r\n c.append(a[i])\r\nif len(b)==1:\r\n for i in range(len(a)):\r\n if [a[i]]==b:\r\n print(i+1)\r\nif len(c)==1:\r\n for i in range(len(a)):\r\n if([a[i]]==c):\r\n print(i+1)", "from bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\r\nfrom collections import defaultdict, Counter\r\nfrom functools import cache, lru_cache\r\nfrom tkinter import W\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().split()\r\nrint = lambda: int(input())\r\n \r\n'''Speed up'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = rint()\r\narr = rarr()\r\n\r\nodd = even = 0\r\nodd_idx = even_idx = 1\r\nfor i in range(n):\r\n if arr[i] % 2:\r\n odd += 1\r\n odd_idx = i + 1\r\n else:\r\n even += 1\r\n even_idx = i + 1\r\n\r\nif odd > even:\r\n print(even_idx)\r\nelse:\r\n print(odd_idx)", "n = input()\nparity = [int(_) % 2 for _ in input().split()]\nif sum(parity[:3]) > 1:\n\tidx = parity.index(0)\nelse:\n\tidx = parity.index(1)\nprint(idx + 1)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\neven =0\r\nodd =0\r\nfor x in a:\r\n if x%2==0:\r\n even += 1\r\n lasteven = x\r\n else:\r\n odd += 1\r\n lastodd = x\r\nif (even == 1):\r\n print(a.index(lasteven)+1)\r\nelse:\r\n print(a.index(lastodd)+1)", "n=int(input())\r\na=input().split()\r\na=[int(i) for i in a]\r\nlist1=[]\r\nb=0\r\nwhile b<len(a):\r\n if a[b]%2==0:\r\n list1.append(0)\r\n if a[b]%2!=0:\r\n list1.append(1)\r\n b+=1\r\nc=0\r\nd=0\r\nfor i in list1:\r\n if i==0:\r\n c+=1\r\n if i==1:\r\n d+=1\r\nif c==1:\r\n e=list1.index(0)+1\r\n print(e)\r\nelif d==1:\r\n f=list1.index(1)+1\r\n print(f)\r\n", "input()\r\ns=[int(x)%2 for x in input().split()]\r\nprint(s.index(sum(s)==1)+1)\r\n \r\n \r\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\njup = []\r\ntak = []\r\nfor i in range(n):\r\n if(data[i]%2==0):\r\n jup.append(i)\r\n else:\r\n tak.append(i)\r\n\r\nif(len(jup) < len(tak)):\r\n san = jup[0]\r\nelse:\r\n san = tak[0]\r\n\r\nprint(san + 1)", "\r\na = int(input())\r\n\r\nb = [int(s) for s in input().split()]\r\n\r\nb = [i%2 for i in b]\r\n\r\nif b.count(0) == 1 :\r\n \r\n print(b.index(0)+1)\r\n\r\nelse :\r\n \r\n print(b.index(1)+1)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na = list(map(lambda x:x%2,a))\r\nif a.count(1) == 1:\r\n print(a.index(1) + 1)\r\nelse:\r\n print(a.index(0) + 1)", "#import sys\r\n#import itertools\r\n#import math\r\n\r\n#t = int(input())\r\nt = 1\r\n\r\nwhile t > 0:\r\n #print(t)\r\n n = int(input())\r\n #a, b = (int(x) for x in input().split())\r\n arr = [int(x) for x in input().split()]\r\n even = 0\r\n odd = 0\r\n for x in arr:\r\n if x%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if even<odd:\r\n for i in range(n):\r\n if arr[i]%2==0:\r\n print(i+1)\r\n break\r\n else:\r\n for i in range(n + 1):\r\n if arr[i] % 2 == 1:\r\n print(i+1)\r\n break\r\n\r\n t -= 1", "n = int(input())\r\nline = [int(x) for x in input().split()]\r\nс = 0\r\n\r\nfor i in range(n):\r\n if line[i] % 2 == 0:\r\n с += 1\r\nif с == 1:\r\n for i in range(n):\r\n if line[i] % 2 == 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if line[i] % 2 != 0:\r\n print(i+1)\r\n break", "n = int(input())\r\nm = [int(i) for i in input().split()]\r\nx = []\r\nfor i in range(n):\r\n x.append(m[i] % 2)\r\nif x.count(1) == 1:\r\n print(x.index(1) + 1)\r\nelse:\r\n print(x.index(0) + 1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl1 = [i for i in l if i % 2 == 0]\r\nl2 = [i for i in l if i % 2 != 0]\r\nif len(l2) == 1:\r\n a = l2[0]\r\n for i in range(n):\r\n if a == l[i]:\r\n print(i + 1)\r\nelse:\r\n a = l1[0]\r\n for i in range(n):\r\n if a == l[i]:\r\n print(i + 1)\r\n", "n = int(input())\r\nl = (input().split())\r\nodd=0\r\neven=0\r\nel=[]\r\nol=[]\r\nfor i in range(len(l)) :\r\n if int(l[i])%2==0 :\r\n even+=1\r\n el.append(int(l[i]))\r\n else:\r\n odd+=1\r\n ol.append(int(l[i]))\r\nif even==1 :\r\n print(l.index(str(el[0]))+1)\r\nif odd==1 :\r\n print(l.index(str(ol[0]))+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\ns1=0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n s+=1\r\n elif l[i]%2!=0:\r\n s1+=1\r\nif s>s1:\r\n for i in range(len(l)):\r\n if l[i]%2!=0:\r\n print(i+1,end=\"\")\r\nelif s1>s:\r\n for i in range(len(l)):\r\n if l[i]%2==0:\r\n print(i+1,end=\"\")\r\n \r\n \r\n ", "n = int (input())\r\ns = str(input())\r\na =list(s)\r\nb = []\r\nt = 0\r\ni = -1\r\no = 0\r\nwhile i <(len(a)):\r\n if o == 1:\r\n break\r\n i=i+1\r\n k=i\r\n t=0\r\n if a[i]==\"1\" or a[i]==\"2\" or a[i]==\"3\" or a[i]==\"4\" or a[i]==\"5\" or a[i]==\"6\" or a[i]==\"7\" or a[i]==\"8\" or a[i]==\"9\" or a[i]==\"0\" :\r\n while a[k]== \"1\" or a[k]==\"2\" or a[k]==\"3\" or a[k]==\"4\" or a[k]==\"5\" or a[k]==\"6\" or a[k]==\"7\" or a[k]==\"8\" or a[k]==\"9\" or a[k]==\"0\":\r\n t = 10*t + int(a[k])\r\n z = 1\r\n if k<len(a)-1:\r\n k=k+1\r\n else:\r\n o=1\r\n break\r\n \r\n if z==1:\r\n b.append(t)\r\n z=0\r\n i=k\r\nz = 0\r\ng = []\r\n\r\nh = 0\r\nab = []\r\n\r\nfor i in range (len(b)):\r\n z = b[i]%2\r\n if z==0:\r\n ab.append(i)\r\n else:\r\n g.append(i)\r\n\r\nif len(ab)==1:\r\n print(ab[0]+1)\r\nelse:\r\n print(g[0]+1)\r\n\r\n\r\n\r\n", "n=int(input())\r\nnum=list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\nfor a in num:\r\n if a%2==0:\r\n even.append(a)\r\n else:\r\n odd.append(a)\r\n \r\nif len(even)>len(odd):\r\n print(num.index(odd[0]) +1)\r\nelse:\r\n print(num.index(even[0]) +1)\r\n \r\n\r\n\r\n", "t=int(input())\r\nguess=0\r\nnumbers=[int(x) for x in input().split()]\r\n\r\nfor i in range(0,t,1):\r\n count=0\r\n for j in range(0,t,1):\r\n dif=abs(numbers[i]-numbers[j])\r\n if dif %2 == 1:\r\n count+=1\r\n guess=i\r\n else:\r\n continue\r\n\r\n if count == t-1:\r\n print(guess+1)\r\n", "n = int(input())\r\narr = input()\r\narr = list(arr.split())\r\narr = list(map(int, arr))\r\narr_2 = []\r\narr_3 = []\r\nch = 0\r\nnch = 0\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n ch += 1\r\n arr_2.append(i+1)\r\n else:\r\n nch += 1\r\n arr_3.append(i+1)\r\nif ch > nch:\r\n print(*arr_3)\r\nelse:\r\n print(*arr_2)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nevens = [x for x in numbers if x % 2 == 0]\r\nodds = [x for x in numbers if x % 2 != 0]\r\n\r\nif len(evens) == 1:\r\n print(numbers.index(evens[0]) + 1)\r\nelse:\r\n print(numbers.index(odds[0]) + 1)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\np=0\r\nip=0\r\nfor i in range(n):\r\n if lst[i]%2 ==1:\r\n p=p+1\r\n else :\r\n ip=ip+1\r\nif p>ip :\r\n for i in range(n):\r\n if lst[i]%2==0:\r\n print(i+1)\r\nelse :\r\n for i in range(n):\r\n if lst[i]%2==1:\r\n print(i+1)", "k=int(input())\r\nl=list(map(int,input().split()))\r\nres=[i%2 for i in l]\r\nfor j in res:\r\n if res.count(j)==1:\r\n print(res.index(j)+1)\r\n break\r\n ", "import math as mt\r\nfrom collections import defaultdict,deque\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\n# from os import path\r\n# from heapq import *\r\n\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\n\r\n\r\n# if(path.exists('inputt.txt')):\r\n# sys.stdin = open('inputt.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n# else:\r\n# # input=sys.stdin.readline\r\n# pass\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef myyy__answer():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n\r\n even=[]\r\n odd=[]\r\n\r\n for i in range(n):\r\n if(a[i]&1):\r\n odd.append(i+1)\r\n else:\r\n even.append(i+1)\r\n \r\n if(len(odd)==1):\r\n print(*odd)\r\n else:\r\n print(*even)\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for _ in range(int(input())):\r\n # print(myyy__answer())\r\n myyy__answer()", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n a[i]=a[i]%2\r\nfor i in range(1,n-1):\r\n if (a[i]!=a[i-1]) and (a[i]!=a[i+1]):\r\n print(i+1)\r\n exit()\r\nif a[0]!=a[1]:\r\n print(1)\r\nif a[n-1]!=a[n-2]:\r\n print(n)\r\n \r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\neven=0\r\nif l[0]%2==l[1]%2:\r\n even=l[0]%2\r\nelif l[0]%2==l[2]%2:\r\n even=l[0]%2\r\nelif l[1]%2==l[2]%2:\r\n even=l[1]%2\r\nfor i in range(n):\r\n if l[i]%2!=even:\r\n print(i+1)\r\n break", "def IQ(x, s):\r\n e = 0\r\n o = 0\r\n for i in range(len(s)):\r\n if s[i] % 2 == 0:\r\n e = e + 1\r\n if s[i] % 2 == 1:\r\n o = o + 1\r\n if e > o:\r\n for i in range(len(s)):\r\n if s[i] % 2 == 1:\r\n return i + 1\r\n else:\r\n for i in range(len(s)):\r\n if s[i] % 2 == 0:\r\n return i + 1\r\nx = int(input())\r\ns = [int(n) for n in input().split()]\r\nprint(IQ(x, s))", "n=int(input())\r\np=[int(i)for i in input().split()]\r\nq=[]\r\ns=0\r\nt=0\r\nfor i in p:\r\n a=i%2\r\n q.append(a)\r\nfor i in q:\r\n if i==0:\r\n s+=1\r\n else:\r\n t+=1\r\nif s==1:\r\n for i in range(len(q)):\r\n if q[i]==0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(q)):\r\n if q[i]==1:\r\n print(i+1)", "n = int(input(''))\r\nl = []\r\ne = []\r\no = []\r\n\r\na = input('').split(' ')\r\nfor i in a:\r\n if int(i) % 2 == 0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif len(e) == 1:\r\n ind = a.index(e[0])\r\n print(ind + 1)\r\nelse:\r\n ind = a.index(o[0])\r\n print(ind + 1)\r\n", "n = int(input())\r\nm = [int(i) % 2 for i in input().split(' ')]\r\nr = {0: [], 1: []}\r\nfor i in range(len(m)):\r\n r[m[i]].append(i+1)\r\n if len(r[0]) and len(r[1]) and len(r[0])+len(r[1]) > 2:\r\n if len(r[0]) == 1:\r\n print(r[0][0])\r\n else:\r\n print(r[1][0])\r\n exit(0)", "import sys\r\nfrom collections import defaultdict\r\nn = int(sys.stdin.readline())\r\nma = list(map(int,sys.stdin.readline().split()))\r\ndi = defaultdict(int)\r\nfor i in range(3):\r\n di[ma[i] %2] +=1\r\nif di[0] > di[1]:\r\n for i in range(n):\r\n if ma[i]%2==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if ma[i]%2==0:\r\n print(i+1)\r\n break\r\n\r\n", "amountOfNumbers = int(input())\r\nnumbers = input().split()\r\nodds = []\r\nevens = []\r\n\r\nfor i in numbers:\r\n if int(i) % 2 == 0:\r\n evens.append(i)\r\n elif int(i) % 2 != 0:\r\n odds.append(i)\r\nif len(odds) > len(evens):\r\n print(int(numbers.index(evens[0])) + 1)\r\nelse:\r\n print(int(numbers.index(odds[0])) + 1)\r\n", "\nclass test2:\n def demo(self, int1, int2):\n arr = [0 if x % 2 else 1 for x in int2]\n # print(arr)\n if sum(arr) > 1:\n print(arr.index(0) + 1)\n else:\n print(arr.index(1) + 1)\n\n\ndef test():\n test_lists = [\n [[3], [2, 9, 4]],\n [[4], [1, 2, 5, 7, 11]],\n [[5], [10, 2, 6, 4, 5]]\n ]\n for line in test_lists:\n print(line[1])\n test2().demo(line[0], line[1])\n\n\ndef main():\n input_str1 = input().strip().split()\n int1 = list(map(int, input_str1))\n input_str2 = input().strip().split()\n int2 = list(map(int, input_str2))\n\n test2().demo(int1, int2)\n\n\nif __name__ == '__main__':\n main()\n # test()\n\t \t\t \t\t \t \t \t\t \t \t\t \t\t", "n=int(input())\r\narray=list(map(int,input().split()))\r\na=0\r\nb=0\r\nfor i in range(n):\r\n if array[i]%2==0:\r\n a+=1\r\n c=i+1\r\n else:\r\n b+=1\r\n d=i+1\r\nif a==1:\r\n print(c)\r\nelse:\r\n print(d)\r\n", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nss=[]\r\nfor i in range(n):\r\n a=s[i]%2\r\n ss.append(a)\r\nif sum(ss)>1:\r\n print(ss.index(0)+1)\r\nelse:\r\n print(ss.index(1)+1)", "x = int(input().strip())\r\nlist1 = list(map(int, input().strip().split()))\r\nfor i in range(x):\r\n list1[i] = list1[i]%2\r\nif list1.count(1)==1:\r\n print(list1.index(1)+1)\r\nelse:\r\n print(list1.index(0)+1)", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n a.append(s[i])\r\n else:\r\n b.append(s[i])\r\nif len(a)==1:\r\n c=a[0]\r\n print(s.index(c)+1)\r\nelse:\r\n d=b[0]\r\n print(s.index(d)+1)\r\n\r\n", "n = int(input())\r\nx = list(map(int, input().split(\" \")))\r\n\r\ncounteven = 0\r\ncountodd = 0\r\n\r\nfor i in range(n):\r\n if (x[i]%2 == 0):\r\n counteven = counteven + 1\r\n elif (x[i]%2 == 1):\r\n countodd = countodd + 1\r\n\r\nif counteven > countodd:\r\n for i in range(n):\r\n if (x[i]%2 == 1):\r\n print(i+1)\r\n elif (x[i]%2 == 0):\r\n continue\r\n\r\nelif counteven < countodd:\r\n for i in range(n):\r\n if (x[i]%2 == 0):\r\n print(i+1)\r\n elif (x[i]%2 == 1):\r\n continue\r\n", "n = int(input())\ntab = [int(x) for x in input().split()]\neven = []\nodd = []\nfor i, x in enumerate(tab, start=1):\n if x%2 == 0:\n even.append(i)\n else:\n odd.append(i)\nif len(even) == 1:\n print(*even)\nelse:\n print(*odd)\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\nlast_odd = last_even = even = 0\r\n\r\nfor i, n in enumerate(arr):\r\n if n % 2:\r\n even -= 1\r\n last_odd = i\r\n else:\r\n even += 1\r\n last_even = i\r\n\r\nif even > 0:\r\n print(last_odd+1)\r\nelse:\r\n print(last_even+1)", "\r\nn = int(input())\r\nx = [int(x) for x in input().split()]\r\n\r\nec=0\r\noc=0\r\npp=1\r\n\r\nfor l in x:\r\n if l%2 == 0:\r\n ec+=1\r\n else:\r\n oc+=1\r\n\r\nif ec > oc: #the odd one out is odd\r\n for l in x:\r\n if l%2 !=0:\r\n print(pp)\r\n break\r\n else:\r\n pp += 1\r\nelse:\r\n for l in x:\r\n if l%2 == 0:\r\n print(pp)\r\n break\r\n else:\r\n pp += 1\r\n ", "jk = int(input())\r\nb = list(map(int, input().split()))\r\nc = 0\r\nn = 0\r\nk = 0\r\nk1 = 0\r\nfor i in b:\r\n if i % 2 ==0:\r\n c = i\r\n k +=1\r\n else:\r\n n = i\r\n k1 += 1\r\nif k>k1:\r\n i1 = b.index(n)\r\n print(i1+1)\r\nelse:\r\n i2 = b.index(c)\r\n print(i2+1)", "def f():\r\n n=int(input())\r\n arr=list(map(int,input().split(\" \")))\r\n odd=[]\r\n even=[]\r\n for i in arr:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\n if len(even)==1:\r\n temp=arr.index(even[0])\r\n return temp+1\r\n elif len(odd)==1:\r\n temp=arr.index(odd[0])\r\n return temp+1\r\nprint(f())\r\n \r\n", "k=0\r\nj=0\r\nimp=0\r\npair=0\r\nx=int(input())\r\nl=list(map(int, input().split()))\r\nfor x in l:\r\n if(x%2==0):\r\n k+=1\r\n imp=l.index(x)+1\r\n else:\r\n j+=1\r\n pair=l.index(x)+1\r\nif(k>j):\r\n print(pair)\r\nelse:\r\n (print(imp))", "for ctr in range(1):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n eve=[i for i in a if i%2==0]\r\n odd=[i for i in a if i%2!=0]\r\n if len(eve)==1:\r\n print(a.index(eve[0])+1)\r\n else:\r\n print(a.index(odd[0])+1)\r\n", "def iq_test():\r\n n=int(input())\r\n num=list(map(int,input().split()))\r\n \r\n odd_list=[]\r\n even_list=[]\r\n for i in range(len(num)):\r\n if num[i]%2==0:\r\n even_list.append(num[i])\r\n else:\r\n odd_list.append(num[i])\r\n \r\n if len(odd_list)>len(even_list):\r\n return num.index(even_list[0])+1\r\n else:\r\n return num.index(odd_list[0])+1\r\n\r\nprint(iq_test())", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nf_e = -1\r\nf_o = -1\r\nfor i in range(len(nums)):\r\n if nums[i]%2 == 0 and f_e == -1:\r\n f_e = i\r\n elif nums[i]%2 == 1 and f_o == -1:\r\n f_o = i\r\n if f_e != -1 and f_o != -1:\r\n break\r\nif f_e == 1 or f_o == 1:\r\n if nums[2]%2==0:\r\n print(f_o+1)\r\n else:\r\n print(f_e+1)\r\nelse:\r\n print(f_o + 1 if f_o > f_e else f_e + 1)", "n=eval(input())\r\nL=[]\r\nL=input().split(\" \")\r\nfor i in range(n):\r\n L[i]=int(L[i])\r\nn=0\r\nfor i in range(3):\r\n if L[i]%2!=0:\r\n n=n+1\r\nif n==0:\r\n for i in range(len(L)):\r\n if L[i]%2==1:\r\n print(i+1)\r\nelif n==1:\r\n for i in range(3):\r\n if L[i]%2==1:\r\n print(i+1)\r\nelif n==2:\r\n for i in range(3):\r\n if L[i]%2==0:\r\n print(i+1)\r\nelif n==3:\r\n for i in range(len(L)):\r\n if L[i]%2==0:\r\n print(i+1)", "n = int(input())\r\nm = list(map(int, input().split()))\r\nt = 0\r\njuft = 0\r\ntn = 0\r\njn = 0\r\nfor i in m:\r\n if i % 2 != 0:\r\n t += 1\r\n tn = i\r\n else:\r\n juft += 1\r\n jn = i\r\nif t > juft:\r\n print(m.index(jn) + 1)\r\nelse:\r\n print(m.index(tn) + 1)\r\n", "a = int(input())\nb = input().split()\n\npar = 0\nimpar = 0\n\nretorno = 0\n\nfor i in range(a):\n b[i] = int(b[i])\n\nfor i in range(a):\n if(b[i]%2 == 0):\n par+=1\n else:\n impar+=1\n\nfor i in range(a):\n if (par == 1 and b[i]%2 == 0):\n retorno = i+1\n elif (impar ==1 and b[i]%2 == 1):\n retorno = i+1\n\nprint(retorno)\n \t\t\t \t\t\t \t\t\t \t\t\t\t\t \t \t\t", "input()\r\nnums=list(map(int,input().split()))\r\nansodd=0\r\nanseven=0\r\nodd=0\r\neven=0\r\nfor i in range(len(nums)):\r\n if nums[i]%2==0:\r\n even+=1\r\n anseven=i\r\n else:\r\n odd+=1\r\n ansodd=i\r\nif odd<even:\r\n print(ansodd+1)\r\nelse:\r\n print(anseven+1)\r\n \r\n", "\r\n\r\nn = int(input())\r\nl = list(map(int, input().strip().split(' ')))\r\ne=0\r\no=0\r\nindexe=0\r\nindexo=0\r\nfor i in range(0, n):\r\n if(l[i]%2==0):\r\n e+=1\r\n indexe=i\r\n else:\r\n o+=1\r\n indexo=i\r\nif(e==1):\r\n print(indexe+1)\r\nelif(o==1) :\r\n print(indexo+1)", "def main() -> None:\r\n n = int(input()) # количество чисел в задании\r\n my_list = tuple([int(x) for x in input().split(\" \")]) # n натуральных чисел <=100 (только одно чётное или нечётное)\r\n odd, no_odd = 0, 0\r\n firs_odd, firs_no_odd = -1, -1\r\n for i in range(n):\r\n if my_list[i] % 2: # если текущее число нечётное\r\n if not no_odd:\r\n firs_no_odd = i + 1\r\n no_odd += 1\r\n else:\r\n if not odd:\r\n firs_odd = i + 1\r\n odd += 1\r\n if (odd > 1 and no_odd):\r\n print(firs_no_odd)\r\n break\r\n if (no_odd > 1 and odd):\r\n print(firs_odd)\r\n break\r\n return None\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl1=[i for i in l if i%2]\r\nl2=[i for i in l if i%2==0]\r\nif len(l1)>len(l2):\r\n\tprint(l.index(l2[0])+1)\r\nelse:\r\n\tprint(l.index(l1[0])+1)", "n=int(input())\r\ns=input()\r\ns=s.split(' ')\r\ntr=0\r\nun_tr=0\r\nfor i in range(int(len(s))):\r\n q=int(s[i])%2\r\n if q==0:\r\n tr+=1\r\n else:\r\n un_tr+=1\r\nif tr>un_tr:\r\n for i in range(int(len(s))):\r\n q=int(s[i])%2\r\n if q!=0:\r\n print(i+1)\r\nelif tr<un_tr:\r\n for i in range(int(len(s))):\r\n q=int(s[i])%2\r\n if q==0:\r\n print(i+1)\r\n \r\n \r\n", "t = int(input())\r\na = list(map(int, input().strip().split()))\r\ne = 0\r\nanse = 0\r\nanso = 0\r\nfor i in range(0, t):\r\n if(a[i] % 2 == 0):\r\n e += 1\r\n anse = i\r\n else:\r\n e -= 1\r\n anso = i\r\nif(e > 0):\r\n print(anso + 1)\r\nelse:\r\n print(anse + 1)", "n = input()\na = list(map(int, input().split(' ')))\n\neven_counter = 0\n\nif(a[0] % 2 == 0):\n even_counter = even_counter + 1 \nif(a[1] % 2 == 0):\n even_counter = even_counter + 1 \nif(a[2] % 2 == 0):\n even_counter = even_counter + 1 \n\nif(even_counter > 1):\n rest = 1\nelse:\n rest = 0\n\nfor i in range(0, len(a)):\n if(a[i]%2 == rest):\n print(i+1)\n exit()\n\t\t \t\t \t\t \t\t \t\t\t \t \t \t \t", "n=[]\na = int(input())\nn = list(map(int,input().split()))\n\nn1=n2=0\nfor i in range(len(n)):\n \n if n[i] % 2 ==0:\n n1+=1\n c=i+1\n else:\n n2+=1\n b=i+1\nif n1> n2 :\n \n print (b)\nelse :\n print(c)\n\n", "input()\r\nn=[int(i) for i in input().split()]\r\nm=[]\r\nfor item in n:\r\n m.append(item%2)\r\nif m.count(0)>m.count(1):\r\n print(m.index(1)+1)\r\nelse:print(m.index(0)+1)\r\n", "def it(): return int(input())\r\ndef pr(a): return print(a)\r\ndef li(): return list(map(int, input().split()))\r\ndef ls(): return [str(i) for i in input()]\r\ndef no(): return print('NO')\r\ndef yes(): return print('YES')\r\n''' ???????????????????????????????????????????? '''\r\n''' ?????????????? ___ ___ ???????????????? '''\r\n''' ?????????????? |-_-| |*_*| ???????????????? '''\r\n''' ?????????????? /| |\\ /| |\\ ???????????????? '''\r\n''' ??????????????__|_|____|_|__???????????????? '''\r\n''' ???????????????????????????????????????????? '''\r\nit()\r\na = li()\r\nm = [];n = []\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n m.append(i+1)\r\n else:\r\n n.append(i+1)\r\nif len(m) < len(n):\r\n print(*m)\r\nelse:\r\n print(*n)", "m=int(input())\r\nn=[int(x) for x in input().split()]\r\na=[]\r\nb=[]\r\nfor i in n:\r\n if i%2==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)>len(b):\r\n print(n.index(b[0])+1)\r\nelse:\r\n print(n.index(a[0])+1)\r\n", "n = int(input())\r\na = [int(i)%2 for i in input().split()]\r\n\r\nd = {0:0,1:0}\r\nfor i in range(3):\r\n\td[a[i]]+=1\r\n\r\nif d[1]>d[0]:\r\n\tprint(a.index(0)+1)\r\nelse:\r\n\tprint(a.index(1)+1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ncounter=0\r\nfor i in range(len(arr)):\r\n if arr[i]%2==0:\r\n counter+=1\r\n ans=i+1\r\n else:\r\n counter-=1\r\n ansr=i+1\r\nprint(ans) if counter<0 else print(ansr) \r\n ", "n = int(input())\r\nli = list(map(int, input().split()))\r\nev = []\r\nodd = []\r\nfor i in range(n):\r\n if li[i]%2 == 0 :\r\n ev.append(i+1)\r\n else :\r\n odd.append(i+1)\r\nif len(ev) == 1 :\r\n print(ev[0])\r\nelse :\r\n print(odd[0])", "index = [-1,-1]\r\nn = int(input())\r\nk = input().split()\r\n\r\neven = 0\r\nodd = 0\r\nfor i in range(n):\r\n k[i] = int(k[i])\r\n index[(k[i]%2)] = i+1\r\n if k[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif(even==1):\r\n print(index[0])\r\nelse:\r\n print(index[1])", "n=int(input())\r\ne=[]\r\ne1=0\r\no=[]\r\no1=0\r\na=list(map(int,input().split(' ')))\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e1+=1\r\n e.append(i)\r\n else:\r\n o1+=1\r\n o.append(i)\r\nif e1>o1:\r\n print(o[0]+1)\r\nelse:\r\n print(e[0]+1)\r\n", "# http://codeforces.com/problemset/problem/25/A\n\n\nn = int(input())\nnums = list(map(int, input().split()))\n\neven_count = 0\nodd_count = 0\n\n\nfor i in range(n):\n\tif nums[i]%2 == 0:\n\t\teven_count += 1\n\t\teven_index = i+1\n\telse:\n\t\todd_count += 1\n\t\todd_index = i+1\n\nif even_count == n-1:\n\tprint(odd_index)\nelse:\n\tprint(even_index)\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ne = 0\r\no = 0\r\ninde = -1\r\nindo = -1\r\n\r\nfor i in range(n):\r\n if(arr[i]%2==0):\r\n e += 1\r\n inde = i+1\r\n else:\r\n o += 1\r\n indo = i+1\r\n\r\nif(e==1):\r\n print(inde)\r\nelif(o==1):\r\n print(indo)\r\n\t\r\n\r\n\r\n\r\n", "a = input()\nb = input()\n\nnum_list = list(map(int, b.split(' ')))\n\nodd = 0\neven = 0\nindex_odd = 0\nindex_even = 0\nfor i in num_list:\n if i%2 == 0:\n even += 1\n index_even = num_list.index(i)\n else:\n odd += 1\n index_odd = num_list.index(i)\n\n\nif odd > even:\n print(index_even + 1)\nelse:\n print(index_odd + 1)\n", "n = int(input())\nl = list(map(int,input().split()))\no,e = [],[]\nfor i in range (len(l)):\n\tif (l[i]%2!=0):\n\t\to.append(l[i])\n\telse:\n\t\te.append(l[i])\nif ((len(e))==1):\n\tprint (l.index(e[0])+1)\nelse:\n\tprint (l.index(o[0])+1)\n", "n = int(input())\r\n\r\nL = input().split()\r\nL = list(map(int, L))\r\n\r\neven_count = 0\r\nodd_count = 0\r\n\r\nfor x in L:\r\n if x % 2 == 0:\r\n even_count+=1\r\n else:\r\n odd_count+=1\r\n\r\n if even_count == 2:\r\n break\r\n if odd_count == 2:\r\n break\r\n\r\ni = 0\r\nfor x in L:\r\n if even_count == 2:\r\n if x % 2 != 0:\r\n break\r\n else:\r\n if x % 2 == 0:\r\n break\r\n i+=1\r\n\r\nprint( i + 1)\r\n", "x= eval(input())\r\nw=list(map(int,input().split()))\r\nc_e=0\r\nc_o =0\r\ni=0\r\nindex = 1\r\nwhile i <len(w):\r\n if w[i]%2 == 0:\r\n c_e +=1\r\n else:\r\n c_o +=1\r\n i+=1\r\ni=0\r\nif c_e> c_o:\r\n while i < len(w):\r\n if w[i]%2 ==1:\r\n print(i+1)\r\n i+=1\r\n \r\nelse:\r\n while i< len(w):\r\n if w[i]%2 ==0:\r\n print(i+1)\r\n i+=1\r\n", "_, list_in, cnt = input(), [int(x) for x in input().strip().split()], 0\r\nfor x in range(3):\r\n if list_in[x] & 1:\r\n cnt += 1\r\ncnt = 1 if cnt >= 2 else 0\r\nfor x in range(len(list_in)):\r\n if list_in[x] & 1 != cnt:\r\n print(x+1)\r\n break", "t=int(input())\r\na=list(map(int,input().split()))\r\nb=list()\r\nfor i in range(t):\r\n b.append(a[i]%2)\r\nif b.count(1)==1:\r\n m=b.index(1)\r\nelif b.count(0)==1:\r\n m=b.index(0)\r\nprint(m+1)", "q=int(input())\r\nw=list(map(int,input().split()))\r\nz=[]\r\nx=[]\r\n\r\nfor i in range(q):\r\n if(w[i]%2==0):\r\n z.append(i)\r\n else:\r\n x.append(i)\r\nif len(z)==1:\r\n print(z[0]+1)\r\nelse:\r\n print(x[0]+1)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ne_count, o_count = 0, 0\r\nfor i in range(n):\r\n\tif l[i] % 2 == 0:\r\n\t\te_count += 1\r\n\t\tif e_count > 1:\r\n\t\t\tfor j in range(n):\r\n\t\t\t\tif l[j] % 2 != 0:\r\n\t\t\t\t\tprint(j+1)\r\n\t\t\t\t\texit()\r\n\telse:\r\n\t\to_count += 1\r\n\t\tif o_count > 1:\r\n\t\t\tfor j in range(n):\r\n\t\t\t\tif l[j] % 2 == 0:\r\n\t\t\t\t\tprint(j+1)\r\n\t\t\t\t\texit()", "n=int(input())\r\nl=list(map(int,input().split()[:n]))\r\na=[]\r\na.append(l[0]%2)\r\na.append(l[1]%2)\r\na.append(l[2]%2)\r\ncount1=a.count(0)\r\ncount2=a.count(1)\r\nif(count1>count2):\r\n for i in l:\r\n if(i%2==1):\r\n print(l.index(i)+1)\r\n break\r\nelse:\r\n for i in l:\r\n if(i%2==0):\r\n print(l.index(i)+1)\r\n break\r\n \r\n", "t=int(input())\r\na=list(map(int,input().split()))\r\nev=[]\r\nod=[]\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n ev.append(i)\r\n e=i+1\r\n else:\r\n od.append(i)\r\n o=i+1\r\nif len(ev)==1:\r\n print(e)\r\nelif len(od)==1:\r\n print(o)\r\n", "n = int(input())\r\nm = [p % 2 for p in map(int, input().split())]\r\nprint((m.index(0)+1) if m.count(1) > m.count(0) else (m.index(1)+1))", "n=int(input())\r\nnumb=input().split()\r\nfor i in range(n):\r\n numb[i]=int(numb[i])\r\np=[0]*n\r\nfor i in range(n):\r\n if numb[i]%2 == 0:\r\n p[i]=0\r\n else:\r\n p[i]=1\r\nif p.count(0) == 1:\r\n print(p.index(0)+1)\r\nif p.count(1) == 1:\r\n print(p.index(1)+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor i in l :\r\n if i%2==0 :\r\n a.append(i)\r\n else :\r\n b.append(i)\r\nif len(a)==1 :\r\n p=a[0]\r\nelse :\r\n p=b[0]\r\nfor j in range(n) :\r\n if l[j]==p :\r\n print(j+1)", "n = int(input())\nl = list(map(int, input().split(' ')))\n\nfor i in range(n - 2):\n\n a, b, c = l[i] % 2, l[i+1] % 2, l[i+2] % 2\n\n if a == b != c:\n print(i+3)\n break\n elif a != b == c:\n print(i+1)\n break\n elif a != b != c:\n print(i+2)\n break\n\n", "q = int(input())\r\nw = list(map(int, input().split()))\r\ne = []\r\nr = []\r\nfor i in range(q):\r\n if w[i] % 2 == 0:\r\n e.append(i + 1)\r\n else:\r\n r.append(i + 1)\r\nif len(e) == 1:\r\n print(e[0])\r\nelse:\r\n print(r[0])", "n = int(input())\r\nl = list(map(int,input().split()))\r\nodd, odd_i, even, even_i = 0, 0, 0, 0\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n even += 1\r\n even_i = i + 1\r\n else:\r\n odd += 1\r\n odd_i = i + 1\r\n if even != 0 and odd != 0 and (even > 1 or odd > 1):\r\n if even > 1:\r\n print(odd_i)\r\n else:\r\n print(even_i)\r\n break", "n = int(input())\r\nnums = [int(i)%2 for i in input().split()]\r\nfor i in range(1, n-1):\r\n if nums[i-1]!= nums[i] != nums[i+1]:\r\n print(i+1)\r\n break\r\nelse:\r\n if nums[0] != nums[1]:\r\n print(1)\r\n else:\r\n print(n)\r\n", "t=int(input())\r\nn = [int(_) for _ in input().split(\" \")]\r\na=[]\r\nb=[]\r\nfor i in range(t):\r\n if n[i]%2==0:\r\n a.append(n[i])\r\n else:\r\n b.append(n[i])\r\nif len(a)==1: print(n.index(a[0])+1)\r\nif len(b)==1: print(n.index(b[0])+1)", "def main(arr):\r\n odd = []\r\n even = []\r\n for num in range(len(arr)):\r\n if arr[num] % 2 == 0:\r\n even.append(num+1)\r\n else:\r\n odd.append(num+1)\r\n \r\n return odd[0] if len(odd) == 1 else even[0]\r\n \r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nprint(main(arr))", "n=int(input())\r\nlist=input().split() \r\na=0;s=''\r\nfor num in list:\r\n num2=int(num)%2\r\n if num2==0:\r\n a+=1\r\n s=s+str(num2)\r\nif a==1:\r\n print(s.find('0')+1)\r\nelse:\r\n print(s.find('1')+1)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(n):\r\n m.append(x[i]%2)\r\nif m.count(0)==1:\r\n print(m.index(0)+1)\r\nelse:\r\n print(m.index(1)+1)\r\n", "def find_index(numbers):\r\n total_numbers = len(numbers)\r\n odd_count = sum(1 for num in numbers if num % 2 == 1)\r\n\r\n if odd_count == 1:\r\n for i, num in enumerate(numbers, 1):\r\n if num % 2 == 1:\r\n return i\r\n\r\n if odd_count > 1:\r\n for i, num in enumerate(numbers, 1):\r\n if num % 2 == 0:\r\n return i\r\n\r\n return -1\r\n\r\ndef main():\r\n num_elements = int(input())\r\n elements = list(map(int, input().split()))\r\n\r\n result_index = find_index(elements)\r\n print(result_index)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\ne = 0\r\no = 0\r\nfor i in range(n):\r\n if l[i]%2 == 0:\r\n e += 1\r\n e1 = i\r\n else:\r\n o += 1\r\n o1 = i\r\n\r\nif e == 1:\r\n print(e1+1)\r\nelif o == 1:\r\n print(o1+1)\r\n", "# NOME: Guilherme Lima Hernandez Rincao\n# RA: 169052\n# K - IQ Test\n\nint(input())\nn = map(int, input().split())\nevens = list(map(lambda a: a % 2 == 0, n))\nif evens.count(True) == 1:\n print(evens.index(True) + 1)\nelse:\n print(evens.index(False) + 1)\n\n \t \t\t \t \t\t \t\t \t\t\t \t\t \t\t", "n=int(input())\r\na=[int(x) for x in input().split(' ')]\r\n\r\nb=n*[0]\r\nfor i in range(n):\r\n b[i]=a[i]%2\r\nif b.count(1)==1:\r\n print(b.index(1)+1)\r\nelse:\r\n print(b.index(0)+1)\r\n", "\r\nx = input()\r\ny = input()\r\ny = y.split(' ')\r\nlist1 = []\r\nfor x in y:\r\n x = int(x)\r\n list1.append(x)\r\nz = 2\r\nif list1[0] % 2 == 0:\r\n if list1[1] % 2 == 0:\r\n for i in list1[2:]:\r\n z += 1\r\n if i % 2 != 0:\r\n break\r\n print(z)\r\n elif list1[1] % 2 != 0:\r\n if list1[2] % 2 == 0:\r\n print('2')\r\n elif list1[2] % 2 != 0:\r\n print('1')\r\nelse:\r\n if list1[1] % 2 == 0:\r\n if list1[2] % 2 == 0:\r\n print('1')\r\n else:\r\n print('2')\r\n else:\r\n for i in list1[2:]:\r\n z += 1\r\n if i % 2 == 0:\r\n break\r\n print(z)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\ne = o = 0\r\nfor i in l:\r\n if i % 2 == 0:\r\n e += 1\r\n even_num = i\r\n else:\r\n o += 1\r\n odd_num = i\r\nprint(l.index(even_num if e < o else odd_num)+1)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nce = 0\r\nco = 0\r\nfor x in a:\r\n if x%2 == 0:\r\n ce = ce+1\r\n elif x%2 !=0:\r\n co = co+1\r\nif ce ==1:\r\n for x in a:\r\n if x%2 == 0:\r\n print(a.index(x)+1)\r\nelif co ==1:\r\n for x in a:\r\n if x%2 !=0:\r\n print(a.index(x)+1)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[39]:\n\n\nn = int(input())\nnumbers = list(map(int, input().split()))\nis_odd = False\ncount_even = count_odd = 0\n\nfor i in range(len(numbers)):\n if numbers[i] % 2 == 0 :\n count_even += 1\n elif numbers[i] % 2 == 1 :\n count_odd += 1\n if i == 2 :\n break\n\nif count_even > count_odd :\n is_odd = False\nelse :\n is_odd = True\n\nindex = 0\nif len(numbers) == 1 :\n print(1)\nelif is_odd :\n for i in range(len(numbers)):\n if numbers[i] % 2 == 0 :\n index = i + 1\n break\n print(index)\nelse :\n for i in range(len(numbers)):\n if numbers[i] % 2 == 1 :\n index = i + 1\n break\n print(index)\n \n\n", "n = int(input())\r\ni = 0\r\narr = [*map(int,input().split())]\r\nodds = 0\r\nodd_index = 0\r\nevens = 0\r\neven_index = 0\r\nwhile odds*evens <= 1:\r\n\tif arr[i] % 2 == 1:\r\n\t\todd_index = i + 1\r\n\t\todds += 1\r\n\telse:\r\n\t\teven_index = i + 1\r\n\t\tevens += 1\r\n\ti += 1\r\nif odds == 1:\r\n\tprint(odd_index)\r\nelse:\r\n\tprint(even_index)", "import collections\r\n\r\n\r\nn = int(input())\r\nls = list(map(int, input().split()))\r\nls1 = []\r\nfor x in range(n):\r\n w = ls[x] % 2\r\n ls1.append(w)\r\ntemp = collections.Counter(ls1).most_common(1)\r\nfor i in range(n):\r\n if ls1[i] != temp[0][0]:\r\n print(i + 1)\r\n exit()\r\n", "n = int(input())\r\ndata = [int(i) for i in input().split()]\r\nodd = 0\r\nfor i in data:\r\n if i % 2 != 0:\r\n odd += 1\r\nif odd > 1:\r\n odd = 0\r\nelse:\r\n odd = 1\r\nfor i in range(n):\r\n if data[i] % 2 == odd:\r\n print(i+1)\r\n break\r\n", "n, num = int(input()), input().split(' ')\r\nodd, even = [], []\r\nfor i in range(0, len(num)):\r\n odd.append(i) if (int(num[i]) & 1) == 1 else even.append(i)\r\nprint(odd[0]+1 if len(odd) < len(even) else even[0]+1)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\nfor i in s:\r\n if i%2!=0:\r\n odd+=1\r\n if i%2==0:\r\n even+=1\r\n\r\nif odd>even:\r\n for i in range(len(s)):\r\n if s[i]%2==0:\r\n print(i+1)\r\n break\r\nif odd<even:\r\n for i in range(len(s)):\r\n if s[i]%2!=0:\r\n print(i+1)\r\n break", "n=int(input())\r\nc=[int(i) for i in input().split()]\r\nji=[m for m in c if m%2!=0]\r\nou=[m for m in c if m not in ji]\r\nif len(ji)==1:\r\n print(c.index(ji[0])+1)\r\nelse:\r\n print(c.index(ou[0])+1)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nodd = 0\r\neven = 0\r\nfor i in arr:\r\n if not i % 2:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nfor i in range(len(arr)):\r\n if odd == 1 and arr[i] % 2:\r\n print(i + 1)\r\n break\r\n if even == 1 and not arr[i] % 2:\r\n print(i + 1)\r\n break\r\n", "n = int(input())\r\nl = list(map(int,input().split(\" \")))\r\nx = l[0]\r\n\r\noddsNumbers = {}\r\nevenNumbers = {}\r\nfor i in range(0,len(l)):\r\n if(l[i] % 2 == 0):\r\n evenNumbers[i+1] = l[i]\r\n else:\r\n oddsNumbers[i+1] = l[i]\r\n \r\nif(len(evenNumbers) == 1):\r\n key = next(iter(evenNumbers.keys()))\r\n print(key)\r\nelif(len(oddsNumbers) == 1):\r\n key = next(iter(oddsNumbers.keys()))\r\n print(key)\r\n \r\n \r\n", "t=int(input())\r\nnumbers=list(map(int,input().split()))\r\nodd=[]\r\neven=[]\r\nfor i in range(t):\r\n if numbers[i]%2==0:\r\n even.append([i,numbers[i]])\r\n else:\r\n odd.append([i,numbers[i]])\r\nif len(even)==1:\r\n print(even[0][0]+1)\r\nif len(odd)==1:\r\n print(odd[0][0]+1)", "r = int(input())\r\nn = list(map(int,input().split()))\r\ne = 0\r\no = 0\r\nres = []\r\nfor i in range(r):\r\n if (n[i]%2 == 0):\r\n e+=1\r\n else:\r\n o+=1\r\nif (e>o):\r\n for i in range(r):\r\n if (n[i]%2 == 1):\r\n print(i+1)\r\nelse:\r\n for i in range(r):\r\n if (n[i]%2 ==0):\r\n print(i+1)", "t = int(input())\r\nn=list(map(int,input().split()))\r\nj,b=0,0\r\nfor i in range(3):\r\n if n[i]%2==0:\r\n j+=1\r\n else:\r\n b+=1\r\nif j<b:\r\n for i in n:\r\n if i%2==0:\r\n print(n.index(i)+1)\r\nelse:\r\n for i in n:\r\n if i%2!=0:\r\n print(n.index(i)+1)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nnumbers=input().split()\r\nmark=[]\r\nfor i in range(n):\r\n if int(numbers[i])%2==0:\r\n mark.append(0)\r\n else:\r\n mark.append(1)\r\n\r\nif mark[0]!=mark[1]:\r\n if mark[2]==mark[0]:\r\n print('2')\r\n else:\r\n print('1')\r\n\r\nelse:\r\n for i in range(2,n):\r\n if mark[i]!=mark[0]:\r\n print(i+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk0=[]\r\nfor i in range(n):\r\n m=l[i]%2\r\n k0.append(m)\r\ncount_0=k0.count(0)\r\ncount_1=k0.count(1)\r\nif(count_0>count_1):\r\n print(k0.index(1)+1)\r\nelse:\r\n print(k0.index(0)+1)", "import sys\nn = int(input())\nalist = list(map(int, sys.stdin.readline().split()))\nalist = [a%2 for a in alist]\nfirst0 = alist.index(0) + 1\nlast0 = alist[::-1].index(0) + 1\nif first0 + last0 == n + 1:\n print(first0)\nelse:\n first1 = alist.index(1) + 1\n print(first1)\n", "n = int(input())\r\nm = list(map(int,input().split()))\r\ns1 = []\r\ns2 = []\r\nfor i in m:\r\n if i%2==0:\r\n s1 += [m.index(i)+1]\r\n if i%2!=0:\r\n s2 += [m.index(i)+1]\r\nif len(s1) > len(s2):\r\n print(*s2)\r\nelse:\r\n print(*s1)\r\n", "p= input()\r\nn =list(map(int, input().split()))\r\ne = 0\r\no= 0\r\ni = 0\r\nj = 0\r\nfor h in range(len(n)):\r\n if n[h] % 2 == 0:\r\n e += 1\r\n i = h\r\n else:\r\n o+= 1\r\n j = h\r\n if e >= 2 and o== 1:\r\n print(j + 1)\r\n quit()\r\n elif o>= 2 and e == 1:\r\n print(i + 1)\r\n quit()", "import math\r\nimport sys\r\nfrom collections import *\r\nimport itertools\r\nfrom typing import NoReturn\r\n \r\n \r\ndef cint() : return list(map(int, sys.stdin.readline().strip().split()))\r\ndef cstr() : return list(map(str, input().split(' '))) \r\n\r\ndef gcd(a,b):\r\n if (b == 0): return a\r\n return gcd(b, a%b)\r\n\r\ndef isPrime(a):\r\n if a==1: return False\r\n i = 2\r\n while i**2 <= a:\r\n if a%i==0: return False\r\n i+=1\r\n return True\r\n\r\ndef solve(t):\r\n n = int(input())\r\n lst = cint()\r\n ceven = 0\r\n codd = 0\r\n ov = -1\r\n ev = -1\r\n for i in range(n):\r\n if lst[i]%2!=0:\r\n codd += 1\r\n ov = i+1\r\n else:\r\n ceven += 1\r\n ev = i+1\r\n \r\n if codd > 1:\r\n print(ev)\r\n else:\r\n print(ov)\r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t =1\r\n \r\n for i in range(1,t+1):\r\n solve(i)\r\n ", "n = int(input())\r\narray = list(map(int, input().split()))\r\ndictionary = {'odd':[], 'even':[]}\r\n\r\nfor i in range(n):\r\n if array[i]%2 == 0:\r\n dictionary['even'].append(i+1)\r\n else:\r\n dictionary['odd'].append(i+1)\r\n \r\nif len(dictionary['odd']) == 1:\r\n print(dictionary['odd'][0])\r\nelse:\r\n print(dictionary['even'][0])\r\n", "n = int(input())\narr = [0]*n\nx = input().split()\nfor i in range (len(x)) :\n arr[i] = (int(x[i])%2)\nh = 0\nif(arr[0] != arr[1] and arr[0] != arr[2]):\n print(1)\nelif (arr[n-1] != arr[0] and arr[n-1] != arr[1]):\n print(n)\nelse :\n while(h<1):\n for i in range (n) :\n if(arr[0] != arr[i]):\n h += 1\n b = i+1\n print(b)\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nflag = nums[0] % 2 + nums[1] % 2 + nums[2] % 2\r\n\r\nif flag == 3:\r\n flag = 0\r\nelif flag == 2:\r\n print((nums[0] % 2 == 0) * 1 + (nums[1] % 2 == 0) * 2 + (nums[2] % 2 == 0) * 3)\r\n exit(0)\r\nelif flag == 1:\r\n print((nums[0] % 2 == 1) * 1 + (nums[1] % 2 == 1) * 2 + (nums[2] % 2 == 1) * 3)\r\n exit(0)\r\nelse:\r\n flag = 1\r\n \r\nfor i in range(3, n):\r\n if nums[i] % 2 == flag:\r\n print(i+1)\r\n ", "t=int(input())\r\na=[int(j) for j in input().split()]\r\nfor i in range(t-1):\r\n if(a[i]%2!=a[i+1]%2):\r\n if(i>0):\r\n print(i+2)\r\n else:\r\n if(a[0]+a[2])%2==0:\r\n print(2)\r\n elif(a[1]+a[2])%2==0:\r\n print(1)\r\n break", "n=input()\nn=int(n)\ns = [int(x) for x in input().split()]\ncnteven=0\ncntodd=0\nfor i in range(n):\n if s[i]%2==1:\n cntodd+=1\n else:\n cnteven+=1\n if cnteven>1 or cntodd>1:\n break\nif cnteven>1:\n for i in range(n):\n if s[i]%2 == 1:\n print(i+1)\n break\nelif cntodd>1 :\n for i in range(n):\n if s[i]%2 == 0:\n print(i+1)\n break\n\n\n", "n = int(input())\r\nnumbers = list(map(int,input().split()))\r\nsumodd = 0\r\nsumeven = 0\r\nodd = list()\r\neven = list()\r\nfor i in range(0,len(numbers)):\r\n if numbers[i] % 2 == 0:\r\n sumeven += 1\r\n even.append(i+1)\r\n else:\r\n sumodd += 1\r\n odd.append(i+1)\r\n# print(sumodd)\r\n# print(odd)\r\n# print(sumeven)\r\n# print(even)\r\nif sumeven > sumodd:\r\n print(odd[0])\r\nelse:\r\n print(even[0])", "n=int(input())\r\na=list(map(int, input().split()))\r\nh=0\r\nh1=0\r\nfor i in range (0, 3):\r\n if (a[i]%2==0):\r\n h+=1\r\n else:\r\n h1+=1\r\nfor i in range (n):\r\n if (h>h1) and (a[i]%2==1):\r\n x=i\r\n elif (h1>h) and (a[i]%2==0):\r\n x=i\r\nprint(x+1)", "def most_frequent(List):\r\n return max(set(List), key = List.count)\r\n\r\nn = int(input())\r\ns = input().split()\r\nodd = []\r\neven = []\r\nfor e in s:\r\n if int(e)%2 == 0:\r\n even.append(int(e))\r\n else:\r\n odd.append(int(e))\r\nif len(odd) == 1:\r\n x = str(odd[0])\r\n a = s.index(x)\r\n print(a + 1)\r\n exit()\r\nelif len(even) == 1:\r\n x = str(even[0])\r\n a = s.index(x)\r\n print(a + 1) \r\n exit()\r\nelse:\r\n diff = []\r\n for i in range(0, n - 1):\r\n dif = s[i+1] - s[i]\r\n diff.append(dif)\r\n differs = most_frequent(diff)\r\n c = s[0]\r\n for j in range(1, n):\r\n c += differs\r\n if c == s[j]: \r\n pass\r\n else:\r\n print(j+1)", "a = int(input())\r\ns = input().split()\r\ntik=0\r\nfor i in range(a):\r\n s[i]=int(s[i])%2\r\n if s[i]==0:\r\n tik+=1\r\nif tik==1:\r\n print(s.index(0)+1)\r\nelse:\r\n print(s.index(1)+1)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\ne = []\r\no = []\r\n\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n even += 1\r\n e += [l[i]]\r\n else:\r\n odd += 1\r\n o += [l[i]]\r\n\r\nif even == 1:\r\n print(l.index(e[0]) + 1)\r\nelse:\r\n print(l.index(o[0]) + 1)\r\n \r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\npos = 0\r\n\r\nfor x in range(n):\r\n if nums[x] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\n\r\nfor x in range(n):\r\n if even > odd:\r\n if nums[x] % 2 != 0:\r\n pos = x\r\n else:\r\n if nums[x] % 2 == 0:\r\n pos = x\r\n\r\nprint(pos+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nch = 0\r\nnech = 0\r\nich = 0\r\ninech = 0\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n ch += 1\r\n ich = i\r\n else:\r\n nech += 1\r\n inech = i\r\nif ch > nech:\r\n print(inech + 1)\r\nelse:\r\n print(ich + 1)", "t=int(input())\r\n\r\nl=list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\n \r\nif len(even)==1:\r\n print(even[0])\r\nelse:\r\n print(odd[0])", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nres = []\r\nfor i in range(n-1):\r\n if arr[i]%2 != arr[i+1]%2:\r\n if arr[i]%2 != arr[(i+2)%n]%2:\r\n print(i+1)\r\n else:\r\n print(i+2)\r\n break", "n = int(input())\r\nl1 = [int(i) for i in input().split(\" \")]\r\ne=[]\r\no=[]\r\nfor i in range(len(l1)):\r\n if l1[i] % 2 == 0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif len(e) == 1:\r\n print(e[0]+1)\r\nelse:\r\n print(o[0]+1)", "n=int(input())\r\nsum1=0\r\nsum2=0\r\nl=[int(x) for x in input().split()]\r\nfor a in l:\r\n if a%2==0:\r\n sum2+=1\r\n else:\r\n sum1+=1\r\nif sum1==1:\r\n for a in l:\r\n if a%2!=0:\r\n print(l.index(a)+1)\r\n else:\r\n pass\r\n\r\nelse:\r\n for a in l:\r\n if a%2==0:\r\n print(l.index(a)+1)\r\n else:\r\n pass\r\n ", "n = int(input())\r\nst = input()\r\nnums = st.split()\r\n\r\n\r\ncounter = [0, 0]\r\nfor i in range(3):\r\n counter[int(nums[i]) % 2] += 1\r\n\r\n# We are searching for an odd number\r\nif counter[0] >= 2:\r\n desired = 1\r\n# We are searching for an even number\r\nelse:\r\n desired = 0\r\n\r\nfor i in range(n):\r\n if int(nums[i]) % 2 == desired:\r\n print(i + 1)\r\n break\r\n", "import math\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt =0\r\ncnt1=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n cnt+=1\r\n else:\r\n cnt1+=1\r\n \r\nif cnt>cnt1:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\n break\r\n \r\nelse:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = []\r\nfor i in range(n):\r\n if l[i] %2 ==0:\r\n d.append(1)\r\n else:\r\n d.append(0)\r\nif d.count(0)>d.count(1):\r\n ind = d.index(1)\r\nelse:\r\n ind = d.index(0)\r\nprint(ind+1)", "n=int(input())\r\neven=[]\r\nkey_even=[]\r\nodd=[]\r\nkey_odd=[]\r\na=[int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\nif len(even)==1:\r\n print(even[0]+1)\r\nelse:\r\n print(odd[0]+1)\r\n", "l = int(input())\r\ns = input().split()\r\nx = []\r\ny = []\r\nfor a in s:\r\n if int(a) % 2 == 0:\r\n x.append(a)\r\n else:\r\n y.append(a)\r\nif len(x) == 1:\r\n print(s.index(x[0])+1)\r\nelse:\r\n print(s.index(y[0])+1)", "len_ = int(input())\r\niq = [int(x) for x in input().split()]\r\n\r\nodd, even = [], []\r\n\r\nfor i in range(len(iq)):\r\n if iq[i] % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\nif len(odd) > len(even):\r\n print(even[0]+1)\r\nelse:\r\n print(odd[0]+1)\r\n", "n = int(input())\r\ncnt1=0\r\ncnt2=0\r\nl = list(map(int,input().split()))\r\nfor i in l:\r\n if i%2!=0:\r\n cnt1=cnt1+1\r\n else:\r\n cnt2=cnt2+1\r\nif cnt1>cnt2:\r\n for i in range(0,len(l)):\r\n if l[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(0,len(l)):\r\n if l[i]%2!=0:\r\n print(i+1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\neven_count = odd_count = 0\r\n\r\nfor num in numbers:\r\n if num % 2 == 0:\r\n even_count += 1\r\n else:\r\n odd_count += 1\r\n\r\nif even_count > 1 and odd_count == 1:\r\n for i, num in enumerate(numbers):\r\n if num % 2 == 1:\r\n print(i + 1) # Выводим номер (порядковый номер, начиная с 1) нечетного числа\r\n break\r\nelif odd_count > 1 and even_count == 1:\r\n for i, num in enumerate(numbers):\r\n if num % 2 == 0:\r\n print(i + 1) # Выводим номер (порядковый номер, начиная с 1) четного числа\r\n break\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\neven =0\r\nodd=0\r\nfor i in l:\r\n if even>1 or odd>1:\r\n break\r\n elif i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif(even >odd):\r\n for i in range(len(l)):\r\n if(l[i]%2==1):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(l)):\r\n if (l[i] % 2 == 0):\r\n print(i + 1)\r\n break", "n = int(input())\r\nm=list(map(int,input().split()))\r\ntarget = 1-m[0]%2 if m[0]%2==m[1]%2 else 1-m[2]%2\r\nfor i,k in enumerate(m):\r\n if k%2==target:\r\n print(i+1)", "input()\na = input().strip().split(\" \")\na = [int(x) for x in a]\nfE = fO = -1\ne = o = 0\nfor i in range(len(a)):\n\tfE = i+1 if fE==-1 and a[i]%2==0 else fE\n\tfO = i+1 if fO==-1 and a[i]%2==1 else fO\n\te += 1 if a[i]%2==0 else 0\n\to += 1 if a[i]%2==1 else 0\nprint(fO if max(e,o)==e else fE)", "a=input()\r\nb=list(map(int,input().split()))\r\nfor i in range(int(a)-1):\r\n if (b[i]+b[i+1])%2!=0:\r\n if i==0:\r\n if b[i]%2==b[i+2]%2:\r\n print(i+2)\r\n else:\r\n print(i+1)\r\n break\r\n else:\r\n print(i+2)\r\n break\r\n", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\ncount1=0\r\ncount2=0\r\nfor i in range(0,n):\r\n if s[i]%2==0:\r\n count2+=1\r\n else:\r\n count1+=1\r\nif count2==1:\r\n for i in range(0,n):\r\n if s[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(0,n):\r\n if s[i]%2==1:\r\n print(i+1)\r\n break", "class solve:\r\n def __init__(self):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n e,o,i1,i2=0,0,0,0\r\n for i in range(n):\r\n if a[i]%2:\r\n o+=1\r\n i1=i+1\r\n else:\r\n e+=1\r\n i2=i+1\r\n if i>=2:\r\n if o==1:\r\n print(i1)\r\n break\r\n elif e==1:\r\n print(i2)\r\n break\r\n \r\nobj=solve()", "\"\"\"\nNome: Stefano Lopes Chiavegatto\nRA: 1777224\n\"\"\"\n\nnum = int(input())\nnums = input()\n\nlista_nums = nums.split(\" \")\n\neven = 0\n\nif int(lista_nums[0]) % 2 == 0:\n\teven = even + 1\n\nif int(lista_nums[1]) % 2 == 0:\n\teven = even + 1\n\nif int(lista_nums[2]) % 2 == 0:\n\teven = even + 1\n\nif even >= 2:\n\tfor i in lista_nums:\n\t\tif int(i) % 2 != 0:\n\t\t\tprint(lista_nums.index(i) + 1)\nelse:\n\tfor i in lista_nums:\n\t\tif int(i) % 2 == 0:\n\t\t\tprint(lista_nums.index(i) + 1)\n\t \t\t\t\t\t \t \t\t\t\t \t\t\t \t \t", "n = int(input())\r\nli = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in range(3) :\r\n\tif li[i]%2 == 0 :\r\n\t\teven += 1\r\n\telse : \r\n\t\todd += 1\r\n\r\nif even >= 2 :\r\n\tfor i in range(len(li)) :\r\n\t\tif li[i]%2 == 1 :\r\n\t\t\tprint(i+1)\r\nelif odd >= 2 :\r\n\tfor i in range(len(li)) :\r\n\t\tif li[i]%2 == 0 :\r\n\t\t\tprint(i+1)", "d, digits = int(input()), list(map(int, input().split()))\r\nif digits[0] % 2 == digits[1] % 2:\r\n flag = digits[0] % 2\r\nelif digits[1] % 2 == digits[2] % 2:\r\n flag = digits[1] % 2\r\nelse:\r\n flag = digits[2] % 2\r\nfor i in digits:\r\n if i % 2 != flag:\r\n print(digits.index(i) + 1)\r\n exit()", "n = int(input())\r\nt = list(map(int,input().split()))\r\n\r\n'''\r\nk = -1\r\nif t[0] % 2 == 0 and t[-1] % 2 == 0:\r\n k = 1\r\nelif t[0] % 2 == 1 and t[-1] % 2 == 1:\r\n k = 0\r\nelse:\r\n if t[1] % 2 == 0 and t[0] % 2 == 0:\r\n print(n)\r\n elif t[1] % 2 == 0 and t[-1] % 2 == 0:\r\n print(1)\r\n elif t[1] % 2 == 1 and t[0] % 2 == 1:\r\n print(n)\r\n elif t[1] % 2 == 1 and t[-1] % 2 == 1:\r\n print(1)\r\n'''\r\n\r\nq1 = 0\r\nq2 = 0\r\nfor el in t:\r\n if el % 2 == 0:\r\n q1 += 1\r\n else:\r\n q2 += 1\r\nif q1 == 1:\r\n k = 0\r\nelse:\r\n k = 1\r\n\r\nfor i in range(n):\r\n if t[i] % 2 == k:\r\n print(i + 1)\r\n break", "n = input()\r\nl = [int(i) for i in str(input()).split()]\r\nl1 = [ i+1 for i,j in enumerate(l) if j%2==0]\r\nl2 = [i+1 for i,j in enumerate(l) if j%2!=0]\r\nif len(l1) > len(l2):\r\n print(l2[0])\r\nelse :\r\n print(l1[0])", "n=input()\r\na = list(map(lambda x: int(x)%2,input().split()))\r\n\r\nif(a[:3].count(0)>=2):\r\n\tprint(a.index(1)+1)\r\nelse:\r\n\tprint(a.index(0)+1)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\no=0\r\ne=0\r\nfor i in lst:\r\n if(i%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\nif(o>e):\r\n for i in range(len(lst)):\r\n if(lst[i]%2==0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(lst)):\r\n if(lst[i]%2!=0):\r\n print(i+1)\r\n break", "n=int(input())\nl=[int(x)%2 for x in input().split()]\nprint(l.index(0)+1 if l.count(0)==1 else l.index(1)+1)\n\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Mar 27 22:46:02 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\nnum=list(map(int,input().split()))\r\nrem=[x%2 for x in num]\r\n[print(rem.index(1)+1) if sum(rem)==1 else print(rem.index(0)+1)]\r\n", "n=int(input())\na=list(map(int,input().split()))\na=[x%2 for x in a]\nt = 0\nif sum(a)==1:\n t = 1\n\ni = 0\nwhile i<n:\n if a[i]==t:\n print(i+1)\n break\n i+=1\n", "numbers = int(input())\r\nnumbers_list = list(map(int, input().split()))\r\nchet = nechet = last_chet = last_nechet = 0\r\n\r\nfor i in numbers_list:\r\n # print(numbers_list[i])\r\n if i % 2 == 0:\r\n chet += 1\r\n last_chet = i\r\n else:\r\n nechet += 1\r\n last_nechet = i\r\n\r\n if chet > 1 and nechet == 1:\r\n print(numbers_list.index(last_nechet)+1)\r\n break\r\n elif nechet > 1 and chet == 1:\r\n print(numbers_list.index(last_chet)+1)\r\n break\r\n\r\n", "amount_of_numbers = int(input())\r\nnumbers = input().split()\r\nnumbers = [int(num) for num in numbers]\r\neven, i = 0, 0\r\nwhile i <= 2:\r\n if numbers[i] % 2 == 0:\r\n even += 1\r\n i += 1\r\nnumber_index = 0\r\nif even >= 2:\r\n while number_index <= len(numbers):\r\n if numbers[number_index] % 2 != 0:\r\n break\r\n number_index += 1\r\nelse:\r\n while number_index <= len(numbers):\r\n if numbers[number_index] % 2 == 0:\r\n break\r\n number_index += 1\r\nprint(number_index + 1)\r\n", "n = int(input())\r\nls = list(map(int,input().split()[:n]))\r\nfor i in range(len(ls)-2):\r\n if ls[i]%2==0 and ls[i+1]%2==0 and ls[i+2]%2==1:\r\n print(i+3)\r\n break\r\n if ls[i]%2==0 and ls[i+1]%2==1 and ls[i+2]%2==0:\r\n print(i+2)\r\n break\r\n if ls[i]%2==1 and ls[i+1]%2==0 and ls[i+2]%2==0:\r\n print(i+1)\r\n break\r\n if ls[i]%2==1 and ls[i+1]%2==1 and ls[i+2]%2==0:\r\n print(i+3)\r\n break\r\n if ls[i]%2==1 and ls[i+1]%2==0 and ls[i+2]%2==1:\r\n print(i+2)\r\n break\r\n if ls[i]%2==0 and ls[i+1]%2==1 and ls[i+2]%2==1:\r\n print(i+1)\r\n break\r\n \r\n \r\n", "_ = input()\r\ns = list(map(int,input().split()))\r\nod = ev = a = b = 0 \r\nfor i in range(len(s)) :\r\n if s[i] % 2 :\r\n od += 1 \r\n a = i\r\n else :\r\n ev += 1\r\n b = i \r\n if od == 1 and ev > 1 :\r\n print(a+1)\r\n break\r\n elif od > 1 and ev == 1 :\r\n print(b+1)\r\n break", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nx=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n x.append('1')\r\n else: x.append('0')\r\nx=''.join(x)\r\nif x.count('1')>x.count('0'):\r\n print(x.find('0')+1)\r\nelse: print(x.find('1')+1)", "a = int(input())\nb = list(map(str, input().split()))\n\nnoteven = []\neven = []\nfor x in range(0, len(b)):\n if int(b[x]) % 2 == 0:\n even.append(str(b[x]))\n else:\n noteven.append(str(b[x]))\n\nif len(even) > len(noteven):\n jd = \"\".join(noteven)\n index = b.index(jd)\n index = index + 1\n print(index)\nelse:\n jd1 = \"\".join(even)\n index1 = b.index(jd1)\n index1 = index1 + 1\n print(index1)", "n = int(input())\r\nc = list(map(int, input().split()))\r\na = []\r\nb = []\r\nfor i in range(0, len(c)):\r\n\tx = c[i]\r\n\tif x%2==0:\r\n\t\ta.append(x)\r\n\telse:\r\n\t\tb.append(x)\r\nif len(a)>len(b):\r\n\tm = b[0]\r\nelse:\r\n\tm = a[0]\r\ny = c.index(m)\r\nprint(y+1)", "num = int(input())\r\nnums = [int(a) for a in input().split()]\r\ndef answer():\r\n if nums[0]%2 != nums[1]%2:\r\n if nums[0]%2 == nums[2]%2:\r\n return 2\r\n else:\r\n return 1\r\n else:\r\n for i in range (2, len(nums)):\r\n if nums[i]%2 != nums[0]%2:\r\n return i + 1\r\nprint(answer())", "n=int(input())\r\nnum=list(map(int,input().split()))[:n]\r\nc,s=0,0\r\nli,lis=[],[]\r\nfor y in range(n):\r\n if(num[y]-num[1])%2==0:\r\n li.append(y)\r\n c=c+1\r\n else:\r\n lis.append(y)\r\n s=s+1\r\nif c<n-1:\r\n print(li[0]+1)\r\nelse:\r\n print(lis[0]+1)", "\r\ndef main():\r\n n = int(input())\r\n numbers = list(map(int, input().split()))\r\n\r\n odd = 0\r\n odd_number = None\r\n \r\n even = 0\r\n even_number = None\r\n\r\n \r\n for temp_number in numbers:\r\n if temp_number % 2 == 0:\r\n even += 1\r\n even_number = temp_number\r\n else:\r\n odd += 1\r\n odd_number = temp_number\r\n\r\n if even == 1:\r\n print(numbers.index(even_number) + 1)\r\n else:\r\n print(numbers.index(odd_number) + 1)\r\n \r\n \r\nmain()\r\n", "n = int(input())\r\nnumbers = [int(num) for num in input().split()]\r\nindex = []\r\nfor num in numbers:\r\n if num % 2 == 0:\r\n index.append(0)\r\n else:\r\n index.append(1)\r\nif sum(index) == 1:\r\n print(index.index(1) + 1)\r\nelse:\r\n print(index.index(0) + 1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 16:15:51 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = list(map(lambda x: int(x) &1, input().split()))\r\nif sum(s) == len(s) - 1:\r\n print(s.index(0) + 1)\r\nelse:\r\n print(s.index(1) + 1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=0\r\nb=0\r\no=0\r\ne=0\r\nfor i in l:\r\n if i%2==0:\r\n a=i\r\n e+=1\r\n else:\r\n b=i\r\n o+=1\r\nprint(l.index(a)+1 if e<o else l.index(b)+1)", "def check_evenness(allNum, even = 0, odd = 0):\r\n for num in allNum:\r\n if int(num ) % 2 == 0:\r\n odd+=1\r\n else:\r\n even += 1\r\n return 'even' if even<odd else 'odd'\r\ndef check_evenness_number_index(evennes, allNum):\r\n \r\n if evennes == 'odd':\r\n for num in allNum:\r\n if int(num) % 2 == 0:\r\n return(allNum.index(num)+1)\r\n break\r\n else:\r\n for num in allNum:\r\n if int(num) % 2 != 0:\r\n return(allNum.index(num)+1)\r\n break\r\n \r\n \r\n \r\nn = int(input())\r\n\r\nallNum = input().split()\r\n\r\nevennes = check_evenness(allNum)\r\n\r\nindex = check_evenness_number_index(evennes, allNum)\r\nprint(index)", "if __name__==\"__main__\":\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n o = []\r\n e = []\r\n for i in range(0,n):\r\n if a[i]%2==0: e.append(i+1)\r\n else: o.append(i+1)\r\n if len(o)==1: print(o[0]) \r\n else: print(e[0])", "n = int(input())\r\nlist = [int(x) for x in input().split()]\r\nm = 0\r\nfor i in range(n):\r\n if list[i] % 2 == 0:\r\n m += 1\r\nif m == 1:\r\n for i in range(n):\r\n if list[i] % 2 == 0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if list[i] % 2 !=0:\r\n print(i+1)\r\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\n# Find the number of even and odd numbers\r\nnum_evens = sum(1 for num in nums if num % 2 == 0)\r\nnum_odds = n - num_evens\r\n\r\n# Determine which number is different based on parity\r\nif num_evens == 1:\r\n print(nums.index(next(num for num in nums if num % 2 == 0)) + 1)\r\nelse:\r\n print(nums.index(next(num for num in nums if num % 2 == 1)) + 1)\r\n", "input()\r\nl = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\noidx = 0\r\neidx = 0\r\nfor i in range(len(l)):\r\n if l[i]&1==1:\r\n odd+=1\r\n oidx = i+1\r\n else:\r\n even+=1\r\n eidx = i+1\r\nif odd==1:\r\n print(oidx)\r\nelse:\r\n print(eidx)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nls = [i % 2 for i in arr]\r\nif ls.count(0) == 1:\r\n print(ls.index(0) + 1)\r\nelse:\r\n print(ls.index(1) + 1)", "n = input()\nlista = [int(x) for x in input().split()]\nimpares = []\npares = []\nindice = 0\n\nfor i in lista:\n indice += 1\n if i % 2 == 0:\n pares.append(indice)\n else: \n impares.append(indice)\n\nif len(pares) == 1:\n print(pares[0])\nelse: print(impares[0])\n\n \t\t \t\t\t\t\t\t \t\t\t\t\t \t \t\t \t\t", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl1 = []\r\nl2 = []\r\nfor i in range(n):\r\n if l[i] & 1 : l1.append(l[i])\r\n else : l2.append(l[i])\r\nif len(l1) == 1: print(l.index(l1[0]) + 1)\r\nelse : print(l.index(l2[0]) + 1)", "def check_eveness(list,n):\r\n i=0\r\n for k in range(n):\r\n if list[k]%2==0:\r\n i+=1\r\n return i\r\nn=int(input())\r\ncheck_list= list(map(int,input().strip().split()))[:n]\r\neven = check_eveness(check_list,n)\r\nodd = n-even\r\nif(odd < even): \r\n for j in range(n):\r\n if(check_list[j]%2==1):\r\n print(j+1)\r\n break\r\nif(odd > even):\r\n for j in range(n):\r\n if(check_list[j]%2==0):\r\n print(j+1)\r\n break\r\n", "n=int(input())\r\nlist=input().split()\r\nlist=[int(i)%2 for i in list]\r\nif sum(list)==1:\r\n print(list.index(1)+1)\r\nelse:\r\n print(list.index(0)+1)\r\n", "n=int(input());l=[i%2 for i in list(map(int,input().split()))]\r\nif l.count(1)==1 :\r\n print(l.index(1)+1)\r\nelse :\r\n print(l.index(0)+1)", "n = int(input())\r\nnum_arr = [int(num)%2 for num in input().split(' ')]\r\ncount_odd = 0\r\ncount_even = 0\r\nfor num in num_arr[0:3]:\r\n if num % 2 == 0:\r\n count_even += 1\r\n else:\r\n count_odd += 1\r\nif count_odd > 1:\r\n print(num_arr.index(0)+1)\r\nelse:\r\n print(num_arr.index(1)+1)\r\n", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nach=[]\r\nanch=[]\r\nfor i in range(len(b)):\r\n if b[i]%2==0:\r\n ach.append((b[i],i+1))\r\n else:\r\n anch.append((b[i],i+1))\r\nif len(ach)>len(anch):\r\n print(anch[0][1])\r\nif len(anch)>len(ach):\r\n print(ach[0][1])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nf = [i%2 for i in l]\r\nif (f.count(1) == 1):\r\n print(f.index(1) + 1)\r\nelse:\r\n print(f.index(0) + 1)\r\n", "\r\nn = int(input())\r\nodd = 0\r\neven = 0\r\nm = map(int,input().split())\r\nind = 1\r\nfor k in m:\r\n if k % 2 == 0:\r\n if even != 0:\r\n even = -1\r\n else:\r\n even = ind\r\n else:\r\n if odd != 0:\r\n odd = -1\r\n else:\r\n odd = ind\r\n ind+=1\r\n\r\nif odd == -1:\r\n print(even)\r\nelse:\r\n print(odd)", "x = int(input())\r\nl = input().split(\" \")\r\nl1 = list(map(lambda x : int(x)%2,l))\r\nprint(l1.index(sum(l1)==1)+1)\r\n", "n= int(input())\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\nod=[]\r\nev=[]\r\nz=[]\r\n\r\nfor k in range(n):\r\n if t[k]==0:\r\n z.append(k+1)\r\n if t[k]%2==0:\r\n ev.append(k+1)\r\n else:\r\n od.append(k+1)\r\n\r\nif len(ev)==1:\r\n print(ev[0])\r\nelif len(od)==1:\r\n print(od[0])\r\nelse:\r\n z[0]\r\n", "n = int(input())\r\n\r\narr = input().split()\r\n\r\ncount_1 = 0\r\ncount_2 = 0\r\n\r\nfor i in range(3):\r\n\tarr[i] = int(arr[i])\r\n\tif arr[i] % 2 == 0:\r\n\t\tcount_1 += 1\r\n\telse:\r\n\t\tcount_2 += 1\r\n\r\nflag_1 = False\r\n\r\nif count_1 > count_2:\r\n\tflag_1 = True\r\n\r\nfor i in range(n):\r\n\tarr[i] = int(arr[i])\r\n\tif (arr[i] % 2 == 0) and (flag_1 == False):\r\n\t\tprint(i + 1)\r\n\t\tbreak;\r\n\telif (arr[i] % 2 == 1) and (flag_1 == True):\r\n\t\tprint(i + 1)\r\n\t\tbreak;", "n = int(input())\r\na = list(int(x)%2 for x in input().split())\r\nprint(a.index(sum(a) == 1) + 1)", "temp= []\r\nlst = []\r\nn=int(input())\r\nlst = [int(x) for x in input().split()]\r\n \r\nfor item in lst:\r\n if item%2 == 0:\r\n temp.append('e')\r\n else:\r\n temp.append('o')\r\n \r\nif temp.count('e')==1:\r\n ind=temp.index('e')+1\r\n print(ind)\r\nelse:\r\n ind=temp.index('o')+1\r\n print(ind)", "#Abdelrazik\r\n\r\ndef IQ_test(a):\r\n W= list(map(int,input().split()))\r\n\r\n E = []\r\n\r\n for i in range(a):\r\n E.append(W[i] %2)# 1 or 0 for even\r\n\r\n Even_odd = max(set(E), key = E.count)\r\n if Even_odd == 0:\r\n for q in range(a):\r\n if W[q]%2 == 1:\r\n return q+1\r\n else:\r\n for q in range(a):\r\n if W[q]%2 == 0:\r\n return q+1\r\n\r\na = int(input())\r\nprint(IQ_test(a))", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = a[0] % 2 + a[1] % 2 + a[2] % 2\r\nif s <= 1:\r\n for i in range(0,n):\r\n if a[i] % 2 == 1:\r\n print (i + 1)\r\n break\r\nelse:\r\n for i in range(0,n):\r\n if a[i] % 2 == 0:\r\n print (i + 1)\r\n break\r\n", "tests = int(input())\nnums = list(map(int, input().split()))\n\neven = 0\nodd = 0\nfor i in range(len(nums)):\n if nums[i]%2 != 0:\n odd += 1\n else:\n even += 1\nif even > 1:\n for i in range(len(nums)):\n if nums[i]%2 != 0:\n print(i+1)\n break\nelse:\n for i in range(len(nums)):\n if nums[i]%2 == 0:\n print(i+1)\n break ", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ne=0\r\ne1=0\r\no1=0\r\no=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n e=e+1\r\n e1=i\r\n else:\r\n o=o+1\r\n o1=i\r\nif(e==1):\r\n print(e1+1)\r\nelse:\r\n print(o1+1)", "taken = lambda : map(int, input().split())\r\nn = int(input())\r\nnumber = list(taken())\r\nnew= []\r\nfor i in number:\r\n new.append(i%2)\r\n\r\nprint(new.index(sum(new)==1)+1)", "n=int(input())\r\n\r\narr=list(map(int, input().split()))\r\ne=0\r\no=0\r\nx=0\r\ned=0\r\neo=0\r\nfor i in range(0,3):\r\n if arr[i]%2==0:\r\n e+=1\r\n ed=i+1\r\n x+=1\r\n else:\r\n o+=1\r\n od=i+1\r\n x+=1\r\n\r\nif o!=0 and e!=0:\r\n if o>e:\r\n print(ed)\r\n else:\r\n print(od)\r\n\r\nelif o==0:\r\n for i in range(3,n):\r\n if arr[i]%2!=0:\r\n print(i+1)\r\n\r\nelse:\r\n for i in range(3,n):\r\n if arr[i]%2==0:\r\n print(i+1)\r\n", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nodd=[]\r\neven=[]\r\nfor i in range(len(lis)):\r\n if(lis[i]%2==0):\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\nif(len(odd)==1):\r\n print(odd[0]+1)\r\nelse:\r\n print(even[0]+1)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nfor i in a:\r\n if i%2==0:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nif len(b)==1:\r\n e=b[0]\r\nif len(c)==1:\r\n e=c[0]\r\nprint(a.index(e)+1)", "n = int(input())\nl = list(map(int,input().split()))\nfor i in range(len(l)):\n l[i] = l[i]%2\nif l.count(0) == 1:\n print(l.index(0)+1)\nelif l.count(1) == 1:\n print(l.index(1)+1)\n\t\t \t \t\t \t\t \t\t \t\t \t\t \t\t", "n=int(input())\r\na=map(int,input().split())\r\nb=[]\r\nfor i in a:\r\n if i%2:\r\n b.append(1)\r\n else:\r\n b.append(0)\r\nif b.count(1)==n-1:\r\n print(b.index(0)+1)\r\nelse:\r\n print(b.index(1)+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nce=0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n ce+=1\r\n e=i \r\n else:\r\n o=i \r\nif(ce==n-1):\r\n print(o+1)\r\nelse:\r\n print(e+1)", "n = int(input())\ncontP = contI = 0\nindexP = []\nindexI = []\na = [int(i) for i in input().split()]\nfor j in range(len(a)):\n if a[j] % 2 == 0:\n contP += 1\n indexP.append(a[j])\n else:\n contI += 1\n indexI.append(a[j])\nif contP == 1:\n print(a.index(indexP[0]) + 1)\nelse: print(a.index(indexI[0]) + 1)\n \t\t \t \t \t\t \t \t \t\t \t\t \t\t\t \t", "n = map(int, input())\nnums = map(int, input().split())\nodd = []\neven = []\nfor i, num in enumerate(nums):\n if num % 2 == 0:\n even.append((i, num))\n else:\n odd.append((i, num))\n\nif len(even) == 1:\n print(even[0][0] + 1)\nelse:\n print(odd[0][0] + 1)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nch=[]\r\nnch=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n ch.append(i)\r\n q=i+1\r\n else:\r\n nch.append(i)\r\n w=i+1\r\nif len(ch)!=len(nch):\r\n if len(ch)>len(nch):\r\n print(int(w))\r\n w=i+1\r\n else:\r\n print(int(q))\r\n\r\n", "input()\nnums = [int(x) for x in input().split()]\nod = 0\nev = 0\nfor x in nums[:3]:\n\tif x % 2 == 0:\n\t\tev += 1\n\telse:\n\t\tod += 1\nif od <=1:\n\tlef = 1\nelse:\n\tlef = 0\nfor i in range(len(nums)):\n\tif nums[i] % 2 == lef:\n\t\tprint(i + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nco=0\r\nce=0\r\nfor i in a:\r\n if i%2==0:\r\n ce+=1\r\n else:\r\n co+=1\r\nif(co>ce):\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n exit()\r\nelse:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n print(i+1)\r\n exit()\r\n ", "t = int(input())\r\n\r\nlist = [int(i) for i in input().split()]\r\n\r\ne = 0\r\no = 0\r\n\r\nfor i in range(t):\r\n if list[i]%2 == 0:\r\n x = i\r\n e += 1\r\n else:\r\n o += 1\r\n y = i\r\n if e > 1 and o == 1:\r\n break\r\n if o > 1 and e == 1:\r\n break\r\n \r\nif e == 1:\r\n print(x+1)\r\nelse:\r\n print(y+1)\r\n\r\n", "ar = lambda : list(map(int , input().split()))\r\nal = lambda : map(int , input().split())\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\ne= []\r\no=[]\r\nfor i in l:\r\n if i %2==0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\n\r\nif len(e) == 1:\r\n print(l.index(e[0]) +1)\r\nelse:\r\n print(l.index(o[0]) + 1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nnumbers_are_even = sum(num % 2 == 0 for num in numbers[:3]) > 1\r\n\r\nfor i, num in enumerate(numbers):\r\n num_is_even = num % 2 == 0\r\n unique_found = (numbers_are_even and not num_is_even or\r\n not numbers_are_even and num_is_even)\r\n \r\n if unique_found:\r\n print(i+1)\r\n break", "n = int(input())\r\narr = list(map(int,input().split()))\r\neven,odd=[],[]\r\nfor i in arr:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(odd)==1:\r\n print(arr.index(odd[0])+1)\r\nelse:\r\n print(arr.index(even[0])+1)\r\n", "n=int(input(''))\r\ns=input('')\r\nl=s.split(' ')\r\nl=list(map(int,l))\r\neven=0\r\nodd=0\r\ne=[]\r\no=[]\r\nfor i in l:\r\n if i%2==0:\r\n even+=1\r\n e.append(i)\r\n else:\r\n odd+=1\r\n o.append(i)\r\nif(even==1):\r\n print(l.index(e[0])+1)\r\nelse:\r\n print(l.index(o[0])+1)", "a=int(input())\r\nx=list(map(int,input().split()))\r\nans=False\r\nif (x[0]%2==0 and x[1]%2==0) or (x[0]%2==0 and x[2]%2==0) or (x[1]%2==0 and x[2]%2==0):\r\n ans=True\r\nfor i in range(len(x)):\r\n if ans==False:\r\n if x[i]%2==0:\r\n print(i+1)\r\n else:\r\n if x[i]%2!=0:\r\n print(i+1)", "n=int(input())\r\nL=input().split()\r\neven=[]\r\nodd=[]\r\nfor i in L:\r\n if int(i)%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(even)==1:\r\n print(L.index(even[0])+1)\r\nelse:\r\n print(L.index(odd[0])+1)\r\n", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nl=[]\r\nfor i in nums:\r\n if i%2==0:\r\n l.append('e')\r\n else:\r\n l.append('o')\r\nif l.count('o')==1:\r\n print(l.index('o')+1)\r\nelse:\r\n print(l.index('e')+1)", "n = int(input())\r\nlis = input().split()\r\nodd = []\r\neven = []\r\nfor i, j in enumerate(lis):\r\n if int(j) % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(odd) == 1:\r\n print(odd[0] + 1)\r\nelse:\r\n print(even[0] + 1)", "n = int(input())\r\ns = list(map(lambda x:int(x)%2 ,input().split()))\r\nif s.count(1) == 1:\r\n print(s.index(1)+1)\r\nelse:\r\n print(s.index(0)+1)", "n = input()\r\nnumbers = input().split()\r\n_2 = [numbers[i] for i in range(len(numbers)) if int(numbers[i]) % 2 == 0]\r\n_1 = [numbers[i] for i in range(len(numbers)) if int(numbers[i]) % 2 != 0]\r\nif len(_2) > len(_1):\r\n a = _1[0]\r\nelse:\r\n a = _2[0]\r\nfor i in range(len(numbers)):\r\n if numbers[i] != a:\r\n continue\r\n else:\r\n break\r\nprint(i + 1)\r\n", "n = int(input())\r\n\r\ns = input()\r\n\r\ndatos_aux = s.split(' ')\r\ndatos = []\r\nfor i in range(n):\r\n datos.append(int(datos_aux[i]))\r\n\r\npar = 0\r\nimpar = 0\r\nultimo_par = 0\r\nultimo_impar = 0\r\n\r\nfor i in range(n):\r\n if(datos[i]%2 == 0):\r\n ultimo_par = i \r\n par = par + 1\r\n else:\r\n ultimo_impar = i\r\n impar = impar + 1\r\n\r\nif(par == 1):\r\n print(ultimo_par + 1)\r\nelse:\r\n print(ultimo_impar + 1)\r\n", "t = int(input())\r\nli = input().split()\r\ncount = 0\r\nindex = 0\r\nfor i in range(len(li)):\r\n li[i]=int(li[i])\r\n if li[i]%2 == 0 :\r\n count+=1\r\n\r\nif count == 1:\r\n for i in range(t):\r\n if li[i] % 2 == 0:\r\n index = i + 1\r\n break\r\nelse:\r\n for i in range(t):\r\n if li[i] % 2 != 0:\r\n index = i + 1\r\n break\r\nprint(index)\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nif arr[0]%2 == arr[1]%2 == arr[2]%2:\r\n flag=arr[0]&1\r\n for i in range(3,n):\r\n if (arr[i]&1)!=flag:\r\n print(i+1)\r\nelif arr[0]%2 == arr[1]%2:\r\n print(3)\r\nelif arr[0]%2 == arr[2]%2:\r\n print(2)\r\nelif arr[1]%2 == arr[2]%2:\r\n print(1)\r\n", "input()\r\na = [int(x) % 2 for x in input().split()]\r\nprint(a.index(int(a.count(1) == 1)) + 1)", "# A. IQ тест\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\nother1 = []\r\nother2 = []\r\nfor i in range(len(numbers)):\r\n if numbers[i] % 2 == 0:\r\n other2.append(i)\r\n else:\r\n other1.append(i)\r\nif len(other1) < len(other2):\r\n print(other1[0] + 1)\r\nelse:\r\n print(other2[0] + 1)", "length = int(input())\neven = []\nodd = []\nfor i, value in enumerate(list(map(int, input().split()))):\n if value % 2 == 0:\n even.append(i)\n else:\n odd.append(i)\n\nif len(even) == 1:\n print(even[0]+1)\nelse:\n print(odd[0]+1)\n", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\nl = list(map(lambda x: x%2 ,l))\r\nif(sum(l)==1):\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)", "\r\ntest = int(input())\r\n\r\nseq = list(input().split(' '))\r\n\r\nev = []\r\nod = []\r\n\r\nfor num in seq:\r\n if int(num) % 2 == 0:\r\n ev.append(num)\r\n else:\r\n od.append(num)\r\n\r\nif len(ev) == 1:\r\n print(seq.index(ev[0]) + 1)\r\n\r\nelif len(od) == 1:\r\n (print(seq.index(od[0]) + 1))", "n = int(input())\r\na = input().split()\r\ncountj = 0\r\ncounto = 0\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n if a[i]%2 == 0:\r\n counto += 1\r\n else:\r\n countj += 1\r\n\r\nif counto > countj:\r\n for i in range(n):\r\n if a[i]%2 != 0:\r\n x = a[i]\r\n print(a.index(x)+1)\r\nelse:\r\n for i in range(n):\r\n if a[i]%2 == 0:\r\n x = a[i]\r\n print(a.index(x)+1)", "num = int(input())\nl = list(input().split(\" \"))\neven = odd = []\neven = [l[i] for i in range(len(l)) if int(l[i]) % 2 == 0]\nodd = [l[i] for i in range (len(l)) if int(l[i]) % 2 != 0]\nif(len(even) == 1) : print(l.index(even[0]) + 1)\nelse : print(l.index(odd[0]) + 1)\n", "n = int(input())\nnumbers = list(map(int, input().split(' ')))\nlist_num = []\n\n\nfor number in numbers:\n list_num.append(number % 2 )\n\nif len(numbers) == n:\n if list_num.count(1) == 1: \n print(list_num.index(1) +1)\n elif list_num.count(0) == 1: \n print(list_num.index(0) +1)\n", "n=int(input())\r\nl=[int(l)%2 for l in input().split() ]\r\nif sum(l)==1:\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\noddArr, evenArr = [], []\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n evenArr.append(i+1)\r\n else:\r\n oddArr.append(i+1)\r\nif len(oddArr) > len(evenArr):\r\n print(evenArr[0])\r\nelse:\r\n print(oddArr[0])\r\n", "n = int(input())\r\ns = [int(a) for a in input().split()]\r\nx =0\r\ny = 0\r\nm = 0\r\nn = 0\r\nfor i in s :\r\n if i%2 == 0:\r\n x += 1\r\n m = i\r\n else :\r\n y += 1\r\n n = i\r\nif x > y :\r\n print(s.index(n)+1)\r\nelse :\r\n print(s.index(m)+1)", "n=int(input())\r\nnum=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor i in range(n):\r\n if num[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even == 1:\r\n print(num.index(next(numb for numb in num if numb % 2 == 0)) + 1)\r\nelse:\r\n print(num.index(next(numb for numb in num if numb % 2 != 0)) + 1)", "\r\n# это задача 25A\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nc = []\r\nnc = []\r\nfor i in a:\r\n if i % 2 == 0:\r\n c.append(i)\r\n else:\r\n nc.append(i)\r\nif len(c) == 1:\r\n print(a.index(c[0])+1)\r\nif len(nc) == 1:\r\n print(a.index(nc[0])+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nce=co=0\r\nfor i in l:\r\n if i%2==0:\r\n ce=ce+1\r\n m1=i\r\n else:\r\n co+=1\r\n m2=i\r\nif ce<co:\r\n print(l.index(m1)+1)\r\nelse:\r\n print(l.index(m2)+1)", "line = int(input())\r\na = [int(x) for x in input().split()]\r\ngenapcount = 0\r\nganjilcount = 0\r\ndef genap(x):\r\n if x % 2 == 0:\r\n return True\r\n else:\r\n return False\r\nfor i in range(len(a)):\r\n if genap(a[i]):\r\n genapcount += 1\r\n else:\r\n ganjilcount += 1\r\nif genapcount == 1:\r\n for j in range(len(a)):\r\n if genap(a[j]):\r\n print(j + 1)\r\nelse:\r\n for j in range(len(a)):\r\n if genap(a[j]) == False:\r\n print(j + 1) ", "size = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\neven = []; odd = []\r\n\r\nfor i in range(size):\r\n if nums[i] % 2 == 0:\r\n even.append(nums[i]); even.append(i)\r\n elif nums[i] % 2 == 1:\r\n odd.append(nums[i]); odd.append(i)\r\n\r\nif len(even) == 2: print(even[1] + 1)\r\nelif len(odd) == 2: print(odd[1] + 1)", "import itertools as it\nn = int(input())\nl = [int(x) for x in input().split()]\nl = [x for x in zip(l, range(n))]\nodd = [x for x in l if x[0] % 2]\neven = [x for x in l if x[0] % 2 == 0]\nif len(odd) == 1:\n\tprint(odd[0][1] + 1)\nelse:\n\tprint(even[0][1] + 1)\n", "for i in range(int(input())):\r\n l=[int(i) for i in input().split()]\r\n r=0\r\n y=0\r\n for i in l:\r\n if i%2==0 and r==0:\r\n r+=1\r\n a=l.index(i)\r\n elif i%2!=0 and 0==0:\r\n y+=1\r\n b=l.index(i)\r\n elif i%2==0:\r\n r+=1\r\n elif i%2!=0:\r\n y+=1\r\n if r==1:\r\n print(a+1)\r\n break\r\n if y==1:\r\n print(b+1)\r\n break", "n = int(input())\r\nxs = list(map(int, input().split()))\r\n\r\n\r\nprev = None\r\nfor i in range(len(xs) - 1):\r\n if xs[i] % 2 == xs[i + 1] % 2:\r\n prev = xs[i] % 2\r\n continue\r\n\r\n # Not same\r\n if prev is None:\r\n prev = xs[i + 2] % 2\r\n\r\n if prev == xs[i] % 2:\r\n print(i + 2)\r\n else:\r\n print(i + 1)\r\n break\r\n", "I = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(I())\r\no = list(filter(lambda x: x%2, a))\r\ne = list(filter(lambda x: not x%2, a))\r\nif len(o) == 1:\r\n\tprint(a.index(*o)+1)\r\nelse:\r\n\tprint(a.index(*e)+1)", "n = int(input())\ndigits = list(map(int , input().split()))\n\ndef main():\n\n\tdata = { \"odd\":[-1, 0] , \"even\":[-1 , 0] }\n\tfor i in range(len(digits)):\n\t\tif digits[i] % 2 != 0:\n\t\t\t\tdata[\"odd\"][0] = i\n\t\t\t\tdata[\"odd\"][1] += 1\n\t\telse:\t\n\t\t\tdata[\"even\"][0] = i\n\t\t\tdata[\"even\"][1] += 1\n\tfor values in data.values():\n\t\tif values[1] == 1:\n\t\t\tprint (values[0] + 1)\n\t\telse:\n\t\t\tpass \n\nif __name__ == \"__main__\":\n\tmain()\n", "n=int(input())\r\nodd=0\r\neven=0\r\nc=0\r\nind=0\r\na=list(map(int,input().split(\" \")))\r\nfor i in range(len(a)):\r\n if(a[i]%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\nif(even>odd):\r\n c=1\r\nif(c==0):\r\n for g in range(len(a)):\r\n if(a[g]%2==0):\r\n ind=g\r\n break\r\nelse:\r\n for g in range(len(a)):\r\n if(a[g]%2!=0):\r\n ind=g\r\n break\r\nprint(g+1)\r\n \r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nres = [i % 2 for i in a]\r\n\r\nif sum(res) == 1:\r\n print(res.index(1) + 1)\r\nelse:\r\n print(res.index(0) + 1)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nevens, odds = 0, 0\r\nevenIndex, oddIndex = 0, 0\r\nfor i in range(n):\r\n if nums[i] % 2 == 0:\r\n evens += 1\r\n evenIndex = i\r\n else:\r\n odds += 1\r\n oddIndex = i\r\nif evens > odds:\r\n print(oddIndex + 1)\r\nelse:\r\n print(evenIndex + 1)", "input()\r\na=list(map(int,input().split()))\r\nd={0:[],1:[]}\r\nfor i,ai in enumerate(a,1):\r\n d[ai%2].append(i)\r\nprint(d[0][0] if len(d[0])==1 else d[1][0])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 12 19:06:00 2021\r\n\r\n@author: nijhum\r\n\"\"\"\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nl = [i % 2 for i in l]\r\nif l.count(0) == 1:\r\n print(l.index(0) + 1)\r\nelse:\r\n print(l.index(1) + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n if i%2==0:\r\n c=c+1\r\nd=n-c\r\nif c>d:\r\n for i in l:\r\n if i%2==1:\r\n print(l.index(i)+1)\r\nelse:\r\n for i in l:\r\n if i%2==0:\r\n print(l.index(i)+1)\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split(\" \")))\r\n\r\nisEven = 0\r\nisOdd = 0\r\n\r\nfor i in a:\r\n if i % 2 == 0:\r\n isEven += 1\r\n else:\r\n isOdd += 1\r\n\r\nif isEven > isOdd:\r\n for i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n print(i+1)\r\n break\r\n \r\nelse:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n\r\n", "int(input())\r\nlist1 = list(map(int,input().split()))\r\nlist2 = list(map(lambda x:1*(x%2==0),list1))\r\nprint(list2.index(0)+1 if list2.count(0)==1else 1+list2.index(1))", "\r\ndef solve(numbers):\r\n first, second = next(numbers), next(numbers)\r\n\r\n if (first ^ second) & 1 == 1:\r\n third = next(numbers)\r\n return 1 if (third ^ second) & 1 == 0 else 2\r\n else:\r\n return next(i for i, x in enumerate(numbers, 3) if (first ^ x) & 1 == 1)\r\n\r\n\r\ndef main(): \r\n _ = input()\r\n numbers = map(int, input().split())\r\n print(solve(numbers))\r\n\r\n\r\nmain()\r\n", "n=int(input())\r\nm=[int(x) for x in input().split()]\r\na=0\r\nfor i in range(n):\r\n if m[i]%2==0:\r\n a=a+1\r\nif a==1:\r\n for i in range(n):\r\n if m[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if m[i]%2!=0:\r\n print(i+1)", "n = int(input())\na = [int(x) for x in input().split()]\nevenOdds = {0:[],1:[]}\nfor idx,num in enumerate(a):\n evenOdds[num%2].append(idx)\nif len(evenOdds[0])==1:\n print(evenOdds[0][0]+1)\nelse:\n print(evenOdds[1][0]+1)", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n co, ce, lo, le = 0, 0, 0, 0\r\n for i in range(n):\r\n if arr[i] % 2 == 1:\r\n co += 1\r\n lo = i+1\r\n else:\r\n ce += 1\r\n le = i+1\r\n if co == 1:\r\n print(lo)\r\n else:\r\n print(le)\r\n\r\n\r\nmain()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif l[0]%2==0:\r\n if l[1]%2==0:\r\n for r in range(2,n):\r\n if l[r]%2!=0:\r\n print(r+1)\r\n else:\r\n if l[2]%2==0:\r\n print(\"2\")\r\n else:\r\n print(\"1\")\r\nelse:\r\n if l[1]%2==0:\r\n if l[2]%2==0:\r\n print(\"1\")\r\n else:\r\n print(\"2\")\r\n else:\r\n for r in range(2,n):\r\n if l[r]%2==0:\r\n print(r+1)", "def get_int():\r\n return int(input())\r\ndef get_nums():\r\n return list(map(int, input().split()))\r\ndef main():\r\n n = get_int()\r\n nums = get_nums()\r\n odds = []\r\n evens = []\r\n for index, value in enumerate(nums):\r\n if value % 2 == 0:\r\n evens.append(index + 1)\r\n else:\r\n odds.append(index + 1)\r\n if len(odds) == 1:\r\n print(odds[0])\r\n else:\r\n print(evens[0])\r\n \r\n \r\n \r\nmain()\r\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\ns = []\r\nd = []\r\nfor i in range(len(l)):\r\n\tif l[i] % 2 == 0:\r\n\t\ts.append(i+1)\r\n\telse:\r\n\t\td.append(i+1)\r\n\r\n\tif len(s) >= 2:\r\n\t\ttry:\r\n\t\t\tprint(d[0])\r\n\t\t\tbreak\r\n\t\texcept:\r\n\t\t\tpass\r\n\telif len(d) >= 2:\r\n\t\ttry:\r\n\t\t\tprint(s[0])\r\n\t\t\tbreak\r\n\t\texcept:\r\n\t\t\tpass", "a=input()\r\nb=[*map(int,input().split())]\r\ncount=0\r\nfor c in range(3):\r\n if b[c]%2==0:\r\n count+=1\r\nif count>=2:\r\n for i in range(len(b)):\r\n if b[i]%2 != 0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(b)):\r\n if b[i]%2 == 0:\r\n print(i+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a\r\nfor i in range(n):\r\n a[i]=a[i]%2\r\nfor i in range(n):\r\n d=0\r\n for j in range(n):\r\n if(a[i]%2!=a[j]%2 and i!=j):\r\n d+=1\r\n if(d>1):\r\n print(i+1)\r\n break", "n = int(input())\r\nodd = 0\r\nindo = 0\r\neven = 0\r\ninde = 0\r\ni = 1\r\nfor a1 in input().split(\" \"):\r\n if int(a1) % 2 == 0:\r\n even += 1\r\n inde = i\r\n else:\r\n odd += 1\r\n indo = i\r\n if even > 1:\r\n if odd == 1:\r\n print(indo)\r\n break\r\n if odd > 1:\r\n if even == 1:\r\n print(inde)\r\n break\r\n i += 1\r\n \r\n", "def A25(a:list):\r\n even = 1 if sum([x%2 for x in a[:3]]) <= 1 else 0\r\n for i, nb in enumerate(a):\r\n if nb%2 == even:\r\n return i+1\r\n \r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n print(A25(a))", "n = int(input())\r\na = map(int,input().split())\r\n\r\n\r\nlst = []\r\nodd = 0\r\neven = 0\r\nidx = 0\r\nfor i in a:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n \r\n lst.append(i)\r\n\r\nif even > odd:\r\n for x in lst:\r\n idx += 1\r\n if x % 2 !=0:\r\n break\r\nif odd > even:\r\n for y in lst:\r\n idx += 1\r\n if y % 2 ==0:\r\n break\r\nprint(idx)\r\n\r\n \r\n", "l=[]\r\nm=[]\r\nev=0\r\nod=0\r\ncount=0\r\nn=int(input())\r\nls=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(ls[i]%2==0):\r\n ev+=1\r\n l.append(i+1)\r\n else:\r\n od+=1\r\n m.append(i+1)\r\nif(len(l)>len(m)):\r\n # m=m+1\r\n print(*m)\r\nelse:\r\n # l=l+1\r\n print(*l)\r\n", "input()\r\ndata = input().split()\r\ndata = [int(x) for x in data]\r\ndata = [x%2 for x in data]\r\nif data.count(0) > data.count(1):\r\n print(data.index(1)+1)\r\nelif data.count(0) < data.count(1):\r\n print(data.index(0)+1)", "import math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n\r\ndef inum():\r\n return map(int,input().split())\r\n \r\n\r\nn = int(input())\r\nl = ilst()\r\n\r\nif l[0]%2 != l[1]%2:\r\n if l[0]%2 == l[2]%2:\r\n print(2)\r\n else:\r\n print(1)\r\nelif l[-1]%2 != l[-2]%2:\r\n if l[-1]%2 == l[-3]%2:\r\n print(n-1)\r\n else:\r\n print(n)\r\nelse:\r\n for i in range(1,n-1):\r\n if l[i]%2 != l[i-1]%2:\r\n if l[i]%2 == l[i+1]%2:\r\n print(i)\r\n else:\r\n print(i+1)\r\n break", "n = int(input())\r\nl = list(map(int, input().split()))\r\np = []\r\nind1 = 0\r\nind2 = 0\r\nfor i in range(0, n):\r\n p.append(l[i]%2)\r\n if (l[i]%2 == 0): ind1=i\r\n else: ind2 = i\r\nif p.count(0) == 1:\r\n print(ind1+1)\r\nelse:\r\n print(ind2+1)", "n = int(input())\nnums = [int(i) for i in input().split()]\n\ndef solve(nums, n):\n l = {'odds':0, 'evens':0}\n for i in nums[0:3]:\n if i % 2 == 0:\n l['evens'] += 1\n else:\n l['odds'] += 1\n\n if l['odds'] > l['evens']:\n parity = 'even'\n else:\n parity = 'odd'\n\n for idx in range(n):\n num = nums[idx]\n if (num % 2 == 0 and parity == 'even') or (num % 2 == 1 and parity == 'odd'):\n return idx + 1\n\nanswer = solve(nums, n)\nprint(answer)\n \n", "n=int(input())\r\nh=[int(X) for X in input().split()]\r\ne=[]\r\no=[]\r\nfor i in h:\r\n if(i%2==0):\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif(len(e)<len(o)):\r\n print(h.index(e[0])+1)\r\nelse:\r\n print(h.index(o[0])+1)\r\n ", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nod=[]\r\nev=[]\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n ev+=[i]\r\n else:\r\n od+=[i]\r\nif(len(ev)==1):\r\n print(ev[0]+1)\r\nelse:\r\n print(od[0]+1)", "\r\nn = int(input())\r\nnums = [int(x) for x in input().split()]\r\nevens = len(list(filter(lambda x:x%2==0, nums)))\r\nodds = len(list(filter(lambda x:x%2!=0, nums)))\r\nif odds > evens:\r\n print(nums.index(list(num for num in nums if num%2==0)[0]) + 1)\r\nelse:\r\n print(nums.index(list(num for num in nums if num%2!=0)[0]) + 1)\r\n\r\n\r\n\r\n", "k=int(input())\r\neven=0\r\nodd=0\r\nl=list(map(int,input().split()))\r\nfor i in range(0,3):\r\n if l[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even<odd:\r\n for i in range(k):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(k):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n break", "n=int(input())\r\na=None\r\nb=None\r\nlst=list(map(int, input().split()))\r\nfor i in range(n):\r\n if lst[i]%2:\r\n if b!=None:\r\n ev=True\r\n else:\r\n b=i\r\n else:\r\n if a!=None:\r\n ev=False\r\n else:\r\n a=i\r\nif ev:\r\n print(a+1)\r\nelse:\r\n print(b+1)\r\n", "num = int(input())\r\n\r\nnumbers = list(map(int, input().split()))\r\nresult1 = []\r\nresult2 = []\r\n\r\nfor i in range(num):\r\n\tif numbers[i]%2 == 0:\r\n\t\tresult2.append(numbers[i])\r\n\telse:\r\n\t\tresult1.append(numbers[i])\r\nfor i in range(num):\r\n\tif len(result1) > len(result2):\r\n\t\tif numbers[i] == result2[0]:\r\n\t\t\tprint(i+1)\r\n\t\t\tquit()\r\n\telse:\r\n\t\tif numbers[i] == result1[0]:\r\n\t\t\tprint(i+1)\r\n\t\t\tquit()\r\n\t", "s=int(input())\r\na=[int(i) for i in input().split()]\r\ne=0\r\no=0\r\nfor i in a:\r\n if i%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\n if e>1 or o>1:\r\n break\r\n\r\nif e>1:\r\n for i in range(len(a)):\r\n if a[i]%2!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\n \r\n ", "n=int(input())\r\nnums=list(map(int,input().split()))\r\ne=[]\r\no=[]\r\ni=0\r\nwhile i<len(nums):\r\n x=nums[i]\r\n if x%2==0:\r\n e.append(i+1)\r\n else:\r\n o.append(i+1)\r\n i=i+1\r\nif len(e)==1:\r\n print(e[0])\r\nelse:\r\n print(o[0])", "n = int(input())\r\nm = [int(x) for x in input().split()]\r\nif (m[0] + m[1]) % 2 == 0:\r\n x = m[1] % 2\r\n for i in range(n):\r\n if m[i] % 2 != x:\r\n print(i+1)\r\n break\r\nelse:\r\n if m[0]%2 == m[2]%2:\r\n print(2)\r\n else:\r\n print(1)", "import math\n\n\ndef main(data):\n for i in range(len(data)):\n data[i] %= 2\n num_zero = data.count(0)\n if num_zero == 1:\n return data.index(0) + 1\n else:\n return data.index(1) + 1\n\n\nif __name__ == '__main__':\n n = int(input())\n data = list(map(int, input().split(\" \")))\n print(main(data))\n", "a,b=[],[]\r\nn=int(input())\r\n*lis,=map(int,input().split())\r\nm=[]\r\nfor i,j in enumerate(lis):\r\n if j%2==0:\r\n a.append(i+1)\r\n m.append(j%2)\r\n else:\r\n b.append(i+1)\r\n m.append(j%2)\r\nif m.count(0)==1:\r\n print(*a)\r\nelse:\r\n print(*b)\r\n", "# _inputs = ['5', '1 4 6 8 10']\r\n_inputs = [input(), input()]\r\n\r\nnums = [int(x) for x in _inputs[1].split()]\r\ncounter = {\r\n 0: {\r\n 'count': 0,\r\n 'pos': -1\r\n },\r\n 1: {\r\n 'count': 0,\r\n 'pos': -1\r\n }\r\n}\r\n\r\nfor i, num in enumerate(nums):\r\n counter[num%2]['count'] += 1\r\n counter[num%2]['pos'] = i\r\n\r\n if counter[0]['count'] != 0 and counter[1]['count'] != 0 and counter[0]['count'] != counter[1]['count']:\r\n if counter[0]['count'] < counter[1]['count']:\r\n print(counter[0]['pos']+1)\r\n else:\r\n print(counter[1]['pos']+1)\r\n exit()\r\n\r\n\r\n", "num = int(input())\r\ntasks = input().split()\r\n\r\nodd = list()\r\nevent = list()\r\nfor num in tasks:\r\n if int(num)%2==0:\r\n event.append(num)\r\n else:\r\n odd.append(num)\r\n\r\nif len(odd) == 1:\r\n print(tasks.index(odd[0])+1)\r\nelse:\r\n print(tasks.index(event[0])+1)", "def myfun(n,arr):\r\n for i in range(0,len(arr)):\r\n arr[i]=arr[i]%2\r\n ones=arr.count(1)\r\n zeroes=arr.count(0)\r\n if arr.count(1)==1:\r\n return arr.index(1)+1\r\n elif arr.count(0)==1:\r\n return arr.index(0)+1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(myfun(n,arr))\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\npos=0\r\npos1=0\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n x += 1\r\n pos = i + 1\r\n if(a[i]%2!=0):\r\n y += 1\r\n pos1 = i + 1\r\n\r\nif(x==1):\r\n print(pos)\r\nelse:\r\n print(pos1)\r\n \r\n", "n=input()\r\narr=[]\r\narr=(input().split())\r\neven=0\r\nodd=0\r\ne=0\r\no=0\r\nfor i in range(int (n)):\r\n if (int(arr[i])%2)==0:\r\n even+=1\r\n e=i\r\n else :\r\n odd+=1\r\n o=i\r\nif even==1:\r\n print(e+1)\r\nelse :\r\n print(o+1)\r\n", "n = int(input(''))\nlst = [int(i) for i in input('').split(' ')]\necnt, ocnt = 0,0\nfor i in range(3):\n if lst[i]%2 == 0:\n ecnt +=1\n else:\n ocnt +=1\nif ecnt > ocnt:\n s = 1\nelse:\n s = 0\nfor i,j in enumerate(lst):\n if j%2 == s:\n ind = i\n break\nprint(ind+1) \n\n ", "# -*- coding: utf-8 -*-\n\"\"\"IQtest.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1tGzDLjugScCTKtHAckd-T3-4FOqQokkJ\n\"\"\"\n\nn = int(input())\ndata = list(map(int, input().split()))\nidx = 3\nif data[0] % 2 == 0:\n if data[1] % 2 == 0:\n while data[idx - 1] % 2 == 0:\n idx += 1\n print(idx)\n else:\n if data[2] % 2 == 0:\n print(2)\n else:\n print(1)\nif data[0] % 2 == 1:\n if data[1] % 2 == 1:\n while data[idx - 1] % 2 == 1:\n idx += 1\n print(idx)\n else:\n if data[2] % 2 == 1:\n print(2)\n else:\n print(1)", "n = int(input())\narr = [int(x) for x in input().split()]\nisEven = (arr[0] % 2 == 0 and arr[1] % 2 == 0) or (arr[0] % 2 == 0 and arr[2] % 2 == 0) or (arr[1] % 2 == 0 and arr[2] % 2 == 0)\nresp = 0\nfor i in range(n):\n if (isEven and arr[i] % 2 != 0) or (not isEven and arr[i] % 2 == 0):\n resp = i + 1\n break\nprint (resp)\n \t \t\t\t \t \t \t\t\t\t \t \t \t\t", "n=int(input())\r\nimport sys\r\na=list(map(int,input().split()))\r\no=0\r\ne=0\r\nif a[0]%2!=a[-1]%2:\r\n if a[-1]%2!=a[-2]%2:\r\n print(n)\r\n sys.exit()\r\n else:\r\n print(1)\r\n sys.exit()\r\nelse:\r\n for i in a :\r\n if i%2==1:\r\n o=o+1\r\n elif i%2==0:\r\n e=e+1\r\n if o*e!=0:\r\n print(a.index(i)+1)\r\n break", "amount = int(input())\r\narray = [int(s) for s in input().split()]\r\ncounter = [[] for i in range(2)]\r\nfor i in range(len(array)):\r\n counter[array[i] % 2].append(i)\r\n#print(counter)\r\nfor i in range(len(counter)):\r\n if len(counter[i]) == 1:\r\n print(counter[i][0] + 1)", "m=int(input())\r\nn=list(map(int,input().split()))\r\nans=[0]*(m)\r\nfor i in range(m):\r\n ans[i]=n[i]%2\r\nif sum(map(int,ans))==1:\r\n print(ans.index(1)+1)\r\nelse:\r\n print(ans.index(0)+1)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nchet = 0\r\nnechet = 0\r\nfor i in s:\r\n\tif i % 2 == 0:\r\n\t\tchet += 1\r\n\telse:\r\n\t\tnechet += 1\r\nif chet > nechet:\r\n\tfor i in s:\r\n\t\tif i % 2 != 0:\r\n\t\t\tprint(s.index(i)+1)\r\n\t\telse:\r\n\t\t\tpass\r\nelse:\r\n\tfor i in s:\r\n\t\tif i % 2 == 0:\r\n\t\t\tprint(s.index(i)+1)\r\n\t\telse:\r\n\t\t\tpass", "n = int(input())\nnums = input().split()\nif int(nums[0])%2 == 0 and int(nums[1])%2 == 0:\n e = \"e\"\nelif int(nums[0])%2 == 1 and int(nums[1])%2 == 1:\n e = \"o\"\nelse:\n if int(nums[2])%2 == 0:\n e = \"e\"\n else:\n e = \"o\"\nc = 0\nfor x in nums:\n c+=1\n if e == \"e\":\n if int(x)%2 == 1:\n print(c)\n if e == \"o\":\n if int(x)%2 == 0:\n print(c)\n", "n = input()\r\nn = int(n)\r\na = [int(a) for a in input().split()]\r\nc1 = 0\r\nc2 = 0\r\nfor i in a:\r\n if i%2==0:\r\n c1 = c1+1\r\n else:\r\n c2 = c2+1\r\n\r\nif c1>c2:\r\n for i in a:\r\n if i%2!=0:\r\n print(a.index(i)+1)\r\nelse:\r\n for i in a:\r\n if i%2==0:\r\n print(a.index(i)+1)\r\n", "n = int(input())\n\na = list(map(int,input().split()))\n\ncheck = a[0] & 1\nres = 0 \nfor i in range(1,len(a)):\n if a[i] & 1 != check:\n res = i + 1\n break\nif check != a[1] & 1:\n if a[2] & 1 == check:\n print(2)\n else:\n print(1)\nelse:\n print(res)\n \t\t \t\t\t\t \t \t\t\t \t\t\t \t\t\t \t\t\t", "n=int(input())\r\nnumber=[int(i) for i in input().split()]\r\nevenness=[i%2 for i in number]\r\nif evenness.count(0)==1:\r\n print(evenness.index(0)+1)\r\nif evenness.count(1)==1:\r\n print(evenness.index(1)+1)", "n = int(input())\na = list(map(int,input().split()))\nre =[]\nfor i in range(n):\n re.append(a[i]%2)\n\nnum0 = re.count(0)\nif num0==1:\n print(re.index(0)+1)\nelse:\n print(re.index(1)+1)", "def main() -> None :\r\n print(order_Of_Differ_Num(user_Input()))\r\n\r\n\r\ndef order_Of_Differ_Num(array) -> int :\r\n EVEN_NUM_ENTITIES = even_Num_Entities(array)\r\n ODD_NUM_ENTITIES = odd_Num_Entities(array)\r\n if len(EVEN_NUM_ENTITIES) == 1 : return EVEN_NUM_ENTITIES[0][0] + 1\r\n if len(ODD_NUM_ENTITIES) == 1 : return ODD_NUM_ENTITIES[0][0] + 1\r\n raise ValueError()\r\n\r\ndef even_Num_Entities(array) -> list[tuple[int]] :\r\n return list(filter(is_Even_Entity, enumerate(array)))\r\n\r\ndef is_Even_Entity(entity) -> bool :\r\n return entity[1]%2 == 0\r\n\r\ndef odd_Num_Entities(array) -> list[tuple[int]] :\r\n return list(filter(is_Odd_Entity, enumerate(array)))\r\n\r\ndef is_Odd_Entity(entity) -> bool :\r\n return entity[1]%2 == 1\r\n\r\n\r\ndef user_Input() -> list[int] :\r\n ignore_Line()\r\n return input_Array()\r\n\r\ndef ignore_Line() -> None :\r\n input()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split())) \r\n\r\n\r\nmain()", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nd=0\r\nl=[]\r\nlt=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n c+=1\r\n l.append(i+1)\r\n elif a[i]%2!=0:\r\n d+=1\r\n lt.append(i+1)\r\nfor i in l:\r\n if c==1:\r\n print(i)\r\nfor i in lt:\r\n if d==1:\r\n print(i)", "a = int(input())\r\ns = input().split()\r\ncount_ne_chet = 0\r\ncount_chet = 0\r\nfor i in range(len(s)):\r\n if int(s[i]) % 2 == 0:\r\n count_chet += 1\r\n elif int(s[i]) % 2 != 0:\r\n count_ne_chet += 1\r\nif count_chet > count_ne_chet:\r\n for i in range(len(s)):\r\n if int(s[i]) % 2 != 0:\r\n print(i+1)\r\n exit()\r\nelif count_ne_chet > count_chet:\r\n for i in range(len(s)):\r\n if int(s[i]) % 2 == 0:\r\n print(i+1)\r\n exit()", "a = int(input())\nc = list(map(int, input().split()))\nt = [c[i] % 2 for i in range(a)]\nif t.count(0) > 1:\n\tfor i in range(a):\n\t\tif t[i] == 1:\n\t\t\tprint(i+1)\n\t\t\tbreak\nelse:\n\tfor i in range(a):\n\t\tif t[i] == 0:\n\t\t\tprint(i+1)\n\t\t\tbreak", "import sys\nmy_file = sys.stdin\n#my_file = open(\"input.txt\", \"r\")\nn = int(my_file.readline())\na = [int(i) for i in my_file.readline().strip().split()]\neven = 0\nodd = 0\nfor i in range(n):\n if a[i]%2 == 0:\n even += 1\n if even == 2:\n break\nif even == 2:\n for i in range(n):\n if a[i]%2 != 0:\n print(i+1)\n break\nelse:\n for i in range(n):\n if a[i]%2 == 0:\n print(i+1)\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\ne = 0\r\nfor i in a:\r\n\te += 1 if i % 2 == 0 else 0\r\nres = 0\r\nfor i in range(n):\r\n\tif a[i] % 2 == 0:\r\n\t\tif e == 1:\r\n\t\t\tres = i + 1\r\n\t\t\tbreak;\r\n\telse:\r\n\t\tif e == n - 1:\r\n\t\t\tres = i + 1\r\n\t\t\tbreak;\r\nprint(res)\r\n\t\t\t", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nodd = [0, 0]\r\neven = [0, 0]\r\n\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even[0] += 1\r\n even[1] = i + 1\r\n else:\r\n odd[0] += 1\r\n odd[1] = i + 1\r\n\r\nif odd[0] == 1:\r\n print(odd[1])\r\nelse:\r\n print(even[1])\r\n", "if __name__ == '__main__':\r\n x = int(input())\r\n a=0\r\n b=0\r\n co=0\r\n ce=0\r\n ls = list(map(int,input().split()))\r\n for i in range(0,x):\r\n if ls[i]%2==0:\r\n a = i\r\n ce+=1\r\n else:\r\n b=i\r\n co+=1\r\n\r\n if ce>co:\r\n print(b+1)\r\n else:\r\n print(a+1)", "import sys\r\n\r\ndef get_numbers():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\ndef is_even(x):\r\n return x % 2 == 0\r\n\r\nn = int(input())\r\nnumbers = list(get_numbers())\r\neven_odd = list(map(is_even, numbers))\r\nevens = even_odd.count(True)\r\nodds = even_odd.count(False)\r\n\r\nif evens == 1:\r\n print(even_odd.index(True)+1)\r\nelse:\r\n print(even_odd.index(False)+1)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne,o=0,0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\nif(e>o):\r\n for i in range(n):\r\n if(l[i]%2!=0):\r\n print(i+1)\r\n break\r\nif(e<o):\r\n for i in range(n):\r\n if(l[i]%2==0):\r\n print(i+1)\r\n break", "n=int(input())\r\nL=[int(x) for x in input().split()]\r\nm=0\r\nn=0\r\np=[]\r\nq=[]\r\nfor i in range(len(L)):\r\n if L[i]%2==1:\r\n m=m+1\r\n p.append(L[i])\r\n else:\r\n n=n+1\r\n q.append(L[i])\r\nif len(p)==1:\r\n num=L.index(p[0])+1\r\nelse:\r\n num=L.index(q[0])+1\r\nprint(num)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nfor i in range(0, len(nums)):\r\n even = 0\r\n odd = 0\r\n for j in range(0, len(nums)):\r\n if(abs(nums[i]-nums[j]) % 2 == 0 and i != j):\r\n even += 1\r\n else:\r\n odd += 1\r\n if(even == len(nums) or odd == len(nums)):\r\n print(i+1)\r\n break\r\n", "n=int(input())\r\nodd=0\r\neven=0\r\nnumbers=list(map(int,input().split()))\r\nfor number in numbers:\r\n\tif number%2==1:\r\n\t\todd+=1\r\n\telse:\r\n\t\teven+=1\r\nif even==1:\r\n\tfor number in numbers:\r\n\t\tif number%2==0:\r\n\t\t\tprint(numbers.index(number)+1)\r\nif odd==1:\r\n\tfor number in numbers:\r\n\t\tif number%2==1:\r\n\t\t\tprint(numbers.index(number)+1)\r\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\no = 0\r\ne = 0\r\nfor i in li:\r\n if i%2==0:\r\n e +=1 \r\n else:\r\n o +=1\r\nif e<o:\r\n for i in range(len(li)):\r\n if li[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(li)):\r\n if li[i]%2==1:\r\n print(i+1)", "n = input()\r\nn = int(n)\r\nc = input().split(' ')\r\ne = -1\r\no = -1\r\nd = -1\r\n\r\nfor j, i in enumerate(c):\r\n if int(i)%2 == 0:\r\n if e != -1:\r\n d = 0\r\n else:\r\n e = j+1\r\n else:\r\n if o != -1:\r\n d = 1\r\n else:\r\n o = j+1\r\n\r\n #print(e, o, d)\r\n if (e != -1) and (o != -1) and (d != -1):\r\n break\r\n\r\nif d == 0:\r\n print(o)\r\nelse:\r\n print(e)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\neven,c1,c2=[],0,0\r\nodd=[]\r\nfor i in range(n):\r\n if l[i]&1:\r\n \r\n odd.append(i+1)\r\n else: \r\n even.append(i+1)\r\nprint(odd[0] if len(odd)==1 else even[0]) \r\n ", "n= int(input())\r\na = list(map(int,input().split()))\r\nk=0\r\nl=0\r\nfor i in range(n):\r\n if a[i]%2 == 0:\r\n k+=1\r\n else:\r\n l+=1\r\nif k==1:\r\n for i in range(n):\r\n if a[i]%2 ==0:\r\n print(i+1)\r\n break\r\nif l==1:\r\n for i in range(n):\r\n if a[i]%2 ==1:\r\n print(i+1)\r\n break", "n=int(input())\r\nelist=[i%2 for i in map(int,input().split())]\r\nprint(elist.index([0,1][elist.count(1)==1])+1)\r\n", "x = int(input())\r\nev = 0\r\nod = 0\r\nelist = []\r\nolist = []\r\nelem = list(map(int, input().split()))\r\nfor i in elem:\r\n if i % 2 == 0:\r\n ev += 1\r\n elist.append(i)\r\n olist.append('0')\r\n else:\r\n od += 1\r\n elist.append('0')\r\n olist.append(i)\r\nif ev > od:\r\n for i in range(0, len(olist)):\r\n if olist[i] != '0':\r\n print(i + 1)\r\nif ev < od:\r\n for i in range(0, len(elist)):\r\n if elist[i] != '0':\r\n print(i + 1)\r\n# print(elist, olist, ev, od)\r\n", "n = int(input())\r\ninp = input().split(\" \")\r\nn_2 = 0\r\nne_2 = 0\r\nlist_ind = []\r\nc = 0\r\nfor el in inp:\r\n if int(el) % 2 == 0:\r\n c += 1\r\n list_ind.append(0)\r\n else:\r\n c -= 1\r\n list_ind.append(1)\r\nif c > 0:\r\n print(list_ind.index(1) + 1)\r\nelse:\r\n print(list_ind.index(0) + 1)", "n = int(input())\r\nli = list(map(int, input().split()))\r\nbinary = []\r\nfor i in li:\r\n binary.append(i%2)\r\nif(binary.count(0)>binary.count(1)):\r\n print(binary.index(1)+1)\r\nelse:\r\n print(binary.index(0)+1)\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\nlast_odd = -1\r\nlast_even = -1\r\nfor i in range(n) :\r\n if arr[i] % 2 == 0 :\r\n even += 1\r\n last_even = i\r\n else :\r\n odd += 1\r\n last_odd = i\r\n if even == 1 and odd > 1:\r\n print(last_even + 1)\r\n break\r\n if odd == 1 and even > 1 :\r\n print(last_odd + 1)\r\n break", "input()\r\ns = list(map(int, input().split(\" \")))\r\ns1 = [True if i%2==0 else False for i in s]\r\n\r\na = s1.count(True)\r\nb = s1.count(False)\r\nif(a>b):\r\n print(s1.index(False)+1)\r\nelse:\r\n print(s1.index(True) + 1)\r\n\r\n", "n = int (input ())\r\na = list (map (int, input ().split ()))\r\nchet = []\r\nnechet = []\r\n\r\n\r\nfor i in range (len (a)):\r\n\tif a[i]%2 == 0:\r\n\t\tchet.append (i)\r\n\telse:\r\n\t\tnechet.append (i)\r\n\r\n\r\nif len (chet) > len (nechet):\r\n\tprint (nechet[0] + 1)\r\nelse:\r\n\tprint (chet[0] + 1)", "t = input()\r\nn = int(t)\r\ns = input()\r\ntemp = s.split()\r\nnumberList = [int(i) for i in temp]\r\nevenIndex = []\r\noddIndex = []\r\nfor i in range(len(numberList)):\r\n if numberList[i] % 2 == 0:\r\n evenIndex.append(i)\r\n else:\r\n oddIndex.append(i)\r\n\r\nif len(evenIndex) == 1:\r\n print(evenIndex[0] + 1)\r\nelif len(oddIndex) == 1:\r\n print(oddIndex[0] + 1)\r\n", "n = int(input())\r\narr = list(map(int, input().strip().split()))\r\n \r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n arr[i]=0\r\n else:\r\n arr[i]=1\r\na=arr.count(0)\r\nb=arr.count(1)\r\nif a>b:\r\n print(arr.index(1)+1)\r\nelse:\r\n print(arr.index(0)+1)", "n_integers = int(input())\r\nintlst = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\nfor i in range(3):\r\n if intlst[i]%2 ==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif odd > even:\r\n for i in range(n_integers):\r\n if intlst[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(n_integers):\r\n if intlst[i]%2!=0:\r\n print(i+1)\r\n", "def solve(n, a):\n odds = list(filter(lambda x: x & 1, a))\n evens = list(filter(lambda x: x % 2 == 0, a))\n return a.index(odds[0]) + 1 if len(odds) == 1 else a.index(evens[0]) + 1\n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))\n\n\nmain()\n", "number_of_inputs = int(input())\nlist_of_input = list(map(int, input().split()))\n\neven = 0\nodd = 0\neven_index = 0\nodd_index = 0\n\nfor i in range(number_of_inputs):\n if list_of_input[i] % 2 == 0:\n even += 1\n even_index = i\n else:\n odd += 1\n odd_index = i\n\nif even < odd:\n print(even_index + 1)\n print()\nelse:\n print(odd_index + 1)\n print()\n\n\t \t \t \t \t\t\t\t\t\t \t \t \t\t\t\t \t", "n=int(input())\r\nM=[int(i) for i in input().split()]\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nfor i in range(n):\r\n if M[i]%2==0:\r\n a=a+1\r\n b=i\r\n elif M[i]%2==1:\r\n c=c+1\r\n d=i\r\nif a==1:\r\n print(b+1)\r\nelif c==1:\r\n print(d+1)", "number_of_input = int(input())\n\nlist_of_values = input().split()\n\nfor i in range(number_of_input):\n list_of_values[i] = int(list_of_values[i])\n\n\n\nfor i in range(0,number_of_input):\n try:\n if abs((list_of_values[i] - list_of_values[i-1]))%2 != 0 and (list_of_values[i] - list_of_values[i+1])%2 != 0:\n print(i+1)\n break\n else:\n continue\n except IndexError:\n print(number_of_input)\n\n\n\n\n\n\n\n", "n=input()\r\nx=input().split(' ')\r\n\r\nlst=[ int(i) for i in x ]\r\n\r\nodd=0\r\neven=0\r\nfor i in lst : \r\n if i%2==0:\r\n even+=1\r\n else: \r\n odd+=1\r\nif odd==1: \r\n for i in lst: \r\n if i%2!=0: \r\n print(lst.index(i)+1)\r\nif even==1: \r\n for i in lst: \r\n if i%2==0: \r\n print(lst.index(i)+1) \r\n ", "# iCoder-new (aka Ehs0n) and iCoder (aka M@hm@dull0)\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\ne = []\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n e.append('even')\r\n elif a[i] % 2 == 1:\r\n e.append('odd')\r\n\r\nif e.count('even') > e.count('odd'):\r\n print(e.index('odd') + 1)\r\nelif e.count('odd') > e.count('even'):\r\n print(e.index('even') + 1)\r\n", "import math\r\nc=int(input())\r\nl=input().split()\r\neven=0\r\nodd=0\r\nfor n in range(c):\r\n if int(l[n])%2==0:\r\n even+=10**n+10**c\r\n else:\r\n odd+=10**n+10**c\r\nprint(int(math.log10(min(even,odd)-10**c))+1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n l[i] = l[i] % 2\r\nprint([l.index(1) + 1,l.index(0) + 1][l.count(1)>l.count(0)])", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\neven = 0\r\nevenindex = []\r\nodd = 0\r\noddindex = []\r\nj = 0\r\nwhile(j<len(arr)):\r\n\tif (arr[j]%2==0):\r\n\t\teven = even+1\r\n\t\tevenindex.append(j)\r\n\telse:\r\n\t\todd = odd+1\r\n\t\toddindex.append(j)\r\n\tj = j+1\r\nif (even>odd):\r\n\tprint(oddindex[0]+1)\r\nelse:\r\n\tprint(evenindex[0]+1)\r\n", "n = int(input()) #qtd de números na task\ns = input().split(\" \")\n\ns = map(int, s)\ns = list(s)\n\nsz = len(s)\n\npar = 0\nimp = 0\n\n\nfor i in range(sz):\n if s[i]%2 == 0:\n par += 1\n else:\n imp += 1\n if par + imp > 2:\n break\n\nif par > 1:\n #encontra impar\n for i in range(sz):\n if s[i]%2 != 0:\n print(i+1)\n break\nelse:\n #encontra par\n for i in range(sz):\n if s[i]%2 == 0:\n print(i+1)\n break\n", "from typing import List\r\n\r\n\r\ndef solution(nums: List[int]):\r\n even_count = odd_count = 0\r\n even_pos = odd_pos = None\r\n\r\n for i, x in enumerate(nums):\r\n if x % 2 == 0:\r\n even_count += 1\r\n even_pos = i\r\n else:\r\n odd_count += 1\r\n odd_pos = i\r\n\r\n if even_count == 1:\r\n return even_pos + 1\r\n else:\r\n return odd_pos + 1\r\n\r\n\r\ndef main():\r\n _ = input()\r\n nums = [int(x) for x in input().split()]\r\n print(solution(nums))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=0\r\nj=0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n k+=1\r\n a=i\r\n else:\r\n j+=1\r\n b=i\r\nif(k==1):\r\n print(a+1)\r\nelse:\r\n print(b+1)", "#ashu@gate22\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nle=list(filter(lambda i: i%2==0,l))\r\nlo=list(filter(lambda i: i%2!=0,l))\r\nif len(le)==1:\r\n index=l.index(le[0])\r\nelse:\r\n index=l.index(lo[0])\r\nprint(index+1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nc=[]\r\nfor i in a:\r\n if i%2!=0:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nif len(b)==1:\r\n print(a.index(b[0])+1)\r\nelif len(c)==1:\r\n print(a.index(c[0])+1)\r\n ", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\neven = []\r\nodd = []\r\nprinted = False\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even.append(i+1)\r\n\r\n if len(odd) > 1:\r\n print(i+1)\r\n printed = True\r\n break\r\n else:\r\n odd.append(i+1)\r\n if len(even) > 1:\r\n print(i+1)\r\n printed = True\r\n break\r\n\r\nif not printed:\r\n if len(even) < len(odd):\r\n print(even[0])\r\n else:\r\n print(odd[0])", "# IQ TEST\r\nn = input()\r\narr = input().split(' ')\r\narr = list(map(int, arr))\r\n\r\narr = list(map(lambda x: x % 2, arr))\r\nif arr.count(0) == 1:\r\n print(arr.index(0) + 1)\r\nelse:\r\n print(arr.index(1) + 1)\r\n \r\n ", "n = int(input())\r\na = [int(i) % 2 for i in input().split()]\r\nif a.count(0) == 1:\r\n print(a.index(0) + 1)\r\nelse:\r\n print(a.index(1) + 1)", "n = int(input())\r\nline=[int(x)%2 for x in input().split()]\r\nif line.count(0)>line.count(1):\r\n print(line.index(1)+1)\r\nelse:\r\n print(line.index(0)+1)", "n = int(input())\nlist = [int(x) for x in input().split()]\neven = 0\nodd = 0\nfor i in range(len(list)):\n if list[i] % 2 == 0:\n even = even + 1\n pos_e = i + 1\n else:\n odd = odd + 1\n pos_o = i + 1\n\nif even == 1: print(pos_e)\nelif odd == 1: print(pos_o)\n \t\t \t \t \t\t \t\t\t\t\t \t", "n = input()\r\nl = input().split(' ')\r\nli = [int(n)%2 for n in l]\r\nif li.count(0) > 1:\r\n print(li.index(1)+1)\r\nelse:\r\n print(li.index(0)+1)\r\n", "n=int(input())\r\nlista=[int(i) for i in input().split()]\r\n\r\nsubset=lista[:3]\r\ncount_par=0\r\ncount_impar=0\r\nfor num in subset:\r\n if num%2==0:\r\n count_par=count_par+1\r\n else:\r\n count_impar=count_impar+1\r\n\r\nif count_par>count_impar:\r\n for i in range(n):\r\n if lista[i]%2==1:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if lista[i]%2==0:\r\n print(i+1)", "n = int(input())\r\narr1 = list(map(int,input().split(' ')[:n]))\r\ne = 0\r\no = 0\r\nfor item in arr1:\r\n if item % 2 == 0:\r\n e = e + 1\r\n else:\r\n o = o + 1\r\n\r\nif e > o:\r\n for i in range(len(arr1)):\r\n if arr1[i] % 2 != 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(arr1)):\r\n if arr1[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n", "def odd_one_out(arr, n):\r\n\tlast_odd = last_even = 0\r\n\ttotal_even = total_odd = 0\r\n\tfor i in range(len(arr)):\r\n\t\tif arr[i] & 1 == 0:\r\n\t\t\tlast_even = i\r\n\t\t\ttotal_even += 1\r\n\t\telse:\r\n\t\t\tlast_odd = i\r\n\t\t\ttotal_odd += 1\r\n\tif total_even == 1:\r\n\t\treturn last_even + 1\r\n\treturn last_odd + 1\r\n\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(odd_one_out(arr, n))", "n = int(input())\r\nl = list(map(int, input().split()))\r\ne = 0\r\no = 0\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n e += 1\r\n x = i+1\r\n else:\r\n o += 1\r\n y = i+1\r\nif e == 1:\r\n print(x)\r\nelif o == 1:\r\n print(y)\r\n", "x = int(input())\r\na = list(map(int, input().split()))\r\nec = 0\r\ne = []\r\noc = 0\r\no = []\r\nfor i in a:\r\n if i % 2 == 0:\r\n ec += 1\r\n e.append(a.index(i) + 1)\r\n else:\r\n oc += 1\r\n o.append(a.index(i) + 1)\r\nif ec > oc:\r\n print(o[0])\r\nelse:\r\n print(e[0])", "\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\ne = []\r\nfor i in range(len(a)):\r\n if a[i]%2 == 0:\r\n e.append('even')\r\n elif a[i]%2 == 1:\r\n e.append('odd')\r\n\r\nif e.count('even')>e.count('odd'):\r\n print(e.index('odd')+1)\r\nelif e.count('odd')>e.count('even'):\r\n print(e.index('even')+1) \r\n", "c = int(input())\r\n\n\n\r\nlista = []\r\n\npar = 0\n\r\nimpar = 0\r\n\r\n\n\n[lista.append(i) for i in input().split()]\r\n\r\n\n\nfor k in range(len(lista)):\n \r\n\tlista [k] = int (lista [k])\n\n\r\n\r\nfor j in range (len(lista)):\n \r\n\tif lista[j] % 2 == 0:\n \r\n\t\tpar += 1\n \r\n\t\tind_par = j\n \r\n\telse:\n \r\n\t\timpar += 1\n \r\n\t\tind_imp = j\n \r\n\r\n\nif par > impar:\n \r\n\tprint (ind_imp + 1)\r\n\r\n\nelse:\n \r\n\tprint (ind_par + 1)", "#https://codeforces.com/problemset/problem/25/A\r\n\r\ndef is_odd(number):\r\n if(number % 2 == 0):\r\n return False\r\n return True\r\n\r\namount_of_numbers = int(input())\r\nnumber_list = [int(x) for x in input().split(\" \")]\r\nodd_even_string = \"\"\r\nfor x in number_list:\r\n if(is_odd(x)):\r\n odd_even_string += \"o\"\r\n else:\r\n odd_even_string += \"e\"\r\n\r\nif(odd_even_string.count(\"o\")<odd_even_string.count(\"e\")):\r\n print(odd_even_string.index(\"o\") + 1 )\r\nelse:\r\n print(odd_even_string.index(\"e\") + 1)", "n = int(input())\r\nline = list(map(int,input().split()))\r\nodd = 0\r\neven = 0\r\nfor i in range(len(line)):\r\n if line[i] % 2 == 0:\r\n even += 1\r\n\r\n else:\r\n odd += 1\r\n \r\n if even >= 2:\r\n break\r\n if odd >= 2:\r\n break\r\n# print(odd)\r\n# # print(even)\r\nif odd > even:\r\n for i in range(len(line)):\r\n if line[i]%2 == 0:\r\n print(i+1)\r\n else:\r\n continue\r\nelse:\r\n for i in range(len(line)):\r\n if line[i]%2 != 0:\r\n print(i+1)", "z=int(input())\r\nx=list(map(str,input().split()))\r\ns=[]\r\nb=[]\r\nc=0\r\nfor i in x:\r\n if int(i)%2==0:\r\n s.append(i)\r\n s.append(c)\r\n else:\r\n b.append(i)\r\n b.append(c)\r\n c+=1\r\nx=\"\".join(x)\r\nif len(s)<len(b):\r\n print(s[1]+1)\r\nelse:\r\n print(b[1]+1)\r\n\r\n\r\n\r\n\r\n \r\n\r\n", "z=int(input())\r\nx=list(map(int,input().split()))\r\nc=0\r\nv=0\r\nb=0\r\nn=0\r\nfor i in x:\r\n if i%2==0:\r\n b=b+1\r\n v=i\r\n else:\r\n n=n+1\r\n c=i\r\nif b>n:\r\n print(x.index(c)+1)\r\nelse:\r\n print(x.index(v)+1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nen = 0\r\non = 0\r\nlo=[]\r\nle=[]\r\n\r\n\r\nfor i in range(len(l)) :\r\n if l[i] %2 ==0 :\r\n le.append(i)\r\n\r\n else :\r\n lo.append(i)\r\n\r\nif len(le)==1 :\r\n for i in le:\r\n print(i+1)\r\nelse :\r\n for i in lo :\r\n print(i+1)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\ni, c = 0, 0\r\nwhile i < 3:\r\n if s[i] % 2 == 0:\r\n c += 1\r\n i += 1\r\nif (c >= 2):\r\n for i in range(len(s)):\r\n if s[i] % 2 == 1:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\n", "number_of_inputs = int(input())\r\nnum_array = [int(x) for x in input().split(\" \")]\r\n\r\nevens = []\r\nodds = []\r\nfor index, val in enumerate(num_array):\r\n if val % 2 == 0:\r\n evens.append([val, index])\r\n else:\r\n odds.append([val, index])\r\n\r\nif len(evens) > len(odds):\r\n print(odds[0][1] + 1)\r\nelse:\r\n print(evens[0][1] + 1)\r\n", "n=input()\r\na=list(map(int,str(input()).split()))\r\nb=[x%2 for x in a ]\r\nif b.count(1)>b.count(0):\r\n print(b.index(0)+1)\r\nelse:\r\n print(b.index(1)+1)", "n=int(input())\r\nnum=input().split(' ')\r\na=[]\r\nb=[]\r\nm=[]\r\nfor i in num:\r\n m.append(int(i))\r\nfor i in m:\r\n if i%2==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)>1:\r\n x=b[0]\r\n y=m.index(x)\r\n print(y+1)\r\nelse:\r\n x=a[0]\r\n y=m.index(x)\r\n print(y+1)\r\n\r\n", "import collections\r\ninput()\r\nd = [e % 2 for e in list(map(int, input().split()))]\r\nprint(d.index(collections.Counter(d).most_common()[-1][0]) + 1)", "n = int(input())\nnums = list(map(int, input().split()))\n\na = nums[0]\nfor i in range(1, n-1):\n if a%2 == nums[i]%2 and a%2 != nums[i+1]%2:\n print(i+2)\n break\n\n if a%2 != nums[i]%2 and a%2 == nums[i+1]%2:\n print(i+1)\n break\n\n if a%2 != nums[i]%2 and a%2 != nums[i+1]%2:\n print(i)\n break\n\n a = nums[i]\n i += 1\n\t\t\t\t\t \t\t\t \t \t \t\t\t \t\t \t\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\n#check if 1st and last elements are even, then its a even series\r\nif a[0]%2==0 and a[-1]%2 ==0:\r\n for i in range(n):\r\n if a[i]%2 !=0:\r\n print(i+1)\r\n#check if 1st and last elements are odd, then its a odd series\r\nelif a[0]%2 !=0 and a[-1]%2 !=0:\r\n for i in range(n):\r\n if a[i]%2 ==0:\r\n print(i+1)\r\n\r\n#if both are not satisfied then the odd element is either at beginning/ending of the series\r\nelse:\r\n if a[0]%2 == 0:\r\n if a[1]%2 == 0:\r\n print(a.index(a[-1])+1)\r\n else:\r\n print(a.index(a[0])+1)\r\n elif a[0]%2 != 0:\r\n if a[1]%2 != 0:\r\n print(a.index(a[-1])+1)\r\n else:\r\n print(a.index(a[0])+1)\r\n ", "x=int(input())\r\ny=input().split(' ')\r\n\r\nevc=[]\r\nodc=[]\r\n\r\ncom=0\r\n\r\nfor x1 in range(x):\r\n if int(y[x1]) %2==0:\r\n evc+=[int(y[x1])]\r\n else:\r\n odc+=[int(y[x1])]\r\n\r\nif len(evc)==1:\r\n comp=evc[0]\r\nelse:\r\n comp=odc[0]\r\n\r\n\r\nfor x2 in range(x):\r\n if comp==int(y[x2]):\r\n print(x2+1)\r\n break", "n =int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n arr[i]%=2\r\nif (arr.count(1)>1):print(arr.index(0)+1)\r\nelse :print(arr.index(1)+1)", "n = int(input())\r\nx = input()\r\nx = x.split()\r\ncounta = 0\r\ncountb = 0\r\n\r\nfor i in range(n):\r\n x[i] = int(x[i])\r\n if x[i] % 2 == 0: #if even\r\n counta += 1\r\n if x[i] % 2 == 1: #if odd\r\n countb += 1\r\n\r\nif counta == 1:\r\n for i in range(n):\r\n if x[i] % 2 == 0:\r\n j = i+1\r\n print(j)\r\n\r\nif countb == 1:\r\n for i in range(n):\r\n if x[i] % 2 == 1:\r\n j = i+1\r\n print(j)\r\n", "n = input()\r\na = list(map(lambda x: int(x) % 2, input().split()))\r\nif list(a).count(1) == 1:\r\n print(list(a).index(1) + 1)\r\nelse:\r\n print(list(a).index(0) + 1)", "n = int(input())\r\n#n, k = map(int, input().split())\r\n#s = input()\r\nc = list(map(int, input().split()))\r\nk = 0\r\nl = 0\r\nfor i in c:\r\n if i % 2 == 0:\r\n k += 1\r\n x = c.index(i) + 1\r\n else:\r\n l += 1\r\n y = c.index(i) + 1\r\nif k == 1:\r\n print(x)\r\nelse:\r\n print(y)\r\n \r\n \r\n ", "n = int(input())\r\nlst = [int(x) for x in input().split()]\r\n\r\noddcount = 0\r\nevencount = 0\r\nevenindex = -1\r\noddindex = -1\r\nfor i in range(0,n):\r\n if lst[i] % 2 == 0:\r\n evencount += 1\r\n evenindex = i\r\n else:\r\n oddcount += 1\r\n oddindex = i\r\n\r\nif evencount > oddcount :\r\n print(oddindex + 1)\r\nelse:\r\n print(evenindex + 1)", "def evenness(n, numbers):\r\n count_even = 0\r\n count_odd = 0\r\n for i in range(n):\r\n if numbers[i] % 2 == 0:\r\n count_even += 1\r\n count_even_index = i\r\n if numbers[i] % 2 != 0:\r\n count_odd += 1\r\n count_odd_index = i\r\n if count_odd < count_even:\r\n return count_odd_index + 1\r\n else:\r\n return count_even_index + 1\r\n\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\nprint(evenness(n, numbers))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even = even + 1\r\n lastEven = i + 1\r\n else:\r\n odd = odd + 1\r\n lastOdd = i + 1\r\n if even > 1 and odd == 1:\r\n print(lastOdd)\r\n break\r\n elif odd > 1 and even == 1:\r\n print(lastEven)\r\n break", "t=int(input())\r\nl=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nod=0\r\nev=0\r\nfor i in range(t):\r\n if l[i]%2==1:\r\n od+=1\r\n x=i\r\n else:\r\n ev+=1\r\n y=i\r\nif(od==1):\r\n print(x+1)\r\nelse:\r\n print(y+1)\r\n ", "input();\r\na=list(map(int,input().split()))\r\nb=list(map(bool,(i%2 for i in a)))\r\nprint ([b.index(True)+1,b.index(False)+1][b[:3].count(True)>=2])", "import sys, collections, math, itertools, random\r\nINF = sys.maxsize\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 1000000007\r\n\r\nn = int(input())\r\narr = get_array()\r\nres = []\r\nfor i in range(3):\r\n res.append(arr[i]%2)\r\nones = res.count(1)\r\nzeros = res.count(0)\r\nif ones > zeros:\r\n for i in range(n):\r\n if arr[i]%2 == 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if arr[i]%2 != 0:\r\n print(i+1)\r\n break", "n = int(input())\r\narr = list( map(int,input().strip().split()))\r\nodd = 0\r\neven = 0\r\nfor i in arr:\r\n if i%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif even>odd:\r\n for x in range(len(arr)):\r\n if arr[x]%2 != 0:\r\n print(x + 1)\r\n break\r\nelse:\r\n for x in range(len(arr)):\r\n if arr[x]%2 == 0:\r\n print(x + 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nd = 0\r\nfor i in range(3):\r\n if l[i] % 2 == 0:\r\n s += 1\r\n else:\r\n d += 1\r\n\r\nif s > d:\r\n for i in range(n):\r\n if l[i] % 2 != 0:\r\n print(i + 1)\r\n break\r\nif s < d:\r\n for i in range(n):\r\n if l[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\n\r\n\r\n", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\nchetn=0\r\nnechetn = 0\r\nk=0\r\nc=0\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n chetn=i+1\r\n k+=1\r\n else:\r\n nechetn = i+1\r\n c+=1\r\nif c==1:\r\n print(nechetn)\r\nelse:\r\n print(chetn)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n e.append(l[i])\r\n else:\r\n o.append(l[i])\r\nif len(e)>len(o):\r\n print(l.index(o[0])+1)\r\nelse:\r\n print(l.index(e[0])+1)", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\neven = odd = 0\r\nfor i in range(3):\r\n if nums[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nisEven = True if (even > odd) else False\r\nif isEven:\r\n for i in range(n):\r\n if nums[i] % 2 != 0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if nums[i] % 2 == 0:\r\n print(i+1)\r\n", "n =int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nvals = [x%2 for x in nums]\r\nres = sum(vals)\r\n\r\nif res == 1:\r\n\tprint(vals.index(1)+1)\r\nelse:\r\n\tprint(vals.index(0)+1)", "tam = int(input())\r\nli = [int(i) for i in input().split()]\r\n\r\nif li[0] % 2 != li[1] % 2:\r\n if li[2] % 2 == li[0] % 2:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n for i in range(2, tam):\r\n if li[i] % 2 != li[0] % 2:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nfo = 0\r\nfe = 0\r\nco = 0\r\nce = 0\r\n\r\nfor i,c in enumerate(a):\r\n if c%2:\r\n co +=1\r\n if not fo:\r\n fo = i+1\r\n else:\r\n ce +=1\r\n if not fe:\r\n fe = i+1\r\nif ce>co:\r\n print(fo)\r\nelse:\r\n print(fe)\r\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nfor i in range(len(data)):\r\n data[i] = data[i] % 2\r\nif data.count(0) > 1: \r\n print(data.index(1)+1)\r\nelse:\r\n print(data.index(0)+1)", "n = int(input())\r\n\r\nf = [0,0]\r\na = list(map(int, input().strip().split()))[:n]\r\n \r\nfor i in range(n):\r\n a[i] %= 2\r\n f[a[i]]+=1\r\n \r\nif(f[0]>f[1]):\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)\r\n \r\n", "n = int(input())\r\nlist1 = list(map(int,input().split()))\r\neven = []\r\nodd = []\r\nfor x in range(n):\r\n if list1[x]%2==0:\r\n even.append(x)\r\n else:\r\n odd.append(x)\r\nif len(even)>len(odd):\r\n print(odd[0]+1)\r\nelse:\r\n print(even[0]+1)", "n=int(input())\r\ndef judge(x):\r\n if x%2==0:\r\n return 0\r\n else:\r\n return 1\r\nls=[int(x) for x in input().split()]\r\nif judge(ls[0])==judge(ls[1]):\r\n for x in ls[2:]:\r\n if judge(x)!=judge(ls[0]):\r\n print(ls.index(x)+1)\r\n break\r\nelse:\r\n if judge(ls[2])==judge(ls[0]):\r\n print(2)\r\n elif judge(ls[2])==judge(ls[1]):\r\n print(1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ne = []\r\no = []\r\n\r\nfor i, v in enumerate(arr, 1):\r\n if v % 2 == 0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\n\r\nprint(e[0] if len(e) == 1 else o[0])", "import math\r\n# a, b, c = map(int,input().split()) => fixed number of inputs\r\n# list = [int(i) for i in input().split()] => adds elements to a listn\r\n\r\nn = int(input())\r\nl1 = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\nif l1[0] % 2 == 0 and l1[1] % 2 != 0 and l1[2] % 2 != 0:\r\n print(1)\r\n exit()\r\nif l1[0] % 2 != 0 and l1[1] % 2 == 0 and l1[2] % 2 == 0:\r\n print(1)\r\n exit()\r\nif l1[0] % 2 == 0 and l1[1] % 2 != 0 and l1[2] % 2 == 0:\r\n print(2)\r\n exit()\r\nif l1[0] % 2 != 0 and l1[1] % 2 == 0 and l1[2] % 2 != 0:\r\n print(2)\r\n exit()\r\n\r\nfor i in range(0,n):\r\n if l1[i] % 2 == 0:\r\n even+=1\r\n if odd > 1:\r\n print(i + 1)\r\n else:\r\n odd+= 1\r\n if even > 1:\r\n print(i + 1)", "n=int(input())\narr=list(map(int,input().split()[:n]))\neven=0\nodd=0\np=0\nz=0\nfor i in range(n):\n if arr[i]%2==0:\n even=even+1\n p=i\n else:\n odd=odd+1\n z=i\nif even>odd:\n print(z+1)\nelse:\n print(p+1)\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Oct 18 19:14:57 2020\n\n@author: apple\n\"\"\"\n\nn=int(input())\na=list(map(int,input().split(' ')))\nb=c=0\nd=[]\ne=[]\nfor i in range(n):\n if a[i]%2==0:\n b+=1\n d.append(i+1)\n elif a[i]%2==1:\n c+=1\n e.append(i+1)\nif b==1:\n print(d[0])\nelif c==1:\n print(e[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\neven=odd=0\r\nfor i in range(n-1):#есть случай где n[len(a)]<=2 надо выдавать ошибку\r\n if a[i]%2==a[i+1]%2:\r\n if a[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n continue\r\n if even>odd or odd>even:\r\n print(i+2)#но по индексу после i(т.е=i+1)\r\n break\r\n elif a[0]%2==a[2]%2:\r\n print(2)#но по индексу 1\r\n break\r\n else:\r\n print(1)#но по индексу 0\r\n break\r\n", "#iq test\r\nx=int(input())\r\ny=[int(item) for item in input().split()]\r\nevenlist=[]\r\noddlist=[]\r\nfor item in y:\r\n if item%2==0:\r\n evenlist.append(item)\r\n else:\r\n oddlist.append(item)\r\nif len(evenlist)==1:\r\n result=y.index(evenlist[0])+1\r\nelse:\r\n result=y.index(oddlist[0])+1\r\nprint(result)\r\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\npar = 0\r\nimpar = 0\r\ncontadorPar = 0\r\ncontadorImpar = 0\r\nfor i in range(len(nums)):\r\n if nums[i]%2 == 0:\r\n contadorPar+=1\r\n par = i+1\r\n else:\r\n contadorImpar+=1\r\n impar = i+1\r\n \r\nif contadorPar == 1:\r\n print(par)\r\nelse:\r\n print(impar)", "import sys\r\n\r\ndef data():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\n \r\ndef sp(): return map(int, data().split()) \r\ndef l(): return list(sp())\r\n\r\nn=int(data())\r\ntemp=l()\r\noddness=0\r\nevenness=0\r\nfor i in range(len(temp)):\r\n if temp[i]%2==0:\r\n evenness+=1\r\n even=i\r\n \r\n if temp[i]%2!=0:\r\n odd=i\r\n oddness+=1\r\n \r\nif evenness>=len(temp)//2 and oddness==1:\r\n print(odd+1)\r\n\r\nelif oddness>=len(temp)//2 and evenness==1:\r\n print(even+1)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nfor i in range(n):\r\n if lst[i]%2 : lst[i]=1\r\n else : lst[i]=0\r\nprint(lst.index(max(lst))+1) if lst.count(1)==1 else print(lst.index(min(lst))+1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nj = 0\r\no = 0\r\nif l[0] % 2 == 0:\r\n o += 1\r\nelse:\r\n j += 1\r\n\r\nif l[1] % 2 == 0:\r\n o += 1\r\nelse:\r\n j += 1\r\n\r\nif l[2] % 2 == 0:\r\n o += 1\r\nelse:\r\n j += 1\r\n\r\nif j > o:\r\n for i in range(n):\r\n if l[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if l[i] % 2 == 1:\r\n print(i + 1)\r\n break\r\n\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\neven=[]\r\nodd=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(even)==(n-1):\r\n print(odd[0]+1)\r\nelse:\r\n print(even[0]+1)\r\n ", "n=int(input())\r\nnames=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor i in names:\r\n if i%2!=0:\r\n a.append(i)\r\n if i % 2 == 0:\r\n b.append(i)\r\nif len(a)>len(b):\r\n print (names.index(*b)+1)\r\nif len(a)<len(b):\r\n print(names.index(*a)+1)\r\n\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nif l[0]%2 != l[1]%2:\r\n if l[0]%2 ==l[2]%2:\r\n print('2')\r\n else:\r\n print('1')\r\nelse:\r\n for i in range(2,n):\r\n if l[i]%2 !=l[0]%2:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nloc = {}\r\n\r\nfor idx, val in enumerate(nums):\r\n if val % 2 == 0:\r\n loc[idx] = True \r\n else:\r\n loc[idx] = False\r\n \r\nif sum(loc.values()) > 1:\r\n for k, v in loc.items():\r\n if v == False:\r\n print(k+1)\r\nelse:\r\n for k, v in loc.items():\r\n if v == True:\r\n print(k+1)\r\n \r\n\r\n\r\n\r\n\r\n", "n = int(input())\n\nnumbers = list(map(int, input().split()))\n\nevenness = [n % 2 == 0 for n in numbers]\n\nis_even = evenness[:3].count(True) < evenness[:3].count(False)\n\nprint(1 + evenness.index(is_even))\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nc_o = 0\r\nc_e = 0\r\ni_o = 0\r\ni_e = 0\r\nfor i in range(n):\r\n if(x[i] % 2 == 0):\r\n c_e += 1\r\n i_e = i+1\r\n else:\r\n c_o += 1\r\n i_o = i+1\r\nif(c_o == 1):\r\n print(i_o)\r\nelse:\r\n print(i_e)\r\n", "a=int(input())\nb=input()\nc=b.split()\nx=int(c[0])%2\ny=int(c[1])%2\nz=int(c[2])%2\nif x==y:\n i=2\n while i<a:\n if int(c[i])%2!=x:\n print(i+1)\n break\n i+=1\nelse:\n if y==z:\n print(1)\n else:\n print(2)\n", "b=int(input())\r\ns=input()\r\nn=[int(s) for s in s.split()]\r\nch=[]\r\nnoch=[]\r\nfor i in range(b):\r\n if n[i]%2==0:\r\n ch.append(i)\r\n else:\r\n noch.append(i)\r\nif len(ch)>len(noch):\r\n print(int(' '.join([str(i) for i in noch]))+1)\r\nelse:\r\n print(int(' '.join([str(i) for i in ch]))+1)\r\n\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nl=[]\r\ni=0\r\nwhile i<n:\r\n l.append(s[i]%2)\r\n i=i+1\r\nif l.count(0)==1:\r\n a=l.index(0)\r\nelse:\r\n a=l.index(1)\r\nprint(a+1)", "n = int(input())\r\ndays = list(map(int, input().split(\" \")))\r\n\r\nnum = 0\r\n\r\nfor i in range(3):\r\n if days[i]%2==0:\r\n num+=1\r\n \r\nif num > 1:\r\n res = 1\r\nelse:\r\n res = 0\r\n \r\nfor i in range(n):\r\n if days[i]%2 == res:\r\n print(i+1)\r\n break", "n = eval(input())\r\nl = list(map(int,input().split()))\r\ncount = [0]*3\r\ni=0\r\nc=0\r\nwhile i < n :\r\n if l[i]%2==1:\r\n count[1]+=1\r\n else :\r\n count[2]+=1\r\n i+=1\r\ni=0\r\nif count[1]<count[2]:\r\n while i<n:\r\n if l[i]%2==1:\r\n c=i+1\r\n break\r\n i+=1\r\nelse :\r\n while i<n:\r\n if l[i]%2==0:\r\n c=i+1\r\n break\r\n i+=1\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\narr = list(map(int, input().split()))\r\nlength=len(arr)\r\n\r\ncnt1,cnt2,m,n=0,0,0,0\r\nfor i in range(length):\r\n if(arr[i]%2==0):\r\n cnt1+=1\r\n m=i \r\n else:\r\n cnt2+=1\r\n n=i\r\n\r\nif(cnt1>cnt2):\r\n print(n+1)\r\nelse:\r\n print(m+1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\neven = []\r\nodd = []\r\nfor i in a:\r\n if i & 1:\r\n odd.append(i)\r\n else:\r\n even.append(i)\r\nif len(even) == 1:\r\n print(a.index(even[0]) + 1)\r\nelse:\r\n print(a.index(odd[0]) + 1)\r\n", "n=input()\r\nmylist=[int(x)%2 for x in input().split()]\r\nprint(mylist.index(mylist.count(1)==1)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\noc,ec=0,0\r\nle,lo=[],[]\r\nfor i in a:\r\n if i%2==0:\r\n ec+=1\r\n le.append(a.index(i)+1)\r\n else:\r\n oc+=1\r\n lo.append(a.index(i)+1)\r\nif ec==1:\r\n print(le[0])\r\nelif oc==1:\r\n print(lo[0])\r\nelse:\r\n pass\r\n", "# LUOGU_RID: 97739359\ninput()\nnumbers=list(map(int,input().split()))\nnumbers=[num % 2 == 0 for num in numbers]\na=0\nb=0\nfor i in range(0,3):\n if numbers[i]:\n a+=1\n else:\n b+=1\nif a>b:\n for i in range(len(numbers)):\n if numbers[i] == False:\n print(i+1)\nelse:\n for i in range(len(numbers)):\n if numbers[i]:\n print(i+1)", "n=int(input())\r\nx=input().split()\r\nx=[int(x[i])%2 for i in range(n)]\r\nif sum(x)==1:\r\n for i in range(n):\r\n if x[i]==1:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if x[i]==0:\r\n print(i+1)\r\n \r\n \r\n", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nm=0\r\nn=0\r\nfor i in range(0,a):\r\n if b[i]%2==0:\r\n m=m+1\r\n else:\r\n n=n+1\r\nif m>n:\r\n for i in range(0,a):\r\n if b[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(0,a):\r\n if b[i]%2==0:\r\n print(i+1)\r\n", "import math \r\nn = int(input())\r\nt = list(map(int, input().split()))\r\nodd = [ ]\r\neven = [ ]\r\nfor i in range(n):\r\n if t[i] % 2 == 0:\r\n even.append(t[i])\r\n else:\r\n odd.append(t[i])\r\nif len(odd) != 1:\r\n print(t.index(even[0]) + 1)\r\nelse:\r\n print(t.index(odd[0]) + 1)\r\n", "input(); a=[int(n)%2 for n in input().split() ]\r\nprint( a.index(sum(a)==1)+1 )", "def deffere():\n num = int(input())\n even = 0\n evenind , oddind = 0,0\n odd = 0\n degres = input().split()\n for i in range(num):\n if int(degres[i])%2 == 0:\n even += 1\n evenind = i + 1\n else:\n odd += 1\n oddind = i + 1\n\n if even == 1:\n print(evenind)\n else:\n print(oddind)\n\ndeffere()\n \t \t \t\t \t \t\t\t\t\t\t \t\t", "input()\r\nl = [int(i) % 2 for i in input().split()]\r\nif l.count(1) == 1:\r\n\tprint(l.index(1) + 1)\r\nelse:\r\n\tprint(l.index(0) + 1)", "n = int(input())\r\ns = list(map(int,input().split()))\r\nd = {s[i]:i for i in range(len(s))}\r\nji = []\r\nou = []\r\nfor i in s:\r\n if i%2 == 0:\r\n ou.append(i)\r\n else:\r\n ji.append(i)\r\nif len(ou) == 1:\r\n print(d[ou[0]]+1)\r\nelse:\r\n print(d[ji[0]]+1)\r\n", "n = int(input())\r\nl = input().split()\r\n\r\nfor i in range(0,n):\r\n l[i] = int(int(l[i])%2)\r\nif l.count(0) == 1:\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)", "n=int(input())\r\na=list(int(i) for i in input().split())\r\nb,c=0,0\r\nfor x in range(0,n):\r\n if a[x]%2==0:\r\n b+=1\r\n d=x+1\r\n else:\r\n c+=1\r\n e=x+1\r\nif b==1:\r\n print(d)\r\nif c==1:\r\n print(e)", "apple=int(input()) \r\nmango=list(map(int,input().split())) \r\ntr1=[] \r\ntr2=[]\r\nfor pro in mango: \r\n if(pro%2==0): \r\n tr1.append(pro) \r\n else: \r\n tr2.append(pro) \r\nlaya=len(tr1) \r\nbala=len(tr2) \r\nif(laya==1): \r\n print(1+mango.index(tr1[0]))\r\nelse: \r\n print(1+mango.index(tr2[0]))", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nodd=[]\r\neven=[]\r\nfor x in range(n):\r\n if a[x]%2==0:\r\n even.append(x+1)\r\n else:\r\n odd.append(x+1)\r\nif len(odd)<len(even):\r\n print(odd[0])\r\nelse:\r\n print(even[0])", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nodd = 0\r\neven = 0\r\nfor i in range(n):\r\n if arr[i] % 2:\r\n odd += 1\r\n last_odd = i+1\r\n else:\r\n even += 1\r\n last_even = i+1\r\nif odd == 1:\r\n print(last_odd)\r\nelse:\r\n print(last_even) ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = a[0] % 2\r\nif a[1] % 2 != b:\r\n if a[2] % 2 == b:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n for i in range(2, n):\r\n if a[i] % 2 != b:\r\n print(i + 1)\r\n", "n = int(input())\r\nln = list(map(int, input().split()))\r\nliste = []\r\nlistu = []\r\nfor i in range(n):\r\n if ln[i] % 2 == 0:\r\n liste.append(i+1)\r\n else:\r\n listu.append(i+1)\r\nif len(liste) == 1:\r\n print(liste[0])\r\nelse:\r\n print(listu[0])", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nc1,c2=0,0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n c1+=1\r\n else:\r\n c2+=1\r\n if(c1>1 or c2>1):\r\n break\r\nif(c1>1):\r\n for i in range(n):\r\n if(l[i]%2==1):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if(l[i]%2==0):\r\n print(i+1)\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\nf=0\r\nif a[0]%2!=a[1]%2 and a[1]%2==a[2]%2:\r\n print(1)\r\n f=1\r\nif a[0]%2!=a[1]%2 and a[1]%2!=a[2]%2:\r\n print(2)\r\n f=1\r\nif f==0:\r\n for i in range(n-1):\r\n if a[i]%2!=a[i+1]%2:\r\n print(i+2)\r\n break", "n = int(input())\n\nl = list(map(int, input().split()))\n\nb = False\neve = l[0]%2\n\nif (l[1]%2 != eve):\n if (l[2]%2 == eve):\n print(2)\n else:\n print(1)\n b = True \n\nif not b:\n for i in range(2, n):\n if (l[i]%2 != eve):\n print(i+1)\n break", "n = int(input())\r\nnss = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\nfor i in nss:\r\n if i%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif odd == 1:\r\n for i in range(0,len(nss)):\r\n if nss[i]%2 != 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(0,len(nss)):\r\n if nss[i]%2 == 0:\r\n print(i+1)\r\n break\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\no=0\r\npe=0\r\npo=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n e+=1\r\n if e==1:\r\n pe=i+1\r\n else:\r\n o+=1\r\n if o==1:\r\n po=i+1\r\nif e>o:\r\n print(po)\r\nelse:\r\n print(pe)", "num = int(input())\r\nnumeros = [int(a) for a in input().split(\" \")]\r\npar = 0\r\nimpar = 0\r\n\r\nfor i in numeros:\r\n if i % 2 == 0:\r\n par += 1\r\n else:\r\n impar += 1\r\ncont = 1\r\nif par > impar:\r\n for k in numeros:\r\n if k % 2 != 0:\r\n print(cont)\r\n break\r\n else:\r\n cont +=1\r\nelse:\r\n for j in numeros:\r\n if j % 2 == 0:\r\n print(cont)\r\n break\r\n else:\r\n cont += 1", "n=int(input())\r\nc1=0\r\nc2=0\r\nl1=list(map(int,input().split()))\r\nl=len(l1)\r\nfor i in range(l):\r\n if l1[i]%2==0:\r\n c1+=1\r\n else:\r\n c2+=1\r\nif c2==1:\r\n for i in range(l):\r\n if l1[i]%2!=0:\r\n print(i+1)\r\n break\r\nelif c1==1:\r\n for i in range(l):\r\n if l1[i]%2==0:\r\n print(i+1)\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\nindices=[]\r\no=e=0\r\nfor i in a:\r\n if i&1==1:\r\n indices.append(1)\r\n o+=1\r\n else:\r\n indices.append(0)\r\n e+=1\r\nif o==1:\r\n print(indices.index(1)+1)\r\nelse:\r\n print(indices.index(0)+1)", "n=int(input())\r\na=[int(i) for i in input().split()][:n]\r\nie=0\r\nio=0\r\ne=0\r\no=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n ie=i\r\n e=e+1\r\n else:\r\n io=i\r\n o=o+1\r\nif e==1:\r\n print(ie+1)\r\nelse:\r\n print(io+1)", "length = int(input())\r\narray = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\nfor i in array:\r\n\tif(i%2==0):\r\n\t\teven+=1\r\n\telse:\r\n\t\todd+=1\r\n\tif(odd>1):\r\n\t\tx=1\r\n\t\tbreak\r\n\telif(even>1):\r\n\t\tx=0\r\n\t\tbreak\r\n\r\nif(x==0):\r\n\tfor j in range(length):\r\n\t\tif(array[j]%2==1):\r\n\t\t\tprint(j+1)\r\n\t\t\tbreak\r\nelse:\r\n\tfor j in range(length):\r\n\t\tif(array[j]%2==0):\r\n\t\t\tprint(j+1)\r\n\t\t\tbreak\r\n", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\n\r\ne = None\r\nf = None\r\nei = None\r\nfi = None\r\n\r\nfor i, s in enumerate(x):\r\n if e == None:\r\n e = s % 2\r\n ei = i\r\n elif f == None:\r\n f = s % 2\r\n fi = i\r\n elif s % 2 != e or s % 2 != f:\r\n if e == f:\r\n print(i + 1)\r\n elif s % 2 != e:\r\n print(ei + 1)\r\n else:\r\n print(fi + 1)\r\n break\r\n", "x = int(input())\narr = list(map(int,input().split()))\ne = []\no = []\nfor i in range(x):\n if arr[i]%2 == 0:\n e.append(i+1)\n else:\n o.append(i+1)\nif len(e) == 1:\n print(e[0])\nelse:\n print(o[0])\n\n", "n = int(input())\nentrada = input()\nentrada = list(map(int, entrada.split()))\n\npar1 = entrada[0]%2\npar2 = entrada[1]%2\nif(par1 == par2):\n for i in range(len(entrada) - 2):\n if(entrada[i + 2]%2 != par1):\n print(i + 3)\nelse:\n if(entrada[2]%2 == par1):\n print(2)\n else:\n print(1)", "n = int (input ())\r\nst = str (input ())\r\nst = st.split ()\r\nst = [int (x) for x in st]\r\n\r\nchet = 0\r\nnechet = 0\r\n\r\nfor i in range (3):\r\n if st[i] % 2 == 0:\r\n chet += 1\r\n else:\r\n nechet += 1\r\n\r\nif chet > nechet:\r\n for i in range (n):\r\n if st[i] % 2 != 0:\r\n print (i + 1)\r\n break\r\nelse:\r\n for i in range (n):\r\n if st[i] % 2 == 0:\r\n print (i + 1)\r\n break\r\n \r\n \r\n", "w = 13\r\nres = 0\r\ni = 0\r\nn = int(input())\r\nx = input().split()\r\nfor i in range(len(x)):\r\n x[i] = int(x[i])\r\n resto = x[i]%2\r\n if i < 1:\r\n q = resto\r\n if i == 1:\r\n w = x[i]%2\r\n if i > 1:\r\n if w != q:\r\n if x[i]%2 == w:\r\n res = 0\r\n break\r\n if x[i]%2 == q:\r\n res = 1\r\n break\r\n if x[i]%2 != q:\r\n if x[0]%2 == x[1]%2:\r\n res = i\r\n break \r\nprint(res+1)", "import sys\r\n\r\nn = sys.stdin.readline()\r\nl = [int(i)%2 for i in sys.stdin.readline().strip().split(' ')]\r\nif l.count(1) == 1:\r\n print(l.index(1) + 1)\r\nelse:\r\n print(l.index(0) + 1)\r\n\r\n\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n b.append(1)\r\n else:\r\n b.append(0)\r\nif b.count(1)==1:\r\n print(b.index(1)+1)\r\nelse:\r\n print(b.index(0)+1)", "l = int(input())\r\nn = [int(x) % 2 for x in input().split()]\r\nmean = round(sum(n)/l)\r\nfor i in range(l):\r\n if n[i]!=mean:\r\n print(i+1)\r\n break", "n = int(input())\r\narray_n = list(map(int, input().split()))\r\n\r\nevens = 0\r\nodds = 0\r\nfor num in array_n:\r\n if num%2 == 0:\r\n evens += 1\r\n else:\r\n odds += 1\r\nres = 0\r\nfor num in array_n:\r\n if odds > evens:\r\n if num%2 == 0:\r\n res = num\r\n if evens > odds:\r\n if num%2 != 0:\r\n res = num\r\n\r\nfor i in range(len(array_n)):\r\n if array_n[i] == res:\r\n print(i+1)", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline().strip())\r\nnum_list = list(map(int, stdin.readline().split()))\r\n\r\nfor i in range(n):\r\n if num_list[i] % 2 == 1:\r\n num_list[i] = 1\r\n else:\r\n num_list[i] = 0\r\n\r\nif num_list.count(1) > num_list.count(0):\r\n seq_key = 0\r\nelse:\r\n seq_key = 1\r\nindex = num_list.index(seq_key) + 1\r\nstdout.write(str(index))", "\ndef indexdiffer(l):\n\tcount_odd=0\n\tcount_even=0\n\tlast_odd=0\n\tlast_even=0\t\n\n\tfor i in range(len(l)):\n\t\tif l[i]%2==0:\n\t\t\tcount_even+=1\n\t\t\tlast_even=i\n\t\telse:\n\t\t\tcount_odd+=1\n\t\t\tlast_odd=i\n\n\tif(count_odd==1):\n\t\treturn last_odd+1 \n\telif(count_even==1):\n\t\treturn last_even+1\n\ndef main():\n\tt=int(input())\n\tl=list(map(int,input().split()))\n\tprint(indexdiffer(l))\n\nif __name__=='__main__':\n\tmain()\n", "a=[]\r\nb=[]\r\nd=int(input())\r\nc=list(map(int,input().split()))\r\nfor i in range(len(c)):\r\n if c[i]%2==0:\r\n a.append(c[i])\r\n else:\r\n b.append(c[i])\r\nf=min(sum(a),sum(b))\r\nprint(c.index(f)+1)", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nlol = 0\r\nodds = []\r\nevens = []\r\nfor i in range(n):\r\n if(nums[i]%2==0):\r\n evens.append(nums[i])\r\n else:\r\n odds.append(nums[i])\r\nif(len(odds)<len(evens)):\r\n print(nums.index(odds[0])+1)\r\nelse:\r\n print(nums.index(evens[0])+1)", "input()\r\nnums = [int(num) for num in input().split()]\r\neven, odd = [], []\r\nfor _ in nums:\r\n if _ % 2 == 0: even.append(_)\r\n else: odd.append(_)\r\nif len(even) > len(odd): print(nums.index(odd[0]) + 1)\r\nelse: print(nums.index(even[0]) + 1)", "n = int(input())\r\na = [int(c) for c in input().split()]\r\no = []\r\nx =[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n a[i]=0\r\n o.append(i+1)\r\n else:\r\n a[i]=1\r\n x.append(i+1)\r\nif len(o)==1:\r\n print(o[0])\r\nelse:\r\n print(x[0])", "n=int(input())\r\nc=[int(i) for i in input().split()]\r\nr1=0\r\nr2=0\r\nr=[]\r\n\r\nfor i in c:\r\n if i%2==0:\r\n r1+=1\r\n r.append(1)\r\n else:\r\n r2+=1\r\n r.append(2)\r\n\r\nif r1==1:\r\n print(r.index(1)+1)\r\nelse:\r\n print(r.index(2)+1)\r\n", "n = int(input()); a = list(map(int,input().split()))\r\nfor i in range(n): a[i] = a[i] % 2 \r\n\r\nif a.count(1) > a.count(0): print(a.index(0)+1)\r\nelse: print(a.index(1)+1)", "len = int(input())\r\nn = list(map(int, input().split()))\r\ne= o = 0\r\ne_ind=o_ind=1\r\nfor i in range(len):\r\n if n[i] % 2 == 0:\r\n e_ind=i+1 \r\n e += 1\r\n else:\r\n o_ind=i+1\r\n o += 1\r\n\r\nif(e>1):\r\n print(o_ind)\r\nelse:\r\n print(e_ind)", "n=int(input())\r\nnum=list(map(int,input().split()))\r\ncnt0=0\r\ncnt1=0\r\nfor i in range(n):\r\n num[i]=num[i]%2\r\n if num[i]==1:\r\n cnt1+=1\r\n else:\r\n cnt0+=1\r\nif cnt0==1:\r\n for i in range(n):\r\n if num[i]==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if num[i]==1:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nl2 = []\r\nfor m in range(len(l1)):\r\n a = str(l1[m]%2)\r\n l2.append(a)\r\np = ''.join(l2)\r\nif p.find(l2[0],1) == -1:\r\n print(1)\r\nelse:\r\n if l2[0] == '0':\r\n print(p.find('1')+1)\r\n else:\r\n print(p.find('0')+1)", "n = int(input())\ns = str(input())\nlst = s.split()\na = int()\nb = int()\n\nfor number in lst:\n if int(number) % 2 == 0:\n a += 1\n else:\n b += 1\n\nif a == 1:\n for i in range(len(lst)):\n if int(lst[i]) % 2 == 0:\n print(i + 1)\nelif b == 1:\n for i in range(len(lst)):\n if int(lst[i]) % 2 != 0:\n print(i + 1)\n", "q=int(input())\r\nw=list(map(int,input().split()))\r\ne=0\r\nr=0\r\nfor i in range(q):\r\n if w[i]%2==0:\r\n t=i\r\n e+=1\r\n else:\r\n y=i\r\n r+=1\r\nif e==1:\r\n print(t+1)\r\nelse:\r\n print(y+1)", "n=int(input())\r\nar=list(map(int,input().split()))[:n]\r\nev=od=ct1=ct2=0\r\nfor i in range(0,n):\r\n\tif ar[i]%2==0:\r\n\t\tev+=1\r\n\t\tct1=i+1\r\n\telse:\r\n\t\tod+=1\r\n\t\tct2=i+1\r\nif ev>od:\r\n\tprint(ct2)\r\nelse:\r\n\tprint(ct1)", "#Khushal Sindhav\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n eve=0\r\n odd=0\r\n for i in l:\r\n #print(i)\r\n if(i%2==0):\r\n eve+=1\r\n else:\r\n odd+=1\r\n if(odd==1):\r\n for i in range(n):\r\n if(l[i]%2==1):\r\n return i+1\r\n else:\r\n for i in range(n):\r\n if(l[i]%2==0):\r\n return i+1\r\n\r\n return\r\n \r\nn=int(input())\r\nl=list(map(int,input().split())) \r\nprint(exe())", "n=int(input())\narr=list(map(int,input().split()))\na=[0,0]\nfor i in arr:\n\ta[i%2]+=1\nif a[0]>a[1]:\n\tfor i in range(n):\n\t\tif(arr[i]&1):\n\t\t\tprint(i+1)\nelse:\n\tfor i in range(n):\n\t\tif(arr[i]%2==0):\n\t\t\tprint(i+1)\n\t \t\t\t \t\t \t\t\t\t\t\t \t\t\t \t \t\t", "N = int(input())\nseq = [int(n)%2 for n in (input()).split()]\n\nfor i in range(len(seq)):\n if seq[i] != seq[0]:\n if i == 1 and seq[i] == seq[i+1]:\n print(1)\n else:\n print(i+1)\n break\n", "x=int(input())\r\nm=list(map(int,input().split()))\r\n\r\nchet=0\r\nnechet=0\r\np=0\r\ny=0\r\n\r\nfor i in range(len(m)):\r\n if m[i]%2==0:\r\n chet+=1\r\n p=i+1\r\n else:\r\n nechet+=1\r\n y=i+1\r\nif chet>nechet:\r\n print(y)\r\nelse:\r\n print(p)\r\n \r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n# print([l[0]%2, l[1]%2, l[2]%2].count(0), [l[0]%2, l[1]%2, l[2]%2].count(1))\r\na=[l[0]%2, l[1]%2, l[2]%2].count(0)\r\nb=[l[0]%2, l[1]%2, l[2]%2].count(1)\r\n\r\nif a>b:\r\n for i in range(n):\r\n if l[i]%2:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if not(l[i]%2):\r\n print(i+1)\r\n break\r\n ", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncount1 = 0; count2 = 0\r\nfor i in range(n):\r\n if l[i] %2 == 0:\r\n count1 += 1\r\n z = i\r\n else:\r\n count2 += 1\r\n x = i\r\nif count1 == 1:\r\n print(z+1)\r\nelse:\r\n print(x+1)", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nc=0\r\nd=0\r\nfor i in range(0,len(list1)):\r\n if list1[i]%2==0:\r\n c=c+1\r\n else:\r\n d=d+1\r\nif c>d:\r\n for i in range(0,len(list1)):\r\n if list1[i]%2!=0:\r\n ans=i+1\r\n print(ans)\r\n break\r\nelse:\r\n for i in range(0,len(list1)):\r\n if list1[i]%2==0:\r\n ans=i+1\r\n print(ans)\r\n break\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\nns = [int(x) for x in input().split(' ')]\neven = []\nodd = []\nfor i in range(len(ns)):\n if ns[i] % 2 == 0:\n even.append(i)\n else:\n odd.append(i)\nif len(odd) < len(even):\n print(odd[0] + 1)\nelse:\n print(even[0] + 1)\n", "test_num = int(input())\nline = [int(j) % 2 for j in input().split()]\nprint(line.index(1)+1) if line.count(1) == 1 else print(line.index(0)+1)", "count = 0\r\nind_add = ind_even = 0\r\n\r\nn = int(input())\r\nmas = list(map(int, input().split()))\r\n\r\nfor i in range(0, n) :\r\n if mas[i] & 1 :\r\n count += 1\r\n ind_even = i\r\n else :\r\n count -= 1\r\n ind_add = i\r\n\r\nif count > 0 : print(ind_add + 1)\r\nelse : print(ind_even + 1)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\narr_odd = []\r\narr_even = []\r\nfor i in range(n):\r\n if arr[i] % 2 == 1:\r\n arr_odd.append(i+1)\r\n else:\r\n arr_even.append(i+1)\r\n\r\nif len(arr_even) > len(arr_odd):\r\n print(arr_odd[0])\r\nelse:\r\n print(arr_even[0])\r\n", "from sys import stdin\r\n\r\nline = stdin.readlines()[1]\r\nnums = [int(n) for n in line.split()]\r\n\r\ndef is_odd(arr):\r\n count = 0\r\n for i in arr:\r\n if i%2 == 1:\r\n count += 1\r\n return count == 1\r\n\r\n\r\nif is_odd(nums):\r\n for i in range(len(nums)):\r\n if nums[i]%2 == 1:\r\n print(i+1)\r\nelse:\r\n for i in range(len(nums)):\r\n if nums[i]%2 == 0:\r\n print(i+1)\r\n", "n=(int,input())\r\na=list(map(int,input().split()))\r\nec,oc=0,0\r\nfe,fo=0,0\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n ec+=1\r\n fe=i\r\n else:\r\n oc+=1\r\n fo=i\r\n\r\nif ec==1:\r\n print(fe+1)\r\n \r\nelif oc==1:\r\n print(fo+1)\r\n \r\n\r\n\r\n\r\n \r\n ", "# https://codeforces.com/problemset/problem/25/A\n\n# Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the \n# given n numbers differs from the others. Bob observed that one number usually differs from the others\n# in evenness. Help Bob — to check his answers, he needs a program that among the given n numbers finds\n# one that is different in evenness.\n\n# Input\n# The first line contains integer n (3 ≤ n ≤ 100) — amount of numbers in the task. The second line contains\n# n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers\n# differs from the others in evenness.\n\n# Output\n# Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.\n\ndef answer(a): \n print(a)\n exit(0)\n\nn = int(input())\ninputs = input().split()\n\ne = 0\n\nfor i in range(3):\n if int(inputs[i]) % 2 == 0: e += 1\n\nisEven = e > 1\n\nfor i in range(n):\n if (int(inputs[i]) % 2 == 0) != isEven: answer(i+1)", "#n, d = input().split()\n#n = int (n)\n#d = int (d)\nn = int(input())\nh = list(map(int, input().split()))\n#g = list(map(int, input().split()))\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\na = -1\nif (h[0]%2 == h[1]%2):\n a = h[0]%2\n for i in range (2,n):\n if (h[i] % 2 != a):\n print(i+1)\n break\nelif (h[0]%2 == h[2]%2):\n print(2)\nelse:\n print(1)\n\n \n\n", "n = int(input())\r\nls = [int(k) for k in input().split()]\r\n\r\nif (ls[0] % 2) != (ls[1] % 2):\r\n if (ls[2] % 2) == (ls[0] % 2):\r\n print('2')\r\n else:\r\n print('1')\r\nelse:\r\n for i in range(1, len(ls)):\r\n if (ls[i] % 2) != (ls[0] % 2):\r\n print(str(i+1))\r\n break", "n=int(input())\r\ny=list(map(int,input().split()))\r\nlist1=[]\r\nlist2=[]\r\nfor i in y:\r\n if i%2==0:\r\n list1.append(i)\r\n else:\r\n list2.append(i)\r\nif len(list1)<len(list2):\r\n print(y.index(list1[0])+1)\r\nelse:\r\n print(y.index(list2[0])+1)\r\n ", "# _________________________________________________________________________________\r\n#╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬ \r\n#╬╬\t _\t _\t\t\t ______\t _\t\t _\t\t\t\t ___ __ _ ╬╬\r\n#╬╬\t|█| |█| |█|\t|█|\t ██████\t |██\t\t |█|\t|███|\t|███| |██\t\t|█| ╬╬\r\n#╬╬\t|█|\t |█| |█|\t|█| █ █ |█ █\t\t |█| |█ █|\t |█| |█ █\t |█| ╬╬\r\n#╬╬\t|█|\t |█| |█|\t|█|\t ██\t\t█ |█ ██\t |█| |█\t|█|\t |█| |█ ██\t|█|\t ╬╬\r\n#╬╬\t|█|\t |█| |█|\t|█|\t ██\t |█\t█\t |█| |█|_____|█| |█| |█\t█\t|█|\t ╬╬\r\n#╬╬\t|███████| |█|\t|█|\t ██\t |█\t ██\t |█| |█████████| |█| |█\t██\t|█| ╬╬\r\n#╬╬\t|█|\t |█| |█|\t|█|\t█\t █ |█\t █ |█| |█|\t |█| |█| |█\t █\t|█| ╬╬\r\n#╬╬\t|█|\t |█| |█|___|█|\t █\t █\t |█\t\t█|█| |█|\t |█| |█| |█\t █|█| ╬╬\r\n#╬╬\t|█|\t |█| |█████|\t ████\t |█\t\t ██| |█|\t |█||███| |█\t ██| ╬╬\r\n#╬╬\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t ╬╬\r\n#╬╬______________________________________________________________________________╬╬\r\n#╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬ \r\nl = int(input())\r\narr = list(map(int,input().split()))\r\neven = []\r\nodd = []\r\nfor i in arr:\r\n\tif i%2 == 0:\r\n\t\teven.append(i)\r\n\telse:\r\n\t\todd.append(i)\r\nif len(odd) == 1:\r\n\tprint(arr.index(odd[0])+1)\r\nelse:\r\n\tprint(arr.index(even[0])+1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nlasteven=0\r\nlastodd=0\r\nfor i in range(len(arr)):\r\n if arr[i]%2==0:\r\n even+=1\r\n lasteven=i\r\n else:\r\n even-=1\r\n lastodd=i\r\nif even>0:\r\n print(lastodd+1)\r\nelse:\r\n print(lasteven+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n s.append(0)\r\n else:\r\n s.append(1)\r\nif s.count(1)==1:\r\n print(s.index(1)+1)\r\nelse:\r\n print(s.index(0)+1)", "b = int(input())\r\na = input().split(\" \")\r\nd = []\r\no = 0\r\nl = 0\r\ni = 0\r\ns = 0\r\nm = 0\r\nwhile i < len(a) :\r\n d.append(int(a[i]))\r\n i = i + 1\r\ni = 0\r\nwhile i < len(d) :\r\n if d[i] % 2 == 0 :\r\n o = i\r\n s = s + 1\r\n if d[i] % 2 == 1 :\r\n l = i\r\n m = m + 1\r\n i = i + 1\r\nif (s == 1) :\r\n print(o + 1)\r\nif (m == 1) :\r\n print(l + 1)\r\n", "n=int(input())\r\nli=list(map(int,input().split(\" \")))\r\ne=0\r\no=0\r\nfor i in range(0,n):\r\n if li[i]%2==0:\r\n e+=1\r\n anse=i+1\r\n else:\r\n o+=1\r\n anso=i+1 \r\nif o==1:\r\n print(anso)\r\nelif e==1:\r\n print(anse)", "n = input()\r\nppp = [int(x)%2 for x in input().split()]\r\nprint(ppp.index(sum(ppp) == 1) + 1)", "n = int(input())\nch = 0\nnech = 0\na = list(map(int, input().split()))\nfor i in range(n):\n if a[i]%2 == 0:\n ch+=1\n else:\n nech+=1 \n\nif ch > 1:\n for i in range(n):\n if a[i]%2 != 0:\n print(a.index(a[i])+1) \n \nelse:\n for i in range(n):\n if a[i]%2 == 0:\n print(a.index(a[i])+1) \n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc1,c2=0,0\r\nfor i in l:\r\n if i%2==0:\r\n c1+=1\r\n else:\r\n c2+=1\r\nfor i in l:\r\n if c1>c2:\r\n if i%2==1:\r\n print(l.index(i)+1)\r\n else:\r\n if i%2==0:\r\n print(l.index(i)+1)\r\n ", "n = int(input())\r\nL = list(map(int, input().split()))\r\nc1,c2 = 0,0\r\nfor i in range(3):\r\n if L[i] % 2 == 0:\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nind = 0\r\nif c1 > c2:\r\n for i in range(n):\r\n if L[i] % 2 != 0:\r\n ind = i + 1\r\n break\r\nelse:\r\n for i in range(n):\r\n if L[i] % 2 == 0:\r\n ind = i + 1\r\n break\r\nprint(ind)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Mar 30 21:57:40 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\nc=0\r\nv=0\r\nfor i in m:\r\n if i%2==0:\r\n c+=1\r\n z=m.index(i)\r\n else:\r\n v+=1\r\n y=m.index(i)\r\n if c>v and c>1 and v==1:\r\n print(y+1)\r\n break\r\n elif v>c and v>1 and c==1:\r\n print(z+1)\r\n break\r\n \r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nb.append(a[0]%2)\r\nb.append(a[1]%2)\r\nb.append(a[2]%2)\r\nif(b.count(1)>b.count(0)):\r\n c=1\r\nelse:\r\n c=0\r\nfor i in range(n):\r\n if(a[i]%2!=c):\r\n print(i+1)\r\n break\r\n\r\n", "k = int(input())\r\nm = list(map(int, input().split()))\r\nh = m[0]%2\r\ng = m[1]%2\r\nf = m[2]%2\r\nl = 0\r\nfor i in range(k):\r\n if h+g+f<2:\r\n if m[i]%2!=0:\r\n l=i+1\r\n break\r\n else:\r\n if m[i]%2==0:\r\n l=i+1\r\n break\r\n\r\nprint(l)", "def main():\r\n n = int(input().strip())\r\n nums = list(map(int, input().strip().split()))\r\n evens = sum([1 for x in nums if x % 2 == 0])\r\n odds = n - evens\r\n if evens > odds:\r\n for i in range(n):\r\n if nums[i] % 2 == 1:\r\n print(i + 1)\r\n break\r\n else:\r\n for i in range(n):\r\n if nums[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nodd1 = a[0]%2==1\r\nodd2 = a[1]%2==1\r\nif odd1 != odd2:\r\n odd3 = a[2]%2==1\r\n print(2 if odd1 == odd3 else 1)\r\nelse:\r\n for i in range(2,n):\r\n oddi = a[i]%2==1\r\n if oddi != odd1:\r\n print(i+1)\r\n break", "x= eval(input())\r\ny = [eval(i) for i in input().split()]\r\na = (y[0] % 2 == 0)\r\nb = (y[1] % 2 == 0)\r\nif a == b:\r\n for i in range(x):\r\n if (y[i] % 2 == 0) != a:\r\n print(i + 1)\r\nelse:\r\n c = (y[2] % 2 == 0)\r\n if c == b:\r\n print(1)\r\n else:\r\n print(2)", "iqq=int(input())\r\niql=list(map(int,input().split()))\r\nodc,evc=0,0\r\nfor iv in range(iqq):\r\n if iql[iv]%2!=0:\r\n od=iv\r\n odc+=1\r\n else:\r\n ev=iv\r\n evc+=1\r\nprint(od+1) if odc==1 else print(ev+1)", "t=int(input())\r\nn=input().split()\r\ne=[]\r\no=[]\r\nfor i in range(len(n)):\r\n if int(n[i])%2==0:\r\n e.append(i+1)\r\n continue\r\n o.append(i+1)\r\nif len(o)==1:\r\n print(o[0])\r\n exit()\r\nprint(e[0])", "n, s = int(input()), input().split()\r\nnums = [int(num) for num in s]\r\neven = []\r\nodd = []\r\n\r\nfor place, num in enumerate(nums):\r\n if num % 2 == 0:\r\n even.append([num, place + 1])\r\n else:\r\n odd.append([num, place + 1])\r\n\r\nif len(even) > len(odd):\r\n for value in odd:\r\n print(value[1], end=' ')\r\nelse:\r\n for value in even:\r\n print(value[1], end=' ')\r\n", "n=int(input())\r\na=input()\r\n\r\na_list=a.split()\r\ncount1=0 \r\ncount2=0 \r\ncount_list1=[]\r\ncount_list2=[]\r\nfor i in range(len(a_list)):\r\n if int(a_list[i])%2==0:\r\n count1+=1 \r\n count_list1.append(i+1)\r\n \r\n else:\r\n count2+=1 \r\n count_list2.append(i+1)\r\n \r\nif count1<count2:\r\n print(count_list1[0])\r\nelse:\r\n print(count_list2[0])\r\n\r\n \r\n\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nlis=[x%2 for x in li]\r\nif lis.count(0)>lis.count(1):\r\n print(lis.index(1)+1)\r\nelse:\r\n print(lis.index(0)+1)", "san = int(input())\r\nlst = list(map(int, input().split()))\r\nc = []\r\ns = []\r\nfor i in range(san):\r\n if lst[i] % 2 == 0:\r\n c.append(lst[i])\r\n else:\r\n s.append(lst[i])\r\nif len(c) == 1:\r\n for i in range(len(lst)):\r\n if c[0] == lst[i]:\r\n print(i+1)\r\nelse:\r\n for i in range(len(lst)):\r\n if s[0] == lst[i]:\r\n print(i+1)", "n = int(input())\r\ngivenarr = [int(x) for x in input().split()]\r\narr = sorted(givenarr)\r\nevenarr = []\r\nevenflag = 0\r\nfor i in arr:\r\n if i % 2 == 0:\r\n evenarr.append(i)\r\n if len(evenarr) >= 2:\r\n evenflag = 1\r\n break \r\n elif arr.index(i) == 2:\r\n evenflag = 0\r\nif evenflag == 1:\r\n res_arr = list(filter(lambda i: i % 2 != 0, arr))\r\nelse:\r\n res_arr= list(filter(lambda i: i%2 == 0, arr))\r\nprint(givenarr.index(res_arr[0])+1) ", "n = int(input())\r\na = list(map(int,input().split()))\r\nc1 = []\r\nc2 = []\r\nfor i in a:\r\n if(i%2==0):\r\n c1.append(i)\r\n else:\r\n c2.append(i)\r\nif(len(c1) < len(c2)):\r\n print(a.index(c1[0])+1)\r\nelse:\r\n print(a.index(c2[0])+1)", "# Wadea #\r\n\r\ns = int(input())\r\ns = input().split()\r\nlst = []\r\nfor i in s:\r\n i = int(i)\r\n lst.append(i)\r\neven = 0\r\nodd = 0\r\nfor j in lst:\r\n if j % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif even > odd:\r\n for k in lst:\r\n if k % 2 != 0:\r\n print(lst.index(k)+1)\r\nelse:\r\n for q in lst:\r\n if q % 2 == 0:\r\n print(lst.index(q)+1)\r\n", "n=int(input())\r\narr=[int(i)&1 for i in input().split()]\r\nodd=even=0\r\nfor i in range(n-2):\r\n a,b,c=arr[i],arr[i+1],arr[i+2]\r\n if a==b and b!=c:\r\n print(i+3)\r\n break\r\n if b==c and c!=a:\r\n print(i+1)\r\n break\r\n if a==c and c!=b:\r\n print(i+2)\r\n break", "N = int(input())\r\nA = [int(x) % 2 for x in input().split()]\r\nB = sum(A)\r\nif B == 1:\r\n C = A.index(1)\r\n print(C+1)\r\nelse:\r\n C = A.index(0)\r\n print(C+1)\r\n\r\n\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\na=y[0]%2\r\nb=y[1]%2\r\nc=y[2]%2\r\nif a!=b:\r\n if a ==c:\r\n print(2)\r\n else:\r\n print(1)\r\nelif a==b :\r\n for i in range (2,x):\r\n if y[i]%2 !=a:\r\n print(i+1)\r\n\r\n", "input()\r\nx=input()\r\nx=x.split()\r\na=0\r\nfor i in range(0,3):\r\n if int(x[i])%2==0:\r\n a-=1\r\n else:\r\n a+=1\r\nif a<0:\r\n for i in range(0,len(x)):\r\n if int(x[i])%2==1:\r\n print(i+1)\r\n exit()\r\nif a>0:\r\n for i in range(0,len(x)):\r\n if int(x[i])%2==0:\r\n print(i+1)\r\n exit()\r\n \r\n", "n = int(input())\r\nlist = [int(x) % 2 for x in input().split()]\r\na = list.count(0)\r\nb = list.count(1)\r\nif a > b:\r\n print(list.index(1) + 1)\r\nelif a < b:\r\n print(list.index(0) + 1)", "n=int(input())\r\nline=[int(i) for i in input().split()]\r\na=line[0];b=line[1]\r\nif a%2==0 and b%2==0:\r\n for i in range(2,n):\r\n if line[i]%2==1:\r\n break\r\n print(i+1)\r\nif a%2==1 and b%2==1:\r\n for i in range(2,n):\r\n if line[i]%2==0:\r\n break\r\n print(i+1)\r\nif a%2==1 and b%2==0:\r\n if line[2]%2==0:\r\n print(1)\r\n else:\r\n print(2)\r\nif a%2==0 and b%2==1:\r\n if line[2]%2==0:\r\n print(2)\r\n else:\r\n print(1)\r\n \r\n \r\n", "n=int(input())\r\nli=[int(i) for i in input().split()]\r\neven=0\r\nodd=0\r\nfor i in range(len(li)):\r\n if li[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even==1:\r\n for i in range(len(li)):\r\n if li[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(li)):\r\n if li[i]%2!=0:\r\n print(i+1)", "n = int(input())\r\nline = [int(i) for i in input().split()]\r\nlinenew = []\r\nfor i in range(n):\r\n if line[i]%2 == 0:\r\n linenew.append(0)\r\n else:\r\n linenew.append(1)\r\nif linenew.count(0) == n-1:\r\n print(linenew.index(1)+1)\r\nelse:\r\n print(linenew.index(0)+1)", "n = int(input())\r\nlst = [int(_) for _ in input().split()]\r\nfor i in range(1,n-1):\r\n if ((lst[i] % 2) - (lst[i-1] % 2)) and ((lst[i] % 2) - (lst[i+1] % 2)):\r\n print(i+1)\r\n exit(0)\r\nif lst[0] % 2 - lst[1] % 2:\r\n print(1)\r\nelse:\r\n print(n)\r\n", "n=int(input())\r\nmas=list(map(int,input().split()))\r\nif mas[0]%2==mas[1]%2:\r\n if mas[0]%2==0:\r\n ost=1\r\n else:\r\n ost=0\r\n for i in range(n):\r\n if mas[i]%2==ost:\r\n print(i+1)\r\nelse:\r\n if mas[0]%2==mas[2]%2:\r\n print(2)\r\n else:\r\n print(1)\r\n \r\n", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nevens = odds = 0\r\neveni = oddi = 0\r\n \r\nfor i, x in enumerate(nums):\r\n if x % 2:\r\n odds += 1\r\n oddsi = i+1\r\n else:\r\n evens += 1\r\n evensi = i+1\r\n \r\n if odds > 1 and evens == 1:\r\n print(evensi)\r\n break\r\n if evens > 1 and odds == 1:\r\n print(oddsi)\r\n break", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nev = 0\r\nod = 0\r\nfor i in li:\r\n if(i%2 == 0):\r\n ev += 1\r\n ev_i = li.index(i)+1\r\n else:\r\n od += 1\r\n od_i = li.index(i)+1\r\nif(ev == 1):\r\n print(ev_i)\r\nelse:\r\n print(od_i)", "def even(a):\r\n m=0\r\n n=0\r\n for i in range(len(a)):\r\n if a[i]%2==0:\r\n m=m+1\r\n if a[i]%2==1:\r\n n=n+1\r\n if m>n:\r\n return(0)\r\n else:\r\n return(1)\r\n\r\nn=input()\r\nb=[int(i) for i in input().split()]\r\n\r\nif even(b)==0:\r\n for k in range(len(b)):\r\n if b[k]%2==1:\r\n print(k+1)\r\nif even(b)==1:\r\n for j in range(len(b)):\r\n if b[j]%2==0:\r\n print(j+1)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ndef even(s):\r\n if s%2:\r\n return False\r\n return True\r\ndef odd(s):\r\n if s%2:\r\n return True\r\n return False\r\nb=list(filter(even,a))\r\nc=list(filter(odd,a))\r\nif len (b )== 1:\r\n print(a.index(b[0])+1)\r\n exit()\r\nprint(a.index(c[0])+1)\r\n", "n=int(input())\r\ns=input()\r\na=[]\r\nflag1=0\r\nflag0=0\r\nfor i in s.split():\r\n a.append(int(i))\r\n if int(i)%2==0:\r\n flag0+=1\r\n else:\r\n flag1+=1\r\nif flag0>flag1:\r\n flag=0\r\nelse:\r\n flag=1\r\nfor i in range(n):\r\n if a[i]%2!=flag:\r\n print(i+1)\r\n break", "n = int(input())\r\nm = list(map(int,input().split()))\r\nl = len([i for i in m[:3] if i%2 == 0])\r\nif l > 1:\r\n for i in range(n):\r\n if m[i]%2 != 0: print(i+1)\r\nelse:\r\n for i in range(n):\r\n if m[i]%2 == 0: print(i+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 2 10:00:37 2023\r\n\r\n@author: 高铭泽 2300011427\r\n\"\"\"\r\nn=int(input())\r\nnumber=list(map(int,input().split()))\r\nk=0\r\nfor i in range(3):\r\n a=number[i]%2\r\n if a==0:\r\n k=k+1\r\nif k>=2:\r\n for j in range(n):\r\n if number[j]%2!=0:\r\n print(j+1)\r\n break\r\nelse:\r\n for j in range(n):\r\n if number[j]%2==0:\r\n print(j+1)\r\n break\r\n \r\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nindex = 0\r\ncounter = 0\r\nfor i in range(len(nums)):\r\n if nums[i] % 2 != 0:\r\n counter += 1\r\n index = i + 1\r\n\r\nif counter == 1:\r\n print(index)\r\nelse:\r\n for num in nums:\r\n if num % 2 == 0:\r\n print(nums.index(num) + 1)\r\n ", "n=int(input())\na=list(map(int,input().split()))\neven=[]\nodd=[]\nfor i in range(n):\n if(a[i]%2==0):\n even.append(i)\n else:\n odd.append(i)\nprint(even[0]+1 if(len(even)==1) else odd[0]+1)", "a = int(input())\r\nn = [int (i) for i in input().split()]\r\nif n[0]%2==0 and n[1]%2==0 or n[0]%2==0 and n[2]%2==0 or n[1]%2==0 and n[2]%2==0:\r\n for i in range (a):\r\n if n[i]%2==1:\r\n print((n.index(n[i]))+1)\r\n break\r\nelse:\r\n for i in range(a):\r\n if n[i]%2==0:\r\n print((n.index(n[i]))+1)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nc=0\r\nfor i in range(len(l)):\r\n if(l[i]%2==0):\r\n l1.append(i)\r\n \r\n else:\r\n l2.append(i)\r\n#print(l1,l2) \r\nif(len(l1)==1):\r\n for i in l1:\r\n print( i+1)\r\nif(len(l2)==1):\r\n for i in l2:\r\n print( i+1)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor i in nums[0:3]:\r\n if i%2!=0:\r\n odd+=1\r\n else:\r\n even+=1\r\nif odd>even:\r\n for i in nums:\r\n if i %2==0:\r\n print(nums.index(i)+1)\r\n break\r\nelse:\r\n for i in nums:\r\n if i %2!=0:\r\n print(nums.index(i)+1)\r\n break\r\n", "n = int(input())\nlist_ = input()\nlist_ = list(map(int, list(list_.split())))\n\ncont_par, cont_impar, index_par, index_impar = 0, 0, 0, 0\nfor index, el in enumerate(list_):\n if el%2==0:\n cont_par+=1\n index_par = index\n if el%2==1:\n cont_impar+=1\n index_impar = index\nif cont_par==1:\n print(index_par+1)\nif cont_impar==1:\n print(index_impar+1)", "n = int(input())\r\narr = tuple(int(i) for i in input().split())\r\n\r\neven_count,even_index = 0,0\r\nodd_count,odd_index = 0,0\r\n\r\n\r\nfor i,j in enumerate(arr):\r\n\tif j%2==0:\r\n\t\teven_index = i\r\n\t\teven_count +=1\r\n\telse:\r\n\t\todd_index = i\r\n\t\todd_count += 1\r\n\r\nprint(even_index+1 if even_count==1 else odd_index+1)\r\n", "n=int(input())\r\nb=list(map(int, input().split()))\r\nch=0\r\ncolch=0\r\nnech=0\r\ncolnech=0\r\nfor k,i in enumerate(b):\r\n if i%2==0:\r\n ch=k\r\n colch+=1\r\n else:\r\n nech=k\r\n colnech+=1\r\nprint ((ch if colch==1 else nech)+1)", "##a=str(input())\r\n##b=\"\"\r\n##for i in range(len(a)):\r\n## if i%3!=0:\r\n## print(a[i], end=\"\")\r\n\r\n\r\n##n=int(input()) #кол-во соревнований\r\n##list_= [int(value) for value in input().split()] #кол-во баллов во всех соревнованиях\r\n##list2=[list_.pop(0)] #удаляем баллы за первое соревнование и помещаем в новый список\r\n##maxim=0\r\n##minim=0\r\n##for i in list_: #проверяем каждое его соревнование на баллы\r\n## if i>max(list2): #провеяем если он набрал за новое соревнования больше баллов чем в\r\n## maxim+=1 #предыдщуих всех соревнованиях наращиваем удивительное соревнование\r\n## elif i<min(list2): #если он набрал за новое соревнования меньше баллов чем в\r\n## minim+=1#предыдщуих всех соревнованиях наращиваем удивительное соревнование\r\n## list2.append(i)#добавляем баллы за его соревнование во второй список\r\n##print(maxim+minim)#выводим общее кол-во удивительных соревнований\r\n\r\n\r\n###минимальное кол-во денег надо потратить, чтобы уровнять всех\r\n##n=int(input()) #кол-во граждан\r\n##a=list(map(int,input().split())) #бюджет каждого отдельного человека\r\n##z=max(a) #самый большой капитал человека к которому мы будем уравнивать\r\n##q=0 #общее кол-во денег всех граждан\r\n##for i in a:\r\n## q+=i\r\n##print(z*n-q)\r\n\r\n\r\n###что егор накачает больше всего\r\n##n=int(input()) #сколько упражнений он выполнит 1-грудь 2-бицепс 3-спина 4 грудь и т д\r\n##a=list(map(int,input().split()))#повторы упражнений\r\n##chest=0 #наращиваем сколько он сделал упражнений на грудь\r\n##biceps=0 #наращиваем сколько он сделал упражнений на бицепс\r\n##back=0 #наращиваем сколько он сделал упражнений на спину\r\n##for i in range(len(a)):\r\n## if i%3==0:\r\n## chest+=a[i]\r\n## if i%3==1:\r\n## biceps+=a[i]\r\n## if i%3==2:\r\n## back+=a[i]\r\n##if chest>biceps: #выводим какое упражнение он делал больше всех\r\n## if chest>back:\r\n## print(\"chest\")\r\n## else:\r\n## print(\"back\")\r\n##elif biceps>chest:\r\n## if biceps>back:\r\n## print(\"biceps\")\r\n## else:\r\n## print(\"back\")\r\n##elif back>chest:\r\n## if back>biceps:\r\n## print(\"back\")\r\n## else:\r\n## print(\"biceps\")\r\n\r\n##n=str(input())\r\n##q=\"aoyeui\"\r\n##n=n.lower()\r\n##z=\"\"\r\n##for i in range(len(n)):\r\n## if n[i] not in q:\r\n## z=z+\".\"+n[i]\r\n##print(z)\r\n##n=str(input().lower())\r\n##q=\"aoyeui\"\r\n##for i in n:\r\n## if i in q:\r\n## n=n.replace(i, \"\")\r\n##n=\".\".join(n)\r\n##print(\".\"+n)\r\n\r\n\r\n##s=list(map(int,input().split())) #подковы валеры\r\n##q=set() #создаем пустое множество\r\n##for i in s:\r\n## q.add(i) #добавляем каждый элемент списка, во мсножество, дублирующие-->\r\n##print(len(s)-len(q)) #удаляются. Вычитаем кол-во из списка и из множества\r\n\r\n\r\n##n=int(input()) #кол-во напитков у васи\r\n##p=list(map(int,input().split())) #доля в процентах каждого напитка\r\n##q=0\r\n##for i in p:\r\n## q+=i #накапливаем общие проценты всех напитков\r\n##print(q/len(p)) #узнаем среднее\r\n\r\n##n,k=map(int,input().split()) #n- сколько человек есть k-сколько раз они должны выступить\r\n##y=list(map(int, input().split())) #сколько раз каждый участник выступал уже\r\n##count=0 \r\n##for i in y: #создаем цикл по каждому значению списка\r\n## if 5-i>=k: #проверяем если человек может выступить на чемпионате k раз\r\n## count+=1 #то накапливаем этих людей\r\n##print(int(count/3)) # выводим сколько команд можно составить\r\n\r\n##n=str(input())#первая строка с 0 и 1 гарантировано, что len(n)==len(z)\r\n##z=str(input())#вторая строка с 0 и 1\r\n##s=\"\"\r\n##for i in range(0, len(n)):#проходим по индексам строки\r\n## if n[i]==z[i]:# проверяем если первый элемент n равен первому элементу z\r\n## s+=\"0\"#конкатанируем в s + 0\r\n## else:\r\n## s+=\"1\"#иначе s + 1\r\n##print(s)#выводим s\r\n\r\n\r\n##n, h=map(int,input().split())#n- кол-во друзей,h- высота забора\r\n##a = list(map(int,input().split())) #высота каждого отдельного друга\r\n##count=0#ширина дороги которую будем наращивать\r\n##for i in a: #проходимя по росту каждого друга\r\n## if i>h:#если его высота больше высоты забора, н должен пригнуться и его ширина становится 2\r\n## count+=2\r\n## else:\r\n## count+=1 #иначе его ширина равна 1\r\n##print(count)#выводим миниальную ширину дороги\r\n\r\n\r\n###Вася хочет соорудить из всех брусков минимальное количество башенок.\r\n###Бруски можно класть сверху один на другой, если длины брусков совпадают.\r\n##n=int(input())#кол-во брусков\r\n##l=list(map(int,input().split()))#длинна каждого отдельного бруска\r\n##s=set()#накапливаем пустое множество, чтобы узнать сколько всего количесвто башен\r\n##c=set()# это множество помещаем сколько раз встречается башенки одинаковой длинны\r\n##for i in l:# и выводим максимальную высоту башни\r\n## z=l.count(i)\r\n## c.add(l.count(i))\r\n## s.add(i)\r\n##print(max(c), len(s))\r\n\r\n\r\n##n=int(input()) #сколько партий съиграли в шахматы\r\n##z=str(input()) #исход партии где A обедил антон, D даник\r\n##a=0\r\n##d=0\r\n##for i in z:\r\n## if i==\"A\": #накапливаем победы антона\r\n## a+=1\r\n## elif i==\"D\": #накапливаем победы даника\r\n## d+=1\r\n##if a>d:\r\n## print(\"Anton\")\r\n##elif d>a:\r\n## print(\"Danik\")\r\n##else:\r\n## print(\"Friendship\")\r\n\r\n\r\n##s=str(input()) #вводится строка\r\n##small=0 #узнаем сколько маленьких букв в ней\r\n##big=0 #и больших\r\n##for i in s:\r\n## if i>=\"a\" and i<=\"z\":\r\n## small+=1\r\n## else:\r\n## big+=1\r\n##if small>=big:\r\n## s=s.lower()\r\n## print(s) #если маленьких больше или равно большим буквам, выводим строку в нижнем регистре\r\n##else:\r\n## s=s.upper()\r\n## print(s) #если больших больше чем маленьких выводим в большом регистре\r\n\r\n\r\nn=int(input())\r\nz=list(map(int,input().split()))\r\nc=list()\r\nm=list()\r\nfor i in z:\r\n if i%2==0:\r\n c.append(i)\r\n else:\r\n m.append(i)\r\nif len(c)>len(m):\r\n print(z.index(m[0])+1)\r\nelse:\r\n print(z.index(c[0])+1)\r\n", "n = int(input(\"\"))\r\nli=[]\r\ncount=0\r\nli = list(map(int, input(\"\").split())) \r\nv1=li[0]\r\nv2=li[1]\r\nv3=li[2]\r\nif (v1+v2)%2==0:\r\n if (v1+v3)%2==0:\r\n for i in li[2:]:\r\n if (v1+i)%2==0:\r\n continue\r\n if (v1+i)%2!=0:\r\n print(li.index(i)+1)\r\n\r\n if (v1+v3)%2!=0:\r\n print(li.index(v3)+1)\r\nif (v1+v2)%2!=0:\r\n if (v1+v3)%2!=0:\r\n print(li.index(v1)+1)\r\n if (v1+v3)%2==0:\r\n print(li.index(v2)+1)\r\n\r\n\r\n", "a = int(input())\r\ny = list(map(int,input().split()))\r\no=[]\r\ne=[]\r\nfor i in range(a):\r\n if (y[i]%2==0):\r\n e.append(y[i])\r\n if (y[i]%2!=0):\r\n o.append(y[i])\r\nif(len(o)>len(e)):\r\n print(y.index(e[0])+1)\r\nelse:\r\n print(y.index(o[0])+1)", "n=input() ; odd=0 ; even=0\r\nnum = [int(x) for x in input().split()]\r\nfor x in num:\r\n if odd==2 or even==2: break\r\n elif x%2!=0: odd+=1\r\n else: even+=1\r\nif odd==2:\r\n for x in num:\r\n if x%2==0: print(num.index(x)+1)\r\nelse:\r\n for x in num:\r\n if x%2!=0: print(num.index(x)+1)", "num = int(input().strip())\r\neven,odd = [],[]\r\nline = input().strip().split()\r\nfor i in range(num):\r\n if int(line[i])%2 == 0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\nprint(odd[0] if len(even) > len(odd) else even[0])", "kactane = int(input())\r\ndizi = input().split()\r\nteklist = []\r\nciftlist = []\r\ncount = 0\r\n\r\nfor i in range(kactane):\r\n if int(dizi[i]) % 2 == 0: ciftlist.append(dizi[i]) \r\n else: teklist.append(dizi[i])\r\n\r\nif len(ciftlist) > len(teklist): \r\n for a in dizi:\r\n count += 1\r\n if a == teklist[0]: print(count) \r\nelse: \r\n for a in dizi:\r\n count += 1\r\n if a == ciftlist[0]: print(count) ", "n = int(input())\r\nnums = [int(i)%2 for i in input().split()]\r\nif(sum(nums) == 1):\r\n print(nums.index(1)+1)\r\nelse:\r\n print(nums.index(0)+1)", "n=int(input())\nl=list(map(int,input().split()))\neven=0\nodd=0\na=0\nb=0\nfor i in range(n):\n if l[i]%2==0:\n even+=1\n a=i+1\n elif l[i]%2==1:\n odd+=1\n b=i+1\nif even==n-1 and odd==1:\n print(b)\nelse:\n print(a)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nremainder = 0 if sum(1 if x % 2 == 1 else 0 for x in a[:3]) >= 2 else 1\r\nfor i in range(n):\r\n if a[i] % 2 == remainder:\r\n print(i + 1)\r\n break\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor i in range(0,len(l)):\r\n if(l[i]%2==0):\r\n e.append(i)\r\n elif(l[i]%2!=0):\r\n o.append(i)\r\n if(len(e)>1 and len(o)==1):\r\n print(o[0]+1)\r\n break\r\n if (len(o) > 1 and len(e) == 1):\r\n print(e[0] + 1)\r\n break\r\n", "n = int(input())\r\nnums = list(map(int, input().split(\" \")))\r\nodd = []\r\neven = []\r\nfor index, i in enumerate(nums):\r\n if i % 2 == 0:\r\n even.append(index+1)\r\n else:\r\n odd.append(index+1)\r\n\r\n\r\nif len(odd) == 1:\r\n print(odd[0])\r\nelse:\r\n print(even[0])\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt = [i % 2 for i in t]\r\nif t.count(0) == 1: print(t.index(0) + 1)\r\nelse: print(t.index(1) + 1)", "n = int(input())\r\ns = input().split()\r\nodd = 0\r\neven = 0\r\nposition = 0\r\nfor i in range(len(s)):\r\n if int(s[i])%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif even > odd:\r\n for i in range(len(s)):\r\n if int(s[i])%2 != 0:\r\n position = s.index(s[i]) + 1\r\n break\r\nelse:\r\n for i in range(len(s)):\r\n if int(s[i]) % 2 == 0:\r\n position = s.index(s[i]) + 1\r\n break\r\nprint(position)\r\n", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n):\n\tif a[i]%2 != a[(i+1)%n]%2 and a[i]%2 != a[(i+2)%n]%2:\n\t\tprint(i+1)\n\t\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl1=[int(x)%2 for x in l]\r\nprint(l1.index(sum(l1)==1)+1)\r\n", "\r\nn=input()\r\nn=int(n)\r\na=int(0)\r\nb=int(0)\r\n\r\nx=input().split()\r\n\r\nfor i in range(n):\r\n x[i]=int(x[i])\r\n if x[i]%2==0:\r\n a+=1\r\n else:\r\n b+=1\r\n\r\nfor i in range(n):\r\n if a==1 and x[i]%2==0:\r\n print(i+1)\r\n if b==1 and x[i]%2==1:\r\n print(i+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 24 13:34:03 2020\r\n\r\n@author: Equipo\r\n\"\"\"\r\n\r\nwhile True:\r\n n = int(input())\r\n if (n>=3 and n<=100):\r\n break\r\n\r\na = input().split(\" \")\r\nEven_index = []\r\nOdd_index = []\r\n\r\nfor i in range(n):\r\n if (int(a[i])%2==0):\r\n Even_index.append(i+1)\r\n else:\r\n Odd_index.append(i+1)\r\n\r\nif (len(Odd_index)>len(Even_index)):\r\n print(Even_index[0])\r\nelse:\r\n print(Odd_index[0]) ", "numbers = int(input())\r\nintegers = list(map(int,input().split()))\r\neven = [i for i in integers if i % 2 == 0]\r\nodd = [i for i in integers if i % 2 != 0]\r\nif len(even) == 1:\r\n print(integers.index(even[0])+1)\r\nelif len(odd) == 1:\r\n print(integers.index(odd[0]) + 1)", "n=int(input())\na=input().split()\nl=[]\nfor i in range(n):\n l.append(int(a[i]))\na1=0\nb1=0\nfor i in range(n):\n if l[i]%2==0:\n a1+=1\n else:\n b1+=1\nif a1>b1:\n for i in range(n):\n if l[i]%2!=0:\n d=i\nelse:\n for i in range(n):\n if l[i]%2==0:\n d=i\nprint(d+1)\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nne=0\r\nno=0\r\nr=[0]*2\r\nfor i in range(len(l)):\r\n if(l[i]%2==0):\r\n ne+=1 \r\n if(ne==1):\r\n r[0]=i+1\r\n else:\r\n no+=1 \r\n if(no==1):\r\n r[1]=i+1\r\nif(ne==1):\r\n print(r[0])\r\nelse:\r\n print(r[1])", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = list(map(int, stdin.readline().split()))\r\nco = ce = 0\r\nido = ide = 0\r\ni = 1\r\nfor ele in a:\r\n if ele%2:\r\n co += 1\r\n ido = i\r\n else:\r\n ce += 1\r\n ide = i\r\n i += 1\r\nif co == 1:\r\n print(ido)\r\nelse:\r\n print(ide)", "n = int(input())\r\na = list(map(int,input().split()))\r\ni = 0\r\nk1 = 0\r\nk2 = 0\r\nwhile i < n:\r\n if a[i] % 2 ==0:\r\n k2 += 1\r\n else:\r\n k1 += 1\r\n i += 1\r\n\r\ni = 0 \r\nif k1 > k2:\r\n while i < n:\r\n if a[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\n else:\r\n i += 1\r\nelse:\r\n while i < n:\r\n if a[i] % 2 == 1:\r\n print(i + 1)\r\n break\r\n else:\r\n i += 1\r\n", "n = int(input())\r\nx = [int(x) for x in input().split()]\r\neven = []\r\nodd = []\r\nfor i in x:\r\n if i % 2 == 0:\r\n even.append(x.index(i))\r\n else:\r\n odd.append(x.index(i))\r\nif len(even) == 1:\r\n pos = (even[0] + 1)\r\n print(pos)\r\nelif len(odd) == 1:\r\n pos = (odd[0] + 1)\r\n print(pos)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\n\r\nncountji=0\r\nncountou=0\r\n\r\nfor i in range(n):\r\n if ncountji<=1 and ncountou<=1:\r\n if a[i]%2==1:\r\n ncountji+=1\r\n else:\r\n ncountou+=1\r\nif ncountji==2:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n exit()\r\nelif ncountou==2:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\n exit()\r\n", "n=int(input())\r\na=input()\r\na=a.split()\r\ns=[]\r\nfor i in range(len(a)):\r\n s.append(int(a[i]))\r\nif (s[0]%2==s[1]%2 and s[0]%2==0) or (s[-1]%2==s[-2]%2 and s[-1]%2==0) or (s[0]%2==s[-1]%2 and s[0]%2==0):\r\n t=0\r\nelse:\r\n t=1\r\nfor i in range(len(s)):\r\n if s[i]%2!=t:\r\n print(i+1)", "nb_numbers = input()\r\nnumbers = input()\r\n\r\nnumbers = [int(n) for n in numbers.strip().split(' ')]\r\n\r\nd = {'ODD': [], 'EVEN': []}\r\nfor idx, i in enumerate(numbers, 1):\r\n if str(i)[-1] in '02468':\r\n d['EVEN'].append(idx)\r\n else:\r\n d['ODD'].append(idx)\r\n\r\nprint(d['ODD'][0] if len(d['ODD']) == 1 else d['EVEN'][0])\r\n", "n = int(input())\nl = list(map(int, input().split()))\ne, o, a = 0, 0, -1\nfor i in range(0, 3):\n if (l[i] % 2 == 0): e+=1\n else: o+=1\nif (o > e): m = 0\nelse: m = 1\nfor i in range(0, n):\n if (l[i] % 2 == m): \n a = i+1\n break\nprint(a)\n \t \t\t\t\t\t\t\t\t\t \t\t \t\t\t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 17 13:44:19 2019\r\n\r\n@author: zheng\r\n\"\"\"\r\n\r\nn=int(input())\r\nl=[int(x)%2 for x in input().split()]\r\n\r\nif sum(l)==1:\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)\r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\np = 0\r\nq = 0\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n p= p +1\r\n else:\r\n q = q+1\r\nif p > q:\r\n for i in range(n):\r\n if arr[i] % 2 != 0 :\r\n j = i + 1\r\nelse:\r\n for i in range(n):\r\n if arr[i] % 2 == 0:\r\n j = i +1\r\nprint(j)", "n, numbers = int(input()), [int(i) for i in input().split()]\r\neven, odd = [], []\r\nfor i in range(n):\r\n number = numbers[i]\r\n if number % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nindex = even[0] if len(even) == 1 else odd[0]\r\nprint(index + 1)\r\n\r\n\r\n", "\nn = int(input())\n\nodd, even = [], []\n\nfor i, tmp in enumerate(map(int, input().split())):\n if tmp % 2 == 0:\n even += [(tmp, i)]\n else:\n odd += [(tmp, i)]\n\nif len(even) == 1:\n print(even[0][1] + 1)\nelse:\n print(odd[0][1] + 1)\n", "a=int(input())\r\nl=input().split(\" \")\r\ne=[]\r\no=[]\r\nfor i in range(a):\r\n if(int(l[i])%2==0):\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif(len(e)==1):\r\n print(e[0]+1)\r\nelse:\r\n print(o[0]+1)", "n=int(input())\r\ncount=0\r\ntemp=0\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n count+=1\r\n x=i+1\r\n else:\r\n temp+=1\r\n y=i+1\r\nif count ==1:\r\n print(x)\r\nelif temp==1:\r\n print(y)", "n = int(input())\r\ns = list(map(int,input().split()))\r\nzero = 0\r\none = 0\r\na = 0\r\nb = 0\r\n\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n zero += 1\r\n a = i\r\n else:\r\n one += 1\r\n b = i\r\n\r\nif zero == 1:\r\n print(a+1)\r\nelse:\r\n print(b+1)\r\n", "n = int(input())\r\na = [int(x)%2==0 for x in input().split()]\r\nif a.count(a[0]) > 1:\r\n print(a.index(not a[0])+1)\r\nelse:\r\n print(1)", "n=int(input())\r\nli=[int(i) for i in input().split()]\r\nev=[]\r\nod=[]\r\nfor i in li:\r\n if i%2==0:\r\n ev.append(i)\r\n else:\r\n od.append(i)\r\nl1=len(ev)\r\nl2=len(od)\r\nif l1==1:\r\n x=ev[0]\r\n pos=li.index(x)\r\n print(pos+1)\r\nif l2==1:\r\n x=od[0]\r\n pos=li.index(x)\r\n print(pos+1)\r\n\r\n", "n = int(input())\r\nodd = 0\r\neven = 0\r\nid1 = -1\r\nid2 = -1\r\narr = list(map(int,input().split()))\r\nfor i in range(0,n):\r\n if arr[i] % 2 == 0:\r\n even += 1\r\n id1 = i\r\n else: \r\n odd +=1\r\n id2 = i\r\nif odd ==1:\r\n print(id2+1)\r\nelse:\r\n print(id1+1)", "input()\nl = list(map(int, input().split()))\nevn = 0\nodd = 0\nfor i in range(3):\n if l[i] % 2 == 0:\n evn += 1\n else:\n odd += 1\nfor i in range(len(l)):\n if evn <= 1:\n if l[i] % 2 == 0:\n print(i + 1)\n elif odd <= 1:\n if l[i] % 2 != 0:\n print(i + 1)\n", "n = int(input())\r\nnumList = [int(x)%2 for x in input().split()]\r\nprint([numList.index(1)+1, numList.index(0)+1][sum(numList)>1])", "n=int(input())\r\nvalues=list(map(int,input().split()))\r\nfor k in range(1,n-1):\r\n a,b,c=values[k-1]%2,values[k]%2,values[k+1]%2\r\n if a==b==c:\r\n pass\r\n elif a!=b and b==c:\r\n print(k)\r\n break\r\n elif b!=c and a==c:\r\n print(k+1)\r\n break\r\n else:\r\n print(k+2)\r\n break", "n=int(input())\r\nnums=[int(x) for x in input().split()]\r\n\r\nisEven=True #to be searched\r\nf=nums[0]%2==0\r\ns=nums[1]%2==0\r\nt=nums[2]%2==0\r\n\r\nif f and s or s and t or f and t:\r\n isEven=False\r\n\r\nelem=next(filter(lambda x: x%2==0 and isEven or x%2==1 and not isEven, nums))\r\nans=nums.index(elem)+1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\ncou1=0\r\ncou2=0\r\nli=list(map(int,input().split()))\r\nfor j in range(n):\r\n i=int(li[j])\r\n if i%2==0:\r\n cou1+=1\r\n even=j\r\n else:\r\n cou2+=1\r\n odd=j\r\nif cou1<cou2:\r\n print(even+1)\r\nelse:\r\n print(odd+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n b.append(a[i]%2)\r\nc = list(set(b))\r\nif b.count(0)>1:\r\n print(b.index(c[1])+1)\r\nelif b.count(0)==1:\r\n print(b.index(c[0])+1)", "n = int(input())\r\n\r\nlst = [int(_) for _ in input().split()]\r\n\r\nprve = lst[0] % 2\r\ndruhe = lst[1] % 2\r\ntretie = lst[2] % 2\r\n\r\npocet_parnych = [prve, druhe, tretie].count(0)\r\n\r\nif pocet_parnych <= 1:\r\n for i, e in enumerate(lst):\r\n if e % 2 == 0:\r\n print(i + 1)\r\nif pocet_parnych >= 2:\r\n for i, e in enumerate(lst):\r\n if e % 2 == 1:\r\n print(i + 1)", "x=int(input())\r\ny=[int(i)%2 for i in input().split()]\r\na=0\r\nfor i in range(x):\r\n if y[i]==0:\r\n a+=1\r\nif a==1:\r\n for i in range(x):\r\n if y[i]==0:\r\n print(i+1)\r\nelse:\r\n for i in range(x):\r\n if y[i]==1:\r\n print(i+1)", "x=int(input())\r\nc=[int(m)%2 for m in input().split()]\r\nc3=c[:3]\r\nif c3.count(0)>=2:\r\n print(c.index(1)+1)\r\nelse:\r\n print(c.index(0)+1)", "n= int(input())\r\nx=input().split()\r\np=0\r\nim=0\r\na=[]\r\n\r\nfor i in x:\r\n if int(i)%2 ==0:\r\n p+=1\r\n a.append(0)\r\n else:\r\n im+=1\r\n a.append(1)\r\n \r\n if p>im>0:\r\n print(a.index(1) +1)\r\n exit()\r\n elif im>p>0:\r\n print(a.index(0) +1)\r\n exit()", "n=int(input())\r\nl1 = list(map(int,input().split()))\r\nco=0\r\nce=0\r\nfor i in range(n):\r\n num=l1[i]\r\n if num%2==0:\r\n ce+=1\r\n le=l1[i]\r\n else:\r\n co+=1\r\n lo=l1[i]\r\n if ce>1:\r\n if co==1:\r\n print(l1.index(lo)+1)\r\n break\r\n elif co>1:\r\n if ce==1:\r\n print(l1.index(le)+1)\r\n break\r\n", "t=int(input())\r\nn=list(map(int,input().split()))\r\narr = [int(i) % 2 for i in n]\r\nflag = 0\r\nif arr.count(1) > arr.count(0):\r\n flag = 0\r\nelse:\r\n flag = 1\r\nprint(arr.index(flag) + 1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\na = list(map(lambda x: x%2, a))\r\nb = sorted(a)\r\nif b[len(b)//2] == 0:\r\n print (1 + a.index(1))\r\nelse:\r\n print (1 + a.index(0))\r\n", "n = int(input())\r\nnumbers = input().split()\r\npares = []\r\nimpares = []\r\nfor i in range(len(numbers)):\r\n if int(numbers[i]) %2 == 0:\r\n pares.append(i+1)\r\n else:\r\n impares.append(i+1)\r\n\r\nif len(pares) < len(impares):\r\n print(pares[0])\r\nelse:\r\n print(impares[0])\r\n", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\neven,odd = 0,0\r\n\r\nfor i in arr:\r\n \r\n if i % 2 == 0:\r\n \r\n even += 1\r\n \r\n else:\r\n \r\n odd += 1\r\n \r\nif even == 1:\r\n \r\n for i,j in enumerate(arr):\r\n \r\n if j % 2 == 0:\r\n \r\n print(i+1)\r\n \r\n break\r\n \r\nelse:\r\n \r\n for i,j in enumerate(arr):\r\n \r\n if j % 2 == 1:\r\n \r\n print(i+1)\r\n \r\n break", "even=0\r\nodd=0\r\nn=int(input())\r\nl=list(map(int, input().strip().split()))\r\nfor i in range(3):\r\n if l[i]%2==0:\r\n even=even+1\r\n else:\r\n odd= odd+1\r\n \r\nmaj_even=False\r\nif even>=2:\r\n maj_even=True\r\nelif odd>=2:\r\n maj_even=False\r\n\r\nfor i in range(n):\r\n if maj_even==True:\r\n if l[i]%2!=0:\r\n print(int(i+1))\r\n break\r\n elif maj_even==False:\r\n if l[i]%2==0:\r\n print(int(i+1))\r\n break\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nchet = []\r\nnechet = []\r\n\r\nfor i in arr:\r\n\tif i%2 == 0: chet.append(i)\r\n\telse: nechet.append(i)\r\nif len(chet) == 1: print(arr.index(chet[0])+1)\r\nelse: print(arr.index(nechet[0])+1)", "n = input()\r\narray = list(map(int,input().split()))\r\nevenIndex, oddIndex = 0,0\r\noddCounter, evenCounter = 0,0\r\nfor i in range(len(array)):\r\n if array[i]%2 == 0:\r\n evenCounter += 1\r\n evenIndex = i\r\n else:\r\n oddCounter += 1\r\n oddIndex = i\r\n\r\nif evenCounter > oddCounter :\r\n print(oddIndex + 1)\r\nelse:\r\n print(evenIndex + 1)\r\n\r\n\r\n", "k=int(input())\r\nmas = list(map(int,input().split(\" \")))\r\nmas1 = list()\r\nfor i in range(len(mas)):\r\n if mas[i]%2==0:\r\n mas1.append(0)\r\n else:\r\n mas1.append(1)\r\nif mas1.count(1)>1:\r\n print(mas1.index(0)+1)\r\nelse: print(mas1.index(1)+1)\r\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nodd, even = 0,0\r\nfor num in data:\r\n if num%2==0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\ntmp = 0 if odd>even else 1\r\nfor i in range(len(data)):\r\n if data[i]%2==tmp:\r\n print(i+1)\r\n break", "# 25A. IQ test\r\ncnt_odd = 0\r\ncnt_even = 0\r\nn = int(input())\r\nlst = [int(k) for k in input().split()]\r\nfor i in range(n):\r\n if lst[i]%2 == 1:\r\n cnt_odd += 1\r\n else:\r\n cnt_even += 1\r\nif cnt_odd == 1:\r\n for i in range(n):\r\n if lst[i]%2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if lst[i]%2 == 0:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\ncount_ch = []\r\ncount_nech = []\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n count_ch.append(numbers[i])\r\n else:\r\n count_nech.append(numbers[i])\r\nif len(count_ch) > len(count_nech):\r\n print(numbers.index(count_nech[0])+1)\r\nelse:\r\n print(numbers.index(count_ch[0])+1)", "n = int(input())\r\n\r\niq = list(map(int, input().split()))\r\n\r\nans = []\r\nfor i in iq:\r\n\tif i%2 == 0:\r\n\t\tans.append(0)\r\n\telse:\r\n\t\tans.append(1)\r\nif ans.count(0) == 1:\r\n\tprint(ans.index(0)+1)\r\nelif ans.count(1) == 1:\r\n\tprint(ans.index(1)+1)\r\n\r\n\t", "n = int(input())\r\na = list(map(lambda x: int(x) % 2, input().split()))\r\nprint(a.index(1 if a.count(1) == 1 else 0) + 1)", "t=int(input())\r\na=list(map(int,input().split()))\r\nx=a[0]%2\r\nif(a[1]%2!=x and a[2]%2!=x):\r\n print('1')\r\nelse:\r\n for i in range(1,t):\r\n if(a[i]%2!=x):\r\n print(i+1)", "n=int(input())\r\na=[int(i)%2 for i in input().split()]\r\na1=a.count(1)\r\na0=a.count(0)\r\nif a1==1:\r\n print(a.index(1)+1)\r\nelif a0==1:\r\n print(a.index(0)+1)", "num=int(input())\r\nu=[int(i) & 1 for i in input().split()]\r\nprint(u.index(u.count(0)>1)+1)", "n = int(input())\r\nnums = [int(x) % 2 for x in input().split()]\r\nif nums.count(0) > 1:\r\n print(nums.index(1) + 1)\r\nelse:\r\n print(nums.index(0) + 1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne,o=0,0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\nj=0\r\nif(e>o):\r\n while(1):\r\n if(l[j]%2!=0):\r\n break\r\n else:\r\n j+=1\r\nelse:\r\n while(1):\r\n if(l[j]%2==0):\r\n break\r\n else:\r\n j+=1\r\n \r\nprint(j+1)\r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncnt_even = 0\r\ncnt_odd = 0\r\nfor item in arr:\r\n if item%2 == 0:\r\n cnt_even+=1\r\n else:\r\n cnt_odd+=1\r\nif cnt_odd == 1:\r\n for i in range(n):\r\n if arr[i]%2 == 1:\r\n print(i + 1)\r\n break\r\nif cnt_even == 1:\r\n for i in range(n):\r\n if arr[i]%2 == 0:\r\n print(i + 1)\r\n break\r\n", "n = int(input())\r\na,b = [],[]\r\ns = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n if s[i]%2 == 0: a.append(i+1)\r\n else: b.append(i+1)\r\nif len(a) == 1: print(a[0])\r\nelse: print(b[0])\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl1=[x for x in l if x%2==0]\r\nfor i in l:\r\n if(len(l1)==1):\r\n if(i%2==0):\r\n print(l.index(i)+1)\r\n break\r\n else:\r\n if(i%2!=0):\r\n print(l.index(i)+1)\r\n break\r\n \r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n if a[i] % 2 != a[i+1] % 2 and a[i+1] % 2 == a[i+2] % 2:\r\n print(i+1)\r\n break\r\n elif i == n-1:\r\n if a[i] % 2 != a[i-1] % 2 and a[i-1] % 2 == a[i-2] % 2:\r\n print(i+1)\r\n break\r\n elif a[i] % 2 != a[i+1] % 2 and a[i-1] % 2 != a[i]%2:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nlst = [int(s) % 2 for s in input().split()]\r\nif lst.count(0) > 1:\r\n print(lst.index(1)+1)\r\nelse:\r\n print(lst.index(0)+1)", "n=int(input())\r\nl=[int(i) for i in input().split()] \r\nOO=[];EE=[]\r\n\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n EE.append([i,l[i]])\r\n else:\r\n OO.append([i,l[i]])\r\nif len(EE)==1:\r\n print(EE[0][0]+1)\r\nelse:\r\n print(OO[0][0]+1)", "from operator import itemgetter\r\nn=int(input())\r\nnum=[int(i) for i in input().split()]\r\nd=[]\r\nnsum=0\r\nfor i in range(n):\r\n if num[i]%2==0:\r\n d.append((i+1,1))\r\n nsum+=1\r\n else:\r\n d.append((i+1,0))\r\nif nsum==1:\r\n d=sorted(d,key=itemgetter(1),reverse=True)\r\nelse:\r\n d=sorted(d,key=itemgetter(1),reverse=False)\r\nprint(d[0][0])\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nmylist = list(map(int, input().split()))\r\nnumberOfEven = numberOfOdd = 0\r\nlastEven = lastOdd = None\r\n\r\nfor i in range(n):\r\n if mylist[i] % 2 == 0:\r\n numberOfEven += 1\r\n lastEven = i + 1\r\n else:\r\n numberOfOdd += 1\r\n lastOdd = i + 1\r\n\r\n# 1 2 3 4 --> 3 --> 4\r\nif numberOfEven == 1:\r\n print(lastEven)\r\nelse:\r\n print(lastOdd)\r\n", "n=int(input())\r\ns=[[],[]]\r\nfor i,x in enumerate(input().split()): s[int(x)%2]+=[i+1]\r\nprint(s[0][0] if len(s[0])==1 else s[1][0])", "n = int(input())\r\nnum = [*map(int, input().split())]\r\n\r\nflag = 0\r\nfor i in range(n):\r\n if num[i] % 2 == 0:\r\n dife = i\r\n flag += 1\r\n else:\r\n difo = i\r\n\r\nif flag == 1:\r\n print(dife + 1)\r\nelse:\r\n print(difo + 1)", "t = int(input())\r\na = list(map(int , input().split()))\r\nm = a[0] % 2\r\nn = a[1] % 2\r\nif m == n:\r\n for i in range(2,t):\r\n if a[i] % 2 != m:\r\n print(i+1)\r\nif m != n:\r\n l = a[2] % 2\r\n if m == l:\r\n print(2)\r\n else:\r\n print(1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif a[0]%2 == a[1]%2 and a[0]%2==0:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n print(i+1)\r\n break\r\nelif a[0]%2 == a[1]%2 and a[0]%2==1:\r\n for i in range(n):\r\n if a[i]%2!=1:\r\n print(i+1)\r\n break\r\nelse:\r\n if a[2]%2 == a[1]%2:\r\n print(\"1\")\r\n else:\r\n print(\"2\")", "odd =[]\r\neven = []\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n#Check to see whether odd or even\r\nfor i in nums:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif(len(odd)>len(even)):\r\n print(nums.index(even[0])+1)\r\nelse:\r\n print(nums.index(odd[0])+1)\r\n", "n = int(input())\r\nline = list(map(int, input().split()))\r\n\r\ncount_even = 0\r\ncount_odd = 0\r\n\r\nfor i in range(n):\r\n if line[i] % 2 == 0:\r\n count_even += 1\r\n else:\r\n count_odd += 1\r\n\r\n# done counting the number of even and odd\r\nif count_even == 1:\r\n i = 0\r\n while line[i] % 2 != 0:\r\n i += 1\r\n print(i + 1)\r\nelif count_odd == 1:\r\n i = 0\r\n while line[i] % 2 != 1:\r\n i += 1\r\n print(i + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if (l[i]+l[i+1])%2!=0:\r\n s=i\r\n break\r\nw=l[:s]+l[s+2:]\r\nif (l[s]+w[0])%2==0:\r\n print(s+2)\r\nelse:\r\n print(s+1)\r\n \r\n", "n = input()\r\nnums = input().split()\r\neven = 0\r\nodd = 0\r\nfor num in nums:\r\n if int(num)%2!=0:\r\n odd +=1\r\n else:\r\n even +=1\r\nif even <odd:\r\n for num in nums:\r\n if int(num)%2==0:\r\n print(int(nums.index(num))+1)\r\n break\r\nelse:\r\n for num in nums:\r\n if int(num)%2!=0:\r\n print(nums.index(num)+1)\r\n break\r\n", "from sys import stdin\r\ninp = stdin.readline\r\n\r\n# -----------------------\r\n\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef lcm(x, y):\r\n return x * y // gcd(x, y)\r\n\r\n\r\n# -------------------\r\n\r\n\r\nn = int(inp())\r\narr = [int(x) for x in inp().split()]\r\n\r\ndone = False\r\n\r\nlast = arr[0] % 2\r\n\r\nfor i in range(1, n):\r\n if arr[i] % 2 != last and arr[(i+1) % n] % 2 == last:\r\n print(i+1)\r\n done = True\r\n break\r\n last = arr[i] % 2\r\n\r\nif not done:\r\n print(1)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif sum([1 if i % 2 == 0 else 0 for i in a[:3]]) > 1:\r\n for e in enumerate(a):\r\n if e[1] % 2 == 1:\r\n print(e[0] + 1)\r\n break\r\nelse:\r\n for e in enumerate(a):\r\n if e[1] % 2 == 0:\r\n print(e[0] + 1)\r\n break", "# cook your dish here\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nco,ce,ie,io=0,0,0,0\r\nfor i in range(len(l)):\r\n if(l[i]%2==0):\r\n ie=i \r\n ce+=1 \r\n if(l[i]%2!=0):\r\n io=i \r\n co+=1 \r\nif(ce==1):\r\n print(ie+1)\r\nelse:\r\n print(io+1)", "n=int(input())\r\nN = [int(num) for num in input().split(\" \", n-1)]\r\nt=luw=ken=i=0\r\nwhile(i<n):\r\n if(N[i]%2==0):\r\n luw=i\r\n t+=1\r\n else:\r\n ken=i\r\n t-=1\r\n i+=1\r\nif(t<0):\r\n print(luw+1)\r\nelse:\r\n print(ken+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ncountev=0\r\ncountod=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n countev+=1\r\n out1=i+1\r\n else:\r\n countod+=1\r\n out2=i+1\r\nif(countev==1):\r\n print(out1)\r\nelse:\r\n print(out2)\r\n \r\n", "n = int(input())\r\nlists = [int(x) for x in input().split(\" \")]\r\ny = lists[0]%2 + lists[1]%2 + lists[2]%2\r\nodd = -1\r\nif y>1 :\r\n odd = 1\r\nelse:\r\n odd = 0\r\nfor k in range(n):\r\n if lists[k]%2 != odd:\r\n print(k+1)\r\n break", "n = int(input())\r\narr = [int(i) for i in input().split(' ')]\r\neven,odd = 0,0\r\n\r\nfor i in range(n):\r\n if(arr[i]%2 == 0):\r\n even+=1\r\n idx_even=i+1 \r\n else:\r\n odd+=1\r\n idx_odd=i+1 \r\n\r\nif(even == 1):\r\n print(idx_even)\r\nif(odd == 1):\r\n print(idx_odd)", "import re\r\nn=int(input())\r\nr=input()\r\ns=re.split(r'\\s+',r)\r\nfor i in range(n):\r\n s[i]=int(s[i])%2\r\na=sum(s)\r\nif a==1:\r\n print(s.index(1)+1)\r\nelse:\r\n print(s.index(0)+1)", "a = int(input())\r\nlist_A = list(map(int, input().strip().split(' ')))\r\n\r\nn1 = list_A[0]\r\nn2 = list_A[1]\r\n\r\nif ((n1 - n2) % 2 == 0):\r\n for i in range(len(list_A)):\r\n if ((list_A[i] - list_A[0]) % 2 == 1):\r\n print(i + 1)\r\n\r\nelse:\r\n n3 = list_A[2]\r\n if ((n1 - n3) % 2 == 0):\r\n print(2)\r\n else:\r\n print(1)", "n = input()\r\nnums = input().split()\r\n\r\neven = 0\r\nodd = 0\r\n\r\ndef iseven(num):\r\n if int(num)%2 == 0:\r\n return True\r\n else:\r\n return False\r\n\r\nfor each in nums:\r\n if iseven(each):\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif even == 1:\r\n for i in range(len(nums)):\r\n if iseven(nums[i]):\r\n print(i+1)\r\n\r\nelse:\r\n for i in range(len(nums)):\r\n if not iseven(nums[i]):\r\n print(i+1)\r\n\r\n\r\n\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\neven_index = 0\r\ncnt_even = 0\r\neven_flag = False\r\n\r\nodd_index = 0\r\ncnt_odd = 0\r\nodd_flag = False\r\n\r\nfor i in range(n):\r\n if l[i]%2 == 0:\r\n if even_flag==False:\r\n even_index = i\r\n even_flag = True\r\n \r\n cnt_even += 1\r\n else:\r\n if odd_flag==False:\r\n odd_index = i\r\n odd_flag = True\r\n \r\n cnt_odd += 1\r\n\r\nif cnt_even>1:\r\n print(odd_index + 1)\r\nelse:\r\n print(even_index + 1)", "n = int(input())\r\na = 0\r\nb = 0\r\nc = 0\r\nv = 0\r\ns = str(input()).split(\" \")\r\ns = list(map(int, s))\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n c = i\r\n a = a + 1\r\n else:\r\n v = i\r\n b = b + 1\r\nif a < b:\r\n print(c + 1)\r\nelse:\r\n print(v + 1)", "t = int(input())\r\na = list(map(int,input().split()))\r\n\r\nlodd = list()\r\nleven = list()\r\n\r\nfor i in range(0,t):\r\n if a[i] % 2 == 0:\r\n leven.append(i+1)\r\n else:\r\n lodd.append(i+1)\r\n \r\nif len(lodd) == 1:\r\n print(*[n for n in lodd],)\r\nelif len(leven) == 1:\r\n print(*[n for n in leven],)", "n=int(input())\r\nl=list(map(int,input().split()))\r\noc=0 \r\nec=0\r\noi=-1\r\nei=-1\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n ec+=1\r\n ei=i\r\n else:\r\n oc+=1\r\n oi=i\r\nif(ec==1):\r\n print(ei+1)\r\nelse:\r\n print(oi+1)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nev,od,le,lo=0,0,0,0\r\nfor x in range(len(l)) : \r\n if l[x]%2 :\r\n od+=1\r\n lo=x+1\r\n else :\r\n ev+=1\r\n le=x+1\r\nif ev>od:\r\n print(lo)\r\nelse:\r\n print(le)", "n=int(input())\r\na=input().split() \r\nx=[]\r\nfor i in range(n): \r\n x+=[int(a[i])]\r\n \r\neven_=[]\r\nodd_=[]\r\nfor i in range(n):\r\n if x[i]%2==0:\r\n even_+=[int(x[i])]\r\n else:\r\n odd_+=[int(x[i])]\r\n \r\nif len(even_)==1:\r\n print(x.index(even_[0])+1)\r\nif len(odd_)==1:\r\n print(x.index(odd_[0])+1)", "n = int(input())\r\nnums = list(map(int,input().split()))\r\ncount1,count2=0,0\r\narr = []\r\nfor i in range(len(nums)):\r\n if nums[i]%2==0:\r\n count1+=1\r\n else:\r\n count2+=1\r\nif count1>1:\r\n for i in range(len(nums)):\r\n if nums[i]%2!=0:\r\n arr.append(i)\r\nif count2>1:\r\n for i in range(len(nums)):\r\n if nums[i]%2==0:\r\n arr.append(i)\r\nprint(arr[0]+1)", "n=int(input())\r\nx=input().split(\" \")\r\nx=list(map(int,x))\r\neven=0\r\nodd=0\r\nfor i in x:\r\n if(i%2==0):\r\n even+=1\r\n \r\n else:\r\n odd+=1\r\n\r\nif(odd==1):\r\n for j in range(len(x)):\r\n if(x[j]%2 !=0):\r\n break\r\n \r\nelif(even==1):\r\n for j in range(len(x)):\r\n if(x[j]%2==0):\r\n break\r\nprint(j+1) \r\n ", "from collections import Counter\r\n\r\ndef iq_test():\r\n\r\n\r\n odd_count = even_count = 0\r\n\r\n\r\n num_numbers = int(input())\r\n\r\n\r\n numbers = list(map(int,input().split()))\r\n\r\n\r\n counts = Counter(number % 2 == 0 for number in numbers[:3])\r\n \r\n\r\n if counts[True] > 1:\r\n f = lambda x: x % 2 == 1\r\n else:\r\n f = lambda x: x % 2 == 0\r\n\r\n\r\n \r\n for i,number in enumerate(numbers,1):\r\n if f(number): \r\n print(i)\r\n break\r\n\r\n\r\niq_test()\r\n", "n = int(input())\r\neve=[]\r\nodd=[]\r\nval=[int(x) for x in input().split()]\r\n\r\nfor i in range(0,n) :\r\n if val[i]%2==0 :\r\n eve.append(i)\r\n else :\r\n odd.append(i) \r\nj=0\r\nif len(eve)>len(odd) :\r\n print(odd[j]+1)\r\nelse :\r\n print(eve[j]+1) ", "n = int(input())\r\ndata = list(map(int,input().split()))\r\nmodified = [ x%2 for x in data]\r\neven = modified.count(0)\r\nodd = modified.count(1)\r\nfor i in range(len(data)):\r\n if odd == 1:\r\n if data[i]%2==1:\r\n print(i+1)\r\n break\r\n elif even == 1:\r\n if data[i]%2==0:\r\n print(i+1)\r\n break\r\n ", "n=int(input())\r\nlst=input().split()\r\neven=0\r\nodd=0\r\nfor j in range(len(lst)):\r\n if ((int(lst[j]))%2)==0:\r\n even+=1\r\n elif ((int(lst[j]))%2)!=0:\r\n odd+=1\r\nfor j in range(len(lst)):\r\n if even>odd:\r\n if ((int(lst[j]))%2)!=0:\r\n print(j+1)\r\n elif odd>even:\r\n if ((int(lst[j]))%2)==0:\r\n print(j+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nodd_c = 0\r\neven_c = 0\r\nind_e = 0\r\nind_o = 0\r\nfor i in range(len(arr)):\r\n\tif (arr[i] % 2) == 0:\r\n\t\teven_c += 1\r\n\t\tind_e = i + 1 \r\n\telse:\r\n\t\todd_c += 1\r\n\t\tind_o = i + 1\r\n\r\nif(even_c == 1):\r\n\tprint(ind_e)\r\nelse:\r\n\tprint(ind_o)", "n=int(input())\r\na=[int(i) for i in input().split(' ')]\r\na1=0\r\na0=0\r\nfor i in range(3):\r\n if a[i]%2==0:\r\n a0+=1\r\n else:\r\n a1+=1\r\nif a0>a1:\r\n fl=1\r\nelse:\r\n fl=0\r\nfor i in range(n):\r\n if a[i]%2==fl:\r\n print(i+1)\r\n break\r\n \r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# CF25A: IQ test, brute force, 1300\n# \n# http://codeforces.com/problemset/problem/25/A\n\n# In[3]:\n\n\nn=int(input())\nlistn=input().split(' ')\nlistn=[int(i) for i in listn]\nlisteven=[i%2 for i in listn]\nif listeven.count(1)==1:\n print(1+listeven.index(1))\nelse:\n print(1+listeven.index(0))\n\n\n# In[ ]:\n\n\n\n\n", "n=int(input())\r\nalist=list(map(int,input().split()))\r\nblist=[]\r\nfor i in alist:\r\n a=i%2\r\n blist.append(a)\r\n\r\nasum=sum(blist)\r\nif asum==1:\r\n print(blist.index(1)+1)\r\nelse:\r\n print(blist.index(0)+1)", "n = int(input())\nnums = [int(i) for i in input().split()]\nch = []\nnech = []\n\nfor i in nums:\n if i % 2 == 0:\n ch.append(i)\n else:\n nech.append(i)\n\nprint(nums.index(nech[0]) + 1 if len(nech) == 1 else nums.index(ch[0]) + 1)", "COUNT=int(input())\nNUMS=list(map(int,input().split()))\nevenList, oddList = [], []\nfor num in NUMS : \n if num%2==0 : evenList.append(num) \n else : oddList.append(num)\n\nif len(evenList) > len(oddList) : print(NUMS.index(oddList[0])+1)\nelse : print(NUMS.index(evenList[0])+1)\n", "n=int(input())\nnumber=[int(i)%2 for i in input().split()]\nif number.count(0)==1:\n print(number.index(0)+1)\nelse:\n print(number.index(1)+1)", "n = int(input())\r\na = [int(e) for e in input().split()]\r\nres = n\r\nfor i in range(n-2):\r\n if(((a[i]+a[i+1])%2)!=0):\r\n if(((a[i+1]+a[i+2])%2)!=0):\r\n res = i+2\r\n else:\r\n res = i+1\r\nprint(res)", "n=int(input())\r\nm=input().split()\r\na=0\r\nfor i in range(n):\r\n if int(m[i])%2==0:\r\n a+=1\r\nif a==1:\r\n for i in range(n):\r\n if int(m[i])%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if int(m[i])%2!=0:\r\n print(i+1)", "n = int(input())\r\nnumbers = [int(num) for num in input().split()]\r\n\r\neven = {}\r\nodd = {}\r\n\r\nfor index, num in enumerate(numbers):\r\n if num % 2:\r\n odd[index + 1] = num\r\n else:\r\n even[index + 1] = num\r\n\r\n\r\n\r\nif len(even) > len(odd):\r\n print(list(odd.keys())[0])\r\nelse:\r\n print(list(even.keys())[0])", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ne=0\r\no=0\r\nfor i in range(3):\r\n if(a[i]%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\nif(e>o):\r\n f=1\r\nelse:\r\n f=0\r\nfor i in range(len(a)):\r\n if (a[i]%2)==f:\r\n print(i+1)\r\n break", "def a():\n z=int(input())-1\n s = list(map(int,input().split()))\n n=0\n d=True\n for i in range(1,z):\n if ((s[i]%2) != (s[i-1]%2)) & ((s[i]%2) != (s[i+1]%2)):\n n=i\n d=False\n if d & ((s[z]%2) != (s[z-1]%2)) :\n n=z\n print(n+1)\na()", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i == 0 and a[1] % 2 == a[2] % 2 and a[0] % 2 != a[1] % 2:\r\n print(i + 1)\r\n break\r\n elif i == n - 1 and a[i - 1] % 2 == a[i - 2] % 2 and a[i] % 2 != a[i - 1] % 2:\r\n print(i + 1)\r\n break\r\n else:\r\n if a[i-1] % 2 != a[i] % 2 and a[i + 1] % 2 != a[i] % 2:\r\n print(i + 1)\r\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\nr, ev, od = 0, 0, 0\r\nfor i in range(0, n-1):\r\n if a[i] % 2 != 0:\r\n od += 1\r\n else:\r\n ev += 1\r\nif od > ev:\r\n for i in range(0, n+1):\r\n if a[i] % 2 == 0:\r\n r = i\r\n break\r\nelse:\r\n for i in range(0, n+1):\r\n if a[i] % 2 != 0:\r\n r = i\r\n break\r\nprint(r+1)\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=[i%2 for i in list(map(int,input().split()))]\r\nif s.count(1)==1:\r\n print(s.index(1)+1)\r\nelse:\r\n print(s.index(0)+1)", "n = input()\r\nlist1 = list(map(int, input().split()))\r\nlist2 = [x%2 for x in list1]\r\nif list2.count(1)==1:\r\n\tprint(list2.index(1)+1)\r\nelse:\r\n\tprint(list2.index(0)+1)", "b = int(input())\r\na = input().strip().split()\r\nfor i in range(b):\r\n a[i] = int(a[i])\r\n\r\nc = 0\r\n\r\n\r\nfor i in range(b):\r\n if a[i] % 2 == 0:\r\n c += 1\r\n if c > 1:\r\n break\r\n\r\nif c > 1:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n break", "def Odd_Or_Even(Value):\r\n\r\n if Value % 2 == 0:\r\n return \"E\"\r\n else:\r\n return \"O\"\r\n\r\nn = input()\r\nlist = input().split()\r\ncounter = 0\r\n\r\nfor i in range(int(n)):\r\n\r\n if Odd_Or_Even(int(list[i])) == \"E\":\r\n\r\n counter +=1\r\n\r\nif counter == 1:\r\n\r\n for i2 in range(int(n)):\r\n\r\n if Odd_Or_Even(int(list[i2])) == \"E\":\r\n\r\n print(i2 + 1)\r\n\r\nelse:\r\n\r\n for i2 in range(int(n)):\r\n\r\n if Odd_Or_Even(int(list[i2])) == \"O\":\r\n\r\n print(i2 + 1)", "x=int(input())\r\na=list(map(int,input().split()))\r\np=0\r\nq=0\r\no=0\r\ne=0\r\nfor i in range(0,len(a)):\r\n if a[i]%2!=0:\r\n p=i\r\n o=o+1\r\n else:\r\n q=i\r\n e=e+1\r\nif o>e:\r\n print(q+1)\r\nelse:\r\n print(p+1)\r\n", "n = int(input())\r\nis_even = None\r\nnums = [int(x) for x in input().split()]\r\narr = []\r\nfor item in nums:\r\n arr.append(item % 2 == 0)\r\nif arr.count(True) > 1:\r\n print(arr.index(False) + 1)\r\nelse:\r\n print(arr.index(True) + 1)\r\n", "def parzzystanieparszytsa(n):\r\n if n % 2 == 0:\r\n return 1\r\n else:\r\n return 2\r\nbezuzyteczna = int(input())\r\ntablica = [int(x) for x in input().split(' ')]\r\nparzyste = []\r\nnieparzyste = []\r\nlicznik = 1\r\nfor a in tablica:\r\n if parzzystanieparszytsa(a) == 1:\r\n parzyste.append([a,licznik])\r\n else:\r\n nieparzyste.append([a,licznik])\r\n licznik += 1\r\nif len(parzyste) > len(nieparzyste):\r\n print(nieparzyste[0][1])\r\nelse:\r\n print(parzyste[0][1])", "n = int(input())\nnum = input()\neven = []\nodd = []\ntemp = 0\nmgzn = 0\nfor elem in num.split():\n if int(elem) % 2:\n odd.append(int(elem))\n else:\n even.append(int(elem))\nif len(even) == 1:\n temp = even[0]\nelse:\n temp = odd[0]\nfor i in range(len(num.split())):\n if temp == int(num.split()[i]):\n mgzn = i + 1\n print(mgzn)\n\t\t\t\t\t\t \t\t \t\t \t\t \t\t \t\t\t\t \t\t\t", "n=int(input())\nl=input().split()\n\no=0\ne=0\n\nfor i in range(n):\n if int(l[i])%2==1:\n o+=1\n else:\n e+=1\n\nif o==1:\n for i in range(n):\n if int(l[i])%2==1:\n print(i+1)\n break\nelse:\n for i in range(n):\n if int(l[i])%2==0:\n print(i+1)\n break\n\n", "n=int(input())\r\nl=[int(x)%2 for x in input().split()]\r\na=l.count(0)\r\nif a==1:\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)\r\n", "n=int(input());a=[];b=[]\r\nf=list(map(int,input().split()))\r\nfor i in range(n):\r\n if f[i]%2==0:a.append(f[i])\r\n else:\r\n b.append(f[i])\r\nif len(a)==1:print(f.index(a[0])+1)\r\nelse:\r\n print(f.index(b[0])+1)", "n=int(input())\r\na=input()\r\nlis=a.split()\r\nf1=0\r\nf2=0\r\nf3=0\r\nif int(lis[0])%2==0:\r\n f1=1\r\nif int(lis[1])%2==0:\r\n f2=1\r\nif int(lis[2])%2==0:\r\n f3=1\r\nif f1+f2+f3>=2:\r\n for i in range(n):\r\n if int(lis[i])%2==1:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if int(lis[i])%2==0:\r\n print(i+1)", "n= int(input())\r\nlst = [int(i) for i in input().split()]\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor i in range(n):\r\n if lst[i] % 2 == 0:\r\n count1 += 1\r\n ch = i\r\n else:\r\n count2 += 1\r\n nech = i\r\nif count1 < count2:\r\n print(ch + 1)\r\nelse:\r\n print(nech + 1)\r\n", "n = int(input())\r\nlis = input().split()\r\ncountodd = 0\r\ncounteven = 0\r\nfor i in range(n):\r\n if int(lis[i]) % 2 == 1:\r\n countodd += 1\r\n else:\r\n counteven += 1\r\n if countodd > 1:\r\n for j in range(n):\r\n if int(lis[j]) % 2 == 0:\r\n print(j + 1)\r\n break\r\n break\r\n elif counteven > 1:\r\n for j in range(n):\r\n if int(lis[j]) % 2 == 1:\r\n print(j + 1)\r\n break\r\n break\r\n\r\n", "t=int(input(\"\"))\r\nl=list(map(int,input(\" \").split(\" \")))\r\nn,p,c,k=0,0,0,0\r\nfor i in range(t):\r\n if l[i]%2==0:\r\n c=l[i]\r\n k+=1\r\n else:\r\n n+=1\r\n p=l[i]\r\nif k>n:\r\n print(l.index(p)+1)\r\nelse:\r\n print(l.index(c)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nchet = 0\r\nnechet = 0\r\nfor i in a:\r\n if i%2 == 0:\r\n b.append(0)\r\n chet +=1\r\n else:\r\n b.append(1)\r\n nechet +=1\r\nif chet > nechet:\r\n print(b.index(1) + 1)\r\nelse:\r\n print(b.index(0) + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\neven,odd,evenind,oddind=0,0,0,0\r\nfor i in range(n):\r\n if (l[i]%2==0):\r\n even += 1\r\n evenind = i\r\n else:\r\n even -= 1\r\n oddind = i\r\nif(even > 0):\r\n print(oddind+1)\r\nelse:\r\n print(evenind+1)", "import math as m\r\n#from math import comb as nCr\r\nt=input\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=map(int,t().split())\r\n a=list(map(int,t().split()))\r\n'''\r\nn=int(t())\r\na=list(map(int,t().split()))\r\nans=[1 if i%2 else 0 for i in a]\r\no=ans.count(1);e=ans.count(0)\r\nif o<e:\r\n print(ans.index(1) + 1)\r\nelse:\r\n print(ans.index(0) + 1)", "lengthList = int(input())\r\nnumbers = input().split()\r\ncountEven = 0\r\ncountOdd = 0\r\nfirstOrLastEven = ()\r\nfirstOrLast = ()\r\nfor x in range(lengthList):\r\n y = int(numbers[x])%2 == 0\r\n if y:\r\n primoEven = (int(x)+1)\r\n countEven += 1\r\n else:\r\n primoOdd = (int(x)+1)\r\n countOdd += 1\r\n \r\nif countEven > countOdd:\r\n print(primoOdd)\r\nelse:\r\n print(primoEven)\r\n \r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 0\r\nif (a[n-1] % 2) != (a[n - 2] % 2):\r\n k = 1\r\n if (a[n - 2] % 2) == (a[n - 3] % 2):\r\n print(n)\r\n else:\r\n print(n - 1)\r\n\r\nif k == 0:\r\n for i in range(1, n):\r\n if (a[0] % 2) != (a[i] % 2):\r\n if (a[i] % 2) == (a[i+1] % 2):\r\n print(i)\r\n break\r\n else:\r\n print(i+1)\r\n break", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 14 10:49:57 2021\r\n\r\n@author: 86137\r\n\"\"\"\r\n\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(a):\r\n if b[i]%2==0:\r\n c+=1\r\nif c==1:\r\n for i in range(a):\r\n if b[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(a):\r\n if b[i]%2!=0:\r\n print(i+1)\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n", "a = int(input())\r\nq = list(map(int, input().split()))\r\nr = []\r\nz = []\r\nfor i in q:\r\n if i % 2 == 0:\r\n r.append(i)\r\n else:\r\n z.append(i)\r\nif len(r) > len(z):\r\n print(q.index(z[0])+1)\r\nelse:\r\n print(q.index(r[0])+1)", "n=int(input());count=[i for i in map(int,input().split())]\ne=o=s=s1=int(0)\nfor i in count:\n if i%2:o+=1;s=count.index(i)\n else:e+=1;s1=count.index(i);\nprint([s+1,s1+1][e<o])", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nd = {}\r\nevCount, evIdx, odIdx, odCount = 0, -1, -1, 0\r\nfor i in range(n):\r\n if(arr[i]%2 == 0):\r\n evCount += 1\r\n evIdx = i + 1\r\n else:\r\n odCount += 1\r\n odIdx = i + 1\r\nif(evCount > odCount):\r\n print(odIdx)\r\nelse:\r\n print(evIdx)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(l[i]%2)\r\nif a[0]==a[1]==0:\r\n print(a.index(1)+1)\r\nelif a[0]==0 and a[1]==1:\r\n if a[2]==0:\r\n print(2)\r\n else:\r\n print(1)\r\nelif a[0]==1 and a[1]==0:\r\n if a[2]==0:\r\n print(1)\r\n else:\r\n print(2) \r\nelse:\r\n print(a.index(0)+1)", "n=int(input())\nl=list(map(int,input().split(' ')))\ne=[]\no=[]\nfor i in l:\n if(i%2==0):\n e.append(i)\n else:\n o.append(i)\nif(len(e)==1):\n print(l.index(e[0])+1)\nelse:\n print(l.index(o[0])+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 0\r\nl = 0\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n k = k + 1\r\n if a[i] % 2 != 0:\r\n l = l + 1\r\nif k > l:\r\n for i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n print(i + 1)", "\"\"\"\n __ __ _ \n| \\/ (_)_ __ ___ _ __ \n| |\\/| | | '__/ _ \\| '_ \\ \n| | | | | | | (_) | | | | \n|_| |_|_|_| \\___/|_| |_| \n\"\"\"\n\"\"\"\n\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████░░░░░░░░░░░░░░░░░░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░▌░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░◐◐◐█████████▀▀▀▀▀▀🔥░░░░░░░░███\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░▌░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░█▌░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▄▄▀█████████████████████████████████████████████████\n░░░░░░░░░░░░░░░░░░░░░░░░░░▄▄▄████▄████████ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ████\n░░░░░░░░░░░░░░░░░░░░░░░░░░░▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█████████▀▀▀▀▀▀▀▀▀\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░◐◐◐█████████▀▀▀▀▀▀🔥░░░░░░░░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████░░░░░░░░░░░░░░░░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████░░░░░░░░░░░░░░░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████░░░░░░░░░░░░░░░░\n░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████░░░░░░░░░░░░░░░\n\"\"\"\n\"\"\"\n ____ _ _____ \n / ___|___ __| | ___| ___|__ _ __ ___ ___ ___ \n| | / _ \\ / _` |/ _ \\ |_ / _ \\| '__/ __/ _ \\/ __|\n| |__| (_) | (_| | __/ _| (_) | | | (_| __/\\__ \\\n \\____\\___/ \\__,_|\\___|_| \\___/|_| \\___\\___||___/\n\"\"\"\n\n\"\"\"\nn = int(input())\nos=0\nch=[]\nfor i in range(n):\n\tm = int(input())\n\tch.append(m)\t\n\tif ch[0]==10:\t\t\n\t\tif 1 in ch:\n\t\t\tprint((len( ch[:ch.index(1)])))\n\t\t\tbreak\n\telse:\n\t\tif 10 in ch:\n\t\t\tprint((len( ch[:ch.index(10)])))\n\t\t\tbreak\n\"\"\"\n\"\"\"\nn,m = map(int,input().split())\nm = float(m)\nmi = []\nfor i in range(n):\n\ta,b = map(float,input().split())\n\tmi.append((a*m)/b)\nprint(round(min(mi),6))\n\"\"\"\n\"\"\"\nl = input().split()\nl = set(l)\nprint(len(l))\n\n\"\"\"\n\"\"\"\t\nx = input()\ny = x[1:-1]\nz = set(y.split(', '))\nif x == \"{}\":\n\tprint(0)\nelse:\n\tprint(len(z))\n\"\"\"\n\"\"\"\nn,k = map(int,input().split())\nL = sorted(map(int, input().split()))\nres = [L[0]]\nfor i in range(1,n):\n if L[i] != L[i-1]:\n res.append(L[i]-L[i-1])\nl = len(res)\nif k > l:\n res += [0]*(k-l)\nfor i in range(k):\n print(res[i])\n\n\"\"\"\t\n\"\"\"\nfrom math import*\ns,k = map(int,input().split(\" \"))\nsq = input().split()\nscore = 0\npol = \"\"\nfor i in range(len(sq)):\n\tif sq[i]>=sq[i-1]:\n\t\tscore+=1\nprint(ceil(score/len(sq))+ceil(score/len(sq)))\n\"\"\"\n\"\"\"\nfrom math import*\ns,k = map(int,input().split(\" \"))\nsq = input().split()\nscore = 0\npol = \"\"\nfor i in range(len(sq)):\n\tif sq[i]>=sq[i-1]:\n\t\tscore+=1\nprint(ceil(score/len(sq))+ceil(score/len(sq)))\n\"\"\"\n\"\"\"\nst=list(input().split('+'))\nst.sort()\nfor i in range(len(st)):\n if i!=len(st)-1:\n print(str(st[i])+'+',end='')\n else:\n print(str(st[i]))\n\"\"\"\n\"\"\"\na = input()\nup = a.upper()\nabc = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nprint(abc[abc.find(up[0])]+a[1::])\n\"\"\"\n\"\"\"\nn= int(input())\nk = 0\nfor i in range(n):\n\tp = input()\n\tif p == \"++X\" or p == \"X++\":\n\t\tk+=1\n\telif p == \"--X\" or p == \"X--\":\n\t\tk-=1\nprint(k)\n\n\"\"\"\n\"\"\"\nimport math \n\nc = 1 \n\nl = int(input()) \n\ng = \"\" \n\nfor i in range(l): \n\n for s in range(1,l - i + 1): \n\n g = g + \" \" \n for j in range(0,i + 1): \n if(i == 0 or j == 0): \n c = 1 \n else: \n c = c * (i - j + 1)/j \n\n t = c \n T=0 \n while(t != 0): \n T = T + 1 \n t = int(math.floor(t/10)) \n p=0 \n while((p+T)!=4): \n g = g + \" \" \n p=p+1 \n g = g + str(int(math.floor(c))) \n g = g + \"\\n\" \nprint(g)\n\"\"\"\t\n\"\"\"\n ___ __ _ _ \n|_ _|_ __ / _| ___ _ __ _ __ ___ __ _| |_(_) ___ ___ \n | || '_ \\| |_ / _ \\| '__| '_ ` _ \\ / _` | __| |/ __/ __|\n | || | | | _| (_) | | | | | | | | (_| | |_| | (__\\__ \\\n|___|_| |_|_| \\___/|_| |_| |_| |_|\\__,_|\\__|_|\\___|___/ \n\"\"\"\n\"\"\"\na1 = float(input())\na2 = float(input())\nb = (a1**2 + a2**2)\nimport math\nl = math.sqrt(b)\nprint(l)\n\"\"\"\n\"\"\"\nn = int(input())\na=list(map(int,input().split(\" \")))\nb = []\nfor i in range(len(a)):\n if i%2==0:\n print(a[i],end=' ')\n\"\"\"\n\"\"\"\nn = int(input())\na=list(map(int,input().split(\" \")))\nb = []\nfor i in range(len(a)):\n if a[i]%2==0:\n print(a[i],end=' ')\n\"\"\"\n\"\"\"\nn = int(input())\na=list(map(int,input().split(\" \")))\nb = []\nfor i in range(len(a)):\n if a[i]>0:\n b.append(a[i])\nprint(len(b))\n\"\"\"\n\"\"\"\nn = int(input())\na=list(map(int,input().split(\" \")))\nb = 0\nfor i in range(1,n):\n if a[i]>a[i-1]:\n b+=1\nprint(b)\n\"\"\"\n\"\"\"\nn = int(input())\na=list(map(int,input().split(\" \")))\nb = 0\nfor i in range(1,n):\n if a[i]>a[i-1]:\n b+=1\nprint(b)\n\"\"\"\n\"\"\"\nn = int(input())\na=list(map(int,input().split(\" \")))\nb = 0\nfor i in range(n-1):\n if i == 0:\n pass\n elif a[i]>a[i-1]and a[i+1]< a[i]:\n b+=1\nprint(b)\n\"\"\"\n\"\"\"\nn = int(input())\na=list(map(int,input().split(\" \")))\na.reverse()\nfor i in a:\n print(i,end = \" \")\n\"\"\"\n\"\"\"\nn = int(input())\na=list(map(int,input().split(\" \")))\nprint(max(a))\n\"\"\"\n\"\"\"\nn = int(input())\na = list(map(int,input().split(\" \")))\nl = 0\nq = []\nfor i in range(len(a)):\n if a[i] in q:\n pass\n else:\n l +=1\n q.append(a[i])\nprint(l)\n\"\"\"\n\"\"\"\nn = int(input())\na = list(map(int,input().split()))\nx = int(input())\nk =1\nfor i in range(len(a)):\n k+=1\n if x > a[i]:\n print(i+1)\n exit()\nprint(k)\n\"\"\"\n\"\"\"\na=list(map(int,input().split(\" \")))\nb = []\nfor i in range(len(a)):\n if i%2==0:\n print(a[i],end=' ')\n\"\"\"\n\"\"\"\na=list(map(int,input().split(\" \")))\nb = 0\nfor i in range(len(a)-1):\n if i == 0:\n pass\n elif a[i]>a[i-1]and a[i+1]< a[i]:\n b+=1\nprint(b)\n\"\"\"\n\"\"\"\na = list(map(int,input().split()))\nprint(max(a),a.index(max(a)))\n\"\"\"\n\"\"\"\nch = list(input()) \nif ch.count(\"h\")>=1 and ch.count(\"e\")>=1 and ch.count(\"l\")>=2 and ch.count(\"o\")>=1 and len(ch)!=53:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\"\"\"\n\"\"\"\nfrom decimal import Decimal\nx,y = map(Decimal,input().split(\" \"))\nd = 1\nwhile x < y and x - y < 0.000001 :\n x += x * 70 / 100\n d += 1\nprint(d)\n\"\"\"\n\"\"\"\nn = int(input())\nabc = \"abcdefghijklmnopqrstuvwxyz\"\ns =\"\"\nfor i in range(n):\n\tk,v = map(int,input().split())\n\tfor i in range(k):\n\t\twhile len(s) <= k:\n\t\t\ts += abc[:v]\n\t\tif len(s)>k:\n\t\t\ts = s[:-(len(s)-k)]\n\tprint(s,end=\"\\n\")\n\ts=\"\"\n\"\"\"\t\t\n\"\"\"\nk = int(input())\nl = int(input())\nm = int(input())\nn = int(input())\nd = int(input())\nlst = []\nlst.append(k)\nlst.append(l)\nlst.append(m)\nlst.append(n)\nuron = 0\nfor i in range(len(lst)):\n\tif d % lst[i] == 0:\n\t\turon+=lst[i]\nprint(uron)\n\"\"\"\nn = int(input())\na = list(map(int,input().split()))\nch = 0\nnch = 0\nfor i in range(len(a)):\n\tif a[i] % 2 == 0:\n\t\tch+=1\n\telse:\n\t\tnch+=1\nif ch > nch:\n\tfor i in range(len(a)):\n\t\tif a[i] % 2 == 1:\n\t\t\tprint(a.index(a[i])+1)\nelse:\n\tfor i in range(len(a)):\n\t\tif a[i]%2==0:\n\t\t\tprint(a.index(a[i])+1)\n\t\t\t\n", "n = int(input())\r\nchet = nechet = 0\r\nl = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n chet += 1\r\n else:\r\n nechet += 1\r\n if chet > 1:\r\n d = 1\r\n break\r\n elif nechet > 1:\r\n d = 0\r\n break\r\n\r\nif d == 0:\r\n j = 0\r\n while n:\r\n if l[j] % 2 == 0:\r\n print(j + 1)\r\n exit()\r\n j += 1\r\nelse:\r\n j = 0\r\n while n:\r\n if l[j] % 2 != 0:\r\n print(j + 1)\r\n exit()\r\n j += 1", "# IQ Test\n# number that differs from others usually differs in evenness\nnn=int(input())\nn,e,o=list(map(int,input().split())),0,0 # Numbers & even condition\nfor i in range(3):\n if n[i]%2==0:\n e+=1\n else:\n o+=1\nif o>e:\n for i in range(nn):\n if n[i]%2==0:\n print(i+1)\n break\nelse:\n for i in range(nn):\n if n[i]%2!=0:\n print(i+1)\n break\n", "n = int(input())\r\ndef operator(x):\r\n\treturn x % 2\r\na = list(map(int, input().split()))\r\nb = list(map(operator, a))\r\nif n - sum(b) == 1:\r\n\tprint(b.index(0) + 1)\r\nelse:\r\n\tprint(b.index(1) + 1)", "cnt = int(input())\r\nnum_list = list(map(int, input().split()))\r\n\r\neven = [num for num in num_list if num % 2 == 0]\r\nodd = [num for num in num_list if num % 2 == 1]\r\n\r\nif len(even) > len(odd):\r\n print(num_list.index(min(odd)) + 1)\r\nelse:\r\n print(num_list.index(min(even)) + 1)\r\n\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in range(n):\r\n\tif arr[i]%2==0:\r\n\t\te+=1\r\n\telse:\r\n\t\to+=1\r\nif e>o:\r\n\tfor i in range(n):\r\n\t\tif arr[i]%2!=0:\r\n\t\t\tprint(i+1)\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif arr[i]%2==0:\r\n\t\t\tprint(i+1)\r\n\t\r\n\t", "n = int(input())\r\nl = input().split()\r\ne = []\r\nk = 0\r\nwhile k <n:\r\n e.append(int(l[k])%2)\r\n k = k + 1\r\npp = sum(e)\r\nif pp == 1:\r\n i = 0\r\n while i < n:\r\n if int(l[i])%2>0:\r\n print(i+1)\r\n i = i + 1\r\nelse:\r\n i = 0\r\n while i < n:\r\n if int(l[i])%2==0:\r\n print(i+1)\r\n i = i + 1\r\n", "input();ll=[int(x) for x in input().split()]\r\nc = [];nc = []\r\nfor i in ll:\r\n if i % 2 == 0:c.append(i)\r\n else:nc.append(i)\r\n\r\nprint(ll.index(c[0])+1 if len(c)<=len(nc) else ll.index(nc[0])+1 )", "n = int(input())\r\na = [int(i)%2==0 for i in input().split()]\r\n\r\nif a.count(True)==1:\r\n print(a.index(True)+1)\r\nelse:\r\n print(a.index(False)+1)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\na = [i % 2 for i in a]\r\nif sum(a) == 1:\r\n\tprint(a.index(1)+1)\r\nelse:\r\n\tprint(a.index(0)+1)", "n = input()\r\nlst = [int(x) for x in input().split(' ')]\r\n\r\ntyp = lst[0] % 2\r\ncount = 0\r\nfor i in range(int(n)):\r\n if lst[i] % 2 != typ:\r\n count += 1\r\n index = i + 1\r\nif count > 1:\r\n print(index - count)\r\nelse:\r\n print(index)", "n=int(input())\r\narr=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n if(arr[i]%2==0):\r\n a.append(arr[i])\r\n else:\r\n b.append(arr[i])\r\nif(len(a)==1):\r\n for i in range(n):\r\n if(a[0]==arr[i]):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if(b[0]==arr[i]):\r\n print(i+1)\r\n break\r\n", "n=int(input())\r\nl=[int(y) for y in input().split()]\r\nx=(l[0]+l[1])%2\r\nif x==0:\r\n x=l[0]%2\r\n for i in range(2,n):\r\n if x!=l[i]%2:\r\n print(i+1)\r\n break\r\nelse:\r\n if l[0]%2==l[2]%2:\r\n print(2)\r\n else:\r\n print(1)", "input()\r\nl = [int(x) for x in input().split()]\r\nfor i in range(0, len(l)):\r\n l[i] = l[i] % 2\r\nindex = 0\r\nif sum(l) == 1: \r\n index = l.index(True)\r\nelse: \r\n index = l.index(False)\r\nprint(index+1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n\tif i!=n-1:\r\n\t\tif a[i]%2!=a[i-1]%2 and a[i]%2!=a[i+1]%2:\r\n\t\t\tprint(i+1)\r\n\t\telse:\r\n\t\t\tpass\r\n\telse:\r\n\t\tif a[i]%2!=a[i-1]%2 and a[i]%2!=a[0]%2:\r\n\t\t\tprint(i+1)\r\n\t\telse:\r\n\t\t\tpass\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 *-*\n\nn = int(input())\ns = list(map(int, input().split()))\nfor i in range(n):\n\ts[i] = s[i] % 2\nif sum(s) == 1:\n\tprint(s.index(1)+1)\nelif sum(s) > 1:\n\tprint(s.index(0)+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nfor i in range(len(l)):\r\n if l[i]%2!=0:\r\n l1.append(i+1)\r\n else:\r\n l2.append(i+1)\r\nif len(l1)==1:\r\n print(l1[0])\r\nelif len(l2)==1:\r\n print(l2[0])", "n=int(input())\r\nL=[int(x) for x in input(\"\").split()]\r\nm=0\r\np=0\r\nfor elt in L:\r\n if elt%2==0 :\r\n p+=1\r\n else :\r\n m+=1\r\n \r\nif m==1:\r\n for i in range(n):\r\n if L[i]%2!=0:\r\n print(i+1)\r\n break\r\nif(p==1):\r\n for j in range(n):\r\n if L[j]%2==0 :\r\n print(j+1)\r\n break ", "n=int(input())\r\nnum=input().split()\r\nfor i in range(len(num)):\r\n num[i]=int(int(num[i])%2)\r\nfor i in range(len(num)):\r\n if i==0:\r\n if num[0]!=num[1] and num[1]==num[2]:\r\n print('1')\r\n break\r\n if i>0 and i<len(num)-1:\r\n if num[i]!=num[i-1] and num[i]!=num[i+1]:\r\n print(i+1)\r\n break\r\n if i==len(num)-1:\r\n print(i+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ne=0\r\nodd=0\r\neven=[]\r\no=[]\r\nfor i in range(0,len(a)):\r\n if a[i]%2==0:\r\n e+=1\r\n even.append(a[i])\r\n else:\r\n odd+=1\r\n o.append(a[i])\r\nif e==1:\r\n print(a.index(even[0])+1)\r\nelse:\r\n print(a.index(o[0])+1)\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nnumbers = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n numbers[i] = numbers[i]%2\r\n\r\nif (numbers.count(1) > numbers.count(0)): print(numbers.index(0)+1)\r\nelse: print(numbers.index(1)+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nif a[0]%2==a[1]%2:\r\n for i in range(n):\r\n if a[i]%2!=a[0]%2:\r\n print(i+1)\r\nelif a[0]%2==a[2]%2:\r\n print(2)\r\nelif a[1]%2==a[2]%2:\r\n print(1)", "n= int(input())\r\ns=[int(i) for i in input().split()]\r\nc1=0\r\nc2=0\r\nj=[]\r\nk=[]\r\nfor i in range(0, n):\r\n if(s[i]%2)==0:\r\n c1=c1+1\r\n k.append(i)\r\n else:\r\n c2=c2+1\r\n j.append(i)\r\nif(c2==1):\r\n print(j[0]+1)\r\nif(c1==1):\r\n print(k[0]+1)", "n = int(input())\r\ndata = [int(i) for i in input().split()]\r\n\r\neven = 0\r\nfor x in data:\r\n if x % 2 == 0:\r\n even += 1\r\n\r\nif even == 1:\r\n for i in range(len(data)):\r\n if data[i] % 2 == 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(data)):\r\n if data[i] % 2 == 1:\r\n print(i + 1)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\neven = 0\r\nlast_odd = 0\r\nlast_even = 0\r\n\r\nfor i in range(n):\r\n if lst[i] % 2 == 0:\r\n even += 1\r\n last_even = i + 1\r\n else:\r\n even -= 1\r\n last_odd = i + 1\r\n\r\nif even > 0:\r\n print(last_odd)\r\nelse:\r\n print(last_even)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ncnt1=0\r\ncnt2=0\r\nfor i in l:\r\n if i%2==0:\r\n cnt2+=1\r\n else:\r\n cnt1+=1\r\nif cnt2>cnt1:\r\n for i in range(n):\r\n if l[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nodd_count,odd_index,even_count,even_index = 0,0,0,0\r\nfor i in range(n):\r\n if arr[i]%2 == 0:\r\n even_count += 1\r\n even_index = i\r\n else:\r\n odd_count+=1\r\n odd_index = i\r\n if even_count == 1 and odd_count>1:\r\n print(even_index+1)\r\n break\r\n elif odd_count == 1 and even_count>1:\r\n print(odd_index+1)\r\n break", "n=int(input())\r\ns=list(map(int,input().split()))\r\nif s[0]%2 == s[1]%2 and s[0]%2==0:\r\n for i in range (n):\r\n if s[i]%2 == 1:\r\n print(i+1)\r\nelif s[0]%2 == s[1]%2 and s[0]%2==1:\r\n for i in range (n):\r\n if s[i]%2 == 0:\r\n print(i+1)\r\nelse:\r\n if s[0]%2 == s[2]%2:\r\n print(2)\r\n else:\r\n print (1)", "t=int(input())\r\nl=list(map(int,input().split(' ')))\r\neve=[]\r\nodd=[]\r\nm,val=0,0\r\nfor i in l:\r\n if i%2==0:\r\n eve.append(i)\r\n else:\r\n odd.append(i)\r\nif(len(odd)>len(eve)):\r\n m=eve[0]\r\n val=l.index(m)\r\nelse:\r\n m=odd[0]\r\n val=l.index(m)\r\nprint(val+1)", "input()\nl = list(map(int, input().split()))\no = sum(n & 1 for n in l)\ngoal = o == 1\nprint(next(i + 1 for i, n in enumerate(l) if n & 1 == goal))\n", "n=int(input())\r\nnum = input()\r\nlist = [int(i) for i in num.split()]\r\na=0\r\nb=0\r\nfor i in list:\r\n if i%2!=0:\r\n a+=1\r\n else:\r\n b+=1\r\nif a>b:\r\n for i in list:\r\n if i % 2 == 0:\r\n c=list.index(i)+1\r\n print(len(list[:c]))\r\nelse:\r\n for i in list:\r\n if i % 2 != 0:\r\n c=list.index(i)+1\r\n print(len(list[:c]))", "def find_odd_one_out(n, arr):\n even_count = 0\n odd_count = 0\n even_index = 0\n odd_index = 0\n \n for i in range(n):\n if arr[i] % 2 == 0:\n even_count += 1\n even_index = i\n else:\n odd_count += 1\n odd_index = i\n \n if even_count == 1:\n return even_index + 1\n else:\n return odd_index + 1\n\nn = int(input().strip())\narr = list(map(int, input().strip().split()))\nprint(find_odd_one_out(n, arr))\n\n \t\t\t \t \t\t\t \t \t\t\t \t \t\t\t\t\t", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nn = l[0] & 1\r\nif (n != l[1] & 1):\r\n\tif (n != l[2] & 1):\r\n\t\tprint(1)\r\n\t\tquit()\r\n\telse:\r\n\t\tprint(2)\r\n\t\tquit()\r\nfor i in range(2, len(l)):\r\n\tif (l[i] & 1 != n):\r\n\t\tprint(i+1)\r\n\t\tquit()", "#25A IQ Test\r\nimport sys\r\nimport math\r\n\r\ninputs = int(input())\r\ninput2 = sys.stdin.readline().split()\r\ni = 0\r\na = 0\r\nb = 0\r\n\r\nif inputs == 2:\r\n print(\"1\")\r\n sys.exit()\r\n\r\nfor i in range(inputs):\r\n if int(input2[i])%2 == 0:\r\n \r\n a = a + 1\r\n else:\r\n b = b + 1\r\n \r\n\r\nif a>b: #Even\r\n for i in range(inputs):\r\n if int(input2[i])%2 == 1:\r\n print(i + 1)\r\nelse: #Even\r\n for i in range(inputs):\r\n if int(input2[i])%2 == 0:\r\n print(i + 1)\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n even+=1\r\n ie=i\r\n else:\r\n odd+=1\r\n io=i\r\nif even==1:\r\n print(ie+1)\r\nelse:\r\n print(io+1)", "_ = int(input())\r\na = [int(x) for x in input().split()]\r\neven = []\r\nodd = []\r\nfor i in range(3):\r\n if a[i]%2 == 1:\r\n odd.append(1)\r\n else:\r\n even.append(1)\r\nif len(even) > len(odd):\r\n for j in range(len(a)):\r\n if a[j]%2 == 1:\r\n print(j+1)\r\n break\r\nelse:\r\n for k in range(len(a)):\r\n if a[k]%2 == 0:\r\n print(k+1)\r\n break", "num = int(input())\nline = [int(x) for x in input().split()]\nnum_odd = 0\nnum_even = 0\n \nfor i in range(num):\n if line[i] % 2 == 0:\n num_even += 1\n else:\n num_odd += 1\nif num_even == 1:\n for j in range(num):\n if(line[j] % 2 == 0):\n print(j+1)\nelse:\n for j in range(num):\n if(line[j] % 2 != 0):\n print(j+1)\n\n\t \t \t\t\t\t\t \t\t \t\t\t \t\t\t\t \t", "def main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n odd = even = 0\r\n for i in range(3):\r\n if a[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if odd > even:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n return\r\n else:\r\n for i in range(n):\r\n if a[i] % 2 != 0:\r\n print(i+1)\r\n return\r\n\r\n\r\nmain()", "n=int(input())\r\na=list(map(int,input().split()))\r\nc1 =c2 =0\r\nfor i in a:\r\n if i%2 == 0:\r\n c1 +=1\r\n else:\r\n c2 += 1\r\nif c1 < c2:\r\n for i in a:\r\n if i %2 == 0:\r\n print(a.index(i)+1)\r\n break\r\nelse:\r\n for i in a:\r\n if i % 2 != 0:\r\n print(a.index(i)+1)\r\n break", "n = int(input())\r\nm = list(map(int, input().split()))\r\nk, r = 0, 0\r\nfor i in m:\r\n if i % 2 == 0:\r\n k += 1\r\n else:\r\n r += 1\r\nb = False\r\nif k == 1:\r\n b = True\r\nfor i in range(n):\r\n if b and m[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\n elif not b and m[i] % 2 == 1:\r\n print(i + 1)\r\n break\r\n", "n=int(input())\r\np=[]\r\no=[]\r\nl=[int(i) for i in input().split()]\r\nfor i in l:\r\n if i%2==0:\r\n evn=l.index(i)+1\r\n o.append(i)\r\n else:\r\n p.append(i)\r\n ind = l.index(i)+1\r\n\r\nif len(p)==1:\r\n print(ind)\r\nif len(o)==1:\r\n print(evn)", "if __name__ == '__main__':\r\n\tn = int(input())\r\n\tnumbersList = [int(i) % 2 for i in input().split()]\r\n\tprint(numbersList.index(1) + 1 if numbersList.count(1) == 1 else numbersList.index(0) + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nfor i in range(len(l)):\r\n l[i]=l[i]%2\r\n\r\nev,odd=0,0\r\nfor i in range(3):\r\n if l[i]==0:\r\n ev+=1\r\n else:\r\n odd+=1\r\n \r\n if ev>1 or odd>1:\r\n break\r\n\r\nif ev==max(ev,odd):\r\n t=1\r\nelse:\r\n t=0\r\n\r\nfor i in range(len(l)):\r\n if l[i]==t:\r\n print(i+1)\r\n break\r\n ", "n=int(input())\r\na=input().split()\r\nif((n>=3)and(n<=100)):\r\n eo=[]\r\n for i in range(0,len(a)):\r\n a[i]=int(a[i])\r\n eo.append(a[i]%2)\r\n ce=co=0\r\n for i in eo:\r\n if(i==0):\r\n ce+=1\r\n else:\r\n co+=1\r\n if(co==1):\r\n max=1\r\n elif(ce==1):\r\n max=0\r\n for i in range(0,len(eo)):\r\n if(eo[i]==max):\r\n ans=i+1\r\n print(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncount = 0\r\ntotal = 0\r\nfor i in range(n):\r\n if a[i] %2==0:\r\n count+=1\r\n else:\r\n total+=1\r\n\r\nif count > total:\r\n\tfor i in range(len(a)):\r\n\t\tif a[i] % 2 == 1:\r\n\t\t\tprint(a.index(a[i])+1)\r\nelse:\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]%2==0:\r\n\t\t\tprint(a.index(a[i])+1)", "n = int(input())\r\na = [int(a) for a in input().split()]\r\nc = []\r\nd = []\r\n\r\nfor i in range(n):\r\n\tif a[i]%2 == 0:\r\n\t\tc.append(a[i])\r\n\telse:\r\n\t\td.append(a[i])\r\n\r\nif len(c) > len(d):\r\n\tprint(a.index(d[0]) + 1)\r\nelse:\r\n\tprint(a.index(c[0]) + 1)\t", "import sys\r\nimport math as m\r\ndef main():\r\n pass\r\ndef binary(n):\r\n #decimal to binary\r\n return (bin(n).replace(\"0b\", \"\"))\r\ndef decimal(s):\r\n #binary to decimal\r\n return (int(s, 2))\r\ndef pow2(n):\r\n #power of a number base 2\r\n p = 0\r\n while n > 1:\r\n n //= 2\r\n p += 1\r\n return (p)\r\ndef isPrime(n):\r\n # if number is prime in √n time\r\n if (n == 1):\r\n return (False)\r\n else:\r\n root = int(n ** 0.5)\r\n root += 1\r\n for i in range(2, root):\r\n if (n % i == 0):\r\n return (False)\r\n return (True)\r\ndef lts(l):\r\n #list to string ,no spaces\r\n s=''.join(map(str,l))\r\n return s\r\ndef stl(s):\r\n #for each character in string to list with no spaces -->\r\n l=list(s)\r\n #for space in string -->\r\n #l=list(s.split(\" \"))\r\n return l\r\n#1000000007\r\nmod=int(1e9)+7\r\ndef sinp(): return sys.stdin.readline().strip()\r\ndef iinp(): return int(input())\r\ndef ninp(): return map(int, sys.stdin.readline().strip().split())\r\ndef linp(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef p(a): print(a)\r\ndef p2(a,b):print(a,b)\r\n#for _ in range(iinp()):\r\nn=input()\r\nl=linp()\r\na1=[]\r\na2=[]\r\nind=1\r\nfor i in l:\r\n if(i%2==0):\r\n a1.append(ind)\r\n ind+=1\r\n else:\r\n a2.append(ind)\r\n ind+=1\r\nif(len(a1)==1):\r\n print(a1[0])\r\nelse:\r\n print(a2[0])\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ni = 1\r\nfor j in a:\r\n if j % 2:\r\n i += 1\r\nif i > 2:\r\n for j in range(n):\r\n if a[j] % 2:\r\n continue\r\n print(j + 1)\r\n break\r\nelse:\r\n for j in range(n):\r\n if a[j] % 2:\r\n print(j + 1)\r\n break\r\n continue", "num = input()\r\nlist = input()\r\nnewlist = list.split()\r\nnumlist = []\r\nmodlist = []\r\n\r\nfor i in newlist:\r\n numlist.append(int(i))\r\n\r\nmodlist.append(numlist[0] % 2)\r\nmodlist.append(numlist[1] % 2)\r\nmodlist.append(numlist[2] % 2)\r\n\r\nif modlist.count(1) > 1:\r\n dom = 1\r\nelse:\r\n dom = 0\r\n\r\nk = 1\r\nfor j in numlist:\r\n if j % 2 != dom:\r\n print(str(k))\r\n k += 1", "n = int(input())\r\na = [int(i) for i in input().strip().split()]\r\n\r\ne = 0\r\no = 0\r\nei = 0\r\noi = 0\r\n\r\nfor k, i in enumerate(a):\r\n if i % 2 == 0:\r\n e += 1\r\n ei = k\r\n else:\r\n o += 1\r\n oi = k\r\n if (ei != 0 and oi != 0 and e + o > 2):\r\n break\r\n\r\nif (e > o):\r\n print(oi+1)\r\nelse:\r\n print(ei+1)\r\n\r\n", "import math\r\n# from re import S\r\n# a,b=map(int,input().split())\r\n# t=True\r\n# for i in range(int(input())):\r\nn=int(input())\r\n# n,m=map(int,input().split())\r\n# s=input()\r\narr=list(map(int,input().split()))\r\n# sarr=list(set(arr))\r\nodd=0\r\neven=0\r\nfor i in range(n):\r\n if(arr[i]%2==1):\r\n odd+=1\r\n else:\r\n even+=1\r\noddin=0\r\nevein=0\r\nif(odd>even):\r\n for i in range(n):\r\n if(arr[i]%2==0):\r\n oddin=i\r\n print(oddin+1)\r\nelse:\r\n for i in range(n):\r\n if(arr[i]%2==1):\r\n evein=i\r\n print(evein+1)\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split(\" \")))\r\n\r\nlast_even = -1\r\nlast_odd = -1\r\nnum_even = 0\r\n\r\nfor i, num in enumerate(numbers):\r\n if num % 2 == 0:\r\n num_even += 1\r\n last_even = i + 1\r\n else:\r\n last_odd = i + 1\r\n\r\nif num_even == 1:\r\n print(last_even)\r\nelse:\r\n print(last_odd)\r\n", "import sys\r\nimport math\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = []\r\n\r\nfor i in range(len(a)):\r\n b.append((a[i] % 2))\r\n\r\nif sum(b) > 1:\r\n print(b.index(0) + 1)\r\nelse:\r\n print(b.index(1) + 1)\r\n", "n=int(input())\r\n#print(n)\r\ns=input().split()\r\n#print(s)\r\narr=[]\r\ni=0\r\nwhile i<n:\r\n arr.append(int(s[i]))\r\n i+=1\r\nodd=0\r\neven=0\r\ni=0\r\nwhile i<n:\r\n\tif arr[i]%2==0:\r\n\t\teven+=1\r\n\t\tp=i\r\n\telse:\r\n\t\todd+=1\r\n\t\tq=i\r\n\ti+=1\r\nif odd==1:\r\n print(q+1)\r\nelse:\r\n print(p+1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\neve=[]\r\nodd=[]\r\nfor i in range(n):\r\n if arr[i]%2 ==0 :\r\n eve.append(i)\r\n else:\r\n odd.append(i)\r\nif len(eve)==1:\r\n print(eve[0]+1)\r\nelse:\r\n print(odd[0]+1)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 9 22:53:27 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = input().split()\r\nl = []\r\nfor i in s:\r\n l.append(int(i))\r\ns = list(l)\r\no = 0\r\ne = 0\r\nfor i in s:\r\n if i % 2 == 0:\r\n e += 1\r\n else:\r\n o += 1\r\nif o > e:\r\n for i in s:\r\n if i % 2 == 0:\r\n print(s.index(i) + 1)\r\n break\r\nelse:\r\n for i in s:\r\n if i % 2 != 0:\r\n print(s.index(i) + 1)\r\n break\r\n ", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ni=0\r\nif(a[0]%2 and a[1]%2):\r\n for i in range(len(a)):\r\n if(a[i]%2==0):\r\n break\r\nelif(a[0]%2==0 and a[1]%2==0):\r\n for i in range(len(a)):\r\n if(a[i]%2):\r\n break\r\nelse:\r\n if(abs(a[0]-a[2])%2):\r\n i=0\r\n else:\r\n i=1\r\nprint(i+1)", "from collections import defaultdict\r\ndef solution():\r\n n = int(input())\r\n arr = [int(x) for x in input().split(' ')]\r\n d = defaultdict(list)\r\n for i in range(n):\r\n if arr[i] % 2 == 0:\r\n d['e'].append(i+1)\r\n else:\r\n d['o'].append(i+1)\r\n ans = d['o'][0] if len(d['o']) < len(d['e']) else d['e'][0]\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "def evenness(arr):\r\n even, odd = 0, 0\r\n \r\n for num in arr:\r\n if num % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n \r\n for idx, val in enumerate(arr):\r\n if (val % 2 == 0 and even == 1) or (val % 2 != 0 and odd == 1):\r\n return idx + 1\r\n \r\n return len(arr)\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(evenness(arr))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nec=0\r\nod=0\r\ne=0\r\no=0\r\nfor i in range(len(lst)):\r\n if(lst[i] %2==0):\r\n ec+=1\r\n e=i\r\n else:\r\n od+=1\r\n o=i\r\nif(ec==1):\r\n print(e+1)\r\nelse:\r\n print(o+1)\r\n ", "n=int(input())\r\nl=input().split()\r\nm=''\r\nfor i in range(n):\r\n m=m+str(int(l[i])%2)\r\nif m.count('1')==1:\r\n print(int(m.index('1'))+1)\r\nelse:\r\n print(int(m.index('0'))+1)", "n=int(input())\r\na=[]\r\nb=input().split(\" \")\r\nfor i in range(n):\r\n\ta.append(int(b[i]))\r\nfor i in range(n):\r\n\ta[i]=a[i]%2\r\nfor i in range(n):\r\n\tif {a[i]}&{a[i-1],a[i-2]}==set():\r\n\t\tprint(i+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncheck = list()\r\n\r\nfor i in range(n):\r\n check.append(arr[i] & 1)\r\n\r\nif check.count(0) == 1:\r\n print(check.index(0) + 1)\r\nelse:\r\n print(check.index(1) + 1)", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\ncounto=0\r\ncounte=0\r\nfor i in l:\r\n if(i%2==0):\r\n counte=counte+1 \r\n ie=l.index(i)\r\n elif(i%2!=0):\r\n counto=counto+1\r\n io=l.index(i)\r\nif(counto==1):\r\n print(io+1)\r\nelif(counte==1):\r\n print(ie+1)", "N = int(input())\r\nsum1 = 0\r\nsum2 = 0\r\nf1 = 0\r\nf2 = 0\r\nlist1 = [int(k) for k in input().split(' ')]\r\nfor i in range(N):\r\n\tif list1[i] % 2 == 0:\r\n\t\tf2 = i + 1\r\n\t\tsum2 = sum2 + 1\r\n\telse:\r\n\t\tf1 = i + 1\r\n\t\tsum1 = sum1 + 1\r\nif sum1 == 1:\r\n\tprint(f1)\r\nelse:\r\n\tprint(f2)", "n = int(input())\na = input().split()\np1 = 0\np2 = 0\nfor i in range(len(a)):\n if int(a[i]) % 2 == 0:\n p1 += 1\n n1 = int(i)\n else:\n p2 += 1\n n2 = int(i)\nif p1 == 1:\n print(n1 + 1)\nelse:\n print(n2 + 1)\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nevenness = [0, 0]\r\nfor x in a:\r\n evenness[x % 2] += 1\r\nspecial = 0 if evenness[0] == 1 else 1\r\n\r\nfor id, x in enumerate(a): \r\n if x % 2 == special: \r\n print(id + 1)", "n=int(input())\r\nsta=[int(i)%2 for i in input().split()]\r\nif sum(sta[0:3])>=2:\r\n a=1\r\nelse:\r\n a=0\r\nz=1\r\nfor i in sta:\r\n if a!=i:\r\n print(z)\r\n break\r\n z+=1", "n = int(input())\r\nnumList = list(map(int, input().split()))\r\nevenCnt = 0\r\noddCnt = 0\r\nfor i in range(len(numList)):\r\n if (numList[i] % 2 == 0):\r\n evenCnt += 1\r\n evenPos = i+1\r\n else:\r\n oddCnt += 1\r\n oddPos = i+1\r\n\r\nif (evenCnt > oddCnt):\r\n print(oddPos)\r\nelse:\r\n print(evenPos)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\neven = [i for i in lst if i%2 == 0]\r\nodd = [h for h in lst if h&1]\r\nif len(odd) > len(even):\r\n print(lst.index(even[0])+1)\r\nelse:\r\n print(lst.index(odd[0])+1)\r\n", "x=int(input())\r\ny=input()\r\na=[int(i) for i in y.split()]\r\nk=0\r\nl=0\r\nfor i in range(3):\r\n if a[i]%2==0:\r\n l+=1\r\n else:\r\n k+=1\r\nif l>k:\r\n for i in a:\r\n if i%2==1:\r\n print(a.index(i)+1)\r\n break\r\nelse:\r\n for i in a:\r\n if i%2==0:\r\n print(a.index(i)+1)\r\n break\r\n \r\n", "import sys\n\ndef main():\n number = sys.stdin.readline()\n odd = 0\n oddI = 0\n even = 0\n evenI = 0\n arr = [int(x) for x in sys.stdin.readline().strip().split()]\n for i,n in enumerate(arr):\n if n % 2 == 0:\n even += 1\n evenI = i\n else:\n odd += 1\n oddI = i\n if odd > even:\n print(evenI + 1)\n else:\n print(oddI + 1)\n\nif __name__ == (\"__main__\"):\n main()\n", "odd_count = 0\r\neven_count = 0\r\neven_index = -1\r\nodd_index = -1\r\nn = int(input())\r\narray = list(map(int, input().split()))\r\nfor index, number in enumerate(array):\r\n if number % 2 == 0:\r\n even_count += 1\r\n even_index = index\r\n else:\r\n odd_count += 1\r\n odd_index = index\r\nif odd_count == 1:\r\n print(odd_index + 1)\r\nelse:\r\n print(even_index + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=[l[i]%2 for i in range(0,n)]\r\nif s.count(0)==1:\r\n print(s.index(0)+1)\r\nelse:\r\n print(s.index(1)+1)\r\n", "x = input()\r\ny = input()\r\ny = y.split(\" \")\r\neven = 0\r\n\r\nodd = 0\r\nfor i in range(0,int(x)):\r\n y[i] = int(y[i])\r\n if y[i]%2 == 0:\r\n even+=1\r\n idx1=i\r\n else:\r\n odd+=1\r\n idx2=i\r\nif even>odd:\r\n print(idx2+1)\r\nelse:\r\n print(idx1+1)", "n=int(input())\r\ninput_line=input()\r\ninput_line=input_line.split()\r\ninput_line=[int(i) for i in input_line]\r\neven_check=input_line[0]%2+input_line[1]%2+input_line[2]%2\r\nif(even_check==0 or even_check==1):\r\n for x in input_line:\r\n if(x%2==1):\r\n print(input_line.index(x)+1)\r\n break\r\nif(even_check>1):\r\n for x in input_line:\r\n if(x%2==0):\r\n print(input_line.index(x)+1)\r\n break\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nfor i in range(n):\r\n l1[i]%=2\r\nif l1.count(1)==1:\r\n print(l1.index(1)+1)\r\nelse :\r\n print(l1.index(0)+1)", "n = int(input())\r\n\r\neven, odd = 0, 0\r\nindex1, index2 = 0, 0\r\n\r\nnumbers = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n if ((numbers[i] % 2) == 0):\r\n even += 1\r\n index1 = i\r\n else:\r\n odd += 1\r\n index2 = i\r\n \r\nif(even == 1):\r\n print(index1+1)\r\nelse:\r\n print(index2+1)", "n=int(input())\r\nnumber=[int(x) for x in input().split()]\r\nodd=0\r\neven=0\r\nfor i in range(n):\r\n if number[i]%2==0:\r\n evennum=number[i]\r\n even+=1\r\n else:\r\n oddnum=number[i]\r\n odd+=1\r\nif odd>even:\r\n print((number.index(evennum))+1)\r\nelse:\r\n print((number.index(oddnum))+1)", "n=int(input())\r\nA=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor i in A:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even>=odd:\r\n for i in A:\r\n if i%2!=0:\r\n print(A.index(i)+1)\r\nelse:\r\n for i in A:\r\n if i%2==0:\r\n print(A.index(i)+1)", "\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\neven_count = odd_count=0\r\nfirst_even = first_odd = -1\r\n\r\nfor i in range(n):\r\n if arr[i]&1:\r\n odd_count+=1\r\n first_odd = i+1\r\n else:\r\n even_count +=1\r\n first_even = i+1\r\nprint( first_even if even_count==1 else first_odd)", "def func(t):\r\n odd=[]\r\n even=[]\r\n for i in t:\r\n if i%2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n if len(odd)==1:\r\n for i in range(len(t)):\r\n if t[i]==odd[0]:\r\n return i+1\r\n if len(even)==1:\r\n for i in range(len(t)):\r\n if t[i]==even[0]:\r\n return i+1\r\n\r\nn=int(input())\r\n\r\nt=list(map(int,input().split()))\r\nprint(func(t))\r\n\r\n\r\n", "n = int(input())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\n\r\na = [i for i in arr if i%2]\r\nb = [i for i in arr if i%2 == 0]\r\n\r\nif len(a) == 1:\r\n print(arr.index(a[0]) + 1)\r\nelse:\r\n print(arr.index(b[0]) + 1)", "def odd(a):\r\n if(a%2==1):\r\n return True\r\n\r\ndef even(a):\r\n if(a%2==0):\r\n return True\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nif((l[0]%2==0 and l[1]%2==0) or (l[2]%2==0 and l[1]%2==0) or (l[0]%2==0 and l[2]%2==0)):\r\n a=list(filter(odd,l))\r\nelse:\r\n a=list(filter(even,l))\r\nprint(l.index(a[0])+1)\r\n \r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = list(zip(b, range(a)))\r\nc.sort(key=lambda x: x[0] % 2)\r\n#print(c)\r\nif c[-1][0]%2 != c[-2][0]%2:\r\n print(c[-1][1]+1)\r\nelse:\r\n #print(c)\r\n print(c[0][1]+1)\r\n", "input()\nnumbers = list(map(int, input().split()))\nevens = 0; odds = 0; espot = -1; ospot = -1\nfor i in range(0, len(numbers)):\n if numbers[i]%2 == 0:\n evens += 1\n espot = i\n else:\n odds += 1\n ospot = i\n\nprint(espot+1) if evens==1 else print(ospot+1)", "n=int(input())\r\nb=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nfor i in range(len(b)):\r\n if(b[i]%2==0):\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\n\r\nif(len(l1)>len(l2)):\r\n print(l2[0]+1)\r\nelse:\r\n print(l1[0]+1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nch = 0\r\nnch = 0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n ch+=1\r\n else:\r\n nch+=1\r\nif ch>1:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1) ", "n= int(input())\r\nk=[int (x) for x in input().split()]\r\neven=[]\r\nodd=[]\r\nE=[]\r\nO=[]\r\nfor i in range(n):\r\n if k[i]%2==0:\r\n even+=[k[i]]\r\n E+=[i+1]\r\n else:\r\n odd+=[k[i]]\r\n O+=[i+1]\r\nif len(even)==1:\r\n print(E[0])\r\nelif len(odd)==1:\r\n print(O[0])", "l = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(l):\r\n a[i] = a[i] % 2\r\nif a.count(1) == 1:\r\n print(a.index(1) + 1)\r\nelse:\r\n print(a.index(0) + 1)", "num_iqs = int(input())\r\niqs = list(map(int, input().split()))\r\n\r\neven = 0\r\nfor iq in iqs:\r\n if iq % 2 == 0:\r\n even += 1\r\n else:\r\n even -= 1\r\n\r\nfor i, iq in enumerate(iqs, start = 1):\r\n if even > 0 and iq % 2 == 1:\r\n print(i)\r\n break\r\n elif even < 0 and iq % 2 == 0:\r\n print(i)\r\n break\r\n", "a = int(input(\"\"))\nb = input(\"\").split()\ncontInpar =contPar = 0\nlistaIndexPar = [];listaIndexImpar = []\nfor index,ele in enumerate(b):\n if((int(ele)%2) ==0 ):\n listaIndexPar.append(index)\n contPar = contPar+1\n else:\n listaIndexImpar.append(index)\n contInpar = contInpar+1\nif(contInpar>contPar):\n print(listaIndexPar[0]+1)\nelse:\n print(listaIndexImpar[0]+1)\n\t\t\t \t \t\t\t\t\t\t \t\t \t \t\t\t\t\t\t \t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[0]*n\r\nfor i in range(n):\r\n\tk[i]=l[i]%2\r\nif k.count(1)>k.count(0):print(1+k.index(0))\r\nelse:print(1+k.index(1))", "# http://codeforces.com/problemset/problem/25/A\n\n\nn = int(input())\nnums = list(map(int, input().split()))\n\nf_count = 0\ns_count = 0\n\n\nfor i in range(n):\n\tif nums[i]%2 == 0:\n\t\tf_count += 1\n\t\tf_index = i+1\n\telse:\n\t\ts_count += 1\n\t\ts_index = i+1\n\nif f_count == n-1:\n\tprint(s_index)\nelse:\n\tprint(f_index)\n\n# for i in range(n):\n# \tif nums[i] % nums[0] != 0:\n# \t\tf_index = i+1\n# \telse:\n# \t\tf_count += 1\n\n# \tif nums[i] % nums[1] != 0:\n# \t\ts_index = i+1\n# \telse:\n# \t\ts_count += 1\n\n\n# if f_count == n-1:\n# \tprint(f_index)\n# else:\n# \tprint(s_index)", "\r\na=int(input())\r\ns=input().split()\r\ns1=[]\r\nsum=0\r\n\r\nl1=0\r\nl2=0\r\n\r\nfor i in range(3):\r\n if int(s[i])%2==0:\r\n l1+=1\r\n else:\r\n l2=l2+1\r\nif l1>l2:\r\n for i in range(len(s)):\r\n if int(s[i])%2!=0:\r\n ind=s.index(s[i])\r\n break\r\n\r\nelse:\r\n for i in range(len(s)):\r\n if int(s[i])%2==0:\r\n ind=s.index(s[i])\r\n break\r\nprint(ind+1)", "n = int(input())\nl = list(map(int, input().split(' ')))\nans1 = [x for x in l if x%2==0]\nans2 = [x for x in l if x%2!=0]\nif len(ans1)==1:\n print(l.index(ans1[0])+1)\nelse:\n print(l.index(ans2[0])+1)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nif (a[0] % 2 + a[1] % 2 + a[2] % 2) >= 2:\r\n\tm = 1\r\nelse:\r\n\tm = 0\r\nfor i in range(n):\r\n\tif a[i] % 2 != m:\r\n\t\tprint(i + 1)\r\n\t\tbreak", "a=int(input())\r\nn=input().split()\r\nt=[]\r\ns=len(n)\r\nfor i in range(s):\r\n t.append(int(n[i]))\r\nfor i in range(s-1):\r\n if t[i]%2!=t[i+1]%2 and i==s-2:\r\n print(i+2)\r\n elif t[i]%2!=t[i+1]%2 and i<s-2:\r\n if t[i+2]%2==t[i]%2:\r\n print(i+2)\r\n else:\r\n print(i+1)\r\n break\r\n else:\r\n continue\r\n", "n = int(input())\r\na = list(input().split())\r\nd2 = []\r\nd1 = []\r\nfor i in range(len(a)):\r\n if int(a[i])%2 == 0:\r\n d2.append(a[i])\r\n else:\r\n d1.append(a[i])\r\nif len(d2) == 1:\r\n print(1+a.index(d2[0]))\r\nelse:\r\n print(1+a.index(d1[0]))\r\n", "input()\r\nn = list(map(int,input().split()))\r\nchet = []\r\nnechet = []\r\nfor i in range(len(n)):\r\n if n[i]%2==0:\r\n chet.append(i+1)\r\n else:\r\n nechet.append(i+1)\r\nif len(chet)>len(nechet):\r\n print(nechet[0])\r\nelse:\r\n print(chet[0])", "n = int(input())\r\na = list(map(int, input().split()))\r\nlist1 = []\r\nlist2 = []\r\nc = ''\r\nb = ''\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n list1.append(i + 1)\r\n c = c + str(i + 1)\r\n else:\r\n list2.append(i + 1)\r\n b = b + str(i+1)\r\nif len(list1) > len(list2):\r\n print(b)\r\nelse:\r\n print(c)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nf = [] # Четные числа\r\nd = [] # Нечетные\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n f.append(i+1)\r\n else:\r\n d.append(i+1)\r\nif len(f) > len(d):\r\n for i in range(len(d)):\r\n print(d[i])\r\nelse:\r\n for i in range(len(f)):\r\n print(f[i])", "a=int(input())\r\nb=[int(x) for x in input('').split()]\r\nc=[]\r\nd=[]\r\nfor i in b:\r\n if i%2==0:\r\n d.append(i)\r\n else:\r\n c.append(i)\r\nif len(d)==1:\r\n print(b.index(d[0])+1)\r\nelse:\r\n print(b.index(c[0])+1)", "n=input()\r\nk=list(map(int,input().split()))\r\nl=[]\r\nl1=[]\r\nfor i in k:\r\n if i%2==0:l.append(i)\r\n else:l1.append(i)\r\nif len(l)>len(l1):\r\n print(k.index(l1[0])+1)\r\nelse:print(k.index(l[0])+1)\r\n", "n=int(input())\r\nline=input().split()\r\nlist=[int(i)%2 for i in line]\r\na=list.count(0)\r\nb=list.count(1)\r\nif a>b:\r\n i=list.index(1)\r\n print(i+1)\r\nif a<b:\r\n i=list.index(0)\r\n print(i+1)", "\r\ninput()\r\na=list(map(int,input().split()))\r\ne,odd=0,0\r\nf,g=0,0\r\n\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n e+=1\r\n f=i\r\n else:\r\n odd+=1\r\n g=i\r\nif odd==1 :print(g+1)\r\nelse:print(f+1)\r\n\r\n\r\n\r\n", "num = int(input())\r\ndel num\r\nnumbers = input().split()\r\nnumbers = list(map(int, numbers))\r\nodd_cnt = 0\r\neven_cnt = 0 \r\ndef is_odd(i):\r\n\tif i % 2 != 0:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\nfor j in numbers:\r\n\tif is_odd(j) == True:\r\n\t\todd_cnt += 1\r\n\telse:\r\n\t\teven_cnt += 1\r\n\r\nif odd_cnt == 1:\r\n\tfor a in numbers:\r\n\t\tif a % 2 != 0:\r\n\t\t\tprint(numbers.index(a) + 1)\r\nelif even_cnt == 1:\r\n\tfor b in numbers:\r\n\t\tif b % 2 == 0:\r\n\t\t\tprint(numbers.index(b) + 1)\t\r\n\t\t\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\ncounter_even=0\r\ncounter_odd=0\r\nfor i in y:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even==1:\r\n for i in y:\r\n if i%2!=0:\r\n counter_even+=1\r\n else:\r\n counter_even+=1\r\n print(counter_even)\r\n break\r\nif odd==1:\r\n for i in y:\r\n if i%2==0:\r\n counter_odd+=1\r\n else:\r\n counter_odd+=1\r\n print(counter_odd)\r\n break\r\n", "n = int(input())\nnumbers = list(map(int,input().split()))\n\nodds = []\nevens = []\n\nfor i in range(0,n):\n if numbers[i]%2 == 0:\n evens.append(i+1)\n else:\n odds.append(i+1)\n\nif len(evens) == 1:\n print(evens[0])\nelse:\n print(odds[0])\n \t \t\t\t \t \t \t \t", "n = int(input())\r\n\r\na, b, c, *m = list(map(int, input().split()))\r\n\r\naC, bC, cC = a % 2, b % 2, c % 2\r\n\r\nchet = -1\r\n\r\nif aC == bC == cC:\r\n chet = aC\r\nelif aC == bC:\r\n print(3)\r\nelif aC == cC:\r\n print(2)\r\nelif bC == cC:\r\n print(1)\r\n\r\nif chet != -1:\r\n for i, num in enumerate(m):\r\n if num % 2 != chet:\r\n print(i+4)\r\n break\r\n", "n = input()\r\ns = [int(i) for i in input().split()]\r\nli = []\r\nfor i in s:\r\n li.append(i%2)\r\nif li.count(1) == 1:\r\n print(li.index(1)+1)\r\nelse:\r\n print(li.index(0)+1)", "a = int(input())\r\nb = list(map(int, input().split()))\r\ne = []\r\no = []\r\nfor i in b:\r\n if(i % 2 == 0):\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif(len(o) == 1):\r\n print(b.index(o[0]) + 1)\r\nelse:\r\n print(b.index(e[0]) + 1)\r\n", "def f(a):\r\n return a%2\r\nn=int(input())\r\nt=map(int,input().split())\r\nt=list(map(f,t))\r\nif sum(t)==1:\r\n print(t.index(1)+1)\r\nelse:\r\n print(t.index(0)+1)\r\n\r\n \r\n", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\neven_arr = list(filter(lambda x: x % 2 == 0, arr))\r\nodd_arr = list(filter(lambda x: x % 2 != 0, arr))\r\n\r\nif len(even_arr) > len(odd_arr):\r\n print(arr.index(odd_arr[0]) + 1)\r\nelse:\r\n print(arr.index(even_arr[0]) + 1)\r\n", "n=int(input())\r\nx=map(int,input().split())\r\nl=list(x)\r\n\r\nlo=[]\r\nle=[]\r\n\r\nfor i in range (len(l)):\r\n if (l[i]%2==0):\r\n le.append(l[i])\r\n elif (l[i]%2!=0):\r\n lo.append(l[i])\r\n \r\n \r\nif (len(le)<len(lo)):\r\n print(l.index(le[0]) + 1)\r\nelif (len(le)>len(lo)):\r\n print(l.index(lo[0]) + 1)", "a = int(input())\r\n\r\nx = list(map(str, input().split()))\r\nc=0\r\ns=0\r\nfor i in x :\r\n if int(i)%2==0:\r\n q = i\r\n c+=1\r\n elif int(i)%2 != 0 :\r\n s+=1\r\n w = i\r\n \r\n \r\nif s > c :\r\n \r\n q = x.index(q)\r\n print(q+1)\r\nelif c > s :\r\n \r\n w = x.index(w)\r\n print(w+1)", "n=int(input())\na=[int(x) for x in input().split()]\ny=z=b=c=0\nfor i in range(0,n):\n\tif(a[i]%2==0):\n\t\ty+=1\n\t\tb=i+1\n\telse:\n\t\tz+=1\n\t\tc=i+1\nif(y>1):\n\tprint(c)\nelse:\n\tprint(b)\n \t \t \t \t \t \t \t \t", "input()\r\nI = input().split()\r\nl = []\r\nfor i in I:\r\n l.append(int(i) % 2)\r\n\r\nif l.count(0) == 1:\r\n print(l.index(0) + 1)\r\nelif l.count(1) == 1:\r\n print(l.index(1) + 1)", "def eveness(n):\n if n%2==0: return True\n else: return False\n \nn = input()\nnumbers = list(map(int,input().split(\" \")))\ntst = list(map(eveness,numbers))\nfalse= tst.count(False)\ntrue= tst.count(True)\nif false>true: print(tst.index(True)+1)\nelse:print(tst.index(False)+1)\n\n\t \t \t \t\t \t \t\t\t \t\t \t\t \t\t\t\t", "n=int(input())\r\nx=list(map(int,input().split()))\r\ncounto=0\r\ncounte=0\r\nfor i in range(n):\r\n if(x[i]&1==0):\r\n counte+=1\r\n else:\r\n counto+=1\r\nif(counto>1):\r\n for i in range(n):\r\n if(x[i]&1==0):\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if(x[i]&1==1):\r\n print(i+1)", "x=int(input())\r\nlist1=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor x in list1:\r\n if x%2==0:\r\n even+=x\r\n else:\r\n odd+=x\r\n\r\na=min(odd,even)\r\nprint(list1.index(a)+1)\r\n", "x= input()\r\ny= input().split()\r\nodd,even=0,0\r\nfor i in y:\r\n if (int(i)%2):\r\n odd+=1\r\n odd_num=i\r\n else:\r\n even+=1\r\n even_num=i\r\nif odd>even :\r\n print((y.index(even_num))+1)\r\nelse:\r\n print((y.index(odd_num))+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nq=0\r\nx=0\r\ny=0\r\nfor i in l:\r\n\tq+=1\r\n\tif i%2==0: \r\n\t\ta=q\r\n\t\tx+=1\r\n\telse:\r\n\t\tb=q\r\n\t\ty+=1\r\n\tif x==1 and y>1:\r\n\t\tprint(a)\r\n\t\tbreak\r\n\telif y==1 and x>1:\r\n\t\tprint(b)\r\n\t\tbreak", "def counto(lst):\r\n c=0\r\n for x in lst:\r\n if x%2!=0:\r\n c=c+1\r\n return c\r\ndef counte(lst):\r\n c=0\r\n for x in lst:\r\n if x%2==0:\r\n c=c+1\r\n return c\r\n\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nd= [int(x) for x in input().split()]\r\no=counto(d)\r\ne=counte(d)\r\nfor index,element in enumerate(d):\r\n\r\n if o>e and element%2==0:\r\n print(index+1)\r\n if e>o and element%2!=0:\r\n print(index+1) ", "n = int(input())\nnumbers = [(int(x) % 2) for x in input().split(\" \")]\nreverseTarget = 0\nif numbers[0] == numbers[1]:\n reverseTarget = numbers[0]\nelif numbers[0] == numbers[2]:\n reverseTarget = numbers[0]\nelse:\n reverseTarget = numbers[1]\n\nfor i in range(0, n):\n if numbers[i] != reverseTarget:\n result = i + 1\n break\n\nprint(result)\n\n\n\n \t\t \t\t \t \t\t \t \t\t \t \t \t \t", "n=int(input())\r\nL=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nm=0\r\np=0\r\nfor i in range(len(L)):\r\n if(L[i]%2!=0):\r\n m=i\r\n x=x+1\r\n else:\r\n p=i\r\n y=y+1\r\nif(x==1):\r\n print(m+1)\r\nelse:\r\n print(p+1)\r\n ", "s=int(input())\r\nb=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor i in b:\r\n if i%2==0:\r\n even+=1\r\n elif i%2==1:\r\n odd+=1\r\nif even > odd:\r\n for j in range(s):\r\n if b[j]%2==1:\r\n print(j+1)\r\n break\r\nelse:\r\n for j in range(s):\r\n if b[j]%2==0:\r\n print(j+1)\r\n break", "input()\narr = [int(x) & 1 for x in input().split()]\nx = 0 if arr.count(1) > arr.count(0) else 1\nprint(arr.index(x)+1)\n\n\t\t\t \t \t \t\t \t\t\t \t \t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\no = 0\r\ne = 0\r\nnum = -1\r\nfor i in l:\r\n if i%2:\r\n o += 1\r\n else:\r\n e += 1\r\nif e == 1:\r\n for i in range(n):\r\n if l[i]%2 == 0:\r\n num = i\r\n break\r\nelse:\r\n for i in range(n):\r\n if l[i]%2:\r\n num = i\r\n break\r\nprint(num+1)", "\n# def gcd(lft, rght):\n# if lft < rght:\n# rght, lft = lft, rght\n# if rght == 0:\n# return lft\n# return gcd(rght, lft % rght)\n#\n#\n# def lcm(lft, rght):\n# return (lft * rght) / gcd(lft, rght)\n\n\nnumbers_count = int(input())\nnumbers = map(int, input().split())\n\neven_cnt = 0\neven_pos = 0\nodd_cnt = 0\nodd_pos = 0\n\nfor index, number in enumerate(numbers):\n if number % 2:\n odd_cnt += 1\n odd_pos = index\n else:\n even_cnt += 1\n even_pos = index\n\nif even_cnt > odd_cnt:\n print(odd_pos + 1)\nelse:\n print(even_pos + 1)", "n = int(input())\r\na = list(map(int,input().split()))\r\neven = 0\r\nodd = 0\r\neven_index = 0\r\nodd_index = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even += 1\r\n even_index = i + 1\r\n else:\r\n odd += 1\r\n odd_index = i + 1\r\nif(even == 1):\r\n print(even_index)\r\nelse:\r\n print(odd_index)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\neven_count = odd_count = odd_index = even_index = 0\r\n\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even_count += 1\r\n even_index = i\r\n else:\r\n odd_count += 1\r\n odd_index = i\r\n\r\n if even_count > 1 and odd_count == 1:\r\n print(odd_index + 1)\r\n break\r\n elif odd_count > 1 and even_count == 1:\r\n print(even_index + 1)\r\n break\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nodds = []\r\nevens = []\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n evens.append(i)\r\n else:\r\n odds.append(i)\r\nif len(evens) == 1:\r\n print(evens[0]+1)\r\nelse:\r\n print(odds[0]+1)", "def _25A(numbers):\r\n\r\n modulus = list(map(lambda x: x % 2, numbers))\r\n if modulus.count(1) >1:\r\n\r\n return(modulus.index(0) + 1)\r\n\r\n else:\r\n\r\n return(modulus.index(1) + 1)\r\n\r\ninput()\r\nprint(_25A(list(map(lambda x: int(x), input().split()))))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 21 23:03:10 2020\r\n\r\n@author: 86133\r\n\"\"\"\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nx, y, x1, y1 = 0, 0, 0, 0\r\nfor i in range(n):\r\n if a[i]%2 == 0:\r\n x += 1\r\n x1 = i+1\r\n else:\r\n y += 1\r\n y1 = i+1\r\nif x > y:\r\n print(y1)\r\nelse:\r\n print(x1)", "import sys\r\nimport os\r\nimport math\r\n\r\n\r\nscript_dir = os.path.dirname(__file__)\r\nusername = \"trifiasco\"\r\nif username in script_dir:\r\n sys.stdin = open(script_dir + '/in.txt', 'r')\r\n\r\ndef call(nums, flag):\r\n for i in range (len(nums)):\r\n if (nums[i] & 1) == flag:\r\n return i + 1\r\n\r\nif __name__ == \"__main__\":\r\n while True:\r\n try:\r\n n = int(input())\r\n except EOFError:\r\n break\r\n\r\n nums = list(map(int, input().split()))\r\n\r\n odd = 0\r\n even = 0\r\n\r\n for i in range(3):\r\n if nums[i] & 1:\r\n odd += 1\r\n else:\r\n even += 1\r\n \r\n if odd > even:\r\n print(call(nums, 0))\r\n else:\r\n print(call(nums, 1))\r\n\r\n pass\r\n\r\n", "n=int(input())\r\nl=[int(i) for i in input().split(\" \")]\r\neven,odd=0,0\r\nlasteven,lastodd=0,0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n even+=1\r\n lasteven=i\r\n else:\r\n odd+=1\r\n lastodd=i\r\nif even>odd:\r\n print(lastodd+1)\r\nelse:\r\n print(lasteven+1)", "t=0\r\na=[0]*99\r\nn=0\r\nm=0\r\ncont=0\r\ncont2=0\r\n\r\nt= int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(0,t):\r\n\r\n if a[i]%2==0:\r\n \r\n cont+=1\r\n n = i+1\r\n \r\n else:\r\n \r\n cont2+=1\r\n m = i+1\r\n \r\n\r\nif(cont==1):\r\n print(n)\r\nelif(cont2==1):\r\n print(m)\r\n ", "n = int(input())\n\nnums = [int(x) for x in input().split(\" \")]\n\nodd = 0\neven = 0\n\nfor num in nums:\n if num%2 == 0:\n even += 1\n else:\n odd += 1\n\nif even>odd:\n for i,num in enumerate(nums):\n if num%2==1:\n print(i+1)\n break\nelse:\n for i,num in enumerate(nums):\n if num%2==0:\n print(i+1)\n break\n", "count = int(input())\r\n\r\nnumbers = [int(x) for x in input().split()]\r\n\r\nchet = []\r\nnechen = []\r\n\r\nfor i in range(len(numbers)):\r\n if numbers[i] % 2 == 0:\r\n chet.append(i + 1)\r\n else:\r\n nechen.append(i + 1)\r\n\r\nif len(chet) == 1:\r\n print(chet[0])\r\nelse:\r\n print(nechen[0])\r\n", "#!pip install numpy\r\nimport math\r\nimport sys\r\nfrom fractions import Fraction\r\n\r\n#import numpy as np \r\nx=int(input())\r\narr=input().split()\r\n\r\n\r\nj=0\r\n\r\nd=[]\r\nfor i in range(len(arr)):\r\n if(int(arr[i])%2!=int(arr[i+1])%2 or int(arr[i])%2!=int(arr[i+2])%2):\r\n if(int(arr[i])%2==int(arr[i+2])%2):\r\n print(i+2) \r\n elif(int(arr[i+1])%2==int(arr[i+2])%2):\r\n print(i+1)\r\n else :\r\n print(i+3)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\nec=0\r\noc=0\r\nl1=-1\r\nl2=-1\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n ec+=1\r\n l1=i\r\n else:\r\n oc+=1\r\n l2=i\r\nif ec==1:\r\n print(l1+1)\r\nelse:\r\n print(l2+1)", "# 25A - IQ test\r\n# http://codeforces.com/problemset/problem/25/A\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\nodd_count = 0\r\nfor x in arr:\r\n if x & 1:\r\n odd_count += 1\r\n\r\nfor i, v in enumerate(arr):\r\n if (odd_count != 1):\r\n if (~v & 1):\r\n print(i + 1)\r\n exit()\r\n else:\r\n if (v & 1):\r\n print(i + 1)\r\n exit()", "n = int(input());\r\na,b= 0,0;\r\ndl = list(map(int, input().split()));\r\nfor i in range(n):\r\n if dl[i]%2==0:\r\n a+=1;\r\n ai=i;\r\n else:\r\n b+=1;\r\n bi=i;\r\n if (a>1 and b==1) or (a==1 and b>1):\r\n print([ai+1,bi+1][a>b]);\r\n break;", "n=int(input())\r\na=list(input().split(' '))\r\na=[int(i) for i in a]\r\nb=a[0]%2\r\nc=[]\r\nfor i in range(0,n):\r\n if a[i]%2!=b:\r\n e=i\r\n c.append(i)\r\nif len(c)==1:\r\n print(e+1)\r\nelse:\r\n print(1)\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor y in l1:\r\n if y%2==0:\r\n e+=1 \r\n else:\r\n o+=1 \r\nif e>o:\r\n for x in range(len(l1)):\r\n if l1[x]%2!=0:\r\n print(x+1)\r\nelse:\r\n for x in range(len(l1)):\r\n if l1[x]%2==0:\r\n print(x+1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nodd_count = sum(x & 1 for x in arr)\r\nfor i, x in enumerate(arr):\r\n if (odd_count != 1 and ~x & 1) or (odd_count == 1 and x & 1):\r\n print(i + 1)\r\n exit()", "n = input()\r\na = [(int(x)%2) for x in input().split()]\r\nif a.count(1) == 1:\r\n print(a.index(1) + 1)\r\nelse:\r\n print(a.index(0) + 1)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in a if i % 2 == 0]\r\nc = [int(i) for i in a if i % 2 != 0]\r\nif len(b) < len(c):\r\n print(a.index(b[0]) + 1)\r\nelse:\r\n print(a.index(c[0]) + 1)", "a = int(input())\r\nlist = []\r\nlist += map(int,input().split())\r\n\r\ncount1 = 0\r\ncount2 = 0\r\nx = 0\r\ny = 0\r\n\r\nfor i in range(a):\r\n if list[i] % 2 == 0:\r\n count1 += 1\r\n x = i+1\r\n else:\r\n count2 += 1\r\n y = i+1\r\n\r\nif count1 == 1:\r\n print(x)\r\nelse:\r\n print(y)\r\n\r\n \r\n ", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nn=inp()\r\nl=inlt()\r\nn_even,n_odd=0,0\r\neven_idx,odd_idx=[],[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n n_even+=1\r\n even_idx.append(i)\r\n if l[i]%2==1:\r\n n_odd+=1\r\n odd_idx.append(i)\r\nif n_odd==1:\r\n print(odd_idx[0]+1)\r\nelse:\r\n print(even_idx[0]+1)", "n = int(input())\r\n\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nnum = [int(i) for i in input().split()]\r\n\r\nfor i in range(0,n):\r\n\tif num[i] % 2 == 0:\r\n\t\tcount1 += 1\r\n\telse:\r\n\t\tcount2 += 1\r\n\r\nif count1<count2:\r\n\tfor i in range(0,n):\r\n\t\tif num[i] % 2 == 0:\r\n\t\t\tprint(i+1)\r\nelif count1>count2:\r\n\tfor i in range(0,n):\r\n\t\tif num[i] % 2 != 0:\r\n\t\t\tprint(i+1)\r\n\r\n", "n=int(input())\r\nodd = 0\r\neven = 0\r\noddNum = 0\r\nevenNum = 0\r\na=input()\r\nitem = a.split(\" \")\r\ntesti = [eval(x) for x in item]\r\nfor i in range(0,n):\r\n if testi[i] % 2 == 0:\r\n even+=1\r\n evenNum = i+1\r\n else:\r\n odd+=1\r\n oddNum = i+1\r\nif odd == 1:\r\n print(oddNum)\r\nif even == 1:\r\n print(evenNum)\r\n \r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\ne,o=0,0\r\nfor i in range(len(b)):\r\n if(b[i]%2==0):\r\n k=i+1\r\n e+=1\r\n else:\r\n j=i+1\r\n o+=1\r\nif(e==1):\r\n print(k)\r\nelif(o==1):\r\n print(j) \r\n\r\n", "n = int(input())\nlst = [int(i) for i in input().split(' ')]\nevenct = 0\noddidx = 0\nevenidx = 0\n\nfor i in range(n):\n if lst[i] % 2 == 0:\n evenct += 1\n evenidx = i\n else:\n oddidx = i\n\nif evenct == 1:\n print(evenidx + 1)\nelse:\n print(oddidx + 1)\n\n \t \t\t\t\t \t\t \t \t \t\t", "n = int(input())\r\nstring = list(map(int, input().split()))\r\nan = 0\r\nno = 0\r\nfor i in string[:4]:\r\n if i % 2 == 0:\r\n an += 1\r\n else:\r\n no += 1\r\nif an > no:\r\n a = 1\r\nelse:\r\n a = 0\r\nfor i in range(len(string)):\r\n if string[i] % 2 == a:\r\n print(i + 1)\r\n break", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[]\r\nc=[]\r\nfor i in a:\r\n if i%2==0:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nif len(b)>len(c):\r\n print(1+a.index(c[0]))\r\nelse:\r\n print(1+a.index(b[0]))", "n = int(input())\n\na = list(map(int, input().split(\" \")))\n\nstate = None\n\nfor i in range(len(a)):\n\tif i == 0:\n\t\tstate = 0 if a[i] % 2 == 0 else 1\n\n\telif i == 1:\n\t\tif a[i] % 2 == state:\n\t\t\tpass # state is confirmed\n\t\telse: # solution is either 0, 1 or 2\n\t\t\tif a[2] % 2 == state:\n\t\t\t\tprint(\"2\")\n\t\t\telse:\n\t\t\t\tprint(\"1\")\n\t\t\tbreak\n\n\telse:\n\t\tif a[i] % 2 != state:\n\t\t\tprint(str(i+1))\n\n\n\n", "c = int(input())\r\nx = [int(i) for i in input().split()]\r\nz = 0\r\na = 0\r\nb = 0\r\ny = []\r\nfor i in x:\r\n if i%2 == 0:\r\n a += 1\r\n else:\r\n b += 1\r\nif a>b:\r\n k = 0\r\nelse:\r\n k = 1\r\nfor i in range(c):\r\n if x[i] % 2 != k:\r\n z = i\r\nprint(z+1)\r\n", "n = int(input())\r\nlst = input().split()\r\nfor i in range(n):\r\n lst[i] = int(lst[i])\r\na = 0\r\nb = 0\r\ncon = 0\r\nfor j in range(n):\r\n if lst[j] % 2 != 0: \r\n b+=1\r\n else:\r\n a+=1\r\nif a == 1:\r\n for m in range(n) :\r\n if lst[m] % 2 == 0:\r\n con = m\r\nelse:\r\n for m in range(n) :\r\n if lst[m] % 2 != 0 :\r\n con = m\r\nprint(con+1)", "input()\r\na = [int(i) % 2 for i in input().split()]\r\nprint(a.index(a.count(0) > 1) + 1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nodd, even = [], []\r\nflag = -1\r\n\r\nfor i in l:\r\n\tif i % 2 == 0: even.append(i)\r\n\telse: odd.append(i)\r\n\r\nif len(even) == 1:\r\n\tflag = even[0]\r\nelse:\r\n\tflag = odd[0]\r\n\r\nfor i, j in enumerate(l):\r\n\tif j == flag:\r\n\t\tprint(i+1)\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\noddi=0\r\neveni=0\r\nfor i in range(a):\r\n if b[i]%2==1:\r\n odd+=1\r\n oddi=i+1\r\n else:\r\n even+=1\r\n eveni=i+1\r\nif odd==1:\r\n print(oddi)\r\nelse:\r\n print(eveni)", "n=int(input())\nl=[int(x) for x in input().split()]\ne=0\no=0\nop=0\nep=0\nfor i in range(0, len(l)):\n if l[i] & 1 == 1:\n o+=1 \n op=i\n else:\n e+=1 \n ep=i \nif e==1:\n print(ep+1)\nelse:\n print(op+1)\n\n\t\t\t\t \t \t \t\t\t\t \t\t\t \t \t\t \t\t\t\t", "N = int(input())\nnums = list(map(int, input().split()))\n\nindexes = [[], []]\n\nfor i, num in enumerate(nums):\n indexes[num % 2].append(i)\n\nif len(indexes[0]) < len(indexes[1]):\n print(indexes[0][0]+1)\nelse:\n print(indexes[1][0]+1)", "n=int(input())\r\ns=input()\r\ns=s.split(\" \")\r\nim=0\r\np=0\r\nfor i in range(n):\r\n s[i]=int(s[i])%2\r\n if s[i]==1:\r\n im+=1\r\n else:\r\n p+=1\r\n\r\nif p==1:\r\n print(s.index(0)+1)\r\nelse:\r\n print(s.index(1)+1)", "def judge_evenness(num):\r\n return num%2\r\n \r\nn = int(input())\r\nnumbers = map(int,input().split())\r\nevenness_of_numbers = list(map(judge_evenness,numbers))\r\nif evenness_of_numbers.count(0) == 1:\r\n print(evenness_of_numbers.index(0) + 1)\r\nelse:\r\n print(evenness_of_numbers.index(1) + 1)", "n=input()\r\nn=int(n)\r\na = input()\r\ne=0\r\no=0\r\nA = list(map(int,a.split(' ')))\r\nfor i in range (0,n):\r\n if A[i]%2==0:\r\n ei=i+1\r\n e=e+1\r\n else :\r\n ii = i+1\r\n o=o+1\r\nif o<e:\r\n print(ii)\r\nelse :\r\n print(ei)", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\nnum = list(map(int, input().split()))\r\ncount_even, count_odd, last_even, last_odd = 0, 0, 0, 0\r\ni = 0\r\nfor i in range(n):\r\n\tif num[i] % 2 == 0:\r\n\t\tlast_even = i + 1\r\n\t\tcount_even += 1\r\n\telse:\r\n\t\tlast_odd = i + 1\r\n\t\tcount_odd += 1\r\n\r\nprint(last_odd if count_odd < count_even else last_even)", "n = int(input())\na = list(map(int, input().split()))\n\nparity1 = a[0] % 2\nparity2 = a[1] % 2\n\nif parity1 != parity2:\n\tif parity1 == a[2] % 2:\n\t\tprint(2)\n\telse:\n\t\tprint(1)\n\texit()\n\t\t\nfor i in range(2, n):\n\tif parity1 != a[i] % 2:\n\t\tprint(i + 1)\n\n\n", "n = int(input(\"\"))\r\nl = list(map(int, input().split(' ')))\r\ne = 0\r\no = 0\r\nans = 0\r\nfor i in l:\r\n if i % 2 == 0:\r\n e+=1\r\n else:\r\n o += 1\r\nif e > o:\r\n for i in range(n):\r\n if l[i] % 2 == 1:\r\n ans = i+1\r\nelse:\r\n for i in range(n):\r\n if l[i] % 2 == 0:\r\n ans = i+1\r\nprint(ans)", "n = int(input())\r\nar = [int(x) for x in input().split()]\r\n\r\nodc = sum(x & 1 for x in ar)\r\nfor i, v in enumerate(ar):\r\n if (odc != 1 and ~v & 1) or (odc == 1 and v & 1):\r\n print(i + 1)\r\n ", "from collections import Counter\r\n\r\ninput()\r\nls = list(map(int, input().split(\" \")))\r\n# print(ls)\r\n\r\nce = len([1 for x in ls if x%2==0])\r\nco = len([1 for x in ls if x%2==1])\r\n\r\nif ce==1:\r\n for i in range(len(ls)):\r\n if ls[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(ls)):\r\n if ls[i]%2==1:\r\n print(i+1)\r\n break", "import sys\r\n# import math\r\n# import collections\r\nfrom os import path\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\ndef generatePrimes(n):\r\n # Sieve of Eratosthenes\r\n prime = [True for i in range(n+1)]\r\n i = 2\r\n answer = []\r\n while i * i <= n:\r\n if prime[i] == True:\r\n answer.append(i)\r\n for j in range(i * i, n+1, i):\r\n prime[j] = False\r\n i += 1\r\n \r\n return answer\r\n\r\n\r\ndef solve(n):\r\n # YOUR CODE HERE\r\n array = list(map(int,input().split()))\r\n d = []\r\n\r\n count_even = 0\r\n odd_index = 0\r\n even_index = 0\r\n\r\n for i in range(n):\r\n if array[i] % 2 == 0:\r\n count_even += 1\r\n even_index = i + 1\r\n else:\r\n odd_index = i + 1\r\n \r\n if count_even == 1:\r\n print(even_index)\r\n else:\r\n print(odd_index)\r\n\r\n\r\ndef main():\r\n testcases = 1 \r\n # testcases = int(input()) # multiple testcases\r\n for _ in range(testcases):\r\n # n, q = map(int, input().split())\r\n n = int(input())\r\n # n = input()\r\n # string = input()\r\n # array = list(map(int,input().split()))\r\n # array = list(input())\r\n # array = input()\r\n solve(n)\r\n\r\nif __name__ == \"__main__\":\r\n if(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n main()\r\n\r\n", "n = int(input())\n\narr = [int(x) for x in input().split(\" \")]\n\nif arr[0] % 2 == arr[1] % 2 == arr[2] % 2:\n check_num = arr[0] % 2\n\n for i in range(3, n):\n a = arr[i]\n if a % 2 != check_num:\n print(i + 1)\n break\nelif arr[0] % 2 == arr[1] % 2:\n print(2 + 1)\nelif arr[0] % 2 == arr[2] % 2:\n print(1 + 1)\nelse:\n print(0 + 1)\n", "n=int(input())\nl=list(input().split())\nl=list(map(int,l))\nye=list()\nnah=list()\nfor i in range(n):\n if l[i]%2==0:\n ye.append(l[i])\n elif l[i]%2==1:\n nah.append(l[i])\nif len(ye)==1:\n print(l.index(ye.pop())+1)\nelif len(nah)==1:\n print(l.index(nah.pop())+1)\n", "n = input()\r\na = list(map(lambda x:x%2,map(int,input().split())))\r\nq = sum(a)\r\nif q==1:\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\nevens = []\r\nodds = []\r\nfor i in range(len(numbers)):\r\n if numbers[i] % 2 == 0:\r\n evens.append(numbers[i])\r\n else:\r\n odds.append(numbers[i])\r\nif len(evens) == 1:\r\n ans = evens[0]\r\nelif len(odds) == 1:\r\n ans = odds[0]\r\nfor k in range(len(numbers)):\r\n if numbers[k] == ans:\r\n print(k + 1)\r\n break\r\n else:\r\n continue", "n=int(input())\r\nar=[int(i) for i in input().split()]\r\nec=0\r\noc=0\r\nfor i in range(n):\r\n if ar[i]%2==0:\r\n ec+=1\r\n else:\r\n oc+=1\r\nif ec>oc:\r\n for i in range(n):\r\n if ar[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if ar[i]%2==0:\r\n print(i+1)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\no=0\r\ne=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e=e+1\r\n else:\r\n o=o+1\r\n \r\nif e==1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n \r\nif o==1:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n print(i+1)", "n= int(input())\r\nnums = [int(x) for x in input().split()]\r\neven_diffElemIndex = 0\r\neven_elemCount = 0\r\n\r\nodd_diffElemIndex = 0\r\nodd_elemCount = 0\r\n\r\nfor i in range(0,n):\r\n\r\n if(nums[i]%2==0):\r\n even_diffElemIndex = i\r\n even_elemCount+=1\r\n elif(nums[i]%2!=0):\r\n odd_diffElemIndex = i\r\n odd_elemCount+=1\r\n\r\nif(even_elemCount==1):\r\n print(even_diffElemIndex+1)\r\nelse:print(odd_diffElemIndex+1)\r\n", "n = input()\r\nn = int(n)\r\na = list(input().split())\r\na = [int(i) for i in a]\r\nx = 0\r\ny = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n x += 1\r\n else:\r\n y += 1\r\n\r\nif x == n-1:\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n print(i+1)\r\n break;\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n break;\r\n", "a=int(input())\r\nb=list(map(int, input(). split()))\r\ne=[n for n in b if n%2==0]\r\no=[n for n in b if n%2!=0]\r\nif len(e)<len(o): print(b.index(e[0])+1)\r\nelse: print(b.index(o[0])+1)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\neven = []\r\nodd=[]\r\nif n == 3: \r\n evens = []\r\n odds = []\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n evens.append(i)\r\n else: \r\n odds.append(i)\r\n if len(evens) == 1:\r\n print(evens[0]+1)\r\n else:\r\n print(odds[0]+1)\r\n \r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n if len(even) >= 1 and len(odd) == 1:\r\n print(odd[0] +1)\r\n break\r\n else:\r\n even.append(i)\r\n else:\r\n if len(odd) >= 1 and len(even) == 1:\r\n print(even[0] +1)\r\n break\r\n else:\r\n odd.append(i)", "# 4\r\n# http://codeforces.com/problemset/problem/25/A\r\n\r\ninput();l=[int(x)%2 for x in input().split()]\r\nprint(l.index(sum(l)==1)+1)", "n=int(input())\r\na=list(input().split())\r\neven=0\r\nodd=0\r\nind=-1\r\nfor i in a:\r\n if int(i)%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even<odd:\r\n for i in range(len(a)):\r\n if int(a[i])%2==0:\r\n ind=i+1\r\n break\r\nelse:\r\n for i in range(len(a)):\r\n if int(a[i])%2!=0:\r\n ind=i+1\r\n break\r\nprint(ind)\r\n", "def seperateints(x): \r\n k=''\r\n l=[]\r\n for i in x :\r\n if i==' ' :\r\n l.append(int(k))\r\n k=''\r\n continue \r\n k=k+i\r\n l.append(int(k)) \r\n return(l)\r\ndef luckynum(x):\r\n for i in x : \r\n if i!='4' and i!='7' :\r\n return False\r\n return True \r\nn=int(input())\r\nl=seperateints(input())\r\nk=0\r\ns=0\r\nd=0\r\ne=0\r\nfor i in range(n) :\r\n if l[i]%2==0 : \r\n k+=1\r\n d=i+1\r\n else :\r\n s+=1\r\n e=i+1\r\nif k==1 : print(d)\r\nelif s==1 : print(e) ", "n = int(input())\r\nm = list(map(int, (input().split())))\r\n\r\nfirst_even_idx = -1\r\nfirst_odd_idx = -1\r\neven_count = 0\r\nodd_count = 0\r\nfor i in range(0, n):\r\n if m[i] % 2 == 0:\r\n if first_even_idx == -1:\r\n first_even_idx = i\r\n even_count += 1\r\n if m[i] % 2 == 1:\r\n if first_odd_idx == -1:\r\n first_odd_idx = i\r\n odd_count += 1\r\nif even_count > 1:\r\n print(first_odd_idx + 1)\r\nelse:\r\n print(first_even_idx + 1)", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\ne=0\r\no=0\r\nfor x in range(n):\r\n if a[x]%2==0:\r\n e=e+1\r\n else:\r\n o=o+1\r\nif e==o:\r\n print(1)\r\nelse:\r\n if e>o:\r\n for x in range(n):\r\n if a[x]%2!=0:\r\n print(x+1)\r\n else:\r\n for x in range(n):\r\n if a[x]%2==0:\r\n print(x+1)", "n=int(input())\r\na=list(map(int, input().split()))\r\nfe=fo=-1\r\ne=o=0\r\nj=0\r\nfor i in a:\r\n if fe==-1 and i%2==0:\r\n fe=j\r\n e+=1\r\n elif fo==-1 and i%2==1:\r\n fo=j\r\n o+=1\r\n elif i%2==0: e+=1\r\n else: o+=1\r\n j+=1\r\nif o>e: print(fe+1)\r\nelse: print(fo+1)", "n = int(input())\r\n\r\nl = [int(x) for x in input().split() ]\r\nl1= []\r\n\r\n\r\n\r\nfor elt in l:\r\n l1.append(elt%2)\r\nif sum(l1)==1:\r\n print(l1.index(1)+ 1)\r\nelse:\r\n print(l1.index(0)+ 1)\r\n\r\n\r\n", "n=int(input())\r\ntasks=list(map(int,input().split())) [:n]\r\ni=0\r\nj=0\r\nk=0\r\nwhile i<n:\r\n if tasks[i]%2==0:\r\n j=j+1\r\n m=i\r\n elif tasks[i]%2!=0:\r\n k=k+1\r\n y=i\r\n i=i+1\r\nif j>k:\r\n print(y+1)\r\nelse:\r\n print(m+1)\r\n", "n = int(input())\r\n\r\ns = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n s[i] = s[i]%2\r\nif sum(s) == 1:\r\n print(s.index(1)+1)\r\nelse:\r\n print(s.index(0)+1)", "def main():\n n = int(input())\n a = list(map(int, input().split()))\n e = [0] * 2\n for i in range(len(a)):\n e[a[i]%2] +=1\n t = min(e)\n for i in range(n):\n if a[i] % 2 == e.index(t):\n print(i+1)\nmain()\n ", "n=int(input())\na=[int(x) for x in input().split()]\neven=[]\nuneven=[]\nfor i in range(len(a)):\n if a[i]%2==0:\n even.append([a[i],i+1])\n else:\n uneven.append([a[i],i+1])\nif len(even)==1:\n print(even[0][1])\nelse:\n print(uneven[0][1])\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nk = []\r\nfor i in range(0,len(l)):\r\n if l[i] % 2 == 0:\r\n k.append(\"0\")\r\n else:\r\n k.append(\"1\")\r\nx1 = k.count(\"0\")\r\nif x1 == 1:\r\n print(k.index(\"0\")+1)\r\nelse:\r\n print(k.index(\"1\")+1)", "'''\nAuthor : knight_byte\nFile : A_IQ_test.py\nCreated on : 2021-04-15 10:58:45\n'''\n\n\ndef main():\n n = int(input())\n arr = list(map(int, input().split()))\n o = [-1, 0]\n e = [-1, 0]\n for i in range(n):\n if arr[i] % 2 == 0:\n e[0] = i+1\n e[1] += 1\n else:\n o[0] = i+1\n o[1] += 1\n if e[1] > o[1]:\n print(o[0])\n else:\n print(e[0])\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = y = 0\r\nfor i in range(n):\r\n\tif a[i]%2:\r\n\t\tif x and y:\r\n\t\t\tprint(y)\r\n\t\t\tbreak\r\n\t\tx = i+1\r\n\telse:\r\n\t\tif x and y:\r\n\t\t\tprint(x)\r\n\t\t\tbreak\r\n\t\ty = i+1\r\nif x == n or y == n:\r\n\tprint(n)", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\ninde=0\r\nindo=0\r\nfor i in range(n):\r\n if lis[i]&1:\r\n indo=i\r\n odd+=1\r\n else:\r\n inde=i\r\n even+=1\r\nif even==1:\r\n print(inde+1)\r\nelse:\r\n print(indo+1)", "n=int(input())\r\nl=[]\r\na=[int(i) for i in input().split()]\r\nfor i in range(0,n):\r\n l.append(int(a[i]%2))\r\nl.sort()\r\nb=1-int(l[1])\r\nfor j in range(0,n):\r\n if int(a[j])%2==b:\r\n print(j+1)\r\n exit(0)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\neven = list(filter(lambda x: x % 2 == 0, numbers))\r\nodd = list(filter(lambda y: y % 2 != 0, numbers))\r\nif len(even) > len(odd):\r\n print(numbers.index(odd[0]) + 1)\r\nelse:\r\n print(numbers.index(even[0]) + 1)\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().strip().split()]\r\nle=[]\r\nlo=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n le.append(i)\r\n else:\r\n lo.append(i)\r\n\r\nif len(le)==1:\r\n print (le[0]+1)\r\nelse:\r\n print (lo[0]+1)", "n = int(input())\r\na = []*n\r\na = list(map(int,input().split()))\r\nl1 = 0\r\nl2 = 0\r\nfor i in range(3):\r\n if a[i] % 2 == 0:\r\n l1 += 1\r\n else:\r\n l2 += 1\r\nif l1 > l2:\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n print(i+1)\r\n pass\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n pass\r\n", "n=int(input())\r\nll=list(map(lambda x:x&1,map(int,input().split())))\r\nprint(ll.index(1)+1)if ll.count(1)==1 else print(ll.index(0)+1)\r\n", "leneven = 0\nlenodd = 0\nn = int(input())\nnumlist = input().split()\n\nfor x in range(0,n):\n numlist[x] = int(numlist[x])\n \n if(numlist[x]%2 == 0):\n leneven = leneven + 1\n if (numlist[x]%2 != 0):\n lenodd = lenodd + 1\n \n \n \n \nif(leneven == 1):\n for x in range(0,n):\n if(numlist[x]%2 == 0):\n print((x+1))\n \nif(lenodd == 1):\n for x in range(0,n):\n if(numlist[x]%2 != 0):\n print((x+1))\n \n \t\t \t\t \t\t\t \t\t \t\t \t \t \t\t", "n=int(input())\nq=list(map(int,input().split()))\n\neve,eve_indx,neg,neg_indx=0,0,0,0\n\nfor i in range(n):\n x=q[i]%2\n if x==0:\n eve +=1\n eve_indx=i\n else:\n neg +=1\n neg_indx=i\n\nif eve==1:\n print(eve_indx+1)\nelse:\n print(neg_indx+1)", "a=int(input())\r\nb=input().split()\r\nfor i in range(a):\r\n\tb[i]=int(b[i])\r\ni=0\r\noddc=0\r\nevenc=0\r\nodd=0\r\neven=0\r\nwhile i<a:\r\n\tif b[i]/2==int(b[i]/2):\r\n\t\toddc=oddc+1\r\n\t\todd=i+1\r\n\telse:\r\n\t\tevenc=evenc+1\r\n\t\teven=i+1\r\n\ti=i+1\r\nif oddc==1:\r\n\tprint(odd)\r\nif evenc==1:\r\n\tprint(even)\r\n", "n = int(input())\nparity = [int(x) % 2 for x in input().split()]\nsum = 0\nfor i in parity:\n sum += i\nif sum == 1:\n for i in range(len(parity)):\n if parity[i] == 1:\n print(i + 1)\nelif sum != 1:\n for i in range(len(parity)):\n if parity[i] == 0:\n print(i + 1)\n\n \t\t\t\t\t\t \t\t \t\t\t\t \t \t \t \t \t", "n = int(input())\r\nl = list(map(int,input().split()))\r\no,e = 0,0\r\nfor i in range(len(l)):\r\n\tif l[i]%2==0:\r\n\t\teven = i\r\n\t\te+=1\r\n\telse:\r\n\t\todd = i\r\n\t\to+=1\r\nif e==1:\r\n\tprint(even+1)\r\nelse:\r\n\tprint(odd+1)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = {'o':0,'e':0}\r\nfor i in a:\r\n if i%2 == 0:\r\n d['e'] += 1\r\n else:\r\n d['o'] += 1\r\nif d['e']>d['o']:\r\n for i in range(len(a)):\r\n if a[i]%2 != 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]%2 == 0:\r\n print(i+1)\r\n break", "n = int(input())\r\ns = list(map(int,input().split()))\r\ntotal = sum(x%2 for x in s)\r\nfor i in range(0,n):\r\n if ((total>1 and s[i]%2==0) or (total<=1 and s[i]%2==1)):\r\n print(i+1);break ", "def p(x):\n return int(x)%2\ninput();*l,=map(p,input().split())\nprint((l.index(0)if sum(l)-1 else l.index(1))+1)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\na=[]\r\nb=[]\r\nfor i in l:\r\n if i%2==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)==1:\r\n print(l.index(a[0])+1)\r\nelse:\r\n print(l.index(b[0])+1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ne = []\r\n\r\nfor i, num in enumerate(l):\r\n e.append(\"p\") if num % 2 == 0 else e.append(\"i\")\r\n\r\nprint(e.index(\"i\")+1) if e.count(\"p\") > e.count(\"i\") else print(e.index(\"p\")+1)\r\n\r\n\r\n", "n = int(input())\r\nnumbers = [int(x)for x in input().split()]\r\n \r\ndef find(rest):\r\n for i in range(n):\r\n if numbers[i]%2 != rest:\r\n k = i\r\n return k \r\n\r\n\r\nif numbers[1]%2 == numbers[0]%2 :\r\n k = find(numbers[0]%2)\r\nelif numbers[2]%2 == numbers[0]%2:\r\n k = 1\r\nelse:\r\n k = 0\r\n \r\n \r\nprint(k+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\neven,odd=[],[]\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\nif(len(even)==1):\r\n print(even[0])\r\nelif(len(odd)==1):\r\n print(odd[0])", "n=int(input())\na=list(map(int,input().split()))\nb=1-(sum(a[i]%2 for i in range(n))-1)/(n-2)\nfor i in range(n):\n\tif a[i]%2==b:\n\t\tprint(i+1)\n\t\tbreak", "n=int(input())\r\nl=[]\r\nl=list(map(int, input().split()))\r\n\r\ndef evenness(l):\r\n count=0\r\n sum=0\r\n for i in range(n):\r\n if l[i]%2==0:\r\n count+=1\r\n else:\r\n sum+=1\r\n\r\n if count==1:\r\n for m in range(n):\r\n if l[m]%2==0:\r\n return m+1\r\n if sum==1:\r\n for m in range(n):\r\n if l[m]%2!=0:\r\n return m+1\r\n\r\nprint(evenness(l))\r\n\r\n\r\n\r\n\r\n\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nc = 0\r\nd = 0\r\nx = 0\r\nfor i in range(a):\r\n if (b[i] % 2 == 0):\r\n c += 1\r\n else :\r\n d += 1\r\n\r\nif (c > d) :\r\n for i in range(a):\r\n x += 1\r\n if (b[i] % 2 != 0) :\r\n print(x)\r\n \r\nif (d > c) :\r\n for i in range(a):\r\n x += 1\r\n if (b[i] % 2 == 0) :\r\n print(x)", "n = input()\ninp = list(map(int, input().split()))\n\nnums = [[], []]\n\nfor i, x in enumerate(inp, 1):\n\tnums[x%2].append(i)\n\nprint(nums[0][0]) if len(nums[0])==1 else print(nums[1][0])\n\t\t\t \t\t\t \t\t \t\t\t\t \t \t\t\t\t\t\t \t \t", "n = int(input())\r\nl = list(map(int, input().split()))\r\ne = 0\r\no = 0\r\nfor i in range(3):\r\n if(l[i]%2 ==0):\r\n e = e+1\r\n else:\r\n o = o+1\r\nif(e>o):\r\n for i in l:\r\n if(i %2 != 0):\r\n print(l.index(i)+1)\r\nelse:\r\n for i in l:\r\n if(i %2 == 0):\r\n print(l.index(i)+1)\r\n \r\n \r\n", "n = int( input() )\r\nm = list( map( int,input().split() ) )\r\nc=0\r\nx = [i%2 for i in m]\r\n#print (x)\r\n\r\nif x.count(0) == 1:\r\n print (x.index(0)+1)\r\nelse:\r\n print(x.index(1)+1)", "def Game(n,list1):\r\n ce,co=0,0\r\n for i in list1:\r\n if i%2==0:\r\n ce+=1\r\n else:\r\n co+=1\r\n if ce==1:\r\n for i in range(len(list1)):\r\n if list1[i]%2==0:\r\n return i+1\r\n elif co==1:\r\n for i in range(len(list1)):\r\n if list1[i]%2!=0:\r\n return i+1\r\nn=int(input())\r\ntext1=input().split()\r\nlist1=[int(i) for i in text1]\r\nval=Game(n,list1)\r\nprint(val)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n pe=i\r\n e+=1\r\n else:\r\n o+=1\r\n po=i\r\nif e==1:\r\n print(pe+1)\r\nelif o==1:\r\n print(po+1)", "n = int(input())\r\nchet = 0\r\nnechet = 0\r\nch_i = 1\r\nnech_i = 1\r\nA = []\r\nfor a in input().split():\r\n A.append(int(a))\r\nfor i in range(n):\r\n if A[i] % 2 == 0:\r\n chet += 1\r\n ch_i += i\r\n else:\r\n nechet += 1\r\n nech_i += i\r\nif chet == 1:\r\n print(ch_i)\r\nelse:\r\n print(nech_i)", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\ne=[]\r\no=[]\r\nfor i in a:\r\n if i%2==0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif len(e)<len(o):\r\n print(a.index(e[-1])+1)\r\nelse:\r\n print(a.index(o[-1])+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nt=1\r\ncount=0\r\nfor i in range(n):\r\n c=c+[a[i]%2]\r\n if sum(c)>1:\r\n t=0\r\nprint(c.index(t)+1) \r\n", "x=int(input())\r\ns=[int(n)%2 for n in input().split()]\r\nif s.count(1)>s.count(0):\r\n\tprint(s.index(0)+1)\r\nelse:\r\n\tprint(s.index(1)+1)\r\n", "n = int(input())\r\n\r\nlst = [int(num) for num in input().split()]\r\nparity_lst = [n%2 for n in lst]\r\n\r\nif parity_lst.count(0) == 1:\r\n print(parity_lst.index(0) + 1)\r\nelse:\r\n print(parity_lst.index(1) + 1)\r\n", "num=int(input())\r\nnumbers=list(map(int,input().split(' ')))\r\n\r\nodd_count=0\r\nevent_count=0\r\n\r\nodd_index=-1\r\nevent_index=-1\r\n\r\nfor number in range(num):\r\n if numbers[number]%2==0:\r\n event_count+=1\r\n event_index=number\r\n else:\r\n odd_count+=1\r\n odd_index=number\r\n\r\n\r\nif event_count>odd_count:\r\n print(odd_index+1)\r\nelse:\r\n print(event_index+1)\r\n", "n = int(input())\r\nnumbers = input().split()\r\nevenness = [int(i) % 2 for i in numbers]\r\nif sum(evenness) == 1:\r\n print(evenness.index(1) + 1)\r\nelse:\r\n print(evenness.index(0) + 1)", "n = input()\r\na = [int(i)%2 for i in input().split()]\r\nif sum(a) == 1:\r\n print(1+a.index(1))\r\nelse:\r\n print(1+a.index(0))", "\r\n\r\ndef sol():\r\n a=int(input())\r\n l=list(map(int,input().split(\" \")))\r\n nov=0\r\n nev=0\r\n iov=0\r\n iev=0\r\n for i in range(a) :\r\n if l[i]%2!=0:\r\n nov+=1\r\n iov=(i+1)\r\n else:\r\n nev+=1\r\n iev=(i+1)\r\n if nov ==1 :\r\n print(iov)\r\n elif nev==1:\r\n print(iev)\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\nsol()\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "def inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\nn = inp()\r\nnumlist = inlt()\r\n\r\n \r\ndef are_even(nums): # returns True of 2 of first three are even\r\n if ((nums[0]%2 == 0) and (nums[1]%2 == 0)) or ((nums[0]%2 == 0) and (nums[2]%2 == 0)) or ((nums[1]%2 == 0) and (nums[2]%2 == 0)):\r\n return True\r\n return False\r\n\r\ndef solve(nums):\r\n if are_even(nums): \r\n def find_odd(i):\r\n if (nums[i]%2 == 1):\r\n return i + 1\r\n return find_odd(i + 1)\r\n return find_odd(0)\r\n def find_even(i):\r\n if (nums[i]%2 == 0):\r\n return i + 1\r\n return find_even(i + 1)\r\n return find_even(0)\r\n \r\nprint(solve(numlist)) \r\n\r\n", "null = int(input())\r\narr = [input().split() for i in range(1)][0]\r\ncloud_1 = []\r\ncloud_0 = []\r\nfor i in range(len(arr)):\r\n if int(arr[i]) % 2 == 0:\r\n cloud_1.append(i+1)\r\n else:\r\n cloud_0.append(i+1)\r\nprint(cloud_1[0] if len(cloud_1) == 1 else cloud_0[0])", "n=int(input())\npar,impar=0,0\npares=[]\nimpares=[]\nodd,even=False,False\nnum=input().split()\nfor i in range (len(num)):\n num[i]=int(num[i])\ndicio=dict()\nfor i in range(1,n+1):\n dicio[num[i-1]]=i\nfor i in range(n):\n if num[i]%2==0:\n par+=1\n pares.append(num[i])\n else:\n impar+=1\n impares.append(num[i])\nif impar>=2:\n odd=True\nif par>=2:\n even=True\nif even==True:\n print(dicio[impares[0]])\nif odd==True:\n print(dicio[pares[0]])\n", "n = int(input())\r\n# nums = list(map(lambda x: int(x) % 2, input().split()))\r\n# print(nums.index(1 if sum(nums) == 1 else 0) + 1)\r\nprint(\r\n (nums := list(map(lambda x: int(x) % 2, input().split()))).index(\r\n 1 if sum(nums) == 1 else 0\r\n )\r\n + 1\r\n)\r\n", "n = int(input())\r\ns = input().split()\r\ns = [int(x) for x in s]\r\nt = b = 0\r\nfor i in range(n):\r\n if s[i]%2 == 0:\r\n t += 1\r\n elif s[i]%2 == 1:\r\n b += 1\r\nif b>= t:\r\n for p in range(n):\r\n if s[p]%2 == 0:\r\n print(p+1)\r\nelse:\r\n for p in range(n):\r\n if s[p]%2 == 1:\r\n print(p+1)", "n=int(input())\r\nt=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in t:\r\n if i%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\nif(e>o):\r\n for i in t:\r\n if i%2!=0:\r\n x=t.index(i)\r\nelse:\r\n for i in t:\r\n if i%2==0:\r\n x=t.index(i)\r\nprint(x+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk1=0\r\nk2=0\r\nfor i in a:\r\n if i%2!=0:\r\n k1+=1\r\n else:\r\n k2+=1\r\nif k1>k2:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n print(i+1)\r\n break\r\n\r\n \r\n \r\n \r\n", "amount=int(input())\r\nlist=input().split()\r\nnum=0\r\nfor i in range(amount-1):\r\n if (i>0 and i<(amount-1)) and ((int(list[i])+int(list[i-1]))%2 == 1 and (int(list[i])+int(list[i+1]))%2 == 1):\r\n num+=i+1\r\n print(i+1)\r\nif num == 0:\r\n if (int(list[0])+int(list[1]))%2 == 1:\r\n print(1) \r\n else:\r\n print(amount)", "x=eval(input())\r\ny=list(map(int,input().split()))\r\ni=0\r\nc1=0\r\nc2=0\r\nwhile(i<x):\r\n if(y[i]%2==0):\r\n c1+=1\r\n m=i+1\r\n else:\r\n c2+=1\r\n n=i+1\r\n i+=1\r\nif(c1>c2):\r\n print(n)\r\nelse:\r\n print(m)\r\n\r\n", "n = int(input())\r\nstring = input()\r\nnumbers = string.split(\" \")\r\nremainder = []\r\nfor x in numbers:\r\n remainder.append(int(x) % 2)\r\nif remainder.count(0) > remainder.count(1):\r\n odd = remainder.index(1)\r\nelse:\r\n odd = remainder.index(0)\r\nprint(odd + 1)\r\n", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nif num[0]%2==num[1]%2:\r\n for item in num:\r\n if item%2!=num[0]%2:\r\n print(num.index(item)+1)\r\n break\r\nelse:\r\n print(2) if num[0]%2==num[2]%2 else print(1)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nco = 0\r\nce = 0\r\ni = 0\r\nj = 0\r\nfor each in x:\r\n if each % 2 != 0:\r\n co += 1\r\n i = x.index(each)\r\n else:\r\n ce += 1\r\n j = x.index(each)\r\nif co == 1:\r\n print(i+1)\r\nelif ce == 1:\r\n print(j+1)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nd=0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n c=c+1\r\n s=i\r\n else:\r\n d=d+1\r\n e=i\r\nif c==1:\r\n print(s+1)\r\nif d==1:\r\n print(e+1)", "n,b=[int(input()),0]\r\na=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n if i==0:\r\n pass\r\n elif i==1 and a[i]%2!=a[0]%2:\r\n if a[i+1]%2!=a[0]%2:\r\n b=0\r\n else:\r\n b=i\r\n break\r\n elif a[i]%2!=a[0]%2:\r\n b=i\r\n break\r\n else:\r\n pass\r\nprint(b+1)\r\n\r\n", "input()\r\nnumbers = list(map(int,input().split()))\r\nasds = {'even':[], 'odd':[]}\r\n\r\nfor i in range(len(numbers)):\r\n if numbers[i] % 2 == 0:\r\n asds['even'].append(i+1)\r\n else:\r\n asds['odd'].append(i+1)\r\n\r\nif len(asds['even']) == 1:\r\n print(asds['even'][0])\r\nelse:\r\n print(asds['odd'][0])", "n = int(input())\r\na = [int(num) for num in input().split(\" \", n-1)]\r\nchet = 0\r\nnech = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n chet += 1\r\n if a[i] % 2 != 0:\r\n nech += 1\r\nif chet == 1:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 != 0:\r\n print(i+1)\r\n break", "n=int(input())\r\neven=0\r\nodd=0\r\n\r\nnums=list(map(int,input().split()))\r\nfor i in nums:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even==1:\r\n for j in nums:\r\n if j%2==0:\r\n print(nums.index(j)+1)\r\nelif odd==1:\r\n for x in nums:\r\n if x%2==1:\r\n print(nums.index(x)+1)\r\n", "n=int(input())\r\nb=list(input().split())\r\njima=[]\r\nouma=[]\r\nfor i in range(0,n):\r\n if int(b[i])%2==0:\r\n ouma.append(i+1)\r\n else:\r\n jima.append(i+1)\r\nif len(jima)>len(ouma):\r\n print(ouma[0])\r\nelse:\r\n print(jima[0])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(a)):\r\n if a[i] % 2==0:f=i;s=s+1\r\n else:d=i\r\nif s==1:print(f+1)\r\nelse:print(d+1)\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nodd=sum(x & 1 for x in arr)\r\nfor i,v in enumerate(arr):\r\n if(odd!=1 and ~v & 1) or (odd==1 and v & 1):\r\n print(i+1)\r\n exit()", "n = int(input())\r\nl = [int(x)%2 for x in input().split()]\r\nprint(l.index(sum(l)==1)+1)", "n=int(input())\r\nk=[int(x)%2 for x in input().split()]\r\nfor i in k:\r\n if k.count(i)==1:\r\n print(k.index(i)+1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ne = 0\r\no = 0\r\nfor i in a:\r\n\tif(i % 2 == 0):\r\n\t\te += 1\r\n\telse:\r\n\t\to += 1\r\nif e == 1:\r\n\tfor i in range(len(a)):\r\n\t\tif(a[i]%2 == 0):\r\n\t\t\tprint(i + 1)\r\nelse:\r\n\tfor i in range(len(a)):\r\n\t\tif(a[i]%2 == 1):\r\n\t\t\tprint(i + 1)\r\n\t\r\n\t", "n = int(input())\r\ns = input()\r\n \r\nones = 0\r\nzeros = 0\r\n \r\nfinal = -1\r\n \r\nfor i in range(3):\r\n if int(s.split()[i]) % 2 == 0:\r\n zeros += 1\r\n else:\r\n ones +=1\r\n \r\nif ones > zeros:\r\n final = 0\r\nelse:\r\n final = 1\r\n \r\nfor i in range(n):\r\n if int(s.split()[i]) % 2 == final:\r\n print(i+1)\r\n", "lis_2 = []\r\nn = int(input())\r\nlis = list(map(int, input().split()))\r\nfor i in lis:\r\n if i%2==0:\r\n lis_2.append(1)\r\n else:\r\n lis_2.append(0)\r\nif lis_2.count(1) > lis_2.count(0):\r\n print(lis_2.index(0)+1)\r\nelse:\r\n print(lis_2.index(1)+1)\r\n", "n=int(input())\r\nline=list(map(int,input().split()))\r\nfor i in range(n):\r\n line[i]=line[i]%2\r\nif sum(line)==1:\r\n print(line.index(1)+1)\r\nelse:\r\n print(line.index(0)+1)", "n = int(input())\r\ns, z = 0, 0\r\nm = list(map(int, input().split()))\r\nfor i in m:\r\n if i % 2 == 0:\r\n s += 1\r\n else:\r\n z += 1\r\nif s > z:\r\n for i in range(len(m)):\r\n if m[i] % 2 != 0:\r\n print(m.index(m[i]) + 1)\r\nelif z > s:\r\n for i in range(len(m)):\r\n if m[i] % 2 == 0:\r\n print(m.index(m[i]) + 1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nk1=0\r\nk2=0\r\nk=0\r\nfor i in range(n):\r\n\tif s[i] % 2 == 0:\r\n\t\tk2 += 1\r\n\t\tk += 1\r\n\t\tpos_2 = i\r\n\telse:\r\n\t\tk1 += 1\r\n\t\tk += 1\r\n\t\tpos_1 = i\r\nif k1 > k2:\r\n\tprint(pos_2+1)\r\nelse:\r\n\tprint(pos_1+1)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nlst=[int(x)%2 for x in input().split()]\r\nif lst[0]+lst[1]+lst[2]>=2:\r\n print(lst.index(0)+1)\r\nelse:\r\n print(lst.index(1)+1)", "input()\r\na = [int(i) % 2 for i in input().split()]\r\nprint(a.index(0)+1) if a.count(0) == 1 else print(a.index(1)+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nodd_=0;even=0\r\nfor i in range(n):\r\n if a[i]%2==0:even+=1\r\n else:odd_+=1\r\nz=0\r\nif odd_==1:z=1\r\nfor i in range(n):\r\n if a[i]%2==z:\r\n print(i+1)\r\n break", "n = int(input())\r\na = []\r\nc = []\r\nd = []\r\n\r\na = list(int(i) for i in input().strip().split())[:n]\r\n\r\nk = 0\r\nl = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n k = k + 1\r\n c.append(i+1)\r\n else:\r\n l = l + 1\r\n d.append(i+1)\r\n\r\nif(k > l):\r\n print(d[0])\r\nelse:\r\n print(c[0])\r\n", "q=int(input())\r\nw=[int(e)for e in input().split()]\r\n\r\na=0\r\nb=0\r\n\r\n\r\n\r\nfor i in w:\r\n if i%2==0:\r\n a+=1\r\n else:\r\n b+=1\r\nif a>=2:\r\n for i in w:\r\n if i%2==1:\r\n print(w.index(i)+1)\r\nif b>=2:\r\n for i in w:\r\n if i%2==0:\r\n print(w.index(i)+1)", "n=int(input())\r\narr=list(map(int,input().split(' ')))\r\ne=0\r\no=0\r\nfor i in range(0,n):\r\n if(arr[i]%2==0):\r\n e=e+1\r\n else:\r\n o=o+1\r\nif(e==1):\r\n for i in range(0,n):\r\n if(arr[i]%2==0):\r\n print(i+1)\r\nelif(o==1):\r\n for i in range(0,n):\r\n if(arr[i]%2==1):\r\n print(i+1)\r\n \r\n", "n=int(input())\r\ni,a,b=0,0,0\r\nnum=[x for x in map(int,input().split())]\r\nfor k in range(3):\r\n if num[k] % 2 == 0:\r\n a += 1\r\n else:\r\n b += 1\r\nif a >= 2:\r\n while i < n:\r\n if num[i] % 2 == 0:\r\n i += 1\r\n continue\r\n else:\r\n print(i+1)\r\n break\r\nif b >= 2:\r\n while i < n:\r\n if num[i] % 2 == 1:\r\n i += 1\r\n continue\r\n else:\r\n print(i+1)\r\n break", "#!/usr/bin/env python\nimport math,re\nfrom sys import exit,stdin,stdout\nfrom collections import Counter,defaultdict,deque\nfrom functools import reduce\ninput = stdin.readline\ndef inp():\n return(int(input().rstrip()))\ndef inplst(nospaces=False):\n if nospaces:\n return list(map(int,list(input().rstrip())))\n return(list(map(int,input().split())))\ndef inpstr():\n return(input().rstrip())\ndef inpvar():\n return(map(int,input().split()))\ndef out(char,joinChar=\" \"):\n if isinstance(char,tuple) or isinstance(char,list):\n char = joinChar.join(map(str,char))\n stdout.write(str(char)+\"\\n\")\n return\nDATAPATH = \"~/datasets/\"\n\n## ---- Main ---- ##\ninp()\nnums = list(map(lambda x:x%2, inplst()))\nout(nums.index(sum(nums)==1)+1)", "n = int(input())\r\niq = input().split(\" \")\r\n\r\none = int(iq[0])%2\r\ntwo = int(iq[1])%2\r\nif one != two:\r\n\tif int(iq[2])%2 != one:\r\n\t\tprint(1)\r\n\telse:\r\n\t\tprint(2)\r\nelse:\r\n\tfor i in range(2,n):\r\n\t\tif int(iq[i])%2 != one :\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\t\t\t\r\n\t", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\ne = 0\r\no = 0\r\nfor i in li:\r\n if i % 2 == 0:\r\n e += 1\r\n x = li.index(i) + 1\r\n else :\r\n o += 1\r\n y = li.index(i) + 1\r\nif e == 1:\r\n print(x)\r\nelse :\r\n print(y)", "b = int(input())\r\na = list(map(int,input().split()))\r\n\r\n\r\nk = 0\r\nq = 0\r\nf = 0\r\nh = 0\r\n\r\nfor j in range(len(a)):\r\n if a[j] % 2 == 0:\r\n k +=1\r\n f = a[j]\r\n \r\n \r\n else:\r\n q+=1\r\n h = a[j]\r\nif k == 1:\r\n print(a.index(f)+1)\r\nelif q == 1:\r\n print(a.index(h)+1)\r\n \r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nfor i in range(n):\r\n s[i]=s[i]%2\r\nif s.count(1)==1:\r\n b=s.index(1)+1\r\nelse:\r\n b=s.index(0)+1\r\nprint(b)", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\no,e,j,k=0,0,0,0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n e+=1\r\n j=i+1\r\n else:\r\n o+=1\r\n k=i+1\r\n if(e!=0 and o!=0 and(e>1 or o>1)):\r\n if(e>1):\r\n print(k)\r\n else:\r\n print(j)\r\n break", "n = input()\r\nnums = list(map(int,input().split()))\r\nind = False\r\neven,odd = [],[]\r\n\r\nfor i,num in enumerate(nums):\r\n if num%2 ==0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\n \r\nif len(odd) == 1:\r\n print(odd[0])\r\nelse:\r\n print(even[0])\r\n \r\n \r\n \r\n ", "def solve(n, a, pari):\n if pari:\n for i in range(3, n):\n if ((a[i]+a[i-1])%2)!=0:\n if (a[i]%2)==0:\n return i\n else:\n return i+1\n else:\n for i in range(3, n):\n if ((a[i]+a[i-1])%2)!=0:\n if (a[i]%2)!=0:\n return i\n else:\n return i+1\n \n\n\nn = int(input())\na = list(map(int, input().split()))\n\nif (n == 3):\n if ((a[0]+a[1])%2)==0:\n print(3)\n elif ((a[1]+a[2])%2)==0:\n print(1)\n else:\n print(2)\nelif (a[0]%2)==0 and (a[1]%2)==0:\n print(solve(n, a, True))\nelif (a[0]%2)!=0 and (a[1]%2)!=0:\n print(solve(n, a, False))\nelif (a[1]%2)==0 and (a[2]%2)==0:\n print(1)\nelif (a[1]%2)==0 and (a[2]%2)!=0:\n print(2)\nelif (a[1]%2)!=0 and (a[2]%2)!=0:\n print(1)\nelif (a[1]%2)!=0 and (a[2]%2)==0:\n print(2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 18 09:46:27 2019\r\n\r\n@author: LV\r\n\"\"\"\r\n\r\ninput()\r\nd = [int(x) % 2 for x in input().split()]\r\nprint(d.index(sum(d) == 1) + 1)", "input();a=list(map(lambda x:x%2,map(int,input().split())))\r\nprint(a.index(0)+1if sum(a)>=2else a.index(1)+1)", "def solve(n, arr):\r\n even, odd = [], []\r\n for i in range(n):\r\n if arr[i] % 2 == 0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\n \r\n if len(even) == 1:\r\n print(even[0])\r\n else:\r\n print(odd[0])\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nsolve(n, arr)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\ncount=0\r\nif l[0]%2==0:count=count+1\r\nif l[1]%2==0:count=count+1\r\nif l[2]%2==0:count=count+1\r\ncount1=3-count\r\nif count1>count:\r\n for i in range(len(l)):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(l)):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n break\r\n ", "n=int(input())\r\ns=list(map(int,input().split()))\r\nnech=-1\r\nch=-1\r\nfn=-1\r\nfc=-1\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n if ch==-1:\r\n ch=s[i]\r\n fc=i\r\n else:\r\n ch=0\r\n else:\r\n if nech==-1:\r\n nech=s[i]\r\n fn=i\r\n else:\r\n nech=0\r\nif ch==0:\r\n print(fn+1)\r\nelse:\r\n print(fc+1)\r\n \r\n \r\n", "a=input();b=[]\r\nfor i in map(int,input().split()):b+=[i%2]\r\nprint(1+(b.index(b.count(0)>b.count(1))))", "z=int(input())\r\na=list(map(int,input().split()))\r\nx=sum(a)%2\r\nt=[]\r\nfor i in range(len(a)):\r\n t+=[a[i]%2]\r\nif t.count(1)>t.count(0):\r\n print(t.index(0)+1)\r\nelse:\r\n print(t.index(1)+1)\r\n", "t=int(input())\r\na=list(map(int,input().split(maxsplit=t-1)))\r\nev,od=[],[]\r\nfor i in range(t):\r\n if a[i]%2==0:\r\n ev.append(i+1)\r\n else:\r\n od.append(i+1)\r\nif len(ev)==1:\r\n print(str(ev)[1:-1])\r\nelse:\r\n print(str(od)[1:-1])", "n=input()\r\nl=[int(i) for i in input().split()]\r\nfor i in range(len(l)-1):\r\n if i<len(l)-2:\r\n if (l[i]%2) != (l[i+1]%2) and (l[i+2]%2) != (l[i+1]%2):\r\n m=i+2\r\n break\r\n elif (l[i]%2) != (l[i+1]%2) and (l[i+2]%2) == (l[i+1]%2):\r\n m=1\r\n break\r\n else:\r\n m=len(l)\r\nprint(m)", "n=int(input())\r\na=[int(x)for x in input().split()]\r\nji=0\r\nou=0\r\nfor i in range(3):\r\n if a[i]%2==0:\r\n ou+=1\r\n else:\r\n ji+=1\r\nif ji>ou:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n print(i+1)\r\n break", "x = input()\r\ny = input().split(' ')\r\neven = 0\r\nodd = 0\r\n\r\nfor i in range(0, 3):\r\n if int(y[i]) % 2 == 0:\r\n even += 1\r\n elif int(y[i]) % 2 != 0:\r\n odd += 1\r\nif even > odd:\r\n for a in y:\r\n if int(a) % 2 != 0:\r\n print(int(y.index(a))+1)\r\nelif odd > even:\r\n for a in y:\r\n if int(a) % 2 == 0:\r\n print(int(y.index(a))+1) \r\n ", "n=int(input())\nx=input ()\na=x.split()\nb=[]\nc=[]\nfor i in range(0,len(a)):\n if(int(a[i])%2==0):\n b.append(i+1)\n else:\n c.append(i+1)\nif(len(c)==1):\n print (c[0])\nelif(len(b)==1):\n print (b[0])\n", "n=int(input())\r\nlist=list(map(int,input().split()))\r\neven=0\r\n\r\nfor i in range(3):\r\n if list[i]%2==0:\r\n even+=1\r\nif even<2:\r\n even=0\r\nelse:\r\n even=1\r\ntemp=0\r\nfor i in range(len(list)):\r\n if even==0:\r\n if list[i]%2==0:\r\n temp=i\r\n break\r\n elif even==1:\r\n if list[i]%2!=0:\r\n temp=i\r\n break\r\n\r\n\r\n\r\n\r\nprint(temp+1)\r\n", "import math\r\nimport random\r\nimport sys\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n x = a[i]%2\r\n y = a[(i+1)%n]%2\r\n z = a[(i+2)%n]%2\r\n if x!=y and x!=z:\r\n print(i+1)\r\n exit()", "# a = list(map(int, input().rstrip().split()))\r\nn = int(input())\r\na = list(map(int, input().rstrip().split()))\r\n\r\na = [x%2 for x in a]\r\nif a.index(1)==n-1-a[::-1].index(1):\r\n\tprint(a.index(1)+1)\r\nelse:\r\n\tprint(a.index(0)+1)\r\n", "n = int(input())\nlst = list(map(int,input().split()))\ncnt=0\nfor i in range(n):\n if lst[i]%2==0:\n cnt+=1\nif cnt==1:\n for i in range(n):\n if lst[i]%2==0:\n print(i+1)\n break\nelif cnt>1:\n for i in range(n):\n if lst[i]%2==1:\n print(i+1)\n break\n \t\t\t\t \t\t \t \t\t\t\t \t\t\t\t \t\t", "n = int(input())\r\n\r\nb = input().split()\r\na = []\r\nm = 0\r\n\r\neven = []\r\nodd = []\r\n\r\nfor i in range(n):\r\n a.append(int(b[i]))\r\n\r\nfor i in range(n):\r\n if (a[i]%2==0):\r\n even.append(a[i])\r\n else:\r\n odd.append(a[i])\r\n\r\nfor i in range(n):\r\n if (len(even)>len(odd)):\r\n if(odd[0]==a[i]):\r\n m = i+1\r\n if (len(even)<len(odd)):\r\n if(even[0]==a[i]):\r\n m = i+1\r\n\r\nprint (str(m))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nce=0\r\nco=0\r\nfor i in l:\r\n if i%2==0:\r\n ce+=1\r\n e=l.index(i)\r\n else:\r\n co+=1\r\n o=l.index(i)\r\nif ce<co:\r\n print(e+1)\r\nelse:\r\n print(o+1)\r\n ", "def main():\r\n n = int(input())\r\n nums = list(map(int, input().split()))\r\n result = 0\r\n odd_counter = 0\r\n odd_index = 0\r\n\r\n even_counter = 0\r\n even_index = 0\r\n for i in range(n):\r\n if nums[i]%2 == 0:\r\n even_index = i\r\n even_counter += 1\r\n else:\r\n odd_index = i\r\n odd_counter += 1\r\n if even_counter == 1: print(even_index+1)\r\n else: print(odd_index+1)\r\n \r\n \r\n\r\nmain()", "n = int(input())\r\nnum = input().split()\r\ngnp = 0\r\ngjl = 0\r\nfor i in range(n):\r\n if int(num[i]) % 2:\r\n if gjl < 2:\r\n gjl += 1\r\n iGjl = i + 1\r\n else:\r\n if gnp < 2:\r\n gnp += 1\r\n iGnp = i + 1\r\n if gnp == 2 and gjl == 1:\r\n print(iGjl)\r\n break\r\n elif gjl == 2 and gnp == 1:\r\n print(iGnp)\r\n break", "import sys\nfrom typing import List, Tuple\n\ndef split_by_evenness(n, nums: List[int]) -> Tuple[List[int], List[int]]:\n evens = []\n odds = []\n for i in range(n):\n if nums[i] % 2 == 0:\n evens.append(i+1)\n else:\n odds.append(i+1)\n\n return evens, odds\n\n\n\nif __name__ == '__main__':\n n = int(sys.stdin.readline())\n\n nums = list(map(int, sys.stdin.readline().split()))\n\n evens, odds = split_by_evenness(n, nums)\n\n if len(evens) == 1:\n print(evens[0])\n else:\n print(odds[0])\n\n", "x=int(input(\"\"))\r\nar=list(map(int, input().strip().split(' ')))\r\no=0\r\np=0\r\n\r\nz=[]\r\nfor i in range(0,len(ar)):\r\n for j in range(0,len(ar)):\r\n z.append((ar[i]-ar[j]))\r\n \r\n z.remove(0)\r\n \r\n \r\n for k in z:\r\n if(k%2==0):\r\n o=1\r\n else:\r\n p=1\r\n \r\n \r\n if(o==1 and p==1):\r\n z.clear()\r\n o=0\r\n p=0\r\n else:\r\n print(i+1)\r\n ", "n= int(input())\r\n\r\nnum =list(map(int, input().split(' ')))\r\n\r\nodd = 0\r\neven = 0\r\n\r\nfor i in num:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\nif even>odd:\r\n for i in num:\r\n if i%2!=0:\r\n print(num.index(i)+1)\r\n break\r\nelse:\r\n for i in num:\r\n if i%2==0 :\r\n print(num.index(i)+1)", "n=int(input())\r\ncount=0\r\nl=[int(x) for x in input().split()]\r\nfor i in range(n-2):\r\n if l[i]%2 != l[i+1]%2:\r\n if l[i]%2 != l[i+2]%2 :\r\n print(i+1)\r\n count=1\r\n break\r\n else:\r\n print(i+2)\r\n count=1\r\n break\r\nprint(n if count==0 else \"\")\r\n", "n,nums = int(input()), list(map(int, input().split(' ')))\r\nx,y,z = nums[0],nums[1],nums[2]\r\nmajority = \"ODD\"\r\nif x%2 == 0 and y%2==0 or y%2==0 and z%2==0 or x%2==0 and z%2==0 or x%2==0 and y%2==0 and z%2==0:\r\n majority = \"EVEN\"\r\n for ind, ele in enumerate(nums):\r\n if ele%2!=0:\r\n print(ind+1)\r\nelse:\r\n for ind, ele in enumerate(nums):\r\n if ele%2==0:\r\n print(ind+1)", "import math\r\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\n#a,b = map(int, input().strip().split(' '))\r\n#check 1st 3 no.s\r\nif lst[0]%2==lst[1]%2:\r\n k=lst[0]%2\r\nelif lst[0]%2==lst[2]%2:\r\n k=lst[0]%2\r\nelif lst[2]%2==lst[1]%2:\r\n k=lst[1]%2\r\nfor j in range(n):\r\n if lst[j]%2!=k:\r\n print(j+1)\r\n break", "n = int(input())\r\nl= list(map(int,input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n even+=1\r\n else:\r\n odd += 1\r\n \r\nif even == 1:\r\n for j in range(n):\r\n if l[j] % 2 == 0:\r\n print(j + 1)\r\n break\r\nif odd == 1:\r\n for k in range(n):\r\n if l[k] % 2 != 0:\r\n print(k + 1)\r\n break", "input()\r\n\r\nl = [ int(x) for x in input().split() ]\r\nlo, le = [], []\r\nco, ce = 0, 0\r\n\r\nfor i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n le.append(i)\r\n ce += 1\r\n else:\r\n lo.append(i)\r\n co += 1\r\n\r\nprint((lo[0] if co == 1 else le[0]) + 1)", "n = int(input())\na = [int(i) for i in input().split()]\nt = 0\n\nfor i in range(n):\n if a[i] % 2 == 0:\n t += 1\n\nif t == 1:\n for i in range(n):\n if a[i] % 2 == 0:\n print(i+1)\nelse:\n for i in range(n):\n if a[i] % 2 == 1:\n print(i+1)\n", "i = int(input())\r\nl = list(map(int,input().split()))\r\nc = []\r\nfor x in l:\r\n c.append(x%2)\r\nif c.count(1) == 1:\r\n print(c.index(1)+1)\r\nelse:\r\n print(c.index(0)+1)", "n=input()\nli=list(map(int,input().split()))\nindex_even=0\ne=0\nindex_odd=0\no=0\nfor i in range(int(n)):\n if li[i]%2==0:\n index_even+=1\n e=i+1\n else:\n index_odd+=1\n o=1+i\n\nif index_even>index_odd:\n print(o)\nelse:\n print(e)\n\t \t\t\t\t\t\t \t\t \t \t\t \t \t \t\t\t", "n=int(input())\r\ns=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\ni2=0\r\ni1=0\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n c2+=1\r\n i2=i+1\r\n else :\r\n c1+=1\r\n i1=i+1\r\nif c1>c2:\r\n print(i2)\r\nelse :\r\n print(i1)", "n=int(input())\r\nll=list(map(int,input().split()))\r\no,e=[],[]\r\nfor i in range(n):\r\n if ll[i]&1:\r\n o.append(i+1)\r\n else:\r\n e.append(i+1)\r\n if (len(e)==1 and len(o)==2) or (len(o)==1 and len(e)==2):\r\n break\r\nif len(e)==1:\r\n print(e[0])\r\nelse:\r\n print(o[0])\r\n\r\n", "\ndef solve(n,nums):\n a = []\n for i in range(0,3):\n a.append(nums[i]%2)\n cnt = 0\n for i in a:\n if i==0:\n cnt+=1\n if cnt>(3-cnt):\n for i in range(n):\n if nums[i]%2!=0:\n return i+1\n else:\n for i in range(n):\n if nums[i]%2==0:\n return i+1\n\n\n\nif __name__ == '__main__':\n t = 1\n while t:\n n = int(input())\n nums = list(map(int,input().split()))\n print(solve(n,nums))\n t -= 1\n", "length = int(input())\nar = list(map(int, input().split()))\nmain = 0 #even\n\nif ar[0] % 2 == ar[1] % 2:\n main = ar[0] % 2\nelse:\n main = ar[2] % 2\n\nfor i in range(length):\n if ar[i] % 2 != main:\n print(i + 1)\n break\n\n\n\n\n", "t=int(input())\r\na=[]\r\ne=[]\r\nf=[]\r\nb=input().split()\r\nfor i in b:\r\n if int(i)%2==0:\r\n e.append(b.index(i))\r\n else:\r\n f.append(b.index(i))\r\nif(len(e)==1):\r\n print(e[0]+1)\r\nelse:\r\n print(f[0]+1)", "n = int(input())\r\nl = list(map(int,input().strip().split()))\r\nc = 0\r\nk = 0\r\nfor i in l:\r\n if i%2==0:\r\n c = c+1\r\n else:\r\n k = k+1\r\n if c==2 or k==2:\r\n break\r\nif c==2:\r\n for i in l:\r\n if i%2!=0:\r\n print(l.index(i)+1)\r\n break\r\nelse:\r\n for i in l:\r\n if i%2==0:\r\n print(l.index(i)+1)\r\n break\r\n ", "# https://codeforces.com/problemset/problem/25/A\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\neven = odd = 0\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even += 1\r\n even_index = i\r\n else:\r\n odd += 1\r\n odd_index = i\r\n\r\nprint(even_index + 1 if even == 1 else odd_index + 1)", "n=int(input())\r\nS=list(map(int,input().split()))\r\nl=[x for x in S if x%2==0]\r\nif len(S)==len(l)+1:\r\n for i in range (n):\r\n if S[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range (n):\r\n if S[i]%2==0:\r\n print(i+1)\r\n\r\n \r\n\r\n\r\n", "n = input()\r\ns = [int(i) for i in input().split()]\r\nc = 0\r\nnc = 0\r\n\r\nfor i in s:\r\n if i % 2 == 0:\r\n c += 1\r\n else:\r\n nc += 1\r\n\r\nif c > nc:\r\n for i in s:\r\n if i % 2 != 0:\r\n print(s.index(i) + 1)\r\n break\r\n\r\nif c < nc:\r\n for i in s:\r\n if i % 2 == 0:\r\n print(s.index(i) + 1)\r\n break", "n=int(input())\r\nkk=input().split()\r\nj=0\r\no=0\r\nfor i in range(0,n):\r\n kk[i]=int(kk[i])\r\n if kk[i]%2==0:\r\n o=o+1\r\n else:\r\n j=j+1\r\nif j>o:\r\n for ddd in range(0,n):\r\n if kk[ddd]%2==0:\r\n print(ddd+1)\r\nelse:\r\n for ppp in range(0,n):\r\n if kk[ppp]%2!=0:\r\n print(ppp+1)\r\n", "n = int(input())\r\ncount = 0\r\nuncount = 0\r\ns = list(map(int, input().split()))\r\nfor i in range(len(s)):\r\n if s[i] % 2 == 0:\r\n count += 1\r\n f = i\r\n else:\r\n uncount += 1\r\n g = i\r\nif count > uncount:\r\n print(g + 1)\r\nelse:\r\n print(f + 1)", "n = int(input())\r\ns1 = input()\r\nlst = s1.split()\r\neven_flag = 0\r\nodd_flag = 0\r\neven_ind = 0\r\nodd_ind = 0\r\ni = 0\r\nwhile i < n:\r\n if int(lst[i]) %2 == 0:\r\n even_flag = even_flag + 1\r\n even_ind = i\r\n else:\r\n odd_flag = odd_flag + 1\r\n odd_ind = i\r\n if even_flag >= 2 and odd_flag == 1:\r\n print(odd_ind+1)\r\n break\r\n if odd_flag >= 2 and even_flag == 1:\r\n print(even_ind + 1)\r\n break\r\n i = i + 1\r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nch = []\r\nkl = []\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n ch.append(i+1)\r\n else:\r\n kl.append(i+1)\r\nif len(ch)> len(kl):\r\n print(*kl)\r\nelse:\r\n print(*ch)", "def find_different_number(n, numbers):\r\n even_count = 0\r\n odd_count = 0\r\n even_index = -1\r\n odd_index = -1\r\n\r\n for i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n even_index = i + 1\r\n else:\r\n odd_count += 1\r\n odd_index = i + 1\r\n\r\n if even_count == 1:\r\n return even_index\r\n else:\r\n return odd_index\r\n\r\n\r\n# Read input\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Find the index of the number that differs in evenness\r\nresult = find_different_number(n, numbers)\r\nprint(result)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor i in a:\r\n if i%2 == 0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif len(e)==1:\r\n print(a.index(e[0])+1)\r\nelif len(o)==1:\r\n print(a.index(o[0])+1)", "n=int(input(\"\"))\r\nL=list(map(int,input().split(\" \")))\r\ncont=0\r\ncont1=0\r\nj=1\r\nres=0\r\nfor k in L:\r\n if(k%2==0):\r\n cont+=1\r\n else:\r\n cont1+=1\r\nif(cont>cont1):\r\n res=1\r\nwhile(j<n+1):\r\n if((L[j-1])%2==res):\r\n print(j)\r\n break\r\n j+=1", "n=int(input())\r\na=[int(i)for i in input().split()]\r\nb=[]\r\nsum=0\r\nc=0\r\nfor i in range(0,n):\r\n sum+=a[i]%2\r\nif sum==1:\r\n c=1\r\nelse:\r\n c=0\r\nfor j in range(0,n):\r\n if a[j]%2==c:\r\n print(j+1)\r\n exit()", "n=int(input())\r\nnums=list(input().split())\r\ni=0\r\nj=0\r\nfor num in nums:\r\n if int(num)%2 == 1:\r\n i+=1\r\n spe1=num\r\n else:\r\n j+=1\r\n spe2=num\r\nif i==1:\r\n print(nums.index(spe1)+1)\r\nelse:\r\n print(nums.index(spe2)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e+=1\r\n t=i\r\n else:\r\n o+=1\r\n t1=i\r\nif o==1:\r\n print(t1+1)\r\nelse:\r\n print(t+1)", "n = int(input())\r\na = [int(s) % 2 for s in input().split(' ')]\r\nif a.count(0) == 1:\r\n print(a.index(0) + 1)\r\nelse:\r\n print(a.index(1) + 1)\r\n", "n=int(input())\r\nar=[int(i) for i in input().split()]\r\nc,b=0,0\r\nfor i in range(n):\r\n if ar[i]%2==0:\r\n c+=1\r\n x=i+1\r\n else:\r\n b+=1\r\n y=i+1\r\nif c==1:\r\n print(x)\r\nelif b==1:\r\n print(y)", "n = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\neven = []\r\nodd = []\r\n\r\nfor i in range(n):\r\n\tif arr[i] % 2 == 0:\r\n\t\teven.append(i+1)\r\n\telse:\r\n\t\todd.append(i+1)\r\n\r\nif len(even) > len(odd):\r\n\tprint(odd[0])\r\nelse:\r\n\tprint(even[0])", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\ncount1, count2 = 0, 0\r\nfor i in range(3):\r\n if li[i] % 2: count1 += 1\r\n else: count2 += 1\r\n\r\nhello = count1 > count2\r\n\r\nfor i in range(n):\r\n if li[i] % 2 != hello:\r\n print(i + 1, end='\\n')\r\n break\r\n", "n = int(input())\neven,odd = list(),list()\nX = list(map(int,input().split()))\nfor i in range(len(X)):\n x = X[i]\n if x%2==0:\n even.append([x,i])\n else:\n odd.append([x,i])\n\nif len(even)==1:\n print(even[0][1]+1)\nelse:\n print(odd[0][1]+1)\n", "n = int(input())\r\nsList = list(map(int,input().split()))\r\ncount_e = 0\r\ncount_o = 0\r\nfor i in range(n):\r\n if sList[i]%2 == 0:\r\n count_e += 1\r\n else:\r\n count_o += 1\r\nif count_e > count_o:\r\n for i in range(n):\r\n if sList[i]%2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if sList[i]%2 == 0:\r\n print(i+1)\r\n break", "\n\ndef solve(L):\n odd, even = 0, 0\n if L[0] % 2 == 0:\n even += 1\n else:\n odd += 1\n if L[1] % 2 == 0:\n even += 1\n else:\n odd += 1\n if L[2] % 2 == 0:\n even += 1\n else:\n odd += 1\n if even > odd:\n for i in range(len(L)):\n if L[i] % 2 == 1:\n return i+1\n else:\n for i in range(len(L)):\n if L[i] % 2 == 0:\n return i + 1\n\n\n\n\nn = int(input())\nL = list(map(int, input().split()))\nprint(solve(L))\n", "n = int(input())\r\nvalores = list(map(int, input().split()))\r\npares = impares = 0\r\nfor i in valores:\r\n if i % 2 == 0:\r\n pares += 1\r\n else:\r\n impares += 1\r\nif pares > impares:\r\n for i in range(n):\r\n if valores[i] % 2 != 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if valores[i] % 2 == 0:\r\n print(i+1)\r\n break", "def solve(n,num):\r\n odd=0\r\n even=0\r\n oi=ei=-1\r\n for i in range(n):\r\n if int(num[i])%2==0:\r\n even+=1\r\n ei=i+1\r\n else:\r\n odd+=1\r\n oi=i+1\r\n if even==1:\r\n return ei\r\n else:\r\n return oi\r\nn=int(input())\r\nnum=input().split()\r\nres=solve(n,num)\r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in l:\r\n if i%2==0:\r\n a.append(0)\r\n else:\r\n a.append(1)\r\nif a.count(0)>a.count(1):\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)", "n = int(input())\r\na = [int(each) % 2 for each in input().split()]\r\nb = a.count(0)\r\nif b == 1:\r\n print(a.index(0) + 1)\r\nelse:\r\n print(a.index(1) + 1)", "n= int(input())\r\na= list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n e.append(i+1)\r\n else:\r\n o.append(i+1)\r\nif len(e)==1:\r\n print(e[0])\r\nelse:\r\n print(o[0])\r\n ", "# Lang: pypy3.6-v7.1.0-win32\\pypy3.exe\r\n# Problem Name: IQTest\r\n# Problem Serial No: 25\r\n# Problem Type: A\r\n# Problem Url: https://codeforces.com/problemset/problem/25/A \r\n# Solution Generated at: 2019-05-09 00:29:44.615420 UTC\r\n\r\n_=input()\r\narr=list(map(int,input().split()))\r\n\r\ndef sol(arr):\r\n\r\n count_odd=0\r\n odd_idx=None;even_idx=None\r\n for k in range(len(arr)):\r\n if arr[k]%2!=0:\r\n count_odd+=1\r\n odd_idx=k\r\n else:\r\n even_idx=k\r\n if count_odd==1:print(odd_idx+1)\r\n else:print(even_idx+1)\r\n\r\n\r\n\r\n return\r\n\r\nsol(arr)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# Accepted", "n = int(input())\r\nlistA = list(map(int, input().split()))\r\nlistB = []\r\nfor i in listA:\r\n a = i % 2\r\n listB.append(a)\r\nm = listB.count(max(listB))\r\nv = listB.count(min(listB))\r\nif v == 1:\r\n print(listB.index(min(listB)) + 1)\r\nelse:\r\n print(listB.index(max(listB)) + 1)", "n = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nif l[0]%2==l[1]%2:\r\n evenness = 1 if l[0]%2 else 0\r\nelse:\r\n evenness = 1 if l[2]%2 else 0\r\nfor i in l:\r\n if i%2 != evenness:\r\n break;\r\nprint(l.index(i) + 1)", "t = int(input())\r\nlst = list(map(int, input().split()))\r\nevencount = 0\r\noddcount = 0\r\nfor i in range(t):\r\n if lst[i]%2==0:\r\n evencount+=1\r\n else:\r\n oddcount+=1\r\nif evencount == 1:\r\n for j in range(len(lst)):\r\n if lst[j]%2==0:\r\n print(j+1)\r\nelif oddcount == 1:\r\n for k in range(len(lst)):\r\n if lst[k]%2!=0:\r\n print(k+1)\r\n\r\n\r\n", "a = int(input())\r\ngenap = 0\r\nx = list(map(int , input().split()))\r\nfor z in range (3):\r\n if x[z] % 2 == 0:\r\n genap+= 1\r\n\r\nif genap < 2:\r\n for z in range (a):\r\n if x[z] % 2 == 0:\r\n print(z+1)\r\n break\r\nelse:\r\n for z in range (a):\r\n if x[z] % 2 != 0:\r\n print(z+1)\r\n break\r\n\r\n\r\n \r\n", "numbersLen = int(input())\r\nnumbers = input().split(\" \")\r\n\r\nevenCount = 0\r\noddCount = 0\r\ntoFind = \"N/A\"\r\ntoFindIndex = 0\r\n\r\nfor number in numbers:\r\n number = int(number)\r\n\r\n if(number%2 == 0):\r\n evenCount+=1\r\n else:\r\n oddCount+=1\r\n\r\nif(evenCount == 1):\r\n toFind = \"even\"\r\nelif(oddCount == 1):\r\n toFind = \"odd\"\r\n\r\nif(toFind == \"even\"):\r\n for index in range(len(numbers)):\r\n if(int(numbers[index])%2 == 0):\r\n toFindIndex = index\r\nelif(toFind == \"odd\"):\r\n for index in range(len(numbers)):\r\n if(int(numbers[index])%2 == 1):\r\n toFindIndex = index\r\n\r\n\r\nprint(toFindIndex+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = 0\r\nc = 0\r\nlista = []\r\nlista1 = []\r\n\r\n\r\nfor x in range(len(a)):\r\n if a[x] % 2 == 0:\r\n b = b + 1\r\n lista.append(x+1)\r\n else:\r\n c = c + 1\r\n lista1.append(x+1)\r\nif b == 1:\r\n print(lista[0])\r\nif c == 1:\r\n print(lista1[0])", "a = int(input())\nb = input()\nlist1 = [int(i) for i in b.split()]\nlist2 = []\nfor i in range(a):\n list2.append(list1[i]%2)\nif list2.count(0) == 1:\n for i in range(a):\n if list2[i] == 0:\n print(i+1)\n break\nelse:\n for i in range(a):\n if list2[i] == 1:\n print(i+1)\n break\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\nn = input()\r\nnumbers = [int(x) for x in input().split()]\r\n\r\nindex = 1\r\nif ((numbers[0] - numbers[1])%2 == 0):\r\n parity = numbers[0]%2\r\n for number in numbers:\r\n if (number%2 == parity):\r\n index += 1\r\n else:\r\n break\r\nelse:\r\n if ((numbers[0] - numbers[2])%2 == 0):\r\n index = 2\r\n else:\r\n index = 1\r\n\r\nprint(index)\r\n", "n = int(input())\na = list(map(int,input().split()))\ndic={'even':0,'odd':0}\no = 0\ne = 0\nfor i in a:\n if i % 2 == 0:\n dic.update({'even':a.index(i)+1})\n e += 1\n # a[a.index(i)] = ''\n else:\n dic.update({'odd':a.index(i)+1})\n o += 1\n # a[a.index(i)] = ''\n if o > 1 and e == 1:\n print(dic['even'])\n break\n elif e > 1 and o == 1:\n print(dic['odd'])\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\nl1 = []\r\nl2 = []\r\nfor i in a:\r\n if i%2!=0: l1.append(i)\r\n else: l2.append(i)\r\nif len(l1)>len(l2):\r\n c = 1\r\n for i in a:\r\n if i not in l2: c+=1\r\n else: print(c)\r\nelif len(l1)<len(l2):\r\n c = 1\r\n for i in a:\r\n if i not in l1: c+=1\r\n else: print(c)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nlist1=[]\r\nlist2=[]\r\nfor i in range(0,len(arr)):\r\n if(arr[i]%2!=0):\r\n list1.append(i+1)\r\n else:\r\n list2.append(i+1)\r\nif(len(list1)==1):\r\n print(list1[0])\r\nif(len(list2)==1):\r\n print(list2[0])", "# https://codeforces.com/problemset/problem/25/A\r\n\r\ninput()\r\nl = list(map(int, input().split()))\r\nchc = 0\r\nnchc = 0\r\nvch=None\r\nvnch=None\r\nfor x in set(l):\r\n if x%2 == 0:\r\n chc += l.count(x)\r\n vch = x\r\n else:\r\n nchc += l.count(x)\r\n vnch = x\r\n\r\nif chc == 1:\r\n print(l.index(vch)+1)\r\nelif nchc == 1:\r\n print(l.index(vnch)+1)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nfor i in range (n):\r\n if a[i]%2==0:\r\n b.append('0')\r\n else:\r\n b.append('1')\r\nif b.count('0')>=b.count('1'):\r\n print(b.index('1')+1)\r\nelse:\r\n print(b.index('0')+1)\r\n \r\n", "n=int(input())\r\nnum=[(int(i)%2) for i in input().split()]\r\nif num.count(1)>num.count(0):\r\n print(num.index(0)+1)\r\nelse:\r\n print(num.index(1)+1)", "n = int(input())\r\ns = list(map(int,input().split()))[:n]\r\ne = 0\r\nei = 0\r\no = 0\r\noi = 0\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n e += 1\r\n ei = i\r\n else:\r\n o += 1\r\n oi = i\r\nif e == 1:\r\n print(ei + 1)\r\nelse:\r\n print(oi + 1) ", "t=int(input())\r\nnum=[int(x) for x in input().split()]\r\na=list(filter(lambda x:x%2==0,num))\r\nb=list(filter(lambda x:x%2==1,num))\r\nif len(a)==1:\r\n\tc=a[0]\r\nelse:\r\n\tc=b[0]\r\nprint(num.index(c)+1)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ne=0\r\nod=0\r\nfor i in l:\r\n if i%2==0:\r\n e+=1\r\n else:\r\n od+=1\r\nif(e==1):\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if l[i]%2==1:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\neven = list(filter(lambda x: x % 2, a))\r\nodd = list(filter(lambda x: not x % 2, a))\r\nif len(even) > len(odd):\r\n\tprint(a.index(*odd)+1)\r\nelse:\r\n\tprint(a.index(*even)+1)", "from math import ceil\nfrom collections import defaultdict\n\nN = int(input())\nS = [int(i) for i in input().split()]\n\ncounts = [0, 0]\nidx = [-1, -1]\n\nfor i in range(len(S)):\n r = S[i] % 2\n counts[r] += 1\n idx[r] = i\n\nif counts[0] == 1:\n print(idx[0] + 1)\nelse:\n print(idx[1] + 1)\n", "s = input()\r\nlist1 = list(map(int,input().split()))\r\ncountCH = countNECH = ind = 0\r\nfor i in list1:\r\n ind += 1\r\n if i % 2 == 0:\r\n countCH += 1\r\n k1 = ind\r\n else:\r\n countNECH +=1\r\n k2 = ind\r\nif countNECH > countCH:\r\n print(k1)\r\nelse:\r\n print(k2)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\neven_count = 0\r\nodd_count = 0\r\nlast_even_index = 0\r\nlast_odd_index = 0\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n last_even_index = i + 1\r\n else:\r\n odd_count += 1\r\n last_odd_index = i + 1\r\nif even_count == 1:\r\n print(last_even_index)\r\nelse:\r\n print(last_odd_index)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nodd,even = 0,0\r\nlasteven,lastodd = -1,-1\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n even+=1\r\n lasteven = i\r\n else:\r\n odd+=1\r\n lastodd = i\r\nif even==1:\r\n print(lasteven+1)\r\nelse:\r\n print(lastodd+1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nodd = [0, 0]\r\neven = [0, 0]\r\nfor i in l:\r\n if i % 2 == 0:\r\n even[0] += 1\r\n even[1] = i\r\n else:\r\n odd[0] += 1\r\n odd[1] = i\r\n if (odd[0] >= 1 and even[0] > 1) or (odd[0] > 1 and even[0] >= 1):\r\n if odd[0] == 1:\r\n print(l.index(odd[1])+1)\r\n elif even[0] == 1:\r\n print(l.index(even[1])+1)\r\n break\r\n", "n=int(input())\r\nv=list(map(int,input().split()))\r\nec=0\r\noc=0\r\noi=0\r\nei=0\r\nfor i in range(0,n):\r\n if v[i]%2==0:\r\n ec+=1\r\n ei=i\r\n else:\r\n oc+=1\r\n oi=i\r\nc1=v.count(v[0])\r\nc2=v.count(v[1])\r\nv1=v[0]\r\nv2=v[1]\r\nif c1==n-1:\r\n for i in range(0,n):\r\n if v[i]!=v1:\r\n print(i+1)\r\n break\r\nelif c2==n-1 and c1!=c2:\r\n for i in range(0,n):\r\n if v[i]!=v2:\r\n print(i+1)\r\n break\r\nelif ec==n-1:\r\n print(oi+1)\r\nelse:\r\n print(ei+1)\r\n", "n = int(input())\r\na = [int(i) for i in input().split(maxsplit = n)]\r\nif a[0] % 2 == 0 and a[1] % 2 == 0 or a[1] % 2 == 0 and a[2] % 2 == 0 or a[0] % 2 == 0 and a[2] % 2 == 0:\r\n for i in a:\r\n if i % 2 == 1:\r\n print(a.index(i) + 1)\r\n break\r\nelse:\r\n for i in a:\r\n if i % 2 == 0:\r\n print(a.index(i) + 1)\r\n break\r\n", "a=int(input())\r\ncount=0;count1=0\r\nb=list(map(int,input().split(\" \")[:a]))\r\nr=[];r1=[]\r\nfor i in b:\r\n if(i%2==0):\r\n count=count+1\r\n r.append(i)\r\n else:\r\n count1=count1+1\r\n r1.append(i)\r\nif(count<count1):\r\n print(b.index(r[0])+1)\r\nelse:\r\n print(b.index(r1[0])+1)\r\n \r\n", "a = input()\r\nb = list(map(int, input().split()))\r\nn_odd = 0\r\nn_even = 0\r\nlast_odd_index = 0\r\nlast_even_index = 0\r\nfor n in range(0, len(b)):\r\n if b[n] % 2 == 0:\r\n n_even += 1\r\n last_even_index = n+1\r\n else:\r\n n_odd += 1\r\n last_odd_index = n+1\r\nif n_odd > n_even:\r\n print(last_even_index)\r\nelse:\r\n print(last_odd_index)\r\n\r\n\r\n", "n=int(input())\r\nY=input()\r\nY=Y.split()\r\neven=0\r\nodd=0\r\nfor i in range(0,len(Y)):\r\n Y[i]=int(Y[i])\r\n\r\nfor ele in Y:\r\n if ele%2==0:\r\n even+=1\r\n elif ele%2!=0:\r\n odd+=1\r\n\r\nif odd==1:\r\n for i in range(0,len(Y)):\r\n if Y[i]%2!=0:\r\n print(i+1)\r\n\r\nelif even==1:\r\n for i in range(0, len(Y)):\r\n if Y[i] % 2 == 0:\r\n print(i + 1)", "input()\r\ns=[int(x)%2 for x in input().split()]\r\nprint(s.index(s.count(0)>1)+1)", "def f(L):\r\n n=len(L)\r\n e=0\r\n o=0\r\n for i in range(3):\r\n if L[i]%2==1:\r\n o+=1\r\n else:\r\n e+=1\r\n if e>o:\r\n s=\"e\"\r\n else:\r\n s=\"o\"\r\n if s==\"e\":\r\n for i in range(n):\r\n if L[i]%2==1:\r\n return i+1\r\n else:\r\n for j in range(n):\r\n if L[j]%2==0:\r\n return j+1\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\nprint(f(L))\r\n", "#quant = int('3')\nquant = int(input())\nnumeros = input()\n#numeros = '1 1 2'\nnumeros = numeros.split(\" \")\n\npares = []\nimpares = []\n\nfor i in range (quant):\n if (int(numeros[i])%2 == 0):\n pares.append(int(i+1))\n pares.append(numeros[i])\n else:\n impares.append(int(i+1))\n impares.append(numeros[i])\n \nif (len(pares)>3):\n print(impares[0])\nelse:\n print (pares[0])\n\t \t\t\t\t \t \t \t\t\t \t \t\t\t", "z=int(input())\nx=input().split()\ny=[int(i)for i in x]\nm=0\nn=0\ni=0\nwhile i < z:\n if y[i] % 2 ==0:\n a=i\n m+=1\n else:\n b=i\n n+=1\n i+=1\nif m>n:\n print(b+1)\nelse:\n print(a+1)", "a=int(input())\r\nb=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor r in b:\r\n if(r%2==0):\r\n e=e+1\r\n else:\r\n o=o+1\r\nif(e==1):\r\n for r in range(0,a):\r\n if(b[r]%2==0):\r\n print(r+1)\r\n break\r\nelse:\r\n for r in range(0,a):\r\n if(b[r]%2==1):\r\n print(r+1)\r\n break\r\n \r\n", "def main() -> None:\n # with open(\"test.txt\") as test_file:\n # _, numbers = test_file.readline(), list(map(int, test_file.readline().split()))\n _ = input()\n numbers = list(map(int, input().split()))\n # last_number = None\n # for i, num in enumerate(numbers):\n # endianness = num & 1\n # if last_number is not None and num & 1 != last_number:\n # print(i + 1)\n # return\n # last_number = endianness\n even, odds = [], []\n for i, num in enumerate(numbers):\n if num & 1:\n odds.append((i+1, num))\n else:\n even.append((i+1, num))\n if len(even) == 1:\n print(even[0][0])\n else:\n print(odds[0][0])\n \n\nif __name__ == \"__main__\":\n main()", "n = int(input())\r\nlist_nums = [int(x) for x in input().split()]\r\n\r\nlist_even = []\r\nlist_odd = []\r\n\r\nfor i, num in enumerate(list_nums):\r\n\tif num & 1:\r\n\t\tlist_odd.append(i+1)\r\n\telse:\r\n\t\tlist_even.append(i+1)\r\n\r\n\tif len(list_odd) and len(list_even) and len(list_even) != len(list_odd):\r\n\t\tprint(list_even[0] if len(list_even) == 1 else list_odd[0])\r\n\t\tbreak", "n=int(input())\r\ns=input()\r\na=[int(x) for x in s.split()]\r\no1=0\r\ne1=0\r\nno=0\r\nne=0\r\nfor x in range(n):\r\n\tif a[x]%2==0:\r\n\t\tif e1==0:\r\n\t\t\te1=x+1\r\n\t\tne+=1\r\n\telse:\r\n\t\tif o1==0:\r\n\t\t\to1=x+1\r\n\t\tno+=1\r\nif no==1:\r\n\tprint(o1)\r\nelse:\r\n\tprint(e1)", "a=int(input());b=input().split();c=[i for i in b if int(i) % 2 == 0];n=[j for j in b if int(j) % 2 == 1];print(b.index(n[0])+1 if len(n) < len(c) else b.index(c[0])+1)", "odd = 0\r\neven = 0\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nfor i in numbers:\r\n if i%2:\r\n odd += 1\r\n else:\r\n even += 1\r\n\r\nfor i in numbers:\r\n if i%2==1 and odd==1:\r\n print(numbers.index(i)+1)\r\n break\r\n elif i%2 == 0 and even == 1:\r\n print(numbers.index(i)+1)\r\n break", "n = int(input())\r\narr = list(map(int,input().split()))\r\neve_count = 0\r\nodd_count = 0\r\nfor values in arr:\r\n if values%2==0:\r\n eve_count += 1\r\n elif values%2!= 0:\r\n odd_count += 1\r\nif eve_count>odd_count:\r\n for i in range(len(arr)):\r\n if arr[i]%2!= 0:\r\n print(i+1)\r\nelif odd_count>eve_count:\r\n for i in range(len(arr)):\r\n if arr[i]%2== 0:\r\n print(i+1)\r\n", "input();l1,l2=[],[]\r\nfor i,v in enumerate(map(int,input().split())):\r\n if v%2==0:l1+=[i+1]\r\n else:l2+=[i+1]\r\nprint(l1[0] if len(l1)==1 else l2[0])", "n = int(input())\r\na = list(map(int, input().split()))\r\neven, odd = [], []\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even.append(a[i])\r\n else:\r\n odd.append(a[i])\r\nif len(odd) == 1:\r\n print(a.index(odd[0])+1)\r\nelse:\r\n print(a.index(even[0])+1)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n l = input().split(\" \")\r\n count_odd = 0\r\n count_even = 0\r\n flag = []\r\n for i in range (len(l)):\r\n if (int(l[i]) % 2 == 0):\r\n flag.append(0)\r\n count_even += 1\r\n else:\r\n flag.append(1)\r\n count_odd += 1\r\n if count_odd > count_even:\r\n index = flag.index(0)\r\n print(index + 1)\r\n else:\r\n index = flag.index(1)\r\n print(index + 1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ns1, s2 = 0, 0\r\n\r\nfor i in a:\r\n if i % 2 == 0:\r\n s1 += 1\r\n else:\r\n s2 += 1\r\n\r\nif s1 > s2:\r\n for i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n print(i+1)\r\n \r\nelif s2 > s1:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n print(i+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n even+=1\r\n evenindex=i\r\n else:\r\n odd+=1\r\n oddindex=i\r\nif(even==1):\r\n print(evenindex+1)\r\nelse:\r\n print(oddindex+1)\r\n ", "n=int(input())\r\nq=list(map(int,input().split()))\r\nev=0\r\nod=0\r\nfor i in range(n):\r\n if q[i]%2==0:\r\n ev+=1\r\n ie=i\r\n else:\r\n od+=1\r\n io=i\r\nif ev==1:\r\n print(ie+1)\r\nelse:\r\n print(io+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\np=0\r\nq=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n\t p=p+1\r\n else:\r\n\t q=q+1\r\nif p>q:\r\n for i in range(n):\r\n\t if a[i]%2==1:\r\n\t\t print(i+1)\r\nelse:\r\n for i in range(n):\r\n\t if a[i]%2==0:\r\n\t\t print(i+1)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/22 01:32\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\n\r\nA = [int(x) for x in input().split()]\r\n\r\nodds = [x for x in A if x%2 == 1]\r\nevens = [x for x in A if x%2==0]\r\n\r\nif len(odds) == 1:\r\n print(A.index(odds[0])+1)\r\nelse:\r\n print(A.index(evens[0])+1)", "n = int(input())\r\nlist_of_numbers = list(map(int, input().split()))\r\nodd_indices = []\r\neven_indices = []\r\nfor i in range(n):\r\n if list_of_numbers[i] % 2 == 0:\r\n even_indices.append(i)\r\n else:\r\n odd_indices.append(i)\r\n if len(even_indices) > 0 and len(odd_indices) > 0:\r\n if len(even_indices) > len(odd_indices):\r\n print(odd_indices[0] + 1)\r\n break\r\n if len(even_indices) < len(odd_indices):\r\n print(even_indices[0] + 1)\r\n break\r\n", "def is_even(lis):\r\n counto = 0\r\n counte = 0\r\n for i in range(3):\r\n if lis[i] % 2 == 0:\r\n counte += 1\r\n else:\r\n counto += 1\r\n if counto < counte:\r\n return 0\r\n else:\r\n return 1\r\n\r\nn = int(input())\r\nlis = [int(x) for x in input().split()]\r\na = is_even(lis)\r\nfor i in range(n):\r\n if lis[i] % 2 != a:\r\n print (i+1)\r\n break\r\n", "input()\r\narr = list(map(int, input().split()))\r\n\r\nlastEven=-1\r\nlastOdd=-1\r\nnumOdd=0\r\nfor i in range(0,len(arr)):\r\n if(arr[i]%2):\r\n lastOdd = i\r\n numOdd = numOdd+1\r\n else:\r\n lastEven=i\r\nif numOdd > 1:\r\n print(lastEven+1)\r\nelse:\r\n print(lastOdd+1)", "n = int(input())\na = list(map(int, input().split()))\nx, y = [], []\nfor i in range(len(a)):\n if a[i] % 2 == 0:\n x.append(i)\n else:\n y.append(i)\nif len(x) > len(y):\n print(y[0] + 1)\nelse:\n print(x[0] + 1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl_new = []\r\nfor i in range(n):\r\n l_new.append(l[i] % 2) \r\nif l_new.count(1) == 1:\r\n print(l_new.index(1)+1)\r\nelse:\r\n print(l_new.index(0)+1)", "n = int(input())\r\nd = list(map(int, input().split()))\r\nc = 0\r\nnec = 0\r\n\r\nfor i in range(n):\r\n if d[i] % 2 == 0:\r\n c += 1\r\n else:\r\n nec += 1\r\n\r\nif c == 1:\r\n for i in range(n):\r\n if d[i] % 2 == 0:\r\n print(d.index(d[i]) + 1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if d[i] % 2 == 1:\r\n print(d.index(d[i]) + 1)\r\n break\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\neven_count = 0\r\nodd_count = 0\r\nlast_even = 0\r\nlast_odd = 0\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n last_even = i + 1\r\n else:\r\n odd_count += 1\r\n last_odd = i + 1\r\n\r\nif even_count == 1:\r\n print(last_even)\r\nelse:\r\n print(last_odd)\r\n", "\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nevenness = [num % 2 for num in numbers]\r\nif evenness.count(0) == 1:\r\n print(evenness.index(0) + 1)\r\nelse:\r\n print(evenness.index(1) + 1)", "#!/usr/bin/env python3\n\nfrom sys import stdin\n\n\ndef main():\n _, = stdin_get_ints_from_line()\n numbers = stdin_get_ints_list_from_line()\n odd = 0\n even = 0\n last_even_position = 0\n last_odd_position = 0\n\n for i, number in enumerate(numbers):\n if number % 2 == 0:\n even += 1\n last_even_position = i\n else:\n odd += 1\n last_odd_position = i\n\n if odd == 1 and even > 1:\n print(last_odd_position + 1)\n return\n\n if odd > 1 and even == 1:\n print(last_even_position + 1)\n return\n\n\ndef stdin_get_ints_from_line():\n return (int(x) for x in stdin.readline().strip().split(' '))\n\n\ndef stdin_get_ints_list_from_line():\n return list(int(x) for x in stdin.readline().strip().split(' '))\n\n\ndef stdin_get_string_from_line():\n return stdin.readline().strip()\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\ncnte=0\r\ncnto=0\r\ntemp1=0\r\ntemp2=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n temp1=i\r\n cnte+=1\r\n elif l[i]%2!=0:\r\n temp2=i\r\n cnto+=1\r\nif cnte==1:\r\n print(temp1+1)\r\nelif cnto==1:\r\n print(temp2+1)", "n = int(input())\r\nproblems = list(map(int, input().strip().split(' ')))\r\nproblems = [i % 2 for i in problems]\r\nif problems.count(1) == 1:\r\n print(problems.index(1) + 1)\r\nelse:\r\n print(problems.index(0) + 1)", "num = int(input())\r\nstr1 = input()\r\nstr2 = \"\"\r\nstr1 += \" \"\r\nlest = []\r\nfor x in range (len(str1)):\r\n if str1[x]!=\" \": \r\n str2+=str1[x]\r\n else :\r\n lest.append(int(str2))\r\n str2 = \"\" \r\neven = 0\r\nodd = 0\r\nfor x in lest :\r\n if x%2==0 :\r\n even+=1\r\n else :\r\n odd+=1\r\nc = 0\r\nif even > odd :\r\n for x in lest :\r\n if x%2!=0 :\r\n c=lest.index(x)\r\nelif even < odd :\r\n for x in lest :\r\n if x%2==0 :\r\n c=lest.index(x)\r\nprint(c+1)", "numbers = input()\r\nvalues = input().split()\r\nodd = 0\r\neven = 0\r\nfor i in values:\r\n if int(i) % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif odd == 1:\r\n for i in values:\r\n if int(i) % 2 == 1:\r\n print(values.index(i) + 1)\r\nif even == 1:\r\n for i in values:\r\n if int(i) % 2 == 0:\r\n print(values.index(i) + 1)\r\n", "def find_Evenness(n,lst):\r\n ecnt=0\r\n ocnt=0\r\n for i in lst:\r\n if i%2==0:\r\n ecnt+=1\r\n if ecnt>1:\r\n for j in range(0,n):\r\n if lst[j]%2!=0:\r\n return j+1\r\n else:\r\n ocnt+=1\r\n if ocnt>1:\r\n for j in range(0,n):\r\n if lst[j]%2==0:\r\n return j+1\r\n\r\n\r\nn=int(input())\r\nlst=list(map(int,input().strip().split()))\r\nprint(find_Evenness(n,lst))\r\n", "if __name__ == '__main__':\r\n n = int(input().strip())\r\n arr = [int(__) % 2 for __ in input().strip().split()]\r\n z, o = arr.count(0), arr.count(1)\r\n if z > o:\r\n print(arr.index(1) + 1)\r\n else:\r\n print(arr.index(0) + 1)\r\n", "n=int(input())\r\nq=list(map(int,input().split()))\r\nt=0\r\nwhile True:\r\n if q[0]%2==0 and q[1]%2==0:\r\n if q[t]%2==0:\r\n t+=1\r\n else:\r\n print(t+1)\r\n break\r\n elif q[0]%2!=0 and q[1]%2!=0:\r\n if q[t]%2!=0:\r\n t+=1\r\n else:\r\n print(t+1)\r\n break\r\n elif q[0]%2==0 and q[1]%2!=0:\r\n if q[2]%2==0:\r\n print(2)\r\n break\r\n else:\r\n print(1)\r\n break\r\n elif q[0]%2!=0 and q[1]%2==0:\r\n if q[2]%2!=0:\r\n print(2)\r\n break\r\n else:\r\n print(1)\r\n break", "n=int(input())\narr=[int(i) for i in input().split()]\nstore=[0,0,0,0]\nfor i in range(n):\n if arr[i]%2==0:\n store[0]=store[0]+1\n store[1]=i\n else:\n store[2]=store[2]+1\n store[3]=i\nif store[0]==1:\n print(store[1]+1)\nelse:\n print(store[3]+1)\n ", "len_A = int(input())\r\nA = list(map(int, input().split(' ')))\r\nnumbers_in_A = []\r\n\r\nfor i in range(3):\r\n if A[i] % 2 == 0:\r\n numbers_in_A.append('even')\r\n else:\r\n numbers_in_A.append('odd')\r\n\r\nif numbers_in_A.count('even') >= 2:\r\n ost = 1\r\nelse:\r\n ost = 0\r\n\r\nfor i in A:\r\n if i % 2 == ost:\r\n print(A.index(i) + 1)\r\n \r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ne,o = [],[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n e.append(i+1)\r\n else:\r\n o.append(i+1)\r\nif len(o)==1:\r\n print(o[0])\r\nelse:\r\n print(e[0])\r\n\r\n", "n=int(input())\r\nL=[int(x)for x in input().split()]\r\nk=0\r\nf=0\r\np=0\r\nc=0\r\nfor i in range (0,n):\r\n if L[i]%2==0 :\r\n k=k+1\r\n p=i\r\n else :\r\n f=f+1\r\n c=i\r\nif k==1 :\r\n print (p+1)\r\nif f==1 :\r\n print (c+1)\r\n", "n=int(input())\nl=list(map(int,input().split()))\nodd=0\neven=0\nfor i in l:\n\tif i%2==0:\n\t\teven+=1\n\telse:\n\t\todd+=1\nind=-1\nif even==1:\n\tfor i in range(len(l)):\n\t\tif l[i]%2==0:\n\t\t\tind=i+1\nelse:\n\tfor i in range(len(l)):\n\t\tif l[i]%2==1:\n\t\t\tind=i+1\n\t\t\tbreak\nprint(ind)\n", "import os\r\nimport sys\r\n\r\ndef main():\r\n n = int(input())\r\n list1 = list(map(int, input().split()))\r\n count_even = 0\r\n count_odd = 0\r\n for i in range(n):\r\n if list1[i]%2==0:\r\n count_even+=1\r\n even_pos = i\r\n else:\r\n count_odd+=1\r\n odd_pos = i\r\n if count_odd==1:\r\n print(odd_pos+1)\r\n else:\r\n print(even_pos+1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nV = [int(p) for p in (input()).split()]\r\n#print(n,V)\r\nt = V[0] % 2 + V[1] % 2 + V [2] % 2\r\n\r\nif t <= 1:\r\n f = [v for v in V if v%2 == 1][0]\r\nelse:\r\n f = [v for v in V if v%2 == 0][0]\r\nprint(V.index(f)+1)", "def main():\r\n n = int(input())\r\n dumb_iq_question = tuple(map(int, input().split()))\r\n\r\n odd = [i + 1 for i in range(n) if dumb_iq_question[i] % 2]\r\n even = [i + 1 for i in range(n) if not dumb_iq_question[i] % 2]\r\n print(odd[0]) if len(odd) == 1 else print(even[0])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\n n = input()\n numbers = [int(i) for i in input().split()]\n \n even = 0\n odd = 0\n\n for n in numbers:\n isEven = (n % 2) == 0\n\n if isEven:\n even = even + 1\n else:\n odd = odd + 1\n \n if even < odd:\n *_, even_n = filter(lambda p : p % 2 == 0, numbers)\n print(numbers.index(even_n)+1)\n else:\n *_, odd_n = filter(lambda p : p % 2 != 0, numbers)\n print(numbers.index(odd_n)+1)\n\nmain()\n\t \t \t \t \t \t \t \t\t \t \t \t", "c=int(input())\r\ntab=[]\r\nnb=input()\r\ntab=nb.split(\" \")\r\n\r\npair=0\r\nlastpair=0\r\nimpair=0\r\nlastimpair=0\r\n\r\nfor i in range(len(tab)) :\r\n if int(int(tab[i]))%2==0:\r\n pair+=1\r\n lastpair=int(i+1)\r\n else:\r\n impair+=1\r\n lastimpair=int(i+1)\r\n\r\nif pair==1:\r\n print(lastpair)\r\nelse:\r\n print(lastimpair)\r\n\r\n\r\n ", "n=int(input())\r\nz=list(map(int,input().split()))\r\n\r\nganjil=0\r\ngenap=0\r\nposisigenap=0\r\nposisiganjil=0\r\nfor i in range(n) :\r\n\tif z[i]%2==0 :\r\n\t\tgenap+=1\r\n\t\tposisigenap=i+1\r\n\telse :\r\n\t\tgenap-=1\r\n\t\tposisiganjil=i+1\r\n\r\nif genap>0 :\r\n\tprint(posisiganjil)\r\nelse :\r\n\tprint(posisigenap)", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\na=[]\r\nb=[]\r\nfor i in list:\r\n if i%2==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)==1:\r\n print(list.index(a[0])+1)\r\nelse:\r\n print(list.index(b[0])+1)\r\n \r\n \r\n \r\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\n# Count the number of even and odd numbers\r\neven_count = sum(1 for num in nums if num % 2 == 0)\r\nodd_count = sum(1 for num in nums if num % 2 == 1)\r\n\r\n# Find the index of the number that differs in evenness\r\nif even_count == 1:\r\n print(nums.index(next(num for num in nums if num % 2 == 0)) + 1)\r\nelse:\r\n print(nums.index(next(num for num in nums if num % 2 == 1)) + 1)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nodd=0\r\neven=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even+=1\r\n if a[i]%2==1:\r\n odd+=1\r\nif odd==1:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\nif even==1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n", "from sys import stdin, stdout\n\ndef write(s):\n stdout.write(f'{s}\\n')\n\nyes = lambda _: write('YES')\nno = lambda _: write('NO')\n\ndef read_int():\n return int(stdin.readline().strip())\n\ndef read_ints():\n return list(map(int, stdin.readline().strip().split()))\n\n\nn = read_int()\nm = read_ints()\n\nevens = []\nodds = []\n\nfor i, a in enumerate(m):\n if a % 2 == 0:\n evens.append(i)\n else:\n odds.append(i)\n\nif len(evens) == 1:\n write(evens[0] + 1)\nelse:\n write(odds[0] + 1)\n", "n = int(input())\r\nline = {}\r\ns = list(map(int, input().split()))\r\neven = []\r\nodd = []\r\nfor i in range(n):\r\n line[s[i]] = i+1\r\n a = s[i]\r\n b = int(a)\r\n if b % 2 == 0:\r\n even.append(a)\r\n else:\r\n odd.append(a)\r\nif len(even) == 1:\r\n print(line[int(even[0])])\r\nelse:\r\n print(line[int(odd[0])])\r\n", "y = int(input())\r\nlist_of_numbers = list(map(int, input().strip().split()))\r\n\r\nnumber_of_even, number_of_odd = 0, 0\r\n\r\nfor number in list_of_numbers:\r\n if number % 2 == 0:\r\n number_of_even += 1\r\n else:\r\n number_of_odd += 1\r\n\r\n\r\nif number_of_even > number_of_odd:\r\n for i in list_of_numbers:\r\n if i % 2 != 0:\r\n print(list_of_numbers.index(i) + 1)\r\nelse:\r\n for i in list_of_numbers:\r\n if i % 2 == 0:\r\n print(list_of_numbers.index(i) + 1)\r\n", "n = int(input())\r\ns=input()\r\na = list(map(int,s.split(' ')))\r\nevens=0\r\nodds=0\r\nfor i in range(n):\r\n if a[i]%2 ==0:\r\n evens+=1\r\n else: odds+=1\r\nif odds==1:\r\n for i in range(n):\r\n if (a[i]%2!=0):\r\n print(i+1)\r\nelif evens==1:\r\n for i in range(n):\r\n if (a[i]%2 ==0):\r\n print(i+1)", "def read_array():\r\n x = []\r\n x1 = []\r\n x = input()\r\n x = x.split(' ')\r\n for r in range(len(x)):\r\n x1.append(int(x[r]))\r\n return x1\r\ndef even_ness(x):\r\n count1=0\r\n count2=0\r\n for v in x:\r\n if v%2==0:\r\n count1+=1\r\n if count1>1:\r\n break\r\n else:\r\n count2+=1\r\n if count2>1:\r\n break\r\n if count1>1:\r\n for i in range(len(x)):\r\n if x[i]%2==1:\r\n return i+1\r\n else:\r\n for i in range(len(x)):\r\n if x[i]%2==0:\r\n return i+1\r\n\r\n\r\n\r\ninput()\r\nx=read_array()\r\nprint(even_ness(x))", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Check the parity of the first three numbers\r\nparity = sum(num % 2 for num in numbers[:3])\r\n\r\n# Find the number that differs in evenness\r\nif parity >= 2:\r\n differing_number = next(num for num in numbers if num % 2 == 0)\r\nelse:\r\n differing_number = next(num for num in numbers if num % 2 != 0)\r\n\r\n# Output the index of the differing number\r\ndiffering_index = numbers.index(differing_number) + 1\r\nprint(differing_index)\r\n", "n = int(input())\r\nnum = list(map(int,input().split()))\r\nfirst_3= ['']*3\r\nfor i in range(3):\r\n first_3[i] = num[i]%2\r\nif first_3.count(1) >= 2:\r\n evenness = 0 #If evenness is 0, i have to find the even number. If evenness is 1, i have to find the odd number\r\nelse:\r\n evenness = 1\r\nfor j in range(n):\r\n if evenness == 0:\r\n if num[j]%2 == 0:\r\n print(int(j+1))\r\n elif evenness == 1:\r\n if num[j]%2 == 1:\r\n print(int(j+1))\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\na = list(map(lambda x: int(x) & 1, input().split()))\r\nif a.count(0) == 1:\r\n print(a.index(0) + 1)\r\nelse:\r\n print(a.index(1) + 1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\neven = 0\r\nfor i in range(len(a)):\r\n if a[i]%2 == 0:\r\n even+=1\r\nodd = n-even\r\nif odd==1:\r\n for i in range(len(a)):\r\n if a[i]%2 == 1:\r\n print(a.index(a[i]) + 1)\r\n break\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]%2 == 0:\r\n print(a.index(a[i]) + 1)\r\n break", "t = int(input(''))\r\n\r\ndat = list(map(int , input('').split()))\r\n\r\nch , nc = [] , []\r\n\r\nfor i in range(len(dat)):\r\n if dat[i] % 2 == 0:\r\n ch.append(i+1)\r\n else:\r\n nc.append(i+1)\r\n\r\nif len(nc) == 1:\r\n print(nc[0])\r\nelse:\r\n print(ch[0])\r\n", "n=int(input())\r\no=0\r\ne=0\r\na=list(input().split())\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nfor i in a:\r\n if (i%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\nfor i in range(n):\r\n if ((o>1 and a[i]%2==0)or(e>1 and a[i]%2==1)):\r\n print(i+1)", "input()\r\nl = map(int, input().split())\r\ne = [i%2 for i in l]\r\n\r\nif (e.count(0)>e.count(1)):\r\n print(e.index(1)+1)\r\nelse:\r\n print(e.index(0)+1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ne = 0\r\no = 0\r\nfor i in l:\r\n if(i % 2== 0):\r\n e = e+1\r\n k = l.index(i)\r\n else:\r\n o = o +1\r\n m = l.index(i)\r\nif(e < o):\r\n print(k+1)\r\nelse:\r\n print(m+1)\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nchan = 0\r\nle = 0\r\nfor i in range(n):\r\n if(a[i]%2==0): chan+=1\r\n else : le+=1\r\nif(chan > le):\r\n for i in range(n):\r\n if(a[i]%2!=0):\r\n print(i+1)\r\n break;\r\nelse:\r\n for i in range(n):\r\n if(a[i]%2==0):\r\n print(i+1)\r\n break; ", "n=int(input())\r\nlist0=[int(i) for i in input().split()]\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n if list0[i]%2!=0:\r\n x+=1\r\n if list0[i]%2==0:\r\n y+=1\r\nif x==1:\r\n for i in range(n):\r\n if list0[i]%2!=0:\r\n print(i+1)\r\nif y==1:\r\n for i in range(n):\r\n if list0[i]%2==0:\r\n print(i+1)\r\n", "n = int(input())\r\np = [int(i) for i in input().split()]\r\ncheck = [i % 2 for i in p]\r\nif check.count(0) > check.count(1):\r\n print(check.index(1) + 1)\r\nelse:\r\n print(check.index(0) + 1)\r\n", "input()\r\na = [int(i)%2 for i in input().split()]\r\nif a.count(0)==1: print(a.index(0)+1)\r\nelse: print(a.index(1)+1)", "def main():\n n = int(input())\n nums = list(map(lambda x: int(x) % 2, input().split()))\n \n odd_in_first_3 = nums[:3].count(1)\n if odd_in_first_3 >= 2:\n print(nums.index(0) + 1)\n else:\n print(nums.index(1) + 1)\n\n\n\nmain()", "n =int(input())\r\na = list(map(int,input().split()))\r\ncount_even = 0\r\ncount_odd = 0\r\nfor i in a:\r\n if i % 2 == 0:\r\n count_even += 1\r\n elif i % 2 == 1:\r\n count_odd += 1\r\n\r\nif count_even > count_odd:\r\n for i in a:\r\n if i % 2 == 1:\r\n print(a.index(i) + 1)\r\n exit()\r\nelse:\r\n for i in a:\r\n if i % 2 == 0:\r\n print(a.index(i) + 1)\r\n exit()", "N = int(input())\nA = map(int, input().split())\neven = []\nodd = []\n\nfor i, x in enumerate(A):\n if x % 2 == 0:\n even.append(i + 1)\n else:\n odd.append(i + 1)\n\nif len(even) == 1:\n print(even[0])\nelse:\n print(odd[0])\n\n \t\t\t \t\t\t \t \t \t \t \t \t \t\t\t \t", "n = int(input())\r\nx = list(map(int, input().split()))\r\nk = 0\r\ns = []\r\nwind = []\r\nfor i in x:\r\n if i % 2 == 0 and k == 0:\r\n k = 1\r\n s.append(i)\r\n elif k == 0 and i % 2 != 0:\r\n k = 2\r\n s.append(i)\r\n elif k == 1 and i % 2 == 0:\r\n s.append(i)\r\n elif k == 2 and i % 2 != 0:\r\n s.append(i)\r\n else:\r\n wind.append(i)\r\n\r\n\r\nprint(int(x.index(wind[0] if len(wind) < len(s) else s[0])) + 1)\r\n\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nodd=sum(x & 1 for x in arr)\r\nfor i,v in enumerate(arr):\r\n if (odd!=1 and ~v&1) or (odd==1 and v&1):\r\n print(i+1)\r\n exit()", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\ncount_even=0\r\ncount_odd=0\r\nindex_even=[]\r\nindex_odd=[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n count_even+=1\r\n index_even.append(i)\r\n else:\r\n count_odd+=1\r\n index_odd.append(i)\r\n\r\nif count_odd==1:\r\n for i in index_odd:\r\n print(i+1)\r\nelse:\r\n for j in index_even:\r\n print(j+1)\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 18 09:33:24 2019\r\n\r\n@author: LV\r\n\"\"\"\r\n\r\nn = int(input())\r\nd = [int(x) % 2 for x in input().split()]\r\nprint([d.index(0) + 1, d.index(1) + 1][d.index(1) + d[::-1].index(1) + 1 == len(d)])", "n=int(input())\r\nlist=input().split()\r\nfor i in range(n):\r\n list[i]=int(list[i])\r\nif (list[0]+list[1])%2!=0:\r\n if (list[0]+list[2])%2!=0:\r\n print(1)\r\n else:print(2)\r\nelse:\r\n for i in range(n):\r\n if (list[i]+list[0])%2!=0:\r\n print(i+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor j in range(0,3):\r\n if l[j]%2==0:\r\n c=c+1\r\nif c>1:\r\n for i in range(0,len(l)):\r\n if l[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(0,len(l)):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\n\r\n", "n=int(input())\r\na=[int(i)for i in input().split()]\r\nx=y=0\r\nfor i in range(3):\r\n if a[i]%2==0:\r\n x=x+1\r\n else:\r\n y=y+1\r\nif x>=2:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)", "l=int(input())\r\ns=list(map(int,input().split()))\r\nodd=0\r\neven=0\r\nfor i in range(3):\r\n if(s[i]%2):\r\n odd+=1\r\n else:\r\n even+=1\r\nif(even>odd):\r\n for i in range(l):\r\n if(s[i]%2):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(l):\r\n if(s[i]%2==0):\r\n print(i+1)\r\n break", "count = int(input())\r\ngg = 0\r\nlvl = 0\r\nlvl1 = 0\r\ncheck = input()\r\ncheck = check.split(' ')\r\nwhile count > gg:\r\n if int(check[gg]) % 2 == 1:\r\n lvl +=1\r\n if int(check[gg]) % 2 == 0:\r\n lvl1 +=1\r\n gg +=1\r\ngg = 0\r\nif lvl == 1:\r\n while count > gg:\r\n if int(check[gg]) % 2 == 1:\r\n print(gg + 1)\r\n gg +=1\r\ngg = 0\r\nif lvl1 == 1:\r\n while count > gg:\r\n if int(check[gg]) % 2 == 0:\r\n print(gg + 1)\r\n gg +=1\r\n ", "t=int(input())\r\ncount=0\r\ncountt=0\r\nlst=[int(x) for x in input().split()]\r\nfor i in range(len(lst)):\r\n\tif(lst[i]%2==0):\r\n\t\tcount+=1\r\n\telse:\r\n\t\tcountt+=1\r\nif(count>countt):\r\n\tfor i in range(len(lst)):\r\n\t\tif(lst[i]%2!=0):\r\n\t\t\tprint(i+1)\r\nif(countt>count):\r\n\tfor i in range(len(lst)):\r\n\t\tif(lst[i]%2==0):\r\n\t\t\tprint(i+1)\r\n", "n = int(input())\narr = [int(x) % 2 for x in input().split()]\nif(sum(arr) == 1):\n\tprint(arr.index(1) + 1)\nelse:\n\tprint(arr.index(0) + 1)", "_, numbers = input(), list(map(int, input().split()))\r\nnum_evens = 0\r\nnum_odds = 0\r\n\r\nindex_even = 0\r\nindex_odd = 0\r\n\r\nfor index in range(len(numbers)):\r\n if numbers[index] % 2 == 0:\r\n num_evens += 1\r\n index_even = index\r\n else:\r\n num_odds += 1\r\n index_odd = index\r\n \r\n if num_evens >= 2 and num_odds == 1:\r\n print(index_odd + 1)\r\n quit()\r\n elif num_odds >= 2 and num_evens == 1:\r\n print(index_even + 1)\r\n quit()", "n = int(input())\r\nnums = input().split()\r\narray = []\r\n\r\nfor num in nums:\r\n if int(num) % 2 == 0:\r\n array.append(\"even\")\r\n else:\r\n array.append(\"odd\")\r\n\r\nif array.count(\"even\") > 1:\r\n print(array.index(\"odd\") + 1)\r\nelse:\r\n print(array.index(\"even\") + 1)\r\n", "n = int(input())\n\nlst = list(map(int, input().split()))\necnt = 0\nocnt = 0\noindex = 0\neindex = 0\nfor i in range(n):\n if lst[i] % 2 == 0:\n ecnt += 1\n eindex = i\n else:\n ocnt += 1\n oindex = i\n\nif (ecnt == 1):\n print(eindex+1)\nelse:\n print(oindex+1)\n \t\t \t\t\t \t \t \t \t\t \t \t\t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor i in l:\r\n if i%2==0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif(len(e)>len(o)):\r\n a=o[0]\r\n print(l.index(a)+1)\r\nelse:\r\n b=e[0]\r\n print(l.index(b)+1)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\neven = []\r\nodd = []\r\nfor i, v in enumerate(A):\r\n if v % 2 == 0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\nif len(even) == 1:\r\n print(even[0])\r\nelse:\r\n print(odd[0])", "n=int(input())\r\narr=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nfor i in arr:\r\n if i%2==0:\r\n c2+=1\r\n m2=i\r\n else:\r\n c1+=1\r\n m1=i\r\nif c1>c2:\r\n print(arr.index(m2)+1)\r\nelse:\r\n print(arr.index(m1)+1)", "n = int(input())\r\neven = 0 \r\nodd = 0 \r\nnumbers = [int(i) for i in input().split()]\r\nfor i in numbers :\r\n if i % 2 == 0:\r\n even += 1 \r\n else :\r\n odd += 1 \r\nif odd == 1:\r\n for i in range(n) : \r\n if numbers[i] % 2 == 1 :\r\n print(i+1)\r\n break\r\nelse :\r\n for i in range(n) : \r\n if numbers[i] % 2 == 0 :\r\n print(i+1)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n ", "n = int(input())\r\nnum = list(input().split())\r\nfor i in range(len(num)):\r\n num[i] = int(num[i])\r\neven = []\r\nodd = []\r\nfor i in num:\r\n if i % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(even) > len(odd):\r\n print(num.index(odd[0])+1)\r\nelse:\r\n print(num.index(even[0])+1)", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\n\ndef intl():\n return(list(map(int,input().split())))\nnums = intl()\n\neven = False\nfound = False\n\nif nums[0] %2 == 0 and nums[1] %2 == 0:\n even = True\nelif nums[1] %2 == 0 and nums[2] %2 == 0:\n even = True\nelif nums[0] %2 == 0 and nums[2] %2 == 0:\n even = True\n\n\nfor i, num in enumerate(nums):\n this_even = num %2 == 0\n if even != this_even:\n print(i+1)\n found = True\n break\n # print('num = ', num)\n\nif not found:\n print(1)\n\n'''\n\no\n\n8 6 7 8\no\n\n9 4 6 8\ne\ne\n'''", "class Example:\r\n def __init__(self, n, a):\r\n self.n = n\r\n self.a = a\r\n\r\n def solve(self):\r\n m, k = 0, 0\r\n a, b = -1, -1\r\n for elem in self.a:\r\n if elem % 2 == 0:\r\n m += 1\r\n else:\r\n k += 1\r\n for i in range(len(self.a)):\r\n if self.a[i] % 2 == 0:\r\n a = i\r\n else:\r\n b = i\r\n if a > 0 and b > 0:\r\n break\r\n if m > k:\r\n return b + 1\r\n return a + 1\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n a = Example(int(input()), list(map(int, input().split())))\r\n print(a.solve())", "n = int(input())\r\nodd = 0\r\neven = 0\r\n\r\na = tuple(int(x) for x in input().split())\r\nodd = [x for x in a if x%2]\r\n\r\nif len(odd) == 1:\r\n print(a.index(odd[0]) + 1)\r\nelse:\r\n print(a.index([x for x in a if x not in odd][0]) + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ne=0\r\no=0\r\n\r\nfor i in a:\r\n if i%2==0:\r\n e+=1\r\n p1=a.index(i)\r\n else:\r\n o+=1\r\n p2=a.index(i)\r\nif o==1:\r\n print(p2+1)\r\nelse:\r\n print(p1+1)\r\n", "n = int(input())\r\ntab = input().split()\r\neven = 0\r\nodd = 0\r\nfor x in range(3):\r\n if int(tab[x])%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nfor x in range(n):\r\n if even > odd:\r\n if int(tab[x])%2!=0:\r\n print(x+1)\r\n break\r\n else:\r\n if int(tab[x])%2==0:\r\n print(x+1)\r\n break", "n=int(input())\na=input()\na=a.split()\na=[int(i) for i in a]\npar=0\nimp=0\n\nfor i in a:\n if par<2 and imp<2:\n if i%2==0:\n par+=1\n else:\n imp+=1\n\n else:\n break\n\nfor i in range (0,n):\n if par==2:\n if a[i]%2!=0:\n print(i+1)\n break\n if imp==2:\n if a[i]%2==0:\n print(i+1)\n break", "n = int(input())\r\nmassif = [int(a) for a in input().split()]\r\nmore_chet = False\r\nchet = 0\r\nnechet = 0\r\n\r\nfor a in massif[:3]:\r\n\tif a % 2 == 0:\r\n\t\tchet += 1\r\n\telse:\r\n\t\tnechet += 1\r\n\r\nif chet > nechet:\r\n\tmore_chet = True\r\n\r\nfor a in range(n):\r\n\tif more_chet:\r\n\t\tif massif[a] % 2 != 0:\r\n\t\t\tprint(a + 1)\r\n\telse:\r\n\t\tif massif[a] % 2 == 0:\r\n\t\t\tprint(a + 1)\r\n\r\n", "n=int(input())\r\nk=list(map(int,input().split()))\r\nev=0\r\nod=0\r\nevi=0\r\nodi=0\r\nfor i in range(len(k)):\r\n if k[i]%2==0:\r\n ev+=1\r\n evi=i\r\n if k[i]%2==1:\r\n od+=1\r\n odi=i\r\nif ev>od:\r\n print(odi+1)\r\nelse:\r\n print(evi+1)", "n = int(input())\n\nmylist = list(map(int,input().rstrip().split() ))\n\nodd_arr=0\neve_arr=0\n\necount=0\nocount=0\n\nfor i in range(n):\n\tif mylist[i]%2 == 0:\n\t\teve_arr=i+1\n\t\tecount += 1\n\t\t\n\tif mylist[i]%2 != 0:\n\t\todd_arr=i+1\n\t\tocount += 1\n\t\n\tif ecount>0 and ocount>0:\n\t\tif ecount > ocount:\n\t\t\tprint(odd_arr)\n\t\t\tbreak\n\t\tif ecount < ocount:\n\t\t\tprint(eve_arr)\n\t\t\tbreak\n\n\n\n\n\t", "x = int(input())\r\ny = list(map(int, input().split()))\r\neven = []\r\nodd = []\r\nfor i in range(x):\r\n if y[i] % 2 != 0:\r\n odd.append(i+1)\r\n else:\r\n even.append(i+1)\r\nif len(even) > len(odd):\r\n print(*odd)\r\nelse:\r\n print(*even)", "n = int(input())\nmy_list = input().split(\" \")\nfor x in range(len(my_list)):\n my_list[x] = int(my_list[x])\n\ndef even_or_odd(my_list):\n evens = 0\n odds = 0\n for element in my_list:\n if element % 2 == 0:\n evens += 1\n else:\n odds += 1\n if evens == 1:\n return True # even search\n else:\n return False # odd search\n\n\nx = even_or_odd(my_list)\n\nif x:\n for element in my_list:\n if element % 2 == 0:\n print(my_list.index(element)+1)\n break\nelse:\n for element in my_list:\n if element % 2 == 1:\n print(my_list.index(element)+1)\n break \n\n\t\t\t\t\t\t\t\t\t\t\t \t \t \t\t\t\t\t\t\t\t \t\t", "n=int(input())\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nji=0\r\nou=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n ou+=1\r\n else:\r\n ji+=1\r\nif ou>1:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\n break\r\nelif ji>1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break", "from sys import stdin\r\nq = [[int(y) for y in x.rstrip().split()] for x in stdin.readlines()][1]\r\nl0,l1=[],[]\r\nfor i,x in enumerate(q):\r\n if x%2:\r\n l1.append(i+1)\r\n else:\r\n l0.append(i+1)\r\nprint ((l0[0],l1[0])[len(l1)<len(l0)])", "input()\r\nL = list(map(int,input().split()))\r\ne = [x for x in L if x%2==0]\r\no = [x for x in L if x%2==1]\r\nprint(L.index(e[-1])+1 if len(e)<len(o) else L.index(o[-1])+1)\r\n", "n = int(input())\r\narr = input()\r\narr = arr.split()\r\narr2=[]\r\nfor i in arr:\r\n arr2.append(int(i)%2)\r\nif arr2.count(1)==1:\r\n print(arr2.index(1)+1)\r\nelse:\r\n print(arr2.index(0)+1)", "n=int(input())\r\ns=input().split()\r\na=''\r\nfor i in range(n):\r\n a=a+str(int(s[i])%2)\r\nif a.count('0')==1:\r\n print(a.find('0')+1)\r\nelse:\r\n print(a.find('1')+1)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nevens = 0\r\nodds = 0\r\nfor i in range(n):\r\n if l[i] % 2==0:\r\n evens+=1\r\n else:\r\n odds+=1\r\n#print(evens,odds)\r\nif evens == 1:\r\n for i in range(len(l)):\r\n if l[i]%2 == 0:\r\n print(i+1)\r\n break\r\nelse:\r\n #print(\"hi\")\r\n for i in range(len(l)):\r\n if l[i]%2 != 0:\r\n print(i+1) \r\n break \r\n", "n = int(input())\r\na = list(map(int , input().split()))\r\neven = []\r\nodd = []\r\nfor pos , val in enumerate(a):\r\n if val % 2 == 0:\r\n even.append(pos+1)\r\n else:\r\n odd.append(pos+1)\r\nif len(even) == 1:\r\n print(even[0])\r\nelse:\r\n print(odd[0])\r\n ", "s = int(input())\r\nl=list()\r\nl=input().split()\r\nodd=0\r\neven=0\r\n\r\nfor i in range(3):\r\n if int(l[i]) %2!=0:\r\n odd=odd+1\r\n else:\r\n even=even+1\r\nif even>odd:\r\n for i in range(len(l)):\r\n if int(l[i])%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(l)):\r\n if int(l[i])%2==0:\r\n print(i+1)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nm=[]\r\nfor i in l:\r\n m.append(i%2)\r\nprint(m.index(sum(m)==1)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nif a[0] % 2 != a[1] % 2 == a[2] % 2:\r\n print(1)\r\nelif a[-1] % 2 != a[-2] % 2 == a[-3] % 2:\r\n print(n)\r\nelse:\r\n for i in range(1, n-1):\r\n if a[i] % 2 != a[i-1] % 2 == a[i+1] % 2:\r\n print(i+1)", "def main():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n chet=0\r\n nec=0\r\n for i in range(0,n):\r\n if a[i]%2==0:\r\n chet=chet+1\r\n m=i\r\n elif a[i]%2==1:\r\n nec=nec+1\r\n q=i\r\n if nec>1 and chet==1:\r\n print(m+1)\r\n break\r\n elif chet>1 and nec==1:\r\n print(q+1)\r\n break\r\nif __name__=='__main__':\r\n main()\r\n ", "n=int(input())\r\nb=0\r\na=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n b+=1\r\nif b==1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1);break\r\nelse:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n print(i+1);break", "n = int(input())\nns = list(map(int, input().split()))\n\nxs = [i for i, k in enumerate(ns) if k % 2 == 0]\nys = [i for i, k in enumerate(ns) if k % 2 != 0]\nzs = xs if len(xs) == 1 else ys\nprint(zs[0] + 1)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nS=[i+1 for i in range(n) if l[i]%2==0]\r\nS1=[i+1 for i in range(n) if l[i]%2!=0]\r\nif len(S1)==1:\r\n print(S1[0])\r\nelse:\r\n print(S[0])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 4 15:20:28 2021\r\n\r\n@author: wlt52\r\n\"\"\"\r\n\r\na = int(input())\r\nb = input().split()\r\nb = [int(x) for x in b]\r\nc = [x%2 for x in b]\r\n\r\nif c.count(0) == 1:\r\n print(c.index(0) + 1)\r\nelse:\r\n print(c.index(1) + 1)\r\n ", "n = int(input())\r\nnums = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\ncounter1 = 0\r\ncounter2 = 0\r\nfor i in range(len(nums)):\r\n if nums[i]%2 == 0:\r\n counter1+=1\r\n even = i+1\r\n else:\r\n counter2+=1\r\n odd = i+1\r\n \r\nif counter1 == 1:\r\n print(even)\r\nelse:\r\n print(odd)", "n=int(input())\r\na=list(map(int, input().split()))\r\ne=o=0\r\nfor i in a:\r\n if i%2==0:\r\n e=e+1\r\n else:\r\n o=o+1\r\nif e==1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\n break", "input();l1,l2=[],[]\r\nfor i,v in enumerate(input().split()):\r\n if int(v)%2:l1+=[i+1]\r\n else:l2+=[i+1]\r\nprint(l1[0] if len(l1)==1 else l2[0])", "a=int(input())\r\nb=list(map(int,input().split()))\r\nodd,even=0,0\r\nfor x in range(3):\r\n if b[x]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even>odd:\r\n for y in range(a):\r\n if b[y]%2!=0:\r\n print(b.index(b[y])+1)\r\n break\r\nelse:\r\n for y in range(a):\r\n if b[y]%2==0:\r\n print(b.index(b[y])+1)\r\n break", "def eveness(li):\r\n for i in range(0,(len(li)-2)):\r\n if (li[i]%2==li[i+1]%2) and (li[i+1]%2==li[i+2]%2):\r\n pass\r\n else:\r\n if (li[i]%2==li[i+1]%2) and (li[i+1]%2!=li[i+2]%2):\r\n return i+3\r\n elif (li[i]%2!=li[i+1]%2) and (li[i+1]%2==li[i+2]%2):\r\n return i+1\r\n else:\r\n return i+2\r\n \r\nn=input()\r\nm=list(map(int,input().split(\" \")))\r\nprint(eveness(m))", "input()\n\nnums = list(map(int, input().split()))\n\nevenSeen = oddSeen = False\nevenOut = oddOut = False\n\nfor x in range(len(nums)):\n if nums[x] % 2 == 0:\n if evenOut:\n print(x + 1)\n break\n if evenSeen:\n if oddSeen:\n print(oddPos + 1)\n break\n else:\n oddOut = True\n else:\n evenSeen = True\n evenPos = x\n else:\n if oddOut:\n print(x + 1)\n break\n if oddSeen:\n if evenSeen:\n print(evenPos + 1)\n break\n else:\n evenOut = True\n else:\n oddSeen = True\n oddPos = x\n", "def get_result(arr):\r\n even = []\r\n odd = []\r\n for i in arr:\r\n if i % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n if len(even) == 1:\r\n result = arr.index(even[0])\r\n else:\r\n result = arr.index(odd[0])\r\n return result + 1\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = [int(x) for x in input().split()]\r\n print(get_result(arr))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "num_nums = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\neven, odd = [], []\r\n\r\nfor i in nums:\r\n if i % 2 == 1:\r\n odd.append(i)\r\n else:\r\n even.append(i)\r\n\r\nif len(even) == 1:\r\n print(nums.index(even[0])+1)\r\nelse:\r\n print(nums.index(odd[0])+1)", "n=int(input())\r\nb=*map(int,input().split()),\r\na,k=[0,0],0\r\nfor i in range(n):\r\n a[b[i]%2]=i+1\r\n k+=b[i]%2\r\nprint(a[k==1])\r\n ", "h=int(input())\r\na=list(map(int,input().split()))\r\nif a[0]%2==0 and a[1]%2==0 or a[0]%2==0 and a[2]%2==0 or a[1]%2==0 and a[2]%2==0:\r\n b=0\r\nelse:\r\n b=1\r\nfor i in range(h):\r\n if a[i]%2!=b:\r\n print(i+1)\r\n break\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=[x%2 for x in l]\r\n\r\ne=l.index(0)\r\no=l.index(1)\r\n\r\nif 0 not in l[e+1:]:\r\n print(e+1)\r\nelse:\r\n print(o+1)\r\n\r\n", "n = int(input())\r\nnum = list(map(int, input().split()))\r\n\r\nec = 0\r\noc = 0\r\nei = 0\r\noi= 0\r\n\r\nfor i in range(n):\r\n if num[i] % 2 == 0:\r\n ec += 1\r\n ei = i + 1\r\n else:\r\n oc += 1\r\n oi = i + 1\r\n\r\nif ec > 1:\r\n print(oi)\r\nelse:\r\n print(ei)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n l[i]=l[i]%2\r\nif l.count(0)==1:\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)", "num=int(input())\r\n\r\nb=[int(x)%2 for x in input().split()] \r\nif b.count(1)==1:\r\n c=b.index(1)\r\nelse:\r\n c=b.index(0)\r\n \r\nprint(c+1) ", "value = int(input())\r\nvalues = input()\r\nvalues = values.split()\r\nvalues = [int(i)%2 for i in values]\r\nif values.count(1)>values.count(0):\r\n print(values.index(0) + 1)\r\nelse:\r\n print(values.index(1) + 1)\r\n", "n=int(input())\r\nlista=input()\r\nlista=lista.split()\r\np=0\r\ni=0\r\nfor k in range(n):\r\n if int(lista[k])%2==0:\r\n p+=1\r\n else:\r\n i+=1\r\nfor k in range(n):\r\n if p>i :\r\n if int(lista[k])%2==1:\r\n print(k+1)\r\n break\r\n else:\r\n if int(lista[k])%2==0:\r\n print(k+1)\r\n break", "a=int(input())\r\nb=list(map(int,input().split()))\r\nchetn=0\r\nnechetn=0\r\nfor k in b:\r\n if k%2==0:\r\n chetn+=1\r\n else:\r\n nechetn+=1\r\nif chetn==1:\r\n for l in range(a):\r\n if b[l]%2==0:\r\n print(l+1)\r\nelse:\r\n for i in range(a):\r\n if b[i]%2==1:\r\n print(i+1)", "n = int(input())\r\nnum = list(map(int, input().split(' ')))\r\nnum_01 = [i%2 for i in num] # only have 0 and 1\r\nif num_01.count(0) == 1:\r\n print(num_01.index(0)+1)\r\nelse:\r\n print(num_01.index(1)+1)", "n=int(input())\r\nlist1=[int(i) for i in input().split()]\r\nt=0\r\ns=0\r\nfor i in list1:\r\n if i%2==0:\r\n t +=1\r\nif t==1:\r\n for i in list1:\r\n s +=1\r\n if i%2==0:\r\n break\r\nelse:\r\n for i in list1:\r\n s +=1\r\n if i%2!=0:\r\n break\r\nprint(s)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[]\r\ny=[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n x.append(i)\r\n else:\r\n y.append(i)\r\nif len(x)==1:\r\n print(x[0]+1)\r\nelif len(y)==1:\r\n print(y[0]+1)", "n=int(input())\ncount_chet=0\ncount_nechet=0\na=list(map(int,input().split()))\nfor i in range(1,n+1):\n if a[i-1]%2==0: #выводится четное\n count_chet+=1\n else:\n count_nechet+=1\n\nif count_chet>count_nechet:\n for i in range(1,n+1):\n if a[i-1]%2!=0:\n print(i)\n \nelse:\n for i in range(1,n+1):\n if a[i-1]%2==0:\n print(i)", "n = int(input())\r\nt = [int(x) for x in input().split(\" \")]\r\ne, o = 0, 0\r\na = []\r\nfor i in range(len(t)):\r\n if t[i] % 2 != 0:\r\n o += 1\r\n else:\r\n e += 1\r\n\r\nif e > o:\r\n for i in range(len(t)):\r\n if t[i] % 2 != 0:\r\n a.append(i)\r\nelse:\r\n for i in range(len(t)):\r\n if t[i] % 2 == 0:\r\n a.append(i)\r\n\r\nprint(min(a) + 1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nlastodd,lasteven = 0,0\r\n\r\neven = 0\r\n\r\nfor i in range(0,len(arr)):\r\n if arr[i]%2 == 0:\r\n even+=1\r\n lasteven = i\r\n else:\r\n even-=1\r\n lastodd = i\r\n \r\nif even>0:\r\n print(lastodd+1)\r\nelse:\r\n print(lasteven+1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\neven = []\r\nodd =[]\r\nfor i in range(n):\r\n if arr[i]%2 == 0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\nif len(even) < len(odd):\r\n print(*even)\r\nelse:\r\n print(*odd)", "par, impar = 0, 0\npos = -1\nn = int(input())\nlist = input().split()\nfor i in range(3):\n if int(list[i]) % 2 == 0:\n par = par + 1\n else:\n impar = impar + 1\nfor i in range(n):\n aux = int(list[i]) % 2\n if par > impar:\n if aux != 0:\n print(i+1)\n break\n else:\n if aux == 0:\n print(i+1)\n break\n\n\n\n\t\t\t \t\t\t \t \t\t \t \t \t\t \t\t\t", "m = input()\r\nn = [int(i)for i in input().split()]\r\nchet = 0\r\nnechet = 0\r\nind_c = 0\r\nind_nc = 0\r\nstart = 0\r\nfor i in range(len(n)):\r\n if n[i] % 2 == 1 and (nechet<=1 or chet<=1):\r\n nechet+=1\r\n ind_nc = i+1\r\n elif n[i] % 2 == 0 and (nechet<=1 or chet<=1):\r\n chet+=1\r\n ind_c = i+1\r\n else:\r\n if nechet > chet:\r\n print(ind_c)\r\n else:\r\n print(ind_nc)\r\n break\r\n if nechet > chet and i == len(n)-1:\r\n print(ind_c)\r\n elif i == len(n)-1:\r\n print(ind_nc)\r\n break", "n = int(input())\r\nevenness = list(int(i) % 2 for i in input().split())\r\nif sum(evenness) == n-1 :\r\n print(evenness.index(0)+1)\r\nelse:\r\n print(evenness.index(1)+1)", "n = int(input())\r\nm = list(map(int, input().split()))\r\no = 0 # 홀수\r\ne = 0 # 짝수\r\n\r\nfor i in range(n):\r\n if m[i] % 2 == 0:\r\n e += 1\r\n else:\r\n o += 1\r\n\r\nif o > e:\r\n for i in range(n):\r\n if m[i] % 2 == 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if m[i] % 2 != 0:\r\n print(i + 1)", "n = int(input())\r\nb = list(map(int, input().split()))\r\nch_c = 0\r\nch = 10 ** 10\r\nnch_c = 0\r\nnch = 10 ** 10\r\n\r\nfor i in range(n):\r\n if b[i] % 2:\r\n ch_c += 1\r\n if ch == 10 ** 10:\r\n ch = i + 1\r\n else:\r\n nch_c += 1\r\n if nch == 10 ** 10:\r\n nch = i + 1\r\n\r\nif ch_c == 1:\r\n print(ch)\r\nelse:\r\n print(nch)\r\n", "a, b = int(input()), input().split()\r\nb = [int(i) for i in b]\r\nch = 0\r\nnch = 0\r\npch = 0\r\npnch = 0\r\nfor i in range(a):\r\n if b[i] % 2 == 0:\r\n if ch == 0:\r\n pch = i + 1 \r\n ch += 1\r\n if b[i] % 2 == 1:\r\n if nch == 0:\r\n pnch = i + 1 \r\n nch += 1\r\nif ch != 1:\r\n print(pnch)\r\nelse:\r\n print(pch)", "n = int(input())\r\narray = list(map(int, input().split()))\r\nevecount = 0\r\nlodd = -1; leven = -1;\r\nfor i in range(n):\r\n this = array[i]\r\n if this % 2 == 0:\r\n evecount += 1\r\n leven = i+1\r\n else:\r\n lodd = i+1\r\n\r\nif evecount == 1:\r\n print(leven)\r\nelse:\r\n print(lodd)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nq=0\r\nw=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n q+=1\r\n else:\r\n w+=1\r\nif q==1:\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n \r\n \r\n", "a=int(input())\r\ns=[int(x) for x in input().split()]\r\nfor j in range(a):\r\n if s[j]%2==0:\r\n s[j]=1\r\n else:\r\n s[j]=0\r\nif s.count(0)==1:\r\n print(s.index(0)+1)\r\nelif s.count(1)==1:\r\n print(s.index(1)+1)\r\n", "def dif(n,num):\n if num[0]%2 == num[1]%2:\n dif = (num[0]+1)%2\n for i in range(2,n):\n if num[i]%2==dif:\n return(i+1)\n else:\n if num[0]%2 == num[2]%2:\n return(2)\n else:\n return(1)\n \ndef main():\n n = int(input())\n num = input().split()\n num = [int(x) for x in num]\n print(dif(n,num))\n\nmain()\n", "n=int(input())\r\na=list(map(int, input().rstrip().split()))\r\nb=[]\r\nc=[]\r\nfor _ in range(len(a)):\r\n if a[_]%2==0:\r\n b.append(_+1)\r\n else:\r\n c.append(_+1)\r\nif len(b)>len(c):\r\n print(c[0])\r\nelse:\r\n print(b[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\ns1=0\r\ns2=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n s1+=1\r\n x=i+1\r\n else:\r\n s2+=1\r\n y=i+1\r\nif(s1>s2):\r\n print(y)\r\nelse:\r\n print(x)", "n=int(input())\r\nl = list(map(int,input().split()))\r\nc=0\r\nieven=0\r\niodd=0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n c+=1 \r\n ieven+=i\r\n else:\r\n iodd+=i \r\nif c==1:\r\n print(ieven+1)\r\nelse:\r\n print(iodd+1)\r\n", "n = int(input())\nm = [int(i) for i in input().split()]\n\nh = []\nnh = []\n\nfor i in range(n):\n if m[i] & 1 == 0:\n h.append(i)\n else:\n nh.append(i)\n\nif len(h) > len(nh):\n print(nh[0] + 1)\nelse:\n print(h[0] + 1)\n\n", "n = int(input())\r\nnumbers = [int(i) for i in input().split(' ')]\r\nodds = []\r\nevens = []\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n evens.append(i)\r\n else:\r\n odds.append(i)\r\nif len(odds) == 1:\r\n print(odds[0]+1)\r\nelse:\r\n print(evens[0]+1)", "input()\nx = [int(i)%2 for i in input().split()]\nif sum(x) == 1:\n print(x.index(1)+1)\nelse:\n print(x.index(0)+1)\n \t\t \t\t\t \t\t\t\t \t \t \t \t\t\t\t\t \t\n\t \t\t\t\t\t \t \t\t\t \t\t \t \t\t", "n = int(input())\r\na = list(map(lambda s: int(s) & 1, input().split()))\r\n\r\nval = 1 if sum(a) == 1 else 0\r\n\r\nprint(a.index(val) + 1)\r\n", "n=int(input())\r\ne=0\r\no=0\r\na=list(map(int,input().split(' ')[:n]))\r\nfor i in range(0,n):\r\n if(a[i]%2==0):\r\n e=e+1\r\n else:\r\n o=o+1\r\nif(e==1):\r\n for i in range(0,n):\r\n if(a[i]%2==0):\r\n print(i+1)\r\nelif(o==1):\r\n for i in range(0,n):\r\n if(a[i]%2!=0):\r\n print(i+1)", "def IQ(n): \r\n \r\n l = [int(i)%2 for i in input().split()]\r\n d = {}\r\n \r\n \r\n for i in l: \r\n if i not in d: \r\n d[i] = 1\r\n else : \r\n d[i] += 1\r\n \r\n for i in d: \r\n if d[i] == 1: \r\n n = i\r\n \r\n \r\n \r\n for i in range(len(l)): \r\n if l[i] == n: \r\n return i + 1\r\n \r\nn = int(input())\r\nprint(IQ(n))", "n = int(input())\r\nm = list(map(int,input().split()))\r\na,b = 0,0\r\nfor i in range(n):\r\n if m[i]%2 == 0 :\r\n a = a+1\r\n else :\r\n b = b + 1\r\nif a == 1 :\r\n for i in range(n):\r\n if m[i]%2 == 0 :\r\n print(i+1)\r\nif b == 1 :\r\n for i in range(n):\r\n if m[i]%2 != 0 :\r\n print(i+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif a[0]%2!=a[1]%2 and a[1]%2==a[-1]%2:\r\n print(1)\r\nelse:\r\n for i in range(len(a)-1):\r\n if a[i]%2!=a[i+1]%2:\r\n print(i+1+1)\r\n break\r\n \r\n", "n=int(input())\r\nS=[int(x)%2 for x in input().split()]\r\nif sum(S)>=2:\r\n\tfor y in range(n):\r\n\t\tif S[y]==0:\r\n\t\t\tprint(y+1)\r\nelse:\r\n\tfor y in range(n):\r\n\t\tif S[y]==1:\r\n\t\t\tprint(y+1)", "n = int(input())\r\nb = list(map(int,input().split()))\r\nfor i in range(len(b)):\r\n b[i] = b[i]%2\r\nif sum(b) == len(b)-1:\r\n for i in range(len(b)):\r\n if b[i] == 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(b)):\r\n if b[i] == 1:\r\n print(i+1)\r\n break\r\n", "input()\r\na=list(map(int,input().split()))\r\nq=0\r\nw=0\r\nfor i in range(len(a)):\r\n if a[i]%2==1:\r\n q+=1\r\n q1=i+1\r\n else:\r\n w+=1\r\n w1=i+1\r\n if q>1 and w==1 or w>1 and q==1:\r\n break\r\nif q==1:\r\n print(q1)\r\nelse:\r\n print(w1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=[]\r\nq=[]\r\ne=0\r\nf=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n e=e+1\r\n p.append(i+1)\r\n else:\r\n f=f+1\r\n q.append(i+1)\r\nif(e==1):\r\n for j in p:\r\n print(j)\r\nelse:\r\n for k in q:\r\n print(k)", "x = int(input())\r\ny = input()\r\nnumbers = y.split()\r\nnumbers = list(map(int,numbers))\r\neven = 0\r\nodd = 0\r\none = 0\r\ntwo = 0\r\nfor i in numbers:\r\n if i%2 == 0:\r\n even = even +1\r\n two = i\r\n if i%2 == 1:\r\n odd = odd + 1\r\n one = i\r\nif odd == 1:\r\n print(numbers.index(one)+1)\r\nelse:\r\n print(numbers.index(two)+1)", "n=int(input())\r\nl=[int(i) for i in input ().split()]\r\ncheck=0\r\na,b,c=l[0],l[1],l[2]\r\nq=a%2\r\nw=b%2\r\ne=c%2\r\nl2=[q,w,e]\r\none=l2.count(1)\r\nif one >=2:\r\n check=1\r\nans=-1\r\nfor i in range(n):\r\n if l[i]%2!=check:\r\n ans=i+1\r\n break\r\n\r\nprint(ans)\r\n", "n=int(input())\narr=list(map(int,input().split()))\nodd=0\neven=0\neven_arr=[]\nodd_arr=[]\nfor i in arr:\n if i%2==0:\n even +=1\n even_arr.append(i)\n else:\n odd +=1\n odd_arr.append(i)\nif even==1:\n print(arr.index(even_arr[0])+1)\nelse:\n print(arr.index(odd_arr[0])+1)", "n =int(input())\r\nlists = [int(x) for x in input().split()]\r\ns = 0\r\nif lists[0] % 2 == 0:\r\n s = s + 1\r\nif lists[1] % 2 == 0:\r\n s = s + 3\r\nif s == 0:\r\n for i in range(n):\r\n if lists[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\nelif s == 1:\r\n if lists[2] % 2 == 0:\r\n print(2)\r\n else:\r\n print(1)\r\nelif s == 3:\r\n if lists[2] % 2 == 0:\r\n print(1)\r\n else:\r\n print(2)\r\nelse:\r\n for i in range(n):\r\n if lists[i] % 2 != 0:\r\n print(i + 1)\r\n break", "a=int(input())\r\nn=list(map(int,input().split()))\r\nchet=0\r\nnechet=0\r\nfor i in n:\r\n if i%2==0:\r\n chet+=1\r\n else:\r\n nechet+=1\r\nif chet>nechet:\r\n for i in n:\r\n if i%2!=0:\r\n print(n.index(i)+1)\r\nelse:\r\n for i in n:\r\n if i%2==0:\r\n print(n.index(i)+1)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Dec 25 17:37:51 2018\n\n@author: LX\n\"\"\"\n\nn = int(input())\nnum = list(map(int, input().split()))\nx = 0\nfor i in range(n):\n if num[i]%2 == 0:\n x += 1\nif x > 1:\n for i in range(n):\n if num[i]%2 != 0:\n print(num.index(num[i])+1)\nelse:\n for i in range(n):\n if num[i]%2 == 0:\n print(num.index(num[i])+1)", "n=int(input())\r\nA=list(map(int,input().split()))\r\nm1=[]\r\nm2=[]\r\nfor a in A:\r\n if a%2:\r\n m1.append([a,A.index(a)+1])\r\n else:\r\n m2.append([a,A.index(a)+1])\r\nif len(m1)==1:\r\n print(m1[0][1])\r\nelif len(m2)==1:\r\n print(m2[0][1]) \r\n \r\n ", "n = int(input())\r\nevens, odds = [], []\r\ncounter = 1\r\n\r\nnumbers = [int(i) for i in input().split()]\r\n\r\nfor temp in numbers:\r\n if temp % 2 == 0:\r\n evens.append(counter)\r\n else:\r\n odds.append(counter)\r\n counter += 1\r\n\r\nprint(evens[0] if len(evens) == 1 else odds[0])", "n = int(input())\r\ns = list(map(int,input().split(' ')))\r\na = []\r\n\r\n\r\nfor i in range(n):\r\n a.append(s[i]%2)\r\n if a[i] != a[i-1]:\r\n print([i+1,i][s[i-2]%2==a[i]])\r\n break\r\n \r\n", "input()\r\nnumbers = [int(n) % 2 for n in input().split()]\r\n\r\nprint(numbers.index(sum(numbers) == 1) + 1)", "n=int(input())\r\na=[int(num) for num in input().split()]\r\nx1=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n x1+=1\r\nfor i in range(n):\r\n if x1>=2:\r\n if a[i]%2==1:\r\n print(i+1) \r\n else:\r\n if a[i]%2==0:\r\n print(i+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nst = [0] * n\r\nfor i in range(n):\r\n st[i] = s[i] % 2\r\n\r\nif sum(st) == 1: print(st.index(1)+1)\r\nelse: print(st.index(0)+1)", "n=int(input())\r\nd=list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor i in d:\r\n if i%2==0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif len(o)>len(e):\r\n p=d.index(e[0])\r\n print(p+1)\r\nelse:\r\n p=d.index(o[0])\r\n print(p+1)", "n,r=int(input()),list(map(int,input().split()))\neven= True if sum([r[i]%2==0 for i in range(3)]) > 1 else False\nfor x in range(n):\n if r[x]%2==1 and even:\n print(x+1)\n break\n elif r[x]%2==0 and not even:\n print(x+1)\n break", "s=int(input())\r\nx=[int(x) for x in input().split(' ')]\r\nfor i in range(0,len(x)):\r\n if x[i]%2==0:\r\n x[i]=0\r\n else:\r\n x[i]=1\r\n \r\nif x.count(1)==1:\r\n print(x.index(1)+1)\r\nelif(x.count(0)==1):\r\n print(x.index(0)+1)\r\n ", "def findwhat(arr):\r\n cnt = 0\r\n for i in range(3):\r\n if(arr[i] % 2):\r\n cnt += 1\r\n if(cnt > 1):\r\n return 0\r\n return 1\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ntemp = findwhat(arr)\r\nif(temp):\r\n for i in range(n):\r\n if(arr[i] % 2):\r\n print(i + 1, end = '')\r\n break\r\nelse:\r\n for i in range(n):\r\n if(arr[i] % 2 == 0):\r\n print(i + 1, end = '')\r\n break", "n=int(input())\r\nt=input().split()\r\nbi=''\r\nfor i in range(n):\r\n bi+=str(int(t[i])%2)\r\nif bi.count('0')==1:\r\n print(bi.find('0')+1)\r\nelse:\r\n print(bi.find('1') + 1)", "n = int(input())\nnumbers = [int(i) for i in input().split()]\n\npar = []\nimpar = []\n\nfor i in range(n):\n if numbers[i]%2 == 0:\n par.append(i)\n else:\n impar.append(i)\n\nprint(par[0] + 1) if len(par) == 1 else print(impar[0] + 1)\n \t\t \t\t \t\t\t\t\t \t \t \t \t\t\t", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nb=[]\r\nc=[]\r\nfor i in a:\r\n if(i%2==0):\r\n b.append(i)\r\n else:\r\n c.append(i)\r\n\r\nif(len(b)==1):\r\n for i in range(0,n):\r\n if(a[i]==b[0]):\r\n print(i+1)\r\n\r\n\r\nelse:\r\n for i in range(0,n):\r\n if(a[i]==c[0]):\r\n print(i+1)\r\n \r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ne=0\r\ne1=0\r\no=0\r\no1=0\r\nc =1\r\nfor i in range(n):\r\n if a[i]%2 == 0:\r\n e += 1\r\n e1=c\r\n else:\r\n o += 1\r\n o1=c\r\n c+=1\r\nif o == 1:\r\n print(o1)\r\nelse:\r\n print(e1)", "n = int(input())\r\nseq = list(map(lambda x : int(x) % 2, input().split()))\r\nif seq.count(1) == 1:\r\n print(seq.index(1) + 1)\r\nelse:\r\n print(seq.index(0) + 1)", "x = int(input())\r\ny = [int(z) for z in input().split()]\r\no, e = [], []\r\nfor z in range(len(y)):\r\n o.append(z+1) if y[z] % 2 else e.append(z+1) \r\nprint(o[0] if len(o) == 1 else e[0])", "import io, os, sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n# get input and decode it\r\ndef inp():\r\n return input().decode()\r\n\r\n# sys.stdout.write() is a faster version of print()\r\ndef sswrite(val):\r\n sys.stdout.write(str(val) + '\\n')\r\n\r\ndef intmap():\r\n return map(int, inp().split(' '))\r\n\r\n# instruction of this question was too unclear\r\n\r\ndef solve(n,l):\r\n evens = odds = e_idx = o_idx = 0\r\n for i in range(n):\r\n if l[i] % 2:\r\n odds += 1\r\n o_idx += i+1\r\n else:\r\n evens += 1\r\n e_idx += i+1\r\n if evens > 1 and odds:\r\n return o_idx\r\n if odds > 1 and evens:\r\n return e_idx\r\n\r\n \r\nn = int(inp())\r\nl = list(intmap())\r\nsswrite(solve(n, l))", "n = int(input())\r\nlist1 = list(map(int,input().split()))\r\nif list1[0] % 2 != list1[1] % 2:\r\n if list1[1] % 2 != list1[2] % 2:\r\n print(\"2\")\r\n else:print(\"1\")\r\nelse:\r\n for i in range(1,n-1):\r\n if list1[i] % 2 != list1[i+1] % 2:\r\n print(i+2)\r\n break", "n=int(input())\r\np=input().split()\r\np=list(map(int,p))\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n q=p[i]%2\r\n if q==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nn1=a.__len__()\r\nn2=b.__len__()\r\nif n1>n2:\r\n print(b[0]+1)\r\nelse:\r\n print(a[0]+1)", "n=int(input())\r\nl=[int(j) for j in input().split()]\r\nif l[0]%2==0:\r\n if l[1]%2==0:\r\n flag=0\r\n else:\r\n if l[2]%2==0:\r\n print(2)\r\n flag=2\r\n else:\r\n print(1)\r\n flag=2\r\nelse:\r\n if l[1]%2==1:\r\n flag=1\r\n else:\r\n if l[2]%2==1:\r\n print(2)\r\n flag=2\r\n else:\r\n print(1)\r\n flag=2\r\nif flag!=2:\r\n for i in range(2,n):\r\n if l[i]%2!=flag:\r\n print(i+1)\r\n break\r\n", "n = int(input())\narr = list(map(int, input().split()))\nodd_indices, even_indices = [], []\nfor i in range(n):\n if arr[i] % 2 == 0:\n even_indices.append(i)\n else:\n odd_indices.append(i)\nif len(odd_indices) == 1:\n print(odd_indices[0] + 1)\nelse:\n print(even_indices[0] + 1)", "n = int(input())\nnumbers_str = input().split()\nnumbers = []\nfor i in range(n):\n numbers.append(int(numbers_str[i]))\n\nparidade_primeiro = numbers[0] % 2\nparidade_segundo = numbers[1] % 2\n\nif paridade_primeiro == paridade_segundo:\n for i in range(2, n):\n if numbers[i] % 2 != paridade_primeiro:\n different = i + 1\n\nelse:\n for i in range(2, n):\n if numbers[i] % 2 == paridade_primeiro:\n different = 2\n else:\n different = 1\n \nprint(different)\n \t\t\t \t \t \t \t \t \t\t \t \t \t\t", "n = int(input())\r\n\r\nl = [int(x) for x in input().split()]\r\nl1= []\r\nl2 =[]\r\n\r\n\r\nfor elt in l:\r\n if elt % 2 == 0:\r\n l1.append(elt)\r\n\r\n else:\r\n l2.append(elt)\r\nif len(l1)< len(l2):\r\n print(l.index(l1[0])+1)\r\nelse:\r\n print(l.index(l2[0])+1)", "import io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\nn = int(inp())\na = list(map(int, inp().split()))\nm = [0] * n\nfor i in range(n):\n m[i] = a[i] % 2\npos = m.index(0) if sum(m) > 1 else m.index(1)\nprint(pos + 1)\n", "itemsnum=int(input())\r\nevencounter=0\r\n\r\n#getting the items\r\nitems=input()\r\nitemslist=items.split()\r\n\r\n#finding out the main type\r\nfor i in range (0,itemsnum):\r\n itemslist[i]=int(itemslist[i])\r\n if itemslist[i]%2==0:\r\n evencounter+=1\r\n\r\n\r\nif evencounter>1:\r\n for i in range (0,itemsnum):\r\n if itemslist[i]%2==1:\r\n print(i+1)\r\nelse:\r\n for i in range (0,itemsnum):\r\n if itemslist[i]%2==0:\r\n print(i+1)\r\n", "n=int(input())\r\nv1=[]\r\nv2=[]\r\nx=[int(j) for j in input().split()]\r\nfor i in range(len(x)):\r\n if(x[i]%2!=0):\r\n v1.append(x[i])\r\n else:\r\n v2.append(x[i])\r\nif(len(v1)<len(v2)):\r\n print(x.index(v1[0])+1)\r\nelse:\r\n print(x.index(v2[0])+1)\r\n ", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nlist1=[]\r\nfor i in list:\r\n\tlist1.append(i%2)\r\nif list1[0]==list1[1]:\r\n\tfor i in list1:\r\n\t\tif i!=list1[0]:\r\n\t\t\tprint(list1.index(i)+1)\r\nelse:\r\n\tif list1[0]==list1[2]:\r\n\t\tprint(2)\r\n\telse:\r\n\t\tprint(1) ", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\ntwo_devide= []\r\nthree_devide = []\r\ncount = 0\r\n\r\nfor i in li :\r\n if i%2 == 0 :\r\n two_devide.append(i)\r\n else :\r\n three_devide.append(i)\r\n\r\nif len(two_devide) > len(three_devide) :\r\n for j in three_devide:\r\n count += j\r\n\r\n print(li.index(count)+1)\r\n\r\nelse :\r\n for j in two_devide:\r\n count += j\r\n print(li.index(count)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nodd, even = [], []\r\nfor i in range(n):\r\n if a[i]%2 == 0:\r\n even.append([a[i], i])\r\n else:\r\n odd.append([a[i], i])\r\n \r\nif len(even) == 1:\r\n print(even[0][1] + 1)\r\nelse:\r\n print(odd[0][1] + 1)\r\n", "input()\n\na = list(map(int, input().split()))\n\neven = []\nodd = []\n\nfor i in a:\n\tif i % 2 == 0:\n\t\teven.append(i)\n\telse:\n\t\todd.append(i)\n\nif len(even) == 1:\n\tprint(a.index(even[0])+1)\nelse:\n\tprint(a.index(odd[0])+1)\n\t\t \t\t \t \t\t\t\t \t\t", "input()\nnums = [int(k) for k in input().split()]\n\nodd_count = 0\neven_count = 0\n\nfor k in nums:\n if k % 2 == 0:\n even_count += 1\n else:\n odd_count += 1\n\nfor i in range(len(nums)):\n if (even_count > odd_count and nums[i] % 2 == 1) or \\\n odd_count > even_count and nums[i] % 2 == 0:\n print(i + 1)\n\n \t\t\t \t \t \t\t\t \t\t \t\t \t \t\t", "size = int(input())\r\narr = list(map(int, input().split()))\r\n\r\n# If the majority is odd, then remainders >= 2, so \r\n# we are searching for a even.\r\nremainders = arr[0] % 2 + arr[1] % 2 + arr[2] % 2\r\nsearch_for = \"EVEN\" if remainders >= 2 else \"ODD\" \r\n\r\nfor index, el in enumerate(arr):\r\n if (el % 2 == 0 and search_for == \"EVEN\" or\r\n el % 2 == 1 and search_for == \"ODD\"):\r\n print(index+1)\r\n break", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = [i%2 for i in l]\r\nprint((d.index(1)+1) if d.count(1) == 1 else (d.index(0)+1))", "\"\"\"\nCodeForces IQ test\n\"\"\"\n\n\ndef main():\n input()\n numbers = [not bool(int(n)%2) for n in input().split()]\n\n current = not(numbers[0])\n if len([b for b in numbers if b]) ==1:\n print(numbers.index(True)+1)\n else:\n print(numbers.index(False)+1)\n\n\nmain()\n", "\"\"\"\r\nt=int(input())\r\nc=0\r\nfor i in range(t):\r\n l=[int(x) for x in input().split()]\r\n if(l.count(1)>1):\r\n c+=1\r\nprint(c)\r\n \r\n\r\nn,k=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nc=0\r\nfor i in l:\r\n if(i>=l[k-1] and i!=0 and i>0):\r\n c+=1\r\nprint(c)\r\n \r\nstring = input()\r\nvowels=('a', 'e', 'i', 'o', 'u','y')\r\nstring=string.lower()\r\nfor x in string:\r\n if x in vowels:\r\n string = string.replace(x, \"\")\r\nprint('.',end='')\r\nprint('.'.join(string)) \r\n \r\n\"\"\"\r\nn=int(input())\r\nl=[int(x) for x in input().split()]\r\ne=[]\r\no=[]\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n e.append(i+1)\r\n else:\r\n o.append(i+1)\r\nif(len(e)<len(o)):\r\n print(*e)\r\nelse:\r\n print(*o)\r\n", "n = int(input())\r\nnum1 = list(map(int, input().split()))\r\ncodd = 0\r\nceven = 0\r\nfor i in num1:\r\n if i % 2 == 0:\r\n ceven += 1\r\n else:\r\n codd += 1\r\n\r\nif ceven > codd:\r\n for i in num1:\r\n if i % 2 == 1:\r\n print(num1.index(i) + 1)\r\n\r\nelse:\r\n for i in num1:\r\n if i % 2 == 0:\r\n print(num1.index(i) + 1)", "n=int(input())\nl=map(int,input().split())\nji,jp=0,0\nou,op=0,0\nfor (p,i) in enumerate(l):\n\tif i%2==1:\n\t\tji+=1\n\t\tjp=p\n\telse:\n\t\tou+=1\n\t\top=p\nif ji==1:\n\tprint(jp+1)\nelse:\n\tprint(op+1)\n\n \t \t\t\t \t\t \t \t\t \t\t \t \t \t\t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\neven=0\r\ne=0\r\nodd=0\r\nod=0\r\nfor i in range(0,n):\r\n if l[i]%2==0:\r\n even=i\r\n e=e+1\r\n elif l[i]%2!=0:\r\n odd=i\r\n od=od+1\r\nif e==1:\r\n print(even+1)\r\nelse:\r\n print(odd+1)\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nimp = 0\r\npair = 0\r\n\r\nfor i in range(3):\r\n if l[i] % 2 == 0:\r\n pair += 1\r\n else:\r\n imp +=1\r\n\r\nif imp >= 2:\r\n for i in range(len(l)):\r\n if l[i]%2 == 0:\r\n print(i+1)\r\n break\r\n\r\n\r\nif pair >= 2:\r\n for i in range(len(l)):\r\n if l[i]%2 != 0:\r\n print(i+1)\r\n break\r\n", "even=[]\r\nodd=[]\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if x[i]%2==0: even.append(i)\r\n else: odd.append(i)\r\nif len(even)==1: print(even[0]+1)\r\nelif len(odd)==1: print(odd[0]+1)", "n=int(input())\nx=list(map(int,input().split()))\na=0\nfor i in range(len(x)):\n if x[i]%2==0:\n a+=1\nif a>=2:\n for j in range(len(x)):\n if(x[j]%2)!=0:\n print(j+1)\nelse:\n for j in range(len(x)):\n if(x[j]%2)==0:\n print(j+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\neo = [0,0]\r\nans = [0,0]\r\nfor i, it in enumerate(s):\r\n eo[it%2] += 1\r\n ans[it%2] = i+1\r\nprint(ans[0] if eo[0] == 1 else ans[1])", "n = input()\r\ns = input().split()\r\ns = list(map(int,s))\r\nodd = 0\r\neven = 0\r\nfor i in s:\r\n if i % 2 == 0:\r\n even += 1\r\n if i % 2 == 1:\r\n odd += 1\r\nif even == 1:\r\n for i in s:\r\n if i % 2 == 0:\r\n print(s.index(i)+1)\r\nelif odd == 1:\r\n for i in s:\r\n if i % 2 == 1:\r\n print(s.index(i)+1)", "from sys import stdin, stdout\n\n\nn = int(stdin.readline().strip())\n\nls_numbers = list(map(int, stdin.readline().strip().split()))\nrecent_even = None\nrecent_odd = None\n\na, b, c = ls_numbers[0], ls_numbers[1], ls_numbers[2]\n\nget_odd = lambda x: [j + 1 for j in range(len(x)) if x[j] % 2 == 1][0]\nget_even = lambda x: [j + 1 for j in range(len(x)) if x[j] % 2 == 0][0]\n\nassert get_even([1, 2, 1, 1]) == 2\nassert get_odd([2, 4, 7, 8, 10]) == 3\n\nif a % 2 == 0 and b % 2 == 0:\n stdout.write(str(get_odd(ls_numbers)))\nelif a % 2 == 1 and b % 2 == 1:\n stdout.write(str(get_even(ls_numbers)))\nelse:\n if c % 2 == 0:\n stdout.write(str(get_odd(ls_numbers)))\n else:\n stdout.write(str(get_even(ls_numbers)))\n\n", "n=int(input())\nnumber=[int(x) for x in input().split()]\nif number[0]%2==number[1]%2:\n for i in range(n):\n if number[i]%2!=number[0]%2:\n print(i+1)\n break\nelse:\n if number[0]%2==number[2]%2:\n print('2')\n else:\n print('1')\n \n \n\n \n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nodd = []\r\neven = []\r\n\r\nfor i in lst:\r\n if i % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(odd) == 1:\r\n print(lst.index(odd[0])+1)\r\nelse:\r\n print(lst.index(even[0])+1)", "n=input()\r\ni=list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\nfor l in i:\r\n if l%2==0:\r\n even.append(l)\r\n else:\r\n odd.append(l)\r\nif len(even)==1:\r\n print(i.index(even[0])+1)\r\nelif len(odd)==1:\r\n print(i.index(odd[0])+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\neIdx = oIdx = tEven = tOdd = 0\r\nfor i in range(n):\r\n if arr[i]%2:\r\n oIdx = i + 1\r\n tOdd += 1\r\n else:\r\n eIdx = i + 1\r\n tEven += 1\r\nprint(eIdx if tEven == 1 else oIdx)", "n = int(input())\nif n < 3 or n > 100 :\n pass\nelse :\n numbers = input().split()\n numbers = map(int, numbers)\n odd_index = 0\n even_index = 0\n odd_counter = 0\n even_counter = 0\n index = 1\n for i in numbers :\n if i % 2 == 0 :\n even_counter += 1\n even_index = index\n else : \n odd_counter += 1 \n odd_index = index\n index = index + 1\n if odd_counter > even_counter :\n print(even_index)\n else :\n print(odd_index)\n \t \t \t \t \t\t \t \t \t \t\t \t\t\t", "\r\nuser=int(input())\r\nL1= [int(x) for x in input().split(\" \")]\r\n\r\neven=0\r\nodd=0\r\n\r\nfor i in L1:\r\n if i%2==0:\r\n even=even+1\r\n else:\r\n odd=odd+1\r\n\r\nfor i in L1:\r\n if even<odd:\r\n if i%2==0:\r\n print(L1.index(i)+1)\r\n break\r\n else:\r\n if i%2!=0:\r\n print(L1.index(i)+1)\r\n break\r\n \r\n", "n=int(input())\r\ns=input().split()\r\na=[(int(s[i])%2==0) for i in range(0,n)]\r\nb=[0 for i in range(0,n)]\r\nfor i in range(0,n):\r\n if a[i]:\r\n b[i]=1\r\n else:\r\n b[i]=0\r\nif sum(b)==1:\r\n for i in range(0,n):\r\n if a[i]:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(0,n):\r\n if not a[i]:\r\n print(i+1)\r\n break\r\n", "t = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\neven = []\r\nodd = []\r\nfor number in numbers:\r\n if number % 2 == 0:\r\n even.append(number)\r\n else:\r\n odd.append(number)\r\nif len(odd) == 1:\r\n print(numbers.index(odd[0]) + 1)\r\nif len(even) == 1:\r\n print(numbers.index(even[0]) + 1)", "n=int(input())\r\ns=input().split()\r\nnb_p=0\r\nnb_imp=0\r\nfor i in range(len(s)):\r\n s[i]=int(s[i])\r\n if (s[i]%2==0):\r\n nb_p=nb_p+1\r\n else:\r\n nb_imp=nb_imp+1\r\nif (nb_p==1):\r\n for i in range(len(s)):\r\n if s[i]%2==0:\r\n print (i+1)\r\n break\r\nif (nb_imp==1):\r\n for i in range(len(s)):\r\n if s[i]%2==1:\r\n print (i+1)\r\n break\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\nk = 0\r\nc = 0\r\nfor i in range(0,len(x)):\r\n if x[i]%2 ==0:\r\n k = k + 1 \r\n f = i+1\r\n else:\r\n c = c +1\r\n q = i+1\r\n\r\nif k == 1:\r\n print(f)\r\nelse:\r\n print(q)", "n_numbers = int(input())\nnumbers = input().split()\nnumbers = [int(x) for x in numbers]\n\neven_num_idx = -1\nodd_num_idx = -1\n\ntimes_even = 0\ntimes_odd = 0\n\nevenness_even = False\n\n\nfor num_idx, number in enumerate(numbers):\n if number % 2 == 0:\n even_num_idx = num_idx\n times_even += 1\n\n else:\n odd_num_idx = num_idx\n times_odd += 1\n\n if (times_even == 1) and times_odd >= 2:\n print(even_num_idx+1)\n break\n elif (times_even >= 2) and times_odd == 1:\n print(odd_num_idx+1)\n break\n\t\t \t \t \t \t \t \t \t \t\t \t\t", "n = int(input())\r\nx = input().split()\r\nx = list(map(int, x))\r\n\r\nce = 0\r\nco = 0\r\n\r\nfor i in range(len(x)):\r\n if x[i]%2 != 0:\r\n co+=1\r\n else:\r\n ce+=1\r\n \r\n\r\nif co == 1:\r\n for i in range(len(x)):\r\n if x[i]%2 !=0:\r\n print(i+1)\r\n\r\nelse:\r\n for i in range(len(x)):\r\n if x[i]%2 ==0:\r\n print(i+1)\r\n\r\n\r\n", "from math import ceil\n\nn = int(input())\nvals = [int(i) for i in input().split(\" \")]\n\nif (vals[0] % 2 == 0 and vals[1] % 2 == 0):\n for i in range(2, n):\n # print(\"here\")\n if (vals[i] % 2 == 1):\n print(i + 1)\n break\nelif (vals[0] % 2 != 0 and vals[1] % 2 != 0):\n for i in range(2, n):\n if (vals[i] % 2 == 0):\n print(i + 1)\n break\nelse:\n if (vals[0] % 2 == vals[2] % 2):\n print(2)\n else:\n print(1)", "n=int(input())\r\nl=list(input().split())\r\nm=[]\r\nfor i in range(len(l)):\r\n m.append(int(l[i])%2)\r\n\r\na=m.count(0)\r\nif a==1:\r\n c=m.index(0)+1\r\nelse:\r\n c=m.index(1)+1\r\nprint(c)\r\n", "n = int(input())\r\na = []\r\nfor i in input().split():\r\n\ta.append(int(i)%2)\r\nif a.count(0) == 1:\r\n\tprint(a.index(0)+1)\r\nelse:\r\n\tprint(a.index(1)+1)\r\n", "n = int(input())\r\n\r\nls = [int(x) for x in input().split()]\r\n\r\ndef mod2(n):\r\n return n%2\r\n\r\nls1 = [mod2(i) for i in ls]\r\n \r\nif ls1.count(0) == 1:\r\n print(ls1.index(0)+1)\r\nelse:\r\n print(ls1.index(1)+1)", "n= int(input())\r\nlst=list(map(int, input().split()))\r\nc,d=0,0\r\nfor i,j in enumerate(lst):\r\n if j%2==0:\r\n x=i+1\r\n c+=1\r\n else:\r\n y=i+1\r\n d+=1\r\nif c==1:\r\n print(x)\r\nelse:\r\n print(y)", "input()\nt = list(map(int, input().split()))\n\ne = None\n\nif t[0] % 2 == t[1] % 2:\n\tfor i in range(2, len(t)):\n\t\tif t[0] % 2 != t[i] % 2:\n\t\t\tprint(i + 1)\n\t\t\tbreak\nelse:\n\tif t[0] % 2 == t[2] % 2:\n\t\tprint(2)\n\telse:\n\t\tprint(1)", "n = int(input())\na = list(map(int,input().split()))\nfor i in range(len(a)):\n a[i] = a[i] % 2\nprint(a.index(int(a.count(1) == 1))+1)\n", "try:\r\n n=int(input())\r\n x=list(map(int,input().split(\" \")))\r\n c=0\r\n for i in range(0,len(x)):\r\n if (x[i]%2)!=(x[len(x)-1]%2):\r\n u=i+1\r\n c+=1\r\n if c==1:\r\n print(u)\r\n else:\r\n print(len(x))\r\nexcept:\r\n pass", "m=int(input())\r\narr=[int(x) for x in input().split()]\r\nodd_count=sum(x & 1 for x in arr)\r\nfor i,p in enumerate(arr):\r\n if(odd_count != 1 and ~p & 1) or (odd_count == 1 and p &1):\r\n print(i+1)\r\n exit()", "a=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in range(len(b)):\r\n b[i]=b[i]%2\r\nif b.count(0)>b.count(1):\r\n print(b.index(1)+1)\r\nelse:\r\n print(b.index(0)+1)", "n=int(input())\r\ns=input().split()\r\na=list(map(int,s))\r\nk1=k2=0\r\nfor i in range(0,n):\r\n if a[i]%2==0:\r\n k1=k1+1\r\n else:\r\n k2=k2+1\r\nfor i in range(0,n):\r\n if a[i]%2==0 and k2>k1:\r\n print(i+1)\r\n elif a[i]%2!=0 and k1>k2:\r\n print(i+1)\r\n \r\n \r\n", "def iseven(no):\r\n if(no % 2 == 0):\r\n return 1\r\n else:\r\n return 0 \r\nno = int(input())\r\nlist1 = input()\r\nlist1 = list1.split(\" \")\r\nlist1 = [int(i) for i in list1]\r\nce=0\r\nco=0\r\nfor i in range(no):\r\n if iseven(list1[i]) == 1 :\r\n ce = ce + 1\r\n even = i\r\n else:\r\n co = co + 1\r\n odd = i\r\n \r\n if (ce!= co) & (ce >0)&(co>0):\r\n if (ce == 1):\r\n print(even+1)\r\n else:\r\n print(odd+1) \r\n break\r\n ", "input()\r\nmod=[int(x)%2 for x in input().split()]\r\nif sum(mod)==1: print(mod.index(1)+1)\r\nelse: print(mod.index(0)+1)", "\r\nn = int(input())\r\nm = [int(n) for n in input().split()]\r\nr = list(m)\r\nlen(r)== n\r\nw = []\r\nwe = []\r\n\r\nfor i in r:\r\n if i%2==1:\r\n w.append(i)\r\n else:\r\n we.append(i)\r\n \r\nif len(w)==1:\r\n print(r.index(w[0])+1)\r\nelif len(we)==1:\r\n print(r.index(we[0])+1)\r\nelse:\r\n None\r\n \r\n", "input()\na = [int(x) % 2 for x in input().split()]\nprint(a.index(sum(a) == 1) + 1)", "# https://codeforces.com/contest/25/problem/A\r\n\r\nn = int(input())\r\nnbs = list(map(int, input().split()))\r\npairs = [i for i in range(n) if nbs[i] % 2 == 0]\r\nimpairs = [i for i in range(n) if nbs[i] % 2 == 1]\r\nif len(pairs) == 1:\r\n print(pairs[0] + 1)\r\nelse:\r\n print(impairs[0] + 1)\r\n", "n=int(input())\r\nl=[int(x)for x in input().split()]\r\ne=0\r\no=0\r\ncnt1=0\r\ncnt=0\r\nfor i in range(n):\r\n if l[i]%2==1:\r\n o+=1 \r\n k=i \r\n else:\r\n e+=1 \r\n j=i \r\n \r\nif o==1:\r\n print(k+1)\r\nelif e==1:\r\n print(j+1)\r\n", "# your code goes here.\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\np = 0\r\nne = 0\r\nfor i in l:\r\n\tif i%2==0:\r\n\t\tp=p+1\r\n\t\tif p>1:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tne=ne+1\r\n\t\tif ne>1:\r\n\t\t\tbreak\r\nif p>ne:\r\n\tfor i in range(n):\r\n\t\tif l[i]%2!=0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif l[i]%2==0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\t\t\r\n\r\n", "if __name__ == '__main__':\n n = int(input())\n num = []\n\n even = 0\n odd = 0\n indexOdd = 1\n indexEven = 1\n\n singleInt = input()\n numbers = singleInt.split()\n num1 = map(int, numbers)\n num = list(num1)\n\n for i in range(0,n):\n if num[i] % 2 == 0:\n even = even + 1\n indexEven = i + 1\n else:\n odd = odd + 1\n indexOdd = i + 1\n\n if even < odd:\n print(indexEven)\n else:\n print(indexOdd)\n\t \t\t \t \t \t \t \t \t \t\t", "n1 = input()\r\nn2 = input().split()\r\n\r\nevens = []\r\nodds = []\r\n\r\nfor i in n2:\r\n if int(i) % 2 == 0:\r\n evens.append(i)\r\n else:\r\n odds.append(i)\r\n\r\nif len(evens) < len(odds):\r\n print(n2.index(evens[0]) + 1)\r\nelse:\r\n print(n2.index(odds[0]) + 1)\r\n\r\n", "length = int(input())\r\nnums = list(map(int,(input().split(' '))))\r\n\r\ntot = sum([n%2 for n in nums[:3]])\r\neven = (tot in (0,1))\r\nfor i, num in enumerate(nums, start=1):\r\n if num%2==(even):\r\n print(i)\r\n break", "def even_numbers(list):\n for i in range(0, len(list)):\n if list[i]%2 != 0:\n return i+1\n else:\n continue\ndef odd_numbers(list):\n for i in range(0, len(list)):\n if list[i]%2 == 0:\n return i+1\n else:\n continue\n\nn = input()\ns = list(map(int, input().split()))\nif s[0]%2 == 0 and s[1]%2 == 0 or s[1]%2 == 0 and s[2]%2 == 0 or s[0]%2 == 0 and s[2]%2 == 0 :\n print(even_numbers(s))\nelse:\n print(odd_numbers(s))\n", "#-*- coding = utf-8 -*-\r\n#@Time : 2023/1/5 22:27\r\n#@Author : xht\r\n#@File : 考试.py\r\n#@Software: PyCharm\r\n\r\nn = int(input())\r\nl = list(map(int , input().split()))\r\neven = 0\r\nodd = 0\r\nres = 0\r\nfor i in l:\r\n if i & 1:\r\n odd += 1\r\n else:\r\n even += 1\r\n\r\nif odd > even:\r\n for i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n res = i + 1\r\nelse:\r\n for i in range(len(l)):\r\n if l[i] % 2:\r\n res = i + 1\r\n\r\nprint(res)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Oct 24 15:51:40 2020\n\n@author: adam_lyy\n\"\"\"\n\nn=int(input())\na=list(map(int,input().split()))\nfor i in range(n):\n if (a[i]-a[i-1])%2:\n if (a[i+1]-a[i])%2:\n x=i\n else:\n x=i-1\n break\nx=x%n+1\nprint(x)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ncount=sum(x & 1 for x in a)\r\nfor i,v in enumerate(a):\r\n if(count!=1 and ~v & 1) or (count==1 and v & 1):\r\n print(i+1)\r\n exit()\r\n\r\n \r\n ", "a=int(input())\r\nb=list(map(int,input().strip().split()))\r\ne,o=[],[]\r\nfor i in range(len(b)):\r\n if b[i]%2==0:\r\n e.append(b[i])\r\n else:\r\n o.append(b[i])\r\nif len(e)==1:\r\n print(b.index(e[0])+1)\r\nelse:\r\n print(b.index(o[0])+1)", "n = int(input())\r\nli1 = [int(x) for x in input().split()]\r\nli2 = []\r\nfor i in range(n):\r\n a = li1[i] % 2\r\n li2.append(a)\r\nif li2.count(1) == 1:\r\n print((li2.index(1)+1))\r\nelse:\r\n print((li2.index(0)+1))", "n=int(input())\r\nx=list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\nfor i in range(len(x)):\r\n if x[i]&1==0:\r\n even.append(x[i])\r\n else:\r\n odd.append(x[i])\r\n \r\nif len(odd)==1:\r\n for i in range(len(x)):\r\n if x[i]==odd[0]:\r\n print(i+1)\r\n \r\nif len(even)==1:\r\n for i in range(len(x)):\r\n if x[i]==even[0]:\r\n print(i+1) \r\n \r\n", "n = int(input())\r\nL = list(map(int,input().split()))\r\nE = [i%2 for i in L]\r\nif(sum(E)==1):\r\n print(E.index(1)+1)\r\nelse:\r\n print(E.index(0)+1)", "n = int(input())\r\nnum = list(map(int,input().rstrip().split()))\r\neve,odd=0,0\r\nfor i in range(len(num)):\r\n if num[i]%2==0:\r\n eve += 1\r\n else:\r\n odd += 1\r\n if eve>odd and eve>=1 and odd>=1:\r\n k=1\r\n elif odd>eve and eve>=1 and odd>=1:\r\n k=0\r\nif k==1:\r\n for i in range(len(num)):\r\n if num[i]%2!=0:\r\n\r\n index = i+1\r\n break\r\n\r\nelse:\r\n for i in range(len(num)):\r\n if num[i]%2==0:\r\n index = i+1\r\n break\r\nprint(index)", "a=int(input())\r\nb=input()\r\nlist1 = b.split(\" \")\r\nlist2 = []\r\nlist3 = []\r\nfor i in range(a):\r\n if(int(list1[i])%2==0):\r\n list2.append(list1[i])\r\n else:\r\n list3.append(list1[i])\r\nif(len(list2) > len(list3)):\r\n print(list1.index(list3[0]) + 1)\r\nelse:\r\n print(list1.index(list2[0]) + 1)\r\n", "n=int(input())\r\nnumbers=list(map(int,input().split( )))\r\n\r\nfor i in range(1,n-1):\r\n if (numbers[i-1]%2 )!=(numbers[i]%2) and (numbers[i+1]%2)!=(numbers[i]%2):\r\n answer=i+1\r\nif (numbers[0]%2 )!=(numbers[1]%2) and (numbers[2]%2)!=(numbers[0]%2):\r\n answer=1\r\nif (numbers[n-1]%2 )!=(numbers[n-2]%2) and (numbers[n-1]%2)!=(numbers[n-3]%2):\r\n answer=n\r\nprint(answer)", "n = int(input())\r\nl = [*map(int,input().split())]\r\narr = [[],[]]\r\nfor i in range(n):\r\n arr[l[i]%2].append(i)\r\nif(len(arr[0]) == 1):\r\n print(arr[0][0] + 1)\r\nelse:\r\n print(arr[1][0] + 1)", "n = int( input() )\nm = list( map( int,input().split() ) )\nc=0\nx = [i%2 for i in m]\n#print (x)\n\nif x.count(0) == 1:\n print (x.index(0)+1)\nelse:\n print(x.index(1)+1)", "n = int(input())\r\na = list(map(int,input().split()[:n]))\r\nq = 0\r\nw = 0\r\nfor i in a:\r\n if i %2 == 0:\r\n q += 1\r\n elif i %2 == 1:\r\n w += 1\r\nif q > w:\r\n for j in range(n) :\r\n if a[j]% 2 == 1:\r\n print(j+1)\r\nelif w> q:\r\n for q in range(n) :\r\n if a[q]% 2 == 0:\r\n print(q+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nco=0\r\nc=0\r\nw=0\r\nc1=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n co=co+1\r\n c=i+1\r\n else:\r\n w=w+1\r\n c1=i+1\r\n \r\nif(w==1):\r\n print(c1)\r\nelse:\r\n print(c)\r\n \r\n", "\r\nd=input()\r\na=input()\r\n\r\nc=[int(x)%2 for x in a.split(\" \")]\r\nif sum(c)>1:\r\n b=c.index(min(c))\r\nelse:\r\n b=c.index(max(c))\r\nprint (b+1)\r\n", "input(); a=[i%2 for i in map(int, input().split())]; print(a.index(1 if sum(a) == 1 else 0)+1)", "n = int(input())\r\nx=[int(x) for x in input().split()]\r\n\r\ne = []\r\no = []\r\nfor i in x:\r\n if i % 2 == 0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\n\r\nif len(e) == 1:\r\n print(x.index(e[0]) + 1)\r\nelif len(o) == 1:\r\n print(x.index(o[0]) + 1)\r\n", "n = int(input())\r\nnums = [int(i) % 2 for i in input().split()]\r\nprint(nums.index(1) + 1 if nums.count(1) == 1 \\\r\n else nums.index(0) + 1)", "n = input()\r\nlst = input().split()\r\neven, odd = [], []\r\nfor i in range(len(lst)):\r\n if int(lst[i]) % 2: odd.append(i)\r\n else: even.append(i)\r\n\r\n if len(odd) >= 2 and len(even) == 1: print(even[0]+1); break\r\n elif len(even) >= 2 and len(odd) == 1: print(odd[0]+1); break\r\n\r\n \r\n", "n=int(input())\r\nx=[int(i)%2 for i in input().split()]\r\nif sum(x)==1:\r\n print(x.index(1)+1)\r\nelse:\r\n print(x.index(0)+1)", "n = int(input())\r\nlist1 = [int(x) for x in input(). split()]\r\nlist2 = []\r\nfor i in range(0, n):\r\n if list1[i] % 2 == 0:\r\n list2.append(0)\r\n else:\r\n list2.append(1)\r\na = list2.count(1)\r\nb = list2.count(0)\r\nif a == 1:\r\n print(list2.index(1) + 1)\r\nelse:\r\n print(list2.index(0) + 1)\r\n", "n = int(input())\r\nlistt = input().split()\r\nfor i in range(len(listt)):\r\n listt[i] = int(listt[i])\r\n \r\nfor i in range(len(listt) - 2):\r\n if ((listt[i] + 2) % 2 + (listt[i+1] + 2) % 2 + (listt[i+2] + 2) % 2) >= 1:\r\n if (listt[i] + 2) % 2 != (listt[i+1] + 2) % 2 and (listt[i] + 2) % 2 != (listt[i+2] + 2) % 2:\r\n print(i + 1)\r\n break\r\n elif (listt[i+1] + 2) % 2!= (listt[i] + 2) % 2 and (listt[i+1] + 2) % 2 != (listt[i+2] + 2) % 2:\r\n print(i + 2)\r\n break\r\n elif (listt[i+2] + 2) % 2 != (listt[i] + 2) % 2 and (listt[i+2] + 2) % 2 != (listt[i+1] + 2) % 2:\r\n print(i + 3)\r\n break", "n=int(input())\r\nl=list(input().split())\r\nfor i in range(n):\r\n l[i]=int(l[i])\r\ndef type_list(l):\r\n even=0\r\n odd=0\r\n for i in range(3):\r\n if l[i]%2==1: odd+=1\r\n else: even+=1\r\n if even>odd: return 'even'\r\n else: return 'odd'\r\nfor i in range(n):\r\n if type_list(l)=='even' and l[i]%2==1:\r\n print(i+1)\r\n break\r\n elif type_list(l)=='odd' and l[i]%2==0:\r\n print(i+1)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nfor i in l:\r\n if(i%2==0):\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\nif(len(l1)>len(l2)):\r\n for j in range(0,n):\r\n for k in l2:\r\n if(l[j]==k):\r\n print(j+1)\r\nelse:\r\n for j in range(0,n):\r\n for k in l1:\r\n if(l[j]==k):\r\n print(j+1)\r\n ", "n=int(input())\r\nk1=0\r\np1=0\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n k=i+1\r\n k1+=1\r\n else:\r\n p=i+1\r\n p1+=1\r\nif k1==1:\r\n print(k)\r\nelif p1==1:\r\n print(p)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = []\r\nfor i in range(len(A)):\r\n if A[i] % 2 == 0:\r\n B.append(1)\r\n else:\r\n B.append(0)\r\nif B.count(0) == 1:\r\n for i in range(len(A)):\r\n if A[i] % 2 != 0:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(len(A)):\r\n if A[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\n \r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n if li[i]%2==0:\r\n a.append(i+1)\r\n else:\r\n b.append(i+1)\r\nif len(a)>len(b):\r\n print(b[0])\r\nelse:\r\n print(a[0])", "n=int(input())\r\nt=[int(x) for x in input().split()]\r\na=0\r\nif t[0]%2==0:\r\n a+=1\r\nif t[1]%2==0:\r\n a+=1\r\nif t[2]%2==0:\r\n a+=1\r\nif a>=2:\r\n for i in range(n):\r\n if t[i]%2!=0:\r\n print(i+1)\r\n break\r\nif a<2:\r\n for z in range(n):\r\n if t[z]%2==0:\r\n print(z+1)\r\n break", "n = int(input())\r\ndiaria = list(map(int, input().split()))\r\ndiaria = [1 if i % 2 == 0 else 0 for i in diaria]\r\nif diaria.count(1) < diaria.count(0):\r\n print(diaria.index(1)+1)\r\nelse:\r\n print(diaria.index(0)+1)", "n = map(int, input())\nnums = map(int, input().split())\noddCnt = 0\nevenCnt = 0\nfor i, num in enumerate(nums):\n if num % 2 == 0:\n evenCnt += 1\n evenIdx = i\n else:\n oddCnt += 1\n oddIdx = i\nif oddCnt == 1:\n print(oddIdx + 1)\nelse:\n print(evenIdx + 1)\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nnum_ch = [x + 1 for x in range(len(arr)) if arr[x] % 2 == 0]\r\nnum_nech = [x + 1 for x in range(len(arr)) if arr[x] % 2 == 1]\r\nif len(num_ch) == 1:\r\n print(num_ch[0])\r\nelse:\r\n print(num_nech[0])\r\n\r\n", "n = int(input())\r\nl=list(map(int ,input().split()))\r\np1,p2,j,k=0,0,0,0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n j+=1\r\n p1=i\r\n if l[i]%2==1:\r\n k+=1\r\n p2=i\r\nif j>k:\r\n print(p2+1)\r\nelse:\r\n print(p1+1)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ne, o = 0, 0\r\nfor i in range(3):\r\n if l[i] % 2 == 0:\r\n e += 1\r\n else:\r\n o += 1\r\nif e > o:\r\n m = 2\r\nelse:\r\n m = 1\r\nfor j in l:\r\n if j % 2 != m % 2:\r\n print(l.index(j) + 1)\r\n break", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\neven_lst = []\r\nuneven_lst = []\r\nfor i in lst:\r\n if i%2 == 0:\r\n even_lst.append(i)\r\n else:\r\n uneven_lst.append(i)\r\nif len(even_lst) == 1:\r\n print(lst.index(even_lst[0])+1)\r\nelse:\r\n print(lst.index(uneven_lst[0])+1)\r\n", "try:\r\n n = int(input())\r\n s = input()\r\n ssp = s.split()\r\n a = []\r\n for i in range(len(ssp)):\r\n a.append(int(ssp[i]) % 2)\r\n if (a.count(1) == 1):\r\n print(a.index(1) + 1)\r\n else:\r\n print(a.index(0) + 1)\r\n \r\nexcept EOFError:\r\n pass", "n = int(input())\r\nm = list(map(int,input().split()))\r\np = []\r\nfor i in m:\r\n i = i%2\r\n p.append(i)\r\nif p.count(0) == 1:\r\n print(p.index(0)+1)\r\nif p.count(1) == 1:\r\n print(p.index(1)+1)", "k = int(input())\r\n \r\narr = [0] * k\r\n\r\nstr01 = input()\r\nt = 0\r\nfor i in str01.split():\r\n arr[t] = int(i)\r\n t+=1\r\n \r\narr_bool = []\r\n\r\nfor i in arr:\r\n if i % 2 == 0:\r\n arr_bool.append(True)\r\n else:\r\n arr_bool.append(False)\r\n \r\nfc , tc = 0,0 \r\nfor i in arr_bool:\r\n if i == False:\r\n fc +=1\r\n else:\r\n tc +=1\r\n \r\nif fc > 1:\r\n for i in arr_bool:\r\n if i == True:\r\n print(arr_bool.index(i)+1)\r\n break\r\nelif tc>1:\r\n for i in arr_bool:\r\n if i == False:\r\n print(arr_bool.index(i)+1)\r\n break\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\nx=list(map(int,input().split()))\r\nj=list(filter(lambda j: (j%2!=0),x))\r\nk=list(filter(lambda j: (j%2==0),x))\r\nif (len(j)==1):\r\n for i in j:\r\n print(x.index(i)+1)\r\nelse:\r\n for i in k:\r\n print(x.index(i)+1)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nnum_evens = 0\r\nnum_odds = 0\r\nlast_even_index = -1\r\nlast_odd_index = -1\r\n\r\nfor i in range(n):\r\n if nums[i] % 2 == 0:\r\n num_evens += 1\r\n last_even_index = i\r\n else:\r\n num_odds += 1\r\n last_odd_index = i\r\n \r\nif num_evens == 1:\r\n print(last_even_index + 1)\r\nelse:\r\n print(last_odd_index + 1)\r\n ", "input()\r\na = list(map(int,input().split()))\r\nb = [i for i in a if i%2]\r\nif len(b) == 1:\r\n print(a.index(b[0])+1)\r\nelse:\r\n print(a.index(list(set(a)-set(b))[0])+1) ", "n = int(input())\narr_n = input().split()\narr_n = [int(i) for i in arr_n]\npar = 0\nultimoPar = 0\nultimoImpar = 0\n\ni = 1\nwhile(i <= n):\n if (arr_n[i - 1] % 2 == 0):\n par += 1\n ultimoPar = i\n else:\n par -= 1\n ultimoImpar = i\n i += 1\n\nresult = (ultimoImpar if par > 0 else ultimoPar)\nprint(result)\n\t \t \t \t\t \t \t\t \t \t \t\t\t\t\t\t\t \t\t\t", "n = int(input())\r\na = input()\r\na = [int(x) for x in a.split()]\r\nb = []\r\nc = []\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n b.append(a[i])\r\n else:\r\n c.append(a[i])\r\nif len(b) == 1:\r\n print(a.index(b[0]) + 1)\r\nelse:\r\n print(a.index(c[0]) + 1)\r\n", "# Just 2 variable count\r\nodd = [0,None]\r\neven = [0,None]\r\nn = int(input())\r\nnums = list(map(int,input().split()))\r\nfor i in range(n):\r\n if nums[i]%2 == 0:\r\n even[0] += 1\r\n even[1] = i+1\r\n else:\r\n odd[0] += 1\r\n odd[1] = i+1\r\nif even[0] == 1:\r\n print(even[1])\r\nelse:\r\n print(odd[1])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\neven = 0\r\ninde = 0\r\nodd = 0\r\nindo = 0\r\n\r\nfor i in range(0, n):\r\n if a[i]%2 == 0:\r\n even = even+1\r\n inde = i+1\r\n else:\r\n odd = odd+1\r\n indo = i+1\r\n\r\nif even == 1:\r\n print(inde)\r\nelse:\r\n print(indo)", "k = int(input())\r\npaaritu = 0\r\npaaris = 0\r\nnumber_list = list(map(int, input().split()))\r\n\r\n\r\nfor i in range(k):\r\n if number_list[i]%2 == 0:\r\n paaris += 1\r\n \r\n else:\r\n paaritu += 1\r\n\r\nif paaris == 1:\r\n for l in range(k):\r\n if number_list[l]%2 == 0:\r\n print(l+1)\r\n\r\nelse:\r\n for l in range(k):\r\n if number_list[l]%2 == 1:\r\n print(l+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(3):\r\n m.append(a[i]%2)\r\nif sum(m)<=1:\r\n k=1\r\nelse:\r\n k=0\r\nfor i in range(n):\r\n if a[i]%2==k:\r\n p=i+1\r\nprint(p)", "n = int(input())\r\n\r\nnumbers = input().split(' ')\r\n\r\n\r\nimpares = 0\r\npares = 0\r\nindex_par = 0\r\nindex_impar = 0\r\nfor i in range(n):\r\n number_compare = int(numbers[i])\r\n\r\n if number_compare % 2 == 0:\r\n pares += 1\r\n index_par = i+1\r\n\r\n else:\r\n impares += 1\r\n index_impar = i+1\r\n\r\n\r\nif pares == 1:\r\n print(index_par)\r\nelif impares == 1:\r\n print(index_impar) \r\n\r\n", "import math\r\ndef solve(arr, n):\r\n\t\r\n\teven = 0\r\n\todd = 0\r\n\tlast_odd = 0\r\n\tlast_even = 0\r\n\tfor i in range(n):\r\n\t\tif arr[i] & 1:\r\n\t\t\todd += 1\r\n\t\t\tlast_odd = i+1\r\n\t\telse:\r\n\t\t\teven += 1\r\n\t\t\tlast_even = i + 1\r\n\t\r\n\tif even == 1:\r\n\t\treturn last_even\r\n\telse:\r\n\t\treturn last_odd\r\n\treturn -1\r\nn = int(input())\r\narr = list(map(int, input().strip().split()))\r\nresult = solve(arr, n)\r\nprint(result)", "\"\"\"\nBob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given n numbers finds one that is different in evenness. \n\"\"\"\n\nn = int(input())\nnumbers = [int(i) for i in input().split()]\n\nchanged = -1\neven = -1\nindex = -1\nfor i, number in enumerate(numbers):\n if number % 2 == 0:\n if even != 1:\n even = 1\n changed += 1\n if number % 2 == 1:\n if even != 0:\n even = 0\n changed += 1\n if changed > 0:\n index = i\n break\n\nif index <= 1:\n if (numbers[2] % 2 == 0 and numbers[0] % 2 == 0) or (numbers[2] % 2 == 1 and numbers[0] % 2 == 1):\n index = 1\n else:\n index = 0\n\nprint(index+1)", "n=int(input())\r\nlst=[*map(int,input().split())]\r\na,b=[],[]\r\nfor i,x in enumerate(lst):\r\n if x%2==0:a.append(i+1)\r\n else:b.append(i+1)\r\nif len(a)==1:print(a[0])\r\nelse:print(b[0])", "def Number(arr):\r\n odd=0\r\n evn=0\r\n for i in range(len(arr)):\r\n if(arr[i]%2==0):\r\n evn+=1\r\n else:\r\n odd+=1\r\n if(evn==1):\r\n return \"evn\"\r\n else:\r\n return \"odd\"\r\nN=int(input())\r\narr=list(map(int,input().split()))\r\nif(Number(arr)==\"evn\"):\r\n for i in range(len(arr)):\r\n if(arr[i]%2==0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(arr)):\r\n if(arr[i]%2!=0):\r\n print(i+1)\r\n break", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ne,o=0,0\r\nfor i in range(n):\r\n if lst[i] % 2==0:\r\n e+=1\r\n if e>=2:\r\n break\r\n else:\r\n o+=1\r\n if o>=2:\r\n break\r\nif e >=2:\r\n for i in range(n):\r\n if lst[i]%2!=0:\r\n print(i+1)\r\n break\r\nelif o>=2:\r\n for i in range(n):\r\n if lst[i]%2==0:\r\n print(i+1)\r\n break", "\"\"\"for i in range(int(input())):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n b=[]+a\r\n b.sort()\r\n c=set(a)\r\n if len(c)==1 and 0 in c:\r\n print(\"NO\")\r\n elif len(c)==1 and 0 not in c:\r\n if 1 in c and a.count(1)<=3:\r\n print(\"YES\")\r\n elif 1 in c and a.count(1)>3:\r\n print(\"NO\")\r\n elif 2 in c and a.count(2)>3:\r\n print(\"NO\")\r\n elif 2 in c and a.count(2)<=3:\r\n print(\"YES\")\r\n elif len(c)==1 and 0 not in c and 1 not in c and 2 not in c:\r\n print(\"YES\")\r\n elif len(c)!=1 and a.count(0)>=2:\r\n print(\"NO\")\r\n elif len(c)==len(a):\r\n print(\"YES\")\r\n\"\"\"\r\n\"\"\"\r\nn = int(input())\r\na = [0] * 3\r\n\r\nfor i in range(n):\r\n b = [int(x) for x in input().split()]\r\n for j in range(3):\r\n a[j] += b[j]\r\nans = [x for x in a if x == 0]\r\nprint('YES' if len(ans) == 3 else 'NO')\r\n\"\"\"\r\n\"\"\"\r\nk,n,w=map(int,input().split())\r\nt=(w*(w+1)//2)*k\r\nif t>n:\r\n print(t-n)\r\nelse:\r\n print(0)\r\n\"\"\"\r\n\"\"\"\r\nm = \"hello\"\r\n \r\ndef chatRoom():\r\n x = 0\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] == m[x]:\r\n x += 1\r\n if x == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatRoom())\r\n\"\"\"\r\n\"\"\"\r\na=int(input())\r\nif (a%4==0 or a%7==0 or a%44== 0 or a%47==0 or a%74==0 or a%77 == 0 or a % 444 == 0 or a % 447 == 0 or a % 474 == 0 or a % 477 == 0 or a % 744 == 0 or a % 747 == 0 or a % 774 == 0 or a % 777 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\"\"\"\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor i in a:\r\n if i%2==0:\r\n e.append(i)\r\n else:\r\n o.append(i)\r\nif len(e)>len(o):\r\n print(a.index(o[0])+1)\r\nelse:\r\n print(a.index(e[0])+1)\r\n", "n=int(input())\r\nnums=[int(x)%2 for x in input().split()]\r\nx1=nums.count(1)\r\nx2=nums.count(0)\r\nif x1==1:\r\n print(nums.index(1)+1)\r\nelse:\r\n print(nums.index(0)+1)", "n=int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\neven = 0\r\nodd =0\r\nlastodd = -1\r\nlasteven = -1\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even += 1\r\n lasteven = i\r\n else:\r\n odd += 1\r\n lastodd = i\r\n \r\nif even > odd:\r\n print(lastodd + 1)\r\nelse:\r\n print(lasteven + 1)\r\n \r\n \r\n ", "input()\r\nip = input().split()\r\nl = int(ip[0]) % 2\r\nfor i in range(1, len(ip)-1):\r\n\tif int(ip[i]) % 2 != l and int(ip[i+1]) % 2 != l:\r\n\t\tprint(i)\r\n\t\tbreak\r\n\telif int(ip[i]) % 2 != l and int(ip[i+1]) % 2 != int(ip[i]) % 2:\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n\telif int(ip[i+1]) % 2 != l and int(ip[i+1]) % 2 != int(ip[i]) % 2:\r\n\t\tprint(i+2)\r\n\t\tbreak", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = [0,0]\r\nfor i in range(n):\r\n a[l[i]%2] += i+1\r\n#print(a)\r\nif(a[0] > n):\r\n print(a[1])\r\nelse:\r\n print(a[0])", "input();l=list(map(int, input().split()))\r\nce=co=0\r\nfor i in l:\r\n if i%2!=0:\r\n ce+=1\r\n elif i==0:\r\n pass\r\n else:\r\n co+=1\r\n\r\nif co>ce:\r\n for i in l:\r\n if i%2!=0:\r\n print(l.index(i)+1)\r\n\r\nelse:\r\n for i in l:\r\n if i%2==0:\r\n print(l.index(i)+1)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\n# map evens with 0 and odds with 1\r\na = list(map(lambda x: 0 if x%2 else 1, map(int, input().split(\" \"))))\r\n\r\nif sum(a)>1:\r\n print(a.index(0)+1)\r\nelse:\r\n print(a.index(1)+1)\r\n\r\n", "total = int(input())\r\nnums = [int(num) % 2 for num in input().split()]\r\nfrom collections import Counter\r\nparity_counts = Counter(nums)\r\nodd_man_out = 0 if parity_counts[0] == 1 else 1\r\nfor idx, num in enumerate(nums):\r\n if num == odd_man_out:\r\n print(idx + 1)\r\n break\r\n", "_ = input()\r\nx = input().split()\r\nnums = [int(a) for a in x]\r\n\r\neven = sum([1 for num in nums[:3] if (num%2)==0])\r\n\r\nif even > 1:\r\n\tprint([nums.index(num)+1 for num in nums if (num%2) != 0][0])\r\nelse:\r\n\tprint([nums.index(num)+1 for num in nums if (num%2) == 0][0])", "n=int(input())\r\nl=[int(i)for i in input().split()]\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n a.append(str(i+1))\r\n else:\r\n b.append(str(i+1))\r\nif int(len(a))>int(len(b)):\r\n print(\"\".join(b))\r\nelse:\r\n print(\"\".join(a))", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\neven = int(x[0]%2==0) + int(x[1]%2==0) + int(x[2]%2==0)\r\nodd = int(x[0]%2==1) + int(x[1]%2==1) + int(x[2]%2==1)\r\nif odd > 1:\r\n for i in range(n):\r\n if x[i]%2 == 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if x[i]%2 == 1:\r\n print(i+1)\r\n break", "import math\r\ndef na():\r\n\tn = int(input())\r\n\tb = [int(x) for x in input().split()]\r\n\treturn n,b\r\n\r\n\r\ndef nab():\r\n\tn = int(input())\r\n\tb = [int(x) for x in input().split()]\r\n\tc = [int(x) for x in input().split()]\r\n\treturn n,b,c\r\n\r\n\r\ndef dv():\r\n\tn, m = map(int, input().split())\r\n\treturn n,m\r\n\r\n\r\ndef dva():\r\n\tn, m = map(int, input().split())\r\n\tb = [int(x) for x in input().split()]\r\n\treturn n,m,b\r\n\r\n\r\ndef nm():\r\n\tn = int(input())\r\n\tb = [int(x) for x in input().split()]\r\n\tm = int(input())\r\n\tc = [int(x) for x in input().split()]\r\n\treturn n,b,m,c\r\n\r\n\r\ndef dvs():\r\n\tn = int(input())\r\n\tm = int(input())\r\n\treturn n, m\r\n\r\n\r\n\r\nn, a = na()\r\nk1 = 0\r\nk2 = 0\r\nfor i in a:\r\n\tif i % 2 == 0:\r\n\t\tk1 += 1\r\n\telse:\r\n\t\tk2 += 1\r\nif k1 > k2:\r\n\tfor i in range(n):\r\n\t\tif a[i] % 2 != 0:\r\n\t\t\tprint(i + 1)\r\n\t\t\texit()\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif a[i] % 2 != 1:\r\n\t\t\tprint(i + 1)\r\n\t\t\texit()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 21 19:18:40 2020\r\n\r\n@author: zyc\r\n\"\"\"\r\n\r\nn=int(input())\r\ns=[int(x) for x in input().split(' ')]\r\na=0\r\nb=0\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n a=a+1\r\n c=i+1\r\n else:\r\n b=b+1\r\n d=i+1\r\nif a==1:\r\n print(c)\r\nelse:\r\n print(d)", "input();s=list(map(int,input().split()))\r\na=b=ans=0\r\nfor i in s:\r\n\ta+=(i%2==0)\r\n\tb+=(i%2!=0)\r\nif a==1:\r\n\tfor i in s:\r\n\t\tif i%2==0:\r\n\t\t\tans=s.index(i)\r\nif b==1:\r\n\tfor i in s:\r\n\t\tif i%2!=0:\r\n\t\t\tans=s.index(i)\r\nprint(ans+1)", "input()\r\nnums = [int(x) for x in input().split()]\r\nn_even = len([x for x in nums if x % 2 == 0])\r\nif n_even > len(nums) // 2:\r\n for index, x in enumerate(nums):\r\n if x % 2 == 1:\r\n print(index + 1)\r\nelse:\r\n for index, x in enumerate(nums):\r\n if x % 2 == 0:\r\n print(index + 1)\r\n", "n = int(input())\r\ng = list(map(int, input().split()))\r\nch, nech = 0, 0\r\nfor i in range(n):\r\n if g[i] % 2 == 0:\r\n ch += 1\r\n else:\r\n nech += 1\r\n if (ch or nech) > 1:\r\n break\r\n\r\nif ch > 1:\r\n for i in range(n):\r\n if g[i] % 2 != 0:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if g[i] % 2 == 0:\r\n print(i + 1)\r\n break", "#25A\r\n#evenness\r\n\r\n\r\nn=int(input())\r\nL=list(map(int,input().rstrip().split()))\r\n\r\nL1=[]\r\nfor i in L:\r\n if i%2==0:\r\n L1.append([i,1])\r\n else:\r\n L1.append([i,0])\r\n\r\nc=0\r\nd=0\r\nfor i in L1:\r\n if i[1]==0:\r\n c+=1\r\n else:\r\n d+=1\r\n\r\nif c==1:\r\n for i in range(len(L1)):\r\n if L1[i][1]==0:\r\n print(i+1)\r\n else:\r\n pass\r\nelif d==1:\r\n for i in range(len(L1)):\r\n if L1[i][1]==1:\r\n print(i+1)\r\n else:\r\n pass\r\nelse:\r\n pass", "n=int(input())\r\nL=list(map(int,input().split()))\r\neven=0\r\nfor i in range(3):\r\n if(L[i]%2==0):\r\n even+=1\r\nif(even>=2):\r\n for i in range(n):\r\n if(L[i]%2!=0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if(L[i]%2==0):\r\n print(i+1)\r\n break\r\n", "n=int(input())\ndigit=list(map(int,input().split()))[:n]\neven=0\nodd=0\nfor i in digit:\n\tif(i%2==0):\n\t\teven+=1\n\telse:\n\t\todd+=1\nif(even>odd):\n\tfor i in range(len(digit)):\n\t\tif(digit[i]%2!=0):\n\t\t\tprint(i+1)\n\t\t\tbreak\nelse:\n\tfor i in range(len(digit)):\n\t\tif(digit[i]%2==0):\n\t\t\tprint(i+1)\n\t\t\tbreak\n\t\n\t\t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\np = a[0] % 2\r\nq = a[1] % 2\r\nif p == q:\r\n\tfor i in a[2:]:\r\n\t\tif i % 2 != p:\r\n\t\t\tbreak\r\n\tl = a.index(i) + 1\r\nelif a[2] % 2 == p:\r\n\tl = 2\r\nelse:\r\n\tl = 1\r\nprint(l)", "n = int(input())\r\nnum = [int(n) for n in input().split()]\r\nl = []\r\nl1 = []\r\nflag = 0\r\nfor i in range(n):\r\n if (len(l) == 1 and len(l1) > 1) or (len(l) > 1 and len(l1) == 1):\r\n break\r\n if num[i] % 2 == 0:\r\n l.append(num[i])\r\n else:\r\n l1.append(num[i])\r\nif len(l) == 1:\r\n print(num.index(l[0])+1)\r\nif len(l1) == 1:\r\n print(num.index(l1[0])+1)\r\n ", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(0,n):\r\n a[i]=a[i]%2\r\nc=0\r\nd=0\r\nfor i in range(0,n):\r\n if a[i]==0:\r\n c=c+1\r\n if a[i]==1:\r\n d=d+1\r\nif c==1:\r\n for i in range(0,n):\r\n if a[i]==0:\r\n print(i+1)\r\nif d==1:\r\n for i in range(0,n):\r\n if a[i]==1:\r\n print(i+1)\r\n\r\n\r\n", "a= input()\r\nb= input().split()\r\neven = 0\r\nindex=0\r\nfor i in range(3):\r\n b[i] = int(b[i])\r\n if b[i]%2 == 0:\r\n even+=1\r\nif (even>1):\r\n for i in range(len(b)):\r\n b[i] = int(b[i])\r\n if b[i]%2==0:\r\n continue\r\n else:\r\n index = b.index(b[i])+1\r\n break\r\n\r\nelse:\r\n for i in range(len(b)):\r\n b[i] = int(b[i])\r\n if b[i]%2==0:\r\n index = b.index(b[i])+1\r\n break\r\n else:\r\n continue\r\nprint(index)\r\n\r\n \r\n", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nx=0\r\ny=0\r\nfor i in list:\r\n if i%2==1:\r\n x+=1\r\n if x==1:\r\n a=i\r\n else:\r\n y+=1\r\n if y==1:\r\n b=i\r\nif y<x:\r\n print(list.index(b)+1)\r\nelse:\r\n print(list.index(a)+1)\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = {}\r\nidx1 = 0\r\nidx0 = 0\r\nfor i in range(n):\r\n if l[i]%2:\r\n d[1] = d.get(1,0) + 1\r\n idx1 = i\r\n else:\r\n d[0] = d.get(0,0) + 1\r\n idx0 = i\r\n\r\nif d[1] == 1:\r\n print(idx1+1)\r\nelse:\r\n print(idx0+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nind=0\r\neven=0\r\nodd=0\r\nh=-1\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n even+=1 \r\n if even>=2:\r\n h=1 \r\n break\r\n else:\r\n odd+=1\r\n if odd>=2:\r\n h=0 \r\n break\r\nif h==1:\r\n for i in l:\r\n if i%2!=0:\r\n print(l.index(i)+1)\r\n break\r\nif h==0:\r\n for i in l:\r\n if i%2==0:\r\n print(l.index(i)+1)\r\n break\r\n \r\n ", "a=int(input()) \r\nb=list(map(int,input().split()))\r\nodd=[]\r\neven=[]\r\nfor i in b:\r\n if i&1:\r\n odd.append(i)\r\n else:\r\n even.append(i)\r\nif len(odd)==1:\r\n print(b.index(odd[0])+1)\r\nelse:\r\n print(b.index(even[0])+1) ", "#code\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\ntemp1=0\r\ntemp2=0\r\neven=0\r\nodd=0\r\nfor i in range(n):\r\n if lst[i]%2==0:\r\n even+=1\r\n temp1=i+1\r\n else:\r\n odd+=1\r\n temp2=i+1\r\nif even==1:\r\n print(temp1)\r\nelse:\r\n print(temp2)", "nn = int(input())\r\n\r\n# patterns - divisibility\r\n\r\nodd, even = 0, 0\r\n\r\nn = list(map(int, input().split()))\r\n\r\nfor i in range(3):\r\n\r\n if n[i] % 2 == 0: even +=1\r\n else: odd += 1\r\n\r\noddSeq, evenSeq = False, False\r\n\r\nif odd > even:\r\n\r\n oddSeq = True\r\n\r\nelse:\r\n\r\n evenSeq = True\r\n\r\n\r\nif oddSeq:\r\n\r\n for i in range(nn):\r\n\r\n if n[i] % 2 == 0:\r\n\r\n print(i + 1)\r\n break\r\n \r\nif evenSeq:\r\n\r\n for i in range(nn):\r\n\r\n if n[i] % 2 != 0:\r\n\r\n print(i + 1)\r\n break\r\n", "# Check The inputs for Correctness [Based Of each input's Identifier]\r\ndef mCheckInputs(inputList):\r\n if ((inputList[0].isdigit()) and (3 <= int(inputList[0]) <= pow(10,2) and \r\n (inputList[1].__len__() == int(inputList[0])) )):\r\n \tpass\r\n else:\r\n exit(1)\r\n\r\n# Handle inputs and their Checking and re-Formatting[Str ==> Int]\r\ndef mHandleInputs(inputList):\r\n try:\r\n n = input()\r\n numbersList = list(map(int,input().split()))\r\n if (len(numbersList) == 0): exit(1)\r\n inputList.append(n)\r\n inputList.append(numbersList)\r\n mCheckInputs(inputList)\r\n \r\n except ValueError as e:\r\n exit(1)\r\n\r\n#The Actual Logic [Brain Of Project]\r\ndef mDoWork(inputList,outputList): \r\n \r\n n = int(inputList[0])\r\n numbersList = inputList[1]\r\n evennessList = [ (1) if (item%2 == 0) else (0) for item in numbersList]\r\n result = (evennessList.index(0) +1) if (evennessList.count(0) == 1) else (evennessList.index(1) + 1)\r\n outputList.append(result)\r\n\r\n \r\n\r\n\r\n# Re-Format the Result [ How and Where to show it ]\r\ndef mFormatResult(outputList):\r\n print(outputList[0])\r\n\r\ndef main():\r\n inputList = [] \r\n mHandleInputs(inputList)\r\n\r\n outputList = []\r\n mDoWork(inputList,outputList)\r\n\r\n mFormatResult(outputList)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nline=input()\r\nnums=[int(i) for i in line.split()]\r\ns=0\r\nt1=0\r\nt2=0\r\nfor i in range(n):\r\n if nums[i]%2==0:\r\n s+=1\r\n t1=i+1\r\n else:\r\n t2=i+1\r\nif s==1:\r\n print(t1)\r\nelse:\r\n print(t2)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na = list(map(lambda x: x % 2, a))\r\n\r\nprint(a.index(1 if a.count(1) == 1 else 0) + 1)\r\n", "n=int(input())\r\nl1=[int(x) for x in input().split()]\r\na=l1[0]\r\nb=l1[1]\r\nc=l1[2]\r\nd=0\r\nif(a%2==b%2):\r\n d=a%2\r\nelif(a%2==c%2):\r\n d=a%2\r\nelse:\r\n d=c%2\r\nfor x in l1:\r\n if(x%2!=d%2):\r\n print(l1.index(x)+1)", "# your code goes here\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nodd = 0\r\noddIdx = 1\r\neven = 0\r\nevenIdx = 1\r\n\r\nfor i in range(n):\r\n\tif(lst[i] % 2 == 0):\r\n\t\teven += 1\r\n\t\tevenIdx = i + 1\r\n\telse:\r\n\t\todd += 1\r\n\t\toddIdx = i + 1\r\n\r\nif(even < odd):\r\n\tprint(evenIdx)\r\nelse:\r\n\tprint(oddIdx)\r\n", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nevec = 0\r\noddc = 0\r\nfor i in range(n):\r\n if nums[i] % 2 == 0:\r\n evec += 1\r\n evex = i + 1\r\n else:\r\n oddc += 1\r\n oddc = i + 1\r\nif evec == 1:\r\n print(evex)\r\nelse:\r\n print(oddc)\r\n", "n=int(input())\r\narray=[int(i1) for i1 in input().split()]\r\neven=0\r\nodd=0\r\neven_diff=False\r\nodd_diff=False\r\nfor i2 in range(n):\r\n if array[i2]%2==0:\r\n if even_diff:\r\n out_index=i2+1\r\n break\r\n elif even==0:\r\n even=i2+1\r\n else:\r\n odd_diff=True\r\n if odd:\r\n out_index=odd\r\n break\r\n else:\r\n if odd_diff:\r\n out_index=i2+1\r\n break\r\n elif odd==0:\r\n odd=i2+1\r\n else:\r\n even_diff=True\r\n if even:\r\n out_index=even\r\n break\r\nprint(out_index)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nv=[]\r\nc=[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n v.append(l[i])\r\n else:\r\n c.append(l[i])\r\nx=max(len(v),len(c))\r\nif x==len(v):\r\n print(l.index(c[0])+1)\r\nelse:\r\n print(l.index(v[0])+1)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nch=0\r\nne=0\r\not=0\r\notv=0\r\nfor i in l:\r\n if i%2==0:\r\n ch+=1\r\n ot=i\r\n else:\r\n ne+=1\r\n otv=i\r\nif ch>ne:\r\n print(l.index(otv)+1)\r\nelse:\r\n print(l.index(ot)+1)\r\n \r\n", "from collections import defaultdict\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=defaultdict(lambda:0)\r\nfor i in l:\r\n s[i%2]=s[i%2]+1\r\nans=0\r\nfor i in range(n):\r\n if(s[l[i]%2]==1):\r\n ans=i+1\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nodd=0;even=0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:even+=1\r\n else:odd+=1\r\n\r\nif odd==1:\r\n for i in range(len(l)):\r\n if l[i]%2==1:print(i+1);exit()\r\nelse:\r\n for i in range(len(l)):\r\n if l[i]%2==0:print(i+1);exit()", "a = int(input())\r\nb = list(map(int, input().split()))\r\na1 = []\r\na2 = []\r\nfor i in range(a):\r\n if b[i] % 2 == 0:\r\n a1.append(i+1)\r\n else:\r\n a2.append(i+1)\r\nif len(a1) == 1:\r\n print(a1[0])\r\nelse:\r\n print(a2[0])", "n = int(input())\r\narr = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in arr:\r\n\tif i%2==0:\r\n\t\teven = even + 1\r\n\telse:\r\n\t\todd = odd + 1\r\n\r\nif odd > even:\r\n\tfor i in range(0,len(arr)):\r\n\t\tif arr[i] % 2==0:\r\n\t\t\tprint(i+1)\r\nelse:\r\n\tfor i in range(0,len(arr)):\r\n\t\tif arr[i] % 2!=0:\r\n\t\t\tprint(i+1)", "n=int(input())\r\ne=0\r\no=0\r\narr=list(map(int,input().split()))\r\nlaste=lasto=0\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n e+=1\r\n laste=i\r\n else:\r\n o+=1\r\n lasto=i\r\n if e==1 and o>1:\r\n print(laste+1)\r\n break\r\n if o==1 and e>1:\r\n print(lasto+1)\r\n break\r\n ", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Initialize counters for even and odd numbers\r\neven_count = 0\r\nodd_count = 0\r\n\r\n# Find the counts of even and odd numbers\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n even_index = i + 1 # Index of the last even number\r\n else:\r\n odd_count += 1\r\n odd_index = i + 1 # Index of the last odd number\r\n\r\n# Determine the number that differs in evenness\r\nif even_count == 1:\r\n print(even_index)\r\nelse:\r\n print(odd_index)\r\n", "\r\nn = int(input())\r\nnum = list(map(int,input().split()))\r\neven = [];odd = []\r\nfor i in range(n):\r\n if num[i] % 2 == 1:\r\n odd.append(num[i])\r\n else:\r\n even.append(num[i])\r\nif len(odd) == 1:\r\n print(num.index(odd[0])+1)\r\nelse:\r\n print(num.index(even[0])+1)\r\n", "n=int(input())\r\nm=[]\r\nm=input().split()\r\nfor i in range(n):\r\n if int(m[i])%2==0:\r\n m[i]=0\r\n else:\r\n m[i]=1\r\nif m.count(0)>1:\r\n print(m.index(1)+1)\r\nelse:\r\n print(m.index(0)+1)\r\n", "a = []\r\nb = []\r\nn = int(input())\r\ns = list(map(int,input().split(' ')))\r\nfor x in s:\r\n if x%2==0:\r\n a.append(x)\r\n else:\r\n b.append(x)\r\n \r\nif len(a)==1:\r\n print(s.index(a[0])+1)\r\nelse:\r\n print(s.index(b[0])+1)", "n = int(input())\r\nnlist = list(map(int,input().split()[:n]))\r\ncodd = 0\r\nceven = 0\r\ni = 0\r\n\r\nwhile i<n:\r\n if nlist[i] & 1 == 0:\r\n ceven +=1\r\n ineven = i\r\n else:\r\n codd +=1\r\n inodd = i\r\n \r\n i +=1\r\nif ceven == 1:\r\n print(ineven +1)\r\nelse:\r\n print(inodd +1)\r\n", "n=input()\r\nd=[int(i)%2 for i in input().split()]\r\nprint(d.index(d.count(1)==1)+1)", "#25A IQ Test\r\nn=int(input())\r\nif(n<3 or n>100):\r\n print(\"Input valid number in range\")\r\nelse:\r\n li=[]\r\n li=input().split()\r\n even=0\r\n odd=0\r\n j=0\r\n while (j<n):\r\n if(int(li[j])%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\n j+=1\r\n\r\n k=0\r\n\r\n if(odd==1):\r\n while(k<n):\r\n if(int(li[k])%2!=0):\r\n print(k+1)\r\n break\r\n k+=1 \r\n \r\n if(even==1):\r\n while(k<n):\r\n if(int(li[k])%2==0):\r\n print(k+1)\r\n break\r\n k+=1 \r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nones = 0\r\nzeros = 0\r\nind = 1\r\nzo = [0, 0, 0, 0]\r\nfor i in a:\r\n if i%2 == 0:\r\n zeros += 1\r\n zo[2] = ind\r\n ind += 1\r\n else:\r\n ones += 1\r\n zo[3] = ind\r\n ind += 1\r\nif ones == 1:\r\n print(zo[3])\r\nelse:\r\n print(zo[2])", "n = int(input())\r\nm = list(map(int, input().split(\" \")))\r\npar, parI, npar, nparI = 0, 0, 0, 0\r\nfor i in range(n):\r\n if m[i] % 2 == 0:\r\n par += 1\r\n parI = i\r\n else:\r\n npar += 1\r\n nparI = i\r\nif par == 1:\r\n print(parI+1)\r\nelse:\r\n print(nparI + 1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\no,e=0,0\r\nio,ie=0,0\r\n\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n e+=1\r\n ie=i+1\r\n else:\r\n o+=1\r\n io=i+1\r\nif(o==1):\r\n print(io)\r\nelse:\r\n print(ie)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\neven_cnt, odd_cnt = 0, 0\r\nfor i in range(n):\r\n if lst[i] % 2 == 0:\r\n even_cnt += 1\r\n else:\r\n odd_cnt += 1\r\nif odd_cnt < even_cnt:\r\n for i in range(n):\r\n if lst[i] % 2 != 0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if lst[i] % 2 == 0:\r\n print(i+1)", "n=input()\r\n\r\nlst=list(map(int,input().split()))\r\n\r\nlst=list(map(lambda i:i%2,lst))\r\n\r\ns=sum(lst[:3])\r\n\r\nprint(lst.index(s<=1)+1)\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\ncnt_1=0\r\ncnt_2=0\r\nfor i in y:\r\n if i%2==0:\r\n cnt_2+=1\r\n else:\r\n cnt_1+=1\r\nif cnt_1==1:\r\n for i in y:\r\n if i%2==1:\r\n print(y.index(i)+1)\r\nelse:\r\n for i in y:\r\n if i%2==0:\r\n print(y.index(i)+1)", "\r\nn = int(input())\r\nmas = list(map(lambda a: int(a) % 2,input().split()))\r\nprint(mas.index(int(mas.count(1) < mas.count(0)))+1)", "n=int(input())\r\nl=list(map(lambda x:int(x)%2,input().split()))\r\ns=l[0]+l[1]+l[2]\r\nif s <=1:\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)", "n=int(input())\r\np=input().split(' ')\r\nt=[]\r\nfor x in p:\r\n t.append(int(x))\r\neven=[]\r\nodd=[]\r\nfor x in t:\r\n if x%2==0:\r\n even.append(x)\r\n else:\r\n odd.append(x)\r\nif len(even)==1:\r\n print(t.index(even[0])+1)\r\nelse:\r\n print(t.index(odd[0])+1)", "n=int(input())\r\na=[int(i)for i in input().split()]\r\nodds=even=0\r\nx=y=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even+=1\r\n x=i+1\r\n else:\r\n odds+=1\r\n y=i+1\r\nif even==1:\r\n print(x)\r\nelse:\r\n print(y)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\neveni = 0\r\noddi = 0\r\nif s[0] % 2 == 0:\r\n even += 1\r\n eveni = 1\r\nelse:\r\n odd += 1\r\n oddi = 1\r\nif s[1] % 2 == 0:\r\n even += 1\r\n eveni = 2\r\nelse:\r\n odd += 1\r\n oddi = 2\r\nif s[2] % 2 == 0:\r\n even += 1\r\n eveni = 3\r\nelse:\r\n odd += 1\r\n oddi = 3\r\nif even == 1:\r\n print(eveni)\r\nelif odd == 1:\r\n print(oddi)\r\nelif even == 0:\r\n for i in range(3, n + 1):\r\n if s[i - 1] % 2 == 0:\r\n print(i)\r\n break\r\nelif odd == 0:\r\n for i in range(3, n + 1):\r\n if s[i - 1] % 2 != 0:\r\n print(i)\r\n break", "t = int(input())\r\nlis = list(map(int,input().split()))\r\n\r\nnumEven = 0\r\nnumOdd = 0\r\nevenIndex = 0\r\noddIndex = 0\r\nfor i in range(len(lis)):\r\n if lis[i]%2 ==0:\r\n numEven+=1\r\n evenIndex=i\r\n else:\r\n numOdd+=1\r\n oddIndex=i\r\n if numEven>0 and numOdd>0 and numEven!=numOdd:\r\n if numEven==1:\r\n print(evenIndex+1)\r\n else:\r\n print(oddIndex+1)\r\n break", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nres0 = 0\r\n\r\nres1 = 0\r\n\r\nfor el in a:\r\n if el % 2 == 0:\r\n res0 += 1\r\n else:\r\n res1 += 1\r\n\r\ntarget = 0\r\n\r\nif res0 == 1:\r\n target = 0\r\nelse:\r\n target = 1\r\n\r\nfor el in a:\r\n if el % 2 == target:\r\n print(a.index(el) + 1)\r\n", "n = int (input())\na = list(map(int,input().split()))\nzero=0\none=0\nfor i in range(len(a)):\n\tif(a[i]%2==0):\n\t\tzero=zero+1\n\telse:\n\t\tone=one+1\nif(zero<one):\n\tfor i in range(len(a)):\n\t\tif(a[i]%2==0):\n\t\t\tprint( i+1)\nelse:\n\tfor i in range(len(a)):\n\t\tif(a[i]%2==1):\n\t\t\tprint (i+1)\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\nres = 0\r\nfor i in l:\r\n if i % 2 ==0:\r\n even+=1\r\n elif i %2 != 0:\r\n odd+=1\r\nif even> 1:\r\n for i in range(len(l)):\r\n if l[i] % 2 != 0:\r\n res = i+1\r\nelse:\r\n for i in range(len(l)):\r\n if l[i] %2 == 0:\r\n res = i+1 \r\nprint(res) ", "def is_even(n):\r\n if (n%2) == 0:\r\n return True\r\n return False\r\n\r\nnumber=int(input())\r\nnums_string=input()\r\nstring_list=nums_string.split()\r\nnums_list=[]\r\n\r\nfor x in string_list:\r\n nums_list.append(int(x))\r\n\r\nlast_even=0\r\neven_count=0\r\nlast_odd=0\r\nodd_count=0\r\nindex=0\r\n\r\nfor i in range(number):\r\n\r\n if is_even(nums_list[i]):\r\n last_even=i+1\r\n even_count=even_count+1\r\n else:\r\n last_odd=i+1\r\n odd_count=odd_count+1\r\n \r\n if even_count == 1:\r\n index=last_even\r\n else:\r\n index=last_odd\r\n\r\nprint(index)", "mylist = []\r\ndifference = 0\r\n\r\ny = int(input())\r\n\r\n # Input des nombres sous forme de list int #\r\nmylist = list(map(int,input(\"\").strip().split()))\r\n\r\n # Compare le premier input avec la list #\r\nif len(mylist) > y:\r\n difference = len(mylist) - y\r\n\r\n # Supprimer les éléments de la list en trop, s'il y en a #\r\nif difference != 0:\r\n for z in range(0, difference):\r\n del mylist[len(mylist) - 1]\r\n\r\n\r\n # Fonction permettant de déterminer si: #\r\n # 1 nombre est pair et tous les autres impair, puis return le nombre pair #\r\n # 1 nombre est impair et tous les autres pair, puis return le nombre impair #\r\n # Sinon, return None #\r\ndef evenodd(mylist):\r\n impair = pair = 0\r\n for number in mylist:\r\n if number % 2 == 0:\r\n pair += 1\r\n else:\r\n impair += 1\r\n if impair == 1 and pair > 1:\r\n for number in mylist:\r\n if number % 2 != 0:\r\n return mylist.index(number) + 1\r\n elif pair == 1 and impair > 1:\r\n for number in mylist:\r\n if number % 2 == 0:\r\n return mylist.index(number) + 1\r\n\r\n\r\nprint(evenodd(mylist))\r\n", "n=int(input())\r\ni=0\r\nm=input().split()\r\njishu=0\r\noushu=0\r\np=0\r\nfor mnmnmn in m:\r\n if int(mnmnmn)%2==0:\r\n oushu+=1\r\n else:jishu+=1\r\n i+=1\r\n if jishu!=0 and oushu!=0:\r\n break\r\nfor mnmnmn in m:\r\n if int(mnmnmn)%2==0:\r\n oushu+=1\r\n else:jishu+=1\r\nif int(m[0])%2==0 and int(m[1])%2!=0:\r\n if oushu>jishu:\r\n i=2\r\n else:i=1\r\nif int(m[0])%2!=0 and int(m[1])%2==0:\r\n if oushu > jishu:\r\n i=1\r\n else:i=2\r\nprint(int(i))", "n=int(input())\r\nline=list(map(int,input().split()))\r\nif line[0]%2!=line[1]%2:\r\n if line[0]%2==line[2]%2:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n if n==3:\r\n print(3)\r\n else:\r\n for i in range(3,n):\r\n if line[i-1]%2!=line[0]%2:\r\n print(i)\r\n", "n=input()\nx=input().split()\no=0\ne=0\nfor i in range (0,len(x)):\n if int(x[i])%2==0 :\n e+=1\n else :\n o+=1\nif e>=int(n)-1 :\n for i in range(0, len(x)):\n if int(x[i])%2==1 :\n print (i+1)\nelse:\n for i in range(0, len(x)):\n if int(x[i])%2==0 :\n print (i+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\no=0\r\ne=0\r\nfor i in l:\r\n if(i&1):\r\n o+=1\r\n else:\r\n e+=1\r\nif(e==1):\r\n for i in range(n):\r\n if(l[i]&1==0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if(l[i]&1):\r\n print(i+1)\r\n break", "n = int(input())\r\narr = list(map(int, input().split()))\r\ndef tak(arr):\r\n count = 0\r\n for i in arr:\r\n if i % 2 != 0:\r\n count += 1\r\n return count\r\ndef zhup(arr):\r\n count = 0\r\n for i in arr:\r\n if i % 2 == 0:\r\n count += 1\r\n return count\r\nif tak(arr) >= zhup(arr):\r\n for i in range(len(arr)):\r\n if arr[i] % 2 == 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(arr)):\r\n if arr[i] % 2 != 0:\r\n print(i + 1)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nx = 0\r\ny = 0\r\nfor i in range(n):\r\n if l[i]%2 == 0:\r\n x += 1\r\n else:\r\n y += 1\r\nif x > y:\r\n for i in range(n):\r\n if l[i]%2 != 0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if l[i]%2 == 0:\r\n print(i+1)", "n = int(input())\r\nlst = list(map(int,input().strip().split()))[:n]\r\nlst1 = []\r\nlst2 = []\r\nfor item in lst:\r\n if item%2==0:\r\n lst1.append(item)\r\n elif item%2!=0:\r\n lst2.append(item)\r\nA = len(lst1)\r\nB = len(lst2)\r\nif A>B:\r\n print(lst.index(lst2[0])+1)\r\nif A<B:\r\n print(lst.index(lst1[0])+1)\r\n", "\n\nn=int(input())\neven=0\nodd =0\ninp =input()\ninp=inp.split()\n\nfor i in inp:\n i = int(i)\n if(i%2==0):\n even+=1\n else :\n odd+=1\nc =0\nif(even>odd):\n for i in inp:\n i = int(i)\n if (i % 2 != 0):\n print(c+1)\n break\n c +=1\nelse :\n\n for i in inp:\n i = int(i)\n if (i % 2 == 0):\n print(c+1)\n break\n c +=1\n\n", "n=int(input())\na=[int(i)%2 for i in input().split()]\nif a.count(1)>a.count(0):print(a.index(0)+1)\nelse:print(a.index(1)+1)\n\t\t\t \t\t\t \t \t \t \t\t\t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nones=0\r\nfor i in range(n):\r\n d[i+1]=a[i]%2\r\n ones+=a[i]%2\r\nfor i in d:\r\n if(d[i]==0 and ones>n-ones):\r\n print(i)\r\n elif(d[i]==1 and ones<n-ones):\r\n print(i)\r\n", "n = int(input())\r\nL = [int(i) for i in input().split()]\r\neven = 0\r\nodd = 0\r\neveni = 0\r\noddi = 0\r\nfor i in range(n):\r\n if L[i] % 2 == 0:\r\n even = even + 1\r\n eveni = i\r\n else:\r\n odd = odd + 1\r\n oddi = i\r\nif even > odd:\r\n print(oddi + 1)\r\nelse:\r\n print(eveni + 1)", "n=int(input())\r\nl = [int(i)%2 for i in input().split()]\r\no,e = l.count(1),l.count(0)\r\nif o == 1:\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)", "n=int(input())\r\nr=list(map(int,input().split()))\r\nre=[i%2 for i in r]\r\nif sum(re[:3])<2:\r\n case=1\r\nelse:\r\n case=0\r\nfor i in range(n):\r\n if re[i]==case:\r\n print(i+1)\r\n", "n = int(input())\r\nnum = input().split()\r\na = 0\r\nfor i in num:\r\n if int(i)%2 == 0:\r\n a+=1\r\nif a == 1:\r\n for j in num:\r\n if int(j)%2 == 0:\r\n print(num.index(j)+1)\r\nelse:\r\n for k in num:\r\n if int(k)%2 != 0:\r\n print(num.index(k)+1)", "# https://codeforces.com/problemset/problem/25/A\r\n\r\ndef main():\r\n n = int(input())\r\n nums = [int(i) for i in input().split()]\r\n\r\n e, last_e = 0, 0\r\n o, last_o = 0, 0\r\n \r\n for n in nums:\r\n if n % 2 == 0:\r\n e += 1\r\n last_e = n\r\n elif n % 2 == 1:\r\n o += 1\r\n last_o = n\r\n \r\n if e > 1 and o == 1:\r\n print(nums.index(last_o) + 1)\r\n break\r\n elif o > 1 and e == 1:\r\n print(nums.index(last_e) + 1)\r\n break\r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\ngrades = list(map(int, input().split(' ')))\r\nevens = len([grade for grade in grades[:3] if grade % 2 == 0])\r\nif evens > 1: print(grades.index(next(n for n in grades if n % 2 != 0)) + 1)\r\nelse: print(grades.index(next(n for n in grades if n % 2 == 0)) + 1)", "def ii():\r\n return int(input())\r\ndef ss():\r\n return [x for x in input()]\r\ndef si():\r\n return [int(x) for x in input().split()]\r\ndef mi():\r\n return map(int, input().split())\r\n\r\na = ii()\r\ns = si()\r\ns1 = []; s2 = []\r\nfor i in s:\r\n if i % 2:\r\n s1.append(i)\r\n else:\r\n s2.append(i)\r\nif len(s1) == 1:\r\n print(s.index(s1[0]) + 1)\r\nelse:\r\n print(s.index(s2[0]) + 1)", "length = int(input())\r\nnumbers = list(map(int,input().split(\" \")))\r\n\r\nnum_even = [i%2 for i in numbers]\r\n\r\nif sum(num_even) == 1:\r\n print(num_even.index(1)+1)\r\nelse:\r\n print(num_even.index(0)+1)", "n=int(input())\r\nli=list(map(int,input().split()))\r\n\r\nj=list()\r\no=list()\r\n\r\n\r\nfor i in range(len(li)):\r\n if ((len(j)>len(o) and len(o)==1) or (len(o)>len(j) and len(j)==1)):\r\n break\r\n else:\r\n if (li[i])%2==0:\r\n o.append(i)\r\n else:\r\n j.append(i)\r\n\r\nprint(o[0]+1 if len(j)>len(o) else j[0]+1)", "n = int(input())\r\nm = map(int, input().split())\r\nlist = []\r\neven = 0\r\nodd = 0\r\nplace = 0\r\nfor i in m:\r\n if i % 2 == 0:\r\n even +=1\r\n if i % 2 == 1:\r\n odd += 1\r\n list.append(int(i))\r\nfor j in list:\r\n place += 1\r\n if even > odd and j % 2 == 1:\r\n print(place)\r\n if even < odd and j % 2 == 0:\r\n print(place)", "input()\r\ndef r(x):\r\n return int(x)/2-int(int(x)/2)\r\nl=list(map(r,input().split()))\r\nif l.count(0.0)==1:\r\n print(l.index(0.0)+1)\r\nelse:\r\n print(l.index(0.5)+1)", "n = int(input())\r\ns = list(map(int,input().split()))\r\n\r\neven_pos = -1\r\nodd_pos = -1\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n even_pos = i\r\n else:\r\n odd_pos = i\r\n cnt += 1\r\n\r\nif cnt==1:\r\n print(odd_pos+1)\r\nelse:\r\n print(even_pos+1)\r\n\r\n\r\n", "n=int(input())\r\np=[int(i) for i in input().split()]\r\nq=[]\r\ns=0\r\nm=0\r\nfor i in range(n):\r\n q.append(p[i]%2)\r\n if q[i]==1:\r\n m+=1\r\n m_=i\r\n else:\r\n s+=1\r\n s_=i\r\nif m>s:\r\n print(s_+1)\r\nelse:\r\n print(m_+1)\r\n \r\n \r\n\r\n \r\n", "istr = lambda: input()\r\ninum = lambda: int(input())\r\nimap = lambda: map(int,input().split())\r\nilist = lambda: list(map(int, input().split()))\r\n\r\nn = inum()\r\narr = ilist()\r\neve, odd = [], []\r\nfor i in range(n):\r\n if arr[i] % 2:\r\n eve.append(i + 1)\r\n else:\r\n odd.append(i + 1)\r\nprint(*odd if len(odd) == 1 else eve)", "n = int(input())\r\ns = tuple(map(int, input().split()))\r\neven = []\r\nodd = []\r\nfor a in s:\r\n if a % 2 == 0:\r\n even.append(a)\r\n else:\r\n odd.append(a)\r\n\r\nif len(odd) == 1:\r\n print(s.index(odd[0]) + 1)\r\nelse:\r\n print(s.index(even[0]) + 1)\r\n", "n = int(input())\nx = list(map(int,input().split()))\neven = []\nodd = []\nfor i in range (len(x)):\n if x[i] % 2 == 0:\n even.append(x[i])\n else:\n odd.append(x[i])\nif len(odd) == 1:\n for i in range(len(x)):\n if odd[0] == x[i]:\n print(i+1)\nif len(even) == 1:\n for i in range(len(x)):\n if even[0] == x[i]:\n print(i+1)", "input()\nl = list(map(lambda x: x % 2, list(map(lambda x: int(x), list(input().split())))))\nones, zeros = l.count(1), l.count(0)\nif ones > zeros:\n print(l.index(0) + 1)\nelse:\n print(l.index(1) + 1)\n", "input()\r\nK = list(map(int, input().split()))\r\nevens = 0 \r\nunevens = 0\r\nfor e in K:\r\n if e % 2 == 0:\r\n evens += 1\r\n else:\r\n unevens += 1\r\nres = True if unevens == 1 else False \r\nfor i, e in enumerate(K):\r\n if e % 2 == res:\r\n print(i + 1)\r\n break", "n=int(input())\nnumbers=[int(x) for x in input().split()] \nji=0;ou=0\nfor i in range (0,3):\n if numbers[i]%2==0:\n ou+=1\n else:ji+=1\nif ji<ou:\n for j in range (0,n):\n if numbers[j]%2 != 0:\n print(j+1)\nelse:\n for k in range (0,n):\n if numbers[k]%2 == 0:\n print(k+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\neven_count = 0\r\nodd_count = 0\r\nlast_even_index = -1\r\nlast_odd_index = -1\r\nfor i in range(n):\r\n if a[i] %2 == 0:\r\n even_count +=1\r\n last_even_index = i\r\n else :\r\n odd_count +=1\r\n last_odd_index = i\r\nif even_count == 1:\r\n print(last_even_index +1)\r\nelse :\r\n print(last_odd_index +1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n c.append(a[i]%2)\r\nd,e=c.count(0),c.count(1)\r\nif(d>e):\r\n print(c.index(1)+1)\r\nelse:\r\n print(c.index(0)+1)\r\n", "from sys import maxsize, stdout, stdin, stderr\r\n# mod = int(1e9 + 7)\r\nimport re # can use multiple splits\r\ntup = lambda: map(int, stdin.readline().split())\r\nI = lambda: int(stdin.readline())\r\nlint = lambda: [int(x) for x in stdin.readline().split()]\r\nS = lambda: stdin.readline().replace('\\n', '').strip()\r\ndef grid(r, c): return [lint() for i in range(r)]\r\ndef debug(*args, c=6): print('\\033[3{}m'.format(c), *args, '\\033[0m', file=stderr)\r\nstpr = lambda x : stdout.write(f'{x}' + '\\n')\r\nstar = lambda x : print(' '.join(map(str , x)))\r\nfrom math import *\r\nfrom collections import defaultdict\r\nn = I()\r\nev , od = [], []\r\nls = lint()\r\nfor i in range(n):\r\n if ls[i]%2:od.append(i+1)\r\n else:ev.append(i+1)\r\nif len(ev)==1:print(ev[0])\r\nelse:print(od[0])\r\n\r\n\r\n\r\n\r\n\r\n", "num = int(input())\r\nevens = []\r\nodds = []\r\nif 2<num<101:\r\n x=list(map(int,input().split()))\r\n for i in range(num):\r\n if x[i] % 2 == 0:\r\n evens.append(i+1)\r\n else:\r\n odds.append(i+1)\r\n if len(evens)> len(odds):\r\n print(odds[0])\r\n else:\r\n print(evens[0])\r\nelse:\r\n print(\"minimum numbers = 3\")\r\n", "n=int(input())\r\na=[int(j) for j in input().split()]\r\nt=[]\r\nif a[0]%2==0:\r\n t.append(0)\r\nelse:\r\n t.append(1)\r\nif a[1]%2==0:\r\n t.append(0)\r\nelse:\r\n t.append(1)\r\nif a[2]%2==0:\r\n t.append(0)\r\nelse:\r\n t.append(1)\r\n\r\nif t[0]==t[1]==t[2]:\r\n for i in a:\r\n if i%2!=t[0]:\r\n print(a.index(i)+1)\r\nif t[0]==t[1] and t[0]!=t[2]:\r\n print(3)\r\nif t[1]==t[2] and t[1]!=t[0]:\r\n print(1)\r\nif t[0]==t[2] and t[0]!=t[1]:\r\n print(2)\r\n", "n= input()\r\nsnumbers=input().split()\r\nnumber=[None]*int(n)\r\nfor i in range (int(n)):\r\n number[i]=int(snumbers[i])\r\nk=0\r\nif (number[0]%2==number[1]%2):\r\n k=number[0]%2\r\n for i in range(int(n)):\r\n if (number[i]%2!=k):\r\n break\r\n print(i+1)\r\nelif (number[0]%2==number[2]%2):\r\n print(2)\r\nelse:\r\n print(1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=[]\r\nfor i in l:\r\n if i%2==0:\r\n r.append(0)\r\n else:\r\n r.append(1)\r\nif r.count(0)>1:\r\n print(r.index(1)+1)\r\nelse:\r\n print(r.index(0)+1)", "if __name__ == '__main__':\r\n\tn=int(input())\r\n\ta=list(map(int,input().split()))\r\n\teven_count=0\r\n\todd_count=0\r\n\tfor i in range(n):\r\n\t\tif(int(a[i]%2)==0):\r\n\t\t\teven_count += 1\r\n\t\t\tif(even_count==1):\r\n\t\t\t\teven_index=i+1\r\n\t\t\tif((odd_count==1 and even_count>1) or (odd_count>1 and even_count==1)):\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\todd_count += 1\r\n\t\t\tif(odd_count==1):\r\n\t\t\t\todd_index=i+1\r\n\t\t\tif((odd_count==1 and even_count>1) or (odd_count>1 and even_count==1)):\r\n\t\t\t\tbreak\r\n\tif(even_count==1 and odd_count>1):\r\n\t\tprint(even_index)\r\n\telse:\r\n\t\tprint(odd_index)", "even=[]\r\nodd=[]\r\nh=input()\r\nx=list(map(int,(input().split())))[0:]\r\n\r\nfor i in x:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n \r\nif len(even)==1:\r\n print(x.index(even[-1])+1)\r\nelif len(odd)==1:\r\n print(x.index(odd[-1])+1)", "n=int(input())\r\ns=list(map(int,input().split(' ')))\r\nl=[True if i%2==0 else False for i in s ]\r\np=max(set(l),key=l.count)\r\nif p==True:\r\n\tprint(l.index(min(l))+1)\r\nelse:\r\n\tprint(l.index(max(l))+1)\r\n\t", "n = int(input())\r\naa = [int(i) % 2 for i in input().split()]\r\nif aa.count(0) == 1:\r\n print(aa.index(0) + 1)\r\nelif aa.count(1) == 1:\r\n print(aa.index(1) + 1)\r\n", "input()\r\na = [int(x) for x in input().split()]\r\nb = [str(x % 2) for x in a]\r\n\r\nif b.count('0') == 1:\r\n print(b.index('0') + 1)\r\nelif b.count('1') == 1:\r\n print(b.index('1') + 1)", "n = int(input())\r\n\r\narr = [int(i) for i in input().split(\" \")]\r\n\r\nif arr[0]%2==arr[1]%2:\r\n flag = arr[0]%2\r\nelse:\r\n if arr[0]%2==arr[2]%2:\r\n flag = arr[0]%2\r\n else:\r\n flag = arr[1]%2\r\n \r\nfor i in range(n):\r\n if arr[i]%2!=flag:\r\n ans = i\r\n break\r\n \r\nprint(ans+1)\r\n ", "n=int(input())\r\na=list(map(lambda x: int(x),input().split()))\r\nif(len(list(filter(lambda x: x%2==0,a)))==1):\r\n print(a.index(list(filter(lambda x: x%2==0,a))[0])+1)\r\nelse:\r\n print(a.index(list(filter(lambda x: x%2==1,a))[0])+1)\r\n", "input()\r\nli = [int(int(x)%2) for x in input().split()]\r\nif li.count(1) > 1:\r\n print(li.index(0)+1)\r\nelse:\r\n print(li.index(1)+1)\r\n", "n = int(input())\r\n\r\nm = []\r\nfor i in map(int, input().split()):\r\n m.append(i)\r\n\r\nflag = []\r\n\r\nfor i in m:\r\n if i % 2 == 0:\r\n flag.append(2)\r\n else:\r\n flag.append(1)\r\n\r\nflagg = flag.copy()\r\nflag.sort()\r\nif flag[0] == flag[1]:\r\n f = flag[len(flag)-1]\r\nelse:\r\n f = flag[0]\r\n\r\nc = 0\r\nfor i in flagg:\r\n c += 1\r\n if i == f:\r\n print(c)\r\n break\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na1=[]\r\na2=[]\r\nfor i in range(len(a)):\r\n if(a[i]%2==0):\r\n\r\n a1.append(i+1)\r\n else:\r\n \r\n a2.append(i+1)\r\nif(len(a1)==1):\r\n print(*a1)\r\nelse:\r\n print(*a2)\r\n", "n=int(input())\r\nline=input().split() \r\nfor i in range(n):\r\n line[i]=int(line[i])\r\nif line[0]%2==line[1]%2:\r\n for i in range(2,n):\r\n if not line[i]%2==line[0]%2:\r\n print(i+1)\r\nelse:\r\n if line[1]%2==line[2]%2:\r\n print(1)\r\n if line[0]%2==line[2]%2:\r\n print(2) ", "a=int(input())\r\nb=list(map(int,input().split()))\r\nev=0\r\nind1=0\r\nod=0\r\nind2=0\r\nfor i in range(len(b)):\r\n if b[i]%2==0:\r\n ev+=1\r\n ind1=i+1\r\n else:\r\n od+=1\r\n ind2=i+1\r\n if (ev>1 and od==1) or (od>1 and ev==1):\r\n if ev>od:\r\n print(ind2)\r\n break\r\n else:\r\n print(ind1)\r\n break\r\n", "t=int(input())\r\nn=list(map(int,input().split()))\r\nx,y=0,0\r\no,e=0,0\r\nfor i in range(t):\r\n if n[i]%2==0:\r\n x+=1\r\n e=i+1\r\n else:\r\n y+=1\r\n o=i+1\r\nif x>y:\r\n print(o)\r\n\r\nelse:\r\n print(e)\r\n\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncount_even = 0; count_odd = 0\r\nfor i in range(n):\r\n if arr[i]%2 == 0:\r\n count_even+=1\r\n else:\r\n count_odd += 1\r\nif count_even == 1:\r\n for i2 in range(n):\r\n if arr[i2]%2 == 0:\r\n print(i2 + 1)\r\n break\r\nif count_odd == 1:\r\n for i2 in range(n):\r\n if arr[i2]%2 != 0:\r\n print(i2 + 1)\r\n break", "n=int(input())\r\nnums=list(map(int,input().split()))\r\ncounte=counto=indexe=indexo=0\r\nfor i in range(0,n,1):\r\n if nums[i]%2==0:\r\n counte=counte+1\r\n indexe=i+1\r\n else:\r\n counto=counto+1\r\n indexo=i+1\r\nif counte==1:\r\n print(indexe)\r\nelse:\r\n print(indexo)", "n = int(input())\r\narr = list(map(int, input().split()))\r\na = 0\r\nb = 0\r\n\r\nfor num in arr:\r\n if num % 2 == 0:\r\n a += 1\r\n else:\r\n b += 1\r\n\r\nc = 0\r\nif a < b:\r\n for i in range(n):\r\n if arr[i] % 2 == 0:\r\n c = i + 1\r\nelse:\r\n for i in range(n):\r\n if arr[i] % 2 != 0:\r\n c = i + 1\r\n\r\nprint(c)", "n=int(input())\nnum=[int(i) for i in input().split()]\ns=0\nfor i in range(3):\n if num[i]%2==0:\n s+=1\n\nif s==0 or s==1:\n for i in range(n):\n if num[i]%2==0:\n k=i\n print(k+1)\nelse:\n for i in range(n):\n if num[i]%2!=0:\n k=i\n print(k+1)\n \n", "n=int(input())\r\nrese=[]\r\nreso=[]\r\nl=list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n rese.append(i+1)\r\n else:\r\n reso.append(i+1)\r\nif(len(rese)==1):\r\n print(rese[0])\r\nelif(len(reso)==1):\r\n print(reso[0])", "n = int(input())\r\nli = list(map(int,input().split()))[:n]\r\ncountOdd = 0\r\ncoundeven = 0\r\nfor i in li:\r\n if i%2==0:\r\n coundeven+=1\r\n else:\r\n countOdd+=1\r\n\r\nif coundeven>countOdd:\r\n for i in range(n):\r\n if li[i]%2!=0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if li[i]%2==0:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nlist = [int(i) for i in input().split()]\r\n\r\nji = 0\r\nou = 0\r\nt = 0\r\np = 0\r\nfor i in range(0,n):\r\n if list[i]%2 == 0:\r\n ou = ou+1\r\n p = i\r\n else:\r\n ji = ji+1\r\n t = i\r\n\r\nif ou == 1:\r\n print(p+1)\r\nif ji == 1:\r\n print(t+1)\r\n \r\n", "n = int(input())\nnums = list(map(int, input().split()))\n\n\nclass Numbers:\n def __init__(self):\n self.count = 0\n self.current_index = 0\n\n\neven = Numbers()\nodd = Numbers()\nfor i in range(n):\n if nums[i] % 2 == 0:\n even.count += 1\n even.current_index = i + 1\n else:\n odd.count += 1\n odd.current_index = i + 1\n\nif even.count > 1:\n print(odd.current_index)\nelif odd.count > 1:\n print(even.current_index)", "n = int(input())\nvec = input().split(' ')\nvec = [int(v)%2 for v in vec]\nif vec.count(1) == 1:\n print(vec.index(1)+1)\nelse:\n print(vec.index(0)+1)\n\t\t\t\t\t\t\t \t \t \t \t \t\t\t \t \t", "c1, c2, odd, even = 0, 0, 0, 0\r\nn = int(input())\r\n\r\nl = list(map(int, input().strip().split()))[:n]\r\n\r\nfor i in range(0, n):\r\n if l[i] % 2 == 0:\r\n c1 += 1\r\n even = i\r\n else:\r\n c2 += 1\r\n odd = i\r\n\r\nif max(c1, c2) == n:\r\n print(0)\r\nif c1 > c2:\r\n print(odd+1)\r\nelse:\r\n print(even+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nvar,op=-1,0\r\nif((l[0] & 1) and (l[1] & 1)):\r\n\tvar=1\r\nelif((l[0] & 1==0) and (l[1] & 1==0)):\r\n\tvar=0\r\nelif((l[0]%2!=0 and l[2]%2!=0) or (l[0]%2==0 and l[2]%2==0)):\r\n\top=1\r\nelif((l[1]%2!=0 and l[2]%2!=0) or (l[1]%2==0 and l[2]%2==0)):\r\n\top=0\r\nif(var==-1):\r\n\tprint(op+1)\r\nelse:\r\n\tfor i in range(2,n):\r\n\t\tif((l[i] & 1) !=var):\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n = int(input())\r\na = list(map(int,input().split()))\r\nchet = 0\r\nnecht = 0\r\nfor i in a:\r\n if i % 2 == 1:\r\n necht += 1\r\n else:\r\n chet += 1\r\nif necht > chet:\r\n for i in a:\r\n if i%2 == 0:\r\n print(a.index(i)+1)\r\nelse:\r\n for i in a:\r\n if i % 2 == 1:\r\n print(a.index(i)+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc_even,c_odd=0,0\r\nfor num in a:\r\n if num%2==0:\r\n c_even+=1\r\n x=num\r\n else:\r\n c_odd+=1\r\n y=num\r\nif c_even==1:\r\n print(a.index(x)+1)\r\nelse:\r\n print(a.index(y)+1)", "n=int(input())\r\nar=list(map(int,input().split(' ')))\r\nar1=[]\r\nfor i in range(n):\r\n ar1.append(ar[i]%2)\r\nif(ar1.count(1)==1):\r\n l=ar1[::-1].index(1)\r\n print(n-l)\r\nelse:\r\n l=ar1[::-1].index(0)\r\n print(n-l)\r\n\r\n \r\n \r\n", "num = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nodds = []\r\neven = []\r\n\r\nfor i, num in enumerate(arr, start=1):\r\n if num % 2 == 0:\r\n even.append(i)\r\n else:\r\n odds.append(i)\r\n\r\nif len(odds) == 1:\r\n print(*odds)\r\nelse:\r\n print(*even)\r\n\r\n\r\n", "n=int(input())\r\nm=input().split()\r\nif n>3:\r\n for i in range(n):\r\n if int(m[i]) % 2 != int(m[i + 1]) % 2 and int(m[i]) % 2 != int(m[i - 1]) % 2:\r\n print(i + 1)\r\n break\r\nif n==3:\r\n a=int(m[0])%2\r\n b=int(m[1])%2\r\n c=int(m[2])%2\r\n if a==b:print(3)\r\n if b==c:print(1)\r\n if a==c:print(2)", "i = int(input())\r\nj = list(map(int,input().split()))\r\n\r\ne = list (filter(lambda x : x % 2 ==0 , j))\r\no = list (filter(lambda x : x % 2 !=0 , j))\r\n\r\nle = len(e)\r\nlo = len(o)\r\n\r\nif le == 1 :\r\n x = e\r\nelif lo == 1 :\r\n x = o\r\nelse:\r\n pass\r\ny = x[0]\r\nprint(j.index(y)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\no=0\r\ne=0\r\noi=0\r\nei=0\r\nfor i in range(len(a)):\r\n if(a[i]%2==0):\r\n e+=1\r\n ei=i\r\n else:\r\n o+=1\r\n oi=i\r\nif(o>e):\r\n print(ei+1)\r\nelse:\r\n print(oi+1)", "n = int(input())\nm = [int(x) for x in input().split()]\nfor i in range(n):\n m[i]%=2\ny = m.count(1)\nz = m.count(0)\nif (y>z):\n for i in range(n):\n if (m[i]==0):\n print(i+1)\n break\nelse :\n for i in range(n):\n if (m[i]==1):\n print(i+1)\n break\n\t\t\t\t\t\t \t \t\t \t \t \t \t\t\t\t \t\t\t\t", "n = int(input())\r\nl = input().split()\r\nm = ''\r\nfor i in range(n):\r\n m = m + str(int(l[i])%2)\r\nif m.count('1')==1:\r\n print(int(m.index('1'))+1)\r\nelse:\r\n print(int(m.index('0'))+1)", "number=int(input())\r\nn=list(map(int,input().split()))\r\nverify=[n[0]%2,n[1]%2,n[2]%2]\r\nif verify.count(0)>1:\r\n for i in n:\r\n if i%2==1:\r\n print(n.index(i)+1)\r\nelse:\r\n for i in n:\r\n if i % 2 == 0:\r\n print(n.index(i)+1)", "n=int(input())\r\narr=list(int(x) for x in input().split())\r\neven=0\r\nfor i in arr:\r\n\tif i%2==0:\r\n\t\teven+=1\r\n\r\nif even==n-1:\r\n\tfor i in range(len(arr)):\r\n\t\tif arr[i]%2!=0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelif even==1:\r\n\tfor i in range(len(arr)):\r\n\t\tif arr[i]%2==0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "n = int(input())\r\nremains = list(map(int, input().split()))\r\nremains = [i % 2 for i in remains]\r\nif remains.count(0) == 1:\r\n print(remains.index(0) + 1)\r\nelse:\r\n print(remains.index(1) + 1)", "n=int(input())\na=[int(i) for i in input().split()]\n\ndef checkParity(a):\n b=a.copy()\n ans=\"none\"\n while len(b)!=0:\n if ans==\"none\":\n if b[0]%2==0:\n ans=\"odd\"\n b.pop(0)\n else:\n ans=\"even\"\n b.pop(0)\n else:\n if b[0]%2==0:\n if ans==\"odd\":\n b.pop(0)\n else:\n return \"none\"\n else:\n if ans==\"even\":\n b.pop(0)\n else:\n return \"none\"\n return ans\n\nfor i in range(n):\n aux=a[i]\n a.pop(i)\n if checkParity(a)!=\"none\":\n print(i+1)\n break\n else:\n a.insert(i,aux)\n\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nic=-1\r\ncc=0\r\ninc=-1\r\ncn=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n if ic==-1:\r\n ic=i+1\r\n cc+=1\r\n else:\r\n if inc==-1:\r\n inc=i+1\r\n cn+=1\r\nif cc>cn:\r\n print(inc)\r\nelse:\r\n print(ic)", "n=int(input())\r\nL=[int(x) for x in input().split()]\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n if L[i]%2==0 and L[i]!=1:\r\n a.append(L[i])\r\n else:\r\n b.append(L[i])\r\nif len(a)<len(b):\r\n print(L.index(a[0])+1)\r\nelse:\r\n print(L.index(b[0])+1)\r\n", "n=int(input())\ns=list(map(int,input().split()))\na=[]\nb=[]\nfor i in range(len(s)):\n\tif s[i]%2==0:\n\t\ta.append(i)\n\telse:\n\t\tb.append(i)\nprint (a[0]+1 if(len(a)==1) else b[0]+1)\n\t\n\t\n\t\t\t\n\t\t\n\t\t\t\t\t\n\t\t\t\n\t\n", "def iq(n,l):\r\n x=[]\r\n y=[]\r\n for i in range(len(l)):\r\n if l[i]%2==0:\r\n x.append(i+1)\r\n else:\r\n y.append(i+1)\r\n if len(x)>len(y):\r\n for i in range(len(y)):\r\n k=y[i]\r\n return k\r\n else:\r\n for i in range(len(x)):\r\n k=x[i]\r\n return k\r\n \r\n\r\ndef main():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n a=iq(n,l)\r\n print(a)\r\nmain()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nec=0\r\noc=0\r\nei=0\r\noi=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n ec+=1\r\n ei=i+1\r\n else:\r\n oc+=1\r\n oi=i+1\r\nif ec==1:\r\n print(ei)\r\nelse:\r\n print(oi)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ne = []\r\no = []\r\nfor a in l:\r\n if a%2 == 0:\r\n e.append(a)\r\n else:\r\n o.append(a)\r\nif len(e) == 1:\r\n print(l.index(e[0])+1)\r\nelif len(o) == 1:\r\n print(l.index(o[0])+1)", "def main():\n n = int(input())\n list = input().split(' ')\n even = []\n odd = 0\n pair = 0\n for i in range(n):\n a = int(list[i])%2\n if a:\n odd += 1\n else:\n pair += 1\n even.append(a)\n if odd == 1:\n print(even.index(1) + 1)\n else:\n print(even.index(0) + 1)\nif __name__ == \"__main__\":\n main()\n\t \t\t \t\t\t\t\t \t \t \t\t \t\t\t \t", "n = int(input())\r\nlst = list(map(int,input().split()))\r\n\r\nif (lst[0] % 2 == 0 and (lst[1] % 2 == 0 or lst[2] % 2 == 0)) or (lst[2] % 2 == 0 and (lst[0] % 2 == 0 or lst[1] % 2 == 0)):\r\n for i in range(len(lst)):\r\n if lst[i] % 2 != 0:\r\n print(i+1) \r\nelif (lst[0] % 2 != 0 and (lst[1] % 2 != 0 or lst[2] % 2 != 0)) or (lst[2] % 2 != 0 and (lst[0] % 2 != 0 or lst[1] % 2 != 0)):\r\n for i in range(len(lst)):\r\n if lst[i] % 2 == 0:\r\n print(i+1)", "n = int(input())\r\nsp = list(map(int, input().split()))\r\nlol = list(filter(lambda x: x % 2 != 0, sp))\r\nkek = list(filter(lambda x: x % 2 == 0, sp))\r\nif len(lol) == 1:\r\n print(sp.index(lol[0]) + 1)\r\nelse:\r\n print(sp.index(kek[0]) + 1)", "def solve(n, a):\n odds = [i for i in a if i & 1]\n evens = [i for i in a if i % 2 == 0]\n return a.index(odds[0]) + 1 if len(odds) == 1 else a.index(evens[0]) + 1\n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))\n\n\nmain()\n", "#t=int(input())\r\n#for i in range(t):\r\n# n,r=map(int,input().split())\r\n# a=list(map(int,input().split()))\r\n# bomb=0\r\n# a.sort()\r\n# a=list(set(a))\r\n# n=len(a)\r\n# for i in range(n):\r\n# if (a[i]>bomb*r):\r\n# bomb+=1\r\n# print(bomb-1)\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nleven,lodd,ceven,codd=0,0,0,0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n ceven+=1\r\n leven=i\r\n else:\r\n codd+=1\r\n lodd=i\r\nif codd==1:\r\n print(lodd+1)\r\nelse:\r\n print(leven+1)\r\n ", "n = int(input())\r\na = tuple(int(x) for x in input().split())\r\ncount_odd = 0\r\ncount_even = 0\r\n\r\nfor i in range(n):\r\n if a[i] % 2:\r\n count_odd += 1\r\n idx_odd = i+1\r\n else:\r\n count_even += 1\r\n idx_even = i+1\r\n\r\nif count_even == 1:\r\n print(idx_even)\r\nelse:\r\n print(idx_odd)", "n = int(input())\r\na = list(map(int,input().split()))\r\nodd = even = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nans = 0\r\nif odd < even:\r\n ans = 1\r\nelse:\r\n ans = 0\r\nra = 0\r\nfor i in range(n):\r\n if a[i] % 2 == ans:\r\n ra = i+1\r\n break\r\nprint(ra)\r\n", "n=int(input())\ns = [int(x) for x in input().split()]\ncount2=0\ncount1=0\nfor i in range (n):\n if s[i]%2==0:\n count2+=1\n y=i+1\n elif s[i]%2==1:\n count1+=1\n x=i+1\nif count2>count1:\n print(x)\nelse:\n print(y)", "a=int(input())\r\nb=input()\r\nk,x=0,0\r\nm=[]\r\nn=b+' '\r\np1,p2=0,0\r\nwhile k!=a:\r\n\ts=''\r\n\twhile n[x]!=' ':\r\n\t\ts+=n[x]\r\n\t\tx+=1\r\n\tm+=[int(s)]\r\n\tk+=1\r\n\tx+=1\r\nfor i in range(a):\r\n\tif m[i]%2==0:\r\n\t\tp1+=1\r\n\telse:\r\n\t\tp2+=1\t\r\nif p1>p2:\r\n\tfor i in range(a):\r\n\t\tif m[i]%2!=0:\r\n\t\t\tprint(i+1)\r\nelse:\r\n\tfor i in range(a):\r\n\t\tif m[i]%2==0:\r\n\t\t\tprint(i+1)\t\t\t ", "x = int(input())\r\nn = list(map(int, input().split()))\r\ncount = 0\r\nfor i in n:\r\n if i%2 == 0:\r\n count+=1\r\nif count >= 2:\r\n for i in n:\r\n if i%2 !=0:\r\n print(n.index(i)+1)\r\nelse:\r\n for i in n:\r\n if i%2 == 0:\r\n print(n.index(i)+1)", "n = int(input())\nnumbers = list(map(int, input().split()))\n\ncountEven = 0\nlastEven = 0\ncountOdd = 0\nlastOdd = 0\n\n\nfor count, i in enumerate(numbers):\n if i % 2 == 0:\n countEven += 1\n lastEven = count\n else:\n countOdd += 1\n lastOdd = count\n\nif countEven == 1:\n print(lastEven+1)\nelse:\n print(lastOdd+1)\n", "p=int(input())\r\nn=0\r\nb=list(map(int,input().split()))\r\nfor x in range(3):\r\n if b[x]%2==0:\r\n n+=1\r\nif n>=2:\r\n for x in range(p):\r\n if b[x]%2==1:\r\n print(x+1)\r\n exit()\r\nelse:\r\n for x in range(p):\r\n if b[x]%2==0:\r\n print(x+1)\r\n exit()", "# https://codeforces.com/problemset/problem/25/A\n\nfrom typing import *\n\ndef get_different_index(a: List[int]) -> int:\n if a[0] % 2 != a[1] % 2:\n if a[1] % 2 != a[2] % 2:\n return 2\n else:\n return 1\n\n for i in range(len(a) - 1):\n if a[i] % 2 != a[i + 1] % 2:\n return i + 2\n return -1\n\n\nif __name__ == '__main__':\n n = int(input())\n numbers = [int(x) for x in input().split(' ')]\n print(get_different_index(numbers))", "n=int(input())\r\na=list(input().split())\r\n\r\neven=0\r\nodd=0\r\nb=[]\r\nfor i in range(n):\r\n x=int(a[i])%2\r\n b.append(x)\r\n if x==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\nif even==1:\r\n print(b.index(0)+1)\r\nelse:\r\n print(b.index(1)+1)", "n = int(input())\r\nst = list(map(int,input().split()))\r\nev = 0\r\nod = 0\r\nevk = 0\r\nodk = 0\r\nfor i in range(len(st)):\r\n if st[i]%2==0:\r\n ev=ev+1\r\n evk = i+1\r\n else:\r\n od = od+1\r\n odk=i+1\r\nif ev==1:\r\n print(evk)\r\nelse:\r\n print(odk)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nevenCount = 0\r\noddCount = 0\r\n\r\nfor number in numbers:\r\n if number % 2 == 0:\r\n evenCount += 1\r\n else:\r\n oddCount += 1\r\n\r\ndifferentEvenness = evenCount > oddCount\r\n\r\nfor i in range(n):\r\n if (differentEvenness and numbers[i] % 2 != 0) or (not differentEvenness and numbers[i] % 2 == 0):\r\n print(i + 1)\r\n break\r\n", "n = int(input())\r\ninputs = []\r\neven = []\r\nodd = []\r\nflag = 0\r\ncount = 1\r\ninputs.append(input().split())\r\nfor i in inputs[0]:\r\n tmp = int(i)\r\n if(tmp%2==0):\r\n even.append(tmp)\r\n else:\r\n odd.append(tmp)\r\nif(len(even)>len(odd)):\r\n flag = 0\r\nelse:\r\n flag = 1\r\nfor i in inputs[0]:\r\n tmp = int(i)\r\n if(tmp%2==0 and flag==0):\r\n count +=1\r\n continue\r\n elif(tmp%2==0 and flag==1):\r\n print(count)\r\n break\r\n elif(tmp%2!=0 and flag==1):\r\n count +=1\r\n continue\r\n else:\r\n print(count)\r\n break", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=c2=0\r\nfor i in l:\r\n\tif i&1==0:\r\n\t\tc+=1\r\n\telse:\r\n\t\tc2+=1\r\nif c2==1:\r\n\tfor i in l:\r\n\t\tif i&1!=0:\r\n\t\t\tprint(l.index(i)+1)\r\n\t\t\tbreak\r\nelif c==1:\r\n\tfor i in l:\r\n\t\tif i&1==0:\r\n\t\t\tprint(l.index(i)+1)\r\n\t\t\tbreak", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif l[-1]%2!=l[-2]%2:\r\n if l[-1]%2!=l[-3]%2:\r\n print(n)\r\n elif l[-2]%2!=l[-3]%2:\r\n print(n-1)\r\nfor i in range(n-2):\r\n if l[i]%2!=l[i+1]%2 and l[i]%2!=l[i+2]%2:\r\n print(i+1)\r\n", "_ = input()\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nnumEven = 0\r\n\r\nif nums[0] % 2 == 0:\r\n numEven += 1\r\nif nums[1] % 2 == 0:\r\n numEven += 1\r\nif nums[2] % 2 == 0:\r\n numEven += 1\r\n\r\nif numEven >= 2:\r\n for i in range(len(nums)):\r\n if nums[i] % 2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(nums)):\r\n if nums[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n", "n = input()\r\nx = input()\r\na,b = 0,0\r\nlst = x.split()\r\nlst = [int(lst[i])for i in range(len(lst))]\r\nfor i in range(len(lst)):\r\n if lst[i] % 2 == 0:\r\n a += 1\r\n if lst[i] % 2 == 1:\r\n b += 1\r\nif a > b:\r\n for i in range(len(lst)):\r\n if lst[i]%2 == 1:\r\n print(i+1)\r\nelif a < b:\r\n for i in range(len(lst)):\r\n if lst[i]%2 == 0:\r\n print(i+1)", "n = int(input())\r\nl = [0] + list(map(int,input().split(\" \")))\r\nt = [0,l[1]%2,l[2]%2]\r\ndef res(t,l,n):\r\n \r\n if t[1]!=t[2]:\r\n if l[3]%2==t[1]:return 2\r\n else:return 1\r\n else:\r\n for i in range(3,n+1):\r\n t.append(l[i]%2)\r\n if t[i] != t[1]:return i\r\nprint(res(t,l,n))\r\n", "n = int(input())\r\na = list(map(int, input().split()));e = 0;odd = 0;index1 = 0;index2 = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n e += 1\r\n index1 = i\r\n else:\r\n odd += 1\r\n index2 = i\r\nprint(index2+1 if e > odd else index1+1)", "#-*- coding:utf-8 -*-\r\n\r\n\r\n#Get integer \r\n# Num = input()\r\n# NumList = input().split()\r\n# evenNum = 0\r\n# \r\n# if int(NumList[0])%2 == 0:\r\n# pass\r\n# else:\r\n# evenNum = 1\r\n# \r\n# for i in range(1,int(Num)):\r\n# if int(NumList[i])%2 == evenNum:\r\n# continue\r\n# else:\r\n# if int(NumList[i+1])%2 == int(NumList[i])%2:\r\n# print(i)\r\n# break\r\n# else:\r\n# print(i+1)\r\n# break\r\n\r\n# 입력을 받는다\r\nnumberCount = int(input())\r\ntempList = list(map(int, input().split(\" \")))\r\n\r\nnumberList = [x%2 for x in tempList]\r\n\r\nnumberDict = dict()\r\n\r\n# 0=>짝찾기 1=>홀찾기\r\noddFlag = -1\r\n\r\n\r\nfirst = numberList[0]\r\nsecond = numberList[1]\r\n\r\nif first==1 and second==1:\r\n oddFlag = 0\r\nelif first==0 and second==0:\r\n oddFlag = 1\r\nelif (first==1 and second==0) or (first==0 and second==1):\r\n third = numberList[2]\r\n if third==1:\r\n oddFlag = 0\r\n elif third==0:\r\n oddFlag = 1\r\n\r\nfor i in range(numberCount):\r\n targetNumber = numberList[i]\r\n if oddFlag==0:\r\n if targetNumber==0:\r\n print(i+1)\r\n break\r\n elif oddFlag==1:\r\n if targetNumber==1:\r\n print(i+1)\r\n break", "numbers = int(input())\r\ntask = input().split()\r\nfor i in range(numbers):\r\n task[i] = int(task[i])\r\n\r\nevenness = []\r\nfor j in range(numbers):\r\n evenness.append(task[j] % 2)\r\nif evenness.count(1) == 1:\r\n print(evenness.index(1) + 1)\r\nelse:\r\n print(evenness.index(0) + 1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 12 23:37:26 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\n\r\nn=int(input(''))\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n arr[i]=arr[i]%2\r\nodd=arr.count(1)\r\neven=arr.count(0)\r\nif even==1:\r\n print(arr.index(0)+1)\r\nelse:\r\n print(arr.index(1)+1) ", "n=int(input())\r\nline=list(map(int,input().split()))\r\nline=[x%2 for x in line]\r\nif line.count(0)>1:print(line.index(1)+1)\r\nelse:print(line.index(0)+1)", "n = int(input())\n\nnumbers = list(map(int,input().split()))\n\n\neven = 0\nodd = 0 \n\nfor idx, num in enumerate(numbers) :\n\tif num %2 == 0 :\n\t\teven += idx+1\n\telse :\n\t\todd += idx+1\n\nprint(min(odd,even))\n", "n=input()\r\nstung=input()\r\nsting=stung.split()\r\nsting2=[]\r\nfor i in range(len(sting)):\r\n if int(sting[i])%2==0:\r\n sting2.append(sting[i])\r\nif len(sting2)==1:\r\n for i in range(len(sting)):\r\n if int(sting[i])%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(sting)):\r\n if int(sting[i])%2==1:\r\n print(i+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 3 14:11:18 2018\r\n\r\n@author: user\r\n\"\"\"\r\n\r\n\r\nnumber = int(input())\r\nseries = list(map(int, input().split()))\r\n\r\ncounter = [0,0]\r\nposition = [0,0]\r\n\r\nfor i in range (number):\r\n r = series [i] % 2\r\n counter[r] += 1\r\n position[r] = i\r\nprint (position [counter[0] > 1] + 1)\r\n ", "i=int(input())\r\ns=list(map(int,input().split()))\r\nt=0\r\nfor x in range(3):\r\n if s[x]%2==0:\r\n t=t+1\r\nif t>=2:\r\n for x in range(i):\r\n if s[x]%2!=0:\r\n print(x+1)\r\n break\r\nelse:\r\n for x in range(i):\r\n if s[x]%2==0:\r\n print(x+1)\r\n break", "# http://codeforces.com/contest/25/problem/A\n\nn = int(input())\nl = input().strip().split()\n\neven = 0 \nodd = 0\neven_place = -1\nodd_place = -1\nfor i in range(0,n):\n l[i] = int(l[i])\n if(l[i]%2 == 0):\n even = even + 1\n even_place = i\n else:\n odd = odd + 1\n odd_place = i\n if(even > 0 and odd > 0):\n if (even > odd):\n print(odd_place + 1)\n break\n elif (even < odd):\n print(even_place + 1)\n break\n \n", "import sys\r\n\r\nn = int(input())\r\na = list(input().split(' '))\r\neven = 0\r\nodd = 0\r\n\r\nfor i in range(len(a)):\r\n if int(a[i]) % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif even == 1:\r\n for j in range(len(a)):\r\n if int(a[j]) % 2 == 0:\r\n print(j+1)\r\n sys.exit(0)\r\nelse:\r\n for k in range(len(a)):\r\n if int(a[k]) % 2 != 0:\r\n print(k+1)\r\n sys.exit(0)\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nchet = []\r\nnechet = []\r\nfor i in range(n):\r\n if x[i] % 2 == 0:\r\n chet.append(x[i])\r\n else:\r\n nechet.append(x[i])\r\nif len(chet) > len(nechet):\r\n print(x.index(nechet[0]) + 1)\r\nelse:\r\n print(x.index(chet[0]) + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=list()\r\nb=list()\r\nfor i in l:\r\n if(i%2==0):\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif(len(a)>len(b)):\r\n print(l.index(b[0])+1)\r\nelse:\r\n print(l.index(a[0])+1)", "a=input()\r\nb=list(int(i)%2 for i in input().split())\r\nprint(b.index(sum(b)==1)+1)", "n=int(input())\r\narr = list(map(int,input().strip().split()))[:n]\r\ne=0\r\no=0\r\nfor i in range (0,n):\r\n if arr[i]%2 == 0 :\r\n e=e+1 \r\n else:\r\n o=o+1 \r\nif e==1:\r\n for i in range (0,n) :\r\n if arr[i]%2 == 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range (0,n) :\r\n if arr[i]%2 != 0:\r\n print(i+1)\r\n break", "n = int(input())#\r\nl0 = list(map(int, input().split()))\r\nl1 = []\r\nfor i in range(n):\r\n l1.append(l0[i] % 2)\r\nprint(l1.index(0) + 1 if l1.count(0) == 1 else l1.index(1) + 1)\r\n", "N=int(input())\r\nl=list(map(int,input().split()))\r\nm=0\r\nn=0\r\nk=[]\r\nu=[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n k.append(i+1)\r\n else:\r\n u.append(i+1)\r\nif len(k)==1:\r\n print(k[0])\r\nelse:\r\n print(u[0])\r\n", "if __name__=='__main__':\r\n t=int(input())\r\n ar=[int(x) for x in input().split()]\r\n co=0\r\n ce=0\r\n for i in range(t):\r\n if(ar[i]%2==1):\r\n co+=1\r\n idx=i\r\n else:\r\n ce+=1\r\n idx1=i\r\n if(co>ce):\r\n print(idx1+1)\r\n else:\r\n print(idx+1)\r\n\r\n ", "n = int(input())\r\nt = list(map(int, input(\"\").split()))\r\nc = []\r\nd = []\r\n\r\n\r\nfor i in t:\r\n if i % 2 == 0:\r\n c.append(i)\r\n else:\r\n d.append(i)\r\n\r\nif len(c) == 1:\r\n print(t.index(c[0]) + 1)\r\nelse:\r\n print(t.index(d[0]) + 1)", "n=int(input())\r\na=list(map(int,input().split())) [:n]\r\nlist1=[x for x in a if x%2==0]\r\nlist2=[x for x in a if x%2!=0]\r\nif len(list1)==1 :\r\n print(a.index(list1[0])+1)\r\nelse :\r\n print(a.index(list2[0])+1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn = inp()\r\nl = inlt()\r\n\r\nparity = []\r\nfor i in range(n):\r\n parity.append(l[i]%2)\r\n\r\nindex = 0\r\nif (parity.index(0) == len(parity)-1-parity[::-1].index(0)):\r\n index = parity.index(0)\r\nelse:\r\n index = parity.index(1)\r\n\r\nprint(index+1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif (a[0] & 1 and a[1] & 1) or (a[0] & 1 and a[2] & 1) or (a[1] & 1 and a[2] & 1):\r\n odd = True\r\nelse:\r\n odd = False\r\n\r\nfor i in range(n):\r\n if odd and not(a[i] & 1):\r\n print(i + 1)\r\n break\r\n if not odd and a[i] & 1:\r\n print(i + 1)\r\n break\r\n", "o = int(input())\r\nn = input()\r\nn+=\" \"\r\nnum = \"\"\r\nlis = []\r\nfor i in range(len(n)):\r\n if(n[i]!=\" \"):\r\n num+=n[i]\r\n else:\r\n lis.append(int(num))\r\n num=\"\"\r\n\r\n\r\ns = [lis[0],lis[1],lis[2]]\r\n\r\nft = [0,0]\r\n\r\nfor i in s:\r\n if i%2==0:\r\n ft[0]+=1\r\n else:\r\n ft[1]+=1\r\nif int(ft[0])>int(ft[1]):\r\n for i in range(len(lis)):\r\n if(lis[i]%2!=0):print(i+1);break\r\nelse: \r\n for i in range(len(lis)):\r\n if(lis[i]%2==0):print(i+1);break \r\n", "n = input()\nnum = input().split()\neven = 0\nfor i in num:\n if int(i)%2 == 0:\n even += 1\nif even == 1:\n for i in num:\n if int(i)%2 == 0:\n print(num.index(i)+1)\nelse:\n for i in num:\n if int(i)%2 == 1:\n print(num.index(i)+1)\n\n", "n=int(input())\r\nv=list(map(int,input().split()))\r\ncount=0\r\nfor i in v:\r\n if i%2==0:\r\n count+=1\r\nif (len(v)-count)>count:\r\n for i in v:\r\n if i%2==0:\r\n print(v.index(i)+1)\r\n break\r\nelse:\r\n for i in v:\r\n if i%2!=0:\r\n print(v.index(i)+1)\r\n break\r\n", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nlist1=[]\r\nlist2=[]\r\nfor i in range(n):\r\n if nums[i]%2==0:\r\n list1.append(i+1)\r\n else:\r\n list2.append(i+1)\r\nif len(list1)<len(list2):\r\n print(*list1)\r\nelse:\r\n print(*list2)", "n = input ()\r\na = list ( map ( int, input ().split () ) )\r\nf = []\r\nfor i in a :\r\n\tif i % 2 == 0 :\r\n\t\tf.append (0)\r\n\telse :\r\n\t\tf.append (1)\r\nif sum (f) > 1 :\r\n\tprint ( f.index (0) + 1 )\r\nelse :\r\n\tprint ( f.index (1) + 1 )\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nq = 0\r\nw = 0\r\nfor x in b:\r\n if x % 2 == 0:\r\n q += 1\r\n else:\r\n w += 1\r\nif q > w:\r\n for i in range(len(b)):\r\n if b[i] % 2 != 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(b)):\r\n if b[i] % 2 == 0:\r\n print(i + 1)", "n=int(input())\nl=list(map(int,input().split(\" \")))\neven=0\nodd=0\nokey=0\nekey=0\nfor i in range(0,n):\n\tif(l[i]%2==0):\n\t\tekey=i\n\t\teven=even+1\n\telse:\n\t\tokey=i\n\t\todd=odd+1\n\tif even>1 and odd>0:\n\t\tprint(okey+1)\n\t\tbreak\n\tif odd>1 and even>0:\n\t\tprint(ekey+1)\n\t\tbreak\n", "# Input:\r\nn = int(input())\r\nnumber_list = input().split()\r\nnumber_list = [int(i) for i in number_list]\r\n\r\n# Processing and Output:\r\nfor i in range(len(number_list)):\r\n number_list[i] %= 2\r\n\r\nif number_list.count(0) == 1:\r\n print(number_list.index(0) + 1)\r\nelse:\r\n print(number_list.index(1) + 1)\r\n", "num = int(input())\r\nnums = input().split(' ')\r\nnumlist =[int(x) for x in nums]\r\n\r\nif sum([y%2==0 for y in numlist]) == 1:\r\n print([y%2==0 for y in numlist].index(True)+1)\r\nelse:\r\n print([y%2==0 for y in numlist].index(False)+1)", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\neven, odd, ev_id, od_id = 0, 0, 0, 0\r\nfor j in range(n):\r\n if nums[j] % 2 == 0:\r\n even += 1\r\n ev_id = j + 1\r\n else:\r\n odd += 1\r\n od_id = j + 1\r\nif even == 1:\r\n print(ev_id)\r\nelse:\r\n print(od_id)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n \r\nodd = even = 0\r\nfor i,ele in enumerate(l):\r\n if odd<2 and even<2:\r\n if ele%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n l[i] = ele%2==0\r\n \r\nif odd==2:\r\n print(l.index(1)+1)\r\nelif even==2:\r\n print(l.index(0)+1)", "n = int (input())\r\nnumbers = input().split()\r\nl = list(map(int,numbers))\r\none = list(filter(lambda x: x%2 == 0, l))\r\ntwo = list(filter(lambda x: x%2 != 0, l))\r\nif len(one) > len(two):\r\n print(l.index(two[0])+1)\r\nelse:\r\n print(l.index(one[0])+1)", "def main():\n\tn = input()\n\tarr = input().split()\n\tarr = [int(a) for a in arr]\n\tif (arr[0] - arr[1]) & 1 == 1 and (arr[0]-arr[2]) & 1 == 1:\n\t\treturn 1\n\tfor i in range(1, len(arr)):\n\t\tif (arr[i] - arr[i-1]) & 1 == 1:\n\t\t\treturn i+1\n\nif __name__ == '__main__':\n\tprint(main())", "n=int(input())\r\na=list(map(int,input().split()))\r\nodd=[]\r\neven=[]\r\nfor i in a:\r\n if i%2==0:\r\n odd.append(i)\r\n else:\r\n even.append(i)\r\nif len(odd)==1:\r\n print(a.index(odd[0])+1)\r\nelse:\r\n print(a.index(even[0])+1)", "n = int(input())\r\na = [int(x)%2 for x in input().split()]\r\ns = sum(a)\r\nif s == n-1:\r\n print(a.index(0)+1)\r\nelif s == 1:\r\n print(a.index(1)+1)\r\n", "a = int(input())\r\nb = input()\r\n\r\nb_list = list(b.split(' '))\r\nb_list = list(map(int, b_list))\r\nlength_b = len(b_list)\r\n\r\neven = list()\r\nodd = list()\r\n\r\nfor item in b_list:\r\n if item % 2 == 0:\r\n even.append(item)\r\n else:\r\n odd.append(item)\r\n\r\nif len(even) == 1:\r\n print(b_list.index(even[0]) + 1)\r\nelif len(odd):\r\n print(b_list.index(odd[0]) + 1)", "n=int(input())\nlist1=list(map(int,input().split()))[:n]\na=0\nb=0\nfor i in range(0,n):\n if list1[i]%2==0:\n a+=1\n else:\n b+=1\nif b>a:\n list2=[]\n for i in range(0,n):\n if list1[i]%2==0:\n p=list1[i]\n list2.append(p)\n list2.sort()\n for i in range(0,n):\n if list2[0]==list1[i]:\n print(i+1)\nelse:\n list2=[]\n for i in range(0,n):\n if list1[i]%2!=0:\n p=list1[i]\n list2.append(p)\n list2.sort()\n for i in range(0,n):\n if list2[0]==list1[i]:\n print(i+1)\n\n \n\n \n \n \n\n \n\n \n\n \n", "\ndef main():\n n = int(input())\n arr = list(map(int,input().split(' ')))\n check_even_count = sum(1 for item in arr if item%2==0)\n check_odd_count = sum(1 for item in arr if item%2!=0)\n\n if(check_even_count> check_odd_count):\n for idx,item in enumerate(arr):\n if(item%2!=0):\n print(idx+1)\n break\n else:\n for idx,item in enumerate(arr):\n if(item%2==0):\n print(idx+1)\n break \n\nif __name__ == '__main__':\n main()\n", "n = int(input(''))\r\nm = input('')\r\n\r\na = int(0)\r\n\r\nfor i in range(3):\r\n if int(m.split()[i])%2 == 0:\r\n a += 1\r\n\r\nif a < 2:\r\n for j in range(n):\r\n if (int(m.split()[j]))%2 == 0:\r\n print(j + 1)\r\n break\r\nelse:\r\n for j in range(n):\r\n if (int(m.split()[j]))%2 != 0:\r\n print(j + 1)\r\n break", "def main():\r\n _ = input()\r\n numbers = input().split(\" \")\r\n\r\n i = 0\r\n odd = []\r\n even = []\r\n\r\n while i < len(numbers):\r\n if (int(numbers[i])) % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n if len(even) > 1 and len(odd) == 1:\r\n return(odd[0])\r\n if len(odd) > 1 and len(even) == 1:\r\n return(even[0])\r\n i += 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main() + 1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\neve=[]\r\nodd=[]\r\nfor i in l:\r\n if(i%2==0):\r\n eve.append(i)\r\n else:\r\n odd.append(i)\r\nif(len(odd)==1):\r\n print(l.index(odd[0])+1)\r\nelif(len(eve)==1):\r\n print(l.index(eve[0]) + 1)", "st=input().split()\r\ncot1,cot2=[],[]\r\nst=list(map(int,input().split()))\r\nfor i in st:\r\n if i%2==0:\r\n cot1.append(i)\r\n else: cot2.append(i)\r\nprint(st.index(cot1[0])+1 if len(cot1)<len(cot2) else st.index(cot2[0])+1)\r\n", "n=int(input())\r\nlist_=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nlast_even=0\r\nlast_odd=0\r\nfor i in range(len(list_)):\r\n if(list_[i]%2==0):\r\n even+=1\r\n last_even=i\r\n else:\r\n odd+=1\r\n last_odd=i\r\n if(even>1 and odd>0):\r\n print(last_odd+1)\r\n break\r\n elif(odd>1 and even>0):\r\n print(last_even+1)\r\n break", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nfor i in range(len(lst)):\r\n lst[i] = 1 if lst[i] % 2 == 0 else 0\r\nif lst.count(1) > lst.count(0):\r\n print(lst.index(0)+1)\r\nelse:\r\n print(lst.index(1)+1)", "n=int(input())\r\nl=input().split()\r\nsum1=0\r\nsum2=0\r\nl1=[]\r\nfor i in l:\r\n i=int(i)\r\n num1=i%2\r\n l1.append(num1)\r\nn1=0\r\nl2=[]\r\nl3=[]\r\nwhile n1<len(l1):\r\n num1=l1[n1]\r\n if num1==0:\r\n sum1+=1\r\n l2.append(n1)\r\n else:\r\n sum2+=1\r\n l3.append(n1)\r\n n1+=1\r\nif len(l2)==1:\r\n ans=l2[0]\r\nelse:\r\n ans=l3[0]\r\n\r\nprint(ans+1)\r\n \r\n", "n=int(input())\r\ns=[int(i)%2 for i in input().split()]\r\nif sum(s)==1:\r\n for i in range(n):\r\n if s[i]==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if s[i]==0:\r\n print(i+1)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = []\r\nfor i in arr:\r\n a = i%2\r\n m.append(a)\r\nsum = sum(m)\r\nif sum == 1:\r\n print(m.index(1)+1)\r\nelse:\r\n print(m.index(0)+1)", "n1=int(input())\r\nl=list(map(int,input().split()))\r\ns1=[]\r\ns2=[]\r\nfor i in l:\r\n if(i%2==0):\r\n s1.append(i)\r\n else:\r\n s2.append(i)\r\nif(len(s1)==1):\r\n k=s1[0]\r\nelse:\r\n k=s2[0]\r\nprint(l.index(k)+1)", "\r\ndef answer(n, a):\r\n oaddr = 0\r\n oc = 0\r\n eaddr = 0\r\n ec = 0\r\n a.insert(0, 0) #1-based array\r\n for i in range(1, n+1):\r\n if a[i] % 2 == 0:\r\n eaddr = i\r\n ec += 1\r\n #print('number even')\r\n else:\r\n oaddr = i\r\n oc += 1\r\n #print('number odd')\r\n if ec == 1:\r\n return eaddr\r\n else:\r\n return oaddr\r\n \r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n print(answer(n, a))\r\n\r\n\r\nmain()", "n=int(input())\r\na=[0,]*n\r\na=[int(i) for i in input().split()]\r\nif (a[0]%2+a[1]%2)%2==0:\r\n for i in range(2,n):\r\n if (a[i]%2) != (a[0]%2):\r\n print(i+1)\r\n break\r\nelif (a[0]%2+a[2]%2)%2==0:print('2')\r\nelse:print('1')\r\n", "n=int(input())\narr=[int(x)for x in input().split()]\n\nodd_count=sum(x& 1 for x in arr)\nfor i, v in enumerate(arr):\n if (odd_count!=1 and ~v &1) or (odd_count==1 and v&1):\n print(i+1)\n exit()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [i%2 for i in a]\r\n\r\nprint(b.index(0)+1 if b.count(0) == 1 else b.index(1)+1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nec=0\r\neo=0\r\neind=0\r\noind=0\r\n\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n eind=i\r\n ec+=1\r\n else:\r\n oind=i\r\n eo+=1\r\n\r\nif eo==1:\r\n print(oind+1)\r\nelse:\r\n print(eind+1)", "e=0\r\no=0\r\na=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(a):\r\n k=l[i]\r\n if k%2==0:\r\n e+=1\r\n ei=i+1\r\n else:\r\n o+=1\r\n oi=i+1\r\n if e==1 and o>e:\r\n print(ei)\r\n break\r\n elif o==1 and e>o:\r\n print(oi)\r\n break", "n=int(input());*l,=map(int,input().split());a=[];b=[]\nfor x in l:\n if x%2:\n a+=[x]\n else:\n b+=[x]\nprint((l.index(b[0])if len(a)-1 else l.index(a[0]))+1)", "anzahl = input()\n\nzahlen = input().split()\n\ngerade = []\n\nungerade = []\n\nfor i in range(len(zahlen)):\n\tif int(zahlen[i])%2 == 0:\n\t\tgerade.append(i)\n\telse:\n\t\tungerade.append(i)\n\nif len(gerade) == 1:\n\tprint(int(gerade[0])+1)\nelse:\n\tprint(int(ungerade[0])+1)\n\n", "def giveEven(l2):\r\n for x in range(len(l2)):\r\n if l2[x] %2==0 :\r\n return x+1\r\n\r\n\r\ndef giveOdd(l2):\r\n for x in range(len(l2)):\r\n if l2[x]%2!=0:\r\n return x+1\r\n\r\nnum = int (input())\r\nl1 = []\r\nl1.append(input().split())\r\nl2 = []\r\nevenCount = 0\r\noddCount = 0\r\nfor i in range(num):\r\n l2.append(int (l1[0][i]))\r\n if (int(l1[0][i])) % 2 == 0:\r\n evenCount += 1\r\n else:\r\n oddCount += 1\r\n\r\nif(evenCount > oddCount):\r\n print(giveOdd(l2))\r\nelse:\r\n print(giveEven(l2))\r\n", "n=int(input())\r\nm=input()\r\nm=m.split()\r\nc=int(m[0])%2\r\nd=int(m[1])%2\r\nif c==d:\r\n for i in range(2,n):\r\n if int(m[i])%2!=c:\r\n print(i+1)\r\n break\r\nelse:\r\n e=int(m[2])%2\r\n if e==c:\r\n print(2)\r\n else:\r\n print(1)\r\n", "n = int(input())\nm = list(map(int, input().split()))\n\nchet_count = 0\nnechet_count = 0\n\nfor i in m:\n if i % 2 == 0:\n chet_count += 1\n elif i % 2 != 0:\n nechet_count += 1\nc = 0\nif chet_count > nechet_count:\n for i in m:\n c += 1\n if i % 2 != 0:\n print(c)\n\nelse:\n for i in m:\n c += 1\n if i % 2 == 0:\n print(c)\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\nodd = 0\r\neven = 0\r\nnum=[]\r\nnum1=[]\r\nfor i in range(a):\r\n if b[i]%2==0:\r\n even+=1\r\n num = i\r\n else:\r\n odd+=1\r\n num1 = i\r\nif even==1:\r\n print(num+1)\r\nelse:\r\n print(num1+1)", "# In the name of God #\r\n# |\\/| /-\\ |\\| | |\\/| /-\\ #\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n l[i] = l[i] % 2\r\n if i < 2:\r\n continue\r\n if l[i] != l[i - 1] and l[i] != l[i - 2]:\r\n print(i + 1)\r\n exit()\r\nif l[0] != l[2]:\r\n print(1)\r\nelse:\r\n print(2)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\na=list()\r\nb=list()\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n a.append((l[i],i))\r\n else:\r\n b.append((l[i],i))\r\n\r\nif len(a)<len(b):\r\n print(a[0][1]+1)\r\nelse:\r\n print(b[0][1]+1)\r\n \r\n", "input()\r\na=[int(i)%2 for i in input().split()]\r\nif sum(a)==1:print(a.index(1)+1)\r\nelse:print(a.index(0)+1)", "n = int(input())\narr = list(map(int, input().split()))\neven = [0,0]\nodd = [0,0]\nfor i, v in enumerate(arr):\n if v%2:\n odd[0] += 1\n odd[1] = i\n else:\n even[0] += 1\n even[1] = i\n if max(even, odd, key=lambda x:x[0])[0] > 1:\n if min(even, odd, key=lambda x:x[0])[0] == 1:\n print(min(even, odd, key=lambda x:x[0])[1] + 1)\n break\n\n", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\n\r\na = s[0]\r\nb = s[1]\r\n\r\ni = 0\r\n\r\nif a % 2 == 0:\r\n if b % 2 == 0:\r\n for i in range(2, n):\r\n if s[i] % 2 != 0:\r\n print(i+1)\r\n else:\r\n c = s[2]\r\n if c % 2 == 0:\r\n print(2)\r\n else:\r\n print(1)\r\n\r\nelse:\r\n if b % 2 != 0:\r\n for i in range(2, n):\r\n if s[i] % 2 == 0:\r\n print(i+1)\r\n else:\r\n c = s[2]\r\n if c % 2 == 0:\r\n print(1)\r\n else:\r\n print(2)\r\n", "n=int(input())\r\nc=0\r\nd=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i%2==0:\r\n c=c+1\r\n e=i\r\n else:\r\n d=d+1\r\n o=i\r\nif c==1:\r\n x=l.index(e)\r\n print(x+1)\r\nelse:\r\n if d==1:\r\n x=l.index(o)\r\n print(x+1)", "num = int(input())\r\na = [int(i) for i in input().split()]\r\nb = []\r\nc = []\r\nfor i, j in enumerate(a):\r\n if j % 2 == 0:\r\n b += [[i, j]]\r\n else:\r\n c += [[i, j]]\r\nprint(min(b, c, key=len)[0][0]+1)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\ne=0;o=0;k=0\r\nfor i in l:\r\n if i%2==0:\r\n e=e+1\r\n else:\r\n o=o+1\r\nif e>o:\r\n while k<n:\r\n if (l[k])%2==1:\r\n m=k+1\r\n print(m,end=(\" \"))\r\n k=k+1\r\nif e<o:\r\n k=0\r\n while k<n:\r\n if (l[k])%2==0:\r\n m=k+1\r\n print(m,end=(\" \"))\r\n k=k+1", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\ncount1=0\r\ncount2=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n count1+=1\r\n temp1=i+1\r\n else:\r\n count2+=1\r\n temp2=i+1\r\n\r\nif count1==1:\r\n print(temp1)\r\nif count2==1:\r\n print(temp2)", "from collections import Counter\r\nfrom collections import defaultdict\r\nimport math\r\nimport random\r\nimport heapq as hq\r\nfrom math import sqrt\r\nimport sys\r\nfrom functools import reduce\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef iinput():\r\n return int(input())\r\n\r\n\r\ndef tinput():\r\n return input().split()\r\n\r\n\r\ndef rinput():\r\n return map(int, tinput())\r\n\r\n\r\ndef rlinput():\r\n return list(rinput())\r\n\r\n\r\nmod = int(1e9)+7\r\n\r\n\r\ndef factors(n):\r\n return set(reduce(list.__add__,\r\n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\r\n\r\n\r\n# ----------------------------------------------------\r\nif __name__ == \"__main__\":\r\n n = iinput()\r\n a = rlinput()\r\n even = [0, -1]\r\n odd = [0, -1]\r\n for i in range(n):\r\n if a[i] % 2:\r\n odd[0] += 1\r\n odd[1] = i\r\n else:\r\n even[0] += 1\r\n even[1] = i\r\n print(even[1]+1 if even[0] == 1 else odd[1]+1)\r\n ", "n=int(input())\nr=input().split()\nji=int(0)\nou=int(0)\nfor i in range(n):\n\tr[i]=int(r[i])\nfor j in range(n):\n\tif int(r[j])%2==0:\n\t\tou+=1\n\telif int(r[j])%2!=0:\n\t\tji+=1\nif int(ji)>int(ou):\n\tfor k in range(n):\n\t\tif r[k]%2==0:\n\t\t\tprint(int(int(r.index(r[k]))+1))\nelif int(ou)>int(ji):\n\tfor l in range(n):\n\t\tif r[l]%2!=0:\n\t\t\tprint(int(int(r.index(r[l]))+1))", "input()\r\nss = []\r\nfor i in map(int, input().split()):\r\n if i%2:\r\n ss.append(False)\r\n else:\r\n ss.append(True)\r\nif ss.count(True) == 1:\r\n print(ss.index(True)+1)\r\nelse:\r\n print(ss.index(False)+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nk=0\r\nfor i in range(len(l)):\r\n if l[i] % 2==0:\r\n c1+=1\r\n else:\r\n c2+=1\r\nfor i in range(len(l)):\r\n if c1>c2:\r\n if l[i]%2!=0:\r\n k=i\r\n else:\r\n if l[i]%2==0:\r\n k=i\r\nprint(k+1)\r\n \r\n ", "n = int(input())\nnumbers = [int(el) for el in input().split()]\n\nfirstEven = 0\nfirstOdd = 0\n\noddCounter = 0\nevenCounter = 0\n\nfoundFirstOdd = False\nfoundFirstEven = False\n\nfor i in range(n):\n if numbers[i] % 2 == 0:\n if not firstEven:\n firstEven = i\n foundFirstEven = True\n evenCounter += 1\n \n else:\n if not firstOdd:\n firstOdd = i\n foundFirstOdd = True\n oddCounter += 1\n\nif oddCounter == 1:\n print(firstOdd+1)\nelse:\n print(firstEven+1)\n \t \t\t \t \t\t \t\t \t \t \t \t\t \t\t\t \t", "n=int(input())\r\narr=input().split()\r\nfor i in range(len(arr)):\r\n arr[i]=int(arr[i])\r\nc=1000\r\nl=1000\r\ncount=0\r\nfor i in range(len(arr)):\r\n if arr[i]%2==0:\r\n count+=1\r\n c=min(c,i)\r\n else :\r\n l=min(l,i)\r\nif count==1:\r\n print(c+1)\r\nelse:\r\n print(l+1)", "n = int(input())\r\nn1 = input().split()\r\n\r\nn2 = []\r\n\r\nfor x in n1:\r\n y = int(x)%2\r\n if y == 0:\r\n n2.append(\"0\")\r\n elif y != 0:\r\n n2.append(\"1\")\r\n\r\nif n2.count(\"0\") > n2.count(\"1\"):\r\n print(n2.index(\"1\")+1)\r\nelif n2.count(\"0\") < n2.count(\"1\"):\r\n print(n2.index(\"0\")+1)", "\r\ndef poisci():\r\n\r\n n = int(input())\r\n\r\n stevila = list(map(int,input().split()))\r\n sodost = 0\r\n lihost = 0\r\n for i in range(n):\r\n if stevila[i]%2==0:\r\n sodost += 1\r\n else:\r\n lihost +=1\r\n if sodost == 2:\r\n for x in range(len(stevila)):\r\n if stevila[x]%2!=0:\r\n return x+1\r\n if lihost == 2:\r\n for x in range(len(stevila)):\r\n if stevila[x]%2==0:\r\n return x+1\r\n\r\n \r\ndef main():\r\n print ( poisci() )\r\n\r\nmain()", "x = int(input())\r\ny = [int(i) for i in input().split()]\r\na = [int(i) for i in y if i % 2 == 0]\r\nb = [int(i) for i in y if i % 2 != 0]\r\nif len(a) == 1:\r\n print(y.index(a[0]) + 1)\r\nif len(b) == 1:\r\n print(y.index(b[0]) + 1)", "def main():\r\n n = int(input())\r\n lst = [int(x) for x in input().split()]\r\n even = 0\r\n odd = 0\r\n num1 = 0\r\n num2 = 0\r\n for i in range(len(lst)):\r\n if lst[i] % 2 == 0:\r\n even += 1\r\n num1 = i + 1\r\n else:\r\n odd += 1\r\n num2 = i + 1\r\n if even == (n - 1):\r\n print(num2)\r\n else:\r\n print(num1)\r\n\r\n\r\nmain()", "input()\r\ns = input().split()\r\nx = 0\r\nfor i, number in enumerate(s):\r\n if int(number) % 2 == 0:\r\n x += 1\r\n index1 = i\r\n else:\r\n index2 = i\r\nif x > 1:\r\n print(index2 + 1)\r\nelse:\r\n print(index1 + 1)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr=[None]+arr\r\no=0\r\ne=0\r\nfor i in range(1,4):\r\n if arr[i]%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\nif o>=2:\r\n for i in range(1,n+1):\r\n if arr[i]%2==0:\r\n print(i)\r\nelif e>=2:\r\n for i in range(1,n+1):\r\n if arr[i]%2==1:\r\n print(i)\r\n \r\n \r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nevens = [x for x in a if x % 2 == 0]\r\nodds = [x for x in a if x % 2 == 1]\r\nif len(evens) == 1:\r\n print(a.index(evens[0]) + 1)\r\nelse:\r\n print(a.index(odds[0]) + 1)", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\nn=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\ncnt=[0]*2\r\nev=[0]*2\r\n\r\nfor i in range(n):\r\n cnt[a[i]%2]+=1\r\n ev[a[i]%2]=i\r\n\r\nif cnt[0]==1:\r\n print(ev[0]+1)\r\nelse:\r\n print(ev[1]+1)\r\n\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=y=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n x+=1\r\n i1=i+1\r\n else:\r\n y+=1\r\n i2=i+1\r\nif x==1:\r\n print(i1)\r\nelse:\r\n print(i2)", "n=int(input())\r\nx=[]\r\nx=[int(i) for i in input().split()]\r\no=0\r\ne=0\r\nfor i in x:\r\n if i%2!=0:\r\n o+=1 \r\n else :\r\n e+=1\r\nif e>o:\r\n for i in x:\r\n if i%2!=0:\r\n print(x.index(i)+1)\r\nelse:\r\n for i in x:\r\n if i%2==0:\r\n print(x.index(i)+1)\r\n ", "n=int(input())\r\nx = list(map(int, input().split()))\r\ne=0\r\no=0\r\nei=0\r\noi=0\r\nfor i in range(0,n):\r\n if(x[i]%2==0):\r\n e+=1\r\n ei=i\r\n else:\r\n o+=1\r\n oi=i\r\n if(e>0 and o>0 and e!=o):\r\n if(e>o):\r\n print(oi+1)\r\n break\r\n else:\r\n print(ei+1)\r\n break", "n=int(input())\r\nl=list(map(int,input().split()))\r\nodd=[]\r\neve=[]\r\nfor x in l:\r\n if x%2==0:eve.append(x)\r\n else:odd.append(x)\r\nif len(odd)==1:print(l.index(odd[0])+1)\r\nelse:print(l.index(eve[0])+1)\r\n", "t=int(input())\r\nz=list(map(int,input().split()))\r\na=0\r\nb=0\r\n\r\nfor i in range(3):\r\n \r\n n=z[i]\r\n if n%2==0:\r\n \r\n \r\n a+=1\r\n \r\n else:\r\n b+=1\r\ni=0\r\nif a>b:\r\n while z[i]%2==0:\r\n i+=1\r\n print(i+1)\r\nelse:\r\n while z[i]%2!=0:\r\n i+=1\r\n print(i+1)\r\n \r\n\r\n \r\n ", "n=int(input())\r\na=[int(i)%2 for i in input().split()]\r\nif sum(a)==1:\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=[]\r\nd=[]\r\nfor i in a:\r\n if i%2==0:\r\n s+=[a.index(i)+1]\r\n if i%2!=0:\r\n d+=[a.index(i)+1]\r\nif len(s)>len(d):\r\n print(*d)\r\nelse:\r\n print(*s)", "n=int(input())\r\nnumbers=[int(x) for x in input().split()]\r\neven,odd=0,0\r\nfor number in numbers:\r\n if number%2==0:\r\n even+=1\r\n if even==2:\r\n break\r\n else:\r\n odd+=1\r\n if odd==2:\r\n break\r\n \r\nif even==2:\r\n for i in range(n):\r\n if numbers[i]%2!=0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if numbers[i]%2==0:\r\n print(i+1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in numbers:\r\n if i%2 == 0:\r\n even +=1\r\n else:\r\n odd +=1\r\nif even > odd:\r\n for i in range(len(numbers)):\r\n if numbers[i]%2 != 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(numbers)):\r\n if numbers[i]%2 == 0:\r\n print(i+1)\r\n break\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 21 13:08:54 2020\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\nlist1=input().split()\r\ntot=0\r\nfor i in range(len(list1)):\r\n if int(list1[i])%2==1:\r\n tot+=1\r\nfor j in range(len(list1)):\r\n if tot==1:\r\n if int(list1[j])%2==1:\r\n print(j+1)\r\n else:\r\n if int(list1[j])%2==0:\r\n print(j+1)", "n = int(input())\n\nq = list(map(int, input().split()))\n\ns = f\"{q[0] % 2}{q[1] % 2}{q[2] % 2}\"\n\nif s.count('1') > s.count('0'):\n need = 0\nelse:\n need = 1\n\n\nfor i in range(len(q)):\n if q[i] % 2 == need:\n print(i + 1)\n break\n\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = []\r\nb = []\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n a.append(i+1)\r\n else:\r\n b.append(i+1)\r\nif len(a)==1:\r\n print(a[0])\r\nelse:\r\n print(b[0])", "n=int(input())\r\na=[int(j) for j in input().split()]\r\nsp=[]\r\nsp2=[]\r\nch=0\r\nnech=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n ch+=1\r\n sp.append(i+1)\r\n else:\r\n nech+=1\r\n sp2.append(i+1)\r\nif len(sp)==1:\r\n print(*sp)\r\nif len(sp2)==1:\r\n print(*sp2)\r\n", "inn = int(input())\r\nin2 = list(map(int,input().split(\" \")))\r\na = in2[0]%2\r\nb = in2[1]%2\r\n\r\nif (a == b):\r\n\tfor m in range(2,inn):\r\n\t\tif (in2[m]%2 != a):\r\n\t\t\tprint(m+1)\r\nelif(a == in2[2]%2):\r\n\tprint(2)\r\nelse:\r\n\tprint(1)\r\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\nodd_count = sum(x & 1 for x in arr)\r\nfor i, v in enumerate(arr):\r\n if (odd_count != 1 and ~v & 1) or (odd_count == 1 and v & 1):\r\n print(i + 1)\r\n exit()", "n = int(input())\r\n\r\nx = input().split()\r\nodd, even = 0,0\r\n\r\nfor num in x:\r\n if int(num)%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\ndef find_index_even():\r\n for i in range(len(x)):\r\n if int(x[i])%2 == 0:\r\n print(i+1)\r\n # break\r\n\r\ndef find_index_odd():\r\n for i in range(len(x)):\r\n if int(x[i])%2 != 0:\r\n print(i+1)\r\n # break\r\n\r\n\r\nif even < odd:\r\n find_index_even()\r\nelse:\r\n find_index_odd()", "int(input())\r\nx=list(map(int,input().split(\" \")))\r\necount=ocount=flag=0\r\nfor i in x:\r\n if(i%2==0):\r\n ecount+=1\r\n else:\r\n ocount+=1\r\n if(ecount>=2):\r\n for i in range(0,len(x)):\r\n if(x[i]%2!=0):\r\n print(i+1)\r\n flag=1\r\n break\r\n elif(ocount>=2):\r\n for i in range(0,len(x)):\r\n if(x[i]%2==0):\r\n print(i+1)\r\n flag=1\r\n break\r\n if(flag==1):\r\n break", "arraySize = int(input())\r\n\r\narray = input().split(\" \")\r\nevenCount = 0\r\noddCount = 0\r\nevenIndex = 0\r\noddIndex = 0\r\nindexCount = 0\r\nfor digit in array:\r\n digit = int(digit)\r\n indexCount = indexCount + 1\r\n if(digit%2 == 0):\r\n evenCount = evenCount + 1\r\n evenIndex = indexCount\r\n else:\r\n oddCount = oddCount + 1\r\n oddIndex = indexCount\r\n\r\nif oddCount == 1:\r\n print(str(oddIndex))\r\nelse:\r\n print(str(evenIndex))\r\n", "n=int(input())\r\ns=input().split()\r\na=b=c=d=0\r\nfor i in range(n):\r\n s[i]=int(s[i])\r\n if s[i]/2==int(s[i]/2):\r\n a=a+1\r\n b=i\r\n elif s[i]/2!=int(s[i]/2):\r\n c=c+1\r\n d=i\r\nif a==1:\r\n print(b+1)\r\nelif c==1:\r\n print(d+1)\r\n", "n = int(input())\na = [int(_) for _ in input().split()]\nodd = [i for i,x in enumerate(a) if x%2==1]\neven = [i for i,x in enumerate(a) if x%2==0]\nif len(odd) == 1:\n print(odd[0]+1)\nelse:\n print(even[0]+1)\n", "import math\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ne, o, ie, io = 0, 0, 0, 0\r\nfor i in range(len(a)):\r\n\tif a[i] % 2 == 0:\r\n\t\te += 1\r\n\t\tie = max(ie, i)\r\n\telse:\r\n\t\to += 1\r\n\t\tio = max(io, i)\r\n\r\nif e == 1:\r\n\tprint(ie + 1)\r\nelif o == 1:\r\n\tprint(io + 1)", "n = int(input())\r\nodd_counter = 0\r\ne = 0\r\no = 0\r\n\r\nfor i, num in enumerate(input().split()):\r\n num = int(num)\r\n is_odd = num % 2\r\n is_even = (num + 1) % 2\r\n odd_counter += is_odd\r\n e = e*is_odd + i*is_even\r\n o = i*is_odd + o*is_even\r\n if e and o:\r\n break\r\n\r\nif odd_counter == 1:\r\n print(o+1)\r\nelse:\r\n print(e+1)\r\n", "n = input()\r\narr=[int(i) for i in input().split()]\r\n\r\narr = map(lambda x: x % 2, arr)\r\narr = list(arr)\r\n\r\nsearch = 0\r\n\r\nif arr.count(0) > arr.count(1):\r\n search = 1\r\n\r\nprint(arr.index(search) + 1)\r\n", "def even_or_odd (x:list):\r\n even, odd = 0 , 0 \r\n for i in x : \r\n if i%2 == 0 : \r\n even+=1 \r\n else : \r\n odd +=1 \r\n if odd > even : \r\n return 'odd' \r\n else :\r\n return \"even\"\r\ndef serach (x) : \r\n flag = even_or_odd(x)\r\n if flag == 'even' : \r\n for i in x: \r\n if i%2 != 0 : \r\n print(x.index(i) + 1 )\r\n else: \r\n for i in x : \r\n if i%2 == 0 : \r\n print(x.index(i) + 1 )\r\ndef main() : \r\n n=input()\r\n x=list(map(int, input().split())) \r\n serach(x) \r\nmain()\r\n\r\n", "def isEven(number):\n if(number%2==0):\n return True\n\ndef sameParity(number1, numbere2):\n if((isEven(number1) and isEven(numbere2)) or not isEven(number1) and not isEven(numbere2)):\n return True\n return False\n\nn = int(input())\nline = [int(n) for n in input().split()]\n\nif(isEven(line[0]) and isEven(line[1])):\n for i in range(len(line)):\n if(not isEven(line[i])):\n print(i+1)\n\nelif(not isEven(line[0]) and not isEven(line[1])):\n for i in range(len(line)):\n if(isEven(line[i])):\n print(i+1)\n\nelse:\n if(sameParity(line[1],line[2])):\n print(\"1\")\n else:\n print(\"2\")\n\t\t\t\t\t\t \t \t \t \t \t \t \t \t", "x=int(input())\r\ny=input().split()\r\ncou=0\r\nfor i in range(0,3):\r\n if ( int(y[i])%2==0):\r\n cou=cou+1\r\nif cou >=2 :\r\n for i in range(0,x):\r\n if ( int(y[i]) %2==1):\r\n cou=i+1\r\n break\r\n print(cou)\r\nelse :\r\n for i in range(0,x):\r\n if ( int(y[i])%2==0):\r\n cou=i+1\r\n break\r\n print(cou)\r\n", "a = input()\r\nb = input()\r\nc = b.split(\" \")\r\neven = 0\r\nodd = 0\r\ne = False\r\n\r\nfor d in range(len(c)):\r\n if int(c[d]) % 2 == 0:\r\n even = even + 1\r\n else:\r\n odd = odd + 1\r\n\r\nif even > odd:\r\n e = True\r\n\r\nfor f in range(len(c)):\r\n if e == True:\r\n if int(c[f]) % 2 != 0:\r\n final = f + 1\r\n else:\r\n if int(c[f]) % 2 == 0:\r\n final = f + 1\r\n\r\nprint(final)\r\n ", "input()\r\nmods = list(map(lambda x: int(x) % 2, input().split()))\r\nif mods.count(1) == 1:\r\n print(mods.index(1) + 1)\r\nelse:\r\n print(mods.index(0) + 1)", "def eveness(arr, n):\r\n odds = []\r\n evens = []\r\n for i in range(n):\r\n if arr[i] % 2 == 0:\r\n evens.append(arr[i])\r\n else:\r\n odds.append(arr[i])\r\n \r\n if len(odds) == 1:\r\n return arr.index(odds[0]) + 1\r\n else:\r\n return arr.index(evens[0]) + 1\r\n \r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nprint(eveness(arr, n))", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ne,o,index=0,0,0\r\nfor i in range(n):\r\n\tif l[i]%2==0:\r\n\t\te+=1\r\n\telse:\r\n\t\to+=1\r\n# print(e,o)\r\n# print(a)\r\nfor i in range(n):\r\n\tif min(o,e)==e:\r\n\t\tif l[i]%2==0:\r\n\t\t\tindex=i\r\n\telse:\r\n\t\tif l[i]%2!=0:\r\n\t\t\tindex=i\r\nprint(index+1)", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nflag=0\r\nfor i in range(1,n-1):\r\n if (x[i]-x[i-1])%2==1 and (x[i+1]-x[i])%2==1:\r\n print(i+1)\r\n flag=1\r\nif flag==0:\r\n if (x[0]-x[1])%2==1:\r\n print(1)\r\n \r\n if (x[-1]-x[-2])%2==1:\r\n print(n)\r\n", "num_list =[]\r\ncount_odd=0\r\ncount_even=0\r\nn = int(input())\r\nnum_list = list(map(int,input().split()))\r\nfor num in num_list:\r\n if num%2==0:\r\n count_even +=1\r\n last_even =num\r\n else:\r\n count_odd +=1\r\n last_odd = num\r\n \r\n if count_even>=2 and count_odd==1:\r\n print(num_list.index(last_odd)+1)\r\n break\r\n \r\n if count_odd>=2 and count_even==1:\r\n print(num_list.index(last_even)+1)\r\n break\r\n ", "n = int(input())\nL = [int(x) for x in input().split()]\nodd_idx = 0\neven_idx = 0\nodd_count = 0\neven_count = 0\nfor i in range(n):\n if L[i]%2 == 0:\n even_count += 1\n even_idx = i\n else:\n odd_count += 1\n odd_idx = i\nif odd_count == 1:\n print(odd_idx+1)\nelse:\n print(even_idx+1)\n\n\n", "n = eval(input())\r\nl = list(map(int, input().split()))\r\nif l[1]%2==0 and l[0]%2==0:\r\n i = 2\r\n while i<len(l):\r\n if l[i]%2==1:\r\n print(i+1)\r\n break\r\n i+=1\r\n\r\nelif l[0]%2 == 1 and l[1]%2==1:\r\n i = 2\r\n while i<len(l):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\n i+=1\r\nelif (l[0]%2==0 and l[1]%2==1) or (l[0]%2==1 and l[1]%2==0):\r\n i = 0\r\n if l[2]%2==0:\r\n while i<len(l):\r\n if l[i]%2==1:\r\n print(i+1)\r\n break\r\n i+=1\r\n else:\r\n while i <len(l):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\n i+=1\r\n", "n=int(input()); a=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%2==1: a[i]=1\r\n else: a[i]=0\r\nif a.count(1)>a.count(0): print(a.index(0)+1)\r\nelse: print(a.index(1)+1)", "n=int(input())\r\nl=[]\r\np=0\r\nm=0\r\nl=[int(x) for x in input(\"\").split()]\r\nfor elt in l:\r\n if elt%2==0:\r\n p+=1 \r\n else:\r\n m+=1 \r\nif p==1:\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break \r\nif m==1:\r\n for i in range(n):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n break", "n = int(input())\r\nnumbers = [int(i) for i in input().split(\" \")]\r\ncount_even = 0\r\ncount_odd = 0\r\ncheck = \"x\"\r\nfor i in numbers:\r\n if i%2==0:\r\n count_even+=1\r\n else:\r\n count_odd+=1\r\n if count_even>1:\r\n check=\"odd\"\r\n break\r\n elif count_odd>1:\r\n check=\"even\"\r\n break\r\n else:\r\n continue\r\nif check==\"odd\":\r\n for i in numbers:\r\n if i%2!=0:\r\n print(numbers.index(i)+1)\r\nelif check=='even':\r\n for i in numbers:\r\n if i%2==0:\r\n print(numbers.index(i)+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\no=0\r\nei=0\r\noi=0\r\nfor i in range(n):\r\n\tif l[i]%2==0:\r\n\t\te+=1\r\n\t\tei=i\r\n\telse:\r\n\t\to+=1\r\n\t\toi=i\r\nif e==1:\r\n\tprint(ei+1)\r\nelse:\r\n\tprint(oi+1)\r\n", "\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split(\" \")]\r\n\r\nein = -1\r\noin = -1\r\ne = 0\r\no = 0\r\n\r\nfor i in range(0, n):\r\n if a[i]%2 == 0:\r\n e += 1\r\n ein = i+1\r\n else:\r\n o += 1\r\n oin = i+1\r\n\r\nif e == 1:\r\n print(ein)\r\nelse:\r\n print(oin)\r\n", "input()\na = [int(x)%2 for x in input().strip().split(' ')]\nfor i in range(len(a)):\n cnt = 0\n for j in a:\n if j == a[i]:\n cnt += 1\n if cnt == 1:\n print(i+1)\n \t\t \t \t\t \t\t\t\t \t \t\t\t\t\t\t\t\t", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\neven=odd=0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nfor i in range(len(l)):\r\n if l[i]%2==1 and odd<even or l[i]%2==0 and even<odd:\r\n print(i+1)\r\n break\r\n", "n,l,o,e,k,j=int(input()),[int(i) for i in input().split()],0,0,0,0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n if e==0:\r\n k=i\r\n e+=1\r\n e+=1\r\n if l[i]%2==1:\r\n if o==0:\r\n j=i\r\n o+=1\r\n o+=1\r\nif e>o:print(j+1)\r\nelse:print(k+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nx=a[0]%2\r\ny=a[1]%2\r\nif x==y:\r\n for i in range(n):\r\n if a[i]%2!=x:\r\n print(i+1)\r\nif x!=y:\r\n z=a[2]%2\r\n if x!=z:\r\n print(1)\r\n else:\r\n print(2)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nwhile(len(l) > n):\r\n l=list(map(int,input().split()))\r\npair=impair=0\r\nfor e in l[0:3]:\r\n if e%2==0:\r\n pair+=1\r\n else:\r\n impair+=1\r\nif pair> impair :\r\n for i in range(len(l)):\r\n if l[i]%2!=0 :\r\n ind=i\r\n break\r\nelse:\r\n for i in range(len(l)):\r\n if l[i]%2==0 :\r\n ind=i\r\n break\r\nprint(ind+1)", "n = int(input())\r\nlistx = list(map(int, input().split()))\r\nlisty = []\r\nfor _ in range(3):\r\n listy.append(listx[_] % 2)\r\nif listy.count(0) >= 2:\r\n for i in range(n):\r\n if listx[i] % 2 == 1:\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if listx[i] % 2 == 0:\r\n print(i + 1)", "n = input()\r\nnumbers = [int(i) for i in list(input().split( ))]\r\n\r\neven = 0\r\nodd = 0\r\nfor i in range(len(numbers)):\r\n if numbers[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n i += 1\r\ni = 0\r\nif even < odd:\r\n while numbers[i] % 2 != 0:\r\n i += 1\r\nelse:\r\n while numbers[i] % 2 == 0:\r\n i += 1\r\nprint(i + 1)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nL = list(map(int, sys.stdin.readline().split()))\r\nodd, even = 0, 0\r\nfor i in range(n):\r\n if L[i] % 2 == 0:\r\n even += 1\r\n L[i] = 0\r\n else:\r\n odd += 1\r\n L[i] = 1\r\n\r\nif odd > even:\r\n print(L.index(0)+1)\r\nelse:\r\n print(L.index(1)+1)\r\n", "n = int(input())\r\n\r\ns = [int(x) for x in input().split()]\r\n\r\neve = [0] * n\r\n\r\nfor i in range(n):\r\n if s[i] % 2 == 1:\r\n eve[i] += 1\r\n\r\nif eve.count(0) > eve.count(1):\r\n print(eve.index(1)+1)\r\nelse:\r\n print(eve.index(0)+1)\r\n\r\n", "n=int(input())\r\nl=list(map(int, input().split(' ')))\r\nans=0\r\nfor i in range(1, n-1):\r\n if l[i]%2!=l[i-1]%2 and l[i]%2!=l[i+1]%2:\r\n ans=i+1\r\n\r\nif ans==0:\r\n if (l[0]+l[1])%2!=0:\r\n ans=1\r\n else:\r\n ans=n\r\n \r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\neven, odd = 0,0\r\nfor x in a :\r\n if x%2 ==0 : even+=1\r\n else : odd+=1\r\nif even == 1 :\r\n for i in range (n) :\r\n if a[i]%2 == 0 : \r\n print(i+1)\r\n break\r\nelse : \r\n for i in range (n) :\r\n if a[i]%2 == 1 :\r\n print(i+1)\r\n break", "n = int(input())\r\nc1 = input().split(\" \")\r\nk1 = 0 \r\nk2 = 0\r\nb = []\r\nfor i in c1:\r\n b.append(int(i))\r\n \r\nfor j in range(len(b)):\r\n if b[j] % 2 == 0:\r\n k2 += 1\r\n else:\r\n k1 += 1\r\n\r\nif k2 > k1: \r\n for i in range(len(b)):\r\n if b[i] % 2 == 1:\r\n ans = i + 1\r\n break\r\n\r\nif k1 > k2 : \r\n for i in range(len(b)):\r\n if b[i] % 2 == 0:\r\n ans = i + 1\r\n break\r\n\r\nprint(ans)", "a = int(input())\r\nlst = input().split()\r\neven_map = {'even': [], 'odd':[]}\r\nfor i in range (0,a):\r\n if int(lst[i]) %2==0:\r\n even_map['even'].append(i)\r\n else:even_map['odd'].append(i)\r\nif len(even_map[\"even\"]) == 1:\r\n print (even_map['even'][0] + 1)\r\nelse: print (even_map['odd'][0] + 1)", "n = int(input())\r\nwah = list(map(int, input().split(' ')))\r\na = 3\r\nif wah[0] % 2 == wah[1] % 2 != wah[2] % 2:\r\n print(3)\r\nelif wah[0] % 2 == wah[2] % 2 != wah[1] % 2:\r\n print(2)\r\nelif wah[2] % 2 == wah[1] % 2 != wah[0] % 2:\r\n print(1)\r\nelse:\r\n while a != n:\r\n if wah[a] % 2 != wah[a-1] % 2:\r\n print(a + 1)\r\n break\r\n a += 1", "n=int(input())\r\nnum=input().split()\r\neven=[]\r\nzero=0;one=0\r\nfor i in range(n):\r\n num[i]=int(num[i])\r\n even.append(num[i]%2)\r\nfor i in range(3):\r\n if even[i]==0:\r\n zero+=1\r\n else:\r\n one+=1\r\nif zero>1:\r\n for i in range(n):\r\n if even[i]==1:\r\n ans=i+1\r\n break\r\nelse:\r\n for i in range(n):\r\n if even[i]==0:\r\n ans=i+1\r\n break\r\nprint(ans)\r\n", "a = int(input())\r\nb = list(map(int, input(). split()))\r\nc = 0\r\ns = 0\r\nfor i in range(a):\r\n if b[i] % 2 == 0:\r\n s += 1\r\n \r\n if b[i] % 2 != 0:\r\n c += 1\r\n \r\nif s > c:\r\n for l in range(0,a):\r\n if b[l] % 2 != 0:\r\n print(l+1)\r\n \r\nelse:\r\n for l in range(0,a):\r\n if b[l] % 2 == 0:\r\n print(l+1)", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\ne=[]\r\no=[]\r\nfor i in range(0,n):\r\n if a[i]%2==0:\r\n e.append(a[i])\r\n else:\r\n o.append(a[i])\r\nif len(e)==1:\r\n print(a.index(e[0])+1)\r\nelse:\r\n print(a.index(o[0])+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncountfor2 = 0\r\ncountfor3= 0 \r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n countfor2 += 1\r\n else:\r\n countfor3 += 1\r\nanswer = None\r\nif countfor2 > countfor3:\r\n for i in range(n):\r\n if a[i] % 2 != 0:\r\n answer = (i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n answer = (i+1)\r\n break\r\nprint(answer)", "n = int(input())\nq = list(map(int, input().split()))\nu = [q[0]%2, q[1]%2, q[2]%2]\nif u.count(0) >= 2:\n for i in range(n):\n if q[i]%2 != 0 :\n print(i + 1)\n exit()\nelse:\n for i in range(n):\n if q[i]%2 == 0:\n print(i + 1)\n exit()\n\n", "input()\r\nnums = map(int, input().split())\r\nevens = []\r\nodds = []\r\nfor i,num in enumerate(nums):\r\n if num % 2 == 0:\r\n evens.append(i+1)\r\n else:\r\n odds.append(i+1)\r\nif len(evens) == 1:\r\n print(evens[0])\r\nelse:\r\n print(odds[0])", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndef solve(n, a):\r\n odd = 0\r\n even = 0\r\n last_odd = 0\r\n last_even = 0\r\n i = 1\r\n j = 0\r\n while j < len(a):\r\n if a[j] % 2 == 0:\r\n even += 1\r\n last_even += i\r\n else:\r\n odd += 1\r\n last_odd += i\r\n i += 1\r\n j += 1\r\n\r\n if even > odd:\r\n return last_odd\r\n else:\r\n return last_even\r\n\r\n\r\n\r\nprint(solve(n , a))", "n=input()\r\ns=[int(x)%2 for x in input().split()]\r\nif s.count(0)>s.count(1):\r\n print(s.index(1)+1)\r\nelse:\r\n print(s.index(0)+1)", "# 5\n# 2 4 7 8 10\n# p = [2, 4, 8, 10]\n# np = [7]\n\nn = input()\nn = int(n)\n\nl = list(map(int, input().split(\" \")))\n\np = []\nnp = []\n\nfor i in range(n):\n if l[i] % 2 == 1:\n np.append(i+1)\n else:\n p.append(i+1)\n\nif len(p) > len(np):\n print(np[0])\nelse:\n print(p[0])\n", "int(input())\r\nl = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\n\r\nfor i in range(3):\r\n if l[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif even > odd:\r\n answer = 1\r\nelse:\r\n answer = 0\r\n \r\ni = 0\r\nwhile True:\r\n if l[i] % 2 == answer:\r\n print(i+1)\r\n break\r\n else:\r\n i+=1", "v = int(input());v1 = list(map(int, input().split()));e = 0;o = 0;e1 = 0;o1 = 0\r\nfor i in v1:\r\n if i % 2 == 0:e1 = i;e += 1\r\n else:o += 1;o1 = i\r\nif e > o:print(v1.index(o1)+1)\r\nelse:print(v1.index(e1)+1)\r\n\r\n", "n=int(input())\r\nline=input()\r\nnumber=line.split( )\r\ns1=0\r\ns2=0\r\nfor i in range (n):\r\n if int(number[i])%2==1:\r\n s1=s1+1\r\n if int(number[i])%2==0:\r\n s2=s2+1\r\nif s1==1:\r\n for i in range(n):\r\n if int(number[i])%2==1:\r\n print(i+1)\r\n break\r\nif s2==1:\r\n for i in range (n):\r\n if int(number[i])%2==0:\r\n print(i+1)\r\n break\r\n \r\n \r\n", "s = int(input())\r\nn = list(map(int,input().split()))\r\no = 0\r\ne = 0\r\nfor i in range(0,s):\r\n if n[i]%2 != 0:\r\n o += 1\r\n continue\r\n if n[i]%2 == 0:\r\n e += 1\r\nif o > e:\r\n for i in range(0,s):\r\n if n[i] % 2 == 0:\r\n t = i\r\n break\r\n print(t+1)\r\nelif o < e:\r\n for i in range(0,s):\r\n if n[i] % 2 != 0:\r\n t = i\r\n break\r\n print(t+1)", "even,odd = 0,0\r\nN= int(input())\r\nlis = list(map(int,input().split()))\r\nfor i in lis[:3]:\r\n if i%2 ==0:even+=1\r\n else:odd+=1 \r\nif odd > even:\r\n for i in lis:\r\n if i%2 ==0:\r\n print(lis.index(i)+1)\r\n exit()\r\nelse:\r\n for i in lis:\r\n if i%2!= 0:\r\n print(lis.index(i)+1)\r\n exit()", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nr=0\r\nif a[0]%2==0 and a[1]%2==0:\r\n r=1\r\nelif a[0]%2==1 and a[1]%2==1:\r\n r=0\r\nelse:\r\n if a[0]%2==0 and a[2]%2==0:\r\n r=1\r\n elif a[0]%2==1 and a[2]%2==1:\r\n r=0\r\n else:\r\n r = a[0]%2\r\n# print(r)\r\nfor i in range(n):\r\n # print(a[i],i)\r\n if a[i]%2 == r:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nz = o = 0\r\nfor i in range(len(l)):\r\n nr = l[i] % 2\r\n if nr == 0:\r\n z +=1\r\n else:\r\n o +=1\r\n\r\nif z == 1:\r\n for i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(l)):\r\n if l[i] % 2 == 1:\r\n print(i+1)\r\n", "num = int(input())\r\n\r\nnumbers = list(map(int,input().split()))\r\nodd = sum(1 for x in numbers if x%2==1)\r\neven = len(numbers)-odd\r\n\r\nif odd==1:\r\n for i in range(len(numbers)):\r\n if numbers[i]%2==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(numbers)):\r\n if numbers[i]%2==0:\r\n print(i+1)\r\n break\r\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\ntotal = 0\r\ncount = 0\r\nc = 0\r\nd = 0\r\nfor i in range(a):\r\n if b[i] % 2 != 0:\r\n total += 1\r\n c = i\r\n if b[i] % 2 == 0:\r\n count += 1\r\n d = i\r\nif total < count:\r\n print (c + 1)\r\nelse:\r\n print (d + 1)", "s=int(input())\r\nl=[]\r\nl=input().split()\r\neven=0\r\nodd=0\r\noddIndex=-1\r\nevenIndex=-1\r\nfor i in range(len(l)):\r\n if(int(l[i])%2==0):\r\n even=even+1\r\n evenIndex=i\r\n else:\r\n odd=odd+1\r\n oddIndex=i\r\n \r\nif(even<odd):\r\n print(evenIndex+1)\r\nelse:\r\n print(oddIndex+1)", "n = int(input())\r\nseq = list(map(int, input().split()))\r\n\r\neven = 0\r\nodd = 0\r\nrun = True\r\nwhile run:\r\n for i in range(len(seq)):\r\n if seq[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if seq[i] % 2 == 0 and odd > 1:\r\n print(i+1)\r\n run = False\r\n break\r\n elif seq[i] % 2 != 0 and even > 1:\r\n print(i+1)\r\n run = False\r\n break", "n=int(input())\r\ns=list(map(int,input().split()))\r\nc=0\r\nv=0\r\nfor i in s:\r\n if int(i) % 2==0:\r\n c+=1\r\n else:\r\n v+=1\r\nif c==len(s)-1:\r\n for j in s:\r\n if int(j)%2==1:\r\n l=0\r\n for g in s:\r\n l+=1\r\n if g==j:\r\n break\r\nif v==len(s)-1:\r\n for j in s:\r\n if int(j)%2==0:\r\n l=0\r\n for g in s:\r\n l+=1\r\n if g==j:\r\n break\r\nprint(l)", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\nj=0\r\no=0\r\nfor i in range(n):\r\n if li[i]%2==0:\r\n o+=1\r\n else:\r\n j+=1\r\nif o==1:\r\n for i in range(n):\r\n if li[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if li[i]%2!=0:\r\n print(i+1)", "n=int(input())\nnum=[int(i) for i in input().split()]\na=int(0)\nb=int(0)\nfor i in range(0,n):\n if num[i]%2!=0:\n a+=1\n else:\n b+=1\nif a>b:\n for i in range(0,n):\n if num[i]%2==0:\n print(i+1)\nelse:\n for i in range(0,n):\n if num[i]%2!=0:\n print(i+1)\n \n\n\n", "num=int(input())\r\ns=input()\r\nlst=s.split()\r\nfor i in range(len(lst)):\r\n lst[i]=int(lst[i])\r\na=lst[0]%2\r\nb=lst[1]%2\r\nc=lst[2]%2\r\nif a+b+c==0:\r\n p=1\r\nelif a+b+c>=2:\r\n p=0\r\nelif a+b+c==1:\r\n p=1\r\nfor i in range(len(lst)):\r\n if lst[i]%2==p:\r\n print(i+1)\r\n break\r\n \r\n \r\n", "a=int(input())\r\ne=0\r\nle=0\r\nlo=0\r\np=list(map(int,input().split()))\r\nfor i in range(a):\r\n if(p[i]%2==0):\r\n e=e+1\r\n le=i+1\r\n else:\r\n e=e-1\r\n lo=i+1\r\nif(e>0):\r\n print(lo)\r\nelse:\r\n print(le)", "n = int(input())\r\nl = [int(x) for x in input().split(\" \")]\r\n\r\neven = []\r\nodd = []\r\n\r\nfor i in range(n):\r\n if l[i]%2 == 0:\r\n even.append(i+1)\r\n else:\r\n odd.append(i+1)\r\n\r\nif len(even) == 1:\r\n print(even[0])\r\nelse :\r\n print(odd[0])", "from ast import Num\r\nfrom math import e\r\n\r\nnum_e = int()\r\nnum_o = int()\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nchar_list = [''] * n\r\nsame = bool(True)\r\n#print(l)\r\ni= int(0)\r\nfor i in range(n):\r\n if l[i] % 2 == 0:\r\n char_list[i] = 'e'\r\n num_e = num_e + 1\r\n else:\r\n char_list[i] = 'o'\r\n num_o = num_o + 1\r\n\r\n\r\nif num_e > num_o:\r\n index = char_list.index('o')\r\nelse:\r\n index = char_list.index('e')\r\n\r\nprint(index +1)", "n=int(input())\r\narr = list(map(int,input().split()))\r\nd = {\"odd\":[],\"even\":[]}\r\nfor i in range(0,len(arr)):\r\n if arr[i]%2 == 0:\r\n d[\"even\"].append(arr[i])\r\n else:\r\n d[\"odd\"].append(arr[i])\r\n \r\nif len(d[\"odd\"]) == 1:\r\n print(arr.index(d[\"odd\"][0])+1)\r\nelse:\r\n print(arr.index(d[\"even\"][0])+1)\r\n", "N = int(input())\nX = [int(x) % 2 for x in input().strip().split()]\nS = sum(X)\nif (S==1): print(X.index(1)+1)\nelse: print(X.index(0)+1)\n \t \t \t \t \t \t", "n = int(input())\r\nls = list(map(int, input().split()))\r\nlss = []\r\nfor i in ls:\r\n if i % 2 == 0:\r\n lss.append('even')\r\n else:\r\n lss.append('odd')\r\nif lss.count('even') == 1:\r\n print(lss.index('even')+1)\r\nelse:\r\n print(lss.index('odd')+1)\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nlst=[]\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n lst.append(\"0\")\r\n else:\r\n lst.append(\"1\")\r\na=lst.count(\"0\")\r\nb=lst.count(\"1\")\r\nif a>b:\r\n print(lst.index(\"1\")+1)\r\nelse:\r\n print(lst.index(\"0\")+1)", "def main():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n if a[0] % 2 == a[1] % 2 or a[0] % 2 == a[2] % 2:\r\n d = a[0] % 2\r\n elif a[1] % 2 == a[2] % 2:\r\n d = a[1] % 2\r\n for i in range(n):\r\n if a[i] % 2 != d:\r\n print(i + 1)\r\n break\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k=int(input())\r\noddc=0\r\nevenc=0\r\ninda=0\r\nindb=0\r\nreg=input().split()\r\nfor i in range(0,k):\r\n if (int (reg[i]))%2==0:\r\n evenc+=1\r\n inda=i\r\n else:\r\n oddc+=1\r\n indb=i\r\nif evenc==1:\r\n print (inda+1)\r\nelif oddc==1:\r\n print (indb+1)\r\n ", "x = int(input())\r\nl= list(map(int , input().split()))\r\n\r\ne= 0\r\nei = []\r\no =0\r\noi = []\r\nfor i in range(x):\r\n if e - o >1 and e !=0 and o !=0:\r\n break\r\n elif o - e > 1 and e !=0 and o !=0:\r\n break\r\n \r\n if l[i]%2 == 0:\r\n e +=1\r\n ei.append(l[i])\r\n else:\r\n o +=1\r\n oi.append(l[i])\r\n\r\nif len(ei)> len(oi):\r\n print(l.index(oi[0])+1)\r\nelse:\r\n print(l.index(ei[0])+1)\r\n\r\n \r\n", "def main():\r\n n = int(input())\r\n a = [int(i) & 1 for i in input().split()]\r\n\r\n for i in range(1, n):\r\n if a[i-1]!= a[i]:\r\n if a[(i-2)%n]!= a[i-1]:\r\n print(i)\r\n else:\r\n print(i+1)\r\n return\r\n \r\nmain()\r\n", "def buscaSimples(vetor, x):\n for i in range(len(vetor)):\n if (vetor[i] == x):\n return i;\n return -1;\n\n#Descobre se a maioria dos números do vetor são par ou ímpar\n#Se a soma dos restos das divisões dos 3 primeiros numeros for 3 ou 2, então pelo menos 2 dentre eles são ímpares, portanto o numero incomum é par.\n#Caso a soma seja 1 ou 0, então pelo menos 2 dos 3 primeiros numeros são pares, nos deixando com um numero incomum impar.\ndef qualBuscar(restos):\n soma = restos[0] + restos[1] + restos[2];\n if(soma == 3 or soma == 2):\n return 0;\n if(soma == 1 or soma == 0):\n return 1;\n\ndef main():\n n = int(input());\n restos = [];\n entrada = input().split();\n for i in range(n):\n restos.append(int(entrada[i]) % 2);\n x = qualBuscar(restos);\n print(buscaSimples(restos, x) + 1);\n\nmain();\n\t\t\t \t\t\t \t\t\t\t \t\t\t \t\t\t\t \t", "n = int(input())\r\ns = list(map(int, input().split()))\r\na = [x % 2 for x in s]\r\nprint(a.index(min(a, key=lambda x: a.count(x))) + 1)\r\n", "n = int(input())\r\nnum_list = input().split(\" \")\r\ne_c, o_c = 0, 0\r\n\r\nfor i in num_list:\r\n if int(i) % 2 == 0:\r\n e_c += 1\r\n else:\r\n o_c += 1\r\n\r\nif e_c >> o_c:\r\n for i in range(n):\r\n if int(num_list[i]) % 2 == 0:\r\n i += 1\r\n else:\r\n print(i+1)\r\n break\r\n \r\nelse:\r\n for i in range(n):\r\n if int(num_list[i]) % 2 != 0:\r\n i += 1\r\n else:\r\n print(i+1)\r\n break", "length = input()\r\ndata = list(map(int, input().split()))\r\nodd = []\r\neven = []\r\nfor idx,num in enumerate(data):\r\n if num%2 == 0:\r\n even.append(idx+1)\r\n else:\r\n odd.append(idx+1)\r\nif len(even) > len(odd):\r\n print(odd[0])\r\nelse:\r\n print(even[0])", "def iqTest(a):\r\n even = odd = ev = od = 0\r\n for i in range(0,len(a)):\r\n if(int(a[i])%2==0):\r\n even += 1\r\n ev = i\r\n else:\r\n odd += 1\r\n od = i\r\n if(odd==1):\r\n print(od+1)\r\n else:\r\n print(ev+1)\r\nn = int(input())\r\na = list(map(str,input().split()))\r\niqTest(a)", "number = int(input())\r\na=list(map(int, input(). strip(). split()))\r\nif a[0] % 2 == 0 and a[1] % 2 == 0:\r\n for i in a:\r\n if i % 2 != 0:\r\n print(a.index(i) + 1)\r\nelif a[0] % 2 != 0 and a[1] % 2 != 0:\r\n for i in a:\r\n if i % 2 == 0:\r\n print(a.index(i) + 1)\r\nelif a[0] % 2 != 0 and a[1] % 2 == 0 or a[1] % 2 != 0 and a[0] % 2 == 0 :\r\n if a[2] % 2 == 0 :\r\n for i in a:\r\n if i % 2 != 0:\r\n print(a.index(i) + 1)\r\n if a[2] % 2 != 0 :\r\n for i in a:\r\n if i % 2 == 0:\r\n print(a.index(i) + 1)\r\n\r\n\r\n", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nloc={}\r\n\r\nfor i, val in enumerate(num):\r\n if val%2==0:\r\n loc[i]=True\r\n else:\r\n loc[i]=False\r\n \r\nif sum(loc.values()) > 1:\r\n for k, v in loc.items():\r\n if v==False:\r\n print(k+1)\r\nelse:\r\n for k, v in loc.items():\r\n if v==True:\r\n print(k+1)", "n1 = input()\r\nn = list(map(int, input().split()))\r\nchetn = []\r\nne_chetn = []\r\nfor i in range(len(n)):\r\n if n[i] % 2 == 0:\r\n chetn.append(i+1)\r\n else:\r\n ne_chetn.append(i+1)\r\n# print(chetn)\r\n# print(ne_chetn)\r\nif len(chetn) > len(ne_chetn):\r\n print(ne_chetn[0])\r\nelse:\r\n print(chetn[0])", "n = int(input())\r\nns = list(map(int,input().split()))\r\neven,odd,evf,odf=0,0,0,0\r\nfor i in ns:\r\n if i%2:\r\n if odd==0:\r\n odf=i\r\n odd+=1\r\n else:\r\n if even==0:\r\n evf=i\r\n even+=1\r\nif(even>odd):\r\n print(ns.index(odf)+1)\r\nelse:\r\n print(ns.index(evf)+1)\r\n", "n = int(input())\r\n\r\nevenness = list(map(lambda n: int(n) % 2 == 0, input().split()))\r\n\r\nis_even = evenness[:3].count(True) < evenness[:3].count(False)\r\n\r\nprint(1 + evenness.index(is_even))", "n = int(input())\r\nnumbers = [int(x) for x in input().split(' ')]\r\neven = 0\r\nodd = 0\r\nsign = 0\r\nfor i in numbers:\r\n if i % 2 == 0:\r\n even += 1\r\n elif i % 2 == 1:\r\n odd += 1\r\n if odd >= 2:\r\n sign = 1\r\n break\r\n if even >= 2:\r\n sign = 0\r\n break\r\nfor i in range(n):\r\n if numbers[i] % 2 != sign:\r\n print(i+1)\r\n break\r\n ", "input()\r\nl = list(map(int, input().split()))\r\nfirst_even, first_odd = -1, -1\r\n# Find major parity\r\na = 0\r\ntemp = 1 # define which evenness we look for\r\nfor i in range(3):\r\n if l[i] & 1:\r\n a += 1\r\nif a>=2:\r\n temp = 0\r\nfor i, e in enumerate(l):\r\n if e%2==temp:\r\n print(i+1)\r\n break", "n=int(input())\r\ntest=[int(x) for x in input().split()]\r\na=['2']\r\nfor t in test:\r\n if t%2==0:\r\n a.append('1')\r\n else:\r\n a.append('0')\r\nprint(a.index('1') if a.count('1')==1 else a.index('0'))", "n = int(input())\r\nevenness = even = 0\r\na = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n if even == 0:\r\n even = i + 1\r\n else:\r\n evenness = 1\r\n else:\r\n odd = i + 1\r\n\r\nif evenness:\r\n print(odd)\r\nelse :\r\n print(even)\r\n\r\n", "\r\nx = int(input())\r\ny = input()\r\na = [int(i) for i in y.split(\" \")]\r\ne_ct = 0\r\no_ct = 0\r\nfor i in range(0, x):\r\n if a[i] % 2 == 0:\r\n e_ct = e_ct + 1\r\n else:\r\n o_ct = o_ct + 1\r\nr = 0\r\nif e_ct > o_ct:\r\n for i in range(0, x):\r\n if a[i] % 2 != 0:\r\n r = i + 1\r\n break\r\nif e_ct < o_ct:\r\n for i in range(0, x):\r\n if a[i] % 2 == 0:\r\n r = i + 1\r\n break\r\nprint(r)\r\n", "import sys\r\n\r\nlocal_launch = False\r\ntry:\r\n open('LOCAL').read()\r\n local_launch = True\r\nexcept:\r\n pass\r\ninput_data = open('INPUT.txt').read() if local_launch else sys.stdin.read()\r\ndone = {'i': 0}\r\ntokens = input_data.split()\r\n\r\ndef next_token():\r\n result = tokens[done['i']]\r\n done['i'] += 1\r\n return result\r\n\r\ndef next_int():\r\n return int(next_token())\r\n\r\ndef next_str():\r\n return next_token()\r\n\r\n\r\n\r\ndef index(a, x):\r\n for i in range(len(a)):\r\n if a[i] == x:\r\n return i\r\n\r\n############## BEGIN OF CODE #####################\r\nn = next_int()\r\na = []\r\nodd = 0\r\neven = 0\r\nfor i in range(n):\r\n x = next_int()\r\n a.append(x)\r\n\r\nfor i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n odd += 1\r\n\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n even += 1\r\nif odd>even:\r\n for i in range (len(a)):\r\n if a[i] %2 == 0:\r\n print(i+1)\r\nif even > odd:\r\n for i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n print(i+1)", "n=int(input())\r\na= list(map(int, input().split()))\r\neven,odd=0,0\r\nfor i in range(3):\r\n if a[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nfor i in range(n):\r\n if even>odd:\r\n if a[i]%2!=0:\r\n print(i+1)\r\n break\r\n else:\r\n if a[i]%2==0:\r\n print(i+1)\r\n break", "x = int(input())\r\ny = input().split()\r\nans = []\r\nans1 = []\r\nfor i in range(x):\r\n if int(y[i]) % 2 == 0:\r\n ans.append(i+1)\r\n else:\r\n ans1.append(i+1)\r\nif len(ans) > len(ans1):\r\n print(*ans1)\r\nelse:\r\n print(*ans)", "def ans(n,nums):\r\n e,ei,o,oi=0,0,0,0\r\n for i in range(n):\r\n if nums[i]%2==0:\r\n e=i\r\n ei+=1\r\n elif nums[i]%2!=0:\r\n o=i\r\n oi+=1\r\n if ei==1:\r\n return e+1\r\n return o+1\r\n\r\nn=int(input())\r\nnums=list(map(int,input().split(\" \")))\r\n#print(nums)\r\nprint(ans(n,nums))\r\n\r\n", "\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n di=abs(a[i]-a[j])\r\n if di%2==1:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nfor i in range(len(a)):\r\n if d[i]==n-1:\r\n print(i+1)", "#25A\r\nn = int(input())\r\nnum = [int(x) for x in input().split()]\r\nodd = 0 \r\neven = 0\r\nfor i in range(3):\r\n if num[i]%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n \r\ndef find(x): #x==1:find odd number,x==0: find even number\r\n for i in range(n):\r\n if num[i]%2 == x:\r\n return i\r\nif even > odd:\r\n print(find(1)+1)\r\nelse:\r\n print(find(0)+1)", "n = int(input()) \r\na = list(map(int,input().split())) \r\neven = [i for i in range(n) if a[i]%2 == 0] \r\nodd = [i for i in range(n) if a[i]%2 == 1] \r\nprint(even[0]+1 if len(even) == 1 else odd[0]+1)\r\n ", "n, evens, odds, ind1, ind2= int(input()), 0, 0, 0, 0\r\ntempArr = [int(item) for item in input().split(' ')]\r\n\r\nfor i in range(n):\r\n if tempArr[i] % 2 == 0:\r\n evens += 1\r\n ind1 = i + 1\r\n else:\r\n odds += 1\r\n ind2 = i + 1\r\n\r\nprint(ind1 if odds > evens else ind2)\r\n\r\n\r\n", "n= int(input())\r\na = list(map(int,input().split()))\r\nb = a.copy()\r\na.sort(key=lambda x:x%2)\r\n\r\nif(a[0]%2 == a[1]%2):\r\n print(b.index(a[-1])+1)\r\nelse:\r\n print(b.index(a[0])+1)\r\n", "n = int(input())\nli = list(map(int,input().split()))\neven = 0\nodd = 0\nfor i in li:\n\tif i%2==0:even+=1 \n\telse:odd+=1\nindeX = int()\nfor i in li:\n\tif even>odd:\n\t\tif i%2!=0:\n\t\t\tindeX = li.index(i)\n\telse:\n\t\tif i%2==0:\n\t\t\tindeX = li.index(i) \nprint(indeX+1)\n \t\t \t \t\t \t\t\t \t \t\t \t \t", "n = int(input())\ns = list(map(int, input().split()))\n\nodds = 0\nevens = 0\nodd_highest_index = -1\neven_highest_index = -1\nfor i, number in enumerate(s):\n if number % 2 == 0:\n evens += 1\n even_highest_index = i\n else:\n odds += 1\n odd_highest_index = i\n\nif odds == 1:\n print(odd_highest_index+1)\nelif evens == 1:\n print(even_highest_index+1)\n\n \t\t\t \t\t\t\t\t\t\t \t\t \t\t\t\t\t\t \t \t\t", "# AUTHOR : Siddhant Tohan\r\n# \"I guess,as long as I have life,all I can do is fight with all my might\"\r\nn=int(input())\r\nitems=list(map(int,input().split()))\r\ndictItem={0:[],1:[]}\r\nfor i in range(n):\r\n dictItem[items[i]%2].append(i+1)\r\n\r\nif len(dictItem[1])<len(dictItem[0]): print(dictItem[1][0])\r\nelse : print(dictItem[0][0])\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nei = []\r\noi=[]\r\nfor i in range(n):\r\n\tif l[i]%2 == 0:\r\n\t\tei.append(i+1)\r\n\telse:\r\n\t\toi.append(i+1)\r\n\t\r\nif len(ei) < len(oi):\r\n\tprint(ei[0])\r\nelse:\r\n\tprint(oi[0])", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl1=[(i%2) for i in l]\r\nif l1[0]==l1[1]==l1[2]:\r\n a=l1[0]\r\nelse:\r\n a=(l1[0]+l1[1]+l1[2])//2\r\nfor i in range(n):\r\n if l1[i]!=a:\r\n print(i+1)\r\n", "def main():\r\n n = int(input().strip())\r\n numbers = list(map(int, input().strip().split()))\r\n even_count = 0\r\n odd_count = 0\r\n even_index = 0\r\n odd_index = 0\r\n for i, num in enumerate(numbers):\r\n if num % 2 == 0:\r\n even_count += 1\r\n even_index = i\r\n else:\r\n odd_count += 1\r\n odd_index = i\r\n if even_count == 1:\r\n print(even_index + 1)\r\n else:\r\n print(odd_index + 1)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\na=list(map((lambda x: int(x)),input().split()))\r\nkola=0\r\nkolb=0\r\nfor ii in a:\r\n if ii % 2==0:\r\n kola+=1\r\n else:\r\n kolb+=1\r\ni=0\r\nif kola==1:\r\n for ii in a:\r\n i+=1\r\n if ii % 2==0:\r\n print(i)\r\nelse:\r\n for ii in a:\r\n i+=1\r\n if ii % 2!=0:\r\n print(i)\r\n", "def main():\n input()\n nums = [int(x) for x in input().split(\" \")]\n e = nums[0] % 2\n if e != nums[1] % 2 and e != nums[2] % 2:\n print(1)\n return\n for index, i in enumerate(nums[1:]):\n if i % 2 != e:\n print(index+2)\n return\n\n\n\nif __name__ == \"__main__\":\n main()\n", "def EvenNumbers(l):\r\n r = 0\r\n for i in l:\r\n if i % 2 == 0:\r\n r += 1\r\n return r\r\n \r\ndef OddNumbers(l):\r\n r = 0\r\n for i in l:\r\n if i % 2 != 0:\r\n r += 1\r\n return r\r\n \r\ndef firstEven(l):\r\n for i in l:\r\n if i % 2 == 0:\r\n return l.index(i) + 1\r\n \r\ndef firstOdd(l):\r\n for i in l:\r\n if i % 2 != 0:\r\n return l.index(i) + 1\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nif EvenNumbers(l) > OddNumbers(l):\r\n print(firstOdd(l))\r\nelif EvenNumbers(l) < OddNumbers(l):\r\n print(firstEven(l))", "a = int(input())\r\nb = list(map(int,input().split()))\r\ncountE = 0\r\ncountO = 0\r\nfor i in b:\r\n if i % 2 == 0:\r\n countE += 1\r\n if i % 2 != 0:\r\n countO += 1\r\nif countE>countO:\r\n for j in b:\r\n if j % 2 != 0:\r\n print((b.index(j))+1)\r\nelse:\r\n for k in b:\r\n if k % 2 == 0:\r\n print((b.index(k))+1)", "l = int(input())\r\narr = list(map(int, input().split()))\r\neven = []\r\nodd = []\r\nfor i in arr:\r\n if i%2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n \r\nif len(even) == 1:\r\n ans = arr.index(even[0])\r\n\r\nif len(odd) == 1:\r\n ans = arr.index(odd[0])\r\n \r\nprint(ans + 1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Check if there are more even numbers or odd numbers\r\nnum_even = sum(1 for num in numbers if num % 2 == 0)\r\nif num_even > 1:\r\n # If there are more even numbers, the odd one is different\r\n for i, num in enumerate(numbers):\r\n if num % 2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n # If there is only one even number, it is the different one\r\n for i, num in enumerate(numbers):\r\n if num % 2 == 0:\r\n print(i+1)\r\n break\r\n", "def check_lucky(num):\r\n\twhile(num>0):\r\n\t\tdigit = num%10\r\n\t\tif digit not in [4,7]:\r\n\t\t\tflag = 1\r\n\t\t\treturn 0\r\n\t\tnum = num//10\r\n\treturn 1\r\n\r\nn = int(input())\r\ndigit = 0\r\nflag = 0\r\ns = input().split(' ')\r\narr = [int(i) for i in s]\r\n# print(arr)\r\ncount_even = 0\r\ncount_odd = 0\r\n\r\nfor i in range(3):\r\n\tif arr[i]%2==1:\r\n\t\tcount_odd += 1\r\n\telse:\r\n\t\tcount_even += 1\r\n# print(count_even)\r\n# print(count_odd)\r\nif count_even>count_odd:\r\n\tfor i in range(n):\r\n\t\tif arr[i]%2==1:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif arr[i]%2==0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\r\n# if len(s)>2:\r\n# \ts = s[1:-1]\r\n# \ts = s.split(\", \")\r\n# \tset_s = set(s)\r\n# \tcount = 0\r\n# \tfor i in set_s:\r\n# \t\tcount+=1\r\n# \tprint(count)\r\n# else:\r\n\t# print('0')\r\n# # s = s.replace(\"WUB\",\"\")\r\n# n = int(s[0])\r\n# m = int(s[1])\r\n# w = input().split(\" \")\r\n# num_arr = [int(i) for i in w]\r\n# num_arr.sort()\r\n# # print(num_arr)\r\n# min_num = []\r\n# for i in range(m-n+1):\r\n# \tmin_num.append(num_arr[n+i-1]-num_arr[i])\r\n# \t# print(min_num)\r\n# print(min(min_num))\r\n\r\n# for i in range(len(s)):\r\n# \tif s[i]!='':\r\n# \t\tprint(s[i],end='')\r\n# \t\tif i!=len(s)-1:\r\n# \t\t\tprint(\" \",end='')\r\n# a = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n# arr = [a+b+c,a*b*c,(a+b)*c,a*(b+c),a*b+c,a+b*c]\r\n# print(max(arr))\r\n# s = [int(i) for i in arr]\r\n# s.sort()\r\n# print(s)\r\n# length = len(arr)\r\n# i = 0\r\n# while(i<length):\r\n# \tif arr[i]==arr2[i]:\r\n# \t\tprint('0',end='')\r\n# \telse:\r\n# \t\tprint('1',end='')\r\n# \ti += 1\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nodd=[]\r\neven=[]\r\nfor x in b:\r\n if x%2==0:\r\n even.append(x)\r\n else:\r\n odd.append(x)\r\nif len(even)==1:\r\n print(b.index(even[0])+1)\r\nelse:\r\n print(b.index(odd[0])+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif (a[0] & 1 and a[1] & 1) or (a[0] & 1 and a[2] & 1) or (a[1] & 1 and a[2] & 1):\r\n evenness = \"odd\"\r\nelse:\r\n evenness = \"even\"\r\n\r\nfor i in range(n):\r\n if evenness == \"odd\" and not(a[i] & 1):\r\n print(i + 1)\r\n break\r\n if evenness == \"even\" and a[i] & 1:\r\n print(i + 1)\r\n break\r\n", "# https://codeforces.com/problemset/problem/25/A\r\n\r\ndef main():\r\n n = input()\r\n s = list(map(int, input().split(' ')))\r\n even = 0\r\n odd = 0\r\n i_even = 0\r\n i_odd = 0\r\n for i in range(len(s)):\r\n if s[i] % 2 == 0:\r\n even += 1\r\n i_even = i + 1\r\n else:\r\n odd += 1\r\n i_odd = i + 1\r\n if even < odd:\r\n print(i_even)\r\n else:\r\n print(i_odd)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\nn = int(input())\r\nnums = [int(x) for x in input().split()]\r\n\r\neven = 0\r\nfor i in range(3):\r\n if nums[i] % 2 == 0:\r\n even += 1\r\n\r\nindex = 1\r\nif even >= 2:\r\n for num in nums:\r\n if num % 2 != 0:\r\n print(index)\r\n break\r\n index += 1\r\nelse:\r\n for num in nums:\r\n if num % 2 == 0:\r\n print(index)\r\n break\r\n index += 1\r\n", "def main():\n n = int(input())\n a = list(map(int, input().split(' ')))\n evens = list(filter(lambda i: a[i] % 2 == 0, list(range(n))))\n odds = list(filter(lambda i: a[i] % 2 != 0, list(range(n))))\n if len(evens) > len(odds):\n return odds[0] + 1\n return evens[0] + 1\nprint(main())\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\neven,odd = 0,0\r\nfor i in nums:\r\n if i % 2:\r\n even += 1\r\n else:\r\n odd += 1\r\nflag = 0 if even > odd else 1\r\nres = -1\r\nfor i,val in enumerate(nums):\r\n if val % 2 == flag:\r\n res = i + 1\r\n break\r\nprint(res)", "n = int(input())\r\na = [int(v) for v in input().split(' ')]\r\no = sum([v%2 for v in a])<2\r\nfor i in range(n):\r\n if a[i]%2==o:\r\n print(i+1)\r\n", "n = int(input())\r\nls = input().split()\r\nfor i in range(n):\r\n ls[i] = int(ls[i])\r\ndef evenness(x):\r\n odd, even = 0, 0\r\n for i in x[:3]:\r\n if i%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if odd >= 2:\r\n for i in range(len(x)):\r\n if x[i]%2 == 0:\r\n return i + 1\r\n else:\r\n for i in range(len(x)):\r\n if x[i]%2 != 0:\r\n return i + 1\r\nprint(evenness(ls))", "n = int(input().strip())\r\nnumbers = list(map(int,input().strip().split(' ')))\r\neven_numbers = list(filter(lambda x: x%2==0,numbers))\r\nodd_numbers = list(filter(lambda x: x%2==1,numbers))\r\nif len(even_numbers)>len(odd_numbers):\r\n number_different = odd_numbers\r\nelse:\r\n number_different = even_numbers\r\n\r\nprint(numbers.index(*number_different)+1)", "test_num = int(input())\nline = [int(j) for j in input().split()]\nline_parity = []\none_pos = []\nzero_pos = []\nfor i in range(len(line)):\n if int(line[i]) % 2 == 0:\n line_parity.append(0)\n else:\n line_parity.append(1)\nfor j in range(len(line_parity)):\n if line_parity[j] == 1:\n one_pos.append(j)\n else:\n zero_pos.append(j)\nif len(one_pos) == 1:\n print(one_pos[0] + 1)\nelse:\n print(zero_pos[0] + 1)", "input()\r\ns = list(map(int, input().split(' ')))\r\nif s[0] % 2 == s[1] % 2:\r\n k = s[0]\r\nelif s[0] % 2 == s[2] % 2:\r\n k = s[0]\r\nelif s[1] % 2 == s[2] % 2:\r\n k = s[1]\r\n \r\nj = 0\r\nfor x in s:\r\n if x % 2 != k % 2:\r\n j = s.index(x)\r\nprint(j+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\noddc=sum(1 for i in l if i%2==1)\r\nevenc=sum(1 for i in l if i%2==0)\r\n\r\nif oddc==1:\r\n for i in l:\r\n if i%2==1:\r\n print(l.index(i)+1)\r\nelif evenc==1:\r\n for i in l:\r\n if i%2==0:\r\n print(l.index(i)+1)\r\n ", "n = int(input())\r\npoints = list(input().split())\r\npoints = [int(i) for i in points]\r\no = 0\r\ne = 0\r\nindexe = 0\r\nindexo = 0\r\nfor i in range(len(points)):\r\n if points[i] & 1 == 0:\r\n o += 1\r\n indexo = i\r\n elif points[i] & 1 == 1:\r\n e += 1\r\n indexe = i\r\nif o == 1 :print(indexo+1)\r\nelif e == 1 :print(indexe+1)\r\n", "def main():\r\n n = int(input())\r\n Ar = list(map(int, input().split()))\r\n even = 0\r\n l_even = 0\r\n odd = 0\r\n l_odd = 0\r\n for idx in range(n):\r\n if Ar[idx]%2 == 0:\r\n even += 1\r\n l_even = idx + 1\r\n else:\r\n odd += 1\r\n l_odd = idx + 1\r\n \r\n if even == 1:\r\n print(l_even)\r\n else:\r\n print(l_odd)\r\n\r\nmain()", "n=int(input())\r\na=list(map(int , input().split()))\r\nx=a[0]%2\r\nx1=a[n-1]%2\r\nif x==x1:\r\n if x==1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\n else:\r\n for i in range(n):\r\n if a[i]%2==1:\r\n print(i+1)\r\n break\r\nelse:\r\n x2=a[1]%2\r\n if x==x2:\r\n print(n)\r\n else:\r\n print(1)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ncounteven = 0\r\ncountodd = 0\r\nfor i in range(3):\r\n if(lst[i]%2==0):\r\n counteven += 1 \r\n else:\r\n countodd += 1 \r\n\r\nif(countodd > counteven):\r\n check = 0\r\nelse:\r\n check = 1 \r\n \r\nfor i in range(n):\r\n if(lst[i] % 2 == check):\r\n print(i+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\ne=o=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e+=1\r\n res1=i+1\r\n else:\r\n o+=1\r\n res2=i+1\r\nif e>o:\r\n print(res2)\r\nelse:\r\n print(res1)", "input()\r\na=[int(i)%2 for i in input().split()]\r\nprint(a.index(1)+1 if a.count(1)<a.count(0) else a.index(0)+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=l[0]%2\r\nb=l[1]%2\r\nc=l[2]%2\r\nif a==b and b==c:\r\n for i in range(n):\r\n if l[i]%2!=a:\r\n print(i+1)\r\nelse:\r\n if a==b and b!=c:\r\n print(3)\r\n elif a!=b and b==c:\r\n print(1)\r\n else:\r\n print(2)", "n = int(input())\r\nlist1 = [int(x) for x in input().split()]\r\na = 0\r\nb = 0\r\nfor i in list1:\r\n if i%2 == 0:\r\n a+=1\r\n else:\r\n b+=1\r\nif a>1:\r\n for i in list1:\r\n if i%2 != 0:\r\n x = list1.index(i)\r\n print(x+1)\r\nif b>1:\r\n for i in list1:\r\n if i%2 == 0:\r\n x = list1.index(i)\r\n print(x+1)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nevenness=[]\r\nfor i in range(n):\r\n evenness.append(nums[i]%2)\r\nprint(evenness.index([0,1][evenness.count(0)>evenness.count(1)])+1)", "N=int(input(\"\"))\r\nNros=list(map(int,input().split()))\r\nNI=0\r\nNP=0\r\nfor K in range(N):\r\n if(Nros[K]%2==0):\r\n NP+=1\r\n else:\r\n NI+=1\r\n if((NP==2)or(NI==2)):\r\n if(NP==2):\r\n Aux=0\r\n else:\r\n Aux=1\r\n break\r\nif(Aux==0):\r\n for J in range(N):\r\n if(Nros[J]%2!=0):\r\n print(J+1)\r\n break\r\nelse:\r\n for J in range(N):\r\n if(Nros[J]%2==0):\r\n print(J+1)\r\n break\r\n", "n = int(input())\nlst = input().split(' ')\nfor i in range(0, len(lst)):\n lst[i] = int(lst[i])\n\nodd = 0\neven = 0\n\nfor i in range(0, 3):\n if lst[i] % 2 == 0:\n even += 1\n else:\n odd += 1\n\nif odd > even:\n for i in range(0, len(lst)):\n if lst[i] % 2 == 0:\n print(i+1)\n break\nelse:\n for i in range(0, len(lst)):\n if lst[i] % 2 != 0:\n print(i+1)\n break\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = []\r\nd = []\r\nfor i in range (1,len(b) +1):\r\n\tif b[i-1] % 2 == 0 :\r\n\t\tc.append(i)\r\n\telse :\r\n\t\td.append(i)\r\nif len(c) == 1 :\r\n\tprint (c[0])\r\nelse :\r\n\tprint (d[0])", "n = int(input())\r\nchet, nechet = 0, 0\r\nnums = list(map(int, input().split()[:n]))\r\nfor i in nums:\r\n if i % 2 == 0:\r\n chet += 1\r\n else:\r\n nechet += 1\r\nif chet > nechet:\r\n for i in range(len(nums)):\r\n if nums[i] % 2 != 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(nums)):\r\n if nums[i] % 2 == 0:\r\n print(i + 1)", "# 25A -->\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in range(3):\r\n if(l[i]%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\nif(odd>1):\r\n for i in range(n):\r\n if(l[i]%2==0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if(l[i]%2==1):\r\n print(i+1)\r\n break", "input()\r\nnumber = input().split()\r\nfor i in range(len(number)):\r\n number[i] = int(number[i])\r\nodd = 0\r\neven = 0\r\nfor i in number:\r\n if i%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\nif odd > even:\r\n for i in range(len(number)):\r\n if number[i]%2 == 0:\r\n break\r\nelse:\r\n for i in range(len(number)):\r\n if number[i]%2 != 0:\r\n break\r\nprint(i+1)\r\n", "# S VINAY\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\neven_pos,odd_pos,c1,c2=0,0,0,0\r\nfor i in l:\r\n if i%2==0:\r\n even_pos=i\r\n c1+=1\r\n elif i%2==1:\r\n odd_pos=i\r\n c2+=1\r\nif c1==1:\r\n print(l.index(even_pos)+1)\r\nelif c2==1:\r\n print(l.index(odd_pos)+1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = []\r\nb = []\r\nfor i in l:\r\n if i%2==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a) == 1:\r\n print(l.index(a[0])+1)\r\nelse:\r\n print(l.index(b[0])+1)\r\n \r\n", "x = int(input())\r\ny = list(map(int, input().split()))\r\nc, d = [], []\r\nfor i in y:\r\n if i % 2 == 1:\r\n c.append(i)\r\n else:\r\n d.append(i)\r\nif len(c) == 1:\r\n print(y.index(c[0]) + 1)\r\nif len(d) == 1:\r\n print(y.index(d[0]) + 1)\r\n", "num=int(input())\r\nn= list(map(int,input().split()))\r\nevenness=[]\r\nodness=[]\r\nfor l in range(num):\r\n if n[l]%2==0:\r\n evenness.append(l)\r\n\r\n else:\r\n odness.append(l)\r\n if len(odness) > 1 and len(evenness) > 0:\r\n print(evenness[0] + 1)\r\n break\r\n elif len(evenness)>1 and len(odness)>0:\r\n print(odness[0]+1)\r\n break", "n=int(input())\r\ns=input().split(\" \")\r\nw=0\r\nfor i in range(3):\r\n if int(s[i])%2==0:\r\n w+=1\r\nans=\"\"\r\nif w>1:\r\n for i in range(len(s)):\r\n if int(s[i])%2!=0:\r\n ans=i+1\r\n break\r\nelse:\r\n for i in range(len(s)):\r\n if int(s[i])%2==0:\r\n ans=i+1\r\n break\r\nprint(ans) \r\n", "n = input()\r\noddCt, eventCt, oddInd, evenInd = 0, 0, 0, 0\r\ncont = [int(item) for item in input().split(' ')]\r\nfor i in range(len(cont)):\r\n if cont[i] % 2 == 0:\r\n eventCt += 1\r\n evenInd = i + 1\r\n else:\r\n oddCt += 1\r\n oddInd = i + 1\r\nif eventCt > oddCt:\r\n print(oddInd)\r\nelse:\r\n print(evenInd)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue May 12 08:21:40 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\n\r\n\r\ntemp=0\r\n\r\nodd=0\r\neven=0\r\nfor i in arr:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nfor x,y in enumerate(arr):\r\n if odd==1:\r\n if y%2==1:\r\n print(x+1)\r\n break\r\n elif even==1:\r\n if y%2==0:\r\n print(x+1)\r\n \r\n break\r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\nnu=[int(x) for x in input().split()]\r\n \r\nis_evens=[x%2 for x in nu]\r\nif is_evens.count(1)>is_evens.count(0):\r\n print(is_evens.index(0)+1)\r\nelse:\r\n print(is_evens.index(1)+1)", "_ = input()\r\nl = [int(x) % 2 for x in input().split()]\r\nprint(l.index(sum(l) == 1) + 1)", "n=int(input())\r\nnum=[(int(i)%2)for i in input().split()]\r\nzero=[v for v in num if v==0]\r\none=[v for v in num if v==1]\r\nif len(zero)==1:\r\n x=0\r\nelse:\r\n x=1\r\nfor i in range(n):\r\n if num[i]==x:\r\n print(i+1)\r\n break\r\n else:\r\n pass\r\n\r\n", "n=int(input())\r\nl=list(map(lambda x : int(x)%2 ,input().split()))\r\ns=sum(l[:3])\r\nx=-1\r\nif s<=1:x=1\r\nelse:x=0\r\nfor i in range(n):\r\n if l[i]==x:break\r\nprint(1+i)\r\n", "n = int(input())\r\na = input().split()\r\na = list(map(int, a))\r\nx = 0\r\n\r\nif a[0]%2 == a[1]%2 and a[1]%2 == a[2]%2:\r\n m = a[1]%2\r\n for i in range(3, n+1):\r\n if a[i-1]%2 != m:\r\n x = i\r\n\r\nelif a[0]%2 == a[1]%2 and a[0]%2 != a[2]%2:\r\n x = 3\r\nelif a[0]%2 == a[2]%2 and a[0]%2 != a[1]%2:\r\n x = 2\r\nelif a[1]%2 == a[2]%2 and a[0]%2 != a[2]%2:\r\n x = 1\r\nprint(x)", "n = int(input())\r\nch = 0\r\nnech = 0\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n ch += 1\r\n else:\r\n nech += 1\r\n if nech > 1 or ch > 1:\r\n break\r\nif nech > 1:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2:\r\n print(i + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nf=[]\r\ne=[]\r\nv=[i for i in a if i%2==0]\r\nd=[i for i in a if i%2==1]\r\nif len(v)>len(d):\r\n print(a.index(d[0])+1)\r\nelse:\r\n print(a.index(v[0])+1)\r\n", "n=int(input())\r\ne=0\r\nl=0\r\no=0\r\na=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n if a[i]%2==0:\r\n e+=1\r\n l=i+1\r\n else:\r\n e-=1\r\n o=i+1\r\nif e>0:\r\n print(o)\r\nelse:\r\n print(l)\r\n\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nevenno=0\r\noddno=0\r\nfor i in range(len(l)):\r\n if(l[i]%2==0):\r\n even+=1\r\n evenno=i+1\r\n else:\r\n odd+=1\r\n oddno=i+1\r\nif(even!=1):\r\n print(oddno)\r\nelse:\r\n print(evenno)\r\n \r\n \r\n \r\n", "x=int(input())\r\nev=[]\r\nod=[]\r\ns=list(map(int,input().split()))\r\nfor i in range(x):\r\n if s[i]%2==0:\r\n ev.append(s[i])\r\n else:\r\n od.append(s[i])\r\nif len(od)>len(ev):\r\n print(s.index(ev[0])+1)\r\nelse:\r\n print(s.index(od[0])+1)\r\n ", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n even = 0\r\n odd = 0\r\n\r\n for i in arr:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\n for i in range(n):\r\n if even == 1:\r\n if arr[i] % 2 == 0:\r\n print(i + 1)\r\n exit()\r\n else:\r\n if arr[i] % 2 != 0:\r\n print(i + 1)\r\n exit()\r\n\r\n\r\nmain()", "m=int(input())\r\nl=list(map(int,input().split()))\r\nc=[]\r\nd=[]\r\nfor i in l:\r\n if i%2==0:\r\n c.append(i)\r\n else:\r\n d.append(i)\r\nif len(c)==1:\r\n for i in c:\r\n print(l.index(i)+1 )\r\nelif len(d)==1:\r\n for i in d:\r\n print(l.index(i)+1)", "n=int(input())\r\nliste=list(map(int,input().split()))\r\ntab=[]\r\nfor i in liste:\r\n tab.append(i%2)\r\ncount_zero=tab.count(0)\r\ncount_one=tab.count(1) \r\nif count_one ==1:\r\n print(tab.index(1)+1)\r\nelif count_zero ==1:\r\n print(tab.index(0)+1)\r\n", "n=int(input())\r\nq=list(map(int,input().split()))\r\ncht=[]\r\nfor i in range(3): cht.append(q[i]%2)\r\nif len(set(cht))==1: f=cht[0]^1\r\nelif cht.count(0)>cht.count(1): f=1\r\nelse: f=0\r\nfor i in range(n):\r\n if q[i]%2==f: break\r\nprint(i+1)\r\n \r\n \r\n", "n = int(input());a = [int(x) for x in input().split()];print(next(i for i, n in enumerate(a) if sum(1 for x in a if x%2!=n%2)>sum(1 for x in a if x%2==n%2))+1)", "n = int(input())\r\narray = list(map(int, input().split()))\r\na_odd = sum(map(lambda x: x%2 == 1, array))\r\na_even = sum(map(lambda x: x%2 == 0, array))\r\nfor i in range(n):\r\n if a_even < a_odd:\r\n if array[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n else:\r\n if array[i] % 2 == 1:\r\n print(i+1)\r\n break", "input()\r\nl=input().split()\r\nl=list(map(lambda x:int(x)%2,l))\r\nif l.count(1)>l.count(0):\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in a:\r\n if i%2==0:\r\n b.append(2)\r\n else:\r\n b.append(1)\r\nfor i in set(b):\r\n if b.count(i)==1 and i==1:\r\n for j in a:\r\n if j%2!=0:\r\n print(a.index(j)+1)\r\n if b.count(i)==1 and i==2:\r\n for j in a:\r\n if j%2==0:\r\n print(a.index(j)+1)\r\n \r\n\r\n", "n, a, o, e = int(input()), list(map(int, input().split(' '))), 0, 0\r\nfor x in a:\r\n o += x & 1\r\n e += not(x & 1)\r\nif o == 1:\r\n for i in range(n):\r\n if a[i] & 1:\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if not(a[i] & 1):\r\n print(i + 1)", "n=int(input())\r\na=[int(a) for a in input().split()]\r\nev=0\r\nod=0\r\nie=0\r\nio=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n ev+=1\r\n ie=i\r\n else:\r\n od+=1\r\n io=i\r\nif(ev>od):\r\n print(io+1)\r\nelse:\r\n print(ie+1)", "n = int(input())\r\nnums = list(map(lambda ch: int(ch)%2, input().split()))\r\nprint(nums.index(0)+1 if sum(nums) > 1 else nums.index(1)+1)", "n=int(input())\r\nd=list(map(int,input().split()))\r\ne=list(filter(lambda x:x%2,d))\r\nev=len(e)\r\nod=n-ev\r\nif(od>ev):\r\n for i in range(len(d)):\r\n if d[i]%2==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(d)):\r\n if d[i]%2==0:\r\n print(i+1)\r\n break", "n = int(input())\r\nsp = [] \r\nk= input().split()\r\ncount= 0 \r\ncount1=0\r\nfor i in range(len(k)):\r\n if int(k[i])%2 == 0:\r\n count+=1\r\n index = i+1\r\n else:\r\n count1+=1\r\n index1=i+1\r\nif count == 1:\r\n print(index)\r\nelse:\r\n print(index1)", "n = int(input())\r\nnums = [int(item) for item in input().split()]\r\nodd = [item for item in nums if item % 2 == 1]\r\neven = [item for item in nums if item % 2 == 0]\r\n\r\nif len(odd) > len(even):\r\n print(nums.index(even[0]) + 1)\r\n\r\nelse:\r\n print(nums.index(odd[0]) + 1)\r\n", "# IQ тест - 1300\r\nnum_elements = int(input())\r\nnumbers = map(int, input().split())\r\nparity_map = [bool(el % 2) for el in numbers]\r\nprint(parity_map.index(True) + 1 if sum(parity_map) == 1 else parity_map.index(False) + 1)\r\n", "s = int(input())\r\nn = list(map(int,input().split()))\r\na = []\r\nb = []\r\nnumber = 0\r\nfor i in n:\r\n if i%2==0:\r\n a.append(i)\r\n elif i%2==1:\r\n b.append(i)\r\nif len(a)>len(b):\r\n B = b.pop()\r\n print(n.index(B)+1)\r\nelif len(a)<len(b):\r\n A = a.pop()\r\n print(n.index(A)+1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\noddCount = evenCount = oddIndex = evenIndex = 0\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n evenCount += 1\r\n evenIndex = i\r\n else:\r\n oddCount += 1\r\n oddIndex = i\r\n\r\nif evenCount == 1:\r\n print(evenIndex+1)\r\nelse:\r\n print(oddIndex+1)\r\n", "n = int(input())\r\narr = [int(i) % 2 for i in input().split()]\r\nfor i in range(1, n - 1):\r\n if arr[i - 1] == arr[i] == arr[i + 1]:\r\n continue\r\n elif arr[i - 1] == arr[i] != arr[i + 1]:\r\n print(i + 2)\r\n elif arr[i - 1] != arr[i] == arr[i + 1]:\r\n print(i)\r\n elif arr[i - 1] == arr[i + 1] != arr[i]:\r\n print(i + 1)\r\n break\r\n", "n = int(input())\r\neven = 0\r\nline = input()\r\na = line.split()\r\nfor i in range(n):\r\n if int(a[i]) % 2 == 0:\r\n even = even + 1\r\nindex = 0\r\nif even == n - 1:\r\n for i in range(n):\r\n if int(a[i]) % 2 != 0:\r\n index = i\r\nelse:\r\n for i in range(n):\r\n if int(a[i]) % 2 == 0:\r\n index = i\r\nprint(index + 1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ndef solve():\r\n n = inp()\r\n a = inlt()\r\n odd, even = 0, 0\r\n for num in a:\r\n if num & 1:\r\n odd += 1\r\n else:\r\n even += 1\r\n if even == 1:\r\n for i, num in enumerate(a):\r\n if not num & 1:\r\n print(i + 1)\r\n return\r\n else:\r\n for i, num in enumerate(a):\r\n if num & 1:\r\n print(i + 1)\r\n return\r\n\r\n\r\ndef main():\r\n # t = inp()\r\n t = 1\r\n for _ in range(t):\r\n solve()\r\n\r\nmain()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncountOdd = 0\r\n\r\nfor el in a:\r\n if el % 2 == 1:\r\n countOdd += 1\r\n\r\nif countOdd > 1:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n \r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n print(i+1)\r\n", "n=int(input())\r\nb=[int(i) for i in input().split()]\r\nc=[]\r\nfor i in b:\r\n x=i%2\r\n c.append(x)\r\nfor i in range(len(b)):\r\n if c.count(c[i])==1:\r\n print(i+1)\r\n else:\r\n pass\r\n ", "n=int(input())\r\nn1=[int(t) for t in input().split()]\r\nn2=[[],[]]\r\nfor i in range(n):\r\n if n1[i]%2==0:\r\n n2[1].append(i)\r\n else:\r\n n2[0].append(i)\r\nfor i in range(2):\r\n if len(n2[i])==1:\r\n print(n2[i][0]+1)", "numamt = int(input())\nx = list(map(int, input().split()))\neven = 0\nodd = 0\nfor i in x:\n\tif i%2 == 0:\n\t\teven += 1\n\telif i%2 != 0:\n\t\todd += 1\nif even > odd:\n\tfor i in x:\n\t\tif i%2 != 0:\n\t\t\tprint(x.index(i)+1)\nelse:\n\tfor i in x:\n\t\tif i%2 == 0:\n\t\t\tprint(x.index(i)+1)\n", "i = input()\r\nl = input().split()\r\nfor t in range(len(l)):\r\n l[t] = int(l[t])\r\nif l[0]%2 + l[1]%2 +l[2]%2 ==0 or l[0]%2 + l[1]%2 +l[2]%2 ==1:\r\n for x in l:\r\n if x % 2 == 1:\r\n print(l.index(x)+1)\r\n\r\nelif l[0]%2 + l[1]%2 +l[2]%2 ==2 or l[0]%2 + l[1]%2 +l[2]%2 ==3:\r\n for x in l:\r\n if x % 2 == 0:\r\n print(l.index(x)+1)", "n = int(input())\r\nnl = [int(i)%2 for i in input().split()]\r\nprint(nl.index(nl.count(1)==1)+1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nf=0\r\nc=0\r\nfor i in arr:\r\n if i%2!=0:\r\n c+=1\r\n if c==2:\r\n f=1 \r\n break \r\nindex=0\r\nif f==1:\r\n for i in range(n):\r\n if arr[i]%2==0:\r\n index=i \r\n break \r\nelse:\r\n for i in range(n):\r\n if arr[i]%2!=0:\r\n index=i \r\n break \r\nprint(index+1)", "w=int(input())\r\nc=list(map(int,input().split()))\r\ni=0\r\nfor m in c:\r\n c[c.index(m)]=m%2\r\nd=c[:]\r\nwhile i<=w-1:\r\n d.remove(d[i])\r\n if len(set(d))==1:\r\n print(i+1)\r\n break\r\n else:\r\n i=i+1\r\n d=c[:]\r\n\r\n", "_=input()\r\nm=[int(i)for i in input().split()]\r\na=(m[0]%2==0)+(m[1]%2==0)+(m[2]%2==0)\r\nif a>=2:\r\n\tfor b in m:\r\n\t\tif b%2!=0:\r\n\t\t\tprint(m.index(b)+1)\r\nelse:\r\n\tfor b in m:\r\n\t\tif b%2==0:\r\n\t\t\tprint(m.index(b)+1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl = [i % 2 for i in l]\r\nif l.count(0) == 1:\r\n print(l.index(0) + 1)\r\nelse:\r\n print(l.index(1) + 1)", "n = input()\narr = list(map(int, input().split()))\na, b, c = arr[0] % 2, arr[1] % 2, arr[2] % 2\nif(a == 0 and b == 0): k = 1\nelif(a == 1 and b == 1): k = 0\nelse:\n\tif(c == 1): k = 0\n\telse: k = 1\nfor i in range(len(arr)):\n\tif(arr[i] % 2 == k): break\nprint(i + 1)\n\n\t \t \t \t \t \t\t\t \t \t \t\t\t\t\t", "#iq_test.py\ninput()\nl = [int(x)%2 for x in input().split()]\nprint(l.index(sum(l)==1)+1)\n", "n = int(input())\r\ns=list(map(int,input().split()))\r\nfor i in range(len(s)):\r\n if s[i]%2==0:\r\n s[i]=0\r\n else:\r\n s[i]=1\r\nprint(s.index(0)+1 if s.count(0)<s.count(1) else s.index(1)+1)", "input()\r\nl = list(map(lambda x: int(x) % 2, input().split()))\r\nprint(1 + l.index(int(sum(l[:3]) < 2)))\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n-2):\n if a[i]%2 == a[i+1]%2 and a[i+1]%2 == a[i+2]%2:\n continue\n if a[i]%2 == a[i+1]%2:\n print(i+2+1)\n elif a[i+1]%2 == a[i+2]%2:\n print(i+1)\n else:\n print(i+1+1)\n break", "l={}\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nfor i in range(n):\r\n m=t[i]%2\r\n if m not in l:\r\n l[m]=1\r\n else:\r\n l[m]+=1\r\nfor i in range(n):\r\n if l[t[i]%2]==1:\r\n print(i+1)\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if x[i]%2==0:\r\n c=c+1\r\n \r\nif c==1:\r\n for i in x:\r\n if i%2==0:\r\n print(x.index(i)+1)\r\nelse:\r\n for i in x:\r\n if i%2!=0:\r\n print(x.index(i)+1) ", "n=int(input())\r\ns=[int(a)%2 for a in input().split()]\r\nfor j in range(n):\r\n if s.count(s[j])==1:\r\n print(j+1)\r\n break", "n=int(input())\r\na=[]\r\ninde=0\r\nindo=0\r\ncnt=0\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%2:\r\n indo=i+1\r\n else:\r\n inde=i+1\r\n cnt+=1\r\nif cnt!=1:\r\n print(indo)\r\nelse:\r\n print(inde)\r\n", "n = int(input())\r\na = [int(a) for a in input().split()]\r\nb=[]\r\nc=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n b.append(a[i])\r\n elif a[i]%2!=0:\r\n c.append(a[i])\r\nif len(b)>len(c):\r\n q=a.index(c[0])\r\nelse:\r\n q=a.index(b[0])\r\nprint(q+1)\r\n", "n = int(input())\r\nn1 = input().split()\r\n\r\nn2 = []\r\n\r\nfor x in n1:\r\n y = int(x)%2\r\n if y == 0:\r\n n2.append(0)\r\n elif y != 0:\r\n n2.append(1)\r\n\r\nif n2.count(0) > n2.count(1):\r\n print(n2.index(1)+1)\r\nelif n2.count(0) < n2.count(1):\r\n print(n2.index(0)+1)", "n = int(input())\r\nl = input().split()\r\no = e = 0\r\na = b = 0\r\nfor i in range(len(l)):\r\n if int(l[i]) % 2 == 0:\r\n e += 1\r\n if e > 1:\r\n a = 0\r\n break;\r\n else:\r\n a = i+1\r\nif e != 1:\r\n for j in range(len(l)):\r\n if int(l[j]) % 2 != 0:\r\n o += 1\r\n if o > 1:\r\n break\r\n else:\r\n a = j+1\r\nprint(a)\r\n \r\n\r\n \r\n", "sinp = int(input())\r\nlista = [int(i) for i in input().split()]\r\nodd , even, ind_odd, ind_even = 0,0,0,0\r\nfor item in lista:\r\n if item%2 == 0:\r\n even = even + 1\r\n ind_even = lista.index(item) +1\r\n else:\r\n odd = odd + 1\r\n ind_odd = lista.index(item) +1\r\nif even > odd:\r\n print (ind_odd)\r\nelse:\r\n print (ind_even)\r\n", "## IQ test\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\ns=0\r\np=0\r\nfor i in range(3):\r\n if m[i]%2==0:\r\n s+=1\r\n else:\r\n p+=1\r\nt=0\r\nfor i in range(n):\r\n if s>p:\r\n if m[i]%2==0:\r\n t+=1\r\n else:\r\n t+=1\r\n break\r\nfor i in range(n):\r\n if s<p:\r\n if m[i]%2!=0:\r\n t+=1\r\n else:\r\n t+=1\r\n break\r\nprint(t)\r\n", "a=int(input())\r\ninp = list(map(int,input().split()))\r\na=inp[0]%2\r\nb=inp[1]%2\r\nif(a==b):\r\n for i in range(2,len(inp)):\r\n if(inp[i]%2!=a):\r\n print(i+1)\r\n break\r\nelse:\r\n c=inp[2]%2\r\n if(a==c):\r\n print('2')\r\n else:\r\n print('1')", "n=int(input())\r\na=input().split()\r\ncounteven=0\r\nposeven=0\r\nposodd=0\r\n\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n poseven=i\r\n counteven+=1\r\n else:\r\n posodd=i\r\nif counteven==(n-1):\r\n print(posodd+1)\r\nelse:\r\n print(poseven+1)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nel=[]\r\nol=[]\r\nfor i in l:\r\n if i%2==0:\r\n el.append(i)\r\n else:\r\n ol.append(i)\r\nif len(el)==1:\r\n print(l.index(el[0])+1)\r\nelif len(ol)==1:\r\n print(l.index(ol[0])+1)", "t = int(input())\r\na = list(map(int, input().split(\" \")))\r\n\r\nodd = []\r\neven = []\r\n\r\nfor i in range(len(a)):\r\n if a[i] %2 == 0:\r\n even.append(a[i])\r\n else:\r\n odd.append(a[i])\r\n\r\nidx = 0\r\nif len(even) == 1:\r\n if even[0] in a:\r\n idx = a.index(even[0])+1\r\nelif len(odd) == 1:\r\n if odd[0] in a:\r\n idx = a.index(odd[0])+1\r\n\r\nprint(idx)\r\n\r\n", "n=int(input())\r\nl=list(input().split(' '))\r\nl1=[int(i)%2 for i in l]\r\nprint(l1.index(0)+1 if l1.count(1)>l1.count(0) else l1.index(1)+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\neve = []\r\nodd = []\r\n\r\nfor i in arr:\r\n if i%2==0:\r\n eve.append(i)\r\n else:\r\n odd.append(i)\r\n# print(eve,odd)\r\n\r\nif(len(eve) < len(odd)):\r\n print(arr.index(eve[0])+1)\r\nelse:\r\n print(arr.index(odd[0])+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb1 = 'a'\r\nc = 0\r\nfor i in range(n):\r\n b = a[i]%2\r\n c += b\r\n b1 = b1 + str(b)\r\nif c < n/2:\r\n print(b1.index('1'))\r\nelse:\r\n print(b1.index('0'))", "n = int(input())\r\na = input().split()\r\ns = []\r\nfor i in a:\r\n s.append(int(i))\r\nkk1=0\r\nkk2=0\r\nfor i in range(0,n):\r\n if s[i]%2==0:\r\n kk1 +=1\r\n k1 = i\r\n else:\r\n k2 = i\r\n kk2+=1\r\nif kk2>kk1:\r\n print(k1+1)\r\nelse:\r\n print(k2+1)", "n=int(input());\r\ntest=list(map(int,input().split()));\r\n\r\nnumodd=0;\r\nnumeven=0;\r\noddans=None;\r\nevenans=None;\r\ni=1;\r\nfor x in test:\r\n if x%2==1:\r\n numodd+=1;\r\n oddans=i;\r\n else:\r\n numeven+=1;\r\n evenans=i;\r\n if numodd>1 and numeven==1:\r\n ans=evenans;\r\n break;\r\n if numeven>1 and numodd==1:\r\n ans=oddans;\r\n break;\r\n i+=1;\r\n\r\nprint(ans)\r\n \r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\ncount_even = 0\r\ncount_odd = 0\r\n\r\nfor i in range (len(s)):\r\n if s[i]%2 == 0:\r\n count_even += 1\r\n else:\r\n count_odd += 1\r\n\r\nfor i in range (len(s)):\r\n if (count_even == 1 and s[i]%2 == 0):\r\n print(i+1)\r\n break\r\n elif (count_odd == 1 and s[i]%2 != 0):\r\n print(i+1)\r\n break\r\n else:\r\n continue", "n = int(input())\r\nls = list(map(int,input().split()))\r\n\r\nif (ls[0] & 1) ^ (ls[1] & 1):\r\n if ls[0] & 1 == ls[2] & 1:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n flag = ls[0] & 1\r\n for i in range(n):\r\n if ls[i] & 1 != flag:\r\n print(i+1)\r\n break", "\r\nnum = int(input())\r\nlis = input().split()\r\n\r\nlst = list()\r\nfor i in lis:\r\n lst.append(int(i))\r\n\r\ncount_even = 0\r\ncount_odd = 0\r\n\r\nfor i in range(len(lst)):\r\n if lst[i]%2==0:\r\n count_even += 1\r\n last_even = lst.index(lst[i])\r\n else:\r\n count_odd += 1\r\n last_odd = lst.index(lst[i])\r\n\r\nif count_even == 1:\r\n print(last_even+1)\r\nelse:\r\n print(last_odd+1)\r\n", "n=int(input())\r\na=input().split()\r\nb=[0]*n\r\nfor i in range(n):\r\n b[i]=int(a[i])%2\r\nif b.count(1)==1:\r\n print(b.index(1)+1)\r\nelse:\r\n print(b.index(0)+1)\r\n ", "n=int(input())\r\nl=[int(i)%2 for i in input().split()]\r\nt=0\r\nfor i in l:\r\n t=t+i\r\nif t>1:\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)\r\n \r\n \r\n \r\n\r\n \r\n\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nevenCount = 0\r\noddCount = 0\r\nevenIndex = 0\r\noddIndex = 0\r\n\r\nfor i, num in enumerate(numbers):\r\n if num % 2 == 0:\r\n evenCount += 1\r\n evenIndex = i\r\n else:\r\n oddCount += 1\r\n oddIndex = i\r\n\r\nif evenCount == 1:\r\n print(evenIndex + 1)\r\nelif oddCount == 1:\r\n print(oddIndex + 1)\r\nelse:\r\n print(-1)", "def even(x):\r\n return int(x)%2\r\nx=int(input())\r\ny=list(map(even,input().split()))\r\nif y.count(0)>1:\r\n print(y.index(1)+1)\r\nelse:\r\n print(y.index(0)+1)", "n = int(input())\r\nnumeros = list(map(int,input().split()))\r\n\r\npares = []\r\nimpares = []\r\nfor i in range(n):\r\n if numeros[i] % 2 == 0:\r\n pares.append(numeros[i])\r\n else:\r\n impares.append(numeros[i])\r\n\r\n\r\nif len(pares) > len(impares):\r\n num_index = impares.pop(0)\r\nelse:\r\n num_index = pares.pop(0)\r\n\r\nnum_difer = numeros.index(num_index)\r\nprint(num_difer + 1)", "n = int(input())\r\na = [int(i)%2 for i in input().split()]\r\nif sum(a)==1: print(a.index(1)+1)\r\nelse: print(a.index(0)+1)", "n=int(input())\r\nar=list(map(int,input().split()))\r\nodd=[1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]\r\neven=[0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98,100]\r\nl1=[]\r\nl2=[]\r\nfor i in range(n):\r\n if(ar[i] in odd):\r\n l1.append(i)\r\n if(ar[i] in even):\r\n l2.append(i)\r\nif(len(l1)>len(l2)):\r\n print(l2[0]+1)\r\nelse:\r\n print(l1[0]+1)\r\n\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[i for i in range(n) if l[i]%2==0]\r\nne=[i for i in range(n) if l[i]%2!=0]\r\nif len(ne)>len(k):\r\n print(k[0]+1)\r\nif len(k)>len(ne):\r\n print(ne[0]+1)\r\n", "__author__ = 'Utena'\r\ns1=0\r\ns2=0\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\nfor i in range(n):\r\n if m[i]%2==0:s2+=1\r\n elif m[i]%2==1:s1+=1\r\n if s1==2 or s2==2:break\r\nif s1==2:\r\n for i in range(n):\r\n if m[i]%2==0:\r\n print(i+1)\r\n exit(0)\r\nelse:\r\n for i in range(n):\r\n if m[i]%2==1:\r\n print(i+1)\r\n exit(0)", "n = int(input())\r\na = list(map(int, input().split()))\r\na1, a2 = [], []\r\nfor i in range(n):\r\n if a[i] % 2 == 1:\r\n a1.append(i + 1)\r\n else:\r\n a2.append(i + 1)\r\nif len(a1) == 1:\r\n print(a1[0])\r\nelse:\r\n print(a2[0])\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split(\" \")))\r\ndef paridad(lista, i):\r\n if i >= len(lista):\r\n return 0\r\n return (lista[i] % 2) + paridad(lista, i+1)\r\n\r\nif paridad(numbers, 0)==1:\r\n for i in range(len(numbers)):\r\n if( numbers[i] % 2 == 1):\r\n print(i+1)\r\n exit()\r\nelse:\r\n for i in range(len(numbers)):\r\n if(numbers[i] % 2 == 0):\r\n print(i+1)\r\n exit()\r\n \r\n ", "def fun():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n odd=0\r\n even=0\r\n for i in l:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if odd>even:\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\n else:\r\n for i in range(n):\r\n if l[i]%2!=0:\r\n print(i+1)\r\n break\r\n \r\n \r\n \r\nfun();", "n = int(input())\r\nresult = [int(x) for x in input().split()]\r\nansodd = 0\r\nanseven = 0\r\nsumodd = 0\r\nsumeven = 0\r\nfor i in range(n):\r\n if result[i] % 2 == 1:\r\n ansodd = i + 1\r\n sumodd += 1\r\n else:\r\n anseven = i + 1\r\n sumeven += 1\r\nprint(ansodd if sumodd == 1 else anseven)", "n=int(input())\r\na=input().split()\r\na=[int(i) for i in a]\r\nx=[i for i in a if i%2==0]\r\nif len(x)==1:\r\n print(a.index(x[0])+1)\r\n exit()\r\nx=[i for i in a if i%2!=0]\r\nprint(a.index(x[0])+1)", "from sys import *\r\ninput = stdin.readline\r\nn = int(input())\r\nl = list(map(lambda x: int(x)%2, input().split()))\r\nfor i in range(n):\r\n f = l[:i] + l[i+1:]\r\n if l[i] == 0:\r\n if 0 not in f:\r\n print(i+1)\r\n break\r\n else:\r\n if 1 not in f:\r\n print(i+1)\r\n break", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nec,oc=0,0\r\nfor i in range(n):\r\n if(lst[i]%2==0):\r\n ec+=1 \r\n else:\r\n oc+=1 \r\nif(ec==1):\r\n for i in range(n):\r\n if(lst[i]%2==0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if(lst[i]%2!=0):\r\n print(i+1)\r\n break", "c=0\r\ndef f(x):\r\n global c\r\n c+=1 if x%2==0 else 0\r\n return x%2\r\na=int(input())\r\nl=list(map(int,input().split()))\r\nk=sorted(l,key=f)\r\nprint(l.index(k[a-1])+1 if c!=1 else l.index(k[0])+1)", "#https://codeforces.com/problemset/problem/25/A\nn=int(input())\nl=list(map(int,input().split()))\no,e=0,0\nf=0\nfor i in range(n):\n\tif l[i]&1:\n\t\ton=i+1\n\t\to+=1\n\telse:\n\t\ten=i+1\n\t\te+=1\n\tif o >1 and e==1:\n\t\tf=1\n\t\tbreak\n\tif e > 1 and o==1:\n\t\tbreak\nif f:\n\tprint(en)\nelse:\n\tprint(on)\n\n", "n=int(input())\r\nnumbers=list(map(int,input().split()))\r\ncnteven=0\r\ncntodd=0\r\n\r\nfor i in range(n):\r\n if numbers[i]%2==0 :\r\n cnteven+=1\r\n else:\r\n cntodd+=1\r\n\r\n if cnteven == 2 :\r\n for j in range (n):\r\n if numbers[j]%2==1:\r\n print(j+1)\r\n break\r\n break\r\n\r\n if cntodd ==2:\r\n for j in range(n):\r\n if numbers[j] % 2 == 0:\r\n print(j + 1)\r\n break\r\n break", "n=int(input())\nline2=[int(i) for i in input().split()]\nline3=[]\nline4=[]\nline5=[0]\nfor i in line2:\n if i%2==0:\n line3.append(i)\n else:\n line4.append(i)\nfor i in line5:\n if len(line3)>len(line4):\n print(line2.index(line4[0])+1)\n if len(line3)<len(line4):\n print(line2.index(line3[0])+1)\n", "n=int(input())\r\ns=input()\r\ns=s.split()\r\nif(int(s[0])%2==0):\r\n if(int(s[1])%2==0):\r\n for i in range(2, n):\r\n if(not(int(s[i])%2==0)):\r\n print(i+1)\r\n break;\r\n elif(int(s[2])%2==0):\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n if(not(int(s[1])%2==0)):\r\n for i in range(2, n):\r\n if(int(s[i])%2==0):\r\n print(i+1)\r\n break;\r\n elif(int(s[2])%2==0):\r\n print(1)\r\n else:\r\n print(2)", "def iseven(n):\r\n if n%2 ==0:\r\n return 1\r\n else:\r\n return 0\r\n\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nfor i in range(n):\r\n s[i]=iseven(s[i])\r\nif sum(s)==1:\r\n print(s.index(1)+1)\r\nelse:\r\n print(s.index(0)+1)", "n = int(input())\r\np = [int(i) for i in input().split()]\r\ni1 = 0\r\ni0 = 0\r\nfor i in range(n):\r\n if p[i] % 2 == 1:\r\n i1 += 1\r\n else:\r\n i0 += 1\r\nif i1 == 1:\r\n for i in range(n):\r\n if p[i] % 2 == 1:\r\n print (i+1)\r\nif i0 == 1:\r\n for i in range(n):\r\n if p[i] % 2 == 0:\r\n print (i+1)", "n=int(input())\r\nlist1=input().split()\r\na=int(list1[0])%2\r\nb=int(list1[1])%2\r\nc=int(list1[2])%2\r\nif (a+b+c)>=2:\r\n a=1\r\nelse:\r\n a=0\r\nfor i in range(n):\r\n if int(list1[i])%2!=a:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nindex = 0\r\nodd = 0\r\n\r\nfor i in range(3):\r\n odd += numbers[i] % 2\r\n\r\nif odd >= 2:\r\n while numbers[index] % 2 == 1:\r\n index += 1\r\nelse:\r\n while numbers[index] % 2 == 0:\r\n index += 1\r\n\r\nprint(index + 1)\r\n", "_ = input()\r\nlst = []\r\nlst1 = []\r\ns = list(map(int,input().split()))\r\nfor i in s:\r\n\tif i%2==0:\r\n\t\tlst.append(i)\r\n\telse:\r\n\t\tlst1.append(i)\r\nif len(lst)==1:\r\n\tprint(s.index(lst[0])+1)\r\nelse:\r\n\tprint(s.index(lst1[0])+1)", "n = int(input())\na = [int(x) % 2 for x in input().split()]\nprint((a.index(1) if sum(a) == 1 else a.index(0)) + 1)", "n1=input()\r\nn=input()\r\nlist1=[]\r\nx=n.split(\" \")\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nfor i in x:\r\n list1.append(int(i))\r\n\r\nfor i in range (0,int(n1)):\r\n if(list1[i]%2==0):\r\n a=a+1\r\n c=i+1\r\n else:\r\n b=b+1\r\n d=i+1\r\nif(a>1):\r\n print(d)\r\nelse:\r\n print(c)\r\n \r\n \r\n", "array1 = []\r\narray2 = []\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\nfor i in numbers:\r\n if i % 2 == 1:\r\n array1.append(i)\r\n else:\r\n array2.append(i)\r\nif len(array1)>len(array2):\r\n print(numbers.index(array2[0])+1)\r\nelse:\r\n print(numbers.index(array1[0])+1)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nd = {}\r\n\r\nd[0] = []\r\nd[1] = []\r\n\r\nfor i in range(len(x)):\r\n if x[i] % 2 == 0:\r\n d[0].append(i+1)\r\n else:\r\n d[1].append(i+1)\r\n\r\nif len(d[0]) == 1:\r\n print(d[0][0])\r\nelse:\r\n print(d[1][0])", "import math\r\nn = eval(input(\"\"))\r\nl = list(map(int, input(\"\").split())) \r\nd,r = [],[]\r\nm,flag = 0,0\r\nf = 0\r\nfor i in range(n):\r\n r.append(l[i] % 2)\r\nfor i in range(n):\r\n if r.count(r[i]) == n-1:\r\n f = 1\r\n continue\r\n else:\r\n m=i\r\n \r\nif f != 1:\r\n for i in range(n):\r\n if l.count(l[i]) == n-1:\r\n flag = 1\r\n continue\r\n else:\r\n m=i\r\n \r\nif flag != 1 and f != 1:\r\n for i in range(n):\r\n if i + 1 < n:\r\n d.append(l[i+1]-l[i])\r\n for i in range(len(d)):\r\n if d.count(d[i]) < len(d)-2:\r\n m = i\r\nprint(m+1)", "def main():\n\n n = (int)(input())\n\n vec = list(map(int, input().split()))\n\n evenNumbers = 0\n oddNumbers = 0\n evenNumbersVecIndex = []\n oddNumbersVecIndex = []\n\n for i in range(0, n):\n\n if(vec[i] % 2 == 0):\n\n evenNumbersVecIndex.append(i + 1)\n evenNumbers += 1\n\n else:\n\n oddNumbersVecIndex.append(i + 1)\n oddNumbers += 1\n\n if(evenNumbers < oddNumbers):\n\n for i in range(evenNumbers):\n\n print(evenNumbersVecIndex[i], end = \" \")\n\n else:\n\n for i in range(oddNumbers):\n\n print(oddNumbersVecIndex[i], end = \" \")\n\nif __name__ == '__main__':\n main()\n\t\t \t \t \t \t\t \t\t\t\t\t\t\t\t \t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nev,od=0,0\r\nfor i in range(0,n):\r\n\tif a[i]%2==0:\r\n\t\tev+=1\r\n\t\tevind=i\r\n\telse:\r\n\t\tod+=1\r\n\t\todind=i\r\nif ev==1:\r\n\tprint(evind+1)\r\nelse:\r\n\tprint(odind+1)", "n=int(input())\r\nans,odd,even=0,0,0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(l[i]%2): \r\n odd+=1\r\n p=i\r\n else: \r\n even+=1\r\n q=i\r\nif(odd==1): print(p+1)\r\nelif(even==1): print(q+1)", "n = int(input())\nsp = list(map(lambda x: int(x), input().split()))\nsp1 = []\nfor i in sp:\n if i % 2:\n sp1.append('yes')\n else:\n sp1.append('no')\n\nif sp1.count('no') > sp1.count('yes'):\n print(sp1.index('yes') + 1)\nelse:\n print(sp1.index('no') + 1)", "n = input()\r\nnums = list(map(int,input().split()))\r\nevens = [i for i in nums if i % 2 == 0]\r\nodds = [i for i in nums if i % 2 != 0]\r\nif len(evens) > len(odds):\r\n print(nums.index(odds[0]) + 1)\r\nelse:\r\n print(nums.index(evens[0]) + 1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\neven=set()\r\nodd=set()\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even.add(i)\r\n else:\r\n odd.add(i)\r\nif len(even)==1:\r\n even=list(even)\r\n print(even[0]+1)\r\nelse:\r\n odd=list(odd)\r\n print(odd[0]+1)", "t = int(input())\r\nn = list(map(int,input(). split()))\r\nc = []\r\nd = []\r\n\r\nfor i in n:\r\n a = i%2\r\n if a == 0:\r\n c.append(i)\r\n else:\r\n d.append(i)\r\n \r\nif len(c) == 1:\r\n print((n.index(c[0]))+1)\r\nelif len(d) == 1:\r\n print((n.index(d[0]))+1)", "x=int(input())\r\nc=0\r\nc1,c2=0,0\r\nd=0\r\nl=list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n c=i+1\r\n c1=c1+1\r\n else:\r\n d=i+1\r\n c2=c2+1\r\nif c1==1:\r\n print(c)\r\nelse:\r\n print(d)", "n = int(input())\r\na = list(input().split())\r\ndem1 = dem2 = 0\r\ntemp = 0\r\nfor i in a:\r\n\tif int(i) % 2 == 0:\r\n\t\tdem1 += 1\r\n\telse:\r\n\t\tdem2 += 1\r\n\tif dem1 == 2:\r\n\t\ttemp = 'l'\r\n\t\tbreak\r\n\tif dem2 == 2:\r\n\t\ttemp = 'c'\r\n\t\tbreak\r\nfor i in range(n):\r\n\tif temp == 'l':\r\n\t\tif int(a[i]) % 2 != 0:\r\n\t\t\tprint(i+1)\r\n\telse:\r\n\t\tif int(a[i]) % 2 == 0:\r\n\t\t\tprint(i+1)\r\n\r\n\r\n\r\n\r\n\r\n", "N=int(input())\r\na=list(int(i)%2 for i in input().split())\r\nif a[0]==a[1] or a[0]==a[2]:\r\n print(a.index(a[0]^1)+1)\r\nelse:\r\n print(1)\r\n", "m=int(input())\r\nl=list(map(int,input().split()))\r\ne,o=0,0\r\ne1=[]\r\no1=[]\r\nfor i in l:\r\n if(i%2==0):\r\n e=e+1\r\n e1.append(i)\r\n else:\r\n o=o+1\r\n o1.append(i)\r\nif(e==1):\r\n print(l.index(*e1)+1)\r\nelse:\r\n print(l.index(*o1)+1)", "a = int(input())\r\narr = list(map(int, input().split()))\r\nk1 = 0\r\nk2 = 0\r\nfor i in range(len(arr)):\r\n if arr[i] % 2 == 0:\r\n k1 += 1\r\n else:\r\n k2 += 1\r\nif k1 >= k2:\r\n for i in range(len(arr)):\r\n if arr[i] % 2 == 1:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(arr)):\r\n if arr[i] % 2 == 0:\r\n print(i + 1)\r\n", "a=int(input())\r\nm=[]\r\nL= list(map(int, input().split()))\r\n \r\n \r\n # print(L)\r\nfor i in range(a):\r\n m.append(L[i]%2)\r\nx= m.count(0)\r\ny= m.count(1) \r\nif(x==1):\r\n print(m.index(0)+1)\r\n \r\n \r\n \r\nif(y==1):\r\n print(m.index(1)+1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nevn,odd = 0,0\r\narr1 = [el for el in arr if el%2==0]\r\narr2 = [el for el in arr if el%2!=0]\r\nif len(arr1)==1:\r\n res = arr.index(arr1[0])\r\nelse:\r\n res = arr.index(arr2[0])\r\nprint(res+1)\r\n ", "test_cases = int(input())\r\nlist1 = list(map(int, input().split()))\r\n\r\ncount_even = 0\r\ncount_odd = 0\r\n\r\nfor i in list1:\r\n if i % 2 == 0:\r\n count_even = count_even + 1\r\n else:\r\n count_odd = count_odd + 1\r\n\r\nif count_even > count_odd:\r\n for i in range(len(list1)):\r\n if list1[i] % 2 != 0:\r\n print(i+1)\r\n\r\nif count_even < count_odd:\r\n for i in range(len(list1)):\r\n if list1[i] % 2 == 0:\r\n print(i+1)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nodd = bool(a[0] % 2 == 0 and a[1] % 2 == 0\r\n or a[1] % 2 == 0 and a[2] % 2 == 0\r\n or a[0] % 2 == 0 and a[2] % 2 == 0)\r\nfor i in range(len(a)):\r\n if odd and a[i] % 2 == 1 or not odd and a[i] % 2 == 0:\r\n break\r\nprint(i + 1)", "n = int(input())\r\na = list(map(int,input().split())) \r\neven=0 \r\nodd=0 \r\nmaxie=-1 \r\nmaxio=-1\r\nfor i in range(n):\r\n if (a[i]%2==0):\r\n even+=1 \r\n maxie=max(maxie,i+1)\r\n else:\r\n odd+=1 \r\n maxio=max(maxio,i+1)\r\nif (even==1):\r\n print(maxie) \r\nelse:\r\n print(maxio)\r\n", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\nn = int(input())\r\na = list(map(int,input().split(\" \")))\r\nodd,even,b,c = 0,0,0,0\r\nfor i in range(n):\r\n if a[i]%2:\r\n odd += 1\r\n b = i+1\r\n else:\r\n even += 1\r\n c = i+1\r\n\r\nif odd == 1:\r\n print(b)\r\nelse:\r\n print(c)", "import sys\r\nimport math\r\ndef II():\r\n return int(sys.stdin.readline())\r\n \r\ndef LI():\r\n return list(map(int, sys.stdin.readline().split()))\r\n \r\ndef MI():\r\n return map(int, sys.stdin.readline().split())\r\n \r\ndef SI():\r\n return sys.stdin.readline().strip()\r\n\r\ndef gcd(x,y):\r\n while(y):\r\n x,y = y,x%y\r\n return x\r\n\r\ndef pow(n,exponent):\r\n\r\n if exponent == 0 or n == 1:\r\n return 1\r\n\r\n if exponent == 1 :\r\n return n\r\n if exponent == -1:\r\n return 1/n\r\n a = exponent // 2\r\n\r\n\r\n return pow(n,a) * pow(n,exponent - a) \r\n\r\nn = II()\r\nlst = LI()\r\na = -1\r\nb = -1\r\nc1=0\r\nc2 =0\r\nfor i in range(len(lst)):\r\n if lst[i]%2 == 0:\r\n if a==-1:\r\n a = i + 1\r\n \r\n c1 += 1\r\n if lst[i]%2 == 1:\r\n if b==-1:\r\n b = i + 1\r\n c2 += 1\r\n if (c2 >= 2 and c1 == 1) or (c1 >= 2 and c2 == 1):\r\n break\r\nprint(b if c1>c2 else a) \r\n\r\n\r\n ", "n=int(input())\r\nline=[int(j)for j in input().split()]\r\neven=[]\r\nodd=[]\r\nfor i in range(n):\r\n if line[i]%2 == 0:\r\n even+=[line[i]]\r\n else:\r\n odd+=[line[i]]\r\nif len(even)>len(odd):\r\n for i in range(n):\r\n if line[i]%2 != 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if line[i]%2 == 0:\r\n print(i+1)\r\n break\r\n", "def main():\r\n n = int(input())\r\n nums = list(map(int, input().split()))\r\n \r\n if nums[0] % 2 == nums[1] % 2 == 0:\r\n for i in range(n):\r\n if nums[i] % 2 == 1:\r\n print(i + 1)\r\n return\r\n elif nums[0] % 2 == nums[1] % 2 == 1:\r\n for i in range(n):\r\n if nums[i] % 2 == 0:\r\n print(i + 1)\r\n return\r\n else:\r\n if nums[2] % 2 == nums[0] % 2:\r\n print(2)\r\n return\r\n print(1)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\np = [int(x) for x in input().split()]\r\nq = []\r\nfor i in p:\r\n q.append(i%2)\r\nif q.count(1) > 1:\r\n print(q.index(0)+1)\r\nelse:\r\n print(q.index(1)+1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nd1 = []\r\nd2 = []\r\nfor i in range(n):\r\n if w[i] % 2 == 0:\r\n d1.append(i+1)\r\n else:\r\n d2.append(i+1)\r\n\r\nfor i in [d1, d2]:\r\n if len(i) == 1:\r\n print(i[0])\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nc=0\r\nc1=0\r\nfor i in range(len(lst)):\r\n if lst[i]%2==0:\r\n c+=1\r\n else:\r\n c1+=1\r\nif c==1:\r\n for i in range(len(lst)):\r\n if lst[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(lst)):\r\n if lst[i]%2!=0:\r\n print(i+1)\r\n break", "N = int(input())\r\nA = list(map(int, input().split()))\r\neven, odd = 0, 0\r\nfor a in A:\r\n\tif a % 2 == 0:\r\n\t\teven += 1\r\n\telse :\r\n\t\todd += 1\r\nassert even == 1 or odd == 1\r\nfor i in range(N):\r\n\tif even == 1 and A[i] % 2 == 0:\r\n\t\tprint(i + 1)\r\n\t\texit(0)\r\n\telif odd == 1 and A[i] % 2 == 1:\r\n\t\tprint(i + 1)\r\n\t\texit(0)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nodd=[];even=[]\r\nfor x in l:\r\n if x%2==0:even.append(x)\r\n else:odd.append(x)\r\nif len(odd)==1:print(l.index(odd[0])+1)\r\nelse:print(l.index(even[0])+1)", "n=int(input());p=0;l=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i%2==0:\r\n p+=1\r\n else:\r\n l+=1\r\nif p==1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for j in range(n):\r\n if a[j]%2==1:\r\n print(j+1)\r\n break\r\n", "n = int(input())\r\ninp = list(map(int,input().split()))\r\nj = 0\r\nl = 0\r\nk = 0\r\nfor i in inp :\r\n k +=1\r\n if i%2 == 0:\r\n j+=1\r\n x = k\r\n else :\r\n l += 1\r\n y = k\r\nif j < l :\r\n print(x)\r\nelse :\r\n print(y)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "_ = input()\ninp = list(map(int, input().split()))\neCount = 0\noCount = 0\nlastE = -1\nlastO = -1\nfor x in range(len(inp)):\n\tif inp[x]%2 == 0:\n\t\teCount += 1\n\t\tlastE = x+1\n\telse:\n\t\toCount += 1\n\t\tlastO = x+1\n\tif (eCount >= 2 or oCount >=2) and (lastO != -1 and lastE != -1):\n\t\tbreak\nprint(lastO if eCount>oCount else lastE)", "n = input()\r\na = [int(x) for x in input().split()]\r\nb = []\r\nfor x in a:\r\n b.append(x%2)\r\nif b[0] + b[1] + b[2] > 1:\r\n print(b.index(0)+1)\r\nelse:\r\n print(b.index(1)+1)\r\n", "n = int(input()) # 100 > n > 2\r\nnumbers =[int (i) for i in input().split()[:n]]\r\nparos = []\r\nparatlan = []\r\n#print(numbers)\r\nfor i in range (len(numbers)):\r\n if numbers[i] % 2 == 0 : paros.append(i)\r\n else: paratlan.append(i)\r\nif len(paros)< len(paratlan) :\r\n for i in paros:\r\n print(i+1)\r\nelse :\r\n for i in paratlan:\r\n print(i+1)\r\n\r\n", "a = int(input())\r\nn = [x%2 for x in map(int,input().split())]\r\nif sum(n) == 1:\r\n for i in range(a):\r\n if n[i] == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(a):\r\n if n[i] == 0:\r\n print(i+1)\r\n break\r\n", "n=input();\r\na=[x%2 for x in list(map(int,input().split()))];\r\nprint(a.index(sum(a)==1)+1);", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nc=sum(x & 1 for x in a)\r\nfor i,v in enumerate(a):\r\n if(c!=1 and ~v&1) or (c==1 and v&1):\r\n print(i+1)\r\n exit()", "n = int(input())\r\n\r\nfirst_odd, first_even = 100, 100\r\nodds, evens = 0, 0\r\n\r\nfor index, number in enumerate(input().split()):\r\n if int(number)%2 == 0:\r\n evens += 1\r\n first_even = min(first_even, index)\r\n else:\r\n odds += 1\r\n first_odd = min(first_odd, index)\r\n\r\nif evens < odds:\r\n print(first_even+1)\r\nelse:\r\n print(first_odd+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n l[i]=0\r\n else:\r\n l[i]=1\r\nec=l.count(0)\r\neo=l.count(1)\r\nif(ec==1):\r\n print(l.index(0)+1)\r\nelse:\r\n print(l.index(1)+1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ne=o=0\r\nfor i in a:\r\n\tif i%2==0:\r\n\t\te+=1\r\n\telse:\r\n\t\to+=1\r\n\r\nif e<o:\r\n\tfor i in range(n):\r\n\t\tif a[i]%2==0:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\nelif o<e:\r\n\tfor i in range(n):\r\n\t\tif a[i]%2==1:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak", "\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Inicializamos contadores para números pares e impares\r\ncount_even = 0\r\ncount_odd = 0\r\n\r\n# Inicializamos variables para almacenar los índices\r\nindex_even = 0\r\nindex_odd = 0\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n count_even += 1\r\n index_even = i + 1 # Guardamos el índice del número par\r\n else:\r\n count_odd += 1\r\n index_odd = i + 1 # Guardamos el índice del número impar\r\n\r\n# Verificamos cuál número difiere en paridad\r\nif count_even == 1:\r\n print(index_even)\r\nelse:\r\n print(index_odd)\r\n\r\n\r\n ", "n = int(input())\r\na = list(input().split())\r\nb = 0\r\nc = 0\r\nfor i in range(n):\r\n if int(a[i]) %2 == 0:\r\n b += i+2\r\n else:\r\n c += i+2\r\nd = min(b,c)\r\nprint(d-1)", "even = []\r\nodd = []\r\npre_n = int(input())\r\nn = list(map(int,input().split()))\r\nfor i in n:\r\n if i %2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\nif len(even) > len(odd):\r\n print(n.index(odd[0])+1)\r\nelse:\r\n print(n.index(even[0])+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=o=c=c1=0\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n k=i+1 \r\n c=c+1 \r\n else:\r\n o=i+1 \r\n c1=c1+1 \r\nif c>c1:\r\n print(o)\r\nelse:\r\n print(k)", "number = int(input())\r\ninputString = map(int,input().split(\" \"))\r\nnumpos = {\"evenNum\" : 0, \"oddNum\" : 0}\r\npos = 0\r\noddNum = 0\r\nevenNum = 0\r\nfor i in inputString:\r\n pos += 1\r\n if i % 2 == 0:\r\n numpos[\"even\"] = pos\r\n numpos[\"evenNum\"] = numpos.get(\"evenNum\") + 1\r\n else:\r\n numpos[\"odd\"] = pos\r\n numpos[\"oddNum\"] = numpos.get(\"oddNum\") + 1\r\n oddNum = numpos.get(\"oddNum\")\r\n evenNum = numpos.get(\"evenNum\")\r\n #print(numpos)\r\n if oddNum > 0 and evenNum > 0:\r\n if oddNum > evenNum:\r\n print(numpos.get(\"even\"))\r\n break\r\n elif oddNum < evenNum:\r\n print(numpos.get(\"odd\"))\r\n break", "input()\r\na = list(map(int, input().split()))\r\ne = o = 0\r\nle = lo = 0\r\nfor i, k in enumerate(a):\r\n if k % 2 == 0:\r\n e += 1\r\n le = i\r\n else:\r\n o += 1\r\n lo = i\r\nprint(le + 1 if e == 1 else lo + 1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=[i%2==0 for i in l]\r\nx=0\r\nif r.count(1)>r.count(0):\r\n x=0\r\nelse:\r\n x=1\r\nprint(r.index(x)+1)", "a=int(input())\r\np=a\r\nc1=list()\r\nc2=list()\r\nc=list(map(int,(input().split(' '))))\r\nfor x in c:\r\n if x%2==0:\r\n c1.append(x)\r\n else: c2.append(x)\r\nif len(c1)>len(c2):\r\n c2=str(c2)\r\n c2=(c2[1:-1:])\r\n c2=int(c2,10)\r\n print(c.index(c2)+1)\r\nelif len(c2)>len(c1):\r\n c1 = str(c1)\r\n c1 = (c1[1:-1:])\r\n c1 = int(c1, 10)\r\n print(c.index(c1)+1)", "n, l = int(input()), list(map(int,input().split()))\r\nif l[0]%2==l[1]%2:\r\n for i in range(2, n):\r\n if l[i]%2!=l[0]%2: print(i+1); break\r\nelse:\r\n if l[0]%2==l[2]%2: print(2)\r\n else: print(1)", "n=int(input())\r\nA=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n if A[i]%2==0:\r\n s=s+1\r\nif s==n-1:\r\n for i in range(n):\r\n if A[i]%2==0:\r\n pass\r\n else:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if A[i]%2==0:\r\n print(i+1)\r\n break\r\n else:\r\n pass\r\n \r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n if s[i]%2 == 0 and s[i+1]%2 == 0 or s[i]%2 == 0 and s[i+2]%2 == 0:\r\n cnt = 1\r\n break\r\n elif s[i]%2 == 1 and s[i+1]%2 == 1 or s[i]%2 == 1 and s[i+2]%2 == 1:\r\n cnt = 2\r\n break\r\nif cnt == 1:\r\n for k in range(n):\r\n if s[k]%2 == 1:\r\n print(k+1)\r\nelse:\r\n for k in range(n):\r\n if s[k]%2 == 0:\r\n print(k+1)", "n=int(input())\n\nentrada=input().split()\npar=0\nimpar=0\nfor i in entrada:\n if int(i)%2==0:\n par+=1\n else:\n impar+=1\nfor i in range(len(entrada)):\n if int(entrada[i])%2==0 and par<impar:\n print(i+1)\n break\n elif int(entrada[i])%2==1 and par>impar:\n print(i+1)\n break\n \n \t \t \t\t \t\t\t \t\t\t\t \t \t\t\t\t", "n = int(input())\r\nnList = [int(i) for i in input().split()]\r\nf1 = nList[0]%2\r\nf2 = nList[1]%2\r\nf3 = nList[2]%2\r\njudge = f1+f2+f3\r\nif judge==3:\r\n for i in range(3,n):\r\n if not nList[i]%2:\r\n print(i+1)\r\nelif judge==2:\r\n if not f1:\r\n print(1)\r\n elif not f2:\r\n print(2)\r\n else:\r\n print(3)\r\nelif judge==1:\r\n if f1:\r\n print(1)\r\n elif f2:\r\n print(2)\r\n else:\r\n print(3)\r\nelse:\r\n for i in range(3,n):\r\n if nList[i]%2:\r\n print(i+1)", "n = int(input())\n\nnumbers = list(map(int, input().split()))\n\nevens = list()\nodds = list()\n\n\ndef fill_evens():\n for k in numbers:\n if k % 2 == 0:\n evens.append(k)\n else:\n odds.append(k)\nfill_evens()\ndistinct = evens[0] if len(evens) == 1 else odds[0]\nprint(numbers.index(distinct) + 1)\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nce=0\r\nco=0\r\nle=0\r\nlo=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n co+=1\r\n lo=i+1\r\n else:\r\n ce+=1\r\n le=i+1\r\nif(co==1):\r\n print(int(lo))\r\nelse:\r\n print(int(le))", "n = int(input())\na = list(map(int, input().split()))\nplus, minus = [], []\nfor i, x in enumerate(a):\n if x % 2 == 0:\n plus.append(i + 1)\n else:\n minus.append(i + 1)\n if len(plus) > 0 and len(minus) > 0 and len(minus) + len(plus) > 2:\n if len(plus) > 1:\n print(minus[0])\n else:\n print(plus[0])\n break", "#!/usr/bin/env python\n\n# Heders\nimport os\n\n# Input\nn = int(input())\nk = [int(x) for x in input().split()]\ne,o =[],[]\neven,odd = 0,0\n# Finding the odd one in list\nfor i in k:\n\tif i%2 == 0:\n\t\te.append(str(k.index(i)))\n\telif i%2 == 1:\n\t\to.append(str(k.index(i)))\n\n\nif len(o) <= 1:\n\tval = int(''.join(o))+1\n\tprint(val)\nelif len(e) <= 1:\n\tval = int(''.join(e))+1\n\tprint(val)\n\n\n\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\no=0\r\nz=0\r\nfor i in range(0,n,1) :\r\n if l[i]%2==0 :\r\n e=e+1\r\n else :\r\n o=o+1\r\nif e==1 :\r\n for i in range(0,n,1) :\r\n if l[i]%2==0 :\r\n print(i+1)\r\nelse :\r\n for i in range(0,n,1) :\r\n if l[i]%2!=0 :\r\n print(i+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nec=0\r\noc=0\r\nfor i in l:\r\n if(i%2==0):\r\n ec+=1\r\n else:\r\n oc+=1\r\nif(ec>1):\r\n for i in range(n):\r\n if(l[i]%2!=0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if(l[i]%2==0):\r\n print(i+1)\r\n break\r\n \r\n ", "n = int(input())\r\narr = list(map(int,input().split(' ')))\r\neven = 0\r\neven_first = -1\r\nodd = 0\r\nodd_first = -1\r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n if even == 0:\r\n even_first = i\r\n even += 1\r\n \r\n else:\r\n if odd == 0:\r\n odd_first = i\r\n odd += 1\r\n\r\nif even > odd:\r\n print(odd_first + 1)\r\nelse:\r\n print(even_first + 1)", "n = int(input())\r\nx = input()\r\narray = x.split(\" \")\r\ncounteven = 0\r\ncountodd = 0\r\nfor i in range(n):\r\n if (int(array[i]) % 2 == 0):\r\n counteven += 1\r\n even = i\r\n else:\r\n countodd += 1\r\n odd = i\r\nif (counteven == 1 ):\r\n print(even+1)\r\nif (countodd == 1):\r\n print(odd+1)", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nt=[]\r\nfor i in s:\r\n if i%2==0:\r\n t.append(1)\r\n else:\r\n t.append(0)\r\nif t.count(1)==1:\r\n print(t.index(1)+1)\r\nelse:\r\n print(t.index(0)+1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\neven = sum(i%2 for i in a)\r\nif even ==1:\r\n for i in range(n):\r\n if a[i]%2 ==1:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if a[i]%2 ==0:\r\n print(i+1)", "n = int(input())\r\narr = list(map(int, input().rstrip().split()))\r\neven = []\r\nodd = []\r\nfor i in range(n):\r\n if arr[i]%2==0:\r\n even.append(arr[i])\r\n else:\r\n odd.append(arr[i])\r\nif len(even)>len(odd):\r\n print(arr.index(odd[0])+1)\r\nelse:\r\n print(arr.index(even[0])+1)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\na=0\r\nc0=0\r\nce=0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n ce+=1\r\n ie=i\r\n else:\r\n c0+=1\r\n i0=i\r\n if(i>=2):\r\n if(ce>1 and c0==1):\r\n a=i0+1\r\n elif(ce==1 and c0>1):\r\n a=ie+1\r\n \r\nprint(a) \r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nchet = 0\r\nnechet = 0\r\nanswer = 0\r\nif arr[0] % 2 == 0:\r\n chet += 1\r\nelse:\r\n nechet += 1\r\nif arr[1] % 2 == 0:\r\n chet += 1\r\nelse:\r\n nechet += 1\r\nif arr[2] % 2 == 0:\r\n chet += 1\r\nelse:\r\n nechet += 1\r\nif chet > nechet:\r\n for i in range(n):\r\n if arr[i] % 2 != 0:\r\n answer = arr.index(arr[i]) + 1\r\nelse:\r\n for i in range(n):\r\n if arr[i] % 2 == 0:\r\n answer = arr.index(arr[i]) + 1\r\nprint(answer)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na=a[::-1]\r\ns=0\r\nc=0\r\nfor i in range(0,len(a)):\r\n if(a[i]%2==0):\r\n s=s+1\r\n else:\r\n c=c+1\r\n# print(s,c) \r\nif(c==1):\r\n for i in range(0,len(a)):\r\n if(a[i]%2!=0):\r\n d=i+1\r\n break\r\n\r\n print((n-d)+1) \r\nelse:\r\n for i in range(0,len(a)):\r\n if(a[i]%2==0):\r\n d=i+1\r\n break\r\n\r\n print((n-d)+1) \r\n ", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\nji=0\r\nou=0\r\nfor num in li:\r\n if num%2==0:\r\n ou+=1\r\n else:\r\n ji+=1\r\nfor num in li:\r\n if ji==1:\r\n if num%2==1:\r\n print(li.index(num)+1)\r\n else:\r\n if num%2==0:\r\n print(li.index(num)+1)", "n = int(input())\nnum = [int(x) for x in input().split(\" \")]\neven = 0\nodd = 0\nfor i in num:\n if i%2 == 0:\n even += 1\n else:\n odd += 1\nif even>odd:\n for j in range(len(num)):\n if num[j]%2 != 0:\n print(j+1)\nelse:\n for j in range(len(num)):\n if num[j]%2 == 0:\n print(j+1)\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\ne = 0\r\nd = 0\r\nfor i in s:\r\n if i % 2 == 0:\r\n e += 1\r\n else:\r\n d += 1\r\nif e > d:\r\n for i in range(n):\r\n if s[i] % 2 == 1:\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if s[i] % 2 == 0:\r\n print(i + 1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=l[:]\r\ndef myFunc(e):\r\n return e%2\r\nl.sort(key=myFunc)\r\nif (l[1]%2!=0):\r\n print(s.index(l[0])+1)\r\nelse:\r\n print(s.index(l[-1])+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 21 11:04:13 2020\r\n\r\n@author: Cui Shiao\r\n\"\"\"\r\n\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\na=b=c=d=0\r\nfor x in range(n):\r\n if s[x]%2:\r\n a+=1;c=x\r\n else:\r\n b+=1;d=x\r\nif a>b:\r\n print(d+1)\r\nelse:\r\n print(c+1)", "n = int(input())\r\nlis = [int(_) for _ in input().split()]\r\n \r\ndic = {0:[], 1:[]}\r\nfor i,x in enumerate(lis):\r\n dic[x&1].append(i+1)\r\n \r\nif len(dic[0]) == 1:\r\n print(dic[0][0])\r\nelse:\r\n print(dic[1][0])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nle=[i for i in l if i%2==0]\r\nlo=[i for i in l if i not in le]\r\nif len(le)==1:\r\n print(l.index(le[0])+1)\r\nelse:\r\n print(l.index(lo[0])+1)", "n = int(input())\r\na = input().split()\r\na = [int(i) for i in a]\r\nf = 0\r\nl = 0\r\nfor i in a:\r\n if i % 2 == 0:\r\n f += 1\r\n else:\r\n l += 1\r\nif f > l:\r\n for i in range(len(a)):\r\n if a[i] % 2 != 0:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n print(i + 1)", "n=int(input())\r\nline=[int(i) for i in input().split()]\r\nd=0\r\ns=0\r\nfor i in range(n):\r\n\tif line[i]%2==0:\r\n\t\ts+=1\r\n\telse:\r\n\t\td+=1\r\nif s>d:\r\n\ta=1\r\nif d>s:\r\n\ta=0\r\n\r\nfor i in range(n):\r\n\tif line[i]%2==a:\r\n\t\tx=i\r\nprint(x+1)\r\n\t", "input()\r\na = list(map(int, input().split()))\r\nj = list()\r\nt = list()\r\nfor i in a:\r\n if i % 2 == 0:\r\n j.append(i)\r\n else:\r\n t.append(i)\r\nif len(j) == 1:\r\n print(a.index(j[0]) + 1)\r\nelif len(t) == 1:\r\n print(a.index(t[0]) + 1)", "n = int(input())\r\nnum = list(int(i) for i in input().split())\r\n\r\nif num[0]%2 != num[1]%2 :\r\n if num[2]%2 == num[0]%2:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n for i in range(2,len(num)):\r\n if num[i]%2 != num[0]%2:\r\n print(i+1)", "n = int(input())\r\ns = input()\r\na = s.split()\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\r\nsume = 0\r\nsumo = 0\r\ni = 0\r\nwhile i < len(a):\r\n\tif a[i] % 2 == 0:\r\n\t\tsume += 1\r\n\t\tie = i+1\r\n\telse:\r\n\t\tsumo += 1\r\n\t\tio = i+1\r\n\tif (sume == 1 and sumo > 1) or (sume > 1 and sumo == 1):\r\n\t\tbreak\r\n\ti += 1\r\n\r\nif sume == 1:\r\n\tprint(ie)\r\nelse:\r\n\tprint(io)", "n=int(input())\r\nli=list(map(int,input().split()))\r\nc=d=0\r\nfor i in li[:3]:\r\n if i%2!=0:c+=1\r\n else:d+=1\r\nif c>d:\r\n for i in range(n):\r\n if li[i]%2==0: print(i+1)\r\nelse:\r\n for i in range(n):\r\n if li[i]%2!=0: print(i+1)", "n = int(input())\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\nres = []\r\nfor x in l:\r\n d = x % 2\r\n res.append(d)\r\n\r\nun = 0\r\neve = 0\r\n\r\nfor h in res:\r\n if h == 1:\r\n un += 1\r\n else:\r\n eve += 1\r\n\r\nif un > eve:\r\n print(res.index(0) + 1)\r\nelse:\r\n print(res.index(1) + 1)", "t = int(input())\nl = input().split()\nm=list(map(int,l))\nn=[i%2 for i in m] #list comprehension\np=list(map(str,n))\n\ns=\"\".join(p)\n\ni=0\nx=0\nwhile i<t:\n if s[i]==\"1\":\n x+=1\n i+=1\n\nif x>1:\n u=s.find(\"0\")+1\nelse: \n u=s.find(\"1\")+1\n\nprint(u)\n\n\n", "x = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nodds = []\r\nevens = []\r\nfor i in range(x):\r\n if nums[i] % 2 == 0:\r\n evens.append(nums[i])\r\n else:\r\n odds.append(nums[i])\r\n\r\nif len(evens) == 1:\r\n print(nums.index(evens[0]) + 1)\r\nelse:\r\n print(nums.index(odds[0]) + 1)", "n=int(input())\r\na=input().split()\r\n\r\nlisting=[]\r\nfor i in range(n) :\r\n chu=int(a[i])%2\r\n listing.append(chu)\r\nlist1=sorted(listing)\r\np1=list1.count(list1[0])\r\np2=list1.count(list1[-1])\r\nif p1<p2 :\r\n print(listing.index(list1[0])+1)\r\nelse :\r\n print(listing.index(list1[-1])+1)\r\n", "input()\nnums = [True if n % 2 else False for n in map(int, input().split())]\nif nums.count(True) == 1:\n print(nums.index(True)+1)\nelse:\n print(nums.index(False)+1)\n", "a = int(input())\r\nlis = input().split()\r\neven = 0\r\nevenpls = 0\r\nevennum = 0\r\nodd = 0\r\noddnum = 0\r\noddpls = 0\r\nrunner = 0\r\nfor val in lis:\r\n val = int(val)\r\n runner = runner + 1\r\n if val % 2 == 0:\r\n odd = odd + 1\r\n oddpls = runner\r\n oddnum = oddnum + 1\r\n else:\r\n even = even + 1\r\n evenpls = runner\r\n evennum = evennum + 1\r\nif oddnum > evennum:\r\n print(evenpls)\r\nelse:\r\n print(oddpls)", "m = int(input())\r\nt = [int(x) for x in input().split()]\r\nodd=0\r\neven =0\r\nfor i in t:\r\n if i%2 == 0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even == 1:\r\n print(list(t.index(x)+1 for x in t if x%2==0)[0])\r\nelse:\r\n print(list(t.index(x)+1 for x in t if x%2!=0)[0])\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nif l[0] % 2 == 0 and l[1] % 2 == 0 and l[2] % 2 == 0 :\r\n for i in range (3,n):\r\n if l[i] % 2 != 0 :\r\n print(i+1)\r\n break\r\n\r\nelif l[0] % 2 == 1 and l[1] % 2 == 1 and l[2] % 2 == 1 :\r\n for i in range (3,n):\r\n if l[i] % 2 == 0 :\r\n print(i+1)\r\n break\r\n\r\nelse :\r\n if (l[0] + l[1] + l[2]) % 2 == 0 :\r\n for i in range(3) :\r\n if l[i] % 2 == 0 :\r\n print(i+1)\r\n else :\r\n for i in range(3) :\r\n if l[i] % 2 != 0 :\r\n print(i+1)", "num = int(input())\r\nx = list(map(int,input().strip().split()))[:num]\r\narry =[0]*101\r\nfor i in range(num):\r\n if x[i] % 2 == 0:\r\n arry[i] = \"a\"\r\n elif x[i] % 2 == 1 :\r\n arry[i] = \"b\"\r\nif arry.count(\"b\")>1:\r\n print(arry.index(\"a\")+1)\r\nelse:\r\n print(arry.index(\"b\")+1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ne=0\r\no=0\r\nc=0\r\nif(a[0]%2==0):\r\n e=1\r\nelse:\r\n o=1\r\nif(a[1]%2==0):\r\n if(e==0):\r\n if(a[2]%2==0):\r\n print(1)\r\n else:\r\n print(2)\r\n if(e==1):\r\n c=1\r\nelse:\r\n if(o==0):\r\n if(a[2]%2!=0):\r\n print(1)\r\n else:\r\n print(2)\r\n else:\r\n c=2\r\nif(c==1):\r\n for i in range(2,n):\r\n if(a[i]%2!=0):\r\n print(i+1)\r\n break\r\nelif(c==2):\r\n for i in range(2,n):\r\n if(a[i]%2==0):\r\n print(i+1)\r\n break", "from sys import stdin\r\nn = int(stdin.readline())\r\ndata = list(map(int,stdin.readline().rstrip().split()))\r\neven_one = data[0] % 2\r\nfor i in range(1,n):\r\n if data[i] % 2 != even_one and i > 1:\r\n print(i+1)\r\n elif data[i] % 2 != even_one and i == 1:\r\n print(i+1 if data[i+1]%2 == even_one else 1)\r\n break", "size = int(input())\n\narr = list(map(int, input().split(\" \")))\n\nevens = [i for i in arr if i % 2 == 0]\nodds = [i for i in arr if i % 2 != 0]\n\nif len(odds) == 1 :\n print(arr.index(odds[0]) + 1)\nelse :\n print(arr.index(evens[0]) + 1)\n\n", "n=int(input())\r\nd=list(map(int,input().split()))\r\nfor i in range(len(d)):\r\n d[i]=d[i]%2\r\nprint(d.index(int(d.count(1)==1))+1)", "if __name__ == '__main__':\n input()\n numbers = [int(x) for x in input().split(' ')]\n even = 0\n odd = 0\n for n in numbers:\n if n % 2 == 0:\n even += 1\n else:\n odd += 1\n if even > odd:\n # find the index of the odd number\n for i, n in enumerate(numbers):\n if n % 2 == 1:\n print(i + 1)\n break\n else:\n # find the index of the even number\n for i, n in enumerate(numbers):\n if n % 2 == 0:\n print(i + 1)\n break\n", "n = int(input())\r\nnum = list(map(int,input().split()))\r\nfor i in range(len(num)) :\r\n if num[i]%2 == 0 :\r\n num[i] = 0\r\n else :\r\n num[i] = 1\r\nif num.count(1) == 1:\r\n print(num.index(1) + 1)\r\nif num.count(0) == 1:\r\n print(num.index(0) + 1) \r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled74.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1TMF3empw9H5Gg2AyJyAuduDgxMfS09yH\n\"\"\"\n\nn=int(input())\nl1=list(map(int,input().split()))\nc1=0\nc2=0\nfor x in range(0,3):\n if l1[x]%2==0:\n c1=c1+1\n else:\n c2=c2+1\nif c1>c2:\n for x in range(0,len(l1)):\n if l1[x]%2!=0:\n print(x+1)\n break\nelse:\n for x in range(0,len(l1)):\n if l1[x]%2==0:\n print(x+1)\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\neven = 0\r\nlastE = -1\r\nodd = 0\r\nlastO = -1\r\nfor i in range(n):\r\n if a[i] % 2:\r\n odd += 1\r\n lastO = i\r\n else:\r\n even += 1\r\n lastE = i\r\nif odd == 1:\r\n print(lastO + 1)\r\nelse:\r\n print(lastE + 1)", "n=int(input())\r\ninp=input().split()\r\nfor i in range(n):inp[i]=int(inp[i])\r\nif inp[0]%2+inp[1]%2+inp[2]%2>=2:\r\n for i in range(n):\r\n if inp[i]%2==0:print (i+1)\r\nelse:\r\n for i in range(n):\r\n if inp[i]%2==1:print (i+1)\r\n", "s = int(input())\r\ng = list(map(int,input().split()))\r\nlist1=[i for i in g if i%2==0]\r\nlist2=[i for i in g if i%2==1]\r\nif len(list1) > len(list2) :\r\n print(g.index(list2[0])+1)\r\nelse :\r\n print(g.index(list1[0])+1)\r\n\r\n", "N=int(input())\r\nn=[int(i) for i in input().split()]\r\na=[]\r\nb=[]\r\nfor i in range(N):\r\n if n[i]%2==0:\r\n a.append(str(i+1))\r\n else:\r\n b.append(str(i+1))\r\nif len(a)==1:\r\n print(''.join(a))\r\nelse:\r\n print(''.join(b))\r\n", "int(input())\r\nb = list(map(int, input().split()))\r\nkch = 0\r\nknch = 0\r\nfor i in b[0], b[1], b[2]:\r\n\tif i % 2 == 0:\r\n\t\tkch += 1\r\n\telse:\r\n\t\tknch += 1\r\nif knch > kch:\r\n\tfor i in range(len(b)):\r\n\t\tif b[i] % 2 == 0:\r\n\t\t\tprint(i + 1)\r\n\t\t\texit(0)\r\nelse:\r\n\tfor i in range(len(b)):\r\n\t\tif b[i] % 2 != 0:\r\n\t\t\tprint(i + 1)\r\n\t\t\texit(0)\r\n", "n = int(input())\r\ne=o=0\r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n if(a[i]%2 == 0):\r\n e+=1\r\n if(e>1):\r\n break;\r\n else:\r\n o+=1\r\nif(e>o):\r\n for i in range(len(a)):\r\n if(a[i]%2 == 1):\r\n print(i+1)\r\nelse:\r\n for i in range(len(a)):\r\n if(a[i]%2 == 0):\r\n print(i+1)", "x=input()\r\ny=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor i in y:\r\n if i%2==0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)<len(b):\r\n print(y.index(a[0])+1)\r\nelse:\r\n print(y.index(b[0])+1)", "a,b=int(input()),list(map(int,input().split()))\nfor i in range(len(b)):\n\tb[i]=b[i]%2\nif(b.count(1)==1):\n\tprint(b.index(1)+1)\nelse:\n print(b.index(0)+1)", "n = int(input())\r\nsp = list(map(int, input().split()))\r\nif (sp[0] % 2 + sp[1] % 2 + sp[2] % 2) <= 1:\r\n ind = 0\r\nelse:\r\n ind = -1\r\nnorm = sorted(sp, key=lambda x: x % 2 == 0)\r\nprint(sp.index(norm[ind]) + 1)", "import sys\r\n\r\nt = 1; #t = int(sys.stdin.readline())\r\n\r\ndef solve() -> None:\r\n n = int(sys.stdin.readline())\r\n arr = [int(x)for x in sys.stdin.readline().split()]\r\n even,odd = [],[]\r\n for i in range(1,n+1):even.append((arr[i-1],i)) if ~arr[i-1]&1 else odd.append((arr[i-1],i))\r\n del arr\r\n print(even[0][1])if len(even)==1 else print(odd[0][1])\r\n\r\nfor _ in [0] * t : solve()", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nlista = []\r\nlista1 = []\r\n\r\nfor x in range(len(a)):\r\n if a[x] % 2 == 0:\r\n lista.append(x+1)\r\n else:\r\n lista1.append(x+1)\r\nif len(lista) == 1:\r\n print(lista[0])\r\nif len(lista1) == 1:\r\n print(lista1[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\no=[]\r\ne=[]\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n o.append(i)\r\n else:\r\n e.append(i)\r\nprint(e[0]+1) if(len(e)==1) else print(o[0]+1)", "n = int(input())\r\n\r\nlists = list(map(int, input().rstrip().split()))\r\n\r\nfor i in range(len(lists)):\r\n for j in range(len(lists)):\r\n if i != j:\r\n if abs(lists[i]-lists[j])%2 == 1:\r\n c = 0\r\n else:\r\n c = 1\r\n break\r\n \r\n if c == 0:\r\n index = i + 1\r\n\r\nprint(index)", "n = int(input())\r\na = list(map(int,input().split()))\r\na = list(map(lambda x : x % 2, a)) \r\nev = a.count(0)\r\nod = a.count(1)\r\nif ev > od:\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)", "a = int(input())\r\nb = list(map(int , input().split()))\r\nodd = b[0] % 2\r\neven = b[1] % 2\r\nif odd == even:\r\n for i in range(2 , a):\r\n if b[i] % 2 != odd:\r\n print(i + 1)\r\n break\r\nelif odd != even:\r\n if b[2] % 2 != odd:\r\n print(\"1\")\r\n else:\r\n print(\"2\")", "from sys import stdin, stdout\r\n\r\n\r\ndef read_list(): # read list of variables\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef read_list_str(): # read list of variables\r\n return [x for x in stdin.readline().split()]\r\n\r\n\r\ndef readmv(): # read_multiple_variable\r\n return map(int, stdin.readline().split())\r\n\r\n\r\ndef readv(): # read variable\r\n return int(stdin.readline())\r\n\r\n\r\ndef printSol(test_case, x):\r\n ans_to_print = ''\r\n if type(x) == list:\r\n for el in x:\r\n ans_to_print += f'{el} '\r\n\r\n if type(x) == int or type(x) == float:\r\n ans_to_print = str(x)\r\n\r\n stdout.write(f'Case #{test_case + 1}: ' + ans_to_print + f'\\n')\r\n\r\ndef read():\r\n return stdin.readline().strip()\r\n\r\n\r\ndef solve(n, a, b):\r\n allows_values = [0] * n\r\n prev = 0\r\n for i in range(n):\r\n allows_values[i] = (1 << a[i] + 1) | prev\r\n prev = allows_values[i]\r\n\r\n if a[0] != b[0]:\r\n stdout.write('NO\\n')\r\n return\r\n for i in range(n - 1, 0, -1):\r\n diff = b[i] - a[i]\r\n if diff < 0 and not allows_values[i - 1] & (1 << 0):\r\n stdout.write('NO\\n')\r\n return\r\n\r\n elif diff > 0 and not allows_values[i - 1] & (1 << 2):\r\n stdout.write('NO\\n')\r\n return\r\n\r\n stdout.write('YES\\n')\r\n return\r\n# 1 + 2 + 4 = 7\r\n\r\n\r\ndef main():\r\n n = readv()\r\n a = read_list()\r\n a = [(a[i], i) for i in range(n)]\r\n even = [el[1] for el in a if el[0] % 2 == 0]\r\n odd = [el[1] for el in a if el[0] % 2 == 1]\r\n if len(even) == 1:\r\n stdout.write(f'{even[0]+1}')\r\n else:\r\n stdout.write(f'{odd[0]+1}')\r\n\r\nmain()\r\n\r\n", "c=int(input())\r\nlinp=input().split()\r\nl=[]\r\nfor n in range(c):\r\n l.append(int(linp[n])%2)\r\n s=[str(x) for x in l]\r\nif sum(l)>1:\r\n print(int(''.join(s).find('0'))+1)\r\nelse:\r\n print(int(''.join(s).find('1'))+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\ne=o=0\r\nfor i in range(0,n):\r\n if(a[i]%2==0):\r\n b.append(a[i])\r\n e+=1\r\n else:\r\n c.append(a[i])\r\n o+=1\r\nif(o==1):\r\n print(a.index(c[0])+1)\r\nelse:\r\n print(a.index(b[0])+1)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\neven=0\r\nnot_even=0\r\nlast_even=-1\r\nlast_not_even=-1\r\nindex=0\r\nfor i in range(0,len(arr)):\r\n if arr[i]%2==0:\r\n even+=1\r\n last_even=i+1\r\n else:\r\n not_even+=1\r\n last_not_even=i+1\r\n if even>1 and last_not_even!=-1:\r\n index=last_not_even\r\n break\r\n elif not_even>1 and last_even!=-1:\r\n index=last_even\r\n break\r\nprint(index)\r\n", "n=int(input())\r\nc1,c2,k,k1=0,0,0,0\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n c1=a[i]\r\n k+=1\r\n else:\r\n c2=a[i]\r\n k1+=1\r\nif k==1:\r\n print(a.index(c1)+1)\r\nelse:\r\n print(a.index(c2)+1)\r\n", "input()\r\na = list(map(lambda n: int(n) % 2, input().split()))\r\nprint(a.index(a.count(1) == 1) + 1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nch = []\r\nnch = []\r\nfor i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n ch.append(i)\r\n else:\r\n nch.append(i)\r\nif len(ch) > len(nch):\r\n print(nch[0] + 1)\r\nelse:\r\n print(ch[0] + 1)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nevens = [i for i in nums if i % 2 == 0]\r\nodds = [i for i in nums if i % 2 == 1]\r\nprint(nums.index(evens[0] if len(evens) == 1 else odds[0]) + 1)\r\n", "num = int(input())\nnumbers = [int(num) for num in input().split(\" \")]\nevens = 0\nodds = 0\neven_index = 0\nodd_index = 0\nfor number in numbers:\n if number % 2:\n odds += 1\n odd_index = numbers.index(number) + 1\n else:\n evens += 1\n even_index = numbers.index(number) + 1\n\nif evens == 1:\n print(even_index)\nelse:\n print(odd_index)", "'''input\n4\n1 2 1 1\n\n\n'''\n\nn = int(input())\nnl = list(map(int, input().split()))\n\nodd = []\neven = []\n\nfor it in nl:\n\tif it%2 == 0:\n\t\teven.append(it)\n\telse:\n\t\todd.append(it)\n\nif len(odd) == 1:\n\tprint(nl.index(odd[0])+1)\nelif len(even) == 1:\n\tprint(nl.index(even[0])+1)", "n = int(input())\r\nlist1 = list(map(int, input().split()))\r\ncountOdd = countEven = even = odd = 0\r\nfor i in range(len(list1)):\r\n if list1[i] % 2 == 0:\r\n countEven += 1\r\n even = list1[i]\r\n else:\r\n countOdd += 1\r\n odd = list1[i]\r\nif countOdd == 1:\r\n print(list1.index(odd) + 1)\r\nelse:\r\n print(list1.index(even) + 1)\r\n", "#Nearly Lucky\r\n'''\r\na=list(map(str,input()))\r\nl=0\r\nfor i in range(len(a)):\r\n if(a[i]=='4' or a[i]=='7'):\r\n l+=1\r\nif(l==4 or l==7 or l==44 or l==47 or l==74 or l==77):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")'''\r\na=int(input())\r\nb=list(map(int,input().strip().split()))\r\ne,o=[],[]\r\nfor i in range(len(b)):\r\n if b[i]%2==0:\r\n e.append(b[i])\r\n else:\r\n o.append(b[i])\r\nif len(e)==1:\r\n print(b.index(e[0])+1)\r\nelse:\r\n print(b.index(o[0])+1)", "\r\na = input()\r\narr = [int(i) for i in input().split()]\r\noddList = []\r\nfor i in range(len(arr)):\r\n if arr[i]%2 == 1:\r\n oddList.append(i)\r\n else:\r\n even = i\r\nif len(oddList) != 1:\r\n print(even+1)\r\nelse:\r\n print(oddList[0]+1)\r\n \r\n", "n = int(input())\r\nt = list(map(int,input().split()))\r\ni = 0\r\nwhile i < n-1:\r\n if t[i] % 2 != t[i+1] % 2:\r\n if i<n-2 and t[i+1]%2 == t[i+2]%2:\r\n print(i+1)\r\n exit()\r\n else:\r\n print(i+2)\r\n exit()\r\n\r\n i += 1", "n = int(input())\na = list(map(int,input().split()))\nif a[0]%2 + a[1]%2 + a[2]%2 >= 2:\n for i in range(n):\n if not a[i]%2:\n print(i+1)\nelse:\n for i in range(n):\n if a[i]%2:\n print(i+1)", "x=int(input())\r\ns=list(map(int,input().split()))\r\np=\"\"\r\nq=\"\"\r\nfor n in range(x):\r\n if s[n]%2==0:\r\n p=p+str(n+1)\r\n else:\r\n q=q+str(n+1)\r\nif len(p)>len(q):\r\n print(q)\r\nelse:\r\n print(p) ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nevenness = 0\r\nsing = 0\r\ne = None\r\ns = None\r\nex = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n e = i+1\r\n evenness += 1\r\n if a[i] % 2 != 0:\r\n s = i+1\r\n sing += 1\r\n if evenness > 1 and ex != 1:\r\n if not s is None:\r\n print(s)\r\n ex = 1\r\n else:\r\n if a[i]%2 != 0:\r\n print(i+1)\r\n ex = 1\r\n elif sing > 1 and ex != 1:\r\n if not e is None:\r\n print(e)\r\n ex = 1\r\n else:\r\n if a[i]%2 == 0:\r\n print(i+1)\r\n ex = 1\r\n\r\n", "evens=[]\r\nodds=[]\r\nn=int(input())\r\nli=list(map(int,input().split(\" \")))\r\n\r\nfor x in li:\r\n if x%2==0:\r\n evens.append(x)\r\n else:\r\n odds.append(x)\r\n\r\nif len(evens)==1:\r\n print(li.index(evens[0])+1)\r\n\r\nelse:\r\n print(li.index(odds[0])+1)\r\n\r\n", "n = int(input())\ns = input().split()\neven_counter=0\ntemp, temp2 = 0, 0\nfor i in range(n):\n if int(s[i])%2 == 0:\n even_counter+=1\n temp = i+1\n else:\n temp2 = i+1\nif even_counter>len(s)//2:\n print(temp2)\nelse:\n print(temp)\n \t\t \t\t\t \t \t\t\t \t\t\t\t \t \t", "##nums = map(int, input().split())\r\n##s1 = list(map(int, input().split()))\r\n##s1 = list(map(int, ' '.join(input()).split()))\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nch = Nch = nch = Nnch = 0\r\nfor i in range(len(s)):\r\n if s[i]%2 == 0:\r\n ch +=1\r\n Nch = i + 1\r\n else:\r\n nch += 1\r\n Nnch = i + 1\r\n\r\nif ch < nch:\r\n print(Nch)\r\nelse:\r\n print(Nnch)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nevenCount = sum(1 for x in lst[0:3] if x % 2 == 0)\r\nresiduToFind = 1 if evenCount >= 2 else 0\r\nprint(1 + next(n for n, x in enumerate(lst) if x % 2 == residuToFind))", "def howManyDiffers(n, nums):\r\n differs = [i for i in nums if i % 2 == 0]\r\n evenness = [i for i in nums if i % 2 != 0]\r\n if len(evenness) == 1:\r\n return nums.index(evenness[0]) + 1\r\n return nums.index(differs[0]) + 1\r\n \r\nn = int(input())\r\nnums = [int(i) for i in input().split()]\r\nprint(howManyDiffers(n, nums))", "n = int(input())\r\nli = list(input().split())\r\nle=[]\r\nlo=[]\r\nfor i in li:\r\n if(int(i)%2 == 0):\r\n le.append(i)\r\n else:\r\n lo.append(i)\r\nif(len(le) == 1):\r\n for i in range(len(li)):\r\n if(le[0] == li[i]):\r\n print(i+1)\r\nelif(len(lo) == 1):\r\n for i in range(len(li)):\r\n if(lo[0] == li[i]):\r\n print(i+1)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nco=0\r\nce=0\r\ncol=[]\r\ncel=[]\r\nfor i in l:\r\n if(i%2==0):\r\n ce+=1\r\n cel.append(i)\r\n else:\r\n co+=1\r\n col.append(i)\r\nif(ce==1):\r\n print(l.index(cel[0])+1)\r\nelse:\r\n print(l.index(col[0])+1)", "n=int(input())\r\ninp=input().split()\r\nl=[]\r\nfor i in range(len(inp)):\r\n l.append(int(inp[i]))\r\n\r\nl1=[]\r\nl2=[]\r\n\r\nfor i in range(len(l)):\r\n if(l[i]%2==0):\r\n l2.append((l[i],i+1))\r\n else:\r\n l1.append((l[i],i+1))\r\n \r\nif(len(l2)==1):\r\n print(l2[0][1])\r\nelse:\r\n print(l1[0][1])", "total = int(input())\r\nnumber_list = input().split()\r\n\r\nodd = 0\r\nodd_list =[]\r\neven = 0\r\neven_list = []\r\n\r\nfor i in range(total):\r\n if int(number_list[i]) % 2 == 0:\r\n even += 1\r\n even_list.append(number_list[i])\r\n else:\r\n odd += 1\r\n odd_list.append(number_list[i])\r\n\r\n if even >= 2 and odd == 1:\r\n print(number_list.index(odd_list[0]) + 1)\r\n break\r\n elif odd >= 2 and even == 1:\r\n print(number_list.index(even_list[0]) + 1)\r\n break", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nfor i in range(n) :\r\n a[i]=a[i]%2\r\nif sum(a)==1 :\r\n print(a.index(1)+1)\r\nelse :\r\n print(a.index(0)+1)", "if __name__ == '__main__':\r\n n = int(input())\r\n ls = list(map(int, input().split()))\r\n evens = []\r\n odds = []\r\n for x in ls:\r\n if x % 2 == 0:\r\n evens.append(x)\r\n else:\r\n odds.append(x)\r\n if len(odds) == 1:\r\n x = odds[0]\r\n else:\r\n x = evens[0]\r\n for i in range(len(ls)):\r\n if ls[i] == x:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nres = 0\r\nfor i in a:\r\n if i%2==0:\r\n n-=1\r\nif n==1:\r\n for i in a:\r\n if i%2==1:\r\n res = a.index(i)\r\nelse:\r\n for i in a:\r\n if i%2==0:\r\n res = a.index(i)\r\nprint(res+1)\r\n", "n=int(input())\r\ninput_string=input().split(\" \")\r\n\r\neven_number_count=0\r\nodd_number_count=0\r\n\r\nfor i in range(n):\r\n number=int(input_string[i])\r\n if number%2==0:\r\n even_number_count+=1\r\n else:\r\n odd_number_count+=1\r\n\r\nif even_number_count>odd_number_count:\r\n for i in range(n):\r\n number=int(input_string[i])\r\n if number%2!=0:\r\n print(\"%d\" %(i+1))\r\n raise exit()\r\nelse:\r\n for i in range(n):\r\n number=int(input_string[i])\r\n if number%2==0:\r\n print(\"%d\" %(i+1))\r\n raise exit()", "a=int(input())\r\nb=list(map(int,input().split()))\r\nn=0\r\nfor i in range(3):\r\n if (b[i])%2==0:\r\n n=n+1\r\nif n>=2:\r\n for i in b:\r\n if i%2!=0:\r\n print(b.index(i)+1)\r\nelse:\r\n for i in b:\r\n if i%2==0:\r\n print(b.index(i)+1)", "'''n = int(input())\r\ns = [int(i) for i in input().split()]\r\nfor i in range(1,n):\r\n if s[0] % 2 == 0 and s[1] % 2 != 0 and s[2] % 2 != 0 or s[0] % 2 == 1 and s[1] % 2 != 1 and s[2] % 2 != 1:\r\n print(1)\r\n break\r\n elif s[-1] % 2 == 0 and s[-2] % 2 != 0 and s[-3] % 2 != 0 or s[-1] % 2 == 1 and s[-2] % 2 != 1 and s[-3] % 2 != 1:\r\n print(n)\r\n break\r\n elif s[i] % 2 == 0 and s[i-1] % 2 != 0 and s[i+1] % 2 !=0:\r\n print(i+1)\r\n break\r\n elif s[i] % 2 == 1 and s[i-1] % 2 == 0 and s[i+1] % 2 ==0:\r\n print(i+1)\r\n break'''\r\n\r\nn = int(input())\r\ns = [int(i) for i in input().split()]\r\neven_count = 0\r\neven = 0\r\nodd_count = 0\r\nodd = 0\r\nfor i in range(n):\r\n if s[i] % 2 == 0:\r\n even_count += 1\r\n even = i\r\n else:\r\n odd_count += 1\r\n odd = i\r\nif even_count == 1:\r\n print(even+1)\r\nelse:\r\n print(odd+1)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\no=0\r\ne=0\r\nO=[]\r\nE=[]\r\nif l[0]%2==0:\r\n e+=1\r\n E.append(1)\r\nelse:\r\n o+=1\r\n O.append(1)\r\nfor i in range(1,n):\r\n if (l[i]%2==0):\r\n e+=1\r\n E.append(i+1)\r\n else:\r\n o+=1\r\n O.append(i+1)\r\n if o>e and e==1:\r\n print(E[0])\r\n break\r\n if e>o and o==1:\r\n print(O[0])\r\n break\r\n ", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nif l[0]%2==l[1]%2:\r\n for i in range(2,n):\r\n if l[i]%2!=l[0]%2:\r\n print(i+1)\r\nif l[0]%2!=l[1]%2:\r\n if l[0]%2!=l[2]%2:\r\n print(1)\r\n else:\r\n print(2)\r\n", "n = input()\r\nb = input()\r\neven_count=0\r\nodd_count=0\r\neven_num=0\r\nodd_num=0\r\nquest = b.split()\r\nfor i in range(len(quest)):\r\n quest[i]=int(quest[i])\r\nfor i in range(int(n)):\r\n if quest[i]%2==0:\r\n odd_count+=1\r\n odd_num=i+1\r\n else:\r\n even_count+=1\r\n even_num=i+1\r\nif odd_count==1:\r\n print(odd_num)\r\nelse:\r\n print(even_num)", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nc = 0\r\n\r\nd = 0\r\n\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n c+=1\r\n e = i\r\n else:\r\n d+=1\r\n f = i\r\n \r\nif c==1:\r\n print(e+1)\r\nelif d==1:\r\n print(f+1)", "#!/usr/bin/env python3\n\ndef solve(n_list):\n\tparity = 0\n\tfor i in range(3):\n\t\tparity += n_list[i] % 2\n\t# If parity is 0 or 1, looking for odd. If parity if 2 or 3, looking for even\n\tif parity >=2:\n\t\tlf_even = True\n\telse:\n\t\tlf_even = False\n\tfor i in range(len(n_list)):\n\t\tif (lf_even and n_list[i] % 2 == 0) or (not lf_even and n_list[i] % 2 == 1):\n\t\t\treturn i+1\n\ndef main():\n\tn = input()\n\tn_list = list(map(int,input().split(' ')))\n\tprint(solve(n_list))\n\nif __name__ == '__main__':\n\tmain()\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nx=arr[0]%2\r\n\r\nl=[]\r\nfor i in arr:\r\n if i%2==0:\r\n l.append(0)\r\n else:\r\n l.append(1)\r\n \r\na=l.count(0)\r\nb=l.count(1)\r\n\r\nif a>b:\r\n print(l.index(1)+1)\r\nelse:\r\n print(l.index(0)+1)", "am = int(input())\r\nnums = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in nums:\r\n if i % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if even > 1 or odd > 1:\r\n break\r\nif odd > 1:\r\n for i in nums:\r\n if i % 2 == 0:\r\n break\r\nelse:\r\n for i in nums:\r\n if i % 2 != 0:\r\n break\r\nprint(nums.index(i) + 1)\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nev = []\r\nod = []\r\nfor i in m:\r\n if i % 2 == 0:\r\n ev.append(i)\r\n else:\r\n od.append(i)\r\na = (m.index(ev[0]) + 1) if len(ev) == 1 else (m.index(od[0]) + 1)\r\nprint(a)", "l = int(input())\r\nn = list(map(int,input().split()))\r\n\r\nr = -1\r\nif n[0]%2 == n[1]%2:\r\n e = n[0]%2\r\nelif n[0]%2 == n[2]%2 :\r\n r = 2\r\nelse:\r\n r = 1\r\n\r\nif r == -1:\r\n for i in range(l):\r\n if n[i]%2 != e :\r\n r = i+1\r\n break\r\nprint(r)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Dec 11 22:20:18 2019\n\n@author: wwy\n\"\"\"\n\nn = int(input())\nnumbers = [int(x) for x in input().split()]\neven = 0\nodd = 0\nfor i in numbers:\n if i%2 == 0:\n even += 1\n else:\n odd += 1\n\nif even > odd:\n for i in numbers:\n if i%2 == 1:\n index = numbers.index(i) +1\nelse:\n for i in numbers:\n if i%2 == 0:\n index = numbers.index(i) +1\n\nprint(index)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nce=0\r\nco=0\r\nfor i in range(len(arr)):\r\n if arr[i]%2!=0:\r\n co=co+1\r\n io=i\r\n else:\r\n ce=ce+1\r\n ie=i\r\nif co==1:\r\n print(io+1)\r\nelse:\r\n print(ie+1)\r\n ", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n if x[i-1] % 2 != x[i] % 2 and x[i] % 2 != x[(i+1) % n] %2 :\r\n index = i+1\r\n break\r\nprint(index)", "n=int(input())\nNumbers=list(map(int , input().split()))\nZero_One_Array=[]\nm=0\nfor i in range (n):\n Zero_One_Array.append(Numbers[i]%2)\n \nif Zero_One_Array.count(1) > Zero_One_Array.count(0):\n m=0\nelse:\n m=1\n\nprint (Zero_One_Array.index(m)+1)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Oct 15 16:17:36 2022\n\n@author: calvinzhu\n\"\"\"\n\nn = int(input())\nnumber = [int(x) for x in input().split(\" \")]\neveness = []\n\nfor i in range(n):\n if number[i]%2 == 0:\n eveness.append(0)\n else:\n eveness.append(1)\n \nif sum(eveness) == 1:\n print(eveness.index(1)+1)\nelse:\n print(eveness.index(0)+1)\n ", "b= input()\r\na= list(input().split())\r\nc=0\r\nd=(int(a[0]))%2\r\nfor k in range(len(a)):\r\n\tif (int(a[k]))%2== d:\r\n\t\tc+=1\r\n\telse:\r\n\t\te=k\r\nif c>1:\r\n\tprint(e+1)\r\nelse:\r\n\tprint(1)\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\ncnt_even = 0\r\n\r\nfor i in range(n):\r\n if l[i]%2==0:\r\n cnt_even += 1\r\n \r\nif cnt_even == 1:\r\n for i in range(n):\r\n if l[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if l[i]%2 != 0:\r\n print(i+1)\r\n break", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(0,2):\r\n if a[i]%2==0 and a[i+1]%2==0:\r\n c = 0\r\n break\r\n elif a[i]%2!=0 and a[i+1]%2!=0:\r\n c = 1\r\n break\r\n else:\r\n c = 1 if a[1]%2==0 else 0\r\n\r\nif c==0:\r\n for i in a:\r\n if i%2!=0:\r\n print(a.index(i)+1)\r\nelse:\r\n for i in a:\r\n if i%2==0:\r\n print(a.index(i)+1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Initialize counters for even and odd numbers\r\neven_count = 0\r\nodd_count = 0\r\n\r\n# Initialize variables to store the positions of even and odd numbers\r\neven_position = 0\r\nodd_position = 0\r\n\r\nfor i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n even_position = i + 1 # Record the position of the even number\r\n else:\r\n odd_count += 1\r\n odd_position = i + 1 # Record the position of the odd number\r\n\r\n# Determine which number differs in evenness and output its position\r\nif even_count == 1:\r\n print(even_position)\r\nelse:\r\n print(odd_position)\r\n", "n = int(input())\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])%2\r\nif a.count(1) == 1:\r\n print(a.index(1)+1)\r\nelif a.count(0) == 1:\r\n print(a.index(0)+1)\r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n raw = input()\r\n countEven = 0\r\n countOdd = 0\r\n numbers = [int(i) for i in raw.split()]\r\n for i in range(len(numbers)):\r\n if numbers[i]%2==0:\r\n countEven +=1\r\n else:\r\n countOdd +=1\r\n if countEven==2:\r\n break\r\n elif countOdd==2:\r\n break\r\n else:\r\n continue\r\n for i in range(len(numbers)):\r\n if countEven==2 and numbers[i]%2!=0:\r\n print(i+1)\r\n elif countOdd==2 and numbers[i]%2==0:\r\n print(i+1)\r\n else:\r\n continue\r\n\r\n \r\n \r\n", "def find_different_number_index(n, numbers):\r\n even_count = odd_count = 0\r\n even_index = odd_index = -1\r\n\r\n for i in range(n):\r\n if numbers[i] % 2 == 0:\r\n even_count += 1\r\n even_index = i\r\n else:\r\n odd_count += 1\r\n odd_index = i\r\n\r\n return even_index + 1 if even_count == 1 else odd_index + 1\r\n\r\n# Read the number of numbers\r\nn = int(input())\r\n\r\n# Read the list of numbers\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Find and print the index of the number that differs from the others in evenness\r\nresult = find_different_number_index(n, numbers)\r\nprint(result)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ne = []\r\no = []\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e+=[i+1]\r\n else:\r\n o+=[i+1]\r\nif len(e)==1:\r\n print(e[0])\r\nelse:\r\n print(o[0])", "n = int(input())\nA = input()\nB = []\nfor i in A.split():\n B.append(int(i))\na = 0\nb = 0\nc = 0\nfor j in range(0,n):\n if B[j]%2 == 0:\n a = a+1\n if a == 2:\n break\n else:\n b = b+1\n if b ==2:\n break\nfor k in range(0,n):\n if a == 2:\n if B[k]%2 != 0:\n c = k+1\n else:\n if B[k]%2 == 0:\n c = k+1\nprint(c)", "n = int(input().strip())\r\nev,oddv,evv = 0,0,0\r\ni=0\r\nnumbers = [0]+[int(x) for x in input().split(' ')]\r\nwhile i<=n:\r\n if numbers[i] % 2 == 0: \r\n ev += 1\r\n evv = i \r\n else: \r\n ev -= 1\r\n oddv = i\r\n i+=1\r\nprint(oddv if ev > 0 else evv)", "import sys\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n values = [int(a) for a in sys.stdin.readline().split()]\r\n even_count, odd_count = 0, 0\r\n even_index, odd_index = 0, 0\r\n for i in range(n):\r\n if values[i] % 2:\r\n odd_count += 1\r\n odd_index = i + 1\r\n else:\r\n even_count += 1\r\n even_index = i + 1\r\n if odd_count == 1:\r\n print(odd_index)\r\n else:\r\n print(even_index)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nlista = list(map(int, input().split()))\no,e=0,0\nfor i in range(3):\n if lista[i]%2==0:e+=1\n else: o+=1\ndef isDifferent(num):\n if o>e:\n return num%2==0\n else:\n return num%2!=0\nfor i,v in enumerate(lista):\n if isDifferent(v):\n print(i+1)", "n=int(input())\r\na=[int(i)%2 for i in input().split()]\r\nif a.count(1)>1:\r\n print(a.index(0)+1)\r\nelse:\r\n print(a.index(1)+1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\na, b = [], []\r\nfor i in l:\r\n if i % 2 == 0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nc = a[0] if len(a) == 1 else b[0]\r\nprint(l.index(c) + 1)\r\n", "\r\n\r\nn=int(input())\r\n\r\narr=list(map(int,input().split()))\r\n\r\ncount1=0\r\ncount2=0\r\nfor i in range(0,n):\r\n if(arr[i]%2==0):\r\n count1+=1\r\n else:\r\n count2+=1\r\n\r\nif(count1>count2):\r\n for i in range(0,n):\r\n if(arr[i]%2!=0):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(0,n):\r\n if(arr[i]%2==0):\r\n print(i+1)\r\n break\r\n ", "\r\na=int(input())\r\nb= [int(x) for x in input().split(\" \")]\r\nif(b[0]%2==b[1]%2):\r\n c=b[0]%2\r\n for i in range(0,len(b)):\r\n if(b[i]%2!=c):\r\n print(i+1)\r\n break\r\nelse:\r\n if(b[0]%2==b[2]%2):\r\n print(\"2\")\r\n else:\r\n print(1)\r\n\r\n", "n = int(input())\r\nlst = [i % 2 for i in map(int, input().split())]\r\nif sum(lst) == 1:\r\n for i in range(len(lst)):\r\n if lst[i] % 2 == 1:\r\n print(i + 1)\r\nelse:\r\n for i in range(len(lst)):\r\n if not lst[i] % 2:\r\n print(i + 1)\r\n", "import sys\r\nimport math \r\n\r\ninputt = sys.stdin.readline\r\nprintt = sys.stdout.write\r\n\r\nn = int(inputt())\r\nniz = list(map(int, inputt().split()))\r\nbrpar=0\r\nbrnep=0\r\nparind=-1\r\nnepind=-1\r\nfor i in range(0,n):\r\n if(niz[i]%2==0):\r\n brpar+=1\r\n parind=i\r\n else:\r\n brnep+=1\r\n nepind=i\r\nif(brpar==1): printt(str(parind+1))\r\nelse: printt(str(nepind+1))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nz=len(l)\r\ne=0\r\no=0\r\nind1=0\r\nind2=0\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n e+=1\r\n ind1=i\r\n else:\r\n o+=1\r\n ind2=i\r\n \r\nif e<o:\r\n print(ind1+1)\r\nelse:\r\n print(ind2+1)\r\n ", "n = int(input())\r\nline = [int(k) for k in input().split()]\r\nif line[0]%2-line[1]%2 == 0:\r\n for i in range(2,n):\r\n if line[i]%2 != line[0]%2:\r\n print(i+1)\r\n break\r\nelse:\r\n if line[0]%2 == line[2]%2:\r\n print(2)\r\n else:\r\n print(1)", "#1300 rating...\r\n\r\nn = int(input())\r\n\r\nlst1 = list(map(int , input().split() ))\r\neven = 0\r\nodd = 0\r\ncount = 0\r\nc = 0\r\n\r\nfor i in lst1 :\r\n if i%2 == 0 :\r\n even = i\r\n count +=1\r\n else :\r\n odd = i\r\n c += 1\r\na = lst1.index(even) + 1\r\nb = lst1.index(odd) + 1\r\nif count == 1 :\r\n print(a)\r\nif c == 1:\r\n print(b)\r\n\r\n\r\n\r\n", "n = int(input())\r\nx = [int(i)%2 for i in input().split()]\r\nif x.count(0) > x.count(1):\r\n print(x.index(1)+1)\r\nelse:\r\n print(x.index(0)+1)\r\n", "n = int(input())\r\nline = list(map(int,input().split()))\r\n\r\nodd = even = 0\r\nfor i in line:\r\n if i%2:\r\n odd = odd + 1\r\n else:\r\n even = even + 1\r\nif odd>even:\r\n for i in range(n):\r\n if line[i]%2==0:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if line[i]%2!=0:\r\n print(i+1)", "n = int(input())\r\nelems = list(map(int, input().split()))\r\nevens = sum(map(lambda x: x % 2 == 0, elems))\r\nif evens == 1:\r\n\tprint([i + 1 for i, e in enumerate(elems) if e % 2 == 0][0])\r\nelse:\r\n\tprint([i + 1 for i, e in enumerate(elems) if e % 2 != 0][0])", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=o=s=s1=int(0)\r\nfor i in l:\r\n if i%2:e+=1;s=l.index(i)\r\n else:o+=1;s1=l.index(i)\r\nprint([s+1,s1+1][e>o])\r\n\r\n", "count=0\r\na=0\r\na=int(input())\r\narr=[]\r\narr=list(map(int,input().split()))\r\narr2=list(arr)\r\n\r\nfor i in range(a):\r\n arr2[i]=arr[i]%2\r\n \r\nfor i in arr2:\r\n count+=i\r\n\r\nif(count==1):\r\n for i in range(a):\r\n if(arr[i]%2==1):\r\n print(i+1)\r\n break;\r\nelse:\r\n for i in range(a):\r\n if(arr[i]%2==0):\r\n print(i+1)\r\n break;", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncnteven=0\r\ncntodd=0\r\nidxeven=0\r\nidxodd=0\r\nfor i in range(len(l)):\r\n if(l[i]%2==0):\r\n idxeven=i\r\n cnteven=cnteven+1\r\n else:\r\n idxodd=i\r\n cntodd=cntodd+1\r\nif(cnteven==1):\r\n print(idxeven+1)\r\nelse:\r\n print(idxodd+1)\r\n \r\n ", "n=int(input())\r\nx=0\r\ny=0\r\nz=0\r\nindex=0\r\npos=0\r\ninp=input().split()\r\nx=int(inp[0])\r\ny=int(inp[1])\r\nz=int(inp[2])\r\nif x%2==y%2 and y%2==z%2:\r\n if x%2==0:\r\n sear=1\r\n else:\r\n sear=0\r\nelse:\r\n sear=-1\r\n if x%2==y%2:\r\n pos=3\r\n elif x%2==z%2:\r\n pos=2\r\n else:\r\n pos=1\r\nif sear==-1:\r\n print(pos)\r\nelse:\r\n if sear==1:\r\n for i in range (3,len(inp)):\r\n if int(inp[i])%2==1:\r\n pos=i+1\r\n break\r\n else:\r\n for i in range (3,len(inp)):\r\n if int(inp[i])%2==0:\r\n pos=i+1\r\n break\r\n print(pos)\r\n", "n = int(input())\r\nx = [int(x) for x in input().split()]\r\nodd = [i + 1 for i, j in enumerate(x) if j % 2 != 0]\r\neven = [i + 1 for i, j in enumerate(x) if j % 2 == 0]\r\nprint(*(odd if len(odd) == 1 else even))", "n=int(input( ))\r\na=[int(i) for i in input( ).split( )]\r\nji=0\r\nou=0\r\n_ou=0\r\n_ji=0\r\nfor i in range(len(a)):\r\n if a[i]%2==0:\r\n ou+=1\r\n _ou=i+1\r\n if a[i]%2!=0:\r\n ji+=1\r\n _ji=i+1\r\nif ou>1:\r\n print(_ji)\r\nelse:\r\n print(_ou)\r\n \r\n", "n = int(input())\ncol = input()\ncol = col.split()\nodd = 0\neven = 0\nchosenE = -1\nchosenO = -1\nfor i in range(len(col)):\n num = int(col[i])\n if(num%2==0):\n chosenE = i\n even += 1\n else:\n chosenO = i\n odd += 1\nif(odd > even):\n print(chosenE+1)\nelse:\n print(chosenO+1)\n\n\t\t \t\t\t \t\t\t\t\t\t \t\t\t \t \t \t \t\t\t\t", "n = int(input())\nnumbs = list(input().split())\ncounter_pari = 0\ncounter_dispari = 0\n\nfor x in numbs:\n x = int(x)\n if x % 2 == 0:\n counter_pari += 1\n else:\n counter_dispari += 1\n\nindex = 0 \nif counter_pari > 1:\n for x in numbs:\n index += 1\n x = int(x)\n if x % 2 == 0:\n pass\n else:\n print(index)\n break\nelse:\n for x in numbs:\n index += 1\n x = int(x)\n if x % 2 == 0:\n print(index)\n break\n else:\n pass\n", "n=int(input())\r\na=list(map(int,list(input().split())))\r\nb=[]\r\nc=[]\r\nfor i in range(n):\r\n if a[i]%2!=0:\r\n b.append(i+1)\r\n if a[i]%2==0:\r\n c.append(i+1)\r\nb=int(\"\".join(map(str,b)))\r\nc=int(\"\".join(map(str,c)))\r\nif c>b:\r\n print(b)\r\nelse:\r\n print(c)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ndef even(i):\r\n return i%2==0\r\ne = [even(i) for i in a]\r\nif e.count(False)==1:\r\n print(e.index(False)+1)\r\nelse:\r\n print(e.index(True)+1)", "n = int(input())\n\nnums = [int(x) for x in input().split()]\n\nnum_evens = sum(x % 2 == 0 for x in nums)\n\nif num_evens > n // 2:\n for idx, num in enumerate(nums):\n if num % 2 == 1:\n print(idx + 1)\n break\nelse:\n for idx, num in enumerate(nums):\n if num % 2 == 0:\n print(idx + 1)\n break\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=[]\r\nn=[]\r\n\r\nfor i in l:\r\n if i%2==0:\r\n m.append(i)\r\n else:\r\n n.append(i)\r\nif len(m)>len(n):\r\n print(l.index(n[0])+1)\r\nelif len(n)>len(m):\r\n print(l.index(m[0])+1)\r\n", "n = int(input())\r\narray= list(map(int, input().split()))\r\neven =0\r\nodd = 0\r\nans = 0\r\nfor i in array:\r\n if i%2 == 0:\r\n even +=1\r\n else:\r\n odd +=1\r\n \r\nif even==1:\r\n for i in array:\r\n if i%2 == 0:\r\n ans = array.index(i)+1\r\n break\r\nelse:\r\n for i in array:\r\n if i%2 !=0:\r\n ans = array.index(i)+1\r\n break\r\n\r\nprint(ans)", "n, ns = input(), list(map(lambda i: i % 2, map(int, input().split())))\n\nfor idx, i in enumerate(ns, 1):\n if ns.count(i) == 1:\n print(idx)\n break\n\n\t\t \t \t \t \t\t\t \t\t \t \t \t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\neven=[i for i in l if i%2==0]\r\nodd=[i for i in l if i%2==1]\r\n\r\nif len(even)==1:\r\n \r\n x=(l.index(even[0]))\r\n print(x+1)\r\nelse:\r\n x=(l.index(odd[0]))\r\n print(x+1)", "var=int(input())\r\nvar_list=input().split()\r\nvar_list=[int(i) for i in var_list]\r\ncouunter0=0\r\ncouunter1=0\r\n\r\nfor i in range(var):\r\n if var_list[i]%2 == 0:\r\n couunter0 += 1\r\n else:\r\n couunter1 += 1\r\nif couunter0 > couunter1:\r\n for i in range(len(var_list)):\r\n if var_list[i]%2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(len(var_list)):\r\n if var_list[i]%2 == 0:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nd = [0] * n\r\nf = \"\"\r\nans1 = -1\r\nans0 = -1\r\nfor i in range(n):\r\n d[i] = s[i] % 2\r\nfor i in range(n):\r\n if d[i] == 1:\r\n ans1 = i + 1\r\n else:\r\n ans0 = i + 1\r\nfor i in range(n):\r\n f = f + str(d[i])\r\n\r\nif f.count(\"1\") == 1:\r\n print(ans1)\r\n exit(0)\r\nif f.count(\"0\") == 1:\r\n print(ans0)\r\n exit(0)\r\n\r\n'''\r\n░█████╗░░░░░░░░██████╗░█████╗░███╗░░██╗███╗░░██╗\r\n██╔══██╗░░░░░░██╔════╝██╔══██╗████╗░██║████╗░██║\r\n███████║█████╗╚█████╗░███████║██╔██╗██║██╔██╗██║\r\n██╔══██║╚════╝░╚═══██╗██╔══██║██║╚████║██║╚████║\r\n██║░░██║░░░░░░██████╔╝██║░░██║██║░╚███║██║░╚███║\r\n╚═╝░░╚═╝░░░░░░╚═════╝░╚═╝░░╚═╝╚═╝░░╚══╝╚═╝░░╚══╝\r\n'''\r\n", "n = int(input())\r\nnums = input()\r\nnums = nums.split()\r\nfor i in range(len(nums)):\r\n nums[i] = int(nums[i])\r\n\r\nif nums[0] % 2 + nums[1] % 2 + nums[2] % 2 < 2:\r\n check = True\r\nelse:\r\n check = False\r\nfor i in range(len(nums)):\r\n if check:\r\n if nums[i] % 2 != 0:\r\n print(i + 1)\r\n else:\r\n if nums[i] % 2 == 0:\r\n print(i + 1)", "n=int(input());a=input().split();even,odd=0,0\r\na=[int(x) for x in a]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even+=1\r\n se=i+1\r\n else: \r\n odd+=1\r\n so=i+1\r\nif even==1:\r\n print(se)\r\nelse: print(so)", "def least_common(lst): \r\n lst = lst[::-1]\r\n return min(lst, key=lst.count)\r\n\r\nfrom collections import Counter\r\na = int(input())\r\narr = list(map(int, input().split()))\r\narr2 = []\r\n\r\nfor i in range(a):\r\n arr2.append(arr[i] % 2)\r\n\r\nprint(arr2.index(least_common(arr2)) + 1)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\neven=0\r\nodd=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even+=1\r\n eveni=i\r\n else:\r\n odd+=1\r\n oddi=i\r\nif even==1:\r\n print(eveni+1)\r\nelse:\r\n print(oddi+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nevc=0\r\nei=0\r\nodc=0\r\nodi=0\r\nfor i in range(n):\r\n if(l[i]%2==0):\r\n evc+=1\r\n ei=i+1\r\n else:\r\n odc+=1\r\n odi=i+1\r\nif(evc==1):\r\n print(ei)\r\nelse:\r\n print(odi)\r\n \r\n", "n = int(input())\r\nnum = list(input().split())\r\nfor i in range(n-1):\r\n a = int(num[i]) + int(num[i+1])\r\n if a % 2 !=0:\r\n if i == 0:\r\n b = int(num[i+1]) + int(num[i+2])\r\n if b % 2 == 0:\r\n print(i+1)\r\n else:\r\n print(i+2)\r\n else:\r\n print(i+2)\r\n break\r\n \r\n ", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nR = []\r\nfor i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n R.append(0)\r\n else:\r\n R.append(1)\r\nif sum(R) == n-1:\r\n for i in range(len(R)):\r\n if R[i] == 0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(R)):\r\n if R[i] == 1:\r\n print(i+1)\r\n\r\n", "n = int(input())\r\nnumbers = list(map(int,input().split()))\r\nm = [i%2 for i in numbers]\r\nif m.count(1)==n-1 and m.count(0)==1:\r\n print(m.index(0)+1)\r\nelse:\r\n print(m.index(1)+1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\neven,odd=0,0\r\nfor i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n even+=1\r\n else:\r\n odd+=1\r\nfor i in l:\r\n if even > odd :\r\n if i%2!=0:\r\n print(l.index(i)+1)\r\n exit()\r\n else:\r\n if i%2 == 0:\r\n print(l.index(i)+1)\r\n exit()\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nchet = []\r\ncount = 1\r\nfor i in range(3):\r\n if s[i] % 2 == 0:\r\n chet.append(s[i])\r\nif len(chet) > 1:\r\n for i in s:\r\n if i % 2 == 0:\r\n count += 1\r\n else:\r\n print(count)\r\nelse:\r\n for i in s:\r\n if i % 2 != 0:\r\n count += 1\r\n else:\r\n print(count)", "t=int(input())\r\nn=list(map(int,input().split()))\r\nx=0\r\np1=0\r\np2=0\r\n\r\nfor i in range(len(n)):\r\n if n[i]%2!=0:\r\n x+=1\r\n p1=i+1\r\n else:\r\n p2=i+1\r\nif x==1:\r\n print(p1)\r\nelse:\r\n print(p2)\r\n \r\n ", "length = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\ndef check(x):\r\n if(x%2==0):\r\n return 1\r\n else:\r\n return 0\r\nlist_of_numbers = list(map(check, numbers))\r\ntotal = sum(list_of_numbers)\r\nif(total==1):\r\n print((list_of_numbers.index(1))+1)\r\nelif(total>1):\r\n print((list_of_numbers.index(0))+1)\r\n", "n = int(input())\nnumbers = list(int(x) for x in input().split())\nlast_even = -1\neven_count = 0\nlast_odd = -1\nodd_count = 0\n\nfor i in range(0, n):\n\tif numbers[i] % 2 == 0:\n\t\teven_count += 1\n\t\tlast_even = i+1\n\n\tif numbers[i] % 2 == 1:\n\t\todd_count += 1\n\t\tlast_odd = i+1\n\nif even_count == 1:\n\tprint(last_even)\nelse:\n\tprint(last_odd)\n\n \t \t \t \t \t \t \t \t\t\t \t \t", "#!/usr/bin/env python\r\n\r\n# Header\r\nimport sys\r\n\r\n# Input\r\nGet_Input = int(input())\r\n\r\n# Finding the eveness\r\nGet_Nums= [int(x) for x in input().split()]\t\r\nEven = [x%2 for x in Get_Nums]\r\n\r\n\r\n# Output\t\r\nif Even.count(1) > Even.count(0):\r\n print(Even.index(0) + 1)\r\nelse:\r\n print(Even.index(1) + 1)", "p = int(input())\r\nar = [int(x) for x in input().split()]\r\n\r\n\r\ncoun = sum(x & 1 for x in ar)\r\nfor i, g in enumerate(ar):\r\n if (coun != 1 and ~g & 1) or (coun == 1 and g & 1):\r\n print(i + 1)\r\n exit()", "lengthList = int(input())\r\nnumbers = input().split()\r\ndictionary = {}\r\n\r\nfor x in range(len(numbers)):\r\n dictionary[(x, int(numbers[x]))] = int(numbers[x])%2 == 0\r\n \r\ncountEven, countOdd = 0, 0\r\n\r\nfor number in dictionary:\r\n if dictionary[number] == True:\r\n countEven += 1\r\n else:\r\n countOdd += 1\r\n \r\nif countEven > 1:\r\n for number in dictionary:\r\n if dictionary[number] == False:\r\n print(int(number[0])+1)\r\n break\r\nelse:\r\n for number in dictionary:\r\n if dictionary[number] == True:\r\n print(int(number[0])+1)\r\n break", "def iq():\r\n n=int(input())\r\n l=list(map(int, input().split()))\r\n e=-1\r\n o=-1\r\n for i in range (n-1):\r\n a=l[i]%2\r\n if o==-1 and a==1:\r\n o=i\r\n elif e==-1 and a==0:\r\n e=i\r\n if e!=-1 and o!=-1:\r\n if l[i+1]%2==1:\r\n return(e+1)\r\n else:\r\n return(o+1)\r\n return n\r\nprint(iq())\r\n \r\n", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\nio=ie=0\r\nco=ce=0\r\nfor j in range(n):\r\n if l1[j]%2==0: #even\r\n ce+=1\r\n ie=j+1\r\n else :\r\n co+=1\r\n io=j+1\r\nif co==1 or co==n:\r\n print(io)\r\nelse :\r\n print(ie)", "n = int(input())\r\na = input().split(' ')\r\nfor i in range(n-2):\r\n if int(a[i])%2 != int(a[i+1])%2:\r\n if int(a[i+1])%2 != int(a[i+2])%2:\r\n print(i+2)\r\n break\r\n else:\r\n print(i+1)\r\n break\r\nif int(a[n-3])%2 == int(a[n-2])%2 and int(a[n-2])%2 != int(a[n-1])%2:\r\n print(n)", "n = int(input())\r\nm = [int(ii) for ii in input().split()]\r\n\r\np = [0, 0]\r\nq = [0, 0]\r\n\r\nfor ii in range(0, n):\r\n if m[ii] % 2 == 0:\r\n if p[0] > 1:\r\n print(ii + 1)\r\n break\r\n \r\n if q[0] >= 1 and p[0] > 0:\r\n print(p[1])\r\n break\r\n\r\n q[0] += 1\r\n q[1] = (ii + 1)\r\n\r\n else:\r\n if q[0] > 1:\r\n print(ii + 1)\r\n break\r\n\r\n if p[0] >= 1 and q[0] > 0:\r\n print(q[1])\r\n break\r\n \r\n p[0] += 1\r\n p[1] = (ii + 1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nx, y = 0, 0\r\np, q = 0, 0\r\nfor i in range(0,n):\r\n\tif a[i] & 1:\r\n\t\tx += 1\r\n\t\tp = i\r\n\telse:\r\n\t\ty += 1\r\n\t\tq = i\r\nif x == 1:\r\n\tprint(p + 1)\r\nelse:\r\n\tprint(q + 1)\t\t\r\n\t\t", "n = int(input())\r\nls = list(map(lambda x: int(x), input().split()))\r\n\r\nif ls[0] % 2 == 0 and ls[-1] %2 == 0:\r\n even = True\r\nelif ls[0] % 2 and ls[-1] % 2:\r\n even = False\r\nelse:\r\n if ls[1] % 2 == ls[0] % 2:\r\n print(len(ls))\r\n else:\r\n print(1)\r\n quit()\r\nfor out, num in enumerate(ls, 1):\r\n if num%2 == even:\r\n print(out)\r\n\r\n", "n = int(input())\r\nvals = list(map(int, input().split()[:n]))\r\n\r\np = int(sum([v % 2 for v in vals[:3]]) < 2)\r\n\r\nfor i, v in enumerate(vals):\r\n if v % 2 == p:\r\n print(i + 1)\r\n", "#25A - IQ test\r\nimport re\r\nprint([x.index(i)+1 for n in [[input()]] for x in [[int(i)%2 for i in re.split(\" \",input())]] for i in [[x.count(0),x.count(1)].index(1)]][0])", "n = int(input())\r\narr_input_str = input().split(' ')\r\narr_input_int = []\r\nco_even = 0\r\nco_odd = 0\r\n\r\nfor i in range(n):\r\n arr_input_int.append(int(arr_input_str[i]))\r\n\r\n if arr_input_int[i] % 2 == 0:\r\n co_even +=1\r\n\r\n else:\r\n co_odd +=1\r\n\r\nif co_even > co_odd:\r\n for i in range(n):\r\n if arr_input_int[i] % 2 == 1:\r\n print (i+1)\r\n quit()\r\n \r\nelse :\r\n for i in range(n):\r\n if arr_input_int[i] % 2 == 0:\r\n print (i+1)\r\n quit()\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ne = 0\r\no = 0\r\nfor i in a:\r\n if i % 2 ==0 :\r\n e += 1\r\n else:\r\n o += 1\r\n\r\nif e > o:\r\n for i in range(n):\r\n if a[i] % 2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n \r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nodds = list(filter(lambda x: x % 2 == 1, arr))\r\nevens = list(filter(lambda x: x % 2 == 0, arr))\r\nif len(odds) == 1:\r\n print(arr.index(odds[0]) + 1)\r\nelse:\r\n print(arr.index(evens[0]) + 1)", "if __name__ == '__main__':\r\n n = int(input())\r\n numbers = map(int, input().split(\" \"))\r\n \r\n even_count = 0\r\n odd_count = 0\r\n last_even_index = -1\r\n last_odd_index = -1\r\n\r\n for i, n in enumerate(numbers):\r\n if n % 2 == 0:\r\n last_even_index = i\r\n even_count += 1\r\n else:\r\n last_odd_index = i\r\n odd_count += 1\r\n\r\n if even_count > odd_count:\r\n print(last_odd_index + 1)\r\n else:\r\n print(last_even_index + 1)\r\n", "n = input()\r\nlst = input().split()\r\nlst = [int(x)%2 for x in lst]\r\nslst = sorted(lst)\r\nif slst[0] == slst[1]:\r\n\tprint(lst.index(1)+1)\r\nelse:\r\n\tprint(lst.index(0)+1)", "def geteven(li):\r\n return li.index(list(filter(lambda x : x % 2 == 0,li))[0]) + 1\r\ndef getodd(li):\r\n return li.index(list(filter(lambda x : x % 2 != 0,li))[0]) + 1\r\nn = int(input())\r\nli = [int(i) for i in input().split()]\r\nodd = 0\r\neven = 0\r\nfor i in li[0:3]:\r\n if(i % 2 == 0):\r\n even += 1\r\n else:\r\n odd += 1\r\nif(even > 1):\r\n print(getodd(li))\r\nelse:\r\n print(geteven(li))", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\n#sys.setrecursionlimit(10**6)\r\ninput=sys.stdin.readline\r\n\r\nints = lambda : list(map(int,input().split()))\r\nalpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\np2 = [1]\r\nfor i in range(70):p2.append(p2[-1]*2)\r\np = 10**9+7\r\nANS=[]\r\n\r\nn = int(input())\r\na = ints()\r\nx,y = 0,0\r\np,q = -1,-1\r\nfor i in range(n):\r\n if a[i]%2:\r\n x+=1\r\n p=i+1\r\n else:\r\n y+=1\r\n q=i+1\r\nif x==1:\r\n print(p)\r\nelse:\r\n print(q)\r\n", "n = int(input())\r\nl = list(map(int , input().split()))\r\n\r\nfor i in range(n):\r\n a, b , c = l[i-2],l[i-1],l[i]\r\n if a%2 != b%2 and a%2 != c%2:\r\n print(1 + (i-2)%n)", "n=int(input())\r\nl=list(map(int, input().split(' ')))\r\ne=o=0\r\ndup1=[]\r\ndup2=[]\r\nfor i in l:\r\n if i%2==0:\r\n e+=1\r\n dup1.append(i)\r\n if i%2!=0:\r\n o+=1\r\n dup2.append(i)\r\n\r\nif(len(dup2)<len(dup1)):\r\n dup=dup2\r\nif(len(dup1)<len(dup2)):\r\n dup=dup1\r\n# print(dup)\r\nprint(l.index(dup[0])+1)\r\n\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nev=[]\r\nod=[]\r\nfor i in t:\r\n if(i%2==0):\r\n ev.append(i)\r\n else:\r\n od.append(i)\r\nif(len(od)>len(ev)):\r\n for j in range(len(t)):\r\n if(t[j]==ev[0]):\r\n print(j+1)\r\n break\r\nelse:\r\n for k in range(len(t)):\r\n if(t[k]==od[0]):\r\n print(k+1)\r\n break\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na=list(map(lambda x:x%2,a))\r\nx=a.count(0)\r\ny=a.count(1)\r\nif x>y:\r\n for i in range(n):\r\n if a[i]==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i]==0:\r\n print(i+1)\r\n break\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ne=0\r\no=0\r\nfor i in l:\r\n if i%2==0:\r\n e=e+1\r\n else:\r\n o=o+1\r\nif e==1:\r\n for i in l:\r\n if i%2==0:\r\n print(l.index(i)+1)\r\n break\r\nelse:\r\n for i in l:\r\n if i%2==1:\r\n print(l.index(i)+1)\r\n break", "def fun(x):\r\n t=0\r\n for i in range(3):\r\n if x[i]%2==0:\r\n t+=1\r\n\r\n if t>1:\r\n for i in range(len(x)):\r\n if x[i]%2==1:\r\n return i+1\r\n for i in range(len(x)):\r\n if x[i]%2==0:\r\n return i+1\r\n \r\n \r\n \r\n \r\na=int(input())\r\nx=list(map(int,input().split()))\r\nprint(fun(x))\r\n\r\n \r\n\r\n \r\n \r\n \r\n", "#*****************************************************************************\n#* __ ________ __________ __________ __ __ *\n#* | | | | ||_________| ||________| || || *\n#* | | | | || || || || *\n#* | | |________| || || || || *\n#* | | |________| || ______ || ______ || || *\n#* ___| | | | ||____| | | | ||_____| | | | ||______|| *\n#*|______| | | ||______| |_| ||_______| |_| ||______|| *\n#* *\n#******************************************************************************\n\n\nfrom collections import defaultdict as D\nfrom math import *\nfrom sys import stdin, stdout\n\nMOD = 10**9+7\nMAX = 10**18+1\nMIN = -MAX\n\ndef reshape(count, val=0): return [ val for i in range(count) ]\n\ndef vec_read(): return list(map(int,stdin.readline().split()))\n\ndef read(): return map(int,stdin.readline().split())\n\ndef get_string(): return stdin.readline().strip()\n\n\n##################################################\n\ndef solve():\n # Logic Starts Here\n n = int(input())\n a = vec_read()\n e_c=0\n even = []\n o_c=0\n odd=[]\n for i in range(n):\n if a[i]%2: \n o_c+=1\n odd.append(i)\n else: \n e_c+=1\n even.append(i)\n if o_c==1:\n print(odd[0]+1)\n else:\n print(even[0]+1)\n\ndef test_cases():\n t = int(input())\n while t:\n solve()\n t-=1\n\n## Driver Code\nif __name__ == '__main__':\n # test_cases()\n solve()", "input()\r\na=[int(i)%2 for i in input().split()]\r\nprint( (a.index(0)+1) if a.count(0)<a.count(1) else a.index(1) +1 )", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns0=sum(s)\r\nl1=list()\r\nl2=list()\r\nfor i in range(len(s)):\r\n if s[i] %2==0:\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\nif len(l1)>len(l2):\r\n print(l2[0]+1)\r\nelse:\r\n print(l1[0]+1)", "N = int(input())\nnumbers = list(map(int,input().split()))\nfor i in range(len(numbers)):\n numbers[i] = numbers[i]%2\na = 0 \nb = 0\nfor i in range(len(numbers)):\n if numbers[i] == 0:\n a += 1\n else:\n b += 1\n if a==2:\n for j in range(len(numbers)):\n if numbers[j] == 1:\n print(j+1)\n break\n break\n elif b == 2:\n for j in range(len(numbers)):\n if numbers[j] == 0:\n print(j+1)\n break\n break\n else:\n pass\n\n\t\t\t\t\t \t \t \t\t \t \t \t\t\t\t \t \t", "n = int(input())\r\nli = list(map(int, input().split()))\r\ns = 0\r\nwhile li[s]%2 == li[s-1]%2:\r\n s = s + 1\r\nif li[s+1]%2 == li[s-1]%2:\r\n print(s+1)\r\nelif s == 0:\r\n print(n)\r\nelse:\r\n print(s)", "n=int(input())\r\nch=0\r\nnch=0\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i%2:\r\n nch+=1\r\n else:\r\n ch+=1\r\n if nch>1 or ch>1:\r\n break\r\nif nch==2:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i]%2:\r\n print(i+1)\r\n break\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "\ntrash = input()\nnumbers = list(map(int, input().split(' ')))\n\nq_even = 0\nq_odd = 0\n\nlast_odd = None\nlast_even = None\n\nfor index, number in enumerate(numbers):\n if (number % 2):\n q_even = q_even + 1\n last_even = index\n else:\n q_odd = q_odd + 1\n last_odd = index\n\n\n if (q_even >= 2 and last_odd != None):\n print(last_odd + 1)\n break\n\n if (q_odd >= 2 and last_even != None):\n print(last_even + 1)\n break\n\n\t \t\t\t\t\t\t \t \t \t\t\t\t \t", "input()\r\nL=[int(x)%2 for x in input().split()]\r\nprint(L.index(sum(L)==1)+1)\r\n", "n=input()\r\nx=[int(i)%2==0 for i in str(input()).split()]\r\n\r\nif x.count(1)==1:\r\n print(x.index(1)+1)\r\nelse:\r\n print(x.index(0)+1)", "n = int(input())\r\ns = input()\r\nl = s.split(\" \")\r\nk=[]\r\n\r\nfor i in range(n):\r\n k.append(int(l[i])%2)\r\n\r\nif k.count(1)>1:\r\n for i in range(n):\r\n if k[i]==0:\r\n print(i+1)\r\n break\r\n\r\nif k.count(0)>1:\r\n for i in range(n):\r\n if k[i]==1:\r\n print(i+1)\r\n break", "a=int(input())\r\narr=list(map(int,input().split()))\r\ne=[]\r\no=[]\r\nfor i in range(a):\r\n if arr[i]%2==0:\r\n e.append((arr[i],i+1))\r\n else:\r\n o.append((arr[i] ,i+1))\r\nif len(e)==1:\r\n print(e[0][1])\r\nelse:\r\n print(o[0][1])", "n = int(input())\nlistOfNumbers = list(map(int, input().split(' ')))\nlistOfEven = []\nlistOfOdd = []\nfor i in range(n):\n if listOfNumbers[i] % 2 == 0:\n listOfEven.append(i+1)\n else:\n listOfOdd.append(i+1)\nif len(listOfEven) == 1:\n print(listOfEven[0])\nelse:\n print(listOfOdd[0])\n \t\t \t \t\t\t\t \t\t \t\t\t\t \t\t \t\t\t", "n = int(input())\nvs = list(map(int, input().split()))\nne = 0\nno = 0\nfor v in vs[:3]:\n if v % 2 == 0:\n ne += 1\n else:\n no += 1\np = 1 if ne > 1 else 0\nfor i, v in enumerate(vs):\n if (v + p) % 2 == 0:\n print(i + 1)\n exit()\n", "n = input()\r\nline = input().split()\r\nlist_1 = []\r\nlist_2 = []\r\n\r\nfor i in range(int(n)):\r\n\tif int(line[i])%2 == 0:\r\n\t\tlist_2.append(i+1)\r\n\telse:\r\n\t\tlist_1.append(i+1)\r\n\r\nif len(list_2) > len(list_1):\r\n\tanswer = list_1[0]\r\nelse:\r\n\tanswer = list_2[0]\r\n\t\r\nprint(answer)\r\n\t\t", "n = int(input())\r\nnumbers = [int(_) for _ in input().split()]\r\neven_count = 0\r\nlast_even, last_odd = 0, 0\r\nfor i, num in enumerate(numbers):\r\n if num % 2 == 0:\r\n even_count += 1\r\n last_even = i + 1\r\n else:\r\n last_odd = i + 1\r\n if i >= 2:\r\n even = even_count <= 1\r\n if even and last_even:\r\n print(last_even)\r\n exit()\r\n elif not even and last_odd:\r\n print(last_odd)\r\n exit()\r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\n'''for i in range(n):\r\n\tif s[i] % 2 == 0:\r\n\t\tch += 1\r\n\telse:\r\n\t\tnch += 1'''\r\nch = list(filter(lambda x: x % 2 == 0,s))\r\nnch = list(filter(lambda x: x % 2 != 0,s))\r\nif len(ch)>len(nch):\r\n\tprint(s.index(nch[0])+1)\r\nelse:\r\n\tprint(s.index(ch[0])+1)\r\n", "n = int(input())\nL = list(map(int,input().split()))\nIndex1 = Index2 = -1\nnum1 = num2 = 0\nfor i in range(n):\n\tif L[i] % 2 :\n\t\tnum1 += 1\n\t\tIndex1 = i\n\telse:\n\t\tnum2 += 1 \n\t\tIndex2 = i\nif num1 == 1:\n\tprint(Index1 + 1)\nelse:\n\tprint(Index2 + 1)\n\n\n \t \t\t \t\t\t\t \t \t\t\t \t\t \t \t", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\n\r\na = list(map(int,sys.stdin.readline().split()))\r\nanswer = []\r\nfor i in a:\r\n if i % 2 == 0:\r\n answer.append(0)\r\n else:\r\n answer.append(1)\r\n\r\nif sum(answer) == 1:\r\n print(answer.index(1)+1)\r\nelse:\r\n print(answer.index(0)+1)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl1=[]\r\nl2=[]\r\nfor i in range(len(l)):\r\n if l[i]%2==0:\r\n l1.append(i)\r\n else:\r\n l2.append(i)\r\nif len(l1)==1:\r\n print(l1[0]+1)\r\nelse:\r\n print(l2[0]+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = False\r\nfor i in range(1, n - 1):\r\n if a[i + 1] % 2 != a[i] % 2 != a[i - 1] % 2:\r\n print(i + 1)\r\n b = True\r\n break\r\nif not b:\r\n if a[0] % 2 != a[1] % 2:\r\n print(1)\r\n else:\r\n print(n)", "d = {0: [], 1: []}\r\ninput()\r\nnums = map(int, input().split())\r\n\r\nfor i, n in enumerate(nums):\r\n d[n % 2].append(i)\r\n\r\nmin_list = min(d.values(), key=len)\r\nprint(min_list[0] + 1)\r\n", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\npi=[0]*n\r\nfor i in range(n):\r\n if li[i]%2==0:\r\n pi[i]=1\r\na=pi.count(1)\r\nb=pi.count(0)\r\nif a==1:\r\n print(pi.index(1)+1)\r\nelse:\r\n print(pi.index(0)+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nj = 0\r\nfor i in range(3):\r\n if s[i] % 2 == 0:\r\n j += 1\r\nif j >= 2:\r\n for i in s:\r\n if i % 2 != 0:\r\n print(s.index(i) + 1)\r\n exit(0)\r\nelse:\r\n for i in s:\r\n if i % 2 == 0:\r\n print(s.index(i) + 1)\r\n exit(0)", "import sys\n\nn = int(input())\narr = [int(x) for x in input().split()]\nmark0 = arr[0] % 2\nmark1 = arr[1] % 2\nmark2 = arr[2] % 2\nif(mark1 == mark2 == mark0):\n check = mark1\n for i in range(3, n):\n if(arr[i] % 2 != check):\n print(i+1)\n sys.exit()\n \nif(mark1 == mark2 and mark1 != mark0):\n print(1)\nelif(mark2 == mark0 and mark2 != mark1):\n print(2)\nelif(mark1 == mark0 and mark2 != mark0):\n print(3)\n \n\t \t\t \t\t\t \t \t \t\t \t\t \t \t", "a=int(input()) #number of inputs\nnums=input().split(\" \")\n\noe=[]\nevens=0\n\nfor i in range(len(nums)):\n\n if int(nums[i])%2==0:\n oe.append(0)\n evens+=1\n else:\n oe.append(1)\n\nif evens>1:\n for i in range(len(oe)):\n if oe[i]==1:\n print(i+1)\nelse:\n for i in range(len(oe)):\n if oe[i]==0:\n print(i+1)\n\n\n\n \n", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\na=[]\r\nfor i in x:\r\n a.append(i%2)\r\nif a.count(1)>a.count(0):\r\n b=0\r\nelse:b=1\r\nfor i in range(n):\r\n if a[i]==b:\r\n print(i+1)\r\n", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n f1, f2 = 0, 0\r\n for c in a:\r\n if (c % 2):\r\n f1 += 1\r\n else:\r\n f2 += 1\r\n if (f1 == 1):\r\n f = 1\r\n else:\r\n f = 0\r\n for i in range (n):\r\n if (a[i] % 2 == f):\r\n print(i + 1)\r\n raise SystemExit(0)\r\n\r\nmain()", "n=int(input())\na=list(map(int,input().split()))\ncount1=0\ncount2=0\nfor i in a:\n if i%2==0:\n count1+=1\n else:\n count2+=1\nif count1>count2:\n for i in a:\n if i%2!=0:\n print(a.index(i)+1)\n break\nelse:\n for i in a:\n if i%2==0:\n print(a.index(i)+1)\n break\n", "n = input()\r\nlista = [int(i) for i in input().split()]\r\npar = 0\r\nimpar = 0\r\nfor i in lista:\r\n if i%2 == 0:\r\n par += 1\r\n else:\r\n impar += 1\r\nif par > impar:\r\n for i in range(len(lista)):\r\n if lista[i]%2 != 0:\r\n print(i+1)\r\nelse:\r\n for i in range(len(lista)):\r\n if lista[i]%2 == 0:\r\n print(i+1)", "def searchOdd(arr):\r\n for i in range(0,len(arr)):\r\n if arr[i]%2!=0:\r\n return i+1\r\n\r\ndef searchEven(arr):\r\n for i in range(0,len(arr)):\r\n if arr[i]%2==0:\r\n return i+1\r\n\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\neven=0\r\nodd=0\r\nfor i in arr:\r\n if i%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if even>1:\r\n print(searchOdd(arr))\r\n break\r\n elif odd>1:\r\n print(searchEven(arr))\r\n break", "n=int(input())\r\nline=input().split()\r\ntemp1=[];temp2=[]\r\nfor i in line:\r\n if int(i)%2==0:\r\n temp1.append(i)\r\n else:\r\n temp2.append(i)\r\nif len(temp1)==1:\r\n print(line.index(temp1[0])+1)\r\nelse:\r\n print(line.index(temp2[0])+1)\r\n", "n = int(input())\nline = [int(i) for i in input().split()]\ncountodd = 0\ncounteven = 0\nlastodd = 0\nlasteven = 0\nfor j in range(len(line)):\n if(line[j] % 2 == 0):\n counteven += 1\n lasteven = j+1\n else:\n countodd += 1\n lastodd = j+1\nif(countodd>counteven):\n print(str(lasteven))\nelse:\n print(str(lastodd))\n", "input()\r\na = [int(m) % 2 for m in input().split()]\r\nprint(a.index(sum(a) == 1) + 1)", "n = int(input())\r\na = input()\r\na = a.split(\" \")\r\n\r\nfor i in range(len(a)):\r\n a[i] = int(a[i]) % 2\r\n\r\nc_1,c_2 = 0,0\r\n\r\nfor j in range(len(a)):\r\n if a[j] == 0:\r\n c_1 = c_1 + 1\r\n else:\r\n c_2 = c_2 + 1\r\n\r\nif c_1 > c_2:\r\n for k in range(len(a)):\r\n if a[k] == 1:\r\n print (k+1)\r\nelse:\r\n for k in range(len(a)):\r\n if a[k] == 0:\r\n print(k+1)\r\n", "evn = 0\r\nodd = 0\r\ninput()\r\nl = list(map(int, input().split()))\r\nfor i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n evn += 1\r\n evnp = i + 1\r\n else:\r\n odd += 1\r\n oddp = i + 1\r\nprint(evnp) if evn == 1 else print(oddp)", "n = int (input())\r\nlis = list (map (int ,input().split()))\r\nodd, even = 0, 0\r\noddn, evenn = 0, 0\r\nfor i in range (n):\r\n if lis[i] % 2 == 0:\r\n even += 1\r\n evenn = i + 1\r\n else:\r\n odd += 1\r\n oddn = i + 1\r\nif even < odd:\r\n print(evenn)\r\nelse :\r\n print(oddn)", "#https://codeforces.com/problemset/problem/25/A\r\n\r\nn = input(\"\")\r\nnumbers = input(\"\").split(\" \")\r\n\r\ndef check_for_majority():\r\n n_odds = 0\r\n n_evens = 0\r\n\r\n for i in numbers:\r\n i = int(i)\r\n if i == 1:\r\n n_odds += 1\r\n elif i % 2 == 0:\r\n n_evens += 1\r\n else:\r\n n_odds += 1\r\n \r\n if n_odds > n_evens:\r\n return map(lambda n: n if int(n) % 2 == 0 else 0, numbers)\r\n else:\r\n return map(lambda n: n if int(n) % 2 != 0 else 0, numbers)\r\n\r\nresult = list(check_for_majority())\r\nfor i in result:\r\n if i != 0:\r\n print(numbers.index(i) + 1)\r\n break\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\no = e = co = 0\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n e = i+1\r\n else:\r\n o = i+1\r\n co += 1\r\n\r\nif co == 1:\r\n print(o)\r\nelse:\r\n print(e)", "n = int(input())\r\nA = [int(x) for x in input().split()]\r\nm0 = m1 = 0\r\nfor i in range(3):\r\n\tif A[i] % 2 == 0:\r\n\t\tm0 += 1\r\n\telse:\r\n\t\tm1 += 1\r\nif m0 > m1:\r\n\tmp = 1\r\nelse:\r\n\tmp = 0\r\nfor i in range(n):\r\n\tif A[i] % 2 == mp:\r\n\t\tprint(i + 1)\r\n\t\tbreak\r\n", "a = int(input())\r\nnumber = list(map(int,input().split()))\r\n#find the evenness:\\\r\ncount_E = 0\r\nfor item in number[0:3]:\r\n if item % 2 == 0:\r\n count_E += 1\r\n \r\n\r\nif count_E >= 2:\r\n for i,v in enumerate(number):\r\n if v % 2 == 1:\r\n print(i+1)\r\nelse:\r\n for i,v in enumerate(number):\r\n if v % 2 == 0:\r\n print(i+1)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nk=0\r\nfor i in l1:\r\n\tif i%2==0:\r\n\t\tk+=1\r\nif k==1:\r\n\tfor i in range(len(l1)):\r\n\t\tif l1[i]%2==0:\r\n\t\t\tprint(i+1)\r\nelse:\r\n\tfor i in range(len(l1)):\r\n\t\tif l1[i]%2==1:\r\n\t\t\tprint(i+1)\r\n", "n = int(input())\ns = list(map(int, input().split()))\nt = list(filter(lambda x: x % 2 == 0, s))\nif len(t) == 1:\n print(s.index(t[0]) + 1)\nelse:\n print(s.index(list(filter(lambda x: x % 2 != 0, s))[0]) + 1)", "n=int(input())\r\na=[int(x) for x in input().split()]#to define a array with int\r\nb=[]\r\ns1=0\r\ns0=0\r\nfor i in a:\r\n if(i%2==0):\r\n s0+=1\r\n else:\r\n s1+=1\r\nif(s1==1):\r\n for i in a:\r\n if(i%2==1):\r\n m=a.index(i)\r\n print(m+1)\r\n break\r\nelse:\r\n for i in a:\r\n if i%2==0:\r\n m=a.index(i)\r\n print(m+1)\r\n break\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\ni = 0\r\nwhile l[i]%2 == l[i+1]%2:\r\n i+=1\r\n \r\nif l[i]%2 != l[(i+2)%n]%2:\r\n print(i+1)\r\nelse:\r\n print(i+2)", "n = int(input())\r\nlis = list(map(int,input().rstrip().split()))\r\nfor i in range(n):\r\n lis[i] = lis[i]%2\r\nindex = 0\r\nfor i in range(n):\r\n if lis.count(lis[i])==1:\r\n index = i + 1\r\nprint(index)\r\n", "def find_different_number(n, numbers):\n even_count = 0\n odd_count = 0\n last_even_index = 0\n last_odd_index = 0\n\n for i in range(n):\n if numbers[i] % 2 == 0:\n even_count += 1\n last_even_index = i + 1\n else:\n odd_count += 1\n last_odd_index = i + 1\n\n if even_count == 1:\n return last_even_index\n else:\n return last_odd_index\n\n# Read input\nn = int(input())\nnumbers = list(map(int, input().split()))\n\n# Find the index of the number that differs in evenness\nresult = find_different_number(n, numbers)\n\n# Print the result\nprint(result)\n\n\t\t\t\t \t\t \t \t \t \t\t\t\t \t\t\t \t \t \t", "num= int(input())\r\nnums = list(map(int,input().split()))\r\n\r\nodd = False\r\neven = False\r\ns = \"\"\r\nfor i in nums:\r\n if i%2==0:\r\n s+=\"0\"\r\n else: s+=\"1\"\r\n\r\nn = s.count(\"0\")\r\n\r\nif n > 1:\r\n even = True\r\nelse:\r\n odd = True\r\n\r\nfor i in range(num):\r\n if nums[i]%2==0 and odd ==True:\r\n print(i+1)\r\n break\r\n if nums[i]%2==1 and even == True:\r\n print(i+1)\r\n break\r\n", "n=int(input())\r\nnumbers=list(map(int,input().split()))\r\ny=[i for i in numbers if i%2!=0]\r\nz=[i for i in numbers if i%2==0]\r\nif len(y)==1:\r\n print(numbers.index(y[0])+1)\r\nelse:\r\n print(numbers.index(z[0])+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nO = 0\r\nE = 0\r\nfor i in range(n):\r\n if s[i]%2 == 0:\r\n E += 1\r\n else:\r\n O += 1\r\nif O > E:\r\n for i in range(n):\r\n if s[i]%2 == 0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if s[i]%2 != 0:\r\n print(i+1)\r\n break\r\n", "n = int(input())\nx = [int(x) for x in input().split()]\neven = []\nodd = []\nfor i in range(len(x)):\n if x[i] % 2 == 0:\n even.append(x[i])\n else:\n odd.append(x[i])\n\nif len(odd) == 1:\n for i in range(len(x)):\n if x[i] == odd[0]:\n print(i + 1)\n\nif len(even) == 1:\n for i in range(len(x)):\n if x[i] == even[0]:\n print(i + 1)", "input()\r\nnums = [int(i)%2 for i in input().split()]\r\nprint(nums.index(0) + 1 if nums.count(1)>nums.count(0) else nums.index(1)+1)", "n=int(input())\r\na=[int(x)%2 for x in input().split()]\r\nif a.count(1)>=a.count(0):\r\n print(a.index(0)+1)\r\nelse:\r\n print(a.index(1)+1)", "n = int(input())\r\nlis = [int(x) for x in input().split()]\r\nif (lis[0]+lis[1])%2 != 0:\r\n if (lis[0]+lis[2])%2 == 0:\r\n print(2)\r\n else:\r\n print(1)\r\nelse:\r\n for i in range(2,n):\r\n if (lis[i]+lis[i-1])%2 != 0:\r\n print(i+1)\r\n break", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nks=[]\r\nrs=[]\r\ncount=0\r\nc=0\r\nfor i in lst:\r\n if(i%2==0):\r\n count+=1\r\n ks.append(i)\r\n else:\r\n c+=1\r\n rs.append(i)\r\nif(count==1):\r\n for h in range(count):\r\n r=ks[h]\r\n for i in lst:\r\n if i==r:\r\n a=lst.index(i)\r\n print(int(a)+1)\r\nif(c==1):\r\n for m in range(c):\r\n b=rs[m]\r\n for i in lst:\r\n if i==b:\r\n f=lst.index(i)\r\n print(int(f)+1)", "n=int(input())\r\neven=0\r\nodd=0\r\nc=0\r\ns=list(map(int,input().split()))\r\nfor k in s:\r\n c+=1\r\n if(k%2==0):\r\n even+=1\r\n eve=c\r\n else:\r\n odd+=1\r\n od=c\r\nif(even>odd):\r\n print(od)\r\nelse:\r\n print(eve)\r\n", "n=int(input())\r\ncount,count1=0,0\r\nindex,index1=0,0\r\na=[int(x) for x in input().split()]\r\n \r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n index=i \r\n count+=1 \r\n if(a[i]%2!=0):\r\n index1=i \r\n count1+=1 \r\nif(count==1):\r\n print(index+1)\r\nelse:\r\n print(index1+1)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\nsavedOddIndex = 0\r\nsavedEvenIndex = 0\r\nevenCount = 0\r\noddCount = 0\r\nfor i in range(0, len(numbers)):\r\n if numbers[i] % 2 == 0:\r\n evenCount += 1\r\n savedEvenIndex = i + 1\r\n else:\r\n oddCount += 1\r\n savedOddIndex = i + 1\r\nif evenCount < oddCount:\r\n print(savedEvenIndex)\r\nelse:\r\n print(savedOddIndex)", "n = input()\r\nnbrs = list(map(int, input().split()))\r\nchet = []\r\nnechet = []\r\n\r\nfor i in nbrs:\r\n if i % 2 == 0:\r\n chet.append(i)\r\n else:\r\n nechet.append(i)\r\n\r\nif len(chet) == 1:\r\n print(nbrs.index(chet[0]) + 1)\r\nelif len(nechet) == 1:\r\n print(nbrs.index(nechet[0]) + 1)", "n = int(input())\r\niq = list(map(int,input().split()))\r\neven = odd = cnt = 0\r\nfor x in range(n):\r\n if iq[x]%2:\r\n cnt-=1\r\n odd = x+1\r\n else :\r\n cnt+=1\r\n even = x+1\r\n\r\nif cnt > 0: print(odd)\r\nelse : print(even)\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\nodd=0\r\noddno=[ ]\r\neven=0\r\ne=[ ]\r\nunique=[ ]\r\nfor i in ar:\r\n if(i%2==0):\r\n even+=1\r\n e.append(i)\r\n else: \r\n odd+=1\r\n oddno.append(i)\r\n if(ar.count(i)==1):\r\n unique.append(i)\r\nif(odd==1):\r\n print(ar.index(min(oddno))+1)\r\nelif(even==1):\r\n print(ar.index(min(e))+1)\r\nif(even==n or odd==n):\r\n if(len(set(ar))==2):\r\n print(ar.index(min(unique))+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncount=0\r\ncounting=0\r\nfor i in l:\r\n if(i%2==0):\r\n count+=1\r\n k=l.index(i)+1\r\nif(count==1):\r\n print(k)\r\nfor i in l:\r\n if(i%2!=0):\r\n counting+=1\r\n m=l.index(i)+1\r\nif(counting==1):\r\n print(m)\r\n", "a=int(input())\r\nx=list(map(int,input().split()))\r\ns=''\r\ns1=''\r\nfor i in range(a):\r\n if x[i]%2==0:\r\n s=s+str(x[i])\r\n else:\r\n s1=s1+str(x[i])\r\nif len(s)>len(s1):\r\n print(x.index(int(s1))+1)\r\nelse:\r\n print(x.index(int(s))+1)\r\n", "n = int(input())\r\nnums = [int(i) for i in input().split()]\r\n\r\nchet, nechet = 0, 0\r\nfor i in nums:\r\n if i % 2 == 0:\r\n chet += 1\r\n else:\r\n nechet += 1\r\n\r\ncheck = 0 if chet > nechet else 1\r\nfor i, el in enumerate(nums):\r\n if el % 2 != check:\r\n print(i + 1)\r\n break\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\neid=0\r\noid=0\r\necount=0\r\nocount=0\r\nfor i in range(0,n):\r\n if(l[i]%2==0):\r\n eid=i\r\n ecount+=1\r\n else:\r\n oid=i\r\n ocount+=1\r\nif(ecount==1):\r\n print(eid+1)\r\nelse:\r\n print(oid+1)", "n = int(input())\r\neven = 0\r\nlastodd = 0\r\nlasteven = 0\r\narr = list(map(int, input().split()))\r\nfor i in range(0,n):\r\n\tif arr[i]%2==0:\r\n\t\teven += 1\r\n\t\tlasteven = i+1\r\n\r\n\telse:\r\n\t\teven -=1\r\n\t\tlastodd = i+1\r\n\r\nif even>0:\r\n\tprint(lastodd)\r\nelse:\r\n\tprint(lasteven)", "n=input()\r\nec=0\r\noc=0\r\nindex=0\r\noIndex=0\r\nm =input().split()\r\nfor x in range(len(m)):\r\n if int(m[x])%2==0:\r\n ec+=1\r\n index = x\r\n else:\r\n oc+=1\r\n oIndex=x\r\nif ec ==1:\r\n print(index+1)\r\nelse:\r\n print(oIndex+1)\r\n", "n = input()\r\nn = [int(i) % 2 for i in input().split()]\r\nif n.count(1) == 1:\r\n print(n.index(1) + 1)\r\nelse:\r\n print(n.index(0) + 1)", "n = int(input())\r\nx = list(map(int,input().split()))\r\n\r\na = [i%2 for i in x]\r\nd = (0,1)[a.count(0)>a.count(1)]\r\nprint(a.index(d)+1)", "def even(a):\r\n count = 0\r\n for i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n count += 1\r\n x = i\r\n return (count,x)\r\ndef odd(a):\r\n count = 0\r\n for i in range(len(a)):\r\n if a[i] % 2 == 1:\r\n count += 1\r\n x = i\r\n return (count,x)\r\nn = int(input())\r\na = [int(s) for s in input().split()]\r\nodd_ = odd(a)\r\neven_ = even(a)\r\nif odd_[0] == 1:\r\n print(odd_[1]+1)\r\nelse:\r\n print(even_[1]+1)", "x= int(input())\r\nlistOFNumbers=input()\r\nlistOFNumbers=listOFNumbers.split(\" \")\r\nlistOFNumbers=[int(i) for i in listOFNumbers]\r\ncountEven=0\r\nindexEven=0\r\ncountOdd=0\r\nindexOdd=0\r\nfor i in range(0,len(listOFNumbers)):\r\n if(listOFNumbers[i]%2==0):\r\n countEven+=1\r\n indexEven=i\r\n else:\r\n countOdd += 1\r\n indexOdd = i\r\nif(countOdd>countEven):\r\n print(indexEven+1)\r\nelse:\r\n print(indexOdd+1)", "n = int(input())\n\narr = list(map(int,input().split()))\n\n\nodd,even = 0,0\noddarr,evenarr = [],[]\nfor i in range(n):\n\n if arr[i]%2!=0:\n odd+=1\n oddarr.append(i+1)\n\n else:\n even+=1\n evenarr.append(i+1)\n\n\nif odd==1:\n print(oddarr[0])\n\nelse:\n print(evenarr[0])\n", "n=input()\r\nnumbers=list(map(int,input().split()))\r\nodds=[]\r\nevens=[]\r\nfor i in numbers:\r\n if i%2==0:\r\n evens.append(i)\r\n else:\r\n odds.append(i)\r\nif len(odds)==1:\r\n print(numbers.index(odds[0])+1)\r\nelse:\r\n print(numbers.index(evens[0])+1)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=[]\r\nn=[]\r\nfor i in range(len(a)):\r\n\tif a[i]%2==0:\r\n\t\tm.append(i+1)\r\n\telse:\r\n\t\tn.append(i+1)\r\nif len(m)==1:\r\n\tprint(m[0])\r\nelse:\r\n\tprint(n[0])", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\na = 0; b = 0; n1 = 0; n2 = 0\r\nfor i in arr:\r\n if i%2:\r\n b+=1; n1=i;\r\n else:\r\n a+=1; n2=i;\r\nif a==1:\r\n print(arr.index(n2) + 1)\r\nelse:\r\n print(arr.index(n1) + 1)\r\n", "import sys,math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\na=inp()\r\nb=inlt()\r\nvec=[]\r\nodd=0\r\neven=0\r\nfor i in range(a):\r\n if b[i]%2==1:\r\n odd+=1\r\n vec.append(b[i]%2)\r\n else:\r\n even+=1\r\n vec.append(b[i]%2)\r\nif odd>even:\r\n print(vec.index(0)+1)\r\nelse:\r\n print(vec.index(1)+1)\r\n\r\n", "N=int(input())\n\nA=list(map(int,input().split()))\n\nx=A[0]%2\nm=0\nfor i in range(1,N):\n if(A[i]%2!=x):\n m=i\nif(A[1]%2!=x and m!=1):\n print(1)\nelse:\n print(m+1)\n", "n = int(input())\nlst = [int(x) for x in input().split(\" \")]\n\neven = 0\nodd = 0\n\nfor i in range(n):\n if lst[i] % 2 == 0:\n even += 1\n evenNum = i+1\n else:\n odd += 1\n oddNum = i+1\n\nif even == 1:\n print(evenNum)\nelse:\n print(oddNum)", "input()\r\n\r\narr = list(map(int,input().split()))\r\n\r\neve = []\r\nodd = []\r\n\r\nfor x in range(len(arr)):\r\n if arr[x]%2==0:\r\n eve.append(x)\r\n else:\r\n odd.append(x)\r\n \r\n if len(eve) > 1 and len(odd) > 0:\r\n print(odd[0]+1)\r\n break\r\n elif len(odd) > 1 and len(eve) > 0:\r\n print(eve[0]+1)\r\n break", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nblank=[]\r\nfor i in num:\r\n if i%2==0:\r\n blank.append(0)\r\n else:\r\n blank.append(1)\r\nif blank.count(0)>blank.count(1):\r\n print(blank.index(1)+1)\r\nelse:\r\n print(blank.index(0)+1)", "# https://codeforces.com/problemset/problem/25/A\n\ndef helper() -> int:\n input()\n\n values = [int(s) for s in input().split(\" \")]\n odd_count = 0\n even_count = 0\n odd_index = -1\n even_index = -1\n\n for i in range(len(values)):\n if values[i] % 2 == 0:\n even_index = i + 1\n even_count += 1\n else:\n odd_index = i + 1\n odd_count += 1\n\n if odd_count > 1 and even_index >= 0:\n return even_index\n if even_count > 1 and odd_index >= 0:\n return odd_index\n\n\nprint(helper())\n", "n = int(input())\nnums = list(map(int,input().split()))\nodds = 0\nx , y = 0 , 0\nfor i in range(n):\n\tif nums[i] % 2 == 0:\n\t\tx = i + 1\n\telse:\n\t\todds += 1\n\t\ty = i + 1\n\nif odds == 1:\n\tprint(y)\nelse:\n\tprint(x)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n b+=1\r\nif b==1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n c=i+1\r\n print(c)\r\nelse:\r\n for i in range(n):\r\n if a[i]%2!=0:\r\n c=i+1\r\n print(c)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = []\r\nd = []\r\nfor i in range(a):\r\n if b[i] % 2 == 0:\r\n c.append(i + 1)\r\n else:\r\n d.append(i + 1)\r\nif len(c) > len(d):\r\n print(*d)\r\nelse:\r\n print(*c)\r\n", "n = int(input())\r\na=[int(x) for x in input().split()]\r\nb=[]\r\nc=[]\r\nfor i in range(n):\r\n if(a[i]%2==0 ):\r\n b.append(i)\r\n elif(a[i]%2!=0):\r\n c.append(i)\r\n\r\nif(len(b)==1):\r\n print(b[0]+1)\r\nelif(len(c)==1):\r\n print(c[0]+1)\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\na=input().split()\r\neven=[]\r\nodd=[]\r\nfor i in range (n) :\r\n a[i] = int(a[i])\r\n if a[i]%2==0 :\r\n even.append(i+1)\r\n else :\r\n odd.append(i+1)\r\nif len(even)==1 :\r\n print(even[0])\r\nelse :\r\n print(odd[0])\r\n", "n = int(input())\nl = [int(i) for i in input().split()]\nevenI = 0\noddI = 0\ncontE = 0\ncontO = 0\nfor i in range(n):\n if(l[i] % 2 == 0):\n evenI = i\n contE += 1\n else:\n oddI = i\n contO += 1\n\nif(contE == 1):\n print(evenI + 1)\nelif(contO == 1):\n print(oddI + 1)\n \t\t \t \t \t\t\t \t\t \t \t\t\t", "n=int(input())\r\nlist=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n if i==0:\r\n if (list[i]+list[1])%2==1 and (list[i]+list[2])%2==1:\r\n print(i+1)\r\n elif i==1:\r\n if (list[i]+list[0])%2==1 and (list[i]+list[2])%2==1:\r\n print(i+1)\r\n else:\r\n if (list[i]+list[0])%2==1 and (list[i]+list[1])%2==1:\r\n print(i+1)", "a=input()\r\nb=input().split()\r\np=0\r\nq=0\r\nn=1\r\n\r\nfor x in b:\r\n if int(x)%2>0:\r\n p+=1\r\n else:\r\n q+=1\r\n \r\n\r\nif p==1:\r\n for x in b:\r\n if int(x)%2>0:\r\n print(n)\r\n else:\r\n n+=1\r\nelse:\r\n for x in b:\r\n if int(x)%2==0:\r\n print(n)\r\n else:\r\n n+=1", "\r\n\r\nn=int(input())\r\nb=map(int,input().split())\r\ncount=0\r\na=[]\r\nfor i in b:\r\n if i%2==0:\r\n count+=1\r\n a.append(i%2)\r\n else:\r\n count-=1\r\n a.append(i%2)\r\nif count>0:\r\n print(a.index(1)+1)\r\nelse:\r\n print(a.index(0)+1)\r\n", "def returnOdd(li):\n i=0;co=0;ce=0;cei=0;coi=0\n while(i<len(li)):\n if li[i]%2==1:\n co+=1\n coi=i+1\n else:\n ce+=1\n cei=i+1\n \n i+=1\n return cei if ce==1 else coi\nn=int(input())\nli=list(map(int,input().split(\" \")))\nprint(returnOdd(li))\n", "n = input()\r\nmy_list = list(map(int, input().split(\" \")))\r\neven_counter = 0\r\nodd_counter = 0\r\ni = 0\r\nwhile i < len(my_list):\r\n if int(my_list[i]) % 2 == 0:\r\n even_counter += 1\r\n i += 1\r\n else:\r\n odd_counter += 1\r\n i += 1\r\nif odd_counter > even_counter:\r\n var_odd_or_even = \"even\"\r\nelse: \r\n var_odd_or_even = \"odd\"\r\ni = 0\r\nwhile i < len(my_list):\r\n if var_odd_or_even == \"odd\":\r\n if int(my_list[i]) % 2 != 0:\r\n index = i\r\n break\r\n else:\r\n i += 1\r\n elif var_odd_or_even == \"even\":\r\n if int(my_list[i]) % 2 == 0:\r\n index = i\r\n break\r\n else:\r\n i += 1\r\nprint(index + 1)", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\neven = 0\r\nodd = 0\r\ne_count = 0\r\nfor i,x in enumerate(arr):\r\n if x%2 == 0:\r\n even = i+1\r\n e_count+=1\r\n else:\r\n odd = i+1\r\nif e_count > 1:\r\n print(odd)\r\nelse:\r\n print(even)", "n = int(input())\nlist1 = list(map(int, input().split()))\nif (list1[0]+list1[1]) % 2 != 0:\n if (list1[1]+list1[2]) % 2 == 0:\n print(\"1\")\n else:\n print(\"2\")\nelse:\n for i in range(n):\n if (list1[i]+list1[i+1]) % 2 != 0:\n print(i+2)\n break\n\n\t\t\t \t \t\t \t \t \t \t\t \t \t\t \t \t", "n = int(input())\r\nlis = [int(x) for x in input().split()]\r\ndef is_odd(n):\r\n if n % 2 != 0:\r\n return True\r\n else:\r\n return False\r\n\r\ndef is_even(n):\r\n if n % 2 != 0:\r\n return False\r\n else:\r\n return True\r\n\r\noddlis = list(filter(is_odd,lis))\r\nevenlis = list(filter(is_even,lis))\r\nif len(lis)-len(oddlis) == 1:\r\n print(lis.index(evenlis[0])+1)\r\nelse:\r\n print(lis.index(oddlis[0])+1)", "n = int(input()) \r\nara = list(map(int, input().split(\" \")))\r\n\r\nevenKount = 0\r\noddKount = 0\r\n\r\nfor i in range(n):\r\n if (ara[i] & 1): oddKount += 1\r\n else: evenKount += 1\r\n\r\n# print(oddKount, evenKount, \"haha\")\r\n\r\nif oddKount == 1:\r\n for i in range(n):\r\n if (ara[i] & 1):\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if not (ara[i] & 1):\r\n print(i+1)\r\n break", "n=int(input())\r\nc=list(map(int, input().split()))\r\nkch,nch,nnch=0,0,0\r\nfor i in range(n):\r\n if c[i]%2==0:\r\n nch=i\r\n kch+=1\r\n else:\r\n nnch=i \r\nif kch==1:\r\n print(nch+1)\r\nelse:\r\n print(nnch+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nodd_count = 0\r\neven_count = 0\r\nlast_odd = None\r\nlast_even = None\r\n\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n even_count += 1\r\n last_even = i + 1\r\n else:\r\n odd_count += 1\r\n last_odd = i + 1\r\n\r\nif odd_count == 1:\r\n print(last_odd)\r\nelse:\r\n print(last_even)\r\n", "n = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nodd = []\r\neven = []\r\nfor i in range(n):\r\n x = arr[i]\r\n if x % 2 == 0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\n\r\nif len(odd) < len(even):\r\n print(odd[0]+1)\r\nelse:\r\n print(even[0]+1)\r\n", "n = int(input())\r\ny = list(map(int, input().split()))\r\n\r\nodd_count = sum([1 for num in y if num % 2 != 0])\r\neven_count = sum([1 for num in y if num % 2 == 0])\r\n\r\nif odd_count > even_count:\r\n for i in range(n):\r\n if y[i] % 2 == 0:\r\n print(i + 1) \r\n break\r\nelse:\r\n for i in range(n):\r\n if y[i] % 2 != 0:\r\n print(i + 1) \r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\ns1=0\r\ns2=0\r\nse=[]\r\nsu=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n s2+=1\r\n se.append(i+1)\r\n else:\r\n s1+=1\r\n su.append(i+1)\r\nif s2<s1:\r\n print(*se)\r\nelse:\r\n print(*su)", "#-------------------------------------------------------------------------------\r\n# Name: module1\r\n# Purpose:\r\n#\r\n# Author: vayun\r\n#\r\n# Created: 05/06/2022\r\n# Copyright: (c) vayun 2022\r\n# Licence: <your licence>\r\n#-------------------------------------------------------------------------------\r\n\r\nimport sys\r\nimport time\r\nimport math\r\nimport random\r\n\r\ndef evenness(a):\r\n o = 0\r\n e = 0\r\n for i in range(3):\r\n if a[i] % 2 == 1:\r\n o += 1\r\n else:\r\n e += 1\r\n for i in range(len(a)):\r\n if o <= 1 and a[i] % 2 == 1:\r\n return i + 1\r\n if e <= 1 and a[i] % 2 == 0:\r\n return i + 1\r\n\r\n(n) = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(evenness(a))", "n=int(input())\r\ndef odd(l):\r\n return([x for x in l if x%2==1])\r\ndef even(l):\r\n return([x for x in l if x%2==0])\r\nl=[int(x) for x in input().split()]\r\nif len(odd(l))==1:\r\n print(l.index(odd(l)[0])+1)\r\nelse:\r\n print(l.index(even(l)[0])+1)\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nfor t in range(1):\r\n n=int(input())\r\n arr=get_list()\r\n even=0\r\n for i in arr:\r\n if i%2==0:\r\n even+=1\r\n if even==1:\r\n for j in range(n):\r\n i=arr[j]\r\n if i%2==0:\r\n print(j+1)\r\n break\r\n else:\r\n for j in range(n):\r\n i=arr[j]\r\n if i%2==1:\r\n print(j+1)\r\n break", "x=int(input())\r\ny=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nfor i in range(3):\r\n test=y[i]%2\r\n if test==0:\r\n even+=1\r\n else:\r\n odd+=1\r\nif even<odd:\r\n for i in y:\r\n if i%2==0:\r\n print(y.index(i)+1)\r\n break\r\nelse:\r\n for i in y:\r\n if i%2==1:\r\n print(y.index(i)+1)\r\n break\r\n\r\n\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(3):\r\n if (b[i])%2==0:\r\n c=c+1\r\nif c>=2:\r\n for i in b:\r\n if i%2!=0:\r\n print(b.index(i)+1)\r\nelse:\r\n for i in b:\r\n if i%2==0:\r\n print(b.index(i)+1)", "import sys\r\nnumbers = []\r\nfor i, line in enumerate(sys.stdin):\r\n if i == 1:\r\n numbers = [int(x) for x in line.split()]\r\n\r\n\r\neven = lambda x : x % 2==0\r\nodd = lambda x : x % 2==1\r\nfunc = None\r\na,b,c = numbers[0], numbers[1] , numbers[-1]\r\n\r\nif even(a)+even(b)+even(c)>1:\r\n func = odd\r\nelse:\r\n func = even\r\n\r\n\r\nfor i,v in enumerate(numbers):\r\n if func(v):\r\n print(i+1)\r\n break", "n = int(input())\r\nnums = [ int(num) for num in input().split()]\r\ncountEven = 0\r\ncountOdd = 0\r\nfor num in nums:\r\n if num%2 == 0:\r\n countEven+=1\r\n else:\r\n countOdd += 1\r\nfor i,num in enumerate(nums):\r\n if countEven == 1 and num%2 == 0:\r\n print(i+1)\r\n break\r\n elif countOdd == 1 and num%2 == 1:\r\n print(i+1)\r\n break\r\n ", "if __name__ == '__main__':\n n = int(input())\n aux = input().split()\n\n for i in range(n):\n aux[i] = int(aux[i]) % 2\n\n if aux.count(1) > 1:\n print(aux.index(0) + 1)\n else:\n print(aux.index(1) + 1)\n\t\t \t \t\t \t\t \t\t \t \t\t\t\t \t\t\t\t\t\t", "n=int(input())\r\nc=input().split()\r\nc=list(map(int,c))\r\nu=[]\r\nfor x in c:\r\n m=x%2\r\n u.append(m)\r\nK=sum(u)\r\nif K==1:\r\n for i in range(n):\r\n if u[i]==1:\r\n print(i+1)\r\nelse:\r\n for i in range(n):\r\n if u[i]==0:\r\n print(i+1)", "inp = input()\r\narray = input().split(\" \")\r\n\r\nfor i in range(len(array)):\r\n array[i] = int(array[i]) % 2\r\n\r\nsummation = sum(array)\r\nif summation == 1:\r\n print(array.index(1)+1)\r\nelse:\r\n print(array.index(0) + 1)\r\n\r\n", "def main():\r\n n = int(input())\r\n liste = [int(x) for x in input().split()]\r\n roger = liste[len(liste)-1]%2\r\n mm = liste[0]%2\r\n if roger==mm:\r\n for loop in range(len(liste)):\r\n if liste[loop]%2 != mm:\r\n return loop+1\r\n else:\r\n rr = liste[1]%2\r\n if roger == rr:\r\n return 1\r\n elif rr == mm:\r\n return len(liste)\r\nprint(main())", "x=int(input())\r\ny=list(map(int,input().split()))\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nfor i in y:\r\n if i % 2==0:\r\n a+=1\r\n elif i% 2 !=0:\r\n b+=1\r\nfor p , q in enumerate(y,start=1):\r\n if q %2==0:\r\n c=p\r\n elif q%2!=0:\r\n d=p\r\nif a > b :\r\n print(d)\r\nelse:\r\n print(c)\r\n ", "n = int(input())\r\nL = list(map(int,input().strip().split()))\r\nN = []\r\nfor i in L:\r\n temp = i%2\r\n N = N + [temp]\r\nt = (N[0] and N[1]) or (N[1] and N[2]) or (N[0] and N[2])\r\n\r\nfor i in range(1,n+1):\r\n if N[i-1]!= t:\r\n print(i)\r\n break", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist2=[]\r\nlist3=[]\r\nfor i in range(0,n):\r\n if(list1[i]%2==0):\r\n list2.append(i)\r\n else:\r\n list3.append(i)\r\nif len(list2)==1:\r\n print(list2[0]+1)\r\nelse:\r\n print(list3[0]+1)\r\n", "n = int(input())\r\nnum_list = [int(x) for x in input().split()]\r\nsum_list = sum(num_list)\r\nremainder = 0\r\neven_count = 0\r\nodd_count = 0\r\n\r\nfor i in range (0,3):\r\n if num_list[i]%2 ==0:\r\n even_count +=1\r\n else:\r\n odd_count +=1\r\nif even_count >=3:\r\n remainder = 1\r\nelif odd_count >=3:\r\n remainder = 0\r\nelif even_count ==2:\r\n for i in range (3):\r\n if num_list[i] %2 ==1:\r\n print(i+1)\r\n break\r\nelif odd_count ==2:\r\n for i in range (3):\r\n if num_list[i] %2 ==0:\r\n print(i+1)\r\n break\r\nif even_count >=3 or odd_count >=3:\r\n for i in range (3,n):\r\n if num_list[i]%2 == remainder:\r\n print(i+1)\r\n break\r\n", "from pdb import line_prefix\r\n\r\n\r\ncases = int(input())\r\narr = []\r\nline = input().split()\r\nfor x in line:\r\n arr.append(int(x))\r\nodds = 0\r\nevens = 0\r\nfor x in range(3):\r\n if (arr[x] % 2 == 0):\r\n evens += 1\r\n else:\r\n odds += 1\r\n\r\nfor x in range(cases):\r\n if (evens > odds): # evens case\r\n if (arr[x] % 2 != 0):\r\n print(x+1)\r\n \r\n else:\r\n if (arr[x] % 2 == 0):\r\n print(x+1)\r\n ", "from sys import stdin,stdout\r\nfrom math import ceil,floor\r\nfrom collections import deque\r\ninp = stdin.readline\r\nout = stdout.write\r\n\r\nn = int(inp().strip())\r\na = list(map(int,inp().strip().split()))\r\no,e=[],[]\r\nfor i in a:\r\n\tif i%2==0:\r\n\t\te.append(i)\r\n\telse:\r\n\t\to.append(i)\r\nif len(o)==1:\r\n\tout(str(a.index(o[0])+1))\r\nelse:\r\n\tout(str(a.index(e[0])+1))", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nd = {}\r\neven = 0\r\nodd = 0\r\n\r\nfor num in nums:\r\n if num not in d:\r\n d[num % 2] = num \r\n if num % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nif even > odd:\r\n ans = nums.index(d[1]) + 1\r\n print(ans)\r\nelse:\r\n ans = nums.index(d[0]) + 1\r\n print(ans)\r\n", "lengthList = int(input())\r\nnumbers = input().split()\r\ncountEven = 0\r\ncountOdd = 0\r\n \r\nfor x in range(lengthList):\r\n if int(numbers[x])%2 == 0:\r\n firstOrLastEven = (int(x)+1)\r\n countEven += 1\r\n else:\r\n firstOrLastOdd = (int(x)+1)\r\n countOdd += 1\r\n \r\nif countEven > countOdd:\r\n print(firstOrLastOdd)\r\nelse:\r\n print(firstOrLastEven)", "n = int(input())\r\nnums = input().split()\r\nremainder = []\r\nfor i in range(n):\r\n remainder.append(int(nums[i]) % 2)\r\nif remainder.count(1) > remainder.count(0):\r\n print(remainder.index(0) + 1)\r\nelse:\r\n print(remainder.index(1) + 1)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n a[i]=-1\r\n else:\r\n a[i]=1\r\nif sum(a)<0:\r\n for i in range(n):\r\n if a[i]==1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i] == -1:\r\n print(i + 1)\r\n break\r\n", "def Solve(n, text):\r\n counte = 0\r\n counto = 0\r\n\r\n for i in text:\r\n if i % 2 == 1:\r\n counto += 1\r\n else:\r\n counte += 1\r\n\r\n if counte == 1:\r\n for i in range(len(text)):\r\n if text[i] % 2 == 0:\r\n return i + 1\r\n elif counto == 1:\r\n for i in range(len(text)):\r\n if text[i] % 2 == 1:\r\n return i + 1\r\n\r\n\r\nn = int(input())\r\ntext = input().split()\r\nlist = [int(i) for i in text]\r\nval = Solve(n, list)\r\nprint(val)\r\n", "input()\r\nnums=list(map(int,input().split()))\r\ne = [x for x in nums if x % 2 == 0]\r\no = [x for x in nums if x % 2 != 0]\r\nif len(e) > len(o):\r\n print(nums.index(o[0])+ 1)\r\nelse:\r\n print(nums.index(e[0])+1)", "n = int(input())\r\nList = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nx, y = 0, 0\r\nfor i in range(n) :\r\n if List[i] % 2 == 0:\r\n even += 1\r\n x = i\r\n else :\r\n odd += 1\r\n y = i\r\nif even == 1 :\r\n print(x + 1)\r\nelif odd == 1:\r\n print(y + 1)", "num=int(input())\r\nl=[]\r\nlst=list(map(int,input().split()))\r\nfor i in range(len(lst)):\r\n if lst[i]%2==0:\r\n l.append(0)\r\n else:\r\n l.append(1)\r\n\r\nif l.count(0)>l.count(1):\r\n for i in range(len(lst)):\r\n if lst[i]%2==1:\r\n print(i+1)\r\nelse:\r\n for i in range(len(lst)):\r\n if lst[i]%2==0:\r\n print(i+1)", "n=int(input())\r\na=[]\r\nb=[]\r\narr=list(map(int,input().strip().split()))[:n]\r\nfor i in range(n):\r\n if arr[i]%2!=0:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nif len(a)==1:\r\n print(a[0]+1)\r\nif len(b)==1:\r\n print(b[0]+1)\r\n\r\n\r\n\r\n", "N = int(input())\nnums = list(map(int, input().split()))\n\n\necount = 0\nocount = 0\nfor each in nums:\n if each % 2 == 0:\n ecount += 1 \n else:\n ocount += 1\n\nif ecount > ocount:\n for i in range(N):\n if nums[i] % 2 == 1:\n print(i + 1)\nelse:\n for i in range(N):\n if nums[i] % 2 == 0:\n print(i + 1)\n\n\n \n\n \n", "# num = int(input())\r\n# lst = input()\r\n# counter = 0\r\n# test=False\r\n# lst = [int(i) for i in lst.split()]\r\n# while len(lst)>0:\r\n# if len(lst) == 1:\r\n# counter+=1\r\n# break\r\n#\r\n# for i in range(1,len(lst)):\r\n# if lst[i] + lst[0] == 4:\r\n# counter+=1\r\n# lst.remove(lst[i])\r\n# lst.remove(lst[0])\r\n#\r\n# test=True\r\n# break\r\n# if not test:\r\n# counter+=1\r\n# lst.remove(lst[0])\r\n# test=False\r\n#\r\n# print(counter)\r\n##########################\r\nnum = int(input())\r\nlst = input()\r\nlstEve = []\r\nlstOdd = []\r\nlst = [int(i) for i in lst.split()]\r\nfor i in lst:\r\n if i%2==0:\r\n lstEve.append(i)\r\n else:\r\n lstOdd.append(i)\r\nif len(lstEve)==1:\r\n print(lst.index(lstEve[0])+1)\r\nelse:\r\n print(lst.index(lstOdd[0])+1)\r\n", "from asyncio import events\n\n\ndef f():\n _ = input()\n nums = [int(x) for x in input().split()]\n odd_cnt = 0\n last_odd_idx = -1\n even_cnt = 0\n last_even_idx = -1\n for i in range(len(nums)):\n x = nums[i]\n if x % 2 == 0:\n even_cnt += 1\n last_even_idx = i\n else:\n odd_cnt += 1\n last_odd_idx = i\n if odd_cnt == 1:\n return last_odd_idx + 1\n return last_even_idx + 1\n\n\nprint(f())\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\nchet = []\r\nnchet = []\r\nfor i in range(n):\r\n if numbers[i]%2 == 0:\r\n chet.append(numbers[i])\r\n else:\r\n nchet.append(numbers[i])\r\nif len(chet) == 1:\r\n print(numbers.index(chet[0]) + 1)\r\nelif len(nchet) == 1:\r\n print(numbers.index(nchet[0]) + 1)\r\n", "n=int(input())\nl=list(map(int,input().split()))\nl1=[]\nl2=[]\nfor i in range(len(l)):\n if l[i]%2==0:\n l1.append(i+1)\n else:\n l2.append(i+1)\nif len(l1)==1:\n print(*l1)\nelse:\n print(*l2)\n", "n=int(input())\r\nl=list(map(lambda x: int(x)&1,input().split()))\r\na=l.count(0)\r\nb=l.count(1)\r\nif a>b:\r\n\tprint(l.index(1)+1)\r\nelse:\r\n\tprint(l.index(0)+1)\r\n\t", "n = int(input())\r\narr = list(map(int,input().split()))\r\ng = 1\r\nm,e = [],[]\r\nfor i in arr:\r\n if i % 2 == 0:\r\n m.append(g)\r\n else:\r\n e.append(g)\r\n g+=1\r\nif len(m) == 1:\r\n print(*m)\r\nelse:\r\n print(*e)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nd=0\r\nfor i in range(n):\r\n if(l[i]%2==1):\r\n c+=1\r\n c1=i\r\n else:\r\n d+=1\r\n d1=i\r\nif(c==1):\r\n print(c1+1)\r\nelse:\r\n print(d1+1)", "\r\nn=int(input())\r\na=list(int(i) for i in input().split())\r\njudge=list(a[i]%2 for i in range(3))\r\nif judge.count(0)>judge.count(1):\r\n\ttest=1\r\nelse:\r\n\ttest=0\r\nfor i in range(n):\r\n\tif a[i]%2==test:\r\n\t\tprint(i+1)\r\n\t\tbreak", "n = int(input())\n\ndata = input()\n\narr = data.split(\" \")\n\nstarting = int(arr[0]) % 2\nres = 0\nfor i in range(n-1):\n if int(arr[i]) % 2 != starting:\n if int(arr[i]) % 2 == int(arr[i+1]) % 2:\n res = i\n break\n else:\n res = i+1\n break\nif res==0:\n res=n\nprint(res)\n\n \t \t\t \t\t \t\t \t \t\t\t \t\t \t\t", "\r\n# xqcL\r\nimport sys,math\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nminput = lambda: map(int,input().split())\r\nlinput = lambda: list(map(int,input().split()))\r\n\r\ndef solution():\r\n n = int(input())\r\n a = linput()\r\n oc=0\r\n ec=0\r\n oq=0\r\n eq=0\r\n for i in range(n):\r\n if a[i]%2:\r\n oc+=1\r\n oq=i+1\r\n else:\r\n ec+=1\r\n eq=i+1\r\n print(eq if ec==1 else oq)\r\n\r\n \r\n \r\n\r\ntestcases= 1\r\n\r\n\r\nfor testcase in range(testcases):\r\n solution()\r\n", "n = int(input())\r\nnumbers = input().split()\r\ncountere = 0\r\ncountero = 0\r\nlefte = 0\r\nlefto = 0\r\nfor i in range(n):\r\n if int(numbers[i]) % 2 == 0:\r\n countere += 1\r\n lefte = i\r\n else:\r\n countero += 1\r\n lefto = i\r\nif countere == 1:\r\n print(lefte+1)\r\nelse:\r\n print(lefto+1)\r\n ", "n = int(input())\r\nnum = map(int,input().split())\r\nnum = list(num)\r\nindexeven = 0\r\neven = 0\r\nodd = 0\r\nindexodd = 0\r\nfor i in range(n):\r\n if num[i] % 2 == 0:\r\n even += 1\r\n indexeven = i\r\n else:\r\n odd += 1\r\n indexodd = i\r\n \r\nif even > odd:\r\n print(indexodd + 1)\r\nelse:\r\n print(indexeven + 1)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[]\r\ns=[]\r\nfor i in range(0,n):\r\n if l[i] % 2 == 0 :\r\n k.append(i)\r\n else:\r\n s.append(i)\r\nif len(k)==1:\r\n print(k[0]+1)\r\nif len(s)==1:\r\n print(s[0]+1)", "n = int(input())\r\na= [int(i) for i in input().split()]\r\n\r\no= sum(i & 1 for i in a)\r\nfor i, v in enumerate(a):\r\n if (o!= 1 and ~v & 1) or (o== 1 and v & 1):\r\n print(i + 1)\r\n break", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Dec 22 09:05:35 2019\r\n\r\n@author: sihan\r\n\"\"\"\r\n\r\nn=int(input())\r\nD=[int(i)%2 for i in input().split()]\r\nif D.count(0)>1:\r\n print(D.index(1)+1)\r\nelse:\r\n print(D.index(0)+1)", "n=int(input())\r\nnumset=[int(x) for x in input().split()]\r\nmodset=[]\r\nfor number in numset:\r\n modset.append(number%2)\r\nif modset.count(1)==1:\r\n for i in range(n):\r\n if numset[i]%2==1:\r\n print(i+1)\r\nif modset.count(0)==1:\r\n for i in range(n):\r\n if numset[i]%2==0:\r\n print(i+1)\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\ny=0\r\nz=0\r\nfor x in range(n):\r\n if arr[x]%2==0:\r\n y=x\r\n even.append(arr[x])\r\n else:\r\n z=x\r\n odd.append(arr[x])\r\nif len(even)==1:\r\n print(y+1)\r\nelif len(odd)==1:\r\n print(z+1)\r\n", "x=int(input())\r\ns=input()\r\ns=s.split()\r\nl=[]\r\nfor i in s:\r\n if i.isdigit():\r\n l.append(int(i))\r\nc1=0\r\nc2=0\r\nl1=[]\r\nl2=[]\r\nfor i in range(len(l)):\r\n if l[i]%2==1:\r\n c1+=1\r\n l1.append(i)\r\n else:\r\n c2+=1\r\n l2.append(i)\r\n\r\n\r\nif len(l1)==1:\r\n print(l1[0]+1)\r\nelse:\r\n print(l2[0]+1)\r\n", "n=int(input())\r\nL=[int(x) for x in input().split()]\r\nsom=0\r\ni=0\r\nif L[0]%2!=L[1]%2 and L[1]%2==L[2]%2:\r\n print(1)\r\nelse:\r\n while (som%2==0) and (i<n-1):\r\n som=L[i]+L[i+1]\r\n i+=1 \r\n print(i+1)", "n=int(input())\nm=list(map(int,input().split()))\nou=0\nji=0\nfor i in range(len(m)):\n if m[i]%2==0:\n ou+=1\n k=i\n if m[i]%2==1:\n ji+=1\n t=i\nif ou==1:\n ans=k+1\nif ji==1:\n ans=t+1\nprint(ans)", "num=int(input())\r\nlist_=list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\nfor i in list_:\r\n if i%2==0:\r\n even.append(i)\r\n else:\r\n odd.append(i)\r\nif len(even)==1:\r\n k=even[0]\r\n print(list_.index(k)+1)\r\nelse:\r\n k=odd[0]\r\n print(list_.index(k)+1)", "n = int(input())\r\narr = input().split()\r\nodd=0\r\neven=0\r\ni1,i2=0,0\r\nfor i in range(len(arr)):\r\n if(int(arr[i])%2 == 0):\r\n even = even + 1\r\n i1 = i+1\r\n else:\r\n odd = odd+1\r\n i2 = i+1\r\nif(even == 1):\r\n print(i1)\r\nif(odd==1):\r\n print(i2)", "a = input()\r\nlst = input().split(\" \")\r\nlst = [int(lst[i]) for i in range(0, len(lst))]\r\nnum_of_even = 0\r\nnum_of_noteven = 0\r\nfor elem in lst:\r\n if elem % 2 == 0:\r\n num_of_even += 1\r\n else:\r\n num_of_noteven += 1\r\n\r\nif num_of_even == 1:\r\n for elem in lst:\r\n if elem % 2 == 0:\r\n print(lst.index(elem)+1)\r\n\r\nif num_of_noteven == 1:\r\n for elem in lst:\r\n if elem % 2 == 1:\r\n print(lst.index(elem)+1)\r\n\r\n", "n = int(input())\ns = input().split()\na = 0\nb = 0\nm = 0\nfor i in range(len(s)):\n if int(s[i])%2==0:\n a = a +1\n if a > 1:\n break\n else:\n b = b +1\n if b > 1:\n break\nif a > b:\n for j in range(len(s)):\n if int(s[j])%2==1:\n m = j +1\nelse:\n for k in range(len(s)):\n if int(s[k])%2==0:\n m = k +1\nprint(m)", "s = int(input())\r\na = input().split()\r\ne = 0\r\no = 0\r\nee = 0\r\noo = 0\r\nfor i in a:\r\n\tif int(i) % 2 == 0:\r\n\t\te += 1\r\n\t\tee = i\r\n\telse:\r\n\t\to += 1\r\n\t\too = i\r\n\t\t\r\nif e > o:\r\n\tprint(a.index(oo)+1)\r\nelse:\r\n\tprint(a.index(ee)+1)", "n = int(input())\r\nd = [int(x) for x in input().split()]\r\ne, o = [], []\r\nfor i in range(len(d)):\r\n if d[i] % 2==0:\r\n e.append(i+1)\r\n else:\r\n o.append(i+1)\r\n\r\nprint(e[0] if len(e)==1 else o[0])\r\n\r\n", "# LUOGU_RID: 101446324\nn, *a = map(int, open(0).read().split())\r\nb = sorted(a, key=lambda x: x&1)\r\nprint(a.index(b[-1] if b[0]&1 == b[1]&1 else b[0]) + 1)", "t = int(input())\r\na = list(map(int,input().split()))\r\nc1 = 0\r\nc2 = 0\r\no = []\r\ne = []\r\nfor i in range(len(a)):\r\n if(a[i]%2 == 0):\r\n c1 += 1\r\n e.append(i + 1)\r\n else:\r\n c2 += 1\r\n o.append(i + 1)\r\ns = [str(i) for i in o]\r\ng = [str(j) for j in e] \r\nif(c1 > c2):\r\n print(\"\".join(s))\r\nelse:\r\n print(\"\".join(g)) \r\n ", "n=int(input())\r\narr=list(map(int,input().split()))\r\neven=set()\r\nodd=set()\r\ncnt=1\r\nfor i in arr:\r\n p=(i,cnt)\r\n if i%2==0:\r\n even.add(p)\r\n else:\r\n odd.add(p)\r\n cnt=cnt+1\r\nif len(even)==1:\r\n print(list(even)[0][1])\r\nelse:\r\n print(list(odd)[0][1])", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n if arr[i]%2!=arr[i+1]%2 and arr[i]%2!=arr[i+2]%2:\r\n print(i+1)\r\n exit(0)\r\n elif i==0:\r\n if arr[i]%2!=arr[i+1]%2 and arr[i]%2!=arr[i-1]%2:\r\n print(i+1)\r\n exit(0)\r\n else:\r\n if arr[i]%2!=arr[i-1]%2 and arr[i]%2!=arr[i-2]%2:\r\n print(i+1)\r\n exit(0)\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\nn=0\r\nfor x in range(3):\r\n if b[x]%2!=0:\r\n n+=1\r\n else:\r\n c+=1\r\nif c>n:\r\n for x in range(a):\r\n if b[x]%2!=0:\r\n print(x+1)\r\nelse:\r\n for x in range(a):\r\n if b[x]%2==0:\r\n print(x+1)", "from sys import stdin, stdout\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef print(val):\r\n stdout.write(f'{val}\\n')\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\neven = []\r\nodd = []\r\nfor idx, val in enumerate(a):\r\n if val % 2 == 0:\r\n even.append(idx + 1)\r\n else:\r\n odd.append(idx + 1)\r\n if len(even) > 1 and len(odd) == 1:\r\n print(odd[-1])\r\n break\r\n elif len(odd) > 1 and len(even) == 1:\r\n print(even[-1])\r\n break\r\n", "\n# coding: utf-8\n\n# In[ ]:\n\n\ninput()\nb=map(int,input().split())\nz=i=0\ne=[0,0]\nfor x in b:\n i+=1\n z+=x%2\n e[x%2]=i\nprint(e[z==1])\n\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\ne=0\r\noi=0\r\no=0\r\noe=0\r\nfor i in range(n):\r\n if x[i]%2==0:\r\n e+=1\r\n oe=i\r\n else:\r\n o+=1\r\n oi=i\r\n if e>1 and o==1:\r\n print(oi+1)\r\n break\r\n if e==1 and o>1:\r\n print(oe+1)\r\n break\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nif b[0] % 2 == b[1] % 2:\r\n c = b[0] % 2\r\n for i in range (2, a):\r\n if b[i] % 2 != c:\r\n print(i + 1)\r\n break\r\nelse:\r\n if b[2] % 2 == b[0] % 2:\r\n print(2)\r\n else:\r\n print(1)", "n=int(input())\r\nnumbers=map(int,input().split())\r\nnumbers=list(numbers)\r\neven=odd=0\r\nfor number in numbers:\r\n \r\n if number%2==0:\r\n even+=1\r\n else:\r\n odd +=1\r\nif even==1:\r\n for x in numbers:\r\n if x%2==0:\r\n print(numbers.index(x)+1)\r\nelif odd==1:\r\n for x in numbers:\r\n if x%2!=0:\r\n print(numbers.index(x)+1)\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split(\" \")]\r\ndone=0\r\ndonech=[]\r\n\r\nif len(a)==3:\r\n\tfor x in range(len(a)):\r\n\t\tif a.count(a[x])==1:\r\n\t\t\tdonech.append(x)\r\n\tif len(donech)==1:\r\n\t\tprint(donech[0]+1)\r\n\t\tdone=1\r\n\r\ndiv=[]\r\ndivch=[]\r\ncomp=0\r\n\r\ndif=[]\r\n\r\nif done!=1:\r\n\tfor g in range(len(a)):\r\n\t\tdiv.append(a[g]%a[0])\r\n\tfor t in range(len(div)):\r\n\t\tif div.count(div[t])==1:\r\n\t\t\tdivch.append(t)\t\r\n\tif len(divch)==1:\t\r\n\t\tprint(divch[0]+1)\r\n\t\tcomp=1\t\r\n\t\t\r\n\tif comp!=1:\r\n\t\tev=[]\r\n\t\tevdn=0\r\n\t\todd=[]\r\n\t\todddn=0\r\n\t\tfor r in range(len(a)):\r\n\t\t\tif a[r]%2==0:\r\n\t\t\t\tev.append(r)\r\n\t\tif len(ev)==1:\r\n\t\t\tprint(ev[0]+1)\r\n\t\t\tevdn=1\r\n\r\n\t\tif evdn!=1:\r\n\t\t\tfor w in range(len(a)):\r\n\t\t\t\tif a[w]%2==1:\r\n\t\t\t\t\todd.append(w)\r\n\t\t\tif len(odd)==1:\r\n\t\t\t\tprint(odd[0]+1)\r\n\t\t\t\todddn=1\r\n\r\n\t\t\tif odddn!=1:\r\n\t\t\t\tL=[]\r\n\t\t\t\tfor j in range(len(a)-1):\r\n\t\t\t\t\tL.append(a[j+1]-a[j])\r\n\t\t\t\tfor k in range(len(L)-1):\r\n\t\t\t\t\tif L.count(L[k])==1:\r\n\t\t\t\t\t\tdif.append(k)\r\n\t\t\t\tif len(dif)==1:\r\n\t\t\t\t\tif k==0:\t\r\n\t\t\t\t\t\tprint(k+1)\r\n\t\t\t\t\telif k==len(L)-1:\r\n\t\t\t\t\t\tprint(len(a))\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint(dif[len(dif)-1]+1)", "n = int(input())\nb = list(map(int, input().split()))\na = [0] * n\nfor i in range(n):\n a[i] = b[i] % 2\nif sum(a) == 1:\n print(a.index(1) + 1)\nelse:\n print(a.index(0) + 1)\n\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nz = 0\r\nx = 0\r\nfor i in range(a):\r\n if b[i] % 2 == 0:\r\n z += 1\r\n else:\r\n x += 1\r\nif z > x:\r\n for i in range(a):\r\n if b[i] % 2 == 1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(a):\r\n if b[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nn = chet = nechet = 0\r\nfor i in a:\r\n if i % 2 == 0:\r\n chet = i\r\n n += 1\r\n else:\r\n nechet = i\r\n\r\nif n == 1:\r\n print(1 + a.index(chet))\r\nelse:\r\n print(1 + a.index(nechet))\r\n", "n = int(input()) \r\na = list(map(int, input().split())) \r\na = [i%2 for i in a]\r\nb = a.count(0)\r\nc = a.count(1)\r\nif b<c:\r\n print (a.index(0)+1)\r\nelse:\r\n print (a.index(1)+1) ", "n = int(input())\r\ndigits = list(map(int, input().split()))\r\n\r\nlist_odd = [] # нечет\r\nlist_even = [] # чет\r\n\r\nfor i in range(n):\r\n if digits[i] % 2 == 0:\r\n list_even.append(i)\r\n else:\r\n list_odd.append(i)\r\n\r\nif len(list_odd) == 1:\r\n print(list_odd[0] + 1)\r\nelse:\r\n print(list_even[0] + 1)", "input()\r\neven = list(map(lambda d: int(d) % 2 == 0, input().split()))\r\neven_count = even.count(True)\r\nif even_count == 1:\r\n print(even.index(True) + 1)\r\nelse:\r\n print(even.index(False) + 1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nch = list()\r\nnech = list()\r\nfor i in range(n):\r\n if a[i]%2 ==0:\r\n ch = ch + [a[i]]\r\n else:\r\n nech = nech + [a[i]]\r\nif len(ch)>len(nech):\r\n print(a.index(nech[0]) + 1)\r\nelse:\r\n print(a.index(ch[0]) + 1)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 30 16:52:17 2020\r\n\r\n@author: CCLAB\r\n\"\"\"\r\n\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nm=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n m+=1\r\n x=i+1\r\n else:\r\n y=i+1\r\nif m!=1:\r\n print(y)\r\nelse:\r\n print(x)", "n = input()\r\n\r\nnums = [int(i) for i in input().split()]\r\neven = []\r\nodd = []\r\nfor i in range(int(n)) :\r\n\r\n if nums[i] % 2 == 0 :\r\n even.append(i + 1)\r\n else :\r\n odd.append(i + 1)\r\n\r\nif len(even) == 1 :\r\n for i in even :\r\n print(i)\r\n\r\nelse :\r\n for i in odd : \r\n print(i)", "n = int(input())\r\nx = list(map(int,input().split(\" \")))\r\neven = 0\r\nodd = 0\r\nfor i in range(0,n):\r\n if x[i]%2 == 0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if even>1 or odd>1:\r\n break\r\nif even>1:\r\n for i in range(0,n):\r\n if x[i]%2==1:\r\n print(i+1)\r\nif odd>1:\r\n for i in range(0,n):\r\n if x[i]%2==0:\r\n print(i+1)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nl2,l3=[],[]\r\nfor i in l1:\r\n if i%2==0:\r\n l2.append(i)\r\n if min(len(l3),len(l2))==1 and max(len(l3),len(l2))>1:\r\n if len(l2)==1:\r\n print(l1.index(l2[0])+1)\r\n break\r\n else:\r\n print(l1.index(l3[0]) + 1)\r\n break\r\n else:\r\n l3.append(i)\r\n if min(len(l3),len(l2))==1 and max(len(l3),len(l2))>1:\r\n if len(l2)==1:\r\n print(l1.index(l2[0])+1)\r\n break\r\n else:\r\n print(l1.index(l3[0]) + 1)\r\n break", "def my_func(check_list):\r\n ev_counter = 0\r\n od_counter = 0\r\n for j in check_list:\r\n if j % 2 == 0:\r\n ev_counter += 1\r\n else:\r\n od_counter += 1\r\n\r\n if ev_counter > od_counter:\r\n for x in range(len(check_list)):\r\n if check_list[x] % 2 != 0:\r\n print(x + 1)\r\n else:\r\n for z in range(len(check_list)):\r\n if check_list[z] % 2 == 0:\r\n print(z + 1)\r\n\r\ndef main():\r\n n = int(input())\r\n numbers = input()\r\n list_nums = numbers.split()\r\n check_list = []\r\n for i in list_nums:\r\n number = int(i)\r\n check_list.append(number)\r\n\r\n my_func(check_list)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def s(x):\r\n return x % 2\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nc = list(map(s, a))\r\nif sum(c) == 1:\r\n print(c.index(1) + 1)\r\nelse:\r\n print(c.index(0) + 1)\r\n", "n = int(input())\r\nd = []\r\nm = []\r\nL = list(map(int, input().split()))\r\nfor i in range(n):\r\n if L[i] % 2 == 0:\r\n d.append(i+1)\r\n else:\r\n m.append(i+1)\r\nif len(d) == 1:\r\n print(*d)\r\nelse:\r\n print(*m)", "\r\n\r\nn = int(input())\r\nl = [int(x) for x in input().split(' ')]\r\nl1 = [x//2 for x in l]\r\nl1 = [int(2*x) for x in l1]\r\nk1 = sum([l[i] == l1[i] for i in range(len(l))])\r\nk2 = len(l) - k1\r\nif k1 > k2:\r\n for i in range(len(l)):\r\n if l[i] % 2 != 0:\r\n print(i+1)\r\n break\r\nelif k1 < k2:\r\n for i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n print(i+1)\r\n break\r\n\r\nelse:\r\n print(0)", "n = int(input())\na = list(map(int, input().split()))\nq = sum(a[i] % 2 for i in range(3))\nif q >= 2:\n i = 0\n while a[i] % 2:\n i += 1\n print(i + 1)\nelse:\n i = 0\n while a[i] % 2 == 0:\n i += 1\n print(i + 1)\n", "n = int(input())\r\n\r\ngiven_list = [i for i in input().split()]\r\ngiven_int_list = list(map(int, given_list))\r\ncomparison_list = []\r\n\r\n\r\nfor i in given_int_list:\r\n res = i%2\r\n comparison_list.append(res) \r\n\r\ncounter1 = []\r\ncounter2 = []\r\n\r\n\r\n\r\n\r\nfor i in range(len(comparison_list)):\r\n if comparison_list[i] == 0:\r\n counter1.append(i)\r\n else:\r\n counter2.append(i)\r\n\r\nif len(counter2) < len(counter1):\r\n print(counter2[-1] + 1)\r\nelse:\r\n print(counter1[-1] + 1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nchet = []\r\nnechet = []\r\nfor i in range(len(a)):\r\n if a[i] % 2 == 0:\r\n chet.append(a[i])\r\n else:\r\n nechet.append(a[i])\r\nif len(chet) > len(nechet):\r\n x = nechet[0]\r\nelse:\r\n x = chet[0]\r\nind = a.index(x) + 1\r\nprint(ind)", "import re\r\nn=int(input())\r\nevenness=[int(i)%2 for i in re.findall(\"\\d+\\s\",input()+\" \")]\r\nif evenness.count(0)==1:\r\n print(evenness.index(0)+1)\r\nelse:\r\n print(evenness.index(1)+1)", "n=int(input())\r\nlistA=list(map(int,input().split(\" \")))\r\nnum=[]\r\nfor i in listA:\r\n num.append(i%2)\r\nif num.count(0)>1:\r\n print(num.index(1)+1)\r\nelse:\r\n print(num.index(0)+1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\neven=[]\r\nodd=[]\r\nfor i in range(len(arr)):\r\n if(arr[i]%2==0):\r\n even.append(arr[i])\r\n else:\r\n odd.append(arr[i])\r\nif(len(even)==1):\r\n for i in range(len(arr)):\r\n if(arr[i]==even[0]):\r\n print(i+1)\r\nif(len(odd)==1):\r\n for i in range(len(arr)):\r\n if(arr[i]==odd[0]):\r\n print(i+1)", "n=int(input())\r\na=list(map(int, input().split()))\r\nm1=[]\r\nm2=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n m1.append(a[i])\r\n else:\r\n m2.append(a[i])\r\n \r\nif len(m1)<len(m2):\r\n print(a.index(m1[0])+1)\r\nelse:\r\n print(a.index(m2[0])+1)", "input()\r\nlis = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nfor i in range(3):\r\n if lis[i]%2 == 0:\r\n even = even+1\r\n else:\r\n odd = odd+1\r\n\r\njudge = bool(even > odd)\r\n\r\nfor i in range(len(lis)):\r\n if lis[i]%2 == judge:\r\n print(i+1)\r\n break\r\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\neven = [(i+1) for i in range(len(lst)) if(lst[i] % 2 == 0)]\r\nodd = [(i+1) for i in range(len(lst)) if(lst[i] % 2 != 0)]\r\nif(len(even) > len(odd)):\r\n for i in odd:\r\n print(i)\r\nelse:\r\n for i in even:\r\n print(i)\r\n ", "l=int(input())\r\narr=list(map(int,input().split()))\r\neven_index=[]\r\nc_even=0\r\nodd_index=[]\r\nc_odd=0\r\nfor i in range(l):\r\n\tif arr[i]%2==0:\r\n\t\tc_even+=1\r\n\t\teven_index.append(i+1)\r\n\telse:\r\n\t\tc_odd+=1\r\n\t\todd_index.append(i+1)\r\nif c_odd==1:\r\n\tprint(*odd_index)\r\nelse:\r\n\tprint(*even_index)\r\n\r\n", "n = int(input())\r\nlst = input().split() #get input numbers\r\n\r\nchet_index,nechet_index = 0, 0\r\nchet, nechet = 0, 0\r\n\r\nfor i in lst:\r\n if int(i) % 2 == 0:\r\n chet += 1\r\n chet_index = lst.index(i) + 1\r\n else:\r\n nechet += 1\r\n nechet_index = lst.index(i) + 1\r\nif chet == 1:\r\n print(chet_index)\r\nelse:\r\n print(nechet_index)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(i)%2 for i in input().split()]\r\nif a[0]==a[1]:\r\n for i in range(2,len(a)):\r\n if a[i]!=a[0]:\r\n print(i+1)\r\n break\r\nelse:\r\n if a[0]!=a[2]:\r\n print(1)\r\n else:\r\n print(2)", "n=int(input())\r\na=list(map(int,input().split()))\r\neven=0\r\nlodd=0\r\nleven=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n even+=1\r\n leven=i+1\r\n else:\r\n even-=1\r\n lodd=i+1\r\n\r\nif(even>0):\r\n print(lodd)\r\nelse:\r\n print(leven)\r\n\r\n", "t=int(input())\r\narr=list(map(int,input().split()))\r\nres=[i%2 for i in arr]\r\nif res.count(0)==t-1:\r\n print(res.index(1)+1)\r\nelse:\r\n print(res.index(0)+1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 0\r\nq = 0\r\nfor elem in a:\r\n if elem % 2 == 0:\r\n k += 1\r\n if k > 1:\r\n break\r\nfor elem in a:\r\n if elem % 2 != 0:\r\n q += 1\r\n if q > 1:\r\n break\r\nif k == 1:\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\nelif q == 1:\r\n for i in range(n):\r\n if a[i] % 2 != 0:\r\n print(i + 1)\r\n break", "a = int(input())\r\nmylist = list(map(int, input().split()))\r\nzoj = 0\r\nfard = 0\r\n\r\nfor i in range(a):\r\n if mylist[i] % 2 == 0:\r\n zoj += 1\r\n elif mylist[i] % 2 != 0:\r\n fard += 1\r\n\r\nif zoj > fard:\r\n for i in range(a):\r\n if mylist[i] % 2 != 0:\r\n print(mylist.index(mylist[i]) + 1)\r\nelif fard > zoj:\r\n for i in range(a):\r\n if mylist[i] % 2 == 0:\r\n print(mylist.index(mylist[i]) + 1)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nodd = 0\r\neven = 0\r\nfor i in range(3):\r\n if l[i] % 2:\r\n odd += 1\r\n else:\r\n even += 1\r\nif odd > even:\r\n for i in range(n):\r\n if l[i] % 2 == 0:\r\n break\r\n print(i + 1)\r\nelse:\r\n for i in range(n):\r\n if l[i] % 2:\r\n break\r\n print(i + 1)", "#A. IQ test\r\n\r\nn = int(input())\r\nnums = [int(x) for x in input().split()]\r\nec = 0\r\noc = 0\r\ne_i = 0\r\no_i = 0\r\nfor i in range(len(nums)):\r\n if nums[i] % 2 == 0:\r\n ec+=1\r\n e_i=i\r\n else:\r\n oc+=1\r\n o_i=i\r\nif ec>oc:print(o_i+1)\r\nif oc>ec:print(e_i+1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\neven = 0\r\nodd = 0\r\nlast_even = 0\r\nlast_odd = 0 \r\n\r\nfor i in range(n):\r\n if l[i]%2 == 0:\r\n even += 1\r\n last_even = i\r\n else:\r\n odd += 1\r\n last_odd = i\r\nif even > odd:\r\n print(last_odd+1)\r\nelse:\r\n print(last_even+1)\r\n ", "def iq_test(n, numbers):\r\n num_list = list(map(int, numbers.split()))\r\n\r\n # Count the number of even and odd numbers\r\n even_count = sum(1 for num in num_list if num % 2 == 0)\r\n odd_count = sum(1 for num in num_list if num % 2 != 0)\r\n\r\n # Find the index of the number that differs in evenness\r\n if even_count > odd_count:\r\n for i, num in enumerate(num_list, start=1):\r\n if num % 2 != 0:\r\n return i\r\n else:\r\n for i, num in enumerate(num_list, start=1):\r\n if num % 2 == 0:\r\n return i\r\n\r\n return -1 # Return -1 if no number that differs in evenness is found\r\n\r\n\r\n# Read the input values\r\nn = int(input())\r\nnumbers = input()\r\n\r\n# Call the iq_test function and print the result\r\nresult = iq_test(n, numbers)\r\nprint(result)", "n = int(input())\r\n\r\nls = [int(i) for i in input().split()]\r\n\r\nif sum(i % 2 == 0 for i in ls[:3]) >= 2:\r\n for i in range(len(ls)):\r\n if ls[i] % 2 == 1:\r\n print(i + 1)\r\n break\r\nelse:\r\n for i in range(len(ls)):\r\n if ls[i] % 2 == 0:\r\n print(i + 1)\r\n break\r\n", "def IQTest(NumberofTasks: int, Numbers: list):\r\n\r\n evenCount = 0\r\n oddCount = 0\r\n even_list = []\r\n odd_list = []\r\n\r\n for i in range(NumberofTasks):\r\n \r\n if Numbers[i] % 2 != 0:\r\n oddCount += 1\r\n odd_list.append(i + 1)\r\n\r\n else : \r\n evenCount +=1\r\n even_list.append(i + 1) \r\n\r\n if oddCount > evenCount :\r\n return even_list[0]\r\n\r\n return odd_list[0] \r\n\r\nNumberOfTasks = int(input())\r\nNumbers = list(map(int, input().split()))\r\nprint(IQTest(NumberOfTasks, Numbers))\r\n", "a = int(input())\r\nb = [int(x) for x in input().split()]\r\nc = [i%2 for i in b]\r\nif c.count(1)==1:\r\n print(c.index(1)+1)\r\nelse:\r\n print(c.index(0)+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[]\r\ny=[]\r\nfor i in range (0,n):\r\n if(l[i]%2==0):\r\n x.append(l[i])\r\n else:\r\n y.append(l[i])\r\nif (len(x)==1):\r\n print(l.index(x[0])+1)\r\nelse:\r\n print(l.index(y[0])+1)", "n = int(input())\r\neven = []\r\nodd = []\r\nnum = list(map(int, input().split()))\r\nfor i in range(len(num)):\r\n if num[i] % 2 == 0:\r\n even.append(str(i + 1))\r\n else:\r\n odd.append(str(i + 1))\r\na = len(even)\r\nb = len(odd)\r\nif a == 1:\r\n s = (''.join(even))\r\nelse:\r\n s = (''.join(odd))\r\nprint(int(s))", "from sys import stdin\r\n\r\n# from sys import setrecursionlimit\r\n# import resource\r\ninput = stdin.readline\r\n\r\n\r\n# setrecursionlimit(int(1e9))\r\n# resource.setrlimit(resource.RLIMIT_STACK, (2**29,-1))\r\n\r\ndef ii():\r\n return int(input())\r\n\r\n\r\ndef li():\r\n return list(map(int, input().split()))\r\n\r\n\r\nfrom math import sqrt\r\n\r\n\r\ndef perfect_sq(n):\r\n x = int(sqrt(n))\r\n\r\n while x * x < n:\r\n x += 1\r\n\r\n while x * x > n:\r\n x -= 1\r\n\r\n return (x * x == n)\r\n\r\nn=ii()\r\na=li()\r\no,e=0,0\r\nfor i in a:\r\n if i%2:\r\n o+=1\r\n else:\r\n e+=1\r\n\r\nif e==1:\r\n for i in range(n):\r\n if a[i]%2==0:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(n):\r\n if a[i]%2:\r\n print(i+1)\r\n break", "def raznoe(lst):\r\n c = list()\r\n for i in range(len(lst)):\r\n c.append(tuple([i + 1, lst[i]]))\r\n a = list()\r\n b = list()\r\n for elem in c:\r\n if elem[1] % 2 == 0:\r\n a.append(elem[0])\r\n else:\r\n b.append(elem[0])\r\n if len(a) < len(b):\r\n return a\r\n return b\r\n\r\n\r\nn = int(input())\r\narr = [int(j) for j in input().split()]\r\nprint(*raznoe(arr))\r\n", "import sys\r\nimport io\r\n\r\ndef run(test,res):\r\n x = io.StringIO()\r\n with io.StringIO(test) as sys.stdin:\r\n with x as sys.stdout:\r\n work()\r\n z = x.getvalue().strip()\r\n sys.stdout = sys.__stdout__\r\n print(\"Passed?\", z == test)\r\n print(\"Expected\", res)\r\n print(\"Actual\", z)\r\n\r\ndef work():\r\n n = int(input())\r\n z = list(map(int, input().split()))\r\n c = sum((1 if x%2==0 else 0) for x in z)\r\n v = 0 if c==1 else 1\r\n for i, x in enumerate(z):\r\n if x%2==v:\r\n print(i+1)\r\n\r\ndef test():\r\n run(\"\"\"5\r\n2 4 7 8 10\"\"\", \"3\")\r\n run(\"\"\"4\r\n1 2 1 1\"\"\", \"2\")\r\n\r\nif len(sys.argv) > 1:\r\n test()\r\nelse:\r\n work()\r\n", "num=input()\r\nstore=[int(i) for i in input().split()]\r\nif store[0]%2!=store[1]%2:\r\n print([1,2][store[0]%2==store[2]%2])\r\nelse:\r\n for i in range(2,len(store)):\r\n if store[i]%2!=store[0]%2:\r\n print(i+1)\r\n break", "s = int(input())\nw = 0\n\na = input().split()\n\nfor i in range(s):\n a[i] = int(a[i])\n if a[i]%2 ==0:\n \n w+=1\n \nif w == s-1:\n for i in range(s):\n \n if a[i]%2!=0:\n print(i+1)\nelse:\n for i in range(s):\n a[i] = int(a[i])\n if a[i]%2 ==0:\n\n print(i+1)\n \n", "n = int(input())\r\na = list(map(int, input().split()))[:n]\r\ne, o = [], []\r\n\r\nfor i in range(n):\r\n e.append(a[i]) if a[i] % 2 == 0 else o.append(a[i])\r\n\r\nprint( (a.index(e[0])+1) if (len(e) == 1) else (a.index(o[0])+1) )", "def min(a):\r\n d=[]\r\n c=[]\r\n for i in range(w):\r\n if a[i]%2==0:\r\n c.append(i)\r\n else:\r\n d.append(i)\r\n if len(c)==1:\r\n return(c[0]+1)\r\n if len(d)==1:\r\n return(d[0]+1)\r\nw=int(input())\r\na=list(map(int,input().split(' ')))\r\nres=min(a)\r\nprint(res)", "def main():\r\n n=int(input())\r\n m=input().split()\r\n mx=[]\r\n position = 0\r\n for i in m:\r\n mx.append(int(i)%2)\r\n if sum(mx)>1:\r\n for i in mx:\r\n if i == 0:\r\n break\r\n else:\r\n position+=1\r\n else:\r\n for i in mx:\r\n if i == 1:\r\n break\r\n else:\r\n position+=1\r\n\r\n print(position+1)\r\n\r\n\r\nif __name__ == '__main__':main()", "batas=int(input())\r\nisi=input().split(\" \")\r\nindeks=0\r\ntotalGan=0\r\ntotalGen=0\r\narr=[]\r\nfor i in range(batas):\r\n arr.append(int(isi[i]))\r\nfor i in range(len(arr)):\r\n if arr[i]%2==0:\r\n arr[i]=arr[i]%2\r\n totalGen+=1\r\n elif arr[i]%2==1:\r\n totalGan+=1\r\n\r\nif totalGen==1:\r\n for i in range(len(arr)):\r\n if arr[i]%2==0:\r\n indeks=i+1\r\nelif totalGan==1:\r\n for i in range(len(arr)):\r\n if arr[i]%2==1:\r\n indeks=i+1\r\nprint(indeks)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().rstrip().split()))\r\na=[i%2 for i in a]\r\nif a.count(0)==1:\r\n print(a.index(0)+1)\r\nelse:\r\n print(a.index(1)+1)\r\n ", "odd = []\r\neven = []\r\ncur_number = -1\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nfor i, e in enumerate(nums):\r\n if (len(even) == 1 and len(odd) > 1) or (len(odd) == 1 and len(even) > 1):\r\n break\r\n if e % 2 == 0:\r\n even.append(i + 1)\r\n else:\r\n odd.append(i + 1)\r\n\r\nif len(even) == 1:\r\n print(even[0])\r\nelse:\r\n print(odd[0])", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\ncountch = 0\r\nindexch = 0 \r\ncountnech = 0\r\nindexnech = 0 \r\nfor i in range(n):\r\n if arr[i] % 2 == 0:\r\n countch += 1\r\n indexch = i \r\n else:\r\n countnech += 1\r\n indexnech = i \r\n\r\nif countch == 1:\r\n #print ('Лишнее число чётное. Его номер:')\r\n print(indexch + 1)\r\n #print ('IQ Test пройден. Поздравляю! Вы - Гений!')\r\nelif countnech == 1:\r\n #print ('Лишнее число нечётное. Его номер:')\r\n print(indexnech + 1)\r\n #print ('IQ Test пройден. Поздравляю! Вы - Гений!')\r\n#else:\r\n #print('Солнышко, проверь введённую последовательность...')\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = []\r\nc = []\r\nfor i in range(n):\r\n if a[i]/2 - a[i]//2 == 0:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nif len(c) < len(b):\r\n t = c[0] + 1\r\nelse:\r\n t = b[0] + 1\r\nprint(t)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=y=0\r\nfor i in range(n):\r\n if(a[i]%2==0):\r\n x+=1\r\n l=i\r\n else:\r\n y=y+1\r\n m=i\r\nif(x>y):\r\n print(m+1)\r\nelse:\r\n print(l+1)\r\n", "def paridad(list):\r\n impares = 0\r\n pares = 0\r\n for i in range(3):\r\n if list[i] % 2==0:\r\n pares += 1\r\n else:\r\n impares += 1\r\n return pares > impares\r\ndef eveness(line):\r\n list = [int(i) for i in line.split(\" \")]\r\n impares = 0\r\n pares = 0\r\n\r\n for i in list:\r\n if i % 2 == 0:\r\n pares += 1\r\n else:\r\n impares += 1\r\n\r\n if paridad(list) and impares == 1:\r\n return pares + impares\r\n elif not paridad(list) and pares ==1:\r\n return pares + impares\r\n\r\n\r\n\r\nn = int(input())\r\nline = input()\r\nprint(eveness(line))\r\n", "t=int(input())\r\ne=0\r\no=0\r\nx=list(map(int,input().split()))\r\nfor i in range(0,t):\r\n if(x[i]%2==0):\r\n e=e+1\r\n else:\r\n o=o+1\r\nfor i in range(0,t):\r\n if(e>o):\r\n if(x[i]%2!=0):\r\n print(i+1)\r\n break\r\n else:\r\n if(x[i]%2==0):\r\n print(i+1)\r\n break", "n=int(input())\r\n\r\na=input()\r\na = a.rsplit(' ')\r\nb=[]\r\nc=[]\r\nfor x in range(len(a)):\r\n if int(a[x])%2==0:\r\n b+=a[x]\r\n else:\r\n c+=a[x]\r\n\r\n\r\n\r\nif len(b)>len(c):\r\n for x in range(n):\r\n m= int(a[x])\r\n if m%2==0:\r\n continue\r\n\r\n elif m%2!=0:\r\n ans=(x+1)\r\nelse:\r\n for x in range(n):\r\n m= int(a[x])\r\n if m%2!=0:\r\n continue\r\n\r\n elif m%2==0:\r\n ans=(x+1)\r\n\r\n\r\nprint(ans)\r\n \r\n" ]

[ "n = int(input())\r\n\r\nINF = 10**10\r\nind = 0\r\nans = 0\r\ntemp = 0\r\na = []\r\nd = dict()\r\n\r\nS = sorted([sorted(list(map(int, input().split())) , reverse = True) + [i + 1] for i in range(n)], reverse = True)\r\n\r\n\r\nans = S[0][2]\r\na = [S[0][-1]]\r\n\r\nfor i in range(1, n):\r\n if S[i][0] == S[i-1][0] and S[i][1] == S[i-1][1]:\r\n temp = min(S[i][0], S[i][1], S[i][2] + S[i-1][2])\r\n if temp > ans:\r\n ans = temp\r\n a = [S[i][-1],S[i-1][-1]]\r\n elif S[i][2] > ans:\r\n ans =S[i][2]\r\n a = [S[i][-1]]\r\n\r\na.sort()\r\nprint(len(a))\r\nprint(*a)\r\n \r\n\r\n \r\n \r\n\r\n \r\n ", "import sys\r\nfrom itertools import combinations\r\nr = sys.stdin.readline\r\nN = int(r())\r\nedge = dict()\r\nans = set()\r\nmx = (0,0)\r\n\r\n\r\ndef get_xy_z(xyz:list):\r\n res = []\r\n for i in range(3):\r\n lst=[]\r\n tmp=0\r\n for j in range(3):\r\n if i == j:\r\n tmp = xyz[j]\r\n else:\r\n lst.append(xyz[j])\r\n lst.sort()\r\n res.append((\r\n tuple(lst), tmp\r\n ))\r\n res=list(set(res))\r\n return res\r\n\r\n\r\nfor i in range(1, N + 1):\r\n xyz = list(map(int, r().split()))\r\n ans.add((min(xyz), i))\r\n \r\n xy_z=get_xy_z(xyz)\r\n\r\n for pair,z in xy_z:\r\n if pair not in edge:\r\n edge[pair]=(z,i)\r\n else:\r\n c,idx=edge[pair]\r\n edge[pair]=(c,idx) if c>z else (z,i)\r\n lst=list(pair)+[c+z]\r\n if min(lst)>mx[0]:\r\n tmp=max(mx[0],min(lst))\r\n mx=(tmp, (idx,i))\r\n\r\nans = list(ans)\r\nans.sort(key=lambda x: x[0],reverse=True)\r\nif ans[0][0] > mx[0]:\r\n print(1)\r\n print(ans[0][1])\r\nelse:\r\n print(2)\r\n print(*mx[1])\r\n", "n = int(input())\n\nstones = []\nfor i in range(n):\n stones.append(list(map(int, input().split())))\n stones[i] = sorted(stones[i])\n\nbest_one = (0, min(stones[0]))\nfor i in range(1, n):\n if min(stones[i]) > best_one[1]:\n best_one = (i, min(stones[i]))\n\nbest_two = (-1, -1, -1)\nwalls = dict()\n\n\ndef addWall(x, y, value, index):\n if (x, y) not in walls:\n walls[(x, y)] = []\n walls[(x, y)].append((value, index))\n\n\nfor i in range(n):\n stone = stones[i]\n addWall(stone[0], stone[1], stone[2], i)\n addWall(stone[0], stone[2], stone[1], i)\n addWall(stone[1], stone[2], stone[0], i)\n\nfor key in walls:\n walls[key] = sorted(set(walls[key]), reverse=True)\n\n\ndef checkWall(x, y, value, index):\n global best_two\n if len(walls[(x, y)]) > 1:\n if walls[(x, y)][0][1] != index:\n res = min(x, y, value + walls[(x, y)][0][0])\n if res > best_two[2]:\n best_two = (index, walls[(x, y)][0][1], res)\n else:\n res = min(x, y, value + walls[(x, y)][1][0])\n if res > best_two[2]:\n best_two = (index, walls[(x, y)][1][1], res)\n\n\nfor i in range(n):\n stone = stones[i]\n checkWall(stone[0], stone[1], stone[2], i)\n checkWall(stone[0], stone[2], stone[1], i)\n checkWall(stone[1], stone[2], stone[0], i)\n\nif best_one[1] > best_two[2]:\n print(1)\n print(best_one[0] + 1)\nelse:\n print(2)\n print(best_two[0] + 1, best_two[1] + 1)\n", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n\r\n# n,m=map(int,input().split())\r\n# arr=list(map(int, input().split()))\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n\r\n\r\ndef main():\r\n n=int(input())\r\n dic={}\r\n ct=1\r\n ma=-1\r\n v=-1\r\n for i in range(n):\r\n arr=list(map(int, input().split()))\r\n arr.sort()\r\n p1=(arr[0],arr[1])\r\n p2=(arr[1],arr[2])\r\n p3=(arr[0],arr[2])\r\n if(arr[0]>ma):\r\n v=[i+1]\r\n ma=arr[0]\r\n if(p1 in dic):\r\n dic[p1].append([arr[2],i])\r\n else:\r\n dic[p1]=[[arr[2],i]]\r\n \r\n if(p2 in dic):\r\n dic[p2].append([arr[0],i])\r\n else:\r\n dic[p2]=[[arr[0],i]]\r\n \r\n if(p3 in dic):\r\n dic[p3].append([arr[1],i])\r\n else:\r\n dic[p3]=[[arr[1],i]]\r\n for i in dic:\r\n if(len(dic[i])==1):\r\n continue\r\n dic[i].sort()\r\n a=i[0]\r\n b=i[1]\r\n l=len(dic[i])\r\n c=dic[i][l-1][0]+dic[i][l-2][0]\r\n if(min(a,c)>ma):\r\n ma=min(a,c)\r\n v=[dic[i][l-1][1]+1,1+dic[i][l-2][1]]\r\n ct=2\r\n print(ct)\r\n print(*v)\r\nmain()", "# python - dictionary\r\n# java - hashmap\r\n# c++ - map\r\nn = int(input())\r\nd_max = 0 # initialize your maximum diameter\r\nrepo = {} # empty dictionary\r\n\r\ndef update_repo(i, x, y, z):\r\n if (x, y) in repo:\r\n (sq1, z1) = repo[(x, y)]\r\n if z > z1:\r\n repo[(x, y)] = (i+1, z)\r\n else:\r\n repo[(x, y)] = (i+1, z) \r\n\r\nfor i in range(n):\r\n vals = input().split()\r\n a, b, c, = int(vals[0]), int(vals[1]), int(vals[2])\r\n small = min(a, b, c)\r\n large = max(a, b, c)\r\n medium = a + b + c - small - large\r\n # case 1: only one stone\r\n if small > d_max:\r\n d_max = small\r\n ans_type = 1\r\n ans_seqNo = i + 1 # plus 1 for 0-based\r\n # case 2: glue together\r\n # we only need medium, large\r\n if (medium, large) in repo:\r\n (seqNo, z) = repo[medium, large]\r\n new_z = z + small\r\n new_d = min(medium, large, new_z)\r\n if new_d > d_max:\r\n d_max = new_d\r\n ans_type = 2\r\n ans_seqNo = (seqNo, i+1)\r\n \r\n # we need to update repo\r\n update_repo(i, small, medium, large)\r\n update_repo(i, small, large, medium)\r\n update_repo(i, medium, large, small)\r\n\r\nprint(ans_type)\r\nif ans_type == 1:\r\n print(ans_seqNo)\r\nelse:\r\n print(*ans_seqNo) # * means, you print all numbers inside the tuple\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(sorted(list(map(int,input().split()))))\r\nb={}\r\nfor i in range(n):\r\n for j in range(3):\r\n for k in range(j+1,3):\r\n if (a[i][j],a[i][k]) in b.keys():\r\n b[(a[i][j],a[i][k])].add((a[i][3-j-k],i))\r\n else:\r\n c=((a[i][3-j-k],i),(-1,-1))\r\n b[(a[i][j],a[i][k])]=set(c)\r\nc=[]\r\nfor i in b:\r\n d=sorted(list(b[i]),reverse=True)[:-1]\r\n b[i]=d\r\n if len(d)==1:\r\n c.append([min(i[0],i[1],d[0][0]),d[0][1]])\r\n else:\r\n c.append([min(i[0],i[1],d[0][0]+d[1][0]),d[0][1],d[1][1]])\r\ne=max(c)\r\nif len(e)==2:\r\n print(1)\r\n print(e[1]+1)\r\nelse:\r\n print(2)\r\n print(e[1]+1,e[2]+1)", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\nN = int(input())\r\nG= defaultdict(list)\r\nfor i in range(N):\r\n a,b,c = ilele()\r\n C = sorted([a,b,c])\r\n a,b,c = C\r\n l = i+1\r\n if a==b == c:\r\n G[(a,b)].append((c,l))\r\n elif a==b:\r\n G[(a,b)].append((c,l))\r\n G[(b,c)].append((a,l))\r\n elif b == c:\r\n G[(b,c)].append((a,l))\r\n G[(a,b)].append((c,l))\r\n else:\r\n G[(a,b)].append((c,l))\r\n G[(b,c)].append((a,l))\r\n G[(a,c)].append((b,l))\r\n#print(G)\r\nmaxi= 0\r\nchoose1 = None;choose2 = None\r\nfor i,j in G.items():\r\n if len(j) == 1:\r\n m = min(i[0],i[1],j[0][0])\r\n if m> maxi:\r\n maxi = m\r\n choose1 = j[0][1]\r\n choose2 = None\r\n else:\r\n r = heapq.nlargest(2,j)\r\n m = min(r[0][0] + r[1][0],i[0],i[1])\r\n if m>maxi:\r\n maxi = m\r\n choose1 = r[0][1]\r\n choose2 = r[1][1]\r\nif choose2 == None:\r\n print(1)\r\n print(choose1)\r\nelse:\r\n print(2)\r\n print(choose1,choose2)\r\n \r\n \r\n \r\n ", "n = int(input())\n\nlst = []\nfor i in range(n):\n lst.append([i + 1] + sorted([int(x) for x in input().split(' ')]))\n\nd = {}\n\nfor elem in lst:\n if (elem[3], elem[2]) in d:\n d[(elem[3], elem[2])].append((elem[0], elem[1]))\n else:\n d[(elem[3], elem[2])] = [(elem[0], elem[1])]\n\nm = 0\nans = []\n\n# print(d)\n\nfor pair in d:\n m1, m2 = 0, 0\n i1, i2 = 0, 0\n for i in range(0, len(d[pair])):\n if d[pair][i][1] > m2:\n m1 = m2\n m2 = d[pair][i][1]\n i1 = i2\n i2 = d[pair][i][0]\n elif d[pair][i][1] > m1:\n m1 = d[pair][i][1]\n i1 = d[pair][i][0]\n\n # print(pair)\n # print(d[pair])\n\n if i1 > 0:\n a = min(pair[0], pair[1], m1 + m2)\n if a > m:\n m = a\n ans = [i1, i2]\n else:\n a = min(pair[0], pair[1], m2)\n if a > m:\n m = a\n ans = [i2]\n\n # print(a, m, ans)\n\n\nprint(len(ans))\nprint(' '.join([str(x) for x in ans]))\n\n\n", "n = int(input())\r\na = [0] * n\r\nfor i in range(n):\r\n h, b, c = map(int, input().split())\r\n a[i] = [max(h, b, c), h + b + c - max(h, b, c) - min(h, b, c), min(h, b, c), i + 1]\r\na.sort()\r\nbest = a[0][2]\r\nans = a[0][3]\r\nt = 'int'\r\nfor i in range(1, n):\r\n if a[i][2] > best:\r\n best = a[i][2]\r\n ans = a[i][3]\r\n t = 'int'\r\n if a[i - 1][0] == a[i][0] and a[i - 1][1] == a[i][1] and min(a[i - 1][2] + a[i][2], a[i][1]) > best:\r\n best = min(a[i - 1][2] + a[i][2], a[i][1])\r\n ans = [a[i - 1][3], a[i][3]]\r\n t = 'list'\r\nif t == 'list':\r\n print(2)\r\n print(ans[0], ans[1])\r\nelse:\r\n print(1)\r\n print(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nA = []\r\n\r\ncur = 0\r\nans = None\r\nfor i in range(N):\r\n b = list(map(int, input().split()))\r\n b.sort(reverse=True)\r\n A.append(b)\r\n if b[-1]>cur:\r\n cur = b[-1]\r\n ans = [i]\r\n \r\nlib = defaultdict(list)\r\nfor i,a in enumerate(A):\r\n lib[tuple(a[:2])].append(a+[i])\r\n \r\n#print(lib)\r\nfor k,v in lib.items():\r\n v.sort()\r\n if len(v)<2:continue\r\n \r\n #print(v[-1],v[-2])\r\n tmp = min(k)\r\n tmp = min(tmp, v[-1][2]+v[-2][2])\r\n if tmp>cur:\r\n cur = tmp\r\n ans = (v[-1][3],v[-2][3])\r\n\r\nprint(len(ans))\r\nprint(*[a+1 for a in ans])", "s, n, d, k = [sorted(map(int, input().split())) for _ in range(int(input()))], 0, {}, []\r\nfor i, (x, y, z) in enumerate(s, 1):\r\n for a, b, c in [(x, y, z), (x, z, y), (y, z, x)]:\r\n q, w = d.get((a, b), (0, 0))\r\n if w != i:\r\n r = min(a, q + c)\r\n if r > n: n, k = r, (2, i, w) if w else (1, i)\r\n if c > q: d[(a, b)] = (c, i)\r\nfor _ in k: print(_)", "hash_table = {}\r\n\r\nn = int(input())\r\nmax_diam = 0\r\nordinal_numbers = []\r\n\r\nfor i in range(1, n+1):\r\n seq = sorted(list(map(int, input().split())),\r\n reverse=True) + [i]\r\n face = (seq[0], seq[1])\r\n\r\n if face in hash_table:\r\n best = hash_table[face]\r\n new_seq = [seq[0], seq[1], seq[2] + best[2]]\r\n diam = min(new_seq)\r\n if diam > max_diam:\r\n ordinal_numbers = [best[-1], i]\r\n max_diam = diam\r\n if best[2] < seq[2]:\r\n hash_table[face] = seq\r\n else:\r\n if seq[2] > max_diam:\r\n ordinal_numbers = [i]\r\n max_diam = seq[2]\r\n\r\n hash_table[face] = seq\r\n\r\nprint(len(ordinal_numbers))\r\nprint(\" \".join(map(str, ordinal_numbers)), end='')", "n = int(input())\r\nspheres = []\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n l = [a, b, c]\r\n l.sort(reverse=True)\r\n spheres.append((tuple(l), i + 1))\r\n\r\nspheres.sort(reverse=True, key=lambda x: x[0])\r\n\r\nans = min(spheres[0][0])\r\nk = 1\r\nind = [spheres[0][1]]\r\n\r\nfor i in range(1, n):\r\n if min(spheres[i][0]) > ans:\r\n ans = min(spheres[i][0])\r\n k = 1\r\n ind = [spheres[i][1]]\r\n\r\n me = spheres[i][0]\r\n last = spheres[i - 1][0]\r\n if me[0] == last[0] and me[1] == last[1]:\r\n rad = min(me[i] for i in range(2))\r\n rad = min(me[2] + last[2], rad)\r\n\r\n if rad > ans:\r\n ans = rad\r\n k = 2\r\n ind = [spheres[i - 1][1], spheres[i][1]]\r\n\r\nprint(k)\r\nif k == 1:\r\n print(ind[0])\r\nelse:\r\n print(ind[0], ind[1])", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nans_idx_0 = -1\r\nans_idx_1 = -1\r\nans_v = 0\r\nd = defaultdict(list)\r\n\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n l = [a, b, c]\r\n l.sort()\r\n a, b, c = l[0], l[1], l[2]\r\n \r\n if a>ans_v:\r\n ans_idx_0 = i\r\n ans_v = a\r\n \r\n d[10**10*b+c].append((i, a))\r\n\r\nfor k in d.keys():\r\n b = k//10**10\r\n d[k].sort(key=lambda t: t[1], reverse=True)\r\n \r\n if len(d[k])==1:\r\n continue\r\n \r\n v = min(d[k][0][1]+d[k][1][1], b)\r\n \r\n if v>ans_v:\r\n ans_idx_0 = d[k][0][0]\r\n ans_idx_1 = d[k][1][0]\r\n ans_v = v\r\n\r\nif ans_idx_1==-1:\r\n print(1)\r\n print(ans_idx_0+1)\r\nelse:\r\n print(2)\r\n print(ans_idx_0+1, ans_idx_1+1)", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nd = defaultdict(lambda : [])\r\nma = 0\r\nfor i in range(1, n + 1):\r\n abc = list(map(int, input().split()))\r\n abc.sort()\r\n a, b, c = abc\r\n if ma < a:\r\n ma, ans = a, [i]\r\n d[(a, b)].append((c, i))\r\n d[(a, c)].append((b, i))\r\n d[(b, c)].append((a, i))\r\nfor a, b in d.keys():\r\n if len(d[(a, b)]) <= 1:\r\n continue\r\n d0 = d[(a, b)]\r\n d0.sort()\r\n c = 0\r\n u = []\r\n for _ in range(2):\r\n c0, i = d0.pop()\r\n c += c0\r\n u.append(i)\r\n if ma < min(a, c):\r\n ma, ans = min(a, c), list(u)\r\nk = len(ans)\r\nprint(k)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\r\nstones = []\r\nd = {}\r\nresradius = 0\r\nres = []\r\nfor _ in range(n):\r\n stones.append(list(map(int, input().split())))\r\nfor i in range(len(stones)):\r\n stones[i].sort()\r\n stone = stones[i]\r\n key = (stone[1], stone[2])\r\n if key in d:\r\n val, index = d[key]\r\n glued = min(val + stone[0], stone[1], stone[2])\r\n if (glued > resradius):\r\n resradius = glued\r\n res = [index, i]\r\n if (stone[0] > val):\r\n d[key] = (stone[0], i)\r\n else:\r\n d[key] = (stone[0], i)\r\n if (stone[0] > resradius):\r\n resradius = stone[0]\r\n res = [i]\r\nprint(len(res))\r\nfor x in res: print(x + 1, end = \" \")", "n = int(input())\r\nsidesInfo = {}\r\nlengthsToIndex = {}\r\nfor i in range(n):\r\n sides = [int(side) for side in input().split()]\r\n sides.sort()\r\n if sides[2] not in sidesInfo:\r\n sidesInfo[sides[2]] = {}\r\n if sides[1] not in sidesInfo[sides[2]]:\r\n sidesInfo[sides[2]][sides[1]] = []\r\n #record stone info; \r\n sidesInfo[sides[2]][sides[1]].append(sides[0])\r\n if f\"{sides[0]}_{sides[1]}_{sides[2]}\" not in lengthsToIndex:\r\n lengthsToIndex[f\"{sides[0]}_{sides[1]}_{sides[2]}\"] = []\r\n lengthsToIndex[f\"{sides[0]}_{sides[1]}_{sides[2]}\"].append(i + 1)\r\nmax_amount = 1\r\nmax_combination = \"\"\r\nmax_radius = 0\r\nfor sideLen in sidesInfo:\r\n for sideWid in sidesInfo[sideLen]:\r\n heightChosen = []\r\n if len(sidesInfo[sideLen][sideWid]) >= 2:\r\n sidesInfo[sideLen][sideWid].sort()\r\n heightChosen.append(sidesInfo[sideLen][sideWid][-2])\r\n heightChosen.append(sidesInfo[sideLen][sideWid][-1])\r\n else:\r\n heightChosen.append(sidesInfo[sideLen][sideWid][0])\r\n radiusMax = min(sideLen, sideWid, sum(heightChosen))\r\n if radiusMax > max_radius:\r\n max_radius = radiusMax\r\n max_amount = len(heightChosen)\r\n if max_amount == 2:\r\n pair = []\r\n pair.append(lengthsToIndex[f\"{heightChosen[0]}_{sideWid}_{sideLen}\"][0])\r\n if heightChosen[0] == heightChosen[1]:\r\n pair.append(lengthsToIndex[f\"{heightChosen[1]}_{sideWid}_{sideLen}\"][1])\r\n else:\r\n pair.append(lengthsToIndex[f\"{heightChosen[1]}_{sideWid}_{sideLen}\"][0])\r\n pair.sort()\r\n max_combination = ' '.join(str(i) for i in pair)\r\n else:\r\n max_combination = lengthsToIndex[f\"{heightChosen[0]}_{sideWid}_{sideLen}\"][0]\r\nprint(max_amount)\r\nprint(max_combination)\r\n", "n = int(input())\r\nd_max = 0\r\nrepo = {}\r\n\r\ndef update(a, b, c):\r\n global ans1, ans2, d_max, repo, i\r\n if (a, b) in repo:\r\n seqNo, d = repo[(a, b)] # this index is 1-based\r\n new_d = min(a, b, d + c)\r\n if new_d > d_max:\r\n d_max = new_d\r\n ans1 = 2\r\n ans2 = (seqNo, i+1)\r\n if c > d:\r\n repo[(a, b)] = (i+1, c)\r\n else:\r\n repo[(a, b)] = (i+1, c)\r\n\r\nfor i in range(n):\r\n vals = input().split()\r\n a, b, c = int(vals[0]), int(vals[1]), int(vals[2])\r\n small = min(a, b, c)\r\n large = max(a, b, c)\r\n medium = a + b + c - small - large\r\n # we solved the case 1 - no glue\r\n if small > d_max:\r\n d_max = small\r\n ans1 = 1\r\n ans2 = (i+1)\r\n # we have to solve the case 2 - glue\r\n # 1. (small, medium)\r\n update(small, medium, large)\r\n update(small, large, medium)\r\n update(medium, large, small)\r\n\r\nprint(ans1)\r\nif ans1 == 1:\r\n print(ans2)\r\nelse:\r\n print(*ans2)", "# D. Kostya the Sculptor\r\n\r\nn = int(input())\r\nans1 = None\r\nans2 = None\r\nmax_size = None\r\nrepo = {}\r\n\r\nfor i in range(n):\r\n vals = input().split()\r\n a, b, c = int(vals[0]), int(vals[1]), int(vals[2])\r\n l = max(a, b, c)\r\n s = min(a, b, c)\r\n m = a + b + c - l - s\r\n if max_size is None or s > max_size:\r\n ans1 = 1\r\n ans2 = (i + 1)\r\n max_size = s\r\n # s, m\r\n if (s, m) in repo:\r\n (index, v) = repo[(s, m)]\r\n size = min(s, m, v + l)\r\n if size > max_size:\r\n ans1 = 2\r\n ans2 = (index, i + 1)\r\n max_size = size\r\n if l > v:\r\n repo[(s, m)] = (i+1, l)\r\n else:\r\n repo[(s, m)] = (i+1, l)\r\n # s, l\r\n if (s, l) in repo:\r\n (index, v) = repo[(s, l)]\r\n size = min(s, l, v + m)\r\n if size > max_size:\r\n ans1 = 2\r\n ans2 = (index, i + 1)\r\n max_size = size\r\n if m > v:\r\n repo[(s, l)] = (i+1, m)\r\n else:\r\n repo[(s, l)] = (i+1, m)\r\n # m, l\r\n if (m, l) in repo:\r\n (index, v) = repo[(m, l)]\r\n size = min(m, l, v + s)\r\n if size > max_size:\r\n ans1 = 2\r\n ans2 = (index, i + 1)\r\n max_size = size\r\n if s > v:\r\n repo[(m, l)] = (i+1, s)\r\n else:\r\n repo[(m, l)] = (i+1, s)\r\n\r\nprint(ans1)\r\nif ans1 == 1:\r\n print(ans2)\r\nelse:\r\n print(*ans2)\r\n", "\"\"\" Prositka\r\n20.11.2022\"\"\"\r\n\r\nn = int(input())\r\ndata = {}\r\nans = 0\r\nres = 0\r\npos = 0\r\nind = []\r\nfor i in range(n):\r\n\ttmp = sorted(list(map(int, input().split())))\r\n\tif min(tmp) > ans:\r\n\t\tans = min(tmp)\r\n\t\tind = [i, -1]\r\n\tt = (tmp[1], tmp[2])\r\n\tif t in data:\r\n\t\tthird, _ = data[t]\r\n\t\tif min([third + tmp[0], tmp[1], tmp[2]]) > ans:\r\n\t\t\tans = min([third + tmp[0], tmp[1], tmp[2]])\r\n\t\t\tind = [i, data[t][1]]\r\n\t\tif third < tmp[0]:\r\n\t\t\tdata[t] = (tmp[0], i)\r\n\telse:\r\n\t\tdata[t] = (tmp[0], i)\r\nif ind[1] == -1:\r\n\tprint(1)\r\n\tprint(ind[0] + 1)\r\nelse:\r\n\tprint(2)\r\n\tprint(ind[0] + 1, ind[1] + 1)", "from itertools import combinations\n\ndef sides_pairs(box):\n return set(tuple(sorted(side)) for side in combinations(box.dimensions, 2))\n\nclass Box:\n\n def __init__(self, dimensions, ind):\n self.dimensions = dimensions\n self.ind = ind\n\n\nclass ChainHashSolver:\n\n def __init__(self):\n self.table = {}\n\n self.best_boxes = []\n self.diam = 0\n\n def insert(self, box):\n box_diam = min(box.dimensions)\n if box_diam > self.diam:\n self.diam = box_diam\n self.best_boxes = [box.ind]\n\n surfaces = sides_pairs(box)\n for surface_sides in surfaces:\n\n third_side = box.dimensions[:]\n for side in surface_sides:\n third_side.remove(side)\n third_side = third_side[0]\n\n if surface_sides not in self.table.keys():\n self.table[surface_sides] = (box, third_side)\n continue\n\n # it's enough to only store one box with the biggest third side\n hashed_box, hashed_side = self.table[surface_sides]\n\n stacking_diam = min([third_side + hashed_side] + list(surface_sides))\n if stacking_diam > self.diam:\n self.diam = stacking_diam\n self.best_boxes = [box.ind, hashed_box.ind]\n\n if third_side > hashed_side:\n self.table[surface_sides] = (box, third_side)\n\n\nhash_table = ChainHashSolver()\n'''\nwith open('input.txt', 'r') as f:\n n_boxes = int(f.readline())\n for box_num in range(1, n_boxes + 1):\n box = Box(list(map(int, f.readline().split())), box_num)\n hash_table.insert(box)\n\nwith open('output.txt', 'w') as f:\n f.write(str(len(hash_table.best_boxes)) + '\\n')\n f.write(' '.join(map(str, sorted(hash_table.best_boxes))) + '\\n')\n f.write(str(hash_table.diam))\n'''\nn_boxes = int(input())\nfor box_num in range(1, n_boxes + 1):\n box = Box(list(map(int, input().split())), box_num)\n hash_table.insert(box)\n\nprint(len(hash_table.best_boxes))\nprint(' '.join(map(str, sorted(hash_table.best_boxes))))\n", "# D. Kostya the Sculptor\r\n\r\nn = int(input())\r\nans1 = None\r\nans2 = None\r\nmax_size = None\r\nrepo = {}\r\n\r\ndef update(a, b, c):\r\n global ans1, ans2, max_size, repo\r\n if (a, b) in repo:\r\n (index, v) = repo[(a, b)]\r\n size = min(a, b, v + c)\r\n if size > max_size:\r\n ans1 = 2\r\n ans2 = (index, i + 1)\r\n max_size = size\r\n if c > v:\r\n repo[(a, b)] = (i+1, c)\r\n else:\r\n repo[(a, b)] = (i+1, c)\r\n\r\nfor i in range(n):\r\n vals = input().split()\r\n a, b, c = int(vals[0]), int(vals[1]), int(vals[2])\r\n l = max(a, b, c)\r\n s = min(a, b, c)\r\n m = a + b + c - l - s\r\n if max_size is None or s > max_size:\r\n ans1 = 1\r\n ans2 = (i + 1)\r\n max_size = s\r\n # s, m\r\n update(s, m, l)\r\n update(s, l, m)\r\n update(l, m, s)\r\n\r\nprint(ans1)\r\nif ans1 == 1:\r\n print(ans2)\r\nelse:\r\n print(*ans2)\r\n", "n = int(input())\r\nmv = 0\r\nmn = []\r\ndata = {}\r\nfor i in range (n):\r\n cur = list(sorted(map(int, input().split())))\r\n key = (cur[1], cur[2])\r\n if key in data:\r\n old, k = data[key]\r\n res = [old + cur[0], cur[1], cur[2]]\r\n m = min(res)\r\n if m > mv:\r\n mv = m\r\n mn = [k, i]\r\n if old < cur[0]: \r\n data[key] = (cur[0], i)\r\n else: \r\n data[key] = (cur[0], i)\r\n \r\n m = cur[0] \r\n if m > mv:\r\n mv = m\r\n mn = [i]\r\n\r\nprint(len(mn)) \r\nprint(\" \".join(map(lambda x: str(x+1), mn))) " ]

[ "a1 = '31 28 31 30 31 30 31 31 30 31 30 31 '\r\na2 = '31 29 31 30 31 30 31 31 30 31 30 31 '\r\ns = a1+a1+a1+a2+a1+a1\r\nt = int(input())\r\na = input().strip()\r\nans = 'NO'\r\nif a in s:\r\n ans = 'YES'\r\nprint(ans)", "import sys\n\n\ndef readlines(type=int):\n return list(map(type, sys.stdin.readline().split()))\n\n\ndef read(type=int):\n return type(sys.stdin.readline().strip())\n\n\njoint = lambda it, sep=\" \": sep.join(\n [str(i) if type(i) != list else sep.join(map(str, i)) for i in it])\n\n\ndef solve(days):\n l1 = \"31,29,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31\"\n l2 = \"31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31\"\n l3 = \"31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31\"\n l4 = \"31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31\"\n daystr = \",\".join(days)\n if daystr in l1 or daystr in l2 or daystr in l3 or daystr in l4:\n return \"Yes\"\n return \"No\"\n\n\ndef main():\n read()\n days = readlines(str)\n print(solve(days))\n\n\nmain()\n", "import os\r\n\r\nn=int(input())\r\n\r\narr=list(map(int,input().split()))\r\nx=[31,0,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31]\r\nif 29 in arr:\r\n\tx[1]=29\r\nelse:\r\n\tx[1]=28\r\n\r\ncheck=0\r\nfor i in range(0,24):\r\n\tz=0\r\n\tfor j in range(n):\r\n\t\tif arr[j]!=x[(i+j)%24]:\r\n\t\t\tz=1\r\n\t\t\tbreak\r\n\tif z==0:\r\n\t\t#print(i)\r\n\t\tcheck=1\r\n\t\tbreak\r\nif check==1:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "n = int(input())\r\nmas1 = '312831303130313130313031' * 3\r\nmas2 = '312831303130313130313031312831303130313130313031312931303130313130313031312831303130313130313031312831303130313130313031312831303130313130313031'\r\nmas3 = ''.join(list(input().split()))\r\nif mas3 in mas1 or mas3 in mas2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "x = '31 28 31 30 31 30 31 31 30 31 30 31 '\r\ny = '31 29 31 30 31 30 31 31 30 31 30 31 '\r\ninput()\r\nprint(['NO','YES'][input() in (x*3+y+x*3)])\r\n \t\t \t\t \t ", "import webbrowser\r\nif True == False:\r\n\turl = input()\r\n\r\n\t#webbrowser.get(using='firefox')\r\n\r\n\t#webbrowser.register('firefox',('mozilla'))\r\n\twhile True :\r\n\t\twebbrowser.open(url)\r\nelse:\r\n\ta ='31 28 31 30 31 30 31 31 30 31 30 31 '\r\n\tb ='31 29 31 30 31 30 31 31 30 31 30 31 '\r\n\ts = a+a+a+b+a+a+a+a+b # Overkill\r\n\tinput()\r\n\tif input().strip() in s:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n", "n=int(input())\r\nprint(['No','Yes'][input().replace(' ','') in ''.join(map(str,([31,28,31,30,31,30,31,31,30,31,30,31]*3+[31,29,31,30,31,30,31,31,30,31,30,31])*2))])", "n=int(input())\nl=[int(x) for x in input().split()]\np1=[31,28,31,30,31,30,31,31,30,31,30,31]\np2=[31,29,31,30,31,30,31,31,30,31,30,31]\ncp1=p2+p1+p1\ncp2=p1+p2+p1\ncp3=p1+p1+p2\nfor i in range(12):\n\tif cp1[i]==l[0]:\n\t\tj=i+1\n\t\tlength=1\n\t\twhile length<n and j<36:\n\t\t\tif l[length] != cp1[j]:\n\t\t\t\tbreak\n\t\t\tlength+=1\n\t\t\tj+=1\n\t\tif length==n:\n\t\t\tprint('Yes')\n\t\t\texit(0)\nfor i in range(n+11):\n\tif cp2[i]==l[0]:\n\t\tj=i+1\n\t\tlength=1\n\t\twhile length<n and j<35:\n\t\t\tif l[length] != cp2[j]:\n\t\t\t\tbreak\n\t\t\tlength+=1\n\t\t\tj+=1\n\t\tif length==n:\n\t\t\tprint('Yes')\n\t\t\texit(0)\nfor i in range(n+11):\n\tif cp3[i]==l[0]:\n\t\tj=i+1\n\t\tlength=1\n\t\twhile length<n and j<35:\n\t\t\tif l[length] != cp3[j]:\n\t\t\t\tbreak\n\t\t\tlength+=1\n\t\t\tj+=1\n\t\tif length==n:\n\t\t\tprint('Yes')\n\t\t\texit(0)\nprint('No')", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31]\r\nfor i in range(96-n):\r\n if a==b[i:i+n]:\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")", "def main():\r\n dm = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n vm = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\n months = dm + dm + dm + vm\r\n months *= 2\r\n\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n for i in range(len(months) - n):\r\n if months[i:i + n] == a:\r\n print(\"Yes\")\r\n return\r\n\r\n print(\"No\")\r\n\r\n\r\nmain()\r\n", "input()\r\nprint('Yes' if input() in ('31 28 31 30 31 30 31 31 30 31 30 31 '*3+'31 29 31 30 31 30 31 31 30 31 30 31 ')*2 else 'No')", "e = ['31', '28', '31', '30', '31', '30', '31', '31', '30', '31', '30', '31']\r\ne_v = ['31', '29', '31', '30', '31', '30', '31', '31', '30', '31', '30', '31']\r\ne_1 = e_v + e + e\r\ne_2 = e + e_v + e\r\ne_3 = e + e + e_v\r\ne_4 = e + e + e\r\ninput()\r\ns = input().split()\r\nb = False\r\nfor i in range(36 - len(s)):\r\n if e_1[i:i+len(s):] == s or e_2[i:i + len(s):] == s or e_3[i:i + len(s):] == s or e_4[i:i + len(s):] == s:\r\n b = True\r\n break\r\nif b:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\nl = []\r\nfor i in range(3):\r\n l += [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nnl = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] + \\\r\n [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] + \\\r\n [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nml = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] + \\\r\n [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] + \\\r\n [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\npl = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] + \\\r\n [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] + \\\r\n [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\narr = list(map(int,input().split()))\r\nf = 0\r\nfor i in range(36-len(arr)):\r\n if arr == l[i:i+len(arr)] or arr == nl[i:i+len(arr)] or arr == ml[i:i+len(arr)] or arr == pl[i:i+len(arr)]:\r\n f = 1\r\n break\r\n\r\nif f==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "a = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nb = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nc = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nd = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nn = int(input())\r\nv = [int(i) for i in input().split()]\r\n\r\nans = False\r\nfor i in range(len(a) - n):\r\n if v == a[i:i+n]:\r\n ans = True\r\n\r\nfor i in range(len(a) - n):\r\n if v == b[i:i+n]:\r\n ans = True\r\n\r\nfor i in range(len(a) - n):\r\n if v == c[i:i+n]:\r\n ans = True\r\n\r\nfor i in range(len(a) - n):\r\n if v == d[i:i+n]:\r\n ans = True\r\n\r\nif ans:\r\n print('Yes')\r\nelse:\r\n print('No')", "m=\"312831303130313130313031\"\r\nn=\"312931303130313130313031\"\r\ns1=3*m\r\ns2=m+n+m\r\ns3=n+2*m\r\ns4=2*m+n\r\nn=int(input())\r\na=list(map(str,input().split(' ')))\r\ns=\"\"\r\nfor i in range(0,len(a)):\r\n s+=a[i]\r\nif s in s1 or s in s2 or s in s3 or s in s4:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n", "n = int(input())\r\nl = input()\r\nstr1 = \"31 28 31 30 31 30 31 31 30 31 30 31 \"\r\nstr2 = \"31 29 31 30 31 30 31 31 30 31 30 31 \"\r\nstr3 = str1 + str1 + str1 + str2 + str1 + str1 + str1\r\nif l in str3.strip():\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "from collections import Counter\r\nyear = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nn = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nflag = True\r\ncount = count2 = 0\r\nfor i in range(12):\r\n count = i\r\n for j in range(n):\r\n flag = False\r\n if(year[count]!=li[j]):\r\n if(year[count]<30 and li[j]<30):\r\n if li[j]==29:\r\n count2+=1\r\n else:\r\n flag = True\r\n break\r\n count = count+1 if count<11 else 0\r\n if(not flag):\r\n break\r\n\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n if(count2>1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "def sublist(lst1, lst2):\r\n l =len(lst1)\r\n \r\n for i in range(36-l+1):\r\n cnt=0\r\n ans=0\r\n for j in range(i,i+l):\r\n if(lst2[j]!=lst1[cnt]):\r\n ans=1\r\n cnt+=1\r\n if(ans==0):\r\n return 1\r\n return 0\r\n\r\n\r\nn=int(input())\r\narr=list(map(int,input().strip().split(' ')))\r\nnormal=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nleap=[31,29,31,30,31,30,31,31,30,31,30,31]\r\ncase1=[]\r\ncase1.extend(normal)\r\ncase1.extend(normal)\r\ncase1.extend(normal)\r\ncase2=[]\r\ncase2.extend(normal)\r\ncase2.extend(normal)\r\ncase2.extend(leap)\r\ncase3=[]\r\ncase3.extend(normal)\r\ncase3.extend(leap)\r\ncase3.extend(normal)\r\ncase4=[]\r\ncase4.extend(leap)\r\ncase4.extend(normal)\r\ncase4.extend(normal)\r\n\r\nif(sublist(arr,case1) or sublist(arr,case2) or sublist(arr,case3) or sublist(arr,case4)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = '312831303130313130313031312831303130313130313031312931303130313130313031312831303130313130313031312831303130313130313031'\r\nn = int(input())\r\ns = ''.join(i for i in input().split())\r\nif s in a:\r\n print('Yes')\r\nelse:\r\n print('No')", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nf = 0\r\nmon = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nfor i in range(12):\r\n ff = 1\r\n leap = False\r\n for j in range(n):\r\n ind = (i + j) % 12\r\n if (a[j] != mon[ind]):\r\n if (not leap and mon[ind] == 28 and a[j] == 29):\r\n leap = True\r\n else:\r\n ff = 0\r\n \r\n if ff:\r\n f = 1\r\n\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnormal = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nleap = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\noptions = []\r\n#lnn\r\nfor i in range(12):\r\n an_option = []\r\n for j in range(n):\r\n if i + j < 12:\r\n an_option.append(leap[i+j])\r\n elif i + j < 24:\r\n an_option.append(normal[i+j-12])\r\n else:\r\n an_option.append(normal[i+j-24])\r\n options.append(an_option)\r\n#nln\r\nfor i in range(12):\r\n an_option = []\r\n for j in range(n):\r\n if i + j < 12:\r\n an_option.append(normal[i+j])\r\n elif i + j < 24:\r\n an_option.append(leap[i+j-12])\r\n else:\r\n an_option.append(normal[i+j-24])\r\n options.append(an_option)\r\n#nnl\r\nfor i in range(12):\r\n an_option = []\r\n for j in range(n):\r\n if i + j < 12:\r\n an_option.append(normal[i+j])\r\n elif i + j < 24:\r\n an_option.append(normal[i+j-12])\r\n else:\r\n an_option.append(leap[i+j-24])\r\n options.append(an_option)\r\n#nnn\r\nfor i in range(12):\r\n an_option = []\r\n for j in range(n):\r\n if i + j < 12:\r\n an_option.append(normal[i+j])\r\n elif i + j < 24:\r\n an_option.append(normal[i+j-12])\r\n else:\r\n an_option.append(normal[i+j-24])\r\n options.append(an_option)\r\na = [int(i) for i in input().split()]\r\nif a in options:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def monthes(lst):\r\n a = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30,\r\n 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31,\r\n 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n count = 0\r\n for i in range(len(a) - 1):\r\n if lst == a[i:(i + len(lst))]:\r\n count += 1\r\n if count >= 1:\r\n return \"Yes\"\r\n return \"No\"\r\n\r\n\r\nn = int(input())\r\nb = [int(i) for i in input().split()]\r\nprint(monthes(b))\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ns='312831303130313130313031312831303130313130313031312931303130313130313031312831303130313130313031312831303130313130313031'\r\ns2=\"\"\r\nfor i in a:\r\n s2+=str(i)\r\n\r\nif s2 in s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "\"\"\"\r\n@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n ..,,,,,,,,************,,,,,,,,,,,,,.\r\n ..,*. .,,,,,,,,,,,,,,,,,,,,,,,,...\r\n #&@@@@@@@@@@@@@@@@@( .....,,,,,,,.....\r\n (*@@@@@@@@@@@@@@@@@@@@@@@@&* ...,,,,,\r\n &*&@@@@@@%@%,.*%@@@@@@@@@@@@@@@@& (&@@@@&%/ ..,,,,,,,,,,,,,*******\r\n ##@@@@@@&#, *@@@@@@@@@@@@ (@@@@@@@@@@@@@@@@@@@@@( . /@@@@(,,,,,,,*********//\r\n (@@@@@@@. #@@@@@@@@@@* %@@@@@@@@@@@@&&@@@@@@@@@@@@@@@% ,@@@@@@% /@@@@@@(...,,,,,,,,,,,,,,**\r\n ,,@@@@@@, #@@@@@@@&, %@@@@@@@/ #@@@@@@@& @@@@@@@@@& .... ,@@@@@@@/ ..,,,,,,,,\r\n ,@@@@@@, .&@@@@&. &@@@@@@. ,&@@@@@@, @@@@@@@@@@, @@@@@@@@% ..,,,\r\n /&@@@@@/ &@ %@@@@@@ #@@@@@@/ /@@@@@@@@@@& @@@@@@@@@@ .\r\n @@@@@@/ &@@@@@, *@@@@@@. @@@@@@@@@@@@ *@@@@@@@@@@&\r\n &&@@@@% @@@@@@ .&@@@@@@@@@@@@& (@@@@@@ #@@@@@@@@@@@# @@@@@@@@@@@&\r\n *%&&@@@*# @@@@@@ /@@@@@@@@@@@@@@@@@@@% @@@@@@ .@@@@@@@@@@@@ @@@@@@@@@@@&\r\n .&@@@@@*( /@@@@@, @@@@@@@@@@@# &@@@@@@@@@( &@@@@@ .@@@@@@@@@@@& @@@@@@@@@@@,\r\n .&@@@@@@% &@@@@@ @@@@@@@@@@@. @@@@@@@@& &@@@@@ &@@@@@@@@@@@@@@@@@@@@\r\n (/@@@@@@@#. @@@@@& ,@@@@@@@@@ .@@@@@@% @@@@@% @@@@@@@@@@@@@@@@@#\r\n &%@@@@@@@@@# @@@@@& *@@@@@@@@ /@@@@@& ,@@@@@ @@@@@@@@@@@@@@,\r\n (,@@@/%@@@@@@@@@@@&, &@@@@@ @@@@@@@& @@@@@@* @@@@@. @@@@@@@@@@@\r\n . &@@@@@@@@@@@@@@@@@@@, @@@@@( *@@@@@@@, ,@@@@@@@ @@@@@, ,@@@@@@@@@@@@\r\n .&@@@@@@@@@@@@@@@@@@, &@@@@@ (@@@@@@@& ,@@@@@@@& @@@@@ @@@@@@@@@@@@@@@@\r\n (@@@@@@@@@@@@, &@@@@@ @@@@@@@@@@@@@&@@@@@@@@@@@ @@@@@@ /@@@@@@@@.@@@@@@@@@&\r\n %@@@@@@@@@% @@@@@@ &@@@@@@@@@@@@@@@@@@@@( #@@@@& (@@@@@@@& .@@@@@@@@@/\r\n *@@@@@@@@# @@@@@@. &@@@@@@@@@@@@@@, &@@@@@. .@@@@@@@# @@@@@@@@@\r\n &@@@@@@@ &@@@@@& %@@@@@@ *@@@@@@@ @@@@@@@@&\r\n &@@@@@@, %@@@@@@& &@@@@@@( .....,,.&@@@@@@& #&@@@@@@.\r\n %@@@@@@ ........@@@@@@@@ . %@@@@@@@( .,,,,,,,,*@@@@@@@ /@@@@@@@\r\n &@@@@@@ .....,,,,,,,,@@@@@@@@# *@@@@@@@@@. ..,,,,,,,,,,%@@@@@@@ .@@@@@@#\r\n @@@@@@. ....,,,,,,,,,,,@@@@@@@@@@@@@@# *&@@@@@@@@@@@@@@@@ .,,,,,,,,,,,,,,@@@@@@@* @@@@@@,\r\n * @@@@@@, ...,,,,,,,,,,,,(@@@@@@/@@@@@@@@@@@@@@@@@@@@@@@@@@& @@@@@@@# .,,,,,,,,,,,,,,,,#@@@@@@& @@@@@&\r\n @@@@/ @@@@@@,...,,,,,,,,,,,,,@@@@@@@ *&@@@@@@@@@@@@@@@@% @@@@@@@@,,,,,,&&#*,,,,,,,,,%@@@@@@ @@@@@#\r\n &@@@@@ &@@@@@@,,,,,,&@@@@*,,,/@@@@@@& *@@@@@@@*,,,*@@@&,,... #@@@@@ .@@@@&\r\n &@@@@@# @@@@@@@,,,,,,%@@@@@@@/@@@@@@@. ..@@@@@@@(,,*@@@@( (@@@@/ ,@@@@.\r\n ,@@@@@@/ &@@@@@@@,,,,,,,,,@@@@@@@@@@@@, ....,,%@@@@@@% @@@@@ @@@@ (@@@*\r\n &@@@@@@@ ,@@@@@@@@@,,,,,,,,,,,,/@@@@@@@@# ..........@@@@@@% &@@@@ #@% @@@&\r\n #@@@@@@@@. (@@@@@@@@@@,,,,,,,,,,,.../@@@@@@@@@@@. .... %@@@@@%.@@@@ *@@#/\r\n .@@@@@@@@@@&, *@@@@@@@@@@@@&,,,,,,,,,... .@@@@@@&*@@@@@@@% @@@@@@@@@@& &@@(\r\n @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@%..,,,,,,.... .@@@@@@@. #@@@@@@@ &&& %@@@@@@@@@ %&%\r\n &@@@@@@&@@@@@@@@@@@@@@@@@@@@@@@%............ @@@@@@@/ /@&% &@@@@@@@@&. @@@@@@@@ (&/\r\n (@@@@@@, *&@@@@@@@@@&/ .... (@@@@@@# &&@@@@@@@@@@@@@@@@@@@@@* *\r\n *** %@@@@@& .(@@@@@@@@@@@@@@@@%......\r\n ,&, ....,,,,,,,,,,,,,,,,,,/&@@@@@@*.\r\n ...,,,,,,,,,,,,,,,,,,,,,,,,,,,,,... .,,,\r\n ...,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,.. ..,,,,****\r\n ..,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,.. .,,,,,,****////\r\n\"\"\"\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ny = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nfor i in range(len(y) - n):\r\n if y[i:i + n] == a:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n \r\n ", "n = int(input())\na = [int(i) for i in input().split()]\nleap = [31,29,31,30,31,30,31,31,30,31,30,31]\nnonleap = [31,28,31,30,31,30,31,31,30,31,30,31]\nal = nonleap + leap + nonleap + nonleap\nfor i in range(len(al)):\n f = 1;\n for j in range(i, i + len(a)):\n if al[j % len(al)] != a[j - i]:\n f = 0;\n break\n if f == 1:\n print('Yes')\n exit(0)\nprint('No')\n", "str=\"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31 \"\r\nstr+=str\r\nn=int(input())\r\ns=input()\r\nprint(\"YES\" if s in str else \"NO\")\r\n", "a=[31,28,31,30,31,30,31,31,30,31,30,31]*4\r\nb=[31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31]*2\r\nn=int(input())\r\nxx=list(map(int,input().split()))\r\nfor i in range(24):\r\n if xx==a[i:i+n] or xx==b[i:i+n]:\r\n print(\"Yes\");exit()\r\nprint(\"No\") ", "n = int(input())\r\na = [x for x in input().split()]\r\nq = ''.join(a)\r\ns = '312831303130313130313031312831303130313130313031312931303130313130313031312831303130313130313031312831303130313130313031'\r\nif q in s:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n = int(input())\r\narr = input().split()\r\ns = ''.join(arr)\r\nch = '312831303130313130313031312831303130313130313031312831303130313130313031312931303130313130313031'*2\r\nif s in ch:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=[*map(int,input().split())]\r\nlst=[31,28,31,30,31,30,31,31,30,31,30,\r\n 31]*3+[31,29,31,30,31,30,31,31,30,\r\n 31,30,31]+[31,28,31,30,31,30,31,31,30,31,30,31]*3\r\nfrom sys import exit\r\nfor i,x in enumerate(lst):\r\n if i+n<84:\r\n if lst[i:i+n]==a:\r\n print('YES');exit()\r\nprint('NO')", "from sys import exit\r\n\r\nn = int(input())\r\nA = [int(s) for s in input().split()]\r\n\r\nflag = 0\r\n\r\nmonths = [31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31]\r\n\r\nfor i in range(24):\r\n flag = 0\r\n for j in range(n):\r\n if(A[j] != months[(i+j)%24]):\r\n if(A[j] == 29 and months[(i+j)%24] == 28 and flag == 0):\r\n flag = 1\r\n else:\r\n flag = 2\r\n break\r\n if(flag == 0 or flag == 1):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n\r\n \r\n", "input()\nprint('Yes' if input() in ('31 28 31 30 31 30 31 31 30 31 30 31 '*3+'31 29 31 30 31 30 31 31 30 31 30 31 ')*2 else 'No')\n\t \t\t\t\t \t\t \t \t \t \t\t \t \t \t", "n = int(input())\r\nmonths = input()\r\n\r\nyear_v = \"31 29 31 30 31 30 31 31 30 31 30 31 \"\r\nyear = \"31 28 31 30 31 30 31 31 30 31 30 31 \"\r\n\r\nyears = year_v + year*3 + year_v + year\r\n\r\nif (years.find(months) >= 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nup = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nfor i in range(len(up)):\r\n for j in range(len(up)):\r\n if up[i:j + 1] == a:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "def process(A):\r\n n = len(A)\r\n month1 = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n month2 = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n months = [month1+month1+month1+month1, month1+month1+month1+month2, \r\n month1+month1+month2+month1, month1+month2+month1+month1, month2+month1+month1+month1]\r\n for M in months:\r\n m = len(M)\r\n for i in range(m-n):\r\n works = True\r\n for j in range(n):\r\n if M[i+j] != A[j]:\r\n works = False\r\n break\r\n if works:\r\n return 'Yes'\r\n return 'No'\r\n\r\nn = int(input())\r\nA= [int(x) for x in input().split()]\r\nprint(process(A))", "def main():\r\n n = int(input())\r\n s = input()\r\n data = \"31 28 31 30 31 30 31 31 30 31 30 31 \"\r\n data1 = \"31 29 31 30 31 30 31 31 30 31 30 31 \"\r\n data2 = data1 + data + data + data\r\n data3 = data + data1 + data + data\r\n data4 = data + data + data1 + data\r\n data5 = data + data + data + data1\r\n if data2.find(s) != -1 :\r\n print(\"Yes\")\r\n return\r\n if data3.find(s) != -1 :\r\n print(\"Yes\")\r\n return\r\n if data4.find(s) != -1 :\r\n print(\"Yes\")\r\n return\r\n if data5.find(s) != -1 :\r\n print(\"Yes\")\r\n return\r\n else:\r\n print(\"No\")\r\nif __name__ == \"__main__\" :\r\n main()", "months=[31,28,31,30,31,30,31,31,30,31,30,31]\nn=int(input())\narr=list(map(int,input().split()))\nflag= 0\ncount=0\ncount2=0\n\nfor i in range(12):\n count = i\n\n for j in range(n):\n flag=0\n if months[count]!=arr[j]:\n if months[count]<30 and arr[j]<30:\n if arr[j]==29:\n count2+=1\n else:\n flag=1\n break\n if count<11:\n count+=1\n else:\n count=0\n if flag==0:\n break\n\nif flag==1:\n print('NO')\n\nelse:\n if count2>=2:\n print('NO')\n else:\n print('YES')\n", "n = int(input())\r\ndays = list(map(int, input().split()))\r\nl = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,\r\n 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,\r\n 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,\r\n 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,\r\n 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nif str(days)[1:-1] in str(l)[1:-1]:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "normal='312831303130313130313031'\nleap='312931303130313130313031'\nyears_5=normal*2+leap+normal*2\nn=int(input())\nA=[a for a in input().split()]\nA=''.join(A)\nif(A in years_5):\n print('YES')\nelse:\n print('NO')\n\t \t\t \t\t\t \t\t\t \t \t \t\t \t\t\t\t \t", "s=[31,28,31,30,31,30,31,31,30,31,30,31]\r\na=[31,29,31,30,31,30,31,31,30,31,30,31]\r\nres=s+s+s+a+s+s\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\n#for i in res:\r\n# print(i)\r\nfor i in range(0,len(res)-len(b)+1):\r\n temp=i\r\n \r\n c=0\r\n for j in b:\r\n if j!=res[temp]:\r\n break\r\n #print(temp)\r\n temp+=1\r\n c+=1\r\n if c==len(b):\r\n break\r\n#print(c)\r\nprint(\"Yes\" if c==len(b) else \"No\")\r\n", "year = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nleap = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nyear = list(map(str, year))\nleap = list(map(str, leap))\n\nyear1 = \" \".join(year+year+year+year)\nyear2 = \" \".join(leap+year+year+year)\nyear3 = \" \".join(year+leap+year+year)\nyear4 = \" \".join(year+year+leap+year)\nyear5 = \" \".join(year+year+year+leap)\n\nn = int(input())\nstr = input()\n\nif str in year1 or str in year2 or str in year3 or str in year4 or str in year5:\n\tprint('Yes')\nelse:\n\tprint('No')\n", "cal = [31, 28, 31, 30, 31, 30,\n\t31, 31, 30, 31, 30, 31,\n\t31, 28, 31, 30, 31, 30,\n\t31, 31, 30, 31, 30, 31,\n\t31, 28, 31, 30, 31, 30,\n\t31, 31, 30, 31, 30, 31,\n\t31, 29, 31, 30, 31, 30,\n\t31, 31, 30, 31, 30, 31,\n\t31, 28, 31, 30, 31, 30,\n\t31, 31, 30, 31, 30, 31,\n\t31, 28, 31, 30, 31, 30,\n\t31, 31, 30, 31, 30, 31,\n\t31, 28, 31, 30, 31, 30,\n\t31, 31, 30, 31, 30, 31,]\n\nn = int(input())\nd = list(map(int, input().split()))\nfor i in range(len(cal) - n):\n\tif(cal[i:i+n] == d):\n\t\tprint(\"YES\")\n\t\texit()\nprint(\"NO\")", "u = '31 28 31 30 31 30 31 31 30 31 30 31 '\r\nv = '31 29 31 30 31 30 31 31 30 31 30 31 '\r\n\r\ninput()\r\nprint(['NO', 'YES'][input() in (u * 3 + v + u * 3)])", "order = [\r\n 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, \r\n 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,\r\n 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,\r\n 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,\r\n 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,\r\n 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31\r\n ]\r\n\r\nn = int(input())\r\n\r\ns = [int(j) for j in input().split()]\r\n\r\nfor i in range(len(order) - n + 1) :\r\n ans = 0\r\n for a, b in zip(order[i:], s) :\r\n if a != b : break\r\n ans += 1\r\n if ans == n : break\r\n\r\nprint((\"YES\" if ans == n else \"NO\"))", "arr = \"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\r\nn = int(input())\r\ns = input()\r\nif(s in arr):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ne=input()\r\ny=\"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\r\ny1=\"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31\"\r\nyl=\"31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\r\nly=\"31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\r\nif e in y or e in y1 or e in yl or e in ly:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a='31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31,'\r\na=a*10\r\nc=input()\r\nb=input().replace(' ',',')\r\nif b in a:\r\n print('Yes')\r\nelse:\r\n print('No')", "a = \"31 28 31 30 31 30 31 31 30 31 30 31 \"\r\nb = \"31 29 31 30 31 30 31 31 30 31 30 31 \"\r\npre = (a + a + a, a + a + b, a + b + a, b + a + a)\r\n\r\nn = int(input())\r\nl = input()\r\n\r\nc = lambda x, y: l in x + y\r\nprint(\"Yes\" if any(l in s for s in pre) else \"No\")", "months = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nloop = []\nfor i in range(12):\n if i % 4 == 0:\n months[1] = 29\n else:\n months[1] = 28\n loop += months\nloop = ''.join(str(_) for _ in loop)\n\nn = int(input())\na = input().strip().replace(' ', '')\n\n\nprint('Yes' if a in loop else 'No')\n", "a = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nn = int(input())\r\nb = list(map(int, input().split()))\r\nfor i in range(60 - n):\r\n if a[i:i + n] == b:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "n=int(input())\r\na=list(map(str,input().split()))\r\ns=\"\"\r\ns=s.join(a)\r\nl1=\"312931303130313130313031\"\r\nl2=\"312831303130313130313031\"\r\nans=l2+l2+l1+l2+l2\r\n \r\nif ans.find(s)!=(-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def find(array, sub):\r\n flag = True;\r\n for i in range(len(array) - len(sub)):\r\n flag = True\r\n for j in range(len(sub)):\r\n if (array[i + j] != sub[j]):\r\n flag = False\r\n if (flag == True):\r\n break;\r\n return flag\r\n\r\na = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nb = [31,29,31,30,31,30,31,31,30,31,30,31]\r\naa = a + a + a\r\nab = a + a + b + a + a\r\ninput()\r\nnum = [int(i) for i in input().split()]\r\nflag1 = find(aa, num);\r\nflag2 = find(ab, num);\r\n\r\nif (flag1 or flag2):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "l=[\n31,28,31,30,31,30,31,31,30,31,30,31,\n31,28,31,30,31,30,31,31,30,31,30,31,\n31,28,31,30,31,30,31,31,30,31,30,31,\n31,29,31,30,31,30,31,31,30,31,30,31,\n]\nl+=l\nn=int(input())\nk=list(map(int,input().split()))\nlim=12*4*2-n+1\nfor i in range(0,lim):\n if k==l[i:i+n]:\n print(\"YES\");exit()\nprint(\"NO\")", "l=[\r\n31,28,31,30,31,30,31,31,30,31,30,31,\r\n31,28,31,30,31,30,31,31,30,31,30,31,\r\n31,28,31,30,31,30,31,31,30,31,30,31,\r\n31,29,31,30,31,30,31,31,30,31,30,31,\r\n]\r\nl+=l\r\nn=int(input())\r\nk=list(map(int,input().split()))\r\nlim=12*4*2-n+1\r\nfor i in range(0,lim):\r\n if k==l[i:i+n]:\r\n print(\"YES\");exit()\r\nprint(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = [31,28,31,30,31,30,31,31,30,31,30,31]\r\ny = [31,29,31,30,31,30,31,31,30,31,30,31]\r\n\r\nd = x*3 + y + x*2\r\nx = len(d)\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nfor i in range(x):\r\n if d[i:i+n] == w:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "n = int(input())\r\nmonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\na = list(map(int, input().split()))\r\ndone = False\r\nfor i in range(len(months)):\r\n mntt = i\r\n cntt = 0\r\n leape = False\r\n for j in range(len(a)):\r\n if months[mntt%12] == a[j] or (not leape and mntt%12 == 1 and months[mntt%12]+1 == a[j]):\r\n if (mntt%12 == 1 and months[mntt%12]+1 == a[j]):\r\n leape = True\r\n mntt += 1\r\n cntt += 1\r\n else:\r\n break\r\n if cntt == len(a):\r\n done = True\r\n break\r\n\r\nprint (\"Yes\" if done else \"No\")", "input()\r\nif input() in ('31 28 31 30 31 30 31 31 30 31 30 31 '*3+'31 29 31 30 31 30 31 31 30 31 30 31 ')*2:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "def inl(a, b):\r\n \"\"\"a in b\"\"\"\r\n for i in range(len(b) - len(a)):\r\n if a == b[i:i + len(a)]:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nd = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nu = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nddd = d + d + d\r\nddu = d + d + u\r\ndud = d + u + d\r\nudd = u + d + d\r\nif inl(A, ddd) or inl(A, ddu) or inl(A, dud) or inl(A, udd):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nc = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\npossible = False\r\nd = b * 3\r\nfor i in range(36 - n):\r\n if a == d[i: i + n]:\r\n possible = True\r\nd = b * 2 + c\r\nfor i in range(36 - n):\r\n if a == d[i: i + n]:\r\n possible = True\r\nd = b + c + b\r\nfor i in range(36 - n):\r\n if a == d[i: i + n]:\r\n possible = True\r\nd = c + 2 * b\r\nfor i in range(36 - n):\r\n if a == d[i: i + n]:\r\n possible = True\r\nif possible:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nl1=[31,28,31,30,31,30,31,31,30,31,30,31]*12\r\n\r\nl1[13]=29\r\nl1[61]=29\r\nl1[97]=29\r\nl1[133]=29\r\n\r\nf=0\r\nfor i in range(144-n+1):\r\n if l1[i:i+n]==lst:\r\n f=1\r\n print('yes')\r\n break\r\n \r\nif f==0:\r\n print('no')", "def leap(i):\r\n if i%100!=0 and i%4==0:\r\n return True\r\n if i%400==0:\r\n return True\r\n else:\r\n return False\r\nn=int(input())\r\nl=list(map(str,input().split()))\r\nl1=['31','28','31','30','31','30','31','31','30','31','30','31']\r\nl2=['31','29','31','30','31','30','31','31','30','31','30','31']\r\nls=\"\"\r\nfor i in range(1585,1715):\r\n if leap(i):\r\n ls+=''.join(l2)\r\n else:\r\n ls+=''.join(l1)\r\nlx=''.join(l)\r\nif lx in ls:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\n\r\n\r\ndef main_function():\r\n a = [[] for i in range(12)]\r\n a[0].append(31)\r\n a[1].append(28)\r\n a[1].append(29)\r\n a[2].append(31)\r\n a[3].append(30)\r\n a[4].append(31)\r\n a[5].append(30)\r\n a[6].append(31)\r\n a[7].append(31)\r\n a[8].append(30)\r\n a[9].append(31)\r\n a[10].append(30)\r\n a[11].append(31)\r\n n = int(input())\r\n real_a = [int(u) for u in input().split(\" \")]\r\n counter_29 = 0\r\n for i in real_a:\r\n if i == 29:\r\n counter_29 += 1\r\n if counter_29 > 1:\r\n print(\"No\")\r\n else:\r\n collector = []\r\n for i in range(len(a)):\r\n new_list = []\r\n for j in range(i, i + n):\r\n if j >= len(a):\r\n j %= len(a)\r\n new_list.append(a[j])\r\n collector.append(new_list)\r\n for q in collector:\r\n is_good = True\r\n for i in range(len(q)):\r\n if not real_a[i] in q[i]:\r\n is_good = False\r\n break\r\n if is_good:\r\n break\r\n if is_good:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n\r\n\r\n\r\nmain_function()", "from re import *\nL = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\ns = \" \".join(map(str, L))\ninput()\ni = input()\nif search(i, s):\n print(\"Yes\")\nelse:\n print(\"No\")", "def issublist(list_a, list_b):\r\n for i in range(len(list_b)-len(list_a)):\r\n if list_a == list_b[i:len(list_a)+i]:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na1 = [31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31]\r\na2 = [31,29,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31]\r\na3 = [31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31]\r\na4 = [31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31]\r\nflag = 0\r\nif issublist(a, a1):\r\n flag = 1\r\nelif issublist(a, a2):\r\n flag = 1\r\nelif issublist(a, a3):\r\n flag = 1\r\nelif issublist(a, a4):\r\n flag = 1\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31] * 5; m[2 * 12 + 1] = 29\r\nn, a = int(input()), list(map(int, input().split()))\r\nprint('Yes' if any(all(a[j] == m[i + j] for j in range(n)) for i in range(5 * 12 - n)) else 'No')", "days = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nref = days + []\r\ndays[1] = 29\r\nref += days\r\ndays[1] = 28\r\nref += days\r\n\r\nn = int(input())\r\nnums = [int(j) for j in input().split()]\r\noutput = 'no'\r\nfor j in range(len(ref)):\r\n p1, p2, count = j, 0, 0\r\n while p2 < n:\r\n if ref[p1] == nums[p2]:\r\n p1 += 1\r\n p2 += 1\r\n p1 %= len(ref)\r\n count += 1\r\n else:\r\n break\r\n if count == n:\r\n output = 'yes'\r\n break\r\nprint(output)\r\n", "n = int(input())\nA = list(map(int, input().split()))\nv1 = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nv2 = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nv = v1 + v1 + v1 + v2 + v1 + v1 + v1\nfor i in range(len(v) - n + 1):\n if A == v[i:i+n]:\n print('Yes')\n exit(0)\nprint('No')", "str=\"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31 \"\r\nstr+=str\r\nn=int(input())\r\ns=input()\r\nif s in str :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\nm1=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nm2=[31,29,31,30,31,30,31,31,30,31,30,31]\r\na=[]\r\nfor i in range(1,410):\r\n if (i%4==0 and i%100!=0) or i%400==0:\r\n a+=m2\r\n else:\r\n a+=m1\r\n\r\ndef findd(a,b):\r\n n=len(a)\r\n m=len(b)\r\n for i in range(n):\r\n if a[i:i+m]==b:\r\n return True\r\n return False\r\nif findd(a,L):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "a=[31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31]\r\nb=[31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31,31,28,31,30,31,30,31,31,30,31,30,31,31,29,31,30,31,30,31,31,30,31,30,31]\r\nn=int(input())\r\nk=list(map(int,input().split()))\r\nfor i in range(24):\r\n if k==a[i:i+n] or k==b[i:i+n]:\r\n print('Yes')\r\n exit()\r\nprint('No')\r\n\r\n ", "Year = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nn = int(input())\r\nSeq = list(map(int, input().split()))\r\n\r\n\r\nfor i in range(len(Year)):\r\n if Year[i] == Seq[0] or Year[i] + Seq[0] == 57:\r\n febr = False\r\n j = i\r\n h = 0\r\n while h < n:\r\n if Seq[h] + Year[j] == 57:\r\n if not febr:\r\n h += 1\r\n j += 1\r\n febr = True\r\n else:\r\n break\r\n elif Seq[h] == Year[j]:\r\n h += 1\r\n j += 1\r\n else:\r\n break\r\n j %= 12\r\n if h == n:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")\r\n", "n = int(input())\r\nls = input().split()\r\n\r\na = ['31', '28', '31', '30', '31', '30', '31', '31', '30', '31', '30', '31']\r\nb = ['31', '29', '31', '30', '31', '30', '31', '31', '30', '31', '30', '31']\r\n\r\n\r\nls2 = a + a + a + b + a + a\r\nif ''.join(ls) in ''.join(ls2):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "lst=[31,28, 31,30,31,30,31,31,30,31,30,31, 31,28, 31,30,31,30,31,31,30,31,30,31, 31,28, 31,30,31,30,31,31,30,31,30,31, 31,29, 31,30,31,30,31,31,30,31,30,31, 31,28, 31,30,31,30,31,31,30,31,30,31, 31,28, 31,30,31,30,31,31,30,31,30,31 ]\n\nn = int(input())\nx = list(map(int , input().split()))\nf = 0\nfor i in range(len(lst)):\n if lst[i:i+n] == x:\n f=1\n break\n \nprint(['No','Yes'][f])\n\n\n\t\t\t \t \t \t \t\t\t \t", "q=\"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\r\nw=\"31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\r\ne=\"31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\r\nr=\"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31\"\r\ninput()\r\ns=input()\r\nprint(\"YES\"if s in q or s in w or s in e or s in r else\"NO\")", "n=int(input())\r\ns=input()\r\na=\"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\r\nif s in a:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "input()\r\nprint(\r\n \"Yes\"\r\n if input()\r\n in (\r\n \"31 28 31 30 31 30 31 31 30 31 30 31 \" * 3\r\n + \"31 29 31 30 31 30 31 31 30 31 30 31 \"\r\n )\r\n * 2\r\n else \"No\"\r\n)\r\n", "n = int(input())\r\ns = list(input().split())\r\nt = ''\r\nfor i in s:\r\n t += i\r\ny1 = '312831303130313130313031'\r\ny2 = '312931303130313130313031'\r\ny3 = y2 + y1 + y1\r\ny4 = y1 + y2 + y1\r\ny5 = y1 + y1 + y2\r\ny6 = y1 + y1 + y1\r\nprint('Yes' if t in y1 or t in y2 or t in y3 or t in y4 or t in y5 or t in y6 else 'No')\r\n", "leap = [31,29,31,30,31,30,31,31,30,31,30,31]\nyear = [31,28,31,30,31,30,31,31,30,31,30,31]\n\na = []\na.append(year+year+leap)\na.append(year+leap+year)\na.append(leap+year+year)\n\nk = 0\nn = int(input())\nt = [int(i) for i in input().split(' ')]\n\nfor i in a:\n for j in range(36 - n):\n if (t == i[j:j+n]):\n print(\"Yes\")\n k = 1\n break\n if k == 1:\n break\nif k == 0:\n print(\"No\")", "import math,time,sys,os\r\nfrom math import gcd,floor,sqrt,log\r\nstart_time = time.time()\r\ndef iin(): return int(input())\r\ndef sin(): return input().strip()\r\ndef listin(): return list(map(int,input().strip().split()))\r\ndef liststr(): return list(map(str,input().strip().split()))\r\ndef ceill(x): return int(x) if(x==int(x)) else int(x)+1\r\ndef ceilldiv(x,d): x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (a*b)//gcd(a,b)\r\n\r\ndef solve():\r\n n = iin()\r\n z = \"31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 \"\r\n z *= 2\r\n x = input()\r\n if x in z:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\n\r\nt = 1\r\n# t = int(input()) \r\nfor hula in range(t):\r\n\tsolve()\r\nsys.stderr.write(str(time.time()-start_time))\r\n\r\n\r\n", "def check(A, a):\r\n cnt = len(A)\r\n flag = 0\r\n for i in range(cnt):\r\n l = i\r\n k = 0\r\n for j in range(len(a)):\r\n if l >= cnt or a[j] != A[l]:\r\n break\r\n else:\r\n l = l + 1\r\n k = k + 1\r\n if k == len(a):\r\n flag = 1\r\n return flag\r\n\r\nn = int(input())\r\na = [ int(x) for x in input().split()]\r\nA = [31, 28, 31, 30, 31, 30, 31, 31 , 30, 31, 30, 31]\r\nB = [31, 29, 31, 30, 31, 30, 31, 31 , 30, 31, 30, 31]\r\nA1 = A + A + A\r\nA2= B + A + A\r\nA3 = A + B + A\r\nA4 = A + A + B\r\nans =0\r\nans = ans | check(A1,a)\r\nans = ans | check(A2,a)\r\nans = ans | check(A3,a)\r\nans = ans | check(A4,a)\r\nif ans == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, w, m = int(input()), 'No', [31,28,31,30,31,30,31,31,30,31,30,31]*3\r\ng = list(map(int,input().split()))\r\nx = [28 if i == 29 else i for i in g]\r\nfor j in range(len(m)):\r\n if m[j:j+n] == x:\r\n w = 'Yes'\r\n break\r\nif g.count(29) == 2:\r\n print('No')\r\nelse:\r\n print(w)\r\n", "sim = \"31 28 31 30 31 30 31 31 30 31 30 31 \"#['31', '28', '31', '30', '31', '30', '31', '31', '30', '31', '30', '31']\r\nl = \"31 29 31 30 31 30 31 31 30 31 30 31 \"#['31', '29', '31', '30', '31', '30', '31', '31', '30', '31', '30', '31']\r\nnew = sim+sim+sim+l+sim+sim+sim+l\r\ninput()\r\ns = input().strip()\r\nif s in new:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n", "n=int(input())\r\nl=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nx=l[:]\r\nx[1]=29\r\nx=list(map(str,x))\r\nl=list(map(str,l))\r\nl=l*3\r\nl+=x\r\nl=''.join(l)\r\nl=l*2\r\ni=input().split()\r\ni=''.join(i)\r\nif i in l:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "a='31 28 31 30 31 30 31 31 30 31 30 31 '*3\r\nb='31 28 31 30 31 30 31 31 30 31 30 31 '*2+'31 29 31 30 31 30 31 31 30 31 30 31 '+'31 28 31 30 31 30 31 31 30 31 30 31 '*2\r\ninput()\r\nc=input()\r\nif c in a or c in b:\r\n print('Yes')\r\nelse:\r\n print('No')", "def find(array, sub):\r\n for i in range(len(array) - len(sub)):\r\n if (array[i:i+len(sub)] == sub):\r\n return True\r\n return False\r\na = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nb = [31,29,31,30,31,30,31,31,30,31,30,31]\r\naa = a + a + a + b + a + a + a\r\ninput()\r\nnum = [int(i) for i in input().split()]\r\nflag = find(aa, num);\r\nif (flag):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n=int(input())\r\nline=input().split(' ')\r\nline=[int(i) for i in line]\r\nb1=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nb2=[31,29,31,30,31,30,31,31,30,31,30,31]\r\nb=b1*3+b2+b1*3\r\ns=0\r\nfor i in range(0,84):\r\n if line==b[i:i+n]:\r\n s=1\r\nif s==1:\r\n print('Yes',end='')\r\n print('\\n')\r\nelse:\r\n print('No',end='')\r\n print('\\n')\r\n", "input()\nprint(('No', 'Yes')[''.join(chr(int(w) + 69) for w in input().split()) in\n'dadcdcddcdcddadcdcddcdcddbdcdcddcdcddadcdcddcdcddadcdcddcdcd'])", "n = int(input())\r\na = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nb = [31,29,31,30,31,30,31,31,30,31,30,31]\r\na = list(map(str,a))\r\nb = list(map(str,b))\r\nc = a*3+b\r\nc = c*10\r\nc = \"\".join(c)\r\nlis = list(map(str,input().split()))\r\nlis = \"\".join(lis)\r\nif c.find(lis)==-1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def day_feb(is_leap):\r\n if is_leap:\r\n return 29\r\n else:\r\n return 28\r\n\r\n\r\ndef make_day(day, is_leap=False):\r\n for month in range(1, 13):\r\n if month == 2:\r\n day.append(day_feb(is_leap))\r\n elif month < 8:\r\n day.append(30 + month % 2)\r\n else:\r\n day.append(30 + (month + 1) % 2)\r\n\r\n\r\ndef change(day, a, start):\r\n for i in range(0, len(a)):\r\n if a[i] != day[start + i]:\r\n return False\r\n return True\r\n\r\n\r\ndef solve(day, a):\r\n n = len(day) - len(a) + 1\r\n for i in range(0, n):\r\n if change(day, a, i):\r\n print(\"Yes\")\r\n break\r\n else:\r\n print(\"No\")\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n day = []\r\n\r\n for i in range(0, 3):\r\n make_day(day)\r\n make_day(day, True)\r\n for i in range(0, 2):\r\n make_day(day)\r\n solve(day, a)\r\n\r\n\r\nmain()\r\n", "s='312831303130313130313031312831303130313130313031312931303130313130313031'\r\nt='312831303130313130313031312931303130313130313031312831303130313130313031'\r\nr='312931303130313130313031312831303130313130313031312831303130313130313031'\r\nn=int(input())\r\nl=list(input().split())\r\nd=''.join(l)\r\nif(d in s):\r\n print(\"Yes\")\r\n print()\r\nelif(d in r):\r\n print(\"Yes\")\r\n print()\r\nelif(d in t):\r\n print(\"Yes\")\r\n print()\r\nelse:\r\n print(\"No\")\r\n print()\r\n", "s1='31 28 31 30 31 30 31 31 30 31 30 31 '\r\ns2='31 29 31 30 31 30 31 31 30 31 30 31 '\r\ninput()\r\nprint(['NO','YES'][input() in (s1*3+s2+s1*3)])", "n = int(input())\ns = input()\nmonths1 = \"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\nmonths2 = \"31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\nmonths3 = \"31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31\"\nmonths4 = \"31 28 31 30 31 30 31 31 30 31 30 31 31 28 31 30 31 30 31 31 30 31 30 31 31 29 31 30 31 30 31 31 30 31 30 31\"\nif s in months1 or s in months2 or s in months3 or s in months4:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "n = int(input())\r\nx = input()\r\nnormyear = \"31 28 31 30 31 30 31 31 30 31 30 31 \"\r\nleapyear = \"31 29 31 30 31 30 31 31 30 31 30 31 \"\r\nans = 3*normyear + leapyear + 3*normyear\r\nprint(\"Yes\" if ans.count(x) else \"No\")\r\n", "u='31 28 31 30 31 30 31 31 30 31 30 31 '\nv='31 29 31 30 31 30 31 31 30 31 30 31 '\ninput()\nprint(['NO','YES'][input() in (u*3+v+u*3)])\n \t\t \t\t \t \t \t\t \t \t" ]

[ "n = int(input())\r\ns = [int(i) for i in input().split() if int(i) != 0]\r\nprint(len(set(s)))", "n=int(input())\nli=list(map(int,input().split()))\nli.sort()\nif(len(set(li))==1 and li[0]!=0):\n\tprint(1)\nelif(len(set(li))==1 and li[0]==0):\n\tprint(0)\nelse:\n\tc=0\n\tfor i in set(li):\n\t\tif i!=0:\n\t\t\tc=c+1\n\tprint(c)\n\t\t\t\t \t \t\t \t\t\t\t \t \t \t \t\t\t\t \t\t\t", "test=int(input())\nind=list(map(int,input().split()))\nind2=set(ind)\nc=0\nfor i in ind2:\n\tif i!=0:\n\t\tc=c+1\nprint(c)\n \t \t \t \t \t \t \t \t \t\t", "def solve(arr):\r\n\r\n arrSet = set(arr)\r\n isZeroElemPresent = False\r\n\r\n for a in arrSet:\r\n if a == 0:\r\n isZeroElemPresent = True\r\n break\r\n\r\n return len(arrSet) - (1 if isZeroElemPresent else 0)\r\n\r\n\r\nn = int(input())\r\narr = [int(y) for y in input().split()]\r\nprint(solve(arr))", "n = int(input(\"\"))\narr = [int(a) for a in input(\"\").split()]\nwhile 0 in arr:\n arr.remove(0)\nprint(len(list(set(arr))))\n", "import sys\r\n\r\ndef main():\r\n s = set(sys.stdin.read().strip().split()[1:])\r\n s.discard('0')\r\n return len(s)\r\n\r\nprint(main())\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nst = set(lst)\r\na = len(st)\r\nif 0 in st:\r\n a-=1\r\nprint(a)\r\n\r\n", "n= int(input())\nl = list(map(int, input().split()))\ns = set(l)\nif 0 in s:\n\tprint(len(s)-1)\nelse:\n\tprint(len(s))\n \t \t \t \t\t \t\t\t \t\t \t \t\t", "#sa7afy\r\n#a,b = map(int,input().split())\r\n#arr=[]\r\n#arr=list(map(int,input().split()))\r\n#arr = list(dict.fromkeys(arr))\r\n#arr.sort()\r\n#n = int(input())\r\n#for i in range():\r\n#print(*list)\r\n\r\n#────────▓▓▓▓▓▓▓────────────▒▒▒▒▒▒\r\n#──────▓▓▒▒▒▒▒▒▒▓▓────────▒▒░░░░░░▒▒\r\n#────▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓────▒▒░░░░░░░░░▒▒▒\r\n#───▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒░░░░░░░░░░░░░░▒\r\n#──▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░▒\r\n#──▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░▒\r\n#─▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░░▒\r\n#▓▓▒▒▒▒▒▒░░░░░░░░░░░▒▒░░▒▒▒▒▒▒▒▒▒▒▒░░░░░░▒\r\n#▓▓▒▒▒▒▒▒▀▀▀▀▀███▄▄▒▒▒░░░▄▄▄██▀▀▀▀▀░░░░░░▒\r\n#▓▓▒▒▒▒▒▒▒▄▀████▀███▄▒░▄████▀████▄░░░░░░░▒\r\n#▓▓▒▒▒▒▒▒█──▀█████▀─▌▒░▐──▀█████▀─█░░░░░░▒\r\n#▓▓▒▒▒▒▒▒▒▀▄▄▄▄▄▄▄▄▀▒▒░░▀▄▄▄▄▄▄▄▄▀░░░░░░░▒\r\n#─▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░░▒\r\n#──▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░░░░▒\r\n#───▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀▀▀░░░░░░░░░░░░░░▒\r\n#────▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░░░░░▒▒\r\n#─────▓▓▒▒▒▒▒▒▒▒▒▒▄▄▄▄▄▄▄▄▄░░░░░░░░▒▒\r\n#──────▓▓▒▒▒▒▒▒▒▄▀▀▀▀▀▀▀▀▀▀▀▄░░░░░▒▒\r\n#───────▓▓▒▒▒▒▒▀▒▒▒▒▒▒░░░░░░░▀░░░▒▒\r\n#────────▓▓▒▒▒▒▒▒▒▒▒▒▒░░░░░░░░░░▒▒\r\n#──────────▓▓▒▒▒▒▒▒▒▒▒░░░░░░░░▒▒\r\n#───────────▓▓▒▒▒▒▒▒▒▒░░░░░░░▒▒\r\n#─────────────▓▓▒▒▒▒▒▒░░░░░▒▒\r\n#───────────────▓▓▒▒▒▒░░░░▒▒\r\n#────────────────▓▓▒▒▒░░░▒▒\r\n#──────────────────▓▓▒░▒▒\r\n#───────────────────▓▒░▒\r\n#────────────────────▓▒\r\n\r\n\r\n\r\n\r\ndef run():\r\n print(\"k\")\r\ndef run3():\r\n print(\"k\") \r\ndef run2():\r\n print(\"k\")\r\ndef kk():\r\n print(\"Sa7afy\") \r\n#code here\r\n\r\nn=int(input())\r\ncount=0\r\narr=list(map(int,input().split()))\r\narr = list(dict.fromkeys(arr))\r\nfor i in arr:\r\n if i !=0:\r\n count+=1\r\nprint(count)\r\n\r\n \r\n\r\n\r\n#endsad", "input()\r\narr = str(input()).split(' ')\r\nprint(len(set(filter(lambda x: x != '0', arr))))", "t=int(input())\nl=list(map(int,input().split()))\n\nl=set(l)\nl=list(l)\nc=0\nfor i in range(len(l)):\n if(l[i]!=0):\n c+=1\nprint(c)\n \t\t \t\t\t\t\t \t\t\t \t \t \t\t\t \t\t\t", "n = int(input())\r\n\r\na = set(input().split())\r\n\r\na.discard(\"0\")\r\n\r\nprint(len(a))\r\n", "n = int(input())\r\nprint( len(set( x for x in map( int, input().split() ) if x != 0)) )", "n=int(input())\narr=list(map(int,input().split()))\narr1=[]\nfor i in range(n):\n if arr[i]!=0:\n arr1.append(arr[i])\narr1=list(set(arr1))\nprint(len(arr1))\n \t \t\t \t \t\t \t \t\t \t \t\t\t", "n = int(input())\r\ncheck=[0]*(pow(10,5)+5)\r\na = list(map(int,input().split()))\r\nb=set(a)\r\n\r\nif 0 in b:\r\n print(len(b)-1)\r\nelse:\r\n print(len(b))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = set(map(int, input().split()))\r\nprint(len(data) + (-1 if 0 in data else 0))", "x = int(input())\ny = set(map(int,input().split()))\nif 0 in y:\n\ty.discard(0)\nprint(len(y))\n#.,fsgd\n\t \t\n \t\t\t\t \t \t \t \t \t \t \t\t\t\t", "\r\n\r\nn = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ng = []\r\nfor i in l:\r\n if i!=0:\r\n g.append(i)\r\nprint(len(set(g)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nl1=[]\r\nfor j in a:\r\n if j!=0:\r\n l1.append(j)\r\nprint(len(set(l1)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a.count(0)\r\nif (x>0):\r\n print(len(set(a))-1)\r\nelse:\r\n print(len(set(a)))", "n = int(input())\r\na = (list(set(map(int, input().split()))))\r\nif 0 in a:\r\n print(len(a)-1)\r\nelse:\r\n print(len(a))\r\n", "def main_funtion():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n d = {}\r\n for i in a:\r\n if not i == 0:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n return len(d)\r\n\r\n\r\nprint(main_funtion())\r\n", "n = int(input())\r\nlst=[int(item) for item in input().split()]\r\ninc=c=temp=0\r\nlst.sort()\r\nfor item in lst:\r\n if(item != 0):\r\n item+=inc\r\n if(item != 0):\r\n temp=-item\r\n inc+=temp\r\n c+=1\r\nprint(c)", "mvarrrrsrr1=int(input())\nmvarrrrsrr2=list(map(int,input().split()))\nwhile(0 in mvarrrrsrr2):\n mvarrrrsrr2.remove(0)\nmvarrrrsrr2=set(mvarrrrsrr2)\nprint(len(mvarrrrsrr2))\n\t \t \t\t \t\t\t \t \t \t \t\t\t\t\t", "i=input\r\ni()\r\nprint(len(set(i().split())-{'0'}))", "n=int(input())\nx=list(map(int,input().split()))\narr=sorted(x)\na=set(arr)\nif 0 in a:\n a.remove(0)\nprint(len(a))\n \t\t \t\t\t \t \t \t\t\t \t\t \t\t\t", "int(input())\r\narr = set(map(int, input().split())); arr.remove(0) if 0 in arr else ...\r\nprint(len(arr))", "p=int(input())\r\na=[int(x) for x in input().split()]\r\nk=set(a)-{0}\r\nprint(len(k))", "N = input()\r\narray = [int(i) for i in input().split()]\r\nprint(len(set([i for i in array if i])))", "z=int(input())\r\ny=list(map(int,input().split()))\r\ny=list(set(y))\r\nif 0 in y:\r\n print(len(y)-1)\r\nelse:\r\n print(len(y))", "n=int(input())\r\na=set(map(int,input().split()))\r\nc=0\r\nif 0 in a:\r\n c=1\r\nt=len(a)-c \r\nprint(t)\r\n", "n = int(input())\r\nl = input().split()\r\nl = [int(i) for i in l]\r\nl = set(l)\r\nl.discard(0)\r\nprint(len(l))", "n = int(input())\na = list(map(int, input().split()))\nd = dict()\nfor val in a:\n\tif val != 0:\n\t\td[val] = 1\nprint(len(d))\n", "n, = map(int,input().split())\r\narr = set(map(int,input().split()))\r\nprint(len(arr)-(0 in arr))\r\n", "a = int(input())\nb = list(map(int,input().split()))\nb = [i for i in b if(i!=0)]\nprint( len( set(b)))\n\t \t\t \t\t\t \t\t\t\t\t \t\t\t \t\t\t \t \t \t", "n=int(input())\nl=[int(i) for i in input().split()]\ns=set(l)\nl=[i for i in s if i!=0]\nprint(len(l))\n\t\t\t \t \t\t \t\t\t \t \t \t\t \t\t\t \t\t", "input()\nlist1=[*map(int,input().split())]\nset1=set(list1)\nset1.discard(0)\nprint(len(set1))\n", "n=int(input())\r\nx=list(input().split())\r\ny={}\r\ns=0\r\nfor i in range(n):\r\n if x[i]=='0':continue\r\n y[x[i]]=0\r\nprint(len(y))", "t=int(input())\nl=[]\nx=list(map(int,input().split()))\ns=set(int(g) for g in x)\nif 0 in s:\n s.remove(0)\n print(len(s))\nelse:\n print(len(s))\n \t\t \t \t\t \t\t\t\t\t\t \t", "n = int(input())\r\nar = set(map(int,input().split()))-{0,}\r\nprint(len(ar))\r\n", "n = int(input())\nl = set(input().split())\nif '0' in l:\n l.remove('0')\nprint(len(l))\n \t \t\t\t\t \t\t\t \t\t\t\t\t \t\t", "n = int(input())\r\ny = [int(i) for i in input().split()]\r\ny = set(y)\r\nx = 0 #len of array with no zeros\r\nfor i in y:\r\n if(i != 0):\r\n x += 1\r\nprint(x)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\nflag=0\r\nfor i in b:\r\n if i==0:\r\n flag=1\r\nif flag==1:print(len(b)-1)\r\nelse:\r\n print(len(b))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=set()\r\nfor i in a:\r\n if i!=0:\r\n b.add(i)\r\n\r\nprint(len(b))\r\n", "\nnon=int(input())\nlst=[int(iof) for iof in input().split()]\nlll=set(lst)\nif 0 in lll:\n lll.remove(0)\nprint(len(lll))\n\t\t\t \t \t\t \t\t\t \t\t \t\t \t\t \t", "n=int(input())\na=list(map(int,input().split()))\nres=list(set(a))\nx=[i for i in res if i!=0]\nprint(len(x))\n \t\t\t\t\t\t \t \t\t\t \t \t\t \t \t", "a= int(input())\nb = list(map(int,input().split()))\nb = [i for i in b if(i!=0)]\nprint(len(set(b)))\n\t \t\t\t\t \t\t \t\t \t \t \t \t \t\t", "n=input()\narray=map(int,input().split())\nprint(len(set(array)-{0}))\n\t\t\t \t \t \t \t \t\t \t\t \t\t", "import sys\nfrom collections import Counter as C\n# sys.stdin = open('in.txt', 'r') \n# sys.stdout = open('out.txt', 'w')\nn=int(input())\na=list(map(int,input().split()))\ncnt=C(a)\nif 0 in cnt:\n\tprint(len(cnt)-1)\nelse:\n\tprint(len(cnt))\n", "n = int(input())\r\na = set(input().split(\" \"))\r\nprint(len(a)+ (-1 if \"0\" in a else 0))\r\n \r\n\r\n\r\n \r\n", "varrrr3=int(input())\nvarrrr4=list(map(int,input().split()))\nwhile(0 in varrrr4):\n varrrr4.remove(0)\nvarrrr4=set(varrrr4)\nprint(len(varrrr4))\n\t\t\t \t\t\t\t \t\t\t\t\t\t\t\t \t \t\t \t", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\ns=set(arr)\r\nif 0 in s:\r\n s.remove(0)\r\nprint(len(s))\r\n\r\n", "ta=int(input())\narry=set(map(int,input().split()))\nif 0 in arry:\n arry.remove(0)\nprint(len(arry))\n \t\t\t\t \t \t\t\t\t \t\t\t \t \t \t", "t = input()\r\na = list(set(map(int,input().split())))\r\na = [i for i in a if i != 0]\r\nprint(len(a))", "k = int(input())\ne = list(map(int,input().split()))\ne = set(e)\n\nif 0 in e:\n\n e.remove(0)\nprint(len(e))\n\t\t\t\t \t \t \t \t \t\t \t \t", "n=int(input())\r\np=list(map(int,input().split()))\r\nnp=list(set(p))\r\nif 0 in np:\r\n print(len(np)-1)\r\nelse:\r\n print(len(np))", "n = int(input())\r\na =set(list(map(int,input().split())))\r\nif 0 in a:\r\n\tprint(len(a)-1)\r\nelse:print(len(a))", "i=int(input())\r\ns=list(input().split())\r\nl={}\r\nc=0\r\nfor j in range(i):\r\n if int(s[j])!=0:\r\n if int(s[j]) not in l.keys():\r\n l[int(s[j])]=1\r\n c+=1\r\n else:\r\n l[int(s[j])]+=1\r\nprint(c)", "n=int(input())\r\nx=list(map(int,input().split()))\r\n\r\na=set()\r\nfor i in range(n):\r\n if x[i]!=0:\r\n a.add(x[i])\r\n\r\nprint(len(a))\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nx = set()\r\nfor i in a:\r\n if i:\r\n x.add(i)\r\nprint(len(x))", "# from dust i have come, dust i will be\n\nn=int(input())\nx=list(map(int,input().split()))\n\na=set()\nfor i in range(n):\n if x[i]!=0:\n a.add(x[i])\n\nprint(len(a))\n", "name = int(input())\nsam=0\nba = set(int(i) for i in input().split())\nba.discard(0)\nsam+=1\nprint(len(ba))\nsam+=1\n#2000080064\n\t \t\t \t \t \t\t\t \t \t \t\t \t", "input()\narr=map(int,input().split())\nprint (len(set(arr)-{0}))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nll=list(set(l))\r\nll=[i for i in ll if i!=0]\r\nr=len(ll)\r\nprint(r)", "n = int(input())\r\na = set(map(int, input().split()))\r\nans = len(a)\r\nif 0 in a:\r\n ans -= 1\r\nprint(ans)", "input();\r\nprint(len(set(map(int,[a for a in input().split() if a!=\"0\"]))));\r\n", "q=int(input())\r\nl=list(map(int,input().split()))\r\nl=set(l)\r\nif 0 in l:\r\n l.remove(0)\r\nprint(len(l))", "n=input()\nb=map(int,input().split())\nprint(len(set(b)-{0}))\n \t\t \t\t \t\t \t\t\t\t\t\t \t \t", "n = int(input())\r\nlst = set([int(i) for i in input().split()])\r\n\r\nprint(len(lst) if 0 not in lst else len(lst)-1)\r\n", "input(); li = list(set(list(map(int ,input().split()))))\r\nif 0 in li:\r\n li.remove(0)\r\nprint(len(li))", "n=int(input())\r\nans=0\r\na=list(set(list(map(int, input().split()))))\r\nfor i in a:\r\n if i!=0:\r\n ans+=1\r\nprint(ans)\r\n", "x=int(input())\ny=list(map(int,input().split(\" \")))\nz=list(filter(lambda x:x!=0,y))\nj=list(set(z))\nprint(len(j))\n \t \t\t\t \t \t \t\t \t\t\t \t\t", "u=int(input())\ns=[int(x) for x in input().split()]\nt=[]\ns=set(s)\nfor i in s:\n if i!=0:\n t.append(i)\nprint(len(t))\n\n\t \t\t\t\t \t \t \t\t\t\t\t\t\t\t \t\t\t \t \t\t\t", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst = set(lst)\r\ncnt = 0\r\nfor i in lst:\r\n if i==0:\r\n cnt = 1\r\nprint(len(lst)-cnt)", "n=int(input())\na=list(map(int,input().split()))\nc=0\nx=set(a)\nfor i in x:\n if(i!=0):\n c=c+1 \nprint(c)\n \t \t\t\t \t\t\t\t\t \t \t\t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif 0 in l:\r\n x=len(set(l))-1\r\n print(x)\r\n \r\nelse:\r\n print(len(set(l)))", "n = int(input())\nlst = list(map(int,input().split()))\nres = list(set(lst))\ncount = 0\nfor i in res:\n if i != 0:\n count += 1\nprint(count)\n \t \t\t\t\t \t \t\t \t\t \t\t\t\t \t\t", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = set([])\r\nfor i in l:\r\n if i != 0:\r\n s.add(i)\r\nprint(len(s))", "n=int(input())\nl=list(map(int,input().split()))\nl=list(set(l))\nif 0 in l:\n\tprint(len(l)-1)\nelse:\n\tprint(len(l))\n\t \t \t\t\t \t \t\t\t\t\t\t\t\t\t \t \t \t\t \t", "from collections import Counter\r\n\r\nn = input()\r\narray = [int(c) for c in input().split()]\r\nprint(sum(1 for k, v in Counter(array).items() if k!= 0))\r\n", "n = int(input()); a= list(map(int,input().split()))\r\na = list(set(a))\r\nif 0 in a: print(len(a)-1)\r\nelse: print(len(a))", "n=int(input())\r\nx=list(map(int,input().split()))\r\narr=sorted(x)\r\na=set(arr)\r\nif 0 in a:\r\n a.remove(0)\r\nprint(len(a))", "n=int(input(''))\nl=map(int,input('').split(' '))\nl=filter(lambda x:x!=0,l)\nl=set(l)\nprint(len(l))", "k=int(input())\nnat=[int(ar) for ar in input().split()]\nnat=list(set(nat))\nfor i in nat:\n\tif i==0:\n\t\tnat.remove(i)\nprint(len(nat))\n \t \t\t \t\t \t\t \t\t\t \t \t\t \t \t", "x=int(input()) #samelogic\ny=list(map(int,input().split()))\nwhile(0 in y):\n y.remove(0)\nz=set(y)\nn=len(z)\nprint(n)\n \t \t \t\t\t \t\t \t\t\t\t\t\t \t \t\t\t\t", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\nN=int(input()) \r\nL=list(map(int,input().split()))\r\nFLAG=0\r\nfor i in L:\r\n\tif i==0:\r\n\t\tFLAG=1\r\n\t\tbreak\r\nif FLAG==0:\r\n\tprint(len(set(L)))\r\nelse:\r\n\tprint(len(set(L))-1)", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\ns=set()\r\nfor i in range(0,len(b)):\r\n if(b[i]==0 or b[i] in s):\r\n pass\r\n else:\r\n s.add(b[i])\r\nprint(len(s)) \r\n", "def search(list, sum):\r\n for i in range(len(list)):\r\n if list[i] ==0:\r\n return 1\r\n return 0\r\n\r\n\r\nn= int(input())\r\nnum = list(map(int,input().split()))\r\nsum=0\r\n\r\nvar = set(num)\r\nnum1= list(var)\r\n# print(num1)\r\nif search(num1,sum):\r\n print(len(num1) - 1)\r\nelse:\r\n print(len(num1))", "a=int(input())\nl=list(map(int,input().split()))\nl=list(set(l))\nl=[i for i in l if i!=0]\nk=len(l)\nprint(k)\n\t \t \t\t \t \t \t \t \t \t\t\t \t", "input()\r\nl = map(int, input().split())\r\nprint(len(set(l) - {0}))", "val1=int(input())\nval2=list(map(int,input().split()))\nwhile(0 in val2):\n val2.remove(0)\nval2=set(val2)\nprint(len(val2))\n \t\t \t \t \t \t \t\t\t\t\t\t\t\t\t \t \t", "n = int(input())\r\nA = [int(x) for x in input().split()]\r\nS = set(A)\r\nS.discard(0)\r\nprint(len(S))", "num_of_inputs = int(input())\nnums = list(map(int,input().split(None, num_of_inputs)[: num_of_inputs]))\nnums = list(set(nums))\ncounter=0\nfor i in nums:\n if i == 0:\n continue\n elif i != 0:\n counter += 1\nprint (counter)\n \t \t\t \t \t \t\t\t \t\t", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nprint(len(set(a)-{0}))", "n=input()\na=map(int,input().split())\nprint(len(set(a)-{0}))\n\n \t\t\t\t\t \t \t\t\t \t \t\t\t \t \t\t\t", "x=int(input())\r\nst=set(int(x) for x in input().split())\r\nprint(len(st)-1) if 0 in st else print(len(st))", "a11=int(input())\nb22=list(map(int,input().split()))\nb22=list(set(b22))\nif 0 in b22:\n print(len(b22)-1)\nelse:\n print(len(b22))\n \t\t\t\t \t \t \t\t\t\t \t\t \t\t\t\t \t \t\t", "'''input\r\n5\r\n1 1 1 1 1\r\n'''\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\na1 = []\r\nfor i in range(n):\r\n\tif arr[i]!=0:\r\n\t\ta1.append(arr[i])\r\nprint(len(set(a1)))", "an = int(input())\nan = set(int(i) for i in input().split())\nan.discard(0)\nprint(len(an))\n \t\t \t\t\t\t \t\t\t\t \t\t\t\t\t \t\t", "a=int(input())\nd=list(map(int,input().split()))\nd=list(set(d))\nif 0 in d:\n print(len(d)-1)\nelse:\n print(len(d))\n \t\t\t \t \t \t\t \t\t\t \t\t\t \t \t", "n = int(input())\r\nli = map(int, input().split())\r\na = set(li)\r\nl = len(a)\r\nif 0 in a:\r\n l = l- 1\r\nprint(l)", "ak=int(input())\nbk=list(map(int,input().split()))\nbk=list(set(bk))\nbk=[c for c in bk if c!=0]\nprint(len(bk))\n \t\t \t\t \t \t \t \t \t\t\t \t\t\t\t", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn = int(input())\r\narr = list(dict.fromkeys(list(map(int, input().split()))))\r\nif 0 in arr:\r\n arr.remove(0)\r\n print(len(arr))\r\nelse:\r\n print(len(arr))\r\n", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn = I()\r\nA = IL()\r\nprint(len(set(A)) - (0 in A))", "l=[];\nn=int(input());\ns=input();\nl=list(map(int,s.split()));\nk=set(l);\nl=list(k);\ncnt=0;\nfor i in range(len(l)):\n\tif(l[i]!=0):\n\t\tcnt+=1;\nprint(cnt);\n\t\t \t\t \t \t \t\t \t \t\t\t\t \t", "from typing import Counter\r\n\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nc = Counter(a)\r\nprint(len(c) - (1 if 0 in c else 0))", "x=int(input())\nx=list(map(int,input().split()))\nx=list(set(x))\nprint(len(x)-x.count(0))", "_ = input()\r\na = list(map(int, input().split(\" \")))\r\n\r\na.sort()\r\n#print(a)\r\nif a[0] != 0:\r\n timer = 1\r\nelse:\r\n timer = 0\r\nfor i in range(1, len(a)):\r\n if a[i] != a[i-1] and a[i] != 0:\r\n timer += 1\r\n \r\nprint(timer) ", "l=[];\nn=int(input());\ns=input();\nl=list(map(int,s.split()));\nk=set(l);\nl=list(k);\nc=0;\nfor i in range(len(l)):\n\tif(l[i]!=0):\n\t\tc+=1;\nprint(c);\n \t\t \t \t\t \t\t\t\t\t\t \t \t\t\t", "n=int(input())\nl=list(map(int,input().split()))\nll=list(set(l))\nll=[i for i in ll if i!=0]\nr=len(ll)\nprint(r)\n \t\t \t \t\t \t \t \t", "n = int(input())\r\nl = list(map(int,input().split()))\r\nprint([len(set(l)),len(set(l))-1][0 in set(l)])", "n = int(input())\r\nu = list(set(map(int, input().split())))\r\nans = len(u)\r\nfor i in u:\r\n if i == 0:\r\n ans -= 1\r\nprint(ans)\r\n", "kl=int(input())\nnm=list(map(int,input().split()))\nwhile(0 in nm):\n nm.remove(0)\nnm=set(nm)\nprint(len(nm))\n\t \t\t \t\t\t \t \t \t \t\t\t", "n=int(input())\r\nset1=set()\r\narr=[int(x) for x in input().split()]\r\nfor i in range(len(arr)):\r\n if arr[i]!=0:\r\n set1.add(arr[i])\r\nprint(len(set1))\r\n ", "n = int(input())\r\nli = list(map(int,input().split()))\r\nwhile 0 in li:\r\n li.remove(0)\r\nprint(len(set(li)))", "x = int(input())\ny = set(map(int,input().split()))\nz = 0\nif 0 in y:\n z = 1\nl = len(y)-z\nprint(l)\n\n", "from sys import stdin\nn = int(stdin.readline())\na = map(int, stdin.readline().split())\nprint(len(set(a)-{0}))\n \t\t\t \t \t \t\t\t\t \t\t\t\t \t \t\t\t", "n=int(input()) \nl=set([int(x) for x in input().split()]) \ncount=0\nfor i in l:\n if(i!=0):\n count+=1\nprint(count, end='')\n \t\t \t\t \t\t\t \t\t\t \t\t \t \t\t", "size = int(input())\r\nlst = set(map(int , input().split()))\r\nlst = list(lst)\r\nanswer = len(lst) - lst.count(0)\r\nprint(answer)", "n=int(input())\r\nli=list(set(list(map(int,input().split()))))\r\nf=0\r\nfor x in li:\r\n if x==0:\r\n f=1\r\n break\r\nif f==1:\r\n print(len(li)-1)\r\nelse:\r\n print(len(li))\r\n", "n=int(input())\nl=list(map(int,input().split()))\nx=[]\nfor i in range(len(l)):\n\tif(l[i]!=0):\n\t\tx.append(l[i])\nx=set(x)\nx=list(x)\nprint(len(x))\n\t\t \t \t \t\t \t \t \t \t\t\t\t \t", "n=int(input())\nk=0\nl=list(set(input().split()))\nfor x in l:\n if x!='0':\n k+=1\nprint(k)", "n=int(input())\nl=[int(x) for x in input().split()]\nnl=list(set(l))\nif 0 in nl:\n nl.remove(0)\n print(len(nl))\nelse:\n print(len(nl))\n\n \n\t \t \t \t \t \t \t \t\t\t\t\t\t\t \t \t", "from itertools import combinations_with_replacement \r\nimport sys\r\nfrom sys import stdin\r\nimport math\r\nimport bisect\r\n#Find Set LSB = (x&(-x)), isPowerOfTwo = (x & (x-1))\r\n# 1<<x =2^x\r\n#x^=1<<pos flip the bit at pos\r\n\r\ndef BinarySearch(a, x):\r\n i = bisect.bisect_left(a, x)\r\n if i != len(a) and a[i] == x:\r\n return i\r\n else:\r\n return -1\r\ndef iinput():\r\n return int(input())\r\ndef minput():\r\n return map(int,input().split())\r\ndef linput():\r\n return list(map(int,input().split()))\r\n\r\ndef fiinput():\r\n return int(stdin.readline())\r\ndef fminput():\r\n return map(int,stdin.readline().strip().split())\r\ndef flinput():\r\n return list(map(int,stdin.readline().strip().split()))\r\n\r\nn=iinput()\r\nlist1=linput()\r\n\r\nset1=set(list1)\r\nset1=set1-{0}\r\nprint(len(set1))", "x=input()\narr=map(int,input().split())\nprint(len(set(arr)-{0}))\n \t \t \t\t\t \t \t\t \t\t \t \t\t", "n=int(input())\nlst=list(map(int,input().split()))\nnew=set()\nfor ele in lst:\n if ele!=0:\n new.add(ele)\nprint(len(new))\n\t \t \t\t \t\t \t \t\t \t\t\t\t", "n = int(input())\nar = list(map(int,input().split()))\nwhile( 0 in ar):\n ar.remove(0)\nprint(len(set(ar)))\n \t \t \t\t\t\t \t\t \t \t\t\t \t\t\t \t", "x=int(input())\na=list(map(int,input().split()))\nb = list(set(a))\nc = [ele for ele in b if ele != 0]\nprint(len(c))\n \t \t \t \t \t \t\t \t\t \t", "n = int(input())\r\na = map(int, input().split())\r\na = list(set(a))\r\nprint(len(a) - 1 if 0 in a else len(a))\r\n\r\n# CodeForcesian\r\n# ♥\r\n# در نگاهت لیلی خود بیدا نکردم\r\n# با خجالت از چشم تو گلایه کردم\r\n\r\n", "from sys import stdin\r\nn = int(stdin.readline())\r\na = map(int, stdin.readline().split())\r\nprint(len(set(a)-{0}))", "# https://codeforces.com/problemset/problem/992/A\r\n\r\nn = input()\r\nelements = set(map(int, input().split()))\r\n\r\nif 0 in elements:\r\n print(len(elements) -1)\r\nelse:\r\n print(len(elements))", "from collections import Counter\r\n\r\nn = int(input())\r\ns = input().split()\r\nc = Counter(s)\r\ncnt = 0\r\nfor k in c:\r\n #print(i)\r\n cnt = cnt + (1 if k != '0' else 0)\r\nprint(cnt)\r\n", "n=int(input())\r\nnum=set(map(int,input().split()))\r\nans=0\r\nif 0 in num:\r\n print(len(set(num))-1)\r\nelse:\r\n print(len(set(num)))", "b=int(input())\r\nc=input().split()\r\ns=set()\r\nreq=0\r\nfor i in range(len(c)):\r\n s.add(int(c[i]))\r\nfor i in s:\r\n if(i>0 or i<0):\r\n req=req+1\r\nprint(req)", "n=int(input())\nb=list(map(int,input().strip().split()))[:n]\nc=set(b)\nl=len(c)\nif 0 in c:\n print(l-1)\nelse:\n print(l)\n \t\t \t \t\t \t\t \t \t\t\t \t \t\t \t\t\t", "n=int(input())\na=set(map(int,input().split()))\nc=0\nif c in a:\n c=1\nt=len(a)-c \nprint(t)\n \t \t \t\t\t\t\t \t \t \t\t \t \t \t\t", "value=int(input())\r\nres=list(map(int,input().split()))\r\nwhile(0 in res):\r\n res.remove(0)\r\nres=set(res)\r\nprint(len(res))\r\n", "n=int(input())\na=[int(x) for x in input().split()]\nif(0 in a):\n print(len(set(a))-1)\nelse:\n print(len(set(a)))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl = []\r\nfor i in a:\r\n\tif(i != 0):\r\n\t\tl.append(i)\r\ns = set(l)\r\nprint(len(s))", "input()\r\nprint(len(set(filter(bool,map(int,input().split())))))", "input()\r\na = {int(i) for i in input().split()}\r\nprint(len(a) - 1 if 0 in a else len(a))\r\n", "v=int(input())\nt=list(map(int,input().split()))\nt=list(set(t))\nif 0 in t:\n print(len(t)-1)\nelse:\n print(len(t))\n \t \t\t \t\t \t \t\t \t\t\t\t\t \t\t\t", "arr = int(input())\r\narr_element = input().split( )\r\n\r\ndef zero_found():\r\n while \"0\" in arr_element:\r\n arr_element.remove(\"0\")\r\n\r\nzero_found()\r\nunique_element = set(arr_element)\r\n\r\ntime = len(unique_element)\r\nprint(time)\r\n", "n=int(input())\r\na=[*map(int,input().split())]\r\nd={}\r\nfor i in a:\r\n if i!=0:\r\n if d.get(i)==None:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nprint(len(d))", "t = int(input())\r\narr = list(map(int, input().split()))\r\nd = set()\r\nfor v in arr:\r\n if v != 0:\r\n d.add(v)\r\nprint(len(d))\r\n", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=[0]*200004;E=0\r\nfor i in range(n):\r\n k=a[i]+100000\r\n if b[k]==0 and a[i]!=0:\r\n E+=1\r\n b[k]=1\r\nprint(E)", "n = int(input()) \r\na = [int(i) for i in input().split()] \r\nprint(len([i for i in set(a) if i != 0]))", "# F - Nastya and an Array\n\nn = int(input().strip())\n\narr = set(map(int, input().strip().split()))\narr.discard(0) # get rid of 0 if it already exists\nprint(len(arr)) # count number of unique elements\n\n \t\t\t \t\t\t \t\t\t\t\t \t\t\t \t\t\t \t", "n=input()\r\na = map(int,input().split())\r\nresult = len(set(a)-{0})\r\nprint(result)\r\n", "R=lambda:map(int,input().split())\r\ninput()\r\nprint(len(set(R())-set([0])))\r\n", "n=int(input())\r\nlist1=list(map(int,(input().split())))\r\ntime0=len(set(list1))\r\nif 0 in list1:\r\n time0-=1 \r\nprint(time0)", "input();s=set(map(int, input().split()));s.discard(0);print(len(s))\r\n", "n, a = int(input()), (int(i) for i in input().split())\nres = len(set(i for i in a if i != 0))\nprint(res)\n", "f=lambda:map(int,input().split())\r\nn=int(input())\r\ns=set(list(f()))-{0}\r\nprint(len(s))", "n = int(input()) \r\ntemp = input() \r\nb = list(map(int,temp.split(\" \"))) \r\nb.sort()\r\nc,d = 1,0\r\nfor i in range(n-1):\r\n if(b[i] != b[i+1]):\r\n c = c+1\r\nfor i in range(n):\r\n if(b[i] == 0):\r\n d = 1\r\nc = c-d\r\nprint(c)", "input()\r\ns = set(input().split())\r\nif '0' in s:\r\n\ts.remove('0')\r\nprint(len(s))", "n=int(input())\r\na=list(map(int,input().split()))\r\nres=list(set(a))\r\nx=[i for i in res if i!=0]\r\nprint(len(x))", "n=int(input())\na=list(map(int,input().split()))\nl = []\nfor i in a:\n\tif(i != 0):\n\t\tl.append(i)\ns = set(l)\nprint(len(s))\n\t \t \t \t\t \t \t\t \t\t\t \t \t", "L=[]\r\nE={}\r\nP=[]\r\nn=int(input())\r\nchar=input()\r\nL=char.split()\r\nfor i in range(len(L)):\r\n if int(L[i])!=0:\r\n P.append(L[i])\r\nE=set(P)\r\nprint(len(E))\r\n", "\r\nn = int(input())\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\nD = {}\r\nfor i in L:\r\n if not i in D:\r\n D[i] = 0\r\nif 0 in D:\r\n print(len(D)-1)\r\nelse:\r\n print(len(D))", "n=int(input())\r\na=list(map(int,input().split()))\r\na=list(set(a))\r\nx=a.count(0)\r\nprint(len(a)-x)\r\n", "n = eval(input())\narr = input()\nnum = {int(n) for n in arr.split()}\ntry:\n num.remove(0)\nexcept:\n num\nprint(len(num))\n \t\t\t\t \t \t \t\t \t\t \t\t\t \t \t", "input()\r\nli = list(map(int,input().split()))\r\nif ( 0 in li):\r\n print(len(set(li))-1)\r\nelse:\r\n print(len(set(li)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(len(set(a))-int(0 in a))", "n = int(input())\na = list(map(int, input().split()))\nprint(len(set([i for i in a if i != 0])))\n\n \t \t\t\t \t \t\t \t \t \t\t \t \t\t", "a=input()\r\nc=[]\r\na=input()\r\nflag=0\r\nmap(int,a)\r\nc=a.split(' ')\r\ncount=0\r\nfor i in c:\r\n if(i=='0'):\r\n flag=1\r\n \r\n \r\n\r\n\r\nx=set(c)\r\n\r\nif(flag==1):\r\n print(len(x)-1)\r\n \r\nelse:\r\n print(len(x))\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n", "a=int(input())\r\nb=input().split()\r\nb=list(map(int,b))\r\nl=0\r\nif 0 in b:\r\n l=1\r\ng=set()\r\nfor c in range(a):\r\n g.add(b[c])\r\nprint(len(g)-l)", "# your code goes here\nn=int(input())\na=[int(x) for x in input().split()]\nk=set(a)-{0}\nprint(len(k))\n\t \t\t\t\t\t \t\t\t \t\t \t\t \t\t\t\t\t \t \t\t", "def solve(arr):\r\n\r\n alist=list(set(arr))\r\n zerocount=alist.count(0)\r\n if zerocount>0:\r\n return len(alist)-zerocount\r\n else:\r\n return len(alist)\r\n\r\n\r\n\r\nn = int(input())\r\narr = list(map(int,input().split(\" \")))\r\n#arr=[1, 1, 1, 1, 1]\r\n#arr=[5, -6, -5, 1]\r\nprint(solve(arr))", "x=int(input())\r\nl=list(map(int,input().split()))\r\nl=list(filter(lambda x:x!=0,l))\r\nl=list(set(l))\r\nprint(len(l))\r\n", "input()\r\na = input().split()\r\na = [i for i in a if i!= '0']\r\nprint(len(set(a)))\r\n", "n= int(input())\r\nl = list(map(int,input().split()))\r\n\r\nk = set(l)\r\nk-={0}\r\nprint(len(k))\r\n", "input()\r\nw = set(input().split()) - {'0'}\r\nprint(len(w))\r\n", "no = int(input())\nlst = list(map(int, input().split()))\nlst = set(lst)\nc = 0\nfor i in lst:\n if i==0:\n c = 1\nprint(len(lst)-c)\n \t\t \t \t\t\t \t \t \t \t \t \t", "n = int(input())\r\nl = set(map(int, input().split()))\r\nif 0 in l:\r\n ans = -1\r\nelse:\r\n ans = 0\r\nans += len(l)\r\nprint(ans)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nprint(len(set(l)-{0}))", "m=int(input())\ns=list(map(int,input().split()))\ns=list(set(s))\nif 0 in s:\n print(len(s)-1)\nelse:\n print(len(s))\n\t\t\t\t \t\t \t \t\t\t \t\t\t \t \t \t \t", "ta=int(input())\n#declaring and reading input\narry=set(map(int,input().split()))\n#ifelse\nif 0 in arry:\n arry.remove(0)\nprint(len(arry))\n\t \t \t\t \t\t\t\t\t\t \t\t \t\t\t\t\t \t \t", "input()\r\nprint(len({*map(int,input().split())} - {0}))", "from sys import stdin\nn = int(stdin.readline())\na = [int(i) for i in stdin.readline().split(' ')]\n\ns = set(a)\n\nif 0 in s:\n s.remove(0)\nprint(len(s))\n \t \t\t \t\t \t\t\t \t \t \t\t\t\t \t\t\t\t", "n=input()\nlst1=map(int,input().split())\nprint(len(set(lst1)-{0}))\n \t \t\t\t\t\t\t\t \t\t\t\t\t\t\t \t \t \t", "input()\ns = set(input().split()) - {'0'}\nprint(len(s))\n", "x=int(input())\ny=set(input().split())\nd=0\nfor i in y:\n if i!='0':\n d+=1\nprint(d)\n\n\n \t \t\t \t \t \t \t\t\t\t\t \t\t \t\t", "no11=int(input())\nno21=list(map(int,input().split()))\nwhile(0 in no21):\n no21.remove(0)\nno21=set(no21)\nprint(len(no21))\n\t \t \t \t \t \t \t \t \t \t\t\t \t\t", "\r\nfrom collections import Counter \r\n\r\nn=int(input())\r\nl=[int(s) for s in input().split()]\r\n \r\nif 0 in l:\r\n print (len(Counter(l).keys())-1)\r\nelse:\r\n print (len(Counter(l).keys())) \r\n", "a=input()\nn=[int(i) for i in input().split()]\nprint(len(set(n)-{0}))\n \t\t \t\t\t\t\t \t \t \t\t \t \t \t \t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nll=[i for i in l if i!=0]\r\nl=list(set(ll))\r\nprint(len(l))", "n= int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nc=1\r\nfor i in range(len(l)-1):\r\n if l[i]!=l[i+1]:\r\n c+=1\r\nif 0 in l:\r\n c-=1\r\nprint(c)", "if __name__ == \"__main__\":\n\tn = int(input().strip())\n\tarr = list(map(int, input().strip().split(' ')))\n\tr = list(set(arr) - {0})\n\tprint(len(r))\n\t\t \t\t\t\t\t \t\t\t \t\t \t \t \t \t", "n=int(input())\na=list(map(int,input().split()))\nr=len(set(a))\nif 0 in a:\n print( r-1)\nelse:\n print(r)\n \n \n\n \t\t\t\t\t\t\t \t\t \t \t\t \t \t \t\t\t", "n=int(input())\narr=list(map(int,input().split()))\nk=set(arr)\nc=0\nfor i in k:\n if i!=0:\n c+=1\nprint(c)\n\t\t \t \t \t \t\t\t\t\t \t\t\t \t\t\t\t", "n = int(input())\r\nlol = set()\r\nfor x in list(map(int, input().split())):\r\n lol.add(x)\r\nprint(len(lol) - (0 in lol))", "k = int(input())\narr = [int (i) for i in input().split()]\narr.sort()\nc =0\nfor i in range(len(arr)-1):\n if arr[i]==arr[i+1] or arr[i]==0:\n c+=1\nif arr[-1]==0:\n c+=1\nprint(len(arr)-c)\n \t\t\t\t\t\t \t\t\t\t \t \t\t\t \t \t", "n=int(input())\na=list(map(int,input().split()))\nres=set()\nfor i in a:\n\tif i!=0:\n\t\tres.add(i)\nprint(len(res))\n\t\t\t\t \t\t \t\t \t \t \t \t\t \t", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nprint(len(list(set(a)))-(0 in a))\r\n\r\n\r\n\r\n\r\n\r\n ", "# your code goes here\r\nn = int(input())\r\nnos = input()\r\nl = nos.split(' ')\r\n\r\nflag=1\r\nfor i in range(n):\r\n\tif l[i] == '0':\r\n\t\tflag=0\r\n\t\tbreak\r\n\r\nl = set(l)\r\n\r\nif flag == 0:\r\n\tprint(len(l)-1)\r\nelse:\r\n\tprint(len(l))", "n = int (input())\nb = list(map(int, input().split(' ')))\n\n# for i in range(n):\n# if b[i] == 0 :\n# continue\n# for x in range (n):\n# if c[x] == 0 : continue\n# if c[x] == b[i] and i != x: \n# c[x] = 0\n# result = 0\n# for i in range(n):\n# if b[i] != 0 : result = result + 1\n# print (result)\n\nlist2 = list(set(b))\nans = len(list2)\nif 0 in list2:\n ans -= 1\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx = set(l)\r\n\r\nif 0 in x :\r\n x.remove(0)\r\n\r\nprint(len(x))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=len(set(a))-list(set(a)).count(0)\r\nprint(b)", "n=int(input())\r\nt=0\r\na=list(set([int(i) for i in input().split()]))\r\nfor i in range(len(a)):\r\n if a[i]!=0:\r\n t+=1\r\nprint(t) \r\n", "def solve(arr):\r\n\r\n arset = set(arr)\r\n ze=False\r\n\r\n for a in arset:\r\n if (a == 0):\r\n ze = True\r\n break\r\n\r\n return len(arset) - (1 if(ze) else 0)\r\n\r\n\r\nn = int(input())\r\narr =list( map(int,input().split()))\r\nprint (solve(arr))", "A=int(input())\nB=list(map(int,input().split()))\nB=list(set(B))\nif 0 in B:\n print(len(B)-1)\nelse:\n print(len(B))\n\t \t \t \t \t \t \t\t \t \t\t\t \t\t\t\t", "n = int(input())\r\narr = list(set(list(map(int, input().split()))))\r\nif 0 in arr:\r\n print(len(arr) - 1)\r\nelse:\r\n print(len(arr))", "aq = int(input())\naq = set(int(i) for i in input().split())\naq.discard(0)\nprint(len(aq))\n\t \t\t\t \t \t\t \t \t\t \t", "n=input()\na=map(int,input().split())\nr = len(set(a)-{0})\nprint(r)\n \t\t \t\t\t \t \t\t \t \t\t\t \t \t", "a=int(input())\nb=list(map(int,input().split()))\nb=list(set(b))\nb=[c for c in b if c!=0]\nprint(len(b))\n \t\t \t\t \t\t\t\t\t\t \t \t\t\t \t \t\t \t\t\n\t \t\t \t \t\t \t \t \t\t\t \t \t\t\t", "nn = int(input())\nln = list(map(int,input().split()))\nln = set(ln)\n\n\nif 0 in ln:\n \n ln.remove(0)\nprint(len(ln))\n\t \t\t \t \t \t \t \t \t\t\t \t", "def seconds():\r\n _ = int(input())\r\n st = set(list(map(int, input().split())))\r\n try:\r\n st.remove(0)\r\n \r\n except:\r\n pass\r\n print(len(st))\r\n \r\nseconds()", "# for _ in range(int(input())):\r\nfrom collections import Counter\r\nn=int(input())\r\n # n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=Counter(a)\r\nif(0 in a):\r\n print(len(a)-1)\r\nelse:\r\n print(len(a))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\np=[]\r\nneg=[]\r\nfor i in range(n):\r\n if a[i]>0:\r\n p.append(a[i])\r\n elif a[i]==0:\r\n pass\r\n else:\r\n neg.append(-1*a[i])\r\nans=0\r\np.sort()\r\nneg.sort()\r\nfor i in range(0,len(p)-1):\r\n if(p[i]-p[i+1]<0):\r\n ans=ans+1\r\n \r\nfor i in range(0,len(neg)-1):\r\n if(neg[i]-neg[i+1]<0):\r\n ans=ans+1\r\nif(len(p)>0):\r\n ans=ans+1\r\nif(len(neg)>0):\r\n ans=ans+1\r\nprint(ans)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-15 23:38:29\nLastEditTime: 2021-11-15 23:43:37\nDescription: \nFilePath: CF992A.py\n'''\n\n\ndef func():\n _ = int(input())\n lst = list(set(map(int, input().strip().split())) - set([0]))\n print(len(lst))\n\n\nif __name__ == '__main__':\n func()\n", "n=input()\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nl=list(s)\r\nif 0 in l:\r\n\tl.remove(0)\r\nprint(len(l)) ", "N=int(input())\nli=[int(i) for i in input().split()]\nli1=set(li)\nif(0 in li1):\n li1.remove(0)\n print(len(li1))\nelse:\n\tprint(len(li1))\n\t \t \t\t\t\t\t\t \t \t \t \t \t\t\t\t\t \t", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=set([])\r\nfor i in range(n):\r\n if a[i]!=0:\r\n b.add(a[i])\r\nprint(len(b))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=set(l)\r\nif 0 in m:\r\n\tprint(len(m)-1)\r\nelse:\r\n\tprint(len(m))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ny=set(a)\r\nx=0\r\nfor i in y:\r\n if i!=0:\r\n x+=1\r\nprint(x)", "a=int(input())\nb=set(input().split())\nd=0\nfor i in b:\n if i!='0':\n d+=1\nprint(d)\n\t \t \t\t \t \t\t \t\t\t\t \t\t \t\t\t", "n = int(input())\r\nl = {int(i) for i in input().split() if int(i)}\r\n\r\nprint(len(l))", "n=int(input(''))\r\nl=list(map(int,input().split()))\r\nk=list(filter(lambda x:x!=0,l))\r\ns=set(k)\r\nprint(len(s))", "'''HackerRank: Nastya and an Array'''\r\n\r\nif __name__ == '__main__':\r\n _ = int(input())\r\n arr = set(map(int, input().split()))\r\n arr = list(arr)\r\n print(len(arr) - arr.count(0))\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nc = set(a)\r\nprint(len(c) - (1 if 0 in c else 0))", "n=int(input())\r\nA=list(map(int,input().split()))\r\nB=list(set(A))\r\nif 0 in B:\r\n B.remove(0)\r\nprint(len(B))", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set(a)\r\ns.discard(0)\r\nprint(len(s))\r\n", "M=int(input())\nA=[int(i) for i in input().split()]\nK=set(A)-{0}\nprint(len(K))\n\t\t \t\t\t \t\t \t\t \t\t \t\t\t\t\t \t\t\t \t", "# Nastya and an Array\r\n\r\nn = int(input())\r\n\r\narr = [int(k) for k in input().split()]\r\narr = set(arr)\r\ncnt = 0\r\n\r\n#count distinct non zero values\r\nwhile arr:\r\n if arr.pop() != 0:\r\n cnt += 1\r\n \r\nprint (cnt)", "n = int(input())\nli = [int(x) for x in input().split()]\nl = []\nfor i in li:\n\tif(i != 0):\n\t\tl.append(i)\ns = set(l)\nprint(len(s))\n\t \t\t \t \t \t \t \t\t \t\t \t\t", "n=int(input())\na=list(map(int,input().strip().split()))[:n]\nm=set(a)\nl=len(m)\nif 0 in m:\n print(l-1)\nelse:\n print(l)\n\n \t\t \t \t\t \t\t \t\t\t \t", "\r\nn=input()\r\na=map(int,input().split())\r\nprint(len(set(a)-{0}))", "n=int(input())\nl=map(int,input().split())\nprint(len(set(l)-{0}))\n\t \t\t\t\t\t\t \t \t\t \t \t \t\t \t \t\t", "g=int(input())\nd=list(map(int,input().split()))\nd=list(set(d))\nd=[c for c in d if c!=0]\nprint(len(d))\n\t\t\t\t \t\t \t\t \t\t\t\t \t\t \t \t\t \t \t", "a=int(input())\nlist1=list(map(int,input().split()))\nset1=set(list1)\nlist1=list(set1)\ncount=0\nfor i in list1:\n if i!=0:\n count+=1\nprint(count)", "a1111=int(input())\nb2222=list(map(int,input().split()))\nb2222=list(set(b2222))\nif 0 in b2222:\n print(len(b2222)-1)\nelse:\n print(len(b2222))\n \t\t\t \t \t\t \t \t \t \t \t\t \t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in l:\r\n if(i!=0):\r\n l1.append(i)\r\ns=set(l1)\r\nprint(len(s))\r\n \r\n", "n = int(input())\r\narr = input().split()\r\narr = set(arr)\r\narr.discard(\"0\")\r\nprint(len(arr))", "a=int(input())\nlsts=list(map(int,input().split()))\nlsts2=set(lsts)\npq=0\nfor i in lsts2:\n\tif i!=0:\n\t\tpq=pq+1\nprint(pq)\n \t \t \t \t \t\t\t\t\t \t \t\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nx=set(a)\r\nfor i in x:\r\n if(i!=0):\r\n c=c+1 \r\nprint(c)", "n=int(input())\nx=list(map(int,input().strip().split()))[:n]\ny=set(x)\nl=len(y)\nif 0 in x:\n print(l-1)\nelse:\n print(l)\n\t\t\t\t\t \t\t\t\t \t \t\t \t \t\t \t \t\t", "# CodeForces: Nastya and an Array\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n arr=list(map(int, input().split()))\r\n arr = [i for i in arr if i != 0]\r\n arr=set(arr)\r\n print(len(arr))", "n = int(input())\r\nli = set(map(int, input().split()))\r\ncnt = 0\r\nfor i in li:\r\n if i != 0:\r\n cnt += 1\r\nprint(cnt)", "n = int(input())\na = input().split(' ')\n\nfor i in range(n):\n a[i] = int(a[i])\n\nl_to_s = set(a)\n\nif 0 in l_to_s:\n print(len(l_to_s) - 1)\nelse:\n print(len(l_to_s))", "from sys import stdin,stdout\nfrom collections import Counter\nn=int(input())\nl=list(map(int,input().split()))\nx=dict(Counter(l))\nans=len(x.keys())\nif 0 in x.keys():\n ans-=1\nprint(ans)\n\t \t \t\t \t\t \t\t \t \t \t\t", "input();print(len(set([i for i in list(map(int,input().split())) if i!=0])))", "size_of_array =int(input())\r\nelements_of_array =list(map(int,input().split()))\r\nmy_set=set(elements_of_array)\r\nmy_list=list(my_set)\r\nout=0\r\nfor i in range(0,len(my_list)):\r\n # for j in range(0,len(my_list)):\r\n # for k in range(0,len(my_list)):\r\n if my_list[i]!=0:# and my_list[j]+my_list[k]!=my_list[i]:\r\n out+=1\r\nprint(out)\r\n", "\n# coding: utf-8\n\n# In[ ]:\n\n\nn=list(map(int, input().split(\" \")))\narr=list(map(int, input().split(\" \")))\narr=sorted (arr)\nznachenie=arr[0]-1\nkolvo=0\nfor i in arr:\n if i!=znachenie and i!=0:\n kolvo=kolvo+1\n znachenie=i\nprint(kolvo)\n\n", "n = int(input())\r\na = [int(c) for c in input().split()]\r\ns = 0\r\nif 0 in a:\r\n s=-1\r\nprint(len(set(a))+s)", "# your code goes here\nn = int(input())\nlis = list(map(int, input().split()))\nse = set(lis)\nle = len(se)\nif 0 in se:\n print(le-1)\nelse:\n print(le)\n \t \t \t\t \t\t\t \t \t \t\t \t\t \t \t", "t = int(input())\r\nprint(len(set([int(i) for i in input().split() if i != '0'])))", "n = int(input())\nmat = set(input().split())\nprint(len(mat)-1 if '0' in mat else len(mat))\n", "num= int(input())\nl = list(map(int, input().split()))\nx= set(l)\nif 0 in x:\n\tprint(len(x)-1)\nelse:\n\tprint(len(x))\n\t \t\t \t\t\t \t \t\t \t\t \t\t \t\t\t", "k=int(input())\nb=[int(x) for x in input().split()]\na=[]\nb=set(b)\nfor i in b:\n if i!=0:\n a.append(i)\nprint(len(a))\n\t\t\t\t\t\t \t\t\t\t\t \t \t \t\t \t\t\t \t \t", "n,a=int(input()),list(set(map(int,input().split())))\nk=len(a)\nif a[0]==0:\n k-=1\nprint(k)", "g=int(input())\nk=list(map(int,input().split()))\nk=list(set(k))\nk=[c for c in k if c!=0]\nprint(len(k))\n \t \t\t\t\t\t \t\t\t \t \t \t \t \t\t\t\t \t\t", "q=int(input())\nw=list(map(int,input().split()))\nwhile(0 in w):\n w.remove(0)\nw=set(w)\nprint(len(w))\n\t\t\t\t \t\t\t\t\t\t\t \t \t \t \t\t\t\t \t \t", "num=int(input())\na=[int(x) for x in input().split()]\nv=set(a)-{0}\nprint(len(v))\n\t\t \t \t \t\t\t\t\t\t \t\t\t\t\t \t\t", "n = int(input())\r\ns = set([int(i) for i in input().split() if int(i)!=0])\r\n\r\nprint(len(s))\r\n", "S=int(input())\nV=list(map(int,input().split()))\nV=list(set(V))\nif 0 in V:\n print(len(V)-1)\nelse:\n print(len(V))\n \t \t\t \t\t\t\t \t \t \t\t\t\t \t\t\t", "a=int(input())\na2=list(map(int,input().split()))\na2=list(set(a2))\na2=[i for i in a2 if i!=0]\nprint(len(a2))\n\t \t\t \t \t\t\t\t\t \t\t \t\t\t \t\t", "size_of_list = input()\r\nlist1 = list(map(int, input().split()))\r\ncounter = len(set(list1))\r\nif 0 in list1:\r\n counter -= 1\r\n\r\nprint(counter)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[i for i in l if i!=0]\r\nprint(len(set(l1)))", "n=int(input())\nls=list(map(int,input().split()))\nls=set(ls)\nif 0 in ls:\n\tprint(len(ls)-1)\nelse:\n\tprint(len(ls))\n\t \t \t \t \t \t\t\t \t \t\t\t", "n=int(input())\r\ns=list(map(int, input().split() ) )\r\nd=set()\r\nfor i in s:\r\n d.add(i)\r\nif 0 in d:\r\n d.remove(0)\r\nprint(len(d))", "import sys\r\nn = int(input())\r\ns = set(map(int, input().split()))\r\nprint(len(s) - 1 if 0 in s else len(s))", "\"\"\"\n\thttps://codeforces.com/problemset/problem/992/A\n\tInput\n\t\tn\tsize of array\n\t\ta \tarray\n\tOutput\n\t\tx\tnumber of seconds needed to make all elements explode\n\"\"\"\n\nn = int(input())\n\na = list(map(int, input().split()))\n\n# each distinct element is a step needed\nnot_zeroes = set([i for i in a if i != 0])\n\n# number\nprint(len(not_zeroes))", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\ns=list(set(l))\r\nif 0 in s:\r\n s.remove(0)\r\n print(len(s))\r\nelse:\r\n print(len(s))\r\n \r\n", "a=int(input())\r\nd=list(map(int,input().split()))\r\nd=list(set(d))\r\nif 0 in d:\r\n print(len(d)-1)\r\nelse:\r\n print(len(d))", "n= int(input())\r\nli1= list(map(int, input().split()))\r\nli2= list(set(li1))\r\nprint(len(li2)-li2.count(0))", "n = int(input())\ns = set(input().split())\nprint(sum(1 for x in s if int(x) != 0))\n ", "n=int(input())\nlst=[int(i) for i in input().split()]\nl=set(lst)\nif 0 in l:\n l.remove(0)\nprint(len(l))\n \t\t \t \t\t\t \t\t \t\t\t\t \t \t\t\t \t", "n=int(input())\nlst=list(map(int,input().split()))\nlst = list(set(lst))\nlst = [i for i in lst if i != 0]\nprint(len(lst))\n \t\t \t\t \t\t\t\t\t\t \t \t\t\t \t \t\t \t\t", "x=int(input())\ny=list(map(int,input().split()))\ny=list(set(y))\ny=[z for z in y if z!=0]\nprint(len(y))\n \t\t \t\n \t \t \t\t \t\t\t \t\t\t \t\t \t\t\t", "n = input()\r\narr1 = list(map(int, input().split()))\r\n\r\nprint(len(set(i for i in arr1 if i != 0)))\r\n", "input();a=list(map(int,input().split()));print(len(set(a)) +(-1 if 0 in a else 0))", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nif 0 in l:\r\n l.remove(0)\r\nif 0 in l:\r\n print(len(set(l))-1)\r\nelse:\r\n print(len(set(l)))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nres=set(arr)\r\nans=len(res)\r\nlst=list(res)\r\nfans=lst.count(0)\r\nprint(ans-fans)", "n=int(input())\r\nL1=list(map(int,input().split()))\r\nL3={0}\r\nfor i in L1:\r\n\tL3.add(i)\r\nL3.remove(0)\r\nc=0\r\nfor i in L3:\r\n\tc+=1\r\nprint(c)", "n = int(input())\ns = set(map(int, input().split())) - {0,}\n\nprint(len(s))\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\nif(0 in s):\r\n\tprint(len(set(l))-1)\r\nelse:\r\n\tprint(len(set(l)))", "i=input;i();print(len(set(i().split())-{'0'}))", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in a:\r\n if i!=0:\r\n c.append(i)\r\nprint(len(list(set(c))))", "n = int(input())\nlst = list(map(int, input().split()))\nlst = set(lst)\ncnt = 0\nfor i in lst:\n if i==0:\n cnt = 1\nprint(len(lst)-cnt)\n\t \t\t \t\t\t \t \t\t \t\t\t\t\t \t\t\t", "x = int(input())\r\ny = set(map(int,input().split()))\r\nz = 0\r\nif 0 in y:\r\n z += 1\r\nl = len(y)-z\r\nprint(l)\r\n \r\n", "h=int(input())\nr=list(map(int,input().split()))\nr=list(set(r))\nif 0 in r:\n print(len(r)-1)\nelse:\n print(len(r))\n\t\t\t\t \t\t \t\t\t \t \t\t \t\t \t", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nd={}\r\nfor i in l:\r\n if i!=0:\r\n d[i]=1\r\nprint(len(d))", "n = int(input())\nlis = input().split(\" \")\nfor x in range(len(lis)):\n lis[x] = int(lis[x])\nstuff = {}\nfor n in lis:\n if n != 0:\n try:\n stuff[n] += 1\n except:\n stuff[n] = 1\nprint(len(stuff))\n\n \t \t\t \t\t\t\t\t \t \t\t \t \t", "value=int(input())\nres=list(map(int,input().split()))\nwhile(0 in res):\n res.remove(0)\nres=set(res)\nprint(len(res))\n\n\t \t \t\t \t \t \t\t\t \t\t \t\t \t\t", "n = int(input())\r\ns = set()\r\nfor c in input().split():\r\n if c != '0':\r\n s.add(c)\r\nprint(len(s))\r\n", "rmvarrrr1=int(input())\nrmvarrrr2=list(map(int,input().split()))\nwhile(0 in rmvarrrr2):\n rmvarrrr2.remove(0)\nrmvarrrr2=set(rmvarrrr2)\nprint(len(rmvarrrr2))\n\t \t \t\t\t\t\t\t\t\t \t\t\t \t \t", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=list(set(b))\r\nif 0 in c:\t\r\n\tc.remove(0)\r\n\tprint(len(c))\r\nelse:\r\n\tprint(len(c))", "j=int(input()) #testcase input\r\nk=list(map(int,input().split()))\r\nwhile(0 in k):\r\n k.remove(0)\r\nl=set(k)\r\nn=len(l)\r\nprint(n)", "x=input()\r\nl=map(int,input().split())\r\ndic={}\r\nfor r in l:\r\n dic[r]=1\r\nif 0 in dic.keys():\r\n print(len(dic)-1)\r\nelse:\r\n print(len(dic))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(set(a))\r\nx=b.count(0)\r\nprint(len(b)-x)", "num=input()\r\n\r\na=list(map(int,input().split()))\r\n\r\n\r\na=list(filter(lambda x:x!=0,a))\r\n\r\na=len(list(set(a)))\r\n\r\nprint(a)\r\n\r\n", "q=int(input())\nw=list(map(int,input().split()))\nwhile(0 in w):\n w.remove(0)\nw=set(w)\nprint(len(w))\n# w.remove(0)\n# w=set(w)\n# print(len(w))\n \n \t \t\t\t \t\t \t\t\t \t \t\t\t\t \t\t\t", "n=int(input())\nl=[str(x) for x in input().split()]\ns=set(l)\ns.discard('0')\nprint(len(s))\n\t\t\t \t\t \t \t \t \t\t \t \t\t \t\t", "n = int(input())\r\nnums = map(int, input().split())\r\nnums = filter(lambda x: x != 0, nums)\r\nprint(len(set(nums)))", "useless=input()\na=input()\nl=a.split()\nst=set(l)\nst.discard('0')\nprint(len(st))\n\t \t\t\t \t \t \t \t \t \t\t\t", "n=int(input())\r\nd=dict()\r\nfor i in list(map(int,input().split())):\r\n d[i]=0\r\nif d.get(0)==None:\r\n print(len(d))\r\nelse:\r\n print(len(d)-1)\r\n", "t=int(input())\nlsts=list(map(int,input().split()))\nlsts2=set(lsts)\ncs=0\nfor i in lsts2:\n\tif i!=0:\n\t\tcs=cs+1\nprint(cs)\n\t\t\t\t \t \t\t\t \t \t\t\t\t\t\t\t \t", "s1=input()\nlist1=map(int,input().split())\nprint(len(set(list1)-{0}))\n\t \t\t \t\t\t\t \t \t\t \t \t\t\t\t \t\t", "# A. Nastya and an Array\n\nn = int(input())\na = set(map(int, input().split()))\n\nans = len(a) - 1 if 0 in a else len(a)\nprint(ans)\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nmapp = {}\r\n\r\nfor i in arr:\r\n if i in mapp:\r\n mapp[i] += 1\r\n else:\r\n mapp[i] = 1\r\n\r\nif 0 in mapp:\r\n print(len(mapp)-1)\r\nelse:\r\n print(len(mapp))", "n = int(input())\na = [x for x in input().split() if x != '0']\na.sort()\nprint(len(set(a)))\n", "l = int(input())\nn = list(map(int,input().split()))\nn = [i for i in n if(i!=0)]\n#print\nprint(len(set(n)))\n \t \t\t\t\t \t \t \t \t\t \t\t \t\t\t\t", "input();print(len(set(i for i in map(int,input().split()) if i!=0)))", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na=list(set(a))\r\nif 0 in a:\r\n print(len(a)-1)\r\nelse:\r\n print(len(a))", "n = int(input())\r\nl = set(input().split())\r\nif '0' in l:\r\n l.remove('0')\r\nprint(len(l))", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nres = list(set(lst))\r\ncount = 0\r\nfor i in res:\r\n if i != 0:\r\n count += 1\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().strip().split()))\r\n\r\nb = set(a)\r\nres = len(b)\r\nif 0 in b:\r\n res -= 1\r\nprint(res)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nnew=set()\r\nfor ele in lst:\r\n if ele!=0:\r\n new.add(ele)\r\nprint(len(new))", "a=int(input())\no=list(map(int,input().split()))\no=list(set(o))\nif 0 in o:\n print(len(o)-1)\nelse:\n print(len(o))\n \t \t \t \t \t \t\t \t\t \t\t\t \t\t \t\t", "n=int(input())\narr=[int(x) for x in input().split()][:n]\na=[]\nfor i in range(n):\n if arr[i]!=0:\n a.append(arr[i])\nar=set(a)\nprint(len(ar))\n\t \t \t \t \t \t\t \t\t \t \t\t", "d=input()\ns=map(int,input().split())\nprint(len(set(s)-{0}))\n\t\t\t \t \t\t\t \t \t\t \t\t \t", "\nn = int(input())\ncounter = set(list(map(int, input().split())))\nprint(len(counter)-1 if 0 in counter else len(counter))\n", "n = int(input())\na = set([int(i) for i in input().split() if i != \"0\"])\nprint(len(a))", "n=input()\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if(i!=0):\r\n if(i in d):\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nprint(len(d))\r\n", "s=int(input())\nk=list(map(int,input().split()))\nk=list(set(k))\nif 0 in k:\n print(len(k)-1)\nelse:\n print(len(k))\n\t \t\t\t \t\t \t\t\t \t \t \t \t \t", "n=int(input())\r\narr=list(map(int,input().split(' ')))\r\narr1=set(arr)\r\ncount=0\r\nfor ele in arr1:\r\n if ele!=0:\r\n count=count+1\r\nprint(count)\r\n \t\t\t \t \t \t \t \t \t \t\t \t", "def main():\r\n n = input()\r\n vals = set([int(v) for v in input().split() if int(v)!=0])\r\n print(len(vals))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nl = list(map(int,input().split()))\nl1 = []\nfor i in l:\n\tif i!=0:\n\t\tl1.append(i)\ns = set(l1)\nprint(len(s))\n\t \t\t \t \t\t \t \t\t \t \t", "from os import times\r\n\r\n\r\nsize = int(input())\r\nb = input()\r\nb = b.split()\r\nfor i in range(size):\r\n b[i] = int(b[i])\r\nb = sorted(b)\r\na = ''\r\ntimes = 0\r\nfor i in range(size):\r\n if b[i] != a and b[i] != 0:\r\n a = b[i]\r\n times += 1\r\nprint(times)", "n=int(input())\r\ntam = 100005;\r\npos=[0 for i in range(tam)]\r\nneg=[0 for i in range(tam)]\r\ncad=input()\r\nv=list(map(int,cad.split()))\r\nfor i in range(len(v)):\r\n\tx=v[i]\r\n\tif x<0:\r\n\t\tneg[-x]=1;\r\n\telif x>0:\r\n\t\tpos[x]=1;\t\t\r\nans = 0\r\nfor i in range(tam):\r\n\tif pos[i]!=0:\r\n\t\tans+=1\r\n\tif neg[i]!=0:\r\n\t\tans+=1\r\nprint(ans)\r\n\r\n", "from collections import Counter\n\nn = int(input())\narr = Counter(int(x) for x in input().split())\nans = len(arr) - int(0 in arr)\nprint(ans)\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=set()\r\nfor el in a:\r\n if el!=0:\r\n b.add(el)\r\n \r\n\r\nprint(len(b))", "n = int(input())\r\n\r\ns = input().split()\r\nss = set(s)\r\n\r\nif '0' in ss:\r\n ss.remove('0')\r\n\r\nprint(len(ss))", "n = int(input())\r\nli = list(map(int,input().split()[:n]))\r\nli = list(set(li))\r\nfor ele in li:\r\n\tif ele == 0:\r\n\t\tli.remove(ele)\r\nprint(len(li))\r\n", "input()\r\nNumbers = list(map(int, input().split()))\r\nprint(len(set(Numbers)) - 1 if 0 in set(Numbers) else len(set(Numbers)))\r\n", "N=int(input())\na=[int(p) for p in input().split()]\nk=set(a)-{0}\nprint(len(k))\n \t\t\t\t \t \t \t \t\t \t \t\t \t", "var6=int(input())\nvar8=list(map(int,input().split()))\nwhile(0 in var8):\n var8.remove(0)\nvar8=set(var8)\nprint(len(var8))\n\t\t \t\t\t \t \t \t\t \t \t\t\t\t\t\t", "n=int(input())\r\ns=list(map(int,input().split()))\r\na=s.count(0)\r\nl=len(set(s))\r\nif(a>0):\r\n\tprint(l-1)\r\nelse:\r\n\tprint(l)", "n=int(input())\r\nl=set([*map(int,input().split())])\r\nprint(len(l)-1 if 0 in l else len(l))\r\n\r\n\r\n", "s = int(input())\r\n\r\ns = input()\r\nnumbers = list(map(int, s.split()))\r\n\r\n\r\nuniq = []\r\nseen = set()\r\n\r\nfor x in numbers:\r\n if x not in seen:\r\n uniq.append(x)\r\n seen.add(x)\r\n\r\nif 0 in seen:\r\n ans = len(uniq)-1\r\nelse:\r\n ans = len(uniq)\r\n \r\nprint (ans)", "num=int(input())\nl1=list(map(int,input().strip().split()))\ns=set(l1)\nl=len(s)\nif 0 in s:\n print(l-1)\nelse:\n print(l)\n \t \t\t\t \t \t\t\t\t \t\t\t\t\t \t", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn = int(input())\r\na = set(list(map(int, input().split())))\r\nfor aa in a:\r\n if aa == 0:\r\n print(len(a) - 1)\r\n break\r\nelse:\r\n print(len(a))\r\n", "mvarrrrr1=int(input())\nmvarrrrr2=list(map(int,input().split()))\nwhile(0 in mvarrrrr2):\n mvarrrrr2.remove(0)\nmvarrrrr2=set(mvarrrrr2)\nprint(len(mvarrrrr2))\n \t\t \t \t \t \t\t \t \t \t\t \t", "n = int(input())\nA = list(map(int, input().split()))\ns = set()\nfor a in A:\n if a != 0:\n s.add(a)\nprint(len(s))\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\nif 0 in b:\r\n\tprint(len(b)-1)\r\nelse:\r\n\tprint(len(b))\t", "n = int(input().strip())\r\na = list(map(int,input().strip().split()))\r\naset = set(a)\r\n\r\nif 0 in aset:\r\n print(len(aset)-1)\r\nelse:\r\n print(len(aset))", "n = int(input())\r\nx = list(map(int, input().split()))\r\na, b = set(), set()\r\nfor el in x:\r\n if el > 0:\r\n a.add(el)\r\n continue\r\n if el < 0:\r\n b.add(el)\r\n continue\r\n \r\nprint(len(a) + len(b))\r\n\r\n\"\"\"\r\n2 5 6 9\r\n0 3 4 7\r\n0 0 1 4\r\n0 0 0 3\r\n0 0 0 0\r\n\r\n2\r\n3\r\n1\r\n3\r\n\"\"\"", "n=int(input())\r\na=sorted(list(map(int, input().split())))\r\ncount=0;d=None\r\nfor i in range(n):\r\n\tif d is None:\r\n\t\tif a[i]!=0:\r\n\t\t\td=a[i]*-1\r\n\t\t\tcount+=1\r\n\telse:\r\n\t\tif a[i]!=0:\r\n\t\t\ttemp=a[i]\r\n\t\t\ta[i]+=d #To increment/decrease with the previous values\r\n\t\t\tif a[i]!=0:\r\n\t\t\t\td=temp*(-1)\r\n\t\t\t\tcount+=1\r\nprint(count)", "n= int(input())\r\narr = list(map(int,input().split()))\r\na=set(arr)\r\ncount=0\r\nfor i in a:\r\n if i!=0:\r\n count+=1\r\nprint(count)", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nl_set = list(set(l))\r\nprint(len(l_set) - l_set.count(0))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ny=list(set(l))\r\nx=[]\r\nfor i in range(len(y)):\r\n if y[i]!=0:\r\n x.append(y[i])\r\nprint(len(x))", "import math\r\nfrom collections import Counter\r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n # n,m - map(int, input().split())\r\n ali = list(map(int, input().split()))\r\n # s = input()\r\n s = list(set(ali))\r\n cnt = 0\r\n for i in s:\r\n if(i != 0):\r\n cnt += 1\r\n print(cnt)\r\n\r\n", "n=input()\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif l[0]==0:\r\n t=0\r\nelse:\r\n t=1\r\nll=len(l)\r\nfor i in range(1,ll):\r\n if l[i]==0 or l[i]==l[i - 1]:\r\n continue\r\n t+=1\r\nprint(t) ", "from collections import Counter\n\nn = int(input())\narr = [int(x) for x in input().split()]\ncount = Counter(arr)\nif 0 in arr:\n print(len(count) - 1)\nelse:\n print(len(count))\n", "import random\r\n\r\nn=int(input())\r\nresult=0\r\narray=list(map(int,input().split()))\r\nseconds=set(array)\r\nresult=len(seconds)\r\nif array.count(0)>0:\r\n result=result-1\r\nprint(result)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nx=len(s)\r\nif 0 in s:\r\n print(x-1)\r\nelse:\r\n print(x)", "x=int(input())\nb=[int(i) for i in input().split()]\nprint(len(set(b)-{0}))\n \t \t\t\t\t\t\t \t\t\t \t \t\t \t\t\t", "n=(int)(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if l[i]==0:\r\n c+=1\r\nif c>1:\r\n c=1\r\nprint(len(set(l))-c)", "n = int(input())\nli = list(map(int,input().split()[:n]))\nli = list(set(li))\nfor ele in li:\n\tif ele == 0:\n\t\tli.remove(ele)\nprint(len(li))\n\t\t\t\t\t\t\t \t\t \t\t\t \t \t\t \t\t\t", "n=int(input())\nl=list(map(int,input().split()))\na=[]\nfor i in range(len(l)):\n if l[i]!=0:\n a.append(l[i])\ns=set(a)\nprint(len(s))\n\t\t \t\t \t\t\t \t\t\t \t\t", "b = input()\nb = set(map(int,input().split()))\nif 0 in b:\n print(len(b)-1)\nelse:\n print(len(b))\n", "x = input()\ns = set(map(int, input().split()))\n\nif 0 in s:\n print(len(s)-1)\nelse:\n print(len(s))\n", "from collections import Counter\n\nn = int(input())\nans = Counter((int(x) for x in input().split()))\nif 0 in ans:\n print(len(ans) - 1)\nelse:\n print(len(ans))\n", "#your solution python code\n#Nastya and an Array\n\nn = int(input())\n\na = set()\nstrings = input().split(\" \")\nfor i in range(0, n):\n next = int(strings[i])\n if (next != 0):\n a.add(next)\n\nprint(len(a))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\ns1=list(s)\r\n\r\nfor i in range(len(s1)):\r\n if s1[i]==0:\r\n s.remove(s1[i])\r\nprint(len(s))", "n = int(input())\r\na = set(map(int, input().split()))\r\nans = 0\r\nfor x in a:\r\n\tans += x != 0\r\nprint(ans) ", "\"\"\"\n\thttps://codeforces.com/problemset/problem/992/A\n\tInput\n\t\tn\tsize of array\n\t\ta \tarray\n\tOutput\n\t\tx\tnumber of seconds needed to make all elements explode\n\"\"\"\n\nn = int(input())\n\na = sorted(list(map(int, input().split())))\n\n# split array into elements smaller than and larger than 0\nsmaller = set([i for i in a if i < 0])\nlarger = set([j for j in a if j > 0])\n\nprint(len(smaller) + len(larger))", "n = int(input())\r\ns = set(list(map(int, input().split())))\r\ns = s.difference([0])\r\nprint(len(s))\r\n", "n, lst, cnt, res = int(input()), list(map(int, input().split())), [0] * 200001, 0\r\nfor x in lst:\r\n if x != 0: cnt[x + 100000] += 1\r\nfor x in cnt:\r\n if x != 0: res += 1\r\nprint(res)", "n = int(input())\r\ny = set(map(int,input().split()))\r\nif 0 in y:\r\n y.discard(0)\r\nprint(len(y))", "n = int(input())\r\nl = input()\r\narr = list(map(int,l.split(' ')))\r\narr.sort()\r\ncount =0\r\nif arr[0]!=0 :\r\n count=1\r\nfor i in range(n):\r\n if arr[i] != 0 and arr[i]!= arr[i-1] and i > 0:\r\n count+=1\r\n\r\nprint(count)\r\n", "M=int(input())\nn=[int(x) for x in input().split()]\nk=set(n)-{0}\nprint(len(k))\n\t\t \t \t\t \t\t \t\t\t \t \t \t\t", "n = int(input())\na = map(int,input().split())\nprint(len(set(a)-{0}))\n\t \t \t \t \t \t \t \t\t\t\t\t \t", "from collections import Counter\r\ninput()\r\nl = Counter(list(map(int,input().split())))\r\nprint(len(l.keys()) - bool(0 in l.keys()))", "n = int(input())\nnums = input().split()\n\nc = set(nums)\n\nprint(len(c) if '0' not in c else len(c)-1)\n \t \t \t\t\t \t\t \t \t\t \t\t\t\t \t", "n = int(input())\r\narr = list(set(map(int, input().split())))\r\nif 0 in arr:\r\n arr.remove(0)\r\nprint(len(arr))\r\n", "a=int(input())\r\nx=input().split()\r\nif '0' in x:\r\n x=set(x)\r\n x.remove('0')\r\nelse:\r\n x=set(x)\r\nx=len(x)\r\nprint(x)", "n = int(input())\r\nA = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in A:\r\n if(i==0):\r\n cnt+=1\r\nans = len(set(A))\r\nif(cnt):\r\n ans-=1\r\nprint(ans)", "n=input()\r\n\r\nseta=set(map(int,input().split()))\r\n\r\nseta.discard(0)\r\n\r\nprint(len(seta))", "n=int(input())\r\nl=set(map(int,input().split()))\r\nl.add(0)\r\nl.remove(0)\r\nprint(len(l))", "t=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nb=set(sorted(l))\r\nfor i in b:\r\n if(i!=0):\r\n i=i+(-i)\r\n a.append(i)\r\nprint(a.count(0))", "n=int(input())\narr=list(map(int,input().split(' ')))\n# print(arr)\narr1=set(arr)\ncount=0\nfor ele in arr1:\n if ele!=0:\n count=count+1\nprint(count)\n \t\t\t \t \t \t \t \t \t \t\t \t", "ai=int(input())\nbo=list(map(int,input().split()))\nbo=list(set(bo))\nif 0 in bo:\n print(len(bo)-1)\nelse:\n print(len(bo))\n \t \t\t\t\t \t\t\t \t\t\t \t \t \t\t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=set(l)\r\nif(0 in l):\r\n print(len(p)-1)\r\nelse:\r\n print(len(p))", "n=int(input())\r\ng=list(map(int,input().split()))\r\na=set(g)\r\nl=len(a)\r\na.add(0)\r\nol=len(a)\r\nif ol==l:\r\n print(l-1)\r\nelse:\r\n print(l)\r\n\r\n", "# LUOGU_RID: 101744612\nn, *a = map(int, open(0).read().split())\r\nif a.count(0) == n:\r\n exit(print(0))\r\nb = [x for x in a if x]\r\nprint(len(set(b)))", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nif len(list(set(l1)))==1 and l1[0]>0:\r\n print(1)\r\nelse:\r\n l2=list(set(l1))\r\n x=l1.count(0)\r\n if x==0:\r\n print(len(l2))\r\n else:\r\n print(len(l2)-1)\r\n ", "n, a = int(input()), set(map(int, input().split()))\nprint(len(a) - (0 in a))\n\n \t\t\t\t\t \t \t \t \t\t \t\t\t \t", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na=list(set(a))\r\nprint(len(a)-a.count(0))", "from collections import Counter\r\n\r\ncnt = int(input())\r\nnum_dict = Counter(input().split())\r\n\r\ni = 0\r\nfor x in num_dict.keys():\r\n if x != \"0\":\r\n i += 1\r\n\r\nprint(i)\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\narray = list(set(array))\r\n\r\nif 0 in array:\r\n array.remove(0)\r\n print(len(array))\r\nelse:\r\n print(len(array))", "n=int(input())\r\nr=[*map(int,input().split())]\r\nprint(len(set(r))-(0 in r))\r\n", "NIKHILMAIN=int(input())\nar=set(map(int,input().split()))\nif 0 in ar:\n ar.remove(0)\nprint(len(ar))\n\t \t \t \t \t\t \t\t \t\t\t\t\t\t", "from collections import Counter\r\nn = int(input())\r\narr = list(map(int, input(). split()))\r\np = Counter()\r\nfor i in arr:\r\n if i:\r\n p[i] += 1\r\nprint(len(p))\r\n", "n=input()\nlst=map(int,input().split())\nprint(len(set(lst)-{0}))\n\t \t\t\t \t \t \t \t\t \t \t\t\t\t\t\t \t\t", "varrrr1=int(input())\nvarrrr2=list(map(int,input().split()))\nwhile(0 in varrrr2):\n varrrr2.remove(0)\nvarrrr2=set(varrrr2)\nprint(len(varrrr2))\n\t \t \t\t \t \t \t\t \t\t \t \t \t", "def distinctNums(arr):\r\n distinctNums = set()\r\n for num in arr:\r\n if num != 0 and num not in distinctNums:\r\n distinctNums.add(num)\r\n return len(distinctNums)\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nprint(distinctNums(nums))", "n=int(input())\na=list(map(int,input().split()))\nx=set()\nfor i in a:\n if i!=0:\n x.add(i)\nprint(len(x))\n \t\t\t \t \t\t \t\t\t\t \t\t \t \t\t\t\t\t\t", "n=int(input())\nz=input().split()\n\n\nl=set(map(int,z))\nif 0 in l:\n l.remove(0)\n \nprint(len(l))\n\n \t\t\t\t \t\t\t \t \t\t \t \t\t \t", "n=int(input())\nl=set(map(int, input ().split()))\nn1=len(l)\nif 0 in l:\n print(n1-1)\nelse:\n print (n1)\n \n\t \t \t \t \t \t \t \t \t\t \t\t", "def main():\r\n input()\r\n values = dict.fromkeys([int(_) for _ in input().split()])\r\n n = len(values)\r\n\r\n print(n if 0 not in values else n - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\nfrom functools import cmp_to_key as cmp\r\ndef prit(a):\r\n sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n# def compare(a,b):\r\n# if len(a)>len(b):\r\n# return 1\r\n# if len(a)==len(b):\r\n# if a>b:\r\n# return 1\r\n# return -1\r\n \r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n d.setdefault(i,0)\r\n d[i]+=1\r\nd.setdefault(0,0)\r\ndel d[0]\r\n#print(d)\r\nk=0\r\nfor i in d:\r\n k+=1\r\nprint(k)", "n=int(input())\na=[int(x) for x in input().split()]\na.sort()\nc=0\nif(a[0]!=0):\n c=c+1\nfor i in range(1,len(a)):\n if(a[i]!=a[i-1] and a[i]!=0):\n c=c+1\nprint(c)\n \t \t \t \t \t\t\t\t\t \t \t\t \t \t", "r1=int(input())\nr2=list(map(int,input().split()))\nwhile(0 in r2):\n r2.remove(0)\nr2=set(r2)\nprint(len(r2))\n\t \t\t\t\t\t \t \t\t \t\t \t\t \t\t \t \t \t", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\n\r\ninput = sys.stdin.readline\r\ndef inar():\r\n return [int(el) for el in input().split()]\r\ndef main():\r\n n=int(input())\r\n arr=inar()\r\n arr.sort()\r\n ans=0\r\n dic={}\r\n for i in range(n):\r\n if arr[i]==0:\r\n continue\r\n if arr[i]<0:\r\n take=-1*(arr[i])\r\n if take not in dic:\r\n dic[take]=1\r\n ans+=1\r\n else:\r\n take=-1*(arr[i])\r\n if take not in dic:\r\n dic[take]=1\r\n ans+=1\r\n\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n", "input()\r\nx = set([int(i) for i in input().split() if i != '0'])\r\nprint(len(x))", "n = int(input())\nlt = list(map(int,input().split()))\nl = set(lt)\nl.discard(0)\nprint(len(l))\n\t \t \t\t \t \t \t\t \t \t\t\t \t\t \t" ]

[ "n,b,p = map(int,input().split())\r\nprint((n-1)*(2*b+1),n*p)", "#Justin Hershberger\r\n#Py3.5\r\n\r\nimport fileinput\r\n\r\ndef test():\r\n\tpass\r\nif __name__ == '__main__':\r\n\tnum_args = 1\r\n\tfor arg in range(num_args):\r\n\t\tn,b,p = map(int, input().split())\r\n\r\n\t#m is the number of participants of the current round\r\n\tm = n\r\n\r\n\t#initially we have n / 2 matches since there are n participants\r\n\tnum_matches = m // 2\r\n\r\n\t#the remainder is the number of extras\r\n\textras = abs(-m // 2) - num_matches\r\n\r\n\t#initially our running total will be num matches * 3\r\n\tsum_b = (num_matches * 2 * b) + (num_matches)\r\n\r\n\t#we have n participants so we initially need n * p towels\r\n\tsum_p = n * p\r\n\r\n\t# print(\"nm: \", num_matches, \" ex: \", extras, \" sum_b: \", sum_b, \" sum_p: \", sum_p);\r\n\t# print(m)\r\n\t#each match needs b bottles * 3, each player needs p towels\r\n\twhile num_matches > 0:\r\n\t\t#update the number of participants and num_bottles\r\n\t\tm = num_matches + extras\r\n\t\t# print(\"m: \", m)\r\n\t\t#update the number of matches\r\n\t\tnum_matches = m // 2\r\n\t\t# print(\"nm: \", num_matches)\r\n\t\textras = abs(-m // 2) - num_matches\r\n\t\t# print(\"ex: \", extras)\r\n\r\n\t\t#each match has two participants and one judge who gets one bottle\r\n\t\tsum_b += (num_matches * 2 * b) + (num_matches)\r\n\r\n\tprint(sum_b, sum_p)\r\n", "n, b, p = map(int, input().split())\r\nt = n * p\r\na = 0\r\n\r\nprint((n - 1) * (2*b + 1), t)", "n,m,k=map(int,input().split())\r\nz=n-1\r\n\r\nprint (z*(2*m+1),n*k)", "n,b,p = map(int, input().split())\r\n\r\nx = 0\r\ny = p * n\r\n \r\nwhile n > 1:\r\n q = n // 2\r\n w = n % 2\r\n x = x + (q*2*b) + q\r\n n = q + w\r\n \r\nprint(x, y)", "\r\n\r\nif __name__=='__main__':\r\n n,b,p = map(int,input().split())\r\n print((n-1)*((2*b)+1),n*p)\r\n", "n, b, p = map(int, input().split())\r\n\r\nx = 0\r\ny = n * p\r\n\r\nwhile n > 1:\r\n k = 1\r\n while k <= n:\r\n k *= 2\r\n k //= 2\r\n \r\n x += b * k + k // 2\r\n\r\n n -= k // 2\r\n\r\nprint(x, y)\r\n", "n,b,p=map(int,input().split())\r\nc=0\r\nc2=n*p\r\nwhile n>1:\r\n\tc+=n//2\r\n\tif n&1:\r\n\t\tc+=(n-1)*b\r\n\t\tn=n//2+1\r\n\telse:\r\n\t\tc+=n*b\r\n\t\tn=n//2\r\nprint(c,c2)", "n,b,p=map(int,input().split())\r\ny=n*p\r\nx=0\r\nwhile n>1:\r\n\tk=1\r\n\twhile k*2<=n:k*=2\r\n\tx+=k*b+k//2\r\n\tn=k//2+n-k\r\nprint(x,y)\n# Mon Oct 05 2020 12:33:05 GMT+0300 (Москва, стандартное время)\n", "linha = input().split()\n\nparticipantes = int(linha[0])\nb = int(linha[1])\np = int(linha[2])\n\ntotalP = p*participantes\ntotalB = 0\n\nwhile participantes != 1:\n rounds = 0\n aux = participantes\n \n while aux != 1:\n rounds += 1\n aux //= 2\n \n participantesRodada = 2*rounds\n \n totalB += rounds * (2*b + 1)\n \n \n \n participantes -= participantesRodada // 2\n \n\n\nprint(totalB, totalP, end=\" \")\n\t \t\t\t\t\t\t\t \t \t \t \t\t\t \t\t \t", "n, b, p = map(int, input().split())\n\nbottles = 0\ntowels = n*p\n\nwhile n != 1:\n k = n//2\n bottles += k*(2*b + 1)\n m = n - k*2\n n = m + k\n\nprint(bottles, towels)\n \t\t\t\t\t \t\t \t \t\t\t \t\t \t\t\t\t\t\t\t\t", "import sys\nni = lambda :int(input())\nna = lambda :list(map(int,input().split()))\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\n#######################################################################\n\nn,a,b = na()\ny = n * b\nx = 0\nwhile n > 1:\n r = 1\n while r * 2 <= n:\n r *= 2\n x += r * a + r//2\n n -= r//2\nprint(x, y)\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf, log2\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn, b, p = map(int, input().split())\r\n\r\ntowel = p*n\r\nwater = 0\r\n\r\nwhile n > 1:\r\n match = int(log2(n))\r\n\r\n water += 2**match*b+2**(match-1)\r\n rem = n - 2**match\r\n # print(match)\r\n # print(water)\r\n n = 2**(match-1)+rem\r\n\r\nprint(water, towel)\r\n\r\n", "n, b, p = [int(t) for t in input().split()]\r\nprint((n - 1) * (2 * b + 1), n * p)", "x = input().split(\" \")\nn = int(x[0])\nb = int(x[1])\np = int(x[2])\n\nx = 0\ny = p * n\n\nwhile n > 1:\n q = n // 2\n w = n % 2\n x = x + (q*2*b) + q\n n = q + w\n\nprint (x, y)\n \t\t\t\t\t\t\t\t \t \t \t\t\t\t\t\t\t \t\t", "k = list(map(int,input().split()))\r\nn = k[0]\r\nb = k[1]\r\np = k[2]\r\nprint((n - 1) * 2 * b + (n - 1), n * p)\n# Thu Oct 08 2020 17:39:18 GMT+0300 (Москва, стандартное время)\n", "# LUOGU_RID: 134395597\nn,b,p=map(int,input().split())\nprint((n-1)*b*2+n-1,n*p)", "ans = input().split()\r\nans = list(map(int, ans))\r\nn = ans[0]\r\nb = ans[1]\r\np = ans[2]\r\n\r\nx = 0\r\ny = 0\r\ndef round(n):\r\n global x\r\n s = 1\r\n if n == 1:\r\n return\r\n else:\r\n while 2**s < n:\r\n s += 1\r\n if 2**s > n:\r\n s -= 1\r\n k = 2**s\r\n x += k * b + k/2\r\n m = int(k/2 +(n - k))\r\n round(m)\r\n\r\nround(n)\r\nprint(int(x), n * p)\n# Fri Oct 16 2020 15:11:18 GMT+0300 (Москва, стандартное время)\n", "n, b, p = map(int, input().split())\r\n\r\n# Initialize the total bottles and towels needed\r\ntotal_bottles = 0\r\ntotal_towels = n * p\r\n\r\nwhile n > 1:\r\n # Calculate the number of matches in the current round\r\n k = 2 ** (n.bit_length() - 1)\r\n matches = n // 2\r\n\r\n # Calculate the bottles needed for the matches and judge\r\n bottles_needed = matches * (2*b+1)\r\n\r\n # Update total bottles and the number of participants for the next round\r\n total_bottles += bottles_needed\r\n n = matches + (n % 2)\r\n\r\nprint(total_bottles, total_towels)\r\n", "n, b, p = map(int, input().split())\nans1, ans2 = 0, n * p\nwhile n != 1:\n power = 1\n while power * 2 <= n: power *= 2\n ans1 += ( 2 * b + 1 ) * ( power // 2 )\n n = power // 2 + n - power\nprint(ans1, ans2)\n", "n, b, p = map(int, input().split())\ntwos = []\nfor i in range(1, 9):\n twos.append(pow(2, i))\n\ndef getk(m):\n for x in twos[::-1]:\n if x <= m:\n return x\n return -1\n\nmatches = 0\nm = n\nwhile m > 1:\n k = getk(m)\n m = k // 2 + m - k\n matches += k // 2\n\nprint(matches * (2 * b + 1), n * p)", "a,b,c=map(int,input().split())\r\nm=(a-1)*(2*b+1)\r\nn=a*c\r\nprint(m,n)", "n, b, p = input().split(\" \")\nn = int(n)\nb = int(b)\np = int(p)\nprint((2*b+1)*(n-1), n*p)\n", "n, b, p = map(int, input().split())\r\n\r\nc = 0\r\nk = n\r\nwhile k > 1:\r\n\ti = 1\r\n\twhile i * 2 <= k:\r\n\t\ti *= 2\r\n\th = i // 2\r\n\tc += h + h * b * 2\r\n\tk = h + k - i\r\n\r\nprint(c, n * p)", "n,b,p=map(int,input().split())\r\nprint((n-1)*b*2+n-1,n*p)", "n, b, p = map(int, input().split())\r\np *= n\r\ng = 0\r\n\r\nwhile n > 1:\r\n x = 1\r\n while 4*x <= n:\r\n x *= 2\r\n g += x\r\n n -= x\r\n\r\nprint(g*(2*b+1), p)", "n,b,p=map(int,input().split())\r\nans=0\r\nx=n\r\nwhile(n>1):\r\n ans = ((n//2)*2*b) + (n//2) + ans\r\n n= (n//2 )+ (n - ((n//2)*2))\r\nprint(ans,x*p)\r\n", "n,b,p = map(int,input().split())\r\nprint((n - 1)*(2 * b + 1),n * p)", "s=input().split()\r\n\r\nn=int(s[0])\r\n\r\nb=int(s[1])\r\n\r\np=int(s[2])\r\n\r\nprint((n-1)*(2*b+1))\r\n\r\nprint(n*p)\r\n", "n,b,p = [int(x) for x in input().split()]\nb = 2*b+1\ntow = p*n\nmatches = 0\nwhile(n>1):\n sub = n//2\n matches += sub\n n-=sub\nprint(b*matches,tow)\n", "firstLine = list(map(int, input().split()))\nn = firstLine[0]\nb = firstLine[1]\np = firstLine[2]\nnumOfMatches = 1\nnumOfbottles = 0\nnumOftowels = 0\nremaining = 0\nnumOftowels = n*p\nwhile(numOfMatches*2 <= n):\n numOfMatches *= 2\n\nif(numOfMatches == n):\n numOfMatches -= 1\nelse:\n remaining = n - numOfMatches\n numOfMatches = remaining + numOfMatches -1\nnumOfbottles = numOfMatches*2*b + numOfMatches\n\nprint(numOfbottles, numOftowels)\n\t \t \t\t\t\t \t \t\t\t\t\t\t \t \t\t \t", "n,a,p=map(int,input().split())\r\nc,x=0,n\r\nwhile n>=2:\r\n if n%2==0:\r\n c+=n//2\r\n n=n//2\r\n else:\r\n c+=n//2\r\n n=n//2+1\r\nprint(c*(2*a+1),p*x)\r\n\r\n\r\n\r\n", "n,b,t=map(int,input().split())\r\nx=(n-1)*b*2+(n-1)\r\ny=n*t\r\nprint(x,y)\r\n", "read = lambda: map(int, input().split())\r\nn, b, p = read()\r\ny = p * n\r\nx = 0\r\nwhile n > 1:\r\n p = 0\r\n while 2 ** p <= n: p += 1\r\n k = 2 ** (p - 1)\r\n x += (k // 2) * (2 * b + 1)\r\n n = n - k + k // 2\r\nprint(x, y) \r\n", "n, b, p = map(int,input().split())\r\nprint((n - 1) * 2 * b + (n - 1), n * p)\n# Thu Oct 08 2020 17:35:26 GMT+0300 (Москва, стандартное время)\n", "import collections\r\nimport math\r\n\r\nn, b, p = map(int, input().split())\r\nans, k, t = 0, 2, n\r\nwhile k <= n:\r\n k *= 2\r\nk //= 2\r\nwhile n != 1:\r\n ans += (2 * b + 1) * (k // 2)\r\n n -= k // 2\r\n while k > n:\r\n k //= 2\r\nprint(ans, t * p)", "if __name__ == '__main__':\n n, b, p = map(int, input().split())\n\n print(((n - 1) * ((2 * b) + 1)), n * p)\n\n\t \t \t \t \t\t\t \t\t\t \t\t\t\t \t \t \t \t", "n, b, p = input().split()\nn = int(n)\nb = int(b)\np = int(p)\n\nbottles = (n - 1) * (2 * b + 1)\n\ntowels = p * n\n\nprint(str(bottles) + \" \" + str(towels))\n \t\t \t\t\t \t\t\t \t\t \t\t\t \t \t", "n,b,p = [int(c) for c in input().split()]\n\n\nprint((n-1)*(2*b+1), n*p)\n\n\t \t\t\t\t\t \t\t \t \t\t \t \t \t\t \t", "n,b,p = map(int,input().split())\r\nprint((n-1)*(2*b + 1),n*p)\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn,b,p=map(int,input().split())\r\nprint((n-1)*(2*b+1),n*p)", "def mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\ndef listring(l): return ' '.join([str(x) for x in l])\r\ndef printlist(l): print(' '.join([str(x) for x in l]))\r\n\r\nn,b,p = mp()\r\nmatch = 2*b+1\r\ntowel = n*p\r\nresult = 0\r\nwhile n > 1:\r\n x = 2**(len(bin(n))-2)\r\n result += match*x\r\n n -= x\r\nprint(\"%d %d\" % (result,towel))\r\n\r\n", "ch=input()\r\nd=ch.split(\" \")\r\nn=int(d[0])\r\nb=int(d[1])\r\np=int(d[2])\r\ntowels=p*n\r\nbottle=b*2+1\r\nS=0\r\nn1=n\r\nwhile n1>1 :\r\n S=S+n1//2\r\n n1=n1//2+n1%2\r\nprint(S*bottle,towels)\r\n", "n, b, p = map(int, input().split())\r\nw, t = 0, n*p\r\nwhile n > 1:\r\n\tm = n // 2\r\n\tw += m*(2*b + 1)\r\n\tn -= m\r\nprint(w, t)", "n, b, p = list(map(int, input().split()))\n\nmatches = n - 1 \n\ntotal_b = (matches * 2 * b) + matches\ntotal_p = n * p \n\nprint(total_b, total_p)\n\t\t\t \t \t \t\t \t \t \t \t \t\t\t", "n, b, p = (map(int, input().split()))\ngarrafas = 0\ntoalhas = p * n\np_round = n\n\nwhile p_round > 1:\n k = 2\n while True:\n if k > p_round:\n k = int(k/2)\n break\n k = k*2\n\n jogos = int(k/2)\n passaram_ez = p_round - k\n p_round = k/2 + passaram_ez\n garrafas += (b * k) + jogos\n\n\nprint(garrafas, toalhas)\n \t\t\t \t \t\t\t \t\t \t\t \t\t\t\t", "n, b, p = map(int, input().split())\r\ntow = n*p\r\nbot = 0\r\nwhile n>1:\r\n ex = n%2\r\n n = n - ex\r\n bot += n*b + (n//2)\r\n n = n // 2\r\n n = n + ex\r\nprint(bot, tow)\r\n", "import sys\n\ndef find_k(n):\n k = 1\n while (k * 2) <= n:\n k *= 2\n return k\n\ndef solve(n, b, p):\n nb_bottles, nb_towels = 0, n * p\n while n > 1:\n k = find_k(n)\n rest = n - k\n nb_matchs = k // 2\n nb_bottles += ((k * b) + nb_matchs)\n n = (k // 2) + rest\n return (nb_bottles, nb_towels)\n\nassert solve(5, 2, 3) == (20, 15)\nassert solve(8, 2, 4) == (35, 32)\n\nn, b, p = map(int, sys.stdin.readline().strip().split(' '))\n\nnb_bottles, nb_towels = solve(n, b, p)\nprint('{} {}'.format(nb_bottles, nb_towels))\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,b,p=map(int,input().split())\r\nprint((n-1)*(2*b+1),n*p)", "n,b,p=map(int,input().split())\r\nx=n;s=0\r\nfor i in range(1,10000):\r\n if x%2==0 :\r\n if x>0:\r\n x=x//2\r\n s+=(b*2+1)*x\r\n else:\r\n break\r\n if x%2!=0 and x>0:\r\n if x>0:\r\n x=(x//2)+1\r\n s+=(b*2+1)*(x-1)\r\n else:\r\n break\r\nprint(s,n*p)\r\n ", "p=input().rstrip().split(' ')\r\na=int(p[0])\r\nb=int(p[1])\r\nc=int(p[2])\r\nb=(b*2)+1\r\nprint(b*(a-1),c*a)\r\n", "n,b,p=map(int,input().split())\nn1=n\nimport math\nk=int(math.log(n,2))\nmat=0\nwhile n>1:\n n-=(2**(k-1))\n mat+=2**(k-1)\n \n k=int(math.log(n,2))\nprint((mat*(2*b+1)),p*n1)\n", "n, b, p = map(int, input().split())\r\nx, y = 0, n * p\r\nwhile n > 1:\r\n x += (n // 2) * b * 2 + n // 2\r\n if n % 2 == 0:\r\n n //= 2\r\n else:\r\n n //= 2\r\n n += 1\r\nprint(\"{} {}\".format(x, y))\r\n", "def maxpow(p):\n x = 1\n while((x*2)<=p):\n x *= 2\n return x\n\ndef main():\n x = input().split()\n n = int(x[0])\n b = int(x[1])\n p = int(x[2])\n p = p*n\n nmatches = 0\n while(n>1):\n max = maxpow(n)\n nmatches += (max/2)\n n -= (max/2)\n b = int(b*2*nmatches + nmatches)\n print(b,p)\n \nmain()\n\t \t\t\t\t\t\t\t\t\t \t \t \t\t \t \t \t", "n, b, p = map(int, input().split())\r\nprint((n - 1) * (b * 2 + 1), n * p)\r\n", "import math\r\ntotal_match = 0\r\ntotal_bottles = 0\r\nm,b,p = list(map(int,input().split()))\r\ntotal_towels = p*m\r\n\r\nplayer = m\r\nwhile player>1:\r\n k = 2** math.floor(math.log(player,2)) \r\n player = k//2 + (player - k)\r\n total_bottles += (k*b + k//2)\r\n \r\nprint(total_bottles, total_towels)\r\n\r\n \r\n \r\n \r\n", "n, b, p = map(int, input().split())\r\nc, v = n, 0\r\nwhile c > 1:\r\n k = 2\r\n while 2 * k <= c:\r\n k *= 2\r\n c -= k // 2\r\n v += k * b + k // 2\r\nprint(v, n * p)", "n, b, p = map(int, input().split())\nr1 = 0\nr2 = p * n\nwhile n != 1:\n curr = 1\n while curr * 2 <= n:\n curr *= 2\n n -= curr // 2\n r1 += curr * b + curr // 2\nprint(r1, r2)", "n, b, p = map(int, input().split())\nprint((n-1)*(2*b+1), n*p)\n\t \t\t \t \t\t\t \t \t\t\t \t\t\t\t\t\t \t\t", "participants, bottles, towels = map(int, input().split())\n\nbpm = bottles * 2 + 1\n\n\nprint(\"{0} {1}\".format((participants-1)*bpm,participants*towels ))\n\t\t\t \t\t \t \t\t\t\t\t\t\t\t \t \t\t\t \t", "n,a,p=map(int,input().split())\r\nprint((n-1)*(2*a+1),p*n)\r\n\r\n\r\n\r\n", "n=str(input())\r\nn=n+\" \"\r\ni=0\r\ns=\"\"\r\nc=0\r\nwhile(i<len(n)):\r\n if ( n[i]!= \" \" ):\r\n s=s+n[i]\r\n else :\r\n if c==0 :\r\n m=int(s)\r\n if c==1 :\r\n b=int(s)\r\n if c==2 :\r\n p=int(s)\r\n c=c+1\r\n s=\"\"\r\n i=i+1\r\nif(m>=1 and m<=500 and p>=1 and p<=500 and b>=1 and b<=500 ):\r\n sb=0\r\n sp=m*p\r\n while(m!=1):\r\n k=(m//2)*2\r\n sb=sb+k*b+0.5*k\r\n m=m-0.5*k\r\n sb=int(sb)\r\n print(sb,sp)\r\nelse:\r\n print (\"invalid input\")\r\n", "n, b, p = [int(x) for x in input().split()]\r\nprint((2 * b + 1) * (n - 1), n * p)\r\n", "def highest_2power(n):\n while n & (n -1 ) > 0:\n n &= n - 1;\n return n\n\n\nn, b, p = map(int, input().split())\nbottles = 0\ntowels = n * p\nwhile n > 1:\n hp = highest_2power(n)\n matches = hp // 2\n bottles += b * hp + matches\n n -= matches\nprint(bottles, towels)\n", "#Ana Clara Lacaze\n#193858\n\nn,b,p = [int(i) for i in input().split()]\nx = (n-1)*(2*b+1)\ny = n*p\nprint(x,y)\n\t \t\t\t \t \t\t\t\t \t \t \t\t \t \t \t \t", "n, b, p = map(int, input().split())\r\nprint((n - 1) * (2 * b + 1), n * p)", "import math\r\nfrom math import *\r\nn,b,p = map(int, input().split(' '))\r\n#n,b,p = 5,2,3\r\nansb = 0\r\nansp = p * n\r\nwhile n > 1:\r\n t = floor(log(n)/log(2))\r\n m = 2**t\r\n ansb += (2*b + 1) * (m/2)\r\n n -= m/2\r\nprint(int(ansb), int(ansp))", "\n\nn, b, p = map(int, input().split())\n\nm = n\nans = 0\nwhile n > 1:\n ans += n // 2\n n += n % 2\n n //= 2\n\nprint(ans*(1+b*2), m*p)\n", "n, b, p = input().split(' ')\nn, b, p = int(n), int(b), int(p)\n\ny = n\nremainingPlayers = n\nnumberOfMatches = 0\nexponent = 0\n\n\nwhile(remainingPlayers > 1):\n while(2**(exponent+1) < remainingPlayers):\n exponent+=1\n numberOfMatches += 2**(exponent-1)\n remainingPlayers = remainingPlayers - (2**(exponent-1))\n exponent = 0\n print()\nprint(int(numberOfMatches*(2*b + 1)), y*p) \n\t\t\t\t\t\t \t \t\t\t\t \t\t \t \t \t\t \t\t \t", "from math import *\r\n\r\nn, b, p = map(int, input().split())\r\nqb, qp = 0, n * p\r\nwhile n != 1:\r\n\tnow = 2 ** int(log2(n))\r\n\tqb += now * b + (now / 2)\r\n\tn -= (now / 2)\r\nprint(int(qb), qp)", "n, b, p = map(int, input().split())\r\n\r\nans1 = 0\r\nans2 = p * n\r\nwhile n != 1:\r\n k = 1\r\n while k * 2 <= n:\r\n k *= 2\r\n ans1 += k // 2 + b * k\r\n n -= k // 2\r\n\r\nprint(ans1, ans2)\r\n", "n, b, p = map(int, input().split())\n\ngarrafas = (n-1) * (2*b + 1)\ntoalhas = n * p\n\nprint(garrafas, toalhas)\n\n \t \t \t \t\t\t\t \t \t \t\t\t\t\t", "p, a, t = map(int, input().split())\n\nt1 = (p-1)*2*a + (p-1)\nt2 = t*p\n\nprint(t1,t2)", "n, b, p = map(int, input().split())\r\nansb = 0\r\nanst = n*p\r\nwhile n > 1:\r\n x = n//2\r\n y = n % 2\r\n n -= x\r\n ansb += b*x*2 + x\r\nprint(ansb, anst)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, b, p = map(int, input().split())\r\n\r\nk = n\r\nc = 0\r\nwhile n != 1:\r\n x, y = divmod(n,2)\r\n c += x\r\n n = x + y\r\n\r\nprint(c*(b*2+1), p*k)", "n, b, p=map(int, input(). split())\r\nprint((n-1)*(2*b+1), p*n)\n# Mon Oct 12 2020 22:21:52 GMT+0300 (Москва, стандартное время)\n", "def f(m):\n k = 0\n while 2**k<=m:\n k+=1\n return 2**(k-1)\n\nn, water, towel = map(int, input().split())\ntowel*=n\nwans = 0\n\nwhile n>1:\n k = f(n)\n n = k//2+n-k\n wans += k*water+k//2\n\nprint(wans, towel)\n", "n, b, p = map(int, input().split())\r\nanswer1 = 0\r\nanswer2 = n\r\nwhile n > 1:\r\n k = 1\r\n while k < n:\r\n k *= 2\r\n answer1 += k * b + (k // 2)\r\n n = k // 2 + n - k\r\nprint(answer1, answer2 * p)", "n,b, p = input().split();\r\nn= int(n)\r\nb=int(b)\r\np=int(p)\r\nprint((n-1)*2*b+(n-1),end=' ')\r\nprint(n*p)\r\n", "import math\r\n\r\ndef gcd(a,b):\r\n if a<b:a,b=b,a\r\n while a%b!=0:\r\n a,b=b,a%b\r\n return b\r\n\r\nn,b,p=map(int,input().split())\r\nans=0;n0=n*1\r\n\r\nwhile n>1:\r\n k=2**int(math.log2(n))\r\n ans+=k//2 + b*k\r\n n=n-k//2\r\n\r\nprint(ans,n0*p)", "from math import log2\n\nn, b, p = input().split()\nn, b, p = int(n), int(b), int(p)\ntowels = n * p\nbottles = 0\n\nwhile n != 1:\n matches = int(log2(n))\n n -= matches\n bottles += matches * (2 * b + 1)\nprint(bottles, towels, sep=' ')\n\t\t\t\t\t\t \t \t\t \t\t\t \t \t\t \t", "n,b,p = map(int,input().split())\r\nm = n\r\ns = 0\r\nwhile m > 1 :\r\n k = 1\r\n while k*2 <= m :\r\n k *= 2\r\n s += k*b + k//2\r\n m -= k//2\r\nprint(s,n*p)", "n,b,p = map(int,input().split())\r\nx = (n-1)*(2*b+1)\r\ny = p * n\r\nprint(x,y)\r\n\r\n", "n, b, p = map(int, input().split())\n\nx = (n - 1) * (b * 2 + 1)\ny = n * p\nprint(x, y)\n\n\t\t \t\t \t \t\t\t \t \t\t\t \t\t\t\t \t \t", "a,b,c=map(int,input().split())\r\nsm=0\r\noramal=c*a\r\ns=0\r\nfor i in range(1,a):\r\n sm+=1\r\n s+=1\r\nwater=s+(sm*2*b)\r\nprint(water,oramal)", "import math\r\n\r\nn, b, p = [int(x) for x in input().split(' ')]\r\nt = n * p\r\nm = 0\r\nwhile n > 1:\r\n m += 2 ** (math.floor(math.log(n, 2)) - 1)\r\n n -= 2 ** (math.floor(math.log(n, 2)) - 1)\r\nprint(m * (2 * b + 1), t)", "n,b,p=map(int,input().split())\r\nz=n\r\ncount=0\r\nwhile n!=1:\r\n\tq=n//2\r\n\tcount+=(2*q*b)+q\r\n\tn=q+n%2\r\nprint(count,z*p)", "import math\r\nn,b,p = map(int,input().split())\r\ntot = 0\r\ntowels = p*n\r\nwhile n != 1:\r\n\r\n x = pow(2,int(math.log2(n)))\r\n tot += b*x + x//2\r\n n -= x//2\r\nprint(tot,towels)", "n,b,p=list(map(int,input().split()))\r\nh=0;l=n\r\nwhile n>1:\r\n a=int(n/2)\r\n e=n-a*2\r\n n=a+e\r\n # print(e)\r\n h=a+h\r\nprint(2*h*b+h*1,l*p) \r\n \r\n \r\n \r\n", "import math\n\n\ndef getNumberOfMatches(participants):\n if participants == 1:\n return 0\n\n competidors = int(math.sqrt(participants))**2\n\n return competidors / 2 + getNumberOfMatches(competidors / 2 + participants - competidors)\n\ndef main():\n participants, bottles_per_match, towels_per_participant = [int(x) for x in input().split(\" \")] \n\n matches = getNumberOfMatches(participants)\n print(f'{int(matches*(2*bottles_per_match + 1))} {towels_per_participant * participants}')\n\n\n\nmain()\n\t \t\t \t \t\t \t\t\t \t \t\t\t\t", "from math import log, ceil\n\n[n, b, p] = list(map(int, input().split(' ')))\n\nn_t = p*n\nn_games = 0\nwhile n > 1:\n k = 2 ** ceil(log(n, 2))\n n_games += k // 2\n n -= k // 2\n\nprint('{} {}'.format(int(n_games * (2*b + 1)), n_t))\n\n \t\t \t \t \t\t \t\t \t\t \t\t\t \t", "if __name__ == \"__main__\":\r\n\r\n n , b , p = map( int , input().split() )\r\n\r\n res2 = n*p\r\n res1 = 0\r\n while n > 1:\r\n res1 += (n//2)*(2*b+1)\r\n n -= n//2\r\n\r\n print( res1 , res2 )", "import math\n\ndef cal(n):\n result = 0\n while n > 1:\n t = pow(2, int(math.log2(n)))\n result += t-1\n n = n-t+1\n return result\n\nn, b, p = map(int, input().split(' '))\nprint((2*b+1)*cal(n), n*p)\n", "n, b, p = map(int, input().split())\n\ndef getk(m):\n k = 1\n while k * 2 <= m:\n k *= 2\n return k\n\nmatches = 0\nm = n\nwhile m > 1:\n k = getk(m)\n m = k // 2 + m - k\n matches += k // 2\n\nprint(matches * (2 * b + 1), n * p)", "n, botles, polot = map(int,input().split())\nb = (n-1) * (2 * botles + 1)\np = n * polot\nprint(b, p, sep = ' ')\n\n \n \n ", "n,b,p = input().split()\r\n\r\nn = int(n)\r\nb = int(b)\r\np = int(p)\r\n\r\nx = (n-1)*(2*b+1)\r\ny = n*p\r\n\r\nprint(x,y)\r\n", "n, b, p = map(int, input().split())\r\n\r\nprint((2 * b + 1) * (n - 1), p * n)\r\n", "def power(n):\r\n if n==1:\r\n return 0\r\n else:\r\n return 1 + power(n // 2)\r\ndef calculate(n):\r\n matches=0\r\n if n==1:\r\n return 0\r\n else:\r\n return (2**(power(n)))/2+calculate(n-2**(power(n)-1))\r\nn,b,p = list(map(int,input().split()))\r\nbottles = 2*b + 1\r\nL = [int(calculate(n)*bottles),n*p]\r\nprint(*L)", "n,b,p=map(int,input().split())\r\nprevOdd=0\r\nif(n%2==0):\r\n\tprevOdd=1;\r\ni,bot=n,0\r\nwhile(i!=1):\r\n\tif(i%2==0):\r\n\t\tprevOdd=0;\r\n\t\ti=i//2\r\n\t\tbot+=i+2*i*b\r\n\telse:\r\n\t\tprevOdd=1\r\n\t\ti=i//2\r\n\t\tbot+=i+2*i*b\r\n\tif(prevOdd==1):\r\n\t\ti+=1\r\nprint(bot,n*p)", "n, b, p = map(int, input().split())\r\nprint(((2* b) + 1)* (n-1), n*p)", "#!/usr/bin/env python3\n\nfrom __future__ import division, print_function\n\ndef solver(ifs):\n from math import log2\n n, b, p = list(map(int, ifs.readline().split()))\n towels = p * n\n bottles = 0\n while n > 1:\n a = int(log2(n+1))\n c = 2**a\n bottles += c*b + c//2\n n = n - c//2\n print(bottles, towels)\n\ndef main():\n import sys\n if sys.version_info.major == 3:\n from io import StringIO as StreamIO\n else:\n from io import BytesIO as StreamIO\n \n with StreamIO(sys.stdin.read()) as ifs, StreamIO() as ofs:\n _stdout = sys.stdout\n sys.stdout = ofs\n solver(ifs)\n sys.stdout = _stdout\n sys.stdout.write(ofs.getvalue())\n return 0\n\nif __name__ == '__main__':\n main()\n", "y = input().split()\r\ni = list(map(int,y))\r\nn = i[0]\r\nb = i[1]\r\np = i[2] \r\nx=(n-1)*(2*b+1)\r\ny=n*p\r\nprint(x,y)\n# Wed Oct 14 2020 18:24:25 GMT+0300 (Москва, стандартное время)\n", "def getBottlesAndTowels(n, b, p):\r\n return (n-1) * (2*b + 1), n * p\r\n\r\nif __name__ == '__main__':\r\n n, b, p = input().split()\r\n x, y = getBottlesAndTowels(int(n), int(b), int(p))\r\n print(x, y)", "n, b, p = map(int, input().split())\r\nbm = b * 2 + 1\r\np *= n\r\nq_of_pairs = 0\r\nwhile n != 1:\r\n k = 0\r\n while 2 ** (k + 1) <= n:\r\n k += 1\r\n q_of_pairs += (2 ** k) // 2\r\n n -= (2 ** k) // 2\r\nprint(q_of_pairs * bm, p)\r\n", "n, b, p = map(int, input().split())\nansb = p * n\nif n == 1:\n print(0, ansb)\nelse:\n k = 2\n while 2 * k <= n:\n k *= 2\n ansa = 0\n while n > 1:\n k //= 2\n ansa += b * 2 * k + k\n n -= k\n while 2 * k <= n:\n k *= 2\n while k > n:\n k //= 2\n print(ansa, ansb)\n", "import sys\ninput = sys.stdin.readline\n\nn, b, p = map(int, input().split())\n\nnn = n\n\nx = 0\n\nwhile n > 1:\n k = 0\n while 2**k <= n:\n k += 1\n\n k -= 1\n\n x += 2**(k-1) * (2*b + 1)\n\n n -= 2**(k-1)\n\nprint(x, nn*p)\n", "n, b, p = list(map(int, input().split()))\n\ntotal_b = 0\ntotal_p = p * n\n\nwhile n > 1:\n total_b += (b * (n // 2) * 2) + (n // 2)\n n = n // 2 + n % 2\n\nprint(total_b, total_p)\n\n \t\t\t \t\t \t \t\t\t \t \t\t \t\t\t \t\t \t", "n,b,p=map(int,input().split())\r\nprint((n-1)*(b*2+1),n*p)", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\ndef right_most_set_bit(x):\r\n pos = 0\r\n while x > 0:\r\n x = x >> 1\r\n pos += 1\r\n return 1 << (pos - 1)\r\n\r\nn, b, p = get_ints()\r\nbottles = 0\r\ntowels = n * p\r\nwhile n > 1:\r\n matches = right_most_set_bit(n)//2\r\n bottles += (matches*2*b + matches)\r\n n = matches + (n - 2*matches)\r\n\r\nprint(bottles, towels)", "n,b,p=map(int,input().split())\r\nans_b=0\r\nans_p=n*p\r\nwhile n!=1:\r\n kol_m=n//2\r\n ans_b+=kol_m*(2*b+1)\r\n n=n-n//2\r\nprint(ans_b,ans_p)", "players, bottles_per_player, towels_per_player = [int(numero) for numero in input().split(\" \")]\nbottles = 0\ntowels = towels_per_player * players\n\ndef find_power_of_2(number):\n pot = -1\n while(number >= 1):\n number = number / 2\n pot = pot + 1\n return 2 ** pot\n\nwhile(players > 1):\n matches = find_power_of_2(players) / 2\n bottles = bottles + matches * (1 + 2 * bottles_per_player)\n players = matches + (players - 2*matches)\n\nprint(int(bottles), towels)\n \t\t \t \t \t \t \t\t \t\t \t \t", "import math\r\ndef total(n, b, p):\r\n\tbot = 0\r\n\ttow = n * p\r\n\tdef pairs(n):\r\n\t\tt = 0\r\n\t\twhile True:\r\n\t\t\tt += 1\r\n\t\t\tif math.pow(2, t) >= n:\r\n\t\t\t\tbreak\r\n\t\treturn math.pow(2, t)\r\n\twhile n != 1:\r\n\t\tk = pairs(n)\r\n\t\tbot += math.floor(k * b + (k // 2))\r\n\t\tn -= (k // 2)\r\n\t\tpairs(n)\r\n\treturn bot, tow\r\n\r\nn, b, p = map(int, input().split())\r\nbot, tow = total(n, b, p)\r\nprint(bot, tow)\r\n\r\n\r\n\r\n\r\n", "from math import log,floor\n\ndef get_bottles(n,b):\n bpg = 2*b+1\n gp = n-1\n return bpg * gp\n\nnums = [int(i) for i in input().split(' ')]\nn = nums[0]\nb = nums[1]\np = nums[2]\n\ntowels = n * p\nbottles = get_bottles(n,b)\nprint('{} {}'.format(bottles, towels))\n", "n, b, p = list(map(int, input().split()))\r\n\r\nbottles = 0\r\ntowels = p*n \r\nwhile n > 1:\r\n if n%2:\r\n bottles += (n-1)*b + n//2\r\n n = n//2 +1\r\n else:\r\n bottles += n*b + n//2\r\n n //= 2\r\n \r\nprint(bottles, towels)", "import math\r\nn, bottles, towels = map(int, input().split())\r\nnum = n\r\ncnt = 0\r\nwhile n != 1:\r\n cnt += math.floor(math.log2(n))\r\n n -= math.floor(math.log2(n))\r\nprint(cnt * bottles * 2 + cnt, num * towels)", "ans = input().split()\r\nans = list(map(int, ans))\r\nn = ans[0]\r\nb = ans[1]\r\np = ans[2]\r\n\r\nm = n - 1\r\nx = m*(b*2 + 1)\r\ny = n*p\r\nprint(x, y)\n# Fri Oct 16 2020 15:45:54 GMT+0300 (Москва, стандартное время)\n", "n, b, p = map(int, input().split())\r\nm = n\r\nbottles = 0\r\ntowels = 0\r\nplayers = n\r\nwhile m > 1:\r\n k = max([2 ** i for i in range(m + 1) if 2 ** i <= m])\r\n bottles += (2 * b + 1) * (k // 2)\r\n players = 0\r\n players += (k // 2)\r\n players += (m - k)\r\n m = players\r\nprint(str(bottles) + \" \" + str(p * n))", "\r\nx = input()\r\nplayers , b , p = x.split()\r\nplayers = int(players)\r\nb = int(b)\r\np = int(p)\r\nt = players * p\r\ncounter = 0\r\nfor i in range(1 ,1000):\r\n if players == 1:\r\n break\r\n if players % 2 == 0:\r\n players = players // 2\r\n counter += players\r\n else:\r\n players -= 1\r\n players = players // 2\r\n counter += players + 1\r\nprint(counter * 2 * b + counter , t) ", "# from dust i have come, dust i will be\r\n\r\nimport math\r\n\r\n\r\ndef highestPowerOfTwo(n):\r\n p = int(math.log2(n))\r\n return int(math.pow(2, p))\r\n\r\n\r\nn, b, p = map(int, input().split())\r\n\r\nx = 0;\r\ny = p * n\r\nwhile n > 1:\r\n k = highestPowerOfTwo(n)\r\n x += (k * b + k//2)\r\n n -= (k // 2)\r\n\r\nprint(x, y)\r\n", "n, b, p = map(int, input().split())\ny = n\nans = 0\nwhile n != 1:\n x = 0\n while 2 ** x <= n:\n x += 1\n x -= 1\n ans += 2 ** (x - 1)\n n -= 2 ** (x - 1)\nprint(ans * (2 * b + 1), y * p)\n \n\n# Wed Oct 14 2020 15:22:18 GMT+0300 (Москва, стандартное время)\n", "import math\n\nn, b, p = map(int, input().split(' '))\n\ntotal_bottles = 0\nm = n\nwhile m > 1:\n round_participants = math.floor(math.log(5, 2))\n round_judges = round_participants / 2\n total_bottles += round_judges + b * round_participants\n m = round_participants / 2 + (m - round_participants)\n\ntotal_towels = n * p\nprint(int(total_bottles), int(total_towels))\n \t \t \t\t \t \t \t\t\t\t\t \t", "from math import *\r\n\r\nn, b, p = map(int, input().split())\r\nn2 = n\r\nr = 0\r\nwhile True:\r\n if n == 1:\r\n break\r\n # najdi najmensiu mocninu\r\n c = floor(log(n) / log(2))\r\n # pocet ludi co zapasi\r\n k = 2 ** c\r\n # flasiek\r\n r += k * b + (k // 2) * 1\r\n # postup priamo\r\n postup = n - k\r\n # print(k, r, postup)\r\n # vysledne\r\n n = k // 2 + postup\r\nprint(r, n2 * p)\r\n", "from math import log2\r\nn,b,p =map(int,input().split())\r\nk = 2**int(log2(n))\r\nx=0\r\ny=p*n\r\nwhile n>1:\r\n x+=(b*2+1)*(k//2)\r\n n=k//2 + (n-k)\r\n k = 2**int(log2(n))\r\nprint(x,y)\n# Sat Oct 10 2020 14:02:59 GMT+0300 (Москва, стандартное время)\n", "def power_of_two(n):\r\n sqr=1\r\n while(sqr <= n):\r\n sqr=sqr*2\r\n return (sqr//2)\r\n\r\nn,b,p = map(int, input().split())\r\nkol_b = 0\r\nkol_p = n*p\r\nm = n\r\nwhile (m > 1):\r\n k = power_of_two(m)\r\n game = k//2\r\n kol_b = kol_b + k*b + game\r\n m = m - k + game\r\nprint(kol_b, kol_p)\n# Tue Oct 13 2020 14:44:54 GMT+0300 (Москва, стандартное время)\n", "\na=input()\na=list(map(int,a.split()))\nn=a[0]\nb=a[1]\np=a[2]\ni=0\nc=0\nm=0\nwhile n!=1:\n if n%2==0:\n n=n//2\n m+=n\n elif n%2!=0:\n if c>0:\n n+=1\n c-=1\n else:\n n-=1\n c+=1\n i+=1\nif c==0:\n print(b*m*2+m,a[0]*p)\nelse:\n m+=1\n print(b*m*2+m,a[0]*p)\n\n\n\n\n", "n, b, p = input().split()\r\nn, b, p = int(n), int(b), int(p)\r\n\r\ny = n*p\r\ntot_kamper = 0\r\n\r\n\r\nfor i in range(1,100):\r\n\tif n == 1:\r\n\t\tx = tot_kamper\r\n\telif n % 2 == 0:\r\n\t\trundekamper = int(n/2)\r\n\t\tn = int(n/2)\r\n\t\ttot_kamper += rundekamper\r\n\telif n % 2 == 1:\r\n\t\trundekamper = int(n/2)\r\n\t\tn = int(n/2)+1\r\n\t\ttot_kamper += rundekamper\r\nx = tot_kamper*b*2+tot_kamper\r\nprint(f'{x} {y}')", "from math import log2,ceil\r\nn,p,t=map(int,input().split())\r\nmatch_count = 0\r\ntot = t*n\r\n\r\nwhile n>1:\r\n\tf = int(log2(n))\r\n\tk=2**f\r\n\tl=k//2\r\n\tmatch_count += l\r\n\tn-= l\r\n\r\nprint(match_count*2*p+match_count , tot) ", "def main():\n n, b, p = map(int, input().split())\n k, x = 1 << n.bit_length(), 0\n p *= n\n while n > 1:\n while k > n:\n k //= 2\n x += k\n n -= k // 2\n print(x * (b * 2 + 1) // 2, p)\n\n\nif __name__ == '__main__':\n main()\n", "from math import ceil\r\n\r\nX = list(map(int, input().split()))\r\nTowel, Bottle = 0, 0\r\nTowel = X[0] * X[2]\r\nwhile X[0] != 1:\r\n Bottle += (X[0] // 2) * ((X[1] * 2) + 1)\r\n X[0] = ceil(X[0] / 2)\r\nprint(Bottle, Towel)\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 651\r\n", "def calcularProvisoes(n, b, p):\n numJogadores = n\n restantes = 0\n garrafas = 0\n toalhas = n * p\n while(numJogadores != 1):\n garrafas += ((numJogadores // 2) * b * 2) + (numJogadores // 2)\n numJogadores = (numJogadores // 2) + (numJogadores % 2)\n return garrafas, toalhas\n\nif __name__ == \"__main__\":\n nbp = list(map(int, input().split(' ')))\n b, p = calcularProvisoes(nbp[0], nbp[1], nbp[2])\n print(b, p)\n \t\t\t\t\t\t\t\t\t\t \t\t \t \t\t\t \t\t\t \t\t\t", "from math import log\r\nn, b, c = map(int, input().split())\r\nni = n\r\nans = 0\r\ncur = 0\r\nwhile n > 1:\r\n k = 2 ** int(log(n, 2))\r\n ans += k * b + k / 2\r\n n = k / 2 + n - k\r\nprint(int(ans), ni * c)\n# Fri Oct 16 2020 18:30:02 GMT+0300 (Москва, стандартное время)\n", "from math import floor\r\nnum_players,b,p=map(int,input().split(' '))\r\nmatches,bottles,towels=0,0,0\r\nplayers = int(num_players)\r\nwhile players!=1:\r\n matches += floor(players/2)\r\n players -= floor(players/2)\r\nbottles = matches*(2*(int(b))+1)\r\ntowels = p*int(num_players)\r\nprint(bottles,end=\" \")\r\nprint(towels)", "n, b, p = map(int, input().split())\r\nm = n\r\nans = 0\r\nwhile m > 1:\r\n lb = 0\r\n rb = 10\r\n while lb != rb:\r\n mb = (lb + rb + 1) // 2\r\n if 2**mb <= m:\r\n lb = mb\r\n else:\r\n rb = mb - 1\r\n ans += (2**lb) * b + 2**(lb - 1)\r\n m -= 2**(lb - 1)\r\nprint(ans, n * p)", "import math\n\nnumbers = input().split(\" \")\nfor n in range(len(numbers)):\n numbers[n] = int(numbers[n])\n\nparticipants = numbers[0]\nnumMatches = 0\n\nwhile(participants>1):\n numMatches += math.floor(participants/2)\n participants = math.ceil(participants/2)\n\nnumBottles = numMatches*numbers[1]*2 + numMatches\nnumTowels = numbers[0] * numbers[2]\n\n\nprint(str(numBottles) + \" \" + str(numTowels))", "from math import floor, log2\n\nn, b, p = (int(i) for i in input().split())\nres, k, r = 0, 2 ** floor(log2(n)), n\nwhile r > 1:\n k = k if k <= r else k // 2\n res += b * k + k // 2\n r -= k // 2\nres = res, n * p\nprint(*res)\n", "from math import log2\r\nn,b,p = map(int,input().split())\r\ny = n*p\r\nx = 0\r\nwhile n>1:\r\n m = 1<<(int(log2(n)))\r\n #print(n,m)\r\n n = n-m+(m>>1)\r\n x += (m)*(b+0.5)\r\nprint(int(x),y)", "n, b, p = [int(i) for i in input().split()]\r\nprint((n - 1) * (2 * b + 1), p * n)", "from math import log, floor\n\n(n, b, p) = [int(i) for i in str(input()).split(\" \")]\ntowels = n * p\n\ntb = 0\n\nwhile n > 1:\n k = int(2 ** floor(log(n, 2)))\n tb += int(((2*b) + 1)*k/2)\n n -= int(k/2)\n \nprint(\" \".join(str(i) for i in [tb, towels]))\n \t \t\t\t \t\t\t\t\t \t \t \t \t\t", "def func(n):\r\n if n<2:\r\n return 0\r\n if n==2:\r\n return 1\r\n k=int(n/2)\r\n remain=n-k*2\r\n return k+func(k+remain)\r\n\r\ninf=list(map(int,input().split()))\r\nn,b,p=inf[0],inf[1],inf[2]\r\nwater=2*b+1\r\nmatch=func(n)\r\nprint(match*water,n*p)\r\n", "game = input().split(' ')\r\ngame = [eval(c) for c in game]\r\nrounds = 0\r\ntowels = str(game[0]*game[2])\r\nwhile not(game[0] == 1):\r\n if game[0]%2 == 0:\r\n game[0] = game[0]/2\r\n rounds = rounds + game[0]\r\n if game[0]%2 == 1:\r\n rounds = rounds + game[0]/2-.5\r\n game[0] = game[0]/2+.5\r\nprint(str(int(rounds*(2*game[1]+1))) + ' ' + towels)", "import math\n\nn, b, p = map(int, input().split(' '))\nprint((2*b+1)*(n-1), p*n)\n", "n, b, p = [int(t) for t in input().split()]\r\nprint((n-1)*(2*b+1), n*p)", "from math import log\r\nn,b,p = map(int,input().split())\r\ntowels = n*p\r\nbottles = 0\r\nwhile n > 1:\r\n\tbottles = bottles + (b)*(2**int(log(n,2)))+(2**int(log(n,2)))//2\r\n\tn = n - (2**int(log(n,2)))//2\r\nprint(bottles,towels)\r\n", "enter = input().split(\" \")\nn, b, p = int(enter[0]), int(enter[1]), int(enter[2])\n\ndef numBottles(n, b):\n count = 0\n while n > 1:\n partidas = n // 2\n count += ((2 * partidas) * b) + partidas\n n = (n // 2) + (n % 2)\n return count\n \ntowels = n * p\nbottles = numBottles(n, b)\nprint(bottles, towels)\n \t \t\t\t \t\t\t \t \t \t \t\t\t", "l=list(input().split())\r\nn,b,p=int(l[0]),int(l[1]),int(l[2])\r\nf=n\r\nans=0\r\nans1=0\r\nwhile(n!=1):\r\n ans+=(n//2)*2*b+(n//2)*1\r\n x=n%2\r\n n=n//2+x\r\nprint(ans,f*p)\r\n \r\n", "n, b, p = list(map(int, input().split(\" \")))\ndup = n\nans = 0\nwhile n>1:\n\tans += (n//2)*(2*b + 1)\n\tn = n//2 + n%2\nprint(ans, p*dup)", "import math\r\nn,b,p = map(int,input().split())\r\nb = 2*b+1\r\np = p*n\r\nans = 0\r\nwhile n > 1:\r\n m = (2**int(math.log2(n)))//2\r\n ans += b*m\r\n n -= m\r\nprint('%i %i ' % (ans, p))", "n,b,p = map(int, input().split())\r\nx = 0\r\ny = p*n\r\nwhile n > 1:\r\n k = 1\r\n while k*2 <= n:\r\n k *= 2\r\n nn = k//2+(n-k)\r\n x += k//2\r\n n = nn\r\nx *= 2*b+1\r\nprint(x, y)\r\n", "import sys\r\n\r\nn, b, p = map(int, input().split())\r\nm = 0\r\ntowel = n*p\r\nwhile n > 1:\r\n m += n // 2\r\n n -= n // 2\r\n\r\nprint(m*2*b + m, towel)\r\n", "def main():\r\n n, b, p = map(int, input().split())\r\n print((n-1)*(2*b+1), n*p)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\n# Wed Oct 07 2020 17:46:38 GMT+0300 (Москва, стандартное время)\n", "import sys\r\n\r\nN, B, P = map(int,sys.stdin.readline().rstrip().split(' '))\r\n\r\nnow = N\r\ncnt = 0\r\nwhile now!=1:\r\n if now % 2 == 1 :\r\n now //= 2\r\n cnt += now\r\n now += 1\r\n else :\r\n now //= 2\r\n cnt += now\r\n\r\nprint('%d %d' % (cnt*(B*2+1),N*P))", "from math import ceil,log\r\nn,b,p = map(int,input().split())\r\n\r\nmax_participent = int(n)\r\n\r\nans_bottle=0\r\n\r\nwhile( max_participent>1 ):\r\n\t\r\n\tans_bottle+= (max_participent//2)*2*b + (max_participent//2)\r\n\tmax_participent = (max_participent//2) + (max_participent%2) \r\n\r\nprint(ans_bottle,p*n)", "n,b,p=list(map(int,input().split()));\r\nimport math;\r\nwater,towel=0,n*p;\r\nwhile(n>1):\r\n water+=int((math.pow(2,int(math.log(n,2)))))*b+int((math.pow(2,int(math.log(n,2)))))//2;\r\n #towel+=int((math.pow(2,int(math.log(n,2)))))*p;\r\n n-=math.pow(2,int(math.log(n,2)))//2;\r\nprint(water,towel);", "n,b,p=[int(x) for x in input().split()]\r\nbot,tow=0,p*n\r\nwhile n!=1:\r\n bot+=(n//2)*(2*b+1)\r\n n=(n+1)//2\r\nprint(bot,tow)", "import math\r\n\r\ndef highest_power_of_two(n):\r\n\tlog = math.log(n,2)\r\n\tlog = log//1\r\n\treturn int(log)\r\n\r\n\r\nn,b,p = map(int,input().split(\" \"))\r\n\r\nremaining_praticipants = n\r\nbottles = 0\r\ntowels = n*p\r\nbottles_for_each_match = 2*b + 1\r\n\r\nwhile remaining_praticipants > 1:\r\n\tk = highest_power_of_two(remaining_praticipants)\r\n\tplaying_this_round = 2**k\r\n\tmatches_in_this_round = int(playing_this_round//2)\r\n\tbottles += matches_in_this_round*((2*b) + 1)\r\n\tremaining_praticipants -= int(playing_this_round//2)\r\n\r\nprint(bottles,towels)\r\n\r\n", "n, a, b = map(int, input().split())\r\nprint((n - 1) * ((2 * a) + 1), (n * b))", "n, b, p = map(int, input().split(' '))\naux = n*p\nopt = 2*b+1\nres = 0\nwhile(n!=1):\n res += int(n/2)\n rest = n%2\n n = int(n/2) + rest \nprint(res*opt, aux)\n\t\t \t\t \t \t \t \t\t\t\t \t \t \t\t\t \t", "import math\r\nn, b, p = map(int, input().split())\r\nt = n * p\r\ns = 0\r\nwhile n != 1:\r\n k = 2 ** math.floor(math.log(n, 2))\r\n n = k // 2 + n - k\r\n s += k // 2 * (2 * b + 1)\r\nprint(s, t)", "\r\nn,b,p=map(int,input().split())\r\nm=0\r\nt=n\r\nwhile n>1:\r\n\tm+=(n//2 )\r\n\tn= ((n//2) +(n%2))\r\n# print(m)\r\nbottles=(2*b+1)*(m)\r\ntow=t*p\r\nprint(bottles,tow)\r\n", "import math\r\n\r\ndef get_k(x):\r\n return pow(2, math.floor(math.log(x,2)))\r\n\r\ninp = [int(x) for x in input().split()]\r\nn = inp[0]\r\nb = inp[1]\r\np = inp[2]\r\n\r\nx = 0\r\ny = n * p\r\n\r\nb2 = 2*b + 1\r\nwhile n > 1:\r\n k = get_k(n)\r\n matches = k//2\r\n x += b2*matches\r\n n -= matches\r\n\r\nprint(x, y)", "def solve(t,w,a):\r\n ans=(t-1)*(2*w+1)\r\n return str(ans)+ \" \" + str(t*a)\r\n\r\nt,w,a=map(int,input().split())\r\nprint(solve(t,w,a))\r\n\r\n", "from math import *\r\nn,b,p = map(int,input().split())\r\nm = n\r\nct = 0\r\nwhile(n > 1):\r\n\tx = 1<<(int(log2(n))-1)\r\n\tct += x\r\n\tn -= x\r\nprint((2*b+1)*ct,p*m)", "n,b,p = map(int,input().split())\r\nx = (n-1)*b*2+(n-1)\r\ny = n * p\r\nprint(x,y)\n# Sat Oct 10 2020 21:46:51 GMT+0300 (Москва, стандартное время)\n", "n,b,p = list(map(int, input().strip().split()))\r\n\r\nm = 0\r\n\r\ng = n * p\r\n\r\nwhile n > 1:\r\n i = 1\r\n while 2 ** i <= n:\r\n i += 1\r\n i -= 1\r\n m += 2 ** (i-1)\r\n n = n - 2**(i-1)\r\n\r\nprint(str(m*(2*b+1)) + \" \" + str(g))", "def main():\r\n n, b, p = list(map(int, input().split()))\r\n\r\n total_bottles = 0\r\n bottles_per_match = 2 * b + 1\r\n current_n = n\r\n while current_n > 1:\r\n total_bottles += (current_n // 2) * bottles_per_match\r\n current_n = current_n % 2 + current_n // 2\r\n print(total_bottles, p * n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def highest_power_of_2(n):\n ans = 0\n for i in range(int(n), 0, -1):\n if ((i & (i-1)) == 0):\n ans = i\n break\n return ans\n\ndef tournament(m, b, x):\n k = highest_power_of_2(m)\n if m == 2:\n x += (b * k) + 1\n return tournament(1, b, x)\n if m == 1:\n return x\n if m > 2:\n x += (b * k) + (k/2)\n return tournament(int(k/2 + (m-k)), b, int(x))\n\nn, b, p = map(int, input().split())\nx = tournament(n, b, 0)\ny = p * n\nprint(x, y)\n\t\t\t \t\t\t \t\t \t\t\t\t\t\t \t\t \t\t \t \t", "#import sys\r\n#sys.stdin = open('in', 'r')\r\n#n = int(input())\r\n#a = [int(x) for x in input().split()]\r\nn,b,p = map(int, input().split())\r\ntowels = n * p\r\nbottles = 0\r\nwhile n > 1:\r\n k = (n >> 1)\r\n bottles += k * (2*b + 1)\r\n n -= k\r\n\r\nprint(bottles, towels)\r\n", "inp = list(map(int, input().split()[:3]))\nparticipantes = inp[0]\ngarrafas = inp[1]\ntoalhas = inp[2]\ny = toalhas * participantes\nx = 0\n\nwhile (participantes > 1):\n atual = int(participantes - participantes%2)\n x = x + int(((2*garrafas+1)*atual)/2)\n participantes = int(participantes%2 + participantes/2)\n\nprint(f\"{x} {y}\")\n\n\n\t \t \t \t \t \t \t \t \t\t \t\t\t", "import sys\r\nreadline=sys.stdin.readline\r\nwrite=sys.stdout.write\r\n\r\nN,B,P=map(int,readline().split())\r\nprint((N-1)*(2*B+1),N*P)", "n, b, p = map(int,input().split())\nres = 0\na2 = n * p\nwhile n != 1:\n step = 2\n while step * 2 <= n:\n step *= 2\n res += step * b + step // 2\n n -= step // 2\nprint(res, a2)\n# Thu Oct 08 2020 20:50:34 GMT+0300 (Москва, стандартное время)\n", "n, b, p = map(int, input().split())\n\nm = n - 1\nt_b = m * (2*b + 1)\nt_t = p*n\nprint(f'{t_b} {t_t}')\n\t \t\t\t\t\t\t \t \t\t\t\t\t \t \t\t\t\t \t \t", "n,b,p = input().split()\r\nn,b,p = [int(n),int(b),int(p)]\r\n\r\nprint((n-1)*(2*b+1),\"\",n*p)", "def calc_power_of_2(m):\r\n x = 0\r\n while m >= 2 ** (x + 1):\r\n x += 1\r\n return 2 ** x\r\n\r\n\r\ndef main_function():\r\n n, b, p = [int(i) for i in input().split(\" \")]\r\n towels = n * p\r\n bottles = 0\r\n while n != 1:\r\n k = calc_power_of_2(n)\r\n bottles += (2 * b + 1) * k // 2\r\n n -= k // 2\r\n print(str(bottles) + \" \" + str(towels))\r\n\r\n\r\nmain_function()\r\n", "n, p, q = [int(i) for i in input().split()]\r\nprint((n - 1) * (2 * p + 1), n * q)\r\n", "m,n,p = map(int,input().split())\nv1 = (m-1)*(2*n +1)\nv2 = p*m\nprint(v1, v2)", "a=input().split(\" \")\r\nn=int(a[0])\r\nb=int(a[1])\r\np=int(a[2])\r\nessuies=p*n\r\ndef somme(a):\r\n if a==0:\r\n return 0\r\n else:\r\n return a+somme(a-1)\r\ndef grpuis2(a):\r\n while 1:\r\n for x in range(0, 9):\r\n x=10-x\r\n if 2**x<=a:\r\n return x\r\nscore=0\r\nwhile n>1:\r\n m=n%2\r\n n=n//2\r\n score+=n\r\n n+=m\r\neau=(2*b+1)*score\r\nliste=[str(eau), str(essuies)]\r\nprint(\" \".join(liste))\r\n", "n, b, p = [int(k) for k in input().split()]\ntowels = n * p\nbottles = 0\nwhile n != 1:\n bottles += (n // 2) * (2 * b + 1)\n n = n // 2 + n % 2\nprint(bottles, towels)\n \t \t\t\t\t \t\t \t\t \t\t \t \t \t", "list1=[] #读入（空格间隔式）\r\nstr1=input()\r\nlist2=str1.split(\" \")\r\nlist2_length=len(list2)\r\nx=0\r\nwhile x<=list2_length-1:\r\n list1.append(int(list2.pop()))\r\n x+=1\r\nlist1.reverse()\r\nn=list1[0]\r\nb=list1[1]\r\np=list1[2]\r\nprint((n-1)*(b*2+1),n*p) #输出（自动空格）", "a, b, c = map(int, input().split())\r\nprint(str((a - 1) * (2 * b + 1)) + \" \" + str(a * c))", "import math\r\nn,a,b=map(int, input().split())\r\nc=0;p=n\r\nwhile n>1:\r\n k=int(math.log(n,2))\r\n c+=k\r\n n-=k\r\nprint(c+c*2*a, p*b)", "n, b, p = map(int, input().split())\r\nl = [1, 2, 4, 8, 16, 32, 64, 128, 256]\r\nans = 0\r\nans2 = n * p\r\nwhile n != 1:\r\n if n == 1:\r\n break\r\n c = -1\r\n for i in range(len(l)):\r\n if l[i] > n:\r\n break\r\n else:\r\n c += 1\r\n ans += l[c] * b + 1 * (l[c] // 2)\r\n n -= l[c] // 2\r\nprint(ans, ans2)", "n ,b ,p=map(int,input().split())\r\nprint(((n-1)*(2*b+1)) ,end=\" \")\r\nprint(n*p)\r\n \r\n \t\t\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n", "from math import log\r\ndef solve(n,a,b):\r\n y = n*b\r\n x = 0\r\n while(n>1):\r\n k = int(log(n,2))\r\n k = 2**k\r\n x += (2*a+1)*(k//2)\r\n n = (k//2)+(n-k)\r\n return(str(x)+\" \"+str(y))\r\nn,a,b = map(int,input().split())\r\nprint(solve(n,a,b))\r\n", "from math import log as lg\r\n\r\nif __name__=='__main__':\r\n n,b,p = map(int,input().split(' '))\r\n\r\n bottle= 0\r\n k = pow(2,int(lg(n,2)))\r\n towel = n*p\r\n while k>=2: \r\n bottle += (k*b+int(k/2))\r\n n = int(k/2)+n-k #winners + rem\r\n if n>0:\r\n k = pow(2,int(lg(n,2)))\r\n print (bottle,towel)\r\n \r\n", "\nn, b, p = map(int, input().split())\n\nb_res, p_res = 0, n * p\n\nwhile n > 1:\n tmp = 2\n while 2 * tmp <= n: tmp *= 2\n b_res += tmp * b\n b_res += tmp // 2\n n = n - tmp // 2\n\nprint(b_res, p_res)\n", "n, b, p = [int(x) for x in input().split()]\nb1, p1 = 0, n*p\nwhile n > 1:\n n1 = 2 << (n.bit_length()-2)\n b1 += (2*b + 1) * n1 // 2\n n -= n1//2\nprint(b1, p1)\n", "# 628A Tennis Tournament\r\ndef tennis():\r\n n, b, p = map(int, input().split())\r\n participants = n\r\n t = 0\r\n while participants > 1:\r\n t += participants // 2\r\n participants = participants // 2 + participants % 2\r\n print(f'{t + t * b * 2} {p*n}')\r\ntennis()", "import math \r\ndef hp2(n): \r\n p=int(math.log(n, 2)); \r\n return int(pow(2, p)); \r\n\r\nn,b,p=[int(x) for x in input().split()]\r\ntowels=p*n\r\nbottles=0\r\nk=0\r\nm=n\r\nwhile(m!=1):\r\n k=hp2(m)\r\n bottles+=(b*k)+(k/2)\r\n m=m-k+(k/2)\r\nprint(int(bottles), towels)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "import sys\n\ndef findK(m):\n for k in range(m * 2):\n if (2 ** k) > m:\n if k == 0:\n return 1\n else:\n return 2 ** (k - 1)\n\ninputs = list(map(int, input().split()))\nn, b, p = inputs\nm = n\nbottles = 0\nwhile m > 1:\n k = findK(m)\n bottles += (b * k) + (k // 2)\n m = (k // 2) + (m - k)\n\nprint(bottles, n * p)\n", "n, b, p = [int(i) for i in input().strip().split()]\n\npw = [2 ** i for i in range(9)]\npw.reverse()\n\nm = n\ntb = 0\ntt = 0\n\nwhile m > 1:\n k = 1\n for i in pw:\n if i <= m:\n k = i\n break\n\n\n bt = b * k + k // 2\n\n tb += bt\n\n m = k // 2 + m - k\n\nprint(tb, p * n)\n\n\n\t\t \t \t \t\t \t\t\t \t\t\t\t\t\t\t \t", "def find_smallest_power_of_two(number):\n power = 1\n while power*2 <= number:\n power *= 2\n return power\n\n\nplayers, bottles_per_player, towels_per_player = map(int, input().split(\" \"))\n\nbottles_needed = 0\ntowels_needed = towels_per_player * players\n\n\nwhile players > 1:\n competing_players = find_smallest_power_of_two(players)\n bottles_needed += competing_players * bottles_per_player + competing_players//2\n players -= competing_players//2\n\nanswer = \" \".join([str(bottles_needed), str(towels_needed)])\n\nprint(answer)\n", "def Func():\r\n players, bottles, towels = map(int, input().split())\r\n totalBottles = 0\r\n totalTowels = players * towels\r\n while players > 1:\r\n for i in range(players, 0, -1):\r\n if 2 ** i <= players:\r\n roundmatches = 2 ** i // 2\r\n break\r\n players -= roundmatches\r\n totalBottles += (1 + bottles * 2) * roundmatches\r\n print(totalBottles, totalTowels)\r\nFunc()", "def f(l):\r\n n,b,p = l #500\r\n return [(n-1)*(b+b+1),n*p]\r\n\r\nl = list(map(int,input().split()))\r\nprint(*f(l))\r\n", "def s(m):\r\n\tk=1\r\n\twhile k<=m:\r\n\t\tk=k*2\r\n\treturn k//2\r\np=input()\r\np=p.split()\r\nn=int(p[0])\r\nb=int(p[1])\r\no=int(p[2])\r\nj=0\r\nh=n*o\r\nwhile n!=1:\r\n\ta=n\r\n\tn-=(s(n)/2)\r\n\tj+=s(a)*(2*b+1)//2\r\nprint(str(j)+' '+str(h))", "n,b,p=map(int,input().split())\r\nprint((n-1)*(1+b*2),n*p)", "n,b,p=map(int,input().split())\r\nprint((n-1)*(2*b+1),n*p)", "# -*- coding: utf-8 -*-\n\nfrom math import floor\n\nn_participants, bottles, towels = [int(x) for x in input().split(' ')]\n\ntotal_towels = towels * n_participants\ntotal_bottles = 0\n\nwhile n_participants > 1:\n bye = 0\n matchs = floor(n_participants / 2)\n\n if n_participants % 2:\n bye = 1\n\n total_bottles += matchs * bottles * 2 + matchs\n\n n_participants = matchs + bye\n\nprint(f\"{total_bottles} {total_towels}\")\n\n \t\t\t\t \t\t\t\t\t\t \t\t \t \t \t \t", "def garrafas_toalhas(n_participantes,b_garrafas,p_toalhas):\n n_toalhas = n_participantes*p_toalhas\n n_garrafas = (2*b_garrafas+1) * (n_participantes-1)\n return n_garrafas,n_toalhas\n\ndef solve():\n n_participantes,b_garrafas,p_toalhas = map(int,input().split())\n n_garrafas,n_toalhas = garrafas_toalhas(n_participantes,b_garrafas,p_toalhas)\n print(n_garrafas,n_toalhas)\n\nsolve()\n \t \t\t \t\t \t\t\t \t\t \t \t \t \t\t\t", "def check2p(n):\r\n i=0\r\n while(2**i<n):\r\n i+=1\r\n return i-1\r\ninp=input().split()\r\nn=int(inp[0])\r\nb=int(inp[1])\r\np=int(inp[2])\r\ntp=p*n\r\nmatches=0\r\nwhile(n>1):\r\n k=2**(check2p(n)-1)\r\n matches+=k\r\n n-=k\r\ntb=matches*(2*b+1)\r\nprint(f\"{int(tb)} {tp}\")\r\n", "arr = input()\narr = arr.split()\nplayers = int(arr[0])\nbottles = int(arr[1])\ntowels = int(arr[2])\n\nnumberTowels = towels*players\nbottlesGame = (2*bottles+1)\nbottlesTotal = 0\n\nwhile players != 1:\n bottlesTotal += (players//2)*bottlesGame\n players -= players//2\n\nprint(bottlesTotal, end=' ')\nprint(numberTowels)\n\n\t\t \t\t \t\t \t \t \t\t \t \t \t\t", "n, b, p = [int(p) for p in input().split()]\n# n = participantes\n# b = garrafas/bottles\n# p = toalhas\nbottlesPorRound = (b*2 + 1)*n\nroundFinalista = b*2 + 1\nprint(bottlesPorRound - roundFinalista, end=\" \")\nprint(n*p)\n \t \t \t\t\t\t \t\t \t\t \t\t \t\t \t \t\t\t", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n n, bottles, towels = IA()\r\n b = 0\r\n part = n \r\n while part > 1:\r\n if part%2==1:\r\n qual = 1\r\n part -= 1\r\n else:\r\n qual = 0 \r\n b += (bottles*part)\r\n b += part//2 \r\n part /= 2\r\n part += qual \r\n return O([int(b), towels*n])\r\n\r\nif __name__ == '__main__':\r\n print(main())", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Jun 28 10:54:09 2020\n\n@author: shailesh\n\"\"\"\nimport math\n\nn,b,p = [int(i) for i in input().split()]\nmatches_count = 0\ntowels = n*p\nwhile(n>1):\n power = int(math.log2(n))\n matches_count += power\n n = n - power\n\nbottles = matches_count*(2*b + 1)\nprint(bottles,towels)\n", "def next(x):\r\n k = 0\r\n while (x > 1):\r\n x //= 2\r\n k += 1\r\n return k\r\n\r\ndef st(x):\r\n k = 1\r\n for i in range(x):\r\n k *= 2\r\n return k\r\n\r\n\r\nn, b, p = map(int, input().split())\r\nans = 0\r\nll = n * p\r\nwhile(n != 1):\r\n k = st(next(n))\r\n n -= k\r\n n += (k // 2)\r\n ans += (k // 2) * 2 * b\r\n ans += (k // 2)\r\nprint(ans)\r\nprint(ll)\r\n\n# Wed Oct 07 2020 13:28:12 GMT+0300 (Москва, стандартное время)\n", "if __name__ == '__main__':\n # Ler a entrada\n str_input = input().split()\n n = int(str_input[0])\n b = int(str_input[1])\n p = int(str_input[2])\n # Podemos resolver esse problema se analizarmos o padrão\n # Para um número n de pessoas, cada um jogará (n-1) partidas,\n # afinal, ninguém joga consigo mesmo\n n_partidas = n-1\n # Para obter o número total de garrafas, somamos a quantidade\n # do juíz (igual ao número de partidas) com a quantidade de\n # garrafas para os dois jogadores (n_partidas * 2 * b)\n x = n_partidas + n_partidas * 2 * b\n # Por fim, cada participante recebe uma quantidade p de toalhas\n y = n*p\n # Exibir resultado\n print(str(x) + ' ' + str(y))\n \t \t\t\t\t \t\t \t\t\t\t \t \t\t\t\t\t\t \t\t", "import logging\r\nimport copy\r\nimport sys\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\n#def solve(firstLine):\r\ndef solve(firstLine):\r\n n, b, p = firstLine[0], firstLine[1],firstLine[2]\r\n\r\n sumB = 0\r\n sumP = n * p\r\n while n > 1 :\r\n k = 2\r\n while k * k < n:\r\n k *= k\r\n \r\n sumB += (b * k + (k//2))\r\n \r\n log(n,k,sumB, sumP)\r\n n = (k//2) + (n - k)\r\n\r\n \r\n print(sumB, sumP)\r\n return\r\n\r\ndef main():\r\n firstLine = input().split()\r\n firstLine = list(map(int, firstLine))\r\n \r\n #solve(firstLine)\r\n solve(firstLine)\r\n\r\ndef log(*message):\r\n logging.debug(message)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom bisect import bisect_right, bisect_left\nfrom fractions import Fraction as frac\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef calc(x):\n d_sum = sum(map(int,str(x)))\n return x*x + d_sum *x\n\ndef solution():\n n,d = map(int, input().split())\n str_n = list(str(n))\n\n ans = n\n end = len(str_n) - 1\n while end >= 0 and str_n[end] == \"9\":\n end -= 1\n\n for i in range(end)[::-1]:\n cur_val = int(str_n[i]) \n if cur_val != 0:\n length = len(str_n) - (i+1)\n\n nines = \"9\"*length\n new_str_n = \"\".join(str_n[:i]) + str(cur_val - 1) + nines\n new_n = int(new_str_n)\n if n - int(new_n) > d:\n break\n ans = new_n\n return print(ans)\n\n\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "n,p=map(int,input().split())\r\nd=n\r\nif p==0:\r\n print(n)\r\nelse:\r\n total=0\r\n for i in range(len(str(p))):\r\n l_d=d%10\r\n d=d//10\r\n if l_d!=9:\r\n sub=l_d+1\r\n d=d-1\r\n if total+(sub*pow(10,i))>p:\r\n break\r\n else:\r\n total=total+(sub*pow(10,i))\r\n print(n-total)", "z,l=input().split()\r\nl=int(l)\r\ns=[]\r\nfor k in z:\r\n s.append(int(k))\r\na=[0]\r\nans=0\r\np=0\r\nfor j in range(len(s)-1,0,-1):\r\n if(s[j]<9):\r\n ans+=(10+s[j]-9)*(10**p)\r\n a.append(ans)\r\n p+=1\r\n s[j-1]=s[j-1]-1\r\n else:\r\n ans += (s[j] - 9) * (10 ** p)\r\n a.append(ans)\r\n p += 1\r\n if l<=ans:\r\n break\r\nfor ll in range(len(a)-1,-1,-1):\r\n if(a[ll]<=l):\r\n print(int(z)-a[ll])\r\n break\r\n\r\n", "p,d=map(int,input().split())\r\nk=len(str(p))-1\r\nif p-(p%(10**k))-1+10**k==p:\r\n print(p)\r\nelse:\r\n for i in range(k,0,-1):\r\n t=p-(p%(10**i))-1\r\n if t>=(p-d) and t<=p:\r\n print(t)\r\n break\r\n else:\r\n print(p)", "\r\n\r\np,m=map(int,input().split())\r\nans=-1\r\nfor i in range(18):\r\n tail=0\r\n base=1\r\n for j in range(i):\r\n tail=tail*10+9\r\n base*=10\r\n front=p//base\r\n if(tail>p%base):\r\n front-=1\r\n if front<0:\r\n continue\r\n cur=front*base+tail\r\n if(cur>=p-m):\r\n ans=cur\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "beans = [19,\r\n 199,\r\n 1999,\r\n 19999,\r\n 199999,\r\n 1999999,\r\n 19999999,\r\n 199999999,\r\n 1999999999,\r\n 19999999999,\r\n 199999999999,\r\n 1999999999999,\r\n 19999999999999,\r\n 199999999999999,\r\n 1999999999999999,\r\n 19999999999999999,\r\n 199999999999999999,\r\n 1999999999999999999,\r\n 19999999999999999999,\r\n 29,\r\n 299,\r\n 2999,\r\n 29999,\r\n 299999,\r\n 2999999,\r\n 29999999,\r\n 299999999,\r\n 2999999999,\r\n 29999999999,\r\n 299999999999,\r\n 2999999999999,\r\n 29999999999999,\r\n 299999999999999,\r\n 2999999999999999,\r\n 29999999999999999,\r\n 299999999999999999,\r\n 2999999999999999999,\r\n 29999999999999999999,\r\n 39,\r\n 399,\r\n 3999,\r\n 39999,\r\n 399999,\r\n 3999999,\r\n 39999999,\r\n 399999999,\r\n 3999999999,\r\n 39999999999,\r\n 399999999999,\r\n 3999999999999,\r\n 39999999999999,\r\n 399999999999999,\r\n 3999999999999999,\r\n 39999999999999999,\r\n 399999999999999999,\r\n 3999999999999999999,\r\n 39999999999999999999,\r\n 49,\r\n 499,\r\n 4999,\r\n 49999,\r\n 499999,\r\n 4999999,\r\n 49999999,\r\n 499999999,\r\n 4999999999,\r\n 49999999999,\r\n 499999999999,\r\n 4999999999999,\r\n 49999999999999,\r\n 499999999999999,\r\n 4999999999999999,\r\n 49999999999999999,\r\n 499999999999999999,\r\n 4999999999999999999,\r\n 49999999999999999999,\r\n 59,\r\n 599,\r\n 5999,\r\n 59999,\r\n 599999,\r\n 5999999,\r\n 59999999,\r\n 599999999,\r\n 5999999999,\r\n 59999999999,\r\n 599999999999,\r\n 5999999999999,\r\n 59999999999999,\r\n 599999999999999,\r\n 5999999999999999,\r\n 59999999999999999,\r\n 599999999999999999,\r\n 5999999999999999999,\r\n 59999999999999999999,\r\n 69,\r\n 699,\r\n 6999,\r\n 69999,\r\n 699999,\r\n 6999999,\r\n 69999999,\r\n 699999999,\r\n 6999999999,\r\n 69999999999,\r\n 699999999999,\r\n 6999999999999,\r\n 69999999999999,\r\n 699999999999999,\r\n 6999999999999999,\r\n 69999999999999999,\r\n 699999999999999999,\r\n 6999999999999999999,\r\n 69999999999999999999,\r\n 79,\r\n 799,\r\n 7999,\r\n 79999,\r\n 799999,\r\n 7999999,\r\n 79999999,\r\n 799999999,\r\n 7999999999,\r\n 79999999999,\r\n 799999999999,\r\n 7999999999999,\r\n 79999999999999,\r\n 799999999999999,\r\n 7999999999999999,\r\n 79999999999999999,\r\n 799999999999999999,\r\n 7999999999999999999,\r\n 79999999999999999999,\r\n 89,\r\n 899,\r\n 8999,\r\n 89999,\r\n 899999,\r\n 8999999,\r\n 89999999,\r\n 899999999,\r\n 8999999999,\r\n 89999999999,\r\n 899999999999,\r\n 8999999999999,\r\n 89999999999999,\r\n 899999999999999,\r\n 8999999999999999,\r\n 89999999999999999,\r\n 899999999999999999,\r\n 8999999999999999999,\r\n 89999999999999999999,\r\n 99,\r\n 999,\r\n 9999,\r\n 99999,\r\n 999999,\r\n 9999999,\r\n 99999999,\r\n 999999999,\r\n 9999999999,\r\n 99999999999,\r\n 999999999999,\r\n 9999999999999,\r\n 99999999999999,\r\n 999999999999999,\r\n 9999999999999999,\r\n 99999999999999999,\r\n 999999999999999999,\r\n 9999999999999999999,\r\n 99999999999999999999]\r\n\r\n\r\na, b = [int(x) for x in input().split()]\r\ndif2 = a-b\r\nstuff = len(str(dif2))-1\r\nwhile dif2 <= a and stuff >= 0:\r\n prev = dif2\r\n dif2 = list(str(dif2))\r\n dif2[stuff] = \"9\"\r\n dif2 = int(\"\".join(dif2))\r\n stuff -= 1\r\ndif2 = prev\r\nprev = dif2\r\nwhile dif2 <= a:\r\n prev = dif2\r\n dif2 = list(str(dif2))\r\n if dif2[stuff+1] != \"9\":\r\n dif2[stuff+1] = str(int(dif2[stuff+1])+1)\r\n else:\r\n break\r\n dif2 = int(\"\".join(dif2))\r\ndif2 = prev\r\nfor beans2 in beans:\r\n if beans2 <= a and a-beans2 <= b:\r\n if str(beans2).count(\"9\") > str(dif2).count(\"9\"):\r\n dif2 = beans2\r\n if str(beans2).count(\"9\") == str(dif2).count(\"9\"):\r\n dif2 = max(dif2, beans2)\r\n \r\nprint(dif2)", "p,d=map(int,input().split())\r\np+=1\r\nans=p\r\ni=10\r\nwhile True:\r\n if p%i<=d:\r\n ans=p-p%i\r\n else:\r\n break\r\n i*=10\r\nprint(ans-1)\r\n", "n, d = map(int, input().split())\r\nl = len(str(n))\r\ns = str(n)\r\ni = 10\r\no=0\r\nwhile d>=0 or i<=n :\r\n r = n%i\r\n o = (r + 1)%i\r\n if d - o >=0:\r\n d -= o\r\n n -= o\r\n i *= 10\r\n else:\r\n break\r\nprint(n)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\np,d=(int(i) for i in input().split())\r\nprod=10\r\nans=-1\r\nfor i in range(20):\r\n if(p-(p%prod)!=0):\r\n k=p-(p%prod)-1\r\n if(p-k<=d):\r\n ans=k\r\n prod*=10\r\nif(ans==-1):\r\n ans=p\r\ns1=str(ans)\r\ns2=str(p)\r\nc1,c2=0,0\r\nfor i in range(len(s1)-1,-1,-1):\r\n if(s1[i]!='9'):\r\n break\r\n else:\r\n c1+=1\r\nfor i in range(len(s2)-1,-1,-1):\r\n if(s2[i]!='9'):\r\n break\r\n else:\r\n c2+=1\r\nif(c2>=c1):\r\n print(p)\r\nelse:\r\n print(ans)", "p,d=map(int,input().split())\r\ns=0\r\nif p<10:\r\n print(p)\r\nelse:\r\n i=10\r\n while i<=p:\r\n if (p%i)+1<=d and (p%i)+1!=i:\r\n s=(p%i)+1\r\n i=i*10\r\n else:\r\n i=i*10\r\n print(p-s)", "p,d=map(int,input().split())\r\np+=1\r\nans=p\r\ni=10\r\n \r\nwhile i<1000000000000000001:\r\n if p%i<=d:\r\n ans=p-p%i\r\n i*=10\r\nprint(ans-1)", "a = input()\na = a.split()\np = a[0]\nd = int(a[1])\nc = p[-1]\ni = 1\n\nif int(p)<=9:\n print(p)\n quit()\n\nwhile int(d) > int(c):\n c=p[-i:]\n i += 1\n\nif len(c)==1:\n print(int(p))\n quit()\n\ny = int(c[1:])\n\nw = 0\nfor i in range(1,len(p)+1):\n if p[-i] == '9':\n w += 1\n else:\n break\n\n\n\n\n\nif w>=str((int(p)-y-1)).count('9') :\n print(p)\n quit()\n\nprint(int(p)-y-1)\n\n\n\n\n\n\n", "#####\r\nfrom heapq import *\r\nfrom queue import *\r\nimport sys, math, bisect\r\nfrom collections import Counter, defaultdict, deque\r\nimport math\r\nfrom string import *\r\nfrom itertools import *\r\n\r\n#####\r\n# sys.setrecursionlimit(100000)\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\n####################\r\ndef FacMod(u):\r\n u = 1\r\n for i in range(2, u + 1):\r\n u *= i\r\n u %= MOD\r\n return u\r\n\r\n\r\ndef ProdMoD(arr, mod=MOD):\r\n o = 1\r\n for n in arr:\r\n o *= n\r\n o %= mod\r\n return o\r\n\r\n\r\ndef GreatestDivisor(number):\r\n for i in range(2, int(math.sqrt(number) + 1)):\r\n if number % i == 0:\r\n return number // i\r\n return 1\r\n\r\n\r\ndef is_prime(u):\r\n if u < 2:\r\n return False\r\n for i in range(2, int(u ** 0.5) + 1):\r\n if u % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef factorize(num):\r\n # We could enhance the code by using the previous value and continue on it instead of starting over again\r\n # this idea is kind similar to DP idea so that was a great one\r\n primes = pFactors(num, is_counter=True)\r\n o = [1]\r\n for pp, ct in primes.items():\r\n new_out = []\r\n for f in o:\r\n for i in range(1, ct + 1):\r\n new_out.append(f * pp ** i)\r\n o += new_out\r\n return sorted(o)\r\n\r\n\r\ndef pFactors(n, is_counter=0):\r\n # care one can't be converted into primes\r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.append(i)\r\n if n > 1:\r\n factors.append(n)\r\n\r\n if is_counter:\r\n return Counter(sorted(factors))\r\n return factors\r\n\r\n\r\n# Binary\r\ndef first_bigger(arr, num, isEqual, s=0, e=-1):\r\n if e == -1:\r\n e = len(arr)\r\n # First index which number is bigger than me\r\n if len(arr) == 0 or arr[-1] + isEqual <= num:\r\n return -1\r\n if isEqual:\r\n return bisect.bisect_left(arr, num, s, e)\r\n else:\r\n return bisect.bisect_right(arr, num, s, e)\r\n\r\n\r\ndef last_less(arr, num, isEqual, s=0, e=-1):\r\n if e == -1:\r\n e = len(arr)\r\n # Last index that I can reach in the sorted array (0 based index)\r\n if len(arr) == 0 or arr[0] >= num + isEqual:\r\n return -1\r\n if isEqual:\r\n return bisect.bisect_right(arr, num, s, e) - 1\r\n else:\r\n return bisect.bisect_left(arr, num, s, e) - 1\r\n\r\n\r\ndef find_range(a, mn, mx, isEqual, start, end):\r\n s = first_bigger(a, mn, isEqual, start, end)\r\n e = last_less(a, mx, isEqual, start, end)\r\n if -1 in (s, e):\r\n return -1, -1\r\n return s, e\r\n\r\n\r\ndef sumDigits(u):\r\n u = int(u)\r\n SM = 0\r\n while u:\r\n SM += u % 10\r\n u //= 10\r\n return SM\r\n\r\n\r\ndef CumSum(num):\r\n return (num * (num + 1)) // 2\r\n\r\n\r\n###################\r\n\r\n\r\nwt = lambda x: sys.stdout.write(str(x))\r\nwtl = lambda x: wt(str(x) + '\\n')\r\nYES = lambda: wtl(\"YES\")\r\nNO = lambda: wtl(\"NO\")\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nI = lambda: int(input())\r\nII = lambda: list(map(int, input().split()))\r\nIT = lambda: tuple(map(int, input().split()))\r\nIS = lambda: input()\r\nIIS = lambda: list(input())\r\nIISI = lambda: list(map(int, IIS()))\r\n\r\n\r\n#######################################################################\r\n\r\n\r\ndef solve():\r\n B = II()\r\n num, MX = B[0], B[1]\r\n A = list(map(int, str(num)))\r\n \r\n cnt = 0\r\n for i in range(len(A) - 1, -1, -1):\r\n if A[i] == 9:\r\n cnt += 1\r\n else:\r\n break\r\n\r\n cost = 0\r\n cnt2 = 0\r\n for i in range(len(A) - 1, -1, -1):\r\n if cost + 1 + A[i] * (pow(10, len(A) - i - 1)) > MX:\r\n break\r\n\r\n cost += A[i] * (pow(10, len(A) - i - 1))\r\n cnt2 += 1\r\n\r\n if cnt2 > cnt:\r\n print(num - (cost + 1))\r\n else:\r\n print(num)\r\n\r\n\r\nsolve()\r\n\r\n\"\"\"\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n", "import sys,math,fractions\r\n# sys.stdout=open('output.txt','w')\r\ninput=sys.stdin.readline\r\ndef Str()->str:return input()\r\ndef Int()->int:return int(input())\r\ndef Float()->float:return float(input())\r\ndef Ints()->map:return map(int,input().split())\r\ndef listInt()->list:return list(Ints())\r\ndef Floats()->map:return map(float,input().split())\r\ndef listFloat()->list:return list(Floats())\r\n\r\nn,t=Ints()\r\nn+=1\r\nr=1\r\nwhile n%r<=t:r*=10\r\nprint(n-n%(r//10)-1)", "p, d = map(int, input().split())\r\ns = str(p)\r\nc = 0\r\nfor i in range(len(s) - 1, -1, -1):\r\n\tif int(s[i]) != 9:\r\n\t\tbreak\r\n\telse:\r\n\t\tc += 1 \r\nlo, hi = 0, len(s) - 1\r\nans = 0\r\nwhile(lo <= hi):\r\n\tmid = lo + (hi - lo) // 2\r\n\tif int(s[mid:]) + 1 <= d:\r\n\t\thi = mid - 1\r\n\t\tans = mid \r\n\telse:\r\n\t\tlo = mid + 1 \r\nx = p - int(s[ans:]) - 1\r\n\r\nif x < 0:\r\n\tprint(p)\r\nelse:\r\n\tss = str(x)\r\n\tcnt = 0 \r\n\tfor i in range(len(ss) - 1, -1, -1):\r\n\t\tif(int(ss[i]) != 9):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tcnt += 1 \r\n\tif(c >= cnt):\r\n\t\tprint(p)\r\n\telse:\r\n\t\tprint(x)\r\n", "P,D = input().split()\r\nD = int(D)\r\nP0 = int(P)\r\nbest = P0\r\n\r\ndef t9(x):\r\n i = 1\r\n if x.count('9') == len(x):\r\n return len(x)\r\n while x[-i] == '9':\r\n i += 1\r\n i -= 1\r\n return i\r\n\r\nfor keep in range(len(P)-1,0,-1):\r\n test = str(int(P[:keep])-1) + '9'*(len(P)-keep)\r\n #print(test)\r\n if int(test) >= P0 - D:\r\n if t9(str(test)) > t9(str(best)):\r\n best = test\r\nprint(int(best))\r\n", "import math\r\n\r\np, d = map(int, input().split())\r\ndiff = 0\r\nno = 0\r\nk = 1\r\nx = 0\r\nans = p\r\n\r\nwhile True:\r\n no = p\r\n x = pow(10, k)\r\n no = p - p % x - 1\r\n diff = p - no\r\n k += 1\r\n if diff <= d:\r\n if no % x > p % x:\r\n ans = no\r\n else:\r\n break\r\n\r\nprint(ans)", "p, d = [int(x) for x in input().split()]\n\npower = 0\nwhile True:\n div = 10**power\n digit = (p // div) % 10\n diff = ((digit + 1) % 10) * div \n\n if diff > d:\n break\n if div > p:\n break\n else:\n p -= diff\n d -= diff\n power += 1\n\nprint(p)\n", "n, d = input().split()\r\nn = int(n)\r\nd = int(d)\r\nleast = n - d\r\nans = n\r\nfor i in range(len(str(n)) - 1, -1, -1):\r\n if str(n)[i] == '9':\r\n continue\r\n n = list(str(n))\r\n n[i] = '9'\r\n n = int(''.join(n))\r\n j = i - 1\r\n while j >= 0 and str(n)[j] == '0':\r\n n = list(str(n))\r\n n[j] = '9'\r\n n = int(''.join(n))\r\n j -= 1\r\n if j >= 0:\r\n n = list(str(n))\r\n n[j] = str(int(n[j]) - 1)\r\n n = int(''.join(n))\r\n if n >= least and n < ans:\r\n ans = n\r\n\r\nprint(ans)\r\n", "p, d = map(int,input().split())\r\ni, dis = 1, 0\r\nwhile p%(10**i) + 1 <= d :\r\n if (p%(10**i) + 1)%10**i == 0 :\r\n i += 1\r\n continue\r\n dis = p%(10**i) + 1\r\n i += 1\r\nprint(p-dis)", "p,d=map(int,input().split())\r\np+=1;i=10\r\nc=p\r\nwhile True: \r\n if p%i>d:break\r\n c=p-p%i\r\n i*=10\r\nprint(c-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\np, d = input()[:-1].split()\r\n\r\np1 = int(p)\r\np = p[::-1]\r\nd = int(d)\r\nn = len(p)\r\n\r\ns = 0\r\nq = p1\r\nfor i in range(1, n):\r\n a = int(p[:i][::-1])\r\n x = int(i*'9')\r\n if a == x:\r\n s = 0\r\n else:\r\n s = a+1\r\n\r\n if s > d:\r\n break\r\n q = p1 - s\r\n\r\nprint(q)", "import sys\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n, m = (int(i) for i in read().split())\r\n min_value = n - m\r\n best_result = n\r\n k = 1\r\n while True:\r\n # Remove the last k digit, so that it becomes ...0 then decrease by 1, so that all those values become 9\r\n # Note that we do it based on the input n, not on whatever the last computed value is. The reason why is that\r\n # we want to keep the biggest number with the most 9's. But if you take the current value instead, you will only\r\n # consider the result of removing the last k digits from a SMALLER number than the input size, which would\r\n # be strictly < removing k digits from the input size directly\r\n curr_value = n - (n % 10 ** k) - 1\r\n # Check that the current value does not exceed the allowed min_value\r\n if curr_value >= min_value:\r\n # If the number is valid, check if it is a better choice\r\n # To do this, just compare the last k digits, whichever has the most 9's will be the\r\n # \"bigger\" number\r\n if curr_value % 10 ** k > n % 10 ** k:\r\n best_result = curr_value\r\n else:\r\n break\r\n\r\n k += 1\r\n\r\n print(best_result)\r\n\r\nif __name__ == '__main__':\r\n main()", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom bisect import bisect_right, bisect_left\nfrom fractions import Fraction as frac\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef calc(x):\n d_sum = sum(map(int,str(x)))\n return x*x + d_sum *x\n\ndef solution():\n n,d = map(int, input().split())\n\n n += 1\n k = 1\n while 1:\n if n%k > d:\n break\n k *= 10\n k //= 10\n print(n - n%k - 1)\n\n # add one more and decrease by one\n\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "\r\n\r\n\r\nn,d=map(int,input().split())\r\nans=n\r\nl=len(str(n))\r\nfor nine in range(0,l):\r\n m=int(str(n)[:l-nine]+\"9\"*nine)\r\n while m>n:\r\n m-=10**nine\r\n if n-m<=d:\r\n ans=m\r\n \r\n \r\nprint(ans)" ]

[ "import sys\nfrom math import sqrt, inf\nfrom functools import cache\n\n\nreadline = sys.stdin.readline\n\nplanets = []\n\ndef read():\n N = int(readline().strip())\n for _ in range(N):\n planets.append(tuple([int(w) for w in readline().split()]))\n\ndef solve() -> float:\n @cache\n def dist(a: list, b: list) ->float:\n v = 0\n for x1, x2 in zip(a, b):\n v += (x1 - x2) ** 2\n return sqrt(v)\n\n base = planets[0][:]\n planets.sort(key = lambda x: dist(base, x))\n\n d1, d2, d3 = 0.0, 0.0, 0.0\n result = inf\n for i in range(1, len(planets)):\n d1 = dist(base, planets[i])\n if d1 * 2 > result:\n break\n for j in range(i + 1, len(planets)):\n d2 = dist(base, planets[j])\n d3 = dist(planets[j], planets[i])\n if d1 + d2 > result:\n break\n # print(d1, d2, d3, d1 + d2 + d3)\n if abs(d1 - d2 - d3) < 1e-6 or abs(d2 - d1 - d3) < 1e-6:\n return 0.0\n result = min(result, d1 + d2 + d3)\n return result\n\nread()\nprint(solve()/2)", "import math\r\n\r\ndef dist(x, y):\r\n return math.sqrt(((y[0] - x[0]) ** 2) + ((y[1] - x[1]) ** 2) + ((y[2] - x[2]) ** 2))\r\n\r\nn = int(input())\r\ndist_from_origin = [0]\r\ncoord = [list(map(int, input().split()))]\r\n\r\nfor _ in range(n-1):\r\n coord.append(list(map(int, input().split())))\r\n dist_from_origin.append(dist(coord[0], coord[-1]))\r\n\r\nres = 200000000\r\nfor i in range(1, n):\r\n for j in range(i+1, n):\r\n time = (dist(coord[i], coord[j]) + dist_from_origin[i] + dist_from_origin[j]) / 2\r\n if time < res:\r\n res = time\r\n\r\nprint(res)", "import math\r\n\r\n\r\ndef r(c1, c2):\r\n return math.sqrt((c1[0] - c2[0]) ** 2 + (c1[1] - c2[1]) ** 2 + (c1[2] - c2[2]) ** 2)\r\n\r\n\r\nn = int(input())\r\n\r\ncords = []\r\n\r\nfor i in range(n):\r\n x, y, z = map(int, input().split())\r\n cords.append([x, y, z])\r\n\r\nres = 10 ** 10\r\n\r\nfor p1 in range(1, n):\r\n for p2 in range(p1 + 1, n):\r\n r1 = r(cords[0], cords[p1])\r\n r2 = r(cords[0], cords[p2])\r\n r12 = r(cords[p1], cords[p2])\r\n v = max(r1, r2) + (r12 - abs(r1 - r2)) / 2\r\n res = min(res, v)\r\n\r\nprint(\"%.12f\" % res)\r\n" ]

[ "n, max_val, reg = map(int, input().split())\r\npow_vals = [0] * (n + 1)\r\ndmg_vals = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n pow_vals[i], dmg_vals[i] = map(int, input().split())\r\nused = [False] * (n + 1)\r\ncur = max_val\r\ntot = 0\r\nans = -1\r\nm = 0\r\na = [0] * (n + 1)\r\nb = [0] * (n + 1)\r\nfor it in range(10001):\r\n cur = cur - tot + reg\r\n if cur <= 0:\r\n ans = it\r\n break\r\n if cur > max_val:\r\n cur = max_val\r\n mn = 0\r\n km = 0\r\n for i in range(1, n + 1):\r\n if not used[i] and cur * 100 <= pow_vals[i] * max_val:\r\n if dmg_vals[i] > mn:\r\n mn = dmg_vals[i]\r\n km = i\r\n if km > 0:\r\n m += 1\r\n a[m] = it\r\n b[m] = km\r\n tot += mn\r\n used[km] = True\r\nif ans == -1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(ans, m)\r\n for i in range(1, m + 1):\r\n print(a[i], b[i])# 1691499045.4562871", "import itertools\nimport math\n \nN, x, y = [int(n) for n in input().split()]\npills = []\nfor i in range(N):\n pills.append(tuple(int(n) for n in input().split()) + (i+1,))\npills.sort()\n \nrques = x\nqauto = 0\ntime = 0\nused = []\npossible = set()\nwhile rques > 0:\n while len(pills) > 0 and pills[-1][0] >= 100*rques/x:\n possible.add(pills.pop()[1:])\n if len(possible) > 0:\n best = max(possible)\n used.append((best, time))\n possible.remove(best)\n qauto += best[0]\n elif qauto <= y:\n print('NO')\n break\n rques = min(rques+y-qauto, x)\n time += 1\nelse:\n print('YES')\n print(time, len(used))\n for scroll in used:\n print(scroll[1], scroll[0][1])" ]

[ "n , m = map(int,input().split())\r\narr = []\r\n\r\nfor i in range(n):\r\n arr.append(input())\r\nres = list(zip(*arr)) \r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i].count(arr[i][j])==1:\r\n if res[j].count(arr[i][j])==1:\r\n print(arr[i][j],end=\"\")\r\n \r\n ", "from collections import *\r\nn, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n arr.append(input())\r\ntransed = defaultdict(str)\r\n\r\nfor row in arr:\r\n for ind, ltr in enumerate(row):\r\n transed[ind] += ltr\r\ntrs = []\r\n\r\nfor key in transed.keys():\r\n trs.append(transed[key])\r\n\r\nrowD = defaultdict(set)\r\ncolD = defaultdict(set)\r\n\r\nfor ind, row in enumerate(arr):\r\n counted = Counter(row)\r\n \r\n for i in counted:\r\n if counted[i] > 1:\r\n rowD[ind].add(i)\r\n\r\nfor ind, col in enumerate(trs):\r\n counted = Counter(col)\r\n \r\n for i in counted:\r\n if counted[i] > 1:\r\n colD[ind].add(i)\r\n \r\nans = []\r\n\r\nfor ind, row in enumerate(arr):\r\n for index, char in enumerate(row):\r\n if char not in rowD[ind] and char not in colD[index]:\r\n ans.append(char)\r\n \r\nprint(\"\".join(ans))\r\n ", "import copy\r\n\r\nn, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n\tarr.append([i for i in input()])\r\n\r\nreal = copy.deepcopy(arr)\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tletter = arr[i][j]\r\n\t\tif letter == \"\":\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tfor x in range(i+1, n):\r\n\t\t\t\tif arr[x][j] == letter:\r\n\t\t\t\t\treal[x][j] = \"\"\r\n\t\t\t\t\treal[i][j] = \"\"\r\n\t\t\tfor y in range(j+1, m):\r\n\t\t\t\tif arr[i][y] == letter:\r\n\t\t\t\t\treal[i][y] = \"\"\r\n\t\t\t\t\treal[i][j] = \"\"\r\ns = \"\"\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\ts += real[i][j]\r\nprint(s)", "temp = list(map(int, input().split()))\r\nn = temp[0]\r\nm = temp[1]\r\n\r\ntable = []\r\nfor _ in range(n):\r\n table.append(list(input()))\r\n \r\nrotated_table = []\r\nfor col in range(m):\r\n temp = []\r\n for row in range(n):\r\n temp.append(table[row][col])\r\n \r\n rotated_table.append(temp)\r\n \r\nans = ''\r\n\r\nfor row in range(n):\r\n for col in range(m):\r\n if table[row].count(table[row][col]) == 1 and rotated_table[col].count(table[row][col]) == 1:\r\n ans += table[row][col]\r\n \r\nprint(ans)\r\n \r\n", "def main():\r\n n, m = map(int, input().split())\r\n grid = [list(input()) for _ in range(n)]\r\n\r\n res = ''\r\n for r in range(n):\r\n for c in range(m):\r\n cur = grid[r][c]\r\n found = False\r\n for i in range(m):\r\n if i != c and grid[r][i] == cur:\r\n found = True\r\n\r\n for i in range(n):\r\n if i != r and grid[i][c] == cur:\r\n found = True\r\n\r\n if not found:\r\n res += cur\r\n\r\n print(res)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=list(map(int,input().split()))\r\na=[]\r\nsum=\"\"\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n u=0\r\n if a[i].count(a[i][j])>=2:\r\n u=1\r\n else:\r\n for f in range(n):\r\n if f!=i and a[i][j]==a[f][j]:\r\n u=1\r\n break\r\n if u==0:\r\n sum+=a[i][j]\r\nprint(sum)\r\n", "#African Crossword\r\n\r\nn, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\n\r\nans = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n count = 0\r\n for jj in range(m):\r\n if a[i][j] == a[i][jj]:\r\n count += 1\r\n\r\n for ii in range(n):\r\n if a[i][j] == a[ii][j]:\r\n count += 1\r\n\r\n if count == 2:\r\n ans += a[i][j]\r\n\r\nprint(ans)", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\n\r\ndic_row = defaultdict(int)\r\ndic_column = defaultdict(int)\r\n\r\nanswer = \"\"\r\nmatrix = []\r\n\r\nfor row in range(n):\r\n matrix.append(list(input()))\r\n\r\nfor row in range(n):\r\n for column in range(m):\r\n dic_row[str(row) + matrix[row][column]] +=1\r\n dic_column[str(column) + matrix[row][column]] +=1\r\n\r\nfor row in range(n):\r\n for column in range(m):\r\n if dic_row[str(row) + matrix[row][column]]<2 and dic_column[str(column) + matrix[row][column]]<2:\r\n answer += matrix[row][column]\r\nprint(answer)", "from collections import Counter\r\nnum_lines, num_letters = list(map(int, input().split()))\r\n\r\nmatrix = []\r\n# taking input\r\nfor row in range(num_lines):\r\n matrix.append(input())\r\n \r\ntranspose_matrix = [ [''] * num_lines for _ in range(num_letters)]\r\nfor row in range(num_lines):\r\n for col in range(num_letters):\r\n transpose_matrix[col][row] = matrix[row][col]\r\n \r\nsecret_word = [] \r\n# check rows for non-duplicates\r\nfor row in range(num_lines):\r\n for col in range(num_letters):\r\n \r\n #check if duplicate in row\r\n counter = Counter(matrix[row])\r\n if counter[matrix[row][col]] != 1:\r\n continue\r\n #check if duplicate in col\r\n counter = Counter(transpose_matrix[col])\r\n if counter[transpose_matrix[col][row]] != 1:\r\n continue\r\n \r\n secret_word.append(matrix[row][col])\r\n \r\nprint(''.join(secret_word))\r\n \r\n \r\n \r\n \r\n \r\n ", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\n\r\ncols = defaultdict(list)\r\nrows = defaultdict(list)\r\ngrid = []\r\nanswer = \"\"\r\n\r\nfor _ in range(n):\r\n row = list(input().strip())\r\n grid.append(row)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n rows[i + 1].append(grid[i][j])\r\n cols[j + 1].append(grid[i][j])\r\n\r\nfor row in range(n):\r\n for col in range(m):\r\n current = rows[row + 1] + cols[col + 1]\r\n find = grid[row][col]\r\n x = current.count(find)\r\n if x == 2:\r\n answer += find\r\nprint(answer)\r\n", "#!/usr/bin/python3\n\nn, m = map(int, input().split())\nstrs = [input() for i in range(n)]\nnr = [dict() for i in range(n)]\nnc = [dict() for i in range(m)]\n\nfor i in range(n):\n for j in range(m):\n if strs[i][j] not in nr[i]:\n nr[i][strs[i][j]] = 1\n else:\n nr[i][strs[i][j]] += 1\n if strs[i][j] not in nc[j]:\n nc[j][strs[i][j]] = 1\n else:\n nc[j][strs[i][j]] += 1\n\nans = []\nfor i in range(n):\n for j in range(m):\n if nr[i][strs[i][j]] == 1 and nc[j][strs[i][j]] == 1:\n ans.append(strs[i][j])\nprint(\"\".join(ans))\n", "n, m = list(map(int,input().split()))\r\nres = []\r\nfor i in range(n):\r\n res.append(input().strip())\r\nans = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n\r\n check = True\r\n\r\n for k in range(n):\r\n if k != i and res[i][j] == res[k][j]:\r\n check = False\r\n\r\n for k in range(m):\r\n if k != j and res[i][j] == res[i][k]:\r\n check = False\r\n if check:\r\n ans += res[i][j]\r\nprint(ans)", "\"\"\"\nhttps://codeforces.com/problemset/problem/90/B\n\"\"\"\n\nn, m = [int(x) for x in input().split()]\ngrid = dict()\nfor i in range(n):\n ligne = list(input())\n for j, l in enumerate(ligne):\n grid[(i, j)] = [l, 1]\n\nfor i in range(n):\n for j in range(m - 1):\n for k in range(j + 1, m):\n if grid[(i, j)][0] == grid[(i, k)][0]:\n grid[(i, j)][1] = 0\n grid[(i, k)][1] = 0\nfor j in range(m):\n for i in range(n - 1):\n for k in range(i + 1, n):\n if grid[(i, j)][0] == grid[(k, j)][0]:\n grid[(i, j)][1] = 0\n grid[(k, j)][1] = 0\n\n\nfor i in range(n):\n for j in range(m):\n print(grid[(i, j)][0] if grid[(i, j)][1] == 1 else \"\", end=\"\")\nprint()\n", "n,m = list(map(int,input().split()))\n\nmatr= [['' for j in range(m)] for i in range(n)]\n\nrow_info={}\ncol_info={}\nfor i in range(n):\n row_info[i]={}\n cur_row=input()\n for j in range(m):\n matr[i][j]=cur_row[j]\n if(j not in col_info):\n col_info[j]={}\n row_info[i][cur_row[j]]=row_info[i].get(cur_row[j],0)+1\n col_info[j][cur_row[j]]=col_info[j].get(cur_row[j],0)+1\n\nfinal_str=[]\nfor i in range(n):\n for j in range(m):\n if(row_info[i][matr[i][j]] >1 or col_info[j][matr[i][j]]>1):\n continue\n else:\n final_str.append(matr[i][j])\n\nprint(''.join(final_str))", "from collections import Counter\r\n\r\nm, n = list(map(int, input().split()))\r\n\r\nmat = []\r\nfor _ in range(m):\r\n mat.append(input())\r\n\r\nrow_count_map = {}\r\ncol_count_map = {}\r\nfor i, row in enumerate(mat):\r\n row_count_map[i] = Counter(row)\r\n\r\nfor j in range(n):\r\n count = {}\r\n i = 0\r\n for i in range(m):\r\n cur = mat[i][j]\r\n count[cur] = count.get(cur, 0) + 1\r\n col_count_map[j] = count\r\n\r\ndecoded = []\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n cur_char = mat[i][j]\r\n if col_count_map[j][cur_char] == row_count_map[i][cur_char] == 1:\r\n decoded.append(cur_char)\r\nprint(''.join(decoded)) ", "from collections import defaultdict\r\nn,m = map(int,input().split())\r\nrow = defaultdict(set)\r\ncol = defaultdict(set)\r\nremovedrow = defaultdict(set)\r\nremovedcol = defaultdict(set)\r\nmatrix = []\r\nfor i in range(n):\r\n temp = input()\r\n temp2 = [i for i in temp]\r\n matrix.append(temp2)\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = matrix[i][j]\r\n if letter in row and (i in row[letter] or j in col[letter]):\r\n matrix[i][j] = \"0\"\r\n removedrow[letter].add(i)\r\n removedcol[letter].add(j)\r\n\r\n row[letter].add(i)\r\n col[letter].add(j)\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = matrix[i][j]\r\n if letter in removedrow and (i in removedrow[letter] or j in removedcol[letter]):\r\n matrix[i][j] = \"0\"\r\n\r\nanswer = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] != \"0\":\r\n answer += matrix[i][j]\r\n\r\nprint(answer)\r\n\r\n\r\n", "import re\n\n\ndef mark(char, s):\n count = 0\n for c in s:\n if c == char:\n count += 1\n if count > 1:\n return True\n return False\n\n\n[n, m], rows, cols = [int(i) for i in input().split()], [], []\nfor i in range(n):\n rows.append(input())\nfor row in rows:\n for i, char in enumerate(row):\n if i >= len(cols):\n cols.append(char)\n else:\n cols[i] += char\n\nrows_copy, cols_copy = list(rows), list(cols)\nfor i, row in enumerate(rows_copy):\n for j, char in enumerate(row):\n if mark(char, row) or mark(char, cols_copy[j]):\n rows[i] = re.sub(char, '_', rows[i])\n cols[j] = re.sub(char, '_', cols[j])\nans = []\nfor row in rows:\n for i, c in enumerate(row):\n if c != '_' and c in cols[i]:\n ans.append(c)\nprint(''.join([str(x) for x in ans]))\n", "n, m = map(int, input().split())\r\ngrid = []\r\n\r\nfor _ in range(n):\r\n temp =list( input())\r\n grid.append(temp)\r\n\r\ncrossed = set()\r\nfor row in range(n):\r\n for col in range(m):\r\n curr = grid[row][col]\r\n\r\n for c in range(m):\r\n if grid[row][c] == curr and c != col:\r\n crossed.add((row, c))\r\n \r\n for r in range(n):\r\n if grid[r][col] == curr and r != row:\r\n crossed.add((r,col))\r\n\r\n\r\nfor r, c in crossed:\r\n grid[r][c] = 0\r\n\r\nfor r in range(n):\r\n for c in range(m):\r\n if grid[r][c] != 0:\r\n print(grid[r][c], end=\"\")\r\n", "from collections import defaultdict\r\n[n,m] = list(map(int,input().split()))\r\nresult = []\r\nanswer = \"\"\r\nresult = []\r\nfor i in range(n):\r\n line = list(input())\r\n result.append(line)\r\n \r\n\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n elem = result[i][j]\r\n found = False\r\n # check row:\r\n for k in range(m):\r\n \r\n if elem == result[i][k] and k != j:\r\n \r\n found = True\r\n break\r\n if not found:\r\n \r\n # check column\r\n for k in range(n):\r\n \r\n if elem == result[k][j] and k != i:\r\n found = True\r\n break\r\n if not found:\r\n answer += elem\r\n \r\nprint(answer)\r\n\r\n\r\n \r\n ", "nums = input()\r\nnums = nums.split()\r\nn = int(nums[0])\r\nm = int(nums[1])\r\nchars_list = []\r\ncolumns_list = []\r\nfor i in range(n):\r\n chars = input()\r\n list_input = [x for x in chars]\r\n columns_list.append(list_input)\r\n for char in chars:\r\n chars_list.append(char)\r\nlist_mark = [\"1\" for x in range(m)]\r\nflag = 0\r\nwhile flag < m:\r\n count_list = []\r\n list_row = chars_list[flag::m]\r\n # print(list_row)\r\n for i in list_row:\r\n if list_row.count(i)>1 and i not in count_list:\r\n # list_mark[flag] = str(i)\r\n # list_mark.append(i)\r\n count_list.append(i)\r\n if count_list:\r\n list_mark[flag] = count_list \r\n flag += 1\r\n# print(list_mark)\r\nfor column in columns_list:\r\n count_list = []\r\n for char in column:\r\n if column.count(char)>1 or char in count_list:\r\n column[column.index(char)] = 0\r\n count_list.append(char)\r\n# print(columns_list) \r\nfor column in columns_list:\r\n for index in range(m):\r\n if type(list_mark[index]) == str:\r\n if column[index] == list_mark[index]:\r\n column[index] = 0\r\n if type(list_mark[index]) == list:\r\n if column[index] in list_mark[index]:\r\n column[index] = 0\r\n# print(columns_list)\r\nfor column in columns_list:\r\n for char in column:\r\n if char != 0:\r\n print(char,end='')", "n,m = map(int,input().split())\r\ns,f = [input().strip()for _ in range(n)],''\r\nfor i in range(n):\r\n for j in range(m):\r\n a = s[i][j]\r\n if s[i].count(a) == 1 and not [1 for k in range(n)if s[k][j] == a and i != k]:\r\n f += a\r\nprint(f)", "n, m = map(int, input().split())\r\ng = [input() for i in range(n)]\r\nrc = [[0] * 26 for i in range(n)]\r\ncc = [[0] * 26 for j in range(m)]\r\nfor i in range(n):\r\n for j, ch in enumerate(g[i]):\r\n k = ord(ch) - ord('a')\r\n rc[i][k] += 1\r\n cc[j][k] += 1\r\nv = []\r\nfor i in range(n):\r\n for j, ch in enumerate(g[i]):\r\n k = ord(ch) - ord('a')\r\n if rc[i][k] == 1 and cc[j][k] == 1:\r\n v.append(ch)\r\nprint(''.join(v))", "from collections import defaultdict\r\nrow, col = map(int,input().split())\r\n\r\nmatrix = []\r\n\r\nfor r in range(row):\r\n x = input()\r\n \r\n matrix.append(x)\r\nrows =[]\r\nfor r in range(row):\r\n compare = defaultdict(int)\r\n for c in range(col):\r\n if compare[matrix[r][c]]>0:\r\n rows.append((r,matrix[r][c]))\r\n else:\r\n compare[matrix[r][c]] +=1\r\ncolumn = []\r\nfor c in range(col):\r\n compare = defaultdict(int)\r\n for r in range(row):\r\n if compare[matrix[r][c]]>0:\r\n column.append((c,matrix[r][c]))\r\n else:\r\n compare[matrix[r][c]] +=1\r\n\r\nfor r , val in rows:\r\n # print(r,val)\r\n matrix[r]=matrix[r].replace(val,\"0\")\r\n # print(matrix[r])\r\n\r\n\r\n\r\n\r\nfor r in range(row):\r\n for c in range(col):\r\n if (c , matrix[r][c]) in column:\r\n matrix[r]=matrix[r].replace(matrix[r][c],\"0\",1)\r\n\r\nans = \"\"\r\n\r\nfor r in range(row):\r\n for c in range(col):\r\n if matrix[r][c]!= \"0\":\r\n ans += matrix[r][c]\r\nprint(ans)\r\n\r\n\r\n\r\n ", "from collections import defaultdict\r\ndicRow = defaultdict(lambda:defaultdict(int))\r\ndicCol = defaultdict(lambda:defaultdict(int))\r\n\r\n\r\nr, c = map(int, input().split())\r\narr = [list(input()) for i in range(r)]\r\nans = []\r\n\r\nfor row in range(r):\r\n for col in range(c):\r\n \r\n dicRow[row][arr[row][col]] += 1\r\n dicCol[col][arr[row][col]] += 1\r\n \r\nfor row in range(r):\r\n for col in range(c):\r\n if dicRow[row][arr[row][col]] == 1 and dicCol[col][arr[row][col]] == 1:\r\n ans.append(arr[row][col])\r\n \r\nprint(''.join(ans))", "if __name__ == '__main__':\r\n\tn,m = map(int, input().split())\r\n\tl = []\r\n\tfor i in range (n):\r\n\t\ta = input()\r\n\t\ts = []\r\n\t\tfor i in a:\r\n\t\t\ts.append(i)\r\n\t\tl.append(s)\r\n\tM = []\r\n\tfor i in range (n):\r\n\t\ta = []\r\n\t\tfor j in range (m):\r\n\t\t\ts = l[i][j]\r\n\t\t\trflag = 1\r\n\t\t\tcflag = 1\r\n\t\t\tfor k in range (m):\r\n\t\t\t\tif k != j and l[i][k]== s:\r\n\t\t\t\t\trflag = 0\r\n\t\t\t\t\tbreak\r\n\t\t\tfor k in range (n):\r\n\t\t\t\tif k!=i and l[k][j]==s:\r\n\t\t\t\t\tcflag=0\r\n\t\t\t\t\tbreak\r\n\t\t\tif cflag==0 or rflag==0:\r\n\t\t\t\ta.append('X')\r\n\t\t\telse:\r\n\t\t\t\ta.append(l[i][j])\r\n\t\tM.append(a)\r\n\tans = ''\r\n\tfor i in range (n):\r\n\t\tfor j in range (m):\r\n\t\t\tif M[i][j]!='X':\r\n\t\t\t\tans = ans+M[i][j]\r\n\tprint(ans)", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\n\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append(list(input()))\r\n\r\nrows = [defaultdict(int) for i in range(n)]\r\ncols = [defaultdict(int) for i in range(m)]\r\nfor i in range(n):\r\n for j in range(m):\r\n rows[i][grid[i][j]] += 1\r\n cols[j][grid[i][j]] += 1\r\n\r\nresult = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if rows[i][grid[i][j]] == 1 and cols[j][grid[i][j]] == 1:\r\n result.append(grid[i][j])\r\n\r\nprint(''.join(result))\r\n", "def AfricanCrossword(matrix):\r\n from collections import defaultdict\r\n row_freq=[]\r\n col_freq=[]\r\n ans=[]\r\n for i in range(len(matrix)):\r\n dicti=defaultdict(int)\r\n for j in range(len(matrix[i])):\r\n dicti[matrix[i][j]]+=1\r\n row_freq.append(dicti)\r\n for i in range(len(matrix[0])):\r\n dicti2=defaultdict(int)\r\n for j in range(len(matrix)):\r\n dicti2[matrix[j][i]]+=1\r\n \r\n col_freq.append(dicti2)\r\n for i in range(len(matrix)):\r\n for j in range(len(matrix[0])):\r\n if row_freq[i][matrix[i][j]]==1 and col_freq[j][matrix[i][j]]==1:\r\n ans.append(matrix[i][j])\r\n return ans\r\nn,m=map(int,input().split())\r\nmat=[[0 for i in range(m)]for i in range(n)]\r\nfor i in range(n):\r\n line=input()\r\n for j in range(len(line)):\r\n mat[i][j]=line[j]\r\nval=AfricanCrossword(mat)\r\nprint(\"\".join(val))", "import copy\r\nmatrix = []\r\nn, m = map(int, input().split())\r\n\r\n\r\nfor i in range(n):\r\n arr = list(input())\r\n matrix.append(arr)\r\n \r\nm2 = copy.deepcopy(matrix)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n \r\n a = matrix[i][j]\r\n changed = False\r\n for k in range(i+1, n):\r\n if matrix[k][j] == a:\r\n m2[k][j] = 0\r\n changed = True\r\n \r\n for l in range(j+1, m):\r\n if matrix[i][l] == a:\r\n m2[i][l] = 0\r\n changed = True\r\n \r\n if changed:\r\n m2[i][j] = 0 \r\n \r\n\r\nans = \"\"\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if m2[i][j] != 0:\r\n ans += m2[i][j]\r\nprint(ans)", "n, m = map(int, input().split())\r\ngrid = []\r\nmarked = [[True for _ in range(m)] for __ in range(n)]\r\n\r\nfor i in range(n):\r\n line = list(input())\r\n grid.append(line)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n for k in range(j+1, m):\r\n if grid[i][k] == grid[i][j]:\r\n marked[i][k] = False;\r\n marked[i][j] = False;\r\nfor j in range(m):\r\n for i in range(n):\r\n for k in range(i+1, n):\r\n if grid[k][j] == grid[i][j]:\r\n marked[k][j] = False;\r\n marked[i][j] = False;\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if marked[i][j]:\r\n print(grid[i][j], end=\"\")\r\n\r\n\r\n", "#African CrossWord: http://codeforces.com/problemset/problem/90/B\ndef duplicate_in_row(row, char):\n count = 0\n for e in row:\n if e == char:\n count += 1\n\n if count > 1:\n return True \n else:\n return False \n\n\nif __name__ == '__main__':\n n, m = map(int,input().split())\n grid1 = []\n for _ in range(n):\n grid1.append(list(input()))\n \n # print(grid1)\n\n grid2 = []\n\n for j in range(m):\n row = []\n for i in range(n):\n row.append(grid1[i][j]) \n grid2.append(row)\n\n # print(grid2)\n\n result = ''\n for i in range(n):\n temp_row = ''\n for j in range(m):\n if (not duplicate_in_row(grid1[i], grid1[i][j])) and (not duplicate_in_row(grid2[j], grid1[i][j])):\n result += grid1[i][j]\n # result.append(temp_row)\n \n print(result)", "\"\"\"\r\nTime: O(R*C(R+C))\r\n\"\"\"\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\nmatrix = []\r\nfor _ in range(n):\r\n row = list(map(str, input()))\r\n matrix.append(row)\r\n\r\nres = []\r\n\r\nfor r in range(n):\r\n for c in range(m):\r\n count = 0\r\n for i in range(m):\r\n if matrix[r][c] == matrix[r][i]:\r\n count += 1\r\n for j in range(n):\r\n if matrix[r][c] == matrix[j][c]:\r\n count += 1\r\n \r\n if count == 2:\r\n res.append(matrix[r][c])\r\n \r\nprint(\"\".join(res))\r\n \r\n", "n=list(map(int,input().split()))\r\nwords=[]\r\nword=[]\r\nfrom collections import defaultdict\r\nfor _ in range(n[0]):\r\n words.append(input())\r\nrow_dic=[defaultdict(int) for _ in range(n[0])]\r\ncol_dic=[defaultdict(int) for _ in range(n[1])]\r\nfor row in range(n[0]):\r\n for col in range(n[1]):\r\n row_dic[row][words[row][col]]+=1\r\n col_dic[col][words[row][col]]+=1\r\nfor row in range(n[0]):\r\n for col in range(n[1]):\r\n if row_dic[row][words[row][col]]==1 and col_dic[col][words[row][col]]==1:\r\n word.append(words[row][col])\r\nprint(''.join(word))", "from collections import defaultdict\r\n\r\nrow, col = map(int,input().split())\r\nans=''\r\narr=[]\r\n\r\nfor i in range(row):\r\n arr.append(list(input()))\r\n\r\nfor i in range(row):\r\n for j in range(col):\r\n add=True\r\n tmpx=0\r\n tmpy=0\r\n while tmpx < row:\r\n if arr[tmpx][j] == arr[i][j] and tmpx != i:\r\n add=False\r\n break\r\n tmpx+=1\r\n while tmpy < col:\r\n if arr[i][tmpy] == arr[i][j] and tmpy != j:\r\n add=False\r\n break\r\n tmpy+=1\r\n if add:\r\n ans+=arr[i][j]\r\nprint(ans)", "l = []\r\nl1 = []\r\ns = ''\r\n\r\n\r\nfor i in range(int(input().split()[0])):\r\n l.append(list(input()))\r\nfor u in range(len(l[0])):\r\n l1.append([])\r\n for t in l:\r\n l1[-1].append(t[u])\r\n \r\n\r\nfor y in range(len(l)):\r\n for i in range(len(l[y])):\r\n if (l[y]+l1[i]).count(l[y][i]) == 2:\r\n s += l[y][i]\r\n\r\n\r\nprint(s)\r\n", "def inp(): \r\n return map(int, input().split(' '))\r\nn, m = inp()\r\nv = []\r\nfor i in range(0, n):\r\n temp = input() \r\n v.append(temp)\r\n\r\noutput = \"\"\r\nfor i in range(0, n): \r\n for j in range(0, m):\r\n flag = True \r\n for k in range(0, n):\r\n if (v[k][j] == v[i][j] and k != i):\r\n flag = False\r\n for k in range(0, m):\r\n if (v[i][k] == v[i][j] and k != j):\r\n flag = False\r\n if (flag):\r\n output = output + str(v[i][j])\r\nprint(output)", "\r\nn, m = map(int, input().split())\r\nrectangular = []\r\nresult = ''\r\n\r\nmatrix = [[0 for i in range(m)] for j in range(n)]\r\n\r\nfor i in range(n):\r\n rectangular.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == 0: # not crossed yet\r\n for row_checker in range(m):\r\n if row_checker != j and rectangular[i][row_checker] == rectangular[i][j]:\r\n matrix[i][row_checker] = 1\r\n matrix[i][j] = 1\r\n for col_checker in range(n):\r\n if col_checker != i and rectangular[col_checker][j] == rectangular[i][j]:\r\n matrix[col_checker][j] = 1\r\n matrix[i][j] = 1\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j] == 0:\r\n result += rectangular[i][j]\r\n\r\nprint(result)\r\n", "no_row,no_col = map(int,input().split())\r\ngiven_matrix = []\r\nrow_arr = set()\r\ncol_arr = set()\r\nans = ''\r\nfor row in range(no_row):\r\n given_matrix.append(list(map(str,input())))\r\nfor row in range(no_row):\r\n for col in range(no_col):\r\n row_counter = 0\r\n col_counter = 0\r\n row_pointer = 0\r\n col_pointer = 0\r\n item = given_matrix[row][col]\r\n while row_pointer < no_row:\r\n if given_matrix[row_pointer][col] == item:\r\n col_counter += 1\r\n row_pointer += 1\r\n while col_pointer < no_col:\r\n if given_matrix[row][col_pointer] == item:\r\n row_counter += 1\r\n col_pointer += 1\r\n if row_counter > 1:\r\n row_arr.add(f\"for {item} in row {row}\")\r\n if col_counter > 1:\r\n col_arr.add(f\"for {item} in col {col}\")\r\nfor row in range(no_row):\r\n for col in range(no_col):\r\n item = given_matrix[row][col]\r\n key_row = f\"for {item} in row {row}\"\r\n key_col = f\"for {item} in col {col}\"\r\n if key_col in col_arr or key_row in row_arr:\r\n pass\r\n else:\r\n ans += item\r\nprint(ans)\r\n ", "# Codeforces: 90B - African Crossword\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n flag = True\r\n for k in range(n):\r\n if k != i and a[k][j] == a[i][j]:\r\n flag = False\r\n break\r\n if flag == False:\r\n continue\r\n for k in range(m):\r\n if k != j and a[i][k] == a[i][j]:\r\n flag = False\r\n break\r\n if flag:\r\n print(a[i][j], end = '')", "class Crossword:\r\n def __init__(self, word, delete = False):\r\n self.word = word\r\n self.delete = delete\r\n\r\n\r\nn, m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n s = input()\r\n row = []\r\n for c in s:\r\n crossword = Crossword(c)\r\n row.append(crossword)\r\n grid.append(row)\r\nfor r in range(n):\r\n for c in range(m):\r\n if not grid[r][c].delete:\r\n #check row\r\n for c1 in range(m):\r\n if c != c1 and grid[r][c].word == grid[r][c1].word:\r\n grid[r][c].delete = True\r\n grid[r][c1].delete = True\r\n #check column\r\n for r1 in range(n):\r\n if r != r1 and grid[r][c].word == grid[r1][c].word:\r\n grid[r][c].delete = True\r\n grid[r1][c].delete = True\r\nanswer = \"\"\r\nfor r in range(n):\r\n for c in range(m):\r\n if not grid[r][c].delete:\r\n answer += grid[r][c].word\r\nprint(answer)", "from collections import defaultdict\r\n\r\ndef encrypted(grid):\r\n\trow = len(grid)\r\n\tcol = len(grid[0])\r\n\tnewWord = []\r\n\tans = \"\"\r\n\tfor rowidx in range(row):\r\n\t\ttemp = []\r\n\t\tfor colidx in range(col):\r\n\t\t\tif grid[rowidx].count(grid[rowidx][colidx]) > 1:\r\n\t\t\t\ttemp.append(\"_\")\r\n\t\t\telse:\r\n\t\t\t\ttemp.append(grid[rowidx][colidx])\r\n\t\tnewWord.append(temp)\r\n\t# print(newWord)\r\n\tfor colidx in range(col):\r\n\t\ttemp = \"\"\r\n\t\tcolCount = defaultdict(int)\r\n\t\tfor rowidx in range(row):\r\n\t\t\tcolCount[grid[rowidx][colidx]] += 1\r\n\t\t# remove duplicate elements in col\r\n\t\ttemp = \"\"\r\n\t\tfor rowidx in range(row):\r\n\t\t\tif colCount[grid[rowidx][colidx]] > 1:\r\n\t\t\t\tnewWord[rowidx][colidx] = \"_\"\r\n\t# print(newWord)\r\n\tans = \"\"\r\n\tfor row in range(len(newWord)):\r\n\t\tfor col in range(len(newWord[0])):\r\n\t\t\tif newWord[row][col] != \"_\":\r\n\t\t\t\tans += newWord[row][col]\r\n\treturn ans\r\nrow,col = map(int,input().split())\r\ngrid = []\r\nfor i in range(row):\r\n\tgrid.append(input())\r\n\r\nprint(encrypted(grid))", "import sys\n\n\ndef readlines(type=int):\n return list(map(type, sys.stdin.readline().split()))\n\n\ndef read(type=int):\n return type(sys.stdin.readline().strip())\n\n\njoint = lambda it, sep=\" \": sep.join(\n [str(i) if type(i) != list else sep.join(map(str, i)) for i in it])\n\n\ndef solve(crossword, n, m):\n rowarr = [set() for _ in range(n)]\n colarr = [set() for _ in range(m)]\n for i, row in enumerate(crossword):\n seen = set()\n for letter in row:\n if letter not in seen:\n seen.add(letter)\n else:\n rowarr[i].add(letter)\n\n for i in range(m):\n seen = set()\n for j in range(n):\n if crossword[j][i] not in seen:\n seen.add(crossword[j][i])\n else:\n colarr[i].add(crossword[j][i])\n solution = \"\"\n for i in range(n):\n for j in range(m):\n if crossword[i][j] not in rowarr[i] and crossword[i][j] not in colarr[j]:\n solution += crossword[i][j]\n return solution\n\n\ndef main():\n n, m = readlines()\n crossword = [read(str) for _ in range(n)]\n print(solve(crossword, n, m))\n\n\nmain()\n", "n, m = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n b = list(input())\r\n a.append(b)\r\ns = str()\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n o = 1\r\n for x in range(n):\r\n if a[x][j] == a[i][j] and x!=i:\r\n o = 0\r\n break\r\n for y in range(m):\r\n if a[i][y] == a[i][j] and y!=j:\r\n o = 0\r\n break\r\n if o == 1:\r\n s += a[i][j]\r\n\r\nprint(s)", "n,m=map(int,input().split())\r\na=[input() for i in range(n)]\r\nans=\"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i].count(a[i][j])==1 and (\"\".join([a[k][j] for k in range(n)])).count(a[i][j])==1:\r\n ans+=a[i][j]\r\nprint(ans)\r\n\r\n", "import sys\ninput = lambda: sys.stdin.readline().strip()\n\nn, m = map(int,input().split())\ng=[list(input())for _ in range(n)]\nf=[[False]*m for _ in range(n)]\nfor i in range(n):\n\tfor j in range(m):\n\t\tc=g[i][j]\n\t\tif g[i].count(c)>=2 or [g[v][j] for v in range(n)].count(c)>=2:\n\t\t\tf[i][j]=True\nprint(''.join(g[i][j] for i in range(n) for j in range(m) if not f[i][j]))", "n, m = [int(i) for i in input().split()]\r\nmat = []\r\nresult = \"\"\r\nfor _ in range(n):\r\n mat.append(list(input()))\r\nfor i in range(n):\r\n for j in range(m):\r\n val = mat[i][j]\r\n for k in range(m):\r\n if k != j and val == mat[i][k]:\r\n break\r\n else:\r\n for k in range(n):\r\n if k != i and val == mat[k][j]:\r\n break\r\n else:\r\n result += val\r\nprint(result)", "n,m = map(int, input().split())\r\nrows = [input() for _ in range(n)]\r\ncolumns = [''.join([i[j] for i in rows]) for j in range(m)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if rows[i].count(rows[i][j]) == 1 and columns[j].count(rows[i][j]) == 1: \r\n print(rows[i][j], end='')", "from collections import defaultdict\r\n\r\n#input the row size and column size\r\nrowSize, columnSize = list(map(int,input().split()))\r\n\r\ncrosswordGrid = []\r\n\r\nfor _ in range(rowSize):\r\n crosswordGrid.append(list(input()))\r\n\r\n#answer array\r\nfilteredGrid = []\r\n\r\n#copy the original array\r\nfor row in range(rowSize):\r\n filteredRow = []\r\n for column in range(columnSize):\r\n filteredRow.append(crosswordGrid[row][column])\r\n filteredGrid.append(filteredRow)\r\n\r\n\r\n#change all the occurances greater than one to X in the row\r\nfor row in range(rowSize):\r\n rowapperance = defaultdict(list)\r\n for column in range(columnSize):\r\n rowapperance[crosswordGrid[row][column]].append(column)\r\n\r\n #change to x\r\n for letter, indices in rowapperance.items():\r\n if len(indices) > 1:\r\n for index in indices:\r\n filteredGrid[row][index] = 'X'\r\n\r\n#change all the occurances greater than one to X in the column\r\nfor column in range(columnSize):\r\n columnapperace = defaultdict(list)\r\n for row in range(rowSize):\r\n columnapperace[crosswordGrid[row][column]].append(row)\r\n\r\n #change to x\r\n for letter, indices in columnapperace.items():\r\n if len(indices) > 1:\r\n for index in indices:\r\n filteredGrid[index][column] = 'X'\r\n\r\n#display all except for X\r\nfor row in range(rowSize):\r\n for column in range(columnSize):\r\n if filteredGrid[row][column] != 'X':\r\n print(filteredGrid[row][column], end='')\r\n", "n, m = [int(x) for x in input().split(' ')]\r\nrows = [input() for i in range(n)]\r\ncolumns = [[row[i] for row in rows] for i in range(m)]\r\nans = [rows[i][j] for i in range(n) for j in range(m) if rows[i].count(rows[i][j]) == 1 and columns[j].count(rows[i][j]) == 1]\r\nprint(''.join(ans))", "def checkRow(i, c):\r\n cnt = 0\r\n for j in range(m):\r\n cnt += (a[i][j] == c)\r\n return cnt >= 2\r\ndef checkCol(j, c):\r\n cnt = 0\r\n for i in range(n):\r\n cnt += (a[i][j] == c)\r\n return cnt >= 2\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\n\r\nFree = [[0] * m for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if checkRow(i, a[i][j]) or checkCol(j, a[i][j]):\r\n Free[i][j] = 1\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if Free[i][j] == 0:\r\n print(a[i][j], end = '')", "n,m = map(int,input().split())\r\nboard = []\r\nfor i in range(n):\r\n board.append(input())\r\nflat = []\r\nfor row in board:\r\n for letter in row:\r\n flat.append(letter)\r\n\r\nrows = {}\r\ncols = {}\r\nfor i in range(len(flat)):\r\n if (flat[i],i%m) not in cols:\r\n cols[(flat[i],i%m)] = 1\r\n else:\r\n cols[(flat[i],i%m)] += 1\r\n if (flat[i],i//m) not in rows:\r\n rows[(flat[i],i//m)] = 1\r\n else:\r\n rows[(flat[i],i//m)] += 1\r\n\r\nfor i in range(len(flat)):\r\n if cols[flat[i],i%m] > 1 or rows[flat[i],i//m] > 1:\r\n flat[i] = \".\"\r\nword = []\r\nfor char in flat:\r\n if char != \".\":\r\n word.append(char)\r\nprint(\"\".join(word))\r\n", "from collections import Counter\r\nline = input().split()\r\nn, m = int(line[0]), int(line[1])\r\n\r\ntable = []\r\nfor i in range(n):\r\n table.append(list(input()))\r\n\r\nrows = []\r\ncols = []\r\nfor i in range(n):\r\n rows.append(Counter(table[i]))\r\n\r\nfor i in range(m):\r\n c = []\r\n for j in range(n):\r\n c.append(table[j][i])\r\n cols.append(Counter(c))\r\n \r\n \r\n \r\nres = \"\" \r\nfor i in range(n):\r\n for j in range(m):\r\n if (rows[i][table[i][j]]) < 2 and (cols[j][table[i][j]] < 2):\r\n res += table[i][j]\r\n \r\n \r\nprint(res)", "import sys\r\n\r\nsys.setrecursionlimit(100000)\r\n\r\n#sys.stdin = open(\"INP.txt\", 'r')\r\n\r\n\r\n# sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n a = []\r\n delete = []\r\n for _ in range(n):\r\n a.append(list(input()))\r\n delete.append([False] * m)\r\n for i in range(n):\r\n for j in range(m):\r\n flag = False\r\n\r\n for k in range(n):\r\n if k != i and a[i][j] == a[k][j]:\r\n flag = True\r\n delete[k][j] = True\r\n\r\n for k in range(m):\r\n if k != j and a[i][j] == a[i][k]:\r\n flag = True\r\n delete[i][k] = True\r\n\r\n if flag:\r\n delete[i][j] = True\r\n\r\n res = ''\r\n for i in range(n):\r\n for j in range(m):\r\n if not delete[i][j]:\r\n res += a[i][j]\r\n print(res)\r\n\r\n\r\nmain()\r\n", "n, m = map(int, input().split())\r\ncross = []\r\ncheck = []\r\nfor i in range(n):\r\n c = [1] * m\r\n africa = []\r\n word = input()\r\n for letter in word:\r\n africa.append(letter)\r\n cross.append(africa)\r\n check.append(c)\r\n\r\nfor row in range(n):\r\n for col in range(m):\r\n curr = cross[row][col]\r\n found = False\r\n c = col + 1\r\n while c < m:\r\n if cross[row][c] == curr:\r\n check[row][c] = 0\r\n found = True\r\n c += 1\r\n r = row + 1\r\n while r < n:\r\n if cross[r][col] == curr:\r\n check[r][col] = 0\r\n found = True\r\n r += 1\r\n if found:\r\n check[row][col] = 0\r\n\r\nanswer = []\r\nfor row in range(n):\r\n for col in range(m):\r\n if check[row][col] == 1:\r\n answer.append(cross[row][col])\r\nprint(\"\".join(answer))", "from collections import Counter\r\nn, m = map(int, input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(input())\r\n# print(matrix)\r\nmatrix2 = []\r\nfor i in range(m):\r\n col = []\r\n for r in range(n):\r\n col.append(matrix[r][i])\r\n matrix2.append(col)\r\n# print(matrix2)\r\nans = \"\"\r\nfor i in range(n):\r\n row_count = Counter(matrix[i])\r\n # print(row_count)\r\n for j in range(m):\r\n col_count = Counter(matrix2[j])\r\n if row_count[matrix[i][j]] == 1 and col_count[matrix[i][j]] == 1:\r\n ans += str(matrix[i][j])\r\nprint(ans)\r\n", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn,m = M()\r\n\r\nmatrix = [list(S()) for i in range(n)]\r\n# print(matrix)\r\navail = [[1 for i in range(m)] for j in range(n)]\r\n\r\nans = []\r\nflag=1\r\nfor i in range(n):\r\n for j in range(m):\r\n \r\n flag = 1\r\n for r in range(n):\r\n if matrix[r][j]==matrix[i][j] and r!=i:\r\n flag=0\r\n break\r\n \r\n if flag==1:\r\n for c in range(m):\r\n \r\n if matrix[i][c]==matrix[i][j] and c!=j:\r\n \r\n flag =0\r\n break\r\n \r\n if flag==1:\r\n ans.append(matrix[i][j])\r\n \r\nprint(*ans,sep='')", "#https://codeforces.com/problemset/problem/90/B\r\n'''\r\nComment\r\n'''\r\nmaze = []\r\nm = 0\r\nn = 0\r\n\r\ndef check(x, y):\r\n for i in range(m):\r\n if maze[i][y] == maze[x][y] and i != x:\r\n return False\r\n \r\n for j in range(n):\r\n if maze[x][j] == maze[x][y] and j != y:\r\n return False\r\n\r\n return True\r\n\r\nif __name__ == \"__main__\":\r\n m, n = map(int, input().split())\r\n res = \"\"\r\n\r\n for i in range(m):\r\n line = list(input())\r\n maze.append(line)\r\n\r\n for i in range(m):\r\n for j in range(n):\r\n if check(i, j):\r\n res += maze[i][j]\r\n\r\n print(res)\r\n", "def column(matrix, i):\r\n return [row[i] for row in matrix]\r\n\r\nn, m = map(int, input().split())\r\nmat = []\r\nfor _ in range(n):\r\n\tmat.append([char for char in input()])\r\n\r\nans = \"\"\r\n# print(mat)\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\t# print(mat[:][j], mat[:][j].count(mat[i][j]))\r\n\t\tif mat[i][:].count(mat[i][j])>1 or column(mat, j).count(mat[i][j])>1:\r\n\t\t\tpass\r\n\t\telse:\r\n\t\t\tans+=mat[i][j]\r\n\t\t\t# print(i, j, mat[i][j])\r\n\r\nprint(ans)\t\t\t\t", "def crossword(grid,n,m):\r\n grid_new = [[grid[x][y] for y in range(m)] for x in range(n)]\r\n\r\n row = 0\r\n while row < n:\r\n row_seen = []\r\n column = 0\r\n while column < m:\r\n letter = grid[row][column]\r\n seen = False\r\n if letter in grid[row][:column] or letter in grid[row][column+1:] or letter in row_seen:\r\n grid_new[row][column] = \"\"\r\n row_seen.append(letter)\r\n seen = True\r\n if not seen and letter in [grid[r][column] for r in range(n) if r != row]: \r\n grid_new[row][column] = \"\"\r\n seen = True\r\n if not seen:\r\n grid_new[row][column] = letter\r\n\r\n column += 1\r\n row += 1\r\n word = \"\"\r\n for row in grid_new:\r\n for w in row:\r\n if w != \"\":\r\n word += w\r\n print(word)\r\n\r\nn,m = list(map(int, input().strip().split(\" \")))\r\ngrid = [[None for y in range(m)] for x in range(n)]\r\nfor row in range(n):\r\n word = input().strip()\r\n for col, letter in zip(list(range(m)), word):\r\n grid[row][col] = letter \r\n \r\n\r\ncrossword(grid,n,m)", "a=[int(i) for i in input().split()]\nn=a[0]\nm=a[1]\ntxt = [[j for j in input()] for i in range(n)]\nans=[]\nfor i in range(n):\n for j in range(m):\n ci=0\n for x in range(n):\n if txt[i][j] != txt[x][j]:\n ci+=1\n if ci==n-1:\n cj=0\n for y in range(m):\n if txt[i][j] != txt[i][y]:\n cj+=1\n if cj==m-1:\n ans.append(txt[i][j])\nprint(\"\".join(ans))", "from collections import defaultdict\r\nn, m = (int(i) for i in input().split())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(input())\r\n\r\n\r\nrow_count = defaultdict(int)\r\ncol_count = defaultdict(int)\r\n\r\nfor r in range(n):\r\n for c in range(m):\r\n row_count[(r, arr[r][c])] += 1\r\n col_count[(c, arr[r][c])] += 1\r\n\r\nres = []\r\nfor r in range(n):\r\n for c in range(m):\r\n if row_count[(r, arr[r][c])] == 1 and col_count[(c, arr[r][c])] == 1:\r\n res.append((arr[r][c]))\r\nprint(\"\".join(res))", "n, m = map(int, input().split())\r\n\r\ngrid = [input() for _ in range(n)]\r\n\r\nrow_freqs = [{} for _ in range(n)]\r\ncol_freqs = [{} for _ in range(m)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = grid[i][j]\r\n row_freqs[i][letter] = row_freqs[i].get(letter, 0) + 1\r\n col_freqs[j][letter] = col_freqs[j].get(letter, 0) + 1\r\n\r\ncrossed_out = [[False]*m for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = grid[i][j]\r\n if row_freqs[i][letter] == 1 and col_freqs[j][letter] == 1:\r\n crossed_out[i][j] = False\r\n else:\r\n crossed_out[i][j] = True\r\n\r\nencrypted_word = ''\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if not crossed_out[i][j]:\r\n encrypted_word += grid[i][j]\r\n\r\nprint(encrypted_word)", "n,m = list(map(int,input().split()))\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append([[a,'.'] for a in input()])\r\n# rows\r\nfor i in range(n):\r\n df = {}\r\n for j in range(m):\r\n if grid[i][j][0] in df:\r\n grid[i][df[grid[i][j][0]]][1] = 'x'\r\n grid[i][j][1] = '#'\r\n df[grid[i][j][0]] = j\r\n \r\nfor j in range(m):\r\n df = {}\r\n for i in range(n):\r\n if grid[i][j][0] in df:\r\n grid[df[grid[i][j][0]]][j][1] = 'x'\r\n grid[i][j][1] = '#'\r\n df[grid[i][j][0]] = i\r\nword = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j][1] == '.':\r\n word.append(grid[i][j][0])\r\nprint(\"\".join(word))\r\n\r\n", "m,n = map(int,input().split())\r\nmat = []\r\nfor i in range(m):\r\n mat.append(input())\r\n\r\nvisited = set()\r\na = {}\r\nfor i in range(m):\r\n for j in range(n):\r\n if mat[i][j] in a:\r\n visited.add((i,j))\r\n visited.add(a[mat[i][j]])\r\n else:\r\n a[mat[i][j]] = (i,j)\r\n \r\n a.clear()\r\n \r\nfor j in range(n):\r\n for i in range(m):\r\n if mat[i][j] in a:\r\n visited.add((i,j))\r\n visited.add(a[mat[i][j]])\r\n else:\r\n a[mat[i][j]] = (i,j)\r\n \r\n a.clear()\r\n\r\nans = \"\"\r\nfor i in range(m):\r\n for j in range(n):\r\n if (i,j) not in visited:\r\n ans+=mat[i][j]\r\n \r\nprint(ans) \r\n ", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn, m = map(int, input().split())\r\nq1 = set()\r\nw = []\r\nfor j in range(n):\r\n s = input()[:-1]\r\n d = Counter(s)\r\n for i in range(m):\r\n if d[s[i]] < 2:\r\n q1.add((j,i))\r\n w.append(s)\r\ns = list(map(''.join, zip(*w)))\r\nq2 = set()\r\nfor i in range(m):\r\n d = Counter(s[i])\r\n for j in range(n):\r\n if d[s[i][j]] < 2:\r\n q2.add((j,i))\r\n\r\nq = q1 & q2\r\nq = sorted(q)\r\nx = ''\r\nfor i, j in q:\r\n x += w[i][j]\r\nprint(x)", "n,m=map(int,input().split())\r\nM=[]\r\nfor i in range(n):\r\n s=input()\r\n M.append(s)\r\n\r\nans=\"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n co1=True\r\n co2=True\r\n for i1 in range(n):\r\n if(i1!=i and co1):\r\n if(M[i1][j]==M[i][j]):\r\n co1=False\r\n for j1 in range(m):\r\n if(j1!=j and co2):\r\n if(M[i][j1]==M[i][j]):\r\n co2=False\r\n if(co1 and co2):\r\n ans=ans+M[i][j]\r\nprint(ans)", "from collections import Counter\r\n\r\ndef cross(lists, n, m) -> None:\r\n colMap = [Counter(cols) for cols in zip(*lists)]\r\n rowMap = [Counter(rows) for rows in lists]\r\n\r\n for row in range(n):\r\n for col in range(m):\r\n if rowMap[row][crossword[row][col]] == 1:\r\n if colMap[col][crossword[row][col]] == 1:\r\n print(crossword[row][col], end=\"\")\r\n \r\nn, m = map(int, input().split())\r\ncrossword = []\r\nfor _ in range(n):\r\n crossword.append(list(input()))\r\ncross(crossword, n, m)", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\n#pt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nx,y = get_int_list()\r\nmatrix = []\r\nfor i in range(x):\r\n matrix.append(list(get_string()))\r\nmat1 = []\r\nmat2 = []\r\nfor i in range(x):\r\n temp = ['#']\r\n for j in set(matrix[i]):\r\n if matrix[i].count(j) > 1:\r\n temp.append(j) \r\n mat1.append(temp)\r\nfor i in range(y):\r\n lst = [ matrix[j][i] for j in range(x)]\r\n temp = ['#']\r\n for k in set(lst):\r\n if lst.count(k) > 1:\r\n temp.append(k)\r\n mat2.append(temp)\r\n\r\nres = ''\r\nfor i in range(x):\r\n for j in range(y):\r\n char = matrix[i][j]\r\n if char not in mat1[i] and char not in mat2[j]:\r\n res = res + char\r\nprint(res)", "\r\n\r\n\r\nn,m = tuple(map(int, input().split()))\r\n\r\n\r\n\"\"\"\r\ncross out all repeating letters and return original word\r\n\"\"\"\r\n\r\n\r\ndef checkMatches(row, col, arr):\r\n val = arr[row][col]\r\n\r\n # at the row\r\n for c in range(len(arr[0])):\r\n if c != col and (arr[row][c] == val):\r\n return True\r\n\r\n # at the column\r\n for r in range(len(arr)):\r\n if r != row and (arr[r][col] == val):\r\n return True\r\n \r\n return False\r\n\r\n\r\ncrossedOut = [[False for i in range(m)] for j in range(n)]\r\n\r\ncrossWord = []\r\nfor _ in range(n):\r\n i = input()\r\n row = []\r\n for c in range(len(i)):\r\n row.append(i[c])\r\n crossWord.append(row)\r\n \r\nfor row in range(n):\r\n for col in range(m):\r\n if checkMatches(row, col, crossWord):\r\n crossedOut[row][col] = True\r\n\r\n\r\nres = []\r\nfor row in range(n):\r\n for col in range(m):\r\n if not crossedOut[row][col]:\r\n res.append(crossWord[row][col])\r\n\r\n\r\nprint(\"\".join(res))\r\n", "n, m = map(int, input().split())\r\n\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append(input())\r\n \r\nhorCount, verCount = {}, {}\r\nfor row in range(len(grid)):\r\n for col in range(len(grid[0])):\r\n char = str(row) + grid[row][col]\r\n horCount[char] = horCount.get(char,0) + 1\r\n \r\nfor col in range(len(grid[0])):\r\n for row in range(len(grid)):\r\n char = str(col) + grid[row][col]\r\n verCount[char] = verCount.get(char,0) + 1\r\n \r\nencrypted = []\r\nfor row in range(len(grid)):\r\n for col in range(len(grid[0])):\r\n char1 = str(row) + grid[row][col]\r\n char2 = str(col) + grid[row][col]\r\n rCount = horCount[char1]\r\n cCount = verCount[char2]\r\n if rCount == 1 and cCount == 1:\r\n encrypted.append(grid[row][col])\r\n \r\nprint(\"\".join(encrypted))", "def africanCrossWord():\r\n n, m = list(map(int,input().rstrip().split()))\r\n grid = [list(input().rstrip()) for _ in range(n)]\r\n encrypted = \"\"\r\n\r\n def checkCol(col,curVal):\r\n colString = \"\"\r\n for i in range(n):\r\n colString += grid[i][col]\r\n\r\n return colString.count(curVal) == 1\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if grid[i].count(grid[i][j]) == 1 and checkCol(j,grid[i][j]):\r\n encrypted += grid[i][j]\r\n \r\n return encrypted\r\nif __name__ == '__main__':\r\n print(africanCrossWord())", "from collections import Counter\r\n\r\n\r\nn, m = [int(x) for x in input().split()]\r\nwords = []\r\nfor _ in range(n):\r\n words.append(input())\r\n\r\n#keep the count of each words vertically and horizontally.\r\nhor, ver = {}, {}\r\nfor i in range(n):\r\n hor[i] = Counter(words[i])\r\nfor j in range(m):\r\n ver[j] = Counter([words[i][j] for i in range(n)])\r\n# print('hor:',hor,'\\nver:',ver) \r\nfor i in range(n):\r\n for j in range(m):\r\n if hor[i][words[i][j]] == 1 and ver[j][words[i][j]] == 1:\r\n print(words[i][j], end='')\r\n\r\n", "from collections import Counter\r\ninp = input().split(\" \")\r\nr = int(inp[0])\r\nc = int(inp[1])\r\n\r\nmat = []\r\nfor i in range(r):\r\n col = list(map(lambda x: x, input()))\r\n mat.append(col)\r\nans = \"\"\r\nfor i in mat:\r\n for j, ver in zip(i, zip(*mat)):\r\n newList = Counter(i + list(ver))\r\n if newList[j] == 2:\r\n ans+=j\r\nprint(ans)\r\n \r\n \r\n", "n,m=map(int,input().split())\nr=[]\nc=[]\nfor i in range(n):\n r.append(list(input()))\nfor j in range(m):\n c.append([r[i][j] for i in range(n)])\nfor i in range(n):\n freq={}\n for j in range(m):\n if r[i][j] in freq:\n freq[r[i][j]]+=1\n else:\n freq[r[i][j]]=1\n for j in range(m):\n if freq[r[i][j]]>1:\n r[i][j]='-'\nfor j in range(m):\n freq={}\n for i in range(n):\n if c[j][i] in freq:\n freq[c[j][i]]+=1\n else:\n freq[c[j][i]]=1\n for i in range(n):\n if freq[c[j][i]]>1:\n c[j][i]='-'\nans=[]\nfor i in range(n):\n for j in range(m):\n if r[i][j]!='-' and c[j][i]!='-':\n ans.append(r[i][j])\nprint(''.join(ans))\n \n", "n, m = map(int, input().split())\r\n\r\narray = []\r\nfor i in range(n):\r\n temp = input()\r\n array.append(temp)\r\n\r\n#build row\r\nrow = []\r\nfor i in range(n):\r\n row.append([])\r\n counter = [0]*26\r\n for x in array[i]:\r\n counter[ord(x)-97] += 1\r\n for j in range(26):\r\n if counter[j] == 1:\r\n row[i].append(chr(j+97))\r\n\r\n#build col\r\ncol = []\r\nfor i in range(m):\r\n col.append([])\r\n counter = [0]*26\r\n for k in range(n):\r\n counter[ord(array[k][i])-97] += 1\r\n for j in range(26):\r\n if counter[j] == 1:\r\n col[i].append(chr(j+97))\r\n\r\noutput = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n check = array[i][j]\r\n if check in row[i] and check in col[j]:\r\n output += check\r\n\r\nprint(output)", "from collections import Counter\r\nm, n = map(int, input().split())\r\ncrossword = []\r\nfor _ in range(m):\r\n crossword.append(input())\r\n\r\nrowCount = []\r\nfor i in range(m):\r\n rowCount.append(Counter(crossword[i]))\r\n\r\ncolCount = list(zip(*crossword))\r\nfor i in range(n):\r\n colCount[i] = Counter(colCount[i])\r\n\r\nword = \"\"\r\nfor row in range(m):\r\n for col in range(n):\r\n if rowCount[row][crossword[row][col]] == 1 and colCount[col][crossword[row][col]] == 1:\r\n word += crossword[row][col]\r\nprint(word)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ns = [list(input().rstrip()) for _ in range(n)]\r\nt = [[s[i][j] for i in range(n)] for j in range(m)]\r\nans = []\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(m):\r\n tj = t[j]\r\n sij = si[j]\r\n if si.count(sij) == tj.count(sij) == 1:\r\n ans.append(sij)\r\nsys.stdout.write(\"\".join(map(str, ans)))", "row, col = list(map(int, input().split()))\r\ngrid = [input() for i in range(row)]\r\n\r\n\r\n\r\ndef is_inBound(r, c):\r\n return 0 <= r < row and 0 <= c < col\r\n\r\ndef is_croosed(i, j):\r\n\r\n directions = [(0, -1), (0, 1), (-1, 0), (1, 0)]\r\n\r\n for dx, dy in directions:\r\n\r\n r, c = i+dx, j+dy\r\n\r\n while is_inBound(r, c):\r\n\r\n if grid[i][j] == grid[r][c]:\r\n return False\r\n break\r\n\r\n r += dx\r\n c += dy\r\n else:\r\n return True\r\n\r\n\r\nans = []\r\n\r\nfor i in range(row):\r\n for j in range(col):\r\n if is_croosed(i, j):\r\n ans.append(grid[i][j])\r\n\r\nans = \"\".join(ans)\r\nprint(ans)", "def str_inp(n):\r\n return [input() for x in range(n)]\r\n\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef get_col(arr, i):\r\n return [row[i] for row in arr]\r\n\r\n\r\nn, m = inp()\r\ns, out = str_inp(n), ''\r\nfor i in range(n):\r\n for j in range(m):\r\n col = ''.join(get_col(s, j))\r\n # print(col)\r\n if s[i].find(s[i][j]) == s[i].rfind(s[i][j]) and (col.rfind(s[i][j]) == col.find(s[i][j])):\r\n out += s[i][j]\r\n\r\nprint(out)\r\n", "[n, m] = [int(x) for x in input().split()]\r\n\r\ncrossword = [\"\"]*n\r\n\r\noutput = \"\"\r\n\r\nfor ind in range(n):\r\n crossword[ind] = input()\r\n\r\ni = 0\r\nwhile i < n:\r\n j = 0\r\n while j < m:\r\n letter = crossword[i][j]\r\n vertical = []\r\n for index in range(n):\r\n vertical.append(crossword[index][j])\r\n if crossword[i].count(letter) == 1 and vertical.count(letter) == 1:\r\n output += letter\r\n j += 1\r\n i += 1\r\n\r\nprint(output)\r\n", "n, m = list(map(int, input().split()))\r\n\r\nrows = []\r\ncolumns = []\r\n\r\n\r\nfor i in range(n):\r\n\trow = [i for i in input()]\r\n\trows.append(row)\r\n\r\nfor j in range(m):\r\n\tcols = []\r\n\tfor k in range(n):\r\n\t\tcols.append(rows[k][j])\r\n\tcolumns.append(cols)\r\n\r\nanswers = []\r\n\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif rows[i].count(rows[i][j]) == 1 and columns[j].count(rows[i][j]) == 1:\r\n\t\t\tanswers.append(rows[i][j])\r\nprint(\"\".join(answers))", "n,m = [int(x) for x in input().split()]\r\ngrid = []\r\ngridCopy = []\r\n\r\nfor i in range(n):\r\n row = [x for x in input()]\r\n rowCopy = row.copy()\r\n grid.append(row)\r\n gridCopy.append(rowCopy)\r\n\r\n\r\ndef moveRight(row,col):\r\n target = gridCopy[row][col]\r\n count = 0\r\n\r\n for i in range(col+1,m):\r\n if gridCopy[row][i] == target:\r\n grid[row][i] = None\r\n count += 1\r\n if count > 0:\r\n grid[row][col] = None\r\ndef moveDown(row,col):\r\n target = gridCopy[row][col]\r\n count = 0\r\n for i in range(row+1,n):\r\n if gridCopy[i][col] == target:\r\n grid[i][col] = None\r\n count += 1\r\n if count > 0:\r\n grid[row][col] = None\r\n\r\nans = []\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n moveDown(i,j)\r\n moveRight(i,j)\r\n\r\n if grid[i][j] != None:\r\n ans.append(grid[i][j])\r\nprint(\"\".join(ans))", "n, m = list(map(int, input().split()))\r\n\r\nletters = []\r\nfor _ in range(n):\r\n row = list(input())\r\n letters.append(row)\r\n\r\nmatrix = [[1 for _ in range(m)] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n crossed = False\r\n letter = letters[i][j]\r\n\r\n # checking in row\r\n for x in range(m):\r\n if x != j:\r\n if letters[i][x] == letter:\r\n crossed = True\r\n break\r\n\r\n # checking in a column\r\n for x in range(n):\r\n if x != i:\r\n if letters[x][j] == letter:\r\n crossed = True\r\n break\r\n\r\n if crossed:\r\n matrix[i][j] = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j]:\r\n print(letters[i][j], end=\"\")\r\n", "from collections import defaultdict\r\nnm = input().split()\r\nn = int(nm[0])\r\nm = int(nm[1])\r\ndic_row = defaultdict(int)\r\ndic_column = defaultdict(int)\r\nanswer = \"\"\r\nmatrix = []\r\nfor row in range(n):\r\n matrix.append(list(input()))\r\n\r\nfor row in range(n):\r\n for column in range(m):\r\n dic_row[str(row) + matrix[row][column]] +=1\r\n dic_column[str(column) + matrix[row][column]] +=1\r\n\r\nfor row in range(n):\r\n for column in range(m):\r\n if dic_row[str(row) + matrix[row][column]]<2 and dic_column[str(column) + matrix[row][column]]<2:\r\n answer += matrix[row][column]\r\nprint(answer)", "def africanCrossWord():\r\n n, m = list(map(int,input().rstrip().split()))\r\n grid = [list(input()) for _ in range(n)]\r\n crossed = set()\r\n encrypted = \"\"\r\n\r\n for i in range(n):\r\n dictRow = {}\r\n for j in range(m):\r\n if grid[i][j] in dictRow:\r\n crossed.add(str(i)+\"r\"+grid[i][j])\r\n else:\r\n dictRow[grid[i][j]] = 1\r\n\r\n for i in range(m):\r\n dictCol = {}\r\n for j in range(n):\r\n if grid[j][i] in dictCol:\r\n crossed.add(str(i)+\"c\"+grid[j][i])\r\n else:\r\n dictCol[grid[j][i]] = 1\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if ((str(i) + \"r\" + grid[i][j]) not in crossed) and ((str(j) + \"c\" + grid[i][j]) not in crossed):\r\n encrypted += grid[i][j]\r\n return encrypted\r\nif __name__ == '__main__':\r\n print(africanCrossWord())", "n, m = map(int, input().split())\r\nRow = {}\r\nColumn = {}\r\nList = []\r\nfor i in range(n):\r\n temp = input()\r\n List.append(temp)\r\n Row[i] = temp\r\nfor i in range(m):\r\n jd = \"\"\r\n for j in range(n):\r\n jd += List[j][i]\r\n Column[i] = jd\r\nresult = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n count = 0\r\n for k in Column[j]:\r\n if List[i][j] == k:\r\n count += 1\r\n for l in Row[i]:\r\n if List[i][j] == l:\r\n count += 1\r\n if count <= 2:\r\n result += List[i][j]\r\nprint(result)", "from collections import defaultdict\r\n\r\nn,m = map(int,input().split())\r\n \r\ngrid = []\r\nrepeated_ele = defaultdict(list)\r\n \r\nfor _ in range(n):\r\n input_val = input()\r\n row_val = [val for val in input_val]\r\n grid.append(row_val)\r\n \r\n# Check the row value \r\nfor row in range(len(grid)):\r\n \r\n \r\n for col in range(len(grid[0])):\r\n \r\n \r\n repeated_ele[grid[row][col]].append((row,col))\r\n\r\nres = []\r\nfor key in repeated_ele:\r\n \r\n if len(repeated_ele[key]) > 1:\r\n \r\n for index in range(len(repeated_ele[key])):\r\n ele_1 = repeated_ele[key][index]\r\n flag = False\r\n for j in range(len(repeated_ele[key])):\r\n \r\n if index != j:\r\n ele_2 = repeated_ele[key][j]\r\n # print(ele_1,ele_2)\r\n if ele_1[0] != ele_2[0] and ele_1[1] != ele_2[1]:\r\n flag = True\r\n else:\r\n flag = False\r\n break\r\n \r\n if flag:\r\n res.append([ele_1[0],ele_1[1]])\r\n else:\r\n res.append([ repeated_ele[key][0][0], repeated_ele[key][0][1] ])\r\n\r\nres.sort() \r\n\r\nans = \"\"\r\nfor ele in res:\r\n ans += grid[ele[0]][ele[1]]\r\n \r\nprint(ans)", "def checkRow(i, c):\r\n cnt = 0\r\n for j in range(m):\r\n if g[i][j] == c :\r\n cnt +=1\r\n\r\n if cnt >= 2 :\r\n return True\r\n return False\r\n\r\n\r\ndef checkCol(j, c):\r\n cnt = 0\r\n for i in range(n):\r\n if g[i][j] == c :\r\n cnt +=1\r\n\r\n if cnt >= 2 :\r\n return True\r\n return False\r\n\r\nn , m = map(int,input().split())\r\n\r\ng = []\r\n\r\nfor i in range(n):\r\n g.append(list(input()))\r\n\r\n\r\nres = [[0]*m for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if (checkRow(i , g[i][j])) or checkCol(j , g[i][j]):\r\n res[i][j] = 1\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if res[i][j] == 0 :\r\n print(g[i][j] , end = '')\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\narr = []\r\n\r\nfor i in range(n):\r\n s = input()\r\n arr.append(s)\r\n\r\nfor i in range(len(arr)):\r\n\r\n for j in range(len(arr[i])):\r\n flag = True\r\n for k in range(len(arr[i])):\r\n\r\n if arr[i][j] == arr[i][k] and j != k :\r\n flag = False\r\n for k in range(len(arr)):\r\n if arr[k][j] == arr[i][j] and k != i:\r\n flag = False\r\n if flag == True:\r\n print(arr[i][j], end = '')\r\n", "from collections import Counter\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nmat = []\r\ncolwise = [[] for _ in range(m)]\r\nfor _ in range(n):\r\n st = input()\r\n row = []\r\n for ind in range(m):\r\n row.append(st[ind])\r\n colwise[ind].append(st[ind])\r\n mat.append(row)\r\ncolCount = []\r\nfor i in range(m):\r\n count = Counter(colwise[i])\r\n colCount.append(count)\r\n\r\nans = []\r\nfor row in range(n):\r\n rowCount = Counter(mat[row])\r\n for col in range(m):\r\n \r\n\r\n if rowCount[mat[row][col]] == 1 and colCount[col][mat[row][col]] == 1:\r\n ans.append(mat[row][col])\r\n\r\nprint(\"\".join(ans))\r\n\r\n", "n, m = map(int, input().split())\r\n\r\ngrid = []\r\nfor i in range(n):\r\n row = input().strip()\r\n grid.append(list(row))\r\n\r\ndict = set()\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i].count(grid[i][j]) > 1:\r\n dict.add((i,j))\r\n \r\n col = [grid[k][j] for k in range(n)]\r\n if col.count(grid[i][j]) > 1:\r\n dict.add((i,j))\r\n \r\nresult = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if (i, j) not in dict:\r\n result += grid[i][j]\r\n\r\nprint(result)\r\n", "r,c = list(map(int,input().split()))\r\n\r\nmat = []\r\n\r\nfor i in range(r):\r\n temp = list(input())\r\n mat.append(temp)\r\n\r\nrow = []\r\ncol = []\r\n\r\n\r\nfor i in range(len(mat)):\r\n val = set()\r\n for j in range(len(mat[i])):\r\n \r\n if mat[i][j] in val:\r\n row.append([i,mat[i][j]])\r\n else:\r\n val.add(mat[i][j])\r\nfor i in range(len(mat[0])):\r\n val = set()\r\n for j in range(len(mat)):\r\n \r\n if mat[j][i] in val:\r\n col.append([i,mat[j][i]])\r\n else:\r\n val.add(mat[j][i])\r\n \r\n\r\nfor itr in row:\r\n for i in range(c):\r\n if mat[itr[0]][i] == itr[1]:\r\n mat[itr[0]][i] = \".\"\r\nfor itr in col:\r\n for i in range(r):\r\n if mat[i][itr[0]] == itr[1]:\r\n mat[i][itr[0]] = \".\"\r\n \r\nstring = []\r\nfor i in mat:\r\n for j in i:\r\n if j != \".\":\r\n string.append(j)\r\nprint(\"\".join(string)) \r\n \r\n ", "rows, cols = list(map(int, input().split()))\r\ntable = []\r\nfor _ in range(rows):\r\n table.append(input())\r\n\r\nremoved = set()\r\nfor row in range(rows):\r\n temp = {}\r\n for col in range(cols):\r\n char = table[row][col]\r\n if char in temp:\r\n removed.add(temp[char])\r\n removed.add((row, col))\r\n temp[char] = (row, col)\r\n\r\nfor col in range(cols):\r\n temp = {}\r\n for row in range(rows):\r\n char = table[row][col]\r\n if char in temp:\r\n removed.add(temp[char])\r\n removed.add((row, col))\r\n temp[char] = (row, col)\r\n\r\nencrypted = []\r\nfor row in range(rows):\r\n for col in range(cols):\r\n char = table[row][col]\r\n if (row, col) not in removed:\r\n encrypted.append(char)\r\n\r\nprint(\"\".join(encrypted))", "r,c=map(int,input().split())\r\nm=[input().strip() for i in range(r)]\r\nfor i in range(r):\r\n\tfor j in range(c):\r\n\t\tif m[i].count(m[i][j])==1:\r\n\t\t\tco=0\r\n\t\t\tfor sr in range(r):\r\n\t\t\t\tif m[i][j]==m[sr][j] and sr!=i:\r\n\t\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tprint(m[i][j],end=\"\")\r\n", "row_size, col_size = map(int, input().split())\r\n\r\ngrid = []\r\nignore = set()\r\n\r\nfor rx in range(row_size):\r\n row = input()\r\n grid.append([*row])\r\n\r\nfor rx in range(row_size):\r\n for cx in range(col_size):\r\n curr_char = grid[rx][cx]\r\n curr_row = grid[rx]\r\n curr_col = [row[cx] for row in grid]\r\n \r\n if curr_row.count(curr_char) > 1 or curr_col.count(curr_char) > 1:\r\n ignore.add((rx, cx))\r\n\r\ndecrypted = \"\"\r\n\r\nfor rx in range(row_size):\r\n for cx in range(col_size):\r\n if (rx, cx) not in ignore:\r\n decrypted += grid[rx][cx]\r\n \r\nprint(decrypted)\r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\nwood = []\r\nfor i in range(n):\r\n wood.append(input().strip())\r\nrows_count = [[0] * 26 for _ in range(n)]\r\ncols_count = [[0] * 26 for _ in range(m)]\r\n\r\nfor row in range(n):\r\n for item in wood[row]:\r\n rows_count[row][ord(item) - ord('a')] += 1\r\nfor col in range(m):\r\n for row in range(n):\r\n cols_count[col][ord(wood[row][col]) - ord('a')] += 1\r\noutput = \"\"\r\nfor row in range(n):\r\n for col in range(m):\r\n char = wood[row][col]\r\n item = ord(char) - ord('a')\r\n temp = rows_count[row][item] + cols_count[col][item]\r\n if temp == 2:\r\n output += char\r\nprint(output)\r\n", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\nans = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] in s[i][:j] + s[i][j + 1:]:\r\n continue\r\n c = 0\r\n for x in range(n):\r\n if s[x][j] == s[i][j]:\r\n c += 1\r\n if c == 1:\r\n ans += s[i][j]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n row = input()\r\n grid.append(row)\r\n\r\ndef check(row, col,val):\r\n for c in range(len(grid[0])):\r\n if grid[row][c] == val and c != col:\r\n return True\r\n\r\n for r in range(len(grid)):\r\n if grid[r][col] == val and r != row:\r\n return True\r\n\r\n return False\r\n\r\nans = \"\"\r\n\r\nfor r in range(len(grid)):\r\n for c in range(len(grid[0])):\r\n if not check(r, c, grid[r][c]):\r\n ans += grid[r][c]\r\n\r\nprint(ans)", "from collections import Counter\r\norder = list(map(int,input().split()))\r\nrow = order[0]\r\ncol = order[1]\r\nrowDic = [{}] * row\r\ncolDic = [{}] * col\r\n\r\nmatrix = []\r\nfor i in range(row):\r\n matrix.append(list(input()))\r\n rowDic[i] = Counter(matrix[-1]) \r\n\r\nfor i in range(col):\r\n colDic[i] = Counter(list(zip(*matrix))[i])\r\n\r\nfor i in range(row):\r\n for j in range(col):\r\n if rowDic[i][matrix[i][j]] == 1 and colDic[j][matrix[i][j]] == 1:\r\n print(matrix[i][j],end=\"\")\r\n\r\n", "def solve():\r\n n, k = map(int, input().split())\r\n arr = [] \r\n tracker = []\r\n for i in range(n):\r\n arr.append(list(input()))\r\n tracker.append([0]*k)\r\n \r\n for i in range(n):\r\n for j in range(k):\r\n if arr[i].count(arr[i][j]) > 1:\r\n tracker[i][j] = 1 \r\n \r\n cols = list(map(list, zip(*arr)))\r\n for i in range(k):\r\n for j in range(n):\r\n if cols[i].count(arr[j][i]) > 1:\r\n tracker[j][i] = 1\r\n ans=''\r\n for i in range(n):\r\n for j in range(k):\r\n if tracker[i][j] == 0:\r\n ans+=arr[i][j]\r\n return ans \r\n \r\nprint(solve())", "n, m = map(int, input().split())\r\nmatrix = [[0 for _ in range(m)] for _ in range(n)]\r\nans = ''\r\nfor i in range(n):\r\n l = input()\r\n for j in range(m):\r\n matrix[i][j] = l[j]\r\nfor i in range(n):\r\n for j in range(m):\r\n is_dup = False\r\n k = 0\r\n while k < n:\r\n if k != i and matrix[k][j] == matrix[i][j]:\r\n is_dup = True\r\n break\r\n k += 1\r\n\r\n l = 0\r\n while l < m:\r\n if l != j and matrix[i][l] == matrix[i][j]:\r\n is_dup = True\r\n break\r\n l += 1\r\n\r\n if not is_dup:\r\n ans += matrix[i][j]\r\n\r\nprint(ans)\r\n\r\n", "r,c = list(map(int,input().split()))\r\nmat = []\r\n\r\nfor _ in range(r):\r\n mat.append(list(map(lambda x : [x,1], list(input()))))\r\n\r\nfor row in range(r):\r\n \r\n for col in range(c):\r\n now = mat[row][col][0]\r\n for k in range(col + 1,c):\r\n if mat[row][k][0] == now:\r\n mat[row][k][1] = 0\r\n mat[row][col][1] = 0\r\n \r\n for k in range(row + 1,r):\r\n if mat[k][col][0] == now:\r\n mat[k][col][1] = 0\r\n mat[row][col][1] = 0\r\n\r\nans = \"\"\r\nfor row in range(r):\r\n \r\n for col in range(c):\r\n if mat[row][col][1]!=0:\r\n ans+=mat[row][col][0]\r\n \r\nprint(ans)", "\n\nn, m = map(int, input().split())\n\na = []\n\nfor i in range(n):\n a.append(input())\n\nans = ''\n\nfor i in range(n):\n for j in range(m):\n count_row, count_col = 0, 0\n for jj in range(m):\n if a[i][jj] == a[i][j]:\n count_row += 1\n \n for ii in range(n):\n if a[ii][j] == a[i][j]:\n count_col += 1\n \n if count_row == 1 and count_col == 1:\n ans += a[i][j]\n\nprint(ans)", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\nr = [[1] * m for i in range(n)]\r\na = [input() for i in range(n)]\r\nfor i, s in enumerate(a):\r\n p = defaultdict(int)\r\n for c in s:\r\n p[c] += 1\r\n for j, c in enumerate(s):\r\n if p[c] > 1: r[i][j] = 0\r\nb = zip(*a)\r\nfor i, s in enumerate(b):\r\n p = defaultdict(int)\r\n for c in s:\r\n p[c] += 1\r\n for j, c in enumerate(s):\r\n if p[c] > 1: r[j][i] = 0\r\nprint(''.join([c for i, s in enumerate(a) for j, c in enumerate(s) if r[i][j]]))", "n, m = map(int, input().strip().split())\ng = []\nrow = [{} for i in range(n)]\ncol = [{} for i in range(m)]\nfor i in range(n):\n s = input().strip()\n g.append(s)\n for c in s:\n if not c in row[i]:\n row[i][c] = 0\n row[i][c] += 1\n j = 0\n for c in s:\n if not c in col[j]:\n col[j][c] = 0\n col[j][c] += 1\n j += 1\nans = ''\nfor i in range(n):\n j = 0\n for c in g[i]:\n if row[i][c] == 1 and col[j][c] == 1:\n ans += c\n j += 1\nprint(ans)", "row, col = map(int,input().split())\r\narr = []\r\nans = ''\r\nfor i in range(row):\r\n arr.append(list(input()))\r\nfor i in range(row):\r\n for j in range(col):\r\n cross = 0\r\n for k in range(row):\r\n if arr[i][j] == arr[k][j] and i!=k:\r\n cross += 1\r\n for k in range(col):\r\n if arr[i][j] == arr[i][k] and j!=k:\r\n cross += 1\r\n if cross == 0:\r\n ans +=arr[i][j]\r\n \r\n\r\n\r\nprint(ans)", "X = list(map(int, input().split()))\r\nSentence, Answer = \"\", \"\"\r\nfor i in range(X[0]):\r\n Sentence += input()\r\nfor i in range(X[0]):\r\n Temp = Sentence[i * X[1]:(i + 1) * X[1]]\r\n for j in range(X[1]):\r\n if Temp.count(Temp[j]) == 1 and Sentence[j::X[1]].count(Temp[j]) == 1:\r\n Answer += Temp[j]\r\nprint(Answer)", "from collections import Counter\r\n\r\nn,m = map(int,input().split())\r\n\r\nrows = []\r\ncols = [{} for i in range(m)]\r\ngrid = []\r\n\r\nfor i in range(n):\r\n s = input()\r\n rows.append(Counter(s))\r\n grid.append(list(s))\r\n\r\n for j in range(m):\r\n if s[j] not in cols[j]:\r\n cols[j][s[j]] = 1\r\n\r\n else:\r\n cols[j][s[j]] += 1\r\n\r\nres = \"\"\r\nfor row in range(n):\r\n for col in range(m):\r\n ele = grid[row][col]\r\n if rows[row][ele] == 1 and cols[col][ele] == 1:\r\n res += ele\r\n\r\nprint(res)\r\n", "n,m=map(int,input().split())\r\na=[input() for i in range(n)]\r\nx=[dict() for i in range(n)]\r\ny=[dict() for i in range(m)]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] not in x[i]:\r\n\t\t\tx[i][a[i][j]]=1\r\n\t\telse:\r\n\t\t\tx[i][a[i][j]]+=1\r\n\t\tif a[i][j] not in y[j]:\r\n\t\t\ty[j][a[i][j]]=1\r\n\t\telse:\r\n\t\t\ty[j][a[i][j]]+=1\r\n\r\nans=\"\"\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif x[i][a[i][j]]==1 and y[j][a[i][j]]==1:\r\n\t\t\tans+=a[i][j]\r\nprint(ans)", "s = input().split()\r\nn, m = int(s[0]), int(s[1])\r\nS = []\r\nT = []\r\nfor i in range(0, n):\r\n s = input()\r\n S.append(list(s))\r\n T.append(list(s))\r\n\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n flag = False\r\n\r\n for p in range(i + 1, n):\r\n if S[i][j] == S[p][j]:\r\n flag = True\r\n T[p][j] = '0'\r\n\r\n for p in range(j + 1, m):\r\n if S[i][j] == S[i][p]:\r\n flag = True\r\n T[i][p] = '0'\r\n if flag:\r\n T[i][j] = '0'\r\n\r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n if T[i][j] != '0':\r\n print(T[i][j], end='')\r\nprint()", "# 90B\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef index(ch):\r\n return ord(ch) - 97\r\n\r\n\r\nn, m = map(int, stdin.readline().strip().split())\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append(stdin.readline().strip())\r\n\r\na, res = [0] * 26, [[''] * m for __ in range(n)]\r\nfor j in range(m):\r\n for i in range(n):\r\n a[index(grid[i][j])] += 1\r\n for i in range(n):\r\n ind = index(grid[i][j])\r\n res[i][j] = grid[i][j] if a[ind] == 1 and res[i][j] != '.' else '.'\r\n a[ind] = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n a[index(grid[i][j])] += 1\r\n for j in range(m):\r\n ind = index(grid[i][j])\r\n res[i][j] = grid[i][j] if a[ind] == 1 and res[i][j] != '.' else '.'\r\n a[ind] = 0\r\n\r\nst = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n if res[i][j] != '.':\r\n st += res[i][j]\r\nprint(st)", "n, m = map(int, input().split())\r\ns = [list(input()) for i in range(n)]\r\nr = [[1 for i in range(m)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if r[i][j] == 0: continue\r\n \r\n for k in range(m):\r\n if j != k and s[i][j] == s[i][k]:\r\n r[i][j] = 0\r\n r[i][k] = 0\r\n for k in range(n):\r\n if i != k and s[i][j] == s[k][j]: \r\n r[i][j] = 0\r\n r[k][j] = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if r[i][j] == 1: print(s[i][j], end = '')\r\n", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nHomura = [int(i) for i in input().split()]\r\nm = Homura[0]\r\nn = Homura[1]\r\n\r\ngrid = []\r\nfor i in range(m):\r\n\tgrid.append(input())\r\n\r\nans = ''\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\t#Number of instances in the row\r\n\t\trow = grid[i].count(grid[i][j])\r\n\t\t#Number of instances in the column\r\n\t\tcol = 0\r\n\t\tfor k in range(m):\r\n\t\t\tcol += grid[k][j] == grid[i][j]\r\n\r\n\t\tif row == 1 and col == 1:\r\n\t\t\tans += grid[i][j]\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\ngrid = []\r\nres = \"\"\r\n\r\nfor i in range(n):\r\n chars = list(input())\r\n grid.append(chars)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n flag = False\r\n for k in range(n):\r\n if i != k and grid[i][j] == grid[k][j]:\r\n flag = True\r\n break\r\n if not flag:\r\n for k in range(m):\r\n if j != k and grid[i][j] == grid[i][k]:\r\n flag = True\r\n break\r\n if not flag:\r\n res += grid[i][j]\r\nprint(res)\r\n \t\t \t\t\t\t\t \t \t \t\t\t \t\t\t", "from collections import defaultdict\r\n\r\nn,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append(input())\r\n\r\nremoved = {}\r\n\r\ncolSets = [set() for _ in range(m)]\r\nfor i in range(n):\r\n rowSet = set()\r\n for j in range(m):\r\n if grid[i][j] not in removed:\r\n removed[grid[i][j]] = [set(),set()]\r\n if grid[i][j] in rowSet:\r\n removed[grid[i][j]][0].add(i)\r\n if grid[i][j] in colSets[j]:\r\n removed[grid[i][j]][1].add(j)\r\n colSets[j].add(grid[i][j])\r\n rowSet.add(grid[i][j])\r\n\r\ndecrypted = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if i in removed[grid[i][j]][0]:\r\n continue\r\n if j in removed[grid[i][j]][1]:\r\n continue\r\n decrypted.append(grid[i][j])\r\n \r\nprint(\"\".join(decrypted))\r\n \r\n\r\n ", "#import sys\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\n#import math\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nrow, col = invr()\r\nmatrix = []\r\ncount_row = []\r\ncount_col = []\r\n\r\nfor _ in range(row):\r\n newR = input()\r\n matrix.append(newR)\r\n\r\nfor i in range(row):\r\n count_row.append(Counter(matrix[i]))\r\n for j in range(col):\r\n if len(count_col) <= j:\r\n count_col.append(Counter(matrix[i][j]))\r\n else:\r\n count_col[j].update(Counter(matrix[i][j]))\r\nans = \"\"\r\nfor i in range(row):\r\n for j in range(col):\r\n if count_row[i][matrix[i][j]] > 1 or count_col[j][matrix[i][j]] > 1:\r\n continue\r\n ans += matrix[i][j]\r\nprint(ans)\r\n \r\n \r\n ", "from collections import Counter\r\n\r\n\r\nm, n = list(map(int, input().split()))\r\ncrossword = []\r\nfor _ in range(m):\r\n row = input()\r\n crossword.append(row)\r\nrows = [{}]*m\r\ncols = [{}]*n\r\nfor r, row in enumerate(crossword):\r\n rows[r] = Counter(row)\r\nfor c, col in enumerate(zip(*crossword)):\r\n cols[c] = Counter(col)\r\n\r\nans = []\r\nfor r, row in enumerate(crossword):\r\n for c, val in enumerate(row):\r\n if rows[r][val] == 1 and cols[c][val] == 1:\r\n ans.append(val)\r\nprint(\"\".join(ans))", "from collections import Counter\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n grid = [list(input()) for _ in range(n)]\r\n\r\n cnt_row = []\r\n cnt_col = []\r\n for r in range(n):\r\n cnt_row.append(Counter(grid[r]))\r\n\r\n for c in range(m):\r\n col = [grid[r][c] for r in range(n)]\r\n cnt_col.append(Counter(col))\r\n\r\n res = []\r\n for r in range(n):\r\n for c in range(m):\r\n cur = grid[r][c]\r\n if cnt_row[r][cur] + cnt_col[c][cur] == 2:\r\n res.append(cur)\r\n \r\n print(''.join(res))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=map(int,input().split())\r\nar=[]\r\nfor i in range(n):\r\n ar.append(input())\r\nbck=[\"\"]*m\r\nfor i in range(n):\r\n for j in range(m):\r\n bck[j]+=ar[i][j]\r\nfor i in range(n):\r\n for j in range(m):\r\n can=1\r\n if(ar[i].count(ar[i][j])>1):can=0\r\n if(bck[j].count(ar[i][j])>1):can=0\r\n if(can):print(ar[i][j],end=\"\")\r\n ", "#test1=[['c','b','a'],['b','c','d'],['c','b','c']]\r\ntest1=['cba','bcd','cbc']\r\ndef african_crossword(n,m,grid):\r\n encrypted = \"\"\r\n for i in range(n):\r\n for j in range(m):\r\n is_encrypted=True\r\n for k in range(n):\r\n if grid[i][j]==grid[k][j] and k!=i:\r\n is_encrypted=False\r\n break\r\n for h in range(m):\r\n if grid[i][j]==grid[i][h] and h!=j:\r\n is_encrypted=False\r\n break\r\n if is_encrypted==True:\r\n encrypted+=grid[i][j]\r\n return (encrypted)\r\n\r\n#print (african_crossword(3,3,test1))\r\n\r\nn,m=map(int,input().split())\r\ngrid=[]\r\nfor i in range(n):\r\n grid.append(input())\r\n\r\nprint (african_crossword(n,m,grid))", "#ROUNIAAUDI\r\ng,g1=map(int,input().split())\r\nf=[]\r\nfor i in range(g):\r\n g6=input()\r\n f.append(g6)\r\n#print(f)\r\nfor t in range(g):\r\n for t1 in range(g1):\r\n s=f[t][t1]\r\n # print(s,end=\" \")\r\n qq=True\r\n for t3 in range(g):\r\n\r\n if s == f[t3][t1] and t3!= t:\r\n qq= False\r\n for t4 in range(g1):\r\n if s == f[t][t4] and t4 != t1:\r\n qq = False\r\n if qq:\r\n print(s,end='')\r\n\r\n", "n, m = map(int, input().split())\r\n\r\ndict_row = {}\r\ndict_col = {}\r\nalist = []\r\nfor row in range(n):\r\n temp = input()\r\n alist.append(temp)\r\n dict_row[row] = temp\r\n\r\nfor i in range(m):\r\n concar = \"\"\r\n for j in range(n):\r\n concar += alist[j][i]\r\n dict_col[i] = concar\r\nans = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n cnt = 0\r\n for k in dict_col[j]:\r\n if alist[i][j] == k:\r\n cnt += 1\r\n for l in dict_row[i]:\r\n if alist[i][j] == l:\r\n cnt += 1\r\n \r\n if cnt <= 2:\r\n ans += alist[i][j]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\nremovables = [[False for _ in range(m)] for _ in range(n)]\r\ngrid = [[] for _ in range(n)]\r\nfor i in range(n):\r\n word = str(input())\r\n for j in range(m):\r\n grid[i].append(word[j])\r\n\r\nfor i in range(n):\r\n unique = {}\r\n for j in range(m):\r\n char = grid[i][j]\r\n if char in unique:\r\n removables[i][j] = True\r\n x = unique[char][0]\r\n y = unique[char][1]\r\n removables[x][y] = True\r\n else:\r\n unique[char] = (i, j)\r\n\r\nfor j in range(m):\r\n unique = {}\r\n for i in range(n):\r\n char = grid[i][j]\r\n if char in unique:\r\n removables[i][j] = True\r\n x = unique[char][0]\r\n y = unique[char][1]\r\n removables[x][y] = True\r\n else:\r\n unique[char] = (i, j)\r\n \r\nresult = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if removables[i][j] == False:\r\n result.append(grid[i][j])\r\nprint(''.join(result))\r\n", "from collections import Counter\r\n\r\nnum_rows, num_cols = map(int, input().split())\r\n\r\nmatrix = []\r\ncolumn_wise = [[] for _ in range(num_cols)]\r\nfor _ in range(num_rows):\r\n string = input()\r\n row = []\r\n for index in range(num_cols):\r\n row.append(string[index])\r\n column_wise[index].append(string[index])\r\n matrix.append(row)\r\n\r\ncolumn_count = []\r\nfor i in range(num_cols):\r\n count = Counter(column_wise[i])\r\n column_count.append(count)\r\n\r\nresult = []\r\nfor row in range(num_rows):\r\n row_count = Counter(matrix[row])\r\n for col in range(num_cols):\r\n if row_count[matrix[row][col]] == 1 and column_count[col][matrix[row][col]] == 1:\r\n result.append(matrix[row][col])\r\n\r\nprint(\"\".join(result))", "def count_letter_in_column(string, column, crosswords):\r\n columns = []\r\n for row in crosswords:\r\n columns.append(row[column])\r\n return columns.count(string)\r\n\r\nm,n = input().split(\" \")\r\n\r\nm = int(m)\r\nn = int(n)\r\ncrosswords = []\r\nresult = []\r\ns_result = \"\"\r\nfor i in range(m):\r\n crosswords.append(list(input()))\r\n\r\n# process crossword\r\nfor row in crosswords:\r\n item = []\r\n for i in range(n):\r\n if row.count(row[i]) == 1 and count_letter_in_column(row[i], i, crosswords) == 1:\r\n item.append(row[i])\r\n result.append(item)\r\n\r\nfor row in result:\r\n s_result += \"\".join(row)\r\n\r\nprint(s_result)\r\n", "n, m = [int(num) for num in input().split()]\r\n\r\ngrid = []\r\n\r\nfor _ in range(n):\r\n grid.append(list(input()))\r\n\r\ncrossedCells = set()\r\n\r\nfor row in range(n):\r\n lettersInRow = {}\r\n\r\n for col in range(m):\r\n if grid[row][col] not in lettersInRow:\r\n lettersInRow[grid[row][col]] = row*m + col\r\n\r\n else:\r\n crossedCells.add(lettersInRow[grid[row][col]])\r\n crossedCells.add(row*m + col)\r\n\r\nfor col in range(m):\r\n lettersInCol = {}\r\n\r\n for row in range(n):\r\n if grid[row][col] not in lettersInCol:\r\n lettersInCol[grid[row][col]] = row*m + col\r\n\r\n else:\r\n crossedCells.add(lettersInCol[grid[row][col]])\r\n crossedCells.add(row*m + col)\r\n\r\nans = \"\"\r\nfor rowIdx in range(n):\r\n for colIdx in range(m):\r\n if (rowIdx*m + colIdx) not in crossedCells:\r\n ans += grid[rowIdx][colIdx]\r\n \r\nprint(ans) \r\n\r\n\r\n\r\n\r\n\r\n", "N , M = map(int,input().split())\r\nletters = [] \r\noutput = []\r\n\r\nfor i in range(N):\r\n values = (input())\r\n letters.append(values)\r\n\r\ndef checker(a, value, col, row):\r\n\r\n colStr = []\r\n rowStr = []\r\n for i in range(M):\r\n if i == col:\r\n continue\r\n rowStr.append(letters[row][i])\r\n rowStr = \"\".join(rowStr)\r\n \r\n if a in rowStr: \r\n return False\r\n\r\n\r\n\r\n \r\n for j in range(N):\r\n if j == row:\r\n continue\r\n colStr.append(letters[j][col])\r\n\r\n \r\n colStr = \"\".join(colStr)\r\n \r\n\r\n if a in colStr:\r\n return False\r\n return True\r\n\r\nfor i in range(N):\r\n for j in range(M):\r\n currValue = letters[i][j]\r\n if not checker(currValue,letters[i],j,i):\r\n continue\r\n else:\r\n output.append(currValue)\r\n\r\noutput = \"\".join(output)\r\nprint(output)\r\n\r\n\r\n \r\n\r\n", "def african_crossword():\r\n n, m = map(int, input().split())\r\n grid = [list(input()) for _ in range(n)]\r\n enc_string = ''\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n found_duplicate = False\r\n for k in range(n):\r\n if k != i and grid[k][j] == grid[i][j]:\r\n found_duplicate = True\r\n break\r\n if not found_duplicate:\r\n for k in range(m):\r\n if k != j and grid[i][k] == grid[i][j]:\r\n found_duplicate = True\r\n break\r\n if not found_duplicate:\r\n enc_string += grid[i][j]\r\n\r\n return enc_string\r\n\r\nif __name__ == '__main__':\r\n print(african_crossword())\r\n", "n,m = map(int, input().split())\nmat = []\nfor i in range(n):\n row = list(input())\n mat.append(row)\n\nans = []\ncolumn = []\nfor i in range(m):\n col = []\n for j in range(n):\n col.append(mat[j][i])\n column.append(col)\n \nfor i in range(n):\n for j in range(m):\n if mat[i].count(mat[i][j]) > 1:\n continue\n if column[j].count(mat[i][j]) > 1:\n continue\n else:\n ans.append(mat[i][j])\nprint(\"\".join(ans))\n", "matrix = [list(e.strip('\\n')) for e in [*open(0)]][1:]\r\ns = set()\r\nfor i in range(len(matrix)):\r\n for j in range(len(matrix[i])):\r\n if matrix[i].count(matrix[i][j])>=2:\r\n for k in range(len(matrix[i])):\r\n if matrix[i][k] == matrix[i][j]:\r\n s.add((i,k))\r\nmatrix = [e for e in zip(*matrix)]\r\nfor i in range(len(matrix)):\r\n for j in range(len(matrix[i])):\r\n if matrix[i].count(matrix[i][j])>=2:\r\n for k in range(len(matrix[i])):\r\n if matrix[i][k] == matrix[i][j]:\r\n s.add((k,i))\r\nmatrix = [e for e in zip(*matrix)]\r\nfor i in range(len(matrix)):\r\n for j in range(len(matrix[i])):\r\n if (i,j) not in s:\r\n print(matrix[i][j],end=\"\")", "n = list(map(int,input().split()))\r\nmat = []\r\nfor i in range(n[0]):\r\n word = input()\r\n mat.append(word)\r\ndef checkword(x, i, j, mat):\r\n row = 0\r\n for r in range(len(mat)):\r\n if mat[r][j] == x:\r\n row += 1\r\n if row > 1:\r\n return False\r\n col = 0\r\n for c in range(len(mat[0])):\r\n if mat[i][c] == x:\r\n col += 1\r\n if col > 1:\r\n return False\r\n return True\r\nans = \"\"\r\nfor i in range(n[0]):\r\n for j in range(n[1]):\r\n x = mat[i][j]\r\n if checkword(x,i,j,mat):\r\n ans+=x\r\nprint(ans)", "n, m = map(int, input().split())\r\nmatrix = []\r\nfor r in range(n):\r\n matrix.append(list(input()))\r\n\r\ntmatrix = list(zip(*matrix))\r\n\r\nfrom collections import Counter\r\nans = ''\r\nfor r in range(n):\r\n for c in range(m):\r\n curr = matrix[r][c]\r\n cr = Counter(matrix[r])\r\n cc = Counter(tmatrix[c])\r\n if cr[curr] > 1: \r\n continue\r\n elif cc[curr] > 1:\r\n continue\r\n else:\r\n ans += matrix[r][c]\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "rows,cols=map(int,input().split())\r\ngrid=[]\r\nans=[]\r\nfor i in range(rows):\r\n grid.append(input())\r\n\r\ndef checkFourDirections(row,col):\r\n found=False\r\n directions=[[-1,0],[0,1],[1,0],[0,-1]]\r\n for x,y in directions:\r\n relativeX=col+x\r\n relativeY=row+y\r\n while 0<=relativeX<cols and 0<=relativeY<rows:\r\n if grid[relativeY][relativeX]==grid[row][col]:\r\n found=True\r\n break\r\n relativeX+=x\r\n relativeY+=y\r\n if found:\r\n break\r\n return found\r\nfor row in range(rows):\r\n for col in range(cols):\r\n if not(checkFourDirections(row,col)):\r\n ans.append(grid[row][col])\r\nprint(\"\".join(ans))\r\n\r\n \r\n\r\n", "n, m = map(int, input().split())\r\nmatrix = []\r\n\r\nfor _ in range(n):\r\n s = str(input())\r\n matrix.append([i for i in s])\r\n\r\nres = []\r\nfor r in range(n):\r\n for c in range(m):\r\n cnt = 0\r\n for i in range(m):\r\n if matrix[r][c] == matrix[r][i]:\r\n cnt += 1\r\n for j in range(n):\r\n if matrix[r][c] == matrix[j][c]:\r\n cnt += 1\r\n \r\n if cnt == 2:\r\n res.append(matrix[r][c])\r\n\r\nprint(\"\".join(res))", "n, m = map(int, input().split())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n\tl.append(input())\r\n\r\ncheck = True\r\nans = []\r\n\r\nfor i in range(len(l)):\r\n\tfor j in range(len(l[i])):\r\n\t\tfor k in range(n):\r\n\t\t\tif (l[i][j] == l[k][j] and i != k) or (l[i].count(l[i][j]) > 1 ):\r\n\t\t\t\tcheck = False\r\n\t\t\t\tbreak\r\n\t\tif check:\r\n\t\t\tans.append(l[i][j])\r\n\t\tcheck = True\r\n\r\n\r\nprint(\"\".join(ans))\r\n", "n, m = list(map(int, input().split()))\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append(list(input()))\r\n\r\nrows_dict = {i: {} for i in range(n)}\r\ncols_dict = {j: {} for j in range(m)}\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n c = grid[i][j]\r\n if c in rows_dict[i]:\r\n rows_dict[i][c] += 1\r\n else:\r\n rows_dict[i][c] = 1\r\n \r\n if c in cols_dict[j]:\r\n cols_dict[j][c] += 1\r\n else:\r\n cols_dict[j][c] = 1\r\n\r\nans = []\r\nfor i in range(n):\r\n for j in range(m):\r\n c = grid[i][j]\r\n if rows_dict[i][c] == 1 and cols_dict[j][c] == 1:\r\n ans.append(c)\r\n\r\ndec_ans = \"\".join(ans)\r\nprint(dec_ans)\r\n", "from collections import defaultdict\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\n\r\ncol_set = defaultdict(int)\r\nrow_set = defaultdict(int)\r\n\r\ngrid = []\r\nfor i in range(n):\r\n s = input()\r\n grid.extend(list(s))\r\ns = len(grid)\r\n#print(grid)\r\n#works find\r\ni = j = 0\r\nfor k in range(s):\r\n if k % m == 0:\r\n j = 0\r\n i += 1\r\n col_set[f'{grid[k]}{j}'] += 1\r\n row_set[f'{grid[k]}{i}'] += 1\r\n j += 1\r\n#print(col_set, row_set)\r\n#works find\r\ni = j = 0\r\nfor k in range(s):\r\n \r\n if k % m == 0:\r\n j = 0\r\n i += 1\r\n key_row = f'{grid[k]}{i}'\r\n key_column = f'{grid[k]}{j}'\r\n #3 print(k, i, j )\r\n if row_set[key_row] > 1 or col_set[key_column] > 1:\r\n grid[k] = 'D'\r\n j += 1\r\n \r\n#print(grid)\r\noutput = \"\"\r\ni = j = 0\r\nfor k in range(s):\r\n if k % m == 0:\r\n j = 0\r\n i += 1\r\n if grid[k] != 'D':\r\n output += f'{grid[k]}'\r\nprint(output)", "n,m = map(int,input().split())\r\narr,res = [],[]\r\nfor _ in range(n):\r\n arr.append(input())\r\n \r\nfor row in range(n):\r\n for col in range(m):\r\n temp = arr[row].count(arr[row][col])\r\n if temp>1:\r\n continue\r\n count = 0\r\n \r\n for ind in range(n):\r\n if arr[ind][col]==arr[row][col]:\r\n count += 1\r\n \r\n if count==1:\r\n res.append(arr[row][col])\r\n\r\nprint(\"\".join(res)) ", "data = input().split()\n\nN, M = int(data[0]), int(data[1])\n\ncrossword_t = []\nfor _ in range(N):\n crossword_t.append(list(input()))\n\nanswer = ''\n\nfor i in range(N):\n for j in range(M):\n row, col = crossword_t[i], [r[j] for r in crossword_t]\n letter_cr = row.count(crossword_t[i][j])\n letter_ccl = col.count(crossword_t[i][j])\n if ( letter_cr == 1 and letter_ccl == 1 ):\n answer = answer + crossword_t[i][j]\n \n\nprint(answer)\n", "from collections import defaultdict\r\n\r\nrow = defaultdict(int)\r\ncol = defaultdict(int)\r\n\r\nn,m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(input())\r\n for j in range(m):\r\n row[(i,grid[i][j])] += 1\r\n col[(j, grid[i][j])] += 1\r\nans = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if row[(i, grid[i][j])] == 1 and col[(j, grid[i][j])] == 1:\r\n ans.append(grid[i][j])\r\nprint(\"\".join(ans))\r\n", "# python3\r\nimport sys, threading, os.path\r\nimport string\r\nimport collections, heapq, math, bisect\r\n\r\nsys.setrecursionlimit(10 ** 6)\r\nthreading.stack_size(2 ** 27)\r\n\r\n\r\ndef main():\r\n if os.path.exists('in.txt'):\r\n input = open('in.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n # --------------------------------INPUT---------------------------------\r\n n1, n2 = list(map(int, input.readline().split()))\r\n\r\n data = []\r\n for i in range(n1):\r\n data.append(list(str(input.readline().rstrip('\\n'))))\r\n\r\n result = ''\r\n\r\n for lis in data:\r\n for i, x in enumerate(lis):\r\n count = 0\r\n for j in range(n1):\r\n if data[j][i] == x:\r\n count += 1\r\n if count > 1:\r\n break\r\n\r\n for k in range(n2):\r\n if lis[k] == x:\r\n count += 1\r\n if count > 2:\r\n break\r\n\r\n if count == 2:\r\n result += x\r\n\r\n output = result\r\n # -------------------------------OUTPUT----------------------------------\r\n if os.path.exists('out.txt'):\r\n open('out.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n# threading.Thread(target=main).start()\r\n", "import re\n[n, m], rows = [int(i) for i in input().split()], []\ncols = [''] * m\nfor i in range(n):\n rows.append(input())\nfor row in rows:\n for i, char in enumerate(row):\n cols[i] += char\nans = ''\nfor i, row in enumerate(rows):\n for j, char in enumerate(row):\n if row.count(char) <= 1 and cols[j].count(char) <= 1:\n ans += char\nprint(ans)\n", "def scan (x , y , g , c):\n for i in range(0,len(g[0])):\n if g[x][i] == c and i!=y:\n return True\n for i in range(0,len(g)) :\n if g[i][y] == c and i!=x:\n return True\n return False\ns=''\nsp = lambda a : [i for i in a]\nn,m = [int(i) for i in input().split()]\ng = [sp(input()) for i in range(n)]\nfor i in range(n):\n for j in range(m):\n if not scan(i,j,g,g[i][j]):\n s+=g[i][j]\n\n\nprint(s)\n", "from collections import Counter, defaultdict\r\nn, m = map(int, input().split())\r\n\r\npuzzle = []\r\nrow_count = {}\r\ncol_count = defaultdict(defaultdict)\r\nfor i in range(n):\r\n cur_row = list(input())\r\n row_count[i] = Counter(cur_row)\r\n puzzle.append(cur_row)\r\n\r\nfor i in range(m):\r\n temp = defaultdict(int)\r\n for j in range(n):\r\n temp[puzzle[j][i]] += 1\r\n col_count[i] = temp\r\n\r\nans = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n if row_count[i][puzzle[i][j]] + col_count[j][puzzle[i][j]] == 2 :\r\n ans += puzzle[i][j]\r\n \r\nprint(ans)\r\n \r\n ", "row,col=list(map(int,input().split()))\r\nlst=[]\r\nfor i in range(row):\r\n string=input()\r\n lst.append(string)\r\nfinal=''\r\ni=0\r\n\r\nwhile i<row:\r\n j=0\r\n while j<col:\r\n if lst[i].count(lst[i][j])>1:\r\n j+=1\r\n continue\r\n else:\r\n tempo=''\r\n for k in range(row):\r\n tempo+=lst[k][j]\r\n \r\n if tempo.count(lst[i][j])==1:\r\n final+=lst[i][j]\r\n j+=1\r\n i+=1\r\nprint(final)", "n,m = map(int,input().split())\r\ndct = {}\r\nlst = []\r\nans = \"\"\r\nfor i in range(n):\r\n str1 = input()\r\n lst.append(str1)\r\nfor t in range(n):\r\n dct = {}\r\n for j in range(m):\r\n if lst[t][j] in dct.keys():\r\n dct[lst[t][j]] +=1\r\n else:\r\n dct[lst[t][j]] = 1\r\n for h in range(m):\r\n if dct[lst[t][h]] == 1:\r\n check = 0\r\n for k in range(n):\r\n if lst[k][h] == lst[t][h] and k!=t:\r\n check = 1\r\n break\r\n if check == 0:\r\n ans += lst[t][h]\r\nprint(ans)", "n = list(map(int, input().split()))\r\nwords = []\r\n\r\nfor i in range(n[0]):\r\n word = input()\r\n words.append(word)\r\ncolWords = list(zip(*words))\r\n\r\nword = []\r\nfor i in range(len(words)):\r\n for j in range(len(words[i])):\r\n if words[i][j] in words[i][:j]+words[i][j+1:] or words[i][j] in colWords[j][:i]+colWords[j][i+1:]:\r\n continue\r\n else: \r\n word.append(words[i][j])\r\n\r\nword = ''.join(map(str, word))\r\nprint(word)\r\n", "n,m=map(int,input().split())\r\ns=[input() for i in range(n)]\r\nans=\"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] in s[i][:j]+s[i][j+1:]:\r\n continue\r\n c=0\r\n for x in range(n):\r\n if s[x][j]==s[i][j]:\r\n c+=1\r\n if c==1:\r\n ans+=s[i][j]\r\nprint(ans)\r\n \r\n", "import copy\r\nn , m = list(map(int, input().split()))\r\nmatrix = []\r\nfor _ in range(n):\r\n arr = input()\r\n #arr = list(input().split())\r\n matrix.append(list(arr))\r\nmatrix2 = copy.deepcopy(matrix)\r\nfor i in range(len(matrix)):\r\n for j in range(len(matrix[0])):\r\n cur = matrix[i][j]\r\n \r\n for col in range(len(matrix[0])):\r\n if col != j and matrix2[i][col] == cur:\r\n matrix2[i][j] = 0\r\n matrix2[i][col] = 0\r\n for row in range(len(matrix)):\r\n if row != i and matrix2[row][j] == cur:\r\n matrix2[row][j] = 0\r\n matrix2[i][j] = 0\r\n \r\nres = \"\"\r\n\r\nfor i in range(len(matrix)):\r\n for j in range(len(matrix[0])):\r\n if matrix2[i][j] != 0:\r\n res += matrix2[i][j]\r\n \r\nprint(res)\r\n", "import math\r\nimport string\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n data = [list(input()) for i in range(n)]\r\n collector = \"\"\r\n for i in range(n):\r\n for j in range(m):\r\n target = data[i][j]\r\n duplicate_found = False\r\n for k in range(n):\r\n if data[k][j] == target and k != i:\r\n duplicate_found = True\r\n for l in range(m):\r\n if data[i][l] == target and j != l:\r\n duplicate_found = True\r\n if not duplicate_found:\r\n collector += target\r\n print(collector)\r\n\r\nmain_function()\r\n", "from collections import defaultdict\n\n\nif __name__ == \"__main__\":\n rows, cols = map(int, input().split())\n\n grid = []\n for row in range(rows):\n grid.append(list(input()))\n \n cols_freq = []\n rows_freq = []\n\n for r in range(rows):\n rows_freq.append(defaultdict(int))\n for c in range(cols):\n rows_freq[-1][grid[r][c]] += 1\n\n for c in range(cols):\n cols_freq.append(defaultdict(int))\n for r in range(rows):\n cols_freq[-1][grid[r][c]] += 1\n \n answer = []\n for row in range(rows):\n for col in range(cols):\n repeated = False\n if rows_freq[row][grid[row][col]] > 1:\n repeated = True\n if cols_freq[col][grid[row][col]] > 1:\n repeated = True\n \n if not repeated:\n answer.append(grid[row][col])\n \n print(\"\".join(answer))\n", "from collections import defaultdict\r\nsizes = list(map(int, input().split()))\r\nmatrix = [ ]\r\nfor _ in range(sizes[0]):\r\n matrix.append(list(input()))\r\n\r\ncol_dict = defaultdict(lambda : [0] * 26)\r\nrow_dict = defaultdict(lambda : [0] * 26)\r\n\r\nfor row_indx in range(len(matrix)):\r\n for col_indx in range(len(matrix[0])):\r\n ch = matrix[row_indx][col_indx]\r\n col_dict[col_indx][ord(ch) - 97] += 1\r\n row_dict[row_indx][ord(ch) - 97] += 1\r\n\r\nfor row_indx in range(len(matrix)):\r\n for col_indx in range(len(matrix[0])):\r\n ch = matrix[row_indx][col_indx]\r\n if col_dict[col_indx][ord(ch) - 97] > 1 or row_dict[row_indx][ord(ch) - 97] > 1:\r\n matrix[row_indx][col_indx] = 0\r\nresult = \"\"\r\n\r\nfor row in matrix:\r\n for element in row:\r\n if element != 0:\r\n result += element\r\nprint(result) ", "n, m = map(int, input().split())\r\ntable = []\r\nfor _ in range(n):\r\n\tline = [i for i in input()]\r\n\ttable.append(line)\r\nans = ''\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tcnt = 0\r\n\t\tcur = table[i][j]\r\n\t\tfor ii in range(n):\r\n\t\t\tif cur in table[ii][j] and ii != i:\r\n\t\t\t\ttable[ii][j] = '.' + cur\r\n\t\t\t\tcnt += 1\r\n\t\tfor jj in range(m):\r\n\t\t\tif cur in table[i][jj] and jj != j:\r\n\t\t\t\ttable[i][jj] = '.' + cur\r\n\t\t\t\tcnt += 1\r\n\t\tif cnt > 0:\r\n\t\t\ttable[i][j] = '.' + cur\r\n\t\telif '.' not in table[i][j]:\r\n\t\t\tans += table[i][j]\r\nprint(ans)", "n, m = map(int, input().split())\r\na = [[_ for _ in input()] for __ in range(n)]\r\nh = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n f = a[i][j]\r\n if a[i].count(f) > 1:\r\n continue\r\n if [a[_][j] for _ in range(n)].count(f) > 1:\r\n continue\r\n h += f\r\nprint(h)\r\n", "# LUOGU_RID: 104833919\nn, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\nprint(''.join([s[i][j] for i in range(n) for j in range(m) if s[i].count(\r\n s[i][j]) == 1 and not any(s[k][j] == s[i][j] and i != k for k in range(n))]))\r\n", "'''\r\n Name: African Crossword\r\n Link: https://codeforces.com/problemset/problem/90/B\r\n'''\r\nimport copy\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n crossword = []\r\n for _ in range(n):\r\n line = input()\r\n crossword.append(list(line))\r\n solution = copy.deepcopy(crossword)\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n ch = crossword[i][j]\r\n # In row\r\n for x in range(m):\r\n if ch == crossword[i][x] and x != j:\r\n solution[i][x] = ''\r\n for x in range(n):\r\n if ch == crossword[x][j] and x != i:\r\n solution[x][j] = ''\r\n for i in range(n):\r\n for j in range(m):\r\n print(solution[i][j], end='')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\nt=[]\r\n\r\n\r\nw=[]\r\n\r\nfor k in range(n):\r\n a=list(input())\r\n t.append(a)\r\n\r\n\r\nfor j in range(m):\r\n s=[]\r\n for i in range(n):\r\n s.append(t[i][j])\r\n w.append(s)\r\n\r\np=''\r\nfor g in range(n):\r\n l=0\r\n o=[]\r\n x=[]\r\n for h in range(m):\r\n d=t[g][h]\r\n l=t[g].count(d)+w[h].count(d)-2\r\n if l>0:\r\n x.append(d)\r\n if d in x:\r\n t[g][h]='1'\r\n else:\r\n o.append(d)\r\n\r\n p+=''.join(o)\r\n \r\n \r\n\r\nprint(p)\r\n\r\n \r\n\r\n\r\n", "m, n = map(int, input().split())\r\n\r\nRows = []\r\ncolumns = []\r\nDiag = []\r\n\r\nfor index in range(m):\r\n Rows.append(list(input()))\r\n Diag.append([0]*n)\r\n\r\nfor row in range(m):\r\n for col in range(n):\r\n if Rows[row].count(Rows[row][col]) > 1:\r\n Diag[row][col] = \"1\"\r\n\r\nfor col in zip(*Rows):\r\n columns.append(col)\r\n \r\nfor col in range(n):\r\n for row in range(m):\r\n if columns[col].count(columns[col][row]) > 1:\r\n Diag[row][col] = \"1\"\r\n\r\nanswer = \"\"\r\n\r\nfor row in range(m):\r\n for col in range(n):\r\n if Diag[row][col] == 0:\r\n Diag[row][col] = Rows[row][col]\r\n answer += Rows[row][col]\r\n\r\nprint(answer)", "#codeforces\r\nif __name__==\"__main__\":\r\n rows,col=map(int,input().split())\r\n li=[]\r\n ans=\"\"\r\n for i in range(rows):\r\n s=input()\r\n li.append(s)\r\n for i in range(rows):\r\n for j in range(col):\r\n ind=li[i].index(li[i][j])\r\n if li[i].count(li[i][j])==1:\r\n count=0\r\n for k in range(rows):\r\n if li[k][ind]==li[i][j] and k!=i:\r\n count=count+1\r\n if count==0:\r\n ans+=li[i][j]\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\nn, m = list(map(int, input().split()))\r\ncrossword = []\r\nfor n_ in range(n):\r\n row = [*input()]\r\n crossword.append(row)\r\nrows = defaultdict(set)\r\nfor i in range(n):\r\n j = 0\r\n while j < m:\r\n if crossword[i].count(crossword[i][j]) > 1:\r\n rows [i].add(crossword[i][j])\r\n j+=1\r\n i+=1\r\nj = 0\r\ncols =defaultdict(set)\r\nwhile j < m:\r\n i = 0\r\n col = []\r\n while i < n:\r\n col.append(crossword[i][j])\r\n i+=1\r\n i = 0\r\n while i < n:\r\n if col.count(crossword[i][j]) > 1:\r\n cols[i].add(crossword[i][j])\r\n i+=1\r\n j+=1\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if crossword[i][j] in rows[i] or crossword[i][j] in cols[i]:\r\n crossword[i][j] = \"\"\r\ni = 0\r\n\r\nwhile i < n :\r\n crossword[i] = \"\".join(crossword[i])\r\n i+=1\r\nprint(\"\".join(crossword))\r\n\r\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\n\r\nans = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i].count(a[i][j]) == 1 and ''.join(a[k][j] for k in range(n)).count(a[i][j]) == 1:\r\n ans += a[i][j]\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\ncross=[]\r\n\r\nfor i in range(n):\r\n cross.append(str(input()))\r\n \r\nanswer=\"\" \r\nfor i in range(n):\r\n for j in range(m):\r\n curr=cross[i][j]\r\n flag=False\r\n for k in range(n):\r\n if(k==i) : continue\r\n if (cross[k][j]==curr):\r\n flag=True\r\n break\r\n for k in range(m):\r\n if(k==j) : continue\r\n if (cross[i][k]==curr):\r\n flag=True\r\n break \r\n if flag==False : \r\n answer+=curr\r\n \r\nprint(answer)", "n, m = map(int, input().split())\n\ncrosswordGrid = []\nresult = \"\"\n\nfor i in range(n):\n crosswordGrid.append(list(input()))\n\nfor i in range(n):\n for j in range(m):\n crossed = False\n for k in range(n):\n if i != k and crosswordGrid[i][j] == crosswordGrid[k][j]:\n crossed = True\n break\n if not crossed:\n for k in range(m):\n if j != k and crosswordGrid[i][j] == crosswordGrid[i][k]:\n crossed = True\n break\n if not crossed:\n result += crosswordGrid[i][j]\nprint(result)\n \t\t \t\t\t\t\t \t \t \t\t\t \t\t\t", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\n\r\nrow_count = defaultdict(list)\r\ncol_count = defaultdict(list)\r\n\r\ngrid = []\r\nfor i in range(n):\r\n row = input()\r\n grid.append(row)\r\n for j, char in enumerate(row):\r\n row_count[i].append(char)\r\n col_count[j].append(char)\r\n\r\n\r\ndecrypted = []\r\nfor ridx, row in enumerate(grid):\r\n for cidx, col in enumerate(row):\r\n if row_count[ridx].count(col) == 1 and col_count[cidx].count(col) == 1:\r\n decrypted.append(col)\r\n\r\n\r\nprint(''.join(decrypted))\r\n\r\n ", "from collections import Counter\r\nn, m = map(int,input().split(\" \"))\r\nmatrix = []\r\n\r\nfor _ in range(n):\r\n matrix.append(list(input()))\r\nrow_non_duplicates = [ [ \"\" for _ in range(m) ] for _ in range(n)]\r\nvertical_non_duplicates = [ [ \"\" for _ in range(n) ] for _ in range(m)]\r\n\r\nfor i,row in enumerate(matrix):\r\n freq = Counter(row)\r\n for j,letter in enumerate(row):\r\n if freq[letter] == 1:\r\n row_non_duplicates[i][j] = letter\r\n\r\ntransposed_matrix = list(zip(*matrix))\r\n\r\nfor i,row in enumerate(transposed_matrix):\r\n freq = Counter(row)\r\n for j,letter in enumerate(row):\r\n if freq[letter] == 1:\r\n vertical_non_duplicates[i][j] = letter\r\ncol_non_duplicates = list(zip(*vertical_non_duplicates))\r\n\r\nans=[]\r\nfor i in range(n):\r\n for letter1, letter2 in zip(row_non_duplicates[i],col_non_duplicates[i]):\r\n if letter1 == letter2:\r\n ans.append(letter1)\r\n\r\nprint(\"\".join(ans))", "from collections import Counter\r\ndef african(matrix, rows, cols):\r\n crossRow = []\r\n for row in range(rows):\r\n vals = Counter(matrix[row])\r\n lists = []\r\n for col in range(cols):\r\n if vals[matrix[row][col]] == 1:\r\n lists.append(matrix[row][col])\r\n else:\r\n lists.append(\" \")\r\n crossRow.append(lists)\r\n crossCol = []\r\n for row in range(cols):\r\n lists = []\r\n rowDict = {}\r\n for col in range(rows):\r\n rowDict[matrix[col][row]] = 1 + rowDict.get(matrix[col][row], 0)\r\n lists.append(matrix[col][row])\r\n for col in range(rows):\r\n if rowDict[matrix[col][row]] > 1:\r\n lists[col] = \" \"\r\n crossCol.append(lists)\r\n lists = []\r\n for row in range(rows):\r\n for col in range(cols):\r\n if crossRow[row][col] == crossCol[col][row] and crossRow[row][col] != \" \":\r\n lists.append(crossRow[row][col])\r\n print(''.join(lists))\r\n \r\n \r\n \r\nrow, col = map(int, input().split(\" \"))\r\nmatrix = []\r\nfor _ in range(row):\r\n matrix.append(list(input()))\r\nafrican(matrix, row, col)", "from collections import Counter\r\n\r\n\r\nn,m = map(int,input().split())\r\nboard = []\r\n\r\nresultdStr= ''\r\n\r\nfor _ in range(n):\r\n board.append(input())\r\nfor index in range(n):\r\n for innerIndex in range(m):\r\n temp = ''\r\n if board[index][innerIndex] not in temp:\r\n reapeted = False\r\n for row in range(n):\r\n if row !=index:\r\n if board[row][innerIndex] ==board[index][innerIndex]:\r\n reapeted = True\r\n temp +=board[index][innerIndex]\r\n break\r\n for col in range(m):\r\n if col !=innerIndex:\r\n if board[index][col] ==board[index][innerIndex]:\r\n reapeted = True\r\n temp +=board[index][innerIndex]\r\n break\r\n if reapeted ==False:\r\n resultdStr+=board[index][innerIndex]\r\nprint(resultdStr)\r\n \r\n\r\n\r\n \r\n\r\n\r\n", "def _X_cross_out_X_(grid, grid_cheat, i, j, n, m):\r\n letter = grid[i][j]\r\n p = i\r\n q = j\r\n while q+1 < m:\r\n q += 1\r\n if grid[p][q] == letter:\r\n grid_cheat[i][j] += 1\r\n grid_cheat[p][q] += 1\r\n q = j #reset\r\n while p+1 < n:\r\n p += 1\r\n if grid[p][q] == letter:\r\n grid_cheat[i][j] += 1\r\n grid_cheat[p][q] += 1\r\n return grid_cheat\r\ndef main():\r\n# input\r\n n, m = [int(i) for i in input().split()]\r\n answer = ''\r\n grid = [[' ']*m]*n\r\n for i in range(n):\r\n grid[i] = [ch for ch in input()]\r\n# proccessing\r\n grid_cheat = [[' ']*m]*n\r\n for i in range(n):\r\n grid_cheat[i] = [0 for j in range(m)]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n grid_cheat = _X_cross_out_X_(grid, grid_cheat, i, j, n, m)\r\n for i in range(n):\r\n for j in range(m):\r\n if grid_cheat[i][j] == 0:\r\n answer += grid[i][j]\r\n# output\r\n print(answer)\r\nif __name__=='__main__':\r\n main()", "from collections import Counter\r\nn ,m = list(map(int, input().split()))\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append(list(input()))\r\nrows = {}\r\nfor r in range(n):\r\n row = grid[r]\r\n rows[r] = Counter(row)\r\n\r\nfor idx , hashmap in rows.items():\r\n to_be_removed = set()\r\n for key , value in hashmap.items():\r\n if value > 1:\r\n to_be_removed.add(key)\r\n rows[idx] = to_be_removed\r\n\r\n\r\ncols = {}\r\nfor c in range(m):\r\n cols[c] = {}\r\n for r in range(n):\r\n cur_letter = grid[r][c]\r\n cols[c][cur_letter] = cols[c].get(cur_letter, 0) + 1\r\n\r\nfor idx , hashmap in cols.items():\r\n to_be_removed = set()\r\n\r\n for key , value in hashmap.items():\r\n if value > 1:\r\n to_be_removed.add(key)\r\n cols[idx] = to_be_removed\r\n# print(cols)\r\nfor c in range(m):\r\n for r in range(n):\r\n cur_letter = grid[r][c]\r\n if cur_letter in cols[c]:\r\n grid[r][c] = \"\"\r\n\r\nfor r in range(n):\r\n for c in range(m):\r\n cur_letter = grid[r][c]\r\n if cur_letter in rows[r]:\r\n grid[r][c] = \"\"\r\n\r\nnew_grid = [\"\".join(word) for word in grid]\r\nprint(\"\".join(new_grid))", "n, m = tuple([int(num) for num in input().split()])\nmask = [[0] * m] * n\nmask = []\nfor i in range(n):\n\tmask_row = []\n\tfor j in range(m):\n\t\tmask_row.append(0)\n\tmask.append(mask_row)\nstrings = []\nfor _ in range(n):\n\tstrings.append(input())\ntransposed = [\"\".join(list(tuple_)) for tuple_ in list(zip(*strings))]\nfor i in range(len(strings)):\n\tstring = strings[i]\n\tchar_dict = {}\n\tfor char in string:\n\t\tchar_dict[char] = char_dict.get(char, 0) + 1\n\tfor j in range(len(string)):\n\t\tif(char_dict[string[j]] >= 2):\n\t\t\tmask[i][j] = 1\nfor i in range(len(transposed)):\n\tstring = transposed[i]\n\tchar_dict = {}\n\tfor char in string:\n\t\tchar_dict[char] = char_dict.get(char, 0) + 1\n\tfor j in range(len(string)):\n\t\tif(char_dict[string[j]] >= 2):\n\t\t\tmask[j][i] = 1\nresult_arr = []\nfor i in range(n):\n\tfor j in range(m):\n\t\tif(mask[i][j] == 0):\n\t\t\tresult_arr.append(strings[i][j])\nprint(\"\".join(result_arr))", "from collections import Counter\r\n\r\na, b = map(int, input().split())\r\nrow = [input() for _ in range(a)]\r\n\r\ns = row\r\ncol = [\"\" for _ in range(b)]\r\nfor j in range(b):\r\n for i in range(a):\r\n col[j]+=row[i][j]\r\n\r\nrow = [Counter(i) for i in row]\r\ncol = [Counter(i) for i in col]\r\n\r\nans = \"\"\r\n\r\nfor i in range(a):\r\n for j in range(b):\r\n c = s[i][j]\r\n if row[i][c] == 1 and col[j][c] == 1:\r\n ans += c\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\n\r\nfin=[]\r\nfor i in range(n):\r\n s=input()\r\n t=[]\r\n for i in range(len(s)):\r\n t.append(s[i])\r\n fin.append(t)\r\ncol=[[0 for i in range(n)] for i in range(m)]\r\nfor i in range(n):\r\n for j in range(m):\r\n col[j][i]=fin[i][j]\r\n\r\nans=''\r\nfor i in range(len(fin)):\r\n m=fin[i]\r\n for j in range(len(m)):\r\n \r\n if(m.count(m[j])==1 and col[j].count(m[j])==1):\r\n ans+=m[j]\r\nprint(ans)\r\n \r\n \r\n", "import re\n[n, m], rows = [int(i) for i in input().split()], []\ncols = [''] * m\nfor i in range(n):\n rows.append(input())\nfor row in rows:\n for i, char in enumerate(row):\n cols[i] += char\nrows_copy, cols_copy = list(rows), list(cols)\nfor i, row in enumerate(rows_copy):\n for j, char in enumerate(row):\n if row.count(char) > 1 or cols_copy[j].count(char) > 1:\n rows[i] = re.sub(char, '_', rows[i])\n cols[j] = re.sub(char, '_', cols[j])\nans = []\nfor row in rows:\n for i, c in enumerate(row):\n if c != '_' and c in cols[i]:\n ans.append(c)\nprint(''.join([str(x) for x in ans]))\n", "#nums = list(map(int, input().split()))\r\n\r\nr,c = map(int,input().split())\r\n\r\ngrid = []\r\nfor _ in range(r):\r\n rw = list(input())\r\n grid.append(rw)\r\n \r\n\r\ndef countOnRow(row,letter):\r\n count = 0\r\n for cl in range(len(grid[0])):\r\n if grid[row][cl] == letter:\r\n count += 1\r\n \r\n return count <= 1\r\n \r\n \r\ndef countOnCol(col,letter):\r\n count = 0\r\n for rw in range(len(grid)):\r\n if grid[rw][col] == letter:\r\n count += 1\r\n \r\n return count <= 1\r\n\r\nfinal_words = []\r\nfor row in range(len(grid)):\r\n for col in range(len(grid[0])):\r\n letter = grid[row][col]\r\n if countOnRow(row,letter) and countOnCol(col,letter):\r\n final_words.append(letter)\r\n \r\nprint(\"\".join(final_words))\r\n ", "n, m = [int(i) for i in input().split()]\r\na = [] \r\nfor _ in range(n): a.append(list(input()))\r\ns = '' \r\nfor i in range(n):\r\n for j in range(m): \r\n w = a[i][j]\r\n ans = True\r\n for k in range(m): \r\n if k == j : continue\r\n if a[i][k] == a[i][j] : ans = False; break \r\n if ans == False : continue \r\n for k in range(n): \r\n if k == i : continue \r\n if a[k][j] == a[i][j] : ans = False ;break\r\n if ans : s += a[i][j]\r\n\r\nprint(s)", "a = [] \r\nn, m = map(int, input().split(' '))\r\n\r\nfor i in range(n): \r\n\ts = input()\r\n\ta.append(s)\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tc = a[i][j]\r\n\t\tcheck = True\r\n\t\tfor k in range(n): \r\n\t\t\tif c == a[k][j] and k != i:\r\n\t\t\t\tcheck = False\r\n\t\tfor k in range(m):\r\n\t\t\tif c == a[i][k] and k != j:\r\n\t\t\t\tcheck = False\r\n\t\tif check == True:\r\n\t\t\tprint(c, end = '')", "m, n = map(int,input().split())\r\n\r\ntable= [ list(input()) for _ in range(m)]\r\n\r\nrows = {i:{} for i in range(m)}\r\ncols = {i:{} for i in range(n)}\r\n\r\n\r\n\r\nfor row in range(m):\r\n for col in range(n):\r\n rows[row][table[row][col]] = rows[row].get(table[row][col],0) + 1\r\n cols[col][table[row][col]] = cols[col].get(table[row][col],0) + 1\r\n\r\nres = []\r\nfor row in range(m):\r\n for col in range(n):\r\n letter = table[row][col]\r\n if rows[row][letter] == 1 and cols[col][letter] == 1:\r\n res.append(letter)\r\nprint(\"\".join(res))", "x,y=map(int,(input()).split())\r\na=\"\"\r\nfor __ in range(x):\r\n a+=input()\r\ni=0 \r\nb=\"\"\r\nwhile i<x*y:\r\n n=i%y\r\n f=0\r\n m=i-n\r\n for j in range(m,m+y):\r\n if a[j]==a[i] and i!=j:\r\n f=1\r\n for j in range(n,len(a),y):\r\n if a[j]==a[i] and i!=j:\r\n f=1\r\n if f==0:\r\n b+=a[i]\r\n i+=1 \r\nprint(b) ", "n,m = list(map(int, input().split()))\r\n\r\nmatrix = []\r\nfor line in range(n):\r\n matrix.append(list(input()))\r\n# print(matrix)\r\ncol_length = len(matrix[0])\r\nrow_length = len(matrix)\r\n\r\nanswer = []\r\nfor row in range(row_length):\r\n for col in range(col_length):\r\n flag = 0\r\n # current element : matrix[row][col]\r\n element = matrix[row][col]\r\n # for each col in that row\r\n for r in range(row_length):\r\n if r!=row and matrix[r][col]==element:\r\n flag = 1\r\n # for each row in that col\r\n for c in range(col_length):\r\n if c!=col and matrix[row][c]==element:\r\n flag = 1\r\n if flag == 0:\r\n answer.append(element)\r\n\r\nprint(\"\".join(answer))\r\n\r\n \r\n \r\n", "# LUOGU_RID: 113638914\nn,m=list(map(int,input().split()));a=[]\nfor i in range(n):a.append(input().strip())\nfor i in range(n):\n for j in range(m):\n z=1;b=a[i][j]\n for k in range(n):\n if b==a[k][j]and i-k:z=0\n if z:\n for k in range(m):\n if b==a[i][k]and j-k:z=0\n if z:print(b,end=\"\")", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\ngrid = []\r\nrow_count = defaultdict(list)\r\ncol_count = defaultdict(list)\r\n\r\nfor row in range(n):\r\n word = input()\r\n grid.append(word)\r\n \r\n for col, char in enumerate(word):\r\n row_count[row].append(char)\r\n col_count[col].append(char)\r\n\r\n \r\n \r\ncrossword = []\r\nfor i, word in enumerate(grid):\r\n for j, char in enumerate(word):\r\n if row_count[i].count(char) == 1 and col_count[j].count(char) == 1:\r\n crossword.append(char)\r\n \r\n \r\nprint(\"\".join(crossword))", "\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nC = []\r\n\r\nrows = [[0]*(ord('z')+1) for _ in range(n)]\r\ncols = [[0]*(ord('z')+1) for _ in range(m)]\r\n\r\nfor _ in range(n):\r\n C += [list(input())]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n rows[i][ord(C[i][j])] += 1\r\n cols[j][ord(C[i][j])] += 1\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if rows[i][ord(C[i][j])] > 1 or cols[j][ord(C[i][j])] > 1:\r\n C[i][j] = 0\r\n\r\nresult = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if C[i][j] != 0:\r\n result += [C[i][j]]\r\n\r\nprint(\"\".join(result))\r\n", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\n\r\n# Create a transposed grid to iterate over columns\r\ntransposed_grid = list(zip(*grid))\r\n\r\nresult = []\r\nfor i in range(n):\r\n for j in range(m):\r\n # Check if the character is unique in its row\r\n if grid[i].count(grid[i][j]) == 1 and grid[i][j] not in grid[i][j+1:]:\r\n # Check if the character is unique in its column\r\n if transposed_grid[j].count(grid[i][j]) == 1 and grid[i][j] not in [row[j] for row in grid[i+1:]]:\r\n result.append(grid[i][j])\r\n\r\nprint(''.join(result))\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\nn,m = get_ints()\r\nstring = []\r\nfor i in range(n):\r\n \r\n str1= get_string()\r\n string.append(list(str1))\r\n\r\nli=list(zip(*string))\r\nstring = list(string)\r\nans = []\r\nfor row in range(len(string)):\r\n \r\n for col in range(len(string[0])):\r\n \r\n if (string[row][col] in (string[row][:col] + string[row][col+1:])) or (string[row][col] in (li[col][:row] + li[col][row+1:])):\r\n continue\r\n ans.append(string[row][col])\r\n\r\nprint(\"\".join(ans))\r\n ", "def modifyGrid(grid):\r\n matrix = []\r\n for arr in grid:\r\n temp = []\r\n for chars in arr:\r\n temp.append([chars, True])\r\n matrix.append(temp)\r\n return matrix\r\n\r\ndef checkValid(grid, rows, cols):\r\n grid = modifyGrid(grid)\r\n for row in range(rows):\r\n checkDouble = dict()\r\n for col in range(cols):\r\n checkDouble[grid[row][col][0]] = 1 + checkDouble.get(grid[row][col][0], 0)\r\n\r\n for col in range(cols):\r\n if checkDouble.get(grid[row][col][0]) > 1:\r\n grid[row][col][1] = False\r\n\r\n for col in range(cols):\r\n checkDouble = dict()\r\n for row in range(rows):\r\n checkDouble[grid[row][col][0]] = 1 + checkDouble.get(grid[row][col][0], 0)\r\n\r\n for row in range(rows):\r\n if checkDouble.get(grid[row][col][0]) > 1:\r\n grid[row][col][1] = False\r\n\r\n res = []\r\n for row in range(rows):\r\n for col in range(cols):\r\n if grid[row][col][1]:\r\n res.append(grid[row][col][0])\r\n\r\n return \"\".join(res)\r\n\r\n\r\nrows, cols = list(map(int, input().split(\" \")))\r\ngrid = []\r\nfor i in range(rows):\r\n grid.append(input())\r\nprint(checkValid(grid, rows, cols))\r\n", "n,m=map(int,input().split())\nr=[]\nans=[]\nfor i in range(n):\n r.append(list(input()))\nfor i in range(n):\n for j in range(m):\n crossed=False\n for k in range(m):\n if k!=j and r[i][k]==r[i][j]:\n crossed=True\n for k in range(n):\n if k!=i and r[k][j]==r[i][j]:\n crossed=True\n if not crossed:\n ans.append(r[i][j]) \nprint(''.join(ans))\n \n", "n,m = map(int, input().split())\r\nl = []\r\nfor _ in range(n):\r\n l.append(list(input()))\r\nres = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] in l[i][:j]+l[i][j+1:]:\r\n continue\r\n cnt = 0\r\n for k in range(n):\r\n if l[k][j] == l[i][j]:\r\n cnt += 1\r\n \r\n if cnt == 1:\r\n res += l[i][j]\r\nprint(res)", "[num_of_rows, num_of_cols] = [int(i) for i in input().split(\" \")]\r\ndata = []\r\nfor i in range(num_of_rows):\r\n data.append(list(input()))\r\n\r\n\r\nrow_map = [(set(), set()) for i in range(num_of_rows)]\r\ncol_map = [(set(), set()) for i in range(num_of_cols)]\r\n\r\nfor r in range(len(data)):\r\n for c in range(len(data[0])):\r\n letter = data[r][c]\r\n if (letter in row_map[r][0]):\r\n row_map[r][1].add(letter)\r\n row_map[r][0].add(letter)\r\n\r\n if (letter in col_map[c][0]):\r\n col_map[c][1].add(letter)\r\n col_map[c][0].add(letter)\r\nans = []\r\n\r\nfor r in range(len(data)):\r\n for c in range(len(data[0])):\r\n letter = data[r][c]\r\n if (letter not in row_map[r][1] and letter not in col_map[c][1]):\r\n ans.append(letter)\r\n\r\nprint(''.join(ans))\r\n", "n, m = map(int, input().split())\nls = [list(input()) for i in range(n)]\nres=''\nfor i in range(n):\n for j in range(m):\n ans=0\n for k in range(m):\n if ls[i][j]==ls[i][k]:\n ans+=1\n for l in range(n):\n if ls[i][j]==ls[l][j]:\n ans+=1\n if ans==2:\n res+=ls[i][j]\n\nprint(res)\n\n\n\n \t \t\t\t\t \t \t\t \t\t\t \t \t \t\t\t\t", "x = input()\ny = x.split()\ny[0] = int(y[0])\ny[1] = int(y[1])\nn = y.pop(0)\nm = y.pop(0)\ncross_word = []\nfor i in range(n):\n\ttemp = input()\n\t# temp = split_word(temp)\n\tcross_word.append(temp)\n\nrepeated = [[True for col in range(m)] for row in range(n)]\nfor i in range(n):\n\tfor j in range(m):\n\t\tletter = cross_word[i][j]\n\t\tif(cross_word[i].count(letter) > 1):\n\t\t\trepeated[i][j] = False\n\nfor j in range(m):\n\ttemp_column = []\n\tfor i in range(n):\n\t\tletter = cross_word[i][j]\n\t\ttemp_column.append(letter)\n\tfor k in range(n):\n\t\tif(temp_column.count(temp_column[k]) > 1):\n\t\t\trepeated[k][j] = False\nencrypted = ''\nfor i in range(n):\n\tfor j in range(m):\n\t\tif repeated[i][j]:\n\t\t\tencrypted += cross_word[i][j]\n\nprint(encrypted)", "n, m = map(int, input().split())\r\n\r\ns = []\r\nfor i in range(n):\r\n tmp = input()\r\n s.append(tmp)\r\n\r\nres = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n c = s[i][j]\r\n flag = True\r\n for x in range(n):\r\n if s[x][j] == c and x != i:\r\n flag = False\r\n break\r\n if not flag:\r\n continue\r\n for y in range(m):\r\n if s[i][y] == c and y != j:\r\n flag = False\r\n break\r\n if flag:\r\n res += c\r\n \r\nprint(res)", "n , m = map(int,input().split())\r\nresult = \"\"\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(list(input()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n flag = True\r\n for k in range(n):\r\n if k != i and grid[k][j] == grid[i][j]:\r\n flag = False\r\n for l in range(m):\r\n if l != j and grid[i][l] == grid[i][j]:\r\n flag = False\r\n if flag:\r\n result+= grid[i][j]\r\nprint(result)\r\n ", "import sys\r\nimport math\r\n\r\nn, m = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nt = []\r\nfor i in range(n):\r\n st = sys.stdin.readline()\r\n v = []\r\n for j in range(m):\r\n v.append(st[j])\r\n \r\n t.append(v)\r\n \r\nres = []\r\nfor i in range(n):\r\n for j in range(m):\r\n u = 0\r\n for x in range(m):\r\n if(t[i][j] == t[i][x]):\r\n u += 1\r\n z = 0 \r\n for y in range(n):\r\n if(t[i][j] == t[y][j]):\r\n z += 1\r\n \r\n if(z == 1 and u == 1):\r\n res.append(t[i][j])\r\n \r\nprint(\"\".join(res))\r\n\r\n \r\n ", "from collections import Counter\r\nm, n = map(int, input().split())\r\ngrid = []\r\nfor _ in range(m):\r\n grid.append(list(input()))\r\nrows = []\r\nfor i in range(m):\r\n rows.append(Counter(grid[i]))\r\ncols = []\r\nfor i in list(zip(*grid)):\r\n cols.append(Counter(i))\r\nstring = \"\"\r\nfor i in range(m):\r\n for j in range(n):\r\n if rows[i][grid[i][j]] == 1 and cols[j][grid[i][j]] == 1:\r\n string += grid[i][j]\r\nprint(string) ", "n, m = map(int, input().split())\r\n\r\ngrid = [input() for _ in range(n)]\r\n\r\nencrypted_word = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = grid[i][j]\r\n if grid[i].count(letter) == 1 and [grid[k][j] for k in range(n)].count(letter) == 1:\r\n encrypted_word += letter\r\n\r\nprint(encrypted_word)\r\n", "import sys, itertools, math\n\ndef ia():\n return [int(i) for i in sys.stdin.readline().strip().split(\" \")]\n\ndef ii():\n return int(sys.stdin.readline().strip())\n\ndef istr():\n return sys.stdin.readline().strip()\n\n###\n\nn, m = ia()\n\nA = []\nC = []\nfor _ in range(n):\n A.append(list(istr()))\n C.append([True]*m)\n\nfor y in range(n):\n for x in range(m):\n for i in range(x+1, m):\n if A[y][x] == A[y][i]:\n C[y][x], C[y][i] = False, False\n\nfor x in range(m):\n for y in range(n):\n for i in range(y+1, n):\n if A[y][x] == A[i][x]:\n C[y][x], C[i][x] = False, False\n\ns = \"\"\nfor r, a in zip(C, A):\n for c,l in zip(r, a):\n if c:\n s += l\nprint(s)\n\n", "def solve():\r\n N, M = map(int, input().split())\r\n\r\n board = []\r\n for i in range(N):\r\n board.append([c for c in input()])\r\n \r\n def crossOut(row, col):\r\n wasCrossedOut = False\r\n for i in range(M):\r\n if i != col and board[row][i] == board[row][col].lower():\r\n board[row][i] = board[row][i].upper()\r\n wasCrossedOut = True\r\n\r\n for i in range(N):\r\n if i != row and board[i][col] == board[row][col].lower():\r\n board[i][col] = board[i][col].upper()\r\n wasCrossedOut = True\r\n\r\n if wasCrossedOut:\r\n board[row][col] = board[row][col].upper()\r\n\r\n for i in range(N):\r\n for j in range(M):\r\n if board[i][j] != '*':\r\n crossOut(i, j)\r\n\r\n encrypted = []\r\n for i in range(N):\r\n for j in range(M):\r\n if board[i][j].islower():\r\n encrypted.append(board[i][j])\r\n \r\n print(''.join(encrypted))\r\n\r\nif __name__ == '__main__':\r\n solve()", "from collections import *\r\nn, m = input().split()\r\nmat = []\r\n\r\nfor _ in range(int(n)):\r\n mat.append(list(input()))\r\n\r\n\r\ncolumns = list(zip(*mat))\r\nres = \"\"\r\n\r\nfor i in range(int(n)):\r\n horFreq = Counter(mat[i])\r\n \r\n for j in range(int(m)):\r\n verFreq = Counter(columns[j])\r\n\r\n if horFreq[mat[i][j]] == 1 and verFreq[mat[i][j]] == 1:\r\n res += mat[i][j]\r\nprint(res)\r\n \r\n \r\n \r\n", "n,m = map(int,input().split())\r\ndelete = []\r\n\r\ncrossword = []\r\nfor i in range(n):\r\n\tcrossword.append(list(input()))\r\n\r\n#print(crossword)\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tletter = crossword[i][j]\r\n\t\tflag = 0\r\n\t\tfor k in range(n):\r\n\t\t\tif k==i:\r\n\t\t\t\tcontinue\r\n\t\t\tif crossword[k][j]==letter:\r\n\t\t\t\tdelete.append([i,j])\r\n\t\t\t\tflag = 1\r\n\t\t\t\tbreak\r\n\t\tif flag==1:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tfor k in range(m):\r\n\t\t\t\tif k==j:\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tif crossword[i][k]==letter:\r\n\t\t\t\t\tdelete.append([i,j])\r\n\t\t\t\t\tbreak\r\n\r\nfor position in delete:\r\n\tcrossword[position[0]][position[1]] = -1\r\n\r\n#print(delete)\r\n\r\nans = \"\"\r\n\r\nfor r in crossword:\r\n\tfor c in r:\r\n\t\tif c==-1:\r\n\t\t\tpass\r\n\t\telse:\r\n\t\t\tans+=c\r\n\r\nprint(ans)\r\n", "from collections import Counter, defaultdict\r\n\r\n\r\n[n , m] = list(map(int, input().split()))\r\narray = []\r\nfor a in range(n):\r\n array.append(input())\r\n\r\ndict1 = []\r\nfor x in range(n):\r\n dict1.append(Counter(array[x]))\r\ndicts = []\r\n\r\nfor x in range(m):\r\n aa = \"\"\r\n for y in range(n):\r\n aa += array[y][x]\r\n\r\n dicts.append(Counter(aa))\r\nresult = ''\r\n\r\nfor indexx, row in enumerate(array):\r\n for index, char in enumerate(row):\r\n \r\n if dict1[indexx][char] == 1 and dicts[index][char] == 1:\r\n result += char\r\n\r\nprint(result)", "n,m=map(int,input().split())\nr=[]\nans=[]\nhfreq=[]\nvfreq=[]\nfor i in range(n):\n r.append(list(input()))\nfor i in range(n):\n f={}\n for j in range(m):\n if r[i][j] in f:\n f[r[i][j]]+=1\n else:\n f[r[i][j]]=1\n hfreq.append(f)\nfor j in range(m):\n f={}\n for i in range(n):\n if r[i][j] in f:\n f[r[i][j]]+=1\n else:\n f[r[i][j]]=1\n vfreq.append(f)\n\nans=[]\nfor i in range(n):\n for j in range(m):\n if hfreq[i][r[i][j]]==1 and vfreq[j][r[i][j]]==1:\n ans.append(r[i][j])\n\nprint(''.join(ans))\n\n \n", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\ngrid = []\r\nvalid = []\r\nfor i in range(n):\r\n tracker = {}\r\n row = list(input())\r\n grid.append(row)\r\n for j,v in enumerate(row):\r\n if v in tracker:\r\n tracker[v] = -1\r\n else:\r\n tracker[v] = j\r\n for k in tracker:\r\n if tracker[k] != -1:\r\n valid.append((i,tracker[k]))\r\nfor c in range(m):\r\n tracker = defaultdict(list)\r\n for r in range(n):\r\n tracker[grid[r][c]].append(r)\r\n for key in tracker:\r\n if len(tracker[key]) > 1:\r\n for invalid in tracker[key]:\r\n if (invalid, c) in valid:\r\n valid.remove((invalid, c))\r\nans = \"\"\r\nfor item in valid:\r\n ans += grid[item[0]][item[1]]\r\nprint(ans)", "from collections import defaultdict\r\nsize = list(map(int, input().split()))\r\ncrossword = []\r\nfor row in range(size[0]):\r\n word = input()\r\n crossword.append(word)\r\n \r\nanswer = \"\"\r\nfor row in range(size[0]):\r\n for col in range(size[1]):\r\n letter = crossword[row][col]\r\n count = crossword[row].count(letter)\r\n yes = 1\r\n for i in range(size[0]):\r\n if i != row:\r\n if letter == crossword[i][col]:\r\n yes = 0\r\n \r\n if yes == 1 and count == 1:\r\n answer += letter\r\n \r\nprint(answer)", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\nmatrix = []\r\n\r\nfor i in range(n):\r\n matrix.append(list(input()))\r\n\r\ncol = defaultdict(list)\r\nrow = defaultdict(list)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n col[j].append(matrix[i][j])\r\n row[i].append(matrix[i][j])\r\n\r\nans = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n colCount = 0\r\n rowCount = 0\r\n for k in col[j]:\r\n\r\n if k == matrix[i][j]:\r\n colCount+=1\r\n for k in row[i]:\r\n if k == matrix[i][j]:\r\n rowCount+=1\r\n if colCount <= 1 and rowCount<=1:\r\n print(matrix[i][j], end=\"\")", "n,m = map(int,input().split())\r\ngrid = []\r\nfor i in range(n):\r\n s = str(input())\r\n grid.append(list(s))\r\nans = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n f = True\r\n for k in range(m):\r\n if j != k:\r\n if grid[i][k] == grid[i][j]:\r\n f = False\r\n break\r\n for k in range(n):\r\n if i != k:\r\n if grid[k][j] == grid[i][j]:\r\n f = False\r\n break\r\n if f:\r\n ans += grid[i][j]\r\n\r\nprint(ans)\r\n ", "n, m = map(int, input().split())\r\nS = [input() for i in range(n)]\r\nres = []\r\nfor i in range(n):\r\n for j in range(m):\r\n c = S[i][j]\r\n flag = True\r\n for x in range(m):\r\n if x == j:\r\n continue\r\n if S[i][x] == c:\r\n flag = False\r\n break\r\n for y in range(n):\r\n if y == i:\r\n continue\r\n if S[y][j] == c:\r\n flag = False\r\n break\r\n if flag:\r\n res.append(c)\r\nprint(''.join(res))\r\n", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\nvalues = []\r\nrows, cols = [], []\r\n\r\nfor i in range(n):\r\n row = input()\r\n temp = {val:row.count(val) for val in row}\r\n rows.append(temp)\r\n values.append(row)\r\n\r\nfor i in range(m):\r\n temp = defaultdict(int)\r\n for j in range(n):\r\n temp[values[j][i]] +=1 \r\n cols.append(temp)\r\n\r\n\r\nresult = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if rows[i][values[i][j]] == 1 and cols[j][values[i][j]] == 1:\r\n result += values[i][j]\r\n\r\nprint(result)", "n, m = map(int, input().split())\r\nn_rows = [[0] * 26 for _ in range(n)]\r\nm_cols = [[0] * 26 for _ in range(m)]\r\nword = []\r\nresult = \"\"\r\n\r\nfor _ in range(n):\r\n inp = input()\r\n word.append(inp)\r\n count = 0\r\n for letter in inp:\r\n n_rows[_][ord(letter) - 97] += 1\r\n m_cols[count][ord(letter) - 97] += 1\r\n count += 1\r\n\r\nfor i in range(n):\r\n count = 0\r\n for letter in word[i]:\r\n if n_rows[i][ord(letter) - 97] == 1 and m_cols[count][ord(letter) - 97] == 1:\r\n result += letter\r\n count += 1\r\n\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\ngrid = [list(input()) for i in range(n)]\r\nres=''\r\nfor i in range(n):\r\n for j in range(m):\r\n ans = 0\r\n for k in range(m):\r\n if grid[i][j] == grid[i][k]:\r\n ans += 1\r\n for l in range(n):\r\n if grid[i][j] == grid[l][j]:\r\n ans += 1\r\n if ans == 2:\r\n res += grid[i][j]\r\n \r\nprint(res)", "from sys import stdin , stdout\r\ninput=stdin.readline\r\nn,m=map(int,input().split()) ; arr=[]\r\nfor i in range(n):\r\n x=input()\r\n arr.append(x)\r\nfor i in range(n):\r\n for j in range(m):\r\n let=arr[i][j] ; cond=False\r\n for h in range(n):\r\n if arr[h][j] == let and h!=i:\r\n cond=True ; break\r\n for h in range(m) :\r\n if arr[i][h]==let and h !=j:\r\n cond=True\r\n if not cond:\r\n stdout.write(let)\r\n \r\n \r\n", "n, m = map(int, input().split())\r\n\r\ndef uniqe(r,c):\r\n foundr = True\r\n foundc = True\r\n for i in range(m):\r\n if c != i and arr[r][c] == arr[r][i]:\r\n foundr = False\r\n for i in range(n): \r\n if r != i and arr[i][c] == arr[r][c]:\r\n foundc = False\r\n return foundr and foundc\r\n\r\n\r\narr = []\r\nfor _ in range(n):\r\n arr.append(input())\r\n\r\ncount = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n if uniqe(i,j):\r\n count += arr[i][j]\r\n\r\nprint(count)\r\n\r\n\r\n", "from collections import Counter, defaultdict\r\n\r\ndef crossRow(grid, m):\r\n row_dic = defaultdict(list)\r\n for i in range(m):\r\n for letter, count in Counter(grid[i]).most_common():\r\n if count == 1:\r\n break\r\n row_dic[i].append(letter)\r\n \r\n return row_dic\r\n\r\ndef crossColumn(grid):\r\n col_dic = defaultdict(list)\r\n i = 0\r\n for col in zip(*grid):\r\n for letter, count in Counter(col).most_common():\r\n if count == 1:\r\n break\r\n col_dic[i].append(letter)\r\n i += 1\r\n \r\n return col_dic\r\n\r\nm, n = (map(int, input().strip().split()))\r\ngrid = []\r\n\r\nfor _ in range(m):\r\n grid.append(list(input().strip()))\r\n\r\nrow_dic = crossRow(grid, m)\r\ncol_dic = crossColumn(grid)\r\nfor index, letters in row_dic.items():\r\n for letter in letters:\r\n for j in range(n):\r\n if grid[index][j] == letter:\r\n grid[index][j] = ''\r\n\r\nfor index, letters in col_dic.items():\r\n for letter in letters:\r\n for i in range(m):\r\n if grid[i][index] == letter:\r\n grid[i][index] = ''\r\n\r\nsolve = []\r\nfor row in grid:\r\n solve.append(''.join(row))\r\n\r\nprint(''.join(solve))", "n,m = input().strip().split(' ')\nn,m = [int(n),int(m)]\n\ncrossword_respect_to_m = []\nfor i in range(n):\n word = input().strip()\n crossword_respect_to_m.append(word)\n\ncrossword_respect_to_n = []\n\ni = 0\nwhile i < m:\n j = 0\n reverse = \"\"\n while j < n:\n reverse += crossword_respect_to_m[j][i]\n j+=1\n crossword_respect_to_n.append(reverse)\n i+=1\ni = 0\nresult = \"\"\nwhile i < n:\n j = 0\n while j < m:\n temp_m = crossword_respect_to_m[i][:j]+\"\"+crossword_respect_to_m[i][j+1:]\n temp_n = crossword_respect_to_n[j][:i]+\"\"+crossword_respect_to_n[j][i+1:]\n if temp_m.find(crossword_respect_to_m[i][j]) == -1 and temp_n.find(crossword_respect_to_m[i][j]) == -1:\n result+=crossword_respect_to_m[i][j]\n j+=1\n i+=1\n\nprint(result)", "def african_word(n, m, grid):\r\n row= [{} for _ in range(n)]\r\n col= [{} for _ in range(m)]\r\n res= []\r\n for i in range(n):\r\n for j in range(m):\r\n val= grid[i][j]\r\n row[i][val]=1 + row[i].get(val, 0)\r\n col[j][val]= 1+ col[j].get(val, 0)\r\n for i in range(n):\r\n for j in range(m):\r\n val= grid[i][j]\r\n cntr= row[i].get(val, 0)\r\n cntc= col[j].get(val, 0)\r\n if cntr == 1 and cntc ==1:\r\n res.append(val)\r\n return res\r\nn, m= tuple(map(int, input().split()))\r\ngrid= []\r\n\r\nfor _ in range(n):\r\n line= input()\r\n grid.append(line)\r\n\r\nprint(''.join(african_word(n, m, grid)))", "n, m = [int(x) for x in input().split()]\r\nlr = []\r\nlc = []\r\nlst = []\r\nfor i in range(n):\r\n l = list(input())\r\n lr.append(l)\r\nfor i in range(m):\r\n l = []\r\n for j in range(n):\r\n s = lr[j][i]\r\n l.append(s)\r\n lc.append(l)\r\nfor i in range(n):\r\n for j in range(m):\r\n s = lr[i][j]\r\n if lr[i].count(s) == 1 and lc[j].count(s) == 1:\r\n lst.append(s)\r\nprint(\"\".join(lst))", "a,b=map(int,input().split())\r\nx=[]\r\nxx=[]\r\nfor i in range(a):\r\n lol=list(input())\r\n x.append(lol)\r\n xx.append(lol.copy())\r\nfor i in range(a):\r\n for j in range(b):\r\n for k in range(j+1,b):\r\n # print(xx[i],x[i])\r\n # print(xx[j],x[j])\r\n if xx[i][j]==xx[i][k]:\r\n x[i][j]='aa'\r\n x[i][k]='aa'\r\n for k in range(i+1,a):\r\n if xx[i][j]==xx[k][j]:\r\n x[i][j]='aa'\r\n x[k][j]='aa'\r\nans=\"\"\r\nfor i in range(a):\r\n for j in range(b):\r\n if x[i][j]!='aa':\r\n ans+=x[i][j]\r\nprint(ans)", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n\tarr.append(input())\r\n\r\ndef inCol(current_char):\r\n count = 0\r\n for k in range(len(arr)):\r\n if arr[k][j] == current_char:\r\n count += 1\r\n if count > 1:\r\n return 1\r\n else:\r\n continue\r\n\r\n return 0\r\n \r\nanswer = []\r\nfor i in range(len(arr) ):\r\n for j in range(len(arr[i]) ):\r\n current_char = arr[i][j]\r\n in_row = arr[i].count(current_char)\r\n if in_row > 1:\r\n pass \t\r\n elif inCol(current_char) == 1:\r\n pass\r\n else:\r\n answer.append(current_char)\r\n\r\nprint(*answer, sep = \"\")", "n , m = map(int,input().split())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(list(input()))\r\n\r\ncol_arr = list(map(list,zip(*arr)))\r\n\r\n\r\nans =\"\"\r\ni = 0\r\nj = 0\r\nwhile i < n:\r\n j = 0\r\n while j < m :\r\n if arr[i].count(arr[i][j]) == 1 and col_arr[j].count(arr[i][j]) == 1:\r\n ans += arr[i][j]\r\n \r\n j += 1\r\n i += 1\r\n \r\n\r\nprint(ans)\r\n ", "n, m = list(map(int, input().strip().split()))\nA = [[0] * m] * n\n\n\nfor r in range(n):\n A[r] = list(input().strip())\n\n\ndef in_row(A, r, c):\n x = A[r][c]\n left, right = A[r][:c], A[r][c + 1:]\n if (x in left) or (x in right):\n return True\n\n\ndef in_col(A, r, c):\n x = A[r][c]\n for row in range(n):\n if row == r:\n continue\n if A[row][c] == x:\n return True\n\nout = ''\nfor r in range(n):\n for c in range(m):\n if not in_row(A, r, c) and not in_col(A, r, c): \n out += A[r][c]\n\nprint(out)", "# main\r\n\r\nn, m = map(int, input().split())\r\nword = []\r\nout = \"\"\r\n\r\nfor i in range(n):\r\n word.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n x = word[i][j]\r\n ok = True\r\n for a in range(m):\r\n if word[i][a] == x and a != j:\r\n ok = False\r\n for a in range(n):\r\n if word[a][j] == x and a != i:\r\n ok = False\r\n if ok:\r\n out += x\r\n\r\nprint(out)\r\n", "rows, cols = list(map(int, input().split()))\r\ncount, grid = 0, []\r\nfor row in range(rows):\r\n string = input()\r\n grid.append([char for char in string])\r\n\r\nstring = ''\r\n\r\nfor row in range(rows):\r\n for col in range(cols):\r\n curnt_char = grid[row][col]\r\n row_chars = grid[row]\r\n \r\n ext_curnt = row_chars[0 : col]\r\n if col + 1 < cols:\r\n ext_curnt.extend(row_chars[col+1 : cols])\r\n\r\n if curnt_char in ext_curnt:\r\n continue\r\n \r\n char_exist = False\r\n for sub_row in range(rows):\r\n if sub_row == row:\r\n continue\r\n if curnt_char == grid[sub_row][col]:\r\n char_exist = True\r\n break\r\n \r\n if not char_exist:\r\n string += curnt_char\r\n \r\nprint(string)", "def main():\n arr = list(map(int, input().split()))\n n = arr[0]\n m = arr[1]\n grid = []\n res = \"\"\n for _ in range(n):\n array = []\n temp = input()\n for j in range(m):\n array.append(temp[j])\n grid.append(array)\n\n def checkIn(board, i, j):\n directions = [[1,0], [0, 1],[-1,0],[0,-1]]\n for x, y in directions:\n k = x+i\n l = y+j\n while 0<=k<n and 0<=l<m:\n if board[k][l] == board[i][j]:\n return False\n k+=x\n l+=y\n return True\n for i in range(n):\n for j in range(m):\n if checkIn(grid, i, j):\n res+=grid[i][j]\n print(res)\nif __name__ == \"__main__\":\n main()\n", "n, m = map(int, input().split())\r\n\r\ngrid = [input() for _ in range(n)]\r\n\r\nanswer = \"\"\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = grid[i][j]\r\n row_has_duplicate = letter in grid[i][:j] + grid[i][j+1:]\r\n col_has_duplicate = letter in [grid[k][j] for k in range(n) if k != i]\r\n if not row_has_duplicate and not col_has_duplicate:\r\n answer += letter\r\n\r\nprint(answer)\r\n", "n,m = map(int,input().split())\r\ns = [input().strip()for _ in range(n)]\r\nprint(''.join([s[i][j] for i in range(n)for j in range(m)if s[i].count(s[i][j]) == 1 and not [1 for k in range(n)if s[k][j] == s[i][j] and i != k]]))", "import sys\n\ndef main():\n\tn, m = map(int, sys.stdin.readline().split())\n\tmatrix = []\n\n\tfor _ in range(n):\n\t\trow = sys.stdin.readline()\n\t\tmatrix.append(list(row)[:-1])\n\n\ts = \"\"\n\n\tfor i in range(n):\n\n\t\tfor j in range(m):\n\t\t\tc = matrix[i][j]\n\t\t\t\n\t\t\tif checkRow(matrix[i], c, j) and checkColumn([col[j] for col in matrix], c, i):\n\t\t\t\ts += c\n\n\tprint(s)\n\ndef checkRow(a, element, j):\n\n\tfor col, s in enumerate(a):\n\n\t\tif element == s and col != j:\n\t\t\treturn False\n\n\treturn True\n\ndef checkColumn(a, element, i):\n\n\tfor row, s in enumerate(a):\n\n\t\tif element == s and row != i:\n\t\t\treturn False\n\n\treturn True\n\nif __name__ == \"__main__\":\n main()\n \t\t\t\t \t\t \t\t \t\t\t\t \t \t\t\t \t\t\t\t", "def row_col_count(grid,n,m):\r\n row_count = {}\r\n col_count = {}\r\n for row in range(n):\r\n for col in range(m):\r\n if (row,grid[row][col]) not in row_count:\r\n row_count[(row,grid[row][col])] = 1\r\n else:\r\n row_count[(row,grid[row][col])] += 1\r\n if (col,grid[row][col]) not in col_count:\r\n col_count[(col,grid[row][col])] = 1\r\n else:\r\n col_count[(col,grid[row][col])] += 1\r\n return row_count,col_count\r\n \r\n \r\n \r\n \r\nn,m = map(int,input().split())\r\n\r\ngrid = []\r\n\r\nfor index in range(int(n)):\r\n grid.append(input())\r\n \r\nrow_count,col_count = row_col_count(grid,n,m)\r\n\r\nword = []\r\n\r\nfor row in range(int(n)):\r\n for col in range(int(m)):\r\n \r\n if row_count[(row,grid[row][col])] <2 and col_count[(col,grid[row][col])] <2:\r\n word.append(grid[row][col])\r\nprint(''.join(word))\r\n \r\n\r\n", "from collections import Counter, defaultdict\r\n\r\n\r\nm, n = tuple(map(int, input().split()))\r\n\r\nmat = []\r\nfor i in range(m):\r\n mat.append(input())\r\n\r\nrow_count = {}\r\nfor i in range(m):\r\n row_count[i] = Counter(mat[i])\r\n\r\ncol_count = {}\r\nfor j in range(n):\r\n curr_count = defaultdict(int)\r\n for i in range(m):\r\n curr_count[mat[i][j]] += 1\r\n col_count[j] = curr_count\r\n\r\ndecrypted = \"\"\r\nfor i in range(m):\r\n for j in range(n):\r\n curr = mat[i][j]\r\n if row_count[i][curr] == 1 and col_count[j][curr] == 1:\r\n decrypted += curr\r\n\r\nprint(decrypted)", "from collections import defaultdict\r\ndef main():\r\n n, m = map(int, input().split())\r\n matrix = []\r\n \r\n for i in range(n):\r\n matrix.append(input())\r\n \r\n row_freq = defaultdict(dict)\r\n col_freq = defaultdict(dict)\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n letter = matrix[i][j]\r\n if letter not in row_freq[i]:\r\n row_freq[i][letter] = 0\r\n \r\n if letter not in col_freq[j]:\r\n col_freq[j][letter] = 0\r\n row_freq[i][letter] += 1\r\n col_freq[j][letter] += 1\r\n \r\n encrypted = []\r\n for i in range(n):\r\n for j in range(m):\r\n letter = matrix[i][j]\r\n if row_freq[i][letter] == 1 and col_freq[j][letter] == 1:\r\n encrypted.append(letter)\r\n \r\n print(''.join(encrypted))\r\n \r\nmain()\r\n \r\n", "\r\nimport math\r\nimport sys\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\ndef RSIL(): return sorted(map(int, input().split()), reverse=True)\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nfrom collections import deque\r\nfrom heapq import heapify ,heappop , heappush,heappushpop,heapreplace,_heapify_max ,nlargest ,nsmallest\r\nimport copy\r\nfrom itertools import zip_longest\r\n\r\nsys.setrecursionlimit(2500)\r\n\r\n\r\ndef solve():\r\n n, m = II()\r\n matrix = []\r\n\r\n for _ in range(n):\r\n matrix.append(list(input()))\r\n\r\n transponseMatrix = list(map(list ,zip_longest(*matrix)))\r\n\r\n visted = set()\r\n\r\n for row in range(n):\r\n storage = defaultdict(tuple)\r\n for col in range(m):\r\n if matrix[row][col] in storage:\r\n visted.add((row, col))\r\n visted.add(storage[matrix[row][col]])\r\n storage[matrix[row][col]] = (row, col)\r\n\r\n\r\n for row in range(m):\r\n storage2 = defaultdict(tuple)\r\n for col in range(n):\r\n if transponseMatrix[row][col] in storage2:\r\n visted.add((col, row))\r\n visted.add((storage2[transponseMatrix[row][col]][1], storage2[transponseMatrix[row][col]][0]))\r\n storage2[transponseMatrix[row][col]] = (row, col)\r\n answer = \"\"\r\n # print(visted)\r\n for row in range(n):\r\n for col in range(m):\r\n if (row, col) not in visted:\r\n answer += matrix[row][col]\r\n\r\n print(answer)\r\n\r\n\r\n\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "from collections import defaultdict\r\nn,m = map(int,input().split())\r\ngrid = [input() for _ in range(n)]\r\n\r\nrow_dic = defaultdict(lambda : defaultdict(int))\r\ncol_dic = defaultdict(lambda : defaultdict(int))\r\n\r\nfor row in range(len(grid)):\r\n for col in range(len(grid[0])):\r\n row_dic[row][grid[row][col]] += 1\r\n\r\nfor col in range(len(grid[0])):\r\n for row in range(len(grid)):\r\n col_dic[col][grid[row][col]] += 1\r\n\r\n\r\nans = []\r\nfor row in range(len(grid)):\r\n for col in range(len(grid[0])):\r\n if row_dic[row][grid[row][col]] == 1 and col_dic[col][grid[row][col]] == 1:\r\n ans.append(grid[row][col])\r\n\r\nprint(''.join(ans))", "from collections import defaultdict\r\nn,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\narr = []\r\nfor i in range(n):\r\n a = input()\r\n arr.append(a)\r\n \r\nans = \"\"\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = arr[i][j]\r\n count = arr[i].count(letter)\r\n flag = True\r\n for k in range(n):\r\n if k != i:\r\n if arr[k][j] == letter:\r\n flag = False\r\n if flag and count == 1:\r\n ans+=letter\r\n \r\n\r\nprint(ans)\r\n \r\n \r\n ", "inds=set()\r\n\r\ndef is_not_clone(words,x,z):\r\n clone=1\r\n sim=words[z][x]\r\n #print('cursim=',sim)\r\n n=len(words)\r\n if (x,z) in inds:\r\n return 0\r\n for c,item in enumerate(words[z]):\r\n #print('c=%s sim=%s '%(c,item))\r\n if sim==item and c!=x:\r\n inds.add((c,z))\r\n clone=0\r\n for c in range(n):\r\n if sim==words[c][x] and c!=z:\r\n inds.add((x,c))\r\n clone=0\r\n return clone\r\n\r\nn,m = map(int, input().split())\r\n\r\nwords=list()\r\nfor c in range(n):\r\n s=input()\r\n words.append(s)\r\n\r\nout=''\r\n\r\nfor c in range(n):\r\n for d in range(m):\r\n if is_not_clone(words,d,c):\r\n out+=words[c][d]\r\nprint(out)\r\n", "n, m = map(int, input().split())\r\ncrossword = [input() for _ in range(n)]\r\n#isRepeated = [[False]*m for _ in range(n)]\r\nfinalStr = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n flg = False\r\n for k in range(m):\r\n if k==j:\r\n continue\r\n if crossword[i][k]==crossword[i][j]:\r\n flg = True\r\n break\r\n for k in range(n):\r\n if i==k:\r\n continue\r\n if crossword[k][j]==crossword[i][j]:\r\n flg = True\r\n break\r\n if not flg:\r\n finalStr += crossword[i][j]\r\nprint(finalStr)\r\n", "\r\nn,m = list(map(int, input().split()))\r\nboard = []\r\nfor i in range(n):\r\n board.append(list(input()))\r\n\r\n\r\ndef rem(li):\r\n counter = {}\r\n for i, char in enumerate(li):\r\n if char in counter:\r\n li[i] = \"\"\r\n li[counter[char]] = \"\"\r\n else:\r\n counter[char] = i\r\n return li\r\n\r\n\r\nboard_T = [[0]*n for i in range(m)]\r\ni= 0\r\nwhile i < m:\r\n j = 0\r\n while j < n:\r\n board_T[i][j] = board[j][i]\r\n j+=1\r\n i+=1\r\n\r\nfor row in board:\r\n row = rem(row)\r\nfor row in board_T:\r\n row = rem(row)\r\n\r\ni = 0\r\nwhile i < n:\r\n j = 0\r\n while j < m:\r\n if not (board[i][j] and board_T[j][i]):\r\n board[i][j] = ''\r\n j+=1\r\n i+=1\r\n\r\nres = \"\"\r\nfor row in board:\r\n for cell in row:\r\n res+= cell\r\n\r\nprint(res)\r\n\r\n\r\n\r\n\r\n", "n, m = list(map(int, input().split()))\r\nrow_map = [dict() for _ in range(n)]\r\ncol_map = [dict() for _ in range(m)]\r\ngrid = []\r\nfor i in range(n):\r\n row = input()\r\n grid.append(row)\r\n r_dict = row_map[i]\r\n for j in range(m):\r\n c_dict = col_map[j]\r\n val = row[j]\r\n r_dict[val] = 1 + r_dict.get(val, 0)\r\n c_dict[val] = 1 + c_dict.get(val, 0)\r\n\r\nfor i,li in enumerate(grid):\r\n for j, ele in enumerate(li):\r\n if row_map[i][ele] == 1 and col_map[j][ele] == 1:\r\n print(ele, end='')", "import collections\r\nn, m = map(int, input().split())\r\n\r\nboard = []\r\n\r\nfor i in range(n):\r\n words = list(input())\r\n board.append(words)\r\n\r\nnum = ((n - 1) * m) + (m - 1)\r\n\r\nrow_count = collections.defaultdict(dict)\r\ncol_count = collections.defaultdict(dict)\r\n\r\nfor idx in range(num + 1):\r\n r = idx // m\r\n c = idx % m\r\n letter = board[r][c]\r\n if letter not in row_count[r]:\r\n row_count[r][letter] = 1\r\n else:\r\n row_count[r][letter] += 1\r\n if letter not in col_count[c]:\r\n col_count[c][letter] = 1\r\n else:\r\n col_count[c][letter] += 1\r\n\r\nans = \"\"\r\nfor pos in range(num + 1):\r\n row = pos // m\r\n col = pos % m\r\n char = board[row][col] \r\n if row_count[row][char] == 1 and col_count[col][char] == 1:\r\n ans += char\r\nprint(ans)\r\n \r\n \r\n ", "from collections import Counter, defaultdict\r\n\r\nrow_len, col_len = map(int, input().split())\r\n\r\ngrid = []\r\n\r\nfor row in range(row_len):\r\n grid.append(list(input()))\r\n\r\nrow_map = {}\r\ncolumn_map = {}\r\n\r\n# count row wise\r\nfor index, row in enumerate(grid):\r\n row_map[index] = Counter(row)\r\n\r\n# count column wise\r\nfor c in range(col_len):\r\n temp = []\r\n for r in range(row_len):\r\n temp.append(grid[r][c])\r\n column_map[c] = Counter(temp)\r\n\r\n\r\nfor row in range(row_len):\r\n for col in range(col_len):\r\n\r\n current = grid[row][col]\r\n if current in column_map[col] and current in row_map[row]:\r\n if column_map[col][current] + row_map[row][current] > 2:\r\n grid[row][col] = \"\"\r\n\r\noutput = []\r\nfor row in grid:\r\n output += row\r\n\r\nprint(\"\".join(output))\r\n\r\n", "#!/bin/python \n# -*- coding: utf-8 -*-\n\nn, m = map(int, input().split())\nans = []\nM = []\nfor i in range(n):\n M.append(list(input()))\n\nfor i in range(n):\n for j in range(m):\n crossed = False\n for p in range(m):\n if p != j and M[i][p] == M[i][j]:\n crossed = True\n for k in range(n):\n if k != i and M[k][j] == M[i][j]:\n crossed = True\n if not crossed:\n ans.append(M[i][j])\n\nprint(''.join(ans))", "from collections import defaultdict\r\n\r\ndef proccess(grid, rows:int, cols:int):\r\n row_dicts = [defaultdict(list) for i in range(rows)]\r\n col_dicts = [defaultdict(list) for i in range(cols)]\r\n \r\n for row in range(rows):\r\n for col in range(cols):\r\n curr_val = grid[row][col]\r\n col_dicts[col][curr_val].append(row)\r\n row_dicts[row][curr_val].append(col)\r\n \r\n res= []\r\n\r\n for row in range(rows):\r\n for col in range(cols):\r\n curr_val = grid[row][col]\r\n \r\n if len(row_dicts[row][curr_val]) != 1 or len(col_dicts[col][curr_val]) != 1:\r\n continue\r\n else:\r\n res.append(curr_val[0])\r\n \r\n print(\"\".join(res))\r\n \r\n \r\n\r\n\r\nrows, cols = list(map(int,input().split()))\r\ngrid = []\r\nfor _ in range(rows):\r\n grid.append(input())\r\n \r\nproccess(grid, rows, cols)", "from collections import defaultdict\r\nfrom collections import Counter\r\nimport math\r\ndef intger():\r\n return int(input())\r\ndef num_lst():\r\n return list(map(int, input().split()))\r\ndef string():\r\n return input()\r\ndef str_lst():\r\n return list(input())\r\n\r\n\r\nr = num_lst()\r\nrow_dict = defaultdict(set)\r\ncol_dict = defaultdict(set)\r\n\r\nmat = []\r\nfor i in range(r[0]):\r\n temp = str_lst()\r\n mat.append(temp)\r\n\r\n\r\nfor i in range(r[0]):\r\n temp = set()\r\n for j in range(r[1]):\r\n if mat[i][j] in temp:\r\n row_dict[i].add(mat[i][j])\r\n temp.add(mat[i][j])\r\n\r\nfor i in range(r[1]):\r\n temp = set()\r\n for j in range(r[0]):\r\n if mat[j][i] in temp:\r\n col_dict[i].add(mat[j][i])\r\n temp.add(mat[j][i])\r\n\r\nfor i in range(r[0]):\r\n for j in range(r[1]):\r\n if mat[i][j] in row_dict[i] or mat[i][j] in col_dict[j]:\r\n mat[i][j] = 0\r\n\r\nans = \"\"\r\nfor i in range(r[0]):\r\n for j in range(r[1]):\r\n if mat[i][j] != 0:\r\n ans += mat[i][j]\r\n \r\n\r\nprint(ans)\r\n \r\n", "from collections import defaultdict, Counter\r\ndef numI(): return int(input())\r\ndef numII(): return list(input())\r\ndef numIII(): return list(map(int, input().split(' ')))\r\ndef strInp(): return input()\r\ndef strInpI(): return list(input())\r\n\r\ndef solve():\r\n r,c = numIII()\r\n mat = []\r\n col = defaultdict(list)\r\n for i in range(r):\r\n cur = strInpI()\r\n mat.append(cur)\r\n for j in range(c):\r\n col[j].append(cur[j])\r\n ans = \"\"\r\n for i in range(r):\r\n for j in range(c):\r\n cur = mat[i][j]\r\n if mat[i].count(cur) == 1 and col[j].count(cur) == 1:\r\n ans+=cur\r\n print(ans)\r\n \r\n \r\n\r\nsolve()", "def Sol():\r\n \r\n row , col = list(map(int, input().split()))\r\n \r\n answer=\"\"\r\n \r\n inbound = lambda x , y : 0 <= x < row and 0 <= y <col\r\n \r\n directions = [(0,1), (1,0),(-1,0),(0,-1)]\r\n \r\n \r\n grid = []\r\n \r\n for _ in range(row):\r\n \r\n grid.append(list(input()))\r\n \r\n \r\n \r\n for i in range(row):\r\n \r\n for j in range(col):\r\n isValid_letter=True\r\n \r\n \r\n \r\n \r\n for dx , dy in directions:\r\n curr_x = i + dx \r\n curr_y=j + dy\r\n \r\n while inbound(curr_x,curr_y) and grid[i][j]!=grid[curr_x][curr_y]:\r\n curr_x = curr_x + dx \r\n curr_y = curr_y + dy\r\n \r\n if inbound(curr_x,curr_y):\r\n isValid_letter=False\r\n break\r\n if isValid_letter:\r\n answer+=grid[i][j]\r\n print(answer) \r\nSol()", "n, m = map(int, input().split())\r\ngrid = [list(input()) for _ in range(n)]\r\ncount_row_chars = {}\r\ncount_col_chars = {}\r\nfor r in range(n):\r\n if r not in count_row_chars:\r\n count_row_chars[r] = [0]*26\r\n for c in range(m):\r\n if c not in count_col_chars:\r\n count_col_chars[c] = [0]*26\r\n count_row_chars[r][ord(grid[r][c]) - ord(\"a\")] += 1\r\n count_col_chars[c][ord(grid[r][c]) - ord(\"a\")] += 1\r\n\r\nresult = []\r\n\r\nfor r in range(n):\r\n for c in range(m):\r\n if count_row_chars[r][ord(grid[r][c]) - ord(\"a\")] <= 1 and count_col_chars[c][ord(grid[r][c]) - ord(\"a\")] <= 1:\r\n result.append(grid[r][c])\r\n\r\nresult = \"\".join(result)\r\nprint(result)", "n, m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n a = list(input()) \r\n grid.append(a)\r\ndic = {}\r\n \r\n# print(grid)\r\nfor i in range(n):\r\n for j in range(m): \r\n flag = False \r\n for k in range(j, m): \r\n if(grid[i][j]==grid[i][k] and j!=k):\r\n dic[(i, k)] = True\r\n flag = True\r\n # print(dic) \r\n \r\n for k in range(i, n): \r\n if(grid[i][j]==grid[k][j] and i!=k): \r\n dic[(k, j)] = True\r\n flag = True \r\n if flag:\r\n dic[(i, j)] = True \r\n\r\n \r\n# print(dic)\r\nans = ''\r\nfor i in range(n): \r\n for j in range(m): \r\n if(i, j) not in dic:\r\n ans += grid[i][j] \r\n \r\nprint(ans)", "n,m =map(int,input().split());lst=[]\r\nfor i in range(n):\r\n lst.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if lst[i].count(lst[i][j])==1:\r\n c=0\r\n for k in range(n):\r\n if lst[k][j]==lst[i][j]:\r\n c+=1 \r\n if c==1:\r\n print(lst[i][j],end='')\r\n", "def crossout(grid, row, col):\r\n\r\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n checkBound = lambda r, c: -1 < r < len(grid) and -1 < c < len(grid[0])\r\n target = grid[row][col]\r\n curr_row = row\r\n curr_col = col\r\n\r\n for direction in directions:\r\n\r\n while checkBound(curr_row, curr_col):\r\n \r\n if (curr_row != row or curr_col != col) and grid[curr_row][curr_col] == target:\r\n return True\r\n \r\n curr_row += direction[0]\r\n curr_col += direction[1]\r\n\r\n curr_row = row\r\n curr_col = col\r\n\r\n return False\r\n\r\nn, m = map(int, input().split())\r\ngrid = []\r\nencrypted = []\r\n\r\nfor _ in range(n):\r\n row = input()\r\n grid.append(row)\r\n\r\nfor row in range(n):\r\n for col in range(m):\r\n\r\n if crossout(grid, row, col):\r\n continue\r\n\r\n encrypted.append(grid[row][col])\r\n\r\nprint(''.join(encrypted))", "#codeforces 90B\r\na,b = list(map(int,input().split()))\r\nc =[]\r\nd=''\r\nfor i in range(a):\r\n c.append(input())\r\nfor i in range(a):\r\n for j in range(b):\r\n if c[i].count(c[i][j])==1:\r\n if list(c[k][j] for k in range(a)).count(c[i][j])==1:\r\n d+=c[i][j]\r\nprint(d)", "from collections import Counter\n\nn, m = map(int, input().split())\n\ngrid = []\n\nfor i in range(n):\n row = input()\n grid.append(row)\n\nduplicate_array = grid.copy()\n\nword = \"\"\n\nfor i in range(n):\n row = grid[i]\n count = Counter(row)\n for j in range(m):\n if count[row[j]] > 1:\n duplicate_array[i] = duplicate_array[i][:j] + \"#\" + duplicate_array[i][j+1:]\n\nfor j in range(m):\n col = [grid[i][j] for i in range(n)]\n count = Counter(col)\n for i in range(n):\n if count[col[i]] > 1:\n duplicate_array[i] = duplicate_array[i][:j] + \"#\" + duplicate_array[i][j+1:]\n\n\nfor i in range(n):\n for j in range(m):\n if duplicate_array[i][j] != \"#\":\n word += duplicate_array[i][j]\n\nprint(word)", "n,m =list(map(int,input().split()))\r\ngrid=[]\r\nfor i in range(n):\r\n grid.append(list(input()))\r\n\r\ndirections=[[1,0],[0,1],[0,-1],[-1,0]]\r\nstring=''\r\nfor i in range(n):\r\n for j in range(m):\r\n char=grid[i][j]\r\n unique=True\r\n for dir in directions:\r\n x,y =dir\r\n x0,y0=i+x,j+y\r\n while 0<=x0<n and 0<=y0<m:\r\n curr=grid[x0][y0]\r\n if curr==char:\r\n unique=False\r\n break\r\n x0+=x\r\n y0+=y\r\n if unique:\r\n string+=char\r\nprint(string)\r\n ", "dimensions=list(map(int,input().split()))\r\n\r\nmat_row=dimensions[0]\r\nmat_col=dimensions[1]\r\nmatrix=[]\r\noutput_word=[]\r\nfor x in range(0,mat_row):\r\n matrix.append(list(input()))\r\n \r\n#print(matrix)\r\n\r\nfor r in range(0,len(matrix)):\r\n for c in range(0,len(matrix[0])):\r\n \r\n row=matrix[r]\r\n col=[matrix[x][c] for x in range(0,mat_row)]\r\n #row.remove(matrix[r][c])\r\n #col.remove(matrix[r][c])\r\n #print(matrix[r][c],row.count(matrix[r][c]),col.count(matrix[r][c]))\r\n \r\n if row.count(matrix[r][c])==1 and col.count(matrix[r][c])==1:\r\n \r\n #print(matrix[r][c])\r\n output_word.append(matrix[r][c])\r\n \r\nprint(''.join(output_word))", "from collections import Counter\r\nn, m = map(int, input().split())\r\nmtx = []\r\nfor i in range(n):\r\n mtx.append(input())\r\n\r\nmtx2 = []\r\nfor i in range(m):\r\n col = []\r\n for r in range(n):\r\n col.append(mtx[r][i])\r\n mtx2.append(col)\r\nans = \"\"\r\nfor i in range(n):\r\n row = Counter(mtx[i])\r\n for j in range(m):\r\n col = Counter(mtx2[j])\r\n if row[mtx[i][j]] == 1 and col[mtx[i][j]] == 1 :\r\n ans += str(mtx[i][j])\r\nprint(ans)", "#African crossword\r\nN = 100\r\nM = 100\r\nreference = [[1 for j in range(M)] for i in range(N)]\r\n\r\ndef screen_map(in_map, n, m):\r\n for i in range(n):\r\n for j in range(m):\r\n\r\n ch = in_map[i][j]\r\n\r\n for k in range(j+1, m, 1):\r\n if in_map[i][k] == ch:\r\n reference[i][k] = 0\r\n reference[i][j] = 0\r\n\r\ndef screen_map1(in_map, n, m):\r\n for i in range(n):\r\n for j in range(m):\r\n #if reference[j][i] == 1:\r\n ch = in_map[i][j]\r\n for k in range(j+1, m, 1):\r\n if in_map[i][k] == ch:\r\n reference[k][i] = 0\r\n reference[j][i] = 0\r\n\r\n\r\ndef transpose_map(in_map, n, m):\r\n out_map = [['' for i in range(n)] for j in range(m)]\r\n for i in range(n):\r\n for j in range(m):\r\n out_map[j][i] = in_map[i][j]\r\n\r\n return out_map\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int,input().split())\r\n input_map = [['' for j in range(m)] for i in range(n)]\r\n trans_map = [['' for i in range(n)] for j in range(m)]\r\n #reference = [[1 for j in range(m)] for i in range(n)]\r\n for i in range(n):\r\n input_map[i] = list(input())\r\n\r\n screen_map(input_map,n,m)\r\n trans_map = transpose_map(input_map, n, m)\r\n screen_map1(trans_map,m,n)\r\n\r\n \r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if reference[i][j] == 1:\r\n print(input_map[i][j], end ='')\r\n", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\ncrossword = []\r\nfor i in range(n):\r\n temp = list(input())\r\n crossword.append(temp)\r\n\r\nduplicates = set()\r\nfor i in range(n):\r\n check = defaultdict(list)\r\n for j in range(m):\r\n if crossword[i][j] in check:\r\n duplicates.add((i, j))\r\n duplicates.add((check[crossword[i][j]][0], check[crossword[i][j]][1]))\r\n else:\r\n check[crossword[i][j]] = [i, j]\r\n\r\nfor i in range(m):\r\n check = defaultdict(list)\r\n for j in range(n):\r\n if crossword[j][i] in check:\r\n duplicates.add((j, i))\r\n duplicates.add((check[crossword[j][i]][0], check[crossword[j][i]][1]))\r\n else:\r\n check[crossword[j][i]] = [j, i]\r\n\r\nans = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n if (i, j) not in duplicates:\r\n ans += crossword[i][j]\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "rows,cols = map(int,input().split())\r\n\r\nmatrix = [input() for _ in range(rows)]\r\n\r\ndef crosswordSolve(grid,rows,cols):\r\n # create a boolean grid to mark repeated letters in grid\r\n cross_out = [[False for _ in range(cols)] for _ in range(rows)]\r\n #for rows\r\n # keep of track of counts of each letter for a row\r\n for r in range(rows):\r\n row_counts = {}\r\n for c in range(cols):\r\n current = grid[r][c]\r\n row_counts[current] = row_counts.get(current,0)+1\r\n\r\n # check if letter appears more than once in a row \r\n # and mark its position in the cross_out grid as True if it does\r\n for c in range(cols):\r\n if row_counts[grid[r][c]] > 1:\r\n cross_out[r][c]=True\r\n #For columns\r\n #keep track of counts of each letter in a column\r\n for c in range(cols):\r\n col_counts = {}\r\n for r in range(rows):\r\n current = grid[r][c]\r\n col_counts[current]=col_counts.get(current,0)+1\r\n\r\n # check if letter appears more than once in a column \r\n # and mark its position in the cross_out grid as True If it does \r\n for r in range(rows):\r\n letter = grid[r][c]\r\n if col_counts[letter]>1:\r\n cross_out[r][c]=True\r\n\r\n #create the encrypted word\r\n encrypted_word = \"\"\r\n for r in range(rows):\r\n for c in range(cols):\r\n if not cross_out[r][c]:\r\n encrypted_word+= grid[r][c]\r\n\r\n return encrypted_word\r\n \r\nprint(crosswordSolve(matrix,rows,cols))", "n, m = map(int, input().split())\r\na = []\r\ns = ''\r\nb = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\n b.append(a[i][:])\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i].count(a[i][j]) != 1:\r\n b[i][j] = ''\r\nfor i in range(m):\r\n for j in range(n):\r\n letter = a[j][i]\r\n cnt = 0\r\n for k in range(n):\r\n if letter == a[k][i]:\r\n cnt += 1\r\n if cnt > 1:\r\n b[j][i] = ''\r\nfor i in range(n):\r\n for j in range(m):\r\n print(b[i][j], end='')", "row,col=list(map(int,input().split()))\r\ngrid=[]\r\nfor _ in range(row):\r\n element=list(input())\r\n grid.append(element)\r\n\r\nfor r in range(row):\r\n seen={}\r\n for c in range(col):\r\n if grid[r][c] in seen:\r\n ro,co=seen[grid[r][c]]\r\n grid[r][c]+=\"0\"\r\n grid[ro][co]+=\"0\"\r\n seen[grid[r][c]]=[r,c]\r\nfor c in range(col):\r\n seen={}\r\n for r in range(row):\r\n if grid[r][c][0] in seen:\r\n ro,co=seen[grid[r][c][0]]\r\n grid[r][c]+=\"0\"\r\n grid[ro][co]+=\"0\"\r\n seen[grid[r][c][0]]=[r,c]\r\n\r\nanswer=\"\"\r\nfor r in range(row):\r\n for c in range(col):\r\n if grid[r][c][-1]!=\"0\":\r\n answer+= grid[r][c] \r\nprint(answer)\r\n", "def Zam(crossword):\r\n a=[]\r\n for i in crossword: \r\n flag=1\r\n strk=i\r\n for j in i:\r\n if i.count(j) >1 and j!='_': \r\n strk=strk.replace(j,'_') \r\n a+=[strk]\r\n return a\r\nn,m=(int(i) for i in input().split())\r\ncrossword=[]\r\ncrossword_rev=['0'*n for i in range(m)]\r\nfor i in range(n):\r\n crossword+=[ i for i in input().split()]\r\nfor i in range(m):\r\n strk=''\r\n for j in range(n):\r\n strk+=crossword[j][i]\r\n crossword_rev[i]=strk\r\ncrossword =Zam(crossword)\r\ncrossword_rev =Zam(crossword_rev)\r\nstrk=''\r\nfor i in range(n):\r\n for j in range(m):\r\n if crossword_rev[j][i]==crossword[i][j]!='_':\r\n # print(crossword_rev[j][i])\r\n strk+=crossword_rev[j][i]\r\n\r\nprint(strk)\r\n", "row, col = list(map(int, input().split()))\r\nmatrix = [[*input()] for _ in range(row)]\r\n\r\nanswer = []\r\n\r\nfor i in range(row):\r\n for j in range(col):\r\n noDuplicates = True\r\n for k in range(row):\r\n if k != i and matrix[i][j] == matrix[k][j]:\r\n noDuplicates = False\r\n break\r\n if not noDuplicates:\r\n continue\r\n for k in range(col):\r\n if k != j and matrix[i][j] == matrix[i][k]:\r\n noDuplicates = False\r\n break\r\n if noDuplicates:\r\n answer.append(matrix[i][j])\r\nprint(*answer, sep=\"\")\r\n ", "m, n = list(map(int,input().split()))\r\ngrid = []\r\nres = []\r\n\r\nfor r in range(m):\r\n row = list(input())\r\n grid.append(row)\r\n\r\ndef traverse(i,j):\r\n original = grid[i][j][-1]\r\n count = 1\r\n\r\n while i + count < m:\r\n if grid[i+count][j][-1] == original:\r\n grid[i+count][j] = grid[i][j] = \"1\" + original\r\n\r\n count += 1\r\n\r\n count = 1\r\n while j + count < n:\r\n if grid[i][j+count][-1] == original:\r\n grid[i][j+count] = grid[i][j] = \"1\" + original\r\n\r\n count += 1\r\n\r\nfor row in range(m):\r\n for col in range(n):\r\n traverse(row,col)\r\n if grid[row][col].isalpha():\r\n res.append(grid[row][col])\r\n\r\nprint(\"\".join(res))", "n, m = list(map(int, input().split()))\r\n\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(list(input()))\r\n\r\n\r\nduplicated = set()\r\nfor row in range(n):\r\n for col in range(m):\r\n # row wise check\r\n for i in range(m):\r\n if (row, col) == (row, i):\r\n continue\r\n \r\n if grid[row][col] == grid[row][i]:\r\n duplicated.add((row, col))\r\n duplicated.add((row, i))\r\n \r\n # Column wise check\r\n for j in range(n):\r\n if (row, col) == (j, col):\r\n continue\r\n \r\n if grid[row][col] == grid[j][col]:\r\n duplicated.add((row, col))\r\n duplicated.add((j, col))\r\n \r\n\r\nans = []\r\nfor row in range(n):\r\n for col in range(m):\r\n if (row, col) not in duplicated:\r\n ans.append(grid[row][col])\r\n \r\nprint(\"\".join(ans) )\r\n\r\n ", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\nrow = [[] for _ in range(n)]\r\ncolumn = [[] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n letters = {}\r\n for j in range(m):\r\n if grid[i][j] in letters:\r\n letters[grid[i][j]] += 1\r\n else:\r\n letters[grid[i][j]] = 1\r\n\r\n for j in range(m):\r\n if letters[grid[i][j]] > 1:\r\n row[i].append('')\r\n else:\r\n row[i].append(grid[i][j])\r\nfor i in range(m):\r\n letters = {}\r\n for j in range(n):\r\n if grid[j][i] in letters:\r\n letters[grid[j][i]] += 1\r\n else:\r\n letters[grid[j][i]] = 1\r\n\r\n for j in range(n):\r\n if letters[grid[j][i]] > 1:\r\n column[j].append('')\r\n else:\r\n column[j].append(grid[j][i])\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if row[i][j] != '' and column[i][j] != '':\r\n print(row[i][j], end='')", "from collections import Counter\r\n\r\nn, m = map(int, input().split())\r\n\r\ng = []\r\n\r\nfor i in range(n):\r\n row = input()\r\n g.append(row)\r\n\r\nd_array = g.copy()\r\n\r\nword = \"\"\r\n\r\nfor i in range(n):\r\n row = g[i]\r\n count = Counter(row)\r\n for j in range(m):\r\n if count[row[j]] > 1:\r\n d_array[i] = d_array[i][:j] + \"#\" + d_array[i][j+1:]\r\n\r\nfor j in range(m):\r\n col = [g[i][j] for i in range(n)]\r\n count = Counter(col)\r\n for i in range(n):\r\n if count[col[i]] > 1:\r\n d_array[i] = d_array[i][:j] + \"#\" + d_array[i][j+1:]\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if d_array[i][j] != \"#\":\r\n word = word + d_array[i][j]\r\n\r\nprint(word)", "n, m = map(int, input().split())\r\nmatrix_row = []\r\nfor i in range(n):\r\n matrix_row.append(list(input()))\r\n\r\nmatrix_col = list(zip(*matrix_row))\r\nd_row = []\r\nd_col = []\r\nresult = []\r\n\r\n#print(matrix_row)\r\n#print(matrix_col)\r\n\r\nfor i in range(n): #Row i_th\r\n d = {} #dictionary for this row\r\n for j in range(m): #column j_th\r\n letter = matrix_row[i][j]\r\n if letter in d: \r\n d[letter] += 1\r\n else:\r\n d[letter] = 1\r\n d_row.append(d)\r\n \r\n#print(d_row)\r\n\r\nfor j in range(m): #Col j_th\r\n d = {} #dictionary for this row\r\n for i in range(n): #Row i_th\r\n letter = matrix_col[j][i]\r\n if letter in d: \r\n d[letter] += 1\r\n else:\r\n d[letter] = 1\r\n d_col.append(d)\r\n\r\n#print(d_col)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = matrix_row[i][j]\r\n if d_row[i][letter] == 1 and d_col[j][letter] == 1:\r\n result.append(letter)\r\n \r\nprint(''.join(result))" ]

[ "def test(n,k):\n sumi = n \n i = 1\n while n >= k **i :\n sumi += n // k**i\n i+=1\n return sumi\n\nn,k = map(int,input().split())\nstart = 1\nend = n\nans = -1\nwhile start <= end :\n mid = (start +end) //2\n res = test(mid,k)\n if res < n :\n start = mid +1\n elif res >= n :\n ans = mid\n end = mid -1 \n\nprint(ans)\n", "def minimum_vasya_lines(n, k):\r\n lo, hi = 1, n\r\n while lo < hi:\r\n mid = (lo + hi) // 2\r\n total_lines = mid\r\n productivity = 1\r\n while mid // (k ** productivity) > 0:\r\n total_lines += mid // (k ** productivity)\r\n productivity += 1\r\n if total_lines >= n:\r\n hi = mid\r\n else:\r\n lo = mid + 1\r\n return lo\r\n\r\nn, k = map(int, input().split())\r\n\r\nresult = minimum_vasya_lines(n, k)\r\nprint(result)\r\n", "n, k = map(int, input().split())\r\n\r\n\r\ndef ok(v, n, k):\r\n summ = 0\r\n p = 1\r\n while summ < n and v >= p:\r\n summ += v // p\r\n p *= k\r\n return summ >= n\r\n\r\n\r\nleft, right = 0, n\r\nwhile left + 1 < right:\r\n mid = left + (right - left) // 2\r\n if ok(mid, n, k):\r\n right = mid\r\n else:\r\n left = mid\r\n\r\nprint(right)", "import math\nn, k = map(int, input().split())\n\ndef finished(v):\n\n if v == 0:\n return False\n\n total = 0\n p = 0\n cur_sum = math.floor(v / math.pow(k, p))\n\n while cur_sum > 0:\n\n total += cur_sum\n p += 1\n cur_sum = math.floor(v / math.pow(k, p))\n \n\n return total >= n\n\nlow = 1\nhigh = n\n\nwhile low <= high:\n\n mid = (low + high) // 2\n\n if finished(mid) and not finished(mid - 1):\n print(mid)\n break\n elif finished(mid):\n high = mid - 1\n else:\n low = mid + 1\n\n\n \n ", "from sys import stdin,stdout\r\n#input = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n #n = int(input())\r\n #a,b,c = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n n,k = map(int,input().split())\r\n low = 1\r\n high = n\r\n mid = (high + low) // 2\r\n def f(num):\r\n ans = 0\r\n while num > 0:\r\n ans += num\r\n num //= k\r\n return ans >= n\r\n while high > low:\r\n if f(mid):\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n mid = (high + low) // 2\r\n if f(mid) == 0:\r\n mid += 1\r\n print(mid)\r\nmain()\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n m = (c1 + c2 + 1) // 2\r\n if ok(m):\r\n c2 = m\r\n else:\r\n c1 = m\r\n m = max(m - 2, 0)\r\n while not ok(m):\r\n m += 1\r\n return m\r\n\r\ndef ok(m):\r\n u = 1\r\n c = 0\r\n while m // u:\r\n c += m // u\r\n u *= k\r\n return True if c >= n else False\r\n\r\nn, k = map(int, input().split())\r\ninf = pow(10, 9) + 1\r\nans = binary_search(0, inf)\r\nprint(ans)", "def check(x):\r\n ans =0 \r\n while(x>0):\r\n ans+=x \r\n x//=k\r\n if (ans>=n):\r\n return True \r\n return False\r\nn,k = map(int,input().split())\r\nl = 0 \r\nr = 10**9 + 1 \r\nwhile(r>=l):\r\n m = (r+l)//2 \r\n if (check(m)):\r\n r = m-1 \r\n else:\r\n l = m+1 \r\n\r\nprint(l)", "import math\r\ndef check(v,k):\r\n ans=0\r\n t=1\r\n while v//t!=0:\r\n ans+=v//t\r\n t=t*k\r\n return ans\r\n\r\nn,k=map(int,input().split())\r\nl=1\r\nr=2*(10**9)\r\nans=10**9\r\nwhile l<=r:\r\n mid=(l+r)//2\r\n #print(mid)\r\n if check(mid,k)>=n:\r\n ans=min(ans,mid)\r\n r=mid-1\r\n else:l=mid+1\r\nprint(ans)\r\n", "def f(p, k):\n a = 0\n while p:\n a += p\n p //= k\n return a\n\nn, k = (int(x) for x in input().split())\nl, r = 1, k * n\nwhile l <= r:\n m = (l + r) // 2\n u = f(m, k)\n if u == n:\n r = m - 1\n elif u < n:\n l = m + 1\n else:\n r = m - 1\nprint(l)\n", "def check(n,v,k):\r\n j=n-v\r\n m=k\r\n while j>0:\r\n if v//m==0:\r\n break\r\n j-=(v//m)\r\n m*=k\r\n return j<=0\r\n \r\nn,k=map(int,input().split())\r\nl=0\r\nr=n\r\nwhile l<r:\r\n mid=(l+r)//2\r\n if check(n,mid,k):\r\n r=mid\r\n else:\r\n l=mid+1\r\nprint(l)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "import sys\n\nONLINE_JUDGE = True\n\nif not ONLINE_JUDGE:\n sys.stdin = open(\"input.text\", \"r\")\n\n############ ---- Input Functions ---- ############\n\ndef inp(): # integer\n return(int(input()))\ndef inlt(): # lists\n return(list(map(int,input().split())))\ndef insr(): # list of characters\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr(): # space seperate integers\n return(map(int,input().split()))\n\n\n############ ---- Solution ---- ############\nn, k = invr()\n\nlo = 1\nhi = n\n\nans = float('inf')\nwhile (lo <= hi):\n mid = (lo + hi)//2\n\n cnt = mid\n m = k\n while True:\n x = mid // m\n m *= k\n cnt += x\n\n if (x == 0):\n break\n\n if (cnt == n):\n ans = mid\n break\n if (cnt > n):\n ans = min(ans, mid)\n hi = mid - 1\n else:\n lo = mid + 1\n\nprint(ans)\n\n\n\n\n\n \n", "n, k = map(int,input().split())\ndef binski(n, k, l, r):\n while l < r:\n d = (l+r)//2\n if checker(n, d, k):\n r = d\n else:\n l = d+1\n print(l)\n\ndef checker(n, d, k):\n ans = 0\n i = 1\n while d // i > 0:\n ans += d // i\n i *= k\n return ans >= n\n\nbinski(n, k, 0, 10**9+1)", "n, k = map(int, input().split())\r\nr = n+1\r\nl = 0\r\n\r\n\r\ndef check(ans):\r\n cnt = 0\r\n while ans > 0:\r\n cnt += ans\r\n ans = ans // k\r\n return cnt >= n\r\n\r\n\r\nwhile r - l > 1:\r\n m = (r + l) // 2\r\n if check(m):\r\n r = m\r\n else:\r\n l = m\r\nprint(r)", "s=input()\r\ns1=s.split()\r\n\r\nn=int(s1[0])\r\n\r\nk=int(s1[1])\r\n\r\n\r\ndef check(x,k):\r\n\r\n tot=0\r\n global n\r\n while x>0:\r\n\r\n tot=tot+x\r\n\r\n x=x//k\r\n\r\n if tot>=n:\r\n return(True)\r\n else:\r\n return(False)\r\n\r\n\r\ni=0\r\nj=n\r\n\r\nwhile j>i:\r\n\r\n mid=(i+j)//2\r\n\r\n if check(mid,k)==True:\r\n\r\n j=mid\r\n else:\r\n\r\n i=mid+1\r\n \r\nprint((i+j)//2)\r\n \r\n", "def works(v, n, k):\r\n\ttotal = 0\r\n\tincr = v + (v//k)\r\n\ti = 2\r\n\twhile incr != 0 and total < n:\r\n\t\ttotal += incr\r\n\t\tdiv = k ** i\r\n\t\ti += 1\r\n\t\tincr = v // div\r\n\treturn total >= n\r\n\r\ndef find_working(n, k):\r\n\tlow = 0\r\n\thigh = n\r\n\tpossible_v = (low + high) // 2\r\n\twhile low < high:\r\n\t\tif works(possible_v, n, k): \r\n\t\t\thigh = possible_v\r\n\t\telse:\r\n\t\t\tlow = possible_v + 1\r\n\r\n\t\tpossible_v = (low + high) // 2\r\n\treturn possible_v\r\n\r\n\r\nn_k = input().split()\r\nn = int(n_k[0])\r\nk = int(n_k[1])\r\nprint(find_working(n, k))\r\n\r\n", "I=lambda:list(map(int,input().split()))\r\nimport sys,math as mt\r\nn,k=I()\r\nl=1\r\nh=n+1\r\nwhile l<h:\r\n\tmid=(l+h)//2\r\n\ttemp=mid\r\n\tans=0\r\n\twhile temp:\r\n\t\tans+=temp\r\n\t\ttemp//=k\r\n\tif n>ans:\r\n\t\tl=mid+1\r\n\telse:\r\n\t\th=mid\r\nprint(l)\r\n", "def get_lines(v, k):\r\n ans = v; curr = v\r\n while curr // k > 0:\r\n ans += curr // k\r\n curr /= k\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\nlo = 1; hi = n * k\r\n\r\nwhile lo < hi:\r\n if lo == hi - 1: break\r\n mid = (lo + hi) // 2\r\n if get_lines(mid, k) < n:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\nif get_lines(lo - 1, k) >= n: \r\n ans = lo - 1\r\nelif get_lines(lo, k) >= n: \r\n ans = lo\r\nelif get_lines(lo + 1, k) >= n: \r\n ans = lo + 1\r\n\r\nprint(ans)", "# توكلت على الله\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\n \r\ndef solve():\r\n n,m = map(int,input().split())\r\n l = 0\r\n r = 1000000000\r\n while l < r :\r\n mid = l+(r-l)//2\r\n s = 0\r\n t = 1\r\n while mid//t:\r\n s+=mid//t\r\n t*=m\r\n if s < n :\r\n l = mid+1\r\n else :\r\n r = mid\r\n \r\n print(l)\r\n#for i in range(int(input())):\r\nsolve() \r\n", "def main():\n inp = input().split(\" \")\n n = int(inp[0])\n k = int(inp[1])\n\n l = 1\n r = n+1\n mid = (l+r) // 2\n\n while (l < r):\n curr = check(n, k, mid)\n if curr:\n r = mid\n else: \n l = mid + 1\n mid = (l+r) // 2\n \n print(l)\n\n\ndef check(n, k, v):\n div = v\n sum = 0\n while (div != 0):\n sum += div\n div //= k\n\n return sum >= n\n\nif __name__ == main():\n main()", "l = input().split()\nn = int(l[0])\nk = int(l[1])\n\nleft, right = 1, n\n\nans = -1\nwhile left <= right:\n mid = (left + right) // 2\n # print(left, right, mid)\n div = 1\n s = 0\n work = False\n while mid // div > 0:\n s += mid // div\n div *= k\n if s >= n:\n ans = mid\n work = True\n break\n # print(s)\n if work:\n right = mid - 1\n else:\n left = mid + 1\nprint(ans)\n", "def check(mid):\r\n ans = 0\r\n den = 1\r\n while (mid // den) > 0:\r\n ans += (mid // den)\r\n den *= k\r\n if ans >= n:\r\n return 1\r\n return 0\r\n\r\n\r\ndef bin_search(l, r):\r\n while l < r:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n r = mid\r\n else:\r\n l = mid + 1\r\n return l\r\n\r\n\r\nn, k = [int(i) for i in input().split()]\r\na1 = bin_search(0, 1000000001)\r\nprint(a1)\r\n", "n_total, k_rate = (int(_) for _ in input().split())\n\ndef predicate(v):\n sum = 0\n count = 0\n org_v = v\n # print(f\"sum({v}): \", end=' ')\n while(v > 0):\n sum += v\n count += 1\n v = org_v // (k_rate ** count)\n # print(f\"{sum} .. while n_total={n_total}\")\n return sum < n_total\n\ndef binary_search():\n lo = 0\n hi = n_total\n while(1):\n if(hi - lo == 1):\n return hi\n mid = (lo) + (hi - lo) // 2\n if(predicate(mid)):\n # print(f\"Setting Low={lo} to {mid}\")\n lo = mid\n else:\n # print(f\"Setting High={hi} to {mid}\")\n hi = mid\n\nprint(binary_search())\n", "n,k = map(int,input().split())\r\n\r\nl = 1\r\nr = 10**10\r\n\r\nwhile l != r:\r\n m = (l+r)//2\r\n\r\n tot = 0\r\n p = 0\r\n while m >= pow(k,p):\r\n tot += m//pow(k,p)\r\n p += 1\r\n\r\n if tot >= n:\r\n r = m\r\n else:\r\n l = m+1\r\n\r\nprint(l)", "inputList = input().split(' ')\r\nn = int(inputList[0])\r\nk = int(inputList[1])\r\nlow = 1\r\nhigh = n\r\nwhile low != high:\r\n midPoint = ((low + high) // 2)\r\n val = midPoint\r\n sum = 0\r\n while val != 0:\r\n sum += val\r\n val //= k\r\n if sum >= n:\r\n high = midPoint\r\n else:\r\n low = midPoint + 1\r\nprint(low)", "a,b = map(int,input().split())\r\nl,r = 0,a\r\ndef cn(mid):\r\n n = mid\r\n i = 1\r\n s = mid//(pow(b,i))\r\n while s!=0:s = mid//(pow(b,i));n+=s;i+=1\r\n return True if n>=a else False\r\nwhile l<=r:\r\n mid = (l+r)//2\r\n if cn(mid):r = mid-1\r\n else:l = mid+1\r\n\r\nprint(l)", "n, k = map(int, input().split())\r\nl, r = 0, 2 * (10 ** 9)\r\nwhile l < r:\r\n\tm = (l + r) // 2\r\n\ts, t = 0, 1\r\n\twhile m // t:\r\n\t s += m // t\r\n\t t *= k\r\n\tif s < n:\r\n\t l = m + 1\r\n\telse:\r\n\t r = m\r\nprint(l)", "# get n, k\nn, k = map(int, input().split())\n\n\ndef compute_n_with_v_k(v, k):\n n = v\n while v > 0:\n v = v // k\n n += v\n\n return n\n\n\n# for any v, n as around v*k/(k-1) so v is around n*(k-1)/k\nv = int(n * (k - 1) / k)\n\nwhile compute_n_with_v_k(v, k) < n:\n v += 1\n\nprint(v)\n", "from sys import stdin\nfrom math import log,ceil\n\ndef lmap(function, iterable): return list(map(function, iterable))\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return lmap(converter, line().split(delimeter))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMOD = 10**9+7\nMULTIPLE_CASES = 0\n\ndef main():\n N,K = rl(int)\n\n l,r = 1,10**9\n ans = None\n\n while l <= r:\n m = (l+r)//2\n\n if sum(int(m/(K**p)) for p in range(ceil(log(N,K))+1)) >= N:\n ans = m\n r = m-1\n else:\n l = m+1\n\n print(ans)\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn,k = list(map(int,input().split()))\r\n\r\ndef binarysearch(low:int,high:int):\r\n ans = n\r\n \r\n while low <= high:\r\n \r\n mid = low + (high-low)//2\r\n product = 1\r\n sums = 0\r\n \r\n while(mid//product > 0):\r\n sums += mid//product\r\n product *= k\r\n \r\n if sums >= n:\r\n ans = mid\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n \r\n return ans\r\n\r\nprint(binarysearch(1,n))\r\n", "import sys\nn,k=map(int,input().split())\nif n <= k :\n print(n)\nelse:\n start = k ; end = n\n while end > start :\n mid = (start+end)//2\n y=1 ; ans = mid\n while mid >= (k**y):\n ans += mid//(k**y)\n y+=1\n if ans == n :\n print(mid)\n sys.exit(0)\n elif ans > n :\n rr = mid\n end = mid\n else:\n start = mid+1\n print(rr)\n \t \t \t\t\t\t\t \t\t\t\t\t \t\t\t \t\t", "#4314087 Aug 20, 2013 4:53:51 AM fuwutu 165B - Burning Midnight Oil Python 3 Accepted 124 ms 0 KB\r\nl = input().split(' ')\r\nn, k = int(l[0]), int(l[1])\r\nleft, right = 1, n\r\nwhile left != right:\r\n x = middle = (left + right) // 2\r\n sum = 0\r\n while x != 0:\r\n sum += x\r\n x //= k\r\n if sum >= n:\r\n right = middle\r\n else:\r\n left = middle + 1\r\nprint(left)\r\n", "progLines, reduceFactor = map(int, input().split())\r\n\r\nhi = 10**9\r\nlo = 0\r\nwhile lo < hi - 1:\r\n mid = (hi - lo) // 2 + lo\r\n\r\n # test mid\r\n numLines = mid\r\n div = reduceFactor\r\n while mid // div != 0:\r\n numLines += mid // div\r\n div *= reduceFactor\r\n\r\n if numLines < progLines:\r\n lo = mid\r\n else:\r\n hi = mid\r\n\r\nprint(hi)\r\n", "def good(n, k, v):\r\n s = 0\r\n while v > 0:\r\n s += v\r\n v //= k\r\n return s >= n\r\n\r\n\r\ndef solve(n, k):\r\n l = 0\r\n r = 1\r\n while not good(n, k, r):\r\n r *= 2\r\n while r - l > 1:\r\n m = (l + r) // 2\r\n if good(n, k, m):\r\n r = m\r\n else:\r\n l = m\r\n return r\r\n\r\n\r\nn, k = [int(x) for x in input().split(' ')]\r\nprint(solve(n, k))", "def works(v):\n total = v\n lines = v\n while lines > 0:\n lines //= k\n total += lines\n return total >= n\n\nn, k = [int(i) for i in input().split(' ')]\nlow = 1\nhigh = 1e9\nwhile low != high:\n mid = (low + high) // 2\n if works(mid):\n high = mid\n else:\n low = mid + 1\nprint(int(low))\n", "n,m=map(int,input().split())\r\nr=1000000000\r\nl=0\r\nk=0\r\nwhile l<=r:\r\n v=(r+l)//2\r\n p=n\r\n c=0\r\n y=v\r\n while y>0 and p>0:\r\n y=v//(m**c)\r\n p-=y\r\n c+=1\r\n if p>0:\r\n l=v+1\r\n elif p<=0:\r\n r=v-1\r\n k=v\r\n\r\n\r\nprint(k)\r\n", "a,b = map(int,input().split())\r\n\r\n\r\n\r\n\r\n\r\n \r\ndef bs(A):\r\n left = 1\r\n right = A\r\n while left != right:\r\n mid = (left + right)//2\r\n s = 0\r\n x = mid\r\n while x != 0:\r\n s += x\r\n x //= b\r\n if s >= A:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n return left\r\n\r\nprint(bs(a))\r\n", "for i in range(1):\r\n # n = int(input())\r\n n , k = (map(int,input().split()))\r\n l = 0\r\n r = 10**9\r\n mini = n\r\n while(l <= r):\r\n mid = (l+r)//2\r\n mid1 = (l + r)//2\r\n ans = 0\r\n # print(l , r)\r\n while(mid > 0):\r\n ans += mid\r\n mid //= k\r\n # print(mid , ans)\r\n # print(ans,l , r, mid1)\r\n if(ans >= n):\r\n mini = min(mini , mid1)\r\n r = mid1 - 1\r\n elif(ans < n):\r\n l = mid1 + 1\r\n \r\n print(mini)", "def check (v, k, n):\r\n count = v\r\n r = v // k\r\n while r != 0:\r\n count += r\r\n r //= k\r\n return count < n\r\n\r\nn, k = map(int, input().split())\r\nl = 0\r\nr = n\r\nwhile r - l > 1:\r\n m = (r + l ) // 2\r\n if check(m, k, n):\r\n l = m\r\n else:\r\n r = m\r\nprint(r)", "from collections import deque\nfrom sys import stdin, stdout, setrecursionlimit\n\ninput = stdin.readline\nprint = stdout.write\nsetrecursionlimit(2000)\n\nn, k = map(int, input().split())\nl=0\nr=n+1\nwhile l+1!=r:\n m=(l+r)//2\n c = 0\n i=0\n while m//(k**i):\n c+=m//(k**i)\n i+=1\n if c<n:\n l = m\n else:\n r = m\nprint(str(r)+'\\n')\n", "def main():\r\n n, k = map(int, input().split())\r\n print(min_num(n, k))\r\n\r\n\r\ndef min_num(n, k):\r\n low, high = 1, n\r\n while low < high:\r\n mid = (low + high) // 2\r\n summation = sum_series(mid, k)\r\n if summation == n:\r\n return mid\r\n elif summation > n:\r\n high = mid\r\n else:\r\n low = mid + 1\r\n\r\n return high\r\n\r\n\r\ndef sum_series(v, k):\r\n summation = 0\r\n while v > 0:\r\n summation += v\r\n v //= k\r\n\r\n return summation\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split(' '))\n\ndef calc_lines(v, k):\n total = 0\n while v >= 1:\n total += v\n v = v // k\n return total\n\n\nv_lower = 1\nv_upper = n\n\nwhile v_upper - v_lower > 1:\n mid = (v_upper + v_lower) // 2\n lines = calc_lines(mid, k)\n if lines >= n:\n v_upper = mid\n elif lines < n:\n v_lower = mid\n\nprint(v_upper)", "import sys\r\nimport math\r\nimport heapq as hp\r\n#ify push pop\r\n\r\nfrom collections import deque\r\n#appendleft append pop popleft\r\n#BITWISE: and:& or:| not:~ XOR:^ \r\n\r\ninput=sys.stdin.readline\r\nm=1000000007\r\nM=998244353\r\n\r\nINF=float('inf')\r\ndef inp():\r\n return int(input())\r\ndef minp():\r\n return map(int,input().split())\r\ndef strinp():\r\n S=input().rstrip()\r\n return S\r\ndef lst():\r\n return list(map(int,input().split()))\r\n\r\n#------------------------------------#\r\ndef solve():\r\n n,k=minp()\r\n i=0\r\n j=n\r\n minm=n\r\n while(i<=j):\r\n mid=(i+j)//2\r\n val=mid\r\n t=k\r\n while(mid>=t):\r\n val+=mid//t\r\n t=t*k\r\n if val>=n:\r\n minm=min(minm,mid)\r\n j=mid-1\r\n else:\r\n i=mid+1\r\n print(minm)\r\n\r\n return\r\n\r\n# for _ in range(inp())solve()\r\nsolve()", "n,k=map(int,input().split())\nl=0\nr=2*10**9\nwhile l<r:\n\tm=(r+l)//2;s=0;t=1\n\twhile m//t:s+=m//t;t*=k\n\tif s<n:l=m+1\n\telse:r=m\nprint(l)\n \t \t \t \t\t \t\t \t \t \t\t \t\t", "[target_lines, reduction_coefficient] = [int(i) for i in input().split()]\n\n\ndef calculate_lines(initial_lines, reduction_coefficient):\n\tres = 0\n\twhile initial_lines > 0:\n\t\tres += initial_lines\n\t\tinitial_lines //= reduction_coefficient\n\treturn res\n\nleft = 0\nright = target_lines\n\nwhile left <= right:\n\tmid = left + (right - left) // 2\n\tmid_lines = calculate_lines(mid, reduction_coefficient)\n\t# print(str(left) + \", \" + str(right) + \", \" + str(mid) + \", \" + str(mid_lines))\n\tif mid_lines >= target_lines and calculate_lines(mid - 1, reduction_coefficient) < target_lines:\n\t\tprint(mid)\n\t\tquit()\n\n\tif mid_lines < target_lines:\n\t\tleft = mid + 1\n\telse:\n\t\tright = mid - 1\n", "n,k=map(int,input().split())\r\nl=n//2-1\r\nr=n\r\nwhile l <= r:\r\n mid = l + (r - l) // 2\r\n u=1\r\n sum=0\r\n while (mid//u!=0):\r\n sum+=mid//u\r\n u*=k \r\n if sum < n:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\nprint(l)", "n, k = map(int, input().split())\r\ndef f(v):\r\n\tglobal n\r\n\tglobal k\r\n\ttotal = 0\r\n\tt = 1\r\n\twhile (v//t != 0):\r\n\t\ttotal += v //t\r\n\t\tt*=k\r\n\treturn total >= n\r\n\t\r\nif (True):\r\n\tr = 1\r\n\twhile (not(f(r))):\r\n\t\tr *=2\r\n\t\r\n\tl = 0\r\n\t\r\n\twhile (r>(l+1)):\r\n\t\tm = (r+l)//2\r\n\t\t# print(m, f(m))\r\n\t\tif (f(m) == 0):\r\n\t\t\tl = m\r\n\t\telse:\r\n\t\t\tr = m\r\n\tprint(r)\r\n\t\t\r\n\t\t", "n,k=map(int,input().split())\r\nl=1\r\nr=10**10\r\nans=1\r\ndef checker(mid):\r\n sum=mid\r\n factor=mid//k\r\n while(factor>0):\r\n sum+=factor\r\n factor=factor//k\r\n return(sum>=n)\r\nwhile l<=r:\r\n mid=(r+l)//2\r\n if(checker(mid)):\r\n r=mid-1\r\n ans=mid\r\n else:\r\n l=mid+1\r\nprint(ans)", "def count_lines(picked_value, k):\r\n current_result = picked_value\r\n power_of_k = k\r\n while picked_value // power_of_k != 0:\r\n current_result += picked_value // power_of_k\r\n power_of_k *= k\r\n return current_result\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nleft = 0\r\nright = n\r\n\r\nwhile left + 1 < right:\r\n mid = (left + right) // 2\r\n if count_lines(mid, k) >= n:\r\n right = mid\r\n else:\r\n left = mid\r\n \r\nprint(right)\r\n", "n, k=[int(j) for j in input().split()]\r\na, b=0, n+1\r\n\r\ndef new(x):\r\n res=0\r\n z=0\r\n while x//(k**z)>0:\r\n res+=x//(k**z)\r\n z+=1\r\n return res\r\n\r\nwhile b-a>10:\r\n c=(a+b)//2\r\n if new(c)>n:\r\n a, b=0, c+2\r\n else:\r\n a, b=c-2, b\r\n \r\nfor j in range(a, b):\r\n if j<=0:\r\n continue\r\n if new(j)>=n:\r\n break\r\n\r\nprint(j)", "n, k = map(int, input().split())\r\nres = n - n // k\r\nm = n\r\n\r\nwhile m > 0:\r\n m = n\r\n i = res\r\n while not i <= 0:\r\n m -= i\r\n i //= k\r\n if not m <= 0:\r\n res += 1\r\n\r\nprint(res)\r\n", "def f(num):\n i = 0\n ans = 0\n while num // (k ** i) > 0:\n ans += num // (k ** i)\n i += 1\n return ans\n\n\nn, k = map(int, input().split())\nl = -1\nr = n + 1\nwhile r - l > 1:\n mid = (r + l) // 2\n if f(mid) >= n:\n r = mid\n else:\n l = mid\nprint(r)\n\n# Tue Jul 12 2022 10:48:06 GMT+0000 (Coordinated Universal Time)\n", "def bin_search(n, k):\r\n l = -1\r\n r = n + 1\r\n while r - l > 1:\r\n mid = (r + l) // 2\r\n sm = 0\r\n tmp = mid\r\n while tmp != 0:\r\n sm += tmp\r\n tmp //= k\r\n if sm < n:\r\n l = mid\r\n else:\r\n r = mid\r\n print(r)\r\n\r\nn,k = map(int,input().split())\r\nbin_search(n,k)\r\n", "import sys\nimport math\nimport random\n\n\ndef readlines(type=int):\n return list(map(type, sys.stdin.readline().split()))\n\n\ndef read(type=int):\n return type(sys.stdin.readline().strip())\n\n\njoint = lambda it, sep=\" \": sep.join(\n [str(i) if type(i) != list else sep.join(map(str, i)) for i in it])\n\n\ndef check_sol(n, k, v):\n sum = v\n term = v\n while term != 0:\n term //= k\n sum += term\n return (sum >= n, sum)\n\n\ndef solve(n, k):\n v_fl = n - (n / k)\n # assert check_sol(n, k, math.ceil(v_fl))\n v = math.ceil(v_fl)\n while not check_sol(n, k, v)[0]:\n v += 1\n return v\n\n\ndef main():\n print(solve(*readlines()))\n\n\ndef test():\n while True:\n n = random.randint(1, 2000000)\n k = random.randint(2, 10)\n v = solve(n, k)\n cs = check_sol(n, k, v)\n print(n, k, v, cs)\n if not cs[0]:\n break\n\n\nif __name__ == \"__main__\":\n main()\n # test()\n", "def count(x, k):\r\n re = x\r\n y = k\r\n while x // y > 0:\r\n re += x // y\r\n y *= k\r\n return re\r\n\r\nn, k = list(map(int, input().split()))\r\nl = 0\r\nr = n * k\r\nwhile l != r:\r\n mid = (l + r) // 2\r\n if count(mid, k) >= n:\r\n r = mid \r\n else:\r\n l = mid + 1\r\nprint(l)", "n,k = map(int,input().split())\r\ni = 1 \r\nj = n \r\ndef calc(v,k):\r\n t = v\r\n u = v \r\n while (t):\r\n u += t//k\r\n t = t//k\r\n return u \r\nwhile (i<=j):\r\n m = (i+j)//2 \r\n if calc(m,k)<n:\r\n i = m + 1 \r\n else:\r\n j = m - 1\r\n \r\nprint(i)", "n, k = [int(i) for i in input().split()]\r\n\r\ndef calc(y):\r\n i = 0\r\n tot = 0\r\n while (k ** i) <= y:\r\n tot += y // (k ** i)\r\n i += 1\r\n return tot >= n\r\n\r\nlow = 1\r\nhigh = n + 2\r\nfor _ in range(200):\r\n y = (high + low) // 2\r\n if calc(y):\r\n high = y\r\n else:\r\n low = y\r\n\r\nfor y in range(low, high + 1):\r\n if calc(y):\r\n print(y)\r\n break", "# n=int(input())\r\n# n,k=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\n#ls=list(map(int,input().split()))\r\n#for i in range(m):\r\n# for _ in range(int(input())):\r\nfrom collections import Counter\r\n#from fractions import Fraction\r\nn, k = map(int, input().split())\r\nl=0\r\nr=2*10**9\r\nwhile l<r:\r\n mid=(l+r)//2\r\n t=1\r\n s=0\r\n while mid//t:\r\n s += mid // t\r\n t=t*k\r\n if s<n:\r\n l=mid+1\r\n if s>=n:\r\n r=mid\r\nprint(l)\r\n", "#\r\n# Author: eloyhz\r\n# Date: Sep/07/2020\r\n#\r\n\r\ndef lines(v, k):\r\n s = v\r\n p = k\r\n while v // k > 0:\r\n s += v // k\r\n k *= p\r\n return s\r\n\r\n\r\ndef solve(n, k):\r\n l = 0\r\n r = 10 ** 10\r\n while r > l + 1:\r\n m = (l + r) // 2\r\n # print(l, m, r)\r\n if lines(m, k) >= n:\r\n r = m\r\n else:\r\n l = m\r\n return r\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = [int(x) for x in input().split()]\r\n print(solve(n, k))\r\n\r\n", "import sys\nfrom collections import OrderedDict\n\ndef possible(n, k, v):\n s = v\n curr = v\n while curr != 0:\n # Invariant: At this point curr has already\n # been added.\n curr = curr // k\n s += curr\n\n if s >= n:\n return True\n return False\n\ndef main(n, k):\n min_v = 1\n max_v = n * k\n\n while min_v <= max_v:\n # Invariant: Solution is always in the window\n # [min_v, max_v].\n # Solution window is always reduced by at least one.\n # So, we must find the solution since it does exist.\n\n if min_v == max_v:\n return min_v\n elif min_v == max_v - 1:\n if possible(n, k, min_v):\n return min_v\n else:\n return max_v\n\n mid_v = (min_v + max_v) // 2\n if possible(n, k, mid_v):\n max_v = mid_v\n else:\n min_v = mid_v\n\nif __name__ == \"__main__\":\n curr = None\n for e, line in enumerate(sys.stdin.readlines()):\n n, k = list(map(int, line.strip().split()))\n print(main(n, k))\n", "n, k = map(int, input().split())\r\n\r\ndef binary(n, k):\r\n low = 1\r\n high = n\r\n\r\n while low <= high:\r\n mid = (low+high)//2\r\n val = 0\r\n plusko = mid\r\n while plusko > 0:\r\n val += plusko\r\n plusko //= k\r\n if val == n:\r\n return mid\r\n elif val > n:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return mid\r\n\r\nout = binary(n, k)\r\nval = 0\r\nplusko = out\r\nwhile plusko > 0:\r\n val += plusko\r\n plusko //= k\r\nif val == n:\r\n print(out)\r\nelif val > n:\r\n print(out)\r\nelse:\r\n print(out+1)", "def summa(v,q):\r\n ans = 0\r\n k = 1\r\n while v // k > 0:\r\n ans += v // k\r\n k *= q\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\n\r\nl = 0\r\nr = n+ 1\r\nwhile r - l > 1:\r\n mid = (l+r)//2\r\n if summa(mid, k) < n:\r\n l = mid\r\n else:\r\n r = mid\r\n\r\nprint(r)", "# placeholders\r\np = 0\r\nb = 1\r\nc = 2\r\n\r\n#BMO\r\nn, k = [int(x) for x in input().split()]\r\nleft = b\r\nright = n\r\n\r\nwhile not right <= left:\r\n m = right + left\r\n m //= c\r\n temp = m\r\n s = p\r\n while temp != p:\r\n s = s + temp\r\n temp = temp // k\r\n if s < n:\r\n left = m + 1\r\n else:\r\n right = m\r\nprint(left)", "import sys\nfrom bisect import bisect_right, bisect_left\nimport os\nimport sys\nfrom io import BytesIO, IOBase\nfrom math import factorial, floor, inf, ceil, gcd\nfrom collections import defaultdict, deque, Counter\nfrom functools import cmp_to_key\nfrom heapq import heappop, heappush, heapify\n\nBUFSIZE = 8192\n \nclass FastIO(IOBase):\n newlines = 0\n \n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n \n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n \n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n \n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n \n \nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n \n \nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input().strip()\n return(s)\ndef invr():\n return(map(int,input().split()))\ndef insr2():\n s = input()\n return(s.split(\" \"))\n\n###functions\n\n##better sqrt with binary search (since f**k float precision for large nums)\n\ndef sqrt(num):\n l, r = 0, 10**18 + 7\n while r-l != 1:\n mid = (l+r)//2\n square = mid*mid\n if square <= num:\n l = mid\n else:\n r = mid\n return l\n\n### Calculate C(n, r) mod p, where p is prime (fast with precalculation)\n\ndef build_mod_inverses(n, r, p):\n fact = [1] * (n + 1)\n for i in range(1, n + 1):\n fact[i] = i * fact[i - 1] % p\n \n inv = [1] * (n + 1)\n inv[n] = pow(fact[n], p - 2, p)\n for i in range(n - 1, -1, -1):\n inv[i] = (i + 1) * inv[i + 1] % p\n \n return fact, inv\n\n# fast C(n, r) mod p calculation using predefined fact and inv\ndef comb(n, r, p, fact, inv):\n return fact[n] * inv[r] % p * inv[n - r] % p if n >= r >= 0 else 0\n \ndef make_divisors(n):\n divisors = []\n for i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i and i != 1:\n divisors.append(n // i)\n return divisors\n\ndef dfs(graph, vertex):\n visited = set()\n tree = []\n deq = deque([vertex])\n while deq:\n vertex = deq.pop()\n if vertex not in visited:\n visited.add(vertex)\n deq.extend(graph[vertex])\n tree.append(vertex)\n return tree\n\ndef find_in_sorted_list(elem, sorted_list):\n # https://docs.python.org/3/library/bisect.html\n 'Locate the leftmost value exactly equal to x'\n i = bisect_left(sorted_list, elem)\n if i != len(sorted_list) and sorted_list[i] == elem:\n return i\n return -1\n\n############ SEGMENT TREE ##############\nclass SegmentTree:\n def __init__(self, data, default=0, func=lambda a, b: a+b):\n \"\"\"initialize the segment tree with data\"\"\"\n self._default = default\n self._func = func\n self._len = len(data)\n self._size = _size = 1 << (self._len - 1).bit_length()\n \n self.data = [default] * (2 * _size)\n self.data[_size:_size + self._len] = data\n for i in reversed(range(_size)):\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\n \n def __delitem__(self, idx):\n self[idx] = self._default\n \n def __getitem__(self, idx):\n return self.data[idx + self._size]\n \n def __setitem__(self, idx, value):\n idx += self._size\n self.data[idx] = value\n idx >>= 1\n while idx:\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\n idx >>= 1\n \n def __len__(self):\n return self._len\n \n def query(self, start, stop):\n if start == stop:\n return self.__getitem__(start)\n start += self._size\n stop += self._size\n \n res = self._default\n while start < stop:\n if start & 1:\n res = self._func(res, self.data[start])\n start += 1\n if stop & 1:\n stop -= 1\n res = self._func(res, self.data[stop])\n start >>= 1\n stop >>= 1\n return res\n \n def __repr__(self):\n return \"SegmentTree({0})\".format(self.data)\n \n############ DSU ##############\nclass DisjointSetUnion():\n def __init__(self, n):\n self.n = n\n self.parents = [-1] * n\n self.group = n\n \n def find(self, x):\n if self.parents[x] < 0:\n return x\n else:\n self.parents[x] = self.find(self.parents[x])\n return self.parents[x]\n \n def union(self, x, y):\n x = self.find(x)\n y = self.find(y)\n \n if x == y:\n return\n self.group -= 1\n if self.parents[x] > self.parents[y]:\n x, y = y, x\n \n self.parents[x] += self.parents[y]\n self.parents[y] = x\n \n def size(self, x):\n return -self.parents[self.find(x)]\n \n def same(self, x, y):\n return self.find(x) == self.find(y)\n \n def members(self, x):\n root = self.find(x)\n return [i for i in range(self.n) if self.find(i) == root]\n \n def roots(self):\n return [i for i, x in enumerate(self.parents) if x < 0]\n \n def group_count(self):\n return self.group\n \n def all_group_members(self):\n dic = {r:[] for r in self.roots()}\n for i in range(self.n):\n dic[self.find(i)].append(i)\n return dic\n \n def __str__(self):\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\n\n###code\n\nn, k = inlt()\n\nl, r = 0,10**9+1\n\nwhile r-l != 0:\n mid = (r+l)//2\n \n z = k\n cur = mid\n while True:\n if mid//z == 0:\n break\n cur += mid//z\n z *= k\n if cur > n:\n r = mid\n elif cur < n:\n l = mid+1\n elif cur == n:\n print(mid)\n sys.exit()\n \nprint(r)", "n, k = map(int, input().split())\n\ndef good(m):\n s = 0; i = 0\n while pow(k, i) <= m:\n s += (m // pow(k, i))\n i += 1\n return s >= n\n\nl = 1; r = 1e10; ans = 0\nwhile l <= r:\n m = (r + l) // 2\n if good(m) : \n r = m - 1\n ans = m\n else : l = m + 1\nprint(int(ans))", "import sys\r\n\r\ndef checker(v):\r\n count = 0\r\n i = 0\r\n while True:\r\n x = v // (k ** i)\r\n i += 1\r\n count += x\r\n if x == 0:\r\n break\r\n return count >= n\r\n\r\n\r\nn, k = list(map(int, sys.stdin.readline().split()))\r\ns = 0\r\ne = n\r\nres = n\r\n\r\nwhile s <= e:\r\n\r\n mid = (s + e) // 2\r\n if checker(mid):\r\n res = mid\r\n e = mid - 1\r\n else:\r\n s = mid + 1\r\n\r\nprint(res)\r\n", "x,y=map(int,input().split())\r\n\r\ndef shutro(a,r):\r\n res=0\r\n n=0\r\n while True:\r\n b=(a//(r**n))\r\n res+=b\r\n if b==0:\r\n return res\r\n n+=1\r\n\r\nres=0\r\nlo=0\r\nhi=int(1e9)\r\nwhile hi>lo:\r\n mid=(hi+lo)//2\r\n p=shutro(mid,y)\r\n if p<x:\r\n lo=mid+1\r\n res=mid+1\r\n elif p==x:\r\n print(mid)\r\n exit(0)\r\n else:\r\n hi=mid\r\n\r\nprint(res)\r\n", "def sum_func(v,k):\n\tp = 0\n\tsums = 0\n\twhile v//k**p != 0:\n\t\tsums += v//k**p\n\t\tp += 1\n\treturn sums\n\ndef search_v(n,k):\n\tk = k\n\tlo = 0\n\thi = n\n\tpossible = -1\n\twhile (lo<=hi):\n\t\tv = (lo + hi) // 2\n\t\t# print(f\"VALUE OF V {v}\")\n\t\tres = sum_func(v,k)\n\t\t# print(f\"RES: {res}\")\n\t\t# perfect match\n\t\tif (res == n):\n\t\t return v\n\n\t\telif (res < n):\n\t\t lo = v + 1\n\n\t\t# if higher keep track possible \"at most\"\n\t\telif (res > n):\n\t\t\thi = v - 1\n\t\t\tpossible = v\n\n\treturn possible\n\ndef main ():\n\n\tvals = list(map(int,input().split()))\n\tn = vals[0]\n\tk = vals[1]\n\n\tprint(search_v(n,k))\n\nmain()\n\n", "R = lambda: map(int, input().split())\r\nn, k = R()\r\nl, r = 1, 10 ** 9\r\nwhile l < r:\r\n mid = (l + r) // 2\r\n div = k\r\n acc = mid\r\n while mid >= div:\r\n acc += mid // div\r\n div *= k\r\n if acc < n:\r\n l = mid + 1\r\n else:\r\n r = mid\r\nprint(l)", "def find(n, k):\r\n mass = [1]\r\n for i in range(30):\r\n mass.append(mass[-1] * k)\r\n l = 0\r\n r = n\r\n while r - l > 0:\r\n m = (l + r) // 2\r\n summ = 0\r\n for i in mass:\r\n summ += m // i\r\n if summ >= n:\r\n r = m\r\n else:\r\n l = m + 1\r\n return l\r\n\r\nn, k = map(int, input().split())\r\nprint(find(n, k))\r\n \r\n", "import sys\n\nn, k = map(int, sys.stdin.readline().split())\n\nleft, right = 1, n\nwhile left != right:\n rem = middle = (left + right) // 2\n sum = 0\n while rem != 0:\n sum += rem\n rem //= k\n if sum < n:\n left = middle + 1\n else:\n right = middle\nprint(left)\n", "import sys\r\ninput = sys.stdin.readline\r\ndef binarysearch(start:int, end:int):\r\n \r\n while start < end:\r\n \r\n mid = start + (end - start)//2\r\n \r\n p = 1\r\n cnt = 0\r\n \r\n while (mid//p) > 0:\r\n cnt += (mid//p)\r\n p = p*k\r\n \r\n if cnt < n:\r\n start = mid + 1\r\n else:\r\n end = mid\r\n \r\n return end\r\n\r\nn, k = [int(x) for x in input().split()]\r\n\r\nprint(binarysearch(1,n))", "n, k = [int(i) for i in input().split(\" \")]\r\n\r\nstart = 0\r\n\r\nend = n\r\n\r\n\r\ndef check(m):\r\n currSum = m\r\n\r\n while m > 0:\r\n m //= k\r\n currSum+=m\r\n\r\n return currSum\r\n\r\n\r\nwhile (end - start) > 1:\r\n\r\n mid = (end - start) // 2 + start\r\n\r\n res = check(mid) >= n\r\n\r\n if res:\r\n end = mid\r\n\r\n else:\r\n start = mid + 1\r\n\r\n\r\nif check(start) >= n:\r\n print(start)\r\n\r\nelse:\r\n print(end)\r\n", "L = input().split(' ')\r\nn, k = int(L[0]), int(L[1])\r\n\r\ngauche, droit = 1, n\r\n\r\nwhile gauche != droit:\r\n x = m = (gauche + droit) // 2\r\n s = 0\r\n\r\n temp_x = x\r\n while temp_x != 0:\r\n s += temp_x\r\n temp_x //= k\r\n\r\n if s >= n:\r\n droit = m\r\n else:\r\n gauche = m + 1\r\n\r\nprint(gauche)\r\n", "n,k=map(int,input().split())\n\ndef findAns(v):\n ans = v\n for i in range(1,10**5):\n curr = v//(k**i)\n if curr==0:\n break\n ans+=curr\n return ans\n\nl = 0\nr= n\nans = 10**9\nwhile l<=r:\n mid = (l+r)//2\n x = findAns(mid)\n if x==n:\n ans = mid\n break\n elif x>n:\n r = mid-1\n ans = min(ans,mid)\n else:\n l = mid+1\nprint(ans)\n", "n, k = map(int, input().split())\r\nv = n * (k - 1) // k\r\nwhile(1):\r\n s = 0\r\n p = 1\r\n \r\n while(v // p > 0):\r\n s += v // p\r\n p *= k \r\n if(s >= n):\r\n print(v)\r\n break \r\n else:\r\n v += 1\r\n \r\n", "n,k=map(int,input().split())\r\nl=1\r\nr=n\r\nwhile(l<r):\r\n sum=0\r\n x=v=(l+r)//2\r\n while(x>0):\r\n sum+=x\r\n x//=k\r\n if sum>=n:\r\n r=v\r\n else:\r\n l=v+1\r\nprint(r)", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\n\r\n# do a binary search\r\nL = 1\r\nR = n * k + 1\r\nwhile L < R:\r\n M = (L + R) // 2\r\n adder = M\r\n res = 0\r\n while adder > 0:\r\n res += adder\r\n adder //= k\r\n if res < n:\r\n L = M + 1\r\n else:\r\n R = M\r\nprint(L)\r\n", "import math\nn, k = map(int, input().split())\n\ndef summation(v):\n total = cur = v\n count = 1\n while cur:\n cur = math.floor(v / math.pow(k, count))\n total += cur\n count += 1\n return total\n\ndef binary_search():\n low = 1\n high = n\n while low < high:\n mid = (low + high) // 2\n if summation(mid) >= n:\n high = mid\n else:\n low = mid + 1\n return low\n\nprint(binary_search())", "import sys\r\n\r\ndef get_lines(v, k):\r\n lines = 0\r\n q = v\r\n while q != 0:\r\n lines += q\r\n q = q // k\r\n return int(lines)\r\n\r\ndef get_min_v(n, k):\r\n val = n if n % 2 == 0 else n + 1\r\n curr_lines = get_lines(val, k)\r\n # print(\"before while loop\")\r\n # print(\"val is \", val)\r\n # print(\"curr lines is \", curr_lines)\r\n while curr_lines >= n:\r\n val = val / 2\r\n curr_lines = get_lines(val, k)\r\n # print(\"new val is \", val)\r\n # print(\"new curr_lines is \", curr_lines)\r\n # return int(val * 2)\r\n\r\n low = int(val)\r\n high = n\r\n # print(\"low is \", low)\r\n # print(\"high is \", high)\r\n while low < high:\r\n # print(\"low is \", low)\r\n # print(\"high is \", high)\r\n if high - low == 1:\r\n return int(high)\r\n mid = int(low + (high - low) / 2)\r\n # print(\"mid is \", mid)\r\n # print(\"lines is \", get_lines(mid, k))\r\n if get_lines(mid, k) < n:\r\n low = mid\r\n else:\r\n high = mid\r\n\r\nf = sys.stdin\r\nn, k = [int(x) for x in f.readline().strip().split(\" \")]\r\nprint(get_min_v(n, k))\r\n", "def mlt(): return map(int, input().split())\r\n\r\n\r\nx, y = mlt()\r\n\r\n\r\ndef f(tot, mid, y):\r\n res = 0\r\n pw = 0\r\n while (mid//(y**pw)):\r\n res += (mid//(y**pw))\r\n pw += 1\r\n return res >= tot\r\n\r\n\r\nhi = 10**9\r\nlo = 1\r\nwhile hi > lo:\r\n mid = (hi+lo)//2\r\n if not f(x, mid, y):\r\n lo = mid+1\r\n else:\r\n hi = mid\r\nprint(lo)\r\n", "\nif __name__ == '__main__':\n n, k = map(int, input().split())\n high = n;\n low = 1;\n ans = float('inf')\n while low <= high:\n mid = (high + low) // 2\n\n cnt = mid;\n m = k\n while 1:\n x = mid // m;\n m *= k\n cnt += x\n\n if not x:\n break\n\n if cnt == n:\n ans = mid\n break\n\n if cnt > n:\n ans = min(ans, mid)\n high = mid - 1\n else:\n low = mid + 1\n\n print(ans)\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "[n, k] = [int(val) for val in input().split()]\r\n\r\nleft = 0\r\nright = 2\r\nflagRight = False\r\n\r\nwhile (right - left) > 1:\r\n mid = (right + left) // 2\r\n \r\n suma = 0\r\n pow = 0\r\n stop = False\r\n \r\n while not stop:\r\n \r\n suma += mid//(k**pow)\r\n \r\n if mid//(k**pow) < 0.01 and suma < n:\r\n stop = True\r\n left = mid\r\n if not flagRight:\r\n right *= 2\r\n \r\n if suma >= n:\r\n right = mid\r\n stop = True\r\n flagRight = True\r\n \r\n pow += 1\r\n \r\nprint(right)", "l = input().split(' ')\nn, k = int(l[0]), int(l[1])\n\n\nizquierda = 1\nderecha = n\n\n\nwhile izquierda != derecha:\n\n\n\n mitad = (izquierda + derecha) // 2\n x = mitad\n sum = 0\n\n\n while x != 0:\n sum += x\n x //= k\n\n\n if sum >= n:\n derecha = mitad\n else:\n izquierda = mitad + 1\n\n\nprint(izquierda)\n \t \t\t\t\t \t\t\t\t \t \t\t\t \t \t\t", "n, k = [int(i) for i in input().split(\" \")]\r\n\r\nlow = 0\r\nhigh = n\r\n\r\npowers = []\r\n\r\nt = 1\r\nfor i in range(0, 1000):\r\n powers.append(t)\r\n t *= k\r\n\r\n# print(powers)\r\ndef is_possible(n, t):\r\n tot = 0\r\n i = 1\r\n # print(n)\r\n while n > 0:\r\n tot += n\r\n n = n // powers[i]\r\n \r\n # print(tot)\r\n if tot >= t:\r\n return 1\r\n \r\n return 0\r\n\r\n\r\nresult = -1\r\nwhile low < high:\r\n mid = low + (high - low)//2\r\n if is_possible(mid, n):\r\n res = mid\r\n high = mid\r\n \r\n else:\r\n low = mid+1\r\n \r\nprint(low)\r\n\r\n \r\n ", "n,k=map(int,input().split())\r\ni,j=1,n\r\nans=0\r\nwhile i<=j:\r\n if i==j:\r\n ans=i\r\n break\r\n else:\r\n m=(i+j)//2\r\n z=m\r\n x=0\r\n while m>0:\r\n x=x+m\r\n m=m//k\r\n if x<n:\r\n i=z+1\r\n else:\r\n j=z\r\nprint(ans)", "import math\r\n# for i in range(int(input())):\r\n # n = int(input())\r\nn , k = (map(int,input().split()))\r\n\r\n# mid = n//2\r\nflag = -1\r\n\r\nfor i in range(1, n+1 , 10000):\r\n ans = i\r\n tempi = k\r\n while(tempi <= i):\r\n ans += math.floor(i/(tempi))\r\n tempi *= k\r\n if(ans >= n):\r\n flag = i\r\n break\r\n# print(flag)\r\nif(flag == -1):\r\n if(n-10000 > 0):\r\n for i in range(n-10000 , n+1):\r\n ans = i\r\n tempi = k\r\n while(tempi <= i):\r\n ans += math.floor(i/(tempi))\r\n tempi *= k\r\n if(ans >= n):\r\n flag = i\r\n print(i )\r\n break\r\n else:\r\n for i in range(1, n+1):\r\n ans = i\r\n tempi = k\r\n while(tempi <= i):\r\n ans += math.floor(i/(tempi))\r\n tempi *= k\r\n if(ans >= n):\r\n flag = i\r\n print(i)\r\n break\r\nelse:\r\n for i in range(flag-10000, flag+1):\r\n ans = i\r\n tempi = k\r\n while(tempi <= i):\r\n ans += math.floor(i/(tempi))\r\n tempi *= k\r\n if(ans >= n):\r\n flag = i\r\n print(i)\r\n break\r\n", "def mysum(x):\r\n ans = x\r\n j = 1\r\n while x//(k**j):\r\n ans += x//(k**j)\r\n j += 1\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\nm1 = (k*n-n)//k\r\nm2 = m1+30\r\n#print(m1,m2)\r\nwhile m1<m2-1:\r\n m = (m1+m2)//2\r\n if mysum(m) < n:\r\n m1 = m\r\n else:\r\n m2 = m\r\nif mysum(m1) < n:\r\n print(m2)\r\nelse:\r\n print(m1)", "n, k = map(int, input().split())\r\n\r\ndef good(c):\r\n cnt = c\r\n p = k\r\n while (c >= p):\r\n cnt += c // p\r\n p *= k\r\n\r\n return cnt >= n\r\n\r\nl = 0\r\nr = 1e9\r\n\r\nans = 0\r\n\r\nwhile l <= r:\r\n mid = (l+r)//2\r\n if good(mid):\r\n ans = mid\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n \r\nprint(int(ans))", "n, k = map(int, input().split())\r\nl = 0\r\nr = 10 ** 9\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n c = k\r\n tek = m\r\n while m // c > 0:\r\n tek += m // c\r\n c *= k\r\n #print(l, r, m, tek)\r\n if tek >= n:\r\n r = m\r\n else:\r\n l = m\r\nprint(r)\r\n", "n, k = map(int, input().split())\r\n\r\ndef binary(n, k):\r\n low = 1\r\n high = n\r\n while low <= high:\r\n mid = (low + high)//2\r\n sum = 0\r\n x = 1\r\n while True:\r\n hodnota = mid//x\r\n if hodnota == 0:\r\n a = False\r\n break\r\n sum += hodnota\r\n x *= k\r\n if sum >= n:\r\n a = True\r\n i = mid\r\n break\r\n if a:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return i\r\nprint(binary(n, k))", "N, K = tuple(map(int, input().split()))\r\n\r\ndef cmp(v):\r\n k = K\r\n total = v\r\n while True:\r\n vk = v // k\r\n if not vk:\r\n break\r\n else:\r\n total += vk\r\n k *= K\r\n return total\r\n\r\nleft = 1\r\nright = 1\r\n\r\nwhile cmp(right) < N:\r\n right *= 2\r\n\r\n\r\nwhile left <= right:\r\n mid = left + (right - left) // 2\r\n total = cmp(mid)\r\n if total < N:\r\n left = mid + 1\r\n elif total > N:\r\n right = mid - 1\r\n else:\r\n print(mid)\r\n exit(0)\r\n\r\nif (cmp(right) < N):\r\n print(right + 1)\r\nelse:\r\n print(right)", "n,k=map(int, input().split())\r\n\r\n#to write n lines of code\r\n#search v i.e. ===\r\n\r\ndef sum_lines(x,k):\r\n #v=x \r\n ans=0 \r\n i=0\r\n while True:\r\n if k**i > x:\r\n break \r\n else:\r\n ans+=int(x/k**i)\r\n i+=1 \r\n\r\n return int(ans )\r\n\r\ndef find_lines(n,k):\r\n hi=10e10 \r\n lo=0 \r\n cand=hi \r\n\r\n while lo<=hi:\r\n mid = lo+ (hi-lo)//2 \r\n\r\n if sum_lines(mid,k)>=n:\r\n cand=mid \r\n hi=mid-1 \r\n else:\r\n lo=mid+1 \r\n\r\n return int(cand )\r\n\r\nprint(find_lines(n,k))\r\n", "import math\r\n\r\n\r\ndef linesFinished(v, k):\r\n totalLines = 0\r\n\r\n kExp = 0\r\n while math.floor(v / (k ** kExp)) > 0:\r\n totalLines += math.floor(v / (k ** kExp))\r\n kExp += 1\r\n\r\n return totalLines\r\n\r\nline = input().split(\" \")\r\nn = int(line[0])\r\nk = int(line[1])\r\n\r\nlowerBound = 1\r\nupperBound = n\r\n\r\nwhile lowerBound < upperBound:\r\n mid = (lowerBound + upperBound) // 2\r\n if linesFinished(mid, k) >= n:\r\n upperBound = mid\r\n else:\r\n lowerBound = mid + 1\r\n\r\nprint(lowerBound)", "def valid(v):\r\n ans = 0\r\n while v != 0:\r\n\r\n ans += v\r\n v = v // k\r\n return ans >= n\r\n\r\n\r\ndef BSfindFirst(start, end):\r\n\twhile start + 1 < end:\r\n\t\tmid = (end+start)//2\r\n\t\tif valid(mid):\r\n\t\t\tend = mid\r\n\t\telse:\r\n\t\t\tstart = mid\r\n\treturn end\r\n\r\n\r\nn, k = map(int, input().split())\r\nprint(BSfindFirst(0, 1000000000))\r\n#print(summation(53))", "def check(mid):\r\n wr=0\r\n kk=1\r\n while mid//kk >0:\r\n wr+=(mid//(kk))\r\n kk*=k\r\n return wr>=n \r\n\r\nn,k = map(int,input().split())\r\nl=0\r\nr=10000000000\r\nwhile l<=r:\r\n mid = l + (r-l)//2\r\n if check(mid):\r\n r=mid-1\r\n else:\r\n l=mid+1 \r\nif check(l):\r\n print(l)\r\nelse:\r\n print(r) ", "def main():\n\tn, k = [int(i) for i in input().split()]\n\tprint(binarysearch(n, k))\n\ndef binarysearch(n, k):\n\t'''Use binary search to find the value of v such that the limit of the sum of int(v/k**i)>=n.'''\n\tlow = 1\n\thigh = n\n\twhile low <= high:\n\t\tmid = low + (high - low) // 2\n\t\tif (mid == 0 or lines_of_code(mid - 1, k) < n) and lines_of_code(mid, k) >= n:\n\t\t\treturn mid\n\t\telif n > lines_of_code(mid, k):\n\t\t\tlow = mid + 1\n\t\telse:\n\t\t\thigh = mid - 1\n\treturn -1\n\ndef lines_of_code(v, k):\n\t'''Compute the number of lines of code programmed with initial value v and \n\tproductivity reduction coefficient k.'''\n\tcurrent = v\n\texp = 0\n\ttotal = current\n\twhile current > 0:\n\t\texp += 1\n\t\tcurrent = int(v / k ** exp)\n\t\ttotal += current\n\n\treturn total\n\nif __name__ == \"__main__\":\n\tmain()\n \t\t \t \t\t\t \t\t\t\t\t\t \t\t \t\t\t\t\t \t", "def getn(v, k):\r\n counter = 0\r\n i = 0\r\n while int(v/pow(k, i)) != 0:\r\n counter += int(v/pow(k, i))\r\n i += 1\r\n return counter\r\nn, k = map(int, input().split())\r\nh = n\r\nl = 0\r\n\r\nans1 = 1000000000000\r\nans2 = 1000000000000\r\nwhile l <= h:\r\n m = int((h + l) / 2)\r\n if getn(m,k) == n:\r\n ans1 = m\r\n break\r\n elif getn(m,k) < n:\r\n l = m+1\r\n else:\r\n h = m-1\r\n ans2 = m\r\n\r\nprint(min(ans1,ans2))", "n, k = map(int, input().split())\r\nleft, right = 0, n + 1\r\n\r\nwhile left < right:\r\n mid = (right + left) // 2\r\n summ, d = 0, 1\r\n\r\n while mid // d:\r\n summ += mid // d\r\n d *= k\r\n\r\n if summ < n:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n\r\nprint(left)", "n, k = map(int, input().split())\r\n\r\ndef check(v):\r\n p = 1\r\n x = v\r\n while (v // (k**p)) > 0:\r\n x += v // (k ** p)\r\n p += 1\r\n return x >= n\r\n\r\nleft, right = 0, 10**9 + 1\r\nwhile left + 1 < right:\r\n middle = (left + right) // 2\r\n if check(middle):\r\n right = middle\r\n else:\r\n left = middle\r\nprint(right) ", "def works(linesNeeded, linesInitial, factor):\r\n iteration = 0\r\n while(linesInitial // (factor ** iteration) > 0):\r\n linesNeeded -= linesInitial // (factor ** iteration)\r\n iteration += 1\r\n return linesNeeded <= 0\r\n \r\nlines, factor = map(int, input().split())\r\nlo = 0\r\nhi = int(1e10)\r\nwhile lo + 1 < hi:\r\n mid = (lo + hi) // 2\r\n if(works(lines, mid, factor)):\r\n hi = mid\r\n else:\r\n lo = mid\r\nprint(hi)", "#Burning Midnight Oil\r\n\r\n\r\ndef getSum(v, q):\r\n sum = 0\r\n while (v != 0 ):\r\n sum += v\r\n v //= q\r\n return sum\r\n\r\nn, q = (int(x) for x in input().split(\" \"))\r\nmin = 0\r\nmax = n\r\n\r\nwhile (max - min > 1):\r\n val = getSum((max + min + 1) // 2, q)\r\n if val < n:\r\n min = (max + min + 1) // 2\r\n else:\r\n max = (max + min + 1) // 2\r\nprint(max)", "from sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn,k=inp()\r\nl=0\r\nr=n\r\nwhile l <= r:\r\n mid =(l+r)//2\r\n c=0\r\n y=0\r\n while mid >= k ** c:\r\n y+=mid//k**c\r\n c+=1\r\n if y>n:\r\n break\r\n if y>=n:\r\n x=mid\r\n r=mid-1\r\n else:\r\n l=mid+1\r\nprint(x)", "n, k = [int(x) for x in input().split()]\r\nlow = 0\r\nhi = n\r\n\r\ndef search(low, hi):\r\n while True:\r\n if hi - low == 1:\r\n return hi\r\n mid = low + (hi - low) // 2\r\n\r\n value = mid\r\n amt = 0\r\n while value > 0:\r\n amt += value\r\n value //= k\r\n if amt < n:\r\n low = mid\r\n else:\r\n hi = mid\r\n\r\nprint(search(0, n))", "def predicate(v, k, n):\r\n summation = 0\r\n val = v\r\n div = k\r\n while summation < n and val > 0:\r\n summation += val\r\n val = v // div\r\n div *= k\r\n return summation >= n\r\n\r\ndef soln(n, k):\r\n lo, hi = 0, n\r\n while hi - lo != 1:\r\n mid = (lo + hi) // 2\r\n if predicate(mid, k, n): \r\n hi = mid\r\n else: \r\n lo = mid\r\n return hi\r\n \r\nn, k = map(int, input().split())\r\nprint(soln(n, k))", "#!/usr/bin/env python3\n\nn, k = [int(x) for x in input().split()]\n\nl = 1\nr = n\n\nwhile l < r:\n current = (l + r) // 2\n\n code = 0\n x = current\n while x != 0:\n code = code + x\n x = x // k\n\n if code >= n:\n r = current \n else:\n l = current + 1\n\nprint(l)\n", "import sys\n\nlines = iter(sys.stdin)\n(n, k) = [int(x) for x in next(lines).split()]\n\n\ndef calcLines(v):\n total = 0\n increment = v\n while (increment > 0):\n total += increment\n increment = increment // k\n return total\n\nlow = 1\nhigh = n\n\nwhile low + 1 < high:\n mid = (low + high) // 2\n if calcLines(mid) < n:\n low = mid\n else:\n high = mid\n \nprint(high)", "def value(x,k):\r\n count = x\r\n while x > 0:\r\n x = x // k\r\n count += x\r\n return count\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\nL = 1\r\nU = n\r\nwhile L < U:\r\n y = (L+U)//2\r\n if value(y,k) < n:\r\n L = y + 1\r\n else:\r\n U = y\r\nprint(U)\r\n", "n,k = map(int,input().split())\r\n\r\nl=0\r\nr=10**9\r\nmid = float('inf')\r\n\r\nwhile r-l > 1:\r\n mid = (r+l)//2\r\n cnt = mid\r\n a = mid\r\n\r\n while a > 0:\r\n cnt += a//k\r\n a = a/k\r\n\r\n if cnt == n:\r\n print(mid)\r\n break\r\n elif cnt > n:\r\n r=mid\r\n elif cnt < n:\r\n l=mid\r\nelse:\r\n print(r)", "# Template 1.0\r\nimport sys, re, math\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\r\nfrom heapq import heappush, heappop, heapify, nlargest, nsmallest\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef sortListWithIndex(listOfTuples, idx): return (sorted(listOfTuples, key=lambda x: x[idx]))\r\ndef sortDictWithVal(passedDic):\r\n temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))[::-1]\r\n toret = {}\r\n for tup in temp:\r\n toret[tup[0]] = tup[1]\r\n return toret\r\ndef sortDictWithKey(passedDic):\r\n return dict(OrderedDict(sorted(passedDic.items())))\r\nsys.setrecursionlimit(10 ** 9)\r\nINF = float('inf')\r\nmod = 10 ** 9 + 7\r\n\r\ndef func(v):\r\n i = 0\r\n temp = 0\r\n while(v//(k**i)):\r\n temp+=(v//(k**i))\r\n i+=1\r\n return (temp>=n)\r\n\r\n\r\nn, k = MAP()\r\n\r\nl = 1\r\nr= 10**9\r\nans = -1\r\nwhile(l<r):\r\n mid = (l+r)//2\r\n if(func(mid)):\r\n ans = mid\r\n r = mid\r\n else:\r\n l = mid + 1\r\n\r\nprint(ans)", "lines,k=map(int,input().split())\r\ndef valid(mid,k,lines):\r\n lines-=mid\r\n z = 1\r\n while lines>0:\r\n lines-=mid//(k**z)\r\n if mid//(k**z)==0:\r\n return False\r\n z+=1\r\n else:\r\n return True\r\nl,r=0,(int(1e9))\r\nposs = 0\r\nwhile l<=r:\r\n mid = (l+r)//2\r\n if valid(mid,k,lines):\r\n r = mid-1\r\n poss = mid\r\n else:\r\n l = mid+1\r\nprint(poss)", "n,k=map(int,input().split())\r\ndef check(x):\r\n res=0\r\n while x:\r\n res+=x\r\n x//=k\r\n return res>=n\r\nlow=1\r\nhigh=n\r\nwhile low<=high:\r\n mid=(low+high)//2\r\n if check(mid):\r\n ans=mid\r\n high=mid-1\r\n else :\r\n low=mid+1\r\nprint(ans)", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\ndef solve(t):\r\n\tx=0\r\n\tfor i in l:\r\n\t\tx+=t//i\r\n\treturn x\r\nn,k=map(int,input().split())\r\nl=[1]\r\nwhile l[-1]*k<=n:\r\n\tl.append(l[-1]*k)\r\na=1\r\nr=n\r\nprev=0\r\nwhile a<=r:\r\n\tmid=(a+r)//2\r\n\tx=solve(mid)\r\n\tif x<n:\r\n\t\ta=mid+1\r\n\telse:\r\n\t\tr=mid-1\r\n\t\tprev=mid\r\nif solve(mid)>=n:\r\n\tprint(mid)\r\nelse:\r\n\tprint(prev)", "def binSearch(a, b):\r\n l=0\r\n r=a\r\n i=0\r\n while l<r-1:\r\n m=(l+r)//2\r\n summa=m\r\n while True:\r\n i+=1\r\n x=m//b**i\r\n summa+=x\r\n if x==0:\r\n break\r\n if summa<a:\r\n l=m\r\n else:\r\n r=m\r\n summa=0\r\n i=0\r\n return r\r\n \r\na,b=[int(x) for x in input().split()]\r\nprint(binSearch(a, b))", "import sys\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\n\r\nn,k=I()\r\nl=1;r=n+1\r\nwhile l<r:\r\n\tmd=(l+r)//2\r\n\tm=md\r\n\tx=0\r\n\twhile md:\r\n\t\tx+=md\r\n\t\tmd//=k\r\n\tif n>x:\r\n\t\tl=m+1\r\n\telse:\r\n\t\tr=m\r\nprint(l)", "n,k = list(map(int,input().split()))\nt=1\nwhile k**t<n:\n t=t+1\nb = (n*((k-1)/k))*((k**t)/((k**t)-1))\nb = int(b)-1\nwhile True:\n a,i,l=b,0,0\n while a//k**i>0:\n l+=a//k**i\n i=i+1\n if l>=n:\n print(b)\n break\n b=b+1\n \t \t\t \t \t \t\t \t \t\t\t", "# problem: burning midnight oil, https://codeforces.com/problemset/problem/165/B/\n# goal is to write n lines of code. after writing v lines, drink a cup of tea, writing\n# v / k more lines. next cut is v / k^2, etc. find smallest num of v to finish code\n#\n# Solution: O(log(N log N))\n\n\n# calculates if the given v value is valid.\n# return true if the tested v works with the given\n# target n lines and k value. false otherwise. 0(logN)\ndef testV(v, n, k):\n sum = 0\n curr = v\n while (sum < n) and (curr > 0):\n sum += curr\n curr //= k\n \n return sum >= lines\n\ninp = [int(x) for x in input().split()]\n\nlines = inp[0]\nk = inp[1]\n\n# binary search with test. O(log N)\nlow = 0\nhigh = lines\nmid = 0\n\nwhile low < high:\n mid = low + ((high - low) // 2)\n if testV(mid, lines, k):\n high = mid\n else:\n low = mid + 1\n\nprint(high)\n\n", "n, k = map(int, input().split())\r\nres = n - n // k\r\nm = n - n // k\r\n\r\n#outer loop\r\nwhile m > 0:\r\n i = res\r\n m = n\r\n #search\r\n while not i <= 0:\r\n m = m - i\r\n i = i//k\r\n if not m <= 0:\r\n res += 1\r\n\r\n#output the result\r\nprint(res)\r\n", "n,k=list(map(int,input().split()))\r\na=n/2\r\nv=round(a)\r\nwhile round(a)>0:\r\n b=0\r\n m=0\r\n while v//(k**b)>0:\r\n m+=v//(k**b)\r\n b+=1\r\n if m<n:\r\n v+=round(a/2)\r\n else:\r\n v-=round(a/2)\r\n a/=2\r\nb=0\r\nm=0\r\nwhile v//(k**b)>0:\r\n m+=v//(k**b)\r\n b+=1\r\nif m<n:\r\n v+=1\r\nprint(v)", "# from math import floor\nn, k = map(int, input().split())\n\ndef code_written(v, k):\n new_lines = v\n den = k\n while v // den > 0:\n new_lines += v // den\n den *= k\n \n return new_lines\n\n\n\ndef bin_search(left, right, n, k):\n if right <= left:\n return left\n\n mid = left + (right - left)//2\n\n code = code_written(mid, k)\n\n if code < n:\n return bin_search(mid+1, right, n, k)\n elif (code_written(mid-1, k) < n):\n return mid\n else:\n return bin_search(left, mid, n, k)\n\nprint(bin_search(0, n+1, n, k))\n", "def f(v):\r\n s = 0\r\n t = 1\r\n while v // t > 0:\r\n s += v // t\r\n t *= k\r\n return s\r\n\r\n\r\nn, k = map(int, input().split())\r\nL = -1\r\nR = n\r\nwhile R - L > 1:\r\n m = (R + L) // 2\r\n if f(m) >= n:\r\n R = m\r\n else:\r\n L = m\r\nprint(R)\r\n", "def is_valid(v, n, k) -> bool:\n total = 0\n i = 0\n while total < n and (v // (k ** i)) > 0:\n total += (v // (k ** i))\n i+=1\n return total >= n\ninp = input().split(\" \")\nn = int(inp[0])\nk = int(inp[1])\nstart = 0\nend = n\nwhile start <= end:\n mid = (end + start) // 2\n if is_valid(mid, n, k):\n if start == end:\n break\n end = mid\n else: \n start = mid + 1\nprint(mid)\n", "n, k = map(int, input().split())\nleft = 1\nright = n\nwhile left != right:\n mid = (left + right) // 2\n temp = mid\n s = 0\n while temp != 0:\n s += temp\n temp //= k\n if s >= n:\n right = mid\n else:\n left = mid + 1\nprint(left)\n\t \t \t \t \t\t\t\t\t \t \t \t \t", "def poss(a,n,k):\r\n sum=n\r\n while n//k>0:\r\n sum+=n//k\r\n n//=k\r\n return sum>=a\r\nn,k=map(int,input().split())\r\nlo=1\r\nhi=n\r\nwhile hi-lo>1:\r\n mid=(lo+hi)//2\r\n if poss(n,mid,k):\r\n hi=mid\r\n else:\r\n lo=mid+1\r\nif poss(n,lo,k):\r\n print(lo)\r\nelse:\r\n print(hi)", "def main():\r\n n,k = map(int, input().split())\r\n low = 0\r\n high = n\r\n while low + 1 < high:\r\n mid = int((low + high) / 2)\r\n #print(works(mid, k , n), mid, sep=\" \")\r\n if(works(mid, k, n)):\r\n high = mid\r\n else:\r\n low = mid\r\n print(high)\r\n\r\ndef works(v, k, n):\r\n sum = 0\r\n factor = 0\r\n temp = v // (k ** factor)\r\n while temp != 0 and n > sum:\r\n # print(\"sum: \" + str(sum))\r\n sum += temp\r\n factor += 1\r\n temp = v // (k ** factor)\r\n return n <= sum\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# LUOGU_RID: 91394437\nn, k = map(int, input().split())\r\n\r\n\r\ndef check(x):\r\n i, ans = 0, 0\r\n while x >= k ** i:\r\n ans += x // k ** i\r\n i += 1\r\n return ans >= n\r\n\r\n\r\nl, r = 0, int(1e10)\r\nwhile l < r:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n r = mid\r\n else:\r\n l = mid + 1\r\nprint(l)\r\n", "n,k=map(int,input().split())\r\nl=((k-1)*n)//k\r\nfor v in range(l,l+20):\r\n s=0\r\n x=1\r\n u=v\r\n while u//x!=0:\r\n s+=u//x\r\n x*=k\r\n if s>=n:\r\n print(v)\r\n exit()", "n, k = [int(i) for i in input().split()]\r\nub = n\r\nlb = 0\r\nsagot = 0\r\nwhile lb <= ub:\r\n mid = ( lb + ub )// 2\r\n sm = 0\r\n mid_d = mid\r\n while mid_d > 0:\r\n sm += mid_d\r\n mid_d//=k\r\n if n > sm:\r\n #print('up')\r\n lb = mid + 1\r\n elif n < sm:\r\n #print('d')\r\n ub = mid - 1\r\n sagot = mid\r\n else:\r\n #print('ayown')\r\n sagot = mid\r\n ub = mid - 1\r\nprint(sagot)\r\n \r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\n\r\ndef check(v):\r\n ans = 0\r\n for i in range(32):\r\n ans += v//(K**i)\r\n return ans\r\n\r\nl,r = 0,N+1\r\nwhile l+1<r:\r\n m = (l+r)//2 \r\n if check(m)>=N:\r\n r = m\r\n else:\r\n l = m\r\n \r\nprint(r)\r\n\r\n \r\n\r\n", "n, k = map(int, input().split())\r\n\r\nst=0\r\nen=n\r\ntans=-2\r\nwhile st <= en:\r\n md = (st+en)//2\r\n ans = 0\r\n tk=1\r\n while md//tk:\r\n ans += (md//tk)\r\n tk *= k\r\n if ans >= n:\r\n tans = md\r\n en = md-1\r\n else:\r\n st = md + 1 \r\nprint(tans)", "setup = input().split()\r\nn = int(setup[0])\r\nk = int(setup[1])\r\n\r\ndef calculatelines(v):\r\n global k\r\n lines = 0\r\n a = v\r\n count = 0\r\n while a > 0:\r\n lines += a\r\n count+= 1\r\n a = int(v/(k**count))\r\n return lines\r\n\r\n\r\ndef search(low, high):\r\n if high <= low:\r\n return low\r\n global k, n\r\n mid = int((low + high)/2)\r\n lines = calculatelines(mid)\r\n \r\n if lines >= n:\r\n return search(low, mid)\r\n else:\r\n return search(mid + 1, high)\r\n\r\n\r\n\r\nminimum = search(1, n)\r\nprint(minimum)\r\n", "\r\n\r\ndef count_lines(picked_v, k):\r\n result = picked_v\r\n power_of_k = k\r\n while picked_v // power_of_k > 0:\r\n result += picked_v // power_of_k\r\n power_of_k *= k\r\n \r\n return result\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nleft = 0\r\nright = n\r\nwhile left + 1 < right:\r\n mid = (left + right) // 2\r\n if count_lines(mid, k) >= n:\r\n right = mid\r\n else:\r\n left = mid\r\n \r\nprint(right)", "n,k = map(int,input().split())\r\nidx = (n*(k-1))//k\r\ns = 0\r\nwhile s<n:\r\n s=0\r\n tempy = idx\r\n while tempy>0:\r\n s += tempy\r\n tempy//=k\r\n idx+=1\r\nprint(idx-1)", "\r\n\r\ndef valid(v,n,k):\r\n i = 1\r\n c = v\r\n while c < n and v//(k**i) > 0:\r\n c += v//(k**i)\r\n i += 1\r\n if c >= n:\r\n return True\r\n else:\r\n return -1\r\n\r\ndef bs(n,k):\r\n st = 1\r\n en = n\r\n while st < en:\r\n mid = (st+en)//2\r\n if valid(mid,n,k) == -1:\r\n st = mid+1\r\n else:\r\n en = mid\r\n return st\r\n\r\nif __name__ == '__main__':\r\n n,k = map(int,input().split())\r\n print(bs(n,k))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\ndef sm(n,r):\r\n ans = 0\r\n while n:\r\n ans += n\r\n n //= r\r\n return ans\r\n\r\nn,k = li()\r\nl,r = 1,n\r\nans = -1\r\nwhile l <= r:\r\n m = (l+r) // 2\r\n x = sm(m,k)\r\n if x >= n:\r\n ans = m\r\n r = m - 1\r\n else:\r\n l = m + 1\r\nprint(ans)", "n, k = [int(i) for i in input().split(\" \")]\r\n\r\n\r\nmaximum = n\r\nminimum = 0\r\n\r\n\r\ndef brings_sucess(v, k, n):\r\n summed = v\r\n expression = int(v/k)\r\n idx =1\r\n while (expression):\r\n summed += expression\r\n idx +=1\r\n expression = int(v/(k**idx))\r\n \r\n return summed >=n\r\n\r\nwhile (maximum != minimum):\r\n purposed = int((maximum + minimum)/2)\r\n\r\n was_sucessful = brings_sucess(purposed, k,n)\r\n if (was_sucessful):\r\n #we need to bring the maximum down\r\n #print(\"changing max to \" +str(purposed))\r\n maximum = purposed\r\n else:\r\n #print(\"changing min to \" + str(purposed +1))\r\n minimum = purposed + 1\r\n \r\nprint(maximum)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 27 11:53:43 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 87 - CF165-DIV2B\r\n\"\"\"\r\nimport math\r\n\r\ndef lineNum(amount):\r\n ans = amount\r\n toAdd = 1\r\n power = 1\r\n while toAdd:\r\n toAdd = math.floor(amount/(pow(divisor,power)))\r\n ans += toAdd\r\n power += 1\r\n return ans\r\n\r\nneeded, divisor = map(int,input().split())\r\nlo,hi = 1, needed*divisor\r\nwhile lo <= hi:\r\n mid = (lo+hi)//2\r\n lines = lineNum(mid)\r\n if lines >= needed and lineNum(mid-1) < needed:\r\n print(mid)\r\n break\r\n elif lines >= needed:\r\n hi = mid-1\r\n else:\r\n lo = mid+1\r\n", "n, k = map(int, input().split())\r\nl = 1\r\nr = n\r\nans = 0\r\na = []\r\nwhile l <= r:\r\n m = (l+r) // 2\r\n s = 1\r\n temp = m/k\r\n while m + ans <= n and temp != 0:\r\n temp = m // (k**s)\r\n ans += temp\r\n s += 1\r\n\r\n if m + int(ans) >= n:\r\n a.append(m)\r\n r = m - 1\r\n else:\r\n if m + m/k > n:\r\n r = m - 1\r\n else:\r\n l = m + 1\r\n ans = 0\r\n\r\nprint(min(a))", "n, k = map(int, input().split(\" \"))\n\nleft = 0\nright = n\nmid = 0\n\ndef helper(v):\n ans = v\n while v > 0:\n v //= k\n ans += v\n return ans >= n\n\nwhile left < right:\n mid = (left + right) // 2\n if helper(mid):\n right = mid\n else:\n left = mid + 1\nprint(int(left))\n", "def calc(m, k0):\r\n res = 0\r\n k = 1\r\n while m // k > 0:\r\n res += m // k\r\n k *= k0\r\n return res\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nl = -1\r\nr = 1_000_000_000_000\r\n\r\nwhile r - l > 1:\r\n m = (l + r) >> 1\r\n if calc(m, k) >= n:\r\n r = m\r\n else:\r\n l = m\r\n\r\n# print(calc(r, k))\r\nprint(r)\r\n", "n, k = map(int, input().split())\r\nl = 0\r\nr = 2 * 10**9\r\n\r\nwhile l < r:\r\n m = (r + l) // 2\r\n s = 0\r\n t = 1\r\n\r\n while m // t:\r\n s += m // t\r\n t *= k\r\n\r\n if s < n:\r\n l = m + 1\r\n else:\r\n r = m\r\n\r\nprint(l)\r\n", "def geo_sum(v, k):\n res = 0\n aux = v\n while aux:\n res += aux\n aux //= k\n return res\n\ndef find_v(n, k):\n st, end = 1, n\n while st < end:\n mid = (st + end)//2\n s = geo_sum(mid, k)\n if s == n:\n return mid\n if s < n:\n st = mid + 1\n else:\n end = mid\n return end\n\ndef solve():\n n, k = map(int, input().split())\n v = find_v(n, k)\n print(v)\n\nif __name__ == '__main__':\n solve()\n", "n,k=list(map(int,input().split()))\r\ndef check(x,z):\r\n c=0\r\n while x>0:\r\n c+=x\r\n x=int(x/z)\r\n if c>=n:return True\r\n return False\r\nstart=1\r\nend=10**9\r\nans=10**9\r\nwhile start<=end:\r\n mid=int((start+end)/2)\r\n if check(mid,k):\r\n ans=mid\r\n end=mid-1\r\n else:\r\n start=mid+1\r\nprint(ans)\r\n \r\n \r\n\r\n \r\n ", "def coding(v,k):\r\n i = 1\r\n ans = v\r\n while k ** i <= v:\r\n ans += v // (k ** i)\r\n i += 1\r\n return ans\r\nn, k = list(map(int,input().split()))\r\nstart = n - n//k\r\nif coding(start,k) >= n:\r\n while coding(start - 1,k) >= n and start > 0:\r\n start -= 1\r\nelse:\r\n while coding(start,k) < n:\r\n start += 1\r\nprint(start)", "\r\ndef check(x):\r\n val=0\r\n div=0\r\n while val<n and x//(k**div)>0:\r\n val=val+x//(k**(div))\r\n div=div+1\r\n # print(val,div)\r\n # print(x,val)\r\n if val<n:\r\n return False\r\n return True\r\n \r\nn,k=list(map(int,input().split()))\r\n# print(check(4))\r\ni=-1\r\nj=10**10\r\nwhile i+1<j:\r\n mid=(i+j)//2\r\n # print(check(mid),mid)\r\n if check(mid):\r\n j=mid\r\n else:\r\n i=mid\r\nprint(j)", "def coding(v,k):\r\n i = 1\r\n ans = v\r\n while k ** i <= v:\r\n ans += v // (k ** i)\r\n i += 1\r\n return ans\r\nn, k = list(map(int,input().split()))\r\nstart = n - n//k\r\nwhile coding(start,k) < n:\r\n start += 1\r\nprint(start)", "n , k = [int(i) for i in input().split()]\r\n\r\nl = 1\r\nr = n\r\n\r\nwhile l < r:\r\n mid = (l + r) // 2\r\n x = mid\r\n s = 0\r\n while x > 0:\r\n s += x\r\n x //= k\r\n\r\n if s >= n:\r\n r = mid\r\n else:\r\n l = mid + 1 \r\n\r\nprint(l)", "from collections import defaultdict, Counter\r\nfrom queue import PriorityQueue, Queue\r\nimport math\r\n\r\ndef getLines(n, k) :\r\n ans = 0\r\n p = 1\r\n while p <= n :\r\n ans += n // p\r\n p *= k\r\n return ans\r\n\r\n\r\n\r\nn, k= map(int, input().split())\r\nl, h = 1, n\r\nwhile l <= h :\r\n mid = (l + h) // 2\r\n x = getLines(mid, k)\r\n #print(l, h, mid, x)\r\n if x == n :\r\n break\r\n elif x > n :\r\n h = mid - 1\r\n else :\r\n l = mid + 1\r\nif l <= h :\r\n print((l + h) // 2)\r\nelse :\r\n print(l)", "def calc(num, k):\r\n sum = 0\r\n i = 0\r\n while k**i <= num:\r\n sum += int(num/ k**i)\r\n #print(sum)\r\n i+=1\r\n return sum\r\n\r\n\r\ndef Binary(sum, k):\r\n l = 0\r\n r = 10**9\r\n while l<r:\r\n mid = int(l +(r - l)/2)\r\n ans = calc(mid, k)\r\n if ans < sum:\r\n l = mid + 1\r\n else:\r\n r = mid\r\n return l\r\n\r\n\r\n\r\nlist=[int(item) for item in input().split()]\r\nsum = list[0]\r\nk = list[1]\r\nprint(Binary(sum, k))\r\n\r\n", "def sigma(v,k):\r\n s = 0\r\n for i in range(50):\r\n s += v//k**i\r\n return s\r\n\r\nn,k = map(int, input().split())\r\nlo = 1; hi = n\r\nwhile (hi-lo)>1:\r\n m = (lo+hi)//2\r\n\r\n if sigma(m,k) < n:\r\n lo = m\r\n else:\r\n hi = m\r\n \r\nif sigma(hi,k) >= n:\r\n print(hi)\r\nelse:\r\n print(lo)", "n, k = map(int, input().split())\r\nl = 0\r\nr = 10 ** 9\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n c = 0\r\n i = 0\r\n c = 0\r\n while m // pow(k, i) != 0:\r\n c += m // pow(k, i)\r\n i += 1\r\n if c >= n:\r\n r = m\r\n else:\r\n l = m\r\nprint(r)\r\n", "from re import A\r\nimport sys\r\nimport math\r\nimport bisect\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\n\r\n# faster input\r\nLINES = sys.stdin.read().splitlines()[::-1]\r\ndef input(): return LINES.pop()\r\n\r\n# single integer\r\ninp = lambda: int(input())\r\n\r\n# string input\r\nstrng = lambda: input().strip()\r\n\r\n# words split on white space\r\nstrwords = lambda: strng().split()\r\n\r\n\r\n# string list\r\nstrl = lambda: list(input().strip())\r\n\r\n# multiple integers, mapped\r\nmul = lambda: map(int,input().strip().split())\r\n\r\n# multiple floats, mapped\r\nmulf = lambda: map(float,input().strip().split())\r\n\r\n# list of multiple integers\r\nseq = lambda: list(map(int,input().strip().split()))\r\nfl_seq = lambda: list(map(float,input().strip().split()))\r\n\r\nceil = lambda x: int(x) if(x==int(x)) else int(x)+1\r\nceildiv = lambda x,d: x//d if(x%d==0) else x//d+1\r\n\r\nMOD = 1000000007\r\n\r\nmod_add = lambda x, y: ((x % MOD) + (y % MOD)) % MOD\r\nmod_multiply = lambda x, y: ((x % MOD) * (y % MOD)) % MOD\r\nmod_division = lambda x, y: mod_multiply(x, math.pow(y, MOD - 2, MOD))\r\n\r\ninbounds = lambda x, y, grid: x >= 0 and x < len(grid) and y >= 0 and y < len(grid[0])\r\n\r\ndef solve():\r\n # Implemaentation goes here.\r\n n, k = seq()\r\n high = n\r\n low = 1\r\n while True:\r\n if high - low <= 1:\r\n return high\r\n mid = low + (high - low) // 2\r\n code = mid\r\n tot = 0\r\n while code > 0:\r\n tot += code\r\n code //= k\r\n if tot >= n:\r\n high = mid\r\n else:\r\n low = mid\r\n \r\n\r\n \r\n pass\r\n\r\ncases = 1\r\nfor i in range(cases):\r\n print(solve())", "t = input().split(' ')\nn, k = int(t[0]), int(t[1])\nl,r = 1, n\nwhile l != r:\n x = m = (l + r) // 2\n s = 0\n while x != 0:\n s += x\n x //= k\n if s >= n:\n r = m\n else:\n l = m + 1\nprint(l)\n \t\t\t \t\t\t \t\t\t \t\t \t \t \t \t \t", "def ok(n, k, v):\r\n summ = 0\r\n p = 1\r\n while summ < n and v >= p:\r\n summ += v // p\r\n p *= k\r\n return summ >= n\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nl = 0\r\nr = n\r\nwhile l + 1 < r:\r\n m = l + (r - l) // 2\r\n\r\n if ok(n, k, m):\r\n r = m\r\n else:\r\n l = m\r\nprint(r)\r\n", "from sys import *\r\nfrom math import *\r\nn,k=map(int,stdin.readline().split())\r\ndef fun(x):\r\n y = 0\r\n m = 1\r\n while x // m != 0:\r\n y += x // m\r\n m *= k\r\n return y\r\n\r\nl=0\r\nh=10**10\r\nwhile l+1<h:\r\n mid=(l+h)//2\r\n if fun(mid)>=n:\r\n h=mid\r\n else:\r\n l=mid\r\nprint(h)", "l=input().split(' ')\r\nn,k=int(l[0]),int(l[1])\r\nleft,right=1,n\r\nwhile left!=right:\r\n x=middle=(left+right) //2\r\n sum=0\r\n while x!=0:\r\n sum+=x\r\n x //=k\r\n if sum >=n:\r\n right=middle\r\n else:\r\n left=middle+1\r\nprint(left)", "from bisect import bisect\r\n\r\n\r\n\r\ndef good(n, k, v):\r\n strings = v\r\n p = 1\r\n while v // (k ** p) > 0:\r\n strings += v // (k ** p)\r\n p += 1\r\n return strings >= n\r\n\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n left = 0\r\n right = 10 ** 9\r\n while left + 1 < right:\r\n mid = (left + right) // 2\r\n if good(n, k, mid):\r\n right = mid\r\n else:\r\n left = mid\r\n print(right)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def answ(v, k):\r\n\r\n\ti = s = 0\r\n\twhile v // k**i != 0:\r\n\t\ts += v // k**i\r\n\t\ti += 1\r\n\r\n\treturn s\r\n\r\n\r\ndef bin_search(n, k):\r\n left = 0\r\n right = n\r\n mid = 0\r\n\r\n while left + 1 < right:\r\n mid = left + (right - left) // 2\r\n if answ(mid, k) >= n:\r\n right = mid\r\n else:\r\n left = mid\r\n\r\n return right\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\nprint(bin_search(n, k))", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn, k = [int(x) for x in input().split()]\r\n\r\nans = float(\"inf\")\r\nl = 1\r\nr = n + 1\r\nwhile l < r:\r\n m = (l + r) // 2\r\n v = m\r\n lines = 0\r\n while v > 0:\r\n lines += v\r\n v //= k\r\n if lines >= n:\r\n r = m\r\n ans = min(ans, m)\r\n else:\r\n l = m + 1\r\nprint(ans)", "n, k = map(int, input().split())\r\n\r\n\r\ndef calculate(v, k):\r\n total = v\r\n while v > 0:\r\n v = v // k\r\n total += v\r\n return total\r\n\r\n\r\nlowest = float(\"inf\")\r\nl, r = 1, n\r\nwhile l <= r:\r\n mid = l + (r - l) // 2\r\n if calculate(mid, k) < n:\r\n l = mid + 1\r\n else:\r\n lowest = min(lowest, mid)\r\n r = mid - 1\r\n\r\nprint(lowest)\r\n", "numlines, k=map(int, input().split())\nm=1\nl=0\nr=numlines\nwhile l!=r:\n temp=m=(r+l)//2\n i=0\n writtenlines=0\n while temp>0:\n writtenlines+=temp\n temp//=k\n \n #print(l, m, r, writtenlines)\n if writtenlines>=numlines:\n r=m\n #print(\"Moving r to m\\n\")\n else:\n l=m+1\n #print(\"Moving l to m\\n\")\nprint(l)\n", "n, k = map(int, input().split())\n\ndef sum(v, k):\n s = v\n b = k\n while v // b > 0:\n s += v // b\n b *= k\n return s\n\nl = 0\nr = n * k\nwhile l <= r:\n c = (l + r)//2\n if sum(c, k) >= n:\n r = c - 1\n else:\n l = c + 1\nprint(l)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nc = 0\r\nx = n\r\nwhile x > k:\r\n x = x//(k+1) + (x%(k+1)!=0)\r\n c += x\r\nc = n-c\r\n\r\nwhile 1:\r\n x = y = c\r\n i = 1\r\n while y >= k**i:\r\n x += y // (k**i)\r\n i += 1\r\n if x >= n:\r\n print(c)\r\n break\r\n c += 1", "def BS (n):\r\n l,r,ans=0,n,0\r\n while l<=r:\r\n v = (l+r)//2\r\n if is_good(v,n):r=v-1;ans=v\r\n else:l=v+1\r\n return ans\r\n\r\ndef is_good(v,n):\r\n i=sm=0\r\n while v//k**i:\r\n sm+=v//k**i;i+=1\r\n return sm >=n\r\n\r\n\r\nn , k = map(int,input().split())\r\nprint(BS(n))", "def f(n, v, k):\r\n kc = k\r\n n -= v\r\n while v//kc:\r\n n -= (v//kc)\r\n kc *= k\r\n return n\r\n\r\ndef binarySearch (n, l, r, k):\r\n if r >= l:\r\n mid = l + (r - l) // 2\r\n if f(n, mid, k) == 0:\r\n return mid\r\n elif f(n, mid, k) < 0:\r\n return binarySearch(n, l, mid-1, k)\r\n else:\r\n return binarySearch(n, mid + 1, r, k)\r\n else:\r\n return l\r\n\r\nif __name__ == '__main__':\r\n n, k = list(map(int, input().split()))\r\n print(binarySearch(n, 0, n, k))", "R = lambda: map(int, input().split())\r\nn, k = R()\r\nl, h = 1, n\r\nwhile l < h:\r\n m = (l + h) // 2\r\n kk = 1\r\n sm = 0\r\n while kk <= m:\r\n sm += m // kk\r\n kk *= k\r\n if sm < n:\r\n l = m + 1\r\n else:\r\n h = m\r\nprint(l)", "n,k=map(int,input().split())\nlo,hi=1,n\nwhile lo<hi:\n v=(hi+lo)//2;i=cur=0\n while cur<n:\n t=v//(k**i)\n if not t:break\n cur+=t;i+=1\n else:hi=v;continue\n lo=v+1\nprint(lo)\n", "\r\nimport math\r\nn, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\na = n * (1 - (1 / k))\r\na = math.ceil(a)\r\n\r\nfor i in range(a, a + 100):\r\n sm = -1\r\n ans = 0\r\n j = 0\r\n while sm != 0:\r\n sm = math.floor(i / (k ** j))\r\n #print(f'sum: {sm}')\r\n j += 1\r\n ans += sm\r\n if ans >= n:\r\n print(i)\r\n break\r\n\r\n#print(a)", "\nn,k=map(int,input().split())\nlo=1\nhi=n\nwhile lo<hi:\n v=(hi+lo)//2\n i=0\n cur=0\n while cur<n:\n t=v//(k**i)\n # print(t)\n if not t:break\n cur+=t\n i+=1\n else:\n hi=v\n continue\n lo=v+1\n\nprint(lo)\n", "from sys import stdin, stdout\r\nimport math\r\n\r\n\r\ndef getLines(v, k):\r\n # return math.floor(v / (1 - (1 / k)))\r\n total = 0\r\n n = 0\r\n while v >= k ** n:\r\n total += math.floor(v / (k ** n))\r\n n += 1\r\n return total\r\n\r\n\r\ndef BurningMidnightOil(n, k):\r\n low = 0\r\n high = 1\r\n while getLines(high, k) < n:\r\n high *= 2\r\n while low < high - 1:\r\n v = low + math.floor((high - low) / 2)\r\n totalLines = getLines(v, k)\r\n if totalLines < n:\r\n low = v\r\n elif totalLines > n:\r\n high = v\r\n else:\r\n return v\r\n return high\r\n\r\n\r\ndef main():\r\n arr = [int(x) for x in stdin.readline().split()]\r\n n = arr[0]\r\n k = arr[1]\r\n print(BurningMidnightOil(n, k))\r\n\r\n\r\n# call the main method\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\nimport sys\r\n\r\ndef Count(v,k,n):\r\n total=0\r\n while v>0:\r\n total+=v\r\n v//=k\r\n if total>=n:\r\n return True\r\n return False\r\n\r\ndef BinSearch(n,k):\r\n low=1;high=10**9\r\n while low<high:\r\n m=(low+high)//2\r\n if Count(m,k,n):\r\n high=m-1\r\n else:\r\n low=m+1\r\n return m\r\n\r\nn,k=map(int,input().split())\r\n\r\nr=BinSearch(n,k)\r\nfor y in range(max(1,r-2),r+3):\r\n if Count(y,k,n):\r\n print(y)\r\n break\r\n", "n,k = map(int,input().split())\r\n\r\ndef get(v,k):\r\n if(k == 1): return True\r\n count = 1;sum=v;term = v\r\n while(term>=1):\r\n term = v//(k**(count))\r\n sum+= term; count+=1\r\n \r\n if(sum>=n):\r\n return True\r\n else:return False\r\n\r\nlo = 1;hi = n\r\nwhile(lo<=hi):\r\n mid = (lo+hi)//2\r\n if(mid == 1 and get(mid,k) == True):\r\n print(mid)\r\n break \r\n if(get(mid,k) == True and get(mid-1,k) ==False):\r\n print(mid)\r\n break\r\n elif(get(mid,k)== True):\r\n hi = mid-1\r\n elif(get(mid,k) == False):\r\n lo = mid+1\r\n" ]

[ "mod = 1000000007\r\ndef sum(x,y,k,add) :\r\n if k<add:return 0\r\n up=x+add\r\n if up>k:up=k\r\n add=add+1\r\n return y*(((add+up)*(up-add+1)//2)%mod)%mod\r\ndef solve(x,y,k,add=0) :\r\n if x==0 or y==0:return 0\r\n if x>y:x,y=y,x\r\n pw = 1\r\n while (pw<<1)<=y:pw<<=1\r\n if pw<=x:return (sum(pw,pw,k,add)+sum(pw,x+y-pw-pw,k,add+pw)+solve(x-pw,y-pw,k,add))%mod\r\n else:return (sum(pw,x,k,add)+solve(x,y-pw,k,add+pw))%mod\r\nq=int(input())\r\nfor i in range(0,q):\r\n x1,y1,x2,y2,k=list(map(int,input().split())) \r\n ans=(solve(x2, y2, k)-solve(x1 - 1, y2, k)-solve(x2, y1 - 1, k)+solve(x1-1,y1-1,k))%mod\r\n if ans<0:ans+=mod\r\n print(ans)" ]

[ "n = int(input())\r\na, b = 1, 1\r\nans = 0\r\nwhile a + b <= n:\r\n a = a + b\r\n a, b = b, a\r\n ans += 1\r\nprint(ans)", "def main():\n n = int(input())\n a = b = r = 1\n while b <= n:\n a, b, r = b, a + b, r + 1\n print(r - 2)\n\n\nif __name__ == '__main__':\n main()\n", "def games(m):\r\n lst = [2]\r\n while lst[-1] <= m - 1:\r\n if len(lst) == 1:\r\n lst += [4]\r\n else:\r\n lst += [lst[-1] + lst[-2] + 1]\r\n return len(lst)\r\n\r\n\r\nprint(games(int(input())))\r\n", "import math\ndef main():\n n = int(input())\n phib = [1, 1]\n ans = 0\n while(phib[-1] + phib[-2] <= n):\n phib.append(phib[-1] + phib[-2])\n ans += 1\n\n print(ans)\nmain()", "fib = [1, 1]\r\nwhile fib[-1] <= 10**18:\r\n a, b = fib[-2], fib[-1]\r\n fib.append(a+b)\r\ndef process(n): \r\n for i in range(len(fib)-1):\r\n if fib[i] <= n < fib[i+1]:\r\n return i-1\r\n \r\nn = int(input())\r\nprint(process(n))\r\n", "def fib(n):\n if n==1: return 1\n if n==2: return 1\n a=[1,1]\n for i in range(n-2):\n a.append(a[i]+a[i+1])\n return a[n-1]\n \n\nn=int(input())\n\ni=1\nwhile 1==1:\n n-=fib(i)\n if(n<=0):\n print(i-1)\n break\n i+=1\n\n \t \t\t\t \t \t\t \t\t\t \t \t \t\t\t\t\t", "n=int(input())\r\nfib=1\r\nlast=1\r\ni=0\r\nwhile True:\r\n i+=1\r\n fib=fib+last\r\n last=fib-last\r\n if fib>n:\r\n print(i-1)\r\n exit(0)", "from math import *\n\nfib=[2,3]\nn=int(input())\nwhile len(fib) <140:\n\tfib.append(fib[-1]+fib[-2])\ncur=0\nwhile fib[cur +1] <= n:\n\tcur = cur +1\nprint(cur+1)\n \t \t\t \t \t\t\t\t \t\t\t \t\t\t\t\t\t\t\t \t", "\r\nn=int(input())\r\n\r\nx,y=1,1\r\nz=-1\r\n\r\nfor i in range(0,n+1):\r\n if y>n:\r\n print(i-1)\r\n break\r\n\r\n z=x+y\r\n x=y\r\n y=z\r\n", "n=int(input())\r\na,b,c=2,1,0\r\nwhile a<=n:\r\n a,b=a+b,a\r\n c+=1\r\nprint(c)", "import bisect\r\nn=int(input())\r\nf=[0]*(10**2+1)\r\nf[0]=f[1]=1\r\nfor i in range(2,10**2+1):\r\n f[i]=f[i-1]+f[i-2]\r\nprint(bisect.bisect_right(f,n)-2)", "import bisect\r\nn = int(input())\r\nc = [1,2]\r\nfor i in range(100):\r\n c.append(c[-1]+c[-2])\r\nif n in c:\r\n print(bisect.bisect_left(c,n))\r\nelse:\r\n print(bisect.bisect_left(c,n)-1)\r\n", "a = [0] * 100\r\na[1] = 2\r\na[2] = 3\r\nfor i in range(3, 100):\r\n a[i] = a[i - 1] + a[i - 2]\r\nn = int(input())\r\nfor i in range(100):\r\n if a[i] > n:\r\n print(i - 1)\r\n break\r\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n n -= 2\r\n sc = 1\r\n first = True\r\n f1 = 1\r\n f2 = 1\r\n f3 = 2\r\n while n > 0:\r\n if first:\r\n first = False\r\n n -= 1\r\n sc += 1\r\n else:\r\n n -= f3\r\n sc += 1\r\n f1 = f2\r\n f2 = f3\r\n f3 = f1 + f2\r\n if n < 0:\r\n sc -= 1\r\n print(sc)\r\n\r\n", "\r\nif __name__ == '__main__':\r\n\tn, = map(int, input().split())\r\n\ta, b = 1, 2\r\n\tk = 0\r\n\twhile (b <= n):\r\n\t\ta, b = b, a+b\r\n\t\tk += 1\r\n\tprint(k)\r\n", "n = int(input())\r\na, b = 2, 1\r\ncnt=0\r\nwhile a <= n:\r\n tmp = a\r\n a = a+b\r\n b = tmp\r\n cnt+=1\r\nprint(cnt)", "def tournir(m):\r\n a = [0] * 200\r\n a[0], a[1] = 1, 2\r\n for i in range(2, 200):\r\n a[i] = a[i - 1] + a[i - 2]\r\n if a[i] > m:\r\n return i - 1\r\n return 0\r\n\r\n\r\nprint(tournir(int(input())))\r\n", "n=int(input())\r\nif(n==2):\r\n print(1)\r\nelif(n==3):\r\n print(2)\r\n\r\nelse:\r\n a=2\r\n b=3\r\n res=2;\r\n while(True):\r\n res+=1\r\n c=a+b\r\n if(c>n):\r\n break\r\n a=b\r\n b=c\r\n \r\n \r\n print(res-1)", "import math as mt\nimport sys,string\ninput=sys.stdin.readline\nfrom collections import defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda : int(input())\n\nn=I()\nl=[1,2]\nfor i in range(1000):\n l.append(l[-1]+l[-2])\nans=0\nfor i in range(len(l)):\n if(n<l[i]):\n break\n ans=i\nprint(ans)\n", "n = int(input())\r\na, b = 1, 2\r\nans = 1\r\nwhile a+b<=n:\r\n ans += 1\r\n a, b = b, a+b\r\nprint(ans)", "n = int(input())\ncnt = 1\ntms = 0\nans = 1\nprev = 0\nwhile cnt + ans <= n:\n\ttms += 1\n\tcnt += ans\n\tans, prev = ans + prev, ans\nprint(tms)\n", "dp = [1, 2]\nfor i in range(2, 150):\n dp.append(dp[-1] + dp[-2])\n\nn = int(input())\nfor i in range(150):\n if n < dp[i]:\n print(i - 1)\n break\n", "n = int(input())\r\n\r\nif n <= 2:\r\n print(n - 1)\r\n exit()\r\n\r\nfib = [0, 1]\r\nwhile fib[-1] <= n:\r\n fib.append(fib[-1] + fib[-2])\r\n\r\nprint(len(fib) - 4)", "n = int(input())\r\na, b, cnt = 2, 1, 0\r\nwhile a <= n:\r\n a, b = a+b, a\r\n cnt+=1\r\nprint(cnt)", "import sys\ninput = sys.stdin.readline\n\nplayers = int(input())\nfib1 = 2\nfib2 = 3\n\nwinner = 1\n\nwhile True:\n cat = fib1\n fib1 = fib2\n fib2+=cat\n\n if fib1 > players:\n print(winner)\n break\n else:\n winner+=1\n\n \t\t\t \t\t \t\t \t\t\t\t \t\t \t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na, b, ans = 1, 2, 1\r\nwhile b <= n:\r\n\tt = b\r\n\tb = a + b\r\n\ta = t\r\n\tans += 1\r\nprint(ans - 1)", "n = int(input())\nif n <= 2:\n print(1)\n exit()\na, b = 1, 1\ns = a+b\nans = 1\nwhile s < n:\n tmp = a+b\n a = b\n b = tmp\n s += b\n ans += 1\nprint(ans)\n\n# import math\n#\n# print(math.log2(690000))", "\r\nn = int(input())\r\n\r\ntotal = 0\r\na = 1\r\nb = 2\r\nc = 0\r\ncont = 0\r\nwhile c <= n:\r\n \r\n c = a + b\r\n a = b\r\n b = c \r\n cont += 1\r\n \r\nprint(cont)\r\n ", "n = int(input())\r\n#d[i] = de cati oameni ai nevoie pentru a-l face pe unul sa castige \"i\" jocuri\r\n#d[0] = 0, d[1] = 2, d[2] = 3, d[3] = 5, d[4] = 8, d[i] = d[i-1] + d[i-2] (i >= 3)\r\nif n == 2:\r\n print(1)\r\nelif n == 3:\r\n print(2)\r\nelse:\r\n i, a, b, c = 3, 5, 3, 2\r\n while a <= n:\r\n i, a, b, c = i+1, a+b, a, b\r\n print(i-1)", "n = int(input())\n\nmem = [None] * 10000\ndef f(x):\n\tif mem[x] is not None:\n\t\treturn mem[x]\n\tif x < 0:\n\t\treturn 1\n\tif x == 0:\n\t\treturn 1\n\telse:\n\t\tmem[x] = f(x - 1) + f(x - 2)\n\t\treturn mem[x]\n\n\n# print(f(3))\n\nx = 1\nwhile f(x + 1) <= n:\n\tx += 1\nprint(x)\n", "# http://codeforces.com/problemset/problem/735/C\r\ndef main():\r\n num = int(input())\r\n num1 = 1\r\n num2 = 2\r\n tmp = 0\r\n cont = 0\r\n while tmp <= num:\r\n tmp = num1 + num2\r\n num1 = num2\r\n num2 = tmp\r\n cont += 1\r\n print(cont)\r\nmain()", "n = int(input())\r\nans = 0\r\na,b,x = 1,1,2\r\nwhile x <= n :\r\n x = a+b\r\n a,b = b,x\r\n ans+=1\r\n \r\nprint(ans-1)", "p = int(input())\n\nif p < 2: print(\"0\")\nelif p == 2: print(\"1\")\nelse:\n num_games = 1\n a = 1\n b = 2\n while p >= b:\n num_games += 1\n a, b = b, a+b\n print(num_games - 1)\n", "# https://codeforces.com/problemset/problem/735/C\r\nn = int(input())\r\na = 1\r\nb = 1\r\nans = 0\r\nwhile a + b <= n:\r\n b += a\r\n a = b - a\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\na = 1\r\nb = 1\r\nans = 0\r\nwhile a+b <= n:\r\n\ta,b = a+b,a\r\n\tans+=1\r\nprint(ans) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\na = 2\r\nb = 1\r\ni = 1\r\nn = int(input())\r\nwhile a+b <= n:\r\n a, b = a+b, a\r\n i += 1\r\nprint(i)\r\n", "N = int(input())\r\ndp = [1]\r\nfor x in range(1, 1000):\r\n dp.append(dp[x-1] + dp[max(0, x-2)])\r\n if dp[-1] > N:\r\n print(x-1)\r\n break", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\nfrom __future__ import print_function # for PyPy2\r\n# from itertools import permutations\r\n# from functools import cmp_to_key\t# for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import *\r\nfrom sys import stdin\r\nfrom bisect import *\r\n# from heapq import *\r\nfrom math import *\r\n \r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nrr = lambda x : reversed(range(x)) \r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\nr = range\r\n\r\n\r\nn, = gil()\r\na, b = 1, 2\r\nans = 1\r\n\r\nwhile b+a <= n:\r\n a, b = b, a+b\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\n\narr = [1, 2]\nwhile arr[-1] < 10**18:\n l = arr[-1] + arr[-2]\n arr.append(l)\n\nans = 0\nfor i in range(len(arr)):\n if arr[i] <= n:\n ans = i\n\nprint(ans)\n", "n = int(input())\r\n\r\na1,a2 = 1,1\r\nfor i in range(1,100):\r\n a1,a2 = a2,a1+a2\r\n if a2>n:\r\n print(i-1)\r\n break\r\n \r\n\r\n\r\n\r\n", "from math import ceil\r\ndef main():\r\n n = int(input())\r\n count = 0\r\n prev = 0\r\n cur = 1\r\n while(1):\r\n if (cur == n):\r\n count -= 1\r\n break\r\n if (cur > n):\r\n count -= 2\r\n break\r\n cur, prev = cur + prev, cur\r\n count += 1\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na, b = 2, 1\r\nc = 0\r\nwhile a <= n:\r\n a, b = a + b, a\r\n c += 1\r\nprint(c)\r\n\r\n", "n = eval(input())\na, b, = 2, 1\nans = 0;\nwhile a <= n:\n a, b = a + b, a\n ans += 1\nprint(ans)\n", "n = int(input())\r\nf=[1,1]\r\nwhile f[-1]<=1e19:\r\n f.append(f[-1]+f[-2])\r\nf.pop(0)\r\nfor i in range(len(f)):\r\n if f[i] > n :\r\n print(i-1)\r\n break", "n = int(input())\r\na = 1\r\nb = 1\r\nk = 0\r\nwhile a <= n:\r\n a, b = a + b, a\r\n k += 1\r\nprint(k - 1)", "n = int(input())\r\nans = 1\r\nf0 = 1\r\nf1 = 2\r\nwhile(f1 <= n):\r\n f1 += f0\r\n f0 = f1 - f0\r\n ans += 1\r\nprint(ans - 1)\r\n", "n=int(input())\r\na,b=2,1\r\nc=0\r\nwhile a<=n:\r\n a,b=a+b,a\r\n c+=1\r\nprint(c)", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\n#sys.stdout=open(\"data.txt\",\"w\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\nneed=[0]*1000\r\nneed[0]=1\r\nneed[1]=2\r\nfor i in range(2,998):\r\n need[i]=need[i-1]+need[i-2]\r\n if need[i]>n:\r\n print(i-1)\r\n break", "n = int(input())\ndp = [1, 2]\nwhile dp[-2] + dp[-1] <= n:\n dp.append(dp[-2] + dp[-1])\nprint(len(dp) - 1)\n", "import bisect as b, itertools as i\r\nf = [1]*2\r\nfor I in range(2,100):\r\n f += [f[I-1] + f[I-2]]\r\n\r\nprint(b.bisect_left(list(i.accumulate(f)), int(input())))", "n=int(input())\r\ni=2\r\nx=2\r\ny=3\r\ns=0\r\nif(n<4):\r\n if n==2:\r\n print(1)\r\n else:\r\n print(2)\r\nelse:\r\n while(1):\r\n s=y+x\r\n if s>n:\r\n break\r\n i+=1\r\n x=y\r\n y=s\r\n print(i)\r\n", "# Python3 program to find maximum number of games played by winner\r\n\r\n# method returns maximum games a winner needs to play in N-player tournament\r\n\r\n# Python3 program to find maximum\r\n# number of games played by winner\r\n\r\n# method returns maximum games\r\n# a winner needs to play in\r\n# N-player tournament\r\n\r\nN = int(input())\r\n\r\n\r\ndef maxGameByWinner(N):\r\n dp = [0] * 20000\r\n\r\n # for 0 games, 1 player is needed\r\n # for 1 game, 2 players are required\r\n dp[0] = 1\r\n dp[1] = 2\r\n\r\n # loop until i-th Fibonacci\r\n # number is less than or\r\n # equal to N\r\n i = 1\r\n while dp[i] <= N:\r\n i = i + 1\r\n dp[i] = dp[i - 1] + dp[i - 2]\r\n\r\n # result is (i - 1) because i will be\r\n # incremented one extra in while loop\r\n # and we want the last value which is\r\n # smaller than N, so\r\n return i - 1\r\n\r\nprint(maxGameByWinner(N))\r\n\r\n", "import io\nimport os\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\nplayers = int(input())\n\nans = 0\nto_win_n_games = [1, 2]\nn = 1\nwhile True:\n if to_win_n_games[n] > players:\n break\n to_win_n_games.append(to_win_n_games[n] + to_win_n_games[n-1])\n n += 1\n\nprint(n - 1)\n", "n=int(input())\na=0\nb=1\nk=0\nwhile b<n:\n\ta,b=b,b+a+1\n\tk+=1\nprint(k)\n\n\t \t\t\t\t\t \t\t\t\t\t \t \t \t \t \t\t \t \t", "n=int(input())\r\na,b=2,1\r\ncnt=0\r\nwhile a<=n:\r\n cnt+=1\r\n a,b=a+b,a\r\nprint(cnt)", "n=int(input())\r\na=1\r\nb=1\r\nc=0\r\nwhile(a+b<=n):\t\r\n\tt=a\r\n\ta=a+b\r\n\tb=t\r\n\tc+=1\r\nprint(c)", "n=int(input())\r\ndp=[0 for i in range(200001)]\r\ndp[0]=1\r\ndp[1]=2\r\ni=1\r\nwhile(dp[i]<=n):\r\n i+=1\r\n dp[i]=dp[i-1]+dp[i-2]\r\nprint(i-1)\r\n\r\n", "n = int(input())\na = 1\nif n == 2:\n\tprint(1)\n\texit()\nb = 2\nind = 0\nwhile b <= n:\n\tind+=1\n\ta, b = b, a+b\nprint(ind)\n\n\t \t\t \t\t \t\t \t\t \t \t", "n = eval(input())\r\na = [0]*100\r\na[0] = 1\r\na[1] = 2\r\nfor i in range(2,100):\r\n a[i]=a[i-1]+a[i-2]\r\n if(a[i]>n):\r\n n = i-1\r\n break\r\nprint(n)", "n = int(input())\r\nnum = 0\r\nfib = [0 for i in range(88)]\r\nfib[0] = 2\r\nfib[1] = 3\r\nfor i in range(2, 88):\r\n fib[i] = fib[i-1] + fib[i-2]\r\n if fib[i] > n:\r\n num = i\r\n break\r\nif n == 2:\r\n num = 1\r\nelif n == 3:\r\n num = 2\r\nprint(num)", "n=int(input())\r\na=[0, 1]\r\nwhile a[-1]<n:\r\n a+=[a[-1]+a[-2]+1]\r\nprint(len(a)-2)", "f = [1, 2, 3]\n\nwhile f[-1] < 10 ** 18:\n f.append(f[-2] + f[-1])\n\nn = int(input())\nsol = 1\nwhile f[sol + 1] <= n:\n sol += 1\n\nprint(sol)\n", "n = int(input())\n\na, b = 1, 1\ni = 0\n\nwhile b <= n:\n\ta, b = b, a+b\n\ti+=1\n\nprint(i-1)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\ndp = [1]\r\nfor i in range(1,100):\r\n dp.append(dp[i-1]+dp[max(i-2,0)])\r\n if dp[-1]>10**18:break\r\n\r\n\r\nfor i in range(100):\r\n if dp[i]>N:\r\n exit(print(i-1))\r\n ", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\ndef fibo(n):\r\n\tf0=0\r\n\tf1=1\r\n\tif (n==0):\r\n\t\tfibo=0\r\n\telif n==1:\r\n\t\tfibo=1\r\n\telse:\r\n\t\tfor i in range(1,n):\r\n\t\t\tfibo=f0+f1\r\n\t\t\tf0=f1\r\n\t\t\tf1=fibo\r\n\treturn(fibo)\r\n\r\nn=int(input())\r\nans=0\r\nfor k in range(n+5):\r\n\tif (fibo(k) > n):\r\n\t\tans=k-3\r\n\t\tbreak\r\n\telse:\r\n\t\tpass\r\nprint(ans)\r\n\r\n\r\n\r\n", "import math\nn = int(input())\nn -= 1\n\nfib = [1, 1]\nwhile fib[-1] <= n:\n fib.append(fib[-1] + fib[-2])\n\ns = 0; ans = 1\nfor i in range(len(fib)):\n s += fib[i]\n if s <= n:\n ans = i + 1\n else:\n break\n\nprint(ans)\n\n\n\n", "\r\ndef findMaxGame(N):\r\n if(N == 1):\r\n return \"MATCH NOT POSSIBLE\"\r\n if(N == 2):\r\n return 1\r\n if(N == 3):\r\n return 2\r\n \r\n a = 1\r\n b = 2\r\n \r\n i = 1\r\n c = a+b\r\n while c <= N:\r\n i = i + 1\r\n c = a + b\r\n a = b\r\n b = c\r\n \r\n \r\n \r\n return (i - 1)\r\n\r\n\r\nN = int(input())\r\nprint(findMaxGame(N))\r\n\r\n\r\n", "n = int(input())\r\nx, y, cnt, s = 1, 1, 0, 0\r\nwhile s + y < n:\r\n s += y\r\n x, y = x + y, x\r\n cnt += 1\r\nprint(cnt)", "n, a, b, v = int(input()), 1, 1, -1\r\nwhile b <= n:\r\n a, b, v = b, a + b, v + 1\r\nprint(v)", "n=int(input())\r\na=2\r\nb=3\r\nif n==1:\r\n print(0)\r\nelif n==2:\r\n print(1)\r\nelif n==3:\r\n print(2)\r\nelse:\r\n curr=2\r\n while a+b<=n:\r\n p=b+a\r\n a=b\r\n b=p\r\n curr+=1\r\n print(curr)\r\n ", "n,a,b,c=int(input()),2,1,0\r\nwhile a<=n:a,b=a+b,a;c+=1\r\nprint(c)", "n = int(input())\r\nfib = [1, 1]\r\nmv = 100\r\n\r\nfor i in range(2, mv):\r\n fib.append(fib[i - 1] + fib[i - 2])\r\n\r\n# print(fib)\r\n\r\nans = 0\r\nfor i in range(mv):\r\n if fib[i] > n:\r\n ans = i - 2\r\n break\r\nprint(ans)", "n = int(input()) # Use input() instead of raw_input() for Python 3\r\n\r\na = [1, 2]\r\nwhile a[-1] + a[-2] <= n:\r\n a.append(a[-1] + a[-2])\r\n\r\ni = len(a) - 1\r\nwhile a[i] > n:\r\n i -= 1\r\n\r\nprint(i)\r\n", "if __name__ == '__main__':\r\n n = eval(input())\r\n res = 0\r\n dp = [1] * 100\r\n dp[1] = 2\r\n for i in range(2, 100):\r\n dp[i] = dp[i - 1] + dp[i - 2]\r\n for idx, i in enumerate(dp):\r\n if n <= i:\r\n print(idx - 1 if n != i else idx)\r\n break", "n = int(input())\r\nb = 2\r\na = 1\r\nd = 0\r\nwhile b <= n:\r\n a, b = b, a + b\r\n d += 1\r\nprint(d)", "#!/usr/bin/python3\n\nimport functools\n\[email protected]_cache(maxsize = None)\ndef num(n):\n if n == 0:\n return 1\n if n == 1:\n return 2\n return num(n - 1) + num(n - 2)\n \n\nn = int(input())\n\nl, r = 0, 100\nwhile l < r - 1:\n mid = (l + r) >> 1;\n if (num(mid) <= n):\n l = mid\n else:\n r = mid\n\nprint(l)\n \n", "def solucion() :\r\n \r\n n=int(input()) #Leemos el entero que representa la cantidad de jugadores que participan en el torneo\r\n minDJugadores=[2,3] #En esta lista guardamos en la posicion i la cantidad minima de jugadores necesarios para que el ganador del torneo gane como maximo i+1 juegos \r\n \r\n if(2<=n<=3) : #estos son los casos bases , si la cantidad de jugadores sobre la que se quiere saber el maximo numero de juegos ganados del campeon es alguno de los casos bases imprimo el caso base correspondiente \r\n if(n==2):\r\n print (\"1\")\r\n else :\r\n print (\"2\")\r\n else : \r\n while (n>=minDJugadores[len(minDJugadores)-1]) : # voy comparando la cantidad de jugadores necesarios como minimo para cada cantidad maxima de juegos ganados ,cuando encuentre un numero maximo de juegos ganados para el campeon que necesite como minimo mas jugadores de los que estoy buscando entonces los jugadores que estoy buscando como maximo podran tener un campeon que gano la cantidad de juegos ganados que estoy comparando -1 \r\n minDJugadores.append(minDJugadores[len(minDJugadores)-1]+minDJugadores[len(minDJugadores)-2])\r\n print (len(minDJugadores)-1)\r\n\r\nsolucion()", "players=int(input())\ntotal=[1,2]\ncount=1\nwhile total[-1]<=players:\n count+=1\n total.append(total[count-1]+total[count-2])\nprint(count-1) \n \t\t \t \t \t\t \t \t\t\t\t\t \t", "n = int(input())\r\narr = [1, 2] + [0] * 1000\r\nfor i in range(2, 1000):\r\n arr[i] = arr[i-1] + arr[i-2]\r\n if arr[i] > n:\r\n print(i-1)\r\n break\r\n", "n = int(input())\r\ni1=1\r\ni2=2\r\nsol=0\r\nwhile i2 <= n:\r\n aux = i1+i2\r\n i1 = i2\r\n i2 = aux\r\n sol = sol+1\r\nprint(sol)\r\n", "fib = [1,1]\n\nfor i in range(100):\n a = fib[-2]\n b = fib[-1]\n fib.append(a+b)\n\n\na = int(input())\n\nfor i in range(100):\n if fib[i] > a:\n print(i-2)\n break\n", "from functools import lru_cache\n\n\n@lru_cache(None)\ndef fib(n):\n if n == 0:\n return 1\n if n == 1:\n return 2\n return fib(n - 1) + fib(n - 2)\n\nn = int(input())\n\nk = 0\nwhile fib(k + 1) <= n:\n k += 1\nprint(k)\n", "\r\n# import sys \r\n# sys.setrecursionlimit(100000)\r\nn=int(input())\r\n\r\na=0\r\nb=1\r\nx=0\r\nwhile a+b<=n:\r\n x+=1\r\n a,b=b,a+b \r\n\r\nprint(x-1)", "n = int(input())\nf = [0]\nf.append(2)\nf.append(3)\n\nwhile f[-1] <= 1e18:\n f.append(f[-1] + f[-2])\n\nans = 1\nwhile n >= f[ans]:\n ans += 1\nprint(ans-1)\n\t\t \t\t \t \t \t\t\t \t \t\t\t\t\t\t\t\t\t", "a = int(input())\r\nfib=[1,2]\r\nfor i in range(100):\r\n fib.append(fib[-1]+fib[-2])\r\n \r\nfor i in range(1, 1000):\r\n if fib[i]<=a<fib[i+1]:\r\n print(i)\r\n quit()", "\r\nn = int(input())\r\ni = 0\r\nfib1 = 1\r\nfib2 = 1\r\nx = 2\r\nwhile x <= n :\r\n x = fib2 + fib1\r\n fib1,fib2 = fib2,x\r\n i += 1\r\n #print('{} {} {} {}'.format(fib1,fib2,x,i))\r\nprint( (i-1) )\r\n", "# 2 1\nn = eval(input())\na = [0]*100\na[0] = 1\na[1] = 2\nfor i in range(2,100):\n a[i]=a[i-1]+a[i-2]\n if(a[i]>n):\n n = i-1\n break\nprint(n)\n\t\t \t \t\t \t \t\t \t \t\t\t \t\t\t\t\t", "n = int(input())\na, b = int(1), int(2)\nans = int(0)\nwhile b <= n:\n a, b = b, b + a\n ans += 1\nprint(ans)\n", "n = int(input())\r\n\r\nans = 0\r\na = 1\r\nb = 2\r\nwhile b <= n:\r\n c = a + b\r\n a = b\r\n b = c\r\n ans += 1\r\n\r\nprint(ans)", "def solucion() :\r\n \r\n n=int(input())\r\n minDJugadores=[2,3]\r\n if(2<=n<=3) :\r\n if(n==2):\r\n print (\"1\")\r\n else :\r\n print (\"2\")\r\n else :\r\n while (n>=minDJugadores[len(minDJugadores)-1]) :\r\n minDJugadores.append(minDJugadores[len(minDJugadores)-1]+minDJugadores[len(minDJugadores)-2])\r\n print (len(minDJugadores)-1)\r\n\r\nsolucion()", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write()\n pass\n\n\ndef fibGen(MAX):\n fibNums = [1, 2] # index denotes how many rounds can be played max\n curNum = 2\n while curNum < MAX:\n curNum = fibNums[-1] + fibNums[-2]\n fibNums.append(curNum)\n\n return fibNums\n\n\ndef binSearch(players, nums):\n l = 0\n r = len(nums) - 1\n while l <= r:\n m = (l + r) // 2\n if nums[m] > players:\n r = m - 1\n else:\n l = m + 1\n return r\n\n\ndef solve(players):\n MAX = 10 ** 18\n nums = fibGen(MAX)\n return binSearch(players, nums)\n\ndef readinput():\n k = getInt()\n print(solve(k))\n\nreadinput()\n", "__author__ = 'ilyakuchumov'\r\n\r\n\r\ndef main():\r\n fib_list = [1, 2]\r\n for i in range(100):\r\n fib_list.append(fib_list[-1] + fib_list[-2])\r\n\r\n n = int(input())\r\n\r\n cur_ans = 0\r\n cur_n = 1\r\n\r\n while cur_n < n:\r\n cur_n += fib_list[cur_ans]\r\n cur_ans += 1\r\n\r\n print(cur_ans)\r\n\r\n\r\nmain()", "def max_games(n):\r\n fib = [1, 2]\r\n while fib[-1] + fib[-2] <= n:\r\n fib.append(fib[-1] + fib[-2])\r\n return len(fib) - 1\r\n\r\nn = int(input().strip())\r\nprint(max_games(n))\r\n", "f=[1,1]\r\nn=int(input())\r\ni=0\r\nwhile f[0]+f[1]<=n:\r\n i+=1\r\n f[0],f[1]=f[1],f[0]+f[1]\r\n\r\nprint(i)", "def solve(b):\r\n v=[0]*1005\r\n v[0]=1\r\n v[1]=2\r\n ans=1\r\n while v[ans]<=b:\r\n ans+=1\r\n v[ans]=v[ans-1]+v[ans-2]\r\n ans-=1\r\n return ans\r\n\r\nb=int(input())\r\nprint(solve(b))\r\n\r\n", "n = int(input())\r\ndp = [1, 2]\r\nwhile dp[-2] + dp[-1] <= n:\r\n dp.append(dp[-2] + dp[-1])\r\nprint(len(dp) - 1)", "import math\r\nn=int(input())\r\nif(1):\r\n l=[]\r\n q=[]\r\n a=0;\r\n b=1;\r\n ans=1;\r\n c=a+b\r\n n=n-2;\r\n while(c<=(n)):\r\n a=b;\r\n b=c;\r\n n=n-c;\r\n c=a+b;\r\n ans+=1\r\n print(ans)", "n = int(input())\nfib = [1,2]\nfor i in range(2, 10**18):\n fib.append(fib[i-2] + fib[i-1])\n if fib[-1] > n:\n print(i-1)\n break\n\t\t \t \t \t \t\t \t \t\t\t \t \t \t", "n = int(input())\r\n\r\na, b, c = 0, 1, 2\r\ndep = 2\r\nwhile c < n:\r\n a, b, c = b, c, b+c+1\r\n dep += 1\r\nprint(dep-1)", "a = int(input())\r\ndef f(a, x, k, m):\r\n while a >= x:\r\n if a == 2:\r\n return 1\r\n k += 1\r\n return f(a, x + m, k, x)\r\n return k - 1\r\n\r\nprint(f(a, 1, 0, 1))\r\n", "\r\nn = int(input())\r\na,b,c = 2,1,0\r\nwhile a<=n:\r\n a,b=a+b,a\r\n c+=1\r\nprint(c)\r\n\r\n", "#!/usr/bin/env python\nimport os\nimport sys\nfrom io import BytesIO, IOBase\nfrom collections import defaultdict\n\n\ndef fastfib(n):\n \"\"\"computes fib(n) iteratively using fast doubling method\"\"\"\n bin_of_n = bin(n)[2:] # binary string of n\n f = [0, 1] # [F(i), F(i+1)] => i=0\n\n for b in bin_of_n:\n f2i1 = f[1]**2 + f[0]**2 # F(2i+1)\n f2i = f[0]*(2*f[1]-f[0]) # F(2i)\n\n if b == '0':\n f[0], f[1] = f2i, f2i1 # [F(2i), F(2i+1)]\n else:\n f[0], f[1] = f2i1, f2i1+f2i # [F(2i+1), F(2i+2)]\n\n return f[0]\n\n\ndef main():\n n = int(input())\n\n l, r = 0, 100\n\n while r - l > 1:\n mid = (l + r) // 2\n if fastfib(mid) > n:\n r = mid\n else:\n l = mid\n\n print(l-2)\n\n\n\n# region fastio\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._file = file\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n# endregion\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\na=[0]*20000\n\na[0]=1\n\t\na[1]=2\n\ni=1\nwhile a[i]<=n:\n\ti+=1\n\ta[i]=a[i-1]+a[i-2]\nprint(i-1)\n\n\t\n\t\n\t", "n = int(input())\na = 2\nb = 1\nans = 0\nwhile a <= n:\n a, b = a + b, a\n ans += 1\nprint(ans)\n\n\t\t \t\t \t \t \t\t \t\t \t \t\t \t", "v = [(1, 1, 0), (2, 2, 1)]\nwhile True:\n a, b, c = v[-1]\n x, y, z = v[-2]\n\n if a + x <= (10**18):\n i, j, k = a + x, 2 * a + x - 1, c + 1\n v = v + [(i, j, k)]\n else:\n break\n\nn = int(input())\n\nfor a, b, c in v:\n if a <= n and n <= b:\n print(c)\n break\n\n \t \t\t\t \t \t \t\t \t\t \t\t \t\t \t", "n = int(input())\r\nif(n == 2):\r\n print(1)\r\nelse:\r\n a = []\r\n a.append(1)\r\n a.append(1)\r\n cur = a[0]+a[1]\r\n i = 1\r\n while(cur<n):\r\n a.append(a[i-1]+a[i])\r\n i+=1\r\n cur+=a[i]\r\n print(i)", "def cost(nk):\r\n \r\n ns = max(0, k - 1)\r\n if ns > n - 2:\r\n return 0\r\n \r\n return f(n - ns - 1, k + 1) + 1\r\n\r\n\r\nn = int(input())\r\nF = [0] * 100\r\nF[0] = 1\r\nF[1] = 2\r\nans = 1\r\n\r\nfor i in range(2, 100):\r\n F[i] = F[i - 1] + F[i - 2]\r\n if F[i] <= n:\r\n ans = i\r\n \r\nprint(ans)" ]

[ "import bisect\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return (m + 1) * u + v\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = 8\r\nx = [[] for _ in range(m)]\r\nfor i in range(n):\r\n x[a[i] - 1].append(i)\r\ns = 0\r\nfor y in x:\r\n s += min(len(y), 1)\r\nif s < m:\r\n ans = s\r\n print(ans)\r\n exit()\r\npow2 = [1]\r\nfor _ in range(m):\r\n pow2.append(2 * pow2[-1])\r\npm = pow2[m]\r\ninf = pow(10, 9) + 1\r\nans = 8\r\nok = 1\r\nfor c in range(1, n // 8 + 3):\r\n dp = [inf] * ((m + 1) * pm)\r\n dp[0] = -1\r\n for i in range(pm):\r\n for j in range(m):\r\n u = f(i, j)\r\n if dp[u] == inf:\r\n break\r\n dpu = dp[u]\r\n for k in range(m):\r\n if i & pow2[k]:\r\n continue\r\n l = i ^ pow2[k]\r\n xk = x[k]\r\n z = bisect.bisect_left(xk, dpu) + c\r\n for y in range(2):\r\n if y + z - 1 < len(xk):\r\n v = f(l, j + y)\r\n dp[v] = min(dp[v], xk[y + z - 1])\r\n for i in range(1, m + 1):\r\n if dp[f(pm - 1, i)] == inf:\r\n ok = 0\r\n break\r\n ans += 1\r\n if not ok:\r\n break\r\nprint(ans)" ]

[ "n, k, d = map(int, input().split()) \r\nA = [0]*(n + 1)\r\nB = sorted(map(int, input().split()))\r\nfor i in range(1, n + 1):\r\n A[i] = B[i - 1]\r\nA.sort()\r\ndp = [0]*(n + 1)\r\ndp[0] = 1\r\ncnt= 0\r\nl=0\r\nfor i in range (k, n + 1):\r\n if dp[i - k] : cnt += 1\r\n while i - l + 1 > k and A[i]-A[l+1] > d:\r\n if dp[l] : cnt-=1\r\n l +=1\r\n if cnt and A[i] -A[l+1] <= d and i - l + 1> k : \r\n dp[i]=1\r\n\r\nif dp[n]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\ninput = lambda :sys.stdin.readline()[:-1]\r\nni = lambda :int(input())\r\nna = lambda :list(map(int,input().split()))\r\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\r\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\r\n#######################################################################\r\ninf = 10**18\r\nclass SegmentTree:\r\n # 初期化処理\r\n # f : SegmentTreeにのせるモノイド\r\n # default : fに対する単位元\r\n def __init__(self, size, f=lambda x,y : min(x,y), default=inf):\r\n self.size = 2**(size-1).bit_length() # 簡単のため要素数Nを2冪にする\r\n self.default = default\r\n self.dat = [default]*(self.size*2) # 要素を単位元で初期化\r\n self.f = f\r\n \r\n def update(self, i, x):\r\n i += self.size\r\n self.dat[i] = x\r\n while i > 0:\r\n i >>= 1\r\n self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])\r\n def updatef(self, i, x):\r\n i += self.size\r\n self.dat[i] = self.f(self.dat[i],x)\r\n while i > 0:\r\n i >>= 1\r\n self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])\r\n \r\n def query(self, l, r):\r\n l += self.size\r\n r += self.size\r\n lres, rres = self.default, self.default\r\n while l < r:\r\n if l & 1:\r\n lres = self.f(lres, self.dat[l])\r\n l += 1\r\n \r\n if r & 1:\r\n r -= 1\r\n rres = self.f(self.dat[r], rres) # モノイドでは可換律は保証されていないので演算の方向に注意\r\n l >>= 1\r\n r >>= 1\r\n res = self.f(lres, rres)\r\n return res\r\n \r\n def query2(self):\r\n s = 1\r\n #print(self.size)\r\n while s<self.size:\r\n #print(s)\r\n if self.dat[s*2]>self.dat[s*2+1]:\r\n s = s*2\r\n else:\r\n s = s*2+1\r\n return s-self.size\r\nn,k,d = na()\r\na = sorted(na())\r\nst = SegmentTree(1+n, lambda x,y:x+y, 0)\r\nst.update(0, 1)\r\nfrom bisect import bisect_left as bl\r\nfor i in range(1, n+1):\r\n if i < k:\r\n continue\r\n x = bl(a, a[i-1]-d)\r\n y = 0\r\n if x <= i - k:\r\n y = st.query(x, i-k+1)\r\n if y:\r\n st.update(i, 1)\r\n\r\nif y:\r\n YES()\r\nelse:\r\n NO()\r\n", "#!/usr/bin/env python3\n\nfrom bisect import bisect\nfrom sys import exit\n\n[n, k, d] = map(int, input().strip().split())\nais = list(map(int, input().strip().split()))\nif k == 1:\n\tprint ('YES')\n\texit()\n\nais.sort()\n\n# can do ais[i:]\ncando = [False for _ in range(n)]\nj = n - 1 # j is such that a[j] > a[i] + d >= a[j - 1] (upper_bound) a[:j] <= a[i] + d < a[j:]\ncount = 0 # sum(cando[i + k:j + 1])\nfor i in reversed(range(n)):\n\tif i + k < n and cando[i + k]:\n\t\tcount += 1\n\tif n - i < k:\n\t\tcontinue\n\tif ais[-1] - ais[i] <= d:\n\t\tcando[i] = True\n\t\tcontinue\n\twhile ais[j - 1] > ais[i] + d:\n\t\tif cando[j]:\n\t\t\tcount -= 1\n\t\tj -= 1\n\tcando[i] = (count > 0)\n\t\n\nif cando[0]:\n\tprint ('YES')\nelse:\n\tprint ('NO')\n\n", "n,k,d=list(map(int,input().split()))\na=sorted(list(map(int,input().split())))\nb=[0]*n\ni=j=0\nfor i in range(n):\n while a[i]-a[j]>d:j+=1\n b[i]=j\nc=[0]*n\nfor i in range(k-1,n):c[i]=c[i-1]+int(i-b[i]+1>=k and (b[i]==0 or c[i-k]>c[b[i]-2] or (b[i]==1 and c[i-k]>c[0])))\nprint('YES' if n<2 or c[n-1]>c[n-2] else 'NO')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ndp = [0] * (n + 5)\r\ndp[0] = 1\r\ndp[1] = -1\r\nr = 0\r\nfor i in range(n):\r\n if not dp[i]:\r\n dp[i + 1] += dp[i]\r\n continue\r\n ai = a[i]\r\n while r < n and a[r] - d <= ai:\r\n r += 1\r\n l = i + k\r\n if l <= r:\r\n dp[l] += 1\r\n dp[r + 1] -= 1\r\n dp[i + 1] += dp[i]\r\nans = \"YES\" if dp[n] else \"NO\"\r\nprint(ans)", "def bi_search(a, x):\r\n n = len(a)\r\n u, l = n, -1\r\n \r\n while u-l>1:\r\n md=(u+l)//2\r\n \r\n if x>a[md]:\r\n l=md\r\n else:\r\n u=md\r\n \r\n return u \r\n\r\nclass Bit():\r\n # index-1\r\n def __init__(self, n):\r\n self.bit = [0] * (n+1) \r\n self.n = n\r\n \r\n # sum[1, i]\r\n def sum_prefix(self, i):\r\n s = 0\r\n while i > 0:\r\n s += self.bit[i]\r\n i -= i&(-i)\r\n return s\r\n \r\n # sum[l, r] \r\n def sum_(self, l, r):\r\n if l == 1:\r\n return self.sum_prefix(r)\r\n return self.sum_prefix(r) - self.sum_prefix(l-1) \r\n \r\n def add(self, i, x):\r\n while i <= self.n:\r\n self.bit[i] += x\r\n i += i&(-i)\r\n\r\nn, k, d = map(int, input().split())\r\na = [-1] + list(map(int, input().split()))\r\na = sorted(a)\r\n\r\nB=Bit(n) \r\nans=[-1] * n \r\n\r\nfor i in range(n+1):\r\n if i==0:\r\n continue\r\n \r\n pos = bi_search(a, max(0, a[i]-d)) #pos, i-k+1..,i-1,i\r\n \r\n l, r = pos-1, i-k\r\n \r\n if l<=r:\r\n s=0\r\n \r\n if l>=1:\r\n s+=B.sum_(l, r)\r\n \r\n if l==0 or s > 0:\r\n B.add(i, 1)\r\n ans[i-1]=1\r\n \r\nif ans[-1]==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k, d = map(int, input().split())\r\nA = sorted(map(int, input().split()))\r\ncan_do = [0] * (n + 1)\r\ncan_do[0] = 1\r\nl, r = 0, 0\r\nfor i, a in enumerate(A, start=1):\r\n while a - d > A[l]:\r\n l += 1\r\n r = i - k\r\n can = 0\r\n if r >= l:\r\n s = can_do[r]\r\n if l:\r\n s -= can_do[l - 1]\r\n if s > 0:\r\n can = 1\r\n can_do[i] = can_do[i - 1] + can\r\n\r\nprint('YES' if can_do[n] - can_do[n - 1] > 0 else 'NO')\r\n", "import sys\r\nreadline = sys.stdin.readline\r\n\r\nclass Segtree:\r\n def __init__(self, A, intv, initialize = True, segf = max):\r\n self.N = len(A)\r\n self.N0 = 2**(self.N-1).bit_length()\r\n self.intv = intv\r\n self.segf = segf\r\n if initialize:\r\n self.data = [intv]*self.N0 + A + [intv]*(self.N0 - self.N)\r\n for i in range(self.N0-1, 0, -1):\r\n self.data[i] = self.segf(self.data[2*i], self.data[2*i+1]) \r\n else:\r\n self.data = [intv]*(2*self.N0)\r\n \r\n def update(self, k, x):\r\n k += self.N0\r\n self.data[k] = x\r\n while k > 0 :\r\n k = k >> 1\r\n self.data[k] = self.segf(self.data[2*k], self.data[2*k+1])\r\n \r\n def query(self, l, r):\r\n L, R = l+self.N0, r+self.N0\r\n s = self.intv\r\n while L < R:\r\n if R & 1:\r\n R -= 1\r\n s = self.segf(s, self.data[R])\r\n if L & 1:\r\n s = self.segf(s, self.data[L])\r\n L += 1\r\n L >>= 1\r\n R >>= 1\r\n return s\r\n \r\n def binsearch(self, l, r, check, reverse = False):\r\n L, R = l+self.N0, r+self.N0\r\n SL, SR = [], []\r\n while L < R:\r\n if R & 1:\r\n R -= 1\r\n SR.append(R)\r\n if L & 1:\r\n SL.append(L)\r\n L += 1\r\n L >>= 1\r\n R >>= 1\r\n \r\n if reverse:\r\n for idx in (SR + SL[::-1]):\r\n if check(self.data[idx]):\r\n break\r\n else:\r\n return -1\r\n while idx < self.N0:\r\n if check(self.data[2*idx+1]):\r\n idx = 2*idx + 1\r\n else:\r\n idx = 2*idx\r\n return idx - self.N0\r\n else:\r\n for idx in (SL + SR[::-1]):\r\n if check(self.data[idx]):\r\n break\r\n else:\r\n return -1\r\n while idx < self.N0:\r\n if check(self.data[2*idx]):\r\n idx = 2*idx\r\n else:\r\n idx = 2*idx + 1\r\n return idx - self.N0\r\n\r\nN, K, D = map(int, readline().split())\r\nA = list(map(int, readline().split()))\r\nA.sort()\r\nlm = [None]*N\r\nfor i in range(N):\r\n a = A[i]\r\n ok = i\r\n ng = -1\r\n while abs(ok-ng) > 1:\r\n med = (ok+ng)//2\r\n if a-A[med] <= D:\r\n ok = med\r\n else:\r\n ng = med\r\n lm[i] = ok\r\n\r\nT = Segtree([None]*(N+1), 0, initialize = False, segf = max)\r\nT.update(0, 1)\r\nfor i in range(N):\r\n rm = i-K+2\r\n if rm <= lm[i]:\r\n continue\r\n if T.query(lm[i], rm):\r\n T.update(i+1, 1)\r\n\r\nprint('YES' if T.query(N, N+1) else 'NO')\r\n\r\n ", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,k,d=map(int,input().split())\r\nc=[0]+list(map(int,input().split()))\r\nc.sort()\r\n\r\nm=n+1\r\nok=[0]*(m+1)\r\nok[0]=1\r\nok[1]=-1\r\nL=1\r\nR=1\r\ntmp=0\r\nfor i in range(1,m):\r\n while L<m and tmp<k:\r\n tmp+=1\r\n L+=1\r\n while R<m and c[R]-c[i]<=d:\r\n R+=1\r\n ok[i]+=ok[i-1]\r\n if L-1<R and tmp>=k and ok[i-1]>0:\r\n ok[L-1]+=1\r\n ok[R]-=1\r\n tmp-=1\r\n\r\nif ok[-2]>0:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\n \r\nn, k, d = map(int, input().split())\r\na = [0] + sorted(map(int, input().split()))\r\ndp = [1] + [0]*n\r\nj = k\r\n \r\nfor i in range(n):\r\n if dp[i] == 0:\r\n continue\r\n j = max(j, i+k)\r\n while j <= n and a[j] - a[i+1] <= d:\r\n dp[j] |= dp[i]\r\n j += 1\r\n \r\nprint('YES' if dp[-1] else 'NO')" ]

[ "def solve(curr,other,k):\r\n t=0 \r\n while t<k and t<len(curr) and t<len(other) and other[t]>curr[t]:\r\n t+=1 \r\n return t\r\n\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nmaxx=-10**100\r\nfor i in range(n):\r\n curr=[]\r\n other=sorted(arr[:i]+arr[i+1:],reverse=True)\r\n for j in range(i,n):\r\n curr.append(arr[j])\r\n curr.sort()\r\n if j<n-1:\r\n del other[other.index(arr[j+1])]\r\n #print(other)\r\n t=min(len(curr),len(other),k)\r\n t=solve(curr,other,k)\r\n maxx=max(maxx,sum(curr)-sum(curr[:t])+sum(other[:t]))\r\n #print(curr,other,sum(curr)-sum(curr[:t])+sum(other[:t]))\r\n #print(maxx)\r\n #print(curr,other)\r\nprint(maxx)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ndef solve(i, j):\r\n cur_res = sum(a[i:j+1])\r\n a1 = sorted(a[i:j+1])\r\n a2 = sorted(a[:i] + a[j+1:], reverse=True)\r\n for t in range(min(k, len(a1), len(a2))):\r\n m = min(a1)\r\n if a2[t] > m:\r\n cur_res += a2[t] - m\r\n a1[a1.index(m)] = a2[t]\r\n return cur_res\r\n\r\nprint(max(solve(i, j) for i in range(n) for j in range(i, n)))\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ns = a[0]\r\nfor l in range(n):\r\n\tfor r in range(l,n):\r\n\t\tout = sorted(a[:l] + a[r+1:], reverse=True)\r\n\t\tinside = sorted(a[l:r+1])\r\n\t\ttemp = sum(a[l:r+1])\r\n\t\tfor i in range(min(k, len(out), len(inside))):\r\n\t\t\tif out[i] > inside[i]:\r\n\t\t\t\ttemp += out[i] - inside[i]\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\tif temp > s:\r\n\t\t\ts = temp\r\nprint(s)\r\n", "n,m=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nk=-100000000\r\nfor l in range(n):\r\n for r in range(l+1,n+1):\r\n k=max(k,sum(sorted(lis[l:r] + sorted(lis[:l]+lis[r:])[-m:])[l-r:]))\r\nprint(k) ", "# HEY STALKER\r\nn, kr = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = -2e18\r\nfor i in range(n):\r\n for j in range(i, n):\r\n k = kr\r\n sub = l[i:j+1]\r\n sub_sum = sum(sub)\r\n sub.sort()\r\n chk = l[0:i] + l[j+1:]\r\n chk.sort()\r\n chk.reverse()\r\n ans = max(ans, sub_sum)\r\n for t in range(len(sub)):\r\n if t < len(chk) and k > 0:\r\n if sub[t] < chk[t]:\r\n sub_sum -= sub[t]\r\n sub_sum += chk[t]\r\n ans = max(ans, sub_sum)\r\n k -= 1\r\n else:\r\n break\r\nprint(ans)", "from bisect import bisect_left, bisect_right\r\n\r\nn, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\np = sorted(t)\r\n\r\nif p[-1] <= 0:\r\n print(p[-1])\r\n exit(0)\r\nif p[0] >= 0:\r\n print(sum(p))\r\n exit(0)\r\ni = max(0, n - k - 1)\r\nwhile p[i] < 0: i += 1\r\nq = sum(p[i: ])\r\nif n < k + 2 or p[n - k - 1] <= 0:\r\n print(q)\r\n exit(0)\r\n\r\nfor l in range(n - k - 2):\r\n r = l + k + 2\r\n u = sorted(t[: l] + t[r: ])\r\n v = sorted(t[l: r])\r\n for i in range(r, n):\r\n q = max(q, sum(sorted(v + u[- min(k, len(u)): ])[- len(v): ]))\r\n u.remove(t[i])\r\n v.insert(bisect_left(v, t[i]), t[i])\r\n q = max(q, sum(sorted(v + u[- min(k, len(u)): ])[- len(v): ]))\r\nprint(q)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = max(a)\r\n\r\nfor left in range(n):\r\n for right in range(left, n):\r\n inner = a[left:right+1]\r\n outer = a[:left] + a[right+1:]\r\n inner.sort()\r\n outer.sort(reverse=True)\r\n\r\n for i in range(k):\r\n if i >= len(inner) or i >= len(outer):\r\n break\r\n if inner[i] < outer[i]:\r\n inner[i] = outer[i]\r\n else:\r\n break\r\n\r\n ans = max(ans, sum(inner))\r\nprint(ans)\r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nans,s,p=float(\"-inf\"),[],[]\r\nfor l in range(n):\r\n for r in range(l+1,n+1):\r\n s=sorted(a[l:r])\r\n p=a[:l]+a[r:]\r\n p.sort()\r\n ans,p=max(ans,sum(s)),p[::-1]\r\n ls,t=[k,len(s),len(p)],sum(s)\r\n for i in range(min(ls)):\r\n t-=s[i]\r\n t+=p[i]\r\n ans=max(ans,t)\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = max(a)\r\nfor l in range(n):\r\n for r in range(l, n):\r\n inner = a[l:r+1]\r\n outer = a[:l] + a[r+1:]\r\n inner.sort()\r\n outer.sort(reverse=True)\r\n for i in range(k):\r\n if i >= len(inner) or i >= len(outer):\r\n break\r\n if inner[i] < outer[i]:\r\n inner[i] = outer[i]\r\n else:\r\n break\r\n ans = max(ans, sum(inner))\r\nprint(ans)# 1698086915.4356983", "def f(a,k):\r\n ans=-float(\"inf\")\r\n for i in range(len(a)+1):\r\n for j in range(i):\r\n mid=a[j:i]\r\n l=a[:j]+a[i:]\r\n # print(mid,l)\r\n l=sorted(l,reverse=True)\r\n mid=sorted(mid)\r\n s=sum(mid)\r\n ans=max(ans,s)\r\n kk=k\r\n while kk:\r\n if l and mid and s-mid[0]+l[0]>s :\r\n s= s-mid[0]+l[0]\r\n l.pop(0)\r\n mid.pop(0)\r\n kk-=1\r\n ans=max(ans,s)\r\n else:\r\n break\r\n return ans\r\n\r\n\r\nn,k=map(int,input().strip().split())\r\na=list(map(int,input().strip().split()))\r\nprint(f(a,k))", "def solve(a,l,r,k):\r\n out = sorted(a[:l]+a[r:],reverse=True)\r\n inside = sorted(a[l:r])\r\n cur = sum(a[l:r])\r\n for i in range(min(k,len(inside),len(out))):\r\n if out[i] > inside[i]:\r\n cur += out[i]-inside[i]\r\n else:\r\n break\r\n return cur\r\n\r\nn,k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nassert len(a) == n\r\n\r\nbest = a[0]\r\nfor l in range(n):\r\n for r in range(l+1,n+1):\r\n cur = solve(a,l,r,k)\r\n if cur > best:\r\n best = cur\r\n\r\nprint(best)\r\n", "R=lambda:map(int,input().split())\nn,k=R()\na=list(R())\ndef f(l,r):\n x=sorted(a[:l]+a[r+1:],reverse=True)\n y=sorted(a[l:r+1])\n return sum(y+[max(0,x[i]-y[i])for i in range(min(k,len(x),len(y)))])\nprint(max(f(l,r)for l in range(n)for r in range(l,n)))\n", "n,k = map(int, input().split(' '))\r\nA = list(map(int, input().split(' ')))\r\nbest = max(A)\r\nfor left in range(n) :\r\n for right in range(left, n) :\r\n inner = A[left:right+1]\r\n outer = A[:left]+A[right+1:]\r\n inner.sort()\r\n outer.sort(reverse = True)\r\n for i in range(k) :\r\n if i >= len(inner) or i >= len(outer) : break\r\n if inner[i] < outer[i] :\r\n inner[i] = outer[i]\r\n else : break\r\n best = max(best, sum(inner))\r\nprint(best)", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nbest=max(a)\r\nfor left in range(n):\r\n for right in range(left,n):\r\n inner=a[left:right+1]\r\n outer=a[0:left]+a[right+1:]\r\n inner.sort()\r\n outer.sort(reverse=True)\r\n for i in range(k):\r\n if i>=len(outer) or i>=len(inner): break \r\n if inner[i]<outer[i]:\r\n inner[i]=outer[i]\r\n else :\r\n break \r\n best=max(best,sum(inner)) \r\nprint(best)", "#!/usr/local/bin/python3\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nr_sum = a[0]\r\nfor l in range(n):\r\n\tfor r in range(l, n):\r\n\t\tinside = sorted(a[l:r+1])\r\n\t\toutside = sorted(a[:l] + a[r+1:], reverse=True)\r\n\t\tt_sum = sum(inside)\r\n\t\tfor i in range(min(k, len(inside), len(outside))):\r\n\t\t\tif outside[i] > inside[i]:\r\n\t\t\t\tt_sum += (outside[i] - inside[i])\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\tif t_sum > r_sum:\r\n\t\t\tr_sum = t_sum\r\nprint(r_sum)\r\n", "from operator import itemgetter\r\nfrom sys import stdin, stdout\r\n\r\n\r\ndef solve(a, k):\r\n aa = list(map(lambda x: [x[1], x[0]], enumerate(a)))\r\n aa.sort(reverse=True, key=itemgetter(0))\r\n if aa[0][0] < 0:\r\n return aa[0][0]\r\n\r\n best = -float(\"inf\")\r\n for i in range(len(a)):\r\n for j in range(1, len(a)+1):\r\n in_range = sorted(a[i:j], reverse=True)\r\n out_of_range = sorted(a[:i] + a[j:])\r\n additional = []\r\n for kk in range(k):\r\n if len(out_of_range) > 0 and len(in_range) > 0 and in_range[-1] < out_of_range[-1]:\r\n in_range.pop()\r\n additional.append(out_of_range.pop())\r\n best = max(best, sum(in_range + additional))\r\n\r\n return best\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, stdin.readline().split())\r\n a = [int(x) for x in stdin.readline().split()]\r\n stdout.write(\"{}\\n\".format(solve(a, k)))", "n, k = [int(c) for c in input().split()]\na = [int(c) for c in input().split()]\n\nbest = -1000001\n\nseq = []\nother = []\n\nfor l in range(n):\n for r in range(l + 1, n + 1):\n seq = sorted(a[l:r])\n\n other = a[:l] + a[r:]\n other.sort()\n other.reverse()\n\n seq_sum = sum(seq)\n\n best = max(best, seq_sum)\n\n for sw in range(0, min(k, len(seq), len(other))):\n seq_sum = seq_sum - seq[sw] + other[sw]\n best = max(best, seq_sum)\n\n\nprint(best)\n\n\n# 200 10\n# -933 947 859 -503 947 -767 121 469 214 -381 -962 807 59 -702 -873 -747 -233 77 -853 -39 243 902 909 612 -248 238 -511 -897 933 536 732 322 -155 247 340 145 681 -469 -906 -768 -368 -356 -168 -466 -398 -528 -515 968 107 929 178 29 -938 766 -173 -544 128 905 -877 -134 469 214 788 530 984 -738 805 -317 619 -596 -170 799 -276 -53 -211 663 619 -951 -616 -117 -574 774 127 -532 69 210 901 668 517 -354 280 -746 369 -357 696 570 -918 -912 -23 405 -414 -962 504 -390 165 -767 -259 442 -523 38 910 -956 62 -665 -933 947 859 -503 947 -767 121 469 214 -381 -962 807 59 -702 -873 -747 -233 77 -853 -39 243 902 909 612 -248 238 -511 -897 933 536 732 322 -155 247 340 145 681 -469 -906 -768 -368 -356 -168 -466 -398 -528 -515 968 107 929 178 29 -938 766 -173 -544 128 905 -877 -134 469 214 788 530 984 -738 805 -317 619 -596 -170 799 -276 -53 -211 663 619 -951 -616 -117 -574 774 127 -933 947 859 -503 947 -767 121 469 214 -381 -962 807 59 -702 -873 -747 -233 77 -853 -39 243 902 909 612 -248 238 -511 -897 933 536 732 322 -155 247 340 145 681 -469 -906 -768 -368 -356 -168 -466 -398 -528 -515 968 107 929 178 29 -938 766 -173 -544 128 905 -877 -134 469 214 788 530 984 -738 805 -317 619 -596 -170 799 -276 -53 -211 663 619 -951 -616 -117 -574 774 127 -532 69 210 901 668 517 -354 280 -746 369 -357 696 570 -918 -912 -23 405 -414 -962 504 -390 165 -767 -259 442 -523 38 910 -956 62 -665 -933 947 859 -503 947 -767 121 469 214 -381 -962 807 59 -702 -873 -747 -233 77 -853 -39 243 902 909 612 -248 238 -511 -897 933 536 732 322 -155 247 340 145 681 -469 -906 -768 -368 -356 -168 -466 -398 -528 -515 968 107 929 178 29 -938 766 -173 -544 128 905 -877 -134 469 214 788 530 984 -738 805 -317 619 -596 -170 799 -276 -53 -211 663 619 -951 -616 -117 -574 774 127\n\n\n\n", "R = lambda:map(int, input().split())\r\nn, k = R()\r\na = list(R())\r\ndef f(l, r):\r\n x = sorted(a[:l] + a[r + 1:], reverse=True)\r\n y = sorted(a[l:r + 1])\r\n return sum(y + [max(0, x[i] - y[i]) for i in range(min(k, len(x), len(y)))])\r\nprint(max(f(l, r) for l in range(n) for r in range(l, n)))", "read_line = lambda: [int(i) for i in input().split()]\nn, k = read_line()\nx = read_line()\nprint(max(sum(sorted(x[l:r] + sorted(x[:l] + x[r:])[-k:])[l-r:]) for l in range(n) for r in range(l + 1, n + 1)))\n" ]

[ "\r\nn = int(input())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nfor i in range(n - 1, -1, -1):\r\n\tkey = l[i]\r\n\tif key < 0:\r\n\t\tprint(key)\r\n\t\texit()\r\n\r\n\tif int(key ** 0.5) ** 2 != key:\r\n\t\tprint(key)\r\n\t\texit()", "from math import*\r\nn=int(input())\r\nl=set(map(int,input().split()))\r\nls=set(x**2 for x in range(1001))\r\nprint(max(l-ls))\r\n", "import math\r\ndef isPerfectSquare(x):\r\n if(x >= 0):\r\n sr = int(math.sqrt(x))\r\n if ((sr*sr) == x):\r\n return True\r\n return False\r\n\r\n\r\nt = int(input())\r\nl = list(map(int,input().split()))\r\nc=sorted(l)\r\nans = 0\r\nfor i in range(t-1,-1,-1):\r\n if isPerfectSquare(c[i])==False:\r\n ans = c[i]\r\n break \r\nprint(ans) ", "from functools import reduce\r\ndef is_prefect_square(x): \r\n try:\r\n return x**0.5 == int(x**0.5)\r\n except:\r\n return False\r\ninput()\r\nprint(max(list(filter(lambda x: not is_prefect_square(x),list(map(int,input().split()))))))", "import math\r\n\r\nn = int(input())\r\nV = [int(x) for x in input().split()]\r\nmax_x = -10**6\r\nfor p in V:\r\n if p < 0:\r\n max_x = max(p, max_x)\r\n continue\r\n sx = round(math.sqrt(p))\r\n if p == sx**2: continue\r\n max_x = max(p, max_x)\r\nprint(max_x)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx,y,f=[],[],0\r\nflag = 0\r\nfor i in a:\r\n if i<0:\r\n \t\tx.append(i)\r\n elif float(i)**0.5-int(float(i)**0.5)!=0.0:\r\n \t\ty.append(i)\r\nx+=y\r\nprint(int(max(x)))", "input()\nfor x in sorted([*map(int, input().split())])[::-1]:\n if x<0 or int(x**.5)**2 != x:\n print(x)\n break\n", "import math\r\nn=int(input())\r\na=list(map(int, input().split()))\r\na.sort()\r\na.reverse()\r\nfor i in range(len(a)):\r\n if a[i]>=0:\r\n root = math.sqrt(a[i])\r\n if int(root + 0.5) ** 2 != a[i]:\r\n r=a[i]\r\n break\r\n else:\r\n r=a[i]\r\n break\r\nprint(r)", "n = int(input())\r\na = set(map(int, input().split()))\r\nprint(max(a-set(x*x for x in range(1001))))", "sn = set([x*x for x in range(1001)])\nn = int(input())\na = [int(x) for x in input().split()]\na.sort(reverse=True)\nfor i in range(n):\n\tif a[i] not in sn:\n\t\tprint(a[i])\n\t\tbreak\n", "n = int(input())\nv = sorted(map(int, input().split()), reverse=True)\nfor i in v:\n if i < 0 or (i ** 0.5) % 1 != 0.0:\n break\nprint(i)\n", "n = int(input())\r\n_digits = list(map(int, input().split()))\r\n_digits.sort(reverse = True)\r\nif _digits[0]<0:\r\n print(_digits[0])\r\nelse:\r\n ans = -10000000\r\n for i in range(n):\r\n if _digits[i] < 0:\r\n ans = _digits[i]\r\n break\r\n else:\r\n if _digits[i] > ans and _digits[i]**.5 != int(_digits[i]**.5):\r\n ans = _digits[i]\r\n break\r\n print(ans)", "n=int(input())\r\nx=[]\r\nz=0\r\ni=set(map(int,input().split()))\r\nx=set(x**2 for x in range(1001))\r\nprint(max(i-x))\r\n", "i=input\r\ni()\r\nprint(round(max(filter(lambda x: x<0 or x**0.5%1, map(int, i().split())))))", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nfor i in a:\r\n if(i<0):\r\n print(i)\r\n break\r\n sa=math.sqrt(i)\r\n if(int(sa)!=sa):\r\n print(i)\r\n break\r\n", "a = []\r\nfor i in range(1001):\r\n a.append(i ** 2)\r\nn = int(input())\r\nb = [int(i) for i in input().split()]\r\nb.sort(reverse=True)\r\nfor i in b:\r\n if i not in a:\r\n print(i)\r\n break", "\r\n\r\ndef main_function():\r\n input()\r\n a = sorted([int(i) for i in input().split(\" \")], reverse=True)\r\n for element in a:\r\n r = 0\r\n is_element_found = False\r\n while True:\r\n if r ** 2 > element:\r\n is_element_found = True\r\n break\r\n elif r ** 2 == element:\r\n is_element_found = False\r\n break\r\n r += 1\r\n if is_element_found:\r\n return element\r\n \r\n\r\nprint(main_function())", "n=int(input());s=set(map(int,input().split()))\r\nt=set(i*i for i in range(1001));print(max(s-t))", "import math \r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range (n):\r\n maximum=max(a)\r\n nb=int(math.sqrt(abs(maximum)))\r\n if( math.pow(nb,2)!=maximum):\r\n print(maximum)\r\n break\r\n else :\r\n a.remove(maximum)", "import math\r\n\r\nfrom math import sqrt\r\n\r\ndef main():\r\n\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n mx = -10 ** 7\r\n for x in a:\r\n if x > mx:\r\n if x < 0:\r\n mx = x\r\n else:\r\n r = int(sqrt(x))\r\n if r * r != x:\r\n mx = x\r\n print(mx)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys, threading\r\n input = sys.stdin.readline\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n thread.join()", "def main():\r\n from math import sqrt\r\n\r\n n = int(input())\r\n row = input()\r\n arr = row.split(' ')\r\n\r\n maximum = -float('Inf')\r\n for item in arr:\r\n if int(item) >= 0:\r\n if not(sqrt(int(item)).is_integer()):\r\n maximum = max(maximum, int(item))\r\n else:\r\n maximum = max(maximum, int(item))\r\n \r\n print(maximum)\r\n\r\nmain()", "maxn = 10**6+2\r\nk = [0]*maxn\r\ni =0\r\nwhile i*i<maxn:\r\n k[i*i]=1\r\n i+=1\r\n\r\nn, = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort(reverse=True)\r\n\r\nfor c in arr:\r\n if k[c]==0:\r\n print(c)\r\n break", "from math import sqrt\r\nnumber = int(input()) \r\nl = list(map(int , input().split())) \r\nl = sorted(l)[ : : -1]\r\nfor i in l : \r\n if i < 0 or sqrt(i) - int(sqrt(i)) != 0 : \r\n print(int(i))\r\n break\r\n \r\n", "n = int(input())\r\nprint(max(set(map(int, input().split())) - set(x*x for x in range(1100))))", "# @author Matheus Alves dos Santos\n\nn = int(input())\nsequence = list(map(int, input().split()))\nsequence.sort(reverse = True)\n\nfor i in sequence:\n if (i < 0):\n unperfect_square = i\n break\n elif ((round(i ** 0.5) ** 2) != i):\n unperfect_square = i\n break\n\nprint(unperfect_square)\n\n", "n = int(input())\narr = [int(i) for i in input().split()]\n\nfrom math import sqrt\n\nmx = None\n\nfor i in arr:\n if i < 0 or sqrt(i) != int(sqrt(i)):\n if mx == None or mx < i:\n mx = i\n\nprint(mx)\n", "n=int(input())\na=list(map(int, input().split()))\nb=[]\nfor i in range (n):\n can=abs((a[i])**(1/2))\n if can%1!=0 or a[i]<0:\n b.append(a[i])\nprint(max(b))\n\n \n \n\t \t\t \t\t \t \t \t \t\t", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmaxNotPerfectSquare = -10 ** 6\r\nfor i in a :\r\n if i < 0 or int(math.sqrt(i)) ** 2 != i :\r\n maxNotPerfectSquare = max(maxNotPerfectSquare, i)\r\nprint(maxNotPerfectSquare)\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "import math\r\ndef perf(x):\r\n if x < 0:\r\n return False\r\n else:\r\n return math.sqrt(x) == int(math.sqrt(x))\r\n\r\nn = int(input())\r\nlista = list(map(int, input().split()))\r\nmaior = -99999999999\r\n\r\nfor x in lista:\r\n if perf(x) == False:\r\n if x > maior:\r\n maior = x\r\nprint(maior)", "input()\r\nX = list(map(int, input().split()))\r\nPositive = list(filter(lambda x: x > 0 and int(x ** .5) != x ** .5, X))\r\nNegative = list(filter(lambda x: x < 0, X))\r\nprint(max(Positive) if len(Positive) != 0 else max(Negative))\r\n\r\n# UB_CodeForces\r\n# Advice: Destroy what wants to destroy you\r\n# Location: Behind my desk\r\n# Caption: Preparing myself for the most important test in my life\r\n# CodeNumber: 533\r\n", "L=[0]*1001\r\nfor k in range(1,1001):\r\n L[k]=k**2\r\nn=int(input())\r\nL1=sorted(list(map(int,input().split())))\r\nfor k in range(1,n+1):\r\n if(not L1[-k] in L):\r\n print(L1[-k])\r\n break\r\n", "num = int(input(\"\"))\r\n\r\nlist = [int(i) for i in input().split()]\r\n\r\nlist.sort()\r\n\r\nfor i in list:\r\n if i < 0:\r\n h = i \r\n else:\r\n ans = i**(1/2) - int(i**(1/2))\r\n if ans > 0:\r\n h = i\r\n\r\nprint(h)\r\n \r\n ", "n=int(input())\r\nl=sorted(list(map(int,input().split())),reverse=True)\r\nfor i in range(n):\r\n\tx=int(pow(abs(l[i]),0.5))\r\n\tif x**2!=l[i]:\r\n\t\tprint(l[i])\r\n\t\texit()", "import math\r\nn=int(input())\r\nar=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n\tif(ar[i]>=0 and int(math.sqrt(ar[i]))**2==ar[i]):\r\n\t\tcontinue\r\n\telse:\r\n\t\tb.append(ar[i])\r\nprint(max(b))", "import math\r\ndef isPerfectSquare(x):\r\n #if x >= 0,\r\n if(x >= 0):\r\n sr = int(math.sqrt(x))\r\n # sqrt function returns floating value so we have to convert it into integer\r\n #return boolean T/F\r\n return ((sr*sr) == x)\r\n return False\r\n\r\nn=int(input())\r\nl = [int(x) for x in input().split(\" \")]\r\ntemp=[]\r\nfor i in range(n):\r\n if isPerfectSquare(l[i])==True:\r\n continue\r\n else:\r\n temp.append(l[i])\r\nprint(max(temp))", "from math import*\r\nn=int(input())\r\nx=0\r\na=[]\r\nl=set(map(int,input().split()))\r\na=set(x**2 for x in range(1001))\r\nprint(max(l-a))", "#!/usr/local/bin/python3\r\n\r\nt = input()\r\nres = None\r\n\r\nfor n in map(int, input().split(' ')):\r\n if (n < 0) or (int(abs(n) ** 0.5) ** 2 != n):\r\n res = n if res is None else max(res, n)\r\nprint(res)\r\n", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nfor x in range(n):\r\n\tif l[-x-1]<0:\r\n\t\tprint(l[-x-1])\r\n\t\tbreak\r\n\telif l[-x-1]**0.5!=int(l[-x-1]**0.5):\r\n\t\tprint(l[-x-1])\r\n\t\tbreak", "def isSquareNumber(n):\r\n if n<0:\r\n return False\r\n return int(n**0.5)**2==n\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort(reverse=True)\r\nfor i in a:\r\n if not isSquareNumber(i):\r\n print(i)\r\n break", "_ = int(input())\r\nlst = list(set(map(int, input().split())))\r\nlst.sort(reverse=True)\r\nres = next(x for x in lst if x < 0 or int(x**0.5)**2 != x)\r\nprint(res)", "import math\r\nn=int(input())\r\na = [int(x) for x in input().split()]\r\nx = max([x for x in a if x<0 or int(math.sqrt(x))**2 != x])\r\nprint(x)\r\n", "n=int(input())\r\nl=list(map(int,input().split(' ')))\r\n\r\nv=[]\r\nc=[]\r\n\r\nfor i in range(n):\r\n if l[i]<0:\r\n v.append(l[i])\r\n elif l[i]**0.5>int(l[i]**0.5):\r\n c.append(l[i])\r\n\r\nif len(c)>0:\r\n print(max(c)) \r\nelse:\r\n print(max(v))\r\n", "squares = {i ** 2 for i in range(1001)}\r\n\r\ninput()\r\nprint(max(filter(lambda v: v not in squares, map(int, input().split()))))\r\n\r\n", "# a number x is said to be a perfect square if there exists an integer y such that x = y2.\ndef isPerfectSquare(n):\n odd = 1\n while n > 0:\n n = n - odd\n odd = odd + 2\n return n == 0\ndef fn():\n n = int(input())\n arr = list(map(int, input().strip().split(\" \")))\n squares = []\n for i in arr:\n if isPerfectSquare(i) is True:\n squares.append(i)\n for i in squares:\n arr.remove(i)\n print(max(arr))\nfn()\n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\n\r\nans = -1 * 10**7\r\n\r\nfor i in mas:\r\n if i < 0 or i**0.5 != float(int(i**0.5)):\r\n ans = max(ans, i)\r\n\r\nprint(ans)", "import math\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nb.reverse()\r\nc=[]\r\nfor x in b:\r\n if x>=0 and math.sqrt(x)%1!=0:\r\n print(x)\r\n exit()\r\n elif x<0:\r\n c.append(x)\r\nprint(max(c))", "from math import sqrt\r\nfrom sys import stdin\r\nstdin.readline\r\nfrom xmlrpc.client import MININT\r\ndef pf(s):\r\n if s < 0:\r\n return False\r\n ans = int(sqrt(s))\r\n return (ans * ans == s)\r\ninput()\r\na = list(map(int,input().split()))\r\nm = MININT\r\nfor i in a:\r\n if not pf(i) and i > m:\r\n m = i\r\nprint(m)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\nl = pow(10, 3) + 5\r\nfor i in range(l):\r\n s.add(i * i)\r\nans = min(a)\r\nfor i in a:\r\n if not i in s:\r\n ans = max(ans, i)\r\nprint(ans)", "def sqrt(n):\r\n if n == 0:\r\n return True\r\n else:\r\n for i in range(n + 1):\r\n i2 = i * i\r\n if i2 == n:\r\n return True\r\n elif i2 > n: \r\n break\r\n return False \r\n\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nl=sorted(l)\r\nl=l[::-1]\r\nfor i in l:\r\n if not sqrt(i):\r\n print(i)\r\n break", "_ = int(input())\r\n\r\nlst1 = set(map(int, input().split()))\r\nlst2 = set([i * i for i in range(10001)])\r\n\r\nans = max(lst1 - lst2)\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l,reverse=True)\r\nfor i in range(n):\r\n\tt=int(pow(abs(l[i]),0.5))\r\n\tif t*t!=l[i]:\r\n\t\tprint(l[i])\r\n\t\tbreak\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort(reverse=True)\r\nfor i in a:\r\n number = i**(1/2)\r\n index = str(number).index(\".\")\r\n if len((str(number))[index: ]) > 2:\r\n print(i)\r\n exit()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 17 02:00:20 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\nimport math\r\nn=int(input(''))\r\narr=list(map(int,input().split()))\r\narr.sort(reverse=True)\r\nfor i in arr:\r\n if i<0 or math.sqrt(i)!=int(math.sqrt(i)):\r\n print(i)\r\n break\r\n ", "from math import sqrt\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nmaxx = -100000000000000\r\n\r\nfor i in range(n):\r\n if a[i] < 0:\r\n maxx = max(maxx,a[i])\r\n else:\r\n if sqrt(a[i]) != int(sqrt(a[i])) and a[i] > maxx:\r\n maxx = a[i]\r\n \r\nprint(maxx)", "n = int(input())\n\narr = [int(x) for x in input().split()]\n\nsquares = set()\nfor i in range(0, 1000+1):\n squares.add(i*i)\n\nans = -float('inf')\n\nfor i in range(n):\n if arr[i] not in squares:\n ans = max(ans, arr[i])\n\nprint(ans)\n", "from math import sqrt\n\n\nn = int(input())\nx = sorted(list(map(int, input().split())))\nres = 0\nfor item in x:\n if item < 0:\n res = item\n else:\n if sqrt(item) != int(sqrt(item)):\n res = item\nprint(res)\n", "m=[]\r\nfor i in range(2000):\r\n m+=[i*i]\r\nsize=int(input())\r\nnums=list(map(int,input().split(' ')))\r\nnums.sort(reverse=True)\r\nfor j in nums:\r\n if j not in m:\r\n ans=j\r\n break\r\nprint(ans)", "import math\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\nmax1 = -999999\r\nfor i in a:\r\n\tif i<0:\r\n\t\tmax1=i\r\n\telif int(math.sqrt(i))!=math.sqrt(i):\r\n\t\tmax1 = i\r\nprint(max1)\r\n", "input();print(max(i for i in [*map(int,input().split())] if i<0 or not (abs(i)**.5).is_integer()))", "# A. Perfect Squares\r\nimport math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nans=-1000000\r\nfor i in range(n):\r\n if a[i]<0 and a[i]>ans:\r\n ans=a[i]\r\n if a[i]>=0:\r\n if int(math.sqrt(a[i]))!=math.sqrt(a[i]) and a[i]>ans:\r\n ans=a[i]\r\n\r\nprint(ans) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = set([int(i) for i in input().split()])\r\ncheck = {i**2 for i in range(1001)}\r\nprint(max(a - check))\r\n", "R = lambda : map(int,input().split())\r\nR()\r\nprint(max(set(R())-set(x*x for x in range(1001))))", "from math import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nfor i in l:\r\n if i > 0 and sqrt(i)!=int(sqrt(i)):\r\n print(i)\r\n exit()\r\nfor i in l:\r\n if i < 0:\r\n print(i)\r\n exit()", "n=int(input())\r\narr=[int(x) for x in input().split(\" \")]\r\narr.sort(reverse=True)\r\ni=0\r\nfor i in range(n):\r\n if arr[i]<0:\r\n break\r\n x = arr[i]**(1 / 2.0)\r\n y= x - int(x)\r\n if y > 0:\r\n break\r\nprint(arr[i])", "def __is_square(a):\r\n if (a < 0):\r\n return False\r\n r = int((a)**(1/2))\r\n return (r*r == a or (r + 1)*(r + 1) == a or (r-1)*(r-1) == a)\r\n\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\nanswer = -1e7\r\nfor i in lst:\r\n if not __is_square(i):\r\n answer = max(answer,i)\r\nprint(answer)# 1689020056.8093696", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nhelp = []\r\nans = -10 ** 7\r\nfor i in range(0, 1001):\r\n help.append(i * i)\r\nfor i in range(0, len(a)):\r\n if a[i] not in help:\r\n if ans < a[i]:\r\n ans = a[i]\r\nprint(ans)\r\n", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ndef notsquare(x):\r\n if x>=0:\r\n m=math.sqrt(x)\r\n if m==int(m):\r\n return False\r\n return True\r\n return True\r\nprint(max(filter(notsquare,l)))", "arr_r=[i**2 for i in range(1001)]\nn=int(input())\narr=input().split()\narr=[int(i) for i in arr]\nk=[]\nfor i in range(n):\n if arr[i] not in arr_r:\n k.append(arr[i])\nprint(max(k))\n \t \t\t \t\t\t \t\t \t \t \t\t \t \t\t", "import math\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_num = -1e9\r\nfor num in a:\r\n if num < 0:\r\n max_num = max(max_num, num)\r\n else:\r\n root = int(math.sqrt(num))\r\n if root * root != num:\r\n max_num = max(max_num, num)\r\n\r\nprint(max_num)", "from math import sqrt, ceil, floor\nn = int(input())\na = [int(x) for x in input().split()]\nls = set()\neps = 1E-9\nfor x in a:\n if x < 0:\n ls.add(x)\n else:\n q = sqrt(x)\n if q - floor(q) < eps or ceil(q) - q < eps:\n pass\n else:\n ls.add(x)\nprint(max(ls))", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nb=[]\r\nfor i in a:\r\n\tx = abs(i)**(1/2)\r\n\tif x!=int(x) or i<0:\r\n\t\tb.append(i)\r\nprint(max(b))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nans=0\r\na.sort(reverse=True)\r\nfor i in a:\r\n if(i>=0):\r\n if(i**0.5!=int(i**0.5)):\r\n print(i)\r\n break\r\n else:\r\n print(i)\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# LUOGU_RID: 101738053\nn, *a = map(int, open(0).read().split())\r\nprint(max(x for x in a if x < 0 or int(x**.5)**2 != x))", "from math import sqrt\r\nn=int(input())\r\na=[int(e) for e in input().split()]\r\nprint(max([e for e in a if e<0 or int(sqrt(e)+0.01)**2!=e]))", "import math\r\nn=int(input())\r\nL=list(map(int,input().split()))\r\nmaxi=-math.inf\r\nfor i in range(0,n):\r\n\tif(L[i]<0):\r\n\t\tmaxi=max(maxi,L[i])\r\n\telse:\r\n\t\tx=(L[i])**0.5\r\n\t\tif(int(x)!=x):\r\n\t\t\tmaxi=max(maxi,L[i])\r\nprint(maxi)", "n = int(input())\nA = list(map(int, input().split()))\nkk = float('-inf')\nfor t in A:\n if t > kk and (t < 0 or t**0.5 % 1 != 0):\n kk = t\nprint(kk)", "n=int(input())\r\ns=set(map(int,input().split()))\r\nl=set([i*i for i in range(1001)])\r\nprint(max(s.difference(l)))", "import sys\r\nimport math\r\ndef quadrat(x):\r\n if x < 0:\r\n return False\r\n if math.floor(x ** 0.5) == math.ceil(x ** 0.5):\r\n return True\r\n return False\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\na = a[::-1]\r\nfor i in range(n):\r\n if not quadrat(a[i]):\r\n print(a[i])\r\n sys.exit()", "import math\r\na=int(input())\r\nb=[int(i) for i in input().split()]\r\nc=-372180947839274092147832470328743289577538964753469257846821390821934724890\r\n\r\nfor i in range(a):\r\n if b[i]<0:\r\n c=max(c,b[i])\r\n else:\r\n if (math.sqrt(b[i]))%1!=0:\r\n c=max(c,b[i]) \r\nprint(c)\r\n \r\n \r\n \r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nvals=[]\r\nfor i in m:\r\n a=i**0.5\r\n a=str(a)\r\n b=a.split('.')\r\n if '0'!=b[1]:\r\n vals.append(i)\r\nprint(max(vals))\r\n ", "from math import sqrt as S\r\ndef ps(n):\r\n return int(S(n))!=S(n)\r\nn=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\nfor i in l:\r\n if i<0:\r\n ans=i \r\n elif ps(i):\r\n ans=i\r\nprint(ans)", "import math \r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nfor i in range(n):\r\n try:\r\n if (a[i]>m and (math.sqrt(a[i])%1!=0)):\r\n m=a[i]\r\n except:\r\n if(a[i]>m):\r\n m=a[i]\r\nprint(m)", "from math import sqrt\nn = int(input())\nnums = [int(num) for num in input().split()]\nout = float('-inf')\nfor num in nums:\n if num<0:\n out = max(out,num)\n elif int(sqrt(num)) != sqrt(num):\n out = max(out,num)\nprint(out)", "import math\r\ndef check(x):\r\n\r\n r1 = math.sqrt(x)\r\n if r1 - math.ceil(r1) == 0 :\r\n return True\r\n return False\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\narr = list(reversed(sorted(arr)))\r\nres = []\r\nl = []\r\nfor i in arr :\r\n if i < 0 :\r\n l.append(i)\r\n if i > 0 and check(i) == False:\r\n res.append(i)\r\n break\r\n#print(*res)\r\n\r\nif len(res) == 0 :\r\n print(max(l))\r\nelse:\r\n print(*res)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmax=min(a)\r\nfor i in a:\r\n if i>=0:\r\n if i**(1/2)!=int(i**(1/2)):\r\n if i>max:\r\n max=i\r\n else:\r\n if i>max:\r\n max=i\r\nprint(max)\r\n ", "import math as m\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\n\r\n\r\nvar=-1000000\r\nfor i in arr:\r\n if(i<0):\r\n var=max(i,var)\r\n \r\n elif((m.sqrt(i)*10)%10!=0):\r\n var=max(var,i)\r\nprint(var)\r\n", "from math import sqrt\r\nn = int(input())\r\nmax = -10**6-1\r\nfor a in map(int,input().split()):\r\n if a<0 or sqrt(a)%1!=0:\r\n if a>max:\r\n max=a\r\n \r\nprint(max)", "a = int(input())\r\nn = list(map(int,input().split()))\r\nn.sort()\r\nfor i in range(len(n)-1,-1,-1):\r\n if((int(abs(n[i]**(1/2))))**2!=n[i]):\r\n print(n[i])\r\n break\r\n", "n = int(input())\r\ns = set(map(int, input().split()))\r\nprint(max(s - set([i * i for i in range(1001)])))\r\n", "input()\r\nprint(max(set(map(int,input().split()))-set(x*x for x in range(1001))))" ]

[ "s = input()\r\n\r\na, b, c = (s.count(x) for x in \"01?\")\r\n\r\n# print(\"{} {} {}\".format(a, b, c))\r\n\r\nif(a + c > b):\r\n print(\"00\")\r\nif(a + c + 2 > b >= a - c):\r\n if(s[-1] != '?'):\r\n if(s[-1] == '0'):\r\n print('10')\r\n else:\r\n print('01')\r\n else:\r\n if(a + c > b):\r\n print(\"01\")\r\n if(b + c > a + 1):\r\n print(\"10\")\r\n\r\nif(b + c > a + 1):\r\n print(\"11\")\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport math\r\n\r\ns=str(input())\r\nn=len(s)\r\nzero,one,qun=0,0,0\r\nfor x in s:\r\n zero+=x=='0'\r\n one+=x=='1'\r\n qun+=x=='?'\r\n\r\nA=['00','01','10','11']\r\npos=[0]*4\r\npos[0]=zero+qun>n//2\r\npos[3]=zero<n//2\r\n\r\nif zero<=n//2 and zero+qun>=n//2:\r\n asdf=qun-n//2+zero\r\n pos[1]=s[n-1]=='1' or (s[n-1]=='?' and asdf)\r\n asdf=zero<n//2\r\n pos[2]=s[n-1]=='0' or (s[n-1]=='?' and asdf)\r\n\r\nfor i in range(4):\r\n if pos[i]:\r\n print(A[i])" ]

[ "n=int(input())\r\nT=input()\r\nd={0:-1}\r\ns=0\r\nmix=0\r\n \r\nfor i in range(n):\r\n\ts+=1-(T[i]=='0')*2\r\n\tif s not in d:\r\n\t\td[s]=i\r\n\telse:\r\n\t\tif(i-d[s])> mix:\r\n\t\t\tmix=i-d[s]\r\nprint(mix)", "from itertools import accumulate\r\n\r\nn = int(input())\r\ns = input().strip()\r\n\r\na = [0] + list(accumulate(2 * int(d) - 1 for d in list(s)))\r\nm = {}\r\n\r\nfor i in range(len(a)):\r\n if a[i] not in m:\r\n m[a[i]] = i\r\n\r\n a[i] = i - m[a[i]]\r\n\r\nprint(max(a))\r\n", "n=int(input())\r\ns=input()\r\na=[2*int(i)-1 for i in s]\r\nd={}\r\nd[0]=-1\r\nh=0\r\nans=0\r\nfor t in range (n):\r\n h+=a[t]\r\n if h in d:\r\n ans=max(ans,t-d[h])\r\n else:\r\n d[h]=t\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\nbalance_indices = {0: -1} \r\nbalance = 0\r\nmax_length = 0\r\nfor i in range(n):\r\n if s[i] == '0':\r\n balance -= 1\r\n else:\r\n balance += 1\r\n if balance in balance_indices:\r\n max_length = max(max_length, i - balance_indices[balance])\r\n else:\r\n balance_indices[balance] = i\r\nprint(max_length)# 1691082864.9898152", "n = int(input())\ns = [-1 if i == '0' else int(i) for i in input()]\n\n# prefix sum\npref_sum = [0]*(n+1)\nfor i in range(1, n+1):\n pref_sum[i] = pref_sum[i-1] + s[i-1]\n\npref_dict = {}\nfor i, val in enumerate(pref_sum):\n if val in pref_dict:\n pref_dict[val].append(i)\n else:\n pref_dict[val] = [i]\n\nmax_distance = 0\nfor val in pref_dict:\n # исключаем случаи, когда одинаковых значений нет\n if len(pref_dict[val]) > 1:\n # это можно вычислить быстрее,\n # находя мин и макс в одном цикле\n max_idx = max(pref_dict[val])\n min_idx = min(pref_dict[val])\n current_distance = max_idx - min_idx\n if current_distance > max_distance:\n max_distance = current_distance\n\nprint(max_distance)\n \t\t\t\t \t \t\t\t\t \t \t\t\t \t \t", "n = int(input())\ns = input()\n\ncurr_sum = 0\npr = []\n\nfor el in s:\n pr.append(curr_sum)\n if el == '0':\n curr_sum -= 1\n elif el == '1':\n curr_sum += 1\npr.append(curr_sum)\n\nd = {}\nmax_ = 0\n\nfor i in range(len(pr)):\n if (pr[i] in d) and (i - d[pr[i]] > max_):\n max_ = i - d[pr[i]]\n \n if pr[i] not in d:\n d[pr[i]] = i\n \nprint(max_)\n \t\t \t\t \t\t\t \t\t\t \t \t \t\t\t\t\t\t \t", "n = int(input())\r\ns = input()\r\nfrom collections import defaultdict\r\n\r\nhash = {0:-1}\r\nb = 0\r\na = 0\r\nfor j,i in enumerate(s):\r\n b+=2*int(i)-1\r\n if b in hash:\r\n\r\n a = max(a,j-hash[b])\r\n\r\n else:\r\n hash[b] = j\r\nprint(a)\r\n\r\n\r\n\r\n", "def D(n, arr):\n prefix = [0] * (n + 1)\n for i in range(1, n + 1):\n if arr[i - 1] == '1':\n prefix[i] = prefix[i - 1] + 1\n else:\n prefix[i] = prefix[i - 1] - 1\n max_count = 0\n d_arr_left = {}\n d_arr_right = {}\n for i in range(n + 1):\n if prefix[i] not in d_arr_left:\n d_arr_left[prefix[i]] = i\n d_arr_right[prefix[i]] = i\n for i in d_arr_left:\n if d_arr_right[i] - d_arr_left[i] > max_count:\n max_count = d_arr_right[i] - d_arr_left[i]\n return max_count\n\nn = int(input())\narr = input()\nprint(D(n, arr))\n\t \t\t \t \t \t \t\t\t \t \t \t\t\t", "n = int(input())\r\ns = input()\r\nd = {0:-1}\r\nres,e=0,0\r\nfor i,x in enumerate(s):\r\n if x=='0':\r\n e-=1\r\n else:\r\n e+=1\r\n if d.get(e)==None:\r\n d[e]=i\r\n else:\r\n res=max(res,i-d[e])\r\nprint(res)", "# Сложность по времени O(n)\r\n# Сложность по памяти O(n)\r\n\r\nn = int(input())\r\ns = input()\r\ncur_sum = 0\r\ncnt = 0\r\na = dict()\r\nmax_len = 0\r\nfor i, c in enumerate(s):\r\n if c == \"1\":\r\n cur_sum -= 1\r\n else:\r\n cur_sum += 1\r\n\r\n if cur_sum == 0:\r\n max_len = max(max_len, i + 1)\r\n\r\n if cur_sum in a:\r\n max_len = max(max_len, i - a[cur_sum])\r\n else:\r\n a[cur_sum] = i\r\n\r\nprint(max_len)", "n = int(input()); res = []\r\ns = input(); heights = {0 : [-1]}; current = 0\r\n\r\nfor i in range(n):\r\n if s[i] == '1':\r\n current += 1\r\n if current not in heights:\r\n heights[current] = [i]\r\n else: heights[current].append(i)\r\n if s[i] == '0':\r\n current -= 1\r\n if current not in heights:\r\n heights[current] = [i]\r\n else: heights[current].append(i)\r\n\r\nfor i in heights.values():\r\n res.append(max(i) - min(i))\r\nprint(max(res))\r\n", "n = int(input())\ns = input()\n\npref = [0] * (n+1)\nmax_length = 0\nbalance_count = {0: -1}\n\nfor i in range(n):\n pref[i+1] = pref[i] + (1 if s[i] == '1' else -1)\n\n if pref[i+1] in balance_count:\n length = i - balance_count[pref[i+1]]\n max_length = max(max_length, length)\n else:\n balance_count[pref[i+1]] = i\n\nprint(max_length)\n\n \t \t \t\t\t\t\t\t\t \t\t \t\t\t \t \t", "n=int(input())\r\na=list(input())\r\nd={0:[-1]}\r\nr=0\r\nfor i in range(n):\r\n if a[i]=='1':\r\n r+=1\r\n else:\r\n r-=1\r\n d[r]=d.get(r,[])+[i]\r\nans=0\r\nfor i in d.keys():\r\n ans=max(d[i][-1]-d[i][0],ans)\r\nprint(ans)", "\r\nn=int(input()) \r\ns=input() \r\nd={} \r\ncur=0 \r\nd[cur]=-1 \r\nans=0 \r\nfor i in range(n):\r\n if s[i]=='1':\r\n cur+=1 \r\n else:\r\n cur-=1 \r\n if not cur in d:\r\n d[cur]=i \r\n ans=max(ans,i-d[cur])\r\nprint(ans)", "n = int(input())\r\nlis = input()\r\nd = [0,]\r\nmax_i = 0\r\nfor i in range(n):\r\n if lis[i] == \"1\":\r\n d.append(d[-1] + 1)\r\n else:\r\n d.append(d[-1] - 1)\r\nm = {}\r\nfor i in range(len(d)):\r\n if d[i] in m:\r\n m[d[i]].append(i)\r\n else:\r\n m[d[i]] = [i]\r\nfor i in m:\r\n if len(m[i]) > 1:\r\n max_i = max(m[i][-1] - m[i][0], max_i)\r\nprint(max_i)\r\n", "from sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\r\n\r\nn = it()\r\nl = list(input())\r\nd = dd(lambda:0)\r\na =[0]\r\nans =0\r\nfor i in range(n):\r\n\tif l[i] == '0':\r\n\t\ta.append(a[i]-1)\r\n\telse:\r\n\t\ta.append(a[i]+1)\r\n# print(a)\r\nfor i in range(n+1):\r\n\tif a[i] not in d:\r\n\t\td[a[i]] = i\r\n\telse:\r\n\t\tans = max(ans,i-d[a[i]])\r\n# print(dict(d))\r\nprint(ans)\r\n\r\n", "# import io, os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nimport sys\r\n# sys.stdin=open('input.txt','r')\r\n# sys.stdout=open('output.txt','w')\r\ninput=sys.stdin.readline\r\n# sys.setrecursionlimit(300010)\r\nMOD = 1000000007\r\nMOD2 = 998244353\r\nii = lambda: int(input().strip('\\n'))\r\nsi = lambda: input().strip('\\n')\r\ndgl = lambda: list(map(int,input().strip('\\n')))\r\nf = lambda: map(int, input().strip('\\n').split())\r\nil = lambda: list(map(int, input().strip('\\n').split()))\r\nls = lambda: list(input().strip('\\n'))\r\nlsi = lambda: [int(i) for i in ls()]\r\nlet = 'abcdefghijklmnopqrstuvwxyz'\r\nfor _ in range(1):\r\n d=dict()\r\n n=ii()\r\n l=lsi()\r\n tot=0\r\n d[0]=-1\r\n ans=0\r\n for i in range(n):\r\n tot+=1 if l[i]==1 else -1\r\n if not tot in d:d[tot]=i\r\n else:ans=max(ans,i-d[tot])\r\n print(ans)", "\nlens = int(input())\nstrs = input()\n\ncha_dict = {0:[0,0]}\ncha = 0\nmax = 0\nfor i in range(lens):\n if strs[i] == '1':\n cha = cha + 1\n else:\n cha = cha - 1\n if cha in cha_dict:\n cha_dict[cha][1] = i + 1\n else:\n cha_dict[cha] = [i + 1, i + 1]\n if cha_dict[cha][1] - cha_dict[cha][0] > max:\n max = cha_dict[cha][1] - cha_dict[cha][0]\nprint(max)\n\t\t\t\t \t\t\t \t \t \t \t \t\t\t \t\t \t", "n = int(input())\n\nl = list(input())\n\npref = [0]\nfor i in range(len(l)):\n if l[i] == '1':\n pref.append(pref[i] - 1)\n else:\n pref.append(pref[i] + 1)\n\nhashmap = {}\nres = 0\nfor i in range(len(pref)):\n if pref[i] in hashmap:\n res = max(res, i - hashmap[pref[i]])\n else:\n hashmap[pref[i]] = i\n\nprint(res)\n\t\t \t \t \t\t \t \t\t\t\t\t\t \t", "n = int(input())\ns = input()\n\na = list(s)\nfor i in range(n):\n if a[i] == '0':\n a[i] = -1\n else:\n a[i] = 1\n\nsum = [0 for i in range(n + 1)]\nfor i in range(1, n + 1):\n sum[i] = sum[i - 1] + a[i - 1]\n\nans = 0\nindex = {}\n\nfor i in range(n):\n if sum[i + 1] in index:\n ans = max(ans, i + 1 - index[sum[i + 1]])\n if sum[i] not in index:\n index[sum[i]] = i\n\nprint(ans)", "import re\n\ndef check(substr):\n\n if len(re.findall(r'0',substr)) == len(re.findall(r'1',substr)):\n return True\n else:\n return False \n \n \n\nn = int(input())\ns = input()\n\nlongest = 0\nbalance = 0\ndic_bal = {0:-1}\nfor i in range(0,n):\n if s[i]=='1':\n balance -= 1\n else:\n balance += 1\n #print(balance) \n \n if not balance in dic_bal:\n dic_bal[balance] = i\n else:\n longest = max(i-dic_bal[balance],longest)\n #print(longest)\n \n \n\nprint(longest)\n\n\n \n \n \n", "n = int(input())\ns = str(input())\ncum0 = [0]*(n+1)\ncum1 = [0]*(n+1)\nfor i in range(n):\n cum0[i+1] = cum0[i]\n cum1[i+1] = cum1[i]\n if s[i] == '0':\n cum0[i+1] += 1\n else:\n cum1[i+1] += 1\n\nd = {}\nans = 0\nfor i in range(n+1):\n t = cum0[i]-cum1[i]\n if t in d:\n ans = max(ans, i-d[t])\n else:\n d[t] = i\nprint(ans)\n", "def func(lista):\n\ttam = 0\n\tdifer = 0\n\tfirst = {0:-1}\n\n\tfor index, num in enumerate(lista):\n\t\tif num == '0':\n\t\t\tdifer += 1\n\t\telse:\n\t\t\tdifer += -1\n\n\t\tif difer in first:\n\t\t\ttam = max(tam, index-first[difer])\n\n\t\telse:\n\t\t\tfirst[difer] = index\n\n\treturn tam\n\nn = input()\nprint(func(input()))", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()\r\nm = defaultdict(lambda : -1)\r\nm[0] = 0\r\nans = 0\r\nsum = 0\r\n\r\nfor i in range(1,n+1):\r\n sum += (1 if s[i-1]=='1' else -1)\r\n \r\n if(sum == 0):\r\n ans = i\r\n elif(m[sum]!=-1):\r\n ans = max(ans,i-m[sum])\r\n else:\r\n m[sum] = i\r\n \r\nprint(ans)", "n = int(input())\r\ns = input()\r\n\r\na = [2 * int(x) - 1 for x in s]\r\nd = {0 : -1}\r\nh, ans = 0, 0\r\n\r\nfor i in range(n) :\r\n h += a[i]\r\n if h in d :\r\n ans = max(ans, i - d[h])\r\n else :\r\n d[h] = i\r\n \r\nprint(ans)", "n = int(input())\r\ns = input()\r\na = [2 * int(i) -1 for i in s]\r\nans = 0\r\ndic = {}\r\ndic[0] = -1\r\nh = 0\r\nfor t in range(n):\r\n h += a[t]\r\n if h in dic:\r\n ans = max(ans, t - dic[h])\r\n else:\r\n dic[h] = t\r\nprint(ans)\r\n \r\n", "def max_balanced_substring(s, n):\n max_length = 0\n count = 0\n balance_counts = {0: -1} # Используем -1 для обозначения начального индекса\n\n for i, char in enumerate(s):\n count = count + 1 if char == \"0\" else count - 1\n \n if count in balance_counts:\n max_length = max(max_length, i - balance_counts[count])\n else:\n balance_counts[count] = i\n\n return max_length\n\nn = int(input())\ns = input()\nprint( max_balanced_substring(s, n) )\n \t \t\t\t\t\t \t\t\t \t\t \t \t\t \t", "n=int(input())\r\ns=input()\r\nvisited=[[] for i in range(2*n+1)]\r\ncount=0\r\nvisited[count+n].append(0)\r\nfor i in range(n):\r\n if(s[i]=='1'):\r\n count+=1\r\n else:\r\n count-=1\r\n visited[count+n].append(i+1)\r\nans=0\r\nfor i in range(2*n+1):\r\n if(len(visited[i])>1):\r\n visited[i].sort()\r\n ans=max(ans,visited[i][-1]-visited[i][0])\r\nprint(ans) ", "class list_sum:\n def __init__(self, llist):\n self.llist = llist\n self.pr = [0] * (1 + len(llist))\n for i in range(1, len(llist) + 1):\n if llist[i - 1] == '1':\n self.pr[i] = self.pr[i - 1] + 1\n else:\n self.pr[i] = self.pr[i - 1] - 1\n\n def sum(self, l, r):\n return self.pr[r] - self.pr[l]\n\n\nn = int(input())\ns = list_sum(input())\n'''\n31\n1010000000011000101011010100111\n'''\ndict_l_r = {}\nfor i in range(len(s.pr)): # вообще не понял как это проще делать, поэтому ушел в отрыв\n if s.pr[i] not in dict_l_r: # делаю словарь где ключ - значение префиксоной суммы, \n dict_l_r[s.pr[i]] = [i, 0] # значение - [первый индекс появления суммы, расстояние до следующей такой же суммы]\n else: # здесь расстоение считается \n dict_l_r[s.pr[i]][1] = i - dict_l_r[s.pr[i]][0] # например [0,1,2,1,2,1] тогда dict_l_r[1] = [1, 5-1]\nprint(max(dict_l_r.values(), key=lambda x: x[1])[1]) # тогда ответ - макс по растоянию между одинаковыми преф суммами \n\n\t \t\t \t \t\t \t \t \t \t", "n = input()\ntotal = 0\ndct = {}\ndct[0] = -1\nresult = 0\nfor index, char in enumerate(input()):\n if char == '1':\n total += 1\n else:\n total -= 1\n if total in dct:\n result = max(result, index - dct[total])\n else:\n dct[total] = index\nprint(result)\n \t \t \t\t \t \t \t \t\t\t\t\t\t\t", "from collections import defaultdict as dt\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfor tc in range(1):\r\n n=int(input())\r\n s=input()\r\n cnt0=0\r\n cnt1=0\r\n d=dict()\r\n map=dt(lambda:-1)\r\n for i in range(n):\r\n if(s[i]=='0'):cnt0+=1\r\n else:cnt1+=1\r\n d[i]=(cnt0,cnt1)\r\n for i in range(n):\r\n if(map[d[i][0]-d[i][1]]==-1):\r\n map[d[i][0]-d[i][1]]=i\r\n ans=0\r\n for i in range(n-1,-1,-1):\r\n if(d[i][0]==d[i][1]):\r\n ans=max(ans,i+1)\r\n else:\r\n ind=map[d[i][0]-d[i][1]]\r\n ans=max(ans,i-ind)\r\n print(ans)\r\n", "n = int(input())\ns = input().strip()\n\nx = [0]\ny = [0]\ntmp = [0]\nmem = {}\nmem[0] = 0\n\nfor i,el in enumerate(s):\n x.append(x[-1])\n y.append(y[-1])\n if el == '0':\n x[-1] += 1\n else:\n y[-1] += 1\n tmp.append(x[-1] - y[-1])\n if tmp[-1] not in mem:\n mem[tmp[-1]] = i + 1\n\nres = 0\nfor i in range(len(s) + 1):\n res = max(res, i - mem[tmp[i]])\n\nprint(res)\n\n", "n = int(input())\n\na = input()\n# a = \"11010111\"\nb = [0] * (len(a) + 1)\n\nc0 = c1 = 0\nfor i in range(1, len(b)):\n c0 += (a[i - 1] == \"0\")\n c1 += (a[i - 1] == \"1\")\n b[i] = c0 - c1\n\nmax_diff = 0\nmin_index = 0\n# max_index = 0\nd = {}\n# history = []\nfor i, item in enumerate(b):\n if item in d:\n min_index = d[item]\n max_diff = max(max_diff, i - min_index)\n # max_index = i\n # history.append((min_index, max_index))\n else:\n d[item] = i\n\nprint(max_diff)\n\n \t \t\t \t \t \t \t\t\t\t \t\t\t \t\t \t", "n = int(input())\r\ns = input()\r\n \r\n\r\nd = dict()\r\nd[0] = -1\r\n \r\nc,ans = 0,0\r\n\r\nfor i in range(n):\r\n\tif s[i] == '0':\r\n\t\tc -= 1\r\n\telse:\r\n\t\tc += 1\r\n \r\n\tif c not in d:\r\n\t d[c] = i\r\n\telse:\r\n\t ans = max(i - d[c], ans)\r\nprint(ans)", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n# Author: [email protected]\n# Date : 2020/10/23\n# Time : 2:14 下午\nif __name__=='__main__':\n n=int(input().strip())\n s=list(input().strip())\n for i,c in enumerate(s):\n if c=='0':\n s[i]=-1\n else:\n s[i]=1\n sum=[0 for i in range(n)]\n for i,c in enumerate(s):\n if i==0:\n sum[i]=c\n sum[i]=sum[i-1]+c\n dic={0:-1}\n maxl=0\n for i in range(n):\n if sum[i] in dic:\n maxl=max(maxl,i-dic[sum[i]])\n else:\n dic[sum[i]]=i\n\n print(maxl)\n\n\n\n\t \t\t\t\t\t\t \t \t \t \t \t\t \t", "_ = input()\nstring = input()\nlasts = {\n0: -1\n}\ncurr_count = 0\nbest_best = 0\nfor idx, x in enumerate(string):\n if x == '1':\n curr_count += 1\n else:\n curr_count -= 1\n if curr_count in lasts:\n curr_best = idx - lasts[curr_count]\n if curr_best > best_best:\n best_best = curr_best\n else:\n lasts[curr_count] = idx\nprint(best_best)\n\n\"\"\"\nFirst try - Try to use something like binary search to find the length of the substring.\nSadly, this does not work,\n as knowing that the maximum possible substring length is 8 and having a valid substring of length 4 does not guarantee that we have a substring of length 6\n e.g 00111100\n\"\"\"\n\"\"\"\n_ = input()\nstring = input()\nstr_len = len(string)\none_count, zero_count = 0, 0\ncounts_by_idx = {}\nfor idx, x in enumerate(string):\n if x == '1':\n one_count += 1\n else:\n zero_count += 1\n counts_by_idx[idx] = {'0': zero_count, '1': one_count}\n\nmaximum_substring_length = min(zero_count, one_count) * 2\nprint(maximum_substring_length)\ncurr_best = 0\n\nlower_bound = 0\ncurrent_search = maximum_substring_length // 2\nupper_bound = maximum_substring_length\n\n\ndef srch(lower_bound, current_search, upper_bound):\n global curr_best\n for start_idx in range(str_len-current_search):\n end_idx = start_idx + current_search\n zero_count = counts_by_idx[end_idx]['0'] - counts_by_idx[start_idx]['0']\n one_count = counts_by_idx[end_idx]['1'] - counts_by_idx[start_idx]['1']\n if one_count == zero_count:\n # Try to go up\n curr_best = zero_count * 2\n new_search = current_search + ((upper_bound - current_search) // 2)\n return current_search, new_search, upper_bound\n\n new_search = lower_bound + ((current_search - lower_bound) // 2)\n return lower_bound, new_search, current_search\n\n\nwhile True:\n lower_bound, current_search, upper_bound = srch(lower_bound, current_search, upper_bound)\n\"\"\"", "n = int(input())\r\ns = input()\r\n\r\nbal = 0\r\narr = [0]*(n + 1)\r\nlastseen = {0: 0}\r\n\r\narr[0] = 0\r\nfor i in range(1, n + 1):\r\n if s[i - 1] == '1':\r\n bal += 1\r\n else:\r\n bal -= 1\r\n\r\n lastseen[bal] = i\r\n arr[i] = bal\r\n\r\nans = 0\r\nfor i in range(n + 1):\r\n if lastseen[arr[i]] != i:\r\n ans = max(ans, lastseen[arr[i]] - i)\r\n\r\nprint(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nS = input()\r\n\r\ndp = defaultdict(lambda : float('inf'))\r\ndp[0] = -1\r\ncnt = 0\r\nans = 0\r\nfor i,c in enumerate(S):\r\n if c=='1':\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n ans = max(ans, i-dp[cnt])\r\n dp[cnt] = min(dp[cnt], i)\r\n \r\nprint(ans)\r\n\r\n\r\n", "import sys\r\nimport itertools\r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n ar = [1 if ch == '1' else -1 for ch in s]\r\n \r\n res = 0\r\n first = {}\r\n first[0] = -1\r\n for i, v in enumerate(list(itertools.accumulate(ar))):\r\n if v in first:\r\n res = max(res, i - first[v])\r\n else:\r\n first[v] = i\r\n \r\n print(res)\r\n \r\n\t\r\nif __name__ == '__main__':\r\n main() \r\n \r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/12 22:12\r\n\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = input()\r\n# n = 100000\r\n# s = ''\r\n# for i in range(n):\r\n# x = random.randint(1, 10)\r\n# if x >= 5:\r\n# s += '1'\r\n# else:\r\n# s += '0'\r\n#\r\n# t0 = time.time()\r\n\r\n# n = 8\r\n# s = '11010111'\r\n\r\nones = [0] * (n+1)\r\nfor i in range(1, n+1):\r\n ones[i] = ones[i-1]\r\n ones[i] += s[i-1] == '1'\r\nones = [2*x for x in ones]\r\nones = [(x-i, i) for i,x in enumerate(ones)]\r\n\r\nds = collections.defaultdict(list)\r\nfor d, i in ones:\r\n ds[d].append(i)\r\n\r\n# print(ones)\r\n# print(ds)\r\nans = 0\r\nfor k, v in ds.items():\r\n ans = max(ans, max(v)-min(v))\r\n\r\nprint(ans)\r\n# print(time.time() - t0)\r\n\r\n\r\n", "# cf 873 B (1500)\nn = input()\ns = input()\n\n#s = \"\".join([\"0\"] * 100000)\nmax_ = 0\nA = {}\nmid = 0\n\nfor i in range(len(s)):\n if s[i] == '0':\n mid -= 1\n A[mid + 1] = min(A.get(mid + 1, float(\"inf\")), i)\n else: # \"1\"\n mid += 1\n A[mid - 1] = min(A.get(mid - 1, float(\"inf\")), i)\n\n if mid in A:\n max_ = max(max_, i - A[mid] + 1)\n #print(s[i], \"----->\", A)\n\nprint(max_)\n", "Ln = int(input())\r\nStr = input()\r\n\r\ndiff = [0] * Ln\r\ndiff[0] = -1\r\nif (Str[0] == \"1\"):\r\n\tdiff[0] = 1\r\n\r\nminIndex = {0:0}\r\nminIndex[diff[0]] = 1\r\n\r\nfor i in range(1, Ln):\r\n\tif (Str[i] == \"1\"):\r\n\t\tdiff[i] = diff[i-1]+1\r\n\telse:\r\n\t\tdiff[i] = diff[i-1]-1\r\n\tif (not diff[i] in minIndex):\r\n\t\tminIndex[diff[i]] = i+1\r\n\r\nmaxLen = 0\r\nfor i in range(Ln):\r\n\tmaxLen = max(i - minIndex[diff[i]] + 1, maxLen)\r\n\r\nprint (maxLen)", "n=int(input())\ns=list(map(int,input()))\n#print(s)\nprsumm=[0]*(n)\nvalues_min=dict({0:-1})\nmlenght=0\nfor i in range(n):\n if s[i]==0:\n prsumm[i]=prsumm[i-1]-1\n else:\n prsumm[i] = prsumm[i-1] + 1\n if prsumm[i] not in values_min:\n values_min[prsumm[i]]=i\n#print(prsumm,values_min)\nfor i in range(n):\n #print(n-i-1,values_min[prsumm[n-1-i]],n-1-i-values_min[prsumm[n-1-i]])\n if prsumm[n-1-i] in values_min:\n if mlenght<n-i-1-values_min[prsumm[n-1-i]]:\n mlenght=n-i-1-values_min[prsumm[n-1-i]]\nprint(mlenght)\n\t\t \t \t\t \t \t \t \t\t\t \t\t\t \t", "l=int(input())\r\nd=input()\r\nsums=[]\r\ndp=[-1]*(l+1)\r\ndp[0]=0\r\nsums.append(0)\r\nmlen=0\r\nfor i in range(1,l+1):\r\n sums.append(sums[-1]+2*int(d[i-1])-1)\r\n if dp[sums[-1]]==-1:\r\n dp[sums[-1]]=i\r\n else:\r\n mlen=max(mlen,i-dp[sums[-1]])\r\nprint(mlen)", "n=int(input())\r\nd={0:-1}\r\ns=0\r\nmx=0\r\nch=input()\r\nfor i in range (len(ch)) :\r\n if ch[i]==\"1\" :\r\n s+=1\r\n else :\r\n s+=-1\r\n\r\n if s not in d :\r\n d[s]=i\r\n else :\r\n mx=max(i-d[s],mx)\r\nprint(mx)\r\n", "from itertools import accumulate\r\nn,s = int(input()),[*accumulate(map(lambda x: 2*int(x)-1,input()))]\r\nl = {0:-1}; c = 0\r\nfor x,y in enumerate(s):\r\n l[y]=e=l.get(y,x)\r\n c = max(c,x-e)\r\nprint(c)", "n = int(input())\narr = list(map(int, list(input())))\n\ncnt0 = 0\ncnt1 = 0\ngg = {0: -1}\nans = 0\nfor i in range(n):\n if arr[i] == 0:\n cnt0 += 1\n else:\n cnt1 += 1\n ans = max(ans, i - gg.get(cnt0 - cnt1, i))\n gg[cnt0 - cnt1] = min(i, gg.get(cnt0 - cnt1, i + 1))\nprint(ans)", "n = int(input())\r\n \r\ns = input()\r\n\r\nx = [1 if s_i == '1' else 0 for s_i in s]\r\n\r\nprefix = [0]*(n+1)\r\nfor i in range(1, n+1):\r\n prefix[i] = prefix[i-1] + x[i-1]\r\n \r\nbalance = dict()\r\n\r\nbalance = dict()\r\n\r\nfor i in range(len(prefix)):\r\n balance[i-prefix[i] - prefix[i]] = (i, i)\r\nfor i in range(len(prefix)):\r\n a, b = balance[i-prefix[i] - prefix[i]][0], balance[i-prefix[i] - prefix[i]][1]\r\n balance[i-prefix[i] - prefix[i]] = min(a, i), max(b, i)\r\n\r\nmax_len = 0\r\nfor x in balance:\r\n max_len = max(max_len, balance[x][1] - balance[x][0])\r\n\r\nprint(max_len)", "def f(s):\n\n\n if (len(s) == 1): \n return 0\n\n i = len(s)//2\n\n n = get_max(s, i)\n\n return max(n, max(f(s[0:i]), f(s[i:len(s)])))\n\n\n\ndef get_max(s, i):\n\n j = i-1\n n0 = 0\n n1 = 0\n\n length = 0\n\n lmap = {}\n\n while(j >= 0):\n if s[j] == '0': n0 += 1\n if s[j] == '1': n1 += 1\n length += 1\n lmap[n1-n0] = length\n j -= 1\n\n j = i\n n0 = 0\n n1 = 0\n \n length = 0\n\n m = 0\n\n while(j < len(s)):\n if s[j] == '0': n0 += 1\n if s[j] == '1': n1 += 1\n length += 1\n if((n0-n1) in lmap):\n m = max(m, length+lmap[n0-n1])\n j += 1\n\n return m\n\nn = input()\ns = input()\n\nprint(f(s))\n", "count = map(int, input())\nchar_string = input()\n\n\nsum_dig=0\nans=0\nhashmap = {}\nhashmap[0]=-1\n\n\nfor i, c in enumerate(char_string): \n if c=='1':\n sum_dig+=1\n else:\n sum_dig-=1\n\n if sum_dig in hashmap:\n ans=max(ans, i-hashmap[sum_dig])\n else:\n hashmap[sum_dig] = i\n\nprint(ans)\n \t\t \t\t\t \t\t\t \t \t\t\t \t\t\t \t \t \t\t", "n=int(input())\r\ns=input()\r\nmp={0:-1}\r\nans=bal=0\r\nfor i in range(n):\r\n if s[i]=='0':bal-=1\r\n else: bal+=1\r\n if bal not in mp:mp[bal]=i\r\n else: ans=max(ans,i-mp[bal])\r\nprint(ans)\r\n \r\n\r\n", "n=int(input())\r\nl=list(input())\r\nl=list(-1 if val=='0' else int(val) for idx,val in enumerate(l))\r\nd={0:-1}\r\nmax_len=h= 0\r\nfor _ in range(n) :\r\n h += l[_]\r\n if h in d :\r\n max_len = max(max_len, _ - d[h])\r\n else :\r\n d[h] = _\r\nprint(max_len)", "import sys\n\n\n\n\ndef get_pr_sum(mass: list, n: int):\n pr_sum = [0]*(n+1)\n for i in range(1, n+1):\n if mass[i-1] == 1:\n pr_sum[i] = pr_sum[i-1] + 1\n else:\n pr_sum[i] = pr_sum[i-1] -1\n return pr_sum\n\n\ndef set_dict(pr_sum: list):\n indx_dct = {}\n for i, val in enumerate(pr_sum):\n if val not in indx_dct.keys():\n indx_dct[val] = [i]\n else:\n indx_dct[val].append(i)\n return indx_dct\n\ndef check_max_str(pr_dct: dict):\n max_len = 0\n for i in pr_dct.keys():\n if len(pr_dct[i]) == 1:\n continue\n lengs = pr_dct[i][-1] - pr_dct[i][0]\n if lengs > max_len:\n max_len = lengs\n return max_len\n\nif __name__ == '__main__':\n n = int(sys.stdin.readline().strip())\n mass = [int(i) for i in sys.stdin.readline().strip()]\n pr_sum = get_pr_sum(mass = mass, n = n)\n pr_dct = set_dict(pr_sum = pr_sum)\n print(check_max_str(pr_dct=pr_dct)) \n\t \t\t\t\t\t\t \t\t\t \t\t \t \t\t \t\t\t\t\t", "R = lambda: map(int, input().split())\r\nn = int(input())\r\nacc = [0]\r\nfor c in input():\r\n acc.append(acc[-1] + (-1 if c == '0' else 1))\r\nres = 0\r\ndp = {}\r\nfor i, cnt in enumerate(acc[1:]):\r\n if not cnt:\r\n res = max(res, i + 1)\r\n elif cnt not in dp:\r\n dp[cnt] = i\r\n else:\r\n res = max(res, i - dp[cnt])\r\nprint(res)", "from sys import stdin, stdout\r\n\r\ndef readline():\r\n return stdin.readline().rstrip()\r\n\r\ndef writeline(s):\r\n stdout.write(str(s)+\"\\n\")\r\n\r\n\r\nfrom math import inf\r\nfrom functools import lru_cache\r\n\r\nn = int(readline())\r\ns = readline()\r\n\r\nzeros, ones = 0, 0\r\nmaxi = 0\r\nd = {0: -1}\r\n\r\nfor i in range(n):\r\n if s[i] == '0':\r\n zeros += 1\r\n else:\r\n ones += 1\r\n diff = ones - zeros\r\n if diff not in d:\r\n d[diff] = i\r\n else:\r\n maxi = max(maxi, i - d[diff])\r\n\r\nwriteline(maxi)", "n=int(input())\r\nl=input()\r\nd={0:-1}\r\ns=0\r\nm=0\r\nfor i in range (len(l)):\r\n if l[i]=='1':\r\n s+=1 \r\n else:\r\n s+=-1\r\n \r\n if s not in d:\r\n d[s]=i\r\n else :\r\n m=max(i- d[s],m)\r\n\r\nprint(m)\r\n\r\n \r\n", "n = int(input())\r\ns = [2 * int(x) -1 for x in input()]\r\nd = {0: [-1]}\r\ncheck = 0\r\nfor i in range(n):\r\n check += s[i]\r\n if check not in d:\r\n d[check] = [i]\r\n elif len(d[check]) == 1:\r\n d[check].append(i)\r\n else:\r\n d[check][1] = i\r\nmaxi = 0\r\nans = 0\r\nfor i in range(-len(d), len(d) + 1):\r\n if i in d:\r\n if len(d[i]) == 2:\r\n ans = d[i][1] - d[i][0]\r\n if ans > maxi:\r\n maxi = ans\r\nprint(maxi)", "n = int(input())\r\nv = input()\r\ncount1 = 0\r\ncount0 = 0\r\nlin = {}\r\nlin[0] = -1\r\ncounter = 0\r\nfor i in range(n):\r\n if v[i] == '0':\r\n count0 += 1\r\n else:\r\n count1 += 1\r\n if count1 - count0 in lin:\r\n counter = max(i - lin[count1 - count0], counter)\r\n else: \r\n lin[count1 - count0] = i\r\nprint(counter)", "n = int(input())\r\ns = input()\r\n\r\na = [-1] * (n + 1)\r\na[0] = 0\r\ncount = [0, 0]\r\nres = 0\r\nfor idx, c in enumerate(s):\r\n count[int(c)] += 1\r\n diff = count[0] - count[1]\r\n if a[diff] == -1:\r\n a[diff] = idx + 1\r\n elif idx + 1 - a[diff] > res:\r\n res = idx + 1 - a[diff]\r\n\r\nprint(res)", "n=int(input())\r\ns=input()\r\nl0=[0]*n\r\nl1=[0]*n\r\nls=[0]*n\r\na=s[0]\r\nif(a==\"0\"):\r\n l0[0]=1\r\n ls[0]=-1\r\nelse:\r\n l1[0]=1\r\n ls[0]=1\r\nfor i in range(1,n):\r\n if(s[i]==\"1\"):\r\n ls[i]=ls[i-1]+1\r\n else:\r\n \r\n ls[i]=ls[i-1]-1\r\n\r\n\r\ndp={}\r\ndp[0]=-1\r\n#print(ls)\r\nans=0\r\nfor i in range(n):\r\n e=ls[i]\r\n if(e not in dp):\r\n dp[e]=i\r\n else:\r\n ans=max(ans,i-dp[e])\r\n\r\n#print(dp)\r\n \r\nprint(ans) \r\n \r\n \r\n", "n = int(input())\n\nstring = input()\ndiff = [0]*len(string)\n\ndiff[0] = 1\nif string[0] == \"0\" :\n\tdiff[0] = -1\n\nminIndex = {}\nminIndex[0] = 0\nminIndex[diff[0]] = 1\n\nfor i in range(1, len(string)):\n\tif(string[i]==\"0\"):\n\t\tdiff[i] = diff[i-1] - 1\n\telse:\n\t\tdiff[i] = diff[i-1] + 1\n\tif (not diff[i] in minIndex):\n\t\tminIndex[diff[i]] = i+1\nans = 0\n\nfor i in range(len(string)):\n\tans = max(ans, i-minIndex[diff[i]]+1)\n\nprint(ans)\n", "n = int(input())\r\nlis = list(input())\r\nind=[0]*(n)\r\npp=[0]*(n+1)\r\npos=[[-1,-1] for i in range(n+1)]\r\nneg=[[-1,-1] for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n if lis[i-1]=='0':\r\n pp[i]=pp[i-1]-1\r\n else:\r\n pp[i]=pp[i-1]+1\r\npp=pp\r\n#print(pp)\r\nfor i in range(n+1):\r\n if pp[i]>=0:\r\n pos[pp[i]][0]=max(i,pos[pp[i]][0])\r\n if pos[pp[i]][1]==-1:\r\n pos[pp[i]][1]=i\r\n else:\r\n neg[abs(pp[i])][0]=max(i,neg[abs(pp[i])][0])\r\n if neg[abs(pp[i])][1]==-1:\r\n neg[abs(pp[i])][1]=i\r\n# print(pos) \r\nans=0\r\n#print(pos,neg)\r\nfor i in range(n+1):\r\n if pos[i][1]>=0 and pos[i][0]>=0:\r\n ans=max(ans,pos[i][0]-pos[i][1])\r\n if neg[i][1]>=0 and neg[i][0]>=0:\r\n ans=max(ans,neg[i][0]-neg[i][1])\r\nprint(ans) \r\n\r\n\r\n\r\n\r\n", "n=int(input())\nw=input()\nzc=cd=0\njg={0:-1,}\nfor i in range(0,n):\n if(w[i]=='1'): zc+=1\n else: zc-=1\n if(jg.get(zc,-2)!=-2):\n cd=max(cd,i-jg[zc])\n else: jg[zc]=i\nprint(cd)\n\t \t\t\t \t \t\t\t\t\t\t\t \t \t\t \t \t \t\t", "n=int(input())\r\ns=input()\r\n\r\nbalance=[2*int(i)-1 for i in s]\r\nm=0\r\ndist={}\r\ndist[0]=-1\r\n\r\nsum=0\r\nfor i in range(n):\r\n sum+=balance[i]\r\n if(sum in dist):\r\n m=max(m,i-dist[sum])\r\n else:\r\n dist[sum]=i\r\n\r\nprint(m)", "n = int(input())\r\ns = input()\r\n'''\r\nd = {}\r\ndef xxx(l, r):\r\n if (l, r) in d:\r\n return d[l, r]\r\n if r - l == 0:\r\n d[l, r] = 0\r\n return 0\r\n if r - l == 1:\r\n if s[l] == 1:\r\n d[l, r] = -1\r\n return -1\r\n d[l, r] = 1\r\n return 1\r\n if s[l] != s[r - 1]:\r\n d[l, r] = xxx(l + 1, r - 1)\r\n return xxx(l + 1, r - 1)\r\n if s[l] == '1' and s[r - 1] == '1':\r\n d[l, r] = xxx(l + 1, r - 1) - 2\r\n return xxx(l + 1, r - 1) - 2\r\n d[l, r] = xxx(l + 1, r - 1) + 2\r\n return xxx(l + 1, r - 1) + 2\r\n\r\n\r\nlst = [0]\r\nfor x in range(0, len(s)):\r\n for y in range(x + 1, len(s) + 1):\r\n if xxx(x, y) == 0:\r\n lst.append(y - x)\r\nprint(max(lst))\r\n'''\r\nd = {0: 0}\r\nacc = 0\r\nlst = [0]\r\nfor x in range(len(s)):\r\n if s[x] == '0':\r\n a = -1\r\n else:\r\n a = 1\r\n acc += a \r\n if not acc in d:\r\n d[acc] = x + 1\r\n else:\r\n lst.append(x - d[acc] + 1)\r\nprint(max(lst))\r\n", "def f(a):\r\n\ta=list(a)\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]==\"0\":\r\n\t\t\ta[i]=-1\r\n\t\telse:\r\n\t\t\ta[i]=1\r\n\ta=[None]+a\r\n\tdc={0:0}\r\n\tpref=0\r\n\tans=0\r\n\tfor i in range(1,len(a)):\r\n\r\n\t\tpref+=a[i]\r\n\t\tif dc.get(pref,None)!=None:\r\n\t\t\tans=max(i-dc.get(pref),ans)\r\n\t\tdc[pref]=min(dc.get(pref,float(\"inf\")),i)\r\n\treturn ans\r\n\r\ns=input()\r\ns=input()\r\nprint(f(s))\r\n", "n = int(input())\r\ns = input()\r\nd = {0:-1}\r\nmx = 0\r\nsm = 0\r\nfor i in range(n):\r\n sm +=1 - (s[i] == '0')*2\r\n if sm not in d:\r\n d[sm]=i\r\n else:\r\n if i - d[sm]>mx:\r\n mx=i-d[sm]\r\nprint(mx)", "leng = int(input())\nst = input()\npref_sums = [0] * (leng + 1)\nfor i, el in enumerate(st):\n if el == '1':\n pref_sums[i + 1] = pref_sums[i] - 1\n else:\n pref_sums[i + 1] = pref_sums[i] + 1\n\nlengs = dict()\nans = 0\nfor i, el in enumerate(pref_sums):\n if el in lengs.keys():\n s = lengs[el][0]\n res = i - s\n if (res > ans):\n ans = res\n lengs[el] = [s, res] \n else:\n lengs[el] = [i, 0]\n\nprint(ans)\n\t\t \t\t\t \t\t \t \t \t \t \t", "from bisect import bisect, bisect_left\r\ndef linp():\r\n return list(map(int,input().split(\" \")))\r\ndef slinp():\r\n return sorted(linp())\r\ndef inp():\r\n return int(input())\r\ndef fnp():\r\n return float(input())\r\ndef dinp():\r\n s = linp()\r\n return (s[0]), (s[1])\r\ndef tinp():\r\n s = linp()\r\n return s[0], s[1], s[2]\r\n\r\n\r\ndef main():\r\n n = inp()\r\n s = input()\r\n dc = dict()\r\n z = 0\r\n o = 0\r\n ans = 0\r\n dc[0] = -1\r\n for i in range(n):\r\n if s[i] == '1':\r\n o += 1\r\n else:\r\n z += 1\r\n df = o-z\r\n if df in dc.keys():\r\n ans = max(ans,i-dc[df])\r\n else:\r\n dc[df] = i\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n t = 1#inp()\r\n for i in range(t):\r\n main()", "n=int(input())\r\ns=input()\r\nz,o,d,ans=0,0,{},0\r\nfor i in range(n):\r\n\tif s[i]=='0':\r\n\t\tz+=1\r\n\telse:\r\n\t\to+=1\r\n\tx=z-o\r\n\tif x==0:\r\n\t\tans=max(ans,i+1)\r\n\tif x not in d:\r\n\t\td[x]=i\r\n\telse:\r\n\t\tans=max(ans,i-d[x])\r\nprint(ans)", "n = int(input())\r\ns = input()\r\n\r\ndict = {}\r\ndict[0] = -1\r\n\r\ncount = 0\r\nres = 0\r\nfor i in range(n):\r\n\tif s[i] == '0':\r\n\t\tcount += -1\r\n\telse:\r\n\t\tcount += 1\r\n \r\n\tif count not in dict:\r\n\t dict[count] = i\r\n\telse:\r\n\t res = max(i - dict[count], res)\r\nprint(res)", "input()\ng = {0: -1}\nz = s = 0\n\nfor i, c in enumerate(input()):\n\ts += 2 * int(c) - 1\n\tg[s] = p = g.get(s, i)\n\tz = max(z, i - p)\n\nprint(z)", "len_arr = int(input())\narr = []\nfor item in input():\n if item == '0':\n arr.append(-1)\n else:\n arr.append(1)\n\npref = [0, ]\nfor i in range(1, len(arr) + 1):\n pref.append(pref[i - 1] + arr[i - 1])\n\nhash = {}\nmaxlen = 0\nfor index, item in enumerate(pref):\n if item in hash.keys():\n substring_len = index - hash[item]\n if maxlen < substring_len:\n maxlen = substring_len \n else:\n hash[item] = index \nprint(maxlen)\n\n \t \t \t \t\t \t \t \t\t\t\t \t\t\t\t \t\t\t", "n=int(input())\r\na=list(map(int,list(input())))\r\nfor i in range(0,len(a)):\r\n if a[i]==0:\r\n a[i]=-1\r\nhashmap={0:-1}\r\ns=0\r\nmaximum=0\r\nfor i in range(0,n):\r\n s+=a[i]\r\n if s in hashmap:\r\n maximum=max(maximum,(i-hashmap[s]))\r\n else:\r\n hashmap[s]=i\r\nprint(maximum)", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodeforces: servermonk\r\nCodechef: ayush572000\r\n\r\n\"\"\"\r\n\r\ndef solution():\r\n n=int(input())\r\n s=input()\r\n cnt1=[0]*(n+1)\r\n cnt0=[0]*(n+1)\r\n balance=[0]\r\n for i in range(n):\r\n if s[i]=='1':\r\n cnt1[i+1]+=cnt1[i]+1\r\n cnt0[i+1]=cnt0[i]\r\n else:\r\n cnt1[i+1]=cnt1[i]\r\n cnt0[i+1]+=cnt0[i]+1\r\n x=cnt1[i+1]-cnt0[i+1]\r\n balance.append(x)\r\n d={}\r\n ans=0\r\n for i in range(n+1):\r\n if d.get(balance[i],-1)==-1:\r\n d[balance[i]]=i\r\n else:\r\n ans=max(ans,i-d[balance[i]])\r\n print(ans)\r\nsolution()", "n,s = int(input()),input()\r\nm = 0\r\nd = 0\r\nl = {0:-1}\r\nfor x,y in enumerate(s):\r\n if(y == \"1\"): d += 1\r\n else: d -= 1\r\n if d in l:\r\n m = max(m,x-l[d])\r\n else:\r\n l[d] = x\r\nprint(m)", "n = int(input())\ns = input()\n\ndp = {0:-1}\nans = 0\np = 0\n\nfor kd, i in enumerate(s):\n if i == '1': p += 1\n else: p -= 1\n dp.setdefault(p, kd)\n ans = max(ans, kd-dp[p])\n # print('ans = ', ans, kd-dp[p], p)\nprint(ans)\n", "# [https://codeforces.com/contest/873/submission/47370595 <- https://codeforces.com/blog/entry/55171 <- https://codeforces.com/problemset/problem/873/B <- https://algoprog.ru/material/pc873pB]\r\n\r\nn = int(input())\r\ns = input()\r\n\r\na = [-1 if c == '0' else 1 for c in s]\r\n\r\nsumm = 0\r\nmaxlen = 0\r\n\r\nm = {}\r\nfor i in range(n):\r\n summ += a[i]\r\n if summ == 0:\r\n maxlen = i + 1\r\n if summ in m:\r\n maxlen = max(maxlen, i - m[summ])\r\n else:\r\n m[summ] = i\r\n\r\nprint(maxlen)", "n = int(input())\r\ns = input()\r\nsm = ans = 0\r\nhmap = {0:-1}\r\nfor i in range(n):\r\n if s[i]=='0': sm -= 1\r\n else: sm += 1\r\n if sm not in hmap: hmap[sm] = i\r\n else: ans = max(ans,i-hmap[sm])\r\nprint(ans)", "n = int(input())\nx = input()\ns = ''.join(['0', x, '1'])\ns1 = ''.join(['1', x, '0'])\n# s = input()\n\ndef get_max(s):\n\tnet_count = 0\n\tcurrent_max = 0\n\tmp = {}\n\tfor (i, item) in enumerate(s):\n\t\tif item == '0':\n\t\t\tnet_count -= 1\n\t\telif item == '1':\n\t\t\tnet_count += 1\n\t\tif (mp.get(net_count, None) == None):\n\t\t\tmp[net_count] = i\n\t\telse:\n\t\t\tdist = i - mp[net_count]\n\t\t\tif dist > current_max:\n\t\t\t\tcurrent_max = dist\n\treturn current_max\n\nprint(min(get_max(s), get_max(s1)))", "# http://codeforces.com/contest/873/problem/B\n#\n# DP solution.\nimport itertools as it\n\nn = int(input())\nss = input()\n\nsss = [int(x) for x in ss]\ncnt_1 = it.accumulate(sss)\ns_n = [x for x in range(1, len(sss)+1)]\nbalance = [0] + [2*x-y for x, y in zip(cnt_1, s_n)]\n\nres = 0\ntab = {}\nfor i, v in enumerate(balance):\n if v in tab:\n res = max(res, i - tab[v])\n else:\n tab[v] = i\n\n# print(balance)\nprint(res)\n", "n=int(input())\r\ns=input()\r\np1=[0]*(n+1)\r\np2 = [0]*(n+1)\r\nc1=0\r\nc0=0\r\n\r\nfor i in range(n):\r\n if s[i]=='0':\r\n c0+=1 \r\n else:\r\n c1+=1\r\n p1[i+1]=c1 \r\n p2[i+1]=c0 \r\n \r\ncount=[0]*1000000\r\nval=[0]*10**6\r\nans=[0]\r\n#10**5 is assumed to be 0\r\nfor i in range(1,n+1):\r\n if p1[i]==p2[i]:\r\n ans.append(p1[i]+p2[i])\r\n else:\r\n \r\n \r\n if count[10**5+p1[i]-p2[i]]!=0:\r\n ans.append(p1[i]+p2[i]-(val[10**5+p1[i]-p2[i]]))\r\n \r\n \r\n else:\r\n count[10**5+p1[i]-p2[i]]+=1\r\n if count[10**5+p1[i]-p2[i]]==1:\r\n\r\n val[10**5+p1[i]-p2[i]]=p1[i]+p2[i]\r\n \r\nprint(max(ans))\r\n\r\n \r\n \r\n \r\n \r\n ", "n = int(input())\nstring = input()\n\npref_balanced = [0] * (n + 1)\n\nfor i, _ in enumerate(string):\n pref_balanced[i + 1] = pref_balanced[i] + (1 if (string[i] == '1') else -1)\n\n\nindexes = {}\nmax_length = 0\nfor i, _ in enumerate(pref_balanced):\n if pref_balanced[i] in indexes:\n length = i - (indexes[pref_balanced[i]] + 1) + 1\n max_length = max(length, max_length)\n else:\n indexes[pref_balanced[i]] = i\n\nprint(max_length)\n\n \t \t \t\t \t\t\t\t \t\t \t \t \t\t \t\t", "n = int(input())\r\ns = input()\r\na = [2*int(c)-1 for c in s]\r\n\r\nd = {0: -1}\r\nh, ans = 0, 0\r\nfor t in range(n):\r\n h += a[t]\r\n if h in d:\r\n ans = max(ans, t-d[h])\r\n else:\r\n d[h] = t\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nd = {0:-1}\r\n\r\na, c = 0, 0\r\nfor i, j in enumerate(s):\r\n a += 1 if j == '1' else -1\r\n if a in d:\r\n c = max(c, i-d[a])\r\n else:\r\n d[a] = i\r\n\r\nprint(c)", "from itertools import accumulate\r\nn=int(input())\r\nd={0:-1}\r\na=0\r\nfor i,b in enumerate(accumulate(map(lambda c:2*int(c)-1,input()))):\r\n x=d.get(b,i)\r\n d[b]=x\r\n a=max(a,i-x)\r\nprint(a)\r\n", "# cook your dish here\r\nn=int(input())\r\nstr =input()\r\nm = dict() \r\nm[0] = -1\r\ncount_0 = 0\r\ncount_1 = 0\r\nres = 0\r\nfor i in range(len(str)): \r\n if str[i] == '0': \r\n count_0 += 1\r\n else: \r\n count_1 += 1\r\n if (count_1 - count_0) in m:\r\n #print(m.get(count_1 - count_0))\r\n res=max(res,i-m[count_1-count_0])\r\n\r\n else: \r\n m[count_1 - count_0] = i \r\nprint(res) ", "n = int(input())\narr = list(input())\nmaxx = 0\nzeros = 0\nones = 0\nfor i in range(n):\n if arr[i]=='0':\n zeros+=1\n else:\n ones+=1\nif zeros==0 or ones==0:\n print('0')\nelse:\n map = {}\n map[0]=-1\n count = 0\n for i in range(n):\n if arr[i]=='1':\n count+=1\n else:\n count-=1\n if count in map:\n maxx=max(maxx,i-map[count])\n else:\n map[count]=i\n print (maxx)\n", "n = int(input())\r\nheights = {0:(0, 0)}\r\nch = 0\r\ncount = 0\r\nfor i in input():\r\n count += 1\r\n if i == '1':\r\n ch += 1\r\n else:\r\n ch -= 1\r\n if ch not in heights:\r\n heights[ch] = (count, count)\r\n heights[ch] = (heights[ch][0], count)\r\nml = 0\r\nfor i in heights:\r\n delta = heights[i][1] - heights[i][0]\r\n ml = max(ml, delta)\r\nprint(ml)", "# cook your dish here\r\n# from math import * \r\n#for _ in range(int(input().strip())):\r\nn=int(input())\r\ns=input()\r\nd={}\r\ncnt=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n cnt+=1\r\n if s[i]=='0':\r\n cnt-=1\r\n d[cnt]=i\r\nans=cnt=0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n cnt+=1 \r\n try:\r\n ans=max(d[cnt-1]-i+1,ans)\r\n except:\r\n pass\r\n if s[i]=='0':\r\n cnt-=1 \r\n try: \r\n ans=max(d[cnt+1]-i+1,ans)\r\n except:\r\n pass\r\nprint(ans)", "\n\ndef find_longest_balanced_substring(n, s):\n max_length = 0\n balance = 0\n dp = dict()\n dp[0] = -1\n\n for i in range(n):\n if s[i] == '0':\n balance -= 1\n else:\n balance += 1\n\n if balance not in dp:\n dp[balance] = i\n else:\n max_length = max(max_length, i - dp[balance])\n\n return max_length\n\n\nn = int(input())\ns = list(input())\n\nresult = find_longest_balanced_substring(n, s)\nprint(result)\n\n\t \t \t\t\t \t \t \t \t\t \t\t \t\t\t\t", "def main():\r\n n = int(input())\r\n s = input()\r\n stats = {0: -1}\r\n prv = 0\r\n res = 0\r\n for i in range(len(s)):\r\n c = s[i]\r\n nxt = prv+1 if c == \"1\" else prv-1\r\n if nxt in stats:\r\n res = max(res, i - stats[nxt])\r\n else:\r\n stats[nxt] = i\r\n prv = nxt\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\ns=input()\r\na=b=0\r\nd={0:-1}\r\nfor i in range(n):\r\n\tb+=2*int(s[i])-1\r\n\td[b]=x=d.get(b,i)\r\n\ta=max(a,i-x)\r\nprint(a)", "\r\nfrom collections import defaultdict\r\n\r\n\r\nn = int(input())\r\n\r\nstring = input()\r\nlast = defaultdict(lambda: -1)\r\n\r\ntotal = 0\r\nlength = 0\r\nfor i in range(n):\r\n temp = int(string[i])\r\n if temp:\r\n total -= 1\r\n else: \r\n total += 1\r\n if total == 0:\r\n length = max(length, i + 1)\r\n if last[total] != -1:\r\n length = max(length, i - last[total])\r\n else: \r\n last[total] = i\r\n\r\nprint(length)\r\n \r\n\r\n\r\n\r\n ", "n = int(input())\nnums = [int(num) for num in list(input())]\nA = {0:-1}\nmx = 0\ncur_sum = 0\nbalances = []\nfor idx in range(len(nums)):\n cur_sum += nums[idx]\n balance = cur_sum - (idx + 1 - cur_sum)\n balances.append(balance)\n if balance in A:\n mx = max(mx, idx - A[balance])\n else:\n A[balance] = idx\n \nprint(mx) \n\t\t \t \t\t\t\t \t \t \t \t \t\t\t \t\t \t", "n=int(input())\r\ns=input()\r\ndic=dict()\r\ndic[0]=-1\r\nres=0\r\nmx=0\r\nfor i in range(len(s)):\r\n if s[i]==\"0\":\r\n res+=1\r\n else:\r\n res-=1\r\n if res not in dic:\r\n dic[res]=i\r\n else:\r\n mx=max(mx,i-dic[res])\r\nprint(mx)", "n=int(input())\r\ns=input()\r\na=[]\r\nfor i in range(n):\r\n if s[i]=='1':\r\n a.append(1)\r\n else:\r\n a.append(-1)\r\nd={}\r\nd[0]=-1\r\nd[a[0]]=0\r\nk=0\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\n if a[i] not in d:\r\n d[a[i]]=i\r\n else:\r\n k=max(k,i-d[a[i]])\r\nprint(k)", "n=int(input())\r\nL=input()\r\nmaxi=0\r\ns=0\r\nd={0:-1}\r\nfor i in range(len(L)):\r\n if L[i]=='1':\r\n s+=1\r\n else:\r\n s-=1\r\n if s not in d:\r\n d[s]=i\r\n else:\r\n long=i-d[s]\r\n if long>maxi:\r\n maxi=long\r\n \r\nprint(maxi)\r\n", "# https://codeforces.com/contest/873/problem/B\n\nfrom sys import stdin\n\n\nstdin.readline() # ignore\nbinary = [int(v) for v in stdin.readline().rstrip()]\ncnt0, cnt1 = [0] * len(binary), [0] * len(binary)\ncnt0[0] = abs(binary[0] - 1)\ncnt1[0] = binary[0]\nbalanced = [0] * len(binary)\nbalanced[0] = cnt0[0] - cnt1[0]\n\nfor i in range(1, len(binary)):\n cnt0[i] = cnt0[i - 1] + (1 if binary[i] == 0 else 0)\n cnt1[i] = cnt1[i - 1] + binary[i]\n balanced[i] = cnt0[i] - cnt1[i]\n\nbest = 0\nfor i in range(len(balanced)):\n if balanced[i] == 0:\n best = max(best, i + 1)\n\nlast_occurance = dict()\nfor i in range(len(balanced) - 1, -1, -1):\n if balanced[i] not in last_occurance:\n last_occurance[balanced[i]] = i\n\nfor i in range(len(balanced)):\n if balanced[i] in last_occurance:\n best = max(best, last_occurance[balanced[i]] - i)\n\nprint(best)\n", "n = int(input())\r\ndic = {0 : -1}\r\nbalance = 0\r\nlength = 0\r\nfor i, x in enumerate(input()):\r\n\tif x == '1':\r\n\t\tbalance += 1\r\n\telse:\r\n\t\tbalance -= 1\r\n\r\n\tif balance in dic:\r\n\t\tlength = max(length, i - dic[balance])\r\n\telse:\r\n\t\tdic[balance] = i\r\nprint(length)", "n = int(input())\nd = {0: -1}\na = b = 0\nfor i, c in enumerate(input()):\n if int(c) == 0:\n b -= 1\n else:\n b += 1\n d[b] = x = d.get(b, i)\n a = max(a, i - x)\nprint(a)\n\n# n =int(input())\n# l = [0]\n# li = [-1]\n# a=b=0\n# for i,c in enumerate(input()):\n# if int(c) == 0:\n# b -= 1\n# else:\n# b += 1\n# if b in l:\n# x = li[l.index(b)]\n# else:\n# l.append(b)\n# li.append(i)\n# x = i\n# a=max(a,i-x)\n# print(a)\n", "n=int(input())\r\ns=input()\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n if s[i]=='1':\r\n c+=1\r\n else:\r\n c-=1\r\n l.append(c)\r\nfrom collections import defaultdict\r\nd=defaultdict(list)\r\nans=0\r\nfor i in range(n):\r\n d[l[i]].append(i)\r\nif len(d[0])!=0:\r\n ans=d[0][-1]+1\r\nfor i in range(1,n):\r\n a=l[i-1]\r\n if len(d[a])!=0:\r\n ans=max(ans,d[a][-1]-i+1)\r\nprint(ans)\r\n \r\n", "import sys\n\ndef findMaxLength(s):\n nums = [int(i) for i in s]\n dic = {}\n dic[0] = -1\n\n flag = 0\n maxL = 0\n\n for i in range(len(nums)):\n\n flag += 1 if nums[i] == 1 else -1\n\n if flag not in dic:\n dic[flag] = i\n\n maxL = i - dic[flag] if i - dic[flag] > maxL else maxL\n return maxL\n\ncount = 0\nfor line in sys.stdin:\n if count == 0:\n num = int(line.strip())\n count += 1\n continue\n\n s = line.strip()\n\nprint(findMaxLength(s))\n\t \t\t\t \t \t\t \t\t\t\t \t\t\t \t\t\t\t", "# importing libraries\r\nimport sys\r\nfrom collections import defaultdict\r\n \r\n# setting input and output streams\r\ninput_stream = sys.stdin\r\noutput_stream = sys.stdout\r\n \r\n# defining function for fast I/O\r\ndef I(): return int(input_stream.readline().strip())\r\ndef LI(): return list(map(int, input_stream.readline().split()))\r\ndef LS(): return input_stream.readline().strip()\r\ndef MI(): return map(int, input_stream.readline().split())\r\ndef II(rows_number: int):\r\n return [I() for _ in range(rows_number)]\r\n \r\ndef LI2(rows_number: int):\r\n return [LI() for _ in range(rows_number)]\r\n \r\n# main function to solve problem\r\ndef running_length():\r\n n = I()\r\n s = LS()\r\n \r\n # initializing variables\r\n x = 0\r\n y = 0\r\n mapa = defaultdict(int)\r\n mapa[0] = -1\r\n ans = 0\r\n \r\n for i in range(n):\r\n if s[i] == '0':\r\n x += 1\r\n else:\r\n y += 1\r\n if y - x in mapa:\r\n ans = max(ans, i - mapa[y - x])\r\n else:\r\n mapa[y - x] = i\r\n \r\n output_stream.write(f\"{ans}\\n\")\r\n \r\n# running main function\r\nif __name__ == '__main__':\r\n running_length()\r\n\r\n", "def balanced(word):\n length = 0 # maior tamanho no momento\n difference = 0 # diferença entre 0's e 1's, se for positivo tem mais 1's que 0's, negativo mais 0's que 1's\n first_index = {0: -1} # Guarda o primeiro indice de onde há uma determinada diferença entre 1's e 0's, sendo a diferença a chave e o indice o valor\n\n for index, num in enumerate(word):\n if num == '1':\n difference += 1\n elif num == '0':\n difference -= 1\n\n if difference in first_index:\n length = max(length, index - first_index[difference]) \n else:\n first_index[difference] = index\n \n return length\n\nn = input()\nprint(balanced(input()))\n", "input()\nd={0:-1}\na=b=0\nfor i,c in enumerate(input()):\n b+=2*int(c)-1\n d[b]=x=d.get(b,i)\n a=max(a,i-x)\nprint(a)", "input()\ninstring = input()\nbalance = [0]\n\nnum0 = 0\nnum1 = 0\n\nfor c in instring:\n if c == \"0\":\n num0 += 1 \n else:\n num1 += 1\n\n balance.append(num0 - num1)\n\nd = {}\n\nfor i in range(len(balance)):\n if balance[i] not in d:\n d[balance[i]] = i\n\nans = 0\n# minIndex = []\nfor i in range(len(balance)):\n # minIndex.append(i - d[balance[i]])\n ans = max(ans, i - d[balance[i]])\n\n# print(balance)\n# print(minIndex)\nprint(ans)", "import math\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n s = str(input())\r\n\r\n res = 0\r\n\r\n f = {0: -1}\r\n c = 0\r\n\r\n for i in range(n):\r\n if s[i] == \"0\":\r\n c -= 1\r\n else:\r\n c += 1\r\n if c in f:\r\n res = max(res, i - f[c])\r\n else:\r\n f[c] = i\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n= int(input())\r\nstring = input()\r\ndic = {}\r\ndic[0] = -1\r\nans = 0\r\nx= 0\r\ny = 0\r\nfor i in range(n):\r\n \r\n if string[i] == \"1\":\r\n x+=1\r\n else:\r\n y+=1\r\n if y-x in dic:\r\n ans= max(ans,i-dic[y-x])\r\n else:\r\n dic[y-x] = i\r\nprint(ans)\r\n \r\n ", "n=int(input())\r\nl=input()\r\nd={0:-1}\r\ns=0\r\ndist=0\r\nfor i in range(len(l)) :\r\n if l[i]==\"1\" :\r\n s+=1\r\n else:\r\n s+=-1\r\n if s not in d :\r\n d[s]=i\r\n else :\r\n dist=max(i-d[s],dist)\r\nprint(dist)\r\n", "input()\r\ns = input()\r\ndef solution(s):\r\n l = list(s)\r\n m = {}\r\n r = 0\r\n s = 0\r\n\r\n for i in range(len(l)):\r\n l[i] = 1 if l[i] == '1' else -1\r\n\r\n for i in range(len(l)):\r\n s += l[i]\r\n if s in m:\r\n r = max(r, i - m[s])\r\n else:\r\n m[s] = i\r\n if s == 0:\r\n r = max(r, i + 1)\r\n return r\r\nprint(solution(s))", "n = int(input())\nl = [-2] * (n * 2 + 1)\nl[n], r = -1, 0\nfor i, c in enumerate(input()):\n n += ord(c) * 2 - 97\n if l[n] == -2:\n l[n] = i\n else:\n i -= l[n]\n if r < i:\n r = i\nprint(r)", "'''input\r\n8\r\n00001111\r\n'''\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nbal = n\r\nfirstseen = [-1]*((n * 2) + 1)\r\nfirstseen[n] = 0\r\n\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if s[i - 1] == '1':\r\n bal += 1\r\n else:\r\n bal -= 1\r\n\r\n if firstseen[bal] != -1:\r\n ans = max(ans, i - firstseen[bal])\r\n else:\r\n firstseen[bal] = i\r\n\r\nprint(ans)\r\n", "n=int(input())\r\ns=input()\r\nd={}\r\ncnt=0\r\nfor i in range(n):\r\n if s[i]=='1':\r\n cnt+=1\r\n if s[i]=='0':\r\n cnt-=1\r\n d[cnt]=i\r\nans=cnt=0\r\nfor i in range(n):\r\n if s[i]=='1':\r\n cnt+=1 \r\n try:\r\n ans=max(d[cnt-1]-i+1,ans)\r\n except:\r\n pass\r\n if s[i]=='0':\r\n cnt-=1 \r\n try: \r\n ans=max(d[cnt+1]-i+1,ans)\r\n except:\r\n pass\r\nprint(ans)", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input()))\r\nodd, even = dict(), {0: 0}\r\nans = 0\r\nacc_odd, acc_even = 0, 0\r\n\r\nfor i, x in enumerate(a, start=1):\r\n acc_odd += x\r\n acc_even += x\r\n\r\n if i & 1:\r\n acc_odd -= 1\r\n if acc_odd in odd:\r\n ans = max(ans, i - odd[acc_odd])\r\n else:\r\n odd[acc_odd] = i\r\n else:\r\n acc_even -= 1\r\n if acc_even in even:\r\n ans = max(ans, i - even[acc_even])\r\n else:\r\n even[acc_even] = i\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\n\r\nzero = 0\r\none = 0\r\ndct = {0: -1}\r\nans = 0\r\n\r\nfor i in range(n):\r\n if s[i] == '0':\r\n zero += 1\r\n else:\r\n one += 1\r\n \r\n diff = zero - one\r\n #print(i, diff)\r\n if diff not in dct:\r\n dct[diff] = i\r\n else:\r\n ans = max(ans, i - dct[diff])\r\n #print(dct[diff], 'a')\r\n\r\nprint(ans)\r\n\r\n", "input()\r\nd={0:-1}\r\na=b=0\r\nfor i,c in enumerate(input()):\r\n b+=2*int(c)-1\r\n d[b]=x=d.get(b,i)\r\n a=max(a,i-x)\r\nprint(a)", "digitToValMap = {\n \"1\": 1,\n \"0\": -1,\n}\n\n\ndef process(nums: str) -> int:\n prevRate = {0: -1}\n rate = 0\n maxLen = 0\n for i, num in enumerate(nums):\n rate += digitToValMap[num]\n if rate in prevRate:\n currLen = i - prevRate[rate]\n maxLen = max(maxLen, currLen)\n if rate not in prevRate:\n prevRate[rate] = i\n return maxLen\n\n\nif __name__ == \"__main__\":\n _ = input()\n nums = input().strip()\n print(process(nums))\n\n \t\t\t \t \t\t\t \t \t \t\t \t\t\t\t", "n=int(input())\r\ns=input()\r\nsig=[0 for i in range(n+1)]\r\nsig[1]=int(s[0])\r\nfor k in range(1, n):\r\n sig[k+1]=sig[k]+int(s[k])\r\nans=[0 for i in range(n+1)]\r\nfor k in range(n+1):\r\n ans[k]=sig[k]-(k)/2\r\nu={}\r\nfor pro in range(n+1):\r\n if(ans[pro] in u):\r\n u[ans[pro]].append(pro)\r\n else:\r\n u[ans[pro]]=[pro]\r\nmaxx=0\r\nfor k in u:\r\n if(len(u[k])>1):\r\n maxx=max(u[k][-1]-u[k][0], maxx)\r\nprint(maxx)\r\n", "n = input()\r\ns = input()\r\n\r\nres = 0\r\nans = 0\r\ndp = {}\r\ndp[0] = -1\r\n\r\nfor i in range(int(n)):\r\n\tif s[i] == '1':\r\n\t\tres += 1\r\n\telse:\r\n\t\tres -= 1\r\n\r\n\tif res not in dp:\r\n\t\tdp[res] = i\r\n\telse:\r\n\t\tans = max(ans, i - dp[res])\r\n\r\nprint(ans)", "n = int(input())\r\ns = input()\r\n\r\nprefix = [0] * (n + 1)\r\n\r\nprev = 0\r\nfor i, lttr in enumerate(s):\r\n if lttr == '1':\r\n prev += 1\r\n prefix[i+1] = prev\r\n else:\r\n prev -= 1\r\n prefix[i+1] = prev\r\n\r\ndic = {}\r\nans = 0\r\n# print(prefix)\r\nfor i in range(n+1):\r\n if prefix[i] not in dic:\r\n dic[prefix[i]] = i\r\n else:\r\n ans = max(ans, i - dic[prefix[i]])\r\n\r\n\r\nprint(ans)", "n = int(input())\r\nl = list(input())\r\nbz = [n+1]*(n+1)\r\nbo = [n+1]*(n+1)\r\nb = 0\r\nbo[0] = 0\r\nbz[0] = 0\r\nans = 0\r\nfor i in range(n):\r\n if l[i]==\"1\": b+=1\r\n else: b-=1\r\n if b<0:\r\n bz[abs(b)] = min(i+1,bz[abs(b)])\r\n ans = max(i+1-bz[abs(b)],ans)\r\n else:\r\n bo[b] = min(i+1, bo[b])\r\n ans = max(i +1- bo[b],ans)\r\nprint(ans)\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\n\r\nd = dict()\r\n\r\nd[0] = -1\r\ncount0 = 0\r\ncount1 = 0\r\nres = 0\r\n\r\nfor i in range(n):\r\n\r\n if s[i] == \"0\":\r\n count0 += 1\r\n else:\r\n count1 += 1\r\n\r\n if d.get(count1 - count0) is not None:\r\n res = max(res, i - d[count1 - count0])\r\n else:\r\n d[count1 - count0] = i\r\n\r\nprint(res)\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()\r\na = [0]*(n+1)\r\nm = defaultdict(lambda : 0)\r\nmx = sums = 0\r\n\r\nfor i in range(0,n):\r\n a[i+1] = (1 if s[i]=='1' else -1) \r\n \r\nfor i in range(1,n+1):\r\n sums += a[i]\r\n if(sums==0):\r\n mx = i\r\n else:\r\n if(m[sums]!=0):\r\n mx = max(mx,i-m[sums])\r\n else:\r\n m[sums]=i\r\n\r\nprint(mx)\r\n \r\n ", "n=int(input())\r\ns=input()\r\nans=0\r\nd={0:-1}\r\ntemp=0\r\nfor i,ch in enumerate(s):\r\n if ch==\"0\":\r\n temp+=-1\r\n else :\r\n temp+=1\r\n if temp in d:\r\n ans=max(i-d[temp],ans)\r\n else :\r\n d[temp]=i\r\nprint(ans)", "while True:\n try:\n \tdef solve(a, n):\n \t\tid = [-2] *((2*n)+1)\n \t\tid[n] = 0\n \t\ti, sstr, indx = 1, 0, n\n \t\t\n \t\twhile i <= n:\n \t\t\tif a[i] == '1':\n \t\t\t\tindx += 1\n \t\t\telse:indx -= 1\n \t\t\tif id[indx] != -2:\n \t\t\t\tsstr = max(sstr, i - id[indx])\n \t\t\telse:id[indx] = i\n \t\t\ti += 1\n \t\tprint(sstr)\n \t\t\t\t\n \tif __name__ == \"__main__\":\n \t\tn = int(input())\n \t\ts = input()\n \t\ta = [0] + list(s)\n \t\tsolve(a, n)\n \t\t\n except EOFError:\n break\n\t", "n = int(input())\r\nline = input()\r\nfirst = [-2] * (n * 2 + 1)\r\nlast = [0] * (n * 2 + 1)\r\nsm = 0\r\nans = 0\r\nfirst[n] = -1\r\nfor i in range(n):\r\n elem = line[i]\r\n if elem == '0':\r\n sm -= 1\r\n else:\r\n sm += 1\r\n if first[sm + n] == -2:\r\n first[sm + n] = i\r\n else:\r\n last[sm + n] = i\r\n ans = max(ans, last[sm + n] - first[sm + n])\r\nprint(ans)", "n = int(input())\ns = input()\n\nprefix_sums = [0] * (n + 1)\ncount_ones = 0\ncount_zeros = 0\nmax_length = 0\n\nfor i in range(1, n + 1):\n if s[i - 1] == '1':\n count_ones += 1\n else:\n count_zeros += 1\n prefix_sums[i] = count_ones - count_zeros\n#print(prefix_sums)\nprefix_indices = {}\nfor i in range(n + 1):\n if prefix_sums[i] not in prefix_indices:\n prefix_indices[prefix_sums[i]] = i\n else:\n length = i - prefix_indices[prefix_sums[i]]\n max_length = max(max_length, length)\n\nprint(max_length)\n\n\t\t\t\t \t \t \t\t \t\t\t \t \t \t\t \t \t", "n = int(input())\r\na = input()\r\ns = [2*int(c) - 1 for c in a]\r\nr = {0: -1}\r\nh = 0\r\nans = 0\r\nfor i in range(n):\r\n h += s[i]\r\n if h in r:\r\n ans = max(ans, i - r[h])\r\n else:\r\n r[h] = i\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\nmn = [100001 for i in range(n * 2 + 1)]\r\nmx = [-1 for i in range(n * 2 + 1)]\r\ntek = n\r\nmn[tek] = 0\r\nmx[tek] = 0\r\ns = input()\r\nfor i in range(n):\r\n if s[i] == '1':\r\n tek += 1\r\n else:\r\n tek -= 1\r\n mn[tek] = min(i + 1, mn[tek])\r\n mx[tek] = max(i + 1, mx[tek])\r\nans = -1\r\nfor i in range(n * 2 + 1):\r\n ans = max(ans, mx[i] - mn[i])\r\nprint(ans)", "import sys\r\nsys.setrecursionlimit(200000)\r\nimport math\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\nfrom functools import lru_cache\r\nimport heapq \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)-1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\nn = inp()\r\narr=insr()\r\nprefix=[0]\r\nfor i in range(len(arr)):\r\n if arr[i]==\"0\":\r\n prefix.append(prefix[-1]-1)\r\n else:\r\n prefix.append(prefix[-1]+1)\r\nf=defaultdict(lambda:math.inf)\r\nans = 0\r\nfor i in range(len(prefix)):\r\n ans = max(i-f[prefix[i]],ans)\r\n f[prefix[i]]=min(i,f[prefix[i]])\r\nprint(ans)\r\n", "n=int(input())\r\n\r\ncnt0,cnt1=0,0\r\n\r\n\r\nbalance=[]\r\ndict={0:-1}\r\nl=0\r\nfor i,ch in enumerate(input()):\r\n if ch=='1':\r\n cnt1+=1\r\n else:\r\n cnt0+=1\r\n\r\n balance.append(cnt1-cnt0)\r\n\r\n if dict.get(cnt1-cnt0)==None:\r\n dict[cnt1-cnt0]=i\r\nle=[]\r\nfor i in range(len(balance)-1,-1,-1):\r\n le+=[i-dict.get(balance[i])]\r\n\r\n\r\nprint(max(le))\r\n", "n = int(input())\r\n\r\ns = input()\r\n\r\ncur = 0\r\n\r\ndict_ = {0:-1}\r\nans = 0\r\n\r\nfor i in range(n):\r\n if s[i] == \"0\":\r\n cur -= 1\r\n else:\r\n cur += 1\r\n \r\n if cur in dict_:\r\n ans = max(ans, i - dict_[cur])\r\n else:\r\n dict_[cur] = i\r\n\r\nprint(ans)", "from collections import defaultdict\r\nN =int(input())\r\nS = input()\r\nList = [0]\r\ncount = 0\r\nfor i in range(N):\r\n if(S[i] == \"0\"):\r\n List.append(count-1)\r\n count-=1\r\n else:\r\n List.append(count+1)\r\n count+=1\r\n\r\nDict = defaultdict(list)\r\nfor i in range(N+1):\r\n Dict[List[i]].append(i)\r\n\r\nAns = 0\r\nfor i in Dict.keys():\r\n Ans = max(Ans, max(Dict[i]) - min(Dict[i]))\r\nprint(Ans)", "n = int(input())\r\ns = input()\r\nd = {0: 0}\r\ncb = 0\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == '1':\r\n cb += 1\r\n else:\r\n cb -= 1\r\n if cb not in d:\r\n d[cb] = i+1\r\n else:\r\n ans = max(ans, i+1-d[cb])\r\nprint(ans)", "\r\nimport sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\n\r\nn=int(input())\r\n\r\ns=input()\r\n\r\nindex={0:-1}\r\n\r\ncnt=res=0\r\nfor i,c in enumerate(s):\r\n if c==\"0\":\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n if cnt in index:\r\n res=max(res,i-index[cnt])\r\n else:\r\n index[cnt]=i\r\nprint(res) \r\n\r\n\r\n\r\n\r\n \r\n\r\n", "n=int(input())\r\nls=[0]+list(map(int,list(input())))\r\nfor i in range(1,n+1):\r\n if ls[i]==0:\r\n ls[i]=-1\r\nlz=[0 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n lz[i]=lz[i-1]+ls[i]\r\nz={}\r\nz[0]=0\r\nm=0\r\nfor i in range(1,n+1):\r\n if lz[i] not in z:\r\n z[lz[i]]=i\r\n else:\r\n m=max(m,i-z[lz[i]])\r\nprint(m)", "n = int(input())\r\ns = input()\r\n\r\npref = [0]*(n+1)\r\nfirst = {0:0} # число : первый раз, когда оно встретилось в pref\r\nans = 0\r\nfor i in range(1, n+1):\r\n pref[i] = pref[i-1] + (1 if s[i-1]==\"1\" else -1)\r\n if pref[i] in first:\r\n ans = max(i - first[pref[i]], ans)\r\n else:\r\n first[pref[i]] = i\r\n \r\nprint(ans)\r\n", "n = int(input())\ns = input()\npreff_sum = []\nsum = 0\nd = {0:-1}\ncounter = 0\nmax_counter = 0\nfor i in range(n):\n\n if int(s[i]) == 1:\n sum+=1\n else:\n sum-=1\n\n if sum not in d:\n d[sum] = i\n else:\n old_index = d[sum]\n counter = i - d[sum] \n if counter > max_counter:\n max_counter = counter\n\nprint(max_counter)\n\t\t \t\t \t \t \t \t \t \t \t \t\t\t" ]

[ "import math\r\nfrom fractions import Fraction\r\nimport time\r\n\r\nMAXN = 10000\r\n\r\ndef solve(free_nodes, n):\r\n\tseq = []\r\n\tused = {}\r\n\r\n\tused[0] = 0\r\n\tpos = 0\r\n\twhile used.get(free_nodes) == None:\r\n\t\tused[free_nodes] = pos\r\n\t\ttoss = 0\r\n\t\twhile free_nodes < n:\r\n\t\t\ttoss += 1\r\n\t\t\tfree_nodes *= 2\r\n\t\t\r\n\t\tseq.append((toss, Fraction(free_nodes - n, free_nodes)))\r\n\t\tfree_nodes -= n\r\n\t\tpos += 1\r\n\r\n\r\n\tfirst_loop_idx = used.get(free_nodes)\r\n\tans = Fraction(0, 1)\r\n\tprod_prob = Fraction(1, 1)\r\n\tpos = len(seq) - 1\r\n\twhile pos >= 0:\r\n\t\ttosses = seq[pos][0]\r\n\t\tprob = seq[pos][1]\r\n\t\tans = ans * prob + Fraction(tosses, 1)\r\n\t\tprod_prob *= prob\r\n\r\n\t\tif pos == first_loop_idx:\r\n\t\t\tbreak\r\n\t\tpos -= 1\r\n\r\n\texpected = ans / (Fraction(1, 1) - prod_prob)\r\n\tseq[first_loop_idx] = (expected, 0)\r\n\tpos = first_loop_idx\r\n\tans = Fraction(0, 1)\r\n\twhile pos >= 0:\r\n\t\ttosses = seq[pos][0]\r\n\t\tprob = seq[pos][1]\r\n\t\tans = ans * prob + Fraction(tosses, 1)\r\n\r\n\t\tpos -= 1\r\n\t\r\n\treturn ans\r\n\t\t\r\n\t\t\r\ndef main():\r\n\tanswers = {}\r\n\tanswers[7901]=\"154524871223548423123495185797654506574461761702003065846910905746685998647514825069390588667489327248905358174327876552502957660057253253483877516101528529986709707135176302376822177221161432613294608372321628357823583864101273914414227874808941949788705240048101067284633674852304568823278847645592602559676080522967116394164201940415879553271492035834028327398486009600093157465503523211488955021953127268647916111031703682619831400080346816600935122503273822918215392148364075637874362562003886513246910604701515426048343641513851237428592540111811008678402471757951449650412535345381923708040483001118261857832491735489869517576740499550045310104023129873482509874323682634142866901829084234882445385200295319524648351689094720128553785639719221969264129589951800322116024545902369342877667788536967565125990256796799578322951449803408736681264649241378320858137626918605730290281622575456429027323727694782739314124549860068706433370934863613425473482843884549752732489665702585505388955369522536754702394875839852529518821561333302341509362321195291824828007269021295402144559299990594887703714374425464288060958835387801765108977136997785318571620158461213961462833468536927703562738/11708004285457312755126666863217644760055861406773594249600054075715122508974581228961888366743801655492643437810966154300770740887430126947893305147118944410195839406784735953274330671167286093169745122932079008472101285489067230450306319942053264911861843858846013256127918927680942561098504170833048864333768657182434590844327804335990621076825744270870324389495315888792715548357390675237849554405351811596599797655317280518276360549141571034933129894218745679847870164916740677879764869800871601845140782167652942474700432778572851450966443631222817719445949290846552185879120812492319719862315771781394854730275436023186795781303781840036204405022306942239374739830768947586427274411392455925485082460607204057421762514961554176729112109598477706758573572158753606767581854626464460620360300538015606769824377407345840454826888698131026097851727716692518589246731498897676124408346168821318136621626754567759664177038839955381358225129907645563115937666757425864999645653438548784189677256397395962427979423494151205540932406527491201269878128444061666062993821362430091038452053553637944869816002598967413541372965358839069476857294840674149717585402596923888822980913065149411098625\"\r\n\tanswers[9677]=\"355015421701713202212473860076525882009902216644337983789712546902855564673657169603761249467720400461970489489113546637794041573523526730170748241877537168935035448171103590132975908684211409578927894713007115704550974932706751558843727054948620629495926397359768216611724650526720850411510463876908039969375451684402837509632771646645177985818783287784638536610973174086480221990592966939073544073129241828876855517834517927054871606428776208634273614802546913903241862411771943212010860464482597415685421153568152651624488000580022986646520292360832102090929980870528643545255623373496573726523959723895369828813695219952013125760986556499948313326699376723278370296387425751974594381046366289927557778079267582992094864234023846489168838099075131570386619007407914793038746270712835369525282370958100431637609331765278757991507826864319380122050098235701341246980552596050268124188631452719152745485969575451660773928902074857476078067406169526046841544496200004071166470664478121574731743106703176076616567026951873962889620766354000786634778217195180169674610973441887042266158981969468691882394838540158036461706007682008948872776640135753623571550802521470741987543328917863072840442897261808591862855854318665037353750640231558222883736432456737760890388302545705798404006886873175954856778651125124414825317569798557735990408364421387615142166977843160724913799826226147631507851204157493078199200729703642516155768326800341864259284428724430981938/24161229041093868938167096036170656581148522733477688547261282469337063357483394938167166903472548746587404081486671795113165954899343611098115607541397404292873362806248728502588800585512998777600033616792172309254883839206637069189555255442891066800434624158543262785265015150098229042435359388539219921639220218269440815388818036980365533565004620040497306764512807813441994883170239109645345986288639407216784179724443178968696693613260562923444367236930624063728947412648829923452314809429787376836652426691660599576798962545915528618911236512479993206515809978978648695129649871910364398615156344266149547982458433036808163793383537632482513089121772014669802480412996400494134868452868234286759470106774637235981426506704638332034883255172423927559642487526813597003924444637677544919662326969340692257915396913234997704693823575079725300545776339756575064121649630028865772015503098586755819568277907891249679180033268400909838077906851564035966964679394900898147925032824546395476864580855337672397183685376407486551748336626559011399276003179795542628358706535984818677212988570736994567317130991320183536176021625899392029640170609055751805596338312028330140696084842046763810806230674825998696642581652399790312867450216407727422365888228987418320643334241435540378709106406300100247499616647356316514697146655316118779950550134717711148638498868581991387487601985619566383393531523585077391874513674532507245281651626638820005842165499579858945\"\r\n\tanswers[9733]=\"95484332877590589554469754771446691003599663592905494408439345619582478641998729504995236393657485029791665442799860526876865749777294323119083076321567009541636671190882179584977739221093063736924544373790908085293665964560075463518378551209058371534457516011892072208377822471345716624828410934324137904318677235430150163578608344109579889521882494969598385295234012317570397732508935799426108056469502224626374842457401918802043515225722679525347961446924556134853285440364336064603065829017067847225685993600461140265253652742105117690561160743911477362779575542189272136064250743190600552890952283014623955797131750064699495418563936864723524709763859874646053576454946899546950910302422000561333155108232250954810214949863400691198989713949529202484236526054871760424497926157074028106143333163969074021979292056212512327926099849931861845561313953950570409114884706721641699210621190980872119389261240676519621068057243738027574759222417016494977306477751003082809341460666604302257397590847967794595829725469987512493547459114166418595444720830389398509346323286112779037870871618987335442875512148343912833469647271576937635892165979513514129039128435307048334834528232324783005922951454548165693723699348030381290479329276604925890470367714103163692490772390053007326510368853943687690444780249282100467642857923059896714215481944561286077482708178927733059970371869942524490998102645615476873969100436610441403602888640392767805625730515962311606242963562/6485730535166475447221120228665262693180004703687449791010059910801300620066946132654995251961761606272418258470135901243541274707080736345809323851092051098573818695148817085012621865665248820792507609538936031065407763604464299894401815432008945474901129334187177041490444422663526557798579047986406673549508346775576876143909187057849285049205320822677633008103880183241664826013469861026682448107160666895807152137916859092551706675767886855171481809876932110911653059114408828368367220124838074484190631672482484444631436531339755862298487996751416667267973622916483976740932542486600258468425261784376839276865109473281064232399599707268603813104371510285927118259593757093001718738645698978681113120430418435675253831857746647974863294508973975619783598336234520138748692085861726551470040106036066745609189179825229044018439871760076297406742520636567156335724257909029876673773613338548753986464403339513606040545936498368623199329089225116307992564649264026669147811640072079662988481212151438123916615699776475294332432339591869935873851983425866472210907920557265210694985396108573392747296754266765509537102861414164709599224713359678465358076426719595086236297691989511016878068258838104680788657074879171206938956666398706992546491805593270055164647640460163376165191669527688682783272454558284018103059264318657168846189582863810223461059222943290931488307133356293744648513461983935004483125773001369169210484002829933395570164359907187244048318465\"\r\n\tanswers[9749]=\"24420738504895369936029275850163071991656213953040750251776948750246796077962845691317677269631705913994021086756383098235089231208690232714718182051661959094144212987702253303432217073773124260159318146666200117041612592906844115211509040675212920139551853176678612535045654292046757526749492513241228125837513438956933418658716846512730365072509590131877465449441381623988912185373433489319776194980015068338689021210658939139364253499030464561574097560424964521204779116215457677726768619050046856738764484240389262833903373023132839740002736774915426122802238815407817050693856360952407545226333981896371433729874311657730340419746680805378905702168666514377525913884873553751714155904205031709262115464030534807143888700039849995711800671406127912163382933986015685240389569396807457398304726818373517814077265886528890585763062131364555734521607919713137187807658107106103376981378323172002338180348049030319707116151597120087047456178402809544871620530165936798803297978162622508652805080201485681178041361165961347313090217348403318922506112704312304156650558494700459948184483142107408891022462564899591639479697445627266468118776891821012071431633275985890307805299829762601232691986762912806985999108672619322038677748498306049452995705026758802905382276104042099895012248388280300961696806504069643072689548038490993315819434426936765296065726033493251456080278483753254193225043853870782435870985742176970373530465074443098411876172230726422871158542366506/1660347017002617714488606778538307249454081204143987146498575337165132958737138209959678784502210971205739074168354790718346566325012668504527186905879565081234897585958097173763231197610303698122881948041967623952744387482742860772966864750594290041574689109551917322621553772201862798796436236284520108428674136774547680292840751886809416972596562130605474050074593326909866195459448284422830706715433130725326630947306715927693236908996579034923899343328494620393383183133288660062302008351958547067952801708155516017825647752022977500748412927168362666820601247466619898045678730876569666167916867016800470854877468025159952443494297525060762576154719106633197342274456001815808439997093298938542364958830187119532864980955583141881565003394297337758664601174076037155519665173980601997176330267145233086875952430035258635268720607170579532136126085282961192021945410024711648428486045014668481020534887254915483146379759743582367539028246841629774846096550211590827301839779858452393725051190310768159722653619142777675349102678935518703583706107757021816885992427662659893937916261403794788543307969092291970441498332522026165657401526620077687131667565240216342076492209149314820320785474262554798281896211169067828976372906598068990091901902231877134122149795957801824298289067399088302792517748366920708634383171665576235224624533213135417206031161073482478461006626139211198630019446267887361147680197888350507317883904724462949265962076136239934476369526785\"\r\n\tanswers[9803]=\"3273210180788326072665779956874407303695209430301336271835983946088930098968971592446649088493870209185601637297946849124915345946101994703881396454817629317067995483358046696632270413949397783371061147815617923539634120806955265009854911188530306501324761896490486400736980978270851173985761450205468514371802366150508965142349402634775190541932571215772934087049601511151015580218962449832712507548850463067009640345032653747650848021793733486635063672276271184797891474270402353352104959589784879937226619631450622372801836784254780047580520552480710915034334830077235403144885444713231997122651029623193719081606830187339528932202520708400927484122175520586418859966084212848690640894333604345214778602427783597772052518000554782737270290980515925878265370322995156392497748140171133095749065170222804510706059714322514254283376693941404435829879255457277967393238087816555358380272466214436430777426033426837629266695879765238233176316258666048369521314622222658677664616511902093975562338612751867496209652181946196463606422353383104107812596334613198740452548306659208445516691530536050604634513689227620071954907294939937244234855896302003859771540054305586466389588586625478638436931865675356838997676239216955771564982882752970004654747040198185582364456872545570483489206688716013710536947301312846273423736064935003964044795795191383397598165999437078614987833270147703891978941201213909953516817760145834793630851002075671081977655885477265842182227630711346029216/222848004313668719691213483700810759987656019547710139664241936991138106539616439762775058065688367531907719095700069508131964048744509937894796740738505066831483388299980505865722101281973991752051079878406943136495731052685385981167936406108052259153180314590401441086107951134763582222178806130979450523610292690241037876575460384059273115066548829780705991363970146861803501538571064868730128783979777341880332463641995130956398538891263597839918422762242505609422357073557925121726514010836900537641686656503152430580165941404831443945570282690367110620682083028935478555282639476176629026776268383873097027471871476729615653553852994769678614918913374970497476655715836999681683299634189187555967856521001252998565559074621638218445299839894876830416575083610618206257432118972401116133269463833866230950916952995411373918148349361215693246613829888213288305357239073545221307206167441574530195787313912090912979929382777969487951949322618906724196994628638037640106093305472621641881937827447206916332715678892320927194478168405438778896510491602870644308869938666086561401068093659871427096523225215861650585301063106894861911088059286678346350307257457833611661977586521721847940184057530922580500894412994920507883101337204349029037389584516440678117026220089119744731571552913544501272187787585483807869056891982387618102642674500927575453725610336484859306845245953350338792277922673893920973157108631164802759853751459885883070656697593169142468287187573383626753\"\r\n\tanswers[9851]=\"18265268265520540785908331599388596086601686893936229266975936149663252475233854868431481692229058024923431589387659887867902680080183462504251855907294546963177054676412752415280943300166703724954104193781416518797928286826415325332840928794180900409037356267851073782046598387404127155718808844538373667244444328956542214789965312060454053447621394245918870851186507344747417605653775585109692134356662244321759849102328545344784420668995358085194630127711431602472710880078819974685888683913959613604493112607285755338616455009301468715782989705834386644957400388390566758392150728632659510383880551633428476788516339901525016398990001474110188269351024831528207885540825997319998166104138747638272941441134463442026326873236217051663959231958241680370115809166365792021138069848917961267525948375559165503280962387996982888846030231981715588925232378210229430804794913608024007017149934655717953874398908493758773482266278494809575155035699163146831855305715514980662636600137664244032908275561765291731574659214609335181436215261784472370334656269736145983983299651958393592650363097522621151977579876823874400736328643285043574846932479789412227618717036882664289326702680070901993665489716988043011337934536983844751946964735793973495903486597880356428661975609996251202975190898308197830114324065800497484920958433532502516025186842292166331207944400540709960586195814487225935384488510616614943463793147585780366578287019794729442704404133845784855565244538577819709563958432/1246256367846450620900980639386993831812354124550718439512384817719571366415385855683688636193531976923400898445294912450981239116673724014069196731821966341108744135306881914232828896393851522002126470051095673633568787649603366883142133786512837363700294408277038834604302565168457909291751273693855510998640993429131661506495946387601793951488114697259379016535820590484066498289646362217565672105548688032210727964777966327667928289687709964632481600353819720330163506617403066093010672828945673696843569213490397669589483104930733526222241625292450044726359124768794924595114927847314053111365079450069955139617840563110578472218053108499256124358477392389676597769300743988150510653851837661496994939303282185942527358251895780888237326532893921959098083385984467179971163421779223854669648860314987290589806372821954543027180392425525902729393830873936730656417452366836021212933409233154424397748685187651419567159639870891380259750468877027931901801811833381101396730100689385124042639143217506344002632937121036312287344746207473989440999387962515673209693892302562038440994012679964488208874332821052512662040786924668729190832388557802846413972174912561798304372318744538711603874337650904937446964586669662754528164628055399933183519045194193602651940724032900402408812654228655141151923101627926769707222397692395088211182106973251377914484189782346388440184323310828185863741946910405291084529004480172075833154172217606931875716892455759609241742431983724318960560811\"\r\n\tanswers[9859]=\"97375564875859552710857257263475485245872015150154159409742126964779182762643082446089319960510145599477278715485258439846460300625068332427651118034416501442686377626793456360113581501157759087688960055802143216287038684355484042396762264359960403926704844149909425763766341457216806367693536067206432651075198691127588916420476804076478746658658023803466680068762064908145889385697518113114359392346598640883967611367897988991624393548051091664507952791730942125971565547106392956691209669780229555235202438855255794019000921171549420192999015238112509496532316750570319815809655206552721206293067341273639421021965567073260870827807392294831930629646379401978966733087112069358716912846766412303196634451076031066079956837629059177170048030972622525029555337583764651631049334455610692138052593093947511364692321205405385002454933574475419016360524655415844182022437368453118181570693029677857477506665909191395707456794665378068881663661605928129286724609088224972033263553402215822565698200814687889578567152857719719092867521377534941657609474679845672885532933976895375591415049759550178150185246432147540404349497656619717599874838652250947951177310462729418401362305425416426586758305028116511635937540760865154551702859543508608294300521944993342492698120674763653834888118184019182478585368460360033050972822901924636673968468405685748843065150057388284549646737772327988070397810180542766311272621109742146466204069612665219252089658629990789090591243706759175949093962008/6646700628514403311471896743397300436332555330937165010732719027837713954215391230313006059698837210258138125041572866405233275288926528075035715903050487152579968721636703542575087447433874784011341173605843592712366867464551290043424713528068465939734903510810873784556280347565108849556006793033896058659418631622035528034645047400542901074603278385383354754857709815915021324211447265160350251229593002838457215812149153747562284211667786478039901868553705175094205368626149685829390255087710259716499035805282120904477243226297245473185288668226400238540581998766906264507279615185674949927280423733706427411295149669923085185162949911996032663245212759411608521436270634603469390153876467527983973009617504991693479244010110831403932408175434250448523111391917158293179538249489193891571460588346598883145633988383757562811628759602804814556767097994329230167559745956458779802311515910156930121326321000807571024851412644754028052002500677482303476276329778032540782560537010053994894075430493367168014042331312193665532505313106527943685330069133416923785034092280330871685301400959810603780663108378946734197550863598233222351106072308281847541184932866996257623319033304206461887329800804826333050477795571534690816878016295466310312101574369032547477017194842135479513667489219494086143589875348942771771852787692773803792971237190674015543915678839180738347649724324416991273290383522161552450821357227584404443488918493903636670490093097384582622626303913196367789657657\"\r\n\tanswers[9883]=\"3585169013008320587733453934540655406968508071250655174069676351966247095891666666457951370861261022535907218197677774600785190516321049571099175528120462561383326438548822604717683501452327840790897918994708328294710567693091965543331903184071652577937298158191755916197924842106107578819028940776121678861464188820255086932973183740793372165945865009415954786595728774195980645745127346052687115724325004061229398519190748075580806663121266449693574278118081790297078495193488775980028423355059820522243653725874632878510045835553519741832072550463732084440328479802757883822909816376632890811035439142421989449863044208586517399880008863407492496206323270830482631638372716663110223514171732041108713906301160805034170356396842166510003100992178793709386042537964760180749873610550892321524236421203672563269319950307992448377781123935998679097946148059114351779548141469866569341951745396332639499438188190815082774623731116948453999214458330207016238401484362043219831905888672028360776820475855330015482747522043053354249914178134040244185110051911485974319449824722583973072546384468573330564589187898015237282681548921919611841954714952547395797273043248344370035395990109256951956434133363924387603461250518602022484830305070939839063616330207734382452009330287037414957658873609136317223268183549799388228885998953454699718350330403675879708887230727150794790578035321318346228048669908308488864491704843219546622006983096396305733734212669415968084578686794694798437666747022528/245023971969554963674100001548598083284963319719667650955650954242209487208196182314258655384737934918956003841532542147162519460250987530958116631050053158392707966954415439393488023662202360037794081023805818201748692202213218756160808639498715928402387483022532051193882718732640172630032634418401544306420808436114717705469155027373613505214175254398771989683074614653891346095730791982871151661327716456636886803699066403750136045178921280726462942482363787574672786709034382018414642363553351014189020455925920105022649094294221657123502481465498018393560014802543232534796355734204721354119265540519353740089984397432044612265846985555821748097871523162949536534226680674022295598632502098951601181026539704013788418851188725688874564294979208208534355978351634123319770498029169643618890323128809021228280651347778838795487882593997796683820662300462952740896922474938896458632411722512025071992573497373770298260122475736212490109020184974707635349450620937391583408311636338630467775196669707487281669656501492707286190275862359046116016007668534281478411496777822117253806950844982458097770364827281492409458515035685269508751174249572502027758241365208950041026032843726267011014525776869117941572813455949054842273391192716070063345312437540015830192761870660482316791838322587429991597297164863426338597581165506413503024091687797006909010907584727558738447759437495307966298576698160963469547078512837671485404775491359263662220946791941985253800496067456070902197939863553\"\r\n\tanswers[9901]=\"1838099364825091485842998238489502638352163208605775246129613825541675258139803932850287467779059152113767067936585018625986257156889365449198856216156597215096982506298229063072584364817360767528951048690402306736891920567120457283597208730483707878597646111737127186752299112571526574444743928839110241560725998077538870670908652964981237795923920133705668072188172055098674658571105524472734987571439013958589827622877679807533101349696441175687163721291688130495577638100992957486490904022264860238167307326966426591671355541318530110693823370267769955298274501764387363143753324201392980117580626370923156755357235271953717705218606174361705745607690592162188659919159503909577911890370970307505310006952184882295896878809489448279733854445719768942424699644398057419073652907805636830184662379668640311223728733045708550684860813272116912712928434533540137586553447726767616634480071951755086848411168207402152500267945846598199304627785126081886349021085239907165847936787381451395789868857912620418181602257637943517461795756567745027242135635746499764849207120672778956961370729031070654229684060835173403463861644712283677533769437289456513866506359310854677128562818680682992941321465381508384264781767572418820540784203355739555956391413113575042931607212249685559517635004403000728597654807705351363988397543735139434999563378705775136326919194852966154650224921931475263079667563204688934744417553326412692788253071675108998704506853416086820413944387432670284519676275301802962/125452273648412141401139200792882218641901219696469837289293288572011257450596445344900431556985822678505473966864661579347209963648505615850555715097627217097066479080660704969465868115047608339350569484188578919295330407533168003154334023423342555342022391307536410211267951991111768386576708822221590684887453919290735465200207374015290114669657730252171258717734202702792369201014165495230029650599790825798086043493921998720069655131607695731949026550970259238232466795025603593428296890139315719264778473434071093771596336278641488447233270510334985417502727578902135057815734135912817333309063956745909114926072011485206841480113656604580735026110219859430162705524060505099415346499841074663219804685588328455059670451808627552703776919029354602769590260916036671139722494990934857532871845441950218868879693490062765463289795888126871902116179097837031803339224307168714986819794801926156836860197630655370392709182707576940794935818334707050309298918717919944490705055557805378799500900694890233488214864128764266130529421241527831611400195926289552116946686350244924033949158832631018546058426791568124113642759698270857988480601215781121038212219578986982421005328815987848709639437197756988386085280489445916079243976290670627872432799968020488105058694077778166946197421221164764155697816148410074285361961556739283713548334944152067537413584683380510074085252831997597678744871269458413296408104198572887800527245051575942995057124757474296449945853986537508301925345210138625\"\r\n\tanswers[9907]=\"1633354865670482634892575473274177878269848372373759525765811325846788929611278968402771127221384695483915945198456285004476851582174958025985911899376499975337986661537173411180428490907671107896805361798951388912266345066652077866312114944286489782939084013056891167373799137114155515056010000276816186615290579398553645497061457349859874907706345855178899820840538136570385474191197090563464515778875629438803382571649568677198891486414476226932831825123576296441036124053704853315256369077062694497961110434982641810098930629547385147383059244374581651992456044925971934850442830194217280514603049112460209344747724704460094333483276967669942685299188841394315505390707812866736298697875298127848875145262191230878125445765654264972808396487147578694015479599857513297812474321479310509988898419240869755115441035610394724742733426143862263998840699035405386591348806972955989366740531496447026566482443584635769122576528379572484919769116532440328453434380368399747202088827429149682924434791294983263532249848151359239961565497074342143353501637548919300241662090353407294661111131471268545214977964856225076533564370498248492613685805161596682009974473114515513380958196492686912557866989055667956732635644620975053458902179010611928423215547799006570194462929051080094813251146339256886128285111370771379853589184069970476491616306084104329480579259858092153081246668787325700941970854871522339560167691629337094064099025875633061751502297990098463516213737680898668940099498771690328/111513132131921903467679289593673083237245528619084299812705145397343339956085729195467050272876286825338199081657476959419742189909782769644938413420113081864059092516142848861747438324486762968311617319278736817151404806696149336137185798598526715859575458940032364632238179547654905232512630064196969497677736817147320413511295443569146768595251315779707785526874846846926550400901480440204470800533147400709409816439041776640061915672540173983954690267529119322873303817800536527491819457901613972679803087496952083352530076692125767508651796009186653704446868959024120051391763676366948740719167961551919213267619565764628303537878805870738431134320195430604589071576942671199480307999858733033973159720522958626719707068274335602403357261359426313572969120814254818790864439991942095584774973726177972327893060880055791522924263011668330579658825864744028269634866050816635543839817601712139410542397893915884793519273517846169595498505186406266941599038860373283991737827162493670044000800617680207545079879225568236560470596659135850321244618601146268548397054533551043585732585629005349818718601592504999212126897509574095989760534414027663145077528514655095485338070058655865519679499731339545232075804879507480959327978925040558108829155527129322760052172513580592841064374418813123693953614354142288253655076939323807745376297728135171144367630829671564510298002517331197936662107795074145152362759287620344711579773379178615995606333117754930177729647988033340712822529075678777\"\r\n\tanswers[9923]=\"3760299283807515305392881669921685380087483626665387583310740045779392618490518061864438198412014466565364228291295311284131760183238506480296641521584717001189575119537493891940454933801650905249443352246953782854872613017048635048443614120554701976326536039594670095564945312513189153593550500517921950184962024588992584781239533465993501341159180970745350678104403343694528834994019085606787711931776684194936418570665879951352474415566347678136222813280481902061127946763865268688300550988394467968839427831476642475507856733491281467764508214106535203243052393575405292358868470813735971960765501058279775977978030573791129899519277415389902700239026919247980979527451730380980472670105835211342752731828345683483462323646594371504049372940439266303990974893632430579149551268895678583153720791224950534759778851291627442428157985110658561730352163307118794880980048721449385869746576091026550888327297357898605889141961077282796364157526745937107341872728740687038596285146407533730421930092930276945716734155916067113852174300467379937502904191927521252135950255956504149093128341783431227487283983351865444285852258683713459524558123548207017084006902917163157763229391288430112144112020068120688896821326535586200626213610044286687320856131797617153232959645033928534332319957752653966344480388578387275931286170730869888406739091108118872791757012867192042173164675250862437159941800851341264571676718462429556497603409387737027536322645374934694161916847152916606849505635131538412760/256926256431948065589533083223822783778613697938370226768472654995479055258821520066356083828706964845579210684138826914503086005552139501261938104519940540614792149157193123777466097899617501878989966303618209626716836674627928070460076079971005553340461857397834568112676765677796901655709099667909817722649505626707426232730024701983314154843459031556446737853919647135318772123677010934231100724428371611234480217075552253378702653709532560859031606376387090919900091996212436159341152031005318593054266313592977600044229296698657768339933738005166050135045586081591572598406623510349449898616962983415621867368595479521703611351272768726181345333473730272112973220913275914443602629631674520910274159996084896675962205085304069227937335130172118226472120854356043102494151669741434588227321539465114048243465612267648543668817501978883833655533934792370241133238731381081528293006939754344769201889684747582198564268406185117574748028555949480039033444185534300046316963953782385415781377844623135198183864041735709217035324254702648999140147601257041002735506813645301604421527877289228325982327658069131518184740371862058717160408271289919735886258625697765339998218913415143114157341567381006312214702654442385236130291663443293445882742374334505959639160205471289685905812318660945436990869127471943832136421297268202053045346989965623434316623021431563284631726597799931080046069496359850830431043797398677274215479797865627531253876991503307359129489108964428817002343106990363901953\"\r\n\tanswers[9941]=\"384853449965821966704972732966307410533754716673001872990644754365090705756559909905259906468556983837473030874407257670396254711587695297525843978796573345385105966534793732922560851527360127165003492854386049121963401202049881466162284067795049692605928261294087682986229601310196379407661027753366447296128334837195369728352306910364221724819790584234590499773230968446949449654139435810921574651200199324826389837566367344938559238192678820640156721227690796296835372410818703029961426437218612250923546166131087887183128506236914642265107372940583059256790238734873109550064606852454241895688532803264957771260552966093023026993324786723535480684212796655647178515320455962010444291723038825881485337386595953872058254168410359964399040839348392327614519090725780698083807461735099275217105332435035753958774263103832408352846440135520908788781982960980537030064122924914534253061986335785798932585118262145429733521285255543276010510520192751011713072317121752117777795703412147228931454823584324564303527450001365318783625485155921101661017155244139248803962776096262658198375191699627453070323264267286645773802280627801063123133551237542788441825414046345338526837487440831294887788650949450267282162592637307013507372887692529215654653541232042283216484427420262459679041403322783917834492903078518685769388196722883649292951071615901964473014159404289255892968209177423128684793429579384323572081016759500108948811565542981757113040677115518347788350471128322691656105081491299216747682/26309248658631481916368187722119453058930042668889111221091599871537055258503323654794862984059593200187311174055815876045116006968539084929222461902841911358954716073696575874812528424920832192408572549490504665775804075481899834415111790589030968662063294197538259774738100805406402729544611805993965334799309376174840446231554529483091369455970204831380145956241371866656642265464525919665264714181465252990410774228536550745979151739856134231964836492942038110197769420412153462716533967974944623928756870511920906244529079981942555478009214771729003533828668014754977034076838247459783669618377009501759679218544177103022449802370331517560969762147709979864368457821519453639024909274283470941212073983599093419618529800735136688940783117329624906390745175486058813695401130981522901834477725641227678540130878696207210871686912202637704566326674922738712692043646093422748497203910630844904366273503718152417132981084793356039654198124129226755997024684598712324742857108867316266576013091289409044294027677873736623824417203681551257511951114368720998680115897717278884292764454634416980580590352186279067462117414078674812637225806980087780954752883271451170815817616733710654889711776499815046370785551814900248179741866336593248858392819131853410267050005040260063836755181430880812747864998653127048410769540840263890231843531772479839674022197394592080346288803614712942596717516427248725036138884853624552879665131301440259200397003929938673574859684757957510861039934155813263559885\"\r\n\tanswers[9949]=\"30771945768974312829849286149718032439798677467423493967010334358283994984326026515504661301394540080141512302827338824723593201789481739830982595229625700583149586238955431037653778739309457671890129351276923685142834902559798917246250215421521527437619966091451717584873598334082323796428001565577186322128798336073715122147162994673808366455578086459869026609967714613554824824759058832899783907543792360923791441961728662642435663487942507846671256543700983615951249949208724967800869867388054589031851260302269048408876735464545077279886559546809841455560742265338090287549868226487740814828047510635070623293003545071913364258117360949495583083158833097103857044434279928869747427297854639426953768566959891591203122862851297692620246536344125431027520526966343015915582695313902053937737605214941486508347934274945698807835217128834978971566963674180680330348426256461353890985386815655822602029905923905821026891198095526938372914444181903627938094196468774691975665647890550812376683751593905633065125611092957601442907415902644417519682901059153440286626841355350656757754077474910571424577932014202554351172899008539276212598195566148386803283414780184354222934329064815395828988176783012436153939221036332468551883344836802385258800011254159939415282139047054155201180580357201111671543663885937215403704436525087738509669353351862725364108467051762959998292239822805587007389198288780422715556343928293849868727893528481926649471509098886000214133618311655761794432794819144278520611314/2104739892690518553309455017769556244714403413511128897687327989722964420680265892383589038724767456014984893924465270083609280557483126794337796952227352908716377285895726069985002273993666575392685803959240373262064326038551986753208943247122477492965063535803060781979048064432512218363568944479517226783944750093987235698524362358647309556477616386510411676499309749332531381237162073573221177134517220239232861938282924059678332139188490738557186919435363048815821553632972277017322717437995569914300549640953672499562326398555404438240737181738320282706293441180398162726147059796782693569470160760140774337483534168241795984189626521404877580971816798389149476625721556291121992741942677675296965918687927473569482384058810935115262649386369992511259614038884705095632090478521832146758218051298214283210470295696576869734952976211016365306133993819097015363491687473819879776312850467592349301880297452193370638486783468483172335849930338140479761974767896985979428568709385301326081047303152723543522214229898929905953376294524100600956089149497679894409271817382310743421156370753358446447228174902325396969393126293985010978064558407022476380230661716093665265409338696852391176942119985203709662844145192019854379349306927459908671425530548272821364000403220805106940414514470465019829199892250163872861563267221111218547482541798387173921775791567366427703104289177035407737401314179898002891110788289964230373210504115220736031760314395093885988774780636600868883194732465061084790785\"\r\n\r\n\r\n\t\"\"\"for i in range(1, MAXN + 1):\r\n\t\tstart_time = time.time()\r\n\t\tans = solve(1, i)\r\n\t\telapsed_time = time.time() - start_time\r\n\t\t\r\n\t\tif elapsed_time > 0.8:\r\n\t\t\tprint(\"answers[{}]={}/{}\".format(i, ans.numerator, ans.denominator))\r\n\t\"\"\"\r\n\r\n\tn = int(input())\r\n\tif answers.get(n) != None:\r\n\t\tprint(answers[n])\r\n\telse:\r\n\t\tans = solve(1, n)\r\n\t\tprint(\"{}/{}\".format(ans.numerator, ans.denominator))\r\n\r\nif __name__ == '__main__':\r\n\tmain();", "from fractions import *\r\nn =int(input())\r\nl = 0\r\nwhile (n%2==0):\r\n n = n//2\r\n l = l+1\r\nif (n==1):print('%d/1'%l)\r\nelse:\r\n s=1\r\n t=1\r\n for i in range(n):\r\n t=t*2%n\r\n s*=2\r\n if (t==1):\r\n m=i+1\r\n # print(s)\r\n break\r\n r,t,i,ans=s,s*n,l,0\r\n while (r>1):\r\n i,t=i+1,t//2\r\n if (r-t>0):\r\n r,ans=r-t,ans+i*t\r\n print((Fraction(ans,s)+Fraction(m,s))/(1-Fraction(1,s)))", "import math\r\nn=int(input())\r\ny=0\r\nwhile((n%2)==0):\r\n y+=1\r\n n//=2\r\nif(n==1):\r\n print(str(y)+\"/1\")\r\nelse: \r\n i=1\r\n r=1\r\n p=0\r\n nu=0\r\n de=1\r\n f=True\r\n while(r>1 or f):\r\n f=False\r\n r*=2\r\n de*=2\r\n nu*=2\r\n if(r>=n):\r\n nu+=(r*(i-p))\r\n p=i\r\n r-=n\r\n i+=1\r\n if(r==1):\r\n nu*=de\r\n de*=(de-1)\r\n nu+=(y*de)\r\n o=math.gcd(nu,de)\r\n nu//=o\r\n de//=o\r\n print(str(nu)+'/'+str(de))", "n = int(input())\r\np = 0\r\nwhile n%2 == 0:\r\n\tn //= 2\r\n\tp += 1\r\n\r\nif n == 1:\r\n\tprint(\"{}/1\".format(p))\r\nelse:\r\n\tp += 1\r\n\tb, ans = 1, 0\r\n\tfor i in range(n):\r\n\t\tb *= 2\r\n\t\tif b % n == 1: \r\n\t\t\tans = i + 1\r\n\t\t\tbreak\r\n\t\t\r\n\tden = b - 1\r\n\tt = b * n\r\n\twhile b > 1:\r\n\t\tt //= 2\r\n\t\tif b > t:\r\n\t\t\tb -= t \r\n\t\t\tans += p * t\r\n\t\tp += 1\r\n\t\t\r\n\tdef gcd(a, b):\r\n\t\twhile b > 0:\r\n\t\t\ta, b = b, a%b\r\n\t\treturn a\r\n\t\r\n\tg = gcd(ans, den)\r\n\tprint(\"{}/{}\".format(ans//g, den//g))\r\n\t\t\t", "def gcd(a, b):\r\n while (b > 0):\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\ndef _main():\r\n n = int(input())\r\n t = 0\r\n\r\n while (n % 2 == 0):\r\n t += 1\r\n n //= 2\r\n\r\n if (n == 1):\r\n print(\"{}/1\".format(t))\r\n return\r\n\r\n m, k, = 2, 1\r\n while (m % n != 1):\r\n m *= 2\r\n k += 1\r\n\r\n a, b, p = k, m - 1, t+1\r\n total, rem = m*n, m\r\n while (rem > 1):\r\n total //= 2\r\n if (rem > total):\r\n a += p*total\r\n rem -= total\r\n p += 1\r\n\r\n g = gcd(a, b)\r\n\r\n a = a // g\r\n b = b // g\r\n\r\n print(\"{}/{}\".format(a, b))\r\n\r\n\r\n_main()\r\n", "n = int(input())\r\np = 0\r\nwhile n%2 == 0:\r\n\tn //= 2\r\n\tp += 1\r\n\r\nif n == 1:\r\n\tprint(\"{}/1\".format(p))\r\nelse:\r\n\tb, l = 1, 0\r\n\tfor i in range(1, n+1):\r\n\t\tb *= 2\r\n\t\tif b%n == 1: \r\n\t\t\tl = i\r\n\t\t\tbreak\r\n\t\r\n\tans = 0\r\n\tt = b * n\r\n\ti = p + 1\r\n\tr = b\r\n\twhile r > 1:\r\n\t\tt //= 2\r\n\t\tif r - t > 0:\r\n\t\t\tr -= t \r\n\t\t\tans += i * t\r\n\t\ti += 1\r\n\t\t\r\n\tdef gcd(a, b):\r\n\t\twhile b > 0:\r\n\t\t\ta, b = b, a%b\r\n\t\treturn a\r\n\t\r\n\tP = ans + l\r\n\tQ = b - 1\r\n\tg = gcd(P, Q)\r\n\tprint(\"{}/{}\".format(P//g, Q//g))\r\n\t\t\t", "import math\n\ndef simply(a, b):\n\tg = math.gcd(a, b)\n\ta = a // g\n\tb = b // g\n\n\treturn (a, b)\n\ndef mul(a, b, c, d):\n\treturn simply(a * c, b * d)\n\ndef add(a, b, c, d):\n\treturn simply(a * d + b * c, b * d)\n\ndef main():\n\tn = int(input())\n\n\tnxt = 0\n\tdepth = 0\n\tnode = 1\n\ttotal_node = 1\n\n\tp = 0\n\tq = 1\n\n\twhile (n % 2 == 0):\n\t\tdepth = depth + 1\n\t\tn = n // 2\n\n\tnxt = depth\n\n\tif (n == 1):\n\t\tprint(str(depth) + \"/1\")\n\t\treturn\n\n\tfor i in range(0, n):\n\t\tnode = node * 2\n\t\ttotal_node = total_node * 2\n\t\tdepth = depth + 1\n\n\t\tp = p * 2\n\t\tq = q * 2\n\n\t\tif (node >= n):\n\t\t\tp = p + n * depth\n\t\t\tnode -= n\n\n\t\tif (node == 1):\n\t\t\tnxt = depth - nxt\n\t\t\tbreak\n\n\t# p/q + 1/total_node * p/q + (1/total_node)^2 * p/q + ...\n\tp, q = mul(p, q, total_node, total_node - 1)\n\n\t# 1/nxt_node * (nxt_node_1)/nxt_node * nxt + (1/nxt_nod)^2 * (nxt_node_1)/nxt_node * nxt * 2 + ...\n\ts, t = (total_node - 1) * nxt * total_node * total_node, total_node * total_node * (total_node - 1) * (total_node - 1)\n\ts, t = simply(s, t)\n\n\tx, y = add(p, q, s, t)\n\n\tprint(str(x) + \"/\" + str(y))\n\nif __name__ == \"__main__\":\n main()\n", "from fractions import *\nn,L=int(input()),0\nwhile (n%2==0):n,L=n//2,L+1\nif (n==1):print('%d/1'%L)\nelse:\n s,t=1,1\n for i in range(n):\n t,s=t*2%n,s*2\n if (t==1):\n m=i+1\n break\n r,t,i,ans=s,s*n,L,0\n while (r>1):\n i,t=i+1,t//2\n if (r-t>0):\n r,ans=r-t,ans+i*t\n print(Fraction(ans+m,s-1))\n", "\"\"\"\r\n1/n = sum c_k 2^{-k} としたとき、n * sum kc_k2^{-k} が答\r\n\"\"\"\r\n\r\nfrom fractions import Fraction\r\n\r\ndef f(N):\r\n n = 0\r\n while N % 2 == 0:\r\n N//=2\r\n n+=1\r\n if N==1:\r\n return Fraction(n,1)\r\n \r\n C = []\r\n x = 1\r\n while True:\r\n x = 2 * x\r\n C.append(x//N)\r\n x %= N\r\n if x == 1:\r\n break\r\n P = len(C)\r\n C = C[::-1]\r\n a = b = 0\r\n for k, x in enumerate(C):\r\n a += x<<k\r\n b += ((P-k)*x)<<k\r\n x = Fraction(P*a,((1<<P)-1)**2)\r\n y = Fraction(b,(1<<P)-1)\r\n ANS = (x + y) * N\r\n ANS += n\r\n return ANS\r\n\r\nN = int(input())\r\nANS = f(N)\r\nprint(f\"{ANS.numerator}/{ANS.denominator}\")" ]

[ "n = int(input())\r\na = []\r\nd = []\r\np = []\r\nfor i in range(n):\r\n ai, di = map(int, input().split())\r\n a.append(ai)\r\n d.append(di)\r\n p.append((ai, -i))\r\n p.append((ai + di, -i)) \r\np.sort()\r\ns = []\r\nfor i in range(n):\r\n s.append((p.index((a[i], -i)), p.index((a[i] + d[i], -i))))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i):\r\n x = []\r\n x.append((s[i][0], 0))\r\n x.append((s[i][1], 1))\r\n x.append((s[j][0], 2))\r\n x.append((s[j][1], 3))\r\n x.sort()\r\n c = [x[k][1] for k in range(4)]\r\n if c[0] >= 2:\r\n for k in range(4):\r\n c[k] ^= 2\r\n if c[0] + c[1] == 1:\r\n continue\r\n ans += 1\r\n if c == [0, 2, 1, 3] or c == [1, 3, 0, 2]:\r\n ans += 1\r\nprint(ans)# 1698868566.077163" ]

[ "# LUOGU_RID: 101448633\nn, m, *a = map(int, open(0).read().split())\r\nans = []\r\nfor i in range(m, 101):\r\n ans += i * sum(x // i for x in a),\r\nprint(max(ans))", "n,L=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nans=0\r\nfor clen in range(L,101):\r\n csum=sum(y//clen for y in a)\r\n ans=max(ans,csum*clen)\r\nprint(ans)\r\n", "n, l = list(map(int, input().split()))\r\na = list(filter(lambda e: e >= l, map(int, input().split())))\r\nmax_area = 0\r\nwhile a:\r\n c = sum(map(lambda e: e // l, a))\r\n max_area = max(max_area, c * l)\r\n l += 1\r\n a = list(filter(lambda e: e >= l, a))\r\nprint(max_area)", "#<https://codeforces.com/problemset/problem/251/A>\n# import math\n\n# count, bounds = [int(x) for x in input().split(\" \")]\n# total = 0\n\n# left_index = 0\n# right_index = 2\n# current = 0\n\n# lst = [int(x) for x in input().split(\" \")]\n\n# if count <= 2:\n# print(0)\n\n# while right_index < len(lst):\n# if lst[right_index] - lst[left_index] <= bounds:\n# right_index += 1\n# continue\n# elements = right_index - left_index - 1\n# total += elements * (elements - 1) / 2\n\n# while left_index < len(lst) - 2:\n# if lst[count-1] - lst[left_index] <= bounds:\n# elements = count - left_index - 2\n# total += elements * (elements + 1) / 2\n# left_index += 1\n# print(total)\n\n#### 35 3\n#### 13 12 38 45 71 61 42 75 58 40 50 70 27 38 16 37 21 12 36 7 39 4 65 12 32 26 1 21 66 63 29 56 32 29 26\n\ncount, bounds = [int(x) for x in input().split(\" \")]\nlst = [int(x) for x in input().split(\" \")]\nlst.sort()\n\n\nright_index = count - 1\nleft_index = 0\nhighest = 0\ncurrent_num = -1\n\n# Find left most index where number is greater than or equal to bounds\nfor index, i in enumerate(lst):\n if i < bounds:\n left_index += 1\n continue\n break\n\nwhile right_index >= left_index:\n # Same number as before, no need to check\n if lst[left_index] == current_num:\n left_index += 1\n continue\n\n # Different Number\n current_num = lst[left_index]\n\n for j in range(current_num, bounds-1, -1):\n current = 0\n for i in range(left_index, right_index + 1):\n # Add maximum possible\n current += (lst[i] // j) * j\n # print(\"L:\", left_index, \"| R:\", right_index, \"current:\", current)\n if current > highest:\n highest = current\n left_index += 1\n\nprint(highest)\n\n\n# Left Index meets minimum requirements\n", "IN = lambda : map(int,input().split())\r\nn ,l = IN()\r\na = list(IN())\r\nMax = 0\r\nfor i in range(l,101):\r\n Max = max(Max,sum(j // i for j in a) * i)\r\nprint(Max)\r\n\r\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(max(i * sum(ai // i for ai in a) for i in range(l, 101)))", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\narea=0\r\nans1=-1\r\nfor j in range(l,100):\r\n for i in a:\r\n ans+=i//j\r\n area=max(area,ans*j)\r\n ans=0\r\nprint(area)\r\n", "n, l = [int(i) for i in input().split()]\r\nlst = [int(i) for i in input().split()]\r\nprint(max(i * sum(elem // i for elem in lst) for i in range(l, 101)))\r\n\r\n", "n,l = input().split()\r\nn = int(n)\r\nl = int(l)\r\na = list(input().split())\r\na = [int(i) for i in a]\r\nans = 0\r\nfor i in range(1,101):\r\n area = 0\r\n if(i >= l):\r\n for j in range(n):\r\n area += a[j] // i\r\n ans = max(ans,area*i)\r\nprint(ans)", "cont=list(map(int,input().split()))\r\nn=cont[0]\r\nl=cont[1]\r\narr=list(map(int,input().split()))\r\n\r\n'''counts=list()\r\nmax=max(arr)\r\ncounts.append(0)\r\nfor i in range(l, max+1):\r\n counter=0\r\n for j in range(len(arr)):\r\n counter+=int((arr[j]/i))\r\n counts.append (int((counter*i)))\r\n\r\nprint (max(counts))'''\r\n\r\nmax=max(arr)\r\nmaxArea=0\r\nwhile l<=max:\r\n counter=0\r\n for item in arr:\r\n counter+=int(item/l)\r\n if maxArea<counter*l:\r\n maxArea=counter*l\r\n l+=1\r\n\r\nprint(maxArea)\r\n", "n, low = [int(item) for item in input().split(' ')]\r\ncont = [int(item) for item in input().split(' ')]\r\nans, high = 0, max(cont)\r\n\r\nfor i in range(low, high + 1):\r\n h = 0\r\n for item in cont:\r\n h += item // i\r\n if ans < h * i:\r\n ans = h * i\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, l = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nd = [sum(i//j for i in w)*j for j in range(l, max(w)+1)]\r\nif len(d) == 0:\r\n print(0)\r\nelse:\r\n print(max(d))", "\"\"\"\nhttps://codeforces.com/problemset/problem/38/C\n\"\"\"\n_, longueur = [int(x) for x in input().split()]\nlames = [int(x) for x in input().split()]\n\nsurface = 0\nfor l in range(longueur, max(lames) + 1):\n surf = sum([x // l for x in lames]) * l\n surface = max(surf, surface)\nprint(surface)\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor x in range(l, 101) :\r\n s = 0\r\n for y in a :\r\n s += y // x\r\n ans = max(ans, x * s)\r\nprint(ans)", "Max=0\r\ntemp=0\r\narr = [int(x) for x in input().split()]\r\nn=arr[0]\r\nl=arr[1]\r\nstripes=[int(x) for x in input().split()]\r\nans=[]\r\nfor i in range(n):\r\n if (Max < stripes[i]):\r\n Max = stripes[i]\r\nfor i in range(l,Max+1):\r\n for j in range(n):\r\n temp +=int( stripes[j] /i)\r\n ans.insert(0,temp * i)\r\n temp = 0\r\nfor i in range(len(ans)):\r\n if (Max < ans[i]):\r\n Max = ans[i]\r\n\r\nif (Max > l):\r\n print(Max)\r\nelse :print(0)\r\n", "from math import sqrt\r\n\r\n\r\n\r\ndef main():\r\n n,l = [int(v) for v in input().split()]\r\n vals = [int(v) for v in input().split()]\r\n ms = 0\r\n mvals = max(vals)\r\n for i in range(l, mvals+1):\r\n s = 0\r\n for v in vals:\r\n s+=i*(v//i)\r\n ms = max(ms, s)\r\n print(ms)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=list(map(int,input().split()))\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nhigh=0\r\n\r\nfor i in range(m,lst[-1]+1):\r\n x=i*sum(list(map(lambda x:x//i,lst)))\r\n if x>high:\r\n high=x\r\nprint(high)\r\n", "n, l = map(int, input().split())\r\ns, t = 0, list(map(int, input().split()))\r\nfor i in range(l, 101):\r\n r = sum(j // i for j in t) * i\r\n if r > s: s = r\r\nprint(s)", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n-1, -1, -1):\r\n if a[i] < l:\r\n a.pop(i)\r\n \r\nif len(a) == 0:\r\n print(0)\r\nelse:\r\n m = 0\r\n for i in range(l, max(a)+1):\r\n s = i\r\n t = 0\r\n\r\n for j in range(len(a)):\r\n t += a[j]//s\r\n m = max(m, s*t)\r\n \r\n print(m)", "def get_answer(k):\r\n return sum([i // k for i in a])\r\n\r\n\r\nn, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(l, max(a) + 1):\r\n ans = max(ans, get_answer(i) * i)\r\n\r\nprint(ans)\r\n", "def main():\r\n M = 101\r\n n, l = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n maxArea = 0\r\n for u in range(l, M):\r\n area = 0\r\n for p in range(n):\r\n area += u * (a[p] // u)\r\n maxArea = max(maxArea, area)\r\n\r\n print(maxArea)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, minLen = [int(item) for item in input().split()]\r\narr = [int(item) for item in input().split()]\r\n\r\nmaxArea, lim = 0, max(arr)\r\nfor _len in range(minLen, lim + 1, 1):\r\n helper = 0\r\n for item in arr:\r\n helper += item // _len\r\n if maxArea < helper * _len:\r\n maxArea = helper * _len\r\nprint(maxArea)\r\n\r\n'''\r\n4 2\r\n1 2 3 4\r\n\r\n--\r\n--\r\n-- ---\r\n-- --- ----\r\nlen = 2 len = 3 len = 4\r\narea = 2 * 4 = 8 area = 3 * 2 = 6 area = 4 * 1 = 4\r\n\r\n\r\n3,5,7,|10,5,15,20,30,30\r\n\r\n'''\r\n", "n,l=map(int,input().split())\r\nun=list(map(int,input().split()))\r\nun.sort()\r\nans=0\r\nfor i in range(l,un[n-1]+1):\r\n scr=0\r\n for j in range(n):\r\n scr+=un[j]//i\r\n ans=max(ans,scr*i)\r\nprint(ans)", "\r\nn,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nmx=0\r\nfor i in range(l,101):\r\n k=0\r\n for j in range(n):\r\n k+=a[j]//i\r\n s=k*i\r\n mx=max(mx, s)\r\n\r\nprint(mx)", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmx = 0\r\nfor I in range(l, 101):\r\n ans = 0\r\n for i in a: ans += i // I\r\n mx = max(mx, ans * I)\r\nprint(mx)", "n,l=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())))\r\nb=0\r\nfor i in range(l,a[-1]+1):\r\n s=0\r\n for j in range(n):\r\n s+=a[j]//i*i\r\n b=max(b,s)\r\nprint(b)", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\ncount = 0\r\nmax_len = a[0]\r\nfor i in range(max_len, 0, -1):\r\n if i < l:\r\n continue\r\n temp_count = 0\r\n for j in range(n):\r\n temp_count += a[j] // i\r\n if a[j] // i == 0:\r\n break\r\n\r\n count = max(count, i * temp_count)\r\n\r\nprint(count)", "n,l=tuple(input().split(\" \"))\r\nn=int(n)\r\nl=int(l)\r\na=[int(x) for x in input().split(\" \")]\r\ncount=0\r\nmal=0\r\nb=[]\r\nif l is 1:\r\n print(sum(a))\r\n exit(0)\r\nfor x in a:\r\n if x>=l:\r\n b.append(x)\r\n if mal<x:\r\n mal=x\r\nif len(b)==0:\r\n print(0)\r\n exit(0)\r\nmal=max(b)\r\nx=0\r\ndiv=0\r\nfor x in range(l,mal+1):\r\n count=0\r\n for qwer in b:\r\n if qwer//x>0:\r\n count+=qwer//x\r\n if count*x>div:\r\n div=count*x\r\nelse:\r\n print(div)", "n, minLen = [int(item) for item in input().split()]\r\narr = [int(item) for item in input().split()]\r\nmaxArea, lim = 0, max(arr)\r\n\r\nfor _len in range(minLen, lim + 1):\r\n height = 0\r\n for item in arr:\r\n height += item // _len\r\n if maxArea < height * _len:\r\n maxArea = height * _len\r\nprint(maxArea)\r\n\r\n'''\r\n\r\n4 2\r\n1 2 3 4\r\n\r\n--\r\n--\r\n-- ---\r\n-- --- ----\r\nlen = 2 len = 3 len = 4\r\narea = 2 * 4 = 8 area = 3 * 2 = 6 area = 4 * 1 = 4\r\n\r\n\r\n5 3\r\n5 5 7 3 1\r\n\r\n---\r\n---\r\n--- ---- -----\r\n--- ---- -----\r\n--- ---- ----- ------ -------\r\nlen = 3 len = 4 len = 5 len = 6 len = 7\r\narea = 3 * 5 = 15 area 4 * 3 = 12 area = 5 * 3 = 15 area = 6 * 1 = 6 area = 7 * 1\r\n\r\n\r\n5 2\r\n3 3 3 3 3\r\n\r\n\r\n'''\r\n", "n,l = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\ncur = 0\r\ncount = 0\r\nans = 0\r\nfor x in range(l,101):\r\n count = 0\r\n for j in range(n):\r\n count += a[j] // x\r\n if count * x > ans:\r\n ans = count * x\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n,x=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nans=0\r\nfor i in range (x,101):\r\n s=0\r\n for j in l:\r\n s+=j-j%i\r\n ans=max(s,ans)\r\nprint(ans)", "def main():\r\n n, l = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n result = 0\r\n\r\n for x in range(l, 101):\r\n s = sum([a[i] // x for i in range(n)])\r\n result = max(result, s * x)\r\n\r\n print(result)\r\n\r\n\r\nmain()\r\n", "n,l=map(int,input().split())\r\nA=list(map(int,input().split()))\r\n\r\nLANS=0\r\nfor m in range(l,101):\r\n ANS=0\r\n for x in A:\r\n ANS+=x//m\r\n\r\n LANS=max(LANS,ANS*m)\r\n \r\n\r\nprint(LANS)\r\n", "I=lambda:list(map(int,input().split()))\r\nn,l=I()\r\na=I()\r\nprint(max(i*sum(x//i for x in a)for i in range(l,101)))" ]

[ "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=sorted(a,reverse=True)\r\nb=b[:k]\r\nc=k\r\nprint(sum(b))\r\nj=0\r\nfor i in range(n):\r\n if(a[i] in b and c!=1):\r\n print(i+1-j,end=' ')\r\n j=i+1\r\n b.remove(a[i])\r\n c-=1\r\n if(c==1):\r\n print(n-j)\r\n break", "n,k = map(int, input().split())\nA = list(map(int, input().split()))\nB = []\nfor i, a in enumerate(A):\n B.append((a, i))\nB.sort(reverse=True)\nB = B[0:k]\nidx = []\nans = 0\nfor a, i in B:\n idx.append(i)\n ans += a\nidx.sort()\n#print(idx)\ns = []\npre = -1\nfor j in range(len(idx)):\n i = idx[j]\n if j != len(idx)-1:\n s.append(i-pre)\n pre = i\n else:\n s.append(n-1-pre)\nprint(ans)\nprint(*s)\n", "n , k = map(int, input().split())\na = list(map(int, input().split()))\n\nb = []\nfor i in range(n):\n b.append((a[i], i))\n\nb.sort(reverse = True)\n\ntemp = []; ans = 0\nfor i in range(k):\n temp.append(abs(b[i][1]))\n ans += b[i][0]\n\ntemp.sort()\nif k > 1:\n c = [temp[0] + 1]\n\n for i in range(1, len(temp) - 1):\n c.append(temp[i] - temp[i-1])\n\n c.append(n - temp[-2]-1)\nelse:\n c = [n]\n\nprint(ans)\nprint(*c)\n", "def main():\r\n n,k = map(int, input().split())\r\n nums = list(map(int, input().split()))\r\n\r\n a = [False] * len(nums)\r\n\r\n order = sorted([(nums[i], i) for i in range(len(nums))])\r\n ans = 0 \r\n count = k\r\n i = len(nums)-1\r\n while count:\r\n ans += order[i][0]\r\n i-=1\r\n count-=1\r\n\r\n count = k\r\n i = len(nums)-1\r\n while count:\r\n a[order[i][1]] = True\r\n count -= 1\r\n i-=1\r\n \r\n answer = []\r\n count = 0\r\n cur = []\r\n for i in range(len(nums)):\r\n if a[i] == True:\r\n if count == 1:\r\n answer.append(len(cur))\r\n cur = [nums[i]]\r\n count = 1\r\n else:\r\n cur.append(nums[i])\r\n count += 1\r\n else:\r\n cur.append(nums[i])\r\n\r\n if cur:\r\n answer.append(len(cur))\r\n\r\n print(ans)\r\n print(*answer)\r\n\r\n\r\n\r\nmain()\r\n\r\n# import sys, threading \r\n# if __name__ == '__main__':\r\n# sys.setrecursionlimit(1 << 30)\r\n# threading.stack_size(1 << 27)\r\n\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()", "from collections import Counter\r\nn,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = sorted(a, reverse=True)\r\ns = sum(b[:k])\r\nprint(s)\r\nc = Counter(b[:k])\r\nl=[]\r\ni=j=x=0\r\nwhile len(l)<k-1 and i<len(a):\r\n if a[i] in c and c[a[i]]>0:\r\n c[a[i]]-=1\r\n j+=1\r\n l.append(i+1-x)\r\n x=i+1\r\n i+=1\r\nl.append(len(a)-x)\r\nprint(*l)\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nif n == 1:\r\n print(a[0])\r\n print(1)\r\nelse:\r\n lst = sorted(a)[-k:]\r\n ans = sum(lst)\r\n print(ans)\r\n res = 0\r\n lmm = len(lst)\r\n ans = [0]\r\n cnt = 0\r\n for i in range(n):\r\n if cnt==k-1:\r\n break\r\n for j in range(lmm):\r\n if a[i]==lst[j]:\r\n lst[j]=-1\r\n ans.append(i+1)\r\n cnt+=1\r\n break\r\n lmm = len(ans)\r\n for i in range(1,lmm):\r\n print(ans[i]-ans[i-1],end=\" \")\r\n print(n-ans[-1])", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i] = (a[i], i)\r\na.sort(key=lambda x: x[0], reverse=True)\r\nbest = a[:k]\r\nbest.sort(key=lambda x: x[1])\r\nsumm = 0\r\nfor i in range(k):\r\n summ += best[i][0]\r\nprint(summ)\r\nif len(best) == 1:\r\n print(n)\r\nelse:\r\n print(best[0][1] + 1, end=' ')\r\n for i in range(1, k):\r\n if i != k - 1:\r\n print(best[i][1] - best[i - 1][1], end=' ')\r\n else:\r\n print(n - best[i - 1][1] - 1)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na2 = sorted(a, reverse=True)\r\nx = [0 for i in range(n)]\r\nfor i in range(k):\r\n for j in range(n):\r\n if a[j] == a2[i] and x[j] == 0:\r\n x[j] = 1\r\n break\r\n# print(\"x =\", x)\r\n\r\nans = []\r\ncnt_biggest = 0\r\ncnt_element = 0\r\nfor i in range(n):\r\n if x[i] > 0:\r\n if cnt_biggest == 0:\r\n cnt_biggest += 1\r\n cnt_element += 1\r\n else:\r\n ans.append(cnt_element)\r\n cnt_element = 1\r\n else:\r\n cnt_element += 1\r\n # if x[i] > 0:\r\n # if cnt == 0:\r\n # cnt += 1\r\n # else:\r\n # ans.append(cnt)\r\n # cnt = 1\r\n # else:\r\n # cnt += 1\r\nans.append(cnt_element)\r\nprint(sum(a2[:k]))\r\nprint(*ans)", "\r\n\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nbs = [[x,i+1] for i,x in enumerate(arr)]\r\nbs.sort(reverse=True)\r\ncs = [bs[i][1] for i in range(k)]\r\nans = sum(bs[i][0] for i in range(k))\r\ncs.sort()\r\nprint(ans)\r\nif k==1:\r\n print(n)\r\nelse:\r\n print(cs[0],end=\" \")\r\n\r\n for i in range(1,k-1):\r\n print(cs[i]-cs[i-1],end=\" \")\r\n print(n-cs[k-2])\r\n", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\n#for _ in range(int_inp()):\nn,k=map(int,input().split())\na=list(map(int,input().split()))\nfor i in range(n):\n a[i]=(a[i],i)\na=[x for x in reversed(sorted(a))]\nb=[]\ns=0\nfor i in range(k):\n b+=[a[i][1]]\n s+=a[i][0]\nprint(s)\nb=sorted(b)\nb[k-1]=n-1\np=-1\nfor x in b:\n print(x-p,end=' ')\n p=x\n", "n, k = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nsorte = sorted(arr)\r\nsorte.reverse()\r\nlis = sorte[:k]\r\nans1 = sum(lis)\r\nind = []\r\ndone = []\r\nfor item in lis:\r\n if item in done:\r\n continue\r\n done.append(item)\r\n g = [i for i, e in enumerate(arr) if e == item]\r\n for obj in g:\r\n ind.append(obj)\r\nind = ind[:k]\r\nind.append(n)\r\nind.sort()\r\nind[0] = 0\r\nprint(ans1)\r\nfor i in range(k):\r\n print(ind[i+1] - ind[i], end=' ')", "def solve(n,k,a):\r\n if k==1:print(max(a));print(n);return 0\r\n p = sorted(a)[n - k:n];ind = []\r\n ind=[a.index(p[0])]\r\n for i in range(1,k):\r\n if p[i]==p[i-1]:ind.append(a.index(p[i-1],ind[i-1]+1,n))\r\n else: ind.append(a.index(p[i]))\r\n ind = sorted(ind);ans = [ind[0]+1]\r\n for j in range(1,k-1):\r\n ans.append(ind[j]-ind[j-1])\r\n ans.append(n-sum(ans))\r\n print(sum(p));print(*ans)\r\nn,k=map(int,input().split());a=list(map(int,input().split()));solve(n,k,a)", "b=list(map(int, input().split()))\r\na=list(map(int, input().split()))\r\nn=b[0]\r\nk=b[1]\r\nif k==1:\r\n print(max(a))\r\n print(n)\r\nelif k==n:\r\n print(sum(a))\r\n r=[1]*n\r\n print(' '.join(map(str, r)))\r\nelse:\r\n c=a[::]\r\n c.sort()\r\n c.reverse()\r\n d=c[:k]\r\n #print(d)\r\n s=sum(d)\r\n e=[b[0] for b in sorted(enumerate(a),key=lambda i:i[1])]\r\n e.reverse()\r\n e1=e[:k]\r\n e1.append(-1)\r\n e1.sort()\r\n p=e1[-1]\r\n q=[t - s for s, t in zip(e1, e1[1:])]\r\n p1=q[-1]\r\n p2=n-1-p\r\n p1=p1+p2\r\n q.pop(-1)\r\n q.append(p1)\r\n print(s)\r\n print(' '.join(map(str, q)))\r\n ", "import heapq\r\n\r\ndef max_profit(arr, n , k):\r\n \"\"\"\r\n Basically to find the overall profit, we can just use the heapq \r\n \"\"\"\r\n klargest = heapq.nlargest(k, arr)\r\n #print(klargest)\r\n print(sum(klargest))\r\n\r\n size = 0\r\n result = []\r\n\r\n for c in arr:\r\n if c in klargest:\r\n klargest.remove(c)\r\n result.append(size+1)\r\n size = 0\r\n else:\r\n size += 1 \r\n # Appending the remaining\r\n result[-1] += size\r\n \r\n print(*result)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n max_profit(arr, n, k)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr1=sorted(arr)\r\nk1=arr1[n-k:];ans=[];sett=set();last=-1\r\nd={}\r\nfor i in k1:\r\n d[i]=d.get(i,0)+1\r\n#print(d)\r\nfor i in range(n):\r\n if d.get(arr[i],0)>0:\r\n ans.append(i)\r\n d[arr[i]]=d.get(arr[i],0)-1\r\nans1=[]\r\n#print(d)\r\nans1.append(ans[0]+1)\r\n#print(ans)\r\nfor i in range(1,len(ans)):\r\n ans1.append(ans[i]-ans[i-1])\r\nans1[-1]+=n-1-ans[-1]\r\nprint(sum(k1))\r\nprint(*ans1)\r\n", "z,R=input,lambda:map(int,z().split());n,k=R()\r\na=sorted(zip(R(),range(n)))[-k:]\r\nprint(sum(x[0]for x in a))\r\nb=sorted(x[1]for x in a)+[n];b[0]=0\r\nprint(*(y-x for x,y in zip(b,b[1:])))", "n, k = map(int,input().split())\ninpl = input().split()\npdl = [(int(inpl[i]), i+1) for i in range(n)]\npdl.sort(reverse=True,key=lambda x: x[0])\npdkl = pdl[:k]\nt = 0\nfor i in pdkl:\n t += i[0]\nprint(t)\npdkl.sort(key=lambda x: x[1])\nt = 0\nfor i in pdkl[:-1]:\n print(i[1]-t,end=' ')\n t = i[1]\nprint(n-t)\n", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,pi,inf\r\nfrom collections import deque,defaultdict\r\nfrom bisect import bisect,bisect_left\r\nfrom itertools import permutations as per\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(str(x)+'\\n')\r\nnCr=lambda x,y:(f[x]*inv((f[y]*f[x-y])%N))%N\r\n\r\nn,k=R()\r\na=sorted(sorted(enumerate(R(),1),reverse=True,key=lambda x:x[1])[:k],key=lambda x:x[0])\r\nans=[]\r\nsm=0\r\np=0\r\nfor i in a:\r\n\tsm+=i[1]\r\n\tans+=i[0]-p,\r\n\tp=i[0]\r\nans[-1]+=n-a[-1][0]\r\nprint(sm)\r\nprint(*ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nRead = lambda: list(map(int, input().split()))\r\nNum = lambda: int(input())\r\n\r\n\r\ndef solve():\r\n n, k = Read()\r\n a = Read()\r\n\r\n b = list(enumerate(a))\r\n b.sort(key=lambda i: i[1])\r\n\r\n tot = 0\r\n need = []\r\n for i in b[-k:]:\r\n tot += i[1]\r\n need.append(i[0])\r\n\r\n need.sort()\r\n # print(need)\r\n\r\n ans = [a[i:j] for i, j in zip([0] + need, need + [None])]\r\n ans[0] = ans[0] + ans[1]\r\n ans.pop(1)\r\n\r\n print(tot)\r\n for i in ans:\r\n print(len(i), end=\" \")\r\n print()\r\n\r\n\r\nsolve()\r\n", "n,k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = sorted(a)\r\n\r\nd = {}\r\nfor i in range(n-k,n):\r\n if b[i] not in d:\r\n d[b[i]] = 1\r\n else:\r\n d[b[i]] += 1\r\nres = sum(b[n-k:])\r\nprint(res)\r\ncur = 0\r\ndays = []\r\nfor i in range(n):\r\n cur += 1\r\n if a[i] in d:\r\n if d[a[i]] == 1:\r\n d.pop(a[i])\r\n else:\r\n d[a[i]] -= 1\r\n days.append(cur)\r\n cur = 0\r\ndays[-1] = n - sum(days[:k - 1])\r\nprint(*days)\r\n\r\n", "n,k=[int(x) for x in input().split(\" \")]\r\na=[int(x) for x in input().split(\" \")]\r\nmark,b=[],[]\r\nfor x in a:\r\n b.append(x)\r\n mark.append(False)\r\nb.sort(reverse=True)\r\nidx,profit=0,0\r\nwhile idx<k:\r\n profit+=b[idx]\r\n for i in range(n):\r\n if not mark[i] and a[i]==b[idx]:\r\n mark[i]=True\r\n break\r\n idx+=1\r\nprint(profit)\r\nprev,counter=-1,0\r\nfor i in range(n):\r\n if counter==(k-1):\r\n break\r\n if mark[i]:\r\n print(i-prev,end=' ')\r\n prev=i\r\n counter+=1\r\nprint(n-prev-1)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif k == 1:\r\n print(max(a))\r\n print(n)\r\nelse:\r\n maxs = []\r\n ans = []\r\n b = a.copy()\r\n a.sort()\r\n for i in range(1,k+1):\r\n maxs.append(a[-i])\r\n\r\n print(sum(maxs))\r\n left = 0\r\n for i in range(len(maxs)):\r\n m = b.index(maxs[i])\r\n maxs[i] = [maxs[i], m]\r\n b[m] -= 10000\r\n maxs.sort(key=lambda x:x[1])\r\n maxs.append([0, n])\r\n # print(maxs[0][1]+1)\r\n for i in range(1, len(maxs)):\r\n ind = maxs[i][1]\r\n print(ind-left, end=\" \")\r\n left = ind", "n, k = map(int, input().split())\r\nli = sorted(list(enumerate(map(int, input().split()))), key=lambda x:-x[1])\r\nx = sorted(li[:k], key=lambda x: x[0])\r\n\r\nc = 0\r\nans = [0]*k\r\n\r\nlast = 0\r\nfor i in range(k-1):\r\n j, v = x[i]\r\n ans[i] = j - last + 1\r\n last = j + 1\r\n c += v\r\n\r\nans[-1] = n - last\r\nc += x[-1][1]\r\n\r\nprint(c)\r\nprint(*ans)", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(sorted(a))\r\nans=[]\r\n\r\nsm = 0\r\nfor i in range(n-1, n-k-1, -1):\r\n sm += b[i]\r\n x = a.index(b[i])\r\n ans.append(x)\r\n a[x] = -1\r\nans.sort()\r\nprint(sm)\r\n\r\nans= [-1] + ans\r\nfor i in range(1, len(ans) - 1):\r\n print(ans[i] - ans[i-1], end=\" \")\r\nprint(n - ans[-2] - 1)", "def question2():\r\n total_problems,Days = map(int,input().split())\r\n difficulty_of_prob = list(map(int,input().split()))\r\n problem_with_index = []\r\n for i in range(total_problems):\r\n problem_with_index.append([difficulty_of_prob[i],i])\r\n problem_with_index.sort(key = lambda x:x[0],reverse=True)\r\n index_in_days = []\r\n total_profit = 0\r\n for i in range(Days):\r\n index_in_days.append(problem_with_index[i][1])\r\n total_profit += problem_with_index[i][0]\r\n index_in_days.sort()\r\n print(total_profit)\r\n per_day_prob = []\r\n per_day_prob.append(index_in_days[0]+1)\r\n last = index_in_days[0]\r\n for i in range(1,len(index_in_days)):\r\n per_day_prob.append(index_in_days[i]-(last))\r\n last = index_in_days[i]\r\n \r\n \r\n if index_in_days[-1] != total_problems-1:\r\n per_day_prob[-1] += total_problems - 1 - index_in_days[-1]\r\n return per_day_prob \r\n \r\n \r\n \r\n \r\nremained_test_cases = 1 \r\n# remained_test_cases = int(input())\r\nwhile remained_test_cases > 0:\r\n print(*question2())\r\n remained_test_cases -= 1 ", "from sys import stdin, stdout\r\nfrom heapq import heappush,heappop\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\n\r\nfor _ in range(1):#nmbr()):\r\n # n=nmbr()\r\n n,k=lst()\r\n a=lst()\r\n biggest=[]\r\n l=sorted([[a[i], i] for i in range(n)], reverse=1)\r\n ind=set([i for j,i in l[:k]])\r\n # print(ind)\r\n ans=[]\r\n cnt=1\r\n mx=0\r\n for i in range(n):\r\n if i in ind:\r\n ans+=[cnt]\r\n mx+=a[i]\r\n cnt=1\r\n else:\r\n cnt+=1\r\n print(mx)\r\n ans[-1]+=n-sum(ans)\r\n print(*ans)", "from functools import cmp_to_key\r\ndef cmp(a, b):\r\n if a[0] != b[0]:\r\n return b[0] - a[0]\r\n else:\r\n return a[1] - b[1]\r\n\r\n\r\ndef cmp1(a, b):\r\n return a[1] - b[1]\r\n\r\n# Input\r\nn, k = map(int, input().split())\r\nar = list(map(int, input().split()))\r\n\r\n# Creating pairs and sorting\r\nv = [(ar[i], i) for i in range(n)]\r\nv.sort(key=cmp_to_key(cmp))\r\n\r\nkv = []\r\nprof = 0\r\nfor i in range(k):\r\n prof += v[i][0]\r\n kv.append((v[i][0], v[i][1]))\r\n\r\nprint(prof)\r\nif k == 1:\r\n print(n)\r\nelse:\r\n kv.sort(key=cmp_to_key(cmp1))\r\n print(kv[1][1], end=' ')\r\n for i in range(1, k - 1):\r\n print(kv[i + 1][1] - kv[i][1], end=' ')\r\n print(n - kv[k - 1][1])\r\n", "\r\nI = lambda: map(int, input().split())\r\nINT = lambda: int(input())\r\n\r\n##T = INT()\r\nT = 1\r\nfor _ in range(T):\r\n n, k = I()\r\n a = list(I())\r\n a = sorted([(a[i], i) for i in range(n)], reverse=True)[:k]\r\n print(sum([v for v, i in a]))\r\n a = sorted([i for v, i in a])\r\n a[-1] = n - 1\r\n print(\" \".join(str(y - x) for x, y in zip([-1] + a, a)))\r\n", "import math\r\nfrom collections import defaultdict\r\n\r\n\r\ndef sol():\r\n n,k = map(int , input().split())\r\n a = list(map(int, input().split()))\r\n\r\n b = []\r\n for i in range(n):\r\n b.append([a[i],i])\r\n\r\n b.sort(reverse = True)\r\n c = b[:k]\r\n\r\n c.sort(key = lambda x : x[1])\r\n print(sum([cc[0] for cc in c]))\r\n tot = 0\r\n for i in range(k-1):\r\n if i == 0:\r\n print(c[i][1]+1, end = ' ')\r\n tot += c[i][1]+1\r\n else:\r\n print(c[i][1]-c[i-1][1], end = ' ')\r\n tot += c[i][1]-c[i-1][1]\r\n print(n-tot)\r\n \r\ndef main():\r\n for _ in range(1):\r\n sol()\r\n \r\nmain()\r\n", "# full logic before coding\r\n\r\n# test_cases = int(input())\r\n\r\n# for test_case in range(test_cases):\r\nimport heapq\r\n\r\nn, k = map(int, input().split())\r\ninplist = list(map(int, input().split()))\r\n\r\nmylargest = heapq.nlargest(k, inplist)\r\nmysum = sum(mylargest)\r\n\r\nmyretlist = []\r\nnumproblems = 0\r\n\r\nfor i in range(n):\r\n numproblems += 1\r\n mybr = 0\r\n cur_len = len(mylargest)\r\n for j in range(cur_len):\r\n if mylargest[j] == inplist[i]:\r\n mylargest.pop(j)\r\n cur_len -= 1\r\n mybr = 1\r\n break\r\n if mybr == 1:\r\n if cur_len != 0:\r\n myretlist.append(str(numproblems))\r\n else:\r\n myretlist.append(str(numproblems + (n - i - 1)))\r\n numproblems = 0\r\n\r\nprint(mysum)\r\nmyret = \" \".join(myretlist)\r\nprint(myret)", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(sorted(a))\r\nans=[]\r\ns=0\r\nfor i in range(n-1,n-k-1,-1):\r\n\ts+=b[i]\r\n\tx=a.index(b[i])\r\n\tans.append(x)\r\n\ta[x]=-1\r\nans.sort()\r\nprint(s)\r\nans=[-1]+ans\r\nfor i in range(1,len(ans)-1):\r\n\tprint(ans[i]-ans[i-1],end=' ')\r\nprint(n-ans[-2]-1)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nimport random\r\nfrom bisect import bisect_right, bisect_left\r\nfrom itertools import product, permutations, combinations, combinations_with_replacement \r\nfrom collections import deque, defaultdict, Counter\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache, reduce\r\ninf = float('inf')\r\ndef error(*args, sep=' ', end='\\n'):\r\n print(*args, sep=sep, end=end, file=sys.stderr)\r\n# mod = 1000000007\r\n# mod = 998244353\r\nDIR = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n\r\n# ----------------------- #\r\n\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nB = sorted(A, reverse=True)\r\nused = B[:k]\r\ns = sum(used)\r\nans = [-1]\r\nfor i in range(n):\r\n if A[i] in used:\r\n ans.append(i)\r\n used.remove(A[i])\r\nans[-1] += (n-1-ans[-1])\r\nB = [0] * (k+1)\r\nfor i in range(1, k+1):\r\n B[i] = ans[i] - ans[i-1]\r\nB.pop(0)\r\nprint(s)\r\nprint(*B)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(a)\r\nb.sort()\r\nc=[]\r\nsum=0\r\nfor i in range(1,k+1):\r\n\tc.append(b[-i])\r\n\tsum+=b[-i]\r\nprint(sum)\r\nd=[]\r\nfor i in range(n):\r\n\tif a[i] in c:\r\n\t\td.append(i)\r\n\t\tc.remove(a[i])\r\n\telse:\r\n\t\tpass\r\nd.insert(0,-1)\r\nd[-1]=n-1\r\ne=[]\r\nfor i in range(1,len(d)):\r\n e.append(d[i]-d[i-1])\r\nprint(\" \".join(map(str,e)))", "n,k=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nA = sorted([(x,i) for i,x in enumerate(A)],key = lambda x: (x[0],x[1]))\r\nused = A[-k:]\r\ns=sum(x[0] for x in used)\r\ndays=sorted(x[1] for x in used)\r\nprint(s)\r\nd=[]\r\nt=0\r\nfor x in days[:-1]:\r\n d.append(x-t+1)\r\n t=x+1\r\nd.append(n-t)\r\nprint(*d)", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import add\r\nfrom itertools import accumulate\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn, k = r()\r\narr = rr()\r\nbrr = list(enumerate(arr, 1))\r\nbrr.sort(key=lambda x: x[1], reverse=True)\r\n\r\npos = [i for i, j in brr[:k]]\r\nans = sum([j for i, j in brr[:k]])\r\npos.sort()\r\npos[-1] = n\r\npos = [0] + pos\r\nprint(ans)\r\nfor i in range(1, len(pos)):\r\n print(pos[i] - pos[i - 1], end=\" \")\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\n\r\ninput = sys.stdin.readline\r\ndef inar():\r\n return [int(el) for el in input().split()]\r\ndef main():\r\n n,k=inar()\r\n arr=inar()\r\n new=arr.copy()\r\n new=[]\r\n ans=0\r\n for i in range(n):\r\n new.append((arr[i],i))\r\n new.sort(reverse=True)\r\n check=[0]*n\r\n for i in range(k):\r\n ans+=new[i][0]\r\n check[new[i][1]]=1\r\n count=0\r\n res=[]\r\n #print(check)\r\n for i in range(n):\r\n if check[i]==1:\r\n count+=1\r\n res.append(count)\r\n count=0\r\n else:\r\n count+=1\r\n res[-1]+=count\r\n print(ans)\r\n print(*res)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n", "n,k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = []\r\nfor i, a in enumerate(A):\r\n B.append((a, i))\r\nB.sort(reverse=True)\r\nB = B[0:k]\r\nidx = []\r\nans = 0\r\nfor a, i in B:\r\n idx.append(i)\r\n ans += a\r\nidx.sort()\r\n#print(idx)\r\ns = []\r\npre = -1\r\nfor j in range(len(idx)):\r\n i = idx[j]\r\n if j != len(idx)-1:\r\n s.append(i-pre)\r\n pre = i\r\n else:\r\n s.append(n-1-pre)\r\nprint(ans)\r\nprint(*s)\r\n", "n,k =map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nb=b[n-k:]\r\nprint(sum(b))\r\nc=set(b)\r\nlast=0\r\ni=0\r\n\r\nwhile i<n and k>1:\r\n if a[i] in c:\r\n b.remove(a[i])\r\n c=set(b)\r\n print(i-last+1, end=\" \")\r\n last=i+1\r\n k-=1\r\n i+=1\r\nprint(n-last)\r\n", "n,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\narr=lst.copy()\r\narr.sort(reverse=True)\r\nvis=[0]*n\r\nsumm=0\r\nfor i in range(m):\r\n temp=arr[i]\r\n summ+=temp\r\n for j in range(n):\r\n if vis[j]==0 and lst[j]==temp:\r\n vis[j]=1\r\n \r\n break\r\n\r\nprint(summ)\r\ncnt=0\r\nans=[]\r\nfor i in range(n):\r\n if vis[i]==1:\r\n ans.append(cnt+1)\r\n cnt=0\r\n else:\r\n cnt+=1\r\nans[-1]+=cnt\r\nprint(*ans)", "def main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = a.copy()\r\n b.sort()\r\n sum_ = 0\r\n j = n - k\r\n b = b[j: n]\r\n for i in range(n - j):\r\n sum_ += b[i]\r\n count = 0\r\n ans = []\r\n for i in range(n):\r\n if a[i] in b:\r\n j = b.index(a[i])\r\n b.pop(j)\r\n if len(b) == 0:\r\n ans.append(str(abs(count - n)))\r\n else:\r\n ans.append(str(abs(count - i - 1)))\r\n\r\n count = i + 1\r\n s_ans = ' '.join(ans)\r\n print(sum_)\r\n print(s_ans)\r\n\r\n\r\nmain()", "import math\r\n#from decimal import *\r\n#from collections import deque\r\n\r\ndef transformare_baza(numar,baza):\r\n \r\n transformare=\"\"\r\n while numar>=baza:\r\n rest=numar%baza\r\n numar=numar//baza\r\n transformare+=str(rest)\r\n \r\n transformare+=str(numar)\r\n noua_baza=transformare[::-1]\r\n return noua_baza\r\n \r\n \r\ndef produs_cifre(numar):\r\n \r\n produs=1\r\n for i in numar:\r\n produs=produs*int(i)\r\n return (produs)\r\n \r\n#def prime_generator(nr_elemente_prime):\r\n \r\n #vector_prime=[-1]*nr_elemente_prime\r\n #vector_rasp=[0]*nr_elemente_prime\r\n \r\n #vector_prime[1]=1\r\n \r\n #vector_rasp[1]=1\r\n#primes sieve \r\n #contor=2\r\n \r\n #for i in range(2,nr_elemente_prime):\r\n # if vector_prime[i]==-1:\r\n # vector_prime[i]=1\r\n # vector_rasp[contor]=i\r\n # contor=contor+1\r\n # for j in range(i+i,nr_elemente_prime,i):\r\n # if vector_prime[j]==-1:\r\n # vector_prime[j]=i\r\n #print(i,j) \r\n \r\n# my_set=set(vector_rasp)\r\n #my_set.remove(0)\r\n #my_set.remove(1)\r\n pr\r\n #lista_prime=list(my_set)\r\n #lista_prime.sort()\r\n #return my_set\r\n\r\n\r\ndef bitwise_xor(a,b):\r\n stringul_1=transformare_baza(a,2)\r\n stringul_2=transformare_baza(b,2)\r\n \r\n lungime=max(len(stringul_1), len(stringul_2))\r\n raspunsul=0\r\n #print(stringul_1,stringul_2)\r\n \r\n str_answ=[0]*lungime\r\n# print('lungime=', lungime)\r\n \r\n #print(str_answ)\r\n \r\n for i in range(0,lungime):\r\n # print(i,str_answ)\r\n j=lungime-1-i\r\n if len(stringul_1)>i and len(stringul_2)>i:\r\n if stringul_1[len(stringul_1)-1-i]!= stringul_2[len(stringul_2)-1-i]:\r\n raspunsul+=2**(i)\r\n str_answ[i]='1'\r\n elif len(stringul_1)>i and stringul_1[len(stringul_1)-1-i]=='1':\r\n raspunsul+=2**(i)\r\n str_answ[i]='1'\r\n elif len(stringul_2)>i and stringul_2[len(stringul_2)-1-i]=='1':\r\n raspunsul+=2**(i)\r\n str_answ[i]='1'\r\n \r\n #print(str_answ)\r\n \r\n return raspunsul\r\n \r\n \r\ndef bitwise_and(a,b):\r\n stringul_1=transformare_baza(a,2)\r\n stringul_2=transformare_baza(b,2)\r\n \r\n lungime=max(len(stringul_1), len(stringul_2))\r\n raspunsul=0\r\n #print(stringul_1,stringul_2)\r\n \r\n str_answ=[0]*lungime\r\n# print('lungime=', lungime)\r\n \r\n #print(str_answ)\r\n \r\n for i in range(0,lungime):\r\n # print(i,str_answ)\r\n j=lungime-1-i\r\n if len(stringul_1)>i and len(stringul_2)>i:\r\n if stringul_1[len(stringul_1)-1-i]=='1' and stringul_2[len(stringul_2)-1-i]=='1':\r\n raspunsul+=2**(i)\r\n str_answ[i]='1'\r\n else:\r\n str_answ[i]='0'\r\n \r\n #print(str_answ)\r\n \r\n return raspunsul\r\n\r\n\r\n\r\n#z=int(input())\r\nfor contor in range(0,1):\r\n\r\n n,k=list(map(int,input().split()))\r\n #n=int(input())\r\n lista=list(map(int,input().split()))\r\n \r\n if k==1:\r\n \r\n print(max(lista))\r\n print(n)\r\n \r\n else:\r\n my_dict={}\r\n vector=sorted(lista)\r\n pozitie=-1\r\n last=-1\r\n \r\n print(sum(vector[n-k:n]))\r\n for i in vector[n-k:n]:\r\n if i in my_dict:\r\n my_dict[i]+=1\r\n else:\r\n my_dict[i]=1\r\n \r\n cate=k\r\n \r\n for i in range(0,n):\r\n if lista[i] in my_dict:\r\n if my_dict[lista[i]]>0:\r\n my_dict[lista[i]]-=1\r\n cate-=1\r\n if cate==0:\r\n #print(\"i=\",i,last,cate,lista[i])\r\n print(int(n-1-last),end=' ')\r\n else: \r\n #print(\"i=\",i,last,cate,lista[i])\r\n print(i-last,end=' ')\r\n last=i\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "\r\nfrom sys import stdin, stdout\r\ndef main():\r\n n, k = map(int, stdin.readline().strip().split())\r\n A = list(map(int, stdin.readline().strip().split()))\r\n req = sorted(A)[-1*k:]\r\n index = {}\r\n for j,i in enumerate(A):\r\n if index.get(i,-1) == -1:\r\n index[i] = [j]\r\n else:\r\n index[i].append(j)\r\n b = {}\r\n t = []\r\n outputs =[]\r\n for i in req:\r\n t.append(index.get(i)[b.get(i,0)])\r\n b[i] = b.get(i,0) + 1\r\n t.sort()\r\n if k ==1:\r\n outputs.append(str(n))\r\n else :\r\n for i,j in enumerate(t):\r\n if i == 0:\r\n outputs.append(str(j+t[i+1]-j))\r\n elif i == k-1:\r\n outputs.append(str(n-j))\r\n else:\r\n outputs.append(str(t[i+1]-j))\r\n print(sum(req))\r\n print(' '.join(outputs))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n\r\n", "n,k=[int(x) for x in input().split(' ')]\nz=[int(x) for x in input().split(' ')]\nzz=z[::-1]\nzz.sort()\nzz.reverse()\nind=[]\nc=0\ns=0\n\nfor x in zz:\n c+=1\n ind.append(z.index(x))\n z[z.index(x)]=-1\n s+=x\n if c==k:\n break\nind.sort()\nprint(s)\n#print(*ind)\nif k==1:\n print(n)\nelse:\n for i in range(k):\n if i==0:\n print(ind[i]+1,end=' ')\n elif i!=k-1:\n print(ind[i]-ind[i-1],end=' ')\n else:\n print(n-1-ind[k-2])", "n,k=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nl1=sorted(l,reverse=True)\r\nl1=l1[:k]\r\ns=sum(l1)\r\nprint(s)\r\nl2=[]\r\nk1=0\r\nprev=0\r\nfor i in range(n):\r\n if(k1==k-1):\r\n l2.append(n-i)\r\n break\r\n if(l[i] in l1):\r\n l1[l1.index(l[i])]=-1\r\n if(k1==0):\r\n l2.append(i-prev+1)\r\n else:\r\n l2.append(i-prev)\r\n k1+=1\r\n prev=i\r\nprint(*l2)", "a=int(input().split()[1])\r\nz=list(map(int,input().split()))\r\ns=0;r=[0]\r\nwhile(a):\r\n s+=max(z)\r\n r+=[z.index(max(z))+1]\r\n z[z.index(max(z))]=-1\r\n a-=1\r\nprint(s);s=0;r=sorted(r)\r\nr[-1]=len(z)\r\nfor i in range(1,len(r)):print(r[i]-r[i-1],end=\" \")", "n, k = map(int, input().split())\r\nara = list(map(int, input().strip().split()))\r\nsorted_ara = sorted(ara)\r\nsorted_ara.reverse()\r\n\r\nans = []\r\nfor i in range(k):\r\n ans.append(sorted_ara[i])\r\nprint(sum(ans))\r\n\r\nsegment = []\r\ncount = 0\r\n\r\nfor i in range(n):\r\n count += 1\r\n if ara[i] in ans:\r\n ans.remove(ara[i])\r\n segment.append(count)\r\n count = 0\r\n\r\ntotal_element = sum(segment)\r\nif total_element < n:\r\n segment[k - 1] += n - total_element\r\nprint(*segment, sep=\" \")\r\n", "def max_profit(n,k,l,d):\r\n a=[]\r\n p,i=0,-1\r\n while(len(a)!=k-1):\r\n p+=1\r\n i+=1\r\n if l[i] in d:\r\n a.append(p)\r\n p=0\r\n d.remove(l[i])\r\n a.append(n-sum(a))\r\n print(*a)\r\n\r\n\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=sorted(l,reverse=True)[:k]\r\nprint(sum(d))\r\nmax_profit(n,k,l,d)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\np=sorted(arr)\r\ntemp=0\r\nans=[]\r\ns=0\r\nq={}\r\np=p[-k:]\r\nfor el in p:\r\n if el not in q:\r\n q[el]=0\r\n q[el]+=1\r\n s+=el\r\nfor el in arr:\r\n temp+=1\r\n if el in q and q[el]>0 and k>1:\r\n q[el]-=1\r\n ans.append(temp)\r\n temp=0\r\n k-=1\r\nans.append(temp)\r\nprint(s)\r\nprint(*ans)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nif(k==1):\r\n\tprint(max(arr))\r\n\tprint(n)\r\n\texit()\r\narr1=sorted(arr)\r\narr1=arr1[n-k:]\r\nprint(sum(arr1))\r\nini=-1\r\nlens=[]\r\nfor i in range(n):\r\n\tif(arr[i] in arr1):\r\n\t\tarr1.remove(arr[i])\r\n\t\tif(len(arr1)==0):\r\n\t\t\tlens.append(i-ini+(n-1-i))\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tlens.append(i-ini)\r\n\t\t\tini=i\r\nprint(*lens)\r\n", "import sys\r\nimport os.path\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nn,k=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nB=[]\r\nfor i,a in enumerate(A):\r\n B.append((a,i))\r\nB.sort(reverse=True)\r\nidx=[]\r\nans=0\r\nB=B[0:k]\r\nfor a,i in B:\r\n idx.append(i)\r\n ans+=a\r\nidx.sort()\r\n\r\ns=[]\r\npre=-1\r\nfor j in range(len(idx)):\r\n i=idx[j]\r\n if j != len(idx)-1:\r\n s.append(i-pre)\r\n pre=i\r\n #print(i,end=\" \")\r\n else:\r\n s.append(n-1-pre)\r\nprint(ans)\r\nprint(*s)", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\ntemp = sorted(a, reverse = True)\r\ng = []\r\nfor i in range(k):\r\n\tg.append(temp[i])\r\nprint(sum(g))\r\ncurr = 0\r\ni = 0\r\nwhile i < len(a):\r\n\tcurr += 1\r\n\tif a[i] in g: \r\n\t\tg.remove(a[i])\r\n\t\tif len(g) == 0:\r\n\t\t\tprint(curr+len(a)-i-1)\r\n\t\telse:\r\n\t\t\tprint(curr, end = \" \")\r\n\t\tcurr = 0 \r\n\ti += 1\r\n\r\n", "k,n = map(int,input().split())\r\nz = 0\r\np = 0\r\nq = []\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n m = a.index(max(a))\r\n p += a[m]\r\n q.append(m)\r\n a[m]=0\r\nq.sort()\r\nprint(p)\r\nfor i in range(n-1):\r\n print(len(a[z:q[i]+1]),end = \" \")\r\n z = q[i]+1\r\nprint(len(a[z:k]))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nli = sorted([(val, i+1) for i, val in enumerate(a)], reverse=True)[:k]\r\nprint(sum(elem[0] for elem in li))\r\nli = sorted([elem[1] for elem in li], reverse=True) + [0]\r\nli[0] = n\r\nprint(*reversed([x-y for x,y in zip(li, li[1:])]))", "#t=int(input())\r\nn,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nl=[]\r\nl[:]=lst[:]\r\nl.sort(reverse=True)\r\nl=l[:k]\r\nprint(sum(l))\r\nc=[]\r\nj=0\r\nc1=0\r\nfor i in range(n):\r\n if j==k-1:\r\n c.append(n-i)\r\n break\r\n elif lst[i] in l:\r\n c1+=1\r\n c.append(c1)\r\n del l[l.index(lst[i])]\r\n j+=1\r\n c1=0\r\n else:\r\n c1+=1\r\nfor j in range(len(c)):\r\n print(c[j],end=\" \") ", "R=lambda:map(int,input().split())\nn,k=R()\na=sorted(zip(R(),range(n)))[-k:]\nprint(sum(x[0]for x in a))\nb=sorted(x[1]for x in a)+[n]\nb[0]=0\nprint(*(y-x for x,y in zip(b,b[1:])))#sgeheher\n \t\t\t\t \t \t\t \t\t \t\t \t\t \t \t \t\t \t\t", "n,k=map(int,input().split())\r\nnlist=list(map(int,input().split()))\r\nvalue=[-float('inf')]*k\r\npo=[-1]*k\r\nfor i in range(n):\r\n for j in range(k):\r\n if value[j]<nlist[i] and value[j]==-float('inf'):\r\n value[j]=nlist[i]\r\n po[j]=i\r\n break\r\n if value[j]<nlist[i] and value[j]!=-float('inf'):\r\n for l in range(k-1,j,-1):\r\n value[l]=value[l-1]\r\n po[l]=po[l-1]\r\n value[j]=nlist[i]\r\n po[j]=i\r\n break\r\nprint(sum(value))\r\npo.sort()\r\nans=[]\r\nif k==1:\r\n print(n)\r\nelse:\r\n ans.append(po[0]+1)\r\n for i in range(1,k-1):\r\n ans.append(po[i]-po[i-1])\r\n ans.append(n-1-po[k-2])\r\n print(' '.join([str(x) for x in ans]))\r\n ", "\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=sorted(enumerate(l),key=lambda x:-x[1])[:k]\r\nans=0\r\nfor i,x in enumerate(l1):\r\n ans+=x[1]\r\nl1.sort()\r\nl2=[]\r\nprint(ans)\r\npre=-1\r\nfor i,x in enumerate(l1[:-1]):\r\n l2.append(x[0]-pre)\r\n pre=x[0]\r\nl2.append(len(l)-1-pre)\r\nprint(*l2)", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nfor t in range(1):\r\n n,k=get_ints()\r\n arr=get_list()\r\n ans=arr.copy()\r\n ans.sort(reverse=True)\r\n ans=ans[:k]\r\n c=k\r\n print(sum(ans))\r\n j = 0\r\n for i in range(n):\r\n if (arr[i] in ans and c != 1):\r\n print(i + 1 - j, end=' ')\r\n j = i + 1\r\n ans.remove(arr[i])\r\n c -= 1\r\n if (c == 1):\r\n print(n - j)\r\n break", "n,k=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\ntemp1=list.copy()\r\ntemp1.sort(reverse=True)\r\nsom=0\r\ntemp2=[]\r\nfor i in range(0,k):\r\n temp2.append(list.index(temp1[i]))\r\n list[list.index(temp1[i])]=-1\r\nfor i in range(0,k):\r\n som+=temp1[i]\r\nprint(som)\r\ntemp2.sort()\r\nif(k!=1):\r\n print(temp2[0]+1,end=\" \")\r\n for i in range(1,k-1):\r\n print(temp2[i]-temp2[i-1],end=\" \")\r\n print(n-temp2[k-2]-1)\r\nelse:\r\n print(n)", "def main():\r\n n, k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n\r\n if k == 1:\r\n print(max(arr))\r\n print(n)\r\n else:\r\n k_max_elements = list(sorted(arr))[-k:]\r\n\r\n temp_dict = {}\r\n for element in k_max_elements:\r\n if element in temp_dict:\r\n temp_dict[element] += 1\r\n else:\r\n temp_dict[element] = 1\r\n\r\n max_indices = []\r\n for i in range(n):\r\n if arr[i] in temp_dict and temp_dict[arr[i]] > 0:\r\n max_indices.append(i)\r\n temp_dict[arr[i]] -= 1\r\n\r\n print(sum(k_max_elements))\r\n answer_arr = []\r\n for i in range(len(max_indices)):\r\n if i == 0:\r\n answer_arr.append(max_indices[i] + 1)\r\n elif i == len(max_indices) - 1:\r\n answer_arr.append(n - max_indices[i - 1] - 1)\r\n else:\r\n answer_arr.append(max_indices[i] - max_indices[i - 1])\r\n\r\n print(*answer_arr)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n# suppose the largest elements [2,2,3,3], it will give bugs when finding the index of these.\r\n# wrong answer\r\n", "# Идея задачи: сумма первых k наибольших элементов и есть максимально возможная полезность.\r\n# Количество задач на каждый день будем вычислять так: идем от левого указателя (изначально\r\n# по индексу -1) до тех пор, пока не дойдем до какого-нибудь элемента в максимумах. После того,\r\n# как дошли до такого элемента, считаем длину отрезка от левого указателя до текущего индекса,\r\n# вычеркиваем найденный элемент из максимумов, перемещаем левый указатель справа от текущего\r\n# индекса. Повторяем процесс, пока в максимумах есть элементы. Как только они закончаться,\r\n# прибавляем к последнему дню оставшиеся справа задачи \r\n\r\nn, k = map(int, input().split())\r\nproblems = list(map(int, input().split()))\r\n\r\nmaximums = sorted(problems, reverse=True)[:k]\r\nprint(sum(maximums))\r\n\r\n# Начало отрезка\r\nleft_pointer = -1\r\n# Конец отрезка\r\nright_pointer = 0\r\n\r\nwhile maximums:\r\n if problems[right_pointer] in maximums:\r\n maximums.remove(problems[right_pointer])\r\n if not maximums:\r\n print(right_pointer - left_pointer + n - right_pointer - 1)\r\n else:\r\n print(right_pointer - left_pointer, end = \" \")\r\n left_pointer = right_pointer\r\n right_pointer += 1\r\n\r\n", "n, k = map(int, input().split())\nnth_p = list(map(int, input().split()))\nsor = sorted(nth_p)\nods = []\ncount = od_max = tp_co = 0\n\nfor i in range(n-1, n-k-1, -1):\n count += sor[i]\n i_n = nth_p.index(sor[i])\n ods.append(i_n)\n nth_p[i_n] = -1\n\nprint(count)\nods.sort()\nods = [-1]+ods\nfor i in range(1,len(ods)-1):\n print(ods[i]-ods[i-1], end=' ')\nprint(n-ods[-2]-1)\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n A = [(a, i) for i, a in enumerate(A, 1)]\r\n A.sort(key = lambda x:-x[0])\r\n I = [0]\r\n ans = 0\r\n for a, i in A[:k]:\r\n ans += a\r\n I.append(i)\r\n I.sort()\r\n I.pop()\r\n I.append(n)\r\n print(ans)\r\n print(*(I[i] - I[i - 1] for i in range(1, k + 1)))\r\n \r\n \r\nfor _ in range(1):\r\n main()", "n, k = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\n\r\nB = []\r\nfor i in range(len(A)):\r\n B.append(A[i])\r\nB.sort()\r\n\r\nK = []\r\n\r\nfor i in reversed(range(n-k, n)):\r\n K.append(B[i])\r\n\r\nINDEX = []\r\n\r\nfor i in range(len(K)):\r\n for j in range(len(A)):\r\n if A[j] == K[i] and j not in INDEX:\r\n INDEX.append(j)\r\n break\r\n\r\nINDEX.sort()\r\nINDEX.insert(0, -1)\r\nINDEX.pop()\r\nINDEX.append(len(A)-1)\r\nSUM = sum(K)\r\nprint(SUM)\r\n\r\n\r\nfor i in range(1, len(INDEX)):\r\n print(INDEX[i] - INDEX[i-1], end=' ')", "\r\nfrom sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\nn,k=map(int,input().split())\r\narr=[int(x) for x in input().split()]\r\n\r\nl=[]\r\nfor i in range(n):\r\n l.append((arr[i],i))\r\n\r\nl.sort(reverse=True)\r\n\r\ndp=[]\r\nx=0\r\nfor i in range(k):\r\n dp.append(l[i][1])\r\n x=x+l[i][0]\r\n\r\nprint(x)\r\ndp.sort()\r\ndp=[-1]+dp\r\n\r\nl=len(dp)\r\nfor i in range(1,l-1):\r\n print(dp[i]-dp[i-1],end=\" \")\r\nprint(n-1-dp[l-2]) ", "from collections import deque\r\nimport heapq\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs():\r\n ans = [1] * k\r\n q = deque()\r\n color = [-1] * n\r\n for i in s:\r\n q.append(i)\r\n color[i] = i\r\n while q:\r\n i = q.popleft()\r\n if i - 1 >= 0:\r\n if color[i - 1] == -1:\r\n color[i - 1] = color[i]\r\n ans[r[color[i]]] += 1\r\n q.append(i - 1)\r\n if i + 1 < n:\r\n if color[i + 1] == -1:\r\n color[i + 1] = color[i]\r\n ans[r[color[i]]] += 1\r\n q.append(i + 1)\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nh = []\r\nfor i in range(n):\r\n heapq.heappush(h, (-a[i], i))\r\ns = []\r\nans = 0\r\nfor _ in range(k):\r\n ai, i = heapq.heappop(h)\r\n ans -= ai\r\n s.append(i)\r\nprint(ans)\r\ns.sort()\r\nr = dict()\r\nfor i in range(k):\r\n r[s[i]] = i\r\nans = bfs()\r\nprint(*ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[(a[i],i) for i in range(n)]\r\nb.sort(reverse=True)\r\nuse=[0]*n\r\nans=0\r\nfor i in range(k):\r\n use[b[i][1]]=1\r\n ans+=b[i][0]\r\n\r\nprint(ans)\r\nc=[]\r\nL=-1\r\nfor i in range(n):\r\n if use[i]:\r\n c.append(i-L)\r\n L=i\r\n\r\nc[-1]+=n-1-L\r\nprint(*c)", "from sys import stdin,stdout\r\nimport math\r\nI=lambda:map(int,stdin.readline().split())\r\n\r\nn,k=I()\r\na=list(I())\r\nb=(sorted(a,reverse=True))[0:k]\r\n#print(b)\r\nc=1\r\nans=[]\r\nprint(sum(b))\r\nfor x in a:\r\n if x in b:\r\n ans.append(c)\r\n b.remove(x)\r\n c=1 \r\n else:\r\n c+=1 \r\n if len(b)==0:\r\n break\r\nans[k-1]=n-sum(ans)+ans[k-1]\r\nfor x in ans:\r\n print(x,end=' ')\r\nprint('')\r\n\r\n \r\n \r\n", "#winners never quit, quiters never win\r\nfrom collections import deque as de\r\nimport math\r\nfrom collections import Counter as cnt\r\nclass My_stack():\r\n def __init__(self):\r\n self.data = []\r\n def my_push(self, x):\r\n return (self.data.append(x))\r\n def my_pop(self):\r\n return (self.data.pop())\r\n def my_peak(self):\r\n return (self.data[-1])\r\n def my_contains(self, x):\r\n return (self.data.count(x))\r\n def my_show_all(self):\r\n return (self.data)\r\n def isEmpty(self):\r\n return len(self.data)==0\r\n\r\narrStack = My_stack() \r\n# A optimized school method based \r\n# Python3 program to check \r\n# if a number is prime \r\n\r\n\r\ndef isPrime(n) : \r\n\r\n\t# Corner cases \r\n\tif (n <= 1) : \r\n\t\treturn False\r\n\tif (n <= 3) : \r\n\t\treturn True\r\n\r\n\t# This is checked so that we can skip \r\n\t# middle five numbers in below loop \r\n\tif (n % 2 == 0 or n % 3 == 0) : \r\n\t\treturn False\r\n\r\n\ti = 5\r\n\twhile(i * i <= n) : \r\n\t\tif (n % i == 0 or n % (i + 2) == 0) : \r\n\t\t\treturn False\r\n\t\ti = i + 6\r\n\r\n\treturn True\r\n\r\ndef get_prime_factors(number):\r\n # create an empty list and later I will\r\n # run a for loop with range() function using the append() method to add elements to the list.\r\n prime_factors = []\r\n\r\n # First get the number of two's that divide number\r\n # i.e the number of 2's that are in the factors\r\n while number % 2 == 0:\r\n prime_factors.append(2)\r\n number = number / 2\r\n\r\n # After the above while loop, when number has been\r\n # divided by all the 2's - so the number must be odd at this point\r\n # Otherwise it would be perfectly divisible by 2 another time\r\n # so now that its odd I can skip 2 ( i = i + 2) for each increment\r\n for i in range(3, int(math.sqrt(number)) + 1, 2):\r\n while number % i == 0:\r\n prime_factors.append(int(i))\r\n number = number / i\r\n\r\n\r\n # Here is the crucial part.\r\n # First quick refreshment on the two key mathematical conjectures of Prime factorization of any non-Prime number\r\n # Which is - 1. If n is not a prime number AT-LEAST one Prime factor would be less than sqrt(n)\r\n # And - 2. If n is not a prime number - There can be AT-MOST 1 prime factor of n greater than sqrt(n).\r\n # Like 7 is a prime-factor for 14 which is greater than sqrt(14)\r\n # But if the above loop DOES NOT go beyond square root of the initial n.\r\n # Then how does that greater than sqrt(n) prime-factor\r\n # will be captured in my prime factorization function.\r\n # ANS to that is - in my first for-loop I am dividing n with the prime number if that prime is a factor of n.\r\n # Meaning, after this first for-loop gets executed completely, the adjusted initial n should become\r\n # either 1 or greater than 1\r\n # And if n has NOT become 1 after the previous for-loop, that means that\r\n # The remaining n is that prime factor which is greater that the square root of initial n.\r\n # And that's why in the next part of my algorithm, I need to check whether n becomes 1 or not,\r\n #This code is taken by rohan paul's github\r\n if number > 2:\r\n prime_factors.append(int(number))\r\n\r\n return prime_factors\r\ndef get_frequency(list):\r\n dic={}\r\n for ele in list:\r\n if ele in dic:\r\n dic[ele] += 1\r\n else:\r\n dic[ele] = 1\r\n return dic\r\n#here we go......................\r\n#winners never quit, quitters never win\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=sorted(a, reverse=True)\r\ndic={}\r\ntotalprofit=0\r\nfor i in range(k):\r\n totalprofit+=l[i]\r\n if l[i] in dic:\r\n dic[l[i]]+=1\r\n else:\r\n dic[l[i]]=1\r\nans=[]\r\ncount=0\r\nfor i in range(n):\r\n if a[i] in dic:\r\n count+=1\r\n if dic[a[i]]==1:\r\n del dic[a[i]]\r\n else:\r\n dic[a[i]]-=1\r\n if not dic:\r\n count-=1\r\n ans.append(count+ n-i)\r\n break\r\n else:\r\n ans.append(count)\r\n count=0\r\n else:\r\n count+=1\r\nprint(totalprofit)\r\nprint(*ans) \r\n\r\n", "from collections import defaultdict\nn,k=map(int,input().split())\narray=list(map(int,input().split()))\nmysub=sorted(array,reverse=True)\nmysub=mysub[:k]\nprint(sum(mysub))\n\n\nd=defaultdict(lambda:0)\n\nfor item in mysub:\n d[item]+=1\n\ncount=1\ntotal=0\n\nsu=x=0\nwhile(x<n):\n if(d[array[x]]<=0):\n x+=1\n count+=1\n else:\n su+=1\n if(su==k):\n count+=(n-x-1)\n print(count)\n break\n print(count,end=\" \")\n d[array[x]]-=1\n count=1\n x+=1\n", "import sys, heapq\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\narr = list(map(int, sys.stdin.readline().split()))\r\nq = []\r\nfor i in range(n):\r\n heapq.heappush(q, (-arr[i], i))\r\nres = []\r\ntemp_k = k\r\nwhile temp_k:\r\n val, idx = heapq.heappop(q)\r\n res.append((-val, idx))\r\n temp_k -= 1\r\nres.sort(key=lambda x : x[1])\r\nans = 0\r\nfor i in res:\r\n ans += i[0]\r\npath = []\r\ncnt = 0\r\nfor i in range(n):\r\n if (arr[i], i) in res:\r\n path.append(cnt + 1)\r\n cnt = 0\r\n else:\r\n cnt += 1\r\npath[-1] += n - sum(path)\r\nprint(ans)\r\nprint(' '.join(map(str, path)))", "n, k = map(int, input().split())\r\na = []\r\ni = 0\r\nfor x in input().split():\r\n a.append((int(x), i))\r\n i += 1\r\nused = [False for i in range(n)]\r\na.sort()\r\nsum = 0\r\nfor (val, index) in a[-k:]:\r\n sum += val\r\n used[index] = True\r\nprint(sum)\r\ncur = 0\r\nans = []\r\nfor i in range(n):\r\n if used[i]:\r\n ans.append(cur + 1)\r\n cur = 0\r\n else:\r\n cur += 1\r\nif cur > 0:\r\n ans[-1] += cur\r\nprint(*ans)", "n, k = map(int, input().split())\na = tuple(map(int, input().split()))\n\nmax_n = {i: 0 for i in a}\nfor i in sorted(a)[-k:]:\n max_n[i] += 1\n\nprint(sum(max_n[i] * i for i in max_n))\n\nlast_i = 0\noutput = []\nf = False\nfor i in range(n):\n if max_n[a[i]]:\n max_n[a[i]] -= 1\n if not f:\n f = True\n else:\n output.append(i - last_i)\n last_i = i\noutput.append(i - last_i + 1)\n\nprint(*output)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=sorted(a,reverse=True)[:k]\r\nprint(sum(b))\r\nc=[]\r\nl=0;r=-1\r\nwhile len(b)>0:\r\n if a[l] in b:\r\n c.append(l-r)\r\n r=l\r\n b.remove(a[l])\r\n l+=1\r\nc[-1]+=len(a)-l\r\nprint(*c)", "def main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n a_indexes = sorted(range(1, n + 1), key=lambda i: a[i - 1])\r\n\r\n best = sorted(a_indexes[-k:])\r\n\r\n print(sum((a[i - 1] for i in best)))\r\n\r\n prev = 0\r\n for i in best[:-1]:\r\n print(i - prev, end=' ')\r\n prev = i\r\n print(n - prev)\r\n\r\n\r\nmain()\r\n", "import sys\r\nreadline = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nN, K = map(int, readline().split())\r\nA = list(map(int, readline().split()))\r\n\r\nB = A[:]\r\nB.sort(reverse = True)\r\nB = B[:K]\r\nans = sum(B)\r\nB = Counter(B)\r\n\r\ntable = [0]*N\r\nfor i in range(N):\r\n if B[A[i]]:\r\n B[A[i]] -= 1\r\n table[i] = 1\r\n\r\nl = []\r\ncnt = 0\r\nfor i in range(N):\r\n cnt += 1\r\n if table[i]:\r\n l.append(cnt)\r\n cnt = 0\r\nl[-1] += N-sum(l)\r\nprint(ans)\r\nprint(*l)", "n , k = map(int , input().split())\r\ndat = list(map(int , input().split()))\r\nres = sorted(dat)\r\nmx = [res[i] for i in range(n-1,n-k-1,-1)][::-1]\r\nprint(sum(mx))\r\nif k == 1:\r\n print(n)\r\nelse:\r\n ind = []\r\n for i in range(len(dat)):\r\n if dat[i] in mx:\r\n ind.append(i+1)\r\n mx.remove(dat[i])\r\n ans = [0]*len(ind)\r\n ans[0] = ind[0]\r\n for i in range(1,len(ind)-1):\r\n ans[i] = ind[i]-ind[i-1]\r\n ans[-1] = n-ind[-2]\r\n print(*ans)\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\np = sorted(a)\r\np = p[-k:]\r\ns = sum(p)\r\nprint(s)\r\nidx = 0\r\ni = 0\r\ncount = 0\r\nans = []\r\nwhile len(ans)<k-1:\r\n idx+=1\r\n count+=1\r\n if a[i] in p:\r\n p.remove(a[i])\r\n ans.append(count)\r\n count = 0\r\n i+=1\r\nfor i in ans:\r\n print(i,end = \" \")\r\nprint(n-idx)\r\n \r\n", "n,k=map(int,input().split())\r\nli=[0]+list(map(int,input().split()))\r\nt=li.copy()\r\nt.sort()\r\nx=[]\r\ne,s=-1,0\r\nif k==1:\r\n print(max(li))\r\n print(n)\r\nelse:\r\n \r\n for _ in range(k):\r\n ind=li.index(t[e])\r\n e-=1\r\n s+=li[ind]\r\n li[ind]=0\r\n x.append(ind)\r\n x.sort() \r\n print(s)\r\n for i in range(k):\r\n if i==0:\r\n print(x[i],end=' ')\r\n elif i==k-1:\r\n print(n-x[i-1],end=' ')\r\n else:\r\n print(x[i]-x[i-1],end=' ')", "z,zz=input,lambda:map(int,z().split());n,k=zz()\r\nl=sorted(zip(zz(),range(n)))[-k:]\r\nprint(sum(i[0] for i in l))\r\np=sorted(i[1] for i in l)+[n];p[0]=0\r\nfor x,y in zip(p,p[1:]):\r\n print(y-x,end=' ')\r\n", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\n\r\nmaximums = sorted(numbers, reverse=True)[:k]\r\nprint(sum(maximums))\r\n\r\nleft_point = -1\r\nright_point = 0\r\nwhile right_point < n:\r\n if numbers[right_point] in maximums:\r\n maximums.remove(numbers[right_point])\r\n if len(maximums) == 0:\r\n right_point = n-1\r\n # print(left_point, right_point)\r\n print(right_point - left_point, end = \" \")\r\n left_point = right_point\r\n right_point += 1\r\n", "n,k = map(int, input().split())\r\n \r\na = list(map(int, input().split()))\r\nb = [(a[i], i) for i in range(n)]\r\nb.sort(reverse = True)\r\nind = []\r\nfor i in range(k):\r\n ind.append(b[i][1])\r\nind.sort()\r\nind.pop()#\r\nind.append(n-1)\r\nres = 0\r\nfor i in range(k):\r\n res += b[i][0]\r\nprint(res)\r\nprev = -1\r\nfor i in ind:\r\n print(i-prev, end = \" \")\r\n prev = i\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nif k == 1:\r\n print(max(l))\r\n print(n)\r\n exit(0)\r\nl = sorted([(val, idx) for idx,val in zip(range(n), l)], reverse=True)\r\ns, o = sum(x[0] for x in l[:k]), sorted([x[1] for x in l[:k]])\r\np = o[0]+1\r\nans = [p]\r\nfor i in range(1, k-1):\r\n ans.append(o[i]+1-p)\r\n p = o[i]+1\r\nif k > 1:\r\n ans.append(n-p)\r\nprint(s)\r\nprint(*ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n l.append([a[i],i+1])\r\nl.sort(reverse=True)\r\ns=0\r\nd=[]\r\nfor i in range(k):\r\n s+=l[i][0]\r\n d.append(l[i][1])\r\nd.sort()\r\nprint(s)\r\nif(k==1):\r\n print(n)\r\nelse:\r\n q=[d[0]]\r\n for i in range(1,k-1):\r\n q.append(d[i]-d[i-1])\r\n q.append(n-d[-2])\r\n print(*q)\r\n", "\"\"\" 616C \"\"\"\r\n\"\"\" 1152B \"\"\"\r\n# import math\r\n# import sys\r\ndef main():\r\n\t# n ,m= map(int,input().split())\r\n\t# arr = list(map(int,input().split()))\r\n\t# b = list(map(int,input().split()))\r\n\t# n = int(input())\r\n\t# TODO:\r\n\t# 1> LEETCODE FIRST PROBLEM WRITE\r\n\t# 2> VALERYINE AND DEQUEUE\r\n\tn,k= map(int,input().split())\r\n\tarr = list(map(int,input().split()))\r\n\tarr2 = []\r\n\tarr3 = [ ]\r\n\tif k==1:\r\n\t\tprint(max(arr))\r\n\t\tprint(n)\r\n\t\treturn\r\n\tfor i in range(n):\r\n\t\tarr3.append([arr[i],i])\r\n\tarr3.sort(reverse=True)\r\n\tadd = 0\r\n\tfor i in range(k):\r\n\t\tarr2.append(arr3[i][1])\r\n\t\tadd += arr3[i][0]\r\n\tarr2.sort()\r\n\tprint(add)\r\n\t# print(arr2)\r\n\tfor i in range(k-1):\r\n\t\tif i==0:\r\n\t\t\tprint(arr2[i]+1,end=' ')\r\n\t\telse:\r\n\t\t\tprint(arr2[i]-arr2[i-1],end=' ')\r\n\tif len(arr2)-2>=0:\r\n\t\tprint(n-1-arr2[k-2],end=' ')\r\n\treturn\r\n\t\t\r\nmain()\r\n# def test():\r\n# \tt = int(input())\r\n# \twhile t:\r\n# \t\tmain()\r\n# \t\tt-=1\r\n# test()\r\n", "# Accepted: \n\nisVerbose = False\ndef v(msg):\n if isVerbose:\n print(msg)\n\nn, k = map(int, input().split())\nnums = list(enumerate(map(int, input().split())))\n\n#print(n, k)\n#print(nums)\nnums.sort(key=lambda tup:tup[1])\n#print(nums)\nnums_top = nums[-min(k, n):]\n#print(nums_top)\nnums_top.sort(key=lambda tup:tup[0])\n\nprint(sum([pair[1] for pair in nums_top]))\n\nlast = -1\nfor i in range(len(nums_top) -1):\n\tprint(nums_top[i][0] - last, end=\" \")\n\tlast = nums_top[i][0]\n\nprint(n - 1 - last)\n \n" ]

[ "from math import *\r\nf1=open('input.txt','r')\r\nn=int(f1.readline())\r\nf1.close()\r\na=[[] for i in range(int(log(n,2))+1)]\r\ndef f(l,r,d=0):\r\n global a\r\n if l!=r:\r\n m=(l+r)//2\r\n a[d]+=list(range(l,m+1))\r\n f(l,m,d+1)\r\n f(m+1,r,d+1)\r\nf(1,n)\r\nb=0\r\nfor i in range(len(a)):\r\n if a[i]:\r\n a[i]=[len(a[i])]+a[i]\r\n b+=1\r\nf2=open('output.txt','w')\r\nprint(b,file=f2)\r\nfor i in range(b):\r\n print(*a[i],file=f2)\r\nf2.close()", "f = open('input.txt')\r\nn = int(f.readline())\r\nf.close()\r\n\r\nout = []\r\nmask = 1\r\nwhile True:\r\n nex = []\r\n for i in range(n):\r\n if i & mask:\r\n nex.append(i + 1)\r\n if nex:\r\n out.append(str(len(nex)) + ' ' + ' '.join(map(str, nex)))\r\n mask <<= 1\r\n else:\r\n break\r\n\r\ng = open('output.txt', 'w')\r\ng.write(str(len(out))+'\\n')\r\ng.write('\\n'.join(out))\r\ng.close()\r\n\r\n\t\t\t \t \t\t\t\t \t\t\t\t \t\t", "f = open('input.txt')\nn = int(f.readline())\nf.close()\n\nout = []\nmask = 1\nwhile True:\n nex = []\n for i in range(n):\n if i & mask:\n nex.append(i + 1)\n if nex:\n out.append(str(len(nex)) + ' ' + ' '.join(map(str, nex)))\n mask <<= 1\n else:\n break\n\ng = open('output.txt', 'w')\ng.write(str(len(out))+'\\n')\ng.write('\\n'.join(out))\ng.close()\n", "import sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\nn=int(input())\r\nb=[i for i in range (1,n+1)]\r\ndp=[]\r\ndef dfs(a,curr):\r\n if len(a)<=1:\r\n return \r\n if curr==len(dp):\r\n dp.append([])\r\n l=len(a)\r\n for i in range (l//2):\r\n dp[curr].append(a[i])\r\n dfs(a[:l//2],curr+1)\r\n dfs(a[l//2:],curr+1)\r\ndfs(b,0)\r\n#print(dp)\r\nprint(len(dp))\r\nfor i in dp:\r\n j=[len(i)]+i\r\n print(*j)" ]

[ "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = [0] + list(map(int, input().split()))\r\nx = list(a)\r\nx.sort()\r\ns = 0\r\nfor i in range(1, n + 1):\r\n u = [0] * 10\r\n for j in str(a[i]):\r\n u[int(j)] = 1\r\n ok = 1\r\n for j in range(10):\r\n if j ^ 4 and j ^ 7 and u[j]:\r\n ok = 0\r\n break\r\n if ok:\r\n s = i\r\n break\r\nif not s:\r\n ans = 0\r\n for i, j in zip(a, x):\r\n if i ^ j:\r\n ans = -1\r\n break\r\n print(ans)\r\n exit()\r\nd = defaultdict(lambda : [])\r\nfor i in range(1, n + 1):\r\n d[x[i]].append(i)\r\nfor i in range(1, n + 1):\r\n a[i] = d[a[i]].pop()\r\np = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n p[a[i]] = i\r\ny = a[s]\r\nans = []\r\nfor i in range(1, n + 1):\r\n if i == y or i == p[i]:\r\n continue\r\n if i ^ s:\r\n ans.append(\" \".join(map(str, (i, s))))\r\n a[i], a[s] = a[s], a[i]\r\n p[a[i]], p[a[s]] = p[a[s]], p[a[i]]\r\n s = i\r\n u = p[i]\r\n if u ^ s:\r\n ans.append(\" \".join(map(str, (u, s))))\r\n a[u], a[s] = a[s], a[u]\r\n p[a[u]], p[a[s]] = p[a[s]], p[a[u]]\r\n s = u\r\nk = len(ans)\r\nprint(k)\r\nsys.stdout.write(\"\\n\".join(ans))", "def check(x):\n return all(digit not in str(x) for digit in \"01235689\")\n\ndef change(a, b):\n x, y = rpos[a], rpos[b]\n if x == y:\n return 1\n res.append((x + 1, y + 1))\n rpos[pos[x]], rpos[pos[y]] = rpos[pos[y]], rpos[pos[x]]\n pos[x], pos[y] = pos[y], pos[x]\n return 1\n\nn = int(input())\na = list(map(int, input().split()))\nb = [(a[i], i) for i in range(n)]\npos = [i for i in range(n)]\nrpos = [i for i in range(n)]\nb.sort()\nres = []\nid = -1\nok = 1\n\nfor i in range(n):\n if i != b[i][1]:\n ok = 0\n if id == -1 and check(a[i]):\n id = i\n\nif ok == 1:\n print(0)\n exit(0)\n\nif ok == 0 and id == -1:\n print(-1)\n exit(0)\n\nfor i in range(n):\n index = b[i][1]\n if id == index:\n continue\n change(pos[i], id)\n change(id, index)\n\nprint(len(res))\nfor x, y in res:\n print(x, y)\n \t\t\t\t\t\t\t\t \t \t \t\t \t\t \t \t \t\t" ]

[ "from math import gcd\r\nimport sys\r\nn = int(sys.stdin.readline())\r\nres = set()\r\nfor _ in range(n):\r\n k,b = map(int,sys.stdin.readline().split())\r\n if k!=0:\r\n a = gcd(k,b)\r\n if k*b>0:\r\n res.add((abs(b//a),abs(k//a)))\r\n else:\r\n res.add((-abs(b//a),abs(k//a)))\r\nprint(len(res))# 1692458113.5249596", "from fractions import gcd\r\ns = set()\r\nfor _ in range(int(input())):\r\n k, b = map(int, input().split())\r\n if b and k:\r\n g = gcd(k, b)\r\n s.add((k // g, b // g))\r\n elif k:\r\n s.add((0, 0))\r\nprint(len(s))", "from decimal import *\r\nn = int(input())\r\na = set()\r\nfor i in range(n):\r\n k, b = map(int, input().split())\r\n if k != 0:\r\n a.add(Decimal(b) / Decimal(k))\r\nprint(len(a))", "from math import gcd\r\nimport sys\r\nn = int(sys.stdin.readline())\r\n \r\niset = set()\r\n \r\nfor _ in range(n):\r\n k,b = map(int,sys.stdin.readline().split())\r\n if k!=0:\r\n x = gcd(k,b)\r\n if k*b>0:\r\n iset.add((abs(b//x),abs(k//x)))\r\n else:\r\n iset.add((-abs(b//x),abs(k//x)))\r\n \r\nprint(len(iset))" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\na3 = list(map(int, input().split()))\r\ninf = pow(10, 15)\r\nfor _ in range(2):\r\n a1.append(-inf)\r\n a2.append(-inf)\r\n a3.append(0)\r\ndp1 = [-inf] * (n + 2)\r\ndp2 = [-inf] * (n + 2)\r\ndp3 = [-inf] * (n + 2)\r\ndp1[0] = a1[0]\r\ns = a1[0] + a2[0] + a3[0]\r\nfor i in range(n):\r\n s += a1[i + 1] + a2[i + 1] + a3[i + 1]\r\n dp1[i + 1] = max(dp1[i + 1], dp1[i] + a1[i + 1])\r\n dp1[i + 1] = max(dp1[i + 1], dp2[i] + a1[i] + a1[i + 1])\r\n dp1[i + 1] = max(dp1[i + 1], dp3[i] + a2[i] + a1[i] + a1[i + 1])\r\n dp2[i + 1] = max(dp2[i + 1], dp1[i] + a2[i] + a2[i + 1])\r\n dp2[i + 1] = max(dp2[i + 1], dp2[i] + a2[i + 1])\r\n dp2[i + 1] = max(dp2[i + 1], dp3[i] + a2[i] + a2[i + 1])\r\n dp3[i + 1] = max(dp3[i + 1], dp1[i] + a2[i] + a3[i] + a3[i + 1])\r\n dp3[i + 1] = max(dp3[i + 1], dp2[i] + a3[i] + a3[i + 1])\r\n dp3[i + 1] = max(dp3[i + 1], dp3[i] + a3[i + 1])\r\n dp1[i + 2] = max(dp1[i + 2], dp3[i] + s - a3[i] + a1[i + 2])\r\n dp3[i + 2] = max(dp3[i + 2], dp1[i] + s - a1[i] + a3[i + 2])\r\n s -= a1[i] + a2[i] + a3[i]\r\nans = dp3[n]\r\nprint(ans)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n\tM = (\r\n\t(0, 3, 5, 5),\r\n\t(3, 1, 4, -1),\r\n\t(5, 4, 2, 5),\r\n\t(5, -1, 5, 5))\r\n\tINF = int(9e18-1e9)\r\n\tn = int(input())\r\n\ta = [list(map(int, input().split())) for i in range(3)]\r\n\tfor i in range(3):\r\n\t\ta.append([None]*n)\r\n\tfor i in range(n):\r\n\t\ta[3][i] = a[0][i]+a[1][i]\r\n\t\ta[4][i] = a[1][i]+a[2][i]\r\n\t\ta[5][i] = a[0][i]+a[4][i]\r\n\tdp = [[None]*(n+1) for i in range(4)]\r\n\tdp[0][0] = 0\r\n\tdp[1][0] = -INF\r\n\tdp[2][0] = -INF\r\n\tdp[3][0] = -INF\r\n\tfor i in range(n):\r\n\t\tfor j in range(4):\r\n\t\t\td = -INF\r\n\t\t\tfor k in range(4):\r\n\t\t\t\tv = M[k][j]\r\n\t\t\t\tif v >= 0:\r\n\t\t\t\t\td = max(d, dp[k][i] + a[v][i])\r\n\t\t\tdp[j][i+1] = d\r\n\tprint(dp[2][n])\r\n\r\nsolve()\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n\t'''M = (\r\n\t(a, d, f, f),\r\n\t(d, b, e, -1),\r\n\t(f, e, c, f),\r\n\t(f, -1, f, f))\r\n\t'''\r\n\tINF = int(9e18-1e9)\r\n\tn = int(input())\r\n\tA = [[None]*3 for i in range(n)]\r\n\tfor i in range(3):\r\n\t\tj = 0\r\n\t\tfor v in map(int, input().split()):\r\n\t\t\tA[j][i] = v\r\n\t\t\tj += 1\r\n\tx = 0\r\n\ty = -INF\r\n\tz = -INF\r\n\tw = -INF\r\n\tfor a,b,c in A:\r\n\t\td = a + b\r\n\t\te = b + c\r\n\t\tf = a + e\r\n\t\tx, y, z, w = max(x+a,y+d,z+f,w+f), \\\r\n\t\t\tmax(x+d,y+b,z+e), \\\r\n\t\t\tmax(x+f,y+e,z+c,w+f), \\\r\n\t\t\tf+max(x,z,w)\r\n\tprint(z)\r\n\r\nsolve()\r\n" ]

[ "import itertools\nimport bisect\n\nn, A, cf, cm, m = [int(x) for x in input().split()]\nskills = [int(x) for x in input().split()]\nsorted_skills = list(sorted((k, i) for i, k in enumerate(skills)))\nbottom_lift = [0 for i in range(n)]\nfor i in range(1, n):\n bottom_lift[i] = bottom_lift[i-1] + i * (sorted_skills[i][0] - sorted_skills[i-1][0])\nroot_lift = [0 for i in range(n+1)]\nfor i in range(1, n+1):\n root_lift[i] = root_lift[i-1] + A - sorted_skills[n-i][0]\n\nmax_level = -1\nfor i in range(n+1):\n money_left = m - root_lift[i]\n if money_left < 0: break\n k = min(bisect.bisect(bottom_lift, money_left), n-i)\n money_left -= bottom_lift[k-1]\n min_level = min(A, sorted_skills[k-1][0] + money_left//k) if k > 0 else A\n level = cf*i + cm*min_level\n if max_level < level:\n max_level = level\n argmax = i\n argmax_min_level = min_level\n argmax_k = k\n\nans = [0 for i in range(n)]\nfor i, skill in enumerate(sorted_skills):\n if i < argmax_k:\n ans[skill[1]] = argmax_min_level\n elif i >= n - argmax:\n ans[skill[1]] = A\n else:\n ans[skill[1]] = skill[0]\n\nprint(max_level)\nfor a in ans:\n print(a, end = ' ')\n \n", "def main():\n from bisect import bisect\n n, A, cf, cm, m = map(int, input().split())\n skills = list(map(int, input().split()))\n xlat = sorted(range(n), key=skills.__getitem__)\n sorted_skills = [skills[_] for _ in xlat]\n bottom_lift, a, c = [], 0, 0\n for i, b in enumerate(sorted_skills):\n c += i * (b - a)\n bottom_lift.append(c)\n a = b\n root_lift, a = [0], 0\n for b in reversed(sorted_skills):\n a += A - b\n root_lift.append(a)\n max_level = -1\n for A_width, a in enumerate(root_lift):\n if m < a:\n break\n money_left = m - a\n floor_width = bisect(bottom_lift, money_left)\n if floor_width > n - A_width:\n floor_width = n - A_width\n money_left -= bottom_lift[floor_width - 1]\n if floor_width > 0:\n floor = sorted_skills[floor_width - 1] + money_left // floor_width\n if floor > A:\n floor = A\n else:\n floor = A\n level = cf * A_width + cm * floor\n if max_level < level:\n max_level, save = level, (A_width, floor, floor_width)\n A_width, floor, floor_width = save\n for id in xlat[:floor_width]:\n skills[id] = floor\n for id in xlat[n - A_width:]:\n skills[id] = A\n print(max_level)\n print(' '.join(map(str, skills)))\n\n\nif __name__ == '__main__':\n main()\n", "f = lambda: map(int, input().split())\r\ng = lambda: m - l * p[l - 1] + s[l]\r\n\r\nn, A, x, y, m = f()\r\nt = sorted((q, i) for i, q in enumerate(f()))\r\np = [q for q, i in t]\r\ns = [0] * (n + 1)\r\nfor j in range(n): s[j + 1] = p[j] + s[j]\r\n\r\nl = r = n\r\nF = L = R = B = -1\r\nwhile 1:\r\n if p:\r\n while l > r or g() < 0: l -= 1\r\n b = min(p[l - 1] + g() // l, A)\r\n else: b, l = A, 0\r\n\r\n f = x * (n - r) + y * b\r\n if F < f: F, L, R, B = f, l, r, b\r\n\r\n if not p: break\r\n m += p.pop() - A\r\n r -= 1\r\n if m < 0: break\r\n\r\nprint(F)\r\n\r\np = [(i, B if j < L else q if j < R else A) for j, (q, i) in enumerate(t)]\r\nfor i, q in sorted(p): print(q)", "# https://codeforces.com/contest/614\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster\n\n# n: number of skills 1 <= n <= 100_000\n# A:maximum level 1 <= A <= 10**9\n# cf, cm: coefficients for force calculations\n# m: available money 0 <= m <= 10**15\n# a: current skill levels 0 <= a[i] <= A\nn, A, cf, cm, m = map(int, input().split())\na = list(map(int, input().split()))\n\n# sort array but also keep original indices\nb = sorted((v, i) for i, v in enumerate(a))\n\n# ss[i]: cost for perfecting skills i to n-1 (ss[n]: not perfecting any skill)\nss = [0] * (n + 1)\nfor i in range(n - 1, -1, -1):\n ss[i] = ss[i + 1] + (A - b[i][0])\n\n# ps[i]: cost for bumping skills 0 to i up to b[i][0] (ps[0] is always 0)\nps = [0] * n\nfor i in range(1, n):\n ps[i] = ps[i - 1] + i * (b[i][0] - b[i - 1][0])\n\n# best solution\nforce_best = 0\nn_perfect_best = 0\nmin_skill_level_best = 0\n\nfor i in range(n, -1, -1):\n\n # if cost for perfecting skills i to n-1 is too high: stop\n if ss[i] > m:\n break\n\n # if skill lower than is already perfected: skip this loop\n if i > 0 and b[i - 1][0] == A:\n continue\n\n # how many skills are perfected\n n_perfect = n - i\n # remaining money\n m_remaining = m - ss[i]\n\n # if all skills are perfected\n if n_perfect == n:\n force = n * cf + A * cm\n if force > force_best:\n force_best = force\n n_perfect_best = n_perfect\n min_skill_level_best = A\n continue\n\n # otherwise there is at least one (lower) skill not perfected\n if ps[i - 1] <= m_remaining:\n j = i - 1\n else:\n left, right = 0, i - 1\n while left + 1 < right:\n mid = (left + right) // 2\n if ps[mid] > m_remaining:\n right = mid\n else:\n left = mid\n j = left\n\n assert m_remaining >= ps[j]\n\n min_skill_level = b[j][0]\n m_remaining -= ps[j]\n\n further_uplift = min(m_remaining // (j + 1), A - 1 - min_skill_level)\n min_skill_level += further_uplift\n m_remaining -= further_uplift * (j + 1)\n\n force = n_perfect * cf + min_skill_level * cm\n if force > force_best:\n force_best = force\n n_perfect_best = n_perfect\n min_skill_level_best = min_skill_level\n\n# build solution\nc = [0] * n\nfor i in range(n):\n if n - i <= n_perfect_best:\n c[b[i][1]] = A\n else:\n c[b[i][1]] = max(b[i][0], min_skill_level_best)\n\nprint(force_best)\nprint(*c)\n" ]

[ "q = int(input().strip())\r\n\r\nfor _ in range(q):\r\n\tn = int(input().strip())\r\n\r\n\tprimes = [1,3,5,7,11]\r\n\t#if n is odd..\r\n\tif n&1:\r\n\t\tif n in primes:\r\n\t\t\tprint(-1)\r\n\t\telse:\r\n\t\t\tprint(((n-9)//4)+1)\r\n\telse:\r\n\t\tif n==2:\r\n\t\t\tprint(-1)\r\n\t\telse:\r\n\t\t\tprint(n//4)\r\n", "#! /usr/bin/env python3\nq = int(input())\nfor _ in range(q):\n n = int(input())\n if n % 4 == 0:\n print(n // 4)\n elif n % 4 == 1:\n if n < 9:\n print(-1)\n else:\n print((n - 9) // 4 + 1)\n elif n % 4 == 2:\n if n < 6:\n print(-1)\n else:\n print((n - 6) // 4 + 1)\n else:\n if n < 15:\n print(-1)\n else:\n print((n - 15) // 4 + 2)\n", "dp=[-1,-1,-1,-1,1,-1,1,-1,2,1,2,-1]\r\nfor i in range(int(input())):\r\n a=int(input())\r\n if a<12:\r\n print(dp[a])\r\n else:\r\n ans=a//4\r\n if a%2==0:\r\n print(ans)\r\n else:\r\n print(ans-1)\r\n \r\n", "n = int(input())\n\nfor i in range(n):\n calc = int(input())\n if calc <= 3 or calc == 5 or calc == 7 or calc == 11:\n print(-1)\n else:\n ans = int(calc / 4)\n if (calc % 4) % 2 == 1:\n ans = ans - 1\n print(ans)", "def main():\n for _ in range(int(input())):\n n = int(input())\n if n in {1, 2, 3, 5, 7, 11}:\n print(-1)\n elif n % 2:\n print((n - 5) // 4)\n else:\n print(n // 4)\n\n\nif __name__ == '__main__':\n main()\n", "maximum = [-1, -1, -1, -1, 1, -1, 1, -1, 2, 1, 2, -1, 3, 2, 3, 2, 4]\n\nq = int(input())\nfor _ in range(q):\n n = int(input())\n base = 12 + n % 4\n \n if n < len(maximum):\n print(maximum[n])\n continue\n print(maximum[base] + (n - base) // 4)\n \t \t \t\t \t\t \t\t\t\t\t \t\t\t", "def splitting(x):\r\n if x % 2 == 1:\r\n if x <= 7 or x == 11:\r\n return -1\r\n return splitting(x - 9) + 1\r\n else:\r\n if x == 2:\r\n return -1\r\n return x // 4\r\n\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n print(splitting(int(input())))\r\n", "# from math import sqrt; from itertools import count, islice\n\n# def isPrime(n):\n# return n > 1 and all(n%i for i in islice(count(2), int(sqrt(n)-1)))\n\nn = int(input())\nanswer = []\n\n# def prox_n_primo(numero):\n# \twhile True:\n# \t\tnumero +=1\n# \t\tif not isPrime(numero):\n# \t\t\treturn numero\n\n\nfor _ in range(n):\n\ti = int(input())\n\n\tif i < 4:\n\t\tanswer.append(str(-1))\n\t\tcontinue\n\n\n\tv = 4\n\tcounter = i//4\n\ti = i%4\n\n\t# while i >= 4:\n\t# \tdivide = i//v\n\t# \ti = i%(v*divide)\n\t# \tcounter += divide\n\n\tif i == 0 or i == 2:\n\t\tanswer.append(str(counter))\n\telif i == 1:\n\t\tif counter > 1:\n\t\t\tanswer.append(str(counter-1))\n\t\telse:\n\t\t\tanswer.append(str(-1))\n\telif i == 3:\n\t\tif counter >= 3:\n\t\t\tanswer.append(str(counter-1))\n\t\telse:\n\t\t\tanswer.append(str(-1))\n\n\n\nprint('\\n'.join(answer))", "if __name__ == '__main__':\r\n t = int(input())\r\n\r\n for _ in range(t):\r\n n = int(input())\r\n\r\n rem = n % 4\r\n\r\n ignore = [1, 2, 3, 5, 7, 11]\r\n if n in ignore:\r\n print(-1)\r\n elif rem == 0 or rem == 2:\r\n print(n//4)\r\n else:\r\n print(n//4 - 1)", "q=int(input())\r\nfor i in range(q):\r\n n=int(input())\r\n if n>3:\r\n if n%4==0:\r\n print(n//4)\r\n elif (n-6)%4==0:\r\n if n-6>=0:\r\n print((n-6)//4+1)\r\n else:\r\n print('-1')\r\n elif (n-9)%4==0:\r\n if n-9>=0:\r\n print((n-9)//4+1)\r\n else:\r\n print('-1')\r\n elif (n-10)%4==0:\r\n if n-10>=0:\r\n print((n-10)//4+2)\r\n else:\r\n print('-1')\r\n elif (n-13)%4==0:\r\n if n-13>=0:\r\n print((n-13)//4+2)\r\n else:\r\n print('-1')\r\n elif (n-15)%4==0:\r\n if n-15>=0:\r\n print((n-15)//4+2)\r\n else:\r\n print('-1')\r\n else:\r\n print('-1')\r\n else:\r\n print('-1')\r\n", "for _ in range(int(input())):\r\n n=int(input())\r\n if n in[1,2,3,5,7,11]:print(-1)\r\n elif n%4%2:print(n//4-1)\r\n else:print(n//4)", "for _ in range(int(input())):\r\n n=int(input())\r\n if n%4==0: print(n//4)\r\n elif n%4==1:\r\n if n<9:print(\"-1\")\r\n else: print(1+(n-9)//4)\r\n elif n%4==2:\r\n if n<6:print(\"-1\")\r\n else: print(1+(n-6)//4)\r\n else:\r\n if n<15:print(\"-1\")\r\n else: print(2+(n-15)//4)\r\n", "fun = lambda num: -1 if num in [1, 2, 3, 5, 7, 11] else num//4 - num%2\n\n[print(fun(int(input()))) for i in range(int(input()))]\n\n\n\n# Made By Mostafa_Khaled", "def max_sum(n):\r\n if n in [1, 2, 3, 5, 7, 11]:\r\n return -1\r\n return n // 4 - n % 2\r\n\r\n\r\nn = int(input())\r\n[print(max_sum(int(input()))) for i in range(n)]\r\n", "q=int(input())\r\nfor i in range(q):\r\n n=int(input())\r\n v=n//4\r\n if n<=3 or n==5 or n==7 or n==11:\r\n print(-1)\r\n else:\r\n if n%2!=0:\r\n v=v-1\r\n print(v)", "for i in range(int(input())):\r\n k=int(input())\r\n c=k//4\r\n if k in [1,2,3,5,7,11]:\r\n print (-1)\r\n elif k%4==1 or k%4==3:\r\n print (c-1)\r\n else:\r\n print (c)", "from math import sqrt, pow, ceil\nfrom decimal import *\n\n#getcontext().prec = 10\n\n#l1 = list(input())\nl1 = int(input())\n#l2 = int(input())\n#l3 = int(input())\n#l1 = input().split()\n#l2 = input()\n#l2 = input().split()\n#l2 = list(input())\n\n#l1 = [int(i) for i in l1]\n#l2 = [int(i) for i in l2]\n\nresp = 100001 * [0]\n\nfor i in range(l1):\n n = int(input())\n if(n%4==0):\n print(int(n/4))\n elif(n%4==1):\n if(n<9):\n print(\"-1\")\n else:\n print(int((n-9)/4+1))\n elif(n%4==2):\n if(n<6):\n print(\"-1\");\n else:\n print(int((n-6)/4+1));\n else:\n if(n<=11):\n print(\"-1\")\n else:\n print(int((n-9)/4+1))\n\t \t\t\t \t\t\t\t\t\t\t\t\t \t \t \t \t\t\t\t\t", "#\t!/bin/env python3\r\n#\tcoding: UTF-8\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology and Management,Gwalior\r\n\r\n#\tQuestion Link\r\n#\thttps://codeforces.com/problemset/problem/870/C\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\n# ///==========MAIN=============///\r\n\r\n\r\ndef precompute():\r\n dp = [-1 for _ in range(16)]\r\n dp[0] = 0\r\n composite = [4, 6, 9]\r\n for i in range(1, 16):\r\n for j in composite:\r\n if i >= j and dp[i-j] != -1:\r\n dp[i] = max(dp[i], 1+dp[i-j])\r\n return dp\r\n\r\n\r\ndef main():\r\n dp = precompute()\r\n for tc in range(int(input())):\r\n n = int(input())\r\n if n < 16:\r\n print(dp[n])\r\n else:\r\n t = (n-16)//4+1\r\n print(t+dp[n-4*t])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\n\r\nprime=[2,3,5,7,11];d={}\r\n\r\ndef GeneratePrimes():\r\n for i in range(12,1010):\r\n for j in prime:\r\n if i%j==0:\r\n break\r\n if j*j>i:\r\n prime.append(i)\r\n break\r\n else:\r\n prime.append(i)\r\n #for i in range(1,len(prime)+1):\r\n #d[prime[i-1]]=i\r\ndef UpperBound(x):\r\n l=0;h=len(prime)\r\n while l<=h:\r\n m=(l+h)//2\r\n if x>prime[m]:\r\n l=m+1\r\n elif x<prime[m]:\r\n h=m-1\r\n else:\r\n return m\r\n return l\r\n#GeneratePrimes()\r\n\r\ndef NumberOfDiv(x):\r\n count=1\r\n for i in prime:\r\n if i*i>x:\r\n break\r\n if x%i==0:\r\n b=0\r\n while x%i==0:\r\n b+=1\r\n x//=i\r\n count*=(b+1)\r\n if x!=1:\r\n count*=2\r\n return count\r\n\r\nq=int(input())\r\n\r\nfor _ in range(q):\r\n n=int(input())\r\n if n%2==0:\r\n if n==2:\r\n print(-1)\r\n else:\r\n print(n//4)\r\n else:\r\n if n<9 or n==11:\r\n print(-1)\r\n else:\r\n print(1+(n-9)//4)\r\n\r\n\r\n\r\n\r\n\r\n", "def F(x):\r\n if x < 4 or x == 5 or x ==7 or x == 11:\r\n y = -1\r\n else:\r\n if x % 2 == 1:\r\n y = x // 4 - 1\r\n if x % 2 == 0:\r\n y = x // 4 \r\n return y\r\nn = int(input())\r\nf = []\r\nfor i in range(n):\r\n x = int(input())\r\n f.append(F(x))\r\nfor j in f:\r\n print(j)\r\n", "n = int(input())\nfor i in range(n):\n\tm = int(input())\n\tx = 0\n\tif m%2==1:\n\t\tm-=9\n\t\tx+=1\n\tif m<4 and m!=0:\n\t\tprint(-1)\n\telse:\n\t\tprint(m//4+x)", "[print(([-1]*4+[1,-1,1,-1,2,1,2,-1])[n]) if n<12 else print(n//4 if n%2==0 else n//4-1) for n in [int(input()) for _ in range(int(input()))]]", "from math import sqrt\r\n\r\ndef readInts(): return map(int, input().split())\r\n\r\n\r\nlimit = 1000\r\nisPrime = [True]*(limit+1)\r\nisPrime[0] = isPrime[1] = False\r\nfor i in range(int(sqrt(limit)+1)):\r\n if isPrime[i]:\r\n for j in range(i*i, limit, i):\r\n isPrime[j] = False\r\n \r\ndpSz = 200\r\ndp = [-(dpSz-1)] * (dpSz)\r\ndp[0] = 0\r\nfor i in range(2,dpSz):\r\n if not isPrime[i]:\r\n for j in range(0, dpSz-i):\r\n dp[i+j] = max ( dp[j]+1, dp[i+j] )\r\nfor i in range(len(dp)):\r\n if dp[i] < 0:\r\n dp[i] = -1\r\n\r\nnQueries = int(input())\r\nfor _ in range(nQueries):\r\n n = int(input())\r\n ans = 0\r\n if n >= dpSz:\r\n ans += (n-dpSz+1+3) // 4\r\n n -= ans*4\r\n if dp[n] == -1:\r\n print(-1)\r\n else:\r\n print(ans+dp[n])\r\n", "\nfor q in range(int(input())):\n t=int(input())\n if t<4:\n print(-1)\n else:\n d = t//4\n r = t%4\n if r==0 or r==2:\n print(d)\n elif r==1: # 1 or 3\n if d>=2:\n print(d-1)\n else:\n print(-1)\n elif r==3:\n # 11, 19, 27\n u=1\n ex = t-9\n if ex>=4:\n dd = ex//4\n print(dd+1)\n else:\n print(-1)\n\n \n\n \t \t\t \t\t \t\t \t\t\t \t\t \t \t", "lis=[0,1,2,3,5,7,11]\r\nfor _ in range(int(input())):\r\n n = int(input())\r\n if n in lis:\r\n print(-1)\r\n elif n%2==0:\r\n print(n//4)\r\n elif n%4==1:\r\n print(1+(n-9)//4)\r\n elif n%4==3:\r\n print((n-7)//4) \r\n\r\n", "q = int(input())\r\nfor i in range(q):\r\n n = int(input())\r\n ans = n // 4\r\n if (n <= 3 or n == 5 or n == 7 or n == 11):\r\n print(-1)\r\n else:\r\n if n % 2:\r\n ans -= 1\r\n print(ans)\r\n \r\n", "n = int(input())\nl = []\nfor i in range(n):\n l.append(int(input()))\nfor i in range(n):\n q = l[i]\n if q in {1,2,3,5,7,11}:\n print(-1)\n elif q in {4,6,9}:\n print(1)\n else:\n remain = q % 4\n if remain == 0:\n print(int(q/4))\n elif remain == 1:\n print(int((q-9)/4) + 1)\n elif remain == 2:\n print(int((q-6)/4) + 1)\n else:\n print(int((q-15)/4) + 2)\n", "t=int(input())\r\nans=[-1,-1,-1,-1,1,-1,1,-1,2,1,2,-1]\r\nfor _ in range(t):\r\n n=int(input())\r\n if(n<=11):\r\n print(ans[n])\r\n else:\r\n if(n%4==0):\r\n print(n//4)\r\n elif(n%4==1):\r\n print(1+((n-9)//4))\r\n elif(n%4==2):\r\n print(1+((n-6)//4))\r\n elif(n%4==3):\r\n print(2+((n-15)//4))\r\n ", "num = int(input())\r\nfor i in range(num):\r\n n = int(input())\r\n if n >= 12:\r\n print((n // 4) - n % 2)\r\n else:\r\n if n == 1 or n == 2 or n == 3 or n == 5 or n == 7 or n == 11:\r\n print(-1)\r\n elif n == 4 or n == 6 or n == 9:\r\n print(1)\r\n else:\r\n print(2)", "for _ in range(int(input())):\r\n n=int(input())\r\n if n in [1,2,3,5,7,11]:\r\n print(-1)\r\n elif n%2!=0:\r\n print((n-9)//4 +1)\r\n else:\r\n print(n//4)\r\n", "def fun(n):\r\n l=[1,2,3,5,7,11]\r\n if n in l:\r\n return -1\r\n elif n==6 or n==9:\r\n return 1\r\n elif n==15:\r\n return 2\r\n else:\r\n if n%4==0:\r\n return n//4\r\n elif n%4==1:\r\n return (n-9)//4+1\r\n elif n%4==2:\r\n return (n-6)//4+1\r\n else:\r\n return (n-15)//4+2\r\nq=int(input())\r\nfor i in range(q):\r\n print(fun(int(input())))\r\n \r\n \r\n", "q=int(input())\r\nfor i in range(q):\r\n n=int(input())\r\n if n<4:\r\n print(-1)\r\n else:\r\n n1=n//4\r\n n2=n%4\r\n if n2==1:\r\n if n>=9:\r\n print(n1-2+1)\r\n else:\r\n print(-1)\r\n elif n2==2:\r\n if n>=6:\r\n print(n1-1+1)\r\n else:\r\n print(-1)\r\n elif n2==3:\r\n if n>=15:\r\n print(n1-3+2)\r\n else:\r\n print(-1)\r\n elif n2==0:\r\n print(n1)\r\n\"\"\" print(arr)\r\n b=list(map(list,subset(arr)))\r\n for i in range(len(b)):\r\n #print(sum(b[i]),n,len(b[i]),ma,sum(b[i])==n)\r\n if sum(b[i])==n and len(b[i])>ma:\r\n ma=len(b[i])\r\n c=1\r\n if c==0:\r\n print(-1)\r\n else:\r\n print(ma)\r\n\"\"\"\r\n", "ans = [-1]*15\r\nans[4] = 1\r\nans[6] = 1\r\nans[8] = 2\r\nans[9] = 1\r\nans[10] = 2\r\nans[12] = 3\r\nans[13] = 2\r\nans[14] = 3\r\n\r\nfor i in range(int(input())):\r\n n = int(input())\r\n if n < 15:\r\n print(ans[n])\r\n continue\r\n \r\n r = n % 4\r\n if r == 0:\r\n print(n // 4)\r\n elif r == 2:\r\n print( 1+(n-6)// 4)\r\n elif r == 1:\r\n print( 1 + (n - 9)//4)\r\n else:\r\n print( 2 + (n - 15)//4)\r\n \r\n", "q = int(input())\r\nfor _ in range(q):\r\n n = int(input())\r\n if n in [1,2,3,5,7,11]:\r\n print(-1)\r\n else:\r\n rem = n%4\r\n if rem == 0:\r\n print(int(n/4))\r\n elif rem == 1:\r\n print(1+(n-9)//4)\r\n elif rem == 2:\r\n print(1+(n-6)//4)\r\n else:\r\n print(2+(n-6-9)//4)", "q = int(input())\r\ninputs = [0] * q\r\nfor i in range(q):\r\n inputs[i] = int(input())\r\n\r\nMAX_N = 16\r\n\r\na = [-1] * (MAX_N + 1)\r\na[0] = 0\r\n\r\nfor i in range(4, MAX_N):\r\n for j in [4, 6, 9]:\r\n if i >= j and a[i - j] >= 0:\r\n a[i] = max(a[i], a[i - j] + 1)\r\n\r\nfor n in inputs:\r\n if n < MAX_N:\r\n print(a[n])\r\n else:\r\n k = (n - MAX_N) // 4 + 1\r\n print(a[n - 4 * k] + k)\r\n", "n = int(input())\r\nfor i in range(n):\r\n\tx = int(input())\r\n\tans = 0\r\n\tif x < 4:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tarr = [0, 1, 0, 1]\r\n\t\tans = x // 4\r\n\t\tif (x%4) == 1 and ans >= 2:\r\n\t\t\tans -= 1\r\n\t\telif (x%4) == 3 and ans >= 3:\r\n\t\t\tans -= 1\r\n\t\telif not (x%4) in [0, 2]:\r\n\t\t\tans = -1\r\n\r\n\t\tif ans > 0:\r\n\t\t\tprint(ans)\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n", "from math import ceil\r\nn=int(input())\r\nans=[-1]*17\r\nans[0]=0\r\nfor i in range(1,17):\r\n for j in [4,6,9]:\r\n if i>=j and ans[i-j]!=-1:\r\n ans[i]=max(ans[i-j]+1,ans[i])\r\n \r\nfor i in range(n):\r\n x=int(input())\r\n if x<16:\r\n print(ans[x])\r\n else:\r\n t=ceil((x-16)//4)+1\r\n\r\n print(t+ans[x-4*t])\r\n \r\n \r\n\r\n", "q = int(input())\n\nfor _ in range(q):\n n = int(input())\n x = n%4\n answer = -1\n if (x==0):\n answer = n//4\n elif (x==1):\n if (n>=9):\n answer = n//4-1\n elif (x==2):\n if (n>=6):\n answer = n//4\n else:\n if (n>=15):\n answer = n//4-1\n\n if (answer<=0):\n print (-1)\n else:\n print(answer)\n", "import os, sys, atexit\r\nif sys.version_info[0] < 3:\r\n range = xrange\r\n from cStringIO import StringIO as BytesIO\r\n\r\n sys.stdout = BytesIO()\r\nelse:\r\n from io import BytesIO\r\n\r\n sys.stdout = BytesIO()\r\n _write = sys.stdout.write\r\n sys.stdout.write = lambda s: _write(s.encode())\r\natexit.register(lambda: os.write(1, sys.stdout.getvalue()))\r\n\r\ninput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nfrom sys import stdout, stdin\r\n\r\nout, q = [], int(input())\r\narr = [int(input()) for _ in range(q)]\r\n\r\nfor n in arr:\r\n if n in [1, 2, 3, 5, 7, 11]:\r\n out.append('-1')\r\n else:\r\n ans = 0\r\n if n & 1:\r\n ans += 1\r\n n -= 9\r\n\r\n ans += n // 4\r\n out.append(str(ans))\r\nstdout.write('\\n'.join(out))\r\n", "from sys import stdin,stdout\r\ninput = stdin.read\r\nr = map(int,input().split())\r\nq = next(r)\r\n\r\nfor _ in range(q):\r\n a = next(r)\r\n \r\n if(a in [1,2,3,5,7,11]):\r\n stdout.write(\"-1\\n\")\r\n else:\r\n stdout.write(str(a//4 - (a%4)%2))\r\n stdout.write(\"\\n\")", "import math\r\ndef function(n):\r\n if n<=3:\r\n return (-1)\r\n if n>=4:\r\n if n%4==0:\r\n return (int(n/4))\r\n if n%4!=0:\r\n if n%2==0:\r\n return (math.floor(n/4))\r\n if n%2!=0:\r\n if n==9:\r\n return 1\r\n if n<9:\r\n return -1\r\n total=1\r\n n-=9\r\n if n<=3:\r\n return -1\r\n return (1+math.floor(n/4))\r\n\r\n\r\nif __name__==\"__main__\":\r\n q=int(input())\r\n for k1 in range(q):\r\n n=int(input())\r\n print(function(n))", "q = int(input())\nfor _ in range(q):\n num = int(input())\n if num < 4:\n print(-1)\n elif num % 4 == 1:\n ans = num // 4 - 1\n if ans > 0 and ((ans - 1) * 4 + 9 == num or (ans - 1) * 4 + 15 == num):\n print(ans)\n else:\n print(-1)\n elif num % 4 == 3:\n ans = num // 4 - 1\n if ans - 2 >= 0 and (ans - 2) * 4 + 6 + 9 == num:\n print(ans)\n else:\n print(-1)\n else:\n ans = num // 4\n print(ans)\n", "for _ in range(int(input())):\r\n n, a = int(input()), 0\r\n if n % 4 == 0 or n % 4 == 2:\r\n a = n // 4\r\n else:\r\n a = (n // 4) - 1\r\n if a <= 0 or n == 11:\r\n a = -1\r\n print(a)\r\n", "q = int(input())\r\n\r\nfor i in range(q):\r\n n = int(input())\r\n ret = 0\r\n if n % 2 == 1:\r\n n -= 9\r\n ret += 1\r\n \r\n if n % 4 != 0:\r\n n -= 6\r\n ret += 1\r\n \r\n if n < 0:\r\n print(-1)\r\n else:\r\n print(ret + n // 4)", "queries = []\nfor i in range(int(input())):\n queries.append(int(input()))\nprimos = [1,2,3,5,7,11,13]\ntrazas_menor_15 = []\nfor i in range(15):\n try:\n primos.index(i+1)\n if((i+1) != 13):\n trazas_menor_15.append(-1)\n else:\n raise Exception()\n except:\n trazas_menor_15.append(1)\n for j in range(i+1):\n try:\n primos.index(j+1)\n except:\n if(i-j > 0):\n trazas_menor_15[i] = max(trazas_menor_15[i],trazas_menor_15[i-j-1]+1)\nfor i in queries:\n if(i>15):\n print((-(-(i-15) // 4)) + trazas_menor_15[i - 4*(-(-(i-15) // 4)) -1])\n else:\n print(trazas_menor_15[i-1])\n", "for i in range(int(input())):\r\n n=int(input());t=-1\r\n if n%2==0and n>2:t=n//4\r\n elif n>11 or n==9:t=(n-9)//4+1\r\n print(t)", "for x in range(int(input())):\r\n n = int(input())\r\n k=0\r\n if(n%2):\r\n n-=9\r\n k+=1\r\n if(n%2==0 and n%4!=0 and n>0):\r\n n=n-6\r\n k+=1\r\n if(n%4==0 and n>0):\r\n k+=n//4\r\n n=0\r\n if(n!=0):\r\n print(-1)\r\n else:\r\n print(k)", "n = int(input())\r\ne = []\r\ndef tir(n):\r\n if n in [1,2,3,5,7,11]:\r\n return -1\r\n elif n %2 == 0:\r\n return int(n // 4)\r\n else:\r\n return int(n // 4)-1\r\nfor i in range(n):\r\n r = int(input())\r\n e.append(tir(r))\r\nfor i in e:\r\n print(i)", "cases = int(input())\r\n\r\ndef func(num):\r\n if num in (1, 2, 3, 5, 7, 11):\r\n return -1\r\n \r\n c = 0\r\n if num % 2:\r\n num -= 9\r\n c += 1\r\n\r\n if num % 4:\r\n num -= 6\r\n c += 1\r\n\r\n return c + num//4\r\n\r\n \r\n\r\nfor _ in range(cases):\r\n print(func(int(input())))\r\n", "n=int(input())\r\nfor i in range(n):\r\n num=int(input())\r\n if(num<4):\r\n print(-1)\r\n elif(num%4==0):\r\n print(num//4)\r\n elif(num%4==1 and num>=9):\r\n num-=9\r\n print((num//4) +1 )\r\n elif(num%4==2 and num>=6):\r\n num-=6\r\n print((num//4) + 1)\r\n elif(num%4==3 and num>=15):\r\n num-=15\r\n print((num//4) + 2)\r\n else:\r\n print(-1)\r\n ", "def solve(x):\r\n if x % 4 == 0:\r\n return x // 4\r\n divisors = [6, 9]\r\n ans = -1\r\n for d1 in divisors:\r\n if x - d1 >= 0 and (x - d1) % 4 == 0:\r\n ans = max(ans, (x - d1) // 4 + 1)\r\n for d2 in divisors:\r\n if d1 != d2 and x - d1 - d2 >= 0 and (x - d1 - d2) % 4 == 0:\r\n ans = max(ans, (x - d1 - d2) // 4 + 2)\r\n return ans\r\n\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n n = int(input())\r\n print(solve(n))\r\n", "q = int(input())\nfor i in range(q):\n num = int(input())\n if(num <=3 or num == 5 or num == 7 or num == 11):\n print(-1)\n else:\n tnum =num//4\n if(num%2 == 1):\n print(tnum - 1)\n else:\n print(tnum)\n\n\t \t \t \t\t\t \t \t \t\t \t", "for _ in range(int(input())):\n\tn=int(input())\n\tif n==1 or n==2 or n==3 or n==5 or n==11 or n==7:\n\t\tprint(-1)\n\telse:\n\t\tif n%4==0:\n\t\t\tprint(n//4)\n\t\telif n%4==1:\n\t\t\tprint((n-9)//4+1)\n\t\telif n%4==2:\n\t\t\tprint((n-6)//4+1)\n\t\telse:\n\t\t\tprint((n-15)//4+2)\n", "solve = lambda n: -1 if n in {1, 2, 3, 5, 7, 11} else n // 4 - n % 2\r\nprint(*[solve(int(input())) for i in range(int(input()))])", "t = int(input())\r\ns = 0\r\nfor _ in range(t):\r\n a = [1,2,3,5,7,11]\r\n b = [4,6]\r\n c = [8,10]\r\n n = int(input())\r\n\r\n if n in a:\r\n print(-1)\r\n\r\n elif n in b:\r\n print(1)\r\n\r\n elif n in c:\r\n print(2)\r\n\r\n else:\r\n if n%4 == 0:\r\n s = (n-12)//4 + 3\r\n\r\n elif n%4 == 1:\r\n s = (n-13)//4 + 2\r\n\r\n elif n%4 == 2:\r\n s = (n-14)//4 + 3\r\n\r\n else:\r\n s = (n-15)//4 + 2\r\n\r\n print(s)", "R = lambda: map(int, input().split())\r\nn = int(input())\r\ndp = [0] * 50\r\ndp[4] = dp[6] = dp[9] = 1\r\ndp[8] = 2\r\nfor i in range(10, 16):\r\n dp[i] = max(dp[i - 4] + 1 if dp[i - 4] else 0, dp[i - 6] + 1 if dp[i - 6] else 0, dp[i - 9] if dp[i - 9] + 1 else 0)\r\nfor i in range(n):\r\n x = int(input())\r\n k = max(0, x - 15 + 3) // 4\r\n print(k + dp[x - k * 4] if k + dp[x - k * 4] else -1)", "for _ in range(int(input())):\n\tni = int(input())\n\tif ni % 2 == 0:\n\t\tprint(-1) if ni == 2 else print(ni // 4)\n\telse:\n\t\tprint(-1) if (ni < 9 or ni == 11) else print((ni - 9) // 4 + 1)\n", "#!/usr/bin/python\n\nq = int(input())\nfor _ in range(q):\n n = int(input())\n if n < 4 or n == 5 or n == 7 or n == 11:\n print(-1)\n continue\n\n r = n % 4\n p = n // 4\n if r == 0 or r == 2:\n print(p)\n elif r == 1 or r == 3:\n print(p-1)\n\n", "a = int(input())\r\nfor i in range(a):\r\n k = int(input())\r\n if k in [1,2,3,5,7,11] : print(-1)\r\n elif k in [4,6,9] : print(1)\r\n elif k in [8,10,13,15] : print(2)\r\n elif k in [12,14] : print(3)\r\n elif k % 2 == 0 : print(k//4)\r\n else: print(k//4-1)\r\n", "\r\n\r\nfrom collections import defaultdict\r\n\r\ndef main():\r\n # t = int(input())\r\n # for _ in range(t):\r\n q = int(input())\r\n #a, b = list(map(int, input().split()))\r\n #a = list(map(int, input().split()))\r\n for _ in range(q):\r\n n = int(input())\r\n if n<8:\r\n if n ==4 or n==6:\r\n print(1)\r\n else:\r\n print(-1)\r\n else:\r\n if n%2 == 0:\r\n print(n//4)\r\n else:\r\n n-=9\r\n if n<4:\r\n if n == 0:\r\n print(1)\r\n else:\r\n print(-1)\r\n else:\r\n print(1+n//4)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "for n in map(int,[*open(0)][1:]):print(-1if n in[2,5,7,11]else n//4-n%2)", "for _ in range(int(input())):\n a=int(input())\n if a<4 or a in [5,7,11]:\n print(-1)\n else:\n print(a // 4 - a % 2)\n", "for _ in range(int(input())):n=int(input());print(-1if n in[2,5,7,11]else n//4-n%2)", "q = int(input())\n\nfor _ in range(q):\n n = int(input())\n \n if n in [1,2,3,5,7,11]:\n print(-1)\n continue\n \n total = 0\n if n%2==1:\n n -= 9\n total += 1\n total += n//4\n print(total)\n", "def check(n):\r\n if n==0:\r\n return True\r\n if n==1 or n==2 or n==3:\r\n return False\r\n i=2\r\n while i*i<=n:\r\n if n%i==0:\r\n return True\r\n i+=1\r\n return False\r\n\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n div=n//4\r\n rem=n%4\r\n while div and check(rem)==False:\r\n rem+=4\r\n div-=1\r\n if rem==15 and n%4==3:\r\n div+=1\r\n if check(rem) :\r\n if rem:\r\n print(div+1)\r\n else:\r\n print(div)\r\n else:\r\n print(-1)", "prime=[True]*(17)\r\nprime[0]=prime[1]=False \r\np=2 \r\nwhile(p*p<=16):\r\n if(prime[p]):\r\n for i in range(p*p,17,p):\r\n prime[i]=False \r\n p+=1 \r\n \r\ndp=[-1]*(17)\r\ndp[0]=[0]\r\ndp[4]=1\r\ndp[6]=dp[9]=1\r\ndp[8]=2\r\nfor i in range(10,17):\r\n for j in (4,6,9):\r\n if(prime[i-j]==False and dp[i-j]!=-1):\r\n dp[i]=max(dp[i],dp[i-j]+1)\r\nfor q in range(int(input())):\r\n n=int(input()) \r\n if(n<=16):\r\n print(dp[n])\r\n else:\r\n t=(n-16)//4+1 \r\n print(t+dp[n-4*t])", "tc = int(input())\r\nfor j in range(tc):\r\n n = int(input())\r\n if n%2 and n<9:\r\n print(\"-1\")\r\n elif n== 2 or n == 11:\r\n print(\"-1\")\r\n else:\r\n print((n//4) - (n%2))\r\n", "r = lambda :int(input())\r\na = [0,-1]\r\nfor i in range(r()):\r\n x = r()\r\n if x in [1,2,3,5,7,11]:\r\n print(-1)\r\n else:\r\n print(x//4 + a[x%2])", "for _ in range(int(input())):\r\n n=int(input())\r\n if n==1 or n==2 or n==3 or n==5 or n==7 or n==11:\r\n print(-1)\r\n else:\r\n if n%2==0:\r\n print(n//4)\r\n else:\r\n print(n//4-1)", "\r\ndef MurekkebCemlerinSayi(n):\r\n if n < 4:\r\n return -1\r\n\r\n rem = n % 4\r\n\r\n if rem == 0:\r\n return n // 4\r\n\r\n\r\n if rem == 1:\r\n if n < 9:\r\n return -1\r\n\r\n return (n - 9) // 4 + 1\r\n\r\n if rem == 2:\r\n return (n - 6) // 4 + 1\r\n\r\n\r\n if rem == 3:\r\n if n < 15:\r\n return -1\r\n\r\n return (n - 15) // 4 + 2\r\n\r\nq = int(input())\r\nfor i in range(0,q):\r\n n = int(input())\r\n print(MurekkebCemlerinSayi(n),end='\\n')\r\n", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n if n in [1, 2, 3, 5, 7, 11]:\r\n print(-1) \r\n elif n % 4 == 0:\r\n print(n // 4)\r\n elif n % 4 == 1:\r\n print((n - 9) // 4 + 1)\r\n elif n % 4 == 2:\r\n print((n - 6) // 4 + 1)\r\n elif n % 4 == 3:\r\n print((n - 15) // 4 + 2)\r\n", "for i in range(int(input())):\r\n num = int(input())\r\n print(-1 if num in [1, 2, 3, 5, 7, 11] else (num >> 2) - (num & 1))", "from sys import stdin,stdout\r\ninput = stdin.read\r\nr = map(int,input().split())\r\nq = next(r)\r\n\r\nfor _ in range(q):\r\n a = next(r)\r\n \r\n if(a < 4 or a == 5 or a == 7 or a == 11):\r\n stdout.write(\"-1\\n\")\r\n else:\r\n stdout.write(str(a//4 - (a%4)%2))\r\n stdout.write(\"\\n\")", "q = int(input())\nfor _ in range(q):\n number = int(input())\n if number in (1, 2, 3, 5, 7, 11):\n print(-1)\n continue\n cnt = 0\n if number % 2:\n number -= 9\n cnt += 1\n d, m = divmod(number, 4)\n if m in (0, 2):\n cnt += d\n print(cnt)\n else:\n print(-1)\n\n", "import sys\r\nreadline = sys.stdin.readline\r\n\r\nQ = int(readline())\r\nAns = [None]*Q\r\n\r\nans = [None, -1, -1, -1, 1, -1, 1, -1, 2, 1, 2, -1, 3, 2, 3, 2]\r\n\r\nfor qu in range(Q):\r\n N = int(readline())\r\n if N <= 15:\r\n Ans[qu] = ans[N]\r\n continue\r\n if N%4 == 0:\r\n Ans[qu] = N//4\r\n elif N%4 == 1:\r\n Ans[qu] = N//4 - 1\r\n elif N%4 == 2:\r\n Ans[qu] = N//4\r\n else:\r\n Ans[qu] = N//4 - 1\r\nprint('\\n'.join(map(str, Ans)))", "import sys\ninput = sys.stdin.readline\n\nfor _ in range(int(input())):\n n = int(input())\n fail = [5,7,11] + list(range(3))\n if n in fail:\n print(-1)\n else:\n print(n // 4 - n % 2)", "for _ in range(int(input())):\r\n k=int(input())\r\n if k == 4 or k == 6 or k == 9:\r\n print(1)\r\n elif k == 1 or k == 2 or k == 3 or k == 5 or k == 7 or k == 11:\r\n print(-1)\r\n else:\r\n comp = [4, 6, 9]\r\n if k % comp[0] == 0:\r\n print(k // comp[0])\r\n elif (k - comp[1]) % comp[0] == 0:\r\n print((k - comp[1]) // comp[0] + 1)\r\n elif (k - comp[2]) % comp[0] == 0:\r\n print((k - comp[2]) // comp[0] + 1)\r\n elif (k - comp[2] - comp[1]) % comp[0] == 0:\r\n print((k - comp[2] - comp[1]) // comp[0] + 2)\r\n elif k % comp[1] == 0:\r\n print(k // comp[1])\r\n elif (k - comp[2]) % comp[1] == 0:\r\n print((k - comp[2]) // comp[1] + 1)\r\n else:\r\n print(k // comp[2])\r\n\r\n\r\n\r\n\r\n", "import sys;sc = sys.stdin.readline;out=sys.stdout.write\r\nfor _ in range(int(sc())):\r\n n=int(sc())\r\n if n in[2,5,7,11]:out(str(-1)+\"\\n\")\r\n elif n%2:out(str(n//4-1)+\"\\n\")\r\n else:out(str(n//4)+\"\\n\")", "\nn=int(input())\nnum=[]\nans=[]\nm=n\nwhile m > 0:\n num.append(int(input()))\n m=m-1\nfor x in num:\n tmp=x%4\n div=x//4\n if tmp==0:\n ans.append(div)\n elif tmp==1:\n if div>=2:\n ans.append(div-1)\n else:\n ans.append(-1)\n elif tmp==2:\n if div>=1:\n ans.append(div)\n else:\n ans.append(-1)\n elif tmp==3:\n if div>=3:\n ans.append(div-1)\n else:\n ans.append(-1)\n\nfor x in ans:\n print(x)\n ", "maxn = 16\nans = [-1]*maxn\nans[0] = 0\narr = [4, 6, 9]\nfor i in range(1, maxn):\n for j in arr:\n if i >= j and ans[i-j] != -1:\n ans[i] = max(ans[i], ans[i-j]+1)\n\nq = int(input())\nwhile q:\n n = int(input())\n if n < maxn:\n print(ans[n])\n else:\n t = (n-maxn)//4+1\n print(t+ans[n-4*t])\n q -= 1", "n = int(input())\r\nfor i in range(n):\r\n x = int(input())\r\n if x in [1, 2, 3, 5, 7, 11]:\r\n print(-1)\r\n elif x % 2 == 0:\r\n print(x // 4)\r\n else:\r\n print(x // 4 - 1)", "q=int(input())\r\nfor _ in range(q):\r\n n=int(input())\r\n f=n//4\r\n r=n%4\r\n if f:\r\n if r==2 or r==0:\r\n print(f)\r\n elif r==1 and f>=2:\r\n print(f-1)\r\n elif r==3 and f>=3:\r\n print(f-1)\r\n else:\r\n print(-1)\r\n else:\r\n print(-1)", "q = int(input())\r\na = [4, 6, 8, 9]\r\nfor i in range(q):\r\n n = int(input())\r\n c = 0\r\n if n % 2 == 1:\r\n c = 1\r\n n -= 9\r\n if n < 0:\r\n print(-1)\r\n else:\r\n if n % 4 == 0:\r\n c += n // 4\r\n elif n % 4 == 2 and n >= 6:\r\n c += n // 4\r\n else:\r\n c = -1\r\n print(c)\r\n", "dp = [-1] * 16\r\ndp[0] = 0\r\ndivs = [4, 6, 9]\r\nfor i in range(16):\r\n for j in divs:\r\n if i >= j and dp[i - j] != -1:\r\n dp[i] = max(dp[i], dp[i - j] + 1)\r\n \r\nfor _ in range(int(input())):\r\n n = int(input())\r\n t = (n - 16) // 4 + 1\r\n if n < 16:\r\n print(dp[n])\r\n else:\r\n print(t + dp[n - t * 4])\r\n", "t=1\r\nt=int(input())\r\nfor _ in range (t):\r\n n=int(input())\r\n #n,k=map(int,input().split())\r\n #a=list(map(int,input().split()))\r\n #b=list(map(int,input().split()))\r\n #s=input()\r\n #n=len(s)\r\n if n<=3:\r\n print(-1)\r\n else:\r\n if n%2==0:\r\n print(n//4)\r\n elif n<9 or n==11:\r\n print(-1)\r\n else:\r\n print(1+(n-9)//4)", "t = int(input())\r\nfor i in range(t):\r\n n = int(input())\r\n if n in [1, 2, 3, 5, 7, 11]:\r\n print(-1) \r\n else:\r\n print((n // 4) - (n % 2))\r\n", "q = int(input())\r\nfor i in range(q):\r\n n = int(input())\r\n x, y = n // 4, n % 4\r\n if y == 0: print(x)\r\n elif y == 1:\r\n if x >= 2: print(x - 1)\r\n else: print(-1)\r\n elif y == 2:\r\n if x >= 1: print(x)\r\n else: print(-1)\r\n else:\r\n if x >= 3: print(x-1)\r\n else: print(-1)", "a = int(input())\nwhile a:\n ans = 0\n a -= 1\n b = int(input())\n if b < 4 or b == 5 or b == 7 or b == 11:\n ans = -1\n else:\n if b % 2:\n b -= 9\n ans += 1\n if b % 4:\n b -= 6\n ans += 1\n ans += b // 4\n print(ans)\n\n \t \t \t \t \t \t\t \t\t\t \t\t\t \t\t\t", "for _ in range(int(input())):\r\n n = int(input())\r\n if n%4==0:\r\n print(n//4)\r\n elif n%4==1 and n-9>=0:\r\n print((n-9)//4 + 1)\r\n elif n%4==2 and n-6>=0:\r\n print((n-6)//4 + 1)\r\n elif n%4==3 and n-15>=0:\r\n print((n-15)//4 + 2)\r\n else:\r\n print(-1)\r\n ", "q = int(input())\r\nfor i in range(q):\r\n number = int(input())\r\n if number < 3:\r\n print(-1)\r\n else:\r\n DP = [-1] * 17\r\n DP[0] = 0\r\n for j in range(4, 17):\r\n for k in [4, 6, 9]:\r\n if j >= k and DP[j - k] != -1:\r\n DP[j] = max(DP[j], DP[j - k] + 1)\r\n if 4 < number < 16:\r\n print(DP[number])\r\n else:\r\n index = (number - 16) // 4 + 1\r\n print(DP[number - index * 4] + index)", "\"\"\"ll=[]\r\nfor i in range(1,100):\r\n t=2\r\n while t**2<=i:\r\n if i%t==0:\r\n ll.append(i)\r\n break\r\n t+=1\r\nprint(ll)\"\"\"\r\ngg=[1,2,3,5,7,11]\r\nfor _ in range(int(input())):\r\n n=int(input())\r\n if n in gg:\r\n print(-1)\r\n else:\r\n g=n%4\r\n if g==0:\r\n print(n//4)\r\n elif g==1:\r\n print(((n-9)//4)+1)\r\n elif g==2:\r\n print(((n-6)//4)+1)\r\n else:\r\n print(((n-15)//4)+2)\r\n", "q = int(input())\nanswer = list()\n\nvalues = [0,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1]\n\nfor i in range(4, len(values)):\n for n in [4, 6, 9]:\n if(i >= n) and (values[i - n] != -1):\n values[i] = max(values[i], values[i - n] + 1)\n\nwhile q > 0:\n n = int(input())\n if(n < 16):\n answer.append(values[n])\n else:\n aux = int(((n - 16) / 4) + 1)\n answer.append(aux + values[n - (aux * 4)])\n q -=1\n\nfor a in answer:\n print(a)\n \t \t\t\t\t \t\t\t\t \t \t\t\t \t \t", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:25/05/2020\r\n\r\n'''\r\nimport sys\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\ndef read():\r\n tc=0\r\n if tc:\r\n input=sys.stdin.readline\r\n else:\r\n sys.stdin=open('input1.txt', 'r')\r\n sys.stdout=open('output1.txt','w')\r\n\r\ndef isprime(n):\r\n if(n==1):\r\n return 0\r\n for i in range(2,int(sqrt(n))+1):\r\n if(n%i==0):\r\n return 0\r\n return 1\r\n \r\nfor i in range(ii()):\r\n \r\n n=ii()\r\n \r\n if(n%4==0 and n>0):\r\n print(n//4)\r\n elif(n%4==2 and n>2):\r\n print(n//4)\r\n elif(n%4==3 and n>=15):\r\n print(n//4-1)\r\n elif(n%4==1 and n>=9):\r\n print(n//4-1)\r\n else:\r\n print(\"-1\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\n\r\nres = \"\"\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n if x % 2 != 0:\r\n z = (x-9) // 4\r\n if x == 1 or x == 3 or x == 5 or x == 7 or x == 11:\r\n res += \"-1\\n\"\r\n else:\r\n res += str(z+1)+\"\\n\"\r\n else:\r\n z = x//4\r\n if x < 4:\r\n res += \"-1\\n\"\r\n else:\r\n res += str(z)+\"\\n\"\r\nprint(res[:-1])\r\n", "from sys import stdin\n\nrInt = lambda : int(stdin.readline().strip(\"\\n\"))\nrIntArray = lambda : [int(x) for x in stdin.readline().split()]\n\nrString = lambda : stdin.readline().strip(\"\\n\")\nrStrArray = lambda : [x for x in stdin.readline().split()]\n\nfor _ in range(rInt()):\n\n\tn = rInt()\n\n\tif n in [1,2,3,5,7,11]: print(-1)\n\n\telif n%4 == 0: print(n//4)\n\telif n%4 == 1: print(n//4 - 1)\n\telif n%4 == 2: print(n//4)\n\telif n%4 == 3: print(n//4 - 1)\n", "number = int(input())\r\nfor i in range(number):\r\n\tnum = int(input())\r\n\tif num != 1 and num != 2 and num != 3 and num != 5 and num != 7 and num != 11:\r\n\t\tif num%4 == 0:\r\n\t\t\tprint(num//4)\r\n\t\telif num%4 == 1:\r\n\t\t\tprint((num-9)//4+1)\r\n\t\telif num%4 == 2:\r\n\t\t\tprint((num-6)//4+1)\r\n\t\telse:\r\n\t\t\tprint((num-15)//4+2)\r\n\telse:\r\n\t\tprint(\"-1\")", "for _ in range(int(input())):\r\n n=int(input())\r\n ans=0\r\n if n<=3 or n==5 or n==11 or n==7:\r\n print(-1)\r\n else:\r\n ans=n//4\r\n if (n&1):\r\n ans-=1\r\n print(ans)\r\n ", "t = int(input())\r\narr = [0,-1,-1,-1,1,-1,1,-1,2,1,2,-1,3,2,3,2]\r\nfor _ in range(t):\r\n n = int(input())\r\n if n <= 15 :\r\n print(arr[n])\r\n else:\r\n if n % 4 == 0 or n % 4 == 2:\r\n print(n//4)\r\n else:\r\n print(n//4-1)", "def check(n):\n if n < 4:\n return -1\n c = n // 4\n r = n % 4\n if r == 0 or r == 2:\n return c\n if r == 1:\n if c < 2:\n return -1\n else:\n return c - 1\n if r == 3:\n if c < 3:\n return -1\n else:\n return c - 1\n\nq = int(input())\nanswer = []\nwhile q > 0:\n q -= 1\n answer.append(str(check(int(input()))))\n\nprint ('\\n'.join(answer))", "t=int(input())\r\nwhile t>0:\r\n n=int(input())\r\n if n<4:\r\n print(-1)\r\n elif n%4==0:\r\n print(n//4)\r\n elif n%4==1:\r\n if n==5:\r\n print(-1)\r\n elif n==9:\r\n print(1)\r\n else:\r\n print(n//4-1)\r\n elif n%4==2:\r\n print(n//4)\r\n else:\r\n if n==7:\r\n print(-1)\r\n elif n==11:\r\n print(-1)\r\n else:\r\n print(n//4-1)\r\n t-=1", "for _ in range(int(input())):\n n=int(input())\n ans = 0\n if n == 1 or n == 2 or n == 3 or n==7 or n == 11 or n == 5:\n print(-1)\n else:\n if n%4 == 1:\n ans+=1\n n-=9\n elif n%4 == 2:\n ans+=1\n n-=6\n elif n%4 == 3:\n ans+=2\n n-=15\n\n ans+=n/4\n print(int(ans))\n", "q = int(input())\nfor i in range(q):\n n = int(input())\n if n % 2 == 1:\n if n < 9:\n print(-1)\n elif n == 9:\n print(1)\n elif n == 11:\n print(-1)\n else:\n print(1 + int((n-9)/4))\n else:\n if n == 2:\n print(-1)\n else:\n print(int(n/4))", "from sys import stdin\r\nz=[-1]*16;z[0]=0;ans=''\r\nfor i in range(16):\r\n for j in [4,6,9]:\r\n if i-j>=0 and z[i-j]!=-1:z[i]=max(z[i],z[i-j]+1)\r\nfor _ in \" \"*int(stdin.readline()):\r\n a=int(stdin.readline())\r\n if a<16:print(z[a])\r\n else:k=1+((a-16)//4);print(k+z[a-4*k])", "for _ in range(int(input())):\r\n n = int(input())\r\n d, y = divmod(n, 4)\r\n if y == 0:\r\n print(d)\r\n elif y == 1:\r\n if d > 1:\r\n print(d - 1)\r\n else:\r\n print(-1)\r\n elif y == 2:\r\n if d:\r\n print(d)\r\n else:\r\n print(-1)\r\n elif y == 3:\r\n if d > 2:\r\n print(d - 1)\r\n else:\r\n print(-1)\r\n", "q = int(input())\nanswer = []\nfor i in range(q):\n n = int(input())\n if n == 1 or n == 2 or n == 3 or n == 5 or n == 7 or n == 11: answer.append(-1)\n else: \n if n % 4 == 0 or n % 4 == 2: answer.append(n//4)\n if n % 4 == 1 or n % 4 == 3: answer.append(n//4 - 1)\nprint(*answer, sep='\\n')\n \t \t \t\t \t \t\t \t\t \t\t", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/20 08:33\r\n\r\n\"\"\"\r\n\r\nQ = int(input())\r\n\r\nfor i in range(Q):\r\n N = int(input())\r\n\r\n ds = {4, 6, 9, 15}\r\n\r\n ans = -1\r\n for d in ds:\r\n if N >= d and (N-d) % 4 == 0:\r\n if d == 15:\r\n ans = (N-d)//4+2\r\n else:\r\n ans =(N-d)//4+1\r\n break\r\n print(ans)", "for i in range(int(input())):\r\n n = int(input())\r\n arr = [1, 2, 3 ,5, 7, 11]\r\n if n in arr:\r\n print(-1)\r\n else:\r\n y = n//4\r\n if n&1:\r\n y-=1\r\n print(y)\r\n", "q = int(input())\r\nfor i in range(q):\r\n a = int(input())\r\n c = 0\r\n if a%2:\r\n a-=9\r\n c+=1\r\n if a < 0:\r\n print(-1)\r\n continue\r\n if a%4:\r\n a-=6\r\n c+=1\r\n if a<0:\r\n print(-1)\r\n continue\r\n c+=a//4\r\n print(c)\r\n", "nums=[4,9,6,15]\r\n\r\nt=int(input())\r\nfor _ in range(t):\r\n n=int(input())\r\n\r\n if n < nums[n%4]:\r\n print(-1)\r\n else:\r\n ans = (n-nums[n%4])//4+1\r\n if(n%4==3):\r\n ans+=1\r\n print(ans)", "def find_summand(n):\n if (n % 4 == 0):\n return n // 4\n if (n % 4 == 1):\n if (n < 9):\n return -1\n return (n-9) // 4 + 1\n if (n % 4 == 2):\n if (n < 6):\n return -1\n return (n-6) // 4 + 1\n if (n < 15):\n return -1\n return (n-15) // 4 + 2\n\nq = int(input())\nfor tc in range(q):\n n = int(input())\n print(find_summand(n))", "m = 16\r\nans = [-1] * m\r\nans[0] = 0\r\nfor i in range(m):\r\n for j in [4, 6, 9]:\r\n if i >= j and ans[i - j] != -1:\r\n ans[i] = max(ans[i], ans[i - j] + 1)\r\n\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n n = int(input())\r\n if n < m:\r\n print(ans[n])\r\n else:\r\n t = (n - m) // 4 + 1\r\n print(t + ans[n - t * 4])", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nfor _ in range(ii()):\r\n n=ii()\r\n print(-1 if n in [1,2,3,5,7,11] else (n//4-(n&1)))", "for _ in \" \"*int(input()):\r\n a=int(input())\r\n if a<4 or a in [5,7,11]:print(-1)\r\n else:print((a//4)-(a%2))", "h=int(input())\r\nfor i in range(h):\r\n n=int(input())\r\n a=[1,2,3,5,7,11]\r\n if n in a:\r\n print(-1)\r\n elif n%2==1:\r\n print((n-9)//4+1)\r\n else:\r\n print(n//4)", "import sys \r\ninput = sys.stdin.readline \r\n\r\nq = int(input())\r\nwhile(q):\r\n n = int(input())\r\n if(n % 2 == 0):\r\n if(n // 4 == 0):\r\n print(-1)\r\n else:\r\n print(n // 4)\r\n elif(n % 4 == 1):\r\n if((n // 4 - 1) <= 0):\r\n print(-1)\r\n else:\r\n print(n // 4 - 1)\r\n else:\r\n if(n < 15):\r\n print(-1)\r\n else:\r\n print((n - 15) // 4 + 2)\r\n \r\n q -= 1", "q=int(input())\r\nfor _ in range(q):\r\n n=int(input())\r\n d=n//4;r=n%4\r\n if d:\r\n if r==2 or r==0:print(d)\r\n elif r==1 and d>=2:print(d-1)\r\n elif r==3 and d>=3:print(d-1)\r\n else:print(-1)\r\n else:print(-1)\r\n", "for i in range(int(input())):\r\n n = int(input())\r\n if n in (1, 2, 3, 5, 7, 11):\r\n print(-1)\r\n elif n % 2:\r\n print((n - 9) // 4 + 1)\r\n else:\r\n print(n // 4)", "q = int(input())\r\n\r\nlis = [-1,-1,-1,-1,1,-1,1,-1,2,1,2,-1]\r\n\r\nfor i in range(q):\r\n\ta = (int(input()))\r\n\tif a<= 11:\r\n\t\tprint(lis[a])\r\n\telse:\r\n\t\tans = a//4\r\n\t\tif a%2 == 1:\r\n\t\t\tans -= 1\r\n\t\tprint(ans)\r\n\t", "n = int(input())\nparams = []\nfor _ in range(0,n):\n params.append(int(input()))\n \nfor p in params:\n if p <= 3 or p in [5,7,11]:\n print(-1)\n elif p%4 in [0,2]:\n print(int(p/4))\n else:\n print(int(p/4)-1)\n \t\t\t\t \t \t \t\t\t \t\t \t\t \t \t \t", "solve = lambda n: -1 if n in {1, 2, 3, 5, 7, 11} else n // 4 - n % 2\r\nresults = [solve(int(input())) for i in range(int(input()))]\r\nprint(\"\\n\".join(map(str, results)))# 1698138008.6555486", "q = int(input())\r\nwhile q > 0:\r\n n = int(input())\r\n add = 0\r\n if n % 2 == 1:\r\n n -= 9\r\n add += 1\r\n if n < 4 and n != 0:\r\n print(-1)\r\n else:\r\n print (n // 4 + add)\r\n q -= 1", "for _ in range(int(input())):\r\n n=int(input())\r\n if n==4:\r\n print(1)\r\n continue\r\n if n<=3 or n==5 or n==7 or n==11:\r\n print(-1)\r\n continue\r\n if n&1:\r\n n=n-9 \r\n cnt=1 \r\n if n%4==0:\r\n cnt+=n//4 \r\n else:\r\n if n>=6:\r\n cnt+=1 \r\n n=n-6 \r\n cnt+=n//4 \r\n else:\r\n print(-1)\r\n continue\r\n print(cnt)\r\n else:\r\n if n%4==0:\r\n cnt=n//4 \r\n else:\r\n if n>=6:\r\n n=n-6\r\n cnt=1 \r\n cnt+=n//4\r\n else:\r\n print(-1)\r\n exit()\r\n print(cnt)", "n = int(input())\r\n\r\nfor i in range(n):\r\n x = int(input())\r\n if x % 4 == 0:\r\n print(x // 4)\r\n if x % 4 == 1:\r\n if x // 4 >= 2:\r\n print(x // 4 - 1)\r\n else :\r\n print('-1')\r\n if x % 4 == 2:\r\n if x // 4 >= 1:\r\n print( x // 4 )\r\n else :\r\n print('-1')\r\n if x % 4 == 3:\r\n if x // 4 >= 3:\r\n print( x // 4 - 1)\r\n else :\r\n print('-1')\r\n", "q = int(input())\r\n\r\n\r\nfor _ in range(q):\r\n n = int(input())\r\n\r\n if n in [1, 2, 3, 5, 7, 11]:\r\n print(-1)\r\n continue\r\n\r\n counter = 0\r\n if n % 2 == 1:\r\n counter += 1\r\n n -= 9\r\n counter += n // 4\r\n print(counter)\r\n", "I = lambda: int(input())\r\n\r\nfor _ in range(I()):\r\n a, b = divmod(I(), 4)\r\n \r\n if b < 1:\r\n print(a)\r\n elif b < 2:\r\n print(a - 1 - (a == 1))\r\n elif b < 3:\r\n print(a - (a == 0))\r\n else:\r\n print(a * (a > 2) - 1)", "T=int(input())\r\nfor _ in range(T):\r\n n=int(input())\r\n if n%4==0:print(n//4)\r\n elif n>=6 and (n-6)%4==0:print((n-6)//4+1)\r\n elif n>=9 and (n-9)%4==0:print((n-9)//4+1)\r\n elif n>=15 and (n-15)%4==0:print((n-15)//4+2)\r\n else:print(-1)\r\n", "for n in[*open(0)][1:]:n=int(n);print(-1if n in[2,5,7,11]else n//4-n%2)" ]

[ "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Jun 3 11:57:46 2020\n\n@author: shailesh\n\"\"\"\n\nfrom math import gcd\n\ndef reduce_fraction(x,y):\n d = gcd(x,y)\n x = x//d\n y = y//d\n return x,y\n\nN = int(input())\n\nA = [int(i) for i in input().split()]\n\nA.sort()\n\nd0 = A[0]\n\n\nsum_val = 0\n\nfor i in range(N-1):\n m_bf = i+2\n m_af = N - i - 1\n d = A[i+1]-A[i]\n# d = 1\n sum_val +=m_af*(2*m_bf - 1)*d\n# print(A[i],A[i+1],sum_val)\nnumerator = N*d0 + sum_val\n\ndenominator = N\n\nnumerator,denominator = reduce_fraction(numerator,denominator)\n\nprint(numerator,denominator)\n\n\n\n\n\n\n\n#from itertools import permutations\n#perms = list(permutations([2,3,5]))\n#\n#perms = [(0,) + perm for perm in perms]\n#\n#d = {}\n#d['02'] = 0\n#d['23'] = 0\n#d['35'] = 0\n#for perm in perms:\n# for i in range(len(perm)-1):\n# \n# start_end = [perm[i],perm[i+1]]\n# start_end.sort()\n# rng = range(start_end[0],start_end[1]+1)\n# if 0 in rng and 2 in rng:\n# d['02'] +=1\n# if 2 in rng and 3 in rng:\n# d['23'] += 1\n# if 3 in rng and 5 in rng:\n# d['35'] +=1\n \n ", "from math import *\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nS1=sum(arr)\r\nsums=0\r\nsumsi=arr[0]\r\nfor i in range(1,n):\r\n \r\n sums+=(i)*(arr[i])-sumsi\r\n sumsi+=arr[i]\r\nS2=sums\r\nnum=S1+2*S2\r\nden=n\r\n#print(num,den)\r\nwhile(int(gcd(num,den))!=1):\r\n x=gcd(num,den)\r\n num=num//x\r\n den=den//x\r\nprint(int(num),int(den))\r\n", "def gcd(a,b) : return a if b==0 else gcd(b,a%b)\r\n\r\nn = int(input())\r\nl = sorted(map(int, input().split()))\r\nt = sum((i+i-n+1)*l[i] for i in range(n))\r\nt = t+t+sum(l)\r\nd = gcd(t,n)\r\nprint(t//d,n//d)", "import math\r\n\r\ndef race(lst):\r\n n=len(lst)\r\n sm=[0]*(n+2)\r\n sd=[0]*(n+2)\r\n lst=sorted(lst)\r\n lst.insert(0,0)\r\n ans=0\r\n for i in range(1,n+1):\r\n sm[i]=sm[i-1]+lst[i]\r\n for i in range(n,0,-1):\r\n sd[i]=sd[i+1]+lst[i]\r\n #print(sd)\r\n ans=0\r\n #print(sm)\r\n #print(sm[1])\r\n for i in range(1,n+1):\r\n tmp=(2*(i*lst[i]-sm[i-1]))\r\n ans+=tmp\r\n #print(str(i) + \" \" + str(lst[i]) + \" \" + str(sm[i-1]) + \" - \" +\r\n #str(tmp) + \" \" + str(ans))\r\n tmp=(2*(sd[i+1]-(n-i)*lst[i])) \r\n ans+=tmp\r\n #print(str(sd[i+1]) + \" \" + str(n-1) + \" \" + str(lst[i]) + \" - \" +\r\n #str(tmp) + \" \" + str(ans))\r\n n*=2\r\n tmp=math.gcd(ans,n)\r\n #print(str(tmp) + \" \" + str(ans) + \" \" + str(n))\r\n fn=str(ans//tmp) + \" \" + str(n//tmp)\r\n return fn\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(race(lst))\r\n", "import math\r\n\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\ns=sum(a)\r\na=sorted(a)\r\nx,s1=0,0\r\nfor i in range(0,n) :\r\n\tif i==0 :\r\n\t\tx+=a[i]\r\n\t\tcontinue\r\n\ts1=s1+(i*a[i]-x)\r\n\tx+=a[i]\r\ns1*=2\r\nans=s+s1\r\ngcd=math.gcd(ans,n)\r\nprint((ans//gcd),(n//gcd))", "from math import gcd\n\n\nn = int(input())\n\na = list(map(int, input().split()))\n\na.sort()\n\ns = sum(a)\n\ncurrent_sum = 0\ns2 = 0\nfor i in range(n):\n s2 += a[i] * i - current_sum\n\n current_sum += a[i]\n\ng = gcd(s + 2*s2, n)\n\n\nprint((s +2*s2) // g, n // g)", "import math\r\n\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n arr.sort()\r\n right = sum(arr)\r\n left = 0\r\n\r\n arr.insert(0,0)\r\n total = 0\r\n for i in range(1,n+1):\r\n left += arr[i]\r\n total += i*arr[i]-left\r\n total += right-(n-i)*arr[i]\r\n right -= arr[i]\r\n\r\n g = math.gcd(max(total,n),min(total,n))\r\n total = total//g\r\n n = n//g\r\n\r\n print(total,n)\r\n\r\n\r\nmain()\r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport sys\r\nimport string\r\nsys.setrecursionlimit(99999)\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nsu = sum(arr)\r\nsw = 0\r\npre = 0\r\nfor i, c in enumerate(arr):\r\n sw += 2*(c*i-pre)\r\n pre += c\r\n\r\nsw += su\r\ng = math.gcd(sw, n)\r\nsw //= g\r\nn //= g\r\nprint(sw, n)\r\n", "def gcd (n,m):\n if n % m == 0: return m\n return gcd (m, n%m)\n\nn = int (input ())\na = list (map (int, input().split()))\na.sort()\n\ns = a[0]\nsleft = 0\nfor i in range (1,len(a)):\n sleft += (i*a[i] - s)\n s += a[i]\n\ntot = s + sleft*2\nprint (tot//gcd(tot,n), n//gcd(tot,n))\n", "from fractions import gcd\r\n\r\nn = int(input())\r\na = sorted([int(x) for x in input().split()])\r\n\r\nans = 0\r\nl = 0\r\nfor i in range(n):\r\n ans += i * a[i] - l\r\n l += a[i]\r\n\r\nans = sum(a) + 2 * ans\r\ng = gcd(ans, n)\r\n\r\nprint(ans // g, n // g)\r\n", "def gcd(m, n): return m if n == 0 else gcd(n, m%n)\r\n\r\nn = int(input())\r\n\r\na = sorted(map(int, input().split()))\r\n\r\ncur = sum(a)\r\nans = cur\r\npre = 0\r\n\r\nfor i in range(n):\r\n cur += (i+i-n) * (a[i]-pre)\r\n ans += cur\r\n pre = a[i]\r\n\r\ng = gcd(ans, n)\r\n\r\nprint(ans//g, n//g)\r\n", "# Thank God that I'm not you.\r\nfrom itertools import permutations, combinations;\r\nimport heapq;\r\nfrom collections import Counter, deque;\r\nimport math;\r\nimport sys;\r\nfrom functools import lru_cache;\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\n\r\narray = list(map(int, input().split()))\r\n\r\narray.sort()\r\n\r\n\r\nsumOne, sumTwo = 0, 0;\r\n\r\nfor i, num in enumerate(array):\r\n sumOne += ((n - 1) * num)\r\n sumOne += (num * i * (n - 1) * 2)\r\n sumTwo += (num * (n - i - 1) * (n - 1) * 2)\r\n\r\n\r\ng = math.gcd(sumOne - sumTwo, n * (n - 1))\r\n\r\nprint((sumOne - sumTwo) // g, (n * (n - 1)) // g)\r\n", "import math\r\nn = int(input())\r\narr = sorted(list(int(i) for i in input().split()))\r\nt = sum((i+i-n+1)*arr[i] for i in range(n))\r\nt = t + t + sum(arr)\r\nd = math.gcd(t, n)\r\nprint(t//d, n//d)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import gcd\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\na = sum(w)\r\nc = 0\r\nfor i in range(n-1):\r\n c += (w[i+1]-w[i])*(i+1)*(n-1-i)\r\na += c*2\r\nx = gcd(a, n)\r\nprint(a//x, n//x)\r\n", "from sys import stdin\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n ar = list(map(int, stdin.readline().split()))\r\n\r\n s1 = sum(ar)\r\n ar.sort()\r\n prefix = [0]\r\n for i in range(n):\r\n prefix.append(prefix[-1] + ar[i])\r\n s2 = 0\r\n for i in range(n):\r\n s2 += (prefix[-1] - prefix[i]) - ar[i] * (n - i)\r\n s = s1 + 2 * s2\r\n d = gcd(s, n)\r\n print(s // d, n // d)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def gcd(a, b):\r\n while a > 0 and b > 0:\r\n if a > b:\r\n a %= b\r\n else:\r\n b %= a\r\n return max(a, b)\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort(reverse=True)\r\n ans = sum(a)\r\n for i in range(n):\r\n ans += 2*a[i]* (n-2*i - 1)\r\n d = gcd(ans, n)\r\n ans //= d\r\n n //= d\r\n print(ans, n)\r\nif __name__ == \"__main__\":\r\n main()", "import math\n \nn = int(input())\na = list(map(int, input().split()))\na = sorted(a)\n\nans = 0\ngg = 0\nfor i in range(n):\n ans += i * a[i] - gg\n gg += a[i]\n \nans = sum(a) + 2 * ans\ng = math.gcd(ans, n)\nans//=g\nn//=g\nprint(ans, n)\n\n \t\t \t \t\t \t \t \t\t \t \t \t\t\t\t", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Tourist_Problem():\r\n def compute_hcf(num1,num2):\r\n if num1 == 1 :\r\n return 1\r\n if num2 == 1:\r\n return 1\r\n \r\n y = min(num1,num2)\r\n if num1 == y :\r\n x = num2\r\n else:\r\n x = num1 \r\n \r\n while(y):\r\n x,y = y , x % y\r\n \r\n return x\r\n\r\n n = inp()\r\n sequence = inlt()\r\n sequence_sorted = sorted(sequence)\r\n\r\n total_sum = sum(sequence)\r\n\r\n modular_sum = 0 \r\n for index,element in enumerate(sequence_sorted):\r\n modular_sum += ((index*element) - ((n-1-index)*element))\r\n \r\n Nr = total_sum + 2*modular_sum \r\n Dr = n \r\n hcf = compute_hcf(Nr,Dr)\r\n Nr = Nr // hcf \r\n Dr = Dr // hcf \r\n print(str(Nr) + ' ' + str(Dr))\r\n return \r\n\r\n\r\nTourist_Problem()", "import math\r\ndef main(arr):\r\n arr.sort() \r\n \r\n n=len(arr)\r\n prefix=[arr[0]]\r\n for i in range(1,len(arr)):\r\n prefix.append(prefix[-1]+arr[i])\r\n ans=sum(arr)\r\n for i in range(len(arr)):\r\n s=0 \r\n if (i>0):\r\n s=prefix[i-1]\r\n val=(arr[i]*i-s+(prefix[-1]-prefix[i])-(n-1-i)*arr[i])\r\n \r\n ans+=val\r\n \r\n d=n \r\n g=math.gcd(d,ans)\r\n print(ans//g,d//g)\r\n return\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmain(arr)\r\n ", "from fractions import *\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n a.sort()\r\n ans1 = 0\r\n pres = a[0]\r\n for i in range(1,n):\r\n ans1+=i*a[i] -pres\r\n pres+=a[i]\r\n ans1 *= 2;\r\n tmp = pres+ans1\r\n tmp1 = n\r\n s = Fraction(tmp,tmp1)\r\n print(s.numerator,s.denominator)\r\n\r\nsolve()", "from fractions import *\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\na.sort()\r\na1 = a[0]\r\nlef_sum = 0\r\nfor i in range(1,n):\r\n lef_sum+= a[i]*i - a1 \r\n a1+=a[i]\r\n \r\nlef_sum*=2\r\ntotal = lef_sum+a1\r\ns = Fraction(total,n)\r\nprint(s.numerator,s.denominator)\r\n\r\n", "from fractions import Fraction\r\nwhile(1):\r\n try:\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n s=sum(a)\r\n a.sort()\r\n for i in range(0,n):\r\n s+=2*(2*i+1-n)*a[i]\r\n f=Fraction(s,n)\r\n print(f.numerator,end=' ')\r\n print(f.denominator)\r\n except EOFError:\r\n break", "from math import *\r\nn=int(input())\r\na=sorted(list(map(int,input().split())))\r\nb=c=sum(a)\r\nfor i in range(n):\r\n c-=a[i]\r\n b+=2*(c-(n-1-i)*a[i])\r\nprint(b//gcd(b,n),n//gcd(b,n))", "from sys import stdin\nfrom fractions import Fraction\nimport itertools\nimport math\ninput = stdin.readline\n\nclass Solution:\n def __init__(self):\n self.n = int(input())\n self.a = list(map(int, input().split()))\n self.a.sort()\n\n def slow_solve(self) -> float:\n ans = 0; total_dist = 0\n for perm in itertools.permutations(self.a):\n prev = 0\n for elem in list(perm):\n total_dist += abs(elem - prev)\n prev = elem\n\n return total_dist / math.factorial(self.n)\n\n def faster_solve(self) -> float:\n E_pairwise_dist = 0\n for i in range(len(self.a)):\n for j in range(i + 1, len(self.a)):\n E_pairwise_dist += abs(self.a[j] - self.a[i])\n\n E_pairwise_dist = Fraction(E_pairwise_dist, (self.n * (self.n - 1) // 2))\n\n \n return (self.n - 1) * E_pairwise_dist + Fraction(sum(self.a), len(self.a))\n\n def official_solve(self) -> float:\n base_sum = 0; E_pairwise_dist = 0\n for i in range(1, len(self.a)):\n base_sum += self.a[i] - self.a[0]\n\n E_pairwise_dist += base_sum\n i = 1\n for k in range(self.n - 1, 0, -1):\n base_sum -= k * (self.a[i] - self.a[i - 1])\n E_pairwise_dist += base_sum\n i += 1\n\n E_pairwise_dist = Fraction(E_pairwise_dist, (self.n * (self.n - 1) // 2))\n\n return (self.n - 1) * E_pairwise_dist + Fraction(sum(self.a), len(self.a))\n\n \n\n\n\n\n\nsolution_obj = Solution()\nans = solution_obj.official_solve()\nprint(' '.join([str(e) for e in [ans.numerator, ans.denominator]]))\n \n\n\n", "def gcd(a, b):\n\tif (b == 0):\n\t\treturn a\n\treturn gcd(b, a % b)\n\n\nn = int(input())\na = sorted(list(map(int, input().split())),reverse = True)\nk = 0\ns1 = 0\ns2 = 0\nfor i in a:\n\ts2 += s1 - k * i\n\ts1 += i\n\tk += 1\ns2 *= 2\ns2 += sum(a)\ngc = gcd(s2, n)\nprint(s2 // gc, n // gc)\n\n \t \t\t \t\t\t \t\t\t\t\t\t \t \t \t\t \t \t", "from sys import stdin\n\ndef c2 (x):\n return x * (x - 1)\n\ndef gcd (p, q):\n if q == 0:\n return p\n return gcd(q, p % q)\n\nn = int(stdin.readline())\narr = list(map(int, stdin.readline().split()))\narr.sort()\n\ndenom = n * (n - 1)\nans = 0\nfor i in range(n):\n L = i\n R = n - i - 1\n\n add = 0\n add += 2 * c2(L)\n add += 2 * L\n add += L\n add -= R\n add -= 2 * c2(R)\n\n ans += add * arr[i]\n\ngc = gcd(ans, denom)\nans //= gc\ndenom //= gc\nprint(ans, denom)\n", "import math\r\n\r\ndef race(lst):\r\n n=len(lst)\r\n sm=[0]*(n+2)\r\n sm2=[0]*(n+2)\r\n lst=sorted(lst)\r\n lst.insert(0,0)\r\n for i in range(1,n+1):\r\n sm[i]=sm[i-1]+lst[i]\r\n for i in range(n,0,-1):\r\n sm2[i]=sm2[i+1]+lst[i]\r\n ans=0\r\n for i in range(1,n+1):\r\n tmp=(2*(i*lst[i]-sm[i-1]))\r\n ans+=tmp\r\n tmp=(2*(sm2[i+1]-(n-i)*lst[i])) \r\n ans+=tmp\r\n #print(str(tmp) + \" \" + str(ans))\r\n n*=2\r\n tmp=math.gcd(n,ans)\r\n #print(str(tmp) + \" \" + str(ans) + \" \" + str(n))\r\n fn=str(ans//tmp) + \" \" + str(n//tmp)\r\n return fn\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(race(lst))\r\n", "def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\nn = int(input())\na = sorted(list(map(int, input().split())))\n\ntotal_dist = 0\ncur_sum = 0\ncur_points = 0\n\nfor x in a[::-1]:\n total_dist += cur_sum - cur_points * x\n cur_sum += x\n cur_points += 1\n\ntotal_dist *= 2\ntotal_dist += sum(a)\n\nhigh = total_dist\nlow = n\ng = gcd(low, high)\nprint(high // g, low // g)\n", "import math\nn = int(input())\na = list(map(int, input().split()))\na.sort(reverse = True)\nk = 0\ns1 = 0\ns2 = 0\nfor i in a:\n\ts2 += s1 - k * i\n\ts1 += i\n\tk += 1\ns2 *= 2\ns2 += sum(a)\ngcd = math.gcd(s2, n)\nprint(s2 // gcd, n // gcd)\n\n \t\t\t \t \t \t \t\t\t\t \t \t", "from math import gcd\r\nn = int(input())\r\nl = sorted(list(map(int , input().split())))\r\n\r\nt = sum((i+i-n+1)*l[i] for i in range(n))\r\n\r\nt =2*t+sum(l) \r\nd = gcd(t,n)\r\n \r\nprint(t//d,n//d)\r\n", "from fractions import Fraction\r\n\r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\n\r\nf = Fraction(sum([(3-2*n+4*i)*l[i] for i in range(n)]),n)\r\nprint(f.numerator,f.denominator)\r\n\r\n##import itertools\r\n##tot2 = 0\r\n##for i in itertools.permutations(l):\r\n## loc = 0\r\n## tot = 0\r\n## for e in i:\r\n## tot += abs(loc-e)\r\n## loc = e\r\n## #print(i,tot)\r\n## tot2 += tot\r\n##import math\r\n##f2 = Fraction(tot2,math.factorial(n))\r\n##print(f2.numerator,f2.denominator)\r\n##\r\n", "from math import gcd # gcd = greatest common divisor\n# Input\nn = int(input())\nd = [int(x) for x in input().split()]\nd.sort()\nres = 0\nfor i in range(n):\n res += 2*(i+i-n+1)*d[i]\nres += sum(d)\ndiv = gcd(res,n)\n# Output\nprint(res//div,n//div)\n\t \t\t\t\t\t\t\t \t \t \t\t\t\t\t\t\t\t\t \t \t\t", "from fractions import Fraction\nn=int(input())\na=[int(i) for i in input().split()]\na=sorted(a)\ns=[]\ns.append(0)\nfor i in range(n):\n s.append(s[-1]+a[i])\nans=0\nfor i in range(1,n+1):\n ans+=s[n]-s[i-1]-(n-i+1)*a[i-1]\nans=ans*2+sum(a)\nans=Fraction(ans,n)\nprint(\"{0:d} {1:d}\".format(ans.numerator,ans.denominator))\n\t \t\t\t\t\t \t \t\t\t \t \t\t\t\t", "from fractions import Fraction\r\n\r\ndef solve(a):\r\n n = len(a)\r\n a.sort()\r\n c = 0\r\n s = 0\r\n for i in range(n-1):\r\n c += (i+1)*(n-1-i)\r\n s += (i+1)*(n-1-i)*(a[i+1]-a[i])\r\n return Fraction(sum(a)+2*s, n)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nassert len(a) == n\r\nr = solve(a)\r\nprint(r.numerator, r.denominator)", "def gcd(a,b):\r\n\tif b==0:\r\n\t\treturn a\r\n\treturn gcd(b,a%b)\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\ncof=-n+1\r\nfor i in range(n):\r\n\tans+=2*cof*a[i]\r\n\tans+=a[i]\r\n\tcof+=2\r\nans*=(n-1)\r\nlo=n*(n-1)\r\nup=ans\r\ng=gcd(up,lo)\r\nprint(up//g,lo//g)" ]

[ "import fileinput\n\ns = []\nleft = True\n\nfor line in fileinput.input():\n s.append(line[:-1])\n\nl = len(max(s, key=len))\n\nfor i in range(len(s)):\n free = l - len(s[i])\n sp = free//2\n if free%2==0:\n s[i] = '*' + sp*' ' + s[i] + sp*' ' + '*'\n else:\n if left:\n s[i] = '*' + sp*' ' + s[i] + (sp+1)*' ' + '*'\n else:\n s[i] = '*' + (sp+1)*' ' + s[i] + sp*' ' + '*'\n left = not left\n\nprint('*'*(l+2))\nprint('\\n'.join(s))\nprint('*'*(l+2))\n", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n \nif __name__ == '__main__':\n\tlines = []\n\tmaxl = 0\n\twhile True:\n\t\ttry:\n\t\t\ts=input()\n\t\t\tif len(s) > maxl:\n\t\t\t\tmaxl = len(s)\n\t\t\tlines.append(s)\n\t\texcept EOFError:\n\t\t\tbreak\n\tprint(\"*\"*(maxl+2))\n\tleft = True\n\teven = maxl % 2 == 0\n\tfor line in lines:\n\t\tx = len(line)\n\t\tm = (maxl - x) // 2\n\t\tif x % 2 == 1 and even or x % 2 == 0 and not even:\n\t\t\tif left:\n\t\t\t\tl = m\n\t\t\t\tr = m+1\n\t\t\telse:\n\t\t\t\tl = m+1\n\t\t\t\tr = m\n\t\t\tleft = not left\n\t\telse:\n\t\t\tl, r = m, m\n\t\ts = \"*\" + \" \"*l + line + \" \"*r + \"*\"\n\t\tprint(s)\n\tprint(\"*\"*(maxl+2))\n \t \t\t \t \t\t \t\t \t\t \t \t\t\t\t\t\t", "lista = []\n\nwhile True:\n try:\n palabra = input()\n lista.append(palabra)\n except EOFError:\n break\nlarga = 0\nlado = \"der\"\nfor i in lista :\n if len(i) > larga:\n larga = len(i)\nprint(\"*\" * (larga + 2))\n\nfor i in lista :\n palabra = \"*\"\n diferencia = larga - len(i)\n \n if (diferencia % 2) != 0:\n if lado == \"der\" :\n izquierda = diferencia // 2\n derecha = diferencia % 2\n palabra += \" \" * izquierda\n palabra += i\n palabra += \" \" * (izquierda+derecha) + \"*\"\n print(palabra)\n lado = \"izq\"\n continue\n if lado == \"izq\":\n derecha = diferencia//2\n izquierda = diferencia%2\n palabra += \" \" * (izquierda + derecha)\n palabra += i\n palabra += \" \" * (derecha) + \"*\"\n print(palabra)\n lado = \"der\"\n if (diferencia % 2) == 0 :\n izquierda = diferencia // 2\n palabra += \" \" * (izquierda)\n palabra += i\n palabra += \" \" * (izquierda) + \"*\"\n print(palabra)\n \nprint(\"*\" * (larga+2))\n \t\t \t \t\t\t\t \t\t\t\t \t \t\t", "from math import floor, ceil\r\ninputs = []\r\nwhile True:\r\n try:\r\n inputs.append(input())\r\n except:\r\n break\r\n\r\ns = max(map(len, inputs))\r\nleft = True\r\n\r\nprint('*' * (s+2))\r\nfor i in inputs:\r\n l = len(i)\r\n if (s-l) % 2 == 0:\r\n print('*' + ' '*floor((s-l)/2) + i + ' '*ceil((s-l)/2) + '*')\r\n else:\r\n if left:\r\n left = False\r\n print('*' + ' '*floor((s-l)/2) + i + ' '*ceil((s-l)/2) + '*')\r\n else:\r\n left = True\r\n print('*' + ' '*ceil((s-l)/2) + i + ' '*floor((s-l)/2) + '*')\r\nprint('*' * (s+2))", "matrix = []\nwhile(True):\n try:\n line = str(input())\n matrix.append(line)\n except EOFError:\n break\n\nendl =-1\nfor linha in matrix:\n if len(linha) > endl:\n endl=len(linha)\n\nfor i in range (0, endl+2):\n print(\"*\", end=\"\")\nprint()\n\nvareia = True\nfor linha in matrix:\n print(\"*\", end=\"\")\n\n for space in range(0, int((endl-len(linha))/2) + ((endl-len(linha))%2 and (not vareia))):\n print(\" \", end=\"\")\n print(linha, end=\"\")\n\n for space in range(0, int((endl-len(linha))/2) + ((endl-len(linha))%2 and vareia)):\n print(\" \", end=\"\") \n print(\"*\")\n if((endl-len(linha))%2):\n vareia = not vareia\n\nfor i in range(0, endl+2):\n print(\"*\", end=\"\")\nprint()\n \t\t \t \t \t \t \t\t\t\t \t\t", "import sys\n\ndef main():\n lines = [line.strip() for line in sys.stdin]\n w = max(len(l) for l in lines) + 2\n print('*' * w)\n flag = True\n for line in lines:\n extra = w - 2 - len(line)\n if extra % 2 != 0:\n if flag:\n left = extra // 2\n right = extra - left\n else:\n right = extra // 2\n left = extra - right\n\n flag = not flag\n else:\n left = extra // 2\n right = extra // 2\n\n print('*' + ' ' * left + line + ' ' * right + '*')\n print('*' * w)\n\nmain()\n", "import sys\r\nstrs=[]\r\n\r\nl=0\r\nfor line in sys.stdin.readlines():\r\n\tif not line:\r\n\t\tbreak\r\n\tline=line.strip()\r\n\tstrs.append(line)\r\n\tl=max(l,len(line))\r\n\r\nflag=1\r\nprint('*'*(l+2))\r\nfor i in range(len(strs)):\r\n\tprint('*',end='')\r\n\tif(l-len(strs[i]))%2==0:\r\n\t\tx=y=(l-len(strs[i]))//2\r\n\telse:\r\n\t\tif flag==1:\r\n\t\t\tx=(l-len(strs[i]))//2\r\n\t\t\ty=x+1\r\n\t\t\tflag=1-flag\r\n\t\telse:\r\n\t\t\tx=(l-len(strs[i]))//2+1\r\n\t\t\ty=x-1\r\n\t\t\tflag=1-flag\r\n\tprint(' '*x,end='')\r\n\tprint(strs[i],end='')\r\n\tprint(' '*y,end='')\r\n\tprint('*')\r\nprint('*'*(l+2))\r\n", "import sys\r\nimport math\r\n\r\nm = 0\r\nlines = []\r\nfrom_left = True\r\n\r\nfor line in sys.stdin:\r\n chars = list(line[:len(line) - 1])\r\n m = max(m, len(chars))\r\n lines.append(chars)\r\n\r\nprint('*' * (m + 2))\r\n\r\nfor line in lines:\r\n even = (m - len(line)) % 2 == 0\r\n if even:\r\n p = '*' + ' ' * int((m - len(line)) / 2) + ''.join(line) + ' ' * int((m - len(line)) / 2) + '*'\r\n else:\r\n if from_left:\r\n p = '*' + ' ' * math.floor((m - len(line)) / 2) + ''.join(line) + ' ' * math.ceil((m - len(line)) / 2) + '*'\r\n from_left = False\r\n else: \r\n p = '*' + ' ' * math.ceil((m - len(line)) / 2) + ''.join(line) + ' ' * math.floor((m - len(line)) / 2) + '*'\r\n from_left = True\r\n \r\n print(p) \r\n\r\nprint('*' * (m + 2))", "import math\r\nod=-1\r\nl=[]\r\nwhile 1:\r\n try:\r\n s=input()\r\n l.append(s)\r\n od=max(od,len(s)) \r\n except:\r\n break\r\nprint(\"*\"*(od+2))\r\nc=0\r\nfor i in l:\r\n if (od-len(i))%2==0:\r\n print(\"*\"+\" \"*((od-len(i))//2)+i+\" \"*((od-len(i))//2)+\"*\")\r\n else:\r\n if c%2!=0:\r\n print(\"*\"+\" \"*math.ceil((od-len(i))/2)+i+\" \"*math.floor((od-len(i))/2)+\"*\")\r\n else:\r\n print(\"*\"+\" \"*math.floor((od-len(i))/2)+i+\" \"*math.ceil((od-len(i))/2)+\"*\")\r\n c+=1\r\nprint(\"*\"*(od+2))", "import sys\r\nf = sys.stdin.readlines()\r\nM = max(len(row) for row in f)\r\nx = 1\r\nprint('*'*(M+1))\r\nfor row in f:\r\n a = len(row)\r\n print('*'+' '*((M-a+1-x)//2)+row.rstrip()+' '*((M-a+x)//2)+'*')\r\n x ^= (M-a)&1\r\nprint('*'*(M+1))", "import sys\r\n\r\ndef centrify(lines, max_len):\r\n\tleft_add = 0\r\n\tright_add = 1\r\n\tfor line in lines:\r\n\t\tif len(line) == 0:\r\n\t\t\tyield ' ' * max_len\r\n\t\t\tcontinue\r\n\t\tif len(line) == max_len:\r\n\t\t\tyield line\r\n\t\t\tcontinue\r\n\t\treserve = max_len - len(line)\r\n\t\thalf = reserve // 2\r\n\t\tif reserve % 2 != 0:\r\n\t\t\tyield ' ' * (half + left_add) + line + ' ' * (half + right_add)\r\n\t\t\tleft_add = 1 - left_add\r\n\t\t\tright_add = 1 - right_add\r\n\t\t\tcontinue\r\n\t\tyield ' ' * half + line + ' ' * half\r\n\r\n\r\ndef zvezdify(lines, max_len):\r\n\tyield '*' * (max_len + 2)\r\n\tfor line in lines:\r\n\t\tyield '*' + line + '*'\r\n\tyield '*' * (max_len + 2)\r\n\r\n\r\ndef solve(lines):\r\n\tlines = [l.rstrip() for l in lines]\r\n\tmax_len = max(len(l) for l in lines)\r\n\treturn '\\n'.join(zvezdify(centrify(lines, max_len), max_len))\r\n\r\n\r\ndef test():\r\n\tlines = ['a', '3n3', '']\r\n\t# lines = ['qqq', 's']\r\n\tmax_len = max(len(l) for l in lines)\r\n\tcentered = list(centrify(lines, max_len))\r\n\tprint(centered)\r\n\tprint(list(zvezdify(centered, max_len)))\r\n\r\n\r\ndef test2():\r\n\tprint(solve(['4f43', 'e', '', '322']))\r\n\tprint(solve(['4', 'e', '', '322', 'ab', 'bc', 'de']))\r\n\r\nif __name__ == '__main__':\r\n\t# test2()\r\n\tlines = sys.stdin.readlines()\r\n\tprint(solve(lines))\r\n", "import sys\r\narr = []\r\nfor line in sys.stdin:\r\n arr.append(line[:-1])\r\n\r\nmaxx = max([len(i) for i in arr])\r\n\r\nprint('*'*(maxx+2))\r\ni = 1\r\nfor line in arr:\r\n if (maxx - len(line))%2: \r\n i+=1\r\n print('*', ' '*(int((maxx-len(line))/2) + ((maxx - len(line))%2)*(i%2)), line, ' '*(int((maxx-len(line))/2) + ((maxx - len(line))%2)*(1 - i%2)), '*', sep='')\r\nprint('*'*(maxx+2))", "lines = []\r\n\r\nwhile True:\r\n try:\r\n line = input()\r\n lines.append(line)\r\n except:\r\n break\r\n\r\nmaxlen = -1\r\nfor line in lines:\r\n maxlen = max(len(line), maxlen)\r\n\r\nfirstLess = True\r\n\r\nprint(\"*\"+\"*\"*maxlen+\"*\")\r\nfor line in lines:\r\n rem = maxlen - len(line)\r\n firstPart = rem // 2\r\n lastPart = rem - firstPart\r\n\r\n if firstPart != lastPart and len(line):\r\n if firstLess and firstPart > lastPart:\r\n firstPart, lastPart = lastPart, firstPart\r\n elif (not firstLess) and firstPart < lastPart:\r\n firstPart, lastPart = lastPart, firstPart\r\n firstLess = not firstLess\r\n\r\n print(\"*\", end=\"\")\r\n print(\" \"*firstPart, end=\"\")\r\n print(line, end=\"\")\r\n print(\" \"*lastPart, end=\"\") \r\n print(\"*\")\r\n\r\nprint(\"*\"+\"*\"*maxlen+\"*\")", "import sys\nlines = [line.strip() for line in sys.stdin.readlines()]\nm = max(list(map(len, lines)))\nprint((m + 2) * \"*\")\ni = 1\nfor line in lines:\n le = len(line)\n buff = (m - le) // 2\n if (m - le) % 2 != 0:\n i += 1\n i %= 2\n print(\"*\" + (buff + ((m - le) % 2)*(i % 2)) * \" \" +\n line + (buff + ((m - le) % 2)*((i+1) % 2))*\" \" + \"*\")\nprint((m+2)*\"*\", end=\"\")\n\n\t\t\t\t \t \t\t\t\t \t\t\t \t \t\t \t\t \t", "\r\nimport sys\r\n\r\ns = []\r\nmx = 0\r\n\r\nfor line in sys.stdin:\r\n s.append(line[:-1:])\r\n mx = max(mx, len(line)-1)\r\n\r\n\r\nprint(\"*\"*(mx+2))\r\nr=1\r\nfor i in s:\r\n if len(i)%2!=mx%2:\r\n r=(1+r)%2\r\n margin = (mx-len(i)+r)//2\r\n \r\n print(\"*\" + \" \"*margin + i + \" \"*(mx-len(i)-margin) + \"*\")\r\nprint(\"*\"*(mx+2))", "import sys\r\n\r\nlines = []\r\nfor line in sys.stdin:\r\n lines.append(line.strip())\r\nw = max(map(len, lines))\r\nprint('*' * (w + 2))\r\nc = 0\r\nfor line in lines:\r\n print('*' + ' ' * ((w - len(line) + c) // 2) + line + ' ' * ((w - len(line) + 1 - c) // 2) + '*')\r\n if (w - len(line)) % 2 == 1:\r\n c = 1 - c\r\nprint('*' * (w + 2))\r\n", "import sys\r\n\r\na = [l.strip() for l in sys.stdin]\r\n\r\nw,c = max(len(l) for l in a), 0\r\n\r\nprint('*' * (w+2))\r\n\r\nfor l in a:\r\n\r\n s = [(w-len(l))//2] * 2\r\n\r\n if len(l) % 2 != w % 2:\r\n\r\n c = 1-c\r\n\r\n s[c] += 1\r\n\r\n print('*'+' '*s[0] + l + ' '*s[1] +'*')\r\n\r\nprint('*' * (w+2))\r\n\r\n\r\n\r\n# Made By Mostafa_Khaled", "import sys;\r\n\r\nlines = [];\r\nm = 0;\r\n\r\nfor s in sys.stdin:\r\n lines.append(s.rstrip());\r\nfor s in lines:\r\n m = max(m, len(s));\r\n\r\nturn_is_left = 1;\r\nsep = ('*' * (m + 2)) + '\\n';\r\n\r\nsys.stdout.write(sep);\r\n\r\nfor s in lines:\r\n l = len(s);\r\n p = q = (m - l) // 2;\r\n if ((m - l) % 2):\r\n if turn_is_left:\r\n q += 1;\r\n else:\r\n p += 1;\r\n turn_is_left ^= 1;\r\n \r\n sys.stdout.write(f'*{p * \" \"}{s}{q * \" \"}*\\n');\r\n\r\nsys.stdout.write(sep);", "rows = []\r\ntry:\r\n while True:\r\n s = input()\r\n rows.append(s)\r\nexcept EOFError as e:\r\n pass\r\n\r\nM = max(map(len, rows))\r\nla = 0 #left_adjust\r\nra = 1 #right_adjust\r\nprint('*'*(M+2))\r\nfor row in rows:\r\n es = M-len(row) # extra_spaces\r\n if es % 2:\r\n l = es // 2 + la\r\n r = es // 2 + ra\r\n la, ra = ra, la\r\n else:\r\n l = es // 2\r\n r = es // 2\r\n print('*' + ' '*l+row+' '*r+'*')\r\nprint('*'*(M+2))\r\n", "import sys\n\nname = sys.stdin.read().splitlines()\ntotal = 0\nlines = []\nfor line in name:\n nums = line\n lines.append([nums, len(line)])\n total = max(total, len(line))\nprint(\"*\"*(total+2))\nfirst = 1\nsecond = 0\nfor i in range(len(name)):\n large = (int)((total-lines[i][1])/2)\n if total%2: \n if not lines[i][1]%2:\n print(\"*\"+ \" \"*(large+second) + lines[i][0]+ \" \"*(large+first)+ \"*\")\n first, second = second, first\n else:\n print(\"*\"+ \" \"*(large) + lines[i][0]+ \" \"*(large)+ \"*\")\n else:\n if lines[i][1]%2:\n print(\"*\"+ \" \"*(large+second) + lines[i][0]+ \" \"*(large+first)+ \"*\")\n first, second = second, first\n else:\n print(\"*\"+ \" \"*(large) + lines[i][0]+ \" \"*(large)+ \"*\")\n\nprint(\"*\"*(total+2))\n \n\n\t \t\t\t\t \t \t\t\t\t\t \t\t\t\t\t \t", "\r\nm = []\r\nmax_size = 0\r\n\r\nwhile True:\r\n \r\n try:\r\n line = input()\r\n except:\r\n break\r\n\r\n line = line.strip()\r\n max_size = max(max_size, len(line))\r\n m.append(line)\r\n\r\nsize = max_size\r\n\r\nprint(\"*\" * (size + 2))\r\n\r\ni = 0\r\nfor line in m:\r\n s = \"*\"\r\n\r\n spaces = size - len(line)\r\n\r\n if spaces % 2 == 1 and i % 2 == 1:\r\n spacel = spaces // 2 + 1\r\n else:\r\n spacel = spaces // 2\r\n\r\n s += (\" \" * spacel)\r\n s += line\r\n s += (\" \" * (spaces - spacel))\r\n s += \"*\"\r\n print(s)\r\n\r\n if spaces % 2 == 1:\r\n i += 1\r\n\r\nprint(\"*\" * (size + 2))\r\n", "import sys\r\nl=[i.rstrip() for i in sys.stdin]\r\nm=max(len(i) for i in l)\r\nb=0\r\nprint('*'*(m+2))\r\nfor i in l:\r\n if len(i)%2==m%2:\r\n print('*'+' '*((m-len(i))//2)+i+' '*((m-len(i))//2)+'*')\r\n elif len(i)==0:\r\n print('*'+' '*m+'*')\r\n else:\r\n print('*'+' '*((m-len(i)+b)//2)+i+' '*((m-len(i)+1-b)//2)+'*')\r\n b=1-b\r\nprint('*'*(m+2))\r\n", "from sys import stdin\n\nclass A:\n\n def solve(self):\n users = set()\n byte_data = 0\n for line in stdin:\n if line.startswith(\"+\"):\n users.add(line[1:])\n elif line.startswith(\"-\"):\n users.remove(line[1:])\n else:\n data = line.split(\":\")\n data[1] = data[1][:-1]\n byte_data += len(data[1]) * len(users)\n\n print(byte_data)\n\nclass B:\n\n def solve(self):\n input_data = [line[:-1] for line in stdin]\n max_len = max([len(l) for l in input_data])\n left = True\n print(\"\".join([\"*\" for i in range(max_len + 2)]))\n\n for line in input_data:\n length = len(line)\n space_left = max_len - length\n left_space = 0\n right_space = 0\n\n if space_left % 2 == 0:\n left_space = right_space = space_left // 2\n else:\n left_space = right_space = (space_left - 1) // 2\n if left:\n right_space += 1\n else:\n left_space += 1\n\n left = not left\n\n print(\"*{}{}{}*\".format(\n \"\".join([\" \" for i in range(left_space)]),\n line,\n \"\".join([\" \" for i in range(right_space)])\n ))\n\n print(\"\".join([\"*\" for i in range(max_len + 2)]))\n\nB().solve()\n", "import sys\r\n\r\na,cont = [i.strip() for i in sys.stdin],0\r\n\r\nn = max(len(i) for i in a)\r\n\r\nprint((n+2)*'*')\r\n\r\nfor i in a:\r\n\r\n espacio1 = int((n-len(i))/2)*' '\r\n espacio2 = (int((n-len(i))/2)+1)*' '\r\n\r\n if (n-len(i))%2 == 0: \r\n print('*' + espacio1 + i + espacio1 + '*')\r\n else:\r\n cont += 1\r\n \r\n if cont %2 != 0:\r\n print('*' + espacio1 + i + espacio2 + '*')\r\n else:\r\n print('*' + espacio2 + i + espacio1 + '*')\r\n \r\nprint((n+2)*'*')", "\ntextos = []\nmax_len = 0\nwhile True:\n try:\n entrada = input()\n textos.append(entrada)\n if len(entrada) > max_len:\n max_len = len(entrada)\n except EOFError:\n break\n\nizq = False\nprint(\"*\" * (max_len + 2))\nfor texto in textos:\n espacios = max_len - len(texto)\n if espacios % 2 != 0:\n mitad = espacios // 2\n i = 0\n d = 0\n if izq:\n i = 1\n izq = False\n else:\n d = 1\n izq = True\n print(\"*\" + \" \" * ((espacios // 2) + i) + texto + \" \" * ((espacios // 2) + d) + \"*\")\n else:\n print(\"*\" + \" \" * (espacios // 2) + texto + \" \" * (espacios // 2) + \"*\")\nprint(\"*\" * (max_len + 2))\n\t\t\t \t\t\t \t \t \t\t \t \t\t\t\t \t", "text = []\nsize = 0\n\nwhile True:\n try:\n line = input()\n except:\n break\n line = line.strip()\n if len(line) > size:\n size = len(line)\n text.append(line)\n\nprint(\"*\" * (size + 2))\n\ni = 0\nfor line in text:\n c = \"*\"\n blank = size - len(line)\n if blank % 2 == 1 and i % 2 == 1:\n left = blank // 2 + 1\n else:\n left = blank // 2\n c += (\" \" * left)\n c += line\n right = blank - left\n c += (\" \" * right)\n c += \"*\"\n print(c)\n if blank % 2 == 1:\n i += 1\n\nprint(\"*\" * (size + 2))\n \t \t \t\t \t \t\t \t \t\t\t\t\t\t\t\t \t\t \t", "#start_time = time.time()\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\ndef getMat(n):\r\n return [getInts() for _ in range(n)]\r\n\r\ndef isInt(s):\r\n return '0' <= s[0] <= '9'\r\n\r\nMOD = 10**9 + 7 \r\n\r\n\"\"\"\r\n\r\n\"\"\"\r\nimport sys\r\n#f = open('inp.txt')\r\nread = sys.stdin.read\r\n\r\ndef solve():\r\n inp = read().split('\\n')[:-1]\r\n max_len = max([len(s) for s in inp])\r\n ans = ['*'*(max_len+2)]\r\n swap = 1\r\n for word in inp:\r\n spaces = max_len - len(word)\r\n if spaces % 2 == 0:\r\n ans.append('*'+' '*(spaces//2)+word+' '*(spaces//2)+'*')\r\n continue\r\n if swap:\r\n ans.append('*'+' '*(spaces//2)+word+' '*(spaces//2 + 1)+'*')\r\n else:\r\n ans.append('*'+' '*(spaces//2 + 1)+word+' '*(spaces//2)+'*')\r\n swap ^= 1\r\n ans.append('*'*(max_len+2))\r\n print('\\n'.join(ans))\r\n return\r\n \r\n#for _ in range(getInt()):\r\n#print(solve())\r\nsolve()\r\n\r\n\r\n#print(time.time()-start_time)", "import sys\n\nm = 0\nl = []\n\nfor i in sys.stdin:\n l.append(i.rstrip())\n m = max(len(l[-1]), m)\n\nflag = True\nprint('*' * (m + 2))\nfor i in l:\n s = m - len(i)\n a = s // 2\n b = s - a\n if a != b:\n if not flag:\n a, b = b, a\n flag = not flag\n print('*' + (' ' * a) + i + (' ' * b) + '*')\nprint('*' * (m + 2))\n", "from sys import stdin\r\n#bringing them closer left or right alternatively\r\n#stdin...\r\ndef CF_5B():\r\n lines=[]\r\n for line in stdin.readlines():\r\n line=line.strip()\r\n lines.append(line)\r\n length=0\r\n for i in range(len(lines)):\r\n if len(lines[i])>length:\r\n length=len(lines[i])\r\n else:\r\n continue\r\n \r\n print('*'*(length+2))\r\n flag=0\r\n for i in range(len(lines)):\r\n if length%2==len(lines[i])%2:\r\n left=(length-len(lines[i]))//2\r\n right=(length-len(lines[i]))//2\r\n elif flag==0:\r\n left=(length-len(lines[i]))//2\r\n right=length-len(lines[i])-left\r\n flag=1\r\n else:\r\n right=(length-len(lines[i]))//2\r\n left=length-len(lines[i])-right\r\n flag=0\r\n print('*'+' '*left+lines[i]+' '*right+'*')\r\n print('*'*(length+2))\r\n return\r\n\r\nCF_5B()\r\n \r\n", "import sys\r\nrln=sys.stdin.buffer.readline\r\nrl=lambda:rln().rstrip(b'\\r\\n').rstrip(b'\\n')\r\nri=lambda:int(rln())\r\nrif=lambda:[*map(int,rln().split())]\r\nrt=lambda:rl().decode()\r\nrtf=lambda:rln().decode().split()\r\ninf=float('inf')\r\ndir4=[(-1,0),(0,1),(1,0),(0,-1)]\r\ndir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\nYES,NO,Yes,No,yes,no='YES','NO','Yes','No','yes','no'\r\n\r\na=[]\r\nm=0\r\nfor ln in sys.stdin:\r\n s=ln.strip()\r\n a.append(s)\r\n m=max(m,len(s))\r\nprint((m+2)*'*')\r\nf=0\r\nfor s in a:\r\n k=m-len(s)\r\n l,r=k//2,(k+1)//2\r\n if l!=r:\r\n if f: l,r=r,l\r\n f^=1\r\n print('*'+l*' '+s+r*' '+'*')\r\nprint((m+2)*'*')\r\n", "maximum_width = 0\nlines = [\"*\"]\nwhile True:\n try:\n line = input()\n if len(line) > maximum_width:\n maximum_width = len(line)\n lines.append(line)\n except EOFError:\n break\nlines.append(\"*\")\nlast_push = 1 # 0 == right, 1 == left\nfor i in range(len(lines)):\n if lines[i] == \"*\":\n lines[i] = \"*\" * (maximum_width+2)\n else:\n spaces = maximum_width - len(lines[i])\n half_space = int(spaces / 2)\n new_line = \"*\" + (\" \" * (spaces - half_space)) + lines[i] + (\" \" * half_space) + \"*\"\n if spaces % 2 != 0:\n if last_push == 0:\n new_line = \"*\" + (\" \" * (spaces - half_space)) + lines[i] + (\" \" * half_space) + \"*\"\n last_push = 1\n else:\n new_line = \"*\" + (\" \" * half_space) + lines[i] + (\" \" * (spaces - half_space)) + \"*\"\n last_push = 0\n lines[i] = new_line\n\nfor line in lines:\n print(line)\n \t \t\t\t\t \t\t \t\t \t \t\t\t \t", "# link: https://codeforces.com/problemset/problem/5/B\r\n\r\nimport sys\r\n\r\nif __name__ == \"__main__\":\r\n s = [l.strip() for l in sys.stdin] \r\n max_len = float('-inf')\r\n for i in s:\r\n max_len = max( max_len, len(i) )\r\n print(\"*\"*(max_len+2))\r\n left = 1\r\n for i in range(len(s)):\r\n print(\"*\",end=\"\")\r\n current_string = s[i]\r\n current_len = len(s[i])\r\n if (max_len + current_len) % 2 == 0: \r\n # possible\r\n print(\" \"*((max_len - current_len)//2 ) , end=\"\")\r\n print(current_string,end=\"\")\r\n print(\" \"*((max_len - current_len)//2 ),end=\"\")\r\n \r\n elif left:\r\n left = 0\r\n print(\" \"*((max_len - current_len)//2 ) , end=\"\")\r\n print(current_string,end=\"\")\r\n print(\" \"*((max_len - current_len)//2 +1),end=\"\")\r\n \r\n else: # right = 1\r\n left = 1\r\n print(\" \"*((max_len - current_len)//2 + 1 ) , end=\"\")\r\n print(current_string,end=\"\")\r\n print(\" \"*((max_len - current_len)//2 ),end=\"\")\r\n print(\"*\") \r\n print(\"*\"*(max_len+2)) \r\n \r\n \r\n\r\n\r\n", "a = [x.strip() for x in [*open(0)]]\r\nn,k=max(map(len,a)),0\r\nh='*'*(n+2)\r\nprint(h)\r\nfor x in a:\r\n u = [n-len(x)>>1]*2\r\n if(len(x)%2 != n%2):\r\n k^=1\r\n u[k]+=1\r\n print('*' + u[0]*' ' + x + u[1]*' ' + '*')\r\nprint(h)", "lines=[]\r\nmaxlen=0\r\n#While we have input, we append it to our list, \r\nwhile True:\r\n\ttry:\r\n\t\ta=input()\r\n\t\tlines.append(a)\r\n\t\t# find the longest line\r\n\t\tif len(a)>maxlen:maxlen=len(a)\r\n\texcept:\r\n\t\tbreak\r\n# print the upper side of the frame\r\nprint(\"*\"*(maxlen+2))\r\n\r\nuniformity=1\r\nfor each in lines:\r\n # if the difference between the longest line and the current one is even\r\n if (maxlen-len(each))%2:\r\n # print one line to the left\r\n if uniformity:\r\n uniformity=0\r\n print(\"*{text} *\".format(text=each.center(maxlen-1,' ')))\r\n # print one line to the right\r\n else:\r\n uniformity=1\r\n print(\"* {text}*\".format(text=each.center(maxlen-1,' ')))\r\n # print text:\r\n else:\r\n print(\"*{text}*\".format(text=each.center(maxlen,' ')))\r\n\r\n# print the bottom line\r\nprint(\"*\"*(maxlen+2))", "from sys import stdin\r\n\r\nif __name__ == '__main__':\r\n\tlines = []\r\n\r\n\tfor line in stdin:\r\n\t\tlines.append(line.strip())\r\n\r\n\tmaxwidth = max([len(l) for l in lines])\r\n\r\n\talignleft = True\r\n\tprint('*'*(maxwidth+2))\r\n\tfor l in lines:\r\n\t\tif ((maxwidth - len(l)) & 1) == 0:\r\n\t\t\tprint('*'+l.center(maxwidth,' ')+'*')\r\n\t\telse:\r\n\t\t\tif alignleft:\r\n\t\t\t\tls = (maxwidth - len(l)) // 2\r\n\t\t\t\trs = ls + 1\r\n\t\t\t\talignleft = False\r\n\t\t\telse:\r\n\t\t\t\trs = (maxwidth - len(l)) // 2\r\n\t\t\t\tls = rs + 1\r\n\t\t\t\talignleft = True\r\n\t\t\tprint('*' + ' '*ls + l + ' '*rs + '*')\r\n\tprint('*'*(maxwidth+2))", "g=0\r\nl=[]\r\nwhile True:\r\n try: a=input()\r\n except: break\r\n l.append(a)\r\n s=len(a)\r\n if g<s:\r\n \tg=s\r\nprint('*'*g+'*'+'*')\r\no=0\r\nfor i in l:\t\r\n\tf=len(i)\r\n\tprint('*',end='')\r\n\tt=(g-f)//2\r\n\tif (g-f)%2==1:\r\n\t\tif o%2==0:\r\n\t\t\tprint(' '*t,end=i)\r\n\t\t\tprint(' '*(t+1),end='')\r\n\t\t\to+=1\r\n\t\telse:\r\n\t\t\tprint(' '*(t+1),end=i)\r\n\t\t\tprint(' '*t,end='')\r\n\t\t\to+=1\r\n\telse:\r\n\t\tprint(' '*t,end=i)\r\n\t\tprint(' '*t,end='')\r\n\tprint('*')\r\nprint('*'*g+'*'+'*')", "import sys\r\n\r\nstring_array = [l.strip() for l in sys.stdin]\r\nmax_length, state = max(len(l) for l in string_array), 0\r\nprint('*' * (max_length + 2))\r\nfor char in string_array:\r\n text_format = [(max_length - len(char)) // 2] * 2\r\n if len(char) % 2 != max_length % 2:\r\n state = 1 - state\r\n text_format[state] += 1\r\n print('*' + ' ' * text_format[0] + char + ' ' * text_format[1] + '*')\r\nprint('*' * (max_length + 2))\r\n", "import sys\r\n\r\nlines = []\r\nmaxlen = 0\r\nfor line in sys.stdin:\r\n\tlines.append(line.rstrip())\r\n\tmaxlen = max(maxlen, len(lines[-1]))\r\n\r\nprint('*' * (maxlen + 2))\r\n\r\nleft = True\r\nfor line in lines:\r\n\ts = maxlen - len(line)\r\n\ta = s // 2\r\n\tb = s - a\r\n\tif a != b:\r\n\t\tif not left:\r\n\t\t\ta, b = b, a\r\n\t\tleft = not left\r\n\tprint('*' + (' ' * a) + line + (' ' * b) + '*')\r\n\r\nprint('*' * (maxlen + 2))\r\n", "a = []\r\ncgl = 0\r\ntry:\r\n while True:\r\n s = input()\r\n ls = len(s)\r\n cgl = max(cgl, ls)\r\n a.append((s, ls))\r\nexcept EOFError:\r\n pass\r\n\r\nalign = 0\r\n\r\nprint(\"*\" * (cgl+2))\r\n\r\nfor item in a:\r\n s = item[0]\r\n if item[1] & 1 != cgl & 1:\r\n if align % 2:\r\n s = \" \" + s\r\n else:\r\n s = s + \" \"\r\n align += 1\r\n print(\"*\" + f\"{s :^{cgl}s}\" + \"*\")\r\n\r\n\r\nprint(\"*\" * (cgl+2))\r\n", "\"\"\"\nAlmost every text editor has a built-in function of center text alignment. The developers of the popular in Berland text editor «Textpad» decided to introduce this functionality into the fourth release of the product.\n\nYou are to implement the alignment in the shortest possible time. Good luck!\n\nInput\nThe input file consists of one or more lines, each of the lines contains Latin letters, digits and/or spaces. The lines cannot start or end with a space. It is guaranteed that at least one of the lines has positive length. The length of each line and the total amount of the lines do not exceed 1000.\n\nOutput\nFormat the given text, aligning it center. Frame the whole text with characters «*» of the minimum size. If a line cannot be aligned perfectly (for example, the line has even length, while the width of the block is uneven), you should place such lines rounding down the distance to the left or to the right edge and bringing them closer left or right alternatively (you should start with bringing left). Study the sample tests carefully to understand the output format better.\n\"\"\"\n\nimport math\nimport sys\n\ninputList = [k.strip() for k in sys.stdin]\nmaxLength = max(len(a) for a in inputList)\n\nprint((maxLength + 2) * '*')\n\nleftSided = False\nfirstSpace = 0\nsecondSpace = 0\n\nfor x in inputList:\n space = maxLength - len(x)\n if (space % 2): # space is odd\n firstSpace = math.ceil(space / 2) if leftSided else math.floor(space / 2)\n leftSided = not leftSided\n else:\n firstSpace = space / 2\n\n secondSpace = space - firstSpace\n\n print('*', ' ' * int(firstSpace), x, ' ' * int(secondSpace), '*', sep='')\n\nprint((maxLength + 2) * '*')\n", "import math\r\nl = []\r\ntry:\r\n while True:\r\n a = input()\r\n l.append(a)\r\nexcept:\r\n pass\r\n \r\nbig = len(max(l,key=len))\r\nprint((\"*\"*big)+\"**\")\r\nleft = True\r\nfor i in l:\r\n sep = (big-len(i))/2\r\n if sep == math.floor(sep):\r\n sep = int(sep)\r\n print(\"*\"+\" \"*sep+i+\" \"*sep+\"*\")\r\n else:\r\n sep = math.ceil(sep)\r\n if left:\r\n print(\"*\"+\" \"*(sep-1)+i+\" \"*sep+\"*\")\r\n left = False\r\n else:\r\n print(\"*\"+\" \"*(sep)+i+\" \"*(sep-1)+\"*\")\r\n left = True\r\n \r\nprint(\"*\"*big+\"**\")\r\n", "import sys\n\nlines = []\nfor line in sys.stdin:\n\n \n\n if \"STOP\" in line:\n break\n\n line = line[:-1]\n lines.append(line)\n\n \n\n\nmax_len = 0\nfor line in lines:\n max_len = max(max_len, len(line))\n\nprint(\"*\" * (max_len+2))\n\nlefting = True\n\nfor line in lines:\n space_count = max_len - len(line)\n\n if (space_count//2)*2 + len(line) != max_len: \n if lefting:\n left_spaces = space_count // 2\n right_spaces = space_count - left_spaces\n lefting = False\n else:\n right_spaces = space_count // 2\n left_spaces = space_count - right_spaces\n lefting = True\n else:\n left_spaces = space_count // 2\n right_spaces = space_count - left_spaces\n\n \n final = left_spaces*\" \" + line + right_spaces*\" \"\n \n print(\"*\" + final + \"*\")\n\nprint(\"*\" * (max_len+2))\n\n\n\n\t\t\t \t \t \t \t \t \t \t \t \t \t\t", "import sys\r\n\r\nl = [k.strip() for k in sys.stdin]\r\nm = max(len(a) for a in l)\r\nf = 0\r\nprint((m + 2) * \"*\")\r\nfor i in range(len(l)):\r\n a = (m - len(l[i])) // 2\r\n b = a\r\n if len(l[i]) % 2 != m % 2:\r\n if f == 0:\r\n b += 1\r\n f = 1\r\n elif f == 1:\r\n a += 1\r\n f = 0\r\n print(\"*\" + \" \" * a + l[i] + \" \" * b + \"*\")\r\nprint((m + 2) * \"*\")\r\n", "a=[]\r\nm=0\r\nwhile 1:\r\n try:\r\n x=input()\r\n m=max(m,len(x))\r\n a.append(x)\r\n except:\r\n break\r\nprint('*'*(m+2))\r\nb=True\r\nfor i in a:\r\n x=m-len(i)\r\n if b:Tem=x//2\r\n else:Tem=x-x//2\r\n print('*'+' '*Tem+i+' '*(x-Tem)+'*')\r\n if Tem!=x-Tem:b=not b\r\n\r\nprint('*'*(m+2))", "# 5B\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\ntext = []\r\nmax_len = 0\r\nfor line in stdin:\r\n line = line.strip()\r\n text.append(line)\r\n max_len = max(max_len, len(line))\r\n\r\nprint('*' * (2 + max_len))\r\nleft = 0\r\nfor line in text:\r\n offset = max_len - len(line)\r\n padding = offset // 2\r\n if offset % 2 == 1:\r\n line = ' ' + line if left else line + ' '\r\n left ^= 1\r\n print('*' + ' ' * padding + line + ' ' * padding + '*')\r\nprint('*' * (2 + max_len))", "from math import floor,ceil\nfrom sys import stdin\nx = []\nleft = True\nfor line in stdin:\n line = line.rstrip()\n x.append(line)\n \nle = len(max(x,key = len))\nprint('*'*(le+2))\nfal = []\nfor i in range(len(x)):\n if (le-len(x[i]))%2 == 0:\n sdvig = (le-len(x[i]))//2\n print('*'+' '*(sdvig)+x[i]+' '*(le-sdvig-len(x[i]))+'*') \n else: \n if left:\n sdvig = (le-len(x[i]))//2\n print('*'+' '*(sdvig)+x[i]+' '*(le-sdvig-len(x[i]))+'*')\n left = not(left)\n else:\n sdvig = (le-len(x[i]))//2\n print('*'+' '*(le-sdvig-len(x[i]))+x[i]+' '*(sdvig)+'*')\n left = not(left)\n fal.append(sdvig)\nprint('*'*(le+2))\n", "from sys import stdin \r\nlines = stdin.read().splitlines()\r\nmaxlen=0\r\nfor i in lines:\r\n maxlen=max(maxlen,len(i))\r\nprint(\"*\"*(maxlen+2))\r\nvar = -1 \r\nfor i in lines:\r\n currlen=len(i)\r\n lspace=int((maxlen-currlen)/2)\r\n mod=(maxlen-currlen)%2\r\n if mod==1:\r\n if var==1:\r\n lspace+=1\r\n var=var*-1\r\n k=maxlen-lspace-currlen \r\n print(\"*\"+' '*lspace + i + ' '*k + \"*\")\r\nprint(\"*\"*(maxlen+2))", "import sys\n\ndef main():\n lines = sys.stdin.readlines()\n lines = [line.strip() for line in lines]\n maxlen = max(len(line) for line in lines)\n print('*' * (maxlen + 2))\n left = True\n for line in lines:\n space = maxlen - len(line)\n if space % 2 == 0:\n lpad = rpad = space // 2\n elif left:\n lpad = space // 2\n rpad = space - lpad\n left = False\n else:\n rpad = space // 2\n lpad = space - rpad\n left = True\n print('*' + ' ' * lpad + line + ' ' * rpad + '*')\n print('*' * (maxlen + 2))\n\nmain()\n \t \t \t\t\t \t\t \t \t\t \t \t \t\t\t", "import sys\r\nmax_string_len = 0\r\nraw_string = []\r\nflag_l = True\r\n\r\nfor st in sys.stdin.read().splitlines():\r\n raw_string.append([st, len(st)])\r\n if len(st) > max_string_len:\r\n max_string_len = len(st)\r\nmax_len = max_string_len + 2\r\n\r\nprint('*' * max_len)\r\n\r\nfor st in raw_string:\r\n tmp_add = max_string_len - st[1]\r\n if st[1] == 0:\r\n print('*'+' '*max_string_len+'*')\r\n continue\r\n if tmp_add == 0:\r\n print('*'+st[0]+'*')\r\n continue\r\n else:\r\n sum_l1 = tmp_add//2\r\n if (tmp_add % 2) == 0:\r\n l1 = sum_l1\r\n print('*'+' '*l1 + st[0] + ' '*l1+ '*')\r\n if tmp_add % 2 > 0 :\r\n if flag_l:\r\n l1 = sum_l1\r\n l2 = sum_l1 + 1\r\n if (not flag_l):\r\n l1 = sum_l1+ 1\r\n l2 = sum_l1\r\n flag_l = not flag_l\r\n print( '*'+' '*l1 + st[0] + ' '*l2+ '*')\r\n \r\nprint('*' * max_len)\r\n#print(raw_string)\r\n", "def main():\n temp = []\n while 1:\n try:\n temp.append(input())\n except:\n break\n max_index,c = max([len(i) for i in temp]), 0\n print(\"*\"*(max_index+2))\n for i in temp:\n s = [(max_index-len(i))/2]*2\n if len(i)%2 != max_index %2:\n c = 1-c\n s[c] += 1\n print(\"*\"+\" \"*int(s[0])+i+\" \"*int(s[1]) +\"*\") \n print(\"*\"*(max_index+2))\n\nif __name__ == \"__main__\":\n main()\n '''\n************\n* This is *\n* *\n*Codeforces*\n* Beta *\n* Round *\n* 5 *\n************ \n\n************\n* This is *\n* *\n*Codeforces*\n* Beta *\n* Round *\n* 5 *\n************\n****************\n*welcome to the*\n* Codeforces *\n* Beta *\n* Round 5 *\n* *\n* and *\n* good luck *\n****************\n'''", "text, maxLength = [], 0\r\n\r\nwhile True:\r\n try:\r\n t = input()\r\n text.append(t)\r\n if len(t) > maxLength:\r\n maxLength = len(t)\r\n except EOFError:\r\n break\r\n\r\nprint(\"*\" * (maxLength + 2))\r\ni = 0\r\nfor t in text:\r\n if (maxLength - len(t)) % 2 == 0:\r\n print(\"*\" + \" \" * int(((maxLength - len(t)) / 2)) + t + \" \" * int(((maxLength - len(t)) / 2)) + \"*\")\r\n else:\r\n if i == 0:\r\n print(\"*\" + \" \" * int(((maxLength - len(t)) / 2)) + t + \" \" * (int(((maxLength - len(t)) / 2)) + 1) + \"*\")\r\n i = 1\r\n else:\r\n print(\"*\" + \" \" * (int(((maxLength - len(t)) / 2)) + 1) + t + \" \" * int(((maxLength - len(t)) / 2)) + \"*\")\r\n i = 0\r\nprint(\"*\" * (maxLength + 2))", "# LUOGU_RID: 101906402\na = [s.strip() for s in [*open(0)]]\r\nn = len(max(a, key=len))\r\nprint('*' * (n + 2))\r\nt = 0\r\nfor s in a:\r\n x = (n - len(s)) // 2\r\n y = n - len(s) - x\r\n if x != y:\r\n t += 1\r\n if t % 2 == 0:\r\n x, y = y, x\r\n print('*' + ' ' * x + s + ' ' * y + '*')\r\nprint('*' * (n + 2))", "def cima_baixo(n):\n print('*' * n)\n\ndef main():\n linhas = []\n maior = 0\n \n while True:\n try:\n pal = input()\n linhas.append(pal)\n \n if(len(pal) > maior):\n maior = len(pal)\n \n except:\n cima_baixo(maior+2)\n c = 0\n cb = 0\n \n for i in linhas:\n print('*', end = '')\n \n # printa a linha\n if(maior % 2 == 0):\n \n if(len(i) % 2 == 1):\n if(c % 2 == 0):\n i = i.center(maior-1) + ' '\n else:\n i = ' ' + i.center(maior-1)\n \n c += 1\n else:\n i = i.center(maior)\n else:\n \n if(len(i) % 2 == 0):\n if(cb % 2 == 0):\n i = i.center(maior-1) + ' '\n else:\n i = ' ' + i.center(maior-1)\n \n cb += 1\n else:\n i = i.center(maior)\n\n print(i, end = '')\n \n print('*')\n \n cima_baixo(maior+2)\n break\n \nmain()", "# Submitted using https://github.com/Nirlep5252/codeforces-cli\n# >.<\n\nimport sys\nlines = []\n\nwhile s := sys.stdin.readline():\n s = s.strip()\n lines.append((s, len(s)))\n\n# print(*lines)\n\nm = sorted(lines, key=lambda x: x[1])[-1][1]\n\nprint(\"*\" * (m + 2))\nalt = False\nfor line, l in lines:\n diff = m - l\n e = (diff // 2) + (alt if diff % 2 else 0)\n print(\"*\" + (\" \" * (e) + (line) + (\" \" * (diff - e) + \"*\")))\n if diff % 2:\n alt = not alt\nprint(\"*\" * (m + 2))\n\n", "import sys\r\n\r\ninput_lines = sys.stdin.readlines()\r\nlines = [line.strip() for line in input_lines]\r\nmax_length = len(max(lines, key=len))\r\nprint(\"*\" * (max_length+2))\r\nround_left = True\r\n\r\nfor line in lines:\r\n num_spaces = max_length - len(line)\r\n if len(line) == 0:\r\n print(\"*\" + \" \" * max_length + \"*\")\r\n elif (num_spaces % 2) == 0:\r\n print(\"*\" + \" \" * (num_spaces // 2) + line + \" \" * (num_spaces // 2) + \"*\")\r\n elif round_left:\r\n print(\"*\" + \" \" * (num_spaces // 2) + line + \" \" * (num_spaces // 2 + 1) + \"*\")\r\n round_left = False\r\n else:\r\n print(\"*\" + \" \" * (num_spaces // 2 + 1) + line + \" \" * (num_spaces // 2) + \"*\")\r\n round_left = True\r\nprint(\"*\" * (max_length+2))", "a = []\r\nm_len = 0\r\ntry:\r\n while 1:\r\n a.append(input())\r\n m_len = max(m_len, len(a[-1]))\r\nexcept EOFError:\r\n print('*' * (m_len + 2))\r\n flag = 0\r\n for i in range(len(a)):\r\n l = len(a[i])\r\n space = (m_len - l) // 2\r\n if l % 2 == m_len % 2:\r\n print('*' + ' ' * space + a[i] + ' ' * space + '*')\r\n else:\r\n print('*' + ' ' * (space + flag) + a[i] + ' ' * (space + 1 - flag) + '*')\r\n flag = 1 - flag\r\n print('*' * (m_len + 2))", "\nm = []\nmax_size = 0\n\nwhile True:\n \n try:\n line = input()\n except:\n break\n\n line = line.strip()\n max_size = max(max_size, len(line))\n m.append(line)\n\nsize = max_size\n\nprint(\"*\" * (size + 2))\n\ni = 0\nfor line in m:\n s = \"*\"\n\n spaces = size - len(line)\n\n if spaces % 2 == 1 and i % 2 == 1:\n spacel = spaces // 2 + 1\n else:\n spacel = spaces // 2\n\n s += (\" \" * spacel)\n s += line\n s += (\" \" * (spaces - spacel))\n s += \"*\"\n print(s)\n\n if spaces % 2 == 1:\n i += 1\n\nprint(\"*\" * (size + 2))\n\n\n\t\t \t\t\t \t \t \t\t \t\t \t\t\t\t", "from sys import stdin\r\n\r\nlines = []\r\nfor line in stdin:\r\n lines.append(line.strip())\r\n\r\nn = max(len(line) for line in lines)\r\nprint('*' * (n+2))\r\nf = 0\r\nfor line in lines:\r\n print('*', end='')\r\n if len(line) % 2 == n % 2:\r\n print(' ' * ((n - len(line))//2), line, ' ' * ((n - len(line))//2), '*', sep='')\r\n elif f:\r\n print(' ' * ((n - len(line))//2 + 1), line, ' ' * ((n - len(line))//2), '*', sep='')\r\n f = 0\r\n else:\r\n print(' ' * ((n - len(line))//2), line, ' ' * ((n - len(line))//2 + 1), '*', sep='')\r\n f = 1\r\nprint('*' * (n+2))\r\n", "def change(i):\r\n global a;global flag;\r\n l=len(a[i]);\r\n tmp=\"\";\r\n space=maxlen-l;\r\n for j in range(space//2):tmp+=' ';\r\n if(space%2==0):\r\n a[i]='*'+tmp+a[i]+tmp+'*';\r\n else:\r\n if(flag==0):a[i]='*'+tmp+a[i]+tmp+' *';\r\n else: a[i]='*'+tmp+' '+a[i]+tmp+'*';\r\n flag^=1;\r\na=[];\r\nmaxlen=0;\r\nwhile(1):\r\n try:\r\n tmp=input();\r\n le=len(tmp);\r\n if(le>maxlen):maxlen=le;\r\n a.append(tmp);\r\n except:\r\n break;\r\ncnt=len(a);\r\nflag=0;\r\nfor i in range(cnt):\r\n change(i);\r\ntmp=\"\";\r\nfor i in range(maxlen+2):tmp+='*';\r\na.insert(0,tmp);a.append(tmp);\r\nfor i in a:print(i);\r\n \r\n", "width = 0\nword_list = []\nwhile True:\n try:\n a = input()\n if len(a) > width:\n width = len(a)\n word_list.append(a)\n except EOFError:\n break\nleft = True\nfor i,j in enumerate(word_list):\n dif = width-len(j)\n if len(j) < width:\n word_list[i] = \" \"*(dif//2) + j +\" \"*(dif//2)\n if dif%2==1:\n if left:\n word_list[i] += \" \"\n else:\n word_list[i] = \" \" + word_list[i]\n left = not left\n\nword_list.insert(0,\"*\"*width)\nword_list.append(\"*\"*width)\nfor i in word_list:\n print(\"*\"+i+\"*\")\n\t \t\t \t \t\t \t \t\t \t\t\t \t\t", "\"\"\"\nCodeforces\n5B - Center Alignment\nhttp://codeforces.com/contest/5/problem/B\n\nHéctor González Belver\n../07/2018\n\"\"\"\nimport sys\n\ndef main():\n lines = [line.strip() for line in sys.stdin.readlines()]\n\n max_length = max(len(line) for line in lines)\n \n add_space = False\n\n sys.stdout.write('*' * (max_length + 2) + '\\n')\n for line in lines:\n if len(line)%2 != max_length%2:\n if add_space:\n line = ' ' + line\n add_space = not add_space\n \n sys.stdout.write('*' + '{0:^{1}}'.format(line, max_length) + '*' + '\\n')\n sys.stdout.write('*' * (max_length + 2) + '\\n')\n\nif __name__ == '__main__': \n main()", "text=[]\r\nMax=0\r\nwhile 1:\r\n try:\r\n tmp=input()\r\n Max=max(Max,len(tmp))\r\n text.append(tmp)\r\n except:\r\n break\r\nprint('*'*(Max+2))\r\nflag=True\r\nfor i in text:\r\n tmp=Max-len(i)\r\n if flag:\r\n Tmp=tmp//2\r\n else:\r\n Tmp=tmp-tmp//2\r\n print('*'+' '*Tmp+i+' '*(tmp-Tmp)+'*')\r\n if Tmp!=tmp-Tmp: \r\n flag=not flag\r\nprint('*'*(Max+2))", "import sys\n\ndef printRange(n, c=' ', end='\\n'):\n for _ in range(n):\n print(c, end='')\n print(end=end)\n\n\nlines = []\nsz = 0\nfor line in sys.stdin:\n lines.append(line[:-1])\n sz = max(sz, len(line[:-1]))\n\npadLeft = True\nprintRange(sz+2, '*')\nfor line in lines:\n d = sz - len(line)\n print('*', end='')\n if(d%2 == 0):\n printRange(d//2, ' ', '')\n print(line, end='')\n printRange(d//2, ' ', '')\n else:\n printRange(d//2 if padLeft else (d+1)//2, ' ', '')\n print(line, end='')\n printRange((d+1)//2 if padLeft else d//2, ' ', '')\n padLeft = not padLeft\n print('*')\n\n\nprintRange(sz+2, '*')\n\n \t\t \t \t\t \t \t\t\t\t \t\t", "import sys\nfrom math import floor, ceil\n\ntext = []\nfor line in sys.stdin:\n text.append(line.strip())\n\nmax_len = max(map(lambda x: len(x), text))\nnew_lines = []\nnew_lines.append(\"*\" * (max_len+2))\nleft = True\nfor old_line in text:\n spaces_to_add = max_len - len(old_line)\n if spaces_to_add % 2 == 1:\n if left:\n left_spaces_to_add = floor(spaces_to_add/2)\n right_spaces_to_add = ceil(spaces_to_add/2)\n left = False\n else:\n left_spaces_to_add = ceil(spaces_to_add/2)\n right_spaces_to_add = floor(spaces_to_add/2)\n left = True\n else:\n left_spaces_to_add = int(spaces_to_add/2)\n right_spaces_to_add = left_spaces_to_add\n new_line = \"*\" + \" \" * left_spaces_to_add + old_line + \" \" * right_spaces_to_add + \"*\"\n new_lines.append(new_line)\n\nnew_lines.append(\"*\" * (max_len+2))\nprint('\\n'.join(new_lines))\n\t \t\t\t \t \t\t\t\t \t \t \t \t\t\t\t\t\t", "n = 0\r\nl = []\r\ntry:\r\n while(1):\r\n s = input()\r\n l.append(s)\r\n n = max(n, len(s))\r\nexcept:\r\n pass\r\n\r\ntoggle = 1\r\n\r\nprint(\"*\" * (n + 2))\r\nfor s in l:\r\n if(n % 2 == len(s) % 2):\r\n print(\"*%s%s%s*\" % (\" \" * ((n - len(s)) // 2), s, \" \" * ((n - len(s)) // 2)))\r\n else:\r\n print(\"*%s%s%s*\" % (\" \" * ((n - len(s) - toggle) // 2), s, \" \" * ((n - len(s) + toggle) // 2)))\r\n toggle = -toggle\r\nprint(\"*\" * (n + 2))", "string,long,maxn,q = [],[],0,True\r\nwhile True:\r\n try:\r\n f = input().strip()\r\n n = len(f)\r\n string.append(f)\r\n long.append(n)\r\n maxn = max(maxn,n)\r\n except:\r\n break\r\nprint(maxn * '*' + '**')\r\nfor i in range(len(string)):\r\n l = maxn - long[i]\r\n n = l // 2\r\n if l % 2:\r\n if q:\r\n print('*' + ' ' * n + string[i] + ' ' * (n + 1) + '*')\r\n q = False\r\n else:\r\n print('*' + ' ' * (n + 1) + string[i] + ' ' * n + '*')\r\n q = True\r\n else:\r\n print('*' + ' ' * n + string[i] + ' ' * n + '*')\r\nprint(maxn * '*' + '**')", "def solve():\r\n from sys import stdin\r\n\r\n max_len = 0\r\n buffer = []\r\n align = -1\r\n\r\n # compute max_len among all lines read\r\n for line in stdin:\r\n line = line.strip()\r\n buffer.append(line)\r\n if len(line) > max_len:\r\n max_len = len(line)\r\n\r\n print('*' * (max_len+2))\r\n for line in buffer:\r\n if max_len % 2 == len(line) % 2:\r\n shift = ' ' * ((max_len - len(line))//2)\r\n print('*' + shift + line + shift + '*')\r\n else:\r\n left_space = ' ' * ((max_len - len(line) + align)//2)\r\n right_space = ' ' * ((max_len - len(line) - align)//2)\r\n align *= -1\r\n print('*' + left_space + line + right_space + '*')\r\n print('*' * (max_len+2))\r\n\r\nsolve()", "import sys\r\n\r\ntxt = [line.strip() for line in sys.stdin]\r\nmaxLen = max( [len(line) for line in txt] )\r\n#print(txt)\r\nprint('*' * (maxLen+2))\r\n\r\nflag = 1\r\nfor line in txt:\r\n #print(line)\r\n a = maxLen - len(line)\r\n if a % 2 != 0:\r\n if flag:\r\n b = a // 2\r\n else:\r\n b = a // 2 + 1\r\n flag = 1 - flag\r\n else:\r\n b = a // 2\r\n #print(a, b)\r\n print('*' + ' ' * b + line + ' ' * (a-b) + '*')\r\n\r\nprint('*' * (maxLen+2))\r\n", "text = []\r\nwhile True:\r\n try:\r\n text.append(input())\r\n except EOFError:\r\n break\r\n\r\nwidth = max([len(s) for s in text])\r\nleft = True\r\nprint('*' * (width + 2))\r\nfor line in text:\r\n if (width-len(line)) % 2:\r\n if left:\r\n line += ' '\r\n else:\r\n line = ' ' + line\r\n left = not left\r\n print('*' + line.center(width) + '*')\r\nprint('*' * (width + 2))\r\n", "lines = []\r\nln = 0\r\nwhile True:\r\n\ttry:\r\n\t\tline = input().strip()\r\n\t\tlines.append(line)\r\n\t\tln = max(ln, len(line))\r\n\texcept:\r\n\t\tbreak\r\n\r\nprint('*'*(ln+2))\r\nleft = True\r\n\r\nfor line in lines:\r\n\td = ln - len(line)\r\n\tif d % 2 and line:\r\n\t\tif left:\r\n\t\t\tx1 = d // 2\r\n\t\telse:\r\n\t\t\tx1 = d - d // 2\r\n\t\tleft = not left\r\n\telse:\r\n\t\tx1 = d // 2\r\n\tx2 = d - x1\r\n\tprint('*' + ' ' * x1 + line + ' ' * x2 + '*')\r\n\r\n\r\n\r\nprint('*'*(ln+2))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Mar 4 22:28:47 2018\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\nimport sys\r\na = [l.strip() for l in sys.stdin]\r\nw, c = max(len(l) for l in a), 0\r\nprint('*' * (w + 2))\r\nfor l in a:\r\n s = [(w - len(l)) // 2] * 2\r\n if len(l) % 2 != w % 2:\r\n c = 1 - c\r\n s[c] += 1\r\n print('*' + ' ' * s[0] + l + ' ' * s[1] + '*')\r\nprint('*' * (w + 2))", "if __name__ == '__main__':\r\n buffer = []\r\n maxm = 0\r\n while 1:\r\n try:\r\n s = input().strip()\r\n maxm = max(maxm, len(s))\r\n buffer.append(s)\r\n except EOFError:\r\n break\r\n print('*' * (maxm + 2))\r\n flag = 1\r\n for item in buffer:\r\n if (maxm - len(item)) % 2 == 0:\r\n print('*' + item.center(maxm) + '*')\r\n else:\r\n each = (maxm - len(item)) // 2\r\n if flag:\r\n print('*' + each * ' ' + item + ' ' * (each + 1) + '*')\r\n else:\r\n print('*' + (each + 1) * ' ' + item + ' ' * each + '*')\r\n flag = 1 - flag\r\n print('*' * (maxm + 2))", "input_lines=[]\r\nmax_length=0\r\nwhile True:\r\n try:\r\n line=input().strip()\r\n input_lines.append(line)\r\n max_length=max(max_length,len(line))\r\n except EOFError:\r\n break\r\nwidth=max_length+2\r\nframe_line=\"*\"*width\r\noutput_lines=[]\r\nleft=False\r\nfor line in input_lines:\r\n line_length=len(line)\r\n m=max_length-line_length\r\n s=m//2\r\n if m%2==0:\r\n formatted_line=\"*\"+\" \"*s+line+\" \"*s+\"*\"\r\n else:\r\n l,r=s,s\r\n if left:\r\n l+=1\r\n else:\r\n r+=1\r\n formatted_line=\"*\"+\" \"*l+line+\" \"*r+\"*\"\r\n left=not left\r\n output_lines.append(formatted_line)\r\noutput_lines.insert(0,frame_line)\r\noutput_lines.append(frame_line)\r\noutput=\"\\n\".join(output_lines)\r\nprint(output)", "import sys\r\n\r\nd = []\r\n\r\nfor line in sys.stdin:\r\n line = line.strip()\r\n d.append(line)\r\n\r\nl = [len(item) for item in d]\r\nm = max(l)\r\n\r\nstars = '*'*(m + 2)\r\nprint(stars)\r\nisleft = True\r\n\r\nfor line in d:\r\n free = m - len(line)\r\n if(not(free % 2)):\r\n free //=2\r\n print('*'+' '*free + line + ' '*free + '*')\r\n else:\r\n if(isleft):\r\n left = (free - 1)//2\r\n right = free - left\r\n else:\r\n right = (free - 1)//2\r\n left = free - right\r\n print('*' + ' '*left + line + ' '*right + '*')\r\n isleft ^= 1\r\n\r\nprint(stars)\r\n", "from sys import stdin\n\nrows = []\nfor line in stdin:\n s = line.rstrip()\n rows.append(s)\nwidth = len(max(rows, key=len))\nprint(\"*\" * (width + 2))\nshift = 0\nfor s in rows:\n if (len(s) - width) % 2 == 0:\n print(\"*\" + \" \" * ((width - len(s)) // 2) + s + \" \" * ((width - len(s)) // 2) + \"*\")\n else:\n print(\"*\" + \" \" * ((width - len(s)) // 2 + shift) + s + \n \" \" * ((width - len(s)) // 2 + 1 - shift) + \"*\")\n shift = 1 - shift\nprint(\"*\" * (width + 2))\n", "import sys\narr = []\n\nmax_len = 0\nfor s in sys.stdin:\n s = s.strip()\n arr.append(s)\n max_len = max(max_len, len(s))\n\nprint('*'*(max_len + 2))\nflag = True\nfor s in arr:\n diff = max_len - len(s)\n left = int(diff / 2)\n right = diff - left\n if left != right:\n if flag:\n left = int(diff / 2)\n right = diff - left\n else:\n right = int(diff / 2)\n left = diff - right\n # print(left, right, flag)\n flag = not flag\n\n # print(diff, left, right)\n print('*' + ' '*left + s + ' '*right + '*')\n\nprint('*'*(max_len + 2))\n", "from sys import stdin\n\ndef is_even(n):\n return n % 2 == 0\n\nlineas = [linea.strip() for linea in stdin]\n\nlargo = max(len(linea) for linea in lineas)\n\nlargo_par = is_even(largo)\n\nprint(\"*\"*(largo + 2))\n\nintercalar = False if largo_par else True\nintercalar_inicial = intercalar\nfor linea in lineas:\n centrado = linea.center(largo)\n if is_even(len(linea)) != largo_par and intercalar:\n if intercalar_inicial:\n centrado = list(centrado)\n centrado.pop(0)\n centrado = \"\".join(centrado)\n print(\"*\", centrado, \" *\", sep=\"\")\n intercalar = not intercalar\n else:\n centrado = list(centrado)\n centrado.pop(-1)\n centrado = \"\".join(centrado)\n print(\"* \", centrado, \"*\", sep=\"\")\n intercalar = not intercalar\n else:\n print(\"*\", centrado, \"*\", sep=\"\")\n if is_even(len(linea)) != largo_par:\n intercalar = not intercalar\n\nprint(\"*\"*(largo + 2))\n\t \t \t\t\t \t \t\t\t\t \t \t\t\t \t\t\t \t \t\t", "lst = [line.rstrip() for line in open(0).readlines()]\r\nn = max(len(w) for w in lst)\r\n\r\nres = ['*' * (n+2)]\r\nL = True\r\nfor w in lst:\r\n spaces = n - len(w)\r\n wSpaces = \" \" * (spaces // 2)\r\n w1 = w\r\n if len(w) % 2 != n % 2: \t\r\n w1 = w + \" \" if L else \" \" + w\r\n L = not L\r\n res.append(\"*\" + wSpaces + w1 + wSpaces + \"*\") \r\nres.append('*' * (n+2))\r\nprint(\"\\n\".join(res))", "import sys\r\n\r\nlines = list(map(lambda x: x.strip(), sys.stdin))\r\nsize = len(max(lines, key=lambda x: len(x)))\r\n\r\nshortleft = 1\r\n\r\nprint(\"*\" * (size + 2))\r\nfor line in lines:\r\n white = size - len(line)\r\n left = right = 0\r\n if white % 2:\r\n if shortleft:\r\n left = int(white / 2)\r\n right = int(white / 2) + 1 * (white % 2)\r\n else:\r\n left = int(white / 2) + 1 * (white % 2)\r\n right = int(white / 2)\r\n shortleft = 1 - shortleft\r\n else:\r\n left = int(white / 2)\r\n right = int(white / 2)\r\n \r\n \r\n print(f\"*{left * ' '}{line}{right * ' '}*\")\r\nprint(\"*\" * (size + 2))\r\n\r\n", "words = [e[:-1] for e in [*open(0)]]\r\nprint(\"*\"*(len(max(words,key=len))+2))\r\nflag= True # True -> left False -> right\r\nfor e in words:\r\n l = [\" \"]*(len(max(words,key=len))+2)\r\n l[0]=\"*\"\r\n l[-1]=\"*\"\r\n if len(l)%2 == 0:\r\n if len(e)%2 == 0:\r\n l[len(l)//2-len(e)//2:len(l)//2+len(e)//2] = list(e)\r\n else:\r\n if flag:\r\n l[len(l)//2-len(e)//2-1:len(l)//2+len(e)//2] = list(e)\r\n else:\r\n l[len(l)//2-len(e)//2:len(l)//2+len(e)//2+1] = list(e)\r\n flag = not flag\r\n else:\r\n if len(e)%2 == 0:\r\n if flag:\r\n l[len(l)//2-len(e)//2:len(l)//2+len(e)//2] = list(e)\r\n else:\r\n l[len(l)//2-len(e)//2+1:len(l)//2+len(e)//2+1] = list(e)\r\n flag = not flag\r\n else:\r\n l[len(l)//2-len(e)//2:len(l)//2+len(e)//2+1] = list(e)\r\n print(''.join(l))\r\nprint(\"*\"*(len(max(words,key=len))+2))", "from sys import stdin\r\ns = stdin.read().split('\\n')\r\ns.pop()\r\nmaximum = 0\r\nfor line in s:\r\n if len(line)>maximum:\r\n maximum=len(line)\r\nis_odd = False\r\nif maximum%2 != 0:\r\n is_odd=True\r\nhead =''\r\nfor i in range(maximum+2):\r\n head+='*'\r\nprint(head)\r\nside = 'l'\r\nfor line in s:\r\n s='*'\r\n l = len(line)\r\n if l%2 == 0:\r\n if is_odd:\r\n tmp = (maximum-l-1)//2\r\n if side == 'r':\r\n tmp+=1\r\n side='l'\r\n else:\r\n side='r'\r\n for i in range(tmp):\r\n s+=' '\r\n s+=line\r\n tmp = maximum - tmp - len(line)\r\n for i in range(tmp):\r\n s+=' '\r\n s+='*'\r\n print(s)\r\n \r\n else:\r\n tmp = (maximum - l)//2\r\n for i in range(tmp):\r\n s+=' '\r\n s+=line\r\n for i in range(tmp):\r\n s+=' '\r\n s+='*'\r\n print(s)\r\n else:\r\n if is_odd:\r\n tmp = (maximum - l)//2\r\n for i in range(tmp):\r\n s+=' '\r\n s+=line\r\n for i in range(tmp):\r\n s+=' '\r\n s+='*'\r\n print(s)\r\n else:\r\n tmp = (maximum-l-1)//2\r\n if side == 'r':\r\n tmp+=1\r\n side='l'\r\n else:\r\n side='r'\r\n for i in range(tmp):\r\n s+=' '\r\n s+=line\r\n tmp = maximum - tmp - len(line)\r\n for i in range(tmp):\r\n s+=' '\r\n s+='*'\r\n print(s)\r\nprint(head)\r\n", "text = []\r\nmax_length = 0\r\nround_left = True\r\nwhile True:\r\n try:\r\n s = input()\r\n max_length = max(max_length, len(s))\r\n text.append(s)\r\n except EOFError:\r\n print('*' * (max_length + 2))\r\n for s in text:\r\n if len(s) % 2 == max_length % 2 or len(s) == 0:\r\n print(f'*{s:^{max_length}}*')\r\n else:\r\n if round_left:\r\n print(f\"*{' ' * ((max_length - len(s)) // 2) + s + ' ' * int((max_length - len(s) + 1) // 2)}*\")\r\n else:\r\n print(f\"*{' ' * ((max_length - len(s) + 1) // 2) + s + ' ' * ((max_length - len(s)) // 2)}*\")\r\n round_left = not round_left\r\n print('*' * (max_length + 2))\r\n break", "import sys\r\ns = [i.strip() for i in sys.stdin]\r\nl = max(map(len, s))\r\nprint('*'*(l+2))\r\nis_left = False\r\nfor i in s:\r\n t, a = divmod(l - len(i), 2)\r\n la = ra = ' ' * t\r\n if a == 1:\r\n if is_left:\r\n la += ' '\r\n else:\r\n ra += ' '\r\n is_left = not is_left\r\n print('*' + la + i + ra + '*')\r\nprint('*'*(l+2))\r\n", "from sys import stdin\r\n\r\nlines = list(map(lambda _: _.strip(), stdin.readlines()))\r\n\r\nmax_len = max(list(map(len, lines)))\r\n\r\nprint((max_len + 2) * '*')\r\n\r\nleft = 0\r\n\r\nfor line in lines:\r\n\tpad = max_len - len(line)\r\n\r\n\tif pad % 2 != 0:\r\n\t\tleft_pad = pad // 2 + left\r\n\t\tleft = 1 - left\r\n\telse:\r\n\t\tleft_pad = pad // 2\r\n\r\n\tright_pad = pad - left_pad\r\n\r\n\tprint('*', left_pad * ' ', line, right_pad * ' ', '*', sep='')\r\n\r\nprint((max_len + 2) * '*')\r\n", "import sys\n\ndef main():\n lines = sys.stdin.readlines()\n width = 0\n for line in lines:\n if line[-1] == '\\n':\n line = line[:-1]\n width = max(width, len(line))\n print((width + 2) * '*')\n \n tmp = 0\n for line in lines:\n if line[-1] == '\\n':\n line = line[:-1]\n l = len(line)\n rem = width - l\n lspc = (rem + tmp) // 2\n if rem % 2 == 1:\n tmp = 1 - tmp\n rspc = (rem + tmp) // 2\n print('*{}{}{}*'.format(lspc * ' ', line, rspc * ' '))\n print((width + 2) * '*')\n return 0\n\n\nif __name__ == '__main__':\n exit(main())\n\n", "import sys;\r\n\r\nlines = [None for i in range(1001)];\r\nn = 0; m = 0;\r\n\r\n\r\nfor s in sys.stdin:\r\n lines[n] = s.strip('\\n');\r\n m = max(m, len(lines[n]));\r\n n += 1;\r\n \r\n\r\nturn_is_left = True;\r\nsep = ('*' * (m + 2)) + '\\n';\r\n\r\nsys.stdout.write(sep);\r\n\r\nfor i in range(n):\r\n s = lines[i];\r\n l = len(s);\r\n q = ((m - l) // 2) * ' ';\r\n r = ''; t = '';\r\n if (m - l) % 2:\r\n if turn_is_left:\r\n t = ' ';\r\n else:\r\n r = ' ';\r\n turn_is_left = not turn_is_left;\r\n sys.stdout.write(f'*{q}{r}{s}{t}{q}*\\n');\r\n\r\nsys.stdout.write(sep);", "import sys\r\narr = [x.strip() for x in sys.stdin]\r\n\r\nl=len(arr)\r\nldict={}\r\nfor i in range(l):\r\n ldict[i]=len(arr[i])\r\nmx=max(ldict.values())\r\nprint(\"*\"*(mx+2))\r\nlr=0\r\nfor i in range(l):\r\n lspce1=(mx-ldict[i])//2\r\n lspce2=mx-(lspce1+ldict[i])\r\n if(lspce1!=lspce2):\r\n if(lr%2!=0):\r\n temp=lspce2\r\n lspce2=lspce1\r\n lspce1=temp\r\n lr+=1\r\n name=\"*\"+(\" \"*lspce1)+arr[i]+(\" \"*lspce2)+\"*\"\r\n print(name)\r\nprint(\"*\"*(mx+2))\r\n\r\n\r\n", "from sys import stdin\ntext = stdin.read().split(\"\\n\")[:-1]\nmaxi = 0\n\nfor line in text:\n\tif len(line) > maxi: maxi = len(line)\noutput = ['*'*(maxi+2)]\nrightturn = False\nfor lines in text:\n\tline = lines\n\tif len(line) % 2 != maxi % 2:\n\t\tif rightturn: line = \" \"+line\n\t\telse: line = line + \"\"\n\t\trightturn = not rightturn\n\toutput.append('*' + '{txt:^{width}}'.format(txt = line, width = maxi) + '*')\noutput.append('*'*(maxi+2))\nprint(\"\\n\".join(output))\n\n\n\"\"\"\n'* 5 *' \n'* 5 *'\n\n* and\n* *\n\n\"\"\"", "#! /usr/bin/env python3\n\nimport sys\n\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n text = parse(data)\n lines = text_center(text)\n for l in lines:\n print(l)\n\n\ndef parse(data):\n return tuple(s.rstrip('\\n') for s in data)\n\n\ndef text_center(text):\n maxs = max(text, key=len)\n maxlen = len(maxs)\n output = []\n output.append('*' * (maxlen + 2))\n switch = True\n for line in text:\n padlen = maxlen - len(line)\n if padlen % 2 != 0:\n padlen1 = padlen // 2\n padlen2 = padlen - padlen1\n if switch:\n pad1 = padlen1 * ' '\n pad2 = padlen2 * ' '\n else:\n pad2 = padlen1 * ' '\n pad1 = padlen2 * ' '\n switch = not switch\n else:\n pad1 = pad2 = (padlen // 2) * ' '\n output.append('*{0}{1}{2}*'.format(pad1, line, pad2))\n output.append('*' * (maxlen + 2))\n return output\n\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\n\r\ndata = []\r\nmax_len = 0\r\n\r\nnow = 1\r\nfor line in sys.stdin.readlines():\r\n data.append(line[:-1])\r\n max_len = max(max_len, len(line[:-1]))\r\n\r\nprint('*' * (max_len + 2))\r\nfor line in data:\r\n if max_len % 2 != len(line) % 2:\r\n if now == 1:\r\n out = '*' + ' ' * ((max_len - len(line)) // 2) + line + ' ' * ((max_len - len(line)) - (max_len - len(line)) // 2) + '*'\r\n else:\r\n out = '*' + ' ' * ((max_len - len(line)) - (max_len - len(line)) // 2) + line + ' ' * ((max_len - len(line)) // 2) + '*'\r\n now = -now\r\n else:\r\n out = out = '*' + ' ' * ((max_len - len(line)) // 2) + line + ' ' * ((max_len - len(line)) - (max_len - len(line)) // 2) + '*'\r\n print(out)\r\nprint('*' * (max_len + 2))", "#5B - Center alignment\r\n#Lines of text:\r\nl=[]\r\n#The longest line:\r\nmaxlen=0\r\n#While we have input, we append it to our list, \r\ntry:\r\n while True:\r\n a=input()\r\n l.append(a)\r\n #keeping track of the longest line, which sets the general frame:\r\n if len(a)>maxlen:maxlen=len(a)\r\nexcept:\r\n pass\r\n#Knowing the length of the longest line, we first print the upper\r\n#side of the '*' frame, which is one * longer than our text frames on each side\r\nprint(\"*\"*(maxlen+2))\r\n# u - uniformity switcher\r\nu=1\r\n#For each line in the text:\r\nfor each in l:\r\n #If the difference between the longest line and the current one is even:\r\n if (maxlen-len(each))%2:\r\n #we print one line closer to the left frame border,\r\n if u:\r\n u=0\r\n #And we are free to print the alligned text:\r\n print(\"*{text} *\".format(text=each.center(maxlen-1,' ')))\r\n #and one line closer to the right frame border\r\n else:\r\n u=1\r\n print(\"* {text}*\".format(text=each.center(maxlen-1,' ')))\r\n #else, we feel free to print a perfectly alligned text:\r\n else:\r\n print(\"*{text}*\".format(text=each.center(maxlen,' ')))\r\n#Then, we print the bottom lign of '*'\r\nprint(\"*\"*(maxlen+2))", "from sys import stdin \r\nfrom math import ceil, floor\r\na1, a2 = ceil, floor\r\na = stdin.readlines()\r\nm = len(max(a, key=len)) - 1\r\nf = \"*\" * (m + 2)\r\nprint(f)\r\nfor i in a:\r\n i = i.strip()\r\n l = len(i)\r\n g = m - l \r\n if (g // 2) * 2 != g:\r\n a1, a2 = a2, a1 \r\n print(\"*\" + \" \" * a1(g / 2) + i + \" \" * a2(g / 2) + \"*\")\r\nprint(f)", "max_l, lines = 0, []\nwhile True:\n try:\n line = input()\n\n if len(line) > max_l:\n max_l = len(line)\n \n lines.append(line)\n except EOFError:\n break\n\nprint(\"*\"*(max_l+2))\n\nround_l = True\nfor line in lines:\n if round_l:\n margin_l = (max_l-len(line))//2\n margin_r = margin_l if (max_l-len(line))%2 == 0 else margin_l+1\n round_l = False if margin_l != margin_r else True\n else:\n margin_r = (max_l-len(line))//2\n margin_l = margin_r if (max_l-len(line))%2 == 0 else margin_r+1\n round_l = True if margin_l != margin_r else False\n \n print(\"*\"+\" \"*margin_l+line+\" \"*margin_r+\"*\")\n\nprint(\"*\"*(max_l+2))\n\n\t \t \t \t \t\t\t\t \t\t \t \t\t\t\t\t \t\t", "\r\nimport sys\r\na = [l.strip() for l in sys.stdin]\r\nc = max(len(l) for l in a)\r\nb = True\r\nprint('*' * (c+2))\r\nfor r in a:\r\n k = c - len(r)\r\n h = k / 2\r\n m = k / 2\r\n if k % 2 != 0 :\r\n if b == True:\r\n m = m + 1\r\n b = False\r\n else :\r\n h = h + 1\r\n b = True\r\n print('*'+ ' ' * int(h) + r + ' '*int(m) +'*')\r\nprint('*' * (c+2))", "l=[];m=0\r\nwhile(1):\r\n try:\r\n s=input()\r\n l.append(s)\r\n if len(s)>m:\r\n m=len(s)\r\n except EOFError:\r\n break\r\nprint('*'*(m+2))\r\nll=1;rr=0\r\nfor i in l:\r\n x=m-len(i)\r\n\r\n if x%2==0:\r\n y=x//2\r\n print('*',' '*y,i,' '*y,'*',sep='')\r\n else:\r\n y=x//2\r\n e=y+1\r\n if ll==1:\r\n ll=0;rr=1\r\n print('*',' '*y,i,' '*e,'*',sep='')\r\n else:\r\n ll=1;rr=0\r\n print('*',' '*e,i,' '*y,'*',sep='')\r\nprint('*'*(m+2))", "# from collections import defaultdict\r\nfrom sys import stdin\r\n\r\ndef func(intput,mapping,unpack):\r\n lines = list(map(lambda _: _.strip(), stdin.readlines()))\r\n max_len = max(list(map(len, lines)))\r\n print((max_len + 2) * '*')\r\n left = 0\r\n for line in lines:\r\n pad = max_len - len(line)\r\n if pad % 2 != 0:left_pad = pad // 2 + left;left = 1 - left\r\n else:left_pad = pad // 2\r\n right_pad = pad - left_pad\r\n print('*', left_pad * ' ', line, right_pad * ' ', '*', sep='')\r\n print((max_len + 2) * '*')\r\n\r\n \r\ndef init(TestCases=True):\r\n intput = lambda : int(input())\r\n mapping = lambda s: list(map(s,input().split()))\r\n unpack = lambda s: map(s,input().split())\r\n for _ in range(int(input()) if TestCases else 1):\r\n func(intput,mapping,unpack)\r\n\r\nif __name__ == '__main__':\r\n init(False)", "max_len = 0\nwords = []\nfor i in range(1000):\n try:\n words.append(input().strip())\n except EOFError:\n break\n words.append(\"\");\nfor j in words:\n max_len = max(max_len, len(j))\nprint (\"*\"*(max_len+2))\nflag = 1\nfor k in range(len(words)):\n l = 0\n r = 0\n if max_len-len(words[k]):\n l = (max_len-len(words[k]))//2\n r = (max_len-len(words[k]))//2\n if (max_len-len(words[k]))%2:\n if not flag:\n l += 1\n flag = 1\n else:\n r += 1\n flag = 0\n st = \"*\" + \" \"*l + words[k] + \" \"*r + \"*\"\n print (st)\nprint (\"*\"*(max_len+2))\n\n\t\t \t \t \t\t \t\t \t\t \t \t \t \t \t\t", "from sys import stdin\r\n\r\nlines = list()\r\nm = 0\r\nf = True\r\nfor i in stdin:\r\n line = i.strip()\r\n m = max(m, len(line))\r\n lines.append(line)\r\nprint(\"*\" * (m + 2))\r\nfor line in lines:\r\n k = m - len(line)\r\n if k % 2 == 0:\r\n b = \" \" * (k // 2)\r\n a = \" \" * (k // 2)\r\n else:\r\n if f:\r\n b = \" \" * (k // 2)\r\n a = \" \" * (k // 2) + \" \"\r\n else:\r\n b = \" \" * (k // 2) + \" \"\r\n a = \" \" * (k // 2)\r\n f = not f\r\n print(\"*\" + b + line + a + \"*\")\r\nprint(\"*\" * (m + 2))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Mar 4 14:41:00 2018\r\n\r\n@author: hp\r\n\"\"\"\r\nimport sys\r\n\r\nlines = [line.strip() for line in sys.stdin]\r\nlongest = max(len(line) for line in lines)\r\n\r\nnear = 0\r\n \r\nprint('*' * (longest + 2))\r\nfor line in lines:\r\n half = [(longest - len(line)) // 2] * 2\r\n if (longest - len(line)) % 2 != 0:\r\n near = 1 - near\r\n half[near] += 1\r\n print('*' + ' ' * half[0] + line + ' ' * half[1] + '*')\r\n \r\nprint('*' * (longest + 2))", "import sys\r\n\r\ndef q5b():\r\n list = []\r\n while True:\r\n try:\r\n line = input()\r\n except EOFError:\r\n break\r\n list.append(line)\r\n\r\n maxLen = max(map(len, list))\r\n string = \"\"\r\n string += \"*\" * (maxLen + 2)\r\n string += \"\\n\"\r\n adjL = 1\r\n adjR = 0\r\n for s in list:\r\n string += \"*\"\r\n add = 0\r\n white = maxLen - len(s)\r\n if white % 2 != 0:\r\n adjL = 1 - adjL\r\n adjR = 1 - adjR\r\n add = 1\r\n string += \" \" * (white // 2 + adjL * add)\r\n string += s\r\n string += \" \" * (white // 2 + adjR * add)\r\n string += \"*\\n\"\r\n string += \"*\" * (maxLen + 2)\r\n print(string)\r\n\r\nq5b()\r\n", "def main(): \r\n words = [] #Guardar todas las palabras\r\n maxlen = 0 #Largo máximo \r\n \r\n while True: \r\n try:\r\n x = input()\r\n words.append(x)\r\n except:\r\n break\r\n \r\n maxlen = max(map(len, words)) \r\n \r\n print(\"*\"*(maxlen+2))\r\n \r\n side = 0 #0:Left, 1:Rigth\r\n for x in words:\r\n spa = maxlen - len(x) \r\n \r\n if spa%2 == 0:\r\n print(\"*\"+ \" \"*int(spa/2) + x + \" \"*int(spa/2) + \"*\") \r\n else:\r\n if side == 0:\r\n print(\"*\"+ \" \"*int(spa/2) + x + \" \"*(int(spa/2)+1) + \"*\")\r\n side = 1\r\n else:\r\n print(\"*\"+ \" \"*(int(spa/2)+1) + x + \" \"*int(spa/2) + \"*\")\r\n side = 0 \r\n \r\n print(\"*\"*(maxlen+2))\r\n \r\nif __name__ == \"__main__\":\r\n main()", "big = 0\nlines = []\n\ndef asteriks(n):\n\treturn ['*' for k in range(n)] + ['\\n']\n\t\ndef spaces(n):\n\treturn [' ' for k in range(n)]\n\ntry:\n\twhile True:\n\t\tline = input()\n\t\tsz = len(line)\n\t\tif sz > big:\n\t\t\tbig = sz\n\t\tlines.append(line)\nexcept:\n\tpass\n\n# - - - - -\n\nans = [''.join(asteriks(big + 2))]\n\nlast = 1\nfor k in range(len(lines)):\n\tsz = len(lines[k])\n\thf = big - sz\n\n\tif hf % 2 == 0:\n\t\tcurr = ['*'] + spaces(hf//2) + [lines[k]] + spaces(hf//2) + ['*\\n']\n\telse:\n\t\tlast = 1 - last\n\t\tcurr = ['*'] + spaces(hf//2 + last) + [lines[k]] + spaces(hf//2 + 1 - last) + ['*\\n']\n\n\tans.append(''.join(curr))\n\nans.append(''.join(asteriks(big + 2)))\n\nprint(''.join(ans))", "import sys\r\n\r\nw,r=0,1\r\na=[]\r\nfor s in sys.stdin:\r\n w=max(w,len(s)-1)\r\n a.append(s[:-1])\r\nprint('*'*(w+2))\r\nfor s in a:\r\n sp=w-len(s)\r\n z,y=divmod(sp,2)\r\n if y==1 and r==1:#left\r\n s='*'+' '*z+s+' '*(z+1)+'*'\r\n r=0\r\n elif y==1 and r==0:#right\r\n s='*'+' '*(z+1)+s+' '*z+'*'\r\n r=1\r\n else:\r\n s='*'+' '*z+s+' '*z+'*'\r\n print(s)\r\nprint('*'*(w+2))", "def func():\r\n s = []\r\n while True:\r\n try:\r\n s.append(input())\r\n except:\r\n break\r\n n = max(list(map(len,s)))\r\n flag = True\r\n ans = []\r\n ans.append(\"\".join(['*' for _ in range(n+2)]))\r\n for i in s:\r\n t = ['*']\r\n if (n-len(i))%2==1:\r\n if flag:\r\n ll = (n-len(i)-1)//2\r\n t = t+[' ' for _ in range(ll)]+list(i)+[' ' for _ in range(n-len(i)-ll)]+['*']\r\n flag = False\r\n else:\r\n ll = (n-len(i)+1)//2\r\n t = t+[' ' for _ in range(ll)]+list(i)+[' ' for _ in range(n-len(i)-ll)]+['*']\r\n flag = True\r\n else:\r\n t = t+[' ' for _ in range((n-len(i))//2)]+list(i)+[' ' for _ in range((n-len(i))//2)]+['*']\r\n ans.append(\"\".join(t))\r\n ans.append(\"\".join(['*' for _ in range(n+2)]))\r\n for i in ans:\r\n print(i)\r\n\r\n\r\nif __name__=='__main__':\r\n func()" ]

[ "b=['a','b','c','d','e','f','g','h','i','j']\r\nl=[0]*10\r\nz=[]\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n z.append(s[0])\r\n for j in range(len(s)):\r\n l[b.index(s[j])]+=10**(len(s)-j-1)\r\ns=0\r\nh=0\r\nj=1\r\nfor k in range(10):\r\n ma=0\r\n for i in range(10):\r\n if l[i]>ma:\r\n ma=l[i]\r\n bi=b[l.index(ma)]\r\n l[l.index(ma)]=0\r\n if not(bi in z) and h==0:\r\n h=1\r\n else:\r\n s+=ma*j\r\n j+=1 \r\nprint(s)", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nA_to_J = [0 for i in range(10)]\r\nnot_z = [-1 for i in range(10)]\r\nfor i in range(n):\r\n not_z[ord(s[i][0])-97] = 1\r\n for j in range(len(s[i])):\r\n A_to_J[ord(s[i][-(j+1)])-97] += 10 ** j\r\nans_A_to_J = [-1 for i in range(10)]\r\njudge = []\r\nfor i in range(10):\r\n judge.append([-A_to_J[i],not_z[i]])\r\njudge.sort()\r\n#print(\"judge\",judge)\r\n#print(\"not_z\",not_z)\r\nnow = 1\r\nnot_c = 0\r\n#print(judge)\r\n#not_z[i] =i 番目のアルファベットが先頭にくるかどうか\r\nans = 0\r\nfor i,j in judge:\r\n if j != 1:\r\n if not_c == 0:\r\n not_c = 1\r\n else:\r\n ans += -i * now\r\n now += 1\r\n else:\r\n ans += -i * now\r\n now += 1\r\nprint(ans)\r\n ", "n=int(input())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\na=[0]*10\r\nfor i in range(n):\r\n for j in range(len(s[i])):\r\n a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)\r\nb=[]\r\nfor i in range(10):\r\n b.append((a[i],i))\r\nb.sort()\r\nb.reverse()\r\nc=[0]*10\r\nfor i in range(n):\r\n c[ord(s[i][0])-ord('a')]=1\r\nans=[-1]*10\r\nfor i in range(10):\r\n if c[b[i][1]]==0:\r\n ans[b[i][1]]=0\r\n break\r\nj=1\r\nres=0\r\nfor i in range(10):\r\n if (ans[b[i][1]]==-1):\r\n res+=b[i][0]*j\r\n j+=1\r\nprint(res)\r\n", "n = int(input())\na = [list([0,0]) for _ in range(10)]\ns = t = z = 0\n\nfor _ in range(n):\n st = input()\n m = len(st)\n for j in range(m):\n if j == 0:\n a[ord(st[j]) - ord('a')][1] = 1\n a[ord(st[j]) - ord('a')][0] += 10 ** (m - j-1)\n\na.sort(reverse=True)\n\nfor i in range(10):\n if z or a[i][1]:\n s += a[i][0] * (t + 1)\n t += 1\n else:\n z = 1\n\nprint(s)\n\n \t \t\t\t\t\t \t\t\t\t \t \t \t \t\t \t\t\t \t", "from collections import Counter\r\n\r\ninp = [input() for _ in range(int(input()))]\r\n\r\nweight = Counter()\r\nfor word in inp:\r\n\tlen_w = len(word) - 1\r\n\tfor i, l in enumerate(word):\r\n\t\tweight[l] += 10**(len_w - i)\r\n\r\ndigit_map = {ord(x):0 for x in weight}\r\nnon_start = set(weight) - {x[0] for x in inp}\r\nif non_start:\r\n\tmost_nonstart = max(non_start, key=weight.get)\r\n\tdigit_map[ord(most_nonstart)] = '0'\r\n\tdel weight[most_nonstart]\r\n\r\ndigit_ord = (ord(k) for k, v in weight.most_common())\r\nfor i, w in enumerate(digit_ord, ord('1')):\r\n\tdigit_map[w] = i\r\n\r\nprint(sum(int(x.translate(digit_map)) for x in inp))\r\n", "from collections import defaultdict\n\nf, d = (defaultdict(int) for _ in range(2))\n\nn = int(input())\n\nfor _ in range(n):\n i = input()\n f[i[0]] = 1\n for e, j in enumerate(i):\n d[j] += 10 ** (len(i) - e - 1)\n\n\ndi = list(sorted(d.items(), key=lambda x: x[1], reverse=True))\nz = s = d = 0\nfor k, v in di:\n if not z and not f[k]:\n z = 1\n else:\n s += (d + 1) * v\n d += 1\n\nprint(s)\n\n\n\t\t \t \t\t\t\t \t\t\t \t \t \t \t\t \t", "from math import inf\r\n\r\nz={}\r\np={}\r\nfor i in range(97,97+10):\r\n z[chr(i)]=0\r\n\r\n p[chr(i)]=-1\r\nn=int(input())\r\n\r\nx=[]\r\nfor i in range(n):\r\n s=input().strip()[::-1]\r\n x.append(s)\r\n for j in range(len(s)):\r\n z[s[j]]+=10**(j)\r\n if j==len(s)-1:\r\n p[s[j]]=1\r\nm=-inf\r\nan=0\r\nxx=[0]*10\r\n#print(z)\r\nfor i in p:\r\n if p[i]==-1:\r\n if m<z[i]:\r\n m=z[i]\r\n an=i\r\nxx[0]=an\r\np=[]\r\n\r\nfor i in z:\r\n if i!=an:\r\n p.append([z[i],i])\r\n#print(p)\r\np.sort(reverse=True)\r\ncc=1\r\nfor i in p:\r\n xx[cc]=i[1]\r\n cc+=1\r\nt={}\r\nc=0\r\nfor i in xx:\r\n t[i]=c\r\n c+=1\r\nan=0\r\n#print(t)\r\nfor i in x:\r\n c=0\r\n for j in i:\r\n an+=pow(10,c)*t[j]\r\n c+=1\r\nprint(an)\r\n\r\n\r\n\r\n\r\n", "from pip._vendor.distlib.compat import raw_input\r\nn = int(input())\r\nnuly = [0]*10\r\ncisla = [0]*10\r\nfor i in range(10):\r\n cisla[i] = [0,0]\r\nprirazeni = [0]*10\r\nje_nula_prirazena = False\r\nfor i in range(n):\r\n vstup = raw_input()\r\n cisla[ord(vstup[0])-97][1] = -1\r\n for j in range(len(vstup)):\r\n cisla[ord(vstup[j])-97][0]+= 10**(len(vstup)-j-1)\r\ncisla.sort(reverse=True)\r\nminimum = 1\r\n\r\nfor i in range(10):\r\n if je_nula_prirazena == False:\r\n if cisla[i][1] == 0:\r\n prirazeni[i] = 0\r\n je_nula_prirazena = True\r\n continue\r\n prirazeni[i] = minimum\r\n minimum+=1\r\nprint(sum(prirazeni[i]*cisla[i][0] for i in range(10)))", "import heapq\r\nws=[0]*10\r\nnotzero=set()\r\nn=int(input())\r\nfor _ in range(n):\r\n s=input()\r\n n=len(s)\r\n notzero.add(s[0])\r\n for i in range(n-1,-1,-1):\r\n ws[ord(s[i])-97]+=pow(10,n-1-i)\r\nheap=[]\r\nfor i in range(10):\r\n if ws[i]!=0:\r\n heapq.heappush(heap,(-ws[i],chr(i+97)))\r\nsumm=0\r\nzero_used=False\r\nnextt=1\r\nwhile heap:\r\n count,w=heapq.heappop(heap)\r\n if w in notzero:\r\n summ+=(-count)*nextt\r\n nextt+=1\r\n else:\r\n if not zero_used:\r\n summ+=(-count)*0\r\n zero_used=True\r\n else:\r\n summ+=(-count)*nextt\r\n nextt+=1\r\nprint(summ)", "n=int(input())\r\ncounts={'a':0,'b':0,'c':0,'d':0,'e':0,'f':0,'g':0,'h':0,'i':0,'j':0}\r\ncan_be_zeros={'a':True,'b':True,'c':True,'d':True,'e':True,'f':True,'g':True,'h':True,'i':True,'j':True}\r\nfor i in range(n):\r\n\tline=input()\r\n\tlen_line=len(line)\r\n\tif len_line>=1:\r\n\t\tcan_be_zeros[line[0]]=False\r\n\tfor j in range(len_line):\r\n\t\tcounts[line[j]]+=10**(len_line-j-1)\r\n\r\nsorted_counts=sorted(counts,key=counts.get)[::-1]\r\nfor i in range(10):\r\n\tcur=sorted_counts[i]\r\n\tif counts[cur]>0 and can_be_zeros[cur]:\r\n\t\tcounts[cur]=0\r\n\t\tbreak\r\nresult=0\r\nfactor=1\r\nfor i in range(10):\r\n\tcur=sorted_counts[i]\r\n\tif counts[cur]>0:\r\n\t\tresult+=counts[cur]*factor\r\n\t\tfactor+=1\r\nprint(result)", "n=int(input())\r\nL=[]\r\nStartswith=[]\r\nfor i in range(n):\r\n L.append(input())\r\n Startswith.append(L[i][0])\r\n\r\nCases=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j']\r\ncoeff=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\r\n\r\n\r\nfor i in L :\r\n n=len(i)\r\n for j in range(n):\r\n coeff[Cases.index(i[j])]+=10**(n-j-1)\r\n\r\ncof=list(coeff)\r\nt=False\r\nk=0\r\nwhile((len(cof)!=0) and (t==False)):\r\n m=max(cof)\r\n p=cof.index(m)\r\n if ( Cases[p] in Startswith ) :\r\n cof[p]=-1\r\n \r\n else :\r\n \r\n t=True\r\n coeff[p]=-1\r\n Cases[p]=0\r\n\r\nc=max(coeff)\r\nj=1\r\nwhile (len(coeff)!=0 and(c!=-1)):\r\n c1=coeff.index(c)\r\n coeff[c1]=-1\r\n Cases[c1]=j\r\n j+=1\r\n c=max(coeff)\r\n\r\n\r\ndef convert(ch,Cases):\r\n n=len(ch)\r\n s=0\r\n for i in range(n):\r\n s+=(10**(n-i-1))*Cases[ord(ch[i])-97]\r\n return(s)\r\n\r\nL=[convert(i,Cases) for i in L ]\r\nprint(sum(L))\r\n \r\n", "from collections import defaultdict\n\nn = int(input())\n\nis_first = []\nd = defaultdict(int)\nans = 0\n\nfor _ in range(n):\n s = input()\n slen = len(s)\n for i in range(slen):\n t = s[i]\n if i == 0:\n if t not in is_first:\n is_first.append(t)\n num = 10 ** (slen - i - 1)\n d[t] += num\n\n\nl = sorted(d.items(), key=lambda v: v[1], reverse=True)\n\nfor i, x in enumerate(l):\n if x[0] not in is_first:\n l.pop(i)\n break\n\nfor i, x in enumerate(l):\n ans += x[1] * (i+1)\n\nprint(ans)\n \t\t\t\t\t \t\t\t\t\t\t \t \t \t \t\t \t\t", "alphabets=['a','b','c','d','e','f','g','h','i','j']\nmapping=[0]*10\nn=int(input())\nfirstLetter=[]\nfor i in range(n):\n\ts=input()\n\tfirstLetter.append(s[0])\n\tfor j in range(len(s)):\n\t\tmapping[alphabets.index(s[j])]+=10**(len(s)-j-1)\nflow=1\ncatchZero=0\nans=0\nfor i in range(10):\n\tsaikyu=0\n\tfor j in range(10):\n\t\tif saikyu<mapping[j]:\n\t\t\tsaikyu=mapping[j]\n\tif alphabets[mapping.index(saikyu)] not in firstLetter and catchZero==0:\n\t\tcatchZero=1\n\telse:\n\t\tans+=saikyu*flow\n\t\tflow+=1\n\tmapping[mapping.index(saikyu)]=0\nprint(ans)", "n = int(input())\n\nA = []\nD = {'a': 0, 'b': 0, 'c': 0, 'd': 0, 'e': 0, 'f': 0, 'g': 0, 'h': 0, 'i': 0, 'j': 0}\nT = {'a': 0, 'b': 0, 'c': 0, 'd': 0, 'e': 0, 'f': 0, 'g': 0, 'h': 0, 'i': 0, 'j': 0}\nS = set()\n\ndef score(word):\n S.add(word[0])\n m = len(word)\n i = 0\n for s in word:\n D[s] += 10**(m-i)\n i += 1\n\ndef calculateTable(S,B):\n zero_is_used = False\n k = 1\n for b in B:\n if b[1] != 0:\n if (b[0] not in S) and (not zero_is_used):\n T[b[0]] = 0\n zero_is_used = True\n else:\n T[b[0]] = k\n k += 1\n\ndef convertWordToNumber(word):\n x = ''\n for s in word:\n x += str(T[s])\n return int(x)\n\ndef solve(n):\n for _ in range(n):\n word = input()\n A.append(word)\n score(word)\n #print(S)\n #print(D)\n B = sorted(D.items(), key=lambda x: x[1], reverse=True)\n #print(B)\n calculateTable(S,B)\n #print(T)\n ans = 0\n for word in A:\n ans += convertWordToNumber(word)\n return ans\n\n\nans = solve(n)\nprint(ans)\n", "from collections import defaultdict\nn = int(input())\nd = defaultdict(int)\nnonzero = set()\nfor _ in range(n):\n a = input()\n for i, c in enumerate(a):\n d[c] += 10**(len(a) - i - 1)\n if i == 0:\n nonzero.add(c)\navail = [1,2,3,4,5,6,7,8,9]\nzeroused = 0\nM = {}\nfor k in sorted(d, key=lambda x: -d[x]):\n if k not in nonzero and not zeroused:\n M[k] = 0\n zeroused = 1\n else:\n M[k] = avail[0]\n avail.pop(0)\ns = 0\nfor k in d:\n s += d[k]*M[k]\nprint(s)\n\n\t\t \t \t \t\t \t \t\t \t \t", "\r\nn = int(input())\r\ninputs = [input() for _ in range(n)]\r\n\r\nsums = {char: 0 for char in \"abcdefghij\"}\r\nfirst_digital = {char: 0 for char in sums.keys() }\r\nchars = {} # 'a' - 1\r\n\r\nfor s in inputs:\r\n l = len(s)\r\n for i in range(l):\r\n if i == 0:\r\n first_digital[s[i]] = True\r\n sums[s[i]] += 10**(l - 1 - i)\r\n \r\nimport operator\r\nsorted_sums = list(reversed(sorted(sums.items(), key=operator.itemgetter(1))))\r\n#print(sorted_sums)\r\n#print(first_digital)\r\n\r\nval = 1\r\nzero_selected = False\r\nfor elem in sorted_sums:\r\n if elem[1] == 0:\r\n continue\r\n if first_digital[elem[0]]:\r\n chars[elem[0]] = val\r\n val += 1\r\n else:\r\n if not zero_selected:\r\n chars[elem[0]] = 0\r\n zero_selected = True\r\n else:\r\n chars[elem[0]] = val\r\n val += 1\r\n#print(chars)\r\n\r\nmin_sum = 0\r\nfor elem in sorted_sums:\r\n if elem[1] == 0:\r\n continue\r\n min_sum += (chars[elem[0]] * elem[1])\r\nprint(min_sum)\r\n", "from collections import *\r\nn=int(input())\r\nq=Counter([])\r\nw=set()\r\nfor _ in range(n):\r\n s=input()\r\n w.add(s[0])\r\n o=len(s)\r\n k=10**o\r\n for j in s:\r\n k//=10\r\n q[j]+=k\r\nans=0\r\nt=0\r\nfor x,y in q.most_common():\r\n if x not in w:\r\n w=x\r\n break\r\np=1\r\nfor x,y in q.most_common():\r\n if x!=w:\r\n ans+=p*y\r\n p+=1\r\nprint(ans)\r\n ", "m = {}\r\nf = {}\r\nfor c in \"abcdefghij\": \r\n\tm[c] = f[c] = 0\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n\ts = input()\r\n\tl = len(s)\r\n\tf[ s[0] ] = 1\r\n\tfor i, c in enumerate(s):\r\n\t\tm[c] += 10**(l-1-i)\r\n\r\nans = 0\r\nd = 1\r\nz = 1\r\nfor c, k in sorted(m.items(), key=lambda x: x[1], reverse=True):\r\n\tif z and not f[c]:\r\n\t\tz = 0\r\n\telse:\r\n\t\tans += d * k\r\n\t\td += 1\r\n\r\nprint(ans)\t", "n = int(input())\na = ord('a')\nval = [[0,chr(i+a)] for i in range(10)]\nleading = [False]*10\nfor _ in range(n):\n\ts = input()\n\tleading[ord(s[0])-a] = True\n\tp = 1\n\tfor i in range(len(s)-1,-1,-1):\n\t\tval[ord(s[i])-a][0] += p\n\t\tp *= 10\nval.sort(reverse=True)\n\nused_zero = False\ncur = 1\nans = 0\nfor i in range(10):\n\tc = val[i][1]\n\tif not leading[ord(c)-a] and not used_zero:\n\t\tused_zero = True\n\t\t# print(f'{c} = 0')\n\telse:\n\t\tans += val[i][0] * cur\n\t\t# print(f'{c} = {cur}')\n\t\tcur+=1\nprint(ans)", "ch = ['a','b','c','d','e','f','g','h','i','j']\r\na = [0]*10 #array to store total decimal value of each element index wise\r\ninitial=[] #stores initials of each string\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n initial.append(s[0])\r\n for j in range(len(s)):\r\n a[ch.index(s[j])]+=10**(len(s)-j-1)\r\nsum=0 #final sum\r\nflag=False #turns true after we have assigned zero\r\ncount=1 #digits we assign to each character\r\nfor k in range(10):\r\n maxFreq=0 #stores max value of an char from a array\r\n for l in range(10): #finds max value from a and assigns it to maxFreq var\r\n if maxFreq<a[l]:\r\n maxFreq=a[l]\r\n\r\n temp=a.index(maxFreq)\r\n currChar=ch[temp]\r\n a[temp]=0\r\n if currChar not in initial and not flag:\r\n flag = True #we have assigned this currChar 0 and now we switch flag\r\n else:\r\n sum+=maxFreq*count\r\n count+=1 #1 has been assigned now we assign 2 and so on...\r\nprint(sum)\r\n\r\n\r\n\r\n", "n=int(input())\r\nlist1=[0]*10\r\nlist2=[]\r\nlist4=[]\r\nfor i in range(0,n,1):\r\n x=input()\r\n m=len(x)\r\n list2.append(x[0])\r\n for i in range(0,m,1):\r\n list1[ord(x[i])-97]+=10**(m-i-1)\r\nfor i in range(0,10,1):\r\n list3=[list1[i],chr(i+97)]\r\n list4.append(list3)\r\nset2=set(list2)\r\nlist4.sort(reverse=True)\r\nlist5=[0,1,2,3,4,5,6,7,8,9]\r\nh=0\r\nfor i in range(0,10,1):\r\n if 0 in list5:\r\n if list4[i][1] not in set2:\r\n h=h+list4[i][0]*list5[0]\r\n del list5[0]\r\n else:\r\n h=h+list4[i][0]*list5[1]\r\n del list5[1]\r\n else:\r\n h=h+list4[i][0]*list5[0]\r\n del list5[0] \r\nprint(h)\r\n", "import math\r\nimport operator\r\nnum = int(input())\r\ntotal = 0\r\nstore = {}\r\nnonzero = []\r\n_max = 0\r\nfor i in range(num):\r\n _in = input()\r\n if _max < len(_in):\r\n \t_max = len(_in)\r\n if _in[0] not in nonzero:\r\n \tnonzero.append(_in[0])\r\n for j in range(len(_in)-1,-1,-1):\r\n \tif _in[j] in store:\r\n \t\tstore[_in[j]] += pow(10,len(_in)-j-1)\r\n \telse:\r\n \t\tstore[_in[j]] = pow(10,len(_in)-j-1)\r\nx = store\r\nsorted_x = sorted(x.items(), key=operator.itemgetter(1))\r\n\r\nused = False\r\ncur = 1\r\nfor i in range(len(sorted_x)-1,-1,-1):\r\n\tif sorted_x[i][0] not in nonzero and used == False:\r\n\t\tused = True\r\n\telse:\r\n\t\ttotal += sorted_x[i][1] * cur\r\n\t\tcur += 1\r\nprint(total)", "n = int(input())\r\ntot = {}\r\nnonZero = {}\r\nfor i in range(10):\r\n c = chr(i+ord('a'))\r\n tot[c] = 0\r\ndef processNum(n):\r\n l = len(n)\r\n cur = 1\r\n for i in range(l-1,-1,-1):\r\n tot[n[i]] += cur\r\n cur *= 10\r\n nonZero[n[0]] = True\r\nfor i in range(n):\r\n n = input()\r\n processNum(n)\r\narr = []\r\nfor key in tot.keys():\r\n arr.append([tot[key],key])\r\narr.sort()\r\narr.reverse()\r\nfor i in range(len(arr)):\r\n if arr[i][1] not in nonZero:\r\n del arr[i]\r\n break\r\nans = 0\r\nfor i in range(len(arr)):\r\n ans += (i+1)*arr[i][0]\r\nprint(ans)", "n = int(input())\nws = [input() for i in range(n)]\nX = lambda c: ord(c) - ord('a')\nlead, total = [False]*10, [0]*10\nfor w in ws:\n lead[X(w[0])] = True\n l = len(w)\n for i in range(len(w)):\n total[X(w[i])] += 10**(l-i-1)\nlead, total = zip(*sorted(zip(lead, total), key=lambda x: -x[1]))\na, z, s = 1, True, 0\nfor i in range(10):\n if z and not lead[i]:\n z = False\n continue\n s += a * total[i]\n a += 1\nprint(s)", "n = int(input())\r\nli = []\r\n \r\nalpa = {\"a\":0,\"b\":0,\"c\":0,\"d\":0,\"e\":0,\"f\":0,\"g\":0,\"h\":0,\"i\":0,\"j\":0}\r\nalpa2 = [\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"g\",\"h\",\"i\",\"j\"]\r\nzelo = []\r\nnum = {}\r\nlnum = [0,1,2,3,4,5,6,7,8,9]\r\nans = 0\r\n \r\nfor i in range(n):\r\n a = list(input())\r\n li.append(a)\r\n if a[0] not in zelo:\r\n zelo.append(a[0])\r\n for i in range(len(a)):\r\n alpa[a[i]] += 10**(len(a)-i-1)\r\n \r\n \r\nalpa = sorted(alpa.items(),key=lambda x:x[1],reverse=True)\r\n \r\nfor i in range(len(alpa)):\r\n if alpa[i][0] in zelo:\r\n if lnum[0] == 0:\r\n num[alpa[i][0]] = lnum.pop(1)\r\n else:\r\n num[alpa[i][0]] = lnum.pop(0)\r\n else:\r\n num[alpa[i][0]] = lnum.pop(0)\r\n \r\nfor i in range(len(li)):\r\n for j in range(len(li[i])):\r\n ans += num[li[i][j]] * 10**(len(li[i])-j-1)\r\nprint(ans)", "#! /usr/bin/env python3\n#------------------------------------------------\n# Author: krishna\n# Created: Sun Dec 24 17:45:40 IST 2017\n# File Name: 910c.py\n# USAGE:\n# 910c.py\n# Description:\n# \n#------------------------------------------------\nimport sys, operator\n\n\ndata = []\n\nc = int(sys.stdin.readline().rstrip())\nfor i in range(c):\n data.append(sys.stdin.readline().rstrip())\n\nmaxLen = max(len(line) for line in data)\ncantTakeZero = [line[0] for line in data]\n\nfor i in range(len(data)):\n data[i] = ('0' * (maxLen - len(data[i]))) + data[i]\n\ncount = {chr(i):0 for i in range(ord('a'), ord('k'))}\n\nfor i in range(maxLen):\n for line in data:\n if (line[i] == '0'):\n continue\n\n count[line[i]] += 1\n\n count = {k: v * 10 for (k,v) in count.items()}\n\ncount = {k: int(v / 10) for (k,v) in count.items()}\n\ncode = {}\ncounter = 1\nzeroUsed = 0\n\n# For given column, fix the values\nfor k in (sorted(count.items(), key=operator.itemgetter(1), reverse=True)):\n if (k[0] in code):\n continue\n\n if (zeroUsed == 0) and ((k[0] in cantTakeZero) == False):\n code[k[0]] = 0\n zeroUsed = 1\n else:\n code[k[0]] = counter\n counter += 1\n\ns = 0\nfor i in range(maxLen):\n for line in data:\n if (line[i] != '0'):\n s += code[line[i]]\n\n s *= 10\n\n# print(sorted(code.items()))\nprint(int(s / 10))\n", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nA_to_J = [0 for i in range(10)]\r\nnot_z = [-1 for i in range(10)]\r\nfor i in range(n):\r\n not_z[ord(s[i][0])-97] = 1\r\n for j in range(len(s[i])):\r\n A_to_J[ord(s[i][-(j+1)])-97] += 10 ** j\r\nans_A_to_J = [-1 for i in range(10)]\r\njudge = []\r\nfor i in range(10):\r\n judge.append([-A_to_J[i],i])\r\njudge.sort()\r\n#print(\"judge\",judge)\r\n#print(\"not_z\",not_z)\r\nnow = 1\r\nnot_c = 0\r\n#print(judge)\r\n#not_z[i] =i 番目のアルファベットが先頭にくるかどうか\r\nfor i in range(len(judge)):\r\n if not_z[judge[i][1]] == -1:\r\n #リーディングゼロになってもよい\r\n if not_c == 0:\r\n #ゼロをまだ1度も使っていいなければ\r\n if ans_A_to_J[judge[i][1]] == -1:\r\n ans_A_to_J[judge[i][1]] = 0\r\n not_c += 1\r\n else:\r\n if ans_A_to_J[judge[i][1]] == -1:\r\n ans_A_to_J[judge[i][1]] = now\r\n now += 1\r\n else:\r\n if ans_A_to_J[judge[i][1]] == -1:\r\n ans_A_to_J[judge[i][1]] = now\r\n now += 1\r\n #print(ans_A_to_J)\r\nans = 0\r\n#print(ans_A_to_J)\r\nfor i in range(n):\r\n now = \"\"\r\n for j in range(len(s[i])):\r\n now += str(ans_A_to_J[ord(s[i][j])-97])\r\n ans += int(now)\r\nprint(ans)", "n = int(input())\r\nd = [0] * (ord('j') + 1)\r\nfr = [0] * (ord('j') + 1)\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n fr[ord(s[0])] = 1\r\n for j in range(len(s)):\r\n d[ord(s[j])] += 10 ** (len(s) - j - 1)\r\na = [(d[i], i) for i in range(len(d))]\r\na.sort(reverse=True)\r\ncr, f = 1, 1\r\nfor c, i in a:\r\n if f and not fr[i]:\r\n f = 0\r\n else:\r\n ans += cr * c\r\n cr += 1\r\nprint(ans)\r\n \r\n", "mat=[]\r\nfor i in range(10):\r\n l=[0 for i in range(10)]\r\n mat.append(l)\r\n l=[]\r\nverif=[True for i in range(10)]\r\nfind=[False for i in range(10)]\r\ns=[]\r\nn=int(input())\r\nfor i in range(n):\r\n p=input()\r\n for j in range(len(p)):\r\n g=6-len(p)\r\n mat[ord(p[j])-97][g+j]+=1\r\n find[ord(p[j])-97]=True\r\n verif[ord(p[0])-97]=False\r\nfor i in range(10):\r\n if(find[i]==True):\r\n u=0\r\n for j in range(6):\r\n u=u+mat[i][j]*(10**(5-j))\r\n s.append((u,i,verif[i]))\r\ns=sorted(s)\r\ns=s[::-1]\r\npos=0\r\nfor i in range(len(s)):\r\n if(verif[s[i][1]]==True):\r\n pos=i\r\n break\r\nsomme=0\r\nk=1\r\nr=True\r\nfor i in range(len(s)):\r\n if((s[i][2]==True)and(r==True)):\r\n r=False\r\n else:\r\n somme=somme+k*s[i][0]\r\n k=k+1\r\nprint(somme)", "#def cmp:\r\n\r\na = int(input())\r\nmas = []\r\nar = dict()\r\nzer_bool = [0 for _ in range(40)]\r\nzer = 0\r\nans = [\"!\" for _ in range(40)]\r\nfor i in range(a):\r\n k = input()\r\n zer_bool[ord(k[0]) - 97] = 1\r\n mas.append(k)\r\n for j in range(len(k)):\r\n ar[k[j]] = ar.get(k[j], 0) + 10 ** (len(k) - j)\r\n\r\nk = []\r\nfor i in ar.keys():\r\n k.append([i, ar[i]])\r\n\r\nk.sort(key=lambda x: x[1], reverse=True)\r\ncnt = 1\r\nfor i in k:\r\n if not zer and not zer_bool[ord(i[0]) - 97]:\r\n zer = 1\r\n ans[ord(i[0]) - 97] = '0'\r\n\r\n if ans[ord(i[0]) - 97] == \"!\":\r\n ans[ord(i[0]) - 97] = str(cnt)\r\n cnt += 1\r\n\r\nsu = 0\r\nfor i in mas:\r\n k = \"\"\r\n for j in i:\r\n k += ans[ord(j) - 97]\r\n su += int(k)\r\n\r\nprint(su)\r\n", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\nn=ri()\r\na=[rl() for _ in range(n)]\r\n\r\nfirst=set()\r\ncnt=ddict(int)\r\nfor s in a:\r\n first.add(s[0])\r\n p=1\r\n for c in reversed(s):\r\n cnt[c]+=p\r\n p*=10\r\n\r\nmp={}\r\nz=0\r\nv=1\r\nfor c in sorted(cnt,key=lambda c:-cnt[c]):\r\n if not z and c not in first:\r\n mp[c]=0\r\n z=1\r\n else:\r\n mp[c]=v\r\n v+=1\r\n\r\nans=0\r\nfor s in a:\r\n v=0\r\n for c in s:\r\n v=10*v+mp[c]\r\n ans+=v\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nresult = 0\r\nweight = [0 for i in range(10)]\r\ncanzero = [True for i in range(10)]\r\nfor _ in range(n):\r\n x = list(str(input()))\r\n canzero[ord(x[0]) - 97] = False\r\n x.reverse()\r\n for i in range(len(x)):\r\n weight[ord(x[i]) - 97] += pow(10, i)\r\n# print(canzero)\r\n# print(weight)\r\nzero = 10\r\ncl = weight[:]\r\nwhile True:\r\n candidate = max(cl)\r\n i = cl.index(candidate)\r\n if canzero[i]:\r\n zero = i\r\n break\r\n else:\r\n cl[i] = -1\r\nweight.remove(weight[zero])\r\nweight = sorted(weight)\r\nweight.reverse()\r\nfor i in range(1, 10):\r\n result += i * weight[i - 1]\r\n# print(cl, zero, weight)\r\nprint(result)\r\n", "num=[]\n\nfor i in range(10):\n num.append([])\n num[i].append(1)\n num[i].append(0)\n\nn=int(input())\nfor kk in range(n):\n s=input()\n num[ord(s[0])-97][0]=0\n for i in range(len(s)):\n num[ord(s[i])-97][1]+=pow(10,len(s)-i-1)\n\nnum=sorted(num,key=lambda s:s[1],reverse=True)\n\nboo=True\nans=0\nnow=1\n\nfor i in range(10):\n if boo and num[i][0]==1:\n ans+=0\n boo=False\n else:\n ans+=num[i][1]*now\n now+=1\n\nprint(ans)\n", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,pi,inf\r\nfrom collections import deque,defaultdict\r\nfrom bisect import bisect,bisect_left\r\nfrom time import time\r\nfrom itertools import permutations as per\r\nfrom heapq import heapify,heappush,heappop,heappushpop\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\r\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(str(x)+'\\n')\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nnCr=lambda x,y:(f[x]*inv((f[y]*f[x-y])%N))%N\r\ninv=lambda x:pow(x,N-2,N)\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\nv=[0]*26\r\np=[0]*26\r\nfor i in range(I()):\r\n\ts=S()[::-1]\r\n\tp[ord(s[-1])-97]=1\r\n\tfor i,j in enumerate(s):\r\n\t\tv[ord(j)-97]+=(10**i)\r\nv=sorted(enumerate(v),reverse=True,key=lambda x:x[1])\r\na=list(range(27))[::-1]\r\nans=0\r\nfor i,j in v:\r\n\tif p[i]:\r\n\t\tif not a[-1]:\r\n\t\t\tans+=j*a.pop(-2)\r\n\t\telse:\r\n\t\t\tans+=j*a.pop()\r\n\telse:\r\n\t\tans+=j*a.pop()\r\nprint(ans)", "d = {}\r\nnon_zeroes = []\r\nletters = list('abcdefghij')\r\n\r\nfor letter in letters:\r\n d[letter] = 0\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n s = input()\r\n j = 1\r\n for letter in s:\r\n if j == 1 and letter not in non_zeroes:\r\n non_zeroes.append(letter)\r\n d[letter] += 10**(len(s) - j)\r\n j += 1\r\n\r\nmax = 0\r\nzero = ''\r\n\r\nfor letter in d.keys():\r\n if d[letter] > max and letter not in non_zeroes:\r\n zero = letter\r\n max = d[letter]\r\n\r\nif zero in d.keys():\r\n d.pop(zero)\r\n\r\nsum = 0\r\nnum = 1\r\n\r\nfor item in sorted(d.items(), key=lambda x: -x[1]):\r\n sum += num * item[1]\r\n num += 1\r\n\r\nprint(sum)", "from collections import defaultdict\r\nn = int(input())\r\nd = defaultdict(int)\r\ncantbezero = set()\r\nfor i in range(n):\r\n s = input()\r\n cantbezero.add(s[0])\r\n LEN = len(s)\r\n mul = 1\r\n for i in range(LEN - 1, -1, -1):\r\n d[s[i]] += mul \r\n mul*=10\r\ndone = defaultdict(int)\r\narr = []\r\nfor key in d.keys():\r\n arr.append([d[key], key])\r\narr.sort(reverse = True)\r\n# Search for zero\r\nfor i in range(len(arr)):\r\n if(arr[i][1] not in cantbezero):\r\n done[arr[i][1]] = 1234\r\n break\r\ngive = 1\r\nfor i in range(len(arr)):\r\n if(not done[arr[i][1]]):\r\n done[arr[i][1]] = give\r\n give += 1\r\nans = 0\r\nfor key in d.keys():\r\n if(done[key] != 1234):\r\n ans += d[key] * done[key]\r\nprint(ans)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n \r\nn = int(input())\r\nwords = []\r\nfor _ in range(n):\r\n words.append(input().strip())\r\nletters = [0] * 10\r\nleading = [False] * 10\r\n\r\nfor i in range(n):\r\n for j in range(len(words[i])):\r\n place = len(words[i]) - j\r\n c = ord(words[i][j]) - ord('a')\r\n letters[c] += 10 ** (place - 1)\r\n if j == 0:\r\n leading[c] = True\r\n\r\n\r\nfor i in range(10):\r\n letters[i] = (letters[i], i)\r\nletters.sort(reverse=True)\r\n\r\nans = 0\r\nused = []\r\nfor i in range(10):\r\n amt, idx = letters[i]\r\n for j in range(10):\r\n if j in used: continue\r\n if j == 0 and leading[idx]: continue\r\n ans += amt * j\r\n used.append(j)\r\n break\r\n\r\nprint(ans)", "n=int(input())\r\ns=[]\r\ndp=[[0,i] for i in range(10)]\r\nz=[True for i in range(10)]\r\nfor i in range(n):\r\n s1=input()\r\n z[ord(s1[0])-97]=False\r\n s.append(s1)\r\n for i in range(len(s1)):\r\n dp[ord(s1[i])-97][0]+=10**(len(s1)-i)\r\ndp.sort()\r\ndp.reverse()\r\nd=dict()\r\nx=0\r\nfor i in dp:\r\n if z[i[1]]==True:\r\n x=i\r\n break\r\ndp.remove(x)\r\ndp=[x]+dp\r\ny=0\r\nfor i in dp:\r\n d.update({chr(i[1]+97):str(y)})\r\n y+=1\r\ntot=0\r\nfor i in s:\r\n s2=\"\"\r\n for j in i:\r\n s2+=d[j]\r\n tot+=int(s2)\r\n \r\nprint(tot)\r\n \r\n \r\n\r\n \r\n", "n = int(input())\r\nmul = [0] * 10\r\ncan_zero = [True] * 10\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(len(s)):\r\n mul[ord(s[j]) - 97] += 10 ** (len(s) - 1 - j)\r\n can_zero[ord(s[0]) - 97] = False\r\n\r\nmax_zero, max_zero_idx = -1, -1\r\n\r\nfor i in range(10):\r\n if can_zero[i]:\r\n (max_zero, max_zero_idx) = max((max_zero, max_zero_idx), (mul[i], i))\r\n\r\nmul[max_zero_idx] = 10 ** 20\r\n\r\nmul.sort()\r\nans = 0\r\nfor i in range(10): ans += (9 - i) * mul[i]\r\nprint(ans)\r\n", "n = int(input())\na = [input() for _ in range(n)]\n\npos = [ [] for _ in range(10) ]\ncanzero = [ True for _ in range(10) ]\nfor s in a: \n m = len(s)\n canzero[ ord(s[0]) - ord('a') ] = False\n for i in range(m):\n pos[ord(s[i]) - ord('a')].append(m - i - 1)\n\nsums = sorted(\n enumerate(\n [sum(map(lambda x: 10 ** x, pos[i])) for i in range(10)]\n )\n ,key = lambda x: x[1]\n ,reverse= True\n )\nans = 0\nzeroed = False\ncurrd = 1\nfor (idx, val) in sums:\n if not zeroed and canzero[idx]:\n zeroed = True\n else:\n ans += currd * val\n currd += 1\nprint(ans)\n", "from collections import defaultdict\n\nn = int(input())\naa = [input() for i in range(n)]\n\ncounts = defaultdict(int)\ncanBeZero = set('abcdefghij')\n\nfor s in aa:\n canBeZero = canBeZero - {s[0]}\n for p, d in enumerate(reversed(s)):\n counts[d] += 10 ** p\n\nsums = sorted([(s, d) for d, s in counts.items()], reverse=True)\ndigits = set(range(0, 10))\nres = 0\n\nfor s, dchar in sums:\n min2 = sorted(digits)[:2]\n index = 0\n if dchar not in canBeZero and min2[0] == 0:\n index = 1\n dig = min2[index]\n\n digits = digits - {dig}\n res += s * dig\n\nprint(res)\n" ]

[ "n,m=map(int,input().split())\r\nx,y,M=0,1,1000000007\r\nfor i in range(n):\r\n\tx=((2*m-1)*x+y)%M;y=y*m%M\r\nprint((y+m*x)%M)", "P = 10**9 + 7\r\n\r\nn, k = map(int, input().split())\r\n\r\nprint(n + 1 if k == 1 else (k * pow(2 * k - 1, n, P) - pow(k, n, P)) * pow(k - 1, P - 2, P) % P)\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,m=map(int,input().split())\r\n'''\r\nc=[0]*(n+1)\r\nc[0]=1\r\nfor i in range(1,n+1):\r\n c[i]=2*c[i-1]\r\n print(c)\r\n for j in range(1,i):\r\n d=i-j\r\n c[i]-=c[j-1]*(((m-1)/m)**(d-1))*(1/m)\r\n\r\nprint(c)\r\nprint(c[-1]*(m**n))\r\n'''\r\n\r\ndp=[0]*(n+1)\r\ndp[0]=1\r\nmod=10**9+7\r\ninv=pow(m,mod-2,mod)\r\n\r\nres=0\r\nfor i in range(1,n+1):\r\n dp[i]=dp[i-1]*2\r\n res*=(m-1)\r\n res%=mod\r\n if i>=2:\r\n res+=dp[i-2]\r\n res*=inv\r\n res%=mod\r\n dp[i]-=res\r\n dp[i]%=mod\r\n\r\nprint(dp[-1]*pow(m,n,mod)%mod)", "n, m = [int(i) for i in input().split()]\r\n\r\nMOD = 10**9 + 7\r\n\r\nrat = (pow(m, MOD-2, MOD) * (2*m-1))%MOD\r\n\r\ncur = pow(m, n, MOD)\r\n\r\ntotal = cur\r\n\r\nfor i in range(n):\r\n total += cur\r\n total %= MOD\r\n cur *= rat\r\n cur %= MOD\r\n \r\nprint(total)", "n,m=map(int,input().split())\r\nx,y,M=0,1,10**9+7\r\nwhile n>0:\r\n\tx,y,n=(2*m*x-x+y)%M,y*m%M,n-1\r\nprint((y+m*x)%M)", "import sys\r\nfrom array import array\r\n\r\nn, m = map(int, input().split())\r\ndp = [array('i', [0])*(n+1) for _ in range(2)]\r\ndp[0][0] = dp[1][0] = 1\r\nmod = 10**9 + 7\r\n\r\nfor i in range(1, n+1):\r\n dp[0][i] = (dp[0][i-1] * m + dp[0][i-1] * (m-1)) % mod\r\n dp[1][i] = (dp[0][i-1] * m + dp[1][i-1] * m) % mod\r\n\r\nprint(dp[1][-1])\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nl = pow(10, 6) + 5\r\nmod = pow(10, 9) + 7\r\nfact = [1] * (l + 1)\r\nfor i in range(1, l + 1):\r\n fact[i] = i * fact[i - 1] % mod\r\ninv = [1] * (l + 1)\r\ninv[l] = pow(fact[l], mod - 2, mod)\r\nfor i in range(l - 1, -1, -1):\r\n inv[i] = (i + 1) * inv[i + 1] % mod\r\n\r\ndef comb(n, r):\r\n return fact[n] * inv[r] * inv[n - r] % mod if n >= r >= 0 else 0\r\n\r\nn, m = map(int, input().split())\r\nans = (n + 1) * pow(m, n, mod) % mod\r\npm = [1]\r\nfor _ in range(l):\r\n pm.append(m * pm[-1] % mod)\r\npm1 = [1]\r\nfor _ in range(l):\r\n pm1.append((m - 1) * pm1[-1] % mod)\r\nfor i in range(n - 1, 0, -1):\r\n ans += pm[i] * comb(n, i - 1) % mod * pm1[n - i] % mod\r\n ans %= mod\r\nprint(ans)", "n, m = [int(i) for i in input().split()]\r\n \r\nMOD = 10**9 + 7\r\n \r\nrat = (pow(m, MOD-2, MOD) * (2*m-1))%MOD\r\n \r\ncur = pow(m, n, MOD)\r\n \r\nif m == 1:\r\n print(n+1)\r\n \r\nelse:\r\n total = cur * (1 + (pow(rat, n, MOD)-1)*pow(rat-1, MOD-2, MOD))\r\n print(total%MOD)\r\n" ]

[ "from bisect import *\r\nn=int(input())\r\nd,a=[(0,0)],[0]*n\r\nfor i,x in enumerate(map(int,input().split())):\r\n no=bisect(d,(x,0))-1\r\n l,y=d[no]\r\n a[i]=str(y)\r\n d[no:no+1]=[(l,x),(x,x)]\r\nprint(' '.join(a[1:]))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_trie():\r\n G0, G1, cnt = [-1], [-1], [0]\r\n return G0, G1, cnt\r\n\r\ndef insert(x, l):\r\n j = 0\r\n for i in range(l, -1, -1):\r\n cnt[j] += 1\r\n if x & pow2[i]:\r\n if G1[j] == -1:\r\n G0.append(-1)\r\n G1.append(-1)\r\n cnt.append(0)\r\n G1[j] = len(cnt) - 1\r\n j = G1[j]\r\n else:\r\n if G0[j] == -1:\r\n G0.append(-1)\r\n G1.append(-1)\r\n cnt.append(0)\r\n G0[j] = len(cnt) - 1\r\n j = G0[j]\r\n cnt[j] += 1\r\n return\r\n\r\ndef count_min(k, l):\r\n j = 0\r\n ans = 0\r\n for i in range(l, -1, -1):\r\n if k & pow2[i]:\r\n if G0[j] ^ -1:\r\n ans += cnt[G0[j]]\r\n j = G1[j]\r\n else:\r\n j = G0[j]\r\n return ans\r\n\r\ndef kth_min(k, l):\r\n j = 0\r\n ans = 0\r\n for i in range(l, -1, -1):\r\n if not G0[j] == -1 and cnt[G0[j]] >= k:\r\n j = G0[j]\r\n else:\r\n ans += pow2[i]\r\n if not G0[j] == -1:\r\n k -= cnt[G0[j]]\r\n j = G1[j]\r\n return ans\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\npow2 = [1]\r\nl = 30\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1])\r\nG0, G1, cnt = binary_trie()\r\nu, m = dict(), dict()\r\ninsert(0, l)\r\ninsert(a[0], l)\r\nu[0], u[a[0]] = a[0], a[0]\r\nans = []\r\nfor i in a[1:]:\r\n j = kth_min(count_min(i, l), l)\r\n insert(i, l)\r\n ans0 = u[j]\r\n ans.append(ans0)\r\n u[i], u[j] = i, i\r\nsys.stdout.write(\" \".join(map(str, ans)))", "from bisect import bisect\r\n\r\nn = int(input())\r\narray = [int(x) for x in input().split()]\r\n\r\ntree = []\r\nans = [''] * n\r\nfor i in range(n):\r\n item = array[i]\r\n index = bisect(tree, (item, i))\r\n if i != 0:\r\n if index == 0:\r\n ans[i] = str(tree[0][0])\r\n elif index == i:\r\n ans[i] = str(tree[i - 1][0])\r\n else:\r\n ans[i] = str(tree[index - 1][0] if tree[index - 1][1] > tree[index][1] else tree[index][0])\r\n tree[index:index] = [(item, i)]\r\nprint(' '.join(ans[1:])) " ]

[ "n = int(input())\r\ns = list(input())\r\nfor d in range(1,n+1):\r\n\ts[0:d] = reversed(s[0:d]) if n%d == 0 else s[0:d]\r\nprint(\"\".join(s))\t", "\r\nn = int(input())\r\ns = input()\r\n\r\ndef get_divisors(n):\r\n\ti=2\r\n\toriginal = n\r\n\tres = []\r\n\tfor i in range(2,n+1):\r\n\t\tif n%i==0:\r\n\t\t\tres.append(i)\r\n\t\r\n\treturn res\r\n# print(get_divisors(n))\r\n\r\ndivisors = get_divisors(n)\r\nl = list(s)\r\nfor k in divisors:\r\n\ti=0\r\n\tj=k-1\r\n\twhile i<j:\r\n\t\tl[i],l[j] = l[j],l[i]\r\n\t\ti+=1\r\n\t\tj-=1\r\n\r\nprint(''.join(l))\r\n\r\n\r\n\r\n# Monterey Grove apartments, San Jose\r\n\r\n# What is the outgoing charges?\r\n# Quiet neighbourhood. no party\r\n# Breakdowns\r\n# Car parking\r\n# Utilities\r\n# Guest policy\r\n# Coming on june 4th, how to collect key\r\n# Ship packages\r\n# Crime rate\r\n# I want away from street.\r\n\r\n# Utilities extra(80-100),Parking (55 extra), electricity extra, internet extra \r\n# 50 application fee, 750 security deposit, 170 cleaning fee.\r\n\r\n\r\n# By 24th May, June is free\r\n# 2640, 2550(2nd floor), 2590\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# SayBrook Pointe apartments, Santa Clara Saturday - 5pm PST\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# Heritage Park - Sunday 12pm PST\r\n\r\n# 2410, 120 for Utilities, Elect, internet, 2 parking spots\r\n\r\n\r\n\r\n\r\n\r\n\r\n# Hidden lake apartments, Santa Clara\r\n# Rent - 2895\r\n# Utilities, electricity, internet extra. wtf?\r\n# Car parking included.\r\n\r\n\r\n# Vista 99 apartments, San Jose\r\n\r\n\r\n# SVTC Open House, Sunnyvale", "def swap(x):\r\n return x[-1::-1]\r\nn = int(input())\r\ns = input()\r\nfor i in range(1, n + 1):\r\n if not n%i:\r\n s = swap(s[:i]) + s[i:]\r\nprint(s)\r\n", "l = int(input())\r\nc = input()\r\ndivisors = []\r\nfor i in range(1, l//2 +1):\r\n if l % i == 0:\r\n divisors.append(i)\r\n\r\nfor i in divisors:\r\n c2 = c[0:i][::-1]\r\n c = c2 + c[i:]\r\n \r\nprint(c[::-1])", "n=int(input())\na=input()\ndiv=[]\n\nfor i in range(2,n+1):\n if n%i==0:\n div.append(i)\n\n\nfor i in range(len(div)):\n a=a[div[i]-1::-1]+a[div[i]:]\nprint(a)", "def div(n):\r\n\tout=[]\r\n\tfor i in range(1,n+1):\r\n\t\tif n%i==0:\r\n\t\t\tout.append(i)\r\n\treturn out\r\n\r\nn=int(input())\r\ns=input()\r\nd=div(n)\r\nfor i in d:\r\n\tt=s[:i]\r\n\ts=t[::-1]+s[i:]\r\nprint(s)\r\n", "n=int(input())\r\ns=input()\r\nl=list(s)\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n l[0:i]=reversed(l[0:i])\r\nprint(*l,sep=\"\")\r\n", "def question2():\r\n \r\n encrupted_len = int(input())\r\n encrupted_msg = input()\r\n divisors = []\r\n if encrupted_len == 1:\r\n return encrupted_msg\r\n i = encrupted_len\r\n while i > 1:\r\n if encrupted_len % i == 0:\r\n divisors.append(i)\r\n i -= 1 \r\n # print(divisors) \r\n while len(divisors) > 0:\r\n reverse_upto = divisors.pop()\r\n encrupted_msg = encrupted_msg[reverse_upto-1::-1] + encrupted_msg[reverse_upto:]\r\n # print(encrupted_msg) \r\n return encrupted_msg \r\n \r\n \r\n \r\n# remained_test_cases = int(input())\r\nremained_test_cases = 1 \r\nwhile remained_test_cases > 0:\r\n print(question2())\r\n remained_test_cases -= 1 ", "n=int(input())\r\na=input()\r\nif n==1:\r\n print(a)\r\nelif n==2:\r\n print(a[::-1])\r\nelse:\r\n b=[]\r\n for i in range(1,int(n**(0.5))+1):\r\n if n%i==0:\r\n b+=[i]\r\n if n//i!=i:\r\n b+=[n//i]\r\n b.sort()\r\n for i in b:\r\n a=a[:i][::-1]+a[i:]\r\n print(a)\r\n\r\n", "def get_delims(n):\r\n d = []\r\n for i in range(1, n//2+1):\r\n if n % i == 0:\r\n d.append(i)\r\n d.append(n)\r\n return d\r\n\r\n\r\nn = int(input())\r\ns = input()\r\ns_list = list(s)\r\nfor ind in get_delims(n):\r\n sub = s_list[:ind][::-1]\r\n sub.extend(s_list[ind:])\r\n s_list = sub\r\nprint(*s_list, sep=\"\")", "n, t = int(input()), input()\r\nfor i in range(1, n+1):\r\n if n % i == 0: t = t[i-1::-1] + t[i:]\r\nprint(t)\r\n", "n = int(input())\r\ns = input()\r\n\r\nbatas = int(n**0.5)\r\nhas = set()\r\n\r\nfor i in range(1, batas+1):\r\n cek1 = n/i\r\n cek2 = n//i\r\n if abs(cek1 - cek2) <= 1e-7:\r\n has.add(i)\r\n has.add(cek2)\r\n\r\nhas = sorted(has)[1:]\r\n\r\n\r\nfor x in has:\r\n s = s[:x][::-1] + s[x:]\r\n\r\nprint(s)\r\n", "def reverse(s, i): \r\n i, j = 0, i\r\n while i < j: \r\n s[i], s[j] = s[j], s[i] \r\n i += 1\r\n j -= 1 \r\n return s\r\nn = int(input())\r\ns = list(input())\r\nfor i in range(n): \r\n if n%(i+1) == 0: \r\n s = reverse(s, i)\r\nprint(''.join(s))", "n=int(input())\r\ntarget=[]\r\nfor el in range(2,n+1):\r\n if n%el==0:\r\n target.append(el)\r\ns=list(input())\r\nfor el in target:\r\n s=s[:el][::-1]+s[el:]\r\nprint(\"\".join(s))\r\n\r\n ", "n=int(input())\r\nstr=input()\r\nfor div in range(2,n+1):\r\n if n%div==0:\r\n str = ''.join(reversed(str[:div])) + str[div:]\r\nprint(str)\r\n", "n = int(input())\r\nS = input()\r\ns = []\r\nfor i in S:\r\n s.append(i)\r\na = []\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n a.append(i)\r\nfor i in a:\r\n x = []\r\n for j in range(i-1,-1,-1):\r\n x.append(s[j])\r\n for j in range(i):\r\n s[j] = x[j]\r\nfor i in s:\r\n print(i,end='')", "n, w = int(input()), input()\r\ndivisors = [i for i in range(2,n+1) if n % i == 0]\r\nfor d in divisors:\r\n w = (w[0:d])[::-1] + w[d:]\r\nprint(w)", "def decrypt_string(n, t):\r\n s = list(t) \r\n for d in range(1, n + 1):\r\n if n % d == 0:\r\n s[:d] = reversed(s[:d]) \r\n return ''.join(s)\r\n\r\nn = int(input())\r\nt = input()\r\n\r\nresult = decrypt_string(n, t)\r\n\r\nprint(result)", "n = int(input())\r\nt = input()\r\n\r\ndef get_divisors(k):\r\n divs = []\r\n for i in range(1, k//2 + 1):\r\n if k % i == 0:\r\n divs.append(i)\r\n divs.append(k)\r\n return divs\r\n\r\ndivs = get_divisors(n)\r\n\r\nfor div in divs:\r\n t = t[:div][::-1] + t[div:]\r\n\r\nprint(t)", "n=int(input())\r\ns=input()\r\nfor i in range(2,n+1):\r\n if n%i==0:\r\n s1=s[:i]\r\n #print(s1)\r\n s1=s1[::-1]\r\n #print(s1)\r\n s=s1+s[i:]\r\nprint(s)", "n = int(input())\r\ns = input()\r\nfor d in range(1, n + 1):\r\n if n % d == 0:\r\n s = s[:d][::-1] + s[d:]\r\nprint(s)", "n = int(input())\r\ns = input()\r\nans = \"\"\r\nfor i in range(1, n+1):\r\n ans += s[i-1]\r\n if n%i == 0:\r\n ans = ans[::-1]\r\nprint(ans)\r\n\r\n ", "n=int(input())\r\nword=str(input())\r\ndivisors=[]\r\nfor i in range(n,0,-1):\r\n if(n%i==0):\r\n divisors.append(i)\r\ndef replacing(string,start,end):\r\n newword=\"\"\r\n for i in range(end-1,start-2,-1):\r\n newword+=string[i]\r\n if(end!=len(string)):\r\n for i in range(end,len(string)):\r\n newword+=string[i]\r\n\r\n return newword\r\n\r\nfor i in range(len(divisors)-1,-1,-1):\r\n word=replacing(word,1,divisors[i])\r\nprint(word)\r\n\r\n\r\n", "def divisor(n):\r\n l=[]\r\n for i in range(1,n+1):\r\n\r\n if n%i==0:\r\n l.append(i)\r\n\r\n return l\r\n\r\nn = int(input())\r\nm = input()\r\nl=[]\r\nl = divisor(n)\r\nfor i in range(len(l)):\r\n\r\n m = m[:l[i]][::-1]+m[l[i]:]\r\n\r\nprint(m)\r\n", "a = int(input())\r\ns = input()\r\ns = [i for i in s]\r\n\r\nd = list()\r\n\r\nfor i in range(a):\r\n if a%(i+1)==0:\r\n d.append(i+1)\r\n\r\nfor i in d:\r\n b = s[:i]\r\n s = list(reversed(b)) + s[i:]\r\n\r\nfor i in s:\r\n print(i, end=\"\")", "n = int(input())\r\ns = str(input())\r\nl = []\r\na = s[0]\r\nb = \"\"\r\nfor i in range(1,n+1):\r\n if n%i == 0:\r\n l.append(i)\r\nif (len(l))%2 ==0:\r\n for j in range(len(l)-1):\r\n if j%2 == 0:\r\n for k in range(l[j],l[j+1]):\r\n a = s[k] + a\r\n else:\r\n for k in range(l[j],l[j+1]):\r\n b += s[k]\r\n print(a+b)\r\nelse:\r\n for j in range(len(l)-1):\r\n if j%2 == 0:\r\n for k in range(l[j],l[j+1]):\r\n a += s[k]\r\n else:\r\n for k in range(l[j],l[j+1]):\r\n b = s[k] + b\r\n print(b+a)\r\n\r\n\r\n ", "#https://codeforces.com/problemset/problem/999/B\n\nimport math\n#import numpy as np\n\nif __name__==\"__main__\":\n n = int(input())\n s = input()\n for x in range(1,n+1):\n if (n%x)!=0:\n continue\n b = [z for z in s[0:x]]\n b.reverse()\n b=\"\".join(b)\n a = s[x:len(s)]\n s = b+a\n print(s)\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = list(input().rstrip())\r\n\r\nfor d in range(1, n + 1):\r\n if n % d == 0:\r\n a = list(reversed(a[:d])) + a[d:]\r\nprint(*a, sep=\"\")\r\n ", "n=int(input())\r\ntemp=input()\r\nl=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n l.append(i)\r\n\r\nfor i in l:\r\n t=temp[:i]\r\n temp=temp[i:]\r\n t=t[::-1]\r\n temp=t+temp\r\n t=''\r\nprint(temp)", "n=int(input())\r\ns=input()\r\nfor i in range(2,n+1):\r\n if n%i==0:\r\n s2=s[:i][::-1]+s[i:]\r\n s=s2\r\n else:\r\n pass\r\nprint(s)", "a = int(input())\r\nb = input()\r\nc = 2\r\nd = ''\r\nwhile c <= a:\r\n if a % c == 0:\r\n for i in range(c - 1, -1, -1):\r\n d += b[i]\r\n b = d + b[c:]\r\n c += 1\r\n d = ''\r\nprint(b)", "n=int(input())\r\nt=[i for i in input()]\r\nl=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n l.append(i)\r\nfor i in l:\r\n t=t[:i][::-1]+t[i:]\r\nprint(\"\".join(t))\r\n\r\n", "n=int(input())\r\ns=input()\r\nfor gp in range(2,n+1):\r\n\tif(n%gp==0):\r\n\t\ttemp=s\r\n\t\ts=s[gp-1::-1]\r\n\t\ts=s+temp[gp::]\r\nprint(s)\r\n", "def f(n):\r\n ans = []\r\n d = 1\r\n while d * d < n:\r\n if n % d == 0:\r\n ans.append (d)\r\n ans.append (n//d)\r\n d += 1\r\n if d * d == n:\r\n ans.append (d)\r\n ans = sorted(ans)\r\n return ans\r\nn = int(input())\r\ns = input()\r\na = f(n)\r\nfor i in range (len(a)):\r\n s = s[:a[i]][::-1] + s[a[i]:]\r\nprint (s)", "n=int(input())\r\na=input()\r\n\r\nfor i in range(2,n):\r\n if n%i==0:\r\n s=a[:i]\r\n s=s[::-1]\r\n a=s+a[i:]\r\n \r\nprint(a[::-1])\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\ns = input()\nfor i in range(1, n + 1):\n if n % i:\n continue\n s = s[:i][::-1] + s[i:]\nprint(s)\n", "n=int(input())\r\ns=input()\r\nlst=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n lst.append(i)\r\nfor j in lst:\r\n s1=list(s[:j])\r\n s1.reverse()\r\n s3=\"\".join(s1)\r\n s2=s[j:]\r\n s=s3+s2\r\nprint(s)", "n = int(input())\nt = input(\"\")\ns = ''\nfor i in range(n):\n if n%(i+1) == 0 and i != 0:\n for j in range(i,-1,-1):\n s += t[j]\n if i != n:\n for j in range(i+1,n):\n s += t[j]\n t = s\n s = ''\nprint(t)\n", "n = int(input())\r\ns = input()\r\na = ''\r\nfor i in range(1,n+1):\r\n if n%i == 0:\r\n s = s[i-1::-1] + s[i:]\r\nprint(s)", "n=int(input())\r\na=input()\r\nd=[]\r\nfor x in range(2,n//2+1):\r\n if n%x==0:\r\n d.append(x)\r\nd.append(n)\r\nfor x in range(len(d)):\r\n a=''.join(reversed(list(a[0:d[x]])))+a[d[x]:]\r\nprint(a)\r\n", "from math import sqrt\r\nimport sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_ints_lists(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn=int(input())\r\ns=get_string()\r\nif n==1:\r\n print(s)\r\nelif n==2 or n==3:\r\n print(s[::-1])\r\nelse:\r\n p=int(sqrt(n))\r\n li=[]\r\n for i in range(2,p+1):\r\n if i*i==n:\r\n li.append(i)\r\n elif n%i==0:\r\n li.append(i)\r\n li.append(n//i)\r\n li.sort()\r\n #print(li)\r\n\r\n #print(s)\r\n for j in li:\r\n #print(j)\r\n s=s[j-1::-1]+s[j:n]\r\n #print(s)\r\n s = s[::-1]\r\n print(s)\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n s=s[:i][::-1]+s[i:]\r\n\r\nprint(s)\r\n\r\n", "n=int(input())\r\nstring=input()\r\n\r\nfor i in range(n):\r\n if n%(i+1)==0:\r\n string=string[0:i+1][::-1]+string[i+1:]\r\n #print(string)\r\nprint(string)\r\n", "n = int(input())\r\ns = input()\r\nfor i in range(1, n+1):\r\n if n%i == 0:\r\n substr1 = s[0:i]\r\n substr2 = s[i:]\r\n substr1 = list(substr1)\r\n substr1.reverse()\r\n s = ''\r\n for char in substr1:\r\n s += char\r\n s += substr2\r\nprint(s)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nword = list(sys.stdin.readline())\r\n\r\ndef decrypt(word):\r\n\r\n for i in range(1, len(word) + 1):\r\n if n%i==0:\r\n word[:i] = list(reversed(word[:i]))\r\n \r\n\r\n print(''.join(word))\r\n\r\ndecrypt(word)", "from sys import stdin, stdout, maxsize\r\n\r\ndef f(n : int, word):\r\n for i in range(1,n + 1):\r\n if (n%i == 0):\r\n word = (word[0:i])[::-1] + word[i:len(word)]\r\n return word\r\n\r\nn = int(input())\r\ns = stdin.readline()\r\nprint(f(n,s))", "n=int(input())\r\ns=input()\r\nfor i in range(1,len(s)+1):\r\n if n%i==0:\r\n s=s[i-1::-1]+s[i:]\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\n\r\nlstart = []\r\nlend = []\r\n\r\ni = 1\r\n\r\nwhile i * i <= n:\r\n if n % i == 0:\r\n lstart.append(i)\r\n if i * i != n:\r\n lend.append(n//i)\r\n i += 1 \r\n \r\nlstart+=reversed(lend)\r\nfor i in range(len(lstart)):\r\n s = s[lstart[i]-1::-1] + s[lstart[i]:]\r\n\r\nprint(s)", "\"\"\"\r\n-*- coding: utf-8 -*-\r\n\r\nCreated on Sat Jan 22 16:19:43 2022\r\n\r\n@author: Tausif Khan Arnob\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = input()\r\nfor i in range(1, n+1):\r\n if n%i == 0:\r\n s = s[:i][::-1] + s[i:]\r\nprint(s)", "n=int(input())\r\nch=input()\r\nl=[x for x in range (2,n+1) if ( n%x==0)]\r\na=[x for x in ch]\r\nfor i in range(len(l)):\r\n lis=a[0:l[i]]\r\n lis.reverse()\r\n a=lis+a[l[i]:]\r\nb=''.join(a)\r\nprint(b)\r\n", "n = int(input())\r\nt = input()\r\n\r\n# Find all divisors of n\r\ndivisors = [d for d in range(1, n+1) if n % d == 0]\r\n\r\n# Decrypt the string using the algorithm\r\ns = list(t)\r\nfor d in divisors:\r\n s[:d] = reversed(s[:d])\r\n\r\n# Convert the list back to a string and print it\r\nprint(''.join(s))\r\n", "n=int(input())\r\ns=input()\r\ns1=\"\"\r\ni=0\r\nwhile(i<n):\r\n s1+=s[i]\r\n if(n%(i+1)==0):\r\n s1=s1[::-1]\r\n i+=1\r\nprint(s1)", "n = int(input())\r\nword = str(input())\r\nfor i in range(1, n+1):\r\n if n%i==0: word = word[:i][::-1] + word[i:]\r\nprint(word)", "def printDivisors(n) :\r\n\ti = 1\r\n\tglobal x\r\n\twhile i <= n :\r\n\t\tif (n % i==0) :\r\n\t\t\tx.append(i)\r\n\t\ti += 1\r\nn = int(input())\r\na = input()\r\nx = []\r\nprintDivisors(n)\r\nfor i in x:\r\n\ta = a[i-1::-1] + a[i:]\r\n\t\r\nprint(a)\r\n", "n = int(input())\r\ns = input()\r\n\r\nfor i in range(1, n+1):\r\n if n%i == 0:\r\n s = s[:i][::-1]+s[i:]\r\n\r\nprint(s)", "from sys import stdin,stdout\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\ndef rev(l,r):\r\n while l<=r:\r\n s[l],s[r]=s[r],s[l]\r\n l+=1\r\n r-=1\r\n return s\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n # n,k=lst()\r\n s=list(input())\r\n p=1\r\n while p<=n:\r\n if n%p==0:\r\n rev(0,p-1)\r\n # print(p,s)\r\n p+=1\r\n print(''.join(s))", "num=int(input())\r\nstring=input()\r\ntemp=string\r\n\r\nfor i in range(1,num+1):\r\n if num//i==num/i:\r\n firstsub=temp[0:i]\r\n secondsub=temp[i:]\r\n temp=firstsub[::-1]+secondsub \r\nprint(temp)", "# https://codeforces.com/contest/999\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn = int(input())\nt = list(input())\n\nfor d in range(1, n + 1):\n if n % d == 0:\n t = t[:d][::-1] + t[d:]\ns = \"\".join(t)\nprint(s)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n n = int(input())\r\n S = input()\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n S = S[:i][::-1] + S[i:]\r\n print(S)\r\n \r\n \r\nfor _ in range(1):\r\n main()", "n = int(input())\nt = input()\ndivisors = []\nfor i in range(1,n+1):\n if n % i == 0:\n divisors.append(i)\nfor i in divisors:\n t = t[0:i][::-1]+t[i:]\nprint(t)\n", "n = int(input())\ns = list(input())\n\nfor i in range(1,n+1):\n if n % i == 0:\n s[:i] = s[:i][::-1]\nprint(\"\".join(s))\n\n", "n = int(input())\nstring = list(input())\ni = 1\n\nwhile i <= n:\n if (n % i == 0):\n e = 0\n _ = i - 1\n cont = 1\n while cont <= i//2:\n first = string[e]\n last = string[_]\n\n string[e] = last\n string[_] = first\n e += 1\n _ -= 1\n cont += 1\n i += 1\n\nprint(''.join(string))\n \t\t\t\t \t \t\t\t\t \t \t \t\t \t \t\t", "def divisor(n):\r\n ans = []\r\n for i in range(1,(n//2) + 1):\r\n if n%i==0:\r\n ans.append(i)\r\n ans.append(n)\r\n return ans\r\n\r\ndef solve():\r\n n = int(input())\r\n s = input()\r\n ans = divisor(n)\r\n s = list(s)\r\n for i in ans:\r\n for j in range(0,(i//2)):\r\n s[j],s[i-j-1] = s[i-j-1],s[j]\r\n print(\"\".join(s))\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\nsolve()\r\n", "# cook your dish here\r\ndef divisors(n):\r\n arr=[]\r\n for i in range(1,n+1):\r\n if n%i==0:\r\n arr.append(i)\r\n return arr\r\n\r\n \r\nn=int(input())\r\n\r\nip = input()\r\nip_list = list(ip)\r\narr = divisors(n)\r\n\r\nfor i in arr:\r\n temp = ip_list[0:i]\r\n k=i-1\r\n \r\n for l in range(len(ip_list)):\r\n if k!=-1:\r\n ip_list[l]=temp[k]\r\n k=k-1\r\nprint(''.join(ip_list))\r\n \r\n\r\n\r\n\r\n", "n, a = int(input()), input()\r\n\r\ns = []\r\n\r\nfor i in range(1, int(n ** (1 / 2)) + 1):\r\n if (n % i == 0 and i not in s):\r\n s.append(i)\r\n if (n // i not in s):\r\n s.append(n // i)\r\ns = sorted(s)\r\nfor i in s:\r\n a = a[0:i][::-1] + a[i::]\r\nprint(a)\r\n", "n=int(input())\r\nt=input()\r\ntarr=list(t)\r\n\r\nfor i in range(1,n+1):\r\n if(n%i==0):\r\n s=0\r\n e=i-1\r\n while(s<e):\r\n tarr[s],tarr[e]=tarr[e],tarr[s]\r\n s+=1\r\n e-=1\r\nprint(\"\".join(tarr))", "n = int(input())\r\nt = list(input())\r\nd = []\r\ni = 1\r\nwhile i**2 < n:\r\n if n%i == 0:\r\n d.append(i)\r\n d.append(n//i)\r\n i += 1\r\n\r\nif i**2 == n:\r\n d.append(i)\r\nd.sort()\r\n\r\nfor x in d:\r\n t[:x] = list(reversed(t[:x]))\r\n\r\nprint(\"\".join(t))", "number_of_testcases = 1 #int(input())\r\n\r\nfor _ in range(number_of_testcases):\r\n encypted_str_len = int(input())\r\n encrypted_str = input()\r\n stored_divisors = []\r\n \r\n for i in range(encypted_str_len, 1, -1):\r\n if encypted_str_len % i == 0:\r\n stored_divisors.append(i)\r\n \r\n #print(stored_divisors)\r\n while len(stored_divisors) > 0:\r\n reverse_str = stored_divisors.pop()\r\n encrypted_str = encrypted_str[reverse_str-1::-1] + encrypted_str[reverse_str:] \r\n \r\n print(encrypted_str)", "n=int(input())\r\nx=input()\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n x=x[:i][::-1]+x[i:]\r\nprint(x)", "n = int(input())\r\nstr = input()\r\nfor div in range(2,n+1):\r\n if n % div == 0:\r\n str = ''.join(reversed(str[:div])) + str[div:]\r\nprint(str)\r\n", "le = int(input())\r\nline = input()\r\ndels = []\r\nfor i in range(2, le // 2 + 1):\r\n if le % i == 0:\r\n dels.append(i)\r\ndels.append(le)\r\nfor i in dels:\r\n a = ''.join(list(reversed(line[0:i])))\r\n line = a + line[i:]\r\nprint(line)", "n = int(input())\r\nss = input()\r\nls = [x for x in range(1, n+1) if n % x == 0]\r\n# ls.reverse()\r\nres = ss\r\nlater=\"\"\r\nind=1\r\nfor x in ls:\r\n res= \"\".join(list(res[:x])[::-1])+res[x:]\r\n # print(res,x)\r\nprint(res)\r\n", "n = int(input())\r\n\r\ns = str(input())\r\n\r\nlist_s = [x for x in s]\r\nlist_n = []\r\nfor i in range(1, n + 1):\r\n if n % i == 0:\r\n list_n.append(i)\r\n \r\nfor i in list_n:\r\n list_s[:i] = list_s[:i][::-1]\r\nprint(\"\".join(list_s))", "n = int(input())\ns = input()\n\nsList = []\n\nfor i in s:\n sList.append(i)\n\n\n\ndef factors(num):\n factorList = []\n\n for i in range(2, int(n / 2) + 1):\n \n if n % i == 0:\n factorList.append(i)\n\n factorList.append(n)\n\n return factorList\n\n\nfor j in factors(n):\n sList[0:j] = reversed(sList[0:j])\n\n\nfor j in range(n):\n print(sList[j], end = '')\n\nprint()", "# https://codeforces.com/problemset/problem/999/B\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nfor i in range(1, n + 1):\r\n\r\n if n % i == 0:\r\n temp = s[0: i]\r\n s = temp[::-1] + s[i:n]\r\n\r\nprint(s)\r\n", "n = int(input())\r\ns = list(input())\r\nq = [ ]\r\nfor i in range(n, 0, -1):\r\n if n % i == 0:\r\n q += [i]\r\nfor j in q:\r\n w = n // j\r\n s = s[ : w][::-1] + s[w : ]\r\nprint(''. join(s))\r\n", "from math import sqrt\r\n\r\ndef get_all_divisors(n):\r\n\tfirst = []\r\n\tsecond = []\r\n\tfor i in range(1, int(sqrt(n)+1)):\r\n\t\tif n % i == 0:\r\n\t\t\tfirst.append(i)\r\n\t\t\tif i != n // i:\r\n\t\t\t\tsecond.append(n // i)\r\n\treturn first + second[::-1]\r\n\r\n\r\n\r\nlength = int(input())\r\ndivisors = get_all_divisors(length)\r\nstring = list(input())\r\n\r\nfor divisor in divisors:\r\n\tfor i in range(0, divisor // 2):\r\n\t\tstring[i], string[divisor - 1 - i] = string[divisor - 1 - i], string[i]\r\n\r\nprint(*string, sep='')", "# from collections import defaultdict as d\r\ndef solve():\r\n n = int(input())\r\n string = list(input())\r\n for i in range(2, n):\r\n if n % i == 0:\r\n temp = string[:i]\r\n temp.reverse()\r\n string[:i] = temp\r\n string.reverse()\r\n return \"\".join(string)\r\n\r\n\r\n\r\nt = 1\r\nwhile t != 0:\r\n res = solve()\r\n print(res)\r\n t -= 1\r\n", "def divisor(N):\r\n n = 1\r\n div = []\r\n while n ** 2 <= N:\r\n if N % n == 0:\r\n div.append(n)\r\n div.append(N // n)\r\n n += 1\r\n return sorted(list(set(div)))\r\n\r\nn = int(input())\r\nt = list(str(input()))\r\n\r\nli = divisor(n)\r\nfor el in li:\r\n\tt[:el] = t[:el][::-1]\r\n\r\nprint(''.join(t))", "n = int(input())\ns = input()\n\nfor d in [x for x in range(1, n + 1) if n % x == 0]:\n s = s[:d][::-1] + s[d:]\n\nprint(s)\n", "n=int(input());a=input()\nfor x in range(2,n+1):\n if n%x<1:\n a=a[x-1::-1]+a[x:]\nprint(a)\n\t \t\t\t\t \t \t \t \t\t\t \t \t", "#999 (29No. Problem B)\r\nn = int(input())\r\nt = input()\r\ndiv = []\r\nm = ''\r\nfor i in range(1,n+1):\r\n if (n % i == 0):\r\n div.append(i) \r\n# print(div) \r\nfor i in div: \r\n m = t[0:i]\r\n # print(m) \r\n t = m[::-1] + t[i:]\r\nprint(t) ", "n=int(input())\r\ns=input()\r\ns1=list(s)\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n for j in range(0,int(i/2)):\r\n d=s1[j]\r\n s1[j]=s1[i-j-1]\r\n s1[i-j-1]=d\r\n \r\nprint(\"\".join(s1))", "#Amir_Python\r\nn=int(input())\r\ns=input()\r\nd=[]\r\nfor x in range(2,n+1):\r\n if n//x==n/x:\r\n d.append(x)\r\ny=0\r\nwhile y!=len(d):\r\n s=s[d[y]-1::-1]+s[d[y]::]\r\n y=y+1\r\nprint(s)", "def divisors(n):\r\n ls = []\r\n for x in range(1, n+1):\r\n if n % x == 0:\r\n ls.append(x)\r\n return ls\r\n \r\nn = int(input())\r\ns = input()\r\ndivs = divisors(n)\r\nfor x in divs:\r\n s = s[x-1::-1]+s[x:]\r\nprint(s)", "n = int(input())\r\na = input()\r\nfor i in range(n):\r\n if n % (i + 1) == 0:\r\n sp = a[:i+1]\r\n sp = sp[::-1]\r\n a = sp + a[i + 1:]\r\nprint(a)", "n=int(input())\r\ns=str(input())\r\nfor e in range(2,n+1):\r\n if n%e==0:\r\n s=s[0:e][::-1]+s[e:]\r\nprint(s) ", "def divisors(n):\r\n divs = []\r\n i = 1\r\n while n >= i ** 2:\r\n if n % i == 0:\r\n divs.append(i)\r\n if i ** 2 != n:\r\n divs.append(n // i)\r\n i = i + 1\r\n divs.sort()\r\n return divs\r\n\r\n\r\nnum = int(input())\r\ns = input()\r\ndivs = divisors(num)\r\nfor i in divs:\r\n s = s[:i][::-1] + s[i:]\r\n\r\nprint(s)\r\n# print(divs)\r\n\r\n", "def rev_Sub_String(st, x):\r\n tmp = st[0:x]\r\n return \"\".join(reversed(tmp))\r\n\r\n\r\nn = int(input())\r\nmain_string = input()\r\ni = 1\r\nfor _ in range(n):\r\n if n % i == 0:\r\n ans = rev_Sub_String(main_string, i) + main_string[i:]\r\n main_string = ans\r\n i += 1\r\n else:\r\n i += 1\r\nprint(ans)", "n = int(input())\r\nstring = input()\r\nstring = list(string)\r\ndivisors = list()\r\nfor i in range(2, n+1):\r\n if n % i == 0:\r\n divisors.append(i)\r\n\r\nfor x in divisors:\r\n string[0: x] = string[0:x][::-1]\r\n\r\nfor s in string:\r\n print(s, end = '')\r\nprint()\r\n", "n = int(input())\r\ns = list(input())\r\n\r\n\r\n\r\nfor i in range(2 , n):\r\n if n%i==0:\r\n s[:i] = s[:i][::-1]\r\n # print(''.join(s))\r\n\r\nprint(''.join(reversed(s)))\r\n", "def encryption(arr, n):\n\tfor x in range(1, n):\n\t\tif n%x == 0:\n\t\t\tarr =arr[0:x][::-1]+arr[x:]\n\treturn arr[::-1]\n\n\nn = int(input())\narr = input()\nprint(encryption(arr, n))", "n=int(input())\r\ns=input()\r\nlst=[]\r\nfor i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n lst.append(i)\r\n lst.append(n//i)\r\nlst=list(set(lst))\r\nlst.sort()\r\nlst.append(n)\r\nfor i in lst:\r\n s=s[:i][::-1]+s[i:]\r\nprint(s)", "def Answer(s):\r\n n = len(s)\r\n a = list(s)\r\n for i in range(1,n + 1):\r\n if n % i == 0:\r\n a[:i] = a[:i][::-1]\r\n return ''.join(a)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n print(Answer(s))", "n = int(input())\r\nt = input()\r\n\r\nd = []\r\nfor i in range(n, 1, -1):\r\n if n % i == 0:\r\n d.append(i)\r\ns = t\r\nd = d[::-1]\r\nfor i in range(0, len(d)):\r\n s1 = s[0:d[i]]\r\n s1 = s1[::-1]\r\n s2 = s[d[i]::]\r\n s = s1 + s2\r\nprint(s)\r\n", "def rev_Sub_String(st, x):\r\n tmp = st[0:x]\r\n return \"\".join(reversed(tmp))\r\n\r\n\r\nn = int(input())\r\nmain_string = input()\r\n\r\nfor i in range(1, n+1):\r\n if n % i == 0:\r\n ans = rev_Sub_String(main_string, i) + main_string[i:]\r\n main_string = ans\r\nprint(ans)", "n=int(input())\r\nch=input()\r\nd=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n d.append(i)\r\n#d.reverse()\r\n#print(d)\r\nfor ele in d:\r\n #print(ch)\r\n ch=ch[:ele][::-1]+ch[ele:]\r\nprint(ch)", "n = int(input())\r\na = input()\r\nfor i in range(n):\r\n if n % (i+1) == 0:\r\n tmp = a[:i+1]\r\n tmp = tmp[::-1]\r\n \r\n a = tmp + a[i + 1:]\r\n \r\nprint(a)", "n = int(input())\nchaine = input()\n\n\ndef divisors(nb, extremum=False):\n divisors = []\n inf = 1 if extremum else 2\n for i in range(inf, int(nb ** 0.5) + 1):\n q, r = divmod(nb, i)\n if r == 0:\n if q >= i:\n divisors.append(i)\n if q > i:\n divisors.append(nb // i)\n return divisors\n\n\ndivi = sorted(divisors(n, True))\n\nfor u in divi:\n chaine=chaine[:u][::-1]+chaine[u:]\n \n \nprint(chaine)\n", "import sys\r\n# sys.stdin = open(\"Round 4 - 490/input.txt\", \"r\")\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nfor d in range(1, n+1):\r\n if n % d == 0:\r\n s = s[:d][::-1]+s[d:]\r\n\r\nprint(s)", "n = int(input())\r\nx = input()\r\nfor i in range(1,n+1):\r\n if n%i == 0:\r\n x = x[0:i][::-1]+x[i:]\r\nprint(x)", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport sys\r\n\r\nn = int(input())\r\ns = list(input().strip())\r\n\r\ndef reverse(A, i, j):\r\n while i < j:\r\n A[i], A[j] = A[j], A[i]\r\n i, j = i + 1, j - 1\r\n\r\nfor i in range(1, n + 1):\r\n if n % i == 0:\r\n reverse(s, 0, i - 1)\r\n \r\nprint(''.join(s))\r\n", "import re\r\ndef get_divisors(number):\r\n divisors = []\r\n for i in range(1, number+1):\r\n if n % i == 0:\r\n divisors.append(i)\r\n return divisors\r\n\r\ndef reverse_list(l, k):\r\n return l[k-1::-1] + l[k:]\r\n\r\nn = int(input())\r\nt = input()\r\ndiv = get_divisors(n)\r\n\r\nfor i in range(0, len(div)):\r\n t = reverse_list(t, div[i])\r\n\r\nprint(t)\r\n", "def solve():\r\n size = int(input())\r\n s = input()\r\n \r\n for i in range(1, size + 1):\r\n if not (size % i):\r\n s = s[0:i][::-1] + s[i:]\r\n \r\n print(s)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n=int(input())\r\na=list(input())\r\nd=[]\r\nfor i in range(1,n//2+1,1):\r\n if n%i==0:\r\n d.append(i)\r\nd.append(n)\r\nfor j in d:\r\n c=a[:j]\r\n c.reverse()\r\n a[:j]=c\r\nprint(*a,sep='')", "n=int(input())\na=input()\nfor i in range(2,n//2+1):\n if n%i==0:\n a=a[0:(i)][::-1]+a[i:]\nprint(a[::-1])", "n = int(input())\r\ns = input()\r\ns = list(s)\r\nl = []\r\nfor i in range(2, n + 1):\r\n if n % i == 0:\r\n l.append(i)\r\nfor m in range(len(l)):\r\n if l[m] % 2 == 0:\r\n li = l[m] // 2\r\n else:\r\n li = (l[m] + 1) // 2\r\n for t in range(li):\r\n k = ((l[m] - 1) - t)\r\n temp = s[t]\r\n s[t] = s[k]\r\n s[k] = temp\r\nsi = \"\".join(s)\r\nprint(si)\r\n", "n = int(input())\r\ns = input()\r\ns1 = \"\"\r\nfor i in range(1, n+1):\r\n if n % i == 0:\r\n new = s[0:i]\r\n new = new[::-1]\r\n s = new + s[i:]\r\n\r\nprint(s)", "n = int(input())\r\ns = str(input())\r\n\r\n# for i in range(n, 0, -1):\r\n# if n % i == 0:\r\n# fp = s[0:i][::-1]\r\n# sp = s[i:]\r\n# s = fp + sp\r\n# #s = s[0:i][::-1] + s[i:-1]\r\n# print(s)\r\n\r\nfor i in range(1, n+1):\r\n if n % i == 0:\r\n fp = s[0:i][::-1]\r\n sp = s[i:]\r\n s = fp + sp\r\n #s = s[0:i][::-1] + s[i:-1]\r\nprint(s)", "n = int(input())\r\nastring = input()\r\nfor i in range(1, n+1):\r\n if n%i == 0:\r\n astring = astring[:i][::-1] + astring[i:]\r\nprint(astring) ", "n=int(input())\r\nst=input()\r\nlst=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n at=st[:i]\r\n bt=st[i:]\r\n at=at[::-1]\r\n st=at+bt\r\n \r\nprint(st)", "n = int(input())\ns = input()\nfor i in range(2, n+1):\n if n % i == 0:\n s_revertir = s[:i]\n s_sobrante = s[i:]\n s = s_revertir[::-1] + s_sobrante\nprint(s)\n\t \t \t\t \t\t \t \t\t \t\t\t\t\t\t\t\t", "n = int(input())\r\ns = input()\r\n\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n s = s[:i][::-1]+s[i:]\r\n\r\nprint(s)", "n = int(input())\r\n\r\ns = input().rstrip()\r\n\r\nfactors = []\r\nfor i in range(1, n+1):\r\n if n % i == 0:\r\n factors.append(i)\r\n\r\nfactorsdec = factors[::-1]\r\n\r\nfor i in factors:\r\n newstr = s[:i][::-1] + s[i:]\r\n s = newstr\r\n\r\nprint(s)\r\n\r\n", "from math import ceil, sqrt\r\nlen_of_code = int(input())\r\ncode = input()\r\nfirst_deviders = [x for x in range(1, ceil(sqrt(len_of_code)) + 1) if len_of_code%x == 0]\r\nsecond_diveders = [int(len_of_code/x) for x in reversed(first_deviders) if int(len_of_code/x) not in first_deviders]\r\nall_diveders = sorted(first_deviders + second_diveders)\r\ni = 1\r\nwhile i < len(all_diveders) - 1:\r\n\tswap_part = code[:all_diveders[i]]\r\n\tcode = swap_part[::-1] + code[all_diveders[i]:]\r\n\ti += 1\r\ncode = code[::-1]\r\nprint(code)", "'''\r\n\t* Author :- Tanay Kulkarni\r\n\t* Date :- 20-7-2021\r\n\t* Time :- 20:15:56.038656\r\n\t* Name :- solve.py\r\n'''\r\nimport sys\r\ndef debug(*a):\r\n\tprint(a,file = sys.stderr,flush = True)\r\ndef read(typ = str):\r\n\treturn typ(input())\r\ndef read_arr(typ = int):\r\n\treturn list(map(typ,input().split()))\r\n\r\ndef solve():\r\n\tn = read(int)\r\n\ts = list(read())\r\n\tfor i in range(1,n+1):\r\n\t\tif n % i ==0:\r\n\t\t\ttmp = s[:i]\r\n\t\t\ttmp.reverse()\r\n\t\t\ts[:i] = tmp\r\n\tprint(''.join(s))\r\nt = 1\r\nfor i in range(1,t+1):\r\n\t\t#print(\"Case #{}:\".format(i),end=' ')\r\n\t\tsolve()\r\n\r\n", "n = int(input())\r\nt = input()\r\na = list(t)\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n u = a[:i]\r\n a = u[::-1]+a[i:]\r\nprint(\"\".join(a))", "from math import sqrt\r\nn=int(input())\r\na=input()\r\nd=[]\r\nfor i in range(1,int(sqrt(n))+1):\r\n if n%i==0:\r\n d.append(i)\r\n if i!=n//i:\r\n d.append(n//i)\r\nd.sort()\r\nfor i in d:\r\n b=''\r\n c=''\r\n for j in range(n):\r\n if j<i:\r\n b+=a[j]\r\n else:\r\n c+=a[j]\r\n a=b[::-1]+c\r\nprint(a)", "# https://codeforces.com/contest/999/problem/B\n\ndef decode_string(s, n):\n for i in range(n-1, 0, -1):\n if n % i == 0:\n s = s[:n//i][::-1] + s[n//i:]\n\n return s\n\n\ndef main():\n n = int(input())\n s = input()\n print(decode_string(s, n))\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\ns = list(input())\r\na = []\r\nfor d in range(1,n+1):\r\n\tif n%d == 0:\r\n\t\tp = s[0:d]\r\n\t\ta.append(p[::-1])\r\n\t\ts[0:d] = p[::-1]\r\n\r\nprint(\"\".join(s))\t\t", "def divisors(x):\r\n div = []\r\n for j in range(2, x + 1):\r\n if x % j == 0:\r\n div.append(j)\r\n return div\r\n\r\n\r\nn, s = int(input()), input()\r\na = []\r\nif n > 1:\r\n a = divisors(n)\r\nelse:\r\n exit(print(s))\r\nfor i in range(len(a)):\r\n s = s[0:a[i]][::-1] + s[a[i]:]\r\nprint(s)", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nimplement\r\n'''\r\ndef solve():\r\n n = II()\r\n s = [c for c in I().strip()]\r\n\r\n divisors = set()\r\n for i in range(1, n+1):\r\n if i*i > n:\r\n break\r\n if n%i == 0:\r\n divisors.add(i)\r\n divisors.add(n//i)\r\n divisors = sorted(divisors)\r\n # print(divisors)\r\n\r\n for d in divisors:\r\n s[:d] = s[:d][::-1]\r\n # print(s)\r\n \r\n WNS(s)\r\n\r\n\r\nsolve()", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip().split('\\n')[1]\r\n d = [i for i in range(2, len(s)//2 + 1) if not len(s)%i] + [len(s)]\r\n for i in d:\r\n s = s[:i][::-1] + s[i:]\r\n return s\r\nprint(main(), sep='\\n')\r\n", "n = int(input())\r\ns = input()\r\nfor i in range(2, n + 1):\r\n if n % i == 0: s = s[i - 1::-1] + s[i:]\r\nprint(s)\r\n", "n = int(input())\ns = input()\nfor i in range(1, n + 1):\n if not n % i:\n s = s[i - 1::-1] + s[i:]\nprint(s)", "\r\nfrom sys import stdin, stdout\r\n#from math import pow\r\n#import numpy as np\r\nfrom collections import Counter\r\n\r\n\r\n# int(stdin.readline()) stdout.write(str())\r\n# stdin.readline()\r\n# map(int, stdin.readline().split())\r\n# list(map(int, stdin.readline().split()))\r\n\r\na = int(stdin.readline())\r\nb = stdin.readline()\r\nfor i in range(1,a+1):\r\n if a%i==0:\r\n b = (b[:i])[::-1] + b[i:]\r\nprint(b)", "n = int(input())\r\ns = input()\r\nfor i in range(2, n + 1):\r\n if n % i == 0:\r\n tmp = s[0:i]\r\n tmp = tmp[::-1]\r\n s = tmp + s[i:]\r\nprint(s)", "n=int(input())\r\ns=input()\r\nfor i in range(1, n+1):\r\n if n%i==0:s=s[:i][::-1]+s[i:]\r\nprint(s)\r\n", "n=int(input())\r\ns=input()\r\nd=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n d.append(i)\r\nfor i in range(len(d)):\r\n j=d[i]\r\n x=s[:j]\r\n x=x[::-1]\r\n s=x+s[j:]\r\nprint(s)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nimport random\r\nfrom bisect import bisect_right, bisect_left\r\nfrom itertools import product, permutations, combinations, combinations_with_replacement \r\nfrom collections import deque, defaultdict, Counter\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache, reduce\r\ninf = float('inf')\r\ndef error(*args, sep=' ', end='\\n'):\r\n print(*args, sep=sep, end=end, file=sys.stderr)\r\n# mod = 1000000007\r\n# mod = 998244353\r\n\r\n# ----------------------- #\r\n\r\nn = int(input())\r\ns = list(input())\r\n\r\nfor i in range(1, n+1):\r\n if n % i == 0:\r\n s[:i] = s[:i][::-1]\r\nprint(''.join(map(str, s)))\r\n", "n = int(input())\r\ns = input().strip()\r\nfor i in range(1, n + 1):\r\n if not n % i:\r\n s = s[:i][::-1] + s[i:]\r\nprint(s)\r\n", "n=int(input())\r\ns=input()\r\n\r\nfor d in range(1,n+1):\r\n if n%d==0:\r\n s=s[:d][::-1]+s[d:]\r\n\r\nprint(s)", "def divisors(n): \n res = []\n for i in range(1, n+1): \n if n % i == 0: \n res.append(i)\n return res\ndef revsubstring(s, l, r): \n s = list(s)\n while r > l: \n temp = s[l]\n s[l] = s[r]\n s[r] = temp\n l += 1\n r -= 1\n return ''.join(s)\n\nn = int(input())\n\ns = input()\n\ndivisorList = divisors(n)\n\nfor num in divisorList: \n s = revsubstring(s, 0, num-1)\n\nprint(s)\n", "import sys\r\nimport math\r\n\r\n\r\ndef scan(input_type='int'):\r\n if input_type == 'int':\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n else:\r\n return list(map(str, sys.stdin.readline().strip()))\r\n\r\n\r\ndef devisiors(n):\r\n a = []\r\n for i in range(2, n//2+1):\r\n if n % i == 0:\r\n a.append(i)\r\n a.append(n)\r\n # print(a)\r\n return a\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n s = scan('str')\r\n a = devisiors(n)\r\n # a.reverse()\r\n # print(a, 1)\r\n for i in a:\r\n # print(s[i-1::-1],i)\r\n s = s[i-1::-1] + s[i:]\r\n print(''.join(s))\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n", "n=int(input())\r\nword=input()\r\nfor x in range(2,n+1):\r\n if n%x==0:\r\n word=\"\".join(reversed(word[:x]))+word[x:]\r\nprint(word)", "n=int(input())\nstring=input()\nfor i in range(2,n+1):\n if(n%i==0):\n string=string[:i][::-1]+string[i:]\nprint(string)\n\t \t \t \t\t\t \t\t \t\t \t \t\t \t\t\t", "n=int(input())\r\ns=input()\r\ndiv=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n div.append(i)\r\n\r\nfor i in range(len(div)):\r\n s=s[:div[i]][::-1]+s[div[i]:]\r\nprint(s)\r\n", "import sys\r\nimport math\r\nimport random\r\ndef II():\r\n\treturn int(sys.stdin.readline())\r\n \r\ndef LI():\r\n\treturn list(map(int, sys.stdin.readline().split()))\r\n \r\ndef MI():\r\n\treturn map(int, sys.stdin.readline().split())\r\n \r\ndef SI():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef FACT(n, mod):\r\n s = 1\r\n facts = [1]\r\n for i in range(1,n+1):\r\n s*=i\r\n s%=mod\r\n facts.append(s)\r\n return facts[n]\r\n\r\ndef C(n, k, mod):\r\n return (FACT(n,mod) * pow((FACT(k,mod)*FACT(n-k,mod))%mod,mod-2, mod))%mod\r\n\r\nn = II()\r\ns = list(SI())\r\nfor i in range(1,n+1):\r\n if n%i == 0:\r\n s[:i] = s[:i][::-1]\r\nprint(\"\".join(s))", "n = int(input())\r\ns = input()\r\nfor i in range(len(s)):\r\n if n % (i + 1) == 0:\r\n ls = list(s[0:i+1])\r\n s1 = ''.join(ls[::-1])\r\n s = s1 + s[i+1::]\r\nprint(s)", "n = int(input())\r\ns = input()\r\nfor k in range(1, n+1):\r\n if n % k == 0:\r\n s = s[k-1::-1] + s[k:]\r\nprint(s)", "n = int(input())\r\ns = input()\r\nfor i in range(n//2, 0,-1):\r\n if n % i == 0:\r\n s = s[:n//i][::-1] + s[n//i:]\r\nprint(s)", "from math import sqrt\r\n\r\nn = int(input())\r\ns = list(input())\r\nd = []\r\nu = []\r\nr = int(sqrt(n)) + 1\r\nfor i in range(2, r):\r\n if n % i == 0:\r\n d.append(i)\r\n q = n // i\r\n if q != i:\r\n u.append(q)\r\nfor idx in d:\r\n bi = idx - 1\r\n for i in range(idx >> 1):\r\n ri = bi - i\r\n s[i], s[ri] = s[ri], s[i]\r\nfor idx in reversed(u):\r\n bi = idx - 1\r\n for i in range(idx >> 1):\r\n ri = bi - i\r\n s[i], s[ri] = s[ri], s[i]\r\n\r\nprint(''.join(reversed(s)))", "n= int(input())\r\ns= input()\r\ni= 2\r\n\r\nwhile i <= n:\r\n if n%i == 0:\r\n p= s[:i]\r\n s= p[::-1]+ s[i:]\r\n i += 1\r\n\r\nprint(s)", "n = int(input())\r\nline = input()\r\nfor i in range(1, n + 1):\r\n if n % i == 0:\r\n line = line[0:i][::-1] + line[i::]\r\nprint(line)\r\n", "size = int(input())\r\nstringT = input()\r\n\r\nfor i in range(len(stringT)-1,-1,-1):\r\n if(size%(i+1) == 0):\r\n d = int(size/(i+1))\r\n stringT = stringT[:d][::-1]+stringT[d:size]\r\nprint(stringT)\r\n", "\r\n\r\ndef mirror(l, i):\r\n def recursive_solution(l, start, end):\r\n if start >= end:\r\n return l\r\n l[start], l[end] = l[end], l[start]\r\n return recursive_solution(l, start + 1, end - 1)\r\n return recursive_solution(l, 0, i)\r\n\r\n\r\ndef main_function():\r\n input()\r\n l = list(input())\r\n collector = []\r\n for i in range(1, len(l) + 1):\r\n if not len(l) % i:\r\n l = mirror(l, i - 1)\r\n return \"\".join(l)\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\ns = input()\r\na = []\r\nfor i in range(1, n + 1):\r\n if n % i == 0:\r\n a.append(i)\r\nfor i in range(len(a)):\r\n if a[i] != n:\r\n st = s[0:a[i]]\r\n st = st[::-1]\r\n st += s[a[i]:]\r\n else:\r\n st = s[0:a[i]]\r\n st = s[::-1]\r\n s = st\r\nprint(s)\r\n", "import math\r\nn= int(input())\r\nval=list(input())\r\ndef reverse(arr,end):\r\n for i in range(math.floor(end/2)):\r\n\r\n arr[i],arr[end-i-1]=arr[end-1-i],arr[i]\r\n\r\nfor i in range(1,n//2 +1):\r\n if n % i ==0:\r\n\r\n reverse(val,i)\r\n\r\nval=val[::-1]\r\nprint(*val,sep='')", "n = int(input())\r\ns = input()\r\n\r\nfor d in range(1, n+1):\r\n if not n % d:\r\n s = s[d-1::-1] + s[d:]\r\n\r\nprint(s)\r\n", "\r\n\r\nn = int(input())\r\nstr = list(input())\r\n\r\ni = 1\r\nwhile (i <= n):\r\n if (n%i == 0):\r\n str = list(reversed(str[:i:])) + str[i::]\r\n i += 1\r\nprint(''.join(str))", "n=int(input())\r\na=list(input())\r\nfor i in range(1,n):\r\n \r\n if n%(i+1)==0:\r\n l=0\r\n r=i\r\n while l<r:\r\n a[l],a[r]=a[r],a[l]\r\n l+=1\r\n r-=1\r\nprint(\"\".join(a))", "import math\r\nn = int(input())\r\ns = list(input())\r\n\r\ndiv = []\r\nfor i in range(1, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n div.append(int(i))\r\n if n / i != i:\r\n div.append(int(n / i))\r\ndiv.sort()\r\nfor j in div:\r\n # print(j)\r\n temp = s[0: j]\r\n temp = temp[::-1]\r\n s[0: j] = temp[0: j]\r\nprint(\"\".join(s))\r\n", "n=int(input())\r\na=input()\r\nfor i in range(1,n+1):\r\n\tif n%i==0:\r\n\t\ta=a[:i][::-1]+a[i:]\r\nprint(a)", "n=int(input())\r\ns=list(str(input()))\r\nfor i in range(n):\r\n if n%(i+1)==0:\r\n s=list(''.join(reversed(''.join(s[:i+1]))))+s[i+1:]\r\nprint(''.join(s))", "# c4ts0up\nn = int(input())\ncad = input()\n\ndivs = []\nfor i in range(1, n+1, 1):\n if (n%i == 0):\n divs.append(i)\n\nfor d in divs:\n rev = cad[:d]\n rev = rev[::-1]\n normal = cad[d:]\n cad = rev + normal\n\nprint(cad)\n\t \t\t \t \t \t \t \t\t \t\t \t \t", "n=int(input())\r\ns=input()\r\nfor i in range(2, n+1):\r\n if n%i==0:\r\n z=str()\r\n for j in range(i-1, -1, -1):\r\n z=z+s[j]\r\n for j in range(i, n):\r\n z=z+s[j]\r\n s=z\r\nprint(s)", "n=int(input())\r\ns=input()\r\nd=[]\r\nfor i in range(n):\r\n i+=1\r\n if (n/i)%1==0:\r\n d.append(i)\r\nfor t in d:\r\n r=list(s[:t])\r\n r.reverse()\r\n s=''.join(r)+s[t:]\r\nprint(s)\r\n", "def newstring(s, d):\r\n start = 0\r\n end = d-1\r\n s = list(s) # string is abc, I converted this to ['a','b','c'], so accessing easier.\r\n while start <= end:\r\n s[start],s[end] = s[end],s[start]\r\n start += 1\r\n end -= 1\r\n return (\"\".join(s)) # joining the newly modified list\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n s = input()\r\n if n in [1,2]:\r\n print(s[::-1])\r\n else:\r\n # find divisors of n backwards\r\n for d in range(1,n+1):\r\n if n%d == 0:\r\n s = newstring(s, d)\r\n print(s) ", "n=int(input())\r\ns=input()\r\nfor i in range(1,n+1):\r\n if(n%i==0):\r\n a=\"\"\r\n a=s[0:i]\r\n s=a[::-1]+s[i:len(s)]\r\nprint(s)\r\n", "# Wadea #\r\n\r\nn = int(input())\r\narr = list(input())\r\narr1 = []\r\nfor i in range(n):\r\n if n % (i+1) == 0:\r\n arr1 = arr[:i+1]\r\n arr1.reverse()\r\n arr = arr[i+1:]\r\n arr = arr1+arr\r\nprint(\"\".join(arr))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef get_divisors(n):\r\n i = 1\r\n divisors = []\r\n\r\n while i * i <= n:\r\n if n % i == 0:\r\n divisors.append(i)\r\n if i != n // i:\r\n divisors.append(n // i)\r\n i += 1\r\n\r\n divisors.sort()\r\n return divisors\r\n\r\n\r\nn = int(input())\r\ndata = list(input().rstrip())\r\ndivs = get_divisors(n)\r\n\r\nfor i in divs:\r\n data[0:i] = reversed(data[0:i])\r\n\r\nprint(''.join(data))", "def delit(n):\r\n res = []\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n res.append(i)\r\n return res\r\n\r\n\r\nn = int(input())\r\ns = input()\r\ndelits = delit(n)\r\nfor d in delits:\r\n s = str(s[:d])[::-1] + s[d:]\r\nprint(s)", "n = int(input())#tamanho da string\r\nt = input()#string a ser ordenada\r\n\r\nfor i in range(1,n+1):\r\n if n%i == 0:\r\n t=t[i-1::-1]+t[i:]#t[0] = primeira posicao\r\nprint(t)\r\n", "from math import *\r\nn=int(input())\r\ns=input()\r\nl=[]\r\nfor i in range(1,int(sqrt(n))+1):\r\n if n%i==0:\r\n l.append(i);\r\n if i*i!=n:\r\n l.append(n//i);\r\nl.sort();\r\n# print(*l)\r\nfor i in l:\r\n # i-=1;\r\n # print(s)\r\n s=''.join(list(reversed(s[:i])))+s[i:]\r\n # print(s)\r\nprint(s)", "n = int(input())\nv = list(input())\na = []\nfor i in range(2, n // 2 + 1):\n if n % i == 0:\n a.append(i)\na.append(n)\nfor i in a:\n v[:i] = v[:i][::-1]\nprint(*v, sep='')\n", "#----------------start of template ----------------------\r\nimport sys\r\nfrom bisect import bisect_left, bisect_right\r\nfrom heapq import heapify,heappush,heappop\r\nfrom collections import deque\r\nfrom math import gcd,sqrt,log10,log2,floor,ceil,sqrt\r\nfrom collections import deque,defaultdict\r\ninput=sys.stdin.readline\r\n# sys.setrecursionlimit(10**6)\r\ndef il():\r\n return [int(a) for a in input().strip().split()]\r\ndef ip():\r\n return input().strip()\r\ndef ii():\r\n return int(input())\r\nmod=1000000000+7\r\ndx=[-1,-2,1,2,2,-2,-1,1]\r\ndy=[2,1,2,1,-1,-1,-2,-2] #knight\r\n#-----------------end of template -----------------------\r\nn=ii()\r\nst=input()\r\ni=0\r\nj=n-1\r\nres1=\"\"\r\nres2=\"\"\r\ndiv=[]\r\nz=n-1\r\nfor i in range(n,0,-1):\r\n if n%i==0:\r\n div.append(i)\r\n# print(div)\r\nf=True\r\np=1\r\nwhile(z>0):\r\n for i in range(div[p-1]-div[p]):\r\n if f:\r\n res1+=st[z]\r\n else:\r\n res2+=st[z]\r\n z-=1\r\n p+=1\r\n f=not f\r\nprint(res1+st[z]+res2[::-1])\r\n\r\n", "a = int(input())\r\nb = input()\r\nfor i in range(1 , a+1):\r\n if a % i == 0:\r\n b = (b[0 : i])[::-1] + b[i:]\r\nprint(b)\r\n", "import math\r\nn=int(input())\r\ns=input()\r\nd=[]\r\nfor i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n d.append(i)\r\n if n//i!=i:\r\n d.append(n//i)\r\n\r\nd.sort()\r\nfor e in d:\r\n u=s[:e]\r\n u=u[::-1]\r\n s=u+s[e:]\r\nprint(s)\r\n \r\n", "import math\r\nn = int(input())\r\ns = input()\r\nlist1 =[]\r\nfor i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n list1+=[i,n//i]\r\n\r\nlist1 = list(set(list1))\r\nlist1.sort()\r\n\r\nfor i in list1:\r\n \r\n s = s[:i][::-1]+s[i:]\r\n \r\n\r\nprint(s)\r\n", "def funct (x,a):\r\n if (a != 1):\r\n srt = ''\r\n for i in range(a-1,-1,-1):\r\n srt += x[i]\r\n return srt + x[a:len(x)]\r\n else:\r\n return x\r\n\r\nN = int(input())\r\nif(1<=N and N<=100):\r\n str_x = input()\r\n arr = []\r\n for i in range(1,N+1):\r\n if (N % i ==0):\r\n arr.append(i)\r\n for i in arr:\r\n str_x = funct(str_x,i)\r\n print(str_x)\r\n", "n = int(input())\r\nt = input()\r\nfor i in range (2, n+1):\r\n if n%i == 0:\r\n t = t[i-1::-1] + t[i:n]\r\nprint (t)\r\n", "n = int(input())\nt = input()\nfor i in range(1, n+1):\n if n % i == 0:\n t = t[:i][::-1]+t[i:]\n\nprint(t)", "n, s = int(input()), list(input())\nd = [i for i in range(1, n + 1) if n % i == 0]\nfor i, e in enumerate(d):\n s[:e] = reversed(s[:e])\nres = \"\".join(s)\nprint(res)\n" ]