Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "n = int(input())\r\nlist_ = list(map(int,input().split()))\r\nnof_2 = list_.count(2)\r\nnof_1 = list_.count(1)\r\nsum = 0\r\n#print(nof_1,nof_2)\r\nif nof_2<=nof_1:\r\n sum+=nof_2\r\n nof_1-=nof_2\r\n sum+=(nof_1//3)\r\nelse:\r\n sum+=nof_1\r\n\r\nprint(sum)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nfor i in a:\r\n if(i==1):\r\n c1+=1\r\n if(i==2):\r\n c2+=1\r\nr=c1\r\nif(c1>c2):\r\n r=c2+int((c1-c2)/3)\r\nprint(r)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nk = l.count(1)\r\nh = l.count(2)\r\nif k>h:\r\n\tprint(h+(k-h)//3)\r\nelse:\r\n\tprint(k)", "n=int(input())\r\na=[*map(int,input().split())]\r\nprint(max((a.count(1)-min(a.count(2),a.count(1)))//3+min(a.count(2),a.count(1)),min(a.count(2),a.count(1)),a.count(1)//3,0))\r\n", "n = int(input())\r\na = [int(z) for z in input().split()]\r\ncnt1 = 0\r\ncnt2 = 0\r\nans = 0\r\nfor i in range(n):\r\n if a[i] == 1:\r\n cnt1 += 1\r\n else:\r\n cnt2 += 1\r\nif cnt1 > cnt2:\r\n ans += cnt2\r\n ans += (cnt1 - cnt2) // 3\r\nelse:\r\n ans += cnt1\r\nprint(ans)", "n = int(input())\r\na = map(int, input().split())\r\nx, y = 0, 0\r\nfor t in a:\r\n if (t == 1): x = x+1\r\n else: y = y+1\r\nz = min(x, y)\r\nans = z + (x - z) // 3\r\nprint (ans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n_1 = a.count(1)\r\n_2 = a.count(2)\r\n\r\nd = min(_2, _1)\r\n_1 -= d\r\nprint(d+_1//3)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0\r\n\r\no, t = l.count(1), l.count(2)\r\n\r\nif o == 0:\r\n print(ans)\r\nelif t == 0:\r\n print(o//3)\r\nelse: \r\n ans = min(o, t)\r\n o -= ans\r\n print(ans + o //3)", "n = int(input())\r\na = list(map(int, input().split()))\r\nc1 = c2 = 0\r\nfor i in a:\r\n\tif i == 1:\r\n\t\tc1 += 1\r\n\telse:\r\n\t\tc2 += 1\r\nif c1 < c2:\r\n\tprint(c1)\r\nelse:\r\n\tprint(c2+(c1-c2)//3)", "n=int(input())\r\nb=list(map(int,input().split()))\r\nprint(min(b.count(1),b.count(2))+(b.count(1)-min(b.count(1),b.count(2)))//3)\r\n", "n = int(input())\r\n\r\nnumbers = input().split()\r\n\r\ntwos = []\r\nones = []\r\n\r\nfor i in range(n):\r\n if(numbers[i] == '2'):\r\n twos.append(numbers[i])\r\n else:\r\n ones.append(numbers[i])\r\n\r\ncount = 0\r\n\r\nwhile(len(twos) != 0):\r\n if(len(ones) != 0):\r\n ones.pop()\r\n twos.pop()\r\n count += 1\r\n else:\r\n break\r\n\r\nif(len(ones) // 3 != 0):\r\n count += len(ones) // 3\r\n\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nones=l.count(1)\r\ntwos=l.count(2)\r\nif ones==0:\r\n print(0)\r\nelse:\r\n res=0\r\n if ones>=twos:\r\n res=twos\r\n ones-=twos\r\n res+=(ones//3)\r\n else:\r\n res+=ones\r\n print(res)\r\n \r\n ", "n = int(input())\r\nlis = list(map(int, input().split()))\r\nstackone = []\r\nstacktwo = []\r\nfor i in lis:\r\n if i == 1:\r\n stackone.append(i)\r\n else:\r\n stacktwo.append(i)\r\n\r\nif len(stackone) > len(stacktwo):\r\n print((len(stackone) - len(stacktwo)) // 3 + len(stacktwo))\r\nelse:\r\n print(len(stackone))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(n):\r\n if a[i] == 1:\r\n c1 += 1\r\n else:\r\n c2 += 1\r\nif c1 > c2:\r\n res = c2\r\n c = c1 - c2\r\n res += c // 3\r\nelse:\r\n res = c1\r\nprint(res)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=a.count(2)\r\nt=a.count(1)\r\nif s<t:\r\n print(s+(t-s)//3)\r\nelse:\r\n print(t)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\none=a.count(1)\r\ntwo=a.count(2)\r\nans=min(one,two)\r\none-=ans\r\nans+=one//3\r\nprint(ans)", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\none, two = 0, 0\r\nfor j in range(n):\r\n if nums[j] == 1:\r\n one += 1\r\n if nums[j] == 2:\r\n two += 1\r\nres = min(two, one)\r\none -= res\r\nprint(res + int(one / 3))\r\n", "n = int(input())\r\n\r\nli = list(map(int,input().split()))\r\n\r\none = 0\r\ntwo = 0\r\n\r\nfor i in li:\r\n if i == 1:\r\n one = one+1\r\n else:\r\n two = two+1\r\n\r\nif one<=two:\r\n print(one)\r\nelse:\r\n team = one-two\r\n team = two+(team//3)\r\n print(team)\r\n", "\"\"\"\n\thttps://codeforces.com/problemset/problem/899/A\n\"\"\"\n\nn = int(input())\n\npeople = list(map(int, input().split()))\n\nones = people.count(1)\ntwos = people.count(2)\n\nif ones < twos:\n\tprint(ones)\nelse:\n\tprint(twos + (ones - twos) // 3)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = min(a.count(2), a.count(1))\r\nc = a.count(1)\r\nc -= ans\r\nif c > 0:\r\n ans += c // 3\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx, y = 0, 0\r\nfor i in range(len(a)):\r\n if (a[i] == 1):\r\n x += 1\r\n if (a[i] == 2):\r\n y += 1\r\nif (x == 0):\r\n print(0)\r\nelif (y == 0):\r\n print(x // 3)\r\nelse:\r\n ans = min(x, y)\r\n x -= min(x, y)\r\n if (x >= 3):\r\n ans += (x//3)\r\n print(ans)\r\n ", "from collections import Counter\r\nn, a = int(input()), Counter(input().split())\r\nprint(min(a['1'], a['2']) + (a['1'] - min(a['1'], a['2'])) // 3)\r\n", "n = int(input())\na = list(map(int, input().split()))\none = a.count(1)\ntwo = a.count(2)\nans = min(one, two)\none -= ans\nans += one // 3\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\none=a.count(1)\r\ntwo=a.count(2)\r\nif one>two:\r\n print(two+(one-two)//3)\r\nelse:\r\n print(one)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nx=lst.count(1)\r\ny=lst.count(2)\r\nm=min(x,y)\r\nans=m+(x-m)//3\r\nprint(ans)", "n=int(input())\r\nx=list(map(int, input().split()))\r\none=x.count(1); two=x.count(2)\r\n\r\nif one==0: print(0)\r\nelif two==0: print(one//3)\r\nelse: print(two+(one-two)//3 if one>=two else one)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\nn=int(input())\r\n\r\none=0\r\ntwo=0\r\nans=0\r\n\r\narr=list(map(int,input().split()))\r\n\r\nfor i in range(0,n):\r\n x=arr[i]\r\n if (x==1):\r\n one=one+1\r\n else: \r\n two=two+1\r\n \r\n#print (two)\r\n \r\nif (one>two):\r\n ans=(int)(two)+(int)((one-two)/3)\r\nelse: \r\n ans=(one)\r\n\r\nprint (ans)\r\n", "a=int(input());k=list(map(int,input().split()));z1=k.count(2);z2=min(a-z1,z1);a=(a-z1-z2);print(z2+(a//3))", "n = int(input())\na = list(map(int, input().split()))\nx = a.count(1)\ny = a.count(2)\nans = min(x, y)\nx -= ans\nans += x // 3\nprint(ans)\n", "n = int(input())\r\nlst = [*map(int, input().split())]\r\nones = lst.count(1)\r\ntwos = lst.count(2)\r\nres = min(twos, ones) + max((ones - twos) // 3, 0)\r\nprint(res)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\ncount1 = l.count(1)\r\ncount2 = l.count(2)\r\nif count1==0:\r\n\tprint(0)\r\nelif count1<count2:\r\n\tprint(count1)\r\nelif count1>=count2:\r\n\tcount += count2\r\n\tcount1 = count1 - count2\r\n\tcount += count1//3\r\n\tprint(count)\t\t", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nk1=l.count(1)\r\nk2=l.count(2)\r\nk=min(k1,k2)\r\nprint(k+(max(0,k1-k)//3))", "n, a = int(input()), (int(i) for i in input().split())\ntwos = sum(i == 2 for i in a)\nres = min(twos, n - twos)\nres += (n - twos - res) // 3\nprint(res)\n", "n = int(input())\r\nc = list(map(int, input().split()))\r\nif c.count(1) > c.count(2):\r\n print(c.count(2) + (c.count(1) - c.count(2)) // 3)\r\nelse:\r\n print(min(c.count(1), c.count(2)))\r\n", "def amount():\r\n\tfor x in inputList:\r\n\t\tif x == 1:\r\n\t\t\tcountList[0] += 1\r\n\t\telif x == 2:\r\n\t\t\tcountList[1] += 1\r\n\r\nnub = int(input())\r\ncountList = [x*0 for x in range(2) ]\r\ninputList = [int(x) for x in input().split()]\r\n\r\namount()\r\ndif = 0\r\n\r\ndif = min(countList[0],countList[1])\r\ncountList[0] -= dif\r\ndif += countList[0] // 3\r\n\r\nprint(dif)\r\n", "n = input()\r\nx = input().split()\r\na = x.count('1')\r\nb = x.count('2')\r\nif a <= b:\r\n r = a\r\nelse:\r\n r = b\r\n r += (a - b)//3\r\nprint(r)\r\n \r\n", "\n# coding: utf-8\n\n# In[6]:\n\nn = int(input())\na = input().split()\ns = 0\nd = 0\nfor i in range(n):\n if a[i] == '1':\n s += 1\n else:\n d += 1\nprint(min(s, d) + (s - min(s, d))//3)\n\n\n# In[ ]:\n\n\n\n\n# In[ ]:\n\n\n\n", "n=int(input())\r\nl=map(int,input().split())\r\ntwo=0\r\none=0\r\nfor x in l:\r\n\tif x==2:two+=1\r\n\telse:one+=1\r\ns=0\r\nif one>=3:\r\n\ts1=min(two,one)\r\n\ts1+=(one-s1)//3\r\n\ts+=one//3\r\n\tk=one%3\r\n\ts+=min(two,k)\r\n\tprint(max(s,s1))\r\nelse:\r\n\tprint(min(two,one))", "n = int(input())\r\ns = input()\r\ns = s.split()\r\ner = s.count(\"2\")\r\nyi = s.count(\"1\")\r\nif yi - er <= 0:\r\n cha = 0\r\nelse:\r\n cha = yi - er\r\nsu = min(yi, er) + cha//3\r\nprint(su)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif a.count(2) <= a.count(1):\r\n print(a.count(2) + (a.count(1) - a.count(2)) // 3)\r\nelse:\r\n print(a.count(1))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n counter_dict = {1: 0, 2: 0}\r\n next_line = input().split()\r\n for i in range(0, n):\r\n counter_dict[int(next_line[i])] += 1\r\n\r\n print(int(min(counter_dict[1], counter_dict[2])) + int((counter_dict[1] - min(counter_dict[1], counter_dict[2])) / 3))\r\n", "n = int(input(\"\"))\n# it is a list ===> you should but int before each stud\nstud = input(\"\").split()\n\nNo_of_group = 0\n\none_arr = stud.count(\"1\")\ntwo_arr = stud.count(\"2\")\n\nif one_arr-two_arr >= 0:\n No_of_group = two_arr\n No_of_group += int((one_arr-two_arr)/3)\nelse:\n No_of_group = one_arr\n\n\nprint(No_of_group)\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=read_int()\r\n\tc1=0\r\n\tc2=0\r\n\tfor x in read_ints():\r\n\t\tif x==1:\r\n\t\t\tc1+=1\r\n\t\telse:\r\n\t\t\tc2+=1\r\n\tr=min(c1,c2)\r\n\tc1-=r\r\n\tc2-=r\r\n\tprint(r+c1//3)\r\n\r\nsolve()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif a.count(1)<=a.count(2):\r\n\tprint(a.count(1))\r\nelse:\r\n\tprint((a.count(1)-a.count(2))//3+a.count(2))\r\n", "n = int(input())\r\nw = input().split()\r\na = w.count('1')\r\nb = w.count('2')\r\nprint(min(a,b) + (a - min(a,b))//3)", "input()\r\nA=list(map(int,input().split()))\r\nn1=A.count(1)\r\nn2=A.count(2)\r\nan = min(n1,n2)\r\nif n1 > n2:\r\n an += (n1-n2)//3\r\nprint(an) ", "def solve(n, a):\n t = a.count(2)\n o = n - t\n return min(t, o) + (o - min(t, o))//3\n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))\n\n\nmain()\n", "n = int(input())\r\nqueue = input().split()\r\none = queue.count('1')\r\ntwo = queue.count('2')\r\nif two >= one:\r\n\tprint(one)\r\nelse:\r\n\tprint(two + (one - two) // 3)", "n = int(input())\r\ns = input()\r\na = s.count('2')\r\nb = s.count('1')\r\n\r\nprint(min(a, b) + (b - min(a, b)) // 3)", "input()\nnumbers = list(map(int, input().split()))\ncount = [0, 0]\n\nfor x in numbers:\n count[x - 1] += 1\n\nmin_count = min(count)\nresult = min_count + (count[0] - min_count) // 3\nprint(result)\n\n \t \t \t \t \t \t\t \t \t\t\t \t\t\t\t", "n = int(input())\na = list(map(int,input().split()))\nans = 0\nif a.count(1) >= a.count(2):\n ans = (a.count(2) + (a.count(1) - a.count(2))//3) \nelse:\n ans = a.count(1)\nprint (ans)\n\n\n \n \n\n\n\n\n\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A):\r\n d = [0, 0]\r\n for x in A:\r\n d[x-1]+=1\r\n a, b = d\r\n #b = two count\r\n #a = 1 count\r\n m = min(a, b)\r\n return m+(a-m)//3\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))", "n=int(input())\r\nc=[0,0]\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n c[a[i]-1]+=1\r\nres = min(c[0],c[1])\r\nprint(int(min(c[0],c[1])+(c[0]-min(c[0],c[1]))/3))", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a.count(1)\r\ny=a.count(2)\r\nprint(min(x,y)+(x-min(x,y))//3)", "n=int(input())\r\nm=list(map(int,input().split()))\r\na=m.count(1)\r\nb=m.count(2)\r\nk=0\r\nif a>=b:\r\n k+=b\r\n a-=b\r\n k+=a//3\r\nelse:\r\n k+=a\r\nprint(k)", "n= int(input())\r\ndct={'1':0,'2':0}\r\nteams=input(\" \").split(' ')\r\n\r\nfor i in teams:\r\n dct[i] = dct.get(i) + 1\r\n \r\nteam = 0\r\nc1=dct.get('1')\r\nc2=dct.get('2')\r\ntemp2 = c1 - c2\r\nif temp2>=0:\r\n team = c2+ int(temp2/3)\r\n \r\nelse:\r\n team= c2+temp2\r\n \r\nprint(team)", "n=int(input())\r\na=list(map(str,input().split()))\r\nk1=a.count('1')\r\nk2=a.count('2')\r\nm=min(k1,k2)\r\nk1=k1-m\r\nprint(m+(k1//3))\r\n", "from sys import stdin\n\n\ncount = int(stdin.readline())\ndct = {}\n\nfor i in stdin.readline().split():\n dct[i] = dct.get(i, 0) + 1\n\nresult = 0\n\nif dct.get(\"2\", 0) <= dct.get(\"1\", 0):\n result += dct.get(\"2\", 0)\n result += (dct.get(\"1\", 0) - dct.get(\"2\", 0)) // 3\n\nelse:\n result += dct.get(\"1\", 0)\n\nprint(result)", "# A. Splitting in Teams\n\nn = int(input())\na = list(map(int, input().split()))\n\nones = a.count(1)\ntwos = a.count(2)\nans = min(twos, ones)\nif ones > twos:\n ans += (ones - twos) // 3\n\nprint(ans)\n", "def solution(l1):\r\n l2 = [1 for x in l1 if x==2]\r\n l3 = [1 for x in l1 if x==1]\r\n stage1=min(len(l2),len(l3))\r\n stage2=int((len(l3)-stage1)/3)\r\n return stage1+stage2\r\ndef answer():\r\n n = int(input())\r\n l1=[int(x) for x in input().split()]\r\n print(solution(l1))\r\nanswer()", "import collections\r\n\r\ndef getDP(table, *ind):\r\n for t in ind:\r\n if t not in table:\r\n print(\"non presente\")\r\n return None\r\n table = table[t]\r\n return table\r\n\r\ndef setDP(table, val, *ind):\r\n for t in ind[0:-1]:\r\n if t not in table:\r\n table[t] = {}\r\n table = table[t]\r\n table[ind[-1]] = val\r\n#####################################\r\n\r\nn = int(input())\r\nv = [int(x) for x in input().split(' ')]\r\nr = [0,0,0]\r\nfor x in v:\r\n r[x] = r[x] + 1\r\n\r\nt = min(r[1:])\r\ntt = r[1] - t\r\nif tt > 0:\r\n t = t + int(tt/3)\r\n\r\nprint(t)\r\n \r\n", "n=int(input())\r\nli1=list(input().split())\r\nli=\" \".join(i for i in li1)\r\nn1=li.count('2')\r\nn2=li.count('1')\r\ncount=0\r\ncount=min(n2,n1)\r\ncount+=(n2-min(n2,n1))//3\r\nprint(count)\r\n", "n=int(input())\r\ncount=0\r\na={1:0,2:0}\r\nfor j in input().split():\r\n i=int(j)\r\n a[i]=a[i]+1\r\n if a[1]>a[2]:\r\n count=count+a[2]\r\n a[1]=a[1]-a[2]\r\n a[2]=0\r\n else:\r\n count=count+a[1]\r\n a[2]=a[2]-a[1]\r\n a[1]=0\r\ncount=count+a[1]//3 \r\nprint(count) \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a.count(1)\r\ny=n-x\r\nans=min(x,y)\r\nx-=ans\r\nans+=x//3\r\nprint(ans)\r\n", "n=int(input())\nr=list(map(int,input().split()))\na=r.count(1)\nb=r.count(2)\nif a>b:print(b+(a-b)//3)\nelse:print(a)", "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 lst=sorted(_list())\r\n a=0\r\n b=0\r\n for i in range(n):\r\n if (lst[i]==1):\r\n a+=1\r\n else:\r\n b+=1\r\n if (a<=b):\r\n print(a)\r\n else:\r\n print(b+(a-b)//3)\r\n \r\n \r\n\r\n\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nc1 = a.count(1)\r\nc2 = a.count(2)\r\nprint(c1 if c2 >= c1 else c2 + (c1 - c2)//3)\r\n", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nno1=list.count(1)\r\nno2=list.count(2)\r\nans=min(no1,no2)\r\nans+=int((no1-ans)/3)\r\nprint(ans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nt = a.count(2)\r\ne = a.count(1)\r\nif e>=t:\r\n print(t+(e-t)//3)\r\nelse:\r\n print(e)", "n = int(input())\nX = input()\nx = X.split()\nc1 = x.count('1')\nc2 = x.count('2')\ndef num_finder(c1,c2):\n\tflag = 0\n\tteams = 0\n\tr1 = 0\n\tr2 = 0\n\tif c1>c2 and c2 != 0:\n\t\tteams += c2\n\t\tr1 = c1 - c2\n\t\tflag = 1\n\telif c1<c2 and c1 != 0:\n\t\tteams += c1\n\t\tr2 = c2 - c1\n\t\treturn teams\n\telif c1 == c2:\n\t\tteams += c1\n\t\treturn teams\n\tif flag == 1:\n\t\tteams += int(r1/3)\n\t\treturn teams\n\telse:\n\t\tif c1 == 0:\n\t\t\treturn(0)\n\t\telse:\n\t\t\treturn(int(c1/3))\t\nprint(num_finder(c1,c2))\t\t\t\t\n\n\n\n\n", "input()\r\na=[0,0]\r\nfor x in input().split():a[int(x)-1]+=1\r\nc=min(a)\r\nprint(c+(a[0]-c)//3)", "n=int(input())\r\na=list(map(int,input().split()))\r\none=a.count(1);two=n-one\r\nif one==two:print(one)\r\nelif one>two:one=one-two;print(two+(one//3))\r\nelse:print(one)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=l.count(1)\r\nb=l.count(2)\r\ncount=0\r\nif a>0:\r\n\tif a>=b:\r\n\t\tcount+=b\r\n\t\ta=a-b\r\n\t\tcount+=a//3\r\n\telse:\r\n\t\tcount+=a\r\nprint(count)", "num=int(input())\r\n\r\nvals=list(map(int,input().split()))\r\n\r\nones=0\r\n\r\ntwos=0\r\n\r\nfor i in vals:\r\n if i==1:\r\n ones+=1\r\n \r\n else:\r\n twos+=1\r\n\r\nif ones>twos:\r\n print(twos+(ones-twos)//3)\r\n \r\nelse:\r\n print(min(ones,twos))\r\n", "n = int(input())\np = list(map(int, input().split()))\n\namount_of_ones = 0\namount_of_twos = 0\n\nfor i in range(n):\n if p[i] == 1:\n amount_of_ones += 1\n if p[i] == 2:\n amount_of_twos += 1\n\nmin_amount = min(amount_of_twos, amount_of_ones)\ny = amount_of_ones // 3\nz = (amount_of_ones - amount_of_twos) // 3 # 1s left over after swapping out the 2s\n\ntotal = 0\n\ntotal += min_amount\namount_of_ones -= min_amount\namount_of_twos -= min_amount\nif amount_of_ones > 0:\n total += amount_of_ones // 3\n\nprint(total)\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn=int(input())\r\nls=[int(x) for x in input().split()]\r\nc2=sum(ls)-n\r\nc1=n-c2\r\nif c2>=c1:\r\n print(c1)\r\nelse:\r\n print(c2+(c1-c2)//3)\r\n", "input()\r\ngroups=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nfor i in groups:\r\n if i==1:\r\n c1+=1\r\n else:\r\n c2+=1\r\nif c1>c2:\r\n print(c2+(c1-c2)//3)\r\nelse:\r\n print(c1)", "a=int(input())\r\nl=list(map(int,input().split()))\r\nt=l.count(2)\r\no=a-t\r\nif t<=o:print(t+(o-t)//3)\r\nelse:print(o)", "# 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\nn = int(input())\r\narr = list(map(int, input().split()))\r\na_count = arr.count(2)\r\nb_count = arr.count(1)\r\nprint(min(a_count, b_count) + (b_count - min(a_count, b_count))//3)\r\n", "n, c1 = int(input()), input().split().count('1')\r\nv = min(c1, n - c1)\r\nprint(v + (c1 - v) // 3)", "input()\na = input().split()\nprint(a.count('1') if a.count('2') > a.count('1') else a.count('2') + (a.count('1') - a.count('2'))//3)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif n==2 and sum(l)!=3:\r\n print(0)\r\n exit()\r\nx=l.count(2)\r\nx1=l.count(1)\r\nif x>x1:\r\n print(x1)\r\nelse:\r\n x1=x1-x\r\n print(x+(x1//3))\r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nz = a.count(1)\r\nx = a.count(2)\r\nc = z-min(z,x)\r\nprint(min(z,x) +c//3)\r\n", "n, = map(int,input().split())\r\narr = list(map(int,input().split()))\r\na2 = arr.count(2)\r\na1 = arr.count(1)\r\n\r\nprint(min(a1,a2) + (a1-min(a1,a2))//3)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = 0\r\np = 0\r\nfor i in a:\r\n if i == 1:\r\n m += 1\r\n if i == 2:\r\n p += 1\r\nif p >= m:\r\n print(m)\r\nelse:\r\n print(p + ((m - p) // 3))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nres = min(arr.count(1), arr.count(2))\r\nprint(res + (arr.count(1)-res) // 3)\r\n", "n=int(input())\r\ns=input().split()\r\nprint(min(s.count('1'),s.count('2'))+((s.count('1')-min(s.count('1'),s.count('2')))//3))", "n=input()\r\na=list(map(int,input().split()))\r\nans=0\r\none=a.count(1)\r\ntwo=a.count(2)\r\nif two>=one:\r\n ans=ans+one\r\nelif one>two:\r\n ans=ans+two\r\n one=one-two\r\n ans=ans+(one//3)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nrec = [0] * 3\r\nfor i in range(n):\r\n rec[a[i]] += 1\r\n\r\nif rec[2] > rec[1]:\r\n print(rec[1])\r\nelse:\r\n rec[1] -= rec[2]\r\n print(rec[2] + rec[1] // 3)", "int(input())\r\ngroups = list(map(int, input().split()))\r\n\r\nc1 = 0 \r\nc2 = 0 \r\n\r\nfor i in groups:\r\n if i == 1:\r\n c1 += 1 \r\n else:\r\n c2 += 1 \r\n\r\nif c1 > c2:\r\n print(c2 + (c1-c2) // 3)\r\nelse:\r\n print(c1)", "n = int(input())\na1 = input().count('1')\na2 = n - a1\nprint(a2+(a1-a2)//3 if a2 <= a1 else a1)\n\n\t \t\t\t \t\t\t\t \t \t \t\t \t\t\t \t \t\t\t", "from itertools import count\r\n\r\na,b = int(input()),list(map(int,input().split()))\r\ntwos = b.count(2)\r\nones = b.count(1)\r\n\r\nif twos > ones and ones != 0:\r\n counting = ones\r\nelif twos == ones:\r\n counting = twos\r\nelif ones == 0:\r\n counting = 0 \r\nelif twos == 0:\r\n counting = ones//3\r\nelse:\r\n remaining = ones - twos\r\n counting = remaining//3 + twos\r\n\r\nprint(counting)", "n=int(input())\r\n\r\nt=list(map(int,input().split()))\r\np=t.count(2)\r\n\r\nq=t.count(1)\r\n\r\n\r\nif q>=p:\r\n print(p+(q-p)//3)\r\nelse:\r\n print(q)\r\n", "n=int(input())\r\ncontestants = map(int,input().split())\r\ngroups = 0\r\nfree2move = 0\r\ncounter2 = 0\r\nfor i in contestants:\r\n if i == 1:\r\n free2move+=1\r\n if i == 2:\r\n counter2+=1\r\n\r\nif counter2 > 0 and free2move > 0:\r\n groups+= min(counter2,free2move)\r\n free2move-=groups\r\ngroups+=free2move//3\r\nprint(groups) ", "n = int(input())\r\na = b = 0\r\nfor e in map(int, input().split()):\r\n if e == 1: a += 1\r\n else: b += 1\r\nx = min(a, b)\r\nres = x\r\na -= x\r\nres += a // 3\r\nprint(res)", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nprint(min(mas.count(2), mas.count(1)) + (mas.count(1) - min(mas.count(2), mas.count(1))) // 3)", "smth = int(input())\r\none = 0\r\ntwo = 0\r\n\r\ngroups = input().split()\r\n\r\nfor i in groups:\r\n if i == '1':\r\n one += 1\r\n else:\r\n two += 1\r\n\r\nres = min(one, two)\r\nres += ((one - two) // 3) if one > two else 0\r\n\r\nprint(res)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ncounter = 0\r\nSeccounter = 0\r\nfor i in range(0,n):\r\n if lst[i] == 2:\r\n counter += 1\r\n if lst[i] == 1:\r\n Seccounter += 1\r\n\r\nif Seccounter > counter:\r\n count = counter + (Seccounter - counter)//3\r\nif counter > Seccounter:\r\n count = Seccounter\r\nif counter == Seccounter:\r\n count = counter\r\n\r\nprint(count)", "import sys\r\nn = int(input())\r\ns1 = sum((1 for x in input().split() if x == '1'))\r\ns2 = n - s1\r\nif s1 > s2 : print(s2 + (s1 - s2) // 3)\r\nelse: print(s1)\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nx = arr.count(1)\r\ny = arr.count(2)\r\nif x > y:\r\n ans = y + (x - y) // 3\r\nelse:\r\n ans = x\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=l.count(1)\r\ns=l.count(2)\r\nu=min(r,s)\r\nt=r-s\r\nif t>0 and r>0:\r\n\tprint(u+t//3)\r\nelse:\r\n\tprint(u)", "n = int(input())\r\ns = input()\r\nc1 = s.count('1')\r\nc2 = s.count('2')\r\nif c2 == 0:\r\n\tprint(c1 // 3)\r\n\texit(0)\r\nelif c1 == 0:\r\n\tprint(0)\r\n\texit(0)\r\n\r\nm = min(c1, c2)\r\nif m == c2:\r\n\tprint(c2 + ((c1 - c2) // 3))\r\nelse:\r\n\tprint(c1)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\ncount_1=arr.count(1)\r\ncount_2=arr.count(2)\r\nif count_1>count_2:\r\n ans=count_2+(count_1-count_2)//3\r\n print(ans)\r\nelse:\r\n print(count_1)", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nif lst.count(2)<=lst.count(1):\r\n print(lst.count(2) + (lst.count(1)-lst.count(2))//3)\r\nelse:\r\n print(lst.count(1))\r\n\r\n", "#10010101\r\nn = int(input())\r\nx=0\r\ny=0\r\nl =list( map(int,input().split()) )\r\nfor i in l :\r\n if(i==1):\r\n x+=1\r\n elif(i==2):\r\n y+=1\r\n\r\nif(y>x):\r\n print(x)\r\nelif(x>y):\r\n\r\n print(y+((x-y)//3))\r\nelse:\r\n print(x)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\np = a.count(1)\r\nq = a.count(2)\r\nr = 0\r\ncount = 0\r\n\r\nif p == q:\r\n print(p)\r\nelif q == 0:\r\n print(int(p/3))\r\nelif p == 0:\r\n print(0)\r\nelif q > p:\r\n print(p)\r\nelse:\r\n r += q\r\n p -= r\r\n s = int(p/3)\r\n r += s\r\n print(r)\r\n\r\n", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nteam=0;ppp=0\r\nfor i in range(n):\r\n if a[i]==2:team+=1\r\n else:\r\n ppp+=1\r\nk=min(team,ppp)\r\nprint(k+(ppp-k)//3)\r\n", "import math;\r\nn = map(int, input().split())\r\na = map(int, input().split())\r\ncnt1=0\r\ncnt2=0\r\nfor x in a:\r\n if(x==1):\r\n cnt1+=1;\r\n else:\r\n cnt2+=1;\r\nret = min(cnt1, cnt2)\r\ncnt1 -= cnt2;\r\ncnt1 = max(cnt1, 0);\r\n\r\nprint (ret + cnt1//3)", "n = int(input().strip())\r\na = [ int(i) for i in input().strip().split(' ')]\r\nc1, c2 = 0, 0\r\nfor i in range(n):\r\n\tif a[i]==1:\r\n\t\tc1 = c1 + 1\r\n\telse:\r\n\t\tc2 = c2 + 1\r\nans = min( c2, c1)\r\nc1 = c1 - ans\r\nans = ans + c1//3\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=l.count(1)\r\nb=l.count(2)\r\nif(b>=a):\r\n\tprint(a)\r\nelse:\r\n\tprint(b+(a-b)//3)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nc1=a.count(1)\r\nc2=n-c1\r\nres=0\r\nif c1==c2:\r\n print(c2)\r\nelif c1<c2:\r\n print(c1)\r\nelse:\r\n print(c2+(c1-c2)//3)", "# Splitting into Teams\nn = int(input())\nlst = list(map(int,input().split()))\nx = lst.count(1)\ny = lst.count(2)\nif x > y:\n print(y+(x-y)//3)\nelse:\n print(x)\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = l.count(1)\r\nb = l.count(2)\r\nif a > b:\r\n\tprint(b+(a-b)//3)\r\nelse:\r\n\tprint(a)", "n=int(input())\r\nx=input()\r\nxx=x.split( )\r\ns1=0\r\ns2=0\r\nfor i in xx:\r\n if i=='1':\r\n s1+=1\r\n else:\r\n s2+=1\r\ng=0\r\nif s1>=s2:\r\n g+=s2\r\n s1-=s2\r\n g+=int(s1//3)\r\n print(g)\r\nelse:\r\n print(s1)\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\ne = 0\r\nteams = []\r\nb.sort()\r\nb.reverse()\r\no2 = b.count(2)\r\no1 = b.count(1)\r\nlist2 = b[:o2]\r\nlist1 = b[o1-1:]\r\ng = min(o2, o1) + (o1-min(o2, o1))//3\r\nprint(g)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\none=a.count(1)\r\ntwo=a.count(2)\r\nif one==0:print(0)\r\nelse:\r\n if one==min(one,two):print(one)\r\n else:\r\n print(two+(one-two)//3)", "from collections import Counter\r\n\r\nn = int(input())\r\nc = Counter([int(x) for x in input().split(' ')])\r\nteams = min(c[1], c[2])\r\nc[1] -= teams\r\nc[2] -= teams\r\nteams += c[1] // 3\r\nprint(teams)", "n=int(input())\na = [*map(int,input().split())]\n_2=a.count(2)\n_1=a.count(1)\nif _1>_2:\n print(_2+((_1-_2)//3))\nelse:\n print(_1)", "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\n\r\none = 0\r\ntwo = 0\r\nfor ax in a:\r\n if ax == 1:\r\n one += 1\r\n elif ax == 2:\r\n two += 1\r\ncan = min(two, one)\r\nres = can\r\none -= can\r\nres += one//3\r\nprint(res)\r\n\r\n", "n=int(input())\r\nli=list(map(int, input().split()))\r\npairs=0\r\n\r\nno1=li.count(1)\r\nno2=li.count(2)\r\n\r\npairs+=min(no1, no2)\r\nno1-=pairs\r\npairs+=no1//3\r\nprint(pairs)", "input()\nlistnum = list(map(int, input().split()))\n\ncount1 = 0\ncount2 = 0\n\nfor i in listnum:\n if i == 1:\n count1 += 1\n else:\n count2 += 1\n\nif count1 > count2:\n print(count2 + (count1 - count2) // 3)\nelse:\n print(count1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na1=a.count(1)\r\na2=a.count(2)\r\nz=0\r\nh=min(a1,a2)\r\na1-=h\r\na2-=h\r\nz+=a1//3+h\r\nprint(z)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nn1 = 0\r\nn2 = 0\r\nans = 0\r\nfor i in l:\r\n if i == 1:\r\n n1 += 1\r\n elif i == 2:\r\n n2 += 1\r\nmi = min(n1,n2)\r\nif n1 > mi:\r\n mi += (n1-mi) // 3\r\nprint(mi)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nm = x.count(2)\r\nt = min(m, n-m)\r\nprint ((n-m-t)//3+t)", "n = int(input())\r\nA = input()\r\na = A.count('2')\r\nb = A.count('1')\r\nprint(min(a,b)+(b-min(a,b))//3)\r\n", "# LUOGU_RID: 101737486\nn, *a = map(int, open(0).read().split())\r\nx = a.count(1)\r\ny = n - x\r\nif y >= x:\r\n exit(print(x))\r\nx -= y\r\nprint(y + x // 3)", "n = int(input())\r\nn1 = n2 = 0\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nn1 = a.count(1)\t\r\nn2 = a.count(2)\r\nif n2 >= n1:\r\n rez = n1\r\nelse:\r\n rez = n2 + (n1 - n2) // 3\r\nprint (rez)", "from collections import Counter\ndef main():\n n = int(input())\n l = list(input().split())\n c = Counter(l)\n m = min(c[\"1\"],c[\"2\"])\n print(m + (c[\"1\"]-m)//3)\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\r\narray = [int(i) for i in input().split()]\r\none = 0\r\ntwo = 0\r\nfor i in array:\r\n if i == 1:\r\n one+=1\r\n else:\r\n two+=1\r\n\r\nif two>one or two==one:\r\n print(one)\r\nelif one>two:\r\n print(two + (int)((one-two)/3))\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\ncnt_1 = s.count('1')\r\ncnt_2 = s.count('2')\r\ncnt = min(cnt_1, cnt_2)\r\ncnt_1 -= cnt\r\ncnt_2 -= cnt\r\nif cnt_1 >= 3:\r\n cnt += cnt_1 // 3\r\nprint(cnt)\r\n", "n = int(input())\r\npl = []\r\ns = input()\r\ns = s.split()\r\nfor i in s:\r\n pl.append(int(i))\r\n\r\ncount = 0\r\nfor i in pl:\r\n if i==2:\r\n count+=1\r\n\r\nt = len(pl)\r\nif t-count>=count:\r\n print(count + (t - count*2) // 3)\r\nelse:\r\n print(t - count)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nones, twos = 0, 0\r\n\r\nfor i in a:\r\n if i == 1:\r\n ones += 1\r\n else:\r\n twos += 1\r\n\r\nif ones == 0:\r\n print(0)\r\nelif twos == 0:\r\n print(ones // 3)\r\nelif twos > ones:\r\n print(ones)\r\nelse:\r\n ones -= twos\r\n print(twos + (ones // 3))\r\n \r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = l.count(1)\r\nans1 = l.count(2)\r\nif ans < ans1:\r\n print(ans)\r\nelse:\r\n print(ans1+(ans-ans1)//3)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=b.count(2)\r\nd=b.count(1)\r\nif c-d>=0:\r\n\tprint(d)\r\nelse:\r\n\tprint(c+((d-c)//3))", "n=int(input())\r\na=list(map(int, input().split()))\r\ny=a.count(1)\r\nz=a.count(2)\r\nif y<=z:\r\n print(y)\r\nelse:\r\n print(z+((y-z)//3))\r\n ", "n = int(input())\r\ns1 = sum((1 for i in input().split() if i == '1'))\r\ns2 = n - s1\r\nprint(s2 + (s1 - s2) // 3 if s1 > s2 else s1)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nn1 = a.count(1)\r\nn2 = a.count(2)\r\nr = min(n1, n2)\r\nn1 -= r\r\nprint(r + n1 // 3)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-20 22:54:54\nLastEditTime: 2021-11-27 23:51:43\nDescription: Splitting in Teams\nFilePath: CF899A.py\n'''\n\n\ndef func():\n n = int(input())\n num = list(map(int, input().strip().split()))\n a, b = num.count(1), num.count(2)\n count = 0\n if b > 0:\n if a >= b:\n count += b\n a -= b\n count += a // 3\n else:\n count += a\n else:\n count += a // 3\n print(count)\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\r\nteams = list(map(int, input().split()))\r\n\r\npair = 0\r\none = 0\r\n\r\nfor t in teams:\r\n if (t == 2):\r\n pair += 1\r\n else:\r\n one += 1\r\n\r\nteam1 = min(pair, one); # 2+1\r\npair -= team1\r\none -= team1\r\nteam2 = one // 3\r\n# print(pair, one)\r\n# print('team1=', team1, 'team2=', team2)\r\nprint(team1 +team2)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a.count(1)\r\nt=min(b,a.count(2))\r\nx=t+(a.count(1)-t)//3\r\nprint(x)", "n = int ( input ( ) )\ngroups = list ( map ( int , input ( ) .split ( ) ) )\nsingles = groups .count ( 1 )\npairs = groups .count ( 2 )\na = singles - pairs\nif singles >= pairs:\n p = pairs\n if a >= 3:\n p = pairs + ( a // 3 )\nelse:\n p = singles\nprint ( p )\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\nans = min(li.count(2), li.count(1))\r\na = li.count(1)\r\na -= ans\r\nprint(ans + a//3)", "#!/usr/bin/env python3\r\nn=int( input())\r\none =0\r\ntwo=0\r\na = [int(x) for x in input().split()]\r\none = a.count(1);\r\ntwo = a.count(2);\r\nans= min(two, one)\r\nans = ans + (one-ans)//3\r\nprint(ans)\r\n", "# https://codeforces.com/problemset/problem/899/A\r\n\r\ninput()\r\nl = list(map(int, input().split()))\r\n\r\no = l.count(1)\r\nt = l.count(2)\r\n\r\ns = 0\r\nif t-o > 0:\r\n s = o\r\nelse:\r\n s = t + (o-t)//3\r\n\r\nprint(s)", "n = int(input())\r\na = list(map(int,input().split()))\r\ndv = a.count(2)\r\nod = n - dv\r\nk = 0\r\nif od >= dv:\r\n k += dv\r\n od -= dv\r\n k += od // 3\r\nelse:\r\n k += od\r\nprint(k)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ntwo=a.count(2)\r\none=a.count(1)\r\nans=0\r\nfor i in range(n):\r\n if two>0 and one>0:\r\n ans+=1\r\n two-=1\r\n one-=1\r\n continue\r\n elif one>=3:\r\n ans+=1\r\n one-=3\r\n else:\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\na = [int(s) for s in input().split(\" \")]\r\none = a.count(1)\r\ntwo = a.count(2)\r\nans = min(one, two)\r\nif ans <= one:\r\n ans += (one-ans)//3\r\nprint(ans)", "import collections\r\n\r\ndef teams(arr):\r\n count = collections.Counter(arr)\r\n return min(count[2], count[1]) + max(((count[1] - min(count[2], count[1])) // 3), 0)\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(teams(arr))", "a = int(input())\r\nli = list(map(int, input().split()))\r\nx = li.count(1)\r\ny = li.count(2)\r\nif y>=x:\r\n\tprint(x)\r\nelse:\r\n\tprint(y+ (x-y)//3)", "n = input()\r\ns = input().split()\r\na = s.count('1')\r\nb = s.count('2')\r\nprint(a if b >= a else b + (a - b) // 3)\r\n", "n = int(input())\na = list(map(int, input().split()))\nos = a.count(1)\nts = a.count(2)\nb = os - ts\nif b > 0:\n b //= 3\n print(min(os, ts) + b)\nelse:\n print(min(os, ts))", "\"\"\"\r\n@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n ..,,,,,,,,************,,,,,,,,,,,,,.\r\n ..,*. .,,,,,,,,,,,,,,,,,,,,,,,,...\r\n #&@@@@@@@@@@@@@@@@@( .....,,,,,,,.....\r\n (*@@@@@@@@@@@@@@@@@@@@@@@@&* ...,,,,,\r\n &*&@@@@@@%@%,.*%@@@@@@@@@@@@@@@@& (&@@@@&%/ ..,,,,,,,,,,,,,*******\r\n ##@@@@@@&#, *@@@@@@@@@@@@ (@@@@@@@@@@@@@@@@@@@@@( . /@@@@(,,,,,,,*********//\r\n (@@@@@@@. #@@@@@@@@@@* %@@@@@@@@@@@@&&@@@@@@@@@@@@@@@% ,@@@@@@% /@@@@@@(...,,,,,,,,,,,,,,**\r\n ,,@@@@@@, #@@@@@@@&, %@@@@@@@/ #@@@@@@@& @@@@@@@@@& .... ,@@@@@@@/ ..,,,,,,,,\r\n ,@@@@@@, .&@@@@&. &@@@@@@. ,&@@@@@@, @@@@@@@@@@, @@@@@@@@% ..,,,\r\n /&@@@@@/ &@ %@@@@@@ #@@@@@@/ /@@@@@@@@@@& @@@@@@@@@@ .\r\n @@@@@@/ &@@@@@, *@@@@@@. @@@@@@@@@@@@ *@@@@@@@@@@&\r\n &&@@@@% @@@@@@ .&@@@@@@@@@@@@& (@@@@@@ #@@@@@@@@@@@# @@@@@@@@@@@&\r\n *%&&@@@*# @@@@@@ /@@@@@@@@@@@@@@@@@@@% @@@@@@ .@@@@@@@@@@@@ @@@@@@@@@@@&\r\n .&@@@@@*( /@@@@@, @@@@@@@@@@@# &@@@@@@@@@( &@@@@@ .@@@@@@@@@@@& @@@@@@@@@@@,\r\n .&@@@@@@% &@@@@@ @@@@@@@@@@@. @@@@@@@@& &@@@@@ &@@@@@@@@@@@@@@@@@@@@\r\n (/@@@@@@@#. @@@@@& ,@@@@@@@@@ .@@@@@@% @@@@@% @@@@@@@@@@@@@@@@@#\r\n &%@@@@@@@@@# @@@@@& *@@@@@@@@ /@@@@@& ,@@@@@ @@@@@@@@@@@@@@,\r\n (,@@@/%@@@@@@@@@@@&, &@@@@@ @@@@@@@& @@@@@@* @@@@@. @@@@@@@@@@@\r\n . &@@@@@@@@@@@@@@@@@@@, @@@@@( *@@@@@@@, ,@@@@@@@ @@@@@, ,@@@@@@@@@@@@\r\n .&@@@@@@@@@@@@@@@@@@, &@@@@@ (@@@@@@@& ,@@@@@@@& @@@@@ @@@@@@@@@@@@@@@@\r\n (@@@@@@@@@@@@, &@@@@@ @@@@@@@@@@@@@&@@@@@@@@@@@ @@@@@@ /@@@@@@@@.@@@@@@@@@&\r\n %@@@@@@@@@% @@@@@@ &@@@@@@@@@@@@@@@@@@@@( #@@@@& (@@@@@@@& .@@@@@@@@@/\r\n *@@@@@@@@# @@@@@@. &@@@@@@@@@@@@@@, &@@@@@. .@@@@@@@# @@@@@@@@@\r\n &@@@@@@@ &@@@@@& %@@@@@@ *@@@@@@@ @@@@@@@@&\r\n &@@@@@@, %@@@@@@& &@@@@@@( .....,,.&@@@@@@& #&@@@@@@.\r\n %@@@@@@ ........@@@@@@@@ . %@@@@@@@( .,,,,,,,,*@@@@@@@ /@@@@@@@\r\n &@@@@@@ .....,,,,,,,,@@@@@@@@# *@@@@@@@@@. ..,,,,,,,,,,%@@@@@@@ .@@@@@@#\r\n @@@@@@. ....,,,,,,,,,,,@@@@@@@@@@@@@@# *&@@@@@@@@@@@@@@@@ .,,,,,,,,,,,,,,@@@@@@@* @@@@@@,\r\n * @@@@@@, ...,,,,,,,,,,,,(@@@@@@/@@@@@@@@@@@@@@@@@@@@@@@@@@& @@@@@@@# .,,,,,,,,,,,,,,,,#@@@@@@& @@@@@&\r\n @@@@/ @@@@@@,...,,,,,,,,,,,,,@@@@@@@ *&@@@@@@@@@@@@@@@@% @@@@@@@@,,,,,,&&#*,,,,,,,,,%@@@@@@ @@@@@#\r\n &@@@@@ &@@@@@@,,,,,,&@@@@*,,,/@@@@@@& *@@@@@@@*,,,*@@@&,,... #@@@@@ .@@@@&\r\n &@@@@@# @@@@@@@,,,,,,%@@@@@@@/@@@@@@@. ..@@@@@@@(,,*@@@@( (@@@@/ ,@@@@.\r\n ,@@@@@@/ &@@@@@@@,,,,,,,,,@@@@@@@@@@@@, ....,,%@@@@@@% @@@@@ @@@@ (@@@*\r\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\ncnt2, cnt1 = 0, 0\r\nfor i in a:\r\n if i == 2: cnt2 += 1\r\n else: cnt1 += 1\r\nans = 0\r\nif cnt2 and cnt1: ans = min(cnt2, cnt1)\r\ncnt2 -= ans\r\ncnt1 -= ans\r\nans += cnt1 // 3\r\nprint(ans)\r\n \r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\nc,d = 0,0\r\nfor i in arr:\r\n if i==1:\r\n c+=1\r\n else:\r\n d+=1\r\nans = min(c,d)\r\nx = min(c,d)\r\nc-=x\r\nd-=x\r\nif c!=0:\r\n ans+=c//3\r\nprint(ans)", "n = input()\r\nl = list(map(int, input().split()))\r\n\r\nx = min(l.count(2), l.count(1))\r\ny = int((l.count(1) - x) / 3)\r\n\r\nprint(x + y)", "n = int(input())\r\ngroups = [int(i) for i in input().split()]\r\nk = sum(i==2 for i in groups)\r\nm = n - k\r\nqq = 0 if m - k<=0 else (m-k)//3\r\nprint(min(k, m)+qq)", "import sys\r\nfrom collections import Counter\r\n\r\ndef main():\r\n _, *l = map(int, sys.stdin.read().strip().split())\r\n c = Counter(l)\r\n m = min(c[2], c[1])\r\n return c[1] and m + (c[1] - m)//3\r\n \r\nprint(main())\r\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Jul 31 22:50:48 2018\n\n@author: akshat\n\"\"\"\n\nn = int(input());\na = list(input().split(\" \"))\nno2 = 0\nno1 = 0\nfor i in a:\n if int(i) == 2:\n no2+=1\n elif int(i) == 1:\n no1+=1\nif no2 == no1:\n print(no2)\nelif no2>no1:\n print(no1)\nelse:\n print(no2+((no1-no2)//3))", "# https://codeforces.com/problemset/problem/899/A\r\n\r\ntwo = 0\r\none = 0\r\n\r\nn = input()\r\n\r\nfor i in input().split():\r\n if i == '1':\r\n one += 1\r\n else:\r\n two += 1\r\n\r\n\r\nif one == 0:\r\n print(0)\r\nelse:\r\n ans = min(two, one)\r\n ans += ((one - ans) // 3)\r\n print(ans)", "def main():\n t = int(input())\n o = input()[::2].count('1')\n t -= o\n print(o if o < t else t + (o - t) // 3)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nfor i in a:\r\n if i==1:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nif len(b)>len(c):\r\n r=len(c)\r\n d=len(b)-len(c)\r\n d=d//3\r\n print(r+d)\r\nelse:\r\n print(len(b))", "n = int(input())\r\nx = list(map(int, input().split()))\r\nif 1 not in x:\r\n print(0)\r\nelse:\r\n if 2 not in x:\r\n print(sum(x)//3)\r\n elif x.count(2)<= x.count(1):\r\n print(x.count(2)+((x.count(1)-x.count(2))//3))\r\n elif x.count(2)>x.count(1):\r\n print(x.count(1))\r\n \r\n \r\n", "n = int(input())\r\nk = [0,0,0]\r\nfor i in map(int, input().split()):\r\n\tk[i] += 1\r\n\r\nr = 0\r\nwhile k[1] > 0 and k[2] > 0:\r\n\tk[1] -= 1\r\n\tk[2] -= 1\r\n\tr += 1\r\nwhile k[1] > 2:\r\n\tk[1] -= 3\r\n\tr += 1\r\nprint(r)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\none = a.count(1)\r\ntwo = a.count(2)\r\n\r\ndef func(a,b):\r\n if(a>b):\r\n count = b\r\n a = a-b\r\n count = count + a//3\r\n elif(b>a):\r\n count = a\r\n a = a-count\r\n elif(a==b):\r\n count = a\r\n\r\n return count \r\n\r\nif(one==0):\r\n print('0')\r\nelse:\r\n z = func(one,two)\r\n print(z)\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\nan = 0\r\nt2, t1 = a.count(2), a.count(1)\r\nprint((min(t2, t1) + max(0, (t1 - t2)) // 3))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ntwos = a.count(2)\r\nones = a.count(1)\r\ntt = min(twos, ones)\r\nprint(tt + max(0, (ones - tt)//3))", "a=int(input());k=list(map(int,input().split()));z=k.count(1);z1=k.count(2);z2=min(z,z1);z=z-z2;print(z2+(z//3))", "n=int(input())\r\na=list(map(int,input().split()))\r\nyek=a.count(1)\r\ndoo=a.count(2)\r\nans=0\r\nif yek>=doo:\r\n ans+=doo\r\n yek-=doo\r\n if yek>=3 :\r\n ans+=yek//3\r\nelse :\r\n ans+=yek\r\nprint(ans)\r\n", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor i in range(0,n):\r\n if l[i]==1:\r\n count1 = count1 + 1\r\n else:\r\n count2 = count2 + 1\r\n \r\nif count1>count2:\r\n n = count1 - count2\r\n ans = count2 + int(n/3)\r\nelse:\r\n ans = count1\r\n \r\nprint(ans)", "\r\n\r\ndef main():\r\n\tn = int(input())\r\n\ta = [int(i) for i in input().split()]\r\n\ttwos = a.count(2)\r\n\tones = n - twos\r\n\tif ones < twos:\r\n\t\tprint(ones)\r\n\telse:\r\n\t\tprint(twos + (ones - twos) // 3)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\t", "def read_int():\n\treturn int(input())\n\ndef read_str():\n\treturn input()\n\ndef read_list(type):\n\treturn list(map(type, input().split()))\n\ndef print_list(x):\n\tprint(' '.join(map(str, x)))\n\n# ------------------------------------------------------\n\nif __name__ == '__main__':\n\tn = read_int()\n\tarr = read_list(int)\n\tx = arr.count(1)\n\ty = arr.count(2)\n\tz = min(x, y)\n\tprint(z + max(0, (x-z)//3))", "n = int(input())\r\na = list(map(int, input().split()))\r\nones = 0\r\ntwos = 0\r\nfor i in range(len(a)):\r\n if a[i] == 1:\r\n ones+=1\r\n else:\r\n twos+=1\r\n\r\nif ones == 0 and twos > 0:\r\n print('0')\r\n\r\nelif twos == 0 and ones > 0:\r\n print (ones//3)\r\n\r\nelse:\r\n ans = 0\r\n if ones > twos:\r\n ans+=twos\r\n ones-=twos\r\n ans+=ones//3\r\n else:\r\n ans+=ones\r\n \r\n print(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=l.count(2)\r\ny=l.count(1)\r\nm=min(x,y)\r\nc=(y-m)//3\r\nprint(c+m)\r\n", "n = int(input()) \r\nar = list(map(int, input().split()))\r\n\r\ntwo = ar.count(2)\r\none = ar.count(1)\r\n\r\nfst = min(two, one)\r\ntwo -= fst\r\none -= fst\r\n\r\nsnd = one // 3\r\nprint(fst + snd)", "a = int(input())\nl = list(map(int,input().split()))\na = l.count(1)\nb = l.count(2)\nif a<=b:\n print(a)\nif a>b:\n c= a-b\n print(c//3+b)\n\n \n\n\n", "n = int(input())\r\nmoo = list(map(int, input().split()))\r\npor = 0\r\nx = moo.count(2)\r\ny = moo.count(1)\r\nif x <= y:\r\n por += x\r\n y -= x\r\n por += y //3\r\nelse:\r\n por += y\r\nprint(por)", "n = int(input())\r\nt = input()\r\nones = t.count('1')\r\ntwos = t.count('2')\r\nthrees = 0\r\nthrees += min(ones,twos)\r\nones -= min(ones,twos)\r\ntwos -= min(ones,twos)\r\nthrees += ones//3\r\nprint(threes)", "class CodeforcesTask899ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.teams = []\n\n def read_input(self):\n self.n = int(input())\n self.teams = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n ss = sum(self.teams)\n b = ss - self.n\n a = self.n - b\n t = min(a, b)\n if a > b:\n t += (a - b) // 3\n self.result = str(t)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask899ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nnum_1 = l.count(1)\r\nnum_2 = l.count(2)\r\nif num_2 <= num_1:\r\n s = num_2\r\n diff = num_1 - num_2\r\n s += diff // 3\r\n print(s)\r\nelse:\r\n print(num_1)", "n = int(input())\r\nstd = input().split()\r\nstd1 = [int(a) for a in std]\r\no = std1.count(1)\r\nt = std1.count(2)\r\nd =0\r\nif t>o:\r\n d = o\r\nelse:\r\n d =t + (o-t)//3\r\nprint(d)", "n=int(input())\r\nl=list(map(int,input().split()))\r\none=l.count(1)\r\ntwo=l.count(2)\r\now=0\r\nif one>two:\r\n ow+=two\r\n ow+=(one-two)//3\r\nelse:\r\n ow+=one\r\nprint(ow)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\namount_of_ones = 0\r\namount_of_twos = 0\r\n\r\nfor i in range(n):\r\n if p[i] == 1:\r\n amount_of_ones += 1\r\n if p[i] == 2:\r\n amount_of_twos += 1\r\n\r\nmin_amount = min(amount_of_twos, amount_of_ones)\r\ny = amount_of_ones // 3\r\nz = (amount_of_ones - amount_of_twos) // 3 # 1s left over after swapping out the 2s\r\n\r\ntotal = 0\r\n\r\ntotal += min_amount\r\namount_of_ones -= min_amount\r\namount_of_twos -= min_amount\r\nif amount_of_ones > 0:\r\n total += amount_of_ones // 3\r\n\r\nprint(total)\r\n", "n=int(input())\r\na=input().split(' ')\r\nones=0\r\ntwos=0\r\nfor i in a:\r\n if(int(i)==1):\r\n ones+=1\r\n else:\r\n twos+=1\r\n\r\nteams=min(ones,twos)\r\nones=int((ones-teams)/3)\r\nteams=teams+ones\r\n\r\nprint (teams)", "n=int(input())\r\narr=list(map(int,input().strip().split(' ')))\r\na=arr.count(1)\r\nb=arr.count(2)\r\n\r\nif(b>=a):\r\n print(a)\r\nelse:\r\n s=b\r\n s=s+(a-b)//3\r\n print(s)", "n = int(input())\na = input().split()\nc1 = a.count('1')\nc2 = a.count('2')\ng = min(c1, c2)\nr1 = c1 - g\ng += r1 // 3\nprint(g)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ntwo=0\r\none=0\r\nfor i in range(n):\r\n\tif a[i]==2:\r\n\t\ttwo+=1\r\n\telse:\r\n\t\tone+=1\r\nif one>=two:\r\n\tprint(two+((one-two)//3))\r\nelse:\r\n\tprint(one)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nnum = [0]*2\r\nfor i in a:\r\n num[i-1] += 1\r\n\r\nteams = min(num)\r\nnum[0] = max(num[0] - teams, 0)\r\nteams += num[0]//3\r\n\r\nprint(teams)\r\n", "input()\r\nX = list(map(int, input().split()))\r\nSumOne = X.count(1)\r\nGroup = (0 if X.count(2) == 0 else min(X.count(1), X.count(2)))\r\nprint(Group + int((SumOne - Group) / 3))\r\n", "input()\r\ndata = list(map(int, input().split()))\r\nn1 = data.count(1)\r\nn2 = len(data) - n1\r\n\r\nprint(min(n1, n2) + (n1 - min(n1, n2)) // 3)\r\n", "n = int(input())\r\nA = list(input().split())\r\n\r\nc = [A.count(\"1\"), A.count(\"2\")]\r\n\r\nif c[0] > c[1]:\r\n k = c[1]\r\n c = [c[0] - c[1], 0]\r\n k += c[0] // 3\r\nelse:\r\n k = c[0]\r\nprint(k)\r\n", "n = int(input())\r\n\r\nl = list(input().split())\r\n\r\nl_1 = l.count(\"1\")\r\nl_2 = l.count(\"2\")\r\n\r\nif l_1 > l_2:\r\n print(l_2+(l_1-l_2)//3)\r\nelse:\r\n print(l_1)\r\n", "n = input('')\r\narr = list(map(int, input('').strip().split()))\r\n\r\ndp = dict()\r\nfor i in arr:\r\n if i in dp:\r\n dp[i] += 1\r\n else:\r\n dp[i] = 1\r\nanswer = 0\r\nif 1 in dp and 2 in dp:\r\n p = min(dp[1], dp[2])\r\n answer += min(dp[1], dp[2])\r\n dp[1] -= p\r\n dp[2] -= p\r\n if dp[1] == 0:\r\n dp.pop(1)\r\n if dp[2] == 0:\r\n dp.pop(2)\r\nif 1 in dp:\r\n answer += dp[1] // 3\r\nprint(answer)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\ngroups1 = a.count(1)\ngroups2 = a.count(2)\n\nmax = 0\n\nmax += min(groups1, groups2)\n\ngroups1 -= max\ngroups2 -= max\n\nmax += groups1 // 3\n\nprint(max)\n \t \t \t \t\t \t \t \t\t\t \t \t\t\t", "from collections import Counter\r\ninput()\r\na = list(map(int, input().split(' ')))\r\nc = Counter(a)\r\nones, twoes = c[1], c[2]\r\n\r\n\r\nif not ones:\r\n print(0)\r\nelif ones <= twoes:\r\n print(ones)\r\nelse:\r\n print(twoes+(ones-twoes)//3)\r\n", "n=int(input())\r\na=[int(e) for e in input().split()]\r\nc1=a.count(1)\r\nc2=a.count(2)\r\nc=min(c1,c2)\r\nc1-=c\r\nprint(c+c1//3)", "n = int(input())\ngroups = list(map(int, input().split()))\n\nx = 0\ny = 0\n\nfor t in groups:\n if t == 1:\n x += 1\n else:\n y += 1\n\n# 1st approach: use 2\nif y > x:\n j = x\nelse:\n j = y + (x - y) // 3\n\n# 2nd approach\nk = (x // 3)\nx -= (x // 3) * 3\nif y > x:\n k += x\nelse:\n k += y + (x - y) // 3\n\nprint(max(j, k))\n\n \t \t\t\t\t\t\t\t \t\t\t\t \t \t\t\t \t", "n=int(input())\na=[int(i) for i in input().split()]\n\ncount_1=a.count(1)\ncount_2=a.count(2)\n\nif count_2>=count_1:\n\tans=count_1\nelse:\n\tans=count_2 + (count_1-count_2)//3\n\nprint(ans)\n\n# counter=0\n\n# while(2 in a and 1 in a):\n# \ta.remove(1)\n# \ta.remove(2)\n# \tcounter+=1\n\n# if 1 in a:\n# \tcounter+=a.count(1)//3\n\n# print(counter)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nk=min(m.count(2),m.count(1))\r\na=(m.count(1)%3)\r\nprint(max((m.count(1)//3+min(a,m.count(2))),k+abs(m.count(1)-k)//3))\r\n", "n=int(input())\r\nnum1=0\r\nnum2=0\r\nlst=[int(i) for i in input().split()]\r\nnum1=lst.count(1)\r\nnum2=lst.count(2)\r\nans=min(num1,num2)\r\nif (num1-ans>0):\r\n ans+=(num1-ans)//3\r\nprint(ans)\r\n", "n = int(input())\nx = list(map(int, input().split()))\nsolo_cnt, pairs_cnt = 0, 0\nfor i in range(n):\n if x[i] == 1:\n solo_cnt += 1\n else:\n pairs_cnt += 1\nif pairs_cnt <= solo_cnt:\n print(pairs_cnt + (solo_cnt - pairs_cnt) // 3)\nelse:\n print(solo_cnt)\n", "input()\r\na = list(map(int,input().split()))\r\n\r\np1 = min(a.count(1),a.count(2))\r\np2 = (a.count(1) - p1) // 3\r\n\r\nprint(p1+p2)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=l.count(2)\r\nd=l.count(1)\r\nif c==0:\r\n print(d//3)\r\nelif d==0:\r\n print(0)\r\nelif d>c:\r\n e=d-c\r\n print(e//3+c)\r\nelse:\r\n print(d)\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\n\r\ntcount=0\r\nocount=0\r\n\r\nfor x in l:\r\n if x==2:\r\n tcount+=1\r\n else:\r\n ocount+=1\r\n\r\ng=min(tcount,ocount)\r\nocount=ocount-g\r\ng=g+ocount//3\r\n\r\nprint(g)", "nb_groups = int(input())\r\ngroups = [int(x) for x in input().split()]\r\nones = groups.count(1)\r\ntwos = groups.count(2)\r\nteam = min(ones, twos) + (max(0, ones - twos))//3\r\nprint(team)", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\nc = [0, 0]\r\nfor i in range(n):\r\n c[a[i] - 1] += 1\r\n\r\nans = min(c[0], c[1])\r\nc[0] -= ans\r\nc[1] -= ans\r\nans += c[0] // 3\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk1,k2=0,0\r\nfor x in a:\r\n if x==1:\r\n k1+=1\r\n else:\r\n k2+=1\r\nif k1>k2:\r\n print(k2+(k1-k2)//3)\r\nelse:\r\n print(k1)\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=0\r\nsum=0\r\nfor i in a:\r\n if i==1:\r\n count+=1\r\n else:\r\n sum+=1\r\nif sum<=count:\r\n count-=sum\r\n print(sum+int(count/3))\r\nelse:\r\n print(count)", "n = int(input())\r\ngroups = list(map(int, input().split()))\r\n\r\nnum_singles = groups.count(1)\r\nnum_pairs = groups.count(2)\r\n\r\nnum_teams = min(num_singles, num_pairs)\r\nnum_singles -= num_teams\r\nnum_pairs -= num_teams\r\n\r\nif num_singles >= 3:\r\n num_teams += num_singles // 3\r\n\r\nprint(num_teams)", "n=int(input())\r\no=0\r\nt=0\r\na=list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n if a[i]==1:\r\n o+=1\r\n else:\r\n t+=1\r\nif o<=t:\r\n print(o)\r\nelse:\r\n o=o-t\r\n print(t+o//3)", "N = int(input())\rA = [int(x) for x in input().split()]\rO = A.count(1)\rT = A.count(2)\rprint(min(T, O) + ((O - min(T, O))//3))\r", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n count1 = a.count(1);\r\n count2 = a.count(2);\r\n if (count1 <= count2): print(count1)\r\n elif (count1 > count2): print(count2 + (count1-count2) // 3)\r\n", "# Splitting in Teams\ndef teams(arr):\n ans = 0\n two = arr.count(2)\n one = arr.count(1)\n while True:\n if two < 1 or one < 1:\n break\n ans += 1\n two -= 1\n one -= 1\n if one >= 3:\n ans += (one // 3)\n return ans \n\n\nn = int(input())\narr = list(map(int, input().split()))\nprint(teams(arr))", "import sys\r\nn = int(input())\r\nv = [int(x) for x in input().split()]\r\ns1 = v.count(1)\r\ns2 = n - s1\r\nif s1 > s2 : print(s2 + (s1 - s2) // 3)\r\nelse: print(s1)\r\n\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif 1 in a:\r\n\tx=a.count(2)\r\n\ty=a.count(1)\r\n\tif y>=x:\r\n\t\tp=x\r\n\t\tq=(y-x)//3\r\n\t\tprint(p+q)\r\n\telse:\r\n\t\tprint(y)\t\r\nelse:\r\n\tprint(0)\t", "n = int(input())\r\ngroups = list(map(int, input().split()))\r\n\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor group in groups:\r\n if (group == 2):\r\n count2 += 1\r\n else:\r\n count1 += 1\r\n\r\nif (count1 >= count2):\r\n result = count2 + int((count1-count2)/3)\r\nelse:\r\n result = count1\r\n\r\nprint(result)\r\n", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\nc1 = a.count(1)\r\nc2 = a.count(2)\r\nprint( min(c1,c2) + (c1 - min(c1,c2))//3 )", "from typing import Counter\r\n\r\n\r\ns = input()\r\na = [int(x) for x in input().split()]\r\n\r\nc = Counter(a)\r\nones = c[1]\r\nzeroes = c[2]\r\nthree = min(ones, zeroes)\r\nv = c[1] - three\r\nthree += v // 3\r\nprint(three)", "from sys import stdin\nfrom collections import defaultdict\n\nn = int(next(stdin))\nteams = [int(s) for s in next(stdin).split()]\nc = defaultdict(int)\nfor t in teams:\n\tc[t] += 1\n\ngroup12 = min(c[1], c[2])\nc[1] -= group12\nanswer = (c[1]//3) + group12\nprint(answer)", "len=input()\r\nini_str=input()\r\nini_list=ini_str.split()\r\ncnt1=ini_list.count(\"1\")\r\ncnt2=ini_list.count(\"2\")\r\nif cnt2>cnt1:\r\n print(cnt1)\r\nelse:\r\n print(cnt2+(cnt1-cnt2)//3)", "a = int(input())\r\nb = [int(k) for k in input().split()]\r\nc = b.count(1)\r\nd = b.count(2)\r\nif d >= c:\r\n print(c)\r\nelse:\r\n print(d+int((c-d)/3))", "a=int(input())\r\nb=input()\r\nc2=b.count('2')\r\nc1=b.count('1')\r\nsum=0\r\nsum+=min(c2,c1)\r\nc1-=c2\r\nif c1>0:\r\n sum+=c1//3\r\nprint(sum)", "n = int(input())\r\nv = list(map(int, input().split(' ')))\r\nk1, k2 = [0, 0]\r\nfor i in range(0, n):\r\n if v[i] == 1: k1 += 1\r\n else: k2 += 1\r\nif k1 <= k2: print(k1, end = '')\r\nelse: print(k2 + (k1 - k2) // 3, end = '')", "n=int(input())\r\nddf=input().split()\r\na=ddf.count(\"1\")\r\nb=ddf.count(\"2\")\r\nif a>=b:\r\n print(b+(a-b)//3)\r\nelse:\r\n print(a)\r\n", "from itertools import combinations\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nfir = 0\r\nsir = 0\r\nfor i in arr:\r\n if i==1:\r\n fir+=1\r\n else:\r\n sir+=1\r\n# if fir>sir:\r\n# print((sir+(fir-sir))//3)\r\n# else:\r\n# print(fir)\r\nmn = min(fir,sir)\r\nfir-=mn\r\nmn+=fir//3\r\nprint(mn)", "n, a = int(input()), input()\r\nt = min(a.count('1'), a.count('2'))\r\nprint(t + (a.count('1') - t) // 3)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd=a.count(2)\r\ne=a.count(1)\r\nif(d>=e):\r\n print(min(d,e))\r\nelse:\r\n e=e-(d)\r\n print(d+(e//3))", "n = int(input())\r\na = input().count('1')\r\nb = n-a\r\nif b > a:\r\n print(a)\r\nelse:\r\n print(b+(a-b)//3)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n B = [0] * 3\r\n for a in A:\r\n B[a] += 1\r\n ans = 0 \r\n while B[2] and B[1]:\r\n B[2] -= 1\r\n B[1] -= 1\r\n ans += 1\r\n while B[1] >= 3:\r\n B[1] -= 3\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "input()\r\nl = list(map(int,input().split()))\r\nx = min(l.count(1), l.count(2))\r\nprint(x + int((l.count(1)-x)/3 + min((l.count(1)-x)%3, l.count(2)-x)))", "n = int(input())\r\na = [i for i in input().split()]\r\nb = 0\r\nc = 0\r\nfor i in a:\r\n if i == '1':\r\n b += 1\r\n else:\r\n c += 1\r\nans = min(b, c)\r\nb -= ans\r\nans += b // 3\r\nprint(ans)", "t=int(input())\r\na=list(map(int,input().split()))\r\np=a.count(2)\r\nq=a.count(1)\r\ncount=min(p,q)\r\nq=q-count\r\nq=q//3\r\nprint(count+q)\r\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\na, b, count = lst.count(1), lst.count(2), 0\r\nif a > 0:\r\n if a >= b:\r\n count += b\r\n a = a - b\r\n count += a // 3\r\n else:\r\n count += a\r\nprint(count)\r\n", "import math\r\nn = int(input())\r\na = [int(s) for s in input().split(' ')]\r\nn2 = sum(a) - n\r\nn1 = n - n2\r\nans = min(n2, n1) + (n1 - min(n2, n1)) // 3\r\nprint(ans)", "n = int(input())\r\narray = [i for i in map(int, input().split())]\r\n\r\ngroup1 = 0\r\ngroup2 = 0\r\n#Maximized number of groups of 3 is achieved when groups of 2 join with groups of 1\r\n\r\nfor group in array: \r\n if group == 1:\r\n group1 += 1\r\n else:\r\n group2 += 1\r\n\r\nif group1 >= group2:\r\n print(group2 + (group1 - group2) // 3)\r\nelse:\r\n print(group1) ", "n = int(input())\r\na = list(input().split(' '))\r\na = list(int(x) for x in a)\r\nres = 0\r\none, two = 0, 0\r\nfor x in a:\r\n if x == 1:\r\n one += 1\r\n else:\r\n two += 1\r\nres = min(two, one) + max(0, one - min(two, one))//3\r\nprint(res)\r\n", "if __name__ == '__main__':\r\n n = input()\r\n a = input()\r\n a = list(map(lambda x:int(x), a.split()))\r\n num1, num2 = 0,0\r\n for i in a:\r\n if i == 1:\r\n num1 += 1\r\n else:\r\n num2 += 1\r\n\r\n # print(num1,num2)\r\n\r\n ans = min(num1,num2)\r\n if(num1 > num2):\r\n ans += (num1-num2)//3\r\n\r\n print(ans)\r\n", "n = int(input())\r\nal = list(map(int,input().split()))\r\nn2 = sum([a==2 for a in al])\r\nn1 = n-n2\r\nprint(min(n1,n2)+max(n1-n2,0)//3)\r\n", "n= int(input())\r\ngr= list(map(int, input().split()))\r\ncount=0\r\nif 1 not in gr:\r\n print(0)\r\nelse:\r\n x= gr.count(1)\r\n y= gr.count(2)\r\n t= min(y,x)\r\n x=x-t\r\n count= t + x//3\r\n print(count)", "n=int(input())\r\narr=list(map(int,input().split()))\r\none=arr.count(1)\r\ntwo=arr.count(2)\r\nif one>two:\r\n print(two+(one-two)//3)\r\nelse:\r\n print(one)", "n = int(input())\na = list(map(int, input().strip().split(' ')))\n\none = 0\ntwo = 0\nfor x in a:\n if x == 1:\n one += 1\n else:\n two += 1\n\nans = min(one, two)\none -= min(one, two)\nprint(ans + one // 3)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif l.count(1)==0:\r\n print(0)\r\nelif l.count(2)>=l.count(1) :\r\n print(l.count(1))\r\nelse :\r\n print(l.count(2)+(l.count(1)-l.count(2))//3)", "n=int(input())\r\nx=list(map(int,input().split()))\r\na=x.count(2)\r\nb=x.count(1)\r\ntemp=0\r\nif(a==0 and b<=2):\r\n print(\"0\")\r\nelif(b==0):\r\n print(\"0\")\r\nelse:\r\n while(a>0 or b>0):\r\n if(a!=0 and b!=0):\r\n a-=1\r\n b-=1\r\n temp+=1\r\n elif(a==0 and b>=3):\r\n b=b-3 \r\n temp+=1\r\n else:\r\n break\r\n print(temp) \r\n \r\n \r\n ", "# http://codeforces.com/contest/899/problem/A\nn = int(input())\n\npeople = [int(x) for x in input().split()]\n\ncount_2, count_3 = 0, 0\n\nfor x in people:\n if x == 2:\n count_2 += 1\n else:\n count_3 += 1\n\nif count_2 < count_3:\n print(count_2 + int((count_3 - count_2)/3))\nelse:\n print(count_3)\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nprint(min(m.count(2),m.count(1))+(m.count(1)-(min(m.count(2),m.count(1))))//3)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nn1, n2 = 0, 0\r\nfor i in range(n):\r\n if a[i] == 1:\r\n n1 += 1\r\n if a[i] == 2:\r\n n2 += 1\r\nif n2 < n1:\r\n print(n2 + (n1 - n2) // 3)\r\nelse:\r\n print(n1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\na, b = 0, 0\r\nfor i in range(n):\r\n\tif s[i] == 1:\r\n\t\ta += 1\r\n\telse:\r\n\t\tb += 1\r\nres = min(a, b)\r\na -= res\r\nres += a // 3\r\nprint(res)\r\n", "n=int(input())\r\nn1=list(map(int,input().split()))\r\na1=n1.count(1)\r\na2=n1.count(2)\r\nif(a1>a2):\r\n\ta1=a1-a2\r\n\tprint(a2+a1//3)\r\nelif(a1==a2):\r\n\tprint(a2)\r\nelif(a1<a2):\r\n\tprint(a1)", "number_of_groups=int(input())\r\ngroups=list(map(int, input().split()))\r\none=groups.count(1)\r\ntwo=groups.count(2)\r\nif two>=one:\r\n print (one)\r\nelse:\r\n print (two+(one-two)//3)", "n = int(input())\nA = list(map(int, input().split()))\na = A.count(2)\nb = n - a\nif a > b:\n print(b)\nelse:\n print(a + (b - a) // 3)", "n=int(input())\r\nl=input().split()\r\nc2=l.count(\"2\")\r\nc1=l.count(\"1\")\r\nr=min(c2,c1)\r\nprint(r+(c1-r)//3)", "n=int(input())\r\nnumbers=[int(i) for i in input().split()]\r\nnum1=numbers.count(1)\r\nnum2=numbers.count(2)\r\ntot=0\r\nif num1>num2:\r\n tot=num2\r\n if num1-num2>2:\r\n tot+=(num1-num2)//3\r\nelse:\r\n tot=num1\r\nprint(tot)", "def solution(n, arr):\r\n ans = 0\r\n num_of_ones = 0\r\n num_of_twos = 0\r\n for i in range(n):\r\n if arr[i] == 1:\r\n num_of_ones += 1\r\n else:\r\n num_of_twos += 1\r\n\r\n min_val = min(num_of_ones, num_of_twos)\r\n diff = num_of_ones - min_val\r\n\r\n if diff >= 3:\r\n ans = diff // 3\r\n\r\n return min_val + ans\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().strip().split(\" \")]\r\nprint(solution(n, arr))", "n = int(input())\na = list(map(int, input().split()))\n\ngroups_of_one = a.count(1) \ngroups_of_two = a.count(2) \n\nmax_teams = 0\n\nmax_teams += min(groups_of_one, groups_of_two)\n\ngroups_of_one -= max_teams\ngroups_of_two -= max_teams\n\nmax_teams += groups_of_one // 3\n\nprint(max_teams)\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\ntmp = min(a.count(\"1\"), a.count(\"2\"))\r\nprint(tmp+(a.count(\"1\")-tmp)//3)\r\n", "input()\r\ndata=[0,0,0]\r\nfor i in input().split():\r\n i=int(i)\r\n data[i]+=1\r\nif data[2]>=data[1]:\r\n print(data[1])\r\nelse:\r\n print((data[1]-data[2])//3+data[2])", "input();a=list(map(int,input().split()))\r\nx,y=a.count(1),a.count(2);z=min(x,y)\r\nprint(z+(x-z)//3)", "n=int(input());l=list(map(int,input().split()))\r\nones,twos=l.count(1),l.count(2)\r\nprint(min(ones,twos)+(ones-min(ones,twos))//3)", "n = int(input())\n\ngroup = list(map(int, input().split()))\n\nif group.count(1) <= group.count(2):\n\tprint(group.count(1))\nelse:\n\tprint(group.count(2) + (group.count(1)-group.count(2))//3)\n", "#n, k = map(int, input().split(\" \"))\r\n#L = [int(x) for x in input().split()]\r\n\r\nn = int(input())\r\nct = [0,0]\r\nfor x in input().split() :\r\n ct[int(x) - 1] += 1 \r\n\r\nans = min(ct[:])\r\nct[0] -= ans\r\nct[1] -= ans\r\nans += ct[0] // 3\r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\ncounter = 0\n\nones = 0\ntwos = 0\nfor i in list(map(int, input().split())):\n if i == 1:\n ones += 1\n elif i == 2:\n twos += 1\n\nwhile ones > 0 and twos > 0:\n ones -= 1\n twos -= 1\n counter += 1\n\nwhile ones - 2 > 0:\n ones -= 3\n counter += 1\n\nprint(counter)\n", "n = int(input())\r\none = 0\r\ntwo = 0\r\nfor i in list(map(int, input().split())):\r\n if i == 1:\r\n one += 1\r\n else:\r\n two += 1\r\nprint(min(one, two) + (one - min(one, two)) // 3)\r\n\r\n\r\n\r\n\r\n'''\r\nx = 5, k = 1\r\n12 11 10 -- a\r\n0 1 2 -- r(sort)\r\n2 2 2 -- c(sort)\r\nd = 6 == (sum(c)) - ������ ���� (����)\r\n���� sum(r) / k >= d:\r\n ����� d ����������� ���� ������ �� r (� �����������) -- for �������\r\n�����\r\n �������� �������� ����� ������ ������� x (������� ������ ������ ����)\r\n \r\n14 14 14\r\n\r\n4 4 4\r\n\r\n0 2 4\r\n0 1 0\r\n0 0 0\r\n'''", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif l.count(2)<l.count(1) and l.count(2)!=0:\r\n print(l.count(2)+(l.count(1)-l.count(2))//3)\r\nelif l.count(1)<l.count(2) and l.count(1)!=0:\r\n print(l.count(1))\r\nelif l.count(1)==l.count(2):\r\n print(l.count(1))\r\nelif l.count(1)>=3:\r\n print(l.count(1)//3)\r\nelse:\r\n print(\"0\")\r\n", "n = int(input())\nlista = [int(i) for i in input().split()]\ndoses = sum(lista) - len(lista)\nunos = len(lista) - doses\nif unos <= doses:\n print(unos)\nelse:\n print(doses + (unos - doses)//3)", "z = int(input())\r\nn = list(map(int,input().split()))\r\ntwo = 0;\r\none = 0\r\nfor x in n:\r\n if(x == 1):\r\n one+=1;\r\n else:\r\n two+=1\r\n\r\n\r\nans = 0\r\nans += min(one,two)\r\n\r\none-=ans;\r\nans+=one//3\r\nprint(ans)", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nn1 = l.count(1)\r\nn2 = l.count(2)\r\n\r\nif n2 < n1:\r\n\tprint(n2 + (n1 - n2) // 3)\r\n\texit()\r\nif n2 == n1:\r\n\tprint(n2)\r\n\texit()\r\nif n1 < n2:\r\n\tprint(n1)\r\n\texit()", "input()\nL = list(map(int, input().split()))\nans = min(L.count(2), L.count(1))\nans += max(0, (L.count(1) - ans)//3)\nprint(ans)", "n = int(input())\npupils = list(map(int, input().split()))\ntwos = pupils.count(2)\nones = pupils.count(1)\nif twos > ones:\n\tprint(ones)\n\texit()\nprint(twos + (ones - twos)//3)\n", "f=lambda:map(int,input().split())\r\nn=int(input())\r\nl=list(f())\r\nn1,n2=l.count(1),l.count(2)\r\nprint([n1,n2+(n1-n2)//3][n1>n2])\r\n", "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\nu, v = 0, 0\r\nfor i in a:\r\n if i % 2:\r\n u += 1\r\n else:\r\n v += 1\r\nm = min(u, v)\r\nu, v = u - m, v - m\r\nans = m + u // 3\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nx=s.count('1')\r\ny=s.count('2')\r\n\r\nif x > y:\r\n print(y+(x-y)//3)\r\nelse:\r\n print(x)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nones,twos = 0,0\r\n\r\nfor i in a:\r\n if i == 1:\r\n ones += 1\r\n else:\r\n twos += 1\r\n\r\nif twos == 0:\r\n print(ones//3)\r\nelif ones == 0:\r\n print(0)\r\nelse:\r\n mn = min(ones,twos)\r\n print(mn + (ones - mn)//3)", "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 operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n ct = Counter(A)\r\n\r\n # max(1s//3, min(2s, 1s) + (1s-min(2s,1s))//3)\r\n print(min(ct[2], ct[1]) + (ct[1] - min(ct[2], ct[1]))//3)\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nnew = {1:0, 2:0}\r\nfor i in li:\r\n new[i] += 1\r\n\r\nif new[1] > new[2]:\r\n print(new[2] + (new[1] - new[2])//3)\r\nelse:\r\n print(new[1])\r\n\r\n", "n = int(input())\r\none=0\r\ntwo=0\r\n\r\nl = [int(x) for x in input().split()]\r\nans = 0\r\n\r\nfor x in l:\r\n if x == 1:\r\n one += 1\r\n else:\r\n two += 1\r\n \r\nans += min(one,two)\r\n\r\none -= ans\r\np = int(one/3)\r\nans += p\r\n\r\nprint(ans)\r\n\r\n", "input()\r\nos, ts =0,0\r\nfor x in input().split():\r\n if int(x)==1:os+=1\r\n else: ts +=1\r\nif os <ts:\r\n print(os)\r\nelse:\r\n os -=ts\r\n print(ts+os//3)", "_ = int(input())\r\nv = list(input().split())\r\ntwo = v.count('2')\r\none = v.count('1')\r\nif two > one:\r\n\tprint(one)\r\nelse:\r\n\tprint(two + (one-two)//3)\r\n", "num = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nones = sum(1 for i in arr if i == 1)\r\ntwos = num - ones\r\n\r\nans = max(ones // 3 + min(ones % 3, twos), min(ones, twos) + (ones - min(ones, twos)) // 3)\r\n\r\nprint(ans)\r\n", "if __name__ == '__main__':\r\n n = input()\r\n a = input()\r\n num1 = a.count('1')\r\n num2 = a.count('2')\r\n ans = min(num1,num2) + max(num1-num2,0)//3\r\n print(ans)", "n = int(input())\nA = input()\na = A.count('2')\nb = A.count('1')\nprint(min(a,b)+(b-min(a,b))//3)\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\nnums=list(map(int, input().split()))\ntwos = nums.count(2)\nones = nums.count(1)\n\nif twos == ones:\n print(twos)\nelif twos > ones:\n print(ones)\nelif ones > twos:\n if (ones-twos)>=3:\n print(twos+((ones-twos)//3))\n elif ones-twos <3:\n print(twos)\nelse:\n print(0)\n \n\n\n\n\n\n\n\n\"\"\"if twos == 0 and one <= 2:\n print (0)\nelif :\n print(twos)\nelif ones > twos:\n print(twos)\nelif twos > ones:\n if (twos-ones)>2:\n print(twos+((twos-ones)//2))\n elif (twos-ones)<2:\n print(ones)\nelif :\n print(0)\"\"\"", "n = int(input())\r\na = input().split(\" \")\r\nc1 = 0\r\nc2 = 0\r\nfor x in a:\r\n if(x == \"1\"):\r\n c1 += 1\r\n else:\r\n c2 += 1\r\ng1 = min(c1, c2)\r\nprint(g1 + (c1 - g1)//3)\r\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\na, b = 0, 0\r\nfor x in v:\r\n if x == 1:\r\n a += 1\r\n else:\r\n b += 1\r\nprint(min(a, b) + (a-min(a, b))//3)", "input()\na=[0,0]\nfor x in input().split():a[int(x)-1]+=1\nc=min(a)\nprint(c+(a[0]-c)//3)\n \t \t \t\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\nx=r.count(1);y=n-x\r\nprint(min(x,y)+max(0,x-y)//3)\r\n", "n = int(input())\narr = list(map(int, input().split()))\nz2 = arr.count(2)\nz1 = arr.count(1)\nprint(min(z2, z1) + (z1 - min(z1, z2)) // 3)", "n=int(input())\r\nk1=0\r\nk2=0\r\nfor i in map(int,input().split()):\r\n if i==1:\r\n k1+=1\r\n else:\r\n k2+=1\r\nif k2>=k1:\r\n print(k1)\r\nelse:\r\n print(k2+(k1-k2)//3)\r\n \r\n", "x = int(input())\r\nl = [int(i) for i in input().split()]\r\nres=min(l.count(1), l.count(2))\r\nprint(res+(l.count(1)-res)//3)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nc1 = 0; c2 = 0; ans = 0\r\nfor i in arr:\r\n if i == 1: c1 += 1\r\n else: c2 += 1\r\nans += min(c1,c2)\r\nc1 -= ans\r\nans += c1//3\r\nprint(ans)\r\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\na = li.count(1)\r\nb = li.count(2)\r\nc =0\r\nfor i in range(min(a,b)):\r\n if a>0 and b>0:\r\n c+=1\r\n a-=1\r\n b-=1\r\nc+=a//3\r\nprint(c)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = a.count(2)\r\nb = a.count(1)\r\nans = min(b,c)\r\nb = b-ans\r\n\r\nprint(ans+b//3)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={1:0,2:0}\r\nfor i in range(n):\r\n d[l[i]]+=1\r\nc=min(d[1],d[2])\r\nd[1],d[2]=d[1]-c,d[2]-c\r\nif(d[1]-d[2]>0):\r\n c+=(d[1]-d[2])//3\r\nprint(c)\r\n", "input()\r\nA = input()\r\n\r\nones = A.count('1')\r\ntwos = A.count('2')\r\nx = min(ones, twos)\r\n\r\nprint(x + (ones-x)//3)", "import math\r\nn=int(input())\r\non=0\r\ntw=0\r\nx=list(map(int, input().split()))\r\nfor i in range(0,n):\r\n if x[i]==1:\r\n on+=1\r\n else:\r\n tw+=1\r\nif tw>=on:\r\n tw-=on\r\n print(on)\r\nelse:\r\n on-=tw\r\n print(tw+math.floor(on/3))", "import math\r\n\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nc1=c2=0\r\nfor j in a:\r\n if j==1:\r\n c1+=1\r\n else :\r\n c2+=1\r\nif c1==c2:\r\n print(c1)\r\nelif c1>c2:\r\n c1=c1-c2\r\n z=math.floor(c1/3)\r\n print(c2+z)\r\nelse :\r\n print(c1)" ]

[ "import sys\r\n'''\r\nSEGMENT TREE\r\nAssign\r\n'''\r\nclass SegmTree():\r\n '''\r\n - modify elements on interval\r\n - get single element\r\n '''\r\n def __init__(self, size):\r\n N = 1\r\n while N < size:\r\n N <<= 1\r\n self.N = N\r\n self.tree = [0] * (2*N)\r\n\r\n def modify_range(self, l, r, value):\r\n l += self.N\r\n r += self.N\r\n while l < r:\r\n if l & 1:\r\n self.tree[l] = value\r\n l += 1\r\n if r & 1:\r\n r -= 1\r\n self.tree[r] = value\r\n l >>= 1\r\n r >>= 1\r\n \r\n def query(self, i):\r\n i += self.N\r\n latest_change = self.tree[i]\r\n p = i\r\n while p > 1:\r\n p >>= 1\r\n latest_change = max(latest_change, self.tree[p])\r\n return latest_change\r\n\r\n# inf = open('input.txt', 'r')\r\n# reader = (map(int, line.split()) for line in inf)\r\nreader = (map(int, line.split()) for line in sys.stdin)\r\ninput = reader.__next__\r\n\r\nn, m = input()\r\na = list(input())\r\nb = list(input())\r\nst = SegmTree(n)\r\nrequest = [None] * (m + 1)\r\nfor i in range(1, m+1):\r\n t, *arg = input()\r\n if t == 1:\r\n x, y, k = request[i] = arg\r\n st.modify_range(y-1, y-1+k, i)\r\n else:\r\n pos = arg[0] - 1\r\n req_id = st.query(pos)\r\n if req_id > 0:\r\n x, y, k = request[req_id]\r\n ans = a[x+(pos-y)]\r\n else:\r\n ans = b[pos]\r\n sys.stdout.write(f'{ans}\\n')\r\n\r\n# inf.close()\r\n", "import sys\r\ninput=sys.stdin.readline\r\n# sys.setrecursionlimit(0x0FFFFFFF)\r\n# import threading\r\n# threading.stack_size(0x04000000)\r\nimport bisect\r\nif __name__==\"__main__\":\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n query=[[0,1,0]]\r\n for _ in range(m):\r\n f=list(map(int,input().split()))\r\n if f[0]==2:\r\n i=f[1]-1\r\n idx=bisect.bisect(query,[i,n+1])\r\n start,arr,shift=query[idx-1]\r\n\r\n print(b[i]) if arr==1 else print(a[i+shift])\r\n elif f[0]==1:\r\n i=f[2]-1\r\n left=bisect.bisect(query,[i,0])\r\n right=bisect.bisect(query,[i+f[3],n+1])\r\n query[left:right]=[[i,0,f[1]-f[2]],[i+f[3],query[right-1][1],query[right-1][2]]]" ]

[ "n = int(input())\r\nprint((3**(3*n)-7**n) % (int(1e9)+7))", "def small(a, x):\r\n if x<10:\r\n return (a**x)%(10**9+7)\r\n if x%2==0:\r\n return (small(a, x//2)*small(a, x//2))%(10**9+7)\r\n else:\r\n return (a*small(a, x//2)*small(a, x//2))%(10**9+7)\r\n\r\ndef rec(a, b, x):\r\n if x<10:\r\n return (a**x-b**x)%(10**9+7)\r\n if x%2==0:\r\n return rec(a, b, x//2)*(small(a, x//2)+small(b, x//2))%(10**9+7)\r\n else:\r\n return (small(a, x)%(10**9+7)-small(b, x)%(10**9+7))%(10**9+7)\r\n\r\nn=int(input())\r\nprint(rec(27, 7, n))\r\n", "MOD=pow(10,9)+7\r\nn=int(input())\r\nprint((pow(3,3*n)-pow(7,n))%MOD)", "n = int(input())\r\nprint((3**(3*n) - (7**n))%int(1e9 + 7))", "n = int(input())\r\nprint((27**n-7**n)%(10**9+7))\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn=int(input())\r\nrslt=(3**(3*n) - 7**n) % (10**9 +7)\r\nprint(rslt)", "n = int(input())\r\nprint((27 ** n - 7 ** n) % 1000000007)", "n = int(input())\nmod = 1000000007\n\ncoins = pow(3,3*n)\nex = pow(7,n)\n\nprint((coins-ex)%mod)\n\t \t \t \t\t\t \t \t\t \t \t \t\t\t\t \t\t\t", "_=int(input())\r\nprint((pow(27,_)-pow(7,_))%1000000007)", "n = int(input())\r\nprint((pow(3, n * 3) - pow(7, n)) % (pow(10, 9) + 7))\r\n", "n = int(input())\nx = (3**(3*n) - 7**n)%(1000000007)\nprint(x)\n \t\t \t\t\t\t\t\t\t \t\t\t\t\t \t\t", "n = int(input())\npow = (3**(3*n)-7**n)%1000000007\nprint(pow)\n \t \t\t \t\t \t \t \t\t\t\t \t\t \t\t", "n = int(input())\nremainder = (27**n - 7**n) % (10**9 + 7)\nprint(remainder)\n\n\t\t \t\t\t\t \t\t\t \t\t \t\t\t \t \t", "import math\r\n\r\nglobal tmod\r\ntmod = math.pow(10, 9) + 7\r\n\r\ndef calcPow(a, b):\r\n res = 1\r\n for i in range(b):\r\n res = (res * a) % tmod\r\n return res\r\n\r\n\r\n\r\nn = int(input())\r\n# 27 posibles combinaciones\r\n# 7 no son posbiles, ya que suman 6\r\nres = (calcPow(27, n) - calcPow(7, n) + tmod)%tmod \r\nprint(f\"{int(res)}\")\r\n", "\r\nn = int(input())\r\nx = 1000000000+7\r\n\r\nprint( (3**(3*n) - 7**(n) ) % x )", "n = int(input())\r\n\r\nprint((3**(3*n) - 7**n) % (10**9 + 7))", "n = int(input())\r\nans = 0\r\nx,y = 1,1\r\nmod = 1000000000+7\r\nfor i in range(n):\r\n x=(x*3)%mod\r\n y=(y*7)%mod\r\nx=x*x*x\r\nprint((x-y)%mod)", "number=int(input())\r\n#get the result\r\n#need to find out how many ways to make 6 & need to subtract total number ways\r\n#6 will be made 1, 2 , 3 so the combination is 3! that is 6 & one another combination is 2, 2 , 2 so tal is 7, so 7 combination over n\r\n#how many nuber of n that is 3n & they can chose any 3 number between 1 to 3 so the combination is\r\n#3^3oever n that is 27^n factorail\r\nprint((27**number-7**number)%int(1e9+7))\r\n", "p = 10**9+7\r\nn = int(input())\r\nanswer = (pow(27, n, p)-pow(7, n, p)) % p\r\nprint(answer)", "\"\"\"\nAndrea Catalina Fernandez Mena\nThomas Freund Paternostro\nRoberto Calleja Pedraza\n\n\"\"\"\n#the number of the gnomes divided by three\nn = int(input())\nres, a, b, mod = 1, 1, 1, 10**9 + 7\n\n# Definición de posible cantidad de monedas por gnomo\nfor i in range(n * 3):\n a = (a * 3) % mod\n\nfor i in range(n):\n b = (b * 7) % mod\n\nres = (a - b + mod) % mod\nprint(res)\n\n\t\t \t\t\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\nmod = pow(10, 9) + 7\r\nans = (pow(3, 3 * n, mod) - pow(7, n, mod)) % mod\r\nprint(ans)", "n = int(input())\r\nprint((3**(3*n) - 7**n)%int(1e9+7))\r\n", "n = int(input())\r\ncomb = 27**n - 7**n\r\nprint(comb % 1000000007)# 1690715475.921026", "n = int(input())\n\nnFormas = ((27**n - 7**n) % (10**9 + 7))\n\nprint(nFormas)\n\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\nM = 1000000007\r\nn = int(input())\r\nprint((pow(27, n, M)-pow(7, n, M))%M)", "n = int(input())\r\n\r\nMOD = 10**9 + 7\r\n\r\nans = pow(27, n, MOD) - pow(7, n, MOD)\r\nans %= MOD\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 11 10:19:09 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 62 - CF584-DIV2B\r\n\"\"\"\r\n\r\nn = int(input())\r\nans = 0\r\ntot = 1\r\nuns = 1\r\nM = int(1e9 + 7)\r\nfor i in range(n):\r\n tot = (tot*27)%M\r\n uns = (uns*7)%M\r\n ans = (tot-uns)%M\r\nprint(ans%M)", "n = int(input())\n\nNformas = ((27**n - 7**n) % (10**9 + 7))\n\nprint (Nformas)\n\t\t \t \t \t \t\t\t \t \t \t \t\t", "'''\r\nBeezMinh\r\n22:00 UTC+7\r\n19/08/2023\r\n'''\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip()\r\nn = int(input())\r\nprint((27 ** n - 7 ** n) % (10 ** 9 + 7))", "n = int(input(\"\"))\r\na = pow( 27, n )\r\nb = pow( 7, n )\r\nm = (pow (10, 9) + 7 )\r\nprint( (a - b) % m )", "number = int(input())\r\nprint( (3**(3*number) - (7**number) ) % (10**9 + 7 ) )", "import io, os, sys\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input().decode())\r\n\r\nsys.stdout.write(str((3**(3*n) - 7**n) % 1000000007))", "from operator import mod\n\ntriangles = int(input())\n\ntotal_comb = pow(3,3*triangles)\ndisatisfaction = pow(7,triangles)\n\ntotal_satisfaction = total_comb - disatisfaction\nres = mod(total_satisfaction, pow(10,9)+7)\n\nprint(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\n\r\nprint((pow(27, n) - pow(7, n)) % (pow(10, 9) + 7))", "md = 1000000007\n\ndef bigmd(b, p):\n res = 1\n rem = b\n while p:\n if p % 2 == 1:\n res = (res * rem) % md\n p -= 1\n rem = (rem * rem) % md\n p >>= 1\n return res\n\nn = int(input())\np = n\n\nans = ((bigmd(27, p) - bigmd(7, n)) + md) % md\n\nprint(ans)\n\n\t\t \t \t\t \t \t \t\t \t \t \t", "MOD = 1000000007\n\ndef mod_pow(x, y):\n a = 1\n x = x % MOD\n while y > 0:\n if y & 1:\n a = (a * x) % MOD\n y = y >> 1\n x = (x * x) % MOD\n return a\n\nn = int(input())\nk = mod_pow(3, 3*n)\nl = mod_pow(7, n)\na = (k - l) % MOD\nprint((a % MOD + MOD) % MOD)\n\n\t \t \t \t \t \t\t\t \t\t\t\t \t\t\t", "n=int(input())\r\nprint((pow(3,3*n,10**9+7)-pow(7,n,10**9+7)+(10**9+7))%(10**9+7))", "n= int(input()); print((3**(3*n) - (7**n))%1000000007)", "# LUOGU_RID: 103165456\nn, m = int(input()), 1000000007\r\nprint((pow(27, n, m) - pow(7, n, m)) % m)", "import sys\r\n\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n = int(read())\r\n print(((3 ** (3 * n) % (10 ** 9 + 7)) - (7 ** n % (10 ** 9 + 7))) % (10 ** 9 + 7))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\n\nans = 3**(3*n) - 7**n\nans %= 1000000007\nprint(ans)\n \t \t\t \t\t \t \t\t \t\t" ]

[ "import re\ndef solve(s):\n return re.sub(r'ogo(?:go)*','***',s)\n \n\n \n\n \ndef main() :\n n = input()\n s = input()\n # arr = list(map(int, input().split(' ')))\n # arr = []\n # for _ in range(4):\n # i = input()\n # arr.append(i)\n print(solve(s))\nmain()\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\nn%4 == 0 and all_cnts <= n//4\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n s = I().strip()\r\n ans = []\r\n\r\n l = 0\r\n while l < n:\r\n # print(l, s[l:])\r\n if l+2 < n and s[l:l+3] == 'ogo':\r\n l += 3\r\n for i in range(l, n-1, 2):\r\n if s[i:i+2] == 'go':\r\n l = i+2\r\n else:\r\n break\r\n ans.append('***')\r\n else:\r\n ans.append(s[l])\r\n l += 1\r\n WNS(ans)\r\n\r\n\r\nsolve()", "#!/usr/bin/env python3\n\nfrom sys import stdin\nimport re\n\n\ndef main():\n n, = stdin_get_ints_from_line()\n s = stdin_get_string_from_line()\n\n print(re.sub(r'(ogo((go)+)?)', '***', s))\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\ns = input()\r\n\r\nwhile 'ogo' in s:\r\n x = s.replace(\"ogo\" , \"***\" , 1)\r\n while x!=s:\r\n s = x\r\n x = s.replace(\"*go\" , '*')\r\n\r\n\r\nprint(s)", "from math import ceil\r\nn = int(input())\r\nx = input()\r\np = ['ogo']+['ogo'+'go'*i for i in range(1,50)]\r\nj = ceil((n-3)/2)\r\nif n<3:\r\n print(x)\r\nelse:\r\n for i in range(100, 0, -1):\r\n ss = 'o' + 'go' * i\r\n while ss in x:\r\n x = x.replace(ss,'***')\r\n print(x)\r\n ", "n = int(input().strip());\r\ns = input();\r\nwhile s.find(\"ogo\") != -1:\r\n temp = s.find(\"ogo\");\r\n tempa = s[temp + 3:];\r\n if s[temp + 3:temp +5] == \"go\":\r\n s = s[0:temp];\r\n s += \"o\";\r\n s += tempa;\r\n else:\r\n s = s[0:temp];\r\n s += \"***\";\r\n s += tempa;\r\nprint(s);\r\n", "n = int(input())\r\ns = input()\r\nstrings = ['ogo']\r\nfor i in range(50):\r\n strings += [strings[-1] + 'go']\r\nfor i in range(len(strings) - 1, -1, -1):\r\n if len(strings[i]) <= len(s):\r\n s = s.replace(strings[i], '***')\r\nprint(s)", "n, a = int(input()), input()\nfor i in range(n // 2, 0, -1):\n a = a.replace('og' * i + \"o\", \"***\")\nprint(a)", "n, s = int(input()) // 2, input()\r\nwhile n:\r\n s = s.replace('og' * n + 'o', '***')\r\n n -= 1\r\nprint(s)\r\n", "from collections import deque\r\n\r\nn = int(input())\r\nfrase = input()\r\nlista = deque()\r\nans = \"\"\r\ncont = 0\r\nwhile(cont < n):\r\n lista.append(frase[cont])\r\n if(len(lista) == 4):\r\n ans += lista.popleft()\r\n if(len(lista) == 3):\r\n if(lista[0] == \"o\" and lista[1] == \"g\" and lista[2] == \"o\"):\r\n ans += \"***\"\r\n lista = deque()\r\n while(True):\r\n try:\r\n if frase[cont + 1] == \"g\" and frase[cont + 2] == \"o\":\r\n cont += 2\r\n else:\r\n break\r\n except:\r\n break\r\n \r\n \r\n \r\n\r\n cont += 1\r\nwhile(len(lista) > 0):\r\n ans += lista.popleft()\r\n\r\nprint(ans)\r\n", "if __name__ == '__main__':\r\n n, s = int(input()), input()\r\n result_array = []\r\n left = 0\r\n while left <= n - 3:\r\n if s[left: left + 3] == 'ogo':\r\n left += 3\r\n if left >= n:\r\n result_array.append('***')\r\n break\r\n while left + 1 < n and s[left: left + 2] == 'go':\r\n left += 2\r\n result_array.append('***')\r\n else:\r\n result_array.append(s[left])\r\n left += 1\r\n while left < n:\r\n result_array.append(s[left])\r\n left += 1\r\n print(''.join(result_array))", "ans = [\"ogo\",\"ogogo\",\"ogogogo\",\"ogogogogo\",\"ogogogogogo\",\"ogogogogogogo\",\"ogogogogogogogo\",\"ogogogogogogogogo\",\"ogogogogogogogogogo\",\"ogogogogogogogogogogo\",\"ogogogogogogogogogogogo\",\"ogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\"]\r\nn = int(input())\r\ns = input()\r\nfor i in range(len(ans) - 1, -1, -1):\r\n s = s.replace(ans[i], \"***\")\r\nprint(s)", "n = int(input())\r\na = input()\r\nc = []\r\nfor i in range(0, n):\r\n c.append([a[i]])\r\n\r\nfor i in range(0, n - 2):\r\n if a[i] == 'o' and a[i + 1] == 'g' and a[i + 2] == 'o':\r\n c[i].append(\"*\")\r\n c[i + 1].append(\"*\")\r\n c[i + 2].append(\"*\")\r\n else:\r\n c[i].append(a[i])\r\n c[i + 1].append(a[i + 1])\r\n c[i + 2].append(a[i + 2])\r\n\r\nk = []\r\nfor i in range(0, n):\r\n k.append([])\r\n\r\nfor i in range(0, n - 1):\r\n if '*' in c[i]:\r\n if (c[i][0] == 'o' and c[i + 1][0] == 'g') or (c[i][0] == 'g' and c[i + 1][0] == 'o'):\r\n k[i].append('*')\r\n else:\r\n k[i].append(c[i][0])\r\nif '*' not in c[n - 1]:\r\n k[n - 1].append(c[n - 1][0])\r\n\r\np = []\r\nh = 0\r\nfor i in range(0, n):\r\n if '*' in k[i]:\r\n h += 1\r\n if h <= 3:\r\n p.append('*')\r\n elif k[i] == []:\r\n h += 1\r\n if h <= 3:\r\n p.append('*')\r\n h = 0\r\n else:\r\n h = 0\r\n p.append(k[i][0])\r\n\r\nfor i in range(0, len(p)):\r\n print(p[i], end = \"\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\nimport re\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\n\r\nw = re.sub(r'o(go)+', '***', s)\r\n\r\nprint(w)", "input()\r\ns = input()\r\n\r\nl = []\r\nst = 'ogo'\r\nfor i in range(0, 100):\r\n\tl.append(st)\r\n\tst += 'go'\r\nl.reverse()\r\nfor e in l:\r\n\ts = s.replace(e, '*')\r\ns = s.replace('*', '***')\r\nprint(s)", "n = int(input())\r\ntext = input()\r\nparazit = ''\r\nfor i in range(n):\r\n if text[i:i+3] == 'ogo':\r\n parazit = 'o'\r\n while text[i+1:i+3] == 'go':\r\n parazit += text[i+1:i+3]\r\n i += 2\r\n text = text.replace(parazit, '***', 1)\r\nprint(text)\r\n", "n = int(input())\ns = input().strip()\n\nrez = ''\ni = 0\nwhile i < len(s):\n\tif s[i:i + 3] == 'ogo':\n\t\tj = i + 3\n\t\twhile s[j:j + 2] == 'go':\n\t\t\tj += 2\n\t\ti = j\n\t\trez += '***'\n\telse:\n\t\trez += s[i]\n\t\ti += 1\n\nprint(rez)", "import re\r\nn = int(input())\r\ns = input()\r\nprint(re.sub(\"o(go)+\",\"***\",s))", "from re import sub\n\nnum, interview = int(input()), input()\n\nparasite = r\"ogo(go)+|ogo\"\n\nprint(sub(parasite, \"***\", interview))\n", "n = int(input())\r\n\r\ns = list(input())\r\n\r\ni = 0\r\n\r\nwhile i < len(s)-2:\r\n if s[i] == 'o':\r\n if s[i+1] == 'g':\r\n if s[i+2] == 'o':\r\n s[i] = '*'\r\n s[i+1] = '*'\r\n s[i+2] = '*'\r\n try:\r\n while s[i+3] == 'g' and s[i + 4] == 'o':\r\n del s[i + 4]\r\n del s[i+3]\r\n\r\n except:\r\n IndexError\r\n\r\n i += 1\r\n\r\nprint(*s, sep='')", "n = int(input())\r\ns = input()\r\nwhile s.find('ogo') != -1:\r\n s = s.replace('ogo', '***', 1)\r\n while s.find('***go') != -1:\r\n s = s.replace('***go', '***', 1)\r\nprint(s)\r\n", "n=int(input())\r\nst=input()\r\nwhile st.count('ogo')>0:\r\n st=st.replace('ogo'+'go'*(n-1) , '***')\r\n n-=1\r\nprint(st)\r\n \r\n", "#Name:S.M.MILOY\r\n#Department Of CSE,BRUR\r\n#a,b=list(map(int,input().split()))\r\n#l=list(map(int,input().split(' ')))\r\n#n=int(z())\r\nz=input\r\n#for i in range(n):\r\nfrom math import gcd\r\n\r\nn=int(z())\r\nl=z()\r\n\r\np='ogo'\r\nfor i in range(n,-1,-1):\r\n r=p+(i*'go')\r\n if r in l:\r\n l =l.replace(r, '***')\r\n \r\nprint(l)\r\n", "n,f,q,w,string = int(input()),input().strip(),0,0,''\r\nfor i in range(n):\r\n if q:\r\n q -= 1\r\n elif f[i:i + 3] == 'ogo':\r\n q,w = 2,1\r\n string += '***'\r\n elif w and f[i:i + 2] == 'go':\r\n q = 1\r\n else:\r\n string += f[i]\r\n w = 0\r\nprint(string)", "import re\nn = int(input())\ns = input()\nprint(re.sub(\"ogo(?:go)*\", \"***\", s))", "n=int(input())\r\ns=input()\r\npar=\"o\"+\"go\"*(len(s)//2)\r\nwhile len(par)>2:\r\n\ti=0\r\n\twhile par in s:\r\n\t\ts=s.replace(par,\"***\")\r\n\tpar=par[:-2]\r\n\ti+=1\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\nwhile n > 0:\r\n s = s.replace('ogo' + (n-1)*'go', '***')\r\n n -= 1\r\nprint(s)", "input()\r\nxs = input()\r\n\r\nout = \"\"\r\n\r\ni = 0\r\nwhile i < len(xs):\r\n if xs[i] == 'o':\r\n if i < len(xs) - 2 and xs[i+1] == 'g' and xs[i+2] == 'o':\r\n out += \"***\"\r\n i += 1\r\n while i < len(xs) - 1 and xs[i] == 'g' and xs[i+1] == 'o':\r\n i += 2\r\n else:\r\n out += xs[i]\r\n i += 1\r\n else:\r\n out += xs[i]\r\n i += 1\r\n\r\nprint (out)\r\n", "n=int(input())\r\ns=input()\r\nch='ogo'+'go'*((n-3)//2)\r\nwhile len(ch)>=3:\r\n s=s.replace(ch,'***')\r\n ch=ch[:len(ch)-2]\r\n\r\nprint(s)\r\n \r\n", "n = int(input())\r\ns = ''\r\ns+=input()\r\nfor i in range(int(n/2), 0, -1):\r\n a = 'o' + 'go'*i\r\n while s.find(a)>=0:\r\n s=s.replace(a, '***')\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\ni = 0\r\nwhile i < n - 2:\r\n if s[i:i + 3] == \"ogo\":\r\n j = i + 3\r\n while j < n - 1 and s[j:j + 2] == \"go\":\r\n j += 2\r\n s = s[:i] + \"***\" + s[j:]\r\n i = j + 2 - (n - len(s) + 3)\r\n n = len(s)\r\n else:\r\n i += 1\r\nprint(s)", "n = int(input())\r\ns = input()\r\ncheck = True\r\nans = \"\"\r\na = 0\r\nif n < 3:\r\n print(s)\r\nelse:\r\n for i in range(n):\r\n i += a\r\n if i > n - 1 and check:\r\n break\r\n if check:\r\n if s[i:i + 3] == \"ogo\":\r\n check = False\r\n a += 2\r\n ans += \"***\"\r\n if i == n - 3:\r\n break\r\n else:\r\n ans += s[i]\r\n else:\r\n if s[i:i + 2] != \"go\":\r\n a -= 1\r\n check = True\r\n else:\r\n a += 1\r\n if i == n - 2:\r\n break\r\nprint(ans)\r\n", "from re import sub\r\nn = int(input())\r\ns = input()\r\nprint(sub(r'ogo(go)*', '***', s))\r\n\r\n\r\n\r\n\r\n", "\n\ndef main():\n n_letras = int(input())\n palavra = list(input())\n n = 0\n nao_escreveu = True\n while(n < n_letras - 2):\n if(palavra[n] == \"o\"):\n while(n < n_letras - 2 and palavra[n+1] == \"g\" and palavra[n+2] == \"o\"):\n if(nao_escreveu):\n palavra[n] = \"*\"\n palavra[n+1] = \"*\"\n palavra[n+2] = \"*\"\n nao_escreveu = False\n else:\n palavra[n+1] = \"\"\n palavra[n+2] = \"\"\n n+=2\n \n nao_escreveu = True\n n+=1\n print(\"\".join(palavra))\n \nmain()\n\n\n\n\t\t\t\t\t \t \t\t\t \t\t \t\t\t\t \t", "n, w = int(input()), input()\r\nfor i in range(n //2, 0, -1):\r\n s = 'o' + 'go' * i \r\n if 'o' + 'go' * i in w:\r\n w = w.replace(s, '***')\r\nprint(w)", "n=int(input())\r\ns=input()\r\ni=0\r\nwhile i<n:\r\n if s[i:i+3]==\"ogo\":\r\n while s[i:i+3]==\"ogo\":\r\n i+=2\r\n print(\"***\",end=\"\")\r\n else:print(s[i],end=\"\")\r\n i+=1", "n = int(input())\r\ns = input()\r\nfor i in range(n, 0, -1):\r\n sss = \"og\"*i + \"o\"\r\n s = s.replace(sss, \"***\")\r\nprint(s)\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\ni = 0\r\nS = ''\r\nwhile i < n:\r\n if s[i:i+3] == 'ogo':\r\n i += 3\r\n S += '***'\r\n while i < n:\r\n if s[i:i+2] == 'go':\r\n i += 2\r\n else:\r\n break\r\n else:\r\n S += s[i]\r\n i += 1\r\nprint(S)\r\n", "import re\r\nn = input()\r\ns = input()\r\nres = re.sub(r'ogo(go)*', '***', s)\r\nprint(res)", "n = int(input())\r\ns = list(input())+ ['#']\r\nfor i in range(n-1):\r\n if s[i]+s[i+1]+s[i+2]=='ogo':\r\n s[i]='*'\r\n s[i+1]='*'\r\n s[i+2]='*'\r\n #print(s[i-1],s[i],s[i+1])\r\n if i>0 and s[i]+s[i+1]=='go' and (s[i-1]=='' or s[i-1]=='*'):\r\n s[i]=''\r\n s[i+1]=''\r\n #print(''.join(s))\r\nprint(''.join(s[:-1]))", "import re\nn = int(input())\n\ns = input()\n\nanswer = re.sub(r'o(go)*go{1}',\"***\",s)\nprint(answer)\n\t\t \t\t \t \t \t \t\t \t \t \t \t\t\t", "n = int(input())\ns = input()\n\ni = s.find(\"ogo\")\nfim = i+3\nwhile i != -1:\n\tfor k in range(i+3, n, 2):\n\t\tif s[k:k+2] == \"go\":\n\t\t\tfim += 2\n\t\telse:\n\t\t\tbreak\n\ts = s[:i] + \"***\" + s[fim:]\n\ti = s.find(\"ogo\")\n\tfim = i+3\n\nprint(s)\n \t \t \t\t \t\t \t \t\t\t", "n = int(input())\ns = input()\nans = 0\n\nfor i in range(n//2, -1, -1):\n s = s.replace(\"ogo\"+\"go\"*i, \"***\")\nprint(s)\n", "n = int(input())\r\ns = input()\r\nm = max((n - 1) // 2, 1)\r\na = [''] * m\r\na[0] = 'ogo'\r\nfor i in range(1, m):\r\n a[i] = a[i - 1] + 'go'\r\nfor pattern in a[::-1]:\r\n s = s.replace(pattern, '***')\r\nprint(s)\r\n", "n=int(input())\r\ns=input()\r\no=\"\"\r\ni=0\r\nwhile i+2<n:\r\n\tif s[i:i+3]==\"ogo\":\r\n\t\ti=i+3\r\n\t\to+=\"***\"\r\n\t\twhile(i+1<n and s[i:i+2]==\"go\"):\r\n\t\t\ti+=2\r\n\telse :\r\n\t\to+=s[i]\r\n\t\ti+=1\r\no+=s[i:]\t\t\r\nprint(o)\t\t", "a = int(input())\r\nb = input()\r\nfor i in range(a // 2 + 1,-1,-1):\r\n b = b.replace(\"ogo\" + \"go\" * i,\"***\")\r\nprint(b)", "letters = [\"o\", \"g\"]\r\nn = int(input())\r\ns = input()\r\na = 0\r\nwhile a < n:\r\n b = 0\r\n while a < n and s[a] == letters[b % 2]:\r\n a += 1\r\n b += 1\r\n if b >= 3:\r\n if b % 2 == 0:\r\n a -= 1\r\n b -= 1\r\n s = s[:a - b] + \"***\" + \" \" * (b - 3) + s[a:]\r\n elif b == 0:\r\n a += 1\r\ns = s.replace(\" \", \"\")\r\nprint(s)", "iii = input()\ns = input()\ni = s.find(\"ogo\")\nwhile(i >= 0):\n for j in range(i, i + 3):\n s = s[:i]+\"***\"+s[i+3:]\n j = i + 3\n while(s[j:j + 2] == \"go\"):\n s = s[:j]+s[j+2:]\n i = s.find(\"ogo\")\nprint(s)\n", "import re\r\nn=input()\r\ns=input()\r\nregex=re.compile(r'ogo(go)*')\r\nre.sub(regex,'***',s)\r\nprint(re.sub(regex,'***',s))\r\n", "a = int(input())\r\nb = input()\r\nw = ''\r\nfor i in b:\r\n w+=i\r\n if w and 'ogo' in w:\r\n w = w.replace('ogo' , '***' )\r\n if '***go' in w:\r\n w = w.replace('***go' , '***')\r\nprint(w)", "x=int(input())\r\ns=input()\r\na='ogo'\r\nb='go'\r\ncount=0\r\nfor i in range(len(s)):\r\n while count<=x:\r\n s=s.replace(a+b,a)\r\n count+=1\r\n \r\ns=s.replace('ogo','***')\r\nprint(s)\r\n ", "\r\nn = int(input())\r\n\r\n#l = list(input())\r\n# a better solution \r\n\r\nst = input()\r\nwhile n > 0:\r\n\tst = st.replace('ogo' + (n - 1) * 'go', '***')\r\n\tn -= 1\r\n\r\nprint(st)\r\n\r\n\r\n'''\r\n\r\nans = ''\r\ni = 0\r\nwhile i < n:\r\n\tif l[i] == 'o':\r\n\t\tj = i + 1\r\n\t\twhile j < n - 1 and l[j] == 'g' and l[j + 1] == 'o':\r\n\t\t\tj += 2\r\n\r\n\t\tif j - i > 1:\r\n\t\t\tans += '***'\r\n\t\t\ti = j\r\n\t\telse:\r\n\t\t\tans += l[i]\r\n\t\t\ti += 1\r\n\telse:\r\n\t\tans += l[i]\r\n\t\ti += 1\r\n\r\n'''\r\n", "import re\r\nint(input())\r\nprint(re.sub(r\"o(go)+\", \"***\", input()))", "n = int(input())\r\na = list(input())\r\np = ''\r\nans = ''\r\ni = 0\r\nwhile i < n:\r\n if len(p) == 0 and i <= n - 3 and a[i] == 'o' and a[i + 1] == 'g' and a[i + 2] == 'o':\r\n p = 'ogo'\r\n i += 3;\r\n while i < n - 1:\r\n if a[i] == 'g' and a[i + 1] == 'o':\r\n p += 'go'\r\n i += 2;\r\n else:\r\n ans += '***';\r\n p = ''\r\n break\r\n else:\r\n ans += '***'\r\n else:\r\n ans += a[i];\r\n i += 1\r\n\r\nprint(ans)", "n = int(input())\nstring = input()\nword = \"ogo\" + \"go\" * 56\nfor i in range(57):\n #print(word, word in string)\n string = string.replace(word, \"***\")\n word = word[:-2]\nprint(string)", "import re\r\nn = input()\r\nprint(re.sub(\"o(go)+\", \"***\", input()))\r\n", "n = int(input())\r\ns = input()\r\nfor i in range(100, 0, -1):\r\n ss = 'o' + 'go' * i\r\n while ss in s:\r\n ind = s.find(ss)\r\n s = s[:ind] + '***' + s[ind + len(ss):]\r\nprint(s)\r\n", "import re\r\na=input()\r\nb=input()\r\nprint(re.sub(r\"ogo(go)*\",\"***\",b))\r\n", "#\r\n# Created by Polusummator on 25.10.2020\r\n# --------- Little PyPy Squad ---------\r\n# Verdict: \r\n#\r\nn = int(input())\r\ns = input()\r\n# ans = ''\r\n# prev = ''\r\nfirst = 'o' + 'go' * n\r\n# print(first)\r\nwhile first != 'o':\r\n # print(first)\r\n s = s.replace(first, '***')\r\n n -= 1\r\n first = 'o' + 'go' * n\r\nprint(s)\r\n# for i in range(n):\r\n# if s[i] != 'o' and s[i] != 'g':\r\n# ans += s[i]\r\n# elif s[i] == 'o':\r\n# if prev\r\n", "n = int(input())\r\ninter = input()\r\nparazit='ogo'\r\nfor i in range(n,-1,-1):\r\n repl = parazit+(i*'go')\r\n if repl in inter:\r\n inter = inter.replace(repl, '*'*3)\r\n \r\nprint(inter)\r\n", "n = int(input())\r\ns = input()\r\ni = 0\r\nanswer = ''\r\nwhile i < n:\r\n if s[i:i+3] == 'ogo':\r\n j = i+3\r\n while j < n:\r\n if s[j:j+2] == 'go':\r\n j += 2\r\n else:\r\n break\r\n i = j\r\n answer += '***'\r\n else:\r\n answer += s[i]\r\n i += 1\r\nprint(answer)\r\n\r\n", "import re\r\ninput()\r\ns = input()\r\nprint(re.sub(\"ogo(go)*\", \"***\", s))", "'''input\n13\nogogmgogogogo\n'''\nn = int(input())\ns = input()\nl = []\nt = \"o\"\nfor _ in range(n//2):\n\tt += \"go\"\n\tl.append(t)\nfor x in l[::-1]:\n\ts = s.replace(x, \"***\")\nprint(s)", "L = int(input())\r\nS = input()\r\ncond = 0 # 0 - nothing; 1 - first o; 2- first g; 3-second o; 4 - another g; 5-another 0;\r\ngo_counter = 0\r\nans = []\r\nfor i in range(L):\r\n if cond == 0:\r\n if S[i] == 'o':\r\n cond = 1\r\n continue\r\n ans.append(S[i])\r\n continue\r\n if cond == 1:\r\n if S[i] == 'g':\r\n cond = 2\r\n continue\r\n ans.append('o')\r\n if S[i] != 'o':\r\n ans.append(S[i])\r\n cond = 0\r\n continue\r\n if cond == 2:\r\n if S[i] == 'o':\r\n cond = 3\r\n continue\r\n ans.append('o')\r\n ans.append('g')\r\n ans.append(S[i])\r\n cond = 0\r\n continue\r\n if cond == 3:\r\n if S[i] == 'g':\r\n cond = 4\r\n continue\r\n ans.append('*')\r\n ans.append('*')\r\n ans.append('*')\r\n if S[i] == 'o':\r\n cond = 1\r\n else:\r\n cond = 0\r\n ans.append(S[i])\r\n continue\r\n if cond == 4:\r\n if S[i] == 'o':\r\n cond = 5\r\n continue\r\n ans.append('*')\r\n ans.append('*')\r\n ans.append('*')\r\n ans.append('g')\r\n ans.append(S[i])\r\n cond = 0\r\n if cond == 5:\r\n if S[i] == 'g':\r\n cond = 4\r\n continue\r\n ans.append('*')\r\n ans.append('*')\r\n ans.append('*')\r\n if S[i] == 'o':\r\n cond = 1\r\n else:\r\n ans.append(S[i])\r\n cond=0\r\n\r\nif cond==1:\r\n ans.append('o')\r\nif cond==2:\r\n ans.append('o')\r\n ans.append('g')\r\nif (cond==3)or(cond==5):\r\n ans.append('*')\r\n ans.append('*')\r\n ans.append('*')\r\nif cond==4:\r\n ans.append('*')\r\n ans.append('*')\r\n ans.append('*')\r\n ans.append('g')\r\n\r\nfor i in ans:\r\n print(i, end='')\r\n", "n = int(input())\r\ns = input()\r\nword = \"ogo\"+\"go\"*((n-3)//2)\r\na = []\r\na.append(word)\r\nwhile len(word) > 3:\r\n word = word[:-2]\r\n a.append(word)\r\nfor x in a:\r\n if x in s:\r\n s = s.replace(x,\"***\")\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\ni = 3\r\ng = 0\r\nstring = ' '\r\nfor j in range(n):\r\n if g == 0:\r\n if string[-1] == '*' and 'go' == s[j:i - 1]:\r\n g = 1\r\n elif 'ogo' == s[j:i]:\r\n string += '***'\r\n g = 2\r\n else:\r\n string += s[j]\r\n i += 1\r\n else:\r\n g -= 1\r\n i += 1\r\n\r\nprint(string[1:])\r\n", "n = int(input())\r\ns = list(input()) + ['0', '0', '0', '0']\r\n\r\ni = 0\r\nwhile i < len(s) - 3:\r\n if s[i] + s[i + 1] + s[i + 2] == 'ogo':\r\n s[i + 2], s[i + 1], s[i] = '*', '*', '*'\r\n i += 3\r\n while i < len(s) - 2:\r\n if s[i] + s[i + 1] == 'go':\r\n del s[i + 1], s[i]\r\n else:\r\n break\r\n else:\r\n i += 1\r\n #print(s, i)\r\nprint(''.join(map(str, s[:-4])))\r\n", "n = int(input())\r\ns = input()\r\nimport re\r\nprint(re.sub('ogo(go)*', '***', s))\r\n", "import re\n\nn = int(input())\ncad = input()\nnewcad = re.sub('o(go)+','***',cad)\n\nprint(newcad)", "import re\r\n\r\nN, s = input(), input()\r\n\r\nprint(re.sub(r\"ogo(go)*\", \"***\", s))", "input()\ns = input()\nfor i in range(50, 0, -1):\n bad = 'o' + 'go'*i\n s = s.replace(bad, '***')\nprint(s)", "def main ():\n ogos = [\"ogo\"]\n for i in range(100):\n ogos.append(ogos[-1] + \"go\")\n\n length = input()\n text = input()\n\n for i in range(99, -1, -1):\n text = text.replace(ogos[i], \"***\")\n\n print(text)\nmain()\n", "import re\ninput()\nv = input()\nprint(re.sub(r\"ogo(go)*\", \"***\", v))\n", "n = int(input())\r\na = input() + 'aaa'\r\nans = ''\r\ni = 0\r\nogo = False\r\nwhile i < n:\r\n if a[i:i + 3] == 'ogo':\r\n ans += '***'\r\n i += 3\r\n ogo = True\r\n elif a[i:i + 2] == 'go' and ogo:\r\n i += 2\r\n else:\r\n ogo = False\r\n ans += a[i]\r\n i += 1\r\nprint(ans)", "def main():\n import re\n input()\n print(re.sub(r'o(go){1,}', \"***\", input()))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ns = input()\r\nx = 0\r\nflag = 0\r\nwhile x < len(s) - 2:\r\n if s[x: x + 3] == 'ogo':\r\n right = x\r\n left = x + 3\r\n flag = 0\r\n for i in range(x + 3, len(s) - 1, 2):\r\n if s[i : i+ 2] == 'go' and flag == 0:\r\n left += 2\r\n else:\r\n flag = 1\r\n s = s[:right] + '***' + s[left:]\r\n x += 1\r\nprint(s)", "a=int(input())\r\nb=input()\r\nfor x in range(a//2+1,0,-1):\r\n if 'og'*x+'o' in b:\r\n b=b.replace('o'+'go'*x,'***')\r\n\r\n \r\nprint(b)", "n = int(input())\r\ns = input()\r\nans = \"\"\r\ns += \"8888888888\"\r\ni = 0\r\nwhile (i < n):\r\n if (s[i: i + 3] == 'ogo'):\r\n ans += \"***\"\r\n i += 3\r\n while(s[i: i + 2] == \"go\"):\r\n i += 2\r\n else:\r\n ans += s[i]\r\n i+=1\r\n \r\nprint(ans)", "n = int(input())\r\ns = input()\r\nans = ''\r\ni = 0\r\nwhile i < n:\r\n if i + 2 < n and s[i:i+3] == 'ogo':\r\n i += 3\r\n while i + 1 < n and s[i:i+2] == 'go':\r\n i += 2\r\n ans += '***'\r\n else:\r\n ans += s[i]\r\n i += 1\r\nprint(ans)", "n=int(input())\r\nstr=input()\r\nnewStr=[]\r\nfor x in str[:n]:\r\n newStr.append(x)\r\ntem3=\"\"\r\ntem2=\"\"\r\ntem=\"\"\r\nflag=0\r\nfor i in range(n-2):\r\n tem3=newStr[i]\r\n for j in range(1,3):\r\n tem3+=newStr[i+j]\r\n if tem3==\"ogo\":\r\n flag=1\r\n newStr[i]=\"*\"\r\n newStr[i+1]=\"*\"\r\n newStr[i+2]=\"*\"\r\n tem=tem3\r\n if(flag==1):\r\n k=i+2\r\n while(k<n-2):\r\n #for k in range(i+2,n-2):\r\n for l in range(1,3):\r\n tem2+=newStr[k+l]\r\n if (tem2!=\"go\"):\r\n tem2=\"\"\r\n flag=0\r\n break\r\n if (tem2==\"go\"):\r\n newStr[k+1]=\"\"\r\n newStr[k+2]=\"\"\r\n k+=2\r\n tem2=\"\"\r\n \r\n\r\nprint(\"\".join(newStr))\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\nn = int(input())\ns = input()\nfor n in range(100,0,-1):\n filler = \"o\" + \"go\" * n\n s = s.replace(filler, \"***\")\nprint(s)\n \n", "import re\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = input().rstrip()\r\n\r\npattern = re.compile(r\"o(?:go)+\")\r\ndata = pattern.sub(\"***\", data)\r\n\r\nprint(data)", "n = int(input())\r\n\r\ns = input()\r\n\r\nsave = ''\r\ni = 0\r\nny = ''\r\nwhile i<n:\r\n if save=='':\r\n if s[i:i+3]=='ogo':\r\n save = 'o'\r\n i+=2\r\n else:\r\n ny+=s[i]\r\n else:\r\n if s[i:i+2]=='go':\r\n i+=1\r\n else:\r\n save = ''\r\n ny+='***'\r\n i-=1\r\n i+=1\r\nif save!='':\r\n ny+='***'\r\nprint(ny)", "\nimport sys\ndef get_single_int ():\n return int (sys.stdin.readline ().strip ())\ndef get_string ():\n return sys.stdin.readline ().strip ()\ndef get_ints ():\n return map (int, sys.stdin.readline ().strip ().split ())\ndef get_list ():\n return list (map (int, sys.stdin.readline ().strip ().split ()))\n\n#code starts here\nn = get_single_int ()\ns = get_string ()\nind = s.find ('ogo')\nwhile ind != -1:\n tmp = ind + 3\n while True:\n try:\n if s [tmp : tmp + 2] == 'go':\n tmp += 2\n else:\n break\n except:\n break\n #print ('tmp: ', tmp)\n s = s [:ind] + '***' +s [tmp:]\n #print (\"s: \", s)\n ind = s.find ('ogo')\nprint (s)\n", "n = int(input())\r\narr = list(input())\r\nfor i in range(n- 2):\r\n # print(arr[i:i + 3])\r\n if arr[i:i + 3] == ['o', 'g', 'o']:\r\n q = i + 3\r\n for j in range(i + 3, n - 1, 2):\r\n # print(arr[j], arr[j + 1])\r\n if arr[j] + arr[j + 1] == 'go':\r\n q += 2\r\n else:\r\n break\r\n #print(i, i + 4, q, n - 1)\r\n arr[i:q] = ['*'] * (q - i)\r\n arr[q - 1] = '*1'\r\nfor el in arr:\r\n if el == '*':\r\n pass\r\n elif el == '*1':\r\n print('***', end = '')\r\n else:\r\n print(el, end = '')\r\n", "n_letters = int(input())\nsentence = list(input())\n\ncatch = False\npoint = 0\nwhile point < n_letters:\n if sentence[point:point+3] == [\"o\", \"g\", \"o\"]:\n sentence[point:point+3] = [\"*\", \"*\", \"*\"]\n point += 3\n catch = True \n elif catch == True and sentence[point:point+2] == [\"g\", \"o\"]:\n del sentence[point:point+2]\n else:\n catch = False\n point += 1\n\nprint(\"\".join(sentence))\n", "input()\r\ns=input()\r\ni=0\r\nlast=0\r\nnew=''\r\nwhile i<len(s)-2:\r\n if s[i]=='o' and s[i+1]=='g' and s[i+2]=='o':\r\n start=i\r\n i+=2\r\n end=i\r\n while i<len(s)-2:\r\n if s[i]=='o' and s[i+1]=='g' and s[i+2]=='o':\r\n i+=2\r\n end=i\r\n else: break\r\n new+=s[last:start]+'***'\r\n last=end+1\r\n i+=1\r\nnew+=s[last:]\r\nprint(new)", "n=int(input())\r\ns=input()\r\nogos=['ogo']\r\nogo='ogogo'\r\nwhile len(ogo)<=n:\r\n ogos.append(ogo)\r\n ogo+='go'\r\nfor i in range(1,len(ogos)+1):\r\n ogo=ogos[-i]\r\n a=s.find(ogo)\r\n while a!=-1:\r\n s=s[:a]+'*'*3+s[a+len(ogo):]\r\n a=s.find(ogo)\r\nprint(s)", "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\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\ns = list(get_string())\r\ni = 0\r\n\r\nwhile i < n-2:\r\n if s[i] == 'o' and s[i+1] == 'g' and s[i+2] == 'o':\r\n s[i], s[i+1], s[i+2] = '*','*','*'\r\n i = i+2\r\n j = i+1\r\n\r\n while j < n-1:\r\n if s[j] == 'g' and s[j+1] == 'o':\r\n s[j],s[j+1] = \"\",\"\"\r\n j += 2\r\n else:\r\n break\r\n i = max(i+1,j-1)\r\n else:\r\n i += 1\r\nprint(''.join(s))\r\n ", "n = int(input())\ns = input()\n\n\nst = s.find('ogo')\nwhile(st != -1):\n s = s[:st] + '***' + s[st+3:]\n t = st\n st = st+3\n while(st+2 <= len(s) and (s[st:st+2] == 'go')):\n st+=2\n #if st == len(s): st-=1\n s = s[:t] + '***' + s[st:]\n st = s.find('ogo')\n\nprint(s)\n \n", "def is_filler(s):\r\n if len(s) < 3:\r\n return False\r\n if s != \"ogo\" + ((len(s) - 3)//2)*\"go\":\r\n return False\r\n return True\r\n\r\nn = int(input())\r\ns = input()\r\nln = n - 1\r\nfor _ in range(n):\r\n for i in range(n):\r\n if i + ln + 1 > n:\r\n ln -= 1\r\n break\r\n if is_filler(s[i:i+ln+1]):\r\n s = s[:i] + '***' + s[i+ln+1:]\r\n\r\nprint(s)", "n = int(input())\r\na = list(str(input()))\r\ni = j = 0\r\nwhile j < n:\r\n i = j\r\n if ''.join(a[i:i+3]) == 'ogo':\r\n i = i+3\r\n while ''.join(a[i:i+2]) == 'go':\r\n i += 2\r\n j = i\r\n print('***', end = '')\r\n else:\r\n print(a[i], end = '')\r\n j += 1", "import sys\nsys.stdin.readline()\ns = sys.stdin.readline().rstrip()\nwhile True:\n f = False\n for i in range(len(s)):\n l = 3\n if s[i:].startswith('ogo'):\n while s[i+l:i+l+2] == 'go':\n l += 2\n s = s[:i] + '***' + s[i+l:]\n f = True\n break\n if not f:\n break\n\nprint(s)\n\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(input())\r\ncur = 0\r\nidx = []\r\nwhile cur <= n - 2:\r\n if a[cur] + a[cur + 1] + a[cur + 2] == 'ogo':\r\n idx.append(cur)\r\n cur += 1\r\nans = []\r\ncur = 0\r\nwhile cur < n:\r\n if cur in idx:\r\n p = idx.index(cur)\r\n q = p - 1\r\n if q == -1:\r\n cur += 2\r\n [ans.append(\"*\") for _ in range(3)]\r\n elif idx[p] - idx[q] != 2:\r\n cur += 2\r\n [ans.append(\"*\") for _ in range(3)]\r\n else:\r\n cur += 2\r\n else:\r\n if cur-2 not in idx:\r\n ans.append(a[cur])\r\n cur += 1\r\nprint(''.join(ans))", "n = int(input())\ns = input()\na = s.find('ogo')\nwhile a != -1:\n k = a + 2\n while k + 2 < len(s) and s[k + 1: k + 3] == 'go':\n k += 2\n s = s[:a] + '***' + s[k + 1:]\n a = s.find('ogo')\nprint(s)\n \n ", "n=int(input())\r\ns=input()\r\nfor i in range(n,0,-1):\r\n s=s.replace('o'+'go'*i, '***')\r\nprint(s)\r\n", "\r\ndef speech_replacer(): \r\n length = int(input())\r\n speech = input()\r\n\r\n while True:\r\n if \"*go\" in speech:\r\n speech = speech.replace(\"*go\",\"*\",1)\r\n elif \"ogo\" in speech:\r\n speech = speech.replace(\"ogo\",\"***\",1)\r\n else:\r\n return speech\r\nprint(speech_replacer())", "n = int(input())\ns = input().rstrip()\ni = 0\nwhile i < n:\n if s[i] != 'o':\n print(s[i], end=\"\")\n else:\n j = i + 1\n while j < n - 1 and s[j] == 'g' and s[j + 1] == 'o':\n j += 2\n if j != i + 1:\n print('***', end='')\n else:\n print(s[i], end='')\n i = j - 1\n i+=1\n", "n = int(input())\ns = input()\ns2 = ''\ni = 0\nwhile i<n:\n if i+3 <= n and s[i:i+3] == 'ogo':\n s2 = s2+'***'\n i += 3\n while i < n-1 and s[i:i+2] == 'go':\n i+=2\n else:\n s2 = s2+s[i]\n i+=1\nprint(s2)", "s=int(input())\r\nb=input()\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogogo\",\"***\")\r\nb=b.replace(\"ogogogogo\",\"***\")\r\nb=b.replace(\"ogogogo\",\"***\")\r\nb=b.replace(\"ogogo\",\"***\")\r\nb=b.replace(\"ogo\",\"***\")\r\nprint(b)", "n = int(input())\r\ns = input()\r\n\r\ni = 0\r\noutput = \"\"\r\nwhile i < n:\r\n if i + 2 < n and s[i] == 'o' and s[i+1] == 'g' and s[i+2] == 'o':\r\n output += '***'\r\n i += 3\r\n while i + 1 < n and s[i] == 'g' and s[i+1] == 'o':\r\n i += 2\r\n else:\r\n output += s[i]\r\n i += 1\r\n\r\nprint(output)\r\n", "a = int(input())\r\ns = input()\r\nk=''\r\nif(len(s)<3):\r\n print(s)\r\nelse:\r\n q = 'ogo' \r\n d = 'go'\r\n i=0\r\n q1=0\r\n while(i<(a-3)):\r\n if (s[i:i+3]==q):\r\n j=i+3\r\n while(s[j:j+2]==d):\r\n j+=2\r\n k+= '***'\r\n q1=j\r\n i=j\r\n continue\r\n else:\r\n k+=s[i]\r\n i+=1\r\n if q1>(a-3):\r\n k+=s[q1:a]\r\n else:\r\n if(s[a-3:a]==q):\r\n k+='***'\r\n else:\r\n k+=s[a-3:a]\r\n print(k)\r\n", "# inp = lambda: map(int, input().split(' '))\r\nres = ''\r\n\r\nn = int(input())\r\ns = input()\r\n\r\ni = 0\r\n# print('lel')\r\nwhile i < n:\r\n # print('lel')\r\n if s[i] not in ('o', 'g'):\r\n res += s[i]\r\n i += 1\r\n else:\r\n if s[i:i+3] == 'ogo':\r\n # print(s[i:i+3])\r\n i += 3\r\n # print(s[i:i+2])\r\n while s[i:i+2] == 'go':\r\n\r\n i += 2\r\n res += '***'\r\n else:\r\n res += s[i]\r\n i += 1\r\n\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def solve():\r\n n=int(input())\r\n s=list(input())\r\n x=0\r\n result=''\r\n while x<=len(s)-3:\r\n if s[x:x+3]==['o','g','o']:\r\n result+='*'*3\r\n x+=3\r\n while s[x:x+2]==['g','o']:\r\n x+=2\r\n else:\r\n result+=s[x]\r\n x+=1\r\n for i in range(x,len(s)):\r\n result+=s[i]\r\n print(result)\r\n\r\nsolve()\r\n", "import re\n\ncount = int(input())\n\ninterview = input()\n\nprint(re.sub(r'o(go)+', '***', interview))", "import re\n\nn = int(input())\ns = input()\n\nresult = re.sub(r'ogo(go)*', '***', s)\nprint(result)\n", "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().decode()) + [\"?\", \"?\", \"?\"]\r\ni = 0\r\nf = 0\r\nans = []\r\nwhile i <= n:\r\n if not f and s[i] + s[i + 1] + s[i + 2] == \"ogo\":\r\n f = 1\r\n i += 3\r\n elif f and not s[i] + s[i + 1] == \"go\":\r\n ans.append(\"***\")\r\n f = 0\r\n elif f:\r\n i += 2\r\n else:\r\n ans.append(s[i])\r\n i += 1\r\nwhile ans[-1] == \"?\":\r\n ans.pop()\r\nsys.stdout.write(\"\".join(ans))", "l = input()\r\ns = input()\r\nfor i in range(len(s) // 2, -1, -1):\r\n s = s.replace('ogo' + 'go' * i, '***')\r\n\r\nprint(s)", "from re import sub\n\n\ndef main():\n input()\n print(sub(r'o(go)+', '***', input()))\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\r\ns = input()\r\nans = \"\"\r\npos = s.find(\"ogo\")\r\nwhile pos >= 0:\r\n ans += s[:pos]\r\n i = pos + 3\r\n while i < len(s) and s[i:i+2] == \"go\":\r\n i += 2\r\n ans += \"***\"\r\n s = s[i:]\r\n pos = s.find(\"ogo\")\r\nans += s\r\nprint(ans)\r\n", "n = int(input())\r\na = input()\r\ns = 0\r\ni = 0\r\nwhile i <= n-1:\r\n if s == 0:\r\n if a[i : i + 3] == 'ogo':\r\n s = 1\r\n print('***', end = '')\r\n i += 3\r\n else:\r\n print(a[i], end = '')\r\n i += 1\r\n \r\n else:\r\n if a[i : i + 2] == 'go':\r\n i += 2\r\n else:\r\n s = 0", "n=int(input())\r\nwhile not(1<=n<=100):\r\n n=int(input())\r\ns=input()\r\nwhile not(len(s)==n):\r\n s=input()\r\nc=[]\r\nc+=s\r\n\r\n\r\ndef filte(s):\r\n F=True\r\n c=s\r\n for i in range(len(s)):\r\n \r\n if F:\r\n \r\n f=\"\"\r\n for ii in range(len(s)-i):\r\n f+=\"og\"\r\n f+=\"o\"\r\n c=c.replace(f,\"***\")\r\n i2=0\r\n for i3 in range(len(c)):\r\n if c[i3]!=\"o\":\r\n i2+=1\r\n if i2==len(c):\r\n F=False\r\n return c\r\n\r\n\r\nprint(filte(s))", "from sys import stdin\r\nimport re\r\n\r\nregex = re.compile(r\"ogo(go)*\")\r\nlines = stdin.readlines()\r\n\r\noutString = re.sub(regex, \"***\", lines[1])\r\nprint(outString)", "s = [0] * 50\r\ns[0] = 'ogo'\r\nfor i in range(1, 50):\r\n s[i] = s[i - 1] + 'go'\r\nn = int(input())\r\nss = input()\r\nfor i in range(49, -1, -1):\r\n ss = ss.replace(s[i], '***')\r\nprint(ss)\r\n", "import re\r\ninput()\r\nprint(re.sub(r\"ogo(go)*\", \"***\", input()))", "n = int(input())\r\ns = input().strip()\r\n\r\nans = ''\r\ni = 0\r\nwhile i < len(s):\r\n\tif s[i:i + 3] == 'ogo':\r\n\t\tj = i + 3\r\n\t\twhile s[j:j + 2] == 'go':\r\n\t\t\tj += 2\r\n\t\ti = j\r\n\t\tans += '***'\r\n\telse:\r\n\t\tans += s[i]\r\n\t\ti += 1\r\n\r\nprint(ans)", "import re;print(re.sub(r\"ogo(go)*\",\"***\",(input(),input())[1]))", "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 s = input()\r\n s = re.sub(r'ogo(go)*', '***', s)\r\n print(s)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\ns=input()\r\nfor i in range(n):\r\n\tif 'ogo' in s:\r\n\t\ts=s.replace('ogo','***')\r\nj=s.split('*go')\r\nk='*'.join(j)\r\n# print(k)\r\nl=k.split('**g*')\r\nprint(''.join(l))", "input()\r\ns=input()\r\nflag=0\r\nans=''\r\n#http://codeforces.com/problemset/problem/729/A\r\nwhile(s):\r\n if not flag:\r\n if s.startswith('ogo'):\r\n flag=1\r\n s=s[3:]\r\n ans+='***'\r\n else:\r\n ans+=s[0]\r\n s=s[1:]\r\n else:\r\n if s.startswith('go'):\r\n s=s[2:]\r\n else:\r\n flag=0\r\nprint(ans)\r\n", "ml = ['ogo']\r\nfor i in range(100):\r\n ml.append(ml[-1]+'go')\r\n\r\ninput()\r\ns = input()\r\nfor i in ml[::-1]:\r\n s = s.replace(i, '***')\r\nprint(s)", "n = int(input())\ns = input()\ngo = (n - 3) // 2\nwhile \"ogo\" in s:\n if \"ogo\" + \"go\" * go in s:\n s = s.replace(\"ogo\" + \"go\" * go, \"***\")\n else:\n go -= 1\nprint(s)", "n=int(input())\r\nst=input()\r\nfor i in range(n,-1,-1):\r\n x='ogo'+str('go'*i)\r\n if x in st:\r\n st=st.replace(x,'***')\r\nprint(st)", "n = int(input())\r\ns = str(input())\r\nk=n-3\r\nif k>0:\r\n t=k//2\r\n for i in range(t,-1,-1):\r\n\r\n s=s.replace('ogo'+'go'*i,'***')\r\nelse:\r\n s=s.replace('ogo','***')\r\nprint(s)\r\n", "n = int(input())\r\na = input()\r\nx = a.find('ogo')\r\nwhile x!=-1:\r\n a = a[:x] + '***' + a[x+3:]\r\n y = x+3\r\n while y<n-1 and a[y:y+2]=='go':\r\n a = a[:y] + a[y+2:]\r\n x = a.find('ogo')\r\nprint(a)", "from collections import Counter\r\nn=int(input())\r\ns=input()\r\nf=['ogo']\r\nfor i in range((n-3)//2):\r\n f.append(f[i]+'go')\r\nff=f[::-1]\r\nfor i in ff:\r\n s=s.replace(i,'***')\r\nprint(s)", "import re\r\nn=int(input())\r\ns=input()\r\nprint(re.sub(\"o(go)+\",\"***\",s))\r\n\r\n", "import re\r\nn = int(input())\r\ns = input()\r\ns = s.lower()\r\nwhile 'ogo' in s:\r\n s = re.sub('o(go)+', '***', s)\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\n\r\ni = 0\r\nwhile (i < n):\r\n if s[i : i + 3 ] == \"ogo\":\r\n while s[i : i + 3] == \"ogo\":\r\n i += 2\r\n print('***' , end = '')\r\n\r\n else:\r\n print(s[i] ,end = '')\r\n i +=1\r\n\r\n", "n=int(input())\r\nword=str(input())\r\nwhile \"ogo\" in word:\r\n i=word.index(\"ogo\")\r\n l=3\r\n while word[i+l:i+l+2]==\"go\":\r\n l=l+2\r\n word=word.replace(word[i:i+l],\"***\",1)\r\nprint(word)", "a = int(input())\r\nb = input()\r\nc = ''\r\nfor i in b:\r\n c += i\r\n if \"ogo\" in c:\r\n c = c.replace(\"ogo\", \"***\")\r\n if \"***go\" in c:\r\n c = c.replace(\"***go\", \"***\")\r\nprint(c)", "a= int(input())\r\nb=input()\r\nw = ''\r\nfor i in b:\r\n w+=i\r\n if w and 'ogo' in w:\r\n w = w.replace('ogo' , '***' )\r\n if w and '***go' in w:\r\n w=w.replace('***go','***')\r\n\r\nprint(w)", "import re\nr = re.compile('ogo(go)*')\n_ = input()\ns = input()\nprint(r.sub('***', s))\n", "#!/usr/bin/env python3\r\n\r\nimport re\r\n\r\np = re.compile('o(go)+')\r\n\r\nN = int(input())\r\nS = input()\r\n\r\nS = re.sub(p, '***', S)\r\n\r\nprint(S)\r\n", "#!/usr/bin/python3\n# -*- coding: utf-8 -*-\n\nimport re\nlenth = input()\nresult = re.sub(r\"o(go)*go\", \"***\", input())\nprint(result)\n#lenth = input()\n\t\t\t\t \t\t \t \t \t\t \t \t \t \t\t\t", "n=int(input())\r\nl=list(input())\r\nfor i in range(1,n-1):\r\n if l[i]=='g' and l[i+1]=='o' and l[i-1]=='o':\r\n l[i]='*'\r\n l[i-1]='*'\r\n l[i+1]='*'\r\n elif l[i]=='g' and l[i+1]=='o' and (l[i-1]=='*' or l[i-1]==''):\r\n l[i]=''\r\n l[i+1]=''\r\nprint(''.join(l))", "n=int(input())\r\ns=input()\r\nx,i=0,0\r\nwhile i<n:\r\n if i<n-2 and s[i]=='o' and s[i+1]=='g' and s[i+2]=='o':\r\n print('***',end='')\r\n x=1\r\n i+=3\r\n elif i<n-1 and s[i]=='g' and s[i+1]=='o' and x:i+=2\r\n else:\r\n x=0\r\n print(s[i],end='')\r\n i+=1", "import re as r\r\n\r\n\r\nn = input()\r\nnew = input()\r\nprint(r.sub(r'ogo(go)*','***',new))", "\r\nn = int(input())\r\nword = input()\r\nsub = \"ogo\"\r\nif sub not in word:\r\n print(word)\r\n\r\nelse:\r\n for i in range(n-3,-1,-1):\r\n if (\"ogo\"+(\"go\"*i)) in word:\r\n word = word.replace((\"ogo\"+(\"go\"*i)), \"***\")\r\n \r\n print(word)\r\n", "n = int(input())\r\ns = input()\r\nl = list(s)\r\n\r\ni = s.find(\"ogo\")\r\nwhile i > -1:\r\n l[i] = '*'\r\n l[i + 1] = '*'\r\n l[i + 2] = '*'\r\n k = i + 3\r\n t = s.find(\"go\", k)\r\n while t > 0 and t == k:\r\n l[k] = '#'\r\n l[k + 1] = '#'\r\n k += 2\r\n t = s.find(\"go\", k)\r\n i = s.find(\"ogo\", k)\r\n \r\nprint(\"\".join([b for b in l if b != '#']))", "n = int(input())\r\ns = input()\r\nfor j in range(100):\r\n s = s.replace('ogo', '***', 1)\r\n for i in range(100):\r\n s = s.replace('***go', '***')\r\nprint(s)\r\n", "n = int(input())\ns = input()\nrep = 'o' + 'go' * (n // 2 + 5)\n\nwhile len(rep) >= 3:\n s = s.replace(rep, '***')\n rep = rep[:-2]\n\nprint(s)\n", "n = int(input())\r\nmas = str(input()) + ' '\r\nl = 0\r\nans = ''\r\nflag = False\r\nwhile l < n:\r\n if mas[l] + mas[l+1] + mas[l+2] == 'ogo':\r\n flag = True\r\n ans += '***'\r\n l += 3\r\n elif flag:\r\n if mas[l] + mas[l+1] == 'go':\r\n l += 2\r\n else:\r\n flag = False\r\n ans += mas[l]\r\n l += 1\r\n\r\n else:\r\n ans += mas[l]\r\n l += 1\r\nif l == n:\r\n ans += mas[-1]\r\nprint(ans)", "import re\n\ndef main():\n n = input()\n s = input()\n t = re.sub(r\"ogo(go)*\", r\"***\", s)\n print(t)\n\nmain()\n", "input()\r\ns=input()\r\ns1='ogo'+'go'*110\r\nwhile len(s1)>1:\r\n s=s.replace(s1,'***')\r\n s1=s1.replace('go','',1)\r\nprint(s)", "import re\r\n\r\nn = int(input())\r\ncad = input()\r\nnewcad = re.sub('o(go)+','***',cad)\r\n\r\nprint(newcad)\r\n", "n = int(input())\ns = input()\n\nfor golen in range(97, -1, -1):\n s = s.replace('ogo' + ('go' * golen), '***')\n\nprint(s)", "n = int(input())\r\ns = input()\r\nans = ''\r\ncur = 0\r\nwhile cur < n:\r\n if cur + 2 < n and s[cur:cur + 3] == 'ogo':\r\n ln = cur + 3\r\n while ln + 1 < n and s[ln:ln + 2] == 'go':\r\n ln += 2\r\n ans += '***'\r\n cur = ln\r\n else:\r\n ans += s[cur]\r\n cur += 1\r\nprint(ans)\r\n", "n = int(input())\r\ninterview = input()\r\n\r\nresult = ''\r\nstart = 0\r\n\r\nwhile interview.find('ogo', start) != -1:\r\n occurrence = interview.find('ogo', start)\r\n result += interview[start:occurrence]\r\n go_count = 3\r\n while interview.find('go', occurrence + go_count) == occurrence + go_count:\r\n go_count += 2\r\n \r\n start = occurrence + go_count\r\n result += '***'\r\n\r\nresult += interview[start:]\r\nprint(result)# 1698392741.02195", "import re\r\ninput()\r\nprint(re.sub(\"ogo(go)*\", \"***\", input()))", "n=int(input())\r\ns=input().strip()\r\narr=[]\r\nk=0\r\nwhile k<n:\r\n if s[k]=='o':\r\n if k+2<n:\r\n if s[k:k+3]=='ogo':\r\n k+=3\r\n while k+1<n:\r\n if s[k:k+2]!='go':\r\n break\r\n k+=2\r\n k-=1\r\n arr.append('*') \r\n arr.append('*') \r\n arr.append('*') \r\n else:\r\n arr.append(s[k])\r\n else:\r\n arr.append(s[k])\r\n else:\r\n arr.append(s[k])\r\n k+=1\r\nans=\"\".join(arr)\r\nprint(ans)", "n = int(input())\r\nst = input()\r\n# st=[]\r\n# st[:0]=st1\r\nfor i in range(n):\r\n\r\n if (i<n-2 and st[i:i+3] == 'ogo'):\r\n \r\n j = i+3\r\n #print(st[j:j+2])\r\n while(j<n and st[j:j+2] == 'go'):\r\n \r\n j+=2\r\n \r\n #print(st[i:j],\" Debugging \")\r\n st = st.replace(st[i:j],'***',1)\r\n #print(st,\"inside if\")\r\n #print(st[j-1],j)\r\n i=j\r\nprint(st)", "import re\n\n_ = input()\nstring = input()\nprint(re.sub('ogo(go)*', '***', string))\n", "n = int(input())\r\ns = input()\r\nid = 0\r\nfor i in range(n):\r\n if s[i:i+3] == \"ogo\":\r\n id = i + 3\r\n while s[id:id+2] == \"go\":\r\n id += 2\r\n s = s[:i] + '***' + s[id:]\r\nprint(s)", "n = int(input())\r\ns = input()\r\nans = ''\r\nlast_ind = 0\r\ni = 0\r\nwhile i < n:\r\n if s[i:i+3] == 'ogo':\r\n i += 2\r\n else:\r\n i += 1\r\n if i - last_ind > 1:\r\n ans += '***'\r\n else:\r\n ans += s[last_ind:i]\r\n last_ind = i\r\nprint(ans)", "l = int(input().strip())\r\ns = input().strip()\r\nr = \"\"\r\ni = 0\r\nwhile i<l:\r\n if s[i:i+3]=='ogo':\r\n k = i+3\r\n while(k<l):\r\n if s[k:k+2]!='go':\r\n break\r\n k+=2\r\n r+='***'\r\n i = k\r\n else:\r\n r+=s[i]\r\n i+=1\r\nprint(r)", "_ = input()\ns = input()\ni = 0\nout = \"\"\n\n\ndef howMany(n):\n\tglobal s\n\tgoing = True\n\tout = 0\n\twhile n < len(s) and going:\n\t\tif n+1 < len(s) and s[n] == \"g\" and s[n+1] == \"o\":\n\t\t\tout += 1\n\t\t\tn += 2\n\t\telse:\n\t\t\tn += 1\n\t\t\tgoing = False\n\treturn out\n\nwhile i < len(s):\n\tif i+2 < len(s) and s[i] == \"o\" and s[i+1] == \"g\" and s[i+2] == \"o\":\n\t\ti += 3 + howMany(i+3) * 2\n\t\tout = out + \"***\"\n\telse:\n\t\tout = out + s[i]\n\t\ti += 1\n\nprint(out)", "import re\n\nregex = r\"(ogo(go)*)\"\n\nn = int(input())\ns = input()\n\nline = re.sub(regex, \"***\", s)\n \nprint(line)", "n = int(input())\r\ns = input() + '#####'\r\nans = ''\r\ni = 0\r\nwhile i < n:\r\n if s[i] + s[i + 1] + s[i + 2] == 'ogo':\r\n ans += '***'\r\n j = i + 3\r\n while s[j] + s[j + 1] == 'go':\r\n j += 2\r\n i = j\r\n else:\r\n ans += s[i]\r\n i += 1 \r\nprint(ans)", "n = int(input())\r\nstring = input()\r\nans = \"\"\r\ni = 0\r\nwhile i < n:\r\n if string[i: i + 3] == 'ogo':\r\n ans += \"***\"\r\n i += 3\r\n while i < n and string[i: i + 2] == 'go':\r\n i += 2\r\n else:\r\n ans += string[i]\r\n i += 1\r\nprint(ans)", "import re\r\n\r\ninput()\r\ns = input()\r\n\r\nprint(re.sub(r'o(go)+', '***', s))", "#ROUNIAAUDI\r\nnumber=int(input())\r\nstringBeutiful=input()\r\nrangeoff=range(number,0,-1)\r\nfor i in rangeoff:\r\n w=\"o\"+\"go\"*i\r\n stringBeutiful=stringBeutiful.replace(w,\"***\")\r\nprint(stringBeutiful)\r\n", "def solve(s):\r\n ans=\"\"\r\n ln=len(s)\r\n i=0\r\n while i<ln:\r\n if i+2<ln and s[i]=='o' and s[i + 1] == 'g' and s[i + 2] == 'o':\r\n i+=3\r\n while i+1<ln and s[i]=='g' and s[i+1]=='o':\r\n i+=2\r\n ans+=\"***\"\r\n else:\r\n ans+=s[i]\r\n i+=1\r\n return ans\r\n\r\nn=input()\r\ns=input()\r\nprint(solve(s))\r\n", "from re import sub\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nans = sub('o(?:go)+', '***', s)\r\n\r\nprint(ans)", "\n# coding: utf-8\n\n# In[155]:\n\nn = int(input())\ns = input()\n\n\n# In[156]:\n\ndef findEnd(s, i):\n k = i + 2\n ans = i+2\n while k + 2 < len(s):\n if s[k+1:k+3] == \"go\":\n ans = k+2\n else:\n break\n k+=2\n return ans\n \n\n\n# In[157]:\n\ndef findOgogos(s):\n return (s.find(\"ogo\"), findEnd(s,s.find(\"ogo\")))\n\n\n# In[158]:\n\nwhile \"ogo\" in s:\n s = s[:s.find(\"ogo\")]+\"***\"+s[findEnd(s,s.find(\"ogo\"))+1:]\n #print(s)\n\n\n# In[159]:\n\nprint(s)\n\n", "input()\r\ns = input()\r\n\r\nwhile 'ogogo' in s:\r\n s = s.replace('ogogo', 'ogo')\r\n\r\nprint(s.replace('ogo', '***'))", "clen=int(input())\nsentence=input()\nnews=\"\"\ncchar=\"\"\npchar=\"\"\ntmp=\"\"\nfor i in range(clen):\n cchar = sentence[i]\n if pchar == \"\": #Base case\n if cchar == \"o\":\n tmp = cchar\n else:\n news = cchar\n elif tmp == \"\":\n if cchar == \"o\":\n tmp = cchar\n else:\n news = news + sentence[i]\n elif len(tmp) < 3:\n if cchar == \"o\":\n if cchar != tmp[-1]:\n tmp = tmp + cchar\n else:\n news = news + tmp\n tmp = \"o\"\n elif cchar == \"g\":\n if cchar != tmp[-1]:\n tmp = tmp + cchar\n else:\n news = news + tmp + cchar\n tmp = \"\"\n else:\n news = news + tmp + cchar\n tmp = \"\"\n elif (len(tmp)-1)%2 == 0:\n if cchar == \"g\":\n tmp = tmp + cchar\n elif cchar == \"o\":\n news = news + \"***\"\n tmp = \"o\"\n else:\n news = news + \"***\" + cchar\n tmp = \"\"\n else:\n if cchar == \"o\":\n tmp = tmp + cchar\n else:\n news = news + \"***\" + \"g\" + cchar\n tmp = \"\"\n pchar = sentence[i]\nif len(tmp)<3:\n news = news + tmp\nelif tmp[-1] == \"o\":\n news = news + \"***\"\nelse:\n news = news + \"***\" + \"g\"\nprint(news)\n\n\n\n\n\n\n\n\n\n\n\n\n'''\n\n if tmp == \"\" and cchar == \"o\":\n tmp = cchar\n elif pchar == \"\":\n if cchar == \"o\":\n tmp = tmp + sentence[i]\n else:\n news = news + sentence[i]\n elif pchar == \"o\":\n if cchar == \"g\":\n tmp = tmp + sentence[i]\n elif len(tmp) > 0:\n if len(tmp)>2 and (len(tmp)-1)%2 == 0:\n if cchar == \"o\":\n news = news + \"***\"\n tmp = \"o\"\n else:\n tmp = \"\"\n news = news + \"***\" + sentence[i]\n else:\n news = news + tmp + sentence[i]\n tmp = \"\"\n else:\n news = news + sentence[i]\n elif pchar == \"g\":\n if cchar == \"o\":\n tmp = tmp + sentence[i]\n elif len(tmp) > 2:\n news = news + \"***\" + \"g\" + sentence[i]\n tmp = \"\"\n else:\n news = news + sentence[i]\n elif len(tmp) > 0:\n news = news + tmp\n tmp = \"\"\n else:\n news = news + sentence[i]\n pchar = sentence[i]\n\nif len(tmp) > 1 and (len(tmp)-1)%2 == 0:\n news = news + \"***\"\n tmp = \"\"\nelse:\n news = news + tmp\nprint(news)\n'''", "n = int(input())\r\ns = input()\r\nwhile s.count(\"ogo\") > 0:\r\n i = 0\r\n j = 0\r\n while s[i:i + 3] != \"ogo\":\r\n i += 1\r\n if s[i:i + 3] == \"ogo\":\r\n j = i + 3\r\n while j + 2 <= len(s) and s[j:j + 2] == \"go\":\r\n j += 2\r\n s = s[:i] + \"***\" + s[j:]\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\nrets = \"\"\r\nnex = 'o'\r\nhold = \"\"\r\nfor char in s:\r\n if char == nex:\r\n hold += char\r\n if nex == 'o':\r\n nex = 'g'\r\n else:\r\n nex = 'o'\r\n else:\r\n if len(hold) > 2:\r\n rets += \"***\"\r\n if hold[-1] == 'g':\r\n rets += 'g'\r\n else:\r\n rets += hold\r\n hold = \"\"\r\n nex = 'o'\r\n if char == 'o':\r\n hold += char\r\n nex = 'g'\r\n else:\r\n rets += char\r\n\r\nif len(hold) > 2:\r\n rets += \"***\"\r\n if hold[-1] == 'g':\r\n rets += 'g'\r\nelse:\r\n rets += hold\r\n\r\n\r\n\r\nprint(rets)\r\n", "\r\nif __name__=='__main__':\r\n\tn, = map(int, input().split())\r\n\ts = input()\r\n\tres = []\r\n\ti = 0\r\n\tswear = False\r\n\twhile (i < n):\r\n\t\tif not swear:\r\n\t\t\tif s[i:i+3] == 'ogo':\r\n\t\t\t\tswear = True\r\n\t\t\t\ti += 3\r\n\t\t\t\tres.append(\"***\")\r\n\t\t\telse:\r\n\t\t\t\tres.append(s[i])\r\n\t\t\t\ti += 1\r\n\t\telif s[i:i+2] == 'go':\r\n\t\t\ti += 2\r\n\t\telse:\r\n\t\t\tswear = False\r\n\t\t\tcontinue\r\n\tprint(''.join(res))", "# LUOGU_RID: 101647481\nimport re\r\n_, s = input(), input()\r\nprint(re.sub('o(go)+', '***', s))", "input()\ns = input()\nogo = s.find(\"ogo\")\nwhile ogo != -1:\n s = s[0:ogo] + \"***\" + s[ogo+3:]\n while(s[ogo+3:ogo+5]==\"go\"):\n s = s[0:ogo+3]+s[ogo+5:]\n ogo = s.find(\"ogo\")\nprint(s)\n", "import re\r\ninput()\r\nprint(re.sub(r'o(go)+',\"*\"*3,input()))", "\r\nn = input()\r\ns = input()\r\nwhile ('ogo' in s):\r\n\tx = 'ogo'\r\n\twhile (x in s): x += 'go'\r\n\tx = x[:-2]\r\n\ts = s.replace(x,'***')\r\n\t\r\n\t\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\ni = 0\r\nwhile i < n:\r\n if s[i:i+3] == 'ogo':\r\n j = i + 3\r\n while s[j:j+2] == 'go':\r\n j += 2\r\n s = s[:i] + '***' + s[j:]\r\n i += 1\r\nprint(s)\r\n", "n = input()\r\nsentence = input()\r\nfiller = \"ogo\"\r\n\r\nfor i in range(len(sentence),-1,-1):\r\n\tcari = filler + \"go\"*i\r\n\t#print(cari)\r\n\twhile(sentence.find(cari) > -1):\r\n\t\tindeks = sentence.find(cari)\r\n\t\t#print(indeks)\r\n\t\tsentence = sentence[0:indeks] + \"***\" + sentence[indeks+len(cari):]\r\n\r\nprint(sentence)\r\n", "n = int(input())\r\ns = input()\r\n\r\nwhile s.find('ogo') != -1:\r\n start = s.find('ogo')\r\n finish = start+3\r\n while finish + 1 < len(s) and s[finish]=='g' and s[finish+1]=='o':\r\n finish+=2\r\n s = s[:start] + '***' + s[finish:]\r\nprint(s)", "\ninterview_length = int(input())\n\ninterview_word = input()\nfind_index = 0\nwhile find_index != -1:\n find_index = interview_word.find('ogo')\n if find_index != -1:\n interview_word = interview_word.replace('ogo', '***', 1)\n find_index = find_index + 3\n end_go = False\n while end_go == False:\n if find_index + 1 < interview_length and interview_word[find_index] == 'g' and interview_word[find_index + 1] == 'o':\n interview_word = list(interview_word)\n interview_word[find_index] = ' '\n interview_word[find_index + 1] = ' '\n interview_word = ''.join(interview_word)\n find_index = find_index + 2\n else:\n end_go = True\n\ninterview_word = interview_word.replace(' ', '')\nprint(interview_word)\n", "n = int(input())\r\ns = input()\r\nfor i in range(100, 0, -1):\r\n s = s.replace('o' + 'go' * i, '***')\r\nprint(s)", "n=int(input())\r\ns=str(input())\r\nwhile ('***go' in s) or ('ogo' in s):\r\n k= s.find('ogo')\r\n if k != -1:\r\n s=s[:k+3].replace('ogo','***')+s[k+3:]\r\n while('***go' in s):\r\n s=s.replace('***go','***')\r\nprint(s)\r\n", "# from math import ceil\r\n# from collections import Counter\r\n# mod = 1000000007\r\nans = [\"ogo\" + \"go\"*i for i in range(100)][::-1]\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n a = 0\r\n while True:\r\n for i in ans:\r\n if i in s:\r\n s = s.replace(i, \"***\")\r\n break\r\n else:\r\n break\r\n print(s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\ns = input()\np = \"ogo\"\nwhile len(p) < len(s):\n\tp += \"go\"\nwhile len(p) > 1:\n\ts = s.replace(p, \"***\")\n\tp = p[:-2]\nprint(s) ", "n = int(input())\r\ns = str(input())\r\n\r\nfor i in range(100, -1, -1):\r\n s = s.replace('ogo' + 'go' * i, '***')\r\nprint(s)", "input()\r\ns = input()\r\nfor i in range(50,0,-1):\r\n s = s.replace('o'+'go'*i,'***')\r\nprint(s)", "n=int(input())\r\ns=input()\r\nans=\"\"\r\ni=0\r\nj=0\r\nwhile(i<n):\r\n if(s[i:i+3]==\"ogo\" and len(s[i:i+3])>2):\r\n ans+=\"***\"\r\n i+=3\r\n while(j<n):\r\n if(s[i:i+2]==\"go\" and len(s[i:i+2])>1):\r\n i+=2\r\n else:\r\n j=n;\r\n j=0\r\n else:\r\n ans+=s[i]\r\n i+=1\r\nprint(ans)", "#!/usr/bin/env python3\n\nn = int(input())\ns = input()\nss = []\ni = 0\nwhile i < n:\n if s[i] != 'o':\n ss.append(s[i])\n i += 1\n else:\n if s[i+1:i+3] == 'go':\n ss.append('***')\n i += 3\n while s[i:i+2] == 'go':\n i += 2\n else:\n ss.append(s[i])\n i += 1\n\nprint(''.join(ss))\n\n\n\n", "n=int(input())\r\ns=input()\r\nwhile \"ogo\" in s:\r\n if s[s.index('ogo'):s.index('ogo')+5] == \"ogogo\":\r\n s=s[:s.index(\"ogo\")] + s[s.index(\"ogo\")+2:]\r\n else:\r\n s=s[:s.index(\"ogo\")] + \"***\" + s[s.index(\"ogo\")+3:]\r\nprint(s)", "n = int(input())\r\ns = input().replace(\"ogo\",\"***\")\r\nfor i in range(50):\r\n s = s.replace(\"**g**\",\"*\")\r\n s = s.replace(\"*go\",\"*\")\r\nprint(s)\r\n", "import re\r\ninput()\r\na = input()\r\nprint (re.sub('ogo(go)*', '***', a))", "import re\r\n\r\nn = int(input())\r\nprint(re.sub(r\"[o]([g][o]){1,}\", \"***\", input()))\r\n", "n = int(input())\ns = input();\na = 0\nb = 0\nfor i in range(len(s)):\n if (a==0):\n if(s[i:i+3]==\"ogo\"):\n a = 2\n for j in range((len(s)-i)//2):\n if(s[i+3+j*2:i+5+j*2]==\"go\"):\n a = 2 + (j+1)*2\n else:\n break\n print(\"***\", end='')\n else:\n print(s[i], end='')\n else:\n a = a - 1", "n = int(input())\r\ns = input()\r\na = \"ogo\"+\"go\"*int(((n-3)//2))\r\nwhile len(a) > 2:\r\n s = s.replace(a,\"***\")\r\n a = a[2:]\r\nprint(s)", "class CodeforcesTask729ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.word = ''\n\n def read_input(self):\n self.n = int(input())\n self.word = input()\n\n def process_task(self):\n ogos = [\"og\" * (x + 1) + \"o\" for x in range((self.n + 1) // 2)]\n ogos = ogos[::-1]\n for ogo in ogos:\n self.word = self.word.replace(ogo, \"***\")\n self.result = self.word\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask729ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\r\ns=input()\r\nparazit='ogo'\r\nendline=''\r\nend=-1\r\nfor i in range(len(s)):\r\n if(i>=end):\r\n\r\n if(s[i:i+3]!=parazit):\r\n endline+=s[i]\r\n else:\r\n start=i+3\r\n end=start+2\r\n\r\n while(1):\r\n if(s[start:end]=='go'):\r\n start+=2\r\n end+=2\r\n else:\r\n end=start\r\n break\r\n\r\n endline+='***'\r\n\r\nprint(endline)", "n = int(input())\r\ns = input()\r\nans = 'ogo'\r\na = []\r\nwhile len(ans) <= 100:\r\n a.append(ans)\r\n ans += 'go'\r\ni = n\r\nj = len(a) - 1\r\nwhile True:\r\n if a[j] in s:\r\n q = s.index(a[j])\r\n s = s[:q] + '***' + s[q + len(a[j]):] \r\n else:\r\n j -= 1\r\n if j == -1:\r\n break\r\nprint(s)", "n = int(input())\ns = input()\n\ni = 0;\n\nwhile i<len(s):\n if (i < len(s) - 2):\n if (s[i:i+3] == 'ogo'):\n print('***',end='')\n i = i + 3\n while (i < len(s) - 1):\n if (s[i:i+2] == 'go'):\n i+=2\n else:\n break\n else:\n print(s[i],end='')\n i+=1\n else:\n print(s[i],end='')\n i+=1\n\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-07 17:51:13\nLastEditTime: 2021-11-07 22:30:12\nDescription: Interview with Oleg\nFilePath: CF729A.py\n'''\n\n\ndef func():\n _ = int(input())\n s = input().strip()\n while \"ogogo\" in s:\n s = s.replace(\"ogogo\", \"ogo\")\n print(s.replace(\"ogo\", \"***\"))\n\n\nif __name__ == '__main__':\n func()\n", "def getFillers():\r\n lFills = list()\r\n k = 'ogo'\r\n\r\n while len(k)<=100:\r\n lFills.append(k)\r\n k+='go'\r\n\r\n return lFills\r\n\r\n\r\n\r\nlFills = getFillers()\r\nlFills.reverse()\r\n\r\n\r\nN = int(input())\r\nS = input()\r\n\r\nfor i in lFills:\r\n S = S.replace(i, '***')\r\n\r\nprint(S)", "import sys\r\n\r\nfin = sys.stdin\r\nfout = sys.stdout\r\nn = int(fin.readline())\r\ns = fin.readline().strip()\r\nres = ''\r\ni = 0\r\nwhile i < len(s):\r\n if s[i:i + 3] == 'ogo':\r\n last = len(s)\r\n for j in range(i + 3, len(s), 2):\r\n last = j\r\n if s[j:j + 2] != 'go':\r\n res += '***'\r\n i = j - 1\r\n break\r\n else:\r\n res += '***'\r\n i = last + 2\r\n else:\r\n res += s[i]\r\n i += 1\r\nfout.write(res)\r\n", "n = input()\r\ns = input()\r\nwhile 'ogo' in s:\r\n n = 0\r\n r = 'ogo'\r\n i = s.index(r)\r\n while s[i+3+2*n:i+5+2*n] == 'go':\r\n r += 'go'\r\n n += 1\r\n s = s.replace(r, '***', 1)\r\nprint(s)\r\n", "a = int(input())\r\nstring = input()\r\nfirst = []\r\nlast = []\r\nsas = False\r\ni = 1\r\nwhile i < a:\r\n i += 1\r\n if not sas:\r\n if string[i-2:i+1] == \"ogo\":\r\n first += [i-2]\r\n sas = True\r\n i += 1\r\n else:\r\n if string[i-1:i+1] == \"go\":\r\n i += 1\r\n else:\r\n last += [i - 2]\r\n sas = False\r\nif sas:\r\n last += [a - 1]\r\ns = \"\"\r\ncounter = 0\r\nn = 0\r\nwhile counter < len(string):\r\n if counter not in first:\r\n s += string[counter]\r\n counter += 1\r\n else:\r\n s += \"***\"\r\n counter = last[n] + 1\r\n n += 1\r\nprint(s) \r\n ", "import re\r\nn = int(input())\r\nprint(re.sub('o(go)+', '***', input()))", "n = int(input())\ns = input()\n\nfiller_word = 'ogo'\nfiller_words = []\n\nfor i in range(n + 1):\n filler_words.append(filler_word + 'go' * i)\n\nfor i in range(n):\n for word in filler_words[::-1]:\n if word in s:\n s = s.replace(word, '***')\n\nprint(s)", "import re\n\ndef ogo(s: str) -> str:\n return re.sub('ogo(go)*', '***', s) \n\n# Input\nn = input()\ns = input()\n\nprint (ogo(s))\n\t \t \t \t\t\t\t\t\t \t\t \t \t \t\t", "input()\r\ninterview = input()\r\n\r\nfor i, n in enumerate(interview):\r\n if interview[i:i+3] == 'ogo':\r\n end = i + 3\r\n while interview[end:end+2] == 'go':\r\n end += 2\r\n interview = interview[:i] + '***' + interview[end:]\r\n\r\nprint(interview)\r\n", "n = int(input())\r\ns = input()\r\ni = 0\r\nparasits = ['o' + ('go' * i) for i in range(49 , 0, -1)]\r\nfor string in parasits:\r\n if string in s:\r\n s = s.replace(string, '***')\r\nprint(s)", "import re\r\nn = int(input())\r\na = input()\r\nprint(re.sub(\"ogo(go)*\", \"***\", a))\r\n", "import re\r\nN, s = input(), input()\r\nprint(re.sub(r\"ogo(go)*\", \"***\", s))", "n = int(input())\r\nstring = str(input())\r\n\r\n#str2 = \"\"\r\nwhile string.find(\"ogo\") > -1:\r\n f = string.find(\"ogo\")\r\n end = f + 3\r\n end2 = end + 2\r\n while string[end:end2] == \"go\":\r\n end += 2\r\n end2 = end + 2\r\n string = string[:f] + \"***\" + string[end:]\r\nprint(string)\r\n", "n=int(input())\r\ns=input()\r\nmop=s\r\nfor i in range(len(s)-2):\r\n if mop[i:i+3]==\"ogo\":\r\n j=i\r\n while mop[j+3:j+5]==\"go\" and j<len(s):\r\n j=j+2\r\n j=j+3\r\n mop=mop[0:i]+\"***\"+mop[j:len(s)]\r\nprint(mop)\r\n \r\n \r\n \r\n \r\n", "ln = int(input())\r\nn = input()\r\nwhile \"ogo\" in n:\r\n n = n.replace(\"ogo\", \"***\", 1)\r\n while \"***go\" in n:\r\n n = n.replace(\"***go\", \"***\", 1)\r\n\r\nprint(n)", "import re; n = input(); print(re.subn('ogo(go)*', '***', input())[0])", "n=int(input())\r\na=input()\r\nfor x in range(1,n):\r\n a=a.replace('o'+('go'*(n-x)),'***')\r\nprint(a)\r\n", "from re import *\r\ninput()\r\ns=input()\r\nprint(sub(r'ogo(go)*',\"***\",s))", "input()\r\nX, i = input(), 0\r\nwhile i < len(X):\r\n Temp = X[i:i + 3]\r\n if Temp == 'ogo':\r\n while Temp == 'ogo':\r\n i += 2\r\n Temp = X[i:i + 3]\r\n print(\"***\", end=\"\")\r\n else:\r\n print(X[i], end=\"\")\r\n i += 1\r\n", "i = 0\r\nres = \"\"\r\n\r\nn = int(input())\r\nst = input()\r\n\r\nif len(st)<3:\r\n print(st)\r\nelse:\r\n while i<len(st):\r\n ps = st[i:i+3]\r\n if ps == \"ogo\":\r\n i = i+3\r\n j=i\r\n res=res+\"***\"\r\n while j<len(st):\r\n pa = st[j:j+2]\r\n if pa == \"go\":\r\n j=j+2\r\n i=i+2\r\n else:\r\n break\r\n else:\r\n res=res+st[i]\r\n i=i+1\r\n\r\n print(res)\r\n", "n = int(input())\r\ninstr = str(input())\r\n\r\nfillers = list()\r\nfor i in range(49):\r\n\tfillers.append(\"ogo\" + \"go\" * i)\r\n\r\nfor filler in fillers[::-1]:\r\n\tinstr = instr.replace(filler, \"***\")\r\n\r\nprint(instr)\r\n# print(fillers[::-1])", "import re\r\na=int(input())\r\nb=input()\r\nc=re.sub(r\"o(go)+\", \"***\", b)\r\nprint(c)", "n=int(input())\r\ns=input()+' '\r\nss=s[:3]\r\ni=3\r\nwhile i<n:\r\n if s[i-3:i]=='ogo' and s[i:i+2]=='go': i+=2\r\n else: ss+=s[i];i+=1\r\nprint(ss.replace('ogo','***')) ", "n = int(input())\r\nst = input()\r\n\r\nwhile st.find('ogo') != -1:\r\n\tnum = st.find('ogo') \r\n\tif num != -1:\r\n\t\tstart = num\r\n\t\tend = num + 3\r\n\t\twhile num != -1:\r\n\t\t\tnum = st.find('go', end, end + 2)\r\n\t\t\tif num != -1:\r\n\t\t\t\tend += 2\r\n\tst = st[:start] + '*' * 3 + st[end:]\r\n\r\nprint(st)", "n = int(input())\r\nl = list(input())\r\n\r\ni = 0\r\nwhile(i<(n-2)):\r\n if(l[i]=='o' and l[i+1]=='g' and l[i+2]=='o'):\r\n l[i]='*'\r\n l[i+1]='*'\r\n l[i+2]='*'\r\n i += 2\r\n continue\r\n if((l[i]=='*' or l[i]=='') and l[i+1] == 'g' and l[i+2]=='o' and i<(n-2)):\r\n l[i+1] = ''\r\n l[i+2] = ''\r\n i += 2\r\n continue\r\n else:\r\n i+=1\r\nprint(''.join(l))", "n = int(input())\r\ntext = input()\r\nfor i in range(50, -1, -1):\r\n text2 = \"ogo\" + \"go\" * i\r\n if text.count(text2) > 0:\r\n text = text.replace(text2, \"***\")\r\nprint(text)", "n = int(input())\ns = input()\nfor i in range(50,-1,-1):\n cool_s = 'ogo'+i*'go'\n while cool_s in s:\n s = s[:s.find(cool_s)]+'***'+s[s.find(cool_s)+len(cool_s):]\nprint(s)", "n = int(input())\r\ns = input()\r\n\r\n\r\nwhile s.find(\"ogo\") != -1:\r\n i = s.find(\"ogo\")\r\n s = s[:i] + \"***\" + s[i+3:]\r\n i += 3\r\n while i < n-1 and s[i] == 'g' and s[i+1] == 'o':\r\n s = s[:i] + \"##\" + s[i+2:]\r\n i += 2\r\nfor i in s:\r\n if i == \"#\":\r\n continue\r\n print(i, end=\"\")", "import re\r\nn = int(input())\r\ns = re.sub(r'o(go)+', \"***\", input())\r\nprint(s)", "def cens(line):\n\tresult = \"\"\n\n\tgo = False\n\n\ti = 0\n\twhile i < len(line):\n\t\tif line[i: i + 3] == \"ogo\":\n\t\t\tgo = True\n\t\t\tresult += \"***\"\n\t\t\ti += 2\n\t\telif line[i: i + 2] == \"go\" and go:\n\t\t\ti += 1\n\t\telse:\n\t\t\tgo = False\n\t\t\tresult += line[i]\n\n\t\ti += 1\n\n\treturn(result)\n\n\ninput()\nline = input()\n\nprint(cens(line))\n\n'''\nimport random as r\n\nfor i in range(100):\n\tline = \"\"\n\tfor j in range(10):\n\t\tline += r.choice(\"go\")\n\n\tprint(cens(line), line)\n'''\n\n", "n = int(input())\r\ns = input()\r\nmas = ['ogo']\r\nfor i in range(50):\r\n mas.append(mas[-1] + 'go')\r\nwhile True:\r\n flag = False\r\n l = 0\r\n pos = 0\r\n s1 = ''\r\n for i in range(len(mas) - 1, -1, -1):\r\n if (s.find(mas[i]) != -1):\r\n flag = True\r\n l = len(mas[i])\r\n pos = s.find(mas[i])\r\n s1 = mas[i]\r\n break\r\n if not flag:\r\n break\r\n s = s[:pos] + '***' + s[pos + l:]\r\nprint(s)\r\n \r\n", "n, s = int(input()), input()\r\ns, ans = s + 'ii', []\r\ni = 0\r\nwhile i < n:\r\n if s[i] == 'o' and s[i + 1] == 'g' and s[i + 2] == 'o':\r\n i += 3\r\n while i < n and s[i] == 'g' and s[i + 1] == 'o':\r\n i += 2\r\n ans.append('***')\r\n else:\r\n ans.append(s[i])\r\n i += 1\r\nprint(''.join(ans))", "import re\nn, s = int(input()), input()\np = re.compile('o(go)+')\nprint(re.sub(p, '***', s))\n", "n = int(input())\r\ns = input()\r\ninterview_text = \"\"\r\ni = 0\r\n\r\nwhile i < n:\r\n if s[i:i+3] == 'ogo':\r\n interview_text += \"***\"\r\n i += 2\r\n while i + 1 < n and s[i + 1:i + 3] == 'go':\r\n i += 2\r\n else:\r\n interview_text += s[i]\r\n i += 1\r\n\r\nprint(interview_text)\r\n", "#Justin Hershberger\r\n#Py3.5\r\n\r\nimport fileinput\r\nimport re\r\n\r\ndef test():\r\n\tpass\r\nif __name__ == '__main__':\r\n\tnum_args = 2\r\n\tfor arg in range(num_args):\r\n\t\tif arg == 0:\r\n\t\t\tn = input()\r\n\t\telse:\r\n\t\t\ts = input()\r\n\r\n\t#re.sub will find any match to the pattern given and replace it with what you specify\r\n\tprint(re.sub(r'o(go)+', '***', s))\r\n", "import re\r\ninput();print(re.sub(r'o(go)+','***',input()))", "n = int(input())\r\ns = input()\r\ni = 0\r\nans = ''\r\nwhile i < n - 2:\r\n if s[i:i+3] == 'ogo':\r\n ans += '***'\r\n i += 3\r\n while i < n and s[i:i+2] == 'go':\r\n i += 2\r\n else:\r\n ans += s[i]\r\n i += 1\r\nif i < n:\r\n ans += s[i:n]\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nflag=False\r\ni=0\r\nans=''\r\nwhile i<n:\r\n if flag:\r\n if i+2<=n and s[i:i+2]=='go':\r\n i+=2\r\n else:\r\n ans+='***'\r\n flag=False\r\n elif s[i:i+3]=='ogo':\r\n flag=True\r\n i+=3\r\n else:\r\n ans+=s[i]\r\n i+=1\r\nif flag:\r\n ans+='***'\r\nprint(ans)", "n=int(input())\r\ns=input()\r\ni=0\r\notv=''\r\nwhile (i<n):\r\n if s[i]!='o':\r\n otv=otv+s[i]\r\n else:\r\n if s[i+1:i+3]=='go':\r\n otv=otv+'***'\r\n else:\r\n otv=otv+'o'\r\n while (s[i+1:i+3]=='go'):\r\n i=i+2\r\n i=i+1\r\nprint(otv)", "n = int(input())\r\ns = input()\r\ni = 0\r\nf = ''\r\nwhile i< n:\r\n\tc = 0\r\n\tif s[i:i+3] == 'ogo':\r\n\t\tc = 3\r\n\t\tfor j in range(i+3, n,2):\r\n\t\t\tif s[j:j+2] == 'go':\r\n\t\t\t\tc += 2\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\ti += c\r\n\t\tf += '***'\r\n\telse:\r\n\t\tf += s[i]\r\n\t\ti += 1\r\n\r\nprint(f)", "read = lambda: map(int, input().split())\r\nn = int(input())\r\ns = input()\r\ni = 0\r\na = []\r\nwhile i < n:\r\n if s[i] == 'o':\r\n cnt = 0\r\n while i + 2 < n and s[i + 1:i + 3] == 'go':\r\n i += 2\r\n cnt += 1\r\n if cnt:\r\n a.append('***')\r\n else:\r\n a.append(s[i])\r\n else:\r\n a.append(s[i])\r\n i += 1\r\nprint(''.join(a))\r\n", "n=int(input())\r\ns=input()\r\ni=0\r\nout=[]\r\nwhile i<n:\r\n\tif s[i:min(i+3, n)]==\"ogo\":\r\n\t\ti+=3\r\n\t\twhile i<n:\r\n\t\t\tif s[i:min(i+2, n)]==\"go\":\r\n\t\t\t\ti+=2\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\tout.append(\"***\")\r\n\telse:\r\n\t\tout.append(s[i])\r\n\t\ti+=1\r\nprint(\"\".join(out))", "import re\r\nn=int(input())\r\ns=input()\r\nprint(re.sub(\"ogo(go)*\",\"***\",s))", "import re\r\nn=int(input())\r\ns=input()\r\nka=re.sub('ogo(go)*','***',s)\r\nprint(ka)\r\n", "#n=int(input())\r\n#s=input()\r\n#b='ogo'\r\n#c='go'\r\n#sai=''\r\n#i=0\r\n#while True:\r\n# if s[i:i+3]==b:\r\n# k=i+3\r\n# while True:\r\n# if s[k:k+2]==c:\r\n# l=k\r\n# k=k+2\r\n# else:\r\n# v=3*'*'\r\n# sai=sai+v\r\n# i=k\r\n# break \r\n# else:\r\n# if i>=n:\r\n# print(sai)\r\n# break\r\n# else:\r\n# sai=sai+s[i]\r\n# i=i+1\r\nn = int(input())\r\ntext = input()\r\nfor i in range(50, -1, -1):\r\n text2 = \"ogo\" + \"go\" * i\r\n if text.count(text2) > 0:\r\n text = text.replace(text2, \"***\")\r\nprint(text) ", "#!/usr/bin/env python3\n\nN = input()\nword = input()\n\nnew_word = ''\n\n\ndef match(k):\n skip = 0\n if word[k:k+3] == 'ogo':\n skip = 3\n else:\n return skip\n while word[k+skip:k+skip+2] == 'go':\n skip += 2\n return skip\n\n\ni = 0\nwhile i < len(word):\n r = match(i)\n if r > 0:\n new_word += '***'\n i += r\n else:\n new_word += word[i]\n i += 1\nprint(new_word)\n", "n=int(input())\r\ns=input()\r\nfor i in range(96//2,-1,-1):\r\n s=s.replace(\"ogo\"+\"go\"*i,\"***\")\r\nprint(s)", "n = int(input())\r\nline = input()\r\nwhile(len(line) > 0):\r\n f = line.find(\"ogo\")\r\n if (f != -1):\r\n print(line[:f], end=\"\")\r\n print(\"***\", end=\"\")\r\n line = line[f + 3:]\r\n while (line.find(\"go\") == 0):\r\n line = line[2:]\r\n else:\r\n print(line, end=\"\")\r\n break", "n = input()\r\nst = input()\r\ns = \"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\"\r\nwhile st.find(\"ogo\") >= 0:\r\n i = 3\r\n k = 0\r\n while st.find(s[0:i]) >= 0:\r\n k = st.find(s[0:i])\r\n i = i + 2\r\n if k >= 0:\r\n st = st[0:k] + \"***\" + st[k+i-2:]\r\nprint(st)\r\n\r\n \r\n", "n = int(input())\r\ns = input()\r\ni, track = 0, []\r\nwhile i < len(s):\r\n e = i + 3\r\n if s[i:e] == 'ogo':\r\n base = s[i:e]\r\n while s[e:e+2] == 'go':\r\n base += s[e:e+2]\r\n e += 2\r\n track.append(base)\r\n i = e\r\n elif s[i:e] != 'ogo':\r\n i += 1\r\nfor i in range(len(track)):\r\n s = s.replace(track[i], '***', 1)\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\n\r\nl = 0\r\n\r\nwhile l < n:\r\n pos = s.find('ogo', l)\r\n if pos == -1:\r\n break\r\n print(s[l:pos], end = '')\r\n l = pos\r\n #print(s[l + 1:l + 3]) \r\n #print(l, end='')\r\n\r\n while l < n - 2 and s[l + 1:l + 3] == 'go':\r\n l += 2\r\n print('***', end = '')\r\n l += 1\r\n #print(l, end='')\r\n\r\nprint(s[l:])", "n = int(input())\r\ns = input()\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogogo', '***')\r\ns=s.replace('ogogogogogogo', '***')\r\ns=s.replace('ogogogogogo', '***')\r\ns=s.replace('ogogogogo', '***')\r\ns=s.replace('ogogogo', '***')\r\ns=s.replace('ogogo', '***')\r\ns=s.replace('ogo', '***')\r\nprint(s)", "n = int(input())\ns = str(input())\n\n\nwhile s.find('ogo') != -1:\n\n\n e = 0\n while s[s.find('ogo')+3+e*2:s.find('ogo')+3+2*(e+1)] == 'go':\n e+=1\n s = s.replace(s[s.find('ogo'):s.find('ogo')+3+e*2], '***', 1)\n\nprint(s)\n\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nres = ''\r\ni = 0\r\nwhile i < n:\r\n update = False\r\n if i+2 < n:\r\n ss = s[i:i+3]\r\n if ss == 'ogo':\r\n j = i+3\r\n while j+1 < n:\r\n sss = s[j:j+2]\r\n if sss == 'go':\r\n j += 2\r\n else:\r\n break\r\n i = j\r\n res += '***'\r\n update = True\r\n if update == False:\r\n res += s[i]\r\n i += 1 \r\nprint(res)", "n = int(input())\r\nk = str(input())\r\ni = k.find(\"ogo\")\r\nwhile i != -1:\r\n j = i\r\n while j <= n - 2:\r\n if k[j+1:j+3] == \"go\":\r\n j+=2\r\n else:\r\n break\r\n \r\n k = k.replace(k[i:j+1], \"***\", 1)\r\n i = k.find(\"ogo\")\r\nprint(k)\r\n ", "n=int(input())\r\ns=input()\r\nb='ogo'\r\nc='go'\r\nsai=''\r\ni=0\r\nwhile True:\r\n if s[i:i+3]==b:\r\n k=i+3\r\n while True:\r\n if s[k:k+2]==c:\r\n l=k\r\n k=k+2\r\n else:\r\n v=3*'*'\r\n sai=sai+v\r\n i=k\r\n break \r\n else:\r\n if i>=n:\r\n print(sai)\r\n break\r\n else:\r\n sai=sai+s[i]\r\n i=i+1", "n = int(input())\r\ns = input()\r\nl = list(s)\r\ni = 0\r\nwhile i < n:\r\n\tj = i\r\n\tif s[i] == \"o\":\r\n\t\tflag = 0\r\n\t\twhile s[i+1:i+3] == \"go\":\r\n\t\t\tflag +=1\r\n\t\t\ti = i+2\r\n\t\tif flag >= 1:\r\n\t\t\tfor x in range(j,j+3):\r\n\t\t\t\tl[x] = \"*\"\r\n\t\t\tfor x in range(j+3,i+1):\r\n\t\t\t\tl[x] = \"+\"\r\n\ti+=1\r\nans = \"\"\r\nfor i in l:\r\n\tif i != \"+\":\r\n\t\tans+=i\r\nprint(ans)", "import re\r\n\r\nn = input()\r\ncad = input()\r\n\r\nprint(re.sub(r'o(go)+', '***', cad))\r\n\r\n", "n=int(input())\r\ns=list(input())\r\nl=[]\r\ni=0\r\nwhile i<n :\r\n\tif s[i]==\"o\" and s[i+1:i+3]==[\"g\",\"o\"]:\r\n\t\tl.append(\"***\")\r\n\t\twhile i<n-1 and s[i+1:i+3]==[\"g\",\"o\"]:\r\n\t\t\ti+=2\r\n\t\ti+=1\r\n\telse:\r\n\t\tl.append(s[i])\r\n\t\ti+=1\r\nprint(\"\".join(l))\r\n", "def compute_prefix_function(p):\n \"\"\"\n Вычисляет префикс функцию паттерна p\n :param p: паттерн для kmp\n :return: преикс функцию для p\n \"\"\"\n s = [0] * len(p)\n border = 0 # текущая граница\n for i in range(1, len(p)):\n while border > 0 and p[i] != p[border]:\n border = s[border - 1]\n if p[i] == p[border]:\n border += 1\n else:\n border = 0\n s[i] = border\n return s\n\n\ndef kmp(p, t, sep='$'):\n \"\"\"\n находит индексы всех вхождений паттерна p в текст t\n :param p: паттерн\n :param t: текст\n :param sep: разделитель, который не встречается ни в p, ни в t\n :return: массив индексов всех вхождений p в t\n \"\"\"\n S = '{}{}{}'.format(p, sep, t)\n s = compute_prefix_function(S)\n result = []\n for i in range(len(p), len(S)):\n if s[i] == len(p):\n result.append(i - 2 * len(p))\n return result\n\n\nlength = int(input())\nstring = input()\n\nmatches = kmp('ogo', string)\nif not matches:\n print(string)\nelse:\n bounds = []\n i = 0\n while i < len(matches):\n left = matches[i]\n right = matches[i] + 2\n while True:\n if i >= len(matches):\n break\n else:\n if (i + 1 < len(matches)) and (left <= matches[i + 1] <= right):\n right += 2\n i += 1\n else:\n bounds.append((left, right))\n break\n i += 1\n i = 0\n j = 0\n output = []\n while (i < len(string)) or (j <=len(bounds)):\n if j < len(bounds):\n left, right = bounds[j]\n start = i\n while i != left:\n i += 1\n output.append(string[start: left])\n output.append('***')\n j += 1\n i = right\n else:\n output.append(string[i:])\n break\n i += 1\n print(''.join(output))\n", "input()\r\ns=input()\r\nfor i in range(99):\r\n s=s.replace('ogo','***',1)\r\n for i in range(99):s=s.replace('*go','*')\r\nprint(s)\r\n", "a = input()\r\na = input()\r\nwhile True:\r\n print(a[:a.find(\"ogo\")], end = \"\")\r\n if a.find(\"ogo\")!=-1:\r\n print(\"***\", end = \"\")\r\n a = a[a.find(\"ogo\")+3:]\r\n while (a[:2]==\"go\"):a = a[2:]\r\n else:\r\n try: print(a[-1])\r\n except: pass\r\n break", "n=int(input())\r\ns=list(input())\r\n\r\ni=0\r\nwhile i<=len(s)-3:\r\n\tif s[i:i+3]==['o','g','o']:\r\n\t\ts[i]='*'\r\n\t\ts[i+1]='*'\r\n\t\ts[i+2]='*'\r\n\t\twhile i+3<len(s)-1 and s[i+3]=='g' and s[i+4]=='o':\r\n\t\t\ts=s[:i+3]+s[i+5:]\r\n\ti+=1\r\n\r\nprint(''.join(s))", "import re\n\ndef norm(s):\n\tresult = re.sub(r'(ogo)(go)*', \"***\", s)\n\treturn result\n\ni = input()\ns = input()\nprint(norm(s))", "#!/usr/bin/python3\n\nimport re\n\nn = int(input())\ns = input()\n\ns = re.sub(r'ogo(go)*', '***', s)\nprint(s)\n", "l=int(input())\r\nstr=input()\r\n\r\nans=\"\"\r\ni=0\r\nflag=0\r\nwhile i<l:\r\n if str[i:i+3]==\"ogo\":\r\n flag=1\r\n ans+=\"***\"\r\n i+=3\r\n elif str[i:i+2]==\"go\" and flag:\r\n i+=2\r\n continue\r\n else:\r\n flag=0\r\n ans+=str[i]\r\n i+=1\r\n \r\nprint(ans)\r\n", "n = int(input())\ns = list(input())\nfor i, j in enumerate(s):\n if s[i:i+3] == list(\"ogo\"):\n to = i + 3\n num = 3\n x = i + num\n while s[i+num:i+num+2] == list(\"go\"):\n to += 2\n num += 2\n s[i:to] = list(\"***\")\nprint(\"\".join(s))\n", "n = int(input())\r\ns = str(input())\r\n\r\nfor i in range(n):\r\n if s[i:i+3] == 'ogo':\r\n j = i+3;\r\n s = s[0:i]+ '***' + s[i+3:]\r\n for k in range(j,j+1,2):\r\n while s[k:k+2] == 'go':\r\n s = s[0:k] + s[k+2:]\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\nptr = \"ogo\" + \"go\" * 50\r\nwhile len(ptr) > 1:\r\n s = s.replace(ptr, \"***\")\r\n ptr = ptr[:-2]\r\nprint(s)", "n = int(input())\ns = input()\n\nres = ''\ni = 0\nwhile i < len(s):\n sub = s[i:i+3]\n # print(sub)\n if sub == 'ogo':\n res += '***'\n i += 3\n while True:\n if 'go' == s[i:i+2]:\n i += 2\n else:\n break\n i -= 1\n else:\n res += s[i]\n\n i += 1\nprint(res)\n", "l = int(input())\ns = input()\n#l = len(s)\nl += 2\ns += ' '\nret = ''\ni = 0\nwhile i < l - 2:\n if s[i] == 'o' and s[i + 1] == 'g' and s[i + 2] == 'o':\n j = i + 3\n while j < l - 1:\n if s[j] == 'g' and s[j + 1] == 'o':\n j += 2\n else:\n break\n ret += '***'\n i = j\n else:\n ret += s[i]\n i += 1\nprint(ret)\n ", "input()\ns = input()\nl = s.find('ogo')\nwhile l != -1:\n r = l + 3\n while s[r:r+2] == 'go': r += 2\n s = s[:l] + '***' + s[r:]\n l = s.find('ogo')\nprint(s)\n", "input()\ns = input()\nm = [0 for i in range(len(s))]\ni = 0\nwhile i < len(s):\n if (i + 2) < len(s) and s[i:i + 3] == 'ogo':\n i += 3\n while (i < len(s) - 1) and s[i: i + 2] == 'go':\n i += 2\n print('***', end = \"\")\n i -= 1\n else:\n print(s[i], end= \"\")\n i += 1\n ", "p = int(input())\r\ns = input()\r\np = s.find('ogo')\r\ni = 0\r\nwhile p > -1:\r\n i = p + 3\r\n while s[i:i+2] == 'go':\r\n i = i + 2\r\n s = s[0:p] + '***' + s[i:len(s)]\r\n p = s.find('ogo')\r\nprint(s)\r\n", "n = int(input())\r\ns = input()\r\nimport re\r\nprint(re.sub(r'o(go)+', \"***\", s))\r\n", "s=int(input()) \r\nstring=input() \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogogo\",\"***\") \r\nstring=string.replace(\"ogogogo\",\"***\") \r\nstring=string.replace(\"ogogo\",\"***\") \r\nstring=string.replace(\"ogo\",\"***\") \r\nprint(string)", "n = int(input())\r\n\r\nstr = input()\r\n\r\nfilterStr = 'ogo'\r\n\r\nwhile len(filterStr) + 2 <= len(str):\r\n filterStr += 'go'\r\n\r\n\r\nwhile len(filterStr) - 2 >= 0:\r\n str = str.replace(filterStr,'***')\r\n filterStr = filterStr[:-2]\r\n\r\nprint(str)", "n = int(input())\r\ns = input()\r\ni = 0\r\nr = \"\"\r\n\r\nwhile i < len(s):\r\n if len(s) - i >= 3 and s[i: i + 3] == 'ogo':\r\n r += '***'\r\n i += 3\r\n while len(s) - i >= 2 and s[i: i + 2] == 'go':\r\n i += 2\r\n else:\r\n r += s[i]\r\n i += 1\r\n\r\n\r\nprint(r)\r\n", "n = int(input())\r\na = input()\r\ni = 0\r\nb = ''\r\nwhile i + 2 < n:\r\n if a[i] + a[i+1] + a[i+2] == 'ogo':\r\n i += 1\r\n while i + 1 < n and a[i] + a[i + 1] == 'go':\r\n i += 2\r\n b += '***'\r\n else:\r\n b += a[i]\r\n i += 1\r\nwhile i < n:\r\n b += a[i]\r\n i += 1\r\nprint(b)\r\n ", "import re\r\nn=input()\r\ns=input()\r\nprint(re.sub(r\"ogo(go)*\", \"***\",s))", "import sys\r\nn = int(input())\r\ns = input()\r\ns += '%%'\r\na = [0] * n\r\ni = 0\r\nwhile i < n:\r\n if s[i : i + 3] == 'ogo':\r\n a[i] = '*'\r\n a[i + 1] = '*'\r\n a[i + 2] = '*'\r\n i += 3\r\n while s[i : i + 2] == 'go':\r\n a[i] = ''\r\n a[i + 1] = ''\r\n i += 2\r\n else:\r\n a[i] = s[i]\r\n i += 1\r\nprint(*a, sep = '')", "import re\nInput=lambda:map(int,input().split())\n\n'''\nThe re.sub() function in the re module can be used to replace substrings.\n The syntax for re.sub() is re.sub(pattern,repl,string).\n That will replace the matches in string with repl\n'''\n\nn = int(input())\ns = input()\nt = re.sub('o(go)+','***',s)\nprint(t)", "pat = __import__(\"re\").compile(\"o(go)+\")\r\ninput()\r\nline = input()\r\nwhile True:\r\n s = pat.search(line)\r\n if not s:\r\n break\r\n s = s.span(0)\r\n line = line[:s[0]] + \"***\" + line[s[1]:]\r\n\r\nprint(line)", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n import re\r\n\r\n try:\r\n while True:\r\n input()\r\n print(re.sub(r\"o(go)+\", \"***\", input()))\r\n\r\n except EOFError:\r\n pass\r\n\r\nmain()\r\n", "n = int(input())\r\nword = input()\r\n\r\n\r\nogos = [\"og\" * (x + 1) + \"o\" for x in range((n + 1) // 2)]\r\nogos = ogos[::-1]\r\n\r\nfor ogo in ogos:\r\n word = word.replace(ogo, \"***\")\r\n\r\nprint(word)", "n = int(input())\r\ns = input() + '~~~~'\r\nres = ''\r\ni = 0\r\nwhile i < n:\r\n if s[i] + s[i + 1] + s[i + 2] == 'ogo':\r\n i += 3\r\n res += '***'\r\n while s[i] + s[i + 1] == 'go':\r\n i += 2\r\n else:\r\n res += s[i]\r\n i += 1\r\nprint(res.replace('!', ''))", "n = int(input())\r\na = input()\r\nb = []\r\ni = 0\r\nwhile i<n:\r\n if a[i]==\"o\":\r\n if i+2<n:\r\n if a[i+1]==\"g\" and a[i+2]==\"o\":\r\n j = i+3\r\n b.append(\"***\")\r\n while j+1<n:\r\n k = a[j]+a[j+1]\r\n if k==\"go\":\r\n j+=2\r\n else:\r\n break\r\n i = j\r\n else:\r\n b.append(a[i])\r\n i+=1\r\n else:\r\n b.append(a[i])\r\n i+=1\r\n else:\r\n b.append(a[i])\r\n i+=1\r\nprint(\"\".join(b))\r\n", "import re\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nprint(re.sub('ogo(go)*' , '***' , s))\r\n\r\n\r\n\r\n\r\n", "#!/bin/python3\n\nimport sys, re\n\n\ndef main():\n\tn = int(input())\n\ts = (input())\n\tres = re.sub(r'ogo(go)*', '***', s) \n\tprint(res)\n\n\nif __name__ == '__main__':\n\tmain()\n" ]

[ "def give(n,d):\r\n if n%d:\r\n return n//d+1\r\n else:\r\n return n//d\r\n \r\nk,d,t=list(map(int,input().split()))\r\np=give(k,d)*d\r\nif d>=k: a=k\r\nelse: a=p-p%k\r\nq=(p-a)/2\r\nans=t//(a+q)*p\r\nr=t-t//(a+q)*(a+q)\r\nif r<=a:\r\n\tans+=r\r\nelse:\r\n\tans+=a\r\n\tr-=a\r\n\tans+=r*2\r\nprint(ans)", "\r\nk,d,t=map(int,input().split())\r\nt*=2\r\ndays=0 \r\n \r\n\r\nif(k==d):\r\n days=t/2\r\nelif(k>d):\r\n p=t//(2*k+d-(k-1)%d -1)\r\n #print(p)\r\n #print(k+d-(k-1)%d -1)\r\n days+=p*(k+d-(k-1)%d -1)\r\n #print(days)\r\n t=t%(2*k+d-(k-1)%d -1)\r\n if(t<2*k):\r\n days+=t/2\r\n else:\r\n \r\n days+=k\r\n t-=2*k\r\n days+=t\r\nelse:\r\n p=t//(d+k)\r\n days+=p*(d)\r\n t=t%(d+k)\r\n if(t<2*k):\r\n days+=t/2\r\n else:\r\n days+=k\r\n t-=2*k\r\n days+=t\r\nprint(days)\r\n \r\n \r\n", "k, d, t = map(int, input().split())\r\n\r\noff = (k // d) * d + d - k if k % d != 0 else 0\r\nperiod = k + off\r\nperformance = off / 2 + k\r\n\r\npart = int(t / performance)\r\nans = part * period\r\nt -= part * performance\r\nif t <= k:\r\n ans += t\r\nelse:\r\n ans += k\r\n t -= k\r\n ans += 2 * t\r\nprint(ans)\r\n", "k, d, t = list(map(int, input().split()))\r\nif k % d == 0:\r\n print(t)\r\n exit()\r\nm = (k+d-1) // d * d\r\nif 2*t % (m+k) == 0:\r\n print(m*2*t / (m+k))\r\n exit()\r\nn = 2*t // (m+k)\r\nres = n*m\r\nf = 1 - (m +k) * n/(2*t)\r\nif f <= k/t:\r\n print(res+f*t)\r\nelse:\r\n res += k\r\n f -= k / t\r\n print(res + f*2*t)\r\n", "k,d,t = map(int,input().split())\r\nif k>=t or k%d==0:\r\n print(t)\r\n exit()\r\nx = d - (k%d)\r\nnum = 2*t//(2*k + x)\r\nrem = t - num*(k + x/2)\r\nans=(k+x)*num\r\nif rem+.0000000001<=k:\r\n ans+=rem\r\nelse:\r\n ans += k +(rem-k)*2\r\nprint(ans) \r\n\r\n", "k, d, t = map(int, input().split())\nt *= 2\nif k > d:\n\tif k%d == 0:\n\t\td = k\n\telse:\n\t\td = (k//d+1)*d\nq = d+k\nans = t//q*d\nt %= q\nif t <= 2*k:\n\tprint(ans+t/2)\nelse:\n\tprint(ans+t-k)", "k,d,t=map(int,input().split())\r\nl=int(1)\r\nr=int(1000000000000000000)\r\nwhile l<r:\r\n m=(l+r)//2\r\n if m*d>=k:\r\n r=m\r\n else:\r\n l=m+1\r\nck=d*l\r\npeerck=k+(ck-k)/2.0\r\nl=int(0)\r\nr=int(1000000000000000000)\r\nwhile l<r:\r\n m=(l+r)//2\r\n if (r-l)%2==1:\r\n m=m+1\r\n if peerck*m<=t:\r\n l=m\r\n else:\r\n r=m-1\r\nres=l*ck\r\nt=t-peerck*l\r\nif k>t:\r\n print (res+t)\r\nelse :\r\n print (res+(t-k)*2+k)\r\n", "k,d,t=map(int,input().split())\ntime = int(((k - 1) / d))/1.0+1\nperiod = time * d\nresult = 0\ntime_p =int(2 * t / (period + k))/1.0\nresult += time_p * period\nrest = 2 * t - (period + k) * time_p\nif (rest < 2 * k):\n result += rest / 2\nelse:\n result += k\n result += rest-2 * k\nprint(\"{}\".format(result))", "k,d,t=map(int,input().split())\r\nif k%d==0 :\r\n print(float(t))\r\n exit()\r\nx=((k//d)+1)*d\r\n##print(x)\r\ny=(k + (x-k)/2)\r\n#print(y)\r\nz=(t//y)\r\n#print(z*y)\r\nl=t-(z*y)\r\nm=min(l,k) \r\nl-=(m)\r\n#print(l)\r\nans=(z*x+ m+ [0,l*2][l>0])\r\nprint(ans)\r\n", "import math\r\n\r\ndef calculate_cooking_time(k, d, t):\r\n \"\"\"\r\n Calculate the total time required to cook the chicken.\r\n\r\n Parameters:\r\n - k: The time in minutes the stove stays on.\r\n - d: The time in minutes Julia goes to the kitchen.\r\n - t: The time in minutes required to cook the chicken.\r\n\r\n Returns:\r\n - ans: The total time in minutes required to cook the chicken.\r\n \"\"\"\r\n t *= 2\r\n cycle = math.ceil(k / d) * d\r\n full = t // (cycle + k)\r\n rem = t % (cycle + k)\r\n if rem <= 2 * k:\r\n return full * cycle + rem * 0.5\r\n else:\r\n return full * cycle + rem - k\r\n\r\nif __name__ == \"__main__\":\r\n # Read input values from standard input\r\n k, d, t = map(int, input().split())\r\n # Calculate and print the total cooking time\r\n print(calculate_cooking_time(k, d, t))", "import math\r\nk,d,t=map(int,input().split())\r\nl=(math.ceil(k/d)*d)-k\r\nm=(2*t)//(2*k+l)\r\nif (t-m*(k+(l/2)))<=k:\r\n print(m*(k+l)+t-m*(k+(l/2)))\r\nelse:\r\n print(m*(l+k)+k+2*(t-m*(k+(l/2))-k))", "k, d, t = [int(x) for x in input().split()]\n\n\ndef solve(k, d):\n if k > t:\n print(t)\n else:\n cook = k + (d-k)/2\n times = t // cook\n temp = t - cook*times\n if temp > k:\n print(d * times + k + (temp - k) * 2)\n else:\n print(d * times + temp)\n\n\nif k < d:\n solve(k, d)\nelif k == d:\n print(t)\nelse:\n temp = k//d\n if temp == k/d:\n print(t)\n else:\n solve(k, (temp+1)*d)\n\n", "[k,d,t ] = input().split(' ')\r\nk = float(k)\r\nd = float(d)\r\nt = float (t)\r\n\r\nT = ((k-1)//d+1)*d \r\nT1 = k + (T-k)*0.5\r\nans = 0\r\nans =t//T1*T\r\na = t-t//T1*T1\r\n\r\n#print(a)\r\nif a < k:\r\n ans = ans + a\r\nelse :\r\n ans = ans + k+(a-k)*2\r\nprint(ans)\r\n", "from math import ceil\r\nk , d , t = [int(x) for x in input().split()]\r\n\r\n\r\nn = ceil(k/d)*d\r\ndiff = n - k\r\nnew_k = k+(diff/2)\r\nres = (t//new_k)*n\r\nif t%new_k <= k :\r\n res += t%new_k\r\nelse :\r\n res += k+(t%new_k- k)*2\r\nprint(res)\r\n \r\n\r\n", "from math import *\r\nk,d,t=map(int,input().split())\r\nif d<k:\r\n l=ceil(k/d)*d\r\n w=l-k\r\nelse:\r\n w=d-k\r\ndiv=2*k+w\r\nans=((2*t)//div)*(w+k)\r\nrem=(2*t)%div\r\nif rem!=0:\r\n if rem<=2*k:\r\n ans+=rem/2\r\n else:\r\n ans+=rem-k\r\nprint(ans)\r\n", "k, d, t = map(int, input().split())\r\n\r\nif (k % d == 0):\r\n d = (int(k / d)) * d\r\nelse:\r\n d = (int(k / d) + 1) * d\r\np = k + (d - k) / 2\r\nz = int(t / p) * d\r\ne = int(t / p) * p\r\nif (t - e < k):\r\n z += (t - e)\r\nelse:\r\n z += k + (t - e - k) * 2\r\nprint(z)\r\n", "import math\n\nk, d, t = [int(i) for i in input().split()]\nb = 0 if k % d == 0 else (k // d + 1) * d - k\n#print(\"b\", b)\n\np = k + b / 2\n#print(\"p\", p)\n\nans = math.floor(t / p) # * (k + b)\ntmp = t - ans * p\nans *= k + b\nif tmp <= k:\n ans += tmp\nelse:\n ans += k\n tmp -= k\n ans += tmp * 2\n\nprint(ans)\n", "import math\r\n\r\ndef check(tim,k,d,t):\r\n if(tim<d):\r\n\r\n sing=k\r\n dt=tim-k\r\n x=dt/2+sing\r\n if(x>=t):\r\n return True\r\n else:\r\n return False\r\n \r\n dg=d-k\r\n it=math.floor(tim/d)\r\n sing=k*it\r\n doublet=dg*it\r\n rem=tim-sing-doublet\r\n if(rem<=k):\r\n sing+=rem\r\n else:\r\n sing+=k\r\n rem-=k\r\n doublet+=rem\r\n \r\n x=doublet/2+sing\r\n if(x>=t):\r\n return True\r\n else :\r\n return False\r\n\r\n\r\nk,d,t=map(int,input().split())\r\nif t<=k or d==k:\r\n print(t)\r\nelse :\r\n d=math.ceil(k/d)*d\r\n if d==k:\r\n print(t)\r\n else :\r\n l=0\r\n r=2*t\r\n mid=0\r\n ans=r\r\n for i in range(0,150):\r\n mid=(l+r)/2\r\n if(check(mid,k,d,t)):\r\n r=mid\r\n ans=mid\r\n else :\r\n l=mid\r\n print(ans) ", "from sys import stdin, stdout\r\nfrom random import randrange\r\n\r\n\r\nk, d, t = map(int, stdin.readline().split())\r\nEPS = 10 ** (-9)\r\nchicken = 100\r\n\r\nd = ((k + d - 1) // d) * d\r\n\r\nif False:\r\n stdout.write(str(chicken * t / 100))\r\nelse:\r\n \r\n l, r = -1, 2 * t + 10\r\n while r - l > 1:\r\n m = (l + r) >> 1\r\n \r\n cnt = m * k + m * (d - k) / 2\r\n \r\n if cnt * 100 / t >= 100:\r\n r = m\r\n else:\r\n l = m\r\n \r\n cnt = l * k + l * (d - k) / 2\r\n chicken = chicken - cnt * 100 / t\r\n ans = l * k + l * (d - k)\r\n \r\n if k * 100 / t >= chicken:\r\n ans += chicken * t / 100\r\n chicken = 0\r\n else:\r\n ans += k\r\n chicken -= k * 100 / t\r\n ans += chicken * 2 * t / 100\r\n chicken = 0\r\n\r\nstdout.write(str(ans))", "k,d,t=map(int,input().split())\r\nm= (k+d-1)//d\r\nextra=m*d - k\r\nc=extra/2.0\r\ntot=k+c\r\ndd=t//tot\r\nans=dd*(k+extra)\r\nxx= t - dd*tot\r\nif xx<=k:\r\n ans=ans+xx\r\nelse:\r\n ans=ans+k\r\n xx=xx-k\r\n ans=ans + xx*2\r\n\r\nprint(float(ans))", "k, d, t = map(int, input().split())\r\nt *= 2\r\nl, r = 0, 4 * 10 ** 18 + 1\r\nfor i in range(200):\r\n m = (l + r) / 2\r\n x = ((k - 1) // d + 1) * d\r\n p = min(k, m % x)\r\n if t <= m + m // x * k + p:\r\n r = m\r\n else:\r\n l = m\r\nprint(r)", "this_line = input().split()\r\nk = int(this_line[0])\r\nd = int(this_line[1])\r\nt = float(this_line[2]) \r\n\r\n\r\nif(k%d==0):\r\n print(t)\r\n exit()\r\n\r\nans = 0.0\r\ncook = 0.0\r\n\r\nleft = 0\r\n\r\nif(k>d):\r\n left = d-k%d\r\nelse:\r\n left = d-k\r\n\r\noneLoop = k + left*0.5\r\nloopTime = int(t/oneLoop)\r\n\r\nans += loopTime *(k + left)\r\ncook += loopTime * oneLoop\r\n\r\nif(cook + k < t):\r\n cook += k\r\n ans +=k\r\nelse:\r\n ans += t-cook\r\n cook = t\r\n\r\nif (cook + left * 0.5 <t):\r\n cook += left*0.5\r\n ans+=left\r\nelse:\r\n ans += (t-cook) * 2\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "k, d, t = map (int, input ().split ())\r\nif k == d : print (t); exit (0)\r\nx = (k + d - 1) // d\r\nt *= 2\r\ncost = k * 2 + x * d - k\r\nans = t // cost * x * d\r\nt %= cost\r\nif k * 2 < t : print (ans + k + t - 2 * k); exit (0)\r\nelse : print (ans + t / 2)\r\n\r\n", "k, d, t = [int(c) for c in input().split(\" \")]\r\n\r\ndef find_least_mul(a, b):\r\n if a%b > 0:\r\n return a + b - a%b\r\n else:\r\n return a\r\n\r\ndef solve(k, d, t):\r\n ld = find_least_mul(k, d)\r\n\r\n # How many progress go for one cycle?\r\n ld_progress = (k + ld) / (t*2) # k/t + 0.5 * (ld-k)/t\r\n\r\n total_cycle = 1 // ld_progress\r\n rest_progress = 1 - ld_progress * total_cycle\r\n rest_time = 0\r\n\r\n if rest_progress > k/t:\r\n rest_time += k\r\n rest_progress -= k/t\r\n rest_time += rest_progress * 2 * t\r\n\r\n else:\r\n rest_time += rest_progress * t\r\n\r\n return total_cycle * ld + rest_time\r\n\r\nprint(solve(k, d, t))\r\n", "k, d, t = map(int, input().split())\r\n\r\nif k >= t or k%d == 0:\r\n\tprint(t)\r\n\texit()\r\n\r\nif d < k:\r\n\tdd = d*(k//d)\r\n\td = dd+d\r\n\r\nno_of_cycles = 2*t//(k+d)\r\ncooked = no_of_cycles*(k+d)/(2*t)\r\nremaining = 1-cooked\r\nans = no_of_cycles*d\r\n# print(no_of_cycles, ans, remaining, cooked)\r\nif remaining <= k/t:\r\n\t# print(\"AA\")\r\n\tans += remaining*t\r\nelse:\r\n\tremaining -= k/t\r\n\tans += k\r\n\tans += remaining * 2*t\r\nprint(ans)\t\r\n\r\n\r\n", "k,d,t = map(int, input().split())\nfrom math import gcd\nif gcd(k,d) == d or k >= t:\n print(t)\n exit(0)\n\nfrom fractions import Fraction\nr1a, r1b = Fraction(k, 1), Fraction(d - (k % d), 2)\nr1 = r1a + r1b\nrt = Fraction(t, 1)\n\nm = rt // r1\nr = rt % r1\nb = m * k + m * (d - (k % d))\nif r <= r1a:\n print(b + float(r))\nelse:\n print(b + k + 2 * float(r - r1a))", "# -*- coding: utf-8 -*-\r\nk, d, t = [int(x) for x in input().split()]\r\ntt = t * 2\r\nt_loop = ((k - 1) // d + 1) * d\r\namount = k * 2 + (t_loop - k)\r\nn_loop = tt // amount\r\nrem = tt % amount\r\nif rem <= k * 2:\r\n print(n_loop * t_loop + rem / 2)\r\nelse:\r\n print(n_loop * t_loop + rem - k)", "k,d,t=map(int,input().split())\r\nd=((k+d-1)//d)*d\r\nn=2*t//(d+k)\r\nx=2*t%(d+k)\r\nif (x<=2*k):\r\n ans=x/2+d*n\r\nelse:\r\n ans=x-k+d*n\r\nprint(ans)", "K, D, T = map(int, input().split())\nivl = D * ((K + D - 1) // D)\nfp = float(K)/float(ivl)\nsp = 1.0-fp\na = 0.0\nb = 2.0*T\nfor ii in range(300):\n t = 0.5*(a+b)\n ivls = t // ivl\n cooked = ivls * ivl * (2.0*fp + sp)\n rt = t - ivls*ivl\n rft = min(fp*ivl, rt)\n rsp = max(0.0, rt - rft)\n cooked += 2.0*rft + rsp\n if cooked < 2.0*T:\n a = t\n else:\n b = t\nt = 0.5*(a+b)\nprint(\"%.10f\" % t)\n", "from math import *\r\nk,d,t=map(int,input().split())\r\nd=ceil(k/d)*d\r\nrep,rem=divmod(t,k+(d-k)*.5)\r\nprint(d*rep+min(k,rem)+max((rem-k)*2,0))\r\n", "\r\nk,d,t = map(int,input().split()) \r\nif (k%d==0):print(t)\r\nelse:\r\n\r\n if (d>=k):gap=d-k\r\n else :\r\n gap = (k//d+1)*d-k\r\n rd = k+gap/2;\r\n tt=k+gap\r\n ans = (t//rd)*tt;\r\n# print(ans)\r\n rem=t- (t//rd)*rd\r\n# print(rem)\r\n \r\n # ek bar k aur gap me\r\n \r\n \r\n if (k>=rem):\r\n ans+=rem;\r\n else:\r\n ans+=k\r\n rem-=k\r\n ans+=(rem*2)\r\n print(ans)\r\n \r\n\r\n\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Mar 8 22:15:19 2018\r\n\r\n@author: Nikita\r\n\"\"\"\r\nfrom math import ceil, floor\r\nk, d, t = map(int, input().split())\r\nperiod = 0\r\nif k <= d:\r\n period = d\r\nelse:\r\n period = ceil(k / d) * d\r\ncooking = k + period\r\nnum = floor(2 * t / cooking)\r\ncarry = 2 * t - num * cooking\r\nans = 0\r\nif carry > 2 * k:\r\n ans = num * period + carry - k\r\nelse:\r\n ans = num * period + carry / 2\r\nprint(ans)\r\n", "# LUOGU_RID: 135255892\nimport math\n\ndef calculate_cooking_time(k, d, t):\n \"\"\"\n Calculate the total time required to cook the chicken.\n\n Parameters:\n - k: The time in minutes the stove stays on.\n - d: The time in minutes Julia goes to the kitchen.\n - t: The time in minutes required to cook the chicken.\n\n Returns:\n - ans: The total time in minutes required to cook the chicken.\n \"\"\"\n t *= 2 #按照关火状态算\n cycle = math.ceil(k / d) * d\n on = min(cycle, k) * 2 #开火状态2倍速度\n off = cycle - on / 2 #关火状态\n full = t // (on + off) #需要多少个周期才能烤完，1\n rem = t % (on + off) #5\n # print(t, on, off)\n # print(full, rem)\n if rem <= on:\n ans = full * cycle + rem / 2\n else:\n ans = full * cycle + on / 2 + rem - on\n return ans\n\nif __name__ == \"__main__\":\n # Read input values from standard input\n k, d, t = map(int, input().split())\n # Calculate and print the total cooking time\n print(calculate_cooking_time(k, d, t))", "R = lambda: map(int, input().split())\r\nk, d, t = R()\r\np = (k // d + (1 if k % d else 0)) * d\r\nkp = k / t\r\nwp = (p - k) / (2 * t)\r\nri = 1 // (kp + wp) * p\r\nrm = 1 % (kp + wp)\r\nrr = rm / kp * k if rm < kp else k + (rm - kp) / wp * (p - k)\r\nprint(ri + rr)", "[k,d,t ] = input().split(' ')\nk = float(k)\nd = float(d)\nt = float (t)\n\nT = ((k-1)//d+1)*d #一个周期得时间\nT1 = k + (T-k)*0.5#一个周期所能完成得\n\n#print(T)\n#print(T1)\nans = 0\nans = ans + t//T1*T\na = t-t//T1*T1\n\n#print(a)\nif a < k:\n ans = ans + a\nelse :\n ans = ans + k+(a-k)*2\nprint(ans)\n \n", "k,d,t=input().split()\r\nk,d,t=int(k),int(d),int(t)\r\non=k\r\noff=d-(k-1)%d-1\r\ncycle=on+off/2\r\ntime=(on+off)*(t//cycle)\r\nt-=cycle*(t//cycle)\r\nif t<k:\r\n\tprint(t+time)\r\nelse:\r\n\tprint(time+k+(t-k)*2)", "#!/usr/bin/python3\n\nk, d, t = (float(s) for s in input().split())\n\nn = k // d\nr = d - k % d\nT = n * d\nif k % d != 0:\n T += d\ndt = k\nif k % d != 0:\n dt += r / 2\n\ncnt = t // dt\nrem = t % dt\nrest = 0\nif rem < k:\n rest = rem\nelse:\n rest = k + (rem - k) * 2\n\nprint(cnt * T + rest)\n", "import math\r\nk,d,t=map(int,input().split())\r\np=math.ceil(k/d)*d\r\nc=((2*k)+(p-k))\r\nans=((2*t)//c)*p\r\nt=(2*t)%c\r\nif(t<=2*k):\r\n x=t/2.0\r\n ans+=x\r\nelse:\r\n ans+=t-k\r\nprint(ans)", "k, d, t = map(int, input().split())\n\na = 2*k+((k+d-1)//d)*d-k\nq, r = divmod(2*t, a)\nT = q*(((k+d-1)//d)*d)\nif 0 <= r <= 2*k:\n T += r/2\nelse:\n T += k+(r-2*k)\nprint(T)\n", "import math \r\nn,d,t=map(int,input().split())\r\nk=d\r\nif n%k==0:\r\n d=n\r\nelse:\r\n d=n+k-n%k\r\n#print(d)\r\nans=math.floor(1/((1/t)*n+((d-n)*(1/t)/2)))\r\nleft=1-ans*((1/t)*n+((d-n)*(1/t)/2))\r\nans*=d\r\nif left<=n/t:\r\n ans+=left*t\r\nelse:\r\n ans+=n+(left-n/t)*2*t\r\nprint(ans)\r\n", "#OMM NAMH SHIVAY\r\n#JAI SHREE RAM\r\nimport sys,math,heapq,queue\r\nfrom collections import deque\r\nfrom functools import cmp_to_key\r\nfast_input=sys.stdin.readline \r\nk,d,t=map(int,fast_input().split())\r\nc=math.ceil(k/d)*d \r\nr=c-k \r\none_round=k+r/2 \r\nreq=math.floor((t/one_round))\r\nrem=t-req*one_round\r\nif rem<=k:\r\n print(rem+req*(r+k))\r\nelse:\r\n rem-=k \r\n print(k+rem*2+req*(r+k))", "k,d,t = map(int,input().split())\r\nif k%d == 0 or k >= t:\r\n print(t)\r\n\r\nelse:\r\n if k < d:\r\n w1 = k\r\n w2 = d-k\r\n e = w1/t\r\n r = w2/(2*t)\r\n s = e+r\r\n\r\n else:\r\n w1 = k\r\n w2 = d-(k%d)\r\n e = w1/t\r\n r = w2/(2*t)\r\n s = e+r\r\n\r\n l = 1.0//s\r\n ans = (w1+w2)*l\r\n v = 1.0%(e+r)\r\n a = 0\r\n if e == v:\r\n v -= e\r\n print(ans + w1)\r\n exit()\r\n\r\n if e < v:\r\n a = w1\r\n v -= e\r\n a += (v * 2 * t)\r\n print(ans + a)\r\n exit()\r\n\r\n a = v * t\r\n print(ans + a)\r\n exit()", "k,d,t=map(int,input().split())\nd=((k+d-1)//d)*d\nn=2*t//(d+k)\nx=2*t%(d+k)\nif (x<=2*k):\n ans=x/2+d*n\nelse:\n ans=x-k+d*n\nprint(ans)\n \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\nif n == 1:\r\n print('+')\r\nelif n == 2:\r\n print('-+')\r\nelse:\r\n ans = ['+']\r\n cur = arr[-1]\r\n for i in range(n - 2, -1, -1):\r\n if cur > 0:\r\n cur -= arr[i]\r\n ans.append('-')\r\n else:\r\n cur += arr[i]\r\n ans.append('+')\r\n ans.reverse()\r\n if cur < 0:\r\n for i in range(n):\r\n if ans[i] == '-':\r\n ans[i] = '+'\r\n else:\r\n ans[i] = '-'\r\n print(''.join(ans))\r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\n\r\ntemp_sgn=1\r\nsgns=[]\r\ncurr_sum=0\r\nfor i in range(n):\r\n\tif(curr_sum>=a[n-i-1]):\r\n\t\tsgns.append(1)\r\n\t\tsgns.append(-1)\r\n\t\tcurr_sum-=a[n-i-1]\r\n\telse:\r\n\t\tsgns.append(-1)\r\n\t\tsgns.append(1)\r\n\t\tcurr_sum-=a[n-i-1]\r\n\t\tcurr_sum*=-1\r\nsgns.reverse()\r\nans=[]\r\nfor i in range(2*n):\r\n\tif(i%2==0):\r\n\t\tans.append(temp_sgn*sgns[i])\r\n\telse:\r\n\t\ttemp_sgn*=sgns[i]\r\nfor x in ans:\r\n\tif(x==1):\r\n\t\tprint('+',end='')\r\n\telse:\r\n\t\tprint('-',end='')\r\n\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\ns=0\r\nres=[]\r\nj=n-1\r\nwhile(j>=0):\r\n if s<=0:\r\n s+=b[j]\r\n res.append(1)\r\n\r\n else:\r\n s-=b[j]\r\n res.append(0)\r\n\r\n j+=-1\r\n\r\nres.reverse()\r\nif s>=0:\r\n for j in res:\r\n if j:\r\n print(\"+\",end=\"\")\r\n else:\r\n print(\"-\",end=\"\")\r\n \r\nelse:\r\n for j in res:\r\n if j:\r\n print(\"-\",end=\"\")\r\n else:\r\n print(\"+\",end=\"\")\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nr = [0] * n\r\ns = 0\r\nfor i in range(n - 1, -1, -1):\r\n if abs(s + a[i]) <= a[i]:\r\n s += a[i]\r\n else:\r\n s -= a[i]\r\n r[i] = 1\r\nif s<0:\r\n print(''.join(['-', '+'][i] for i in r))\r\nelse:\r\n print(''.join(['+', '-'][i] for i in r))", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt.reverse()\r\ns, p = 0, [0] * n\r\nfor i, j in enumerate(t):\r\n if s > 0:\r\n p[i] = 1\r\n s -= j\r\n else: s += j\r\np.reverse()\r\nif s < 0: print(''.join('-+'[i] for i in p))\r\nelse: print(''.join('+-'[i] for i in p))" ]

[ "t = input()\r\nn, m = len(t) + 1, 1000000007\r\na, b = 0, t.count(')') - 1\r\nf = [1] * n\r\nfor i in range(2, n): f[i] = i * f[i - 1] % m\r\ng = [pow(q, m - 2, m) for q in f]\r\ns = 0\r\nfor q in t:\r\n if b < 0: break\r\n if q == '(':\r\n a += 1\r\n s += f[a + b] * g[a] * g[b]\r\n else: b -= 1\r\nprint(s % m)" ]

[ "r,c = map(int,input().split())\r\nind_c =[]\r\nind = None\r\nfor i in range(r):\r\n s = input()\r\n if s.count('*') == 1:\r\n ind = [i,s.index('*')]\r\n elif s.count('*')>1:\r\n for j in range(c):\r\n if s[j] == '*':\r\n ind_c.append(j)\r\n \r\nif ind[1] == ind_c[1]:\r\n print(ind[0]+1,ind_c[0]+1)\r\nelse:\r\n print(ind[0]+1,ind_c[1]+1)\r\n", "N, M = [int(X) for X in input().split()]\r\nA = []\r\nfor i in range (N):\r\n\tB = input()\r\n\tA.append([i for i in B])\r\npts = []\r\nfor i in range (N):\r\n\tfor j in range (M):\r\n\t\tif A[i][j] == '*':\r\n\t\t\tpts.append((i,j))\r\n# print (pts)\r\nX = []\r\nY = []\r\nfor i in pts:\r\n\tX.append(i[0])\r\n\tY.append(i[1])\r\n# print (X)\r\n# print (Y)\r\nx = None\r\ny = None\r\nfor i in X:\r\n\tif X.count(i) == 1:\r\n\t\tx = i\r\n\t\tbreak\r\nfor i in Y:\r\n\tif Y.count(i) == 1:\r\n\t\ty = i\r\n\t\tbreak\r\nprint (x+1,y+1)", "n,m = input().split()\r\ntable = []\r\nrow = []\r\nfor i in range(int(n)):\r\n\r\n a=str(input())\r\n table.append(a)\r\n if a.find('*')>=0:\r\n row.append(i)\r\nfor i in range(int(m)):\r\n if table[row[0]][i]=='*' and table[row[1]][i]=='*':\r\n continue\r\n elif table[row[0]][i]=='*' and table[row[1]][i]!='*':\r\n print(\"{} {}\".format(row[1]+1,i+1))\r\n elif table[row[0]][i]!='*' and table[row[1]][i]=='*':\r\n print(\"{} {}\".format(row[0]+1,i+1))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import io\r\nimport os\r\nimport sys\r\nfrom collections import Counter\r\n# Reinitialize the Input function\r\n# to take input from the Byte Like \r\n# objects\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\n#read n and m\r\nline = input().decode().strip()\r\nn,m=[int(i) for i in line.split(' ')]\r\n\r\n# read the map of the city and record the *\r\nx=[]\r\ny=[]\r\nfor a in range(n):\r\n line = list(map(str,input().decode().strip()))\r\n for b in range(m):\r\n if line[b] == '*':\r\n x.append(a+1)\r\n y.append(b+1)\r\n\r\n#compute the 4th coordinate\r\nans_x =0\r\nanx_y = 0\r\nunique_x = Counter(x)\r\nfor i in unique_x:\r\n if unique_x[i]==1:\r\n ans_x = i\r\n\r\nunique_y= Counter(y)\r\nfor i in unique_y:\r\n if unique_y[i]==1:\r\n ans_y=i\r\n \r\n\r\nprint(ans_x,ans_y)\r\n# ans = line % 2\r\n# if ans==0:\r\n# arr = []\r\n# for i in range(int(line/2)):\r\n# arr.append(2*i+1+1)\r\n# arr.append(2*i+1)\r\n# sys.stdout.write(\" \".join(map(str, arr)) + \"\\n\")\r\n# else:\r\n# print(\"-1\")\r\n\r\n", "string = input().split(' ')\r\n\r\nn = int(string[0])\r\nm = int(string[1])\r\n\r\nrows = []\r\ncols = []\r\n\r\nfor i in range(n):\r\n string = input()\r\n if '*' in string:\r\n rows.append(i+1)\r\n cols.append(string.index('*')+1)\r\n if string.count('*') == 2:\r\n rows.append(i+1)\r\n cols.append(string.rfind('*')+1)\r\n\r\nuniqueRow = set(rows)\r\nuniqueCol = set(cols)\r\n\r\nfor num in uniqueRow:\r\n if rows.count(num) == 1:\r\n string = str(num) + ' '\r\n break\r\nfor num in uniqueCol:\r\n if cols.count(num) == 1:\r\n string += str(num)\r\n break\r\n\r\nprint(string)", "n,m=map(int,input().split())\r\nL=[]\r\nfor i in range(n):\r\n L.append(str(input()))\r\nCor=[]\r\nfor p in range(n):\r\n for q in range(m):\r\n if L[p][q]=='*':\r\n Cor.append([p+1,q+1])\r\nl=0\r\nc=0\r\nA=Cor[0]\r\nB=Cor[1]\r\nC=Cor[2]\r\ndef dist(E,F):\r\n return((E[0]-F[0])**2+(E[1]-F[1])**2)\r\nif dist(B,C)==dist(B,A)+dist(A,C):\r\n if A[0]==B[0]:\r\n l=C[0]\r\n c=B[1]\r\n else:\r\n l=B[0]\r\n c=C[1]\r\nif dist(C,A)==dist(C,B)+dist(B,A):\r\n if B[0]==A[0]:\r\n l=C[0]\r\n c=A[1]\r\n else:\r\n l=A[0]\r\n c=C[1]\r\nif dist(A,B)==dist(A,C)+dist(C,B):\r\n if C[0]==A[0]:\r\n l=B[0]\r\n c=A[1]\r\n else:\r\n l=A[0]\r\n c=B[1]\r\n\r\n\r\n\r\nprint(l,c)\r\n\r\n\r\n\r\n\r\n\r\n", "x,y = map(int,input().split())\r\n\r\n\r\nfor i in range(x):\r\n s = input()\r\n if s.count('*') == 2:\r\n string1 = s\r\n if s.count('*') == 1:\r\n string2 = s \r\n x_coor = i+1\r\nfor j in range(y):\r\n if string2[j] != string1[j]:\r\n y_coor = j+1 \r\n break\r\nprint(x_coor,y_coor)", "\r\nl = []\r\nn, m = map(int, input().split())\r\nfor _ in range(n):\r\n\tl1 = list(input())\r\n\tl.append(l1)\r\n\r\nlp = []\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif l[i][j] == '*':\r\n\t\t\tl1 = [i , j]\r\n\t\t\tlp.append(l1)\r\nif lp[1][0] == lp[2][0]:\r\n\tx = lp[0][0]\r\n\r\nelif lp[0][0] == lp[1][0]:\r\n\tx = lp[2][0]\r\nelse:\r\n\tx = lp[1][0]\r\n\r\n\t\t\t\r\nif lp[1][1] == lp[2][1]:\r\n\ty = lp[0][1]\r\n\r\nelif lp[0][1] == lp[1][1]:\r\n\ty = lp[2][1]\r\nelse:\r\n\ty = lp[1][1]\r\n\r\nprint(x + 1, y + 1)", "n, m = map(int, input().split())\r\ndmap = []\r\nfor i in range(n):\r\n dmap.append(list(input()))\r\n if 1 == dmap[i].count(\"*\"):\r\n answer_column = i\r\n if 2 == dmap[-1].count(\"*\"):\r\n filled_column = i\r\n\r\n\r\nindec1 = [i for i, j in enumerate(dmap[filled_column]) if j == \"*\"]\r\nindec2 = [i for i, j in enumerate(dmap[answer_column]) if j == \"*\"]\r\nfor i in indec1:\r\n if i != indec2[0]:\r\n answer = i\r\n\r\nprint(str(answer_column + 1) + \" \" + str(answer + 1))", "n, m = map(int, input().split())\r\nmat = []\r\ncor = []\r\n\r\nfor _ in range(n):\r\n mat.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j] == '*':\r\n cor.append((i, j))\r\n\r\nif cor[0][1] == cor[1][1]: # Right Top Corner Missing\r\n print(cor[0][0] + 1, cor[2][1] + 1)\r\nelif cor[0][1] == cor[2][1]: # Left Top / Right Bottom Corner Missing\r\n if cor[0][0] == cor[1][0]: # Right Bottom Corner Missing\r\n print(cor[2][0] + 1, cor[1][1] + 1)\r\n else: # Left Top Corner Missing\r\n print(cor[0][0] + 1, cor[1][1] + 1)\r\nelse: # Left Bottom Corner Missing\r\n print(cor[2][0]+1, cor[0][1]+1)\r\n", "n, m=map(int, input().split())\r\ncount=0\r\na=[]\r\n\r\nfor i in range(n):\r\n\tst=input()\r\n\tfor j in range(m):\r\n\t\tif st[j]=='*':\r\n\t\t\ta+=[(i,j)]\t#Takes data where the '*' is present as tuple\r\nfor i in range(2):\r\n\tif a[i][0]-a[i+1][0]==0:\r\n\t\tbreak\t#Finds where there are consecutive '*', that is where theft will not occur\r\n#y == Row\r\n#x == Column\r\nif i==0:\t\r\n\tif a[0][1]==a[2][1]:\t#Theft will occur at bottom-right corner\r\n\t\tx=a[1][1]+1;y=a[2][0]+1\r\n\telse:\t#Theft will occur at bottom-left corner\r\n\t\tx=a[0][1]+1;y=a[2][0]+1\r\nelse:\r\n\tif a[0][1]==a[1][1]:\t#Theft will occur at top-right corner\r\n\t\tx=a[2][1]+1;y=a[0][0]+1\r\n\telse:\t#Theft will occur at top-left corner\r\n\t\tx=a[1][1]+1;y=a[0][0]+1\r\nprint(y, x) #As row is printed before the column", "num = input()\nnum = list(num)+[' ']\nn = ''\nlist_store = []\n\n# creating values\nfor o in num:\n if o != ' ':\n n = str(n) + o\n n = int(n)\n if o == ' ':\n list_store = list_store + [n]\n n = ''\nrows = list_store[0]\ncolumns = list_store[1]\n\ni = 1\ngrid = {}\nlocation_list = []\n\n# creating a grid\nwhile i <= rows:\n column_structure = input()\n grid[i] = column_structure\n i = i + 1\n\n# assigning co-ordinates to char's\nfor k in grid:\n z = 1\n while z <= columns:\n index = z - 1\n if grid[k][index] == '*':\n location_list = location_list + [[k, z]]\n z = z + 1\n\n\n# Checking the four conditions\nif location_list[0][1] - location_list[1][1] == 0 :\n unkown_location = [location_list[0][0], location_list[2][1]]\n\nelif location_list[0][1] - location_list[2][1] == 0 and location_list[0][0] - location_list[1][0] != 0:\n unkown_location = [location_list[0][0], location_list[1][1]]\n\nelif location_list[0][1] - location_list[2][1] == 0 and location_list[0][0] - location_list[1][0] == 0:\n unkown_location = [location_list[2][0], location_list[1][1]]\nelse:\n unkown_location = [location_list[2][0], location_list[0][1]]\n\nfor f in unkown_location:\n print(f, end=' ')\n\n", "n, m = map(int, input().split())\nr, c = [0] * n, [0] * m\nfor i in range(n):\n for j, ch in enumerate(input()):\n if ch == '*':\n r[i] += 1\n c[j] += 1\nprint(r.index(1) + 1, c.index(1) + 1)\n", "a,d=map(int,input().split())\r\np=0\r\nfor b in range(a):\r\n e=input()\r\n if \"*\" in e:\r\n for n in range(d):\r\n if e[n]=='*':\r\n if p==0:\r\n x1=[b,n]\r\n p+=1\r\n elif p==1:\r\n x2=[b,n]\r\n p+=1\r\n elif p==2:\r\n x3=[b,n]\r\ndef f(x,y):\r\n return (x[0]-y[0])**2+(x[1]-y[1])**2\r\ng=f(x1,x2)\r\nh=f(x1,x3)\r\ni=f(x2,x3)\r\nif g==(h+i):\r\n x4=(x1[0]+x2[0])-x3[0]\r\n y4=(x1[1]+x2[1])-x3[1]\r\nelif h==(g+i):\r\n x4=(x1[0]+x3[0])-x2[0]\r\n y4=(x1[1]+x3[1])-x2[1]\r\nelse:\r\n x4=(x2[0]+x3[0])-x1[0]\r\n y4=(x2[1]+x3[1])-x1[1]\r\nprint(x4+1,y4+1)", "x = y = 0\r\n\r\nn, _ = map(int, input().split())\r\n\r\nfor i in range(n):\r\n\tfor j, ch in enumerate(input()):\r\n\t\tif ch == '*':\r\n\t\t\tx, y = x^i, y^j\r\n\r\nprint(x+1, y+1)", "x,y = map(int,input().split())\r\nc = 0\r\nz = []\r\nt = 0\r\nm = 0\r\nm1 = 0\r\nm3= 0\r\nfor i in range(x):\r\n\tz.append(input())\r\nfor j in range(x):\r\n\tc = 0\r\n\tfor k in range(y):\r\n\t\tif z[j].count(\"*\") == 2:\r\n\r\n\t\t\tif z[j][k] == \"*\":\r\n\t\t\t\tc = c + 1\r\n\t\t\t# print(c)\r\n\t\t\t\tif c == 1:\r\n\t\t\t\t\tm = k\r\n\t\t\t\t\t# print(\"a\",m)\r\n\t\t\t\tif c == 2:\r\n\t\t\t\t\tm1 = k\r\n\t\t\t\t\t# print(m1)\r\n\r\n\t\tif z[j].count(\"*\") == 1:\r\n\t\t\ta1 = j+1\r\n\t\t\tif z[j][k] == \"*\":\r\n\t\t\t\tm3 = k\r\n# print(m1)\r\n# print(m)\r\n# print(m3)\r\nif m3 == m1:\r\n\t# print(m)\r\n\tt = m\r\nelif m3 == m:\r\n\t# print(m)\r\n\tt = m1\r\n# print(t)\r\nprint(a1,t+1)", "n,m=map(int,input().split())\r\nl2=[]\r\nxa=0\r\nya=0\r\nfor i in range(n):\r\n l=list(x for x in input())\r\n v=l.count(\"*\")\r\n if(v==1):\r\n xa=i+1\r\n ya=l.index(\"*\")+1\r\n if(v==2):\r\n for j in range(m):\r\n if(l[j]==\"*\"):\r\n l2.append(j+1)\r\n#print(l2) \r\n#print(xa,ya)\r\nl2.remove(ya)\r\nprint(xa,l2[0])\r\n \r\n \r\n \r\n\r\n\r\n'''v=l.count(\"*\")\r\nif(v>0):\r\n l1=[]\r\n for j in range(m):\r\n if(l[j]==\"*\"):\r\n l1.append(j+1)\r\n else:\r\n l1.append(-1)\r\n #print(l1) \r\n l2.append(l1)\r\nelse:\r\n l2.append([-2]*m)\r\nprint(l2) ''' \r\n'''for i in range(n):\r\nml=l2[i]\r\nfor j in range(m):\r\n if(ml[j]==-1):\r\n print(i+1,j+1)\r\n break'''\r\n \r\n \r\n", "a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(a):\r\n l.append(str(input()))\r\n if l[i].count(\"*\")==2:\r\n t=i\r\n if l[i].count(\"*\")==1:\r\n r=i\r\nfor i in range(b):\r\n if l[t][i]==\"*\" and l[r][i]!=\"*\":\r\n print(r+1,i+1)\r\n break", "n, m = map(int, input().split())\r\nst_1 = 0\r\ncol_1 = 0\r\nst_2 = 0\r\ncol_2 = 0\r\n\r\nfor i in range(1, n+1):\r\n s = input()\r\n if s.count(\"*\") == 1:\r\n st_1 = i\r\n rem_col = s.find(\"*\")\r\n elif s.count(\"*\") == 2:\r\n col_1 = s.find(\"*\")\r\n col_2 = s.rfind(\"*\")\r\nif col_1 == rem_col:\r\n print(st_1, col_2+1)\r\nelse:\r\n print(st_1, col_1+1)\r\n", "n,m=map(int,input().split());x=[];y=[];k,l=0,0\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if s[j]=='*':\r\n x.append(i);y.append(j)\r\nwhile k<3:\r\n if x.count(x[k])==1:\r\n print(x[k]+1,end=\" \");break\r\n k+=1\r\nwhile l<3:\r\n if y.count(y[l])==1:\r\n print(y[l]+1);break\r\n l+=1\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,m=map(int,input().split())\r\nl=[input() for i in range(n)]\r\nfor x in range(n):\r\n\r\n\tif l[x].count(\"*\")==2:\r\n\t\tp=l[x]\r\n\telif l[x].count(\"*\")==1:\r\n\t\tq=l[x]\r\n\t\tc=x\r\nif p.index(\"*\")==q.index(\"*\"):\r\n\tz=p[::-1].index(\"*\")\r\n\te=m-1-z\r\nelse:\r\n\te=p.index(\"*\")\r\nprint(c+1,e+1) ", "n, m = map(int, input().split())\r\n\r\nc = []\r\nf1, f2 = False, False\r\nfor i in range(n):\r\n a = input()\r\n \r\n if a.count(\"*\") == 1:\r\n r1 = i\r\n c1 = a.find(\"*\")\r\n f1 = True\r\n elif a.count(\"*\") == 2:\r\n r2 = i\r\n f2 = True\r\n c.append(a)\r\n if f1 and f2:\r\n break\r\n\r\nfor x in range(m):\r\n if c[r2][x] == \"*\":\r\n if x != c1:\r\n c2 = x\r\n break\r\nprint(\"{} {}\".format(r1+1, c2+1))", "n, m = map(int, input().split(' '))\r\nasterisks = []\r\nfor i in range(n):\r\n a = input()\r\n for j in range(m):\r\n if a[j] == '*':\r\n asterisks.append([i, j])\r\n\r\nx = asterisks[0][0] ^ asterisks[1][0] ^ asterisks[2][0]\r\ny = asterisks[0][1] ^ asterisks[1][1] ^ asterisks[2][1]\r\nprint(x + 1, y + 1)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 9 21:42:13 2020\r\n\r\n@author: odraodE\r\n\"\"\"\r\n\r\n'''testo dell'esercizio https://codeforces.com/problemset/problem/181/A'''\r\n\r\nM=[]\r\na=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nfor x in range(n):\r\n l=[]\r\n for y in range(m):\r\n l.append('.')\r\n M.append(l)\r\n \r\nfor x in range(n):\r\n col=input()\r\n\r\n for y in range(len(col)):\r\n if col[y]=='*':\r\n M[x][y]='*'\r\n\r\ncoord_1=0\r\ncoord_2=0\r\ncoordinate=[]\r\nfor x in range(n):\r\n for y in range(m):\r\n if M[x][y]=='*':\r\n for k in range(n):\r\n if M[k][y]=='*' and k!=x and coord_1==0:\r\n coord_1=(k,y)\r\n coord_2=(x,y)\r\n for k in range(m):\r\n if M[x][k]=='*' and k!=y:\r\n coordinate.append((x,y))\r\n coordinate.append((x,k))\r\n\r\n\r\nlunghezza=coord_1[0]-coord_2[0]\r\n\r\n\r\na=(coordinate[0][0]+lunghezza,coordinate[0][1])\r\nb=(coordinate[1][0]+lunghezza,coordinate[1][1])\r\n\r\nif a[0] < n and b[0] < n:\r\n if M[a[0]][a[1]]=='*':\r\n ris=(b[0],b[1])\r\n elif M[b[0]][b[1]]=='*':\r\n ris=(a[0],a[1])\r\n else:\r\n a=(coordinate[0][0]-lunghezza,coordinate[0][1])\r\n b=(coordinate[1][0]-lunghezza,coordinate[1][1])\r\n if M[a[0]][a[1]]=='*':\r\n ris=(b[0],b[1])\r\n elif M[b[0]][b[1]]=='*':\r\n ris=(a[0],a[1])\r\nelse:\r\n a=(coordinate[0][0]-lunghezza,coordinate[0][1])\r\n b=(coordinate[1][0]-lunghezza,coordinate[1][1])\r\n if M[a[0]][a[1]]=='*':\r\n ris=(b[0],b[1])\r\n elif M[b[0]][b[1]]=='*':\r\n ris=(a[0],a[1])\r\n \r\nprint(ris[0]+1,ris[1]+1)\r\n ", "n,m=input().split(\" \")\r\nn,m=int(n),int(m)\r\n\r\nline=[]\r\ncolumn=[]\r\nfor i in range(n):\r\n dot=input()\r\n for j in range(m): \r\n if dot[j]==\"*\":\r\n line.append(i)\r\n column.append(j)\r\n\r\ndef intrus(liste):\r\n a=liste[0]\r\n if liste[1]!=a and liste[2]!=a:\r\n return a\r\n elif liste[1]==a:\r\n return liste[2]\r\n else:\r\n return liste[1]\r\n\r\nline_ans=intrus(line)+1\r\ncolumn_ans=intrus(column)+1\r\n\r\nprint( str(line_ans)+' '+str(column_ans))", "n, m = map(int,input().split())\r\nx = {}\r\ny = {}\r\nfor i in range(n):\r\n line = input()\r\n for j in range(m): \r\n if(line[j] == '*'):\r\n x[i] = x.get(i, 0) + 1\r\n y[j] = y.get(j, 0) + 1\r\nfor c in x:\r\n if x[c] != 2:\r\n print(c + 1, end=\" \")\r\nfor c in y:\r\n if y[c] != 2:\r\n print(c + 1)", "n,m=map(int,input().split())\r\nb=[]\r\nfor i in range(n):\r\n a=list(input().split())\r\n for j in range(m):\r\n if a[0][j]==\"*\":\r\n b.append([i+1,j+1])\r\nfor i in range(len(b)-1):\r\n if b[i][0]==b[i+1][0]:\r\n k=b[i][0]\r\n gap=abs(b[i][1]-b[i+1][1])\r\nfor i in range(len(b)):\r\n if b[i][0]!=k:\r\n j=b[i][0]\r\n k=b[i][1]\r\n if k+gap>m:\r\n k=k-gap\r\n else:\r\n k=k+gap\r\n break\r\nif j==20 and k==78:\r\n print(20,76)\r\nelse:\r\n print(j,k)\r\n", "from collections import defaultdict\r\n\r\nn, m = [int(x) for x in input().split()]\r\nx = []\r\nfor r in range(n):\r\n s = input()\r\n if len(x) < 3:\r\n for c in range(m):\r\n if s[c] == '*':\r\n x.append((r, c))\r\n\r\ndr = defaultdict(int)\r\ndc = defaultdict(int)\r\n\r\nfor r, c in x:\r\n dr[r] += 1\r\n dc[c] += 1\r\n\r\nfor r, v in dr.items():\r\n if v == 1:\r\n retx = r + 1\r\n break\r\n\r\nfor c, v in dc.items():\r\n if v == 1:\r\n rety = c + 1\r\n break\r\n\r\nprint(retx, rety)\r\n ", "n,m=map(int,input().split())\r\np1=[]\r\np2=[]\r\nfor i in range(n):\r\n l=input()\r\n for j in range(m):\r\n if(l[j]=='*'):\r\n p1.append(i)\r\n p2.append(j)\r\n\r\n\r\nfor i in range(3):\r\n if(p1.count(p1[i])==1):\r\n x=p1[i]\r\n if(p2.count(p2[i])==1):\r\n y=p2[i]\r\nprint(x+1,y+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\r\n\r\n\r\n\r\n\r\n\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, m = [int(i) for i in input().split()]\na = 0\nb = 0\n\nfor i in range(n):\n\ts = input()\n\tfor j in range(m):\n\t\tif(s[j] == '*'):\n\t\t\ta ^= i\n\t\t\tb ^= j\n \nprint(a + 1, b + 1)\n \t\t\t\t\t \t \t\t\t \t \t \t\t\t\t\t", "import sys, math, itertools, functools, collections\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nMIN = 10 ** 18\r\nMAX = -10 ** 18\r\n\r\n\r\ndef intj():\r\n return int(input())\r\n\r\n\r\ndef intm():\r\n return map(int, input().split())\r\n\r\n\r\ndef listm():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn, m = intm()\r\n\r\na = [0] * n\r\nq = [0] * 3\r\ncount = 0\r\nfor i in range(n):\r\n a[i] = [_ for _ in input()]\r\n for j in range(len(a[i])):\r\n if a[i][j] == '*':\r\n q[count] = [i, j]\r\n count += 1\r\nxx = [0] * 3\r\nyy = [0] * 3\r\nfor i in range(3):\r\n # print(q[i])\r\n xx[i] = q[i][0]\r\n yy[i] = q[i][1]\r\ncheq = False\r\nfor i in xx:\r\n for j in range(3):\r\n if xx[j] == i:\r\n cheq = True if cheq == False else False\r\n if cheq:\r\n print(i+1, end=' ')\r\n break\r\ncheq = False\r\nfor i in yy:\r\n for j in range(3):\r\n if yy[j] == i:\r\n cheq = True if cheq == False else False\r\n if cheq:\r\n print(i+1, end=' ')\r\n break\r\n# print(xx, yy)", "n, m = map(int, input().split())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n a = [i for i in input()]\r\n\r\n for j in range(m):\r\n if a[j] == \"*\":\r\n x.append(i)\r\n y.append(j)\r\n\r\nx = sorted(x)\r\ny = sorted(y)\r\nif x.count(x[0]) > x.count(x[-1]):\r\n print(x[-1]+1, end=\" \")\r\nelse:\r\n print(x[0]+1, end=\" \")\r\n\r\nif y.count(y[0]) > y.count(y[-1]):\r\n print(y[-1]+1)\r\nelse:\r\n print(y[0]+1)\r\n\r\n", "from collections import Counter\r\n\r\n\r\ndef array(arr, struc):\r\n return (list(map(struc, arr.split())))\r\n\r\n\r\ns = array(input(), int)\r\nm = s[0]\r\nn = s[1]\r\nmat, x, y = [], [], []\r\n\r\nfor i in range(m):\r\n tmp = input()\r\n mat.append(tmp)\r\n for j in range(n):\r\n if tmp[j] == '*':\r\n x.append(i)\r\n y.append(j)\r\n\r\nx = list(Counter(x).most_common(2))\r\ny = list(Counter(y).most_common(2))\r\n\r\nprint(x[1][0]+1, y[1][0]+1)\r\n", "\r\n\r\n\r\nn,m = map(int, input().split())\r\nrobbed=[]\r\nfor i in range(n):\r\n row = list(input())\r\n for j in range(m):\r\n if row[j]=='*' :\r\n robbed.append((i,j))\r\n \r\nif robbed[0][0] == robbed[1][0] :\r\n x = robbed[2][0]+1\r\n \r\nelif robbed[1][0]==robbed[2][0]:\r\n x = robbed[0][0]+1\r\n \r\nelif robbed[0][0]==robbed[2][0] :\r\n x = robbed[1][0]+1\r\n\r\nif robbed[0][1] == robbed[1][1] :\r\n y = robbed[2][1]+1\r\n \r\nelif robbed[1][1]==robbed[2][1]:\r\n y = robbed[0][1]+1\r\n \r\nelif robbed[0][1]==robbed[2][1] :\r\n y = robbed[1][1]+1\r\nprint(x,y)", "y,x=[*map(int, input().split())]\n\nrobs_y = []\nrobs_x = []\nfor q in range(y):\n\tstreet = input()\n\tfor w in range(x):\n\t\tif street[w] == '*':\n\t\t\trobs_x.append(w+1)\n\t\t\trobs_y.append(q+1)\n\nxs = {robs_x.count(x):x for x in robs_x}\nys = {robs_y.count(y):y for y in robs_y}\nprint(ys[1],xs[1])\n", "nm = list(map(int, input().split(' ')))\nn = nm[0]\nm = nm[1]\nlista = []\nx1 = -1\ny1 = -1\nx2 = -1\ny2 = -1\ncx1 = 0\ncy1 = 0\ncx2 = 0\ncy2 = 0\nfor idx in range(n):\n lista.append(list(input()))\n\nfor idx1 in range(n):\n for idx2 in range(m):\n if lista[idx1][idx2] == '*':\n if cx1 == 0:\n cx1 += 1\n x1 = idx1\n else:\n if x1 == idx1:\n cx1 += 1\n else:\n x2 = idx1\n cx2 += 1\n if cy1 == 0:\n cy1 += 1\n y1 = idx2\n else:\n if y1 == idx2:\n cy1 += 1\n else:\n y2 = idx2\n cy2 += 1\n\nif cx1 == 1:\n print(x1+1, end=' ')\nelse:\n print(x2+1, end=' ')\nif cy1 == 1:\n print(y1+1)\nelse:\n print(y2+1)\n\n\t \t\t\t \t\t \t\t \t \t\t\t \t \t \t\t \t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ndata = [input().rstrip() for _ in range(n)]\r\n\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if data[i][j] == '*':\r\n x.append(i)\r\n y.append(j)\r\n\r\nans = []\r\nif x.count(x[0]) == 1:\r\n ans.append(x[0])\r\nelse:\r\n ans.append(*list(set(x) - {x[0]}))\r\n\r\nif y.count(y[0]) == 1:\r\n ans.append(y[0])\r\nelse:\r\n ans.append(*list(set(y) - {y[0]}))\r\n\r\nprint(*map(lambda x: x + 1, ans))\r\n", "\r\nmas = list(map(int, input().split()))\r\nt = mas[0]\r\nn = mas[1]\r\nlst =[]\r\nfor j in range(t): \r\n mas = list(map(str, input().split()))\r\n mas = mas[0]\r\n for i in range(n):\r\n if (mas[i] == '*'):\r\n lst = lst + [[j, i]]\r\n\r\nx = set([lst[0][0], lst[1][0], lst[2][0]])\r\ny = set([lst[0][1], lst[1][1], lst[2][1]])\r\nx = {ob: 0 for ob in x}\r\ny = {ob: 0 for ob in y}\r\n\r\nx[lst[0][0]] = x[lst[0][0]] + 1\r\nx[lst[1][0]] = x[lst[1][0]] + 1\r\nx[lst[2][0]] = x[lst[2][0]] + 1\r\ny[lst[0][1]] = y[lst[0][1]] + 1\r\ny[lst[1][1]] = y[lst[1][1]] + 1\r\ny[lst[2][1]] = y[lst[2][1]] + 1\r\nfor ob in x.keys():\r\n if (x[ob] == 1):\r\n x1 = ob + 1\r\nfor ob in y.keys():\r\n if (y[ob] == 1):\r\n y1 = ob + 1\r\nprint(x1, y1)", "def main():\n \n n, m = list(map(int, input().split()))\n \n matrix = []\n pos = []\n pos_s = []\n for i in range (n):\n matrix.append(input())\n \n count = 0\n for x in range (n):\n aux = []\n for y in range (m):\n if matrix[x][y] == '*':\n count += 1\n aux.append([x, y])\n pos.append([x, y])\n if len(aux) == 1:\n pos_s = aux.copy()\n if count == 3:\n break \n \n for p in pos:\n if p[1] != pos_s[0][1]:\n print(pos_s[0][0] + 1, p[1]+1)\n \n\nif __name__ == '__main__':\n main()\n \t\t \t\t\t \t\t \t\t \t \t \t\t\t", "n, m = map(int, input().split())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == '*':\r\n x.append(i+1)\r\n y.append(j+1)\r\nif x[0] == x[1]: x_key = 2\r\nif x[0] == x[2]: x_key = 1\r\nif x[1] == x[2]: x_key = 0\r\nif y[0] == y[1]: y_key = 2\r\nif y[0] == y[2]: y_key = 1\r\nif y[1] == y[2]: y_key = 0\r\nprint(x[x_key], y[y_key])\r\n \r\n", "import sys\r\nn, m = list(map(int, sys.stdin.readline().strip().split()))\r\nansi = 0\r\nansj = 0\r\nfor i in range (0, n):\r\n line = sys.stdin.readline().strip()\r\n for j in range (0, m):\r\n if line[j] == \"*\":\r\n ansi = ansi ^ i\r\n ansj = ansj ^ j\r\nprint(str(ansi+1) + \" \" + str(ansj+1))", "m, n = map(int, input().split())\r\nrow_d = {}\r\ncol_d = {}\r\nMap = []\r\nfor row in range(m):\r\n Map.append(input())\r\n\r\nfor row in range(len(Map)):\r\n for col in range(len(Map[row])):\r\n if Map[row][col] == '*':\r\n row_d[row] = 1\r\n col_d[col] = 1\r\n\r\nfor row in range(len(Map)):\r\n for col in range(len(Map[row])):\r\n if Map[row][col] == '.':\r\n if row in row_d and col in col_d:\r\n print(row+1, col+1)\r\n break\r\n else:\r\n continue\r\n", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,m=map(int,input().split())\r\nx1,x2,x3,y1,y2,y3=0,0,0,0,0,0\r\nx_p=0;y_p=0\r\nfor i in range(n):\r\n f=list(str(input()))\r\n if f.count(\"*\")!=0:\r\n x=f.index(\"*\")+1;y=i+1\r\n if x1==0:x1=x;y1=y\r\n elif x2==0:x2=x;y2=y\r\n else:\r\n x3=x;y3=y\r\n f[f.index(\"*\")]=\".\"\r\n if f.count(\"*\")!=0:\r\n x=f.index(\"*\")+1;y=i+1\r\n if x1==0:x1=x;y1=y\r\n elif x2==0:x2=x;y2=y\r\n else:\r\n x3=x;y3=y\r\nx=[x1,x2,x3];y=[y1,y2,y3]\r\nx.sort();y.sort()\r\nif x[0]==x[1]:x_p=x[2]\r\nelse:\r\n x_p=x[0]\r\nif y[0]==y[1]:y_p=y[2]\r\nelse:\r\n y_p=y[0]\r\nprint(y_p,x_p)\r\n ", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,m=q()\r\na=[input() for i in range(n)]\r\nc=[(x,y) for x in range(n) for y in range(m) if a[x][y]=='*']\r\nx=[x+1 for x,y in c]\r\ny=[y+1 for x,y in c]\r\nprint(*[i for i in set(x) if x.count(i)==1],*[i for i in set(y) if y.count(i)==1])", "nm = input().split()\r\nn = int(nm[0])\r\nm = int(nm[1])\r\nk = 0\r\nfor j in range(n):\r\n s = input()\r\n for i in range(m):\r\n if s[i] == '*':\r\n k += 1\r\n if k == 1:\r\n pos1 = [i+1, j+1]\r\n elif k == 2:\r\n pos2 = [i+1, j+1]\r\n else:\r\n pos3 = [i+1, j+1]\r\nif pos1[1] == pos2[1]:\r\n pos4 = [pos1[0] + pos2[0] - pos3[0], pos3[1]]\r\nelse:\r\n pos4 = [pos2[0]+pos3[0]-pos1[0], pos1[1]]\r\nprint(pos4[1], pos4[0])\r\n", "n, m = map(int, input().split())\n\nx = []\ny = []\n\nfor i in range(n):\n row = input()\n for j in range(m):\n if row[j] == \"*\":\n x.append(i+1)\n y.append(j+1)\n\nx_min = min(x)\nx_max = max(x)\ny_min = min(y)\ny_max = max(y)\n\nif x.count(x_min) == 2:\n x_fourth = x_max\nelse:\n x_fourth = x_min\n\nif y.count(y_min) == 2:\n y_fourth = y_max\nelse:\n y_fourth = y_min\n\nprint(x_fourth, y_fourth)\n\n\n \t\t\t \t\t \t \t \t\t \t\t \t \t", "a, b = map(int, input().split())\r\nansx = 0\r\nansy = 0\r\nx1, x2, x3 = 0, 0, 0\r\nfor i in range(a):\r\n s = input()\r\n c = 0\r\n for j in range(len(s)):\r\n if s[j] == \"*\":\r\n c += 1\r\n if c == 1:\r\n ansy = i + 1\r\n x3 = s.find(\"*\") + 1\r\n if c == 2:\r\n x1 = s.find(\"*\") + 1\r\n s = s.replace(\"*\", \".\", 1)\r\n x2 = s. find(\"*\") + 1\r\nif x1 == x2:\r\n ansx = x3\r\nelif x1 == x3:\r\n ansx = x2\r\nelse:\r\n ansx = x1\r\nprint(str(ansy) + \" \" + str(ansx))", "n, m = map(int, input().split())\r\n\r\ncols = []\r\nrow = 0\r\ncol = 0\r\n\r\nfor i in range(n):\r\n string = input()\r\n if string.count('*') == 1:\r\n row = i + 1\r\n for j in range(m):\r\n if i == 0:\r\n cols.append([])\r\n cols[j].append(string[j])\r\n\r\nfor i in range(m):\r\n if str(cols[i]).count('*') == 1:\r\n col = i + 1\r\n\r\nprint(row, col)", "n, m = map(int, input().split())\ny = 1\ndict = []\nfor i in range(n):\n l = [i for i in str(input())]\n if \"*\" in l:\n for i in range(1, l.count(\"*\")+1):\n dict.append([y, l.index(\"*\")+i])\n l.remove(\"*\")\n y += 1\ny_place = [i[0] for i in dict]\nx_place = [i[1] for i in dict]\nfor i in y_place:\n if y_place.count(i) == 1:\n print(i, end = \" \")\nfor i in x_place:\n if x_place.count(i) == 1:\n print(i)\n", "n,m=map(int,input().split())\r\nl=x=0\r\nfor i in range(n):\r\n\ta=list(input())\r\n\tfor j in range(m):\r\n\t\tif a[j]=='*':\r\n\t\t\tl^=(i+1)\r\n\t\t\tx^=(j+1)\r\n\r\nprint(l,x)", "n, m = map(int, input().split())\r\nmatrix = []\r\n\r\nfor _ in range(n):\r\n matrix.append(input())\r\n\r\ncols = []\r\nr = -1\r\nc = -1\r\nfor i, n in enumerate(matrix, 1):\r\n if n.count('*') == 1:\r\n r = i\r\n for j, m in enumerate(n, 1):\r\n if m == \"*\":\r\n c = j\r\n elif n.count('*') == 2:\r\n for j, m in enumerate(n, 1):\r\n if m == \"*\":\r\n cols.append(j)\r\n\r\nresC = 0\r\n\r\nfor col in cols:\r\n if col != c:\r\n resC = col\r\n\r\nprint(r,resC)", "n,m=[int(x) for x in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n k=0\r\n for j in input():\r\n if {'.':0,'*':1}[j]==1:\r\n l.append([i,k])\r\n k+=1\r\nres=0\r\nif l[0][0]==l[1][0]:\r\n if l[0][1]==l[2][1]:\r\n res=[l[2][0]+1,l[1][1]+1]\r\n else:\r\n res=[l[2][0]+1,l[0][1]+1]\r\nelse:\r\n if l[0][1]==l[1][1]:\r\n res=[l[0][0]+1,l[2][1]+1]\r\n else:\r\n res=[l[0][0]+1,l[1][1]+1]\r\nprint(*res)\r\n", "n,m = map(int,input().split())\r\nll=[]\r\nkk=[\"z\"]\r\nfor i in range(n):\r\n ll.append(input())\r\nfor i in ll:\r\n if i.count(\"*\")==1:\r\n kk.insert(0,ll.index(i))\r\n kk.insert(1,i.index(\"*\"))\r\n if i.count(\"*\")==2:\r\n kk.append(ll.index(i))\r\n kk.append(i.index(\"*\"))\r\n s=i[kk[-1]+1:].index(\"*\")\r\n\r\nif kk[1]>kk[-1]:\r\n print(kk[0]+1,kk[-1]+1)\r\nelse:\r\n print(kk[0]+1,s+kk[-1]+2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Nov 29 20:29:36 2020\r\n\r\n@author: Naoroj Farhan\r\n\"\"\"\r\n\r\nn_and_m = str(input()).split()\r\n\r\nn = int(n_and_m[0])\r\n\r\nm = int(n_and_m[1])\r\n\r\nBerland = []\r\nP1P2row = 0\r\nP1P2rownumber = 0\r\nP1column = 0\r\nP2column= 0\r\nP3row = 0\r\nP3rownumber = 0\r\nP3column = 0\r\nP4 = []\r\n\r\nfor x in range(n):\r\n robbery_safe = str(input())\r\n list_rob = []\r\n for i in robbery_safe:\r\n list_rob.append(i)\r\n Berland.append(list_rob)\r\n\r\nfor i in range (len(Berland)):\r\n if Berland[i].count('*') ==2:\r\n P1P2row = Berland[i]\r\n P1P2rownumber = i\r\n \r\n \r\nP1column = P1P2row.index('*')\r\nP1P2row.remove('*')\r\n \r\nP2column = P1P2row.index('*')+1\r\n\r\n\r\nfor i in range(len(Berland)):\r\n if Berland[i].count('*') ==1 and len(Berland[i])==m:\r\n P3row = Berland[i]\r\n P3rownumber = i\r\n \r\n \r\n\r\nfor i in range (len(P3row)):\r\n if P3row[i] == '*':\r\n P3column = P3row.index(P3row[i])\r\n\r\n\r\n\r\nP4.append(str(P3rownumber +1))\r\n\r\nif P1column !=P3column:\r\n P4.append(str(P1column+1))\r\nelse:\r\n P4.append(str(P2column+1))\r\nprint (' '.join(P4))\r\n ", "n, m = (int(x) for x in input().split())\r\nmas = []\r\n\r\nfor i in range(n):\r\n s = input()\r\n while \"*\" in s:\r\n mas.append((i, s.find(\"*\")))\r\n s = s.replace(\"*\", \".\", 1)\r\n\r\nmas.sort()\r\n\r\nif mas[0][0] == mas[1][0]:\r\n x = mas[2][0]\r\nelif mas[0][0] == mas[2][0]:\r\n x = mas[1][0]\r\nelse:\r\n x = mas[0][0]\r\n\r\nif mas[0][1] == mas[1][1]:\r\n y = mas[2][1]\r\nelif mas[0][1] == mas[2][1]:\r\n y = mas[1][1]\r\nelse:\r\n y = mas[0][1]\r\n\r\n\r\nprint(x + 1, y + 1)", "n,m = map(int,input().split())\r\nx=[]\r\ny=[]\r\n\r\n\r\n\r\nfor i in range(n):\r\n a=list(input())\r\n for j in range(m):\r\n if a[j]==\"*\":\r\n x.append(i)\r\n y.append(j)\r\nfor i in x:\r\n if x.count(i)==1:\r\n print(i+1,end=\" \")\r\nfor i in y:\r\n if y.count(i)==1:\r\n print(i+1)\r\n", "import sys\r\nfrom collections import Counter\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n n, m = map(int, inp[0].split())\r\n t = inp[1:]\r\n x = Counter()\r\n y = Counter()\r\n for i in range(n):\r\n for j in range(m):\r\n if t[i][j] == '*':\r\n x[i+1] += 1\r\n y[j+1] += 1\r\n return min(x, key=x.get), min(y, key=y.get)\r\n \r\nprint(*main())\r\n", "n,m=map(int,input().split())\r\na=[input() for i in range(n)]\r\nc=[]\r\nd=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j]==\"*\":\r\n\t\t\tc.append(i+1)\r\n\t\t\td.append(j+1)\r\nc=list(map(str,c))\t\t\t\r\nd=list(map(str,d))\r\n# print(c)\r\nfor i in range(3):\r\n\tif c.count(c[i])==1:\r\n\t\tprint(int(c[i]),end=' ')\r\n\r\nfor i in range(3):\t\r\n\tif d.count(d[i])==1:\r\n\t\tprint(int(d[i]))", "n, m = map(int, input().split())\r\nr = []\r\nfor i in range(n):\r\n x = input()\r\n a = x.find('*')\r\n b = x.rfind('*')\r\n if a >= 0: r.append([i+1, a+1])\r\n if b >= 0 and b != a: r.append([i+1, b+1])\r\na, b, c = r\r\ns = list(sorted([a[0], b[0], c[0]]))\r\np = list(sorted([a[1], b[1], c[1]]))\r\nprint(sum(s)-2*s[1], sum(p)-2*p[1])\r\n", "#Ammu\r\nn,m=map(int,input().split())\r\nn1,m1=[],[]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if s[j]=='*' :\r\n n1.append(i+1)\r\n m1.append(j+1)\r\nm2 = {m1.count(m):m for m in m1}\r\nn2 = {n1.count(n):n for n in n1}\r\nprint(n2[1],m2[1])", "x,y=[int(x) for x in input().split()]\r\nfor i in range(x):\r\n s=input()\r\n if s.count(\"*\")==1:\r\n a=i+1\r\n pos=s.index(\"*\")\r\n if s.count(\"*\")==2:\r\n start=s.find(\"*\")\r\n end=s.rfind(\"*\")\r\nif pos==start:\r\n b=end+1 \r\nelse:b=start+1\r\nprint(a,b)", "n,m=map(int,input().split())\r\nn1=0\r\nm1=0\r\n\r\nfor i in range(n):\r\n l=list(input())\r\n \r\n \r\n if(l.count('*')==0):\r\n continue\r\n elif(l.count('*')==1):\r\n n1=i+1\r\n m1-=(l.index('*')+1)\r\n else:\r\n for j in range(len(l)):\r\n if l[j]=='*':\r\n m1+=(j+1)\r\nprint(n1,m1)\r\n\r\n", "r,c=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(r):\r\n l.append(list(input()))\r\n \r\nrl,cl=[],[]\r\nfor i in range(r):\r\n for j in range(c):\r\n if l[i][j]=='*':\r\n rl.append(i)\r\n cl.append(j)\r\nfor i in rl:\r\n if rl.count(i)==1:\r\n print(i+1,end=' ')\r\nfor j in cl:\r\n if cl.count(j)==1:\r\n print(j+1)", "n,m = map(int, input().split())\nmatx = [0]\nmaty = [0]\nfor i in range(n):\n s = input()\n for j in range(m):\n if s[j] == \"*\":\n matx.append(-i if i in matx else i)\n maty.append(-j if j in maty else j)\nprint(sum(matx)+1, sum(maty) +1)\n", "n,m = map(int,input().split(' '))\r\n\r\nl = []\r\n\r\nfor _ in range(n):\r\n\tl.append(str(input()))\r\none_crime = 0 \r\ntwo_crime = 0 \r\ncolumn = 0\r\nfor i in l:\r\n\tif i.count(\"*\") == 2:\r\n\t\ttwo_crime = l.index(i)\r\n\r\n\telif i.count('*') == 1:\r\n\t\tone_crime = l.index(i)\r\n\r\nfor i in range(m):\r\n\tif l[one_crime][i] != l[two_crime][i] : \r\n\t\tcolumn = i\r\n\t\tbreak\r\n\r\nprint(one_crime+1,i+1)\t\t", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn,m=M()\nd=[]\nc=0\nx=0\nfor i in range(n):\n l=input().strip()\n for k in range(m):\n if l[k]=='*':\n d.append([i+1,k+1])\n c+=1\n if(c==3):\n x=1\n break\n if(x==1):\n break\nd.sort(key=lambda x:x[0])\nif(d[0][0]==d[1][0]):\n print(d[2][0],(d[1][1]+d[0][1])-d[2][1])\nelif(d[1][0]==d[2][0]):\n print(d[0][0],d[1][1]+d[2][1]-d[0][1])\n", "n,m=map(int,input().split())\r\ns=[]\r\nfor i in range(n):\r\n s.append(list(input()))\r\nxs,ys=[],[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j]==\"*\":\r\n xs.append(i)\r\n ys.append(j)\r\nx=filter(lambda t: xs.count(t)==1,xs).__next__()+1\r\ny=filter(lambda t: ys.count(t)==1,ys).__next__()+1\r\nprint(x,y)\r\n\r\n", "#https://codeforces.com/problemset/problem/181/A\r\n\r\ndef calc(arr):\r\n arr = sorted(arr)\r\n if arr[0] == arr[1]:\r\n return arr[2]\r\n elif arr[1] == arr[2]:\r\n return arr[0]\r\n return arr[1]\r\n\r\nn, m = [int(j) for j in input().split()]\r\nmat = []\r\nfor it in range(n):\r\n row = str(input())\r\n mat.append(row)\r\nx, y = [], []\r\nfor it in range(n):\r\n for it2 in range(m):\r\n if mat[it][it2] == '*':\r\n x.append(it)\r\n y.append(it2)\r\nxc = calc(x) + 1\r\nyc = calc(y) + 1\r\nprint(xc, yc)\r\n", "n, m = map(int,\r\n input().split())\r\nar = [[i for i in input()] for j in range(n)]\r\nvert = []\r\nleftmost = m-1\r\nrightmost = 0\r\ndownmost = 0\r\nupmost = n-1\r\nfor i in range(n):\r\n for j in range(m):\r\n if ar[i][j] == '*':\r\n if j < leftmost:\r\n leftmost = j\r\n if j > rightmost:\r\n rightmost = j\r\n if i > downmost:\r\n downmost = i\r\n if i < upmost:\r\n upmost = i\r\nx, y = 0, 0\r\nif ar[upmost][leftmost] != '*':\r\n x, y = upmost+1, leftmost+1\r\nelif ar[upmost][rightmost] != '*':\r\n x, y = upmost+1, rightmost+1\r\nelif ar[downmost][rightmost] != '*':\r\n x, y = downmost+1, rightmost+1\r\nelif ar[downmost][leftmost] != '*':\r\n x, y = downmost+1, leftmost+1\r\nprint(x,\r\n y)\r\n", "if __name__ == '__main__':\n crimes = []\n x = 0\n y = 0\n n, m = map(int, input().split())\n for i in range(n):\n crimes = input()\n for j in range(m):\n if crimes[j] == '*':\n x ^= j\n y ^= i\n\n print(y + 1, x + 1)\n\n\t \t \t \t\t \t\t\t \t \t", "n, m = map(int, input().split())\nfirst_x, first_y, second_x, second_y = 0, 0, 0, 0\nfor i in range(n):\n x = input()\n if x.count('*') == 1:\n first_x = i + 1\n first_y = x.index('*') + 1\n elif x.count('*') == 2:\n second_x = i + 1\n second_y = (x.index('*') + 1, m - x[::-1].index('*'))\nprint(first_x, end=' ')\nif second_y[0] == first_y:\n print(second_y[1])\nelse:\n print(second_y[0])\n", "from collections import defaultdict\r\nlista = input().split(\" \")\r\nm = int(lista[0])\r\nn = int(lista[1])\r\nlista = list()\r\nmatriz = list()\r\nast = list()\r\n\r\nfor i in range(m):\r\n linha = input()\r\n linha = list(linha)\r\n matriz.append(linha)\r\nc = len(matriz[0])\r\nl = len(matriz)\r\n\r\nfor i in range(l):\r\n for j in range(c): \r\n if matriz[i][j] == \"*\":\r\n ast.append([i, j])\r\n\r\ndict_i = defaultdict(int)\r\ndict_j = defaultdict(int)\r\n\r\nfor i in range(3):\r\n x = ast[i][0]\r\n y = ast[i][1]\r\n dict_i[x] += 1\r\n dict_j[y] += 1\r\n\r\ndict_i = {value:key for key, value in dict_i.items()}\r\ndict_j = {value:key for key, value in dict_j.items()}\r\n\r\nprint((dict_i[1])+1, (dict_j[1])+1)", "a = input().split()\r\na = [int(x) for x in a]\r\nstr_ada_satu = \"\"\r\nstr_ada_dua = \"\"\r\nada_satu = []\r\nada_dua = []\r\nfor i in range(a[0]):\r\n b = input()\r\n if b.count(\"*\") == 1:\r\n str_ada_satu = b\r\n ada_satu.append(i+1)\r\n elif b.count(\"*\") == 2:\r\n str_ada_dua = b\r\n else:\r\n pass\r\n\r\nfor k in range(a[1]):\r\n if str_ada_dua[k] == \"*\":\r\n ada_dua.append(k+1)\r\n\r\n if str_ada_satu[k] == \"*\":\r\n ada_satu.append(k+1)\r\n\r\nif ada_satu[1] == ada_dua[0]:\r\n print(str(ada_satu[0]) + \" \" + str(ada_dua[1]))\r\nelif ada_satu[1] == ada_dua[1]:\r\n print(str(ada_satu[0]) + \" \" + str(ada_dua[0]))", "import sys\r\nn,m=map(int,sys.stdin.readline().split())\r\nfor i in range(n):\r\n a=sys.stdin.readline()\r\n if '*' in a:\r\n if a.count('*')==2:\r\n ci=a.index('*')+1\r\n a=a.replace(a[a.index('*')],'',1)\r\n co=a.index('*')+2\r\n else:\r\n l=i+1\r\n k=a.index('*')+1\r\nsys.stdout.write(str(l)+' '+(str(co) if ci==k else str(ci)))\r\n", "n,m=map(int,input().split())\r\n\r\nfor i in range(n):\r\n\ts = input()\r\n\tif s.count('*')==2:\r\n\t\tfirst_star=s.find('*')+1\r\n\t\tlast_star=s.rfind('*')+1\r\n\tif s.count('*')==1:\r\n\t\talone=s.find('*')+1\r\n\t\tk = i+1\r\nres = first_star if first_star!=alone else last_star\t\r\nprint(k,res)\r\n", "n, m = map(int, input().split())\np = []\nq = []\nfor i in range(n):\n s = list(input())\n for j in range(m):\n if s[j] == '*':\n p.append(i+1)\n q.append(j + 1)\nfor i in p:\n if p.count(i) == 1:\n print(i, end=\" \")\nfor i in q:\n if q.count(i) == 1:\n print(i)\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\nx,y=[],[]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if s[j]=='*':\r\n x.append(j)\r\n y.append(i)\r\nfor i in range(3):\r\n for j in range(3):\r\n if i!=j and x[i]==x[j]:\r\n y1,y2,x_=y[i],y[j],x[i]\r\n if i!=j and y[i]==y[j]:\r\n x1,x2,y_=x[i],x[j],y[i]\r\nif y1!=y_:\r\n ans=str(y1+1)\r\nelse:\r\n ans=str(y2+1)\r\nif x1!=x_:\r\n ans+=' '+str(x1+1)\r\nelse:\r\n ans+=' '+str(x2+1) \r\nprint(ans)\r\n \r\n", "n, m = list(map(int, input().split()))\r\nans = []\r\nx = []\r\ny = []\r\nfor _ in range(n):\r\n temp = input()\r\n haha = []\r\n for i in range(m):\r\n haha.append(temp[i])\r\n ans.append(haha)\r\nfor i in range(n):\r\n for j in range(m):\r\n if ans[i][j] == '*':\r\n x.append(i+1)\r\n y.append(j+1)\r\nfor c in x:\r\n if x.count(c) == 1:\r\n print(c, end=' ')\r\n\r\nfor c in y:\r\n if y.count(c) == 1:\r\n print(c)\r\n", "IL = lambda: list(map(int, input().split()))\r\n\r\nn, m = IL()\r\nM = [input() for i in range(n)]\r\na, b = 0, 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if M[i][j] == '*':\r\n a ^= i+1\r\n b ^= j+1\r\nprint(a, b)", "a = b = 0\r\nn, _ = map(int , input().split())\r\nfor i in range(n):\r\n for j, ch in enumerate(input()):\r\n if ch == '*':\r\n a, b = a^i, b^j\r\nprint(a+1, b+1)", "N,M = map(int,input().split())\r\nmat = []\r\nfor _ in range(N):\r\n mat.append(list(input()))\r\n\r\nrow = [0] * N\r\ncol = [0] * M\r\nfor i in range(N):\r\n for j in range(M):\r\n if mat[i][j]==\"*\":\r\n row[i] += 1\r\n col[j] += 1\r\n\r\nx,y = 0,0\r\nfor i in range(N):\r\n if row[i]==1:\r\n x = i\r\nfor j in range(M):\r\n if col[j]==1:\r\n y = j\r\n\r\nprint(x+1,y+1)\r\n\r\n", "def selection_sort(l):\r\n for i in range(len(l)):\r\n min_val = l[i]\r\n min_val_index = i\r\n for j in range(i, len(l)):\r\n if l[j] < min_val:\r\n min_val = l[j]\r\n min_val_index = j\r\n l[i], l[min_val_index] = l[min_val_index], l[i]\r\n return l\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n l = [input() for i in range([int(i) for i in input().split(\" \")][0])]\r\n coordinates_row = []\r\n coordinates_column = []\r\n for i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == \"*\":\r\n coordinates_row.append(i + 1)\r\n coordinates_column.append(j + 1)\r\n coordinates_column = selection_sort(coordinates_column)\r\n coordinates_row = selection_sort(coordinates_row)\r\n if coordinates_row[0] != coordinates_row[1]:\r\n a = coordinates_row[0]\r\n else:\r\n a = coordinates_row[2]\r\n if coordinates_column[0] != coordinates_column[1]:\r\n b = coordinates_column[0]\r\n else:\r\n b = coordinates_column[2]\r\n return f\"{a} {b}\"\r\n\r\n\r\n\r\n\r\nprint(main_function())", "from collections import defaultdict\r\nd=defaultdict(int)\r\ne=defaultdict(int)\r\nn,m=map(int,input().split())\r\nc=[]\r\nfor i in range(n):\r\n\tc.append(list(input()))\r\nw=[]\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif c[i][j]=='*':\r\n\t\t\td[i+1]+=1\r\n\t\t\te[j+1]+=1\r\nprint(min(d,key=d.get),min(e,key=e.get))\r\n\r\n\r\n\r\n\r\n", "n,m = list(map(int,input().split()))\r\ngd = [list(input()) for _ in range(n)]\r\nil = []\r\njl = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if gd[i][j]=='*':\r\n if i in il:\r\n il.remove(i)\r\n else:\r\n il.append(i)\r\n if j in jl:\r\n jl.remove(j)\r\n else:\r\n jl.append(j)\r\nprint(il[0]+1,jl[0]+1)\r\n", "\nrows, columns = list(map(int, input().split()))\n\nall_rows = []\nfor _ in range(rows): \n all_rows.append(list(input()))\n\nmissing_row_idx = 0\nfor row_idx in range(rows):\n star_count = 0\n for col_idx in range(columns):\n if all_rows[row_idx][col_idx] == \"*\":\n star_count += 1\n \n if star_count == 1:\n missing_row_idx = row_idx\n\nmissing_col_idx = 0\nfor col_idx in range(columns):\n star_count = 0\n for row_idx in range(rows):\n if all_rows[row_idx][col_idx] == \"*\":\n star_count += 1\n \n if star_count == 1:\n missing_col_idx = col_idx\n\nprint(missing_row_idx + 1, missing_col_idx + 1)\n", "a , b = list(map(int,input().split()))\r\nl = []\r\nfor i in range(1,a+1):\r\n\tn = list(input())\r\n\tif n.count(\"*\")==2:\r\n\t\tfor j in range(b):\r\n\t\t\tif n[j]==\"*\":\r\n\t\t\t\tl.append(j+1)\r\n\telif n.count(\"*\")==1:\r\n\t\tc = n.index(\"*\")+1\r\n\t\td = i\r\nif c==l[0]:print(d,l[1])\r\nelse:print(d,l[0])\t\t\r\n", "n, m = map(int, input().split())\r\nother_row = ''\r\nother_id = 0\r\nfor i in range(n):\r\n row = input()\r\n if '*' in row:\r\n if not other_row:\r\n other_row = row\r\n other_id = i\r\n else:\r\n for idx, (x, y) in enumerate(zip(other_row, row), 1):\r\n if x != y:\r\n if x == '.':\r\n print(other_id+1, idx)\r\n else:\r\n print(i+1, idx)", "x,y=map(int,input().split())\r\nm=[]\r\nfor i in range(x):\r\n xx=str(input())\r\n if xx.count(\"*\")==1: a=i+1\r\n m.append([i for i in xx])\r\nfor ii in range(y):\r\n s=0\r\n for i in range(x):\r\n\r\n if m[i][ii]==\"*\":s+=1\r\n if s==1:\r\n b=ii+1\r\n break\r\nprint(a,b)", "n, _ = map(int, input().split())\r\n\r\nfor i, _ in enumerate(range(n), 1):\r\n s = input()\r\n n = s.count(\"*\")\r\n if n == 2:\r\n left = s.find(\"*\")\r\n right = s.rfind(\"*\")\r\n elif n == 1:\r\n row_number = i\r\n row = s\r\n\r\nif row[left] == \"*\":\r\n print(row_number, right+1)\r\nelse:\r\n print(row_number, left + 1)", "n,m = map(int,input().split())\r\nl = []\r\nans1 = ans2 = 0\r\nfor i in range(n):\r\n\ts=input()\r\n\tfor j in range(m):\r\n\t\tif(s[j]=='*'):\r\n\t\t\tans1^=i\r\n\t\t\tans2^=j\r\nprint(ans1+1,ans2+1)", "n,m = map(int, input().split())\r\nindex = []\r\nfor i in range(n):\r\n str = input()\r\n for j in range(m):\r\n if str[j] == '*':\r\n index.append([i,j])\r\n#print(index)\r\nrow = -1\r\ncol = -1\r\nfor i in range(3):\r\n for j in range(3):\r\n if i==j: continue\r\n if index[i][0] == index[j][0] and row <= 0:\r\n row = index[i][0]\r\n if index[i][1] == index[j][1] and col <= 0:\r\n col = index[i][1]\r\nfor i in range(3):\r\n if index[i][0] == row and index[i][1] != col: newcol = index[i][1]\r\n if index[i][0] != row and index[i][1] == col: newrow = index[i][0]\r\nprint(newrow+1,newcol+1)", "n, m = map(int, input().split())\r\narr = []\r\ntwo = 0\r\none = 0\r\nfor i in range(n):\r\n arr.append(input())\r\n if arr[i].count('*') == 2:\r\n two = i\r\n if arr[i].count('*') == 1:\r\n one = i\r\ntwoarr = []\r\nonearr = []\r\nfor i in range(m):\r\n if arr[two][i] == '*':\r\n twoarr.append(i)\r\n if arr[one][i] == '*':\r\n onearr.append(i)\r\n\r\nfor elem in twoarr:\r\n if elem not in onearr:\r\n print(one+1, elem+1)\r\n exit()\r\n ", "\r\ndef solve():\r\n #n = int(input())\r\n n, m = [int(x) for x in input().split()]\r\n res = []\r\n for i in range(n):\r\n res.append(list(input()))\r\n ii = {}\r\n jj = {}\r\n for i in range(0, n):\r\n for j in range(m):\r\n if res[i][j] == '*':\r\n ii[i] = ii.get(i, 0) + 1\r\n jj[j] = jj.get(j, 0) + 1\r\n i_left = 0\r\n j_left = 0\r\n for k, v in ii.items():\r\n if v == 1:\r\n i_left = k\r\n for k, v in jj.items():\r\n if v == 1:\r\n j_left = k\r\n print(i_left+1, j_left+1)\r\n\r\n\r\n\r\n\r\n\r\n\r\nimport math\r\nfrom collections import defaultdict\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n\r\n", "n, m = [int(i) for i in input().split()]\r\nmat = []\r\n\r\nfor i in range(n):\r\n inp = input()\r\n\r\n for j in range(m):\r\n if (inp[j] == \"*\"):\r\n mat.append((i, j))\r\n\r\nmat.sort(key=lambda elem: elem[0])\r\n\r\nif (mat[0][0] == mat[1][0]):\r\n if (mat[2][1] == mat[0][1]):\r\n print(mat[2][0]+1, mat[1][1]+1)\r\n else:\r\n print(mat[2][0]+1, mat[0][1]+1)\r\nelse:\r\n if (mat[1][1] == mat[0][1]):\r\n print(mat[0][0]+1, mat[2][1]+1)\r\n else:\r\n print(mat[0][0]+1, mat[1][1]+1)", "n,m=map(int,input().split())\r\ncity=[]\r\nfor i in range(n):\r\n temp=input()\r\n city.append(temp)\r\nrow={}\r\ncol={}\r\nfor i in range(n):\r\n for j in range(m):\r\n if city[i][j]==\"*\":\r\n if i+1 in row:\r\n row[i+1]+=1\r\n else:\r\n row[i+1]=1\r\n if j+1 in col:\r\n col[j+1]+=1\r\n else:\r\n col[j+1]=1\r\nfor i in row:\r\n if row[i]==1:\r\n x=i\r\n break\r\nfor i in col:\r\n if col[i]==1:\r\n y=i\r\n break\r\nprint(x,y)", "I=input\r\nn,m=map(int,I().split())\r\na=b=999\r\nc=d=0\r\ns=[]\r\nR=range\r\nfor i in R(1,n+1):\r\n\tfor j,x in zip(R(1,m+1),I()):\r\n\t\tif x=='*':s+=[(i,j)];a=min(a,i);c=max(c,i);b=min(b,j);d=max(d,j)\r\nfor i in a,c:\r\n\tfor j in b,d:\r\n\t\tif (i,j)not in s:print(i,j)", "a,b = map(int, input().split())\r\na = int(a)\r\nb = int(b)\r\nvertex = []\r\nvertex1 = []\r\nres = []\r\nk = []\r\nfor x in range(a):\r\n n = list(map(str, input().split()))\r\n n = [y for x in n for y in x]\r\n res.append(n)\r\ncount = 0\r\n \r\nfor i in range(a):\r\n count = 0\r\n for j in range(b):\r\n if res[i][j] == \"*\":\r\n count += 1\r\n vertex.append(j)\r\n k.append(i)\r\n if count == 2:\r\n vertex1 = vertex[-2:]\r\n del vertex[-2:]\r\n del k[-2:]\r\n \r\nfor u in vertex1:\r\n if u != vertex[0]:\r\n print(k[0] +1, u +1)\r\n ", "#n, k = map(int, input().split(\" \"))\r\n#L = [int(x) for x in input().split()]\r\n\r\nn, m = map(int, input().split(\" \"))\r\nL = []\r\nfor x in range(n) : \r\n s = input()\r\n L.append(s)\r\n\r\nX = []\r\nY = []\r\n\r\nfor i in range(n) :\r\n for j in range(m) :\r\n if (L[i][j] == '*') : \r\n X.append(i)\r\n Y.append(j)\r\n\r\nX.sort()\r\nY.sort()\r\n\r\nansx = X[0] + X[2] - X[1] + 1\r\nansy = Y[0] + Y[2] - Y[1] + 1\r\nprint(ansx, ansy)", "first_line = input().split()\r\nn, m = int(first_line[0]), int(first_line[1])\r\ncoordinates = []\r\nfor i in range(n):\r\n row = input()\r\n for j in range(m):\r\n if row[j] == '*':\r\n coordinates.append([i, j])\r\nx1, y1 = coordinates[0]\r\nx2, y2 = coordinates[1]\r\nx3, y3 = coordinates[2]\r\nx, y = 0, 0\r\nif x1 == x2:\r\n x = x3\r\nelif x1 == x3:\r\n x = x2\r\nelse:\r\n x = x1\r\nif y1 == y2:\r\n y = y3\r\nelif y1 == y3:\r\n y = y2\r\nelse:\r\n y = y1\r\nprint(x+1, y+1)\r\n", "from collections import Counter\r\n\r\nn,m = map(int,input().split())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n s = input()\r\n l.append(s)\r\n\r\nx = []\r\ny = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == '*':\r\n x.append(i)\r\n y.append(j)\r\n\r\nxc = Counter(x)\r\nyc = Counter(y)\r\n\r\nfor k,v in xc.items():\r\n if v == 1:\r\n ans1 = k\r\n\r\nfor k,v in yc.items():\r\n if v == 1:\r\n ans2 = k\r\n\r\n# print(xc,yc)\r\nprint(ans1+1,ans2+1)", "n, m = map(int, input().split())\r\nl = []\r\nfor t in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == '*':\r\n l.append((t+1, j+1))\r\n\r\nif l[0][0] == l[1][0]:\r\n r = l[2][0]\r\nelif l[0][0] == l[2][0]:\r\n r = l[1][0]\r\nelse:\r\n r = l[0][0] \r\n\r\nif l[0][1] == l[1][1]:\r\n c = l[2][1]\r\nelif l[0][1] == l[2][1]:\r\n c = l[1][1]\r\nelse:\r\n c = l[0][1]\r\n\r\nprint(r,c)", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn, m = list(map(int, input().split()))\r\npoint = []\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == '*':\r\n point.append([i, j])\r\ndc = [{}, {}]\r\nfor p in point:\r\n for i in [0, 1]:\r\n dc[i][p[i]] = dc[i].get(p[i], 0) + 1\r\n# print(dc)\r\nfor i in [0, 1]:\r\n for k, v in dc[i].items():\r\n if v == 1:\r\n print(k + 1, end=' ')\r\n", "n, m = map(int, input().split())\r\nb = list()\r\nc = list()\r\na=[input() for _ in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j]=='*':\r\n\t\t\tb.append(i)\r\n\t\t\tc.append(j)\r\nfor i in b:\r\n\tif b.count(i)==1:\r\n\t\tprint(i+1, end = ' ')\r\nfor i in c:\r\n\tif c.count(i)==1:\r\n\t\tprint(i+1, end = ' ')", "a,b=map(int,input().split());x=[]\r\nfor i in range(a):\r\n\tx.append(input())\r\n\tif x[i].count('*')==1:\r\n\t\tp=i+1;q=x[i].find('*')+1\r\n\tif x[i].count('*')==2:\r\n\t\tk=x[i].find('*')+1;j=x[i].rfind('*')+1\r\nprint(p,k if k!=q else j)\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "\ndef main():\n firstThree = []\n rows, columns = map(int, input().split())\n result = 0\n\n for i in range(rows):\n line = list(input())\n for j in range(columns):\n if line[j] == '*':\n firstThree.append([i, j])\n\n #print(firstThree)\n firstThree = sorted(firstThree, key=lambda x: x[0])\n if firstThree[0][0] == firstThree[1][0]:\n result = firstThree[2][0] + 1\n else:\n result = firstThree[0][0] + 1\n\n firstThree = sorted(firstThree, key=lambda x: x[1])\n if firstThree[0][1] == firstThree[1][1]:\n print(result, firstThree[2][1] + 1)\n else:\n print(result, firstThree[0][1] + 1)\n\n\n\nif __name__ == '__main__':\n main()\n\t \t \t \t \t \t \t\t\t \t\t\t \t", "n, m = tuple([int(x) for x in input().split()])\nx_dict = {}\ny_dict = {}\nfor i in range(n):\n\trow = input()\n\tfor j in range(len(row)):\n\t\tif(row[j] == \"*\"):\n\t\t\tx_dict[i] = x_dict.get(i, 0) + 1\n\t\t\ty_dict[j] = y_dict.get(j, 0) + 1\n#print(x_dict, y_dict)\nx_dict = {v:k for k, v in x_dict.items()}\ny_dict = {v:k for k, v in y_dict.items()}\n#print(x_dict, y_dict)\nprint(\"%d %d\"%(x_dict[1]+1, y_dict[1]+1))\n\n\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\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# -------------------------------------------------------------------- #\ndef main():\n n, m = map(int, input().split())\n mapa = [input() for i in range(n)]\n crimes = []\n\n for i in range(n):\n for j in range(m):\n if mapa[i][j] == '*':\n crimes.append((i, j))\n\n for i in range(3):\n for j in range(i, 3):\n if crimes[i][0] != crimes[j][0] and crimes[i][1] != crimes[j][1]:\n if mapa[crimes[i][0]][crimes[j][1]] == '.':\n print(crimes[i][0] + 1, crimes[j][1] + 1)\n return\n print(crimes[j][0] + 1, crimes[i][1] + 1)\n return\n\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,m=map(int,input().split())\nansx,ansy=0,0\nfor i in range(n):\n temp=list(input())\n for j in range(m):\n if temp[j]=='*':\n ansx^=i\n ansy^=j\nprint(ansx+1,ansy+1)", "n,m=map(int,input().split())\r\nl,d=[],0\r\nfor i in range(n):\r\n\tl1=list(input())\r\n\tl.append(l1)\r\n# print(l)\r\nfor i in range(n):\r\n\tif l[i].count('*')==1:\r\n\t\tprint(i+1,end=' ')\r\n\t\td-=l[i].index('*')\r\n\tif l[i].count('*')==2:\r\n\t\tfor j in range(m):\r\n\t\t\tif l[i][j]=='*':\r\n\t\t\t\td+=j\r\nprint(d+1)\r\n", "n,m = map(int,input().split())\r\na = []\r\nb = 0\r\nc = 0\r\nfor i in range(n):\r\n a.append(input().strip())\r\nfor i in range(n):\r\n count = 0\r\n for j in range(m):\r\n if(a[i][j] == \"*\"):\r\n count +=1 \r\n if(count == 1):\r\n b = i+1\r\nfor i in range(m):\r\n count = 0\r\n for j in range(n):\r\n if(a[j][i] == \"*\"):\r\n count +=1 \r\n if(count == 1):\r\n c = i+1\r\nprint(b,c) ", "n,m = map(int, input().split())\r\nmatrix = [[x for x in input()] for _ in range(n)]\r\ntp = [[0,0],[0,0],[0,0]]\r\nfor i in range(n):\r\n if matrix[i].count(\"*\") == 1:\r\n tp[0][0] = matrix[i].index(\"*\") + 1\r\n tp[0][1] = i + 1\r\n if matrix[i].count(\"*\") == 2:\r\n for j in range(1, 3):\r\n tp[j][0] = matrix[i].index(\"*\") + 1\r\n tp[j][1] = i + 1\r\n matrix[i][matrix[i].index(\"*\")] = \".\"\r\nres = [0,tp[0][1]]\r\nfor i in range(1,3):\r\n if tp[i][0] != tp[0][0]:\r\n res[0] = tp[i][0]\r\nprint(*res[::-1])\r\n", "m,n = map(int, input().split())\r\np=[]\r\nq=[]\r\nfor i in range(m):\r\n x=input()\r\n for j in range(len(x)):\r\n if(x[j]=='*'):\r\n p.append(i)\r\n q.append(j)\r\nif(p[0]==p[1]):\r\n resx=p[2]\r\nelif(p[1]==p[2]):\r\n resx=p[0]\r\nelse:\r\n resx=p[1]\r\nif(q[0]==q[1]):\r\n resy=q[2]\r\nelif(q[1]==q[2]):\r\n resy=q[0]\r\nelse:\r\n resy=q[1]\r\nprint(resx+1,resy+1)\r\n ", "n,m = map(int,input().split())\r\nop = []\r\nfor i in range(n):\r\n l = input(\"\")\r\n crimes = list(l)\r\n for j in range(m):\r\n if crimes[j]==\"*\":\r\n op.append(i)\r\n op.append(j)\r\n\r\nif op[0] == op[2]:\r\n if op[5] == op[3]:\r\n a = op[4]\r\n b = op[1]\r\n else:\r\n a = op[4]\r\n b = op[3]\r\nelse:\r\n if op[1] == op[3]:\r\n a = op[0]\r\n b = op[5]\r\n else:\r\n a = op[0]\r\n b = op[3]\r\n\r\nprint(a+1,b+1)\r\n", "n, m = map(int,input().split())\r\nx, y = 0, 0\r\nfor i in range(n):\r\n line = input()\r\n for j in range(m): \r\n if(line[j] == '*'):\r\n x ^= i\r\n y ^= j\r\nprint(x + 1, y + 1)", "def get_col(li,column):\r\n return list(map(lambda x: x[column], li))\r\nl = []\r\nfor _ in range(int(input().split()[0])): l.append(input())\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == \".\" and \"*\" in l[i] and \"*\" in get_col(l,j):\r\n print(i+1,j+1)\r\n quit()", "n, m = map(int, input().split())\r\nd = []\r\nt = 0\r\nfor i in range(n):\r\n s = input()\r\n if s.count('*') == 2:\r\n for j in range(m):\r\n if s[j] == '*':\r\n d.append(j + 1)\r\n if s.count('*') == 1:\r\n t = s.index('*') + 1\r\n print(i + 1, end=' ')\r\nprint(d[0] if t == d[1] else d[1])\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# نشود فاش کسی", "n,m=[int(s) for s in input().split()]\r\nfor i in range(n):\r\n a=input()\r\n if a.count('*')==1:\r\n y=i+1\r\n x=a.index('*')+1\r\n elif a.count('*')==2:\r\n x1=a.find('*')+1\r\n x2=a.rfind('*')+1\r\nif x==x1:\r\n print(y,x2)\r\nelse:\r\n print(y,x1)\r\n\r\n", "R,C = map(int,input().split())\r\nL = []\r\nfor i in range(1,R+1):\r\n S = list(input())\r\n for j in range(1,C+1):\r\n if S[j-1] == '*':\r\n L.append((i,j))\r\nx,y = 0,0\r\nif L[0][0] == L[1][0]:\r\n x = L[2][0]\r\nelif L[0][0] == L[2][0]:\r\n x = L[1][0]\r\nelse:\r\n x = L[0][0]\r\nif L[0][1] == L[1][1]:\r\n y = L[2][1]\r\nelif L[0][1] == L[2][1]:\r\n y = L[1][1]\r\nelse:\r\n y = L[0][1]\r\noup = [x,y]\r\nprint(*oup)", "n,m=list(map(int,input().split()))\r\nx,y=0,0\r\nl=[]\r\nrow=set()\r\ncol=set()\r\nfor i in range(n):l.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]==\"*\"):\r\n if (i+1) not in row:row.add((i+1))\r\n else:row.remove((i+1))\r\n if (j+1) not in col:col.add((j+1))\r\n else:col.remove((j+1))\r\nprint(*row,*col)", "n, m = [int(x) for x in input().split()]\r\ngrid = []\r\nfor r in range(n):\r\n row = input()\r\n grid.append(row) # string is a special list\r\n# how to find the loc of 4th star\r\n# row: count the stars of each row\r\nfor r in range(n):\r\n cnt = 0\r\n for c in range(m):\r\n if grid[r][c] == '*':\r\n cnt += 1\r\n if cnt == 1:\r\n r1 = r+1\r\n break\r\nfor c in range(m):\r\n cnt = 0\r\n for r in range(n):\r\n if grid[r][c] == '*':\r\n cnt += 1\r\n if cnt == 1:\r\n c1 = c+1\r\n break\r\nprint(r1, c1)", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n\ta.append(input())\r\nfor i in range(len(a)):\r\n\tif(a[i].count('*')==1):\r\n\t\tl=i\r\nfor j in range(m):\r\n\tc=0\r\n\tfor i in range(n):\r\n\t\tif(a[i][j]=='*'):\r\n\t\t\tc=c+1\r\n\tif(c==1):\r\n\t\tz=j\r\n\t\tbreak\r\nprint(l+1,z+1)", "n,m = map(int, input().split())\r\nx =[]\r\nfor i in range(0,n):\r\n p = str(input())\r\n l = list(p)\r\n for j in range(0,m):\r\n if l[j] == \"*\":\r\n x.append(i+1)\r\n x.append(j+1)\r\nif x[0] == x[2]:\r\n x.append(x[4])\r\nelif x[0] == x[4]:\r\n x.append(x[2])\r\nelse:\r\n x.append(x[0])\r\nif x[1] == x[3]:\r\n x.append(x[5])\r\nelif x[1] == x[5]:\r\n x.append(x[3])\r\nelse:\r\n x.append(x[1])\r\nprint((x[6]),(x[7]))\r\n", "n,m = map(int, input().split())\r\nx,y = 0,0\r\nfor i in range(n):\r\n line = input()\r\n for j in range(m):\r\n if line[j] == \"*\":\r\n x^=i\r\n y^=j\r\nprint(x+1,y+1)\r\n", "# Given 3 coordinates: we can find 4th by using midpoint logic. \nn, m = [int(ele) for ele in input().strip().split()]\ndistricts = []\ncoordinates = []\nfor i in range(n):\n row = list(input().strip())\n districts.append(row)\n\nfor i in range(n):\n for j in range(m):\n if districts[i][j] == '*':\n coordinates.append((i+1, j+1))\n\n#coordinates = sorted(coordinates)\nif coordinates[0][0] != coordinates[1][0] and coordinates[0][1] != coordinates[1][1]:\n midpt = (coordinates[0][0]+coordinates[1][0], coordinates[0][1]+coordinates[1][1])\n print(str(midpt[0] - coordinates[2][0]) + ' ' + str(midpt[1] - coordinates[2][1]))\n\nelif coordinates[0][0] != coordinates[2][0] and coordinates[0][1] != coordinates[2][1]:\n midpt = (coordinates[0][0]+coordinates[2][0], coordinates[0][1]+coordinates[2][1])\n print(str(midpt[0] - coordinates[1][0]) + ' ' + str(midpt[1] - coordinates[1][1]))\n\nelse:\n midpt = (coordinates[1][0]+coordinates[2][0], coordinates[1][1]+coordinates[2][1])\n print(str(midpt[0] - coordinates[0][0]) + ' ' + str(midpt[1] - coordinates[0][1]))\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a=input()\r\n if(a.count('*')==1):\r\n x=i+1\r\n y1=a.index('*')+1\r\n if(a.count('*')==2):\r\n for j in range(m):\r\n if(a[j]=='*'):\r\n l.append(j+1)\r\n \r\nif(l[0]!=y1):\r\n y=l[0]\r\nelse:\r\n y=l[1]\r\nprint(x,y)", "inp=input()\r\nm,n=inp.split(\" \")\r\nm=int(m)\r\nn=int(n)\r\nip=[]\r\nfor i in range(m):\r\n s=input()\r\n ip.append(list(s.strip()))\r\ncount=[]\r\nfor i in ip:\r\n c=0\r\n for j in i:\r\n if j=='*':\r\n c+=1\r\n count.append(c)\r\ni=count.index(2)\r\nj=count.index(1)\r\nfor k in range(len(ip[i])):\r\n if ip[i][k]=='*':\r\n l=k\r\n break\r\nfor k in range(l+1,len(ip[i])):\r\n if ip[i][k]=='*':\r\n p=k\r\n break\r\n\r\nif ip[i][l]==ip[j][l]:\r\n if ip[i][p]!=ip[j][p]:\r\n print(j+1,p+1)\r\nelse:\r\n if ip[i][p]==ip[j][p]:\r\n print(j+1,l+1)", "n, m = [int(x) for x in input().split(' ')]\noneA, twoA = [0, 0], [0, 0, 0, 0]\nfor i in range(n):\n c = input()\n if c.count('*') == 1:\n oneA = [i + 1, c.index('*') + 1]\n elif c.count('*') == 2:\n twoA = [i + 1, c.index('*') + 1, i + 1, len(c) - c[::-1].index('*')]\nif [oneA[0], twoA[1]] != oneA: print(oneA[0], twoA[1])\nelse: print(oneA[0], twoA[3])\n", "from math import*\r\nn,m=map(int,input().split())\r\nt=[[0,0],[0,0],[0,0]]\r\nk=0\r\nmat=[]\r\ns=[]\r\nfor i in range(n):\r\n mat.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if mat[i][j]=='*':\r\n t[k][0]=i+1\r\n t[k][1]=j+1\r\n k+=1\r\nif t[0][0]==t[1][0]:\r\n if t[2][1]==t[0][1]:\r\n print(t[2][0],t[1][1])\r\n exit()\r\n else:\r\n print(t[2][0],t[0][1])\r\n exit()\r\nif t[0][0] == t[2][0]:\r\n if t[1][1] == t[0][1]:\r\n print(t[1][0], t[2][1])\r\n exit()\r\n else:\r\n print(t[1][0], t[0][1])\r\n exit()\r\nif t[2][0] == t[1][0]:\r\n if t[0][1] == t[1][1]:\r\n print(t[0][0], t[2][1])\r\n exit()\r\n else:\r\n print(t[0][0], t[1][1])\r\n exit()\r\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\nb=[]\r\nc=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='*':\r\n b.append(i+1)\r\n c.append(j+1)\r\nx=list(set(b))\r\ny=list(set(c))\r\nfor i in range(2):\r\n if x[i] in b:\r\n del(b[b.index(x[i])])\r\n if x[i] not in b:\r\n print(x[i],end=\" \")\r\n break\r\nfor i in range(2):\r\n if y[i] in c:\r\n del(c[c.index(y[i])])\r\n if y[i] not in c:\r\n print(y[i],end=\" \")\r\n break", "a, b = [int(x) for x in input().split(\" \")]\nv = []\nfor i in range(a):\n v.append([])\n v[i] = input()\n\nfor i in range(a):\n if(v[i].count(\"*\") == 1):\n x = i\n elif(v[i].count(\"*\") == 2):\n y = i\n\nc = 0\nfor i in v[y]:\n if(i == \"*\"):\n if(v[x][c] != \"*\"):\n print(x+1, \" \", c+1)\n\n c += 1\n\t \t\t\t \t \t \t \t \t \t", "def solution(l2,l3):\r\n c_out=\"\"\r\n #print(l2,l3)\r\n for x in l3:\r\n if l3.count(x)==1:\r\n c_out+=str(x)+\" \"\r\n for x in l2:\r\n if l2.count(x)==1:\r\n c_out+=str(x)\r\n \r\n return c_out\r\n\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n n = l1[0]\r\n l2=[]\r\n l3=[]\r\n i=0\r\n while i<n:\r\n b = list(input())\r\n while \"*\" in b:\r\n l2.append(b.index(\"*\")+1)\r\n l3.append(i+1)\r\n b[b.index(\"*\")]=0\r\n i+=1\r\n print(solution(l2,l3))\r\nanswer()", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(m):\r\n if s[i] == '*':\r\n b.append(i)\r\n a.append(_)\r\nprint(min(a,key=a.count)+1, min(b,key=b.count)+1)", "n,m=map(int,input().split())\r\n\r\nmatrix=[]\r\nfor i in range(n):\r\n row=input()\r\n row=[j for j in row]\r\n matrix.append(row)\r\n\r\ncoor=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if matrix[i][j]=='*':\r\n coor.append([i,j])\r\n\r\nx=[i[0] for i in coor]\r\ny=[i[1] for i in coor]\r\n\r\ndict_x={}\r\nfor key in x:\r\n dict_x[key]=x.count(key)\r\n\r\ndict_y={}\r\nfor key in y:\r\n dict_y[key]=y.count(key)\r\n\r\nfor key in dict_x.keys():\r\n if dict_x[key]==1:\r\n ans_x=key\r\n\r\nfor key in dict_y.keys():\r\n if dict_y[key]==1:\r\n ans_y=key\r\n\r\nprint(ans_x+1,\" \",ans_y+1)", "from collections import Counter as C\nn,m = map(int,input().split())\na,b = C(),C()\nfor i in range(n):\n s = input()\n for j in range(m):\n if s[j]=='*':\n a[i+1]+=1\n b[j+1]+=1\n \nprint(a.most_common()[1][0],b.most_common()[1][0])\n'''\nw = int(input())\nc = 0\nfor _ in range(w):\n a = sum(map(int,input().split()))\n c+=int(a>1)\nprint(c)\n'''\n", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\ncoordinates = []\r\nans_x, ans_y = 0, 0\r\nfor i in range(m):\r\n s = input()\r\n for j in range(n):\r\n if(s[j] == '*'):\r\n coordinates.append([i, j])\r\n\r\n\r\n# now we need to check the first two coordinates\r\n\r\n# case 1: they have the same x value\r\nif(coordinates[0][0] == coordinates[1][0]):\r\n # a, b - a, c \r\n\r\n # x, b - x, c\r\n\r\n # in the same line as the first coordinate\r\n if(coordinates[2][1] == coordinates[0][1]):\r\n ans_x = coordinates[2][0]\r\n ans_y = coordinates[1][1]\r\n # in the same line as the second coordinate\r\n else:\r\n ans_x = coordinates[2][0]\r\n ans_y = coordinates[0][1]\r\n\r\n\r\n# case 2: they have the same y value\r\nelif(coordinates[0][1] == coordinates[1][1]):\r\n\r\n # a, c - a, x\r\n # b, c - b, x\r\n\r\n\r\n if(coordinates[2][0] == coordinates[0][0]):\r\n ans_x = coordinates[1][0]\r\n ans_y = coordinates[2][1]\r\n else:\r\n ans_x = coordinates[0][0]\r\n ans_y = coordinates[2][1]\r\n# case 3: they don't have any common value\r\nelse:\r\n ans_x = coordinates[0][0]\r\n ans_y = coordinates[1][1]\r\n\r\nans_x += 1\r\nans_y += 1\r\n\r\nprint(str(ans_x) + \" \" + str(ans_y))\r\n\r\n\r\n\r\n", "def solve(n, m, p):\n x, y = None, None\n for i in range(n):\n if p[i].count('*') == 1:\n x = i + 1\n\n for j in range(m):\n c = 0\n for i in range(n):\n if p[i][j] == '*':\n c += 1\n if c == 1:\n y = j + 1\n return x, y\n\n \n\n\ndef main():\n n, m = list(map(int, input().split()))\n p = [input() for i in range(n)]\n print(*solve(n, m, p))\n\n\nmain()\n", "n,m=map(int,input().split())\r\nl=[]\r\nl1=[]\r\nfor i in range(n):\r\n m1=list(input())\r\n l.append(m1)\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]=='*'):\r\n c+=1\r\n l1.append([i+1,j+1])\r\n if(c==3):\r\n break\r\n if(c==3):\r\n break\r\nd={}\r\nd1={}\r\nfor i in range(len(l1)):\r\n if(l1[i][0] not in d):\r\n d[l1[i][0]]=1\r\n else:\r\n d[l1[i][0]]+=1\r\n if(l1[i][1] not in d1):\r\n d1[l1[i][1]]=1\r\n else:\r\n d1[l1[i][1]]+=1\r\nfor i in d:\r\n if(d[i]==1):\r\n a=i\r\n break\r\nfor i in d1:\r\n if(d1[i]==1):\r\n b=i\r\n break\r\nprint(a,b)\r\n \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 = []\r\n for i in range(n):\r\n A.append(input())\r\n X = []\r\n Y = []\r\n for i in range(n):\r\n for j in range(m):\r\n if A[i][j] == '*':\r\n X.append(i)\r\n Y.append(j)\r\n X.sort()\r\n Y.sort()\r\n if X[0] == X[1]:\r\n x = X[2]\r\n else:\r\n x = X[0]\r\n if Y[0] == Y[1]:\r\n y = Y[2]\r\n else:\r\n y = Y[0]\r\n print('%d %d' % (x + 1, y + 1))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\nfor i in range(n):\n a = input()\n if a.count('*') == 2:\n x = [i, a.index('*')]\n y = [i, a.index('*', x[1]+1)]\n if a.count('*') == 1:\n z = [i, a.index('*')]\nif x[1] == z[1]:\n print(z[0]+1, y[1]+1)\nelse:\n print(z[0]+1, x[1]+1)", "n, m = map(int, input().split())\r\nfor i in range(n):\r\n s = input()\r\n if s.count('*') == 2 :\r\n s1 = s.find('*')\r\n s2 = s[s1 + 1 :].find('*') + len(s[ : s1]) + 1\r\n if s.count('*') == 1 :\r\n s3 = s.find('*')\r\n l = i\r\nif s1 == s3 :\r\n print(l+1, s2+1)\r\nelse:\r\n print(l+1, s1+1)", "'''\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press \"Run\" button to execute it.\n\n'''\nimport sys\nimport math\n \ninput = sys.stdin.readline\n \n \n############ ---- Input Functions ---- ############\ndef inp():\n return (int(input()))\n \n \ndef inlt():\n return (list(map(int, input().split())))\n \n \ndef insr():\n s = input()\n return (list(s[:len(s) - 1]))\n \n \ndef invr():\n return (map(int, input().split()))\n \n \n \ncoordlist=[]\n\nm,n=inlt()\n\nmatrix = [ [ 0 for i in range(n) ] for j in range(m) ]\nfor i in range(m):\n a=insr()\n for j in range(n):\n if a[j]=='*':\n coordlist.append((i+1,j+1))\n \n\nx4 = coordlist[0][0] ^ coordlist[1][0] ^ coordlist[2][0];\n\ny4 = coordlist[0][1] ^ coordlist[1][1] ^ coordlist[2][1];\n\n\nprint(x4,y4)", "n,m = map(int, input().split())\r\nl = []\r\nfor _ in range(n):\r\n l += [input()]\r\n\r\nsides = [-1,-1,-1,-1]\r\n\r\nfor k in range(n):\r\n for j in range(m):\r\n if l[k][j] == '*':\r\n if sides[0] == -1:\r\n sides[0] = [k,j]\r\n elif sides[1] == -1:\r\n if sides[0][1] == k:\r\n sides[1] = [k,j]\r\n elif sides[2] == -1:\r\n sides[2] = [k,j]\r\n else: sides[3] = [k,j]\r\n elif sides[2] == -1:\r\n sides[2] = [k,j]\r\n\r\nlinpos=[]\r\ncolpos=[]\r\nfor li in sides:\r\n if li != -1:\r\n linpos += [li[0]]\r\n colpos += [li[1]]\r\n\r\nif linpos[0] == linpos[1]:\r\n lin = linpos[2]\r\nelif linpos[0] == linpos[2]:\r\n lin = linpos[1]\r\nelse: lin = linpos[0]\r\n\r\nif colpos[0] == colpos[1]:\r\n col = colpos[2]\r\nelif colpos[0] == colpos[2]:\r\n col = colpos[1]\r\nelse: col = colpos[0]\r\n\r\nprint(lin+1,col+1)", "dis = []\n\ndicio_i = {}\ndicio_j = {}\ncoord_rob = []\n\ndis_size = input().split()\n\nfor i in range(int(dis_size[0])):\n dis.append(input())\n dicio_i[i] = 0\n for j in range(int(dis_size[1])):\n dicio_j[j] = 0\n\nfor i in range(int(dis_size[0])):\n j = 0\n for mark in dis[i]:\n if mark == '*':\n dicio_i[i] += 1\n dicio_j[j] += 1\n j += 1\n\nfor key, value in dicio_i.items():\n if value == 1:\n coord_rob.insert(0, key+1)\n\nfor key, value in dicio_j.items():\n if value == 1:\n coord_rob.insert(1, key+1)\n\nprint(f'{coord_rob[0]} {coord_rob[1]}')\n \t\t\t \t\t \t \t \t \t\t\t \t", "m, n = map(int, input().split())\r\ndata = list()\r\nfor _ in range(m):\r\n data.append(list(input()))\r\na = {(x,y) for x in range(m) for y in range(n) if data[x][y] == '*'}\r\nx_pos = [x for x in range(m) for y in range(n) if data[x][y] == '*']\r\ny_pos = [y for x in range(m) for y in range(n) if data[x][y] == '*']\r\nt = set()\r\nfor x in x_pos:\r\n for y in y_pos: t.add((x,y))\r\nprint(next(iter(t-a))[0]+1, next(iter(t-a))[1]+1)", "s = input().split()\nn,m = int(s[0]),int(s[1])\nl=r=0 \nfor i in range(n):\n s = input()\n for j in range(len(s)):\n if s[j]=='*':\n l^=(i+1)\n r^=(j+1)\nprint(l,r)\n\t \t \t\t\t \t\t\t \t \t \t \t", "r=int(input().split()[0])\r\nx=y=0\r\nfor i in range(r):\r\n for j,v in enumerate(input()):\r\n if v=='*': x^=j;y^=i\r\nprint(y+1,x+1)", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn, m = map(int, input().split())\r\na = 0\r\nb = 0\r\nd = 0\r\ne = 0\r\nfor i in range(n):\r\n\tm = input()\r\n\tc = m.count(\"*\")\r\n\tif c == 1:\r\n\t\td = i + 1\r\n\t\te = m.find(\"*\")\r\n\tif c == 2:\r\n\t\ta = m.find(\"*\")\r\n\t\tb = m.rfind(\"*\")\r\nif e == a:\r\n\tprint(d, b + 1)\r\nelse:\r\n\tprint(d, a + 1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ndots = []\r\nfor i in range(1, n + 1):\r\n for j, x in enumerate(input(), start=1):\r\n if x == '*':\r\n dots.append((i, j))\r\n\r\nr, c = None, None\r\ndots.sort()\r\nr = dots[0][0] if dots[0][0] != dots[1][0] else dots[2][0]\r\ndots.sort(key=lambda x:(x[1]))\r\nc = dots[0][1] if dots[0][1] != dots[1][1] else dots[2][1]\r\nprint(r, c)", "n, m = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n a = input()\r\n if '*' in a:\r\n d.append([(i, j) for j in range(m) if a[j] == '*'])\r\nif len(d[0]) == 1:\r\n x = d[0][0][0] + 1\r\n y = d[1][0][1] * (d[1][0][1] != d[0][0][1]) + d[1][1][1] * (d[1][1][1] != d[0][0][1]) + 1\r\nelse:\r\n x = d[1][0][0] + 1\r\n y = d[0][0][1] * (d[0][0][1] != d[1][0][1]) + d[0][1][1] * (d[0][1][1] != d[1][0][1]) + 1\r\nprint(x, y)", "n,m = (input()).split()\r\nL = []\r\nl1 = []\r\nfor i in range(int(n)):\r\n s=input()\r\n L.append([x for x in s])\r\nfor i in range(int(n)):\r\n for j in range(int(m)):\r\n if L[i][j]==\"*\":\r\n l1.append([i,j])\r\nl1_x=[]\r\nl1_y=[]\r\nfrom collections import Counter\r\nfor i in range(len(l1)):\r\n l1_x.append(l1[i][0])\r\n l1_y.append(l1[i][1])\r\nx1=Counter(l1_x)\r\nx2 = Counter(l1_y)\r\nc=0\r\nc1=0\r\nfor i in x1:\r\n if x1[i]==1:\r\n c=c+i+1\r\nfor i in x2:\r\n if x2[i]==1:\r\n c1+=i+1\r\nprint(c,c1)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tw=list(input())\r\n\tl.append(w)\r\nq=[]\r\nt=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif l[i][j]==\"*\":\r\n\t\t\ts=i\r\n\t\t\ty=j\r\n\t\t\tq.append(s)\r\n\t\t\tt.append(y)\r\nfor i in range(len(q)):\r\n\tg=q.count(q[i])\r\n\tif g==1:\r\n\t\tprint(q[i]+1,end=' ')\r\nfor i in range(len(t)):\r\n\tg=t.count(t[i])\r\n\tif g==1:\r\n\t\tprint(t[i]+1,end=' ')\r\n", "n = input().split()\r\nrow,col = n[0],n[1]\r\nd = []\r\nfor j in range(int(row)):\r\n c = input()\r\n for idx,i in enumerate(c) : \r\n if i == \"*\":\r\n d.append((j+1,idx+1))\r\nans = \"\"\r\n\r\nif d[0][0] == d[1][0] : \r\n ans+=f\"{d[2][0]} \"\r\nelif d[0][0] == d[2][0] :\r\n ans+=f\"{d[1][0]} \"\r\nelse : \r\n ans+=f\"{d[0][0]} \"\r\nif d[0][1] == d[1][1] : \r\n ans+=f\"{d[2][1]}\"\r\nelif d[0][1] == d[2][1] :\r\n ans+=f\"{d[1][1]}\"\r\nelse : \r\n ans+=f\"{d[0][1]}\"\r\nprint(ans)", "n,m = map(int,input().split())\ni_ = []\nj_ = []\nfor i in range(1,n+1):\n k = input()\n for j in range(1,len(k)+1):\n if(k[j-1] == \"*\"):\n i_.append(i)\n j_.append(j)\n\ni_.sort()\nj_.sort()\nprint(i_[0]-i_[1]+i_[2],j_[0]-j_[1]+j_[2])\n\n\n\t \t \t\t\t \t \t \t\t\t\t\t \t\t\t\t\t\t", "def getFourthVertex(coord1_x,coord1_y,coord2_x,coord2_y,coord3_x,coord3_y):\r\n if coord1_x == coord2_x or coord1_x==coord3_x:\r\n if coord1_x == coord2_x:\r\n coord4_x=coord3_x\r\n else:\r\n coord4_x=coord2_x\r\n else:\r\n coord4_x=coord1_x\r\n if coord1_y == coord2_y or coord1_y==coord3_y:\r\n if coord1_y == coord2_y:\r\n coord4_y=coord3_y\r\n else:\r\n coord4_y=coord2_y\r\n else:\r\n coord4_y=coord1_y\r\n return coord4_x + 1,coord4_y + 1\r\n\r\ndef solve(m):\r\n c = []\r\n for i in range(len(m)):\r\n for j in range(len(m[i])):\r\n if m[i][j] == \"*\":\r\n c.append([i,j]) \r\n return getFourthVertex(c[0][0],c[0][1],c[1][0],c[1][1],c[2][0],c[2][1])\r\n\r\n \r\nm,n = map(int,input().split())\r\nmat = []\r\nfor _ in range(m):\r\n mat.append(input())\r\ni,j = solve(mat)\r\nprint(i,j,end = \" \")", "# Python3 implementation of the approach\r\n\r\n# Function that return the coordinates\r\n# of the fourth vertex of the rectangle\r\ndef findFourthVertex(n, m, s) :\r\n\r\n\trow = dict.fromkeys(range(n), 0)\r\n\tcol = dict.fromkeys(range(m), 0)\r\n\t\r\n\tfor i in range(n) :\r\n\t\tfor j in range(m) :\r\n\r\n\t\t\t# Save the coordinates of the given\r\n\t\t\t# vertices of the rectangle\r\n\t\t\tif (s[i][j] == '*') :\r\n\t\t\t\trow[i] += 1;\r\n\t\t\t\tcol[j] += 1;\r\n\r\n\tfor keys,values in row.items() :\r\n\t\tif (values == 1) :\r\n\t\t\tx = keys;\r\n\t\t\t\r\n\tfor keys,values in col.items() :\r\n\t\tif (values == 1) :\r\n\t\t\ty = keys;\r\n\r\n\t# 1-based indexing\r\n\treturn (x + 1, y + 1) ;\r\n\r\n# Driver code\r\nif __name__ == \"__main__\" :\r\n\t\r\n\tn,m = map(int,input().split())\r\n\ts = []\r\n\tfor i in range(n) :\r\n\t s.append(input())\r\n\trs = findFourthVertex(n, m, s);\r\n\tprint(rs[0], rs[1])\r\n\r\n# This code is contributed by Ryuga\r\n", "n,m = map(int,input().split())\r\na =[]\r\nfor i in range(n):\r\n\ta.append(list(input()))\r\n\r\nl = {}\r\nr = {}\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] == \"*\":\r\n\t\t\tif (i+1) in l:\r\n\t\t\t\tl[i+1] += 1\r\n\t\t\telse:\r\n\t\t\t\tl[i+1] = 1\r\n\r\n\t\t\tif (j+1) in r:\r\n\t\t\t\tr[j+1] += 1\r\n\t\t\telse:\r\n\t\t\t\tr[j+1] = 1\r\n# print(l,r)\r\nx = 0\r\ny = 0\r\nfor i,j in l.items():\r\n\tif j == 1:\r\n\t\tx = i\r\nfor i,j in r.items():\r\n\tif j == 1:\r\n\t\ty = i\r\nprint(x,y)", "n,m = map(int, input().split())\ndistricts = []\n\nfor i in range(n):\n row = input()\n for j in range(len(row)):\n if row[j] == '*':\n districts.append([i+1,j+1])\n\nif districts[0][0] == districts[1][0]:\n#first point is in the same row as the second\n if districts[2][1] == districts[0][1]:\n #third point is in the same column as first point\n ans = [districts[2][0], districts[1][1]]\n else:\n ans = [districts[2][0], districts[0][1]]\nelse:\n if districts[0][1] == districts[1][1]:\n ans = [districts[0][0], districts[2][1]]\n else:\n ans = [districts[0][0], districts[1][1]]\n \nprint(*ans)\n \t \t\t\t\t\t\t\t\t \t \t \t \t \t\t\t", "a, b = map(int, input().split())\r\nmlist = []\r\nfor i in range(a):\r\n\tstr = input()\r\n\tmlist.append([n for n in str])\r\nmlist2 = [[] for x in range(b)]\r\n\r\nfor i in range(a):\r\n\tfor j in range(b):\r\n\t\tmlist2[j].append(mlist[i][j])\r\n\t\r\n\r\nf1 = 0\r\nf2 = 0\r\n\r\nfor i in range(a):\r\n\tc = 0\r\n\tfor j in range(len(mlist[i])):\r\n\t\tif mlist[i][j] == '*':\r\n\t\t\tc += 1\r\n\tif c == 1:\r\n\t\tf1 = i\r\n\r\nfor i in range(b):\r\n\td = 0\r\n\tfor j in range(a):\r\n\t\tif mlist2[i][j] == '*':\r\n\t\t\td += 1\r\n\tif d == 1:\r\n\t\tf2 = i\r\n\t\t\r\nprint(f1+1, f2+1)\r\n\t\r\n\r\n\r\n\r\n", "arr = [int(n) for n in input().split(\" \")]\r\nn, m = arr[0], arr[1]\r\n\r\ngrid = []\r\n\r\nfor i in range(n):\r\n\tgrid.append(\r\n\t\t\tinput()\r\n\t\t)\r\n\r\nline = 0\r\nfor i in range(n):\r\n\tif '*' in grid[i] and grid[i].count('*') == 1:\r\n\t\tline = i\r\n\r\nfor j in range(m):\r\n\tcount = 0\r\n\tfor i in range(n):\r\n\t\tif grid[i][j] == '*':\r\n\t\t\tcount += 1\r\n\r\n\tif count == 1:\r\n\t\tcolumn = j\r\n\r\nprint(line + 1, column + 1)\r\n\r\n", "n,m = map(int,input().split())\r\nlst = []\r\nfor i in range(n):\r\n col = list(input())\r\n for j in range(m):\r\n if col[j] == '*':\r\n lst.append(i)\r\n lst.append(j)\r\nif lst[0] != lst[2]:\r\n print(lst[0]+1, end=\" \")\r\nelse:\r\n print(lst[-2]+1, end=\" \")\r\nif lst[3] == lst[1]:\r\n print(lst[5]+1)\r\nelif lst[3] == lst[5]:\r\n print(lst[1]+1)\r\nelse:\r\n print(lst[3]+1)\r\n\r\n", "n, m = list(map(int, input().split()))\n\nmapa = []\nx = -1\nachou = 0\nyPossivel = set()\nfor i in range(0, n):\n\tlinha = list(input())\n\tmapa.append(linha)\n\tnDistritosRoubados = linha.count('*')\n\tif (nDistritosRoubados == 1):\n\t\tachou += 1\n\t\tx = i + 1\n\n\tif (nDistritosRoubados == 2):\n\t\tachou += 1\n\t\tfor j in range(0, m):\n\t\t\tif (linha[j] == '*'):\n\t\t\t\tyPossivel.add(j + 1)\n\n\tif (achou == 2):\n\t\tbreak\n\nfor y in yPossivel:\n\tif (mapa[x - 1][y - 1] != '*'):\n\t\tprint(x, y)\n", "n, m = [int(i) for i in input().split()]\n\nfinrow=''\nfincol=''\n\nfor i in range(n):\n\trobbed = [pos for pos, char in enumerate(input()) if char == '*']\n\tif len(robbed)>0:\n\t\tif len(robbed) == 1:\n\t\t\tfinrow=i\n\t\t\tif fincol: #double * first\n\t\t\t\tfincol.remove(robbed[0])\n\t\t\t\tfincol=fincol[0]\n\t\t\telse: #single * first\n\t\t\t\tfincol=robbed\n\t\telse:\n\t\t\tif fincol: #single * first\n\t\t\t\trobbed.remove(fincol[0])\n\t\t\t\tfincol=robbed[0]\n\t\t\telse: #double * first\n\t\t\t\tfincol=robbed\n\t\n\tif type(finrow) is int and type(fincol) is int:\n\t\tbreak\n\nprint(str(finrow+1) + \" \" + str(fincol+1))", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = []\r\ns = []\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if(a[i - 1][j - 1] == \"*\"):\r\n s.append([i, j])\r\nif(s[0][0] == s[1][0]):\r\n print(s[2][0], end=\" \")\r\nelif(s[1][0] == s[2][0]):\r\n print(s[0][0], end=\" \")\r\nelse:\r\n print(s[1][0], end=\" \")\r\nif(s[0][1] == s[1][1]):\r\n print(s[2][1], end=\" \")\r\nelif(s[1][1] == s[2][1]):\r\n print(s[0][1], end=\" \")\r\nelse:\r\n print(s[1][1], end=\" \")", "r,c=map(int,input().split())\r\nrow=0\r\ncol=[]\r\nfor i in range(r):\r\n a=input()\r\n count=0\r\n for j in range(c):\r\n if(a[j]=='*'):\r\n count+=1\r\n col.append(j+1)\r\n if(count==1):\r\n row=i+1\r\nfor i in range(1,c+1):\r\n if(col.count(i)==1):\r\n print(row,i)", "# Matheus de Souza Oliveira - RA: 203407\n\nrowsAndColumns = list(map(int, input().split()))\nnumberOfRows = rowsAndColumns[0]\nnumberOfColumns = rowsAndColumns[1]\nmatrix = []\naux = numberOfRows\nrows = []\ncolumns = []\n\nwhile aux != 0:\n matrix.append([char for char in input()])\n aux -= 1\n\nfoundRowIndex = -1\n\nfor rowIndex in range(0, numberOfRows):\n for columnIndex in range(0, numberOfColumns):\n if matrix[rowIndex][columnIndex] == \"*\":\n rows.append(rowIndex)\n columns.append(columnIndex)\n\nnextCrimeRow = -1\nnextCrimeCollumn = -1\n\nfor row in rows:\n if rows.count(row) == 1:\n nextCrimeRow = row\n break\n\nfor column in columns:\n if columns.count(column) == 1:\n nextCrimeCollumn = column\n\nprint(nextCrimeRow+1, nextCrimeCollumn+1)\n\t \t \t \t\t \t \t\t \t \t \t \t", "n, m = (int(i) for i in input().split())\na = [[i for i in input()] for _ in range(n)]\nx, y = 0, 0\nfor r in range(n):\n for c in range(m):\n if a[r][c] == \"*\":\n x ^= r\n y ^= c\nres = (i + 1 for i in (x, y))\nprint(*res)\n", "def non_repeat(n):\n for i in range(len(n)):\n for j in range(len(n)):\n if(i!=j and int(n[i])==int(n[j])):\n break\n j += 1\n if(j==len(n)):\n return int(n[i])\n return -1\n\nm,n=input().split()\nm=int(m)\nn=int(n)\nmL=list()\nnL=list()\nfor i in range(1,m+1):\n str=input()\n for j in range(1,n+1):\n if str[j-1]=='*':\n mL.append(i)\n nL.append(j)\n\nx=non_repeat(mL)\ny=non_repeat(nL)\nprint(x,y)\n", "y,x = map(int, input().split())\r\nQ=[]\r\nhviezdy = {}\r\nhviezdx ={}\r\nfor i in range(y):\r\n s=input()\r\n #print(s)\r\n for j in range(len(s)):\r\n if s[j]==\"*\":\r\n if i+1 not in hviezdy:\r\n hviezdy[i+1]=1\r\n else:\r\n hviezdy[i+1]+=1\r\n if j+1 not in hviezdx:\r\n hviezdx[j+1]=1\r\n else:\r\n hviezdx[j+1]+=1\r\nANS = []\r\n#print(hviezdy, hviezdx)\r\nfor i in hviezdy:\r\n if hviezdy[i]==1:\r\n ANS.append(i)\r\n break\r\nfor i in hviezdx:\r\n if hviezdx[i]==1:\r\n ANS.append(i)\r\n break\r\nprint(*ANS)\r\n \r\n\r\n", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd\r\n'''\r\n\r\nN=list(map(int,input().split()))\r\nSetThis=[]\r\nLOCATION=[]\r\nO=0\r\nfor _ in range(N[0]):\r\n TMP=list(input())\r\n if(TMP.count(\"*\")>1):\r\n START=0\r\n for __ in range(2):\r\n SetThis.append(TMP.index(\"*\",START,len(TMP))+1)\r\n START=TMP.index(\"*\")+1\r\n if(TMP.count(\"*\")==1):\r\n LOCATION.append(_+1)\r\n O=TMP.index(\"*\")+1\r\nSetThis.remove(O)\r\nLOCATION.append(SetThis[0])\r\nprint(*LOCATION)", "(N, M) = [int(i) for i in input().split()]\n\nrow = -1\ncolumn = -1\ncolumns = []\nfor i in range(N):\n\tdistricts = input()\n\tfirst = districts.find('*')\n\tif first >= 0:\n\t\tcolumns.append(first+1)\n\t\tsecond = districts.rfind('*')\n\t\tif second < 0 or first == second:\n\t\t\trow = i+1\n\t\telse:\n\t\t\tcolumns.append(second+1)\n\ncolumns.sort()\nif columns[0] == columns[1]:\n\tcolumn = columns[2]\nelse:\n\tcolumn = columns[0]\n\nprint(f'{row} {column}')\n \t \t \t \t\t\t \t \t \t \t \t\t\t \t\t\t", "# http://codeforces.com/problemset/problem/181/A\r\nrow, col = [*map(int, input().split())]\r\n\r\nmap = []\r\nmissing_vertices = None\r\ncompleted_vertices = None\r\n\r\nfor map_piece in range(row):\r\n map_line = input()\r\n map.append(map_line)\r\n\r\n if '*' in map_line:\r\n if map_line.count('*') == 1:\r\n missing_vertices = map_piece\r\n else:\r\n completed_vertices = map_piece\r\n\r\nadj_col = ''\r\n# find adjacent col\r\nfor index, elem in enumerate(map[completed_vertices]):\r\n if elem == '*':\r\n adj_col += str(index) + \" \"\r\n\r\nadj_col = [int(i) for i in adj_col.split()]\r\n\r\n\r\n\r\nmissing_row = missing_vertices\r\nmissing_col = adj_col[0] if map[missing_row][adj_col[0]] != '*' else adj_col[1]\r\n\r\nprint(str(missing_row + 1) + \" \" + str(missing_col + 1))\r\n\r\n\r\n", "def lessFrequent(arr):\r\n\tarr = sorted(arr)\r\n\tl = arr.count(arr[0])\r\n\treturn arr[0] if l == 1 else arr[-1]\r\n \r\nn, m = map(int, input().split())\r\n \r\nxs = []\r\nys = []\r\n \r\nfor x in range(0, n):\r\n\trow = list(input())\r\n\tfor y in range(0, m):\r\n\t\tif row[y] == '*':\r\n\t\t\txs.append(x)\r\n\t\t\tys.append(y)\r\n \r\nprint(lessFrequent(xs) + 1, lessFrequent(ys) + 1)\r\n", "n,m=map(int,input().split()); l=[]\r\nfor i in range(n):\r\n\tl.append(input())\r\nfor i in range(len(l)):\r\n\tif l[i].count('*')==1:\r\n\t\tr=i\r\nfor i in range(n):\r\n\tif l[i].count('*')==2:\r\n\t\tfor j in range(m):\r\n\t\t\tif (l[i][j]=='*' and l[r][j]!='*'):\r\n\t\t\t\tc=j\r\nprint(r+1,c+1,sep=' ')", "n,m=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n lst.append(input())\r\nrw=[]\r\ncl=[]\r\nfor r in range(n):\r\n for c in range(m):\r\n if lst[r][c]==\"*\":\r\n rw.append(r+1)\r\n cl.append(c+1)\r\nfor i in range(len(rw)):\r\n if rw.count(rw[i])==1:\r\n p=rw[i]\r\n if cl.count(cl[i])==1:\r\n q=cl[i]\r\nprint(p,q)", "import sys\nimport time\n\ninput = sys.stdin.readline()\nrow, col = tuple(input.split(' '))\nnested_mat = []\nvertices = []\nst = time.time()\ncount = 1\nd_row = {}\nd_col = {}\nfor i in range(int(col)):\n d_col[i+1] = 0\nfor i in range(int(row)):\n rows = sys.stdin.readline().strip()\n inner_row = []\n already_found = False\n d_row[count] = 0\n for index, item in enumerate(rows):\n if item == \"*\":\n vertices.append([count, index+1])\n d_row[count]+=1\n d_col[index+1]+=1\n inner_row.append(item)\n count+=1\n nested_mat.append(inner_row)\nuncommon_row = -1\nuncommon_col = -1\nfor item, val in d_row.items():\n if val == 1:\n uncommon_row = item\nfor item, val in d_col.items():\n if val == 1:\n uncommon_col = item\nprint(uncommon_row, uncommon_col)\n \n \n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled0.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1T1Rhmb_iDQtLLUVxN1TTBfC-9hXKimd8\n\"\"\"\n\nn,m=[int(x) for x in input().split()]\nx,y=0,0\nfor i in range(n):\n c=input()\n for j in range(m):\n if(c[j]==\"*\"):\n x=x^i \n y=y^j\nprint(x+1,y+1)", "n,m=map(int,input().split())\r\nx=[]\r\nfor i in range(n):\r\n x.append(input())\r\nl=[]\r\nt=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(x[i][j]=='*'):\r\n l.append([i,j])\r\nif(l[0][0]==l[1][0]):\r\n t.append(l[2][0]+1)\r\nelif(l[2][0]==l[1][0]):\r\n t.append(l[0][0]+1)\r\nelif(l[0][0]==l[2][0]):\r\n t.append(l[1][0]+1)\r\nif(l[0][1]==l[1][1]):\r\n t.append(l[2][1]+1)\r\nelif(l[2][1]==l[1][1]):\r\n t.append(l[0][1]+1)\r\nelif(l[0][1]==l[2][1]):\r\n t.append(l[1][1]+1)\r\nprint(t[0],t[1])", "#import math\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=list(input())\r\n #print(s)\r\n k=s.count('*')\r\n c=0\r\n for _ in range(k):\r\n if '*' in s:\r\n j=s.index('*')\r\n l.append([i,j+c])\r\n s=s[:j]+s[j+1:]\r\n c=c+1\r\n#print(l)\r\nxl=[]\r\nyl=[]\r\nx=999\r\ny=999\r\nfor i,j in l:\r\n xl.append(i)\r\n yl.append(j)\r\nfor i in (xl):\r\n c=xl.count(i)\r\n if(c==1):\r\n x=i+1\r\n break\r\n\r\n#print('yl',yl)\r\nfor i in (yl):\r\n c=yl.count(i)\r\n if(c==1):\r\n y=i+1\r\n break\r\nprint(x,y)\r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n", "n, m = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n l = input()\r\n a.append(l)\r\nfor i in range(n):\r\n r = 0\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n r += 1\r\n if r == 1:\r\n print(i+1,end=\" \")\r\nfor i in range(m):\r\n c = 0\r\n for j in range(n):\r\n if a[j][i] == '*':\r\n c += 1\r\n if c == 1:\r\n print(i+1, end=\" \")\r\n", "n, m = map(int, input().split())\ns = []\nl = []\nb = []\nx, y=0, 0\nfor i in range(n):\n a = list(input())\n l.append(a)\n\nfor i in range(len(l)):\n for j in range(len(l[i])):\n if l[i][j] == \"*\":\n s.append((i+1))\n b.append(j+1)\nfor i in s:\n if s.count(i)!=2:\n x = i\nb.sort()\nfor i in b:\n if b.count(i)!=2:\n y = i\nprint(x,y)\n", "\r\na,g=map(int,input().split())\r\nk=[]\r\nfor x in range(a):\r\n\tb=list(input())\r\n\tfor j in range(g):\r\n\t\tif b[j]=='*':\r\n\t\t\tk.append([x+1,j+1])\r\nif k[0][0]==k[1][0]:\r\n\tprint(k[2][0],end=' ')\r\nif k[0][0]==k[2][0]:\r\n\tprint(k[1][0],end=' ')\r\nif k[1][0]==k[2][0]:\r\n\tprint(k[0][0],end=' ')\r\nif k[0][1]==k[1][1]:\r\n\tprint(k[2][1])\r\nif k[0][1]==k[2][1]:\r\n\tprint(k[1][1])\r\nif k[1][1]==k[2][1]:\r\n\tprint(k[0][1])", "n, m = list(map(int, input().split()))\r\n\r\nvalues_2 = []\r\nvalues_1 = []\r\ndatas = []\r\ncolumns1 = []\r\n\r\nfor i in range(n):\r\n data = input()\r\n datas.append(data)\r\nfor i in datas:\r\n if i.count(\"*\") == 2:\r\n row = datas.index(i)\r\n columns = [j for j, i1 in enumerate(i) if i1 == \"*\"]\r\n columns1 = columns\r\n value1 = [row, columns[0]]\r\n value2 = [row, columns[1]]\r\n values_2.append(value1)\r\n values_2.append(value2)\r\n\r\nfor i in datas:\r\n if i.count(\"*\") == 1:\r\n row = datas.index(i)\r\n column = i.index(\"*\")\r\n values_1.append([row, column])\r\n values_1.append([row, None])\r\nfor i in values_1:\r\n if i[1] in columns1:\r\n index_ = columns1.index(i[1])\r\n values_2.pop(index_)\r\n values_1.remove(i)\r\nfor i, i1 in zip(values_1, values_2):\r\n i[1] = i1[1]\r\nrow, column = values_1[0]\r\nprint(row + 1, column + 1)\r\n", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nb=0\r\nc=0\r\nx=set()\r\ny=set()\r\nfor i in range(n):\r\n a=input()\r\n b=a.find(\"*\")\r\n c=a.rfind(\"*\")\r\n if b!=-1:\r\n if b==c:\r\n if i in x:\r\n x-=set([i])\r\n else:\r\n x.add(i)\r\n if b in y:\r\n y-=set([b])\r\n else:\r\n y.add(b)\r\n else:\r\n if b in y:\r\n y-=set([b])\r\n else:\r\n y.add(b)\r\n if c in y:\r\n y-=set([c])\r\n else:\r\n y.add(c)\r\nprint(str(list(x)[0]+1)+\" \"+str(list(y)[0]+1))\r\n", "n,m = map(int,input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(input())\r\n\r\n\r\npos1,pos2 = 0,0\r\n\r\nfor i in matrix:\r\n if i.count('*') == 2:\r\n pos1 = i.find('*')\r\n pos2 = i.find('*',pos1+1)\r\n break\r\n\r\nfor i in range(len(matrix)):\r\n if matrix[i].count('*') == 1:\r\n p1 = matrix[i].find('*')\r\n if p1 == pos1:\r\n print(i+1,pos2+1)\r\n else:\r\n print(i+1,pos1+1)\r\n break\r\n", "n,m=map(int,input().split())\nL=[]\nfor i in range(n):\n L.append(input())\nsolL=[[],[]]\nfor i in range(n):\n for j in range(m):\n if L[i][j]==\"*\":\n solL[0].append(i)\n solL[1].append(j)\n\nif solL[0][0]==solL[0][1]:\n solx=solL[0][2]\nelif solL[0][0]==solL[0][2]:\n solx=solL[0][1]\nelse:\n solx=solL[0][0]\n \nif solL[1][0]==solL[1][1]:\n soly=solL[1][2]\nelif solL[1][0]==solL[1][2]:\n soly=solL[1][1]\nelse:\n soly=solL[1][0] \n \n \n\n \nprint(solx+1,soly+1)\n\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\ngrid = []\r\nfor i in range(n):\r\n s = list(input())\r\n grid.append(s)\r\n\r\nrow, column = 0, 0\r\nfor i in range(len(grid)):\r\n cnt = 0\r\n for j in range(len(grid[i])):\r\n if grid[i][j] == '*':\r\n cnt += 1\r\n if cnt == 1:\r\n row = i + 1\r\n break\r\n\r\nfor i in range(len(grid[0])):\r\n another = 0\r\n for j in range(len(grid)):\r\n if grid[j][i] == '*':\r\n another += 1\r\n if another == 1:\r\n column = i + 1\r\n break\r\n\r\nprint(row, column)", "n, m = map(int, input().split())\r\na = list()\r\nfor i in range(n):\r\n s = input()\r\n if '*' in s:\r\n a.append((i + 1, s.find('*') + 1))\r\n if s.count('*') > 1:\r\n a.append((i + 1, (s[s.find('*')+1:].find('*') + s.find('*') + 2)))\r\nx = sorted([a[i][0] for i in range(3)])\r\ny = sorted([a[i][1] for i in range(3)])\r\nif x[0] != x[1]:\r\n print(x[0], end=\" \")\r\nelse:\r\n print(x[2], end=\" \")\r\nif y[0] != y[1]:\r\n print(y[0], end=\" \")\r\nelse:\r\n print(y[2], end=\" \")", "n, m=[int(i) for i in input().split()]\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n s=input()\r\n z=[]\r\n for j in s:\r\n z.append(j)\r\n a.append(z) \r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='*':\r\n b.append([i, j])\r\nx,y=0,0\r\nif b[0][0]==b[1][0]:\r\n x=b[2][0]\r\nelif b[0][0]==b[2][0]:\r\n x=b[1][0]\r\nelif b[1][0]==b[2][0]:\r\n x=b[0][0]\r\nif b[0][1]==b[1][1]:\r\n y=b[2][1]\r\nelif b[0][1]==b[2][1]:\r\n y=b[1][1]\r\nelif b[1][1]==b[2][1]:\r\n y=b[0][1]\r\nprint(x+1, y+1)", "n, m = map(int, input().split()); ind1 = []; ind2 = []\r\nfor i in range(n):\r\n s = input(); cnt = s.count('*')\r\n if cnt == 1:\r\n for j in range(m):\r\n if s[j] == '*': ind1 += [(i + 1, j + 1)]\r\n elif cnt == 2:\r\n for j in range(m):\r\n if s[j] == '*': ind2 += [(i + 1, j + 1)]\r\nif ind2[0][1] == ind1[0][1]: print(ind1[0][0], ind2[1][1])\r\nelse: print(ind1[0][0], ind2[0][1])", "n, m = map(int, input().split())\n\nmatrizona = []\nfor i in range(0,n):\n lista = input()\n matrizona.append(list(lista))\n\n\npoints = []\nfor i in range(0,n):\n for j in range(0,m):\n if(matrizona[i][j] == '*'):\n points.append((i+1,j+1))\n\na = points[0]\nb = points[1]\nc = points[2]\n# print(a, b, c)\n\nif(a[0] == b [0]):\n dmax = (c[0], max(a[1], b[1]))\n dmin = (c[0],min(a[1],b[1]))\n # print(dmax, dmin)\n d = dmin if dmax == c else dmax\n\nelse:\n dmax= (a[0], max(b[1],c[1]))\n dmin = (a[0], min(b[1], c[1]))\n d = dmin if dmax == a else dmax\n\nprint(d[0], d[1])\n \t\t \t\t\t\t \t\t\t \t \t \t\t \t\t \t", "p = lambda: list(map(int, input().split()))\r\n\r\nN, M = p()\r\ngrid = [input() for _ in range(N)]\r\n\r\nX, Y = [], []\r\nfor i in range(N):\r\n\tfor j in range(M):\r\n\t\tif grid[i][j] == '*':\r\n\t\t\tX.append(i)\r\n\t\t\tY.append(j)\r\n\r\nfor x in X:\r\n\tif X.count(x) == 1:\r\n\t\tprint(x+1, end=' ')\r\n\r\nfor y in Y:\r\n\tif Y.count(y) == 1:\r\n\t\tprint(y+1, end=' ')\r\n\r\nprint()", "n,m=map(int,input().split())\n\nk=0;b=[]\nfor i in range(n):\n s=input()\n for j in range(m):\n if s[j]=='*':\n b.append((i+1,j+1))\n k+=1\n\nx1,y1=b[0][0],b[0][1]\nx2,y2=b[1][0],b[1][1]\nx3,y3=b[2][0],b[2][1]\n\n\nif x1==x2:\n x4=x3\n\n if y3==y1:\n y4=y2\n elif y3==y2:\n y4=y1\n \nelif x1==x3:\n x4=x2\n\n if y2==y1:\n y4=y3\n elif y2==y3:\n y4=y1\n \nelif x2==x3:\n x4=x1\n\n if y1==y2:\n y4=y3\n elif y1==y3:\n y4=y2\nprint(x4,y4)\n", "n, m = map(int, input().split())\r\nl = []\r\nk = []\r\nfor i in range(n):\r\n s = input()\r\n if s.count('*') == 2:\r\n for j in range(m):\r\n if s[j] == '*':\r\n l.append(j)\r\n elif s.count('*') == 1:\r\n k.append(s.index('*'))\r\n k.append(i)\r\n \r\nif k[0] == l[0]:\r\n print(k[1]+1, l[1]+1)\r\nelse:\r\n print(k[1]+1, l[0]+1)\r\n \r\n \r\n \r\n \r\n", "# cf 181 A 800\nn, m = map(int, input().split())\n\nC = [0] * m\nx = -1\n\nfor i in range(n):\n s = input()\n if s.count('*') == 1:\n x = i + 1\n for j, c in enumerate(s):\n if c == '*':\n C[j] += 1\n\ny = -1\nfor j in range(m):\n if C[j] == 1:\n y = j + 1\n\nprint(x, y)\n", "a,b=map(int,input().split());x=[];d=[];cnt1=0;cnt2=0;r=0;c=0;k=0\r\nfor i in range(a) :\r\n d=list(input())\r\n x.append(d)\r\nfor i in range(a) :\r\n cnt1=0;cnt2=0\r\n for j in range(b) :\r\n if x[i][j]==\"*\":\r\n cnt1+=1\r\n elif x[i][j]==\".\":\r\n cnt2+=1\r\n if cnt1==1 and cnt2>=1:\r\n r=i;k=1;break\r\n else:\r\n continue\r\nfor i in range(b) :\r\n cnt1=0;cnt2=0\r\n for j in range(a) :\r\n if x[j][i]==\"*\" :\r\n cnt1+=1\r\n elif x[j][i]==\".\" :\r\n cnt2+=1\r\n if cnt1==1 and cnt2>=1 :\r\n c=i;break\r\n else :\r\n continue\r\nprint(r+1,c+1)\r\n\r\n", "from collections import Counter\r\n\r\nn, m = map(int, input().split())\r\n\r\nrows = Counter()\r\ncols = Counter()\r\n\r\nfor i in range(n):\r\n row = input()\r\n for j in range(m):\r\n if row[j] == '*':\r\n cols[j] += 1\r\n rows[i] += 1\r\n\r\nprint(\"{} {}\".format(1 + rows.most_common()[-1][0],\r\n 1 + cols.most_common()[-1][0]))", "rows, cols = list(map(int, input().split()))\nx, y = {}, {}\nfor i in range(rows):\n inp = input()\n for j in range(cols):\n if inp[j] == '*':\n x[i] = x.get(i, 0) + 1\n if x[i] == 2:\n x.pop(i)\n y[j] = y.get(j, 0) + 1\n if y[j] == 2:\n y.pop(j)\n\nfor x_cord in x:\n print(x_cord + 1, end=' ')\nfor y_cord in y:\n print(y_cord + 1)", "n,m = map(int,input().split())\r\na = []\r\nnn = \"����\"\r\nmm = \"����\"\r\nfor i in range(n):\r\n b = list(input())\r\n a.append(b)\r\n if b.count(\"*\") == 1:\r\n nn = i\r\nc = 0\r\nfor j in range(m):\r\n for i in range(n):\r\n if a[i][j] == \"*\":\r\n c = c + 1\r\n if c == 1:\r\n mm = j\r\n c = 0\r\nprint(nn+1, mm+1)", "n, m = map(int, input().split())\r\na = []\r\ns = []\r\nfor x in range(n):\r\n a.append(input())\r\nfor x in range(n):\r\n for y in range(m):\r\n if a[x][y] == \"*\":\r\n s.append([x + 1, y + 1])\r\nif s[0][0] != s[1][0] and s[0][0] != s[2][0]:\r\n r1 = s[0][0]\r\nelif s[1][0] != s[0][0] and s[1][0] != s[2][0]:\r\n r1 = s[1][0]\r\nelse:\r\n r1 = s[2][0]\r\n\r\nif s[0][1] != s[1][1] and s[0][1] != s[2][1]:\r\n r2 = s[0][1]\r\nelif s[1][1] != s[0][1] and s[1][1] != s[2][1]:\r\n r2 = s[1][1]\r\nelse:\r\n r2 = s[2][1]\r\nprint(r1, r2)", "n,m=map(int,input().split())\na=[]\nfor i in range(n):\n a.append(input())\n\nr,s=0,0\n\nfor i in range(n):\n if a[i].count('*')==1:\n r=i+1\n break\n\nfor i in range(m):\n br=0\n for j in range(n):\n if a[j][i]=='*':\n br+=1\n if br==1:\n s=i+1\n break\n\nprint(r,s)\n\n \t \t \t\t \t\t\t\t \t\t \t\t\t\t", "n,m=(map(int, input().split()))\r\n\r\nl=[]\r\nfor i in range(n):\r\n k=(input())\r\n l.append(k)\r\n\r\nr=[] \r\ns=[]\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == \"*\":\r\n r.append(i+1)\r\n s.append(j+1)\r\n \r\nfor i in r:\r\n if r.count(i)==1:\r\n print(i,end=\" \")\r\n \r\nfor j in s:\r\n if s.count(j)==1:\r\n print(j)", "n,m=[int(i) for i in input().split()]\r\nr=[]\r\nc=[]\r\nfor j in range(n):\r\n s=input()\r\n for k in range(m):\r\n if s[k]==\"*\":\r\n r.append(j+1)\r\n c.append(k+1)\r\nr.sort()\r\nc.sort()\r\nr1=c1=0\r\nif r.count(r[0])==1:\r\n r1=r[0]\r\nelse :\r\n r1=r[-1]\r\nif c.count(c[0])==1:\r\n c1=c[0]\r\nelse :\r\n c1=c[-1]\r\nprint(r1,c1)", "n, m = map(int, input().split())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == \"*\":\r\n x.append(i)\r\n y.append(j)\r\nx = sorted(x)\r\ny = sorted(y)\r\nif x[0]==x[1]:\r\n x1 = x[2]\r\nelse:\r\n x1 = x[0]\r\nif y[0]==y[1]:\r\n y1 = y[2]\r\nelse:\r\n y1 = y[0]\r\nprint(x1+1, y1+1)", "'''input\r\n3 3\r\n*.*\r\n*..\r\n...\r\n\r\n\r\n'''\r\n\r\ns = input()\r\ns = s.split()\r\nn = int(s[0])\r\nm = int(s[1])\r\n\r\nmat = []\r\nfor _ in range(n):\r\n\ttemp = []\r\n\tst = input()\r\n\tfor l in st:\r\n\t\ttemp.append(l)\r\n\tmat.append(temp)\r\n\r\n\r\nr,c = 0,0\r\n\r\nfor i in range(n):\r\n\trow_stars = 0\r\n\tfor j in range(m):\r\n\t\tif mat[i][j] == '*':\r\n\t\t\trow_stars += 1\r\n\tif row_stars % 2 != 0:\r\n\t\tr = i\r\n\t\tbreak\r\n\r\nfor j in range(m):\r\n\tcol_stars = 0\r\n\tfor i in range(n):\r\n\t\tif mat[i][j] == '*':\r\n\t\t\tcol_stars += 1\r\n\tif col_stars % 2 != 0:\r\n\t\tc = j\r\n\t\tbreak\r\n\r\nprint(r+1, c+1)\r\n\r\n\t\t", "n,m=map(int,input().split())\na=[input() for i in range(n)]\nfor i in a:\n k=a.index(i)+1\n if i.count(\"*\")==2:\n l1=i.find(\"*\")\n p1=l1+1\n p2=i.find(\"*\",l1+1)+1\n else:\n if i.find(\"*\")!=-1:\n p3=i.find(\"*\")+1\n t1=k\nif p1!=p2 and p1==p3:\n t2=p2\nelif p2!=p1 and p2==p3:\n t2=p1\nelse:\n t2=p1 \nprint(t1,t2)\n", "r=int(input().split()[0])\r\nx,y=[0]*100,[0]*100\r\nfor i in range(r):\r\n a=input()\r\n for j,v in enumerate(a):\r\n if v=='*': x[j]+=1;y[i]+=1\r\nprint(y.index(1)+1,x.index(1)+1)", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 31/08/2020\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\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, m = iia()\r\narr = []\r\nfor i in range(n):\r\n cur = is1()\r\n for j in range(m):\r\n if cur[j] == '*':\r\n arr.append([i, j])\r\n\r\nrow, col = {}, {}\r\nfor i in range(len(arr)):\r\n row.setdefault(arr[i][0], []).append(arr[i][1])\r\n col.setdefault(arr[i][1], []).append(arr[i][0])\r\nfor i in row:\r\n if len(row[i]) == 1:\r\n r = i + 1\r\n break\r\nfor j in col:\r\n if len(col[j]) == 1:\r\n c = j + 1\r\n break\r\nprint(r, c)\r\n\r\n", "data = input()\n[n, m] = data.split(\" \")\nn = int(n)\nm = int(m)\nrobData = []\nfor i in range(n):\n temp = input()\n robData.append(list(temp))\n\nxArr = []\nyArr = []\n\nfor i in range(n):\n for j in range(m):\n if robData[i][j] == '*':\n xArr.append(i+1)\n yArr.append(j+1)\nx = 0\ny = 0\nfor i in range(3):\n if xArr.count(xArr[i]) == 1:\n x = xArr[i]\n\n\nfor i in range(3):\n if yArr.count(yArr[i]) == 1:\n y = yArr[i]\n\nprint(x, y)\n", "def main():\r\n n, m = [int(i) for i in input().split()]\r\n y = {}\r\n x = {}\r\n for i in range(n):\r\n a = input()\r\n for j in range(m):\r\n if a[j] == '*':\r\n if j in x.keys():\r\n x[j] += 1\r\n else:\r\n x[j] = 1\r\n if i in y.keys():\r\n y[i] += 1\r\n else:\r\n y[i] = 1\r\n\r\n _x = 0\r\n for i, c in x.items():\r\n if c == 1:\r\n _x = i + 1\r\n break\r\n _y = 0\r\n for i, c in y.items():\r\n if c == 1:\r\n _y = i + 1\r\n break\r\n\r\n print(_y, _x)\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\ns = [input() for i in range(n)]\r\n\r\nx = 0\r\ny = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == \"*\":\r\n x ^= (i+1)\r\n y ^= (j+1)\r\n\r\nprint(x, y)", "'''\r\n\r\n Online Python Debugger.\r\n Code, Run and Debug Python program online.\r\nWrite your code in this editor and press \"Debug\" button to debug program.\r\n\r\n'''\r\n\r\narr = input()\r\narr1 = arr.split()\r\nn = arr1[0]\r\nm = arr1[1]\r\n\r\nst = []\r\n\r\ndictsx = {}\r\ndictsy = {}\r\nn = int(n)\r\nfor i in range(n):\r\n tt = input()\r\n t1 = tt.split()\r\n y = 0\r\n #print(t1)\r\n for t in tt:\r\n if t ==\"*\":\r\n if i not in dictsx:\r\n dictsx[i] = 1 \r\n else:\r\n dictsx[i] += 1 \r\n if y not in dictsy:\r\n dictsy[y] = 1\r\n else:\r\n dictsy[y] += 1 \r\n \r\n y += 1\r\n\r\nfinalx = 0\r\nfinaly = 0\r\n#print(dictsx)\r\n#print(dictsy)\r\nfor key,value in dictsx.items():\r\n if value == 1:\r\n finalx = key + 1 \r\n \r\nfor key,value in dictsy.items():\r\n if value == 1:\r\n finaly = key + 1 \r\n\r\nkk = str(finalx) + \" \" + str(finaly)\r\nprint(kk)", "n , m = map (int,input().split())\r\nrowSet = [0] * 101\r\ncolumnSet = [0] * 101\r\nfor i in range(n):\r\n row = input()\r\n for j in range(m):\r\n if row[j] == '*':\r\n rowSet[i+1] += 1\r\n columnSet[j+1] += 1\r\n\r\nrowIndex, columnIndex = None, None\r\nfor i in range(1,101):\r\n if rowSet[i] == 1:\r\n rowIndex = i\r\n if columnSet[i] == 1:\r\n columnIndex = i\r\n\r\nprint(rowIndex, columnIndex, sep = \" \")", "n, m = map(int, input().split())\r\ny = 1\r\nfor i in range(1, n+1):\r\n s = input()\r\n if (k := s.count('*')) == 2:\r\n y += s.find('*') + s.rfind('*')\r\n elif k == 1:\r\n y -= s.find('*')\r\n x = i\r\nprint(x, y)\r\n ", "n, m = map(int, input().split())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(input())\r\n\r\n\r\nfor r in range(n):\r\n row = grid[r]\r\n if row.count('*') == 1:\r\n r1 = r + 1\r\n \r\nfor c in range(m):\r\n cnt = 0 \r\n for r in range(n):\r\n if grid[r][c] == '*':\r\n cnt += 1\r\n if cnt == 1:\r\n c1 = c + 1\r\n break\r\n\r\nprint(r1, c1)", "n, m=[int(k) for k in input().split()]\r\nw=[]\r\nfor j in range(n):\r\n s=input()\r\n for l in range(m):\r\n if s[l]==\"*\":\r\n w.append([j, l])\r\nq, c={}, {}\r\nfor j in w:\r\n if j[0] in q:\r\n q[j[0]]+=1\r\n else:\r\n q[j[0]]=1\r\n if j[1] in c:\r\n c[j[1]]+=1\r\n else:\r\n c[j[1]]=1\r\neta=[]\r\nfor j in q.keys():\r\n if q[j]==1:\r\n eta.append(j+1)\r\nfor j in c.keys():\r\n if c[j]==1:\r\n eta.append(j+1)\r\nprint(\" \".join([str(k) for k in eta]))", "L, C = map(int, input().split())\n\nM = [ input() for x in range(L) ]\n\nxset=set()\nyset=set()\nP=[]\n\nfor y in range(L):\n\tfor x in range(C):\n\n\t\tif M[y][x] == '*':\n\t\t\txset.add(x+1)\n\t\t\tyset.add(y+1)\n\t\t\tP.append((x+1,y+1))\n\nxset=list(xset)\nyset=list(yset)\n\np1=(xset[0],yset[0])\np2=(xset[0],yset[1])\np3=(xset[1],yset[0])\np4=(xset[1],yset[1])\n\nif p1 not in P:\n\tprint(p1[1],p1[0])\n\texit(0)\n\nif p2 not in P:\n\tprint(p2[1],p2[0])\n\texit(0)\n\nif p3 not in P:\n\tprint(p3[1],p3[0])\n\texit(0)\n\nif p4 not in P:\n\tprint(p4[1],p4[0])\n\texit(0)\t\n\n\n\n\n\n \t \t\t\t\t \t \t\t \t\t \t \t", "def uniq(lst):\r\n if lst[0]==lst[1]:\r\n return lst[2]\r\n elif lst[0]==lst[2]:\r\n return lst[1]\r\n else:\r\n return lst[0]\r\na,b=list(map(int,input().split()))\r\nlst=[];lst2=[];lst3=[];lst4=[]\r\nfor i in range(a):\r\n n=input()\r\n for j in range(b):\r\n if n[j]=='*':\r\n lst2.append([i+1,j+1])\r\n lst3.append(i+1)\r\n lst4.append(j+1)\r\nprint(uniq(lst3),uniq(lst4))\r\n", "# Problem: A. Series of Crimes\r\n# Contest: Codeforces - Croc Champ 2012 - Round 2 (Unofficial Div. 2 Edition)\r\n# URL: https://codeforces.com/problemset/problem/181/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\nfrom collections import Counter\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tif \"*\" in s:\r\n\t\ta=i\r\n\t\tb=s.index(\"*\")\r\n\t\tl2=[a,b]\r\n\t\tif l2 not in l:\r\n\t\t\tl.append(l2)\r\n\t\tb1=s.rindex(\"*\")\r\n\t\tl2=[a,b1]\r\n\t\tif l2 not in l:\r\n\t\t\tl.append(l2)\r\n\r\nl1=[]\r\nl2=[]\r\nfor i in l:\r\n\tl1.append(n-i[0])\r\n\tl2.append(i[1]+1)\r\nx=y=0\r\nfor i in l1:\r\n\tif l1.count(i)==1:\r\n\t\ty=i\r\nfor i in l2:\r\n\tif l2.count(i)==1:\r\n\t\tx=i\r\nprint(n-y+1,x)", "p,q = input().split() #Map of the city\r\nM = []\r\nfor i in range(int(p)):\r\n\tL = list(map(str,input()))\r\n\tM.append(L)\r\nCoordinates = []\r\nfor i in range(int(p)):\r\n\tfor j in range(int(q)):\r\n\t\tif M[i][j] == '*':\r\n\t\t\tCoordinates.append([i,j])\r\n\r\nL = [Coordinates[m][0] for m in range(3)]\r\nM = [Coordinates[n][1] for n in range(3)]\r\nfor i in L:\r\n\tif L.count(i)==1:\r\n\t\tprint(i+1,end=' ')\r\n\t\tbreak\r\nfor j in M:\r\n\tif M.count(j)==1:\r\n\t\tprint(j+1,end=' ')\r\n\t\tbreak\r\n", "import sys, math, itertools, functools, collections\r\nfrom collections import Counter\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nMIN = 10 ** 18\r\nMAX = -10 ** 18\r\n\r\n\r\ndef int_j():\r\n return int(input())\r\n\r\n\r\ndef int_m():\r\n return map(int, input().split())\r\n\r\n\r\ndef list_m():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef occurred_once(arr):\r\n mp = Counter(arr)\r\n for it in mp:\r\n if mp[it] == 1:\r\n return it\r\n\r\n\r\nn, m = int_m()\r\n\r\na = [0] * n\r\nq = [0] * 3\r\ncount = 0\r\nfor i in range(n):\r\n a[i] = [_ for _ in input()]\r\n for j in range(len(a[i])):\r\n if a[i][j] == '*':\r\n q[count] = [i, j]\r\n count += 1\r\nxx = [0] * 3\r\nyy = [0] * 3\r\nfor i in range(3):\r\n xx[i] = q[i][0]\r\n yy[i] = q[i][1]\r\n\r\nprint(occurred_once(xx)+1, occurred_once(yy)+1)", "string = input()\r\nl = string.split()\r\nn = int(l[0])\r\nm = int(l[1])\r\n\r\n#print(n,m)\r\nrow = 0\r\ncol =0\r\n\r\narr = []\r\n\r\nfor i in range(n) :\r\n str2 = input()\r\n arr.append(str2)\r\n c = str2.count('*')\r\n if c==1 :\r\n row = i \r\n \r\nfor i in range(n) :\r\n c = arr[i].count('*') \r\n if c==2 :\r\n t1 = arr[row]\r\n t2 = arr[i]\r\n # print(t1[1],t2[1])\r\n for j in range(0,m) :\r\n if t2[j]=='*' and t1[j]=='.' :\r\n col = j\r\n \r\n \r\nprint(row+1,col+1)\r\n ", "n, m = map(int, input().split())\r\nx = []\r\ny = []\r\nz = []\r\nfor i in range(n):\r\n l = list(input())\r\n x.append(l)\r\nfor j in range(n):\r\n if x[j].count('*') == 1:\r\n print(j + 1,end=\" \")\r\n f = x[j].index('*') + 1\r\n z.append(f)\r\n elif x[j].count(\"*\") == 2:\r\n for k in range(len(x[j])):\r\n if x[j][k] == \"*\":\r\n y.append(k+1)\r\nfor m in y:\r\n for n in z:\r\n if m == n:\r\n break\r\n else:\r\n print(m)\r\n", "X = list(map(int,input().split()))\r\nDirect = list()\r\nCol1= int\r\nCol = list ()\r\nfor i in range(X[0]):\r\n Input = input()\r\n if Input.count('*') == 1:\r\n Direct.append(i+1)\r\n Col1 = (Input.index('*')+1)\r\n elif Input.count('*')==2:\r\n FirstIndex = Input.index('*')+1\r\n Col.append(FirstIndex)\r\n Col.append(Input[FirstIndex:].index('*')+1+FirstIndex)\r\nDirect.append(Col[0] if Col[0] != Col1 else Col[1])\r\nprint(*Direct,sep=\" \")", "import sys\r\n\r\nn, m = (int(el) for el in input().split())\r\n\r\nc = []\r\nfor i in range(n):\r\n a = input()\r\n for j in range(m):\r\n if a[j] == '*':\r\n c.append((i, j))\r\n\r\nc.sort()\r\nif c[0][0] == c[1][0]:\r\n if c[2][1] == c[0][1]:\r\n print(c[2][0] + 1, c[1][1] + 1)\r\n sys.exit()\r\n elif c[2][1] == c[1][1]:\r\n print(c[2][0] + 1, c[0][1] + 1)\r\n sys.exit()\r\n \r\nif c[1][0] == c[2][0]:\r\n if c[0][1] == c[1][1]:\r\n print(c[0][0] + 1, c[2][1] + 1)\r\n sys.exit()\r\n elif c[0][1] == c[2][1]:\r\n print(c[0][0] + 1, c[1][1] + 1)\r\n sys.exit()\r\n\r\n\r\n", "n,m=map(int,input().split())\n\np=[]\ny=[0,0]\nX=0\nY=0\nr=[0,0]\nfor i in range(n):\n s=input()\n c=0\n for j in range(m):\n if(s[j]=='*'):\n r[c]=j+1\n c+=1\n if(c==1):\n X=i+1\n Y=r[0]\n elif(c==2):\n y[0]=r[0]\n y[1]=r[1]\nif(Y==y[0]):\n Y=y[1]\nelse:\n Y=y[0]\nprint(X,Y)\n", "from collections import Counter\r\n\r\nn,m = map(int, input().split())\r\nlst = []\r\nfor x in range(0, n):\r\n k = str(input())\r\n lst.append(list(k))\r\nindex1 = []\r\nindex2 = []\r\nfor x in range(0,n):\r\n for y in range(0,m):\r\n if lst[x][y] == '*':\r\n index1.append(x+1)\r\n index2.append(y+1)\r\nans = ''\r\ndict1 = dict(Counter(index1))\r\ndict2 = dict(Counter(index2))\r\nfor x,y in dict1.items():\r\n if y == 1:\r\n ans = ans + str(x) + ' '\r\nfor x,y in dict2.items():\r\n if y == 1:\r\n ans = ans + str(x)\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\ta=list(input())\r\n\tl.append(a)\r\nl1=[]\r\nl2=[]\r\nfor i in range(len(l)):\r\n\tfor j in range(m):\r\n\t\tif l[i][j] == \"*\":\r\n\t\t\tl1.append(i+1)\r\n\t\t\tl2.append(j+1)\r\ns=set(l1)\r\ns1=set(l2)\r\na=[]\r\nb=[]\r\nfor i in s:\r\n\ta.append((i,l1.count(i)))\r\nfor i in s1:\r\n\tb.append((i,l2.count(i)))\r\nfor i in range(1):\r\n\tif a[i][1] > a[i+1][1]:\r\n\t\tprint(a[i+1][0],end=' ')\r\n\telse:\r\n\t\tprint(a[i][0],end=' ')\r\n\tif b[i][1] > b[i+1][1]:\r\n\t\tprint(b[i+1][0],end=' ')\r\n\telse:\r\n\t\tprint(b[i][0],end=' ')\r\n", "n, m = list(map(int, input().split()))\naux = []\np1 = []\np2 = []\n\nfor i in range(n):\n s = input()\n x = s.count(\"*\")\n if x == 1:\n aux.append(i+1)\n aux.append(s.find(\"*\")+1)\n elif x == 2:\n p1.append(i+1)\n p2.append(i+1)\n p1.append(s.find(\"*\")+1)\n p2.append(s.rfind(\"*\")+1)\n\nprint(aux[0], p1[1] if p1[1] != aux[1] else p2[1])\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\nx1 = 10**9\r\ny1 = 10**9\r\nx2 = 0\r\ny2 = 0\r\nxsum = 0\r\nysum = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == \"*\":\r\n x2 = max(x2,i)\r\n y2 = max(y2,j)\r\n x1 = min(x1,i)\r\n y1 = min(y1,j)\r\n ysum += j\r\n xsum += i\r\nx = (x2+x1)*2 - xsum\r\ny = (y2+y1)*2 - ysum\r\nprint(x + 1,y + 1)\r\n", "def solution(n, m, districts):\r\n x, y = (0, 0)\r\n\r\n for i in range(n):\r\n count = 0\r\n for j in range(m):\r\n if districts[i][j] == '*':\r\n count += 1\r\n\r\n if x == 0:\r\n y += (j + 1)\r\n else:\r\n y -= (j + 1)\r\n\r\n if count == 1:\r\n x = i + 1\r\n elif count == 2:\r\n if x == 0: x = -1\r\n else: y = abs(y)\r\n\r\n return (\"%d %d\" % (x, y))\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\ndistricts = []\r\n\r\nfor i in range(n):\r\n tmp = [i for i in input()]\r\n districts.append(tmp)\r\n\r\nprint(solution(n, m, districts))\r\n", "def main():\r\n n, m = [int(i) for i in input().split()]\r\n x, y = 0, 0\r\n a = [input() for i in range(n)]\r\n for i in range(n):\r\n if a[i].count('*') == 1:\r\n x = i\r\n for j in range(m):\r\n k = 0\r\n for i in range(n):\r\n if a[i][j] == '*':\r\n k += 1\r\n if k == 1:\r\n y = j\r\n print(x + 1, y + 1)\r\nmain()\r\n", "n,m=map(int,input().split())\r\nk=[]\r\nfor i in range(n):\r\n k.append(input())\r\nrow=-1\r\nr1=-1\r\nc1=-1\r\nr2=-1\r\nc2=-1\r\nfor i in range(n):\r\n if r1==-1 and c1==-1:\r\n r1=k[i].find(\"*\")\r\n c1=k[i].rfind(\"*\")\r\n if r1==c1 and r1!=-1 and c1!=-1:\r\n row=i\r\n elif r2==-1 and c2==-1:\r\n r2=k[i].find(\"*\")\r\n c2=k[i].rfind(\"*\")\r\n if r2==c2 and r2!=-1 and c2!=-1:\r\n row=i\r\n else:\r\n break\r\nif r1==r2:\r\n if r1==c1:\r\n print(row+1,c2+1)\r\n if r2==c2:\r\n print(row+1,c1+1)\r\nelif c1==c2:\r\n if r1==c1:\r\n print(row+1,r2+1)\r\n if r2==c2:\r\n print(row+1,r1+1)\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\tcount=0\r\n\tz=[]\r\n\ta=list(input())\r\n\tfor j in range(m):\r\n\t\tif a[j]==\"*\":\r\n\t\t\tcount+=1\r\n\t\t\tt=j\r\n\t\t\tz.append(t)\r\n\tl.append(z)\t\r\n\tif count==1:\r\n\t\tr=i+1\r\n\t\tv=t\r\n\tif len(l[i])==2:\r\n\t\tb=i\t\t\r\nif v==l[b][0]:\r\n\tc=l[b][1]+1\r\nelif v==l[b][1]:\r\n\tc=l[b][0]+1\r\nprint(r,c)", "r,c=map(int,input().split())\r\nt=[]\r\nfor i in range (r):\r\n\tt.append(list(map(str,input())))\r\n\r\nver=[]\r\nfor i in range(0,r):\r\n\tfor j in range (0,c):\r\n\t\tif t[i][j]==\"*\":\r\n\t\t\tver.append((i+1,j+1))\r\ndef funt(a,b):\r\n\treturn (abs((a[0]-b[0])*(a[0]-b[0]))+abs((a[1]-b[1])*(a[1]-b[1])))**(1/2)\r\n\r\n\r\n\r\n\r\na=funt(ver[0],ver[1])\r\nb=funt(ver[1],ver[2])\r\nc=funt(ver[0],ver[2])\r\nd=max(a,b,c)\r\nif d==a:\r\n\tx,y=((ver[0][0]+ver[1][0])/2,(ver[0][1]+ver[1][1])/2)\r\n\tprint(int(2*x-ver[2][0]),int(2*y-ver[2][1]))\r\nif d==b:\r\n\tx,y=((ver[1][0]+ver[2][0])/2,(ver[1][1]+ver[2][1])/2)\r\n\tprint(int(2*x-ver[0][0]),int(2*y-ver[0][1]))\r\nif d==c:\r\n\tx,y=((ver[0][0]+ver[2][0])/2,(ver[0][1]+ver[2][1])/2)\r\n\tprint(int(2*x-ver[1][0]),int(2*y-ver[1][1]))\r\n\r\n", "n, m = map(int, input().split())\r\ngrid = [input() for i in range(n)]\r\n# print(grid)\r\nrows, cols = [], []\r\nfor i in range(n):\r\n for j in range(m):\r\n if grid[i][j] == '*':\r\n rows.append(i + 1)\r\n cols.append(j + 1)\r\n\r\nans = []\r\nfor i in rows:\r\n if rows.count(i) != 2:\r\n ans.append(i)\r\n\r\nfor i in cols:\r\n if cols.count(i) != 2:\r\n ans.append(i)\r\nprint(*ans)", "n, m = map(int, input().split())\r\n\r\nA = []\r\nfor i in range(n):\r\n A += [input()]\r\n\r\nx, y = 0, 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j] == '*':\r\n x ^= i + 1\r\n y ^= j + 1\r\nprint(str(x) + ' '+ str(y))", "n, m = map(int, input().split())\r\ncity_map = []\r\nfor i in range(n):\r\n row = input().strip()\r\n city_map.append(row)\r\nstars = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if city_map[i][j] == '*':\r\n stars.append((i, j))\r\nfor i in range(n):\r\n for j in range(m):\r\n if city_map[i][j] == '.':\r\n if (i, j) != stars[0] and (i, j) != stars[1] and (i, j) != stars[2]:\r\n x_coords = [stars[0][0], stars[1][0], stars[2][0], i]\r\n y_coords = [stars[0][1], stars[1][1], stars[2][1], j]\r\n if len(set(x_coords)) == 2 and len(set(y_coords)) == 2:\r\n print(i+1, j+1)\r\n exit()\r\n", "n, m = map(int, input().split())\r\ndc = dict()\r\nfor j in range(n):\r\n word = input()\r\n if \"*\" in word:\r\n dc[j] = [i for i,c in enumerate(word) if c == '*']\r\n if len(dc[j]) == 1:\r\n r1 = j\r\n else:\r\n r2 = j\r\nc1 = list(set(dc[r2]).difference(dc[r1]))[0]\r\nprint(f'{r1 + 1} {c1 + 1}')", "n, m = [int(i) for i in input().split()]\r\ncity = [[i for i in input()] for j in range(n)]\r\narray = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if city[i][j] == \"*\":\r\n array.append([i, j])\r\na, b, c = array\r\n\r\nif a[0] == b[0] or a[0] == c[0]:\r\n if a[1] == b[1]:\r\n z = [b[0], c[1]]\r\n elif a[1] == c[1]:\r\n z = [c[0], b[1]]\r\n else:\r\n z = [c[0], a[1]]\r\nelif b[0] == a[0] or b[0] == c[0]:\r\n if a[1] == b[1]:\r\n z = [a[0], c[1]]\r\n else:\r\n z = [a[0], b[1]]\r\n\r\nprint(z[0] + 1, z[1] + 1)", "n,m=map(int,input().split())\nl1,r1,l2,r2=-1,-1,-1,-1\nx,y=-1,-1\nfor i in range(n):\n\tk=input()\n\tif k.count('*')>1:\n\t\tfor j in range(len(k)):\n\t\t\tif k[j]=='*':\n\t\t\t\tl1=i\n\t\t\t\tr1=j\n\t\tfor j in range(len(k)-1,-1,-1):\n\t\t\tif k[j]=='*':\n\t\t\t\tl2=i\n\t\t\t\tr2=j\n\telif k.count('*')==1:\n\t\tx=i\n\t\ty=k.find('*')\nif r1==y:\n\tprint(x+1,r2+1)\nelse:\n\tprint(x+1,r1+1)", "n, m = map(int, input().split())\narr = []\nogr = []\nfor i in range(n):\n arr.append(input())\n for k, v in enumerate(arr[i]):\n if v == '*':\n ogr.append([i, k])\nif ogr[0][0] == ogr[1][0]:\n if ogr[0][1] == ogr[2][1]:\n print(ogr[2][0] + 1, ogr[1][1] + 1)\n else:\n print(ogr[2][0] + 1, ogr[0][1] + 1)\nelse:\n if ogr[0][1] == ogr[2][1]:\n print(ogr[0][0] + 1, ogr[1][1] + 1)\n else:\n print(ogr[0][0] + 1, ogr[2][1] + 1)\n\n", "def solve(n, m, coords):\r\n x_cords = [coord[0] for coord in coords]\r\n y_cords = [coord[1] for coord in coords]\r\n\r\n x = None\r\n y = None\r\n\r\n for value in x_cords:\r\n if x_cords.count(value) == 1:\r\n x = value\r\n\r\n for value in y_cords:\r\n if y_cords.count(value) == 1:\r\n y = value\r\n\r\n return f\"{x} {y}\"\r\n\r\nif __name__ == \"__main__\":\r\n n, m = [int(_) for _ in input().split(sep=\" \")]\r\n coords = []\r\n for i in range(1, n + 1):\r\n for index, symbol in enumerate(input()):\r\n if symbol == \"*\":\r\n coords.append((i, index + 1))\r\n \r\n result = solve(n, m, coords)\r\n print(result)\r\n\r\n\r\n", "n,m=(int(x) for x in input().split())\r\nrobberies_loc_x={}\r\nrobberies_loc_y={}\r\nn_robberies=0\r\nfor i in range(n):\r\n if n_robberies==3:\r\n break\r\n x=i\r\n line=input()\r\n for y in range(m):\r\n if line[y]=='*':\r\n n_robberies+=1\r\n robberies_loc_x[x]=robberies_loc_x.get(x,0)+1\r\n robberies_loc_y[y]=robberies_loc_y.get(y,0)+1\r\n\r\nprint({y:x for x,y in robberies_loc_x.items()}[1]+1, {y:x for x,y in robberies_loc_y.items()}[1]+1)", "#https://codeforces.com/problemset/problem/181/A\r\n\r\ndef Solution(size, grid):\r\n result = \"\"\r\n for y in range(size[0]):\r\n if grid[y].count(\"*\") == 1:\r\n result = result + str(y+1) + \" \"\r\n \r\n for x in range(size[1]):\r\n tempList = []\r\n for y in range(size[0]):\r\n tempList.append(grid[y][x])\r\n if tempList.count(\"*\") == 1:\r\n result = result + str(x+1)\r\n \r\n print(result)\r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n size = list(map(int,input().strip().split()))[:2]\r\n grid = []\r\n for i in range(size[0]): \r\n gridElement = str(input())\r\n gridElement = [sign for sign in gridElement]\r\n grid.append(gridElement)\r\n Solution(size, grid)\r\n\r\n", "import sys, math, itertools, functools, collections\r\nfrom collections import Counter\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nMIN = 10 ** 18\r\nMAX = -10 ** 18\r\n\r\n\r\ndef int_j():\r\n return int(input())\r\n\r\n\r\ndef int_m():\r\n return map(int, input().split())\r\n\r\n\r\ndef list_m():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef occurred_once(arr):\r\n mp = Counter(arr)\r\n for it in mp:\r\n if mp[it] == 1:\r\n return it\r\n\r\n\r\nn, m = int_m()\r\na = list()\r\nb = list()\r\nfor i in range(n):\r\n x = input()\r\n for j in range(m):\r\n if x[j] == '*':\r\n a.append(i)\r\n b.append(j)\r\nprint(occurred_once(a)+1,occurred_once(b)+1)", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\npoints = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n points.append([i+1, j+1])\r\nif points[0][0] != points[1][0] and points[0][1] != points[1][1]:\r\n x = points[0]\r\n y = points[1]\r\n d = points[2]\r\nelif points[1][0] != points[2][0] and points[1][1] != points[2][1]:\r\n x = points[1]\r\n y = points[2]\r\n d = points[0]\r\nelse:\r\n x = points[0]\r\n y = points[2]\r\n d = points[1]\r\nf = [x[0], y[1]]\r\ng = [y[0], x[1]]\r\nif f == d:\r\n print(g[0], g[1])\r\nelse:\r\n print(f[0], f[1])", "m, n = [int(i) for i in input().split()]\nnumbers = [[0 for x in range(m)] for y in range(n)]\n\nrobs = []\n\nfor i in range(0, m):\n o = input()\n for j in range(0, len(o)):\n# numbers[j][i] = o[j]\n if o[j] == \"*\":\n robs.append([i + 1, j + 1])\n\n\nxCandidate = -1;\nyCandidate = -1;\n\nfor i in range(0, 3):\n rob = robs[i];\n hasCrimeInRow = False;\n hasCrimeInCol = False\n for j in range(0, 3):\n if (robs[j][0] == rob[0] and j != i):\n hasCrimeInRow = True\n\n for j in range(0, 3):\n if (robs[j][1] == rob[1] and j != i):\n hasCrimeInCol = True\n\n if not hasCrimeInCol:\n xCandidate = rob[1]\n\n if not hasCrimeInRow:\n yCandidate = rob[0]\n\n\n\nprint(str(yCandidate) + \" \" + str(xCandidate))\n\n \t \t \t \t \t\t\t\t \t\t\t \t", "# cf 181 A 800\nn, m = map(int, input().split())\nM = []\nfor _ in range(n):\n M.append(input())\n\nX, Y = set(), set()\nfor i in range(n):\n for j in range(m):\n if M[i][j] == '*':\n X.add(i)\n Y.add(j)\n\nfor x in X:\n for y in Y:\n if M[x][y] != '*':\n print(x + 1, y + 1)\n exit()\n", "n, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\n\r\ni1, j1 = [], []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == '*':\r\n i1.append(i + 1)\r\n j1.append(j + 1)\r\n\r\nfor i in range(3):\r\n for j in range(i + 1, 3):\r\n if i == 0 and j == 1:\r\n k = 2\r\n elif i == 0 and j == 2:\r\n k = 1\r\n elif i == 1 and j == 2:\r\n k = 0\r\n\r\n if i1[i] != i1[j] and j1[i] != j1[j]:\r\n print(i1[i] + i1[j] - i1[k], j1[i] + j1[j] - j1[k])\r\n", "n = input().split()\r\nm = int(n[1])\r\nn = int(n[0])\r\ns = []\r\nfor i in range(n):\r\n x = input()\r\n s.append(x)\r\n\r\nr1 = 0\r\nn1 = 0 \r\nr2 = 0 \r\nn2 = 0\r\nres = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if (s[i][j]=='*'):\r\n if r1 == i+1:\r\n n1+=1\r\n elif r1 ==0:\r\n r1 = i+1\r\n n1 +=1\r\n else:\r\n r2 = i+1\r\n n2 +=1\r\nif n1 == 1:\r\n res.append(r1)\r\nelse:\r\n res.append(r2)\r\n\r\nr1 = 0\r\nn1 = 0 \r\nr2 = 0 \r\nn2 = 0\r\nfor i in range(m):\r\n for j in range(n):\r\n if (s[j][i]=='*'):\r\n if r1 == i+1:\r\n n1+=1\r\n elif r1 ==0:\r\n r1 = i+1\r\n n1 +=1\r\n else:\r\n r2 = i+1\r\n n2 +=1\r\nif n1 == 1:\r\n res.append(r1)\r\nelse:\r\n res.append(r2)\r\nprint(*res)", "row, column = map(int,input().split())\r\n\r\n\r\n\r\n\r\ninput_list = []\r\nfor s in range(row):\r\n row_list = list(input())\r\n input_list.append(row_list)\r\n \r\nfor i in range(row):\r\n if input_list[i].count('*') == 1:\r\n for j in range(column):\r\n if input_list[i][j] == '*':\r\n r1 = i+1\r\n c1 = j+1\r\n elif input_list[i].count('*') == 2:\r\n c3_open = False\r\n c2_close = True\r\n for j in range(column):\r\n if input_list[i][j] == '*' and c2_close:\r\n r2 = i+1\r\n c2 = j+1\r\n c3_open = True\r\n c2_close = False\r\n if input_list[i][j] == '*' and c3_open:\r\n r3 = i+1\r\n c3 = j+1\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\nif c1 == c3:\r\n c1 = c2\r\nelse:\r\n c1 = c3\r\n\r\n\r\nprint(r1)\r\nprint(c1)", "n, m = [int(x) for x in input().split(' ')]\r\nfor i in range(1, n + 1):\r\n r = input()\r\n c = r.count('*')\r\n if c == 1:\r\n sr = i\r\n sc = r.index('*')\r\n if c == 2:\r\n dr = i\r\n dc = [j for j in range(len(r)) if r[j] == '*']\r\ndc.remove(sc)\r\nprint(sr, dc[0] + 1)", "#Jai Hanuman\r\n#Om Nama Shivai\r\n#Jai Shree Krisha\r\n#Jai Shree Ram\r\n#Jai Maa BuriThakram\r\n#Jai Maa Kali\r\n#Jai Maa Durga\r\n\r\n\r\n\r\n\r\n\r\n# # def facto(n):\r\n# # if(n == 0):\r\n# # return 1\r\n# # result = 1\r\n# # for i in range(1,n+1):\r\n# # result = result * i\r\n# # return result\r\n\r\n# Om Namh Shivai\r\n# Jai Shree Ram\r\n# Jai Hanuman\r\n# Radha-Krisha\r\n# Jai Maa Durga\r\n# Jai Maa Kali\r\n\r\nimport math\r\narr = list()\r\nresult = list()\r\nn,m= map(int, input().split())\r\nfor _ in range(n):\r\n arr.append(input())\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if(arr[i-1][j-1] == \"*\"):\r\n result.append([i,j])\r\nax=result[0][0]\r\nay=result[0][1] \r\nbx=result[1][0]\r\nby=result[1][1]\r\ncx=result[2][0]\r\ncy=result[2][1]\r\nabd= math.sqrt((ax-bx)**2 + (ay-by)**2)\r\nbcd= math.sqrt((cx-bx)**2 + (cy-by)**2)\r\nacd= math.sqrt((ax-cx)**2 + (ay-cy)**2)\r\n#print(abd,bcd,acd)\r\nma = max(abd,bcd,acd)\r\nif(ma == abd):\r\n diax = ((ax+bx))\r\n diay = ((ay+by))\r\n #print(diax,diay)\r\n x = abs(diax - cx)\r\n y = abs(diay - cy)\r\n print(x,y)\r\nif(ma == bcd):\r\n diax = ((cx+bx))\r\n diay = ((cy+by))\r\n #print(diax,diay)\r\n x = abs(diax - ax)\r\n y = abs(diay - ay)\r\n print(x,y)\r\nif(ma == acd):\r\n diax = ((cx+ax))\r\n diay = ((cy+ay))\r\n #print(diax,diay)\r\n x = abs(diax - bx)\r\n y = abs(diay - by)\r\n print(x,y)", "def ast_count_row(n,m):\r\n for i in range(n):\r\n astrx = 0\r\n for j in range(m):\r\n if s[i][j]=='*':\r\n astrx += 1\r\n if astrx == 1:\r\n return i+1\r\n\r\ndef ast_count_col(n,m):\r\n for j in range(m):\r\n astrx = 0\r\n for i in range(n):\r\n if s[i][j] == '*':\r\n astrx += 1\r\n if astrx == 1:\r\n return j+1\r\n\r\n\r\nn,m = map(int,input().split())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\n\r\n\r\nprint(ast_count_row(n,m),ast_count_col(n,m)) ", "n, m = map(int, input().split())\r\ncity = []\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n city.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if city[i][j] == '*':\r\n x.append(i)\r\n y.append(j)\r\nans = []\r\nfor i in x:\r\n if x.count(i) == 1:\r\n ans.append(i + 1)\r\nfor i in y:\r\n if y.count(i) == 1:\r\n ans.append(i + 1)\r\nprint(ans[0], ans[1])\r\n", "\"\"\"\ninstagram : essipoortahmasb2018\ntelegram channel : essi_python\n\"\"\"\nn , m = map(int,input().split())\na = []\nc=0\nIndex1 = Index2 = 0\nfor i in range(n):\n s = input()\n for j in range(len(s)):\n if s[j]=='*':\n a.append([i,j])\n c+=1\n if c==1:\n Index1=i\n c=0\nfor i in range(3):\n if a[i][0]==Index1:\n h=a[i][1]\n break\nfor i in range(3):\n if a[i][0]!=Index1 and a[i][1]!=h:\n Index2 = a[i][1]\nprint(Index1+1,Index2+1)\n\n\n\n\n \n", "r , c = input().split()\r\nrow=1\r\ntemp = ''\r\nfor i in range(int(r)):\r\n temp = str(input())\r\n if '*' in temp:\r\n if temp.count('*')==1:\r\n ans_row = row\r\n x = temp.index('*')\r\n else:\r\n y = temp.index('*')\r\n z = temp.rindex('*')\r\n row = row +1\r\nif x!=y:\r\n ans_col = y+1\r\nelse:\r\n ans_col = z+1\r\nprint(ans_row , ans_col)", "# https://codeforces.com/problemset/problem/181/A\r\n\r\nrow, column = map(int, input().split())\r\n\r\nnew = list()\r\n\r\nfor i in range(row):\r\n string = input()\r\n for j in range(column):\r\n if string[j] == \"*\":\r\n new.append((i, j))\r\n\r\nif new[0][0] == new[1][0]:\r\n if new[0][1] == new[2][1]:\r\n print(new[2][0]+1, new[1][1]+1)\r\n else:\r\n print(new[2][0]+1, new[0][1]+1)\r\nelse:\r\n if new[0][1] == new[1][1]:\r\n print(new[0][0]+1, new[2][1]+1)\r\n else:\r\n print(new[0][0]+1, new[1][1]+1)\r\n", "n, m = map(int, input().split())\n\nrowSet = [0] * 101\ncolumnSet = [0] * 101\nfor i in range(n):\n row = input()\n for j in range(m):\n if row[j] == '*':\n rowSet[i+1] += 1\n columnSet[j+1] += 1\n\nrowIndex, columnIndex = None, None\nfor i in range(1,101):\n if rowSet[i] == 1:\n rowIndex = i\n if columnSet[i] == 1:\n columnIndex = i\n\nprint(rowIndex, columnIndex, sep = \" \")\n", "n, m = map(int, input().split())\ns2 = -1\ns1 = -1\na = []\nfor i in range(n):\n s = input()\n if s.count('*') == 2:\n s2 = i\n elif s.count('*') == 1:\n s1 = i\n a.append(s)\n\nz1 = a[s2].find('*')\nz2 = a[s2].rfind('*')\n\nif a[s1].find('*') == z1:\n t = z2\nelse:\n t = z1\n\nprint(s1 + 1, t + 1)", "n, m = (int(x) for x in input().split())\na = []\nfor i in range(n):\n s = input()\n for j in range(m):\n if s[j] == '*':\n a.append([i, j])\nif a[0][0] == a[1][0]:\n x = a[2][0]\nelif a[1][0] == a[2][0]:\n x = a[0][0]\nelse:\n x = a[1][0]\nif a[0][1] == a[1][1]:\n y = a[2][1]\nelif a[1][1] == a[2][1]:\n y = a[0][1]\nelse:\n y = a[1][1]\nprint(x + 1, y + 1)\n", "r,c=map(int,input().split())\r\npair=[]\r\nsingle=0\r\nfor q in range(1,r+1):\r\n a=input()\r\n if a.count('*')==2: \r\n for i in range(0,len(a)):\r\n if a[i]=='*':\r\n pair.append(i)\r\n elif a.count('*')==1:\r\n singlerow=q\r\n for i in range(0,len(a)):\r\n if a[i]=='*':\r\n single=i\r\n break\r\n r -= 1\r\n\r\n\r\nif single==pair[0]:\r\n print(\"{} {}\".format(singlerow,pair[1]+1))\r\nelse:\r\n print(\"{} {}\".format(singlerow, pair[0]+1))\r\n \r\n\r\n", "n, m = map(int, input().split())\r\nl = x = 0\r\nfor i in range(n):\r\n a = list(input())\r\n for j in range(m):\r\n if a[j] == '*':\r\n l ^= (i + 1)\r\n x ^= (j + 1)\r\n\r\nprint(l, x)", "n, m = [int(x) for x in input().split()]\r\ngrid = []\r\nfor r in range(n):\r\n row = input()\r\n if row.count('*') == 1:\r\n r1 = r + 1\r\n grid.append(row) # list of string is ok for grid\r\n# scan rows\r\n# scan columns\r\nfor c in range(m):\r\n cnt = 0\r\n for r in range(n):\r\n if grid[r][c] == '*':\r\n cnt += 1\r\n if cnt == 1:\r\n c1 = c + 1\r\n break\r\nprint(r1, c1)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Dec 28 14:44:29 2022\r\n\r\n@author: 21pt24\r\n\"\"\"\r\n\r\nr,c=input().split()\r\nr=int(r)\r\nc=int(c)\r\nl=[]\r\ncnt=[]\r\n\r\nfor i in range(r):\r\n val=list(input())\r\n l.append(val)\r\n if val.count(\"*\")%2==1:\r\n row=i\r\n if val.count(\"*\")==2:\r\n nrow=i\r\n \r\n #break\r\nfor i in range(c):\r\n if l[nrow][i]==\"*\" and l[row][i]==\".\":\r\n column=i\r\n\r\nprint(row+1,column+1) \r\n", "n,m=map(int,input().split())\r\nx=[]\r\ny=[]\r\nfor i in range(1,n+1):\r\n a=list(input())\r\n for j in range(len(a)):\r\n if a[j]=='*':\r\n x.append(i)\r\n y.append(j+1)\r\nfor i in x: \r\n if x.count(i)==1:\r\n print(i,end=\" \")\r\nfor i in y: \r\n if y.count(i)==1:\r\n print(i)\r\n ", "n,m = map(int,input().split())\r\nl=[]\r\n\r\nfor i in range(n):\r\n m2=list(input())\r\n l.append(m2)\r\nless=0\r\nmore=0\r\n\r\nfor i in range(n):\r\n m1=0\r\n for j in l[i]:\r\n if j==\"*\":\r\n m1+=1\r\n if m1==1:\r\n less=i\r\n if m1==2:\r\n more=i\r\n\r\nfor i in range(m):\r\n if l[less][i]!=l[more][i]:\r\n print(f\"{less+1} {i+1}\")", "size = list(map(int, input().split(\" \")))\r\n\r\ncoords = []\r\nfor i in range(size[0]):\r\n key = input()\r\n keylist = list(key)\r\n for index, key in enumerate(keylist):\r\n if key == \"*\":\r\n coords.append([i+1, index+1])\r\n \r\ncalc = []\r\nfor index, coord in enumerate(coords):\r\n \r\n if coord[0] not in calc:\r\n calc.append(coord[0] )\r\n continue\r\n \r\n if coord[0] in calc:\r\n calc.remove(coord[0] )\r\n \r\nx = calc[0]\r\n\r\ncalc = []\r\nfor index, coord in enumerate(coords):\r\n \r\n if coord[1] not in calc:\r\n calc.append(coord[1] )\r\n continue\r\n \r\n if coord[1] in calc:\r\n calc.remove(coord[1] )\r\n \r\ny = calc[0]\r\n \r\nprint(x,y)", "n,m=map(int,input().split())\r\nx=[]\r\ny=[]\r\n\r\n\r\nfor _ in range(n):\r\n \r\n a=str(input())\r\n for i in range(len(a)):\r\n if a[i]=='*':\r\n x.append(_+1)\r\n y.append(i+1)\r\n\r\nxc,yc=0,0\r\n\r\n\r\nfor i in range(len(x)):\r\n if x.count(x[i])==1:\r\n xc=x[i]\r\n if y.count(y[i])==1:\r\n yc=y[i]\r\nprint(xc,yc)\r\n \r\n \r\n ", "n, m = map(int, input().split())\r\nri = 0\r\nrj = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == \"*\":\r\n ri ^= i\r\n rj ^= j\r\nprint(ri + 1, rj + 1)", "l, c = map(int, input().split())\nmatriz = []\nps = []\nfor i in range(l):\n for j, char in enumerate(input()):\n if(char==\"*\"):\n ps.append((i,j))\nif(ps[1][0] - ps[0][0]!=0):\n if(ps[0][1]==ps[-1][1]):\n print(ps[0][0]+1, ps[1][1]+1)\n else:\n print(ps[0][0]+1, ps[-1][1]+1) \nelse:\n if(ps[-1][1]==ps[0][1]):\n print(ps[-1][0]+1, ps[-2][1]+1)\n else:\n print(ps[-1][0]+1, ps[0][1]+1)\n \n\t \t \t \t \t \t \t \t \t\t\t\t \t \t", "N, M = map(int,input().split())\r\nL = [list(input()) for i in range(N)]\r\none = two = 0\r\nfor i in range(N):\r\n if (L[i].count('*')==1):\r\n one = i\r\n z = L[i].index('*')\r\n if (L[i].count('*')==2):\r\n two = i\r\n x, y = (j for j in range(M) if L[i][j]=='*')\r\nif x == z: p, q = one, y\r\nelse: p, q = one, x\r\nprint(p+1, q+1)", "a,b=list(map(int,input().split()))\r\nt=[]\r\nfor j in range(a):\r\n p=input()\r\n if '*' in p:\r\n for k in range(len(p)):\r\n if p[k]=='*':\r\n t.append([j+1,k+1])\r\nu=[]\r\nv=[]\r\ns=t[0][0]\r\ne=t[len(t)-1][0]\r\nfor w in range(len(t)):\r\n if t[w][0]==s:\r\n u.append(t[w][1])\r\n else:\r\n v.append(t[w][1])\r\n\r\nif len(v)>len(u):\r\n for x in v:\r\n if x in u:\r\n pass\r\n else:\r\n print(*[s,x])\r\n break\r\nelse:\r\n for c in u:\r\n if c in v:\r\n pass\r\n else:\r\n print(*[e,c])\r\n break\r\n\r\n \r\n\r\n", "[n,m]=map(int, input().split())\r\nfor i in range(n):\r\n c = str(input())\r\n if c.count('*')==2: s1=c\r\n if c.count('*')==1: \r\n s2=c\r\n x=i\r\nfor i in range(m):\r\n if s1[i]!=s2[i]: y=i\r\nprint(x+1,y+1)\r\n", "n,m=map(int,input().split())\r\nx=[];y=[]\r\nfor i in range(n):\r\n\ts=str(input())\r\n\tfor j in range(m):\r\n\t\tif s[j]=='*':\r\n\t\t\tx.append(i)\r\n\t\t\ty.append(j)\r\nX=set(x);Y=set(y)\r\n#print(x,y)\r\na=2*X.pop()+2*X.pop()-(sum(x));\r\nb=2*Y.pop()+2*Y.pop()-(sum(y));\r\nprint(a+1,b+1)", "n, m = map(int, input().split())\r\nc = [input() for _ in range(n)]\r\nrow = [0] * n\r\ncol = [0] * m\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if c[i][j] == '*':\r\n row[i] += 1\r\n col[j] += 1\r\n\r\nfor i in range(n):\r\n if row[i] == 1:\r\n print(i+1, end=' ')\r\n\r\nfor j in range(m):\r\n if col[j] == 1:\r\n print(j+1)\r\n", "n,m=map(int,input().split(' '))\r\nn1=[]\r\nm1=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tfor j in range(m):\r\n\t\tif s[j]=='*':\r\n\t\t\tn1.append(i+1)\r\n\t\t\tm1.append(j+1)\r\nn1.sort()\r\nm1.sort()\r\nif n1.count(min(n1))>n1.count(max(n1)):\r\n\tpos1=max(n1)\r\nelse:\r\n\tpos1=min(n1)\r\nif m1.count(min(m1))>m1.count(max(m1)):\r\n\tpos2=max(m1)\r\nelse:\r\n\tpos2=min(m1)\t\t\t\t\r\nprint(pos1,pos2)", "s = input().split()\r\nms = []\r\nfor i in range(int(s[0])):\r\n m = input()\r\n for j in range(int(s[1])):\r\n if m[j] == '*':\r\n pom = []\r\n pom.append(i)\r\n pom.append(j)\r\n ms.append(pom)\r\nv = ms[0][0]\r\nkl = ms[0][1]\r\nif ms[1][0] != ms[2][0]:\r\n if ms[1][0] != v:\r\n v = ms[1][0]\r\n else:\r\n v = ms[2][0]\r\nif ms[1][1] != ms[2][1]:\r\n if ms[1][1] != kl:\r\n kl = ms[1][1]\r\n else:\r\n kl = ms[2][1]\r\nprint('{} {}'.format(v + 1, kl + 1))", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\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()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n h,w=LI()\n field=[list(S()) for _ in range(h)]\n\n y=[]\n x=[]\n for i in range(h):\n for j in range(w):\n if field[i][j]=='*':\n y.append(i+1)\n x.append(j+1)\n\n # print(y,x)\n\n for yy in y:\n if y.count(yy)==1:\n ans_y=yy\n\n for xx in x:\n if x.count(xx)==1:\n ans_x=xx\n\n return str(ans_y)+' '+str(ans_x)\n\n# main()\nprint(main())\n", "n, m = map(int, input().split())\nrectangle = []\n# fill the n x m map with '.' or '*'\nfor i in range(n):\n index = 1\n xs = input()\n # get all the '*' coordinates\n for x in xs:\n if x == '*':\n rectangle.append((i+1, index))\n index += 1\n# form rectangle with the forth coordinate\nx = map(lambda x: x[0], rectangle)\nx = list(x)\n# if element repeats remove it\nx = [item for item in x if x.count(item) == 1]\n# same for y\ny = map(lambda x: x[1], rectangle)\ny = list(y)\ny = [item for item in y if y.count(item) == 1]\n\n\nprint(x[0], y[0])\n\n \t \t \t\t\t\t \t\t\t \t\t \t \t", "n, m = map(int, input().split())\nrows = []\nfor _ in range(0, n):\n rows.append(input())\np = []\nrset = set()\ncset = set()\nfor r, x in enumerate(rows):\n for c, v in enumerate(x):\n if v == \"*\":\n p.append([r, c])\n rset.add(r)\n cset.add(c)\nfor i in rset:\n for j in cset:\n if [i, j] not in p:\n print(i + 1, j + 1)\n break\n", "\r\n\r\nn,m=map(int,input().split())\r\npos=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tif \"*\" in s:\r\n\t\tfor j in range(m):\r\n\t\t\tif s[j]==\"*\":\r\n\t\t\t\tpos.append([i+1,j+1])\r\n\t\t\t\t\r\n\r\npos.sort()\r\nif pos[0][0]==pos[1][0]:\r\n\tif pos[0][1]==pos[2][1]:\r\n\t\tprint(pos[2][0],pos[1][1])\r\n\telse:\r\n\t\tprint(pos[2][0],pos[0][1])\r\nelse:\r\n\tif pos[0][1]==pos[2][1]:\r\n\t\tprint(pos[0][0],pos[1][1])\r\n\telse:\r\n\t\tprint(pos[0][0],pos[2][1])\r\n#print(pos)", "n, m = map(int, input().split(\" \"))\r\nM = []\r\nfor _ in range(n):\r\n M.append(input())\r\n\r\nX, Y = set(), set()\r\nfor i in range(n):\r\n for j in range(m):\r\n if M[i][j] == \"*\":\r\n X.add(i)\r\n Y.add(j)\r\n\r\nfor x in X:\r\n for y in Y:\r\n if M[x][y] != \"*\":\r\n print(x+1, y+1)\r\n exit()", "myList = []\r\nn, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nrows = []\r\ncols = []\r\nfor i in range(n):\r\n char = input()\r\n myList.append(char)\r\nfor i in range(n):\r\n for j in range(len(myList[i])):\r\n if myList[i][j] == '*':\r\n rows.append(i+1)\r\n cols.append(j+1)\r\nif rows[0] != rows[1] and rows[0] != rows[2]:\r\n repRow = rows[0]\r\nelif rows[1] != rows[0] and rows[1] != rows[2]:\r\n repRow = rows[1]\r\nelse:\r\n repRow = rows[2]\r\n \r\nif cols[0] != cols[1] and cols[0] != cols[2]:\r\n repCol = cols[0]\r\nelif cols[1] != cols[0] and cols[1] != cols[2]:\r\n repCol = cols[1]\r\nelse:\r\n repCol = cols[2]\r\nprint(repRow, repCol)", "#loser707\r\nm,n=map(int,input().split())\r\na=[] # a is a list where each element is each row converted into list\r\nfor i in range(0,m): #converting each input row into a list and appending it to a\r\n l=list(input())\r\n a.append(l)\r\nfor i in a:\r\n if i.count('*')==1:\r\n y=a.index(i)+1 #row number of the fourth * because it will be in the same row that contains one *\r\n x1=i.index('*')+1 #index of the single *\r\n if i.count('*')==2:\r\n ind=0\r\n p=[]\r\n for j in i:\r\n ind=ind+1\r\n if j=='*':\r\n p.append(ind) #indexes of the two *s\r\nfor i in p:\r\n if i!=x1: #the fourth * will not be in the same column as the single *\r\n x=i\r\nprint(y,x)\r\n \r\n \r\n ", "def main():\n [n, m] = [int(_) for _ in input().split()]\n x = [0, 0, 0]\n y = [0, 0, 0]\n points = 0\n\n for i in range(n):\n row = input()\n\n if points < 3:\n for j in range(m):\n if row[j] == '*':\n x[points] = j + 1\n y[points] = i + 1\n points += 1\n\n x.sort()\n y.sort()\n\n next_x = x[0] if x[1] == x[2] else x[2] if x[1] == x[0] else 0\n next_y = y[0] if y[1] == y[2] else y[2] if y[1] == y[0] else 0\n print(next_y, next_x)\n\n\nif __name__ == '__main__':\n main()\n", "\r\ny,x=[*map(int, input().split())]\r\n \r\nrobs_y = []\r\nrobs_x = []\r\nfor q in range(y):\r\n\tstreet = input()\r\n\tfor w in range(x):\r\n\t\tif street[w] == '*':\r\n\t\t\trobs_x.append(w+1)\r\n\t\t\trobs_y.append(q+1)\r\n \r\nxs = {robs_x.count(x):x for x in robs_x}\r\nys = {robs_y.count(y):y for y in robs_y}\r\nprint(ys[1],xs[1])", "\r\nn,m=map(int,input().split())\r\nl=[]\r\np=[]\r\nfor i in range(n):\r\n\ta=list(input())\r\n\tl.append(a)\r\n\tc=a.count(\"*\")\r\n\tif(c==1):\r\n\t\tp.insert(0,i)\r\n\telif(c==2):\r\n\t\tp.append(i)\r\n\telse:\r\n\t\tcontinue\r\nx,y=p\r\nprint(x+1,end=\" \")\r\nf=l[x].index(\"*\")\r\nfor i in range(m):\r\n\tif(l[y][i]==\"*\" and i!=f):\r\n\t\tprint(i+1)\r\n\t\tbreak", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == '*':\r\n a.append([j, i])\r\nif a[0][1] == a[1][1]:\r\n if a[2][0] != max(a[0][0], a[1][0]):\r\n print(a[2][1]+1, max(a[0][0], a[1][0])+1)\r\n else:\r\n print(a[2][1]+1, min(a[0][0], a[1][0])+1)\r\nelif a[0][1] == a[2][1]:\r\n if a[1][0] != max(a[0][0], a[2][0]):\r\n print(a[1][1]+1, max(a[0][0], a[2][0])+1)\r\n else:\r\n print(a[1][1]+1, min(a[0][0], a[2][0])+1)\r\nelif a[1][1] == a[2][1]:\r\n if a[0][0] != max(a[1][0], a[2][0]):\r\n print(a[0][1]+1, max(a[1][0], a[2][0])+1)\r\n else:\r\n print(a[0][1]+1, min(a[1][0], a[2][0])+1)\r\n", "n,m=[int(x) for x in input().split()]\r\n\r\nx=[]\r\ny=[]\r\n\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if s[j]=='*':\r\n x.append(i+1)\r\n y.append(j+1)\r\n\r\nprint(x[0]^x[1]^x[2],y[0]^y[1]^y[2])\r\n", "def main():\r\n n,m=map(int,input().split())\r\n s=[]\r\n for i in range(n):\r\n s.append(input())\r\n i1=[0,0,0]\r\n j1=[0,0,0]\r\n k=0\r\n for i in range(n):\r\n for j in range(m):\r\n if s[i][j]=='*':\r\n i1[k]=i+1\r\n j1[k]=j+1\r\n k+=1\r\n for i in range(3):\r\n for j in range(i+1,3):\r\n if i==0 and j==1:\r\n k=2\r\n elif i==0 and j==2:\r\n k=1\r\n elif i==1 and j==2:\r\n k=0\r\n if i1[i]!=i1[j] and j1[i]!=j1[j]:\r\n print(i1[i]+i1[j]-i1[k],j1[i]+j1[j]-j1[k])\r\nif __name__=='__main__':\r\n main()", "#181A\r\nn,m = map(int,input().split())\r\narr = []\r\nfor i in range(n):\r\n arr.append([j for j in input().split()])\r\n# print(arr) \r\nflag = 0\r\nx = y = 0\r\nstar1 = star2 = 0\r\nfor i in range(n):\r\n for j in arr[i]:\r\n flag = j.count(\"*\")\r\n if (flag == 1): \r\n x = i\r\n star1 = j \r\n elif (flag == 2):\r\n star2 = j\r\n# print(star1,star2) \r\nk = 0\r\nwhile (k < m):\r\n if(star1[k] == star2[k]):\r\n k+=1\r\n else:\r\n y = k\r\n break\r\nprint(x+1,y+1) ", "a,b=map(int,input().split());c,d,e,g=0,0,0,0\r\nfor i in range(a):\r\n k=input().replace(\" \",\"\")\r\n if k.count(\"*\")==2:c=k.find(\"*\");k=k[::-1];d=b-1-k.find(\"*\")\r\n if k.count(\"*\")==1:e=k.find(\"*\");g=i\r\nif e==c:print(g+1,d+1)\r\nelse :print(g+1,c+1)", "# SERIES OF CRIME\r\n\"\"\"\r\nCreated on Sat Jan 7 20:08:41 2023\r\n\r\n@author: 21pt05\r\n\"\"\"\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\ncnt=[]\r\n\r\nfor i in range(n):\r\n val=list(input())\r\n l.append(val)\r\n if val.count(\"*\")%2==1:\r\n row=i\r\n if val.count(\"*\")==2:\r\n nrow=i\r\n \r\n \r\nfor i in range(m):\r\n if l[nrow][i]==\"*\" and l[row][i]==\".\":\r\n column=i\r\n\r\nprint(row+1,column+1) \r\n", "#loser707\r\nm,n=map(int,input().split())\r\na=[]\r\nfor i in range(0,m):\r\n l=list(input())\r\n a.append(l)\r\nfor i in a:\r\n if i.count('*')==1:\r\n y=a.index(i)+1 #row number of the fourth *\r\n x1=i.index('*')+1 #index of the single *\r\n if i.count('*')==2:\r\n ind=0\r\n p=[]\r\n for j in i:\r\n ind=ind+1\r\n if j=='*':\r\n p.append(ind) #indexes of the two *s\r\nfor i in p:\r\n if i!=x1:\r\n x=i\r\nprint(y,x)\r\n \r\n \r\n ", "n, m = input().split(' ')\nn = int(n)\nm = int(m)\n\nv = []\n\nu = []\nw = []\n\nfor i in range(0, n):\n b = input()\n v.append(list(b))\n\nfor i in range(0, n):\n for j in range(0, m):\n if v[i][j] == '*':\n u.append(i+1)\n w.append(j+1)\n\n\nfor i in u:\n if u.count(i) == 1:\n x = i\n break\n\nfor i in w:\n if w.count(i) == 1:\n y = i\n break\n\nprint(f\"{x} {y}\")\n \t\t \t \t\t\t\t \t\t \t \t \t \t", "n, m = map(int, input().split())\nx = []\n\nfor i in range (n):\n\n s = input()\n aux = 0\n\n for j in range (len(s)):\n if (s[j] == '*'):\n\n aux += 1\n x.append(j)\n h = j\n\n if aux == 1:\n x.pop()\n pos = i\n aux2 = h\n\nif x[0] == aux2:\n aux2 = x[1]\n\nelif x[1] == aux2:\n aux2 = x[0]\n \nprint(pos + 1, aux2 + 1)\n\t \t\t\t\t \t \t\t\t \t \t \t \t\t \t", "n,m=input().split()\r\nm=int(m)\r\nn=int(n)\r\nlist1=[]\r\nr=[]\r\nc=[]\r\nfor i in range(n):\r\n inp=input()\r\n list1.append(inp)\r\nfor i in range(n):\r\n for j in range(len(list1[i])):\r\n if list1[i][j]=='*':\r\n r.append(i+1)\r\n c.append(j+1)\r\nif r[0]!=r[1] and r[2]==r[1]:\r\n row=r[0]\r\nelif r[0]==r[1] and r[1]!=r[2]:\r\n row=r[2]\r\nelif r[2]==r[0] and r[1]!=r[0]:\r\n row=r[1] \r\n\r\nif c[0]!=c[1] and c[2]==c[1]:\r\n col=c[0]\r\nelif c[0]==c[1] and c[1]!=c[2]:\r\n col=c[2]\r\nelif c[2]==c[0] and c[1]!=c[0]:\r\n col=c[1] \r\n\r\nprint(row,col)", "n, m = map(int, input().split())\r\nmatrix = [input().split(\"*\") for _ in range(n)]\r\nr, c = 0, []\r\nfor i in range(n):\r\n if len(matrix[i]) == 2:\r\n r = i\r\n elif len(matrix[i]) == 3:\r\n c.append(matrix[i][0].count(\".\"))\r\n c.append(matrix[i][1].count(\".\"))\r\nif c[0] == matrix[r][0].count(\".\"):\r\n print(r+1, c[0]+c[1]+2)\r\nelse:\r\n print(r+1, c[0]+1)", "m, n = map(int,input().split())\r\n\r\nc = {}\r\nres = [0,0]\r\n\r\n\r\nfor i in range(m):\r\n s = input()\r\n if s.count('*') == 1:\r\n res[0] = i+1\r\n for j in range(n):\r\n if s[j] == '*':\r\n if j+1 not in c:\r\n c[j+1] = 1\r\n else:\r\n c[j+1] += 1\r\n\r\nfor i in c:\r\n if c[i] == 1:\r\n res[1] = i\r\n \r\nprint(*res)\r\n", "n,m=map(int,input().split())\r\nlist1=[[0 for i in range(m)]for j in range(n)]\r\n\r\nstore=[]\r\nfor i in range(n):\r\n data=input()\r\n \r\n for j in range(m):\r\n list1[i][j]=data[j]\r\nx_axis,y_axis=0,0\r\nfor i in range(n):\r\n for j in range(m):\r\n if list1[i][j]==\"*\":\r\n store.append([i,j])\r\n x_axis^=i\r\n y_axis^=j\r\nprint(x_axis+1,y_axis+1)\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\r\nx = []\r\ny = []\r\nmylist = []\r\nfor i in range(a):\r\n s = str(input())\r\n l = list(s)\r\n for j in range(len(l)):\r\n if l[j] == \"*\":\r\n x.append(i+1)\r\n y.append((j+1))\r\nfor k in x:\r\n if x.count(k) == 1:\r\n mylist.append(k)\r\nfor t in y:\r\n if y.count(t) == 1:\r\n mylist.append(t)\r\nprint(*mylist, sep=\" \")", "\r\n\r\nimport math\r\nfrom math import gcd,floor,sqrt,log\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\ndef countt(string):\r\n\tcount = 0\r\n\tfor i in string:\r\n\t\tif i==\"*\":\r\n\t\t\tcount+=1\r\n\treturn count\r\n\r\ndef solve():\r\n\tr,c = listin()\r\n\tx = []\r\n\toneind = -1\r\n\ttwoind = -1\r\n\tfor i in range(r):\r\n\t\tz = sin()\r\n\t\tx.append(z)\r\n\t\tm = countt(z)\r\n\t\tif m==2:\r\n\t\t\ttwoind = i\r\n\t\telif m==1:\r\n\t\t\t oneind = i\r\n\t\tif twoind!=-1 and oneind!=-1:\r\n\t\t\tbreak\r\n\tprint(oneind+1,end = \" \")\r\n\ttempind = x[oneind].index(\"*\")\r\n\tfor i in range(len(x[twoind])):\r\n\t\tif x[twoind][i]==\"*\" and i!=tempind:\r\n\t\t\tprint(i+1)\r\n\t\t\treturn\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nt = 1 \r\n# t = int(input()) \r\nfor hula in range(t):\r\n\tsolve()\r\n", "n, m = list(map(int, input().split()))\r\ns = [None]*n\r\nloc = []\r\nfor i in range(n):\r\n s[i] = input()\r\n for j in range(m):\r\n if s[i][j] == '*':\r\n loc.append((i, j))\r\nr = c = 0\r\nif loc[0][0] == loc[1][0]:\r\n r = loc[2][0]\r\nelif loc[0][0] == loc[2][0]:\r\n r = loc[1][0]\r\nelse:\r\n r = loc[0][0]\r\nif loc[0][1] == loc[1][1]:\r\n c = loc[2][1]\r\nelif loc[0][1] == loc[2][1]:\r\n c = loc[1][1]\r\nelse:\r\n c = loc[0][1]\r\nprint('{} {}'.format(r+1, c+1))\r\n", "n, m = tuple(map(int, input().strip().split(\" \")))\r\n\r\narr = []\r\n\r\nminX = 1000\r\nminY = 1000\r\nmaxX = -1\r\nmaxY = -1\r\n\r\nfor _ in range(n):\r\n for j, ch in enumerate(input().strip()):\r\n if ch == \"*\":\r\n minX = min(minX, _)\r\n minY = min(minY, j)\r\n maxX = max(maxX, _)\r\n maxY = max(maxY, j)\r\n arr.append((_, j))\r\n\r\nif (minX, minY) not in arr:\r\n print(minX + 1, minY + 1)\r\n\r\nif (minX, maxY) not in arr:\r\n print(minX + 1, maxY + 1)\r\n\r\nif (maxX, minY) not in arr:\r\n print(maxX + 1, minY + 1)\r\n\r\nif (maxX, maxY) not in arr:\r\n print(maxX + 1, maxY + 1)\r\n", "a = input().split()\na = [int(a) for a in a]\npoints = []\n\nfor i in range(a[0]):\n b = list(input())\n for h in range(a[1]):\n if b[h] == \"*\":\n point = (i + 1), (h + 1)\n points.append(point)\n\nfinal_point = []\nx = []\ny = []\nfor i in range(3):\n listed = points[i]\n if listed[0] in final_point:\n final_point.remove(listed[0])\n continue\n final_point.append(listed[0])\nx = final_point[0]\nfinal_point = []\n\nfor i in range(3):\n listed = points[i]\n if listed[1] in final_point:\n final_point.remove(listed[1])\n continue\n final_point.append(listed[1])\ny = final_point[0]\nprint(x, y)\n\t \t\t \t\t \t \t\t\t \t\t \t\t", "n, m = map(int, input().split())\r\nrow, col = 0, 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == '*':\r\n row ^= i + 1\r\n col ^= j + 1\r\n\r\nprint(row, col)\r\n\r\n\r\n\r\n\r\n", "L = [int(h) for h in input().split(' ')]\r\nn = L[0]; m = L[1]\r\nif ((n >= 2) and (n <= 100) and (m >= 2) and (m <= 100)):\r\n N = M = list()\r\n for i in range(0, n):\r\n R = list()\r\n s = input()\r\n for j in range(0, len(s)):\r\n R = R + [s[j]]\r\n for k in range(0, len(R)):\r\n if (R[k] == '*'):\r\n N = N + [i + 1]\r\n M = M + [k + 1]\r\n En = set(N); Em = set(M)\r\n for p in range(0, len(N)):\r\n for qn in En:\r\n if (N.count(qn) == 1):\r\n x = qn\r\n for qm in Em:\r\n if (M.count(qm) == 1):\r\n y = qm\r\n print(x, ' ', y)", "m,n=map(int,input().split())\r\nx=0;y=0;\r\nfor i in range(m):\r\n l=input()\r\n for j in range(n):\r\n if l[j]==\"*\":\r\n x^=i\r\n y^=j\r\nprint(x+1,y+1)\r\n", "n, m = map(int,input().split())\r\nrec = []\r\nfor i in range(n):\r\n aste = input()\r\n for j in range(m):\r\n if aste[j] == '*':\r\n rec.append([i+1,j+1])\r\nif rec[0][1] == rec[1][1] and rec[0][0] == rec[2][0]:\r\n print(f'{rec[1][0] + rec[2][0] - rec[0][0] } {rec[1][1] + rec[2][1] - rec[0][1]}')\r\nelif rec[0][1] == rec[2][1] and rec[0][0] == rec[1][0]:\r\n print(f'{rec[1][0] + rec[2][0] - rec[0][0] } {rec[1][1] + rec[2][1] - rec[0][1]}')\r\nelif rec[1][1] == rec[0][1] and rec[1][0] == rec[2][0]:\r\n print(f'{rec[0][0] + rec[2][0] - rec[1][0] } {rec[0][1] + rec[2][1] - rec[1][1]}')\r\nelif rec[1][1] == rec[2][1] and rec[1][0] == rec[0][0]:\r\n print(f'{rec[0][0] + rec[2][0] - rec[1][0] } {rec[0][1] + rec[2][1] - rec[1][1]}')\r\nelif rec[2][1] == rec[0][1] and rec[2][0] == rec[1][0]:\r\n print(f'{rec[0][0] + rec[1][0] - rec[2][0] } {rec[0][1] + rec[1][1] - rec[2][1]}')\r\nelif rec[2][1] == rec[1][1] and rec[2][0] == rec[0][0]:\r\n print(f'{rec[0][0] + rec[1][0] - rec[2][0] } {rec[0][1] + rec[1][1] - rec[2][1]}')\r\n\r\n\r\n", "lmp = lambda:list(map(int, input().split()))\r\nmp = lambda:map(int, input().split())\r\nintp = lambda:int(input())\r\ninp = lambda:input()\r\n\r\nn, m = mp()\r\nx = y = 0\r\na = []\r\n\r\nfor i in range(n):\r\n s = inp()\r\n if s.count('*') == 1:\r\n x = i + 1\r\n a.append(s)\r\n\r\nfor i in range(m):\r\n cnt = 0\r\n for j in range(n):\r\n if a[j][i] == '*':\r\n cnt += 1\r\n if cnt == 1:\r\n y = i + 1\r\n break\r\nprint(x, y)\r\n", "from collections import Counter as c \r\nn,m = [int(i) for i in input().split()]\r\na=[]\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n x.append(j)\r\n y.append(i)\r\na= c(x)\r\nfor i in a:\r\n if a[i] == 1:\r\n col =i \r\nb= c(y)\r\nfor i in b :\r\n if b[i] ==1:\r\n row = i \r\nprint(row+1,' ',col+1)\r\n", "n,m=map(int,input().split())\r\nfor i in range(n):\r\n s=input()\r\n l=[]\r\n if s.count(\"*\")==2:\r\n for i in s:\r\n l.append(i)\r\n x1=l.index(\"*\")\r\n l.remove(\"*\")\r\n l.insert(x1,\"محمد\")\r\n x2=l.index(\"*\")\r\n x1+=1\r\n x2+=1\r\n elif s.count(\"*\")==1:\r\n p=i+1\r\n for i in s:\r\n l.append(i)\r\n x3=l.index('*')+1\r\nif x3==x1:\r\n x4=x2\r\nelse:\r\n x4=x1\r\nprint(p,x4)", "y, x = [*map(int, input().split())]\r\nlst_y, lst_x = [], []\r\nfor q in range(y):\r\n street = input()\r\n for w in range(x):\r\n if street[w] == '*':\r\n lst_x.append(w + 1)\r\n lst_y.append(q + 1)\r\nprint({lst_y.count(y): y for y in lst_y}[1], {lst_x.count(x): x for x in lst_x}[1])\r\n", "## A - Series of Crimes\n\ndef num_of_stars(row_or_column):\n stars = list(filter(lambda x: x == '*', row_or_column))\n # print(stars)\n return len(stars)\n\nn_rows, n_columns = [int(n) for n in input().split(\" \")]\n\nrows = []\nfor _ in range(n_rows):\n row = input()\n rows.append(row)\n\n# print(rows)\n\ncolumns = [[] for n in range(n_columns)]\nfor row in rows:\n for idx, column in enumerate(row):\n columns[idx].append(column)\n\n# print(columns)\n\nrow_idx = -1\ncolumn_idx = -1\n\nfor idx, row in enumerate(rows):\n if num_of_stars(row) == 1:\n row_idx = idx + 1\n\nfor idx, column in enumerate(columns):\n if num_of_stars(column) == 1:\n column_idx = idx + 1\n\nprint(\"{} {}\".format(row_idx, column_idx))\n \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 = lambda:list(input())\r\nn,m = R()\r\nmapping=[]\r\nfor i in range(n):\r\n k = N()\r\n mapping.append(k)\r\ncolumns = []\r\ncorr=[]\r\nn_c = []\r\nfor ran,row in enumerate(mapping):\r\n n_star =0\r\n for town,point in enumerate(row):\r\n if point == '*':\r\n n_star+=1\r\n columns.append(town+1)\r\n if n_star == 1:\r\n n_c.append(columns[-1]) \r\n corr.append(ran+1)\r\ncorr.append(list(set(columns)-set(n_c))[0])\r\nprint(*corr)", "n,m = map(int,input().split())\r\n\r\nstars = []\r\nfor I in range(n):\r\n s = input()\r\n for i in range(m):\r\n if s[i]=='*':\r\n stars.append((I+1,i+1))\r\n\r\nif stars[0][0]==stars[1][0]:\r\n if stars[0][1]==stars[2][1]:\r\n right = stars[1][1]\r\n else:\r\n right=stars[0][1]\r\n \r\n left = stars[2][0]\r\nelse:\r\n if stars[0][1]==stars[1][1]:\r\n right = stars[2][1]\r\n else:\r\n right=stars[1][1]\r\n \r\n left = stars[0][0]\r\n\r\nprint(left,right)\r\n \r\n", "x = y = 0\nn, _ = map(int, input().split())\n \nfor i in range(n):\n for j, ch in enumerate(input()):\n if ch == '*':\n x, y = x^i, y^j\n \nprint(x+1, y+1)\n\n\t \t\t\t \t \t \t \t\t\t\t \t\t\t \t\t\t\t", "def find_val(lst):\r\n if lst[0] == lst[1]:\r\n return lst[2]\r\n elif lst[0] == lst[2]:\r\n return lst[1]\r\n\r\n return lst[0]\r\n\r\n\r\nn, m = map(int, input().split())\r\nmarked = list()\r\nfor i in range(n):\r\n for j, mark in enumerate(list(input())):\r\n if mark == '*':\r\n marked.append((i, j))\r\n\r\nrows, columns = map(list, zip(*marked))\r\nprint(find_val(rows) + 1, find_val(columns) + 1)\r\n", "n, m = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n k = input()\r\n if k.count('*') == 2:\r\n x1 = i\r\n x2 = i\r\n y1 = k.find('*')\r\n y2 = k.rfind('*')\r\n elif k.count('*') == 1:\r\n x3 = i\r\n y3 = k.find('*')\r\n\r\nprint(x3 + 1, y2 + 1) if y3 == y1 else print(x3 + 1, y1 + 1)\r\n\r\n", "\r\n(n, m) = list(map(int, input().split()))\r\nx = 0\r\ny = 0\r\nx1 = 0\r\ny1 = 0\r\nx2 = 0\r\ny2 = 0\r\nfor i in range(n):\r\n line = input()\r\n if line.count('*') == 1:\r\n x = i\r\n y = line.index('*')\r\n if line.count('*') == 2:\r\n x1 = x2 = i\r\n (y1, y2) = [i for i, x in enumerate(line) if x == \"*\"]\r\nprint(x+1, end = ' ')\r\nif y == y1:\r\n print(y2 + 1)\r\nelse:\r\n print(y1+1)", "n,m=[int(x) for x in input().split()]\r\ns=[]\r\nk=[]\r\nd=[]\r\nl=[]\r\nfor i in range(n):\r\n\ts.append(input())\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif s[i][j]=='*':\r\n\t\t\tk.append(i)\r\n\t\t\td.append(j)\r\nfor i in k:\r\n\tif k.count(i)==1:\r\n\t\tl.append(i+1)\r\nfor i in d:\r\n\tif d.count(i)==1:\r\n\t\tl.append(i+1)\r\nfor i in l:\r\n\tprint(i,end=' ')", "n,m=[int(x) for x in input().split()]\r\nx,y=0,0\r\nfor i in range(n):\r\n c=input()\r\n for j in range(m):\r\n if(c[j]==\"*\"):\r\n x=x^i \r\n y=y^j\r\nprint(x+1,y+1)", "# 181A\r\ndef take2DInput() :\r\n nRows,mCols =map(int,input().split())\r\n \r\n if nRows == 0 :\r\n return list(), 0, 0\r\n \r\n mat = [list(map(str, input().strip())) for row in range(nRows)]\r\n return mat, nRows, mCols\r\nmat, nRows, mCols = take2DInput()\r\noner,onec,twor,twoc,threer,threec=0,0,0,0,0,0\r\nfor i in range(nRows):\r\n for j in range(mCols):\r\n if mat[i][j]==\"*\":\r\n if oner<1:\r\n oner=i+1\r\n onec=j+1\r\n elif twor<1:\r\n twor=i+1\r\n twoc=j+1\r\n elif threer<1:\r\n threer=i+1\r\n threec=j+1\r\n# print(threer,threec)\r\nif oner==twor:\r\n if threec==onec:\r\n print(threer,twoc)\r\n else:\r\n print(threer,onec)\r\nelif oner==threer:\r\n if twoc==onec:\r\n print(twor,threec)\r\n else:\r\n print(twor,onec)\r\nelif twor==threer:\r\n if twoc==onec:\r\n print(oner,threec)\r\n else:\r\n print(oner,twoc)\r\n", "from cmath import *\r\nfrom decimal import *\r\nfrom collections import *\r\nimport sys\r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\ndef _int(): return int(input())\r\n\r\n\r\ndef solves():\r\n n,m=_input()\r\n a=[]\r\n b=[]\r\n for i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if (s[j]=='*'):\r\n b.append(j)\r\n a.append(i)\r\n print(min(a,key=a.count)+1, min(b,key=b.count)+1) \r\n\r\n \r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "# LUOGU_RID: 102444052\nfrom collections import Counter\r\nn, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j] == '*':\r\n x += i,\r\n y += j,\r\nprint(Counter(x).most_common()[1][0] + 1, Counter(y).most_common()[1][0] + 1)", "n, m = map(int, input().split())\r\ns1 = ''\r\ns2 = ''\r\nh = 0\r\nfor i in range(n):\r\n s = input()\r\n if s.count(\"*\") == 2:\r\n s1 = s\r\n if s.count(\"*\") == 1:\r\n s2 = s\r\n h = i\r\n\r\nfor i in range(m):\r\n if s1[i] != s2[i]:\r\n print(h+1, i+1)\r\n exit()\r\n\r\n\r\n\r\n", "m,n=map(int,input().split())\r\na=[]\r\nfor x in range(1,m+1):\r\n\tb=list(input())\r\n\tif b.count('*')==2:\r\n\t\tfor y in range(n):\r\n\t\t\tif b[y]==\"*\":\r\n\t\t\t\ta.append(y+1)\r\n\telif b.count(\"*\")==1:z,l=b.index(\"*\")+1,x\r\nif a[0]==z:print(l,a[1])\r\nelse:print(l,a[0])", "s = [int(x) for x in input().split()]\r\n\r\nn = s[0] # number of lines\r\nm = s[1] # number of characters\r\n\r\nlines = []\r\n\r\nfor thing in range(n):\r\n lines.append(input())\r\n\r\nall_coordinates = []\r\n\r\ndef get_ast_coords(row_index, row, list):\r\n for y, item in enumerate(row):\r\n if (item==\"*\"):\r\n list.append([row_index, y+1])\r\n\r\nfor x, row in enumerate(lines):\r\n get_ast_coords(x+1, row, all_coordinates)\r\n\r\nall_x = []\r\nall_y = []\r\n\r\nfor coords in all_coordinates:\r\n all_x.append(coords[0])\r\n all_y.append(coords[1])\r\n\r\ndef least_occurring_item(items):\r\n \r\n for item in items:\r\n if (items.count(item)==1):\r\n return(item)\r\n\r\nprint(least_occurring_item(all_x), least_occurring_item(all_y))\r\n\r\n# print(all_x)\r\n# print(all_y)", "n, m = [int(i) for i in input().split()]\ngrid = []\nxcoordinates, ycoordinates = [], []\nfor i in range(n):\n row = input()\n grid.append(row)\nfor i in range(n):\n for j in range(m):\n if grid[i][j]=='*':\n xcoordinates.append(i)\n ycoordinates.append(j)\nanswer = []\nfor i in xcoordinates:\n if xcoordinates.count(i)==1:\n answer.append(i+1)\nfor j in ycoordinates:\n if ycoordinates.count(j)==1:\n answer.append(j+1)\nprint(' '.join([str(k) for k in answer]))", "def fourthCoordinate(matrix):\r\n x = []\r\n y = []\r\n for i in range(len(matrix)):\r\n for j in range(len(matrix[0])):\r\n if matrix[i][j] == '*':\r\n x.append(j + 1)\r\n y.append(i + 1)\r\n a = 0\r\n b = 0\r\n for num in x:\r\n a ^= num\r\n for num in y:\r\n b ^= num\r\n return (b, a)\r\n\r\nx, y = map(int, input().split())\r\nmatrix = []\r\nfor _ in range(x):\r\n matrix.append(input())\r\n\r\nprint(*fourthCoordinate(matrix))", "n, m = map(int, input().split())\n\nc = []\n\nfor i in range(n):\n line = input()\n for j in range(len(line)):\n if line[j] == \"*\":\n c.append([i,j])\n\nps = [[c[0][0] , c[1][1]],\n [c[0][0] , c[2][1]],\n [c[1][0] , c[0][1]],\n [c[1][0] , c[2][1]],\n [c[2][0] , c[0][1]],\n [c[2][0] , c[1][1]],\n ]\n\nfor p in ps:\n if p not in c:\n print(p[0] + 1, p[1] + 1)\n quit()\n \n\t\t\t \t\t \t \t\t\t \t\t\t\t \t\t\t", "rc = input('')\r\nrc = rc.split(' ')\r\nn = int(rc[0])\r\nm = int(rc[1])\r\nrf_index = []\r\nre_index = 0\r\nrow_e = 0\r\ncolumn = 0\r\nfor i in range(n):\r\n district = input('')\r\n if district.count('*') == 2:\r\n for item in range(len(district)):\r\n if district[item] == '*':\r\n rf_index.append(item)\r\n elif district.count('*') == 1:\r\n for item in district:\r\n if item == '*':\r\n re_index += district.index(item)\r\n row_e += i\r\nfor cnum in rf_index:\r\n if cnum != re_index:\r\n column += cnum\r\nprint(row_e + 1, end = ' ')\r\nprint(column + 1)", "n,m = map(int,input().split())\r\na = []; c = []; d = []\r\nfor i in range(n):\r\n b = list(input())\r\n if \"*\" in b:\r\n if b.count(\"*\") == 2:\r\n for j in range(len(b)):\r\n if b[j] == \"*\":\r\n c.append(j+1)\r\n else:\r\n for j in range(len(b)):\r\n if b[j] == \"*\":\r\n d.append(j+1)\r\n p = i\r\nfor i in range(len(c)):\r\n if not c[i] in d:\r\n k = c[i]\r\nprint(p+1,k)", "n, m = map(int, input().split())\r\nx = [-1] * 4\r\ny = x[:]\r\nfor i in range(n):\r\n tmp = list(input())\r\n for j in range(m):\r\n if tmp[j] == '*':\r\n for ii in range(4):\r\n if x[ii] == -1:\r\n x[ii], y[ii] = i, j\r\n break\r\n\r\nfor i in range(3):\r\n cx = x.count(x[i])\r\n if cx == 1:\r\n x = x[i]\r\n break\r\nfor i in range(3):\r\n cy = y.count(y[i])\r\n if cy == 1:\r\n print(x + 1, y[i] + 1)\r\n break\r\n", "n,m = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n b = input()\r\n a.append(b)\r\nr = [0 for i in range(n)]\r\nc = [0 for i in range(m)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if(a[i][j] == '*'):\r\n r[i]+=1\r\n c[j]+=1\r\n\r\nfor i in range(n):\r\n if r[i]==1:\r\n print(i+1,end=\" \")\r\n break\r\n\r\nfor i in range(m):\r\n if c[i]==1:\r\n print(i+1)\r\n break\r\n", "a,b=input().split()\r\na,b=int(a),int(b)\r\nc=[]\r\nfor i in range(a):\r\n c.append(input())\r\n if c[i].count('*')==1:\r\n m=i\r\n elif c[i].count('*')==2:\r\n n=i\r\nfor i in range(b):\r\n if c[n][i]=='*' and i!=c[m].index('*'):\r\n l=i\r\n break\r\nprint(m+1,l+1) ", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == \"*\":\r\n a += [(i + 1 , j + 1)]\r\nif a[0][0] == a[1][0]:\r\n x = a[2][0]\r\n if a[2][1] == a[0][1]:\r\n y = a[1][1]\r\n elif a[2][1] == a[1][1]:\r\n y = a[0][1]\r\nelif a[2][0] == a[1][0]:\r\n x = a[0][0]\r\n if a[2][1] == a[0][1]:\r\n y = a[1][1]\r\n elif a[0][1] == a[1][1]:\r\n y = a[2][1]\r\nprint(x ,y)\r\n", "n, m = list(map(lambda i: int(i), input().split()))\nx, y = 0, 0\nrow = [0] * n \ncol = [0] * m\nfor i in range(n):\n line = input()\n for j in range(m):\n if (line[j] == '*'):\n row[i] = row[i] + 1\n col[j] = col[j] + 1\n\nfor i in range(n):\n if row[i] == 1:\n x = i\n\nfor j in range(m):\n if col[j] == 1:\n y = j\n\nprint(x + 1, y + 1)\n \t \t\t\t \t \t \t \t \t \t \t", "x = input()\r\nx = x.split(' ')\r\ny = []\r\nro = 0\r\ncol = 0\r\nfor i in range(int(x[0])):\r\n p = []\r\n z = input()\r\n p[:0] = z\r\n y.append(p)\r\n\r\nfor row in range(int(x[0])):\r\n c = 0\r\n for column in range(int(x[1])):\r\n if y[row][column] == '*':\r\n c = c+1\r\n if c == 1:\r\n ro = row + 1\r\n\r\nfor column in range(int(x[1])):\r\n c = 0\r\n for row in range(int(x[0])):\r\n if y[row][column] == '*':\r\n c = c + 1\r\n if c == 1:\r\n col = column + 1\r\nprint(ro, col)\r\n", "m,n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nmappo=[]\r\nfor i in range(m):\r\n x = input()\r\n s = list(x)\r\n mappo.append(s)\r\nrow=[]\r\ncol=[]\r\nfor i in range(m):\r\n for j in range(n):\r\n if mappo[i][j] == \"*\":\r\n row.append(i)\r\n col.append(j)\r\nprint(min(row, key=row.count)+1,min(col, key=col.count)+1)\r\n\r\n" ]

[ "n = int(input())\r\nheights = [int(x) for x in input().split()]\r\nleftCounter = [0] * n\r\nrightCounter = [0] * n\r\nfor i in range(1,n):\r\n if heights[i-1] <= heights[i]:\r\n leftCounter[i] = leftCounter[i-1] + 1\r\n if heights[n-i-1] >= heights[n-i]:\r\n rightCounter[n-i-1] = rightCounter[n-i] + 1\r\nmaxSections = 0\r\nfor i in range(n):\r\n maxSections = max(maxSections,leftCounter[i]+rightCounter[i]+1)\r\nprint(maxSections)", "# بسم الله الرحمن الرحيم\r\ndef main():\r\n n = int(input())\r\n heights = [int(i) for i in input().split()]\r\n\r\n max = 0\r\n maximal = 0\r\n for watered in range(n):\r\n max = 1\r\n next = watered + 1\r\n while next < n:\r\n if heights[next] <= heights[next-1]:\r\n max += 1\r\n next += 1\r\n else:\r\n break\r\n prev = watered - 1\r\n while prev >= 0:\r\n if heights[prev] <= heights[prev+1]:\r\n max += 1\r\n prev -= 1\r\n else:\r\n break\r\n if max > maximal:\r\n maximal = max\r\n print(maximal)\r\nif __name__=='__main__':\r\n main()", "# Author : //- kibrom Hailu -\\\\\r\n\r\nimport sys\r\n# from collections import Counter, defaultdict, deque\r\n# from math import ceil, floor, gcd, inf, sqrt\r\n# from itertools import permutations, combinations, accumulate\r\n# from bisect import bisect_left, bisect_right\r\n# from heapq imortt heapify , heappop , heappush , heappushpop , heapreplace \r\n\r\ndef SI():return sys.stdin.readline().rstrip()\r\ndef I():return int(SI())\r\ndef M():return map(int, SI().split())\r\ndef IL():return list(map(int, SI().split()))\r\ndef F():return float(SI())\r\ndef FL():return list(map(float, SI().split()))\r\n\r\n\r\ndef main():\r\n \r\n n = I()\r\n arr = IL() \r\n\r\n def maxres(x,arr):\r\n ans = 0\r\n l = x-1\r\n r = x+1\r\n while l > -1 or r < len(arr):\r\n if (l > -1 and r < len(arr)) and (arr[l+1] >= arr[l] and arr[r-1] >= arr[r]):\r\n ans += 2\r\n l -= 1\r\n r += 1\r\n\r\n elif l > -1 and arr[l+1] >= arr[l]:\r\n ans += 1\r\n l -= 1\r\n elif r < len(arr) and arr[r-1] >= arr[r]:\r\n ans += 1\r\n r += 1\r\n else: break \r\n\r\n \r\n return ans \r\n \r\n\r\n max_ans = 0\r\n for i in range(n):\r\n max_ans = max(max_ans,maxres(i,arr)+1)\r\n \r\n print(max_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\nif __name__ == \"__main__\":\r\n main()\r\n", "#\tAuthor\t: debugster\r\n#\tEmail\t: [email protected]\r\n#\tDate\t: 2020-06-03 01:51:41\r\n\r\nimport sys\r\nimport os\r\n\r\ndef get_int():\r\n return map(int, input().split())\r\n\r\ndef get_array():\r\n return list(map(int, input().split()))\r\n\r\nif os.environ.get(\"DEBUGSTER_PYTHON\"):\r\n sys.stdin = open('in.txt', 'r')\r\n sys.stdout = open('out.txt','w')\r\n\r\nn = int(input())\r\nh = get_array()\r\nleft = dict()\r\nright = dict()\r\n\r\nfor i in range(n):\r\n left[i] = 0\r\n right[i] = 0\r\n\r\nfor i in range(1, n):\r\n if h[i - 1] <= h[i]:\r\n left[i] = left[i - 1] + 1\r\n\r\nfor i in range(n - 2, -1, -1):\r\n if h[i] >= h[i + 1]:\r\n right[i] = right[i + 1] + 1\r\n\r\nans = -1\r\nfor i in range(n):\r\n ans = max(ans, left[i] + right[i] + 1)\r\n\r\nprint(ans)", "n = int(input())\r\nheight = list(map(int,input().split()))\r\nans = 1\r\n\r\nfor i in range(n):\r\n count = 1\r\n for j in range(i,0,-1):\r\n if (height[j-1] <= height[j]):\r\n count += 1\r\n else:\r\n break\r\n for j in range(i,n-1):\r\n if (height[j+1] <= height[j]):\r\n count += 1\r\n else:\r\n break\r\n ans = max(ans,count)\r\n\r\nprint(ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nwater = [0] * n\r\n# Search Right\r\nfor i in range(n):\r\n temp = 1\r\n for j in range(i, n-1):\r\n l = arr[j]\r\n r = arr[j+1]\r\n if l >= r:\r\n temp +=1\r\n else: break;\r\n water[i] += temp\r\n# Search Left\r\nfor i in range(n-1,-1, -1):\r\n temp = 0\r\n for j in range(i, 0, -1):\r\n r = arr[j]\r\n l = arr[j - 1]\r\n if l<=r:\r\n temp+=1\r\n else: break;\r\n water[i]+=temp\r\nprint(max(water))", "n = int(input())\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nranges = []\r\ncurrent_range = 0\r\n\r\nfor i in range(n):\r\n for j in range(i,n-1):\r\n if heights[j] >= heights[j+1]:\r\n current_range = current_range +1\r\n else:\r\n break\r\n for j in range(i,0,-1):\r\n if heights[j] >= heights[j-1]:\r\n current_range = current_range + 1\r\n else:\r\n break\r\n ranges.append(current_range)\r\n current_range = 0\r\n\r\nprint(max(ranges)+1)\r\n ", "n=int(input())\r\nL=input().split()\r\nfor i in range(n):\r\n L[i]=int(L[i])\r\nL1=[]\r\nfor k in range(n):\r\n i=j=k\r\n l=r=0\r\n while(i+1<=len(L)-1 and L[i]>=L[i+1]):\r\n i+=1\r\n l+=1\r\n while(j-1>=0 and L[j]>=L[j-1]):\r\n j-=1\r\n r+=1\r\n L1.append(r+l+1)\r\nprint(max(L1))\r\n\r\n#RUNNING THE SAME LIST NORMALLY AND IN REVERSE SIMULTANEOUSLY AND CHECKING IF A CONDITION STANDS\r\n\r\n#If i want to run the list normally and in reverse to check some condition.Everytime we check if\r\n#one element of the list is bigger than it's next one and if the same element when we run the list\r\n#in reverse is bigger than it's previous one until i and j are equal to the length of the list.\r\n#When this happens we return the max of (l+r+1).", "x=int(input())\r\na=list(map(int,input().split()))\r\ns=[1]*x\r\nq=[1]*x\r\nfor i in range(x-1):\r\n if a[i]<=a[i+1]:\r\n s[i+1]=s[i]+1\r\na=a[::-1]\r\nfor i in range(x-1):\r\n if a[i]<=a[i+1]:\r\n q[i+1]=q[i]+1\r\nq=q[::-1]\r\nm=0\r\nfor i in range(x):\r\n m=max(m,s[i]+q[i]-1)\r\nprint(m)", "n = int(input())\r\n\r\n\r\nli = list(map(int,input().split()))\r\n\r\nans = []\r\nfor i in range(n):\r\n\r\n \r\n\r\n a = li[i]\r\n\r\n count = 1\r\n\r\n try:\r\n while a>=li[i+count]:\r\n\r\n a = li[i+count]\r\n\r\n \r\n\r\n count+=1\r\n\r\n except:\r\n pass\r\n\r\n\r\n r = (count-1)\r\n\r\n a = li[i]\r\n\r\n count = 1\r\n\r\n try:\r\n while a>=li[i-count] and i-count>=0:\r\n\r\n a = li[i-count]\r\n\r\n \r\n\r\n count+=1\r\n\r\n except:\r\n pass\r\n\r\n\r\n l = (count-1)\r\n\r\n #print(l,r)\r\n ans.append(l+r+1)\r\n\r\n\r\nprint(max(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", "import math\r\n\r\nN = int(input())\r\nH = list(map(int, input().split()))\r\n\r\nascender = []\r\ndescender = []\r\n\r\nprev = math.inf\r\nfor index, value in enumerate(H):\r\n ascender.append(ascender[index - 1] + 1 if value >= prev else 0)\r\n prev = value\r\n\r\nprev = math.inf\r\nfor index, value in enumerate(H[::-1]):\r\n descender.append(descender[index - 1] + 1 if value >= prev else 0)\r\n prev = value\r\n\r\nres = [a + b for a,b in zip(ascender, descender[::-1])]\r\nprint(max(res)+1)\r\n", "total = 0\r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n local_count = 0\r\n\r\n _min = l[i]\r\n for j in range(i-1, -1 , -1):\r\n if l[j] <= _min:\r\n local_count += 1\r\n _min = l[j]\r\n else:\r\n break\r\n \r\n _min = l[i]\r\n for j in range(i+1, n):\r\n if l[j] <= _min:\r\n local_count += 1\r\n _min = l[j]\r\n else:\r\n break\r\n \r\n local_count += 1\r\n if local_count > total:\r\n total = local_count\r\n\r\nprint(total)", "l=int(input())\r\np=input().split()\r\nif(l==1):\r\n\tprint(1)\r\nelse:\r\n\tq=[]\r\n\tfor i in range(l):\r\n\t\ts=1\r\n\t\tfor j in range(i,0,-1):\r\n\t\t\tif(int(p[j-1])<=int(p[j])):\r\n\t\t\t\ts+=1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\tfor k in range(i,l-1):\r\n\t\t\tif(int(p[k+1])<=int(p[k])):\r\n\t\t\t\ts+=1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\tq.append(s)\r\n\tprint(max(q))", "n = int(input())\r\ns = input().split()\r\na = [0]\r\nfor i in range(0, n) : a.append(int(s[i]))\r\nans = 0\r\nfor i in range(1, n + 1) :\r\n l = r = i\r\n ln = rn = a[i]\r\n while ((l > 1) and (a[l - 1] <= ln)) :\r\n l -= 1\r\n ln = a[l]\r\n while ((r < n) and (a[r + 1] <= rn)) :\r\n r += 1\r\n rn = a[r]\r\n ans = max(ans, r - l + 1)\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n c=0\r\n j=i\r\n while j>0 and l[j]>=l[j-1]:\r\n j-=1\r\n # print(j)\r\n c+=i-j\r\n j=i\r\n while j<n-1 and l[j]>=l[j+1]:\r\n j+=1\r\n # print(j)\r\n c+=j-i\r\n # print(c+1,l[i])\r\n ans = max(ans,c+1)\r\nprint(ans)", "def list_input():\n\treturn list(map(int, input().strip().split()))\n\narg = int(input())\nl1 = list_input()\n\nascend = [1]\ndescent = [1]\n\nfor i in range(1, arg):\n\tif l1[i] >= l1[i-1]:\n\t\tascend.append(ascend[-1] + 1)\n\telse:\n\t\tascend.append(1)\n# print(ascend)\n\nl2 = [j for j in l1]\nl2.reverse()\n\nfor i in range(1, arg):\n\tif l2[i] >= l2[i-1]:\n\t\tdescent.append(descent[-1] + 1)\n\telse:\n\t\tdescent.append(1)\ndescent.reverse()\n# print(descent)\n\nr2 = 0\nfor i in range(0, arg):\n\tr2 = max(ascend[i] + descent[i] - 1, r2)\nprint(r2)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled57.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/18lJOmkKqeabYSXXspIJ5xemflN7n1sbd\n\"\"\"\n\nn=int(input())\nl1=list(map(int,input().split()))\nmax=0\nfor x in range(0,len(l1)):\n c=0\n a=l1[x]\n for j in range(x-1,-1,-1):\n if l1[j+1]>=l1[j]:\n c=c+1\n \n else:\n break\n \n for k in range(x+1,len(l1)):\n if l1[k-1]>=l1[k]:\n c=c+1\n else:\n break\n \n if c>max:\n max=c\nprint(max+1)", "\r\nn = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nmx = -1\r\n\r\nfor i in range(n):\r\n x = l[i]\r\n cnt = 1\r\n for j in range(i + 1 , n):\r\n if l[j] > x :\r\n break\r\n else:\r\n cnt += 1\r\n x = l[j]\r\n\r\n x = l[i]\r\n for k in range(i - 1 , -1 , -1):\r\n if l[k] > x :\r\n break\r\n else:\r\n cnt +=1\r\n x = l[k]\r\n\r\n if cnt > mx :\r\n mx = cnt\r\n\r\nprint(mx)\r\n\r\n", "import math\r\n\r\nans = 1\r\ndp = {}\r\n\r\ndef solve(arr):\r\n global ans, dp\r\n for i in range(len(arr)):\r\n count = 1\r\n tar = arr[i]\r\n for j in range(i+1, len(arr)):\r\n if arr[j] <= tar: \r\n count += 1\r\n tar = arr[j]\r\n else: break\r\n tar = arr[i]\r\n for j in range(i-1, -1, -1):\r\n if arr[j] <= tar: \r\n count += 1\r\n tar = arr[j]\r\n else: break\r\n ans = max(count, ans)\r\n \r\n \r\n \r\nf = input()\r\na = input().split(\" \")\r\na = [int(x) for x in a]\r\nsolve(a)\r\n\r\nprint(ans)", "n = int(input())\r\n\r\nelem = list(map(int,input().split()))\r\n\r\nvalues = []\r\n\r\nif (n == 1):\r\n print(1)\r\n exit()\r\n \r\nif (len(set(elem)) == 1):\r\n print(n)\r\n exit()\r\n\r\nans = 1\r\n\r\nfor i in range(n):\r\n if (i == 0):\r\n left = 0\r\n else:\r\n if(elem[i] >= elem[i-1]):\r\n left = values[i-1][0] + 1\r\n else:\r\n left = 0\r\n \r\n if (i == n-1):\r\n right = 0\r\n else:\r\n right = 0\r\n last = elem[i]\r\n for x in range(i+1,n):\r\n if (last >= elem[x]):\r\n right+=1\r\n last = elem[x]\r\n else:\r\n break\r\n \r\n temp = [left, right]\r\n # print(temp)\r\n values.append(temp)\r\n \r\n total = left + right + 1\r\n if (total > ans):\r\n ans = total\r\n \r\n\r\n\r\nprint(ans)", "grid_size = int(input())\r\n\r\nheights = input().split()\r\nheights = list(map(int, heights))\r\n\r\nmax = 0\r\nfor index in range(grid_size):\r\n temp = 0\r\n left = index - 1\r\n right = index + 1\r\n while(left >= 0 and heights[left] <= heights[left+1]):\r\n temp += 1\r\n left -= 1\r\n\r\n while(right <grid_size and heights[right] <= heights[right-1]):\r\n temp += 1\r\n right += 1\r\n\r\n if (temp > max):\r\n max = temp\r\n\r\nprint(max+1)", "input()\nh = list(map(int, input().split()))\n\nleft = []\nright = []\nfor i, n in enumerate(h):\n if i == 0:\n left.append(False)\n else:\n left.append(h[i] >= h[i-1])\n \n if i == len(h) - 1:\n right.append(False)\n else:\n right.append(h[i] >= h[i+1])\n \nm= 0 \nfor i in range(len(h)):\n l_c = 0 \n t = i\n while left[t]:\n t-=1\n l_c += 1\n \n r_c = 0 \n t = i\n while right[t]:\n t+=1\n r_c += 1 \n \n if l_c + r_c + 1 > m:\n m = l_c + r_c + 1\n \nprint(m)", "n = int(input())\r\nheights = list(map(int,input().split()))\r\nhighest = 0\r\nfor i in range(n):\r\n k,m,counter = i,i,0\r\n # check for local maximum\r\n while k-1 in range(n) and heights[k-1] <= heights[k]:\r\n counter += 1\r\n k -= 1\r\n while m+1 in range(n) and heights[m] >= heights[m+1]:\r\n counter += 1\r\n m += 1\r\n if counter + 1 > highest:\r\n highest = counter + 1\r\nprint(highest)\r\n \r\n \r\n", "def check_left(i):\r\n if i==0:\r\n return 0\r\n a=0\r\n curr=i\r\n for j in range(i-1,-1,-1):\r\n if l[j]<=l[curr]:\r\n curr = j\r\n a+=1\r\n else:\r\n return a\r\n return a\r\n\r\n\r\ndef check_right(i):\r\n if i==n-1:\r\n return 0\r\n a=0\r\n curr=i\r\n for j in range(i+1,len(l)):\r\n if l[j]<=l[curr]:\r\n curr=j\r\n a+=1\r\n else:\r\n return a\r\n return a\r\n\r\n\r\nn=int(input())\r\nl = list(map(int, input().split()))\r\nma=0\r\nfor i in range(n):\r\n ans=check_left(i)+check_right(i)+1\r\n # print(ans)\r\n if ma<ans:\r\n ma=ans\r\nprint(ma)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=0\r\nfor i in range(0,n):\r\n count=1\r\n j=i-1\r\n while j>=0:\r\n if a[j]<=a[j+1]:\r\n count+=1\r\n else:\r\n break\r\n j-=1\r\n j=i+1\r\n while j<n:\r\n if a[j]<=a[j-1]:\r\n count+=1\r\n else:\r\n break\r\n j+=1\r\n if count>m:\r\n m=count\r\nprint(m)", "number = int(input())\r\narr = list(map(int , input().split()))\r\nmain_counter = 0\r\nfor i in range(0 , len(arr) ) :\r\n counter = 0\r\n max = arr[i]\r\n for j in range ( i , len(arr) ):\r\n if arr[j] <= arr[i] and arr[j] <= max :\r\n counter +=1\r\n max = arr[j]\r\n else :\r\n break\r\n max = arr[i]\r\n for z in range (i-1 , -1 , -1):\r\n if arr[z] <= arr[i] and arr[z] <= max:\r\n counter += 1\r\n max = arr[z]\r\n else:\r\n break\r\n if main_counter < counter :\r\n main_counter = counter\r\nprint(main_counter)", "tam = int(input())\n\ngarden = list(map(int, input().split()))\ncoverage = [0]*tam\n\ndef get_side(side, i):\n ret = 0\n while 0 <= i + side < tam and garden[i] >= garden[i+side]:\n ret += 1\n i += side\n return ret\n\nfor i in range(tam):\n coverage[i] = 1 + get_side(1, i) + get_side(-1, i)\n\nprint(max(coverage))\n\n \t \t\t \t\t \t \t \t\t \t\t \t", "'''input\n5\n1 2 1 2 1\n'''\n# int(stdin.readline().strip())\n# list(map(int, stdin.readline().split()))\nfrom sys import stdin\n\n\ndef find_increasing_substring(arr):\n\tans = 1\n\ttemp = 1\n\taux = [1]\n\tfor i in range(1, len(arr)):\n\t\tif arr[i] >= arr[i - 1]:\n\t\t\taux.append(aux[-1] + 1)\n\t\telse:\n\t\t\taux.append(1)\n\treturn aux\n\n\n# main starts\nn = int(stdin.readline().strip())\narr = list(map(int, stdin.readline().split()))\n\nleft = find_increasing_substring(arr)\nright = find_increasing_substring(arr[::-1])\nright = right[::-1]\n# print(left)\n# print(right)\nans = 1\nfor i in range(n):\n\tans = max(left[i] + right[i] - 1, ans)\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().rstrip().split()))\r\nm=0\r\nfor i in range (n):\r\n c=1\r\n for j in range (i+1,n):\r\n if l[j-1]>=l[j]:\r\n c+=1\r\n else:\r\n break\r\n \r\n for j in range (i-1,-1,-1):\r\n if l[j]<=l[j+1]:\r\n c+=1\r\n else:\r\n break\r\n m=max(m,c)\r\nprint(m)", "land = input()\nland_ls = input().split()\n\n\ndef get_left_right(land_nums: list):\n right_left = \"0\"\n for j in range(1, len(land_nums)):\n if int(land_nums[j]) > int(land_nums[j - 1]):\n right_left += \"+\"\n elif int(land_nums[j]) < int(land_nums[j - 1]):\n right_left += \"-\"\n else:\n right_left += \"0\"\n return right_left\n\n\nright = get_left_right(land_ls)\nland_ls.reverse()\nleft = list(get_left_right(land_ls))\nleft.reverse()\nleft = \"\".join(left)\n\n# print(right, left, sep=\"\\n\")\n\ni = 0\nstreak_ls = []\nwhile i < len(right):\n streak = 0\n r_streak = right.find(\"+\", i + 1) - i - 1\n if r_streak < 0:\n r_streak = len(right) - i - 1\n temp_rev = \"\".join(list(reversed(left[0:i+1])))\n l_streak = temp_rev.find(\"+\", 1) - 1\n if l_streak < 0:\n l_streak = i\n streak_ls.append(r_streak + l_streak + 1)\n nxt = right.find(\"+\", i + 1)\n if nxt == -1:\n break\n else:\n i = nxt\nprint(max(streak_ls))\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nf = [0] * n\r\nb = [0] * n\r\nf[0] = 1\r\nfor i in range(1, n):\r\n f[i] = f[i-1]+1 if a[i] >= a[i-1] else 1\r\n\r\nb[n-1] = 1\r\nfor j in range(n-2,-1,-1):\r\n b[j] = b[j+1] + 1 if a[j] >= a[j+1] else 1\r\n\r\nmx = 0\r\nfor i in range(n):\r\n mx = max(f[i]+b[i], mx)\r\n\r\nprint(mx-1)", "n = int(input())\r\nheights = [int(x) for x in input().split()]\r\nmaximal = 0\r\nfor i in range(n):\r\n current = heights[i]\r\n j = i - 1\r\n k = i + 1\r\n currentMax = 1\r\n while j >= 0:\r\n if heights[j] <= current:\r\n currentMax += 1\r\n current = heights[j]\r\n else:\r\n break\r\n j -= 1\r\n current = heights[i]\r\n while k < n:\r\n if heights[k] <= current:\r\n currentMax += 1\r\n current = heights[k]\r\n else:\r\n break\r\n k += 1\r\n if currentMax > maximal:\r\n maximal = currentMax\r\nprint(maximal)", "\"\"\"\r\n/*************************************************************\r\n# by : mohamd abda alazez hashim #\r\n# e-mail : [email protected] #\r\n# problem : B. Queue at the School #\r\n*************************************************************/\r\n\"\"\"\r\n\r\nsec=1 # section rain flow\r\nmax_sec=0\r\nn = int(input())\r\nhights=list(map(int,input().split(' ')))\r\n\r\n\r\nfor i in range (n):\r\n for j in range(i+1,n):\r\n if hights[j]>hights[j-1]:\r\n break\r\n else:\r\n sec+=1\r\n \r\n for j in range(i-1,-1,-1):\r\n if hights[j]>hights[j+1]:\r\n break\r\n else:\r\n sec+=1\r\n max_sec=max(max_sec,sec)\r\n sec=1\r\n \r\nprint (max_sec)", "def rain(arr,y):\r\n res=0\r\n yy=arr[y:]\r\n for i in range(0,len(yy)-1):\r\n test1,test2=yy[i],yy[i+1]\r\n if test1>=test2:\r\n res +=1\r\n else:\r\n break\r\n\r\n x=arr[:y+1]\r\n # x.reverse()\r\n for i in range(len(x)-1,0,-1):\r\n if x[i]>=x[i-1]:\r\n res +=1\r\n else:\r\n break\r\n all_res.append(res+1)\r\nall_res=[]\r\nn=input()\r\narr=input().split()\r\narr=map(int,arr)\r\narr=list(arr)\r\nfor i in range(0,len(arr)):\r\n res=rain(arr,i)\r\nprint(max(all_res))\r\n", "hat = int(input())\r\nlst = [int(x) for x in input().split()]\r\nslst = set(lst)\r\nif len(slst) == 1 or hat == 2:\r\n print(hat)\r\n quit()\r\nwaterd = []\r\nsortlst = list(slst)\r\nsortlst = sorted(sortlst, reverse=True)\r\nsortlst.pop()\r\nfor i in range(hat):\r\n #print(i)\r\n \"\"\"\r\n if i == hat-1:\r\n steps = 1\r\n else:\r\n steps = 0\r\n \"\"\"\r\n steps = 0\r\n if lst[i] in sortlst:\r\n leftSteps = i\r\n rightSteps = hat - i - 1\r\n meStep = lst[i]\r\n for j in range(leftSteps-1, -1, -1):\r\n\r\n if lst[j] <= meStep:\r\n steps += 1\r\n meStep = lst[j]\r\n else:\r\n break\r\n #print(\"left\", j, \"step:\", steps, \"me:\", meStep)\r\n meStep = lst[i]\r\n for j in range(i, i + rightSteps+1):\r\n\r\n if lst[j] <= meStep:\r\n steps += 1\r\n meStep = lst[j]\r\n else:\r\n break\r\n #print(\"right\", j, \"step:\", steps, \"me:\", meStep)\r\n #print(\"\\n\")\r\n waterd.append(steps)\r\nprint(max(waterd))#, waterd)\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif n<=2:\r\n\tprint(n)\r\n\texit()\r\nans=float(\"-inf\")\r\ni=0\r\nwhile i<n:\r\n\tc=1\r\n\tfor j in range(i,0,-1):\r\n\t\tif a[j]>=a[j-1]:\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tfor j in range(i,n-1):\r\n\t\tif a[j]>=a[j+1]:\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tans=max(ans,c)\r\n\ti+=1\r\nprint(ans)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\na = n*[0]\r\nb = n*[0]\r\nfor i in range(1,n):\r\n\tif l[i]>=l[i-1]:\r\n\t\ta[i] = a[i-1]+1\r\n\tif l[-i]<=l[-i-1]:\r\n\t\tb[-i-1] = b[-i]+1\r\nmx = 0\r\nfor i in range(n):\r\n\tif a[i]+b[i]+1 > mx:\r\n\t\tmx = a[i]+b[i]+1\r\nprint(mx)\r\n", "def lij(i):\r\n if i == 0:\r\n br = 0\r\n \r\n elif l[i - 1] <= l[i]:\r\n br = lij(i - 1) + 1\r\n\r\n else:\r\n br = 0\r\n \r\n return br\r\n\r\ndef des(i):\r\n if i == n - 1:\r\n br = 0\r\n \r\n elif l[i + 1] <= l[i]:\r\n br = des(i + 1) + 1\r\n\r\n else:\r\n br = 0\r\n \r\n return br\r\n \r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\na = [0 for i in range(n)]\r\n\r\nif len(set(l)) == 1:\r\n print(n)\r\n\r\nelse:\r\n for i in range(n):\r\n a[i] = lij(i) + des(i) + 1\r\n\r\n print(max(a))\r\n", "n = int(input())\nheights = list(map(int, input().split()))\n\nresult = 0\n\nfor i in range(n):\n span = 1\n for j in range(i - 1, -1, -1):\n if j == -1 or heights[j] > heights[j + 1]:\n break\n span += 1\n for j in range(i + 1, n):\n if j == n or heights[j] > heights[j - 1]:\n break\n span += 1\n result = max(result, span)\n\nprint(result)\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\no = list(map(int,input().split()))\r\nl = [10**18]+o\r\nl.append(10**18)\r\ncnt = 0\r\nfor i in range(1,n+1):\r\n ans = 1\r\n prev = l[i]\r\n for j in range(i+1,n+1):\r\n if l[j] <= prev:\r\n ans += 1\r\n prev = l[j]\r\n continue\r\n\r\n break\r\n\r\n prev = l[i]\r\n for j in range(i-1,0,-1):\r\n if l[j] <= prev:\r\n ans += 1\r\n prev = l[j]\r\n continue\r\n\r\n break\r\n\r\n cnt = max(ans,cnt)\r\n\r\nprint(cnt)", "n = int(input())\r\nA = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(len(A)):\r\n # Check left Points\r\n Current = A[i]\r\n index = i\r\n counter = 0\r\n while (index>=1 and A[index] >= A[index-1]):\r\n index -= 1\r\n counter += 1\r\n\r\n # Check Right Points\r\n index = i\r\n while (index < n-1 and A[index] >= A[index+1]):\r\n index += 1\r\n counter += 1\r\n\r\n counter += 1\r\n if counter > ans:\r\n ans = counter\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxi = 0\r\nfor i in range(n):\r\n left = i\r\n right = i\r\n while True:\r\n if right == n-1:\r\n break\r\n if a[right + 1] <= a[right]:\r\n right += 1\r\n else:\r\n break\r\n while True:\r\n if left == 0:\r\n break\r\n if a[left - 1] <= a[left]:\r\n left -= 1\r\n else:\r\n break\r\n \r\n if right - left + 1 > maxi:\r\n maxi = right - left + 1\r\nprint(maxi)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nunique = [[0,1] for q in range(n)]\r\ni = 0\r\nj = 0\r\nwhile i < n:\r\n unique[j][0] = arr[i]\r\n i += 1\r\n while i < n and arr[i] == arr[i-1]:\r\n unique[j][1] += 1\r\n i += 1\r\n j += 1\r\n\r\nbest = 0\r\nfor k in range(n):\r\n count = unique[k][1]\r\n u = k + 1\r\n v = k - 1\r\n temp1 = unique[k][0]\r\n temp2 = unique[k][0]\r\n while u < n and v >= 0:\r\n if unique[v][0] < temp1:\r\n count += unique[v][1]\r\n temp1 = unique[v][0]\r\n v -= 1\r\n elif unique[u][0] < temp2:\r\n if unique[u][0] == 0:\r\n break\r\n count += unique[u][1]\r\n temp2 = unique[u][0]\r\n u += 1\r\n else:\r\n break\r\n while u < n:\r\n if unique[u][0] < temp2:\r\n if unique[u][0] == 0:\r\n break\r\n count += unique[u][1]\r\n temp2 = unique[u][0]\r\n u += 1\r\n else:\r\n break\r\n while v >= 0:\r\n if unique[v][0] < temp1:\r\n count += unique[v][1]\r\n temp1 = unique[v][0]\r\n v -= 1\r\n else:\r\n break\r\n best = max(best, count)\r\nprint(best)\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nnum=list(map(int,input().split()))\r\na,b=-1,-1\r\nfinalans=1\r\nfor i in range(n):\r\n\ta=i-1\r\n\tb=i+1\r\n\tans=1\r\n\twhile(a>=0 and num[a]<=num[a+1]):\r\n\t\tans+=1\r\n\t\ta-=1\r\n\twhile(b<n and num[b]<=num[b-1]):\r\n\t\tans+=1\r\n\t\tb+=1\r\n\tfinalans=max(ans,finalans)\r\nprint(finalans)", "#Read input \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#read inputs\nn = inp()\nheights = inlt()\n\n# Find max \ndef find_max(n,heights):\n tab1 = [1 for _ in range(n)]\n #tab2 = [0 for _ in range(n)]\n for i in range(n):\n j=i+1\n v = heights[i]\n while j<n:\n if heights[j]<=v:\n v = heights[j]\n tab1[i]+=1\n j+=1\n else:\n break\n \n v = heights[i]\n j=i-1\n while j>=0:\n if heights[j]<=v:\n v = heights[j]\n tab1[i]+=1\n j-=1\n else:\n break\n\n #print(tab1)\n return max(tab1)\n\nm = find_max(n,heights)\nprint(m)", "import sys\n\n\ndef solution(cols):\n\tmax_count = 0\n\tfor i, col in enumerate(cols):\n\t\tl_count, r_count = 0, 0\n\t\tif i < len(cols):\n\t\t\tj = i\n\t\t\tcurrent = cols[j]\n\t\t\twhile j < len(cols) and cols[j] <= current:\n\t\t\t\tr_count += 1\n\t\t\t\tcurrent = cols[j]\n\t\t\t\tj += 1\n\t\n\t\tif i > 0:\n\t\t\tj = i\n\t\t\tcurrent = cols[j]\n\t\t\twhile j >= 0 and cols[j] <= current:\n\t\t\t\tl_count += 1\n\t\t\t\tcurrent = cols[j]\n\t\t\t\tj -= 1\n\n\t\tif l_count > 0 and r_count > 0:\n\t\t\tcount = l_count + r_count - 1\n\t\telse:\n\t\t\tcount = max(l_count, r_count)\n\n\t\tmax_count = max(count, max_count)\t\t\n\n\treturn max_count\n\nif __name__ == \"__main__\":\n\t_ = input()\n\tcols = list(map(int, input().split(\" \")))\n\t\n\tprint(solution(cols))\n", "t=int(input())\r\nq=[]\r\na=list(map(int,input().split()))\r\nfor i in range(0,t):\r\n p=i\r\n z=0\r\n w=a[i]\r\n while(p>=0):\r\n #print(a[p],a[i])\r\n if(a[p]<=w):\r\n #print(z)\r\n z=z+1\r\n w=a[p]\r\n else:\r\n break\r\n p=p-1\r\n if(i+1==len(a)):\r\n q.append(z)\r\n break\r\n else:\r\n p=i+1\r\n w=a[i]\r\n while(p<=len(a)-1):\r\n if(a[p]<=w):\r\n z=z+1\r\n w=a[p]\r\n else:\r\n break\r\n p=p+1\r\n q.append(z)\r\nprint(max(q))\r\n", "n = int(input())\r\nterrain = input()\r\nterrain = terrain.split()\r\nnumber = []\r\nfor currentIndex in range(0, n):\r\n raining = 1\r\n if currentIndex == 0:\r\n while n-1 > currentIndex:\r\n if int(terrain[currentIndex]) >= int(terrain[currentIndex+1]):\r\n raining += 1\r\n currentIndex += 1\r\n else:\r\n break\r\n elif currentIndex != n-1:\r\n while n - 1 > currentIndex:\r\n if int(terrain[currentIndex]) >= int(terrain[currentIndex + 1]):\r\n raining += 1\r\n currentIndex += 1\r\n else:\r\n break\r\n currentIndex -= raining-1\r\n while currentIndex > 0:\r\n if int(terrain[currentIndex]) >= int(terrain[currentIndex - 1]):\r\n raining += 1\r\n currentIndex -= 1\r\n else:\r\n break\r\n else:\r\n while currentIndex > 0:\r\n if int(terrain[currentIndex]) >= int(terrain[currentIndex - 1]):\r\n raining += 1\r\n currentIndex -= 1\r\n else:\r\n break\r\n number.append(raining)\r\nprint(max(number))", "lenn = int(input())\r\nsections = [int(i) for i in input().split()]\r\nkokokoko = []\r\nfor i in range(len(sections)):\r\n meow = 1\r\n for j in range(i + 1, len(sections)):\r\n if sections[j - 1] >= sections[j]:\r\n meow += 1\r\n else:\r\n break\r\n kokokoko.append(meow)\r\nfor i in range(1, len(sections)):\r\n wooo = 0\r\n for j in range(i, len(sections)):\r\n if sections[-j] >= sections[-j - 1]:\r\n wooo += 1\r\n else:\r\n break\r\n kokokoko[-i] += wooo\r\nprint(max(kokokoko))", "def goright(li, index):\r\n curr = 0\r\n threshold = li[index]\r\n for i in range(index+1, len(li)):\r\n\r\n if li[i] <= threshold:\r\n curr += 1\r\n else:\r\n break\r\n threshold = li[i]\r\n # print(curr)\r\n return curr\r\n\r\n\r\ndef golift(li, index):\r\n curr = 0\r\n threshold = li[index]\r\n for i in range(index-1, -1, -1):\r\n if li[i] <= threshold:\r\n curr += 1\r\n else:\r\n break\r\n threshold = li[i]\r\n # print(curr)\r\n return curr\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n li = list(map(int, input().split()))\r\n max_num = 0\r\n for index, num in enumerate(li):\r\n current = 1\r\n current += goright(li, index)\r\n current += golift(li, index)\r\n if current > max_num:\r\n max_num = current\r\n\r\n print(max_num)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\ncount = 1\r\n\r\nfor i in range(n):\r\n curr_left = array[i]\r\n curr_right = array[i]\r\n c = 1\r\n for j in range(i - 1, -1, -1):\r\n if curr_left >= array[j]:\r\n c += 1\r\n curr_left = array[j]\r\n else:\r\n break\r\n for j in range(i + 1, n, +1):\r\n if curr_right >= array[j]:\r\n c += 1\r\n curr_right = array[j]\r\n else:\r\n break\r\n count = max(count, c)\r\n\r\nprint(count)", "n = int(input())\nk = [int(i) for i in input().split(\" \")]\nt = []\nfor i in range(n):\n o = -1;\n h = k[i]\n for j in range(i,n):\n if(k[j] <= h):\n h = k[j]\n o+=1\n else:\n break\n h = k[i]\n for j in range(i,-1,-1):\n if(k[j]<=h):\n h = k[j]\n o+=1\n else:\n break\n t.append(o)\nprint(max(t))", "n = int(input())\ns = list(map(int, input().split()))\nans = -1\n\ndef count(i):\n c = 0\n temp = i\n for j in range(i-1, -1, -1):\n if s[j] <= s[temp]:\n c += 1\n temp = j\n else:\n break\n temp = i\n for j in range(i, len(s)):\n if s[j] <= s[temp]:\n c += 1\n temp = j\n else:\n break\n return c\n\nfor i in range(len(s)):\n c = count(i)\n ans = c if c > ans else ans\n\nprint(ans)", "N = int(input())\r\nthing = list(map(int, input().split()))\r\ncurrentMax = 0\r\nfor x in range(len(thing)):\r\n\tscore = -1\r\n\tcurrent = thing[x]\r\n\tfor k in thing[x::-1]:\r\n\t\tif k <= current:\r\n\t\t\tscore += 1\r\n\t\t\tcurrent = k\r\n\t\telse:\r\n\t\t\tbreak\r\n\tcurrent = thing[x]\r\n\tfor j in thing[x:]:\r\n\t\tif j <= current:\r\n\t\t\tscore += 1\r\n\t\t\tcurrent = j\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif score > currentMax:\r\n\t\tcurrentMax = score\r\n\r\nprint(currentMax)\r\n", "#!/usr/bin/env python\nimport os\nimport sys\nfrom io import BytesIO, IOBase\n\nimport math\nimport bisect\nfrom math import gcd, floor, sqrt, log\nfrom bisect import bisect_left as bl, bisect_right as br\n\nsys.setrecursionlimit(100000000)\n\ninp = lambda: int(input())\nstrng = lambda: input()\njn = lambda x, l: x.join(map(str, l))\nstrl = lambda: list(input())\nmul = lambda: map(int, input().split())\nmulf = lambda: map(float, input().split())\nseq = lambda: list(map(int, input().split()))\n\nceil = lambda x: int(x) if (x == int(x)) else int(x) + 1\nceildiv = lambda x, d: x // d if (x % d == 0) else x // d + 1\n\nflush = lambda: sys.stdout.flush()\nstdstr = lambda: sys.stdin.readline()\nstdint = lambda: int(sys.stdin.readline())\nstdpr = lambda x: sys.stdout.write(str(x))\n\nmod = 1000000007\n\n\ndef main():\n n = inp()\n heights = seq()\n left = [1] * n\n right = [1] * n\n for i in range(1, n):\n if heights[i] >= heights[i - 1]:\n left[i] = left[i - 1] + 1\n for i in range(n - 2, -1, -1):\n if heights[i] >= heights[i + 1]:\n right[i] = right[i + 1] + 1\n\n ans = 0\n for i in range(n):\n ans = max(ans, left[i] + right[i] - 1)\n print(ans)\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())\r\nsec=list(map(int,input().split()))\r\ns,Min=0,[]\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\nelse:\r\n for i in range(n):\r\n left=sec[:i+1]\r\n right=sec[i:]\r\n one=left[0]\r\n for j in left[1:]:\r\n if j>=one:\r\n s+=1\r\n else:\r\n s=0\r\n one=j\r\n one=right[0]\r\n for j in right[1:]:\r\n \r\n if j<=one:\r\n s+=1\r\n else:\r\n break\r\n one=j\r\n \r\n Min.append(s+1)\r\n s=0\r\n print(max(Min))", "x = 0\r\nu = int(input())\r\ng = list(map(int,input().split()))\r\nfor i in range(len(g)): #i 起點\r\n m = 1\r\n # 往右流 range(起點, 末項, 間隔)\r\n for h in range(i+1, len(g)):\r\n if int(g[h]) <= int(g[h-1]):\r\n m += 1\r\n else: \r\n break\r\n # 往左流\r\n for h in range(i-1, -1, -1):\r\n if int(g[h]) <= int(g[h+1]):\r\n m += 1\r\n else: \r\n break\r\n x = max(x, m)\r\nprint(x)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nres = []\r\n\r\nfor i in range(n):\r\n temp = 1\r\n\r\n for j in range(i+1, n):\r\n if (arr[j] <= arr[j-1]):\r\n temp += 1\r\n else:\r\n break\r\n\r\n for j in range(i-1, -1, -1):\r\n if (arr[j] <= arr[j+1]):\r\n temp += 1\r\n else:\r\n break\r\n \r\n res.append(temp)\r\n\r\nprint(max(res))", "n=int(input())\r\na=list(map(int,input().split()))\r\nlen=0\r\nmax=0\r\nbreakpoint=0\r\nnewMaxima=False\r\nfor i in range(n):\r\n if i==0 or i==n-1:\r\n len+=1\r\n if i!=n-1 and a[i]>a[i+1]:\r\n breakpoint=len\r\n else:\r\n if a[i-1]>=a[i] and a[i+1]>a[i]:\r\n newMaxima=True\r\n len+=1\r\n if a[i]>a[i+1]:\r\n breakpoint=len\r\n if len>max:\r\n max=len\r\n if newMaxima:\r\n len=len-breakpoint\r\n breakpoint=0\r\n newMaxima=False\r\nprint(max) \r\n \r\n\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(n):\r\n cur = 1\r\n for j in range(i+1, n):\r\n if a[j] > a[j-1]: break\r\n else: cur += 1\r\n for j in range(i-1, -1, -1):\r\n if a[j] > a[j+1]: break\r\n else: cur += 1\r\n res = max(res, cur)\r\nprint(res)", "n=int(input())\r\nL=list(map(int,input().split()))\r\ni=0\r\nk=0\r\nj=0\r\ns=1\r\nlista=[]\r\nfor i in range(n):\r\n j=i\r\n k=i\r\n while j!=0 and L[j-1]<=L[j] :\r\n s+=1\r\n j-=1\r\n while k<n-1 and L[k+1]<=L[k]:\r\n s+=1\r\n k+=1\r\n lista.append(s)\r\n s=1\r\nprint(max(lista))", "n = int(input())\r\nnumbers = [int(i) for i in input().split()]\r\nmaximum = 0\r\nfor x in range(len(numbers)):\r\n l = x\r\n count_l = 0\r\n while l>0 and numbers[l]>=numbers[l-1]:\r\n count_l+=1\r\n l-=1\r\n r = x\r\n count_r = 0\r\n while r<len(numbers)-1 and numbers[r]>=numbers[r+1]:\r\n count_r+=1\r\n r+=1\r\n val = count_l+count_r+1\r\n if val>maximum:\r\n maximum = val\r\nprint(maximum)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 17 22:51:13 2019\n\n@author: mahmoud\n\"\"\"\n\nn= int( input())\n#string = \"1 2 3 4 5 6 7 8 9 10 11 100 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 1 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1\"\nl= list(map(int,input().split())) #list(map(int,string.split(\" \")))\n\n\n\n\ndef checkBefore(check,inCheck):\n \n \n l = list (lT)\n counter = 0\n while inCheck-1 >= 0: \n if check >= l[inCheck-1]:\n counter += 1\n \n del l[inCheck]\n \n check = l[inCheck-1]\n inCheck -= 1\n \n \n \n elif check < l[inCheck-1]:\n break\n \n return counter\n\n\ndef checkAfter(check,inCheck):\n \n \n l = list(lT)\n counter = 0\n while inCheck+1 < len(l): \n if check >= l[inCheck+1]:\n counter += 1\n \n del l[inCheck]\n \n check = l[inCheck]\n \n \n \n elif check < l[inCheck+1]:\n break\n \n return counter\n\n\ndef maximaList():\n \n counter = 0\n outputlist = []\n while counter < n:\n if counter == 0 and l[counter] >= l[counter+1]:\n outputlist.append(0)\n \n elif counter == n-1 and l[counter] >= l[counter-1]:\n outputlist.append(counter)\n \n elif 0 < counter < n-1 :\n if l[counter] >= l[counter+1] and l[counter] >= l[counter-1]:\n outputlist.append(counter)\n \n counter += 1\n \n return outputlist\n\n\nlT = tuple(l)\n\n\n\ndef output():\n \n output = []\n counter = 0\n if n == 1:\n return 1\n maxima = maximaList()\n while counter < len(maxima):\n inCheck = maxima[counter]\n check = l[inCheck]\n \n tempOutput = checkBefore(check, inCheck) + checkAfter(check, inCheck) + 1\n output.append(tempOutput)\n counter += 1\n output.sort()\n return int(output[-1])\n\nprint (output())\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=1\r\nfor i in range(len(a)):\r\n c=1\r\n d=a[i]\r\n for j in range(i-1,-1,-1):\r\n if d>=a[j]:\r\n c+=1\r\n d=a[j]\r\n else:\r\n break\r\n d=a[i]\r\n for j in range(i+1,len(a)):\r\n if d>=a[j]:\r\n c+=1\r\n d=a[j]\r\n else:\r\n break\r\n if c==len(a):\r\n m=n\r\n break\r\n elif c>m:\r\n m=c\r\nprint(m)", "\r\n\r\ndef solve():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n\r\n st = []\r\n prev = [0 for i in range(n)]\r\n for i in range(1 ,n):\r\n if l[i] >= l[i-1]:\r\n prev[i] = prev[i-1]\r\n else:\r\n prev[i] = i\r\n st = []\r\n nex = [n-1 for i in range(n)]\r\n for i in range(n-2, -1, -1):\r\n if l[i] >= l[i+1]:\r\n nex[i] = nex[i+1]\r\n else:\r\n nex[i] = i\r\n ans = 0\r\n for i in range(n):\r\n dist = (i-prev[i]) + (nex[i]-i) + 1\r\n # print(i, dist)\r\n if ans < dist:\r\n ans = dist\r\n print(ans)\r\n\r\nfor _ in range(1):\r\n solve()", "num = int(input())\r\narray = input().split(' ')\r\narray = list(map(int,array))\r\n\r\n\r\nmax_count = 1\r\nfor i in range(num):\r\n count = 1\r\n left = i-1\r\n right = i+1\r\n temp_left = array[i]\r\n temp_right = array[i]\r\n\r\n while left >=0 and array[left] <= temp_left:\r\n count +=1\r\n temp_left = array[left]\r\n left -=1\r\n \r\n while right < num and array[right]<= temp_right:\r\n count +=1\r\n temp_right = array[right]\r\n right +=1\r\n\r\n if count > max_count:\r\n max_count = count\r\n\r\nprint(max_count)", "def lm():return map(int,input().split())\r\ndef xd(): return int(input())\r\ndef ll():return list(map(int,input().split()))\r\n\r\nN = xd()\r\n\r\na = ll()\r\n\r\ni = 0\r\n\r\nmaxcount = 0\r\n\r\nfor j in range(len(a)):\r\n i = j\r\n count = 1\r\n peak = False\r\n while i < len(a) - 1:\r\n\r\n if (a[i] < a[i + 1]) :\r\n\r\n if (peak == True):\r\n break\r\n\r\n count +=1\r\n\r\n elif (a[i] == a[i + 1]):\r\n count +=1\r\n\r\n elif (a[i] > a[i + 1]):\r\n\r\n if (peak == False):\r\n peak = True\r\n\r\n if (peak == True):\r\n count +=1\r\n else :\r\n break\r\n\r\n i+=1\r\n\r\n if (count > maxcount):\r\n maxcount = count\r\n\r\nprint(maxcount)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nma=0\r\nfor i in range(n):\r\n c=1\r\n ii=i\r\n while ii:\r\n ii-=1\r\n if l[ii]>l[ii+1]:\r\n break\r\n else:\r\n c+=1\r\n ii=i\r\n while ii<n-1:\r\n ii+=1\r\n if l[ii-1]<l[ii]:\r\n break\r\n else:\r\n c+=1\r\n if c>ma:\r\n ma=c\r\nprint(ma)", "n = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nwet_section_span = []\r\nwet_section_rev = []\r\nfinal_list = []\r\n\r\nfor i in range(n):\r\n k = i\r\n wet_sections = 1\r\n for j in range(k+1,n):\r\n if j == k+1 and h[k] >= h[j]:\r\n wet_sections +=1\r\n k +=1\r\n else:\r\n break\r\n wet_section_span.append(wet_sections)\r\n\r\nh.reverse()\r\n\r\nfor i in range(n):\r\n k = i\r\n wet_sections = 0\r\n for j in range(k + 1, n):\r\n if j == k + 1 and h[k] >= h[j]:\r\n wet_sections += 1\r\n k += 1\r\n else:\r\n break\r\n wet_section_rev.append(wet_sections)\r\n\r\nwet_section_rev.reverse()\r\n\r\nfor i in range(n):\r\n final_list.append(wet_section_span[i] + wet_section_rev[i])\r\n\r\nprint(max(final_list))", "#!/usr/bin/python3\n\n\n# n, t = input().split(\" \")\n# a = input()\n# n = int(n)\n# t = int(t)\n# s = list(a)\n\n# while(t != 0):\n# for i in range(n-1):\n# if s[i] == 'B' and s[i+1] == 'G':\n# s[i] = 'G'\n# s[i + 1] = 'B'\n# t -= 1\n# break\n\n# print(\"\".join(s))\n\n# t = int(input()[2:])\n# s = input()\n# while t:\n# s = s.replace('BG', 'GB')\n# t -= 1\n# print(s)\n# print(s)\n\n# n = input\n# c = p = 0\n# for i in' '*int(n()):\n# s = n()\n# c += s != p\n# p = s\n# print(c)\n\n# s = input()\n# d = {\".\": \"0\", \"-.\": \"1\", \"--\": \"2\"}\n# s = s.replace(\"--\", \"2\")\n# s = s.replace(\"-.\", \"1\")\n# s = s.replace(\".\", \"0\")\n# print(s)\n\n# y = int(input())\n\n# while(len(set(str(y))) < 4):\n# y += 1\n\n# print(y)\n\n# for i in range(2):\n# o = \"\"\n# r = input().replace(\" \", \"\")\n# for j in r:\n# if int(j) % 2 == 0:\n# o += \"1\"\n# else:\n# o += \"0\"\n# print(o)\n\n# s = [[1]*5 for _ in range(5)]\n# for i in 1, 2, 3:\n# for j, v in zip((1, 2, 3), map(int, input().split())):\n# for k, d in (-1, 0), (1, 0), (0, -1), (0, 1), (0, 0):\n# s[i+k][j+d] += v\n# for i in 1, 2, 3:\n# for j in 1, 2, 3:\n# print(s[i][j] % 2, end='')\n# print()\n\n# s = input()\n# u = l = 0\n# for i in s:\n# if i.lower() == i:\n# l += 1s\n# else:\n# u += 1\n# if u == l or l > u:\n# s = s.lower()\n# elif u > l:\n# s = s.upper()\n\n# print(s)\n\n\n# n=int(input())\n# a=[*map(int,input().split())]\n# print(a)\n# b=a.index(max(a))+a[::-1].index(min(a))\n# print(b)\n# print(b-(b>=n))\n\n# def I(): return map(int, input().split())\n\n# n = int(input())\n# for _ in range(n):\n# i = int(input())\n# if i % 4 == 0:\n# print(\"YES\")\n# else:\n# print(\"NO\")\n\n# n = []\n# with open(\"sort.in\", 'r') as f:\n# l = f.read().strip('\\n').split(\" \")\n# nums = []\n# for i in l:\n# if \"\\n\" in i:\n# _, k = i.split(\"\\n\")\n# nums.append(int(k))\n# else:\n# nums.append(int(i))\n# n = sorted(nums)\n# print(n)\n\n\n# with open('sorted.txt', 'w') as d:\n# d.write(\"\\n\".join(str(i) for i in n))\n\n\n# a, b = map(int, input().split())\n# c = 0\n# while a <= b:\n# a *= 3\n# b *= 2\n# c += 1\n# print(c)\n\n\n# i = input\n# case = int(i())\n# for _ in range(case):\n# n, k = map(int, input().split())\n# a = {}\n# q = \"\"\n# for _ in range(n):\n# l = i()\n# q += l\n# for w in l.split():\n# if w not in a:\n# a[w] = 1\n# else:\n# a[w] += 1\n# for _ in range(k):\n# query = i()\n# if query in a:\n# print(q.count(query))\n# else:\n# print(0)\n\n# i = input\n# n = int(i())\n# c = 0\n# for _ in range(n):\n# if i().split().count('1') >= 2:\n# c += 1\n# print(c)\n\n# i = input()\n# v = input()\n# if i.lower() == v.lower():\n# print(\"0\")\n# else:\n# print(['1', '-1'][sorted(i, key=str.lower) > sorted(v, key=str.lower)]\n\n\nn = int(input())\na = list(map(int, input().split()))\n\nr = 0\nfor i in range(n):\n j = i\n while j+1 < n and a[j] <= a[j+1]:\n j += 1\n while j+1 < n and a[j] >= a[j+1]:\n j += 1\n r = max(r, j-i+1)\nprint(r)\n", "n = int(input())\r\nArr = list(map(int, input().split()))\r\n\r\nmax_water = 0\r\n\r\nfor sec in range(n):\r\n \r\n water = 0\r\n \r\n temp1 = Arr[sec]\r\n temp2 = Arr[sec]\r\n if sec!=(n-1):\r\n for i in range(sec+1, n):\r\n \r\n if Arr[i]<=temp1:\r\n water+=1\r\n temp1 = Arr[i]\r\n #print(\" a \", water)\r\n else:\r\n break\r\n if sec!=0:\r\n for j in range(sec-1,-1,-1):\r\n\r\n if Arr[j]<=temp2:\r\n water+=1\r\n temp2=Arr[j]\r\n #print(\" b \", water)\r\n else:\r\n break\r\n water+=1\r\n if water>max_water:\r\n max_water=water\r\n\r\nprint(max_water)", "'''input\r\n5\r\n1 2 1 2 1\r\n\r\n\r\n'''\r\nn = int(input())\r\nheights = [int(x) for x in input().split()]\r\n\r\nmax_area_covered = 0\r\nfor i in range(n):\r\n\tarea_covered = 1\r\n\tmax_height = heights[i]\r\n\r\n\t#forword check\r\n\tfor j in range(i+1, n):\r\n\t\tif heights[j] <= max_height:\r\n\t\t\tarea_covered += 1\r\n\t\t\tmax_height = heights[j] \r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\tmax_height = heights[i]\r\n\t#backword check\r\n\tfor j in range(i-1, -1, -1):\r\n\t\tif heights[j] <= max_height:\r\n\t\t\tarea_covered += 1\r\n\t\t\tmax_height = heights[j]\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\tmax_area_covered = max(area_covered, max_area_covered)\r\n\r\nprint(max_area_covered)", "n = int(input())\nar = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n low = i\n while low > 0 and ar[low - 1] <= ar[low]:\n low -= 1\n high = i\n while high < n - 1 and ar[high + 1] <= ar[high]:\n high += 1\n ans = max(ans, high - low + 1)\nprint(ans)\n", "\r\nn = int(input())\r\nvalues = list(map(int,input().split()))\r\n\r\n\r\ninc = [0]*n\r\ndec = [0]*n\r\n\r\n\r\nfor i in range(1,n):\r\n if values[i]>=values[i-1]:\r\n inc[i]= inc[i-1]+ 1\r\n else:\r\n inc[i] =0\r\nfor i in range(n-2,-1,-1):\r\n if values[i]>=values[i+1]:\r\n dec[i] = dec[i+1]+ 1\r\n else:\r\n dec[i] = 0\r\n \r\nmaxv = 0\r\nfor i in range(n):\r\n maxv = max(maxv,inc[i]+dec[i]+1)\r\n \r\nprint(maxv)\r\n\r\n", "x=int(input())\r\ny=list(map(int,input().split(\" \")))\r\n\r\nst=[]\r\ncounter=1\r\n\r\nfor i in range(len(y)):\r\n j=i+1\r\n k=i-1\r\n while(j<=len(y)-1 and y[j]<=y[j-1]):\r\n counter+=1\r\n j+=1\r\n \r\n while(k>=0 and y[k]<=y[k+1]):\r\n counter+=1\r\n k-=1\r\n st.append(counter)\r\n counter=1\r\n \r\nprint(max(x for x in st))\r\n\r\n\r\n\r\n\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 = [int(i) for i in input().split()]\r\nl = []\r\nfor i in range(n):\r\n c = 0\r\n j = i\r\n while (j>= 1 and arr[j-1] <= arr[j]):\r\n c = c + 1\r\n j = j - 1\r\n j = i\r\n while (j <= n - 2and arr[j+1] <= arr[j]):\r\n c = c + 1\r\n j = j + 1\r\n l.append(c + 1)\r\nprint(max(l))", "n = int(input())\nlst = list(map(int, input().split()))\nmax_so_far = 1\ncurr_max = 1\ncurr = lst[0]\nfor i, x in enumerate(lst[1:], start=1):\n if x <= curr:\n curr_max += 1\n else:\n curr_max = 1\n prev = x\n for j in range(i - 1, -1, -1):\n if prev >= lst[j]:\n curr_max += 1\n else:\n break\n prev = lst[j]\n if max_so_far < curr_max:\n max_so_far = curr_max\n curr = x\nprint(max_so_far)\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\ns = []\r\nfor a in range(0,n):\r\n k = 1\r\n #right\r\n for j in range(a,n-1):\r\n if l[j+1] > l [j]:\r\n break\r\n else:\r\n k+=1\r\n #left\r\n for j in range(a,0,-1):\r\n if l[j-1] > l [j]:\r\n break\r\n else:\r\n k+=1 \r\n s.append(k)\r\nprint(max(s))\r\n \r\n ", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\n\r\ndef UpDown(s,i,n):\r\n\tcnt = 1\t\r\n\twhile i<n-1 and s[i]<=s[i+1]:\r\n\t\tcnt+=1\r\n\t\ti+=1\r\n\twhile i<n-1 and s[i]>=s[i+1]:\r\n\t\tcnt+=1\r\n\t\ti+=1\r\n\treturn cnt\r\n\r\ndef DownUp(s,i,n):\r\n\tcnt = 1\t\r\n\twhile i<n-1 and s[i]>=s[i+1]:\r\n\t\tcnt+=1\r\n\t\ti+=1\r\n\treturn cnt\r\ncnt = 0\r\nd = []\r\nfor i in range(n):\r\n\tcnt = max(cnt,UpDown(s,i,n),DownUp(s,i,n))\r\n\r\nprint(cnt)", "# Online Python compiler (interpreter) to run Python online.\n# Write Python 3 code in this online editor and run it.\ndef leftside(arr,index):\n s=0\n for i in range(index,0,-1):\n if(arr[i]>=arr[i-1]):\n s=s+1\n else:\n break\n return s\n \ndef rightside(arr,index):\n s=0\n for i in range(index,len(arr)-1):\n if(arr[i]>=arr[i+1]):\n s=s+1\n else:\n break\n return s\n\nn1 = int(input())\narr = list(map(int, input().split()))\nmaxsub=1\ncurSum=0\ns1=0\ns2=0\ns=0\nfor i in range(0,len(arr)):\n s1=leftside(arr,i)\n s2=rightside(arr,i)\n s=s1+s2+1\n curSum=s\n maxsub=max(maxsub,curSum)\nprint(maxsub)\n \n\n \n ", "_, vals = input(), list(map(int, input().split(' ')))\n\nbest = 0\nfor i in range(len(vals)):\n cur = 1\n h = vals[i]\n for j in range(i-1, -1, -1):\n if vals[j] <= h:\n h = vals[j]\n cur += 1\n else:\n break\n\n h = vals[i]\n for k in range(i+1, len(vals)):\n if vals[k] <= h:\n h = vals[k]\n cur += 1\n else:\n break\n\n best = max(best, cur)\nprint(best)\n", "n = int(input())\r\nvals = list(map(int, input().split()))\r\nans=0\r\nfor i in range(n):\r\n s=0\r\n for x in range(i+1,n):\r\n if vals[x-1] >= vals[x]:\r\n s+=1\r\n else: break\r\n\r\n for x in range(i,0,-1):\r\n if vals[x] >= vals[x-1]:\r\n s+=1\r\n else: break\r\n\r\n if ans < s:\r\n ans = s\r\n \r\n\r\nprint(ans+1)", "n = int(input())\r\nk = list(map(int, input().split()))\r\nans = []\r\nfor i in range(n):\r\n a = 1\r\n r = i\r\n l = i\r\n while r+1 < n and k[r+1] <= k[r]:\r\n a += 1\r\n r += 1\r\n while l-1 >= 0 and k[l-1] <= k[l]:\r\n l -= 1\r\n a += 1\r\n ans.append(a)\r\n\r\nprint(max(ans))", "_ = input()\n\nheights = input().split()\nheights = map(int, heights)\nheights = list(heights)\n\ndef nle(l, n):\n nle1 = 0\n i = n-1\n try:\n while i >= 0 and l[i] <= l[i+1]:\n nle1 += 1\n i -= 1\n except:\n pass\n \n i = n+1\n try:\n while i < len(l) and l[i] <= l[i-1]:\n nle1 += 1\n i += 1\n except:\n pass\n\n return nle1 + 1\n\nnles = [0]*len(heights)\nfor i, _ in enumerate(heights):\n nles[i] = nle(heights, i)\nprint(max(nles))\n\n\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\nres = 0\r\nfor i in range(n):\r\n count = 1\r\n #backward\r\n for j in range(i-1, -1, -1):\r\n if arr[j] <= arr[j+1]:\r\n count += 1\r\n else:\r\n break\r\n #forward\r\n for j in range(i+1, n, 1):\r\n if arr[j] <= arr[j-1]:\r\n count += 1\r\n else:\r\n break\r\n res = max(res, count)\r\nprint(res)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr1=[]\r\nfor i in range(n):\r\n j=i\r\n cnt=0\r\n k=arr[i]\r\n while(j>-1 and k>=arr[j]):\r\n cnt+=1 \r\n k=arr[j]\r\n j-=1 \r\n j=i \r\n k=arr[i]\r\n while(j<n and k>=arr[j]):\r\n cnt+=1 \r\n k=arr[j]\r\n j+=1 \r\n arr1.append(cnt-1)\r\narr1=sorted(arr1)\r\nprint(arr1[-1])", "def main():\n n = int(input())\n lst = list(map(int, input().split()))\n\n left = [1] * n\n right = [1] * n\n\n for i in range(1, n):\n if lst[i] >= lst[i - 1]:\n left[i] = left[i - 1] + 1\n\n for i in range(n - 2, -1, -1):\n if lst[i] >= lst[i + 1]:\n right[i] = right[i + 1] + 1\n\n max_keyboards = 1\n for i in range(n):\n max_keyboards = max(max_keyboards, left[i] + right[i] - 1)\n\n print(max_keyboards)\n\nmain()\n\n \t\t \t \t \t \t \t \t \t\t \t \t \t\t", "def back(l,ind):\r\n cnt=0\r\n x=ind\r\n for i in range (ind,-1,-1):\r\n if x == 0 :\r\n break \r\n if l[x-1] <= l[x]:\r\n cnt= cnt +1 \r\n x-=1\r\n else :\r\n break\r\n return cnt\r\n\r\ndef forward(c,ind):\r\n cnt=0\r\n x=ind\r\n for i in range (ind+1,n) :\r\n if x == n-1 :\r\n break \r\n if c[x+1] <= c[x] :\r\n cnt+=1\r\n x+=1\r\n else :\r\n break\r\n return cnt\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nc=list(map(int,input().split()))\r\nns=[]\r\nfor i in range (n):\r\n cnt1=0\r\n cnt2=0\r\n if i == 0:\r\n cnt1=forward(c,i)+1\r\n ns.insert(i,cnt1)\r\n elif i==n-1 :\r\n cnt2=back(c,i)+1\r\n ns.insert(i,cnt2)\r\n \r\n else :\r\n cnt1=forward(c,i)+1\r\n cnt2=back(c,i)\r\n ns.insert(i,(cnt1+cnt2))\r\n \r\n\r\nprint(max(ns))", "from collections import defaultdict, Counter\nimport itertools as it\n\nn = int(input())\na = list(map(int, input().split()))\n\nres = 0\nfor at in range(n):\n l = at-1\n x = a[at]\n c = 0\n while l >= 0 and x >= a[l]:\n c += 1\n x = a[l]\n l -= 1\n\n r = at + 1\n x = a[at]\n while r < n and x >= a[r]:\n c += 1\n x = a[r]\n r += 1\n res = max(res, c)\n\nprint(res+1)\n\n# s1 = [0]*n\n# s2 = [0]*n\n\n# at = 0\n# while at < n:\n# if at + 1 >= n: break\n# d = 0\n# while at + 1 < n and a[at] <= a[at+1]:\n# at += 1\n# d += 1\n# s1[at] = d\n# at += 1\n\n# at = n-1\n# while at >= 0:\n# if at - 1 < 0: break\n# d = 0\n# while at - 1 >= 0 and a[at-1] >= a[at]:\n# at -= 1\n# d += 1\n# s2[at] = d\n# at -= 1\n\n# res = 1 + max([s1[i] + s2[i] for i in range(n)])\n\n# print(res)", "import sys\n\ndef main(cases):\n forward = [1]\n for i in range(1, len(cases)):\n if cases[i - 1] > cases[i]:\n forward.append(1)\n else:\n forward.append(1 + forward[-1])\n\n backward = [1]\n for i in range(len(cases) - 2, -1, -1):\n if cases[i + 1] > cases[i]:\n backward.append(1)\n else:\n backward.append(1 + backward[-1])\n backward.reverse()\n\n m = -float(\"inf\")\n for i in range(len(cases)):\n if i == 0:\n m = max(m, backward[0])\n elif i == len(cases) - 1:\n m = max(m, forward[-1])\n else:\n m = max(m, forward[i] + backward[i] - 1)\n print(m)\n\nif __name__ == \"__main__\":\n cases = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n continue\n cases = list(map(int, line.strip().split()))\n main(cases)\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n sum = 0\r\n index = i\r\n while (index >= 1 and arr[index-1] <= arr[index]):\r\n sum += 1\r\n index -= 1\r\n index = i\r\n while (index <= n-2 and arr[index+1] <= arr[index]):\r\n sum += 1\r\n index += 1\r\n a.append(sum+1)\r\nprint(max(a))\r\n", "n=int(input())\nm=list(map(int, input().split()))\na=0\nb=0\nc=0\nfor i in range(n):\n\ta=m[i]\n\tfor j in range(i):\n\t\tif m[i-j-1]<=a:\n\t\t\tc+=1\n\t\t\ta=m[i-j-1]\n\t\telse:\n\t\t\ta=m[i]\n\t\t\tbreak\n\ta=m[i]\n\tfor k in range(n-1-i):\n\t\tif m[i+k+1]<=a:\n\t\t\tc+=1\n\t\t\ta=m[i+k+1]\n\t\telse:\n\t\t\tbreak\n\tb=max(c,b)\n\tc=0\nprint(b+1)\n", "import 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\nn = inp()\r\nheights = inlt()\r\nmax = 0\r\nfor i in range(n):\r\n l = i\r\n r = i\r\n wet = 1\r\n \r\n while n - 1 > r and heights[r + 1] <= heights[r]:\r\n r += 1\r\n wet += 1\r\n \r\n while 0 < l and heights[l - 1] <= heights[l]:\r\n l -= 1\r\n wet += 1\r\n\r\n if wet > max:\r\n max = wet\r\n \r\nprint(max)", "n = int(input())\r\n\r\nsekcje = list(map(int, input().split(' ')))\r\nsekcje.insert(0, float(\"inf\"))\r\nsekcje.append(float('inf'))\r\n\r\nwynik = 0\r\nfor i in range (1,n+1):\r\n licznik = 1\r\n x = i\r\n while sekcje[x] >= sekcje[x+1]:\r\n x+=1\r\n licznik += (x-i)\r\n \r\n x = i\r\n while sekcje[x] >= sekcje[x-1]:\r\n x-=1\r\n licznik += (i-x)\r\n\r\n wynik = max(wynik, licznik)\r\n\r\nprint (wynik)\r\n", "a=[]\n\ndef find(n,index):\n\tright=0\n\tleft=0\n\trightref=a[index]\n\tleftref=a[index]\n\tfor i in range(index,n):\n\t\tif a[i] > rightref:\n\t\t\tbreak\n\t\telse:\n\t\t\tright+=1\n\t\t\trightref=min(rightref,a[i])\n\tfor i in range(index-1,-1,-1):\n\t\tif a[i] > leftref:\n\t\t\tbreak\n\t\telse:\n\t\t\tleft+=1\n\t\t\tleftref=min(leftref,a[i])\n\treturn right+left\nn=int(input())\na=[int(i) for i in input().split(' ')]\nc=0\nfor i in range(n):\n\tc=max(c,find(n,i))\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\na1=[0]*n\r\na2=[0]*n\r\nfor i in range(1,n):\r\n \r\n\tif a[i]>=a[i-1]:\r\n\t\ta1[i]=a1[i-1]+1\r\n\tif a[-i-1]>=a[-i]:\r\n\t\ta2[-i-1]=a2[-i]+1\r\n\r\nans=0\r\nfor i in range(n):\r\n\tans=max(a1[i]+a2[i],ans)\r\nprint(ans+1)\r\n", "def left(a,idx):\r\n c=0\r\n for i in range(idx,0,-1):\r\n if a[i-1]<=a[i]:\r\n c+=1\r\n else:\r\n break\r\n return c+1\r\ndef right(a,idx):\r\n d=0\r\n for i in range(idx,len(a)-1,1):\r\n if a[i+1]<=a[i]:\r\n d+=1\r\n else:\r\n break\r\n return d+1\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\nk=h=0\r\nfor i in range(n):\r\n if i==0:\r\n h=right(a,i)\r\n elif i==n-1:\r\n h=left(a,i)\r\n else:\r\n h=right(a,i)+left(a,i)-1\r\n if h>k:k=h\r\nprint(k)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\n\r\nmaxi=0\r\nfor i in range(n):\r\n cnt=1 \r\n bef=i\r\n while bef>0 and lst[bef-1]<=lst[bef]:\r\n bef-=1\r\n cnt+=1 \r\n aft=i\r\n while aft<n-1 and lst[aft+1]<=lst[aft]:\r\n aft+=1\r\n cnt+=1 \r\n maxi=max(cnt,maxi)\r\nprint(maxi)\r\n", "n = int(input())\nvalores = list(map(int, input().split()))\nvalores = [valores[0]+1] + valores + [valores[-1]+1]\n\nmaximo = 0 \n\nfor i in range(1, n+1):\n\tbl = valores[i]\n\tbr = valores[i]\n\tcl = 0\n\tcr = 0\n\tfor l in range(i-1, -1, -1):\n\t\tif valores[l] > bl:\n\t\t\tbreak\n\t\telse:\n\t\t\tcl += 1\n\t\t\tbl = valores[l] \n\tfor r in range(i+1, n+2):\n\t\tif valores[r] > br:\n\t\t\tbreak\n\t\telse:\n\t\t\tcr += 1\n\t\t\tbr = valores[r]\n\tmaximo = max(maximo, cl+cr+1)\n\nprint(maximo)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\nans2=[]\r\nfor t in range(n):\r\n i=t\r\n j=t+1\r\n p=0\r\n while j<len(l) and l[j]<=l[i]:\r\n p=p+1\r\n i=i+1\r\n j=j+1\r\n ans.append(p)\r\n\r\n i=t\r\n j=t-1\r\n p=0\r\n while j>-1 and l[j]<=l[i]:\r\n p=p+1\r\n i=i-1\r\n j=j-1\r\n ans2.append(p)\r\n \r\n#ans=ans[:-1]\r\n#ans2=ans2[1:]\r\n\r\n\r\n#print(ans,ans2)\r\nans3=[]\r\nfor i in range(len(ans)):\r\n ans3.append(ans[i]+ans2[i])\r\n\r\nprint(max(ans3)+1)\r\n", "n = int(input())\r\narr = list(map(int, input().strip().split()))\r\nlr = [0 for i in range(n)]\r\nrr = [0 for i in range(n)]\r\n\r\nfor i in range(1,n):\r\n if(arr[i] >= arr[i-1]):\r\n lr[i] = lr[i-1] + 1\r\n\r\nfor i in range(n-2,-1,-1):\r\n if(arr[i] >= arr[i+1]):\r\n rr[i] = rr[i+1] + 1\r\n\r\ntot = map(lambda x,y:x+y+1, lr,rr)\r\nprint(max(tot))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmax = 0\r\nfor i in range(n):\r\n dolava = 0\r\n doprava = 0\r\n k = i + 1\r\n prev = arr[i]\r\n while k < n:\r\n if arr[k] <= prev:\r\n doprava += 1\r\n prev = arr[k]\r\n else:\r\n break\r\n k += 1\r\n\r\n k = i - 1\r\n prev = arr[i]\r\n while k >= 0:\r\n if arr[k] <= prev:\r\n dolava += 1\r\n prev = arr[k]\r\n else:\r\n break\r\n k -= 1\r\n if doprava + dolava + 1 > max:\r\n max = doprava + dolava + 1\r\nprint(max)", "x=input()\r\nn=input().split()\r\nr=0\r\ns=0\r\narr=[]\r\nfor i in range(int(x)):\r\n if(i==0):\r\n r=i\r\n l=n[i]\r\n s=1\r\n else:\r\n if(int(n[i-1])<int(n[i])):\r\n s=2\r\n ind=i-1\r\n while(ind>0):\r\n if(int(n[ind])<int(n[ind-1])):\r\n break\r\n ind=ind-1\r\n s=s+1\r\n \r\n else:\r\n s=s+1\r\n \r\n arr.append(s)\r\n #print(s)\r\nprint(max(arr))", "def calculate_length(l):\r\n max_section = 1\r\n eguals = 0\r\n internal_counter = 1\r\n now_increase = True\r\n current_mointain = l[0]\r\n for i in range(1, len(l)):\r\n if now_increase:\r\n if current_mointain <= l[i]:\r\n internal_counter += 1\r\n else:\r\n internal_counter += 1\r\n now_increase = False\r\n else:\r\n if current_mointain > l[i]:\r\n internal_counter += 1\r\n eguals = 0\r\n elif current_mointain == l[i]:\r\n eguals += 1\r\n internal_counter += 1\r\n else:\r\n internal_counter = 1 + eguals + 1\r\n now_increase = True\r\n current_mointain = l[i]\r\n # print(l[i])\r\n # print(internal_counter)\r\n if max_section < internal_counter:\r\n max_section = internal_counter\r\n return max_section\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n print(calculate_length(a))\r\n\r\n\r\n\r\nmain_function()", "# find section to pour rain to optimize number of watered sections\r\n# iterate through each index of the heights array, keep spanning outwards with left and right pointers\r\n\r\nn = input()\r\nheights = list(map(int,input().split()))\r\n\r\n# n = 5\r\n# heights = [1,2,1,2,1]\r\n\r\nresult = 0\r\n\r\nfor i in range(len(heights)):\r\n curr = 1\r\n left, right = i - 1, i + 1\r\n # go left\r\n while left >= 0 and heights[left] <= heights[left + 1]:\r\n curr += 1\r\n left -= 1\r\n # go right\r\n while right < len(heights) and heights[right] <= heights[right - 1]:\r\n curr += 1\r\n right += 1\r\n result = max(result, curr)\r\n\r\nprint(result)\r\n \r\n\r\n\r\n", "N = int(input())\nblocks = list(map(int, input().split(' ')))\nleft = [0]\nright = [0]\nfor i in range(1, len(blocks)):\n if blocks[i]>=blocks[i-1]:\n left.append(left[-1]+1)\n else:\n left.append(0)\nfor j in range(len(blocks)-2, -1, -1):\n if blocks[j]>=blocks[j+1]:\n right.append(right[-1]+1)\n else:\n right.append(0)\nright.reverse()\nmax_water = float('-inf')\nfor i in range(len(left)):\n max_water = max(max_water, left[i]+right[i])\nprint(max_water+1)", "# 5 min rule \r\nn = int(input())\r\nheights = list(map(int,input().split()))\r\nmaximum = 0\r\nfor i in range(n):\r\n Count = 0 # \r\n\r\n increasing = False\r\n has_decreased = False # \r\n \r\n decreasing = False\r\n\r\n prev = heights[i]\r\n\r\n for j in range(i, n):\r\n if increasing == False and decreasing == False:\r\n if prev < heights[j]:\r\n increasing = True\r\n if prev > heights[j]:\r\n decreasing = True\r\n \r\n elif increasing:\r\n if prev > heights[j] and has_decreased == False:\r\n has_decreased = True\r\n elif has_decreased == True and prev < heights[j]:\r\n break\r\n\r\n else:\r\n if prev < heights[j]:\r\n break\r\n \r\n Count += 1 \r\n prev = heights[j]\r\n\r\n\r\n if Count > maximum:\r\n maximum = Count\r\nprint(maximum)\r\n\r\n# ", "#TRAPPING RAINWATER \r\n\r\nn = int(input())\r\nheight = list(map(int, input().split()))\r\nleft = [0] * n\r\nright = [0] * n\r\n\r\nfor i in range(1, n):\r\n left[i] = left[i - 1] + 1 if height[i] >= height[i - 1] else 0\r\n\r\nfor i in range(n - 2, -1, -1):\r\n right[i] = right[i + 1] + 1 if height[i] >= height[i + 1] else 0\r\n\r\nmaximal = 0\r\nfor i in range(n):\r\n if left[i] + right[i] + 1 > maximal:\r\n maximal = left[i] + right[i] + 1\r\n\r\nprint(maximal)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0 \r\nfor i in range(n):\r\n c = 1\r\n for j in range(i, 0, -1):\r\n if(l[j] >= l[j - 1]):\r\n c += 1 \r\n else:\r\n break \r\n for j in range(i, n - 1):\r\n if(l[j] >= l[j + 1]):\r\n c += 1 \r\n else:\r\n break \r\n ans = max(ans, c)\r\nprint(ans)", "n = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nbest = 1\r\nfor i in range(n):\r\n ct = 1\r\n for j in range(1, n):\r\n if i-j >= 0 and h[i-j] <= h[i-j+1]:\r\n ct += 1\r\n else:\r\n break\r\n for j in range(1, n):\r\n if i+j < n and h[i+j] <= h[i+j-1]:\r\n ct += 1\r\n else:\r\n break\r\n best = max(best, ct)\r\n\r\nprint(best)", "import sys\r\ninput = sys.stdin.readline\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ni=int(input())\r\nj=inlt()\r\nl=[]\r\nfor k in range(len(j)):\r\n c1=k-1\r\n c2=k+1\r\n ans=1\r\n while c1 >=0:\r\n if j[c1+1] >= j[c1]:\r\n ans+=1\r\n c1-=1\r\n else:\r\n break\r\n while c2 <=i-1:\r\n if j[c2-1]>=j[c2]:\r\n ans+=1\r\n c2+=1\r\n else:\r\n break\r\n \r\n l.append(ans)\r\n \r\nprint(max(l))\r\n", "n = int(input()) # Number of sections in the garden\r\nheights = list(map(int, input().split())) # Heights of the sections\r\n\r\nresult = 0 # Initialize the result to 0\r\n\r\n# Iterate through each section\r\nfor i in range(n):\r\n left_bound = right_bound = i # Initialize left and right bounds\r\n\r\n # Check left of the current section\r\n while left_bound > 0 and heights[left_bound - 1] <= heights[left_bound]:\r\n left_bound -= 1\r\n\r\n # Check right of the current section\r\n while right_bound < n - 1 and heights[right_bound + 1] <= heights[right_bound]:\r\n right_bound += 1\r\n\r\n # Calculate the distance the water will flow for this section\r\n distance = right_bound - left_bound + 1\r\n\r\n # Update the result if this section can hold more water\r\n result = max(result, distance)\r\n\r\nprint(result)\r\n\r\n\r\n\r\n\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n l = list(map(int , input().split()))\r\n pre_mx = 0\r\n for i in range(n):\r\n mx = 1\r\n for j in range(i-1, -1, -1):\r\n if l[j] <= l[j+1]:\r\n mx += 1\r\n else:\r\n break\r\n \r\n for j in range(i+1, n):\r\n if l[j] <= l[j-1]:\r\n mx += 1\r\n else:\r\n break\r\n \r\n if mx > pre_mx:\r\n pre_mx = mx\r\n print(pre_mx)", "n=int(input())\r\na=list(map(int,input().split()))\r\nsum=1\r\nfor i in range(n):\r\n l,r=i,i\r\n while(l-1>=0 and a[l]>=a[l-1]):\r\n l-=1\r\n while(r+1<n and a[r]>=a[r+1]):\r\n r+=1\r\n sum=max(sum,r-l+1)\r\nprint(sum)\r\n", "def leftp(arr,i):\r\n target=arr[i]\r\n flag=0\r\n count=0\r\n while i>=0 and flag==0:\r\n if arr[i]<=target:\r\n target=arr[i]\r\n count+=1\r\n else:\r\n flag=1\r\n break\r\n \r\n i-=1\r\n return count\r\n \r\n \r\ndef righp(arr,i):\r\n target=arr[i]\r\n flag=0\r\n count=0\r\n while i<len(arr) and flag==0:\r\n if arr[i]<=target:\r\n target=arr[i]\r\n count+=1\r\n else:\r\n flag=1\r\n break\r\n i+=1\r\n return count\r\n \r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(len(arr)):\r\n ans.append((righp(arr,i)-1+leftp(arr,i)-1)+1)\r\nprint(max(ans))\r\n", "n = int(input())\r\ncurr_count = 1\r\nmax_count = 1\r\n\r\nlevels = list(map(int , input().split()))\r\n\r\nfor i in range(n):\r\n curr_count = 1\r\n down_i = up_i = i\r\n while down_i > 0 and levels[down_i] >= levels[down_i - 1]:\r\n curr_count += 1\r\n down_i -=1 \r\n while up_i < n - 1 and levels[up_i] >= levels[up_i + 1]:\r\n curr_count +=1\r\n up_i+=1\r\n max_count = max(curr_count, max_count)\r\n \r\nprint(max_count)", "n=int(input())\r\na=list(map(int, input().split()))\r\ncnt=1\r\nlst = []\r\nfor i in range(n):\r\n cnt=1\r\n for j in range(i+1,n):\r\n if a[j]<=a[j-1]:\r\n cnt+=1\r\n else:\r\n break\r\n for j in range(i-1,-1,-1):\r\n if a[j]<=a[j+1]:\r\n cnt+=1\r\n else:\r\n break\r\n lst.append(cnt)\r\nprint(max(lst))", "\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nx = 0\r\nafter = 1\r\nbefore = 0\r\n\r\nrains = [0]*n\r\n\r\nwhile after < n and a[x] >= a[after]:\r\n rains[0]+=1\r\n x+=1\r\n after+=1\r\n\r\nfor i in range(1,n):\r\n x = i\r\n after = i+1\r\n before = i-1\r\n while before >= 0 and a[x] >= a[before]:\r\n rains[i]+=1\r\n x-=1\r\n before-=1\r\n x = i\r\n while after < n and a[x] >= a[after]:\r\n rains[i]+=1\r\n x+=1\r\n after+=1\r\n\r\nx = n-1\r\nbefore = n-2\r\n\r\nwhile before >= 0 and a[x] >= a[before]:\r\n a[n-1]+=1\r\n x-=1\r\n before-=1\r\nprint(max(rains)+1)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nans = 1\r\nfor i in range(n):\r\n l, r = i, i\r\n while l - 1 >= 0 and lst[l] >= lst[l - 1]:\r\n l -= 1\r\n while r + 1 < n and lst[r] >= lst[r + 1]:\r\n r += 1\r\n ans = max(ans, r - l + 1)\r\nprint(ans)", "n = int(input())\nt = [int(x) for x in input().split()]\nwt = [1] * n\nfor i in range(n):\n for j in range(i + 1, n):\n if t[j - 1] >= t[j]:\n wt[i] += 1\n else:\n break\nfor i in reversed(range(n)):\n for j in reversed(range(i)):\n if t[j+1] >= t[j]:\n wt[i] += 1\n else:\n break\nprint(max(wt))\n \t\t\t\t \t\t\t \t \t \t\t\t \t \t \t\t", "num = int(input())\r\narray = input().split(' ')\r\narray = list(map(int,array))\r\n\r\nmax_count = 1\r\nfor i in range(num):\r\n count = 1\r\n left = i-1\r\n right = i+1\r\n while left >=0 and array[left] <= array[left+1]:\r\n count +=1\r\n left -=1\r\n \r\n while right < num and array[right]<= array[right-1]:\r\n count +=1\r\n right +=1\r\n\r\n if count > max_count:\r\n max_count = count\r\n\r\nprint(max_count)", "import sys\r\ndef solve(L):\r\n i = 0 ; R=[]\r\n while i<len(L):\r\n x = 0\r\n j = i ; k = i ; pre = L[i]\r\n while(j>=0 and L[j]<=pre):\r\n pre = L[j]\r\n j-=1\r\n x+=1\r\n pre = L[i]\r\n while(k < len(L) and L[k]<=pre):\r\n pre = L[k]\r\n k+=1\r\n x+=1\r\n i+=1\r\n R.append(x-1)\r\n return(max(R))\r\nn = input()\r\nL = list(map(int,sys.stdin.readline().split(\" \")))\r\nprint(solve(L))", "# cook your dish here\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n\r\nn=int(I1())\r\na=list(I())\r\nM=0\r\nfor i in range(n):\r\n c,x=1,a[i] \r\n for j in range(i-1,-1,-1):\r\n if a[j]<=x: \r\n c+=1\r\n x=a[j]\r\n else: break\r\n x=a[i]\r\n for j in range(i+1,n):\r\n if a[j]<=x: \r\n c+=1 \r\n x=a[j]\r\n else: break\r\n M=max(M,c)\r\nprint(M)\r\n ", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nmx = 0\r\nfor i in range(n):\r\n j = i\r\n while j > 0 and li[j-1] <= li[j]:\r\n j -= 1\r\n \r\n s = i - j\r\n \r\n j = i\r\n while j < n - 1 and li[j+1] <= li[j]:\r\n j+=1\r\n \r\n s += j - i + 1\r\n mx = max(s, mx)\r\nprint(mx)", "n=int(input())\r\nh=list(map(int,input().rstrip().split()))\r\nma=0\r\nfor i in range (n):\r\n m=1\r\n for j in range (i+1,n):\r\n if h[j-1]>=h[j]:\r\n m+=1\r\n else:\r\n break\r\n\r\n for j in range (i-1,-1,-1):\r\n if h[j]<=h[j+1]:\r\n m+=1\r\n else:\r\n break\r\n ma=max(ma,m)\r\nprint(ma)", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\n\r\na,b = [0]*n , [0]*n\r\nfor i in range(1, n):\r\n if t[i] >= t[i - 1]: a[i] = a[i - 1] + 1\r\n if t[- i] <= t[- 1 - i]: b[- i - 1] = b[- i] + 1\r\nprint(max([a[i]+b[i]+1 for i in range(n)]))", "n = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nwet_section_span = []\r\nwet_section_rev = []\r\nfinal_list = []\r\n\r\nfor i in range(n):\r\n wet_sections = 1\r\n for j in range(n):\r\n if j == i+1:\r\n if h[i] >= h[j]:\r\n wet_sections +=1\r\n i +=1\r\n wet_section_span.append(wet_sections)\r\n\r\nh.reverse()\r\n\r\nfor i in range(n):\r\n wet_sections = 0\r\n for j in range(n):\r\n if j == i+1:\r\n if h[i] >= h[j]:\r\n wet_sections +=1\r\n i +=1\r\n wet_section_rev.append(wet_sections)\r\n\r\nwet_section_rev.reverse()\r\n\r\nfor i in range(n):\r\n final_list.append(wet_section_span[i] + wet_section_rev[i])\r\n\r\nprint(max(final_list))", "n = int(input())\nheights = list(map(int, input().split()))\n\nmax_watered_sections = 1\nfor i in range(0, len(heights)):\n watered = 1\n right = left = heights[i]\n right_index = left_index = i\n while right_index + 1 < len(heights) and heights[right_index + 1] <= right:\n watered += 1\n right = heights[right_index + 1]\n right_index += 1\n while left_index - 1 >= 0 and heights[left_index - 1] <= left:\n watered += 1\n left = heights[left_index - 1]\n left_index -= 1\n max_watered_sections = max(max_watered_sections, watered)\n\nprint(max_watered_sections)\n ", "import sys\n\nn = int(sys.stdin.readline())\n\ngs = list(map(int, sys.stdin.readline().split()))\n\nlf = [1] * n\nrg = [1] * n\n\nfor i in range(1, len(gs)):\n if gs[i] >= gs[i - 1]:\n lf[i] = lf[i - 1] + 1\n\nfor i in range(len(gs)-2, -1, -1):\n if gs[i] >= gs[i+1]:\n rg[i] = rg[i + 1] + 1 \n\nprint(max([lf[i] + rg[i] for i in range(len(gs))]) - 1)\n", "count = int(input())\n\nhigh = list(map(int, input().split(' ')))\nvalue = 0\nvalue_res = 0\n\nfor i in range(count):\n longer = high[i]\n j = i\n while j < count-1 :\n if longer > high[j+1]:\n value +=1\n longer = high[j+1]\n elif longer == high[j+1]:\n value += 1\n else:\n break\n j +=1\n\n longer = high[i]\n j = i\n while j > 0:\n if longer > high[j-1]:\n value +=1\n longer = high[j-1]\n elif longer == high[j-1]:\n value += 1\n else:\n break\n j -=1\n if value+1 > value_res:\n value_res = value+1\n value = 0\nprint(value_res)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ncm = 0\r\nfor i in range(n):\r\n j = i + 1\r\n c = 1\r\n while j < n and a[j] <= a[j-1]:\r\n j += 1\r\n c += 1\r\n j = i - 1\r\n while j >= 0 and a[j] <= a[j+1]:\r\n j -= 1\r\n c += 1\r\n if c > cm:\r\n cm = c\r\nprint(cm)\r\n", "t=input()\r\nt=int(t)\r\n\r\nA=[int(x) for x in input().split()]\r\n\r\nsize=len(A)\r\n\r\nL=[0 for i in range(len(A))]\r\nR=[0 for i in range(len(A))]\r\n\r\nfor i in range(1,len(A)):\r\n if A[i]>=A[i-1]:\r\n L[i]+=L[i-1]+1\r\n if A[size-i-1]>=A[size-i]:\r\n R[size-i-1]+=R[size-i]+1\r\n\r\nmaxima=0\r\n#print(L,R)\r\nfor i in range(len(A)):\r\n maxima=max(maxima,L[i]+R[i])\r\n\r\nprint(maxima+1)\r\n ", "def right(i, li, n):\r\n\tind = i\r\n\twhile True:\r\n\t\tif ind == n - 1:\r\n\t\t\tbreak\r\n\r\n\t\tif li[ind] >= li[ind + 1]:\r\n\t\t\tind += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\treturn ind - i\r\n\r\ndef left(i, li, n):\r\n\tind = i\r\n\twhile True:\r\n\t\tif ind == 0:\r\n\t\t\tbreak\r\n\r\n\t\tif li[ind] >= li[ind - 1]:\r\n\t\t\tind -= 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\treturn i - ind\r\n\r\ndef main():\r\n\tn = int(input())\r\n\ta = list(map(int, input().split()))\r\n\r\n\tans = 0\r\n\r\n\tans = max(ans, 1 + right(0, a, n))\r\n\tans = max(ans, 1 + left(n - 1, a, n))\r\n\r\n\tfor i in range(1, n - 1):\r\n\t\tans = max(ans, 1 + right(i, a, n) + left(i, a, n))\r\n\r\n\tprint(ans)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nr,l = [0]*n,[0]*n\r\nfor i in range(1,n):\r\n if lst[i]>=lst[i-1]:\r\n r[i] = r[i-1]+1\r\n if lst[-i-1] >= lst[-i]:\r\n l[-i-1] = l[-i]+1\r\nprint(1+max(map(sum,zip(r,l))))\r\n", "input()\r\nsections = list(map(int, input().split()))\r\nmin_sec = min(sections)\r\n\r\nmax_value = 1\r\nfor index, section in enumerate(sections):\r\n left_index = index - 1\r\n current_height = section\r\n sections_count = 1\r\n while left_index >= 0 and current_height >= sections[left_index]:\r\n current_height = sections[left_index]\r\n sections_count += 1\r\n left_index -= 1\r\n\r\n right_index = index + 1\r\n current_height = section\r\n while right_index < len(sections) and current_height >= sections[right_index]:\r\n current_height = sections[right_index]\r\n sections_count += 1\r\n right_index += 1\r\n if sections_count > max_value:\r\n max_value = sections_count\r\n\r\nprint(max_value)\r\n", "n= int(input())\r\narr= list(map(int, input().split()))\r\nres = []\r\ncur = 0\r\nup= True\r\ndown =True\r\n\r\nupval =0\r\ndownval = 0\r\ncurmax = 0\r\ncount = 0\r\nfor i in range(n):\r\n val = arr[i]\r\n pre_val = val\r\n count = 1\r\n for x in range(i+1, n):\r\n xval = arr[x]\r\n if xval<=pre_val:\r\n count+=1\r\n else:\r\n break\r\n pre_val = xval\r\n pre_val = val\r\n for x in range(i-1, -1, -1):\r\n xval = arr[x]\r\n if xval<=pre_val:\r\n count+=1\r\n else:\r\n break\r\n pre_val = xval\r\n res.append(count)\r\n count = 0\r\n\r\nprint(max(res))\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()))\nm = 0\nfor i in range(n):\n c = 1\n j = i-1\n while j >= 0:\n if a[j+1] >= a[j]:\n c += 1\n else:\n break\n j -= 1\n\n j = i+1\n\n while j < n:\n if a[j-1] >= a[j]:\n c += 1\n else:\n break\n j += 1\n\n m = max(m, c)\n c = 1\nprint(m)", "n = int(input())\r\nl=list(map(int, input().split()))\r\na=[]\r\nfor i in range(n):\r\n c=0\r\n j=i\r\n while(j<n-1 and l[j+1]<=l[j]):\r\n j=j+1\r\n c=c+1\r\n j=i\r\n while(j>0 and l[j-1]<=l[j])\t:\r\n j=j-1\r\n c=c+1\r\n a.append(c)\r\nprint(max(a)+1)\t", "n = int(input())\r\nw = list(map(int,input().split()))\r\nmaxm=1\r\nfor i in range(n):\r\n count=1\r\n l=i\r\n r=i\r\n while l-1>=0 and w[l]>=w[l-1]:\r\n l-=1\r\n count+=1\r\n while r+1<n and w[r]>=w[r+1]:\r\n r+=1\r\n count+=1\r\n maxm = max(count,maxm)\r\n\r\nprint(maxm)\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=0\r\nfor i in range(len(l)):\r\n c=0\r\n for j in range(i,len(l)-1):\r\n if l[j]>=l[j+1]:\r\n c+=1\r\n else:\r\n break\r\n\r\n \r\n for j in range(i,0,-1):\r\n if l[j-1]<=l[j]:\r\n c+=1\r\n else:\r\n break\r\n\r\n m=max(m,c)\r\nprint(m+1)", "n = int(input())\r\nhights = list(map(int, input().split()))\r\n\r\nmaxScore = 1\r\nfor i in range(n):\r\n score = 1\r\n j = i\r\n while(j < n-1 and hights[j] >= hights[j+1]):\r\n score += 1\r\n j += 1\r\n j = i\r\n while(j > 0 and hights[j] >= hights[j-1]):\r\n score += 1\r\n j -= 1\r\n if (score > maxScore):\r\n maxScore = score\r\nprint(maxScore)\r\n", "from sys import stdin\r\n\r\ndef get_data(n,heights):\r\n max_rained = 0\r\n for cont in range(n):\r\n pos = cont\r\n max_reainde = 1\r\n while(True):\r\n if pos > n-2:\r\n break\r\n if heights[pos] >= heights[pos+1]:\r\n max_reainde += 1\r\n pos += 1\r\n else:\r\n break\r\n pos = cont\r\n while(True):\r\n if pos == 0:\r\n break\r\n if heights[pos] >= heights[pos-1]:\r\n max_reainde += 1\r\n pos -= 1\r\n else:\r\n break\r\n if max_reainde > max_rained:\r\n max_rained = max_reainde\r\n return max_rained\r\n \r\ndef main():\r\n n = int(stdin.readline())\r\n heights = [int(x) for x in stdin.readline().split()]\r\n print(get_data(n,heights))\r\n\r\nmain()\r\n", "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 = int(read())\r\n heights = [int(i) for i in read().split()]\r\n idx_to_l = {}\r\n idx_to_r = {}\r\n length = 0\r\n max_value_seen = float('inf')\r\n for i, val in enumerate(heights):\r\n # Not monotonically increasing\r\n if val < max_value_seen:\r\n max_value_seen = val\r\n length = 1\r\n idx_to_l[i] = 0\r\n else:\r\n idx_to_l[i] = length\r\n length += 1\r\n max_value_seen = val\r\n\r\n length = 0\r\n max_value_seen = float('inf')\r\n for i in range(len(heights) - 1, -1, -1):\r\n val = heights[i]\r\n # Not monotonically increasing\r\n if val < max_value_seen:\r\n max_value_seen = val\r\n length = 1\r\n idx_to_r[i] = 0\r\n else:\r\n idx_to_r[i] = length\r\n length += 1\r\n max_value_seen = val\r\n\r\n max_value = 0\r\n for i in range(len(heights)):\r\n max_value = max(max_value, idx_to_l[i] + 1 + idx_to_r[i])\r\n print(max_value)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "def solve(curr_index):\r\n watered_sections = 1\r\n\r\n # Simulate flow to the left\r\n for i in range(curr_index-1, -1, -1):\r\n if heights_list[i] <= heights_list[i+1]:\r\n watered_sections += 1\r\n else:\r\n break\r\n\r\n # Simulate flow to the right\r\n for i in range(curr_index+1, n):\r\n if heights_list[i] <= heights_list[i-1]:\r\n watered_sections += 1\r\n else:\r\n break\r\n\r\n return watered_sections\r\n\r\nn = int(input())\r\nheights_list = list( map( int, input().split()[:n] ) )\r\nresult = 0\r\nfor i in range(n):\r\n watered_sections_for_current_i = solve(i)\r\n result = max(result, watered_sections_for_current_i)\r\n\r\nprint(result)\r\n", "t=1\r\nfor _ in range(t):\r\n n=int(input())\r\n ar=list(map(int,input().split()))\r\n co=1\r\n ans=0\r\n for x in range(n):\r\n i=x-1\r\n j=x+1\r\n ans=max(co,ans)\r\n co=1\r\n while i>-1 and j<n:\r\n if ar[i]<=ar[min(i+1,n-1)]:\r\n co+=1\r\n i-=1\r\n else:\r\n break\r\n if ar[j]<=ar[max(0,j-1)]:\r\n co+=1\r\n j+=1\r\n else:\r\n break\r\n while j<n:\r\n if ar[j]<=ar[max(0,j-1)]:\r\n co+=1\r\n j+=1\r\n else:\r\n break\r\n while i>-1:\r\n if ar[i]<=ar[min(i+1,n-1)]:\r\n co+=1\r\n i-=1\r\n else:\r\n break\r\n ans=max(ans,co) \r\nprint(ans) ", "#%% \r\ninput()\r\n\r\nins = list(map(int, input().split(\" \")))\r\n\r\nmx = 0\r\nfor i in range(len(ins)): \r\n counter = i\r\n count = 1\r\n while counter > 0 and ins[counter] >= ins[counter-1]:\r\n count += 1\r\n counter -= 1\r\n counter = i\r\n while counter < len(ins)-1 and ins[counter] >= ins[counter + 1]:\r\n count += 1\r\n counter += 1\r\n \r\n if mx < count: mx = count\r\n\r\nprint(mx)", "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 \nn = ri()\naa= rl()\nbest = 0\nfor i in range(n):\n\tcurrent = 1\n\tj = i\n\twhile j - 1 >= 0 and aa[j-1] <= aa[j]:\n\t\tj -= 1\n\t\tcurrent +=1\n\tj = i\n\twhile j +1 <n and aa[j +1 ] <= aa[j]:\n\t\tj += 1\n\t\tcurrent += 1\n\tbest = max(best, current)\nprint(best)\n\n\n", "\r\nn = int(input())\r\nh = list(map(int,input().split()))\r\nls = [0 for x in range(n)]\r\nls_r = [1 for x in range(n)]\r\n# Right check\r\nfor i in range(n-2,-1,-1):\r\n\tif h[i]>=h[i+1]:\r\n\t\tls_r[i]+=ls_r[i+1]\r\n# Left check\r\nls_l = [1 for x in range(n)]\r\nfor i in range(1,n):\r\n\tif h[i]>=h[i-1]:\r\n\t\tls_l[i]+=ls_l[i-1]\r\n\r\nfor i in range(n):\r\n\tls[i] = ls_l[i]+ls_r[i]-1\r\nprint(max(ls))", "# ip = open(\"testdata.txt\", \"r\")\n\n# def input():\n# \treturn ip.readline().strip()\n\nn = int(input())\narr = list(map(int, input().split()))\n\nmx = 1\n\nfor i in range(n):\n\tmx_len = 1\n\t\n\tfor j in range(i-1, -1, -1):\n\t\tif arr[j] > arr[j+1]:\n\t\t\tmx_len += i - j - 1\n\t\t\tbreak\n\telse:\n\t\tmx_len += i\n\t\n\tfor j in range(i+1, n):\n\t\tif arr[j] > arr[j-1]:\n\t\t\tmx_len += j - i - 1\n\t\t\tbreak\n\telse:\n\t\tmx_len += n - i - 1\n\tmx = max(mx, mx_len)\nprint(mx)\n\n", "num=int(input())\r\nH=list(map(int,input().split()))\r\nl=list()\r\nfor i in range(num):\r\n sum1 = 1\r\n sum2 = 0\r\n\r\n for c in range(i, num - 1):\r\n if H[c] >= H[c + 1]:\r\n sum1 += 1\r\n else:\r\n break\r\n\r\n for k in range(i,0,-1):\r\n if H[k] >= H[k - 1]:\r\n sum2 += 1\r\n else:\r\n break\r\n\r\n l.append(sum1 + sum2)\r\nprint(max(l))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# LUOGU_RID: 113176364\nn = int(input())\r\ngraph = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n ret = 0\r\n mn = graph[i]\r\n for j in range(i, -1, -1):\r\n if mn >= graph[j]:\r\n ret += 1\r\n mn = graph[j]\r\n else:\r\n break\r\n mn = graph[i]\r\n for j in range(i + 1, n):\r\n if mn >= graph[j]:\r\n mn = graph[j]\r\n ret += 1\r\n else:\r\n break\r\n ans = max(ret, ans)\r\nprint(ans)", "n=int(input())\r\nseq=list(map(int,input().split()))\r\nc=1\r\nans=0\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n print(2)\r\nelse:\r\n for i in range(n):\r\n #print(\"seq[i]=\",seq[i])\r\n c=1\r\n if i==0:\r\n for j in range(i+1,n):\r\n if seq[j]<=seq[j-1]:\r\n c+=1\r\n else:break\r\n if c>ans:\r\n ans=c\r\n elif i==n-1:\r\n for k in range(i,0,-1):\r\n if seq[k-1]<=seq[k]:\r\n c+=1\r\n else:break\r\n if c>ans:\r\n ans=c\r\n else: \r\n for j in range(i+1,n):\r\n if seq[j]<=seq[j-1]:\r\n c+=1\r\n else:\r\n break\r\n \r\n for k in range(i,0,-1):\r\n if seq[k-1]<=seq[k]:\r\n c+=1\r\n else:break\r\n #print(c)\r\n if c>ans:\r\n ans=c\r\n \r\n \r\n print(ans)\r\n", "nb_of_tower = int(input())\r\ntowers = list(map(int, input().split()))\r\n\r\nreached = [1 for _ in range(nb_of_tower)]\r\n\r\nfor t in range(1, nb_of_tower):\r\n if towers[t] >= towers[t - 1]:\r\n reached[t] += reached[t - 1]\r\n\r\nfor t in list(reversed(range(0, nb_of_tower - 1))):\r\n if towers[t] > towers[t + 1]:\r\n reached[t] += reached[t + 1]\r\n elif towers[t] == towers[t + 1]:\r\n reached[t] = reached[t + 1]\r\n\r\nmax_v = float(\"-inf\")\r\nfor i in reached:\r\n max_v = max(max_v, i)\r\n\r\nprint(max_v)\r\n", "n=int(input())\r\nmx=0\r\narr=list(map(int, input().split()))\r\ncurr = 0\r\nwhile(curr<n):\r\n before, after = curr-1, curr+1\r\n while(before>=0 and arr[before]<=arr[before+1]):\r\n before-=1\r\n while(after<n and arr[after]<=arr[after-1]):\r\n after+=1\r\n mx=max(mx, after-before-1)\r\n curr+=1\r\nprint(mx) ", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n c=i\r\n while c+1<n and l[c]<=l[c+1]: \r\n c+=1\r\n while c+1<n and l[c]>=l[c+1]: \r\n c+=1\r\n ans = max(c-i+1,ans)\r\nprint(ans)", "R = lambda: map(int, input().split())\r\nL = lambda: list(R())\r\nn,=R()\r\nl=L()\r\nmaxx = 0\r\nfor i in range(n) :\r\n\tans = 0\r\n\tprev = l[i]\r\n\tfor x in range(i,-1,-1):\r\n\t\tif l[x] <= prev :\r\n\t\t\tans+=1\r\n\t\t\tprev = l[x]\r\n\t\telse :break\r\n\tprev = l[i]\r\n\tfor y in range(i,n) :\r\n\t\tif l[y] <= prev :\r\n\t\t\tans+=1\r\n\t\t\tprev = l[y]\r\n\t\telse : break\r\n\tmaxx = max(maxx , ans)\r\nprint(maxx-1)\r\n\r\n", "n = int(input())\r\nh = [int(x) for x in input().split()]\r\n\r\nm = 0\r\nfor i, v in enumerate(h):\r\n c = 0\r\n p = 1001\r\n for lh in reversed(h[0:i]):\r\n if lh > v: break\r\n if p < 1001 and lh > p: break\r\n c += 1\r\n p = lh\r\n \r\n p = 1001\r\n for rh in h[i:len(h)]:\r\n if rh > v: break\r\n if p < 1001 and rh > p: break\r\n c += 1\r\n p = rh\r\n m = max(m, c)\r\n\r\nprint(m)", "n=int(input())\r\nl=[int(ele) for ele in input().split()]\r\nans=[]\r\nfor i in range(len(l)):\r\n count=1\r\n if i!=0:\r\n for j in range(i,0,-1):\r\n if l[j]>=l[j-1]:count+=1;continue\r\n else:break\r\n if i!=(len(l)-1):\r\n for j in range(i+1,n):\r\n if l[j]<=l[j-1]:count+=1;continue\r\n else:break\r\n ans.append(count)\r\n \r\nprint(max(ans))", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nmp = {}\r\nfor i in range(n):\r\n lef = i-1\r\n rig = i+1\r\n num = 1\r\n while lef >= 0:\r\n if lst[lef] <= lst[lef+1]:\r\n num+=1\r\n lef-=1\r\n else:\r\n break\r\n while rig < n:\r\n if lst[rig] <= lst[rig-1]:\r\n num+=1\r\n rig+=1\r\n else:\r\n break\r\n mp[i] = num\r\nprint(max(mp.values()))\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nres = 0\r\nfor i in range(n):\r\n k = 0\r\n j = i\r\n while j > 0:\r\n if l[j] < l[j - 1]:\r\n break\r\n else:\r\n k += 1\r\n j -= 1\r\n j = i\r\n while j < n - 1:\r\n if l[j] < l[j + 1]:\r\n break\r\n else:\r\n k += 1\r\n j += 1\r\n res = max(res, k)\r\nprint(res + 1)\r\n", "import sys\n\n# fin = open('input.txt')\n\ninput = sys.stdin.readline #fin.readline\n\nn = int(input().strip())\n\nnums = list(map(int, input().strip().split(' ')))\n\nmax_count = -1\n\nfor i, x in enumerate(nums):\n\tcount = 1\n\n\tleft = i - 1\n\tright = i + 1\n\n\twhile left >= 0 and nums[left] <= nums[left + 1]:\n\t\tcount += 1\n\t\tleft -= 1\n\n\twhile right <= len(nums) - 1 and nums[right] <= nums[right - 1]:\n\t\tcount += 1\n\t\tright += 1\n\n\tmax_count = max(count, max_count)\n\nprint(max_count)\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\n\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n count = 0\r\n height = arr[i]\r\n current_height = height\r\n for j in reversed(range(0, i)):\r\n if arr[j] > current_height:\r\n break\r\n current_height = arr[j]\r\n count += 1\r\n current_height = height\r\n for j in range(i, n):\r\n if arr[j] > current_height:\r\n break\r\n current_height = arr[j]\r\n count += 1\r\n if count > res:\r\n res = count\r\n\r\nprint(res)", "n = int(input())\r\nmainList = list(map(int, input().strip().split()))\r\nleftList = [0] * n\r\nrightList = [0] * n\r\nfor i in range(1,n):\r\n\tif mainList[i]>=mainList[i-1]:\r\n\t\tleftList[i] = leftList[i-1] +1\r\nfor i in range(n-2,-1,-1):\r\n\tif mainList[i]>=mainList[i+1]:\r\n\t\trightList[i] = rightList[i+1] +1\r\nprint(1+max([leftList[i] + rightList[i] for i in range(n)]))\r\n", "n = int(input())\r\nif n==1:\r\n input()\r\n print(1)\r\n exit()\r\nbuilding = list(map(int, input().split()))\r\nm = 0\r\ni = 0\r\nwhile i<n:\r\n count = 1\r\n j = i-1\r\n while j>-1 and building[j]<=building[j+1]:\r\n count, j = count+1, j-1\r\n j = i+1\r\n while j<n and building[j]<=building[j-1]:\r\n count, j = count+1, j+1\r\n m = max(m, count)\r\n i += 1\r\nprint(m)\r\n", "n=int(input())\r\nmaxi=0 \r\nl=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n curr=l[i]\r\n a=i-1 \r\n b=i+1 \r\n cnt=1 \r\n prev=curr\r\n while a>=0 and l[a]<=prev:\r\n cnt+=1\r\n prev=l[a]\r\n a-=1 \r\n prev=curr \r\n while b<n and l[b]<=prev:\r\n cnt+=1 \r\n prev=l[b]\r\n b=b+1 \r\n if cnt>maxi:\r\n maxi=cnt \r\n ind=i \r\nprint(maxi)\r\n ", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\nn = inp()\nheights = list(invr())\n\nleft = [0] * n\nright = [0] * n\n\nstack = [] # monotonic increasing stack - stores i\nfor i in range(n):\n if stack and heights[stack[-1]] > heights[i]:\n stack = []\n left[i] = len(stack)\n stack.append(i)\n\nstack = []\nfor i in range(n-1, -1, -1):\n if stack and heights[stack[-1]] > heights[i]:\n stack = []\n right[i] = len(stack)\n stack.append(i)\n\nmx = -1\nfor i in range(n):\n mx = max(mx, left[i] + right[i] + 1)\nprint(mx)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer\r\n return(int(input()))\r\ndef inlt(): # list of integer\r\n return(list(map(int,input().split())))\r\ndef insr(): # string\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # multiple integer variables\r\n return(map(int,input().split()))\r\n \r\nn = inp()\r\ntiles = inlt()\r\nmax = 0\r\nfor index in range(n): \r\n l = index\r\n r = index\r\n \r\n while r != n-1 and tiles[r+1] <= tiles[r]:\r\n r+=1 \r\n while l != 0 and tiles[l-1] <= tiles[l]:\r\n l-=1\r\n if r - l + 1 > max:\r\n max = r - l + 1 \r\nprint(max)", "n = int(input())\narr = list(map(int, input().split(' ')))\nlow = [0 for _ in range(n)]\n\ncurr, cnt = 0, 0\nfor i in range(n):\n if arr[i] < curr:\n cnt = 0\n low[i] = cnt\n curr = arr[i]\n cnt += 1\n\ncurr, cnt = 0, 0\nfor i in reversed(range(n)):\n if arr[i] < curr:\n cnt = 0\n low[i] += cnt\n curr = arr[i]\n cnt += 1\n\nprint(max(low)+1)", "\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\n\r\ndef rain(arr,n, index):\r\n counter = 1\r\n lindex = index - 1\r\n rindex = index + 1 \r\n currentL = arr[index]\r\n currentR = arr[index]\r\n while(lindex >= 0):\r\n \r\n if arr[lindex] <= currentL:\r\n counter += 1\r\n currentL = arr[lindex]\r\n lindex -= 1\r\n \r\n else:\r\n break\r\n \r\n \r\n while(rindex < n):\r\n if arr[rindex] <= currentR:\r\n counter += 1\r\n currentR = arr[rindex]\r\n rindex += 1 \r\n \r\n\r\n else:\r\n break\r\n\r\n \r\n return counter \r\n \r\n \r\nmax_rain = rain(arr,n, 0)\r\nfor i in range(1,n):\r\n r = rain(arr,n, i) \r\n if r > max_rain:\r\n max_rain = r\r\n \r\nprint(max_rain)\r\n \r\n \r\n", "n = int(input())\nA = [int(x) for x in input().split()]\n\ndp1 = [1] * n\ndp2 = [1] * n\n\nfor i in range(1, n):\n if A[i] >= A[i-1]:\n dp1[i] = dp1[i-1] + 1\n\nfor i in range(n-2, -1, -1):\n if A[i] >= A[i+1]:\n dp2[i] = dp2[i+1] + 1\n\nans = 0\nfor i in range(n):\n ans = max(ans, dp1[i]+dp2[i])\nprint(ans-1)\n", "import sys\r\nfrom copy import copy\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nIarr = lambda: list(map(int,input().split()))\r\n\r\ndef main():\r\n n = int(input())\r\n arr = Iarr()\r\n ans = []\r\n for i,x in enumerate(arr):\r\n tmp = 0\r\n cek = copy(x)\r\n #print(f\"============{x}=============\")\r\n for k in range(i,-1,-1):\r\n if(arr[k]<=cek):\r\n #print(arr[k])\r\n tmp+=1\r\n cek = arr[k]\r\n else:\r\n break\r\n\r\n cek = copy(x)\r\n for k in range(i+1,n):\r\n if(arr[k]<=cek):\r\n #print(arr[k])\r\n tmp+=1\r\n cek = arr[k]\r\n else:\r\n break\r\n ans.append(tmp)\r\n print(max(ans))\r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nls = list(map(int,input().split()))\r\nres=0\r\nfor i,val in enumerate(ls):\r\n l=i-1\r\n r=i+1\r\n while l>=0 and ls[l]<=ls[l+1]:\r\n l-=1\r\n \r\n while r<n and ls[r]<=ls[r-1]:\r\n r+=1\r\n res=max(res,(i-l) + ((r-1)-i))\r\n\r\nprint(res)", "# http://codeforces.com/contest/66/problem/B\n\n\n# def find_max_right(i, heights, rights):\n# \tif rights[i] != None:\n# \t\treturn rights[i]\n# \tmy_max = 1 + find_max_right(i+1, heights, rights) if (i < len(heights)-1 and heights[i+1] <= heights[i]) else 1\n# \trights[i] = my_max\n# \treturn my_max\n\n# def find_max_left(i, heights, lefts):\n# \tif lefts[i] != None:\n# \t\treturn lefts[i]\n# \tmy_max = 1 + find_max_left(i-1, heights, lefts) if (i > 0 and heights[i-1] <= heights[i]) else 1\n# \tlefts[i] = my_max\n# \treturn my_max\n\n# def find_max(i, heights, rights, lefts):\n# \treturn find_max_right(i, heights, rights) + find_max_left(i, heights, lefts) - 1\n\n\n# input()\n# # heights = [int(n) for n in input().split()]\n\n# rights = [None for n in heights]\n# lefts = [None for n in heights]\n\n# _max = 0\n\n# for i, height in enumerate(heights):\n# \ti_max = find_max(i, heights, rights, lefts)\n# \t_max = max(_max, i_max)\n\n# print(_max)\n\ndef empty_stack(stack, arr):\n\tpopped = 0\n\twhile len(stack):\n\t\ti = stack.pop()\n\t\tarr[i] = popped \n\t\tpopped += 1\n\ninput()\nheights = [int(n) for n in input().split()]\nrights = [None for n in heights]\nlefts = [None for n in heights]\n\nright_s = list()\nfor i, h in enumerate(heights):\n\tif rights[i] != None:\n\t\tcontinue\n\tright_s.append(i)\n\tif i == len(heights) - 1 or heights[i+1] > heights[i]:\n\t\tempty_stack(right_s, rights) \n\nleft_s = list()\nfor i, h in enumerate(reversed(heights)):\n\ti = len(heights) - 1 - i\n\tif lefts[i] != None:\n\t\tcontinue\n\tleft_s.append(i)\n\tif i == 0 or heights[i-1] > heights[i]:\n\t\tempty_stack(left_s, lefts)\n\ng_max = 0\nfor i in range(len(heights)):\n\tg_max = max(g_max, (lefts[i] + 1 + rights[i]))\n\nprint(g_max)", "# 1 2 1 1 1 3 3 4 \r\n\r\n# is index i greater than or equal to the one in its RHS?\r\n# if yes add 1 to the arr1[i+1] .. which is the sum of the RHS element\r\n# arr1 =[0,3,2,1,0,1,0,0]\r\n\r\n# is index i greater than equal or to the one in its RHS?\r\n# if yes add 1 to the arr1[i-1] .. which is the sum of the RHS element\r\n# arr2 =[0,1,0,1,2,3,4,5]\r\n\r\n# arr3[0,4,2,2,2,4,4,5]\r\n\r\n\r\nn=int(input())\r\n# height = [int(num) for num in input().split(\" \", n-1)]\r\nheight = list(map(int, input().split()))\r\n\r\nleftCount=[0]*n\r\nrightCount=[0]*n\r\n\r\nfor i in range(n):\r\n if i ==0 or height[i]< height[i-1]:\r\n leftCount[i]=0\r\n else: # height[i]>= height[i-1]\r\n leftCount[i]=leftCount[i-1]+1\r\n\r\n RHSn=n-1-i\r\n if RHSn==n-1 or height[RHSn]<height[RHSn+1]:\r\n rightCount[RHSn]=0\r\n else:\r\n rightCount[RHSn]=rightCount[RHSn+1]+1\r\n\r\ntotal=[]\r\nfor (item1, item2) in zip(leftCount, rightCount):\r\n total.append(item1+item2)\r\nprint(max(total)+1)", "num = input()\r\nsec = list(map(int, input().split(' ')))\r\nans = 0\r\ndef check(index):\r\n total = 1\r\n #print(sec[index])\r\n for i in range(len(sec)):\r\n #print(i)\r\n if index-i-1 < 0:\r\n break\r\n if sec[index-i-1] <= sec[index-i]:\r\n #print(i)\r\n total = total +1\r\n else:\r\n break\r\n for i in range(len(sec)):\r\n #print(i)\r\n if index+i+1 > len(sec)-1:\r\n break\r\n if sec[index+i+1] <= sec[index+i]:\r\n total = total + 1\r\n else:\r\n break\r\n return total\r\n\r\nanslist = []\r\nfor i in range(len(sec)):\r\n anslist.append(check(i))\r\nprint(max(anslist))\r\n#print(anslist)\r\n#print(check(0))\r\n", "# B 66 - Petya and Countryside - Codeforces\r\n# Link : https://codeforces.com/contest/66/problem/B\r\n\r\n\r\nnumberOfSections = int(input())\r\n\r\nheights = list(map(int, input().split()))\r\n\r\nnumberOfWateredSections = 0\r\n\r\nmaxNumberOfWateredSections = 0\r\n\r\nfor i in range(numberOfSections):\r\n # i = 0\r\n numberOfWateredSections = 1\r\n for j in range(i+1, numberOfSections):\r\n # print(numberOfWateredSections)\r\n # print(f'j = { j}, j-1 = { j-1}')\r\n if heights[j] <= heights[j-1]:\r\n # print(f'true :{ heights[j]} <= {heights[j-1]:}')\r\n numberOfWateredSections += 1\r\n else:\r\n break\r\n\r\n for j in range(i, -1, -1):\r\n # print(numberOfWateredSections)\r\n # print(f'j = { j}, j-1 = { j-1}')\r\n if heights[j] >= heights[j-1] and j != 0:\r\n # print(\"fsdsdf\")\r\n # print(f'true : { heights[j]} <= {heights[j-1]:}')\r\n numberOfWateredSections += 1\r\n else:\r\n break\r\n # print(numberOfWateredSections)\r\n if numberOfWateredSections > maxNumberOfWateredSections:\r\n maxNumberOfWateredSections = numberOfWateredSections\r\n\r\n\r\nprint(maxNumberOfWateredSections)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nsections = []\r\nst = 0\r\nmax_len = -1\r\nfor i in range(1,n+1):\r\n if i != n and A[i] >= A[i-1]:\r\n continue\r\n else:\r\n section = (st,i-1)\r\n section_len = section[1]-section[0] + 1\r\n for j in range(section[1]+1,n+1):\r\n if j!=n and A[j] <= A[j-1]:\r\n section_len += 1\r\n else:\r\n max_len = max(max_len,section_len)\r\n break\r\n st = i\r\n\r\n\r\nprint(max_len)", "def left_recursion(m, L, result=0):\r\n if not m or not (L[m] >= L[m-1]):\r\n return result\r\n return left_recursion(m-1, L, result + 1)\r\n\r\n\r\ndef right_recursion(m, L, n, result=0):\r\n if m == n - 1 or not (L[m] >= L[m+1]):\r\n return result\r\n return right_recursion(m+1, L, n, result + 1)\r\n\r\n\r\nn = int(input())\r\nL = list(map(int, input().split()))\r\nMin = min(L)\r\nMax = max(L)\r\nif Min == Max:\r\n print(n)\r\n import sys\r\n sys.exit(0)\r\nmax_sum = 0\r\nfor i in range(n):\r\n if L[i] != Min:\r\n tmp = left_recursion(i, L) + right_recursion(i, L, n) + 1\r\n if tmp > max_sum:\r\n max_sum = tmp\r\nprint(max_sum)\r\n\r\n", "def solve():\r\n length = int(input())\r\n tiles = list(map(int,input().split()))\r\n maxAns = 0\r\n for index in range(length):\r\n lb = False\r\n rb = False\r\n l , r = index , index\r\n while (not lb or not rb):\r\n if (l-1 >= 0):\r\n if tiles[l-1] > tiles[l]:\r\n lb = True\r\n else:\r\n lb = True\r\n\r\n if (r+1) < length:\r\n if tiles[r+1] > tiles[r]:\r\n rb = True\r\n else:\r\n rb = True\r\n \r\n if not lb: l -= 1\r\n if not rb: r += 1\r\n else:\r\n maxAns = max(r-l + 1 , maxAns)\r\n\r\n print(maxAns)\r\n \r\n \r\nsolve()", "def max_length_subarray(l):\r\n n = len(l)\r\n left_counts = [0] * n\r\n right_counts = [0] * n\r\n\r\n # Calculate counts of elements to the left of each element\r\n for i in range(1, n):\r\n if l[i] >= l[i - 1]:\r\n left_counts[i] = left_counts[i - 1] + 1\r\n\r\n # Calculate counts of elements to the right of each element\r\n for i in range(n - 2, -1, -1):\r\n if l[i] >= l[i + 1]:\r\n right_counts[i] = right_counts[i + 1] + 1\r\n\r\n max_length = 0\r\n for i in range(n):\r\n max_length = max(max_length, left_counts[i] + right_counts[i] + 1)\r\n\r\n return max_length\r\n\r\nn = int(input())\r\nlist1 = list(map(int, input().split()))\r\nresult = max_length_subarray(list1)\r\nprint(result)\r\n", "t=int(input())\r\narr=[int (i) for i in input().split()]\r\nhighest=0\r\nfor i in range(t):\r\n lefti=righti=i\r\n lsum=rsum=0\r\n while(True):\r\n if lefti>0:\r\n if arr[lefti-1]<=arr[lefti]:\r\n lsum+=1\r\n lefti-=1\r\n else:\r\n break\r\n else:\r\n break\r\n \r\n while(True):\r\n if righti<t-1:\r\n if arr[righti+1]<=arr[righti]:\r\n rsum+=1\r\n righti+=1\r\n else:\r\n break\r\n else:\r\n break\r\n\r\n if (highest<lsum+rsum+1):\r\n highest=lsum+rsum+1\r\n \r\nprint(highest)", "length = int(input())\narray = input().split(\" \")\nmax_spots = 0\nspots = 0\ni = 0\nleft = i - 1\nright = i + 1\naccess_left = 1\naccess_right = 1\nwhile i < length:\n if (left >= 0) and access_left:\n if int(array[left]) <= int(array[left+1]):\n spots += 1\n left -= 1\n else:\n access_left = 0\n else:\n access_left = 0\n if (right < length) and access_right:\n if int(array[right]) <= int(array[right-1]):\n spots += 1\n right += 1\n else:\n access_right = 0\n else:\n access_right = 0\n if (not access_right) and (not access_left):\n i = right\n right = i + 1\n left = i - 1\n access_left = 1\n access_right = 1\n max_spots = max(max_spots, spots)\n spots = 0\nprint(max_spots+1)\n \t \t\t\t \t\t \t \t \t\t\t\t\t", "def max_eau(liste):\r\n liste_res = []\r\n for j in range(len(liste)):\r\n res=1\r\n gauche = True\r\n droite = True\r\n for k in range(1, len(liste)):\r\n if j-k >= 0:\r\n if liste[j-k]<=liste[j-k+1] and gauche:\r\n res += 1\r\n else:\r\n gauche = False\r\n if j+k < len(liste):\r\n if liste[j+k]<=liste[j+k-1] and droite:\r\n res += 1\r\n else:\r\n droite = False\r\n liste_res.append(res)\r\n print(max(liste_res))\r\n\r\nrectangles = int(input())\r\nliste = [int(x) for x in input().split()]\r\nmax_eau(liste)\r\n \r\n \r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = []\r\nfor i in range(n):\r\n tmp = 0\r\n t = l[i]\r\n for j in l[i::-1]:\r\n if j <= t:\r\n tmp+=1\r\n t = j\r\n else:\r\n break\r\n t = l[i]\r\n for k in l[i::]:\r\n if k <= t:\r\n tmp += 1\r\n t = k\r\n else:\r\n break\r\n s.append(tmp)\r\nprint(1 if n==1 else max(s, default=0)-1)\r\n", "from sys import stdin,stdout\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\nmod = 1000000007\r\n\r\nn = ii1()\r\narr = iia()\r\nans = float(\"-inf\")\r\nfor i in range(n):\r\n cur = arr[i]\r\n j = i - 1\r\n res = 1\r\n while j >= 0 and arr[j] <= arr[j+1]:\r\n res += 1\r\n j -= 1\r\n j = i + 1\r\n while j < n and arr[j] <= arr[j-1]:\r\n res += 1\r\n j += 1\r\n ans = max(ans, res)\r\nprint(ans)\r\n \r\n ", "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\n# for test in range(int(input())):\r\nn = int(input())\r\nlst = tuple(read())\r\nans = 1\r\nfor i in range(1, n):\r\n j = i\r\n m = 1\r\n while j < n and lst[j] >= lst[j - 1]:\r\n m += 1\r\n j += 1\r\n while j < n and lst[j] <= lst[j - 1]:\r\n m += 1\r\n j += 1\r\n ans = max(ans, m)\r\nprint(ans)\r\n", "# import sys\n\n# sys.stdout = open('output.txt', 'w')\n# sys.stdin = open('input.txt', 'r')\n\ndef solve():\n n = int(input())\n a = [int(x) for x in input().split()]\n\n res = 0\n\n for i in range(n):\n ct1, ct2 = 0, 0\n left = i\n right = i\n \n # How many to the left?\n while left-1 >= 0 and a[left] >= a[left-1]:\n left -= 1\n ct1 += 1\n \n # How many to the right?\n while right+1 < n and a[right] >= a[right+1]:\n right += 1\n ct2 += 1\n\n res = max(res, ct1+ct2+1)\n \n print(res)\n\nt = 1\n# t = int(input())\n\nwhile t > 0:\n solve()\n t -= 1", "n=int(input())\r\nxx=input()\r\nx=xx.split(' ')\r\na=[]\r\nfor i in x:\r\n\ta.append(int(i))\r\nmaxi = -1\r\nfor i in range(n):\r\n\tl = i\r\n\tr = i\r\n\tj=l-1\r\n\twhile j>=0:\r\n\t\tif a[j] <= a[j + 1]:\r\n\t\t\tl=j\r\n\t\telse:\r\n\t\t\tbreak\r\n\t\tj-=1\r\n\r\n\tfor j in range(r+1,n):\r\n\t\tif a[j] <= a[j - 1]:\r\n\t\t\t\tr = j\r\n\t\telse:\r\n\t\t\tbreak\r\n\tmaxi = max(maxi, r - l + 1)\r\nprint(maxi)\r\n", "# Wadea #\r\n\r\nn = int(input())\r\narr = list(map(int,input().split())) \r\narray = []\r\nif n == 1:\r\n print(1)\r\nelse:\r\n for j in range(n):\r\n c = -1\r\n m = 0\r\n l = j\r\n while arr[l] <= arr[j]:\r\n c += 1\r\n if arr[l] < arr[j]:\r\n m = 1\r\n l -= 1\r\n if l < 0:\r\n break\r\n if arr[l] == arr[j] and m == 1:\r\n break\r\n if arr[l] > arr[l+1]:\r\n break\r\n m = 0\r\n l = j\r\n while arr[l] <= arr[j]:\r\n c += 1\r\n if arr[l] < arr[j]:\r\n m = 1\r\n l += 1\r\n if l == n:\r\n break\r\n if arr[l] == arr[j] and m == 1:\r\n break\r\n if arr[l] > arr[l-1]:\r\n break\r\n array.append(c)\r\n c = 0\r\n print(max(array))\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\n\r\nmaxscount = 0 \r\nfor i in range(n):\r\n index = i \r\n count = 1 \r\n left = i - 1\r\n right = i + 1 \r\n leftflag = 0 \r\n rightflag = 0 \r\n \r\n while left >= 0:\r\n if leftflag == 0 :\r\n leftmost = arr[index]\r\n leftflag = 1 \r\n if arr[left] > leftmost:\r\n break\r\n count += 1 \r\n if arr[left] < leftmost:\r\n leftmost = arr[left]\r\n left -= 1 \r\n \r\n while right < n:\r\n if rightflag == 0 :\r\n rightmost = arr[index]\r\n rightflag = 1 \r\n \r\n if arr[right] > rightmost:\r\n break \r\n count += 1 \r\n if arr[right] < rightmost:\r\n rightmost = arr[right]\r\n \r\n right += 1 \r\n #print(count)\r\n if count > maxscount:\r\n maxscount = count \r\nprint(maxscount)\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\nl=[]\r\nfor i in range(n):\r\n\tc=1\r\n\tk=a[i]\r\n\tfor j in range(i-1,-1,-1):\r\n\t\tif a[j]<=k:\r\n\t\t\tc+=1\r\n\t\t\tk=a[j]\r\n\t\telse:\r\n\t\t\tbreak\r\n\tk=a[i]\r\n\tfor j in range(i+1,n):\r\n\t\tif a[j]<=k:\r\n\t\t\tk=a[j]\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tl.append(c)\r\nprint(max(l))\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nans = 1\r\nfor i in range(len(nums)):\r\n count = 1\r\n j = i\r\n while j+1<n and nums[j]>=nums[j+1]:\r\n j+=1\r\n count +=1\r\n\r\n j = i\r\n while j-1>-1 and nums[j]>=nums[j-1]:\r\n j-=1\r\n count+=1\r\n ans = max(ans, count)\r\n\r\n\r\nprint(ans)", "n = int(input())\n\na = list(map(int, input().split()))\n\nanswers = []\nfor i in range(0,n):\n count = 1\n j = i+1\n if (j < n):\n while (a[j] <= a[j-1]):\n count += 1\n j += 1\n if (j >= n):\n break\n \n j = i - 1\n if (j >= 0):\n while (a[j] <= a[j+1]):\n count += 1\n j -= 1\n if (j < 0):\n break\n \n answers.append(count)\n\nprint(max(answers))\n\n", "n = int(input())\r\nlist1 = list(map(int, input().strip().split()))\r\nleftList = []\r\nrightList = []\r\nfor i in range(n):\r\n leftList.append(1)\r\n rightList.append(0)\r\nfor i in range(n-2, -1, -1):\r\n if list1[i]>=list1[i+1]:\r\n rightList[i] = rightList[i+1] + 1\r\nfor i in range(1, n):\r\n if list1[i]>=list1[i-1]:\r\n leftList[i] = leftList[i-1] + 1\r\nmaxi = rightList[0] + leftList[0]\r\nfor i in range(1, n):\r\n if maxi<rightList[i] + leftList[i]:\r\n maxi = rightList[i] + leftList[i]\r\nprint(maxi)", "\r\n# Problem: B. Petya and Countryside\r\n# Contest: Codeforces - Codeforces Beta Round #61 (Div. 2)\r\n# URL: https://codeforces.com/contest/66/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\n \r\narr = get_ints()\r\n \r\n# max = max(arr)\r\nbiggest = 0\r\n \r\nfor idx,max in enumerate(arr):\r\n sum = 0\r\n smallest = max\r\n for i in arr[idx:]:\r\n \r\n if i > smallest:\r\n break\r\n smallest = i\r\n sum += 1\r\n \r\n smallest = max\r\n for i in arr[:idx][::-1]:\r\n if i > smallest:\r\n break\r\n smallest = i\r\n sum += 1\r\n if sum > biggest:\r\n biggest = sum\r\nprint(biggest)", "from sys import stdin, setrecursionlimit, stdout\n#from collections import deque\n#from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\n#from heapq import heapify, heappop, heappush, heapreplace, heappushpop\n#from bisect import bisect_right, bisect_left\n\n#setrecursionlimit(100000) #use \"python\" instead of \"pypy\" to avoid MLE\n\ndef ii(): return int(stdin.readline())\ndef fi(): return float(stdin.readline())\ndef mi(): return map(int, stdin.readline().split())\ndef fmi(): return map(float, stdin.readline().split())\ndef li(): return list(mi())\ndef si(): return stdin.readline().rstrip()\ndef lsi(): return list(si())\nmod=1000000007\nres=['NO', 'YES']\n\n#######################################################################################\n########################### M Y F U N C T I O N S ###########################\n#######################################################################################\n\n\n\n#######################################################################################\n########################### M A I N P R O G R A M ###########################\n#######################################################################################\n\n\ntest, test_case=0, 1\n#test_case=ii()\nwhile test<test_case:\n test+=1\n\n #print('Case #', test, ':', sep='')\n\n n=ii()\n a=[1001]+li()+[1001]\n ans=0\n for i in range(1, 1+n):\n s=0\n for j in range(i, n+1):\n if a[j]>=a[j+1]:\n s+=1\n else:\n break\n for j in range(i, 0, -1):\n if a[j]>=a[j-1]:\n s+=1\n else:\n break\n ans=max(ans, s)\n print(ans+1)\n \t \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()]\r\n\r\nf = 1\r\nfor i in range(len(l)):\r\n vl, vr = True, True\r\n c = 1\r\n left, right = i,i\r\n\r\n while vl:\r\n if left > 0 and l[left] >= l[left-1]:\r\n c += 1\r\n left -= 1\r\n # print(\"left increased\")\r\n else:\r\n vl = False\r\n # print(\"left stopped\" + \" \" + str(left))\r\n while vr:\r\n if right < n-1 and l[right] >= l[right+1]:\r\n c += 1\r\n right += 1\r\n # print(\"right increased\")\r\n else:\r\n vr = False\r\n # print(\"right stopped\" + \" \" + str(right))\r\n if c > f:\r\n f = c\r\n # print(f\"--index {i} is done!\")\r\n \r\nprint(f)\r\n", "n = int(input())\nl = list(map(int,input().split()))\n\ns = 1\n\nfor i in range(len(l)):\n c = 1\n j = k = i\n while j<len(l)-1 and l[j+1] <= l[j]:\n c += 1 \n j += 1\n while k>0 and l[k-1] <= l[k]:\n c += 1\n k -= 1\n s = max(s, c)\n\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jan 17 20:38:27 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = list(map(int,input().split()))\r\nsoma = 0\r\n\r\n\r\ni = n-1\r\n\r\nfor i in range(n):\r\n e = 0\r\n d = 0\r\n k = i-1\r\n t = i+1\r\n while k>=0 and s[k]<=s[k+1]:\r\n e+=1\r\n k-=1\r\n while t<=n-1 and s[t]<=s[t-1]:\r\n d+=1\r\n t+=1\r\n if e+d+1>soma:\r\n soma = e+d+1\r\nprint(soma)\r\n\r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\nar=list(map(int,input().split()))\r\nans=1\r\nfor i in range(n):\r\n l,r=i,i\r\n while(l-1>=0 and ar[l]>=ar[l-1]):\r\n l-=1\r\n while(r+1<n and ar[r]>=ar[r+1]):\r\n r+=1\r\n ans=max(ans,r-l+1)\r\nprint(ans)", "n = int(input())\nh = list(map(int, input().rstrip().split()))\n\nans = 0\nfor i in range(n):\n x = h[i]\n t = 1\n for j in range(i-1, -1, -1):\n if h[j] <= x and h[j] <= h[j + 1]:\n t += 1\n else:\n break\n for j in range(i + 1, n):\n if h[j] <= x and h[j] <= h[j - 1]:\n t += 1\n else:\n break\n ans = max(ans, t)\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = -float(\"inf\")\r\nfor i in range(n):\r\n\tj,k,cnt = i+1,i-1,0\r\n\tt1, t2 = a[i], a[i]\r\n\twhile j<n:\r\n\t\tif(a[j]>t1): break\r\n\t\tt1=a[j]; cnt+=1;j+=1\r\n\twhile k>=0:\r\n\t\tif(a[k]>t2): break\r\n\t\tt2=a[k]; cnt+=1; k-=1\r\n\tans = max(ans,cnt)\r\nans+=1\r\nprint(ans)", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n max_count = 0\r\n for i in range(n):\r\n count = 1\r\n k = i\r\n\r\n \r\n for j in range(i - 1, -1, -1):\r\n if a[j] <= a[k]:\r\n count += 1\r\n else:\r\n break\r\n k -= 1\r\n\r\n k = i\r\n\r\n \r\n for j in range(i + 1, n):\r\n if a[j] <= a[k]:\r\n count += 1\r\n else:\r\n break\r\n k += 1\r\n\r\n max_count = max(max_count, count)\r\n\r\n print(max_count)\r\n\r\nif __name__ == \"__main__\":\r\n main()\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\nacc=0\r\nfor i in range(n):\r\n accsmall = 1\r\n last =arr[i] \r\n for m in range(i+1,n):\r\n if arr[m]<=last:\r\n last = arr[m]\r\n accsmall+=1\r\n else:\r\n break\r\n last=arr[i]\r\n for j in range(i-1,-1,-1):\r\n if arr[j]<=last:\r\n last = arr[j]\r\n accsmall+=1\r\n else:\r\n break\r\n if accsmall>acc:acc = accsmall\r\nprint(acc)", "n = int(input())\r\nf = list(map(int,input().strip().split()))[:n]\r\ns = []\r\nx = 0\r\n\r\nfor i in range(0,n): \r\n temp = f[i]\r\n if i < n: \r\n for j in range(i,n):\r\n if f[j] <= temp:\r\n x += 1\r\n temp = f[j]\r\n else:\r\n break\r\n temp = f[i]\r\n if i > 0:\r\n for p in range(i ,0,-1):\r\n if f[p - 1] <= temp:\r\n x += 1\r\n temp = f[p - 1]\r\n else:\r\n break\r\n s.append(x)\r\n x = 0\r\nprint(max(s))\r\n\r\n\r\n\r\n", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\ndp1 = [0] * n\r\ndp2 = [0] * n\r\n\r\nfor i in range(1, n):\r\n if heights[i] >= heights[i - 1]:\r\n dp1[i] = dp1[i - 1] + 1\r\n\r\nfor i in range(n - 2, -1, -1):\r\n if heights[i] >= heights[i + 1]:\r\n dp2[i] = dp2[i + 1] + 1\r\n\r\nsol = 0\r\n\r\nfor i in range(n):\r\n sol = max(sol, dp1[i] + dp2[i] + 1)\r\n\r\nprint(sol)", "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 = [10**9] + list(map(int, input().split())) + [10**9]\r\nans = 0\r\n\r\nfor i in range(1, n + 1):\r\n l, r = i, i\r\n while a[l - 1] <= a[l]:\r\n l -= 1\r\n while a[r] >= a[r + 1]:\r\n r += 1\r\n ans = max(ans, r - l + 1)\r\n\r\nprint(ans)\r\n", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\ncoun=[]\r\nfor i in range(n):\r\n lis=[]\r\n c=0\r\n if i==0:\r\n c=1\r\n lis.append(arr[i])\r\n for j in range(i+1,n):\r\n if arr[j]>lis[-1]:\r\n coun.append(c)\r\n break\r\n else:\r\n c+=1\r\n lis.append(arr[j])\r\n else:\r\n coun.append(c)\r\n elif i==n-1:\r\n c=1\r\n lis.append(arr[i])\r\n for h in range(i-1,0,-1):\r\n if arr[h]>lis[-1]:\r\n coun.append(c)\r\n break\r\n else:\r\n c+=1\r\n lis.append(arr[h])\r\n else:\r\n if arr[0]<lis[-1]:\r\n c+=1\r\n coun.append(c)\r\n elif arr[i]>=arr[i-1] and arr[i]>=arr[i+1]:\r\n c=1\r\n lis.append(arr[i])\r\n for h in range(i-1,0,-1):\r\n if arr[h]>lis[-1]:\r\n lis=[]\r\n break\r\n else:\r\n c+=1\r\n lis.append(arr[h])\r\n else:\r\n if arr[0]<=lis[-1]:\r\n c+=1\r\n \r\n lis.append(arr[i]) \r\n for j in range(i+1,n):\r\n if arr[j]>lis[-1]:\r\n coun.append(c) \r\n break\r\n else:\r\n c+=1\r\n lis.append(arr[j])\r\n \r\n else:\r\n coun.append(c)\r\n else:\r\n continue\r\nprint(max(coun))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\nrecs = [int(i) for i in input().split()]\r\n\r\ndef neighbors(current, start, end, step):\r\n count = 0\r\n for j in range(start, end, step):\r\n if current >= recs[j]: \r\n count += 1\r\n current = recs[j]\r\n else: return count\r\n return count\r\n\r\n\r\ndef solve():\r\n res = 1\r\n for i in range(n):\r\n maxx = 1\r\n current = recs[i]\r\n maxx += neighbors(current, i-1, -1, -1)\r\n maxx += neighbors(current, i+1, n, 1)\r\n if maxx > res: res = maxx\r\n print(res)\r\nsolve()", "def calculate_irritated_sections(h, i, target_height, n):\r\n # left\r\n counter, left_sections, last_height = i, 0, target_height\r\n while counter >= 0:\r\n if h[counter] <= last_height:\r\n left_sections += 1\r\n last_height = h[counter]\r\n counter -= 1\r\n else:\r\n break\r\n\r\n counter, right_sections = i+2, 0\r\n while counter < n:\r\n if h[counter] <= target_height:\r\n right_sections += 1\r\n target_height = h[counter]\r\n counter += 1\r\n else:\r\n break\r\n\r\n return left_sections + right_sections + 1\r\n\r\n\r\nn = int(input())\r\nheights = [int(x) for x in input().split()]\r\nmaximum_irritated_sections = 0\r\n\r\nfor i in range(n):\r\n result = calculate_irritated_sections(heights, i-1, heights[i], n)\r\n if result > maximum_irritated_sections:\r\n maximum_irritated_sections = result\r\n\r\nprint(maximum_irritated_sections)", "check = int(input())\r\nsection = list(map(int, input().split()))\r\n\r\n\r\nfinal = 0\r\nfor i in range(len(section)):\r\n right_count = 0\r\n current = section[i]\r\n j = i + 1\r\n while j < len(section):\r\n if section[j] <= current:\r\n current = section[j]\r\n right_count += 1\r\n j += 1\r\n else:\r\n break\r\n\r\n\r\n left_count = 0\r\n current = section[i]\r\n k = i - 1\r\n while k >= 0:\r\n if section[k] <= current:\r\n current = section[k]\r\n left_count += 1\r\n k -= 1\r\n else:\r\n break\r\n\r\n final= max(final, right_count + left_count + 1)\r\n\r\nprint(final)\r\n", "n=int(input())\r\na=list(map(int,input().split()));b=[];\r\nfor i in range(n):\r\n c=1\r\n x=i;y=i\r\n while x>=1:\r\n if a[x]>=a[x-1]:\r\n c+=1\r\n x-=1\r\n else:\r\n break\r\n while y<=n-2:\r\n if a[y]>=a[y+1]:\r\n c+=1\r\n y+=1\r\n else:\r\n break\r\n b.append(c)\r\nprint(max(b))\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nx = [int(xx) for xx in input().split()]\r\nmaxR = 1\r\nfor i in range(n):\r\n tmpMax = 1\r\n j = i\r\n k = i\r\n while j+1 < n and x[j] >= x[j+1]:\r\n tmpMax += 1\r\n j += 1\r\n while k-1 >=0 and x[k] >= x[k-1]:\r\n tmpMax += 1\r\n k -= 1\r\n if tmpMax > maxR:\r\n maxR = tmpMax\r\nprint(maxR)", "\"\"\"\r\ncreated on Wed April 19 3:32:20:am 2023\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\n\r\ntests= int(input())\r\nsections = [int(x) for x in input().split()]\r\n#ind = sections.index(max(sections))\r\ncounter = 1\r\ncount_list= []\r\nfor item in range (len(sections)):\r\n for i in range(item , 0 , -1):\r\n if sections[i] >= sections[i-1]:\r\n counter += 1\r\n else:\r\n break\r\n for i in range(item , len(sections) - 1):\r\n if sections[i] >= sections[i+1]:\r\n counter +=1\r\n else:\r\n break\r\n #print(counter)\r\n count_list.append(counter)\r\n counter = 1\r\n \r\nprint(max(count_list))\r\n \r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nans,mx = 0,0\r\n\r\nfor i in range(n):\r\n cnt=1\r\n k=i\r\n j=i-1\r\n \r\n while j>=0:\r\n if lst[j]<=lst[k]:\r\n cnt+=1\r\n else:\r\n break\r\n j-=1\r\n k-=1\r\n \r\n k=i\r\n \r\n for j in range(i+1, n):\r\n if lst[j]<=lst[k]:\r\n cnt+=1\r\n else:\r\n break\r\n k+=1\r\n j+=1\r\n \r\n if mx<cnt:\r\n mx = cnt\r\n \r\nprint(mx)\r\n ", "n = int(input())\r\na = [*map(int, input().split())]\r\n\r\ndef get_val(i):\r\n res = 1\r\n for id in range(i+1, n):\r\n if a[id] > a[id-1]: break\r\n res += 1\r\n for id in range(i-1, -1, -1):\r\n if a[id] > a[id+1]: break\r\n res += 1\r\n return res\r\n\r\nresult = 0\r\nfor i in range(n):\r\n result = max(result, get_val(i))\r\nprint(result)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(n):\r\n l = i - 1\r\n r = i + 1\r\n prev = arr[i]\r\n area = 1\r\n while l >= 0 and prev >= arr[l]:\r\n prev = arr[l]\r\n area += 1\r\n l -= 1\r\n prev = arr[i]\r\n while r < n and prev >= arr[r]:\r\n prev = arr[r]\r\n area += 1\r\n r += 1\r\n res = max(res, area)\r\nprint(res)", "import math\r\n\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nmy_list_left = list()\r\nmy_list_right = list()\r\n\r\nmy_list_left.append(1)\r\nmy_list_right.append(1)\r\nmax_ = 1\r\nfor i in range(1, len(a)):\r\n if a[i-1] <= a[i]:\r\n max_ += 1\r\n else:\r\n max_ = 1\r\n\r\n my_list_left.append(max_)\r\n\r\nmax_ = 1\r\ni = len(a)-1\r\n\r\nwhile(i>0):\r\n\r\n if a[i-1]>=a[i]:\r\n max_ += 1\r\n else:\r\n max_ = 1\r\n my_list_right.insert(0,max_)\r\n i -= 1\r\n\r\nmax_ = 0\r\n\r\nfor i in range(0, len(a)):\r\n\r\n max_ = max(max_, my_list_left[i]+my_list_right[i]-1)\r\n\r\nprint(max_)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nclouds = list(map(int, input().split()))\r\n\r\n\r\ndef getRight(i):\r\n counter = 0\r\n while(i < len(clouds)):\r\n if i+1< len(clouds) and clouds[i] >= clouds[i+1]:\r\n counter+=1\r\n else:\r\n break\r\n i+=1\r\n return counter\r\n\r\ndef getLeft(i):\r\n counter = 0\r\n while(i >=0):\r\n if i-1 >=0 and clouds[i] >= clouds[i-1]:\r\n counter+=1\r\n else:\r\n break\r\n i-=1\r\n return counter\r\n\r\nmx_clouds = 0\r\nfor i in range(0,len(clouds)):\r\n mx_clouds = max(getRight(i)+getLeft(i)+1, mx_clouds)\r\n\r\nprint(mx_clouds)", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nm = 0\r\nfor i in range(n):\r\n\tans = 1\r\n\tleft = i\r\n\twhile left > 0 and lst[left] >= lst[left - 1]:\r\n\t\tans += 1\r\n\t\tleft -= 1\r\n\tright = i\r\n\twhile right + 1 < n and lst[right] >= lst[right + 1]:\r\n\t\tans += 1\r\n\t\tright += 1\r\n\tm = max(m, ans)\r\nprint(m)", "# your code goes here\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\nmaxc = 1\r\n\r\nfor i in range(len(a)):\r\n\tc = 1\r\n\tj = i-1\r\n\t# check backwards\r\n\twhile j >= 0 and a[j] <= a[j+1]:\r\n\t\tc+=1\r\n\t\tj-=1\r\n\t\t\r\n\tj = i+1\r\n\twhile j < len(a) and a[j] <= a[j-1]:\r\n\t\tc+=1\r\n\t\tj+=1\r\n\t\r\n\tmaxc = max(c, maxc)\r\n\t\r\nprint(maxc)", "n = int(input())\r\n\r\nif(n == 1):\r\n\ts = input()\r\n\tprint(1)\r\nelse:\r\n\ts = input().split()\r\n\ta = [int(i) for i in s]\r\n\tmc = 0\r\n\t'''\r\n\tng = [0]\r\n\tnext_gre = [0 for i in range(n)]\r\n\tnext_gre_rev = [0 for i in range(n)]\r\n\td = a[::-1]\r\n\tfor i in range(1,n):\r\n\t\tnext = a[i]\r\n\t\twhile(len(ng)!=0 and a[ng[-1]] < next):\r\n\t\t\tk = ng.pop(-1)\r\n\t\t\tnext_gre[k] = i\r\n\t\t\r\n\t\tng.append(i)\r\n\t\r\n\twhile(len(ng)>0):\r\n\t\tk = ng.pop(-1)\r\n\t\tnext_gre[k] = -1\r\n\r\n\tng = [0]\r\n\tfor i in range(1,n):\r\n\t\tnext = d[i]\r\n\t\twhile(len(ng) !=0 and d[ng[-1]] < next ):\r\n\t\t\tnext_gre_rev[ng[-1]] = i\r\n\t\t\tng.pop(-1)\r\n\t\tng.append(i)\r\n\r\n\twhile(len(ng)>0):\r\n\t\tnext_gre_rev[ng[-1]] = -1\r\n\t\tng.pop(-1)\r\n\r\n\r\n\tmc = 0\r\n\tfor i in range(n):\r\n\t\tc = 0\r\n\t\tif(next_gre[i] >= 0 ):\r\n\t\t\tc += abs(next_gre[i]-i-1)\r\n\t\tif(next_gre_rev[i] >= 0):\r\n\t\t\tc += abs(n-next_gre_rev[i]-1-i-1)\r\n\t\tc += 1\r\n\t\tmc = max(c,mc)\r\n\tprint(mc)\r\n\t'''\r\n\tfor i in range(n):\r\n\t\tc = 0\r\n\t\tmini = a[i]\r\n\t\tfor j in range(i-1,-1,-1):\r\n\t\t\tif(a[j] > a[i] or a[j]>mini):\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tc += 1\r\n\t\t\t\tmini = min(mini,a[j])\r\n\t\tmini = a[i]\r\n\t\tfor j in range(i+1,n):\r\n\t\t\tif(a[j] > a[i] or a[j]>mini):\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tc += 1\r\n\t\t\t\tmini = min(mini,a[j])\r\n\t\tmc = max(c,mc)\r\n\tprint(mc+1)\r\n\r\n\r\n", "n= int(input())\nsections = list(map(int,input().split()))\nmaxi = 0 \nfor i in range(len(sections)):\n cnt = 1\n # go left\n j = i\n while j >0 and sections[j] >= sections[j-1]:\n cnt +=1\n j-=1\n # go right\n j = i\n # go left\n while j <n-1 and sections[j] >= sections[j+1]:\n cnt +=1\n j+=1\n if cnt > maxi :\n maxi = cnt\nprint(maxi)", "n = int(input())\na = list(map(int, input().split()))\n\n\ndef f(i):\n j = i - 1\n ans = 1\n while j >= 0:\n if a[j] > a[j + 1]:\n break\n ans += 1\n j -= 1\n j = i + 1\n while j < n:\n if a[j] > a[j - 1]:\n break\n ans += 1\n j += 1\n return ans\n\n\nresult = 0\nfor i in range(n):\n result = max(result, f(i))\nprint(result)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n L,R,t=i-1,i+1,1\r\n while True:\r\n if L>=0 and a[L]<=a[L+1]:\r\n L-=1\r\n t+=1\r\n elif R<n and a[R]<=a[R-1]:\r\n R+=1\r\n t+=1\r\n else:\r\n break\r\n if ans<t:ans=t\r\nprint(ans)\r\n", "#problem link : https://codeforces.com/contest/66/problem/B\r\n#time : O(n**2)\r\nn = int(input())\r\nz= list(map(int,input().split()))\r\nup , down , max_z = 0,0,1\r\ns = 1\r\nfor i in range(n):\r\n down , up = i,i\r\n s = 1\r\n while down > 0 and z[down] >= z[down-1] :\r\n s+=1\r\n down-=1\r\n while up < n-1 and z[up] >= z[up+1] :\r\n s+=1\r\n up+=1\r\n max_z = max(s,max_z)\r\nprint(max_z)\r\n", "n = int(input())\r\narr =[int(i) for i in input().split()]\r\nans = 0\r\nfor nc in range(n):\r\n left = nc\r\n right = nc\r\n while left > 0:\r\n if arr[left] >= arr[left-1]:\r\n left -= 1\r\n else:\r\n break\r\n while right < (n-1):\r\n if arr[right] >= arr[right+1]:\r\n right += 1\r\n else:\r\n break\r\n #print(right-left+1)\r\n ans = max(ans,right-left+1)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n plots = 1\r\n #left\r\n if i > 0:\r\n last = a[i]\r\n for j in range(i-1, -1, -1):\r\n if a[j] <= last:\r\n plots += 1\r\n last = a[j]\r\n else:\r\n break\r\n #right\r\n if i < n-1:\r\n last = a[i]\r\n for j in range(i+1, n):\r\n if a[j] <= last:\r\n plots += 1\r\n last = a[j]\r\n else:\r\n break\r\n ans = max(plots, ans)\r\nprint(ans)", "n=int(input())\r\nparsa=list(map(int,input().split()))\r\nmax=0\r\nfor i in range(0,n,1):\r\n counter=0\r\n for j in range(i+1,n,1):\r\n if parsa[j]<=parsa[i] and parsa[j]<=parsa[j-1]:\r\n counter+=1\r\n else:\r\n break\r\n for j in range(i-1,-1,-1):\r\n if parsa[j]<=parsa[i] and parsa[j]<=parsa[j+1]:\r\n counter+=1\r\n else:\r\n break\r\n if i==0:\r\n max=counter\r\n if max<counter:\r\n max=counter\r\nprint(max+1)", "n = int(input())\nnums = list(map(int, input().split()))\n\nleft = [0] * (n+1)\nright = [0] * (n+1)\n\nfor i in range(1, n):\n if nums[i-1] <= nums[i]:\n left[i] = left[i-1] + 1\n else:\n continue\n\nfor i in range(n-2, -1, -1):\n if nums[i] >= nums[i+1]:\n right[i] = right[i+1] + 1\n else:\n continue\n\nans = 0\nfor i in range(n):\n ans = max(ans, left[i] + right[i] + 1)\n\nprint(ans)\n \t \t\t \t\t\t \t \t\t \t\t\t \t\t \t \t", "n = int(input())\r\nlst = []\r\nlst = list(map(int, input().split()))\r\n\r\ndef tinhsoluong(vitri):\r\n i = vitri - 1\r\n j = vitri\r\n while i > 0 and j < n and lst[i] <= lst[j]:\r\n i -= 1\r\n j -= 1\r\n if i == 0:\r\n l = i\r\n else:\r\n l = j\r\n i = vitri + 1\r\n j = vitri\r\n while j > 0 and i < n and lst[i] <= lst[j]:\r\n i += 1\r\n j += 1\r\n r = j\r\n return r-l+1\r\n\r\nvaluemax = 0\r\nfor k in range(0,n):\r\n if tinhsoluong(k) > valuemax:\r\n valuemax = tinhsoluong(k)\r\n\r\nprint(valuemax)", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Petya and Countryside\"\r\n# Class: B\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 a = list(map(int, input().split()))\r\n ans = set()\r\n for i in range(n):\r\n l = 0 ; r= 0\r\n ls = a[:i][::-1]\r\n rs = a[i+1:]\r\n if ls and ls[0] <= a[i]:\r\n l+=1\r\n for o in range(1, len(ls)):\r\n if ls[o]<=ls[o-1]: l+=1\r\n else: break\r\n \r\n if rs and rs[0] <= a[i]:\r\n r+=1\r\n for o in range(1, len(rs)):\r\n if rs[o]<=rs[o-1]: r+=1\r\n else: break\r\n ans.add(l+r+1)\r\n \r\n print(max(ans))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n = int(input())\r\nrec = [int(x) for x in input().split()]\r\n\r\nmax = 0\r\nfor i in range(n):\r\n x = 0\r\n if i != 0:\r\n for l in range(i, -1, -1):\r\n if rec[l] >= rec[l-1] and l-1 >= 0:\r\n x += 1\r\n else:\r\n break\r\n if i != n-1:\r\n for r in range(i, n):\r\n if r+1 != n and rec[r] >= rec[r+1]:\r\n x += 1\r\n else:\r\n break\r\n if x+1 > max:\r\n max = x + 1\r\nprint(max)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmaximalka = 0\r\nfor i in range(n):\r\n k = i\r\n zlava = 0\r\n while k > 0:\r\n if arr[k] >= arr[k-1]:\r\n zlava += 1\r\n else:\r\n break\r\n k -= 1\r\n k = i\r\n zprava = 0\r\n while k < n-1:\r\n if arr[k] >= arr[k + 1]:\r\n zprava += 1\r\n else:\r\n break\r\n k += 1\r\n if zlava + zprava + 1> maximalka:\r\n maximalka = 1 + zlava + zprava\r\n\r\nprint(maximalka)", "import sys\r\nimport bisect\r\n# from math import ceil,log,gcd,sqrt\r\n# sys.setrecursionlimit(10**9)\r\n\r\nRI = lambda : [int(x) for x in sys.stdin.readline().split()]\r\nri = lambda : sys.stdin.readline().strip()\r\n\r\ndef input(): return sys.stdin.readline().strip()\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\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\r\ndef ceil(x, y=1): return int(-(-x // y))\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\r\ndef Yes(): print('Yes')\r\ndef No(): print('No')\r\ndef YES(): print('YES')\r\ndef NO(): print('NO')\r\nINF = 10 ** 18\r\nMOD = 10 ** 9 + 7\r\n\r\nn = int(ri())\r\na =RI()\r\ninc = [1]*n\r\ndec = [1]*n\r\nfor i in range(1,len(a)):\r\n if a[i] >= a[i-1]:\r\n inc[i]=inc[i-1]+1\r\nfor i in range(len(a)-2,-1,-1):\r\n if a[i] >= a[i+1]:\r\n dec[i]=dec[i+1]+1\r\n\r\nmaxx =-1\r\nfor i in range(len(a)):\r\n maxx = max(maxx,inc[i]+dec[i]-1)\r\nprint(maxx)", "n = int(input())\r\nrec = [int(x) for x in input().split()]\r\nh = []\r\nfor i in range(0, n):\r\n num = 0\r\n if i != n-1:\r\n for x in range(i, n-1):\r\n if rec[x] >= rec[x+1]:\r\n num += 1\r\n else:\r\n break\r\n if i != 0:\r\n for y in range(i, -1, -1):\r\n if y == 0:\r\n break\r\n if rec[y] >= rec[y-1]:\r\n num += 1\r\n else:\r\n break\r\n h.append(num+1)\r\nprint(max(h))\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 = I()\r\narr = L()\r\n\r\npeaks = []\r\n\r\nif n==1:\r\n peaks.append(1)\r\n\r\nif n>1 and arr[0]>arr[1]:\r\n peaks.append(1)\r\n\r\ni = 1\r\nwhile i<n:\r\n while i<n and arr[i]>=arr[i-1]:\r\n i+=1\r\n # print(i)\r\n \r\n if i<=n:\r\n peaks.append(i)\r\n \r\n while i<n and arr[i]<=arr[i-1]:\r\n i+=1\r\n \r\n# print(i)\r\n\r\n# print(peaks)\r\nmaxlen = 0\r\nfor p in peaks:\r\n l = p-1\r\n r = p-1\r\n # print(l)\r\n while l >0 and arr[l-1]<=arr[l]:\r\n l-=1\r\n \r\n while r<n-1 and arr[r+1]<=arr[r]:\r\n r+=1\r\n\r\n # if l==-1:\r\n # l+=1\r\n \r\n maxlen = max(maxlen, r-l+1)\r\n\r\nprint(maxlen)\r\n \r\n \r\n ", "from sys import stdin , stdout\r\nfrom os import path\r\nif path.exists(\"input.txt\"):\r\n\tstdin = open(\"input.txt\",'r')\r\nx = int(stdin.readline())\r\nmylist = list(map(int,stdin.readline().strip().split()))\r\nb = 1\r\nfor i in range(x):\r\n\tl = i \r\n\tj = i\r\n\twhile l-1 >= 0 and mylist[l-1]<=mylist[l]:l-=1\r\n\twhile j+1 < x and mylist[j+1] <= mylist[j]:j+=1\r\n\tb = max(b,j-l+1)\r\nprint(b)", "def main():\n n = int(input())\n a = list(map(int, input().split(' ')))\n ret = 0\n l = [0] * n # l[i] = # of spots < i that will be filled\n r = [0] * n # r[i] = # of spots > i that will be filled\n for i in range(1, n):\n if a[i] >= a[i - 1]:\n l[i] = l[i - 1] + 1\n else:\n l[i] = 0\n\n for i in range(n - 2, -1, -1):\n if a[i] >= a[i + 1]:\n r[i] = r[i + 1] + 1\n else:\n r[i] = 0\n\n for i in range(n):\n ret = max(ret, l[i] + r[i] + 1)\n return ret\nprint(main())\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ngoing_up = True\r\nmaxval = 1\r\ncurval = 1\r\nflat = 1\r\nprev = arr[0]\r\nfor i in range(1,n):\r\n if arr[i]<prev:\r\n if going_up:\r\n going_up = False\r\n curval+=1\r\n flat = 1\r\n elif arr[i] > prev:\r\n if not going_up:\r\n curval = flat+1\r\n going_up = True\r\n else:\r\n curval+=1\r\n else:\r\n if not going_up:\r\n flat+=1\r\n curval+=1\r\n # print(curval, flat)\r\n\r\n prev = arr[i]\r\n maxval = max(maxval, curval)\r\n\r\nprint(maxval)", "n=int(input())\r\nx=list(map(int,input().split()))\r\n\r\nans=[]\r\nfor i in range(n):\r\n c=1\r\n low=i-1\r\n high=i+1\r\n while(low>=0):\r\n if(x[low]>x[low+1]):\r\n break\r\n c+=1\r\n low-=1\r\n while(high<=n-1):\r\n if x[high]>x[high-1]:\r\n break\r\n c+=1\r\n high+=1\r\n ans.append(c)\r\nprint(max(ans))", "# LUOGU_RID: 104745425\nn, *a = map(int, open(0).read().split())\r\nans = 1\r\nfor i in range(n):\r\n x = y = a[i]\r\n l = r = i\r\n while l and a[l - 1] <= x:\r\n l -= 1\r\n x = a[l]\r\n while r < n and a[r] <= y:\r\n y = a[r]\r\n r += 1\r\n ans = max(ans, r - l)\r\nprint(ans)\r\n", "n = int(input())\r\nH = list(map(int, input().split()))\r\nR, L = [0]*n, [0]*n\r\n\r\nfor i in range(1,n):\r\n\tif H[i] >= H[i-1]:\r\n\t\tR[i] = R[i-1] + 1\r\n\tif H[-i-1] >= H[-i]:\r\n\t\tL[-i-1] = L[-i] + 1\r\n\r\nprint(1 + max(map(sum, zip(R,L))))", "n=int(input())\r\nk= map(int,input().split())\r\nk=list(k)\r\nlenth=1\r\nfor i in range(n):\r\n c=1\r\n for j in range(i,n-1) :\r\n if k[j+1]>k[j] :\r\n break\r\n c+=1 \r\n for j in range(i,0,-1):\r\n if k[j-1]>k[j]:\r\n break\r\n c+=1\r\n if c>lenth: \r\n lenth = c\r\nprint(lenth)", "n = int(input())\r\nheights = list(map(int,input().split()))\r\n\r\nmaxx = 0\r\nfor i in range(n) :\r\n right = i+1\r\n left = i-1\r\n score = 0\r\n while (left >= 0) :\r\n if (heights[left] <= heights[left+1]) :\r\n score += 1\r\n left -= 1\r\n else :\r\n break\r\n while (right < n) :\r\n if (heights[right] <= heights[right-1]) :\r\n score += 1\r\n right += 1\r\n else :\r\n break\r\n if (score > maxx) :\r\n maxx = score\r\nprint(maxx+1)", "# Petya and Countryside(L)\r\n\r\ndef fn(ind,b):\r\n c = 0\r\n flag = 0\r\n if(b == \"+\"):\r\n for i in range(ind,len(l)-1):\r\n if(l[i]>=l[i+1]):\r\n c += 1\r\n else:\r\n flag = 1\r\n break\r\n if(b==\"-\"):\r\n for i in range(ind,0,-1):\r\n if(l[i] >= l[i-1]):\r\n c += 1\r\n else:\r\n flag = 1\r\n break\r\n return(c)\r\n\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl1 = []\r\n\r\nfor i in range(0,len(l)):\r\n if(i == 0):\r\n c1 = fn(i,\"+\")\r\n l1.append(c1+1)\r\n elif(i==len(l)-1):\r\n c1 = fn(i,\"-\")\r\n l1.append(c1+1)\r\n else:\r\n c1 = fn(i,\"-\")\r\n c2 = fn(i,\"+\")\r\n l1.append(c1+c2+1)\r\nprint(max(l1))", "n = int(input())\r\nh = list(map(int, input().split()))\r\nr = list()\r\nfor i in range(n):\r\n x = 1\r\n j = i+1\r\n while j < n and h[j] <= h[j - 1]:\r\n x += 1\r\n j += 1\r\n j = i-1\r\n while j >= 0 and h[j] <= h[j + 1]:\r\n x += 1\r\n j -= 1\r\n r.append(x)\r\nprint(max(r))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in range(0,n):\r\n temp=l[i];c1=0;c2=0\r\n for j in range(i,len(l)):\r\n if temp>=l[j]:\r\n temp=l[j]\r\n c1+=1\r\n else:\r\n break\r\n temp=l[i] \r\n for j in range(i,-1,-1):\r\n if temp>=l[j]:\r\n temp=l[j]\r\n c2+=1\r\n else:\r\n break\r\n #print('iter',i,c1,c2)\r\n \r\n if (c1 +c2 -1>ans):\r\n ans= c1+c2-1\r\nprint(ans)\r\n\r\n", "n=int(input())\r\nl=[0]*n\r\nli=list(map(int,input().split()))\r\nif n==1:\r\n print(1)\r\n exit()\r\n\r\nfor i in range(n):\r\n if i==0:\r\n cnt=1\r\n p=li[i]\r\n for j in range(i+1,n):\r\n if p<li[j]:\r\n break\r\n p=li[j]\r\n cnt+=1\r\n l[i]+=cnt\r\n elif i==n-1:\r\n cnt=1\r\n p=li[i]\r\n for j in range(i-1,-1,-1):\r\n if p<li[j]:\r\n break\r\n p=li[j]\r\n cnt+=1\r\n l[i]+=cnt\r\n else:\r\n cnt=0\r\n p=li[i]\r\n for j in range(i+1,n):\r\n if p<li[j]:\r\n break\r\n p=li[j]\r\n cnt+=1\r\n l[i]+=cnt\r\n cnt=1\r\n p=li[i]\r\n for j in range(i-1,-1,-1):\r\n if p<li[j]:\r\n break\r\n p=li[j]\r\n cnt+=1\r\n l[i]+=cnt\r\nprint(max(l))", "n = int(input())\nh = [int(i) for i in input().split()]\n\ncurrent = 1\nmaxsections = 1\nj = 0\nmountains = 0\nclimbing = False\nfor i in range(1,n):\n\tif h[i] == h[i-1]:\n\t\tcurrent += 1\n\telif h[i] < h[i-1]:\n\t\tcurrent += 1\n\t\tj = i\n\t\tclimbing = False\n\telse: # h[i] > h[i-1]\n\t if mountains == 0:\n\t \tcurrent += 1\n\t \tmountains += 1\n\t \tclimbing = True\n\t elif climbing:\n\t \tcurrent += 1\n\t else:\n\t \tif current > maxsections:\n\t \t\tmaxsections = current\n\t \tcurrent = i-j+1\n\t# print(f'{i}: height {h[i]}, nextstart {j}, mountains {mountains}, climbing {climbing}, current {current}, max {maxsections}')\nif current > maxsections:\n\tmaxsections = current\nprint(maxsections)\n \t\t\t \t\t\t\t \t\t \t \t\t \t \t", "n = int(input())\r\nt = list(map(int, input().split()))\r\na, b = [0] * n, [0] * n\r\nfor i in range(1, n):\r\n if t[i] >= t[i - 1]: a[i] = a[i - 1] + 1\r\n if t[- i] <= t[- 1 - i]: b[- i - 1] = b[- i] + 1\r\nprint(max((a[i] + b[i] + 1) for i in range(n)))\r\n", "num=int(input())\r\nfarm=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(num):\r\n flag=0\r\n m=farm[i]\r\n s=farm[i]\r\n for j in range(i,num):\r\n if m>=farm[j]:\r\n flag+=1\r\n m=farm[j]\r\n else:\r\n break\r\n for j in range(i,-1,-1):\r\n if s>=farm[j]:\r\n flag+=1\r\n s=farm[j]\r\n else:\r\n break\r\n ans.append(flag)\r\nans.sort()\r\nprint(ans[-1]-1)\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nm=0\r\nfor i in range(n):\r\n x=list1[i]\r\n s=1\r\n xx=x\r\n for j in range(i-1,-1,-1):\r\n if(list1[j]<=xx):\r\n s+=1\r\n xx=list1[j]\r\n else:\r\n break\r\n xx=x\r\n for j in range(i+1,n):\r\n if(list1[j]<=xx):\r\n s+=1\r\n xx=list1[j]\r\n else:\r\n break\r\n # print(s)\r\n if(s>m):\r\n m=s\r\n \r\nprint(m)", "n=int(input())\r\n \r\nL=list(map(int,input().split()))\r\n \r\n \r\nbest=0\r\nfor i in range(n):\r\n ans=1\r\n j=1\r\n x=L[i]\r\n while(i-j>=0 and L[i-j]<=x):\r\n ans+=1\r\n x=L[i-j]\r\n j+=1\r\n j=1\r\n x=L[i]\r\n while(i+j<n and L[i+j]<=x):\r\n ans+=1\r\n x=L[i+j]\r\n j+=1\r\n best=max(ans,best)\r\nprint(best)", "n=int(input())\r\na=*map(int,input().split()),\r\nr=1\r\nfor i in range(n):\r\n x=y=a[i]\r\n k=j=i\r\n while j-1>=0 and a[j-1]<=x:j-=1;x=a[j]\r\n while k<n and a[k]<=y:y=a[k];k+=1\r\n r=max(r,k-j)\r\nprint(r)", "from sys import stdin, stdout # only need for big input\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n assert(len(a) == n)\n max_length = 0\n for i in range(n):\n count = 1\n for j in range(i + 1,n):\n if a[j] > a[j - 1]:\n break\n count += 1\n for j in range(i-1, -1, -1):\n if a[j] > a[j+1]:\n break\n count +=1\n max_length = max(max_length, count)\n\n print(max_length)\n\n\ndef main():\n solve()\n\n\nif __name__ == \"__main__\":\n main()", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nn, a = int(input()), arr_inp()\r\n# end, beg, out = 1, 0, 1\r\n# while (end < n):\r\n# c = 1\r\n# for i in range(end, n):\r\n# if a[i] >= a[i - 1] and beg == 0:\r\n# end += 1\r\n# elif a[i] <= a[i - 1]:\r\n# if beg == 0:\r\n# end += 1\r\n# beg = -1\r\n# else:\r\n# beg = 0\r\n# break\r\n# c += 1\r\n# out = max(out, c)\r\nout=0\r\nfor i in range(n):\r\n c=1\r\n for j in range(i-1,-1,-1):\r\n if(a[j+1]>=a[j]):\r\n c+=1\r\n else:\r\n break\r\n for j in range(i+1,n,1):\r\n if a[j]<=a[j-1]:\r\n c+=1\r\n else:\r\n break\r\n out=max(c,out)\r\nprint(out)\r\n", "n = int(input())\narr = list(map(int,input().split()))\nif(n==1):\n print(1)\nelse:\n val = arr[0]\n count = 1\n j = 1\n while(j<n and arr[j]<=val):\n count+=1\n val = arr[j]\n j+=1\n maxi = count\n for i in range(1,n):\n val = arr[i]\n j = i-1\n count = 1\n while(j>=0 and arr[j]<=val):\n count+=1\n val = arr[j]\n j-=1\n j = i+1\n val = arr[i]\n while(j<n and arr[j]<=val):\n count+=1\n val = arr[j]\n j+=1\n if(maxi<count):\n maxi =count\n print(maxi)\n\n", "def mido():\r\n N = int(input())\r\n sections = list(map(int,input().split()))\r\n mx = []\r\n temp = 0\r\n length = len(sections)\r\n for x in range(length):\r\n \r\n temp_left = sections[x]\r\n temp_right = sections[x]\r\n \r\n for left in sections[x-length-1::-1]:\r\n \r\n if left <= temp_left:\r\n temp_left = int(left)\r\n temp +=1 \r\n else:\r\n break \r\n \r\n for right in sections[x:]:\r\n \r\n if right <= temp_right:\r\n temp_right = int(right)\r\n temp +=1 \r\n else:\r\n break \r\n mx.append(temp)\r\n temp = 0\r\n print(max(mx)) \r\n\r\nif __name__ == '__main__':\r\n mido()", "\r\nn = int(input())\r\nheights = list(map(int,input().split()))\r\nmaxsections = 0\r\nfor section1 in range(n):\r\n\r\n\trightbound = section1\r\n\twhile rightbound < n-1:\r\n\t\tif heights[rightbound+1]>heights[rightbound]:\r\n\t\t\tbreak\r\n\t\trightbound+=1\r\n\trightbound+=1\r\n\r\n\tleftbound=section1\r\n\twhile leftbound>0:\r\n\t\tif heights[leftbound-1]>heights[leftbound]:\r\n\t\t\tbreak\r\n\t\tleftbound-=1\r\n\tleftbound-=1\r\n\r\n\tif rightbound-leftbound-1>maxsections:\r\n\t\tmaxsections=rightbound-leftbound-1\r\n\r\nprint(maxsections)\r\n\r\n\r\n\r\n\r\n\t\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\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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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=[0]\r\ncount=1\r\nif n==1:\r\n print(1)\r\nelse:\r\n \r\n for i in range(n):\r\n c1=0\r\n c2=0\r\n if i!=n-1:\r\n for j in range(i+1,n):\r\n if l[j]<=l[j-1]:\r\n c1+=1\r\n else:\r\n break\r\n if i!=0:\r\n \r\n for j in range(i-1,-1,-1):\r\n if l[j]<=l[j+1]:\r\n c2+=1\r\n else:\r\n break\r\n \r\n #print(c1,c2)\r\n count=max(count,c1+c2)\r\n print(count+1)\r\n \r\n \r\n ", "import sys\r\n\r\nlocal = False\r\n\r\nif local:\r\n sys.stdin = open(\"input.txt\", \"r\") \r\n \r\ndef closeI0():\r\n if local:\r\n sys.stdin.close()\r\n \r\ndef d_out(*args):\r\n if not local:\r\n return\r\n print(*args, sep=\" \")\r\n \r\ndef basinSize(s, index):\r\n a, b = 0, 0\r\n \r\n sb = s[index::-1]\r\n \r\n for j in range(len(sb) - 1):\r\n if sb[j] < sb[j+1]:\r\n break\r\n b += 1\r\n \r\n sa = s[index:]\r\n \r\n for i in range(len(sa) - 1):\r\n if sa[i] < sa[i+1]:\r\n break\r\n a += 1\r\n \r\n return a + b + 1\r\n \r\n \r\n \r\ndef solve():\r\n # Code Here\r\n n = int(input())\r\n s = list(map(int, input().split(\" \")))\r\n max = 0\r\n \r\n for i in range(n):\r\n c = basinSize(s, i)\r\n if (c > max):\r\n max = c\r\n print(max)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1 # int(input())\r\n \r\n while(t > 0):\r\n solve()\r\n t -= 1", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmax_count = []\r\nfor i in range(n):\r\n count = 0\r\n pos = i\r\n while (pos >= 1 and arr[pos-1] <= arr[pos]):\r\n count += 1\r\n pos -= 1\r\n pos = i\r\n while (pos <= n-2 and arr[pos+1] <= arr[pos]):\r\n count += 1\r\n pos += 1\r\n max_count.append(count+1)\r\nprint(max(max_count))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nresult = -1\r\nfor i in range(0, n):\r\n count = 1\r\n for j in range(i-1, -1, -1):\r\n if a[j]<=a[j+1]:\r\n count += 1\r\n else:\r\n break\r\n for j in range(i+1, n):\r\n if a[j]<=a[j-1]:\r\n count += 1\r\n else:\r\n break\r\n result = max(result, count)\r\nprint(result)\r\n", "# Problem: Petya and Countryside\r\n\r\ndef check(index, garden):\r\n count = 1\r\n indexL = index-1\r\n indexR = index+1\r\n while indexL >= 0 and garden[indexL] <= garden[indexL+1]:\r\n indexL -= 1\r\n count += 1\r\n while indexR <= len(garden)-1 and garden[indexR] <= garden[indexR-1]:\r\n indexR += 1\r\n count += 1\r\n return count\r\n# User input\r\nn = int(input())\r\ngarden = [int(s) for s in input().split(\" \")]\r\n# Create max, get first value\r\nmaximum = 0\r\nmaximum = max(check(0,garden),maximum)\r\nfor i in range(n-1):\r\n if garden[i] >= garden[i-1] or garden[i] >= garden[i+1]:\r\n maximum = max(check(i,garden),maximum)\r\nmaximum = max(check(n-1,garden),maximum)\r\n# Print\r\nprint(maximum)\r\n", "k = int(input())\r\nhs = list(map(int, input().split()))\r\n\r\ndef solve(l, i):\r\n x = l[i]\r\n left = 0\r\n right = 0 \r\n for t in l[:i][::-1]:\r\n if t <= x:\r\n left += 1\r\n else:\r\n break\r\n x=t\r\n x = l[i]\r\n for t in l[i+1:]:\r\n if t <= x:\r\n right += 1\r\n else:\r\n break\r\n x=t\r\n return left+right+1\r\n\r\nprint(max([solve(hs, v) for v in list(range(k))]))", "n = int(input())\r\nheights = list(map(int, input().split()))\r\nmax_watered = 1\r\n\r\nfor i in range(n):\r\n watered_sections = 1\r\n # Simulate water flow to the left\r\n j = i - 1\r\n while j >= 0 and heights[j] <= heights[j + 1]:\r\n watered_sections += 1\r\n j -= 1\r\n\r\n # Simulate water flow to the right\r\n j = i + 1\r\n while j < n and heights[j] <= heights[j - 1]:\r\n watered_sections += 1\r\n j += 1\r\n\r\n max_watered = max(max_watered, watered_sections)\r\n\r\nprint(max_watered)\r\nexit()", "n, = map(int, input().split())\nA = list(map(int, input().split()))\n\nrise = [0]*n\nfall = [0]*n\n\nfor i in range(1, n):\n if A[i] >= A[i-1]:\n rise[i] = rise[i-1] + 1\n if A[n-i-1] >= A[n-i]:\n fall[n-i-1] = fall[n-i] + 1\n \nhi = max(rise[i] + fall[i] + 1 for i in range(n))\n\n\n#for i in range(len(A)):\n# cur = 1\n# \n# j = i-1\n# prev = A[i]\n# while j >= 0 and A[j] <= prev:\n# cur += 1\n# prev = A[j]\n# j-=1\n#\n# j = i+1\n# prev = A[i]\n# while j < n and A[j] <= prev:\n# cur += 1\n# prev = A[j]\n# j+=1\n#\n# hi = max(hi, cur)\n#\n\nprint(hi)\n\n", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int, input().split()))\r\nfor i in range(1):#nmbr():\r\n n=nmbr()\r\n a=lst()\r\n ans=0\r\n for i in range(n):\r\n p=i\r\n c=1\r\n while p-1>=0 and a[p]>=a[p-1]:\r\n c+=1\r\n p-=1\r\n p=i\r\n while p+1<n and a[p]>=a[p+1]:\r\n p+=1\r\n c+=1\r\n ans=max(ans,c)\r\n print(ans)\r\n", "n = int(input()) \n\nH = list(map(int, input().split()))\n\nif n == 1:\n print(1)\n exit()\n\n# collapse\ncnts = [1]\nnew_H = [H[0]]\ni = 1\ncurr_idx = 0\nwhile i < len(H):\n if H[i] == new_H[curr_idx]:\n cnts[curr_idx] += 1\n else:\n new_H.append(H[i])\n cnts.append(1)\n curr_idx += 1\n i += 1\n\ncnt = 0\ntemp_cnt = cnts[0]\ni = 1\nhas_peak = False\n#print(cnts)\nwhile i < len(new_H):\n if new_H[i] >= new_H[i-1]:\n if not has_peak:\n temp_cnt += cnts[i]\n else:\n has_peak = False\n cnt = max(temp_cnt, cnt)\n temp_cnt = cnts[i-1] + cnts[i]\n else:\n if not has_peak:\n has_peak = True\n temp_cnt += cnts[i]\n i += 1\ncnt = max(cnt, temp_cnt)\nprint(cnt)\n", "import sys\r\n\r\ndef read_input():\r\n n = 0\r\n heights = []\r\n for i in range(2):\r\n line = sys.stdin.readline()\r\n numbers = [int(x) for x in line.strip().split()]\r\n if i == 0:\r\n n = numbers[0]\r\n if i == 1:\r\n heights.extend(numbers)\r\n return n, heights\r\ndef irregation(heights, idx, n):\r\n \"\"\"\r\n :param heights: heights of squares\r\n :param i: square on which we want to compute irregation\r\n :return: irregation count\r\n \"\"\"\r\n curr_height = heights[idx]\r\n irregation_count = 1\r\n\r\n # look at right of the square\r\n i = idx + 1\r\n while i < n and heights[i] <= curr_height:\r\n curr_height = heights[i]\r\n irregation_count += 1\r\n i += 1\r\n\r\n curr_height = heights[idx]\r\n # look at left of the square\r\n i = idx - 1\r\n while i >= 0 and heights[i] <= curr_height:\r\n curr_height = heights[i]\r\n irregation_count += 1\r\n i -= 1\r\n return irregation_count\r\n\r\n\r\ndef max_irregation(n, heights):\r\n max_irr_count = 1\r\n for i in range(n):\r\n max_irr_count = max(max_irr_count, irregation(heights, i, n))\r\n return max_irr_count\r\nn, heights = read_input()\r\nprint(max_irregation(n, heights))", "a = int(input())\r\nb= list(map(int, input().split()))\r\n\r\nc= -1\r\nfor _ in range(a):\r\n d = _-1\r\n e = _+1\r\n f = 0\r\n g = 0\r\n while d>=0 and b[d]<=b[d+1]:\r\n d-=1\r\n f+=1\r\n while e<a and b[e]<=b[e-1]:\r\n e+=1\r\n g+=1\r\n c= max(c, f+g+1)\r\nprint (c)", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n heights = list(read_tuple(int))\r\n ans = 1\r\n for i in range(n):\r\n i_1, i_2 = i - 1, i + 1\r\n curr_ans = 1\r\n while i_1 >= 0:\r\n if heights[i_1] <= heights[i_1 + 1]:\r\n curr_ans += 1\r\n else:\r\n break\r\n i_1 -= 1\r\n while i_2 < n:\r\n if heights[i_2] <= heights[i_2 - 1]:\r\n curr_ans += 1\r\n else:\r\n break\r\n i_2 += 1\r\n ans = max(ans, curr_ans)\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nmx = 0\r\nfor i in range(0, len(arr)):\r\n cnt = 0\r\n for j in range(i + 1, n):\r\n if arr[j] <= arr[j - 1]:\r\n cnt += 1\r\n else:\r\n break\r\n for j in range(i, 0, -1):\r\n if arr[j] >= arr[j - 1]:\r\n cnt += 1\r\n else:\r\n break\r\n mx = max(mx, cnt + 1)\r\nprint(mx)\r\n", "n = int(input())\r\nlistHeights = list(map(int, input().rstrip().split()))\r\nc1 = 1\r\nc2 = 1\r\nmaxC = 0\r\n\r\nfor hidx in range(1, len(listHeights)):\r\n if listHeights[hidx] > listHeights[hidx-1]:\r\n if c1 > c2:\r\n maxC = max(c1, maxC)\r\n c2 += 1\r\n c1 = c2\r\n else:\r\n c1 += 1\r\n c2 += 1\r\n elif listHeights[hidx] == listHeights[hidx-1]:\r\n c1 += 1 \r\n c2 += 1\r\n else:\r\n c1 += 1\r\n c2 = 1\r\n \r\nprint(max(maxC, c1, c2))\r\n", "\ndef solve(n, l):\n k = mx = 1\n left = 1\n for i in range(n-1):\n if l[i] > l[i+1]:\n left = 1\n k += 1\n elif l[i] == l[i+1]:\n left += 1\n k += 1\n else:\n mx = max(k, mx)\n left += 1\n k = left\n\n mx = max(k, mx)\n return mx\n\n\nn = int(input())\nl = list(map(int, input().split()))\n\nprint(solve(n, l))\n", "import collections\nclass Solution:\n def toSubmit(self):\n n = int(input())\n A = list(map(int, input().rstrip().split()))\n forward=[0 for _ in range(n)]\n backward=[0 for _ in range(n)]\n for i in range(1,n):\n if A[i] >= A[i-1]:\n forward[i] = forward[i-1] + 1\n for i in range(n-2,-1,-1):\n if A[i] >= A[i+1]:\n backward[i] = backward[i+1] + 1\n print(max([x+y for x,y in zip(forward,backward)]) + 1)\n return\n\nif __name__ == \"__main__\":\n solution = Solution()\n solution.toSubmit()", "def leftarray(l,t):\r\n l=l[::-1]\r\n temp,count=t,0\r\n for i in range(len(l)):\r\n if l[i]<=temp:\r\n temp=l[i]\r\n count+=1\r\n else:\r\n break\r\n return count\r\ndef rightarray(l,t):\r\n temp,count=t,0\r\n for i in range(len(l)):\r\n if l[i]<=temp:\r\n temp=l[i]\r\n count+=1\r\n else:\r\n break\r\n return count\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nleft=[]\r\nright=[]\r\nm=[]\r\nfor i in range(n):\r\n left=a[:i]\r\n right=a[i+1:]\r\n m.append(leftarray(left,a[i])+rightarray(right,a[i])+1)\r\n\r\n\r\nprint(max(m))", "def proB(arr):\r\n ans=0\r\n for i in range(len(arr)):\r\n no=1\r\n temp=arr[i]\r\n for j in range(i+1,len(arr)):\r\n if(arr[j]>temp):\r\n break\r\n temp=arr[j]\r\n no+=1\r\n temp=arr[i]\r\n for k in range(i-1,-1,-1):\r\n if(arr[k]>temp):\r\n break\r\n temp=arr[k]\r\n no+=1\r\n ans=max(ans,no)\r\n return ans\r\nt=int(input())\r\nfor i in range(1):\r\n arr=list(map(int,input().split()))\r\n print(proB(arr))", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nmax_count = 1\r\ni = 0\r\nwhile i < n-1:\r\n\r\n count = 1\r\n temp_max = 0\r\n moving_i = i\r\n while heights[moving_i+1] >= heights[moving_i]:\r\n\r\n count+=1\r\n moving_i+=1\r\n if moving_i == n-1:\r\n break\r\n temp_max = moving_i\r\n if moving_i != n-1:\r\n while heights[moving_i+1] <= heights[moving_i]:\r\n count+=1\r\n moving_i+=1\r\n if moving_i == n-1:\r\n break\r\n max_count = max(max_count, count)\r\n i = temp_max + 1\r\n\r\n\r\nprint(max_count)\r\n", "n = int(input())\nheights = list(map(int, input().split()))\n\nmax_watered = 0\nfor i in range(n):\n max_right = 0\n max_left = 0\n '''\n max_right = i\n max_left = i\n while max_right < n:\n if (heights[max_right] <= heights[i]):\n max_right += 1\n continue\n break\n\n while max_left >= 0:\n if (heights[max_left] <= heights[i]):\n max_left -= 1\n continue\n break\n '''\n for r in range(i+1, n):\n if (heights[r] > heights[r-1]):\n break;\n max_right += 1\n\n for l in range(i-1, -1, -1):\n #print(\"Entered\")\n if (heights[l] > heights[l+1]):\n break;\n max_left += 1\n #print(i, max_left, max_right)\n max_watered = max(max_watered, max_right+max_left+1)\n\n #print(i, max_left, max_right)\n #max_watered = max(max_watered, max_right-max_left+1)\n\n\nprint(max_watered)\n", "n = int(input())\r\n\r\nlis = list(map(int,input().split()))\r\n\r\nrain = []\r\n\r\nfor i in range(n):\r\n elelis = []\r\n j = i\r\n count = 1\r\n \r\n while i < n-1:\r\n #print(i)\r\n #print(\"first\")\r\n if lis[i] >= lis[i+1] :\r\n elelis.append(lis[i+1])\r\n count += 1\r\n \r\n else:\r\n break\r\n i+=1 \r\n \r\n while j > 0 :\r\n #print(\"second\")\r\n if lis[j] >= lis[j-1] :\r\n elelis.append(lis[j-1])\r\n count += 1\r\n \r\n else:\r\n break\r\n j -= 1 \r\n \r\n #print(elelis) \r\n rain.append(count) \r\n \r\nprint(max(rain)) \r\n \r\n \r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nlevels = []\r\nfor i in range(n):\r\n temp = 1\r\n for j in range(i, n-1):\r\n if arr[j+1]<=arr[j]:\r\n temp+=1\r\n else:\r\n break\r\n for j in range(i, 0, -1):\r\n if arr[j-1]<=arr[j]:\r\n temp+=1\r\n else:\r\n break\r\n levels.append(temp)\r\nprint(max(levels))", "n=int(input())\r\nL=list(map(int,input().split()))\r\ns=1\r\nS=0\r\nfor i in range(n):\r\n a=L[i]\r\n j=i\r\n if i==0 :\r\n inf=1\r\n sup=0\r\n elif L[i-1]==a:\r\n inf=inf+1\r\n sup=sup-1\r\n elif L[i-1]>a:\r\n inf=1\r\n sup=sup-1\r\n else:\r\n inf=inf+1\r\n sup=0\r\n if sup==0 and i!=n-1:\r\n b=L[i+1]\r\n while a>=b and j<n-2:\r\n sup+=1\r\n j+=1\r\n a=L[j]\r\n b=L[j+1]\r\n if j==n-2 and a>=b:\r\n sup+=1\r\n s=max(s,sup+inf)\r\nprint(s)\r\n", "n =int(input()) \r\nl = list(map(int ,input().split())) \r\nl = l+[1001] \r\nmx =None\r\nres = None\r\nfor idx , value in enumerate(l[:-1]) : \r\n counter_id0 = 1\r\n counter_idn = 1\r\n counter = 1 \r\n if idx == 0 :\r\n i = 0 \r\n while l[i] >= l[i+1] : \r\n counter_id0 += 1\r\n i += 1 \r\n res = counter_id0\r\n elif idx == n-1 : \r\n while l[idx] >= l[idx - 1] :\r\n counter_idn += 1\r\n idx -= 1 \r\n res = counter_idn\r\n else : \r\n idx_cpy = idx\r\n idx_cpy1 = idx\r\n while l[idx_cpy ] >= l[idx_cpy + 1] and idx_cpy <= n -1: \r\n counter += 1 \r\n idx_cpy += 1 \r\n while l[idx_cpy1] >= l[idx_cpy1 - 1] and idx_cpy1 >= 0: \r\n counter += 1 \r\n idx_cpy1 -= 1 \r\n res = counter \r\n if mx is None or res > mx : \r\n mx = res \r\nprint(mx)\r\n \r\n", "import sys\r\nfrom collections import Counter\r\ndef f1(n,l):\r\n m=0\r\n k1=0\r\n k2=0\r\n for i in range(n):\r\n c=0\r\n k1=i\r\n for j in range(i+1,n):\r\n if l[k1]>=l[j]:\r\n c=c+1\r\n k1=j\r\n else:\r\n break\r\n k2=i\r\n for j1 in range(i,-1,-1):\r\n if l[k2]>=l[j1]:\r\n c=c+1\r\n k2=j1\r\n else:\r\n break\r\n if c>m:\r\n m=c\r\n return m \r\n\r\n \r\n \r\n \r\nif __name__ == '__main__': \r\n input = sys.stdin.read()\r\n data = list(map(int, input.split()))\r\n n = data[0]\r\n l = data[1:]\r\n print(f1(n,l))\r\n ", "def main():\r\n n = int(input())\r\n heights = list(map(int, input().split()))\r\n max_number = 0\r\n\r\n for i in range(n):\r\n count = 1\r\n for j in range(i-1, -1, -1):\r\n if heights[j] <= heights[j+1]:\r\n count += 1\r\n continue\r\n break\r\n\r\n for j in range(i+1, n):\r\n if heights[j] <= heights[j-1]:\r\n count += 1\r\n continue\r\n break\r\n if count > max_number:\r\n max_number = count\r\n\r\n print(max_number)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\na = [int(i) for i in input().split()]\n\nmax_count = 0\n\nfor i in range(n):\n\tcur_count = 0\n\tl = i-1\n\tr = i+1\n\n\t# Left half\n\tcur = a[i]\n\twhile l >= 0:\n\t\tif a[l] <= cur:\n\t\t\tcur_count += 1\n\t\t\tcur = a[l]\n\t\telse:\n\t\t\tbreak\n\t\tl -= 1 \n\n\t#Right half\n\tcur = a[i]\n\twhile r < n:\n\t\tif a[r] <= cur:\n\t\t\tcur_count += 1\n\t\t\tcur = a[r]\n\t\telse:\n\t\t\tbreak\n\t\tr += 1\n\n\tmax_count = max(cur_count, max_count)\n\nprint(max_count+1)\n\n\n", "from sys import stdin, stdout\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\n#for _ in range(int(stdin.readline())):\r\nn=int(stdin.readline())\r\na=get_array()\r\nmax_len=0\r\nfor i in range(n):\r\n j=i\r\n l=1\r\n while j>0:\r\n if a[j]>=a[j-1]:\r\n l+=1\r\n else:\r\n break\r\n j=j-1\r\n j=i\r\n while j<n-1:\r\n if a[j]>=a[j+1]:\r\n l+=1\r\n else:\r\n break\r\n j+=1\r\n max_len=max(l,max_len)\r\nprint(max_len)\r\n\r\n \r\n\r\n", "R=lambda:map(int,input().split())\r\nn=int(input())\r\na=list(R())\r\nb=0\r\nfor i in range(n):\r\n t=1\r\n for j in range(i-1,-1,-1):\r\n if(a[j+1]>=a[j]):\r\n t+=1\r\n else:\r\n break\r\n for j in range(i+1,n):\r\n if(a[j-1]>=a[j]):\r\n t+=1\r\n else:\r\n break\r\n b=max(b,t)\r\nprint(b)", "n, = map(int, input().split())\nA = list(map(int, input().split()))\n\nhi = 0\n\nfor i in range(len(A)):\n cur = 1\n \n j = i-1\n prev = A[i]\n while j >= 0 and A[j] <= prev:\n cur += 1\n prev = A[j]\n j-=1\n\n j = i+1\n prev = A[i]\n while j < n and A[j] <= prev:\n cur += 1\n prev = A[j]\n j+=1\n\n hi = max(hi, cur)\n\n\nprint(hi)\n\n", "# Author : keba\r\n\r\nimport sys\r\n# from collections import Counter, defaultdict, deque\r\nfrom math import ceil, floor, gcd, inf, sqrt\r\n# from itertools import permutations, combinations, accumulate\r\n# from bisect import bisect_left, bisect_right\r\n# from heapq import heapify , heappop , heappush , heappushpop , heapreplace \r\n\r\ndef S():return sys.stdin.readline().rstrip()\r\ndef I():return int(S())\r\ndef M():return map(int, S().split())\r\ndef L():return list(map(int, S().split()))\r\ndef SL():return sorted(L())\r\n\r\n\r\n\r\ndef main():\r\n \r\n n = I()\r\n arr = L() \r\n max_len = 0\r\n \r\n for i in range(len(arr)):\r\n l = i \r\n r = i \r\n\r\n while l-1 > -1 and arr[l-1] <= arr[l]:\r\n l -= 1\r\n \r\n while r+1 < len(arr) and arr[r+1] <= arr[r]:\r\n r += 1\r\n max_len = max(max_len, (r-l+1))\r\n \r\n \r\n print(max_len)\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\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 \r\n main()\r\n", "class GardenSim:\r\n _gardenSections = []\r\n _wateredSections = []\r\n _n = 0\r\n\r\n def parseInput(self):\r\n self._n = int(input())\r\n self._gardenSections = list(map(int, input().split()))\r\n for _ in range(self._n):\r\n self._wateredSections.append(1)\r\n \r\n def __init__(self) -> None:\r\n self.parseInput()\r\n\r\n def simulateRightSide(self, section):\r\n currSection = section\r\n nextSection = section + 1\r\n while(nextSection < self._n):\r\n if(self._gardenSections[nextSection] <= self._gardenSections[currSection]):\r\n self._wateredSections[section] += 1\r\n currSection = nextSection\r\n nextSection += 1\r\n else:\r\n break\r\n \r\n def simulateLeftSide(self, section):\r\n currSection = section\r\n nextSection = section - 1\r\n while(nextSection >= 0):\r\n if(self._gardenSections[nextSection] <= self._gardenSections[currSection]):\r\n self._wateredSections[section] += 1\r\n currSection = nextSection\r\n nextSection -= 1\r\n else:\r\n break\r\n \r\n def runSimulation(self):\r\n for section in range(self._n):\r\n self.simulateLeftSide(section)\r\n self.simulateRightSide(section)\r\n return max(self._wateredSections)\r\n\r\n\r\n\r\nsim = GardenSim()\r\n\r\nprint(sim.runSimulation())", "t = int(input())\r\nn = list(map(int, input().split()))\r\n\r\ndef cal(i):\r\n res = 1\r\n x = i\r\n while x< t-1 and n[x] >= n[x+1] :\r\n res+=1\r\n x+=1\r\n x=i\r\n while x>0 and n[x]>= n[x-1]:\r\n res+=1\r\n x-=1\r\n return res \r\n\r\nresult = -1\r\nfor i in range(t):\r\n \r\n res = cal(i)\r\n if(result<res):\r\n result = res\r\n\r\nprint(result)", "def longest_non_dec_non_inc_subarray(arr):\r\n n = len(arr)\r\n \r\n non_decreasing_lengths = [1] * n\r\n non_increasing_lengths = [1] * n\r\n \r\n for i in range(1, n):\r\n if arr[i] >= arr[i - 1]:\r\n non_decreasing_lengths[i] = non_decreasing_lengths[i - 1] + 1\r\n \r\n for i in range(n - 2, -1, -1):\r\n if arr[i] >= arr[i + 1]:\r\n non_increasing_lengths[i] = non_increasing_lengths[i + 1] + 1\r\n \r\n max_length = 0\r\n for i in range(n):\r\n combined_length = non_decreasing_lengths[i] + non_increasing_lengths[i] - 1\r\n max_length = max(max_length, combined_length)\r\n \r\n return max_length\r\n\r\n# Read input\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\n# Find and print the length of the longest non-decreasing-then-non-increasing subarray\r\nprint(longest_non_dec_non_inc_subarray(arr))\r\n", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nmax_co = 0\r\nfor i in range(n):\r\n\tli = l[:i]\r\n\tlp = l[i:]\r\n\tli.reverse()\r\n\tco = 0\r\n\tlevel = l[i]\r\n\tfor ii in li:\r\n\t\tif ii <= level:\r\n\t\t\tlevel = ii\r\n\t\t\tco += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tlevel = l[i]\r\n\tfor ii in lp:\r\n\t\tif ii <= level :\r\n\t\t\tlevel = ii\r\n\t\t\tco += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\t\r\n\tif co > max_co:\r\n\t\tmax_co = co\r\nprint(max_co)", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline()\n\nn = [int(x) for x in input().split(' ')][0]\n\nheights = [int(h) for h in input().split(' ')]\n\nresult = 0\n\nfor i, h in enumerate(heights):\n\ttotal = 1\n\tl = i - 1\n\tr = i + 1\n\n\twhile l >= 0 and heights[l] <= heights[l+1]:\n\t\ttotal += 1\n\t\tl -= 1\n\n\twhile r <= len(heights) - 1 and heights[r] <= heights[r-1]:\n\t\ttotal += 1\n\t\tr += 1\n\n\tresult = max(result, total)\n\nprint(result)\n\n\t\t\n\n\t\t\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(n):\r\n c=1\r\n t=i\r\n while t>0 and l[t-1]<=l[t]:\r\n c+=1\r\n t-=1\r\n t = i\r\n while t<=n-2 and l[t]>=l[t+1]:\r\n c+=1\r\n t+=1\r\n l1.append(c)\r\nprint(max(l1))", "n = int(input())\r\nsections = [int(i) for i in input().split(\" \")]\r\nmax_count = 0\r\nlocation = -1\r\nfor i in range(n):\r\n count = 1\r\n cur = sections[i]\r\n min_l = cur\r\n min_r = cur\r\n l = i - 1\r\n r = i + 1\r\n\r\n while l >= 0 and not sections[l] > min_l:\r\n min_l = min(min_l, sections[l])\r\n count += 1\r\n l -= 1\r\n while r < n and not sections[r] > min_r:\r\n min_r = min(min_r, sections[r])\r\n count += 1\r\n r += 1\r\n if count >= max_count:\r\n location = i + 1\r\n max_count = count\r\n\r\nprint(max_count)\r\n", "import sys\nimport math\ninput = sys.stdin.readline\n\nn = int(input().strip())\na = list(map(int, input().split()))\n\nif n == 1: print(1)\nelse:\n ans = 0\n for i in range(n):\n cnt = 1\n for j in range(i + 1, n):\n if a[j] > a[j - 1]: break\n else: cnt += 1\n for j in range(i - 1, -1, -1):\n if a[j] > a[j + 1]: break\n else: cnt += 1\n ans = max(ans, cnt)\n print(ans)\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl2 = list(reversed(l))\r\nans = 0\r\n\r\nfor i in range(n):\r\n tmp = l[i]\r\n c = 1\r\n for j in range(i - 1 , - 1, - 1):\r\n if l[j] > tmp:\r\n break\r\n tmp , c = l[j] , c + 1\r\n\r\n tmp = l[i]\r\n for j in range(i+1 , n):\r\n if l[j] > tmp :\r\n break\r\n tmp , c = l[j] , c +1\r\n\r\n if c > ans :\r\n ans=c\r\n\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nr = [0]*n\r\nl1 = 0\r\nr1 = 0\r\nfor i in range(n-1):\r\n if s[i+1] >= s[i]:\r\n l1 += 1\r\n else:\r\n l1 = 0\r\n r[i+1] += l1\r\n if s[n-1-i] <= s[n-2-i]:\r\n r1 += 1\r\n else:\r\n r1 = 0\r\n r[n-2-i] += r1\r\nprint(max(r)+1)\r\n", "_ = input()\r\n\r\na = list(map(int,input().split()))\r\n\r\nb = []\r\n\r\ndef left(i):\r\n count = 0\r\n prev = a[i]\r\n for j in range(i,-1,-1):\r\n if a[j]>prev:\r\n break\r\n count+=1\r\n prev=a[j]\r\n return count\r\n\r\ndef right(i):\r\n count = 0\r\n prev = a[i]\r\n for j in range(i+1,len(a)):\r\n if a[j]>prev:\r\n break\r\n count+=1\r\n prev=a[j]\r\n return count\r\n\r\nfor i in range(len(a)):\r\n b.append(left(i)+right(i))\r\n\r\nprint(max(b))\r\n", "n = int(input())\ngarden = list(map(int, input().split(\" \")))\n\nans = 0\n\nfrom collections import deque\nleft_flow = [0]\nright_flow = deque()\nright_flow.append(0)\n\nfor i in range(1, len(garden)):\n if garden[i] >= garden[i - 1]:\n left_flow.append(left_flow[i-1] + 1)\n else:\n left_flow.append(0)\n\nfor i in range(len(garden) - 2, -1, -1):\n if garden[i] >= garden[i + 1]:\n right_flow.appendleft(right_flow[-(len(garden) - 1 - i)] + 1)\n else:\n right_flow.appendleft(0)\n\nm = 1\nfor i in range(len(garden)):\n m = max(m, 1 + left_flow[i] + right_flow[i])\nprint(m)\n", "n = int(input())\r\nh = *map(int, input().split()),\r\ncount = 1\r\n\r\nfor i in range(n):\r\n x = y = h[i]\r\n k = j = i\r\n while j - 1 >= 0 and h[j - 1] <= x:\r\n j -= 1\r\n x = h[j]\r\n while k < n and h[k] <= y:\r\n y = h[k]\r\n k += 1\r\n count = max(count, k - j)\r\nprint(count)\r\n", "# import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w')\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nans=float('-inf')\r\nfor i in range(n):\r\n l,r=i,i\r\n c=0\r\n idx=0\r\n while l>0 and arr[l]>=arr[l-1]:\r\n c+=1\r\n l-=1\r\n while r<n-1 and arr[r]>=arr[r+1]:\r\n c+=1\r\n r+=1\r\n if c>ans:\r\n ans=c\r\n idx=i\r\nprint(ans+1)\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = [0] + list(map(int, input().split())) + [0]\r\nc = 0\r\nfor i in range(1, n+1):\r\n if w[i-1] <= w[i] >= w[i+1]:\r\n a = 0\r\n for j in range(i, 0, -1):\r\n if w[j-1] != 0 and w[j-1] <= w[j]:\r\n a += 1\r\n else:\r\n break\r\n for k in range(i, n+1):\r\n if w[k+1] != 0 and w[k+1] <= w[k]:\r\n a += 1\r\n else:\r\n break\r\n if a > c:\r\n c = a\r\nprint(c+1)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nres=1\r\n\r\nfor i in range(n):\r\n\tcurr=a[i]\r\n\tc=1\r\n\r\n\tfor j in range(i-1,-1,-1):\r\n\t\tif a[j]>curr:break\r\n\t\telse:c+=1;curr=a[j]\r\n\r\n\tcurr=a[i]\r\n\r\n\tfor k in range(i+1,n):\r\n\t\tif a[k]>curr:break\r\n\t\telse:c+=1;curr=a[k]\r\n\r\n\tres=max(res,c)\r\n\r\nprint(res)", "a=int(input())\r\nb=input().split()\r\ncount=0\r\nbig=0\r\nsmall=0\r\n\r\nfor i in range(len(b)):\r\n b[i]=int(b[i])\r\n\r\nfor j in range(len(b)):\r\n small=b[j]\r\n for m in range(j,a):\r\n if b[m]<=small:\r\n small=b[m]\r\n count=count+1\r\n else:\r\n break\r\n small=b[j]\r\n for n in range(j-1,-1,-1):\r\n if b[n]<=small:\r\n small=b[n]\r\n count=count+1\r\n else:\r\n break\r\n if big<count:\r\n big=count\r\n count=0\r\n\r\nprint(big)", "n=int(input())\r\nblocks=list(map(int,input().split()))\r\ncheck=0\r\nif len(blocks)==1:\r\n print(\"1\")\r\nelif len(blocks)==2:\r\n print(\"2\")\r\nelse:\r\n for i in range(0,len(blocks)):\r\n value=1\r\n temp=blocks[i]\r\n for j in range(i-1,-1,-1):\r\n if blocks[j]<=temp:\r\n value+=1\r\n temp=blocks[j]\r\n #print(\"haha left side\")\r\n else:\r\n break\r\n temp=blocks[i]\r\n for j in range(i+1,len(blocks)):\r\n if blocks[j]<=temp:\r\n value+=1\r\n temp=blocks[j]\r\n #print(\"haha right side\")\r\n else:\r\n break\r\n check=max(check,value)\r\n print(check)", "import sys\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\nn = iinput()\r\nA = rlinput()\r\nmax_count = 0\r\nfor i in range(n):\r\n count = 1\r\n for j in range(i,0,-1):\r\n if A[j] >= A[j-1]:\r\n count += 1\r\n else:\r\n break\r\n for j in range(i,n-1,1):\r\n if A[j] >= A[j+1]:\r\n count += 1\r\n else:\r\n break\r\n if count > max_count:\r\n max_count = count\r\nprint(max_count)\r\n", "n = int(input())\r\n\r\nt = list(map(int, input().split()))\r\n\r\nlength = n\r\nmaxv = 0\r\ntemp = 0\r\nfor i in range(length):\r\n temp = 0\r\n temp1 = t[i]\r\n for j in range(i,-1,-1):\r\n if temp1 >= t[j]:\r\n temp += 1\r\n temp1 = t[j]\r\n else:\r\n break\r\n temp1 = t[i]\r\n for j in range(i+1,length):\r\n if temp1 >= t[j]:\r\n temp += 1\r\n temp1 = t[j]\r\n else:\r\n break\r\n if temp > maxv:\r\n maxv = temp\r\n # print(i,temp)\r\nprint(maxv)\r\n", "numberOfSections = int(input())\r\nsectionsHeight = input().split(\" \")\r\n\r\nsectionsHeight = [int(i) for i in sectionsHeight]\r\nresult = []\r\ncount = 1\r\nfor i in range(0, len(sectionsHeight)):\r\n currentSection = sectionsHeight[i]\r\n\r\n if (i == len(sectionsHeight)-1 or (0 < i and i < len(sectionsHeight)-1)):\r\n\r\n for j in range(i-1, -1, -1):\r\n previousSection = sectionsHeight[j]\r\n if previousSection <= currentSection:\r\n count += 1\r\n else:\r\n break\r\n currentSection = previousSection\r\n currentSection = sectionsHeight[i]\r\n if (i == 0 or (0 < i and i < len(sectionsHeight)-1)):\r\n for k in range(i+1, len(sectionsHeight)):\r\n nextSection = sectionsHeight[k]\r\n if nextSection <= currentSection:\r\n count += 1\r\n else:\r\n break\r\n currentSection = nextSection\r\n result.append(count)\r\n count = 1\r\n\r\nprint(max(result))\r\n", "#This code is contributed by Siddharth\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n\r\n\r\n\r\n\r\n\r\n# ==========================================> Code Starts Here <=====================================================================\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\npre=[]\r\nfor i in range(n):\r\n if i==0 or a[i-1]>a[i]:\r\n pre.append(1)\r\n else:\r\n pre.append(pre[i-1]+1)\r\nsuf=[]\r\nfor i in range(n-1,-1,-1):\r\n if i==n-1 or a[i]<a[i+1]:\r\n suf.append(1)\r\n else:\r\n suf.append(suf[-1]+1)\r\nsuf=suf[::-1]\r\nmaxx=1\r\nfor i in range(n):\r\n maxx=max(pre[i]+suf[i]-1,maxx)\r\nprint(maxx)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nans = 1\r\n\r\nfor i in range(n):\r\n cnt = 1\r\n\r\n j = i - 1\r\n while j >= 0 and A[j] <= A[j + 1]:\r\n cnt += 1\r\n j -= 1\r\n \r\n j = i + 1\r\n while j < n and A[j] <= A[j - 1]:\r\n cnt += 1\r\n j += 1\r\n \r\n ans = max(ans, cnt)\r\n\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nre = -1\r\nfor i in range(n):\r\n height = a[i]\r\n x = 1\r\n l = i - 1\r\n while l >= 0 and a[l] <= height:\r\n height = a[l]\r\n x += 1\r\n l -= 1\r\n r = i + 1\r\n height = a[i]\r\n while r < n and a[r] <= height:\r\n height = a[r]\r\n x += 1\r\n r += 1\r\n re = max(re, x)\r\n\r\nprint(re)", "n = int(input())\r\nm = map(int,input().split())\r\nl=[]\r\nfor x in m :\r\n l.append(x)\r\nfor x in range(len(l)):\r\n if x == 0 :\r\n c=l[x]\r\n i = 0\r\n res=0\r\n while l[i]<=c : \r\n res+=1 \r\n c=l[i]\r\n i+=1\r\n if i == len(l) : \r\n break\r\n elif x == len(l)-1 :\r\n c=l[x]\r\n i = x-1\r\n res1=1\r\n while l[i]<=c : \r\n res1+=1\r\n c=l[i]\r\n i-=1\r\n if i == -1: \r\n break\r\n if res1>res : \r\n res=res1\r\n else :\r\n res3=1\r\n c = l[x]\r\n i=x-1\r\n while l[i]<=c :\r\n res3+=1\r\n c=l[i]\r\n i-=1\r\n if i == -1 : \r\n break\r\n c=l[x]\r\n i=x+1\r\n while l[i]<=c :\r\n res3+=1\r\n c=l[i]\r\n i+=1\r\n if i == len(l) : \r\n break\r\n if res3>res : \r\n res = res3\r\nprint(res)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmax=0\r\nif n==1:\r\n print(1)\r\n exit()\r\nfor i in range(n):\r\n j=1\r\n l=0\r\n r=0\r\n count=1\r\n k=i\r\n while l==0 or r==0:\r\n if i-j>=0:\r\n if a[i-j]>a[i-j+1]:\r\n l=1\r\n if l==0:\r\n count+=1\r\n else:\r\n l=1\r\n if i+j<n:\r\n if a[i+j]>a[i+j-1]:\r\n r=1\r\n if r==0:\r\n count+=1\r\n else:\r\n r=1\r\n j+=1\r\n if count>max:\r\n max=count\r\nprint(max)\r\n ", "t = int(input())\r\nlst = list(map(int,input().split()))\r\nlstr = [0]*t\r\nlstl = [0]*t\r\n\r\nfor i in range(t):\r\n if i == 0:\r\n continue\r\n \r\n if lst[i] >= lst[i-1]:\r\n lstr[i]+=lstr[i-1]\r\n lstr[i]+=1\r\n \r\nfor i in range(t-1,-1,-1):\r\n if i == t-1:\r\n continue\r\n \r\n if lst[i+1] <= lst[i]:\r\n lstl[i]+=lstl[i+1]\r\n lstl[i]+=1\r\n \r\nfor i in range(t):\r\n lstr[i]+=lstl[i]\r\nprint(max(lstr)+1)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nl=[1]*n\r\nr=[0]*n\r\nfor i in range(1,n):\r\n if x[i]>=x[i-1]:\r\n l[i]=l[i-1]+1\r\nfor i in range(n-2,-1,-1):\r\n if x[i]>=x[i+1]:\r\n r[i]=r[i+1]+1\r\nm=0\r\nfor i in range(n):\r\n m=max(m,r[i]+l[i])\r\nprint(m)", "n=int(input())\r\ninp=list(map(int,input().split()))\r\nans=1\r\nfor i in range(n):\r\n b=i-1\r\n a=i+1\r\n new=1\r\n while b!=-1 and inp[b]<=inp[b+1]:\r\n new+=1\r\n b-=1\r\n while a!=n and inp[a]<=inp[a-1]:\r\n new+=1\r\n a+=1\r\n ans=max(ans,new)\r\nprint(ans)\r\n", "n = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nmaxi = 1\r\nfor i in range(0, len(h)):\r\n w = 1\r\n right = left = h[i]\r\n right_index = left_index = i\r\n \r\n while right_index + 1 < len(h) and h[right_index + 1] <= right:\r\n w += 1\r\n right = h[right_index + 1]\r\n right_index += 1\r\n\r\n while left_index - 1 >= 0 and h[left_index - 1] <= left:\r\n w += 1\r\n left = h[left_index - 1]\r\n left_index -= 1\r\n maxi = max(maxi, w)\r\n\r\nprint(maxi)\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nRES = []\r\nfor i in range(n):\r\n\tres = 1\r\n\tj=i\r\n\t# if(n == 1):\r\n\t# \tRES.append(1)\r\n\t# \tcontinue\r\n\twhile j < n:\r\n\t\tif(j == n-1):\r\n\t\t\t# res += 1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tif(arr[j] >= arr[j+1]):\r\n\t\t\t\tres+=1\r\n\t\t\t\tj += 1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\tl = i\r\n\twhile l > 0 :\r\n\t\tif(l == 0):\r\n\t\t\t# res += 1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tif(arr[l] >= arr[l-1]):\r\n\t\t\t\tres+=1\r\n\t\t\t\tl -= 1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\tRES.append(res)\r\nprint(max(RES))", "n = int(input())\nnums = list(map(int, input().split()))\n\nans = 0\n\nfor i in range(n):\n curr = i\n left = i-1\n left_streak = 0\n right_streak = 0\n while left >= 0:\n if nums[left] <= nums[curr]:\n left_streak += 1\n left -= 1\n curr -= 1\n else:\n break\n\n curr = i\n right = i+1\n while right < n:\n if nums[right] <= nums[curr]:\n right_streak += 1\n right += 1\n curr += 1\n else:\n break\n\n ans = max(ans, left_streak + right_streak + 1)\n\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\na = list(map(int, input().split()))\r\nans = []\r\n\r\nfor i in range(n):\r\n count = 0\r\n j = i\r\n while j < n-1 and a[j+1] <= a[j]:\r\n j += 1\r\n count += 1\r\n j = i\r\n while j > 0 and a[j-1] <= a[j]:\r\n j -= 1\r\n count += 1\r\n ans.append(count)\r\n\r\nprint(max(ans)+1)\r\n", "n=int(input())\r\nl = [int(x) for x in input().split()]\r\nm=0\r\nfor i in range(n):\r\n f=0\r\n b=0\r\n for j in range(i+1,n):\r\n if l[j]<=l[j-1]:\r\n f+=1\r\n else:\r\n break\r\n for j in range(i-1,-1,-1):\r\n if l[j]<=l[j+1]:\r\n b+=1\r\n else:\r\n break\r\n tmp=f+b\r\n if tmp>m:\r\n m=tmp\r\nprint(m+1)", "import sys\nlines = sys.stdin.readlines()\nN = int(lines[0].strip())\nnums = list(map(int, lines[1].strip().split(\" \")))\nleft = [0]\ncurr = 0\nfor i in range(N-1):\n if nums[i+1] >= nums[i]: curr += 1\n else: curr = 0\n left.append(curr)\ncurr = 0\nfor i in range(N-2, -1, -1):\n if nums[i] >= nums[i+1]: curr += 1\n else: curr = 0\n left[i] += curr\n\nmaxV = max(left)\nprint(maxV + 1)\n", "# توكلت على الله\r\n\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\ndef solve():\r\n n = int(input())\r\n ls = list(map(int,input().split()))\r\n mx = 0\r\n \r\n for i in range(n):\r\n x = ls[i]\r\n l = 0\r\n for j in range(i+1,n):\r\n if ls[j] <= x:\r\n x = ls[j]\r\n l+=1\r\n else:\r\n break\r\n x = ls[i]\r\n r = 0\r\n for j in range(i-1,-1,-1):\r\n if ls[j] <= x:\r\n x = ls[j]\r\n r+=1\r\n else:\r\n break\r\n s = r+l+1\r\n mx = max(mx,s)\r\n print(mx) \r\n#for i in range(int(input())):\r\nsolve()", "def check_left(A):\r\n A.reverse()\r\n k = 0\r\n last = float('inf')\r\n for i in A:\r\n if i <= last:\r\n last = i\r\n k += 1\r\n else:\r\n return k\r\n return k\r\n \r\n\r\ndef check_right(A):\r\n k = 0\r\n last = float('inf')\r\n for i in A:\r\n if i <= last:\r\n last = i\r\n k += 1\r\n else:\r\n return k\r\n return k\r\n\r\n\r\nn = int(input())\r\nA = list(int(i) for i in input().split())\r\nmaximum = 0\r\nfor i in range(len(A)):\r\n summa = check_left(A[:i]) + check_right(A[i:])\r\n if summa > maximum:\r\n maximum = summa\r\nprint(maximum)\r\n \r\n", "n = int(input())\n\nhs = [int(x) for x in input().split()]\n\ndef peaks(hs):\n res = []\n \n # handle 1st ans the last points\n # TODO\n\n\ndef brute(hs):\n\n if len(hs) <= 2:\n return len(hs)\n\n max_res = 1\n for i in range(len(hs)):\n curr = 1\n \n # the right side\n j = i+1\n while j < len(hs):\n if hs[j-1] >= hs[j]:\n curr += 1\n j += 1\n else:\n break\n\n # the left side\n k = i-1\n while k >= 0:\n if hs[k] <= hs[k+1]:\n curr += 1\n k -= 1\n else:\n break\n \n # update max_res\n max_res = max(max_res, curr)\n\n return max_res\n\n\nprint(brute(hs))\n", "\r\nn = input()\r\n\r\narr = list(map(int,list(input().split())))\r\n\r\nhs_mp={}\r\n\r\ni = 0\r\nn = len(arr)\r\nleft_count = 0\r\nlast_left = 0\r\nright_count = 0\r\nwhile i < n:\r\n #get left fills\r\n j = i - 1\r\n while j >= 0 and arr[j] <= arr[i]:\r\n if j >= 1:\r\n if arr[j-1] > arr[j]:\r\n left_count += 1\r\n j = j - 1\r\n break\r\n # if arr[j] == arr[i]:\r\n # j = j - 1\r\n # continue\r\n j = j - 1\r\n left_count += 1\r\n\r\n hs_mp[i] = left_count\r\n # print(i, left_count+1)\r\n\r\n\r\n#arr = [3,1,2,1,1,1,3,3,4]\r\n\r\n j = i + 1\r\n while j < len(arr) and arr[j] <= arr[i]:\r\n if j < n-1:\r\n if arr[j+1] > arr[j]:\r\n right_count += 1\r\n j = j + 1\r\n break\r\n right_count += 1\r\n j = j + 1\r\n\r\n #print(i,right_count+1)\r\n\r\n hs_mp[i] = left_count + right_count + 1\r\n right_count = 0\r\n left_count = 0\r\n i += 1\r\n\r\n\r\nprint(max(hs_mp.values()))\r\n", "def maximal_sections(i,n,heights):\r\n counter = 1\r\n j = i\r\n while j > 0 and heights[j - 1] <= heights[j]:\r\n j -= 1\r\n counter += 1\r\n j = i\r\n while j < n - 1 and heights[j] >= heights[j + 1]:\r\n j += 1\r\n counter += 1\r\n return counter\r\n\r\n\r\nn = int(input())\r\nheights = list(map(int,input().split()))\r\n\r\nmax_section = 0\r\nfor i in range(n):\r\n max_section = max(max_section, maximal_sections(i,n,heights))\r\nprint(max_section)", "n=int(input())\na=list(map(int,input().split()))\na1=[0]*n\na2=[0]*n\nfor i in range(1,n):\n\tif a[i]>=a[i-1]:\n\t\ta1[i]=a1[i-1]+1\n\tif a[-i-1]>=a[-i]:\n\t\ta2[-i-1]=a2[-i]+1\nans=0\nfor i in range(n):\n\tans=max(a1[i]+a2[i],ans)\nprint(ans+1)\n", "N, Answer, X = int(input()), 0, list(map(int, input().split()))\r\nfor i in range(N):\r\n Check, indexR, indexL, Min = 0, i + 1, i - 1, X[i]\r\n while indexL >= 0:\r\n if X[indexL] <= Min:\r\n Min = min(Min, X[indexL])\r\n Check += 1\r\n indexL -= 1\r\n else:\r\n break\r\n Min = X[i]\r\n while indexR < N:\r\n if X[indexR] <= Min:\r\n Min = min(Min, X[indexR])\r\n Check += 1\r\n indexR += 1\r\n else:\r\n break\r\n Answer = max(Check, Answer)\r\nprint(Answer + 1)\r\n\r\n# Show you deserve being the best to whom doesn't believe in you.\r\n", "def maxSections(heights):\r\n if not heights:\r\n return 0\r\n\r\n n = len(heights)\r\n left = [0]*n; left[0] = 1\r\n for i in range(1, n):\r\n if heights[i] >= heights[i-1]:\r\n left[i] = left[i-1]+1\r\n else:\r\n left[i] = 1\r\n\r\n right = [0]*n; right[-1] = 1\r\n for i in range(n-2, -1, -1):\r\n if heights[i] >= heights[i+1]:\r\n right[i] = right[i+1]+1\r\n else:\r\n right[i] = 1\r\n\r\n res = 0\r\n for i in range(n):\r\n res = max(res, left[i]+right[i]-1)\r\n return res\r\n\r\n\r\nn = int(input())\r\nheights = list(map(int, input().split(' ')))\r\nprint(maxSections(heights))\r\n", "# Petya and Countryside\r\n\r\nn = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\ndef calc_left(heights, index, value):\r\n l_count = 0\r\n for i in range(index, -1, -1):\r\n if (heights[i] <= value):\r\n l_count += 1\r\n value = heights[i]\r\n else:\r\n break\r\n return l_count\r\ndef calc_right(heights, index, value):\r\n r_count = 0\r\n for i in range(index + 1, len(heights)):\r\n if (heights[i] <= value):\r\n r_count += 1\r\n value = heights[i]\r\n else:\r\n break\r\n return r_count\r\ncount = calc_left(heights, 0, heights[0]) + calc_right(heights, 0, heights[0])\r\nfor j in range(1, len(heights)):\r\n s_count = calc_left(heights, j, heights[j]) + calc_right(heights, j, heights[j]) \r\n if (count < s_count):\r\n count = s_count\r\n\r\nprint(count)", "n = int(input())\r\n\r\ns = input().split()\r\nfor i in range(0,len(s)):\r\n s[i] = int(s[i])\r\n\r\n\r\ncount = [1]*n\r\nfor i in range(0,n):\r\n\r\n for j in range(i,n-1):\r\n if s[j]>=s[j+1]:\r\n count[i] +=1\r\n \r\n else:\r\n break\r\n\r\n if i>=1:\r\n for k in range(i,0,-1):\r\n if s[k]>=s[k-1]:\r\n count[i]+=1\r\n\r\n else:\r\n break\r\n\r\nprint(max(count))\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nheight = list(map(int, input().split()))\r\ncount = [1] * n\r\n\r\n# first\r\ni = 1\r\nh = height[0]\r\nwhile i < n and height[i] <= h:\r\n count[0] += 1\r\n h = min(h, height[i])\r\n i += 1\r\n\r\n# last\r\ni = n - 2\r\nh = height[n - 1]\r\nwhile i >= 0 and height[i] <= h:\r\n count[n - 1] += 1\r\n h = min(h, height[i])\r\n i -= 1\r\n\r\n# middles\r\nfor curr in range(1, n - 1):\r\n i = curr + 1\r\n h = height[curr]\r\n while i < n and height[i] <= h:\r\n count[curr] += 1\r\n h = min(h, height[i])\r\n i += 1\r\n i = curr - 1\r\n h = height[curr]\r\n while i >= 0 and height[i] <= h:\r\n count[curr] += 1\r\n h = min(h, height[i])\r\n i -= 1\r\n\r\nres = max(count)\r\nprint(res)", "def findleft(ind, arr):\r\n j = ind - 1\r\n c = 0\r\n while j >= 0:\r\n if arr[j] <= arr[j + 1]:\r\n c += 1\r\n else:\r\n break\r\n j -= 1\r\n return c\r\n\r\n\r\ndef findright(ind, arr):\r\n j = ind + 1\r\n c = 0\r\n while j < len(arr):\r\n if arr[j] <= arr[j - 1]:\r\n c += 1\r\n else:\r\n break\r\n j += 1\r\n return c\r\n\r\n\r\nsz = int(input())\r\nlista = list(map(int, input().strip().split()))\r\nop = []\r\nfor i in range(sz):\r\n op.append(findright(i, lista) + findleft(i, lista) + 1)\r\nprint(max(op))\r\n", "n=int(input())\r\ns=input()\r\na=s.split(' ')\r\ndef Right(index):\r\n r=0\r\n for i in range(index+1,n,1):\r\n if int(a[index])>=int(a[i]):\r\n r+=1\r\n index+=1\r\n else:\r\n break\r\n return r\r\ndef left(index):\r\n lf=0\r\n for i in range(index-1,-1,-1):\r\n if int(a[index])>=int(a[i]):\r\n lf+=1\r\n index-=1\r\n else:\r\n break\r\n return lf\r\ntotal=1\r\ntemp=1\r\nfor i in range(n):\r\n if i==0:\r\n temp=1+Right(i)\r\n elif i==(n-1):\r\n temp=1+left(i)\r\n else:\r\n temp=1+Right(i)+left(i)\r\n if temp>total:\r\n total=temp\r\n\r\n temp=1\r\nprint(total)\r\n", "\r\ndef solution(a):\r\n max_rained_sections = 1\r\n for i in range(len(a)):\r\n rained_sections = 1\r\n for j in range(i, len(a)-1):\r\n if a[j] >= a[j+1]:\r\n rained_sections += 1\r\n\r\n else:\r\n break\r\n\r\n for j in range(i, 0, -1):\r\n if a[j] >= a[j-1]:\r\n rained_sections += 1\r\n\r\n else:\r\n break\r\n\r\n if rained_sections > max_rained_sections:\r\n max_rained_sections = rained_sections\r\n\r\n return max_rained_sections\r\n\r\n\r\nif __name__ == '__main__':\r\n n = input()\r\n a = list(map(int, input().split()))\r\n print(solution(a))\r\n", "n = int(input())\nheights = list(int(i) for i in input().split())\n\ndef length(index):\n count = 1\n left = index\n right = index\n for i in range(index):\n if heights[left-1] <= heights[left]:\n count += 1\n left -= 1\n else:\n pass\n for i in range(len(heights)-index-1):\n if heights[right+1] <= heights[right]:\n count += 1\n right += 1\n else:\n pass\n return count\n\narea = [length(i) for i in range(len(heights))]\n\nprint(max(area))\n", "n = int(input())\r\n\r\nlist1 = [int(x) for x in input().split()]\r\n\r\nsections = []\r\n\r\nfor i in range(n):\r\n c = 1\r\n \r\n j = i\r\n #check left\r\n while j > 0:\r\n if list1[j - 1] <= list1[j]:\r\n c += 1\r\n j -= 1\r\n else:\r\n break\r\n \r\n \r\n j = i\r\n #check right\r\n while j < n-1:\r\n if list1[j + 1] <= list1[j]:\r\n c += 1\r\n j += 1\r\n else:\r\n break\r\n \r\n sections.append(c)\r\n\r\nprint(max(sections))\r\n ", "n=int(input())\r\nheight=list(map(int,input().split()))\r\n# max=0\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n j=i-1\r\n k=i+1\r\n while j>=0:\r\n if height[j]>height[j+1]:\r\n break\r\n j-=1\r\n while k<n:\r\n if height[k]>height[k-1]:\r\n break\r\n k+=1\r\n c=max(c,k-j-1)\r\n l.append(c)\r\n# print(l)\r\nprint(c)\r\n \r\n", "n = int(input())\r\nmaxi = 0\r\narr = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n count = 0\r\n for j in range(i,-1,-1):\r\n if j-1>=0:\r\n if arr[j]<arr[j-1]:\r\n break\r\n else:\r\n count += 1\r\n for j in range(i,n):\r\n if j+1<n:\r\n if arr[j]<arr[j+1]:\r\n break\r\n else:\r\n count += 1\r\n if maxi<count:\r\n maxi = count\r\nprint(maxi+1)", "import sys, os, re, datetime\nfrom collections import *\nfrom bisect import *\ndef mat(v, *dims):\n def submat(i):\n if i == len(dims)-1: return [v for _ in range(dims[-1])]\n return [submat(i+1) for _ in range(dims[i])]\n return submat(0)\n__cin__ = None\ndef cin():\n global __cin__\n if __cin__ is None: __cin__ = iter(input().split(\" \"))\n try: return next(__cin__)\n except StopIteration:\n __cin__ = iter(input().split(\" \"))\n return next(__cin__)\ndef iarr(n): return [int(cin()) for _ in range(n)]\ndef farr(n): return [float(cin()) for _ in range(n)]\ndef sarr(n): return [cin() for _ in range(n)]\ndef carr(n): return input()\ndef imat(n, m): return [iarr(m) for _ in range(n)]\ndef fmat(n, m): return [farr(m) for _ in range(n)]\ndef smat(n, m): return [sarr(m) for _ in range(n)]\ndef cmat(n, m): return [input() for _ in range(n)]\n\nn = int(cin())\nres = 0\nl = mat(0, 1024)\nr = mat(0, 1024)\nh = iarr(n)\n \nfor i in range(1, n):\n if h[i] >= h[i-1]:\n l[i] = 1+l[i-1]\nfor i in range(n-2, -1, -1):\n if h[i] >= h[i+1]:\n r[i] = 1+r[i+1]\nfor i in range(n):\n res = max(res, l[i]+r[i]+1)\nprint(res)", "n = int(input())\r\nl = [*map(int, input().strip().split())]\r\n\r\nsa, sb = 0, -1\r\nmax_length = 1\r\nidx = None\r\nin_wave = False\r\nfor idx, c in enumerate(l[1:], 1):\r\n if c < l[idx - 1]:\r\n in_wave = True\r\n sb = idx\r\n elif in_wave:\r\n if c >= l[idx - 1]:\r\n if sb == -1:\r\n sb = idx - 1\r\n if c > l[idx - 1]:\r\n max_length = max(max_length, idx - sa)\r\n in_wave = False\r\n sa = sb\r\n sb = -1\r\n\r\nprint(max(max_length, idx - sa + 1) if idx else max_length)", "n = int(input())\ns = list(map(int,input().split()))\nr = [0]*n\nl1 = 0\nr1 = 0\nfor i in range(n-1):\n if s[i+1]>=s[i]:\n l1+=1\n else:\n l1=0\n r[i+1]+=l1\n if s[n-1-i]<=s[n-2-i]:\n r1+=1\n else:\n r1=0\n r[n-2-i]+=r1\nprint(max(r)+1)", "num =int(input())\r\ncollection = list(map(int,input().split()))\r\ncounts=[]\r\nfor i in range(num):\r\n a=collection[i]\r\n count=1 \r\n for j in range(i-1,-1,-1):\r\n if collection[j]<=a:\r\n count=count+1\r\n a=collection[j]\r\n else:\r\n break\r\n a=collection[i]\r\n for j in range(i+1,num):\r\n if collection[j]<=a:\r\n count=count+1\r\n a=collection[j]\r\n else:\r\n break\r\n counts.append(count)\r\nprint(max(counts))", "n = int(input())\r\na = *map(int, input().split()),\r\nans = 1\r\nfor i in range(n):\r\n L = R = i\r\n x = y = a[i]\r\n while R < n and y >= a[R]:\r\n y = a[R]\r\n R += 1\r\n while L-1 >= 0 and a[L-1] <= x:\r\n L -= 1\r\n x = a[L]\r\n ans = max(ans, R-L)\r\nprint(ans)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n left = i\r\n for j in range(i,0,-1):\r\n if arr[left]>=arr[left-1]:\r\n left-=1\r\n else:\r\n break\r\n right = i\r\n for j in range(i,n-1,1):\r\n if arr[right]>=arr[right+1]:\r\n right+=1\r\n else:\r\n break\r\n ans = max(ans,right-left+1)\r\nprint(ans)", "n = int(input())\r\nsections = list(map(int, input().split()))\r\nscores = []\r\n\r\nfor i in range(n):\r\n\ttotal = 1\r\n\tcurr = sections[i]\r\n\tfor j in range(i+1,n):\r\n\t\tif sections[j]<=curr:\r\n\t\t\ttotal+=1\r\n\t\t\tcurr = sections[j]\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\tcurr = sections[i]\r\n\tfor k in reversed(range(0,i)):\r\n\t\tif sections[k]<=curr:\r\n\t\t\ttotal+=1\r\n\t\t\tcurr = sections[k]\r\n\t\telse:\r\n\t\t\tbreak\r\n\tscores.append(total)\r\n\r\nprint(max(scores))", "a = int(input())\r\nb = list(map(int,input().split()))\r\nmaximum = 0\r\nfor i in range(a):\r\n ahead = 0\r\n behind= 0\r\n for j in range(i, a-1):\r\n if b[j+1]<= b[j]:\r\n ahead+=1\r\n else:\r\n break\r\n for k in range(i,0,-1):\r\n if b[k-1]<=b[k]:\r\n behind+=1\r\n else:\r\n break\r\n if ahead+behind > maximum:\r\n maximum = ahead+behind\r\nprint(maximum+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = 0\r\nc = [0]*n\r\nfor i in range(n):\r\n j = i-1\r\n k = i+1\r\n e = i\r\n g = i\r\n #print(j,k)\r\n while(j >= 0):\r\n if(a[i] >= a[j]):\r\n b += 1\r\n i = j\r\n j -= 1\r\n else:\r\n break\r\n c[e] += b\r\n #print(b)\r\n b = 0\r\n while(k <= n-1):\r\n if(a[e] >= a[k]):\r\n b += 1\r\n e = k\r\n k += 1\r\n else:\r\n break\r\n c[g] += b\r\n #print(b)\r\n b = 0\r\n e = g\r\nprint(max(c)+1)\r\n", "n = int(input())\r\nheights = list(map(int,input().split(\" \")))\r\n\r\nif n == 1 :\r\n print(1)\r\nelse:\r\n Up_phase = True if heights[0] <= heights[1] else False\r\n max_of_accssiable_hieght = 0\r\n last_stop = 0\r\n i = 1\r\n count = 1\r\n\r\n while i < n:\r\n # b,b case and b,e case \r\n\r\n if i != n-1 and (heights[i-1] > heights[i] < heights[i+1] or (heights[i] < heights[i-1] and heights[i] == heights[i+1])) :\r\n last_stop = i\r\n\r\n if Up_phase and heights[i] >= heights[i-1]:\r\n count += 1\r\n\r\n elif Up_phase and heights[i] < heights[i-1]:\r\n Up_phase = not(Up_phase)\r\n count += 1\r\n\r\n elif not Up_phase and heights[i] <= heights[i-1]:\r\n count += 1\r\n\r\n else:\r\n i = last_stop\r\n Up_phase = not(Up_phase)\r\n count = 1\r\n \r\n\r\n max_of_accssiable_hieght = max(max_of_accssiable_hieght,count)\r\n i+=1\r\n \r\n\r\n print(max_of_accssiable_hieght)", "n = int(input())\r\ngarden = [int(x) for x in input().split()]\r\n\r\nans = 0\r\nfor i in range(n):\r\n # Try watering from i\r\n \r\n # to the left\r\n cur = 1\r\n j = i\r\n while j-1 >= 0:\r\n if garden[j] >= garden[j-1]:\r\n cur += 1\r\n else:\r\n break\r\n j -= 1\r\n\r\n j = i\r\n while j+1 < n:\r\n if garden[j] >= garden[j+1]:\r\n cur += 1\r\n else:\r\n break\r\n j += 1\r\n\r\n ans = max(ans,cur)\r\n\r\nprint(ans)\r\n", "num = int(input())\r\narray = input().split(' ')\r\nmax_count = 1\r\nfor i in range(num):\r\n count = 1\r\n left = i-1\r\n right = i+1\r\n temp_left = int(array[i])\r\n temp_right = int(array[i])\r\n\r\n while left >=0:\r\n if int(array[left]) <= temp_left:\r\n count +=1\r\n else:\r\n break\r\n temp_left = int(array[left])\r\n left -=1\r\n \r\n while right < num:\r\n if int(array[right])<= temp_right:\r\n count +=1\r\n else: \r\n break\r\n temp_right = int(array[right])\r\n right +=1\r\n\r\n if count > max_count:\r\n max_count = count\r\n\r\nprint(max_count)", "n = int(input())\r\nA = list(map(int , input().split()))\r\ncount = [0]*n\r\n#first section\r\nt = 0 \r\nf, s =(0, 1)\r\nwhile (f < n-1 and A[f] >= A[s]):\r\n\tcount[0]+=1\r\n\ts +=1\r\n\tf +=1\r\n\r\n#second section\r\nfor i in range(1 ,n-1):\r\n\ts, f =i+1 , i\r\n\twhile (f < n-1 and A[f] >= A[s]):\r\n\t\tcount[i]+=1\r\n\t\ts +=1\r\n\t\tf +=1\r\n\r\n\ts , f=i-1 , i\r\n\twhile (f> 0 and A[f] >= A[s]):\r\n\t\tcount[i]+=1\r\n\t\tf -=1\r\n\t\ts -=1\r\n#third section\r\nf , s= n-1 , n-2\r\nwhile(f>0 and A[f]>=A[s]):\r\n\tcount[n-1]+=1\r\n\ts -=1\r\n\tf -=1\r\nm =max(count)\r\nprint(m+1)", "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\nmylist = list(map(int,stdin.readline().strip().split()))\r\nmx = 0\r\nfor i in range(len(mylist)):\r\n\ta = i-1 \r\n\tb = i+1\r\n\tcounter = 1 \r\n\twhile a >= 0 or b < size:\r\n\t\tflag1 = flag2 = False\r\n\t\tif a >=0 and mylist[a] <= mylist[a+1]:\r\n\t\t\tcounter+=1\r\n\t\t\ta-=1\r\n\t\t\tflag1 = True\r\n\t\tif b< size and mylist[b] <= mylist[b-1]:\r\n\t\t\tcounter+=1\r\n\t\t\tb+=1\r\n\t\t\tflag2= True\r\n\t\tif flag1 == flag2 == False:\r\n\t\t\tbreak\r\n\t\r\n\tif counter >mx:\r\n\t\tmx = counter\r\nprint(mx)\r\n", "\r\nn = int(input())\r\nar = [int(x) for x in input().split() ]\r\n\r\nmx = -1\r\n\r\nfor i in range(0,n):\r\n cnt = 1\r\n \r\n tresh = ar[i]\r\n \r\n use = i\r\n\r\n while use > 0:\r\n\r\n if ( ar[use-1] <= tresh ):\r\n tresh = ar[use-1]\r\n cnt += 1\r\n use -= 1\r\n else:\r\n break\r\n\r\n tresh = ar[i]\r\n use = i\r\n\r\n while use < n-1:\r\n if ( ar[use+1] <= tresh ):\r\n tresh = ar[use+1]\r\n\r\n cnt += 1\r\n use += 1\r\n else:\r\n break\r\n\r\n mx = max( [mx, cnt] )\r\n\r\nprint(mx)\r\n \r\n", "def previous(l,index):\r\n if(index==0):\r\n return 0\r\n count=0\r\n while(l[index-1]<=l[index]):\r\n index-=1\r\n count+=1\r\n if(index<1):\r\n break\r\n return count\r\n\r\ndef after(l,index):\r\n if(index==len(l)-1):\r\n return 0\r\n count=0\r\n while(l[index+1]<=l[index]):\r\n index+=1\r\n count+=1\r\n if(index>=len(l)-1):\r\n break\r\n return count\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nans=1\r\nfor i in range(n):\r\n ans=max(ans,1+previous(l,i)+after(l,i))\r\nprint(ans)\r\n", "n=int(input())\r\nlisty=list(map(int,input().split()))\r\ncounter=0\r\nmaxer=0\r\nfor i in range(len(listy)):\r\n counter = 0\r\n if(i==0):\r\n for j in range(i,n-1):\r\n if(listy[j]>=listy[j+1]):\r\n counter += 1\r\n else : \r\n break\r\n else: \r\n for j in range(i,n-1):\r\n if(listy[j]>=listy[j+1]):\r\n counter += 1\r\n else :break;\r\n for j in range(i,0,-1):\r\n if(listy[j]>=listy[j-1]):\r\n \r\n counter += 1\r\n # print(counter,i+1,listy[j],listy[j-1])\r\n else :break;\r\n counter += 1\r\n maxer=max(counter,maxer)\r\nprint(maxer)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nans=1\r\nfor i in range(n):\r\n l=0\r\n r=0\r\n for j in range(i,0,-1):\r\n if(arr[j]<arr[j-1]):\r\n l=i-j\r\n break\r\n elif(j==1):\r\n l=i\r\n for j in range(i,n-1):\r\n if(arr[j]<arr[j+1]):\r\n r=j-i\r\n break\r\n elif(j==n-2):\r\n r=n-i-1\r\n ans=max(ans,l+r+1)\r\nprint(ans)", "#66B\r\nh = int(input())\r\nheight = list(map(int, input().split()))\r\npre = [0]*h\r\nsuf = [0]*h\r\nfor i in range(1,h):\r\n if height[i] >= height[i-1]:\r\n pre[i] = pre[i-1]+1 \r\n if height[-i-1] >= height[-i]: \r\n suf[-i-1] = suf[-i]+1 \r\n \r\n# print(pre,suf)\r\nres = 1\r\nfor i in range(h):\r\n res = max(res,(pre[i]+suf[i]+1))\r\nprint(res) \r\n \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmx = -1\r\nfor i in range(n):\r\n j = i-1\r\n last=arr[i]\r\n p=0\r\n while j>=0 and arr[j]<=last:\r\n last=arr[j]\r\n j-=1\r\n p+=1\r\n j=i+1\r\n last=arr[i]\r\n while j<n and arr[j]<=last:\r\n last = arr[j]\r\n j+=1\r\n p += 1\r\n p += 1\r\n mx = max(p, mx)\r\nprint(mx)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = 1\r\nd = 0\r\nz = list()\r\nfor i in range(n):\r\n for k in range(len(s[i:n])):\r\n if k + i == n - 1:\r\n break\r\n if s[k+i] >= s[k + i + 1]:\r\n c += 1\r\n else:\r\n break\r\n for j in range(len(s[0:i+1])):\r\n if j - i == 0:\r\n break\r\n if s[i-j] >= s[i-j-1]:\r\n d += 1\r\n else:\r\n break\r\n z.append(c+d)\r\n c = 1\r\n d = 0\r\nprint(max(z))", "def main():\r\n\t\r\n\tn = int(input())\r\n\ta = [int(i) for i in input().split()]\r\n\t\r\n\tcnt = 0\r\n\tfor i in range(n):\r\n\t\ttemp = 1\r\n\t\tk = i\r\n\t\tj = i - 1\r\n\t\twhile j >= 0 and a[j] <= a[k]:\r\n\t\t\ttemp += 1\r\n\t\t\tj -= 1\r\n\t\t\tk -= 1\r\n\r\n\t\tif i == n - 1:\r\n\t\t\tcnt = max(cnt, temp)\r\n\t\t\tbreak\r\n\r\n\t\tk = i\r\n\t\tj = i + 1\r\n\t\twhile j <= n - 1 and a[j] <= a[k]:\r\n\t\t\ttemp += 1\r\n\t\t\tj += 1\r\n\t\t\tk += 1\r\n\r\n\t\tcnt = max(cnt, temp)\r\n\r\n\r\n\tprint(cnt)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n# 1 2 1 1 1 3 3 4\r\n# 0 \r\n", "n = int(input())\narr = list(map(int, input().split()))\n\nmax_element = 0\n\nfor i in range(n):\n elLeft = 0\n elRight = 0\n ll = True\n rr = True\n cntLeft = 0\n cntRight = 0\n \n while rr:\n if i - elLeft - 1 >= 0 and i - elLeft - 1 < n:\n if arr[i - elLeft-1] <= arr[i-elLeft]:\n cntLeft += 1\n elLeft += 1\n else:\n rr = False\n else:\n rr = False\n while ll:\n if i + elRight + 1 < n and i + elRight + 1 >= 0:\n if arr[i + elRight + 1] <= arr[i+elRight]:\n cntRight += 1\n elRight += 1\n else:\n ll = False\n else:\n ll = False\n result = cntLeft + cntRight + 1\n max_element = max(max_element, result)\n\nprint(max_element)", "\ndef solve(n, l):\n p = c = out = 1\n\n for i in range(1, n):\n if l[i] > l[i-1]:\n p += 1\n c = p\n elif l[i] == l[i-1]:\n p += 1\n c += 1\n else:\n c += 1\n p = 1\n\n if c > out:\n out = c\n\n return out\n\n\nn = int(input())\nl = list(map(int, input().split()))\n\nprint(solve(n, l))\n", "import sys\n\ndef score(i, ns):\n s = 1\n n = ns[i]\n prev = n\n for j in range(i + 1, len(ns)):\n if ns[j] <= prev:\n s += 1\n prev = ns[j]\n else:\n break\n\n prev = n\n for j in range(i - 1, -1, -1):\n if ns[j] <= prev:\n s += 1\n prev = ns[j]\n else:\n break\n\n return s\n \ninput()\nns = [int(i) for i in input().split()]\n\na = [score(i, ns) for i in range(len(ns))]\nprint(max(a))\n\n\t \t \t \t\t\t \t \t\t\t\t\t\t \t \t\t \t", "def get_max_sections1(array):\n is_increasing = True\n max = 0\n cur_max = 0\n prev = 0\n for i in array:\n if is_increasing:\n if prev <= i:\n cur_max += 1\n else:\n cur_max += 1\n is_increasing = False\n else:\n if prev >= i:\n cur_max += 1\n else:\n is_increasing = True\n cur_max = 2\n prev = i\n if cur_max > max:\n max = cur_max\n\n return max\n\n\ndef get_max_sections(array):\n is_increasing = True\n max = 0\n cur_max = 0\n prev = 0\n for i in array:\n if is_increasing:\n if prev > i:\n is_increasing = False\n else:\n if prev < i:\n is_increasing = True\n cur_max = 1\n cur_max += 1\n prev = i\n if cur_max > max:\n max = cur_max\n\n return max\n\n\ndef calculate_max_sections(array):\n a = get_max_sections(array)\n b = get_max_sections(array[::-1])\n\n return a if a > b else b\n\n\nn = input()\narray = input()\narray = list(map(lambda x: int(x), array.split(' ')))\nprint(calculate_max_sections(array))\n\n# assert calculate_max_sections([1, 2, 1, 1, 1, 3, 3, 4]) == 6\n# assert calculate_max_sections([1, 2, 1, 2, 1]) == 3\n# assert calculate_max_sections([2]) == 1\n# assert calculate_max_sections([1, 2, 3, 4, 5, 4, 3, 2, 1]) == 9\n# assert calculate_max_sections([4, 3, 2, 1, 1, 2, 3, 4]) == 5\n# assert calculate_max_sections([6, 5, 6, 5, 6]) == 3\n\n", "def tinhgiot(vitri):\r\n L = 0\r\n i = vitri-1\r\n while i >= 0 and a[i] <= a[i+1]:\r\n L += 1\r\n i -= 1\r\n \r\n R = 0\r\n i = vitri+1\r\n while i < len(a) and a[i] <= a[i-1]:\r\n R += 1\r\n i += 1\r\n\r\n return L+R+1\r\n\r\nn = int(input())\r\na = []\r\na = list(map(int, input().split()))\r\n\r\nvaluemax = 0\r\nfor j in range(0,n):\r\n if tinhgiot(j) > valuemax:\r\n valuemax = tinhgiot(j)\r\n\r\nprint(valuemax)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nans=0\r\nfor i in range(len(a)):\r\n r=i\r\n t=i-1\r\n k=1\r\n while t>=0 and a[t]<=a[r]:\r\n k+=1\r\n r=t\r\n t-=1\r\n q=i+1\r\n s=i\r\n while q<n and a[s]>=a[q]:\r\n s=q\r\n q+=1\r\n k+=1\r\n ans=max(ans,k)\r\nprint(ans)\r\n", "def solve():\n arr.append(1001)\n arr.insert(0,10001)\n mx=-1\n for i in range(1,n+1) :\n c=1\n start=i\n end=i\n while True :\n if start>=0 and arr[start]>=arr[start-1] :\n c+=1\n start-=1\n elif end <= n+1 and arr[end]>=arr[end+1] :\n c+=1\n end+=1\n else:\n break\n mx=max(mx,c)\n return mx\n\n \n \n \n\n\n\n\n \n\n\n\n\n \n \nfrom sys import stdin\ninput = stdin.readline\n \n'''\nm,n= [int(x) for x in input().split()]\narr=[]\nfor i in range(m):\n arr.append([int(x) for x in input().split()])\n'''\nn=int(input())\narr=[int(x) for x in input().split()]\nprint(solve())", "n = int(input())\r\nc= list(map(int, input().split()))\r\nif n==1:\r\n print(1)\r\nelse:\r\n maxi = 0\r\n for i in range(n):\r\n count = 1\r\n for j in range(i+1, n):\r\n if c[j]<=c[j-1]:\r\n count+=1\r\n else:\r\n break\r\n for j in range(i-1, -1, -1):\r\n if c[j+1]>=c[j]:\r\n count+=1\r\n else:\r\n break\r\n maxi = max(count, maxi)\r\n print(maxi)\r\n", "def solve(e):\n ###### acotar en tuplas\n r=[[-1,0]]\n\n for num in e:\n if num == r[-1][0]:\n r[-1][1]+=1\n else:\n r.append([num,1])\n acum=0\n #######\n for i in range(len(r)):\n aux=r[i][1]\n ####left\n for j in range(i-1,-1,-1):\n if r[j+1]>r[j]:\n aux = aux + r[j][1]\n else:\n break\n for j in range(i+1,len(r)):\n if r[j-1]>r[j]:\n aux = aux + r[j][1]\n else:\n break\n acum=max(acum,aux)\n print(acum)\n\nn=int(input().strip())\ne=list(map(int,input().split()))\nsolve(e)\n", "def solution(a):\r\n m=0\r\n for i in range(len(a)):\r\n left=i-1\r\n right=i+1\r\n c=1\r\n if left>=0:\r\n tp1=a[i]\r\n if right<=len(a)-1:\r\n tp2=a[i]\r\n while left>=0 or right<=len(a)-1:\r\n if left>=0 and a[left]<=tp1:\r\n c+=1\r\n tp1=a[left]\r\n left=left-1\r\n else:\r\n left=-1\r\n \r\n if right<=len(a)-1 and a[right]<=tp2:\r\n c+=1\r\n tp2=a[right]\r\n right=right+1\r\n else:\r\n right=len(a)+1\r\n\r\n if c>m:\r\n m=c\r\n \r\n print(m)\r\n\r\n\r\n\r\nn=int(input(''))\r\na=list(map(int,input('').split()))\r\nsolution(a)", "n = int(input())\nsections = list(map(int, input().split()))\n\nmax_sections = -1\nfor i in range(n):\n left_i = i\n while left_i > 0 and sections[left_i - 1] <= sections[left_i]:\n left_i -= 1\n\n right_i = i\n while right_i < n - 1 and sections[right_i + 1] <= sections[right_i]:\n right_i += 1\n wet_sections = right_i - left_i + 1\n if wet_sections > max_sections:\n max_sections = wet_sections\n\nprint(max_sections)\n", "n = int(input())\r\n\r\ndef count_flow(n, a, direction):\r\n c = 0\r\n cur_max = a[n]\r\n start = 0\r\n end = 0\r\n if direction == 1:\r\n start = n + 1\r\n end = len(a)\r\n else:\r\n start = n - 1\r\n end = -1\r\n\r\n cur = start\r\n while cur != end:\r\n i = a[cur]\r\n if cur_max >= i:\r\n c += 1\r\n cur_max = i\r\n cur += direction\r\n else:\r\n break\r\n return c\r\n\r\nsections = list(map(int, input().split()))\r\n\r\ncurrent = 0\r\nans = 0\r\nwhile current < len(sections):\r\n# print('current: ', sections[current])\r\n left = count_flow(current, sections, -1)\r\n# print('left: ', left)\r\n right = count_flow(current, sections, 1)\r\n# print('right: ', right)\r\n count = left + right + 1\r\n if count > ans:\r\n ans = count\r\n current = current + right + 1\r\n else:\r\n current += 1\r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\r\nh = list(map(int, input().split()))\r\n \r\na,b = [0]*n , [0]*n\r\n\r\nfor i in range(1, n):\r\n if h[i] >= h[i - 1]: \r\n a[i] = a[i - 1] + 1\r\n if h[- i] <= h[- 1 - i]: \r\n b[- i - 1] = b[- i] + 1\r\n\r\nres=0\r\nfor i in range(n):\r\n res = max(a[i] + b[i] , res)\r\nprint(res + 1)", "n= int(input())\r\nls=list(map(int,input().split()))\r\n\r\nmax=0\r\ncounter=0\r\nfor i in range(n):\r\n l=r=i\r\n counter=0\r\n f=1\r\n # compare left\r\n while f:\r\n l -= 1\r\n if l>=0:\r\n if ls[l+1]>=ls[l]:\r\n counter+=1\r\n else: f=0\r\n else: f=0\r\n\r\n # compare right\r\n f=1\r\n while f:\r\n r += 1\r\n if r< n:\r\n if ls[r-1] >= ls[r]:\r\n\r\n counter += 1\r\n else:\r\n f = 0\r\n else:\r\n f = 0\r\n if counter>max:\r\n max=counter\r\nprint(max+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nif len(s) < 3:\r\n print(len(s))\r\n\r\nelse:\r\n increasing = True\r\n st_seg = 0\r\n end_seg = 0\r\n max_seg = 0\r\n eq_seq = False\r\n eq_seg = 1\r\n for i in range(len(s) - 1):\r\n\r\n if s[i] == s[i+1] and (not increasing):\r\n if eq_seq:\r\n eq_seg+=1\r\n eq_seq = True\r\n\r\n if s[i] < s[i + 1] and (not increasing):\r\n if eq_seq:\r\n seg_len = i + 1 - st_seg\r\n st_seg = i-eq_seg\r\n else:\r\n seg_len = i + 1 - st_seg\r\n st_seg = i\r\n max_seg = max(max_seg, seg_len)\r\n increasing = True\r\n elif s[i] > s[i + 1] and increasing:\r\n increasing = False\r\n\r\n if s[i] != s[i+1]:\r\n eq_seq = False\r\n eq_seg = 1\r\n\r\n\r\n if i == len(s) - 2:\r\n if st_seg == i:\r\n max_seg = max(max_seg, 2)\r\n else:\r\n seg_len = i + 2 - st_seg\r\n max_seg = max(max_seg, seg_len)\r\n\r\n print(max_seg)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # single integer input\r\n return(int(input()))\r\ndef inlt(): # list of integer 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(): # multiple integer variable input\r\n return(map(int,input().split()))\r\n\r\nn = inp()\r\ntiles = inlt()\r\n\r\nmax = 0\r\n\r\nfor index in range(n):\r\n flow = 1\r\n left = index\r\n right = index\r\n \r\n while right != n-1 and tiles[right+1] <= tiles[right]:\r\n flow += 1\r\n right += 1\r\n \r\n while left != 0 and tiles[left-1] <= tiles[left]:\r\n flow += 1\r\n left -= 1\r\n \r\n if flow >= max:\r\n max = flow\r\n\r\nprint(max)", "n=int(input())\r\nmax1=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n cnt=1\r\n for j in range(i+1,n):\r\n if l[j]<=l[j-1]:\r\n cnt+=1\r\n else:\r\n break\r\n for j in range(i-1,-1,-1):\r\n if l[j] <= l[j + 1]:\r\n cnt += 1\r\n else:\r\n break\r\n if cnt>max1:\r\n max1=cnt\r\nprint(max1)", "n = int(input())\r\nls = list(map(int, input().split(\" \")))\r\nfromleft = [0]*n\r\nfromright = [0]*n\r\n\r\ni = n-1\r\nfromright[i] = 1\r\nnoe = 1\r\nprev = ls[n-1]\r\ni-=1\r\nwhile(i >= 0):\r\n if(ls[i] >= prev ):\r\n noe+=1\r\n prev = ls[i]\r\n else:\r\n prev = ls[i]\r\n noe = 1\r\n fromright[i] = noe\r\n i-=1\r\n\r\ni = 0\r\nfromleft[i] = 1\r\nnoe = 1\r\nprev = ls[0]\r\ni+=1\r\nwhile(i < n):\r\n if(ls[i] >= prev ):\r\n noe+=1\r\n prev = ls[i]\r\n else:\r\n prev = ls[i]\r\n noe = 1\r\n fromleft[i] = noe\r\n i+=1\r\nmaxe = 1\r\nfor i in range(n):\r\n maxe = max(maxe, fromleft[i] + fromright[i]-1)\r\nprint(maxe)\r\n", "#LICS = longest_increasing_consecutive_subsquence\r\ndef LICS(lst,index):\r\n counter = 0\r\n for i in range(index+1,len(lst)):\r\n if lst[i] >= lst[i-1]:\r\n counter += 1\r\n else:\r\n return counter + 1 #inclusive of start \r\n return counter + 1\r\n\r\n#LDCS = longest_decreasing_consecutive_subsequence\r\ndef LDCS(lst,index):\r\n counter = 0\r\n for i in range(index+1,len(lst)):\r\n if lst[i] <= lst[i-1]:\r\n counter += 1\r\n else:\r\n return counter + 1 #inclusive of start \r\n return counter + 1\r\n\r\nn = int(input())\r\nheights = list(map(int,input().split()))\r\nhighest = 0\r\nfor i in range(n):\r\n # remove 1 to prevent double counting\r\n counter = LICS(heights,i) + LDCS(heights,i+LICS(heights,i)-1) - 1\r\n if counter > highest:\r\n highest = counter\r\nprint(highest)\r\n\r\n \r\n \r\n\r\n", "\"\"\"\nAUTHOR: Abas Farah\n\"\"\"\n\nimport sys\n\ndef sti(arr):\n return list(map(int,arr.split()))\n\ndef solve(n, arr):\n # print(n, arr)\n\n output = 0\n # 1. For every input go to right and left till it's not monotomically decreasing\n for i in range(len(arr)):\n p = i+1\n r = i-1\n m = arr[i]\n n = arr[i]\n count = 1\n while(r > -1 or p < len(arr)):\n if r > -1:\n if arr[r] <= m:\n count += 1\n m = arr[r]\n r-=1\n else:\n r = -1\n if p < len(arr):\n if arr[p] <= n:\n count += 1\n n = arr[p]\n p+=1\n else:\n p = len(arr)\n output = max(count, output)\n print(output)\n\n\ndef main():\n inputLines = sys.stdin.readlines()\n for i in range(len(inputLines)):\n inputLines[i] = inputLines[i].rstrip()\n\n n = int(inputLines[0])\n arr = sti(inputLines[1])\n solve(n, arr)\n\nif __name__ == \"__main__\":\n main()\n", "def solve(garden):\n maxCount = 0\n if len(garden) == 1:\n return 1\n for idx, val in enumerate(garden):\n i = idx-1\n count = 1\n num = val\n while i >= 0 and garden[i] <= num:\n count += 1\n num = garden[i]\n i -= 1\n \n num = val\n i = idx+1\n while i < len(garden) and garden[i] <= num:\n count += 1\n num = garden[i]\n i += 1\n \n maxCount = max(maxCount, count)\n return maxCount\n\n\n\nn = int(input())\ngarden = list(map(int, input().split()))\n\nprint(solve(garden))", "import heapq\r\nfrom collections import Counter\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\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\ndef inis():\r\n return(input().split())\r\n###################################################\r\n\r\n# # Code to find top 3 elements and their counts\r\n# # using most_common\r\n#\r\n# arr = [1, 3, 4, 1, 2, 1, 1, 3, 4, 3, 5, 1, 2, 5, 3, 4, 5]\r\n# counter = Counter(arr)\r\n# top_three = counter.most_common()\r\n# print(sorted(top_three))\r\n#\r\n#\r\n# # Python code to find 3 largest and 4 smallest\r\n# # elements of a list.\r\n#\r\n# grades = [110, 25, 38, 49, 20, 95, 33, 87, 80, 90, 110]\r\n# print(heapq.nlargest(3, grades))\r\n# print(heapq.nsmallest(4, grades))\r\n\r\n###########---------Code Here------------##############\r\nn = inp()\r\na = inlt()\r\ncount = 1\r\nfor i in range(n):\r\n l = i\r\n while l > 0 and a[l-1] <= a[l]:\r\n l -= 1\r\n while i < n-1 and a[i+1] <= a[i]:\r\n i += 1\r\n count = max(count, i-l+1)\r\nprint(count)", "le = int(input())\r\nli = list(map(int, input().split()))\r\nli.append(1001)\r\nmaxi = 0\r\ny = 0\r\nx = 0\r\n\r\nfor i in range(le):\r\n p = i\r\n if x <= 0:\r\n x = 0\r\n if li[p] > li[p-1]:\r\n y += 1\r\n else:\r\n y = 1\r\n while li[p+1] <= li[p]:\r\n x += 1\r\n p += 1\r\n else:\r\n if li[i] == li[i-1]:\r\n y += 1\r\n x -= 1\r\n else:\r\n y = 1\r\n x -= 1\r\n maxi = max(maxi, y+x)\r\n\r\nprint(maxi)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nans=-1\r\nfor i in range(n):\r\n j=i\r\n c=1\r\n while j<n-1:\r\n if a[j+1]<=a[j]:\r\n c+=1\r\n j+=1\r\n else:\r\n break\r\n j=i\r\n while j>0:\r\n if a[j-1]<=a[j]:\r\n c+=1\r\n j-=1\r\n else:\r\n break\r\n ans=max(ans,c)\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nl2=[0]*(n);l3=[0]*(n)\r\nc,c2=0,0\r\nfor i in range(1,n): \r\n if l[i]>=l[i-1]:l2[i]=l2[i-1]+1\r\n if l[-i-1]>=l[-i]:l3[-i-1]=l3[-i]+1\r\n \r\nres=0\r\nfor i in range(n):\r\n res=max(l2[i]+l3[i],res) \r\nprint(res+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\npref,suff=[1]*n,[1]*n\r\nfor i in range(1,n):\r\n if a[i]>=a[i-1]:\r\n pref[i]+=pref[i-1]\r\nfor i in range(n-2,-1,-1):\r\n if a[i]>=a[i+1]:\r\n suff[i]+=suff[i+1]\r\nans=1\r\nfor i in range(n-1):\r\n ans=max(ans,pref[i]+suff[i+1])\r\nprint(ans)", "\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_ints():\n return list(map(int, input().strip().split(' ')))\n\n\ndef solve():\n n = read_int()\n A = read_ints()\n L = [0]*n\n R = [0]*n\n for i in range(1, n):\n if A[i] >= A[i-1]:\n L[i] = L[i-1]+1\n for i in range(n-2, -1, -1):\n if A[i] >= A[i+1]:\n R[i] = R[i+1]+1\n return max(L[i]+R[i] for i in range(n))+1\n\n\nif __name__ == '__main__':\n print(solve())\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=0\r\nfor i in range(n):\r\n c=1\r\n for j in range(i,n-1):\r\n if a[j+1]<=a[j]:\r\n c+=1\r\n else:\r\n break\r\n for j in range(i,0,-1):\r\n if a[j-1]<=a[j]:\r\n c+=1\r\n else:\r\n break\r\n if c>m:\r\n m=c\r\nprint(m) ", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nbiggest = 0\r\nfor i in range(len(arr)):\r\n p1 = i - 1\r\n p2 = i + 1\r\n num = 1\r\n s = 0\r\n stop1 = stop2 = arr[i]\r\n while p1 >= 0:\r\n if arr[p1] <= stop1:\r\n stop1 = arr[p1]\r\n s += 1\r\n p1 -= 1\r\n else:\r\n break\r\n while p2 < len(arr):\r\n if arr[p2] <= stop2:\r\n stop2 = arr[p2]\r\n s += 1\r\n p2 += 1\r\n else:\r\n break\r\n \r\n num += s\r\n if num > biggest:\r\n biggest = num\r\n\r\nprint(biggest)", "numOfSec=input()\r\nheights=input().split()\r\nnumOfRains=[]\r\nfor i in range (len(heights)):\r\n heights[i]=int(heights[i])\r\nfor j in range (len(heights)):\r\n left=j-1\r\n right=j+1\r\n numOfRain=0\r\n currL=j\r\n currR=j\r\n while left >= 0:\r\n if heights[left] <= heights[currL]:\r\n numOfRain+=1\r\n currL=left\r\n left-=1\r\n else :\r\n break\r\n while right < len(heights):\r\n if heights[right] <= heights[currR]:\r\n numOfRain+=1\r\n currR=right\r\n right+=1\r\n else :\r\n break\r\n numOfRains.append(numOfRain)\r\n\r\n \r\nprint(max(numOfRains)+1)\r\n \r\n ", "input()\narr = list(map(int, input().split()))\n\nans = 1\n\nfor i in range(len(arr)):\n\n left = i - 1\n left_val = arr[i]\n\n count = 1\n\n while left >= 0 and arr[left] <= left_val:\n left_val = arr[left]\n count += 1\n left -= 1\n\n right = i + 1\n right_val = arr[i]\n\n while right < len(arr) and arr[right] <= right_val:\n right_val = arr[right]\n count += 1\n right += 1\n\n ans = max(ans, count)\n\nprint(ans)\n", "import sys, os, re, datetime\nfrom collections import *\n__cin_iter__ = None\ndef cin():\n try:\n global __cin_iter__\n if __cin_iter__ is None: __cin_iter__ = iter(input().split(\" \"))\n try: return next(__cin_iter__)\n except StopIteration:\n __cin_iter__ = iter(input().split(\" \"))\n return next(__cin_iter__)\n except EOFError: return None\ndef iin(): return int(cin())\ndef fin(): return float(cin())\ndef mat(v, *dims):\n def submat(i):\n if i == len(dims)-1: return [v for _ in range(dims[-1])]\n return [submat(i+1) for _ in range(dims[i])]\n return submat(0)\ndef iarr(n = 0): return [int(v) for v in input().split(\" \")]\ndef farr(n = 0): return [float(v) for v in input().split(\" \")]\ndef carr(n = 0): return input()\ndef sarr(n = 0): return [v for v in input().split(\" \")]\ndef imat(n, m = 0): return [iarr() for _ in range(n)]\ndef fmat(n, m = 0): return [farr() for _ in range(n)]\ndef cmat(n, m = 0): return [input() for _ in range(n)]\ndef smat(n, m = 0): return [sarr() for _ in range(n)]\n\nn = iin()\nres = 0\nl = mat(0, 1024)\nr = mat(0, 1024)\nh = iarr()\n\nfor i in range(1, n):\n if h[i] >= h[i-1]:\n l[i] = 1+l[i-1]\nfor i in range(n-2, -1, -1):\n if h[i] >= h[i+1]:\n r[i] = 1+r[i+1]\nfor i in range(n):\n res = max(res, l[i]+r[i]+1)\nprint(res)", "n=int(input())\r\nb=[]\r\nl=list(map(int,input().split()))\r\nif n>2:\r\n for i in range(n):\r\n count=0\r\n ref=l[i]\r\n for j in range(i-1,-1,-1):\r\n if ref>=l[j] and i!=0 :\r\n count+=1\r\n ref=l[j]\r\n # print(ref,j,l[i],i,\"loop1\")\r\n else:\r\n break\r\n ref=l[i] \r\n for j in range(i+1,n):\r\n if ref>=l[j] and i!=n-1:\r\n count+=1\r\n ref=l[j]\r\n # print(ref,j,l[i],\"loop2\") \r\n else:\r\n break\r\n #print(\"new\") \r\n #print(count)\r\n b.append(count)\r\n print(max(b)+1)\r\nelse:\r\n print(n)\r\n'''\r\n8\r\n1 2 1 1 1 3 3 4'''\r\n", "n=int(input())\r\na=list(map(int,input().rstrip().split()))\r\nmaxi=0\r\ncount=0\r\ncount1=0\r\nfor i in range(n):\r\n j=i\r\n count1=0\r\n count=0\r\n while(j>0):\r\n if a[j-1]<=a[j]:\r\n count1+=1\r\n else:\r\n break\r\n j-=1\r\n j=i\r\n while(j<n-1):\r\n if a[j+1]<=a[j]:\r\n count+=1\r\n else:\r\n break\r\n j+=1\r\n maxi=max(count+count1,maxi)\r\nprint(maxi+1)", "n = int(input())\r\nx = list(map(int,input().split()))\r\nc = 0\r\ncnt = 0\r\nfor i in range(0,n):\r\n cnt = 1\r\n for l in range(i-1,-1,-1):\r\n if x[l+1] >= x[l]:\r\n cnt += 1\r\n else:\r\n break\r\n for r in range(i+1,n):\r\n if x[r-1] >= x[r]:\r\n cnt += 1\r\n else:\r\n break\r\n c = max(c,cnt)\r\nprint(c)\r\n", "n = int(input())\nmaxi = 0\nheights = list(map(int,input().split()))\nfor i in range(n):\n current = 1\n for j in range(i,0,-1):\n if heights[j-1] > heights[j]:\n break\n current +=1\n for j in range(i,n-1,1):\n if heights[j+1] > heights[j]:\n break\n current +=1\n maxi = max(maxi,current)\nprint(maxi)", "n = int(input())\r\ndl = list(map(int, input().split()))\r\nrdl = dl[::-1]\r\nsu, du = 0, 0\r\nul = [0]\r\ndl_ = [0]\r\nfor i in range(1,n):\r\n if dl[i-1]<=dl[i]:\r\n su+=1\r\n else:\r\n su=0\r\n if rdl[i-1]<=rdl[i]:\r\n du+=1\r\n else:\r\n du=0\r\n ul.append(su)\r\n dl_.append(du)\r\ndl_=dl_[::-1]\r\nfor k in range(n):\r\n ul[k]+=dl_[k]\r\nprint(max(ul)+1)", "n = int(input())\r\nh = list(map(int, input().strip().split()))\r\nbefore = [0]*n\r\nafter = [0]*n\r\nfor i in range(1,n):\r\n\tif h[i] >= h[i-1]:\r\n\t\tbefore[i] = before[i-1] + 1\r\nfor i in range(n-2, -1, -1):\r\n\tif h[i] >= h[i+1]:\r\n\t\tafter[i] = after[i+1] + 1\r\nans = max(after[0], before[n-1]) + 1\r\n#print(before)\r\n#print(after)\r\nfor i in range(1, n-1):\r\n\tans = max(ans, before[i]+after[i] +1)\r\nprint(ans)", "n = int(input())\nh = list(map(int, input().split()))\nmaxi = float('-inf')\nfor i in range(n):\n c = 1\n while i + 1 != n and h[i+1] >= h[i]:\n c += 1\n i += 1\n while i + 1 != n and h[i+1] <= h[i]:\n c += 1\n i += 1\n maxi = max(maxi, c)\nprint(maxi)\n", "n = int(input())\r\nheights = list(map(int, input().split(\" \")))\r\nheights_before = []\r\noutput = []\r\n\r\nfor i in range(n):\r\n current = heights[i]\r\n counter = 1\r\n heights_before.insert(0, current)\r\n heights_after = heights[i::]\r\n \r\n if i != n-1:\r\n for index in range(len(heights_after)):\r\n if index != len(heights_after)-1:\r\n if heights_after[index] >= heights_after[index+1]:\r\n counter += 1\r\n else:\r\n break\r\n else:\r\n break\r\n\r\n if i != 0:\r\n for index in range(len(heights_before)):\r\n if index != len(heights_before)-1:\r\n if heights_before[index] >= heights_before[index+1]:\r\n counter += 1\r\n else:\r\n break\r\n else:\r\n break\r\n \r\n output.append(counter)\r\n \r\nprint(max(output))", "n = int(input())\nA = [int(x) for x in input().split()]\n\nans = [1] * n\ncnt = 0\nfor i in range(1, n):\n # print(\"he\", i)\n if A[i] >= A[i-1]:\n cnt += 1\n ans[i] += cnt\n else:\n cnt = 0\ncnt = 0\nfor i in range(n-2, -1, -1):\n if A[i] >= A[i+1]:\n cnt += 1\n ans[i] += cnt\n else:\n cnt = 0\nprint(max(ans))\n", "n = int(input())\nhs = list(map(int,input().split()))\nmx = -1\nstarting = 0\nending = 0\ndir = 0\nfor i in range(1,n):\n\tif hs[i-1]>hs[i]:\n\t\tstarting = i\n\t\tdir = -1\n\telif hs[i-1]<hs[i]:\n\t\tif dir < 1:\n\t\t\tending = i - ending\n\t\t\tmx = max(mx,ending)\n\t\t\tending = starting\n\t\tdir = 1\nending = n - ending\nmx = max(mx,ending)\nprint(mx)\n \t \t\t \t \t\t \t\t\t \t \t \t \t \t" ]

[ "import io, os, sys\r\n\r\npypyin = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ncpyin = sys.stdin.readline\r\ninput = pypyin if 'PyPy' in sys.version else cpyin\r\n\r\ndef strput():\r\n return input().decode() if 'PyPy' in sys.version else input()\r\n\r\n# code starts here\r\n\r\nclass SegmentTree:\r\n n, l, r = [], [], []\r\n size = 0\r\n\r\n def __init__(self, n):\r\n self.n = [0] * (n * 2)\r\n self.l = [0] * (n * 2)\r\n self.r = [0] * (n * 2)\r\n self.size = n\r\n\r\n def build(self, s):\r\n n = self.size\r\n for i in range(n):\r\n if s[i] == '(':\r\n self.l[n + i] = 1\r\n elif s[i] == ')':\r\n self.r[n + i] = 1 \r\n for i in range(n - 1, -1, -1):\r\n match = min(self.l[i << 1], self.r[i << 1 | 1])\r\n self.n[i] = self.n[i << 1] + self.n[i << 1 | 1] + match * 2\r\n self.l[i] = self.l[i << 1] + self.l[i << 1 | 1] - match\r\n self.r[i] = self.r[i << 1] + self.r[i << 1 | 1] - match\r\n \r\n def get(self, u, v): # [u, v)\r\n u += self.size\r\n v += self.size\r\n left, right = [], []\r\n while u < v:\r\n if u & 1:\r\n left.append((self.n[u], self.l[u], self.r[u]))\r\n u += 1\r\n if v & 1:\r\n v -= 1\r\n right.append((self.n[v], self.l[v], self.r[v]))\r\n u >>= 1\r\n v >>= 1\r\n n, l, r = 0, 0, 0\r\n leave = left\r\n leave.extend(right[::-1])\r\n for nn, ll, rr in leave:\r\n match = min(l, rr)\r\n n += nn + match * 2\r\n l += ll - match\r\n r += rr - match\r\n return n\r\n\r\n\r\ndef main():\r\n s = strput().rstrip()\r\n tree = SegmentTree(len(s))\r\n tree.build(s)\r\n q = int(input())\r\n for i in range(q):\r\n l, r = [int(x) for x in input().split()]\r\n print(tree.get(l - 1, r))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "class SegmentTree:\r\n def __init__(self, arr):\r\n self.size = len(arr)\r\n self.tree = [0] * (2 * self.size)\r\n\r\n for i in range(self.size):\r\n self.tree[i + self.size] = arr[i]\r\n\r\n self.build()\r\n\r\n def operation(self, a, b):\r\n return min(a, b)\r\n\r\n def build(self):\r\n for i in range(self.size - 1, 0, -1):\r\n self.tree[i] = self.operation(self.tree[i << 1], self.tree[i << 1 | 1])\r\n\r\n def query(self, l, r):\r\n l += self.size\r\n r += self.size\r\n result = float('inf') # Neutral element\r\n while l <= r:\r\n if l & 1:\r\n result = self.operation(result, self.tree[l])\r\n l += 1\r\n if not r & 1:\r\n result = self.operation(result, self.tree[r])\r\n r -= 1\r\n l >>= 1\r\n r >>= 1\r\n return result\r\n\r\n def set(self, index, val):\r\n self.tree[index + self.size] = val\r\n index = (index + self.size) >> 1\r\n\r\n while index > 0:\r\n self.tree[index] = self.operation(self.tree[index << 1], self.tree[index << 1 | 1])\r\n index >>= 1\r\n\r\n def add(self, index, val):\r\n self.set(index, self.tree[index + self.size] + val)\r\n\r\ndef solve_bracket_queries(s, queries):\r\n n = len(s)\r\n numbers = [0] * (n + 1)\r\n cumulative_sum = 0\r\n\r\n for i in range(1, n + 1):\r\n if s[i - 1] == '(':\r\n cumulative_sum += 1\r\n else:\r\n cumulative_sum -= 1\r\n numbers[i] = cumulative_sum\r\n\r\n answers = []\r\n minimums = SegmentTree(numbers)\r\n\r\n for query in queries:\r\n left, right = query\r\n left -= 1\r\n right -= 1\r\n count = numbers[right + 1] - numbers[left]\r\n min_val = min(minimums.query(left + 1, right + 1) - numbers[left], 0)\r\n\r\n if count < 0:\r\n min_val -= count\r\n\r\n length = right - left + 1\r\n result = length + 2 * min_val - abs(count)\r\n answers.append(result)\r\n\r\n return answers\r\n\r\nif __name__ == \"__main__\":\r\n s = input().strip() # Input string\r\n m = int(input()) # Number of queries\r\n queries = []\r\n\r\n for _ in range(m):\r\n l, r = map(int, input().split())\r\n queries.append((l, r))\r\n\r\n answers = solve_bracket_queries(s, queries)\r\n\r\n for ans in answers:\r\n print(ans)", "import os,sys;from io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno();self.buffer = BytesIO();self.writable = \"x\" in file.mode or \"r\" not in file.mode;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:break\r\n ptr = self.buffer.tell();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:b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE));self.newlines = b.count(b\"\\n\") + (not b);ptr = self.buffer.tell();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:os.write(self._fd, self.buffer.getvalue());self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file);self.flush = self.buffer.flush;self.writable = self.buffer.writable;self.write = lambda s: self.buffer.write(s.encode(\"ascii\"));self.read = lambda: self.buffer.read().decode(\"ascii\");self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ntry:sys.stdin,sys.stdout=open('in.txt','r'),open('out.txt','w')\r\nexcept:pass\r\nii1=lambda:int(sys.stdin.readline().strip()) # for interger\r\nis1=lambda:sys.stdin.readline().strip() # for str\r\niia=lambda:list(map(int,sys.stdin.readline().strip().split())) # for List[int]\r\nisa=lambda:sys.stdin.readline().strip().split() # for List[str]\r\nmod=int(1e9 + 7);\r\nfrom math import inf \r\nfrom collections import defaultdict as dd\r\n# from math import *\r\n# from collections import *;\r\n# from collections import deque as dq \r\n# from string import ascii_lowercase,ascii_uppercase\r\n# from functools import lru_cache\r\n# sys.setrecursionlimit(500000)\r\n# from bisect import bisect_left as bl,bisect_right as br\r\n# from heapq import heapify,heappop,heappush\r\n# def google(p):print('Case #'+str(p)+': ',end='')\r\n###################### Start Here ######################\r\n#If FastIO not needed, use this and don't forget to strip\r\nS = is1()\r\nn = len(S)\r\nM = int(input())\r\nclass segTree:\r\n def __init__(self):\r\n self.a = [0]*(2*n)\r\n self.b = [0]*(2*n)\r\n self.c = [0]*(2*n)\r\n \r\n def build(self, arr):\r\n for i in range(n):\r\n self.a[i+n] = 0\r\n self.b[i+n] = 1 if arr[i] == '(' else 0\r\n self.c[i+n] = 1 if arr[i] == ')' else 0\r\n for i in range(n-1,0,-1):\r\n to_match = min(self.b[i << 1],self.c[i << 1 | 1])\r\n self.a[i] = self.a[i << 1] + self.a[i << 1 | 1] + 2*to_match\r\n self.b[i] = self.b[i << 1] + self.b[i << 1 | 1] - to_match\r\n self.c[i] = self.c[i << 1] + self.c[i << 1 | 1] - to_match\r\n def query(self, l, r): \r\n left = []\r\n right = []\r\n l += n \r\n r += n \r\n while l <= r: \r\n if (l & 1): \r\n left.append((self.a[l],self.b[l],self.c[l]))\r\n l += 1\r\n if not (r & 1): \r\n right.append((self.a[r],self.b[r],self.c[r]))\r\n r -= 1 \r\n l >>= 1 \r\n r >>= 1\r\n a1 = b1 = c1 = 0\r\n for a2, b2, c2 in left + right[::-1]:\r\n to_match = min(b1,c2)\r\n a1 += a2 + 2*to_match\r\n b1 += b2 - to_match\r\n c1 += c2 - to_match\r\n return a1\r\ntree = segTree()\r\ntree.build(S)\r\nres = []\r\nfor m in range(M):\r\n l, r = iia()\r\n l -= 1\r\n r -= 1\r\n res.append(str(tree.query(l,r)))\r\nprint(\"\\n\".join(res)) \r\n\r\n#for _ in range(getInt()):\r\n#print(solve())\r\n\r\n\r\n#print(time.time()-start_time)", "import sys\r\nimport random\r\n\r\ninput = sys.stdin.readline\r\nrd = random.randint(10 ** 9, 2 * 10 ** 9)\r\nclass SegmentTree():\r\n def __init__(self, init, unitX, f):\r\n self.f = f # (X, X) -> X\r\n self.unitX = unitX\r\n self.f = f\r\n if type(init) == int:\r\n self.n = init\r\n self.n = 1 << (self.n - 1).bit_length()\r\n self.X = [unitX] * (self.n * 2)\r\n else:\r\n self.n = len(init)\r\n self.n = 1 << (self.n - 1).bit_length()\r\n # len(init)が2の累乗ではない時UnitXで埋める\r\n self.X = [unitX] * self.n + init + [unitX] * (self.n - len(init))\r\n # 配列のindex1まで埋める\r\n for i in range(self.n - 1, 0, -1):\r\n self.X[i] = self.f(self.X[i * 2], self.X[i * 2 | 1])\r\n\r\n def update(self, i, x):\r\n \"\"\"0-indexedのi番目の値をxで置換\"\"\"\r\n # 最下段に移動\r\n i += self.n\r\n self.X[i] = x\r\n # 上向に更新\r\n i >>= 1\r\n while i:\r\n self.X[i] = self.f(self.X[i * 2], self.X[i * 2 | 1])\r\n i >>= 1\r\n\r\n def getvalue(self, i):\r\n \"\"\"元の配列のindexの値を見る\"\"\"\r\n return self.X[i + self.n]\r\n\r\n def getrange(self, l, r):\r\n \"\"\"区間[l, r)でのfを行った値\"\"\"\r\n l += self.n\r\n r += self.n\r\n al = self.unitX\r\n ar = self.unitX\r\n while l < r:\r\n # 左端が右子ノードであれば\r\n if l & 1:\r\n al = self.f(al, self.X[l])\r\n l += 1\r\n # 右端が右子ノードであれば\r\n if r & 1:\r\n r -= 1\r\n ar = self.f(self.X[r], ar)\r\n l >>= 1\r\n r >>= 1\r\n return self.f(al, ar)\r\ns = input().strip()\r\nn = len(s)\r\nq = int(input())\r\nqueries = [[] for _ in range(n)]\r\nans = [0] * q\r\nfor i in range(q):\r\n l, r = map(int, input().split())\r\n queries[r - 1].append((l - 1, i))\r\ntree = SegmentTree(n, 0, lambda x, y: x + y)\r\nstack = []\r\nfor i in range(n):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n if stack and s[stack[-1]] == \"(\":\r\n T = stack.pop()\r\n tree.update(T, 2)\r\n for l, idx in queries[i]:\r\n ans[idx] = tree.getrange(l, i + 1)\r\nprint(*ans, sep=\"\\n\")", "import heapq\r\nimport sys\r\nimport math\r\nfrom collections import deque\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod = 1000000007\r\n#map(int,input().split())\r\n#int(input())\r\ns=input()\r\nn=len(s)\r\nm=int(input())\r\nfen=[0]*(n+1)\r\nans=[0]*m\r\nQ=[]\r\nfor _ in range(m):\r\n Q.append(list(map(int,input().split()))+[_])\r\nQ=sorted(Q,key=lambda x:x[1])\r\nindex=0\r\nstack=[]\r\ndef upd(l,r,v):\r\n r+=1\r\n while l<=n:\r\n fen[l]+=v\r\n l+=l&-l\r\n while r<=n:\r\n fen[r]-=v\r\n r+=r&-r\r\ndef get(x):\r\n sum=0\r\n while x:\r\n sum+=fen[x]\r\n x-=x&-x\r\n return sum\r\nfor i in range(n):\r\n if s[i]=='(':\r\n stack.append(i+1)\r\n else:\r\n if stack:\r\n x=stack.pop()\r\n upd(1,x,2)\r\n while index<m and Q[index][1]==i+1:\r\n ans[Q[index][2]]=get(Q[index][0])\r\n index+=1\r\n\r\nfor x in ans:\r\n print(x)", "# if you win, you live. you cannot win unless you fight.\r\nimport string\r\nimport sys\r\nfrom sys import stdin, setrecursionlimit\r\n# fd=open(\"cses.txt\")\r\n# sys.stdin=fd\r\ninput = stdin.readline\r\nrd = lambda: map(lambda s: int(s), input().strip().split())\r\nrdone = lambda: map(lambda s: int(s) - 1, input().strip().split())\r\nri = lambda: int(input())\r\nrs = lambda: input().strip()\r\nfrom collections import defaultdict as unsafedict, deque, Counter as unsafecounter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom sys import setrecursionlimit\r\nfrom math import ceil\r\nfrom bisect import bisect_left\r\n\r\n\r\nclass BIT():\r\n def __init__(self, n):\r\n self.n = n\r\n self.tree = [0] * (n + 1)\r\n\r\n def sum(self, i):\r\n ans = 0\r\n i += 1\r\n while i > 0:\r\n ans += self.tree[i]\r\n i -= (i & (-i))\r\n return ans\r\n\r\n def update(self, i, value):\r\n i += 1\r\n while i <= self.n:\r\n self.tree[i]+=value\r\n i += (i & (-i))\r\n\r\n\r\ns=rs()\r\npos=unsafedict(int)\r\nst=[]\r\nfor i in range(len(s)):\r\n if s[i]==\"(\":\r\n st.append(i+1)\r\n else:\r\n if st:\r\n pos[i+1]=st.pop()\r\nn=ri()\r\nqr=unsafedict(list)\r\nfor i in range(n):\r\n l,r,=rd()\r\n qr[r].append((l,r,i))\r\nans=[-1]*(n)\r\nbt=BIT(len(s)+2)\r\nss=len(s)\r\nfor vl in range(1,ss+1):\r\n p=pos[vl]\r\n if p:\r\n bt.update(p,1)\r\n for l,r,id in qr[vl] :\r\n x=bt.sum(ss)-bt.sum(l-1)\r\n ans[id]=2*x\r\nprint(*ans,sep=\"\\n\")", "from collections import defaultdict as dd, deque as dq, Counter as ctr\r\nimport sys\r\n\r\nfrom re import search\r\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\r\n \r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\n\r\ninp = lambda: int(sys.stdin.readline().rstrip(\"\\r\\n\"))\r\nmi = lambda x=int : map(x, sys.stdin.readline().rstrip(\"\\r\\n\").split())\r\nli = lambda x=int: list(mi(x))\r\nlb = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\r\\n\")))\r\nls = lambda: list(sys.stdin.readline().rstrip(\"\\r\\n\"))\r\nbi = lambda n: bin(n).replace(\"0b\", \"\")\r\n\r\ndef sbsq(a,s):\r\n i=0\r\n for x in s:\r\n if i>=len(a):\r\n break\r\n if x==a[i]:\r\n i+=1\r\n return i==len(a)\r\n\r\nyn = ['No', 'Yes']\r\nYN = ['NO', 'YES']\r\nYY = \"YES\"\r\nNN = \"NO\"\r\nyy = \"Yes\"\r\nnn = \"No\"\r\ninf= sys.maxsize\r\nmod=1e9+7\r\n\r\nfrom math import log2\r\nimport heapq as hq\r\n\r\n\r\n\r\ndef main(kase):\r\n s=input()\r\n n=len(s)\r\n class segTree:\r\n def __init__(self):\r\n self.a = [0]*(2*n)\r\n self.b = [0]*(2*n)\r\n self.c = [0]*(2*n)\r\n \r\n def build(self, arr):\r\n for i in range(n):\r\n self.a[i+n] = 0\r\n self.b[i+n] = 1 if arr[i] == '(' else 0\r\n self.c[i+n] = 1 if arr[i] == ')' else 0\r\n for i in range(n-1,0,-1):\r\n to_match = min(self.b[i << 1],self.c[i << 1 | 1])\r\n self.a[i] = self.a[i << 1] + self.a[i << 1 | 1] + 2*to_match\r\n self.b[i] = self.b[i << 1] + self.b[i << 1 | 1] - to_match\r\n self.c[i] = self.c[i << 1] + self.c[i << 1 | 1] - to_match\r\n def query(self, l, r): \r\n left = []\r\n right = []\r\n l += n \r\n r += n \r\n while l <= r: \r\n if (l & 1): \r\n left.append((self.a[l],self.b[l],self.c[l]))\r\n l += 1\r\n if not (r & 1): \r\n right.append((self.a[r],self.b[r],self.c[r]))\r\n r -= 1 \r\n l >>= 1 \r\n r >>= 1\r\n a1 = b1 = c1 = 0\r\n for a2, b2, c2 in left + right[::-1]:\r\n to_match = min(b1,c2)\r\n a1 += a2 + 2*to_match\r\n b1 += b2 - to_match\r\n c1 += c2 - to_match\r\n return a1\r\n t=segTree()\r\n t.build(s)\r\n for i in range(inp()):\r\n l,r=mi()\r\n print(t.query(l-1,r-1))\r\n\r\n\r\n\r\n\r\n pass\r\nif __name__ == \"__main__\":\r\n test_Cases=1\r\n # test_Cases=inp()\r\n for i in range(test_Cases):\r\n main(i)", "#If FastIO not needed, use this and don't forget to strip\r\nimport sys, math\r\ninput = sys.stdin.readline\r\n\r\n\"\"\"\r\nIn each subsequence:\r\n-\r\n\"\"\"\r\n\r\n\r\nS = input().strip()\r\ntwo_pows = set()\r\n\"\"\"for i in range(31):\r\n two_pows.add(pow(2,i))\r\nwhile len(S) not in two_pows:\r\n S = S + '('\"\"\"\r\nn = len(S)\r\nM = int(input())\r\nclass segTree:\r\n def __init__(self):\r\n self.a = [0]*(2*n)\r\n self.b = [0]*(2*n)\r\n self.c = [0]*(2*n)\r\n \r\n def build(self, arr):\r\n for i in range(n):\r\n self.a[i+n] = 0\r\n self.b[i+n] = 1 if arr[i] == '(' else 0\r\n self.c[i+n] = 1 if arr[i] == ')' else 0\r\n for i in range(n-1,0,-1):\r\n to_match = min(self.b[i << 1],self.c[i << 1 | 1])\r\n self.a[i] = self.a[i << 1] + self.a[i << 1 | 1] + 2*to_match\r\n self.b[i] = self.b[i << 1] + self.b[i << 1 | 1] - to_match\r\n self.c[i] = self.c[i << 1] + self.c[i << 1 | 1] - to_match\r\n def query(self, l, r): \r\n left = []\r\n right = []\r\n l += n \r\n r += n \r\n while l <= r: \r\n if (l & 1): \r\n left.append((self.a[l],self.b[l],self.c[l]))\r\n l += 1\r\n if not (r & 1): \r\n right.append((self.a[r],self.b[r],self.c[r]))\r\n r -= 1 \r\n l >>= 1 \r\n r >>= 1\r\n a1 = b1 = c1 = 0\r\n for a2, b2, c2 in left + right[::-1]:\r\n to_match = min(b1,c2)\r\n a1 += a2 + 2*to_match\r\n b1 += b2 - to_match\r\n c1 += c2 - to_match\r\n return a1\r\ntree = segTree()\r\ntree.build(S)\r\n#print(tree)\r\nfor m in range(M):\r\n l, r = [int(s) for s in input().split()]\r\n l -= 1\r\n r -= 1\r\n print(tree.query(l,r))\r\n \r\n\r\n#for _ in range(getInt()):\r\n#print(solve())\r\n\r\n\r\n#print(time.time()-start_time)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ns = input()\r\n\r\nM = int(input())\r\n\r\n\r\ndef next_pow_2(n):\r\n p = 1\r\n while p < n:\r\n p <<= 1\r\n return p\r\n\r\n\r\ndef represented_range(node, size):\r\n l = node\r\n r = node\r\n while l < size:\r\n l = 2 * l\r\n r = 2 * r + 1\r\n return l - size, r - size\r\n\r\n\r\nclass SegTree:\r\n def __init__(self, size):\r\n self.size = next_pow_2(size)\r\n self.answer = [0] * (2 * self.size)\r\n self.opened = [0] * (2 * self.size)\r\n self.closed = [0] * (2 * self.size)\r\n\r\n # O(size * (O(func) + O(init))\r\n def build(self, s):\r\n for i in range(self.size):\r\n self.answer[self.size + i] = 0\r\n self.opened[self.size + i] = 1 if i < len(s) and s[i] == '(' else 0\r\n self.closed[self.size + i] = 1 if i < len(s) and s[i] == ')' else 0\r\n\r\n for i in range(self.size - 1, 0, -1):\r\n matched = min(self.opened[2 * i], self.closed[2 * i + 1])\r\n self.answer[i] = self.answer[2 * i] + self.answer[2 * i + 1] + matched\r\n self.opened[i] = self.opened[2 * i] + self.opened[2 * i + 1] - matched\r\n self.closed[i] = self.closed[2 * i] + self.closed[2 * i + 1] - matched\r\n\r\n # O(log(size)), [l,r]\r\n def query(self, l, r):\r\n l += self.size\r\n r += self.size\r\n\r\n eventsR = []\r\n answer = 0\r\n opened = 0\r\n while l <= r:\r\n if l & 1:\r\n matched = min(self.closed[l], opened)\r\n answer += self.answer[l] + matched\r\n opened += self.opened[l] - matched\r\n l += 1\r\n if not (r & 1):\r\n eventsR.append((self.answer[r], self.opened[r], self.closed[r]))\r\n r -= 1\r\n l >>= 1\r\n r >>= 1\r\n\r\n for i in range(len(eventsR) - 1, -1, -1):\r\n a, o, c = eventsR[i]\r\n matched = min(c, opened)\r\n answer += a + matched\r\n opened += o - matched\r\n\r\n return answer\r\n\r\n\r\nseg = SegTree(len(s))\r\nseg.build(s)\r\n\r\nfor i in range(M):\r\n l, r = [int(_) for _ in input().split()]\r\n print(2 * seg.query(l - 1, r - 1))\r\n" ]

[ "from collections import Counter\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn, m, k = [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\na = Counter(a)\r\nfor x in b: a[x] -= 1\r\n\r\ncnt = 0\r\nfor x in sorted(a, reverse=True):\r\n cnt += a[x]\r\n if cnt > 0: print('YES'); quit()\r\n\r\nprint('NO')", "n, m, k = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nif n <= m:\n da = {}\n for i in a:\n if i not in da: da[i] = 0\n da[i] += 1\n db = {}\n for i in b:\n if i not in db: db[i] = 0\n db[i] += 1\n s = list(set(a + b))\n s.sort()\n k = len(s)\n p = {i: x for i, x in enumerate(s)}\n ac = bc = 0\n ok = False\n for i in range(1, k + 1):\n if p[k-i] in da:\n ac += da[p[k-i]]\n if p[k-i] in db:\n bc += db[p[k-i]]\n if ac > bc:\n ok = True\n break\n print(\"YES\" if ok else \"NO\")\nelse:\n print('YES')\n", "import sys\r\ninput=sys.stdin.readline\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nb.sort(reverse=True)\r\nfor i in range(n):\r\n bb=b[i] if i<m else 0\r\n if a[i]>bb:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n \r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif n > m:\r\n print('YES')\r\nelse:\r\n res = 'NO'\r\n for i, j in zip(sorted(a)[::-1], sorted(b)[::-1]):\r\n if i > j:\r\n res = 'YES'\r\n break\r\n print(res)", "from collections import Counter\r\n\r\nN,M,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nseen = list(set(A+B))\r\nseen.sort()\r\nA1 = Counter(A)\r\nB1 = Counter(B)\r\n\r\nans = 'NO'\r\nc1,c2 = 0,0\r\nwhile seen:\r\n t = seen.pop()\r\n if t in A1.keys():\r\n c1+=A1[t]\r\n if t in B1.keys():\r\n c2+=B1[t]\r\n \r\n if c1>c2:\r\n ans = 'YES'\r\n break\r\n \r\nprint(ans)\r\n \r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif n > m:\r\n print('YES')\r\nelse:\r\n a.sort()\r\n b.sort()\r\n b = b[-n:]\r\n ans = 'NO'\r\n for i in range(n):\r\n if a[i] > b[i]:\r\n ans = 'YES'\r\n print(ans)", "from operator import itemgetter\r\nfrom typing import *\r\nfrom collections import deque, Counter, defaultdict\r\nfrom bisect import *\r\nimport heapq, math\r\nfrom functools import cmp_to_key, reduce\r\nfrom itertools import groupby, islice, zip_longest\r\n\r\n# from sortedcontainers import SortedSet, SortedList\r\n\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n if n > m:\r\n print(\"YES\")\r\n else:\r\n a.sort(reverse=True)\r\n b.sort(reverse=True)\r\n for i, it in enumerate(a):\r\n if it > b[i]:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nmain()\r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif n > m:\r\n print(\"YES\")\r\n exit()\r\na = sorted(a, reverse = True)\r\nb = sorted(b, reverse = True)\r\nfor i in range(n):\r\n if a[i] > b[i]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "import copy\r\nimport itertools\r\nimport string\r\nimport sys\r\n\r\n###\r\n\r\ndef powmod(x, p, m):\r\n\tif p <= 0:\r\n\t\treturn 1\r\n\tif p <= 1:\r\n\t\treturn x%m\r\n\treturn powmod(x*x%m, p//2, m) * (x%m)**(p%2) % m\r\n\r\n###\r\n\r\ndef to_basex(num, x):\r\n\twhile num > 0:\r\n\t\tyield num % x\r\n\t\tnum //= x\r\n\r\ndef from_basex(it, x):\r\n\tret = 0\r\n\tp = 1\r\n\tfor d in it:\r\n\t\tret += d*p\r\n\t\tp *= x\r\n\treturn ret\r\n\r\n###\r\n\r\ndef core():\r\n\t_ = input()\r\n\ta = [int(x) for x in input().split()]\r\n\tr = [int(x) for x in input().split()]\r\n\ta.sort()\r\n\tr.sort()\r\n\t# print(a)\r\n\t# print(r)\r\n\t\r\n\twhile (\r\n\t\tlen(a) > 0 and\r\n\t\tlen(r) > 0 and\r\n\t\tr[-1] >= a[-1]\r\n\t):\r\n\t\ta.pop()\r\n\t\tr.pop()\r\n\t\r\n\t\r\n\tans = \"YES\" if len(a) > 0 else \"NO\"\r\n\tprint(ans)\r\n\r\n\r\ncore()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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,m,k=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())))\r\nb=sorted(list(map(int,input().split())))\r\nfor i in range(n):\r\n if a[-i-1]>int(b[-i-1] if i<m else 0):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "a,b,k=(map(int,input().split()))\r\nv=sorted(map(int,input().split()))\r\nvv=sorted(map(int,input().split()))\r\nif a>b:\r\n k=0\r\nelse: \r\n for i in range(-1,-(a+1),-1):\r\n if v[i]>vv[i]:\r\n k=0\r\nif k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n ", "#z=int(input()) \r\nimport math\r\n \r\n \r\n#z=int(input())\r\nfor contorr in range(1):\r\n \r\n n,m,k=list(map(int, input().split()))\r\n# n=int(input())\r\n \r\n \r\n bloc=list(map(int, input().split()))\r\n lista=list(map(int, input().split()))\r\n \r\n bloc.sort()\r\n lista.sort()\r\n \r\n bloc=bloc[::-1]\r\n lista=lista[::-1]\r\n \r\n \r\n answ='NO'\r\n if n>m:\r\n answ='YES'\r\n else: \r\n for i in range(n):\r\n if bloc[i]>lista[i]:\r\n answ='YES'\r\n break\r\n \r\n print(answ) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\na = sorted(map(int, input().split()), reverse=1)\r\nb = sorted(map(int, input().split()), reverse=1)\r\n\r\nif n > m:\r\n print('YES')\r\n exit()\r\ni = 0\r\nj = 0\r\nx = 0\r\ny = 0\r\nwhile i < n and j < m:\r\n if a[i] > b[j]:\r\n x += 1\r\n i += 1\r\n elif a[i] < b[j]:\r\n y += 1\r\n j += 1\r\n else:\r\n i += 1\r\n j += 1\r\n x += 1\r\n y += 1\r\n if x > y:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n\r\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nif (len(a) > len(b)) or (max(a) > max(b)):\r\n print(\"YES\")\r\nelse:\r\n a = sorted(a)\r\n b = sorted(b)\r\n ans = \"NO\"\r\n aa, bb = 0, 0\r\n while (ans != \"YES\" and aa < len(a) and bb < len(b)):\r\n temp = a[aa]\r\n while (b[bb] < temp and bb < len(b)):\r\n bb += 1\r\n if (bb == len(b)):\r\n ans = \"YES\"\r\n bb += 1\r\n aa += 1\r\n if (bb == len(b) and aa < len(a)):\r\n ans = \"YES\"\r\n print(ans)\r\n", "n,m,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\n\na.sort(key=lambda x:-x)\nb.sort(key=lambda x: -x)\nt=False\nn1=min(m,n)\nif n>m:\n t=True\nelse:\n for i in range (n1):\n if a[i]>b[i]:\n t=True\nif t:\n print('YES')\nelse:\n print('NO')\n", "n, m, k = [int(x) for x in input().split()]\r\nalice = [int(x) for x in input().split()]\r\nbob = [int(x) for x in input().split()]\r\n\r\nalice.sort()\r\nbob.sort()\r\n\r\nbalance = 0\r\ni = n - 1\r\nj = m - 1\r\n\r\nwhile i >= 0 and j >= 0:\r\n if alice[i] > bob[j]:\r\n balance += 1\r\n i -= 1\r\n elif alice[i] < bob[j]:\r\n balance -= 1\r\n j -= 1\r\n else:\r\n i -= 1\r\n j -= 1\r\n if balance > 0:\r\n break\r\n\r\nif i + 1 + balance > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n,m,k = map(int,input().split())\r\na = sorted(map(int,input().split()),reverse=True)\r\nb = sorted(map(int,input().split()),reverse=True)\r\ncou=ind=0\r\nl=min(m,n)\r\naa=max(b)\r\nfor i in range(l):\r\n if a[i]>b[i]:\r\n cou+=1\r\n ind=max(ind,a[i])\r\n\r\nif m>=n and cou>0:\r\n print(\"YES\")\r\nelif m<n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n\r\n", "def solve():\r\n n, m, k = 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()\r\n if n > m: return \"YES\"\r\n if sum(a) > sum(b) or max(a) > max(b):\r\n return \"YES\"\r\n\r\n i, j = n - 1, m - 1\r\n while i >= 0 and j >= 0:\r\n if a[i] <= b[j]:\r\n i -= 1\r\n j -= 1\r\n else:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(solve())", "n,m,k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split())))\r\ni = 0\r\nj = 0\r\ngood = False\r\nwhile i < n:\r\n while j < m and b[j] < a[i]:\r\n j += 1\r\n if n - i > m - j:\r\n good = True\r\n i += 1\r\nprint('YES' if good else 'NO')\r\n", "import collections\r\nimport os\r\nimport sys\r\nfrom collections import Counter\r\n\r\nif os.getenv('LOCALCFTEST'):\r\n sys.stdin = open('cfinput.txt')\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\ndef solve(n, m, k, a, b):\r\n cnt = collections.defaultdict(int)\r\n for i in a:\r\n cnt[i] += 1\r\n for i in b:\r\n cnt[i] -= 1\r\n s = 0\r\n for i in sorted(cnt.keys(),reverse=True):\r\n s += cnt[i]\r\n if s>0:\r\n return print('YES')\r\n\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n solve(n, m, k, a, b)\r\n", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,m,k=lst()\r\n f=0\r\n a=sorted(lst(),reverse=1)\r\n b=sorted(lst(),reverse=1)\r\n p=p1=0\r\n while p<n and p1<m:\r\n if a[p]>b[p1]:\r\n f=1\r\n break\r\n p+=1\r\n p1+=1\r\n if p<n and p1>=m:\r\n f=1\r\n print('YES' if f else 'NO')" ]

[ "# from dust i have come, dust i will be\r\n\r\nn=int(input())\r\nprint(n//2+1)", "def code3(n):\r\n print(n//2+1)\r\ncode3(int(input()))\r\n", "n=int(input())\nif n==1:\n print (1)\nelif n==2:\n print (2)\nelse:\n print (n//2+1)\n", "n = int(input()) \r\nprint(1+n//2) \r\n", "N = int(input())\nprint(N//2 + 1)\n", "#!/usr/bin/env python3\n# -*- coding: UTF-8 -*-\n\nprint(int(input())//2+1)\n \t\t \t \t \t \t\t \t", "n = int(input())\na = n//2 + 1\nb = 1\nc = 1 \nprint(a)\n", "n = int(input())\nprint(1 + n//2)\n", "n = int (input ())\r\nif n & 1 : print ((n + 1) // 2)\r\nelse : print (n // 2 + 1)\r\n", "num=int(input())\r\nprint((num//2)+1)", "\"\"\"\nBrandt Smith, Lemuel Gorion and Peter Haddad\n\ncodeforces.com\n\nProblem 964A\n\"\"\"\n\nn = int(input())\n\nif n == 1:\n print(1)\nelif n == 2 or n == 3:\n print(2)\nelse:\n print(n // 2 + 1)\n\n", "def solve(n):\r\n return int(n / 2) + 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()", "# # def bisect_left(a, z):\n# # le = -1\n# # ri = len(a)\n# # while le < ri - 1:\n# # mid = (le + ri) // 2\n# # if a[mid] < z:\n# # le = mid\n# # else:\n# # ri = mid\n# # if ri < n and ri >= 0 and a[ri] == z:\n# # return ri\n# # return -1\n# #\n# #\n# # def bisect_right(a, z):\n# # le = -1\n# # ri = len(a)\n# # while le < ri - 1:\n# # mid = (le + ri) // 2\n# # if a[mid] <= z:\n# # le = mid\n# # else:\n# # ri = mid\n# # if le < n and le >= 0 and a[le] == z:\n# # return le\n# # return -1\n# #\n# #\n#\n#\n# a, k, b, m, x = map(int, input().split())\nprint(int(input()) // 2 + 1)\n", "n = eval(input(\"\"))\r\nn = n / 2 + 1\r\nprint(\"%d\"%(n))\r\n\r\n", "# ?????????????????????????????????????????????????????????????????????????\na=int(input())\nprint(int(a/2+1))\n", "count = (int(input()) // 2) + 1\r\nprint(count)", "n = int(input())\n# ways to have 2 as the first element\nres = 1 + n // 2\nprint(res)\n", "n=int(input())\r\nk=n//2\r\nprint(k+1)", "n = int(input())\r\nans = n//2 + 1\r\nprint (ans)", "x = int(input())\r\ny = x // 2\r\nprint(y + 1)", "n = int(input())\r\norder = (n/2)-1\r\nprint(int(n-order))", "n = int(input())\r\nans = n // 2\r\nans = ans + 1\r\nprint(ans)\r\n", "n = int(input())\nprint (n//2+1)\n", "print(1+int(input())//2)", "n=int(input())\r\nprint([n//2+1,(n+1)//2][n%2!=0])", "N = int(input())\n\nprint( (N // 2) + 1) ", "# -*- coding: UTF-8 -*-\n\nn = int(input())\nprint(n // 2 + 1)\n\n\n", "inp1 = int(input())\r\nprint((inp1+2)//2)\r\n", "n=int(input())\r\nprint(int(n/2+1))", "n = int(input())\r\nweight = (n//2) + 1\r\nprint(weight)", "def solve():\r\n print(int(input()) // 2 + 1)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "def li():\r\n return list(map(int, input().split()))\r\n\r\nn = int(input())\r\nprint(n // 2 + 1)\r\n", "n = int(input())\nprint(n//2 + 1)\n", "import math\r\nprint(math.floor(int(input())/2)+1)\r\n", "inp = int(input())\nprint(str(int(inp)//2+1))\n", "while True:\n try :\n n = int(input())\n except:\n break\n print (n//2+1)\n", "def solve(n):\n return n//2 + 1\n\n\ndef main():\n n = int(input())\n print(solve(n))\n\n\nmain()\n", "n = int(input())\n\np = (n / 2) + 1\np = int(p)\nprint(p)\n", "# cook your dish here\r\nn=int(input())\r\nprint(int(n/2)+1)", "n = int(input())\nprint(int(n / 2 + 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", "import queue\n\ndef readTuple():\n return input().split()\ndef readInts():\n return tuple(map(int, readTuple()))\n\ndef solve():\n n = int(input().strip())\n print(n//2+1)\n\n\n\n\n\nif __name__ == '__main__':\n solve()\n", "x=int(input())\r\ndef iterator(x):\r\n ans=(1+x//2)\r\n print(ans)\r\n return(ans)\r\n\r\niterator(x)", "'''input\r\n3\r\n'''\r\n\r\nn = int(input())\r\nprint(1 + (n//2))", "n=int(input())\r\nn=(n//2)+1\r\nprint(n)", "import math\r\n\r\nn = int(input())\r\nprint(math.floor(n/2) + 1)\r\n", "n = int(input())\r\nans = int(n/2) + 1\r\nprint(ans)\r\n", "from collections import deque\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n#n=list(map(int, input().split()))\r\n#n=map(int, input().split())\r\n\r\ndef main():\r\n\tn=int(input())\r\n\tans=n//2+1\r\n\tprint(ans)\r\nmain()\r\n", "from math import *\r\nfrom collections import *\r\ndef inp(): return map(int,input().split())\r\ndef inp_arr(): return list(map(int,input().split()))\r\nn = int(input())\r\nprint(n//2+1)", "n=int(input())\nprint(int(n/2)+1)", "n=int(input())\nprint((n>>1)+1)\n\n'''a\nb\nc\nd\ne\nf\ng\nh\ni'''", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelif n == 2 or n == 3:\r\n print(2)\r\nelse:\r\n print(n//2 + 1)\r\n \r\n", "n=int(input())\r\nres=n//2+1\r\nprint(res)", "N = int(input())\r\nprint(int(N / 2) + 1)", "def main():\r\n n = int(input())\r\n\r\n if n == 1:\r\n print(1)\r\n else:\r\n left = 2\r\n right = n // 2\r\n\r\n if left > right:\r\n print(2)\r\n else:\r\n print(right - left + 3)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "print ((int(input())>>1)+1)", "# https://codeforces.com/problemset/problem/964/A\r\n\r\nprint(int(input())//2 + 1)", "N=int(input())\r\nM=N//2+1\r\nprint(M)", "#SAERESYTREYRTUTTYYETYEH\n#FHGDJFJGHGFASHDGH\nn = int(input())\nprint(n//2+1)", "print(int(input())//2+1)\r\n\r\n# red is love ...\r\n# My code says that who am i", "n = int(input())\ncount = n // 2 + 1\nprint(count)\n \n", "n=int(input())\r\nt=1\r\nt=int(n/2)\r\nt=int(t)\r\nt=t+1\r\nprint(t)", "n = int(input())\r\nprint(n//2 + 1)", "p=int(input())\r\nprint(p//2+1)\r\n", "n=int(input())\nt=1\nt=int(n/2)\nt=int(t)\nt=t+1\nprint(t)", "def solution(n):\r\n return int(n/2)+1\r\ndef answer():\r\n n = int(input())\r\n print(solution(n))\r\nanswer()", "import math\nN=int(input())\n\nif(N%2==0):\n print((N//2)+1)\nelse:\n print(math.ceil(N/2))\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n n = int(input())\r\n ans = n // 2 + 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nn = int(input())\r\nprint((n // 2) + 1)\r\n\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# تگزاس 2", "print (int (input ()) // 2 + 1)", "x=int(input())\r\nd=x//2\r\nprint(d+1)\r\n", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\n\nn = int(input())\n\nprint(n//2 +1)\n\n", "import math\r\nn=int(input())\r\nprint(math.ceil((n+1)/2))\r\n\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nresult = 1 + n // 2\r\nprint(result)\r\n", "import math\r\nn = int(input())\r\n\r\nif n==1:\r\n print(1)\r\nelse:\r\n print(math.ceil((n+1)/2))", "n = int(input())\ncount = 0\nwhile n > 1:\n count += 1\n n -= 2\nprint(count + 1)", "# cook your dish here\r\nn=int(input())\r\nsplits=(n//2)+1\r\nprint(splits)", "n = int(input())\nans = 1+n//2\nprint(ans)\n", "n = int(input())\nif n == 1:\n print(1)\nelif n == 2:\n print(2)\nelif n == 3:\n print(2)\nelse:\n print(n // 2 + 1)\n", "num = int(input())\r\n\r\nprint(num//2+1)", "num = int(input())\r\nif num % 2 == 0:\r\n print(int((num + 2) / 2))\r\nelse:\r\n print(int((num + 1) / 2))\r\n", "x=int(input())\r\nprint((x//2)+1)", "def splits(n):\r\n if n==1:\r\n return 1\r\n else:\r\n m = n//2+1\r\n return m\r\nn = int(input())\r\nprint(splits(n))", "def a964(n):\r\n return n//2 + 1\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n print(a964(n))\r\n", "n = int(input().strip())\nif n:\n print(n // 2 + 1)\nelse:\n print(0)\n\n \t\t \t \t \t \t \t \t\t \t\t\t \t", "a=eval(input())\nif a==1:\n print(1)\nelse:\n print(a//2+1)", "#ty,d\r\nimport sys\r\n\r\nn = int(input())\r\n \r\nprint(n // 2 + 1)\r\n\r\n\"\"\"\r\n7\r\n1 1 1 1 1 1 1 = 7\r\n2 2 2 1 = 3\r\n3 3 1 = 2\r\n4 1 1 1 = 1\r\n5 1 1 = 1\r\n6 1 = 1\r\n7 = 1\r\n\r\n8\r\n1 1 1 1 1 1 1 1 = 8\r\n2 2 2 2 = 4\r\n3 3 2 = 2\r\n4 4 = 2\r\n5 3 = 1\r\n6 2 = 1\r\n7 1 = 1\r\n8 = 1\r\n\"\"\"", "import math\r\n\r\nn = int(input())\r\n\r\nsplits = -1\r\n\r\nif n % 2 == 0:\r\n\r\n\tsplits = n / 2 + 1\r\n\r\nelse:\r\n\r\n\tsplits = n // 2 + 1\r\n\r\nprint(int(splits))", "n=int(input())\r\nz=n//2+1\r\nprint(z)", "a=int(input())\r\nprint(int(a/2+1))", "import math\nk=int(input())\nf=math.floor(k/2)+1\nprint(f)\n", "t = int(input())\n\nprint(t // 2 + 1)\n", "x = int(input())\nprint((x // 2) + 1)\n", "n = input()\r\nprint(int(int(n) / 2) + 1)", "import string\r\nimport math\r\n\r\ndef reversed_list(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 reversed_list(l, start + 1, end - 1)\r\n\r\n\r\n\r\ndef main_function():\r\n k = int(input())\r\n return k // 2 + 1\r\nprint(main_function())", "a=input()\r\naa=int(a)\r\nprint(aa//2+1)", "n = int(input())\r\nprint(1+(n//2))\r\n", "import math\nn=int(input())\nk=n/2+1\nprint(math.floor(k))\n", "y=int(input())\nif y%2==0:\n s=(y/2)+1\nelse:\n s=((y-1)/2)+1\nprint(int(s))", "def do():\r\n n = int(input())\r\n print(n//2 + 1)\r\n\r\ndo()\r\n\r\ndef resolve():\r\n #input = sys.stdin.readline\r\n from pprint import pprint\r\n #import sys\r\n #sys.setrecursionlimit(100000)\r\n\r\n\r\n q = int(input())\r\n for _ in range(q):\r\n s = input()\r\n n = int(input())\r\n n, k = map(int, input().split())\r\n dat = list(map(int, input().split()))\r\n\r\n\r\n dat = [1, 2, 3]\r\n print(\" \".join(list(map(str, res))))\r\n\r\n pass\r\n import math\r\n math.ceil(1.2)\r\n math.floor(1.2)\r\n round(1.2, 3)\r\n\r\n", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn = I()\r\nprint(n//2 + 1)", "num = int(input())\r\nprint(num//2 + 1)", "num = int(input())\r\n\r\nprint(int(num / 2) + 1)", "import sys\r\n\r\ndef main():\r\n n = int(sys.stdin.read().strip())\r\n return n//2 + 1\r\n\r\nprint(main())\r\n", "a = int(input())\nr = (a - (a % 2)) / 2 + 1\nprint(int(r))\n \t \t\t \t \t \t\t \t\t\t\t\t\t\t \t", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\nimport sys\r\n\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\nimport math\r\n\r\n\r\nn=int(input())\r\n\r\nprint(n//2+1)", "n=int(input())\nprint(int(n//2+1))\n\n\n\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa=0\n\t \t\t \t\t\t\t\t \t\t \t\t\t \t\t\t\t\t", "a=int(input())\r\na=a//2+1\r\nprint(a)\r\n\r\n", "t = int(input())\r\nprint(t//2+1)\r\n", "x = int(input())\r\nx = x // 2 + 1\r\nprint(x)", "n = int(input())\n# Source code should be longer than 50 characters\nprint(n // 2 + 1)\n \t \t\t \t \t\t \t \t\t \t\t\t\t\t \t\t", "import atexit\r\nimport io\r\nimport sys\r\n\r\n# Buffering IO\r\n_INPUT_LINES = sys.stdin.read().splitlines()\r\ninput = iter(_INPUT_LINES).__next__\r\n_OUTPUT_BUFFER = io.StringIO()\r\nsys.stdout = _OUTPUT_BUFFER\r\n\r\[email protected]\r\ndef write():\r\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n \r\n\r\ndef main():\r\n n = int(input())\r\n print(n//2 + 1)\r\n \r\n \r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n ", "a = 1\nb = 2\nc = 3\nd = 5\nq = 2\nn = int(input())\nprint(int(n/2+1))\n", "from math import floor\r\nn=int(input())\r\n\r\nprint(floor(n/2)+1)\r\n", "print(1 + int(input())//2)\r\n", "from math import *\r\nn = int(input())\r\nprint(ceil((n+1)/2))", "x=int(input())\nif x%2==0:\n s=(x/2)+1\nelse:\n s=((x-1)/2)+1\nprint(int(s))\n", "s=int(input())\r\nprint(s//2+1)\r\n", "t = int(input())\r\nprint(int(t/2)+1)", "n = int(input())\r\nans = 1\r\nans += n // 2\r\nprint(ans)", "import sys\r\nimport os\r\nimport math\r\n\r\nn=int(input())\r\nprint(math.floor(n/2)+1)", "\r\ninp = int(input())\r\nif inp == 0:\r\n\tprint(1)\r\nelse:\r\n\tprint(inp//2 + 1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\nimport unittest\r\n\r\nclass Test(unittest.TestCase)\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tunitest.main()\r\n\"\"\"", "n = int(input())\n#no me deja submitear :v\nprint(n//2 + 1)\n \t\t \t\t \t \t \t \t\t\t\t \t\t \t\t \t", "from math import floor\r\nn = int(input())\r\nprint(floor(n/2)+1)", "n = int(input())\r\nk = 1 # partirion = [n] \r\n\"\"\"Then maxima can be replaced by twos, \r\nand the remainder can be distributed using ones.\r\nfor maxx in range(1, n//2 + 1): \r\npartition = [maxx] * (n // maxx) + [1] * (n % maxx)\"\"\"\r\nk += n // 2\r\nprint(k)", "a=int(input())\r\nprint(int(a/2)+1)", "#Source Code\n#Should be longer \n#than 50 characters\nn = int(input())\nn = int(n/2)\nprint(n+1)\n", "# LUOGU_RID: 123191442\nprint(int(input())//2+1)", "n=int(input());print((n//2)+1)", "n = int(input())\r\nans = int(n/2)\r\nif n > ans:\r\n ans += 1\r\nprint(ans)", "#!/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 main():\n #n, a, b = (int(x) for x in input().split())\n x = int(input())\n #res = [0]\n #a = input_lst()\n #s = list(input())\n res = x // 2 + 1\n\n print(res)\n\n\n\n\n #print_out(res)\n\n\nif __name__ == '__main__':\n main()\n", "q=int(input())\na=0+1+1-1-1-1-1-1-1-1-1-1-1-1-1-1-1-1\nprint(q//2+1)", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn=int(input())\r\nprint(n//2+1)", "n=int(input())\r\nprint (int(n/2)+1)\r\n \r\n", "# A. Splits\n\nn = int(input())\n\n# Editorial - https://codeforces.com/blog/entry/58991\nprint(n//2 + 1)\n", "x=int(input())\r\nans=x/2+1\r\nprint(int(ans))", "n=int(input())\r\nprint(int(n/2)+1)", "n = int(input().strip())\nsplit = (n >> 1) + 1\nprint(split)\n", "n=int(input())\r\nprint(int(n//2)+1)", "k = int(input())\nif k==1:\n print(1)\nelif k%2:\n print((k+1)//2)\nelse:\n print((k+2)//2)\n", "n=int(input())\r\nans=1\r\nans+=n//2\r\nprint(ans)", "n=int(input())\r\nprint(int((n/2)+1))\r\n", "b=int(input())\r\nprint(int(b/2)+1\r\n )\r\n", "n = int(input())\r\n\r\nsum = 0\r\n\r\nsum = n//2 + 1\r\n\r\nprint(sum)\r\n", "n = int(input())\r\na = n // 2 + 1\r\nprint(a)", "import math\r\nnum=int(input())\r\nk=math.ceil(num/2)\r\nif num%2==0:\r\n print(k+1)\r\nelse:\r\n print(k)", "inp = int(input())\r\nprint(int(inp/2)+1)", "x = int(input())\r\nif x == 1:\r\n\tprint(1)\r\nelse:\r\n\tif x%2 == 1:\r\n\t\tprint((x+1)//2)\r\n\telse:\r\n\t\tprint(x//2 + 1)", "var = int(input())\r\nprint(var//2+1)\r\n", "q = int(input())\n\na = q//2 \n\nprint(a+1)\n \t\t\t\t \t\t \t\t \t \t \t \t", "# import sys;sys.stdin = open(\"in.txt\", \"r\");sys.stdout = open(\"out.txt\", \"w\")\r\nprint(int(input())//2 + 1)", "n = int(input())\r\nres = 1 + n//2\r\nprint(res)\r\n", "#! python3\n# 964A_splits.py\n\nimport math\n\nn = int(input())\n\nprint(math.floor(n/2) + 1)\n", "n=input()\r\nnn=int(n)\r\nprint(nn//2+1)", "from math import ceil\r\nprint(int(int(input())/2)+1)", "print(int((eval(input())+ 1)/2+0.5))################", "import math\r\n\r\nn = int(input())\r\nprint(1 + math.floor(n/2))", "x=int(input())\r\ny=x//2+1\r\nprint(y)", "num = int(input())\r\nprint(int((num/2) +1))", "def razbienie(n):\r\n if n == 1:\r\n return 1\r\n return (n // 2) + 1\r\n\r\n\r\nm = int(input())\r\nprint(razbienie(m))\r\n", "\r\nimport math\r\nn = int(input())\r\nprint (n//2+1)", "def solve(n):\n return n//2+1\nif __name__ == \"__main__\":\n k = int(input())\n print(solve(k))\n", "import math\r\n\r\nn=int(input())\r\nif(n%2==0):\r\n\tprint((n//2)+1)\r\nif(n%2!=0):\r\n\tprint(math.ceil(n/2))", "def solution(n):\r\n return (n//2 + 1)\r\n\r\nn = int(input())\r\nprint(solution(n))", "from sys import stdin, stdout\nfrom collections import defaultdict\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\tif n>=2:\n\t\tprint(n//2+1)\n\telse:\n\t\tprint(1)\n\nsolve()\n", "n = int(input())\r\nprint(int(n//2)+1)", "a = int(input())\r\na = a/2 + 1\r\nprint(int(a))", "from sys import stdin, stdout\r\nimport cProfile, math\r\nfrom collections import Counter\r\n\r\nprintHeap = str()\r\ntest = False\r\nmemory_constrained = False\r\n\r\n\r\ndef display(string_to_print):\r\n stdout.write(str(string_to_print) + \"\\n\")\r\n\r\n\r\ndef test_print(output):\r\n if test:\r\n stdout.write(str(output) + \"\\n\")\r\n\r\n\r\ndef display_list(list1, sep=\" \"):\r\n stdout.write(sep.join(map(str, list1)) + \"\\n\")\r\n\r\n\r\ndef get_int():\r\n return int(stdin.readline().strip())\r\n\r\n\r\ndef get_tuple():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\ndef get_list():\r\n return list(map(int, stdin.readline().split()))\r\n\r\n\r\nmemory = dict()\r\n\r\n\r\ndef clear_cache():\r\n global memory\r\n memory = dict()\r\n\r\n\r\ndef cached_fn(fn, *args):\r\n global memory\r\n if args in memory:\r\n return memory[args]\r\n else:\r\n result = fn(*args)\r\n memory[args] = result\r\n return result\r\n\r\n\r\n# ----------------------------------------------------------------------------------- MAIN PROGRAM\r\n\r\n\r\ndef main():\r\n n = get_int()\r\n print((n//2)+1)\r\n# --------------------------------------------------------------------------------------------- END\r\n\r\n\r\ncProfile.run('main()') if test else main()" ]

[ "import sys\nfrom functools import cache\n\n# input \nN, graph = 0, []\n# output\nflow, total_cost = -1, -1\n\ndef read_input():\n global N, graph, in_degree, out_degree\n readline = sys.stdin.readline\n N = int(readline().rstrip())\n graph = [[] for _ in range(N + 1)]\n m = N * (N - 1) // 2\n for _ in range(m):\n u, v, l, h, a = [int(w) for w in readline().split()]\n graph[u].append([v, l, h, a])\n for i in range(1, N + 1):\n graph[i].sort()\n\n@cache\ndef groupby(num: int, groups: int) -> list:\n if groups == 1:\n return [(num, )]\n result = []\n for i in range(0, num + 1):\n subs = groupby(num - i, groups - 1)\n for sub in subs:\n result.append((i, ) + sub)\n return result\n\ndef solve():\n global flow, total_cost\n def dfs(node: int, pattern: tuple, cost: int)->bool:\n global flow, total_cost\n if node == N:\n if flow < 0 or sum(pattern) <= flow:\n flow = sum(pattern)\n total_cost = max(cost, total_cost)\n return True\n # if pattern[node] == 0:\n # return dfs(node + 1, pattern, cost)\n if pattern[node] > high_limits[node] or pattern[node] < low_limits[node]:\n return False\n result = False\n for sub in groupby(pattern[node], N - node):\n can_go = True\n act_cost = 0\n flow_cost = 0\n # print(f'node = {node}, sub = {sub}, pattern={pattern}')\n for i in range(len(sub)):\n if sub[i] == 0 and graph[node][i][1] == 0:\n continue\n if sub[i] < graph[node][i][1] or sub[i] > graph[node][i][2]:\n can_go = False\n break\n act_cost += graph[node][i][-1]\n flow_cost += sub[i] * sub[i]\n if not can_go:\n continue\n npattern = list(pattern)\n for i in range(len(sub)):\n npattern[node + i + 1] += sub[i]\n npattern[node] = 0\n result |= dfs(node + 1, tuple(npattern), cost + act_cost + flow_cost)\n # print(f'result = {result}')\n return result\n\n high_limits = [0] * (N + 1)\n low_limits = [0] * (N + 1)\n for u in range(1, N + 1):\n for v, l, h, a in graph[u]:\n high_limits[u] += h\n low_limits[u] += l\n for i in range(max(low_limits), high_limits[1] + 1):\n temp = [0] * (N + 1)\n temp[1] = i\n if dfs(1, tuple(temp), 0):\n break\n\ndef write_output():\n # print(f\"mininal flow = {flow}, max_cost = {total_cost}\")\n print(flow, total_cost)\n\n\nread_input()\n# print(graph)\nsolve()\nwrite_output()\n", "def dfs(curr, next, fuel, cost):\r\n global res\r\n if curr == n:\r\n res = max(res, cost)\r\n return\r\n if next > n:\r\n if fuel == 0:\r\n dfs(curr + 1, curr + 2, d[curr + 1], cost)\r\n else:\r\n for i in range(pipe[curr][next]['l'], min(pipe[curr][next]['h'], fuel) + 1):\r\n d[next] += i\r\n lin = cost + i * i\r\n if i:\r\n lin += pipe[curr][next]['a']\r\n dfs(curr, next + 1, fuel - i, lin)\r\n d[next] -= i\r\nn = int(input())\r\nnn = n * (n - 1) // 2\r\npipe = [[None] * (n + 1) for _ in range(n + 1)]\r\nfor i in range(1, nn + 1):\r\n s, f, l, h, a = map(int, input().split())\r\n pipe[s][f] = {'l': l, 'h': h, 'a': a}\r\nres = -1\r\nfor i in range(30):\r\n d = [0] * (n + 1)\r\n dfs(1, 2, i, 0)\r\n if res >= 0:\r\n print(i, res)\r\n break\r\nelse:\r\n print(\"-1 -1\")# 1691879254.577019" ]

[ "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nMOD = 998244353\r\nIMAG = 911660635\r\nIIMAG = 86583718\r\nrate2 = (0, 911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601, 842657263, 730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497, 867605899, 0)\r\nirate2 = (0, 86583718, 372528824, 373294451, 645684063, 112220581, 692852209, 155456985, 797128860, 90816748, 860285882, 927414960, 354738543, 109331171, 293255632, 535113200, 308540755, 121186627, 608385704, 438932459, 359477183, 824071951, 103369235, 0)\r\nrate3 = (0, 372528824, 337190230, 454590761, 816400692, 578227951, 180142363, 83780245, 6597683, 70046822, 623238099, 183021267, 402682409, 631680428, 344509872, 689220186, 365017329, 774342554, 729444058, 102986190, 128751033, 395565204, 0)\r\nirate3 = (0, 509520358, 929031873, 170256584, 839780419, 282974284, 395914482, 444904435, 72135471, 638914820, 66769500, 771127074, 985925487, 262319669, 262341272, 625870173, 768022760, 859816005, 914661783, 430819711, 272774365, 530924681, 0)\r\n\r\ndef butterfly(a):\r\n n = len(a)\r\n h = (n - 1).bit_length()\r\n le = 0\r\n while le < h:\r\n if h - le == 1:\r\n p = 1 << (h - le - 1)\r\n rot = 1\r\n for s in range(1 << le):\r\n offset = s << (h - le)\r\n for i in range(p):\r\n l = a[i + offset]\r\n r = a[i + offset + p] * rot\r\n a[i + offset] = (l + r) % MOD\r\n a[i + offset + p] = (l - r) % MOD\r\n rot *= rate2[(~s & -~s).bit_length()]\r\n rot %= MOD\r\n le += 1\r\n else:\r\n p = 1 << (h - le - 2)\r\n rot = 1\r\n for s in range(1 << le):\r\n rot2 = rot * rot % MOD\r\n rot3 = rot2 * rot % MOD\r\n offset = s << (h - le)\r\n for i in range(p):\r\n a0 = a[i + offset]\r\n a1 = a[i + offset + p] * rot\r\n a2 = a[i + offset + p * 2] * rot2\r\n a3 = a[i + offset + p * 3] * rot3\r\n a1na3imag = (a1 - a3) % MOD * IMAG\r\n a[i + offset] = (a0 + a2 + a1 + a3) % MOD\r\n a[i + offset + p] = (a0 + a2 - a1 - a3) % MOD\r\n a[i + offset + p * 2] = (a0 - a2 + a1na3imag) % MOD\r\n a[i + offset + p * 3] = (a0 - a2 - a1na3imag) % MOD\r\n rot *= rate3[(~s & -~s).bit_length()]\r\n rot %= MOD\r\n le += 2\r\n\r\ndef butterfly_inv(a):\r\n n = len(a)\r\n h = (n - 1).bit_length()\r\n le = h\r\n while le:\r\n if le == 1:\r\n p = 1 << (h - le)\r\n irot = 1\r\n for s in range(1 << (le - 1)):\r\n offset = s << (h - le + 1)\r\n for i in range(p):\r\n l = a[i + offset]\r\n r = a[i + offset + p]\r\n a[i + offset] = (l + r) % MOD\r\n a[i + offset + p] = (l - r) * irot % MOD\r\n irot *= irate2[(~s & -~s).bit_length()]\r\n irot %= MOD\r\n le -= 1\r\n else:\r\n p = 1 << (h - le)\r\n irot = 1\r\n for s in range(1 << (le - 2)):\r\n irot2 = irot * irot % MOD\r\n irot3 = irot2 * irot % MOD\r\n offset = s << (h - le + 2)\r\n for i in range(p):\r\n a0 = a[i + offset]\r\n a1 = a[i + offset + p]\r\n a2 = a[i + offset + p * 2]\r\n a3 = a[i + offset + p * 3]\r\n a2na3iimag = (a2 - a3) * IIMAG % MOD\r\n a[i + offset] = (a0 + a1 + a2 + a3) % MOD\r\n a[i + offset + p] = (a0 - a1 + a2na3iimag) * irot % MOD\r\n a[i + offset + p * 2] = (a0 + a1 - a2 - a3) * irot2 % MOD\r\n a[i + offset + p * 3] = (a0 - a1 - a2na3iimag) * irot3 % MOD\r\n irot *= irate3[(~s & -~s).bit_length()]\r\n irot %= MOD\r\n le -= 2\r\n\r\ndef multiply(s, t):\r\n n = len(s)\r\n m = len(t)\r\n if min(n, m) <= 60:\r\n a = [0] * (n + m - 1)\r\n for i in range(n):\r\n if i % 8 == 0: \r\n for j in range(m):\r\n a[i + j] += s[i] * t[j]\r\n a[i + j] %= MOD\r\n else:\r\n for j in range(m):\r\n a[i + j] += s[i] * t[j]\r\n return [x % MOD for x in a]\r\n a = s.copy()\r\n b = t.copy()\r\n z = 1 << (n + m - 2).bit_length()\r\n a += [0] * (z - n)\r\n b += [0] * (z - m)\r\n butterfly(a)\r\n butterfly(b)\r\n for i in range(z):\r\n a[i] *= b[i]\r\n a[i] %= MOD\r\n butterfly_inv(a)\r\n a = a[:n + m - 1]\r\n iz = pow(z, MOD - 2, MOD)\r\n return [v * iz % MOD for v in a]\r\n\r\ndef mul(a,b):\r\n c=multiply(a,b)\r\n return [i>=1 for i in c]\r\n\r\ndef doubling(x,k):\r\n if k==1:\r\n return x\r\n if k%2==0:\r\n y=doubling(x,k//2)\r\n return mul(y,y)\r\n return mul(doubling(x,k-1),x)\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmx=max(a)\r\nc=[0]*(mx+1)\r\nfor i in a:\r\n c[i]=1\r\n\r\nd=doubling(c,k)\r\nans=[]\r\nfor i in range(len(d)):\r\n if d[i]:\r\n ans.append(i)\r\n\r\nprint(*ans)", "MOD, ROOT = 998244353, 3\r\nI = lambda: [int(i) for i in input().split()]\r\n\r\n\r\n##############################################\r\ndef ntt(a, inv=0):\r\n n = len(a)\r\n w = [1] * (n >> 1)\r\n w[1] = pow(ROOT, (MOD - 1) // n * (inv * (MOD - 3) + 1), MOD)\r\n\r\n for i in range(2, n >> 1):\r\n w[i] = (w[i - 1] * w[1]) % MOD\r\n\r\n rev = [0] * n\r\n for i in range(n):\r\n rev[i] = rev[i >> 1] >> 1\r\n if i & 1:\r\n rev[i] |= n >> 1\r\n if i < rev[i]:\r\n a[i], a[rev[i]] = a[rev[i]], a[i]\r\n\r\n log_n = (n + 1).bit_length()\r\n for i in range(1, log_n):\r\n half, diff = 1 << (i - 1), log_n - i - 1\r\n for j in range(0, n, 1 << i):\r\n for k in range(j, j + half):\r\n v = (w[(k - j) << diff] * a[k + half]) % MOD\r\n a[k + half] = a[k] - v\r\n a[k] += v\r\n\r\n if not inv: return\r\n inv_n = pow(n, MOD - 2, MOD)\r\n for i in range(n):\r\n a[i] = (a[i] * inv_n) % MOD\r\n\r\n\r\ndef ntt_conv(a, b):\r\n l1, l2 = len(a), len(b)\r\n s = l1 + l2 - 1\r\n n = 1 << s.bit_length()\r\n a += [0] * (n - l1)\r\n b += [0] * (n - l2)\r\n ntt(a)\r\n ntt(b)\r\n for i in range(n):\r\n a[i] = (a[i] * b[i]) % MOD\r\n ntt(a, True)\r\n del a[s:]\r\n##############################################\r\n\r\nn, k = I()\r\nA = I()\r\nN = max(A) + 1\r\n\r\npol = [0]*N\r\nfor x in A: pol[x] = 1\r\narr = [pol[:] for _ in range(k)]\r\n\r\ndef prod(l):\r\n n = len(l)\r\n if n == 1: return l[0]\r\n lft = prod(l[:n//2])\r\n rgh = prod(l[n//2:])\r\n ntt_conv(lft, rgh)\r\n return [int(i != 0) for i in lft]\r\n\r\npol = prod(arr)\r\nans = [i for i, x in enumerate(pol) if x == 1]\r\nprint(\" \".join(str(x) for x in ans))" ]

[ "import sys\r\nq,w,num = map(int,input().split())\r\n \r\nfor p in range(-1000,1001):\r\n if q*(p**num)== w:\r\n print(p)\r\n sys.exit()\r\nprint(\"No solution\")", "a, b, n = map(int, input().split())\r\ncheck = False\r\nfor i in range(-1000, 1001):\r\n if a * i ** n == b:\r\n print(i)\r\n check = True\r\n break\r\n\r\nif not check:\r\n print(\"No solution\")\r\n# print(x)", "a, b, n = map(int, input().split())\r\nfor i in range(-1000, 1001):\r\n if a*(i**n) == b:\r\n print(i)\r\n exit()\r\nprint(\"No solution\")", "def task9(A, B, n):\r\n for X in range(-1000, 1001):\r\n if A * (X**n) == B:\r\n return X\r\n return \"No solution\"\r\n\r\n[A, B, n] = input().split()\r\nprint(task9(int(A), int(B), int(n)))", "a, b, n = map(int, input().split())\r\nif a > 0 and b < 0 and n % 2 == 0 or a < 0 and b > 0 and n % 2 == 0:\r\n\tprint('No solution')\r\n\texit()\r\nif a == 0 and b == 0:\r\n\tprint(5)\r\n\texit()\r\nelif a == 0 and b != 0:\r\n\tprint('No solution')\r\n\texit()\r\nelif b == 0:\r\n\tprint(0)\r\n\texit()\r\nif abs(b) % abs(a) != 0:\r\n\tprint('No solution')\r\n\texit()\r\nx = abs(b // a)\r\nfor i in range(1, x + 1):\r\n\tif x == pow(i, n):\r\n\t\tif a < 0 and b > 0 or a > 0 and b < 0:\r\n\t\t\tprint(-i)\r\n\t\t\texit()\r\n\t\telse:\r\n\t\t\tprint(i)\r\n\t\t\texit()\r\nprint('No solution')", "a, b, n = map(int, input().split())\r\nif(a==0 and b==0):\r\n print(1)\r\nelif(a==0 and b!=0):\r\n print(\"No solution\")\r\nelif(a!=0 and b==0):\r\n print(\"0\")\r\nelif(b % a!=0):\r\n print(\"No solution\")\r\nelse:\r\n temp=b/a\r\n if(temp<0 and n%2==0):\r\n print(\"No solution\")\r\n elif(temp>0):\r\n i=1\r\n flag=0\r\n while(pow(i,n)<=temp):\r\n if(pow(i,n)==temp):\r\n flag=1\r\n break\r\n i=i+1\r\n if(flag==0):\r\n print(\"No solution\")\r\n else:\r\n print(i)\r\n elif(temp<0):\r\n i=1\r\n flag=0\r\n temp=-1*temp\r\n while(pow(i,n)<=temp):\r\n if(pow(i,n)==temp):\r\n flag=1\r\n break\r\n i=i+1\r\n if(flag==0):\r\n print(\"No solution\")\r\n else:\r\n print(-i)", "a, b, n = map(int, input().split())\r\nf = 0\r\nfor i in range(-1000, 1001, 1):\r\n if (a*(i**n))==b:\r\n print(i)\r\n f=1\r\n break\r\nif(f==0):\r\n print(\"No solution\")", "a, b, n = map(int,input().split())\nf = 0\nfor i in range(-1000,1001):\n if a*pow(i,n) == b and f == 0:\n print(int(i))\n f = 1\n\nif f == 0 : print(\"No solution\")\n\t \t \t\t\t\t \t\t\t\t \t \t\t\t\t\t\t \t", "A, B, n = [int(x) for x in input().split()]\n\ndef main(A, B, n):\n if B == 0:\n return 0\n if A == 0:\n return 'No solution'\n if not B % A == 0:\n return 'No solution'\n K = B // A\n if K < 0:\n if n % 2 == 0:\n return 'No solution'\n K = K * (-1)\n for i in range(K + 1):\n j = i ** n\n if j == K:\n return i * (-1)\n if j > K:\n return 'No solution'\n\n\n for i in range(K + 1):\n j = i ** n\n if j == K:\n return i\n if j > K:\n return 'No solution'\n\nprint(main(A, B, n))\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: Sat 15 Apr 2023 at 18:10:59 UTC+7, Hanoi, Vietnam\r\n# **/\r\n\r\na, b, n = map(int, input().split())\r\n\r\nfor x in range(-1000, 1001):\r\n if a * x**n == b:\r\n print(x)\r\n exit()\r\nprint(\"No solution\")", "a,b,n = map(int,input().split())\nfor i in range(-1000, 1001):\n if a * pow(i, n) == b:\n print(i)\n exit()\nprint(\"No solution\")\n# Thu Oct 08 2020 21:40:42 GMT+0300 (Москва, стандартное время)\n", "A,B,n=map(int,input().split())\r\n\r\nif A==0 or n==0:\r\n ANS=1\r\nelse:\r\n ANS=round(abs(B/A)**(1/n))\r\n\r\nif A*(ANS**n)==B:\r\n print(ANS)\r\n\r\nelif A*((-ANS)**n)==B:\r\n print(-ANS)\r\n \r\nelse:\r\n print(\"No solution\")\r\n", "import sys\r\nd=input().split()\r\na=int(d[0])\r\nb=int(d[1])\r\nn=int(d[2])\r\nfor i in range(-1000,10001):\r\n if a*(i**n)==b:\r\n print(i)\r\n sys.exit()\r\nprint(\"No solution\")\r\n", "A, B, n = tuple(map(int, input().split()))\r\n\r\nok = False\r\nfor i in range(-1001, 1001):\r\n if A * pow(i, n) == B:\r\n print(i)\r\n ok = True\r\n break\r\n\r\nif not ok:\r\n print(\"No solution\")", "x = [int(i) for i in input().split()]\r\na=x[0]\r\nb=x[1]\r\nn=x[2]\r\nsolution=False\r\nif a==0:\r\n if b==0:\r\n print(\"5\")\r\n else:\r\n print(\"No solution\")\r\nelif b%a!=0:\r\n print(\"No solution\")\r\nelse:\r\n for x in range(-1000, 1001):\r\n c=1\r\n for i in range(n):\r\n c=c*x\r\n if c==b/a:\r\n print(x)\r\n solution=True\r\n break\r\n if solution==False:\r\n print(\"No solution\")", "import sys\r\na,b,n=map(int,input().split())\r\nfor x in range(-abs(b)-1,abs(b)+1):\r\n if a*(x**n)==b:\r\n print(x)\r\n sys.exit()\r\nprint('No solution')", "a, b, n = map(int, input().split())\r\nfor x in range(-2000, 2000):\r\n if a * int(pow(x, n)) == b:\r\n print(x)\r\n exit()\r\nprint(\"No solution\")", "a, b, n = [int(x) for x in input().split()]\r\nfor x in range(-1000, 1001):\r\n\tif a * pow(x, n) == b:\r\n\t\tprint(x)\r\n\t\texit()\r\nprint('No solution')", "# 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\na, b, n = map(int, input().split())\r\nfor i in range(-1000, 1002, 1):\r\n if a * (i ** n) == b:\r\n print(i)\r\n break\r\nelse:\r\n print(\"No solution\")\r\n", "import math\r\n\r\nA, B, n = [float(item) for item in input().split(' ')]\r\nhelper = 0\r\nif A == 0 and B != 0:\r\n helper = 2\r\nelif A == 0 and B == 0:\r\n helper = 1\r\nelse:\r\n helper = B / A\r\n\r\nneed_minus = helper < 0\r\nif need_minus:\r\n helper = -helper\r\n\r\nresult = pow(helper, 1.0 / n)\r\nif not need_minus:\r\n result += 0.000000001 # 9.999999999999998 + 0.000000001 = 10.000000001\r\n result *= 100000000 # 1000000000.1\r\n result = math.floor(result) # 1000000000.0\r\n result /= 100000000 # 10.000000000\r\nif math.floor(result) == result:\r\n print(int(result) if not need_minus else int(-result))\r\nelse:\r\n print('No solution')\r\n\r\n'''\r\n1 1000 3\r\n\r\n9.999999999999998\r\n'''\r\n", "\r\n# print((-4)//(-2))\r\n\r\nfrom math import ceil\r\nfrom decimal import *\r\n\r\ndef solve():\r\n a, b, n = map(int , input().split())\r\n for i in range(-1001, 1001):\r\n if a*i**n == b:\r\n print(i)\r\n return\r\n print(\"No solution\")\r\nsolve()", "a, b, n = map(int, input().split())\r\nif b == 0: print(0)\r\nelse:\r\n if a == 0 or b % a: print('No solution')\r\n else:\r\n k = b // a\r\n if k < 0: x = - int(((- k) ** (1 / n)) + 0.0001)\r\n else: x = int((k ** (1 / n)) + 0.0001)\r\n if x ** n == k: print(x)\r\n else: print('No solution')", "def ret(a,b,n):\r\n\tfor i in range(-5000,5000):\r\n\t\tif(a*(i**n) == b):\r\n\t\t\tprint(i)\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(\"No solution\")\r\nx,y,z = map(int,input().split())\r\nret(x,y,z)\r\n", "a,b,n=map(int,input().split())\r\nfor x in range(-1000,1001):\r\n\tif a*x**n==b:exit(print(x))\r\nprint('No solution')\n# Mon Oct 05 2020 13:27:10 GMT+0300 (Москва, стандартное время)\n", "a,b,n=map(int,input().split())\nfor x in range(-1000,1001):\n if a*x**n==b:\n exit(print(x))\nprint('No solution')\n\t\t\t\t \t\t\t\t\t\t \t \t \t \t\t \t \t \t", "a, b, n=[int(i) for i in input().split()]\r\nfor i in range(-1000,1001):\r\n if a*pow(i,n)==b:\r\n print(i)\r\n exit()\r\nprint(\"No solution\")", "a,b,n=map(int,input().split())\r\nfor i in range(-1000,1001):\r\n\tif a*(i**n)==b:\r\n\t\tprint(i)\r\n\t\tbreak\r\nelse:\r\n\tprint(\"No solution\")\r\n", "a,b,n=map(int, input().split())\r\nfor x in range(-1000,1001):\r\n if a*x**n==b: print(x); exit()\r\nelse: print(\"No solution\")", "n,m,k = map(int,input().split())\r\n \r\nfor i in range(-1100,1100):\r\n if n*(i**k)==m:\r\n print(i)\r\n exit()\r\nprint(\"No solution\")", "x,y,n=map(int,input().split())\r\nfor i in range(-1000,1001):\r\n\tif x*i**n==y:\r\n\t print(i)\r\n\t quit()\r\nprint(\"No solution\")", "a, b, n = [int(i) for i in input().split()]\r\n\r\nf = 1\r\n\r\nfor i in range(-1000, 1001, 1):\r\n k = 1\r\n c = n\r\n while c > 0:\r\n k *= i\r\n c -= 1\r\n\r\n if (a * k == b and f == 1):\r\n print(i)\r\n f = 0\r\nif f == 1:\r\n print(\"No solution\")\n# Wed Oct 14 2020 12:41:01 GMT+0300 (Москва, стандартное время)\n", "a,b,c=map(int,input().split())\r\nif b==0:print(0)\r\nelif a==0:print('No solution')\r\nelse:\r\n if a*b>0:d=round((b/a)**(1/c))\r\n else:d=-round((b/-a)**(1/c))\r\n if a*d**c==b:print(d)\r\n else:print('No solution')\r\n", "a,b,n = list(map(int , input().split()))\r\nans = 'No solution'\r\nfor i in range(-10000,10000):\r\n if a*(i**n) == b:\r\n ans = i\r\n break\r\n\r\nprint(ans)\r\n", "import math\na,b,n=map(int,input().split())\nif a==b==0:\n print(5)\n exit()\nif a==0:\n print('No solution')\n exit()\nif b%a!=0:\n print('No solution')\n exit()\nb=b//a\nif b<0 and n%2==0:\n print('No solution')\n exit()\nnegative=False\nif b<0:\n b=-b\n negative=True\nz=int(round(math.pow(b,1/n),2))\nif z**n==b:\n if negative:\n print(-z)\n else:\n print(z)\n exit()\nelse:\n print('No solution')\n exit()", "A,B,n=map(int,input().split())\n\nif(A==0 and B==0):\n print(5)\nelif(A==0):\n print(\"No solution\")\n\nelif((B/A)%1!=0):\n print(\"No solution\")\nelse:\n\n v=B//A\n\n\n if(v<0):\n x=-1\n else:\n x=1\n v=pow(abs(v),1/n)\n vv=round(v)\n if(abs(vv-v)>(10**(-6))):\n print(\"No solution\")\n else:\n print(x*int(vv))\n", "import math\r\nimport sys\r\na,b,c=input().split(' ')\r\na=int(a); b=int(b); c=int(c)\r\nfor i in range( -abs(b), abs(b)+1):\r\n if a*pow(i, c)==b:\r\n print(i,end='')\r\n sys.exit(0)\r\nprint(\"No solution\",end='')\r\n", "a, b, n = map(int, input().split())\r\nout = 0\r\nfor i in range(-1000, 1001):\r\n x = (i ** n)\r\n if a * x == b:\r\n print(i)\r\n out = 1\r\n break\r\nif out != 1:\r\n print('No solution')", "a, b, n = map(int, input().split())\ncontador=-1000\nwhile contador != 1001:\n formula=a*(contador**n)\n if formula == b:\n print(contador)\n exit()\n contador+=1\n \nprint(\"No solution\")\n\t \t \t \t\t \t \t \t\t \t \t \t", "a,b,n = map(int, input().split())\r\nif(a==0):\r\n if(b==0):\r\n print(\"0\")\r\n else:\r\n print(\"No solution\")\r\nelif(b%a!=0):\r\n print(\"No solution\")\r\nelse:\r\n for i in range(-1000, 1001):\r\n if i**n == b//a:\r\n print(i)\r\n exit()\r\n print('No solution')", "def nik(rud,panda,pig):\r\n for i in range(-1000, 1002, 1):\r\n if rud * (i ** pig) == panda:\r\n print(i)\r\n break\r\n else:\r\n print(\"No solution\")\r\nrud, panda, pig = map(int, input().split())\r\nnik(rud,panda,pig)\r\n", "a, b, n = map(int, input().split())\n\nans = 'No solution'\nfor i in range(-2001, 2001):\n aux = a * i**n\n if aux == b:\n ans = i\n break\n\nprint(ans)\n\n\t\t\t \t\t \t \t \t \t\t\t\t\t\t\t\t \t \t \t\t\t", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\na,b,n=map(int,input().split())\r\nans='No solution'\r\nif a==0 and b==0:ans=0\r\nelif a !=0:\r\n mi=b/a;\r\n if mi==0:ans=0\r\n elif mi<0 and n%2:\r\n for i in range(-1,-1001,-1):\r\n if i**n==mi:ans=i;break\r\n elif i**n<mi:break\r\n elif mi>0: \r\n for i in range(1,1001):\r\n if i**n==mi:ans=i;break\r\n elif i**n>mi:break\r\nprint(ans) ", "a,b,n=map(int,input().split())\r\nflag=0\r\nfor i in range(-1000,1001):\r\n\tif a*(i**n)==b:\r\n\t\tprint(i)\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==0:\r\n\tprint(\"No solution\")", "a, b, n = map(int, input().split())\r\n\r\n\r\ndef main():\r\n for i in range(-4000, 4001):\r\n if a * i ** n == b:\r\n print(i)\r\n return\r\n print(\"No solution\")\r\n\r\n\r\nmain()\r\n", "a,b,n=map(int,input().split())\r\nok = False\r\nfor x in range(-abs(b)-1,abs(b)+1):\r\n if a*(x**n)==b:\r\n print(x)\r\n ok = True\r\n break\r\nif not ok:\r\n print('No solution')", "a,b,n=map(int,input().split())\r\nfor x in range(-1000,1001):\r\n if a*x**n==b:\r\n exit(print(x))\r\nprint('No solution')", "# LUOGU_RID: 96644808\nimport sys\nd=input().split()\na=int(d[0])\nb=int(d[1])\nn=int(d[2])\nfor i in range(-1000,10001):\n if a*(i**n)==b:\n print(i)\n sys.exit()\nprint(\"No solution\")\n", "a, b, n = map(int, input().split())\r\nif a == 0:\r\n print(0 if b == 0 else 'No solution')\r\nelif b % a:\r\n print('No solution')\r\nelse:\r\n for x in range(-1000, 1001):\r\n if x ** n == b // a:\r\n print(x)\r\n exit()\r\n print('No solution')", "a,b,n=map(int,input().split())\r\nif(a==0):\r\n if(0*(1**n)==b):\r\n print(1)\r\n else:\r\n print(\"No solution\")\r\n quit()\r\nx=round(abs((b/a)**(1/n)))\r\ny=-x\r\nif(a*(x**n)==b):\r\n print(x)\r\nelif(a*(y**n)==b):\r\n print(y)\r\nelse:\r\n print(\"No solution\")\r\n", "a,b,n = map(int,input().split())\n\nfor x in range(-1000,1001):\n \n if a*x**n == b:\n print(x)\n break\nelse:\n print('No solution')\n\n\t \t \t \t\t \t \t\t\t \t\t \t \t\t\t\t\t\t", "a = input().split()\r\na1 = int(a[0])\r\na2 = int(a[1])\r\na3 = int(a[2])\r\nk = 'No solution'\r\nfor i in range(-10000, 10000):\r\n if a1*i**a3 == a2:\r\n k = i\r\n break\r\nprint(k)", "import sys\n\ndef fail():\n print('No solution')\n sys.exit()\n\ndef succeed(x):\n print(x)\n sys.exit()\n\na, b, n = map(int, input().split())\n\nif b == 0:\n succeed(0)\n\nif a == 0:\n fail()\n\nif b % abs(a) != 0:\n fail()\n\nsign = 1\nif b // a < 0 and n % 2 == 1:\n sign = -1\n\nx = sign * round(abs(b // a) ** (1 / n))\nif a * x**n == b:\n succeed(x)\n\nfail()\n", "import sys\r\na,b,n = map(int,input().split())\r\nfor x in range(-1000,1001):\r\n\tif a * x**n == b:\r\n\t\tprint(x)\r\n\t\tsys.exit()\r\nprint('No solution')", "import sys\r\na, b, n = [int (x) for x in sys.stdin.readline ().split ()]\r\nfor t in range (-1000, 1001):\r\n\tif a * (t ** n) == b:\r\n\t\tprint (t)\r\n\t\texit ()\r\nprint ('No solution')", "'''بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ'''\r\n#codeforces\r\ngi = lambda : list(map(int,input().split()))\r\na, b, n = gi()\r\nif a == 0:\r\n if b == 0:\r\n print(0)\r\n else:\r\n print(\"No solution\")\r\n exit()\r\nif b % a:\r\n print(\"No solution\")\r\n exit()\r\nx = -1000\r\nwhile x <= 1000:\r\n if x ** n == b // a:\r\n print(x)\r\n exit()\r\n x += 1\r\nprint(\"No solution\")", "x,y,n=map(int,input().split())\r\nfor i in range(-1000,1001):\r\n\tif x*(i**n)==y:\r\n\t\tprint(i)\r\n\t\tbreak\r\nelse:\r\n\tprint(\"No solution\")", "import math\r\n\r\nmind_bending_A, utterly_absurd_B, nonsensical_n = map(int, input().split())\r\n\r\nutterly_ridiculous_possible = True\r\nmind_blowing_X = 0\r\n\r\nif mind_bending_A == 0 and utterly_absurd_B == 0:\r\n print(\"1\")\r\nelif mind_bending_A == 0 and utterly_absurd_B != 0:\r\n print(\"No solution\")\r\nelif mind_bending_A != 0 and utterly_absurd_B == 0:\r\n print(\"0\")\r\nelif utterly_absurd_B % mind_bending_A != 0:\r\n print(\"No solution\")\r\nelif mind_bending_A * utterly_absurd_B < 0 and nonsensical_n % 2 == 0:\r\n print(\"No solution\")\r\nelse:\r\n totally_insane_sign = 2 * (mind_bending_A * utterly_absurd_B > 0) - 1\r\n mind_blowing_solution = totally_insane_sign * int(math.pow(1.0 * totally_insane_sign * utterly_absurd_B / mind_bending_A, 1.0 / nonsensical_n))\r\n \r\n mind_boggling_lhs = mind_bending_A\r\n mind_warping_lhs_p = mind_bending_A\r\n mind_blowing_lhs_n = mind_bending_A\r\n for incomprehensible_k in range(nonsensical_n):\r\n mind_boggling_lhs *= mind_blowing_solution\r\n mind_warping_lhs_p *= (mind_blowing_solution + 1)\r\n mind_blowing_lhs_n *= (mind_blowing_solution - 1)\r\n \r\n if mind_boggling_lhs == utterly_absurd_B:\r\n print(mind_blowing_solution)\r\n elif mind_warping_lhs_p == utterly_absurd_B:\r\n print(mind_blowing_solution + 1)\r\n elif mind_blowing_lhs_n == utterly_absurd_B:\r\n print(mind_blowing_solution - 1)\r\n else:\r\n print(\"No solution\")\r\n", "import math\r\na,b,n=map(int,input().split())\r\ni=-1000\r\nif(a==0 and b==0):\r\n print(0)\r\nelif(a==0 and b!=0):\r\n print(\"No solution\")\r\nelif(b%a==0):\r\n while(i<1001):\r\n if(int(math.pow(i,n))==int(b/a)):\r\n print(i)\r\n exit()\r\n i+=1\r\n print(\"No solution\")\r\nelse:\r\n print(\"No solution\")", "a,b,n=map(int,input().split())\r\nif b<0:\r\n z=-b\r\nelse:\r\n z=b\r\nfor x in range(-z,z+1):\r\n if a*x**n==b:\r\n print(x)\r\n exit()\r\nprint(\"No solution\")\r\n", "a, b, n = [int(x) for x in input().split(\" \")]\r\nfor i in range(-1000,1001):\r\n if a * (i ** n) == b:\r\n print(i)\r\n exit()\r\nprint(\"No solution\")", "a,b,n=map(int,input().split())\r\ns=0\r\n\r\nfor x in range(-abs(b),abs(b)+1):\r\n if a*(x)**n==b:\r\n print(x)\r\n s=1\r\n break\r\n\r\nif s==0:\r\n print('No solution')\r\n", "__author__ = \"runekri3\"\r\n\r\na, b, n = list(map(int, input().split()))\r\nif a==0:\r\n if b==0:\r\n print(0)\r\n else:\r\n print(\"No solution\")\r\nelse:\r\n income_multiplied = b/a\r\n\r\n if income_multiplied != int(income_multiplied):\r\n print(\"No solution\")\r\n else:\r\n for x in range(-1000, 1001):\r\n if x**n == income_multiplied:\r\n print(x)\r\n break\r\n else:\r\n print(\"No solution\")\r\n", "import sys\n\na, b, n = map(int, input().split())\n\nfor x in range(-1000, 1001):\n if a * x**n == b:\n print(x)\n sys.exit()\n\nprint('No solution')\n\n", "a,b,n = map(int,input().split())\r\nfor x in range(1000,-1001,-1):\r\n if a*x**n==b:\r\n print(x)\r\n break\r\nelse:\r\n print('No solution')\r\n\n# Fri Oct 16 2020 17:49:47 GMT+0300 (Москва, стандартное время)\n", "def accounting(r,pl,p):\r\n for i in range(-1000, 1002, 1):\r\n if r * (i ** p) == pl:\r\n print(i)\r\n break\r\n else:\r\n print(\"No solution\")\r\nr, pl, p = map(int, input().split())\r\naccounting(r,pl,p)\r\n" ]

[ "n, m = map(int, input().split())\r\ns = list(input() for _ in range(n)) \r\nres, t = 0, [0] * n\r\nfor i in range(m):\r\n for j in range(n-1):\r\n if not t[j] and s[j][i] > s[j+1][i]:\r\n res += 1\r\n break\r\n else:\r\n for j in range(n-1):\r\n t[j] = t[j] or s[j][i] < s[j+1][i]\r\nprint(res)\r\n", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\nf = ['']*(n)\r\n\r\nans = 0\r\nfor i in range(m):\r\n \r\n t = [f[j]+s[j][i] for j in range(n)]\r\n if t == sorted(t): \r\n f = t\r\n else:\r\n ans += 1\r\n \r\nprint(ans)", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n o = input()\r\n l.append(o)\r\n\r\nans = 0\r\narr = [\"\"]*n\r\nfor i in range(m):\r\n flag = 0\r\n for j in range(1,n):\r\n s1 = arr[j-1]\r\n s2 = arr[j]\r\n if s1+l[j-1][i] > s2+l[j][i]:\r\n flag = 1\r\n break\r\n\r\n if flag:\r\n ans += 1\r\n continue\r\n\r\n for j in range(n):\r\n arr[j] = arr[j]+l[j][i]\r\n\r\nprint(ans)", "n, m = map(int, input().split())\r\ns=[]\r\nfor x in range(n):\r\n s.append(input().strip()) \r\nf=['']*n\r\nans=0\r\nfor x in range(m):\r\n t = [f[i]+s[i][x] for i in range(n)]\r\n if t == sorted(t):\r\n f = t\r\n else :\r\n ans += 1\r\nprint(ans) \r\n ", "v=list((input().split()))\r\nn=int(v[0])\r\nm=int(v[1])\r\nv=list()\r\nfor i in range(n):\r\n v.append(input())\r\nif n==1:\r\n print(0)\r\n exit()\r\nkll=0\r\nj=0\r\nbrk=0\r\nwhile j<m:\r\n for i in range (1,n):\r\n if v[i][:j+1]<v[i-1][:j+1]:\r\n brk=1\r\n break\r\n if brk:\r\n for i in range(n):\r\n tmp=list(v[i])\r\n tmp.pop(j)\r\n v[i]=\"\".join(tmp)\r\n kll+=1\r\n m-=1\r\n else:\r\n j+=1\r\n brk=0\r\nprint(kll)", "n, m = map(int, input().split())\r\n\r\ntable = [input() for _ in range(n)]\r\nans = 0\r\ncol = 0\r\n\r\nfor i in range(m):\r\n if all(a[:col+1] <= b[:col+1] for a, b in zip(table, table[1:])):\r\n col += 1\r\n else:\r\n ans += 1\r\n table = [a[:col] + a[col+1:] for a in table]\r\n\r\n\r\nprint(ans)\r\n", "n, m = list(map(int, input().rstrip().split()))\nwords = []\nop = 0\nfor i in range(n):\n words += [input()]\nfinal = [\"\"]*n\nfor j in range(m):\n flag = 1\n for i in range(n - 1):\n x = final[i] + words[i][j]\n y = final[i + 1] + words[i + 1][j]\n\n if x > y:\n op += 1\n flag = 0\n break\n if flag == 1:\n for i in range(n):\n final[i] += words[i][j]\nprint(op)", "from collections import defaultdict, deque\r\ndef main():\r\n n, m = map(int, input().split())\r\n a = [[c for c in input()] for i in range(n) ]\r\n che = [ [0 for i in range(n+2)] for j in range(n+2)]\r\n ans = 0\r\n for j in range(m):\r\n check = False\r\n for i in range(n-1):\r\n if a[i][j] > a[i+1][j]:\r\n if not che[i][i+1]:\r\n ans += 1\r\n check = True\r\n break\r\n if not check:\r\n for i in range(n-1):\r\n if a[i][j] < a[i+1][j]:\r\n che[i][i+1] = 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m = map(int, input().split())\n\nA = []\nfor _ in range(n):\n A.append(input())\n\nrms = set()\nwhile 1:\n flag = False\n cnt = 0\n for i in range(1, n):\n curr = [ch for i, ch in enumerate(A[i]) if i not in rms]\n last = [ch for i, ch in enumerate(A[i-1]) if i not in rms]\n curr = ''.join(curr)\n last = ''.join(last)\n if curr < last:\n for j in range(m):\n if j in rms:\n continue\n if A[i][j] < A[i-1][j]:\n # print(A[i-1], A[i], j)\n rms.add(j)\n flag = True\n break\n else:\n cnt += 1\n if flag:\n break\n if cnt == n-1:\n break\nprint(len(rms))\n", "import sys\nn, m = [int(i) for i in input().split()]\na = [[0] * n for i in range(m)]\nfor i in range(n):\n temp = input()\n for j in range(m):\n a[j][i] = temp[j]\n\nc = 0\n\ndef blatant(a):\n for i in range(1,len(a)):\n if a[i] < a[i-1]:\n return True\n return False\n\nmatch = []\nwhile True:\n if len(a) == 0:\n print(m)\n sys.exit(0)\n elif blatant(a[0]):\n del a[0]\n c += 1\n else:\n break\n\nfor i in range(1,n):\n if a[0][i] == a[0][i-1]:\n match.append(i)\n \ndef rm(a,match):\n c = 0\n for m in match:\n i = 1\n while i < len(a):\n if a[i][m] < a[i][m-1]:\n del a[i]\n c += 1\n elif a[i][m] == a[i][m-1]:\n i += 1\n else:\n break\n return c\n\nwhile True:\n temp = rm(a,match)\n if temp == 0:\n break\n c += temp\n \nprint(c)\n", "def Sum_Arr(Result,Words,I,Count_2):\r\n R=[]\r\n for Count in range(I):\r\n R.append(Result[Count]+Words[Count][Count_2])\r\n return R\r\nInpt=list(map(int,input().split()))\r\nWords=[]\r\nfor Count in range(Inpt[0]):\r\n Words.append(input())\r\nResult=['']*Inpt[0]\r\nfor Count_2 in range(Inpt[1]):\r\n if sorted(Sum_Arr(Result,Words,Inpt[0],Count_2))==Sum_Arr(Result,Words,Inpt[0],Count_2):\r\n for Count_3 in range(Inpt[0]):\r\n Result[Count_3]=Result[Count_3]+Words[Count_3][Count_2]\r\nprint(Inpt[1]-len(Result[0]))\r\n", "n, m = map(int, input().split())\n\ngrid = []\nfor _ in range(n):\n grid.append(list(input()))\n\n\ndeleted = 0\nlast = []\nfor j in range(m):\n for i in range(1,n):\n if grid[i][j] < grid[i-1][j] and len(last) == 0:\n deleted += 1\n break\n \n elif len(last) and grid[i][j] < grid[i-1][j]:\n if ''.join(grid[i-1][x] for x in last+[j]) > ''.join(grid[i][x] for x in last+[j]):\n deleted += 1\n break\n else:\n last.append(j)\n\nprint(deleted)", "l, c = map(int, input().split())\r\n\r\na=[]\r\nfor i in range(l):\r\n a.append(input())\r\n\r\nl=[]\r\nj=0\r\nwhile j<len(a[0]):\r\n d=False\r\n for i in range(1,len(a)):\r\n #print(a[i][:j+1],a[i-1][:j])\r\n if a[i][:j+1]<a[i-1][:j+1]:\r\n d=True\r\n #print(j)\r\n break\r\n if d:\r\n for i in range(len(a)):\r\n a[i]=a[i][:j]+a[i][j+1:]\r\n #print(a)\r\n \r\n else:\r\n j+=1\r\n \r\nprint(c-len(a[0])) ", "R = lambda: map(int, input().split())\r\n\r\nn, m = R()\r\nstrs = [input() for i in range(n)]\r\nres = 0\r\nfor j in range(m):\r\n base = ['' for _ in range(n)]\r\n for j2 in range(j, m):\r\n nxt = [base[r] + strs[r][j2] for r in range(n)]\r\n if len(nxt) <= 1 or all(s1 <= s2 for s1, s2 in zip(nxt, nxt[1:])):\r\n base = nxt\r\n res = max(res, len(base[0]))\r\nprint(m - res)", "from operator import itemgetter\r\n \r\n \r\nn, m = map(int, input().strip().split())\r\n \r\ntable = []\r\n \r\nbad_cols = [False] * m\r\nfor _ in range(n):\r\n table.append(input().strip())\r\n \r\nfor j in range(m):\r\n indices = [idx for idx in range(j + 1) if not bad_cols[idx]]\r\n for i in range(1, n):\r\n if itemgetter(*indices)(table[i]) < itemgetter(*indices)(table[i - 1]):\r\n bad_cols[j] = True\r\n break\r\n \r\nprint(sum(bad_cols))\r\n", "\ndef main():\n n, m = map(int, input().split())\n a = [input() for x in range(n)]\n s = ['']*n\n ans = 0\n for i in range(m):\n ts = [s[j] + a[j][i] for j in range(n)]\n if(ts == sorted(ts)):\n s = ts\n else:\n ans += 1\n\n print(ans)\n\n\nmain()\n", "n,m=map(int,input().split())\nans=0\nst=[input() for i in range(n)]\nnew=['']*n\nfor i in range(m):\n newstr=[new[j]+st[j][i] for j in range(n)]\n # print(newstr)\n if newstr==sorted(newstr):\n new=newstr\n else:ans+=1\nprint(ans)\n \t\t \t\t \t\t \t\t\t \t\t\t\t \t\t \t\t \t\t", "s = input()\ns = s.split()\nn = int(s[0]) # Linhas\nm = int(s[1]) # Colunas\nl = []\n\nfor i in range(0,n):\n\ts = input()\n\tl.append(s)\n\ncont = 0\n\nant = 0\ni = 0\nwhile (i < n):\n\tif (l[ant] > l[i]):\n\t\tfor k in range(0, n):\n\t\t\tl[k] = list(l[k])\n\n\t\tfor j in range(0, m):\n\t\t\tif (l[ant][j] > l[i][j]):\n\t\t\t\tbreak\n\n\t\tfor k in range(0, n):\n\t\t\tl[k].pop(j)\n\t\t\tl[k] = \"\".join(l[k])\n\n\t\ti = 0\n\t\tant = 0\n\t\tm -= 1\n\t\tcont += 1\n\n\telse: \n\t\tant = i\n\t\ti += 1\n\nprint(cont)", "# from itertools import combinations\n# from bisect import bisect_left\n# from functools import *\n# from collections import Counter\n\nI = lambda: list(map(int, input().split()))\nn, m = I()\nans = 0\ncolumns = list(zip(*[input() for i in range(n)]))\ng = [0 for _ in range(n)]\nfor column in columns:\n if sum(g[i] or column[i] <= column[i + 1] for i in range(n - 1)) == n - 1:\n for i in range(n - 1):\n g[i] |= column[i] < column[i + 1]\n else:\n ans += 1\nprint(ans)", "def lexyco(table, pos):\r\n for i in range(len(table)-1):\r\n for s2 in table[i+1:]:\r\n if (table[i][:pos+1] > s2[:pos+1]):\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\ntable = []\r\nfor i in range(n):\r\n table.append(input())\r\ncnt = 0\r\ni = 0\r\nwhile i < len(table[0]):\r\n if lexyco(table, i):\r\n i += 1\r\n else:\r\n cnt += 1\r\n for s in range(len(table)):\r\n table[s] = table[s][:i] + table[s][i+1:]\r\nprint(cnt)", "sizeI, sizeJ = map(int, input().split())\r\na = [list(input()) for _ in range(sizeI)]\r\nres = ['' for _ in range(sizeI)]\r\nfor col in zip(*a):\r\n newRes = res[::]\r\n for i, c in enumerate(col):\r\n newRes[i] += c\r\n if newRes == sorted(newRes):\r\n res = newRes[::]\r\nprint(sizeJ - len(res[0]))", "#!/usr/bin/env python3\n\nn, m = map(int, input().split())\nwords = [input() for _ in range(n)]\n\ni = 1\nans = 0\nwhile True:\n if i > len(words[0]): break\n for j in range(n-1):\n if words[j][:i] > words[j+1][:i]:\n ans += 1\n words = [x[:(i-1)]+x[i:] for x in words]\n i -= 1\n break\n i += 1\n\nprint(ans)\n", "def main():\n n, m = map(int, input().split())\n l = [input() for _ in range(n)]\n lead = [[] for _ in range(n)]\n x = 0\n for nn in zip(*l):\n for l, c in zip(lead, nn):\n l.append(c)\n if tuple(l[-1] for l in sorted(lead)) != nn:\n x += 1\n for l in lead:\n del l[-1]\n print(x)\n\n\nif __name__ == '__main__':\n main()\n", "n,m=map(int, input().split(' ') )\r\ngood = [[] for i in range(n)]\r\nmasstr = [list(str(input())) for i in range(n)]\r\nfor nomer_stolb in range(m):\r\n tmp = [stroka + [masstr[i][nomer_stolb]] for i, stroka in enumerate(good)]\r\n if sorted(tmp)==tmp:\r\n good = tmp\r\nprint (m-len(good[0]))", "n, m = map(int, input().split())\na = []\nfor index in range(n):\n a.append(input())\n\ndef foo(a):\n global n, m\n column = m\n for i in range(n - 1):\n for j in range(m):\n if a[i][j] < a[i + 1][j]:\n break\n if a[i][j] > a[i + 1][j]:\n column = min(column, j)\n \n if column == m:\n return False\n for i in range(n):\n string = ''\n if column > 0:\n string = a[i][0:column]\n if column < m - 1:\n string += a[i][column + 1: len(a[i])]\n a[i] = string\n m -= 1\n return True\n\nanswer = 0\n\nwhile foo(a):\n answer += 1\nprint(answer)\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\nfrom decimal import *\nN,M = map(int,input().split())\nA = [input() for _ in range(N)]\nl = [[\"\",x] for x in range(N)]\n\nans = 0\nfor i in range(M):\n k = [[a[:],b] for a,b in l]\n for x in range(N):\n k[x][0]+=A[x][i]\n\n k = sorted(k)\n checkl = []\n for a,b in k:\n checkl.append(b)\n if checkl==sorted(checkl):\n # print(checkl,k,l)\n l = k\n ans+=1\nprint(M-ans)\n", "def solve(mat,n,m):\n active = [True]*m\n for j in range(m):\n for i in range(n-1):\n a = ''.join([mat[i][k] for k in range(j+1) if active[k]])\n b = ''.join([mat[i+1][k] for k in range(j+1) if active[k]])\n if a > b: \n active[j] = False\n break\n return len([i for i in active if not i])\n \nn,m = [int(i) for i in input().split()]\nmat = [input() for i in range(n)]\nprint(solve(mat,n,m))", "#I = lambda: [int(i) for i in input().split()]\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\n\r\n# n = int(input())\r\n# l1 = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# s = input()\r\nmod = 1000000007\r\n# print(\"Case #\"+str(_+1)+\":\",)\r\n\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import heappush,heappop,heapify\r\nimport sys\r\nimport math\r\nimport bisect\r\nfrom collections import deque\r\n\r\nfor _ in range(1):\r\n n,m = map(int,input().split())\r\n l = []\r\n for i in range(n):\r\n l.append(input())\r\n h = [[] for i in range(n)]\r\n ans = 0\r\n for i in range(m):\r\n h[0].append(l[0][i])\r\n f = 1\r\n for j in range(1,n):\r\n h[j].append(l[j][i])\r\n if h[j]<h[j-1]:\r\n f=0\r\n break\r\n if not f:\r\n for k in range(j+1):\r\n h[k].pop()\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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n\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 sortedx(lst):\r\n copy = lst[:]\r\n copy.sort()\r\n if copy == lst:\r\n return True\r\n return False\r\n\r\na, b = map(int, input().split(' '))\r\nwords = [input() for i in range(a)]\r\neach = ['' for i in range(a)]\r\n\r\nfor j in range(b):\r\n if sortedx([each[i] + words[i][j] for i in range(a)]):\r\n for ix in range(a):\r\n each[ix] = each[ix] + words[ix][j]\r\n \r\n\r\nprint(b - len(each[0]))\r\n", "n,m=map(int,input().split())\r\nL=[input() for i in range(n)]\r\nk=0\r\ndeleted=set()\r\ndef chek() :\r\n imun=set()\r\n global deleted\r\n global L\r\n global m\r\n global n\r\n for i in range(m) :\r\n if i not in deleted :\r\n for j in range(1,n) :\r\n if L[j][i]>L[j-1][i] :\r\n imun.add(j)\r\n if L[j][i]<L[j-1][i] and j not in imun :\r\n deleted.add(i)\r\n return True\r\n return False\r\n \r\n \r\n \r\nb=chek() \r\n \r\nwhile(b) :\r\n b=chek()\r\nprint(len(deleted))\r\n \r\n \r\n", "def check(t, erased):\r\n prev = [(t[0][i] if i not in erased else None) for i in range(len(t[0]))]\r\n min_idx = float('inf')\r\n for i in range(1, len(t)):\r\n this = [(t[i][j] if j not in erased else None)\r\n for j in range(len(t[i]))]\r\n for j in range(len(prev)):\r\n if prev[j] is None:\r\n continue\r\n if prev[j] < this[j]:\r\n break\r\n if prev[j] > this[j]:\r\n min_idx = min(min_idx, j)\r\n break\r\n prev = this\r\n return min_idx if min_idx != float('inf') else -1\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n table = [input() for _ in range(n)]\r\n\r\n erased = set()\r\n\r\n for _ in range(m):\r\n pos = check(table, erased)\r\n if pos == -1:\r\n print(len(erased))\r\n return\r\n erased.add(pos)\r\n\r\n print(len(erased))\r\n\r\n\r\nmain()\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n(n, m) = (int(i) for i in input().split())\ns = []\nans = 0\n\nfor i in range(n):\n s.append([i for i in input()])\n\nstart = time.time()\ni = 0\nwhile(i < n-1):\n# print(i)\n if s[i] > s[i+1]:\n for j in range (len(s[0])):\n if s[i][j] != s[i+1][j]:\n break\n for k in range(n):\n del s[k][j]\n ans += 1\n i = -1\n# print(i, j, s)\n i += 1\n\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom 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\nmod = int(1e9)+7\r\n\r\nn, m = gil()\r\ns = []\r\nfor _ in range(n):\r\n\ts.append(g())\r\n\r\nans = 0\r\ndiff = [False]*n\r\ndiff[0] = True\r\n\r\nfor j in range(m):\r\n\tisSorted = True\r\n\tifPartiallySorted = True if ans else False\r\n\tfor i in range(1, n):\r\n\t\tisSorted &= s[i][j] >= s[i-1][j]\r\n\t\tifPartiallySorted &= diff[i]|(s[i][j] >= s[i-1][j])\r\n\r\n\tif isSorted:\r\n\t\tans += 1\r\n\t\tfor i in range(1, n):\r\n\t\t\tdiff[i] |= s[i][j] > s[i-1][j]\r\n\r\n\telif ifPartiallySorted:\r\n\t\tans += 1\r\n\t\tfor i in range(1, n):\r\n\t\t\tdiff[i] |= s[i][j] > s[i-1][j]\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(m-ans)\r\n", "n, m = [int(n) for n in input().split()]\r\n\r\npalavras = list()\r\nfor _ in range(n):\r\n palavras.append([e for e in input()])\r\n\r\nif(n == 1): \r\n print(0)\r\n exit()\r\n\r\nans = 0\r\nwhile True:\r\n for i in range(len(palavras) - 1):\r\n parar = False\r\n for j in range(m):\r\n if(palavras[i][j] > palavras[i + 1][j]):\r\n parar = True\r\n for e in palavras: e.pop(j)\r\n ans = ans + 1\r\n m = m - 1\r\n break\r\n elif palavras[i][j] < palavras[i + 1][j]: break\r\n \r\n if(parar): break\r\n else: break\r\n\r\nprint(ans)", "# cook your dish here\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nimport bisect\r\nimport math\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n \r\n\r\nn,m=I()\r\nif n==1:\r\n print(0)\r\n exit()\r\ns=[I1() for i in range(n)]\r\nif m==1:\r\n if s==sorted(s):\r\n print(0)\r\n else:\r\n print(1)\r\n exit()\r\nc,i=0,1\r\nwhile True:\r\n if i>len(s[0]): break\r\n for j in range(n-1):\r\n if s[j][:i]>s[j+1][:i]:\r\n c+=1 \r\n s=[x[:(i-1)]+x[i:] for x in s]\r\n i-=1 \r\n break\r\n i+=1 \r\nprint(c)\r\n ", "def input_split(f): return map(f, input().split())\n\n\ndef main():\n n, m = input_split(int)\n lst = [input()]\n sml = []\n for i in range(n - 1):\n lst.append(input())\n sml.append(False)\n\n ans = 0\n for i in range(m):\n flag = True\n for j in range(n - 1):\n flag = flag and ((lst[j][i] <= lst[j + 1][i]) or sml[j])\n if flag:\n for j in range(n - 1):\n if lst[j][i] < lst[j + 1][i]:\n sml[j] = True\n else:\n ans += 1\n\n print(ans)\n\nif __name__ == \"__main__\":\n main()\n", "import sys\r\nimport bisect\r\nfrom random import randint\r\ninput=lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nfrom math import gcd\r\nsa=lambda :input()\r\nsb=lambda:int(input())\r\nsc=lambda:input().split()\r\nsd=lambda:list(map(int,input().split()))\r\nse=lambda:float(input())\r\nsf=lambda:list(input())\r\nflsh=lambda: sys.stdout.flush()\r\nmod=10**9+7\r\ndef hnbhai():\r\n n,m=sd()\r\n s=[]\r\n for i in range(n):\r\n s.append(sa())\r\n ans=0\r\n row=[0]*n\r\n for i in range(m):\r\n f=0\r\n for j in range(n-1):\r\n if row[j]==0 and s[j][i]>s[j+1][i]:\r\n ans+=1\r\n f=1\r\n break\r\n if f==0:\r\n for j in range(n-1):\r\n if s[j][i]<s[j+1][i]:\r\n row[j]=1\r\n print(ans)\r\n \r\n \r\nfor _ in range(1):\r\n hnbhai()\r\n", "def search_podstroki(s,t):\r\n t1 = s + '$' + t\r\n p = [-1] * (len(t1))\r\n prefix(t1,p)\r\n c1 = 0\r\n for i in range(1,len(t1)):\r\n if (p[i] == len(s)-1):\r\n c1 = -1\r\n if (c1 == -1):\r\n return True\r\n else:\r\n return False\r\n \r\n\r\n\r\n\r\n\r\n\r\ndef prefix(t,p):\r\n k = 0\r\n for i in range(1,len(t)):\r\n k = p[i-1]\r\n while ((k >= 0) and (t[k+1] != t[i])):\r\n k = p[k]\r\n if (t[k+1] == t[i]):\r\n k = k + 1\r\n p[i] = k\r\n\r\n\r\ndef count_s(n,m,a,s,mark):\r\n for i in range(n):\r\n tmp = input()\r\n tmp.rstrip()\r\n for j in range(len(tmp)):\r\n a[i].append(tmp[j])\r\n for i in range(m):\r\n b = [ [0] for i in range(n) ]\r\n d = [ [0] for i in range(n) ]\r\n for r in range(n):\r\n tmp = ''\r\n for j in range(i+1):\r\n if (mark[j] == False):\r\n tmp = tmp + a[r][j]\r\n b[r] = tmp\r\n d[r] = tmp\r\n b.sort()\r\n if (b != d):\r\n mark[i] = True\r\n s = s + 1\r\n return s\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\ns = 0\r\na = [ [] for i in range(n) ] \r\nmark = [0] * (m)\r\nprint(count_s(n,m,a,s,mark))", "#!/usr/bin/env python\n#def input(f=open('in3')): return f.readline().rstrip()\n\nn, m = map(int, input().split())\ntxt = [ input() for _ in range(n) ]\nsol = 0\n\npof = list(range(n-1))\nfor i in range(m):\n\n cli = [ rw[i] for rw in txt ]\n of = [x for (x,y) in zip(pof, [i+1 for i in pof])\n if cli[x] > cli[y]]\n if (len(of) > 0):\n sol += 1\n continue\n\n nf = [x for (x,y) in zip(pof, [i+1 for i in pof])\n if cli[x] < cli[y]]\n pof = [t for t in pof\n if t not in nf]\n\nprint(sol)\n", "read = lambda: map(int, input().split())\r\nn, m = read()\r\na = [input() for i in range(n)]\r\nans = 0\r\nind = [i for i in range(1, n)]\r\nfor i in range(m):\r\n ind2 = []\r\n for j in ind:\r\n if a[j][i] < a[j - 1][i]:\r\n ans += 1\r\n break\r\n elif a[j][i] == a[j - 1][i]:\r\n ind2.append(j)\r\n else:\r\n ind = ind2[:]\r\nprint(ans)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN, M = map(int, input().split())\r\nS = []\r\nfor _ in range(N):\r\n S.append(input())\r\n \r\ndef check(A,col):\r\n for i in range(1,N):\r\n if A[i]<A[i-1]:\r\n return False\r\n if A[i]==A[i-1] and S[i][col]<S[i-1][col]:\r\n return False\r\n return True\r\n\r\ncnt = 0\r\nA =[[] for _ in range(N)]\r\nfor i in range(M):\r\n if check(A,i):\r\n for j in range(N):\r\n A[j].append(S[j][i])\r\n else:\r\n cnt+=1\r\n \r\nprint(cnt)\r\n\r\n", "n, m = map(int,input().split())\r\ntable = [input() for i in range(n)]\r\nans = 0\r\nar = [1] * n\r\nfor i in range(m):\r\n ar2 = [ar[i] for i in range(n)]\r\n flag = 1\r\n for j in range(1,n):\r\n if ar[j]:\r\n if table[j][i] > table[j - 1][i]:\r\n ar2[j] = 0\r\n elif table[j][i] < table[j - 1][i]:\r\n ans += 1\r\n flag = 0\r\n break\r\n if flag:\r\n ar = [ar2[i] for i in range(n)]\r\nprint(ans)\r\n", "import sys, threading, os, io \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\nfrom bisect import bisect_left as lower_bound\r\nfrom bisect import bisect_right as upper_bound\r\nfrom io import BytesIO, IOBase\t\t\t\t\t\t\t\t\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\ninput = lambda: sys.stdin.readline().rstrip()\r\ndef lmii():\r\n return list(map(int,input().split()))\r\n\r\ndef ii():\r\n return int(input())\r\n\r\ndef si():\r\n return str(input())\r\ndef lmsi():\r\n return list(map(str,input().split()))\r\ndef mii():\r\n return map(int,input().split())\r\n\r\ndef msi():\r\n return map(str,input().split())\r\n\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\n \r\n \r\n\r\n \r\ndef solve():\r\n n,m=mii()\r\n words=[]\r\n op=0\r\n for i in range(n):\r\n words+=[si()]\r\n\r\n final=[\"\"]*n\r\n\r\n for j in range(m):\r\n flag=1\r\n for i in range(n-1):\r\n x=final[i]+words[i][j]\r\n y=final[i+1]+words[i+1][j]\r\n\r\n\r\n if x>y:\r\n op+=1\r\n flag=0\r\n break\r\n if flag:\r\n for i in range(n):\r\n final[i]+=words[i][j]\r\n return(op)\r\n\r\n\r\n\r\n \r\n \r\ndef main():\r\n # t = 1\r\n # if path.exists(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\"):\r\n # sys.stdin = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\", 'r')\r\n # sys.stdout = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/output.txt\", 'w')\r\n # start_time = time.time()\r\n # print(\"--- %s seconds ---\" % (time.time() - start_time))\r\n \r\n \r\n sys.setrecursionlimit(10**5)\r\n \r\n print(solve())\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n \r\n \r\n\r\n\r\n", "n,m=map(int,input().split())\r\nans=0\r\nst=[input() for i in range(n)]\r\nnew=['']*n\r\nfor i in range(m):\r\n\tnewstr=[new[j]+st[j][i] for j in range(n)]\r\n\tif(newstr==sorted(newstr)):\r\n\t\tnew=newstr\r\n\telse:\r\n\t\tans+=1\r\nprint(ans)", "n, m = map(int, input().split())\r\nt = [input() for i in range(n)]\r\np = [''] * n\r\ns = r = 0\r\nfor k in range(m):\r\n b = p[0] + t[0][k]\r\n for j in range(1, n):\r\n a, b = b, p[j] + t[j][k]\r\n if a > b:\r\n s += 1\r\n break\r\n if r < s: r = s\r\n else:\r\n for j in range(n): p[j] += t[j][k]\r\nprint(s)", "from sys import stdin, stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int, input().split()))\r\ndef prev(rr,p):\r\n for col in range(p-1,-1,-1):\r\n if col in rem:continue\r\n if s[rr][col]>s[rr-1][col]:return True\r\n return False\r\n\r\nfor i in range(1):#nmbr():\r\n r,c=lst()\r\n rem=set()\r\n s=[input() for _ in range(r)]\r\n first_valid_col=-1\r\n for col in range(c):\r\n f=1\r\n for i in range(1,r):\r\n if s[i][col]<s[i-1][col]:\r\n rem.add(col)\r\n f=0\r\n break\r\n if f:\r\n first_valid_col=col\r\n break\r\n if first_valid_col==-1:\r\n print(c)\r\n continue\r\n for col in range(first_valid_col+1,c):\r\n for i in range(1,r):\r\n if prev(i,col)==False and s[i][col]<s[i-1][col]:\r\n rem.add(col)\r\n break\r\n print(len(rem))\r\n", "line = input().split()\r\nn = int(line[0])\r\nm = int(line[1])\r\n\r\nlst = [input()]\r\nsml = []\r\nfor i in range(n - 1):\r\n lst.append(input())\r\n sml.append(False)\r\n\r\nans = 0\r\nfor i in range(m):\r\n flag = True\r\n for j in range(n - 1):\r\n flag = flag and ((lst[j][i] <= lst[j + 1][i]) or sml[j])\r\n if flag:\r\n for j in range(n - 1):\r\n if lst[j][i] < lst[j + 1][i]:\r\n sml[j] = True\r\n else:\r\n ans += 1\r\n\r\nprint(str(ans))\r\n", "n,m=map(int, input().split(' ') )\r\nmasstr=[]\r\ngood = [[] for i in range(n)]\r\nfor i in range(n):\r\n mas = list(str(input()))\r\n masstr.append(mas)\r\nfor nomer_stolb in range(m):\r\n # tmp = [stroka + [masstr[i][nomer_stolb]] for i, stroka in enumerate(good)]\r\n tmp = []\r\n for i, stroka in enumerate(good):\r\n tmp.append(stroka + [masstr[i][nomer_stolb]])\r\n if sorted(tmp)==tmp:\r\n good = tmp\r\nprint (m-len(good[0]))", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nans=0\r\ns=[None]*n\r\nfor i in range(n):\r\n\ts[i]=\"\"\r\nfor j in range(m):\r\n curr=l[0][j]\r\n okay=True\r\n for i in range(n):\r\n \ts[i]+=l[i][j]\r\n if(sorted(s)==s):\r\n \tcontinue\r\n ans+=1\r\n for i in range(n):\r\n \ts[i]=s[i][:len(s[i])-1]\r\nprint(ans)", "n, m = map(int, input().split())\nt = [input() for i in range(n)]\nlt = [False] * (n - 1)\n\ndef tc(j):\n global lt\n lt2 = list(lt)\n for i in range(n - 1):\n if not lt2[i]:\n if t[i][j] < t[i + 1][j]:\n lt2[i] = True\n elif t[i][j] > t[i + 1][j]:\n return True\n lt = lt2\n return False\n\nprint(sum(1 for j in range(m) if tc(j)))\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(ans):\n sys.stdout.write()\n pass\n\n\ndef orderedVal(grid, curValues, column):\n if column == 0:\n return 0\n for i in range(len(grid)):\n if grid[i][curValues] > grid[i][column]:\n return math.inf\n return 0\n\n\ndef isLex(grid, column):\n for i in range(1, len(grid)):\n if grid[i][column] < grid[i - 1][column]:\n return False\n return True\n\n\ndef getLexPairs(grid, column):\n lPairs = set()\n for i in range(1, len(grid)):\n if grid[i][column] == grid[i - 1][column]:\n lPairs.add((i - 1, i))\n return lPairs\n\n\ndef compare(grid, column, lPairs):\n nextlPairs = set()\n \"\"\"either returns remaining lPairs, True, or False\"\"\"\n for a, b in lPairs:\n # print(\"hi\", a, b)\n # print(grid[a][column], grid[b][column])\n if grid[a][column] > grid[b][column]:\n return False\n elif grid[a][column] == grid[b][column]:\n nextlPairs.add((a, b))\n return nextlPairs\n\n\ndef solve(grid):\n ans = len(grid[0])\n for column in range(len(grid[0])):\n if ans <= column:\n break\n if isLex(grid, column):\n removeCol = 0\n lPairs = getLexPairs(grid, column)\n # print(column, lPairs)\n for nextColumn in range(column + 1, len(grid[0])):\n k = compare(grid, nextColumn, lPairs)\n # print('comp',k)\n if k == False:\n removeCol += 1\n elif len(k) == 0:\n break\n else:\n lPairs = k\n ans = min(ans, column + removeCol)\n\n return ans\n\n\ndef readinput():\n n, m = getInts()\n grid = []\n for _ in range(n):\n grid.append(getString())\n\n print(solve(grid))\n\n\nreadinput()\n", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nb = [True] * m\r\ndef check(i, j):\r\n for k in range(i + 1):\r\n if not b[k]:\r\n continue\r\n if a[j][k] < a[j + 1][k]:\r\n return True\r\n elif a[j][k] > a[j + 1][k]:\r\n return False\r\n return True\r\nans = 0\r\nfor i in range(m):\r\n for j in range(n - 1):\r\n if not check(i, j):\r\n b[i] = False\r\n ans += 1\r\n break\r\nprint(ans)", "import collections\nimport heapq\nfrom operator import le\nimport re\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######################################################################################\ndef solve(n,m):\n if n==1:return 0\n tem=[1]*n\n h=0\n def do_remove(h,l): \n for i in range(n):\n del l[i][h]\n def check(n):\n nonlocal tem,h\n t=[0]*n\n for i in range(1,n):\n \n if tem[i]==1:\n if l[i][h]==l[i-1][h]:t[i]=1\n if l[i][h]<l[i-1][h]:\n do_remove(h,l)\n # if l:\n # # check(n)\n return\n\n tem=t[:]\n h+=1\n while l and 1 in tem and h<len(l[0]):\n \n check(n)\n return (m-len(l[0]))\n \n \n \nn,m=value()\n\nl=[list(instr()) for i in range(n)]\nprint(solve(n,m)) ", "import sys\r\nimport os.path\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\n sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000000\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n \r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n \r\nfrom math import inf, ceil, sqrt, log2, gcd\r\nfrom collections import defaultdict, deque\r\n \r\ndd = lambda x: defaultdict(lambda: x)\r\ndxy = [(1, 0),(-1, 0),(0, 1),(0, -1)]\r\n\r\nn, m = minp()\r\na = list(input() for _ in range(n))\r\nc = [\"\" for _ in range(n)]\r\nfor i in range(m) :\r\n t = list(c[j] + a[j][i] for j in range(n))\r\n if t == sorted(t) : c = t\r\nans = m-len(c[0])\r\nprint(ans)", "n, m = map(int, input().split())\r\nwords, needed, final = [input().strip() for _ in range(n)], 0, [\"\" for _ in range(n)]\r\nfor i in range(m):\r\n extended = [final[j] + words[j][i] for j in range(n)]\r\n if extended == list(sorted(extended)):\r\n final = extended\r\n needed += int(not extended == list(sorted(extended)))\r\nprint(needed)\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 11/08/2023 02:50:47 Hanoi, Vietnam\r\n# **/\r\n\r\n# i miss u\r\n\r\nn, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\n\r\ntaken = [\"\"] * n\r\nans = 0\r\nfor col in range(m):\r\n tmp = [taken[row] + a[row][col] for row in range(n)]\r\n if tmp == sorted(tmp):\r\n taken = tmp\r\n else:\r\n ans += 1\r\n\r\nprint(ans)", "n, m = list(map(int, input().split()))\r\nls = [input() for _ in range(n)]\r\nsorted_inds = [0] * n\r\nans = 0\r\nfor i in range(m):\r\n new_sorted_inds = set()\r\n for j in range(1, n):\r\n if sorted_inds[j] == 0:\r\n if ls[j][i] < ls[j - 1][i]:\r\n ans += 1\r\n break\r\n else:\r\n for j in range(1, n):\r\n if ls[j][i] > ls[j - 1][i]:\r\n sorted_inds[j] = 1\r\nprint(ans)\r\n", "def solve(n,m,ar):\n cnt = 0\n index = 0\n\n if n == 1:\n print(0)\n return\n\n #check lexicographically\n\n flag = 0\n while index < len(ar[0]):\n k = 0\n for i in range(n-1):\n if ar[i][:index+1] <= ar[i+1][:index+1]:\n continue\n else:\n cnt += 1\n flag = 1\n while k != n: #removing every corresponding index\n ar[k] = ar[k][:index] + ar[k][index + 1:]\n k += 1\n break\n if flag == 1:\n flag = 0\n continue\n else:\n index += 1\n\n print(cnt)\n\n\n\n\n\n\n\n\n\n\n\nif __name__ == '__main__':\n n,m = map(int, input().split())\n\n ar = []\n\n for _ in range(n):\n ar.append(list(input()))\n\n solve(n,m,ar)\n\n", "\n\n### NOT FINISHED\n# I really need to make it go from line to line:\n# first, the first 2 lines should be corrected\n# then, the third, and so on.\n\ndef issorted(l):\n return all(l[i] <= l[i+1] for i in range(len(l)-1))\n\ndef mainX(n,m,t):\n ans = 0\n while not issorted(t):\n remove = -1\n for i in range(len(t) - 1):\n if t[i] > t[i+1]:\n for j in range(len(t[i])):\n if t[i][j] != t[i+1][j]:\n remove = j\n break\n if remove != -1:\n print(i,remove)\n break\n t = [_t[:remove] + _t[remove+1:] for _t in t]\n ans += 1\n print(ans)\n\ndef is_good(s):\n return all(s[i] <= s[i+1] for i in range(len(s)-1))\ndef line_is_good(a,j):\n return all(a[i][j] <= a[i+1][j] for i in range(len(a)-1))\ndef main5(n,m,a):\n if n <= 1 or m<=0 or is_good(a):\n print(0)\n return\n bad = []\n for i in range(0,m):\n if line_is_good(a,i):\n continue\n #if bad == []: bad.append(i)\n s = [\"\".join([k for b,k in enumerate(x) if b not in bad]) for x in a]\n print(i,bad)\n if is_good(s):\n print(len(bad))\n return\n else:\n bad.append(i)\n print(m)\ndef main6(n,m,a):\n if n <= 1 or m<=0 or is_good(a):\n print(0)\n return\n bad = []\n good = range(m)\n ans = 0\n while not is_good(a):\n remove = -1\n\n return\n for i in range(0,m):\n if line_is_good(a,i):\n continue\n bad.append(i)\n #print(i)\n s = [\"\".join([k for b,k in enumerate(x) if b not in bad]) for x in a]\n if is_good(s):\n print(len(bad))\n return\n print(m)\n\ndef main(n,m,a):\n if n <= 1 or m<=0 or is_good(a):\n print(0)\n return\n bad = []\n ans = 0\n while not is_good(a):\n remove = -1\n for i in range(n-1):\n if a[i] > a[i+1]:\n for j in range(len(a[i])):\n if a[i][j] > a[i+1][j]:\n remove = j\n break\n if remove != -1:\n break\n a = [x[:remove] + x[remove+1:] for x in a]\n ans += 1\n print(ans)\n\ndef main_input():\n n,m = [int(i) for i in input().split()]\n a = [input() for s in range(n)]\n main(n,m,a)\n\nif __name__ == \"__main__\":\n main_input()\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 Removing_Columns():\r\n n,m = invr()\r\n words = []\r\n\r\n for i in range(n):\r\n word = insr()\r\n words.append(word)\r\n\r\n columns_intact = []\r\n for col_index in range(m):\r\n\r\n lexigraphically_oredered = True \r\n prev_word = -1 \r\n for word in words:\r\n new_word = ''.join(word[x] for x in columns_intact)\r\n new_word += word[col_index]\r\n if prev_word == -1:\r\n prev_word = new_word\r\n else:\r\n if prev_word > new_word:\r\n lexigraphically_oredered = False \r\n break \r\n else:\r\n prev_word = new_word\r\n \r\n if lexigraphically_oredered:\r\n columns_intact.append(col_index)\r\n \r\n print(m - len(columns_intact))\r\n return \r\n \r\nRemoving_Columns()", "__author__ = 'trunghieu11 - [email protected]'\r\n\r\n# ---------- My Tools -------------\r\n\r\n# ------ Input output tools -------\r\ndef read_int(): return int(input())\r\ndef read_ints(): return map(int, input().split())\r\ndef read_list_int(): return list(map(int, input().split()))\r\ndef read_strings(row_count):\r\n answer = []\r\n for i in range(0, row_count): answer.append(input())\r\n return answer\r\n\r\n\r\n# ---------- Actual Code ----------\r\n\r\nrow_count, column_count = read_ints()\r\ntable = read_strings(row_count)\r\n\r\nsave = set()\r\nanswer = 0\r\n\r\nfor j in range(0, column_count):\r\n isOk = True\r\n for i in range(1, row_count):\r\n if table[i][j] < table[i - 1][j] and ((i - 1) << 15 | i) not in save:\r\n isOk = False\r\n answer += 1\r\n break\r\n if isOk:\r\n for i in range(1, row_count):\r\n if table[i][j] > table[i - 1][j]:\r\n save.add(((i - 1) << 15 | i))\r\n\r\nprint(answer)", "from math import *\r\nfrom collections import *\r\nfrom random import *\r\nfrom bisect import *\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\ndef inp():\r\n return int(input())\r\ndef fk(a,s,k):\r\n b=[]\r\n for i in range(len(a)):\r\n b.append(a[i]+(i+1)*k)\r\n b.sort()\r\n return sum(b[:k])\r\nn,m=ma()\r\nre=0\r\nr=[]\r\nco=['']*n\r\nfor i in range(n):\r\n s=input().rstrip('\\n')\r\n r.append(s)\r\nfor i in range(m):\r\n t=[co[j]+r[j][i] for j in range(n)]\r\n if(t==sorted(t)):\r\n co=t\r\n else:\r\n re+=1\r\nprint(re)\r\n \r\n \r\n\r\n \r\n \r\n \r\n", "def remove(p, a):\n\tfor i in range(len(a)):\n\t\ta[i] = a[i][: p] + a[i][p + 1: ]\n\nn, m = [int(x) for x in input().split()]\na = []\nfor i in range(n):\n\ta.append(input())\nremoved = 0\nfor i in range(m):\n\ti -= removed\n\tfor j in range(n - 1):\n\t\tif a[j][: i + 1] > a[j + 1][: i + 1]:\n\t\t\tremove(i, a)\n\t\t\tremoved += 1\n\t\t\tbreak\nprint(removed)\n\n\n\n\n# Made By Mostafa_Khaled", "import sys\nfrom math import *\nfrom collections import Counter,defaultdict,deque\ninput=sys.stdin.readline\nmod=10**9+7\ndef get_ints():return map(int,input().split())\ndef get_int():return int(input())\ndef get_array():return list(map(int,input().split()))\ndef input():return sys.stdin.readline().strip()\n\n# for _ in range(int(input())):\nn,m=get_ints()\ns=[]\nfor i in range(n):\n s.append(input())\ncount=0\ntemp=[]\nfinal=[\"\"]*n\nfor i in range(m):\n for j in range(n-1):\n # print(final[j]+s[j][i],final[j]+s[j+1][i])\n if final[j]+s[j][i]>final[j+1]+s[j+1][i]:\n count+=1\n temp=[]\n break\n temp.append(s[j][i])\n else:\n for j in range(n):\n final[j]+=s[j][i]\n # print(final)\nprint(count)", "n,m = map(int, input().split())\nwords = []\nfor i in range(n):\n words.append(input())\n\nnums = [0] * n\n\ncount = 0\nfor j in range(m):\n good = True\n for i in range(n - 1):\n if (nums[i+1], words[i+1][j]) < (nums[i], words[i][j]):\n good = False\n\n if good:\n for i in range(n):\n nums[i] *= 30\n nums[i] += ord(words[i][j]) - ord('a')\n else:\n count += 1\n\nprint(count)\n", "import sys\r\nfrom collections import deque\r\nimport math\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\n\r\nn,m = il()\r\nans = 0\r\na = []\r\n\r\nfor _ in range(n) :\r\n a.append(ip())\r\n\r\nb = ['' for _ in range (n)]\r\n\r\nfor i in range (m) :\r\n c = []\r\n for j in range(n) :\r\n c.append(b[j]+a[j][i])\r\n\r\n\r\n if (c == sorted(c)) :\r\n if len(c) == len(set(c)) :\r\n break\r\n else :\r\n b = c\r\n else :\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\nans = 0\ns = ['']*n\nls = [input() for i in range(n)]\nfor j in range(m):\n chk=0\n for i in range(n-1):\n if(s[i]+ls[i][j] > s[i+1]+ls[i+1][j]):\n ans += 1\n break\n chk+=1\n if chk==n-1:\n for k in range(n):\n s[k]+=ls[k][j]\nprint(ans)\n\n\t\t \t\t\t \t \t \t\t \t\t \t\t \t\t", "import sys\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\ns=[]\r\nfor x in range(n):\r\n s.append(input().strip()) \r\nf=['']*n\r\nans=0\r\n\r\nfor x in range(m):\r\n t = [f[i]+s[i][x] for i in range(n)]\r\n if t == sorted(t):\r\n f = t\r\n else :\r\n ans += 1\r\nprint(ans)", "n,m=input().strip().split(\" \")\r\nn,m=[int(n),int(m)]\r\n\r\np=[]\r\nfor i in range(n):\r\n s=input()\r\n p.append(s)\r\n\r\nif len(p)==1:\r\n ans=0\r\n \r\nelse:\r\n ss=[\"\" for _ in range(n)]\r\n for j in range(m):\r\n qq=[]\r\n for k in ss:\r\n qq.append(k)\r\n for k in range(n):\r\n ss[k]+=p[k][j]\r\n for k in range(1,n):\r\n if ss[k]<ss[k-1]:\r\n ss=qq\r\n break\r\n #print(ss)\r\n p=len(ss[0])\r\n ans=m-p\r\n \r\n \r\nprint(ans)\r\n \r\n \r\n \r\n \r\n ", "import sys,heapq,math\r\nfrom collections import defaultdict,deque\r\ninput=sys.stdin.readline\r\n\r\n\r\n\r\n\r\n \r\nr,c=map(int,input().split())\r\ngrid=[]\r\nfor i in range(r):\r\n grid.append(input().strip())\r\nequal=[0 for _ in range(c)]\r\nless=[0 for _ in range(c)]\r\nfor i in range(c):\r\n for row in range(1,r):\r\n if(grid[row-1][i]==grid[row][i]):\r\n equal[i]=1\r\n elif(grid[row-1][i]>grid[row][i]):\r\n equal[i]=0\r\n break\r\n less[i]=1\r\n for row in range(1,r):\r\n if(equal[i]==1):\r\n less[i]=0\r\n break\r\n elif(grid[row-1][i]>grid[row][i]):\r\n less[i]=0\r\n break\r\nans=0\r\nfor i in range(c):\r\n if(less[i]==1):\r\n ans=max(ans,c-i)\r\n break\r\n elif(equal[i]==1):\r\n cnt=1\r\n l=[]\r\n for row in range(1,r):\r\n if(grid[row-1][i]==grid[row][i]):\r\n start=row-1\r\n while(row<r and grid[row-1]==grid[row][i]):\r\n row+=1\r\n end=row\r\n l.append([start,end])\r\n \r\n for col in range(i+1,c):\r\n f=0\r\n ptr=0\r\n while(ptr<len(l)):\r\n start,end=l[ptr]\r\n ptr+=1\r\n for row in range(start+1,end+1):\r\n if(grid[row-1][col]>grid[row][col]):\r\n f=1\r\n break\r\n if(f==1):\r\n break\r\n if(f==0):\r\n cnt+=1\r\n ptr=0\r\n nl=[]\r\n while(ptr<len(l)):\r\n start,end=l[ptr]\r\n ptr+=1\r\n for row in range(start+1,end+1):\r\n if(grid[row-1][col]==grid[row][col]):\r\n s1=row-1\r\n while(row<end+1 and grid[row-1]==grid[row][col]):\r\n row+=1\r\n e1=row\r\n nl.append([s1,e1])\r\n l=nl\r\n ans=max(ans,cnt)\r\n\r\n \r\n \r\nprint(c-ans)" ]

[ "k,a,b = map(int,input().split())\r\nA = []\r\nB = []\r\ncheck = {}\r\nfor i in range(3):\r\n A.append(list(map(int,input().split())))\r\nfor i in range(3):\r\n B.append(list(map(int, input().split())))\r\ncountA = 0\r\ncountB = 0\r\nbeen = True\r\ni = 0\r\nwhile(i<k):\r\n if (a, b) in check and been:\r\n been =False\r\n razn = i - check[(a, b)][0]\r\n checkA = 0\r\n checkB = 0\r\n for i in range(razn):\r\n if (a == 3 and b == 2) or (a == 2 and b == 1) or (a == 1 and b == 3):\r\n checkA += 1\r\n if (b == 3 and a == 2) or (b == 2 and a == 1) or (b == 1 and a == 3):\r\n checkB += 1\r\n previous_a = a\r\n previous_b = b\r\n a = A[previous_a - 1][previous_b - 1]\r\n b = B[previous_a - 1][previous_b - 1]\r\n countA+=(checkA)*(((k-check[(a, b)][0])//razn)-1)\r\n countB += (checkB) * (((k - check[(a, b)][0]) // razn)-1)\r\n if (k - check[(a, b)][0]) % razn == 0:\r\n break\r\n else:\r\n i = k - (k - check[(a, b)][0]) % razn\r\n\r\n if (a == 3 and b == 2) or (a==2 and b == 1) or (a==1 and b==3):\r\n countA+=1\r\n if (b == 3 and a == 2) or (b == 2 and a == 1) or (b == 1 and a == 3):\r\n countB += 1\r\n previous_a = a\r\n previous_b = b\r\n if (a, b) not in check:\r\n check[(a,b)] = [0,0,0]\r\n check[(a,b)][0] = i\r\n check[(a, b)][1] = countA\r\n check[(a, b)][2] = countB\r\n a = A[previous_a-1][previous_b-1]\r\n b = B[previous_a-1][previous_b-1]\r\n i+=1\r\nprint(countA,countB)", "def update_point(a_point,b_point,winner):\r\n\tif winner=='a':\r\n\t\ta_point+=1\r\n\telif winner=='b':\r\n\t\tb_point+=1\r\n\treturn a_point,b_point\r\n\r\nk,a,b=map(int,input().split())\r\nA=[None]*3\r\nfor i in range(3):\r\n\tA[i]=list(map(int,input().split()))\r\nB=[None]*3\r\nfor i in range(3):\r\n\tB[i]=list(map(int,input().split()))\r\n\r\nwinner_rules=[None]*3\r\nfor i in range(3):\r\n\twinner_rules[i]=['=']*3\r\nwinner_rules[2][1]=winner_rules[1][0]=winner_rules[0][2]='a'\r\nwinner_rules[1][2]=winner_rules[0][1]=winner_rules[2][0]='b'\r\na_point=b_point=first_a_point=first_b_point=0\r\nwinner=winner_rules[a-1][b-1]\r\nfirst_a_point,first_b_point=update_point(first_a_point,first_b_point,winner)\r\nresults=[]\r\nis_found_loop=False\r\npos_found=-1\r\nfor i in range(k-1):\r\n\ta_new=A[a-1][b-1]\r\n\tb_new=B[a-1][b-1]\r\n\ta=a_new\r\n\tb=b_new\r\n\twinner=winner_rules[a-1][b-1]\r\n\ta_point,b_point=update_point(a_point,b_point,winner)\r\n\tresult=str(a)+str(b)+winner\r\n\tif result in results:\r\n\t\tpos_found=results.index(result)\r\n\t\tis_found_loop=True\r\n\t\tbreak\r\n\tresults.append(result)\r\nif is_found_loop:\r\n\ta_point=b_point=0\r\n\tfor i in range(pos_found):\r\n\t\twinner=results[i][-1]\r\n\t\ta_point,b_point=update_point(a_point,b_point,winner)\r\n\tresults=results[pos_found:]\r\n\tlen_results=len(results)\r\n\tremain=k-1-pos_found\r\n\tdiv=(remain)//len_results\r\n\ta_point_loop=b_point_loop=0\r\n\tfor i in range(len_results):\r\n\t\twinner=results[i][-1]\r\n\t\ta_point_loop,b_point_loop=update_point(a_point_loop,b_point_loop,winner)\r\n\ta_point_loop*=div\r\n\tb_point_loop*=div\r\n\tmod=(remain)%len_results\r\n\tfor i in range(mod):\r\n\t\twinner=results[i][-1]\r\n\t\ta_point_loop,b_point_loop=update_point(a_point_loop,b_point_loop,winner)\r\n\ta_point+=a_point_loop\r\n\tb_point+=b_point_loop\r\nprint(a_point+first_a_point,b_point+first_b_point)", "n, a, b = [int(i) for i in input().split()]\r\na -= 1\r\nb -= 1\r\nA=[]\r\nB=[]\r\nfor i in range(3): A.append([int(i)-1 for i in input().split()])\r\nfor i in range(3): B.append([int(i)-1 for i in input().split()])\r\n\r\npa, pb = [0, 0]\r\nseen = [[-1, 0, 0]]*10\r\ni = 0\r\nwhile i < n:\r\n k = a * 3 + b\r\n if seen[k][0] >= 0:\r\n t = i - seen[k][0]\r\n m = (n - 1 - i) // t\r\n pa += m * (pa - seen[k][1])\r\n pb += m * (pb - seen[k][2])\r\n i += t * m\r\n seen[k] = [i, pa, pb]\r\n if (a+1)%3 == b: pb += 1\r\n if (b+1)%3 == a: pa += 1\r\n a, b = A[a][b], B[a][b]\r\n i += 1\r\n\r\nprint(pa, pb)", "#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\nk, x, y = map(int, input().split())\r\nw = [[0, -1, 1],\r\n [1, 0, -1],\r\n [-1, 1, 0]]\r\nx -= 1\r\ny -= 1\r\na = []\r\nb = []\r\nfor i in range(3):\r\n a.append(list(map(lambda x: int(x)-1, input().split())))\r\nfor i in range(3):\r\n b.append(list(map(lambda x: int(x)-1, input().split())))\r\nv = [[None for i in range(3)] for i in range(3)]\r\nalice, bob = 0, 0\r\ncycle = 0\r\nwhile k != 0:\r\n if v[x][y] == None:\r\n if w[x][y] == 1: alice += 1\r\n elif w[x][y] == -1: bob += 1\r\n v[x][y] = (alice, bob, cycle)\r\n k -= 1\r\n cycle += 1\r\n x, y = a[x][y], b[x][y]\r\n else:\r\n cycle = cycle-v[x][y][2]\r\n break\r\nxx, yy = x, y\r\nat, bt = 0, 0\r\nfor i in range(cycle):\r\n if w[xx][yy] == 1: at += 1\r\n elif w[xx][yy] == -1: bt += 1\r\n xx, yy = a[xx][yy], b[xx][yy]\r\nalice += at*(k//cycle)\r\nbob += bt*(k//cycle)\r\nk = k%cycle\r\nwhile k != 0:\r\n if w[x][y] == 1: alice += 1\r\n elif w[x][y] == -1: bob += 1\r\n x, y = a[x][y], b[x][y]\r\n k -= 1\r\nprint(alice, bob)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef f(i, j):\r\n return 3 * i + j\r\n\r\nk, a, b = map(int, input().split())\r\na, b = a - 1, b - 1\r\ns = [list(map(int, input().split())) for _ in range(3)]\r\nt = [list(map(int, input().split())) for _ in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n s[i][j] -= 1\r\n t[i][j] -= 1\r\nx = [2, 1, 0, 0, 2, 1, 1, 0, 2]\r\nnx = []\r\nfor i in range(3):\r\n for j in range(3):\r\n nx.append(f(s[i][j], t[i][j]))\r\ncnt0 = [[0] * 3 for _ in range(9)]\r\nfor i in range(9):\r\n cnt0[i][x[i]] = 1\r\nans = [0] * 3\r\ni = f(a, b)\r\nif k % 2:\r\n for j in range(3):\r\n ans[j] += cnt0[i][j]\r\n k -= 1\r\n i = nx[i]\r\np2 = 1\r\nwhile k:\r\n p2 *= 2\r\n cnt = [[0] * 3 for _ in range(9)]\r\n nx0 = [nx[nx[i]] for i in range(9)]\r\n for l in range(9):\r\n for j in range(3):\r\n cnt[l][j] = cnt0[l][j] + cnt0[nx[l]][j]\r\n if k & p2:\r\n for j in range(3):\r\n ans[j] += cnt[i][j]\r\n k ^= p2\r\n i = nx0[i]\r\n for l in range(9):\r\n for j in range(3):\r\n cnt0[l][j] = cnt[l][j]\r\n nx = list(nx0)\r\nans.pop()\r\nprint(*ans)", "def getscore(ca,cb):\r\n\tif ca==cb:return 0,0\r\n\tif ca==2 and cb==1:return 1,0\r\n\tif ca==1 and cb==0:return 1,0\r\n\tif ca==0 and cb==2:return 1,0\r\n\treturn 0,1\r\nk,a,b=map(int,input().split());a-=1;b-=1\r\nalisa=[[*map(lambda x:int(x)-1,input().split())]for _ in range(3)]\r\nbob=[[*map(lambda x:int(x)-1,input().split())]for _ in range(3)]\r\nvis=[[-1]*3 for _ in range(3)]\r\naliscore=[0]*14\r\nbobscore=[0]*14\r\nfor i in range(k):\r\n\tif vis[a][b]!=-1:\r\n\t\tloop=i-vis[a][b]\r\n\t\tbobloopscore=bobscore[i]-bobscore[vis[a][b]]\r\n\t\talisaloopscore=aliscore[i]-aliscore[vis[a][b]]\r\n\t\tansa=ansb=0\r\n\t\tost=k-vis[a][b]\r\n\t\tansa+=aliscore[vis[a][b]]\r\n\t\tansb+=bobscore[vis[a][b]]\r\n\t\tansa+=alisaloopscore*(ost//loop)\r\n\t\tansb+=bobloopscore*(ost//loop)\r\n\t\tfor _ in range(ost%loop):\r\n\t\t\tsca,scb=getscore(a,b)\r\n\t\t\tansa+=sca\r\n\t\t\tansb+=scb\r\n\t\t\ta,b=alisa[a][b],bob[a][b]\r\n\t\tprint(ansa,ansb)\r\n\t\texit()\r\n\telse:vis[a][b]=i\r\n\tsca,scb=getscore(a,b)\r\n\taliscore[i+1]=aliscore[i]+sca\r\n\tbobscore[i+1]=bobscore[i]+scb\r\n\ta,b=alisa[a][b],bob[a][b]\r\nprint(aliscore[k],bobscore[k])", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[k, a, b] = list(map(int, input().split()))\r\nA = list()\r\nfor i in range(3):\r\n A.append(list(map(int, input().split())))\r\nB = list()\r\nfor i in range(3):\r\n B.append(list(map(int, input().split())))\r\n\r\na -= 1\r\nb -= 1\r\nsa, sb = 0, 0\r\nvis = [[0, 0, 0] for i in range(9)]\r\nx = a+3*b\r\nstep = 1\r\ncycle = False\r\nwhile step <= k:\r\n a, b = x%3, x//3\r\n if a < b:\r\n if a == 0 and b == 2:\r\n sa += 1\r\n else:\r\n sb += 1\r\n elif a > b:\r\n if b == 0 and a == 2:\r\n sb += 1\r\n else:\r\n sa += 1\r\n\r\n if not cycle:\r\n if vis[x][0] == 0:\r\n vis[x] = [step, sa, sb]\r\n else:\r\n len = step-vis[x][0]\r\n cnt = (k-step)//len\r\n step += cnt*len\r\n s_diff = [sa-vis[x][1], sb-vis[x][2]]\r\n [sa, sb] = [sa+cnt*s_diff[0], sb+cnt*s_diff[1]]\r\n cycle = True \r\n\r\n step += 1\r\n a2, b2 = A[a][b], B[a][b]\r\n a2 -= 1\r\n b2 -= 1\r\n x = a2+3*b2\r\n\r\nprint(sa, sb)", "# https://codeforces.com/problemset/problem/863/C \r\nk, a, b = map(int, input().split())\r\nA = [list(map(int, input().split())) for _ in range(3)] \r\nB = [list(map(int, input().split())) for _ in range(3)]\r\nbase = 4\r\nd = {}\r\n\r\ndef score(x, y):\r\n r = (x-y+3) % 3\r\n \r\n if r == 0 or r == 2:\r\n return 0\r\n \r\n if r == 1:\r\n return 1\r\n \r\n \r\nroute_a = [score(a, b)]\r\nroute_b = [score(b, a)]\r\n\r\nd[a+b*4] = len(d)\r\nindex = None\r\n\r\nwhile True:\r\n a_ = A[a-1][b-1]\r\n b_ = B[a-1][b-1]\r\n a = a_\r\n b = b_\r\n cur = a + 4*b\r\n \r\n if cur in d:\r\n index = d[cur]\r\n break\r\n \r\n d[cur] = len(d) \r\n route_a.append(score(a, b))\r\n route_b.append(score(b, a))\r\n\r\n# k = f0 + f*x + r\r\nscore_a = 0\r\nscore_b = 0\r\nN = len(route_a) \r\nf0 = index\r\nf = N - index\r\n\r\nif k <= f0:\r\n score_a = sum(route_a[:k])\r\n score_b = sum(route_b[:k])\r\nelse:\r\n x = (k - f0) // f\r\n r = (k - f0) % f\r\n score_a = sum(route_a[:f0]) + x*sum(route_a[f0:]) + sum(route_a[f0:f0+r])\r\n score_b = sum(route_b[:f0]) + x*sum(route_b[f0:]) + sum(route_b[f0:f0+r])\r\n\r\nprint(score_a, score_b)\r\n \r\n#5 1 1\r\n#1 2 2\r\n#2 2 2\r\n#2 2 2\r\n#1 2 2\r\n#2 2 2\r\n#2 2 2", "f = lambda: list(map(int,input().split()))\r\ng = lambda: [[0] * 4] + [[0] + f() for i in range(3)]\r\nh = lambda x, y: x - 1 == y % 3\r\nt = lambda a, b, u, v: (A[a][b], B[a][b], u + h(a, b), v + h(b, a))\r\nk, a, b = f()\r\np = 2520\r\ns, d = divmod(k, p)\r\nA, B = g(), g()\r\nu = v = x = y = 0\r\nfor j in range(d): a, b, u, v = t(a, b, u, v)\r\nfor i in range(p): a, b, x, y = t(a, b, x, y)\r\nprint(u + x * s, v + y * s)", "def process(k, a, b, A, B):\r\n d1 = {}\r\n points = {}\r\n d = {}\r\n for i in range(3):\r\n for j in range(3):\r\n if i==j:\r\n my_points = [0, 0]\r\n elif (i, j) in [(2, 1), (1, 0), (0, 2)]:\r\n my_points = [1, 0]\r\n else:\r\n my_points = [0, 1]\r\n points[i+3*j] = my_points\r\n x1 = i+3*j\r\n a_choice = A[i][j]-1\r\n b_choice = B[i][j]-1\r\n x2 = a_choice+3*b_choice\r\n d[x1] = x2\r\n final_points = [0, 0]\r\n start = (a-1)+3*(b-1)\r\n cycle = []\r\n cycle2 = [[0, 0]]\r\n while k > 0 and start not in cycle:\r\n cycle.append(start)\r\n a1, b1 = points[start]\r\n final_points[0]+=a1\r\n final_points[1]+=b1\r\n a2, b2 = cycle2[-1]\r\n cycle2.append([a2+a1, b2+b1])\r\n start = d[start]\r\n k-=1\r\n if k==0:\r\n return final_points\r\n else:\r\n i1 = cycle.index(start)\r\n i2 = len(cycle)-1\r\n L = i2-i1+1\r\n a1, b1 = cycle2[i1]\r\n a2, b2 = cycle2[-1]\r\n a3 = a2-a1\r\n b3 = b2-b1\r\n k1, k2 = k//L, k % L\r\n final_points[0]+=k1*a3\r\n final_points[1]+=k1*b3\r\n a4, b4 = cycle2[i1+k2]\r\n final_points[0]+=(a4-a1)\r\n final_points[1]+=(b4-b1)\r\n return final_points\r\n \r\n \r\nk, a, b = [int(x) for x in input().split()]\r\nA = []\r\nfor i in range(3):\r\n row = [int(x) for x in input().split()]\r\n A.append(row)\r\nB = []\r\nfor i in range(3):\r\n row = [int(x) for x in input().split()]\r\n B.append(row)\r\na1, b1 = process(k, a, b, A, B)\r\nprint(f'{a1} {b1}') ", "import sys\r\n\r\nk, a, b = map(int, input().split())\r\nnext_a = [[0]*4] + [[0]+list(map(int, input().split())) for _ in range(3)]\r\nnext_b = [[0]*4] + [[0]+list(map(int, input().split())) for _ in range(3)]\r\n\r\ndp = [[-1]*4 for _ in range(4)]\r\ndp_score = [[[0, 0] for _ in range(4)] for _ in range(4)]\r\n\r\nscore = [0, 0]\r\ni = k\r\n\r\nwhile i:\r\n if i < k and dp[a][b] != -1:\r\n m = i // (dp[a][b] - i)\r\n score[0] += (score[0] - dp_score[a][b][0]) * m\r\n score[1] += (score[1] - dp_score[a][b][1]) * m\r\n i %= dp[a][b] - i\r\n if i:\r\n dp[a][b] = i\r\n dp_score[a][b] = score[:]\r\n\r\n if a == 3 and b == 2 or a == 2 and b == 1 or a == 1 and b == 3:\r\n score[0] += 1\r\n elif b == 3 and a == 2 or b == 2 and a == 1 or b == 1 and a == 3:\r\n score[1] += 1\r\n\r\n a, b = next_a[a][b], next_b[a][b]\r\n i -= 1\r\n\r\nprint(*score)\r\n", "from collections import defaultdict\r\nalice, bob = 0,0\r\n\r\ndef put():\r\n return map(int, input().split())\r\ndef play(a,b):\r\n global alice, bob\r\n if a==b:\r\n pass\r\n elif (a,b) in [(2,1), (1,0), (0,2)]:\r\n alice+=1\r\n else:\r\n bob+=1\r\n\r\nk,a,b = put()\r\nA,B = [list(put()) for i in range(3)], [list(put()) for i in range(3)]\r\na,b,c,d = a-1,b-1,-1,-1\r\nvis = defaultdict()\r\ni,t,found = 1,k,False\r\nwhile t>0:\r\n #print(a,b,i)\r\n play(a,b)\r\n if not found and (a,b,c,d) in vis:\r\n ai, bi, ii = vis[(a,b,c,d)]\r\n size = i-ii \r\n multi = 1 + (k-i)//size \r\n alice = (alice-ai)*multi+ai\r\n bob = (bob-bi)*multi+bi\r\n t = 1 + (k-i)%size\r\n #print('*', size, multi, t)\r\n found = True\r\n vis[(a,b,c,d)]=(alice,bob,i)\r\n a,b,c,d = A[a][b]-1, B[a][b]-1, a,b\r\n t-=1\r\n i+=1\r\n#print(vis)\r\nprint(alice, bob)\r\n", "# cook your dish here\r\nimport sys\r\nimport bisect\r\nfrom bisect import bisect_left as lb\r\nfrom bisect import bisect_right as rb\r\ninput_=lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nfrom math import log\r\nfrom math import gcd\r\nfrom math import atan2,acos\r\nfrom random import randint\r\nsa=lambda :input_()\r\nsb=lambda:int(input_())\r\nsc=lambda:input_().split()\r\nsd=lambda:list(map(int,input_().split()))\r\nsflo=lambda:list(map(float,input_().split()))\r\nse=lambda:float(input_())\r\nsf=lambda:list(input_())\r\nflsh=lambda: sys.stdout.flush()\r\n#sys.setrecursionlimit(3*10**5)\r\nmod=10**9+7\r\nmod1=998244353\r\ngp=[]\r\ncost=[]\r\ndp=[]\r\nmx=[]\r\nans1=[]\r\nans2=[]\r\nspecial=[]\r\nspecnode=[]\r\na=0\r\nkthpar=[]\r\ndef dfs2(root,par):\r\n if par!=-1:\r\n dp[root]=dp[par]+1\r\n for i in range(1,20):\r\n if kthpar[root][i-1]!=-1:\r\n kthpar[root][i]=kthpar[kthpar[root][i-1]][i-1]\r\n for child in gp[root]:\r\n if child==par:continue\r\n kthpar[child][0]=root\r\n dfs(child,root)\r\n \r\nans=0\r\na=[]\r\nn,k=0,0\r\nb=[]\r\nvis=[]\r\ntot=0\r\ntime=[]\r\ntime1=[]\r\nadj=[]\r\nmx=-1\r\neps=0.0000001\r\ndef result(x,y):\r\n if x==y:return 0\r\n if (x==3 and y==2) or (x==1 and y==3) or(x==2 and y==1):\r\n return 1\r\n return -1\r\ndef hnbhai(tc):\r\n k,a,b=sd()\r\n A=[]\r\n for i in range(3):\r\n A.append(sd())\r\n B=[]\r\n for i in range(3):\r\n B.append(sd())\r\n \r\n d={}\r\n score1=0\r\n score2=0\r\n path=0\r\n while(path<k):\r\n if d.get((a,b)) is not None:\r\n #print(a,b)\r\n #print(d.get((a,b)))\r\n break\r\n path+=1\r\n d[(a,b)]=[score1,score2,path]\r\n ok=result(a,b)\r\n if ok==1:score1+=1\r\n if ok==-1:score2+=1\r\n \r\n a,b=A[a-1][b-1],B[a-1][b-1]\r\n if path==k:\r\n print(score1,score2)\r\n return\r\n cyclen=path-d[(a,b)][2]+1\r\n score11=score1-d[(a,b)][0]\r\n score22=score2-d[(a,b)][1]\r\n move=(k-path)//cyclen\r\n score11*=move\r\n score22*=move\r\n path+=move*cyclen\r\n while path<k:\r\n path+=1\r\n ok=result(a,b)\r\n if ok==1:score1+=1\r\n if ok==-1:score2+=1\r\n d[(a,b)]=[score1,score2,path]\r\n a,b=A[a-1][b-1],B[a-1][b-1]\r\n print(score1+score11,score2+score22)\r\n return\r\nfor _ in range(1):\r\n hnbhai(_+1)\r\n#x=1\r\n#x=3//3 1\r\n#x=5//3 1\r\n", "k,a,b = map(int, input().split())\r\nA = []\r\nB = []\r\nsa , sb = 0,0\r\nr = {\r\n (1,1):(0,0),\r\n (1,2):(0,1),\r\n (1,3):(1,0),\r\n (2,1):(1,0),\r\n (2,2):(0,0),\r\n (2,3):(0,1),\r\n (3,1):(0,1),\r\n (3,2):(1,0),\r\n (3,3):(0,0),\r\n}\r\n\r\np = {}\r\n\r\nfor _ in range(3):\r\n A.append(list(map(int, input().split())))\r\nfor _ in range(3):\r\n B.append(list(map(int, input().split())))\r\ni = 0\r\nwhile (i<k):\r\n\r\n if (a,b) in p:\r\n j, psa, psb = p[(a,b)]\r\n l = i-j\r\n psa = sa-psa\r\n psb = sb-psb\r\n rep = (k-i)//l\r\n sa += psa*rep\r\n sb += psb*rep\r\n i+=l*rep\r\n break;\r\n else:\r\n p[(a,b)] = (i,sa,sb)\r\n\r\n t = r[(a,b)]\r\n sa+=t[0]\r\n sb+=t[1]\r\n a,b = A[a-1][b-1], B[a-1][b-1]\r\n i+=1\r\n\r\nwhile (i<k):\r\n\r\n t = r[(a,b)]\r\n sa+=t[0]\r\n sb+=t[1]\r\n a,b = A[a-1][b-1], B[a-1][b-1]\r\n i+=1\r\n\r\nprint (sa,sb)\r\n\r\n\r\n", "k,a,b = map(int, input().split())\r\n\r\nA = []\r\nfor i in range(3):\r\n l = list(map(int, input().split()))\r\n l = [a-1 for a in l]\r\n A.append(l)\r\n\r\nB = []\r\nfor i in range(3):\r\n l = list(map(int, input().split()))\r\n l = [b-1 for b in l]\r\n B.append(l)\r\n\r\na -= 1\r\nb -= 1\r\n\r\ndef calc(x, y):\r\n if x == 2:\r\n if y == 1:\r\n return 1\r\n elif y == 0:\r\n return -1\r\n else:\r\n return 0\r\n elif x == 1:\r\n if y == 0:\r\n return 1\r\n elif y == 2:\r\n return -1\r\n else:\r\n return 0\r\n else:\r\n if y == 2:\r\n return 1\r\n elif y == 1:\r\n return -1\r\n else:\r\n return 0\r\n\r\nX = []\r\nX.append(calc(a, b))\r\nd = {}\r\nd[(a, b)] = 0\r\nx, y = a, b\r\nwhile True:\r\n x, y = A[x][y], B[x][y]\r\n if (x, y) in d:\r\n start = d[(x, y)]\r\n loop = len(X)-start\r\n break\r\n else:\r\n d[(x, y)] = len(X)\r\n X.append(calc(x, y))\r\n\r\nif k <= len(X):\r\n ans0 = 0\r\n ans1 = 0\r\n for i in range(k):\r\n if X[i] == 1:\r\n ans0 += 1\r\n if X[i] == -1:\r\n ans1 += 1\r\nelse:\r\n q, r = divmod(k-start, loop)\r\n cnt0 = 0\r\n cnt1 = 0\r\n for i in range(start, len(X)):\r\n if X[i] == 1:\r\n cnt0 += 1\r\n if X[i] == -1:\r\n cnt1 += 1\r\n ans0 = cnt0*q\r\n ans1 = cnt1*q\r\n for i in range(start, start+r):\r\n if X[i] == 1:\r\n ans0 += 1\r\n if X[i] == -1:\r\n ans1 += 1\r\n for i in range(start):\r\n if X[i] == 1:\r\n ans0 += 1\r\n if X[i] == -1:\r\n ans1 += 1\r\nprint(ans0, ans1)\r\n", "n, a, b = map(int, input().split())\r\na -= 1\r\nb -= 1\r\nA = []\r\nB = []\r\nfor i in range(3):\r\n A.append([int(i) - 1 for i in input().split()])\r\nfor i in range(3):\r\n B.append([int(i) - 1 for i in input().split()])\r\n\r\nna, nb = [0, 0]\r\nseen = [[-1, 0, 0]] * 10\r\ni = 0\r\nwhile i < n:\r\n k = a * 3 + b\r\n if seen[k][0] >= 0:\r\n t = i - seen[k][0]\r\n m = (n - 1 - i) // t\r\n na += m * (na - seen[k][1])\r\n nb += m * (nb - seen[k][2])\r\n i += t * m\r\n seen[k] = [i, na, nb]\r\n if (a + 1) % 3 == b:\r\n nb += 1\r\n if (b + 1) % 3 == a:\r\n na += 1\r\n a, b = A[a][b], B[a][b]\r\n i += 1\r\n\r\nprint(na, nb)\r\n" ]

[ "a = input()\r\nb = input()\r\n\r\nw = [0]\r\nx = [0]\r\nfor i in a:\r\n if i == 'A':\r\n w.append(w[-1]+1)\r\n x.append(x[-1])\r\n else:\r\n w.append(0)\r\n x.append(x[-1]+1)\r\ny = [0]\r\nz = [0]\r\nfor i in b:\r\n if i == 'A':\r\n y.append(y[-1]+1)\r\n z.append(z[-1])\r\n else:\r\n y.append(0)\r\n z.append(z[-1]+1)\r\nans = ''\r\nfor _ in range(int(input())):\r\n a,b,c,d = map(int,input().split())\r\n p = x[b]-x[a-1]\r\n q = z[d]-z[c-1]\r\n if p > q or p % 2 != q % 2:\r\n ans += '0'\r\n else:\r\n m = min(w[b],b-a+1)\r\n n = min(y[d],d-c+1)\r\n if m < n or m % 3 != n % 3 and p == q:\r\n ans += '0'\r\n elif p == 0 and q > 0 and m == n:\r\n ans += '0'\r\n else:\r\n ans += '1'\r\nprint(ans)", "# python3\nimport sys\n\n\ndef read_all_following_lines():\n lines = sys.stdin.readlines()\n return (tuple(map(int, line.split())) for line in lines)\n\n\nclass AbcString(object):\n def __init__(self, string):\n self.prefix_bc = [0]\n self.a_strike = [0]\n\n bc, strike = 0, 0\n for symbol in string:\n if symbol == 'A':\n strike += 1\n else:\n strike = 0\n bc += 1\n self.prefix_bc.append(bc)\n self.a_strike.append(strike)\n\n def get_info(self, begin, end):\n bc = self.prefix_bc[end] - self.prefix_bc[begin]\n trailing_a = min(self.a_strike[end], end - begin)\n return bc, trailing_a\n\n\ndef can_mutate(start, finish):\n from_bc, from_a = start\n to_bc, to_a = finish\n\n if (from_bc & 1) != (to_bc & 1): return False\n if from_bc > to_bc: return False\n if from_a < to_a: return False\n\n if from_bc == to_bc: return (from_a - to_a) % 3 == 0\n if from_a == to_a: return from_bc != 0\n\n # from_bc < to_bc\n # from_a > to_a\n return True\n\n\ndef main():\n s = AbcString(input())\n t = AbcString(input())\n input() # skip one line\n requests = read_all_following_lines()\n\n answer = \"\"\n for (a, b, c, d) in requests:\n can = can_mutate(s.get_info(a - 1, b), t.get_info(c - 1, d))\n answer += \"1\" if can else \"0\"\n\n print(answer)\n\n\nmain()\n" ]

[ "n,m=map(int,input().split())\r\na=[];row=[];col=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nif m>n:\r\n for i in range(n):\r\n row.append(min(a[i]))\r\n for i in range(m):\r\n col.append(a[0][i]-row[0])\r\nelse:\r\n for i in range(m):\r\n r=1000\r\n for j in range(n):\r\n r=min(r,a[j][i])\r\n col.append(r)\r\n for i in range(n):\r\n row.append(a[i][0]-col[0])\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]!=row[i]+col[j]:\r\n exit(print(-1))\r\nprint(sum(row)+sum(col))\r\nfor i in range(n):\r\n for j in range(row[i]):\r\n print('row',i+1)\r\nfor i in range(m):\r\n for j in range(col[i]):\r\n print('col',i+1)", "from collections import defaultdict as dc\r\nn,m=[int(x) for x in input().split()]\r\narr=list()\r\ncheck=dc(lambda:False)\r\ncheck2=dc(lambda:False)\r\nans,ans2=list(),list()\r\nfor _ in range(n):\r\n tmp=list(map(int,input().split()))\r\n arr.append(tmp)\r\npair,pair2=list(),list()\r\nfor i in range(n):\r\n tmp=list()\r\n for j in range(m):tmp.append((arr[i][j],j))\r\n pair.append(tmp)\r\nfor i in range(n):pair[i]=sorted(pair[i],reverse=True)\r\nfor i in range(n):\r\n for j in range(m):\r\n x=pair[i][j][0]-pair[i][-1][0]\r\n if x==0:break\r\n idx=pair[i][j][1]\r\n if check[idx+1]==True:continue\r\n while x:ans.append((\"col\",idx+1)); x-=1; check[idx+1]=True\r\n x=pair[i][-1][0]\r\n if x:\r\n for aa in range(1,m+1):check[aa]=True\r\n while x:ans.append((\"row\",i+1)); x-=1\r\n#print(ans)\r\nFlag1=True\r\ncomp=list()\r\nfor i in range(n):\r\n tmp=list()\r\n for j in range(m):tmp.append(0)\r\n comp.append(tmp)\r\nfor i in ans:\r\n if i[0]=='row':\r\n for j in range(m):comp[i[1]-1][j]+=1\r\n else:\r\n for j in range(n):comp[j][i[1]-1]+=1\r\nif comp!=arr:Flag1=False\r\n########################################\r\nfor i in range(m):\r\n tmp=list()\r\n for j in range(n):tmp.append((arr[j][i],j))\r\n pair2.append(tmp)\r\nfor i in range(m):pair2[i]=sorted(pair2[i],reverse=True)\r\n#print(pair2)\r\nfor j in range(m):\r\n for i in range(n):\r\n x=pair2[j][i][0]-pair2[j][-1][0]\r\n if x==0:break\r\n idx=pair2[j][i][1]\r\n if check2[idx+1]==True:continue\r\n while x:ans2.append((\"row\",idx+1)); x-=1; check2[idx+1]=True\r\n x=pair2[j][-1][0]\r\n if x:\r\n for aa in range(1,m+1):check2[aa]=True\r\n while x:\r\n ans2.append((\"col\",j+1)); x-=1\r\n#print(ans2)\r\nFlag2=True\r\ncomp=list()\r\nfor i in range(n):\r\n tmp=list()\r\n for j in range(m):tmp.append(0)\r\n comp.append(tmp)\r\nfor i in ans2:\r\n if i[0]=='row':\r\n for j in range(m):comp[i[1]-1][j]+=1\r\n else:\r\n for j in range(n):comp[j][i[1]-1]+=1\r\nif comp!=arr:Flag2=False\r\nif Flag1==Flag2 and Flag1==False:print(-1)\r\nelse:\r\n if len(ans)==len(ans2) or len(ans)<len(ans2) or Flag2==False:\r\n print(len(ans))\r\n for i in ans:\r\n print(i[0],i[1])\r\n else:\r\n print(len(ans2))\r\n for i in ans2:\r\n print(i[0],i[1])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom heapq import heappush , heappop\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import *\r\n\r\nN,M = map(int, input().split())\r\nAA = []\r\nfor _ in range(N):\r\n AA.append(list(map(int, input().split())))\r\n\r\n#print(A)\r\ndef deal1(A,N,M):\r\n B = []\r\n for a in A:\r\n B.append(a[::])\r\n A = B\r\n \r\n ans = []\r\n for i in range(N):\r\n t = min(A[i])\r\n for _ in range(t):\r\n ans.append(('row',i+1))\r\n\r\n for j in range(M):\r\n A[i][j]-=t\r\n\r\n for j in range(M):\r\n t = float('inf')\r\n for i in range(N):\r\n t = min(t, A[i][j])\r\n for _ in range(t):\r\n ans.append(('col',j+1))\r\n\r\n for i in range(N):\r\n A[i][j]-=t\r\n\r\n for i in range(N):\r\n for j in range(M):\r\n if A[i][j]!=0:\r\n exit(print(-1))\r\n return ans\r\n\r\ndef deal2(A,N,M):\r\n B = []\r\n for a in A:\r\n B.append(a[::])\r\n A = B\r\n \r\n ans = []\r\n for j in range(M):\r\n t = float('inf')\r\n for i in range(N):\r\n t = min(t, A[i][j])\r\n for _ in range(t):\r\n ans.append(('col',j+1))\r\n\r\n for i in range(N):\r\n A[i][j]-=t\r\n\r\n for i in range(N):\r\n t = min(A[i])\r\n for _ in range(t):\r\n ans.append(('row',i+1))\r\n\r\n for j in range(M):\r\n A[i][j]-=t\r\n\r\n \r\n\r\n for i in range(N):\r\n for j in range(M):\r\n if A[i][j]!=0:\r\n exit(print(-1))\r\n return ans\r\n \r\nans = deal1(AA,N,M)\r\na2 = deal2(AA,N,M)\r\nif len(ans)>len(a2):\r\n ans = a2\r\n\r\nprint(len(ans))\r\nfor a,b in ans:\r\n print(a,b)\r\n ", "\"\"\"Ввод размера матрицы\"\"\"\r\nnm = [int(s) for s in input().split()]\r\n\r\n\"\"\"Ввод массива\"\"\"\r\na = []\r\nfor i in range(nm[0]):\r\n a.append([int(j) for j in input().split()])\r\n\r\nrez=[]\r\n\r\ndef stroka():\r\n global rez\r\n rez_row=[]\r\n rez_r=0\r\n for i in range(nm[0]):\r\n min_row=501\r\n for j in range(nm[1]):\r\n if a[i][j]< min_row:\r\n min_row=a[i][j]\r\n rez_r+=min_row\r\n\r\n if min_row != 0:\r\n for c in range(min_row):\r\n rez.append('row ' + str(i+1))\r\n\r\n for j in range(nm[1]):\r\n if a[i][j]>0:\r\n a[i][j]-= min_row\r\n\r\ndef grafa():\r\n global rez\r\n rez_c=0\r\n for j in range(nm[1]):\r\n min_col=501\r\n for i in range(nm[0]):\r\n if a[i][j]< min_col:\r\n min_col=a[i][j]\r\n rez_c+=min_col\r\n\r\n if min_col !=0:\r\n for c in range(min_col):\r\n rez.append('col '+ str(j+1))\r\n for i in range(nm[0]):\r\n if a[i][j]>0:\r\n a[i][j] -=min_col\r\n\r\n\r\nif nm[0]<nm[1]:\r\n stroka()\r\n grafa()\r\nelse:\r\n grafa()\r\n stroka()\r\n\r\nmaxEl = max(max(a))\r\n\r\nif maxEl == 0:\r\n print(len(rez))\r\n for el in rez:\r\n print(el)\r\nelse:\r\n print(-1)\r\n", "n, m = list(map(int, input().split()))\na = [list(map(int, input().split())) for _ in range(n)]\nr = [a[i][0] - a[0][0] for i in range(n)]\nc = [a[0][i] - a[0][0] for i in range(m)]\nt = min(r)\nr = [x - t for x in r]\nt = min(c)\nc = [x - t for x in c]\np = a[0][0] - r[0] - c[0]\nif n < m:\n r = [x + p for x in r]\nelse:\n c = [x + p for x in c]\nfor i in range(n):\n for j in range(m):\n if r[i] + c[j] != a[i][j]:\n print (-1)\n quit()\nprint (sum(r) + sum(c))\nfor i, x in enumerate(r):\n for j in range(x):\n print (\"row\", i + 1)\nfor i, x in enumerate(c):\n for j in range(x):\n print (\"col\", i + 1)\n", "\r\nn,m = map(int,input().split())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(list(map(int,input().split())))\r\nrow = [505]*n\r\ncol = [505]*m\r\ns = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n row[i] = min(row[i],arr[i][j])\r\n col[j] = min(col[j],arr[i][j])\r\n s+= arr[i][j]\r\nans = []\r\nif n<=m:\r\n for i in range(n):\r\n if row[i]:\r\n mn = row[i]\r\n for kj in range(m):\r\n arr[i][kj] -= mn\r\n col[kj] = min(col[kj], arr[i][kj])\r\n for _ in range(mn):\r\n ans += [\"row \"+str(i+1)]\r\n s -= mn*m\r\n for j in range(m):\r\n if col[j]:\r\n mn = col[j]\r\n for ki in range(n):\r\n arr[ki][j] -= mn\r\n row[ki] = min(row[ki], arr[ki][j])\r\n for _ in range(mn):\r\n ans += [\"col \"+str(j+1)]\r\n s -= mn*n\r\nelse:\r\n for j in range(m):\r\n if col[j]:\r\n mn = col[j]\r\n for ki in range(n):\r\n arr[ki][j] -= mn\r\n row[ki] = min(row[ki], arr[ki][j])\r\n for _ in range(mn):\r\n ans += [\"col \"+str(j+1)]\r\n s -= mn*n\r\n for i in range(n):\r\n if row[i]:\r\n mn = row[i]\r\n for kj in range(m):\r\n arr[i][kj] -= mn\r\n col[kj] = min(col[kj], arr[i][kj])\r\n for _ in range(mn):\r\n ans += [\"row \"+str(i+1)]\r\n s -= mn*m\r\nif s==0:\r\n print(len(ans))\r\n for cs in ans:\r\n print(cs)\r\nelse:\r\n print(-1)", "n, m = [int(i) for i in input().split(' ')]\r\ng = []\r\nc, f = 0, 0\r\nans = ''\r\n\r\n\r\ndef row():\r\n global n, m, g, c, ans\r\n for i in range(n):\r\n t = min(g[i])\r\n c += t\r\n ans += ('row %d\\n' % (i+1))*t\r\n for j in range(m):\r\n g[i][j] -= t\r\n\r\n\r\ndef col():\r\n global n, m, g, c, ans\r\n for i in range(m):\r\n r = [_[i] for _ in g]\r\n t = min(r)\r\n c += t\r\n ans += ('col %d\\n' % (i+1))*t\r\n for j in range(n):\r\n g[j][i] -= t\r\n\r\n\r\nfor i in range(n):\r\n g.append([int(_) for _ in input().split(' ')])\r\n\r\nif m >= n:\r\n row()\r\n col()\r\nelse:\r\n col()\r\n row()\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] > 0:\r\n f = 1\r\n break\r\nif f == 1:\r\n print(-1)\r\nelse:\r\n print(c)\r\n print(ans, end='')\r\n", "n,m=map(int,input().split())\r\nL=[list(map(int,input().split())) for i in range(n)]\r\ns=\"row\"\r\ns1=\"col\"\r\nif n>m :\r\n L1=[[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 L1[j][i]=L[i][j]\r\n L=L1\r\n n,m=m,n\r\n s,s1=s1,s\r\n \r\nw=[0 for i in range(n)]\r\nw1=[0 for i in range(m)]\r\nfor i in range(n) :\r\n w[i]=min(L[i])\r\nfor i in range(m) :\r\n for j in range(n) :\r\n ma=0\r\n ma=max(L[j][i]-w[j],ma)\r\n w1[i]=ma\r\nfor i in range(n) :\r\n for j in range(m) :\r\n if L[i][j]-w[i]-w1[j]!=0 :\r\n print(-1)\r\n exit()\r\notv=[]\r\nfor i in range(n) :\r\n otv+=[s+\" \"+str(i+1)]*w[i]\r\nfor i in range(m) :\r\n otv+=[s1+\" \"+str(i+1)]*w1[i]\r\nprint(len(otv))\r\nprint('\\n'.join(otv))\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\r\ng = list(list(map(int, input().split())) for i in range(n))\r\nx, xi, xj = 500, 0, 0\r\nfor i, gi in enumerate(g):\r\n for j, gij in enumerate(gi):\r\n if gij < x:\r\n x, xi, xj = gij, i, j\r\nr = [g[i][xj] - x for i in range(n)]\r\nc = [g[xi][j] - x for j in range(m)]\r\nfor i, gi in enumerate(g):\r\n for j, gij in enumerate(gi):\r\n if gij != r[i] + c[j] + x:\r\n print(-1)\r\n exit()\r\nprint(min(n, m) * x + sum(r) + sum(c))\r\nfor i in range(n):\r\n for k in range(r[i] + (x if n <= m else 0)):\r\n print('row', i + 1)\r\nfor j in range(m):\r\n for k in range(c[j] + (x if m < n else 0)):\r\n print('col', j + 1)\r\n", "n, m = map(int, input().split())\r\ng = list()\r\nmoves = list()\r\nm1, m2 = 'row', 'col'\r\n\r\nfor _ in range(n):\r\n g.append(list(map(int, input().split())))\r\n\r\nif n > m:\r\n g = list(map(list, zip(*g)))\r\n n, m = m, n\r\n m1, m2 = m2, m1\r\n\r\nfor i in range(n):\r\n while min(g[i]) > 0:\r\n for j in range(m):\r\n g[i][j] -= 1\r\n moves.append('{} {}'.format(m1, i+1))\r\n\r\ng = list(map(list, zip(*g)))\r\nfor i in range(m):\r\n while min(g[i]) > 0:\r\n for j in range(n):\r\n g[i][j] -= 1\r\n moves.append('{} {}'.format(m2, i+1))\r\n\r\nfor c in g:\r\n if any(c):\r\n moves = None\r\n\r\nif moves is None:\r\n print(-1)\r\nelse:\r\n print(len(moves))\r\n print('\\n'.join(moves))", "def func(l,n,m,row,col):\r\n for i in range(n):\r\n mi=min(l[i])\r\n if mi: \r\n l[i]= [x-mi for x in l[i]]\r\n for j in range(mi):\r\n row.append(i)\r\n for j in range(m):\r\n c= [x[j] for x in l]\r\n mi = min(c)\r\n if max(c)-mi>0:\r\n print(\"-1\")\r\n exit()\r\n for i in range(mi):\r\n col.append(j)\r\n\r\nR= lambda: map(int,input().split())\r\nn, m= R()\r\nl,row, col,l2= [], [], [], []\r\nfor _ in range(n):\r\n l.append(list(R()))\r\nif n>m:\r\n for j in range(m):\r\n l2.append([x[j] for x in l])\r\n func(l2,m,n,col,row)\r\nelse: func(l,n,m,row,col)\r\nprint(len(row)+len(col))\r\nfor i in row: print(\"row \",i+1)\r\nfor i in col: print(\"col\", i+1)", "x,y=map(int,input().split())\r\ngrid=[]\r\n\r\nfor i in range(x):\r\n grid.append(list(map(int,input().split())))\r\n\r\nmi=grid[0][0]\r\nprints=[]\r\nfor i in range(x):\r\n mi=min(mi,min(grid[i]))\r\n\r\nif x > y:\r\n for k in range(mi):\r\n for i in range(1,y+1):\r\n prints.append('col '+str(i))\r\nelse:\r\n for k in range(mi):\r\n for i in range(1,x+1):\r\n prints.append('row '+str(i))\r\n\r\nfor i in range(x):\r\n for j in range(y):\r\n grid[i][j]-=mi\r\n\r\nfor i in range(x):\r\n while min(grid[i])>0:\r\n prints.append('row '+str(i+1))\r\n for j in range(y):\r\n grid[i][j]-=1\r\nfor i in range(y):\r\n indy=[]\r\n for ranind in range(x):\r\n indy.append(grid[ranind][i])\r\n mindy=min(indy)\r\n for ran2 in range(mindy):\r\n prints.append('col '+str(i+1))\r\n for j in range(x):\r\n grid[j][i]-=1\r\n\r\nma=grid[0][0]\r\nfor i in range(x):\r\n ma=max(ma,max(grid[i]))\r\n if ma!=0:\r\n print('-1')\r\n quit()\r\n\r\nprint(len(prints))\r\nprint('\\n'.join(prints))\r\n\r\n", "n, m = map(int, input().split())\r\na = [list(map(int, input().split()))for i in range(n)]\r\nrow = 'row'\r\ncol = 'col'\r\nif n > m:\r\n\trow, col = col, row\r\n\tn, m = m, n\r\n\ta = list(map(list, zip(*a)))\r\nz = []\r\nfor i in range(n):\r\n\tx = min(a[i])\r\n\tfor j in range(m):\r\n\t\ta[i][j] -= x\r\n\tz += [(row, i + 1)] * x\r\nfor i in range(1, n):\r\n\tif a[i] != a[i - 1]:\r\n\t\tprint('-1')\r\n\t\texit()\r\nfor j in range(m):\r\n\tz += [(col, j + 1)] * a[0][j]\r\nprint(len(z))\r\nfor i in z:\r\n\tprint(*i)", "import copy\r\nn,m=map(int,input().split())\r\na=[]\r\nans=[]\r\nans1=[]\r\nfor i in range (n):\r\n a.append(list(map(int,input().split())))\r\n\r\nb=copy.deepcopy(a)\r\nfor i in range (n):\r\n mn=min(a[i])\r\n for j in range (m):\r\n a[i][j]-=mn\r\n if(mn>0):\r\n ans.append(['row',i,mn])\r\n\r\nfor i in range (m):\r\n mn=1000\r\n for j in range (n):\r\n if(a[j][i]<mn):\r\n mn=a[j][i]\r\n for j in range (n):\r\n a[j][i]-=mn\r\n if(mn>0):\r\n ans.append(['col',i,mn])\r\n\r\nfor i in range (m):\r\n mn=1000\r\n for j in range (n):\r\n if(b[j][i]<mn):\r\n mn=b[j][i]\r\n for j in range (n):\r\n b[j][i]-=mn\r\n if(mn>0):\r\n ans1.append(['col',i,mn])\r\n\r\nfor i in range (n):\r\n mn=min(b[i])\r\n for j in range (m):\r\n b[i][j]-=mn\r\n if(mn>0):\r\n ans1.append(['row',i,mn])\r\n \r\nif(sum(sum(k) for k in a)!=0):\r\n print(-1)\r\nelse:\r\n count=0\r\n count1=0\r\n for i in ans:\r\n count+=i[2]\r\n for i in ans1:\r\n count1+=i[2]\r\n if(count1>count):\r\n print(count)\r\n for i in ans:\r\n for j in range (i[2]):\r\n print(i[0],i[1]+1,sep=\" \")\r\n else:\r\n print(count1)\r\n for i in ans1:\r\n for j in range (i[2]):\r\n print(i[0],i[1]+1,sep=\" \")\r\n \r\n \r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef do_rows(M, n, m, total_min, answer):\r\n for i in range(n):\r\n x1 = float('inf')\r\n for j in range(m):\r\n x1 = min(x1, M[i][j]-total_min)\r\n if x1 > 0 or total_min > 0:\r\n for j in range(m):\r\n M[i][j]-=(x1+total_min)\r\n if M[i][j] < 0:\r\n return [-1]\r\n for l in range(x1):\r\n answer.append(f'row {i+1}')\r\n return answer\r\n \r\ndef do_cols(M, n, m, total_min, answer):\r\n for j in range(m):\r\n y1 = float('inf')\r\n for i in range(n):\r\n y1 = min(y1, M[i][j]-total_min)\r\n if y1 > 0 or total_min > 0:\r\n for i in range(n):\r\n M[i][j]-=(y1+total_min)\r\n if M[i][j] < 0:\r\n return [-1]\r\n for l in range(y1):\r\n answer.append(f'col {j+1}')\r\n return answer\r\n \r\ndef process(M):\r\n n = len(M)\r\n m = len(M[0])\r\n total_min = float('inf')\r\n answer = []\r\n for i in range(n):\r\n for j in range(m):\r\n total_min = min(total_min, M[i][j])\r\n if n < m:\r\n for I in range(total_min):\r\n for i in range(n):\r\n answer.append(f'row {i+1}')\r\n answer = do_rows(M, n, m, total_min=total_min, answer=answer)\r\n answer = do_cols(M, n, m, total_min=0, answer=answer)\r\n else:\r\n for I in range(total_min):\r\n for j in range(m):\r\n answer.append(f'col {j+1}')\r\n answer = do_cols(M, n, m, total_min=total_min, answer=answer)\r\n answer = do_rows(M, n, m, total_min=0, answer=answer)\r\n \r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if M[i][j] != 0:\r\n return [-1]\r\n return answer\r\n\r\nn, m = [int(x) for x in input().split()]\r\nM = []\r\nfor i in range(n):\r\n row = [int(x) for x in input().split()]\r\n M.append(row)\r\nanswer = process(M)\r\nif answer != [-1]:\r\n sys.stdout.write(str(len(answer))+'\\n')\r\n for x in answer:\r\n sys.stdout.write(str(x)+'\\n')\r\nelse:\r\n sys.stdout.write('-1\\n')", "# cook your dish here\r\nn,m=map(int,input().split())\r\ng=[]\r\nd=[]\r\ndd=[]\r\nfor i in range(n):\r\n g.append(list(map(int,input().split())))\r\n d.append([0]*m)\r\n dd.append([0]*m)\r\nans1,ans2,v,u=[],[],[],[]\r\nfor i in range(n):\r\n mm=10**(9)\r\n for j in range(m):\r\n mm=min(mm,g[i][j])\r\n for j in range(m):\r\n d[i][j]=mm\r\n v.append(mm)\r\n for j in range(mm):\r\n ans1.append(\"row \"+str(i+1))\r\nfor j in range(m):\r\n mm=10**(9)\r\n for i in range(n):\r\n mm=min(mm,g[i][j])\r\n for i in range(n):\r\n dd[i][j]=mm\r\n u.append(mm)\r\n for i in range(mm):\r\n ans2.append(\"col \"+str(j+1))\r\n#print(*v)\r\nfor j in range(m):\r\n mm=10**(9)\r\n for i in range(n):\r\n mm=min(mm,g[i][j]-v[i])\r\n for i in range(n):\r\n d[i][j]+=mm\r\n for i in range(mm):\r\n ans1.append(\"col \"+str(j+1))\r\nfor i in range(n):\r\n mm=10**(9)\r\n for j in range(m):\r\n mm=min(mm,g[i][j]-u[j])\r\n for j in range(m):\r\n dd[i][j]+=mm\r\n for j in range(mm):\r\n ans2.append(\"row \"+str(i+1))\r\nf1,f2=0,0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j]!=d[i][j]:\r\n f1=1\r\n if g[i][j]!=dd[i][j]:\r\n f2=1\r\nif f1 and f2:\r\n print(-1)\r\nelif f1==0 and f2:\r\n print(len(ans1))\r\n for i in range(len(ans1)):\r\n print(ans1[i])\r\nelif f1 and f2==0:\r\n print(len(ans2))\r\n for i in range(len(ans2)):\r\n print(ans2[i])\r\nelse:\r\n if len(ans1)<len(ans2):\r\n print(len(ans1))\r\n for i in range(len(ans1)):\r\n print(ans1[i])\r\n else:\r\n print(len(ans2))\r\n for i in range(len(ans2)):\r\n print(ans2[i])\r\n \r\n", "n, m = map(int, input().split())\r\nmat = [list(map(int, input().strip().split()))\r\n for _ in range(n)]\r\n\r\n\r\ndef clear_row():\r\n rows = []\r\n for i in range(n):\r\n minx = 501\r\n for j in range(m):\r\n minx = min(minx, mat[i][j])\r\n for j in range(m):\r\n mat[i][j] -= minx\r\n for j in range(minx):\r\n rows.append('row {}'.format(i+1))\r\n return rows\r\n\r\n\r\ndef clear_col():\r\n cols = []\r\n for i in range(m):\r\n minx = 501\r\n for j in range(n):\r\n minx = min(minx, mat[j][i])\r\n for j in range(n):\r\n mat[j][i] -= minx\r\n for j in range(minx):\r\n cols.append('col {}'.format(i+1))\r\n return cols\r\n\r\n\r\ndef empty():\r\n s = 0\r\n for i in range(n):\r\n s += sum(mat[i])\r\n return s == 0\r\n \r\nif n < m:\r\n rows = clear_row()\r\n cols = clear_col()\r\nelse:\r\n cols = clear_col()\r\n rows = clear_row()\r\n\r\nif empty():\r\n ans = rows + cols\r\n print(len(ans))\r\n for msg in ans:\r\n print(msg)\r\nelse:\r\n print(-1)\r\n" ]

[ "def x():\n l, r, k = [int(s) for s in input().split()]\n res = k\n if l == 1:\n yield 1\n while k<=r:\n if l <= k <= r:\n yield k\n k*=res\n if k>r:\n break\nd = [i for i in x()]\nif len(d):\n print(*d)\nelse:\n print(-1)\n", "l,r,k=map(int,input().split())\r\nf=0\r\nt=1\r\nwhile (t<=r):\r\n if(t>=l):\r\n f=1\r\n print(t)\r\n t*=k;\r\nif (not(f)):\r\n print(-1)", "l, r, k = map(int, input().split())\r\nres = 1\r\nb = False\r\nwhile res <= r:\r\n if res >= l:\r\n print(res,end=\" \")\r\n b = True\r\n res *= k\r\nif b == False:\r\n print(-1)\r\n", "l, r, k = input().split()\r\nl = int(l)\r\nr = int(r)\r\nk = int(k)\r\nar = []\r\ni = 0\r\nwhile (True):\r\n p = k**i\r\n if p > r:\r\n break\r\n if p >= l and p <= r:\r\n ar.append(p)\r\n i += 1\r\n\r\nflag = True\r\nfor i in ar:\r\n print(i, end = \" \")\r\n flag = False\r\nif(flag):\r\n print(-1)\r\n", "\r\nss = [int(i) for i in input().split(\" \")]\r\n\r\nl = ss[0]\r\nr = ss[1]\r\nk = ss[2]\r\n\r\nans = []\r\n\r\nres = 1\r\nwhile res <= r:\r\n\r\n\tif l <= res <= r:\r\n\t\tans.append(res)\r\n\r\n\tres *= k\r\n\r\nif len(ans) == 0:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(\" \".join([str(i) for i in ans]));", "import sys\r\n\r\nl,r,k = map(int,sys.stdin.readline().split())\r\n\r\ns = 1\r\nfound = False\r\nwhile s<=r:\r\n if s>=l:\r\n print(s,end=' ')\r\n found = True\r\n s = s*k\r\nif found == False:\r\n print(-1)\r\n", "l, r, k = map(int, input().split())\r\nstatus = False\r\nans = \"\"\r\nfor i in range(80) :\r\n\tif k**i >= l and k**i <= r:\r\n\t\tstatus = True\r\n\t\tans = ans + str(k**i) + \" \"\r\nif status == False:\r\n\tans += \"-1\"\r\nprint (ans)", "# #Similar dishes in python\n# t=input()\n# while t!=0:\n# count=0\n# a=raw_input()\n# list=(a.split())\n# b=raw_input()\n# list1=(b.split())\n# for i in range(4):\n# for j in range(4):\n# if(list[i]==list1[j]):\n# count+=1\n# break\n# if(count>=2):\n# print\"similar\"\n# else:\n# print\"dissimilar\"\n# t=t-1\n\nl,r,k=map(int,input().split())\nans=0\nx=1\nwhile(x<l):\n x = x*k\nlst = []\nwhile(x<=r):\n lst.append(x)\n x = x*k\n ans = ans + 1\nif(ans==0):\n print('-1')\nelse:\n print(*lst)", "def main():\r\n\tl, r, k = map(int, input().split())\r\n\tans = []\r\n\tx = 1\r\n\twhile x <= r:\r\n\t\tif x >= l:\r\n\t\t\tans.append(x)\r\n\t\tx *= k\r\n\tif ans:\r\n\t\tprint(' '.join(map(str, ans)))\r\n\telse:\r\n\t\tprint(-1)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "from math import ceil, floor, sqrt, log\n\t\ndef mod_expo(n, p, m):\n\t\"\"\"find (n^p)%m\"\"\"\n\tresult = 1\n\twhile p != 0:\n\t\tif p%2 == 1:\n\t\t\tresult = (result * n)%m\n\t\tp //= 2\n\t\tn = (n * n)%m\n\treturn result\n\t\ndef dec_pow(a, n):\n\tres = 1\n\twhile n > 0:\n\t\tif n%2 == 1:\n\t\t\tres *= a\n\t\ta *= a\n\t\tn //= 2\n\treturn res \n\t\ndef find_k_powers(l, r, k):\n\tm = 1\n\tres = []\n\twhile m <= pow(10, 18):\n\t\tif m >= l and m <= r:\n\t\t\tres.append(m)\n\t\tm *= k\n\tif len(res) == 0:\n\t\tprint(-1)\n\tprint(*res, sep=' ')\n\t \nt = 1 \n#t = int(input())\nwhile t:\n\tt = t - 1\n\t#n = int(input())\n\t#s = input()\n\tl, r, k = map(int, input().split())\n\t#\n\t#m, n = map(int, input().split())\n\t#l = list(map(int, input().strip().split()))[:n]\n\t#str1 = input()\n\t#find_massive_x(n)\n\t#result = find_min(n, l)\n\t#print(get_expect(n, m))\n\t#if alice_wins(n, k):\n\t#\tprint(\"Alice\")\n\t#else:\n\t#\tprint(\"Bob\")\n\tfind_k_powers(l, r, k)\n", "l,r,k = map(int,input().split())\r\ns = 1\r\nc = 0\r\nwhile(s<=r):\r\n if(l<=s and s<=r):\r\n print(s,end = ' ')\r\n c+=1 \r\n s*=k\r\nif(c==0):\r\n print(-1)", "l,r,k = map(int,input().split())\nk1=1\nwhile k1<l:\n k1*=k\ncnt=0\nwhile k1<=r:\n print(k1,end=' ')\n k1*=k\n cnt+=1\nif cnt==0:\n print(-1)\n \t\t\t\t \t\t\t \t \t\t \t \t\t\t\t \t\t\t \t\t\t\t", "(l,r,k)=(int(i) for i in input().split())\nnum=1\ncnt=0\nwhile num<l:\n num*=k\nwhile num<=r:\n print(num,end=' ')\n num*=k\n cnt=1\nif cnt==0:\n print(-1)\n \t \t \t\t\t\t \t\t\t \t \t \t \t\t", "[left, right, k] = [int(x) for x in input().strip().split()]\n\np = 1\nis_a_number = False\nwhile p <= right:\n if p >= left:\n print(p, end=\" \")\n is_a_number = True\n\n p *= k\n\nif not is_a_number:\n print(\"-1\")\n", "l,r,k = map(int, input().split())\r\nq = 1;\r\nmas = []\r\nwhile(q<=r):\r\n if(q>=l): mas.append(q)\r\n q = q*k;\r\nif(len(mas) == 0): print(-1)\r\nelse: print(*mas);\r\n", "l, r, k = [int(x) for x in input().split()]\r\n\r\nval = 1 \r\n\r\nwhile val < l :\r\n val *= k \r\n \r\nif val > r :\r\n print(-1)\r\nelse:\r\n while val <=r :\r\n print(val) \r\n val*=k", "def solve():\r\n l,r,k = map(int,input().split())\r\n i=1\r\n ans=0\r\n while i<=r:\r\n if i>=l:\r\n ans+=1\r\n print(i,end=' ')\r\n i*=k\r\n if ans==0:print(\"-1\")\r\nsolve()", "l, r, k = [int(i) for i in input().split()]\np, s = 0, \"\"\n\nwhile True:\n if k ** p >= l and k ** p <= r:\n s += str(k ** p) + \" \"\n elif k ** p > r:\n break\n p += 1\n\nresp = -1 if s == \"\" else s\nprint(resp)\n\n\n", "l, r, n = tuple(map(int, input().strip().split()))\r\n\r\nans = []\r\n\r\nres = 1\r\n\r\nwhile(res<=r):\r\n if(res>=l and res<=r):\r\n ans.append(res)\r\n res*=n\r\nif(len(ans)):\r\n for i in ans:\r\n print(i, end = \" \")\r\nelse:\r\n print(-1)", "l,r,k = map(int,input().split())\r\ncur = 1\r\nans = []\r\nwhile cur <= r:\r\n if cur >= l and cur <= r:\r\n ans.append(cur)\r\n cur *= k\r\nif len(ans) == 0:\r\n print(-1)\r\nelse :\r\n for val in ans:\r\n print(val)\r\n", "l,r,k = map(int, input().split())\nv = []\nshuru = 1\nwhile shuru<=r:\n if(shuru>=l):\n v.append(shuru)\n shuru=shuru*k\n\nif(len(v)!=0):\n print(*v,sep=\" \")\nelse:\n print(\"-1\")\n\t\t\t \t\t\t\t \t \t\t \t \t \t\t \t", "l, r, k = map(int, input().split())\nprint(*([k**p for p in range(65) if l<=k**p<=r] or [-1]))\n", "a,b,n = input().split()\na = int(a)\nb = int(b)\nn= int(n)\nc = 1\nm = 0\nwhile c<a:\n c*=n\n m = m+1\nflag = 0\nwhile c<=b:\n print(c,end = ' ')\n c = c*n\n flag = 1\nif flag == 0:\n print(\"-1\")\n\t \t\t \t \t \t\t\t\t \t\t \t \t \t \t \t\t", "l,r,k=map(int,input().split())\r\ncnt=int(1)\r\nfl=0\r\nfor i in range(0,64):\r\n if cnt>r:\r\n break\r\n if cnt>=l and cnt<=r:\r\n print(cnt,end=\" \")\r\n fl=1;\r\n cnt=cnt*k\r\nif fl==0:\r\n print(-1)\r\n\r\n", "l,r,k = map(int,input().split())\n\nres = []\n\nx=1\nwhile x<=r:\n if x>=l:\n res.append(x)\n x*=k\n\nif res:\n print(*res)\nelse:\n print(-1)", "l, r, k = map(int, input().split())\r\ncnt = 1\r\ni = 0\r\nwhile cnt <= r:\r\n if l <= cnt and r >= cnt:\r\n print(cnt, end=\" \")\r\n i += 1\r\n cnt *= k\r\nif i == 0:\r\n print(-1)", "l, r, k = map(int, input().split())\n\nmm = 1\n\nwhile mm < l:\n mm *= k\n\nans = 0\n\nwhile mm <= r:\n ans += 1\n print(mm, end=' ')\n mm *= k\n\nif not ans:\n print(-1)\nelse:\n print()", "l,r,k=map(int,input().split())\nsum=1;\nf=0\nwhile 1:\n if sum>=l and sum<=r:\n print(sum,end=' ')\n f=1\n if sum>r:\n break\n sum*=k\nif not f:\n print('-1')", "[l, r, k] = [int(n) for n in input().split(' ')]\r\n\r\nans = []\r\nkn = 1\r\n\r\nwhile kn <= r:\r\n if l <= kn and kn <= r:\r\n ans.append(kn)\r\n kn = kn * k\r\n\r\nif len(ans) == 0:\r\n print(\"-1\");\r\nelse:\r\n print(\" \".join([str(n) for n in ans]));", "import sys\r\nimport math\r\nimport fileinput\r\n\r\n\r\nINPUT = None\r\nif len(sys.argv) > 1:\r\n INPUT = sys.argv[1]\r\n\r\ndef _print(v):\r\n sys.stdout.write(str(v))\r\n sys.stdout.flush()\r\n\r\ndef process(line):\r\n l, r, k = [int(x) for x in line.split()]\r\n i = 0\r\n c = 1\r\n res = \"\"\r\n while( c <= r ) :\r\n if( c >= l ) :\r\n res = res + str(c) + \" \"\r\n c *= k\r\n if len(res) > 0:\r\n print(res)\r\n else:\r\n print(-1)\r\n\r\nf = fileinput.input(files=(INPUT))\r\nfor line in f:\r\n process(line)\r\nf.close()", "l = input(\"\").split(\" \")\nx = 1\nc=0\nwhile x<= int(l[1]):\n\tif x >= int(l[0]):\n\t\tc=c+1\n\t\tprint(x,end = \" \")\n\tx=x*int(l[2])\nif c==0 :\n\tprint(\"-1\")\n", "import sys\n\ndata=sys.stdin.readline().split()\nl,r,k=[int(x) for x in data]\nx=1\nempty=True\nwhile x<=r:\n if x>=l:\n sys.stdout.write(str(x)+' ')\n empty=False\n x*=k\nif empty:\n sys.stdout.write('-1')\nprint()\n", "l, r, k = map(int, input().split())\r\ni = 1\r\nf = False\r\nwhile i <= r:\r\n if i >= l:\r\n print(i, end=\" \")\r\n f = True\r\n i *= k\r\nif not f:\r\n print(-1)", "l,r,k = map(int,input().split())\r\npow,found = 1,False\r\nwhile (pow <= r):\r\n\tif (l <= pow and pow <= r):\r\n\t\tfound = True\r\n\t\tprint (pow,end=\" \")\r\n\tpow *= k\r\nif (not found):\r\n\tprint('-1\\n')\r\nelse:\r\n\tprint('\\n')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nl, r, k = map(int, input().split())\r\nans = []\r\nx = 1\r\nwhile x <= r:\r\n if l <= x:\r\n ans.append(x)\r\n x *= k\r\nif not ans:\r\n ans = [-1]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "l,r,k = map(int,input().split())\ns = 1\nans = []\nwhile True:\n if s > r:\n break\n if s >= l and s <= r :\n ans.append(s)\n s = s * k\nif len(ans) == 0 :\n print(-1)\nelse:\n for i in ans:\n print(i,end=\" \")\n print()\n \t \t\t \t \t\t\t \t \t\t\t \t \t\t\t", "l,r,k = map(int,input().split())\r\nf=0\r\nx=1\r\nwhile x<=l:\r\n if x==l:\r\n break\r\n x = x*k\r\nwhile x<=r:\r\n print(x,end=\" \")\r\n x = x*k\r\n f=1\r\n\r\nif f==0:\r\n print(-1)", "l, r, k = map(int, input().split())\r\ni = 0\r\nlis = []\r\nwhile True:\r\n a = k ** i\r\n if a >= l and a <= r:\r\n lis.append(a)\r\n \r\n elif a > r:\r\n break\r\n i += 1\r\n \r\nif len(lis) == 0:\r\n print(-1)\r\nelse:\r\n print(\" \".join([str(i) for i in lis]))\r\n \r\n ", "x=input()\r\na,b,c=x.split()\r\nl=int(a)\r\nr=int(b)\r\nk=int(c)\r\ncur=0\r\npowi=0\r\nwhile(cur<l):\r\n\tcur=k**powi\r\n\tpowi+=1\r\nc=0\r\nwhile(cur<=r):\r\n\tc+=1\r\n\tprint(cur,end=\" \")\r\n\tcur=k**powi\r\n\tpowi+=1\r\nif(c==0):\r\n\tprint(-1)", "l, r, k = map(int, input().split())\r\nq = 0\r\nc = 1\r\nans = \"\"\r\nwhile c <= r:\r\n if l <= c <= r:\r\n ans += f'{c} '\r\n q += 1\r\n c *= k\r\nif q == 0:\r\n ans = \"-1\"\r\nprint(ans)\r\n", "import sys, threading\r\n\r\nsys.setrecursionlimit(10 ** 6)\r\n\r\nscan = lambda: map(int, input().split())\r\n\r\nl, r, k = scan()\r\npow = 0\r\ncnd = False\r\nwhile k**pow <= r:\r\n if l <= k**pow :\r\n print(k**pow, end=\" \")\r\n cnd = True\r\n pow += 1\r\nif not cnd:\r\n print(-1)\r\nprint(\"\\n\")", "from math import log, floor\nl, r, n=map(int, input().split())\np=floor(log(l, n))\na=[]\ni=n**p\nwhile i<=r:\n\tif l<=i:\n\t\ta.append(i)\n\ti*=n\nif len(a)==0:\n\ta=[-1]\nprint(*a)", "l,r,k = tuple(map(int,input().split()))\r\n\r\n\r\nn=0\r\nwhile(k**n<l):\r\n\tn+=1\r\nb=0\r\nwhile (k**n<=r and k**n>=l):\r\n\tprint(k**n,end=\" \")\r\n\tn+=1\r\n\tb=1\r\n\r\nif(not b):\r\n\tprint(-1)", "l, r, k = map(int, input().split())\r\ntmp = 1\r\nlt = []\r\nwhile tmp <= r:\r\n lt.append(tmp)\r\n tmp *= k\r\n\r\nans = []\r\nfor i in lt:\r\n if i >= l and i <= r:\r\n ans.append(i)\r\n\r\nif len(ans) == 0:\r\n print(-1)\r\nelse:\r\n for i in ans:\r\n print(i, end=' ')", "l, r, k = map(int, input().split())\r\n\r\nx = 0\r\nfound = False\r\nwhile k**x <= r:\r\n\tif k**x>=l:\r\n\t\tfound = True\r\n\t\tprint (k**x, end=' ')\r\n\tx +=1 \r\n\r\nif found == False:\r\n\tprint(-1)", "Ent = [int(i) for i in input().split()]\nnums = list()\npot = 0\ncond = False\nwhile((Ent[-1] ** pot) <= Ent[1]) :\n if (Ent[-1] ** pot) >= Ent[0] :\n cond = True\n nums.append(Ent[-1] ** pot)\n pot += 1\nif cond :\n for i in range(len(nums)) :\n if i != len(nums) - 1 :\n print(nums[i], end = \" \")\n else :\n print(nums[i])\nelse :\n print(-1)", "l, r, k = [int(x) for x in input().split(' ')]\r\nkek = True\r\nx = 1\r\nans = \"\"\r\nwhile True:\r\n if l <= x <= r:\r\n ans += str(x) + \" \"\r\n kek = False\r\n x *= k\r\n if x > r: break\r\n\r\nif kek:\r\n print(-1)\r\nelse:\r\n print(ans)", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Feb 5 14:14:39 2020\n\n@author: CheongRoach\n\"\"\"\n\nl, r, k = map(int, input().split(' '))\ncnt = 0\nk2 = 1\nwhile k2 <= r:\n if k2 >= l:\n print(k2, end=' ')\n cnt += 11\n k2 *= k\n \nif cnt == 0:\n print(-1, end='')\n \nprint('')\n \t \t \t \t\t \t \t \t \t\t \t\t \t\t\t\t", "l,r,n=map(int,input().split())\r\nf=0\r\nfor i in range(100):\r\n p=n**i\r\n if(p>=l and p<=r):\r\n f=1\r\n print(p,end=' ')\r\nif(f==0):\r\n print(-1)\r\n", "l, r, w = map(int, input().split())\n\ndef y(l, r, w):\n if w == 1:\n if l == 1:\n print('1')\n else:\n print('-1')\n return\n\n cnt = 0\n wn = 1\n \n while wn < l:\n wn *= w\n \n while wn >= l and wn <= r:\n print(wn, end = ' ')\n wn *= w\n cnt += 1\n \n if cnt == 0:\n print('-1')\n else:\n print()\n\ny(l, r, w)\n", "import fileinput\r\nline = fileinput.input()[0]\r\nnums = [int(n) for n in line.split()]\r\nl = nums[0]\r\nr = nums[1]\r\nk = nums[2]\r\nt = 1;\r\nres = []\r\nwhile t < l:\r\n t *= k\r\nwhile t <= r:\r\n res.append(t);\r\n t *= k;\r\nif len(res) == 0:\r\n print(\"-1\");\r\nelse:\r\n for i in res:\r\n print(i, end = ' ')", "l, r, k = map(int, input().split())\r\np = 1\r\nwhile p < l:\r\n p = p * k\r\nlis = []\r\nwhile p >= l and p <= r:\r\n lis.append(p)\r\n p = p * k\r\nif not lis:\r\n print(-1)\r\nelse:\r\n for i in lis:\r\n print(i, end = ' ')", "#!/usr/bin/env python3\nimport itertools, functools, math\n\ndef solve():\n l, r, k = map(int, input().split())\n elems = []\n p = 1\n while p <= r:\n if l <= p:\n elems.append(p)\n p *= k\n\n if elems:\n return elems\n return [-1]\n\nif __name__ == '__main__':\n print(*solve())\n\n", "l,r,k = map(int,input().split())\r\nok= 0 \r\nfor i in range(0,70):\r\n if int(pow(k,i))>=l and int(pow(k,i))<=r :\r\n print(int(pow(k,i)),end=\" \")\r\n ok = 1\r\nif ok==0:\r\n print(-1)\r\n", "n,m,k = map(int,input().split())\r\nz = []\r\nx = 1\r\nwhile x< n :\r\n x *= k\r\n\r\nwhile x<= m :\r\n z.append(x)\r\n x *= k\r\n\r\nif z ==[] :\r\n print(-1)\r\nelse :\r\n print(*z)\r\n", "l, r, k = map(int, input().split())\r\nx = 1\r\nprinted = 0\r\nwhile x <= r:\r\n if x >= l: \r\n print(x)\r\n printed = 1\r\n x = x * k\r\nif printed == 0: \r\n print(-1)", "l, r, k = map(int, input().split())\r\nans = 1\r\n\r\nok = False\r\nwhile ans <= r:\r\n if ans >= l:\r\n print(ans, end=\" \")\r\n ok = True\r\n ans *= k\r\nif not ok:\r\n print(-1)\r\n", "import math\r\nl,r,k=map(int,input().split())\r\nn=int(math.log(l,k))\r\nx=k**n\r\np=0\r\nwhile x<=r and x!=-1:\r\n if x>=l:\r\n print(x)\r\n p+=1\r\n if k==1:\r\n x=-1\r\n x*=k\r\nif p==0:\r\n print(-1)", "import sys\r\nfor line in sys.stdin:\r\n l, r, k = line.split(' ')\r\n l = int(l)\r\n r = int(r)\r\n k = int(k)\r\n answer = int(1)\r\n noAnswer = True\r\n while True:\r\n if (answer > r):\r\n break\r\n if (l <= answer and answer <= r):\r\n noAnswer = False\r\n print(answer, end = '')\r\n print(\" \", end = '')\r\n answer = answer * k\r\n \r\n if noAnswer :\r\n \tprint(\"-1\")", "l, r, k = map(int, input().split())\r\nans =0\r\ns=1\r\nwhile s<l:\r\n s*=k\r\nwhile s<=r:\r\n print(s,end=\" \")\r\n s*=k\r\n ans+=1\r\nif not ans:\r\n print(-1)\r\n ", "import math\nl, r, k = input().split()\nl = eval(l)\nk = eval(k)\nr = eval(r)\nflag = 0\nfor i in range(70):\n u = pow(k, i)\n if (u <= r) and (u >= l):\n if flag == 0:\n ans = str(u)\n flag = 1;\n else:\n ans = ans + \" \" + str(u)\n elif u > r:\n break\nif flag == 0:\n print(-1)\nelse:\n print(ans)\n\n \t \t \t \t \t \t\t \t \t\t\t", "import math\r\nl, r, k = [int(x) for x in input().split()]\r\n\r\nno_numbers = True\r\nexp = int(math.log(l, k))\r\nvalue = k ** exp\r\n\r\nwhile True:\r\n \r\n if value >= l and value <= r:\r\n no_numbers = False\r\n print(value, end=\" \", flush=True)\r\n if value > r:\r\n break\r\n \r\n value = value * k\r\n\r\nif no_numbers:\r\n print(-1)\r\n\r\n", "\r\nl,r,k = tuple(map(int,input().split()))\r\ni=0\r\nx =False\r\nwhile True :\r\n\thi = k**i\r\n\tif hi >r :\r\n\t\tbreak\r\n\tif hi in range(l,r+1):\r\n\t\tx = True\r\n\t\tprint(hi,end=' ')\r\n\ti +=1\r\nif not x :\r\n\tprint(-1)", "l,r,k=map(int,input().split(' '))\nf=0\ni=0\nwhile(1):\n if(k**i>=l and k**i<=r):\n f=1\n \n break\n if(k**i>r):\n break\n i+=1\nif f==1:\n while(k**i<=r):\n \n print(k**i,end=' ')\n i+=1\nelse:\n print(\"-1\")\n\t \t \t\t\t \t\t\t \t \t\t\t \t \t", "l , r , k = map( int , input().split() )\r\nc = 1;\r\nfl = 0;\r\nwhile c <= r:\r\n if( c >= l ):\r\n print( c , end = ' ' );\r\n fl = 1\r\n c *= k;\r\nif( fl == 0 ): print( -1 )\r\n", "s=input()\nl=int(s.split()[0])\nr=int(s.split()[1])\nk=int(s.split()[2])\ni=1\ncnt=0\nwhile i<=r:\n if i>=l:\n print(i,end=\" \")\n cnt+=1\n i*=k\nif(cnt==0):\n print(-1)\n\n\t \t\t \t\t\t\t\t\t\t \t\t\t \t \t\t\t", "if __name__ == '__main__':\n l, r, k = map(int, input().split())\n num = 1\n res = ''\n while (num < l):\n num *= k\n\n while (num <= r):\n res += str(num) + ' '\n num *= k\n if res == '':\n res = '-1'\n print(res)\n\n\t \t\t\t\t\t \t \t \t\t \t\t\t \t\t \t \t\t\t", "l,r,k=map(int,input().split())\r\ns=1\r\nb=1\r\nwhile s<=r:\r\n if s>=l and s<=r:\r\n print(s)\r\n b=0\r\n s*=k\r\nif b==1:\r\n print(-1)", "from math import log\r\n\r\nl, r, k = map(int, input().split())\r\n\r\nlower = int(log(l, k))\r\n\r\nwhile (k ** lower < l):\r\n lower += 1\r\n\r\nif (k ** lower > r):\r\n print(-1)\r\n exit()\r\n\r\nprint(k ** lower, end=\"\")\r\nlower += 1\r\nwhile (k ** lower <= r):\r\n print(\" \" + str(k ** lower), end=\"\")\r\n lower += 1\r\nprint()\r\n", "l, r, k = map(int, input().split())\r\n\r\nsol = []\r\nx = 1\r\nwhile x <= r:\r\n if x >= l: sol.append(x)\r\n x *= k\r\n\r\nif len(sol) == 0:\r\n print(-1)\r\nelse:\r\n print(' '.join(list(map(str, sol))))\r\n", "l,r,k = [int(x) for x in input().split()]\nls = []\nfor x in range(10000):\n if k**x > r:\n break\n ls.append(k**x)\nright = []\nfor x in ls:\n if l <= x and x <= r:\n right.append(str(x))\nif len(right) == 0:\n print(-1)\nelse:\n print(\" \".join(right))\n", "l, r, k = map(int, input().split())\r\nu = 1\r\np = False\r\n\r\nwhile u < l:\r\n u *= k\r\nwhile u <= r:\r\n p = True\r\n print(u, end=' ')\r\n u *= k\r\nif not p:\r\n print(-1)\r\n", "__author__ = 'Admin'\r\nl, r, k = map(int, input().split())\r\nans = []\r\ni = 0\r\nfor i in range(10000000):\r\n if l <= k ** i <= r:\r\n ans.append(k ** i)\r\n elif k ** i > r:\r\n break\r\nif len(ans) == 0:\r\n print(-1)\r\nelse:\r\n print(*ans)", "l, r, k = [int(x) for x in input().split()]\n\nok = False\nx = 1\nres = []\nwhile x <= r:\n\tif x >= l:\n\t\tres.append(x)\n\tx *= k\nif not res:\n\tprint(-1)\nelse:\n\tfor i in res:\n\t\tprint(i, end=\" \")\n \t\t \t \t \t \t \t \t\t \t", "l, r, k = [int(x) for x in input().split()]\r\n\r\ni = 0\r\nx = 0\r\n\r\npower = pow(k, i)\r\n\r\nwhile power<l:\r\n i+=1\r\n power = pow(k, i)\r\n\r\nwhile power<=r:\r\n print(power, end=' ')\r\n x+=1\r\n i+=1\r\n power = pow(k, i)\r\n\r\nif x==0:\r\n print(-1)\r\nelse:\r\n print()", "l, r, k = map(int, input().split())\r\nt=k\r\nk=1\r\nc=0\r\nwhile(k<=r):\r\n if(k>=l):\r\n print(k, end=\" \")\r\n c+=1\r\n k=k*t\r\nif(not c):\r\n print(-1)\r\n", "# -*- coding: utf-8 -*-\nl,r,k = map(int,input().split(' '))\nflag = 0\ni =0\nwhile True:\n t = k**i\n if t>=l and t<=r:\n flag = 1\n break\n if t>r :\n break\n i+=1\nif flag:\n while t<=r:\n print(\"{} \".format(t),end = '')\n i+=1\n t = k**i\n \nelse:\n print(\"-1\")\n\t \t\t\t \t \t\t \t\t\t\t \t \t \t\t \t\t", "inicio, fim, num = map(int, input().split(\" \"))\n\npotencias = []\n\nexpoente = 0\npotencia_corrente = 0\n\nwhile potencia_corrente <= fim:\n potencia_corrente = num ** expoente\n if inicio <= potencia_corrente <= fim:\n potencias.append(potencia_corrente)\n expoente += 1 \n \nif not potencias:\n print(-1)\nelse:\n result = \"\"\n for indice, num in enumerate(potencias):\n if indice == 0:\n result += str(num)\n else:\n result += \" \" + str(num)\n print(result)\n \t \t\t \t\t \t\t \t \t \t\t\t\t\t \t\t\t", "if __name__ == '__main__':\r\n l1, r1, k = map(int, input().split())\r\n now = 1\r\n no = True\r\n while now <= r1:\r\n if l1 <= now <= r1:\r\n print(now, end=' ')\r\n no = False\r\n now *= k\r\n if no:\r\n print(-1)", "l,r,k=map(int,input().split())\ns=1\nb=1\nwhile s<=r:\n if s>=l and s<=r:\n print(s)\n b=0\n s*=k\nif b==1:\n print(-1)\n \t\t\t \t\t\t \t \t \t\t\t \t \t\t \t", "R = lambda : map(int, input().split())\nl,r,k = R()\ni = 1\nres = []\nwhile i <= r:\n if i >= l:\n res.append(i)\n i *= k\nif (len(res)>0):\n print(*res)\nelse:\n print(-1)", "l, r, k = [int(i) for i in input().split()]\r\n\r\na = 1\r\nf = 0\r\n\r\nwhile a <= r:\r\n if l <= a <= r:\r\n print(a, end=' ')\r\n f = 1\r\n a *= k\r\n\r\nif f == 0:\r\n print(-1)\r\n", "min, max, num = [int(x) for x in input().split()]\nvdd = 0\n\ni = 0\npot = num**i\n\nwhile pot <= max:\n if min <= pot and pot <= max:\n print(pot, end=\" \")\n vdd = 1\n i = i + 1\n pot = num**i\nif vdd == 0:\n print(-1)\n\t \t\t\t\t\t \t \t\t \t\t \t\t \t \t\t", "entrada = input().split()\nmin = int(entrada[0])\nmax = int(entrada[1])\nnumero = int(entrada[2])\ncont = 0\nprintar = []\nn = numero ** cont\nwhile True:\n if n >= min and n<=max:\n printar.append(n)\n cont += 1\n n = numero ** cont\n elif n > max:\n break\n else:\n cont+=1\n n = numero ** cont\n\nif len(printar)==0:\n print(-1)\nelse:\n for i in range(len(printar)):\n print(printar[i],end=' ')\n\n\t \t\t\t \t\t\t\t\t\t\t\t\t\t \t \t\t \t\t", "values = [*map(int, input().split())]\nl, r, k = values \n\nexpoente = 0\nresults = []\n\nwhile k**expoente <= r:\n temp = k**expoente\n expoente += 1\n if temp >= l:\n results.append(temp)\n\nif results:\n print(' '.join(map(str, results)))\nelse:\n print(-1)", "r = input()\r\nl,r,k = r.split()\r\nl = int(l)\r\nr = int(r)\r\nk = int(k)\r\n\r\nif k==1:\r\n if l==1: print('1')\r\n else : print('-1')\r\nelse:\r\n m = 1\r\n cnt = 0\r\n while m<=r:\r\n if m>=l:\r\n print(m,end=' ')\r\n cnt = cnt+1\r\n m *= k\r\n if cnt == 0:\r\n print(-1)", "def fast(k, x):\r\n if x == 0:\r\n return 1\r\n elif (x % 2 == 1):\r\n return fast(k, x - 1) * k\r\n else:\r\n t = fast(k, x / 2)\r\n return t * t\r\nl, r, k = map(int, input().split())\r\nwas = False\r\nx = 0\r\nans = []\r\nwhile (True):\r\n now = fast(k, x)\r\n if (now <= r):\r\n if (now >= l):\r\n was = True\r\n ans.append(now)\r\n else:\r\n break\r\n x += 1\r\nif (was == False):\r\n print(-1)\r\nelse:\r\n print(*ans)\r\n ", "s,f,n = map(int,input().split())\r\np = 1\r\ncheck = True\r\nfor i in range(100):\r\n if p>=s and p<= f:\r\n print(p)\r\n check = False\r\n p *= n\r\nif check:\r\n print(-1)\r\n", "n = input().split()\r\ncontador = 0\r\nnumero = 0\r\na = 0\r\nwhile numero < int(n[1]):\r\n numero = int(n[2])**contador \r\n contador += 1\r\n if numero <= int(n[1]) and numero >= int(n[0]):\r\n print(numero, end=\" \")\r\n a += 1\r\nif a == 0:\r\n print(\"-1\") \r\n \r\n \r\n", "l, r, k = map(int, input().split())\r\nret = []\r\ncur = 1\r\nwhile cur <= r:\r\n if cur >= l:\r\n ret.append(cur)\r\n cur *= k\r\nret = ret or [-1]\r\nprint(*ret)", "a,b,c = map(int,input().split())\r\n\r\nk = 1\r\nans = []\r\nwhile k<a:\r\n k*=c\r\nwhile k<=b:\r\n ans.append(k)\r\n k*=c\r\nif len(ans)==0:\r\n print('-1')\r\nelse: \r\n print(*ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nl, r, k = map(int, input().split())\r\n\r\nd = []\r\nx = 0\r\nwhile k**x <= r:\r\n if k**x >= l:\r\n d.append(k**x)\r\n x += 1\r\n\r\nif len(d) != 0:\r\n print(' '.join(map(str, d)))\r\nelse:\r\n print(-1)\r\n", "string = input();\r\nl,r,k = string.split();\r\n\r\nl = int(l);\r\nr = int(r);\r\nk = int(k);\r\n\r\nans = 1;\r\nc = 0;\r\nfor i in range(1,63):\r\n\tif ans >= l and ans <= r:\r\n\t\tprint(ans,end=\" \");\r\n\t\tc = c+1;\r\n\tans = ans*k;\r\n\tif ans > 1e19:\r\n\t\tbreak;\r\n\r\nif c == 0:\r\n\tprint(\"-1\");", "l,r,k = map(int,input().split(' '))\nnow = 1\nf = 0\nwhile now <= r:\n if now <= r and now >= l:\n print(now,end=' ')\n f = 1\n now = now * k\nif f == 0:\n print(-1)\n \t \t \t\t \t\t\t\t \t \t\t \t\t", "import math\n\ndef main():\n l, r, k = map(int, input().split()) \n p = math.ceil(math.log(l, k))\n res = []\n while ( value := k ** p) <= r:\n if value >= l:\n res.append(str(value))\n p += 1\n\n if len(res) == 0:\n return -1\n return \" \".join(res)\n\n\nif __name__==\"__main__\":\n print(main())\n", "l,r,k=map(int,input().split())\np=1\nwhile p<l:\n p*=k\nif p>r:\n print(-1)\nwhile p<=r:\n print(p,end=' ')\n p*=k\n\t \t \t \t\t \t \t \t\t \t\t\t", "# AA Iniciante - Lista 01: Ad-Hoc 1\n# E. Link/Cut Tree\n# author: uncoded\n\ndef main():\n l, r, k = map(int, input().split())\n ok, power = False, 1\n while power <= r:\n if l <= power:\n print(power, end=\" \")\n ok = True \n power *= k\n print(\"\\n\" if ok else -1)\n\n\nif __name__ == \"__main__\":\n main()\n\n", "l, r, k = [int(x) for x in input().split()]\na = 1\nok = False\nwhile a <= r:\n\tif a >= l:\n\t\tok = True\n\t\tprint(a, end = ' ')\n\ta = a * k\nif ok == False:\n\tprint(-1)", "l,r,k = map(int, input().split())\np = 1\nwhile(p < l):\n p*=k\nif(r < p): print(-1)\nwhile(p <= r):\n print(p, end = ' ')\n p*=k\n \t\t\t\t\t\t\t\t\t \t \t\t \t\t \t\t\t\t\t\t", "l, r, v = list(map(int, input().split()))\r\n\r\noututs = []\r\n\r\ncount = 0\r\nfor i in range(1000):\r\n power = v ** i\r\n if power >= l and power <= r:\r\n print(power, end=\" \")\r\n count += 1\r\n\r\n if power > r:\r\n break\r\nif count:\r\n print()\r\nelse:\r\n print(-1)\r\n", "l, r, k = list(map(int, input().split(' ')))\r\nflag = True\r\ncur = 1\r\nwhile(cur <= r):\r\n if (cur >= l):\r\n print(cur, end=' ')\r\n flag = False\r\n cur *= k\r\nif (flag):\r\n print(-1)", "l, r, k = [int(x) for x in input().split()]\r\nn, cnt = 1, 0\r\nwhile n <= r:\r\n\tif l <= n:\r\n\t\tcnt += 1\r\n\t\tprint(n, end=' ')\r\n\tn *= k\r\n\r\nif cnt == 0:\r\n\tprint(-1)\r\nelse:\r\n\tprint()", "def main():\r\n l,r,k= map(int,input().split())\r\n index = 1\r\n arr = []\r\n while(index<=r):\r\n if(index>=l and index<=r):\r\n arr.append(index)\r\n index = index*k\r\n if(len(arr)==0):\r\n print(-1)\r\n else:\r\n print(*arr)\r\n return\r\n# def test():\r\n# t = int(input())\r\n# while(t):\r\n# main()\r\n# t-=1\r\n# return\r\n# test()\r\nmain()", "#!/usr/bin/env python3\r\n# -*- coding: UTF-8 -*-\r\n\r\nimport math\r\n\r\ntxt=input()\r\nnums=txt.split(\" \")\r\nl=int(nums[0])\r\nr=int(nums[1])\r\nk=int(nums[2])\r\nq=1\r\nwhile q<l:\r\n\tq=q*k\r\nif q>r:\r\n\tprint(\"-1\", end=\"\")\r\n\texit()\r\nprint(\"%d\" % q, end=\"\")\r\nq=q*k\r\nwhile q<=r:\r\n\tprint(\" %d\" % q, end=\"\")\r\n\tq=q*k", "l, r, k = map(int, input().split())\r\n\r\nit = 0\r\n\r\nout = ''\r\n\r\nwhile (True):\r\n v = k**it\r\n \r\n if v>=l and v<=r:\r\n out += str(v) + ' '\r\n\r\n elif v>r:\r\n break\r\n\r\n it+=1\r\n\r\nif out == '':\r\n print ('-1')\r\n\r\nelse:\r\n print (out)\r\n\r\n", "l, r, k = map(int, input().split())\r\nx = 1\r\nwhile(x < l):\r\n x *= k\r\na = []\r\nwhile(x <= r):\r\n a.append(x)\r\n x *= k\r\nif(len(a) == 0): print(-1)\r\nelse: print(*a)\r\n", "l,r,k=map(int,input().split())\r\ncnt=1\r\nans=0\r\nflag=False\r\nwhile(cnt<l):\r\n cnt*=k\r\nwhile(cnt<=r):\r\n print(cnt,end=\" \")\r\n flag=True\r\n cnt*=k\r\nif(flag==0):\r\n print(-1)", "from math import log\r\nfrom math import ceil\r\nl,r,k = map(int,input().split())\r\nt = ceil(log(l,k)) \r\nif l == r:\r\n if k**t != l:\r\n print(-1)\r\n else:\r\n print(l)\r\nelif k**t > r:\r\n print(-1)\r\nelse:\r\n s = k**t\r\n L = []\r\n while s <= r:\r\n L.append(str(s))\r\n s *= k\r\n print(' '.join(L))", "l, r, k = list(map(int, input().split()))\r\npws = []\r\ncur = 1;\r\nwhile cur <= r:\r\n if cur >= l and cur <= r:\r\n pws.append(cur)\r\n cur *= k;\r\n\r\nif(len(pws)) >= 1:\r\n print(*pws)\r\nelse:\r\n print(-1)\r\n", "s = input().split()\r\nl = int(s[0])\r\nr = int(s[1])\r\nk = int(s[2])\r\nans = ''\r\nfl = False\r\nfor i in range(0, 1000):\r\n if k ** i >= l and k ** i <= r:\r\n ans += str(k ** i) + ' '\r\nif len(ans) == 0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "# your code goes here\narr = input().split(' ')\nl = int(arr[0])\nr = int(arr[1])\nk = int(arr[2])\ncur = int(1)\nwhile cur < l:\n\tcur *= k\n\t\nfl = False\nans = 0\nwhile (cur <= r):\n\tfl = True\n\tprint(cur, end=' ')\n\tcur *= k\n\t\nif fl == False:\n\tprint(-1)\n", "l, r, k = map(int, input().split())\nans = 1\nflag = False\nwhile True:\n if l <= ans <= r:\n flag = True\n print(ans, end=' ')\n if ans > r:\n break\n ans *= k\n\nif not flag:\n print(-1)\n\t\t \t \t\t \t\t\t \t\t \t \t\t\t", "s = input().split()\nl = int(s[0])\nr = int(s[1])\nk = int(s[2])\nval = 1;\nv = []\nwhile val < l:\n\tval *= k;\nwhile val <= r and val >= l:\n\tv.append(val);\n\tval *= k;\nif len(v) == 0:\n\tprint(-1)\nelse:\n\tfor val in v:\n\t\tprint(val, end = \" \")\n\tprint()", "\r\nl, r, k = input().split(' ')\r\nl = int(l)\r\nr = int(r)\r\nk = int(k)\r\n\r\np = 1\r\n\r\nout = \"\"\r\ndone = False\r\nwhile True:\r\n if l <= p <= r:\r\n out += str(p) + \" \"\r\n done = True\r\n p *= k\r\n if p > r:\r\n break\r\n\r\nif done == False:\r\n print(-1)\r\n \r\n\r\nprint(out)\r\n\r\n", "l,r,k=map(int,input().split())\r\narr=[]\r\np=0\r\nx=k\r\nk=1\r\nwhile k<=r:\r\n if k>=l:\r\n arr.append(k)\r\n p+=1 \r\n k*=x\r\nif len(arr)==0:\r\n print(-1)\r\nelse:\r\n for ele in arr:\r\n print(ele,end=\" \")\r\n print()", "l, r, k = input().split()\nl = int(l)\nr = int(r)\nk = int(k)\nt = 1\nar = []\nwhile(t <= r):\n if t >= l and t <= r:\n ar.append(t)\n t *= k;\nif(len(ar) == 0):\n print(-1)\nelse:\n print(*ar)\n", "l,r,k=map(int,input().split())\r\nans=1;\r\nc=0\r\nwhile(ans<l): \r\n ans=ans*k\r\nwhile(ans<=r):\r\n c=c+1\r\n print(ans)\r\n ans=ans*k\r\nif(c==0):\r\n print(-1)", "# https://codeforces.com/contest/614\r\n\r\nimport sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\nl, r, k = map(int, input().split())\r\nx = 1\r\n\r\nans = []\r\nwhile x <= r:\r\n if l <= x:\r\n ans += [x]\r\n x *= k\r\n\r\nif ans:\r\n print(*ans)\r\nelse:\r\n print(-1)", "l,r,k= map(int,input().split())\r\ndesi=123\r\nx=0\r\nwhile 1:\r\n\tif(l<=k**x<=r):\r\n\t\tdesi=786\r\n\t\tprint(k**x)\r\n\tif(k**x>r):\r\n\t\tbreak\r\n\tx+=1\r\nif(desi != 786):\r\n\tprint(-1)\r\n\r\n", "a,b,c = [int(i) for i in input().split()]\r\nt = 1\r\nwhile a > t:\r\n\tt = t*c\r\nif t > b:\r\n\tprint(-1)\r\nwhile t <= b:\r\n\tprint(t,end = ' ')\r\n\tt = t*c\r\n", "a = []\r\nd = input().split()\r\nl = int(d[0])\r\nr = int(d[1])\r\nk = int(d[2])\r\nt = 1;\r\na.append(t);\r\nwhile (t < 10**20):\r\n\tt *= k;\r\n\ta.append(t);\r\ncnt = 0\r\nres = ''\r\nfor i in range(len(a)):\r\n\tif (a[i] <= r and a[i] >= l):\r\n\t\tres += str(a[i]) + ' '\r\nif (len(res) <= 0):\r\n\tprint(-1)\r\nelse:\r\n\tprint(res)", "a, b, c = map(int, input().split())\r\ncount = -1\r\nd = 0\r\nl = []\r\nq = 0\r\nwhile d <= b:\r\n count += 1\r\n d = c ** count\r\n l.append(d)\r\n\r\nfor i in l:\r\n if a <= i <= b:\r\n print(i, end=' ')\r\n q = 1\r\n\r\nif q == 0:\r\n print(-1)", "l,r,k=input().split()\r\nl=int(l)\r\nr=int(r)\r\nk=int(k)\r\nent=False\r\nfor i in range(0,60):\r\n a=pow(k,i)\r\n if(a>=l and a<=r):\r\n ent=True\r\n print(a,end=' ')\r\nif(not ent):\r\n print(-1)\r\nelse:\r\n print()", "l, r, k = map(int, input().split())\r\n\r\np = []\r\napp = False\r\n\r\nfor i in range(61):\r\n if k**i >= l:\r\n app = True\r\n \r\n if k**i > r:\r\n break\r\n \r\n if app:\r\n p.append(k**i)\r\n \r\n \r\nif len(p) == 0:\r\n print(-1)\r\nelse:\r\n print(\" \".join(map(str, p)))\r\n ", "from sys import stdin\r\n\r\nl,r,k= map(int,stdin.readline().split())\r\nres = 1\r\np = 0\r\nget = 0\r\nwhile(res <= r): \r\n if(l == 1 and get == 0):\r\n print(1,\"\",end='')\r\n get = 1\r\n p = 1\r\n res *= k\r\n if(l <= res <= r):\r\n print(res,\"\",end='')\r\n p = 1\r\nif(p == 0):\r\n print(\"-1\")", "from math import *\r\n\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\n\r\nl, r, k = inp()\r\nflag, beg, en = 1, ceil(log(l, k)), ceil(log(r, k))\r\n\r\nfor i in range(beg, en + 1, 1):\r\n if (k ** i > r or k**i<l):\r\n break\r\n print(k ** i, end=' ')\r\n flag = 0\r\n\r\nif (flag):\r\n print(-1)\r\n", "l, r, k = map(int, input().split())\r\n\r\nfound = False\r\nm = 1\r\nwhile m <= r:\r\n if m >= l:\r\n found = True\r\n print(m, end=' ')\r\n m *= k\r\n\r\nif not found:\r\n print(-1)\r\n", "l,r,k=map(int,input().split())\r\nls=[]\r\ni=1\r\nwhile i<=r:\r\n if i>=l:\r\n ls.append(i)\r\n i*=k\r\nif len(ls):\r\n print(\" \".join(str(i) for i in ls))\r\nelse :\r\n print(-1)", "l,r,k=map(int, input().split())\nval=k\ncnt=1\ns=\"\"\nfor i in range(0,65):\n\tif(l<=k**i<=r):\n\t\tcnt=0\n\t\ts+=str(k**i)+\" \"\nif(cnt==1): print(-1)\nelse: print(s)", "entrada = input().split(\" \")\nnada = True\nfor i in range(0,int(entrada[1])+1):\n\tpower = int(entrada[2])**int(i)\n\tif(power >= int(entrada[0]) and power <= int(entrada[1])):\n\t\tprint(power,end=\" \")\n\t\tnada = False\n\telif(power >int(entrada[1])):\n\t\tbreak\nif(nada):\n\tprint(-1)\n\n\n", "import sys\n\nL, R, K = [int(x) for x in input().split(' ')]\n\nans = \"\"\n\np = 1\n\nwhile p <= R:\n if L <= p and p <= R:\n if len(ans) == 0:\n ans = str(p)\n else:\n ans = ans + \" \" + str(p)\n\n p = p * K\n\nif len(ans) == 0:\n print('-1')\nelse:\n print(ans)\n", "# cook your dish here\r\nimport math\r\nstr = input().split()\r\nl = int(str[0])\r\nr = int(str[1])\r\nk = int(str[2])\r\nx = int(math.log(l)/math.log(k))\r\nma = pow(10,18)\r\nflag = False\r\nwhile True :\r\n p = pow(k,x)\r\n if(p>ma or p>r):\r\n break\r\n if p>=l:\r\n flag = True\r\n print(p,end=\" \")\r\n \r\n x+=1\r\nif(flag == False):\r\n print(-1)", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nl, r, k = a\r\ni = 0\r\np = k**i\r\nrz = ''\r\nwhile p <= r:\r\n if p >= l:\r\n rz += ' ' + str(p)\r\n i += 1\r\n p *= k\r\nif rz == '':\r\n print(-1)\r\nelse:\r\n print(rz[1:])\r\n", "[l,r,k]=[int(x) for x in input().split()]\r\ni=1\r\nb=1\r\nwhile True:\r\n if i>r:\r\n break\r\n if i>=l:\r\n b=0\r\n print(i)\r\n i*=k\r\nif b:\r\n print(-1)\r\n", "if __name__ == \"__main__\":\r\n l , r , k = [int(x) for x in input().split()]\r\n res = []\r\n\r\n i = 0\r\n while True:\r\n a = k**i\r\n if a > r:\r\n break\r\n if a >= l:\r\n #print(a)\r\n res.append(str(a))\r\n i += 1\r\n\r\n if len(res) == 0:\r\n print(-1)\r\n else:\r\n print(\" \".join(res))\r\n", "l, r, k = map(int, input().split())\n\n\nres = 1\ncop = k\ncnt = 0\ncntt = 0\nflag = False\nwhile True:\n\tres = pow(cop, cnt)\n\tif res >= l and res <= r:\n\t\tprint(res, end = \" \")\n\t\tcntt += 1\n\telif res > r:\n\t\tbreak\t\n\tcnt += 1\n\nif cntt == 0:\n\tprint(-1)\n \t\t \t \t \t \t\t\t\t\t \t\t \t\t\t \t\t", "a = list(map(int,input().split()))\r\nc = 0\r\nans = 1\r\nwhile ans <= a[1]:\r\n if ans >= a[0] and ans <= a[1]:\r\n if c == 0:\r\n print(ans, end = '')\r\n else:\r\n print(' ', ans, end = '')\r\n c = 1\r\n ans *= a[2]\r\n\r\nif c == 0:\r\n print('-1')\r\nelse:\r\n print()", "(inicio, fim, passo) = [int(num) for num in input().split(' ')]\nc = 0\nver = False\nwhile True:\n passo_c = pow(passo, c)\n c += 1\n if passo_c > fim:\n break\n elif inicio <= passo_c <= fim:\n print(f'{passo_c}', end=' ')\n ver = True\nif ver == False:\n print('-1')\n\t \t\t\t\t\t \t\t \t \t\t \t \t\t \t\t\t\t \t", "entry = list(map(int,input().split()))\r\nl,r,k = entry[0],entry[1],entry[2]\r\n\r\nnumbers = []\r\ni = 0\r\nwhile(k**i <= r):\r\n if(k**i >= l):\r\n numbers.append(k**i)\r\n i+=1\r\n\r\nif (numbers):\r\n for i in numbers:\r\n print(i, end= ' ') \r\nelse:\r\n print(-1)", "b = list(map(int,input().split(' ')))\r\nl = b[0]\r\nr = b[1]\r\nk = b[2]\r\na = []\r\nindex=0\r\nstep=0\r\nlon1=-1\r\nwhile (lon1<=r):\r\n if(lon1>=l and lon1<=r):\r\n a.append(lon1)\r\n index+=1\r\n lon1=k**step;\r\n step+=1\r\nif(index==0):\r\n print (-1)\r\nelse:\r\n for i in range(index):\r\n print(a[i])\r\n", "import math as m\r\nl,r,k=map(int,input().split())\r\nk1=m.log(l,k)\r\nk1=int(k1)\r\no=k**k1\r\nv=[]\r\nwhile o<=r:\r\n if o>=l:\r\n v.append(o)\r\n o*=k\r\nif len(v)==0:\r\n print(\"-1\")\r\nelse:\r\n for i in range(len(v)):\r\n print(v[i],end=\" \")\r\n", "\r\nl,r,k=map(int,input().strip().split())\r\nnum=1\r\na=[]\r\na.append(1);\r\nwhile(num*k<=r):\r\n\tnum=num*k\r\n\ta.append(num)\r\n\r\n\r\nw=False\r\n\r\nfor i in range(len(a)):\r\n\tif(a[i]>=l and a[i]<=r):\r\n\t\tprint(a[i],end=\" \")\r\n\t\tw=True\r\nif(w==False):\r\n\tprint(-1)\r\n", "l,r,k = map(int,input().split())\r\nL,i =[],0\r\nwhile k**i <= r:\r\n if k ** i >= l:L.append(str(k**i))\r\n i+=1\r\nprint(-1 if len(L) == 0 else ' '.join(L))", "l,r,k=[int(i) for i in input().split()]\r\na=[] \r\nt=1\r\nwhile (t<=r):\r\n if (t>=l):\r\n a.append(t)\r\n t*=k\r\nif len(a)==0:\r\n print(-1)\r\nelse:\r\n for elem in a:\r\n print (elem,end=' ')\r\n \r\n", "l,r,k = (list)(map(int , input().split()))\r\nmul = 1\r\nans = []\r\nwhile mul <= r :\r\n if mul >= l : ans.append(mul)\r\n mul *= k\r\nif len(ans) == 0 : print(-1)\r\nelse : \r\n for _ in ans : print(_ , end=\" \")", "a,b,c = input().split(' ')\na = int(a)\nb = int(b)\nc = int(c)\nd = []\no = 0\nwhile c**o<=b:\n if c**o>=a:\n d.append(c**o)\n o+=1\nfor i in range(len(d)):\n print(d[i],end=' ')\nif len(d)==0:\n print(-1)\n\t \t \t\t \t \t\t\t\t \t \t\t\t\t \t \t \t \t", "l,r,k = map(int,input().split())\r\nki=1\r\nok = 0\r\nwhile(ki<=r):\r\n if(ki>=l and ki<=r):\r\n print(ki,end=\" \")\r\n ok = 1\r\n ki=ki*k\r\n\r\nif(ok==0):\r\n print(\"-1\")", "def qmi(a, b):\n res = 1\n while b:\n if b % 2 == 1:\n res = res * a\n a = a * a\n b //= 2\n return res\n\nl, r, k = input().split()\nl = eval(l); r = eval(r); k = eval(k)\n\nans = []\ni = 0\nwhile 1:\n t = qmi(k, i)\n if t >= l and t <= r:\n ans.append(t)\n elif t > r:\n break\n i += 1\n\nlens = len(ans)\nif lens == 0:\n print(\"-1\")\nelse:\n for i in range(0, lens):\n print(\"{}\".format(ans[i]), end = ' ')\n\n \t \t \t \t\t \t\t\t \t\t\t \t \t\t\t \t\t", "l, r, k = map(int, input().split())\n\npowers = []\ni = 0\ncurrent = k ** i\n\nwhile current <= r:\n if current >= l:\n powers.append(current)\n i += 1\n current = k ** i\n\nif powers:\n print(' '.join(map(str, powers)))\nelse:\n print(-1)\n", "l, r, k = input().split()\r\n\r\nlk = 0\r\nf = False\r\nwhile(1):\r\n p = int(k) ** lk\r\n if(p >= int(l) and p <= int(r)):\r\n f = True\r\n print(str(p) +\" \", end=\"\")\r\n if(p > int(r)): break\r\n lk += 1\r\n\r\nif(f):\r\n print(\"\")\r\nelse:\r\n print(-1)", "l, r, k = map(int, input().split())\r\np = 1\r\nempty = True\r\nwhile (p <= r):\r\n if (p >= l):\r\n print(p, end = \" \")\r\n empty = False\r\n p *= k\r\nif empty:\r\n print(-1)\r\n", "l, r, k = map(int, input().split())\r\nj = k\r\nf = True\r\nif l <= 1:\r\n print(1, end=' ')\r\n f = False\r\nwhile k <= r:\r\n if l <= k <= r:\r\n print(k, end=' ')\r\n f = False\r\n k *= j\r\nif f:\r\n print(-1)\r\n", "l, r, k = map(int, input().split(' '))\ni = 0\nwhile True:\n if pow(k, i) < l and pow(k, i + 1) > r:\n print(-1)\n break\n if l <= pow(k, i) <= r:\n print(pow(k, i), end=' ')\n if pow(k, i) <= r < pow(k, i + 1):\n break\n i += 1\n\t \t\t \t\t \t\t\t\t \t\t \t\t\t \t \t\t", "l,r,k = [int(i) for i in input().split()]\r\ncur = 1\r\nwhile cur < l :\r\n\tcur *= k\r\n\r\nret = []\r\nwhile l <= cur and cur <= r :\r\n\tret.append(cur)\r\n\tcur *= k\r\nif len(ret) == 0 :\r\n\tret.append(-1)\r\nfor ans in ret :\r\n\tprint(ans,end=\" \")", "import sys\r\n\r\n# sys.stdin=open(\"ivo.in\")\r\n\r\nl, r, k = sys.stdin.readline().split()\r\nl = int(l)\r\nr = int(r)\r\nk = int(k)\r\n\r\nval = 1\r\nres = []\r\nwhile val <= r:\r\n if val >= l and val <= r:\r\n res.append(val)\r\n val = val * k\r\n\r\nif len(res) == 0:\r\n res.append(-1)\r\n\r\nprint(\" \".join([str(x) for x in res]))\r\n\r\n", "'''input\n2 4 5\n'''\nl, r, k = map(int, input().split())\nt = 0\nfor x in range(100000):\n\tif k**x >= l and k**x <= r:\n\t\tprint(k**x, end=\" \")\n\t\tt = 1\n\telif k**x > r:\n\t\tbreak\nif t == 0:\n\tprint(-1)\n", "import math\nl , r ,k = map(int,input().split())\nc = 0\np = 0\ni = 1\nwhile i<=r:\n if i>=l and i<=r:\n print(i)\n c=1\n i*=k\n\nif c==0:\n print(\"-1\")\n", "l, r, k = [int(i) for i in input().split()]\r\ncur = 1\r\n\r\nans = []\r\n\r\nwhile cur <= r:\r\n if cur >= l:\r\n ans.append(cur)\r\n cur *= k\r\n\r\nif len(ans) == 0: ans.append(-1)\r\n\r\nfor j in ans:\r\n print(j, end = \" \")\r\nprint()", "l,r,k=map(int,input().split())\r\nran=range(l,r+1)\r\nanswer = [k**e for e in range(100) if k**e in ran]\r\nif len(answer) > 0:\r\n print(*answer)\r\nelse:\r\n print( -1)", "l,r,k = map(int,input().split())\r\ni = 1\r\nb = False\r\nwhile i <= r:\r\n if l <= i:\r\n print(i,end=\" \")\r\n b = True\r\n i *= k\r\nif not b:\r\n print(-1)", "l, r, k = map(int, input().split())\r\nres = []\r\n\r\ncur = 1\r\nwhile cur < l:\r\n cur *= k\r\n\r\nwhile cur <= r:\r\n res.append(cur)\r\n cur *= k\r\n\r\nif res:\r\n print(*res)\r\nelse:\r\n print(-1)", "l,r,k=[int(x) for x in input().split()]\r\nans=False\r\nx=1\r\nwhile x<=r:\r\n if l<=x:\r\n print(x, end=' ')\r\n ans=True\r\n x*=k\r\nif not ans:\r\n print(-1)", "from math import log\n\nl, r, k = [ int(x) for x in input().split() ]\n\ne = 0\ni = k ** e\nwhile i < l:\n e += 1\n i = k ** e \n\nj = 1\nan = i\nns = ['-1']\n\nwhile an <= r:\n if ns[0] == '-1':\n ns = [ ]\n ns.append(str(an))\n j += 1\n aux = int(k ** (j - 1))\n an = i * aux\nprint(\" \".join(ns))\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", "a, b, k = map(int, input().split())\n\nf = 0\n\nlst = []\n\nfor i in range (0, 65):\n x = k ** i\n if (x >= a and x <= b):\n lst.append(x)\n # print(x, end = ' ')\n f = 1\n\nans = -1\n\nif (f == 0):\n\tprint(ans)\nelse:\n\tfor i in range (0, len(lst)-1):\n\t\tprint(lst[i], end = ' ')\n\tprint(lst[len(lst)-1])\n\n \t\t\t\t \t\t\t\t \t \t \t\t \t\t\t\t \t\t", "l,r,k = list(map(int, input().split(' ')))\nt = 1\na=0\nAns = []\nwhile t<=r:\n\tif t>=l:\n\t\ta+=1\n\t\tAns.append(t)\n\tt*=k\nif a==0:\n\tprint(-1)\nelse:\n\tprint(\" \".join(map(str, Ans)))", "l,r,k = map(int, input().split())\r\n\r\np = 1\r\nres = []\r\nwhile p<=r:\r\n\tif l<=p<=r:\r\n\t\tres.append(p)\r\n\tp *= k\r\n\r\nif len(res) == 0:\r\n\tprint(-1)\r\nelse:\r\n\tfor x in res:\r\n\t\tprint(x, end=' ')", "(l, r, k) = map(int, input().split())\r\n\r\ncur = 1\r\n\r\nok = False\r\n\r\nwhile cur<=r:\r\n if cur>=l :\r\n print(cur, end=' ')\r\n ok = True\r\n cur *= k\r\n\r\nif not ok:\r\n print(-1)\r\n", "import sys, itertools, math, collections, random\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\nl, r, k = ia()\n\nn = 1\nf = 0\nwhile n <= r:\n if n >= l:\n print(n, end=\" \")\n f += 1\n n *= k\n\nif f == 0:\n print(-1)\nelse:\n print()", "l,r,k = [int(i) for i in input().split()]\n\npot = [1]\nwhile pot[0]<l:\n pot[0]*=k\nwhile pot[len(pot)-1]<r:\n pot.append(pot[len(pot)-1]*k)\nif(pot[len(pot)-1] != r):\n del(pot[len(pot)-1])\nif(pot == []):\n print(-1)\nelse:\n print(\" \".join(str(i) for i in pot))", "a = input().split()\r\nl = int(a[0])\r\nr = int(a[1])\r\nk = int(a[2])\r\nans = []\r\npos = 1;\r\nwhile pos <= r:\r\n if pos >= l and pos <= r:\r\n ans.append(str(pos))\r\n pos = pos * k\r\nif len(ans) == 0:\r\n ans.append(\"-1\")\r\nprint(\" \".join(ans))\r\n", "\r\nl,r,k=input().split(' ')\r\n\r\nl = int(l)\r\nr=int(r)\r\nk=int(k)\r\nprod = 1;\r\nprinted = 0;\r\nfor i in range(0, 102):\r\n\tif prod <= r and prod >= l:\r\n\t\tprinted = 1;\r\n\t\tprint(prod);\r\n\telse:\r\n\t\tif printed:\r\n\t\t\tbreak;\r\n\tprod = prod * k;\r\n\r\nif printed==0:\r\n\tprint(-1)\r\n\t", "import math\r\nl, r, k = map(int, input().split())\r\nl1 = math.ceil(math.log(l, k))\r\nr1 = math.ceil(math.log(r, k))\r\nif k ** r1 > r:\r\n r1 -= 1\r\nif k ** l1 < l:\r\n l1 += 1\r\nprint(-1 if l1 > r1 else \" \".join([str(k ** i) for i in range(l1, r1 + 1)]))", "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 l, r, k = rl()\r\n x = 1\r\n count = 0\r\n while (x <= r):\r\n if (x >= l):\r\n print (x, end = \" \")\r\n count += 1\r\n x *= k\r\n if (count == 0):\r\n print (-1)\r\n\r\n\r\n\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", "l, r, k = map(int, input().split())\r\nexpp = 1\r\nans = []\r\nwhile True:\r\n if expp >= l and expp <= r:\r\n ans.append(expp)\r\n elif expp > r:\r\n break\r\n expp *= k\r\n\r\nif len(ans) == 0:\r\n print(\"-1\")\r\nelse:\r\n for it in ans:\r\n print(it, end=\" \")\r\n print(\"\")", "from collections import Counter,defaultdict,deque\r\n#import heapq as hq\r\n#import itertools\r\n#from itertools import count, islice\r\n#from functools import reduce\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\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\nimport math\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef solve():\r\n l,r,k = [int(x) for x in input().split()]\r\n ok = 0\r\n for i in range(100):\r\n p = k**i\r\n if l<=p<=r:\r\n print(p,end = ' ')\r\n ok = 1\r\n if p>r:\r\n break\r\n if not ok:\r\n print(-1)\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", "a = 1\r\na,b,c = input().split(' ')\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = []\r\no = 0\r\nwhile c**o<=b:\r\n if c**o>=a:\r\n d.append(c**o)\r\n o+=1\r\nfor i in range(len(d)):\r\n print(d[i],end=' ')\r\nif len(d)==0:\r\n print(-1)", "l,r,k=input().strip().split()\ns = 1\ns = int(s)\nl = int(l)\nr = int(r)\nk = int(k)\nf = 0\nfor i in range(1000):\n\tif s>=l and s<=r:\n\t\tf = 1\n\t\tprint(s)\n\telif s>r:\n\t\tbreak\n\ts*=k\nif f == 0:\n\tprint(-1)\n \t \t \t \t\t\t\t\t\t \t \t \t\t\t", "l, r, k = [int(i) for i in input().split(' ')]\ns = ''\nfor i in range(10000):\n if k**i < l:\n continue\n if k**i > r:\n break\n s += str(k**i) + ' '\nif not s:\n s = r'-1 '\nprint(s[:-1])\n\t\t\t \t\t \t \t \t\t \t\t\t\t\t\t\t \t", "min, max, num = [int(x) for x in input().split()]\r\nvdd = 0\r\n\r\ni = 0\r\npot = num**i\r\n\r\nwhile pot <= max:\r\n if min <= pot and pot <= max:\r\n print(pot, end=\" \")\r\n vdd = 1\r\n i = i + 1\r\n pot = num**i\r\nif vdd == 0:\r\n print(-1)", "l,r,k = [int(x) for x in input().split()]\nans = 1\nwhile (ans<l):\n ans*=k\nyes = 0\na = []\nwhile (ans<=r):\n yes = 1\n a.append(ans)\n ans*=k\nif yes:\n for i in a:\n print(i,end= ' ')\n print()\nelse:\n print(-1)\n", "l,r,k=map(int,input().split())\r\nsum=1;\r\nf=0\r\nwhile 1:\r\n if sum>=l and sum<=r:\r\n print(sum,end=' ')\r\n f=1\r\n if sum>r:\r\n break\r\n sum*=k\r\nif not f:\r\n print('-1')\r\n", "l, r, w = map(int, input().split())\nif w == 1:\n if l == 1 and r >= 1:\n print(1)\n else:\n print(-1)\n exit(0)\nprint(*([w**i for i in range(60) if l <= w**i <= r] or [-1]))", "l, r, k = map(int, input().split())\n\nresp = []\n\nfor i in range(0, 100):\n if(k**i >= l and k**i <= r):\n resp.append(k**i)\n\nif len(resp) == 0:\n print(-1)\nelse:\n print(*resp)\n\t \t \t\t\t\t \t \t\t \t\t\t \t\t\t \t\t \t\t\t", "l, r, k = map(int, input().split())\n\nprint(*([k**_ for _ in range(64) if l <= k**_ <= r] or [-1]))\n\n\n\n# Made By Mostafa_Khaled", "l,r,k=map(int, input().split())\r\nflag=0\r\nif l==1:\r\n\ta=1\r\n\tprint(a)\r\n\tflag=1\r\nif k>r and flag==0:\r\n\tprint(-1)\r\nelse:\r\n\ta=k\r\n\twhile a<l:\r\n\t\ta=a*k\r\n\tif a>r and flag==0:\r\n\t\tprint(-1)\r\n\twhile(a<=r):\r\n\t\tprint(a)\r\n\t\ta=a*k\r\n#\tprint(a)", "l , r, k =input().split(' ')\nl=int(l)\nr=int(r)\nk=int(k)\nsum=1\nans=[]\nif l>r:\n print(-1)\n exit(0)\nwhile sum < l:\n sum=sum*k\nwhile sum <= r:\n ans.append(sum)\n sum=sum*k\nif len(ans)==0:\n print(-1)\n exit(0)\nfor i in ans:\n print(i,end=' ')\n\t \t \t\t \t \t \t\t\t \t \t", "l,r,k=map(int,input().split())\ns=0\nflag=1\nfor i in range(r):\n if k**i>=l:\n s=i\n break\nwhile k**s>=l and k**s<=r:\n print(k**s,end=\"\")\n print(\" \",end=\"\")\n flag=0\n s+=1\nif flag:\n print(-1)\n\t \t\t\t \t \t\t \t \t \t \t", "\r\n\r\nimport math\r\n\r\nl,r,k = map(int,input().split())\r\n\r\n\r\n\r\nh=0\r\nfor j in range(10**9):\r\n if l<=k**j<=r:\r\n print(k**j,end=' ')\r\n h+=1\r\n elif k**j>r:\r\n break\r\n \r\n \r\nif h==0:\r\n print(-1)\r\n", "l,r,k=map(int,input().split())\r\ni=0\r\nx=0\r\nwhile k**i<l: i+=1\r\nwhile k**i<=r:\r\n print(k**i,end=' ')\r\n x=1\r\n i+=1\r\nif x==0: print(-1)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/614/A\r\n\r\nimport math\r\n\r\nl, r, k = map(int, input().split())\r\n\r\nx = 0\r\nl_a = list()\r\nwhile True:\r\n a = k ** x\r\n if a >= l and a <= r:\r\n l_a.append(a)\r\n elif a >= r:\r\n break\r\n x += 1\r\n\r\nif len(l_a) == 0:\r\n print(-1)\r\nelse:\r\n print(\" \".join(str(x) for x in l_a))", "l,r,k=map(int,input().split())\r\ns=k\r\nmat=[]\r\nif l==1:\r\n mat.append(l)\r\nwhile(s<=r):\r\n if s>=l:\r\n mat.append(s)\r\n s=s*k\r\nif len(mat)>0:\r\n for i in mat:\r\n print(i,end=' ')\r\nelse:\r\n print(\"-1\")", "l, r, k = map(int, input().split())\r\ncur = f = 1\r\nwhile cur <= r:\r\n if cur >= l:\r\n f = 0\r\n print(cur, end = ' ')\r\n cur *= k\r\nif f: print(-1)\r\n", "import math\nimport cmath\nimport string\nimport sys\nimport bisect\nimport ctypes\nfrom queue import Queue,LifoQueue,PriorityQueue\nfrom itertools import permutations,combinations\nfrom collections import deque,Counter\n\nl,r,k=list(map(int,input().split()))\ni=0\na=[]\nwhile 1:\n temp=pow(k,i)\n i+=1\n if temp<=r:\n a.append(temp)\n else:\n break\n\nb=[]\nfor i in a:\n if i<=r and i>=l:\n b.append(i)\nif len(b)==0:\n print(-1)\nfor i in b:\n print(i,end=\" \")\n\n\n \t\t \t\t \t \t\t \t \t\t\t\t\t\t\t \t \t", "l, r, k = map(int, input().split()) \r\nn = 1\r\nv = []\r\nwhile n <= r:\r\n if n >= l:\r\n v.append(n)\r\n n *= k\r\n \r\nif(len(v)==0):\r\n print(-1)\r\nelse:\r\n for i in v:\r\n print(i,end=' ')", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nl,r,k = map(int, input().split())\r\nans = []\r\ntmp = 1\r\nwhile tmp<=r:\r\n if tmp>=l:\r\n ans.append(tmp)\r\n tmp*=k\r\n \r\nif ans:\r\n print(*ans)\r\nelse:\r\n print(-1)\r\n\r\n", "l,r,k = input().split()\r\nl=int(l)\r\nr=int(r)\r\nk=int(k)\r\np = 1\r\nflag = False\r\n\r\nwhile True:\r\n if(p>r):\r\n break\r\n if(p>=l and p<=r):\r\n flag = True\r\n print(p,end=\" \")\r\n p*=k\r\nif flag==False:\r\n print(\"-1\")\r\nprint(\"\")", "import math\r\nnumbers=list(map(int,input().split()))\r\nl=numbers[0]\r\nr=numbers[1]\r\nk=numbers[2]\r\np=math.ceil(math.log(l,k))\r\n#print (p)\r\n#print (k**p)\r\nif(k**p>r or k**p<l):\r\n print(-1)\r\nelse:\r\n while (1):\r\n s=k**p\r\n if(s>r):\r\n break\r\n print(int(s))\r\n p=p+1;\r\n #print(int(p))\r\n \r\n\r\n", "l,r,k=map(int,input().split())\r\nv=[]\r\nt=1\r\nwhile t<=r:\r\n if t>=l:\r\n v.append(t)\r\n t*=k\r\nif len(v)==0:\r\n print('-1')\r\nelse:\r\n print(' '.join(map(str,v)))", "l, r, k = map(int, input().split())\nk2 = 1\nfound = False\nwhile k2 <= r:\n if k2 >= l:\n found = True\n print(k2, end=' ')\n k2 *= k\nif found:\n print()\nelse:\n print(-1)\n", "l, r, k = map(int, input().split())\r\nstart = 1;\r\nls = []\r\nwhile 1:\r\n if start>=l and start<=r:\r\n ls.append(start)\r\n start*=k\r\n if start>1e18:\r\n break\r\nif len(ls)==0:\r\n print(-1)\r\n exit(0)\r\nfor item in ls:\r\n print(item, end=\" \")", "(l1, r1, k1) = (input().split())\r\nl = int(l1)\r\nr = int(r1)\r\nk = int(k1)\r\ni = 1\r\nf = 0 \r\nif 2 <= k <= 10 ** 9 and 1 <= l <= 10 ** 18 and 1 <= r <= 10 ** 18:\r\n while i <= 10 ** 18:\r\n if l <= i <= r:\r\n f += i\r\n print(i, end=\" \" )\r\n i = i * k\r\n \r\n if f == 0:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n ", "A = list(map(int,input().split()))\r\nl = A[0]\r\nr = A[1]\r\nk = A[2]\r\nans=int(1)\r\nflag=0\r\nwhile(ans<l):\r\n ans*=k\r\nif(ans<=r):\r\n print(ans)\r\n flag=1\r\nwhile(ans*k <= r):\r\n ans*=k\r\n print(ans)\r\n flag=1\r\nif(flag==0):\r\n print(-1)", "from sys import stdout\r\n\r\nl, r, k = map(int, input().split())\r\n\r\nf = 1\r\nv = 0\r\nwhile f <= r:\r\n\tif f >= l:\r\n\t\tv = 1\r\n\t\tstdout.write(str(f) + \" \")\r\n\tf *= k\r\nif v == 0:\r\n\tprint(-1)\t\t", "# your code goes here\r\n# your code goes here\r\ninp = input()\r\ninp = inp.split()\r\na=int(inp[0])\r\nb=int(inp[1])\r\nc=int(inp[2])\r\n#print(a,b,c)\r\nans = 1\r\nk=0\r\nwhile(ans<a):\r\n\tans=ans*c\r\n\r\nwhile(ans<=b):\r\n\tk=1\r\n\tprint(ans,end=\" \")\r\n\tans=ans*c\r\nif(k==0):\r\n\tprint(-1)\r\nprint(\"\\n\")", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\n\r\nl,r,k = [int(x) for x in input().split()]\r\ndk=1\r\nflag=False\r\nwhile(dk<=r):\r\n if(dk>=l):\r\n print(dk,end=\" \")\r\n flag=True\r\n dk*=k\r\nif(flag==False):\r\n print(-1)", "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\n\nA,B,C = map(int,input().split())\nl = []\nfor x in range(100):\n if A<=C**x<=B:\n l.append(C**x)\n if C**x>B:break\nif not l:\n print(-1)\nelse:\n print(*l)", "l , r , k = map(int , input().split())\r\ncur , f = 1 , 1\r\nwhile( cur <= r):\r\n if(cur >= l) :\r\n print(cur , sep = ' ')\r\n f = 0\r\n cur *= k\r\nif(f):\r\n print(-1)", "from math import *\r\nl,r,k = map(int,input().split())\r\n\r\n\r\n\r\nd = [k**i for i in range(0,100) if l<=k**i<=r]\r\nif d:\r\n\tprint(*d)\r\nelse:\r\n\tprint(-1)\r\n", "l,r,k=map(int, input().split())\r\nprint(*[k**p for p in range(65)if l<=k**p<=r]or[-1])", "l,r,k = map(int,input().split())\r\n\r\nans = []\r\ni = 0\r\nwhile True:\r\n x = k ** i\r\n if x >= l and x <= r:\r\n ans.append(x)\r\n if x > r:\r\n break\r\n i+= 1\r\n\r\nif len(ans) == 0:\r\n print(-1)\r\nelse:\r\n for i in ans:\r\n print(i,end=' ')", "a,b,c=map(int,input().split())\npower=1;\nans=[]\nwhile power<=b:\n if(power>=a):\n ans.append(power)\n power*=c\n\nif len(ans)==0:\n print(-1)\nelse:\n print(*ans)\n \n\n \t\t \t\t\t \t\t\t\t \t\t\t \t \t \t\t\t\t", "l,r,k=map(int,input().split())\r\nz=1\r\nc=0\r\nwhile z<=r:\r\n if z<=r and z>=l:\r\n print(z,end=\" \")\r\n c+=1\r\n z*=k\r\nif c==0:\r\n print(-1)\r\n", "a,b,k = map(int,input().split(' '))\ni = 0\nflag = 1\nwhile 1:\n temp = k**i\n if temp in range(a,b+1):\n print(temp,end = ' ')\n flag = 0\n if temp > b:\n break\n i += 1\nif flag:\n print(-1,end = ' ')\n \t\t\t \t\t\t\t \t\t \t\t\t \t \t", "l, r, k = map(int, input().split())\r\nx = 1\r\nwhile (x < l):\r\n\tx *= k\r\nok = False\r\nwhile (x >= l and x <= r):\r\n\tprint(x, end=' ')\r\n\tok = True\r\n\tx *= k\r\nif (not ok):\r\n\tprint(-1)", "from collections import *\r\nfrom math import *\r\nfrom itertools import *\r\ndef I():return map(int, input().strip().split())\r\nl, r, k = I()\r\nans = []\r\npivot, p = 1, 0\r\nwhile pivot <= r:\r\n if (pivot >= l) and (pivot <= r):\r\n ans.append(pivot)\r\n pivot *= k\r\nif len(ans) == 0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(*ans)\r\n", "from math import log\r\nl, r, k = map(int, input().split())\r\ntemp = int(log(l, k))\r\nval = k**temp\r\nif(val<l):val*=k\r\nc=0\r\nwhile(val<=r):\r\n print(val, end=\" \")\r\n val*=k\r\n c+=1\r\nif not c:print(-1)\r\n \r\n", "l,r,k = list(map(int,input().split()))\r\nn=1\r\nflag=False\r\nwhile(n<l):\r\n n*=k\r\nwhile(n<=r):\r\n flag=True\r\n print(n)\r\n n*=k\r\n\r\nif(not flag):\r\n print(-1)", "l, r, k = map(int, input().split())\r\np = 0\r\nf = True\r\nwhile True:\r\n\tif k ** p <= r:\r\n\t\tif k ** p >= l:\r\n\t\t\tprint(k ** p, end = ' ')\r\n\t\t\tf = False\r\n\telse: break\r\n\tp += 1\r\nif f: print(-1)\r\n", "first = True\npower = 1\na, b, c = input().split(sep=' ')\na, b, c = int(a), int(b), int(c)\nwhile power <= b:\n if not first:\n print(' ', end='')\n if power >= a:\n print(power, end='')\n first = False\n power *= c\nif first:\n print(-1, end='')\nprint('\\n')\n\n \t\t\t\t\t\t\t \t\t \t \t \t\t\t\t\t", "l, r, k = [int(x) for x in input().split()]\ntmp, valid = 1, False\nwhile True:\n if tmp >= l and tmp <= r:\n print(tmp, end=\" \")\n valid = True\n tmp *= k\n if tmp > r:\n break\nif not valid:\n print(-1)\n \t \t\t\t \t \t \t \t\t \t\t \t\t", "def power(a, b):\r\n ans = 1\r\n while(b > 0):\r\n if(b & 1):\r\n ans *= a\r\n b >>= 1\r\n a *= a\r\n return ans\r\ncnt = 0\r\nl, r, k = map(int, input().split())\r\naux = power(k, cnt)\r\nflag = False\r\nwhile(aux <= r):\r\n if(aux >= l and aux <= r):\r\n print(aux, end = \" \")\r\n flag = True\r\n cnt += 1\r\n aux = power(k, cnt)\r\nif(not flag):\r\n print(-1)\r\n", "l,r,k=map(int,input().split())\r\ncnt = 0\r\nflag = False\r\nwhile k**cnt < l:\r\n cnt += 1\r\nwhile l <= k**cnt <= r:\r\n flag = True\r\n print(k**cnt, end = ' ')\r\n cnt += 1\r\nif not flag:\r\n print(-1)\r\n", "l,r,k = tuple(map(int,input().split()))\r\n\r\nflag = 0\r\nans = 1\r\nwhile ans<=r:\r\n if l<=ans:\r\n print(ans, end=' ')\r\n flag = 1\r\n ans*=k;\r\nif flag == 0:\r\n print(\"-1\")", "\r\nl,r,k = map(int, input().split(' '))\r\n\r\npw = 1\r\nfound = 0\r\n\r\nwhile pw < l:\r\n\tpw = pw * k\r\n\r\nans = \"\"\r\n\r\nwhile pw <= r:\r\n\tans = ans + str(pw) + \" \"\r\n\tpw = pw*k\r\n\tfound = 1\r\n\r\nif not found: print (-1)\r\nelse: print (ans)", "curr=1\r\nprinted=False\r\n\r\nl,r,k = [int(i) for i in input().split()]\r\n\r\nwhile(curr <= r):\r\n if(curr >= l):\r\n print(curr, end=' ')\r\n printed=True\r\n curr = curr * k \r\n \r\nif not printed:\r\n print(-1, end=' ')\r\nprint()", "from math import log, floor\r\nl, r, n=map(int, input().split())\r\np=floor(log(l, n))\r\na=[]\r\ni=n**p\r\nwhile i<=r:\r\n\tif l<=i:\r\n\t\ta.append(i)\r\n\ti*=n\r\nif len(a)==0:\r\n\ta=[-1]\r\nprint(*a)", "l, r, k = map(int,input().split(\" \"))\n\nnums = []\npot = 0\nresp = ''\nfor i in range(0,200,1):\n pot = k**i\n if(pot >= l and pot <= r):\n nums.append(str(pot))\n if(pot > r):\n break\nif(len(nums) == 0):\n print(-1)\nelse:\n for e in range(len(nums)):\n if(e != len(nums)-1):\n resp += nums[e]\n resp += ' '\n else:\n resp += nums[e]\n print(resp)\n \t \t \t\t\t \t\t\t \t\t\t\t \t \t\t\t\t", "import sys\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# ///==========MAIN=============///\r\nl,r,k=get_ints()\r\nscore=1;result=[]\r\nwhile score<=r:\r\n if l<=score<=r:\r\n result.append(score)\r\n score*=k\r\nif len(result)==0:\r\n print(-1)\r\n exit()\r\nprint(*result,sep=' ')\r\n", "from math import log\r\nl,r,k=map(int,input().split())\r\nh=int(log(l)/log(k))\r\nm=1\r\nfor i in range(h,1000000):\r\n if(k**i>=l and k**i<=r):\r\n print(k**i,end=' ')\r\n m=0\r\n elif(k**i>r):\r\n break\r\nif(m):\r\n print(-1)", "import math\r\nstring = input()\r\na, b, n = map(int, string.split())\r\np = 0\r\nwhile n ** p < a:\r\n p += 1\r\nq = 0\r\nwhile n ** q < b:\r\n q += 1\r\nif n ** q > b:\r\n q -= 1\r\nif p > q:\r\n print(-1)\r\nelse:\r\n for x in range(p, q + 1):\r\n print(n ** x, end = \" \")", "user_input = str(input()).split()\r\nl = int(user_input[0])\r\nr = int(user_input[1])\r\nk = int(user_input[2])\r\ni = 0\r\nis_there = False\r\nwhile True:\r\n k_power = k ** i\r\n if l <= k_power <= r:\r\n is_there = True\r\n print(k_power, end=' ')\r\n i += 1\r\n if k_power > r:\r\n break\r\nif not is_there:\r\n print(-1)\r\nprint()", "limMin, limMax, number = input().split()\nlimMin = int(limMin)\nlimMax = int(limMax)\nnumber = int(number)\n\nindex = 0\npowered = []\nwhile(number**index <= limMax):\n if(number**index >= limMin):\n powered.append(number**index)\n index += 1\n\nif(len(powered) < 1): print(-1)\nelse:\n result = \"\"\n for i in range(len(powered)):\n result = result + str(powered[i])\n if(i < len(powered) -1): result = result + \" \"\n\n print(result)\n\t\t\t\t\t \t \t \t \t \t\t\t\t \t\t\t \t\t\t\t", "from sys import stdin\n\n\ndef readints():\n return [int(i) for i in stdin.readline().split()]\n\n\ndef main():\n l, r, k = readints() \n\n num = 1\n counter = 0\n while num <= r:\n if l <= num <= r:\n print(num, end=\" \")\n counter += 1\n num *= k\n \n if not counter:\n print(-1, end=\" \")\n\n print()\n\n\nif __name__ == \"__main__\":\n main()\n\n", "l, r, k = map(int, input().split())\n\ni = 1\nans = 0\nwhile i<=r:\n\tif l<=i<=r:\n\t\tprint(i)\n\t\tans += 1\n\ti*=k;\n\nif not ans:\n\tprint(-1)\n", "l,r,k=map(int,input().split(' '))\n\np=k\nk=1\nflag=0\nwhile k<=r:\n if k>=l:\n flag=1\n print(\"%d \"%(k),end=' ')\n k*=p\nif flag==0:\n print(\"-1\")\n\t \t\t \t\t\t\t \t\t \t \t \t\t", "a,b,n=map(int,input().split())\r\nk=0\r\nfor i in range(200):\r\n\tif n**i>=a and n**i<=b:\r\n\t\tprint(n**i,end=\" \")\r\n\t\tk=1\r\nif k==0:\r\n\tprint(-1)", "l, r, k = map(int, input().split())\nok = True\nfor i in range(0, 60):\n\tif k ** i >= l:\n\t\tif k ** i <= r:\n\t\t\tok = False\n\t\t\tprint(str(k ** i), end = ' ')\n\nif ok == True:\n\tprint(-1)", "b,c,a=map(int,input().split())\r\nk=0\r\nfor i in range(0,1000):\r\n if(pow(a,i)>=b and pow(a,i)<=c):\r\n print (pow(a,i))\r\n k=k+1\r\nif k==0 :\r\n print (\"-1\")", "\r\nstr = input ().split ()\r\n\r\nl = int (str[0])\r\nr = int (str[1])\r\nk = int (str[2])\r\n\r\naux = 1;\r\n\r\nwhile (aux < l) : aux *= k\r\n\r\ncont = 0\r\n\r\nwhile (aux <= r) :\r\n\tif (cont > 0) : print (end = ' ')\r\n\tprint (aux, end = '')\r\n\tcont = cont + 1\r\n\t\r\n\taux *= k;\r\n\t\t\r\nif (cont == 0) : print (\"-1\")\r\nelse : print (\"\")\r\n", "l, r, k = input().split()\r\nl, r, k = int(l), int(r), int(k)\r\n\r\nexponent = 1\r\npowers = list()\r\nwhile exponent <= r:\r\n if exponent >= l:\r\n powers.append(exponent)\r\n exponent *= k\r\n\r\nif not len(powers):\r\n powers.append(-1)\r\n\r\noutput = \"\"\r\nfor i in powers:\r\n output += str(i) + \" \"\r\nprint(output[:-1:])\r\n", "l, r, k = map(int, input().split())\r\nans = 1\r\noutput = \"\"\r\nwhile ans <= r:\r\n if ans >= l:\r\n \toutput = output + str(ans) + \" \"\r\n ans = ans * k\r\nif output == \"\":\r\n print(\"-1\")\r\nelse:\r\n\tprint(output)", "l, r, k = map(int, input().split())\r\ns = 1\r\nok = 0\r\nwhile s <= r:\r\n if s >= l:\r\n print(s, end = \" \")\r\n ok = 1\r\n s *= k\r\nif ok == 0:\r\n print(-1)", "import math\nl,r,k = [int(item) for item in input().split()]\na=0\nfor i in range(100):\n p = k ** i\n if(p>= l and p<=r):\n print(p)\n a+=1\n elif(p>r):\n break\nif(a==0):\n print(-1)\n \t\t \t\t\t \t \t\t \t \t", "from math import log\r\nl,r,k = map(int,input().split())\r\nstart=int(log(l,k))\r\nans=[]\r\nif k**start<l:\r\n start+=1\r\nwhile (k**start)<=r:\r\n ans.append(str(k**start))\r\n start+=1\r\nif len(ans)==0:\r\n ans.append(\"-1\")\r\nprint(' '.join(ans))", "\r\na,b,c=map(int,input().split())\r\ns=1\r\nm=1\r\nwhile s<=b:\r\n if s>=a and s<=b:\r\n print(s)\r\n m=0\r\n \r\n s*=c\r\n\r\nif m==1:\r\n print(-1)", "\"\"\"\n author : soumik \n created : January 04, 2021 9:16 AM\n Problem Name : -X-\n Problem Url : -X-\n Problem Limit : NULL , NULL\n Problem Url : -X-\n @genarated by : ai-virtual-assistant\n \n\"\"\"\n\nl,r,k= map(int,input().split())\npower = 1\ncheck =False\n\nwhile power<=r:\n if power<=r and power>=l:\n print(power,end=\" \")\n check=True\n power *=k\n\nif check==False:\n print(-1)\n\t\t\t\t\t \t \t \t \t \t \t\t \t \t\t \t\t", "l , r , k = map(int , input().split())\r\nK = k\r\nk = 1\r\ncnt = 0\r\nwhile k <= r:\r\n\tif k >= l:\r\n\t\tprint(k , end = ' ')\r\n\t\tcnt+=1\r\n\tk *= K\r\nif cnt == 0:\r\n\tprint(-1)", "l,r,k=map(int,input().split(' '))\ni=0\nwhile(1):\n if(pow(k,i)<l and pow(k,i+1)>r):\n print(-1)\n break\n if(pow(k,i)>=l and pow(k,i)<=r):\n print(pow(k,i),end=' ')\n if(pow(k,i)<=r and pow(k,i+1)>r):\n break \n i+=1\n\n \t \t\t \t\t\t \t\t \t \t \t \t \t \t \t \t", "import math\r\nk=0\r\n(a,c,b)=map(int,input().split())\r\nm=int(math.log(a,b))\r\nif a==1 and c==243 and b==3:\r\n print(\"1 3 9 27 81 243\")\r\nelse:\r\n if b**m<a:\r\n m=m+1\r\n n=int(math.log(c,b))\r\n if b**n>c:\r\n n=n-1\r\n for i in range(m,n+1):\r\n print(b**i,end=\" \")\r\n k=1\r\n if k==0:\r\n print(\"-1\")\r\n", "l, r, k = tuple(map(int, input().split()))\n\na = 1\nc = 0\nwhile a <= r:\n\tif a >= l and a <= r:\n\t\tprint(a, end = \" \")\n\t\tc += 1\n\ta = a * k\n\nif c == 0:\n\tprint(-1)\n", "def tree(l, r, k):\r\n t, lst = 1, list()\r\n for i in range(80):\r\n if l <= t <= r:\r\n lst.append(t)\r\n t *= k\r\n if not lst:\r\n return [-1]\r\n return lst\r\n\r\n\r\nL, R, K = [int(i) for i in input().split()]\r\nprint(*tree(L, R, K))\r\n", "def solve(a,b,c):\r\n ans=[]\r\n tmp=1\r\n while tmp<=b:\r\n if tmp>=a:\r\n ans.append(tmp)\r\n if tmp<=b//c+22:\r\n tmp*=c\r\n else:\r\n break\r\n if len(ans)==0:\r\n return -1\r\n fn=''\r\n for i in range(len(ans)):\r\n fn+=str(ans[i])\r\n if i!=len(ans)-1:\r\n fn+=\" \"\r\n return fn\r\n\r\na,b,c=map(int,input().split())\r\nprint(solve(a,b,c))\r\n", "l, r, k = map (int, input().split())\r\ncnt = 0\r\n\r\nfor i in range (64) :\r\n\tp = pow (k, i)\r\n\tif p >= l and p <= r :\r\n\t\tcnt += 1\r\n\t\tprint (p, end = ' '); \r\n\tif p >= r :\r\n\t\tbreak;\r\n\r\nif cnt == 0 :\r\n\tprint (-1)", "l,r,k = map(int,input().split())\r\ni = 1\r\nok = False\r\nwhile(True):\r\n if(i > r):\r\n break\r\n if(i >= l and i <= r):\r\n ok = True\r\n print(i)\r\n i *= k\r\n \r\nif(ok == False):\r\n print(-1)", "l,r,k = map(int,input().split())\r\nans = []\r\nm = 1\r\nwhile (m<=r):\r\n if m>=l:\r\n ans.append(m)\r\n m = m*k\r\nif len(ans) == 0:\r\n print(-1)\r\nelse:\r\n print(*ans)", "l, r, k = map(int, input().split())\r\n\r\nx = 1\r\ncnt = 0\r\nwhile (x <= r):\r\n if (x >= l):\r\n cnt += 1\r\n print(x)\r\n x *= k\r\n\r\nif (cnt == 0):\r\n print(-1)", "l, r, k = map(int, input().split())\r\nprint(*[k**i for i in range(65) if l <= k**i <= r] or [-1])", "l , r , k = map(int,input().split()); s = []; a=1\r\nwhile a<l : a*=k\r\nwhile a<= r : s.append(a);a*=k\r\nif s : print(*s)\r\nelse : print(-1)\r\n\r\n", "l,r,k = map(int,input().split(' '))\r\nnow = 1\r\nf = 0\r\nwhile now <= r:\r\n if now <= r and now >= l:\r\n print(now,end=' ')\r\n f = 1\r\n now = now * k\r\nif f == 0:\r\n print(-1)", "l, r, k = map(int, input().split())\nx = list(filter(lambda t: l <= int(t) <= r, [str(k**i) for i in range(256)]))\nif len(x)==0:\n print(-1)\nelse:\n print(' '.join(x))\n", "l, r, k = map(int, input().split())\r\ncur = 1\r\nans = []\r\nwhile cur <= r:\r\n if cur >= l:\r\n ans.append(cur)\r\n cur *= k\r\nif len(ans) == 0:\r\n print(-1)\r\nelse: \r\n print(*ans)", "l,r,k = input().split()\r\nf=0\r\nt=int(1)\r\nl,r,k=int(l),int(r),int(k)\r\nwhile (t<=r):\r\n if(t>=l):\r\n f=1\r\n print(t)\r\n t*=k;\r\nif (0==f):\r\n print(-1)", "l,r,k=map(int,input().split())\r\nprint(*[k**i for i in range(65)if l<=k**i<=r]or[-1])", "l,r,k = map(int,input().split())\r\nans =[]\r\nif l==1:\r\n\tans.append(1)\r\ni = k\r\nwhile i<=r:\r\n\tif l <= i:\r\n\t\tans.append(i)\r\n\ti*=k\r\nif len(ans)==0:\r\n\tprint(-1)\r\nelse:\r\n\tfor el in ans:\r\n\t\tprint(el,end=\" \")", "l,r,k = map(int,input().split())\r\n\r\ncurk = 1\r\nwhile curk<l:\r\n curk *= k\r\n\r\nans = 0\r\n\r\nwhile curk <= r:\r\n ans += 1\r\n print(curk,end=' ')\r\n curk *= k\r\n\r\nif not ans:\r\n print(-1)\r\nelse:\r\n print()\r\n", "\r\n# Online Python - IDE, Editor, Compiler, Interpreter\r\nimport sys\r\nl, r, k = input().split()\r\nl = int(l)\r\nr = int(r)\r\nk = int(k)\r\nnext = 1\r\n\r\nwhile (next < l):\r\n next *= k\r\nif (next > r):\r\n print(-1)\r\n sys.exit()\r\nwhile (next <= r):\r\n print(next, end = ' ')\r\n next *= k\r\n", "l,r,k=map(int,input().split())\r\nx=1\r\nans=0\r\nf=0\r\nwhile x<=r:\r\n if l<=x and x<=r:\r\n print(x, end=' ')\r\n f=1\r\n if x<= (r//k):\r\n x=x*k\r\n else:\r\n break\r\nif f==0:\r\n print('-1')", "inp = input()\ninp = list(inp.split())\n\nl = int(inp[0])\nr = int(inp[1])\nk = int(inp[2])\n\ncont = 0\nsaida = ''\nwhile True:\n if (k ** cont) > r: break\n if (k ** cont) >= l:\n saida += str(k ** cont) + ' '\n cont += 1\n\nif saida == '':\n print('-1')\nelse:\n print(saida.strip())\n\n\t \t\t\t \t \t \t\t\t \t \t \t\t\t", "a = [int(x) for x in input().split()]\r\nx, y, z = a[0], a[1], a[2]\r\nr = 1\r\nv = []\r\nwhile(r <= y):\r\n if(r >= x):\r\n v.append(r)\r\n\r\n r *= z\r\n\r\nif(len(v) == 0):\r\n print (\"-1\")\r\nelse:\r\n print(*v)\r\n", "l, r, k = map(int, input().split())\nnow = 1\nans = 0\nwhile now <= r:\n if l <= now:\n ans = 1\n print(now, end=' ')\n now *= k\nif ans == 0:\n print(-1)\n", "l, r, k = map(int, input().split())\r\np = 1\r\nwhile p < l:\r\n p *= k\r\nans = []\r\nwhile p <= r:\r\n ans.append(p)\r\n p *= k\r\nn = len(ans)\r\nif n == 0:\r\n print(\"-1\")\r\nelse:\r\n print(\" \".join(list(map(str, ans))))\r\n", "l, r, k = map(int, input().split())\r\nlb, lbe = 1, 0\r\nwhile lb < l:\r\n lb *= k\r\n lbe += 1\r\nrb, rbe = 1, 0\r\nwhile rb < r:\r\n rb *= k\r\n rbe += 1\r\nif rb > r:\r\n rb //= r\r\n rbe -= 1\r\nif lbe > rbe:\r\n print(-1)\r\nelse:\r\n for i in range(lbe, rbe + 1):\r\n print(k ** i, end=' ')\r\n print()", "raw = input()\nnum = [int(n) for n in raw.split(' ')]\na = num[0]\nb = num[1]\nc = num[2]\nflag = 0\nfor i in range(10**3):\n\tif c**i>=a and c**i<=b:\n\t\tprint(\"%d \" % (c**i))\n\t\tflag = 1\nif flag == 0:\n\tprint(\"-1\")\n \t\t\t \t \t\t \t \t\t \t\t\t\t \t\t\t\t\t", "from decimal import *\r\n\r\nimport math\r\n\r\ndef main():\r\n\t(l, r, k) = (int(x) for x in input().split())\r\n\tsolver(l, r, k)\r\n\r\ndef solver(l, r, k):\r\n\tgetcontext().prec = 40\r\n\tdl = Decimal(l)\r\n\tdr = Decimal(r)\r\n\tdk = Decimal(k)\r\n\tstart = math.ceil(dl.ln() / dk.ln())\r\n\traw2 = dr.ln() / dk.ln()\r\n\tif almostEqual(raw2, int(raw2) + 1):\r\n\t\tend = int(raw2) + 2\r\n\telse:\r\n\t\tend = int(raw2) + 1\r\n\tif start >= end:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tfor power in range(start, end):\r\n\t\t\tprint(pow(k, power), end = \" \")\r\n\t\tprint()\r\n\r\ndef almostEqual(x, y):\r\n\treturn abs(x - y) < 10**-30\r\n#getcontext().prec = 25\r\n#print(Decimal(999999999999999999).ln() / Decimal(1000000000).ln())\r\n\r\n#print(math.log(Decimal(999999999999999999), Decimal(1000000000)))\r\n#solver(1, 15, 2)\r\n#print(solver(1, 24, 5))\r\n#print(solver(1, 999999999999999999, 1000000000))\r\nmain()", "l,r,k = map(int,input().split())\r\nprint(*([k**i for i in range(64) if l<=k**i<=r] or [-1]))", "l,r,k = list(map(int,input().split()))\n\ncur=1\nwhile cur < l:\n cur *= k\n\nif cur > r:\n print(-1)\nelse:\n res = []\n while (cur <= r):\n res.append(cur)\n cur *= k\n print(' '.join(map(str,res)))\n", "l,r,k =map(int,input().split())\r\nres = []\r\na = 1\r\nwhile(a<l):\r\n\ta*=k\r\nwhile(a<=r):\r\n\tres.append(a)\r\n\ta*=k\r\n\r\nif(len(res)==0):\r\n\tprint(\"-1\")\r\nfor i in res:\r\n\tprint(i,end=\" \")", "inp = [int(c) for c in input().split(\" \")]\n\nl = inp[0]\nr = inp[1]\nk = inp[2]\n\nactual = 0\n\npowers = []\n\nwhile True: \n if k ** actual > r:\n break\n if l <= k ** actual <= r:\n powers.append(k ** actual)\n actual += 1\n\nif len(powers) == 0:\n print(\"-1\")\nelse:\n for n in powers:\n if n != powers[-1]:\n print(\"%d \" % n, end=\"\")\n else:\n print(\"%d\" % powers[-1])", "n = 3\ns = [int(x) for x in input().split()] # 一行输入的数组\n# for i in s:\n# print(i)\nflag = 1\nnow = 1\nwhile now < s[0]:\n now = now * s[2]\nwhile now <= s[1]:\n print(now, end=\" \")\n flag = 0\n now = now * s[2]\n\nif flag:\n print(\"-1\")\n\n\t \t \t\t\t\t\t\t \t \t \t\t\t\t \t\t\t\t\t\t\t\t", "l,r,k=map(int,input().split())\r\nans=[]\r\nkk=1\r\nwhile kk<=r:\r\n if l<=kk<=r: ans+=[str(kk)]\r\n kk*=k\r\nif ans==[]: ans+=['-1']\r\nprint(' '.join(ans))", "from math import floor, log\nl,r,k=input().split()\nl=int(l)\nr=int(r)\nk=int(k)\nans=[]\ns=floor(log(l,k))\nwhile (k**s<=r):\n if k**s>=l:\n ans.append(k**s)\n s=s+1\nif (len(ans)==0):\n print(-1)\nelse:\n print(*ans)\n \t \t \t \t \t \t \t\t\t \t", "l,r,k = map(int,input().split())\r\nli = []\r\nfor i in range(0,r):\r\n\tp = k**i\r\n\tif l <= p <= r :\r\n\t\tli.append(p)\r\n\telse:\r\n\t\tif p > r:\r\n\t\t\tbreak\r\n\r\nif len(li) == 0 :\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(' '.join(map(str,li)))", "l, r, k=map(int, input().split())\r\nx=1\r\ncount=0\r\nli=[]\r\nwhile x<=r:\r\n if x>=l:\r\n li.append(x)\r\n x=x*k\r\nif len(li)>0:\r\n print(*li)\r\nelse:\r\n print(-1)", "l,r,k = map(int,input().split())\r\nli = [k**i for i in range(100) if k**i >= l and k**i <= r]\r\nif len(li) == 0:\r\n print(-1)\r\nelse:\r\n print(' '.join([str(s) for s in li]))", "l, r, k = map(int, input().split())\r\nnow = 1\r\nok = 0;\r\nwhile(now <= r):\r\n\tif(now >= l):\r\n\t\tprint(now,' ')\r\n\t\tok = 1;\r\n\tnow *= k\r\nif(ok == 0):\r\n\tprint(-1)", "s = input().split()\r\nl = int(s[0])\r\nr = int(s[1])\r\nk = int(s[2])\r\nok = 0\r\nfor i in range(0, 62):\r\n if (k ** i >= l and k ** i <= r):\r\n ok = 1\r\n print(k ** i, end=\" \")\r\nif (ok == 0):\r\n print(-1)", "l, r, k = map(int, input().split())\r\n\r\np = 1\r\nwhile (p < l):\r\n p *= k\r\n\r\ncnt = 0\r\nwhile (p <= r):\r\n print(p, end=' ')\r\n p *= k\r\n cnt += 1\r\n \r\nif (cnt == 0):\r\n print(-1)", "l, r, k = map(int, input().split())\n\nv = 1\nout = []\nwhile v <= r:\n if v >= l:\n out.append(v)\n v *= k\n\nif out:\n print(*out)\nelse:\n print(-1)\n", "l, r, k = map(int, input().split())\r\np = 1\r\nf = 0\r\nwhile p <= r:\r\n if l <= p <= r:\r\n f = 1\r\n print(p, end=' ')\r\n p *= k\r\nif f != 1:\r\n print(-1)", "l, r, k = [int(x) for x in input().split()]\r\na = 1\r\nok = False\r\nwhile a <= r:\r\n\tif a >= l:\r\n\t\tok = True\r\n\t\tprint(a, end = ' ')\r\n\ta = a * k\r\nif ok == False:\r\n\tprint(-1)", "import math\nl, r, a = list(map(int, input().split()))\ni = 0\nflag = False\nwhile True:\n tmp = a ** i\n if l <= tmp and tmp <= r:\n flag = True\n print(tmp, end = \" \")\n else:\n if tmp > r:\n break\n i += 1\nif flag == 0:\n print(-1)\n\n\t \t \t \t \t \t\t\t\t\t \t \t" ]

[ "import io , os , sys\r\n\r\ninput = io . BytesIO ( os . read ( 0 , os . fstat ( 0 ) . st_size ) ) . readline\r\n\r\ndef print ( *values , sep = \" \" , end = \"\\n\" ) :\r\n sep = str ( sep )\r\n end = str ( end )\r\n for i in range ( len ( values ) -1 ) :\r\n sys.stdout.write( str( values[i] ) )\r\n sys.stdout.write( sep )\r\n if values :\r\n sys.stdout.write( str( values[-1] ) )\r\n sys.stdout.write( end )\r\n\r\n\r\nn , m = map( int , input () . decode ( ) .split () )\r\nE = [ [] for i in range ( m ) ]\r\n\r\nfor i in range ( m ) :\r\n a,b,c = map( int , input () . decode ( ) .split () )\r\n a-= 1; b -= 1 ; c -= 1\r\n E[c].append((a,b))\r\n\r\nq = int ( input () . decode ( ) )\r\nlq = q\r\nQ = {}\r\nfor qq in range ( q ) :\r\n u,v = map( int , input () . decode ( ) .split () )\r\n u -= 1 ; v -= 1\r\n if (u,v) not in Q: Q[(u,v)] = [0,qq]\r\n else : Q[(u,v)].append(qq)\r\n\r\n\r\nfor c in range ( m ) :\r\n \r\n if len(E[c]) == 0 : continue\r\n \r\n C = {}\r\n \r\n S = set()\r\n for v in E[c] :\r\n a,b = v\r\n S.add(a)\r\n S.add(b)\r\n if a in C : C[a].append(b)\r\n else : C[a] = [b]\r\n if b in C : C[b].append(a)\r\n else : C[b] = [a] \r\n \r\n V = {}\r\n for s in S : V[s] = -1\r\n \r\n for v in V :\r\n \r\n if V[v] != -1 : continue\r\n \r\n cur = [v]\r\n V[v] = v\r\n while cur:\r\n curr = []\r\n for cu in cur :\r\n for c in C[cu] :\r\n if V[c] != -1 : continue\r\n V[c] = v\r\n curr += [c]\r\n cur = curr\r\n \r\n \r\n \r\n D = {}\r\n \r\n for v in V :\r\n if V[v] in D : D[V[v]].append(v)\r\n else : D[V[v]] = [v]\r\n \r\n for d in D :\r\n if len(D[d]) <= 600 :\r\n for a in D[d] :\r\n for b in D[d] :\r\n if (a,b) in Q :\r\n Q[(a,b)][0] += 1\r\n \r\n else :\r\n for q in Q :\r\n if q[0] in V and q[1] in V :\r\n if V[q[0]] == V[q[1]] and V[q[0]] == d :\r\n Q[q][0] += 1\r\n\r\n\r\n\r\nAns= [0] * lq\r\nfor q in Q :\r\n for i in range(1,len(Q[q])) :\r\n Ans[Q[q][i]] = Q[q][0]\r\n\r\nfor ans in Ans : print(ans)\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n" ]

[ "n, m, k = map(int, input().split())\r\nv = list(map(int, input().split()))\r\n\r\navailable = 0\r\nv.sort(reverse = True)\r\nans = -1\r\n\r\nif k >= m:\r\n ans = 0\r\nelse:\r\n for i in range(n):\r\n if i < k:\r\n available += v[i]\r\n else:\r\n available += v[i]-1\r\n if(available + max(0, k-i-1) >= m):\r\n ans = i+1\r\n break\r\n\r\nprint (ans)\r\n\r\n\r\n\r\n\r\n", "params = input().split()\nfs, devices, holes = map(int, params)\nfilters = list(map(int, input().split()))\n\nfilters.sort(reverse=True)\n\nfilt_num = 0\n\ncount = 0\nwhile devices > holes and filt_num < fs:\n holes += (filters[filt_num] - 1)\n filt_num += 1\n count += 1\n\nif filt_num == fs and devices > holes:\n print(-1)\nelse:\n print(count)\n\n", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\na = a[::-1]\r\n\r\nif m <= k:\r\n print(0)\r\n\r\nelse:\r\n summ = k\r\n f = 1\r\n ans = 0\r\n for i in range(n):\r\n summ += a[i] - 1\r\n ans += 1\r\n if summ >= m:\r\n break\r\n if i == n-1:\r\n f = 0\r\n if f == 0:\r\n print(-1)\r\n\r\n else:\r\n print(ans)\r\n\r\n \r\n \r\n \r\n", "n,m,k=map(int,input().split())\nsupply_line=sorted(list(map(int,input().split()))[:n],reverse=True)\nif k>=m:\n print(0)\nelse:\n for i in range(len(supply_line)):\n k-=1\n k+=supply_line[i]\n if k>=m:\n print(i+1)\n break\n if k<m: print(-1)", "I = lambda: map(int, input().split())\r\n\r\nn, m, k = I()\r\nm -= k\r\nx = 0\r\n\r\nfor i,a in enumerate(sorted(I(), reverse=True)):\r\n if m <= 0:\r\n print(i)\r\n break\r\n m -= a-1\r\nelse:\r\n print(-1 if m > 0 else n)", "n,m,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse = True)\r\ns = k\r\nc = 0\r\nwhile (s<m and n>c):\r\n s = s+l[c]-1\r\n c = c+1\r\nif (s>=m):\r\n print(c)\r\nelse:\r\n print('-1')\r\n", "list1=input()\r\nl=list1.split()\r\nl=[int(item) for item in l]\r\n\r\nn,m,k=l\r\n\r\na=input()\r\na1=map(int,a.split())\r\n\r\na1=list(sorted(a1))\r\n\r\ncount=0\r\nfor i in range(len(a1)):\r\n if k>=m:\r\n break\r\n else:\r\n k+=a1.pop()-1\r\n count+=1\r\n\r\nif k>=m: \r\n print(count)\r\nelse:\r\n print(\"-1\")", "n,m,k = map(int, input().split())\r\n*l, = sorted(map(int, input().split()), reverse=True)\r\nif k >= m:\r\n print(0)\r\nelse:\r\n i = 0\r\n s = k\r\n while i < n and s < m:\r\n s += l[i]-1\r\n i += 1\r\n if s < m:\r\n print(-1)\r\n else:\r\n print(i)", "\r\nn,m,k=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort(reverse=True)\r\nc=0\r\ni=0\r\n\r\nwhile(k<m and i<n):\r\n k+=list1[i]-1\r\n i+=1\r\n c+=1\r\nif(k>=m):\r\n print(c)\r\nelse:\r\n print(-1)", "n, m, k = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\ni, res = 0, 0\r\narr = sorted(arr, reverse=True)\r\nwhile i < n and k < m:\r\n k += arr[i] - 1\r\n res += 1\r\n i += 1\r\nprint(-1 if k < m else res)\r\n", "n, m, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\na.reverse()\r\nt = k\r\nans = 0\r\nd = False\r\nif t >= m:\r\n d = True\r\nif not d:\r\n ans = -1\r\n for i in range(n):\r\n t += a[i] - 1\r\n if t >= m:\r\n ans = i + 1\r\n flag = True\r\n break\r\nprint(ans)\r\n", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl=l[::-1]\r\nc=0\r\ni=0\r\nwhile k<m and i<n: \r\n k+=l[i]-1\r\n i+=1\r\nif k>=m:print(i)\r\nelse:print(-1)", "f, u, r = map(int, input().split())\r\nfr = list(sorted(map(int, input().split()), reverse=True))\r\nk = 0\r\nwhile k < f and r < u:\r\n r += fr[k] - 1\r\n k += 1\r\n\r\nprint(-1 if r < u else k)\r\n\r\n", "n, m, k = map(int, input().split())\r\nfor i, a in enumerate(sorted(map(int, input().split()), reverse=True)):\r\n if k >= m:\r\n print(i)\r\n exit()\r\n k += a - 1\r\nprint(n if k >= m else -1)", "n,m,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\narr=arr+[k]\r\nans=0\r\ns=0\r\nwhile ans<n+1:\r\n s+=arr[-ans-1]\r\n if s>=m:\r\n break\r\n ans+=1\r\n s-=1\r\nif s>=m:\r\n print(ans)\r\nelse:\r\n print(\"-1\")\r\n", "n, m, k = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\na = [val for val in a if val>1]\r\na.sort(reverse=True)\r\n\r\nout_cnt = k\r\nl=0\r\n\r\nwhile l<=len(a):\r\n if out_cnt>=m:\r\n print(l)\r\n break\r\n elif l==len(a):\r\n print('-1')\r\n break\r\n else:\r\n out_cnt += a[l] - 1\r\n l+=1", "n_extnson, n_dvics, n_sokts = list(map(int, input().split()))\r\nextensions = list(map(int, input().split()))\r\nextensions.sort(reverse=True)\r\ndevices_left = n_dvics - n_sokts\r\nextnson_used = 0\r\ni = 0\r\nwhile devices_left > 0 and n_extnson > 0:\r\n devices_left += 1\r\n extnson_siez = extensions[i]\r\n devices_left -= extnson_siez\r\n extnson_used += 1\r\n n_extnson -= 1\r\n i += 1\r\n\r\nif devices_left > 0:\r\n print(-1)\r\nelse:\r\n print(extnson_used)\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\nw = sorted(map(int, input().split()), reverse=True)\r\n\r\nc = 0\r\nwhile m > k:\r\n k += w[c] - 1\r\n c += 1\r\n if c == len(w):\r\n break\r\nif m > k:\r\n print(-1)\r\nelse:\r\n print(c)", "a,b,c=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nif b<=c:\r\n print(0)\r\nelse:\r\n \r\n l.sort(reverse=True)\r\n d=0\r\n f=1\r\n for i in l:\r\n c+=i-1\r\n d+=1\r\n if b<=c:\r\n print(d)\r\n f=0\r\n break\r\n if f==1:\r\n print(-1)", "n,m,k=map(int,input().split())\r\ncount=0\r\na=[(int(x)-1) for x in input().split()]\r\na.sort()\r\nif m > k:\r\n for i in range(n-1,-1,-1):\r\n k+=a[i]\r\n if k >=m :\r\n k= n-i\r\n break\r\n if i == 0:\r\n k=-1\r\n print(k)\r\nelse:\r\n print(0)", "n, m, k = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input(' ').split(' ')]\r\na.sort(reverse=True)\r\n\r\nif m <= k:\r\n print(0)\r\nelse:\r\n u = 0\r\n for r in a:\r\n u += 1\r\n k += r - 1\r\n if m <= k:\r\n break\r\n if m <= k:\r\n print(u)\r\n else:\r\n print(-1)", "\r\nn,m,k = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\n\r\na.sort(reverse = True)\r\nsum1 = k\r\nif(k>= m):\r\n print(0)\r\n exit()\r\ni=0 \r\nwhile(i<n and sum1<m):\r\n sum1 += a[i] - 1\r\n i+=1\r\n\r\nif(sum1>=m):\r\n print(i)\r\nelse:\r\n print(-1)\r\n\r\n \r\n\r\n\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\nn,m,k=RI()\r\nl=RI()\r\n\r\nl.sort(reverse=True)\r\n\r\nif(m<=k):\r\n print(0)\r\nelse:\r\n extra=m-k\r\n i=0\r\n ans=0\r\n while(extra>0 and i<n):\r\n extra-=(l[i]-1)\r\n ans+=1\r\n i+=1\r\n if(extra<=0):\r\n print(ans)\r\n else:\r\n print(-1)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\na = a[::-1]\r\nif m<=k:\r\n print(0)\r\nelse:\r\n c=0\r\n while(c<n):\r\n k = k+a[c]-1\r\n c+=1\r\n if k>=m:\r\n print(c)\r\n exit()\r\n else:\r\n print(-1)\r\n ", "n, m, k = map(int, input().split())\r\nif n==1:\r\n filters = [int(input())]\r\nelse:\r\n filters = sorted(list(map(int, input().split())), reverse=True)\r\nif m<=k:\r\n print(0)\r\n exit()\r\nm -= k-1\r\nfor i in range(n):\r\n if filters[i]>=m:\r\n m = 0\r\n break\r\n else:\r\n m -= filters[i]-1\r\nif m:\r\n print(-1)\r\nelse:\r\n print(i+1)\r\n \r\n", "n, m, k = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.sort()\r\nans = 0\r\nif k < m:\r\n spots = k\r\n end = n-1\r\n while spots < m and end >= 0:\r\n spots += f[end]-1\r\n ans += 1\r\n end -= 1\r\n if spots<m:\r\n print(-1)\r\n else:\r\n print(ans)\r\nelse:\r\n print(0)", "n,m,k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\na = sorted(a, reverse=True)\r\nif m <= k:\r\n print(0)\r\nelse:\r\n m -= k\r\n i = -1\r\n while m > 0 and i < len(a)-1:\r\n i += 1\r\n m = m - a[i] + 1\r\n \r\n if m > 0:\r\n print(-1)\r\n else:\r\n print(i+1)", "n,m,k=map(int,input().split())\r\nsupply=sorted(list(map(int,input().split())),reverse=True)\r\nsockets=[]\r\ni=0\r\nwhile i<k :\r\n if m>k:\r\n if len(supply)>0:\r\n k+=supply[0]-1\r\n sockets.append(supply[0])\r\n del supply[0]\r\n else:\r\n break\r\n i+=1\r\n else:\r\n break\r\n \r\nif m>k:\r\n print(-1)\r\nelse:\r\n print(len(sockets))", "n,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\na.reverse()\r\nf=0\r\ncount=int(0)\r\nm=m-k if(m-k<=0) else m-k+1\r\nif(m<=0):\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n m=m-a[i]+1\r\n count=count+1\r\n if(m-1<=0):\r\n f=1\r\n break\r\n print(count) if(f==1) else print(-1)\r\n \r\n", "# cook your dish here\r\na,b,c = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\narr.sort()\r\np = 0\r\na-=1\r\nwhile(a>=0 and c<b):\r\n c-=1\r\n p+=1\r\n c+=arr[a]\r\n a-=1\r\nif(c<b):\r\n print(-1)\r\nelse:\r\n print(p)", "\r\ndef foo():\r\n n, m, k = map(int, input().split())\r\n a = map(int, input().split())\r\n a = sorted(a, reverse=True)\r\n\r\n if m <= k:\r\n print(0)\r\n return\r\n\r\n i = 0\r\n for x in a:\r\n k += x - 1\r\n i += 1\r\n if m <= k:\r\n print(i)\r\n return\r\n print(-1)\r\n\r\nfoo()\r\n", "\r\ns = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[2])\r\na = []\r\nmp = map(int,input().split())\r\nfor j in mp:\r\n a.append(j)\r\na.sort(reverse=True)\r\n\r\nif k>=m:\r\n print(0)\r\nelse:\r\n ans = -1\r\n count = 0\r\n total = 0\r\n sum = 0\r\n for j in range(n):\r\n count +=1\r\n sum+= a[j]\r\n total = k-count+sum\r\n if total>=m:\r\n break\r\n if total>=m:\r\n ans = count\r\n print(ans)\r\n\r\n", "n,m,k = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nlis = list(map(lambda x: x - 1,lis))\r\nlis.sort()\r\ndev = 0\r\nwhile k < m and len(lis) > 0:\r\n k = k + lis[-1]\r\n lis.pop(-1)\r\n dev = dev + 1\r\nif k < m:\r\n print(-1)\r\nelse:\r\n print(dev)", "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 supply, dev, sockets = IA()\r\n supply_sockets = IA()\r\n if dev <= sockets:\r\n return 0\r\n elif dev > sum(supply_sockets) and dev > sockets:\r\n return -1\r\n else:\r\n c = 0 \r\n supply_sockets.sort()\r\n total = 0\r\n i = supply-1\r\n for j in range(sockets):\r\n total+=supply_sockets[i]\r\n i-=1\r\n if total < dev:\r\n if sockets > 1:\r\n dev -= (sockets-1)\r\n sockets = 1 \r\n while dev and supply_sockets:\r\n if c!=0:\r\n cur = supply_sockets.pop()-1\r\n else:\r\n cur = supply_sockets.pop()\r\n c+=1\r\n dev -= cur \r\n if dev<=0:\r\n return c \r\n return -1\r\n else:\r\n while dev and sockets:\r\n c += 1\r\n cur = supply_sockets.pop()\r\n dev -= cur \r\n sockets -= 1\r\n if dev <= sockets:\r\n return c\r\n return c if (dev==0 and sockets>=0) else -1 \r\n\r\nif __name__ == '__main__':\r\n print(main())", "n,m,k= map(int,input().split())\r\nsockets = [int(s) for s in input().split()]\r\nsockets.sort()\r\n\r\nports = k\r\ncount = 0\r\nwhile ports < m and sockets:\r\n ports += sockets[-1] - 1\r\n sockets.pop()\r\n count += 1\r\n \r\nif ports >= m:\r\n print(count)\r\nelse:\r\n print(-1)", "n,m,k=[int(x) for x in input().split()];c1=0;n1=20\r\na=[int(x) for x in input().split()]\r\nwhile n1!=0:\r\n if k>=m:\r\n print(c1)\r\n exit()\r\n else:\r\n if len(a)>0 and k>0:\r\n k=k+max(a)-1\r\n a.remove(max(a))\r\n c1+=1\r\n n1-=1\r\nprint(-1)", "n, m, k = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\na.sort()\na.reverse()\nif k >= m:\n\tprint(0)\n\texit(0)\nfor i, x in enumerate(a):\n\tk += x - 1\n\tif k >= m:\n\t\tprint(i + 1)\n\t\texit(0)\nprint(-1)\n", "def minimum_supply_filter_needed():\r\n\tn_supply_filters, n_devices, n_sockets = map(int, input().split())\r\n\r\n\tif n_devices <= n_sockets:\r\n\t\tprint(0)\r\n\t\treturn\r\n\r\n\tfilter_capacity = [int(cap) for cap in input().split()]\r\n\tmax_capacity = sum(filter_capacity)+n_sockets-n_supply_filters\r\n\tif max_capacity < n_devices:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tfilter_capacity.sort(reverse=True)\r\n\t\ttotal_capacity = n_sockets\r\n\t\tfor index, cap in enumerate(filter_capacity):\r\n\t\t\ttotal_capacity += cap-1\r\n\t\t\tif total_capacity >= n_devices:\r\n\t\t\t\tprint(index+1)\r\n\t\t\t\tbreak\r\n\r\n\r\nminimum_supply_filter_needed()\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(reverse = True)\r\nnum = 0\r\nans = -1\r\n\r\n\r\nwhile m>k:\r\n\t\r\n\tif num>n-1:\r\n\t\tnum = -1\r\n\t\tbreak\r\n\tnum += 1\r\n\tk += a[num-1] - 1\r\n\t\r\nprint(num)", "n, m, k = map(int, input().split())\r\next = [int(k) for k in input().split()]\r\next.sort(reverse=True)\r\n# n extensores\r\n# m dispositivos\r\n# k tomas de corriente\r\npaso = True\r\ntomas = 0\r\nwhile (m > k):\r\n try:\r\n k += ext[tomas] -1 \r\n tomas +=1\r\n except:\r\n paso = False\r\n break \r\n\r\nif paso:\r\n print(tomas)\r\nelse:\r\n print(-1)\r\n", "n,m,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif(m<=k):\r\n print(0)\r\nelse: \r\n l.sort()\r\n c=0\r\n x=k\r\n while(k<m):\r\n k=k+max(l)-1\r\n l.remove(max(l))\r\n c=c+1\r\n if(len(l)==0):\r\n break\r\n if(k>=m):\r\n print(c)\r\n else:\r\n print(-1)\r\n \r\n \r\n", "a = [int(a) for a in input().split()]\r\nn, k, m= a[0],a[1],a[2]\r\nif k-m <= 0:\r\n print(0)\r\n exit()\r\nk=k-(m-1)\r\nc=0\r\nfor a in reversed(sorted([int(a) for a in input().split()])):\r\n c+=1\r\n if k-a <= 0:\r\n print(c)\r\n exit()\r\n else:\r\n k=k-(a-1)\r\nprint(-1)", "n,m,k=map(int,input().split())\r\nseq=list(map(int,input().split()))\r\n\r\nseq.sort()\r\n\r\nseq.reverse()\r\n\r\nif k>=m:\r\n print(0)\r\nelse:\r\n i=0\r\n count=0\r\n while True:\r\n if k>=m:\r\n print(count)\r\n break\r\n k-=1\r\n if i==n:\r\n print(-1)\r\n break\r\n k+=seq[i]\r\n i+=1\r\n count+=1\r\n \r\n \r\n", "n, m, k = map(int,input().split())\r\nline = [int(x) for x in input().split()]\r\nline.sort(reverse = True)\r\ncount = 0\r\nif k >=m:\r\n print(count)\r\n exit(0)\r\nfor i in range(n):\r\n k += line[i]-1\r\n count += 1\r\n if k >= m:\r\n print(count)\r\n exit(0)\r\nprint(-1)", "n, m, k = map(int, input().split())\r\n\r\nfilters = [int(i) for i in input().split()]\r\nfilters.sort()\r\n\r\nfilters_count = 0\r\n\r\nwhile k < m and filters:\r\n k += filters[-1] - 1\r\n filters.pop()\r\n filters_count += 1\r\n\r\nif k >= m:\r\n print(filters_count)\r\nelse:\r\n print(-1)# 1690476829.6164753", "def solve():\r\n n, m, k = input().split()\r\n n, m, k = int(n), int(m), int(k)\r\n\r\n a = sorted(list(map(int, input().split())))\r\n\r\n r = 0\r\n\r\n while m > k:\r\n if not a:\r\n return -1\r\n k += (a.pop() - 1)\r\n r += 1\r\n \r\n return r\r\n\r\n\r\nprint(solve())", "n,m,k=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nif sum(l1)-n+k<m:\r\n print(-1)\r\nelse :\r\n l1.sort()\r\n l1=l1[::-1]\r\n i=0\r\n while k<m:\r\n k+=l1[i]-1\r\n i+=1\r\n print(i)", "import sys\r\n\r\nn,m,k = map(int,input().split())\r\nlst = list(map(int,input().split())) \r\nlst.sort(reverse=True)\r\nif(m<=k):\r\n print(0)\r\n sys.exit()\r\n\r\ntmp = k\r\ni = 0\r\nwhile(m>tmp and i<n):\r\n tmp+=lst[i]-1\r\n i+=1\r\n\r\nprint(i if tmp>=m else -1)", "n,m,k=map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse=True)\r\n# l.reverse()\r\n# print(l)\r\nif m<=k:\r\n print(0)\r\n quit()\r\nfor ii,c in enumerate(l):\r\n k+=c-1\r\n # print(k)\r\n if k>=m:\r\n print('{}'.format(ii+1))\r\n quit()\r\nprint(-1)\r\n", "n,m,k=map(int,input().split()) #filt,ust,raz\r\na=sorted(list(map(int,input().split())),reverse=True)\r\nans=0\r\nfor i in range(n):\r\n if k>=m:break\r\n k+=a[i]-1\r\n ans+=1\r\nif k>=m:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "try: \r\n n, m, k = map(int,input().split())\r\n w = list(map(int,input().split()))\r\n w.sort()\r\n w = w[::-1]\r\n ans = 0\r\n while(k < m and ans < n):\r\n \tk += w[ans] - 1\r\n \tans += 1\r\n if(k >= m):\r\n \tprint(ans)\r\n else:\r\n \tprint(-1)\r\nexcept:\r\n pass ", "from sys import stdin\r\naux = list( map(int,stdin.readline().split()) )\r\nn = aux[0]\r\nm = aux[1]\r\nk = aux[2]\r\narr = list( map(int,stdin.readline().split()) )\r\narr.sort( reverse=True )\r\nans = 0\r\n\r\nif( m <= k ): m = 0\r\nelse: m -= k-1\r\nfor x in arr:\r\n\tif( m <= 0 ): break\r\n\tans += 1\r\n\tm -= x-1\r\n\tif( m == 1 ): m = 0\r\n\r\nif(m <= 0):\r\n\tprint(ans)\r\nelse:\r\n\tprint(-1)", "n,m,k=input().split()\r\nn=int(n)\r\nm=int(m)\r\nk=int(k)\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nl.reverse()\r\nz=k\r\nf=0\r\nwhile(z<m and f<n):\r\n\tz+=l[f]-1\r\n\tf+=1\r\nif(z>=m):\r\n\tprint(f)\r\nelse:\r\n\tprint(-1)\r\n", "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\nn, m, k = get_ints()\r\narr = get_list()\r\n\r\narr.sort(reverse=True)\r\nprefixSum = 0\r\n\r\nif m <= k:\r\n print(\"0\")\r\nelse:\r\n for i in range(n):\r\n prefixSum += arr[i]\r\n totalSockets = prefixSum - (i+1) + k\r\n if totalSockets >= m:\r\n print(i+1)\r\n break\r\n else:\r\n print(\"-1\")", "n, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = sorted(a)[::-1]\r\nans = k - 1\r\nif m <= k:\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n ans += a[i]\r\n if ans >= m:\r\n print(i+1)\r\n break\r\n ans -= 1\r\n else:\r\n print(-1)\r\n", "#!/usr/bin/python3\n\nn, m, k = tuple(map(int, input().split()))\na = reversed(sorted(map(int, input().split())))\n\nans = 0\nfor _ in a:\n if m <= k:\n break\n ans += 1\n m -= k - 1\n k = _\nprint(ans if m <= k else -1)\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort(reverse = True)\r\ni = 0\r\nres = 0\r\nwhile k<m and i<n:\r\n k+=a[i]-1\r\n i+=1\r\nif (k>=m):\r\n res = i\r\nelse: \r\n res = -1\r\nprint(res)\r\n\r\n", "n,m,k = map(int,input().split())\r\nl = sorted(list(map(int,input().split())), reverse=True)\r\nif (sum(l)+k) - len(l) < m or k == 0: print(-1); exit()\r\nx = 0\r\nwhile k < m:\r\n k += l[x]-1\r\n x += 1\r\nprint(x)", "n, m, k = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nr = [x for x in range(n + 1) if sum(a[n - x :]) + k >= m + x]\r\nprint(min(r) if r else -1)\r\n", "n, m, k = map(int, input().split())\r\nflag = False\r\nfor i, a in enumerate(sorted(map(int, input().split()), reverse=True)):\r\n if k >= m:\r\n print(i)\r\n flag = True\r\n break\r\n k += a - 1\r\nif not flag:\r\n if k >= m:\r\n print(n)\r\n else:\r\n print(-1)", "[n, m, k] = input().split()\nn=int(n)\nm=int(m)\nk=int(k)\n\ndata = [int(i) for i in input().split()]\nans = 0\nfor i in reversed(sorted(data)):\n if k < m:\n k += int(i) -1\n ans += 1\n else:\n break\n\nif k < m:\n ans = -1\n\nprint(ans)", "from sys import stdin\r\nimport functools\r\nimport math\r\n\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\n_, dev, sockets = read()\r\n\r\ndev -= sockets\r\na = sorted(list(read()))\r\nans = 0\r\nwhile dev > 0 and len(a) > 0:\r\n dev -= a.pop()-1\r\n ans += 1\r\n \r\nif dev > 0:\r\n print(\"-1\")\r\nelse:\r\n print(ans)\r\n \r\n", "\r\nimport sys\r\n\r\nn, m, k = tuple(int(s) for s in sys.stdin.readline().split(\" \"))\r\n\r\nfilters = [ int(a) for a in sys.stdin.readline().split(\" \") ]\r\n\r\nif m <= k:\r\n\tprint(0)\r\n\tsys.exit()\r\n\r\ncount = 0\r\nfilters.sort(reverse=True)\r\n\r\nfor f in filters:\r\n\tk = k + f - 1\r\n\tcount = count + 1\r\n\tif m <= k:\r\n\t\tprint(count)\r\n\t\tsys.exit()\r\nelse:\r\n\tprint(-1)", "## int(input())\r\nn, m, k = tuple(map(int, input().split()))\r\na = reversed(sorted(map(int, input().split())))\r\nrs = 0\r\nfor _ in a:\r\n if m <= k:\r\n break\r\n rs += 1\r\n m -= k - 1\r\n k = _\r\nprint(rs if m <= k else -1)", "from bisect import bisect_left\r\nn,m,k=tuple(map(int,input().split()))\r\na=sorted(map(int,input().split()),reverse=True)\r\ns=[k]+[0]*n\r\nfor i in range(n):\r\n s[i+1]=s[i]+a[i]-1\r\nans = bisect_left(s,m)\r\n\r\nprint(ans if ans <= n else -1)\r\n", "n,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\na.sort(reverse=True)\r\nans=0\r\ni=0\r\nc=0\r\nwhile(i<n and c<m):\r\n if k>=(m-c):\r\n c+=m-c\r\n break\r\n if k<=0:\r\n c+=(a[i]-1)\r\n else:\r\n c+=a[i]\r\n \r\n i+=1\r\n ans+=1\r\n k-=1\r\nif(c>=m):\r\n print(ans)\r\nelse:\r\n print(-1)\r\n ", "import sys\r\nimport math\r\n\r\nn, m, k = [int(x) for x in (sys.stdin.readline()).split()]\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nan.sort(reverse = True)\r\n\r\nres = 0\r\ni = 0\r\nwhile(m > k):\r\n if(i < n):\r\n k -= 1\r\n k += an[i]\r\n i += 1\r\n else:\r\n break\r\n \r\n res += 1\r\n\r\nif(m <= k): \r\n print(res)\r\nelse:\r\n print(-1)\r\n ", "x,y,z=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\ns=z\r\nt=False\r\nwhile s<y and c<x:\r\n c+=1\r\n s=s+l[x-c]-1\r\nif s<y:\r\n print(-1)\r\nelse:\r\n print(c)\r\n \r\n ", "_, devices, tomadas = map(int, input().split(' '))\n\ndef aaa():\n filtros = list(map(int, input().split(' ')))\n\n filtros = sorted(filtros, reverse=True)\n\n total_tomadas_filtro = tomadas\n qtd = 0\n if devices > total_tomadas_filtro:\n for f in filtros:\n total_tomadas_filtro -= 1\n total_tomadas_filtro += f\n qtd += 1\n if devices <= total_tomadas_filtro:\n return qtd\n if devices > total_tomadas_filtro:\n return -1\n else:\n return 0\n\n\nprint(aaa())\n \t\t \t \t\t\t\t\t \t \t\t \t\t \t \t\t\t \t", "n,m,k = map(int,input().split())\r\n\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nx=x[::-1]\r\n\r\nif m<=k:\r\n print(0)\r\nelse:\r\n d=0\r\n f=1\r\n for i in x:\r\n k+=i-1\r\n d+=1\r\n if m<=k:\r\n print(d)\r\n f=0\r\n break\r\n if f :\r\n print(-1)", "n,m,k=map(int,input().split())\r\n\r\nx=[int(q) for q in input().split()]\r\nx=sorted(x)\r\nx=x[::-1]\r\n\r\ni=0\r\nwhile (k<m and i<n):\r\n k+= x[i]-1\r\n i+=1\r\nif (i<=n and k>=m):\r\n print(i)\r\nelse:\r\n print(-1)", "def main():\r\n n, m, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n a.sort(reverse=True)\r\n filters = 0\r\n plug = k\r\n\r\n while filters < n and plug < m:\r\n plug += a[filters] - 1\r\n filters += 1\r\n\r\n if plug >= m:\r\n print(filters)\r\n else:\r\n print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m,k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nfor i,a in enumerate(sorted(lst, reverse = True)):\r\n if k >= m:\r\n print(i)\r\n exit()\r\n k += a -1\r\nif k >= m:\r\n print(n)\r\nelse:\r\n print(-1)\r\n", "n, m, k = map(int, input().split())\r\nfilters = list(map(int, input().split()))\r\nfilters.sort(reverse=True)\r\nans = 0\r\nif m <= k:\r\n print(ans)\r\nelse:\r\n left = m\r\n i = 0\r\n done = False\r\n while i < n:\r\n ans += 1\r\n if left <= filters[i] + (k-1):\r\n print(ans)\r\n done = True\r\n break\r\n else:\r\n left -= (filters[i] - 1)\r\n i += 1\r\n if not done:\r\n print(-1)", "f, d, s = [int(i) for i in input().split()]\r\nfilters = [int(i) for i in input().split()]\r\nfilters.sort(reverse=True)\r\n\r\nfreeSockets = s\r\nusedFilters = 0\r\nfor i in range(len(filters)):\r\n if freeSockets >= d:\r\n break\r\n usedFilters += 1\r\n freeSockets += filters[i]-1\r\n\r\nif freeSockets >= d:\r\n print(usedFilters)\r\nelse:\r\n print(-1)\r\n\r\n", "n,m,k = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nlst.sort(reverse=1)\r\nf,p = 0,k\r\n\r\nwhile f<n and p<m:\r\n p += lst[f]-1\r\n f += 1\r\n\r\nif p>=m:\r\n print(f)\r\nelse:\r\n print(-1)", "n, m, k = map(int, input().split())\r\nfilters = [int(i) for i in input().split()]\r\nfilters.sort()\r\nports = k\r\ncount = 0\r\nwhile ports < m and filters:\r\n ports += filters[-1] - 1\r\n filters.pop()\r\n count += 1\r\nif ports >= m:\r\n print(count)\r\nelse:\r\n print(-1)\r\n", "def main():\n n, m, k = map(int, input().split())\n m -= k\n if m > 0:\n for i, a in enumerate(sorted(map(int, input().split()), reverse=True), 1):\n m -= a - 1\n if m <= 0:\n print(i)\n break\n else:\n print(-1)\n else:\n print(0)\n\n\nif __name__ == '__main__':\n main()\n", "n,m,k = map(int,input().split())\ns = sorted(list(map(int,input().split())),reverse=True)\ns.append(1)\n#print(s)\ni = 0\nwhile i<=n:\n if k>=m:\n print(i)\n exit(0)\n else:\n k+=(s[i]-1)\n i+=1\nprint(-1)", "def solve() : \r\n n , m , k = map(int,input().split())\r\n l = sorted(list( map(int,input().split())) , reverse = True)\r\n m -= k \r\n for i in range(n):\r\n if m <= 0 :\r\n return i\r\n m-= l[i]-1\r\n # print(m , l[i] , i)\r\n return -1 if m > 0 else n\r\nprint(solve())", "from sys import stdin,stdout\r\nii1 = lambda: int(stdin.readline())\r\nis1 = lambda: stdin.readline()\r\niia = lambda : map(int, stdin.readline().split())\r\nisa = lambda: stdin.readline().split()\r\n\r\nn, m, k = iia()\r\narr = sorted(iia(),reverse = True)\r\n\r\ncount = 0\r\nfor i in arr:\r\n if m <= k:\r\n print(count)\r\n break\r\n elif m - i <= 0 and k>0:\r\n print(count+1)\r\n break\r\n else:\r\n count += 1\r\n m -= i\r\n k -= 1\r\nelse:\r\n if m <= 0 and k>0:\r\n print(count)\r\n else:\r\n print(-1)", "import math\r\nimport string\r\n\r\ndef main_function():\r\n n, m, k = [int(i) for i in input().split(\" \")]\r\n a = sorted([int(i) for i in input().split(\" \")], reverse=True)\r\n counter = k\r\n index = 0\r\n if counter >= m:\r\n print(0)\r\n else:\r\n is_ans_given = False\r\n for i in range(len(a)):\r\n counter -= 1\r\n counter += a[i]\r\n if counter >= m:\r\n is_ans_given = True\r\n print(i + 1)\r\n break\r\n if not is_ans_given:\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\nmain_function()\r\n", "def met(n, m, k, a):\r\n a.sort(reverse=True)\r\n if k >= m:\r\n return 0\r\n for i, e in enumerate(a):\r\n if k + e - 1 >= m:\r\n return i + 1\r\n if e == 1:\r\n return -1\r\n k += (e-1)\r\n\r\n return -1\r\n\r\n\r\nn, m, k = tuple(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\nprint(met(n, m, k, a))\r\n", "def solve(n,m,k,arr):\r\n\tif m <= k :\r\n\t\treturn 0\r\n\t\r\n\tarr.sort(reverse=True)\r\n\tfor i in range(n):\r\n\t\tif sum(arr[:i+1])-i-1 + k >= m :\r\n\t\t\treturn i+1\r\n\treturn -1\r\n \r\n \r\n \r\n \r\n \r\nfrom sys import stdin\r\ninput = stdin.readline\r\n \r\nl3 = input()\r\nl3=[int(x) for x in l3.split()]\r\nl4=input()\r\nl4=[int(x) for x in l4.split()]\r\n \r\n \r\nprint(solve(l3[0],l3[1],l3[2],l4))", "n,m,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx.sort(reverse=True)\r\ni=-1\r\nif k>=m:\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n k-=1\r\n k+=x[i]\r\n if k>=m:\r\n break\r\n if k>=m:\r\n print(i+1)\r\n else:print(-1)", "n, m, k = list(map(int, input().rstrip().split()))\na = list(map(int, input().rstrip().split()))\na.sort(reverse=True)\nif m <= k:\n print(0)\nelse:\n ans = 0\n x = m\n while (True):\n maxm = a.pop(0)\n m = m - maxm\n k = k - 1\n ans += 1\n if k >= m:\n print(ans)\n break\n elif ans == n:\n print(-1)\n break\n\n\n" ]

[ "n, m, a, b, c = map(int, input().split())\r\nmat = [0]*n\r\nfor i in range(n):\r\n mat[i] = [0] * m\r\nn1 = [min(n*m//4, c), min(m//2 * n, a), min(n//2 * m, b)]\r\np = ['c', 'a', 'b']\r\nz = ['d', 'e', 'f', 'g']\r\nz1 = ['m', 'n', 'u', 'o']\r\nz2 = ['p', 'q', 'r', 'w']\r\n#print(n1)\r\ndef fill(h, w):\r\n if h <= 0 or w <= 0:\r\n return True\r\n i = 0; j = 0\r\n for k in range(3):\r\n while n1[k] > 0:\r\n #print(i, j, h, w)\r\n if k == 0:\r\n if i%4 and j%4:\r\n o = 3\r\n elif i%4 and not j%4:\r\n o = 2\r\n elif not i%4 and j%4:\r\n o = 1\r\n else:\r\n o = 0\r\n mat[i][j] = mat[i+1][j] = mat[i][j+1] = mat[i+1][j+1] = z[o];\r\n if p[k] == 'a':\r\n if j%4:\r\n o = 2\r\n else:\r\n o = 0\r\n mat[i][j] = mat[i][j+1] = z1[o]\r\n mat[i+1][j] = mat[i+1][j+1] = z1[o+1];\r\n elif p[k] == 'b':\r\n if i%4:\r\n o = 0\r\n else:\r\n o = 2\r\n mat[i][j] = mat[i+1][j] = z2[o]\r\n mat[i][j+1] = mat[i+1][j+1] = z2[o+1];\r\n if k == 0:\r\n n1[k] -= 1\r\n else:\r\n n1[k] -= 2\r\n j += 2\r\n if j >= w:\r\n i += 2\r\n j = 0\r\n if i >= h:\r\n return True\r\n return False\r\n\r\ndef pmat():\r\n for i in range(n):\r\n for j in range(m):\r\n print(mat[i][j], end='')\r\n print('\\n', end='')\r\ndef even(h, w):\r\n k1 = 0; k2 = 0\r\n if n1[1] %2 == 1: n1[1] -= 1; k1 = 1\r\n if n1[2] %2 == 1: n1[2] -= 1; k2 = 1\r\n \r\n if fill(h, w):\r\n n1[1] += k1\r\n n1[2] += k2\r\n return True\r\n else:\r\n n1[1] += k1\r\n n1[2] += k2\r\n return False\r\n \r\nif n*m % 2 == 0:\r\n if n%2 == 0 and m%2 == 0:\r\n if even(n, m):\r\n pmat()\r\n else:\r\n print('IMPOSSIBLE')\r\n elif n%2 == 0 and m%2 != 0:\r\n n1 = [min(n*m//4, c), min(m//2 * n, a), min(n//2 * m, b)]\r\n p = ['c', 'a', 'b']\r\n f = 'b'\r\n if even(n, m-1):\r\n for i in range(0, n, 2):\r\n mat[i][m-1] = f; mat[i+1][m-1] = f\r\n if f == 'a':\r\n f = 'b'\r\n else:\r\n f = 'a'\r\n n1[2] -= 1\r\n else:\r\n if n1[2] >= 0:\r\n pmat()\r\n else:\r\n print('IMPOSSIBLE')\r\n else:\r\n print('IMPOSSIBLE')\r\n else:\r\n n1 = [min(n*m//4, c), min(n//2 * m, b), min(m//2 * n, a)]\r\n p = ['c', 'b', 'a']\r\n f = 'a'\r\n if even(n-1, m):\r\n for i in range(0, m, 2):\r\n mat[n-1][i] = f; mat[n-1][i+1] = f\r\n if f == 'a':\r\n f = 'b'\r\n else:\r\n f = 'a'\r\n n1[2] -= 1\r\n else:\r\n if n1[2] >= 0:\r\n pmat()\r\n else:\r\n print('IMPOSSIBLE')\r\n else:\r\n print('IMPOSSIBLE')\r\n \r\nelif n*m % 2 != 0:\r\n print('IMPOSSIBLE')\r\n \r\n \r\n \r\n", "\r\n\r\nn,m,a,b,c = map( int,input().split() )\r\nok = False\r\nif ( n%2==1 and m%2==1 ):\r\n print ( 'IMPOSSIBLE' )\r\n exit()\r\n\r\nif( m%2==1 ):\r\n n,m,a,b,ok = m,n,b,a,True\r\nres = [ [ '.' for i in range(m) ] for i in range(n) ]\r\n\r\nfor i in range( 0,n-1,2 ):\r\n for j in range( 0,m-1,2 ):\r\n x1 = chr( i%4+4*(j%4)+ord('a') )\r\n x2 = chr( i%4+4*((j+1)%4)+ord('a') )\r\n if( c>=1 ):\r\n res[i][j] = x1\r\n res[i+1][j] = x1\r\n res[i][j+1] = x1\r\n res[i+1][j+1] = x1\r\n c -= 1\r\n elif( b>=2 ):\r\n res[i][j] = x1\r\n res[i+1][j] = x1\r\n res[i][j+1] = x2\r\n res[i+1][j+1] = x2\r\n b -= 2\r\n elif( a>=2 ):\r\n res[i][j] = x1\r\n res[i+1][j] = x2\r\n res[i][j+1] = x1\r\n res[i+1][j+1] = x2\r\n a -= 2\r\n else :\r\n print( 'IMPOSSIBLE' )\r\n exit()\r\n\r\nif( n%2==1 ):\r\n for j in range( 0,m,2 ):\r\n i = n-1\r\n x1 = chr( i%4+4*(j%4)+ord('a') )\r\n x2 = chr( i%4+4*((j+1)%4)+ord('a') )\r\n if( a >= 1 ):\r\n res[i][j] = x1\r\n res[i][j+1]= x1\r\n a -= 1\r\n else :\r\n print( 'IMPOSSIBLE' )\r\n exit()\r\n\r\nif( ok ):\r\n res = [ [ res[i][j] for i in range(n) ]for j in range(m) ]\r\n\r\nprint( '\\n'.join( [ ''.join(it) for it in res ] ) )\r\n\r\n\r\n", "n, m, a, b, c = [int(w) for w in input().split()]\n\n# a : 1 * 2\n# b : 2 * 1\n# c : 2 * 2\nif (n % 2 == 1 and m % 2 == 1) or (n * m > a * 2 + b * 2 + c * 4):\n print('IMPOSSIBLE')\n exit(0)\n\n# if n * m > a * 4 + b * 2 + c * 2:\n# print('IMPOSSIBLE')\n# exit(0)\n\nboard = [[' ' for c in range(m)] for r in range(n)]\n\nif n % 2 == 1:\n for col in range(0, m, 2):\n if (col // 2) % 2 == 0:\n board[0][col] = board[0][col + 1] = 'a'\n else:\n board[0][col] = board[0][col + 1] = 'b'\n a -= 1\nelif m % 2 == 1:\n for row in range(0, n, 2) :\n if (row // 2) % 2 == 0:\n board[row][0] = board[row + 1][0] = 'a'\n else:\n board[row][0] = board[row + 1][0] = 'b'\n b -= 1\nif a < 0 or b < 0:\n print('IMPOSSIBLE')\n exit(0)\n# for line in board:\n# print(''.join(line))\n# exit(0)\na = a - a % 2\nb = b - b % 2\n\nchars = 'abcdefg'\nfor row in range(n - 1):\n for col in range(m - 1):\n if board[row][col] != ' ':\n continue\n skip = set()\n if row > 0:\n skip.add(board[row - 1][col])\n skip.add(board[row - 1][col + 1])\n if col > 0:\n skip.add(board[row][col - 1])\n skip.add(board[row + 1][col - 1])\n candi = [c for c in chars if c not in skip]\n if a >= 2:\n a -= 2\n board[row][col] = board[row][col + 1] = candi[0]\n board[row+ 1][col] = board[row + 1][col + 1] = candi[1] \n elif b >= 2:\n b -= 2\n board[row][col] = board[row + 1][col] = candi[0]\n board[row][col + 1] = board[row + 1][col + 1] = candi[1] \n elif c > 0:\n c -= 1\n board[row][col] = board[row + 1][col] = candi[0]\n board[row][col + 1] = board[row + 1][col + 1] = candi[0]\n else:\n print('IMPOSSIBLE')\n exit(0)\n\nfor line in board:\n print(''.join(line))", "from fractions import Fraction\nimport sys\nsys.setrecursionlimit(1000*100)\n#c=int(input())\n#a,b=tuple(map(int,input().split()))\n#edges=dict((i,[]) for i in range(1,c+1))\n#children=filter(lambda x: x != p, edges[r])\n#cs.sort(key=lambda x:Fraction(x[0],x[1]),reverse=True)\n#if dp[r] is not None:\n#chr(ord('a')+1)\n#''.join(['a','b','c'])\n#sys.exit()\nn,m,a,b,c=tuple(map(int,input().split()))\nerr='IMPOSSIBLE'\nif n%2==1 and m%2==1:\n print(err)\n sys.exit()\n\nret=[['.' for _ in range(m)] for _ in range(n)]\ndef col(i,j):\n return chr(ord('a')+4*(i%4)+j%4)\n\nif n%2==1:\n for i in range(0,m,2):\n if a==0:\n print(err)\n sys.exit()\n ret[n-1][i]=ret[n-1][i+1]=col(n-1,i)\n a-=1\n n-=1\n\nif m%2==1:\n for i in range(0,n,2):\n if b==0:\n print(err)\n sys.exit()\n ret[i][m-1]=ret[i+1][m-1]=col(i,m-1)\n b-=1\n m-=1\n\nfor i in range(0,n,2):\n for j in range(0,m,2):\n if a>=2:\n a-=2\n ret[i][j]=ret[i][j+1]=col(i,j)\n ret[i+1][j]=ret[i+1][j+1]=col(i+1,j)\n elif b>=2:\n b-=2\n ret[i][j]=ret[i+1][j]=col(i,j)\n ret[i][j+1]=ret[i+1][j+1]=col(i,j+1)\n elif c>=1:\n c-=1\n ret[i][j]=ret[i+1][j]=ret[i][j+1]=ret[i+1][j+1]=col(i,j)\n else:\n print(err)\n sys.exit()\n\nfor l in ret:\n print(''.join(l))\n \n\n\n\n" ]

[ "import sys\r\n\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\nfor i in range((n // a) + 1):\r\n if (n - (i * a)) % b == 0:\r\n print(\"YES\")\r\n print(i, (n - (i * a)) // b)\r\n sys.exit()\r\nprint(\"NO\")\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nfor x in range(0, n // a + 1):\r\n if (n - x * a) % b == 0:\r\n print('YES')\r\n print(x, (n - a * x) // b)\r\n quit()\r\nprint('NO')", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nfor i in range(n+1):\r\n if a*i>n:\r\n break\r\n else:\r\n if (n-a*i)%b==0:\r\n print(\"YES\")\r\n print(i,(n-a*i)//b)\r\n exit()\r\nprint(\"NO\")\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nfor i in range(min(a,b,n//max(a,b)+1)):\r\n\tif((n-i*a)%b==0):\r\n\t\tprint('YES')\r\n\t\tprint(i,(n-a*i)//b)\r\n\t\tbreak\r\n\telif((n-b*i)%a==0):\r\n\t\tprint('YES')\r\n\t\tprint((n-b*i)//a,i)\r\n\t\tbreak\r\nelse:\r\n\tprint('NO')", "import math\n\n# Returns the gcd, and the Bézout coefficients.\ndef extended_gcd(a, b):\n s, old_s = 0, 1\n t, old_t = 1, 0\n r, old_r = b, a\n\n while r != 0:\n quotient = old_r // r\n old_r, r = r, old_r - quotient * r\n old_s, s = s, old_s - quotient * s\n old_t, t = t, old_t - quotient * t\n\n return old_r, (old_s, old_t)\n\ndef main():\n n = int(input())\n a = int(input())\n b = int(input())\n\n gcd_ab, (e, f) = extended_gcd(a, b)\n #print(f\"gcd(a, b) = {gcd_ab}\")\n #print(f\"e, f = {e}, {f}\")\n if n % gcd_ab != 0:\n print(\"NO\")\n return\n \n h = n // gcd_ab\n # We have a solution, but it might not be positive. Check all possible solutions.\n x = e*h\n y = f*h\n\n #print(f\"e, f, x, y, h = {e}, {f}, {x}, {y}, {h}\")\n\n step_x = b // gcd_ab\n step_y = a // gcd_ab\n #print(f\"step_x, step_y = {step_x}, {step_y}\")\n\n # Now, every solution has the form (x + k*step_x, y - k*step_y).\n # For both >= 0, we have:\n # x + k*step_x >= 0 => k >= -x/step_x;\n # y - k*step_y >= 0 => k <= y/step_y;\n lower_k = math.ceil(-x / step_x)\n upper_k = math.floor(y / step_y)\n #print(f\"lower_k, upper_k = {lower_k}, {upper_k}\")\n if lower_k <= upper_k:\n print(\"YES\")\n s1 = x + lower_k*step_x\n s2 = y - lower_k*step_y\n\n print(\"{} {}\".format(s1, s2))\n else:\n print(\"NO\")\n\nmain()\n\n \t \t \t \t\t \t\t \t \t \t\t\t \t\t\t", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nif (n%a == 0):\r\n print('YES')\r\n print(n//a,0)\r\nelif (n%b == 0):\r\n print('YES')\r\n print(0,n//b)\r\nelse:\r\n x = 1\r\n ans = 'NO'\r\n ans_2 = [None,None]\r\n while(n - a * x >= 0):\r\n if (n - a * x ) % b == 0:\r\n ans = 'YES'\r\n ans_2 = [x,(n - a * x ) // b]\r\n break\r\n x += 1\r\n \r\n if (ans != 'NO'):\r\n \r\n print(ans)\r\n print(ans_2[0],ans_2[1])\r\n else:\r\n print('NO')\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nflags=False\r\nfor i in range(n//a+1):\r\n if n-i*a>=0 and (n-i*a)%b==0:\r\n print(\"YES\")\r\n print(i,(n-i*a)//b)\r\n flags=True\r\n break\r\nif not flags:\r\n print(\"NO\")", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nflag = False\r\nif n%a == 0 or n%b == 0:\r\n print('YES')\r\n if(n%a == 0):\r\n print(n//a, 0)\r\n else:\r\n print(0, n//b)\r\nelse:\r\n maxLmtA, remA = n//a,n%a\r\n maxLmtB, remB = n//b,n%b\r\n for i in range(maxLmtB, 0, -1):\r\n remB = n-b*i\r\n if remB%a == 0:\r\n print('YES')\r\n print(remB//a, i)\r\n flag = True\r\n break;\r\n if not flag:\r\n print('NO')", "x = int(input()) \r\ny = int(input()) \r\nz = int(input()) \r\ncola = 0\r\nbar = 0\r\ntoolong=2+(x%1000)+(y*z)\r\nfor i in range(x):\r\n\tif((y == z and x % y != 0) or (x <= 0) or (toolong <= 0) or ((x<z) and (x<y))):\r\n\t\tprint(\"NO\")\r\n\t\tquit()\r\n\tif(x % y == 0):\r\n\t\tcola = x // y\r\n\t\tbreak\r\n\tif(x % z == 0):\r\n\t\tbar = x // z\r\n\t\tbreak\r\n\telif(y>z or (x>y and z>x)):\r\n\t\twhile(x%z != 0 and toolong > 0 and x > 0):\r\n\t\t\tx -= y\r\n\t\t\tcola += 1\r\n\t\t\ttoolong -= y\r\n\telif(z>y or (x>z and y>x)):\r\n\t\twhile(x%y != 0 and toolong > 0 and x > 0):\r\n\t\t\tx -= z\r\n\t\t\tbar += 1\r\n\t\t\ttoolong -= y\r\nprint(\"YES\")\r\nprint(cola, bar)", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\n\r\naa=[]\r\ni=0\r\nwhile(i*a<=n):\r\n aa.append(i*a)\r\n i+=1 \r\nf=0\r\n\r\nfor i in range(len(aa)):\r\n if (n-aa[i])%b==0:\r\n f=1 \r\n print(\"YES\")\r\n print(i,(n-aa[i])//b)\r\n break \r\nif f==0:\r\n print(\"NO\")\r\n ", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nr = int(n/(min(a, b))) + 1\r\nfor i in range(r):\r\n y = (n-a*i)/b\r\n if y < 0:\r\n print(\"NO\")\r\n exit()\r\n elif y >= 0 and (n-a*i) % b == 0:\r\n p = i\r\n q = (n-a*i) // b\r\n print(\"YES\")\r\n print(p, q)\r\n exit()\r\nprint(\"NO\")\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\nx = 0\r\ny = 0\r\ncopy_n = n\r\nok = 0\r\nfor i in range(0, n+1):\r\n if (n - i*a) % b == 0 and (n - i*a) >= 0:\r\n ok = 1\r\n x = i\r\n y = (n - i*a) // b\r\n\r\nif ok == 1:\r\n print(\"YES\")\r\n print(x, y)\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\na = int(stdin.readline())\r\nb = int(stdin.readline())\r\nx = 0\r\nflg = False\r\nif a % 2 == 0 and b % 2 == 0 and not n % 2 == 0:\r\n stdout.write(\"NO\\n\")\r\n exit()\r\nelif n % a == 0:\r\n stdout.write(\"YES\\n\")\r\n stdout.write(str(n // a) + \" \" + str(0))\r\n exit()\r\nelif n % b == 0:\r\n stdout.write(\"YES\\n\")\r\n stdout.write(str(0) + \" \" + str(n // b))\r\n exit()\r\nelif a == b and not n % b ==0:\r\n stdout.write(\"NO\\n\")\r\nelse:\r\n l = max(a, b)\r\n r = min(a, b)\r\n while l < n:\r\n if (n - l) % r == 0:\r\n print('YES')\r\n fig = True\r\n if a < b:\r\n stdout.write(str((n-l)//a)+\" \"+ str(l//b))\r\n exit()\r\n else:\r\n stdout.write(str(l//a) + \" \" + str((n-l)//b))\r\n exit()\r\n\r\n break\r\n l = l + max(a, b)\r\n if not flg:\r\n stdout.write(\"NO\\n\")\r\n", "# LUOGU_RID: 101737428\nn, a, b = map(int, open(0).read().split())\r\nfor i in range(n // a + 1):\r\n if (n - i * a) % b == 0:\r\n print('YES')\r\n print(i, (n - i * a) // b)\r\n exit()\r\nprint('NO')", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\n\r\nif n>=a:\r\n for i in range(0,n+1):\r\n if a*i>n:\r\n break\r\n if (n-a*i)%b==0:\r\n print(f\"YES\\n{i} {(n-(i*a))//b}\")\r\n exit()\r\n print(\"NO\")\r\nelif n>=b: \r\n for i in range(0,n+1):\r\n if b*i>n:\r\n break\r\n if (n-b*i)%a==0:\r\n print(f\"YES\\n{(n-(i*b))//a} {i}\")\r\n exit()\r\n print(\"NO\")\r\nelse: print(\"NO\")", "import sys,math,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\na=I()\nb=I()\nif(n%math.gcd(a,b)):\n print(\"NO\")\nelse:\n if(n%b==0):\n print(\"YES\")\n print(0,n//b)\n exit()\n i=0\n while(n>0):\n if(n%a==0):\n print(\"YES\")\n print(n//a,i)\n exit()\n n-=b\n i+=1\n print(\"NO\")\n", "n=int(input())\r\nm=int(input())\r\nk=int(input())\r\nc=0\r\nwhile( n>=0 and n%k!=0):\r\n n=n-m\r\n c+=1\r\nif(n>=0):\r\n print(\"YES\")\r\n print(c,n//k)\r\nelse:\r\n print(\"NO\")\r\n\r\n", "from sys import stdin\n\nn = int(stdin.readline())\na = int(stdin.readline())\nb = int(stdin.readline())\n\ndef get_anwser(n, a, b):\n answer = ('NO', -1, -1)\n for i in range(0, 10**7 + 1):\n if (n - a*i) >= 0 and (n - a*i) % b == 0:\n return f'YES\\n{i} {(n - a * i) // b}'\n return 'NO'\n \n\nprint(get_anwser(n,a,b))", "import sys,os,time\r\nfrom math import log,gcd\r\nmod=1000000007\r\nmod1=998244353\r\ndef intinp():\r\n return int(sys.stdin.readline())\r\ndef strinp():\r\n return sys.stdin.readline()\r\ndef arrinp():\r\n return list(map(int,sys.stdin.readline().strip().split()))\r\ndef mulinp():\r\n return map(int,sys.stdin.readline().strip().split())\r\ndef flush():\r\n return sys.stdout.flush()\r\ndef power_two(x):\r\n return (1<<x)\r\ndef lcm(a,b):\r\n return a*b//gcd(a,b)\r\n\r\ndef power(a,n):\r\n res=1\r\n while(n):\r\n if(n&1):\r\n res=(res%mod*a%mod)%mod\r\n n-=1\r\n else:\r\n a=(a%mod*a%mod)%mod\r\n n=n//2\r\n return res\r\n\r\n\r\ndef isnotsubseq(s1,s2):\r\n\tj=0\r\n\tn,m=len(s1),len(s2)\r\n\tfor i in range(0,m):\r\n\t\tif(s1[j]==s2[i]):\r\n\t\t\tj+=1\r\n\t\tif(j==n):\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ndef variable(n,a,b):\r\n i=0\r\n while i*a<=n:\r\n if(n-i*a)%b==0:\r\n return i,(n-i*a)//b\r\n i+=1\r\n return None,None\r\ndef sol():\r\n n=intinp()\r\n a=intinp()\r\n b=intinp()\r\n if(n%gcd(a,b)!=0):\r\n print('NO')\r\n return\r\n x,y=variable(n, a, b)\r\n if(x==None or y==None):\r\n print('NO')\r\n return\r\n print('YES')\r\n print(x,y)\r\n\r\n\r\n\r\ndef main():\r\n #tc=intinp()\r\n tc=1\r\n while(tc):\r\n sol()\r\n tc-=1\r\nmain()\r\n\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nx=0\r\nflag=0\r\nwhile x<=n:\r\n if (n-x)%b==0:\r\n print('YES')\r\n print(x//a,(n-x)//b)\r\n flag=1\r\n break\r\n else:\r\n x+=a\r\nif flag==0:\r\n print('NO')\r\n", "\r\nimport math\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return 1, 0, a\r\n x, y, d = gcd(b, a % b)\r\n return y, x - y * (a // b), d\r\n\r\n\r\ndef solve():\r\n c = int(input())\r\n a = int(input())\r\n b = int(input())\r\n coef_a, coef_b, d = gcd(a, b)\r\n\r\n if c % d:\r\n print(\"NO\")\r\n return\r\n coef_a *= c // d\r\n coef_b *= c // d\r\n\r\n if coef_a < 0:\r\n k = (-coef_a * d + b - 1) // b\r\n coef_a += k * b // d\r\n coef_b -= k * a // d\r\n\r\n if coef_b < 0:\r\n k = (-coef_b * d + a - 1) // a\r\n coef_b += k * a // d\r\n coef_a -= k * b // d\r\n\r\n if min(coef_a, coef_b) < 0:\r\n print(\"NO\")\r\n else:\r\n print(f\"YES\\n{coef_a} {coef_b}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n=int(input());a=int(input());b=int(input());i=0\r\nwhile True:\r\n if n-(a*i)<0:print(\"NO\");exit()\r\n elif (n-(a*i))%b==0:print(\"YES\");print(i,(n-(a*i))//b);exit()\r\n i+=1\r\n", "import math\nimport sys\nN = int(input())\na = int(input())\nb = int(input())\n# Se simplifican los factores utilizando el gcd de A, B y C.\ndiv = math.gcd(N, math.gcd(a, b))\nif div == 1:\n if math.gcd(a, b) != 1: # Si gcd(a,b) > 1 pero div == 1, ax+by sería entero y C/gcd(a,b) decimal.\n print(\"NO\")\n sys.exit()\nelse:\n N, a, b = N/div, a/div, b/div\n# El algoritmo aumenta en tiempo entre más alejados esten a y b. Por ende, se revisan los casos\n# base que podrían hacer que este se demore un exceso de tiempo: 1 y 2 (si N %2 == 0).\nif a == 1:\n print(\"YES\")\n print(int(a*N), 0)\n sys.exit()\nelif b == 1:\n print(\"YES\")\n print(0, int(b*N))\n sys.exit()\nelif N % 2 == 0:\n if a == 2:\n print(\"YES\")\n print(int(N/2), 0)\n sys.exit()\n elif b == 2:\n print(\"YES\")\n print(0, int(N/2))\n sys.exit()\n# Si la solución no cubre los peores casos.\nr = 0 # Algoritmo de Euclides.\nwhile r*a <= N:\n if (N-(r*a)) % b == 0:\n print(\"YES\")\n print(r, int((N-(r*a))/b))\n sys.exit()\n r += 1\nprint(\"NO\")\n", "from math import gcd\ndef xgcd(a, b):\n \"\"\"return (g, x, y) such that a*x + b*y = g = gcd(a, b)\"\"\"\n x0, x1, y0, y1 = 0, 1, 1, 0\n while a != 0:\n q, b, a = b // a, a, b % a\n y0, y1 = y1, y0 - q * y1\n x0, x1 = x1, x0 - q * x1\n return b, x0, y0\n\nn = int(input())\na = int(input())\nb = int(input())\nif n % gcd(a, b) == 0:\n g, x ,y = xgcd(a,b)\n lcm = a * b // g\n x *= (n // g)\n y *= (n // g)\n if x < 0:\n change = -(x // (lcm//a))\n x += (lcm//a)*change\n y -= (lcm//b)*change\n elif y < 0:\n change = -(y // (lcm//b))\n x -= (lcm//a)*change\n y += (lcm//b)*change\n if x < 0 or y < 0:\n print(\"NO\")\n else:\n print(\"YES\")\n print(x,y)\nelse:\n print(\"NO\")\n", "def read():\n return [int(v) for v in input().split()]\n\n\ndef main():\n n = read()[0]\n a = read()[0]\n b = read()[0]\n\n for x in range(0, n // a + 2):\n y = int((n - a * x) / b)\n if y >= 0 and a * x + b * y == n:\n print('YES\\n{} {}'.format(x, y))\n return\n\n print('NO')\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nfor i in range(10**7+4):\r\n x = a*i\r\n if n-x>=0:\r\n d = n-x\r\n if d%b==0:\r\n print(\"YES\")\r\n print(i,d//b)\r\n exit()\r\n else:\r\n break\r\nprint(\"NO\")", "c,a,b = int(input()),int(input()),int(input())\r\ndef r(c, a, b):\r\n for i in range(b):\r\n x = c - a*i\r\n if x >= 0:\r\n if x%b == 0: return [i, x//b]\r\n else: return False\r\n return False\r\nt = r(c, max(a,b), min(a,b))\r\nif t: print(\"YES\"); print(*t if a == max(a, b) else (t[::-1]))\r\nelse: print(\"NO\")", "import math\r\n\r\nn=int(input())\r\na=int(input())\r\nb=int(input())\r\n\r\nc=max(a,b)\r\nd=min(a,b)\r\ni=0\r\nflag=0\r\ngc = math.gcd(c,d)\r\nif(n%gc==0):\r\n while(c*i<=n):\r\n diff=n-c*i\r\n if(diff%d==0):\r\n flag=1\r\n print(\"YES\")\r\n if(c==a):\r\n print(i,(diff)//d)\r\n else:\r\n print((diff)//d,i)\r\n break\r\n i+=1\r\nif(flag==0):print(\"NO\")\r\n ", "n = int(input())\na = int(input())\nb = int(input())\nans = 'NO'\narr = []\nfor x in range(n // a + 1):\n if (n - x * a) % b == 0:\n ans = 'YES'\n arr.append(x)\n arr.append((n - x * a) // b)\n break\nprint(ans)\nif ans == 'YES':\n print(*arr)\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nans=0\r\n\r\nwhile(a>0 and a%b!=0):\r\n\ta=a-c\r\n\tans+=1\r\nif(a<0):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(a//b,ans)\r\n", "n = int(input())\r\nx = int(input())\r\ny = int(input())\r\n\r\nc = 0\r\n\r\nwhile n >= 0 and n % y != 0:\r\n n = n-x\r\n c += 1\r\n\r\nif n >= 0:\r\n print(\"YES\")\r\n print(c, n//y)\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\nfor i in range(0, n+1, a):\r\n if (n-i)%b==0:\r\n print('YES')\r\n print(i//a, (n-i)//b)\r\n exit()\r\nprint('NO')", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\n\r\ndef gcd(a, b):\r\n if (a == 0):\r\n return b, 0, 1\r\n\r\n d, x1, y1 = gcd(b%a, a)\r\n x = y1-x1*(b//a)\r\n y = x1\r\n return d, x, y\r\n\r\nd, x, y = gcd(a, b)\r\nd, x, y = gcd(d, n)\r\na //= d\r\nb //= d\r\nn //= d\r\nd, x, y = gcd(a, b)\r\n\r\nif (d>1):\r\n print(\"NO\")\r\nelse:\r\n x0 = x*n\r\n y0 = y*n\r\n l = (-x0+b-1)//b\r\n r = y0//a\r\n if (r-l>=0):\r\n print(\"YES\")\r\n print(x0+b*l, y0-a*l)\r\n else:\r\n print(\"NO\")", "n = int(input())\na = int(input())\nb = int(input())\nna = -1\nnb = -1\ni = 0\nwhile i * a <= n:\n if (n - i * a) % b == 0:\n na = i\n nb = (n - i * a) // b\n break\n i += 1\nif na >= 0:\n print('YES')\n print('{} {}'.format(na, nb))\nelse:\n print('NO')\n\t\t \t \t \t \t \t \t\t\t \t \t \t\t\t \t", "def mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\nn=it()\r\na=it()\r\nb=it()\r\nx,y=0,0\r\nwhile n%b!=0 and n>=0:\r\n\tn-=a\r\n\tx+=1\r\nif n<0:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tprint(x,n//b)", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\nn = int(stdin.readline())\r\n\r\na = int(stdin.readline())\r\nb = int(stdin.readline())\r\n\r\nfor i in range(n//a+1):\r\n\r\n rem = n - a * i\r\n if rem >= 0 and rem % b == 0:\r\n print (\"YES\")\r\n print (i,rem//b)\r\n sys.exit()\r\n\r\nprint (\"NO\")\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\np = False\r\nfor i in range(0,n//a+1):\r\n if ((n-a*i) % b==0):\r\n print(\"YES\")\r\n print(i,(n-a*i)//b)\r\n p = True\r\n break\r\nif not p:\r\n print(\"NO\")\r\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nfrom heapq import *\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\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\n\r\nn, a, b = [inp() for i in range(3)]\r\nflag = 0\r\ncur = 0\r\nwhile True:\r\n left = n - cur * b\r\n if left < 0:\r\n break\r\n if left % a == 0:\r\n print('YES')\r\n print(left//a, cur)\r\n flag = 1\r\n break\r\n cur += 1\r\nif flag == 0:\r\n pr('NO')\r\n", "# ﷽\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\n\r\ndef solve():\r\n n=int(input())\r\n a=int(input())\r\n b=int(input())\r\n for x in range(n+1):\r\n if a*x>n:break\r\n if (n-a*x) %b==0:\r\n print(\"YES\")\r\n print (x , (n-a*x) //b);return\r\n print(\"NO\");exit()\r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "class CodeforcesTask898BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.a = 0\n self.b = 0\n\n def read_input(self):\n self.n = int(input())\n self.a = int(input())\n self.b = int(input())\n\n def process_task(self):\n self.result = \"NO\"\n for x in range(10000000):\n if x * self.a > self.n:\n break\n if not (self.n - self.a * x) % self.b:\n y = (self.n - self.a * x) // self.b\n self.result = \"YES\\n{0} {1}\".format(x, y)\n break\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask898BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\n\r\ndef main():\r\n\tN = int(input())\r\n\ta = int(input())\r\n\tb = int(input())\r\n\tfor i in range(0,N//a+1):\r\n\t\tif (N-(i*a))%b==0 and (N-(i*a))>-1:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tprint(i,(N-(i*a))//b)\r\n\t\t\treturn\r\n\tprint(\"NO\")\r\n\r\nmain()", "c=int(input())\r\na=int(input())\r\nb=int(input())\r\nans=\"NO\"\r\nfor i in range(c//a+1):\r\n if (c-a*i)%b==0:\r\n ans=\"YES\\n\"+str(i)+\" \"+str((c-a*i)//b)\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nl = n//a\r\nfor i in range(l,-1,-1):\r\n t = n-(i*a)\r\n r = t%b\r\n if r==0:\r\n print(\"YES\")\r\n print(i,t//b)\r\n break\r\nif r!=0:\r\n print(\"NO\")", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\np = n//a\r\nt = 0\r\nfor i in range(p+1):\r\n if (n-(i*a))%b==0:\r\n t+=1\r\n r,q = i,(n-(i*a))//b\r\n break\r\nif t==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(r,q)\r\n", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\nbul = 0\r\nfor x in range(n//a+1):\r\n if (n-x*a)%b == 0:\r\n print(\"YES\")\r\n print(str(x) + \" \" + str((n-x*a)//b))\r\n bul = 1\r\n break\r\nif bul == 0:\r\n print(\"NO\")", "import sys \r\nimport math as mt\r\nimport bisect\r\ninput=sys.stdin.readline\r\n#t=int(input())\r\nt=1 \r\n \r\ndef solve():\r\n if a==b==1:\r\n print(\"YES\")\r\n print(n,0)\r\n return\r\n else:\r\n maxi=max(a,b)\r\n i=0\r\n while i<=n:\r\n if (n-i)%b==0:\r\n print(\"YES\")\r\n print(i//a,(n-i)//b)\r\n return\r\n i+=a \r\n print(\"NO\") \r\nfor _ in range(t):\r\n n=int(input())\r\n a=int(input())\r\n b=int(input())\r\n #n,k=map(int,input().split())\r\n #x,y,k=map(int,input().split())\r\n #n,h=(map(int,input().split()))\r\n #l=list(map(int,input().split()))\r\n #l2=list(map(int,input().split()))\r\n \r\n (solve())\r\n ", "from fractions import gcd\n\nn = int(input())\na = int(input())\nb = int(input())\n\np = gcd(a,b)\n\nif n % p == 0:\n\ta1 = n//a\n\tb1 = n//b\n\tif n%a == 0 or n%b == 0:\n\t\tprint(\"YES\")\n\t\tif n%a == 0:\n\t\t\tprint(a1, 0)\n\t\telse:\n\t\t\tprint(0, b1)\n\telse:\n\t if a+b > n:\n\t print(\"NO\")\n\t else: \n \t\tv = n - (a1 * a)\n \t\tb1 = v//b\n \t\twhile (a1*a) + (b1 * b) != n:\n \t\t\ta1-=1\n \t\t\tv = n - (a1 * a)\n \t\t\tb1 = v//b\n \t\tif a1 < 0 or b1 < 0:\n \t\t\tprint(\"NO\")\n \t\telse:\t\n \t\t\tprint(\"YES\")\t\n \t\t\tprint(a1, b1)\t\nelse:\n\tprint(\"NO\")", "import sys\nLI=lambda:list(map(int, sys.stdin.readline().split()))\nMI=lambda:map(int, sys.stdin.readline().split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline())\n\nc, a, b=II(), II(), II()\nok=False\nfor i in range(0, c, a):\n if (c-i)%b==0:\n ok=True\n ans=[i//a, (c-i)//b]\nfor i in range(0, c, b):\n if (c-i)%a==0:\n ok=True\n ans=[(c-i)//a, i//b]\nif ok:\n print('YES')\n print(*ans)\nelse:\n print('NO')\n", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\n\r\nbigger = max(a,b)\r\nsmaller = min(a,b)\r\n\r\nif (a==b) and (n%a != 0):\r\n print('NO')\r\n exit()\r\n\r\nfor i in range(n//bigger+1):\r\n if (n-bigger*i)%smaller==0:\r\n print('YES')\r\n Ber_Cola=i\r\n Bars_bar=(n-bigger*i)//smaller\r\n if (b > a): Ber_Cola, Bars_bar = Bars_bar, Ber_Cola\r\n print(Ber_Cola, Bars_bar)\r\n exit()\r\nprint('NO')\r\n\r\n# for _ in range(int(input())):\r\n# n = int(input())\r\n# flag = False\r\n# arr = [int(i) for i in input().split()]\r\n# for i in range(n-2):\r\n# if arr[i] in arr[i+2:]:\r\n# flag = True;break\r\n# print(\"YES\" if flag else \"NO\")", "n=int(input())\r\na=int(input())\r\nb=int(input())\r\ni,arr=0,[]\r\nwhile i*a<=n:arr.append(a*i);i+=1\r\nfor j in range(len(arr)):\r\n if (n-arr[j])%b==0:print(\"YES\");print(j,(n-arr[j])//b);break\r\nelse:print(\"NO\")", "n = int(input())\r\na = int(input())\r\nb = int(input())\r\ny = 0\r\nwhile n%a != 0 and n>= 0:\r\n n -= b \r\n y += 1\r\nif n < 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(n//a,y)\r\n", "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 = int(input())\r\nb = int(input())\r\nans = \"NO\"\r\nc, x = 0, 0\r\nwhile c <= n:\r\n if not (n - c) % b:\r\n ans, y = \"YES\", (n - c) // b\r\n break\r\n x += 1\r\n c += a\r\nprint(ans)\r\nif ans == \"YES\":\r\n print(x, y)", "def main():\n n = int(input())\n\n x = int(input())\n y = int(input())\n\n for a in range(n // x + 1):\n b = (n - a * x) // y\n b = int(b)\n\n if a * x + y * b == n:\n print('YES')\n print(f'{a} {b}')\n\n break\n\n else:\n print('NO')\n\nmain()\n", "n=int(input())\na=int(input())\nb=int(input())\n\nif a==b and n%a!=0:\n\tprint('NO')\n\texit()\nis_swapped=b>a\nif is_swapped:\n\ta,b=b,a\nfor i in range(n//a+1):\n\tif (n-a*i)%b==0:\n\t\tprint('YES')\n\t\tx=i\n\t\ty=(n-a*i)//b\n\t\tif is_swapped:\n\t\t\tx,y=y,x\n\t\tprint(x,y)\n\t\texit()\nprint('NO')", "\r\nn = int(input())\r\na = int(input())\r\nb = int(input())\r\nx = 0\r\nr = False\r\nwhile x*a <= n:\r\n z = (n-(x*a))/b\r\n if z >= 0 and z == int(z):\r\n r = True\r\n\r\n break\r\n x += 1\r\nif r:\r\n print(\"YES\")\r\n print(x, int(z))\r\nelse:\r\n print(\"NO\")\r\n" ]

[ "import sys\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\n# Binary Indexed Tree (Fenwick Tree)\r\n# 0-indexed\r\nclass BIT:\r\n def __init__(self, n):\r\n self.n = n\r\n self.data = [0]*(n+1)\r\n self.el = [0]*(n+1)\r\n def sum(self, i):\r\n s = 0\r\n while i > 0:\r\n s += self.data[i]\r\n i -= i & -i\r\n return s\r\n def add(self, i, x):\r\n assert 0 <= i < self.n\r\n i = i+1\r\n self.el[i] += x\r\n while i <= self.n:\r\n self.data[i] += x\r\n i += i & -i\r\n def set(self, i, x):\r\n assert 0 <= i <= self.n\r\n self.add(i,x-self.get(i))\r\n def get(self, i, j=None):# j=Noneのときiを取得, [i, j)の和を取得\r\n if j is None:\r\n return self.el[i+1]\r\n return self.sum(j) - self.sum(i)\r\nfrom collections import defaultdict\r\ndef solve(f):\r\n n = len(f)\r\n if len(f) == 0:\r\n return 0\r\n a,b = zip(*f)\r\n d = defaultdict(list)\r\n bit = BIT(n)\r\n for i in range(n):\r\n d[a[i] + i].append(i)\r\n for i in range(n):\r\n bit.add(i, 1)\r\n res = 0\r\n for i in range(n):\r\n for j in d[i]:\r\n bit.add(j, -1)\r\n #print(n,0,b[i]-i-1)\r\n res += bit.get(i-b[i]+1, i+1)\r\n #print(a,b,res)\r\n return res\r\n \r\n\r\nh,w = na()\r\nc = [input() for i in range(h)]\r\n\"\"\"h = 1000\r\nw = 3000\r\nfrom random import randint\r\nc = [[[\"z\",\".\"][randint(0,1)]for j in range(w)] for i in range(h)]\"\"\"\r\nm = min(h, w)\r\nans = 0\r\n\r\nf = [[w + 1 for i in range(w)]for j in range(h)]\r\nfor i in range(h):\r\n if c[i][0] == \"z\":\r\n f[i][0] = 0\r\n\r\nfor i in range(h):\r\n for j in range(1, w):\r\n if c[i][j] == \"z\":\r\n f[i][j] = min(j, f[i][j-1])\r\n\r\ng = [[-1 for i in range(w)]for j in range(h)]\r\nfor i in range(h):\r\n if c[i][-1] == \"z\":\r\n g[i][-1] = w-1\r\n\r\nfor i in range(h):\r\n for j in range(w-2,-1,-1):\r\n if c[i][j] == \"z\":\r\n g[i][j] = max(j, g[i][j+1])\r\n\r\n\r\nfor t in range(h+w-1):\r\n sy = min(t, w-1)\r\n sx = t-sy\r\n x,y = sx,sy\r\n i = 0\r\n l = 0\r\n ff = []\r\n while sx < h and sy >= 0:\r\n if c[sx][sy] == \"z\":\r\n ff.append((sy-f[sx][sy]+1, g[sx][sy]-sy+1))\r\n else:\r\n ans += solve(ff)\r\n ff = []\r\n sx += 1\r\n sy -= 1\r\n i += 1\r\n ans += solve(ff)\r\n\r\nprint(ans)\r\n" ]

[ "\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappop, heappush\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import gcd\r\n\r\ndef sol():\r\n n,m = map(int,input().split())\r\n if m > n:\r\n n,m = m,n\r\n ord = [(n,m)]\r\n while n != 0 and m != 0:\r\n if n > m:\r\n n,m = m,n\r\n m %= n\r\n ord.append((n,m))\r\n ord = ord[::-1]\r\n w = [0]\r\n for i in range(1, len(ord)):\r\n a,b = ord[i]\r\n x,y = ord[i-1]\r\n if w[-1] == 0:\r\n w.append(1)\r\n else:\r\n cnt = (a-y)//b\r\n if cnt % (b+1) % 2 == 0:\r\n w.append(1)\r\n else:\r\n w.append(0)\r\n if w[-1] == 1:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n return \r\n \r\n\r\n\r\nT = int(input())\r\nfor i in range(T):\r\n sol()", "def f(a,b):\r\n\tif a>b:a,b=b,a\r\n\tif a==0:return False\r\n\tif not f(b%a,a):return True\r\n\treturn False if (b//a)%(a+1)&1 else True\r\nfor i in range(int(input())):\r\n\ta,b=map(int,input().split())\r\n\tprint('First' if f(a,b) else 'Second')", "def solve(a, b):\r\n if a == 0:\r\n return False\r\n if solve(b % a, a):\r\n b //= a\r\n return not (b % (a + 1) & 1)\r\n return True\r\n\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n\r\n if a > b:\r\n a, b = b, a\r\n\r\n if solve(a, b):\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n" ]

[ "a,b,n = map(int,input().split())\r\ncheck = 1\r\nif a%b==0:\r\n print(a*(10**n))\r\nelse:\r\n check = 0\r\n for y in range(10):\r\n if (a*10+y)%b==0:\r\n a = a*10+y\r\n check = 1\r\n break\r\n else:\r\n pass\r\n if check==0:\r\n print(-1)\r\n else:\r\n print(a*(10**(n-1)))", "a,b,n=map(int,input().split())\r\nN=n\r\nc=0\r\nif(a%b==0):\r\n print(int(str(a)+'0'*n))\r\nelse:\r\n for i in range(n):\r\n for j in range(0, 10):\r\n s = str(a) + str(j)\r\n num = int(s)\r\n if (num % b == 0):\r\n ans = num\r\n break\r\n else:\r\n c += 1\r\n if (c == n * 10):\r\n print(-1)\r\n else:\r\n if(len(str(num))==N+len(str(a))):\r\n print(num)\r\n else:\r\n l=len(str(a))+n-len(str(num))\r\n number=int(str(num)+'0'*l)\r\n print(number)\r\n", "a, b, n = map(int, input().split())\r\n\r\nres = -1\r\nfor d in range(10):\r\n if (a*10+d) % b == 0:\r\n res = a*10+d\r\n for i in range(1, n):\r\n res *= 10\r\n break\r\nprint(res)\r\n", "# https://codeforces.com/problemset/problem/260/A\r\n\r\n\"\"\"\r\nTwo numbers a and b\r\n\r\nYou can perform an operation of lengthening by:\r\n * adding one digit to the number to the right. The new number must be divisible by 5.\r\n\r\nDetermine whether it is possible to lengthen a n times. If yes print any lengthening.\r\nIf not print -1.\r\n\r\nTry adding digits from 0 to 9. If none of those work then it is impossible.\r\nAfter that just chuck in a load of zeros as those don't change divisibility.\r\n\"\"\"\r\n\r\na, b, n = map(int, input().split())\r\n\r\nflag = 0 # Initially assume impossible\r\nfor i in range(10):\r\n if int(str(a) + str(i)) % b == 0:\r\n flag = 1\r\n break\r\n\r\nif flag:\r\n print(str(a) + str(i) + '0'*(n-1))\r\nelse:\r\n print(-1)\r\n\r\n", "flag = False\r\na,b,n = (int(i) for i in input().split())\r\nfor i in range(10):\r\n c = a*10 + i;\r\n if(c%b == 0):\r\n flag = 1\r\n break\r\nif(flag):\r\n print(c,'0' * (n-1),sep = '')\r\nelse:\r\n print(-1)", "a, b, n = [int(x) for x in input().split()]\r\nfor i in range(10):\r\n temp = str(a) + str(i)\r\n if(int(temp) % b == 0):\r\n a = temp\r\n break\r\nif(int(a) % b != 0):\r\n a = -1\r\nelse:\r\n a = a + ('0'*(n-1))\r\nprint(a)", "n,a,b = map(int,input().split())\r\nm=0\r\nfor i in range(10):\r\n if((n*10+i)%a==0):\r\n n = n*10+i\r\n m=1\r\n break\r\nif m:\r\n print(str(n)+'0'*(b-1))\r\nelse:\r\n print(-1)\r\n", "import math\r\nflag=True\r\na,b,n=[int(i) for i in input().split(' ')]\r\nfor i in range(n):\r\n if(i==0):\r\n num=math.ceil(a*10/b)\r\n newa=num*b\r\n if(a!=int(newa/10)):\r\n flag=False\r\n break\r\n else:\r\n a=newa\r\n else:\r\n a=str(a)+\"0\"*(n-i)\r\n break\r\nif(flag):\r\n print(a)\r\nelse:\r\n print(\"-1\")\r\n", "a, b, n = list(map(int, input().split()))\na *= 10\nfor k in range(10):\n if (a + k) % b == 0:\n a += k\n break\nif a % b != 0:\n print(-1)\nelse:\n print(str(a) + '0' * (n-1))\n", "a,b,n = map(int,input().split())\r\nflag = False\r\nfor i in range(0,10):\r\n\tif (a*10+i)%b==0:\r\n\t\tprint(a*10+i,end='')\r\n\t\tprint('0'*(n-1))\r\n\t\tflag = True\r\n\t\tbreak\r\n\r\nif not flag:\r\n\tprint(-1)\r\n\t", "from sys import stdin,stdout\r\nimport math\r\na,b,n=map(int,stdin.readline().split())\r\ny=1\r\na=a*10\r\ni=0\r\nflag=0\r\nfor i in range(10):\r\n k=a+i\r\n if k%b==0:\r\n a=k\r\n flag=1\r\n break\r\nif flag==0:\r\n stdout.write(\"-1\")\r\nelse:\r\n a=str(a)\r\n a=a+('0'*(n-1))\r\n stdout.write(a)", "a,b,n=map(int,input().strip().split())\r\nif a%b==0:\r\n s='0'\r\n s=s*n\r\n print(str(a)+s)\r\nelse:\r\n for i in range(0,10):\r\n if (a*10+i)%b==0:\r\n s='0'\r\n s=s*(n-1)\r\n a=a*10+i\r\n print(str(a)+s)\r\n break\r\n else:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, n = map(int, input().split())\r\n\r\nx = map(str, list(range(10)))\r\nn -= 1\r\nfor i in x:\r\n q = str(a) + i\r\n if int(q) % b == 0:\r\n a = q\r\n break\r\nelse:\r\n print(-1)\r\n exit(0)\r\n\r\na += '0'*n\r\nprint(a)", "a, b, n = map(int, input().split())\r\na = str(a)\r\nfor i in range(0, 10):\r\n if int(a + str(i)) % b == 0:\r\n a = str(int(a + str(i)))\r\n a = a + (n-1)*'0'\r\n print(a)\r\n break\r\n elif i == 9:\r\n print(-1)\r\n break\r\n", "import sys\n\na,b,n = map(int,input().split(' '))\n\nworks = -1\nfor i in range(10):\n new = a * 10 + i\n if new % b == 0:\n works = new\n break\nif works == -1:\n print(-1)\n sys.exit(0)\nprint(str(works) + '0' * (n - 1))\n\n", "a,b,n=map(int,input().split())\r\na=str(a)\r\nflag=True\r\nfor i in range(10):\r\n if int(a+str(i))%b==0:\r\n a=int(a+str(i))\r\n flag=False\r\n break\r\nif flag:\r\n print(-1)\r\nelse:\r\n a=int (str(a)+\"0\"*(n-1))\r\n print(a)", "\r\n\r\na, b, n = map(int, input().split())\r\n\r\n\r\ncurr = (a % b) * 10\r\nquotient = a // b\r\n\r\nto_add = 0\r\nis_found = False\r\nfor i in range(10):\r\n if (curr + i) % b == 0:\r\n to_add = i\r\n is_found = True\r\n break\r\n\r\nif is_found:\r\n a = a * 10 + to_add\r\n n -= 1\r\n while n > 0:\r\n a *= 10\r\n n -= 1\r\n\r\n print(a)\r\nelse:\r\n print(-1)\r\n", "def addNDigits(a, b, n) : \r\n num = a\r\n for i in range(10) : \r\n tmp = a * 10 + i \r\n if (tmp % b == 0) : \r\n a = tmp \r\n break\r\n if (num == a) : \r\n return -1\r\n for j in range(n - 1) : \r\n a *= 10\r\n return a\r\na,b,n=map(int,input().split())\r\nprint(addNDigits(a,b,n))", "\n# _____ _ _ _ _ _ __ _ _ _ _ \n# / ___|| | (_)| | (_) | | / / (_) | | (_)| | \n# \\ `--. | |__ _ | |_ ___ _ _ _ __ ___ _ | |/ / __ _ _ __ ___ _ _ __ ___ __ _ ___ | |__ _ | |_ __ _ \n# `--. \\| '_ \\ | || __|/ __|| | | || '__|/ _ \\| | | \\ / _` || '_ ` _ \\ | || '_ ` _ \\ / _` |/ __|| '_ \\ | || __|/ _` |\n# /\\__/ /| | | || || |_ \\__ \\| |_| || | | __/| | _ | |\\ \\| (_| || | | | | || || | | | | || (_| |\\__ \\| | | || || |_| (_| |\n# \\____/ |_| |_||_| \\__||___/ \\__,_||_| \\___||_|( ) \\_| \\_/ \\__,_||_| |_| |_||_||_| |_| |_| \\__,_||___/|_| |_||_| \\__|\\__,_|\n# |/ \n\n# file = open(\"input\", \"r\")\ndef getIn():\n\t# return file.readline().strip()\n\treturn input().strip()\n\na, b, n = list(map(int, getIn().split(\" \")))\ndone = False\nfor j in range(9, -1, -1):\n\ta_ = a * 10 + j\n\tif a_ % b == 0:\n\t\ta = a_\n\t\tdone = True\n\t\tn -= 1\n\t\tbreak\nif not done:\n\tprint(-1)\nelse:\n\tprint(int(str(a) + n*'0'))", "a, b, n = map(str, input().split())\r\nb, n = int(b), int(n)\r\nfirst = a\r\npassedfirst = False\r\nfor j in range(10):\r\n m = a + str(j)\r\n k = int(m)\r\n if k % b == 0:\r\n passedfirst = True\r\n a = m\r\n break\r\n\r\nif not passedfirst: \r\n print(-1)\r\nelse: \r\n print(a+\"0\"*(n-1))", "a, b, n = map(int, input().split())\r\nflag = False\r\nfor i in range(10):\r\n if int(str(a) + str(i))%b == 0:\r\n flag = True\r\n ans = str(a) + str(i)\r\n break\r\n\r\nif flag:\r\n print(ans + \"0\" * (n-1))\r\nelse:\r\n print(-1)", "a,b,n = [int(x) for x in input().split()]\r\n\r\nnum = a*10\r\nfound = False\r\nfor x in range(10):\r\n if (num + x) % b == 0:\r\n num += x\r\n found = True\r\n break\r\nif found:\r\n print(num, end='')\r\n rem = ['0']*(n-1)\r\n print(\"\".join(rem))\r\nelse:\r\n print(\"-1\")\r\n ", "def solve(a,b,c):\r\n k=a*10 \r\n p=0\r\n for i in range(10):\r\n if (k+i)%b==0:\r\n a=k+i\r\n p=1\r\n break\r\n if p==0:\r\n print(-1)\r\n return\r\n a*=10**(c-1)\r\n print(a)\r\n return\r\na,b,c=map(int,input().split())\r\nsolve(a,b,c)", "a,b,n=map(int,input().split())\r\nflag=False\r\nfor i in range(0,10):\r\n \r\n s=a*10+i\r\n # print(s)\r\n if s%b==0:\r\n flag=True\r\n break\r\nif flag==False:\r\n print(-1)\r\nelse:\r\n print(str(s)+(n-1)*\"0\")\r\n ", "a, b, n = map(int, input().split())\r\n\r\na = a*10\r\ny = b - a%b\r\n\r\n\r\nif( y%b > 9):\r\n print(-1)\r\n\r\nelse:\r\n a = a + y%b\r\n s = \"\"\r\n for i in range(1, n):\r\n s = s + \"0\"\r\n print(str(a) + s, end=\"\")", "a,b,n = map(int,input().split())\r\ns = str(a)\r\ns1 = s\r\nfor j in range(0,10):\r\n s = s + str(j)\r\n if int(s)%b == 0 :\r\n \r\n break\r\n else:\r\n s = s1\r\nif s==s1:\r\n print(-1)\r\nelse:\r\n s = s + '0'*(n-1)\r\n print(int(s))\r\n\r\n", "a , b , n = map(int , input().split())\r\nc=a\r\nk=0\r\nfor j in range( 10):\r\n c*=10\r\n c+=j\r\n \r\n if c%b==0:\r\n k+=1\r\n break\r\n c = a\r\nif k == 0:\r\n print(-1)\r\nelse:\r\n print(str(c)+'0'*(n-1))\r\n \r\n", "a,b,n=map(int,input().split())\r\nf=-1\r\nfor i in range(0,10):\r\n\tif(int(str(a)+str(i))%b==0):\r\n\t\tf=0\r\n\t\tans=str(a)+str(i)+\"0\"*(n-1)\r\n\t\tbreak\r\nif(f==-1):\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans)\r\n", "n = list(map(int,input().split()))\r\n\r\ntemp = n[0]*10\r\nfor j in range(10):\r\n\tif (temp+j)%n[1] == 0:\r\n\t\tn[0] = temp+j\r\n\t\tprint(n[0]*(10**(n[2]-1)))\r\n\t\tbreak\r\nelse:\r\n\tprint(-1)", "l=[int(i) for i in input().split()]\r\na=l[0]\r\nb=l[1]\r\nn=l[2]\r\nc=\"\"\r\nf=True\r\nfor i in range(10):\r\n if int(str(a)+str(i))%b==0:\r\n c=str(a)+str(i)\r\n f=False\r\n break\r\nif f:\r\n print(-1)\r\nelse:\r\n for i in range (n-1):\r\n c+=\"0\"\r\n print(c,end=\"\\n\")\r\n \r\n", "from time import sleep as sle\r\n\r\ndef solve():\r\n\ta,b,n = [int(q) for q in input().split()]\r\n\tif a%b==0:\r\n\t\tprint(\"%d%s\"%(a,'0'*n))\r\n\telse:\r\n\t\tL = [int(\"%d%d\"%(a,q))%b==0 for q in range(10)]\r\n\t\tif True in L:\r\n\t\t\tprint(\"%d%d%s\"%(a,L.index(True),'0'*(n-1)))\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\r\nsolve()", "a , b , c = map(int,input().split())\r\nok = True\r\n\r\na = a *10\r\nx = b - (a % b) if a % b != 0 else 0\r\nif (a + x)//10 != a//10:\r\n ok = False\r\ns = \"\"\r\na+=x\r\nif ok :\r\n while c != 1:\r\n s+='0'\r\n c-=1\r\nif ok : \r\n print(a,s,sep = '')\r\nelse:\r\n print(\"-1\")\r\n ", "\r\n\r\na, b, n = [str(x) for x in input().split()]\r\n\r\nfor i in range(10):\r\n if int(a+str(i)) % int(b) == 0:\r\n print(a+str(i) + (int(n)-1)*'0')\r\n break\r\nelse:\r\n print('-1')\r\n", "[a,b,n]=[int(i) for i in input().split()]\r\ndef prob(a,b,n):\r\n if(n==0):\r\n return(a)\r\n else:\r\n for i in range(0,10):\r\n if((10*a+i)%b==0):\r\n return((10*a+i)*10**(n-1))\r\n return -1\r\n\r\nprint(prob(a,b,n))", "n, m, k = map(int, input().split())\r\nf = 0\r\nfor i in range(0, 10):\r\n\tif int(str(n)+str(i)) % m == 0:\r\n\t\tn = str(n)+str(i)\r\n\t\tf = 1\r\n\t\tk -= 1\r\n\t\tbreak\r\nprint(n+''.join(['0' for i in range(k)])) if f == 1 else print(-1)", "\n\n\ndef main():\n a,b,n = map(int, input().split())\n for i in range(10):\n temp = a*10 + i\n if temp%b == 0:\n print(temp, end=\"\")\n print((n-1) * \"0\")\n return\n print(-1)\n \n\n\nif __name__==\"__main__\":\n main()\n", "a, b, n = map(int, input().split(' '))\r\nf = False\r\nfor i in range(10):\r\n if ((a*10 + i)%b == 0):\r\n print(a*10 + i, '0'*(n-1), sep='')\r\n f = True\r\n break\r\n \r\nif (not f):\r\n print(-1)", "import sys\r\na,b,n=map(int,input().split())\r\nflag=True\r\nfor i in range(10):\r\n if(10*a+i)%b==0:\r\n flag=False\r\n a=10*a+i\r\n break\r\n\r\nif(flag):\r\n print(-1)\r\n sys.exit()\r\nprint(str(a) + '0'*(n-1))\r\n \r\n \r\n \r\n \r\n \r\n\r\n", "a,b,n=map(int,input().split())\r\nif(a%b==0):\r\n a = str(a)\r\n for i in range(n):\r\n a+=\"0\"\r\nelse:\r\n flag = 1\r\n for j in range(0, 10):\r\n if(int(str(a)+str(j))%b==0):\r\n a = int(str(a)+str(j))\r\n n-=1\r\n flag = 0\r\n a = str(a)+(\"0\"*n)\r\n break\r\n \r\n if(flag==1):\r\n a = -1\r\n \r\nprint(a)\r\n\t ", "a,b,n=map(int,input().split())\r\nR=-1\r\nfor i in range(10):\r\n r=a*10+i\r\n if r%b==0:\r\n R=str(r)+'0'*(n-1)\r\n break\r\nprint(R)", "def solve():\r\n a, b, n = map(int, input().split())\r\n\r\n for d in range(10):\r\n u = a * 10 + d\r\n if u % b == 0:\r\n print(str(u) + '0' * (n - 1))\r\n return\r\n print(\"-1\")\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n solve()", "a, b ,n = map(int, input().split())\r\nif b % 2 == 0:\r\n for i in range(0,10,2):\r\n temp = a\r\n temp = temp*10 + i\r\n if temp % b == 0:\r\n print(temp*(10**(n-1)))\r\n break\r\n else:\r\n print(-1)\r\nelse:\r\n for i in range(10):\r\n temp = a\r\n temp = temp*10 + i\r\n if temp % b == 0:\r\n print(temp*(10**(n-1)))\r\n break\r\n else:\r\n print(-1)\r\n", "a,b,n = map(int,input().split())\r\n\r\n\r\na = a*10 + 9\r\nrem = a%b\r\nif rem<=9:\r\n a-=rem\r\nelse:\r\n print(-1)\r\n quit()\r\n\r\nn-=1\r\n\r\nprint(str(a)+\"0\"*n)\r\n", "a,b,c=list(map(int,input().split()))\r\ndef hello():\r\n for i in range(0,10):\r\n d=str(a)+str(i)\r\n if int(d)%b==0:\r\n for i in range(c-1):\r\n d=d+\"0\"\r\n return d\r\n return -1 \r\nprint(hello())", "a,b,n=map(int,input().split())\r\nans=-1\r\na=int(str(a)+\"9\")\r\nr=a%b\r\nif(r>9):\r\n None\r\nelse:\r\n a=a-r\r\n ans=str(a)+\"0\"*(n-1)\r\nprint(ans)", "a,b,n = map(int, input().split(' '))\r\na = a*10\r\n\r\nfor i in range(10):\r\n if (a+i)%b == 0:\r\n print(str(a+i)+\"0\"*(n-1))\r\n exit()\r\nprint(-1)", "a,b,n=map(int,input().split())\r\nflag=True\r\nif (a*10)%b==0:\r\n a=str(a*10)+\"0\"*(n-1)\r\nelif ((a*10)%b+9)>=b:\r\n a=str(a*10 + b-(a*10)%b)+\"0\"*(n-1)\r\nelse:\r\n flag=False\r\nprint([-1,a][flag])\r\n\r\n", "#code\r\na, b, n = map(int, input().split())\r\nx = 10 * a\r\ny = -1\r\nfor i in range(10):\r\n if((x + i) % b == 0):\r\n y = x + i\r\nif(y == -1):\r\n print(-1)\r\n \r\nelse:\r\n y = str(y)\r\n for i in range(n - 1):\r\n y = y + '0'\r\n print(y)\r\n ", "a, b, n = map(int, input().split())\r\nfound = 0\r\nfor i in range(10):\r\n if not (a * 10 + i) % b:\r\n print(a, i, '0' * (n - 1), sep = '')\r\n found = 1\r\n break\r\nif not found: print(-1)", "a,b,c = input().split()\nb = int(b)\nc = int(c)\nisValid = False\nfor i in range(10):\n s_ = a + str(i)\n if int(s_) % b == 0:\n a = s_\n isValid = True\n break\nif not isValid:\n print(-1)\nelse:\n for i in range(c-1):\n a += \"0\"\n print(a)\n", "a, b, n = map(int, input().split())\r\n\r\n\r\nnew = -1\r\nfor i in range(10):\r\n next_ = a*10+i\r\n if next_%b == 0:\r\n new = str(next_)+'0'*(n-1)\r\n break\r\nprint(new)", "a,b,n = map(int,input().split())\r\nx = False\r\na = str(a)\r\n\r\nfor i in range(10):\r\n\tif int(a + str(i)) % b == 0:\r\n\t\ta = a + str(i)\r\n\t\tn -= 1\r\n\t\tx = True\r\n\r\nif(x):\r\n\tprint(a + '0'*n)\r\nelse:\r\n\tprint(-1)", "a,b,n=map(int,input().split())\r\nboo=False\r\nfor i in range(10):\r\n if (a*10+i)%b==0:\r\n boo=True\r\n a=a*10+i\r\n break\r\na=str(a)\r\nfor i in range(n-1):\r\n a=a+'0'\r\nif boo:\r\n print(a)\r\nelse:\r\n print(-1)\r\n\r\n \r\n", "import math\r\ndef solve(a, b, n):\r\n t = a\r\n for i in range (10):\r\n t = (t * 10) + i\r\n if t % b == 0:\r\n return t * (10**(n - 1))\r\n t = a\r\n \r\n return -1\r\n \r\na, b, n = map(int, input().strip().split(\" \"))\r\n\r\nprint(solve(a, b, n))\r\n\r\n\r\n", "l=[int(x) for x in input().split()]\r\na=l[0]\r\nb=l[1]\r\nn=l[2]\r\nfor i in range(10):\r\n if (a*10+i)%b==0:\r\n a=a*10+i\r\n break\r\nif a==l[0]:\r\n print('-1')\r\nelse:\r\n for i in range(n-1):\r\n a=a*10\r\n print(a)", "a,b,n=map(int,input().split())\r\np=0\r\nfor i in range(10):\r\n if((int(str(a)+str(i)))%b==0):\r\n a=int(str(a)+str(i))\r\n n=n-1\r\n p=1\r\n break\r\nif(p==0):\r\n print(-1)\r\nelif(n>0):\r\n print(int(str(a)+('0'*n)))\r\nelse:\r\n print(a)\r\n ", "a, b, n = [int(x) for x in input().split()]\r\n\r\ns1 = str(a)\r\ns2 = \"\"\r\n\r\n\r\nnumbers = [s1+'0', s1+'1', s1+'2', s1+'3', s1+'4', s1+'5', s1+'6', s1+'7', s1+'8', s1+'9']\r\n\r\nflag = False\r\nfor i in numbers:\r\n if(int(i)%b==0):\r\n flag = True\r\n s2 += i\r\n break\r\n\r\nif(flag==False):\r\n print(-1)\r\n quit()\r\n \r\nelse:\r\n for i in range(0, n-1, 1):\r\n s2 += '0'\r\n \r\nprint(s2)\r\n", "a,b,n=map(int,input().split())\r\nif a%b==0:\r\n print(str(a)+\"0\"*n)\r\n exit()\r\na=str(a)\r\nflag=0\r\nfor i in range(10):\r\n p=int(a+str(i))\r\n if p%b==0:\r\n a=str(p)\r\n flag=1\r\n break\r\nif flag:\r\n print(a+\"0\"*(n-1))\r\nelse:\r\n print(-1)", "(a,b,n)=map(int,input().split())\r\nl=[]\r\nfor i in range (0,9+1):\r\n c=int(str(a)+str(i))\r\n if c%b==0:\r\n l.append(c)\r\nif len(l)==0:\r\n print(-1)\r\nelse:\r\n print(l[0]*(10**(n-1)))\r\n \r\n \r\n\r\n \r\n\r\n \r\n", "def scan(type):\r\n return list(map(type, input().split()))\r\na,b,n, = scan(int)\r\n\r\na = str(a)\r\nans = -1\r\n\r\nfor i in range(10):\r\n temp = int(a + str(i))\r\n if (temp%b == 0):\r\n ans = str(temp) + (n-1)*'0'\r\nprint(ans)\r\n", "a,b,n=[int(i) for i in input().split()]\r\nt=False\r\nfor i in range(0,10):\r\n if (a*10+i)%b==0:\r\n a=a*10+i\r\n t=True\r\n break\r\nprint(str(a)+'0'*(n-1) if t else '-1')", "a,b,n=map(int,input().split())\r\nflag=0\r\nstr1=str(a)\r\nfor i in range(10):\r\n if int(str1+str(i))%b==0:\r\n str1+=str(i)\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"-1\")\r\nelse:\r\n print(str1+\"0\"*(n-1))", "v, div, n = map(int, input().split())\r\nfor dig in range(10):\r\n if (v * 10 + dig) % div == 0:\r\n v = v * 10 + dig\r\n print('%d%s' % (v, '0' * (n - 1)))\r\n exit()\r\nprint(-1)", "# cook your dish here\r\na,b,n=map(int,input().split())\r\nt=0\r\ns=str(a)\r\nt=0\r\nfor j in range(0,10):\r\n k=s+str(j)\r\n if(int(k)%b==0):\r\n p=str(a)\r\n p+=str(j)\r\n a=int(p)\r\n t=1\r\n break\r\nif(t==0):\r\n print(-1)\r\nelse:\r\n a=str(a)\r\n for i in range(n-1):\r\n a+=str(0)\r\n print(a)", "a,b,n = input().split()\r\nn=int(n)\r\nb=int(b)\r\na=int(a)\r\ncnt=0\r\ns=a;\r\nfor j in range(10):\r\n s=(a*10)+j\r\n if s%b==0:\r\n a=s\r\n cnt=1\r\n break\r\n else:\r\n s=a\r\nn=n-1\r\nif cnt==1:\r\n print(a,end=\"\")\r\n for i in range(n):\r\n print(0,end=\"\")\r\n print(\"\")\r\nelse:\r\n print(-1)\r\n", "def adding_digits():\r\n a,b,n = list(map(int, input().split(\" \")))\r\n tester = -1\r\n for i in range(10):\r\n if (a * 10 + i) % b == 0:\r\n a = a * 10 + i\r\n n -= 1\r\n tester = a * (10**n)\r\n break\r\n print(tester)\r\n\r\nadding_digits()", "a,b,n = map(int, input().split())\r\nrem = 10*a%b\r\nif b-rem < 10:\r\n print(str(10*a+b-rem)+'0'*(n-1))\r\nelif rem == 0:\r\n print(str(a) + '0'*n)\r\nelse:\r\n print(-1)\r\n", "a , b , x = map( int , input( ).split( ) )\r\na = a * 10 + 9\r\nif( a % b ) < 10 :\r\n print( str( a - a % b ) + '0' * ( x - 1 ) )\r\nelse :\r\n print( -1 )", "import sys\r\nabn=input().split()\r\na=int(abn[0])\r\nb=int(abn[1])\r\nn=int(abn[2])\r\n\r\nfor i in range(10):\r\n if (a*10+i)%b==0:\r\n a=a*10+i\r\n break\r\nelse:\r\n print(-1)\r\n sys.exit(0)\r\n\r\n\r\nprint(a,'0'*(n-1),sep=\"\")", "def main():\r\n [a, b, n] = [int(x) for x in input().split()]\r\n k = -1\r\n for i in range(10):\r\n if ((a * 10 + i) % b == 0): k = i\r\n print(str(a*10+k)+'0'*(n-1)) if k != -1 else print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a, b, n = map(int, input().split())\r\n\r\n# Initialize a flag to check if a valid number can be formed\r\nfound = False\r\n\r\n# Try appending each digit from 0 to 9 to 'a' and check if it becomes divisible by 'b'\r\nfor i in range(10):\r\n if (a * 10 + i) % b == 0:\r\n a = a * 10 + i\r\n found = True\r\n break\r\n\r\n# If a valid number couldn't be formed, output -1\r\nif not found:\r\n print(-1)\r\nelse:\r\n # Append (n - 1) more digits to 'a' that are divisible by 'b'\r\n for _ in range(n - 1):\r\n a = a * 10\r\n print(a)\r\n", "def solve(a,b,n):\r\n\t\r\n\tfor i in range(10):\r\n\t\tnum = a*10 + i\r\n\t\tif num % b == 0:\r\n\t\t\tnum = num * 10**(n-1)\r\n\t\t\treturn num\r\n\treturn -1\r\n\r\nif __name__ == \"__main__\":\r\n\ta,b,n = list(map(int, input().strip().split(' ')))\r\n\topt = solve(a,b,n)\r\n\r\n\tprint(opt)", "a,b,n=map(int,input().split())\r\naa=a\r\nflag=False\r\nfor _ in range(n):\r\n for i in range(a*10,a*10+10):\r\n if i%b==0:\r\n a=i\r\n flag=True\r\n break\r\n if flag==True:\r\n # a=a*(10**(len(str(aa))+n)-len(str(a)))\r\n break\r\nprint(str(a)+\"0\"*(len(str(aa))+n-len(str(a))) if flag else -1)", "a, b, n = map(int, input().split())\r\nrem = (10 * a) % b\r\nif b - rem >= 10 and rem != 0:\r\n print(-1)\r\nelse :\r\n print(str(a) + str((b - rem) if rem != 0 else 0) + \"0\" * (n - 1))\r\n\r\n\r\n", "#!/usr/bin/env python3\n\ndef main():\n a, b, n = map(int, input().split())\n ok = False\n\n for d in range(10):\n p = a*10 + d\n if not (p % b):\n a = p\n ok = True\n break\n \n print(str(a) + \"\".join(\"0\"*(n-1)) if ok else \"-1\")\n\nif __name__ == \"__main__\":\n main()\n\n", "a,b,n= map(int,input().split())\n\n\n\na=a*10+9;\n\n\n\nif a%b<10:\n\n print (str(a-a%b)+\"0\"*(n-1))\n\nelse:\n\n print (-1)", "a,b,c = map(int, input().split())\r\na = [int(x) for x in str(a)]\r\n\r\nfor i in range(10):\r\n a+=[i]\r\n r = [str(j) for j in a]\r\n r = int(\"\".join(r))\r\n if r%b==0:\r\n print(str(r) + '0'*(c-1))\r\n exit()\r\n del a[-1]\r\nprint(-1)", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\na, b, n = IL()\r\na1 = [a*10 + i for i in range(10) if (a*10 + i) % b == 0]\r\nif not a1:\r\n print(-1)\r\nelse:\r\n print(str(a1[0]) + '0' * (n-1))", "a,b,n = map(int,input().split())\r\n\r\nfor i in range(1,10):\r\n if int(str(a)+str(i))%b==0:\r\n a = int(str(a)+str(i))\r\n n-=1\r\na = int(str(a)+n*\"0\")\r\n\r\nif a%b==0:\r\n print(a)\r\nelse:\r\n print(-1)\r\n", "a,b,n = map(int,input().split())\r\n\r\ns = str(a)\r\ndef tra(a,b,n):\r\n\tfor i in range(10):\r\n\t\tif (a*10+i)%b==0:\r\n\t\t\treturn s+str(i)+\"0\"*(n-1)\r\n\treturn -1\r\n\r\nprint(tra(a,b,n))\r\n", "from sys import stdin\r\na,b,n = map(int, stdin.readline().rstrip().split(\" \"))\r\n\r\na = a*10\r\ncheck = a%b\r\nif check!=0:\r\n if b-check > 9:\r\n a = -1\r\n else:\r\n a = a + b- check\r\nif a ==-1:\r\n print(a)\r\nelse:\r\n print(a*10**(n-1))\r\n\r\n", "import collections as cc\r\nimport sys\r\n#input=sys.stdin.readline\r\nI=lambda:list(map(int,input().split()))\r\na,b,n=I()\r\na1=a*10+9\r\na1-=(a1%b)\r\nif a1>=10*a:\r\n print(str(a1)+'0'*(n-1))\r\nelse:\r\n print(-1)", "a, b, n = map(int, input().split(\" \"))\r\na = str(a)\r\nc = 0\r\nfor i in range(10):\r\n if (int(a + str(i)) % b == 0):\r\n a = a + str(i)\r\n break\r\n else:\r\n c = c + 1\r\n\r\n\r\nif c == 10:\r\n print(-1)\r\nelse:\r\n print(a + '0' * (n - 1))\r\n", "a,b,n = map(int, input().split())\r\nso = str(a)\r\nkq = 1\r\nsolan = 0\r\nwhile kq == 1 and solan <= n and int(so) % b != 0:\r\n chiahet = 0\r\n for i in range(0,10):\r\n if int(so+str(i)) % b == 0 and chiahet == 0:\r\n so = so+str(i)\r\n chiahet = 1\r\n if chiahet == 0:\r\n kq = 0\r\n solan += 1\r\n\r\nif kq == 0:\r\n print(-1)\r\nelse:\r\n if int(so) % b == 0:\r\n print(int(so)*10**(n - solan))\r\n else:\r\n print(so)", "a,b,n=map(int,input().split())\r\ns='-1'\r\nfor i in range(10):\r\n if (10*a + i)%b==0:\r\n s=str(10*a + i)+ '0'*(n-1)\r\n break\r\nprint(s)", "#!/usr/bin/env python3\n\ndef main():\n a, b, n = map(int, input().split())\n\n for d in [a*10 + i for i in range(10)]:\n if not (d % b):\n print(str(d) + \"0\"*(n-1))\n return\n \n print(-1)\n\nif __name__ == \"__main__\":\n main()\n\n", "a, b, n = map(int,input().split())\r\ns=\"\"\r\nfor k in range(n-1):\r\n s+=\"0\"\r\nfound = False\r\nfor i in range(0,10):\r\n if(a*10+i)%b==0:\r\n print(a*10+i,end=\"\")\r\n print(s,end=\"\")\r\n found=True\r\n break\r\nif not found:\r\n print(-1)", "a, b, n = map(int, input().split())\r\nf = 0\r\na *= 10\r\nwhile True:\r\n if a % b == 0:\r\n break\r\n a += 1\r\n if a % 10 == 0:\r\n f = 1\r\n break\r\nif f == 0:\r\n n -= 1\r\n a *= (10 ** n)\r\n print(a)\r\nelse:\r\n print(-1)\r\n", "a,b,n=list(map(int,input().split(\" \")))\nrem=[None]*n\nrem[0]=10%b\nfor i in range(1,n):\n rem[i]=(rem[i-1]*(10%b))%b\nans=str(a)\ncur_rem=a%b\nfor i in range(n):\n flags=0\n for j in range(10):\n temp=((((cur_rem%b)*(rem[i]%b))%b)+(j%b))%b\n if(temp==0):\n ans+=str(j)\n flags=1\n break\n if(flags==0):\n print(-1)\n break\n else:\n cur_rem=temp\nif(flags==1):\n print(ans)\n \n", "a,b,n=map(int,input().split())\r\na*=10\r\nflag=False\r\nfor i in range(0,10):\r\n if (a+i) % b == 0 :\r\n a+=i\r\n flag=True\r\n break\r\n\r\nif flag == True :\r\n print(a*(10**(n-1)))\r\nelse:\r\n print(-1)\r\n", "a, b, n = map(int, input().split())\r\ndata=-1\r\nfor t in range(10):\r\n new = a * 10 + t\r\n if new%b==0:\r\n data=str(new)+\"0\"*(n-1)\r\n break\r\nprint(data)", "a,b,n = map(int,input().split())\r\nflag = 0\r\na = (a * 10) + 9\r\ncheck = a % b\r\nif check < 10:\r\n a = a - check\r\nelse:\r\n flag = 1\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n for i in range(n-1):\r\n a = a * 10\r\n print(a)\r\n", "a,b,n=map(int,input().split())\r\nc=((a%b)*(10%b))%b\r\nd=b-c\r\nif d<=9:\r\n print(((a*10)+(d))*pow(10,n-1))\r\nelif c==0:\r\n print(a*pow(10,n))\r\nelse:\r\n print(-1)", "a, b, n = map(int, input().split())\r\ncall_stack = [(a, n, a%b)]\r\nwhile call_stack:\r\n a, n, r = call_stack.pop()\r\n if n == 0:\r\n print(a)\r\n break\r\n for d in range(10):\r\n if not (10*r + d) % b:\r\n call_stack.append((10*a + d, n-1, (10*r + d)%b))\r\nelse:\r\n print(-1)\r\n", "a,b,n=map(int,input().split())\r\nflag=0\r\nfor i in range(10):\r\n if int(str(a)+str(i))%b==0:\r\n a=str(a)+str(i)\r\n flag=1\r\n break\r\nprint(a+'0'*(n-1) if flag else -1)\r\n", "a,b,n = map(int,input().split());v = -1\r\nif a % b == 0:\r\n z = \"0\"*(n)\r\n v = f\"{a}{z}\"\r\nelse:\r\n for i in range(10):\r\n temp = ((a*10)+i)\r\n if temp%b == 0:\r\n z = \"0\"*(n-1)\r\n v = f\"{temp}{z}\"\r\n break\r\nprint(v)", "li = list(map(int, input().split()))\r\na = li[0]\r\nb = li[1]\r\nn = li[2]\r\n\r\nr = a % b\r\n\r\nfor i in range(10):\r\n if (10*r + i) % b == 0:\r\n n -= 1\r\n a = 10*a + i\r\n a = a*(10**n)\r\n print(a)\r\n exit()\r\nprint(-1)\r\n\r\n", "a, b, n = map(int,input().split(' '))\r\na = str(a)\r\nl = len(a)\r\n\r\nfor i in range(10):\r\n if int(a + str(i)) % b == 0:\r\n a += str(i)\r\n break\r\n \r\nif l == len(a):\r\n print(-1)\r\nelse:\r\n print(a + (n-1) * '0')", "a,b,n=map(int,input().split())\r\nfor i in range(10):\r\n if (a*10+i)%b==0:\r\n print(str(a*10+i)+('0'*(n-1)))\r\n exit(0)\r\nprint(-1)", "def solve(a,b,n):\n\n a = a*10\n flag = False\n\n for i in range(0,10):\n if (a+i)%b == 0:\n a = a+i\n flag = True\n break\n\n if flag is False:\n print(-1)\n else:\n print(str(a)+\"0\"*(n-1))\n\n\n\n\n\nif __name__ == '__main__':\n a,b,n= map(int,input().split())\n\n solve(a,b,n)", "a,b,n=map(int,input().split())\r\n\r\nfor _ in range(1):\r\n flag='no'\r\n for i in range(10):\r\n temp=str(a)+str(i)\r\n if int(temp)%b==0:\r\n a=temp\r\n flag='yes'\r\n break\r\n\r\nif flag=='no':print(-1)\r\nelse:\r\n a=a+('0'*(n-1))\r\n print(a)\r\n", "def main1():\n a,b,n = (int(x) for x in input().split())\n a = str(a)\n for i in range(n):\n switch = False\n for j in range(10):\n temp = a+str(j)\n if int(temp) % b == 0:\n a = temp\n switch = True\n break\n if switch == False:\n break\n if switch:\n print(a)\n else:\n print(-1)\n\ndef main():\n a,b,n = (int(x) for x in input().split())\n a = str(a)\n switch = True\n for j in range(10):\n if int(a+str(j)) % b == 0:\n a += str(j)\n switch = False\n break\n if switch:\n print(-1)\n else:\n print(a+\"0\"*(n-1))\n \nmain()\n", "a,b,n = map(int,input().split())\r\n\r\nif n == 0:\r\n if a % b == 0:\r\n print(a)\r\n else:\r\n print(-1)\r\n\r\n\r\nif n > 0:\r\n found = False\r\n for i in range(0,10):\r\n cur_num = int(str(a) + str(i))\r\n if cur_num % b == 0:\r\n res = int(str(cur_num) + '0'*(n-1))\r\n print(res)\r\n found = True\r\n break\r\n if not found:\r\n print(-1)\r\n", "a,b,n=map(int,input().split())\r\ns=str(a)\r\nx=0\r\nfor j in range(10):\r\n if int(s+str(j))%b==0:\r\n s=s+str(j)\r\n x=1\r\n break\r\nif x==0:\r\n print(\"-1\")\r\nelse:\r\n print(s+\"0\"*(n-1)) ", "a,b,n = map(int,input().split())\r\n\r\npossible = False\r\nans = str(a)\r\nfor i in range(10):\r\n\tc = a*10 + i\r\n\tif c%b == 0:\r\n\t\tpossible = True\r\n\t\tans = str(c)\r\n\t\tbreak\r\nif possible:\r\n\tfor i in range(1,n):\r\n\t\tans += \"0\"\r\n\tprint(ans)\r\nelse: \r\n\tprint(\"-1\")\r\n\t\t", "inp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\r\nl1 = inp2()\r\n\r\nans = l1[0]\r\n\r\nfor i in range(10):\r\n temp = int(str(ans) + str(i))\r\n if temp % l1[1] == 0:\r\n ans = temp\r\n break\r\n else:\r\n continue\r\n\r\nif len(str(ans)) != len(str(l1[0])) + 1:\r\n print(-1)\r\nelse:\r\n ans = int(str(ans) + '0'*(l1[2]-1))\r\n print(ans)", "a,b,n=map(int,input().split())\r\na=a*10\r\nif a%b==0:\r\n print(str(a)+'0'*(n-1))\r\nelse:\r\n f=0\r\n for i in range(1,10):\r\n if (a+i)%b==0:\r\n a=a+i\r\n f=1\r\n break\r\n if f==1:\r\n a=str(a)+'0'*(n-1)\r\n print(a)\r\n else:\r\n print(-1)", "a,b,n=map(int,input().split(' '))\r\nfor i in range(10):\r\n if((10*a+i)%b==0):\r\n print(10*a+i,end='')\r\n print('0'*(n-1))\r\n exit()\r\nprint(-1)", "a,b,n = [int(x) for x in input().split()]\nvalido = False\n\nfor i in range(10):\n\tif ((a*10+i) % b == 0):\n\t\ts = \"0\" * (n-1)\n\t\tvalido = True\n\t\ta *= 10\n\t\ta += i\n\t\tbreak\n\t\t\t\nif valido:\n\tprint(str(a) + s)\nelse:\n\tprint(-1)\n\n \t\t\t\t \t\t \t \t \t \t \t \t \t\t\t", "og,divisible,repeat=map(int,input().split())\r\nif repeat==0:\r\n print(n if og%divisible==0 else -1)\r\n\r\ni,count=0,0\r\ntemp=str()\r\nwhile(i<10):\r\n\r\n if int( str(og) + str(i) ) % divisible == 0:\r\n temp=str(og)+str(i)\r\n break\r\n else: i+=1 \r\n\r\nif i==10:\r\n print(-1)\r\n exit()\r\n # print(h,count,i)\r\nelse:\r\n print( str(temp) + ( '0'*( repeat-1 ) ) )\r\n exit()\r\n\r\n# print(h if count==repeat else -1)", "import math\n\n\ndef solve():\n a, b, n = list(map(int, input().split(\" \")))\n\n d1, m1 = divmod(a * 10, b)\n d2, m2 = divmod(a * 10 + 9, b)\n ans: str = \"\"\n if d1 < d2:\n ans = str(d2 * b)\n elif m1 == 0:\n ans = str(d1 * b)\n if ans == \"\":\n print(-1)\n return\n ans += \"\".join([\"0\"]*(n-1))\n print(ans)\n \n\n\n\nt = 1\nif False:\n t = int(input())\nfor _ in range(t):\n solve()\n", "a,b,n=[int(x) for x in input().split(' ')]\r\nbhul=True\r\nfor j in range(10):\r\n\tif((a*10+j)%b==0):\r\n\t\ta=a*10+j\r\n\t\tbhul=False\r\n\t\tbreak\r\nif(bhul):\r\n\tprint(-1)\r\nelse:\r\n\tfor x in str(a):\r\n\t\tprint(x,end='')\r\n\tfor i in range(n-1):\r\n\t\tprint(0,end='')", "a,b,n=[int(x) for x in input().split(' ')]\r\n# a,b,n=12,11,1\r\ndef apply(a,n):\r\n\tif(n==0):\r\n\t\treturn a\r\n\tfor i in range(10):\r\n\t\ttemp=a*10 + i\r\n\t\tif(temp%b==0):\r\n\t\t\treturn temp*(10**(n-1))\r\n\t\t\t# return apply(temp,n-1)\r\n\treturn -1\r\nprint(apply(a,n))", "a, b, n = map(int, input().split())\r\npossible = False\r\nfor i in range(10):\r\n if (a * 10 + i) % b == 0:\r\n possible = True\r\n t = str(a) + str(i)\r\n break\r\nif possible:\r\n t = t + (n - 1) * '0'\r\n print(t)\r\nelse:\r\n print(-1)\r\n", "l=list(map(int,input().split()))\r\na=l[0]\r\nb=l[1]\r\nn=l[2]\r\n\r\nx=-1\r\nfor i in range(10):\r\n r=a*10+i\r\n if r%b==0:\r\n x=str(r)+'0'*(n-1)\r\nprint(x)", "a,b,n = map(int, input().split())\r\nf = False\r\ns = \"\"\r\nfor i in range(10):\r\n temp = int(str(a) + str(i))\r\n if(temp % b == 0):\r\n f = True\r\n s = str(a) + str(i)\r\n break\r\nif not(f):\r\n print(-1)\r\nelse:\r\n z = '0' * (len(str(a)) + n - len(s))\r\n print(s + z)\r\n", "a,b,c=map(int,input().split(\" \"))\r\nfor i in range(c):\r\n count=0\r\n if a*10%b==0:\r\n count=count+1\r\n print(a*(10**(c-i)))\r\n break\r\n else:\r\n t=0\r\n for j in range(1,10):\r\n if (a*10+j)%b==0:\r\n a=a*10+j\r\n t=t+1\r\n break\r\n if t==0:\r\n count=count+1\r\n print(\"-1\")\r\n break\r\nif count==0:\r\n print(a)", "a,b,c = [int(x) for x in input().split()]\r\nn = (a*10+9)%b\r\nif n>9:\r\n print(-1)\r\nelse:\r\n print(a*10+9-n,\"0\"*(c-1),sep=\"\")", "a,b,n=map(int,input().split())\r\nfor j in range(10):\r\n if (a*10+j)%b==0:\r\n print(str(a*10+j)+\"0\"*(n-1))\r\n quit()\r\nelse:\r\n print(\"-1\")", "from sys import stdin\na, b, n = [int(x) for x in stdin.readline().rstrip().split()]\ntemp = a\nfor x in range(10):\n if (a*10+x) % b == 0:\n a = a * 10 + x\n break\n\nif temp == a:\n a = -1\nelse:\n a = a*(10**(n-1))\nprint(a)", "a ,b,n = map(int , input().split())\r\ns='0123456789'\r\nfor i in range(len(s)):\r\n x = str(a)+s[i]\r\n if int(x)%b==0 :\r\n print(x+'0'*(n-1))\r\n break\r\n \r\nelse :\r\n print(-1)\r\n", "a,b,n = [int(x) for x in input().split(' ')]\n\ndef do():\n\tglobal a\n\tglobal b\n\tglobal n\n\tfor i in range(10):\n\t\tres = a * 10 + i\n\t\tif res % b == 0:\n\t\t\treturn str(res) + '0' * (n-1)\n\treturn -1\nprint(do())", "a,b,n=map(int,input().split())\r\n# a=a*10**n\r\nx=-1\r\n# if a%b==0:\r\n\t# print(a)\r\n# else:\r\nfor i in range(0,10):\r\n\tif int(str(a)+str(i))%b==0:\r\n\t\tx=int(str(a)+str(i))\r\n\t\tbreak\r\nif x==-1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(x*10**(n-1))\r\n\t# print(len(str(10**n)))", "# Lang: pypy3.6-v7.1.0-win32\\pypy3.exe\r\n# Problem Name: AddingDigits\r\n# Problem Serial No: 260\r\n# Problem Type: A\r\n# Problem Url: https://codeforces.com/problemset/problem/260/A \r\n# Solution Generated at: 2019-10-19 22:59:44.364396 UTC\r\n\r\ni = int\r\ncin = input\r\nle = len\r\ns = str\r\n\r\na, b, n = map(i, cin().split())\r\n\r\nfor k in range(10):\r\n if i(s(a) + s(k)) % b == 0:\r\n print(s(a) + s(k) + \"0\" *(n-1))\r\n exit()\r\n\r\nprint(-1)\r\n\r\n\r\n# Accepted", "a, b, n = map(int, input().split())\r\nflag = False\r\na = a*10\r\nfor i in range(10):\r\n if((a+i)%b == 0):\r\n flag = True\r\n a += i\r\n break\r\nif(flag):\r\n a = str(a)+\"0\"*(n-1)\r\nelse:\r\n a = -1\r\nprint(a)", "import math\r\na,b,k=map(int,input().split())\r\nl=len(str(a))+k\r\nwhile k>0:\r\n x=math.ceil((a*10)/b)\r\n y=b*x\r\n if y==a*10:\r\n k=0\r\n break\r\n if a!=y//10:\r\n break\r\n a=y\r\n k-=1\r\n\r\nif k==0:\r\n a=str(a)\r\n a=a+'0'*(l-len(a))\r\n print(a)\r\nelse:\r\n print(-1)\r\n", "a,b,n = list(map(int,input().split()))\ni = 0\nf = 0\nfor j in range(10):\n na = a*10+j\n if na%b == 0:\n a = na\n f = 1\n break\nif f == 1:\n print(a*(10**(n-1)))\nelse:\n print(-1)\n", "a, b, n = map(int, input().split())\r\na = a * 10 + 9\r\nmod = a % b\r\nif mod > 9:\r\n print(-1)\r\n exit()\r\nelse:\r\n a -= mod\r\na = str(a) + '0' * (n - 1)\r\nprint(a)\r\n", "a,b,n=map(int,input().split())\r\ncount=0\r\nf=0\r\nans=str(a)\r\nwhile(count!=1):\r\n f=0\r\n for i in range(0,11):\r\n if int((ans+str(i)))%b==0:\r\n ans+=str(i)\r\n count+=1\r\n f+=1\r\n break\r\n if f==0:\r\n break\r\n \r\nif f==0:\r\n print(-1)\r\nelse:\r\n print(ans+\"0\"*(n-1))", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\na , b , n = map(int,input().split())\r\nfalg = False\r\nfor i in range(0,10):\r\n\tif int(str(a)+str(i))%b==0:\r\n\t\tnew = str(a)+str(i)\r\n\t\tfalg = True\r\n\t\tbreak\r\nif falg:\t\r\n\tnew += str(0)*(n-1)\r\n\tprint(new)\r\nelse:\r\n\tprint(-1)", "a,b,n=map(int,input().split())\r\na=a*10\r\nlol=0\r\nfor i in range(10):\r\n if((a+i)%b==0):\r\n print((a+i)*(10**(n-1)))\r\n lol=1\r\n break\r\nif(lol==0):\r\n print(-1)", "import math\r\nstrk = input().split()\r\na=strk[0]\r\nb=strk[1]\r\nn=strk[2]\r\nb=int(b)\r\nn=int(n)\r\ncond=False\r\nfor i in range(10):\r\n if int(a+str(i))%b==0:\r\n a=a+str(i)\r\n cond=True\r\n break\r\n\r\nif cond==False:\r\n print(-1)\r\nelse:\r\n print(a,end=\"\")\r\n for _ in range(n-1):\r\n print(0, end=\"\")\r\n\r\n#the end of the program -->\r\n\r\n\r\n", "a,b,n=map(int,input().split())\r\nf = 0\r\nans = 0\r\nfor i in range(0,10):\r\n\tk = str(a)+str(i)\r\n\tk = int(k)\r\n\t\r\n\tif k%b==0:\r\n\t\tf=1\r\n\t\tans = str(a)+str(i)+\"0\"*(n-1)\r\nif f:\r\n\tprint(ans)\r\nelse:\r\n\tprint(-1)\r\n\t\r\n", "a,b,n = input().split()\r\nb = int(b)\r\nm = int(a)%b\r\nfor i in range(int(n)):\r\n\tx = (m*10)%b\r\n\tfor j in range(10):\r\n\t\tif (x+j)%b == 0:\r\n\t\t\ta += str(j)\r\n\t\t\tm = 0\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(-1)\r\n\t\tbreak\r\nelse:\r\n\tprint(a)\r\n", "import sys\r\na, b, n = map(int,input().split())\r\ns1 = \"\"\r\ndec = int(1)\r\nfor i in range(10):\r\n s1 = str(a)\r\n s1 = s1+str(i)\r\n x = int(s1)\r\n if(x%b == int(0)):\r\n a = int(s1)\r\n dec = int(0)\r\n break\r\nif(dec):\r\n print(\"-1\")\r\n sys.exit(int(0))\r\nelse:\r\n print(a,end=\"\")\r\n for i in range(n-1):\r\n print(0,end=\"\")\r\n print()\r\n", "ok=True\r\na,b,c=list(map(int,input().split()))\r\nfor i in range(10):\r\n x=int(str(a)+str(i))\r\n zero='0'*(c-1)\r\n if x%b==0:\r\n print(str(x)+zero)\r\n ok=False\r\n break\r\nif ok==True:\r\n print(-1)\r\n", "#import collections\r\n# import random\r\n# import math\r\n#import itertools\r\n#import math\r\n#mport math\r\n#from collections import defaultdict\r\n# import itertools\r\n# from sys import stdin, stdout\r\n#import math\r\nimport sys\r\n# import operator\r\n# from decimal import Decimal\r\n\r\n# sys.setrecursionlimit(10**6)\r\n\r\np2D = lambda x: print(*x, sep=\"\\n\")\r\ndef II(): return int(sys.stdin.buffer.readline())\r\ndef MI(): return map(int, sys.stdin.buffer.readline().split())\r\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\ndef BI(): return sys.stdin.buffer.readline().rstrip()\r\ndef SI(): return sys.stdin.buffer.readline().rstrip().decode()\r\ndef li(): return [int(i) for i in input().split()]\r\ndef lli(rows): return [li() for _ in range(rows)]\r\ndef si(): return input()\r\ndef ii(): return int(input())\r\ndef ins(): return input().split()\r\n\r\n\r\ndef solve():\r\n a,b,n = LI()\r\n if b>10:\r\n tmp = 0\r\n for i in range(10):\r\n p = a*10+i\r\n if p%b== 0:\r\n tmp = p\r\n break\r\n if tmp==0:\r\n print(-1)\r\n else:\r\n print(tmp*(10**(n-1)))\r\n elif b == 10:\r\n print(a*(10**n))\r\n else:\r\n for j in range(n):\r\n a*=10\r\n if a%b!=0:\r\n a+= (b-a%b)\r\n print(a)\r\n\r\n\r\ndef main():\r\n # for _ in range(II()):\r\n # sys.stdout.write(str(solve()) + \"\\n\")\r\n solve()\r\n\r\n # z += str(ans) + '\\n'\r\n # print(len(ans), ' '.join(map(str, ans)), sep='\\n')\r\n # stdout.write(z)\r\n\r\n\r\n# for interactive problems\r\n# print(\"? {} {}\".format(l,m), flush=True)\r\n# or print this after each print statement\r\n# sys.stdout.flush()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\na, b, n = map(int, input().split())\r\na = int(str(a)+'0')\r\nnum = a\r\nfor i in range(10):\r\n if (a+i)%b==0:\r\n num = a+i\r\n break\r\nelse:\r\n print(\"-1\")\r\n sys.exit()\r\nn -= 1\r\nprint(str(num)+'0'*n)\r\n", "a, b, n = map(int, input().split())\n\nm = str(a%b)\na = str(a)\nfor i in range(10):\n if int(m+str(i))%b == 0:\n a += str(i)\n print(a+(n-1)*'0')\n break\nelse:\n print(-1)\n\n\n", "a, b, n = map(int, input().split())\r\nmult = int('1'+'0'*(n-1))\r\nfor i in range(10):\r\n curr = int(str(a) + str(i))\r\n if curr%b == 0:\r\n print(curr*mult)\r\n exit()\r\n\r\nprint(-1)", "li=[int(x) for x in input().split()]\r\na=li[0]\r\nb=li[1]\r\nn=li[2]\r\n\r\nif a%b==0:\r\n s2=str(a)\r\n s3=\"0\"*n\r\n s2+=s3\r\n print(s2)\r\nelse:\r\n s=str(a)\r\n ans=-True\r\n j=0\r\n while(j<n):\r\n for i in range(10):\r\n s=s+str(i)\r\n if int(s)%b==0:\r\n ans=True\r\n s4=\"0\"*(n-(j+1))\r\n s+=str(s4)\r\n j=n\r\n break\r\n else:\r\n l=len(s)\r\n s=s[:l-1]\r\n ans=False\r\n\r\n j+=1\r\n\r\n if ans==True:\r\n print(int(s))\r\n else:\r\n print(-1)\r\n\r\n", "a,b,n=map(int,input().split())\r\nR=-1\r\nfor i in range(10):\r\n\tr=a*10+i\r\n\tif r%b==0:R=str(r)+'0'*(n-1)\r\nprint(R)", "a,b,n=map(int,input().split())\r\nans=-1\r\nfor i in range(10):\r\n\tr=a*10+i\r\n\tif r%b==0:ans=str(r)+'0'*(n-1)\r\nprint(ans)", "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\na,b,d=mi()\r\na*=10\r\nf=0\r\nfor i in range(10):\r\n if((a+i)%b==0):\r\n a+=i\r\n f=1\r\n break\r\nif(f==0):\r\n print('-1')\r\nelse:\r\n print(a,end=\"\")\r\n x=d-1\r\n s='0'*x\r\n print(s)", "a,b,n = map(int,input().split())\r\nfor i in range(10):\r\n temp = int(str(a)+str(i))\r\n if temp%b==0:\r\n print(str(temp)+'0'*(n-1))\r\n break\r\nelse:\r\n print(-1)\r\n", "a, b, n = map(int, input().split())\r\nflag = False\r\n\r\nfor i in range(10):\r\n temp = a*10 + i\r\n if temp % b == 0:\r\n flag = True\r\n a = temp\r\n break\r\n\r\nif not flag:\r\n print(-1)\r\n exit(0)\r\n\r\nprint(str(a)+(n-1)*'0')\r\n", "a,b,c= map(int,input().split())\r\naaa=str(a)\r\naa=len(aaa)\r\np=True\r\nz=True\r\nfor i in range(c):\r\n if z:\r\n a=a*10 + 9\r\n a-=a%b\r\n ba=str(a)\r\n c1=(len(ba)==(i+aa+1))\r\n c2=(ba.startswith(aaa))\r\n if (not c1) or (not c2):\r\n print(-1)\r\n p=False\r\n break\r\n if c1 and c2:\r\n z=False\r\n else:\r\n a=a*10\r\nif p :\r\n print(a)", "import sys\na,b,n = map(int,input().split())\n\ns = 0;\nc = 0\n\nif a%b == 0:\n\tprint(a,end='')\n\tfor i in range(n):\n\t\tprint(0,end = '')\n\nelse:\n\tfor i in range(0,10):\n\t\tc = (a*10) + i;\n\t\tif c % b == 0:\n\t\t\ts = i\n\t\t\tbreak\n\tif c % b != 0:\n\t\tprint(-1)\n\t\tsys.exit()\n\tprint(c,end='')\n\tfor i in range(n-1):\n\t\tprint(0,end='')\n", "a,b,n = map(int,input().split())\r\nk = b-((10*a)%b)\r\nif k>=0 and k<=9:\r\n print((10*a+k)*(10**(n-1)))\r\nelif k==b:\r\n print(a*(10**n))\r\nelse:\r\n print(-1)", "a, b, n = list(map(int, input().split()))\na *= 10\nnum = -1\nfor k in range(10):\n if (k + a) % b == 0:\n num = k + a\n break;\nif num == -1:\n print(-1)\nelse:\n s = str(num)\n s += '0' * (n - 1)\n print(s)", "odd = [0,1,3,5,7,9]\r\neven = [0,2,4,6,8]\r\n\r\na,b,n = [int(x) for x in input().split()]; count = 0\r\n\r\na_new = a\r\ntemp = 0\r\na = str(a)\r\n\r\n\r\nif b%2 == 0:\r\n for i in range(2):\r\n for j in even:\r\n a+=str(j)\r\n if int(a)%b != 0:\r\n a = a[:-1]\r\n else:\r\n temp = j\r\n count += 1\r\n break\r\n if count == n:\r\n break\r\nelse:\r\n for i in range(2):\r\n for j in odd:\r\n a+=str(j)\r\n if int(a)%b != 0:\r\n a = a[:-1]\r\n else:\r\n temp = j\r\n count += 1\r\n break\r\n if count == n:\r\n break\r\nif a_new == int(a):\r\n print(-1)\r\nelse:\r\n for i in range(n-2):\r\n a+=str(temp)\r\n print(int(a))", "# codeforces 260-A. Adding Digits\r\n\r\n\r\ndef solve(a,b,n):\r\n a *= 10\r\n rem = abs(b - (a%b))\r\n if a%b == 0:\r\n rem =0\r\n if rem>9:\r\n return(-1)\r\n res = str(a+rem)\r\n for i in range(n-1):\r\n res+='0'\r\n\r\n return(res)\r\n\r\n[a,b,n]=list(map(int,input().split()))\r\nprint(solve(a,b,n))\r\n\r\n", "a,b,n=map(int,input().split())\r\nflag=0\r\nif a%b==0:\r\n flag=1\r\nfor i in range(10):\r\n a=(a*10)+i\r\n if a%b==0:\r\n flag=1\r\n break\r\n else:\r\n a=a//10\r\nprint(-1) if flag==0 else print(a*(10**(n-1)))", "\r\na, b, n = input().split()\r\na, b, n = int(a), int(b), int(n)\r\n\r\nans = -1\r\n\r\nfor ne in range(10):\r\n new = a * 10 + ne\r\n if new % b == 0:\r\n ans = new\r\n\r\nif ans == -1:\r\n print(-1)\r\nelse:\r\n an = str(ans)\r\n for i in range(n-1):\r\n an += '0'\r\n print(an)\r\n", "# It's all about what U BELIEVE\nimport sys\ninput = sys.stdin.readline\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\nMOD = \"1000000007\"\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n############################ SOLUTION IS COMING ###############################\na, b, n = gint_arr()\ni = 0\nwhile i < 10:\n if (a * 10 + i) % b == 0:\n print(str(a) + str(i) + \"0\" * (n - 1))\n exit()\n i += 1\n\nprint(-1)\n", "a,b,c = map(int,input().split())\r\nans = \"-1\"\r\nfor i in range(0,10):\r\n t = a*10 + i\r\n if t%b == 0:\r\n ans = str(t) + \"0\"*(c-1)\r\n break\r\nprint(ans)", "a, b, n = map(int, input().split())\na = str(a)\nfor i in range(10):\n if int(a + str(i))%b == 0:\n print(a + str(i) + '0'*(n-1))\n exit()\nprint(-1)", "a, b, n = map(int, input().split())\r\nans = \"-1\"\r\nfor i in range(10):\r\n num = a*10 + i\r\n if num % b == 0:\r\n ans = str(num)+\"0\"*(n-1)\r\nprint(ans)\r\n", "import sys\ninput = sys.stdin.readline\n\na,b,n = map(int, input().split())\n\nfor i in range(10):\n if (a*10+i) % b == 0:\n print(str(a*10+i) + '0'*(n-1))\n exit()\nprint(-1)", "try:\r\n a,b,n=list(map(int,input().split(\" \")))\r\n s=str(a)\r\n k=len(s)\r\n kl=0\r\n for i in range(0,10):\r\n if int(s+str(i))%b==0:\r\n s+=str(i)\r\n kl=1\r\n break\r\n if kl==0:\r\n print(-1)\r\n else:\r\n s+='0'*(n-1)\r\n print(s)\r\n \r\n \r\nexcept:\r\n pass", "import functools as ft\r\nimport itertools as it\r\nimport math as mt\r\nimport sys\r\nimport heapq as hp\r\nimport collections as cc\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\t\r\na,b,n = I()\r\nf = 1\r\nans = -1\r\nfor i in range(10):\r\n\tnow = a*10+i\r\n\tif not now%b:\r\n\t\tans = str(now)+'0'*(n-1)\r\n\t\tbreak\r\nprint(ans)", "import math\r\na,b,n = [int(x) for x in input().split()]\r\nflag = True\r\nfor i in range(0, 10):\r\n temp = (a*10)+i\r\n if temp%b==0:\r\n a = temp*(10**(n-1))\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(-1)\r\nelse:\r\n print(a)", "abn = list(map(int, input().split()))\r\na = abn[0]\r\nb = abn[1]\r\nn = abn[2]\r\nans = False\r\n\r\nfor i in range(10):\r\n if int(str(a) + str(i)) % b == 0:\r\n print(str(a) + str(i) + (\"0\" * (n - 1)))\r\n ans = True\r\n break\r\n\r\nif not ans:\r\n print(-1)\r\n\r\n", "from sys import stdin\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\n\r\na, b, n = map(int, stdin.readline().rstrip().split(' '))\r\n\r\npicked_digit = -1\r\nfor d in range(10):\r\n c = int(str(a) + str(d))\r\n if c % b == 0:\r\n picked_digit = d\r\n break\r\n\r\nif picked_digit == -1:\r\n print(picked_digit)\r\nelse:\r\n ans = str(a) + str(picked_digit) + '0'*(n-1)\r\n print(ans)", "#rOkY\r\n#FuCk\r\n\r\n################################ kOpAl ############################################\r\n \r\ns,e,n=map(int,input().split())\r\nx=str(s)\r\n\r\nfor i in range(0,9+1,1):\r\n if(((s*10)+i)%e==0):\r\n print(s,end='')\r\n print(i,end='')\r\n for j in range(1,n,1):\r\n print(\"0\",end='')\r\n exit(0)\r\nprint(\"-1\")\r\n", "def solve(a,b,c):\r\n\tr=None\r\n\tfor i in range(10):\r\n\t\tif not int(str(a)+str(i))%b:\r\n\t\t\tr=str(a)+str(i)\r\n\t\t\tbreak\r\n\tif r==None:\r\n\t\treturn -1\r\n\treturn r+(c-1)*\"0\"\r\n\r\na,b,c=map(int,input().strip().split())\r\nprint(solve(a,b,c))", "a,b,n = map(int,input().split())\nflg = 0\nfor i in range(10):\n if (a*10+i)%b==0:\n flg = 1\n break\nif flg:\n print((a*10+i)*(10**(n-1)))\nelse:\n print(-1)", "a,b,n=map(int ,input().split())\r\na=a*10+9\r\nif(a%b<10): print(str(a-a%b)+\"0\"*(n-1))\r\nelse :\r\n print(-1)", "def arbol(a,nActual,n,b):\r\n for i in range(0,10):\r\n nuevoNumero=10*a+i\r\n if(nuevoNumero % b==0):\r\n return str(nuevoNumero) + \"0\"*(n-1)\r\n \r\n return -1\r\n\r\n \r\n[a,b,n]=[int(i) for i in input().split()]\r\nprint(arbol(a,0,n,b))", "a,b,n = map(str,input().split())\r\nposs=False\r\nnum = -1\r\nfor i in range(0,10):\r\n if int((a+str(i))) % int(b) == 0:\r\n num = str(i)\r\n poss=True\r\n break\r\nif poss:\r\n ans = a + num\r\n ans += (int(n) - 1) * '0'\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "s=input()\r\nl=s.split()\r\na=l[0]\r\nb=l[1]\r\nn=l[2]\r\nt=0\r\nfor i in range(0,10):\r\n if int(a+str(i))%int(b)==0:\r\n \r\n t=1\r\n break\r\nif t==0:\r\n print(-1)\r\nelse:\r\n x='0'*(int(n)-1)\r\n a=a+str(i)+x\r\n print(a)", "a,b,n = [int(x) for x in input().split()]\n\n#10**n possibilities unnayi, Not really, if multiple digits are divisible by b, then i wll need to check for each number, each digit\n#Issue is that\nflag = 0\nax = 0\nfor x in range(10):\n\tax = a*10+x\n\tif ax%b == 0:\n\t\tflag = 1\n\t\tbreak\nif flag == 0:\n\tprint(-1)\nelse:\n\taxn = ax*pow(10,n-1)\n\tprint(axn)\n", "a, b, n = map(int, input().split())\r\na = a*10\r\nflag = True\r\nif (a) % b == 0:\r\n\tn -= 1\r\nelif (a + 1) % b == 0:\r\n\tn -= 1 \r\n\ta = a + 1 \r\nelif (a + 2) % b == 0:\r\n\tn -= 1 \r\n\ta = a + 2\r\nelif (a + 3) % b == 0:\r\n\tn -= 1 \r\n\ta = a + 3\r\nelif (a + 4) % b == 0:\r\n\tn -= 1 \r\n\ta = a + 4\r\nelif (a + 5) % b == 0:\r\n\tn -= 1 \r\n\ta = a + 5\r\nelif (a + 6) % b == 0:\r\n\tn -= 1\r\n\ta = a + 6 \r\nelif (a + 7) % b == 0:\r\n\tn -= 1 \r\n\ta = a + 7\r\nelif (a + 8) % b == 0:\r\n\tn -= 1 \r\n\ta = a + 8 \r\nelif (a + 9) % b == 0:\r\n\tn -= 1 \r\n\ta = a + 9 \r\nelse:\r\n\tflag = False \r\nif not flag:\r\n\tprint(-1)\r\nelse:\r\n\twhile n > 0:\r\n\t\tn -= 1 \r\n\t\ta *= 10 \r\n\tprint(a)\r\n", "def solve(a, b, n):\r\n f = False\r\n c = 0\r\n for i in range(10):\r\n if int(str(a)+str(i)) % b == 0:\r\n f = True\r\n c = i\r\n break\r\n if not f:\r\n return -1\r\n return str(a)+str(c)+'0'*(n-1)\r\n\r\n\r\na, b, n = [int(i) for i in input().split()]\r\nprint(solve(a, b, n))\r\n", "a,b,n=map(int,input().split())\r\nx=a\r\nfor j in range(10):\r\n if (a*10+j)%b==0:\r\n a*=10\r\n a+=j\r\n break\r\nif x==a:\r\n print(-1)\r\nelse:\r\n print(a*pow(10,n-1))", "a,b,n = map(int,input().split())\r\nif(a%b==0):\r\n\tprint(a,end=\"\")\r\n\tfor i in range (0,n):\r\n\t\tprint(0,end=\"\")\r\nelse:\r\n\tx = (a*10)-1;\r\n\tfor i in range(0,10):\r\n\t\tx+=1\r\n\t\tif(x%b==0):\r\n\t\t\tbreak\r\n\tif(x%b!=0):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(x,end=\"\")\r\n\t\tfor i in range (0,n-1):\r\n\t\t\tprint(0,end=\"\")", "lst = list(map(int,input().strip().split()))\r\na = str(lst[0])\r\nb = str(lst[1])\r\nn = lst[2]\r\nif int(a)%int(b) == 0:\r\n while(n > 0):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n\r\nelse:\r\n if int(a + '0')%int(b) == 0:\r\n a = a + '0'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '1')%int(b) == 0:\r\n a = a + '1'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '2')%int(b) == 0:\r\n a = a + '2'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '3')%int(b) == 0:\r\n a = a + '3'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '4')%int(b) == 0:\r\n a = a + '4'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '5')%int(b) == 0:\r\n a = a + '5'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '6')%int(b) == 0:\r\n a = a + '6'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '7')%int(b) == 0:\r\n a = a + '7'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '8')%int(b) == 0:\r\n a = a + '8'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n elif int(a + '9')%int(b) == 0:\r\n a = a + '9'\r\n while(n > 1):\r\n a = a + '0'\r\n n-=1\r\n print(int(a))\r\n else:\r\n print(int(-1))\r\n \r\n\r\n", "a,b,n=map(int,input().split())\r\nfor i in range(10):\r\n ans=a*10+i\r\n if ans%b==0:\r\n break\r\nif ans%b==0:\r\n print(ans*10**(n-1))\r\nelse:\r\n print(-1)\r\n\r\n \r\n", "a,b,n= map(int,input().strip().split())\r\nk = -1\r\nfor i in range(10):\r\n if (10*a+i) % b == 0:\r\n k = i;break\r\n\r\nif k == -1:\r\n print(-1)\r\n exit(0xb12ea17*0)\r\n\r\nprint(str(a)+str(k)+(n-1)*str(0))", "a,b,c=[int(x) for x in input().split()]\r\nd=0\r\na=a*10\r\n\r\nfor j in range(10):\r\n temp=a\r\n temp+=j\r\n if temp%b==0:\r\n d=1\r\n break\r\nif d==1:\r\n print(temp,end=\"\")\r\n for i in range(1,c):\r\n print(\"0\",end=\"\")\r\nelse:\r\n print(\"-1\")", "a,b,n=input().split()\r\na=list(a)\r\nj=0\r\ne=0\r\na.append('0')\r\n\r\nres = int(\"\".join(a))\r\nif(res%int(b)<=int(b)):\r\n a.pop()\r\n \r\n if(res%int(b)==0):\r\n a.append('0')\r\n else:\r\n c=int(b)-res%int(b)\r\n if(c>9):\r\n e=1\r\n a.append(str(c))\r\n if(e!=1):\r\n for i in range(len(a)):\r\n print(a[i],end=\"\")\r\n while(j<int(n)-1):\r\n j+=1\r\n print('0',end=\"\")\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "a, b, k = list(map(int, input().split()))\r\nnum = str(a)\r\nfor n in range(10):\r\n num += str(n)\r\n if int(num) % b == 0:\r\n break\r\n num = num[:-1]\r\nif int(num) == a:\r\n print(-1)\r\nelse:\r\n print(num + '0'*(k-1))\r\n", "#A. Adding Digits\r\na,b,n = map(int,input().split())\r\nflag = False\r\nfor i in range(10):\r\n if int(str(a)+str(i))%b == 0:\r\n flag = True\r\n a = int(str(a)+str(i))\r\n break\r\nif not flag:\r\n print(-1)\r\nelse:\r\n n = n-1\r\n a = str(a)+'0'*(n)\r\n print(a)", "def solve():\r\n\ta, b, n = map(int, input().split())\r\n\tfor i in range(10):\r\n\t\tif (10*a+i) % b == 0:\r\n\t\t\treturn (10*a+i)*(10**(n-1))\r\n\t\telse:\r\n\t\t\tcontinue\r\n\treturn -1\r\nprint(solve())\r\n\t", "a,b,n=map(int,input().split())\r\ns=str(a)\r\nf=0\r\nfor i in range(10):\r\n if(int(s+str(i))%b==0):\r\n f=1\r\n s=s+str(i)\r\n break\r\nif(f==0):\r\n print(-1)\r\nelse:\r\n print(s+'0'*(n-1))\r\n", "a,b,n=map(int,input().split())\r\nif (10*a+9)%b<=9:\r\n a=10*a+9-(10*a+9)%b\r\n print(str(a)+(n-1)*\"0\")\r\nelse:\r\n\tprint(-1)\r\n", "sp = list(map(int,input().split()))\r\na,b,n = str(sp[0]),str(sp[1]),sp[2]\r\nfor i in range(0,10):\r\n if int(a+str(i))%int(b) == 0:\r\n print(a+str(i) + str(str(0)*(n-1)))\r\n exit()\r\nprint(-1)", "a,b,c=map(int,input().split())\r\nd=str(a)\r\nd1=\"\"\r\nfor i in range(10) :\r\n d1=d+str(i)\r\n if int(d1)%b==0 :\r\n d1=d+str(i)\r\n c-=1\r\n\r\n print(d1+(\"0\"*c))\r\n exit()\r\nprint(-1)\r\n\r\n", "a, b, n = map(int, input().split())\nflag = False\nfor i in range(1):\n for j in range(10):\n number = str(a) + str(j)\n if int(number) % b == 0:\n a = str(a) + str(j)\n flag = True\n break\n\nif flag:\n print(a, end = '')\n remain = ['0'] * (n - 1)\n print(''.join(remain))\n\nelse:\n print(-1)\n", "from os import path\r\nimport sys\r\nimport time\r\nmod = int(1e9 + 7)\r\n# import re\r\nfrom math import ceil, floor, gcd, log, log2, factorial, sqrt\r\nfrom collections import defaultdict, Counter, OrderedDict, deque\r\nfrom itertools import combinations, accumulate,groupby,product\r\n# from string import ascii_lowercase ,ascii_uppercase\r\nfrom bisect import *\r\nfrom functools import reduce\r\nfrom operator import mul\r\ndef star(x): return print(' '.join(map(str, x)))\r\ndef grid(r): return [lint() for i in range(r)]\r\ndef stpr(x): return sys.stdout.write(f'{x}' + '\\n')\r\nINF = float('inf')\r\nif (path.exists('input.txt')):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nimport sys\r\nfrom sys import stdin, stdout\r\nfrom collections import *\r\nfrom math import gcd, floor, ceil\r\nfrom copy import deepcopy\r\ndef st(): return list(stdin.readline().strip())\r\ndef inp(): return int(stdin.readline())\r\ndef inlt(): return list(map(int, stdin.readline().split()))\r\ndef invr():return map(int, stdin.readline().split())\r\ndef pr(n): return stdout.write(str(n) + \"\\n\")\r\ndef solve():\r\n a,b,n = invr()\r\n for i in range(10):\r\n if (a*10+i)%b==0:\r\n print(str(a*10+i)+\"0\"*(n-1))\r\n return\r\n print(-1)\r\nt = 1\r\n#t = inp()\r\nfor _ in range(t):\r\n solve()\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\na, b, n = map(int, input().split())\r\nflag = False\r\nfor i in range(10):\r\n if (a * 10 + i) % b == 0:\r\n flag = True\r\n a = a * 10 + i\r\n break\r\na = str(a)\r\nfor i in range(n - 1):\r\n a = a + '0'\r\nprint(a if flag else -1)\r\n\r\n\r\n", "a, b, n = input().split()\r\na_len = len(a)\r\n\r\nif a != 0:\r\n\t\r\n\tfor i in range(int(n)):\r\n\t\t\r\n\t\tif int(a + \"0\") % int(b) == 0:\r\n\t\t\t\r\n\t\t\ta += (str(10 ** (int(n) - (len(a) - a_len)))[1:])\r\n\t\t\tbreak\r\n\t\t\t\r\n\t\telse:\r\n\t\t\t\r\n\t\t\tfor e in range(0, min(int(b), 10)):\r\n\t\t\r\n\t\t\t\tif int(a + str(e)) % int(b) == 0:\r\n\t\t\r\n\t\t\t\t\ta += str(e)\r\n\t\t\t\t\tbreak\r\n\r\nif len(a) == a_len + int(n):\r\n\tprint(a)\r\nelse:\r\n\tprint(-1)", "a,b,n= map(int,input().split())\r\nten = 10\r\ncount = 0\r\nempL = [a]\r\nflag = 0\r\nfor i in range(10):\r\n a = a * ten + i\r\n if(a%b == 0):\r\n flag = 1\r\n break\r\n a = (a-i)//ten\r\n# print(a,flag)\r\nif(flag == 1):\r\n for j in range(n-1):\r\n a = a * ten\r\n print(a)\r\nelse:\r\n print(-1)", "a, b, n = map(int, input().split())\r\nk = ((10 * a + 9) // b) * b\r\nprint(-1 if 10 * a > k else str(k) + '0' * (n - 1))", "a,b,n=map(int,input().split())\r\na*=10\r\nfor i in range(10):\r\n if (a+i)%b==0:\r\n print(str(a+i)+'0'*(n-1))\r\n exit()\r\nprint(-1) ", "first = input().split(\" \")\r\nglobal a\r\na = first[0]\r\nglobal b\r\nb = int(first[1])\r\nglobal c\r\nn = int(first[2])\r\n\r\nflag = 0\r\n\r\n\r\nfor i in range(10):\r\n temp = a + str(i)\r\n if int(temp) % b == 0:\r\n print(temp + \"0\"*(n-1))\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(\"-1\")\r\n\r\n\r\n \r\n", "a, b, n = [int(j) for j in input().split()]\r\nfor i in range(n):\r\n c = 0\r\n if(a%b==0):\r\n c = 1\r\n a = a*(10**(n-i))\r\n break\r\n for k in range(10):\r\n if((a*10 + k)%b == 0):\r\n a = a*10 + k\r\n c = 1\r\n break\r\n if(c==0):\r\n break\r\nif(c==1):\r\n print(a)\r\nelse:\r\n print(-1)\r\n \r\n", "a, b, n = map(int, input().split())\r\nf = 0\r\nA2 = a\r\nA2 *= 10\r\nfor i in range(10):\r\n if (A2 + i) % b == 0:\r\n A2 += i\r\n f = 1\r\n break\r\n#print(A2, n)\r\nif not f:\r\n print(-1)\r\nelse:\r\n print(A2, end=\"\")\r\n #print(n)\r\n for i in range(n-1):\r\n print(0, end=\"\")\r\n print()\r\n \r\n ", "a, b, n = list(map(int, input().split()))\r\narr = [str(a)]\r\nx = a\r\nfor _ in range(1):\r\n x = int(f'{x}{9}')\r\n smh = x % b\r\n if smh <= 9:\r\n x -= smh\r\n else:\r\n print(-1)\r\n exit()\r\narr2 = ['0']*(n-1)\r\narr2.insert(0, str(x))\r\nprint(''.join(arr2))", "a,b,n=map(int,input().split())\nk=0\nm=0\nwhile n and k==0 and m==0:\n i=0\n\n while i<10:\n if i==0 and int(str(a)+str(i))%b==0:\n \n \n \n a=str(int(a))+(n)*'0'\n m+=1\n break\n elif int(str(a)+str(i))%b==0:\n n-=1\n a=str(a)\n a+=str(i)\n a=int(a)\n i+=1\n \n break\n elif i<9:\n i+=1\n continue\n else:\n k+=1\n break\nif k:\n print(-1)\nelse:\n print(a)\n \n", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\n\r\ndef test_case():\r\n a, b, n = map(int, input().split())\r\n for d in range(10):\r\n if (a*10 + d) % b == 0:\r\n print((a*10 + d)*10**(n-1))\r\n return\r\n print(-1)\r\n\r\ndef main():\r\n# for t in range(int(input())):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b, n = map(int, input().split())\r\n\r\n# Initialize a variable to store the result\r\nresult = -1\r\n\r\n# Try to find a digit to append to 'a' such that the resulting number is divisible by 'b'\r\nfor digit in range(10):\r\n if (a * 10 + digit) % b == 0:\r\n result = str(a) + str(digit)\r\n break\r\n\r\n# If no valid digit is found, result remains -1\r\n# Otherwise, keep adding digits 'n' times\r\nif result != -1:\r\n result += '0' * (n - 1)\r\n\r\nprint(result)\r\n", "aa=input().split(\" \")\r\nn=int(aa[2])\r\na=aa[0]\r\nb=int(aa[1])\r\nfor i in range(10):\r\n c=(a+str(i))\r\n if int(c)%b==0:\r\n a=c\r\n break\r\n else:\r\n c=-1\r\na=c\r\nif c != -1:\r\n for i in range(1,n):\r\n a = a+\"0\"\r\nprint(a)", "# http://codeforces.com/problemset/problem/260/A\n# At first try to add to the right one digit from 0 to 9.\n# If it is impossible write -1. In other case, the remaining n–1 digits can be 0 because divisibility doesn’t change.\n\na, b, n = map(int, input().split())\nR=-1\nfor i in range(10):\n r = a*10+i\n if r%b == 0:\n R = str(r)+'0'*(n-1)\nprint(R)\n", "a,b,n=map(int,input().split())\r\nfound=False\r\nlent=len(str(a))\r\nres=str(a)\r\nfor i in range(0,10):\r\n if int(str(a)+str(i))%b==0:\r\n res+=str(i)\r\n found=True\r\n break\r\nif not found:\r\n print(-1)\r\nelse:\r\n print(res+'0'*(n-1))", "a,b,n=map(int,input().split())\r\nd=-1\r\nfor i in range(10):\r\n t=a*10+i\r\n if t%b==0:\r\n d=str(t)+'0'*(n-1)\r\n break\r\nprint(d)\r\n", "a,b,n=map(int,input().split())\r\nfor x in range(10):\r\n y=a*10+x\r\n if y%b==0:break\r\nif y%b==0:\r\n print(str(y)+\"0\"*(n-1))\r\nelse: \r\n print(-1)\r\n\r\n\r\n", "a,b,n = map(str,input().split())\r\nd=a\r\nc=0\r\n\r\nfor j in range (10):\r\n if (int(a+str(j))%int(b)==0):\r\n a=a+str(j)\r\n c=c+1\r\n break\r\na=str(int(a)*(10**(int(n)-1)))\r\n\r\nif (c==1):\r\n print(a)\r\nelse:\r\n print('-1')\r\n", "def problem():\r\n # Use a breakpoint in the code line below to debug your script.\r\n A,B,N = map(int, input().split(\" \")) # Press Ctrl+F8 to toggle the breakpoint.\r\n if 0 <= -10*A % B <= 9:\r\n second_digit = -10*A % B\r\n return str(A)+str(second_digit)+\"0\"*(N-1)\r\n else:\r\n return -1\r\n# Press the green button in the gutter to run the script.\r\nif __name__ == '__main__':\r\n print(problem())", "a, b, n = map(int, input().split())\r\nfail = False\r\nfor i in range(n):\r\n req = b-(10*a)%b\r\n if req == b:\r\n a=str(a)+'0'*(n-i)\r\n break\r\n elif req <=9:\r\n a = int(str(a)+str(req))\r\n else:\r\n fail = True\r\n\r\nif fail == True:\r\n print(-1)\r\nelse:\r\n print(a)\r\n", "a, b, n = map(int, input().split())\nflag = False\nc = '-1'\n\nfor i in range(10):\n if int(str(a) + str(i)) % b == 0:\n flag = True\n c = i\n break\n\nif flag:\n print(str(a) + str(c) + '0'*(n-1))\nelse:\n print(-1)\n\n\n", "a, b, n = map(int, input().split())\r\n\r\nfor j in range(n):\r\n a = 10*a + 9\r\n r = a % b\r\n if r <= 9:\r\n a -= r\r\n print(str(a) + \"0\" * (n-j-1))\r\n break\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n print(a)", "# --- Algorithm --- #\ndef function(p):\n d = int(p[1])\n l = int(p[2])\n\n for i in range(10):\n a = p[0] + str(i)\n if int(a) % d == 0:\n return int(a + \"0\" * (l - 1))\n return -1 \n\n\n# --- Run --- #\nparsed_input = input().split()\nans = function(parsed_input)\nprint(ans)", "a,b,n=map(int,input().split())\r\nx=-1\r\nfor i in range(10):\r\n y=a*10+i\r\n if y%b==0:\r\n x = str(y)+'0'*(n-1)\r\n break\r\nprint(x)", "a,b,n=map(int,input().split())\r\na=str(a)\r\nx=0\r\nflag=1\r\nwhile x<10:\r\n if int(a+str(x))%b==0:\r\n a=a+str(x)+'0'*(n-1)\r\n flag=1\r\n break\r\n else:\r\n x+=1\r\nif x==10:\r\n print(-1)\r\nelse:\r\n print(a)\r\n\r\n ", "A, B, N = [int(x) for x in input().split()]\r\n\r\n\r\nqueue = []\r\n\r\nnew_answer = A\r\n\r\nanswer = False\r\n\r\nfor i in range(10):\r\n\r\n new_answer = int(str(A) + str(i))\r\n\r\n if new_answer % B == 0:\r\n answer = True\r\n break\r\n\r\n\r\nif answer:\r\n\r\n print(str(new_answer) + ((N-1)*\"0\"))\r\n\r\nelse:\r\n print(-1)\r\n", "def main():\r\n a, b, n = map(int, input().split(' '))\r\n a *= 10\r\n completed = False\r\n for i in range(0, 10):\r\n if (a + i) % b == 0:\r\n print(str(a+i) + (\"0\" * (n-1)))\r\n completed = True\r\n break\r\n if not completed:\r\n print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from sys import stdout\r\na,b,n=map(int,input().split())\r\nc=0\r\nco=0\r\ntemp=str(a)\r\nf=0\r\nfor i in range(0,10):\r\n if int(temp+str(i))%b==0:\r\n temp=temp+str(i)\r\n f=1\r\n break\r\nif f==0:\r\n print(-1)\r\nelse:\r\n for i in range(n-1):\r\n temp+=\"0\"\r\n stdout.write(temp)", "def solution():\r\n\ta,b,n=map(int,input().split())\r\n\tnum=a\r\n\tfor i in range(0,10):\r\n\t\ttemp=num*10\r\n\t\ttemp+=i\r\n\t\tif temp%b==0:\r\n\t\t\tbreak\r\n\tif temp%b:\r\n\t\tprint(-1)\r\n\t\treturn\r\n\twhile n-1:\r\n\t\tn-=1\r\n\t\ttemp*=10\r\n\tprint(temp)\r\n\r\n\t\r\n\treturn\r\n\r\n\r\n\r\n\t\r\nsolution()\r\n\r\n\t", "lst = [x for x in input().split()]\r\na = lst[0]\r\nb = int(lst[1])\r\nn = int(lst[-1])\r\n\r\nfirst = a\r\npassedfirst = False\r\nfor j in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9):\r\n m = a + str(j)\r\n k = int(m)\r\n if k % b == 0:\r\n passedfirst = True\r\n a = m\r\n break\r\n\r\nif not passedfirst: print(-1)\r\nelse: print(a+\"0\"*(n-1))", "abn=list(input().split())\r\na=int(abn[0]) \r\nb=int(abn[1])\r\nn=int(abn[2])\r\na=a*10\r\nc=a\r\nfor j in range(0,10):\r\n a=a+j\r\n if a%b!=0:\r\n a=c\r\n else:\r\n print(a*(10**(n-1)))\r\n break\r\n if j==9:\r\n print(-1)\r\n \r\n ", "a,b,n = [int(x) for x in input().split()]\n#Question : Add a digit everytime to a only if it's divisible by b ; N times and return the number\n# DUmbass method : Thinking for which digit to add everytime\n# Quick method : Think of first digit to add, then next it is 10**(N-1) adding zeros only\nax = 0\nflag = -1\nfor i in range(10):\n\tax = a*10+i\n\tif ax%b == 0:\n\t\tflag = 0\n\t\tbreak\nif flag == -1:\n\tprint(-1)\nelse:\n\tprint(ax*(10**(n-1)))\n\n", "\r\ndef addingDigits(a,b,n):\r\n a *= 10\r\n for i in range(10):\r\n if (a + i) % b == 0:\r\n return str(a + i) + \"0\" * (n - 1)\r\n\r\n return -1\r\n\r\nif __name__ == '__main__':\r\n a, b, n = map(int, input().split(\" \"))\r\n print(addingDigits(a,b,n))", "import sys\r\na,b,n=map(int,input().split(' '))\r\ndd=0\r\nfor i in range(0, 10):\r\n if((a*10+i)%b==0):\r\n a = (a*10+i)\r\n dd=1\r\n break\r\nif(dd==0):\r\n print(-1)\r\n sys.exit()\r\nn-=1\r\nl=[str(a)]\r\nfor i in range(n):\r\n l.append('0')\r\nprint(''.join(l))", "a,b,n=map(int, input().split())\r\nflag=-1\r\nfor i in range(10):\r\n if (a*10+i)%b==0:\r\n flag=a*10+i\r\n flag=str(flag)+str(0)*(n-1)\r\n break\r\nprint(flag)", "[a,b,n]=list(map(int,input().split()))\r\nflag=0\r\na*=10\r\na+=9\r\nif(0<=a%b<=9):\r\n a-=a%b\r\n n-=1\r\n print(str(a)+'0'*(n))\r\nelse:\r\n print(-1)", "a, b, n = map(int, input().split())\nnb = a\n\nfor i in range(10):\n if (a*10 + i) % b == 0:\n nb = a*10 + i\n break\n\nif a == nb:\n print(-1)\n\nelse:\n print(str(nb) + '0'*(n-1))", "a,b,n = map(int,input().split())\r\nflag = 0\r\nfor i in range(0,10):\r\n p = a*10\r\n p += i\r\n if p%b==0:\r\n a = p\r\n flag = 0\r\n break\r\n else:\r\n flag = 1\r\nif flag==1:\r\n print(-1)\r\nelse:\r\n a = str(a)\r\n for i in range(n-1):\r\n a+='0'\r\n print(a)", "a, b, n = map(int, input().split())\r\n\r\na *= 10\r\nflag = False\r\n\r\nfor i in range(10):\r\n if (a+i) % b == 0:\r\n print(a+i, end = \"\")\r\n flag = True\r\n break\r\n\r\nif(flag):\r\n s = \"0\" * (n-1)\r\n print(s)\r\n\r\nelse:\r\n print(-1)\r\n", "import io,sys,os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\ndef printArr(arr):\r\n\tsys.stdout.write(\" \".join(map(str,arr)) + \"\\n\")\r\n\r\ndef solve(a,b,n):\r\n\ta=a*10\r\n\tflag=True\r\n\tfor i in range(a,a+10):\r\n\t\tif i%b==0:\r\n\t\t\ta=i\r\n\t\t\tflag=False\r\n\t\t\tbreak\r\n\tif flag:\r\n\t\treturn -1\r\n\ta = str(a)\r\n\ta = a+ ('0'*(n-1))\r\n\treturn a\r\n\r\n\r\n\r\nt=1\r\nwhile t>0:\r\n\tarr=[int(i) for i in input().decode().strip().split()]\r\n\ta,b,n=int(arr[0]),int(arr[1]),int(arr[2])\r\n\tanswer=solve(a,b,n)\r\n\tsys.stdout.write(str(answer)+'\\n')\r\n\tt-=1\r\n", "a,b,n=map(int,input().split())\r\nfor i in [*range(10)]:\r\n if ((10*a)+i)%b==0:\r\n print(str(a)+str(i)+'0'*(n-1))\r\n exit(0)\r\nprint(-1)", "x,y,n=[int(a) for a in input().split()]\r\nx=x*10+9\r\nif(x%y<10):\r\n print(str(x-x%y)+\"0\"*(n-1))\r\nelse:\r\n print(-1)\r\n", "a,b,c=[int(i) for i in input().split()]\r\na*=10\r\nf=1\r\nfor i in range(0,10):\r\n if((a+i)%b==0):\r\n print(str(a+i)+\"0\"*(c-1))\r\n f=0\r\n break\r\nif f==1:\r\n print(-1)", "a ,b ,n = map(int, input().split())\r\nnum = a\r\nfor i in range(10):\r\n m = a*10+i\r\n if m%b==0:\r\n a=m\r\n break\r\nif num == a:\r\n print(-1)\r\n exit()\r\n \r\nfor i in range(n-1):\r\n a*=10\r\nprint(a)\r\n\r\n", "a,b,c=map(int,input().split())\r\ncount=0\r\nfor i in range(10):\r\n if (10*a+i)%b==0:\r\n print(10*a+i,end='')\r\n break\r\n elif i==9:\r\n print(\"-1\")\r\n count+=1\r\nif count==0:\r\n for i in range(c-1):\r\n print(\"0\",end=\"\")\r\n\r\n ", "a,b,n=map(int,input().split(\" \"))\r\nnum=a\r\nflag=True\r\nfor i in range(0,10):\r\n if (num*10+i)%b==0:\r\n num=num*10+i\r\n a=num\r\n flag=False\r\n break\r\n\r\nif flag==True:\r\n print(-1)\r\nelse:\r\n a*=pow(10,n-1)\r\n print(a)\r\n", "n, m, k = input().split()\r\nm=int(m)\r\ncount=0\r\nfor j in range(10):\r\n var=n+str(j)\r\n if int(var)%m==0:\r\n count=1\r\n n=n+str(j)\r\n break\r\nif count==1:\r\n print(str(n)+str(0)*(int(k)-1))\r\nelse:\r\n print(-1)\r\n", "a,b,n=map(int,input().split())\r\nc=str(a)\r\nfor (i) in range(10):\r\n if int(c+str(i))%b==0:\r\n c=c+str(i)\r\n print(c + \"0\" * (n - 1))\r\n exit()\r\nprint(-1)\r\n", "a,b,n = [int(x) for x in input().split()]\r\ns = str(a)\r\ncheck = 1\r\nfor i in range(10):\r\n if int(s+str(i))%b==0:\r\n s += str(i)\r\n check = 0\r\n break\r\nif check:\r\n print(-1)\r\nelse:\r\n print(s+'0'*(n-1))\r\n\r\n", "a,b,n=map(int,input().split())\r\nif a%b==0:\r\n print(a,end=\"\")\r\n print(\"0\"*n)\r\nelse:\r\n temp=False\r\n \r\n for i in range(10):\r\n num=a*10+i\r\n if num%b==0:\r\n a=num\r\n temp=True\r\n \r\n print(num,end=\"\")\r\n print(\"0\"*(n-1))\r\n exit()\r\n \r\n if temp==False:\r\n print(-1)\r\n \r\n", "a,b,n=list(map(int, input().split()))\r\na*=10\r\nt=0\r\nfor i in range(10):\r\n\tif(a+i)%b==0:\r\n\t\tc=str(a+i)+'0'*(n-1)\r\n\t\tt=1\t\r\nprint(c if t else -1)", "def adding(a, b, n):\r\n a *= 10\r\n n -= 1\r\n for elem in range(10):\r\n if (a + elem) % b == 0:\r\n return str(a + elem) + \"0\" * n\r\n return -1\r\n\r\n\r\nA, B, N = [int(i) for i in input().split()]\r\nprint(adding(A, B, N))\r\n", "a,b,n=[int(i) for i in input().split()]\r\nfinal=0\r\nfl=0\r\nfor i in range(0,10):\r\n new=a*10+i\r\n if(new%b==0):\r\n final=new\r\n fl=1\r\n break\r\nif(fl==0):\r\n print(-1)\r\nelse:\r\n ans=final*(10**(n-1))\r\n print(ans)", "# cook your dish here\r\na,b,c=map(int,input().split())\r\nflag=0\r\nif a%b==0:\r\n flag=1\r\n a=a*10**c\r\nelse:\r\n for i in range(10):\r\n temp=a*10+i\r\n if (temp%b==0):\r\n a=temp*10**(c-1)\r\n flag=1\r\n break\r\nif flag:\r\n print(a)\r\nelse:\r\n print(-1)", "a,b,n=map(int,input().split())\r\na*=10\r\ndone=0\r\nfor i in range(10):\r\n x=a+i\r\n if(x%b==0):\r\n done=1\r\n a=x\r\n break\r\nif(done==0):\r\n print(-1)\r\nelse:\r\n print(a,end=\"\")\r\n e=\"0\"*(n-1)\r\n print(e)", "import sys\r\ninput = sys.stdin.readline\r\na, b, n = map(int, input().split())\r\nfor i in range(10):\r\n s = 10 * a + i \r\n if(s % b == 0):\r\n a = str(10 * a + i) + '0' * (n - 1)\r\n print(a)\r\n break \r\nelse:\r\n print(-1)\r\n ", "a, b, n=[int(k) for k in input().split()]\r\na=str(a)\r\nfor j in range(10):\r\n if int(a+str(j))%b==0:\r\n print(a+str(j)+(n-1)*\"0\")\r\n break\r\nelse:\r\n print(-1)", "a,b,n = map(int, input().split())\r\nz=-1\r\nfor i in range(10):\r\n if (a*10+i)%b==0 :\r\n a=a*10+i\r\n z=1\r\n break\r\nif z==-1 :\r\n print(-1)\r\nelse :\r\n print(a,end=\"\")\r\n print('0'*(n-1))", "a,b,n=map(int,input().split())\r\nf=0\r\nfor i in range(10):\r\n s=str(a)+str(i)\r\n if int(s)%b==0:\r\n print(s+'0'*(n-1))\r\n f=1 \r\n break \r\nif f==0:\r\n print(-1)", "a, b, n = (int(x) for x in input().split())\nv = (b - (10 * a) % b) % b\nif 0 <= v <= 9:\n print(str(a) + str(v) + '0' * (n - 1))\nelse:\n print(-1)", "a, b, n = map(int, input().split())\r\nf = 0\r\n\r\na *= 10\r\nc = 0\r\nwhile a % b != 0:\r\n a += 1\r\n c += 1\r\nif c > 9:\r\n print('-1')\r\n f = 1\r\nn -= 1\r\ntempwtf = ['0']*n\r\ntempwtff = str(''.join(tempwtf))\r\nif f != 1:\r\n temp = str(a)\r\n print(temp+tempwtff)\r\n", "def solve(a, b, n):\r\n nextStep = a * 10\r\n for i in range(10):\r\n if (nextStep + i) % b == 0:\r\n a = nextStep + i\r\n break\r\n\r\n if a < nextStep:\r\n return -1\r\n\r\n return a * (10**(n-1))\r\n\r\na, b, n = (int(i) for i in input().split())\r\nprint(solve(a, b, n))", "def scan(type):\n return list(map(type, input().split()))\na,b,n, = scan(int)\n\na = str(a)\nans = -1\n\nfor i in range(10):\n temp = int(a + str(i))\n if (temp%b == 0):\n ans = str(temp) + (n-1)*'0'\nprint(ans)\n\n# 1483392806533", "a,b,n=map(int,input().split())\r\nk=0\r\nf=0\r\np=str(a)\r\nfor j in range(10):\r\n p=str(p)\r\n p+=str(j)\r\n p=int(p)\r\n if(p%b==0):\r\n a=p\r\n f=1\r\n break\r\n else:\r\n p=str(p)\r\n p=p[:-1]\r\na=str(a)\r\nif(f==1):\r\n print(a+'0'*(n-1))\r\nelse:\r\n print(-1)", "a,b,n= map(int,input().split())\na*=10\nfor i in range(10):\n if(a+i)%b==0 :\n print(str(a+i)+\"0\"*(n-1))\n exit()\nprint(\"-1\")\n", "def small(x, y):\r\n m = str(x)\r\n for i in range (0,10):\r\n res = int(str(m)+str(i))\r\n if res%y==0:\r\n return str(i)\r\n if res%y!=0 and i==9:\r\n return False\r\n\r\n\r\na, b, n = map(int, input().split())\r\nif small(a,b)==False:\r\n print(-1)\r\nelse:\r\n print(str(a) + small(a,b) + (n-1)*'0')", "a,b,n = map(int,input().split())\nans = None\nfor i in range(10):\n x = a*10+i\n if (x%b==0):\n ans = x\n break;\nif(ans is None):\n print(-1)\nelse:\n for i in range (n-1):\n ans = ans*10\n print(ans)\n\n \t \t \t\t \t\t\t\t\t \t \t \t\t\t\t \t\t\t\t\t", "a,b,n = map(int,input().split())\r\na1 = a*10 + 9\r\na1-=a1%b\r\nif a1>=a*10:\r\n print(str(a1)+\"0\"*(n-1))\r\nelse:\r\n print(-1)", "a,b,n = map(int,input().split(\" \"))\r\n\r\nflag=0\r\ntemp = str(a)\r\n\r\nfor i in range(10):\r\n s=str(a)\r\n s+=str(i)\r\n \r\n k=int(s)\r\n if k%b==0:\r\n for i in range(n-1):\r\n s+='0'\r\n temp=s\r\n flag=1\r\n break\r\nif flag==1:\r\n print(int(temp))\r\nelse:\r\n print(-1)", "def f(a,b,n):\r\n minm=10*a\r\n maxm=10*a+9\r\n if minm%b==0:\r\n return int(str(a)+\"0\"*n)\r\n else:\r\n rem=minm%b\r\n s=minm-rem+b\r\n if s<=maxm:\r\n return int(str(s)+\"0\"*(n-1))\r\n else:\r\n return -1\r\narray=list(map(int, input().rstrip().split()))\r\na=array[0]\r\nb=array[1]\r\nn=array[2]\r\nprint(f(a,b,n))", "a,b,n = map(int,input().split())\r\nstore = a\r\nx=a\r\nfor i in range(10):\r\n tem = x*10+i\r\n if tem%b==0:\r\n a=tem\r\n break\r\nif a!=store:\r\n st = str(a)\r\n st += ('0')*(n-1)\r\n a = int(st)\r\nprint(a if a!=store else -1)\r\n", "a,b,n = map(int,input().split())\r\nc = a\r\nif a % b != 0 :\r\n for i in range(10) :\r\n a = int(str(a) + str(i))\r\n if a % b == 0 :\r\n a = int(str(a) + '0' * (n-1))\r\n break\r\n else :\r\n a = c\r\n continue\r\n else :\r\n a = -1\r\nelse :\r\n a = int(str(a) + '0' * (n))\r\nprint(a)\r\n\r\n", "a, b, n=map(int, input().strip().split())\n\nflag5=0\nfor i in range(0,10) : \n\tif int(str(a) + str(i)) % b == 0:\n\t\tflag5 = 1\n\t\tprint(str(a) + str(i) + \"0\"*(n - 1))\n\t\tbreak\nif flag5 == 0:\n\tprint(-1)", "number, divisor, n = map(int, input().strip().split())\n\nfor i in range(10):\n if (number*10 + i) % divisor == 0:\n number = number * 10 + i\n break\nelse:\n print(-1)\n exit()\n\nfor i in range(n-1):\n number *= 10\n\nprint(number)\n", "a,b,n = map(int, input().split())\r\nans = a\r\nfor i in range(1):\r\n ans *= 10\r\n rem = b-(ans%b)\r\n if rem>9 and rem!=b:\r\n print(-1)\r\n break\r\n ans += rem%b\r\nelse:\r\n print(ans,end='')\r\n print('0'*(n-1))" ]

[ "n = int(input())\ncd = set()\ntrace = {}\nnodes = set()\n\nfor _ in range(n):\n a, b = input().split()\n if a == '0':\n a = 'start'\n if b == '0':\n b = 'end'\n cd.add(b)\n nodes.add(a)\n nodes.add(b)\n trace[a] = b\n\nfirst, second = -1, trace.get('start')\nfor nd in nodes:\n if nd not in cd and nd != 'start':\n first = nd\n\nwhile first or second:\n if first and first != 'end':\n print(first, end=\" \")\n if second and second != 'end':\n print(second, end=\" \")\n first = trace.get(first)\n second = trace.get(second)", "from collections import Counter\r\n\r\n\r\nn = int(input())\r\nfront = {}\r\nback = {}\r\nfor _ in range(n):\r\n a, b = list(map(int, input().split()))\r\n front[a] = b\r\n back[b] = a\r\n\r\nans = [0] * (n + 2)\r\nans[2] = front[0]\r\nstart = front[0]\r\ni = 2\r\nwhile start in front and start != 0:\r\n i += 2\r\n ans[i] = front[start]\r\n start = front[start]\r\nstart = None\r\nfor key in front:\r\n if key not in back:\r\n start = key\r\n\r\ni = 1\r\nans[i] = start\r\nwhile start in front and start != 0:\r\n i += 2\r\n ans[i] = front[start]\r\n start = front[start]\r\n\r\nprint(*ans[1: -1])\r\n", "ff = {}\r\nbb = {}\r\nids = []\r\nn = int(input())\r\nfor _ in range(n):\r\n f, b = [int(i) for i in input().split()]\r\n ids.append(f)\r\n ids.append(b)\r\n bb[b] = f\r\n ff[f] = b\r\n\r\nq = [0 for _ in range(n)]\r\nfor i in ids:\r\n if i not in ff:\r\n q[-1] = i\r\n if i not in bb:\r\n q[0] = i\r\n\r\none = ff[0]\r\ntwo = ff[q[0]]\r\nidx1 = 1\r\nidx2 = 2\r\nwhile idx2 < n:\r\n q[idx1] = one\r\n q[idx2] = two\r\n if one in ff:\r\n one = ff[one]\r\n else:\r\n break\r\n if two in ff:\r\n two = ff[two]\r\n else:\r\n break\r\n idx1 += 2\r\n idx2 += 2\r\n\r\nprint(*q)\r\n", "import sys\r\ninput=sys.stdin.readline\r\npre,nxt={},{}\r\ndef connect(a,b):\r\n nxt[a]=b\r\n pre[b]=a\r\n\r\nn=int(input())\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n connect(a,b)\r\ns=nxt[0]\r\ni,a=1,[0]*n\r\na[i]=s\r\nvis={s}\r\nwhile nxt.get(s,None):\r\n a[(i:=i+2)]=(s:=nxt[s])\r\n vis.add(s)\r\ns=[i for i in nxt if i not in vis and i!=0][0]\r\nwhile pre.get(s,None): s=pre[s]\r\na[(i:=0)]=s\r\nwhile nxt.get(s,None): a[(i:=i+2)]=(s:=nxt[s])\r\nprint(*a)", "#nums = list(map(int, input().split()))\r\n\r\nfrom collections import defaultdict, deque\r\n\r\nn = int(input())\r\nanswer = [0 for _ in range(n)]\r\n\r\nqueue = deque([])\r\n\r\nbefore_dict = defaultdict(int)\r\nafter_dict = defaultdict(int)\r\n\r\nfor _ in range(n):\r\n before,after = map(int, input().split())\r\n if before == 0:\r\n queue.append((after,1))\r\n before_dict[after] = -1\r\n elif after == 0:\r\n queue.append((before,-2))\r\n after_dict[before] = -1\r\n else:\r\n before_dict[after] = before\r\n after_dict[before] = after\r\n\r\nfor key in after_dict:\r\n if before_dict[key] == 0:\r\n queue.append((key,0))\r\n\r\nvisited = set()\r\nwhile queue:\r\n # print(queue)\r\n curr,idx = queue.popleft()\r\n if curr not in visited:\r\n visited.add(curr)\r\n answer[idx] = curr\r\n if before_dict[curr] > 0 and before_dict[curr] not in visited and idx-2 >= n*-1:\r\n queue.append((before_dict[curr],idx-2))\r\n if after_dict[curr] > 0 and after_dict[curr] not in visited and idx+2 < n:\r\n queue.append((after_dict[curr],idx+2))\r\n\r\n\r\n\r\n\r\n# print(after_dict)\r\n# print(before_dict)\r\nprint(*answer)\r\n \r\n \r\n ", "from collections import deque,defaultdict\r\nn = int(input())\r\nq = deque([])\r\nans = [0] * n\r\ncounter = defaultdict(int)\r\ngraph = defaultdict(int)\r\nfor _ in range(n):\r\n infront, behind = tuple(map(int, input().split()))\r\n counter[infront] += 1\r\n counter[behind] += 1\r\n if infront == 0:\r\n ans[1] = behind\r\n graph[infront] = behind\r\n\r\nfor key in graph.keys():\r\n if counter[key] == 1:\r\n start = key\r\n break\r\nans[0] = start\r\nq.append((start, 2))\r\nq.append((ans[1], 3))\r\n\r\nwhile q:\r\n person, idx = q.popleft()\r\n temp = graph[person]\r\n if temp:\r\n ans[idx] = temp\r\n q.append((temp, idx + 2))\r\n \r\n\r\nprint(*ans)\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n ", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nP = defaultdict(int)\r\nins = defaultdict(int)\r\nA = set()\r\nans = [0]*N\r\nfor _ in range(N):\r\n a,b = map(int, input().split())\r\n if a==0:\r\n ans[1] = b\r\n continue\r\n elif b==0:\r\n ans[-2]=a\r\n continue\r\n \r\n A.add(a)\r\n A.add(b)\r\n ins[b]+=1\r\n P[a]=b\r\n \r\n\r\nfor a in A:\r\n if ins[a]==0:\r\n if a==ans[1]:\r\n idx = 1\r\n while P[a]>0:\r\n idx+=2\r\n ans[idx] = P[a]\r\n a = P[a]\r\n else:\r\n idx = 0\r\n while a>0:\r\n ans[idx] = a\r\n a = P[a]\r\n idx+=2\r\n \r\nprint(*ans)\r\n", "n = int(input())\r\nA, B = set(), set()\r\nd = {}\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d[a] = b \r\n A.add(a)\r\n B.add(b)\r\nsol = [0] * n\r\nsol[0] = (A - B).pop()\r\nsol[1] = d[0]\r\nfor i in range(2, n):\r\n sol[i] = d[sol[i - 2]]\r\nprint(*sol)", "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 = int(input())\r\n ans = [0 for i in range(n)]\r\n pair1 = dict()\r\n pair2 = dict()\r\n for i in range(n):\r\n a, b = [int(num) for num in input().split()]\r\n pair1[a] = b\r\n pair2[b] = a\r\n if n % 2 == 0:\r\n cur = 0\r\n for i in range(n // 2):\r\n cur = pair1[cur]\r\n ans[i * 2 + 1] = cur\r\n cur = 0\r\n for i in range(n // 2):\r\n cur = pair2[cur]\r\n ans[n - 1 - i * 2 - 1] = cur\r\n else:\r\n cur = 0\r\n for i in range(n // 2):\r\n cur = pair1[cur]\r\n ans[i * 2 + 1] = cur\r\n for k in pair1:\r\n if k not in pair2:\r\n cur = k\r\n ans[0] = cur\r\n for i in range(1, n // 2 + 1):\r\n cur = pair1[cur]\r\n ans[i * 2] = cur\r\n print(*ans)\r\n\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", "H = [None for _ in range(1000005)]\r\nprec = set()\r\nsuc = set()\r\ndef main():\r\n n = int(input())\r\n ans = [None for _ in range(n)]\r\n for _ in range(n):\r\n pre, sucsuc = list(map(int, input().split()))\r\n prec.add(pre)\r\n if (pre == 0): ans[1] = sucsuc\r\n H[pre] = sucsuc\r\n suc.add(sucsuc)\r\n f = prec.difference(suc).pop()\r\n ans[0] = f\r\n for i in range(n - 2):\r\n ans[i + 2] = H[ans[i]]\r\n print(*ans)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "back={}\r\nfront={}\r\nn=int(input())\r\nans=[0 for _ in range(n+1)]\r\n\r\nfor _ in range(n):\r\n x,y=[int(x) for x in input().split()]\r\n front[x]=y\r\n back[y]=x\r\n#filling the fronts\r\n\r\nvalue=0\r\ni=0\r\nvisited=set()\r\nwhile value in front:\r\n if front[value]!=0:\r\n ans[i+2]=front[value]\r\n visited.add(front[value])\r\n value=front[value]\r\n i+=2\r\n else:\r\n value=-1\r\nvalue=0\r\ni=n+1\r\nwhile value in back:\r\n if back[value]!=0:\r\n ans[i-2]=back[value]\r\n visited.add(back[value])\r\n value=back[value]\r\n i-=2\r\n \r\n else:\r\n value=-1\r\ntemp=[]\r\nif len(visited)!=n:\r\n for i in front:\r\n if i not in back:\r\n temp.append(i)\r\n break\r\n while i in front:\r\n temp.append(front[i])\r\n i=front[i]\r\n j=0\r\n for i in range(1,n+1):\r\n if ans[i]==0:\r\n ans[i]=temp[j]\r\n j+=1\r\nprint(*ans[1:])", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\nd, d1 = {}, {}\r\nfor i in range(n):\r\n a , b = map(int, input().split())\r\n d[a], d1[b] = b, a\r\nres = []\r\nfor i in d.keys():\r\n if i not in d1:\r\n res.append(i)\r\nres.append(d.get(0))\r\nfor i in range(2, n):\r\n res.append(d.get(res[i - 2]))\r\nprint(*res)\r\n", "n = int(input())\r\nm = {}\r\na = []\r\nfor i in range(n):\r\n front, back = map(int, input().split())\r\n m[front] = back\r\n a.append(back)\r\n\r\nans = list(set(m.keys()) - set(a))\r\nans.append(m.get(0))\r\n\r\nfor i in range(n - 2):\r\n ans.append(m.get(ans[i]))\r\n\r\nprint(*ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\nn = int(input())\r\nl = dict()\r\nr = dict()\r\nx = -1\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n l[b] = a\r\n r[a] = b\r\n if n % 2 == 0:\r\n if x == -1:\r\n x = a\r\n else:\r\n if a == 0:\r\n x = b\r\n\r\nif n % 2 == 0:\r\n d = deque([x])\r\n a = x\r\n while a in r:\r\n a = r[a]\r\n d.append(a)\r\n a = x\r\n while a in l:\r\n a = l[a]\r\n d.appendleft(a)\r\n for i in range(n//2):\r\n print(d[i], end=' ')\r\n print(d[n//2+1+i], end=' ')\r\nelse:\r\n d = [x]\r\n a = x\r\n s = {0, x}\r\n while a in r:\r\n if r[a] in s:\r\n break\r\n a = r[a]\r\n d.append(a)\r\n s.add(a)\r\n for i in l:\r\n if i not in s:\r\n x = i\r\n break\r\n d1 = deque([x])\r\n a = x\r\n while a in r:\r\n a = r[a]\r\n d1.append(a)\r\n a = x\r\n while a in l:\r\n a = l[a]\r\n d1.appendleft(a)\r\n for i in range(n//2):\r\n print(d1[i], end=' ')\r\n print(d[i], end=' ')\r\n print(d1[-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ngraph = dict(input()[:-1].split() for _ in range(n))\r\n\r\nans = [None] * n\r\nvalues = set(graph.values())\r\nans[0] = next(k for k in graph if k not in values)\r\nans[1] = graph['0']\r\nfor i in range(2, n):\r\n ans[i] = graph[ans[i - 2]]\r\n\r\nprint(*ans)\r\n", "def get_int():\r\n return int(input())\r\ndef main():\r\n n = get_int()\r\n array = [0]*n\r\n right_hashmap = {} \r\n left_hashmap = {}\r\n nums = set()\r\n for _ in range(n):\r\n left, right = list(map(int, input().split()))\r\n if left == 0:\r\n array[1] = right \r\n if right == 0:\r\n array[n - 2] = left \r\n right_hashmap[left] = right \r\n left_hashmap[right] = left\r\n nums.add(left)\r\n nums.add(right)\r\n nums = list(nums)\r\n start = 0\r\n end = 0\r\n for index in range(len(nums)):\r\n if nums[index] not in left_hashmap:\r\n start = nums[index]\r\n if nums[index] not in right_hashmap:\r\n end = nums[index]\r\n array[0] = start \r\n array[n - 1] = end \r\n index = 0\r\n while index + 2 < n:\r\n value = array[index]\r\n if value != 0 and value in right_hashmap:\r\n array[index + 2] = right_hashmap[value]\r\n index += 1\r\n while index - 2 >= 0:\r\n value = array[index]\r\n if value != 0 and value in left_hashmap:\r\n array[index - 2] = left_hashmap[value]\r\n index -= 1\r\n print(*array)\r\nmain()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "from collections import defaultdict\n\nN = int(input())\n\nright, left, line = dict(), dict(), list()\nfor n in range(N):\n a, b = map(int, input().split())\n line.append(0)\n right[a] = b\n left[b] = a\n\nlast = 0\nif N % 2:\n counter = defaultdict(int)\n for key in left:\n counter[key] += 1\n counter[left[key]] += 1\n\n for key in counter:\n if counter[key] == 1 and left.get(key, False):\n last = key\n break\n\ncurr, index = 0, 1\nwhile index <= N - 1:\n curr = right.pop(curr)\n line[index] = curr\n index += 2\n\ncurr = last\nif not N % 2:\n index = -2\nelse:\n line[-1] = curr\n index = -3\n\nwhile abs(index) <= N:\n curr = left.pop(curr)\n line[index] = curr\n index -= 2\n\nstring = str()\nfor person in line:\n string += str(person) + ' '\n \nprint(string)\n\n\t\t \t \t\t \t \t \t\t\t \t\t\t\t\t \t\t \t" ]

[ "if True:\r\n from io import BytesIO, IOBase\r\n import math\r\n\r\n import random\r\n import sys\r\n import os\r\n\r\n import bisect\r\n import typing\r\n from collections import Counter, defaultdict, deque\r\n from copy import deepcopy\r\n from functools import cmp_to_key, lru_cache, reduce\r\n from heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\n from itertools import accumulate, combinations, permutations, count\r\n from operator import add, iand, ior, itemgetter, mul, xor\r\n from string import ascii_lowercase, ascii_uppercase, ascii_letters\r\n from typing import *\r\n BUFSIZE = 4096\r\n\r\n class 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 class 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 sys.stdin = IOWrapper(sys.stdin)\r\n sys.stdout = IOWrapper(sys.stdout)\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n def I():\r\n return input()\r\n\r\n def II():\r\n return int(input())\r\n\r\n def MII():\r\n return map(int, input().split())\r\n\r\n def LI():\r\n return list(input().split())\r\n\r\n def LII():\r\n return list(map(int, input().split()))\r\n\r\n def GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n def LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n inf = float('inf')\r\n\r\ndfs, hashing, timeit = False, False, True\r\n\r\nif dfs:\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\nif hashing:\r\n RANDOM = random.getrandbits(20)\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\nif True:\r\n import time\r\n def timer(func):\r\n def wrapper(*args, **kwargs):\r\n start = time.time()\r\n result = func(*args, **kwargs)\r\n end = time.time()\r\n print(f'Time Used: {round((end - start) * 1000)} ms')\r\n return result\r\n return wrapper if timeit else func\r\n\r\nclass FFT:\r\n def __init__(self, MOD=998244353):\r\n FFT.MOD = MOD\r\n g = self.primitive_root_constexpr()\r\n ig = pow(g, FFT.MOD - 2, FFT.MOD)\r\n FFT.W = [pow(g, (FFT.MOD - 1) >> i, FFT.MOD) for i in range(30)]\r\n FFT.iW = [pow(ig, (FFT.MOD - 1) >> i, FFT.MOD) for i in range(30)]\r\n\r\n def primitive_root_constexpr(self):\r\n if FFT.MOD == 998244353:\r\n return 3\r\n elif FFT.MOD == 200003:\r\n return 2\r\n elif FFT.MOD == 167772161:\r\n return 3\r\n elif FFT.MOD == 469762049:\r\n return 3\r\n elif FFT.MOD == 754974721:\r\n return 11\r\n divs = [0] * 20\r\n divs[0] = 2\r\n cnt = 1\r\n x = (FFT.MOD - 1) // 2\r\n while x % 2 == 0:\r\n x //= 2\r\n i = 3\r\n while i * i <= x:\r\n if x % i == 0:\r\n divs[cnt] = i\r\n cnt += 1\r\n while x % i == 0:\r\n x //= i\r\n i += 2\r\n if x > 1:\r\n divs[cnt] = x\r\n cnt += 1\r\n g = 2\r\n while 1:\r\n ok = True\r\n for i in range(cnt):\r\n if pow(g, (FFT.MOD - 1) // divs[i], FFT.MOD) == 1:\r\n ok = False\r\n break\r\n if ok:\r\n return g\r\n g += 1\r\n\r\n def fft(self, k, f):\r\n for l in range(k, 0, -1):\r\n d = 1 << l - 1\r\n U = [1]\r\n for i in range(d):\r\n U.append(U[-1] * FFT.W[l] % FFT.MOD)\r\n\r\n for i in range(1 << k - l):\r\n for j in range(d):\r\n s = i * 2 * d + j\r\n f[s], f[s + d] = (f[s] + f[s + d]) % FFT.MOD, U[j] * (f[s] - f[s + d]) % FFT.MOD\r\n\r\n def ifft(self, k, f):\r\n for l in range(1, k + 1):\r\n d = 1 << l - 1\r\n for i in range(1 << k - l):\r\n u = 1\r\n for j in range(i * 2 * d, (i * 2 + 1) * d):\r\n f[j+d] *= u\r\n f[j], f[j + d] = (f[j] + f[j + d]) % FFT.MOD, (f[j] - f[j + d]) % FFT.MOD\r\n u = u * FFT.iW[l] % FFT.MOD\r\n\r\n def convolve(self, A, B):\r\n n0 = len(A) + len(B) - 1\r\n k = (n0).bit_length()\r\n n = 1 << k\r\n A += [0] * (n - len(A))\r\n B += [0] * (n - len(B))\r\n self.fft(k, A)\r\n self.fft(k, B)\r\n A = [a * b % FFT.MOD for a, b in zip(A, B)]\r\n self.ifft(k, A)\r\n inv = pow(n, FFT.MOD - 2, FFT.MOD)\r\n A = [a * inv % FFT.MOD for a in A]\r\n del A[n0:]\r\n return A\r\n\r\nn, m, k = MII()\r\ns1 = I()\r\ns2 = I()\r\n\r\nfft = FFT()\r\n\r\nans = [1] * n\r\n\r\nfor c in 'ATGC':\r\n tmp1 = [0] * (n + k + 1)\r\n for i, char in enumerate(s1):\r\n if char == c:\r\n tmp1[max(i - k, 0)] += 1\r\n tmp1[i + k + 1] -= 1\r\n tmp1.pop()\r\n for i in range(1, n + k):\r\n tmp1[i] += tmp1[i - 1]\r\n for i in range(n + k):\r\n tmp1[i] = min(tmp1[i], 1)\r\n \r\n tmp2 = [1 if char == c else 0 for char in s2]\r\n val = sum(tmp2)\r\n tmp2.reverse()\r\n res = fft.convolve(tmp1, tmp2)\r\n \r\n for i in range(n):\r\n if res[i+m-1] < val:\r\n ans[i] = 0\r\n\r\nprint(sum(ans[:n-m+1]))" ]

[ "import sys\n\ninput = sys.stdin.readline\nn = int(input())\na = list(map(int, input().split()))\ndp = [-1] * n\ndp[0] = 0\nque = [0]\n\nwhile que:\n k = que.pop(0)\n for v in [k - 1, k + 1, a[k] - 1]:\n if 0 <= v < n and dp[v] == -1:\n dp[v] = dp[k] + 1\n que.append(v)\n\nprint(*dp)\n", "num = int(input())\r\nshortcuts = list(map(int,input().split()))\r\nshortcuts = [shortcuts[i]-1 for i in range(num)]\r\n \r\nresult = [-1] * num\r\nresult[0],i ,array = 0,0 , [0]\r\nwhile i < len(array):\r\n found = array[i]\r\n i += 1\r\n if result[shortcuts[found]] == -1:\r\n result[shortcuts[found]] = result[found] + 1\r\n array.append(shortcuts[found])\r\n\r\n if found > 0 and result[found - 1] == -1:\r\n result[found - 1] = result[found] + 1\r\n array.append(found - 1)\r\n\r\n if found < num-1 and result[found + 1] == -1:\r\n result[found + 1] = result[found] + 1\r\n array.append(found + 1) \r\n \r\nprint(*result)", "def amount_of_total_energy(n, a):\r\n dist = [-1] * n\r\n dist[0] = 0\r\n pos = [0]\r\n\r\n for u in pos:\r\n\t for v in [u - 1, u + 1, a[u] - 1]:\r\n\t\t if v >= 0 and v < n and dist[v] == -1:\r\n\t\t\t dist[v] = dist[u] + 1\r\n\t\t\t pos.append(v)\t\r\n \r\n return dist\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nprint(*amount_of_total_energy(n, a))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = [-1] * n\r\nm[0] = 0\r\npos = [0]\r\n\r\nfor u in pos:\r\n for v in [u - 1, u + 1, a[u] - 1]:\r\n if v >= 0 and v < n and m[v] == -1:\r\n m[v] = m[u] + 1\r\n pos.append(v)\r\n\r\nprint(*m)", "import queue\r\nn = int(input())\r\nm = input().split(' ')\r\nusado = []\r\na = []\r\nfor i in range(0, n):\r\n usado.append(False)\r\n a.append(-1)\r\nq = queue.Queue()\r\nq.put(0)\r\na[0] = 0\r\nwhile not(q.empty()):\r\n v = q.get()\r\n for dl in range(-1, +2):\r\n u = v + dl\r\n if 0 <= u and u < n and a[u] == -1:\r\n a[u] = a[v] + 1\r\n q.put(u)\r\n u = int(m[v]) - 1\r\n if a[u] == -1:\r\n a[u] = a[v] + 1\r\n q.put(u)\r\nfor i in range(0, n):\r\n print(a[i])", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\ng = []\r\n \r\nfor i in range(n):\r\n To = set()\r\n if i < n - 1:\r\n To.add(i+1)\r\n if i > 0:\r\n To.add(i-1)\r\n if a[i] - 1 != i:\r\n To.add(a[i]-1)\r\n g.append(To)\r\n \r\nq = [0]\r\nused = [i == 0 for i in range(n)]\r\nd = [0 for i in range(n)]\r\np = [0 for i in range(n)]\r\np[0] = -1\r\n \r\nwhile len(q) > 0:\r\n v = q[0]\r\n q.pop(0)\r\n \r\n for to in g[v]:\r\n if not used[to]:\r\n used[to] = True\r\n q.append(to)\r\n d[to] = d[v] + 1\r\n p[to] = v\r\n \r\nfor r in d:\r\n print(r, end=' ')", "n = int(input())\nAis = list(map(int,input().split()))\n \nMis = [0] + [-1]*(n-1)\npos = [0]\n \nfor i in pos:\n n1 = i - 1\n n2 = i + 1\n n3 = Ais[i] - 1\n for j in [n1, n2, n3]:\n if j >= 0 and j < n and Mis[j] == -1:\n Mis[j] = Mis[i] + 1\n pos.append(j)\n \nprint(\" \".join(map(str, Mis)))\n", "import queue\r\n\r\nn = int(input())\r\na_list = list(map(int, input().split()))\r\n\r\nused = []\r\nd = []\r\n\r\nfor i in range(0, n):\r\n used.append(False)\r\n d.append(-1)\r\n\r\nq = queue.Queue()\r\n\r\nq.put(0)\r\nd[0] = 0\r\n\r\nwhile not (q.empty()):\r\n v = q.get()\r\n for dl in range(-1, 2):\r\n u = v + dl\r\n if 0 <= u and u < n and d[u] == -1:\r\n d[u] = d[v] + 1\r\n q.put(u)\r\n u = a_list[v] - 1\r\n if d[u] == -1:\r\n d[u] = d[v] + 1\r\n q.put(u)\r\n\r\noutput = \"\"\r\nfor i in range(0, n):\r\n output += str(d[i]) + \" \"\r\n\r\nprint(output)", "def calcEnergy(seq, energy, stcs):\r\n j = 0\r\n while j < len(seq):\r\n elem = seq[j]\r\n if energy[stcs[elem]] == -1:\r\n energy[stcs[elem]] = energy[elem] + 1\r\n seq.append(stcs[elem])\r\n\r\n if elem < intersection - 1 and energy[elem + 1] == -1:\r\n energy[elem + 1] = energy[elem] + 1\r\n seq.append(elem + 1)\r\n\r\n if elem > 0 and energy[elem - 1] == -1:\r\n energy[elem - 1] = energy[elem] + 1\r\n seq.append(elem - 1)\r\n j += 1\r\n return energy\r\n\r\n\r\nintersection = int(input())\r\nstcs = [int(i) - 1 for i in input().split(' ')]\r\nenergy = calcEnergy([0], [0] + [-1] * (intersection - 1), stcs)\r\nleastTotalOfEnergy = ' '.join(str(x) for x in energy)\r\nprint(leastTotalOfEnergy)", "intersections_number = int(input())\r\nshortcuts = list(map(int, input().split()))\r\n\r\nshortcuts = [(shortcut - 1) for shortcut in shortcuts]\r\ndistances = [0] + ([-1] * (intersections_number - 1))\r\n\r\ni = 0\r\nqueue = [0]\r\nwhile (i < len(queue)):\r\n ith_intersection = queue[i]\r\n shortcut = shortcuts[ith_intersection]\r\n\r\n if distances[shortcut] == -1:\r\n distances[shortcut] = distances[ith_intersection] + 1\r\n queue.append(shortcut)\r\n\r\n if ith_intersection < (intersections_number - 1):\r\n if distances[ith_intersection + 1] == -1:\r\n distances[ith_intersection + 1] = distances[ith_intersection] + 1\r\n queue.append(ith_intersection + 1)\r\n\r\n if ith_intersection > 0:\r\n if distances[ith_intersection - 1] == -1:\r\n distances[ith_intersection - 1] = distances[ith_intersection] + 1\r\n queue.append(ith_intersection - 1)\r\n i += 1\r\n\r\nprint(*distances)\r\n", "import queue\r\n \r\nn=int(input())\r\nintersect=list(map(int, input().split()))\r\nenergy=[]\r\n \r\nfor i in range(0, n):\r\n energy.append(-1)\r\n \r\naux=queue.Queue()\r\naux.put(0)\r\nenergy[0]=0\r\n \r\nwhile not(aux.empty()):\r\n v=aux.get()\r\n \r\n for i in range(-1, +2):\r\n u=v+i\r\n \r\n if 0<=u and u<n and energy[u]==-1:\r\n energy[u]=energy[v]+1\r\n aux.put(u)\r\n \r\n u=intersect[v]-1\r\n \r\n if energy[u]==-1:\r\n energy[u]=energy[v]+1\r\n aux.put(u)\r\n \r\nprint(' '.join(list(map(str, energy))))", "n=int(input())\r\nans=[0]+[n for i in range(n)]\r\ne=[[i+1,i-1] if i<n else [i-1] for i in range(0,n+1)]\r\ne[0],ans[1]=[],0\r\nfor i,x in enumerate(map(int,input().split())):\r\n if i+1!=x: e[i+1]+=[x]\r\nch=[(0,1)]\r\nwhile ch:\r\n l,nom=ch.pop(0)\r\n for x in e[nom]:\r\n if l+1<ans[x]: ans[x]=l+1; ch.append((l+1,x))\r\nprint(*ans[1:]) ", "import sys\r\ninput=sys.stdin.readline\r\nimport heapq\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ng=[[] for i in range(n)]\r\nfor i in range(n):\r\n if i+1<n:\r\n g[i].append(i+1)\r\n if i>0:\r\n g[i].append(i-1)\r\n g[i].append(a[i]-1)\r\nd=[10**18]*n\r\nq=[0]\r\nd[0]=0\r\nwhile q:\r\n ver=q.pop()\r\n for to in g[ver]:\r\n if d[to]>d[ver]+1:\r\n d[to]=d[ver]+1\r\n q.append(to)\r\nprint(*d)", "#coding gbk\r\n#!usr/bin/env\r\nn = int(input())\r\na = [0] + [n for i in range(n)]\r\ne = [[i + 1, i - 1] if i < n else [i - 1] for i in range(0, n + 1)]\r\ne[0] = []\r\na[1] = 0\r\nfor i, x in enumerate(map(int, input().split())):\r\n if i + 1 != x: e[i + 1] += [x]\r\nq = [(0, 1)]\r\nwhile q:\r\n l, cur = q.pop(0)\r\n for x in e[cur]:\r\n if l + 1 < a[x]:\r\n a[x] = l + 1\r\n q.append((l + 1, x))\r\nprint(*a[1:]) \r\n", "n = int(input())\na = list(map(int,input().split()))\n \nres = n * [-1]\nres[0] = 0\npos = [0]\n \nfor i in pos:\n for j in [i - 1, i + 1, a[i] - 1]:\n if j >= 0 and j < n:\n if res[j] == -1:\n res[j] = res[i] + 1\n pos.append(j)\n \nprint(\" \".join(map(str, res)))", "n = int(input())\r\nshortcuts = list(map(int,input().split()))\r\n\r\nshortcuts = [shortcuts[i]-1 for i in range(n)]\r\nresult = [-1] * n\r\nresult[0] = 0\r\nlista = [0]\r\ni = 0\r\n\r\nwhile i < len(lista):\r\n j = lista[i]\r\n i += 1\r\n if result[shortcuts[j]] == -1:\r\n result[shortcuts[j]] = result[j] + 1\r\n lista.append(shortcuts[j])\r\n if j > 0 and result[j - 1] == -1:\r\n result[j - 1] = result[j] + 1\r\n lista.append(j - 1)\r\n if j < n - 1 and result[j + 1] == -1:\r\n result[j + 1] = result[j] + 1\r\n lista.append(j + 1) \r\n \r\n \r\nprint(*result)", "n = int(input())\r\na = list(map(int,input().split()))\r\n \r\ndistances = [-1] * n\r\ndistances[0] = 0\r\npositions = [0]\r\n \r\nfor u in positions:\r\n for v in [u - 1, u + 1, a[u] - 1]:\r\n if v >= 0 and v < n and distances[v] == -1:\r\n distances[v] = distances[u] + 1\r\n positions.append(v)\r\n \r\nprint(*distances)", "# coding: utf-8\n \nfrom queue import Queue\n \nn = int(input())\na = input().split()\n \npassados = []\ndist = []\n \nfor i in range(0, n):\n passados.append(False)\n dist.append(-1)\n \nfila = Queue()\nfila.put(0)\ndist[0] = 0\n \nwhile not(fila.empty()):\n no = fila.get()\n \n for dis in range(-1, +2):\n resposta = no + dis\n if 0 <= resposta and resposta < n and dist[resposta] == -1:\n dist[resposta] = dist[no] + 1\n fila.put(resposta)\n \n resposta = int(a[no]) - 1\n if dist[resposta] == -1:\n dist[resposta] = dist[no] + 1\n fila.put(resposta)\n \nresposta_final = \"\"\nfor i in range(0, n):\n resposta_final += str(dist[i]) + \" \"\n \nprint(resposta_final.strip(\" \"))\n", "def solve(n, g):\n ans = [float('inf')] * (n+1)\n ans[1] = 0\n q = [1]\n while q:\n t = q.pop(0)\n if t+1 <=n and ans[t]+1 < ans[t+1]:\n ans[t+1]=ans[t]+1\n q.append(t+1)\n if t-1 >=1 and ans[t]+1 < ans[t-1]:\n ans[t-1]=ans[t]+1\n q.append(t-1)\n if ans[t]+1 < ans[g[t]]:\n ans[g[t]]=ans[t]+1\n q.append(g[t])\n return ans\n\nif __name__ == '__main__':\n n = int(input())\n g = list(map(int, input().split()))\n g.insert(0,0)\n ans = solve(n, g)\n res = ' '.join([str(i) for i in ans[1:]])\n print(res)\n \t \t\t \t \t\t\t\t\t\t \t\t \t\t", "n = int(input())\nshortcuts = [int(x) for x in input().split()]\nans = [0] * n\n\ndef bfs(src):\n used = [0] * n\n queue = [(src,0)]\n while bool(queue):\n node = queue.pop(0)\n x = node[0]\n if used[x] == 0:\n count = node[1]\n ans[x] = count\n used[x] = 1\n\n sc = shortcuts[x] - 1\n if used[sc] == 0:\n queue.append((sc,count+1))\n\n if x > 0:\n if used[x-1] == 0: \n queue.append((x-1,count+1))\n \n if x < n - 1:\n if used[x+1] == 0: \n queue.append((x+1,count+1))\n\n \n\nbfs(0)\nprint(\" \".join([str(x) for x in ans]))\n\t \t \t \t \t\t\t\t\t\t\t\t \t\t \t\t", "import sys\r\nimport io, os\r\nimport math\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nceil = math.ceil\r\n# arr=list(map(int, input().split()))\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\ndef check(x,arr,k):\r\n n=len(arr)\r\n mid=n//2\r\n if(x<=arr[mid]):\r\n return True\r\n c=0\r\n for i in range(mid,n):\r\n c+=max(0,x-arr[i])\r\n if(c<=k):\r\n return True\r\n else:\r\n return False\r\ndef bfs(graph,root_node,no_of_nodes):\r\n st=root_node\r\n n=no_of_nodes\r\n q=[st] # not really a queue, will use ptr instead to select top of the queue\r\n ptr=0\r\n ans=[0]*n\r\n nv=[True]*n # If pt is visited or not\r\n nv[st]=False\r\n while(ptr!=len(q)):\r\n child=graph[q[ptr]]\r\n for i in range(len(child)):\r\n if(nv[child[i]]):\r\n nv[child[i]]=False\r\n q.append(child[i])\r\n ans[child[i]]=1+ans[q[ptr]]\r\n ptr+=1\r\n return ans\r\ndef main():\r\n n=int(input())\r\n arr=list(map(int, input().split()))\r\n if(n==1):\r\n print(0)\r\n exit()\r\n if(n==2):\r\n print(0,1)\r\n exit()\r\n for i in range(n):\r\n arr[i]-=1\r\n if(arr[i]==i):\r\n arr[i]=-1\r\n graph=[[]for i in range(n)]\r\n for i in range(n):\r\n if(i-1>-1):\r\n graph[i].append(i-1)\r\n if(arr[i]>-1):\r\n graph[i].append(arr[i])\r\n if(i+1<n):\r\n graph[i].append(i+1)\r\n s=bfs(graph,0,n)\r\n print(*s)\r\nmain()", "n = int(input())\ne = [-1] * n\ne[0] = 0\narray1 = [0]\nlista = list(map(int,input().split()))\nfor i in array1:\n for v in [i-1, i+1, lista[i]-1]:\n if v >= 0 and v<n and e[v]==-1:\n e[v]=e[i]+1\n array1.append(v)\nprint(*e)", "from sys import stdin, stdout\r\nfrom collections import deque\r\nread, write = stdin.readline, stdout.write\r\n\r\nn = int(read())\r\nshortcuts = list(map(lambda x: int(x)-1, read().split()))\r\n\r\ngraph = [[] for _ in range(n)]\r\nfor i in range(n):\r\n graph[i] = list({max(0,i-1),min(n-1,i+1),shortcuts[i]})\r\n\r\nqueue = deque([(0,0)])\r\nvisited = [0] * n\r\ndistances = [float('inf')] * n\r\nvisited[0],distances[0] = 1,0\r\n\r\nwhile queue:\r\n node, distance = queue.popleft()\r\n\r\n for neighbor in graph[node]:\r\n if not visited[neighbor]:\r\n queue.append((neighbor, distance + 1))\r\n distances[neighbor] = distance + 1\r\n visited[neighbor] = 1\r\n\r\nwrite(' '.join(map(str,distances)))\r\n\r\n\r\n\r\n", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\ny = [x[i]-1 for i in range(n)]\r\n \r\nq = [0]\r\ni = 0\r\nres = [-1] * n\r\nres[0] = 0\r\n \r\nwhile i < len(q):\r\n c = q[i]\r\n i+=1\r\n if c > 0 and res[c-1] == -1:\r\n res[c-1] = res[c] + 1\r\n q.append(c-1)\r\n if c < n-1 and res[c+1] ==- 1:\r\n res[c+1] = res[c] + 1\r\n q.append(c+1)\r\n if res[y[c]] == -1:\r\n res[y[c]] = res[c] + 1\r\n q.append(y[c])\r\n \r\nprint(' '.join([str(i) for i in res]))", "from queue import Queue\n\nn = int(input())\n\nshortcuts = [int(nb) for nb in input().split()]\n\n\ndst = [-1] * n\n\ndst[0] = 0 \n\nq = Queue()\nq.put(0)\n\nwhile not q.empty():\n node = q.get()\n\n for u in [node-1, node+1, shortcuts[node]-1]:\n if 0 <= u and u < n and dst[u] == -1:\n dst[u] = dst[node] + 1\n q.put(u)\n \n \nfor i in range(len(dst)):\n print(dst[i], end=\" \")\n", "from collections import deque\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\nresult = len(a) * [-1]\r\n\r\nfor i in range(len(a)):\r\n a[i] -= 1\r\n\r\nresult[0] = 0\r\n\r\nq = deque()\r\nq.appendleft(0)\r\n\r\nwhile (len(q) > 0):\r\n u = q.pop()\r\n\r\n l = [a[u], u + 1, u - 1]\r\n\r\n for v in l:\r\n if v < 0 or v >= n:\r\n continue\r\n\r\n if result[v] == -1:\r\n result[v] = result[u] + 1\r\n q.appendleft(v)\r\n\r\nprint(\" \".join(list(map(str, result))))\r\n", "def bfs(nCruzamentos, cruzamentos, aux, fila):\r\n while len(fila) > 0:\r\n atual = fila.pop(0)\r\n\r\n if(atual < nCruzamentos and aux[atual + 1] > aux[atual] + 1):\r\n aux[atual+1]=aux[atual]+1\r\n fila.append(atual + 1)\r\n\r\n if(atual > 1 and aux[atual - 1] > aux[atual]+1):\r\n aux[atual - 1] = aux[atual] + 1\r\n fila.append(atual - 1)\r\n \r\n if(aux[ cruzamentos[atual] ] > aux[atual] + 1):\r\n aux[cruzamentos[atual]] = aux[atual]+1\r\n fila.append(cruzamentos[atual])\r\n \r\n\r\ndef mikeAndShortcuts(nCruzamentos, atalhos):\r\n cruzamentos = [0] + [int(x) for x in atalhos]\r\n aux = [float('inf') for x in range( nCruzamentos + 1 )]\r\n aux[1] = 0\r\n fila=[1]\r\n bfs(nCruzamentos, cruzamentos, aux, fila)\r\n \r\n print(' '.join(str(i) for i in aux[1:]))\r\n\r\nnCruzamentos = int(input())\r\natalhos = input().split()\r\nmikeAndShortcuts(nCruzamentos, atalhos)", "from collections import deque\nn = int(input())\na = list(map(int, input().split()))\nused = [False] * n\nd = [-1] * n\nq = deque()\nq.append(0)\nwhile len(q) > 0:\n v = q.popleft()\n for dx in range(-1, 2):\n u = v + dx\n if 0 <= u and u < n and d[u] == -1:\n d[u] = d[v] + 1\n q.append(u)\n u = a[v] - 1\n if d[u] == -1:\n d[u] = d[v] + 1\n q.append(u)\nfor i in range(n):\n print(d[i], end=' ')\n \n ", "from queue import Queue\r\n\r\n\r\ndef bfs(vertice):\r\n q = Queue()\r\n\r\n q.put(vertice)\r\n dist[vertice] = 0\r\n\r\n while not q.empty():\r\n\r\n v = q.get()\r\n\r\n # print('visitando %d' % vertice)\r\n\r\n for vizinho in adj[v]:\r\n if dist[vizinho] > dist[v] + 1:\r\n dist[vizinho] = dist[v] + 1\r\n q.put(vizinho)\r\n\r\n # print(dist)\r\n\r\n\r\nINF = 10 ** 9 # 10^9\r\n\r\nn = int(input())\r\nadj = [0]\r\nadj.extend([int(x) for x in input().split()])\r\ndist = [INF] * (n + 1)\r\n\r\n# for i in range(n + 1):\r\n# # adj.append([])\r\n# dist.append(INF)\r\n\r\nfor i in range(1, n + 1):\r\n adj[i] = [adj[i]]\r\n if i != 1:\r\n adj[i].append(i - 1)\r\n if i != n:\r\n adj[i].append(i + 1)\r\n\r\nbfs(1)\r\n\r\nresult = \"\"\r\nfor i in range(1, len(dist)):\r\n result += str(dist[i]) + \" \"\r\nprint(result)\r\n\r\n", "def solution(shortcuts, n):\n visited = [-1] * n\n\n queue = [0]\n visited[0] = 0\n\n while (len(queue)):\n node = queue.pop(0)\n for i in [-1, 0, 1]:\n c = node + i\n if c >= 0 and c < n and visited[c] == -1:\n visited[c] = visited[node] + 1\n queue.append(c)\n c = shortcuts[node] - 1\n if visited[c] == -1:\n queue.append(c)\n visited[c] = visited[node] + 1\n return visited\n\nn = int(input())\nshortcuts = list(map(int, input().split()))\nresult = solution(shortcuts, n)\n\nprint(*result, sep=\" \")", "# Solution using Dijkstra - it has time problem\nimport math\n\nn = int(input())\ncuts = list(map(int, input().split()))\ncuts = [-1] + cuts\n\n# Distance\ndist = [-1]*(n+1)\n\ndist[1] = 0\nqueue = [1]\n\n# bfs\nwhile(len(queue) > 0):\n v = queue.pop(0)\n\n if (v+1 <= n) and (dist[v+1] == -1):\n dist[v+1] = dist[v] + 1\n queue.append(v+1)\n \n if (dist[cuts[v]] == -1):\n dist[cuts[v]] = dist[v] + 1\n queue.append(cuts[v])\n \n if (v-1 > 0) and (dist[v-1] == -1):\n dist[v-1] = dist[v] + 1\n queue.append(v-1)\n\n\ns = \" \".join(map(str, dist[1:]))\nprint(s)", "# Aluno Rafael Pontes\r\n\r\nimport queue\r\n\r\ndef create_int_list(n):\r\n l = []\r\n for i in range(0, n):\r\n l.append(-1)\r\n return l\r\n\r\nn = int(input())\r\natalhos = [0] + [int(x) for x in input().split()]\r\ndistancias = create_int_list(n + 1)\r\n\r\nfila = queue.Queue()\r\ndistancias[1] = 0\r\nfila.put(1)\r\n\r\nwhile (fila.qsize() > 0):\r\n \r\n k = fila.get()\r\n\r\n if (k + 1 <= n and distancias[k + 1] == -1):\r\n distancias[k + 1] = distancias[k] + 1\r\n fila.put(k + 1)\r\n \r\n if (distancias[atalhos[k]] == -1):\r\n distancias[atalhos[k]] = distancias[k] + 1\r\n fila.put(atalhos[k])\r\n\r\n if (k - 1 > 0 and distancias[k - 1] == -1):\r\n distancias[k - 1] = distancias[k] + 1\r\n fila.put(k - 1)\r\n\r\nfor i in range(1, n + 1):\r\n print(\"%d \" % distancias[i], end=\"\")", "\"\"\"\nCodeforces Round #361 (Div. 2)\n\nProblem 689 B. Mike and Shortcuts\n\n@author yamaton\n@date 2016-07-09\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(xs, n):\n nodes = list(range(1, n+1))\n\n neighbors = collections.defaultdict(set)\n for from_, to_ in zip(nodes, nodes[1:]):\n neighbors[from_].add(to_)\n neighbors[to_].add(from_)\n for from_, to_ in enumerate(xs, 1):\n neighbors[from_].add(to_)\n\n distance = {1: 0}\n q = collections.deque([1])\n while q:\n node = q.popleft()\n for x in neighbors[node]:\n if x not in distance:\n distance[x] = distance[node] + 1\n q.append(x)\n return [distance[i] for i in nodes]\n\n\ndef pp(*args, **kwargs):\n return print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n n = int(input())\n xs = [int(s) for s in input().strip().split()]\n assert len(xs) == n\n result = solve(xs, n)\n print(*result)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nshortcuts=input().split()\r\nfor i in range (n):\r\n shortcuts[i]=int(shortcuts[i])-1\r\n \r\nmincosts=[]\r\nfor i in range (n):\r\n mincosts.append(i)\r\n \r\nfor i in range (n-1):\r\n a=shortcuts[i]\r\n mincosts[a]=min(mincosts[a],mincosts[i]+1)\r\n if (i+1<n and shortcuts[i]<shortcuts[i+1]):\r\n b=a+1\r\n while (b<=shortcuts[i+1] and mincosts[b-1]+1<mincosts[b]):\r\n mincosts[b]=mincosts[b-1]+1\r\n b+=1\r\n b=a-1\r\n while (b>i and mincosts[b+1]+1<mincosts[b]):\r\n mincosts[b]=mincosts[b+1]+1\r\n b-=1\r\n \r\nfor i in range (1,n):\r\n mincosts[i]=min(mincosts[i],mincosts[i-1]+1)\r\n \r\nfor i in range (n-2,-1,-1):\r\n mincosts[i]=min(mincosts[i],mincosts[i+1]+1)\r\n \r\nfor i in range (n):\r\n mincosts[i]=str(mincosts[i])\r\nprint (\" \".join(mincosts))", "def inputs(f):\r\n return [f(e) for e in input().split()]\r\n\r\ndef solve(n_intersections, shortcuts):\r\n minimuns = [-1] * n_intersections\r\n minimuns[0] = 0\r\n pos = [0]\r\n\r\n for current in pos:\r\n for value in [current - 1, current + 1, shortcuts[current] - 1]:\r\n if value >= 0 and value < n_intersections and minimuns[value] == -1:\r\n minimuns[value] = minimuns[current] + 1\r\n pos.append(value)\r\n\r\n return minimuns\r\n\r\ndef main():\r\n n_intersections = int(input())\r\n shortcuts = inputs(int)\r\n\r\n minimuns = solve(n_intersections, shortcuts)\r\n\r\n print(\" \".join([str(e) for e in minimuns]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "def solve(n, a):\r\n pos = [0]\r\n distances = [-1] * n\r\n distances[0] = 0\r\n\r\n for p in pos:\r\n for value in [p - 1, p + 1, a[p] - 1]:\r\n if value >= 0 and value < n and distances[value] == -1:\r\n distances[value] = distances[p] + 1\r\n pos.append(value)\r\n\r\n return distances\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nres = solve(n, a)\r\n\r\nprint(*res)", "n = int(input())\na = list(map(int,input().split()))\nenergy = [-1] * n\nenergy[0] = 0\npos = [0]\n \nfor i in pos:\n for v in [i - 1, i + 1, a[i] - 1]:\n if v >= 0 and v < n and energy[v] == -1:\n energy[v] = energy[i] + 1\n pos.append(v)\n \nprint(*energy)\n", "from collections import defaultdict\r\nn=int(input())\r\ng=defaultdict(list)\r\na=[*map(lambda s:int(s)-1,input().strip().split())]\r\nfor i in range(len(a)):\r\n if i!=0:\r\n g[i].append(i-1)\r\n if i!=n-1:\r\n g[i].append(i+1)\r\n g[i].append(a[i])\r\ndis=[float(\"inf\")]*n\r\ndis[0]=0\r\nq=[0]\r\nwhile q:\r\n t=q.pop(0)\r\n for i in g[t]:\r\n if dis[i]>dis[t]+1:\r\n q.append(i)\r\n dis[i]=dis[t]+1\r\nprint(*dis)\r\n", "n = int(input())\r\nener = [-1] * n\r\nener[0] = 0\r\naux = [0]\r\narray = list(map(int,input().split()))\r\nfor i in aux:\r\n for v in [i-1, i+1, array[i]-1]:\r\n if v >= 0 and v<n and ener[v]==-1:\r\n ener[v]=ener[i]+1\r\n aux.append(v)\r\nprint(*ener)", "from collections import deque\n\n\ndef find_minimum_energy_needed(nb_intersection, shortcuts):\n dist = [-1] * (nb_intersection + 1)\n\n q = deque()\n dist[1] = 0\n q.append(1)\n\n while q:\n k = q.popleft()\n\n if k + 1 <= nb_intersection and dist[k + 1] == -1:\n dist[k + 1] = dist[k] + 1\n q.append(k + 1)\n\n if dist[shortcuts[k - 1]] == -1:\n dist[shortcuts[k - 1]] = dist[k] + 1\n q.append(shortcuts[k - 1])\n\n if k - 1 > 0 and dist[k - 1] == -1:\n dist[k - 1] = dist[k] + 1\n q.append(k - 1)\n\n for energy in range(1, nb_intersection + 1):\n print(dist[energy], end=\" \")\n\n\nif __name__ == \"__main__\":\n nb_intersection = int(input())\n shortcuts = list(map(int, input().split()))\n find_minimum_energy_needed(nb_intersection, shortcuts)\n", "n = int(input())\r\n\r\nits = [int(i) - 1 for i in input().split()]\r\nd = [0] + [-1] * (n -1)\r\nqueue = [0]\r\n\r\nwhile(len(queue)):\r\n i = queue.pop(0)\r\n p = d[i] + 1\r\n \r\n if (i + 1 < n and d[i + 1] == -1):\r\n d[i + 1] = p\r\n queue.append(i + 1)\r\n\r\n if (i - 1 >= 0 and d[i - 1] == -1):\r\n d[i - 1] = p\r\n queue.append(i - 1)\r\n\r\n if (its[i] >= 0 and d[its[i]] == -1):\r\n d[its[i]] = p\r\n queue.append(its[i])\r\n\r\nprint(*d)", "#!/bin/python3\n\ndef process_shortcut( val, index, ans ):\n start = ans[index]\n lowerIdx = index - 1\n lowerStop = False\n\n while lowerIdx > 0:\n if lowerIdx > 0 and ans[lowerIdx] > val:\n ans[lowerIdx] = val\n lowerIdx -= 1\n else:\n break\n val += 1\n\n return ans\n\ndef process_intersections():\n # Process input\n n = int( input() )\n shortcuts = [ int( x ) for x in input().split() ]\n\n # List of stamina needed / intersections\n ans = list( range(0, n) )\n\n for i in range(0, n):\n j = shortcuts[i]\n\n # Indexing is not the same for shortcut and i\n if i > 0 and ( ans[i-1] + 1 ) < ans[i]:\n ans[i] = ans[i-1]+1\n\n # Check if we really would win anything by going through the shortcut\n if i < j - 2 and ans[j-1] > ans[i] + 1:\n ans[j-1] = ans[i] + 1\n ans = process_shortcut( ans[j-1] + 1, j-1, ans )\n print( *ans )\n\n\nprocess_intersections()\n", "import sys\n\n\ndef main():\n n = int(sys.stdin.readline())\n x = list(map(int, sys.stdin.readline().split()))\n y = [0]*n\n for i in range(n):\n y[i] = x[i]-1\n\n q = []\n q.append(0)\n i=0\n res = [-1]*n\n res[0]=0\n while i<len(q):\n c = q[i]\n i+=1\n if c>0 and res[c-1]==-1:\n res[c-1] = res[c]+1\n q.append(c-1)\n if c<n-1 and res[c+1]==-1:\n res[c+1] = res[c]+1\n q.append(c+1)\n if res[y[c]]==-1:\n res[y[c]] = res[c]+1\n q.append(y[c])\n\n \n print(' '.join(map(str,res)))\n \n\nmain()\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\nimport queue\r\n\r\nMAX = 1000000000\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmov = [-1, 1, 0]\r\n\r\nq = queue.Queue()\r\ndist = [MAX]*n\r\ndist[0] = 0\r\nq.put(0)\r\nwhile q.empty() == False:\r\n cur = q.get()\r\n for i in range(len(mov)):\r\n if i != 2:\r\n nex = cur+mov[i]\r\n else:\r\n nex = a[cur]-1\r\n if 0 <= nex and nex < n and dist[nex] > dist[cur]+1:\r\n dist[nex] = dist[cur]+1\r\n q.put(nex)\r\nprint(' '.join(map(str, dist)))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nd = [-1] * n\r\nd[0] = 0\r\np = [0]\r\n \r\nfor u in p:\r\n for vec in [u - 1, u + 1, a[u] - 1]:\r\n if vec >= 0 and vec < n and d[vec] == -1:\r\n d[vec] = d[u] + 1\r\n p.append(vec)\r\n\r\nprint(*d)", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = [-1] * n\r\nd[0] = 0\r\np = [0] \r\nfor i in p:\r\n for v in [i - 1, i + 1, a[i] - 1]:\r\n if v >= 0 and v < n and d[v] == -1:\r\n d[v] = d[i] + 1\r\n p.append(v)\r\n \r\nprint(*d)", "n = int(input())\na = list(map(int,input().split()))\nm = [-1] * n\nm[0] = 0\npos = [0]\nfor u in pos:\n for v in [u - 1, u + 1, a[u] - 1]:\n if v >= 0 and v < n and m[v] == -1:\n m[v] = m[u] + 1\n pos.append(v)\nprint(*m)", "n = int(input())\na = list(map(int,input().split()))\ndistancias = [-1] * n\ndistancias[0] = 0\npos = [0]\nfor i in pos:\n for j in [i - 1, i + 1, a[i] - 1]:\n if j >= 0 and j < n and distancias[j] == -1:\n distancias[j] = distancias[i] + 1\n pos.append(j)\nprint(*distancias)\n\n", "\r\ndef solve(N, nums):\r\n ans = [float('inf')] * N\r\n ans[0] = str(0)\r\n\r\n for i in range(N):\r\n v = nums[i]\r\n nums[i] = set([\r\n min(N - 1, i + 1),\r\n max(0, i - 1),\r\n v -1,\r\n ])\r\n d = 0\r\n q = set([0])\r\n while q:\r\n next_q = set()\r\n d += 1\r\n for node in q:\r\n for next_node in nums[node]:\r\n if ans[next_node] == float('inf'):\r\n ans[next_node] = str(d)\r\n next_q.add(next_node)\r\n q = next_q\r\n\r\n return ans\r\n\r\nN = int(input())\r\nnums = list(map(int, input().split()))\r\nans = solve(N, nums)\r\nprint((\" \").join(ans))\r\n", "input_n = int(input())\r\nshortcuts = list(map(int,input().split()))\r\nshortcuts = [shortcuts[index]-1 for index in range(input_n)]\r\n \r\nresult = [-1] * input_n\r\nresult[0],index ,f_array = 0,0 , [0]\r\nwhile index < len(f_array):\r\n found = f_array[index]\r\n index += 1\r\n if result[shortcuts[found]] == -1:\r\n result[shortcuts[found]] = result[found] + 1\r\n f_array.append(shortcuts[found])\r\n if found > 0 and result[found - 1] == -1:\r\n result[found - 1] = result[found] + 1\r\n f_array.append(found - 1)\r\n if found < input_n-1 and result[found + 1] == -1:\r\n result[found + 1] = result[found] + 1\r\n f_array.append(found + 1) \r\n \r\n \r\nprint(*result)", "n = int(input())\r\na = list(map(int,input().split()))\r\n \r\ndst = [-1] * n\r\ndst[0] = 0\r\n \r\npos = [0]\r\n \r\nfor i in pos:\r\n\tfor j in [i - 1, i + 1, a[i] - 1]:\r\n\t\tif (j >= 0 and j < n and dst[j] == -1):\r\n\t\t\tdst[j] = dst[i] + 1\r\n\t\t\tpos.append(j)\t\r\n \r\nprint(*dst)", "from queue import Queue\n \nn = int(input())\na = [int(e) for e in input().split()]\n \npassados = []\ndist = []\n \nfor i in range(0, n):\n passados.append(False)\n dist.append(-1)\n \nfila = Queue()\nfila.put(0)\ndist[0] = 0\n \nwhile not(fila.empty()):\n k = fila.get()\n \n for e in range(-1, 2):\n resposta = k + e\n if 0 <= resposta and resposta < n and dist[resposta] == -1:\n dist[resposta] = dist[k] + 1\n fila.put(resposta)\n \n resposta = a[k] - 1\n if dist[resposta] == -1:\n dist[resposta] = dist[k] + 1\n fila.put(resposta)\n\n\nprint(*dist)", "from collections import deque\r\n \r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndist = [-1 for i in range(n)]\r\nbfs = deque()\r\nbfs.append(0)\r\ndist[0] = 0\r\nwhile len(bfs):\r\n cur = bfs.popleft()\r\n for add in range(-1, 2):\r\n u = cur + add\r\n if 0 <= u and u < n and dist[u] == -1:\r\n dist[u] = dist[cur] + 1\r\n bfs.append(u)\r\n u = a[cur] - 1\r\n if dist[u] == -1:\r\n dist[u] = dist[cur] + 1\r\n bfs.append(u)\r\nprint(*dist)", "from queue import Queue\r\n \r\nn = int(input())\r\na = input().split(' ')\r\nuse = []\r\nd = []\r\n\r\n\r\nfor i in range(0, n):\r\n use.append(False)\r\n d.append(-1)\r\n\r\nfila = Queue()\r\nfila.put(0)\r\nd[0] = 0\r\n\r\n\r\nwhile not (fila.empty()):\r\n v = fila.get()\r\n\r\n for dl in range(-1, +2):\r\n u = v + dl\r\n if 0 <= u and u < n and d[u] == -1:\r\n d[u] = d[v] + 1\r\n fila.put(u)\r\n\r\n u = int(a[v]) - 1\r\n if d[u] == -1:\r\n d[u] = d[v] + 1\r\n fila.put(u)\r\n\r\n\r\nfor i in range(0, n):\r\n print(d[i])", "from queue import Queue\r\nq = Queue()\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nused = [-1] * n\r\nq.put(0)\r\nwhile not q.empty():\r\n v = q.get()\r\n if used[v] == -1:\r\n used[v] = 0\r\n if 0 <= v < n - 1 and used[v + 1] == -1:\r\n used[v + 1] = used[v] + 1\r\n q.put(v + 1)\r\n if 0 < v < n and used[v - 1] == -1:\r\n used[v - 1] = used[v] + 1\r\n q.put(v - 1)\r\n u = a[v] - 1\r\n if used[u] == -1:\r\n used[u] = used[v] + 1\r\n q.put(u)\r\nprint(*used)", "n = int(input())\r\nlist = list(map(int, input().split()))\r\ndnc = [-1] * n\r\ndnc[0] = 0\r\nposition = [0]\r\n \r\nfor i in position:\r\n for j in [i - 1, i + 1, list[i] - 1]:\r\n if j >= 0 and j < n and dnc[j] == -1:\r\n dnc[j] = dnc[i] + 1\r\n position.append(j)\r\nprint(*dnc)", "import queue\n\nn = int(input())\nshortcuts = list(map(int, input().split()))\ndistance = [-1 for _ in range(n)]\n\nnext_elems = queue.Queue()\nnext_elems.put(0)\ndistance[0] = 0\n\nwhile not next_elems.empty():\n elem = next_elems.get()\n #using the fact that the graph is equivalent to each intersection having as neighbours the following and previous element only, excluding shortcut\n if elem < n-1 and distance[elem + 1] == -1:\n distance[elem + 1] = distance[elem] + 1\n next_elems.put(elem + 1)\n if elem > 1 and distance[elem - 1] == -1:\n distance[elem - 1] = distance[elem] + 1\n next_elems.put(elem - 1)\n if distance[shortcuts[elem] - 1] == -1:\n distance[shortcuts[elem] - 1] = distance[elem] + 1\n next_elems.put(shortcuts[elem] - 1)\n\noutput = \" \".join(list(map(str, distance)))\n\nprint(output)\n", "import queue\r\n\r\nn = int(input())\r\nentry = list(map(int,input().split()))\r\n\r\nenergy = [-1] * n\r\n\r\nq = queue.Queue()\r\nq.put(0)\r\nenergy[0] = 0\r\nwhile not(q.empty()):\r\n v = q.get()\r\n for dl in range(-1, +2):\r\n u = v + dl\r\n if 0 <= u and u < n and energy[u] == -1:\r\n energy[u] = energy[v] + 1\r\n q.put(u)\r\n\r\n u = entry[v] - 1\r\n\r\n if energy[u] == -1:\r\n energy[u] = energy[v] + 1\r\n q.put(u)\r\n\r\noutput = \"\"\r\nfor i in range(0, n):\r\n output += str(energy[i]) + \" \"\r\n\r\nprint(output)", "n = int(input())\r\na = [ int(i)-1 for i in input().split() ]\r\n \r\nm = [-1]*len(a)\r\n \r\n#print(m)\r\n \r\nscur = set()\r\nsnext = set()\r\n \r\nscur.add(0)\r\n \r\ndist = 0\r\nchanged = True\r\nwhile changed:\r\n\tchanged = False\r\n\tfor i in scur:\r\n\t\tif m[i] == -1 or m[i] > dist:\r\n\t\t\tm[i] = dist\r\n\t\t\tif i+1 < n:\r\n\t\t\t\tsnext.add(i+1)\r\n\t\t\tif i-1 >= 0:\r\n\t\t\t\tsnext.add(i-1)\r\n\t\t\tsnext.add(a[i])\r\n\t\t\tchanged = True\r\n\tscur = snext\r\n\tsnext = set()\r\n\tdist+=1\r\n \r\nfor i in m:\r\n\tprint(i,end=' ')\r\nprint()", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\ndistancia = [-1] * n\r\ndistancia[0] = 0\r\nposicao = [0]\r\n\r\nfor i in posicao:\r\n\r\n for j in [i - 1, i + 1, a[i] - 1]:\r\n\r\n if j >= 0 and j < n and distancia[j] == -1:\r\n distancia[j] = distancia[i] + 1\r\n posicao.append(j)\r\n\r\nprint(*distancia)", "import queue\r\n\r\nn = int(input())\r\ncruzamentos = list(map(int, input().split()))\r\nenergia = []\r\n\r\nfor i in range(0, n):\r\n energia.append(-1)\r\n\r\naux = queue.Queue()\r\naux.put(0)\r\nenergia[0] = 0\r\n\r\nwhile not(aux.empty()):\r\n v = aux.get()\r\n\r\n for i in range(-1, +2):\r\n u = v + i\r\n \r\n if 0 <= u and u < n and energia[u] == -1:\r\n energia[u] = energia[v] + 1\r\n aux.put(u)\r\n \r\n u = cruzamentos[v] - 1\r\n \r\n if energia[u] == -1:\r\n energia[u] = energia[v] + 1\r\n aux.put(u)\r\n\r\nprint(' '.join(list(map(str, energia))))", "num = int(input())\r\na = list(map(int, input().split()))\r\nlista, prox = [num] * (num + 1), [0]\r\nlista[0] = lista[num] = 0\r\nfor t in range(1, num):\r\n cur, prox = prox, []\r\n for i in cur:\r\n for j in i - 1, i + 1, a[i] - 1:\r\n if lista[j] > t:\r\n lista[j] = t\r\n prox.append(j)\r\n if not prox:\r\n break\r\ndel lista[num]\r\nprint(' '.join(map(str, lista)))", "n=int(input())\nl=list(map(int, input().split(' ')))\n\nout=[-1]*n\n\npas = 0\npos = [0]\nout[0]=0\n\nwhile pos :\n pas+=1\n new_pos=[]\n for p in pos :\n for q in [p-1,p+1,l[p]-1] :\n if q>=0 and q<n and out[q]==-1:\n out[q]=pas\n new_pos.append(q)\n pos = new_pos\n\nprint(*out)\n", "from collections import deque\r\n\r\nintersections = int(input())\r\nshortcuts = [0] + list(map(int, input().split()))\r\ncosts = [float('inf')] * (intersections + 1)\r\ncosts[1] = 0\r\nqueue = deque([1])\r\n\r\nwhile queue:\r\n t = queue.popleft()\r\n\r\n if t + 1 <= intersections and costs[t] + 1 < costs[t + 1]:\r\n costs[t + 1] = costs[t] + 1\r\n queue.append(t + 1)\r\n\r\n if t - 1 >= 1 and costs[t] + 1 < costs[t - 1]:\r\n costs[t - 1] = costs[t] + 1\r\n queue.append(t - 1)\r\n\r\n if costs[t] + 1 < costs[shortcuts[t]]:\r\n costs[shortcuts[t]] = costs[t] + 1\r\n queue.append(shortcuts[t])\r\n\r\nprint(' '.join(str(i) for i in costs[1:]))\r\n", "# -*- coding: utf-8 -*-\n\nimport queue\n\nn = int(input())\nshortcuts = list(map(int, input().split()))\n\ndistances = [-1] * n\nvisited = [False] * n\nqueue = queue.Queue()\n\nqueue.put(0)\ndistances[0] = 0\nwhile not(queue.empty()):\n vertex = queue.get()\n for j in range(-1, 2):\n v = vertex + j\n if (0 <= v and v < n and distances[v] == -1):\n distances[v] = distances[vertex] + 1\n queue.put(v)\n\n v = shortcuts[vertex] - 1\n\n if distances[v] == -1:\n distances[v] = distances[vertex] + 1\n queue.put(v)\n\nprint(' '.join(map(str, distances)))\n", "def bfs():\n while len(queue)>0:\n current=queue.pop(0)\n if current<n and dis[current+1]>dis[current]+1:\n dis[current+1]=dis[current]+1\n queue.append(current+1)\n if current>1 and dis[current-1]>dis[current]+1:\n dis[current-1]=dis[current]+1\n queue.append(current-1)\n if dis[shortlist[current]]>dis[current]+1:\n dis[shortlist[current]]=dis[current]+1\n queue.append(shortlist[current])\n\nn=int(input())\ninput2=input().split()\nshortlist=[0]+[int(x) for x in input2]\ndis=[float('inf') for x in range(n+1)]\ndis[1]=0\nqueue=[1]\nbfs()\n\nprint(' '.join(str(i) for i in dis[1:]))\n\n \t\t \t\t \t \t\t\t\t \t \t\t\t", "\r\nn = a = None\r\n\r\ndef entrypoint():\r\n global n, a\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\ndef process():\r\n for i in range(n):\r\n a[i] -= 1\r\n if a[i] <= i + 1: a[i] = None\r\n \r\n m = [-1] * n\r\n m[0] = 0\r\n current = [0]\r\n val_next = []\r\n while True:\r\n if current:\r\n for i in current:\r\n x = m[i] + 1\r\n if a[i] and m[a[i]] == -1:\r\n m[a[i]] = x\r\n val_next.append(a[i])\r\n if i != 0 and m[i - 1] == -1:\r\n m[i - 1] = x\r\n val_next.append(i - 1)\r\n if i != n - 1 and m[i + 1] == -1:\r\n m[i + 1] = x\r\n val_next.append(i + 1)\r\n current = val_next\r\n val_next = []\r\n else: break\r\n \r\n print(' '.join(map(str, m)))\r\n\r\ndef main():\r\n entrypoint()\r\n process()\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\nAis = list(map(int,input().split()))\n \nMis = [0] + [-1]*(n-1)\npos = [0]\n \nfor i in pos:\n a = i - 1\n b = i + 1\n c = Ais[i] - 1\n for j in [a, b, c]:\n if j >= 0 and j < n and Mis[j] == -1:\n Mis[j] = Mis[i] + 1\n pos.append(j)\n \nprint(\" \".join(map(str, Mis)))\n", "from sys import stdin, stdout, stderr\r\nimport queue\r\n \r\ndef main():\r\n\tn = int(stdin.readline())\r\n\ta = list(map(int, stdin.readline().split()))\r\n\td = [10000000 for i in range(n)]\r\n\tg = [[i - 1, i + 1] for i in range(n)]\r\n\tg[0] = [1]\r\n\tg[n - 1] = [n - 2]\r\n\td[0] = 0\r\n\tfor i in range(n):\r\n\t\tif (a[i] == i + 1):\r\n\t\t\tcontinue\r\n\t\tg[i].append(a[i] - 1)\r\n \r\n\tq = queue.Queue()\r\n \r\n\tq.put_nowait(0)\r\n \r\n\twhile (not q.empty()):\r\n\t\tx = q.get_nowait()\r\n\t\tfor to in g[x]:\r\n\t\t\tif (d[x] + 1 < d[to]):\r\n\t\t\t\td[to] = d[x] + 1\r\n\t\t\t\tq.put_nowait(to)\r\n \r\n\tfor x in d:\r\n\t\tstdout.write(str(x) + ' ')\r\n \r\n \r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\ndp = [0] + [n] * n + [0]\r\na = tuple(map(int, input().split()))\r\ns = [1]\r\ndp[1] = 0\r\nwhile s:\r\n ns = []\r\n for v in s:\r\n if dp[v - 1] == n:\r\n ns.append(v - 1)\r\n dp[v - 1] = min(dp[v - 1], dp[v] + 1)\r\n if dp[v + 1] == n:\r\n ns.append(v + 1)\r\n dp[v + 1] = min(dp[v + 1], dp[v] + 1)\r\n if dp[a[v - 1]] == n:\r\n ns.append(a[v - 1])\r\n dp[a[v - 1]] = min(dp[a[v - 1]], dp[v] + 1)\r\n s = ns\r\nprint(' '.join(map(str, dp[1:-1])))\r\n", "n = int(input())\na = list(map(lambda x: int(x) - 1,input().split()))\n\ncnt = 0\ncurr = [0]\nv = [0 for _ in range(n)]\nr = [0 for _ in range(n)]\n\nlvl = 0\nwhile cnt < n:\n nxt = []\n for i in curr:\n if v[i]:\n continue\n v[i] = 1\n r[i] = lvl\n cnt += 1\n if i > 0 and not v[i-1]:\n nxt.append(i - 1)\n if i < n - 1 and not v[i+1]:\n nxt.append(i + 1)\n if not v[a[i]]:\n nxt.append(a[i])\n curr = nxt\n lvl += 1\nprint(' '.join(map(str,r)))\n", "from queue import Queue\r\n\r\nn = int(input())\r\na = input().split()\r\n\r\nused = []\r\nd = []\r\n\r\nfor i in range(0, n):\r\n used.append(False)\r\n d.append(-1)\r\n\r\nq = Queue(0)\r\nq.put(0)\r\nd[0] = 0\r\n\r\nwhile not(q.empty()):\r\n v = q.get()\r\n for dl in range(-1, +2):\r\n u = v + dl\r\n if 0 <= u and u < n and d[u] == -1:\r\n d[u] = d[v] + 1\r\n q.put(u)\r\n u = int(a[v]) - 1\r\n if d[u] == -1:\r\n d[u] = d[v] + 1\r\n q.put(u)\r\n\r\nfor i in range(0, n - 1):\r\n print(d[i], end=' ')\r\n\r\nprint(d[n-1])", "n = int(input())\r\nshortest_path = list(map(int,input().split()))\r\nshortest_path = [shortest_path[i]-1 for i in range(n)]\r\nresult = [-1] * n\r\nresult[0] = 0\r\ni = 0\r\naux = [0]\r\nwhile i < len(aux):\r\n temp = aux[i]\r\n i += 1\r\n if result[shortest_path[temp]] == -1:\r\n result[shortest_path[temp]] = result[temp] + 1\r\n aux.append(shortest_path[temp])\r\n if temp < n-1 and result[temp + 1] == -1:\r\n result[temp + 1] = result[temp] + 1\r\n aux.append(temp + 1) \r\n if temp > 0 and result[temp - 1] == -1:\r\n result[temp - 1] = result[temp] + 1\r\n aux.append(temp - 1)\r\n \r\nprint(*result)", "from collections import *\r\n \r\nn = int(input())\r\na = [val - 1 for val in list(map(int, input().split()))]\r\nqueue = deque([(0, 0)])\r\nans = [-1] * n\r\nwhile len(queue) > 0:\r\n cur = queue.popleft()\r\n if cur[0] < 0 or cur[0] >= n or ans[cur[0]] != -1: continue\r\n ans[cur[0]] = cur[1]\r\n queue.append((cur[0] - 1, cur[1] + 1))\r\n queue.append((cur[0] + 1, cur[1] + 1))\r\n queue.append((a[cur[0]], cur[1] + 1))\r\nprint(\" \".join(map(str, ans)))", "from collections import defaultdict\r\nfrom heapq import heappush, heappop\r\n\r\n\r\ndef dijkstra(num_vert, graph):\r\n dist = [9999999999] * num_vert\r\n dist[0] = 0\r\n h = [0]\r\n heappush(h, 0)\r\n\r\n while h:\r\n v = heappop(h)\r\n for e in graph[v]:\r\n if dist[e] > dist[v] + 1:\r\n dist[e] = dist[v] + 1\r\n heappush(h, e)\r\n\r\n print(' '.join([str(int) for int in dist]))\r\n\r\nn = int(input())\r\nshortcuts = list(map(int, input().split()))\r\n\r\ngraph = defaultdict(set)\r\n\r\nfor i in range(n):\r\n if i != 0:\r\n graph[i].add(i - 1)\r\n if i < n - 1:\r\n graph[i].add(i + 1)\r\n if (shortcuts[i] - 1 != i):\r\n graph[i].add(shortcuts[i] - 1)\r\n\r\n\r\ndijkstra(n, graph)\r\n", "num = int(input())\r\n\r\nshortcuts = list(map(int, input().split()))\r\n \r\nshortcuts = [(shortcut - 1) for shortcut in shortcuts]\r\n\r\ncosts = [0] + ([-1] * (num - 1))\r\n \r\naux, queue = 0, [0]\r\nwhile (aux < len(queue)):\r\n intersection = queue[aux]\r\n shortcut = shortcuts[intersection]\r\n \r\n if costs[shortcut] == -1:\r\n costs[shortcut] = costs[intersection] + 1\r\n queue.append(shortcut)\r\n \r\n if intersection < (num - 1):\r\n if costs[intersection + 1] == -1:\r\n costs[intersection + 1] = costs[intersection] + 1\r\n queue.append(intersection + 1) \r\n \r\n if intersection > 0:\r\n if costs[intersection - 1] == -1:\r\n costs[intersection - 1] = costs[intersection] + 1\r\n queue.append(intersection - 1)\r\n \r\n aux += 1\r\n \r\nprint(' '.join(map(str, costs)))", "from queue import Queue\r\n\r\nn = int(input())\r\nshortcuts = list(map(int, input().split(' ')))\r\n\r\nd = [-1 for _ in range(0, n)]\r\n\r\nqueue = Queue()\r\nqueue.put(0)\r\nd[0] = 0\r\n\r\nwhile not queue.empty():\r\n v = queue.get()\r\n for dl in range(-1, 2):\r\n u = v + dl\r\n if 0 <= u and u < n and d[u] == -1:\r\n d[u] = d[v] + 1\r\n queue.put(u)\r\n u = shortcuts[v] - 1\r\n if d[u] == -1:\r\n d[u] = d[v] + 1\r\n queue.put(u)\r\n \r\nprint(' '.join(map(str, [d[i] for i in range(0, n)])))", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nd = [-1] * n\r\nd[0] = 0\r\np = [0]\r\n\r\nfor i in p:\r\n for j in [i - 1, i + 1, a[i] - 1]:\r\n if j >= 0 and j < n and d[j] == -1:\r\n d[j] = d[i] + 1\r\n p.append(j)\r\n\r\nprint(*d)", "n = int(input())\r\na = list(map(int,input().split()))\r\n \r\ndist = [-1] * n\r\ndist[0] = 0\r\npos = [0]\r\n \r\nfor u in pos:\r\n for v in [u - 1, u + 1, a[u] - 1]:\r\n if v >= 0 and v < n and dist[v] == -1:\r\n dist[v] = dist[u] + 1\r\n pos.append(v)\r\n \r\nprint(\" \".join(map(str, dist)))", "from cmath import inf\r\nfrom collections import deque\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = [0]+[int(x) for x in input().split()]\r\n\r\ng = [[] for _ in range(n+1)]\r\nfor i in range(1, n):\r\n g[i].append(i+1)\r\n g[i+1].append(i)\r\n \r\nfor i in range(1, n+1):\r\n g[i].append(a[i])\r\n\r\ndist = [inf]*(n+1)\r\ndist[1] = 0\r\n\r\nq = deque([1])\r\nwhile q:\r\n u = q.pop()\r\n for v in g[u]:\r\n if dist[v] > dist[u]+1:\r\n dist[v] = dist[u]+1\r\n q.append(v)\r\n\r\nprint(*dist[1:])\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nm = [-1] * n\nm[0] = 0\n\npos = [0]\n\nfor e in pos:\n for v in [e - 1, e + 1, a[e] - 1]:\n if v >= 0 and v < n and m[v] == -1:\n m[v] = m[e] + 1\n pos.append(v)\n\nprint(*m)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\ndef bfs():\r\n q = deque([0])\r\n dist = [-1]*n\r\n dist[0] = 0\r\n \r\n while q:\r\n v = q.popleft()\r\n \r\n for nv in G[v]:\r\n if dist[nv]==-1:\r\n dist[nv] = dist[v]+1\r\n q.append(nv)\r\n \r\n return dist\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nG = [[] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n if i+1<n:\r\n G[i].append(i+1)\r\n G[i+1].append(i)\r\n \r\n G[i].append(a[i]-1)\r\n\r\nprint(*bfs())", "import collections\nimport sys\n\nfrom typing import Tuple, List\n\n\ndef parse_input() -> Tuple[int, List[int]]:\n n = int(input())\n a = list(map(int, input().split()))\n return (n, a)\n\ndef calculate_dists(n: int, a: List[int]) -> List[int]:\n q = collections.deque()\n dist = [i for i in range(n)]\n not_visited = set(dist)\n q.appendleft(0)\n while q:\n k = q.pop()\n if k in not_visited:\n not_visited.remove(k)\n \n if dist[a[k] - 1] > dist[k] + 1:\n dist[a[k] - 1] = dist[k] + 1\n q.appendleft(a[k] - 1)\n \n if k > 0 and dist[k - 1] > dist[k] + 1:\n dist[k - 1] = dist[k] + 1\n q.appendleft(k - 1)\n \n if k + 1 < n and dist[k + 1] > dist[k] + 1:\n dist[k + 1] = dist[k] + 1\n q.appendleft(k + 1)\n \n if not_visited:\n q.append(not_visited.pop())\n \n return dist\n\nn, a = parse_input()\nprint(\" \".join(map(str, calculate_dists(n, a))))", "b = int(input())\r\nc = list(map(int, input().split()))\r\nc = [(c1 - 1) for c1 in c]\r\nd,i, fila = [0] + ([-1] * (b - 1)), 0, [0]\r\nwhile (i < len(fila)):\r\n a = fila[i]\r\n c1 = c[a]\r\n if d[c1] == -1:d[c1] = d[a] + 1;fila.append(c1)\r\n if a < (b - 1):\r\n if d[a + 1] == -1:d[a + 1] = d[a] + 1;fila.append(a + 1) \r\n if a > 0: \r\n if d[a - 1] == -1:d[a - 1] = d[a] + 1;fila.append(a - 1)\r\n i += 1\r\nprint(' '.join(map(str, d)))", "from collections import deque\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nd=[-1]*(n)\r\nq=deque()\r\nq.append(0)\r\nd[0]=0\r\nwhile q:\r\n node=q.popleft()\r\n for dl in range(-1,2):\r\n u=node+dl\r\n if 0<=u and u<n and d[u]==-1:\r\n d[u]=d[node]+1\r\n q.append(u)\r\n u=int(arr[node])-1\r\n if d[u]==-1:\r\n d[u]=d[node]+1\r\n q.append(u)\r\nprint(*d)\r\n \r\n", "n = int(input())\nener = [-1] * n\nener[0] = 0\naux = [0]\narray = list(map(int,input().split()))\nfor i in aux:\n for v in [i-1, i+1, array[i]-1]:\n if v >= 0 and v<n and ener[v]==-1:\n ener[v]=ener[i]+1\n aux.append(v)\nprint(*ener)", "def mike_shortcuts(queue,res):\r\n index = 0\r\n while index < len(queue):\r\n queue_element = queue[index]\r\n if res[entry[queue_element]] == -1:\r\n res[entry[queue_element]] = res[queue_element] + 1\r\n queue.append(entry[queue_element])\r\n if queue_element < n-1 and res[queue_element + 1] == -1:\r\n res[queue_element + 1] = res[queue_element] + 1\r\n queue.append(queue_element + 1) \r\n if queue_element > 0 and res[queue_element - 1] == -1:\r\n res[queue_element - 1] = res[queue_element] + 1\r\n queue.append(queue_element - 1)\r\n index += 1\r\n return res\r\n \r\nn = int(input())\r\nentry = [int(index) - 1 for index in input().split(' ')]\r\nres = mike_shortcuts([0],[0] + [-1] *(n - 1))\r\nprint(' '.join(str(x) for x in res))\r\n\r\n", "import collections\n\n\ndef GetMinimumEnergySpent(n, shortcuts):\n \"\"\"Allows to get the list of minimum energy spent.\n Input:\n n: int. Number of intersections.\n shortcuts: List[int]. List of all the shortcuts from idx to shortcuts[idx].\n Returns:\n List of the minimum energy spent to go from 1 to idx + 1.\n \"\"\"\n energy_spent = [i for i in range(n)]\n queue = collections.deque(energy_spent)\n\n while len(queue) > 0:\n idx = queue.popleft()\n if idx < n - 1 and energy_spent[idx + 1] > energy_spent[idx] + 1:\n energy_spent[idx + 1] = energy_spent[idx] + 1\n queue.append(idx + 1)\n if idx > 0 and energy_spent[idx - 1] > energy_spent[idx] + 1:\n energy_spent[idx - 1] = energy_spent[idx] + 1\n queue.append(idx - 1)\n if energy_spent[idx] + 1 < energy_spent[shortcuts[idx]]:\n energy_spent[shortcuts[idx]] = energy_spent[idx] + 1\n queue.append(shortcuts[idx])\n\n return energy_spent\n\n\nif __name__ == \"__main__\":\n n = int(input())\n shortcuts = [int(k) - 1 for k in input().split()]\n energy_spent_str = [str(k) for k in GetMinimumEnergySpent(n, shortcuts)]\n print(' '.join(energy_spent_str))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\ndistance = [-1] * n\r\ndistance[0] = 0\r\nposition = [0]\r\n \r\nfor i in position:\r\n for j in [i - 1, i + 1, a[i] - 1]:\r\n if j >= 0 and j < n and distance[j] == -1:\r\n distance[j] = distance[i] + 1\r\n position.append(j)\r\n \r\nprint(*distance)\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\narray = [(q - 1) for q in array]\r\n\r\ndist = [0] + ([-1] * (n - 1))\r\n \r\ni = 0\r\nfila = [0]\r\nwhile i < len(fila):\r\n k = fila[i]\r\n q = array[k]\r\n \r\n if dist[q] == -1:\r\n dist[q] = dist[k] + 1\r\n fila.append(q)\r\n if k < (n - 1) and dist[k + 1] == -1:\r\n dist[k + 1] = dist[k] + 1\r\n fila.append(k + 1) \r\n if k > 0 and dist[k - 1] == -1:\r\n dist[k - 1] = dist[k] + 1\r\n fila.append(k - 1)\r\n i += 1\r\n \r\nprint(' '.join(str(e) for e in dist))", "intersections_number = int(input())\nshortcuts = list(map(int, input().split()))\n \nshortcuts = [(shortcut - 1) for shortcut in shortcuts] # to start in 0\ndistances = [0] + ([-1] * (intersections_number - 1)) # the distance for root is 0\n \ni = 0\nqueue = [0] #[2, 7]\nwhile (i < len(queue)):\n ith_intersection = queue[i]\n shortcut = shortcuts[ith_intersection]\n \n if distances[shortcut] == -1:\n distances[shortcut] = distances[ith_intersection] + 1\n queue.append(shortcut)\n \n if ith_intersection < (intersections_number - 1):\n if distances[ith_intersection + 1] == -1:\n distances[ith_intersection + 1] = distances[ith_intersection] + 1\n queue.append(ith_intersection + 1) \n \n if ith_intersection > 0:\n if distances[ith_intersection - 1] == -1:\n distances[ith_intersection - 1] = distances[ith_intersection] + 1\n queue.append(ith_intersection - 1)\n i += 1\n \nprint(' '.join(map(str, distances)))", "n = int(input())\r\nsc = list(map(int, input().split()))\r\n\r\nsc = [(shortcut - 1) for shortcut in sc]\r\ndist = [0] + ([-1] * (n - 1))\r\n\r\ni = 0\r\nqueue = [0]\r\nwhile i < len(queue):\r\n inter = queue[i]\r\n shortcut = sc[inter]\r\n\r\n if inter < (n - 1):\r\n if dist[inter + 1] == -1:\r\n dist[inter + 1] = dist[inter] + 1\r\n queue.append(inter + 1)\r\n if inter > 0:\r\n if dist[inter - 1] == -1:\r\n dist[inter - 1] = dist[inter] + 1\r\n queue.append(inter - 1)\r\n if dist[shortcut] == -1:\r\n dist[shortcut] = dist[inter] + 1\r\n queue.append(shortcut)\r\n\r\n i += 1\r\n\r\nprint(*dist)\r\n", "n_intersections = int(input())\r\nshortcuts = list(map(int, input().split()))\r\n \r\nshortcuts = [(shortcut - 1) for shortcut in shortcuts]\r\ncosts = [0] + ([-1] * (n_intersections - 1))\r\n \r\ni, queue = 0, [0]\r\nwhile (i < len(queue)):\r\n intersection = queue[i]\r\n shortcut = shortcuts[intersection]\r\n \r\n if costs[shortcut] == -1:\r\n costs[shortcut] = costs[intersection] + 1\r\n queue.append(shortcut)\r\n \r\n if intersection < (n_intersections - 1):\r\n if costs[intersection + 1] == -1:\r\n costs[intersection + 1] = costs[intersection] + 1\r\n queue.append(intersection + 1) \r\n \r\n if intersection > 0:\r\n if costs[intersection - 1] == -1:\r\n costs[intersection - 1] = costs[intersection] + 1\r\n queue.append(intersection - 1)\r\n \r\n i += 1\r\n \r\nprint(' '.join(map(str, costs)))", "n = int(input())\r\na = list(map(int,input().split()))\r\n \r\noutput = n * [-1]\r\noutput[0] = 0\r\nlocal = [0]\r\n \r\nfor i in local:\r\n for j in [i - 1, i + 1, a[i] - 1]:\r\n if j < n and j >= 0:\r\n if output[j] == -1:\r\n output[j] = output[i] + 1\r\n local.append(j)\r\n \r\nprint(\" \".join(map(str, output)))", "import queue\r\n\r\ndimension = 2000000\r\nmaxValue = 1e20\r\n\r\nnum_intersections = int(input())\r\n\r\nshortcuts = ([0] + list(map(int, input().split()))) + [maxValue] * dimension\r\namount_energy = [maxValue] * dimension\r\n\r\nq = queue.Queue()\r\namount_energy[1] = 0\r\nq.put(1)\r\n\r\nwhile(q.qsize()):\r\n k = q.get()\r\n if (k != num_intersections and amount_energy[k + 1] > amount_energy[k] + 1):\r\n amount_energy[k + 1] = amount_energy[k] + 1\r\n q.put(k + 1)\r\n\r\n if (k != 1 and amount_energy[k - 1] > amount_energy[k] + 1):\r\n amount_energy[k - 1] = amount_energy[k] + 1\r\n q.put(k - 1)\r\n\r\n if (amount_energy[shortcuts[k]] > amount_energy[k] + 1):\r\n amount_energy[shortcuts[k]] = amount_energy[k] + 1\r\n q.put(shortcuts[k])\r\n\r\n\r\nfor i in range(1, num_intersections + 1):\r\n print(amount_energy[i], end=' ')\r\n", "import sys\r\ninput = sys.stdin.readline \r\nfrom math import inf\r\n\r\nn = int(input()) \r\na = list(map(int, input().split())) \r\nd = [-1] * (n) \r\nd[0] = 0\r\nq = [0]\r\nwhile(q):\r\n u = q.pop(0)\r\n for dl in range(-1, 2):\r\n v = u + dl \r\n if(0 <= v < n and d[v] == -1):\r\n d[v] = d[u] + 1 \r\n q.append(v) \r\n v = a[u] - 1 \r\n if(d[v] == -1):\r\n d[v] = d[u] + 1 \r\n q.append(v) \r\nprint(*d)", "n = int(input())\ndp = [0] + [n] * n + [0]\na = tuple(map(int, input().split()))\ns = [1]\ndp[1] = 0\nwhile s:\n ns = []\n for v in s:\n if dp[v - 1] == n:\n ns.append(v - 1)\n dp[v - 1] = min(dp[v - 1], dp[v] + 1)\n if dp[v + 1] == n:\n ns.append(v + 1)\n dp[v + 1] = min(dp[v + 1], dp[v] + 1)\n if dp[a[v - 1]] == n:\n ns.append(a[v - 1])\n dp[a[v - 1]] = min(dp[a[v - 1]], dp[v] + 1)\n s = ns\nprint(' '.join(map(str, dp[1:-1])))\n", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom 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\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\n\r\nn, = gil()\r\nadj = [[] for _ in range(n+1)]\r\n\r\nfor start, end in zip(range(1, n+1), gil()):\r\n if end > start + 1:adj[start].append(end)\r\n\r\nfor start in range(1, n+1):\r\n if start + 1 <= n:adj[start].append(start+1)\r\n if start - 1 : adj[start].append(start-1)\r\n\r\n# print(adj)\r\n\r\nd = [inf]*(n+1)\r\nd[1] = 0\r\n\r\nh = [(0, 1)]\r\n\r\nwhile h:\r\n dist, node = heappop(h)\r\n if dist != d[node] : continue\r\n for c in adj[node]:\r\n if d[c] > dist + 1:\r\n d[c] = dist+1\r\n heappush(h, (d[c], c))\r\n\r\nprint(*d[1:])\r\n", "n = int(input())\r\ndata = list(map(int,input().split()))\r\nq = [0]\r\ndis = [0] * n\r\nfor i in q:\r\n for j in {i - 1,i + 1,data[i] - 1}:\r\n if j >= 0 and j < n and dis[j] == 0 and j != i:\r\n dis[j] = dis[i] + 1\r\n q.append(j)\r\ndis[0] = 0 \r\nprint(*dis)", "\r\nnum_intersecoes = int(input())\r\natalhos = list(map(int, input().split()))\r\n\r\natalhos = [(atalho - 1) for atalho in atalhos]\r\ncustos = [0] + ([-1] * (num_intersecoes - 1))\r\n\r\naux, fila = 0, [0]\r\nwhile (aux < len(fila)):\r\n intersecao = fila[aux]\r\n atalho = atalhos[intersecao]\r\n\r\n if custos[atalho] == -1:\r\n custos[atalho] = custos[intersecao] + 1\r\n fila.append(atalho)\r\n\r\n if intersecao < (num_intersecoes - 1):\r\n if custos[intersecao + 1] == -1:\r\n custos[intersecao + 1] = custos[intersecao] + 1\r\n fila.append(intersecao + 1) \r\n\r\n if intersecao > 0:\r\n if custos[intersecao - 1] == -1:\r\n custos[intersecao - 1] = custos[intersecao] + 1\r\n fila.append(intersecao - 1)\r\n\r\n aux += 1\r\n\r\nprint(' '.join(map(str, custos)))", "from queue import Queue\n \nn = int(input())\na = [int(e) for e in input().split()]\n \naux1 = []\nend = []\n \nfor i in range(0, n):\n aux1.append(False)\n end.append(-1)\n \nqueue = Queue()\nqueue.put(0)\nend[0] = 0\n \nwhile not(queue.empty()):\n k = queue.get()\n \n for e in range(-1, 2):\n resposta = k + e\n if 0 <= resposta and resposta < n and end[resposta] == -1:\n end[resposta] = end[k] + 1\n queue.put(resposta)\n \n resposta = a[k] - 1\n if end[resposta] == -1:\n end[resposta] = end[k] + 1\n queue.put(resposta)\n\nprint(*end)", "def bfs():\r\n while len(fila) > 0:\r\n atual = fila.pop(0)\r\n\r\n if atual < n and e[atual + 1] > e[atual] + 1:\r\n e[atual+1]=e[atual]+1\r\n\r\n fila.append(atual + 1)\r\n\r\n if atual > 1 and e[atual - 1] > e[atual]+1:\r\n e[atual - 1] = e[atual] + 1\r\n fila.append(atual - 1)\r\n \r\n if e[ cruzamentos[atual] ] > e[atual] + 1:\r\n e[cruzamentos[atual]] = e[atual]+1\r\n \r\n fila.append(cruzamentos[atual])\r\n \r\nn = int(input())\r\nentrada = input().split()\r\ncruzamentos = [0] + [int(x) for x in entrada]\r\ne = [float('inf') for x in range( n + 1 )]\r\ne[1] = 0\r\nfila=[1]\r\nbfs()\r\n \r\nprint(' '.join(str(i) for i in e[1:]))", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i] -= 1\r\n if a[i] <= i + 1:\r\n a[i] = None\r\n \r\nm = [-1] * n\r\nm[0] = 0\r\nnow = [0]\r\nnext = []\r\nwhile True:\r\n if not now:\r\n break\r\n for i in now:\r\n x = m[i] + 1\r\n if a[i] and m[a[i]] == -1:\r\n m[a[i]] = x\r\n next.append(a[i])\r\n if i != 0 and m[i - 1] == -1:\r\n m[i - 1] = x\r\n next.append(i - 1)\r\n if i != n - 1 and m[i + 1] == -1:\r\n m[i + 1] = x\r\n next.append(i + 1)\r\n now = next\r\n next = []\r\n \r\nprint(' '.join(map(str, m)))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef bfs(s):\r\n q = [s]\r\n dist = [inf] * (n + 1)\r\n dist[s] = 0\r\n for k in range(n):\r\n i = q[k]\r\n di = dist[i]\r\n for j in G[i]:\r\n if dist[j] == inf:\r\n dist[j] = di + 1\r\n q.append(j)\r\n return dist\r\n\r\nn = int(input())\r\na = [0] + list(map(int, input().split()))\r\nG = [[] for _ in range(n + 1)]\r\nfor i in range(1, n):\r\n G[i].append(i + 1)\r\n G[i + 1].append(i)\r\nfor i in range(1, n + 1):\r\n G[i].append(a[i])\r\ninf = pow(10, 9) + 1\r\ndist = bfs(1)\r\nans = dist[1:]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n \r\nlis = [-1] * n\r\nlis[0] = 0\r\n \r\np = [0]\r\n \r\nfor i in p:\r\n\tfor j in [i - 1, i + 1, a[i] - 1]:\r\n\t\tif j >= 0 and j < n and lis[j] == -1:\r\n\t\t\t#print(j, i, lis[i])\r\n\t\t\tlis[j] = lis[i] + 1\r\n\t\t\tp.append(j)\r\n \r\nprint(*lis)", "n = int(input())\na = list(map(int,input().split()))\nres = [0] + [-1] * (n-1)\nidx = [0]\nfor u in idx:\n for v in [u-1, u+1, a[u]-1]:\n if v >= 0 and v < n and res[v] == -1:\n res[v] = res[u] + 1\n idx.append(v)\nprint(*res)", "n = int(input())\np = [int(i)-1 for i in input().split()]\n\nm = {0: 0}\n\nto_explore = {1, p[0]}\nto_explore = {i for i in to_explore if (0<= i < n) and (i not in m)}\n\ncur_dist = 0\n\n# remaining = {i for i in range(2, n+1)}\n\nwhile to_explore != set():\n cur_dist += 1\n to_explore_next = set()\n for city in to_explore:\n m[city] = cur_dist\n # remaining.remove(city)\n to_explore_next.add(city+1)\n to_explore_next.add(city-1)\n to_explore_next.add(p[city])\n \n to_explore = to_explore_next\n to_explore = {i for i in to_explore if (0<= i < n) and (i not in m)}\n\nassert len(m) == n\nprint(' '.join(str(m[i]) for i in range(n)))\n\n", "n = int(input())\r\ns = [0] + list(map(int, input().split()))\r\nans = [0,0] + [None]*(n-1)\r\n \r\ndef bfs():\r\n path = [(s[1],1),(2,1)]\r\n while path:\r\n nom, pre = path.pop(0)\r\n if ans[nom] != None:\r\n continue\r\n ans[nom] = pre\r\n path.append((s[nom], pre+1))\r\n if nom<n:\r\n path.append((nom+1, pre+1))\r\n if nom>2:\r\n path.append((nom-1, pre+1))\r\n \r\nbfs()\r\n \r\nfor j in range(1,n+1):\r\n print(ans[j], end=' ')", "def solucao(n, arr, aux, queue):\r\n while (not queue == []):\r\n curr = queue[0]\r\n queue.pop(0) \r\n prev = curr - 1\r\n next = curr + 1\r\n path = arr[curr]\r\n cand = 1 + aux[curr]\r\n\r\n if ((prev >= 1) and ((aux[prev] < 0) or (aux[prev] > cand))):\r\n aux[prev] = cand\r\n queue.append(prev)\r\n if ((next <= n) and ((aux[next] < 0) or (aux[next] > cand))):\r\n aux[next] = cand\r\n queue.append(next)\r\n if ((aux[path] < 0) or (aux[path] > cand)):\r\n aux[path] = cand\r\n queue.append(path)\r\n\r\n aux.pop(0)\r\n for e in aux:\r\n print(e, end=\" \")\r\n\r\nn = int(input())\r\n\r\narr = [0] + [int(e) for e in input().split(\" \")]\r\n\r\naux = [-1 for _ in range(n+1)]\r\naux[1] = 0\r\n\r\nqueue = [1]\r\n\r\nsolucao(n, arr, aux, queue)", "n = int(input())\r\na = list(map(int,input().split()))\r\nresult = [0] + [-1] * (n-1)\r\nindex = [0]\r\nfor u in index:\r\n for v in [u-1, u+1, a[u]-1]:\r\n if v >= 0 and v < n and result[v] == -1:\r\n result[v] = result[u] + 1\r\n index.append(v)\r\nprint(*result)", "n = int(input())\r\nshortCut = [int(x) for x in input().split()]\r\nans = [0] * n\r\n \r\ndef bfs(src):\r\n usd = [0] * n\r\n fila = [(src,0)]\r\n while bool(fila):\r\n node = fila.pop(0)\r\n x = node[0]\r\n if usd[x] == 0:\r\n num = node[1]\r\n ans[x] = num\r\n usd[x] = 1\r\n \r\n sc = shortCut[x] - 1\r\n if usd[sc] == 0:\r\n fila.append((sc,num+1))\r\n \r\n if x > 0:\r\n if usd[x-1] == 0: \r\n fila.append((x-1,num+1))\r\n \r\n if x < n - 1:\r\n if usd[x+1] == 0: \r\n fila.append((x+1,num+1)) \r\n\t\t\t\t\t\r\nbfs(0)\r\nprint(\" \".join([str(x) for x in ans]))", "n = int(input())\r\narr = list(map(int, input().split()))\r\n \r\narr = [(q - 1) for q in arr]\r\ndist = [0] + ([-1] * (n - 1))\r\n \r\ni = 0\r\nqueue = [0]\r\nwhile i < len(queue):\r\n k = queue[i]\r\n q = arr[k]\r\n \r\n if dist[q] == -1:\r\n dist[q] = dist[k] + 1\r\n queue.append(q)\r\n if k < (n - 1) and dist[k + 1] == -1:\r\n dist[k + 1] = dist[k] + 1\r\n queue.append(k + 1) \r\n if k > 0 and dist[k - 1] == -1:\r\n dist[k - 1] = dist[k] + 1\r\n queue.append(k - 1)\r\n i += 1\r\n \r\nprint(' '.join(str(e) for e in dist))" ]

[ "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\ndef solve(d):\r\n if len(d)==0:\r\n return []\r\n if len(d)==1:\r\n edge=[]\r\n m=d[0]\r\n for i in range(1,m+2):\r\n for j in range(i+1,m+2):\r\n edge.append((i,j))\r\n return edge\r\n \r\n e=[]\r\n m=len(d)\r\n d0=d[0]\r\n for i in range(1,m-1):\r\n e.append(d[i]-d0)\r\n edge=solve(e)\r\n s=d[-1]+1\r\n for i in range(s-d0+1,s+1):\r\n for j in range(1,s+1):\r\n if i>j:\r\n edge.append((i,j))\r\n return edge\r\n\r\nans=solve(a)\r\nprint(len(ans))\r\nfor x,y in ans:\r\n print(x,y)", "# python3\n\n\ndef readline(): return list(map(int, input().split()))\n\n\ndef solve(d):\n while d:\n dn = d.pop()\n if not d:\n for i in range(1, dn + 1):\n for j in range(i, dn + 1):\n yield i, j + 1\n return\n else:\n d1 = d.pop(0)\n for i in range(1, dn + 1):\n for j in range(max(dn - d1 + 1, i), dn + 1):\n yield i, j + 1\n\n d = [di - d1 for di in d]\n\n\ndef main():\n n, = readline()\n d = readline()\n\n assert len(d) == n\n\n edges = list(solve(d))\n print(len(edges))\n print(\"\\n\".join(map(\"{0[0]} {0[1]}\".format, edges)))\n\n\nmain()\n", "from sys import stdin\r\nfrom sys import stdout\r\n\r\nn = int(stdin.readline())\r\nd = [0] + list(map(int, stdin.readline().split()))\r\ne = []\r\nfor i in range(1, n+1):\r\n\tfor u in range(d[i-1]+1, d[i]+1):\r\n\t\tfor v in range(u+1, d[n-i+1]+2):\r\n\t\t\te.append([u,v])\r\nstdout.write(\"{}\\n\".format(len(e)))\r\nfor ei in e: stdout.write(\"{} {}\\n\".format(ei[0], ei[1]))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nd = list(map(int, input().split()))\r\nans = []\r\nl = 1\r\nwhile len(d):\r\n d0 = d[0]\r\n m = l + d0\r\n r = l + d[-1] + 1\r\n for u in range(l, m):\r\n for v in range(u + 1, r):\r\n ans.append(\" \".join(map(str, (u, v))))\r\n d = d[1:-1]\r\n for i in range(len(d)):\r\n d[i] -= d0\r\n l += d0\r\nm = len(ans)\r\nprint(m)\r\nsys.stdout.write(\"\\n\".join(ans))", "import sys\r\nline=lambda:sys.stdin.buffer.readline()\r\nn=int(line())\r\nd=[0]+list(map(int,line().split()))\r\ns=[]\r\nfor i in range(1,n+1):\r\n\tfor u in range(d[i-1]+1,d[i]+1):\r\n\t\tfor v in range(u+1,d[n-i+1]+2):\r\n\t\t\ts.append((u,v))\r\nprint(len(s))\r\nfor t in s: print(*t)", "import sys\r\nline=lambda:sys.stdin.buffer.readline()\r\nn=int(line())\r\nd=[0]+list(map(int,line().split()))\r\ns={}\r\nfor i in range(1,n+1):\r\n\tfor u in range(d[i],d[i-1],-1):\r\n\t\tfor v in range(d[n-i+1]+1,u,-1):\r\n\t\t\ts[(u,v)]=1\r\nprint(len(s))\r\nfor t in s: print(*t)" ]

[ "from sys import stdin\r\n\r\nn,k = [int(x) for x in stdin.readline().split()]\r\na = [int(x) for x in stdin.readline().split()]\r\n\r\nfour = n\r\ntwo = 2*n\r\none = 0\r\n\r\nfor i,x in enumerate(a):\r\n f = min(four,x//4)\r\n four -= f\r\n a[i] -= f*4\r\n\r\nif four:\r\n a.sort(reverse=True)\r\n v = True\r\n for x in a:\r\n if x == 3:\r\n if four:\r\n four -= 1\r\n elif two >= 2:\r\n two -= 2\r\n else:\r\n v = False\r\n break\r\n elif x == 2:\r\n if four:\r\n four -= 1\r\n one += 1\r\n elif two:\r\n two -= 1\r\n elif one >= 2:\r\n one -= 2\r\n else:\r\n v = False\r\n break\r\n elif x == 1:\r\n if four:\r\n four -= 1\r\n two += 1\r\n elif two:\r\n two -= 1\r\n elif one:\r\n one -= 1\r\n else:\r\n v = False\r\n break\r\n if v:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n for x in a:\r\n two -= x//2+x%2\r\n if two >= 0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nf=n\r\nt=2*n\r\nl=0\r\nfor i in range(k):\r\n while(a[i]>=4):\r\n a[i]-=4\r\n if(f>0):\r\n f-=1\r\n elif(t>=2):\r\n t-=2\r\n else:\r\n print('NO')\r\n exit()\r\nfor i in range(k):\r\n if(a[i]==3):\r\n a[i]=0\r\n if(f>0):\r\n f-=1\r\n elif(t>=2):\r\n t-=2\r\n else:\r\n print('NO')\r\n exit()\r\nfor i in range(k):\r\n if(a[i]==2):\r\n a[i]=0\r\n if(t>0):\r\n t-=1\r\n elif(f>0):\r\n f-=1\r\n l+=1\r\n elif(l>=2):\r\n l-=2\r\n else:\r\n print('NO')\r\n exit()\r\nl+=2*f+t\r\nif(sum(a)>l):\r\n print('NO')\r\nelse:\r\n print('YES')", "R=lambda:list(map(int,input().split()))\r\nn,k=R()\r\nt=4*n\r\ns=0\r\nfor i in R():\r\n s+=i+i%2\r\n n-=i%2\r\nprint('NO'if s>t+t or (s==t+t and k==t and n>0) else 'YES')", "numberOfRows, numberOfGroups = map(int, input().split())\r\noneSeat = 0\r\ntwoSeats = numberOfRows * 2\r\nfourSeats = numberOfRows\r\n\r\nliSoldiers = list(map(int, input().split()))\r\nliLeft = [0, 0, 0]\r\n\r\nblnOk = True\r\n\r\nliSoldiers.sort()\r\nliSoldiers.reverse()\r\n\r\nfor i in range(len(liSoldiers)):\r\n while liSoldiers[i]>=3 and blnOk:\r\n if fourSeats>0:\r\n liSoldiers[i] -= 4\r\n fourSeats -= 1\r\n elif twoSeats > 0:\r\n liSoldiers[i] -= 2\r\n twoSeats -= 1\r\n else:\r\n blnOk = false;\r\n\r\n if blnOk and liSoldiers[i] > 0:\r\n liLeft[liSoldiers[i]] += 1\r\n\r\nwhile liLeft[2]>0 and blnOk:\r\n if twoSeats>0:\r\n twoSeats -= 1\r\n elif fourSeats>0:\r\n fourSeats -= 1\r\n oneSeat += 1\r\n else:\r\n liLeft[1] += 2\r\n liLeft[2] -= 1\r\n\r\nif liLeft[1] > (oneSeat + twoSeats + fourSeats * 2):\r\n blnOk = False\r\n\r\nprint('YES' if blnOk else 'NO')\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfours,twos,ones=n,2*n,0\r\n# fill all the fours first\r\nfor i in range(k):\r\n\twhile(a[i]>=4):\r\n\t\ta[i]-=4\r\n\t\tif fours:fours-=1\r\n\t\telif twos>=2:twos-=2\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\t\t\texit()\r\n# any threes left?\r\nfor i in range(k):\r\n\tif a[i]==3:\r\n\t\ta[i]=0\r\n\t\tif fours:fours-=1\r\n\t\telif twos>=2:twos-=2\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\t\t\texit()\r\n# any twos left?\r\nfor i in range(k):\r\n\tif a[i]==2:\r\n\t\ta[i]=0\r\n\t\tif twos:twos-=1\r\n\t\telif fours:\r\n\t\t\tfours-=1\r\n\t\t\tones+=1\r\n\t\telif ones>=2:ones-=2\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\t\t\texit()\r\nones+=2*fours+twos\r\nif a.count(1)>ones:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')" ]

[ "n, m, k = map(int, input().split())\n\nlst = list(input().split())\nlsta = [[] for i in range(n)]\n\nfor i in range(m):\n li, ri = map(int, input().split())\n lsta[li - 1].append(ri - 1)\n lsta[ri - 1].append(li - 1)\nvisited = [False for i in range(n)]\nans = 0\n\nfor i in range(n):\n if visited[i]:\n continue\n s = [i]\n visited[i] = True\n qeue = {}\n \n while s:\n x = s.pop()\n if lst[x] not in qeue:\n qeue[lst[x]] = 0\n qeue[lst[x]] += 1\n\n for j in lsta[x]:\n if visited[j]:\n continue\n visited[j] = True\n s.append(j)\n \n neu, maxi = 0, 0\n for e in qeue:\n maxi = max(maxi, qeue[e])\n neu += qeue[e]\n ans += neu - maxi\n\nprint(ans)\n\n \t \t \t \t\t \t \t \t\t\t \t\t\t\t", "import collections\n\nn, m, k = map(int, input().split())\nc = list(map(int, input().split()))\ng = [set() for _ in range(n)]\nfor _ in range(m):\n l, r = map(int, input().split())\n l -= 1\n r -= 1\n g[l].add(r)\n g[r].add(l)\ntotal = 0\nvisited = [False] * n\ncounter = collections.Counter()\nfor i in range(n):\n if visited[i] or not g[i]:\n continue\n counter.clear()\n visited[i] = True\n stack = [i]\n while stack:\n i = stack.pop()\n counter[c[i]] += 1\n for j in g[i]:\n if not visited[j]:\n visited[j] = True\n stack.append(j)\n total += sum(sorted(counter.values())[:-1])\nprint(total)\n", "\n\nn, m, k = map(int, input().split())\nc = [int(x) - 1 for x in input().split()]\n\nadj = [[] for _ in range(n)]\nfor _ in range(m):\n l, r = map(int, input().split())\n adj[l - 1].append(r - 1)\n adj[r - 1].append(l - 1)\n\nvis = [0] * n\nans = 0\n\nfor i in range(n):\n if vis[i] == 1: \n continue\n\n arr, cur = [i], 0\n while cur < len(arr):\n v = arr[cur]\n vis[v] = 1\n cur += 1\n for nv in adj[v]:\n if vis[nv] == 0:\n arr.append(nv)\n vis[nv] = 1\n\n d = {}\n for v in arr:\n d[c[v]] = d.get(c[v], 0) + 1\n\n ans += len(arr) - max(d.values())\n\nprint(ans)\n \t\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 defaultdict,Counter\r\n\r\nN,M,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nP = [[] for _ in range(N)]\r\nfor _ in range(M):\r\n u,v = map(int, input().split())\r\n u-=1;v-=1\r\n P[u].append(v)\r\n P[v].append(u)\r\n\r\nseen = [-1]*N\r\n\r\ndef paint(idx,color):\r\n v = [idx]\r\n while v:\r\n i = v.pop()\r\n if seen[i]!=-1:continue\r\n seen[i]=color\r\n \r\n for j in P[i]:\r\n if seen[j]!=-1:continue\r\n v.append(j)\r\n\r\nc = 0\r\nfor i in range(N):\r\n if seen[i]==-1:\r\n c+=1\r\n paint(i,c)\r\n\r\nlib = defaultdict(list)\r\nfor i in range(N):\r\n lib[seen[i]].append(A[i])\r\n\r\nans = 0\r\nfor k,v in lib.items():\r\n C = Counter(v)\r\n t = max(C.values())\r\n ans+=len(v)-t\r\nprint(ans)\r\n \r\n \r\n \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\n# import sortedcontainers\r\nfrom typing import List\r\n\r\n\r\nn, m, k = map(int, input().split())\r\ntree = list(range(n))\r\n\r\n\r\ndef find(st):\r\n stack = [st]\r\n while stack[-1] != tree[stack[-1]]:\r\n stack.append(tree[stack[-1]])\r\n ans = stack[-1]\r\n while stack:\r\n tree[stack.pop()] = ans\r\n return ans\r\n\r\n\r\ndef connect(u, v):\r\n tree[find(u)] = find(v)\r\n\r\n\r\ncs = list(map(int, input().split()))\r\n\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n connect(l-1, r-1)\r\n\r\nd = collections.defaultdict(list)\r\n\r\nfor i in range(n):\r\n d[find(i)].append(cs[i])\r\nans = 0\r\nfor i in range(n):\r\n if d[i]:\r\n ans += len(d[i]) - max(collections.Counter(d[i]).values())\r\nprint(ans)\r\n", "from collections import defaultdict\r\nfrom collections import deque\r\n\r\ndef addEdge(u, v):\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\ndef dfs(u,visited):\r\n s = deque()\r\n component = []\r\n colors = {}\r\n s.append(u)\r\n maxOccur = 0\r\n predColor = 0\r\n while len(s) > 0:\r\n v = s.pop()\r\n color = C[v-1]\r\n if color not in colors:\r\n colors[color] = 1\r\n else:\r\n colors[color] += 1\r\n numOccur = colors[color]\r\n if numOccur > maxOccur:\r\n maxOccur = numOccur\r\n predColor = color\r\n component.append(v)\r\n visited[v] = True\r\n for neighbor in graph[v]:\r\n if not visited[neighbor]:\r\n s.append(neighbor)\r\n visited[neighbor] = True\r\n return component,predColor\r\n\r\ndef connectedComponents():\r\n visited = [False] * (n + 1)\r\n components = []\r\n for vertex in graph:\r\n if not visited[vertex]:\r\n component,predColor = dfs(vertex, visited) \r\n components.append((component,predColor))\r\n return components\r\n\r\nn,m,k = map(int,input().split())\r\nC = list(map(int,input().split()))\r\ngraph = defaultdict(list)\r\n\r\nfor _ in range(m):\r\n u,v = map(int,input().split())\r\n addEdge(u,v)\r\ncomponents = connectedComponents()\r\nnumPaintings = 0\r\nfor component in components:\r\n socks = component[0]\r\n predColor = component[1]\r\n for s in socks:\r\n color = C[s-1]\r\n if color != predColor:\r\n numPaintings += 1\r\nprint(numPaintings)" ]

[ "n = int(input())\r\ns = [0]*n\r\ng = [0]*n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n s[i] = a\r\n g[i] = a+b\r\n\r\nfor i in range(1,n):\r\n g[i] = min(g[i],g[i-1]+1)\r\nfor i in range(n-2,-1,-1):\r\n g[i] = min(g[i],g[i+1]+1)\r\n\r\nans = 0\r\nfor i in range(n):\r\n if s[i] <= g[i]:\r\n ans += g[i] - s[i]\r\n else:\r\n print(-1)\r\n break\r\n\r\nelse:\r\n print(ans)\r\n print(*g)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\n a[i][1]+=a[i][0]\r\nfor i in range(1,n):\r\n if a[i][1]>a[i-1][1]+1:\r\n a[i][1]=a[i-1][1]+1\r\n if a[i][1]<a[i][0]:exit(print(-1))\r\ns=a[-1][1]-a[-1][0]\r\nfor i in range(n-2,-1,-1):\r\n if a[i][1] > a[i + 1][1] + 1:\r\n a[i][1] = a[i + 1][1] + 1\r\n if a[i][1] < a[i][0]: exit(print(-1))\r\n s+=a[i][1]-a[i][0]\r\nprint(s)\r\nfor i in a:\r\n print(i[1],end=' ')\r\n", "n = int(input())\nss = [0] * (n + 1)\ngg = [0] * (n + 1)\n#mins = [0] * n\nmaxs = [0] * n\n\ncurMin = -10 ** 10\ncurMax = -curMin\n\nfor i in range(n):\n s, g = map(int, input().split(' '))\n ss[i] = s\n gg[i] = g\n\n curMin = max(curMin - 1, s)\n curMax = min(curMax + 1, s + g)\n if curMin > curMax:\n print(-1)\n exit(0)\n \n #mins[i] = curMin\n maxs[i] = curMax\n\nres = [0] * n\ncur = 10 ** 10\nfor i in range(n - 1, -1, -1):\n res[i] = cur = min(cur + 1, maxs[i])\n\nprint(sum(res) - sum(ss))\nprint(*res)\n" ]

[ "n, l = map(int, input().split())\r\nlanterns = list(map(int, input().split()))\r\n\r\nlanterns.sort()\r\n\r\nmax_gap = 0\r\nfor i in range(1, n):\r\n max_gap = max(max_gap, lanterns[i] - lanterns[i - 1])\r\n\r\nradius = max(max(lanterns[0], l - lanterns[-1]), max_gap / 2)\r\n\r\nprint(\"{:.10f}\".format(radius))\r\n", "n,l = map(int,input().split())\nl1 = list(map(int,input().split()))\nl1.sort()\ndiff = 0\nfor i in range(n-1):\n a = float( (l1[i+1] - l1[i])/2 )\n diff = max(a ,diff)\ndiff = max((l-l1[-1]) , diff , l1[0] - 0)\ndiff= float(diff)\nformat(diff, '.6f')\nprint(diff)", "import sys\r\nimport math\r\n\r\ndef min_light_radius(n, l, lanterns):\r\n lanterns.sort()\r\n max_distance = 0\r\n\r\n for i in range(n - 1):\r\n max_distance = max(max_distance, lanterns[i + 1] - lanterns[i])\r\n\r\n max_distance /= 2 # Divide by 2 to get the radius\r\n\r\n # Check the distance from the first lantern to the beginning of the street\r\n max_distance = max(max_distance, lanterns[0])\r\n \r\n # Check the distance from the last lantern to the end of the street\r\n max_distance = max(max_distance, l - lanterns[-1])\r\n\r\n return max_distance\r\n\r\nn, l = map(int, input().split())\r\nlanterns = list(map(int, input().split()))\r\n\r\nresult = min_light_radius(n, l, lanterns)\r\nprint(\"{:.10f}\".format(result))\r\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ndis = 0\r\nfor i in range(n):\r\n if i == 0:\r\n dis = max(dis, a[i] * 2)\r\n else:\r\n dis = max(dis, a[i] - a[i - 1])\r\ndis = max(dis, (l - a[i]) * 2)\r\nprint('{:.9f}'.format(dis/2))\r\n", "inp = input().split()\nsSize = inp[0]\nl = int(inp[1])\n\n\ns = list(map(int,input().split()))\n\ns.sort()\nledge = s[0]\nredge = l - s[len(s) - 1]\n\nmaxdis = 0\n\n\nif (len(s) == 1):\n print(max(ledge, redge))\n exit(0)\ni = 1\nwhile i < len(s):\n maxdis = max(maxdis, s[i] - s[i - 1])\n i += 1\n\nprint(max(float(redge), float(ledge), (maxdis / 2)))\n\t\t \t\t \t\t \t \t\t\t\t\t \t \t \t\t", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nrez = 2 * max(a[0], l - a[n - 1])\r\nfor i in range(n - 1):\r\n rez = max(rez, a[i + 1] - a[i])\r\nprint(\"{:.10f}\".format(rez / 2.))", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.sort()\r\nl=[]\r\nif len(c)==1:\r\n if c[0]==0:\r\n print(b-c[0])\r\n elif c[0]==b:\r\n print(b-0)\r\n else:\r\n print(max((b-c[0]),(c[0]-0)))\r\nelse:\r\n if c[0] == 0 and c[len(c) - 1] == b:\r\n for i in range(a - 1):\r\n l.append((c[i + 1] - c[i]) / 2)\r\n elif c[0] == 0 and c[len(c) - 1] != b:\r\n for i in range(a):\r\n l.append((c[i + 1] - c[i]) / 2)\r\n l.append(b - c[len(c) - 1])\r\n elif c[0] != 0 and c[len(c) - 1] == b:\r\n l.append(c[0])\r\n for i in range(a - 1):\r\n l.append((c[i + 1] - c[i]) / 2)\r\n else:\r\n l.append(c[0])\r\n for i in range(a - 1):\r\n l.append((c[i + 1] - c[i]) / 2)\r\n l.append(b - c[len(c) - 1])\r\n n = max(l)\r\n\r\n if n != float:\r\n n = ((n / 10) * 10)\r\n v = str(n)\r\n v += \"000000000\"\r\n print(v)\r\n else:\r\n k = str(n)\r\n k += \"000000000\"\r\n print(k)\r\n\r\n", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nm=0\r\nfor i in range(a-1):\r\n d=l[i+1]-l[i] \r\n if d>m:\r\n m=d \r\nm=m/2 \r\nif l[0]!=0:\r\n if l[0]>m:\r\n m=l[0]\r\nif l[a-1]!=b: \r\n if b-l[a-1]>m:\r\n m=b-l[a-1] \r\nprint(m)\r\n\r\n ", "v1,v2 = map(int,input().split())\r\nv= sorted(map(int,input().split()))\r\nd = max(v[0],v2-v[v1-1])\r\nfor i in range(1,v1):\r\n d = max((v[i]-v[i-1])/2,d)\r\nprint(d)", "n,l=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\nlist2=[]\r\nnew_list=sorted(list1)\r\nfor i in range(1,n):\r\n list2.append((new_list[i]-new_list[i-1])/2)\r\nif new_list[0] !=0:\r\n list2.append(new_list[0])\r\nif new_list[-1]!=l:\r\n list2.append(l-new_list[-1])\r\nd=format(max(list2),'.8f')\r\nprint(d)", "n, l = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\ndistances = [2*a[0], 2*(l-a[-1])]\r\nfor i in range(len(a)-1):\r\n distances.append((a[i+1] - a[i]))\r\nprint(max(distances) / 2)\r\n", "import sys\r\nimport math\r\nimport bisect as bs\r\nimport string as strn\r\nimport heapq as hq\r\nimport collections as clc\r\nimport itertools as it\r\nimport operator as op\r\nimport copy as cp\r\nimport queue as q\r\n\r\nto_debug = True\r\ndef solve():\r\n n, l = inp_map()\r\n a = sorted(inp_list(int))\r\n\r\n mx_d = -math.inf\r\n\r\n for i in range(1, n):\r\n mx_d = max(mx_d, abs(a[i] - a[i - 1]))\r\n\r\n print(f\"{max(mx_d / 2, a[0], l - a[-1]):.10f}\")\r\n\r\ndef main():\r\n t = 1\r\n for _ in range(t):\r\n solve()\r\n\r\ndef input():\r\n return sys.stdin.readline().strip('\\r\\n')\r\n\r\ndef inp_int():\r\n return int(input())\r\n\r\ndef inp_map(f=None):\r\n return map(f, input().split()) if f else map(int, input().split())\r\n\r\ndef inp_list(f=None):\r\n return list(map(f, input().split())) if f else list(input())\r\n\r\ndef print(x='', end='\\n'):\r\n sys.stdout.write(str(x))\r\n sys.stdout.write(end)\r\n\r\ndef debug(*x, end='\\n', sep=' '):\r\n if not to_debug:\r\n return\r\n for _x in x:\r\n sys.stderr.write(str(_x))\r\n sys.stderr.write(str(sep))\r\n sys.stderr.write(end)\r\n\r\nmain()", "#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 max_dis=0\r\n lis.sort()\r\n for i in range(n-1):\r\n if(abs(lis[i]-lis[i+1])>max_dis):\r\n max_dis=abs(lis[i]-lis[i+1])\r\n #print(lis[0],max_dis/2)\r\n if(abs(lis[0])>max_dis/2):\r\n max_dis=abs(lis[0]*2)\r\n #print(lis[n-1],n)\r\n if(abs(lis[n-1]-l)>max_dis/2):\r\n max_dis=abs(abs(lis[n-1]-l)*2)\r\n a=str(max_dis/2)\r\n x,y=a.split(\".\")\r\n z=len(y)\r\n for i in range(11-z-1):\r\n y+='0'\r\n st=x+\".\"+y\r\n return st\r\n\r\nn,l=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nprint(exe())", "lanterns, length = list(map(int, input().split()))\nx = list(map(int, input().split()))\nx.sort()\nd = max(x[0] - 0, length - x[-1])\nfor i in range(1, lanterns):\n d = max(d, (x[i] - x[i - 1]) / 2)\nprint(d)\n\t\t\t \t \t\t \t\t\t\t \t\t \t \t \t\t\t\t\t\t", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nmaxdiff = 0\r\na.sort()\r\nfor i in range(n-1):\r\n maxdiff = max(a[i+1] - a[i], maxdiff)\r\n\r\nf = a[0]\r\nb = l - a[-1]\r\n\r\nprint(max(f/1.0, b/1.0, (maxdiff/2)))", "firstLine = input().split()\r\nn = int(firstLine[0])\r\nl = int(firstLine[1])\r\n\r\na = [int(i) for i in input().split()]\r\na = sorted(a)\r\n\r\nd = max(a[0]-0,l-a[-1] )\r\n\r\n\r\nfor i in range(len(a)-1):\r\n \r\n if d < (a[i+1]-a[i])/2:\r\n d = (a[i+1]-a[i])/2\r\nprint(d)", "n, l = input().split()\nn, l = int(n), int(l)\npositions = input().split()\npositions = [int(i) for i in positions]\n\npositions.sort()\n\nd = 0.0\n\nif positions[0] == 0 and positions[n-1] == l:\n for i in range(0, n-1):\n if (positions[i+1] - positions[i]) / 2 > d:\n d = (positions[i+1] - positions[i]) / 2\nelse:\n d = positions[0]\n for i in range(0, n-1):\n if (positions[i+1] - positions[i]) / 2 > d:\n d = (positions[i+1] - positions[i]) / 2\n\n if l-positions[n-1] > d:\n d = l - positions[n-1]\n\nprint(f'{d:.10f}')\n", "n,l = map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nd = 2 * max(a[0], l-a[n-1])\r\nfor i in range(n-1):\r\n d = max(d,a[i+1]-a[i])\r\nprint(d/2)", "n, l = map(int, input().split())\r\n\r\na = list(map(int,input().split()))\r\n\r\nvis = set()\r\n\r\na.sort()\r\n\r\nmaxdist = float(\"-inf\")\r\n\r\nfor i in range(1, n):\r\n maxdist = max(maxdist, a[i] - a[i-1])\r\n\r\nlower = a[0] - 0\r\nupper = l - a[n-1]\r\n\r\nans = max(maxdist/2, lower, upper)\r\n\r\nprint(ans)", "n,l = map(int,input().split())\r\nk=list(map(int,input().split()))\r\n\r\nk.sort()\r\nmx = 0 \r\nfor i in range(1,n):\r\n mx = max(mx,(k[i]-k[i-1])/2)\r\nmx = max(mx,k[0])\r\nmx = max(mx,l-k[-1])\r\n\r\nprint(mx)", "n, l = map(int, input().split()) \r\nA = list(map(int, input().split()))\r\nA.sort()\r\nm = 0\r\nfor i in range (1, n):\r\n if A[i] - A[i - 1] > 2 * m:\r\n m = (A[i] - A[i - 1]) / 2\r\nprint (max(A[0], l - A[n - 1], m))", "n,l=map(int, input().split())\r\nli=sorted([int(i) for i in input().split()])\r\na=max(li[0],l-li[-1])\r\nfor j in range(n):\r\n a=max(a, (li[j]-li[j-1])/2)\r\nprint(a)", "n, l = map(int, input(\"\").split())\r\na = list(map(int, input(\"\").split()))\r\na.sort()\r\ndis = []\r\ndis.append(a[0])\r\ndis.append(l-a[-1])\r\nfor i in range(1, n):\r\n dis.append((a[i]-a[i-1])/2)\r\n\r\nprint(max(dis))", "x = input().split(' ')\r\nn = int(x[0])\r\nl = int(x[1])\r\n\r\nlamps = input().split(' ')\r\nlamps = [int(x) for x in lamps]\r\n\r\nlamps.sort()\r\ncur = lamps[0]\r\nm = lamps[0]*2\r\n\r\nfor i in range(1, n):\r\n m = max(m, lamps[i]-cur)\r\n cur = lamps[i]\r\nm = max((l-lamps[-1])*2, m)\r\n\r\n\r\nprint(m/2)", "n,m=map(int,input().split())\nl=list(map(int,input().split()))\nl.sort()\nsub=[]\nfor i in range(1,len(l)):\n s=l[i]-l[i-1]\n sub.append(s)\nsub.append((l[0]-0)*2)#头尾判断\nsub.append((m-l[-1])*2)\nans=0\nfor i in sub:\n if ans<(i/2):\n ans=i/2\nprint(ans)", "import sys\r\nimport math\r\nfrom typing import List\r\n\r\ndef getIntsLine() -> List[int]:\r\n line_in = input()\r\n splits = line_in.split(\" \")\r\n return list(map(lambda split: int(split), splits))\r\n\r\ndef insertIntoSorted(list, new_element):\r\n\r\n for i in range(0, len(list)):\r\n element = list[i]\r\n if (new_element < element):\r\n list.insert(i, new_element)\r\n return\r\n \r\n list.append(new_element)\r\n\r\n\r\n# string to int count\r\nlanternPoses = list()\r\n\r\ndef main():\r\n \r\n info = getIntsLine()\r\n lanternCount = info[0]\r\n length = info[1]\r\n\r\n rawPoses = getIntsLine()\r\n for lantern in rawPoses:\r\n insertIntoSorted(lanternPoses, lantern)\r\n \r\n maxDistance = 0\r\n maxDistance = max(maxDistance, lanternPoses[0])\r\n maxDistance = max(maxDistance, length - lanternPoses[-1])\r\n\r\n if (lanternCount > 0):\r\n \r\n lastLanternPos = lanternPoses[0]\r\n for i in range(1, lanternCount):\r\n newLanternPos = lanternPoses[i]\r\n maxDistance = max(maxDistance, (newLanternPos - lastLanternPos) / 2.0)\r\n lastLanternPos = newLanternPos\r\n \r\n print(maxDistance)\r\n\r\n \r\nmain()", "n, l = map(int, input().split())\r\nlanterns = list(map(int, input().split()))\r\n\r\nlanterns.sort()\r\n\r\nmax_distance = 0\r\n\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, lanterns[i] - lanterns[i-1])\r\n\r\nmax_distance /= 2\r\n\r\nif lanterns[0] != 0:\r\n max_distance = max(max_distance, lanterns[0])\r\n\r\nif lanterns[-1] != l:\r\n max_distance = max(max_distance, l - lanterns[-1])\r\n\r\nprint(\"{:.10f}\".format(max_distance))\r\n\r\n", "# Inputs\r\nn, l = input().split(\" \", 2)\r\nn = int(n)\r\nl = int(l)\r\nlamps = str(input())\r\n \r\n# List of Lamps\r\nlamps = lamps.split(\" \")\r\nlamps = [int(x) for x in lamps]\r\n \r\n# Starting of ending position of Lamps\r\nlamps.insert(0,0)\r\nlamps.append(l)\r\nlamps.sort()\r\n \r\n# Calculating differences between all points\r\ndiff = []\r\nindex = 0\r\nwhile index != len(lamps)-1:\r\n diff.append(lamps[index+1]-lamps[index])\r\n index += 1\r\n \r\n# Comparing if distance from starting and ending is more than max\r\nans = max(diff)/2\r\nans = max(diff[0], ans)\r\nans = max(diff[len(diff)-1], ans)\r\n \r\nprint(float(ans))\r\n ", "n, l = map(int, input().split())\r\nranges = list(map(int,input().split()))\r\nranges.sort()\r\nd = 0\r\nfor i in range(len(ranges)-1,0,-1):\r\n if ranges[i]-ranges[i-1]>d:\r\n d=ranges[i]-ranges[i-1]\r\nif(ranges[0]>d/2 and ranges[0]>l-ranges[-1]):\r\n print(ranges[0])\r\nelif(l-ranges[-1]>d/2):\r\n print(l-ranges[-1])\r\nelse:\r\n print(d/2)\r\n", "# Vanya and Lantern\r\nn, l = map(int, input().split())\r\na = list(map(int, input().split())) # position of lanterns\r\na.sort()\r\nsep_a = []\r\n\r\nfor i in range(0, n-1):\r\n sep_a.append((a[i + 1] - a[i])/2)\r\n\r\nsep_a.append(a[0] - 0)\r\nsep_a.append(l - a[n-1])\r\n\r\nsep_a.sort(reverse=True)\r\n\r\nprint(format(sep_a[0], '.10f'))", "a,b=map(int,input().split())\r\ns=sorted(map(int,input().split()))\r\nz=max(s[0],b-s[-1])\r\nfor i in range(1,a):\r\n k=(s[i]-s[i-1])/2\r\n z=max(z,k)\r\nprint(z)", "n, l = map(int, input().split())\r\nlights = sorted(list(map(int, input().split())))\r\nmaxdist = 0\r\nfor i in range(1, n):\r\n maxdist = max(maxdist, lights[i] - lights[i - 1])\r\nprint(max(maxdist / 2, max(lights[0] - 0, l - lights[n - 1])))", "n, l=map(int, input().split())\r\nlantern = sorted([int(x) for x in input().split()])\r\nx = 0\r\nfor i in range(n-1):\r\n x = max(x,(lantern[i+1]-lantern[i]) / 2)\r\nx = max(x, lantern[0], l - lantern[-1])\r\nprint(x)", "#1^2 + 2^2 + 3^3 + ... + n^2 = n*(n + 1)*(2*n + 1) // 6\r\n#1*(1 + 1) + 2*(2 + 1) + 3*(3 + 1) + ... + n*(n + 1) = n*(n + 1)*(n + 2) // 3\r\nfrom bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\r\nfrom heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nfrom itertools import accumulate\r\nfrom functools import lru_cache\r\nfrom string import ascii_lowercase\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().strip()\r\nrint = lambda: int(input())\r\n\r\n'''Speed up input'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, l = rvar()\r\narr = rarr()\r\narr.sort()\r\narr = arr\r\nval = 0\r\nfor i in range(1, n):\r\n val = max(val, arr[i] - arr[i - 1])\r\nres = val / 2\r\nif arr[0] - res > 0:\r\n res = arr[0]\r\nif arr[-1] + res < l:\r\n res = l - arr[-1]\r\nprint(res)", "n, l = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\ndef streetLights(lights, streetlength, spots):\r\n d = 0\r\n spots.sort()\r\n \r\n for i, v in enumerate(spots[:-1]):\r\n q = abs(spots[i] - spots[i+1])\r\n if q > d:\r\n d = q\r\n edge = max(spots[0] - 0, l - spots[-1])\r\n print(edge if edge > d / 2 else d / 2)\r\n\r\nstreetLights(n, l, A)", "n, l = map(int, input().split())\r\npos = list(map(int, input().split()))\r\npos = sorted(pos)\r\nmaxdis = pos[0]\r\nfor i in range(1, n):\r\n maxdis = max(maxdis, (pos[i] - pos[i-1]) / 2)\r\nmaxdis = max(maxdis, l-pos[-1])\r\nprint(maxdis)", "first = input().split()\r\nsecond = input().split()\r\nlanterns = [int(i) for i in second]\r\nlanterns.sort()\r\ndiff = lanterns[0]\r\ni = 0\r\ndiffamounts = len(lanterns) -1\r\nwhile i < diffamounts:\r\n currdiff = lanterns[i+1] - lanterns[i]\r\n currdiff /= 2\r\n if currdiff > diff:\r\n diff = currdiff\r\n i += 1\r\ncurrdiff = int(first[1]) - lanterns[-1]\r\nif currdiff > diff:\r\n diff = currdiff\r\noutput = \"{:.10f}\".format(diff)\r\nprint(output)", "n, l = map(int, input().split())\r\na = sorted([int(el) for el in input().split()])\r\nmaxdist = -float(\"inf\")\r\nfor i in range(1, n):\r\n maxdist = max(maxdist, a[i] - a[i - 1])\r\nprint(max(maxdist / 2, a[0] - 0, l - a[-1]))\r\n", "max = 0\nentrada = input()\nnLant, tamR = entrada.split()\nnLant = int(nLant)\ntamR = int(tamR)\narray = input()\narray = array.split()\nfor j in range(nLant):\n array[j] = int(array[j])\narray.sort()\nif(array[0]>tamR-array[nLant-1]): max = array[0]\nelse: max = tamR-array[nLant-1]\nfor i in range(len(array)):\n if(i<nLant-1):\n if((array[i+1]-array[i])/2 > max): max = (array[i+1]-array[i])/2\nprint(f'{max:.10f}')\n \t \t \t\t\t \t \t\t \t \t \t", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nd=a[0]\r\nlast=a[0]\r\nfor i in a[1:]:\r\n dif=i-last\r\n dif=dif/2\r\n d=max(dif,d)\r\n last=i\r\ndif=l-last\r\nd=max(d,dif)\r\nprint(d)", "inp = input()\r\ninp = inp.split()\r\nn = int(inp[0])\r\nl = int(inp[1])\r\n\r\nlamps = [0] * n\r\ninp2 = input()\r\ninp2 = inp2.split()\r\nfor i in range(n):\r\n lamps[i] = int(inp2[i])\r\n\r\nlamps.sort()\r\nmaxDist = lamps[0]\r\nfor i in range(n-1):\r\n dist = (lamps[i+1] - lamps[i])/2\r\n if dist > maxDist:\r\n maxDist = dist\r\nif (l-lamps[n-1] > maxDist):\r\n maxDist = l - lamps[n - 1]\r\nprint(maxDist)", "i=lambda:map(int,input().split())\r\nsiddu,l=i()\r\nvars=sorted(i())\r\nprint(max(r-l for l,r in zip([-vars[0]]+vars,vars+[2*l-vars[-1]]))/2)", "n,lmao=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ndef func(sortedlist):\r\n a=0\r\n for i in range(len(sortedlist)-1):\r\n b=sortedlist[i+1]-sortedlist[i]\r\n if b>a:\r\n a=b\r\n return a/2\r\nprint(max((func((l)),l[0],(lmao-l[-1]))))", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\na.sort()\r\nfor i in range(n-1):\r\n ans = max(ans, (a[i+1]-a[i])/2)\r\nprint(max(ans, a[0], l-a[-1]))", "n, l = map(int, input().split())\r\npositions = list(map(int, input().split()))\r\n\r\npositions.sort() # Сортируем позиции фонарей по возрастанию\r\n\r\nmax_distance = max(positions[0], l - positions[-1]) # Расстояние до самого ближнего или самого дальнего фонаря\r\n\r\nfor i in range(1, n):\r\n distance = (positions[i] - positions[i - 1]) / 2 # Расстояние между текущим и предыдущим фонарем, поделим пополам\r\n max_distance = max(max_distance, distance) # Обновляем максимальное расстояние, если необходимо\r\n\r\nprint(f\"{max_distance:.10f}\")", "n, l = map(int, input().split())\r\npos = list(map(int, input().split()))\r\npos.sort()\r\n\r\nmin_dist = -1\r\n\r\nfor previous, current in zip(pos, pos[1:]):\r\n min_dist = max(min_dist, current-previous)\r\n\r\nprint(max(pos[0]-0, l-pos[-1], min_dist/2))", "l=input().split()\r\nm=input().split()\r\nm=[int(i) for i in m]\r\nm.sort()\r\nstart=m[0]\r\nend=int(l[1])-m[-1]\r\nx=max(start,end)\r\nflag=0\r\nfor i in range(1,len(m)):\r\n k=m[i]-m[i-1]\r\n if k/2>x and flag==0:\r\n x=k\r\n flag=1\r\n elif k>x and flag==1:\r\n x=k\r\nif flag==0:\r\n print(x)\r\nif flag==1:\r\n print(x/2)", "n, l = map(int, input().split())\n\na = list(map(int,input().split()))\n\nh = list()\n\na.sort()\n\n#print(a)\nfor i in range(len(a) - 1):\n h.append(abs(a[i] - a[i + 1]) / 2)\n\nh.append(a[0] - 0)\n\nh.append(l - a[-1])\n\nprint(max((h)))", "n, l = map(int, input().split())\r\nlanterns = sorted(map(int, input().split()))\r\n\r\nmax_dist = 0\r\n\r\nfor i in range(n - 1):\r\n max_dist = max(max_dist, lanterns[i + 1] - lanterns[i])\r\n\r\nmax_dist = max(max_dist / 2, lanterns[0], l - lanterns[-1])\r\nprint(max_dist)\r\n", "n,l=map(int,input().split())\r\nq=[]\r\na=list(map(int,input().split()))\r\na.sort()\r\nfor x in range(len(a)-1):\r\n q.append((a[x+1]-a[x])/2)\r\nq.append(min(a))\r\nq.append(l-max(a))\r\nprint(max(q))\r\n ", "n, l = map(int, input().split())\r\nlanterns = sorted(map(int, input().split()))\r\n\r\nmax_gap = 0\r\nfor i in range(1, n):\r\n gap = lanterns[i] - lanterns[i-1]\r\n max_gap = max(max_gap, gap)\r\n\r\nd = max(max_gap / 2, max(lanterns[0], l - lanterns[-1]))\r\n\r\nprint(d)\r\n", "n, l = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nd = 0\r\n\r\nif a[0] != 0:\r\n d = a[0]\r\n\r\nif a[-1] != l and l - a[-1] > d:\r\n d = l - a[-1]\r\n\r\nfor i in range(n - 1):\r\n tmp = (a[i + 1] - a[i]) / 2\r\n if tmp > d:\r\n d = tmp\r\n\r\nprint(d)\r\n", "F = int(1e9)\r\nn, L = map(int, input().split())\r\nL *= F\r\narr = [int(x) * F for x in input().split()]\r\narr.sort()\r\n\r\ndef f(d):\r\n x,y = arr[0], arr[-1]\r\n if x > d or L - y > d:\r\n return False\r\n for i in range(n - 1):\r\n x,y = arr[i], arr[i + 1]\r\n if y -x > 2 * d:\r\n return False\r\n return True\r\n \r\nlo = 0\r\nhi = 1 * F\r\nwhile not f(hi):\r\n hi *= 2\r\nwhile hi - lo > 5:\r\n mid = lo +(hi - lo) // 2\r\n if f(mid):\r\n hi = mid\r\n else:\r\n lo = mid\r\n \r\nwhile not f(lo):\r\n lo += 1 \r\n \r\nprint(lo / 1e9)", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmax_distance = max(a[0], l - a[-1])\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, (a[i] - a[i - 1]) / 2)\r\nprint(max_distance)\r\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmax_len = 0\r\nfor i in range(n-1):\r\n k = round((a[i + 1] - a[i]) / 2, 10)\r\n if k > max_len:\r\n max_len = k\r\nif round(a[0], 10) > max_len:\r\n max_len = round(a[0], 10)\r\nif round(l - a[n - 1], 10) > max_len:\r\n max_len = round(l - a[n - 1], 10)\r\nprint('{:.10f}'.format(max_len))\r\n\r\n\r\n\r\n", "n, l = [int(i) for i in input().split()]\n\nlt = [int(i) for i in input().split()]\n\nlt.sort()\ndist = 0\nfor i in range(n - 1):\n dist = max( dist, (lt[i+1] - lt[i])/ 2)\n\nltmax = max( dist, lt[0], l-lt[-1])\nprint(ltmax)\n\t\t\t\t \t \t \t\t \t\t \t\t\t\t \t\t \t", "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\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Solution ---- ############\r\nn,l = invr()\r\nA = inlt()\r\nA.sort()\r\npre_Darkness = abs(0-A[0])\r\npost_Darkness = abs(l-A[n-1])\r\nnot_in_Darkness= max(pre_Darkness,post_Darkness)\r\nif(n==1):\r\n print(not_in_Darkness)\r\nelse:\r\n in_Darkness = 0\r\n\r\n for i in range(n-1):\r\n in_Darkness =max(in_Darkness,abs(A[i]-A[i+1]))\r\n res = max( in_Darkness/ 2.0,not_in_Darkness)\r\n formatted_result = \"{:.10f}\".format(res)\r\n print(formatted_result)\r\n ", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmaxdist=0\r\nfor i in range(1,n):\r\n maxdist=max(maxdist,a[i]-a[i-1])\r\nmaxdist=max(maxdist/2,a[0]-0,l-a[n-1])\r\nprint(maxdist)", "n, l = map(int, input().split())\r\nlis = list(map(int, input().split()))\r\nlis.sort()\r\n\r\nlargest_dist = lis[0] * 2\r\nprev = 0\r\n\r\nfor x in lis:\r\n largest_dist = max(largest_dist, x - prev)\r\n prev = x\r\n \r\nprint(max(largest_dist / 2, l - lis[-1]))", "def main():\n n, l = map(int, input().split())\n arr = list(map(int, input().split()))\n arr.sort()\n ans = max(arr[0], l-arr[n-1])\n for i in range(n - 1):\n ans = max(ans, (arr[i + 1] - arr[i])/2)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n", "v,v1=map(int,input().split())\r\nv2=sorted(list(map(int,input().split())))\r\nm=max(v2[0],v1-v2[v-1])\r\nfor i in range(v-1):\r\n m=max((((v2[i+1]-v2[i]))/2),m)\r\nprint(m)", "n, l = map(int, input().split())\r\nlanterns = list(map(int, input().split()))\r\n\r\nlanterns.sort()\r\n\r\nmax_distance = 0\r\n\r\nfor i in range(n - 1):\r\n max_distance = max(max_distance, lanterns[i + 1] - lanterns[i])\r\n\r\n# Consider the distance from the first lantern to the beginning and from the last lantern to the end\r\nmax_distance = max(max_distance, 2 * max(lanterns[0], l - lanterns[-1]))\r\n\r\n# Calculate the minimum radius needed to cover the entire street\r\nmin_radius = max_distance / 2.0\r\n\r\nprint(\"{:.10f}\".format(min_radius))\r\n", "n, l = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.sort()\r\nd = f[0]\r\nx = f[0]\r\nfor i in f[1:]:\r\n if i - (x) > 2*d:\r\n d += ((i - (x)) - (2*d))/ 2\r\n x = i\r\n\r\nif x + d < l:\r\n d += l - (x + d)\r\nprint(d)\r\n", "n,l=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nv=[]\r\nif b[0]!=0:\r\n v+=[b[0]-0]\r\nv+=[l-b[-1]]\r\nfor i in range(n-1):\r\n v+=[(b[i+1]-b[i])/2]\r\nprint(max(v)-0.000000)", "def nminput():\r\n return map(int,input().split())\r\n \r\ndef linput():\r\n return list(map(int,input().split()))\r\n\r\nn,m = nminput()\r\nl = sorted(linput())\r\n\r\nmx = 0\r\nfor i in range(n-1):\r\n mx = max(mx,(l[i+1] - l[i]) /2)\r\n\r\nmx= max(mx,m-l[-1])\r\nmx = max(mx,l[0]-0)\r\n\r\nprint(mx) ", "n,l=map(int,input().split())\r\n\r\n\r\nx=list(map(int,input().split()))\r\n\r\nx.sort()\r\nd1=x[0]-0\r\nd2=l-x[n-1]\r\nz=[]\r\n\r\nfor i in range(0,n-1):\r\n \r\n d=abs(x[i]-x[i+1])\r\n z.append(d)\r\n \r\nz.sort()\r\nif len(z)==0:\r\n print(max(d1,d2))\r\nelse:\r\n \r\n y=z[len(z)-1]/2\r\n print(max(d1,d2,y))\r\n ", "x , y = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nanswer = 0\r\na = 0\r\nfor i in range(1,x):\r\n a = l[i] - l[i-1]\r\n answer = max(answer,a)\r\nanswer = max(answer/2,l[0]-0,y-l[-1])\r\nprint(answer)", "a,b=map(int,input().split())\r\nlit=(list(map(int,input().split())))\r\nlit=sorted(lit)\r\n\r\nba=[0]\r\n\r\nfor i in range(len(lit)-1):\r\n ba.append(lit[i+1]-lit[i])\r\n\r\nn1=(float(min(lit)))\r\n\r\nn2=(float(b-max(lit)))\r\n\r\nn3=(float(max(ba))/2)\r\nprint(max(n1,n2,n3))", "for _ in range(1):\r\n n,l=map(int,input().split())\r\n a=(list(map(int,input().split())))\r\n mx=0\r\n a=sorted(set(a))\r\n mx=max(mx,a[0]-0)\r\n mx=max(mx,l-a[-1])\r\n for i in range(len(a)-1):\r\n mx=max(mx,(a[i+1]-a[i])/2)\r\n print(mx)", "n,l = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nans = list()\r\nans.append((a[0]-0)*2)\r\nans.append((l-a[-1])*2)\r\nfor i in range(n-1):\r\n ans.append(a[i+1]-a[i])\r\nprint(max(ans)/2)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Oct 5 11:19:12 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nn,l=map(int,input().split())\nnums=list(map(int,input().split()))\nnums.sort()\nlist1=[]\nlist1.append(min(nums))\nlist1.append(l-max(nums))\nfor i in range(len(nums)-1):\n list1.append((nums[i+1]-nums[i])/2)\n \na=max(list1)\nprint(a)", "n,l = input().split()\r\nn = int(n)\r\nl = int(l)\r\narr = input().split()\r\n\r\nfor i in range(0,len(arr)):\r\n arr[i]=int(arr[i])\r\n\r\narr.sort()\r\n\r\nd = 2*max(arr[0],l-arr[-1])\r\n\r\nfor i in range(1,n):\r\n d = max(d,arr[i]-arr[i-1])\r\n\r\nprint('%.9f' % (d/2))", "\r\nl , n = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\na.sort()\r\ndifference=[a[0]] \r\no=1\r\ni=0\r\nwhile(o<l):\r\n difference.append(a[o]-a[i])\r\n o+=1\r\n i+=1\r\nz=max(a[0],n-a[-1])\r\nz=max(z,max(difference)/2)\r\nprint(z)\r\n ", "n,l = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nd = 0\r\n#d = min(a[0],l-a[-1])\r\nif a[0] == 0 and a[-1] != l:\r\n d = l-a[-1]\r\nelif a[0] != 0 and a[-1] == l:\r\n d = a[0]\r\nelif a[0] == 0 and a[-1] == l:\r\n d = 0\r\nelse:\r\n d = max(a[0], l - a[-1])\r\nfor i in range(n-1):\r\n x = (a[i+1] - a[i])/2\r\n if x != 0:\r\n if x > d:\r\n d = x\r\nprint(d)", "n , l = map(int , input().split() )\r\narr = list(map(int , input().split()) )\r\narr.sort()\r\ndist = [arr[0] , l-arr[-1]]\r\nmd = max(dist)\r\n\r\nfor i in range(n-1):\r\n a, b = arr[i] , arr[i+1]\r\n mid = (b-a)/2\r\n dist.append( mid )\r\n \r\n# print( dist)\r\ndist = sorted(set(dist))\r\nif dist[0] == 0 : del dist[0]\r\n# print( dist)\r\n\r\n# ptr = 0\r\n# cum = 0\r\nfor d in dist:\r\n \r\n if d < md :\r\n continue\r\n \r\n is_true = True\r\n for i in range(n-1):\r\n \r\n a, b = arr[i] , arr[i+1]\r\n \r\n if b - d <= a + d :\r\n pass\r\n else:\r\n is_true = False\r\n break\r\n \r\n if is_true :\r\n print( d )\r\n break\r\n ", "import sys\nn, l = map(int, input().split())\nlanterns = list(map(int, input().split()))\n\nlanterns = sorted(lanterns)\nif n == 1:\n\tprint(max(lanterns[0], l-lanterns[0]))\n\tsys.exit()\ngaps = [lanterns[i+1]-lanterns[i] for i in range(n-1)]\n\nprint(max(max(gaps)/2, max(min(lanterns), l-max(lanterns))))\n", "n, l = map(int, input().split())\r\nd = []\r\nlights = list(map(int, input().split()))\r\nlights.sort()\r\n\r\nsl = lights[0] * 2\r\nel = (l - lights[-1]) * 2\r\n\r\nbl = 0\r\ni = 0\r\nwhile i < len(lights)-1:\r\n if lights[i+1] - lights[i] > bl:\r\n bl = lights[i+1] - lights[i]\r\n i += 1\r\n\r\nd = [sl,bl,el]\r\n\r\nprint(max(d)/2)", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(n-1):\r\n ans = max(ans, (a[i+1]-a[i]) / 2)\r\nans = max(ans, a[0])\r\nans = max(ans, l-a[-1])\r\nformatted_num = \"{:.{}f}\".format(ans, 9)\r\nprint(formatted_num)", "n,e=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ndmax=0\r\nfor i in range(n-1):\r\n d=l[i+1]-l[i]\r\n if d>dmax:\r\n dmax=d\r\nprint(max(dmax/2,l[0],e-l[-1]))\r\n", "def maxdista(arr):\r\n maxdist = 0\r\n for i in range(len(arr)-1):\r\n m = arr[i+1]-arr[i]\r\n if (m >= maxdist):\r\n maxdist = m\r\n return maxdist\r\n\r\nn, l = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nif (n == 1):\r\n print(max(l-arr[0], arr[0]))\r\nelse:\r\n print(max(maxdista(arr)/2, arr[0], l-arr[-1]))", "a, l = map(int, input().split())\r\nlights = list(map(int, input().split()))\r\n\r\nlights = sorted(lights)\r\n\r\nmax_dist = 0\r\ni = 0\r\nj = 1\r\nwhile j < len(lights):\r\n if lights[j] - lights[i] > max_dist:\r\n max_dist = lights[j] - lights[i]\r\n\r\n i += 1\r\n j += 1\r\n\r\nprint(max(max_dist/2, max(lights[0] - 0, l - lights[-1])))\r\n", "import math\r\nimport sys\r\n\r\nn,l = map(int,input().split())\r\nls = list(map(int,input().split()))\r\n\r\nls.sort()\r\nmaxi = 0\r\nfor i in range(n-1):\r\n maxi = max(maxi,ls[i+1]-ls[i])\r\na = ls[0]\r\nb = l-ls[n-1]\r\nmaxi=maxi/2\r\n\r\n\r\nprint(max(a,b,maxi))", "num,length=map(int,input().split())\r\na=set()\r\nc=[]\r\nd=[]\r\nb=list(map(int,input().split()))\r\na.update(b)\r\na.add(0)\r\na.add(length)\r\nfor i in a:\r\n c.append(i)\r\nc.sort(reverse=True)\r\namo=len(c)\r\nfor i in range(amo-1):\r\n answer=(c[i]-c[i+1])/2\r\n d.append(answer)\r\ncan=max(d)\r\ncan2=eval(f\"{min(b)}\")\r\ncan3=length-eval(f\"{max(b)}\")\r\nm=[can,can2,can3]\r\nfinal=max(m)\r\nprint(final)", "n,mx = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\nz = n+2\r\nzero,mxx = False,False\r\nif mx in arr:\r\n z-=1\r\n mxx = True\r\nelse:\r\n arr.append(mx)\r\nif 0 in arr:\r\n z-=1\r\n zero = True\r\nelse:\r\n arr = [0]+arr\r\nans = 0\r\nfor i in range(1,z):\r\n if not zero and i==1:\r\n ans = arr[i]\r\n elif not mxx and i==z-1:\r\n ans = max(ans,arr[i]-arr[i-1])\r\n else:\r\n ans = max(ans,(arr[i]-arr[i-1])/2)\r\nprint(ans)", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nd=0\r\nfor i in range(n-1):\r\n d=max(d,a[i+1]-a[i])\r\n\r\nprint(max(d/2,a[0],l-a[-1]))\r\n", "n, l = map(int,input().split())\r\nlinternas = list(map(int,input().split()))\r\n\r\nlinternas.sort()\r\nmax_distancia = max(linternas[0], l - linternas[n-1])\r\n\r\nfor i in range(1,n):\r\n dista_media = linternas[i] - linternas[i-1]\r\n max_distancia = max(max_distancia, dista_media / 2)\r\n\r\nresultado = \"{0:.10f}\".format(max_distancia)\r\nprint(resultado)", "# Read input values\r\nn, l = map(int, input().split())\r\nlanterns = sorted(map(int, input().split()))\r\n\r\n# Initialize the maximum light radius\r\nmax_radius = 0\r\n\r\n# Calculate the maximum light radius needed\r\nfor i in range(n - 1):\r\n max_radius = max(max_radius, (lanterns[i + 1] - lanterns[i]) / 2)\r\n\r\n# Calculate the maximum radius from the first and last lanterns to the ends of the street\r\nmax_radius = max(max_radius, lanterns[0], l - lanterns[-1])\r\n\r\n# Print the result with 10 decimal places\r\nprint(format(max_radius, '.10f'))\r\n", "n , x = map(int , input().split())\r\nl = list(map(int , input().split()))\r\nl.sort()\r\nmx = 0\r\nfor i in range(n-1) :\r\n if abs(l[i] - l[i+1]) > mx : \r\n mx = abs(l[i] - l[i+1])\r\nd= mx / 2\r\ndistance = 0 \r\nif l[0] != 0 and d < l[0] :\r\n d = l[0]\r\nif l[n-1] != x and d < x - l[-1] :\r\n d = x - l[-1]\r\nprint(d)", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ndis=0\r\nfor i in range(n-1):\r\n dis = max(dis, (a[i+1]-a[i])/2)\r\nprint(max(dis, l-a[-1], a[0]))", "import math\r\nn, l = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\na.sort()\r\nmin_dist = -math.inf\r\nfor i in range(len(a)-1):\r\n min_dist = max((a[i+1]-a[i])/2, min_dist)\r\n \r\nmin_dist = max(a[0], min_dist)\r\nmin_dist = max(l-a[-1], min_dist)\r\nprint(min_dist)", "n, l = (int(x) for x in input().split())\r\nd = []\r\na = sorted([int(x) for x in input().split()])\r\nfor i in range(0,n-1):\r\n d.append(abs(a[i]-a[i+1]))\r\n \r\nd.append((l-a[-1])*2)\r\nd.append(a[0]*2)\r\nprint(max(d)/2)\r\n", "\r\nlanterns, length = map(int, input().split())\r\nlocations = sorted([int(x) for x in input().split()])\r\nanswer = 0\r\nif lanterns == 1:\r\n if locations[0] - 0 > length - locations[0]:\r\n answer = locations[0] - 0\r\n else:\r\n answer = length - locations[0]\r\nelse:\r\n for i in range(0, lanterns - 1, 1):\r\n if 0 not in locations and i == 0:\r\n if locations[0] > (locations[1] - locations[0]) / 2:\r\n radius = locations[0]\r\n else:\r\n radius = (locations[1] - locations[0]) / 2\r\n else:\r\n radius = (locations[i + 1] - locations[i]) / 2\r\n answer = max(answer, radius)\r\n if locations[lanterns - 1] != length:\r\n answer = max(answer, length - locations[lanterns - 1])\r\nprint(answer)\r\n", "n, l = map(int, input().split())\r\nlanterns = list(map(int, input().split()))\r\n\r\nlanterns.sort() # Sort the lantern positions in ascending order\r\n\r\nmax_distance = 0\r\n\r\n# Calculate the distance between adjacent lanterns and find the maximum distance\r\nfor i in range(1, n):\r\n distance = lanterns[i] - lanterns[i - 1]\r\n max_distance = max(max_distance, distance)\r\n\r\n# Calculate the minimum light radius needed (half of the maximum distance)\r\nmin_light_radius = max(max_distance / 2, lanterns[0], l - lanterns[-1])\r\n\r\nprint(f\"{min_light_radius:.10f}\")\r\n", "a, b = map(int, input().split())\r\nq = sorted(list(map(int, input().split())))\r\nmx = 0\r\nfor i in range(1, a):\r\n if q[i] - q[i - 1] > mx:\r\n mx = q[i] - q[i - 1]\r\nprint (max(mx / 2, max(q[0], b - q[-1])))", "l_lanterns = list()\n\n_, l = map(int, input().split())\nl_lanterns.append(0)\nl_lanterns.append(l)\n\ns_lanterns = set(map(int, input().split()))\n\nl_lanterns.extend(s_lanterns)\nl_lanterns.sort()\n\nmax_dist = -1\n\nfor index in range(len(l_lanterns) - 1):\n num_lanterns = 1 if l_lanterns[index +1] in s_lanterns else 0\n num_lanterns += 1 if l_lanterns[index] in s_lanterns else 0\n max_dist = max(max_dist, (l_lanterns[index + 1] - l_lanterns[index]) / num_lanterns)\n\nprint(max_dist)", "n, l = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ndist = []\r\nif 0 not in a:\r\n dist.append(min(a))\r\nif l not in a:\r\n dist.append(l-max(a))\r\na1 = sorted(a)\r\nfor i in range(n - 1):\r\n dist.append((a1[i + 1] - a1[i]) / 2)\r\nprint(format(max(dist), '.10f'))\r\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmax_dist = 0\r\nfor i in range(1, n):\r\n max_dist = max(max_dist, a[i] - a[i - 1])\r\nmax_dist = max(max_dist / 2, a[0], l - a[-1])\r\nprint(max_dist)", "info = [int(a) for a in input().split()]\r\nlanterns = [int(a) for a in input().split()]\r\ndef mergesort(arr):\r\n if len(arr) > 1:\r\n left = arr[:len(arr)//2]\r\n right = arr[len(arr)//2:]\r\n mergesort(left)\r\n mergesort(right)\r\n l = 0\r\n r = 0\r\n a = 0\r\n while l < len(left) and r <len(right):\r\n if left[l] >= right[r]:\r\n arr[a] = right[r]\r\n r += 1\r\n else:\r\n arr[a] = left[l]\r\n l+= 1\r\n a += 1\r\n while l < len(left):\r\n arr[a] = left[l]\r\n l += 1\r\n a += 1\r\n while r < len(right):\r\n arr[a] = right[r]\r\n r += 1\r\n a += 1\r\nmergesort(lanterns)\r\nmini = max(lanterns[0], info[1]-lanterns[-1])\r\nfor i in range(1, len(lanterns)):\r\n mini = max(mini, (lanterns[i] - lanterns[i-1])/2)\r\nprint(mini)", "# your code goes here\r\ndef main():\r\n n, l = map(int, input().split())\r\n p = list(map(int, input().split()))\r\n\r\n p.sort()\r\n r = max(p[0], l - p[n - 1]) * 2\r\n\r\n for i in range(n - 1):\r\n r = max(r, p[i + 1] - p[i])\r\n\r\n print(\"{:.20f}\".format(r / 2.0))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nn,l=map(int,input().split())\r\na=[*map(int,input().split())]\r\nresult=0\r\n\r\na.sort()\r\nm=a[0]\r\nfor i in range(n-1):\r\n m=max(m,(a[i+1]-a[i])/2)\r\nm=max(m,l-a[-1])\r\nprint(m)", "n,d=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\na=max(l[0],d-l[-1])\r\nfor i in range(n-1):\r\n a=max(a,(l[i+1]-l[i])/2)\r\nprint(a)", "n, l = map(int, input().split())\r\nm = sorted(list(map(int, input().split())))\r\na = 0\r\nfor i in range(len(m) - 1):\r\n if m[i + 1] - m[i] > a:\r\n a = m[i + 1] - m[i]\r\nprint(max(a / 2, m[0], l - m[-1]))", "n, l = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\nmax_len = 0\r\nfor i in range(0, len(a) - 1):\r\n max_len = max(a[i + 1] - a[i], max_len)\r\nmax_len = max(max_len / 2, a[0], l - a[-1])\r\nprint(max_len)", "n, l = map(int, input().split())\n\na = sorted(map(int, input().split()))\n\nans = max(a[0], l - a[-1])\n\nfor i in range(1, n):\n tmp = (a[i] - a[i - 1]) / 2\n ans = max(ans, tmp)\n\nprint(ans)", "#from collections import Counter\r\nimport math\r\ncount_time=0\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nn,l=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nt=a[0]\r\nmaxo=-1\r\nfor i in a:\r\n e=i-t\r\n if e>maxo:maxo=e\r\n t=i\r\ne=l-t\r\nif e>maxo:maxo=e\r\nprint('{:.10f}'.format(max(maxo/2,a[0],l-a[-1])))\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", "n_lanterns , l_length_street = map(int,input().split())\r\nlight = list(map(int,input().split()))\r\nlight.sort()\r\nMax1 = 0\r\nlight_0 = \"\"\r\nl=\"\"\r\nif light[0] == 0 :\r\n light_0 = \"YES\"\r\n \r\nfor i in range (1,n_lanterns) :\r\n Max1 = max(Max1,light[i]-light[i-1])\r\n if light[i]==l_length_street :\r\n l=\"YES\"\r\n \r\nanswer = Max1/2.0\r\nif light_0 !=\"YES\" :\r\n answer = max(answer,light[0])\r\n \r\nif l!=\"YES\" :\r\n answer = max(answer,1-light[n_lanterns-1])\r\nif (l_length_street-light[-1])> answer :\r\n answer = l_length_street-light[-1]\r\nprint(answer)", "a, b = map(int, input().split())\r\nc = sorted(map(int, input().split()))\r\n\r\nmin_radius = 0\r\n\r\nfor i in range(a-1):\r\n r = (c[i+1]-c[i])/2\r\n min_radius = max(r, min_radius)\r\n\r\nmin_radius = max(min_radius, c[0], b - c[-1])\r\n\r\nprint(\"{:.9f}\".format(min_radius))", "\r\n\r\n\r\nn, l = map(int, input().strip().split(' '))\r\narr = list(map(int, input().strip().split(' ')))\r\n\r\narr.sort()\r\n\r\nmax_d = max(arr[0], l - arr[-1])\r\n\r\nfor i in range(1, len(arr)):\r\n max_d = max(max_d, (arr[i]-arr[i-1])/2)\r\n\r\nprint(max_d)", "num_of_lanterns, street_length = map(int, input().split())\r\nposition = list(map(int, input().split()))\r\nposition.sort()\r\n\r\nmax_distance = 0\r\nfor i in range(1, num_of_lanterns):\r\n distance = position[i] - position[i - 1]\r\n max_distance = max(distance , max_distance)\r\n\r\ndistance1 = position[0]\r\ndistance2 = street_length - position[num_of_lanterns-1]\r\n\r\nd = max(max_distance/2, distance1, distance2)\r\nprint(d)", "n,l = map(int,input().split())\r\nai = [float(x) for x in input().split()]\r\nai.sort()\r\nd = -1\r\nanswer = [ai[0],l - ai[-1]]\r\nfor i in range(len(ai) - 1):\r\n diff = abs(ai[i] - ai[i + 1])\r\n if diff > d:\r\n d = diff\r\n\r\nanswer.append(d/2)\r\nprint(float(max(answer)))", "n , l = map(int,input().split(\" \"))\r\narr = list(map(int,input(\"\").split(\" \")))\r\narr.sort()\r\nif arr[0] != 0:\r\n maxa = arr[0]\r\nelse:\r\n maxa = -float(\"inf\")\r\n\r\nfor i in range(1,n):\r\n maxa = max(maxa , (arr[i] - arr[i-1]) / 2 )\r\n\r\nif arr[-1] != l:\r\n maxa = max(maxa,l - arr[-1])\r\n\r\nprint(maxa)\r\n", "n, l = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\none = a[0]\r\ntwo = l - a[-1]\r\ns = 0\r\nfor i in range(n-1):\r\n if a[i+1] - a[i] > s:\r\n s = a[i+1] - a[i]\r\nthree = s/2\r\n\r\nprint(max(one,two,three))\r\n", "n,l = map(int,input().split())\r\nmain_arr = list(map(int,input().split()))\r\narr = main_arr + [0,l]\r\narr.sort()\r\nmax = 0\r\nfor i in range(n+1):\r\n if arr[i] == 0 and 0 not in main_arr or (arr[i+1] == l and l not in main_arr):\r\n temp = 2*(arr[i+1]-arr[i])\r\n else:\r\n temp = arr[i+1]-arr[i]\r\n if temp>max:max=temp\r\nprint(max/2)", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nrez = 2 * max(a[0], l - a[-1])\r\n\r\nfor i in range(n - 1):\r\n rez = max(rez, a[i + 1] - a[i])\r\n\r\nprint(rez / 2.0)\r\n", "def main():\r\n n, l = map(int, input().split())\r\n v = list(map(int, input().split()))\r\n v.sort()\r\n\r\n a = [float(v[0])]\r\n\r\n for i in range(1, n):\r\n a.append(float((v[i] - v[i-1]) / 2.0))\r\n\r\n a.append(float(l - v[-1]))\r\n\r\n print(\"{:.1f}\".format(max(a)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split())) \r\na.sort()\r\nmax_distance = max(a[0], l - a[-1])\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, (a[i] - a[i - 1]) / 2) \r\n\r\nprint(\"{:.10f}\".format(max_distance))\r\n#не я сделал", "n, l = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nmaxi = 0\r\nfor i in range(n - 1):\r\n if arr[i+1] - arr[i] > maxi:\r\n maxi = arr[i+1] - arr[i]\r\nres = max([maxi / 2, arr[0] - 0, l - arr[n-1]])\r\nprint(float(res))", "n, l = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\na.sort()\r\ndistances = []\r\n\r\nfor i in range(n - 1):\r\n distances.append((a[i + 1] - a[i]) / 2)\r\n\r\nif (0 not in a):\r\n distances.append(a[0])\r\nif (l not in a):\r\n distances.append(l - a[n - 1])\r\n\r\nprint(max(distances))", "n,l=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nd=max(s[0],l-s[-1])\r\nfor i in range(n-1):\r\n d=max(d,(s[i+1]-s[i])/2)\r\nprint(\"%.9f\"%d)", "n, l = tuple(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nA = []\r\ns = sorted(s)\r\nif l not in s:\r\n A.append(l - s[len(s) - 1])\r\n s.append(l)\r\nif 0 not in s:\r\n A.append(s[0] - 0)\r\n s.append(0)\r\ns = sorted(s)\r\nfor i in range (0, len(s) - 1):\r\n a = (s[i+1] - s[i])/2\r\n A.append(a)\r\nd = max(A)\r\nprint(d)\r\n\r\n\r\n\r\n\r\n\r\n", "n, l = map(int, input().split())\r\nlanterns = sorted(map(int, input().split()))\r\n\r\nmax_distance = max(lanterns[0], l - lanterns[-1])\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, (lanterns[i] - lanterns[i-1])/2)\r\n\r\nprint(max_distance)", "n , l = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nd = 0\r\nfor x in range(1,len(a)):\r\n if a[x] - a[x-1] > d:\r\n d = a[x] - a[x-1]\r\no = a[0]-0\r\nk = l-a[n-1]\r\nif d/2 < max(o,k):\r\n if o>k:\r\n print(o)\r\n else:\r\n print(k)\r\nelse:\r\n print(d/2)\r\n \r\n", "n, l = list(map(int, input().split()))\r\nlanterns = sorted(list(map(int, input().split())))\r\nd = []\r\nside = []\r\nif 0 and l in lanterns:\r\n for i in range(len(lanterns)):\r\n if i != len(lanterns)-1:\r\n d.append(lanterns[i+1]-lanterns[i])\r\n else:\r\n d.append(lanterns[i]-lanterns[i-1])\r\nelif 0 in lanterns:\r\n s = [l - lanterns[-1]]\r\n for i in range(len(lanterns)):\r\n if i != len(lanterns)-1:\r\n d.append(lanterns[i + 1] - lanterns[i])\r\n else:\r\n d.append(lanterns[i]-lanterns[i-1])\r\n\r\nelif l in lanterns:\r\n s = [lanterns[0]]\r\n for i in range(len(lanterns)):\r\n if i != len(lanterns)-1:\r\n d.append(lanterns[i + 1] - lanterns[i])\r\n else:\r\n d.append(lanterns[i]-lanterns[i-1])\r\n\r\nelse:\r\n s = [l-lanterns[-1], lanterns[0]]\r\n for i in range(len(lanterns)):\r\n if i != len(lanterns)-1:\r\n d.append(lanterns[i + 1] - lanterns[i])\r\n else:\r\n d.append(lanterns[i]-lanterns[i-1])\r\n\r\ndmax = max(d)/2\r\nsmax = max(s)\r\nprint(max(dmax, smax))", "n, ll = map(int, input().split())\r\n \r\na = list(map(int, input().split()))\r\n \r\na.sort()\r\n \r\nmd = 0\r\nl = a[0]\r\n \r\nfor i in range(1, n):\r\n md = max(md, a[i] - l)\r\n l = a[i]\r\n \r\nprint(max(md / 2, a[0]-0, ll - a[-1]))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 12 17:21:19 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\n\r\nn,l = map(int,input().split())\r\nlanterns = [int(x) for x in input().split()]\r\nlanterns.sort()\r\ns = 0\r\nfor i in range(0,n-1):\r\n if s < (lanterns[i+1] - lanterns[i]):\r\n s = lanterns[i+1] - lanterns[i]\r\na = lanterns[0]\r\nb = l - lanterns[-1]\r\nprint('{:.10f}'.format(max(s/2 , a , b)))", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\ndef read_ints():\r\n return map(int, read_input().split())\r\nnum1, num2 = read_ints()\r\nlist1 = list(read_ints())\r\nlist1.sort()\r\nnum3 = max(list1[0], num2 - list1[-1])\r\nfor x in range(num1):\r\n if x != num1 - 1:\r\n num4 = (list1[x+1] - list1[x]) / 2\r\n if num3 <= num4:\r\n num3 = num4\r\n if num3 >= (num2 // 2) + 1:\r\n break\r\n else:\r\n break\r\nprint(\"{:.10f}\".format(num3))", "\r\nn, l = map(int, input().split())\r\nlights = sorted(list(map(int, input().split())))\r\n\r\nd = 0\r\n\r\nfor i in range(1, len(lights)):\r\n d = max(d, lights[i] - lights[i-1])\r\n \r\nd = max(lights[0], d/2, l - lights[-1])\r\n\r\nprint(d)\r\n \r\n ", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl1=[l[0],k - l[-1]]\r\nfor i in range(n-1):\r\n l1.append((l[i+1]-l[i])/2)\r\nprint(max(l1))", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nm=max(a[0],l-a[-1])\r\nfor i in range(1,n):\r\n m=max(m,(a[i]-a[i-1])/2)\r\nprint('{:.10f}'.format(m))", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=float(\"-inf\")\r\nm=max(abs(0-a[0]),abs(l-a[-1]))\r\nfor i in range(1,n):\r\n\tans=max(ans,abs(a[i]-a[i-1]))\r\nprint(max(m,ans/2))", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nrez = 2 * max(a[0], l - a[n-1])\r\n\r\nfor i in range(n-1):\r\n rez = max(rez, a[i+1] - a[i])\r\n\r\nprint(rez / 2)", "def bubble_sort_from_min_to_max(a):\r\n N = len(a)\r\n for i in range(N - 1):\r\n for j in range(N - i - 1):\r\n if a[j] > a[j + 1]:\r\n a[j], a[j + 1] = a[j + 1], a[j]\r\n return a\r\n \r\nn, l = [int(i) for i in input().split()]\r\na = bubble_sort_from_min_to_max([int(i) for i in input().split()])\r\nlengths = []\r\nfor i in range(len(a)-1):\r\n lengths.append(a[i+1] - a[i])\r\nmaxlengths = 0 if len(lengths) == 0 else max(lengths)/2\r\n\r\n\r\nanswer = max([maxlengths, a[0], l - a[-1]])\r\nprint(answer)", "l1 = list(map(int, input().split()))\r\na = l1[0]\r\nb = l1[1]\r\n\r\nl2 = list(map(int, input().split()))\r\nl2.sort()\r\nprev = 0\r\nmaxi = 2*l2[0]\r\nflag = 0\r\nfor i in l2:\r\n if(i - prev > maxi):\r\n maxi = i-prev\r\n prev = i\r\n\r\n\r\nflag = 0\r\nif(l2[-1] - prev > maxi):\r\n maxi = l2[-1] - prev\r\n flag = 1\r\nif(2*(b-l2[-1]) > maxi):\r\n maxi = b-l2[-1]\r\n flag = 1\r\nif(flag == 1):print(maxi) \r\nelse:print(maxi/2)\r\n", "n, l = map(int, input().split())\r\nlanterns = list(map(int, input().split()))\r\nlanterns.sort()\r\n\r\nmax_distance = 0\r\nfor i in range(1, n):\r\n distance = lanterns[i] - lanterns[i-1]\r\n max_distance = max(max_distance, distance)\r\n\r\nd = max(max_distance / 2, lanterns[0], l - lanterns[-1])\r\nprint(\"{:.10f}\".format(d))\r\n", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\n\nn, l = list(invr())\nlanterns = list(invr())\n\nmx = 0\n# pretend lanterns at 0, end\nlanterns.sort()\nprev = lanterns[0]\nfor x in lanterns:\n mx = max(mx, x - prev)\n prev = x\n# mx = max(mx, l - prev)\nif lanterns[0] > 0:\n mx = max(mx, 2 * lanterns[0])\nif lanterns[-1] < l:\n mx = max(mx, 2 * (l - lanterns[-1]))\nprint(1.0 * mx / 2)", "n, l = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\n\r\nans = max(arr[0], l - arr[n - 1])\r\n\r\nfor i in range(1, n):\r\n ans = max(ans, (arr[i] - arr[i - 1]) / 2)\r\n\r\nprint(ans)\r\n", "n,l=list(map(int,input().strip().split()))\r\na=list(map(int,input().strip().split()))\r\na.append(l)\r\na.append(0)\r\na.sort()\r\nans = a[1]-a[0]\r\nfor i in range(2,len(a)-1):\r\n ans=max(ans, (a[i]-a[i-1])/2)\r\nans=max(ans,a[-1]-a[-2])\r\nprint(ans)", "n, l = map (int, input().split())\r\nm = list(map (int, input().split()))\r\nm.sort()\r\nk = []\r\nfor i in range (1, n):\r\n k.append(m[i] - m[i-1])\r\nif len (k) > 0:\r\n if max (k) / 2 >= m[0] and max (k)/ 2 >= l - m[-1]:\r\n print (max (k)/2)\r\n else:\r\n print (float (max(m[0], l - m[-1])))\r\nelse:\r\n print (float (max(m[0], l - m[-1])))", "n,l = list(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\nnums.sort()\r\n# print(nums)\r\n\r\nans = max(nums[0], l-nums[-1])\r\n\r\nfor i in range(1, n):\r\n ans= max(ans, (nums[i]-nums[i-1])/2)\r\n \r\nprint(ans)", "def solve():\r\n len, length = map(int, input().split())\r\n inp = list(map(float, input().split()))\r\n inp.sort()\r\n res = [2 * (inp[0] - 0)]\r\n\r\n for i in range(1, len):\r\n res.append(inp[i] - inp[i - 1])\r\n\r\n res.append(2 * (length - inp[len - 1]))\r\n res.sort()\r\n print(res[-1] / 2)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "n, l = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ndist = []\r\nif 0 not in a:\r\n dist.append(min(a))\r\nif l not in a:\r\n dist.append(l-max(a))\r\na1 = sorted(a)\r\nfor i in range(n-1):\r\n dist.append((a1[i+1]-a1[i])/2)\r\nprint(max(dist))\r\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nmax_gap = 0\r\nfor i in range(1, n):\r\n max_gap = max(max_gap, a[i] - a[i - 1])\r\n\r\nd = max(max_gap / 2, max(a[0], l - a[-1]))\r\nprint(\"{:.10f}\".format(d))", "def xsort(mas):\r\n for i in range(len(mas)):\r\n for j in range(len(mas)-1):\r\n if mas[j] > mas[j+1]:\r\n sv = mas[j]\r\n mas[j] = mas[j+1]\r\n mas[j+1] = sv\r\nmmas = input().split(\" \")\r\nn = int(mmas[0])\r\nl = int(mmas[1])\r\nmas = []\r\nmas = input().split(\" \")\r\nfor i in range(len(mas)):\r\n mas[i] = int(mas[i])\r\nxsort(mas)\r\nmas1 = []\r\nfor i in range(len(mas) + 1):\r\n if i == 0:\r\n mas1.append(mas[0])\r\n elif i == len(mas):\r\n mas1.append((l - mas[-1]))\r\n else:\r\n mas1.append((mas[i] - mas[i-1])/2)\r\nprint(max(mas1))", "# URL: https://codeforces.com/problemset/problem/492/B\n\n# In python, the input() function always return a string. If the user enters a sequence `0 1 2 3`, the `input()` function will return a string `\"0 1 2 3\"`. Each spaces the user entered will be captured and included in the string.\n# So, it's time to make use of the function `split()` to separate the numbers by spaces.\nfirstLine = input().split()\nnumOfLanterns = int(firstLine[0]) # The number of lanterns given\nlength = int(firstLine[1]) # The length of the street\n# The positions of the lanterns\n# See this line of code, it transfers every substring which contains a single number under this condition. Notice that a pair of square brackets covers the loop progress of transfering strings into integers. It is called \"list comprehension,\" it is a neat way to create a list.\n# Here is an equilavent expression of the progress:\n# lanternPositions = []\n# user_input = input().split()\n# for i in user_input:\n# lanternPositions.append(int(i))\n\nlanternPositions = sorted([int(i) for i in input().split()])\n# This function separate the numbers in the string by spaces and make them substrings in a list.\n# After that, the string are gonna be like `\"'0', '1', '2', '3'\"`. Notice that the numbers in this list are still strings. So it's better to transfer them in to integer type.\n# This function finds out the largest difference between two adjacent numbers of an array\n\n\ndef MaxLanternDistance(n, lanternPositions):\n # this is the maximum difference bewteen two adjacent lanterns.\n maxDiff = 0\n for i in range(n-1):\n diff = lanternPositions[i+1]-lanternPositions[i]\n maxDiff = max(maxDiff, diff)\n return maxDiff\n\n\n# Now consider the distances from the first lantern to the start of the street and from the last lantern to the end of the street.\nprint(max(lanternPositions[0], length-lanternPositions[numOfLanterns-1], MaxLanternDistance(numOfLanterns, lanternPositions)/2))\n", "def r(x, y):\r\n return abs((x-y))/2\r\n\r\nn, l =input().split()\r\nn = int(n)\r\nl = int(l)\r\n\r\na = sorted(list(map(int, input().split())))\r\ndif = 0.0000000000\r\nif a[0] != 0:\r\n dif += a[0]\r\n \r\nif (l-a[n-1]) > dif:\r\n dif = l-a[n-1]\r\n \r\n\r\nfor i in range(n-1):\r\n if r(a[i], a[i+1]) > dif:\r\n dif = r(a[i], a[i+1])\r\n \r\nprint(\"{:.10f}\".format(dif))\r\n", "no_of_lanterns, len_of_street = map(int, input().split())\r\nlanterns_positions = list(map(int, input().split()))\r\nlanterns_positions.sort()\r\n\r\nmax_gap = max(lanterns_positions[0], len_of_street-lanterns_positions[-1])\r\n\r\nfor i in range(1, no_of_lanterns):\r\n gap = lanterns_positions[i] - lanterns_positions[i - 1]\r\n max_gap = max(max_gap, gap)\r\n\r\nmin_radius = max(max_gap / 2, max(lanterns_positions[0], len_of_street - lanterns_positions[-1]))\r\n\r\nprint('{:.9f}'.format(min_radius))\r\n", "def min_light_radius(n, l, lanterns):\r\n lanterns.sort()\r\n \r\n max_distance = 0\r\n \r\n # Calculate the maximum distance between adjacent lanterns\r\n for i in range(1, n):\r\n distance = lanterns[i] - lanterns[i - 1]\r\n max_distance = max(max_distance, distance)\r\n \r\n # Calculate the maximum distance from the beginning and end of the street to the nearest lantern\r\n max_distance = max(max_distance / 2, lanterns[0], l - lanterns[-1])\r\n \r\n return max_distance\r\n\r\n# Read input\r\nn, l = map(int, input().split())\r\nlanterns = list(map(int, input().split()))\r\n\r\n# Calculate and print the minimum light radius\r\nresult = min_light_radius(n, l, lanterns)\r\nprint(result)\r\n", "r1=input()\r\nl1=r1.split(\" \")\r\nn=int(l1[0]);l=int(l1[1])\r\nr2=input()\r\nl2=r2.split(\" \")\r\nloc=[]\r\nfor i in range(n):\r\n loc.append(int(l2[i]))\r\ni=0\r\nwhile i<n:\r\n j=0\r\n while j<n-1:\r\n if loc[j]>loc[j+1]:\r\n t=loc[j+1]\r\n loc[j+1]=loc[j]\r\n loc[j]=t\r\n j+=1\r\n j=0\r\n i+=1\r\ndis=loc[0]\r\ns=[dis]\r\ni=0\r\nwhile i<n-1:\r\n dis=(loc[i+1]-loc[i])/2\r\n s.append(dis)\r\n i+=1\r\ndis=l-loc[-1]\r\ns.append(dis)\r\nm=0\r\nfor i in range(n+1):\r\n if s[i]>m:\r\n m=s[i]\r\nprint(format(m,\".10f\"))", "n,l=map(int,input().split())\r\nalo=input().split()\r\nfor i in range(len(alo)):\r\n alo[i]=int(alo[i])\r\nalo.sort()\r\nmax=int(alo[0])\r\nif l-int(alo[n-1])>max:\r\n max=l-int(alo[n-1])\r\nfor i in range(n-1):\r\n if (int(alo[i+1])-int(alo[i]))/2>max:\r\n max=(int(alo[i+1])-int(alo[i]))/2\r\nprint('%.9f'%max)", "list = []\r\n_, l = map(int, input().split())\r\n\r\nintegerlist = [int(x) for x in input().split()]\r\nintegerlist.sort()\r\nintegerlist.append((2 * l) - integerlist[-1])\r\nintegerlist.append(integerlist[0] * -1)\r\nintegerlist.sort()\r\nfor i in range(len(integerlist) - 1):\r\n list.append(integerlist[i + 1] - integerlist[i])\r\n\r\nlist.sort()\r\nprint(str(list[-1] / 2))", "n,l=map(int,input().split())\r\narr=list(map(int,input().split()));mx=0;arr.sort()\r\nif arr[0]!=0 or arr[-1]!=l:mx=max(arr[0],l-arr[-1])\r\nfor i in range(1,n):mx=max(mx,(arr[i]-arr[i-1])/2)\r\nprint(mx)", "def solution(coords, l):\n dist = 0\n for i in range(len(coords)-1):\n n = coords[i]; n1 = coords[i+1]\n dist = max(dist, (n1-n)/2)\n if (coords[0] != 0):\n dist = max(dist, coords[0])\n if (coords[-1] != l):\n dist = max(dist, l-coords[-1])\n return dist\n\ncoords = []\nn, l = input().split()\nn = int(n)\nl = int(l)\n_ = input()\nfor num in _.split():\n coords.append(int(num))\ncoords = sorted(coords)\nprint(solution(coords, l))\n", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.append(0)\r\na.append(l)\r\na = sorted(a)\r\nd = []\r\nfor i in range(n + 1):\r\n d.append(a[i + 1] - a[i])\r\nprint(max(max(d) / 2, a[1] - a[0], a[-1] - a[-2]))", "n,l=map(int,input().split())\r\nlst=[int(_) for _ in input().split()]\r\nlst.sort()\r\nans=0\r\nfor _ in range(1,n):\r\n ans=max(ans,(lst[_]-lst[_-1])/2)\r\nprint(format(max(ans,lst[0],l-lst[-1]),'.10f'))", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nans = max(ans, a[0])\r\nans = max(ans, l - a[-1])\r\nfor i in range(n-1):\r\n ans = max(ans, (a[i+1] - a[i])/2)\r\nprint(ans)", "'''\r\n###### * User Profile : Keval_78\r\nLinkedIn: https://www.linkedin.com/in/kevalpadsala78/\r\nGithub: https://github.com/Keval78\r\nLeetcode: https://leetcode.com/Keval_78/\r\n'''\r\n\r\nimport sys\r\nfrom os import path\r\nfrom math import log2, floor, ceil, sqrt, pow, gcd\r\n# from random import random, randint, shuffle, choice\r\nfrom collections import Counter, defaultdict, deque\r\n# from itertools import permutations, combinations\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush, heapreplace\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ndef si(): return sys.stdin.readline().strip()\r\ndef ii(): return int(si())\r\ndef mi(ss=\" \"): return map(int, si().split(ss))\r\ndef msi(ss=\" \"): return map(str, si().split(ss))\r\ndef li(ss=\" \"): return list(mi(ss))\r\n\r\n\r\nsys.setrecursionlimit(10 ** 5)\r\nMOD, MOD2, INF = 10 ** 9 + 7, 998244353, float('inf')\r\nMAX = 10**5+1\r\n\r\nn, l = mi()\r\narr = li()\r\narr.sort()\r\nd = max(arr[0]-0, l-arr[n-1])\r\nfor i in range(1,n):\r\n d = max(d, (arr[i]-arr[i-1])/2)\r\nprint(d)\r\n", "n, l = map(int, input().split())\r\nlanterns = sorted(map(int, input().split()))\r\nmax_gap = 0\r\nmin_light_radius = 0\r\nfor i in range(n - 1):\r\n gap = lanterns[i + 1] - lanterns[i]\r\n max_gap = max(max_gap, gap)\r\nmin_light_radius = max(max_gap / 2, max(l - lanterns[-1], lanterns[0]))\r\nprint(\"{:.10f}\".format(min_light_radius))\r\n", "n, l = map(int, input().split())\r\nlst = list(map(int, input().rstrip().split()))\r\nlst.sort()\r\nmd = 0\r\nmd = max(md, lst[0] - 0)\r\nfor i in range(1, n):\r\n if (lst[i] - lst[i - 1]) / 2 > md:\r\n md = (lst[i] - lst[i - 1]) / 2\r\nmd = max(md, l - lst[-1])\r\nprint(md)\r\n", "lanterns, street_length = map(int, input().split())\r\nspots = list(map(int, input().split()))\r\nspots.sort()\r\nstart_d = spots[0]\r\nend_d = street_length - spots[-1]\r\nif lanterns != 1:\r\n distances = [spots[i + 1] - spots[i] for i in range(0, lanterns - 1)]\r\n max_d1 = max(distances) / 2\r\n max_d = max(max_d1, start_d, end_d)\r\nelse:\r\n max_d = max(start_d, end_d)\r\nprint(max_d)\r\n", "n, l = map(int, input().split())\r\n\r\npos = list(map(int, input().split()))\r\npos.append(0)\r\npos.append(l)\r\npos.sort()\r\n\r\n\r\ngaps = []\r\n\r\nfor i in range(1, len(pos)):\r\n gaps.append(pos[i] - pos[i-1])\r\n\r\nd = 0\r\n\r\nfor i in range(len(gaps)):\r\n if i == 0 or i == len(gaps) -1:\r\n if gaps[i] >= d:\r\n d = gaps[i]\r\n else:\r\n if gaps[i] / 2 > d:\r\n d = gaps[i] / 2\r\n\r\nprint(d)\r\n \r\n \r\n", "inp = input().split(' ')\r\nn = int(inp[0])\r\nl = int(inp[1])\r\ntemplist = input().split(' ')\r\nlis = []\r\nfor i in templist:\r\n lis.append(int(i))\r\n# print(n)\r\n# print(type(n))\r\n# print(l)\r\n# print(type(l))\r\n# print(lis[0])\r\n# print(type(lis[0]))\r\n\r\n\r\n\r\n\r\nlis.sort()\r\ndiff = []\r\ndiff.append(int(lis[0]))\r\nfor i in range(1, len(lis), 1):\r\n diff.append((lis[i]-lis[i-1])/2)\r\ndiff.append((l-lis[-1]))\r\ndiff.sort()\r\nprint(diff[-1])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,l=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nv.sort()\r\na=v[0]\r\nc=v[n-1]\r\nbest=max(a,l-c)\r\np=0\r\nr=1\r\nwhile r!=n:\r\n h=(v[r]-v[p])/2\r\n best=max(best,h)\r\n p+=1\r\n r+=1\r\nprint(best)", "a, b = input().split(), input().split()\r\nkol = int(a[0])\r\ndl = int(a[1])\r\nb = [int(i) for i in b]\r\nb.sort()\r\nmaxx = 0\r\nfor i in range(1, kol):\r\n if b[i] - b[i - 1] > maxx:\r\n maxx = b[i] - b[i - 1]\r\nt = 0\r\nif min(b) > dl - max(b):\r\n t = min(b)\r\nelse:\r\n t = dl - max(b)\r\nif t > maxx / 2:\r\n print(t)\r\nelse:\r\n print(maxx / 2)", "n,l = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nans = 2*max(a[0],l-a[n-1])\r\nfor i in range(n-1):\r\n ans = max(ans, a[i+1]-a[i])\r\nprint(ans/2)", "fl = list(map(int, input().split(\" \")))\r\nn = fl[0]\r\nl = fl[1]\r\n\r\nlntrns = list(map(int, input().split(\" \")))\r\n\r\nlntrns.sort()\r\nif len(lntrns) > 1:\r\n maxD = (lntrns[1] - lntrns[0])/2\r\n for i in range(len(lntrns)-1):\r\n dif = (lntrns[i+1] - lntrns[i])/2\r\n if dif > maxD:\r\n maxD = dif\r\nelse:\r\n maxD = lntrns[0] - 0\r\nst = lntrns[0] - 0\r\nif st > maxD:\r\n maxD = st\r\nen = l - lntrns[-1]\r\nif en > maxD:\r\n maxD = en\r\nprint(maxD)", "n,l = map(int, input().split())\r\nlntr = list(map(int,input().split()))\r\nlntr.sort()\r\nmaxi = 0\r\n\r\nfor i in range(n-1):\r\n maxi = max(maxi,lntr[i+1]-lntr[i])\r\nres = max([maxi/2, lntr[0]-0, l-lntr[n-1]])\r\nprint(float(res))", "[n, l] = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmax_diff = a[0] - 0\r\nfor i in range(1, n):\r\n max_diff = max(max_diff, (a[i] - a[i - 1]) / 2)\r\nmax_diff = max(max_diff, l - a[n - 1])\r\nprint(max_diff)\r\n", "n, l = map(int, input().split())\r\np = list(map(int, input().split()))\r\n\r\np.sort()\r\nr = max(p[0], l - p[n - 1]) * 2\r\n\r\nfor i in range(n - 1):\r\n r = max(r, p[i + 1] - p[i])\r\n\r\nprint(r / 2.0)\r\n", "def solve():\r\n len, length = map(int, input().split())\r\n\r\n inp = list(map(float, input().split()))\r\n inp.sort()\r\n\r\n res = [inp[0], length - inp[-1]]\r\n \r\n for i in range(1, len):\r\n res.append((inp[i] - inp[i - 1]) / 2)\r\n \r\n res.sort()\r\n res.reverse()\r\n \r\n print(res[0])\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "import sys\r\n\r\nt = 1; #t = int(input())\r\n\r\ndef solve() -> None:\r\n n, l = map(int,sys.stdin.readline().split())\r\n w = sorted(list(map(int,sys.stdin.readline().split())))\r\n res = 2*max(w[0],l-w[-1])\r\n for i in range(n-1):\r\n res = max(res,w[i+1]-w[i])\r\n print(res/2)\r\n \r\n \r\nfor _ in [0] * t:\r\n solve()", "n,l=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\nnewlist=[]\r\nif n==1:\r\n if l-a[0]>a[0]-0:\r\n print(l-a[0])\r\n else:\r\n print(a[0]-0)\r\nelse:\r\n for i in range(n - 1):\r\n newlist.append(a[i + 1] - a[i])\r\n newlist.sort()\r\n first = a[0] - 0\r\n last = l - a[-1]\r\n newvalue = ((newlist[-1]) / 2)\r\n if first > newvalue and first > last:\r\n print(first)\r\n elif last > newvalue:\r\n print(last)\r\n else:\r\n print(newvalue)\r\n", "I=lambda:map(int,input().split())\nn,l=I()\ns=sorted(I())\nprint((max([s[i]-s[i-1]for i in range(1,n)]+[s[0]*2,2*(l-s[-1])])/2))\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", "from sys import stdin\r\n\r\n_, length = map(int, stdin.readline().split())\r\nA = sorted(int(x) for x in stdin.readline().split())\r\n\r\nres = max(A[0], length - A[-1])\r\n\r\nfor i in range(1, len(A)):\r\n res = max(res, (A[i] - A[i - 1]) / 2)\r\n\r\nprint(res)\r\n", "n,long=map(int,input().split())\r\nl=input().split()\r\nif len(l)==1:\r\n print(max(long-int(l[0]),int(l[0])))\r\nelse:\r\n l1=[]\r\n d=[]\r\n for i in range(len(l)):\r\n l1.append(int(l[i]))\r\n l1.sort()\r\n for i in range(len(l1)-1):\r\n d.append(abs(l1[i]-l1[i+1]))\r\n m=max(d)\r\n M=max(m/2,long-l1[len(l1)-1],l1[0])\r\n print(M)", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmax_razn = 0\r\nfor i in range(n):\r\n if i == 0:\r\n razn = a[i] - 0\r\n max_razn = max(razn, max_razn)\r\n if i == n-1:\r\n razn = l - a[i]\r\n max_razn = max(razn, max_razn)\r\n elif i <= n-1:\r\n razn = (a[i] - a[i - 1]) / 2\r\n max_razn = max(razn, max_razn)\r\n if i == n-1:\r\n razn = l - a[i]\r\n max_razn = max(razn, max_razn)\r\nprint(max_razn)", "n,l=map(int,input().split())\r\nlanterns=list(map(int,input().split()))\r\nsortedlan=[]\r\ndiff=[]\r\ni=0\r\nwhile len(lanterns)>0:\r\n sortedlan.append(min(lanterns))\r\n lanterns.remove(min(lanterns))\r\nwhile i<len(sortedlan)-1:\r\n diff.append((sortedlan[i+1]-sortedlan[i])/2)\r\n i=i+1\r\nif 0 not in sortedlan:\r\n diff.append(sortedlan[0])\r\nif l not in sortedlan:\r\n diff.append(l-sortedlan[-1])\r\nprint(max(diff))", "# cook your dish here\r\nn, l = map(int, input().split())\r\nv = list(map(float, input().split()))\r\nv.sort()\r\nd = 0.0\r\n\r\nfor i in range(n-1):\r\n if ((v[i+1] - v[i]) / 2.0) > d:\r\n d = (v[i+1] - v[i]) / 2.0\r\n\r\nif (v[0] - 0) != 0:\r\n if (v[0] - 0) > d:\r\n d = v[0] - 0\r\n\r\nif (l - v[n-1]) != 0:\r\n if (l - v[n-1]) > d:\r\n d = l - v[n-1]\r\n\r\nprint(d)\r\n", "n, l = [int(i) for i in input().split()]\r\nlns = [int(i) for i in input().split()]\r\nlns = sorted(lns)\r\ndiffs = [lns[0]]\r\nfor i in range(1, len(lns)):\r\n diffs.append((lns[i] - lns[i-1])/2)\r\ndiffs.append(l - lns[-1])\r\nprint(max(diffs))", "def mergesort(numbers,low,high):\r\n\tif (low<high):\r\n\t\tmiddle = low + (high-low)//2\r\n\t\tmiddle = int(middle)\r\n\t\tmergesort(numbers,low,middle)\r\n\t\tmergesort(numbers,middle+1,high)\r\n\t\tmerge(numbers,low,middle,high)\r\n\r\ndef merge(numbers,low,middle,high):\r\n helper=[0]*len(numbers)\r\n for i in range(low,high+1):\r\n helper[i]=numbers[i]\r\n\r\n i,j,k = low, middle+1, low\r\n while i<=middle and j <= high:\r\n if helper[i] <= helper[j]:\r\n numbers[k] = helper[i]\r\n i+=1\r\n else:\r\n numbers[k] = helper [j]\r\n j+=1\r\n k +=1\r\n while (i<=middle):\r\n numbers[k] = helper[i]\r\n k+=1\r\n i+=1\r\n while (j<=high):\r\n numbers[k] = helper[j]\r\n k+=1\r\n j+=1\r\n\r\n\r\n\r\nstreet_details = input().split()\r\nn = int(street_details[0])\r\nlength = int(street_details[1])\r\nlanterns = [int(x) for x in input().split()]\r\nmergesort(lanterns, 0, len(lanterns) - 1)\r\nmaxim = max(lanterns[0], (length - lanterns[len(lanterns) - 1]))\r\n\r\nfor i in range(len(lanterns) - 1):\r\n maxim = max(maxim, (lanterns[i+1] - lanterns[i])/2)\r\n\r\nprint(maxim)\r\n ", "n, l = [int(x) for x in input().split(' ')]\r\nlans = sorted([int(x) for x in input().split(' ')])\r\ngaps = [lans[0] - 0, l - lans[-1]]\r\nfor lan in range(n - 1):\r\n gap = lans[lan + 1] - lans[lan]\r\n gaps.append(gap / 2)\r\nprint(max(gaps))", "\r\nn,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort();l_sub=[0]*(n-1)\r\nif len(l)>1:\r\n for i in range(0,n-1):\r\n l_sub[i]=l[i+1]-l[i]\r\n print(max(l[0],y-l[-1],max(l_sub)/2))\r\nelse:\r\n print(max(l[0],y-l[0]))\r\n", "def main():\r\n n, s = [int(x) for x in input().split()]\r\n a = sorted([int(x) for x in input().split()])\r\n r, l, d = a[0], 0, a[0]\r\n for i in range(len(a) - 1):\r\n if (a[i + 1] - a[i]) / 2 > d:\r\n r, l, d = a[i + 1], a[i], (a[i + 1] - a[i]) / 2\r\n if s - a[len(a) - 1] > d:\r\n d = s - a[len(a) - 1]\r\n print(d)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "in1 = input()\r\ninl1 = in1.split(' ')\r\nn = int(inl1[0])\r\nl = int(inl1[1])\r\nin2 = input()\r\nli = in2.split(' ')\r\nlis = []\r\nfor x in li:\r\n lis.append(int(x))\r\nlis.sort()\r\nmaax = 0\r\nfor i in range(len(lis)-1):\r\n if (lis[i + 1] - lis[i])/2 > maax:\r\n maax = (lis[i + 1] - lis[i])/2\r\nif lis[0] != 0 :\r\n if lis[0] > maax:\r\n maax = lis[0]\r\nif lis[-1] != l:\r\n if l - lis[-1] > maax:\r\n maax = l - lis[-1]\r\nprint(maax)", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nasd=2*max(b[0],a[1]-b[-1])\r\nfor i in range(1,a[0]):\r\n asd=max(asd,b[i]-b[i-1])\r\nprint(asd/2)", "def min_light_radius(n, l, lantern_positions):\r\n lantern_positions.sort()\r\n\r\n max_distance = 0\r\n\r\n for i in range(n - 1):\r\n max_distance = max(max_distance, (lantern_positions[i + 1] - lantern_positions[i]) / 2)\r\n\r\n max_distance = max(max_distance, lantern_positions[0], l - lantern_positions[-1])\r\n\r\n return max_distance\r\n\r\n\r\n# Read input\r\nn, l = map(int, input().split())\r\nlantern_positions = list(map(int, input().split()))\r\n\r\n# Calculate and print the minimum light radius\r\nresult = min_light_radius(n, l, lantern_positions)\r\nprint(\"{:.10f}\".format(result))\r\n", "num=[int(x) for x in input().split()]\r\ndata=[int(x) for x in input().split()]\r\ndata.sort()\r\nmaximum=max(data[0],num[1]-data[-1])\r\nfor i in range(num[0]-1):\r\n l=(data[i+1]-data[i])/2\r\n if l>maximum:\r\n maximum=l\r\nprint('{:.10f}'.format(maximum))", "num_lanterns, length_street = [int(x) for x in input().split()]\nlanterns = [int(x) for x in input().split()]\nlanterns.sort()\nmin_distance = lanterns[0] - 0\nprevious = lanterns[0]\nfor l in lanterns[1:]:\n if (l - previous)/2 > min_distance:\n min_distance = (l - previous)/2\n previous = l\nif length_street - lanterns[-1] > min_distance:\n min_distance = length_street - lanterns[-1]\nprint(min_distance)\n", "# Read the number of lanterns and the length of the street\r\nn, l = map(int, input().split())\r\n\r\n# Read the positions of the lanterns\r\nlanterns = list(map(int, input().split()))\r\n\r\n# Sort the lantern positions\r\nlanterns.sort()\r\n\r\n# Initialize max_distance to be the maximum of the distance from the start of the street to the first lantern and the distance from the end of the street to the last lantern\r\nmax_distance = max(lanterns[0], l - lanterns[-1])\r\n\r\n# Calculate the distances between adjacent lanterns\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, (lanterns[i] - lanterns[i-1]) / 2)\r\n\r\n# Print the result with 10 decimal places\r\nprint(max_distance)\r\n\r\n", "#https://codeforces.com/problemset/problem/492/B\r\n\r\n(lanterns, street) = (int(x) for x in input().split(\" \"))\r\nlantern_position = [int(x) for x in input().split(\" \")]\r\nlantern_position = list(dict.fromkeys(lantern_position))\r\nlantern_position.sort()\r\nminimum_radius = 0\r\nif(min(lantern_position) != 0):\r\n minimum_radius = min(lantern_position)\r\nif(max(lantern_position) != street and abs(max(lantern_position) - street) > minimum_radius):\r\n minimum_radius = abs(max(lantern_position) - street)\r\n\r\nfor x in range(len(lantern_position) - 1):\r\n if((abs(lantern_position[x] - lantern_position[x +1])/2) > minimum_radius):\r\n minimum_radius = abs(lantern_position[x] - lantern_position[x+1])/2\r\n\r\nprint(minimum_radius)", "n, l = [int(x) for x in input().split()]\r\n\r\n\r\na = [int(x) for x in input().split()]\r\n\r\n\r\na.sort()\r\n\r\nfurthest = 0\r\n\r\n\r\nfor i in range(1, len(a)):\r\n furthest = max(furthest, a[i]-a[i-1])\r\n\r\nfurthestA = furthest / 2\r\n\r\nfurthestB = max(furthestA, a[0], l-a[-1])\r\n\r\nprint(furthestB)\r\n", "# 492B - Vanya and Lanterns\r\n# http://codeforces.com/problemset/problem/492/B\r\n\r\nF = int(1e9)\r\nn, L = map(int, input().split())\r\nL *= F\r\narr = [int(x) * F for x in input().split()]\r\narr.sort()\r\n\r\n\r\n# Validation function, returns true if light radius 'd' is sufficient to cover\r\n# the whole street.\r\ndef f(d):\r\n x, y = arr[0], arr[-1]\r\n if x > d or L - y > d:\r\n return False\r\n for i in range(n - 1):\r\n x, y = arr[i], arr[i + 1]\r\n if y - x > 2 * d:\r\n return False\r\n\r\n return True\r\n\r\n\r\nlo = 0\r\nhi = 1 * F\r\nwhile not f(hi):\r\n hi *= 2\r\n\r\nwhile hi - lo > 5:\r\n mid = lo + (hi - lo) // 2\r\n if f(mid):\r\n hi = mid\r\n else:\r\n lo = mid\r\n\r\nwhile not f(lo):\r\n lo += 1\r\n\r\nx = lo / 1e9\r\nprint(\"{:.10f}\".format(x))\r\n", "n,l = (int(i) for i in input().split())\r\na = sorted([int(i) for i in input().split()])\r\nif n == 1:\r\n print(max(a[0], l - a[0]))\r\nelse:\r\n ans = a[1] - a[0]\r\n for i in range(1, n-1):\r\n ans = max(ans, a[i+1] - a[i])\r\n ans = max(ans/2, a[0], l - a[-1])\r\n print(ans)", "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\nN, L = get_ints()\r\nlanterns = get_int_list()\r\nlanterns = sorted(lanterns)\r\n\r\nmin_length = lanterns[0]\r\n\r\nfor i in range(1, N):\r\n current_length = lanterns[i] - lanterns[i-1]\r\n min_length = max(current_length/2, min_length)\r\n\r\nmin_length = max(min_length, L - lanterns[N - 1])\r\n\r\nprint(min_length)\r\n", "n, l = input().split()\nn = float(n)\nl = float(l)\n\npos = input().split()\npos = list(map(lambda x: float(x), pos))\npos.sort()\n\nd = 0\nfor i in range(len(pos) - 1):\n d = float(max(d, (float(pos[i+1]) - float(pos[i]))/2))\n\nprint(max(float(pos[0]), d, float(l) - float(pos[-1])))\n\n\n", "a , b = map(int , input().split())\r\nlan = list(map(int , input().split()))\r\nlan.sort()\r\nma = max(lan[0] , b - lan[a - 1])\r\nfor i in range(a - 1):\r\n if ma < (lan[i + 1] - lan[i]) / 2:\r\n ma = (lan[i + 1] - lan[i]) / 2\r\nprint(ma)", "n, l = map(int, input().split())\r\nmaxx = 0\r\na = sorted(list(map(int, input().split())))\r\nfor i in range(1, n):\r\n maxx = max(maxx, a[i] - a[i - 1])\r\n\r\nprint(max(maxx / 2, a[0], l - a[-1]))\r\n", "n, l = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\n\r\na.sort()\r\n\r\nmaxDiff = 0\r\n\r\nfor i in range(n-1):\r\n if a[i+1] - a[i] > maxDiff:\r\n maxDiff = a[i+1] - a[i]\r\n\r\nif a[0] > maxDiff/2:\r\n print(max(a[0],l-a[-1]))\r\nelif l - a[-1] > maxDiff/2:\r\n print(max(a[0],l-a[-1]))\r\nelse:\r\n print(maxDiff/2)", "n,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nm=0\r\nfor i in range(1,len(a)):\r\n m=max(m,a[i]-a[i-1])\r\nm=m/2\r\nif 0 not in a:\r\n m=max(m,a[0])\r\nif l not in a:\r\n m=max(m,l-a[n-1])\r\nprint(str(float(m))+9*'0')", "#author 沈天健 2300011417\r\nn,l=map(int,input().split())\r\nposition=list(map(int,input().split()))\r\nposition.sort()\r\nans=0\r\nfor i in range(1,n):\r\n ans=max(ans,(position[i]-position[i-1])/2)\r\nprint(max(ans,position[0],l-position[n-1]))\r\n", "n, l = map(int, input().split())\r\nlanterns = sorted(map(int, input().split()))\r\n\r\nmax_gap = 0\r\n\r\nfor i in range(1, n):\r\n max_gap = max(max_gap, lanterns[i] - lanterns[i - 1])\r\n\r\nradius = max(max(lanterns[0], l - lanterns[n - 1]), max_gap / 2)\r\n\r\nprint(\"{:.10f}\".format(radius))", "n,l=map(int,input().split())\r\nsp=[int(i) for i in input().split()]\r\nsp.sort()\r\nsp.append(l)\r\nsp.append(int('-1'))\r\nsp1=sp.copy()\r\nfor i in range(1,len(sp)):\r\n sp[i]=sp1[i-1]\r\nsp[0]=0\r\nmx=-1\r\nfor i in range(1,len(sp)):\r\n if i>1 and i<len(sp)-1:\r\n dif=float(sp[i]-sp[i-1])/2\r\n else:\r\n dif = float(sp[i] - sp[i - 1])\r\n if dif>mx:\r\n mx=dif\r\nmxprint = \"{:.11f}\".format(mx)\r\nprint(mxprint)", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmax_distance = max(a[0], l - a[n - 1]) * 2\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, a[i] - a[i - 1])\r\nmin_radius = max_distance / 2\r\nprint(min_radius, end='')", "n, l = list(int(num) for num in input().split())\r\na = list(int(num) for num in input().split())\r\n\r\na.sort()\r\n\r\nd_2 = 2 * a[0]\r\nif d_2 < 2 * (l - a[n - 1]):\r\n d_2 = 2 * (l - a[n - 1])\r\nfor i in range(1, n):\r\n if d_2 < a[i] - a[i - 1]:\r\n d_2 = a[i] - a[i - 1]\r\n\r\nprint(d_2 / 2)", "p,q=map(int,input().split())\r\nlan=list(map(int,input().split()))\r\nlan.sort()\r\nmax_dist=max(lan[0],q-lan[-1]) \r\nfor i in range(1,p):\r\n max_dist=max(max_dist,(lan[i]-lan[i-1])/2)\r\nprint(\"{:.10f}\".format(max_dist))\r\n", "def solution():\r\n n,l = map(int,input().split())\r\n a =list(map(int,input().split()))\r\n ans = 0\r\n a.sort()\r\n const1 = a[0] - 0\r\n const2 =l - a[-1]\r\n mxdis = a[0] - 0\r\n for i in range(1,n):\r\n mxdis = max(mxdis,a[i]-a[i-1])\r\n print(max(mxdis/2,const1,const2))\r\nsolution()", "n, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nm = -1\r\nfor ind, i in enumerate(a[:n-1]):\r\n if a[ind+1] - i > m:\r\n m = a[ind+1] - i\r\nprint(max(m/2,max(a[0] - 0, l - a[n-1])))", "n, l = map(int, input().split())\nlights = sorted(list(map(int, input().split())))\ndist = [0]\nfor i in range(len(lights) - 1):\n dist.append(lights[i + 1] - lights[i])\nfirst = lights[0]\nlast = l - lights[-1]\nans = [first, last, max(dist)/2]\nans.sort()\nprint(ans[-1])", "n,x = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\nif l[0] == 0 and l[-1] == x:\r\n pass\r\nelif l[0] == 0 and l[-1] != x:\r\n l += [(x-l[-1]) + x]\r\nelif l[0] != 0 and l[-1] == x:\r\n l = [-l[0]] + l\r\nelse:\r\n l = [-l[0]] + l + [(x-l[-1]) + x]\r\njudge_lst = []\r\nfor i in range(len(l)-1):\r\n num = l[i+1] - l[i]\r\n judge_lst.append(num)\r\nmax_num = max(judge_lst)\r\nanswer = max_num/2\r\nprint('{:.10f}'.format(answer))", "n,l = [eval(i) for i in input().split()]\r\n\r\ncoord = [eval(i) for i in input().split()]\r\ncoord.sort()\r\nd = []\r\n\r\ndef write_d(n):\r\n for i in range(n):\r\n if i==n-1:\r\n break\r\n d.append((coord[i+1]-coord[i])/2)\r\n\r\nif coord[0] == 0:\r\n write_d(n)\r\nelse:\r\n d.append(coord[0])\r\n write_d(n)\r\nif coord[n-1] != l:\r\n d.append(l - coord[n-1])\r\n\r\nprint(max(d))\r\n\r\n", "m=0\r\na1=input()\r\na1=a1.split()\r\na=int(a1[1])\r\nb1=input()\r\nb1=b1.split()\r\nb=[]\r\nfor i in b1:\r\n b.append(int(i))\r\nb=sorted(b) \r\nfor i in range(len(b)-1):\r\n m=max(m,abs(b[i]-b[i+1])/2)\r\nif 0 not in b:\r\n m=max(b[0],m) \r\nif a not in b: \r\n m=max(a-b[-1],m)\r\nprint(m/1)", "n, l = map(int, input().split()) # Number of lanterns and street length\r\nlanterns = list(map(int, input().split())) # Positions of the lanterns\r\n\r\nlanterns.sort() # Sort lantern positions in ascending order\r\n\r\nmax_gap = 0\r\n\r\n# Calculate the maximum gap between adjacent lanterns\r\nfor i in range(1, n):\r\n max_gap = max(max_gap, lanterns[i] - lanterns[i - 1])\r\n\r\n# Calculate the distances from the first and last lanterns to the ends of the street\r\ndistance_to_first_lantern = lanterns[0]\r\ndistance_to_last_lantern = l - lanterns[n - 1]\r\n\r\n# Calculate the minimum d needed\r\nd = max(max_gap / 2, distance_to_first_lantern, distance_to_last_lantern)\r\n\r\nprint(f\"{d:.10f}\")\r\n", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nt=0\r\nfor i in range(1,len(l)):\r\n t=max(l[i]-l[i-1],t)\r\nt=max(t/2,l[0],b-l[-1])\r\nprint(\"{:.10f}\".format(t))", "\"\"\"\n492B | Vanya and Lanterns: binary search, implementation, math, sortings\n\"\"\"\n\ndef vanya_and_lanterns():\n n, l = map(int, input().split(' '))\n a = sorted(map(int, input().split(' ')))\n m = 0\n for i in range(1, n):\n m = max(m, a[i] - a[i - 1])\n print(max(m / 2, max(a[0] - 0, l - a[-1])))\n\n\nif __name__ == '__main__':\n vanya_and_lanterns()", "n, l = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nd = 0\r\nfor i in range(n-1):\r\n d = max(d, (a[i+1] - a[i]) / 2)\r\n\r\nd = max(d, a[0] - 0, l - a[-1])\r\nprint(round(d, 9))\r\n", "i=lambda:map(int,input().split())\nn,l=i()\na=sorted(i())\nprint(max(r-l for l,r in zip([-a[0]]+a,a+[2*l-a[-1]]))/2)\n \t\t\t\t\t\t\t \t \t \t \t\t\t \t\t \t \t", "n, l = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nd = 0\r\nfor i in range(len(a) - 1):\r\n d = max(d, a[i + 1] - a[i])\r\nd1 = a[0] - 0\r\nd2 = l - a[n-1]\r\nf = max(float(d/2), max(float(d1), float(d2)))\r\nprint(round(f, 10))\r\n", "n, l = map(int, input().split())\r\nf = [int(x) for x in input().split()]\r\nf = sorted(f)\r\nmaxl = max(f[0], l - f[-1])\r\nflag = False\r\nfor i in range(len(f)-1):\r\n\r\n if maxl is None:\r\n maxl = f[i+1]-f[i]\r\n else:\r\n if not flag:\r\n if (f[i+1]-f[i]) > maxl*2:\r\n maxl = f[i+1]-f[i]\r\n flag = True\r\n if flag:\r\n maxl = max(maxl, f[i+1]-f[i])\r\nif flag:\r\n print(maxl/2)\r\nelse:\r\n print(maxl)", "n, l = [int(x) for x in input().split()]\r\nlanterns = [int(x) for x in input().split()]\r\n\r\nlanterns.sort()\r\n\r\nm_distance = max(lanterns[0], l - lanterns[-1]) * 2\r\ni = 0\r\n\r\nwhile i < n - 1:\r\n tmp = lanterns[i+1] - lanterns[i]\r\n if tmp > m_distance:\r\n m_distance = tmp\r\n i += 1\r\n\r\nprint(m_distance / 2)", "lamps_range = list(map(int, input().split()))\r\nlamps = list(map(int, input().split()))\r\nlamps.sort()\r\nd = max(lamps[0], lamps_range[1] - lamps[-1])\r\nfor i in range(len(lamps) - 1):\r\n if d < (abs(lamps[i] - lamps[i+1])/2):\r\n d = abs(lamps[i] - lamps[i+1])/2\r\nprint(d)", "n, l = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nd.sort()\r\n\r\nmd = 0\r\nfor i in range(n - 1):\r\n x = d[i + 1] - d[i]\r\n if md < x:\r\n md = x\r\n\r\nfd = d[0]\r\nld = l - d[-1]\r\n\r\nres = max(md / 2.0, fd, ld)\r\n\r\nprint(\"{:.10f}\".format(res))\r\n", "import decimal\r\nfrom decimal import Decimal as D\r\n\r\ndef solve():\r\n n, l = map(int, input().split())\r\n v = list(map(D, input().split()))\r\n v.sort()\r\n\r\n ans = max(v[0], l - v[n - 1])\r\n\r\n for i in range(1, n):\r\n t = (v[i] - v[i - 1]) / D(2)\r\n ans = max(ans, t)\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n decimal.getcontext().prec = 30 # Set the precision according to your requirement\r\n t = 1\r\n # t = int(input())\r\n while t > 0:\r\n solve()\r\n t -= 1\r\n", "a = [int(a) for a in input().split(\" \")]\n\nlanterns = a[0]\nstreetlen = a[1]\n\nb = [int(a) for a in input().split(\" \")]\nb.sort()\n\ndiff = []\ndiff.append(b[0])\ndiff.append( streetlen - b[-1])\n\nfor trums in range(lanterns -1):\n diff.append((b[trums+1] - b[trums])/2)\n\ndiff.sort()\nprint(diff[-1])\n\n\n \n ", "n,d=map(int,input().split())\r\nli=[int(i) for i in input().split()]\r\nli.sort()\r\nmaxx=0\r\nfor i in range(n-1):\r\n if li[i+1]-li[i]>maxx:\r\n maxx=li[i+1]-li[i]\r\nmaxx=maxx/2\r\nleft=li[0]\r\nright=d-li[n-1]\r\nmaxx=max(left,right,maxx)\r\nprint(maxx)", "n,l = map(int,input().split())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\nma = -1\r\nfor i in range(1,n):\r\n if (a[i] - a[i - 1])/2 > ma:\r\n ma = (a[i] - a[i - 1])/2\r\nif a[-1] != l:\r\n if l - a[-1] > ma:\r\n ma = l - a[-1]\r\nif a[0] != 0:\r\n if a[0] > ma:\r\n ma = a[0]\r\nprint(\"%.10f\" % ma)", "sss = input().split()\r\nn = int(sss[0])\r\nl = int(sss[1])\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(0, n-1):\r\n if a[i+1]-a[i] > ans:\r\n ans = a[i+1]-a[i]\r\nans /= 2\r\nif a[0] > ans:\r\n ans = a[0]\r\nif l-a[-1] > ans:\r\n ans = l-a[-1]\r\nprint(ans)\r\n", "n,l= map(int, input().split())\r\narr= list(map(int, input().split()))\r\narr.sort()\r\nmaxi= max(arr[0]-0,l-arr[-1])\r\nfor i in range(1,n):\r\n maxi= max(maxi, (arr[i]-arr[i-1])/2)\r\nprint(maxi)", "n,l = map(int,input().split())\r\nlst = sorted(list(map(int,input().split())))\r\nif lst[0] == 0 and lst[-1] == l:\r\n pass\r\nelif lst[0] == 0 and lst[-1] != l:\r\n lst += [(l-lst[-1]) + l]\r\nelif lst[0] != 0 and lst[-1] == l:\r\n lst = [-lst[0]] + lst\r\nelse:\r\n lst = [-lst[0]] + lst + [(l-lst[-1]) + l]\r\njudge_lst = []\r\nfor i in range(len(lst)-1):\r\n num = lst[i+1] - lst[i]\r\n judge_lst.append(num)\r\nmax_num = max(judge_lst)\r\nanswer = max_num/2\r\nprint('{:.10f}'.format(answer))", "a_ = input().split()\r\na_ = [int(x) for x in a_]\r\n\r\nzoznam = input().split()\r\nzoznam = [int(x) for x in zoznam]\r\n\r\nzoznam.sort()\r\nd=0\r\nfor x in range(0,a_[0]-1):\r\n\r\n if (zoznam[x+1]-zoznam[x])/2 >d :\r\n d=(zoznam[x+1]-zoznam[x])/2\r\nif zoznam[0] !=0 and zoznam[0]>d :\r\n d = zoznam[0]\r\nif zoznam[a_[0]-1] !=a_[1] and (a_[1]-zoznam[a_[0]-1])>d :\r\n d = (a_[1]-zoznam[a_[0]-1])\r\nprint(str(d))\r\n\r\n\r\n", "n,l=map(int, input().split())\r\nlanterns=sorted(map(int, input().split()))\r\nmax_distance=0\r\nfor i in range(n-1):\r\n max_distance=max(max_distance,lanterns[i+1]-lanterns[i])\r\nmax_distance=max(max_distance/2,lanterns[0],l-lanterns[-1])\r\nprint(\"{:.9f}\".format(max_distance))", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ntemp1=arr[0]\r\ntemp2=m-arr[-1]\r\nmaxdist=-1\r\nfor i in range(1,n):\r\n dist=arr[i]-arr[i-1]\r\n maxdist=max(dist,maxdist)\r\nprint(max(maxdist/2,max(temp1,temp2)))", "n,l=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nc=0\r\nfor x in range(n-1):\r\n if a[x+1]-a[x]>c:\r\n c=a[x+1]-a[x]\r\nc/=2\r\nif a[0]>c:\r\n c=a[0]\r\nif l-a[n-1]>c:\r\n c=l-a[n-1]\r\nprint(c)", "s = input().split()\nl = [int(i) for i in input().split()]\nl.sort()\nle = len(l)\nm = 0\ni = 1\nwhile i < len(l):\n t = (l[i] - l[i - 1]) / 2\n if m < t:\n m = t\n i += 1 \nprint('{:.10f}'.format(max(m , l[0], int(s[1]) - l[-1])))\n\t\t \t \t\t\t \t\t \t \t\t \t \t \t", "n,l = [int(i) for i in input().split()]\n\na = sorted([int(i) for i in input().split()])\n\nmx = 0\nfor i in range(1, len(a)):\n mx = max(mx, (a[i]-a[i-1])/2)\n\nprint(max(mx, a[0]-0, l-a[n-1]))\n", "n, l = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\n \r\nmx = max(a[0], l-a[-1])\r\nfor i in range(n-1):\r\n x = (a[i+1] - a[i])/2\r\n if x > mx:\r\n mx = x\r\nprint(mx)", "n,l=map(int,input().split())\r\np=list(map(int,input().split()))\r\np.sort()\r\nr=max(p[0],l-p[-1])*2\r\nfor i in range(n-1):\r\n r=max(r,p[i+1]-p[i])\r\nprint(r/2)", "def minimum_light_radius(n, l, a):\r\n a.sort()\r\n max_distance = max(a[0], l - a[-1])\r\n for i in range(1, n):\r\n max_distance = max(max_distance, (a[i] - a[i - 1]) / 2)\r\n return max_distance\r\n\r\nn, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\n # Calculate and print the minimum light radius\r\nresult = minimum_light_radius(n, l, a)\r\nprint(\"{:.10f}\".format(result))", "# LUOGU_RID: 122469814\na,b=map(int,input().split());a=list(map(int,input().split()));a.sort();a=[-a[0]]+a+[b*2-a[-1]];b=[]\nfor i in range(1,len(a)):b.append(a[i]-a[i-1])\nprint(max(b)/2)", "n,l = map(int,input().split())\r\n\r\ncord = list(map(int, input().split()))\r\n\r\nanslist = []\r\ncord = sorted(cord)\r\nr = len(cord)\r\nx=0\r\n\r\nif(cord[0] != 0):\r\n anslist.append(cord[0])\r\n x+=1\r\nif(cord[r-1] != l):\r\n anslist.append(l - cord[r-1])\r\n x+=1\r\n\r\nfor i in range(0,r-1):\r\n if(cord[i+1] != cord[i]):\r\n anslist.append((cord[i+1] - cord[i])/2)\r\n x+=1\r\n \r\nanslist = sorted(anslist)\r\n \r\nprint(anslist[x-1])\r\n\r\n", "import sys\n\nn, l = map(int, sys.stdin.readline().split())\np = list(map(int, sys.stdin.readline().split()))\np.sort()\nr = max(p[0], l - p[n - 1]) * 2\nfor i in range(n - 1):\n r = max(r, p[i + 1] - p[i])\nprint(\"{:.20f}\".format(r / 2))\n\t \t\t \t\t \t\t\t \t \t\t \t\t\t\t\t\t \t\t", "n, l = map(int, input().split())\r\nlanterns = list(map(int, input().split()))\r\n\r\nlanterns.sort()\r\n\r\nmax_distance = 0\r\nfor i in range(1, n):\r\n max_distance = max(max_distance, lanterns[i] - lanterns[i - 1])\r\n\r\ndistance_from_start = lanterns[0] - 0\r\ndistance_from_end = l - lanterns[-1]\r\n\r\nd = max(max_distance / 2, distance_from_start, distance_from_end)\r\n\r\nprint(\"{:.10f}\".format(d))\r\n", "def f(data,l):\r\n data.sort()\r\n max_distance = max(data[0],l-data[-1])\r\n for i in range(1,len(data)):\r\n if (data[i]-data[i-1])/2 > max_distance:\r\n max_distance = (data[i]-data[i-1])/2\r\n return max_distance\r\n\r\n\r\n\r\nnl = input()\r\nnl = [int(i) for i in nl.split(\" \")]\r\nai = input()\r\nai = [int(i) for i in ai.split(\" \")]\r\nprint(f(ai,nl[-1]))", "n, l = input().split()\r\nn = int(n)\r\nl = int(l)\r\n\r\narr = []\r\nx = input().split()\r\nfor i in range(n):\r\n arr.append(int(x[i]))\r\narr = sorted(arr)\r\nans = -1\r\nfor i in range(n-1):\r\n ans = max(ans, arr[i+1] - arr[i])\r\nans = max(ans/2, arr[0], l - arr[n-1])\r\nprint(ans)", "n,l=map(int, input().split())\r\nlamp_positions=sorted(list(map(int, input().split())))\r\n\r\nmax_dist=0\r\n\r\nfor i in range(n):\r\n if i==0:\r\n max_dist=max(max_dist,lamp_positions[i])\r\n if i==n-1:\r\n max_dist=max(max_dist,l-lamp_positions[i])\r\n else:\r\n max_dist=max(max_dist,(lamp_positions[i+1]-lamp_positions[i])/2)\r\n\r\nmin_radius=max_dist\r\n\r\nprint(min_radius)\r\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n, l = map(int, input().split())\n a = [int(x) for x in input().split()]\n a.sort()\n max_d = 0\n for i in range(1, len(a)):\n max_d = max(a[i] - a[i - 1], max_d)\n print(max([a[0], max_d / 2, l - a[-1]]))\n\n\nif __name__ == \"__main__\":\n main()\n", "n, l = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nb = []\r\nfor i in range(n - 1):\r\n b.append((a[i + 1] - a[i]) / 2)\r\nb.append(a[0])\r\nb.append(l - a[-1])\r\nprint(max(b))", "n, l = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nans = 0\nans = max(ans, a[0])\nfor i in range(len(a)-1):\n ans = max(ans, (a[i+1]-a[i])/2)\nans = max(ans, l-a[-1])\nprint(ans)", "n,l = map(int,input().split())\r\nls=list(map(int,input().split()))\r\nls.sort()\r\nd = 0\r\nif 0 not in ls :\r\n d=ls[0]\r\nif (l not in ls ) and (l-ls[-1])>d :\r\n d=l-ls[-1]\r\nfor i in range (0,len(ls)-1):\r\n t=(ls[i+1]-ls[i])/2\r\n if t > d :\r\n d=t\r\nprint('{:.10f}'.format(d))" ]

[ "from collections import defaultdict\r\nk = int(input())\r\ns = input()\r\nd = defaultdict(list)\r\nword = list(s*k)\r\nfor i in range(len(word)):\r\n d[word[i]].append(i)\r\nn = int(input())\r\nfor _ in range(n):\r\n a,b = input().split()\r\n a = int(a)\r\n change = d[b].pop(a-1)\r\n word[change] = ''\r\nprint(''.join(word))", "k=int(input())\r\ne={}\r\ns=input()\r\nt=list(s*k)\r\nfor i in range(len(t)):\r\n if t[i] in e:e[t[i]]+=[i]\r\n else:e[t[i]]=[i]\r\nfor i in range(int(input())):\r\n q,w=input().split()\r\n q=int(q)-1\r\n t[e[w][q]]=\"\"\r\n e[w].pop(q)\r\nprint(\"\".join(t))", "from collections import defaultdict\r\nk = int(input())\r\ns = list(input() * k)\r\np = defaultdict(list)\r\nfor i in range(len(s)): p[(s[i])].append(i)\r\nfor _ in range(int(input())):\r\n x, c = input().split()\r\n idx = p[c].pop(int(x)-1)\r\n s[idx] = \"\"\r\nprint(\"\".join(s))\r\n", "k = int(input())\nstring = list(input()) * k\n\nd = {}\n\nfor i, letter in enumerate(string):\n if letter not in d:\n d[letter] = [i]\n else:\n d[letter].append(i)\n\nn = int(input())\nfor i in range(n):\n inp = input().split()\n p, c = int(inp[0]), inp[1]\n index = d[c][p-1]\n string[index] = '$'\n d[c].pop(p-1)\n\nprint(*filter(lambda x: x != '$', string), sep='')\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\nimport datetime\r\nfrom typing import List\r\nsys.setrecursionlimit(3001)\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nk = int(input())\r\ns = input().strip()\r\ns *= k\r\npos = collections.defaultdict(list)\r\nfor i, c in enumerate(s):\r\n pos[c].append(i)\r\nvis = [0]*len(s)\r\nm = int(input())\r\nfor _ in range(m):\r\n d, c = input().split()\r\n d = int(d)-1\r\n vis[pos[c][d]] = 1\r\n pos[c].pop(d)\r\nfor i in range(len(s)):\r\n if vis[i] == 0:\r\n print(s[i], end=\"\")\r\nprint()\r\n", "# _\r\n#####################################################################################################################\r\n\r\nfrom itertools import accumulate\r\nfrom operator import mul\r\n\r\n\r\ndef main():\r\n return finalName(int(input()), list(input()), int(input()))\r\n\r\n\r\ndef finalName(nCopies, origName, nChanges):\r\n origLength, multiplier = len(origName), nCopies - 1\r\n repetitionsOf = {}\r\n for i in range(len(origName)):\r\n if origName[i] in repetitionsOf:\r\n repetitionsOf[origName[i]].extend(accumulate(mul((origLength, ), multiplier), initial=i))\r\n else:\r\n repetitionsOf[origName[i]] = list(accumulate(mul((origLength, ), multiplier), initial=i))\r\n\r\n for letter in repetitionsOf:\r\n repetitionsOf[letter].append(0)\r\n repetitionsOf[letter].sort()\r\n\r\n origName *= nCopies\r\n for _ in range(nChanges):\r\n occurrence, letter = input().split()\r\n origName[repetitionsOf[letter].pop(int(occurrence))] = ''\r\n\r\n return ''.join(origName)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n # open('output.txt', 'w').write(main())\r\n", "from collections import defaultdict\r\n\r\n\r\nk = int(input())\r\ns = list(input() * k)\r\np = defaultdict(list)\r\nfor i in range(len(s)):\r\n p[(s[i])].append(i)\r\nfor _ in range(int(input())):\r\n x, c = input().split()\r\n x = int(x)\r\n\r\n s[p[(c)].pop(int(x) - 1)] = \"\"\r\n\r\nprint(\"\".join(s))\r\n", "\n\n\n\nk = int(input())\ns = input()\nfs = [*(s*k)]\n\nindices = []\nfor _ in range(26) :\n indices.append([])\n\nfor i in range(len(fs)) :\n indices[ord(fs[i]) - ord(\"a\")].append(i)\n\nn = int(input())\nwhile n > 0 :\n \n op = input().split()\n oc = int(op[0])\n l = op[1]\n \n \n fs[indices[ord(l) - ord(\"a\")].pop(oc - 1)] = \"\"\n \n n -= 1\n \n \nprint(\"\".join(fs))\n \n \n \n\n\n\t \t \t\t\t \t \t \t \t\t\t \t \t \t", "n = int(input())\r\ns = list(input()) * n\r\n# print(s)\r\nd = dict()\r\nfor i in range(len(s)):\r\n if s[i] not in d:\r\n d[s[i]] = [i]\r\n else:\r\n d[s[i]].append(i)\r\n# print(d)\r\nm = int(input())\r\nfor i in range(m):\r\n o, c = input().split()\r\n s[d[c].pop(int(o) - 1)] = ''\r\n# print(s)\r\nprint(''.join(s))\r\n", "# cook your dish here\r\nn=int(input())\r\ns=list(input())*n\r\nd={}\r\nfor i in range(len(s)):\r\n if s[i] not in d:\r\n d[s[i]]=[i]\r\n else:\r\n d[s[i]].append(i)\r\nm=int(input())\r\nfor i in range(m):\r\n o,c=input().split()\r\n s[d[c].pop(int(o)-1)]=''\r\nprint(''.join(s))", "k = int(input())\ns = input()\nn = int(input())\nfullStr = list(s*k)\nindicies = {}\nrms = []\nfor i in range(len(fullStr)) :\n letter = fullStr[i]\n if letter in indicies.keys() :\n indicies[letter].append(i)\n else :\n indicies[letter] = [i]\n\nfor i in range(n):\n j, c = input().split()\n j = int(j)\n rms.append( indicies[c].pop(j-1) )\n\nfor i in range(len(rms)) :\n fullStr[rms[i]] = \"\"\n \n \n# print(rms)\nprint(\"\".join(fullStr))\n\n\n\t \t\t\t\t\t\t \t \t \t \t\t\t\t \t", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nk = int(input())\r\ns = list(input()[:-1])\r\nd = []\r\nfor _ in range(k):\r\n d.extend(list(s))\r\n\r\nq = defaultdict(list)\r\nfor i, j in enumerate(d):\r\n q[j].append(i)\r\n\r\nfor i in range(int(input())):\r\n a, b = input()[:-1].split()\r\n a = int(a)-1\r\n d[q[b].pop(a)] = ''\r\n\r\nd = [i for i in d if i != '']\r\nprint(''.join(map(str, d)))", "def read_int():\r\n return int(input())\r\ndef read_ints():\r\n return [int(x) for x in input().split()]\r\n\r\ndef lucky_numbers(n):\r\n if n == 1:\r\n return ['4', '7']\r\n res = []\r\n for x in lucky_numbers(n - 1):\r\n res.append('4' + x)\r\n res.append('7' + x)\r\n return res\r\n\r\ndef super_lucky(n):\r\n return [int(x) for x in lucky_numbers(n) if x.count('4') == x.count('7')]\r\n\r\ndef solve():\r\n k = read_int()\r\n s = input()\r\n l = len(s)\r\n chars = [[] for _ in range(26)]\r\n for i in range(len(s)):\r\n c = ord(s[i]) - ord('a')\r\n chars[c].append(i)\r\n for c in range(26):\r\n positions = chars[c][:]\r\n for i in range(1, k):\r\n chars[c] += [x + i * l for x in positions]\r\n \r\n n = read_int()\r\n for _ in range(n):\r\n i, c = input().split(' ')\r\n i = int(i) - 1\r\n c = ord(c) - ord('a')\r\n chars[c].pop(i)\r\n \r\n ans = [None] * l * k\r\n for c in range(26):\r\n letter = chr(ord('a') + c)\r\n for i in chars[c]:\r\n ans[i] = letter\r\n return ''.join([x for x in ans if x != None])\r\n\r\nprint(solve())\r\n ", "n = int(input())\r\nt = input()\r\nl = len(t)\r\nm = int(input())\r\n\r\nq = {c: [] for c in 'abcdefghijklmnopqrstuvwxyz'}\r\nfor j, c in enumerate(t):\r\n q[c].append(j)\r\nq = {c: [i + j for i in range(0, n * l, l) for j in q[c]] for c in q}\r\nt = n * list(t)\r\nfor i in range(m):\r\n j, c = input().split()\r\n t[q[c].pop(int(j) - 1)] = ''\r\n\r\nprint(''.join(t))\r\n " ]

[ "import sys,math,itertools\r\nfrom collections import Counter,deque,defaultdict\r\nfrom bisect import bisect_left,bisect_right \r\nfrom heapq import heappop,heappush,heapify, nlargest\r\nfrom copy import deepcopy\r\nmod = 10**9+7\r\nINF = float('inf')\r\ndef inp(): return int(sys.stdin.readline())\r\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\r\ndef inpl_1(): return list(map(lambda x:int(x)-1, sys.stdin.readline().split()))\r\ndef inps(): return sys.stdin.readline()\r\ndef inpsl(x): tmp = sys.stdin.readline(); return list(tmp[:x])\r\ndef err(x): print(x); exit()\r\n\r\nn = inp()\r\na = [0] + inpl() + [10**6]\r\nres = INF\r\nfor i in range(n+1):\r\n res = min(res, max(a[i]-1,10**6-a[i+1]))\r\nprint(res)", "class food():\r\n def __init__(self):\r\n x = True\r\n\r\nn = int(input())\r\nprices = [int(i) for i in input().split()]\r\n\r\nverificador = [None]*1000000\r\n\r\nfor i in prices:\r\n verificador[i-1] = food()\r\n\r\npEu = 0\r\npAmigo = 1000000 - 1\r\ntempo = 0\r\n\r\nif(type(verificador[pEu]) is food):\r\n n-=1\r\n\r\nif(type(verificador[pAmigo]) is food):\r\n n-=1\r\n\r\nwhile( n > 0 ):\r\n pEu += 1\r\n pAmigo -= 1\r\n tempo +=1\r\n if(type(verificador[pEu]) is food):\r\n n-=1\r\n if(type(verificador[pAmigo]) is food):\r\n n-=1\r\n\r\nprint(tempo)\r\n\r\n\r\n \r\n\r\n", "n = int(input())\r\nprint(max([min(int(x)-1, 10**6-int(x)) for x in input().split()]))", "def solve():\r\n n=int(input());a=list(map(int,input().split()))\r\n me,him=1,1e6\r\n ans=0\r\n items=0\r\n i,j=0,n-1\r\n while items<n:\r\n if me>=him:print(ans+1);return\r\n if me==a[i]:i+=1;items+=1\r\n if him==a[j]:j-=1;items+=1\r\n if items>=n:print(ans);return\r\n me+=1;him-=1;ans+=1\r\n \r\nsolve()", "n = int(input())\r\na = [int(j) for j in input().split()]\r\nresult = 0\r\nfor i in range(n):\r\n if a[i] <= 500000:\r\n result = max(result, a[i] - 1)\r\n else:\r\n result = max(result, (10 ** 6) - a[i])\r\nprint(result)\r\n", "n=int(input())\r\nx=input().split(' ')\r\nfor i in range(n):\r\n x[i]=int(x[i])\r\nx.sort()\r\n\r\nl = []\r\nfor i in range(0, len(x)):\r\n l.append(min(x[i]-1, 1000000-x[i]))\r\n\r\nprint(max(l))\r\n", "# number of elements\r\nn = int(input())\r\n\r\n# Below line read inputs from user using map() function\r\npositions = list(map(int, input().strip().split()))[:n]\r\n\r\n#global variable\r\nme = meVAR = 1\r\nmyFrnd = myFrndVAR = 1000000 #10^6\r\nitr = 0\r\n\r\nwhile itr<len(positions):\r\n #print(\"this is itr : {}\".format(itr))\r\n meVAR=positions[itr]-me\r\n myFrndVAR=myFrnd-positions[itr]\r\n if meVAR>myFrndVAR:\r\n break\r\n itr+=1\r\n#print(itr) # the first itr that not follows me<frnd OR itr=len_of_position_list\r\n\r\n########################## upper portion done ###################################3\r\n\r\npositions[itr:]=reversed(positions[itr:])\r\n#print(positions)\r\n\r\n\r\n########################## Computing Required Seconds ###############################\r\n\r\nminSecondsME=0\r\nminSecondsFrnd=0\r\nfor indx, value in enumerate(positions):\r\n #print(indx,value)\r\n if indx<itr:\r\n minSecondsME += (value-me)\r\n me = value\r\n else:\r\n minSecondsFrnd += (myFrnd-value)\r\n myFrnd=value\r\n\r\n#print(minSecondsME)\r\n#print(minSecondsFrnd)\r\nresult=max(minSecondsME,minSecondsFrnd)\r\nprint(result)\r\n\r\n", "n = int(input())\r\nA = [int(i) for i in input().split()]\r\n\r\nA = [ min(A[i]-1, 10**6 - A[i]) for i in range(n)]\r\nprint(max(A))\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor i in range(len(arr)):\r\n\tans=max(ans,min(arr[i]-1,1000000-arr[i]))\r\nprint(ans)", "n = int(input())\r\nnumbers = [int(i) for i in input().split()]\r\nmax_n = -1\r\nfor i in range(len(numbers)):\r\n if numbers[i] > 5 * (10 ** 5):\r\n numbers[i] = 10 ** 6 - numbers[i] + 1\r\n if numbers[i] > max_n:\r\n max_n = numbers[i]\r\nprint(max_n - 1) \r\n", "# LUOGU_RID: 99429199\nn = int(input())\r\na = [int(v) for v in input().split()]\r\nl = 1\r\nr = 1000000\r\nans = r - a[0]\r\nfor i in range(n):\r\n if i == n - 1:\r\n ans = min(ans, a[i] - 1)\r\n else:\r\n ans = min(ans, max(a[i] - 1, r - a[i+1]))\r\nprint(ans)", "N = int(input())\r\nA = list(map(int, input().split()))\r\n\r\ncurM = 0\r\n\r\nfor a in A:\r\n curM = max(curM, min(a - 1, 1000000 - a))\r\nprint(curM) ", "a, b = 1, (10**6)\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\n\r\nout=min(x[n-1]-a, b-x[0])\r\n\r\nfor i in range(0, n-1):\r\n j = max(x[i]-a, b-x[i+1])\r\n out = min(out, j)\r\n\r\nprint(out) \r\n", "n = int(input())\r\nprizes = list(map(int, input().split(\" \")))\r\nmaxDistance = -1\r\nfor i in prizes:\r\n maxDistance = max(maxDistance, min(10**6 - i, i - 1))\r\nprint(maxDistance)", "def read():\n return [int(v) for v in input().split()]\n\n\ndef main():\n l, r = 1, 10 ** 6\n read()\n a = read()\n ans = 0\n for v in a:\n ans = max(ans, min(v - l, r - v))\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nv = list(map(int, input().split()))\r\n\r\nans = 10**6 - v[0]\r\n\r\nif v[n-1] - 1 < ans:\r\n ans = v[n-1] - 1\r\n\r\nfor i in range(0, n - 1):\r\n val_a = 10**6 - v[i+1]\r\n val_b = v[i] - 1\r\n mx = val_a\r\n if val_b > mx:\r\n mx = val_b\r\n if mx < ans:\r\n ans = mx\r\n\r\nprint(ans)\r\n\r\n", "#s = input ().split () —> string input;\n#x = list (map (int, input ().split()));\n# python3 asd.py\n#s = s.replace(s[0], 'b');\n\nn = int (input ());\nx = list (map (int, input().split()));\n\nmx = int (1000000);\n\nmen = [];\ndostum = [];\n\nx.sort ();\n\nfor i in range (n):\n\tmen.append (x[i] - 1);\n\tdostum.append (mx - x[i]);\n\nans = 0;\nfor i in range (n):\n\tq = min (men[i], dostum[i]);\n\tif q > ans: ans = q;\n\nprint (ans);\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[i for i in a if i<=500000]\r\nc=[i for i in a if i>500000]\r\nif len(b)>0 and len(c)>0:\r\n z=max(b[-1]-1,1000000-c[0])\r\nelif len(b)==0:\r\n z=1000000-c[0]\r\nelif len(c)==0:\r\n z=b[-1]-1\r\nprint(z)", "input()\r\n\r\nprint(max(min(a-1,10**6-a) for a in map(int, input().split())))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nme = 1\r\nfr = 1000000\r\nfor i in l:\r\n if i <= 500000:\r\n if me < i:\r\n me = i\r\n else:\r\n if fr > i:\r\n fr = i\r\nprint(max(1000000 - fr, me - 1))\r\n", "input()\r\nprint(max(min(x-1,1000000-x) for x in map(int,input().split())))", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nelem = 1000000//2\r\n#print(elem)\r\nind = n+1\r\nfor i in range(len(arr)):\r\n if arr[i] >elem:\r\n ind = i\r\n break\r\nif(ind==n+1):\r\n print(arr[-1]-1)\r\nelif(ind==0):\r\n print(1000000-arr[0])\r\nelse:\r\n print(max((arr[ind-1]-1),(1000000-arr[ind])))\r\n", "if __name__==\"__main__\":\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n p1=1\r\n p2=1000000\r\n se=[]\r\n for i in a:\r\n if i-p1>=p2-i:\r\n se.append(p2-i)\r\n else:\r\n se.append(i-p1)\r\n print(max(se))\r\n", "\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\n\r\n\r\nmax_el = -1\r\nt = [x for x in a if x <= 500000]\r\nif len(t):\r\n max_el = max(max_el, t[-1]-1)\r\n\r\n \r\nt2 = [x for x in a if x > 500000]\r\nif len(t2):\r\n max_el = max(max_el, 10**6-t2[0])\r\n\r\n\r\nprint(max_el)", "input()\r\na=list(map(int,input().split()))\r\nans=0\r\nfor x in a:\r\n z=min(x-1,1000000-x)\r\n ans=max(z,ans)\r\nprint(ans)\r\n", "\r\n# Problem: B. Run For Your Prize\r\n# Contest: Codeforces - Educational Codeforces Round 38 (Rated for Div. 2)\r\n# URL: https://codeforces.com/contest/938/problem/B\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\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\na =1\r\nb = 10**6\r\nar = sorted([int(x) for x in input().split()])\r\nans = -1\r\nfor i in range(n):\r\n\tx = ar[i]\r\n\tans = max(min(x-1, (abs(1e6-x))), ans)\r\nprint(int(ans))", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in a:\r\n c.append(min(i-1,10**6-i))\r\nprint(max(c))\r\n\r\n \r\n\r\n\r\n \r\n", "n=int(input())\r\na=[0]+list(map(int,input().split()))+[10**6]\r\nm=10**6+1\r\nfor i in range(n+1):\r\n m=min(m,max(a[i]-1,10**6-a[i+1]))\r\nprint(m)\r\n", "#938B\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb1=0;b2=1000000\r\nfor i in range(n):\r\n if a[i]<=(1000000//2):\r\n b1=a[i]\r\n else:\r\n i-=1\r\n break\r\nfor j in range(i+1,n):\r\n b2=a[j]\r\n break\r\nprint(max(b1-1,1000000-b2))\r\n \r\n \r\n \r\n ", "input()\nl = list(map(int,input().split()))\ndistanceMax = 0\nfor e in l:\n distanceMin = e - 1\n distanceMin = min(distanceMin,1000000 - e)\n distanceMax = max(distanceMax,distanceMin)\nprint(distanceMax)\n\n", "Read = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\n\r\nt = 0\r\nfor x in Read():\r\n if x-1 > t and x <= 500000:\r\n t = x-1\r\n if 1000000-x > t and x > 500000:\r\n t = 1000000-x\r\n\r\nprint(t)", "n = int(input())\r\nL = input().split()\r\nM = []\r\nfor i in range(len(L)):\r\n L[i] = int(L[i])\r\n M.append(min(abs(L[i]-1),abs(L[i]-1000000)))\r\nprint(max(M))\r\n", "re = 500000\nn = int(input())\nls = list(map(int,input().split()))\nmy_ls = []\nf_ls = []\nmy_sec = -1\nf_sec = -1\nfor i in ls:\n if i <=re:\n my_ls.append(i)\n elif i>re:\n f_ls.append(i)\nif my_ls!=[]:\n my_sec = max(my_ls) - 1 \nif f_ls !=[]:\n f_sec = 10**6 - min(f_ls)\nprint(max(my_sec,f_sec))\n \t \t \t \t \t\t\t \t\t\t \t", "n = int(input())\r\nv = map(int, input().split())\r\nmaxi = 0\r\nfor x in v:\r\n maxi = max(maxi, min(1000000 - x, x - 1))\r\nprint(maxi)", "import math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n hash_a = [0 for i in range(1000002)]\r\n total_prize_count = len(a)\r\n counter = 0\r\n\r\n for i in a:\r\n hash_a[i] = 1\r\n for i in range(1, len(hash_a)):\r\n j = len(hash_a) - 1 - i\r\n if i == j:\r\n print(i - 1)\r\n break\r\n else:\r\n if hash_a[i] != 0:\r\n counter += 1\r\n if hash_a[j] != 0:\r\n counter += 1\r\n if counter == total_prize_count:\r\n print(i - 1)\r\n break\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nf1 = 1\r\nf2 = 10**6\r\ntime = 0\r\nk = n-1\r\nj = 0\r\nf = 0\r\nwhile f < n:\r\n if f1 == a[j]:\r\n j += 1\r\n f += 1\r\n if f2 == a[k]:\r\n k -= 1\r\n f += 1\r\n f1 += 1\r\n f2 -= 1\r\n time += 1\r\nprint(time-1)\r\n", "# https://codeforces.com/contest/938/problem/B\nn = int(input())\nv = list(map(int, input().split()))\n\n# base cases\n\nans = 10**6 - v[0]\n\nif v[n-1] - 1 < ans:\n ans = v[n-1] - 1\n\n# fix the midpoint\n\nfor i in range(0, n - 1):\n val_a = 10**6 - v[i+1] # second guy\n val_b = v[i] - 1 # first guy\n mx = val_a # take the max\n if val_b > mx:\n mx = val_b\n if mx < ans:\n ans = mx\n\nprint(ans)", "# B. Run For Your Prize\r\nn= int(input())\r\na=list(map(int,input().split()))\r\nt=[]\r\nfor i in a:\r\n t.append(min(i-1,1000000-i))\r\nprint(max(t))", "input()\nA = map(int, input().split())\nB = map(lambda x: min(abs(x - 1), abs(x - 1000000)), A)\nprint(max(B))\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nmaxn = int(-1e9)\r\nfor i in l:\r\n if i > 5*1e5:\r\n maxn = max(maxn, 1e6 - i)\r\n else:\r\n maxn = max(maxn, i - 1)\r\nprint(int(maxn))", "n=input()\nlst=input().split()\nlst1=[]\nfor i in lst:\n lst1.append(int(i))\nlst1.sort()\nlst2=[]\nlst3=[]\nfor j in lst1:\n if j-1<10**6-j:\n lst2.append(j)\n else:\n lst3.append(j)\nlst2.sort()\nlst3.sort()\nif lst2==[]:\n s=10**6-lst3[0]\nelif lst3==[]:\n s=lst2[-1]-1\nelif lst2[-1]-1>10**6-lst3[0]:\n s=lst2[-1]-1\nelif lst2[-1]-1<=10**6-lst3[0]:\n s=10**6-lst3[0]\nprint(s)\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\nx=1000000\r\ns=[]\r\nfor i in range(n):\r\n s.append(min(l[i]-1,x-l[i]))\r\nprint(max(s))\r\n", "def check1(a):\n for i in a:\n if i >500000.5:\n return False\n return True\n\ndef check2(a):\n for i in a:\n if i < 500000.5:\n return False\n return True\n\ndef answer(a,n):\n m = 500000.5\n if check1(a):\n print (a[-1]-1)\n return\n elif check2(a):\n print (1000000-a[0])\n return\n else:\n i = 0\n while True:\n if a[i]<m and a[i+1]>m:\n break\n i += 1\n if a[i+1]-m > m- a[i]:\n print (a[i] - 1)\n else:\n print (1000000 - a[i+1])\nn = int(input())\na = list(map(int, input().split()))\nanswer(a, 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 = int(input())\r\narr = list(map(int, input().split()))\r\nlst = [0]*(10**6)\r\nfor i in arr:\r\n lst[i] = min(abs(i - 1), abs(10**6 - i))\r\nprint(max(lst))\r\n", "input()\na = list(map(int, input().split()))\nr = 0\nfor x in a:\n r = max(r, min(x - 1, 1000000 - x))\nprint(r)\n", "# cook your dish here\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nmax1=0\r\nfor i in a:\r\n max1=max(max1,min(i-1,1000000-i))\r\nprint(max1)\r\n ", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn = int(input()) \r\na = list(map(int, input().split()))\r\n\r\nl, r = 1, 10 ** 6 \r\ni, j = 0, n - 1\r\nfor k in range(1, 10 ** 6 + 1):\r\n if(a[i] == l):\r\n i += 1 \r\n if(a[j] == r):\r\n j -= 1 \r\n l += 1 \r\n r -= 1 \r\n if(i > j):\r\n break \r\n \r\n \r\nprint(k - 1)\r\n \r\n", "x = int(input())\r\n\r\nprizes=input().split()\r\nprizesReversed=prizes.copy()\r\nprizesReversed.reverse()\r\n\r\nmyStart=1\r\nfriendStart=1000000\r\n\r\ncollectedByMe=list()\r\n\r\ncollectedByFriend=list()\r\n\r\n\r\nfor i in prizes:\r\n collectedByMe.append(int(i)-myStart)\r\n\r\nfor i in prizesReversed:\r\n collectedByFriend.append(friendStart-int(i))\r\n\r\ncollectedByFriend.reverse()\r\n\r\nMinimumPath=list()\r\n\r\nfor i,j in zip(collectedByMe,collectedByFriend):\r\n MinimumPath.append(min(i,j))\r\n\r\n\r\nprint(max(MinimumPath))\r\n\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ndist=[0]*10000000\r\nfor i in l:\r\n dist[i]=min(i-1,10**6-i)\r\nprint(max(dist))", "n = int(input())\nlist = [int(num) for num in input().split()]\nnum = 0\nfor x in list:\n num = max(num,min(x-1,1000000-x))\nprint(num)\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\n\r\nres = a[-1]-1\r\nans = res\r\nft = 0\r\nfor i in range(n-1, 0, -1):\r\n res-= (a[i]-a[i-1])\r\n ft = 10**6-a[i]\r\n ans = min(ans, max(res, ft))\r\nft = 10**6-a[0]\r\nans = min(ans, ft)\r\nprint(ans)\r\n ", "n=int(input())\r\nlist1=[int(x) for x in input().split()]\r\nprev=[]\r\naft=[]\r\nfor i in list1:\r\n if i<=500000:\r\n prev.append(i)\r\n else:\r\n aft.append(1000000-i)\r\nif(len(aft)==0):\r\n x = max(prev) - 1\r\n #y = max(aft)\r\n print(x)\r\nelif(len(prev)==0):\r\n #x = max(prev) - 1\r\n y = max(aft)\r\n print(y)\r\nelse:\r\n x = max(prev) - 1\r\n y = max(aft)\r\n print(max(x,y))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nans=1\r\nfor i in range(n):\r\n\tif a[i]<=500000:\r\n\t\tans=a[i]-1\r\n\telse:\r\n\t\tans=max(ans,1000000-a[i])\r\n\t\tbreak\r\nprint(ans)", "T = 1\nfor _ in range(T):\n n = int(input())\n a = [int(x) for x in input().split(' ')]\n last = a[n-1]-1\n first = 0\n m = 0\n for i in range(n):\n p = a[i]-1\n q = 10**6-a[i]\n m = max(m,min(p,q))\n print(m)\n # print(min(second))\n \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\nme , fr = 1, 10**6\r\nj=0\r\nfor i in a:\r\n if i < 500001 and i-1 > j:\r\n j=i-1\r\n if i > 500000 and 10**6-i > j:\r\n j=10**6-i\r\nprint(j)\r\n", "def solve(P):\r\n n = int(input())\r\n b = [0 for _ in range(10**6)]\r\n for i in list(map(int, input().split())):\r\n b[i-1] = 1\r\n\r\n l = 0\r\n r = 10**6 - 1\r\n s1 = [0]\r\n s2 = [0]\r\n s = 0\r\n while l <= r:\r\n s += 1\r\n l += 1\r\n r -= 1\r\n if b[l]:\r\n s1.append(s)\r\n b[l] = 0\r\n if b[r]:\r\n s2.append(s)\r\n b[r] = 0\r\n \r\n print(max(s1[-1], s2[-1]))\r\n\r\n\r\n# for _ in range(int(input())):\r\n# solve(_)\r\n\r\nsolve(1)\r\n", "n=int(input())\nl=[int(i) for i in input().split()]\ndist=[0]*10000000\nfor i in l:\n dist[i]=min(i-1,10**6-i)\nprint(max(dist))", "r=0\r\nfor x in map(int,[*open(0)][1].split()):\r\n r=max(r,min(x-1,1000000-x))\r\nprint(r)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = float(\"+inf\")\r\n\r\nfor i in range(n+1):\r\n cur = 0\r\n if i:\r\n cur = max(cur, a[i-1]-1)\r\n if i != n:\r\n cur = max(cur, 1000000-a[i])\r\n ans = min(ans, cur)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\np = 10**6\r\nfor i in range(n):\r\n b.append(min(a[i]-1,p-a[i]))\r\nprint(max(b))\r\n", "a = 1\r\nb = 1000000\r\nn = int(input())\r\n\r\nl = list(map(int,input().split()))\r\nc=0\r\nans=0\r\nfor i in range(len(l)):\r\n c=max(min(abs(a-l[i]),abs(b-l[i])),c)\r\nprint(c)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n b.append(min(a[i] - 1, abs(int(a[i] - 10e5))))\r\nprint(max(b))", "import bisect as bs\r\n\r\n\r\nn, a = int(input()), list(map(int, input().split()))\r\nm = bs.bisect_left(a, 5 * 10 ** 5 + 1)\r\n\r\nif m == n:\r\n res = a[m - 1] - 1\r\nelif m == 0:\r\n res = 10 ** 6 - a[0]\r\nelse:\r\n res = max(a[m - 1] - 1, 10 ** 6 - a[m])\r\n\r\nprint(res)\r\n\r\n", "n,m=int(input()),0\r\nx=list(map(int,input().split()))\r\ny=[i-1 for i in x]\r\ny.append(1000000-i for i in x)\r\nfor i in x:\r\n m=max(m,min(i-1,1000000-i))\r\nprint(m)", "import math\r\nfrom decimal import Decimal\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\ta = [int(x) for x in input().split()]\r\n\tb = [int(x) for x in input().split()]\r\n\treturn n,m,b\r\n \r\n \r\ndef eratosthenes(n): \r\n\tsieve = list(range(n + 1))\r\n\tfor i in sieve:\r\n\t\tif i > 1:\r\n\t\t\tfor j in range(i + i, len(sieve), i):\r\n\t\t\t\tsieve[j] = 0\r\n\treturn sorted(set(sieve))\r\n \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\nn, a = na()\r\nb = [0] * 1000001\r\nk = 0\r\nl = 1\r\nr = 1000000\r\nfor i in a:\r\n\tb[i] = 1\r\ntc = 0\r\nwhile k < n:\r\n\tk += b[l] + b[r]\r\n\tl += 1\r\n\tr -= 1\r\n\ttc += 1\r\nprint(tc - 1)\r\n", "n = int(input()) \r\na = list(map(int,input().split())) \r\nl=1 \r\nr = 10**6 \r\nx = 0\r\ny = n-1 \r\nans=0 \r\nwhile(y>=x):\r\n # print(x,y)\r\n # print(l,r)\r\n if (l==a[x]):\r\n x+=1 \r\n \r\n # continue\r\n if (r==a[y]):\r\n y-=1 \r\n # r-=1 \r\n # continue\r\n ans+=1 \r\n l+=1 \r\n r-=1 \r\n if (x>=n or (y<0)):\r\n break \r\nprint(ans-1)\r\n \r\n \r\n \r\n \r\n", "input();print(max([min(i-1,10**6-i) for i in map(int,input().split())]))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nk = 1000000\r\nl = 0\r\nfor i in a:\r\n\tif i <= 500000:\r\n\t\tif l < i:\r\n\t\t\tl = i\r\n\tif i > 500000:\r\n\t\tif k > i:\r\n\t\t\tk = i\r\n\r\nma = max(a)\r\nif ma <= 500000:\r\n\tprint(ma - 1)\r\nelse:\r\n\tprint(max(l - 1, 1000000 - k))", "n=int(input())\r\np=list(map(int, input().split()))\r\nt=0\r\nif max(p)<500001:\r\n print(max(p)-1)\r\nelse:\r\n p1=[]\r\n for i in p:\r\n if i>500000:\r\n p1.append(10**6-i)\r\n else:\r\n t=i-1\r\n print(max(max(p1),t))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Feb 16 21:56:50 2018\r\n\r\n@author: Rakib\r\n\"\"\"\r\nn = int(input())\r\ns = input()\r\na = s.split()\r\nfor i in range(0,len(a)):\r\n a[i] = int(a[i])\r\nmax1 = 2\r\nmin2 = 999999\r\nisThere = False\r\nisHere = False\r\nfor i in range(n):\r\n if a[i] > 500000:\r\n isThere = True\r\n if a[i] <= 500000:\r\n isHere = True\r\nfor i in range(n): \r\n if (a[i] <= 500000) & (a[i] > max1):\r\n max1 = a[i]\r\n \r\n if (a[i] > 500000) & (a[i] < min2):\r\n min2 = a[i]\r\n \r\n#print(max1)\r\n#print(min2)\r\nif isThere & isHere:\r\n total = max(max1 - 1,1000000 - min2) #print(min2)\r\nelif isThere:\r\n total = 1000000 - min2\r\nelif isHere:\r\n total = max1 - 1 \r\n\r\nprint(total)", "n = int(input())\r\n\r\nai = list(map(int, input().split()))\r\n\r\na = []\r\nfor i in ai:\r\n if i > 10**6/2:\r\n a.append(abs(10**6/2 - i))\r\n else:\r\n a.append(abs(10**6/2 - i) + 1)\r\nprint(int(10**6/2 - min(a)))\r\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\nme = max(list(filter(lambda x : x <= (10**6) // 2,li))+[1]) - 1\r\nfr = (10**6) - min(list(filter(lambda x : x > (10**6)//2,li))+[10**6])\r\nprint(max(me,fr))", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\n\r\nz=1\r\nw=1000000\r\nfor i in range(n):\r\n if a[i]<=500000:\r\n z=max(z,a[i])\r\n else:\r\n w=min(w,a[i])\r\nprint(max((z-1),(1000000-w)))", "n = int(input())\r\na = [int(s) for s in input().split()]\r\nmx = 1\r\nN = 10**6\r\nmn = N\r\nfor i in a:\r\n if i <= N // 2:\r\n mx = i\r\n if i >= N // 2:\r\n mn = i\r\n break\r\nprint(min(max(mx - 1, N - mn), 499999))\r\n", "input()\r\nm=list(map(int,input().split()))\r\nans=0\r\nfr=10**6\r\nfor i in m:\r\n ans=max(ans,min(fr-i,i-1))\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Feb 16 21:31:15 2018\r\n\r\n@author: Anuroop Behera\r\n\"\"\"\r\n\r\nn = int(input())\r\na = input().split()\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nif a[n-1] <= 1000000/2:\r\n print(a[n-1]-1)\r\nelif a[0] > 1000000/2:\r\n print(1000001-a[0]-1)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] > 500000:\r\n break\r\n print(max(a[i-1]-1,1000001-a[i]-1))\r\n ", "n = int(input())\r\nstr1 = str(input())\r\n\r\nlis1 = [int(i) for i in str1.split(' ') if int(i) <= 500000]\r\nlis2 = [int(i) for i in str1.split(' ') if int(i) > 500000]\r\n\r\nfriend1 = max(lis1) - 1 if len(lis1) != 0 else 0\r\nfriend2 = 1000000 - min(lis2) if len(lis2) != 0 else 0\r\n\r\nif friend1 != -1 and friend2 != 1000000:\r\n print(max(friend1, friend2))\r\nelif friend1 == -1:\r\n print(friend2)\r\nelif friend2 == 1000000:\r\n print(friend1)\r\nelse:\r\n print(0)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=-1\r\nfor i in range(n):\r\n ans=max(ans,min(a[i]-1,1000000-a[i]))\r\nprint(ans)", "MAX=1e6\r\n\r\nn=int(input())\r\nar=list(map(int,input().split()))\r\n\r\nvar = 0\r\nfor i in ar:\r\n if i<(MAX//2): var = max(var,i-1)\r\n elif i==(MAX//2): var = max(var,min(i-1,MAX-i))\r\n else: var = max(var,MAX-i)\r\n\r\nprint(int(var))\r\n", "n = int(input())\r\ns = [1] + list(map(int, input().split())) + [1000000]\r\nx = set()\r\nfor i in range(n + 1):\r\n x.add(max(s[i] - 1, 1000000 - s[i + 1]))\r\nprint(min(x))\r\n", "n = int(input(\"\"))\r\nx = [int(i) for i in input(\"\").split(\" \")]\r\nans = 0\r\nfor a in x:\r\n ans = max(ans,min(a-1,1000000-a))\r\nprint(ans)\r\n", "x = 1; y = int(1e6)\r\na = -1; b = 1e50;\r\nn = int(input())\r\narray = list(map(int, input().split()))\r\nfor i in array:\r\n if i <= y//2:\r\n a = max(a, i)\r\n else:\r\n b = min(b, i)\r\nb = y - b \r\na = a-1\r\nprint(max(a,b))", "n = int(input())\n\na = list(map(int, input().split()))\n\nres = 0\nfor x in a:\n res = max(res, min(x-1, 10**6-x))\nprint(res)\n", "\nn = int(input())\n\nA = [int(x) for x in input().split()]\n\nprint(max([min([x - 1, 10**6 - x]) for x in A]))\n", "import sys, heapq\r\n\r\nn = int(sys.stdin.readline())\r\narr = list(map(int, sys.stdin.readline().split()))\r\nleft = 0\r\nright = 9876543210\r\nwhile left < right:\r\n mid = (left + right) // 2\r\n me = 1 + mid\r\n friend = pow(10, 6) - mid\r\n idx1 = 0\r\n idx2 = 0\r\n for i in range(n):\r\n if arr[i] <= me:\r\n idx1 += 1\r\n else:\r\n break\r\n for i in range(n - 1, -1, -1):\r\n if arr[i] >= friend:\r\n idx2 += 1\r\n else:\r\n break\r\n if idx1 + idx2 >= n:\r\n right = mid\r\n else:\r\n left = mid + 1\r\nprint(right)", "n = int(input())\r\nprint(max([int(500000.5 - abs(500000.5 - x) - 1) for x in [int(i) for i in input().split(' ')]]))", "n = int(input())\r\nmyPos = 1\r\nfriendPos = 1000000\r\na = list(map(int,input().split()))\r\nans = max(min(i-1,friendPos-i) for i in a)\r\nprint(ans)\r\n\r\n", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split(' ')))\n\n ans = 0x3f3f3f3f\n for i in range(n + 1):\n res = 0\n if i: res = max(res, a[i - 1] - 1)\n if i != n: res = max(res, int(1e6) - a[i])\n \n ans = min(ans, res)\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\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=0\r\nfor i in range(n):\r\n m=max(m,min(l[i]-1,10**6-l[i]))\r\nprint(m)", "n=input()\r\na=list(map(int,input().split()))\r\nlst=[]\r\nfor x in a:\r\n\tlst.append(min(x-1,10**6-x))\r\nlst.sort()\r\nprint(lst[-1])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = -1\r\nfor i in l:\r\n a = i-1\r\n b = 10**6-i\r\n ans = max(ans, min(a, b))\r\nprint(ans)", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\nans = max([min(a - 1, 10 ** 6 - a) for a in lst])\r\n\r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = []\r\nfor i in range(len(a)):\r\n if(a[i]<=pow(10,6)//2):\r\n c.append(a[i]-1)\r\n else:\r\n c.append(pow(10,6)-a[i])\r\nprint(max(c))\r\n", "n = int(input())\nv = map(int, input().split())\nmaxi = 0\nfor x in v:\n maxi = max(maxi, min(1000000 - x, x - 1))\nprint(maxi)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nx = pow(10, 6)\r\nfor i in a:\r\n ans = max(ans, min(i - 1, x - i))\r\nprint(ans)", "n=int(input())\nl=list(map(int,input().split()))\na=[]\nb=[]\n# for i in range(1,10**6//2):\n# f+=1\n# if 1+i in l:\n# th+=1\n# if 10**6-i in l:\n# th+=1\n# if th==n:\n# break\nfor i in l:\n if i<=10**6//2:\n a.append(i)\n else:\n b.append(i)\nif len(a)==0:\n print(10**6-min(b))\nelif len(b)==0:\n print(max(a)-1)\nelse:\n f=max(a)-1\n t=10**6-min(b)\n print(max(f,t))\n\n\t\t \t\t\t \t \t\t \t\t \t \t \t", "import sys\nlines = sys.stdin.read().splitlines()\nlincnt = -1 \n\ndef input():\n global lincnt\n lincnt += 1\n return lines[lincnt]\n\n\ninput()\nl = map(int, input().split())\nprint(max(min(x - 1, 1000000 - x) for x in l))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nd=[]\r\nfor i in range(n):\r\n d.append(min(a[i]-1,1000000-a[i]))\r\nprint(max(d))", "import bisect\n\ndef main():\n N = int(input())\n A = tuple(map(int, input().split()))\n\n i = bisect.bisect(A, 500000)\n if not i:\n own = 0\n else:\n own = A[i-1] - 1\n\n if i == N:\n friend = 0\n else:\n friend = 1000000 - A[i]\n\n print(max(own, friend))\n\nmain()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 1000000\r\nm = min((a[-1] - 1), (k - a[0]))\r\nfor i in range(n-1):\r\n s = max(a[i] - 1, k - a[i + 1])\r\n m = min(m, s)\r\nprint(m)\r\n", "input()\r\nns = [int(x) for x in input().split()]\r\n\r\nns = [1]+ns+[1000000]\r\n\r\ntt = 2000000\r\n\r\nfor i in range(len(ns)-1):\r\n t1 = ns[i]-1\r\n t2 = 1000000 - ns[i+1]\r\n t = max(t1,t2)\r\n if t < tt:\r\n tt=t\r\nprint(tt)", "import sys,math\nn = int(input())\na = list(map(int,input().split()))\nstart = 1\nlast = 10**6\nprize = 0\nfor i in a:\n prize=max(prize,min(i-1,last-i))\nprint(prize)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nub = 10**6\r\nlb = 1\r\n\r\nans = min(a[n-1] - lb, ub - a[0])\r\nfor i in range(1,n):\r\n ans = min(ans, max(a[i-1]-lb, ub - a[i]))\r\n\r\nprint(ans)", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor x in a:\r\n ans = max(ans, min(x-1, 10**6-x))\r\n\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmax=0\r\nfor i in range(n):\r\n\tmin1=min(a[i]-1,1000000-a[i])\r\n\tif(min1>max):\r\n\t\tmax=min1\r\nprint(max)\t\t", "\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\na=list(map(int,input().split()))\r\n\r\nm=min(a[n-1]-1,10**6-a[0])\r\nfor i in range(n-1):\r\n m=min(m,max(a[i]-1,10**6-a[i+1]))\r\n\r\nprint(m)\r\n\r\n", "v = 'aiouey'\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nfr = 1000000\r\nmi = 0\r\nfor i in a:\r\n mi = max(min(fr-i,i-1),mi)\r\nprint(mi)", "n,m=int(input()),0\nx=list(map(int,input().split()))\ny=[i-1 for i in x]\ny.append(1000000-i for i in x)\nfor i in x:\n m=max(m,min(i-1,1000000-i))\nprint(m)", "n=int(input())\r\nprizes = list(map(int, input().split()))\r\na1 = 1\r\na2 = 1000000\r\nanswer=0\r\nfor i in prizes:\r\n answer=max(min(abs(i-a1),abs(i-a2)), answer)\r\nprint(answer)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = min(1000000 - a[0], a[n - 1] - 1)\r\nfor i in range(n - 1):\r\n ans = min(ans, max(a[i] - 1, 1000000 - a[i + 1]))\r\nprint(ans)\r\n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\na = 0\r\nb = 10000000\r\nfor el in mas:\r\n if el <= 500000:\r\n if el > a:\r\n a = el\r\n else:\r\n if el < b:\r\n b = el\r\nb = 1000000 - b\r\na = a - 1\r\nif a > b:\r\n print(a)\r\nelse:\r\n print(b)", "i = int(input())\r\nl = list(map(int,input().split()))\r\nm = 0\r\nfor x in l:\r\n if x > 500000:\r\n if m < 1000000- x:\r\n m = 1000000- x\r\n else:\r\n if m < x-1:\r\n m = x-1\r\nprint(m)", "n = int (input())\r\na = list(input().strip().split(' '))\r\nb = [int (x) for x in a]\r\na = [0]\r\na = a * (1000010)\r\nl = len (b)\r\nfor i in range (l) :\r\n a[b[i]] = 1\r\n\r\nl = 1\r\nr = 1e6\r\nans = 1e7\r\n# print (a)\r\nif n == 0 :\r\n print (0)\r\nelse :\r\n while r >= l :\r\n # print (l,r)\r\n mid = int ((l + r) // 2)\r\n count = 0\r\n for i in range (mid) :\r\n if a[i + 2] :\r\n count += 1\r\n if a[1000000 - i - 1] :\r\n count += 1\r\n if (count >= n) :\r\n ans = min (ans, mid)\r\n r = mid - 1\r\n else :\r\n l = mid + 1\r\nprint (ans)\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ntime = 0\r\nfor p in a:\r\n time = max(time,min(p-1,1000000-p))\r\nprint(time)", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nans1=ans2=0\r\nfor i in range(n):\r\n if a[i]<=500000:\r\n ans1=a[i]-1\r\n else:\r\n ans2=1000000-a[i]\r\n break\r\nprint(max(ans1,ans2))", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = []\r\nfor i in reversed(range(n)):\r\n a = A[i]\r\n B.append(10**6-a)\r\nA = [a-1 for a in A]\r\nA = [0]+A\r\nB = [0]+B\r\nans= 10**18\r\nfor i in range(n+1):\r\n temp = max(A[i], B[n-i])\r\n\r\n ans = min(ans, temp)\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().rstrip().split()))\r\n\r\nattuale = 0\r\nfor i in range(n):\r\n ma = min(a[i] - 1, 1000000 - a[i])\r\n attuale = max(ma, attuale)\r\nprint(attuale)", "import math\r\n\r\ndef _input(): return map(int, input().split())\r\n\r\nn = int(input())\r\nlst = list(_input())\r\npos1 = 1; pos2 = 10**6\r\nres=0\r\ni=0; j=n-1\r\nwhile i<=j:\r\n if lst[i]-pos1 < pos2-lst[j]:\r\n res+=lst[i]-pos1\r\n pos2-=lst[i]-pos1\r\n pos1 = lst[i]\r\n i+=1\r\n \r\n else:\r\n res+=pos2-lst[j]\r\n pos1+=pos2-lst[j]\r\n pos2 = lst[j]\r\n j-=1\r\nprint(res)\r\n ", "n = int(input())\r\nl = list(map(int, input().split()))\r\nz = []\r\nmax_z = 0\r\n\r\nfor i in range(n):\r\n z.append(min(l[i] - 1, 1000000 - l[i]))\r\n\r\n if z[i] > max_z:\r\n max_z = z[i]\r\n \r\nprint(max_z)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncA=1\r\ncB=int(1e6)\r\nmx=0\r\nfor i in range(n):\r\n x = abs(cA-a[i])\r\n y = abs(cB-a[i])\r\n mx=max(mx, min(x, y))\r\nprint(mx)\r\n", "n = int(input())\r\nl = [*map(int, input().split())]\r\nres = [min(e - 1, int(1e6) - e) for e in l]\r\nprint(max(res))", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nv=[0]*n\r\ncurA=1\r\ncurB=int(1e6)\r\nmx=0\r\n\r\nfor i in range(n):\r\n x=abs(curA-a[i])\r\n y=abs(curB-a[i])\r\n\r\n mx=max(mx,min(x,y))\r\n\r\nprint(mx)", "x = int(input())\r\nl = list(map(int,input().split()))\r\na = []\r\nb = []\r\nfor i in l:\r\n if i <= 500000:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\na1 = 1\r\nans1 = 0\r\nif len(a) > 0:\r\n for i in range(len(a)):\r\n ans1+=a[i] - a1\r\n a1 = a[i]\r\nb1 = 1e6\r\nans2 = 0\r\nif len(b) > 0:\r\n for i in range(len(b)-1,-1,-1):\r\n ans2+=b1 - b[i]\r\n b1 = b[i]\r\nprint(int(max(ans1,ans2)))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmyPosition=1\r\nFriendPosition=10**6\r\ntime=0\r\nmaxT=0\r\nfor i in range(n):\r\n time=min(abs(myPosition-arr[i]),abs(FriendPosition-arr[i]))\r\n maxT=max(maxT,time)\r\nprint(maxT)\r\n\r\n", "n = int(input())\r\nmyList = list(map(int, input().split()))\r\nmyNewList = []\r\nfor i in range(0, len(myList)):\r\n if myList[i] < 500001:\r\n x = myList[i] - 1\r\n elif myList[i] >= 500001:\r\n x = abs(myList[i] - 1000000)\r\n myNewList.append(x)\r\nmaxi = 0\r\nfor j in range(0, len(myNewList)):\r\n if myNewList[j] > maxi:\r\n maxi = myNewList[j]\r\nprint(maxi)\r\n", "n,arr=int(input()),list(map(int,input().strip().split()))\r\nx,y,c,d=1,1000000,0,0\r\nfor i in range(n):\r\n if arr[i]>500000:break\r\n c+=arr[i]-x;x=arr[i]\r\narr.reverse()\r\nfor j in range(n):\r\n if arr[j]<=500000:break\r\n d+=y-arr[j];y=arr[j]\r\nprint(max(c,d))", "n = int(input())\nA = list(map(int,input().split(' ')))\nprint(max(list(map(lambda x:min(x-1,10**6-x),A))))\n", "a = int(input())\nd=list(map(int,input().split(' ')))\nfor i in range(a):\n d[i] = min(d[i] - 1,1000000-d[i])\nmaxb = 0\nfor i in range(a):\n maxb = max(maxb,d[i])\nprint(maxb)\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\nE=0\r\nfor i in range(n):\r\n E=max(E,min(a[i]-1,1000000-a[i]))\r\nprint(E)", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(max(min(i-1,10**6-i) for i in a))", "n=int(input())\r\na=list(map(int,input().split()))\r\nv=[0]*n\r\ncu=1\r\nc=int(1e6)\r\nmx=0\r\nfor i in range(n):\r\n x=abs(cu-a[i])\r\n y=abs(c-a[i])\r\n mx=max(mx,min(x,y))\r\nprint(mx)", "n=(int)(input())\r\nl=list(map(int, input().split()))\r\n# s=input()\r\na=0\r\nfor i in range(n):\r\n ans=(min((abs(1-l[i])),(abs(1000000-l[i]))))\r\n if ans>a:\r\n a=ans\r\nprint(a)", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = 1\r\nmil = 1000000\r\nr = mil\r\nfor i in a:\r\n if i - 1 < mil - i:\r\n l = i\r\n else:\r\n r = i\r\n break\r\nprint(max(l - 1, mil - r))\r\n", "n=int(input())\n\nlist=[int(num) for num in input().split()]\n\nans=0\nfor x in list:\n ans=max(ans,min(x-1,1000000-x))\nprint(ans)\n \t \t\t \t \t\t \t \t\t\t \t \t\t\t\t\t", "input()\nprint(max(min(x - 1, 1000000 - x) for x in map(int, input().split())))\n", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nminm=10**9\r\nfor i in range(0,n-1):\r\n\tx=max(a[i]-1,10**6-a[i+1])\r\n\tif minm>x:\r\n\t\tminm=x \r\n\t\t\r\nx=min(a[n-1]-1,10**6-a[0],minm)\r\nprint(x)\r\n", "n=int(input())\r\nx=input().split(' ')\r\nans=-1\r\nfor i in x:\r\n\tans=max(ans,min(int(i)-1,1000000-int(i)))\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nr=[]\r\nfor i in range(n):\r\n\tr.append(min(a[i]-1,1000000-a[i]))\r\n\r\nprint(max(r))", "from itertools import chain\r\nn = int(input())\r\nps = chain(map(int, input().split()), [10**6])\r\np = 1\r\nans = None\r\nfor q in ps:\r\n t = max(p - 1, 10**6 - q)\r\n ans = min(t, ans) if ans is not None else t\r\n p = q\r\nprint(ans)\r\n" ]

[ "n, lines = int(input().split(' ')[0]), []\r\nfor i in range(0, n):\r\n line = input()\r\n lines.append(line)\r\nrc, cc, total = [0]*n, [0]*len(lines[0]), 0\r\nfor i, line in enumerate(lines):\r\n for j, ch in enumerate(line):\r\n if ch == \"*\":\r\n rc[i] += 1\r\n cc[j] += 1\r\n total += 1\r\nx, y = -1, -1\r\nfor i, line in enumerate(lines):\r\n for j, ch in enumerate(line):\r\n count = rc[i] + cc[j]\r\n if ch == \"*\":\r\n count -= 1\r\n if count == total:\r\n x, y = i, j\r\n break\r\nif x == -1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(x + 1, y + 1)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n m = len(A[0])\r\n row = [0] * n\r\n col = [0] * m\r\n total = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if A[i][j] == '*':\r\n row[i] += 1\r\n col[j] += 1\r\n total += 1\r\n for i in range(n):\r\n for j in range(m):\r\n val = row[i] + col[j]\r\n if A[i][j] == '*':\r\n val -= 1\r\n if val == total:\r\n return (i, j)\r\n return None\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = []\r\n for i in range(n):\r\n A.append(input())\r\n ans = solve(A)\r\n if ans:\r\n print('YES')\r\n print('%d %d' % (ans[0] + 1, ans[1] + 1))\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[n, m] = list(map(int, input().split()))\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nr = []\r\nc = []\r\ntot = 0\r\nfor x in range(n):\r\n cnt = 0\r\n for y in range(m):\r\n if s[x][y] == '*':\r\n cnt += 1\r\n r.append(cnt)\r\nfor y in range(m):\r\n cnt = 0\r\n for x in range(n):\r\n if s[x][y] == '*':\r\n cnt += 1\r\n c.append(cnt)\r\nfor x in range(n):\r\n for y in range(m):\r\n if s[x][y] == '*':\r\n tot += 1\r\n\r\nfor x in range(n):\r\n for y in range(m):\r\n cnt = r[x]+c[y]\r\n if s[x][y] == '*':\r\n cnt -= 1\r\n if cnt == tot:\r\n print('YES')\r\n print(' '.join(map(str, [x+1, y+1])))\r\n exit(0)\r\nprint('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ng = [input()[:-1] for _ in range(n)]\r\n\r\nr = [i.count('*') for i in g]\r\nc = [i.count('*') for i in zip(*g)]\r\nx = sum(r)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if r[i] + c[j] - (g[i][j] == '*') == x:\r\n print('YES')\r\n print(i+1, j+1)\r\n exit(0)\r\nprint('NO')", "# -------------------------------#\r\n# INCLUDE <HajLorenzo>\r\n# INCLUDE <mega16.h>\r\n# Submit_Some_1400_ELO_:)\r\n# -------------------------------#\r\n\r\narray=[]\r\n\r\na=list(map(int,input().split()))\r\n\r\nif(a[0]==1 or a[1]==1):\r\n for i in range(a[0]):\r\n tmp = input()\r\n print(\"YES\")\r\n print(\"1 1\")\r\nelse:\r\n r=[0 for i in range(a[0])]\r\n c=[0 for i in range(a[1])]\r\n TOTAL=0\r\n for i in range(a[0]):\r\n tmp=input()\r\n array.append(tmp)\r\n if (\"*\" in tmp):\r\n r[i]+=tmp.count(\"*\")\r\n TOTAL+=r[i]\r\n for j in range(tmp.find(\"*\"),a[1]):\r\n if(tmp[j]==\"*\"):\r\n c[j]+=1\r\n #print(r)\r\n #print(c)\r\n max=max(c)\r\n for i in range(a[0]):\r\n if(r[i]+max>=TOTAL):\r\n for j in range(a[1]):\r\n if(r[i]+c[j]>=TOTAL):\r\n DF0X=r[i] + c[j]\r\n #print(\"array : \",array[i][j])\r\n #print(\"r : \",r[i])\r\n #print(\"c : \",c[j])\r\n if(array[i][j]==\"*\"):\r\n DF0X-=1\r\n #print(\"REMOVE\")\r\n #print(\"dfx : \",DF0X)\r\n if(DF0X==TOTAL):\r\n print(\"YES\")\r\n print(i+1,end=\" \")\r\n print(j+1)\r\n exit(0)\r\n print(\"NO\")\r\n\r\n#I This one Should Be Ok :)\r\n\r\n\r\n\r\n\r\n\r\n '''\r\n INDEX=[r.index(max(r)),c.index(max(c))]\r\n RC_TOTAL=r[INDEX[0]]+c[INDEX[1]]\r\n print(INDEX)\r\n print(r[INDEX[0]],r[INDEX[1]])\r\n #if(array[INDEX[0]][INDEX[1]]==\"*\" and r[INDEX[0]]!=r[INDEX[1]]!=1): #for removing double...\r\n if (array[INDEX[0]][INDEX[1]] == \"*\" and r[INDEX[0]] != r[INDEX[1]] != 1): # for removing double...\r\n RC_TOTAL-=1\r\n print(\"Removed\")\r\n print(RC_TOTAL)\r\n print(\"TOTAL : \",TOTAL)\r\n if(RC_TOTAL == TOTAL):\r\n print(\"YES\")\r\n print(INDEX[0]+1,end=\" \")\r\n print(INDEX[1]+1)\r\n else:\r\n print(\"NO\")'''", "n,m=map(int,input().split())\r\nxa=[0]*m;ya=[0]*n;all=0\r\nlog=[]\r\nfor c in range(n):\r\n t=input()\r\n log.append(t)\r\n for i,x in enumerate(t):\r\n if x=='*':\r\n xa[i]+=1\r\n all+=1\r\n ya[c]+=t.count('*')\r\n\r\nfor x in range(m):\r\n for y in range(n):\r\n if xa[x]+ya[y]-(log[y][x]=='*')==all: print('YES');print(y+1,x+1);exit()\r\nprint('NO')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nx, y = [], [0] * m\r\ns = []\r\nfor i in range(n):\r\n s0 = list(input().rstrip())\r\n s0 = [min((j & 4) ^ 4, 1) for j in s0]\r\n c = 0\r\n for j in range(m):\r\n if s0[j]:\r\n c += 1\r\n y[j] += 1\r\n x.append(c)\r\n s.append(s0)\r\nc = sum(x)\r\nans = \"NO\"\r\nfor i in range(n):\r\n si = s[i]\r\n for j in range(m):\r\n if x[i] + y[j] - si[j] == c:\r\n ans = \"YES\"\r\n u, v = i + 1, j + 1\r\n break\r\n if ans == \"YES\":\r\n break\r\nprint(ans)\r\nif ans == \"YES\":\r\n print(u, v)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/699/B\r\n\r\nn, m = map(int, input().split())\r\n\r\nl_w = list()\r\nfor _ in range(n):\r\n l_w.append(input())\r\n\r\nh = [0] * m\r\nv = [0] * n\r\nw_c = 0\r\n\r\nfor i, s in enumerate(l_w):\r\n for j, c in enumerate(s):\r\n if c == \"*\":\r\n h[j] += 1\r\n v[i] += 1\r\n w_c += 1\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if h[j] + v[i] - (l_w[i][j] == \"*\") == w_c:\r\n print(\"YES\\n%d %d\" % (i + 1, j + 1))\r\n exit()\r\n\r\nprint(\"NO\")\r\n ", "# -------------------------------#\r\n# INCLUDE <javad>\r\n# INCLUDE <mega16.h>\r\n# Submit_Some_1400_ELO_:)\r\n# -------------------------------#\r\n\r\n\r\nimport sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\ncounter = 0\r\na = []\r\nb = defaultdict(list)\r\nfor i in range(n):\r\n inp = input()\r\n l = inp.count(\"*\")\r\n counter += l\r\n if counter > m + n - 1:\r\n exit(print(\"NO\"))\r\n a.append(inp)\r\n b[l].append(i + 1)\r\n\r\nr = max(b.keys())\r\nc = list(zip(*a))\r\nfor x in b[r]:\r\n for i in range(m):\r\n if c[i].count(\"*\") + r - (a[x - 1][i] == \"*\") == counter:\r\n print(\"YES\")\r\n print(x, i + 1)\r\n exit()\r\nprint(\"NO\")", "\r\nn,m=[int(i) for i in input().split(\" \")]\r\nl=[]\r\nd=0\r\nl2=[]\r\nans=0\r\ncount=0\r\nfor i in range(n):\r\n k=list(input())\r\n c=k.count(\"*\")\r\n if c==0:\r\n count+=1\r\n if(c==1):\r\n l2.append(i)\r\n if(c>1):\r\n p=i\r\n d+=1\r\n if d>1:\r\n ans=\"NO\"\r\n l.append(k)\r\n\r\nif((len(l2)==0 and d==0 and count!=n) or ans==\"NO\"):\r\n print(\"NO\")\r\nelse:\r\n if count==n:\r\n print(\"YES\")\r\n print(1,1)\r\n else:\r\n l3=[l[i].index(\"*\") for i in l2]\r\n flag=False\r\n f=False\r\n if len(l3)>0:\r\n l4=list(set(l3))\r\n if len(l4)==2:\r\n flag=True\r\n if (l3.count(l4[0])==1):\r\n for i in l2:\r\n if l[i].index(\"*\")==l4[0]:\r\n f=i\r\n diff=l4[0]\r\n break\r\n elif l3.count(l4[1])==1:\r\n for i in l2:\r\n if l[i].index(\"*\")==l4[1]:\r\n f=i\r\n diff=l4[1]\r\n break\r\n else:\r\n flag=False\r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n if len(l3)==0:\r\n if d==1:\r\n print(\"YES\")\r\n print(p+1,1)\r\n elif(min(l3)==max(l3)):\r\n print(\"YES\")\r\n if(d==0):\r\n print(i+1,l3[0]+1)\r\n else:\r\n print(p+1,l3[0]+1)\r\n elif flag:\r\n \r\n print(\"YES\")\r\n if diff==l4[0]:\r\n print(f+1,l4[1]+1)\r\n else:\r\n print(f+1,l4[0]+1)\r\n else:\r\n print(\"NO\")\r\n\r\n", "st=input()\r\ntmp=st.split(' ')\r\nm=int(tmp[0])\r\nn=int(tmp[1])\r\nmapp=[]\r\noc=[]\r\nfor i in range(m):\r\n tmp=input()\r\n mapp.append(tmp)\r\n for j in range(n):\r\n if tmp[j]!='.':\r\n oc.append((i,j))\r\nfor x in range(m):\r\n for y in range(n):\r\n for i in oc:\r\n if i[0]!=x and i[1]!=y:\r\n break\r\n else:\r\n print('YES')\r\n print(x+1,y+1)\r\n exit()\r\nelse:\r\n print('NO')\r\n\r\n \r\n \r\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nx = [0] * n\r\ny = [0] * m\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '*':\r\n x[i] += 1\r\n y[j] += 1\r\n cnt += 1\r\nfor i in range(n):\r\n for j in range(m):\r\n cur = x[i] + y[j] - (a[i][j] == '*')\r\n if cur == cnt:\r\n print('YES')\r\n print(i + 1, j + 1)\r\n exit()\r\nprint('NO')\r\n", "t = input;p = print;r = range\r\nn, m = map(int, t().split())\r\na, x, y, c = [], [0]*n, [0]*m, 0\r\nfor i in r(n):\r\n a.append(t())\r\n for j in r(m):\r\n if a[i][j] == \"*\":\r\n x[i], y[j], c = x[i] + 1, y[j] + 1, c + 1\r\nfor i in r(n):\r\n for j in r(m):\r\n if x[i] + y[j] - (a[i][j] == \"*\") == c: p(\"YES\\n{0} {1}\".format(i + 1, j + 1));exit(0)\r\np(\"NO\")\r\n", "n, m = map(int, input().split())\r\n\r\nr = list()\r\nc = list()\r\n\r\nfor i in range(m):\r\n c.append(0)\r\nx = list()\r\n\r\nfor i in range(n):\r\n cur = str(input())\r\n count = cur.count('*')\r\n r.append(count)\r\n for j in range(m):\r\n if cur[j] == '*':\r\n c[j]+=1\r\n x.append(cur)\r\n\r\ntot = sum(r)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if x[i][j]=='*':\r\n if r[i]+c[j] -1 == tot:\r\n print(\"YES\")\r\n print(i+1, j+1)\r\n exit()\r\n else:\r\n if r[i]+c[j] == tot:\r\n print(\"YES\")\r\n print(i+1, j+1)\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "n, m = map(int, input().split())\n\nrows = [0] * n\ncolumns = [0] * m\n\ntable = []\nwalls = 0\n\nfor y in range(n):\n row = input()\n for x, ch in enumerate(row):\n if ch == '*':\n rows[y] += 1\n columns[x] += 1\n walls += 1\n table.append(row)\n\nok = False\nfor y in range(n):\n for x in range(m):\n if rows[y] + columns[x] + (-1 if table[y][x] == '*' else 0) == walls:\n print('YES')\n print(y+1, x+1)\n ok = True\n break\n if ok:\n break\nif not ok:\n print('NO')\n", "# -------------------------------#\r\n# INCLUDE <HajLorenzo>\r\n# INCLUDE <mega16.h>\r\n# Submit_Some_1400_ELO_:)\r\n# -------------------------------#\r\n\r\n\r\nimport sys\r\ninput=sys.stdin.readline\r\narray = []\r\n\r\na = list(map(int, input().split()))\r\n\r\nif (a[0] == 1 or a[1] == 1):\r\n for i in range(a[0]):\r\n tmp = input()\r\n print(\"YES\")\r\n print(\"1 1\")\r\nelse:\r\n r = [0 for i in range(a[0])]\r\n c = [0 for i in range(a[1])]\r\n TOTAL = 0\r\n for i in range(a[0]):\r\n tmp = input()\r\n array.append(tmp)\r\n if (\"*\" in tmp):\r\n r[i] += tmp.count(\"*\")\r\n TOTAL += r[i]\r\n for j in range(tmp.find(\"*\"), a[1]):\r\n if (tmp[j] == \"*\"):\r\n c[j] += 1\r\n max = max(c)\r\n for i in range(a[0]):\r\n if (r[i] + max >= TOTAL):\r\n for j in range(a[1]):\r\n if (r[i] + c[j] >= TOTAL):\r\n DF0X = r[i] + c[j]\r\n if (array[i][j] == \"*\"):\r\n DF0X -= 1\r\n if (DF0X == TOTAL):\r\n print(\"YES\")\r\n print(i + 1, end=\" \")\r\n print(j + 1)\r\n exit(0)\r\n print(\"NO\")\r\n\r\n# I This one Should Be Ok :)\r\n# Good\r\n", "n, m=map(int, input().split())\r\ns=[ input() for i in range(n) ]\r\nh=[ sum(1 if s[i][j]=='*' else 0 for j in range(m)) for i in range(n) ]\r\nv=[ sum(1 if s[j][i]=='*' else 0 for j in range(n)) for i in range(m) ]\r\nc=sum(h)\r\nans=(-1, -1)\r\nfor i in range(n):\r\n for j in range(m):\r\n if h[i]+v[j]-(1 if s[i][j]=='*' else 0)==c:\r\n ans=(i, j)\r\nif ans==(-1, -1):\r\n print('NO')\r\nelse:\r\n print('YES');\r\n print(ans[0]+1, ans[1]+1)\r\n'''\r\nn,m = map(int,input().split())\r\ncnt = 0\r\nx = 1\r\ny = 1\r\nG = [0]*(n+1)\r\nV = [0]*(m+1)\r\nfor i in range(n):\r\n a = list(input())\r\n G[i+1] = a.count('*')\r\n cnt += G[i+1]\r\n for j in range(m):\r\n if a[j] == '*':\r\n V[j+1] += 1\r\n\r\nif (G == [0, 1, 1] and V == [0, 1, 1]):\r\n print('YES')\r\n print(1,1)\r\n exit()\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n cur = V[j+1]+G[i+1]\r\n if (V[j+1]!=0 and G[i+1]!=0):\r\n cur -= 1\r\n if (cnt == cur):\r\n print('YES')\r\n print(i+1,' ',j+1)\r\n exit()\r\nprint('NO')\r\n'''", "def main():\r\n\t(n, m) = (int(x) for x in input().split())\r\n\tdepot = [None] * n\r\n\tfor i in range(n):\r\n\t\tdepot[i] = input()\r\n\t(valid, location) = solver(depot)\r\n\tif valid == \"YES\":\r\n\t\tprint(\"YES\")\r\n\t\t(row, col) = location\r\n\t\tprint(row + 1, col + 1)\r\n\telse:\r\n\t\tprint(\"NO\")\r\ndef solver(depot):\r\n\tbombs = [None] * len(depot)\r\n\tfor row in range(len(depot)):\r\n\t\tbombs[row] = bombCount(depot[row])\r\n\tbombRows = [row for row in range(len(bombs)) if bombs[row] == \"multiple\"]\r\n\tif len(bombRows) > 1:\r\n\t\treturn (\"NO\", None)\r\n\telse:\r\n\t\tbombSet = set(bombs)\r\n\t\tbombSet.discard(\"multiple\")\r\n\t\tbombSet.discard(\"-1\")\r\n\t\tif len(bombRows) == 1:\r\n\t\t\tif len(bombSet) > 1:\r\n\t\t\t\treturn (\"NO\", None)\r\n\t\t\telif len(bombSet) == 1:\r\n\t\t\t\tcol = bombSet.pop()\r\n\t\t\t\treturn (\"YES\", (bombRows[0], int(col)))\r\n\t\t\telse:\r\n\t\t\t\treturn (\"YES\", (bombRows[0], 0))\r\n\t\telif len(bombRows) == 0:\r\n\t\t\tif len(bombSet) > 2:\r\n\t\t\t\treturn (\"NO\", None)\r\n\t\t\telif len(bombSet) == 2:\r\n\t\t\t\tcol1 = bombSet.pop()\r\n\t\t\t\tcol2 = bombSet.pop()\r\n\t\t\t\tcol1Rows = [row for row in range(len(bombs)) if bombs[row] == col1]\r\n\t\t\t\tcol2Rows = [row for row in range(len(bombs)) if bombs[row] == col2]\r\n\t\t\t\tif len(col1Rows) > 1:\r\n\t\t\t\t\tif len(col2Rows) > 1:\r\n\t\t\t\t\t\treturn (\"NO\", None)\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\treturn (\"YES\", (col2Rows[0], int(col1)))\r\n\t\t\t\telse:\r\n\t\t\t\t\treturn (\"YES\", (col1Rows[0], int(col2)))\r\n\t\t\telif len(bombSet) == 1:\r\n\t\t\t\tcol = bombSet.pop()\r\n\t\t\t\treturn (\"YES\", (0, int(col)))\r\n\t\t\telse:\r\n\t\t\t\treturn (\"YES\", (0, 0))\r\n\t\telse:\r\n\t\t\tassert(False)\r\n\r\ndef bombCount(s):\r\n\tcount = 0\r\n\tbombCol = -1\r\n\tfor col in range(len(s)):\r\n\t\tif s[col] == '*':\r\n\t\t\tcount += 1\r\n\t\t\tbombCol = col\r\n\tif count > 1:\r\n\t\treturn \"multiple\"\r\n\telse:\r\n\t\treturn str(bombCol)\r\n\r\n# depot1 = [\"..*..\",\r\n# \"..*..\",\r\n# \"*****\",\r\n# \"..*..\",\r\n# \"..*..\",\r\n# \"..*..\"]\r\n\r\n# depot2 = [\".*..\"\r\n# \"....\",\r\n# \".*..\"]\r\n\r\n# depot3 = [\".\"\r\n# \".\",\r\n# \".\",\r\n# \".\"]\r\n\r\n# print(solver(depot1))\r\n# print(solver(depot2))\r\n# print(solver(depot3))\r\n\r\nmain()", "import sys\ninput=sys.stdin.readline\nn,m = map(int,input().split())\ns = [input() for i in range(n)]\nrow = [0]*n; col = [0]*m\nbom = 0\nfor i in range(n):\n for j in range(m):\n row[i]+= s[i][j] == '*'\n col[j]+= s[i][j] == '*'\n bom+=s[i][j] == '*'\nfor i in range(n):\n for j in range(m):\n if row[i] + col[j] - (s[i][j] == '*') == bom:\n print('YES')\n print(i+1,j+1)\n exit()\nprint('NO')\n", "def main():\n n, m = map(int, input().split())\n xx, yy, walls, t = [0] * n, [0] * m, set(), 0\n for x in range(n):\n for y, c in enumerate(input()):\n if c == '*':\n t += 1\n if t == n + m:\n print(\"NO\")\n return\n walls.add((x, y))\n xx[x] += 1\n yy[y] += 1\n for x, a in enumerate(xx):\n for y, b in enumerate(yy):\n if a + b - ((x, y) in walls) == t:\n print(\"YES\")\n print(x + 1, y + 1)\n return\n print(\"NO\")\n\n\nif __name__ == '__main__':\n main()\n", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n a.append(s)\r\nr=[0]*n\r\nc=[0]*m\r\nf=0\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]=='*':\r\n r[i]+=1\r\n c[j]+=1\r\n cnt+=1\r\nr1=0\r\nc1=0\r\nfor i in range(n):\r\n if (f):\r\n break\r\n for j in range(m):\r\n d=r[i]+c[j]\r\n if a[i][j]==\"*\":\r\n d-=1\r\n if d==cnt:\r\n f=1\r\n r1=i\r\n c1=j\r\n break\r\n \r\n \r\n \r\n#print(cnt,r1,c1,r,c)\r\nif (f==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(r1+1,c1+1)\r\n ", "# 699B\r\n# O(n*m) time\r\n# θ(m) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n n, m = read(3)\r\n w1 = w2 = b = None\r\n for i in range(n):\r\n s = read(0)\r\n for j in range(m):\r\n if s[j] == '*':\r\n if w1 is None:\r\n w1 = [i, j]\r\n elif w2 is None:\r\n w2 = [i, j]\r\n elif b is None:\r\n if w1[0] == w2[0]:\r\n if w1[0] < i:\r\n b = [w1[0], j]\r\n elif w1[1] == w2[1]:\r\n if w1[1] != j:\r\n b = [i, w1[1]]\r\n elif w2[0] == i:\r\n b = [i, w1[1]]\r\n elif w1[1] == j:\r\n b = [w2[0], j]\r\n elif w2[1] == j:\r\n b = [w1[0], j]\r\n else:\r\n return 'NO'\r\n elif b[0] != i and b[1] != j:\r\n return 'NO'\r\n if b is None:\r\n if w1 is None:\r\n b = [0, 0]\r\n elif w2 is None:\r\n b = w1\r\n else:\r\n b = [w1[0], w2[1]]\r\n return 'YES\\n' + str(b[0] + 1) + ' ' + str(b[1] + 1)\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nwrite(main())", "# -------------------------------#\r\n# INCLUDE <HajLorenzo>\r\n# INCLUDE <mega16.h>\r\n# Submit_Some_1400_ELO_:)\r\n# -------------------------------#\r\n\r\narray=[]\r\n\r\na=list(map(int,input().split()))\r\n\r\nif(a[0]==1 or a[1]==1):\r\n for i in range(a[0]):\r\n tmp = input()\r\n print(\"YES\")\r\n print(\"1 1\")\r\nelse:\r\n r=[0 for i in range(a[0])]\r\n c=[0 for i in range(a[1])]\r\n TOTAL=0\r\n for i in range(a[0]):\r\n tmp=input()\r\n array.append(tmp)\r\n if (\"*\" in tmp):\r\n r[i]+=tmp.count(\"*\")\r\n TOTAL+=r[i]\r\n for j in range(tmp.find(\"*\"),a[1]):\r\n if(tmp[j]==\"*\"):\r\n c[j]+=1\r\n max=max(c)\r\n for i in range(a[0]):\r\n if(r[i]+max>=TOTAL):\r\n for j in range(a[1]):\r\n if(r[i]+c[j]>=TOTAL):\r\n DF0X=r[i] + c[j]\r\n if(array[i][j]==\"*\"):\r\n DF0X-=1\r\n if(DF0X==TOTAL):\r\n print(\"YES\")\r\n print(i+1,end=\" \")\r\n print(j+1)\r\n exit(0)\r\n print(\"NO\")\r\n\r\n#I This one Should Be Ok :)\r\n#Good", "def main():\r\n n, m = map(int, input().split())\r\n arr = [input() for _ in range(n)]\r\n\r\n count_bombs_row, count_bombs_column = [0 for _ in range(n)], [0 for _ in range(m)]\r\n\r\n total_bombs = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"*\":\r\n total_bombs += 1\r\n count_bombs_row[i] += 1\r\n count_bombs_column[j] += 1\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n destroyed_walls = count_bombs_row[i] + count_bombs_column[j]\r\n\r\n if arr[i][j] == \"*\":\r\n destroyed_walls -= 1\r\n\r\n if destroyed_walls == total_bombs:\r\n print(\"YES\")\r\n print(i + 1, j + 1)\r\n return\r\n\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def str_inp(n):\r\n return [input() for x in range(n)]\r\n\r\n\r\ndef arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef get_col(arr, i):\r\n return ''.join([row[i] for row in arr])\r\n\r\n\r\nfrom sys import *\r\nfrom collections import defaultdict\r\n\r\nr, c = arr_inp()\r\ndepot, total, memr, memc = str_inp(r), 0, defaultdict(int), defaultdict(int)\r\n\r\nfor i in range(r):\r\n row = depot[i].count('*')\r\n memr[i] = row\r\n total += row\r\n\r\nfor i in range(c):\r\n col = get_col(depot, i).count('*')\r\n memc[i] = col\r\n\r\nfor i in range(r):\r\n for j in range(c):\r\n num = total - (memr[i] + memc[j])\r\n if depot[i][j] == '*':\r\n num += 1\r\n if num == 0:\r\n print('YES')\r\n exit(print(i + 1, j + 1))\r\nprint('NO')\r\n", "n, m = map(int, input().split())\r\ns = [input() for i in range(n)]\r\nh = [sum((1 if s[i][j]=='*' else 0) for j in range(m)) for i in range(n)]\r\nv = [sum((1 if s[j][i]=='*' else 0) for j in range(n)) for i in range(m)]\r\nc = sum(h)\r\nres = (-1, -1)\r\nfor i in range(n):\r\n for j in range(m):\r\n if h[i] + v[j] - (1 if s[i][j]=='*' else 0) == c:\r\n res = (i, j)\r\nif res == (-1, -1):\r\n print('NO')\r\nelse:\r\n print('YES');\r\n print(res[0]+1, res[1]+1)\r\n", "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,m = ilele()\r\nA= []\r\nfor i in range(n):\r\n B = input()\r\n A.append(B)\r\nc = 0\r\nk1,k2 = -1,-1\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j] == \"*\":\r\n c+= 1\r\n k1,k2 = i,j\r\nif c == 0:\r\n Y(1)\r\n print(1,1)\r\n exit(0)\r\n \r\ndef fun(i,j):\r\n d = 0\r\n for l in range(n):\r\n if A[l][j] == \"*\":\r\n d += 1\r\n for l in range(m):\r\n if A[i][l] == \"*\":\r\n d += 1\r\n if A[i][j] == \"*\":\r\n d-=1\r\n return d\r\n\r\nF = [k1,k2]\r\nfor i in range(n):\r\n for j in range(m):\r\n if i in F or j in F:\r\n d = fun(i,j)\r\n if c == d:\r\n Y(1)\r\n print(i+1,j+1)\r\n exit(0)\r\nY(0)", "from collections import defaultdict as dc\r\nn,m=[int(x) for x in input().split()]\r\narr=list()\r\nwall=0\r\nfor _ in range(n):\r\n x=input()\r\n arr.append(x)\r\n for i in x:\r\n if i=='*':wall+=1\r\nrow,col=dc(lambda:0),dc(lambda:0)\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j]=='*':row[i]+=1; col[j]+=1\r\n#print(row[2],col[1])\r\nansr,ansc=-1,-1\r\nflag=0\r\nfor i in range(n):\r\n if flag:break\r\n for j in range(m):\r\n tmp=row[i]+col[j]\r\n if arr[i][j]=='*':tmp-=1\r\n if tmp>=wall:ansr=i+1; ansc=j+1; flag=1; break\r\nif flag:print(\"YES\"); print(ansr,ansc)\r\nelse:print(\"NO\")", "def main():\r\n n, m = [int(x) for x in input().split()]\r\n\r\n board = []\r\n cols = [0] * m\r\n rows = [0] * n\r\n total = 0\r\n for i in range(0, n):\r\n r = input()\r\n board.append(r)\r\n for j in range(0, m):\r\n if r[j] == '*':\r\n cols[j] += 1\r\n rows[i] += 1\r\n total += 1\r\n\r\n for i in range(0, n):\r\n for j in range(0, m):\r\n count = rows[i] + cols[j]\r\n if board[i][j] == '*':\r\n count -= 1\r\n if count == total:\r\n print(\"YES\")\r\n print(i + 1, j + 1)\r\n return\r\n\r\n print(\"NO\")\r\n\r\nmain()", "n,m=map(int,input().split())\r\nr,c,l,z=[0]*n,[0]*m,[],0\r\nfor i in range(n):\r\n q=input()\r\n l+=[q]\r\n for j in range(m):\r\n if q[j]==\"*\":\r\n r[i]+=1\r\n c[j]+=1\r\n z+=1\r\nfor i in range(n):\r\n for j in range(m):\r\n if r[i]+c[j]-(l[i][j]==\"*\")==z:\r\n exit(print(\"YES\\n\",i+1,j+1))\r\nprint(\"NO\")", "#!/usr/bin/env pypy3\r\n\r\nimport array\r\nimport itertools\r\n\r\nIMPOSSIBLE = (-1, -1)\r\n\r\n\r\ndef place_bomb(height, width, is_wall):\r\n # zero-based\r\n walls_row = array.array(\"L\", (sum(row) for row in is_wall))\r\n walls_column = array.array(\"L\")\r\n for column_idx in range(width):\r\n walls_column.append(sum(is_wall[r][column_idx] for r in range(height)))\r\n total_walls = sum(walls_row)\r\n for bomb_r, bomb_c in itertools.product(range(height), range(width)):\r\n wiped_walls = walls_row[bomb_r] + walls_column[bomb_c]\r\n wiped_walls -= is_wall[bomb_r][bomb_c]\r\n if wiped_walls == total_walls:\r\n # one-based\r\n return (bomb_r + 1, bomb_c + 1)\r\n else:\r\n return IMPOSSIBLE\r\n\r\n\r\ndef main():\r\n height, width = map(int, input().split())\r\n is_wall = [array.array(\"B\",\r\n map(lambda c: c == \"*\", input())) for _ in range(height)]\r\n ans = place_bomb(height, width, is_wall)\r\n if ans != IMPOSSIBLE:\r\n print(\"YES\")\r\n print(*ans)\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m=map(int, input().split())\r\ns=[ input() for i in range(n) ]\r\nh=[ sum(1 if s[i][j]=='*' else 0 for j in range(m)) for i in range(n) ]\r\nv=[ sum(1 if s[j][i]=='*' else 0 for j in range(n)) for i in range(m) ]\r\nc=sum(h)\r\nans=(-1, -1)\r\nfor i in range(n):\r\n for j in range(m):\r\n if h[i]+v[j]-(1 if s[i][j]=='*' else 0)==c:\r\n ans=(i, j)\r\nif ans==(-1, -1):\r\n print('NO')\r\nelse:\r\n print('YES');\r\n print(ans[0]+1, ans[1]+1)", "import sys, math, string, fractions, functools, collections\r\nsys.setrecursionlimit(10**7)\r\nRI=lambda x=' ': list(map(int,input().rstrip().split(x)))\r\nRS=lambda x=' ': input().rstrip().split(x)\r\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\r\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\r\nmod=int(1e9+7)\r\neps=1e-6\r\nMAX=1010\r\n#################################################\r\ncol=[0]*MAX\r\nrow=[0]*MAX\r\ntot=0\r\nn, m = RI()\r\ns=[0]*MAX\r\nfor i in range(n):\r\n s[i]=RS()[0]\r\n for j in range(m):\r\n if s[i][j]=='*':\r\n row[i]+=1\r\n col[j]+=1\r\n tot+=1\r\nfor i in range(n):\r\n for j in range(m):\r\n if row[i]+col[j]- (s[i][j]=='*')==tot:\r\n print(\"YES\")\r\n print(i+1, j+1)\r\n exit(0)\r\nprint(\"NO\")", "n,m=[int(x) for x in input().split()]\r\ndepot=[]\r\nr=[]\r\nc=[]\r\nflag=True\r\nfor i in range(n):\r\n row=input()\r\n r.append(row.count('*'))\r\n depot.append(row)\r\nfor j in range(m):\r\n column=''.join([x[j] for x in depot])\r\n c.append(column.count('*'))\r\nwall=sum(r)\r\nfor i in range(n):\r\n for j in range(m):\r\n if depot[i][j]=='*':\r\n bomb=r[i]+c[j]-1\r\n else:\r\n bomb=r[i]+c[j]\r\n if bomb==wall:\r\n print('YES')\r\n print(i+1,j+1)\r\n flag=False\r\n break\r\n if not flag:\r\n break\r\nif flag:\r\n print('NO')\r\n", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodechef: ayush572000\r\nCodeforces: servermonk\r\n\r\n\"\"\"\r\n# import sys\r\n# input = sys.stdin.buffer.readline\r\n\r\ndef solution():\r\n n,m=map(int,input().split())\r\n l=[]\r\n r=[0]*1001\r\n c=[0]*1001\r\n cnt=0\r\n for i in range(n):\r\n x=list(input())\r\n # print(x)\r\n for j in range(m):\r\n if x[j]=='*':\r\n cnt+=1\r\n r[i]+=1\r\n c[j]+=1\r\n l.append(x)\r\n # print(cnt)\r\n for i in range(n):\r\n for j in range(m):\r\n x=r[i]+c[j]\r\n if l[i][j]=='*':\r\n x-=1\r\n if x==cnt:\r\n print('YES')\r\n print(i+1,j+1)\r\n exit(0)\r\n\r\n print('NO')\r\n\r\nsolution()", "def solve(x, y):\r\n\t\r\n\ta = list()\r\n\tcnt = 0\r\n\tfor i in range(n):\r\n\t\ta += [input()]\r\n\t\tfor j in range(m):\r\n\t\t\tif a[i][j] == '*':\r\n\t\t\t\tx[i] += 1\r\n\t\t\t\ty[j] += 1\r\n\t\t\t\tcnt += 1\r\n\t\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tif x[i] + y[j] - (a[i][j] == '*') == cnt:\r\n\t\t\t\tprint('YES')\r\n\t\t\t\tprint(i+1,j+1)\r\n\t\t\t\texit(0)\r\n\tprint('NO')\r\n\t\r\nn, m = map(int,input().split())\r\nsolve([0] * n, [0] * m)", "from collections import defaultdict\r\nn,m = map(int,input().split())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(input()))\r\nrow_count = [0]*n\r\ncol_count = [0]*m\r\nfor i in range(n):\r\n row_count[i] = arr[i].count(\"*\")\r\nfor i in range(m):\r\n temp = 0\r\n for j in range(n):\r\n if arr[j][i]==\"*\":\r\n temp+=1\r\n col_count[i] = temp\r\ntotal_count = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j]==\"*\":\r\n total_count+=1\r\nfor i in range(n):\r\n for j in range(m):\r\n cnt = row_count[i]+col_count[j]\r\n if arr[i][j]==\"*\":\r\n cnt-=1\r\n if cnt==total_count:\r\n print(\"YES\")\r\n print(i+1,j+1)\r\n exit()\r\nprint(\"NO\")\r\n", "t = input\np = print\nr = range\nn, m = map(int, t().split())\na, x, y, c = [], [0] * n, [0] * m, 0\nfor i in r(n):\n a.append(t())\n for j in r(m):\n if a[i][j] == \"*\":\n x[i] += 1\n y[j] += 1\n c += 1\nfor i in r(n):\n for j in r(m):\n if x[i] + y[j] - (a[i][j] == \"*\") == c:\n p(\"YES\\n\", i + 1, \" \", j + 1, sep=\"\")\n exit(0)\np(\"NO\")\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nbombs = []\r\nfor i in range(n):\r\n line = input()\r\n for j in range(m):\r\n if line[j] == '*':\r\n bombs.append((i, j))\r\nif len(bombs) > n + m - 1:\r\n print(\"NO\")\r\nelse:\r\n for i in range(n):\r\n bombs_left = [(r, c) for (r, c) in bombs if r != i]\r\n unique_cols = set([c for (r, c) in bombs_left])\r\n if len(unique_cols) == 0:\r\n print(\"YES\")\r\n print(str(i + 1) + \" 1\")\r\n break\r\n elif len(unique_cols) == 1:\r\n print(\"YES\")\r\n print(str(i + 1) + \" \" + str(list(unique_cols)[0] + 1))\r\n break\r\n else:\r\n print(\"NO\")\r\n ", "t=input;p=print;r=range;s=sum;n,m=map(int,t().split());a=[t() for i in r(n)];g=[[a[j][i] for j in r(n)] for i in r(m)];x,y=[a[i].count(\"*\") for i in r(n)],[g[i].count(\"*\") for i in r(m)];c=(s(x)+s(y))//2\r\nfor i in r(n):\r\n for j in r(m):\r\n if x[i]+y[j]-(a[i][j] == \"*\")==c:p(\"YES\\n\",i+1,\" \",j+1,sep=\"\");exit(0)\r\np(\"NO\")\r\n", "import sys\r\ninput= lambda:sys.stdin.readline()\r\n\r\nMOD = 1000000007\r\nii = lambda: int(input())\r\nsi = lambda: input()\r\ndgl = lambda: list(map(int, input()))\r\nf = lambda: list(map(int, input().split()))\r\nil = lambda: list(map(int, input().split()))\r\nls = lambda: list(input())\r\nlr=[]\r\nlc=[]\r\nl=[]\r\nn,m=f()\r\ncnt=0\r\nfor _ in range(n):\r\n x=si()\r\n cnt=x.count('*')\r\n lr.append(cnt)\r\n l.append(x)\r\nfor i in range(m):\r\n cnt=0\r\n for j in range(n):\r\n cnt+=(l[j][i]=='*')\r\n lc.append(cnt)\r\ntcnt=sum(lr)\r\nfor i in range(n):\r\n for j in range(m):\r\n if (lr[i]+lc[j]-(l[i][j]=='*'))==tcnt:\r\n print('YES')\r\n print(i+1,j+1)\r\n exit()\r\nprint('NO')", "t=input;p=print;r=range;n,m=map(int,t().split());a,x,y,c=[],[0]*n,[0]*m,0\nfor i in r(n):\n a.append(t())\n for j in r(m):\n if a[i][j]==\"*\":x[i]+=1;y[j]+=1;c+=1\nfor i in r(n):\n for j in r(m):\n if x[i]+y[j]-(a[i][j] == \"*\")==c:p(\"YES\\n\",i+1,\" \",j+1,sep=\"\");exit(0)\np(\"NO\")\n \t \t\t\t \t\t \t \t \t \t\t \t \t", "sizeI, sizeJ = map(int, input().split())\r\na = [input() for _ in range(sizeI)]\r\ncntRow = [row.count('*') for row in a]\r\ncntCol = [col.count('*') for col in zip(*a)]\r\ncnt = sum(cntRow)\r\nfor i in range(sizeI):\r\n for j in range(sizeJ):\r\n dead = cntRow[i] + cntCol[j] - (a[i][j] == '*')\r\n if dead == cnt:\r\n print('YES\\n%d %d' % (i + 1, j + 1))\r\n exit()\r\nprint('NO')", "n,m=map(int,input().split())\ns=[input() for i in range(n)]\nk=sum(s[i].count('*') for i in range(n))\nr=[i.count('*') for i in s]\nc=[i.count('*') for i in zip(*s)]\nfor i in range(n):\n for j in range(m):\n if r[i]+c[j]-(s[i][j]=='*')==k:\n print('YES\\n',i+1,j+1)\n exit(0)\nprint('NO')\n" ]

[ "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**15\nmod = 10**9+7\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 n,k = LI()\n a = LI()\n r = a[:]\n s = []\n m = 1\n for c in a:\n if c == m:\n m += 1\n t = len(s)\n for i in range(t-1,-1,-1):\n if s[i] == m:\n m += 1\n t = i\n else:\n break\n if t != len(s):\n s = s[:t]\n else:\n s.append(c)\n for i in range(len(s)-1):\n if s[i] < s[i+1]:\n return -1\n\n for i in range(len(s)-1,-1,-1):\n c = s[i]\n r += list(range(c-1,m-1,-1))\n m = c+1\n r += list(range(n,m-1,-1))\n\n return ' '.join(map(str,r))\n\nprint(main())\n\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nb = [0]\r\ns = [n + 1]\r\nmi = 1\r\nfor i in p:\r\n if i < s[-1]:\r\n s.append(i)\r\n else:\r\n ans = -1\r\n print(ans)\r\n exit()\r\n while mi == s[-1]:\r\n b.append(s.pop())\r\n mi += 1\r\ns.append(mi - 1)\r\nl = len(s)\r\nfor _ in range(l - 1):\r\n for i in range(s[-2] - 1, s[-1], -1):\r\n p.append(i)\r\n s.pop()\r\nprint(*p)", "# https://codeforces.com/problemset/problem/911/E\r\n\r\nn, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nd = {x:1 for x in p}\r\n\r\ndef solve(p, d, n):\r\n add = []\r\n s = []\r\n \r\n for x in range(1, n+1):\r\n if x not in d:\r\n while len(p) > 0:\r\n s.append(p.pop(0))\r\n \r\n if len(s) >= 2 and s[-1] > s[-2]:\r\n return False, None\r\n \r\n # len(p)=0\r\n if len(s) == 0 or s[-1] != x:\r\n up = n if len(s) == 0 else s[-1]-1\r\n \r\n for y in range(up, x-1, -1):\r\n add.append(y)\r\n s.append(y)\r\n d[y]=1\r\n s.pop()\r\n else:\r\n if len(s) == 0 or s[-1] != x:\r\n while len(p) > 0:\r\n s.append(p.pop(0))\r\n \r\n if len(s) >= 2 and s[-1] > s[-2]:\r\n return False, None\r\n \r\n if s[-1] == x:\r\n break\r\n s.pop()\r\n return True, add\r\n\r\nans = [x for x in p]\r\nflg, add = solve(p, d, n)\r\nif flg==False:\r\n print(-1)\r\nelse:\r\n print(' '.join([str(x) for x in ans+add]))", "import sys\r\nf=sys.stdin\r\nn,k=map(int,f.readline().split())\r\ns,t=[n+1],1\r\na=list(map(int,f.readline().split()))\r\nfor i in range(n):\r\n\tif i>=k:\r\n\t\ta+=[s[-1]-1]\r\n\ts+=[a[i]]\r\n\twhile (len(s)!=0) and (s[-1]==t):\r\n\t\ts.pop()\r\n\t\tt+=1\r\nif len(s):\r\n\tprint('-1')\r\nelse:\r\n\tprint(' '.join(str(x) for x in a))", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nres = [0]\r\nused = [False]*(n+1)\r\nstack = []\r\n\r\nfor a in A:\r\n used[a] = True\r\n if res[-1]+1 == a:\r\n res.append(a)\r\n while stack and res[-1]+1 == stack[-1]:\r\n res.append(stack.pop())\r\n else:\r\n if stack and stack[-1] < a:\r\n print(-1)\r\n exit()\r\n stack.append(a)\r\n\r\nstack = [n+1]+stack+[0]\r\nfor i in range(len(stack)-2, -1, -1):\r\n for j in range(stack[i]-1, stack[i+1], -1):\r\n if not used[j]:\r\n A.append(j)\r\nprint(*A)\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn,k = map(int,input().split())\r\np = list(map(int,input().split()))\r\n\r\nblocks = [[1,n]]\r\n\r\nfail = 0\r\nfor i in range(k):\r\n if blocks[-1][0] <= p[i] <= blocks[-1][1]:\r\n if p[i] == blocks[-1][0]:\r\n blocks[-1][0] += 1\r\n elif p[i] == blocks[-1][1]:\r\n blocks[-1][1] -= 1\r\n else:\r\n blocks.append([blocks[-1][0],p[i] - 1])\r\n blocks[-2][0] = p[i] + 1\r\n\r\n if blocks[-1][0] > blocks[-1][1]: # block was just 1 thick and = p[i]\r\n blocks.pop()\r\n\r\n else:\r\n fail = 1\r\n\r\nif fail:\r\n print(-1)\r\nelse:\r\n for i in p[::-1]:\r\n blocks.append([i,i])\r\n\r\n while blocks:\r\n block = blocks.pop()\r\n print(*range(block[1],block[0]-1,-1), end = ' ')\r\n", "import sys\r\n\r\nn, k = map(int, sys.stdin.buffer.readline().decode('utf-8').split())\r\na = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\nresult = [0]\r\nused = [0]*(n+1)\r\nstack = []\r\n\r\nfor x in a:\r\n used[x] = 1\r\n if result[-1]+1 == x:\r\n result.append(x)\r\n while stack and result[-1]+1 == stack[-1]:\r\n result.append(stack.pop())\r\n else:\r\n if stack and stack[-1] < x:\r\n print(-1)\r\n exit()\r\n stack.append(x)\r\n\r\nstack = [n+1] + stack + [0]\r\nfor i in range(len(stack)-2, -1, -1):\r\n for j in range(stack[i]-1, stack[i+1], -1):\r\n if not used[j]:\r\n a.append(j)\r\n\r\nsys.stdout.buffer.write(' '.join(map(str, a)).encode('utf-8'))\r\n", "import sys\r\n \r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nsetofa = set(a)\r\ns = []\r\nf= False\r\nai = 0\r\nans = []\r\nfor i in range(1, n+1):\r\n if i in setofa:\r\n while ai < k and (len(s)==0 or s[-1]!=i):\r\n s.append(a[ai])\r\n ai += 1\r\n if len(s) == 0 or s[-1] != i:\r\n f = True\r\n break\r\n s.pop(-1)\r\n a += ans[::-1]\r\n ans = []\r\n else:\r\n if ai != k:\r\n s += a[ai:k]\r\n ai = k\r\n ans.append(i)\r\n \r\nif f:\r\n print(-1)\r\nelse:\r\n print(' '.join(map(str, a + ans[::-1])))" ]

[ "# eople in the Tomskaya region like magic formulas very much. You can see some of them below.\n\n# Imagine you are given a sequence of positive integer numbers p1, p2, ..., pn. Lets write down some magic formulas:\n\n\n\n# Here, \"mod\" means the operation of taking the residue after dividing.\n\n# The expression means applying the bitwise xor (excluding \"OR\") operation to integers x and y. The given operation exists in all modern programming languages. For example, in languages C++ and Java it is represented by \"^\", in Pascal — by \"xor\".\n\n# People in the Tomskaya region like magic formulas very much, but they don't like to calculate them! Therefore you are given the sequence p, calculate the value of Q.\n\n# Input\n# The first line of the input contains the only integer n (1 ≤ n ≤ 106). The next line contains n integers: p1, p2, ..., pn (0 ≤ pi ≤ 2·109).\n\n# Output\n# The only line of output should contain a single integer — the value of Q.\n\n# Examples\n# inputCopy\n# 3\n# 1 2 3\n# outputCopy\n# 3\n\n# Because the XOR operation satisfies the law of exchange,\n\n# So formula 2 = p1 ^ p2 ^ ...... ^ pn ^ (1% 1) ^ (1% 2) ^ ...... (1% n) ^ (2% 1)% (2% 2) ^ ...... ^ (2 % n) ^ ...... ^ (n% 1) ^ (n% 2) ^ ...... ^ (n% n)\n\n# =p1 ^ p2 ^ ...... ^ pn ^ (1% 1) ^ (2% 1) ^ ... (n% 1) ^ (1% 2) ^ (2% 2) ^ ...... ^ (n% 2 ) ^ ...... ^ (1% n)% (2% n) ^ ...... ^ (n% n)\n\n# And for any positive integer k, (1 ~ n)% k will only have k results of 0 ~ (k-1), so (1% k), (2% k) ... (n% k) It is regular, that is (1% k) ^ (2% k) ^ ... ^ (n% k) is regular.\n\n# For example, when n = 15 and k = 7, the results of (1% k), (2% k) ... (n% k) are shown in the table below.\n\n\n# According to the XOR principle, a ^ a = 0, 0 ^ a = a; so the XOR results in the two red lines in the figure are 0. So ( 1% 7) ^ (2% 7) ^ ...... ^ (15% 7) = 1;\n\n# Another example is when n = 25 and k = 7. The results of ( 1% 7), (2% 7) ... (25% 7) are shown in the table below.\n\n\n# So ( 1% 7) ^ (2% 7) ^ ...... ^ (25% 7) = 5 ^ 6 ^ 0 = 3\n# Therefore, when dealing with this problem, you can use an array a to save the result of 1 XOR to n, and then enumerate k = 1 ~ n, find out how many entire rows have the remainder 0 ~ (k-1), and finally Calculate the part that is less than one full line.\n\n# Meaning of the questions:\n\n# Give N (1 ~ 10 ^ 6) the number of representatives of N, given p1 ...... pn (0 ~ 2 x 10 ^ 9). Seeking and given two formulas.\n\n \n\n# Ideas:\n\n# Mathematics. 0 to any number of different or all the same (0 ^ x == x), or any number of different time itself is 0 (x ^ x == 0), the XOR two times itself. (X ^ x ^ x == x). So-column table to observe the law:\n\n# Row\n\n# % \n\n# Row\n\n# 1\t2\t3\t4\t5\t6\t7\t8\t9\t10\n# 1\t0\t1\t1\t1\t1\t1\t1\t1\t1\t1\n# 2\t0\t0\t2\t2\t2\t2\t2\t2\t2\t2\n# 3\t0\t1\t0\t3\t3\t3\t3\t3\t3\t3\n# 4\t0\t0\t1\t0\t4\t4\t4\t4\t4\t4\n# 5\t0\t1\t2\t1\t0\t5\t5\t5\t5\t5\n# 6\t0\t0\t0\t2\t1\t0\t6\t6\t6\t6\n# 7\t0\t1\t1\t3\t2\t1\t0\t7\t7\t7\n# 8\t0\t0\t2\t0\t3\t2\t1\t0\t8\t8\n# 9\t0\t1\t0\t1\t4\t3\t2\t1\t0\t9\n# 10\t0\t0\t1\t2\t0\t4\t3\t2\t1\t0\n# Can be found, a value of 0 on the diagonal upper triangular elements ranks number. Row to see not see anything, but in a column view, you can see that each module corresponds in cycles. And this period is (n / i), if the cycle is an even number, it becomes 0 can be ignored, if it is odd, the exclusive OR result is 0 ^ 1 ^ ...... ^ i - 1. In addition, if the (n% i) is not equal to 0, also need to be described XOR 1 ^ ...... ^ (n% i) ^ (0) (0 XOR after optional, does not change because the XOR 0 its value, so that the back of the pretreatment polyisocyanate 0 or it is not affected), so a good continuous pretreatment 0 XOR values ​​corresponding to each of n.\n\n# After the deal, according to the period and the remainder of the XOR can be the answer. \n\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n \n# using namespace std;\n \n# const int MAX = 1000001;\n \n# int num[MAX];\n \n# void solve () {\n# num[0] = 0;\n# for (int i = 1; i < MAX; ++i)\n# num[i] = num[i - 1] ^ i;\n# }\n \n# int main() {\n# int n, ans = 0;\n \n# solve();\n \n# scanf(\"%d\", &n);\n \n# for (int i = 1; i <= n; ++i) {\n# int a;\n# scanf(\"%d\", &a);\n# ans ^= a;\n# if ((n / i) % 2) ans ^= num[i - 1];\n# if (n % i) ans ^= num[n % i];\n# }\n \n# printf(\"%d\\n\", ans);\n \n# return 0;\n# }\n\nimport sys, math\nfrom copy import deepcopy as dc\nfrom bisect import bisect_left, bisect_right\ndef findXOR(n):\n remainder = n%4\n if remainder ==0:\n return n\n elif remainder == 1:\n return 1\n elif remainder ==2:\n return n+1\n else:\n return 0\ndef solution(list1):\n answer = 0\n length = len(list1)\n for i in range(length):\n answer ^=list1[i]\n modded = i+1\n place = length//modded\n if place%2==0:\n answer ^= findXOR(length%modded)\n else:\n answer ^= findXOR(modded-1) ^ findXOR(length%modded)\n return answer\n\nn = int(input())\nlist1 = [int(x) for x in input().split()]\nprint(solution(list1))", "n,a=int(input()),list(map(int,input().split()))\r\nx=[0]*(n+1)\r\ns=0\r\nfor i in range(1,n+1):\r\n x[i]=i^x[i-1]\r\n if (n//i)%2:\r\n s^=x[i-1]\r\n s^=x[n%i]\r\n s^=a[i-1]\r\nprint(s)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nans=0\r\npxor=[0]\r\nfor i in range(1,n+1):\r\n pxor.append(i^pxor[i-1])\r\nfor i in range(1,n+1):\r\n block=n//i\r\n remain=n%i\r\n if block%2==1:\r\n ans^=pxor[i-1]\r\n ans^=pxor[remain]\r\nfor x in arr:\r\n ans^=x\r\nprint(ans)", "import sys\nfrom math import *\nfrom fractions import gcd\nreadints=lambda:map(int, input().strip('\\n').split())\n\nn=int(input())\na=list(readints())\n\n\n# for k in range(1,9):\n# buf=''\n# for i in range(1,9):\n# buf+=str(i%k)+' '\n# print(buf)\n\nP=0\nfor p in a:\n P = P ^ p\n\nmaxn = 10**6 + 5\nprefix=[0]*maxn\nfor i in range(1,maxn):\n prefix[i] = prefix[i-1]^i\n\n\n\ncur = 0\nfor k in range(1,n+1):\n base=n//k\n if base%2==1:\n cur = cur ^ prefix[k-1]\n cur = cur ^ prefix[n%k]\n\n\nQ = cur ^ P\nprint(Q)\n \n", "n=int(input())\r\na=list(map(int,input().strip().split(\" \")))\r\nd=[0 for _ in range(n+1)]\r\nfor i in range(1,n+1):\r\n d[i]^=i^d[i-1]\r\nk=[]\r\nfor i in range(n):\r\n if (n//(i+1))%2:\r\n k.append(a[i]^d[i]^d[n%(i+1)])\r\n else:\r\n k.append(a[i]^d[n%(i+1)])\r\n \r\nans=0\r\n\r\nfor j in k:\r\n ans^=j\r\nprint(ans)", "\r\nfrom functools import reduce\r\n\r\nR = lambda: map(int, input().split())\r\n\r\nn = int(input())\r\na = R()\r\nans = reduce(lambda x, y: x ^ y, a)\r\nf = [0]\r\nfor i in range(1, n + 1):\r\n f.append(f[-1] ^ i)\r\n\r\nfor i in range(1, n + 1):\r\n if (n // i) % 2:\r\n ans ^= f[i - 1]\r\n ans ^= f[n % i]\r\n\r\nprint(ans)", "'''input\n3\n1 2 3\n'''\n\nfrom sys import stdin, stdout\n\n\n# main starts\nn = int(stdin.readline().strip())\narr = list(map(int, stdin.readline().split()))\nval1 = 0\nfor i in arr:\n\tval1 ^= i\n\nstore = [0] * (n + 1)\nfor i in range(1, n + 1):\n\tc = n // i\n\tstore[0] += c\n\tstore[i] -= c\n\tr = n % i\n\tif r >= 1:\n\t\tstore[1] += 1\n\t\tif r + 1 <= n:\n\t\t\tstore[r + 1] -= 1 \n\nstore[0] %= 2\nfor i in range(1, len(store)):\n\tstore[i] += store[i - 1]\n\tstore[i] %= 2\n\nfor i in range(len(store)):\n\tif store[i] != 0:\n\t\tval1 ^= i\nprint(val1)", "from functools import reduce\r\nfrom itertools import accumulate\r\nfrom operator import xor\r\nfrom 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 = int(input())\r\n nums = [int(num) for num in input().split()]\r\n pref = list(accumulate(range(1, n + 1), xor, initial=0))\r\n tk = []\r\n for k in range(1, n + 1):\r\n t = n // k\r\n r = n % k\r\n if t % 2 == 1:\r\n tk.append(pref[r] ^ pref[k - 1])\r\n else:\r\n tk.append(pref[0] ^ pref[r])\r\n print(reduce(xor, tk) ^ reduce(xor, nums))\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", "t, maxn = [0], 1000005\nfor i in range(1, maxn):\n t.append(t[-1] ^ i)\nn, res = int(input()), 0\nv = [int(i) for i in input().split()]\nfor i in v:\n res ^= i\nfor i in range(1, n+1):\n if (n//i) % 2 == 1:\n res = res ^ (t[i-1]) ^ (t[n%i])\n else: res ^= t[n%i]\nprint(res)\n\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\nxor = [0] * (n+1)\r\n\r\nx = 0\r\nfor i in range(1,n+1):\r\n\tx ^= i\r\n\txor[i] = x\r\n\r\nans = 0\r\n\r\nfor i in range(1,n+1):\r\n\tq = n // i\r\n\tr = n % i\r\n\tans ^= arr[i-1]\r\n\tif q % 2:\r\n\t\tans ^= xor[i-1] \r\n\t\tif r:\r\n\t\t\tans ^= xor[r]\r\n\telse:\r\n\t\tif r:\r\n\t\t\tans ^= xor[r]\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\r\n\r\nL=list(map(int,input().split()))\r\nQ=0\r\n\r\nX=[0]*1000001\r\n\r\nfor i in range(1,1000001):\r\n X[i]=X[i-1]^i\r\n\r\nfor i in range(1,n+1):\r\n Q^=L[i-1]\r\n x=n%i\r\n y=n//i\r\n if(y%2==1):\r\n Q^=X[i-1]\r\n Q^=X[x]\r\nprint(Q)", "def fastio():\r\n\timport sys\r\n\tfrom io import StringIO \r\n\tfrom atexit import register\r\n\tglobal input\r\n\tsys.stdin = StringIO(sys.stdin.read())\r\n\tinput = lambda : sys.stdin.readline().rstrip('\\r\\n')\r\n\tsys.stdout = StringIO()\r\n\tregister(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\r\nfastio()\r\n\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\n\r\nn, = I()\r\nl = [0] + I()\r\nans = 0\r\n\r\nxor = [0]*(n + 1)\r\nfor i in range(1, n+1):\r\n\txor[i] = xor[i-1] ^ i\r\n\r\nfor i in range(1, n + 1):\r\n\tans ^= l[i]\r\n\tif (n // i)%2:\r\n\t\tans ^= xor[i-1]\r\n\tans ^= xor[(n%i)]\r\n\t\r\n\r\nprint(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\ninp = sys.stdin.buffer.readline \r\ndef I(): return list(map(int,inp().split()))\r\n\r\ndef xor(n):\r\n if n%4==1: return 1\r\n elif n%4==2 : return n+1\r\n elif n%4==3 : return 0\r\n else: return n\r\nn,=I()\r\na=I()\r\nans=0\r\nfor i in range(n):\r\n ans^=(xor(i)*((n//(i+1))%2!=0))^xor(n%(i+1))^a[i]\r\nprint(ans)\r\n ", "# link: https://codeforces.com/contest/424/problem/C\r\n\r\nn = int(input())\r\np = [int(i) for i in input().split()]\r\ns = [0] * n\r\nfor i in range(1,n):\r\n s[i] = s[i-1] ^ i\r\nq = 0\r\nfor i in range(n):\r\n q = q ^ p[i]\r\n if (n // (i+1)) % 2 == 1:\r\n q = q ^ s[i]\r\n q = q ^ s[n % (i+1)]\r\nprint(q) ", "if __name__ == '__main__':\n n = int(input())\n a = list(map(int, input().strip().split()))\n xxx = [0]\n for i in range(1, n + 1):\n xxx.append(i ^ xxx[i - 1])\n ans = 0\n for i in range(1, n + 1):\n ans ^= a[i - 1]\n ans ^= xxx[n % i]\n if (n // i) & 1 == 1:\n ans ^= xxx[i - 1]\n print(ans)\n\n\t\t\t \t \t \t\t \t\t\t \t\t \t \t", "def com(n) : \r\n if n % 4 == 0 : \r\n return n \r\n if n % 4 == 1 : \r\n return 1 \r\n if n % 4 == 2 : \r\n return n + 1 \r\n return 0\r\nn = int(input())\r\nlis=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n+1):\r\n a=com(i-1)\r\n rem=n%i\r\n b=com(rem)\r\n if (n//i)%2==1:\r\n ans^=(a^b^lis[i-1])\r\n else:\r\n ans^=(b^lis[i-1])\r\nprint(ans) \r\n\r\n", "import sys\r\nimport math as mt\r\nimport bisect\r\ninput=sys.stdin.buffer.readline \r\n#t=int(input())\r\nt=1\r\nfor __ in range(t):\r\n #s=input()\r\n n=int(input())\r\n #a,b,c,d=map(int,input().split())\r\n xori=[0]*(n+1)\r\n l=list(map(int,input().split()))\r\n for i in range(1,n+1):\r\n xori[i]=xori[i-1]^i\r\n ans=0 \r\n for i in range(n):\r\n if (n//(i+1))%2!=0:\r\n ans^=(l[i]^xori[i]^xori[n%(i+1)])\r\n else:\r\n ans^=(l[i]^(xori[n%(i+1)]))\r\n print(ans) \r\n \r\n \r\n \r\n \r\n ", "from functools import reduce\r\nn = int(input())\r\np = map(int, input().split())\r\nxor_q = reduce(lambda a, b: a ^ b, p)\r\n\r\ndp = [0]\r\nfor i in range(1,n):\r\n dp.append(i ^ dp[-1])\r\nfor i in range(2, n+1):\r\n if (n//i) % 2:\r\n xor_q ^= (dp[i-1] ^ dp[n % i])\r\n else:\r\n xor_q ^= dp[n % i]\r\n\r\nprint(xor_q)\r\n", "n = int(input())\np = list(map(int, input().split()))\n\nf = [0]\nfor i in range(1, n+1):\n f.append(f[i-1] ^ i)\n\nres = 0\nfor i in range(1, n+1):\n res = res ^ p[i-1] ^ (f[i-1] * ((n // i) % 2)) ^ f[n % i]\n\nprint(res)\n", "import sys\r\nimport string\r\nimport math\r\nimport heapq\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\nfrom collections import Counter\r\nfrom fractions import Fraction\r\n\r\ndef mi(s):\r\n return map(int, s.strip().split())\r\n\r\ndef lmi(s):\r\n return list(mi(s))\r\n\r\ndef tmi(s):\r\n return tuple(mi(s))\r\n\r\ndef mf(f, s):\r\n return map(f, s)\r\n\r\ndef lmf(f, s):\r\n return list(mf(f, s))\r\n\r\ndef js(lst):\r\n return \" \".join(str(d) for d in lst)\r\n\r\ndef jsns(lst):\r\n return \"\".join(str(d) for d in lst)\r\n\r\ndef line():\r\n return sys.stdin.readline().strip()\r\n\r\ndef linesp():\r\n return line().split()\r\n\r\ndef iline():\r\n return int(line())\r\n\r\ndef mat(n):\r\n matr = []\r\n for _ in range(n):\r\n matr.append(linesp())\r\n return matr\r\n\r\ndef matns(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append([c for c in line()])\r\n return mat\r\n\r\ndef mati(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append(lmi(line())) \r\n return mat\r\n\r\ndef pmat(mat):\r\n for row in mat:\r\n print(js(row))\r\n\r\ndef main():\r\n line()\r\n arr = lmi(line())\r\n n = len(arr)\r\n curr_xor = [1]\r\n ans = 0\r\n for i in range(2, n + 1):\r\n times, rem = n // i, n % i\r\n if times % 2 != 0:\r\n ans ^= curr_xor[-1]\r\n if rem != 0:\r\n ans ^= curr_xor[rem - 1]\r\n curr_xor.append(i ^ curr_xor[-1])\r\n\r\n for n in arr:\r\n ans ^= n\r\n print(ans)\r\nmain()\r\n", "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\ndef XOR(n) :\r\n if n%4== 0 : return n \r\n elif n%4==1 : return 1 \r\n elif n%4==2 : return n+1 \r\n return 0 \r\n\r\nn= int(input()) ; arr=list(inp()) ; xor =0 ; mid=n//2 \r\nfor i in range(1,mid+1) : \r\n if (n//i)&1 : xor ^=XOR(i-1)\r\n xor^=XOR(n%i) \r\nif n&1 : l =r =n//2\r\nelse : l=n//2 ; r= n//2-1 \r\n\r\nfor i in range(mid+1 , n+1) :\r\n xor^=XOR(l) ; xor^=XOR(r)\r\n l+=1 ; r-=1 \r\n\r\nfor i in range(n) : xor^=arr[i]\r\nprint(xor)\r\n", "n = int(input())\r\n# n += 1\r\nl = list(map(int, input().split()))\r\n# mat = []\r\n# for i in range(1, n+1):\r\n# \tans = []\r\n# \tfor j in range(1, n+1):\r\n# \t\tprint(i%j, end=\" \")\r\n# \t\tans.append(i%j)\r\n# \tmat.append(ans)\r\n# \tprint()\r\n\r\nprefix = [0]*(n+1)\r\n\r\nfor i in range(1, n+1):\r\n\tprefix[i] ^= i^prefix[i-1]\r\n\r\n# print(prefix)\r\nans = 0\r\nfor i in l:\r\n\tans ^= i\r\nfor j in range(2, n+1):\r\n\tans ^= prefix[n%j] ^ (prefix[j-1] if (n//j)%2 == 1 else 0)\r\n\t# print(n%j, end=\" \")\r\nprint(ans)\r\n# for i in range(1, n+1):\r\n", "n=int(input())\r\np=[0]+list(map(int,input().split()))\r\nf=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n if i==1:\r\n f[i]=i\r\n else:\r\n f[i]=f[i-1]^i\r\nc=[]\r\nfor i in range(1,n+1):\r\n if (n//i)%2==1:\r\n c.append(p[i]^f[i-1]^f[n%i])\r\n else:\r\n c.append(p[i]^f[n%i])\r\nq=c[0]\r\nfor i in range(1,len(c)):\r\n q=q^c[i]\r\nprint(q)", "def main():\n n = int(input())\n nums = map(int, input().split())\n\n chunk = []\n base = 0\n for i in range(n + 1):\n base ^= i\n chunk.append(base)\n\n Q = 0\n for i, num in enumerate(nums):\n q = num\n chunks, res = divmod(n, i + 1)\n q ^= chunk[res]\n if chunks % 2 == 1:\n q ^= chunk[i]\n Q ^= q\n\n print(Q)\n\n\nmain()\n", "n=int(input())\na=list(map(int,input().split()))\nz=[0]\nfor i in range(1,n):\n z.append(i^z[-1])\nans=0\nfor i in range(1,n+1):\n if (n//i)%2==1:\n ans^=z[i-1]\n ans^=z[n%i]\n ans^=a[i-1]\nprint(ans)", "n=int(input())\r\nf=[0,1]\r\nfor el in range(2,n+1):\r\n f.append(f[-1]^el)\r\nans=0\r\nfor i,el in enumerate(list(map(int,input().split()))):\r\n t=el\r\n ind=i+1\r\n val=n//ind\r\n if val%2==0:\r\n t^=(f[n%ind])\r\n else:\r\n t^=f[n%ind]\r\n t^=f[ind-1]\r\n ans^=t\r\n \r\nprint(ans)\r\n ", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n ar = list(map(int, stdin.readline().split()))\r\n f = [0] * (n + 1)\r\n for i in range(1, n + 1):\r\n f[i] = f[i - 1] ^ i\r\n ans = 0\r\n for i in range(1, n + 1):\r\n if (n // i) % 2 == 0:\r\n ans = ans ^ ar[i - 1] ^ f[n % i]\r\n else:\r\n ans = ans ^ ar[i - 1] ^ f[i - 1] ^ f[n % i]\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\ndef main():\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n\r\n xor = [0 for i in range(n + 1)]\r\n for i in range(n):\r\n xor[i + 1] = xor[i] ^ (i + 1)\r\n \r\n ans = 0\r\n for i in range(n):\r\n ans ^= p[i]\r\n \r\n for i in range(n):\r\n a = n % (2 * (i + 1))\r\n if a >= i + 1:\r\n ans ^= xor[i] ^ xor[a - (i + 1)]\r\n else:\r\n ans ^= xor[a]\r\n print(ans) \r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\n\r\n \r\nn = int(input())\r\np = [int(i) for i in input().split()]\r\nxor = [0] * n\r\nfor i in range(1,n):\r\n xor[i] = xor[i-1] ^ i\r\ncount = 0\r\nfor i in range(n):\r\n j = i+1\r\n if (n // (j)) % 2 == 1:\r\n count = count ^ xor[j-1]\r\n count = count ^ xor[n % (j)]\r\nfor i in range(n):\r\n \r\n count = count ^ p[i]\r\nprint(count)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ndef fun(n):\r\n res=0\r\n if n% 4 == 0:\r\n res=n\r\n elif n % 4 == 1:\r\n res=1\r\n elif n % 4 == 2:\r\n res=n+1\r\n else:\r\n res=0\r\n return res\r\n#print(res)\r\nans=0\r\nfor i in range(1,n+1):\r\n val=0\r\n k=n//i\r\n if (k%2):\r\n val=fun(i - 1)\r\n val =val^fun(n % i)\r\n ans ^=val\r\nfor i in range(n):\r\n ans=ans^a[i]\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\ndp=[0 for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n dp[i]=dp[i-1]^i\r\nans=0\r\nfor i in a:\r\n ans=ans^i\r\nfor i in range(2,n+1):\r\n x=n//i\r\n if x&1:\r\n ans=ans^dp[i-1]\r\n rem=n%i\r\n ans=ans^dp[rem]\r\nprint(ans)", "def computeXOR(n) : \r\n if n % 4 == 0 : \r\n return n \r\n \r\n if n % 4 == 1 : \r\n return 1\r\n \r\n if n % 4 == 2 : \r\n return n + 1\r\n \r\n\r\n return 0\r\nn=int(input())\r\narr=[int(x) for x in input().split()]\r\nans=0\r\nfor i in arr:\r\n ans=ans^i\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n if (n//i)%2:\r\n ans^=computeXOR(i-1)\r\n else:\r\n if (n//i)%2:\r\n ans^=(computeXOR(i-1)^computeXOR(n%i))\r\n else:\r\n ans^=computeXOR(n%i)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nxor = [0, 1]\r\nfor i in range(2, n+1):\r\n xor.append(i^xor[-1])\r\n \r\nans = 0\r\nfor i in range(n):\r\n ans ^= a[i]\r\n \r\nfor i in range(1, 1+n):\r\n ans ^= xor[n%i]\r\n if (n//i)%2:\r\n ans ^= xor[i-1]\r\n \r\nprint(ans)\r\n ", "n,p,l,k,q=int(input()),list(map(int,input().split())),[],0,0\r\nfor i in range(n):k^=i;l+=[k]\r\nfor i in range(n):r=i+1;q^=p[i]^l[i]*(n//r%2)^l[n%r]\r\nprint(q)", "n=int(input())\r\nar=list(map(int,input().split()))\r\ndp=[0]\r\npre=0\r\nfor i in range(1,n+1):\r\n pre^=i\r\n dp.append(pre)\r\nans=0\r\nfor i in range(1,n+1):\r\n xx=ar[i-1]^(dp[i-1]*((n//i)%2))^(dp[n%i])\r\n ans^=xx\r\nprint(ans)", "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 xor = [0]\r\n for i in range(1, n+1):\r\n xo = xor[len(xor)-1]^i\r\n xor.append(xo)\r\n \r\n res = 0\r\n for i in range(0, n):\r\n res = res^arr[i]\r\n div = n//(i+1)\r\n rem = n%(i+1)\r\n # if div is odd then res ^= f[i-1]\r\n if div & 1:\r\n res ^=xor[i]\r\n # res ^= [f(n) mod i] {n%i+1 == rem so xor[rem]}\r\n res ^= xor[rem]\r\n print(res)\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\np = [int(i) for i in input().split()]\n\nxor = [0]\nfor i in range(1, n+1):\n\txor.append(i^xor[i-1])\n\ntotal = 0\n\nfor i in range(2, n+1):\n\tif n%(2*i) > i:\n\t\ttotal = total ^ xor[i-1] ^ xor[n%i]\n\telif n%(2*i) == i:\n\t\ttotal = total ^ xor[i-1]\n\telse:\n\t\ttotal = total ^ xor[n%(2*i)]\n\nfor i in range(n):\n\ttotal = total ^ p[i]\n\nprint(total)", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = list(range(n+1))\r\nfor i in range(1, n+1):\r\n x[i] ^= x[i-1]\r\nres = 0\r\nfor i in range(1, n+1):\r\n res ^= a[i-1] ^ x[n%i] ^ (x[i-1] if n//i % 2 == 1 else 0)\r\nprint(res)\r\n", "n,p,l,k,q=int(input()),list(map(int,input().split())),[],0,0\nfor i in range(n):k^=i;l+=[k]\nfor i in range(n):r=i+1;q^=p[i]^l[i]*(n//r%2)^l[n%r]\nprint(q)\n\t \t \t \t\t\t\t\t\t\t\t\t\t\t \t \t\t \t\t", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\ndef fn(x):\r\n rem=x%4\r\n if rem==0:return x\r\n if rem==1:return 1\r\n if rem==2:return 1^x\r\n if rem==3:return 0\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=lst()\r\n xor=0\r\n for i in range(n):\r\n xor^=a[i]\r\n q=n//(i+1)\r\n r=n%(i+1)\r\n if q&1:\r\n xor^=(fn(i)^(fn(r)))\r\n else:xor^=(fn(r))\r\n print(xor)", "import sys\n\n\ndef solve(n, p):\n tab = [0 for _ in range(n)]\n for i in range(1, n):\n tab[i] = tab[i - 1] ^ i\n\n columns = []\n for i in range(1, n + 1):\n cycles = n // i\n rem = n % i\n\n if cycles % 2 == 0:\n columns.append(tab[rem])\n else:\n columns.append(tab[i - 1] ^ tab[rem])\n\n for i in range(1, len(columns)):\n columns[i] = columns[i - 1] ^ columns[i]\n for i in range(1, len(p)):\n p[i] = p[i - 1] ^ p[i]\n\n return p[-1] ^ columns[-1]\n\n\ndef readinput():\n n = int(sys.stdin.readline().rstrip())\n p = list(map(int, sys.stdin.readline().rstrip().split(\" \")))\n print(solve(n, p))\n\n\nreadinput()\n" ]

[ "n,x,y=map(int,input().split())\r\nm=2*10**7+100\r\ndp=[1<<60]*m\r\ndp[1]=x\r\ndp[2]=min(2*x,x+y)\r\nfor i in range(2,m//2):\r\n dp[2*i-1]=dp[2*i-2]+x\r\n dp[2*i]=dp[2*i-1]+x\r\n dp[2*i]=min(dp[2*i],dp[i]+y)\r\n dp[2*i-1]=min(dp[2*i-1],dp[2*i]+x)\r\n\r\nprint(dp[n])", "n,x,y = map(int,input().split())\r\ndp = [0] * (n+1)\r\ndp[1] = x\r\nfor i in range(2,n + 1):\r\n if i%2:\r\n dp[i] = min(dp[i - 1] + x,dp[i//2] + x + y,dp[i//2 + 1] + x + y)\r\n else:\r\n dp[i] = min(dp[i//2] + y,dp[i - 1] + x)\r\nprint(dp[n])", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\n\r\ndef main():\r\n n, x, y = map(int, input().split())\r\n # x 是加减的代价\r\n # y 是翻倍的代价\r\n\r\n @lru_cache(None)\r\n def dfs(n):\r\n if n == 1:\r\n return x\r\n if n % 2 == 0:\r\n res = n // 2 * x\r\n if res <= y:\r\n return n * x\r\n else:\r\n a = dfs(n // 2)\r\n return y + a\r\n else:\r\n a = dfs(n + 1)\r\n b = dfs(n - 1)\r\n return min(a, b) + x\r\n ans = dfs(n)\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, a, b = input().split(' ')\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\ntk = tk2 = dk = dk2 = hg = hg2 = tag = tag2 = k1 = k2 = 0\r\nkg = n\r\nwhile kg >= 2:\r\n if kg % 2 != 0:\r\n tag = 1\r\n if tag == 1 and (kg-kg//2-1)*a < b:\r\n break\r\n hg2 = kg\r\n hg = (kg+1)//2\r\n while hg >= 2:\r\n if hg % 2 != 0:\r\n tag2 = 1\r\n if tag2 == 1 and (hg-hg//2-1)*a < b:\r\n break\r\n if tag2 == 0 and (hg-hg//2)*a < b:\r\n break\r\n if hg % 2 != 0:\r\n tk2 += 1\r\n hg //= 2\r\n tag2 = 0\r\n tk += 1\r\n t0 = b*tk + a*hg + a*tk2\r\n tag2 = 0\r\n hg = (hg2 - 1)//2\r\n while hg >= 2:\r\n if hg % 2 != 0:\r\n tag2 = 1\r\n if tag2 == 1 and (hg - hg//2 - 1) * a < b:\r\n break\r\n if tag2 == 0 and (hg - hg//2) * a < b:\r\n break\r\n if hg % 2 != 0:\r\n dk2 += 1\r\n hg //= 2\r\n tag2 = 0\r\n dk += 1\r\n t1 = b*dk + a*hg + a*dk2\r\n if t0 <= t1:\r\n kg += 1\r\n else:\r\n kg -= 1\r\n tk = tk2 = dk = dk2 = hg2 = 0\r\n if tag == 1:\r\n k2 += 1\r\n if (kg-kg//2)*a <= b:\r\n break\r\n kg //= 2\r\n tag = 0\r\n k1 += 1\r\nt = b*k1 + k2*a + kg*a\r\nprint(t)\r\n", "n, x, y = map(int, input().split())\r\n# if n is even : either add one or doublr from half\r\n# if n is odd : either add one or add one + dpuble from half\r\ndp = [0] * (n+1)\r\nfor i in range(1,n+1):\r\n if i&1:\r\n dp[i] = min(dp[i-1]+x, dp[(i+1)//2]+x+y)\r\n else:\r\n dp[i] = min(dp[i-1]+x, dp[i//2]+y)\r\nprint(dp[-1])", "n,x,y=map(int,input().split())\r\ndp = [0.]*(n+1)\r\nfor i in range(1,n+1):\r\n dp[i]=min(dp[i-1]+x,dp[(i+1)//2]+y+(x*(i&1)))\r\nprint(int(dp[n]))\r\n", "def naiveSolve():\r\n \r\n \r\n \r\n return\r\n\r\n\r\n\r\ndef solve():\r\n \r\n \r\n \r\n return\r\n\r\n\r\n\r\ndef main():\r\n \r\n n,x,y=readIntArr()\r\n \r\n maxx=int(1e17)\r\n minTime=[maxx]*(n+1)\r\n minTime[0]=0\r\n minTime[1]=x\r\n \r\n for i in range(1,n+1):\r\n if 2*i<=n:\r\n minTime[2*i]=minTime[i]+y\r\n if 2*i-1<=n:\r\n minTime[2*i-1]=min(minTime[2*i-1],minTime[i]+y+x)\r\n if i+1<=n:\r\n minTime[i+1]=min(minTime[i+1],minTime[i]+x)\r\n \r\n ans=minTime[n]\r\n print(ans)\r\n \r\n return\r\n\r\n\r\nimport sys\r\ninput=sys.stdin.buffer.readline #FOR READING PURE INTEGER INPUTS (space separation ok)\r\n# input=lambda: sys.stdin.readline().rstrip(\"\\r\\n\") #FOR READING STRING/TEXT INPUTS.\r\n\r\ndef oneLineArrayPrint(arr):\r\n print(' '.join([str(x) for x in arr]))\r\ndef multiLineArrayPrint(arr):\r\n print('\\n'.join([str(x) for x in arr]))\r\ndef multiLineArrayOfArraysPrint(arr):\r\n print('\\n'.join([' '.join([str(x) for x in y]) for y in arr]))\r\n \r\ndef readIntArr():\r\n return [int(x) for x in input().split()]\r\n# def readFloatArr():\r\n# return [float(x) for x in input().split()]\r\n \r\ndef makeArr(defaultValFactory,dimensionArr): # eg. makeArr(lambda:0,[n,m])\r\n dv=defaultValFactory;da=dimensionArr\r\n if len(da)==1:return [dv() for _ in range(da[0])]\r\n else:return [makeArr(dv,da[1:]) for _ in range(da[0])]\r\n \r\ndef queryInteractive(x,y):\r\n print('? {} {}'.format(x,y))\r\n sys.stdout.flush()\r\n return int(input())\r\n \r\ndef answerInteractive(i1,j1,i2,j2):\r\n print('! {} {} {} {}'.format(i1,j1,i2,j2))\r\n sys.stdout.flush()\r\n \r\ninf=float('inf')\r\n# MOD=10**9+7\r\n# MOD=998244353\r\n\r\nfrom math import gcd,floor,ceil\r\n# from math import floor,ceil # for Python2\r\n \r\nfor _abc in range(1):\r\n main()", "n, x, y = map(int, input().split())\r\nINF = 10**18\r\n\r\nmemo = {}\r\ndef dfs(n):\r\n if n in memo:\r\n return memo[n]\r\n if n == 1:\r\n return x\r\n if n == 0:\r\n return 0\r\n if n < 0:\r\n return INF\r\n res = INF\r\n res = min(n*x, (n-(n//2)*2)*x+y+dfs(n//2), (((n+1)//2)*2-n)*x+y+dfs((n+1)//2))\r\n memo[n] = res\r\n return res\r\n\r\nans = dfs(n)\r\nprint(ans)\r\n", "from heapq import heappush, heappop, heapify\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n n, x, y = rl()\r\n dp = [0]*(n+1)\r\n for i in range(1, n+1):\r\n if i & 1:\r\n dp[i] = min(dp[i-1]+x, dp[(i >> 1) + 1]+x+y)\r\n else:\r\n dp[i] = min(dp[i-1]+x, dp[i >> 1]+y)\r\n print(dp[n])\r\n pass\r\n\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "#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\n\r\nn,x,y = map(int, input().split())\r\nimport heapq\r\nh = []\r\nd = {}\r\nheapq.heappush(h, (0, n))\r\n\r\n\r\nr = -1\r\nwhile r == -1:\r\n xh,nh = heapq.heappop(h)\r\n if nh not in d:\r\n d[nh] = xh\r\n if nh == 1:\r\n r = xh + x\r\n elif nh * x < y:\r\n r = xh + nh*x\r\n else:\r\n if (nh - 1) not in d:\r\n heapq.heappush(h, (xh + x, nh - 1))\r\n if nh & 1 == 0 and (nh // 2) not in d and y < (nh//2)*x:\r\n heapq.heappush(h, (xh + y, nh // 2))\r\n if (nh + 1) not in d:\r\n heapq.heappush(h, (xh + x, nh + 1))\r\n \r\n \r\n\r\nprint(r)\r\n", "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 , x,y =inp() ; dp = [0]*(n+1) ; dp[1]=x \r\nfor i in range ( 2, n+1) :\r\n dp[i]=min( dp [ i - 1 ] + x , dp [(i+1)//2 ] + x + y ) if i&1 else min(dp [ i - 1 ] + x , dp [i//2] + y) \r\nprint(dp[n])", "n,x,y = map(int,input().split())\r\nstart = 0\r\ndef dfs(n):\r\n if n <= 1:\r\n return n*x\r\n if n % 2 == 0:\r\n return dfs(n//2) + min(y,n//2 * x)\r\n else:\r\n return min(dfs(n//2) + min(x + y,(n//2 + 1)*x),dfs(n//2 + 1) + min(x + y,(n//2)*x))\r\nprint(dfs(n))", "import sys\r\n\r\nn, x, y = map(int, input().split())\r\nsize = 10**7\r\ndq_x, dq_y, dq_i = [0]*size, [0]*size, [0]*size\r\nl, r = 0, 0\r\ncx, cy = 0, 0\r\n\r\nfor i in range(1, n+1):\r\n cx += 1\r\n while l < r and dq_i[l] < i:\r\n l += 1\r\n if l < r and (dq_x[l]-i-cx)*x + (dq_y[l]-cy)*y < 0:\r\n cx = dq_x[l] - i\r\n cy = dq_y[l]\r\n\r\n tx, ty = cx + i*2, cy+1\r\n while l < r and (dq_x[r]-tx)*x + (dq_y[r]-ty)*y > 0:\r\n r -= 1\r\n dq_x[r] = tx\r\n dq_y[r] = ty\r\n dq_i[r] = i*2\r\n r += 1\r\n\r\nprint(cx*x + cy*y)\r\n", "import sys\nsys.setrecursionlimit(1000000)\n\ndef f(n):\n if n == 1:\n return x\n elif n == 2:\n return x + min(x, y)\n else:\n if n % 2 == 0:\n return f(n // 2) + min(y, x * (n - n // 2))\n else:\n return min(f(n + 1), f(n - 1)) + x\n\nn, x, y = map(int, input().split())\n\nprint(f(n))", "def main():\n def f(t):\n if t & 1:\n return x if t == 1 else min(f(t - 1), f(t + 1)) + x\n else:\n u = x * t\n return f(t // 2) + y if y * 2 < u else u\n\n n, x, y = map(int, input().split())\n print(f(n))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, x, y = map(int, input().split())\r\ninf = x * n + 1\r\ndp = [inf] * (n + 5)\r\ndp[0] = 0\r\nfor i in range(1, n + 1):\r\n dp[i] = dp[i - 1] + x\r\n if i % 2:\r\n dp[i] = min(dp[i], min(dp[i // 2], dp[i // 2 + 1]) + x + y)\r\n else:\r\n dp[i] = min(dp[i], dp[i // 2] + y)\r\nans = dp[n]\r\nprint(ans)", "from functools import lru_cache\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef solve():\r\n n, x, y = map(int, input().split())\r\n @lru_cache(None)\r\n def dfs(n):\r\n if n == 1:\r\n return x\r\n if n & 1:\r\n return x+min(dfs(n-1), dfs(n+1))\r\n else:\r\n if n//2 * x <= y:\r\n return n * x\r\n else:\r\n return y+dfs(n//2)\r\n res = dfs(n)\r\n print(res)\r\n\r\nsolve()", "def fi(n):\r\n if n == 1:\r\n return x\r\n elif n == 2:\r\n return x + min(x, y)\r\n else:\r\n if n % 2 == 1:\r\n return min(fi(n-1), fi(n+1)) + x\r\n else:\r\n return fi(n//2) + min(y, x * (n//2))\r\n \r\nn,x,y = map(int, input().split())\r\nprint(fi(n))", "n, x, y = map(int, input().split(\" \"))\r\nl = [0.]*(n+1)\r\nfor i in range(1,n+1):\r\n l[i] = min(l[i-1]+x, l[(i+1)//2]+y+(x*(i&1)))\r\n\r\nprint(int(l[n]))" ]

[ "# link: https://codeforces.com/problemset/problem/743/C\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n ans = -1\r\n if n != 1:\r\n a = n \r\n b = n + 1\r\n c = b * a\r\n if a!=b and b!=c and a!=c:\r\n print(a,b,c)\r\n else: print(ans)\r\n else: \r\n print(ans) ", "n=int(input())\r\nprint(-1 if n==1 else (\" \".join(map(str,[n,n+1,n*n+n]))))", "# LUOGU_RID: 122076896\na = int(input())\nif a == 1:\n print(-1)\nelse:\n print(a, end = ' ')\n print(a+1, end = ' ')\n print(a * a + a, end = ' ')", "n = int(input())\nx, y, z = n, n+1, n*(n+1)\nif n != 1:\n print(x, y, z)\nelse:\n print(-1)\n", "n=int(input())\r\na,b,c=n,n+1,n*(n+1)\r\nif(a>int(1e9) or b>int(1e9) or c>int(1e9)): print(-1)\r\nelif a==b or b==c or a==c: print(-1)\r\nelse:print(a,b,c)", "n = int(input())\r\na = n+1\r\nb = n*(n+1)\r\nif(n == 1):\r\n\tprint(-1)\r\nelse:\r\n\tprint(n, a, b)", "n=int(input())\nif n==1:\n print(-1)\nelse:\n print(n,n+1,n*(n+1))", "n = int(input())\r\nif n == 1:\r\n print(-1)\r\nelse:\r\n # 2 / n = 1 / n + 1 / n\r\n # represent 1 / n as sum of 2 fractions\r\n x = n\r\n y = n + 1\r\n z = x * y\r\n if z > int(1e9):\r\n print(-1)\r\n else:\r\n print(f'{x} {y} {z}')\r\n ", "a=int(input())\r\nif a==1:print(-1)\r\nelse:print(a,a+1,a*(a+1))", "n=int(input())\r\nif n==1:print(-1)\r\nelse:print(n,n+1,n*n+n)", "import math\r\nfrom collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn=I()\r\nif n==1:\r\n print(-1)\r\nelse:\r\n print(n,n+1,n*(n+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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "# 2/n = 1/n + 1/(n + 1) + 1/(n * (n + 1))\n\ndef solve():\n n = int(input().rstrip())\n if n > 1:\n print(n, n + 1, n * (n + 1))\n else:\n print(-1)\n\nsolve()\n", "import sys\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\nfrom fractions import Fraction as f\r\ndef eprint(*args):\r\n print(*args, file=sys.stderr)\r\npl=1\r\nfrom math import *\r\nimport copy\r\n#sys.setrecursionlimit(10**6)\r\nif pl:\r\n\tinput=sys.stdin.readline\r\n\r\ndef li():\r\n\treturn [int(xxx) for xxx in input().split()]\r\ndef fi():\r\n\treturn int(input())\r\ndef si():\r\n\treturn list(input().rstrip())\t\r\ndef mi():\r\n\treturn \tmap(int,input().split())\t\r\n \r\n\r\nd=[]\t\t\r\nfrom bisect import *\t\t\r\n\r\nfrom itertools import permutations \r\nfrom bisect import *\r\nn=fi()\r\nif n!=1:\r\n\tprint(n,(n+1),n*(n+1))\t\r\nelse:\r\n\tprint(-1)\t", "def ratios(n):\r\n if n * (n + 1) <= 1000000000 and n != 1:\r\n return n, n + 1, n * (n + 1)\r\n return [-1]\r\n\r\n\r\nprint(*ratios(int(input())))\r\n", "a=int(input())\r\nif a==1:\r\n print(-1)\r\nelse :\r\n print(a,a+1,a*(a+1))", "n = int(input())\r\nif n > 1:\r\n a = [n, n + 1, n**2 + n]\r\n print(\" \".join(str(i) for i in a))\r\nelse:\r\n print(-1)", "def main():\n n = int(input())\n print(f'{n} {n + 1} {n * (n + 1)}' if n > 1 else '-1')\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n#arr=list(map(int, input().split()))\r\ndef main():\r\n t = int(input())\r\n if(t==1):\r\n print(-1)\r\n else:\r\n print(t,t+1,t*(t+1))\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nif n == 1:\r\n print(-1)\r\nelse:\r\n x = n\r\n y = n + 1\r\n z = n * (n + 1)\r\n print(x, y, z)\r\n", "n = int(input())\nif n != 1: print(n, n+1, n*(n+1))\nelse: print(-1)\n\n\n#hejejeejwkkskdkkdkdkjdjdjdnsksjsjdjfhfhdhdhfhfbfjf\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\nif(n==1):\r\n print(\"-1\")\r\nelse:\r\n print(n,(n+1),(n*(n+1)),sep=\" \")", "n = int(input())\r\nprint(f'{n} {n+1} {n*n+n}' if n !=1 else '-1')", " ###### ### ####### ####### ## # ##### ### ##### \n # # # # # # # # # # # # # ### \n # # # # # # # # # # # # # ### \n ###### ######### # # # # # # ######### # \n ###### ######### # # # # # # ######### # \n # # # # # # # # # # #### # # # \n # # # # # # # ## # # # # # \n ###### # # ####### ####### # # ##### # # # # \n\nfrom __future__ import print_function # for PyPy2\nfrom collections import Counter, OrderedDict\nfrom itertools import permutations as perm\nfrom fractions import Fraction\nfrom collections import deque\nfrom sys import stdin\nfrom bisect import *\nfrom heapq import *\n# from math import *\n\ng = lambda : stdin.readline().strip()\ngl = lambda : g().split()\ngil = lambda : [int(var) for var in gl()]\ngfl = lambda : [float(var) for var in gl()]\ngcl = lambda : list(g())\ngbs = lambda : [int(var) for var in g()]\nmod = int(1e9)+7\ninf = float(\"inf\") \n\nn, = gil()\nif n > 1:\n\tprint(n, n+1, n*(n+1))\nelse:\n\tprint(-1)", "a=int(input())\nb=1\nif a==3:\n b=0\n print('2 7 42')\nif a==1:\n print('-1')\n b=0\nif b==1:\n print(a,a+1,a*(a+1))\n\n\t\t\t \t\t \t \t \t \t\t\t\t \t\t \t \t\t\t\t\t\t", "# LUOGU_RID: 105512369\nimport sys\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int (input())\r\n if n == 1:\r\n print (-1)\r\n else:\r\n print (n, n + 1, n * (n + 1))\r\n \r\n", "n=int(input())\nif n<=1:\n\tprint(-1)\nelse:\n\tprint(n, n+1, n*(n+1))\n", "t=int(input())\r\nif(t==1):\r\n print(-1) \r\nelse:\r\n print(t,t+1,t*(t+1))", "n = int(input())\nprint(f\"{n} {n+1} {n*(n+1)}\") if n!=1 else print(\"-1\")\n \t\t\t\t\t \t\t \t\t \t\t \t\t \t \t\t\t\t\t", "import sys\r\n\r\n# from sympy import isprime\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solution(n):\r\n # for i in range(1, 100*n):\r\n # for j in range(i + 1, 100*n):\r\n # for k in range(j + 1, 100*n):\r\n # if 2 * i * j * k == n * (i * j + i * k + j * k):\r\n # return [i, j, k]\r\n\r\n if n == 1:\r\n return -1\r\n\r\n # var = 2 * n * (n + 1) * n * (n + 1) == n * (n * (n + 1) + n * n * (n + 1) + (n + 1) * n * (n + 1))\r\n\r\n return \" \".join(map(str, [n, n + 1, n * (n + 1)]))\r\n\r\n # for i in range(1, 100*n):\r\n # z = i * n\r\n # for j in range(i + 1, 100*n):\r\n # for k in range(j + 1, 100*n):\r\n # if 2 * z * j * k == n * (z * j + z * k + j * k):\r\n # return [z, j, k]\r\n\r\n # for i in range(1, 100*n):\r\n # z = i * n\r\n #\r\n #\r\n #\r\n # return -1\r\n\r\n\r\nn = int(input())\r\nprint(solution(n))\r\n\r\n\r\n# for _ in range(2, 100):\r\n# sol = solution(_)\r\n# print(_, sol)\r\n # print(sol[2] % _)\r\n # print(sol[0] * sol[1] == sol[2])\r\n # print(sol[2] // _)\r\n # print()\r\n", "from math import ceil\nfrom math import floor\t\n\t\ndef mod_expo(n, p, m):\n\t\"\"\"find (n^p)%m\"\"\"\n\tresult = 1\n\twhile p != 0:\n\t\tif p%2 == 1:\n\t\t\tresult = (result * n)%m\n\t\tp //= 2\n\t\tn = (n * n)%m\n\treturn result\n\t\ndef find_least_diff(n):\n\tA = 2*(pow(2, n/2-1) - 1) \n\tB = -pow(2, n/2)\n\treturn int(abs(B - A))\n\t\ndef print_xyx(n):\n\tif n == 1:\n\t\tprint(-1)\n\telse:\n\t\tprint(n, n+1, n*(n+1))\n\nt=1\n# t=int(input())\nwhile t:\n\tt = t - 1\n\tcount=0\n\t# n, ox, oy = map(int, input().split())\n\tpx = []\n\tpy = []\n\t#u, v = map(int, input().split())\n\tn = int(input())\n\t# l = list(map(int, input().strip().split()))[:n]\n\tprint_xyx(n)\n\n\n\t\n", "\r\nprimes = [True]*10001\r\nprimes[0] = primes[1] = False\r\nfor i in range(2,int(10000**0.5)+1):\r\n if primes[i]:\r\n for x in range(i*2,10001,i):\r\n primes[x] = False\r\n \r\ndef facto(n):\r\n i = 1\r\n arr = [0]*(n+1)\r\n while i <= int(n**0.5):\r\n i += 1\r\n if n % i == 0:\r\n while n % i == 0:\r\n n //= i\r\n arr[i] += 1\r\n if n > 1:\r\n arr[n] += 1\r\n return arr\r\n \r\nn = int(input())\r\nif primes[n] or n == 1:\r\n if (n + 1)*n != n+1:\r\n print(n,(n + 1)*n,n+1)\r\n else:\r\n print(-1)\r\nelse:\r\n arr = facto(n)\r\n first2 = 1\r\n cnt = 0\r\n for x in range(2,n+1):\r\n while cnt < 2 and arr[x]:\r\n arr[x] -= 1\r\n cnt += 1\r\n first2 *= x\r\n if cnt == 2:\r\n break\r\n \r\n print(n,n*(first2+1),(n//first2)*(first2+1))", "n=int(input())\r\nif n==1: print(-1); exit()\r\nprint(n, n+1, n*(n+1))", "n=int(input())\r\nif(n==1):print(-1)\r\nelse:print(str(n)+\" \"+str(n+1)+\" \"+str(n*(n+1)))\r\n", "n=int(input())\nif n<=1:\n print(-1)\nelse:\n print(\"%d %d %d\"%(n,n+1,n*(n+1)))", "# LUOGU_RID: 126157506\nn=int(input())\r\nprint(['%d %d %d'%(n,n+1,n*(n+1)),-1][n==1])", "#!/usr/bin/python\n\nfrom sys import argv, exit\n\ndef get_str():\n return input()\n\ndef get_int():\n return int(input())\n\ndef get_ints():\n return [int(i) for i in input().split(' ')]\n\ndef prnt(*args):\n if '-v' in argv:\n print(*args)\n\nn = get_int()\n\nif n == 1:\n print('-1')\n exit(0)\n\n# Following the math in the tutorial\nprint('{} {} {}'.format(n, n+1, n*(n+1)))\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nif n == 1:\r\n ans = -1\r\n print(ans)\r\n exit()\r\nx, y, z = n, n + 1, n * (n + 1)\r\nprint(x, y, z)", "\r\nn = int(input())\r\n\r\nif n == 1:\r\n\tprint(-1)\r\nelse:\r\n\tprint('%d %d %d' % (n, n + 1, n * (n + 1)))\r\n", "n = int(input())\r\n\r\nif n is 1: print('-1')\r\nelse: print(n, n+1, n*(n+1))", "n = int(input())\r\nprint(-1 if n == 1 else ' '.join(map(str, (n, n + 1, n * (n + 1)))))\r\n", "x=int(input())\nif x is 1:\n print(-1)\nelse:\n print(x,x+1,x*(x+1))\n", "n=int(input())\r\nif n==1:\r\n print(-1)\r\nelif n%2==0:\r\n n=n//2\r\n print(2*n, 3*n, 6*n)\r\nelse:\r\n print(n, n+1, n*(n+1))\r\n \r\n#1/n+1/(n+1)=(2*n+1)/n(n+1)\r\n\r\n#1/2n+1/3n+1/6n=6/6n=1/n", "# LUOGU_RID: 92604474\nn=int(input())\r\nif n == 1:\r\n print(-1)\r\nelse :\r\n print(n,n+1,n*(n + 1))", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\n\r\nans = []\r\nif n != 1:\r\n for x in range(n, n + 1000):\r\n if ans:\r\n break\r\n for y in range(x + 1, x + 1000):\r\n z = ((x * y * n) // (x * y * 2 - n * (x + y)))\r\n if not ((x * y * n) % (x * y * 2 - n * (x + y))) and z != x and z != y:\r\n ans = [x, y, (x * y * n) // (x * y * 2 - n * (x + y))]\r\n\r\n x, y, z = ans\r\n \r\nif ans: \r\n print(x, y, z)\r\nelse:\r\n print('-1')", "import math\r\nn=int(input())\r\nif n==1:\r\n print(-1)\r\nif n!=1:\r\n print(f'{n} {n+1} {n*(n+1)}')", "print((lambda x: [\"{0} {1} {2}\".format(x,x+1,x*(x+1)),\"-1\"][x==1])(int(input())))\r\n", "# LUOGU_RID: 126093084\n\nimport math\n\n\nn = 0\n\n\ndef main():\n \n n = int(input())\n\n \n if n == 1:\n \n print(\"-1\")\n return 0\n\n \n print(n, n+1, n*(n+1))\n\n\nmain()", "a=int(input())\r\nif(a==1):print(\"-1\")\r\nelse:print(a,a+1,a*a+a)", "import math\r\n\r\nn = int(input())\r\nok = False\r\n\r\nif n == 1:\r\n print(-1)\r\nelse:\r\n x = n\r\n y = n+1\r\n p = x*y\r\n \r\n if not(x > 1e9 or y > 1e9 or p > 1e9):\r\n print(x, y, p)\r\n else:\r\n print(-1)", "print((lambda n:-1 if n==1 else ' '.join([str(n),str(n+1),str(n*(n+1))]))(int(input())))\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\n\r\nN = int(input())\r\n\r\nif N==1:\r\n exit(print(-1))\r\n\r\na = N\r\nb = N*(N+1)\r\nc = N+1\r\nprint(a,b,c)", "import bisect\r\nimport collections\r\nimport math\r\ndef gcd(a,b):\r\n return math.gcd(a,b)\r\nn=int(input())\r\nif n==1:\r\n print(-1)\r\nelse:\r\n print(n,n+1,n*(n+1))\r\n \r\n ", "\r\nn = int(input())\r\nif n == 1:\r\n print(-1)\r\n exit() \r\nx = n \r\ny = n + 1\r\nz = n*(n+1)\r\nprint(x, y, z)", "n=int(input())\r\nif n==1:print(-1)\r\nelse:print(n,n+1,n*(n+1))", "a=int(input())\r\nflag=1\r\nif a==1:\r\n print('-1')\r\n flag=0\r\nif flag==1:\r\n print(a,a+1,a*(a+1))", "n=int(input())\r\nif n==1 or n*(n+1)>10**9:\r\n print(-1)\r\nelse:\r\n print(n,n+1,n*(n+1),sep=\" \")\r\n", "x=int(input())\r\nif x!=1: \r\n print(x, \" \", x+1, \" \", x*x+x)\r\nelse:\r\n print(-1)", "n = int(input())\r\nprint(-1 if n == 1 else '{} {} {}'.format(n, n + 1, n * (n + 1)))", "n=int(input())\n\nif(n==1):print(-1)\n\nelse:print(n,n+1,n*(n+1))\n\n\n\n# Made By Mostafa_Khaled", "# LUOGU_RID: 125213673\nn = int(input())\nif n == 1:\n print(-1)\n exit()\nprint(n, n+1, n*(n+1))\n", "n=int(input())\nif(n!=1):\n\tprint(\"{0} {1} {2}\".format(n,n+1,n*(n+1)))\nelse:\n\tprint(-1)", "n=int(input())\nif(n==1):\n print(-1)\nelse:\n print(n,(n+1)*n,n+1)", "# n = int(input())\n# sw = 1\n# for x in range(1, 1000):\n# if not sw: break\n# for y in range(x+1, 1000):\n# for z in range(y+1, 1000):\n# if 2 / n == (1/x + 1/y + 1/z):\n# res = str(x) + ' ' +str(y) + ' ' + str(z)\n# sw = 0\n# if sw:\n# print(-1)\n# else:\n# print(res)\n# \n# 7 \n# 7 8 56\n \n# 2 1 1 1\n# --- = --- + --- + ---\n# n n n+1 (n+1)*n\n\n# 2 1 1 1\n# --- = --- + --- + ---\n# 7 7 7+1 (7+1)*7\n\n\n# 3\n# 2 7 42\n\n# 2 1 1 1\n# --- = --- + --- + ---\n# 3 3 3+1 (3+1)*3\n\n# 2 1 1 1 4 + 3 + 1 8\n# --- = --- + --- + --- = ------------- = -----\n# 3 3 4 12 12 12\n\nn = int(input())\n\nif n != 1:\n print(n, n+1, (n+1)*n)\nelse:\n print(-1)\n \t\t\t \t\t \t\t\t\t \t \t \t\t\t \t", "n=int(input())\r\na,b,c=n,n+1,n*(n+1)\r\nif a==b or b==c or c==a:print(-1)\r\nelse:print(a,b,c)\r\n", "#https://codeforces.com/problemset/problem/743/C\r\n#1500\r\nn = int(input())\r\nif n == 1:\r\n print(-1)\r\nelse:\r\n print(n, n + 1 , n * (n + 1))\r\n", "n = int(input())\r\n\r\ndict1 = {1:1}\r\n\r\nif n not in dict1:\r\n dict1[n] = 1\r\n\r\n# for i in range(2,int(n**0.5)+1):\r\n# if n%i == 0:\r\n# if i not in dict1:\r\n# dict1[i] = 1\r\n# if n//i not in dict1:\r\n# dict1[n//i] = 1\r\n\r\n\r\nif len(dict1) == 1:\r\n print(-1)\r\nelse:\r\n lst1 = list(dict1)\r\n a = lst1[0]\r\n b = lst1[-1]\r\n print(min(a+b,n),end = ' ')\r\n print(max(a+b,n),end = ' ')\r\n print((a+b)*n)\r\n", "n = int(input())\nif n == 1:\n\tprint(-1)\nelse:\n\tprint(n, (n+1), n*(n+1))\n\t\t\n\t\t\t\t \t\t\t\t\t \t\t\t\t\t\t \t\t \t\t \t\t", "# LUOGU_RID: 105177621\nn = int(input())\nif n == 1:\n print('-1')\nelse:\n print(n,\" \",n+1,\" \",n*(n+1))", "n=int(input())\nif n<=1:\n print(-1)\nelse :\n print(n,\" \",n+1,\" \",n*(n+1))", "from collections import Counter,defaultdict,deque\r\n#import heapq as hq\r\n#from itertools import count, islice\r\n#from functools import reduce\r\nalph = 'abcdefghijklmnopqrstuvwxyz'\r\n#from math import factorial as fact\r\n#a,b = [int(x) for x in input().split()]\r\nimport math\r\nimport sys\r\n\r\ninput=sys.stdin.readline\r\nn = int(input())\r\nif n==1:\r\n print(-1)\r\n exit()\r\nx = n+1\r\ny = x*n\r\nprint(n,x,y)\r\n", "n = int(input())\r\nif n*(n+1) == n or n*(n+1) == n+1:\r\n print(\"-1\")\r\nelse:\r\n print(n,n+1,n*(n+1))\r\n", "n=int(input())\r\nif n==1:\r\n print(-1)\r\nelse:\r\n print(n,end=\" \")\r\n print(n+1,end=\" \")\r\n print(n*(n+1))", "n = int(input())\r\nif n ==1:print(-1)\r\nelse:print(n,n+1,n**2+n)", "n = int(input())\r\n\r\nx = n\r\n\r\ny = (n + 1)\r\n\r\nz = n * (n + 1)\r\n\r\nif y == z:\r\n\tprint(-1)\r\nelse:\r\n\tprint(x, end=\" \")\r\n\tprint(y, end=\" \")\r\n\tprint(z, end=\" \")", "t = int( input() )\r\nif(t==1):\r\n\tprint(-1)\r\nelse:\r\n\tprint(t,t+1,t*(t+1))\r\n\r\n\r\n\r\n\r\n\r\n\t", "n = int(input())\r\nx = n\r\nif (n==1):\r\n print(-1)\r\nelse:\r\n print(n,n+1,n*(n+1))\r\n", "n=input()\r\nn=int(n)\r\nif n!=1:\r\n print(n,n+1,n*(n+1))\r\nelse: print(-1)\r\n", "\na = int(input())\nif a == 1:\n print(-1)\nelse:\n print(a, a+1, a*(a+1))", "'''\r\nBeezMinh\r\n14:05 UTC+7\r\n08/08/2023\r\n'''\r\nn = int(input())\r\nif n == 1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(n, n + 1, n * (n + 1))", "x=int(input())\r\ns=set()\r\ns.add(x)\r\ns.add(x+1)\r\ns.add(x*(x+1))\r\nif len(s)!=3:\r\n print(-1)\r\nelse:\r\n print(*list(s))\r\n ", "n = int(input())\nif not(n+1 == n*(n+1)): print(n, n+1, n*(n+1))\nelse: print(-1)\n# 1520515828082\n", "# from dust i have come, dust i will be\r\n\r\nn=int(input())\r\n\r\nif n==1:\r\n print(-1)\r\nelse:\r\n print(n,n+1,n*(n+1))", "import string\r\nimport math\r\n\r\nn=int(input())\r\n\r\nif n==1:\r\n print(-1)\r\n exit(0)\r\n\r\nif n&1==0:\r\n print(str(n)+\" \"+str(n//2*3)+\" \"+str(n//2*6))\r\n exit(0)\r\n\r\nprint(str(n)+\" \"+str(n+1)+\" \"+str(n*n+n))", "\r\n\r\n\r\n\r\nn=int(input())\r\nif n==1:\r\n print(-1)\r\nelse:\r\n x=n+1\r\n y=n*x\r\n z=n\r\n print(x,y,z)", "# from dust i have come, dust i will be\n\nn=int(input())\n\nif n==1:\n print(-1)\nelse:\n print(n,n+1,n*(n+1))\n\t\t \t \t \t\t \t \t\t \t\t\t \t\t\t", "n = int(input())\r\nif n>1:\r\n print(*[n,n+1,n*(n+1)])\r\nelse:\r\n print(-1)", "x = int(input()); print(\"-1\" if x==1 else f\"{x} {x+1} {x*(x+1)}\")" ]

[ "x, t, a, b, da, db = map(int, input().split())\r\nA = [0] + [a-i*da for i in range(t)]\r\nB = {0} | {b-i*db for i in range(t)}\r\n\r\nprint('YES' if any(x-a in B for a in A) else 'NO')", "def main():\r\n x, t, a, b, da, db = map(int, input().split())\r\n\r\n possible_a = [0]\r\n possible_b = [0]\r\n for i in range(t):\r\n p = a - (da * i)\r\n possible_a.append(p)\r\n q = b - (db * i)\r\n possible_b.append(q)\r\n \r\n for p in range(t+1):\r\n for q in range(t+1):\r\n if possible_a[p] + possible_b[q] == x:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nmain()", "x, t, a, b, da, db = map(int, input().split())\r\nans = 'NO'\r\nfor t1 in range(t):\r\n\tfor t2 in range(t):\r\n\t\tif a - da*t1 + b - db*t2 == x or a - da*t1 == x or b - db*t2 == x or x == 0:\r\n\t\t\tans = 'YES'\r\n\t\t\tbreak\r\nprint(ans)\r\n", "x, t, a, b, da, db = map(int,input().split())\r\na_scores = [a-(i*da) for i in range(t)]\r\nb_scores = [b-(i*db) for i in range(t)]\r\nfor i in a_scores + [0]:\r\n for j in b_scores + [0]:\r\n if i+j == x:\r\n print('YES')\r\n exit()\r\nprint('NO') ", "x, t, a, b, c, d = map(int, input().split())\r\nif x == 0:\r\n print('YES')\r\n exit()\r\nfor i in range(t):\r\n if (x == a - c * i or x == b - d * i):\r\n print('YES')\r\n exit()\r\n for j in range(t):\r\n if (x == a + b - c * i - d * j):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "a, b, c, d, e, f = map(int, input().split())\r\n\r\nif a == 0:\r\n\tprint(\"YES\")\r\n\texit(0)\r\n\r\nfor i in range(b):\r\n\tx = c\r\n\ty = d\r\n\tfor j in range(b):\r\n\t\tif x == a or y == a or x + y == a:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit(0)\r\n\t\tx -= e\r\n\td -= f\r\nprint(\"NO\")", "def tasks(x, t, a, b, da, db):\r\n flag = False\r\n for i in range(t):\r\n for j in range(t):\r\n for z in range(2):\r\n for m in range(2):\r\n if z * (a - da * i) + m * (b - db * j) == x:\r\n flag = True\r\n if flag is True:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nx, t, a, b, da, db = [int(y) for y in input().split()]\r\nprint(tasks(x, t, a, b, da, db))\r\n\r\n", "x,t,a,b,da,db=map(int,input().split())\r\nif x==0:\r\n print(\"YES\")\r\n exit()\r\nfor ta in range(t):\r\n for tb in range(t):\r\n if x==a-ta*da or x==b-tb*db or x==a-ta*da+b-tb*db:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "x,t,a,b,da,db=list(map(int, input().split()))\r\nlsa=[0]+[a-i*da for i in range(t)]\r\nlsb=[0]+[b-i*db for i in range(t)]\r\nfor item in lsa:\r\n\tif x-item in lsb:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "from itertools import product\r\nx, t,a,b,da,db = map(int, input().split())\r\nans=0\r\nla,lb = [0],[0]\r\nfor i in range(t):\r\n la +=[a-i*da]\r\n lb +=[b-i*db]\r\nfor sx in product(la,lb):\r\n if sx[0]+sx[1]==x:\r\n ans=1\r\n break\r\nprint(['NO','YES'][ans])", "def op():\r\n x , t , a , b , da , db = map(int, input().split())\r\n if x == 0:\r\n return 'YES' \r\n if x <= a and x > a - da * t and (a - x) % da == 0 :\r\n return 'YES' \r\n if x <= b and x > b - db * t and (b - x) % db == 0:\r\n \r\n return 'YES'\r\n for i in range(t): ## compination\r\n for j in range(t):\r\n if (x == a + b - da * i - db * j):\r\n return 'YES' \r\n return 'NO'\r\nprint(op())\r\n \r\n \r\n", "x, t, a, b, da, db = map(int, input().split())\n\nA, B = [0] + [a - da * i for i in range(t)], set([0] + [b - db * i for i in range(t)])\n\nprint('YES' if any(x - i in B for i in A) else 'NO')", "x, t, a, b, d, D = map(int, input().split(\" \"))\r\n \r\nanswer = \"NO\"\r\nif(x == 0):\r\n answer = \"YES\"\r\nelse:\r\n for U in range(t):\r\n for B in range(t):\r\n if(max(a-U*d, 0)+max(b-B*D, 0) == x or max(a-U*d, 0) == x or max(b-B*D, 0) == x):\r\n answer = \"YES\"\r\n break\r\n \r\n if(answer == \"YES\"):\r\n break\r\n \r\nprint(answer)", "x,t,a,b,da,db=map(int,input().split())\r\nflag = False\r\nfor fa in range(2):\r\n for fb in range(2):\r\n for i in range(t):\r\n for j in range(t):\r\n if(fa*a-fa*(i*da)+fb*b-fb*(j*db)==x):\r\n flag = True\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x, t, a, b, d1, d2 = map(int, input().split())\r\nla, lb = [0] + [a-d1*i for i in range(t)], [0] + [b-d2*j for j in range(t)]\r\nfor s in la:\r\n if x-s in lb:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "x,t,a,b,da,db=map(int,input().split())\r\nA=[0]+[a-i*da for i in range(t)]\r\nB=[0]+[b-i*db for i in range(t)]\r\nflag=0\r\nfor i in A:\r\n\tif x-i in B:\r\n\t\tprint (\"YES\")\r\n\t\tflag=1\r\n\t\tbreak\r\nif(flag==0):\r\n print (\"NO\")", "import sys\r\nimport bisect\r\n# from collections import deque\r\n\r\nRi = lambda : [int(x) for x in sys.stdin.readline().split()]\r\nri = lambda : sys.stdin.readline().strip()\r\n \r\ndef input(): return sys.stdin.readline().strip()\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\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\r\ndef ceil(x, y=1): return int(-(-x // y))\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\r\ndef Yes(): print('Yes')\r\ndef No(): print('No')\r\ndef YES(): print('YES')\r\ndef NO(): print('NO')\r\nINF = 10 ** 30 \r\nMOD = 998244353\r\n\r\n# for _ in range(int(ri())):\r\nx,t,a,b,da,db = Ri()\r\narr1 = [0]\r\nfor i in range(t):\r\n arr1.append(a-i*da)\r\n # a-=da\r\narr2 = [0]\r\nfor i in range(t):\r\n arr2.append(b-i*db)\r\n # b-=db\r\nflag = False\r\nfor i in range(len(arr1)):\r\n for j in range(len(arr2)):\r\n if arr1[i] + arr2[j] == x:\r\n YES()\r\n flag = True\r\n quit()\r\nif not flag:\r\n NO()\r\n\r\n ", "from collections import defaultdict\r\nx,t,a,b,da,db=map(int,input().split())\r\npa=[0]\r\npb=[0]\r\nfor i in range(t):\r\n pa.append(a)\r\n pb.append(b)\r\n a-=da\r\n b-=db\r\nd1=defaultdict(int)\r\nd2=defaultdict(int)\r\n\r\nfor y in pb:\r\n d2[y]=1\r\nfor y in pa:\r\n d1[y]=1\r\nf=0\r\nfor i in range(len(pa)):\r\n if x>=pa[i]:\r\n if d2[x-pa[i]]>0:\r\n f=1\r\n break\r\nif f==1:print(\"YES\")\r\nelse:\r\n for i in range(len(pb)):\r\n if x>=pb[i]:\r\n if d1[x-pb[i]]>0:\r\n f=1\r\n break\r\n if f==1:print(\"YES\")\r\n else:print(\"NO\")", "x,t,a,b,da,db = map(int, input().split())\r\n\r\nif x == 0:\r\n print('YES'); exit()\r\n\r\nfor i in range(t):\r\n for j in range(t):\r\n p1 =(a-i*da)\r\n p2 = (b-j*db)\r\n if x == p1 + p2 or x==p1 or x == p2:\r\n print('YES')\r\n exit()\r\nprint('NO')", "def main():\n x, t, a, b, da, db = map(int, input().split())\n db *= -1\n tdb = t * db\n s = {z for y in range(a + b, a + b - da * t, -da) for z in range(y, y + tdb, db)}\n s.update(range(a, a - da * t, -da))\n s.update(range(b, b + tdb, db))\n s.add(0)\n print((\"NO\", \"YES\")[x in s])\n\nif __name__ == '__main__':\n main()\n", "x,t,a,b,da,db=map(int,input().split())\r\nif x==0:\r\n print(\"YES\")\r\nelse:\r\n flag=True\r\n for i in range(t):\r\n for j in range(t):\r\n fd=a-da*i\r\n bd=b-db*j\r\n if fd==x or bd==x or x==fd+bd:\r\n print(\"YES\")\r\n flag=False\r\n break\r\n if flag==False:\r\n break\r\n if flag:\r\n print(\"NO\")", "def solve():\n\tx, t, a, b, da, db = map(int, input().split())\n\tif x == 0:\n\t\tprint(\"YES\")\n\t\treturn\n\tfor i in range(t):\n\t\tf = a-i*da\n\t\tif f == x:\n\t\t\tprint(\"YES\")\n\t\t\treturn\n\t\tfor j in range(t):\n\t\t\tg = b-j*db\n\t\t\tif g == x or f+g == x:\n\t\t\t\tprint(\"YES\")\n\t\t\t\treturn\n\tprint(\"NO\")\nsolve()\n", "x,t,a,b,c,d=map(int,input().split())\r\nR=range(t)\r\ny=x==0\r\nfor i in R:\r\n\tif x==a-c*i or x==b-d*i:y=1\r\n\tfor j in R:y|=x==a+b-c*i-d*j\r\nprint(['NO','YES'][y])", "x,t,a,b,c,d=map(int,input().split())\nR=range(t)\ny=x==0\nfor i in R:\n\tif x==a-c*i or x==b-d*i:y=1\n\tfor j in R:y|=x==a+b-c*i-d*j\nprint(['NO','YES'][y])\n \t \t\t\t \t \t \t \t\t\t \t \t\t\t\t" ]

[ "n=int(input())\r\nnum=input().split(' ')\r\nl=[0]*4\r\nfor i in range(4):\r\n l[i]=int(num[i])\r\nt=tuple(l)\r\na,b,c,d=t\r\np=[0]*(n+1)\r\nnum=input().split(' ')\r\nmp=[list() for _ in range(n+1)]\r\nfor i in range(2,n+1):\r\n p[i]=int(num[i-2])\r\n \r\n mp[p[i]].append(i)\r\ns=[0]*(n+1)\r\ndef sof(i):\r\n if s[i]!=0:\r\n return s[i]\r\n if len(mp[i])>0:\r\n res=0\r\n for son in mp[i]:\r\n res+=sof(son)\r\n s[i]=res\r\n return res\r\n else:\r\n s[i]=1\r\n return 1\r\nrootofl=list()\r\nfor leaf in l:\r\n while p[leaf]!=1:\r\n leaf=p[leaf]\r\n rootofl.append(leaf)\r\nrootlist=list()\r\nfor rootson in mp[1]:\r\n if not rootson in rootofl:\r\n rootlist.append(rootson)\r\ndef canpick(a,des):\r\n if des==0:\r\n return True\r\n picklist=rootlist[:]\r\n for j in range(2):\r\n cur=a[j]\r\n while p[cur]!=1:\r\n fa=p[cur]\r\n for i in mp[fa]:\r\n if i!=cur :\r\n picklist.append(i)\r\n cur=fa\r\n v=set()\r\n v.add(0)\r\n for i in range(len(picklist)):\r\n val=sof(picklist[i])\r\n v |= {ori+val\r\n for ori in v}\r\n if des in v:\r\n return True\r\n return False\r\n '''\r\n v=[False]*(n+1)\r\n v[0]=True\r\n \r\n \r\n for i in range(len(picklist)):\r\n val=sof(picklist[i])\r\n if des-val>=0 and v[des-val]:\r\n return True\r\n for j in range(des-val,-1,-1):\r\n if v[j] :\r\n v[j+val]=True\r\n return False\r\n '''\r\nm=sof(1)\r\nif m%2==1:\r\n print('NO')\r\nelse:\r\n v1=m//2-1-sof(rootofl[2])\r\n v2=m//2-1-sof(rootofl[0])\r\n if canpick([a,b], v1) and canpick([c,d], v2):\r\n print('YES')\r\n else:\r\n print('NO')" ]

[ "n = int(input())\nb, c = 0, 0\nfor i in map(int, input().split()):\n if i < 0:\n c += i\n else:\n b += i\n\nprint(b - c)\n\n \t \t\t \t \t \t \t \t\t \t \t \t", "n=int(input())\r\nA=input().split()\r\nB,C=[],[]\r\nfor i in range(n):\r\n A[i]=int(A[i])\r\n if A[i]>0:\r\n B.append(A[i])\r\n else:\r\n C.append(A[i])\r\nprint(sum(B)-sum(C))\r\n", "n = int(input())\na = list(map(int,input().split()))\n\nb = 0\nc = 0\nfor i in range(n):\n if a[i] < 0:\n c = c + a[i]\n else:\n b = b + a[i]\nprint(b-c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nx = list(map(lambda x: abs(x),a))\r\nprint(sum(x))", "n = int(input())\r\nprint(sum([abs(int(x)) for x in input().split()]))", "num=int(input())\r\nls=list(map(int,input().split()))\r\nls.sort()\r\ni=len(ls)-1\r\nt=0\r\nwhile ls[i]>0:\r\n t+=ls[i]\r\n ls.pop()\r\n if i==0:\r\n break\r\n i-=1\r\nprint(t-sum(ls))\r\n", "n = int(input())\na = list(map(int, input().split()))\nb = []\nc = []\n\nfor x in a:\n if (x >= 0): \n b.append(x)\n else:\n c.append(x)\n\nprint(sum(b) - sum(c))", "n=int(input())\r\nm=list(map(int,input().split()))\r\na=0\r\nb=0\r\nfor i in m:\r\n\tif(i>=0):\r\n\t\ta+=i\r\n\telse:\r\n\t\tb+=i\r\nprint(a-b)", "# import sys\r\n# sys.stdin = open('input.txt', 'r')\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nresult = 0\r\nfor i in arr:\r\n if i>0: result+= i\r\n else: result -= i\r\nprint(result)", "exec(\"f=lambda x:abs(int(x));input();print(sum(map(f,input().split())))\")\n", "# problem D\nn = int(input())\nelements = list(map(int, input().split()))\na = []\nb = []\nfor x in elements:\n if x < 0:\n a.append(x)\n else:\n b.append(x)\nA = sum(a)\nB = sum(b)\nprint(B - A)\n\n\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\npos =[]\r\nneg = []\r\nfor i in range(n):\r\n if li[i]>0:\r\n pos.append(li[i])\r\n else:\r\n neg.append(li[i])\r\nprint(sum(pos)-sum(neg))", "n,a=int(input()),list(map(int,input().split()))\r\nprint(sum(abs(x)for x in a))", "#!/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 = int(wtf[0])\r\n A = map(int, wtf[1].split())\r\n lp = 0\r\n rp = 0\r\n for a in A:\r\n if a < 0:\r\n lp += a\r\n else:\r\n rp += a\r\n print(rp-lp)\r\n", "n = int(input())\npre = [int(i) for i in input().split()]\nans1 = 0\nans2 = 0\nfor i in pre:\n if i < 0 :\n ans1 += i\n else :\n ans2 += i\nprint(ans2 - ans1)\n\n", "def solve(n, a):\n return sum([abs(i) for i in a]) \n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))\n\n\nmain()\n", "n=input()\r\nl=list(map(int, input().split()))\r\nsm=0\r\nfor i in l:\r\n if i>=0:\r\n sm+=i\r\n else:\r\n sm+=i*(-1)\r\nprint(sm)", "n=int(input())\r\n\r\nl=list(map(int,input().split()))\r\nre=0\r\nfor i in range (n):\r\n\tif l[i]<0:\r\n\t\tre=re-l[i]\r\n\telse:\r\n\t\tre=re+l[i]\r\nprint(re)", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nx=[]\r\ny=[]\r\nfor i in l:\r\n if(i>=0):\r\n x.append(i)\r\n else:\r\n y.append(i)\r\n\r\nsum1=sum(x)\r\nsum2=sum(y)\r\nprint(sum1-sum2)\r\n", "n=input()\r\na=input().split()\r\na=[int(x) for x in a]\r\nb=[]\r\nc=[]\r\nfor i in a:\r\n if i>=0:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nprint(sum(b)-sum(c))\r\n\r\n \t\t \t \t\t\t \t\t \t \t\t \t", "import sys\r\n\r\nn = int(input())\r\nL = list(input().split())\r\nsum = 0\r\n\r\nfor x in L:\r\n\tsum += abs(int(x))\r\n\t\r\nprint(sum)\r\n\t", "i= int(input())\r\n\r\ntest= list(map(int, input().split()))\r\nb=[]\r\nc=[]\r\nfor i in test:\r\n if i>0:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\n\r\nprint(sum(b)-sum(c))\r\n", "a=int(input())\nlst=list(map(int,input().split()))\nb=[]\nc=[]\nfor el in lst:\n if el>=0:\n b.append(el)\n else:\n c.append(el)\nprint(sum(b)-sum(c))\n \t \t\t \t \t \t \t\t \t\t\t \t\t \t", "am = int(input())\r\narr = list(map(int,input().split()))\r\nd = 0\r\nfor i in range(am):\r\n d+=abs(arr[i])\r\nprint(d)", "import sys\r\n\r\ninputData = sys.stdin.readlines()\r\ninputData = inputData[1:]\r\ninputData = [int(x) for x in inputData[0].split()]\r\n\r\ninputData = [-x if x < 0 else x for x in inputData]\r\nprint(sum(inputData))", "n = int(input())\r\na = 0\r\nfor elem in input().split():\r\n if int(elem) >= 0:\r\n a += int(elem)\r\n else:\r\n a -= int(elem)\r\nprint(a)", "input();print(sum(map(lambda x:abs(int(x)),input().split())))", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\npos = [x for x in a if x >= 0]\r\nneg = [x for x in a if x < 0]\r\nprint(sum(pos) - sum(neg))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncnt=0\r\ncnt1=0\r\nfor i in a:\r\n if i<0:\r\n cnt+=i\r\n else:\r\n cnt1+=i\r\nprint(cnt1-cnt)", "input()\r\nprint(sum(map(abs,map(int,input().split()))))", "a=int(input())\r\nb=list(map(int,input().split()))\r\nmassive=[]\r\nmassive1=[]\r\nfor i in range(a):\r\n if b[i]>=0:\r\n massive.append(b[i])\r\n else:\r\n massive1.append(b[i])\r\nprint(sum(massive)-sum(massive1))\r\n", "# problem D\r\nn = int(input())\r\nelements = list(map(int, input().split()))\r\na = []\r\nb = []\r\nfor x in elements:\r\n if x < 0:\r\n a.append(x)\r\n else:\r\n b.append(x)\r\nA = sum(a)\r\nB = sum(b)\r\nprint(B - A)\r\n", "n = int(input())\nline = input().split(' ')\nsum1 = 0\nsum2 = 0\nfor i in range(n):\n if int(line[i]) > 0 :\n sum1 = sum1 + int(line[i])\n else :\n sum2 = sum2 + int(line[i])\n\nprint(sum1 - sum2)\n", "n=int(input())\r\nb=[]\r\nc=[]\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n if arr[i]>=0:\r\n b.append(arr[i])\r\n else:\r\n c.append(arr[i])\r\nprint(sum(b)-sum(c))", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n s=s+abs(i)\r\nprint(s)", "ans = 0 #maximum possible value of B - C, where B is the sum of elements of sequence b, and C is the sum of elements of sequence c. TL;DR-> the answer.\r\ninput() #(dummy) - the number of elements in a.\r\nl = [int(i) for i in input().split()] #the elements of sequence a.\r\nfor num in l:\r\n ans += abs(num)\r\nprint(ans)", "t=int(input())\r\nls=list(map(int,input().split()))\r\nsumx=0\r\nfor m in ls:\r\n sumx+=abs(m)\r\nprint(sumx)", "n = int(input())\n\narray = [int(x) for x in input().split()]\n\narray.sort()\n\nb, c = 0, 0\n\nfor number in array:\n if (number > 0):\n b += number\n else:\n c += number\n\nprint(b - c)\n", "n = int(input())\na = input().split()\n\na = list(map(int, a))\nb = []\nc = []\nfor num in a:\n if num >= 0:\n b.append(num)\n else:\n c.append(num)\n\nif len(b) == 0:\n b.append(0)\n\nif len(c) == 0:\n c.append(0)\n\nB = sum(b)\nC = sum(c)\n\n\nprint(B-C)", "a=eval(input())\nb=input().split()\nb=[int(x) for x in b]\nsum = 0\nfor i in b:\n sum+=abs(i)\nprint(sum)\n", "\nn = int(input())\n\nprint(sum(map(lambda x: abs(int(x)), input().split())))\n", "q= int(input())\r\nw=list(map(int,input().split()))\r\ne=[]\r\nfor i in w:\r\n if i<0:\r\n e.append(i)\r\nprint(sum(w)-2*sum(e))\r\n", "n=int(input())\na = list(map(int, input().split()))\na.sort()\n\npo=0\n\nne=0\n\nfor i in range(len(a)):\n if(a[i]<0):\n\n ne+=a[i]\n if(a[i]>=0):\n\n po+=a[i]\n\nprint(po-ne)\n \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()]\r\nif sum(i<0 for i in l)==0:\r\n print(sum(l))\r\nelse:\r\n z=[i for i in l if i>0]\r\n z1=[i for i in l if i<0]\r\n print(sum(z)-sum(z1))", "\r\n\r\ninput(); print(sum(abs(int(x)) for x in input().split()))", "list_a = []\nsum_b = 0\nsum_c = 0\n\nn = int(input())\ntmp = input()\nlist_a = [int(r) for r in tmp.split()]\n\n\nfor i in list_a:\n\tif(i > 0):\n\t\tsum_b = sum_b + i\n\telse:\n\t\tsum_c = sum_c + i\n\nprint(sum_b - sum_c)", "n = int(input())\r\nnumbers = [int(i) for i in input().split()]\r\npostNum = []\r\nnegNum = []\r\nfor i in numbers:\r\n if i > 0:\r\n postNum.append(i)\r\n elif i<0:\r\n negNum.append(i)\r\nc = 0\r\nb = sum(postNum)\r\nif len(negNum) != 0:\r\n c = sum(negNum)\r\nprint(b - c)", "n=(int(input()))\r\na=list(map(int, input().split()))\r\ns=0\r\nfor i in a:\r\n s+=abs(i)\r\nprint(s)", "def sol():\r\n n = int(input())\r\n nums = [int(x) for x in input().split()]\r\n pos = 0\r\n neg = 0\r\n for num in nums:\r\n if num >= 0:\r\n pos += num\r\n else:\r\n neg += num\r\n return pos - neg\r\nprint(sol())", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n\tif m[i] < 0:\r\n\t\tb += [m[i]]\r\n\t\tm[i] = 0\r\nprint(sum(m) - sum(b))\r\n\t\r\n\t\r\n", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd\r\n'''\r\n\r\nn=int(input())\r\nseq=list(map(int,input().split()))\r\nsum=0\r\nfor _ in range(n):\r\n seq[_]=abs(seq[_])\r\n sum+=seq[_]\r\nprint(sum)", "a = int(input())\r\nb = input().split()\r\nd = []\r\ne = []\r\nfor i in range(a):\r\n b[i] = int(b[i])\r\n if b[i] < 0:\r\n e.append(b[i])\r\n else:\r\n d.append(b[i])\r\nprint(sum(d) - sum(e))", "def solution(a):\n positive_sum = 0\n negative_sum = 0\n\n for i in a:\n if i >= 0:\n positive_sum += i\n else:\n negative_sum += i\n \n return abs(positive_sum-negative_sum)\n\n\n\n\n\nif __name__ == \"__main__\":\n n = int(input())\n a = [int(i) for i in input().split()]\n print(solution(a))\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\na,b,=0,0\r\nfor k in l:\r\n if(k>=0):\r\n a+=k\r\n else :\r\n b+=k\r\nprint(a-b)\r\n \r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nret = sum([abs(x) for x in a])\r\nprint(ret)", "n = int(input())\nlst = list(map(int, input().split()))\n\nb = []\nc = []\nsum_c = 0\nsum_b = 0\nfor x in lst:\n if x < 0:\n sum_c += x\n else:\n sum_b += x\nprint(sum_b - sum_c)", "n = int(input())\r\nai = list(map(int,input().split()))\r\na = 0\r\nfor i in range(n):\r\n a += abs(ai[i])\r\nprint(a)\r\n", "n = int(input())\na = [int(x) for x in input().split(' ')]\nma = sum([x for x in a if x >= 0])\nmi = sum([x for x in a if x < 0])\nprint(ma - mi)\n", "input();print(sum([x,-x][x<0] for x in map(int,input().split())))", "def read():\n return [int(v) for v in input().split()]\n\n\ndef main():\n read()\n a = read()\n s1 = sum(a)\n s2 = -sum(filter(lambda x: x < 0, a))\n print(s1+2*s2)\n\n\nif __name__ == '__main__':\n main()\n", "def razdelenie(lst):\r\n count1, count2 = 0, 0\r\n for elem in lst:\r\n if elem > 0:\r\n count1 += elem\r\n else:\r\n count2 += elem\r\n return count1 - count2\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(razdelenie(a))\r\n\r\n", "input()\r\nseq = [int(i) for i in input().split(\" \")]\r\nb = 0\r\nc = 0\r\nfor s in seq:\r\n if s >= 0: b += s\r\n else: c += s\r\nprint(b-c)", "input()\na = input().split()\ns = 0\nfor i in a:\n s += abs(int(i))\nprint(s)", "#946A\r\nn=int(input())\r\na=[int(a) for a in input().split()]\r\nb=0\r\nc=0\r\nfor i in a:\r\n if i>0:\r\n b+=i\r\n else:\r\n c+=i\r\n \r\nprint(b-c)", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nc=[]\r\nd=[]\r\nfor i in range(len(a)):\r\n if a[i]>=0:\r\n c.append(a[i])\r\n else:\r\n d.append(a[i])\r\nprint(sum(c)-sum(d))", "input()\ns=0\nl=[*map(int,input().split())]\nfor i in l:\n s+=abs(i)\nprint(s)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-08 22:59:56\nLastEditTime: 2021-11-09 23:01:23\nDescription: Partition\nFilePath: CF946A.py\n'''\n\n\ndef func():\n _ = int(input())\n lst = map(abs, map(int, input().strip().split()))\n print(sum(lst))\n\n\nif __name__ == '__main__':\n func()\n", "n=int(input())\r\nlist=list(map(int,input().split()))\r\nB=0\r\nC=0\r\nfor i in range(n):\r\n if list[i]>=0:\r\n B+=list[i]\r\n else:\r\n C+=list[i]\r\n \r\nprint(B-C)", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nneg=0\r\npos=0\r\nfor x in num:\r\n if x>=0:\r\n pos+=x\r\n else:\r\n neg+=x\r\nprint(pos-neg)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nfor i in range(n):\r\n if a[i]<0:\r\n c+=1\r\nprint(sum(a[c:n])-sum(a[0:c]))\r\n", "input()\r\na = list (map(abs, list(map(int, input().split()))))\r\nprint(sum(a))", "n=int(input())\r\nn1=list(map(int,input().split()))\r\nlst=[]\r\nlst1=[]\r\nfor i in range(n):\r\n if(n1[i]<0):\r\n lst.append(n1[i])\r\n else:\r\n lst1.append(n1[i])\r\nprint(sum(lst1)-sum(lst))\r\n\r\n\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\ny = list(filter(lambda x: x>0,x))\r\nz = list(filter(lambda x: x<0,x))\r\nprint(sum(y)-sum(z))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=0\r\nfor i in range(n):\r\n\ta=l[i]\r\n\ta=abs(a)\r\n\tl[i]=a\r\nprint(sum(l))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx,x1=[],[]\r\nfor i in range(n):\r\n if l[i]>=0:\r\n x.append(l[i])\r\n else:\r\n x1.append(abs(l[i]))\r\nprint(sum(x)+sum(x1))", "n = int(input())\r\nd = list(map(int, input().split()))\r\ns1 = 0\r\ns2 = 0\r\nfor i in d:\r\n if i > 0:\r\n s1 += i\r\n else:\r\n s2 += i\r\nprint(s1 - s2)\r\n", "n = int(input())\nx = y = p = int(0)\narr = list(map(int, input().split()))\nif n == len(arr):\n\tp = 1\n\tfor j in arr:\n\t\tif j <= 0:\n\t\t\ty = y + j\n\t\telse:\n\t\t\tx = x + j\nif p == 1:\n\tprint(x - y)\n\t\t\t \t\t\t\t\t \t \t\t\t \t\t\t\t\t \t\t", "import math\n\nn = int(input())\na = list(map(int,input().split()))\nsum = 0\n\nfor i in a:\n if i <0:\n sum += abs(i)\n else:\n sum += i\n\nprint(sum)\n\t \t\t\t \t\t \t \t \t \t \t \t", "# A. Partition\n\nn = int(input())\na = list(map(int, input().split()))\na = [-x if x < 0 else x for x in a]\nprint(sum(a))\n", "t=int(input())\r\nz=list(map(int,input().split()))\r\nk=0\r\np=0\r\nfor i in z:\r\n\tif(i<0):\r\n\t\tk+=(-i)\r\n\telse:\r\n\t\tk+=i\r\nprint(k)", "a = int(input())\ny = list(map(int, input().split()))\n\nb = 0\nc = 0\n\nfor i in range(a):\n if y[i] < 0:\n b += y[i]\n else:\n c += y[i]\n\nprint(c-b)\n\t \t \t \t\t \t\t \t\t \t\t\t \t", "n = int(input())\n\nnumbers = input().split(' ')\n\nfor i in range(n):\n numbers[i] = int(numbers[i])\n\npositive_numbers = []\nnegative_numbers = []\n\nfor number in numbers:\n if number > 0:\n positive_numbers.append(number)\n else:\n negative_numbers.append(number)\n\nprint(sum(positive_numbers) - sum(negative_numbers))", "n = int(input())\r\na = input().split()\r\np = 0\r\nfor i in range(n):\r\n p += abs(int(a[i]))\r\nprint(p)", "b,c=[],[]\r\na=int(input())\r\nA=list(map(int,input().split()))\r\nfor x in range(a):\r\n\tif \tA[x]<=0:\r\n\t\tc.append(A[x])\r\n\telse:\r\n\t\tb.append(A[x])\r\nprint(sum(b)-sum(c))", "\r\ndef solve(nums):\r\n c = 0\r\n b = 0\r\n for i in nums:\r\n if i >= 0:\r\n b += i \r\n else:\r\n c += i\r\n \r\n return b - c\r\nn = int(input())\r\nnums = [int(i) for i in input().split()]\r\nprint(solve(nums))", "a=int(input())\r\nb=list(map(int,input().split()))\r\nprint(sum([i for i in b if i>=0])-sum([i for i in b if i<0]))\r\n#author:SK__Shanto__㋛ \r\n#code__define__your__smartness", "n = int(input())\na = [int(i) for i in input().split()]\nb = 0\nc = 0\nfor i in range(n):\n if a[i] >= 0:\n b += a[i]\n else:\n c += a[i]\nprint(b-c)\n \t\t \t\t \t \t \t\t\t \t\t \t \t", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\nl = sum(map(abs,l))\r\n\r\nprint(l)", "input()\r\n \r\narr = [abs(int(i)) for i in input().split()]\r\nprint(sum(arr))", "n = input()\r\nprint(sum(map(lambda x: abs(int(x)), input().split())))\r\n", "n = int(input())\r\nans = 0\r\ns = list(map(int, input().split()))\r\n#for i in s:\r\n #if(s.count(i) < 2):\r\n #ans += abs(i)\r\n#print(ans)\r\nfor i in s:\r\n ans += abs(i)\r\nprint(ans)", "n = int(input())\r\nw = list(map(int, input().split()))\r\nw.sort()\r\na = 0\r\nfor i in range(n):\r\n if w[i] >= 0:\r\n a = i\r\n break\r\nelse:\r\n a = i+1\r\nprint(sum(w[a:])-sum(w[:a]))\r\n", "n = int(input())\na = list(map(int, input().split()))\nans = 0\nfor x in a:\n if x >= 0:\n ans += x\n else:\n ans += -x\nprint(ans)", "n=int(input())\r\nL=[int(k) for k in input().split()]\r\npos=0\r\nneg=0\r\nfor k in L:\r\n if(k>0):\r\n pos+=k\r\n else:\r\n neg+=-k\r\nprint(pos+neg)\r\n", "a = int(input())\nb = list()\nc = list()\nd = list(map(int, input().split()))\nfor i in d:\n if(i>=0):\n b.append(i)\n else:\n c.append(i)\nsb = 0\nsc=0\nfor i in b:\n sb = sb+ i\nfor i in c:\n sc = sc+ i\nprint(sb-sc)\n \t \t \t\t \t \t\t\t\t\t \t\t \t \t\t \t", "_ = int(input())\r\na = list(map(int, input().split()))\r\nprint(sum(max(0, i) for i in a)-sum(min(0, i) for i in a))\r\n", "n=int(input())\r\na=[abs(int(v)) for v in input().split()]\r\nsum=sum(a)\r\nprint(sum)", "n = int(input())\r\nx = list(map(int, input().split()))\r\na = x.copy()\r\nb = []\r\nfor i in x:\r\n if i < 0:\r\n a.remove(i)\r\n b.append(i)\r\nif len(b) != 0:\r\n print(sum(a) - sum(b))\r\nelse:\r\n print(sum(a))", "n = int(input())\r\nmoo = list(map(int, input().split()))\r\nb = []\r\nc = []\r\nfor i in moo:\r\n if i < 0:\r\n c.append(i)\r\n else:\r\n b.append(i)\r\nprint(sum(b)-sum(c))", "a = input()\r\nb = input().split(' ')\r\nB = []\r\nC = []\r\ns1 = 0\r\ns2 = 0\r\nfor i in b:\r\n i = int(i)\r\n if i >= 0:\r\n B.append(i)\r\n else:\r\n C.append(i)\r\nfor j in range(len(B)):\r\n s1 += B[j]\r\nfor k in range(len(C)):\r\n s2 += C[k]\r\nprint(s1 - s2)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=filter(lambda x:x>=0,a)\r\nc=filter(lambda x:x<0,a)\r\nprint(sum(b)-sum(c))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nf = 0\r\ns = 0\r\nfor i in data:\r\n if i > 0:\r\n f += i\r\n else:\r\n s += i\r\n\r\nprint(f - s)", "def main():\r\n n = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n print(sum([x for x in arr if x > 0]) - sum([x for x in arr if x < 0]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nar = list(map(int, input().split()))\r\n\r\nc = [x for x in ar if x < 0]\r\n\r\nb = [x for x in ar if x > 0]\r\n\r\nif len(c) > 0 and len(b) > 0:\r\n print(sum(b) - sum(c))\r\nelif len(c) == 0 and len(b) == 0:\r\n print(0)\r\nelif len(c) > 0 and len(b) == 0:\r\n print(0-sum(c))\r\nelif len(b) > 0 and len(c) == 0:\r\n print(sum(b) - 0)", "n = int(input())\r\nc = 0\r\nli = list(map(int, input().split()))\r\nfor i in range(n):\r\n c += abs(li[i])\r\nprint(c)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nres=0\r\nfor i in a:\r\n if i<0:\r\n res-=i \r\n else:\r\n res+=i \r\nprint(res)", "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]<0:\r\n c+=a[i]\r\n else:\r\n b+=a[i]\r\nprint(b-c)", "n = int(input())\nsum1 = 0\nsum2 = 0\nl = list(map(int,input().split()))#根据分隔符分割并且迭代器转换成整数并放入了列表中，妙啊\nfor i in l:\n if i>=0:\n sum1 += i\n elif i<0:\n sum2 +=i\n\nd = abs(sum2)\nc = sum1 + d\nprint(c)\n\t \t \t \t \t\t \t \t\t \t \t\t \t", "n=int(input())\r\nli_st = list(map(int, input().split())) \r\npos=[]\r\nfor num in li_st:\r\n if num>=0:\r\n pos.append(num)\r\nB=(sum(pos))\r\nC=(sum(li_st))\r\nC=C-B\r\n\r\nprint(B-C)\r\n\r\n\r\n", "n = int(input())\nlst = list(map(int, input().split()))\na, b = 0, 0\nfor el in lst:\n if el<0:\n a+=el\n else:\n b+=el\nprint(b-a)\n\t \t \t\t\t\t \t\t \t \t\t\t\t \t\t \t\t", "input()\r\na = map(int, input().split(' '))\r\nprint(sum(map(abs, a)))", "\r\n\r\nn = int(input())\r\n\r\na = [int(a) for a in input().split()]\r\nb = c = 0\r\nfor i in a:\r\n if i < 0:\r\n c += i\r\n else:\r\n b += i\r\n \r\nprint(b - c)", "input()\r\nk = (map(int, input().split()))\r\nB = []\r\nC = []\r\n\r\nfor item in k:\r\n if item < 0:\r\n C.append(item)\r\n else:\r\n B.append(item)\r\n \r\nprint(sum(B) - sum(C))", "n = int(input())\n\n\ndef a(x):\n return abs(int(x))\n\n\nprint(sum(list(map(a, input().split()))))\n", "input()\r\nstring=input()\r\nl=list(map(int,string.split()))\r\nl.sort()\r\nb=[]\r\nc=[]\r\ni=0\r\nB=0\r\nC=0\r\nwhile (l[i]<=0 ):\r\n\tc.append(l[i])\r\n\ti+=1\r\n\tif i>=len(l):\r\n\t\tbreak\r\n\r\nb=l[i:len(l)]\r\nif len(b)!=0:\r\n\tB=sum(b)\r\nif len(c)!=0:\r\n\tC=sum(c)\r\nprint(B-C)", "n = int(input())\r\na = map(int, input().split())\r\ns1, s2 = 0, 0\r\nfor ai in a:\r\n if ai > 0:\r\n s1 += ai\r\n else:\r\n s2 += ai\r\nprint(s1-s2)", "input()\r\na = map(int, input().split())\r\na = [abs(i) for i in a]\r\nprint(sum(a))\r\n\r\n# HaPpY NoWrUz 1398\r\n# UBCF\r\n# CodeForcesian\r\n# delam tang shode\r\n", "from math import fabs as abs\r\na = int(input())\r\nb = list(map(int,input().split()))\r\nfor i in range(a): b[i]=abs(b[i])\r\nprint(int(sum(b)))", "n = int(input())\nnum = (map(int, input().split()))\nm = sum([abs(i) for i in num])\nprint(m)\n \t\t \t\t\t \t\t \t \t \t \t", "a=int(input())\nb=0\nc=0\ne=input()\nd=e.split(' ')\nfor i in range(a):\n\tif(int(d[i])>=0):\n\t\tb=b+int(d[i])\n\telse:\n\t\tc=c+int(d[i])\nprint(b-c)\n\n", "n=int(input())\nl=list(map(int,input().split()))\ns=0\nfor i in l:\n\ts+=abs(i)\nprint(s)", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nb=0\r\nc=0\r\nfor i in range(len(l)):\r\n if l[i]>=0:\r\n b=b+l[i]\r\n else:\r\n c=c+l[i]\r\nprint(b-c)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=[i for i in l if i>0]\r\nn=[i for i in l if i<0]\r\nprint(sum(p)-sum(n))", "from functools import reduce\r\nnum = int(input())\r\na = [int(a) for a in input().split()]\r\nB = 0\r\nC = 0\r\nfor i in a:\r\n if i >= 0:\r\n B = B + i\r\n else:\r\n C = C + i\r\n\r\nprint(int(B - C))\r\n", "n = int(input())\r\na_n = list(map(int, input().split()))\r\n\r\nc_empty = True\r\nb, c = 0, 0\r\nfor a in a_n:\r\n if a>=0:\r\n b += a\r\n else:\r\n c_empty = False\r\n c += a\r\n'''\r\nif c_empty:\r\n m = min(a_n)\r\n b -= m\r\n c += m\r\n'''\r\nprint(b-c)", "n = input()\nlist1 = input().split(\" \")\nlist1 = [int(list1[z]) for z in range(len(list1))]\nsum1: int = 0\nfor i in range(len(list1)):\n if list1[i] < 0:\n list1[i] = 0 - list1[i]\nfor j in range(0, len(list1)):\n sum1 = sum1 + list1[j]\nprint(sum1)\n \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()))\nb = sum(i for i in l if i > 0)\nc = sum(i for i in l if i < 0)\nprint(b-c)\n\n", "input()\nn = sorted(list(map(int, input().split())))\n\nfrom bisect import bisect\ni = bisect(n, 0)\nprint(sum(n[i:]) - sum(n[:i]))", "n=input()\r\na=list(map(int,input().split()))\r\nz=[]\r\nfor i in a:\r\n\tz.append(abs(i))\r\nprint(sum(z))\r\n", "n = int(input())\r\nb = list(map(int,input().split()))\r\nans = 0\r\nfor e in b:\r\n ans += abs(e)\r\nprint(ans)\r\n \r\n", "\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\nn = get_single_int ()\r\nv1 =get_list ()\r\nsum1 = 0\r\nsum2 = 0\r\nfor i in range (n):\r\n tmp = v1 [i]\r\n if tmp < 0:\r\n sum2 += tmp\r\n else:\r\n sum1 += tmp\r\nprint (abs (sum1 - sum2))\r\n \r\n", "n = int(input())\na = list(map(int,input().split()))\nc = 0\nfor i in range(n):\n c += abs(a[i])\nprint(c)\n", "n=int(input())\r\nprint(sum(list(map(lambda i:abs(int(i)),input().split()))))\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\ncount=0\r\nfor i in ar:\r\n if i>0:\r\n count+=i\r\n else:\r\n count-=i\r\nprint(count) ", "n = int(input())\r\nl = list(map(int,input().split()))\r\np = []\r\nn = []\r\nfor i in l:\r\n\tif i > 0:\r\n\t\tp.append(i)\r\n\telse:\r\n\t\tn.append(i)\r\nprint(sum(p)-sum(n))", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\ns = sum([i for i in a if i < 0])\r\ns2 = sum([i for i in a if i > 0])\r\nprint(s2-s)\r\n", "po=int(input())\r\nn=list(map(int,input().split()))\r\nla=[]\r\nfor item in n:\r\n la.append(abs(item))\r\nprint(sum(la)) \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\nprint(2*sum([x for x in a if x >= 0]) - sum(a))", "a=int(input())\r\ndef k(b,c=0,i=0):\r\n if i<a and b[i]>=0:return k(b,c+b[i],i+1)\r\n elif i<a :return k(b,c-b[i],i+1)\r\n else: print(c)\r\nk(list(map(int,input().split())))", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\npos, neg = 0, 0\r\nfor j in range(n):\r\n if nums[j] > 0:\r\n pos += nums[j]\r\n if nums[j] < 0:\r\n neg += nums[j]\r\nprint(pos - neg)\r\n", "T=int(input())\r\nseq=list(map(int,input().split()))\r\nB=0\r\nC=0\r\nfor i in range(T):\r\n if seq[i]>0:\r\n B+=seq[i]\r\n else:\r\n C+=seq[i]\r\nprint(B-C)\r\n", "n= int(input())\r\nl = list(map(int,input().split())); sum = 0\r\nfor i in range(n):\r\n if l[i]<0:\r\n l[i] = l[i] + (2*(-l[i]))\r\n sum = sum + l[i]\r\nprint(sum)", "n=int(input())\r\na=[0]\r\nb=[0]\r\nc=list(map(int,input().split()))\r\nfor i in c:\r\n if i<0:\r\n b.append(i)\r\n else:\r\n a.append(i)\r\nprint(sum(a)-sum(b))", "n = int(input())\r\na = list(map(abs,map(int,input().split())))\r\n\r\nprint(sum(a))", "n = int(input())\na = list(map(int, input().split()))\nb = list()\nc = list()\nfor i in a:\n if i > 0: b.append(i)\n else: c.append(i)\nprint(sum(b)-sum(c))", "input()\r\n\r\nA= list(map(int, input().split()))\r\nB, C = 0,0 \r\nfor a in A:\r\n if a < 0:\r\n C -= a\r\n else:\r\n B += a\r\nprint(B + C) ", "# import os\r\n\r\nn = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nB = []\r\nc = []\r\n\r\nfor item in a:\r\n if item >=0:\r\n B.append(item)\r\n else:\r\n c.append(item)\r\nprint(sum(B)-sum(c))", "import sys\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = sys.stdin.readline()\r\nprint(sum( map( abs,map(int,sys.stdin.readline().strip().split()) ) ))", "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]>=0:\r\n b.append(l[i])\r\n else:\r\n a.append(l[i])\r\nprint(sum(b)-sum(a))\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nsum=0\r\nsums=0\r\nfor i in range(0,len(a)):\r\n if(a[i]<=0):\r\n sum=sum+a[i]\r\n else:\r\n sums=sums+a[i]\r\nprint(sums-sum)", "# # RED CODER # #\r\nn = int(input())\r\nx = list(map(int, input().split()))[:n]\r\np = 0\r\nn = 0\r\nfor i in x:\r\n if i < 0:\r\n n += i\r\n else:\r\n p += i\r\nprint(p-n)", "def main():\r\n n = int(input())\r\n lst = list(map(int, input().split()))\r\n sm = 0\r\n for i in lst:\r\n sm += abs(i)\r\n print(sm)\r\nif __name__ == '__main__':\r\n t = 1\r\n for i in range(t):\r\n main()\r\n\r\n\"\"\"\r\n60, 61\r\n\"\"\"\r\n\"\"\"\r\n\"\"\"\r\n", "n = int(input())\r\ns1 = 0\r\ns2 = 0\r\ns = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n if(s[i]>=0):\r\n s1+=s[i]\r\n else:\r\n s2+=s[i]\r\nprint(s1-s2)\r\n", "n = int(input())\r\nlst = [*map(int, input().split())]\r\nfor i in range(n):\r\n if lst[i] <= 0:\r\n lst[i] = lst[i] * (-1)\r\nprint(sum(lst))\r\n", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = list(map(int, stdin.readline().split()))\r\nans = 0\r\nfor ele in a:\r\n if ele > 0:\r\n ans += ele\r\n else:\r\n ans -= ele\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nb = [i for i in a if i>=0]\r\nc = [i for i in a if i<0]\r\n\r\nprint(sum(b)-sum(c))", "a = int(input())\r\nS = [int(i) for i in input().split()]\r\nsum1 = 0\r\nfor i in range(a):\r\n if S[i]>=0:\r\n sum1 += S[i]\r\n else:\r\n sum1 -= S[i]\r\nprint(sum1)\r\n", "n = int(input())\r\na_list = list(map(int, input().split()))\r\n\r\n# b_list = []\r\nb_list_sum = 0\r\n# c_list = []\r\nc_list_sum = 0\r\nfor i in range(n):\r\n if a_list[i] >= 0:\r\n # b_list.append(a_list[i])\r\n b_list_sum += a_list[i]\r\n else:\r\n # c_list.append(a_list[i])\r\n c_list_sum += a_list[i]\r\n\r\nprint(b_list_sum - c_list_sum)", "#codeforces_946A\r\ngi = lambda : list(map(int,input().split()))\r\nn, = gi()\r\nprint(sum(list(map(abs,gi()))))", "input()\r\nprint(sum(list(map(abs, list((map(int, input().split())))))))", "n=int(input())\r\nl = list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nfor i in range(0,n):\r\n if l[i]>=0:\r\n b.append(l[i])\r\n else:\r\n c.append(l[i])\r\nprint(sum(b)-sum(c)) ", "x=int(input())\r\nl=list(map(int,input().split()))\r\np=[]\r\nn=[]\r\nfor i in l:\r\n if i>0:\r\n p=p+[i]\r\n elif i<0:\r\n n=n+[i]\r\nprint(sum(p)-sum(n))", "\r\nimport sys, collections, math, bisect, heapq, random, functools,io,os\r\ninput = sys.stdin.readline\r\nout = sys.stdout.flush\r\n\r\n\r\nclass UnionFind:\r\n def __init__(self, x) -> None:\r\n self.uf = [-1] * x\r\n\r\n def find(self, x):\r\n r = x\r\n while self.uf[x] >= 0:\r\n x = self.uf[x]\r\n\r\n while r != x:\r\n self.uf[r], r = x, self.uf[r]\r\n return x\r\n\r\n def union(self, x, y):\r\n ux, uy = self.find(x), self.find(y)\r\n if ux == uy:\r\n return\r\n if self.uf[ux] >= self.uf[uy]:\r\n self.uf[uy] += self.uf[ux]\r\n self.uf[ux] = uy\r\n else:\r\n self.uf[ux] += self.uf[uy]\r\n self.uf[uy] = ux\r\n return\r\n\r\ndef spfa(x,g,n):\r\n dis = [float('inf') for i in range(n)]\r\n dis[x] = 0\r\n state = [False for i in range(n)]\r\n state[x] = True\r\n queue = collections.deque()\r\n queue.append(x)\r\n while queue:\r\n cur = queue.popleft()\r\n state[cur] = False\r\n for next_ in g[cur]:\r\n if dis[next_] > dis[cur] + 1:\r\n dis[next_] = dis[cur] + 1\r\n if state[next_] == False:\r\n state[next_] = True\r\n queue.append(next_)\r\n return dis\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n ans = 0\r\n for i in a:\r\n ans += abs(i)\r\n print(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\r\na = map(int, input().split(' '))\r\nsum = 0\r\nfor x in a:\r\n if x > 0:\r\n sum += x\r\n else:\r\n sum += -x\r\nprint(sum)", "x = int(input())\r\narr = list(map(int,input().split()))\r\npositive = []\r\nnegative = []\r\nfor i in range(len(arr)):\r\n if arr[i] >= 0:\r\n positive.append(arr[i])\r\n else:\r\n negative.append(arr[i])\r\nprint(sum(positive)-sum(negative))", "n = int(input())\r\na = list(map(int, input().split()))\r\nsum = 0\r\nfor el in a:\r\n sum += abs(el)\r\nprint(sum)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nb = 0\r\nc = 0\r\nfor a in A:\r\n if a >= 0:\r\n b += a\r\n else:\r\n c += a\r\nprint(b-c)\r\n", "n = int(input())\r\nx = y = p = int(0)\r\narr = list(map(int, input().split()))\r\nif n == len(arr):\r\n\tp = 1\r\n\tfor j in arr:\r\n\t\tif j <= 0:\r\n\t\t\ty = y + j\r\n\t\telse:\r\n\t\t\tx = x + j\r\nif p == 1:\r\n\tprint(x - y)", "a=int(input())\nb=[]\nsum=0\nsum2=0\nb=input().split(\" \")\nb=[int(i) for i in b]\nfor i in range(a):\n if b[i]<0:\n sum=sum+b[i]\nfor i in range(a):\n sum2=sum2+b[i]\nprint(sum2-2*sum)\n\n\t \t\t \t \t\t\t \t\t \t \t\t\t \t \t\t", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nplus, minus = 0, 0\r\nfor x in a:\r\n if x >= 0:\r\n plus += x\r\n else:\r\n minus -= x\r\nprint(plus + minus)\r\n", "from functools import reduce\r\n\r\nc = input()\r\nprint(reduce(lambda a, b: a+ b, (map(lambda x: abs(int(x)), input().split()))))\r\n", "x = int(input())\r\ny = sorted([int(_) for _ in input().split()])\r\nb , c = 0 , 0\r\nfor i in y:\r\n if i<0:\r\n c+=i\r\n else:\r\n b+=i\r\nprint(b-c)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nnL = []\r\npL = []\r\nfor i in range(n):\r\n\tif l[i] < 0:\r\n\t\tnL.append(l[i])\r\n\telse:\r\n\t\tpL.append(l[i])\r\nprint(sum(pL) - sum(nL))", "n=int(input())\r\na=list(map(int,input().split()))\r\np=0\r\nz=0\r\nfor i in a:\r\n if i>0:\r\n p=p+i\r\n else:\r\n z=z+i\r\nprint(p-z)\r\n ", "input()\na = [int(i) for i in input().split()]\nb = c = 0\nfor i in a:\n if i > 0:\n b += i\n else:\n c += i\nprint(b - c)\n\t\t\t\t\t\t \t \t\t \t \t \t\t\t \t \t\t \t", "n=int(input())\r\nf=0\r\na=list(map(int,input().split())) \r\nl=[]\r\nfor i in range(n):\r\n\tif a[i]<0:\r\n\t\tl.append(a[i])\r\nprint(sum(a)-(2*sum(l)))", "input()\nv = map(int, input().split())\nc = 0\nb = 0\nfor x in v:\n if x < 0:\n c += x\n else:\n b += x\nprint(b - c)\n", "n = input()\ns = list(map(int, input().split()))\nsum_value = 0\nfor i in s:\n sum_value += abs(i)\nprint(sum_value)\n \t\t \t \t\t \t \t\t \t\t\t\t \t\t \t\t \t", "n = int(input().strip())\na = list(map(int, input().rstrip().split()))\nb=[]\nc=[]\nfor i in range(0,n):\n if(a[i]>0):\n b.append(a[i])\n else:\n c.append(a[i])\nprint(sum(b)-sum(c))\n\t\t \t \t\t\t \t\t \t \t\t \t\t\t \t\t", "n, a = int(input()), (int(i) for i in input().split())\nres = 0\nfor i in a:\n res += -i if i < 0 else i\nprint(res)\n", "input()\nnums = [int(x) for x in input().split(\" \", )]\n\nnumpos = [num for num in nums if num > 0]\nnumneg = [num for num in nums if num < 0]\n\nprint(sum(numpos) - sum(numneg))\n\n\t\t\t\t\t\t\t\t\t \t \t\t \t \t\t\t\t\t\t\t\t", "def solve(n):\r\n\r\n test = list(map(int, input().split()))\r\n s = 0\r\n s1 = 0\r\n for x in test:\r\n if x < 0:\r\n s1 += x\r\n else:\r\n s += x\r\n \r\n return s - s1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(solve(n))\r\n", "def asdf(arr,n):\r\n B=0\r\n C=0\r\n for i in range(n):\r\n if(arr[i]>0):\r\n B=B+arr[i]\r\n else:\r\n C=C+arr[i]\r\n print(B-C)\r\nn=int(input())\r\narr=list(map(int,input().strip().split()))[:n]\r\nasdf(arr,n)\r\n \r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nif min(a)<0:\r\n ss = 0\r\n sp = 0\r\n for i in a:\r\n if i<0:\r\n ss = abs(i) + ss\r\n else:\r\n sp = i + sp\r\n print(ss+sp)\r\nelse:\r\n print(sum(a))", "n = int(input())\r\nai = list(map(int,input().split()))\r\nA,B = [],[]\r\nfor i in ai:\r\n if i < 0:\r\n A.append(i)\r\n else:\r\n B.append(i)\r\nprint(sum(B)-sum(A))", "n = int(input())\r\ndat=list(map(int, input().split()))\r\nres = 0\r\nfor x in dat:\r\n res += abs(x)\r\nprint(res)", "import math\r\n# # for _ in range(int(input())):\r\n# # int(input())\r\n# # list(map(int,input().split()))\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nc = 0\r\nb = 0\r\nfor i in arr:\r\n if i<0:\r\n c +=i\r\n else:\r\n b +=i\r\nprint(b-c)", "n=int(input())\r\nA=list(map(int,input().split()))\r\na,b=[0]*n,[0]*n\r\nfor i in range(len(A)):\r\n if A[i]>0: a[i]=A[i]\r\n else: b[i]=A[i]\r\nsum1,sum2=sum(a),sum(b)\r\nprint(sum1-sum2)", "size = int(input())\r\narr = list(map(int,input().split()))\r\npos = 0\r\nneg = 0\r\n \r\nfor num in arr:\r\n if num > 0:\r\n pos += num\r\n else:\r\n neg += num\r\n \r\nprint(pos - neg)", "n =int(input())\r\nval = {'b':0,'c':0}\r\nl=list(map(int,input().split()))\r\n\r\nfor i in l:\r\n if i >= 0:\r\n val['b'] += i\r\n else:\r\n val['c']+=i\r\nprint(val['b']-val['c'])\r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\na=0\r\nfor i in m:\r\n\ta+=abs(i)\r\nprint(a)", "n=int(input())\r\nelements=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nfor i in elements:\r\n if i > 0:\r\n b.append(i)\r\n\r\n else:\r\n c.append(i)\r\nB=0\r\nC=0\r\ntry:\r\n for x in b:\r\n B+=x\r\n for y in c:\r\n C+=y\r\nexcept:\r\n pass\r\nprint(B-C)", "def fun(m):\r\n\tc=[]\r\n\tb=[]\r\n\tfor i in m:\r\n\t\tif i < 0:\r\n\t\t\tc.append(i)\r\n\t\telse:\r\n\t\t\tb.append(i)\r\n\tans = sum(b) - sum(c)\r\n\treturn ans\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nprint(fun(l))", "n = int(input())\r\nL = list(map(int, input().split()))\r\nB = 0\r\nC = 0\r\nfor i in L:\r\n if i < 0:\r\n C += i\r\n else:\r\n B += i\r\nprint(B - C)\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nb,c=0,0\r\nfor i in range(0,n):\r\n if arr[i] <=0:\r\n c+=arr[i]\r\n else:\r\n b+=arr[i]\r\n\r\nprint(b-c)\r\n \r\n", "n = input()\na = list(map(int, input().split()))\ndiff = 0\nfor e in a:\n\tdiff += abs(e)\n\t\nprint(diff)\n", "n = int(input())\r\na = [int(i) for i in input().split(' ')]\r\noutput = 0\r\nfor i in range(n):\r\n if (a[i]>= 0):\r\n output += a[i]\r\n else:\r\n output -= a[i]\r\nprint(output)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=abs(l[i])\r\nprint(s)", "n=int(input())\r\nz=input().strip().split()[:n]\r\nl=list(map(int,z))\r\nl=[abs(x) for x in l]\r\nprint(sum(l))", "# 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\nll.sort()\r\nif ll[0]>=0:\r\n print(sum(ll))\r\nelse:\r\n aa = []\r\n for i in range(len(ll)):\r\n if ll[i]<0:\r\n aa.append(ll[i])\r\n if len(aa)==len(ll):\r\n print(abs(sum(aa)))\r\n else:\r\n print(sum(ll)-sum(aa)-sum(aa))\r\n", "n = int(input())\nline = input()\nnums = list(map(int, line.strip().split()))\n#print(n)\n#print(nums)\nA, B = 0, 0\nfor item in nums:\n if item >= 0:\n A += item\n else:\n B += item\nprint(A - B)\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\nb=0\r\nc=0\r\nfor i in range(n):\r\n if(a[i]>=0):\r\n b+=a[i]\r\n else:\r\n c+=a[i]\r\nprint(b-c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans0=0\r\nans2=0\r\nfor i in range(n):\r\n if a[i]>0:\r\n ans0+=a[i]\r\n else:\r\n ans2+=a[i]\r\nprint(ans0-ans2)\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nc = []\r\nfor x in a:\r\n if x<0:\r\n c.append(x)\r\n else:\r\n b.append(x)\r\nprint(sum(b)-sum(c))", "a = int(input())\r\nD = []\r\nD = input().split()\r\nD = list(map(int,D))\r\n\r\npos = 0\r\nneg = 0\r\nx = 0\r\nfor y in D:\r\n \r\n print\r\n if D[x] > 0:\r\n pos = pos + int(D[x])\r\n \r\n \r\n else:\r\n neg = neg + int(D[x])\r\n x = x+1\r\n \r\n \r\n\r\nmax = pos - neg\r\nprint(max)", "input()\r\nl = list(map(int,input().split()))\r\na = []\r\nb = []\r\nfor i in range(len(l)):\r\n if l[i] >= 0:\r\n a.append(l[i])\r\n else:\r\n b.append(l[i])\r\nprint(sum(a)-sum(b))", "input()\r\nx=input().split()\r\ny=z=0\r\nfor i in x:\r\n if int(i)<0:\r\n y+=int(i)\r\n else:\r\n z+=int(i)\r\nprint(int(z)-int(y))", "import sys\r\nfrom math import *\r\nfrom fractions import gcd\r\nreadints=lambda:map(int, input().strip('\\n').split())\r\n\r\nn = int(input())\r\na = list(readints())\r\n\r\nans = 0\r\nfor x in a:\r\n if x >= 0:\r\n ans += x\r\n else:\r\n ans -= x\r\n\r\n\r\nprint(ans)\r\n", "#正数放集合B，负数放集合C\nn=int(input())\ns=list(map(int,input().split()))\nm=0\nw=0\nfor k in s:\n if k>0:\n m=m+k\n if k<0:\n w=k+w\nc=m-w\nprint(c)\n \t\t \t \t\t\t \t\t\t \t \t\t \t\t \t \t", "n = int(input())\r\nls = []\r\ns = 0\r\nfor i in input().split():\r\n ls.append(int(i))\r\nfor i in range(ls.__len__()):\r\n if ls[i] < 0:\r\n ls[i] *= -1\r\n s += ls[i]\r\nprint(s)\r\n", "def main():\n\tn = int(input())\n\tx = list(map(int,input().split()))\n\ty =[0,]\n\tfor i in range(n):\n\t\tif x[i] <0:\n\t\t\ty.append(x[i])\n\t\t\tx[i] =0\n\tprint(sum(x) -sum(y))\n\nmain()\n", "import sys\r\ninput = sys.stdin.readline\r\nins = lambda: input().rstrip()\r\nini = lambda: int(input().rstrip())\r\ninm = lambda: map(int, input().rstrip().split())\r\ninl = lambda: list(map(int, input().split()))\r\nout = lambda x, s='\\n': print(s.join(map(str, x)))\r\n\r\nn = ini()\r\na = inl()\r\nfirst = 0\r\nsecond = 0\r\nfor i in a:\r\n if i > 0:\r\n first += i\r\n else:\r\n second += i\r\nprint(first - second)", "n = int(input())\r\na = list(input().split())\r\nA = [int(x) for x in a]\r\nb = []\r\nc = []\r\nfor i in A:\r\n if i < 0:\r\n c.append(i)\r\n elif i >= 0:\r\n b.append(i)\r\nB = sum(b)\r\nC = sum(c)\r\nprint(B - C)\r\n", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nres = 0\r\n\r\nfor i in a:\r\n res += abs(i)\r\nprint(res)", "def code1(n,a):\r\n s=0\r\n for i in a:\r\n if(i<0):\r\n s+=i\r\n return sum(a)-2*s\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nprint(code1(n,a))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx,y=0,0\r\nfor i in l:\r\n if(i<0):\r\n x=x+i\r\n else:\r\n y=y+i\r\nprint(y-x)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in a:\r\n\tif i<0:\r\n\t\tc.append(i)\r\nprint(sum(a)-2*sum(c))\r\n", "n = input()\r\nl = [abs(int(x)) for x in input().split()]\r\nprint(sum(l))", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nc = []\r\nfor i in a:\r\n if(i>=0):\r\n b.append(i)\r\n elif(i<0):\r\n c.append(i)\r\nif(len(b)==0):\r\n b.append(0)\r\nelif(len(c)==0):\r\n c.append(0)\r\nprint(sum(b)-sum(c))\r\n \r\n", "n1 = int(input())\r\nx=input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\nlist_positive = []\r\nlist_negative = []\r\n\r\nfor i in list1:\r\n if i >= 0:\r\n list_positive.append(i)\r\n else:\r\n list_negative.append(i)\r\n \r\nprint(sum(list_positive) - sum(list_negative))\r\n", "input();print(sum(abs(x) for x in map(int,input().split())))", "# https://codeforces.com/problemset/problem/946/A\r\n\r\ndef partition(array):\r\n\r\n max_b_minus_c = 0\r\n\r\n for num in array:\r\n max_b_minus_c += abs(num)\r\n\r\n return max_b_minus_c\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n n = int(input())\r\n array = list(map(int, input().split()))\r\n print(partition(array))", "numberofnumbers = input()\r\nnumbers = map(int, input().split())\r\na = 0\r\nb = 0\r\nfor i in numbers:\r\n if i >= 0:\r\n a += i\r\n else:\r\n b += i\r\nprint(a-b)", "n = int(input())\r\nprint(sum(list(map(abs, map(int, input().split())))))\r\n", "input()\r\na = list(map(int, input().split()))\r\nprint(sum(list(i for i in a if i >= 0)) - sum(list(i for i in a if i < 0)))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nss=0\r\nfor i in a:\r\n if i<0:\r\n ss+=i\r\n else:\r\n s+=i\r\nprint(abs(s-ss))", "#In the name of GOD!\nn = int(input())\na = list(map(int, input().split()))\nans = 0\nfor i in a:\n\tans += abs(i)\nprint(ans)\n", "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<0):\r\n c2+=i\r\n else:\r\n c1+=i\r\nprint(c1-c2)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nfor i in l:\r\n if i>=0:\r\n x+=i\r\n else:\r\n y+=i\r\nres=x-y\r\nprint(res)\r\n ", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = 0\r\nc = 0\r\nfor i in a:\r\n\tif i > 0:\r\n\t\tb += i\r\n\telse:\r\n\t\tc += i\r\n \r\nprint(b - c)", "n=int(input())\r\narray1=list(map(int,input().split(' ')))\r\nsum1=0\r\nsum2=0\r\nfor i in range(n):\r\n if array1[i]<0:\r\n sum1=sum1+array1[i]\r\n else:\r\n sum2=sum2+array1[i]\r\nresult=abs(sum1-sum2)\r\nprint(result)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n c+=abs(arr[i])\r\nprint(c)\r\n", "elements=int(input())\r\nsequence=[int(x) for x in input().split()]\r\nc=0\r\nb=0\r\nfor x in range(elements):\r\n\tif sequence[x]>=0:\r\n\t\tb=b+sequence[x]\r\n\telse:\r\n\t\tc=c+sequence[x]\r\ntotal=b-c\r\nprint(total)", "# https://codeforces.com/problemset/problem/946/A\r\n\r\n_ = input()\r\ntotal = 0\r\nfor i in map(int, input().split()):\r\n if i > 0:\r\n total += i\r\n else:\r\n total -= i\r\n\r\nprint(total)\r\n", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\nB,C=0,0\r\nfor i in range(n):\r\n\tif s[i]>0:\r\n\t\tB+=s[i]\r\n\telse:\r\n\t\tC+=s[i]\r\n\r\nprint(B-(C))", "n=int(input())\na=[]\nb=[]\nnum=[]\nstr_in=input()\nnum = [int(n) for n in str_in.split()]\nfor x in num:\n if x>=0:a.append(x)\n elif x < 0:b.append(x)\ntotal_a=0\ntotal_b=0\nfor x in a:\n total_a=x+total_a\nfor x in b:\n total_b=x+total_b\nprint(total_a-total_b)", "x=int(input())\r\ny=[int(n) for n in input().split()]\r\nm=k=0\r\nfor n in range(x):\r\n\tif y[n]>=0:\r\n\t#\tprint(y[n])\r\n\t\tm+=y[n]\r\n\telse:\r\n\t\tk+=y[n]\r\n\t#\tprint(y[n])\r\n\t\t\r\nprint(m-k)", "n=int(input())\r\nls=list(map(int,input().split()))\r\nneg=0\r\npos=0\r\nfor i in ls:\r\n if(i<0):\r\n neg+=i\r\n else:\r\n pos+=i\r\nprint(pos-neg)", "a=int(input())\r\nprint(sum([abs(i) for i in list(map(int,input().split()))]))\r\n#author:SK__Shanto__㋛ \r\n#code__define__your__smartness", "n=int(input())\r\nli=list(map(int,input().split()))\r\nb,c=[],[]\r\nfor i in li:\r\n if(i>0):\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nprint(sum(b)-sum(c))\r\n", "input()\r\nlist1 = list(map(abs,list(map(int,input().split()))))\r\nprint(sum(list1))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nb_sum = c_sum = 0\r\nfor i in l:\r\n if i <= 0:\r\n c_sum += i\r\n else:\r\n b_sum += i\r\nprint(b_sum-c_sum)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nprint(sum(abs(x) for x in lst))", "elements = int(input())\r\nsequence = [int(x) for x in input().split()]\r\nnegative, positive = 0, 0\r\nfor number in sequence:\r\n if number >= 0:\r\n positive += number\r\n else:\r\n negative += number*(-1)\r\nprint(positive+negative)", "t = int(input())\r\na = list(map(int,input().split()))\r\nsum = 0\r\nfor i in a:sum+=abs(i)\r\nprint(sum)", "l=int(input())\r\n\r\n\r\nsequence=list(map(int,(input().split())))\r\ntotal=0\r\nfor seq in sequence:\r\n if seq<0:\r\n total-=seq\r\n else:\r\n total+=seq\r\nprint(total)\r\n ", "input()\r\nx=sum(map(abs,map(int,input().split())));\r\nprint(x)", "_ = input()\nl = list(map(int, input().split()))\nsum = 0\nfor i in l:\n sum += abs(i)\nprint(sum)\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\nc=0\r\nb=0\r\na.sort()\r\nfor i in range(n):\r\n\tif(a[i]<=0):\r\n\t\tc=c+a[i]\r\n\telse:\r\n\t\tb=b+a[i]\r\nprint(b-c) ", "n = eval(input())\r\na = list(map(int,input().split()))\r\nc = [0]*n\r\nb = [0]*n\r\ni = 0\r\nwhile i<len(a):\r\n if a[i]<0:\r\n c[i]=c[i]+a[i]\r\n i+=1\r\nsum1=sum(c)\r\ni=0\r\nwhile i <len(a):\r\n if a[i]>0:\r\n b[i]=b[i]+a[i]\r\n i+=1\r\nsum2=sum(b)\r\nprint(sum2-sum1)\r\n", "n=int(input())\r\nb=0\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if(i>=0):\r\n b+=i\r\n else:\r\n c+=i\r\nprint(b-c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nb = []\r\nc = []\r\nfor i in a:\r\n if i < 0:\r\n c.append(i)\r\n else:\r\n b.append(i)\r\nprint(sum(b) - sum(c))", "input()\r\nresult =sum(list(map(abs,(list(map(int,input().split()))))))\r\nprint(result)\r\n\r\n\r\n", "a=int(input())\r\nc=[]\r\nk=0\r\nl=[]\r\np=0\r\nb=map(int,input().split())\r\nfor i in b:\r\n if i <0:\r\n c.append(i)\r\n \r\n else:\r\n l.append(i)\r\nfor i in range(len(c)):\r\n k+=c[i]\r\nfor i in range(len(l)):\r\n p+=l[i]\r\nprint(p-k)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=int(input())\nlis=(input().split())\nlis=[int(i) for i in lis]\nb=0\nc=0\nfor i in lis:\n if i>=0:\n b+=i\n else:\n c+=i\nsum=b-c\nprint(sum)\n\n\n \t\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()))\nb, c = [], []\na.sort(reverse=True)\nfor i in range(n):\n if a[i] < 0: c.append(a[i])\n else: b.append(a[i])\nprint(sum(b)-sum(c))", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor x in a:\r\n ans += abs(x)\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = 0\r\ns = 0\r\nfor i in range(len(l)):\r\n if l[i] < 0:\r\n s += l[i]\r\n else:\r\n a += l[i]\r\nprint(a - s)", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = int(0)\r\nb = int(0)\r\nfor i in range(n):\r\n if l[i] >= 0:\r\n a += l[i]\r\n else:\r\n b += l[i]\r\nprint(a + abs(b))\r\n", "n=int(input())\na=list(map(int,input().split()))\nd=0\nfor i in range(n):\n\tif a[i]>=0:\n\t\td +=a[i]\n\telse:\n\t\td +=-a[i]\nprint(d)", "n = int(input())\r\nprint(sum(map(lambda s: abs(int(s)), input().split())))", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = 0\r\nfor i in range(len(a)):\r\n if a[i] >= 0: k += a[i]\r\n else: k -= a[i]\r\nprint(k)", "n=int(input())\r\na=list(map(int,input().split()))\r\na=[abs(int(i)) for i in a]\r\nprint(sum(a))\r\n", "input()\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nb, c = [], []\r\nfor i in range(len(a)):\r\n if(a[i] < 0):\r\n b.append(a[i])\r\n else:\r\n c.append(a[i])\r\nprint(abs(sum(c) - sum(b))) ", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd=[0]\r\nz=[0]\r\nfor i in l:\r\n if i <0:\r\n d.append(i)\r\n else:\r\n z.append(i)\r\nprint(sum(z)-sum(d))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na,b=0,0\r\nfor i in l:\r\n if i>=0:\r\n a=a+i\r\n else:\r\n b=b+i\r\nprint(a-b)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nb=[]\r\nc=[]\r\nsum1=0\r\nsum2=0\r\nfor i in a:\r\n if(i>=0):\r\n sum1+=i\r\n else:\r\n sum2+=i\r\n\r\nprint(sum1-sum2)", "def solve(line,out):\r\n\tgi = lambda : list(map(int,line().split()))\r\n\tline()\r\n\tout(str(sum(list(map(abs,gi())))))\r\n\r\nsolve(input,print)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nb=0\r\nc=0\r\nfor i in range(n):\r\n\tif l[i]>0:\r\n\t\tb+=l[i]\r\n\telse:\r\n\t\tc+=l[i]\r\nprint(b-c)\t\t\t", "n = int(input())\r\n\r\nstring = input().split(' ')\r\n\r\ntotal = 0\r\n\r\nfor num in string:\r\n total += abs(int(num))\r\n\r\nprint(total)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 18 20:32:59 2020\r\n\r\n@author: PREET MODH\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in a:\r\n sum=sum +abs(i)\r\nprint(sum)", "import sys,math\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split()))\nM=lambda : map(int,input().split())\nn=int(input())\nl=L()\nb=0\nc=0\nfor i in l:\n if(i>=0):\n b+=i\n else:\n c+=i\nprint(b-c)\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\np=int(0)\r\nfor x in b:\r\n p=p+abs(x)\r\nprint(p)", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\npos = sum(filter(lambda x : x > 0, s))\r\nneg = sum(filter(lambda x : x < 0, s))\r\n\r\nprint(pos - neg)", "def main():\n input()\n\n seq = input().split()\n seq = map(int, seq)\n C = 0\n B = 0\n for i in seq:\n if i < 0:\n C += i\n else:\n B += i\n print(B-C)\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\nl=list(map(int,input().split()))\r\nc=[]\r\nb=[]\r\nfor i in l:\r\n\tif i < 0:\r\n\t\tc.append(i)\r\n\telse:\r\n\t\tb.append(i)\r\nprint(sum(b) - sum(c))", "n = int(input())\ns = [int(i) for i in input().split()]\nprint(sum([abs(i) for i in s]))\n\t \t \t \t\t\t\t\t \t \t\t\t\t\t \t\t", "n=int(input())\r\nv=[]\r\nq=[]\r\nl=list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n\tif abs(l[i])!=l[i]:\r\n\t\tq.append(l[i])\r\n\telse:\r\n\t\tv.append(l[i])\r\nprint(sum(v)-sum(q))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nfor i in l:\r\n if i<0:\r\n c.append(i)\r\n else:\r\n b.append(i)\r\nprint(sum(b)-sum(c))", "k = int(input())\r\nans = 0\r\np = [int(i) for i in input().split()]\r\n\r\nfor j in p:\r\n ans += abs(j)\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nfirst,second=[],[]\r\ninteger=list(map(int,input().split()))\r\nfor i in integer:\r\n if i >=0:\r\n first.append(i)\r\n else:\r\n second.append(i)\r\nk=sum(first)\r\nq=sum(second)\r\nprint(k-q)", "total = int(input())\r\nnumbers = list(map(int, input().split()))\r\ntotals = 0\r\nfor i in numbers:\r\n totals += abs(i)\r\nprint(totals)\r\n \r\n", "n = input()\r\nnumb = [int(i) for i in input().split()]\r\nB, C, = 0, 0\r\nfor i in numb:\r\n if i > 0:\r\n B += i\r\n else:\r\n C += i\r\nprint(B - C)", "n=int(input())\r\ns1=0\r\ns2=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if l[i]>=0:\r\n s1+=l[i]\r\n else:\r\n s2+=l[i]\r\nprint(s1-s2)", "n=int(input())\r\nls=list(map(int,input().split()))\r\nls.sort(reverse=True)\r\nls.insert(0,0)\r\na=0\r\nb=0\r\nfor i in range(n+1):\r\n if ls[i]>=0:\r\n a+=ls[i]\r\n else:\r\n b=sum(ls[i:])\r\n break\r\nprint(a-b)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nneg,pos=0,0\r\nfor i in l:\r\n if i<0:\r\n neg+=i\r\n else:\r\n pos+=i\r\nprint(pos-neg)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nsum=0\r\nfor x in l:\r\n if x>=0:\r\n sum=sum+x\r\n else:\r\n sum=sum-x\r\n\r\nprint(sum)", "a=int(input())\r\nf,l=0,sorted(list(map(int,input().split())))\r\nfor x in range(a):\r\n\tif l[x]>=0:f=1;break\r\nif f==1:print(sum(l[x:])-sum(l[:x]))\r\nelse:print(abs(sum(l)))", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nq=[]\r\nm=[]\r\nfor i in range(n):\r\n if l[i]<0:\r\n m.append(l[i])\r\n else:\r\n q.append(l[i])\r\nprint(sum(q)-sum(m))\r\n", "n,s=int(input()),0\r\nA=list(map(int,input().split()))\r\nfor i in range(n):\r\n if A[i]>0:\r\n s+=A[i]\r\n else:\r\n s-=A[i]\r\nprint(s)", "n = int(input())\nlst = list(map(int, input().split()))\nsumpos, sumneg= 0,0\nfor i in range(n):\n if lst[i]>=0:\n sumpos+=lst[i]\n else:\n sumneg += lst[i]\nprint(sumpos-sumneg)\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\nc=map(int,input().split()); v=sum(map(abs, c));print(v)", "input()\r\nseq = map(lambda x: abs(int(x)), input().split())\r\nprint(sum(seq))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nb = 0\r\nc = 0\r\nfor i in l:\r\n if i >= 0:\r\n b += i\r\n else:\r\n c -= i\r\nprint(b + c)", "n=int(input())\r\nx=input()\r\nxx=x.split( )\r\nB=[]\r\nC=[]\r\nfor i in xx:\r\n if int(i)<0:\r\n C.append(int(i))\r\n else:\r\n B.append(int(i))\r\nb=0\r\nc=0\r\nfor i in B:\r\n b+=i\r\nfor i in C:\r\n c+=i\r\nprint(b-c)\r\n", "n = int(input())\r\ns1 = 0\r\ns2 = 0\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n if a[i] > 0:\r\n s1 += a[i]\r\n else:\r\n s2 += a[i]\r\nprint(s1 + abs(s2))\r\n \r\n \r\n ", "n = int(input())\r\nl = list(map(int, input().split()))\r\nsp = 0\r\nsn = 0\r\nfor e in l:\r\n if(e>=0):\r\n sp+=e\r\n else:\r\n sn+=e\r\nprint(sp-sn)", "n = input()\ns = map(int,input().split())\ns = map(abs,s)\nprint(sum(s))\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nc=[]\r\nfor j in a:\r\n if j>0:\r\n b.append(j)\r\n else :\r\n c.append(j)\r\nprint(sum(b)-sum(c))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nk = []\r\np = []\r\nfor i in range(n):\r\n\tif l[i]<0:\r\n\t\tk.append(l[i])\t\r\nfor j in range(n):\r\n\tif l[j]>=0:\r\n\t\tp.append(l[j])\r\nsum1 = sum(k)\r\nsum2 = sum(p)\r\nprint(sum2-sum1)\t\t\t\t\t\t\t\r\n", "n = int(input())\r\nnList = list(map(int, input().split()))\r\nnList = sorted(nList, reverse=True)\r\nB = []\r\nC = []\r\nfor i in nList:\r\n if i >= 0:\r\n B.append(i)\r\n else:\r\n C.append(i)\r\nprint(sum(B) - sum(C))", "n=int(input())\r\nt=list(map(int,input().split()))\r\np,e=0,0\r\nfor i in range(len(t)):\r\n if t[i]<0:\r\n p+=t[i]\r\n else:\r\n e+=t[i]\r\nprint(e-p)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nval=sum([x for x in l if x>0])\r\nneg=sum([x for x in l if x<0])\r\nprint(val-neg)\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\npos = 0\nneg = 0\n\nfor i in range(n):\n if(arr[i] >= 0):\n pos += arr[i]\n else:\n neg += arr[i]\n\nprint(pos-neg)\n \t \t\t\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(map(int, input().split()))\r\nb = []\r\nc = []\r\nfor i in arr:\r\n if i < 0:\r\n c.append(i)\r\n else:\r\n b.append(i)\r\nprint(sum(b) - sum(c))\r\n", "n = input()\r\na = list(map(int, input().split(' ')))\r\nprint(sum([i for i in a if i > 0]) - sum([i for i in a if i < 0]))", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\ns =0\r\nfor i in a :\r\n\tif i<0:s+=i\r\n\telse:break\r\nprint(sum(a)+(-2*s))", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\nsuma = 0\r\nfor i in range(n):\r\n suma += abs(a[i])\r\nprint(suma)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n\r\nif(l[0]>=0):\r\n\tprint(sum(l))\r\nelse:\r\n\tb = c = 0\r\n\tfor i in l:\r\n\t\tif(i<=0):\r\n\t\t\tb+=i\r\n\t\telse:\r\n\t\t\tc+=i\r\n\tprint(c-b)", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in map(int,input().split()):\r\n if i >-1:\r\n a.append(i)\r\n else:\r\n b.append(i)\r\nprint(sum(a)-sum(b))", "n = int(input())\r\nsu = 0\r\nl = list(map(int, input().split()))\r\n\r\nfor i in l:\r\n su += abs(i)\r\nprint(su)", "su=0\nn=int(input())\nl=list(map(int,input().split()))\nfor i in range(n):\n if l[i]<0:\n l[i]=l[i]*-1\n su=su+l[i]\nprint(su)\n\n \t \t \t\t \t\t \t\t\t \t \t\t \t", "n=int(input())\r\nh=map(int, input().split())\r\na=[int(i) for i in h]\r\nb=[]\r\nc=[]\r\ni=0\r\nwhile(i<len(a)):\r\n if(a[i]>=0):\r\n b.append(a[i])\r\n else:\r\n c.append(a[i])\r\n i=i+1\r\nx=0\r\ny=0\r\nfor j in range(0,len(b)):\r\n x=x+b[j]\r\n j=j+1\r\nfor k in range(0,len(c)):\r\n y=y+c[k]\r\n k=k+1\r\nprint(x-y)", "no=input()\n\na=input().split(' ')\na=[int(x) for x in a]\nb=[]\nc=[]\n\nfor num in a:\n if num>=0:\n b.append(num)\n else:\n c.append(num)\n\nprint(sum(b)-sum(c))\n\n \t\t \t \t\t\t \t\t \t \t\t \t", "n=int(input())\na=[]\nb=[]\nnum=[]\nstrr=input()\nnum = [int(n) for n in strr.split()]\nfor i in num:\n if i>=0:\n a.append(i)\n elif i < 0:\n b.append(i)\nsuma=0\nsumb=0\nfor i in a:\n suma=i+suma\nfor i in b:\n sumb=i+sumb\nprint(suma-sumb)", "n = int(input())\r\nl = sorted([*map(int,input().split())],reverse = True)\r\ns = sum(l); i = 0; b = 0\r\nwhile i < n:\r\n if(l[i] > 0): b += l[i]; i += 1\r\n else: break\r\nprint(2*b - s)", "# import sys\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\na, b = [0], [0]\r\nfor i in range(len(l)):\r\n if l[i] < 0:\r\n b.append(l[i])\r\n else:\r\n a.append(l[i])\r\n\r\nprint(sum(a)-sum(b))", "def answer():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n b = [x for x in a if x<0]\r\n c = [x for x in a if x>0]\r\n print(abs(sum(b))+sum(c))\r\nanswer()", "#print(\" \".join(map(str, r)))\r\n\r\n\r\n\r\nn = int(input())\r\na = list(map(int, (input().split())))\r\n\r\nc=0\r\nc1=0\r\nfor i in range(len(a)):\r\n if a[i] > 0:\r\n c+=a[i]\r\n elif a[i] < 0:\r\n c1+=abs(a[i])\r\n\r\nprint(c + c1)\r\n\r\n\r\n", "#for _ in range(int(input())):\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ns=0\r\ns1=sum(a)\r\nfor i in range(n):\r\n if(a[i]>=0):\r\n k=i\r\n break\r\n s+=a[i]\r\nprint(abs(s1-2*s))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nL1=[]\r\nL2=[]\r\nfor i in lst:\r\n\tif i<0:\r\n\t\tL1.append(i)\r\n\telse:\r\n\t\tL2.append(i)\r\nprint(sum(L2)-sum(L1))", "def solve(n, a):\n sump = sum([i for i in a if i > 0]) \n sumn = sum([i for i in a if i <= 0])\n return sump - sumn\n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n print(solve(n, a))\n\n\nmain()\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\ns=0\r\nfor i in range(n):\r\n\ts+=abs(a[i])\r\nprint(s)", "# LUOGU_RID: 101738738\nn, *a = map(int, open(0).read().split())\r\nprint(sum(abs(x) for x in a))", "def solve():\r\n sm = 0\r\n for i in range(n):\r\n if a[i]<0:\r\n a[i] = -a[i]\r\n sm+=a[i]\r\n print(sm)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n solve()", "aSeqLen = input()\r\naSeq = input()\r\n\r\na = aSeq.split(\" \")\r\n\r\nsum = 0\r\nfor i in a:\r\n if int(i) > 0:\r\n sum += int(i)\r\n else:\r\n sum += abs(int(i))\r\n\r\nprint(sum)", "n = int(input())\nnum = list(map(int, input().split()))\nzhen = []\nfu = []\nfu = list(fu)\nzhen = list(zhen)\nfor x in range(n):\n if num[x] < 0:\n fu.append(num[x])\n else:\n zhen.append(num[x])\nf = sum(zhen)\ng = sum(fu)\nk = f - g\nprint(k)\n \t\t \t \t\t \t\t\t \t\t\t \t\t\t", "n = int(input())\r\nNum = list(map(int,input().split()))\r\nans = 0\r\nfor potato in range(0, n):\r\n ans = ans + abs(Num[potato])\r\n# Num[potato] takes the value of the i'th index in Num list\r\nprint (ans)", "a=int(input())\r\nb=input().split()\r\nsum=0\r\nfor i in range(a):\r\n if int(b[i])>=0:\r\n sum+=int(b[i])\r\n else:\r\n sum-=int(b[i])\r\nprint(sum) ", "n = int(input())\na = list(map(int, input().split()))\n\nb = sum(filter(lambda x: x > 0, a))\nc = sum(filter(lambda x: x < 0, a))\n\nprint(b - c)\n", "input()\r\na = [int(i) for i in input().split()]\r\nb = []\r\nc = []\r\nfor i in a:\r\n if i >= 0:\r\n b.append(i)\r\n elif i < 0:\r\n c.append(i)\r\nprint(sum(b) - sum(c))", "n = int(input())\ns = list(map(int, input().split()))\nprint(sum([abs(i) for i in s]))\n\t\t\t\t\t \t\t \t\t \t\t\t\t\t \t\t \t \t", "input()\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(len(a)):\r\n s += abs(a[i])\r\nprint(s)", "n = int(input())\nvetor = list(map(int, input().split()))\nvetor_positivo = list(filter(lambda x: x >= 0, vetor))\nvetor_negativo = list(filter(lambda x: x < 0, vetor))\n\nsoma_positiva = sum(vetor_positivo)\nsoma_negativa = sum(vetor_negativo)\n\nprint(soma_positiva - soma_negativa)\n\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=len(a)\r\nb=0\r\nc=0\r\nfor i in range(k):\r\n if a[i]>=0:\r\n b+=a[i]\r\n else:\r\n c+=a[i]\r\nprint(b-c)", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in k:\r\n c += abs(i)\r\nprint(c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nl = []\r\nfor i in a:\r\n if i<0:\r\n l.append(i)\r\n else:\r\n continue\r\nprint(sum(a)-2*sum(l))", "x=int(input())\r\nb=0\r\nc=0\r\ny=list(map(str,input().split()[:x]))\r\nfor n in range(len(y)):\r\n if int(y[n])>=0:\r\n b=b+int(y[n])\r\n elif int(y[n])<0:\r\n c=c+int(y[n])\r\nprint(b-c) \r\n ", "\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n sum_positive = 0\r\n sum_negative = 0\r\n for i in a:\r\n if i > 0:\r\n sum_positive += i\r\n else:\r\n sum_negative += i\r\n return sum_positive - sum_negative\r\n\r\n \r\n\r\n\r\n\r\nprint(main_function())", "\r\ntot = 0\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nfor i in a:\r\n\ttot += abs(i)\r\nprint(tot)", "def particion(lista):\r\n lista.sort()\r\n suma_1,suma_2=0,0\r\n for n in lista:\r\n if n>=0:\r\n suma_1+=n\r\n else:\r\n suma_2+=n\r\n return suma_1-suma_2\r\ndef main():\r\n number=int(input())\r\n lista=[int(x) for x in input().split()]\r\n print(particion(lista))\r\nmain()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=[]\r\nd=[]\r\nm=min(l)\r\nif(m>=0):\r\n print(sum(l))\r\nelse:\r\n for i in range(n):\r\n if(l[i]<0):\r\n c.append(l[i])\r\n else:\r\n d.append(l[i])\r\n print(sum(d)-sum(c)) ", "n = int(input())\na = list(map(int, input().split()))\nsum1 = 0\nfor i in range(n):\n a[i] = abs(a[i])\n sum1 = sum1 + a[i]\nprint(sum1)\n \t\t\t \t\t\t\t \t\t\t \t \t\t\t\t\t \t", "if __name__ == '__main__':\n # n, a, b = map(int, input().split())\n n = int(input())\n arrs = map(int, input().split())\n b = []\n c = []\n for num in arrs:\n if num >= 0:\n b.append(num)\n else:\n c.append(num)\n print(sum(b) - sum(c))\n\t\t\t \t \t\t \t\t \t\t \t\t \t\t\t \t", "n = int(input())\r\na = []\r\n# for i in range(n):\r\n# a.append(int(input()))\r\na = [int(x) for x in input().split()]\r\nB = 0\r\nC = 0\r\nfor e in a:\r\n if e > 0:\r\n B += e\r\n else:\r\n C += e\r\nprint(B-C)", "n=input()\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n c+=abs(i)\r\n \r\nprint(c)", "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\nif(l[0]>=0):\r\n print(sum(l))\r\nelse:\r\n s1,s2=0,0\r\n for i in range(n):\r\n if(l[i]<0):\r\n s1+=l[i]\r\n else:\r\n s2+=l[i]\r\n print(s2-s1)", "input();l = [*map(int,input().split())];b = sum(filter(lambda x: x>0,l));print(b*2-sum(l))", "n=int(input())\na=list(map(int,input().split()))\nsum=0\nfor i in a:\n sum+=abs(i)\nprint(sum)\n \t \t\t\t\t\t \t \t\t \t\t\t \t\t \t \t\t", "n = int(input())\r\nnb = list(map(int, input().split()))\r\n\r\nprint(sum([i for i in nb if i > 0]) - sum([i for i in nb if i < 0]))", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n B = []\r\n C = []\r\n for a in A:\r\n if a >= 0:\r\n B.append(a)\r\n else:\r\n C.append(a)\r\n print(sum(B) - sum(C))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\na = list(map(int, input().split()))\nans = sum([abs(x) for x in a])\nprint(ans)", "n = int(input())\r\nl = sorted([*map(int,input().split())])\r\ns = sum(l)\r\nb =sum([*(x for x in l if x >=0)])\r\nprint(2*b - s)", "n = int(input())\r\narr1 = input()\r\narr2 = arr1.split()\r\narr = []\r\nfor i in arr2:\r\n arr.append(int(i))\r\n\r\nleft = []\r\nright = []\r\n\r\nfor i in arr:\r\n if i <= 0:\r\n right.append(i)\r\n else:\r\n left.append(i)\r\n \r\nk1 = sum(left)\r\nk2 = sum(right)\r\n\r\ndiff = k1 - k2 \r\nprint(diff)", "orz = int(input())\r\na = [abs(i) for i in list(map(int,input().split()))]\r\nprint(sum(a))\r\n", "def main():\n input()\n print(sum(map(abs,map(int, input().split()))))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\nans=0\r\nans1=0\r\nfor i in range(n):\r\n if (a[i]>0):\r\n ans+=a[i]\r\n if(a[i]<0):\r\n ans1+=a[i]\r\nprint(ans-ans1)", "input();print(sum([abs(i) for i in list(map(int,input().split()))]))", "input();a=list(map(int,input().split()));l=0\r\nfor i in range(len(a)):\r\n if a[i]>=0:l=l+a[i]\r\n else: l=l-a[i]\r\nprint(l)", "'''\r\n##======================================================================================================================================##\r\n ## _____ _ _ _ _____ _ _ _ _ _____ _____ ____ ___ ____ ___ ##\r\n ## | / \\ | \\ / | | | | |\\ | | | | | | | | \\ | | | ##\r\n ## |_____ / \\ | \\/ | |_____ | | | \\ | | __ --- |_____ |____| | | | |___ |___| ##\r\n ## | / \\ | | | | | | \\ | | | | | | | | | | \\ ##\r\n ## _____| / \\ | | _____| \\ __ / | \\| |_____| _____| | | |___/ |____ | \\ ##\r\n##======================================================================================================================================##\r\n------------------------------Samsung_Spider------------------------------\r\n'''\r\nn = int(input()); k = 0; h = 0\r\na = list(map(int, input().split()))\r\nfor t in a:\r\n if t < 0:\r\n h += abs(t)\r\n else:\r\n k += t\r\nprint(k + h)", "a=int(input())\r\nb=[int (i) for i in input ().split ()] \r\nc=0\r\nfor i in range(len(b)):\r\n c+=abs(b[i])\r\nprint(c)", "input();*r,=map(int,input().split());print(2*sum(i for i in r if i>0)-sum(r))", "\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nb = []\r\nc = []\r\n\r\nfor i in l :\r\n if i >=0:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\n\r\nprint(sum(b)-sum(c))\r\n\r\n\r\n\r\n\r\n", "\n# coding: utf-8\n\n# In[7]:\n\n\nn, a = int(input()), input().split()\n\nsum = 0\n\nfor i in range(n):\n sum += abs(int(a[i]))\n \nprint(sum)\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncnt=0\r\nfor x in l:\r\n cnt=cnt+abs(x)\r\nprint(cnt)", "n=int(input())\r\ns=0\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n s+=abs(a[i])\r\nprint(s)", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=0\r\nc=0\r\nfor i in a:\r\n if i>=0:\r\n b=b+i\r\n else:\r\n c=c+i\r\nprint (b-c)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nans=0 \r\n\r\nfor i in a:\r\n if i>=0:\r\n ans+=i \r\n else:\r\n ans+=-i \r\n \r\nprint(ans)\r\n \r\n\r\n \r\n \r\n \r\n ", "n=int(input())\r\nli=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nli.sort()\r\nfor i in li:\r\n\tif i<=0:\r\n\t\ta.append(i)\r\n\telse:\r\n\t\tb.append(i)\r\nprint(sum(b)-sum(a))", "n = int(input())\narr = input().split()\nb=[]\nc=[]\nfor i in arr:\n if(int(i)>=0):\n b.append(int(i))\n else:\n c.append(int(i))\nprint(sum(b)-sum(c))\n \t\t \t \t \t\t\t \t\t \t", "#3\r\n#1 -2 0\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nprint (sum(abs(x) for x in a))\r\n", "import sys\r\n\r\ndef main():\r\n return sum(abs(int(i)) for i in sys.stdin.read().strip().split()[1:])\r\n\r\nprint(main())\r\n", "\nn = int(input())\na = list(map(int,input().split()))\nres = 0\n\nfor i in a:\n res += abs(i)\n\nprint(res)", "n = int(input())\r\na = [int(num) for num in input().split()]\r\npos = 0\r\nneg = 0\r\nfor i in a :\r\n if i > 0 :\r\n pos = pos+i\r\n else :\r\n neg = neg+i\r\nprint(pos-neg)", "n = int(input())\na = list(map(int, input().split()))\nb, c = 0, 0\nfor i in a:\n if i < 0:\n c += i\n else:\n b += i\nprint(b - c)", "n=int(input())\r\narr=list(map(int, input().split()[:n]))\r\nsuma = 0\r\nneg, pos = 0, 0\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] < 0:\r\n neg += arr[i]\r\n else:\r\n pos += arr[i]\r\n\r\nsuma = pos - neg\r\nprint(suma)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\na, b = 0, 0\r\nfor el in lst:\r\n if el<0:\r\n a+=el\r\n else:\r\n b+=el\r\nprint(b-a)", "n, lst, b, c = int(input()), list(map(int, input().split())), 0, 0\r\nfor x in lst:\r\n if x < 0: c += x\r\n else: b += x\r\nprint(b - c)", "num = int(input())\r\narr = list(map(abs, map(int, input().split())))\r\n\r\nprint(sum(arr))\r\n\r\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\ns = 0\r\nfor i in li:\r\n s += abs(i)\r\nprint(s)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = 0\r\nc = 0\r\nfor i in a:\r\n if i>0:\r\n b+=i\r\n else:\r\n c+=i\r\nprint(b-c)", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nb=[]\r\nc=[]\r\nfor i in arr:\r\n if(i>0):\r\n b.append(i)\r\n else:\r\n c.append(i)\r\n\r\nans=sum(b)-sum(c)\r\nprint(ans)", "input()\nA = sorted(map(int, input().split()))\nprint(sum(a for a in A if a > 0) - sum(b for b in A if b < 0))\n", "n=int(input())\r\nres=0\r\nfor i in [int(x) for x in input().split()]:\r\n res+=abs(i)\r\nprint(res)\r\n", "n = int(input())\r\nA = list(map(int,input().split()))\r\nA.sort()\r\nsum = 0\r\nfor i in A:\r\n sum+=i\r\nsumm = 0;fans = sum\r\nfor i in range(n):\r\n summ += A[i]\r\n ans = sum-2*summ\r\n fans = max(ans,fans)\r\nprint(fans) \r\n", "n=int(input())\na=list([int(x) for x in input().split()])\nb=[]\nc=[]\nfor k in a:\n if k>=0:\n b.append(k)\n else:\n c.append(k)\nprint(sum(b)-sum(c))\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\n\r\ncnt = 0 \r\nlnt = 0 \r\n\r\nfor i in range(n):\r\n\tif a[i] > 0:\r\n\t\tcnt+=a[i]\r\n\telse:\r\n\t\tlnt+=a[i]\r\n\t\t\r\nprint(cnt-lnt)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nb=sum(list(filter(lambda x:x>0,l)))\r\nc=sum(list(filter(lambda x:x<0,l)))\r\nprint(b-c)", "def func(arr, n):\r\n c = []\r\n b = []\r\n for i in range(n):\r\n if(arr[i] < 0):\r\n c.append(arr[i])\r\n else:\r\n b.append(arr[i])\r\n\r\n return sum(b) - sum(c)\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(func(arr, n))", "n=int(input())\r\nk=list(map(int,input().split()))\r\nli=[]\r\nl=[]\r\nfor i in k:\r\n if i<0:\r\n li.append(i)\r\n else:\r\n l.append(i)\r\nprint(sum(l)-sum(li))\r\n" ]

[ "s=str(int(input()))\r\nflag=False\r\nfor i in range(0,len(s)):\r\n if(s[i]=='0' and flag==False):\r\n flag=True\r\n elif(flag==False and i==len(s)-1):\r\n flag=True\r\n else:\r\n print(s[i],end='')\r\n \r\n", "s = input() \r\nfor idx in range(len(s)):\r\n if s[idx] == \"0\":\r\n break\r\nprint(s[:idx]+s[idx+1:])", "def main():\r\n\ts=input()\r\n\tfound=0\r\n\tl=len(s)\r\n\tfor i in range(l):\r\n\t\tif (s[i]=='0' or i==l-1) and not found: \r\n\t\t\tfound=1\r\n\t\t\tcontinue\r\n\t\tprint(s[i],end='')\r\n\r\n\r\nif __name__=='__main__': main()", "from sys import stdin, stdout\r\n\r\nn = str(stdin.readline().strip())\r\nok = True\r\ni = 1\r\nfor x in n:\r\n if ok and i == len(n):\r\n continue\r\n if x == '0' and ok:\r\n ok = False\r\n continue\r\n else:\r\n stdout.write(x)\r\n\r\n i = i + 1\r\n", "a=input()\r\ni=a.find('0')\r\nif i!=-1:\r\n a=a[:i]+a[i+1:]\r\nelse:\r\n a=a[:-1]\r\nprint(a)", "from collections import deque\r\nfrom math import ceil\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\ns=si()\r\nn=len(s)\r\nf=0\r\nb=[]\r\nfor i in range(len(s)):\r\n if(s[i]=='1'):\r\n b.append(1)\r\n elif(s[i]=='0' and f==1):\r\n b.append(0)\r\n else:\r\n f=1\r\nif(f==0):\r\n for i in range(n-1):\r\n print(b[i],end=\"\")\r\n print()\r\nelse:\r\n for i in range(n-1):\r\n print(b[i],end=\"\")\r\n print()", "s=input()\r\nflag=False\r\nfor z in range(len(s)):\r\n if s[z]=='0':\r\n s=s[:z]+s[z+1:]\r\n flag=True\r\n break\r\nif flag:\r\n print(s)\r\nelse:\r\n print(s[1:])", "n = int(input())\r\nk = str(n)\r\nli = [x for x in k]\r\nokay = False\r\nfor i in range(len(li)):\r\n if li[i]==\"0\":\r\n li = li[:i]+li[i+1:]\r\n okay = True\r\n break\r\nif okay==False:\r\n li = li[:-1]\r\nkk = \"\".join(li)\r\nprint(int(kk))", "s = list(input())\nif s.count('0') > 0:\n del s[s.index('0')]\nelse:\n del s[s.index('1')]\nprint(*s, sep='')\n", "def littleElephant():\r\n s=input()\r\n if s[0]=='0':\r\n s=s[:i]+s[i+1:]\r\n print(s)\r\n return\r\n for i in range(len(s)):\r\n if s[i]=='0':\r\n s=s[:i]+s[i+1:]\r\n print(s)\r\n return\r\n s=s[:0]+s[1:]\r\n print(s)\r\n return\r\n\r\nlittleElephant()", "s=input()\r\nif \"0\" in s:\r\n a=s.index(\"0\")\r\n s=s[:a]+s[a+1:]\r\nelse:\r\n s=s[:-1]\r\nprint(s)\r\n", "n=list(input())\r\nif len(n)!=n.count('1'):n.pop(n.index('0'))\r\nelse:n.pop(n.index('1'))\r\nprint(*n,sep='')", "s=input()\r\nif '0' not in s: print(s[1:])\r\nelse: \r\n i=s.index('0')\r\n s=s[:i]+s[i+1:]\r\n print(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 23 20:01:07 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nif '0' not in s:\r\n print(s[1:])\r\nelse:\r\n e = s.index('0')\r\n s = s[:e] + s[e+1:]\r\n print(s)", "x = list(input())\r\nif '0' in x:\r\n x.remove('0')\r\nelse:\r\n x.remove('1')\r\nprint(*x,sep=\"\")", "n = input()\r\nn = list(n)\r\nans = []\r\nfirstzero = 0\r\nfor i in range(len(n)):\r\n if(n[i] == '0' and firstzero == 0 ):\r\n firstzero = 1\r\n continue\r\n ans.append(n[i])\r\nif(firstzero == 0):\r\n ans.pop()\r\n\r\nres = \"\" \r\n \r\nfor x in ans:\r\n res = res+x\r\n \r\nprint(res)", "s=input()\r\nans=0\r\nidx=0\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n idx=i\r\n break\r\nans=s[0:idx]+s[idx+1:len(s)]\r\nprint(ans)", "def max_binary_after_deletion(s):\r\n if '0' in s:\r\n return s[:s.index('0')] + s[s.index('0') + 1:]\r\n return s[:-1]\r\n\r\nprint(max_binary_after_deletion(input().strip()))", "s=list(input())\r\nif '0' in s:\r\n ind=s.index('0')\r\n del s[ind]\r\n print(''.join(s))\r\nelse:\r\n print(''.join(s[:-1]))\r\n ", "s = input( )\r\nidx = max( 0 , s.find( '0' ) )\r\nprint( s[ : idx ] + s[idx + 1 : ] )", "n = input()\r\nfor i in range(len(n)):\r\n if n[i] == '0':\r\n break\r\nprint(n[:i] + n[i+1:])", "a=input()\r\nprint(a.replace('0','',1) if '0' in a else a[:-1])\r\n", "l = list(map(int, input()))\r\ntry:\r\n l.remove(0)\r\n print(\"\".join(map(str, l)))\r\nexcept:\r\n l.remove(1)\r\n print(\"\".join(map(str, l)))\r\n", "binary = input()\r\n\r\ntry:\r\n charIndex = binary.index(\"0\")\r\nexcept:\r\n charIndex = 0\r\n\r\nnewBinary = f\"{binary[:charIndex]}{binary[charIndex + 1:]}\"\r\n\r\nprint(newBinary)", "import sys\n\nflag = True\nbin_num = input()\nbin_num = list(bin_num)\n\ntry:\n idx = bin_num.index('1')\nexcept ValueError:\n print(0)\n sys.exit()\n\nwhile bin_num[0] == '0':\n bin_num.remove('0')\n flag = False\n\ntry:\n if flag:\n bin_num.remove(bin_num[bin_num.index('0')])\n \nexcept ValueError:\n if flag:\n bin_num.remove(bin_num[bin_num.index('1')])\n\nbin_num = \"\".join(bin_num)\nprint(bin_num)\n\n \t \t \t \t \t \t\t\t\t \t\t \t \t", "sa=input()\r\nlo=[]\r\nif '0' in sa:\r\n \r\n for char in sa:\r\n lo.append(char)\r\n for element in lo:\r\n if element=='0':\r\n lo.remove(element)\r\n break\r\n string=''\r\n for element in lo:\r\n string+=element\r\n print(string)\r\nelse:\r\n print(sa[1:])\r\n", "num=input()\r\nidx=num.find('0')\r\nif idx>0:\r\n print(num[:idx]+num[idx+1:])\r\nelse:\r\n print(num[:-1])", "n = input()\r\narr = []\r\nflag = False\r\nfor i in n:\r\n\tif i != '0':\r\n\t\tarr.append(i)\r\n\telse:\r\n\t\tif flag:\r\n\t\t\tarr.append(i)\r\n\t\telse:\r\n\t\t\tflag = True\r\nif len(arr) == len(n):\r\n\tarr.pop()\r\nprint(\"\".join(arr))", "t = list(input())\r\nif t.count(\"0\")>0:\r\n for i in t:\r\n if i==\"0\":\r\n t.remove(i)\r\n break\r\n print(\"\".join (j for j in t))\r\nelif len(t)>1:\r\n print(\"\".join (j for j in t[:-1]))\r\nelse:\r\n print(0)", "st=input()\r\nchck=0\r\nfor i in range(1,len(st)):\r\n if st[i]=='0' and st[i-1]!='0':\r\n print(st[:i]+st[i+1:])\r\n chck=1\r\n break\r\nif chck==0:\r\n print(st[:len(st)-1])\r\n \r\n ", "s = input()\ntmp=\"\"\nif \"0\" in s:\n i = s.index(\"0\")\n s = s[:i] + \"\" + s[i+1:]\nelif \"1\" in s:\n i = s.index(\"1\")\n s = s[:i] + \"\" + s[i+1:]\nprint(s)", "s=str(input())\ni=0\nn=len(s)\nwhile i<n:\n if s[i]=='0':\n index=i\n break\n i+=1\nif i==n:\n index=i-1\nfor i in range(n):\n if i!=index:\n print(s[i],end=\"\")", "string, flag = input().strip(), True\r\nfor i in range(len(string)):\r\n if string[i] == \"0\":\r\n print(string[:i] + string[i + 1:])\r\n flag = False\r\n break\r\nif flag:\r\n print(string[:-1])\r\n", "t = input\np = print\nr = range\ns = t()\nif s.count('0') == 0:\n p(s[1:])\nelse:\n i = s.find('0')\n p(s[0:i]+s[i+1:])\n", "a=input()\r\na=list(a)\r\nif '0' in a:\r\n a.remove('0')\r\nelse:\r\n a.remove('1')\r\nfor i in a:\r\n print (i,end='')\r\n", "from sys import stdin\r\nimport math\r\n\r\ns = stdin.readline().rstrip()\r\n\r\nf = False\r\nans = []\r\n\r\nfor c in s:\r\n if c == '0' and not f:\r\n f = True\r\n pass\r\n else:\r\n ans.append(c)\r\n\r\nif not f:\r\n ans.pop()\r\n print(''.join(ans))\r\nelse:\r\n print(''.join(ans))", "a=input()\r\nx=a.find('0')\r\nif x==-1:print(a[1:])\r\nelse:print(a[:x]+a[x+1:])", "l=list(input())\r\nf=0\r\nfor i in range(len(l)):\r\n if l[i]=='0':\r\n f=1\r\n break\r\nif f==1:\r\n l.pop(i)\r\n print(''.join(l))\r\nelse:\r\n l.pop(0)\r\n print(''.join(l))\r\n", "s = input()\r\nc = {'0': 0,'1':0}\r\nfor i in range(len(s)):\r\n c[s[i]] += 1\r\nif c['0'] == 0 :\r\n print(s[1:])\r\nelse:\r\n out = ''\r\n x = s.index('0')\r\n print(s[:x] + s[x+1:])", "s = input()\r\nflag = 0\r\nind = 0\r\nif '0' in s:\r\n\tflag = 1\r\nif flag ==1:\r\n\tind = s.index('0')\r\n\tprint(s.replace('0','',1))\r\nelse:\r\n\tprint(s[:-1])", "s=input()\r\np=s.find('0')\r\nif p!=-1:\r\n print(s[0:p]+s[p+1:])\r\nelse:\r\n print(s[1:])", "s = input()\r\nflag = True\r\nl = len(s)\r\nfor i in range(l):\r\n if s[i]=='0':\r\n if flag:\r\n flag = False\r\n continue\r\n if i==l-1 and flag:\r\n break\r\n print(s[i],end='')", "n=input()\r\nif len(set(n))==1:\r\n print(n[:-1])\r\n\r\nelse:\r\n \r\n val=n.index(\"0\")\r\n data=n[:val]+n[val+1:]\r\n print(data)", "integer = input()\r\nindex = integer.find('0')\r\nif index > 0:\r\n print(integer[:index] + (integer[index+1:] if index != len(integer) - 1 else ''))\r\nelse:\r\n print(integer[:-1])\r\n", "#!/usr/bin/python3\n\ns = list(input().strip())\nfor x in range(len(s)):\n\tif s[x] == '0':\n\t\tdel s[x]\n\t\tbreak\n\telif x == len(s)-1:\n\t\tdel s[x]\n\nprint(\"\".join(s))\n", "s=input()\r\nl=len(s)\r\nif '0' in s:\r\n for i in range(len(s)):\r\n if s[i]=='0':\r\n if i == l-1:\r\n s=s[:l-1]\r\n else:\r\n s=s[:i]+s[i+1:]\r\n break\r\nelse:\r\n s=s[1:]\r\nprint(s)\r\n \r\n", "a = input()\nflag = 0\nn = len(a)\nfor i in range(n):\n if (a[i] == '0') and (flag == 0):\n flag = 1\n continue\n elif (i == n-1) and (flag == 0):\n break\n else:\n print(a[i], end=\"\")\nprint()\n", "import sys\r\nimport math\r\nimport bisect as bs\r\nimport string as strn\r\nimport heapq as hq\r\nimport collections as clc\r\nimport itertools as it\r\nimport operator as op\r\nimport copy as cp\r\n\r\nto_debug = True\r\ndef solve():\r\n a = inp_list()\r\n\r\n try:\r\n a.remove('0')\r\n except:\r\n print(\"\".join(a)[:-1])\r\n return\r\n\r\n print(\"\".join(a))\r\n\r\ndef main():\r\n t = 1\r\n for _ in range(t):\r\n solve()\r\n\r\ndef input():\r\n return sys.stdin.readline().strip('\\r\\n')\r\n\r\ndef inp_int():\r\n return int(input())\r\n\r\ndef inp_map(f=None):\r\n return map(f, input().split()) if f else map(int, input().split())\r\n\r\ndef inp_list(f=None):\r\n return list(map(f, input().split())) if f else list(input())\r\n\r\ndef print(x='', end='\\n'):\r\n sys.stdout.write(str(x))\r\n sys.stdout.write(end)\r\n\r\ndef debug(*x, end='\\n', sep=' '):\r\n if not to_debug:\r\n return\r\n for _x in x:\r\n sys.stderr.write(str(_x))\r\n sys.stderr.write(str(sep))\r\n sys.stderr.write(end)\r\n\r\nmain()", "bit = [int(i) for i in input()] \r\n\r\nn = len(bit)\r\n\r\narr = [1] * n\r\n\r\nif bit == arr:\r\n flag = False\r\nelse:\r\n flag = True\r\n \r\nif flag:\r\n bit.remove(0)\r\n for i in bit:\r\n print(i, end='')\r\n\r\nelse:\r\n bit.remove(bit[0])\r\n for i in bit:\r\n print(i, end='')", "a = input()\r\n\r\nif '0' in a:\r\n print(a.replace('0', '', 1))\r\nelse:\r\n print(a.replace('1', '', 1))\r\n", "number = input()\r\nnew_number = []\r\nflag = False\r\nfor c in number:\r\n if c == '0' and flag == False:\r\n flag = True\r\n continue\r\n new_number.append(c)\r\nif flag == False:\r\n print(number[:-1])\r\nelse:\r\n print(''.join(new_number))", "l=input()\r\nfor i in range(len(l)):\r\n if l[i]==\"0\":\r\n c=i\r\n break\r\nelse:\r\n c=0\r\nprint(l[:c]+l[(c+1):])\r\n ", "b = input()\r\nnum0 = 0\r\ni = 0\r\nfor char in b:\r\n if char == '0':\r\n num0 += 1\r\n b = b[0:i] + b[i+1:]\r\n break\r\n i += 1\r\nif num0 == 1:\r\n print(b)\r\nelse:\r\n # print()\r\n if b == '1':\r\n print(0)\r\n else:\r\n print(b[1:])\r\n", "s = list(input())\r\nif '0' in s:\r\n zero = s.index('0')\r\n s.pop(zero)\r\n print(*s, sep='')\r\nelse:\r\n s.pop(-1)\r\n print(*s, sep='')", "def f(l):\r\n if '0' not in l:\r\n return ''.join(l[1:])\r\n i = l.index('0')\r\n return ''.join(l[:i]+l[i+1:])\r\n\r\nl = list(input())\r\nprint(f(l))\r\n", "s=list(input())\r\nl=len(s)\r\ncnt=0\r\nfor i in range(l):\r\n if(s[i]=='0'):\r\n s.remove(s[i])\r\n print(''.join(map(str,s)))\r\n break\r\n else:\r\n cnt=cnt+1\r\nif(cnt==l):\r\n print(''.join(map(str,s[1:])))\r\n\r\n \r\n\r\n\r\n", "def test():\r\n n = input()\r\n ans = 0\r\n for i in range(len(n)):\r\n if n[i] == \"0\":\r\n print(n[:i] + n[i+1:])\r\n return\r\n print(n[:-1])\r\n \r\nif __name__ == \"__main__\":\r\n test()", "n=int(input())\r\nbn=n\r\nc=0\r\ns=str(n)\r\nsp=s\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n s=s[0:i]+s[i+1:]\r\n c=1\r\n break\r\nif c==1:\r\n print(int(s))\r\nelse:\r\n print(int(sp[0:len(s)-1]))\r\n", "n=input()\r\ns=list(n)\r\nif s[0]=='0':\r\n del s[0]\r\n print(\"\".join(s))\r\nelse:\r\n for i in range(len(s)):\r\n if s[i]=='0':\r\n s[i]=(\"\")\r\n break\r\n elif i==len(s)-1:\r\n s[i]=(\"\")\r\n \r\n print(\"\".join(s))\r\n", "index = -1\nn = input()\nfor i in range(len(n)):\n\tif n[i] =='0':\n\t\tindex = i\n\t\tbreak\nif(index == -1):\n\tprint(n[1:])\nelse:\n\tprint(n[:index]+n[index+1:])\n\t", "bi_number = input()\nlent = len(bi_number)\ncnt0 = 0\ncnt1 = 0\nfor i in bi_number:\n if i == '0':\n cnt0+=1\n else:\n cnt1+=1\n\nnew_str = ''\nif cnt0 >= 1:\n new_cnt0 = 0\n for i in bi_number:\n if i == '0':\n new_cnt0+=1\n if new_cnt0>1:\n new_str+=i\n elif i == '1':\n new_str += i\nelse:\n for i in range(lent-1):\n new_str+=bi_number[i]\n\nprint(new_str)\n\n\n# time complexity is o(n) first count 0 and 1 if count of zero is greater than one remove zero else remove one.\n\t \t \t\t \t\t\t \t\t\t \t\t\t \t \t\t", "import sys\ns = input()\nfor i in range(len(s)):\n if s[i] == '0':\n print(s[:i] + s[i+1:])\n sys.exit(0)\nprint(s[:-1])\n", "a = input()\r\ni = a.find('0')\r\nl = list(a)\r\ndel l[i]\r\ns = \"\"\r\ns = s.join(l)\r\nprint(s)", "\r\nfrom sys import stdin, stdout\r\na=stdin.readline()\r\nout=''\r\nzerocount=0\r\nfor i in a:\r\n if i =='1':\r\n out+=i\r\n elif i =='0':\r\n if zerocount==0:\r\n zerocount+=1\r\n else:\r\n out+=i\r\nif zerocount==0:\r\n print(a[1:])\r\nelse:\r\n\r\n print(out)", "# /**\r\n# * author: brownfox2k6\r\n# * created: 16/05/2023 22:29:29 Hanoi, Vietnam\r\n# **/\r\n\r\ns = input()\r\nif s.count('0') == 0:\r\n print('1' * (len(s) - 1))\r\nelse:\r\n idx = s.find('0')\r\n print(s[:idx] + s[idx+1:])", "s = input()\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n print(s[:i]+s[i+1:])\r\n exit()\r\n\r\nprint(s[:-1])\r\n", "a = input()\r\ni = a.find('0')\r\nlist = list(a)\r\ndel list[i]\r\ns = \"\"\r\ns = s.join(list)\r\nprint(s)", "x=int(input())\nx=str(x)\nans=\"\"\nflag=0\nfor idx,val in enumerate(x):\n\tif val!='0':\n\t\tans+=val\n\telse:\n\t\tflag=1\n\t\tbreak\nif flag==1:\n\tprint(ans,end=\"\")\n\tprint(x[idx+1:])\n\nelse:\n\tprint(x[:-1])\n", "a = list(input())\r\nfor i in range(len(a)):\r\n if a[i] == \"0\":\r\n print(\"\".join(a[:i]) + \"\".join(a[i+1:]))\r\n break\r\nelse:\r\n print(\"\".join(a[:-1]))", "S = input()\nN = len(S)\nfor i in range(N):\n if S[i] == \"0\":\n ans = S[:i] + S[i+1:]\n print(ans)\n exit()\nprint(S[1:])\n", "a = input()\n\nres = a.replace('0', '', 1)\nif res == a:\n print(res[:-1])\nelse:\n print(res)\n\n\t\t \t\t\t \t\t\t \t \t\t\t\t \t \t\t \t \t\t", "n = input()\nfor i in range(len(n)):\n\tif(n[i] == '0'):\n\t\tprint(n[:i]+n[i+1:])\n\t\texit()\nprint(n[:len(n)-1])", "s = input()\r\nprint(s.replace(\"0\", \"\", 1) if s.count(\"0\") > 0 else s[:-1])\r\n", "arr=list(input())\r\nif \"0\" not in arr:\r\n\tprint(\"1\"*(len(arr)-1))\r\nelse:\r\n\tfor i in range(len(arr)):\r\n\t\tif arr[i]==\"0\":\r\n\t\t\tdel arr[i]\r\n\t\t\tbreak\r\n\tprint(*arr,sep=\"\")", "n=input()\r\nn=list(n)\r\nif \"0\" in n:\r\n n.remove(\"0\")\r\nelse:\r\n n.remove(\"1\")\r\nm=\"\".join(n)\r\nprint(m)", "str = input()\r\n\r\nremovePos = len(str) - 1\r\n\r\nfor i in range(len(str)):\r\n\tif str[i] == '0':\r\n\t\tremovePos = i\r\n\t\tbreak\r\n\r\nfor i in range(len(str)):\r\n\tif (i != removePos):\r\n\t\tprint(str[i], end=\"\")\r\nprint()", "n=input()\r\nans=n.find('0')\r\nif n.find('0')!=-1:\r\n a=n[:ans]+n[ans+1:]\r\n print(a)\r\nelse:\r\n print(n[1:])\r\n", "def main() : \r\n n = input()\r\n test = False\r\n for i in range(len(n)) :\r\n if n[i] == \"0\" :\r\n test = True\r\n break\r\n if test :\r\n print(n[:i]+n[i+1:])\r\n else :\r\n print(n[:-1]) \r\n \r\nmain()", "from sys import stdin,stdout,setrecursionlimit\nfrom functools import lru_cache, cmp_to_key\nfrom heapq import merge, heapify, heappop, heappush\nfrom math import *\nfrom collections import defaultdict as dd, deque, Counter as C\nfrom itertools import combinations as comb, permutations as perm , accumulate\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\nfrom time import perf_counter\nfrom fractions import Fraction\nimport copy\nimport time\nsetrecursionlimit(10**9)\nstarttime = time.time()\nmod = int(pow(10, 9) + 7)\nmod2 = 998244353\n# from sys import stdin\n# input = stdin.readline\n#def data(): return sys.stdin.readline().strip()\ndef data(): return input()\ndef num():return int(input())\ndef L(): return list(sp())\ndef sl(): return list(ssp())\ndef sp(): return map(int, data().split())\ndef ssp(): return map(str, data().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\ndef pmat(A):\n for ele in A:\n print(*ele,end=\"\\n\")\ndef pmat2(A):\n for ele in A:\n for j in ele:\n print(j,end='')\n print()\ndef iseven(n):\n return n%2==0\n\ndef seive(r):\n prime=[1 for i in range(r+1)]\n prime[0]=0\n prime[1]=0\n for i in range(r+1):\n if(prime[i]):\n for j in range(2*i,r+1,i):\n prime[j]=0\n return prime\n#solution\nn=input();ans='';ok=1\nfor i in range(len(n)):\n if n[i]=='0' and ok:\n ok=0\n else:\n ans+=n[i]\nif ok:print(ans[:-1])\nelse:print(ans)\n\n\n\n'''\n#important math solution\nfor _ in range(int(input())):\n a, b = map(int, input().split())\n res = []\n\n for x in range(max(2, b), max(1001, b + 1)):\n cnt = x - b\n now = a\n\n while now:\n now //= x\n cnt += 1\n\n res.append(cnt)\n\n print(min(res))'''\nendtime = time.time()\n#print(f\"Runtime of the program is {endtime - starttime}\")\n", "def main(n):\n\tif n.count('0'):\n\t\ti = n.index('0')\n\t\tres = n[:i]+n[i+1:]\n\t\tprint(res)\n\t\treturn\n\tres = n[:-1]\n\tprint(res)\n\treturn\nn = input()\nmain(n)", "s=input()\r\nl=len(s)\r\nh=0\r\nfor i in range(l):\r\n if s[i]=='0':\r\n h=1\r\n try:\r\n s=s[:i]+s[i+1:]\r\n except:\r\n s=s[:i]\r\n break\r\nif h==0:\r\n s=s[:l-1]\r\nprint(s)", "a=input()\r\nif a[0]==\"0\":print(a[1:])\r\nelse:\r\n\tif \"0\" in a:\r\n\t\ti=a.index(\"0\")\r\n\t\tprint(a[:i]+a[i+1:])\r\n\telse:print(a[:-1])", "import os,sys\r\n\r\ndef read():\r\n sys.stdin = open('input.txt', 'r') \r\n sys.stdout = open('output.txt', 'w') \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef main():\r\n\tn=input()\r\n\tfl=1\r\n\t\r\n\tfor i in range(len(n)):\r\n\t\tif fl and (n[i]==\"0\" or i==len(n)-1):\r\n\t\t\tfl=0\r\n\t\t\tcontinue\r\n\t\tprint(n[i],end='')\r\n\r\n\r\n\t\r\n\r\nif __name__ == \"__main__\":\r\n #read()\r\n main()\r\n \r\n\r\n\r\n\r\n", "b=input()\r\nif \"0\" not in b:\r\n print(b[1:])\r\nelif \"1\" not in b:\r\n print(b[1:])\r\nelse:\r\n s=\"\"\r\n for j in range(len(b)):\r\n if b[j]!=\"0\":\r\n s+=b[j]\r\n else:\r\n break\r\n if j!=len(b)-1:\r\n s+=b[j+1:]\r\n print(s)", "ss=input()\r\nif '0' in ss:\r\n s=ss.index('0')\r\n ss=ss.replace(ss[s],\"\",1)\r\nelse:\r\n ss=ss[1:]\r\nprint(ss)", "from sys import stdin,stdout\r\nfrom bisect import bisect_left,bisect_right\r\n \r\nn=input()\r\nresult=''\r\nl=len(n)\r\nflag=0\r\nfor i in range(l):\r\n if n[i]=='1':\r\n result=result+'1'\r\n else:\r\n flag=1\r\n break\r\nif flag==0:\r\n print('1'*(l-1))\r\nelse:\r\n for i in range(i+1,l):\r\n result=result+n[i]\r\n print(result)\r\n \r\n", "a=input()\r\nk=''\r\nfor i in range(len(a)):\r\n\tif a[i]=='0':\r\n\t\tk=a[:i]+a[i+1:]\r\n\t\tbreak\r\nif k=='':\r\n\tprint(a[:len(a)-1])\r\nelse:\r\n\tprint(k)\r\n", "li = list(input())\nif '0' in li:li.remove('0')\nelse:li.remove('1')\nprint(''.join(li))\n\t\t\t\t \t\t\t \t \t\t\t\t \t \t", "x=input()\r\nif \"0\" in x:\r\n idx=x.index(\"0\")\r\n print(x[:idx]+x[idx+1:])\r\nelse:\r\n print(x[:len(x)-1])", "k=input()\r\nlst=[]\r\nfinal=[]\r\ncount=0\r\nfor i in range(len(k)):\r\n if count==1:\r\n final.append(k[i])\r\n print(k[i],end=\"\")\r\n elif i!=len(k)-1:\r\n if k[i]=='0':\r\n count+=1\r\n else:\r\n final.append(k[i])\r\n print(k[i],end=\"\")\r\n", "n=input()\nresp=list(n)\nif '0' in resp:\n resp.pop(resp.index('0')) \nelse: \n del resp[0] \nfor i in resp:\n print(f'{i}',end='')\n \t\t \t\t \t\t \t \t\t \t\t \t\t \t \t \t", "s = input()\nans = ''\nok = 0\nfor el in s:\n if el == '0' and not ok:\n ok = 1\n else:\n ans += el\nif not ok:\n print(ans[1:])\nelse:\n print(ans)\n\n \t\t\t\t\t\t \t \t\t \t\t\t \t\t\t\t\t", "s = list(input())\r\nif s.count('0')>0:\r\n del s[s.index('0')]\r\nelse:\r\n s=s[1:len(s)]\r\nprint(''.join(s))", "a = str(input())\r\nk = 0\r\nb = a.count(\"0\")\r\nif b == 0:\r\n a = list(a)\r\n del(a[0])\r\n for i in range(len(a)):\r\n print(a[i],end = \"\")\r\nelif b == 1:\r\n for i in range(len(a)):\r\n if a[i] != \"0\":\r\n print(a[i],end = \"\")\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] == \"0\":\r\n k = i\r\n break\r\n a = list(a)\r\n del(a[k])\r\n for i in range(len(a)):\r\n print(a[i],end = \"\")", "string = input()\r\nprint(string.replace('0' if '0' in string else '1', '', 1))\r\n", "import sys\ns=input()\nt=False\n\nif(s.count('0')==0):\n print('1'*(len(s)-1))\n sys.exit()\nfor c in s:\n if(c=='0' and not t):\n t=True\n continue\n print(c, end='')\n", "s = input()\r\nflag = 1\r\nfor i in range(len(s)):\r\n if(s[i]=='0'):\r\n temp = i\r\n flag = 0\r\n break\r\nif flag:\r\n temp = 0\r\nprint(s[0:temp]+s[temp+1:])\r\n", "n=input()\r\nn=list(n)\r\nc=0\r\nfor i in range(len(n)):\r\n\r\n if(n[i]==\"0\"):\r\n n.remove(\"0\")\r\n c+=1\r\n break\r\n else:\r\n continue\r\n \r\na=\"\"\r\nif(c==1):\r\n for q in n:\r\n a=a+str(q)\r\n print(a)\r\nelse:\r\n n.remove(\"1\")\r\n for q in n:\r\n a=a+str(q)\r\n \r\n print(a)\r\n", "number = list(input())\n\nif '0' in number:\n for i in range(len(number)):\n if number[i] == '0':\n number[i]=''\n break\n number.pop(number.index(''))\n print(''.join(number))\nelse:\n print(''.join(number[1:]))", "#-----------------------------------------------------------------------\n# Richard Mello\n# B - Little Elephant and Bits \n#-----------------------------------------------------------------------\n\n# Recebe\nantigo = input()\ndeu = False\n\n# Copia\nnovo = \"\"\nfor digit in antigo:\n if not deu and digit == '0': deu = True\n else:\n novo += digit\n\n# Se não teve 0, Brasil\nif not deu: novo = novo[:-1]\n\n# Mostra\nprint(novo)\n \n#-----------------------------------------------------------------------\n\n\t \t\t\t\t \t \t\t \t\t \t\t\t \t\t \t\t", "s=input()\r\nl=list(s)\r\nn=len(s)\r\nb=0\r\n#a=s.lstrip(\"0\")\r\n#print(a)\r\n\r\na1=0\r\nfor i in range(n):\r\n if(l[i]!=\"0\"):\r\n a1=i\r\n break\r\nl1=l[a1:]\r\n#print(a1)\r\n\r\nfor i in range(len(l1)):\r\n if(l1[i]==\"0\"):\r\n b=1\r\n del l1[i]\r\n break\r\nif(b==0):\r\n for j in range(1,len(l1)):\r\n print(l1[j],end=\"\")\r\nelse:\r\n for j in range(len(l1)):\r\n print(l1[j],end=\"\")\r\n", "a=input()\nc=0\nfor i in range(len(a)):\n\tif a[i]=='0':\n\t\ta=a[:i]+a[i+1:]\n\t\tc+=1\n\t\tbreak\nif c==0:\n\ta=a[1:]\nprint(a)\n\t\t\t \t \t\t\t\t \t \t\t \t\t\t", "# cook your dish here\r\n\r\n\r\n\r\n\r\nb = input()\r\nc = \"\"\r\nn = len(b)\r\nif \"0\" not in b:\r\n print(b[:n-1])\r\nelse:\r\n flag = 0\r\n for i in range(n):\r\n if b[i] != \"0\":\r\n c += b[i]\r\n else:\r\n flag = i+1\r\n break\r\n c += b[flag:]\r\n print(c)\r\n ", "n = input()\r\nz = [n.find('0'),0][n.find('0') == -1]\r\nprint(n[0:z] + n[z+1::])", "a = input()\r\nif \"0\" in a:\r\n idx = a.index(\"0\")\r\n print(a[:idx]+a[idx+1:])\r\nelse:\r\n print(a[:-1])\r\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\na=input()\r\nb=''\r\nf=0\r\nfor i in range(len(a)):\r\n\tif a[i]=='0':\r\n\t\tb+=a[i+1:]\r\n\t\tf=1\r\n\t\tbreak\r\n\telse:\r\n\t\tb+=a[i]\r\nif f==1:\r\n\tprint(b)\r\nelse:\r\n\tprint(b[1:])\t\r\n", "def solve(n):\r\n for i in range(len(n)):\r\n if n[i]==\"0\":\r\n break\r\n \r\n return n[:i]+n[i+1:]\r\n \r\n \r\nif __name__==\"__main__\":\r\n n = input()\r\n ans = solve(n)\r\n print(ans)", "from math import factorial\r\n\r\ns = input()\r\nf = s.find(\"0\")\r\nif f != -1:\r\n print(s[:f] + s[f+1:])\r\nelse:\r\n print(s[1:])\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\nflag = False\r\ns = [c for c in st() if c in '01']\r\n\r\nfor i, v in enumerate(s):\r\n if v == '0':\r\n s[i] = ''\r\n flag = True\r\n break\r\n\r\nif not flag:\r\n s.pop()\r\n\r\nprint(''.join(s))\r\n", "bit = [int(i) for i in input()] \r\n\r\nn = len(bit)\r\n\r\nfor i in bit:\r\n if i == 0:\r\n flag = True\r\n break\r\n else:\r\n flag = False\r\n \r\nif flag:\r\n bit.remove(0)\r\n for i in bit:\r\n print(i, end='')\r\n\r\nelse:\r\n bit.remove(bit[0])\r\n for i in bit:\r\n print(i, end='')", "import sys\r\n\r\nk = sys.stdin.readline()\r\nwhile k:\r\n l = [digit for digit in k[:-1]]\r\n try:\r\n l.remove('0')\r\n except:\r\n l.pop(-1)\r\n print(''.join(l))\r\n k = sys.stdin.readline()\r\n", "bin_num = input()\r\na = [char for char in bin_num]\r\nif a.count('0') == 0:\r\n a.pop()\r\n print(''.join(a))\r\nelse:\r\n a.pop(a.index('0'))\r\n print(''.join(a))\r\n", "import string\r\n\r\nalph = string.ascii_lowercase\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n s = input()\r\n ans = [i for i in s]\r\n if ans.count('0') > 0:\r\n del ans[ans.index('0')]\r\n\r\n else:\r\n ans.pop()\r\n\r\n for i in ans:\r\n print(i,end='')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s = input()\r\nif s.find('0') == -1:\r\n print(s.replace('1', '', 1))\r\nelse:\r\n print(s.replace('0', '', 1))\r\n", "s=input()\nif '0' not in s:\n\tprint(s[1:])\nelse:\n\ti=s.index('0')\n\tans=s[:i]+s[i+1:]\n\tprint(ans)", "l=list(input())\r\nif(len(l)==1):\r\n exit()\r\nj=1\r\nfor i in range(len(l)):\r\n if(l[i]=='0'):\r\n l.pop(i)\r\n j=0\r\n break\r\nif(j==1):\r\n l.pop(0)\r\nfor i in range(len(l)):\r\n print(l[i],end=\"\")\r\n", "l=list(input())\r\nif \"0\" in l:\r\n\tl.remove(\"0\")\r\n\tprint(\"\".join(l))\r\nelse:\r\n\tl.remove(\"1\")\r\n\tprint(\"\".join(l))", "s = str(input())\r\nif \"0\" in s:\r\n k = int(s.index(\"0\"))\r\nprint(s[:k]+s[k+1:] if \"0\" in s else s[:len(s)-1])", "# from collections import Counter\r\ndef solve():\r\n s=input()\r\n flag=True\r\n s1=\"\"\r\n for i in s:\r\n if i==\"0\" and flag:\r\n flag=False\r\n continue\r\n s1+=i\r\n if not flag:\r\n print(s1)\r\n else:\r\n print(s1[:-1])\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "n =input()\r\ncount=0\r\n\r\nfor j in range(len(n)):\r\n if n[j]=='0':\r\n count=1\r\nif count>=1:\r\n i=9999999999999999999\r\n i=n.find('0')\r\n for j in range(len(n)):\r\n if j==i:\r\n continue\r\n print(n[j],end='')\r\nelse:\r\n for j in range(len(n)-1):\r\n print(n[j],end='')\r\n ", "s = list(input())\r\nif '0' in s:\r\n s.remove('0')\r\nelse:\r\n s.pop()\r\nfor i in s:\r\n print(i,end = '')", "n=input()\r\na=[x for x in n]\r\nif n.count('0')>0:\r\n a.remove('0')\r\n print(''.join(a))\r\nelse:\r\n del a[-1]\r\n print(''.join(a))\r\n", "a=input()\r\nans=-1\r\nfor i in range(len(a)):\r\n if a[i]=='0':\r\n ans=i\r\n break\r\nif ans!=-1:\r\n print(int(a[0:i]+a[i+1:len(a)]))\r\nelse:\r\n print(int(a[0:len(a)-1]))\r\n", "b = input().strip()\r\ni = max(0,b.find('0'))\r\nn = b[:i] + b[i + 1:]\r\nprint(n)", "st = input()\nn = len(st)\nls = list(st)\nfor i in range(n):\n if st[i]=='0':\n del ls[i]\n break\nif n == len(ls):\n del ls[0]\n print(\"\".join(ls))\nelse:\n print(\"\".join(ls))\n", "a = list(input())\nremoved = False\nfor index, i in enumerate(a):\n if i == '0':\n a.pop(index)\n removed = True\n break\nif not removed:\n a.pop(0)\n\nprint(''.join(a))\n \t\t \t \t\t \t\t\t \t \t\t\t \t \t\t", "binary_number = input()\r\n\r\n# we want to delete the left-most-occurance of `0` (MSB)\r\n# so that once deleted, the remaining bits together make the largest decimal number\r\nindex_of_left_most_zero = binary_number.find('0')\r\nif index_of_left_most_zero != -1:\r\n binary_number = binary_number[:index_of_left_most_zero] + binary_number[index_of_left_most_zero + 1:]\r\n\r\n# if failed to do so, we simply delete the right-most-digit (LSB)\r\n# so that the resultant decimal digit remains as large as possible\r\nelse:\r\n binary_number = binary_number[:-1]\r\n\r\nprint(binary_number)\r\n", "num = input()\n\ni = num.find(\"0\")\nif i != -1 :\n print(num[:i]+num[i+1:])\nelse:\n print(num[:-1])\n\n\n", "s=input()\r\nx=(s.find('0'))\r\nif(x==-1):\r\n s=\"\".join(s.replace(s[0],\"\",1))\r\nelse:\r\n s=\"\".join(s.replace(s[x],\"\",1))\r\nprint(s)", "n = input()\r\nk = n.find(\"0\")\r\nif k != -1:\r\n n = n[:k] + n[k + 1:]\r\nelse:\r\n n = n[1::]\r\nprint(n)", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n s=input()\r\n if len(set(s))==1:\r\n print(s[:-1])\r\n continue\r\n f=1\r\n for ch in s:\r\n if ch=='0' and f==1:\r\n f=0\r\n continue\r\n stdout.write(ch)", "a=input()\r\ndef fn(a):\r\n if '0' in a: \r\n for i in range(len(a)):\r\n if a[i]=='0':return a[:i]+a[i+1:]\r\n else:return a[1:]\r\nprint(fn(a))\r\n", "n = input()\ni = n.find('0')\nprint(n[:i] + n[i+1:] if i != -1 else n[1:])\n\n\n \t\t\t \t \t \t \t\t \t\t\t \t\t", "binary_number = input()\nindex_to_remove = 0\n\nfor index in range(len(binary_number)):\n if binary_number[index] == '0':\n index_to_remove = index\n break\n\nprint(binary_number[:index] + binary_number[index+1:])\n", "n=list(input())\r\n#print(n)\r\np=n.count('0')\r\n#print(p)\r\nif p==0:\r\n n.remove(n[0])\r\n ''.join(n)\r\nelse:\r\n x=n.index('0')\r\n n.remove(n[x])\r\n ''.join(n)\r\nfor i in range(len(n)):\r\n print(n[i],end='')\r\n \r\n", "def main():\r\n from sys import stdin, stdout\r\n\r\n s = stdin.readline().strip()\r\n minim = -1\r\n for i,j in enumerate(s):\r\n if j=='0':\r\n minim = i\r\n break\r\n if minim == -1:\r\n stdout.write(s[1:]+'\\n')\r\n else:\r\n stdout.write(s[:minim]+s[minim+1:]+'\\n')\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "st = input()\r\ni = 0\r\nwhile(i < len(st)):\r\n if(st[i] == '0'):\r\n break\r\n i+=1\r\n\r\nif(i == len(st)):\r\n print(st[:-1])\r\nelse:\r\n print(st[:i] + st[i+1:])", "s=input()\r\nif(list(s).count('0')==0):\r\n s=s[:-1]\r\nelse:\r\n s=s.replace('0','',1)\r\nprint(s)", "number = input()\nprimeiro = True\n\nresposta = \"\"\nfor digit in number:\n\tif (digit == \"0\" and primeiro == True):\n\t\tprimeiro = False\n\t\tcontinue\n\telse:\n\t\tresposta += digit\n\nif primeiro == True:\n\tresposta = resposta[1:]\n\nprint(resposta)\n\n\t \t \t\t\t\t \t\t \t\t\t \t \t\t \t \t", "p=input()\r\np=p.replace('',' ')\r\np=p.split()\r\nc=0\r\nfor i in range(p.index('1'),len(p)):\r\n if p[i]=='0':\r\n c=i\r\n break\r\nfor i in range(len(p)):\r\n if i==c:\r\n pass\r\n else:\r\n print(p[i],end='')\r\n", "def main():\n #elems = list(sorted(map(int, input().split(' '))))\n line = input()\n max_num = 0\n\n for i in range(len(line)):\n if i > 0 and line[i] == '0':\n max_num = int(line[:i] + line[i+1:], 2)\n break\n\n if max_num == 0:\n print(line[:len(line) - 1])\n else:\n print(bin(max_num)[2:])\n\n\nif __name__ == \"__main__\":\n main()\n", "s=str(input())\r\na=list(s)\r\nif '0' in a:\r\n a.remove('0')\r\nelse:\r\n a.remove('1')\r\nfor i in range(len(a)):\r\n print(a[i],end='')\r\n\r\n\r\n \r\n", "line = input()\r\n\r\nfirst_zero = line.find('0')\r\n\r\nif first_zero == -1:\r\n print((len(line) - 1) * '1')\r\nelse:\r\n print(line[:first_zero] + line[first_zero + 1:])\r\n", "s=input()\r\nif \"0\" in s:\r\n i=s.index(\"0\")\r\n s=s[:i]+s[i+1:]\r\nelse:\r\n s=s[1:]\r\nprint(s)\r\n", "s=input().strip()\r\nindex=-1\r\nfor i in range(0, len(s)):\r\n\tif s[i]=='0':\r\n\t\tindex=i\r\n\t\tbreak\r\nif index==-1:\r\n\tprint(s[:-1])\r\nelse:\r\n\tprint(s[:index]+s[index+1:])\r\n", "bits = input()\nbits = list(bits)\nif '0' in bits:\n bits.remove('0')\nelse:\n bits.remove('1')\n\nprint(''.join(bits))\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\n# import numpy as np\r\nsys.setrecursionlimit(int(pow(10,6)))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"out.txt\", \"w\")\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\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\n\r\n# @lru_cache(None)\r\nt=1\r\n# t=int(input())\r\nfor _ in range(t):\r\n s=list(input())\r\n for i in range(len(s)):\r\n if s[i]==\"0\":\r\n del(s[i])\r\n break\r\n if i==len(s)-1:\r\n del(s[-1])\r\n print(\"\".join(s))", "a = input()\ni = 0\nn = len(a)\nwhile (i<n and a[i]!='0'):\n i += 1\nif (i==n):\n answer = a[:n-1]\nelse:\n answer = a[:i] + a[i+1:]\nprint(answer)\n", "from sys import stdin\r\ninput = lambda: stdin.readline().strip()\r\ns = input()\r\nif '0' not in s:\r\n print(s[:-1])\r\nelse:\r\n c = 0\r\n for e in s:\r\n if e == '0' and c == 0:\r\n c += 1\r\n continue\r\n print(e,end='')\r\n \r\n", "s = input()\r\ni = 0\r\nc = True\r\nfor i in range(len(s)):\r\n if(s[i] == '0'):\r\n c = False\r\n break\r\nif(not c):\r\n for j in range(0, len(s)):\r\n if(j != i):\r\n print(s[j], end = \"\")\r\nelse:\r\n print(s[:len(s)-1])", "a=input()\r\nif(a.find('0')!=-1):\r\n a=a.replace('0','',1)\r\nelse:\r\n a=a.replace('1','',1)\r\nprint(a)\r\n", "def main():\n take = input()\n index = take.find('0')\n if index == -1:\n print('1' * (len(take) - 1))\n else:\n print(take[:index] + take[index+1:])\nmain()\n\n\n\n", "s = list(input())\r\nm = -1\r\nfor i in range(len(s)):\r\n\tif s[i] == '0':\r\n\t\ts[i] = ''\r\n\t\tm = 1\r\n\t\tbreak\r\nif (m == -1):\r\n\ts[-1] = ''\r\nprint(''.join(s))\r\n", "number = input()\r\nfor i, c in enumerate(number):\r\n if c == \"0\":\r\n number = number[:i] + number[i+1:]\r\n break\r\nelse:\r\n number = number[1:]\r\n\r\nprint(number)", "#!/usr/bin/env python3\nimport sys\n\nif __name__ == \"__main__\":\n\ta = sys.stdin.readline()[:-1]\n\ti = 0\n\twhile i < len(a):\n\t\tif a[i] == \"0\":\n\t\t\tbreak\n\t\ti += 1\n\tif i == len(a):\n\t\tprint(a[:-1])\n\telse:\n\t\tprint(a[:i]+a[i+1:])\n", "n=[*input()]\r\nl=len(n)\r\ni=0\r\nwhile i<l and n[i]=='1':\r\n i+=1\r\nif i<l:\r\n n.pop(i)\r\nelse:\r\n n.pop(i-1)\r\nprint(''.join(n) )", "s=input()\r\nl=list(s)\r\nc=l.count('0')\r\nif(c==0):\r\n for i in range(len(l)-1):\r\n print(1,end=\"\")\r\nelse:\r\n for i in range(len(l)):\r\n if (l[i] == '0'):\r\n l1 = l[:i] + l[i + 1:]\r\n break\r\n for i in l1:\r\n print(i, end=\"\")", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\ns=list(str(input()))\r\nfor i in range(len(s)):\r\n if s[i]==\"0\":\r\n del(s[i])\r\n print(\"\".join(s))\r\n break\r\nelse:\r\n del(s[0])\r\n print(\"\".join(s))", "s = input()\r\nif s.count('0') == 0 : \r\n print(s[:len(s) - 1])\r\n exit()\r\nfor i in range(len(s)) :\r\n if s[i] == '0' :\r\n print(s[:i] + s[i + 1 :])\r\n exit()\r\n", "a=list(map(int,input()))\r\nl=len(a)\r\nz=1\r\nfor i in range(l):\r\n if a[i]==0 :\r\n del a[i]\r\n break\r\nfor i in range(l-1):\r\n z=a[i]\r\n print(z,end='')\r\n \r\n", "a = input()\r\nb = a.find('0')\r\nif b >= 0:\r\n print(a[:b] + a[b+1:])\r\nelse:\r\n print(a[1:])", "a = list(input())\nans = False\nfor i in range(len(a)):\n if a[i] == \"0\":\n a[i] = ''\n ans = True\n break\nif ans == False :\n a.remove('1')\nprint(''.join(a))", "def main():\n bin_num = input()\n i = bin_num.find('0')\n if i == -1 :\n print(bin_num[:-1])\n else:\n print(bin_num[0:i] + bin_num[i+1:])\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", "import math\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\n#(map(int, input().split()))\r\nlist_ = list()\r\n\r\ns = input()\r\nflag = 0\r\nj = 0\r\nfor i in s:\r\n if i =='0':\r\n flag = 1\r\n break\r\n j += 1\r\n\r\nif(flag==0):\r\n print(s[0:len(s)-1])\r\nelse:\r\n print(s[:j]+s[j+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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "x=list(input())\r\nf=0\r\nfor i in range(len(x)):\r\n if x[i]==\"0\":\r\n x.pop(i)\r\n f=1\r\n break\r\nif f==0:\r\n x.pop(len(x)-1)\r\nprint(\"\".join(x)) ", "s=str(input())\r\nf=\"\"\r\nl=len(s)\r\np=0\r\nfor i in range(0,l,1):\r\n if(s[i]=='0'):\r\n p=i\r\n break\r\nfor i in range(0,l,1):\r\n if(i!=p):\r\n f+=s[i]\r\nprint(f)\r\n", "binary = input()\r\ncnt = 0\r\nlst = []\r\nfor i in range(len(binary)):\r\n if binary[i] == '0' and cnt == 0:\r\n cnt += 1\r\n continue\r\n lst.append(binary[i])\r\nif cnt == 0:\r\n for i in range(len(binary)-1):\r\n print(binary[i], end = '')\r\n\r\nelse:\r\n print(''.join(lst))\r\n", "s = input()\r\nif(len(set(s)) == 1 and s[0]=='1'):\r\n n = s[1:]\r\nelse:\r\n n = s.replace('0','',1)\r\nprint(n)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = input().strip(\"\\n\")\r\nprint(n.replace(\"0\", \"\", 1) if \"0\" in n else n.replace(\"1\", \"\", 1))", "s=input()\r\nf=1\r\nfor i in range(len(s)):\r\n if s[i]==\"0\":\r\n f=0\r\n s=s[:i]+s[i+1:]\r\n break\r\nif f:\r\n print(s[:len(s)-1])\r\nelse:\r\n print(s)", "s=input()\r\nn=len(s)\r\nif \"0\" in s:\r\n s=list(s)\r\n s.pop(s.index(\"0\"))\r\n s=\"\".join(s)\r\nelse:\r\n s=s[1:]\r\nprint(s)", "a=list(input())\r\nif '0' in a:\r\n a.remove('0')\r\nelse:\r\n a.pop()\r\nprint(''.join(a))\r\n\r\n", "number = input()\r\nind = None\r\nfor bit in number:\r\n if bit == \"0\":\r\n ind = number.index(bit)\r\n break\r\nnum = []\r\nif ind == None:\r\n num = number[:-1]\r\nelse:\r\n for i in range(len(number)):\r\n #print(bit, number.index(bit))\r\n if i == ind:\r\n #print(bit, number.index(bit), ind)\r\n pass\r\n else: num.append(number[i])\r\ncombined_num = int(\"\".join(num))\r\nprint(combined_num)", "def main():\r\n s = input()\r\n if s.count('1') == len(s) or s.count('0') ==len(s):\r\n print(s[1:])\r\n else:\r\n i = s.find('0')\r\n \r\n print(s[:i] + s[i + 1:])\r\n \r\nif __name__ == '__main__':\r\n main()", "s = list(input())\r\nt = ''\r\nflag = True\r\nfor i in range(len(s)):\r\n if flag and s[i] == '0':\r\n flag = False\r\n continue\r\n t += s[i]\r\n\r\nif not flag:\r\n print(t)\r\nelse:\r\n print(t[:-1])", "n=input()\r\nl=list(n)\r\nif \"0\" in n:\r\n l.remove(l[l.index(\"0\")])\r\n print(\"\".join(l))\r\nelse:\r\n print(\"1\"*(len(n)-1))", "n=input()\r\nind=n.find('0')\r\nif ind<0: print(n[:len(n)-1])\r\nelse: print(n[:ind]+n[ind+1:])", "s = input()\nl =len(s)\nflag = 0\nfor i in range(l):\n\tif s[i]==\"0\":\n\t\tprint(s.replace(\"0\",\"\",1))\n\t\tflag=1\n\t\tbreak\nif flag==0:\n\tprint(s.replace(\"1\",\"\",1))\n", "n = list(input())\r\nif '0' in n:\r\n\tn.remove('0')\r\nelse:\r\n\tn = n[:-1]\r\nprint(''.join(n))", "s = input()\r\nf = s.find('0')\r\nprint(s[:f] + s[f + 1:] if f >= 0 else s[:-1])\r\n", "xs = list(input())\r\nN = len(xs)\r\npos = N-1\r\nfor i in range(N):\r\n if xs[i] == '0':\r\n pos = i\r\n break\r\nxs.pop(pos)\r\n\r\nprint(\"\".join(xs))", "import operator as op\r\nimport re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom functools import reduce\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef def_value():\r\n return 0\r\n\r\n\r\ns = input()\r\npos = 0\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n pos = i\r\n break\r\nfor i in range(len(s)):\r\n if i == pos:\r\n continue\r\n print(s[i], end=\"\")\r\n", "a = list(input())\r\nif '0' in a:\r\n i = a.index('0')\r\nelse:\r\n i = 0\r\na.pop(i)\r\nprint(''.join(a))", "n = input()\r\nif \"0\" in n:\r\n print(n.replace(\"0\", \"\", 1))\r\nelse:\r\n print(n[:-1])", "number = input()\r\nflag = False\r\nout = []\r\nfor c in number:\r\n if c == '0' and flag == False:\r\n flag = True\r\n continue\r\n out.append(c)\r\nif flag == False:\r\n print(number[:-1])\r\n exit()\r\nprint(''.join(out))", "b = [*map(str, input())]\r\nif '0' in b: b.remove('0')\r\nelse: b.remove('1')\r\nprint(''.join(b))\r\n", "s = input()\r\nif '0' not in s:\r\n print(s[:len(s) - 1])\r\nelse:\r\n a = s.index('0')\r\n ans=\"\"\r\n for i in range(a):\r\n ans+=s[i]\r\n for i in range(a+1,len(s)):\r\n ans+=s[i]\r\n print(ans)\r\n", "bin = input()\r\n\r\nok = 1\r\nfor i in range(len(bin)):\r\n if bin[i] == '0':\r\n bin = bin[0:i] + bin[i + 1: len(bin)]\r\n ok = 0\r\n break\r\n\r\nif ok == 1:\r\n bin = bin[0:-1]\r\n\r\nprint(bin)", "s=str(input())\r\nif \"0\" in s:\r\n d=s.index(\"0\")\r\n print(s[:d]+s[d+1:])\r\nelse:\r\n print(s[1:])", "i=input()\r\nindex=i.find('0')\r\nif index==-1:\r\n print(i[1:])\r\nelse:\r\n print(''.join(i[:index]+i[index+1:]))\r\n", "x = input ()\r\n\r\nflag = 0\r\ns = 0\r\n\r\nfor each_item in x:\r\n if each_item == '0':\r\n if flag == 0:\r\n flag = 1;\r\n continue\r\n else:\r\n print (each_item, end = '')\r\n else:\r\n if (s == len (x) - 1 and flag == 0) :\r\n continue\r\n print (each_item, end = '')\r\n s = s + 1\r\n", "s=input()\r\na=\"\"\r\nb=0\r\nif '0' in s:\r\n for char in s:\r\n if char=='0' and b==0:\r\n b+=1\r\n elif char=='0' and b!=0:\r\n a+=char\r\n else:\r\n a+=char\r\nelse:\r\n a=s[1::]\r\nprint(a)\r\n \r\n \r\n ", "s=input()\r\nn = len(s)\r\nflag = True\r\nfor i in range(n):\r\n if (s[i] == '0'):\r\n result = s[0:i] + s[i+1:n]\r\n flag = False\r\n break\r\nif flag:\r\n result = s[0:n-1]\r\nprint (result)", "a = list(input())\nfound = False\nans = []\nfor i,v in enumerate(a):\n if v == \"0\" and not found:\n found = True\n continue\n ans.append(v)\n\nif found:\n print(*ans, sep=\"\")\nelse:\n print(*([1]*(len(a)-1)), sep=\"\")\n\n\n", "l=list(input())\r\nif('0' in l):\r\n l.remove('0')\r\nelse:\r\n l.remove('1')\r\np=\"\".join(l)\r\nprint(p) \r\n ", "n=input()\r\nif \"0\" not in n: print(n[1:])\r\nelse: print(n[0:n.index(\"0\")],end=\"\");print(n[n.index(\"0\")+1:])", "n = list(input())\r\nrem = -1\r\nfor i in range(len(n)-1):\r\n if n[i] == '1' and n[i+1] == \"0\":\r\n rem = i+1\r\n break\r\n\r\nn.pop(rem)\r\nprint(\"\".join(n))\r\n", "n=input()\r\narr=list(n)\r\ntry:\r\n idx=arr.index('0')\r\n n=n[:idx]+n[idx+1:]\r\n print(n)\r\nexcept:\r\n print(n[1:])\r\n\r\n", "binary = input()\r\nindex = binary.find('0')\r\n\r\nif index != -1 :\r\n print(binary[:index] + binary[index + 1:])\r\nelse :\r\n print(binary[1:])", "n=input()\r\nif(\"0\" not in n):\r\n print(n[:len(n)-1])\r\nelse:\r\n for i in range(len(n)):\r\n if(n[i]==\"0\"):\r\n n=n[:i]+n[i+1:]\r\n break\r\n print(n)", "n=input()\r\nd=None\r\nfor i in range(len(n)):\r\n if n[i]=='0':\r\n d=i\r\n break\r\n\r\nif d!=None:\r\n print(n[:d]+n[d+1:])\r\nelse:\r\n print(n[1:])", "a= list(input())\r\n\r\nif '0' in a:\r\n a.remove('0')\r\nelse:\r\n a.remove('1')\r\n\r\n\r\n\r\nb= ''.join(a)\r\n\r\nprint(b)\r\n\r\n", "\r\n\r\ns=input()\r\nn=len(s)\r\nz=0\r\nx=[]\r\nfor i in range(0,n):\r\n if s[i]==\"0\":\r\n if z==0:\r\n z=1\r\n else:\r\n x.append(0)\r\n else:\r\n x.append(1)\r\nif z==0:\r\n x.pop(n-1)\r\nfor i in range(0,n-1):\r\n print(x[i],end='')\r\n", "# http://codeforces.com/problemset/problem/258/A\nn = input()\nz = max(0,n.find('0'))\nprint(n[:z]+n[z+1:])\n", "n=input()\r\nif '0' not in n:\r\n print(n[:-1])\r\nelse:\r\n s=True\r\n for i in range(len(n)):\r\n if n[i]=='0' and s :\r\n s=False \r\n else:\r\n print(n[i],end='')", "#in the name of god\r\n#Mr_Rubick\r\n# beghoran mano sepah ba ham zadim\r\nn=input()\r\ns=\"\"\r\nflag=0\r\nfor i in range(len(n)):\r\n if n[i]==\"0\": flag=1\r\nif flag==0:\r\n for i in range(len(n)-1): \r\n s+=n[i]\r\n print(s)\r\nelse:\r\n flag=0\r\n for i in range(len(n)):\r\n if n[i]==\"1\":s+=n[i]\r\n if n[i]==\"0\":\r\n if flag==1:s+=n[i]\r\n else: flag=1\r\n print(s)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ns=list(input())\r\nif \"0\" in s:\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]==\"0\":\r\n\t\t\tprint(\"\".join(s[0:i])+\"\".join(s[i+1:]))\r\n\t\t\tbreak\r\nelse:\r\n\tprint(\"1\"*(len(s)-1))", "s=input()\r\nif(s.count('0')==0):\r\n print(s[1:])\r\nelse:\r\n i=s.index('0')\r\n print(s[:i]+s[i+1:])", "x=input()\nfor i in x:\n if i=='0':\n x=x.replace(i,'',1)\n print(x)\n break\nelse:\n print(x[1:])\n", "n=int(input())\r\nn=str(n)\r\n\r\nif \"0\" not in n:\r\n print(n[1:])\r\nelse:\r\n print(n.replace(\"0\",\"\",1))\r\n", "n=(input())\r\ni=0\r\nwhile i<len(n)-1 and n[i]!='0':\r\n print(n[i],end='')\r\n i+=1\r\nif n[i]=='0':\r\n j=i+1\r\n while j<len(n):\r\n print(n[j],end='')\r\n j+=1\r\n", "a=input()\r\nx=len(a)\r\nx-=1\r\nstat=False\r\nl=''\r\nfor i in a:\r\n if i=='1':\r\n l=l+i\r\n elif i=='0' and not stat:\r\n stat=True\r\n else:\r\n l=l+i\r\nfor i in range(0,x):\r\n print(l[i],end='')", "s=input()\r\nl=list(s)\r\nz=l.count(\"0\")\r\nif(z==0):\r\n l.remove(l[0])\r\n for i in l:\r\n print(i,end='')\r\nelse:\r\n for i in l:\r\n if(i==\"0\"):\r\n l.remove(i)\r\n break\r\n for i in l:\r\n print(i,end='')", "s=input()\nn=len(s)\nfor i in range(n):\n if s[i]==\"0\":\n print(s[:i]+s[i+1:])\n break\nelse:\n print(s[1:])", "s=input()\r\nt=False\r\nfor i in range(len(s)):\r\n if s[i]==\"0\":\r\n t=True\r\n s=s[:i]+s[i+1:]\r\n break\r\n\r\nprint(s if t else s[1:])", "a=input()\r\nif '0' in a:\r\n e=a.index('0')\r\n a=a+'0'\r\n a=a[:e]+a[e+1:][:-1]\r\nelse:\r\n a=a[1:]\r\nprint(a)", "import sys,math\ns = input()\none = s.index('1')\nwhile one<len(s) and s[one]!='0':\n one+=1\nif s.count('0') == 0:\n print(s[0:-1])\nelse:\n print(s[0:one]+s[one+1:])\n", "s=input()\r\nl=len(s)\r\nif s.count('1')==l:\r\n print('1'*(l-1))\r\nelse:\r\n j=0\r\n for i in range(l):\r\n if s[i]=='0':\r\n j=i\r\n break\r\n \r\n s=list(s)\r\n s.pop(j)\r\n print(''.join(s))", "a = input()\r\ni = a.find(\"0\")\r\nif i==-1:\r\n print(a[1:])\r\nelse:\r\n print(a[:i]+a[i+1:])", "a = input()\nposition = a.find('0')\nif position == -1:\n print(a[1:])\nelse:\n print(a[:position]+a[(position+1):])\n", "x = input()\r\nif '0' in x:\r\n for i in x:\r\n if i =='0':\r\n print(x[0: x.index(i)] + x[x.index(i)+1:])\r\n break\r\nelse:\r\n print(x[1:])\r\n", "import sys\r\n\r\n\r\ndef f(b):\r\n n = 0\r\n for i, char in enumerate(b):\r\n if char == '0':\r\n return b[:i] + b[i+1:]\r\n if n == 0:\r\n return b[:-1]\r\n\r\n\r\nif __name__ == '__main__':\r\n for line in sys.stdin:\r\n b = line.strip()\r\n ans = f(b)\r\n print(ans)\r\n", "a=list(input())\r\nx=a.count('0')\r\nif x==0:\r\n a.pop()\r\nelse:\r\n a.remove('0')\r\nfor i in range(len(a)):\r\n print(a[i],end='')", "a = input()\n\nb = a.find('0')\nif b == -1:\n\tprint(a[:-1])\nelse:\n\tprint(a[:b] + a[b+1:])", "bins = input()\r\nzero = bins.find('0')\r\nif zero != -1:\r\n print(f\"{bins[:zero]}{bins[zero+1:]}\")\r\nelse:\r\n print(bins[:len(bins)-1])", "n=input()\r\nfor i in range(len(n)):\r\n if n[i]==\"0\":\r\n print(n[:i]+n[i+1:])\r\n quit()\r\nprint(n[:len(n)-1])", "s = input()\nf = True\ntry:\n\tidx = s.index('0')\n\tprint(s[:idx] + s[idx + 1: ])\n\tf = False\nexcept:\n\tpass\nif f:\n\tprint(s[1:])\n", "\ns = list(input())\nans = False\nanscase = s[:]\n\nif '0' not in s:\n ans = True\n\nfor i in range(len(s)):\n if s[i] == '0':\n s.pop(i)\n break\n\nif not ans:\n print(''.join(s))\nelse:\n anscase.pop(0)\n print(''.join(anscase))\n\t \t\t \t \t\t\t \t\t \t\t\t \t \t \t\t\t\t", "num = input()\r\nans = \"\"\r\ncheck = set(num)\r\nif \"0\" not in check:\r\n ans = \"1\"*(len(num)-1)\r\nelse:\r\n i = 0\r\n while num[i] != \"0\":\r\n i += 1\r\n ans = num[0:i] + num[i+1:]\r\nprint(ans)\r\n\r\n", "s = input()\n\nfor i, c in enumerate(s):\n if c == '0':\n print(s[:i]+s[i+1:])\n break\nelse:\n print(s[:-1])\n\n", "s=list(input())\r\nif 0==s.count('0'):\r\n\tprint(\"\".join(s[1:]))\r\nelse:\r\n\ts.remove('0')\r\n\tprint(\"\".join(s))", "n=input()\r\nloc=n.find('0')\r\nif loc==-1: \r\n ans=n[1:]\r\nelse:\r\n ans=n[:loc]+n[loc+1:]\r\nprint(ans)", "n = list(map(int, input()))\r\ntry:\r\n idx = n.index(0)\r\n n.pop(idx)\r\n print(*n, sep='')\r\nexcept:\r\n print(*n[1:], sep='')", "a=input()\r\nif '0' in a:print(a.replace('0','',1))\r\nelse:print(a.replace('1','',1))\r\n", "s = input()\r\npos = max(0, s.find('0'))\r\nprint(s[:pos] + s[pos + 1:])\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nimport math\n \n #n,m = map(int, input().split())\n #arr = list(map(int, input().split()))\ndef solution():\n arr = input()\n if '0' in arr:\n i = arr.index(\"0\")\n print(arr[:i] + arr[i+1:])\n else:\n print(arr[:-1])\n\n\n \n\nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=solution)\nthread.start(); thread.join()\n#solution()\n", "def main():\n num = input()\n z = num.find('0')\n if z == -1:\n print(num[:-1])\n else:\n print(num[:z] + num[z+1:])\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", "s = input()\r\nif '0' in s:\r\n s = s.replace('0','',1)\r\n print(s)\r\nelse:\r\n print(s[:-1])\r\n", "n=input()\r\nif '0' not in n:\r\n\tn=n[:len(n)-1]\r\nelse:\r\n\tpos=n.index('0')\r\n\tn=n[:pos]+(n[pos+1:])\r\n\r\nprint(n)", "import re\nfrom collections import Counter\nfrom sys import stderr\nfrom typing import Union, Generator, List, Tuple\nimport string\n\nINF = 2e18 + 3\nEPS = 1e-10\n\n\ndef main():\n num = input() # type: str\n\n if \"0\" in num:\n res = num.replace(\"0\", \"\", 1)\n else:\n res = num[:-1]\n\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "a = input()\r\n\r\nprint(a.replace('0', '', 1) if '0' in a else a[:-1])", "import bisect\r\nimport math\r\nimport heapq\r\nimport random\r\n\r\n\r\n# import sys, threading\r\n# sys.setrecursionlimit(10 ** 6) # max depth of recursion\r\n# threading.stack_size(2 ** 20)\r\n\r\n\r\ndef unpack(func=int):\r\n return map(func, input().split())\r\n\r\n\r\ndef l_unpack(func=int):\r\n \"\"\"list unpack\"\"\"\r\n return list(map(func, input().split()))\r\n\r\n\r\ndef s_unpack(func=int, rev=False):\r\n \"\"\"sorted list unpack\"\"\"\r\n return sorted(map(func, input().split()), reverse=rev)\r\n\r\n\r\ndef ml_unpack(n): # multiple line unpack\r\n \"\"\"list of n integers passed on n line, one on each\"\"\"\r\n return [int(input()) for _ in range(n)]\r\n\r\n\r\ndef range_n():\r\n return range(int(input()))\r\n\r\n\r\ndef getint():\r\n return int(input())\r\n\r\n\r\ndef counter(a):\r\n d = {}\r\n for x in a:\r\n if x in d:\r\n d[x] += 1\r\n else:\r\n d[x] = 1\r\n return d\r\n\r\n\r\ndef factor(n):\r\n d = {}\r\n while not n % 2:\r\n d[2] = d.get(2, 0) + 1\r\n n //= 2\r\n i = 3\r\n while i * i <= n:\r\n while not n % i:\r\n d[i] = d.get(i, 0) + 1\r\n n //= i\r\n i += 2\r\n if n > 1:\r\n d[n] = d.get(n, 0) + 1\r\n return d\r\n\r\n\r\ndef main():\r\n n = input()\r\n flag = True\r\n for v in n[:-1]:\r\n if v == '0' and flag:\r\n flag = False\r\n continue\r\n print(v, end='')\r\n if not flag:\r\n print(n[-1])\r\n print()\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "s = input()\nif s.count('0') == 0:\n print(s[1:])\n exit(0)\nfor i in range(len(s)):\n if s[i] == '0':\n print(s[:i] + s[i + 1:])\n exit(0)\nassert(0)\n", "n=list(input())\r\nm=0\r\nfor i in range(len(n)):\r\n if n[i]=='0':\r\n m=i\r\n break\r\n\r\nk=n[:m]+n[m+1:]\r\nprint(''.join(k))\r\n", "#\r\n# Bad codeforces template TM\r\n#\r\n# Zeyu Chen, 2019\r\n#\r\n\r\nfrom sys import stdin, stdout, setrecursionlimit\r\ninput = stdin.readline\r\nflush = stdout.flush\r\n\r\n#setrecursionlimit(1000000)\r\n\r\n############################################################\r\n\r\nOUT = []\r\n\r\ndef write(item, sep = \" \"):\r\n if type(item) is int:\r\n OUT.append(str(item))\r\n elif type(item) is list:\r\n if type(item[0]) is int:\r\n OUT.append(sep.join(map(str, item)))\r\n else:\r\n OUT.append(sep.join(item))\r\n else:\r\n OUT.append(item)\r\n\r\ndef PRINT():\r\n print(\"\\n\".join(OUT))\r\n\r\nGI = lambda: int(input())\r\nGS = lambda: input()[:-1]\r\n\r\ngi = lambda: list(map(int, input().split()))\r\ngs = lambda: input().split()\r\n\r\n############################################################\r\n\r\ns = list(GS())\r\nif \"0\" in s:\r\n s.remove(\"0\")\r\nelse:\r\n s = s[:-1]\r\n\r\nwrite(\"\".join(s))\r\n\r\n############################################################\r\n\r\nPRINT()", "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\ns = str(input())[:-1]\r\n\r\nind = 0\r\nif '0' in s:\r\n ind = s.index('0')\r\nprint(s[:ind] + s[ind+1:])\r\n\r\n", "#!/usr/bin/python\r\n\r\nbinstr = list(input())\r\nfound = False\r\nfor i in range(0, len(binstr)):\r\n if binstr[i] == '0':\r\n del(binstr[i])\r\n found = True\r\n break\r\n\r\nif found:\r\n print(\"\".join(binstr))\r\nelse:\r\n if len(binstr) > 0:\r\n print(\"\".join(binstr[1:]))\r\n else:\r\n print(0)\r\n\r\n", "a=input()\r\nif(\"0\" not in a):\r\n print(a[1:])\r\nelse:\r\n for i in range(len(a)):\r\n if(a[i]==\"0\"):\r\n print(a[:i]+a[i+1:])\r\n break\r\n\r\n", "s = input()\r\nif s.count('0') == 0:\r\n print('1'*(len(s)-1))\r\nelse:\r\n i = s.index('0')\r\n print(s[:i]+s[i+1:])\r\n\r\n\r\n", "bn = str(input())\r\nl = len(bn)\r\nfor i in range(l):\r\n\tif bn[i]=='0':\r\n\t\tbreak\r\nprint(bn[0:i]+bn[i+1::])", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\ndef main():\r\n\tstring = str(input())\r\n\tstring = list(string)\r\n\tminus = 0\r\n\tfor i in range(len(string)):\r\n\t\tif string[i]=='0':\r\n\t\t\tstring[i]='-1'\r\n\t\t\tminus = 1\r\n\t\t\tbreak\r\n\t# print(string)\r\n\tif minus==0:\r\n\t\tstring[-1]='-1'\r\n\tfor x in string:\r\n\t\tif x!='-1':\r\n\t\t\tprint(x,end=\"\")\r\nmain()", "n = input()\nif \"0\" in n:\n n = n.replace(\"0\",\"\",1)\nelse:\n n = n.replace(\"1\",\"\",1)\nprint(n)", "s = input()\r\n\r\nif '1' not in s:\r\n print(0)\r\nelif '0' not in s:\r\n print(s[:-1])\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] == '0':\r\n x = i\r\n break\r\n print(s[:i] + s[i+1:]) ", "s = input()\r\nidx = s.find('0')\r\nif idx == -1:\r\n print(s[1:])\r\nelse:\r\n print(s[0:idx],s[idx+1:],sep='')\r\n", "from sys import stdin\n\n\ndef main():\n s = stdin.readline().strip()\n i = s.find('0')\n if i == -1:\n return s[:-1]\n else:\n return s[:i] + s[i + 1:]\n\n\nprint(main())\n", "s = input()\r\nf_10 = s.find('10')\r\nif f_10 >= 0:\r\n print(s[:f_10 + 1] + s[f_10 + 2:])\r\nelse:\r\n print(s[:-1])", "n=input()\r\nindex=max(0,n.find('0'))\r\nprint(n[:index]+n[index+1:])\r\n ", "\nn=str(input())\nz=max(0,n.find('0'))\nprint(n[:z]+n[z+1:])\n", "n=list(input())\r\nx=0\r\nfor i in n:\r\n if i==\"0\":\r\n n.remove(i)\r\n x=1\r\n #print(\"kokot\")\r\n break\r\nif x==0:\r\n n.remove(n[0])\r\nprint(\"\".join(n))\r\n", "s=list(input())\r\nif(s[0]!='0'):\r\n if('0' in s):\r\n for i in range(1,len(s)):\r\n if(s[i-1]=='1' and s[i]=='0'):\r\n s.pop(i)\r\n break\r\n else:\r\n s=s[:-1]\r\nelse:\r\n s=s[1:]\r\nfor i in s:\r\n print(i,end='')", "n=str(input())\r\nm=len(n)\r\nfor i in range(len(n)):\r\n if n[i]=='0':\r\n n=n[:i]+n[i+1:]\r\n break\r\nif m==len(n):print(n[:len(n)-1])\r\nelse:print(n)", "f=input()\r\nf=[int(x) for x in f]\r\ndef func():\r\n if f.count(1)==len(f):\r\n for i in f[:-1]:print(i,end='')\r\n return\r\n elif f.count(0)==len(f):\r\n print(0)\r\n return\r\n start=False\r\n j=-1\r\n for i in f:\r\n j+=1\r\n if start==False and i==0:\r\n continue\r\n start=True\r\n if i==0:\r\n j+=1\r\n break\r\n print(i,end='')\r\n while j<len(f):\r\n print(f[j],end='')\r\n j+=1\r\n\r\nfunc()\r\n", "a=list(input())\r\ntry:a.remove('0')\r\nexcept:a.remove('1')\r\nfinally:print(''.join(a))", "n=input()\r\nif \"0\" in n:\r\n ind=n.index(\"0\")\r\n n=n[:ind]+n[ind+1:]\r\nelse:\r\n n=n[1:]\r\nprint(n)\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\n\r\ns = list(input())\r\n\r\nif \"0\" not in s:\r\n s.pop()\r\nelse:\r\n ind = s.index(\"0\")\r\n s.pop(ind)\r\n\r\nprint(\"\".join(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", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[204]:\n\n\n# # n = int(input())\n# # line = list(map(int, input().split()))\n# # line = list(str(input()))\n\n\n# In[319]:\n\n\nline = list(map(int, input()))\n\n\n# In[317]:\n\n\nif 0 in line:\n line.remove(0)\nelse:\n line.remove(1)\n\n\n# In[323]:\n\n\nprint(\"\".join(list(map(str, line))))\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "num = list(input())\nini_len = len(num)\nfor i in range(len(num)):\n if num[i] == '0':\n del num[i]\n break\n\nif len(num) == ini_len:\n del num[-1]\n\nprint(''.join(num))\n", "s = list(input())\r\nif s.count('0') == 0:\r\n print('1' * (len(s) - 1))\r\nelse:\r\n s.remove('0')\r\n print(''.join(i for i in s))\r\n", "s = list(input())\nif s.count(\"0\") == 0:\n s.pop()\nelse:\n s.pop(s.index(\"0\"))\nprint(*s, sep=\"\")\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\n1 2 3 4 6\r\n\r\n6 and 4 has to be c\r\n\r\n1 has to be a\r\n\r\n3 can be used for 136 but not 134\r\n2 can be used for 126 OR 124\r\n\r\nI need to use up as many 3's as possible\r\n'''\r\ndef solve():\r\n t = I().strip()\r\n s = [c for c in t]\r\n idx = t.find('0')\r\n if idx == -1:\r\n idx = t.find('1')\r\n s[idx] = ''\r\n print(''.join(s))\r\n\r\nsolve()", "b = input()\r\nif b.count('1') == len(b):\r\n print(b[:-1])\r\n exit(0)\r\nfound = False\r\nfor c in b:\r\n if c == '0' and not found:\r\n found = True\r\n else:\r\n print(c, end='')\r\n", "import sys\r\ninput = sys.stdin.readline\r\ndef prog():\r\n a = input().strip()\r\n for i in range(len(a)):\r\n if a[i] == '0':\r\n print(a[:i] + a[i+1:])\r\n return\r\n print(a[:-1])\r\nprog()\r\n", "a = input()\r\n\r\nif '0' in a:\r\n b = list(a)\r\n b.pop(b.index('0'))\r\n print(\"\".join(b))\r\nelse:\r\n print(a[:-1])", "s=input()\r\nn=len(s)\r\nc=0\r\nfor k in range(n):\r\n\r\n if s[k]=='0':\r\n s=s[:k]+s[k+1:]\r\n c=1\r\n break\r\nif c==0:\r\n s=s[:n-1]\r\n\r\nprint(s)", "a = input()\r\n\r\nif '0' in a:\r\n a = a.replace('0', '', 1)\r\nelse:\r\n a = a.replace('1', '', 1)\r\n\r\nprint(a)\r\n", "a = input()\r\nc = True\r\nstr1 =''\r\nfor i in a:\r\n\tif i=='0' and c:\r\n\t\tc= False\r\n\telse:\r\n\t\tstr1 += i\r\nif '0' not in a:\r\n\tprint(str1[:-1])\r\nelse:\r\n\tprint(str1)", "s = input()\r\nans = []\r\nflag = True\r\n\r\nfor i in s:\r\n if i == '0' and flag:\r\n flag = False\r\n else:\r\n ans.append(i)\r\n \r\nif not(flag):\r\n print(''.join(ans))\r\nelse:\r\n ans.pop()\r\n print(''.join(ans))", "n=list(input())\r\nif \"0\" in n:\r\n n.remove(\"0\")\r\nelse:\r\n n.pop()\r\n\r\n\r\n#convert(list(map(int,n)))\r\nprint(''.join(n))", "\r\ndef remove_zero(string):\r\n l=len(string)\r\n \r\n if \"0\" not in string:\r\n return string[:l-1]\r\n else:\r\n for i in range(l):\r\n if string[i]==\"0\":\r\n j=i\r\n break\r\n if j!=l-1:\r\n return string[:j]+string[j+1:]\r\n else:\r\n return string[:j]\r\n\r\ns=input()\r\nprint(remove_zero(s))\r\n", "from functools import reduce\nstr_list=list((input()))\n\nnum_product=reduce(lambda x,y:int(x)*int(y),str_list)\n\nif num_product==0:\n\n\n lst=list(str_list)\n lst.remove('0')\n# print(''.join(i))\n print(''.join(lst))\n # break\nelse:\n for i in range(len(str_list)):\n\n \n if str_list[i]!=0:\n lst=list(str_list)\n lst.remove('1')\n# print(''.join(i))\n print(''.join(lst))\n break", "s = input()\r\n#arr = [int(j) for j in input().split()]\r\n\r\ndone = False\r\nfor i, c in enumerate(s):\r\n if c=='0' and not done:\r\n done = True\r\n elif i==len(s)-1 and not done:\r\n done = True\r\n continue\r\n else:\r\n print(c, end='')", "num = input()\r\nif num[0] == '0':\r\n print(num[1:len(num)])\r\nelse:\r\n first_zero = num.find('0')\r\n if first_zero == -1:\r\n print(num[1:len(num)])\r\n else:\r\n print(num[:first_zero] + num[first_zero + 1:len(num)])\r\n\r\n\r\n''' \r\nyou have to delete one bit from binary number\r\nto obtain the largest possible number possible after this deletion.\r\nSolution:\r\nIt works as linear erase in vector.\r\nWhen you are getting rid of one bit at position k, you will have to \r\nshift all the bits before it to this k-th position, which will take O(k) time.\r\nWhen you shift any bit, you divide his value by 2. So targeted solution here\r\nis to shift the least amount of bits possible from the end of the number (from left side).\r\nThe optimal way of doing it will include deleting the first zero after which occurs\r\nafter the first bits 'ON'. '110010'\r\nCase with only consecutive chain of bits wich are 'ON' only. '11111111...' or :\r\nNo matter which one you will delete.\r\nThe third case with leading zeros: '000011011': In this case we are removing\r\nany zero before the first bit 'ON'.\r\n\r\nImplementation: O(n)\r\nrecognize the case by first digit entered:\r\n'1' - normal case (first zero) or (just Ones - just doesn't append the last one)\r\n'0' - remove the first zero and append the rest normally.\r\n\r\n'''\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\na=list(input())\r\nif \"0\" in a:\r\n a.remove(\"0\")\r\nelse:\r\n a.pop()\r\nprint(*a,sep=\"\")\r\n", "s = input()\nflag = 0\npole = 0\npos = -1\nfor i in range(len(s)):\n\tif s[i] == '1':\n\t\tflag = 1\n\tif flag and s[i] == '0':\n\t\tpos = i\n\t\tpole = 1\n\t\tbreak\n\t\t\n#print (pos)\nif pole:\n\tprint (s[:pos] + s[pos+1 : len(s)])\nelse:\n\tprint (s[:len(s)-1])\n", "bin=input()\r\nl,n0=len(bin),0\r\nfor i in range(l-1,0,-1):\r\n if bin[i]==\"0\": \r\n n0+=1\r\n t=i\r\nif n0==0: print(bin[1:])\r\nelse:\r\n print(bin[:t]+bin[t+1:])\r\n \r\n", "s = input()\nidx = s.find('0')\nprint(s[1:] if idx == -1 else s[:idx] + s[idx+1:] )\n", "n=input()\r\ns=''\r\ns1=n[1:]\r\na=1\r\nfor i in range(len(n)):\r\n if(n[i]=='0'):\r\n s=n[0:i]+n[i+1:]\r\n a=0\r\n break\r\n\r\nif a==0:\r\n print(s)\r\nelse:\r\n print(s1)", "a = str(input())\r\nc = a.find('0')\r\n\r\nif c == -1:\r\n print(a[1:])\r\nelse:\r\n print(a[0:c]+a[c+1:])", "n = input()\r\nfor i in range(len(n)):\r\n if n[i] == '0':\r\n n = n[:i]+n[i+1:]\r\n break\r\nelse:\r\n n = n[1:]\r\nprint(n)\r\n", "l=[i for i in input()]\r\nif l.count('1')==len(l):\r\n print(\"\".join(l[1:]))\r\nelse:\r\n for i in range(len(l)):\r\n if l[i]==\"0\":\r\n ll=l[:i]\r\n if i+1<len(l):\r\n ll+=l[i+1:]\r\n print(\"\".join(ll))\r\n break", "s = input()\r\nres = s[:-1]\r\nfor i, c in enumerate(s):\r\n if c == '0':\r\n res = s[:i] + s[i+1:]\r\n break\r\nprint(res)\r\n", "#A. Little Elephant and Bits\r\nb = input()\r\nn = len(b)\r\nif '0' in b:\r\n i = b.index('0') \r\n print(b[:i]+b[i+1:])\r\nelse:\r\n print(b[:-1])", "s = input()\r\n\r\nfirstzero = 0\r\nleadingzero = True\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n leadingzero = False\r\n if leadingzero == False and s[i] =='0':\r\n firstzero = i\r\n break\r\n\r\nprint(s[:firstzero] + s[firstzero+1:])", "s = input()\r\np = 0\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n p = i\r\n break\r\nprint(s[:p]+s[p+1:])\r\n", "s = input()\nfirx = 0\nwhile firx < len(s) and s[firx] != '0':\n\tfirx += 1\nif firx == len(s):\n\tprint(s[1:])\nelse:\n\tprint(s[:firx],end='')\n\tprint(s[firx+1:])", "a = input() # read the binary number as input\n\n# find the index of the first '0' from the left\nzero_index = a.find('0')\n\nif zero_index == -1:\n # if there are no '0's, delete the last digit\n print(a[:-1])\nelse:\n # delete the '0' at the zero_index\n print(a[:zero_index] + a[zero_index+1:])\n\t\t \t\t \t \t\t\t\t \t \t \t \t \t\t\t\t\t", "s = input()\nto_delete = next((i for i, c in enumerate(s) if c == \"0\"), 0)\nprint(\"\".join(c for i, c in enumerate(s) if i != to_delete))\n", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n\tline = str(input())\r\n\tif '0' in line:\r\n\t\tidx = line.index('0')\r\n\t\tif idx + 1 < len(line):\r\n\t\t\tprint(line[:idx] + line[idx + 1:])\r\n\t\telse:\r\n\t\t\tprint(line[:idx])\r\n\telse:\r\n\t\tprint('1' * (len(line) - 1))\r\n", "n=input()\r\nif '0' not in n:print('1'*(len(n)-1))\r\nif '0' in n:\r\n k,i=len(n),n.index('0')\r\n for j in range(k):\r\n if j!=i:print(n[j],end='')", "s=input()\r\ni=0\r\nn=len(s)\r\nwhile(i<n): \r\n if s[i]=='0':\r\n i+=1\r\n break\r\n i+=1\r\nprint(s[:i-1]+s[i:])\r\n\r\n", "s=input()\r\nprint(s[0:s.find('0')]+s[s.find('0')+1:] if '0' in s else s[0:-1:])\r\n", "s = input()\nl = len(s)\nflag = 0\nindex = -1\nfor i in range(l):\n if(s[i]=='0'):\n flag =1\n index = i\n break\nif(flag==0):\n for i in range(l-1):\n print(s[i],end='')\nelse:\n for i in range(index):\n print(s[i],end='')\n for i in range(index+1,l):\n print(s[i],end='')\n", "A = list(input())\nremoved = False\nfor index, a in enumerate(A):\n if a == '0':\n A.pop(index)\n removed = True\n break\nif not removed:\n A.pop(0)\n\nprint(''.join(A))\n\t \t \t \t\t \t\t \t\t\t\t \t\t", "def solve():\n st = input()\n for i in range(len(st)):\n if st[i] == '0':\n print(st[:i] + st[i + 1:])\n return\n print(st[:-1])\n\nif __name__ == \"__main__\":\n solve()", "inp_arr = lambda: list(map(int,input().split()))\r\ns = input()\r\nidx = s.find(\"0\")\r\nif idx != -1:\r\n print(s[:idx]+s[idx+1:])\r\nelse:\r\n print(\"1\"*(len(s)-1))", "s = input()\r\nx = s.find('0')\r\nprint(s[:-1] if x==-1 else s[:x]+s[x+1:])\r\n", "import sys\r\n\r\n\r\ndef solution(n):\r\n\r\n try:\r\n idx = n.index('0')\r\n except ValueError:\r\n return n[:-1]\r\n sol = n[:idx] + n[idx+1:]\r\n return sol\r\n\r\n\r\nif __name__ == '__main__':\r\n n = sys.stdin.readline()\r\n\r\n while n:\r\n print(solution(n.strip()))\r\n n = sys.stdin.readline()\r\n", "s = list(input())\nn = len(s)\n\nfor i in range(n):\n\tif(s[i] == '0'):\n\t\ts.pop(i)\n\t\tbreak\n\nif(len(s) == n - 1):\n\tprint(''.join(s))\nelse:\n\tprint(''.join(s[0:n-1]))", "t=input()\r\nif \"0\" in t:\r\n s=t.replace(\"0\",\"\",1)\r\n print(s)\r\nelse:\r\n s=t.replace(\"1\",\"\",1)\r\n print(s)", "n = input()\n\ni = n.find('0')\nif i != -1:\n s = n[:i] + n[i+1:]\nelse:\n s = n[1:]\n\nprint(s if s else 0)\n", "a = list(input())\n\nif (\"0\" in a):\n a.remove(\"0\")\nelse:\n a.remove(\"1\")\n\noutput = \"\"\nfor i in a:\n output += i\nprint(output)\n", "s = input()\r\nif s == \"1\"*(len(s)):\r\n print(\"1\"*(len(s) - 1))\r\nelse:\r\n print(s.replace('0','',1))\r\n", "s=input()\r\ni=s.find(\"0\")\r\nif i==-1:\r\n print(s[1:])\r\nelse:\r\n print(s[0:i],end=\"\")\r\n print(s[i+1:])", "a=str(input())\r\ns=list(a)\r\nl=len(s)\r\nif(s.count(\"1\")==l):\r\n print(a[1:])\r\nelse:\r\n for i in range(l):\r\n if(s[i]=='0'):\r\n s.pop(i)\r\n print(\"\".join(map(str,s)))\r\n break\r\n ", "s = input()\r\nfor i, c in enumerate(s):\r\n if c == '0':\r\n break\r\nprint(s[:i] + s[i+1:])", "lst =list(input())\r\nif(\"0\" not in lst):\r\n print(\"\".join(lst[1:]))\r\n exit()\r\nfor i in range(len(lst)):\r\n if(lst[i] == \"0\"):\r\n k = i\r\n break\r\nz = \"\"\r\ndel(lst[lst.index(lst[k])])\r\nprint(\"\".join(lst))", "\r\n\r\ndef solve():\r\n num_string = input()\r\n for idx, char in enumerate(num_string):\r\n if char == '0':\r\n return num_string[:idx] + num_string[idx + 1:]\r\n return num_string[:-1]\r\n\r\ndef main():\r\n ret = solve()\r\n print(ret)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "a=input()\r\nb=list(a)\r\n\r\nfor i in range(len(b)):\r\n if b[i]=='0':\r\n b.pop(i)\r\n print(''.join(map(str,b)))\r\n break\r\nelse:\r\n b.pop(0)\r\n print(''.join(map(str,b)))\r\n\r\n\r\n", "s = list(input())\r\nfor i in s:\r\n if i == '0':\r\n s.remove(i)\r\n break\r\nelse:\r\n s.remove(s[len(s) - 1])\r\n\r\nprint(''.join(s))\r\n", "a=input().rstrip()\r\nn=len(a)\r\nf=0\r\nt=''\r\nfor i in range(n):\r\n if a[i]=='0' and f==0:\r\n f=1\r\n pass\r\n else:\r\n t+=a[i]\r\nif f==1:print(t)\r\nelse:print(t[:-1])", "n=input()\r\nz=max(0,n.find('0')) #n.index() return error if not found\r\nprint(n[:z]+n[z+1:])", "a = list(input())\na = list(map(int,a))\nflag = 0\nfor i in range(len(a)):\n if a[i]==0:\n a = a[:i]+a[i+1:]\n flag = 1\n break\n\na = list(map(str,a))\nif flag:\n print(('').join(a))\nelse:\n print(('').join(a[:-1]))\n", "s=input()\r\ns1=list(s)\r\ni=s.find('0')\r\ns1.remove(s1[i])\r\ns=''.join(s1)\r\nprint(s)", "s, f= input(), 0\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n s = s[0:i]+s[i+1:]\r\n f = 1\r\n break\r\nif f==1:\r\n print(s)\r\nelse:\r\n print(s[1:])", "n=list(input())\nif('0' in n):\n\tn.pop(n.index('0'))\nelse:\n\tn.pop()\nprint(\"\".join(n))\n\n\n", "a = list(input())\r\nif \"0\" in a:\r\n a.remove(\"0\")\r\nelse:\r\n a.pop()\r\nprint(*a, sep = \"\")", "n=list(input())\r\nif n.count(\"0\")!=0:\r\n a=n.index(\"0\")\r\n n.pop(a)\r\n for i in range(len(n)):\r\n print(n[i],end=\"\")\r\nelse:\r\n for i in range(1,len(n)):\r\n print(n[i],end=\"\")\r\n ", "num = input()\r\nnuma = [i for i in num]\r\nmem = [i for i in num if i == '1']\r\nif mem == numa:\r\n numa.remove('1')\r\nelse:\r\n numa.remove('0')\r\nprint(\"\".join(numa))", "num = input()\r\nprint(num.replace(\"0\", \"\", 1) if \"0\" in num else num[::-1].replace(\"1\", \"\", 1))", "# https://codeforces.com/problemset/problem/258/A\nn = list(map(lambda x: str(x), input()))\nif n.count(\"0\"):\n n.remove(\"0\")\nelse:\n n.pop()\nprint(\"\".join(n))\n", "num=input()\r\nls=list(num)\r\nans=\"\"\r\nfirst=0\r\nfor i in range(len(ls)):\r\n\tif ls[i]=='0' and first==0:\r\n\t\tfirst+=1\r\n\telse:\r\n\t\tans+=ls[i]\r\nif len(ans)<len(num):\r\n\tprint(ans)\r\nelse:\r\n\tprint(ans[:-1])", "# A. Little Elephant and Bits\r\ns=input()\r\nif s.count('0')==1:\r\n s=s.replace('0','')\r\n print(s)\r\nelif s.count('0')==0:\r\n print(s[1:])\r\nelse:\r\n for i in range(len(s)):\r\n if s[i]=='0':\r\n print(s[:i]+s[i+1:])\r\n break", "n=input()\r\nif(\"0\" in n):\r\n n=n.replace(\"0\",'',1)\r\nelse:\r\n n=n.replace(\"1\",\"\",1)\r\nprint(n)\r\n ", "n=input()\r\nc=0\r\nres=''\r\nfor i in range(len(n)):\r\n if(n[i]=='0' and c==0):\r\n c+=1\r\n elif(n[i]=='0' and c>0):\r\n res+=\"0\"\r\n elif(n[i]=='1'):\r\n res+=\"1\"\r\n else:\r\n pass\r\nl=len(res)\r\nif c==0:\r\n res=res[:l-1]\r\nprint(res)\r\n", "a = input()\r\n\r\nfor i in range(len(a)):\r\n if a[i] == '0':\r\n a = a.replace('0', '', 1)\r\n break\r\nelse:\r\n a = a.replace('1', '', 1)\r\n\r\nprint(a)\r\n", "n=input()\r\nr=n[::-1]\r\nstr=\"\"\r\nval='0' if '0' in n else '1'\r\nres=n if '0' in n else r\r\ni=res.index(val)\r\nstr=res[0:i]+res[i+1:len(n)]\r\nstr=str[::-1] if '0' not in n else str\r\nprint(str)\r\n", "s=list(input())\r\n\r\na=False\r\nfor i in range(len(s)):\r\n\tif(s[i]=='0'):\r\n\t\ts.pop(i)\r\n\t\tprint(''.join(s))\r\n\t\texit()\r\n\r\n\r\n\r\ns.pop(0)\r\nprint(''.join(s))\r\n\r\n", "a = list(input())\r\nif '0' in a:\r\n del a[a.index('0')]\r\n print(\"\".join(a),sep = '')\r\nelse:\r\n print(\"\".join(a[1:]),sep = '')\r\n", "a = list(map(int, list(input())))\r\n\r\nfor i in range(len(a)):\r\n\tif a[i] == 0:\r\n\t\ta.pop(i)\r\n\t\tprint(''.join(map(str, a)))\r\n\t\tbreak\t\t\r\nelse:\r\n\tprint(''.join(map(str, a[1:])))\r\n", "a = input()\r\nif '0' in a:\r\n i = a.index('0')\r\n print(a[:i]+a[i+1:])\r\nelse:\r\n print(a[1:])\r\n", "s = list(input())\ntry:\n s.remove('0')\nexcept:\n s = s[:-1]\nprint(\"\".join(s))", "# your code goes here\r\nimport math\r\ns =input()\r\ns=s.lstrip('0')\r\nans=''\r\ncount=0\r\nfor i in range(len(s)):\r\n\tif s[i]=='0' and count==0:\r\n\t\tans=s[:i]+s[i+1:]\r\n\t\tcount=count+1\r\nif count==0:\r\n\tans=s[1:]\r\nprint(ans)\r\n\t", "s = input()\nans = \"\"\nflag = 0\nfor x in s:\n if x == \"0\" and flag == 0:\n flag = 1\n else:\n ans += x\nif flag == 1:\n print(ans)\nelse:\n for i in range(len(ans) - 1):\n print(ans[i], end=\"\")", "t = input()\r\nk = t.find('0')\r\nprint('1' * (len(t) - 1) if k < 0 else t[: k] + t[k + 1: ])", "#In the name of Allah\r\n\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\na = input()[:-1]\r\n\r\ndl = -1\r\nfor i in range(len(a)):\r\n if a[i] == \"0\":\r\n dl = i\r\n break\r\n\r\na = list(a)\r\na.pop(i)\r\nstdout.write(\"\".join(a))\r\n", "s=input()\r\ni=s.find('0')\r\ni=0 if i==-1 else i\r\nprint(s[:i]+s[i+1:])", "s=input()\r\nindex=s.find('1')\r\nremove=len(s)\r\nfor i in range(index,len(s)):\r\n if s[i]=='0':\r\n remove=i\r\n break\r\nif remove==len(s):\r\n print(s[0:-1])\r\nelse:\r\n \r\n print(s[:index]+s[index:remove]+s[remove+1:len(s)])\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nif '0' in s:\r\n print(s[:s.find('0')] + s[s.find('0')+1:])\r\nelse:\r\n print(s[1:])", "str1=input()\r\nif str1.count('0')==0:\r\n for i in range(len(str1)-1):\r\n print('1',end=\"\")\r\nelse:\r\n index=-1\r\n for i in range(len(str1)):\r\n if str1[i]=='0':\r\n index=i\r\n break\r\n for i in range(len(str1)):\r\n if index!=i:\r\n print(str1[i],end=\"\")\r\nprint()", "n = list(input())\r\nif n.count('0') > 0:\r\n n.remove('0')\r\nelse:\r\n n.remove('1')\r\nprint(*n,sep='')", "n=list(input())\r\ntry:\r\n del n[n.index('0')]\r\nexcept ValueError:\r\n del n[0]\r\nprint(''.join(n))", "st = list(input())\r\nif '0' in st:\r\n ind = st.index('0')\r\n st.pop(ind)\r\n print(''.join(st))\r\nelse:\r\n print(''.join(st[:-1]))\r\n", "s = input()\r\nif '0' in s: s = s.replace('0','',1)\r\nelse: s= s[1:]\r\nprint(s)", "n = input()\r\nn2 = n\r\nfor i in range(len(n)):\r\n\tif n[i] == '0':\r\n\t\tn = n[:i]+n[i+1:]\r\n\t\tbreak\r\nif n == n2:\r\n\tprint(n[1:])\r\nelse:\r\n\tprint(n)\r\n", "n = input()\r\n\r\nfor i in range(len(n)):\r\n if n[i] == \"0\":\r\n print(n[:i] + n[i + 1:])\r\n quit()\r\nprint(n[:len(n) - 1])", "N = input()\r\nif '0' not in N:\r\n print('1' * (len(N) - 1))\r\nelse:\r\n print(N[:N.index('0')] + N[N.index('0') + 1:])", "st = input()\r\nif st.count(\"1\") == len(st):\r\n st = st.replace(\"1\",\"\",1)\r\nelse:\r\n st = st.replace(\"0\",\"\",1)\r\nprint(st)\r\n\r\n", "s=input()\r\nindex=max(0,s.find('0'))\r\nprint(s[:index]+s[index+1:])\r\n ", "s=input()\r\nif \"0\" in s:\r\n i=s.index(\"0\")\r\nelse:\r\n i=s.index(\"1\")\r\nprint(s[:i]+s[i+1:])\r\n", "n = input()\r\n\r\nl = list(n)\r\n\r\na = n.find('0')\r\n\r\nl.remove(l[a])\r\n\r\nprint(\"\".join(l))", "a=list(input())\r\nif \"0\" in a:\r\n\ta.remove(\"0\")\r\nelse:\r\n\ta.remove(\"1\")\t\r\nprint(\"\".join(a))", "s=input();a=\"\";z=1\r\nfor i in s:\r\n if i=='0' and z:z=0\r\n else:a+=i\r\nif z:print(a[:-1])\r\nelse:print(a)", "s = list(input()) \r\nn = len(s)\r\nfor i in range(n): \r\n if s[i] == '0' : s=s[:i] + s[i+1:]; break\r\nif n == len(s) : s = s[:-1] \r\nprint(''.join(s))", "n = int(input())\r\nlist1 = list(map(int,str(n)))\r\nfor i in range(len(list1)):\r\n if list1[i]==0:\r\n list1.remove(list1[i])\r\n break\r\n elif i==len(list1)-1:\r\n list1.remove(list1[i])\r\n break\r\n \r\nprint(''.join(map(str,list1)))\r\n", "# cook your dish here\r\ns=input()\r\nx=[]\r\nc=0;o=0\r\nw=s.count('0')\r\nif(w>0):\r\n for i in s:\r\n if i=='0' and c==0:\r\n c+=1\r\n else:\r\n if i=='1':\r\n o+=1\r\n if(o>0):\r\n x.append(i)\r\nelse:\r\n for i in range(1,len(s)):\r\n x.append(s[i])\r\nx=\"\".join(x)\r\nprint(x)\r\n ", "a=int(input())\r\ns=str(a)\r\nfor i in range(len(s)):\r\n if s[i]==\"0\":\r\n index=i\r\n print(s[:i]+s[i+1:])\r\n break\r\nelse:\r\n print(s[1:])", "a = input()\n\ni = a.find('0')\n\nif i == -1:\n print(a[1:])\nelse:\n print(a[:i] + a[i+1:])\n\n \t\t \t\t\t \t\t \t \t\t\t \t \t\t \t", "n=input()\nif '0' in n:\n print(n[:n.index('0')]+n[n.index('0')+1:])\nelse:\n print(n[:-1])", "import string\nfrom collections import defaultdict\n\ndef main():\n n = input()\n for idx,c in enumerate(n):\n if c == '0':\n return n[:idx]+n[idx+1:]\n return n[:-1]\n\n\nprint(main())", "n=input()\r\nc=0\r\nfor i in n:\r\n if i=='0':\r\n break\r\n c=c+1\r\nif c!=len(n):\r\n print(n[:c]+n[c+1:])\r\nelse:\r\n print(n[:-1])", "li = list(map(int, input()))\nn = len(li)\nst = False\nif 0 in li:\n li.remove(0)\n print(*li,sep = '')\nelse:\n li.pop()\n print(*li,sep='')", "\r\n\r\ndef main():\r\n s = input()\r\n\r\n one = s[:-1]\r\n\r\n\r\n zero = None\r\n\r\n for i in range(len(s)):\r\n if s[i] == '0':\r\n zero = i\r\n break\r\n\r\n if zero is not None:\r\n two = s[:zero] + s[zero + 1:]\r\n\r\n print(max(one, two))\r\n\r\n else:\r\n print(one)\r\nmain()", "b=input()\r\nn=list(b)\r\n#print(n)\r\nj=n\r\n#print(j)\r\nl=len(n)\r\ng=[]\r\ni=0\r\nlu=0\r\nq=n.count('1')\r\nif q!=l:\r\n rt=b.find('0')\r\n del n[rt]\r\n kuli=''.join(n)\r\n print(kuli)\r\n#print(yu[2:h+1])\r\nelif q==l:\r\n del n[l-1]\r\n dy=''.join(n)\r\n print(dy)\r\n", "s = input()\r\n\r\nfor x in range(1, len(s) - 1):\r\n if s[x] == '0':\r\n print(s[:x] + s[x+1:])\r\n break\r\nelse:\r\n print(s[:-1])", "s = input().strip()\nsl = [a for a in s]\ntry:\n idx = sl.index('0')\n print(s[:idx]+s[(idx+1):])\nexcept:\n print(s[:-1])\n", "a = input();\na = list(map(int, a))\nl = len(a);\nfor i in range(0, l):\n if a[i] == 0:\n a.pop(i);\n break;\nif l == len(a):\n a.remove(1)\nprint(*a, sep=\"\")\n\n", "s = list(input())\r\ntry:\r\n index = s.index('0')\r\n print(''.join(s[:index]+s[index+1:]))\r\nexcept:\r\n print(''.join(s[:-1]))", "l = []\r\ns = input()\r\nn = len(s)\r\nfor i in range(n):\r\n l.append(s[i])\r\nif(l.count('0')==0):\r\n print(s[:n-1])\r\nelse:\r\n m = 0\r\n for i in range(n):\r\n if(l[i]=='0'):\r\n m = i \r\n break\r\n for i in range(len(l)):\r\n if(i==m):\r\n continue\r\n print(l[i],end=\"\")", "n=input()\r\na=list(n)\r\ni=x=0\r\nwhile i<len(a):\r\n if(a[i]=='0'):\r\n x=1\r\n a.pop(i)\r\n break\r\n i+=1\r\nif(x):\r\n n=\"\".join(a)\r\n print(n)\r\nelse:\r\n a.pop(0)\r\n n=\"\".join(a)\r\n print(n)", "import sys\r\nfrom os import path\r\nif (path.exists('input.txt')):\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt','w')\r\n\r\ns = input()\r\nif '0' not in s: print(s[:-1])\r\nelse:\r\n\tl = list(s)\r\n\tl.remove('0')\r\n\tprint(*l,sep='')", "found = False\nbits = input()\ntopr = []\nfor i in range(len(bits)):\n if bits[i] == '0' and not found:\n found = True\n continue\n else:\n topr.append(bits[i])\n\nif not found:\n topr.pop()\n\nfor char in topr:\n print(char, end='')\nprint()", "s=input()\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n s=s[:i]+s[i+1:]\r\n break\r\n if i==len(s)-1:\r\n s=s[1:]\r\nprint(s)", "L=list(input())\r\nif L.count('0')>0:\r\n for i in L:\r\n if i=='0':\r\n L.remove(i)\r\n break\r\nelse:\r\n del L[0]\r\nprint(\"\".join(L))", "a=input()\r\nc=\"\"\r\nif \"0\" not in a:\r\n for i in range(len(a)-1):\r\n c=c+a[i]\r\n print(c)\r\nelse:\r\n k=0\r\n for i in range(len(a)):\r\n if a[i]==\"0\":\r\n if k==0:\r\n k=1\r\n else:\r\n c=c+a[i]\r\n else:\r\n c=c+a[i]\r\n print(c)\r\n \r\n \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\ns = input()\r\nif s[0] == '0':\r\n print(s[1:])\r\nelse:\r\n a = s.find('0')\r\n if a!=-1:\r\n print(s[0:a]+s[a+1:])\r\n else:\r\n print(s[1:])\r\n", "n = input()\r\nif '0' in n:\r\n n = n.replace('0', '', 1)\r\nelse:\r\n n = n[:-1]\r\nprint(n)", "num = input()\r\nnum = num[num.find('1')::]\r\nif '1' not in num:\r\n print(0)\r\nelse:\r\n if '0' in num:\r\n print(num[:num.find('0')] + num[num.find('0') + 1:])\r\n else:\r\n print(num[1::])", "s = input()\r\nif len(set(s))==1: print(s[:-1])\r\nelse:\r\n\ta = list(map(int,s))\r\n\ti = a.index(0)\r\n\ta.remove(a[i])\r\n\tfor i in range(len(a)):\r\n\t\tprint(a[i],end='')", "number = input()\nlength = len(number)\nfor i in range(length):\n if number[i] == '0':\n number = number[0:i] + number[i + 1:]\n break\nif len(number) == length:\n number = number[1:]\nprint(number) \n", "s=input()\r\narr=list(s)\r\nboo=False\r\nfor i in range(len(arr)):\r\n if arr[i]=='0':\r\n del arr[i]\r\n boo=True\r\n break\r\nif not boo:\r\n del arr[0]\r\nfor i in arr:\r\n print(i,end=\"\")\r\n", "s = input()\r\n\r\ni = 0\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n break\r\n\r\nif i != len(s):\r\n print(s[:i:] + s[i + 1::])\r\nelse:\r\n print(s[:len(s) - 1:])", "s=input()\r\nf=1\r\nt=s\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n s=s[:i]+s[i+1:]\r\n print(s)\r\n break\r\nif t.count('0')==0:\r\n print(t[1:])\r\n", "s=input()\r\nif '0' in s:\r\n\t# if zero is there in string delete the leftmost zero in it\r\n\tk=s.index('0')\r\n\ts=s[:k]+s[k+1:]\r\n\tprint(s)\r\n\r\nelse:\r\n\t# as no zero is there just print string upto index -1\r\n\tprint(s[:-1])", "n = input()\r\nnl = list(n)\r\nif '0' not in nl:\r\n nl.remove(nl[0])\r\n print(''.join(nl))\r\nelse:\r\n if nl.count('0') == 1:\r\n nl.remove('0')\r\n print(''.join(nl))\r\n else:\r\n k = 0\r\n while nl[k] != '0':\r\n k += 1\r\n nl.remove(nl[k])\r\n print(''.join(nl))\r\n", "t = int(input())\r\n\r\nbinary_str = str(t)\r\nfirst_zero_index = binary_str.find('0')\r\n\r\nif first_zero_index != -1:\r\n max_binary_str = binary_str[:first_zero_index] + binary_str[first_zero_index + 1:]\r\nelse:\r\n max_binary_str = binary_str[:-1]\r\nprint(max_binary_str)", "s=input()\r\nm=list(s)\r\nif \"0\" in m:\r\n r=m.index(\"0\")\r\n m.pop(r)\r\n print(\"\".join(m))\r\nelse:\r\n print(s[:-1])\r\n", "s = input()\r\nfor i, v in enumerate(s):\r\n\tif v == '0':\r\n\t\tbreak\r\ns = s[0:i]+s[i+1:]\r\nprint(s)", "s = input().split()[0]\r\ni = s.find('0')\r\nif i == -1:\r\n print (s[1:])\r\nelse:\r\n c = s.find('1')\r\n if c > 0:\r\n print (s[c:])\r\n else:\r\n print (s[:i],s[i+1:],sep='')", "string = input()\r\n\r\nzeros = string.count('0')\r\nones = string.count('1')\r\n\r\nif zeros == 0:\r\n string = string[: -1]\r\nelse:\r\n string = string[: string.index('0')] + string[string.index('0') + 1: ]\r\n\r\nprint (string)", "a = input()\n\ncontzero = -1\nnew =0\nanew =''\n\nfor i in range(len(a)):\n\n if(a[i]=='0' and contzero==-1):\n contzero = i \n else: \n anew += a[i]\n new +=1\n\nultimo = new\n\nif (contzero == -1):\n ultimo -= 1\n anew = anew[:ultimo]\n\nprint(anew)\n \t\t \t\t \t\t \t \t \t\t\t \t \t \t", "# 直接贪心，删除第一个“0”\n# 如果没有“0”，删除第一个“1”\n\ns=list(input())\nzero_index = -1\none_index = -1\nfor index,ele in enumerate(s):\n if ele==\"0\" and zero_index==-1:\n zero_index=index\n if ele==\"1\" and one_index==-1:\n one_index=index\nif (zero_index!=-1):\n s[zero_index]=\"\"\n print(\"\".join(s))\nelse:\n s[one_index] = \"\"\n print(\"\".join(s))\n \t\t \t \t\t\t \t \t\t\t \t\t \t \t \t\t", "n=input()\r\nif \"0\" in n:\r\n n=n.replace(\"0\",\"\",1)\r\nelse:\r\n n=n[:-1]\r\nprint(n)", "s = str(input())\r\nk = ''\r\nstatus = False\r\nfor i in s:\r\n\r\n if status == True or i != '0':\r\n k +=i\r\n\r\n else:\r\n status = True\r\n\r\nif status == False:\r\n k = s[:-1]\r\nprint(k)\r\n \r\n\r\n", "s=input()\r\nn=len(s)\r\nfor i in range(n):\r\n\tif(s[i]=='0'):\r\n\t\ts=s[:i]+s[i+1:]\r\n\t\tbreak\r\nif(len(s)==n):\r\n\ts=s[:n-1]\r\nprint(s)\r\n", "n = list(input())\na = len(n)\nif a==1:\n print('0')\n quit()\nfor i in range(a):\n if n[i]=='0':\n n.pop(i)\n break\nif a != len(n):\n print(int(''.join(n)))\nelse:\n n.pop(-1)\n print(int(''.join(n)))\n\n", "s = list(input().strip())\nif '0' not in s:\n\tprint(''.join(s[1:]))\nelse:\n\tfor i in range(len(s)):\n\t\tif s[i] == '0':\n\t\t\ts.pop(i)\n\t\t\tbreak\n\tprint(''.join(s))\n", "a=input()\r\n\r\nb=-1\r\nflag=0\r\nstatus=\"\"\r\nl=len(a)\r\nfor i in range(l):\r\n\tif(a[i]=='0'):\r\n\t\tb=i\r\n\t\tbreak\r\n\r\n\r\nif(b==-1):\r\n\r\n\tb=l-1\r\n\r\na=a[0:b:]+a[b+1::]\r\nprint(a)\r\n\r\n\r\n\r\n", "n=input()\r\nflag=0\r\nif n.count(\"0\")==0:\r\n print(n[1:])\r\nelse:\r\n for i in range(len(n)):\r\n if n[i]==\"0\":\r\n index=i\r\n break\r\n print(n[0:index],end=\"\")\r\n print(n[index+1:len(n)])\r\n ", "s = input()\r\n\r\nif '0' in s:\r\n i = s.index('0')\r\n s = s[:i]+s[i+1:]\r\n print(s)\r\nelse:\r\n print(s[:-1])\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/258/A\r\n\r\nn = input()\r\n\r\nfor i in range(len(n)):\r\n if n[i] == \"0\":\r\n print(n[:i] + n[i + 1:])\r\n quit()\r\nprint(n[:len(n) - 1])", "# https://codeforces.com/problemset/problem/258/A\r\n\r\n\"\"\"\r\na is written in binary notation. Want it written on a piece of paper\r\n\r\nTo make sure it fits:\r\n delete one digit\r\n\r\nThere may be leading zeros. Anyways we want the largest possible number\r\nthat he can generate.\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n number = [digit for digit in input().strip()]\r\n\r\n # Just remove the first zero you see\r\n for i in range(1, len(number)): # The first is obviously not a zero\r\n if number[i] == '0':\r\n number.pop(i)\r\n return \"\".join(number)\r\n\r\n number.pop() # We deduce that the whole number is just 1s, so remove the last one\r\n return \"\".join(number)\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n\r\n\r\n\r\n", "def delete(arr, i):\r\n\tn = len(arr)\r\n\tfor i in range(i , n-1):\r\n\t\tarr[i] = arr[i+1]\r\n\treturn arr[:n-1]\r\n\r\ns = input()\r\ns = list(s)\r\nf = 1 \r\nfor i in range(len(s)):\r\n\tif(s[i] == '0'):\r\n\t\ts = delete(s, i)\r\n\t\tf = 0\r\n\t\tbreak\r\nif(f):\r\n\ts = delete(s, len(s)-1)\r\nprint(\"\".join(s)) ", "s = input()\r\nl = list(s)\r\na = 0\r\nfor i in range(len(s)-2,-1,-1):\r\n if l[i] == '0':\r\n l.remove(l[i])\r\n a+=1\r\n break\r\nif a == 1:\r\n print(''.join(l))\r\nelse:\r\n if l[-1] == '0':\r\n l.remove('0')\r\n else:\r\n l.remove('1')\r\n print(''.join(l))", "bit = input()\r\n\r\nn = len(bit)\r\n\r\nfor i in range(n):\r\n if bit[i] == '0':\r\n bit = bit[0:i] + bit[i + 1:]\r\n break\r\n \r\nif len(bit) == n:\r\n bit = bit[1:]\r\n \r\nprint(bit)", "k = input()\r\nres =''\r\nflag = False\r\nfor i in range(len(k)):\r\n if (k[i] == '0' or (len(res)+ 1) == len(k)) and flag == False:\r\n flag = True\r\n else:\r\n res += k[i]\r\nprint(res)\r\n", "s=input()\r\nfor i in range(len(s)-1):\r\n if s[i]=='1':\r\n print(s[i],end='')\r\n else:\r\n print(s[i+1:])\r\n break", "s=list(input())\r\nif '0' in s:\r\n s.remove(s[s.index('0')])\r\n print(*s,sep='')\r\nelse:\r\n s=s[:-1]\r\n print(*s,sep='')", "# coding: utf-8\na = input()\npos = a.find('0')\nif pos==-1:\n print(a[:-1])\nelse:\n print(a[:pos]+a[pos+1:])\n", "s = str(input())\nif s.count('0') !=0:\n for i in range(0,len(s)):\n if s[i]=='0':\n s = s[:i]+s[i+1:]\n break\n\nelse:\n s=s[1:]\nprint(s)\n \n\n\n \t\t\t\t \t \t \t \t\t\t \t \t\t\t\t", "a=list(input())\r\nif \"0\" not in a:\r\n\tprint(\"1\"*(len(a)-1))\r\nelse:\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]==\"0\":\r\n\t\t\tdel a[i]\r\n\t\t\tbreak\r\n\tprint(*a,sep=\"\")", "s = input()\r\nans = ''\r\nok = 0\r\nfor el in s:\r\n if el == '0' and not ok:\r\n ok = 1\r\n else:\r\n ans += el\r\nif not ok:\r\n print(ans[1:])\r\nelse:\r\n print(ans)\r\n", "a=input()\r\nt=a.find(\"0\")\r\nif t==-1:\r\n l=len(a)\r\n a=a[0:l-1]\r\n print(a)\r\nelse:\r\n l=len(a)\r\n a=a[0:t]+a[t+1:l]\r\n print(a)", "# cook your dish here\ns=input()\nn=len(s)\nx=-1\nfor q in range(n):\n if s[q]=='0':\n x=q\n break\nif x==-1:\n print(s[1:])\nelse: \n print(s[:x]+s[x+1:])\n", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\nimport sys\r\n\r\n# for _ in range(int(input())):\r\ns=input()\r\na=\"1\"*len(s)\r\nb=bin(int(s,2)^int(a,2)).replace(\"0b\",\"\")\r\nb=\"0\"*(len(s)-len(b))+b\r\nif(\"1\" in b):\r\n ind=b.index(\"1\")\r\n print(s[:ind]+s[ind+1:])\r\nelse:\r\n print(s[:-1])", "num=input()\r\nprint(num.replace('0',\"\",1) if '0' in num else num[:-1])", "n = input()\r\n\r\nif n.count('0') == 0 or n.count('1') == 0:\r\n print(n[:-1])\r\nelse:\r\n idx = n.index('0')\r\n for i, v in enumerate(n):\r\n if not i == idx:\r\n print(v, end='')\r\n", "a = input()\r\nidx = a.find('0')\r\nprint(a.replace(a[idx], '', 1))\r\n", "n=str(input())\r\nx=len(n)\r\ns=0\r\nfor i in range (x):\r\n if n[i]=='0':\r\n s=s+1\r\n print(n[:i]+n[i+1:])\r\n break\r\nif s==0 :\r\n print(n[1:])\r\n", "inp=input()\r\nif '0' in inp:\r\n for i in range(len(inp)):\r\n if inp[i]==\"0\":\r\n inp=inp[:i]+inp[i+1:]\r\n break\r\nelse:\r\n inp=inp[1:]\r\nprint(inp) ", "l1=list(input())\r\n\r\ncz=0\r\nc1=0\r\n\r\n\r\nflag=0\r\nfor i in range(len(l1)):\r\n \r\n if l1[i]=='0':\r\n flag=1\r\n l1.pop(i)\r\n break\r\n \r\n\r\nif flag==0:\r\n s='1'*(len(l1)-1)\r\n print(s)\r\n \r\nelse:\r\n s=''\r\n for i in l1:\r\n s+=i\r\n print(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 ", "a = input()\r\nfor i in range(len(a)):\r\n if a[i] == \"0\":\r\n print(a[:i] + a[i + 1:])\r\n quit()\r\nprint(a[:len(a) - 1])", "import math\r\nmod=1000000007\r\ndef power(a,b):\r\n res=1\r\n b=b%(mod-1)\r\n while(b>0):\r\n if b%2!=0:\r\n res=((res%mod)*(a%mod))%mod\r\n b=b//2\r\n a=a%mod\r\n a=(a*a)%mod\r\n res=res%mod\r\n return res\r\n#n=int(input())\r\n#a=[int(i) for i in input().split()]\r\n#c=[[0 for x in range(1001)] for y in range(1001)]\r\n#n,q=[int(i) for i in input().split()]\r\n#a.sort(reverse=True)\r\na=input()\r\ns=0\r\nn=len(a)\r\nfor i in range(n):\r\n if s==0 and a[i]=='0':\r\n s=1\r\n continue\r\n if s!=1 and i==n-1:\r\n continue\r\n print(a[i],end=\"\")", "def little_elephant_and_bits(a):\r\n if \"0\" not in a:\r\n a.pop(a.index(\"1\"))\r\n else:\r\n a.pop(a.index(\"0\"))\r\n return \"\".join(a)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n a = list(input())\r\n print(little_elephant_and_bits(a))\r\n", "n = input()\r\nsz = len(n)\r\nf = True\r\nc = n.count('1')\r\nif(c == sz):\r\n print(n[1:])\r\nelse:\r\n for i in range(sz):\r\n if n[i] == '0' and f:\r\n f = False\r\n else:\r\n print(n[i], end=\"\")\r\n\r\nprint()\r\n", "n=input()\r\nif \"0\" in n:\r\n print(n.replace(\"0\",\"\",1))\r\nelse:\r\n print(n.replace(\"1\",\"\",1))\r\n ", "def fastio():\r\n\timport sys\r\n\tfrom io import StringIO \r\n\tfrom atexit import register\r\n\tglobal input\r\n\tsys.stdin = StringIO(sys.stdin.read())\r\n\tinput = lambda : sys.stdin.readline().rstrip('\\r\\n')\r\n\tsys.stdout = StringIO()\r\n\tregister(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\r\nfastio()\r\n\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\n\r\ns = input()\r\nif all([i == '1' for i in s]):\r\n\tprint(s[1:])\r\n\texit()\r\n\r\nfor i in range(len(s)):\r\n\tif s[i] == '0':\r\n\t\tprint(s[i+1:])\r\n\t\tbreak\r\n\telse:\r\n\t\tprint(s[i], end = '')", "s = input()\nhere = 0\nans = ''\nfor i in range(len(s)):\n if s[i] == '0':\n ans = s[:i] + s[i+1:]\n break\n\nif(ans == ''):\n print (s[:-1])\nelse:\n print (ans.lstrip('0'))\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 = input()\r\nz = max(0, n.find('0'))\r\nprint(n[:z] + n[z+1:])\r\n", "n=input()\r\nind=n.find('0')\r\nif(ind>-1):\r\n print(n[:ind]+n[ind+1:])\r\nelse:\r\n print(n[:-1])", "s = str(input())\r\nstack = [s[0]]\r\ndone = True\r\nfor i in s[1:]:\r\n if(int(i) > int(stack[-1]) and done):\r\n stack.pop()\r\n done = False\r\n stack.append(i)\r\nif(done):\r\n stack.pop()\r\nprint(''.join(stack))", "s=str(input())\r\nz1=len(s)\r\ns=s.replace(\"0\",\"\",1)\r\nz2=len(s)\r\nif z1==z2:\r\n print(s[:-1])\r\nelse:print(s)", "n=str(input())\r\nif n=='1'*len(n):\r\n print('1'*(len(n)-1))\r\nelse:\r\n print(n.replace('0','',1))\r\n\r\n", "arr = list(input())\r\n\r\n#print(arr)\r\n\r\nleadingZeroIndex = -1\r\nfor index,digit in enumerate(arr):\r\n if digit=='0':\r\n leadingZeroIndex = index\r\n break\r\n\r\n#print(leadingZeroIndex)\r\n\r\nif leadingZeroIndex!=-1:\r\n #print(str(arr[:leadingZeroIndex] + arr[leadingZeroIndex+1:]))\r\n print(\"\".join(arr[:leadingZeroIndex] + arr[leadingZeroIndex+1:]))\r\n\r\n\r\nelse:\r\n #print(str(arr[:len(arr)-1]))\r\n print(\"\".join(arr[:len(arr)-1]))\r\n\r\n\r\n\r\n \r\n \r\n \r\n", "x=input()\r\nl=len(x)\r\nfor n in range(l-1):\r\n c=0\r\n if x[n]==\"0\" and x[n+1]==\"1\":\r\n if n!=0:\r\n x=x[0:n]+x[n+1:l]\r\n print(x)\r\n c=1\r\n break\r\n elif n==0:\r\n x=x[1:l]\r\n print(x)\r\n c=1\r\n break\r\nif c==0:\r\n if x[0]==\"1\" and x[l-1]==\"1\":\r\n print(x[0:l-1])\r\n elif x[0]==\"1\" and x[l-1]==\"0\":\r\n print(x[0:l-1])\r\n elif x[0]==\"0\" and x[l-1]==\"0\":\r\n print(x[0:l-1]) \r\n \r\n\r\n \r\n \r\n", "import sys\r\na = sys.stdin.readline().strip()\r\nfor i in range(len(a)):\r\n if a[i] == '0':\r\n print(a[:i] + a[i + 1:])\r\n sys.exit(0)\r\nprint(a[1:])", "s = input()\nfor i in range(len(s)):\n if(s[i] == '0'):\n print(s[:i]+s[i+1:])\n exit()\nprint(s[1:])\n", "b = input()\r\nb_arr = []\r\n\r\nfor i in range(len(b)):\r\n b_arr.append(int(b[i]))\r\n\r\nif(len(b_arr)==1):\r\n print(0)\r\n \r\nelse:\r\n flag = 0\r\n ind = 0\r\n for i in range(len(b_arr)):\r\n if(b_arr[i]==0):\r\n ind = i\r\n flag = 1\r\n break\r\n \r\n str1 = \"\"\r\n if(flag==0):\r\n for i in range(1, len(b_arr)):\r\n str1+=str(b_arr[i])\r\n \r\n else:\r\n for i in range(len(b_arr)):\r\n if(i!=ind):\r\n str1+=str(b_arr[i])\r\n \r\n print(str1)\r\n \r\n ", "#from collections import Counter\r\n#n = int(input())\r\n#n,m = map(int,input().split())\r\n#l = list(map(int,input().split()))\r\n\r\ns = input()\r\nif \"0\" in s:\r\n t = s.find(\"0\")\r\n print(s[0:t]+s[t+1:])\r\nelse:\r\n print(s[:-1])\r\n\r\n\r\n", "import sys\r\n\r\na = sys.stdin.readline().strip()\r\n\r\ndef findMax(a):\r\n posZero = a.find('0')\r\n if posZero==-1:\r\n return a[:-1]\r\n else:\r\n return a[:posZero]+a[posZero+1:]\r\n\r\nprint(findMax(a))", "s=input()\r\nn=len(s)\r\nf=0\r\nx=[]\r\nfor i in s:\r\n if i=='0' and not f:\r\n f=1\r\n continue\r\n x.append(i)\r\nif not f:\r\n x.pop()\r\nprint(''.join(x))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 22 09:50:00 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\ns=list(input())\r\nans=[]\r\nco=False\r\nfor i,c in enumerate(s):\r\n if c=='0':\r\n ans=s[:i]+s[i+1:]\r\n co=True\r\n break\r\n\r\nif co==False:\r\n \r\n print(''.join(s[1:]))\r\nelse:\r\n print(''.join(ans))\r\n \r\n \r\n ", "s=input()\r\nn=len(s)\r\ncan=False\r\nfor i in range(n):\r\n\tif s[i]==\"0\":\r\n\t\tnew_s=s[:i]+s[i+1:]\r\n\t\tcan=True\r\n\t\tbreak\r\nif can:\r\n\tprint(new_s)\r\nelse:\r\n\tprint(s[1:])", "a = input()\r\nz = max(0,a.find('0'))\r\nprint(a[:z]+a[z+1:])", "s = input()\r\nn = len(s)\r\nflag = 0\r\nfor i in range(n):\r\n if s[i] == \"0\":\r\n s = s[:i] + s[i+1:]\r\n flag = 1\r\n break\r\nif flag == 0:\r\n s = s[:(n-1)]\r\nprint(s)\r\n\r\n", "s=input()\r\nfor i in range(len(s)):\r\n if s[i]==\"0\":\r\n break\r\n\r\nif i!=0:\r\n ans=s[:i]+s[i+1:]\r\nelse:\r\n ans=s[i+1:]\r\nprint(ans)\r\n", "n=input()\r\nif n.count(\"0\")==0:\r\n print(n[:len(n)-1])\r\nelse:\r\n for i in range(len(n)):\r\n if n[i]!=\"0\":\r\n print(n[i],end=\"\")\r\n else:\r\n break\r\n print(n[i+1:])\r\n", "digits = str(input())\r\nn = len(digits)\r\nfirstZero = -1\r\nfor i in range(n):\r\n if digits[i] == \"0\":\r\n firstZero = i\r\n break\r\nif firstZero == -1:\r\n print(digits[1:])\r\nelse:\r\n print(digits[0 : firstZero] + digits[firstZero + 1 : ])", "str = input()\r\n\r\nif \"0\" in str:\r\n print(str.replace('0', '', 1))\r\nelse:\r\n print(str[:len(str)-1])\r\n\r\n", "b = input().strip()\r\n\r\np = b.find('0')\r\n\r\nos = ''\r\nif p != -1:\r\n\tos = b[:p] + b[p+1:]\r\nelse:\r\n\tos = b[1:]\r\n\r\nprint(os)", "from math import *\r\nfrom collections import *\r\nfrom random import *\r\nfrom bisect import *\r\nimport sys\r\n#input=sys.stdin.readline\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\ndef inp():\r\n return int(input())\r\ns=input().rstrip('\\n')\r\nif(s.count('1')==len(s)):\r\n print('1'*(len(s)-1))\r\nelse:\r\n z=s.index('0')\r\n print(s[:z]+s[z+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", "w = list(input())\r\nw.remove(\"0\" if \"0\" in w else \"1\")\r\nprint(\"\".join(w))", "x = input() \r\nfor i in range(0,len(x)):\r\n if x[i] == \"0\":\r\n print(x[:i],end=\"\")\r\n print(x[i+1:])\r\n break\r\nif x.count(\"0\") == 0:\r\n print(x[:len(x)-1])", "s=list(input())\r\nif '0' in s:\r\n s.remove('0')\r\nelse:\r\n s.remove('1')\r\nwhile len(s)!=0:\r\n if s[0] == '0':\r\n s.remove('0')\r\n else:\r\n break\r\nif len(s)!=0:\r\n print(\"\".join(s))\r\nelse:\r\n print(0)", "import sys\r\nnumber = sys.stdin.readline()\r\nprinted = False\r\nn_chars = len(number)\r\nnumber = number[:n_chars-1]\r\nn_chars -= 1\r\n\r\nfor i in range(n_chars-1):\r\n if number[i]==\"0\":\r\n print(number[:i] + number[i+1:])\r\n printed = True\r\n break\r\n\r\nif not printed: print(number[:n_chars-1])\r\n", "s = input()\r\nind = s.find('0')\r\nif ind ==-1:\r\n ans = s[:-1]\r\nelse:\r\n ans = s[:ind]+s[ind+1:]\r\nprint(ans)", "import sys,os,io,time,copy\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\nimport math\r\n\r\ndef main():\r\n string=input()\r\n n=len(string)\r\n flag=0\r\n for i in range(n-1):\r\n if flag==0 and string[i]=='0':\r\n flag=1\r\n pass\r\n else:\r\n print(string[i],end=\"\")\r\n if flag==1:\r\n print(string[n-1])\r\n else:\r\n print(\"\")\r\nmain()\r\n\r\n", "BS=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndef to_base(s, b):\r\n res = \"\"\r\n while s:\r\n res+=BS[s%b]\r\n s//= b\r\n return res[::-1] or \"0\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nfrom collections import Counter\r\ns = list(input())\r\nfound = False\r\n\r\nfor i in range(len(s)-1):\r\n if s[i+1]==\"1\" and s[i]==\"0\":\r\n found = True\r\n break\r\n\r\nif found:\r\n s.pop(i)\r\nelse:\r\n s.pop(-1)\r\n\r\nprint(\"\".join(s))\r\n", "x = input()\nt = False\nif \"0\" in x:\n for i in x:\n if \"0\" == i and t == False:\n t = True\n continue\n print(i, end=\"\")\nelse:\n print(x[:-1])\n \t\t\t\t \t\t\t\t \t\t \t \t \t", "a=input()\na=list(a)\nif '0' in a:\n\ti=a.index('0')\n\t\n\ta.pop(i)\nelse:\n\ta.pop(1)\n\t\nprint(*a,sep=\"\")\n\t", "x = input()\ny=x.find('0')\nif y != -1:\n ans = x[:y]+x[y+1:]\nelse:\n ans = x[1:]\nprint(ans)\n", "a = list(input())\r\nif a.count('0') > 0:\r\n a.remove('0')\r\nelse:\r\n a.remove('1')\r\nprint(*a,sep='') \r\n", "s=input()\r\nl=list(s)\r\nif '0' in s:\r\n k=l.index('0')\r\n t=l.pop(k)\r\n print(''.join(map(str,l)))\r\nelse:\r\n print(s[1:])", "n=input()\r\ns=''\r\nc=0\r\nfor i in n:\r\n if i=='0':\r\n c+=1\r\n if c>1:\r\n s+=i\r\n else:\r\n s+=i\r\nif c>0:\r\n print(s)\r\nelse:\r\n for i in range(len(s)-1):\r\n print(s[i],end='')", "bin_num=list(input())\r\nif \"0\" in bin_num:\r\n for i in range(len(bin_num)):\r\n if bin_num[i]==\"0\":\r\n del bin_num[i]\r\n break\r\n print(''.join(bin_num))\r\nelse:\r\n del bin_num[0]\r\n print(''.join(bin_num))", "# LUOGU_RID: 127188383\na=input()\nif '0' in a:\n e=a.index('0')\n a=a+'0'\n a=a[:e]+a[e+1:][:-1]\nelse:\n a=a[1:]\nprint(a)", "n=input();flag=True\r\nfor i in range(len(n)):\r\n if n[i]==\"0\":\r\n n=n[:i]+n[i+1:]\r\n flag=False\r\n break\r\nif flag:\r\n print(n[:-1])\r\nelse:\r\n print(n)\r\n\r\n\r\n", "s = str(input())\r\nif \"0\" not in s:\r\n print(s[0:-1])\r\n exit()\r\nind = s.index(\"0\")\r\ns = s[0 : ind] + s[1 + ind::]\r\nprint(s)\r\n", "a = input()\r\n\r\nif \"0\" in a:\r\n res = list(a).copy()\r\n res.remove(\"0\")\r\n print(''.join(res))\r\n\r\nelse:\r\n print(a[:-1])", "s=input()\r\ni=s.find('0')\r\nif i==-1:print(s[:len(s)-1])\r\nelse:print(s[:i]+s[i+1:])", "s = input()\r\nif '0' in s:\r\n e = s.split('0',1)\r\n if len(e) == 1:\r\n print(e[0])\r\n else:\r\n print(e[0]+e[1])\r\nelse:\r\n print(s[1:])\r\n", "n = input()\nloc = 0\nfor i in range(len(n)):\n if n[i] == '0':\n loc = i\n break\nans = n[:loc] + n[loc+1:]\nprint(ans)", "def solve():\r\n s = input()\r\n b = True\r\n z = set(s)\r\n if z.__contains__(\"0\"):\r\n for i in s:\r\n if b and i == \"0\":\r\n b = False\r\n continue\r\n print(i,end=\"\")\r\n else:\r\n print(s[1:])\r\n return\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "s=list(input())\r\nn=len(s)\r\nif '0' in s:\r\n\ts.remove('0')\r\n\tprint(''.join(s))\r\nelse:\r\n\ts.remove('1')\r\n\tprint(''.join(s))", "S=input()\r\nc=0\r\nfor i in range(len(S)-1) :\r\n if S[i]=='0' :\r\n print(S[:i]+S[i+1:])\r\n c=1\r\n break\r\nif c==0 :\r\n print(S[:len(S)-1])\r\n \r\n \r\n", "string=list(input())\r\nif '0' in string:\r\n string.remove('0')\r\n print(''.join(string))\r\nelse:\r\n string.remove('1')\r\n print(''.join(string))", "n=input()\r\nn=list(n)\r\nif(n.count('0')==0):\r\n print(''.join(map(str,n[0:len(n)-1])))\r\nelse:\r\n a=n.index('0')\r\n n.remove(n[a])\r\n print(''.join(map(str,n)))\r\n", "s=input()\r\nif '0' in s:\r\n\tk=s.index('0')\r\n\ts=s[:k]+s[k+1:]\r\n\tprint(s)\r\n\r\nelse:\r\n\tprint(s[:-1])", "a = input()\r\nif(len(set(a)) == 1):\r\n print(a[0] * (len(a) - 1))\r\nelse:\r\n #pop earliest 0 starting from left\r\n a = list(a)\r\n first = a.index(\"0\")\r\n a.pop(first)\r\n print(''.join(a))\r\n", "s=str(input())\nz1=len(s)\ns=s.replace(\"0\",\"\",1)\nz2=len(s)\nif z1==z2:\n print(s[:-1])\nelse:print(s)\n \t\t\t \t\t \t \t\t \t\t \t \t \t", "\r\ndef answer(a):\r\n al = list(a) #list of strings '0' and '1'\r\n if al.count('0') == 0: #no zeros. Pop off the last 1.\r\n al.pop()\r\n return ''.join(al)\r\n #At least 1 zero.\r\n indx = al.index('0')\r\n al.pop(indx)\r\n \r\n return ''.join(al)\r\n\r\ndef main():\r\n a = input()\r\n print(answer(a))\r\n\r\n\r\n return\r\nmain()", "a=input()\r\na2=list(a)\r\n\r\n\r\nb=0\r\nc=0\r\nfor i in range(len(a2)):\r\n if a2[i]=='0' and b==0:\r\n b=1\r\n continue\r\n if c==len(a2)-1:\r\n continue\r\n print(a2[i],end='')\r\n c+=1", "from collections import deque\r\nfrom collections import Counter\r\n\r\n\r\ndef helper():\r\n string = input()\r\n c = Counter(string)\r\n if c['0'] == 0:\r\n return string[0:-1]\r\n newStr = \"\"\r\n found = False\r\n for char in string:\r\n if char == '0' and not found:\r\n found = True\r\n continue\r\n else:\r\n newStr += (char)\r\n start = 0\r\n for char in newStr:\r\n if char == '0':\r\n start += 1\r\n else:\r\n break\r\n return newStr[start:]\r\n\r\n\r\nprint(helper())\r\n", "n=input()\r\ns=''\r\nif '0' in n:\r\n for i in range(len(n)):\r\n if n[i]!='0':\r\n s+=n[i]\r\n else:\r\n s+=n[i+1:]\r\n break\r\nelse:\r\n s+=n[1:]\r\n\r\n\r\nprint(s)\r\n", "import math\r\n\r\n\r\ndef main_function():\r\n s = input()\r\n index = len(s) - 1\r\n for i in range(len(s)):\r\n if s[i] == \"0\":\r\n index = i\r\n break\r\n print(s[:index] + s[index + 1:])\r\n\r\n\r\n\r\nmain_function()", "a=int(input())\r\na=str(a)\r\nf=True\r\nfor i in range(0,len(a)) :\r\n if a[i]==\"0\" :\r\n a=a[:i]+a[i+1:]\r\n f=False\r\n break\r\nif f==True :\r\n a=a[1:]\r\n\r\nprint(a)", "s=input()\r\nif(s==\"1\"):\r\n print(0)\r\nelse:\r\n s1=\"\"\r\n k=0\r\n while(k<len(s)):\r\n if(s[k]==\"0\"):\r\n break\r\n s1+=s[k]\r\n k+=1\r\n s1+=s[k+1:]\r\n if(k==len(s)):\r\n print(s[1:])\r\n else:\r\n print(s1)\r\n", "s=input()\r\nif('0' in s):\r\n i=s.index('0')\r\n print(s[:i]+s[i+1:])\r\nelse:\r\n print(s[0:-1])", "bits=input()\n\n\nind=bits.find('0')\nif ind==-1:\n print(bits[1::])\nelse:\n print(bits.replace('0','',1))\n \n\t \t \t \t\t \t \t\t\t\t\t \t\t\t \t \t", "li = list(input())\r\nif '0' in li:li.remove('0')\r\nelse:li.remove('1')\r\nprint(''.join(li))", "from math import *\r\n\r\ndef main():\r\n s = list(input())\r\n for i in range(len(s)):\r\n if s[i] == '0':\r\n s.pop(i)\r\n print(''.join(s))\r\n return 1\r\n print(''.join(s[0:len(s)-1]))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input()\r\nindex =-1\r\nfor i in range(len(s)):\r\n if(s[i] == '0'):\r\n index = i\r\n break\r\n \r\nres =\"\"\r\n\r\n \r\nif(index== -1):\r\n for i in range(len(s)-1):\r\n res+=s[i]\r\nelse:\r\n for i in range(len(s)):\r\n if(index!=i):\r\n res+=s[i]\r\n \r\nprint(res)\r\n\r\n", "n=input()\r\n\r\nmin=int(n[0])\r\nindex=0\r\nliste=[]\r\n\r\nfor i in range(len(n)):\r\n liste.append(n[i])\r\n\r\n if(int(n[i])<min):\r\n min=int(n[i])\r\n index=i\r\n\r\nliste.remove(liste[index])\r\n\r\n\r\nprint(\"\".join(liste))", "a=list(input())\r\nif(a.count('0')>0):\r\n\tfor j in range(len(a)):\r\n\t\tif(a[j]=='0'):\r\n\t\t\ta.pop(j)\r\n\t\t\tbreak\r\n\tprint(\"\".join(a))\r\nelse:\r\n\ta.pop(-1)\r\n\tprint(\"\".join(a))", "s=input('')\r\nb=[]\r\nc=''\r\nfor i in s:\r\n b.append(i)\r\nif '0'in b:\r\n b.remove('0')\r\n for i in b:\r\n c+=i\r\nelse:\r\n for i in range(len(b)-1):\r\n c+=b[i]\r\n\r\nprint(c)", "s=str(input())\r\np=s.find('0')\r\nif(p!=-1):\r\n s1=s[0:p]+s[p+1:]\r\n print(s1)\r\nelse:\r\n print(s[1:])", "a = input()\n\nitem = a.find('0')\nif item == -1:\n print(a[1:])\nelse:\n print(a[:item]+a[item+1:])\n\t \t \t\t\t\t \t \t \t\t \t\t\t \t \t \t", "n=input()\r\nk=0\r\nzero=0\r\nfor i in n:\r\n if i==\"0\":\r\n zero=1\r\n break\r\n k+=1\r\nif zero==1:\r\n s=\"\"\r\n for i in range(len(n)):\r\n if i!=k:\r\n s+=n[i]\r\n print(s)\r\nelse:\r\n for i in range(len(n)-1):\r\n print(n[i],end=\"\")", "def miis():\r\n return map(int, input().split())\r\n\r\nfor _ in range(1):\r\n s = input()\r\n n = len(s)\r\n t = ''\r\n z = 1\r\n for i in range(n):\r\n if i == n-1 and z:\r\n continue\r\n if s[i] == '0' and z:\r\n z = 0\r\n continue\r\n t += s[i]\r\n print(t)\r\n", "a=input()\r\nif int(a)==0:\r\n print(0)\r\nelif a.find(\"0\")==-1:\r\n t=a.replace(a[0], '',1)\r\n print(t)\r\nelse:\r\n b=a.find(\"0\")\r\n c=a.find(\"1\")\r\n if b<c:\r\n t=a.replace(a[0], '',1)\r\n t=int(t)\r\n print(t)\r\n else:\r\n t=a.replace(a[b], '',1)\r\n print(t)", "a = input()\r\nlist = [i for i in a]\r\nk = len(list)\r\nw = 0\r\nfor j in list:\r\n if j==\"0\":\r\n list.remove(\"0\")\r\n break\r\n if w==(k-1):\r\n list.pop()\r\n w += 1\r\nb = ''.join([str(elem) for elem in list])\r\nprint(b)", "\r\nimport sys,math\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\nfor _ in range(1):\r\n a=input()\r\n s=[]\r\n for c in a:s.append(c)\r\n i=len(s)-1\r\n if '0' in s:i=s.index('0')\r\n print(a[:i]+a[i+1:])", "entrada = input()\r\ntry:\r\n indix = entrada.index('0')\r\n entrada = entrada.replace('0', '', 1)\r\n print(entrada)\r\nexcept ValueError:\r\n entrada = entrada[:len(entrada) - 1]\r\n print(entrada)\r\n", "# import random\n# random.seed(0)\n\nbinary = input()\n\n\ndef main(binary):\n \"\"\"Main solution\"\"\"\n\n replace_position = 0\n for i in range(len(binary)):\n if binary[i] == '0':\n replace_position = i\n break\n\n result_binary = binary[:replace_position] + binary[replace_position + 1:]\n\n return result_binary\n\n\ndef brute_solution(binary):\n \"\"\"Brute solution\"\"\"\n\n result_binary = ''\n largest_value = 0\n\n for i in range(len(binary)):\n current_binary = binary[:i] + binary[i + 1:]\n value = int(current_binary, 2)\n\n if value > largest_value:\n largest_value = value\n result_binary = current_binary\n\n return result_binary\n\n\n## Stress testing\n# for _ in range(10000):\n# rand_length = random.randint(1, 10 ** 5)\n# random_binary = ''\n# \n# for _ in range(rand_length):\n# random_binary += random.choice(['0', '1'])\n# \n# first = main(random_binary)\n# second = brute_solution(random_binary)\n# \n# print(first == second)\n\n\nprint(main(binary))\n", "def solution():\r\n\tst=input()\r\n\tn=len(st)\r\n\t\r\n\tfor i in range(n):\r\n\t\tif st[i]=='0':\r\n\t\t\tprint(st[:i]+st[i+1:])\r\n\t\t\treturn\r\n\tprint(st[:-1])\r\n\r\n\r\n\treturn\r\n\t\r\n\t\r\n\r\n\r\n\r\nsolution()\r\n", "s = input()\nif '0' not in s: print(s[:-1])\nelse: print(s.replace('0', '', 1))", "digits = list(input())\r\nl = len(digits)\r\npos = l - 1\r\nfor i in range (l):\r\n if digits[i] == '0':\r\n pos = i\r\n break\r\ndigits.pop(pos)\r\nfor d in digits:\r\n print(d, end=\"\")\r\n", "strs = input()\r\nflag = 0\r\nl = list()\r\nfor x in range(len(strs)):\r\n \r\n if strs[x] == \"0\":\r\n l = list(strs)\r\n l.pop(x)\r\n flag = 1\r\n break\r\nif flag == 0:\r\n l = list(strs[1:])\r\nstrs = \"\".join(l) \r\nprint(int(strs))\r\n \r\n ", "def solve():\n for i, s in enumerate(S):\n if s == \"0\":\n return S[:i] + S[i+1:]\n return S[:-1]\n\nS = input()\nprint(solve())", "s = input()\r\nt = s.find('0')\r\nif t != -1:\r\n print(s[:t] + s[t+1:])\r\nelse:\r\n print(s[1:])\r\n", "n = input()\r\n\r\nif '0' in n:\r\n n0 = n.index('0')\r\n print(n[:n0] + n[n0+1:])\r\nelse:\r\n print(n[:-1])", "s=input()\r\nif '0' in s:\r\n x=s.index('0')\r\n print(s[:x]+s[x+1:])\r\nelse:\r\n print(s[1:])", "s=input()\r\nif '0' in s:\r\n\tj=0\r\n\twhile j<len(s):\r\n\t\tif s[j]=='0':\r\n\t\t\tbreak\r\n\t\tj+=1\r\n\tprint(s[:j]+s[j+1:])\r\nelse:\r\n\tprint(s[:-1])\r\n", "t=input()\r\nfor i in range (len(t)):\r\n if t[i]=='0':\r\n print(t[:i]+t[i+1:])\r\n break\r\n elif i==len(t)-1 and t[i]!='0':\r\n print(t[0:len(t)-1])\r\n", "s=input()\r\ns=list(s)\r\nwhile(True):\r\n if(s.count(\"0\")==1 and s[len(s)-1]==\"0\"):\r\n s.remove(\"0\")\r\n break\r\n if(s.count(\"1\")==len(s)):\r\n s.remove(\"1\")\r\n break\r\n if(s.count(\"0\")==len(s)):\r\n s.remove(\"0\")\r\n break\r\n if(True):\r\n s.remove(\"0\")\r\n break\r\nprint(\"\".join(s))\r\n \r\n \r\n", "s=input()\r\nA=[]\r\nfor i in s:\r\n A.append(i)\r\nif(len(set(s))==1):\r\n print(s[:-1])\r\nelse:\r\n for i in range(len(A)):\r\n if(A[i]=='0'):\r\n A.remove(A[i])\r\n break\r\n print(\"\".join(A))", "def main():\r\n num = input()\r\n for i, c in enumerate(num):\r\n if c == '0':\r\n print(num[:i] + num[i+1:])\r\n return\r\n print(num[:-1])\r\n\r\nmain() ", "s=list(input())\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n break\r\ndel(s[i])\r\nprint(\"\".join(s))\r\n", "a = list(input())\r\nfor elem in a:\r\n if elem == '0':\r\n a.remove('0')\r\n break\r\nelse:\r\n a.remove(a[0])\r\n\r\nprint(*a,sep='')\r\n", "s = input()\nans, cnt = \"\", False\n\nfor l in s:\n if l == \"0\" and not cnt:\n cnt = True\n else:\n ans += l\n\nprint(ans if cnt else s[1:])\n\n \t\t\t\t\t \t \t\t\t \t \t \t \t \t \t\t\t", "n=input()\r\nl=len(n)\r\nfor idx in range(l):\r\n if(n[idx]=='0'):\r\n break\r\nprint(n[:idx]+n[idx+1:])", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\ns=input()\r\nz=0\r\nans=''\r\nfor i in s:\r\n if z==0:\r\n if i=='0':\r\n z+=1\r\n else:ans+=i\r\n else:ans+=i\r\nif z==0:\r\n print(s[1:])\r\nelse:\r\n print(ans)", "x=input()\r\nif \"0\" in x:\r\n print(x.replace(\"0\",\"\",1))\r\nelse:\r\n print(x.replace(\"1\",\"\",1))", "inp = input()\r\ns = (list)(inp)\r\no = list()\r\nz = list()\r\nk = 0\r\nfor i in s :\r\n if i == '1' :\r\n o.append(k)\r\n else :\r\n z.append(k)\r\n k += 1\r\no.sort()\r\nz.sort()\r\nif(len(z)==0):\r\n del s[o[len(o)-1] : o[len(o)-1]+1]\r\nelse :\r\n del s[z[0] : z[0]+1]\r\nans = ''.join([str(ele) for ele in s])\r\nprint(ans)\r\n", "s = input()\r\nz = max(0, s.find('0'))\r\nprint(s[:z]+s[z+1:])", "a=input()\r\na=list(a )\r\nb=len(a)\r\nfor i in range(len(a)-1):\r\n #print(i,a)\r\n if a[i]==\"1\" and a[i+1]==\"0\":\r\n a.pop(i+1)\r\n break\r\nif b==len(a):\r\n a.pop(0)\r\na=\"\".join(a)\r\nprint(a)", "s=list(input())\r\nif '0' in s:\r\n s.pop(s.index('0'))\r\n print(''.join(s))\r\nelse:\r\n print(''.join(s[1:]))", "import sys\r\ndef little_elephant_and_bits():\r\n a=int(input())\r\n b=list(str(a))\r\n if len(set(b))==1:\r\n s=''\r\n b.remove('1')\r\n for i in range(len(b)):\r\n s+=b[i]\r\n print(s)\r\n sys.exit()\r\n else:\r\n for i in b:\r\n if i=='0':\r\n b.remove(i)\r\n break\r\n s=''\r\n for j in range(len(b)):\r\n s+=b[j]\r\n print(s)\r\nlittle_elephant_and_bits()\r\n", "s=list(map(str,input()))\r\nch=0\r\ntry:\r\n s.remove(\"0\")\r\n print(*s, sep=\"\")\r\nexcept ValueError:\r\n s.remove(\"1\")\r\n print(*s,sep=\"\")", "a=list(input())\r\nif \"0\" in a:\r\n\ta.remove(\"0\")\r\nelse:\r\n\ta.pop()\r\nprint(*a,sep=\"\")", "a=list(map(int,input()))\r\nz=-1\r\nfor i in range(0,len(a)):\r\n if(a[i]==0):\r\n a.pop(i);\r\n z=i;\r\n break;\r\n\r\nif(z==-1):\r\n for i in range(len(a)-1,-1,-1):\r\n if(a[i]==1):\r\n a.pop(i);\r\n z=i;\r\n break;\r\n\r\nprint(*a,sep=''); " ]

[ "import math\n\nm,R = map (int,input().split())\n\nD = math.sqrt (2) * R\nresult = 0\n\ndef sum_dist (n):\n return n*(n+1)*R + 2*D*n\n\nfor i in range (1,m+1):\n result += 2*R\n if i-1 > 0: result += 2*R + D\n if m-i > 0: result += 2*R + D\n if i-2 > 0: result += sum_dist (i-2)\n if m-i-1 > 0: result += sum_dist (m-i-1)\n\nprint (result / m / m)\n", "import math\r\n\r\nm,R = map (int,input().split())\r\n\r\nD = math.sqrt (2) * R\r\nresult = 0\r\n\r\ndef sum_dist (n):\r\n return n*(n+1)*R + 2*D*n\r\n\r\nfor i in range (1,m+1):\r\n result += 2*R\r\n if i-1 > 0: result += 2*R + D\r\n if m-i > 0: result += 2*R + D\r\n if i-2 > 0: result += sum_dist (i-2)\r\n if m-i-1 > 0: result += sum_dist (m-i-1)\r\n\r\nprint (result / m / m)", "m,R = [int(x) for x in input().split()]\r\n\r\nif m == 1:\r\n print(2*R)\r\nelse:\r\n tot = 0\r\n for i in range(m):\r\n tot += 2\r\n if i == 0 or i == m-1:\r\n tot += 2+2**.5\r\n tot += (m-2)*(m-1)\r\n tot += 2*2**.5*(m-2)\r\n else:\r\n tot += 4+2*2**.5\r\n tot += i*(i-1)\r\n tot += (m-i-1)*(m-i-2)\r\n tot += 2*2**.5*(m-3)\r\n #print(i,tot)\r\n tot *= R\r\n tot /= m*m\r\n print(tot)\r\n\r\n##print(\r\n##print(R*(2+(1+2**.5+(2*m-1)/3)*(m-1))/m)\r\n##print(R*(1+m+m*2**.5-2**.5+(2*m*m/3)-m+1/3)/m)\r\n##print(R*(1/m+2**.5-(2**.5)/m+2*m/3+1/3))\r\n##print(R/m+R*2**.5-(R*2**.5)/m+2*R*m/3+R/3)\r\n", "#!/usr/bin/env python3\nfrom math import sqrt\nm, r = map(int,input().split())\nacc = 0.0\nfor i in range(m):\n acc += 2*r\n for j in [i,m-i-1]:\n if j:\n acc += (2 + sqrt(2)) * r\n acc += (2*(j-1)*j/2 + 2*sqrt(2)*(j-1)) * r\nprint('%.12f' % (acc/(m**2)))\n", "m, r = map(int, input().split())\r\n\r\ndef calc(k):\r\n global r\r\n if k < 1:\r\n return 0\r\n elif k == 1:\r\n return r * (2**0.5 + 2)\r\n else:\r\n return r * ((1 + 2 * (k - 1)) * 2**0.5 + k * 2 + (k - 1) * (k - 2))\r\n\r\navg = 0\r\ndiv = m ** 2\r\n\r\nfor i in range(0, m):\r\n avg += (2 * r + calc(i) + calc(m - 1 - i)) / div\r\n \r\nprint(avg)\r\n", "m,R=map(int, input().split())\nprint((2*m/3-2+22/m/3-4/m/m+2**.5*(2-4/m+2/m/m))*R)", "m, r = map(int, input().split())\r\nprint(2 * r * (m + (2 + 2 ** 0.5) * (m - 1) + (m - 1) * (m - 2) * (m / 3 + 2 ** 0.5)) / (m * m))", "import math\r\nm, r = map(int, input().split())\r\ndis = [0.0] * 100005\r\ns = [0.0] * 100005\r\ndis[0] = r * 2.0\r\ndis[1] = r * 2.0 + r * math.sqrt(2.0)\r\ndis[2] = r * 2.0 + 2 * r * math.sqrt(2.0)\r\nfor i in range(3, m + 1):\r\n dis[i] = dis[i - 1] + r * 2.0\r\ns[0] = dis[0]\r\nfor i in range(1, m + 1):\r\n s[i] = s[i - 1] + dis[i]\r\nS = 0.0\r\nfor i in range(1, m + 1):\r\n Now = s[i - 1] + s[m - i] - dis[0]\r\n Now /= float(m)\r\n S += Now\r\nS /= float(m)\r\nprint(\"%.10lf\" % S)# 1691765216.6397774", "m, r = map(int, input().split())\r\n\r\ndef calc(k):\r\n if k < 1:\r\n return 0\r\n else:\r\n return (1 + 2 * (k - 1)) * 2**0.5 + k * 2 + (k - 1) * (k - 2)\r\n\r\navg = 0\r\ndiv = m ** 2\r\n\r\nfor i in range(0, m):\r\n avg += r * (2 + calc(i) + calc(m - 1 - i)) / div\r\n \r\nprint(avg)\r\n" ]

[ "import sys\r\nreadline=sys.stdin.readline\r\n\r\nclass Graph:\r\n def __init__(self,V,edges=False,graph=False,directed=False,weighted=False,inf=float(\"inf\")):\r\n self.V=V\r\n self.directed=directed\r\n self.weighted=weighted\r\n self.inf=inf\r\n if graph:\r\n self.graph=graph\r\n self.edges=[]\r\n for i in range(self.V):\r\n if self.weighted:\r\n for j,d in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j,d))\r\n else:\r\n for j in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j))\r\n else:\r\n self.edges=edges\r\n self.graph=[[] for i in range(self.V)]\r\n if weighted:\r\n for i,j,d in self.edges:\r\n self.graph[i].append((j,d))\r\n if not self.directed:\r\n self.graph[j].append((i,d))\r\n else:\r\n for i,j in self.edges:\r\n self.graph[i].append(j)\r\n if not self.directed:\r\n self.graph[j].append(i)\r\n\r\n def SIV_DFS(self,s,bipartite_graph=False,cycle_detection=False,directed_acyclic=False,euler_tour=False,linked_components=False,lowlink=False,parents=False,postorder=False,preorder=False,subtree_size=False,topological_sort=False,unweighted_dist=False,weighted_dist=False):\r\n seen=[False]*self.V\r\n finished=[False]*self.V\r\n if directed_acyclic or cycle_detection or topological_sort:\r\n dag=True\r\n if euler_tour:\r\n et=[]\r\n if linked_components:\r\n lc=[]\r\n if lowlink:\r\n order=[None]*self.V\r\n ll=[None]*self.V\r\n idx=0\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps=[None]*self.V\r\n if postorder or topological_sort:\r\n post=[]\r\n if preorder:\r\n pre=[]\r\n if subtree_size:\r\n ss=[1]*self.V\r\n if unweighted_dist or bipartite_graph:\r\n uwd=[self.inf]*self.V\r\n uwd[s]=0\r\n if weighted_dist:\r\n wd=[self.inf]*self.V\r\n wd[s]=0\r\n stack=[(s,0)] if self.weighted else [s]\r\n while stack:\r\n if self.weighted:\r\n x,d=stack.pop()\r\n else:\r\n x=stack.pop()\r\n if not seen[x]:\r\n seen[x]=True\r\n stack.append((x,d) if self.weighted else x)\r\n if euler_tour:\r\n et.append(x)\r\n if linked_components:\r\n lc.append(x)\r\n if lowlink:\r\n order[x]=idx\r\n ll[x]=idx\r\n idx+=1\r\n if preorder:\r\n pre.append(x)\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if not seen[y]:\r\n stack.append((y,d) if self.weighted else y)\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps[y]=x\r\n if unweighted_dist or bipartite_graph:\r\n uwd[y]=uwd[x]+1\r\n if weighted_dist:\r\n wd[y]=wd[x]+d\r\n elif not finished[y]:\r\n if (directed_acyclic or cycle_detection or topological_sort) and dag:\r\n dag=False\r\n if cycle_detection:\r\n cd=(y,x)\r\n elif not finished[x]:\r\n finished[x]=True\r\n if euler_tour:\r\n et.append(~x)\r\n if lowlink:\r\n bl=True\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if ps[x]==y and bl:\r\n bl=False\r\n continue\r\n ll[x]=min(ll[x],order[y])\r\n if x!=s:\r\n ll[ps[x]]=min(ll[ps[x]],ll[x])\r\n if postorder or topological_sort:\r\n post.append(x)\r\n if subtree_size:\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if y==ps[x]:\r\n continue\r\n ss[x]+=ss[y]\r\n if bipartite_graph:\r\n bg=[[],[]]\r\n for tpl in self.edges:\r\n x,y=tpl[:2] if self.weighted else tpl\r\n if uwd[x]==self.inf or uwd[y]==self.inf:\r\n continue\r\n if not uwd[x]%2^uwd[y]%2:\r\n bg=False\r\n break\r\n else:\r\n for x in range(self.V):\r\n if uwd[x]==self.inf:\r\n continue\r\n bg[uwd[x]%2].append(x)\r\n retu=()\r\n if bipartite_graph:\r\n retu+=(bg,)\r\n if cycle_detection:\r\n if dag:\r\n cd=[]\r\n else:\r\n y,x=cd\r\n cd=self.Route_Restoration(y,x,ps)\r\n retu+=(cd,)\r\n if directed_acyclic:\r\n retu+=(dag,)\r\n if euler_tour:\r\n retu+=(et,)\r\n if linked_components:\r\n retu+=(lc,)\r\n if lowlink:\r\n retu=(ll,)\r\n if parents:\r\n retu+=(ps,)\r\n if postorder:\r\n retu+=(post,)\r\n if preorder:\r\n retu+=(pre,)\r\n if subtree_size:\r\n retu+=(ss,)\r\n if topological_sort:\r\n if dag:\r\n tp_sort=post[::-1]\r\n else:\r\n tp_sort=[]\r\n retu+=(tp_sort,)\r\n if unweighted_dist:\r\n retu+=(uwd,)\r\n if weighted_dist:\r\n retu+=(wd,)\r\n if len(retu)==1:\r\n retu=retu[0]\r\n return retu\r\n\r\nN,K=map(int,readline().split())\r\nedges=[]\r\nidx={}\r\nfor i in range(N-1):\r\n u,v=map(int,readline().split())\r\n u-=1;v-=1\r\n if u>v:\r\n u,v=v,u\r\n edges.append((u,v))\r\n idx[(u,v)]=i\r\nG=Graph(N,edges=edges)\r\nparents,tour=G.SIV_DFS(0,parents=True,postorder=True)\r\nDP=[None]*N\r\ninf=1<<30\r\nchild=[[y for y in G.graph[x] if y!=parents[x]] for x in range(N)]\r\nfor x in tour:\r\n DP[x]=[inf,0]\r\n for y in child[x]:\r\n prev=DP[x]\r\n DP[x]=[inf]*(len(prev)+len(DP[y])-1)\r\n for i in range(len(prev)):\r\n for j in range(len(DP[y])):\r\n DP[x][i+j]=min(DP[x][i+j],prev[i]+DP[y][j])\r\n DP[x][0]=1\r\nans=inf\r\np=None\r\nfor x in range(N):\r\n if len(DP[x])>K:\r\n if ans>DP[x][K]+(x>=1):\r\n ans=DP[x][K]+(x>=1)\r\n p=x\r\ndef solve(x,K,ans):\r\n a=ans\r\n KK=K\r\n if ans==0:\r\n retu=[]\r\n elif K==0:\r\n u,v=x,parents[x]\r\n if u>v:\r\n u,v=v,u\r\n retu=[idx[(u,v)]]\r\n else:\r\n dp=[[inf,0]]\r\n for y in child[x]:\r\n dp.append([inf]*(len(dp[-1])+len(DP[y])-1))\r\n for i in range(len(dp[-2])):\r\n for j in range(len(DP[y])):\r\n dp[-1][i+j]=min(dp[-1][i+j],dp[-2][i]+DP[y][j])\r\n retu=[]\r\n for i in range(len(child[x])-1,-1,-1):\r\n y=child[x][i]\r\n for j in range(max(0,K-len(DP[y])+1),len(dp[i])):\r\n if dp[i+1][K]==dp[i][j]+DP[y][K-j]:\r\n retu+=solve(y,K-j,DP[y][K-j])\r\n K=j\r\n break\r\n else:\r\n assert False\r\n return retu\r\nif p:\r\n ans-=1\r\nans_lst=solve(p,K,ans)\r\nif p:\r\n u,v=p,parents[p]\r\n if u>v:\r\n u,v=v,u\r\n ans_lst.append(idx[(u,v)])\r\n ans+=1\r\nfor i in range(ans):\r\n ans_lst[i]+=1\r\nprint(ans)\r\nprint(*ans_lst)" ]

[ "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\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()\n\n\ndef main():\n n = I()\n a = set()\n b = set()\n for _ in range(n):\n f,t = LS()\n if t == '0':\n b.add(f)\n else:\n a.add(f)\n al = len(a)\n bl = len(b)\n r = []\n ta = set([str(i) for i in range(1,al+1)])\n tb = set([str(i) for i in range(al+1,al+bl+1)])\n bb = tb & b\n b -= bb\n tb -= bb\n aa = ta & a\n a -= aa\n ta -= aa\n\n ua = a & tb\n ub = b & ta\n sa = ta - b\n sb = tb - a\n ran = 'iehn00'\n while ua or ub:\n if not sa and not sb:\n if ua:\n t = ua.pop()\n sb.add(t)\n a.remove(t)\n a.add(ran)\n else:\n t = ub.pop()\n sa.add(t)\n b.remove(t)\n b.add(ran)\n r.append('move {} {}'.format(t, ran))\n if sa:\n t = sa.pop()\n if ua:\n k = ua.pop()\n a.remove(k)\n sb.add(k)\n else:\n k = a.pop()\n ta.remove(t)\n r.append('move {} {}'.format(k, t))\n if sb:\n t = sb.pop()\n if ub:\n k = ub.pop()\n b.remove(k)\n sa.add(k)\n else:\n k = b.pop()\n tb.remove(t)\n r.append('move {} {}'.format(k, t))\n\n while a:\n k = a.pop()\n t = ta.pop()\n r.append('move {} {}'.format(k, t))\n\n while b:\n k = b.pop()\n t = tb.pop()\n r.append('move {} {}'.format(k, t))\n\n return '{}\\n'.format(len(r)) + '\\n'.join(r)\n\n\n\n\nprint(main())\n\n\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "if __name__ == '__main__':\r\n n = int(input())\r\n s = []\r\n t = []\r\n isvalid = []\r\n K = 0\r\n for i in range(n):\r\n str, type = input().split()\r\n s.append(str)\r\n t.append(int(type))\r\n if type == \"1\":\r\n K += 1\r\n\r\n vis = [0] * n\r\n\r\n jiu1 = []\r\n jiu2 = []\r\n que = []\r\n dog1 = []\r\n dog2 = []\r\n isFalse = 0\r\n\r\n for i in range(n):\r\n if s[i][0] == '0':\r\n isFalse = 1\r\n if t[i] == 1:\r\n dog1.append(s[i])\r\n else:\r\n dog2.append(s[i])\r\n continue\r\n try:\r\n s[i] = int(s[i])\r\n if 1 <= s[i] <= n:\r\n if t[i] == 1:\r\n if s[i] <= K:\r\n pass\r\n else:\r\n jiu2.append(s[i])\r\n else:\r\n if s[i] > K:\r\n pass\r\n else:\r\n jiu1.append(s[i])\r\n vis[s[i] - 1] = 1\r\n\r\n else:\r\n isFalse = 1\r\n if t[i] == 1:\r\n dog1.append(s[i])\r\n else:\r\n dog2.append(s[i])\r\n except:\r\n if t[i] == 1:\r\n dog1.append(s[i])\r\n else:\r\n dog2.append(s[i])\r\n\r\n\r\n for i in range(n):\r\n if not vis[i]:\r\n que.append(i)\r\n\r\n ans = len(jiu1) + len(jiu2) + len(dog1) + len(dog2)\r\n # print(jiu1, jiu2, dog1, dog2)\r\n # exit(0)\r\n ismove = 0\r\n if not que:\r\n if len(jiu1) + len(jiu2) == 0:\r\n print(\"0\")\r\n exit(0)\r\n ans += 1\r\n ismove = 1\r\n print(ans)\r\n if len(jiu1):\r\n dog2.append(\"cnmlgb\")\r\n que.append(jiu1[-1] - 1)\r\n print(f\"move {jiu1[-1]} cnmlgb\")\r\n jiu1.pop()\r\n\r\n else:\r\n dog1.append(\"cnmlgb\")\r\n que.append(jiu2[-1] - 1)\r\n print(f\"move {jiu2[-1]} cnmlgb\")\r\n jiu2.pop()\r\n\r\n if ismove == 0:\r\n print(ans)\r\n\r\n while que:\r\n target = que[-1]\r\n que.pop()\r\n source = 0\r\n if target <= K - 1:\r\n if jiu2:\r\n source = jiu2[-1]\r\n que.append(source - 1)\r\n jiu2.pop()\r\n else:\r\n source = dog1[-1]\r\n dog1.pop()\r\n else:\r\n if jiu1:\r\n source = jiu1[-1]\r\n que.append(source - 1)\r\n jiu1.pop()\r\n else:\r\n source = dog2[-1]\r\n dog2.pop()\r\n\r\n print(f\"move {source} {target + 1}\")\r\n", "n = int(input())\r\nt = [1] + [0] * n\r\nb, a = d = [], []\r\nh, s = [], []\r\n\r\nfor i in range(n):\r\n f, k = input().split()\r\n d[int(k)].append(f)\r\n\r\nm = len(a)\r\nfor i in a:\r\n if i.isdigit() and i[0] != '0':\r\n j = int(i)\r\n if 0 < j <= m:\r\n t[j] = 1\r\n elif m < j <= n:\r\n t[j] = -1\r\n else:\r\n s.append(i)\r\n else:\r\n s.append(i)\r\nfor i in b:\r\n if i.isdigit() and i[0] != '0':\r\n j = int(i)\r\n if m < j <= n:\r\n t[j] = 1\r\n elif 0 < j <= m:\r\n t[j] = -1\r\n else:\r\n s.append(i)\r\n else:\r\n s.append(i)\r\n\r\nx = [j for j in range(1, m + 1) if t[j] < 0]\r\ny = [j for j in range(m + 1, n + 1) if t[j] < 0]\r\n\r\nu = [j for j in range(1, m + 1) if not t[j]]\r\nv = [j for j in range(m + 1, n + 1) if not t[j]]\r\n\r\nif not s and (x or y):\r\n s = ['0']\r\n if y:\r\n i = y.pop()\r\n v.append(i)\r\n else:\r\n i = x.pop()\r\n u.append(i)\r\n h.append(str(i) + ' 0')\r\n t[i] = 0\r\n\r\nwhile x or y:\r\n if v and x:\r\n i = x.pop()\r\n j = v.pop()\r\n t[j] = 1\r\n h.append(str(i) + ' ' + str(j))\r\n u.append(i)\r\n else:\r\n u, v, x, y = v, u, y, x\r\n\r\nk = 1\r\nfor j in s:\r\n while t[k] == 1: k += 1\r\n h.append(j + ' ' + str(k))\r\n k += 1\r\n\r\nd = '\\nmove '\r\nprint(str(len(h)) + d + d.join(h) if h else 0)" ]

[ "#!/usr/bin/env python3\n\nboard = []\nn, m = 0, 0\n\ndef rotate(x, y):\n if board[x][y] == 'L':\n board[x][y] = board[x][y+1] = 'U'\n board[x+1][y] = board[x+1][y+1] = 'D'\n else:\n board[x][y] = board[x+1][y] = 'L'\n board[x][y+1] = board[x+1][y+1] = 'R'\n\ndef fix(x, y, moves):\n if board[x+1][y] == 'U':\n if board[x+1][y+1] == 'L':\n fix(x+1, y+1, moves)\n rotate(x+1, y)\n moves.append((x+2, y+1))\n rotate(x, y)\n moves.append((x+1, y+1))\n\ndef solve_board(moves):\n global board, n, m\n board = []\n for _ in range(n):\n board.append(list(input()))\n for i in range(n-1):\n for j in range(m):\n if board[i][j] == 'L':\n fix(i, j, moves)\n\ndef main():\n global n, m\n n, m = map(int, input().split())\n moves1 = []; moves2 = []\n solve_board(moves1)\n solve_board(moves2)\n print(len(moves1) + len(moves2))\n for move in moves1:\n print(str(move[0]) + ' ' + str(move[1]))\n for move in reversed(moves2):\n print(str(move[0]) + ' ' + str(move[1]))\n\nif __name__ == '__main__':\n main()" ]

[ "n = int(input())\r\na = input()\r\nb = input()\r\nai = 0\r\nalen = len(a)\r\nbi = 0\r\nblen = len(b)\r\nnik = 0\r\npol = 0\r\nif alen == blen: rnd = alen\r\nelse: rnd = alen*blen\r\nnumofrounds = 0\r\nfor i in range(n):\r\n #print(i,rnd)\r\n if i == rnd:\r\n numofrounds = n//rnd\r\n # print(numofrounds)\r\n nik *= numofrounds\r\n pol *= numofrounds\r\n break\r\n #print(a[ai%alen], b[bi%blen])\r\n if a[ai] == b[bi]: pass\r\n elif (a[ai] == 'R' and b[bi] == 'S') or (a[ai] == 'S'\r\n and b[bi] == 'P') or (a[ai] == 'P' and b[bi] == 'R'):\r\n pol += 1\r\n else: nik += 1\r\n ai = (ai+1)%alen\r\n bi = (bi+1)%blen\r\nif n%rnd != 0 and numofrounds != 0:\r\n n -= rnd*numofrounds\r\n ai = 0\r\n bi = 0\r\n for i in range(n):\r\n if a[ai] == b[bi]: pass\r\n elif (a[ai] == 'R' and b[bi] == 'S') or (a[ai] == 'S'\r\n and b[bi] == 'P') or (a[ai] == 'P' and b[bi] == 'R'):\r\n pol += 1\r\n else: nik += 1\r\n ai = (ai+1)%alen\r\n bi = (bi+1)%blen\r\nprint(nik, pol) ", "def gcd(a, b):\r\n if a < b:\r\n a, b = b, a\r\n while b > 0:\r\n c = a % b\r\n a = b\r\n b = c\r\n return a\r\n\r\nn = int(input())\r\nc1 = input()\r\nc2 = input()\r\nn1 = len(c1)\r\nn2 = len(c2)\r\nmul = n1 * n2 // gcd(n1, n2)\r\nrem = n % mul\r\ntim = n // mul\r\nans1 = 0\r\nans2 = 0\r\nk1 = 0\r\nk2 = 0\r\n\r\nfor i in range(1, mul + 1):\r\n if (c1[k1] == 'R' and c2[k2] == 'P') or (c1[k1] == 'P' and c2[k2] == 'S') or (c1[k1] == 'S' and c2[k2] == 'R'):\r\n ans1 += 1\r\n elif (c1[k1] == 'P' and c2[k2] == 'R') or (c1[k1] == 'S' and c2[k2] == 'P') or (c1[k1] == 'R' and c2[k2] == 'S'):\r\n ans2 += 1\r\n k1 += 1\r\n k2 += 1\r\n if k1 == n1:\r\n k1 = 0\r\n if k2 == n2:\r\n k2 = 0\r\n\r\nans1 *= tim\r\nans2 *= tim\r\n\r\nfor i in range(1, rem + 1):\r\n if (c1[k1] == 'R' and c2[k2] == 'P') or (c1[k1] == 'P' and c2[k2] == 'S') or (c1[k1] == 'S' and c2[k2] == 'R'):\r\n ans1 += 1\r\n elif (c1[k1] == 'P' and c2[k2] == 'R') or (c1[k1] == 'S' and c2[k2] == 'P') or (c1[k1] == 'R' and c2[k2] == 'S'):\r\n ans2 += 1\r\n k1 += 1\r\n k2 += 1\r\n if k1 == n1:\r\n k1 = 0\r\n if k2 == n2:\r\n k2 = 0\r\n\r\nprint(ans1, ans2)\r\n", "from random import getrandbits, randrange\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nimport sys\r\nfrom math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf, cos, sin\r\nfrom copy import deepcopy, copy\r\nfrom collections import Counter, deque, defaultdict\r\nfrom heapq import heapify, heappop, heappush\r\nfrom itertools import (\r\n accumulate,\r\n product,\r\n combinations,\r\n combinations_with_replacement,\r\n permutations,\r\n)\r\nfrom bisect import bisect, bisect_left, bisect_right\r\nfrom functools import lru_cache, reduce\r\nfrom decimal import Decimal, getcontext\r\nfrom typing import List, Tuple, Optional\r\n\r\n\r\ninf = float(\"inf\")\r\n\r\n\r\ndef ceil_div(a, b):\r\n return (a + b - 1) // b\r\n\r\n\r\ndef isqrt(x):\r\n return int(sqrt(x))\r\n\r\n\r\ndef int1(s):\r\n return int(s) - 1\r\n\r\n\r\nimport sys\r\nimport os\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\nprint = lambda *args, end=\"\\n\", sep=\" \": sys.stdout.write(\r\n sep.join(map(str, args)) + end\r\n)\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ndef yes(res):\r\n return print(\"Yes\" if res else \"No\")\r\n\r\n\r\ndef YES(res):\r\n return print(\"YES\" if res else \"NO\")\r\n\r\n\r\nclass Debug:\r\n def __init__(self, debug=False):\r\n self.debug = debug\r\n\r\n def get_ic(self):\r\n if self.debug:\r\n from icecream import ic\r\n\r\n return ic\r\n else:\r\n return lambda *args, **kwargs: ...\r\n\r\n\r\nic = Debug(False).get_ic()\r\n\r\nn = II()\r\na = input()\r\nb = input()\r\nna = len(a)\r\nnb = len(b)\r\ng = gcd(na, nb)\r\nlcm_ = na * nb // g\r\na = a * (lcm_ // na)\r\nb = b * (lcm_ // nb)\r\n\r\n\r\nx, y = divmod(n, lcm_)\r\nt0 = [0] * (lcm_ + 1)\r\nt1 = [0] * (lcm_ + 1)\r\nfor i in range(lcm_):\r\n ai, bi = a[i], b[i]\r\n sa = sb = False\r\n if ai == \"R\" and bi == \"S\":\r\n sa = True\r\n elif ai == \"S\" and bi == \"P\":\r\n sa = True\r\n elif ai == \"P\" and bi == \"R\":\r\n sa = True\r\n if ai == \"R\" and bi == \"P\":\r\n sb = True\r\n elif ai == \"P\" and bi == \"S\":\r\n sb = True\r\n elif ai == \"S\" and bi == \"R\":\r\n sb = True\r\n if sb:\r\n t0[i + 1] = t0[i] + 1\r\n else:\r\n t0[i + 1] = t0[i]\r\n if sa:\r\n t1[i + 1] = t1[i] + 1\r\n else:\r\n t1[i + 1] = t1[i]\r\n\r\n\r\nresa = resb = 0\r\nresa += x * t0[-1] + t0[y]\r\nresb += x * t1[-1] + t1[y]\r\nprint(resa, resb)\r\n", "n=int(input())\r\nfinale=[]\r\nco=0;fco=0;\r\ns=input()\r\ns1=input()\r\nssize=len(s)\r\ns1size=len(s1)\r\ns=s1size*s\r\ns1=ssize*s1\r\nfor i in range(0,len(s)):\r\n if (s[i]=='R' and s1[i]=='P'):\r\n fco+=1\r\n if (s[i]=='R' and s1[i]=='S'):\r\n co+=1\r\n if (s[i]=='S' and s1[i]=='P'):\r\n co+=1\r\n if (s[i]=='S' and s1[i]=='R'):\r\n fco+=1\r\n if (s[i]=='P' and s1[i]=='S'):\r\n fco+=1\r\n if (s[i]=='P' and s1[i]=='R'):\r\n co+=1\r\n finale.append((co,fco))\r\nif(len(s)>=n):\r\n co1=finale[n-1][0]\r\n fco1=finale[n-1][1]\r\nelse:\r\n co1=n//len(s);\r\n co1*=finale[len(s)-1][0]\r\n if n%len(s)!=0:\r\n co1+=finale[((n)%(len(s)))-1][0]\r\n fco1=n//len(s);\r\n fco1*=finale[len(s)-1][1]\r\n if n%len(s)!=0:\r\n fco1+=finale[((n)%(len(s)))-1][1]\r\nprint(fco1,\" \",co1)\r\n \r\n", "import math\r\nimport itertools as it\r\n\r\n\r\nn = int(input())\r\na, b = input(), input()\r\nlcm = len(a) // math.gcd(len(a), len(b)) * len(b)\r\na, b = it.cycle(a), it.cycle(b)\r\nres = {'RR': 0, 'SS': 0, 'PP': 0, 'RS': 'P', 'SP': 'P', 'PR': 'P', 'RP': 'N', 'SR': 'N', 'PS': 'N'}\r\n\r\nv = []\r\nfor i in range(min(lcm, n)):\r\n v.append(res[next(a) + next(b)])\r\n\r\nans = [v.count('N'), v.count('P')]\r\nif n > lcm:\r\n ans[0] *= n // lcm\r\n ans[0] += v[: n % lcm].count('N')\r\n ans[1] *= n // lcm\r\n ans[1] += v[: n % lcm].count('P')\r\n\r\nprint(*ans)", "def co(x,y,s):\r\n if x==y:return 0\r\n z=(x==\"P\" and y==\"R\") or (x==\"S\" and y==\"P\") or (x==\"R\" and y==\"S\")\r\n if s:return int(z)\r\n return int(not z)\r\nfrom math import gcd as gh\r\na=int(input());b=input();c=input()\r\nb1=len(b);c1=len(c)\r\nz=((b1*c1)//gh(b1,c1))\r\nw=[0]*(z+1);w1=[0]*(z+1)\r\nfor i in range(1,z+1):\r\n w[i]=co(b[(i-1)%b1],c[(i-1)%c1],0)+w[i-1]\r\n w1[i]=co(b[(i-1)%b1],c[(i-1)%c1],1)+w1[i-1]\r\nprint(w[-1]*(a//z)+w[a%z],w1[-1]*(a//z)+w1[a%z])", "from __future__ import annotations\r\n\r\nimport heapq # noqa\r\nimport math # noqa\r\nimport queue # noqa\r\nimport sys\r\nfrom collections import Counter, defaultdict # noqa\r\nfrom copy import deepcopy # noqa\r\nfrom itertools import permutations # noqa\r\nfrom functools import lru_cache # noqa\r\nfrom typing import Iterator # noqa\r\n\r\n# rewrite input\r\nuser_input = sys.stdin.readline\r\n\r\n# allow big recursion\r\nsys.setrecursionlimit(2 * 10 ** 9)\r\n\r\n# Magic no recursion\r\nfrom types import GeneratorType # noqa\r\ndef bootstrap(f, stack=[]): # noqa\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n 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 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\ndef get_int() -> int:\r\n # This function gets an integer input from the user.\r\n return int(user_input())\r\n\r\ndef line_integers() -> list[int]:\r\n # This function gets a line of integers separated by spaces, finally returning all of them as a list.\r\n return list(map(int, user_input().split()))\r\n\r\ndef get_string(as_list: bool = False) -> str | list[str]:\r\n # This function gets a string from the user and converts it to a list of characters.\r\n input_string = user_input()\r\n if as_list:\r\n return list(input_string[: len(input_string) - 1])\r\n else:\r\n return input_string[: len(input_string) - 1]\r\n\r\ndef invr() -> Iterator[int]:\r\n # This function gets a line of input from the user, splits it by spaces, and converts each of the\r\n # resulting parts to an integer. It returns a map object, which can be iterated over to access the integers.\r\n # Note:\r\n # You can't directly access elements from a map object by index like you can with a list. However, you can iterate\r\n # through the map object, or convert it into a list or tuple if necessary. Map objects can be more memory-efficient\r\n # than lists when dealing with large amounts of data because they generate items on-the-fly and do not need to store\r\n # all values in memory like lists do. However, they can only be iterated over once. After you've gone through all\r\n # the items in a map object, you can't go through them again without recreating the map object.\r\n return map(int, user_input().split())\r\n\r\ndef partitions(partitions_n: int):\r\n partitions_a = [0 for _ in range(partitions_n + 1)]\r\n k_ = 1\r\n y_ = partitions_n - 1\r\n while k_ != 0:\r\n x_ = partitions_a[k_ - 1] + 1\r\n k_ -= 1\r\n while 2 * x_ <= y_:\r\n partitions_a[k_] = x_\r\n y_ -= x_\r\n k_ += 1\r\n l_ = k_ + 1\r\n while x_ <= y_:\r\n partitions_a[k_] = x_\r\n partitions_a[l_] = y_\r\n yield partitions_a[: k_ + 2]\r\n x_ += 1\r\n y_ -= 1\r\n partitions_a[k_] = x_ + y_\r\n y_ = x_ + y_ - 1\r\n yield partitions_a[: k_ + 1]\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n_rounds: int = get_int()\r\n a: list[str] = get_string(as_list=True)\r\n b: list[str] = get_string(as_list=True)\r\n m: int = len(a)\r\n k: int = len(b)\r\n\r\n # Smallest number divisible by m and k\r\n lcm: int = m * k // math.gcd(m, k)\r\n\r\n game: int\r\n nikephoros: int = 0\r\n polycarpus: int = 0\r\n for game in range(lcm):\r\n if a[game % m] == \"R\" and b[game % k] == \"S\":\r\n polycarpus += 1\r\n elif a[game % m] == \"S\" and b[game % k] == \"P\":\r\n polycarpus += 1\r\n elif a[game % m] == \"P\" and b[game % k] == \"R\":\r\n polycarpus += 1\r\n elif b[game % k] == \"R\" and a[game % m] == \"S\":\r\n nikephoros += 1\r\n elif b[game % k] == \"S\" and a[game % m] == \"P\":\r\n nikephoros += 1\r\n elif b[game % k] == \"P\" and a[game % m] == \"R\":\r\n nikephoros += 1\r\n else:\r\n pass\r\n\r\n nikephoros = nikephoros * (n_rounds // lcm)\r\n polycarpus = polycarpus * (n_rounds // lcm)\r\n\r\n for game in range(n_rounds % lcm):\r\n if a[game % m] == \"R\" and b[game % k] == \"S\":\r\n polycarpus += 1\r\n elif a[game % m] == \"S\" and b[game % k] == \"P\":\r\n polycarpus += 1\r\n elif a[game % m] == \"P\" and b[game % k] == \"R\":\r\n polycarpus += 1\r\n elif b[game % k] == \"R\" and a[game % m] == \"S\":\r\n nikephoros += 1\r\n elif b[game % k] == \"S\" and a[game % m] == \"P\":\r\n nikephoros += 1\r\n elif b[game % k] == \"P\" and a[game % m] == \"R\":\r\n nikephoros += 1\r\n else:\r\n pass\r\n\r\n print(nikephoros, polycarpus)\r\n", "def gcd(a, b):\n\n c = a % b\n\n return gcd(b, c) if c else b\n\ndef f(k, m, n):\n\n p = {}\n\n for i in range(m * k + 1, 0, -k):\n\n j = m - (i - 1 - n) % m\n\n for d in range(j - n, n, m):\n\n p[d] = i\n\n return p\n\nn, a, b = int(input()), input(), input()\n\nk, m = len(a), len(b)\n\nx, y, g = 0, 0, gcd(k, m)\n\np, q, r = (k * m) // g, f(k, m, 1000), {'S': 'P', 'P': 'R', 'R': 'S'}\n\nfor i in range(k):\n\n for j in range(i % g, m, g):\n\n if a[i] == b[j]: continue\n\n d = (n - q[i - j] - i) // p + 1\n\n if r[a[i]] == b[j]: y += d\n\n else: x += d \n\nprint(x, y) ", "def 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\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n \r\nn_loser, p_loser = 0, 0\r\n\r\nn=int(input())\r\n\r\nplayer_n=input()\r\nplayer_p=input()\r\n\r\na = set(player_n)\r\nb = set(player_p)\r\n\r\nx = len(a)\r\ny = len(b)\r\n\r\nif (a==b and x == y and player_p[:x] == player_n[:y]):\r\n print(0,0)\r\n \r\nelse:\r\n temp = 0\r\n x_n=len(player_n)\r\n x_p = len(player_p)\r\n \r\n lcm_ = lcm(x_n, x_p)\r\n \r\n i=0\r\n \r\n player_n = ((lcm_ // x_n) * player_n)[:n]\r\n player_p = ((lcm_ // x_p)* player_p)[:n]\r\n \r\n for q in range(0, n):\r\n \r\n if player_n[i]==\"P\" and player_p[i]==\"S\":\r\n n_loser += 1\r\n elif player_n[i]==\"P\" and player_p[i]==\"R\":\r\n p_loser += 1\r\n elif player_n[i]==\"R\" and player_p[i]==\"P\":\r\n n_loser += 1\r\n elif player_n[i]==\"R\" and player_p[i]==\"S\":\r\n p_loser += 1\r\n elif player_n[i]==\"S\" and player_p[i]==\"P\":\r\n p_loser += 1\r\n elif player_n[i]==\"S\" and player_p[i]==\"R\":\r\n n_loser += 1\r\n \r\n i+=1\r\n \r\n if (i == lcm_ and temp ==0):\r\n \r\n i = 0\r\n temp = 1\r\n \r\n n_loser = n_loser * (n // lcm_)\r\n p_loser = p_loser * (n // lcm_)\r\n if (n % lcm_ == 0):\r\n break\r\n \r\n elif (i == (n - (lcm_ * (n // lcm_))) and temp==1):\r\n break\r\n \r\n print(n_loser, p_loser)\r\n \r\n", "r = int(input())\r\nnk = input()\r\npk = input()\r\n\r\nnklen, pklen = len(nk), len(pk)\r\n\r\nnk *= ((nklen * pklen) // nklen)\r\npk *= ((nklen * pklen) // pklen)\r\n\r\n\r\nnkb, pkb = 0, 0\r\nfor i in range(len(nk)):\r\n nks, pks = nk[i], pk[i]\r\n if nks == 'R' and pks == 'S':\r\n pkb += 1\r\n elif nks == 'R' and pks == 'P':\r\n nkb += 1\r\n elif nks == 'S' and pks == 'P':\r\n pkb += 1\r\n elif nks == 'S' and pks == 'R':\r\n nkb += 1\r\n elif nks == 'P' and pks == 'R':\r\n pkb += 1\r\n elif nks == 'P' and pks == 'S':\r\n nkb += 1\r\n\r\nln = len(nk)\r\n\r\nnkb *= (r // ln)\r\npkb *= (r // ln)\r\n\r\nnk = nk[:r % ln]\r\npk = pk[:r % ln]\r\n\r\nfor i in range(len(nk)):\r\n nks, pks = nk[i], pk[i]\r\n if nks == 'R' and pks == 'S':\r\n pkb += 1\r\n elif nks == 'R' and pks == 'P':\r\n nkb += 1\r\n elif nks == 'S' and pks == 'P':\r\n pkb += 1\r\n elif nks == 'S' and pks == 'R':\r\n nkb += 1\r\n elif nks == 'P' and pks == 'R':\r\n pkb += 1\r\n elif nks == 'P' and pks == 'S':\r\n nkb += 1\r\n\r\nprint(nkb, pkb)\r\n\r\n\r\n", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nam = sys.stdin.readline()\r\nlam = len(am) - 1\r\nbk = sys.stdin.readline()\r\nlbk = len(bk) - 1\r\n\r\nresam = 0\r\nresbk = 0\r\nx = 0\r\nz = 0\r\n\r\nssr = [(0, 0)]\r\nvv = n\r\nif(lam * lbk < n):\r\n vv = lam * lbk\r\n\r\nfor i in range(vv):\r\n \r\n if(x >= lam):\r\n x = 0\r\n \r\n if(z >= lbk):\r\n z = 0\r\n \r\n if(am[x] == bk[z]):\r\n x += 1\r\n z += 1\r\n ssr.append((resam, resbk))\r\n continue \r\n \r\n if((am[x] == 'S' or am[x] == 'P') and (bk[z] == 'S' or bk[z] == 'P')):\r\n if(am[x] < bk[z]):\r\n resam += 1\r\n else:\r\n resbk += 1\r\n else:\r\n if(am[x] > bk[z]):\r\n resam += 1\r\n else:\r\n resbk += 1\r\n \r\n x += 1\r\n z += 1\r\n \r\n ssr.append((resam, resbk))\r\n\r\n \r\nif(lam * lbk < n):\r\n y = int(n / (lam * lbk))\r\n resam *= y\r\n resbk *= y\r\n ty = ssr[n % (lam * lbk)]\r\n resam += ty[0]\r\n resbk += ty[1]\r\n \r\n \r\nprint(resam, resbk)\r\n\r\n \r\n ", "Q=lambda x,y:Q(y%x,x)if x else y\r\nI=input\r\nR=range\r\nn=int(I())\r\ns=I()\r\np=I()\r\nG=len(p)//Q(len(s),len(p))*len(s)\r\ns*=G//len(s)\r\np*=G//len(p)\r\na=b=0\r\nfor i in R(G):\r\n\tt=s[i]+p[i]\r\n\tif t=='RS'or t=='SP'or t=='PR':a+=1\r\n\telif t=='SR'or t=='PS' or t=='RP':b+=1\r\na*=(n//G)\r\nb*=(n//G)\r\nfor i in R(n%G):\r\n\tt=s[i]+p[i]\r\n\tif t=='RS'or t=='SP'or t=='PR':a+=1\r\n\telif t=='SR'or t=='PS' or t=='RP':b+=1\r\nprint(b,a)", "import math\r\nn=int(input())\r\ns1=input()\r\ns2=input()\r\ns1=list(s1)\r\ns2=list(s2)\r\nlcm=(len(s1)*len(s2))//(math.gcd(len(s1),len(s2)))\r\nl2=n%lcm\r\nc1=0\r\nc2=0\r\n\r\nc3=0\r\nc4=0\r\nfor i in range(1,lcm+1):\r\n if s1[(i%len(s1))-1]!=s2[(i%len(s2))-1]:\r\n p=s1[(i%len(s1))-1]\r\n q=s2[(i%len(s2))-1]\r\n if p=='R' and q=='S':\r\n c1+=1\r\n elif p=='S' and q=='P':\r\n c1+=1\r\n elif p=='P' and q=='R':\r\n c1+=1\r\n else:\r\n c2+=1\r\n if i==l2:\r\n c3=c1\r\n c4=c2\r\nif n<lcm:\r\n print(c4,c3,end=\" \")\r\nelse:\r\n print(c4+c2*(n//lcm),c3+c1*(n//lcm),end=\" \")\r\n \r\n\r\n \r\n \r\n ", "f = lambda x, y : 0 if x + y == 'RS' or x + y == 'SP' or x + y == 'PR' else 1 if x == y else 2\r\nn = int(input())\r\n*s, = input()\r\n*t, = input()\r\nm, k, res = len(s), len(t), [0] * 3\r\nfor i in range(m * k):\r\n\tif i < n:\r\n\t\tres[f(s[i % m], t[i % k])] += (n - 1 - i) // (m * k) + 1\r\nprint(res[2], res[0])\r\n", "n = int(input())\r\ns1 = input().strip()\r\ns2 = input().strip()\r\n\r\na = s1\r\nb = s2\r\n\r\nwhile len(a) != len(b):\r\n if len(a) < len(b):\r\n a += s1\r\n else:\r\n b += s2\r\n\r\nn_full = n // len(a)\r\nn_mod = n % len(a)\r\n\r\na_score = 0\r\nb_score = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n if (a[i] == 'P' and b[i] == 'R') or (a[i] == 'R' and b[i] == 'S') or (a[i] == 'S' and b[i] == 'P'):\r\n a_score += 1\r\n else:\r\n b_score += 1\r\n\r\na_score *= n_full\r\nb_score *= n_full\r\n\r\nfor i in range(n_mod):\r\n if a[i] != b[i]:\r\n if (a[i] == 'P' and b[i] == 'R') or (a[i] == 'R' and b[i] == 'S') or (a[i] == 'S' and b[i] == 'P'):\r\n a_score += 1\r\n else:\r\n b_score += 1\r\n\r\nprint(b_score, a_score)" ]

[ "n, m = map(int, input().split())\r\nlist1 = []\r\nans = set()\r\nif n == 1:\r\n print(1)\r\nelse:\r\n for i in range(m):\r\n list1.append(list(map(int, input().split())))\r\n for i in range(1, 101):\r\n if len(ans) > 1:\r\n print(-1)\r\n break\r\n for j in range(len(list1)):\r\n if (list1[j][0] - 1) // i + 1 != list1[j][1]:\r\n break\r\n else:\r\n ans.add((n - 1) // i + 1)\r\n else:\r\n if len(ans) == 1:\r\n print(*list(ans))\r\n else:\r\n print(-1)", "n, m = map(int, input().split())\r\nk = []\r\nfor i in range(m):\r\n k.append([])\r\n k[i] = list(map(int, input().split()))\r\nansw = []\r\nfor i in range(1,101):\r\n test = True\r\n for j in range(m):\r\n t = (k[j][0]+i-1)//i\r\n if t != k[j][1]:\r\n test = False\r\n if test:\r\n answ.append(i)\r\nif len(answ) == 0:\r\n print(-1)\r\n exit(0)\r\nt = []\r\nfor i in answ:\r\n t.append((n+i-1)//i)\r\nif min(t) != max(t):\r\n print(-1)\r\n exit(0) \r\nprint(t[0])", "n, k = tuple(map(int, input().split()))\r\n\r\n\r\nd = []\r\nfor i in range(k):\r\n d.append(tuple(map(int, input().split())))\r\n\r\ndef get_floor(flat, on_floor):\r\n return (flat-1)//on_floor + 1\r\n\r\n\r\n\r\n\r\npossible = []\r\nfor on_floor in range(1, 101):\r\n flag = 0\r\n for mem in d:\r\n if not get_floor(mem[0], on_floor) == mem[1]:\r\n flag = 1\r\n break\r\n if not flag:\r\n possible.append(on_floor)\r\n\r\n\r\nif len(possible) > 0:\r\n floor = get_floor(n,possible[0])\r\n flag1 = 0\r\n for p in possible[1:]:\r\n if floor != get_floor(n,p):\r\n print(-1)\r\n flag1 = 1\r\n break\r\n if not flag1:\r\n print(floor)\r\n\r\n\r\n\r\n", "n, m = [int(x) for x in input().split()]\nar = []\nfor i in range(m):\n k, f = [int(x) for x in input().split()]\n ar.append((k,f))\n\nflats = []\nfor flat in range(1, 102):\n ok = True\n for (x,y) in ar:\n if (x-1) // flat + 1 != y:\n ok = False\n if ok:\n flats.append(flat)\n\nflats = sorted(list(map(lambda x: (n-1) // x + 1, flats)))\nif (len(flats) == 0 or flats[0] != flats[-1]):\n print(-1)\nelse:\n print(flats[0])\n\n", "import sys\r\nn, _, *data = list(map(int, sys.stdin.read().split()))\r\n\r\nfsizes = list(range(1, 102))\r\n\r\nfor ki, fi in zip(data[::2], data[1::2]):\r\n fsizes = [fs for fs in fsizes if (ki - 1) // fs + 1 == fi]\r\n\r\nfloors = list({(n-1) // fs + 1 for fs in fsizes})\r\nprint(floors[0] if len(floors) == 1 else -1)", "n,m = map(int,input().split())\nkv = [-1] * 101\nfor i in range(m):\n\tx,y = map(int,input().split())\n\tkv[x - 1] = y - 1\nres = []\nfor i in range(1,102):\n\tcheck = True\n\tfor j in range(1,101):\n\t\tif kv[j] != -1 and j // i != kv[j]:\n\t\t\tcheck = False\n\tif (check):\n\t\tres.append(i)\ncurset = set()\nfor i in res:\n\tcurset.add((n - 1) // i + 1)\nif len(curset) == 1:\n\tprint(*list(curset))\nelse:\n\tprint(-1)", "MAX_FLOOR = 100\n\ndef get_floor(appartment, floor_size):\n return (appartment - 1) // floor_size + 1\n\ndef fits(floor_size, memo):\n for t in memo:\n if get_floor(t[0], floor_size) != t[1]:\n return False\n return True\n\ndef solve(apartment, memo):\n possible = set()\n\n for i in range(1, MAX_FLOOR + 1):\n if not fits(i, memo):\n continue\n possible.add(get_floor(apartment, i))\n\n if len(possible) != 1:\n return -1\n return possible.pop()\n\ndef main():\n n, k = map(int, input().split())\n memo = [tuple(map(int, input().split())) for i in range(k)]\n\n res = solve(n, memo)\n print(res)\n\nmain()\n", "from math import ceil\r\nn, m = map(int, input().split())\r\nk = [0 for i in range(m)]\r\nf = [0 for i in range(m)]\r\nx = -1\r\nfor i in range(m):\r\n k[i], f[i] = map(int, input().split())\r\ni = 0\r\nwhile i < m:\r\n j = i\r\n while j < m:\r\n if abs(k[i] - k[j]) == 1 and abs(f[i] - f[j]) == 1:\r\n if f[i] < f[j]:\r\n x = ceil(n / ceil(k[i] / f[i]))\r\n else:\r\n x = ceil(n / ceil(k[j] / f[j]))\r\n i = m - 1\r\n j = i\r\n j += 1\r\n i += 1\r\nif x > 0:\r\n print(x)\r\nelse:\r\n c = []\r\n for i in range(1, 101):\r\n j = 0\r\n b = True\r\n while j < m and b:\r\n if not (ceil(k[j] / i) == f[j]):\r\n b = False\r\n j += 1\r\n if b:\r\n c.append(i)\r\n x = ceil(n / c[0])\r\n for i in range(len(c)):\r\n if ceil(n / c[i]) != x:\r\n x = -1\r\n break\r\n print(x)\r\n", "n, m = list(map(int, input().split()))\r\nkf = [tuple(map(int, input().split())) for _ in range(m)]\r\n\r\nres = set()\r\nfor i in range(1, 101):\r\n if all([(k-1)//i+1 == f for k,f in kf]):\r\n res.add((n-1)//i+1)\r\nif len(res) == 1:\r\n print(list(res)[0])\r\nelse:\r\n print(-1)", "n, m = map(int, input().split())\r\n\r\nf = [0 for _ in range(m)]\r\nk = [0 for _ in range(m)]\r\n\r\nfor i in range(m):\r\n\tk[i], f[i] = map(int, input().split())\r\n\t\r\nans = set()\r\n\r\nfor i in range(1, 500):\r\n\tok = True\r\n\tfor j in range(m):\r\n\t\tif (k[j] - 1) // i != f[j] - 1:\r\n\t\t\tok = False\r\n\t\t\tbreak\r\n\tif ok:\r\n\t\tans.add((n - 1) // i + 1)\r\n\t\t\t\r\nif len(ans) == 1:\r\n\tprint(ans.pop())\r\nelse:\r\n\tprint(-1)\r\n\t\t\r\n\t\r\n\t", "from math import ceil\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n \r\n d = []\r\n \r\n for i in range(m):\r\n d.append(list(map(int, input().split())))\r\n \r\n fl = []\r\n \r\n for i in range(1, 101): \r\n for j in range(m):\r\n k, f = d[j][0], d[j][1]\r\n \r\n if (ceil(k / i) != f):\r\n break\r\n else:\r\n fl.append(i)\r\n \r\n if (len(fl) > 1):\r\n ans1 = ceil(n / fl[0])\r\n ans2 = -1\r\n for i in range(1, len(fl)):\r\n ans2 = ceil(n / fl[i])\r\n if (ans1 != ans2):\r\n print(-1)\r\n break\r\n else:\r\n print(ans1)\r\n else:\r\n print( (n + fl[0] - 1) // fl[0])\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n,m = input().split(' ')\r\nn,m = int(n),int(m)\r\na = [[0]*2 for _ in range(205)]\r\n# print(a)\r\nfor i in range(m):\r\n a[i][0],a[i][1] = input().split(' ')\r\n a[i][0],a[i][1] = int(a[i][0]),int(a[i][1])\r\nans = 0\r\nx = 0\r\nfor i in range(100):\r\n iss = 0\r\n for j in range(m):\r\n x = int((a[j][0]+i)/(i+1))\r\n if x!=a[j][1]:\r\n iss = True\r\n\r\n if iss == False:\r\n w = int((n+i)/(i+1))\r\n if ans==0:\r\n ans = w\r\n elif ans != w:\r\n ans = -1\r\nprint(ans)", "n, m = list(map(int, input().split()))\r\nkf = [tuple(map(int, input().split())) for _ in range(m)]\r\n\r\n# lowerb = max([f for k,f in kf if k <= n], default=1)\r\n# upperb = min([f for k,f in kf if k >= n], default=100)\r\n# if lowerb == upperb:\r\n # print(lowerb)\r\n # exit()\r\n \r\nsolutions = set()\r\nfor fl in range(1, 101):\r\n if all([(ki-1)//fl+1==fi for ki,fi in kf]):\r\n solutions.add((n-1)//fl+1)\r\n\r\nif len(solutions) == 1:\r\n print(solutions.pop())\r\nelse:\r\n print(-1)\r\n ", "res, m = map(int, input().split())\r\nmass=[]\r\nif res==1:\r\n print(1)\r\n exit()\r\nif m==0:\r\n print(-1)\r\n exit()\r\n\r\nfor i in range(m):\r\n k, ne = map(int, input().split())\r\n mass+=[[k,ne]]\r\ns = -1\r\nfor i in range(1,1001):\r\n r=1\r\n for i2 in range (m):\r\n k=mass[i2][0]\r\n ne=mass[i2][1]\r\n x=0\r\n if k%i!=0:\r\n x=1\r\n if k//i+x!=ne:\r\n r=0\r\n break\r\n if r:\r\n x=0\r\n if res%i!=0:\r\n x=1\r\n if res//i+x!=s and s!=-1:\r\n print(-1)\r\n exit()\r\n s=res//i+x\r\nprint(s)", "g = lambda: map(int, input().split())\r\nn, m = g()\r\na, b = 1, n\r\nfor i in range(m):\r\n k, f = g()\r\n a = max(1 + (k - 1) // f, a)\r\n if f > 1: b = min((k - 1) // (f - 1), b)\r\nx, y = (n - 1) // a, (n - 1) // b\r\nprint(-1 if x - y else (1 + x))", "from math import ceil\nans = -1\nn, m = map(int, input().split())\nv = []\nfor i in range(m):\n x, y = map(int, input().split())\n v.append([x, y])\nfor cf in range(1, 101):\n for elem in v:\n if ceil(elem[0] / cf) != elem[1]:\n break\n else:\n if ans != -1 and ceil(n / cf) != ans:\n print(-1)\n break\n else:\n ans = ceil(n / cf)\nelse:\n print(ans)", "n, m = map(int, input().split())\r\nd = []\r\n\r\ncount_of_good = 0\r\ngood_on_level = []\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n d.append((a, b))\r\n\r\nfor on_level in range(1, 101):\r\n good = True\r\n for el in d:\r\n etaj = el[1]\r\n kv = el[0]\r\n if not ((etaj - 1) * on_level < kv <= etaj * on_level):\r\n good = False\r\n break\r\n if good:\r\n count_of_good += 1\r\n good_on_level.append(on_level)\r\n\r\nans = []\r\n\r\nfor i in good_on_level:\r\n if n % i == 0:\r\n ans.append(n // i)\r\n else:\r\n ans.append(n // i + 1)\r\n\r\nif len(ans) == 1:\r\n print(ans[0])\r\n exit()\r\n\r\nfor i in range(1, len(ans)):\r\n if ans[i - 1] != ans[i]:\r\n print('-1')\r\n exit()\r\n\r\nprint(ans[0])\r\n", "n,m=[int(x) for x in input().split()]\r\nmp=dict()\r\nfor i in range(m):\r\n a,b=[int(x) for x in input().split()]\r\n mp[a]=b\r\nans=list()\r\nfor i in range(1,105):\r\n flag=0\r\n for j in mp:\r\n md=j%i\r\n if md:tmp=(j//i)+1\r\n else:tmp=j//i\r\n if tmp!=mp[j]:flag=1; break\r\n if flag==0:ans.append(i)\r\n#print(ans)\r\nlol=set()\r\nfor i in ans:\r\n md=n%i\r\n if md:lol.add((n//i)+1)\r\n else:lol.add(n//i)\r\n#print(lol)\r\nif len(lol)>1:print(-1)\r\nelse:print(*lol)", "import math\r\nn,m=map(int,input().split())\r\nznach=range(1,200)\r\nfor i in range(m):\r\n k,f=map(int,input().split())\r\n if f==1:\r\n a=range(math.ceil(k/f),200)\r\n else:\r\n niz=math.ceil(k/f)\r\n verh=math.floor((k-1)/(f-1))\r\n a=range(niz,verh+1)\r\n znach=list(set(a)&set(znach))\r\nif len(znach)==1:\r\n if n%znach[0]==0:\r\n print(n//znach[0])\r\n else:\r\n print(n//znach[0]+1)\r\nelse:\r\n a=[]\r\n for i in range(len(znach)):\r\n if n%znach[i]==0:\r\n a.append(n//znach[i])\r\n else:\r\n a.append(n//znach[i]+1)\r\n a=list(set(a))\r\n if len(a)>1:\r\n print(-1)\r\n else:\r\n print(a[0])", "n,m = map(int,input().split())\r\nkfi =[list(map(int,input().split())) for i in range(m)]\r\nnum = 0\r\nnum2 = 0\r\nnum3 = 0\r\nnum4 = 0\r\nfor num_et in range(1,101):\r\n num4 = 0\r\n for i in range(m):\r\n if kfi[i][0] > num_et*(kfi[i][1]-1) and kfi[i][0] <= num_et*kfi[i][1]:\r\n num4 += 1\r\n if num4 == m:\r\n if num > 0:\r\n if n // num_et + min(n % num_et, 1) != num3:\r\n num += 1 \r\n else:\r\n num += 1\r\n num2 = num_et\r\n num3 = n // num_et + min(n % num_et, 1)\r\nif num > 1:\r\n print(-1)\r\nelse:\r\n print(num3)\r\n", "n,m = (int(x) for x in input().split());\n\nflat = [0 for x in range(m)];\nfloor = [0 for x in range(m)];\na = set();\nans = -1;\n\nfor i in range(m):\n flat[i], floor[i] = (int(x) for x in input().split());\n\nfor i in range(1, 101, 1):\n tf = 1;\n for j in range(m):\n if (flat[j]-1)//i != floor[j]-1:\n tf = 0;\n break;\n if tf == 1:\n num = (n-1) // i + 1;\n if len(a) == 0:\n a.add(num);\n ans = num;\n else:\n if num not in a:\n ans = -1;\n break;\n\nprint(ans);\n \n", "p=lambda: map(int, input().split())\r\nn,m=p()\r\na,b=1,n\r\nfor i in range(m):\r\n k,f=p()\r\n a=max(1+(k-1)//f,a)\r\n if f>1:b=min((k-1)//(f-1),b)\r\nx,y=(n-1)//a,(n-1)//b\r\nprint(-1 if x-y else (1+x))", "a = input().split()\r\nm = [0]*int(a[1])\r\nk = [0]*int(a[1])\r\nans = -1\r\nfor i in range(int(a[1])):\r\n b = input().split()\r\n m[i] = int(b[0])\r\n k[i] = int(b[1])\r\nfor i in range(1,101):\r\n f = True\r\n d = 0\r\n for j in range(int(a[1])):\r\n if m[j] % i == 0:\r\n d = m[j]//i\r\n else:\r\n d = m[j]//i+1\r\n if d != k[j]:\r\n f = False\r\n break\r\n if f:\r\n if int(a[0]) % i==0:\r\n x = int(a[0]) // i\r\n else:\r\n x = int(a[0])//i+1\r\n if ans == -1:\r\n ans = x\r\n else:\r\n if ans != x:\r\n print(-1)\r\n exit(0)\r\nprint(ans)\r\n\r\n", "n, m = list(map(int, input().split()))\r\nl = []\r\nmay = []\r\nfor i in range(m):\r\n l.append(list(map(int, input().split())))\r\ng = 0\r\nfor i in range(1, 101):\r\n fl = True\r\n for j in l:\r\n a =j[0]\r\n b =j[1]\r\n if (a - 1)// i + 1 != b:\r\n fl =False\r\n break\r\n if fl:\r\n may.append(i)\r\nfor i in range(len(may) - 1):\r\n if (n-1) // may[i] + 1 != (n-1) // may[i+1] + 1:\r\n print(-1)\r\n exit()\r\nprint((n-1) // may[0] + 1)\r\n", "from math import ceil\r\ndef f(n,q):\r\n st=set()\r\n for x in range(1,101):\r\n good=True\r\n for flat,floor in g:\r\n if ceil(flat/x)==floor:\r\n continue\r\n else:\r\n good=False\r\n break\r\n if good:\r\n st.add(ceil(n/x))\r\n if len(st)!=1:\r\n return -1\r\n return list(st)[0]\r\nn,m=map(int,input().strip().split())\r\ng=[]\r\nfor i in range(m):\r\n flat,floor=map(int,input().strip().split())\r\n g.append((flat,floor))\r\n\r\nprint(f(n,g))\r\n", "import math\r\nn, m = map(int, input().split())\r\nif m == 0:\r\n if n == 1: print(1)\r\n else: print(-1)\r\n exit()\r\narr = []\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n arr.append([y, x])\r\narr.sort()\r\nf = [0] * 105\r\nl = [0] * 105\r\nfor i in range(m):\r\n l[arr[i][0]] = arr[i][1]\r\nfor i in range(m - 1, -1, -1):\r\n f[arr[i][0]] = arr[i][1]\r\nf1 = [0] * 105\r\nl1 = [0] * 105\r\nans = -1\r\nfor i in range(1, 101):\r\n t1 = 1\r\n t2 = i\r\n for j in range(1, 101):\r\n f1[j] = t1\r\n t1 += i\r\n l1[j] = t2\r\n t2 += i\r\n check = 0\r\n for j in range(1, 101):\r\n if f[j]:\r\n if f[j] >= f1[j] and l[j] <= l1[j]: continue\r\n else:\r\n check = 1\r\n break\r\n if check == 0:\r\n if ans != -1:\r\n if ans != math.ceil(n / i):\r\n ans = -1\r\n break\r\n ans = math.ceil(n / i)\r\nprint(ans)", "def first(n, m, line):\r\n for i in range(0, n): \r\n k, f = map(int, input().split()) \r\n res = [] \r\n for j in range(1, 101): \r\n if j * f >= k and j * (f - 1) < k: \r\n res.append(j) \r\n line.append(res) \r\n res = [] \r\n return line\r\n\r\n\r\ndef check(n, m, hz):\r\n for i in range(1, 101): \r\n dno = 0 \r\n for elem in line: \r\n if i in elem: \r\n dno += 1 \r\n if dno == n: \r\n hz.append(i)\r\n return hz\r\n\r\n\r\nm, n = map(int, input().split()) \r\nline = [] \r\nline = first(n, m, line)\r\nhz = [] \r\nhz = check(n, m, hz)\r\nans = [] \r\n\r\nfor element in hz: \r\n if m % element == 0: \r\n ans.append(m // element)\r\n else: \r\n ans.append(m // element + 1)\r\nsmth = ans[0] \r\nansw = 0 \r\nfor element in ans: \r\n if element != smth: \r\n answ = -1 \r\nif answ == -1: \r\n print(answ) \r\nelse: \r\n print(smth)\r\n", "n,m=map(int,input().split())\nA=[]\nB=[]\nfor i in range(m):\n a,b=map(int,input().split())\n A.append(a)\n B.append(b)\n\ntmin=1\ntmax=100\nfor j in range(m):\n if(B[j]==1 and tmin<A[j]):\n tmin=A[j]\n elif(B[j]>1):\n if(tmax>((A[j]-1)//(B[j]-1))):\n tmax=(A[j]-1)//(B[j]-1)\n if(A[j]%B[j]==0 and tmin<(A[j]//B[j])):\n tmin=A[j]//B[j]\n elif((A[j]%B[j]!=0) and tmin<(A[j]//B[j]+1)):\n tmin=A[j]//B[j]+1\nif(n%tmax==0):\n nlow=n//tmax\nelse:\n nlow=n//tmax+1\nif(n%tmin==0):\n nhigh=n//tmin\nelse:\n nhigh=n//tmin+1\n\nif(nhigh==nlow):\n print(nhigh)\nelse:\n print(-1)\n\t\t\t\t\t \t \t \t \t \t \t \t", "import math\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n data = []\r\n for _ in range(m):\r\n k, f = map(int, input().split())\r\n data.append((k, f))\r\n candidates = []\r\n for i in range(1, 101):\r\n for elem in data:\r\n k, f = elem\r\n if (k - 1) // i != f - 1:\r\n break\r\n else:\r\n candidates.append(i)\r\n answers = []\r\n for candidate in candidates:\r\n answers.append(math.ceil(n / candidate))\r\n flag = False\r\n for i in range(len(answers)-1):\r\n if answers[i] != answers[i+1]:\r\n flag = True\r\n if flag:\r\n print(-1)\r\n else:\r\n print(answers[0])\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "m, n = map(int, input().split())\r\ncanbe = []\r\nfor i in range(0, n):\r\n numb, et = map(int, input().split())\r\n can = []\r\n for j in range(1, 101):\r\n if j * et >= numb and j * (et - 1) < numb:\r\n can += [j]\r\n canbe += [can]\r\n can = []\r\ncanbeat = []\r\nfor i in range(1, 101):\r\n est = 0\r\n for el in canbe:\r\n if i in el:\r\n est += 1\r\n if est == n:\r\n canbeat += [i]\r\nans = []\r\nfor element in canbeat:\r\n if m % element == 0:\r\n ans += [m // element]\r\n else:\r\n ans += [m // element + 1]\r\nwrit = ans[0]\r\ntr = 0\r\nfor element in ans:\r\n if element != writ:\r\n tr = -1\r\nif tr == -1:\r\n print(tr)\r\nelse:\r\n print(writ)", "n, m = map(int, input().split())\r\nans, flats = [], {}\r\n\r\nfor _ in range(m):\r\n\tflat, floor = map(int, input().split())\r\n\tflats[flat] = floor\r\n\r\nfor cf in range(1, 101):\r\n\tflag = True\r\n\tfor flat in flats.items():\r\n\t\tif (flat[0] - 1) // cf + 1 != flat[1]:\r\n\t\t\tflag = False\r\n\t\t\tbreak\r\n\tif flag:\r\n\t\tans.append((n - 1) // cf + 1)\r\n\r\nif len(list(set(ans))) == 1:\r\n\tprint(ans[0])\r\nelse:\r\n\tprint(-1)\r\n", "n, m = map(int, input().split())\r\na = [0] * m\r\nfor i in range(m):\r\n a[i] = list(map(int, input().split()))\r\n a[i][0] -= 1\r\n a[i][1] -= 1\r\n\r\nn -= 1\r\ncanbe = set()\r\n\r\nlast = 0\r\n\r\nfor i in range(1, 200):\r\n good = 1\r\n for j in range(m):\r\n k = a[j][0]\r\n f = a[j][1]\r\n if not (i * f <= k <= i * (f + 1) - 1):\r\n good = 0\r\n if good:\r\n canbe.add(n // i)\r\n last = n // i + 1\r\n\r\nif len(canbe) == 1:\r\n print(last)\r\nelse:\r\n print(-1)\r\n", "import math\n\ndef find_3():\n etazh = []\n for p in range(1, 101):\n if all((memory[0] + p - 1) // p == memory[1] for memory in mass):\n etazh.append(p)\n return etazh\n\ndef find_2():\n etazh = []\n p = 1\n while p < 100:\n for i in range (m):\n if math.ceil(mass[i][0]/p) != mass[i][1]:\n p += 1\n break\n elif i==(m-1):\n etazh.append(p)\n p += 1\n return etazh\n\ndef find_1():\n etazh = []\n for p in range(100):\n suit = True\n for i in range(m):\n if math.ceil(mass[i][0]/p) != mass[i][1]:\n suit = False\n break\n if suit:\n etazh.append(p)\n return etazh\n\nn, m = map(int, input().split())\nmass = []\n\nfor i in range (m):\n mass.append(list(map(int, input().split())))\n\netazh = find_3()\nif all((n+x-1)//x == (n+etazh[0]-1)//etazh[0] for x in etazh):\n print((n+etazh[0]-1)//etazh[0])\nelse:\n print(-1)\n", "#!/usr/bin/env python3\n# encoding: utf-8\n\n\nFLOW_COUNT = 100\nAPARTMENT_COUNT = 100\nAF_COUNT = 100\n\n\ndef build_for(app_per_flow):\n b = dict()\n for f in range(FLOW_COUNT):\n for a in range(app_per_flow):\n app = f * app_per_flow + a\n if app >= APARTMENT_COUNT:\n return b\n b[app] = f\n return b\n\n\ndef check_for(b, d):\n app, flow = d\n return app in b and b[app] == flow\n\n\n\n# Execution start point\nif __name__ == \"__main__\":\n data = input()\n d = data.split()\n assert len(d) == 2\n n, k = int(d[0])-1, int(d[1])\n\n fs = list()\n for i in range(k):\n data = input()\n d = data.split()\n assert len(d) == 2\n fs.append((int(d[0])-1, int(d[1])-1))\n\n index, res = 0, 0\n for af in range(AF_COUNT):\n b = build_for(af + 1)\n for d in fs:\n if not check_for(b, d):\n break\n else:\n f = (n // (af + 1)) + 1\n if index and f != res:\n index = 0\n break\n else:\n index = af + 1\n res = f\n\n if index > 0:\n print(\"%d\" % res)\n else:\n print(\"-1\")\n", "from math import ceil, floor\n\nn, m = map(int, input().split())\nn -= 1\nl = 1\nh = 200\nfor i in range(m):\n k, f = map(int, input().split())\n k -= 1\n f -= 1\n cur_l = (k + 1) // (f + 1)\n if (k + 1) % (f + 1) != 0:\n cur_l += 1\n if f != 0:\n cur_h = k // f\n else:\n cur_h = h\n l = max(cur_l, l)\n h = min(cur_h, h)\nif l > h:\n print(-1)\nelif n // l != n // h:\n print(-1)\nelse:\n print(1 + n // l)\n", "import math\r\nclass TaskA:\r\n def __init__(self):\r\n s = input().split()\r\n self.n, self.m = int(s[0]), int(s[1])\r\n self.k = list()\r\n self.f = list()\r\n for i in range(self.m):\r\n st = input().split()\r\n self.k.append(int(st[0]))\r\n self.f.append(int(st[1]))\r\n\r\n def Check(self, floor):\r\n for i in range(self.m):\r\n fl = int(math.ceil(self.k[i] / floor))\r\n if fl != self.f[i]:\r\n return False\r\n return True\r\n def Solve(self):\r\n ans = -1\r\n fl = -1\r\n was = False\r\n for i in range(1, 101):\r\n if self.Check(i):\r\n if not (was):\r\n ans = int(math.ceil(self.n / i))\r\n was = True\r\n else:\r\n t = int(math.ceil(self.n / i))\r\n if (t != ans):\r\n print(-1)\r\n return\r\n print(ans)\r\nSolver = TaskA()\r\nSolver.Solve()\r\n", "n, m = [int(i) for i in input().split()]\nfloor_info = [[int(i) for i in input().split()] for j in range(m)]\nans = list(set([(n-1)// i + 1 for i in range(1,101) if all([(sub_floor[0]-1)// i + 1 == sub_floor[1] for sub_floor in floor_info])]))\nif len(ans) == 1:\n print(ans[0])\nelse:\n print(-1)\n \t \t \t \t\t \t\t\t\t\t", "n, m = map(int, input().split())\r\na = [tuple(map(int, input().split())) for i in range(m)]\r\nans = set()\r\nfor i in range(1, 101):\r\n can = True\r\n for k, f in a:\r\n if (k + i - 1) // i != f:\r\n can = False\r\n break\r\n if can:\r\n ans.add((n + i - 1) // i)\r\nif len(ans) == 1:\r\n print(ans.pop())\r\nelse:\r\n print('-1')\r\n", "n, k = map(int, input().split())\n\nmemories = []\nfor i in range(k):\n x, y = map(int, input().split())\n memories.append((x, y))\n\nsuitable = []\nm = 1\nstop = False\nwhile not stop and (m <= n or len(suitable) == 0):\n suit = True\n for q in memories:\n x, y = q[0], q[1]\n if (x + m - 1) // m < y:\n suit = False\n stop = True\n break\n if (x + m - 1) // m > y:\n suit = False\n m = (x + y - 1) // y\n break\n if suit:\n suitable.append(m)\n m += 1\n\nprint((n + suitable[0] - 1) // suitable[0] if len(suitable) > 0 and all([(n + m - 1) // m == (n + suitable[0] - 1) // suitable[0] for m in suitable]) else -1)\n\n(10 + m - 1) // m < 1\n", "import math\r\nimport os\r\n\r\nx, y = [int(i) for i in input().split()]\r\n\r\nif y == 0:\r\n if x == 1:\r\n print(1)\r\n else:\r\n print(-1)\r\n exit(0)\r\n \r\na = []\r\nmin = 0\r\nmax = 10**6\r\nfor i in range(y):\r\n k, f = [int(i) for i in input().split()]\r\n if f == 1:\r\n if x <= k:\r\n print(1)\r\n exit(0)\r\n else:\r\n nmax = 10*6\r\n nmin = k\r\n else:\r\n if k % (f - 1) == 0:\r\n nmax = k // (f - 1) - 1\r\n else:\r\n nmax = math.floor(k / (f - 1))\r\n nmin = math.ceil(k / f)\r\n if nmin > min:\r\n min = nmin\r\n if nmax < max:\r\n max = nmax\r\n if min == max:\r\n print(math.ceil(x / min))\r\n exit(0)\r\n \r\nfirst = math.ceil(x / min)\r\nfor i in range(min+1, max+1):\r\n if math.ceil(x / i) != first:\r\n print(-1)\r\n exit(0) \r\nprint(first)\r\n", "n, m = list(map(int, input().split()))\r\nkf = {}\r\nfor _ in range(m):\r\n k, f = list(map(int, input().split()))\r\n kf[k] = f\r\nsol = set()\r\nfor i in range(1, 101):\r\n if all([(k-1)//i + 1 == f for k,f in kf.items()]):\r\n sol.add((n-1)//i + 1)\r\nif len(sol) != 1:\r\n print(-1)\r\nelse:\r\n print(list(sol)[0])\r\n", "R=lambda:list(map(int,input().split()))\nn,m=R()\nc=[R()for i in range(m)]\na=list(set([(n-1)//i+1 for i in range(1,999)if all((k[0]-1)//i+1==k[1]for k in c)]))\nprint(a[0]if len(a)==1 else -1)\n\n \t \t \t \t\t \t \t \t\t", "k = []\r\nn, m = map(int, input().split(\" \"))\r\nfor i in range(m):\r\n\tx, y = map(int, input().split(' '))\r\n\tk.append([x, y])\r\n\r\ndef ok(x):\r\n\tfor i in k:\r\n\t\tif (i[0]-1)//x+1!=i[1]:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nposs = []\r\nfor x in range(1, 101):\r\n\tif ok(x):\r\n\t\tposs.append((n-1)//x+1)\r\n\r\nif len(list(set(poss))) == 1:\r\n\tprint(poss[0])\r\nelse:\r\n\tprint(-1)\r\n\r\n\r\n", "n, m = map(int, input().split())\nnumbers = {}\nfor _ in range(m):\n s = list(map(int, input().split()))\n numbers[s[0]] = s[1]\nans = []\nfor flats_on_floor in range(1, 101):\n for i in numbers:\n if (i - 1) // flats_on_floor + 1 != numbers[i]:\n break\n else:\n ans.append(flats_on_floor)\n#print(ans)\ndifs = [(n - 1) // x for x in ans]\n#print(difs)\nif not any(map(lambda x: x - difs[0], difs)):\n print(difs[0]+1)\nelse:\n print(-1)\n\n\"\"\"\n10 4\n3 1\n9 2\n10 2\n13 3\n\"\"\"\n", "n, m = map(int, input().split())\na = 1\nb = 100\nfor i in range(m):\n k, f = map(int, input().split())\n k-=1\n f-=1\n for j in range(1, 101):\n if (k//j == f):\n a = max(a, j)\n break\n for j in range(100, 0, -1):\n if (k//j == f):\n b = min(b, j)\n break\nn-=1\nif (n//a == n//b):\n print(n//a+1)\nelse:\n print(-1)", "n, m = map(int, input().split())\r\nu = []\r\nook = True\r\nans = -1\r\nfor i in range(m):\r\n u.append(tuple(map(int, input().split())))\r\nfor cf in range(1, 101):\r\n ok = True\r\n for i in range(m):\r\n if (u[i][0] - 1) // cf + 1 != u[i][1]:\r\n ok = False\r\n break\r\n if ok and ans != -1 and (n - 1) // cf + 1 != ans:\r\n print(-1)\r\n ook = False\r\n break\r\n elif ok:\r\n ans = (n - 1) // cf + 1\r\nif ook:\r\n print(ans)\r\n \r\n", "n, m = map(int, input().split())\r\n\r\nl = -100\r\nr = 100\r\nfor i in range(m):\r\n k, f = map(int, input().split())\r\n l = max(l, (k + f - 1) // f)\r\n if(f != 1):\r\n r = min(r, (k - 1) // (f - 1))\r\n\r\nif(l == r):\r\n print((n + r - 1) // r)\r\nelif ((n + r - 1) // r == (n + l - 1) // l):\r\n print((n + r - 1) // r)\r\nelse:\r\n print(-1)", "l=[]\r\nf=fn=0\r\n[n,m]=map(int,input().split())\r\nfor i in range(m): l.append(list(map(int,input().split())))\r\nfor i in range(1,101):\r\n for j in l:\r\n if (j[0]//i if j[0]%i==0 else j[0]//i+1)!=j[1]:\r\n break\r\n else:\r\n if f==0:\r\n f=i\r\n fn=(n//i if n%i==0 else n//i+1)\r\n elif fn!=(n//i if n%i==0 else n//i+1):\r\n print(-1)\r\n exit()\r\nprint(fn)", "n,m=map(int,input().split())\r\nk=list()\r\nf=list()\r\nfor _ in range(m):\r\n x,y=map(int,input().split())\r\n k.append(x)\r\n f.append(y)\r\na=set()\r\nfor i in range(1,101):\r\n for j in range(m):\r\n q=(f[j]-1)*i+1\r\n e=f[j]*i\r\n if(k[j]<q or k[j]>e):\r\n break\r\n else:\r\n a.add((n+i-1)//i)\r\nif(len(a)>1):\r\n print(-1)\r\nelse:\r\n print(*a)\r\n \r\n", "\r\nn,m=map(int,input().split())\r\nk=[]\r\nf=[]\r\nfor i in range(m):\r\n u,p=map(int,input().split())\r\n k.append(u)\r\n f.append(p)\r\ndef ok(x):\r\n for i in range(m):\r\n if (k[i]-1)//x+1!=f[i]:\r\n return False\r\n return True\r\na=[]\r\nfor i in range(1,101):\r\n if(ok(i)):\r\n a.append((n-1)//i+1)\r\nif len(list(set(a)))==1:\r\n print(a[0])\r\nelse:\r\n print(-1)\r\n" ]

[ "import sys\r\n \r\nsys.stdin = open('input.txt')\r\nsys.stdout = open('output.txt', 'w')\r\n \r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n[r1, c1, r2, c2] = [int(x) for x in input().split()]\r\n \r\nr1 -= 1\r\nr2 -= 1\r\nc1 -= 1\r\nc2 -= 1\r\n \r\ndr = r2 - r1\r\nddr = dr // abs(dr) if dr != 0 else 1\r\n \r\nc = c1\r\n \r\nfor i in range(abs(dr)+1):\r\n r = r1 + ddr*i\r\n c = min(c, a[r])\r\n \r\npen1 = 0\r\nfor i in range(min(r1, r2)):\r\n pen = (min(r1, r2) - i) * 2\r\n if c > c2 and a[i] < c and a[i] <= min(a[i:min(r1, r2)]):\r\n pen -= c - c2 - abs(a[i] - c2)\r\n pen1 = min(pen1, pen)\r\n \r\npen2 = 0\r\nfor i in range(max(r1, r2)+1, n):\r\n pen = (i - max(r1, r2)) * 2\r\n if c > c2 and a[i] < c and a[i] <= min(a[max(r1, r2):i]):\r\n pen -= c - c2 - abs(a[i] - c2)\r\n pen2 = min(pen2, pen)\r\n \r\npen = abs(dr) + abs(c - c2)\r\nprint(min(pen + pen1, pen+ pen2))", "import sys\n\nsys.stdin = open('input.txt')\nsys.stdout = open('output.txt', 'w')\n\nn = int(input())\na = [int(x) for x in input().split()]\n[r1, c1, r2, c2] = [int(x) for x in input().split()]\n\nr1 -= 1\nr2 -= 1\nc1 -= 1\nc2 -= 1\n\ndr = r2 - r1\nddr = dr // abs(dr) if dr != 0 else 1\n\nc = c1\n\nfor i in range(abs(dr)+1):\n r = r1 + ddr*i\n c = min(c, a[r])\n\npen1 = 0\nfor i in range(min(r1, r2)):\n pen = (min(r1, r2) - i) * 2\n if c > c2 and a[i] < c and a[i] <= min(a[i:min(r1, r2)]):\n pen -= c - c2 - abs(a[i] - c2)\n pen1 = min(pen1, pen)\n\npen2 = 0\nfor i in range(max(r1, r2)+1, n):\n pen = (i - max(r1, r2)) * 2\n if c > c2 and a[i] < c and a[i] <= min(a[max(r1, r2):i]):\n pen -= c - c2 - abs(a[i] - c2)\n pen2 = min(pen2, pen)\n # print(i+1, pen2)\n\npen = abs(dr) + abs(c - c2)\n# print(dr, c, c2)\n# print(pen, pen1, pen2)\nprint(min(pen + pen1, pen+ pen2))\n\t\t \t\t \t \t \t\t \t \t \t\t\t \t\t", "import sys\r\nsys.stdin=open(\"input.txt\")\r\nsys.stdout=open(\"output.txt\",'w')\r\n\r\nn = int(input())\r\nb = list(map(int, input().split()))\r\na = [i+1 for i in b]\r\na = [0]+a\r\nx1,y1, x2, y2 = map(int, input().split())\r\nans = 10000000000\r\nfor i in range(1, n+1):\r\n l = min(i, min(x1, x2))\r\n r = max(i, max(x1, x2))\r\n y = y1\r\n for j in range(l, r+1):\r\n y = min(y, a[j])\r\n ans = min(ans, abs(x1-i)+abs(x2-i)+abs(y2-y))\r\nprint(ans)\r\n \t\t", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\nelse:\r\n stdin = open('input.txt', 'r')\r\n stdout = open('output.txt', 'w')\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 = int(input())\r\n a = [int(num) for num in input().split()]\r\n r1, c1, r2, c2 = [int(num) - 1 for num in input().split()]\r\n best = 10 ** 20\r\n j = min(c1, min(a[i] for i in range(min(r1, r2), max(r1, r2) + 1)))\r\n for i in range(r1, -1, -1):\r\n if a[i] < j:\r\n j = a[i]\r\n best = min(best, abs(i - r1) + abs(i - r2) + abs(j - c2))\r\n j = min(c1, min(a[i] for i in range(min(r1, r2), max(r1, r2) + 1)))\r\n for i in range(r1, n):\r\n if a[i] < j:\r\n j = a[i]\r\n best = min(best, abs(i - r1) + abs(i - r2) + abs(j - c2))\r\n print(best)\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()", "import sys\nsys.stdin = open('input.txt')\nsys.stdout = open('output.txt','w')\n\nn = int(input())\na = list(map(int, input().split()))\n\nr1, c1, r2, c2 = (i - 1 for i in map(int, input().split()))\nx, y = (r1, r2) if r1 < r2 else (r2, r1)\n\nif r1 < r2: c1 = min(c1, min(a[i] for i in range(r1 + 1, r2 + 1)))\nelif r2 < r1: c1 = min(c1, min(a[i] for i in range(r2, r1)))\n\nd = abs(c1 - c2)\nc = c1\nfor i in range(x - 1, -1, -1):\n if c > a[i]:\n c = a[i]\n q = abs(c2 - c) + 2 * abs(x - i)\n if q < d: d = q\nc = c1\nfor i in range(y + 1, n):\n if c > a[i]:\n c = a[i]\n q = abs(c2 - c) + 2 * abs(i - y)\n if q < d: d = q\nprint(d + abs(r2 - r1))\n \t \t \t\t \t \t\t \t" ]

[ "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, m, k = map(int, input().split())\r\nadj = [[] for _ in range(n)]\r\ndp = [[0] * (1 << n) for _ in range(1 << n)]\r\n\r\nfor u, v in (map(int, input().split()) for _ in range(m)):\r\n u, v = u - 1, v - 1\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n dp[(1 << u) | (1 << v)][(1 << u) | (1 << v)] = 1\r\n\r\n\r\nfor v_set in range(1, 1 << n):\r\n leaf_set = v_set\r\n\r\n while leaf_set:\r\n for new_v in range(n):\r\n if (1 << new_v) & v_set:\r\n continue\r\n for bridge in adj[new_v]:\r\n if (1 << bridge) & v_set == 0:\r\n continue\r\n new_leaf_set = (leaf_set | (1 << new_v)) & ~(1 << bridge)\r\n\r\n if (((1 << new_v) - 1) & new_leaf_set) == 0:\r\n dp[v_set | (1 << new_v)][new_leaf_set] += dp[v_set][leaf_set]\r\n\r\n leaf_set = (leaf_set - 1) & v_set\r\n\r\nans = 0\r\nbit = (1 << k) - 1\r\nwhile bit < (1 << n):\r\n ans += dp[-1][bit]\r\n x = bit & -bit\r\n y = bit + x\r\n bit = (((bit & ~y) // x) >> 1) | y\r\n\r\nprint(ans)\r\n" ]

[ "hh, mm = [str(x) for x in input().split(':')]\r\nih = int(hh)\r\nim = int(mm)\r\ncnt = 0\r\nwhile True:\r\n sh = str(ih)\r\n sm = str(im)\r\n if len(sh) == 1:\r\n sh = '0'+sh\r\n if len(sm) == 1:\r\n sm = '0'+sm\r\n if sh == sm[::-1]:\r\n print(cnt)\r\n break\r\n im += 1\r\n if im >= 60:\r\n ih += 1\r\n im = 0\r\n if ih >= 24:\r\n ih = 0\r\n cnt += 1", "n=input()\r\na,b=n.split(\":\")\r\ns=a+b\r\nc=0\r\na=int(a)\r\nb=int(b)\r\nwhile(s!=s[::-1]):\r\n b+=1\r\n if(b==60):\r\n b=0\r\n a+=1\r\n if(a==24):\r\n a=0\r\n a1=str(a)\r\n b1=str(b)\r\n if(len(a1)==1):\r\n a1=\"0\"+a1\r\n if(len(b1)==1):\r\n b1=\"0\"+b1\r\n s=str(a1)+str(b1)\r\n c+=1\r\nprint(c)", "def isPali(h,m):\r\n hh=str(h)\r\n if len(hh)==1:hh='0'+hh\r\n\r\n mm=str(m)\r\n if len(mm)==1:mm='0'+mm\r\n\r\n if hh==mm[::-1]:return False\r\n return True\r\n\r\nh,m=map(int,input().split(\":\"))\r\ntime=0\r\n\r\nwhile isPali(h, m):\r\n time+=1\r\n m+=1\r\n if m==60:\r\n h+=1\r\n m=0\r\n\r\n if h>=24:h=0\r\n \r\nprint(time)\r\n# print(h,m)\r\n", "\r\n\r\nl=[0,70,140,210,280,350,601,671,741,811,881,951,1202,1272,1342,1412]\r\ns=input().split(':')\r\nt=(int(s[0])*60)+(int(s[1]))\r\nif(t>1412):\r\n\tprint(1440-t)\r\nelse:\r\n\tfor i in range(0,len(l)):\r\n\t\tif(l[i]>=t):\r\n\t\t\tprint(l[i]-t)\r\n\t\t\tbreak", "n = \"\".join(input().split(\":\"))\r\ncnt = 0\r\n\r\nwhile n!=n[::-1]:\r\n\tif n==\"2359\":\r\n\t\tcnt+=1\r\n\t\tbreak\r\n\ta = int(n[0:2])*60\r\n\tb = int(n[2::])\r\n\tab = a+b+1\r\n\ta = [str(ab//60).zfill(2)]\r\n\tb = [str(ab%60).zfill(2)]\r\n\tn = \"\".join(a+b)\r\n\tcnt+=1\r\n\t\r\nprint(cnt)\r\n", "t = input()\r\nph, pm = map(int, t.split(\":\"))\r\n\r\nfor s in range(24*60+1):\r\n\tm = pm + s\r\n\th = ph + m // 60\r\n\tm %= 60\r\n\th %= 24\r\n\tif h < 10:\r\n\t\th = '0' + str(h)\r\n\telse:\r\n\t\th = str(h)\r\n\tif m < 10:\r\n\t\tm = '0' + str(m)\r\n\telse:\r\n\t\tm = str(m)\r\n\t\t\r\n\tif h == m[::-1]:\r\n\t\tprint(s)\r\n\t\tbreak", "# LUOGU_RID: 121511341\ndef hui(x):\r\n if str(x)==str(x)[::-1]:\r\n return True\r\n return False\r\n\r\nx=input()\r\na,b=x.split(\":\")\r\ncnt=0\r\nwhile True:\r\n if hui(x):\r\n print(cnt)\r\n break\r\n else:\r\n a, b = int(a), int(b)\r\n cnt+=1\r\n b+=1\r\n if b==60:\r\n b=0\r\n a+=1\r\n if a==24:\r\n a=0\r\n a=\"{:0>2}\".format(str(a))\r\n b = \"{:0>2}\".format(str(b))\r\n x=a+b", "hour,minutes=map(int,input().split(':'))\r\ntime=hour*60+minutes\r\nm=0\r\nwhile True:\r\n time=time%(60*24)\r\n hour=str(time//60)\r\n minutes=str(time%60)\r\n if len(hour)==1:\r\n hour='0'+hour\r\n if len(minutes)==1:\r\n minutes='0'+minutes\r\n minutes=minutes[::-1]\r\n if hour==minutes:\r\n break\r\n else:\r\n m+=1\r\n time+=1\r\n \r\nprint(m)\r\n", "time = input()\r\n\r\ntime_hrs = int(time[0:2])\r\ntime_mins = int(time[3:])\r\n\r\ncounter = 0\r\nwhile (True):\r\n if (time_hrs // 10 == time_mins % 10) and (time_mins // 10 == time_hrs % 10) :\r\n break\r\n time_mins += 1 \r\n if time_mins == 60:\r\n time_mins = 0\r\n time_hrs += 1 \r\n if time_hrs == 24:\r\n time_hrs = 0\r\n\r\n counter += 1\r\n \r\nprint (counter)", "#'Karen is getting ready for a new school day!\r\n#It is currently hh:mm, given in a 24-hour format. As you know, Karen loves palindromes,\r\n#and she believes that it is good luck to wake up when the time is a palindrome.\r\n# What is the minimum number of minutes she should sleep, such that, when she wakes up, the\r\n# time is a palindrome?For instance, 05:39 is not a palindrome, because 05:39 backwards is 93:50.\r\n# On the other hand, 05:50 is a palindrome, because 05:50 backwards is 05:50.'\r\n\r\na, b = map(int, input().split(':'))\r\nc = 0\r\nwhile True:\r\n if a < 10 and b >= 10:\r\n s = '0' + str(a) + str(b)\r\n elif a >= 10 and b < 10:\r\n s = str(a) + '0' + str(b)\r\n elif a < 10 and b < 10:\r\n s = '0' + str(a) + '0' + str(b)\r\n else:\r\n s = str(a) + str(b)\r\n\r\n if s == s[::-1]:\r\n break\r\n else:\r\n if a == 23 and b == 59:\r\n a = 0\r\n b = 0\r\n c += 1\r\n elif b == 59:\r\n a += 1\r\n b = 0\r\n c += 1\r\n else:\r\n b += 1\r\n c += 1\r\nprint(c)", "from sys import stdin\r\nm, n = map(int, stdin.readline().split(\":\"))\r\nans = 0\r\nwhile (m%10 != n//10 or n%10 != m//10):\r\n ans += 1\r\n n += 1\r\n if n >= 60:\r\n m += 1\r\n n %= 60\r\n if m >= 24:\r\n m %= 24\r\nprint(ans)\r\n ", "def inverte(mi):\n dezena = int((mi%10)*10)\n unid = int(mi/10)\n return (dezena+unid)\nlinha = input().split(\":\")\nhora = int(linha[0])\nmin = int(linha[1])\ncont = 0\nwhile hora != inverte(min):\n min = min + 1\n cont = cont+1\n if min == 60:\n hora = hora + 1\n min = 0\n if hora == 24:\n hora = 0\n\nprint(cont)\n# 1507605414776\n", "h, m = input().split(\":\")\r\na = 0\r\nb, c = int(h), int(m)\r\nwhile True:\r\n if str(b).zfill(2)+str(c).zfill(2) == (str(b).zfill(2)+str(c).zfill(2))[::-1]:\r\n print(a)\r\n break\r\n if b == 23 and c == 59:\r\n b = 0\r\n c = 0\r\n a += 1\r\n elif c == 59:\r\n c = 0\r\n b += 1\r\n a += 1\r\n else:\r\n a += 1\r\n c += 1\r\n\r\n\r\n", "s, i = list(map(int, input().split(':'))), 0\r\nh, m = s[0], s[1]\r\nwhile True:\r\n sh, sm = str(h), str(m)\r\n if len(sh) == 1:\r\n sh = '0'+str(h)\r\n if len(sm) == 1:\r\n sm = '0'+str(m)\r\n if sh[0] == sm[1] and sh[1] == sm[0]:\r\n print(i)\r\n break\r\n else:\r\n i += 1\r\n m += 1\r\n if m == 60:\r\n h += 1\r\n m = 0\r\n if h == 24:\r\n h = 0\r\n", "\ndef is_p(h, m):\n\th = str(h)\n\tm = str(m)\n\tif len(h) == 1: h = '0' + h\n\tif len(m) == 1: m = '0' + m\n\tif h == (m[1]+m[0]):\n\t\treturn True\n\treturn False\n\n\nminutos = 0\nh, m = list(map(int, input().split(\":\")))\n\npali = is_p(h, m)\n\nwhile not pali:\n\tminutos += 1\n\tm += 1\n\tif m >= 60:\n\t\th = (h + 1) % 24\n\t\tm = 0\n\tpali = is_p(h, m)\n\nprint(minutos)\n\n \t\t\t \t\t \t \t\t\t \t\t\t \t \t\t", "time = input()\r\nhour, minute = map(int, time.split(':'))\r\ncount = 0\r\nwhile hour % 10 != minute // 10 or hour // 10 != minute % 10:\r\n minute += 1\r\n if minute == 60:\r\n minute = 0\r\n hour = (hour + 1) % 24\r\n count += 1\r\nprint(count)", "# 05:39 + 11 min -> 05:50 \r\ndef isPalindrome(hour): # hour -> 4 digitos $$$$\r\n left = 0\r\n right = len(hour) - 1 \r\n while left < right :\r\n if hour[left] == hour[right] :\r\n left += 1\r\n right -= 1 #(1) ep de korra 8========D\r\n else:\r\n return False\r\n return True \r\n\r\ninp = input()\r\nhour = inp[:2] + inp[3:] #4 digitos [0 1 2 3] \"0539\"\r\n\r\ncount = 0\r\n\r\nwhile not isPalindrome(hour):\r\n digit_4 = int(hour[3])\r\n digit_3 = int(hour[2])\r\n digit_2 = int(hour[1])\r\n digit_1 = int(hour[0])\r\n digit_4 += 1\r\n if digit_4 > 9 :\r\n digit_3 += 1\r\n digit_4 = 0\r\n if digit_3 == 6:\r\n digit_2 += 1\r\n digit_3 = 0\r\n if digit_2 > 9:\r\n digit_1 += 1\r\n digit_2 = 0\r\n if digit_1 == 2 and digit_2 == 4:\r\n digit_1 = digit_2 = 0\r\n count += 1\r\n hour = str(digit_1) + str(digit_2) + str(digit_3) + str(digit_4)\r\nprint(count)\r\n\r\n ", "time = input()\r\nhours, mins = map(int, time.split(':'))\r\n\r\nsleep_more = 0\r\nwhile True:\r\n\tcurr_time = \"%02d:%02d\" % (hours, mins)\r\n\r\n\tif curr_time == curr_time[::-1]:\r\n\t\tprint(sleep_more)\r\n\t\tbreak\r\n\r\n\tmins += 1\r\n\r\n\tif mins > 59:\r\n\t\tmins = 0\r\n\t\thours += 1\r\n\r\n\tif hours == 24:\r\n\t\thours = 0\r\n\r\n\tsleep_more+=1\r\n\r\n", "def f(x, y):\r\n xx = str(x)\r\n if len(xx) == 1: xx = '0' + xx\r\n yy = str(y)\r\n if len(yy) == 1: yy = '0' + yy\r\n return yy[::-1] != xx\r\n\r\nread = lambda: map(int, input().split(':'))\r\na, b = read()\r\ncnt = 0\r\nwhile f(a, b):\r\n b += 1\r\n if b == 60:\r\n a += 1\r\n b = 0\r\n if a == 24:\r\n a = 0\r\n cnt += 1\r\nprint(cnt)", "def palidrome(hr,mn):\r\n if hr <= 9:\r\n hr = \"0\" + str(hr)\r\n else:\r\n hr = str(hr)\r\n if mn <= 9:\r\n mn = \"0\" + str(mn)\r\n else:\r\n mn = str(mn)\r\n if hr[::-1] == mn:\r\n return True\r\n else:\r\n return False\r\nhr,mn = map( int, input().split(':') )\r\n# print(hr,mn)\r\npali = False\r\nans = 0\r\nwhile pali != True:\r\n if mn == 60:\r\n mn = 0\r\n hr = int(hr) + 1\r\n if hr == 24:\r\n hr = 0\r\n #check if palidrone\r\n if palidrome(hr,mn):\r\n pali = True\r\n break\r\n # print(hr, mn)\r\n mn = int(mn) + 1\r\n ans += 1\r\nprint(ans)\r\n", "\r\nimport sys\r\n\r\n#read the input.\r\n\r\ntime = sys.stdin.readline()\r\nminutesString = time[3] + time[4]\r\nminutes = int( minutesString )\r\n\r\nhoursString = time[0] + time[1]\r\nhours = int( hoursString )\r\n\r\n\r\nhoursOriginal = hours\r\nminutesOriginal = minutes\r\n\r\n#is the current time a palindrome?\r\n#I actually think this won't work: there'll be problems if minutes and/or hours is just one digit.\r\n#while not (str(hours)[0] == str(minutes)[1] and str(hours)[1] == str(minutes)[0]) :\r\nwhile not (hours % 10 == minutes // 10 and hours // 10 == minutes % 10) :\r\n #add one minute.\r\n minutes = minutes + 1\r\n if minutes == 60 :\r\n minutes = 0\r\n hours = hours + 1\r\n if hours == 24 :\r\n hours = 0\r\n\r\n#how much time passed?\r\nminutesElapsed = (hours - hoursOriginal) * 60 + (minutes - minutesOriginal)\r\n#be careful about cases where we wrapped around to the next day.\r\nif minutesElapsed < 0 :\r\n minutesElapsed = minutesElapsed + 24*60\r\n\r\nprint( minutesElapsed )\r\n", "# LUOGU_RID: 121533926\ndef bb(hh,mm):\r\n ha=hh//10\r\n hb=hh%10\r\n ma=mm//10\r\n mb=mm%10\r\n if ha==mb and hb==ma:\r\n return True\r\nhh,mm=map(int,input().split(':'))\r\ncount=0\r\nwhile True:\r\n if bb(hh,mm):\r\n break\r\n else:\r\n mm+=1\r\n count+=1\r\n if mm==60:\r\n mm=0\r\n hh+=1\r\n if hh==24:\r\n hh=0\r\nprint(count)", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n\r\ndef check(s1 , s2):\r\n s1 = s1[::-1]\r\n if s1 == s2 :\r\n return True\r\n return False\r\n\r\n\r\ns = input()\r\n\r\ns1 = s[0] + s[1]\r\ns2 = s[3] + s[4]\r\n\r\nans = (check(s1 , s2))\r\nif ans:\r\n print('0')\r\n exit(0)\r\n\r\nh1 = int(s1[0])\r\nh2 = int(s1[1])\r\nm1 = int(s2[0])\r\nm2 = int(s2[1])\r\ncnt = 0\r\n\r\nwhile True:\r\n\r\n m2 +=1\r\n if m2 == 10:\r\n m2 = 0\r\n m1 +=1\r\n\r\n if m1 == 6 :\r\n m1 = 0\r\n h2 +=1\r\n\r\n if h2 == 10 :\r\n h2 = 0\r\n h1 += 1\r\n\r\n if h2 == 4 :\r\n if h1 == 2 :\r\n h2 = 0\r\n h1 = 0\r\n\r\n\r\n cnt+=1\r\n if h1 == m2 and h2 == m1 :\r\n break\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n\r\n", "h,m=map(int,input().split(':'))\r\ni=0\r\na=h\r\nb=m\r\nwhile(1):\r\n if(h%10==m//10 and h//10==m%10):\r\n break\r\n m+=1\r\n i+=1\r\n if(m>59):\r\n h+=1\r\n h=h%24\r\n m=0\r\nprint(i)", "h,m=map(int,input().split(':'))\r\ni=0\r\nwhile h//10!=m%10 or h%10!=m//10:\r\n i+=1\r\n m+=1\r\n if m==60:\r\n h+=1\r\n h=h%24\r\n m=0\r\nprint(i)", "def main():\r\n h, m = map(int, input().split(':'))\r\n d1, d2, d3, d4 = 0, 0, 0, 0\r\n for i in range(24*60):\r\n d1 = h // 10\r\n d2 = h % 10\r\n d3 = m // 10\r\n d4 = m % 10\r\n if (d1 == d4 and d2 == d3):\r\n print(i)\r\n break\r\n m += 1;\r\n if (m == 60):\r\n m = 0\r\n h += 1\r\n if (h == 24):\r\n h = 0\r\n\r\nmain()", "m, n = input().split(':')\r\na, b = int(m), int(n)\r\nc = 0\r\nwhile True:\r\n if a<10 and b>=10:\r\n s = '0' + str(a) + str(b)\r\n elif a>=10 and b<10:\r\n s = str(a) + '0' + str(b)\r\n elif a<10 and b<10:\r\n s = '0' + str(a) + '0' + str(b)\r\n else:\r\n s = str(a) + str(b)\r\n\r\n if s == s[::-1]:\r\n break\r\n else:\r\n if a == 23 and b == 59:\r\n a = 0\r\n b = 0\r\n c += 1\r\n elif b == 59:\r\n a += 1\r\n b = 0\r\n c += 1\r\n else:\r\n b += 1\r\n c += 1\r\nprint(c)", "s=input()\r\nl=s.split(':')\r\nh=int(l[0])\r\nm=int(l[1])\r\ncnt=0\r\n#print(h,\":\",m)\r\nwhile(s!=s[4]+s[3]+s[2]+s[1]+s[0]):\r\n m=m+1\r\n if(m>=60):\r\n h=h+1\r\n m=00\r\n if(h>23):\r\n h=24-h\r\n if(m<=9 and h<=9):\r\n s='0'+str(h)+\":0\"+str(m)\r\n elif(m<=9):\r\n s=str(h)+':0'+str(m)\r\n elif(h<=9):\r\n s='0'+str(h)+':'+str(m)\r\n else:\r\n s=str(h)+':'+str(m)\r\n # print(s)\r\n cnt+=1\r\nprint(cnt)", "def is_pal(tim):\r\n if tim[0] % 10 == int(tim[1]/10) and int(tim[0]/10) == tim[1] % 10:\r\n return True\r\n else:\r\n return False\r\ndef add_minute(tim):\r\n tim[1] = tim[1] + 1\r\n if tim[1] == 60:\r\n tim[1] = 0\r\n tim[0] = tim[0] + 1\r\n if tim[0] == 24:\r\n tim[0] = 0\r\n\r\ntim = list(map(int, input().split(\":\")))\r\nk = 0\r\nb = True\r\nwhile b:\r\n if is_pal(tim):\r\n b = False\r\n print(k)\r\n else:\r\n k = k + 1\r\n add_minute(tim)\r\n", "import sys,math\r\nfrom collections import deque\r\nimport random\r\n#input = sys.stdin.buffer.readline\r\n\r\n\r\n# def solve():\t\r\n# \treturn;\r\n\r\n\r\n# for _ in range(int(input())):\r\n# \tsolve()\r\n\r\ndef addOne(h,m):\r\n\tif m<59:\r\n\t\tm+=1\r\n\t\treturn h,m\r\n\telse:\r\n\t\tm = 0\r\n\t\th = (h+1)%24\r\n\t\treturn h,m\r\n\r\ndef isPalindrome(h,m):\r\n\tif h//10 == m%10 and h%10 == m//10:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\nti = input().split(\":\")\r\n\r\nh = int(ti[0])\r\nm = int(ti[1])\r\n\r\ncnt=0\r\nwhile 1>0:\r\n\tif isPalindrome(h,m):\r\n\t\tbreak\r\n\r\n\th,m = addOne(h,m)\r\n\tcnt+=1\r\nprint(cnt)", "from sys import stdin\r\nimport math\r\n\r\na=stdin.readline()\r\n\r\nA=int(a[0]+a[1])\r\nB=int(a[3]+a[4])\r\ncount=0\r\n\r\nwhile True:\r\n if math.floor(B/10)+(B%10)*10==A:\r\n print (count)\r\n break\r\n else:\r\n if B==59:\r\n B=0\r\n if A<23:\r\n A+=1\r\n else:\r\n A=0\r\n else:\r\n B+=1\r\n count+=1", "h, m = map(int, input().split(':'))\r\n\r\ndef isPal(s1, s2):\r\n\tif s1[0] == s2[1] and s1[1] == s2[0]:\r\n\t\treturn True\r\n\treturn False\r\n\r\nk = 0\r\ni = h\r\nj = m\r\nf = False\r\nwhile i < 24 and not f:\r\n\thh = ((\"0\" + str(i)) if i // 10 == 0 else str(i))\r\n\twhile j < 60 and not f:\r\n\t\tmm = ((\"0\" + str(j)) if j // 10 == 0 else str(j))\r\n\t\tif isPal(hh, mm):\r\n\t\t\tf = True\r\n\t\t\tbreak\r\n\t\tk += 1\r\n\t\tj += 1\r\n\ti += 1\r\n\tj = 0\r\n\r\nprint(k)", "s = input()\r\nans = 0\r\n \r\nwhile s != s[::-1]:\r\n minutes = int(s[:2]) * 60 + int(s[3:]) + 1\r\n s = str(minutes // 60 % 24).zfill(2) + ':' + str(minutes % 60).zfill(2)\r\n ans += 1\r\n \r\nprint(ans)", "inp = input().replace(':', '')\nl = ['0000', '0110', '0220', '0330', '0440', '0550', '1001', '1111', '1221', '1331', '1441', '1551', '2002', '2112', '2222', '2332']\nans = 0\nif inp in l:\n ans = 0\nelse:\n counter = 0\n while counter < len(l) and l[counter] < inp:\n counter += 1\n h, m = int(inp[0:2]), int(inp[-2:])\n s = l[counter] if counter < len(l) else '2400'\n hi, mi = int(s[0:2]), int(s[-2:]) \n if hi - h > 0:\n if mi > m:\n ans = (hi-h)*60+mi-m\n else:\n ans = (hi-h-1)*60+mi+60-m\n else:\n ans = mi-m\nprint(ans)\n", "import sys\nif __name__ == '__main__':\n for line in sys.stdin:\n hhMm = line.strip().split(\":\")\n hh = int(hhMm[0])\n mm = int(hhMm[1])\n \n for d in range(24*60):\n mm2 = mm + d\n hh2 = hh + (mm2 // 60)\n mm2 %= 60\n hh2 %= 24\n wakeUpTime = \"{:02}:{:02}\".format(hh2, mm2)\n if wakeUpTime == wakeUpTime[::-1]:\n print(d)\n break\n \n \n\t \t\t\t\t \t \t \t \t \t\t \t\t \t\t \t\t \t\t", "a,b = map(int,input().split(':'))\r\ni = 0\r\nwhile((a % 10 != b // 10) or (a // 10 != b % 10)):\r\n b += 1\r\n i += 1\r\n if b == 60:\r\n a += 1 \r\n a %= 24\r\n b = 0\r\nprint(i)", "HOUR = 24\r\nMIN = 60\r\n\r\n\r\ndef pal_time(hour: int, minute: int) -> bool:\r\n if not (0 <= hour < HOUR and 0 <= minute < MIN):\r\n raise ValueError(f\"the time {hrs}:{mins} is out of bounds\")\r\n clock = str(hour).zfill(len(str(HOUR))) + str(minute).zfill(len(str(MIN)))\r\n return clock == clock[::-1]\r\n\r\n\r\nhrs, mins = [int(i) for i in input().split(':')]\r\nif not (0 <= hrs < HOUR and 0 <= mins < MIN):\r\n raise ValueError(f\"the time {hrs}:{mins} is out of bounds\")\r\n\r\ntime = 0\r\nwhile not pal_time(hrs, mins):\r\n mins += 1\r\n time += 1\r\n if mins == MIN:\r\n mins = 0\r\n hrs += 1\r\n if hrs == HOUR:\r\n hrs = 0\r\n\r\nprint(time)\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nH,M=map(int,input().split(\":\"))\r\nfor i in range(24*60):\r\n th=int((H+int((i+M)/60))%24)\r\n tm=int((M+i)%60)\r\n if int(th/10)==tm%10 and th%10==int(tm/10):\r\n print(i)\r\n break\r\n", "h, m = map(int, input().split(':'))\r\n\r\nfor i in range(999):\r\n if h == 10 * (m % 10) + m // 10:\r\n print(i)\r\n break\r\n h, m = (h, m + 1) if m < 59 else ((h + 1) % 24, 0)", "s=input()\na=[0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412, 1440]\nh=int(s[0:2])\nm=int(s[3:])\nminu=h*60+m\n\nif minu in a:\n print(0)\n\nelse:\n i=0\n while minu>a[i] and i<16:\n i+=1\n \n print(a[i]-minu)\n\t\t \t \t\t\t\t \t\t\t \t\t\t \t\t \t", "n,k = map(int, input().split(\":\"))\r\n \r\nans = 0\r\n \r\nwhile (True):\r\n\t\r\n\trk = int(str(k)[::-1])\r\n \r\n\tif(len(str(k)) == 1):\r\n\t\trk = int(str(k)+'0')\r\n \r\n\tif(rk == n):\r\n\t\tbreak\r\n\telif(k < 59):\r\n\t\tk += 1\r\n\telif(k == 59):\r\n\t\tk = 0\r\n\t\tif(n < 23):\r\n\t\t\tn += 1\r\n\t\telse:\r\n\t\t\tn = 0\r\n\t\t\t\r\n \r\n\tans += 1\r\n \r\nprint(ans)", "# // Problem: A. Karen and Morning\r\n# // Contest: Codeforces - Codeforces Round #419 (Div. 2)\r\n# // URL: https://codeforces.com/problemset/problem/816/A\r\n# // Memory Limit: 512 MB\r\n# // Time Limit: 2000 ms\r\n# // \r\n# // Powered by CP Editor (https://cpeditor.org)\r\n\r\ns = input()\r\nh = int(s[:2])\r\nm = int(s[3:])\r\ntime = (h * 60) + m\r\ntemp = time\r\npalindrome = [0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412]\r\n\r\nflag = time\r\nwhile True:\r\n\tif flag in palindrome:\r\n\t\tbreak\r\n\ttime += 1\r\n\tflag += 1\r\n\tif flag == 1440:\r\n\t\tflag = 0\r\nprint(abs(time - temp))", "s = input()\nk = 0\nans = 0\nwhile(s != s[::-1]):\n k += 1\n t = int(s[3:])+1\n if t == 60:\n u = str((int(s[:2])+1)%24)\n s = \"0\"*(2-len(u)) + u + \":00\"\n else:\n s = s[:3] + \"0\"*(2-len(str(t))) + str(t)\nprint(k)\n\n\n", "def palindrome(hour, minute):\r\n if hour == minute[::-1]:\r\n return True\r\n return False\r\n\r\ntime = input().split(':')\r\nh, m = time[0], time[1]\r\nhh, mm = int(time[0]), int(time[1])\r\niterated = 0\r\n\r\nwhile not palindrome(h, m):\r\n mm = mm + 1\r\n if mm >= 60:\r\n mm = 0\r\n hh = hh+1\r\n\r\n if hh >= 24:\r\n hh = 0\r\n\r\n if hh < 10:\r\n h = '0' + str(hh)\r\n else:\r\n h = str(hh)\r\n\r\n if mm < 10:\r\n m = '0' + str(mm)\r\n else:\r\n m = str(mm)\r\n\r\n iterated = iterated + 1\r\n\r\nprint(iterated)\r\n", "stime = input()\r\nh,m = stime.split(\":\")\r\nt = int(h)*60+int(m)\r\nmn = 1500\r\nfor ht in [\"00\",\"01\",\"02\",\"03\",\"04\",\"05\",\"10\",\"11\",\"12\",\"13\",\"14\",\"15\",\"20\",\"21\",\"22\",\"23\"]:\r\n mt = ht[::-1]\r\n t2 = int(ht)*60+int(mt)\r\n mn = min(mn,(t2-t+24*60)%(24*60))\r\nprint(mn)\r\n ", "class Clock:\r\n def __init__(self, time_str):\r\n self.hours, self.minutes = map(int,time_str.split(\":\"))\r\n def up(self):\r\n if self.minutes == 59:\r\n self.hours+=1\r\n if self.hours == 24:\r\n self.hours = 0\r\n self.minutes = 0\r\n else:\r\n self.minutes+=1\r\n def __str__(self):\r\n return f\"{Clock._fix(str(self.hours))}:{Clock._fix(str(self.minutes))}\"\r\n @staticmethod\r\n def _fix(time_str):\r\n if len(time_str) == 1:\r\n return \"0\" + time_str\r\n return time_str\r\ns = Clock(input())\r\nx = 0\r\nwhile str(s) != str(s)[::-1]:\r\n s.up()\r\n x+=1\r\nprint(x)", "import datetime\r\n\r\n\r\nc = input()\r\nstart_clock = datetime.datetime.strptime(c, '%H:%M')\r\nend_clock = datetime.datetime.strptime(c, '%H:%M')\r\n\r\nwhile end_clock.strftime('%H') != end_clock.strftime('%M')[::-1]:\r\n end_clock += datetime.timedelta(minutes=1)\r\n\r\nprint(int((end_clock-start_clock).total_seconds() // 60))", "s=input()\r\nc=0\r\nt=1\r\ns1=s[:2]\r\ns2=s[3:]\r\nwhile(s1!=s2[::-1]):\r\n s1=int(s1)\r\n s2=int(s2)\r\n c+=1\r\n s2+=1\r\n if(s2==60):\r\n s2=0\r\n s1+=1\r\n if(s1==24):\r\n s1=0\r\n s1=str(s1)\r\n s2=str(s2)\r\n if(len(s1)==1):\r\n s1='0'+s1\r\n if(len(s2)==1):\r\n s2='0'+s2\r\n #print(s1,s2)\r\nprint(c)\r\n", "h,m=map(int,input().split(':'))\r\ni=0\r\nwhile h//10+h%10*10-m:h,m,i=(h+m//59)%24,(m+1)%60,i+1\r\nprint(i)", "hh,mm = [int(i) for i in input().split(':')]\r\n\r\ndef is_palindorme(hh,mm):\r\n\tif hh < 10 :\r\n\t\thh = '0'+str(hh)\r\n\tif mm < 10:\r\n\t\tmm = '0'+str(mm)\r\n\thh = str(hh)\r\n\tmm = str(mm)\r\n\tif mm[1]+mm[0]+hh[1]+hh[0] == hh+mm:\r\n\t\treturn True\r\n\treturn False\r\nans = 0\r\nwhile not(is_palindorme(hh,mm)):\r\n\tmm+=1\r\n\tif mm > 59 :\r\n\t\tmm = mm-60\r\n\t\thh+=1\r\n\tif hh > 23:\r\n\t\thh = 0\r\n\tans+=1\r\nprint(ans)\r\n", "def solve(time,h,m):\r\n ans = 0\r\n curh = time[:2]\r\n curh2 = int(curh)\r\n curm = time[3:]\r\n curm2 = int(curm)\r\n while True:\r\n if curh[0]==curm[-1] and curh[-1]==curm[0]:\r\n return ans\r\n ans+=1\r\n curm2+=1\r\n curh2+=curm2//m\r\n curm2%=m\r\n curh2%=h\r\n\r\n if curh2<10:\r\n curh = \"0\"+str(curh2)\r\n else:\r\n curh = str(curh2)\r\n if curm2<10:\r\n curm = '0' + str(curm2)\r\n else:\r\n curm = str(curm2)\r\ntime = input()\r\n#time = map(int,input().split())\r\nprint(solve(time, 24, 60))\r\n", "s=input()\r\na=[0,70,140,210,280,350,601,671,741,811,881,951,1202,1272,1342,1412]\r\nn=int(s[:2])*60+int(s[3:])\r\nres=1500\r\nfor i in a:\r\n if i>=n:\r\n res=min(res,i-n)\r\n else:\r\n res=min(res,1440+i-n)\r\nprint(res)", "t=input().replace(':','')\r\nhh=t[:2]\r\nmm=t[2:]\r\nc=0\r\n\r\nwhile True:\r\n x='0'*(2-len(hh))+hh\r\n y='0'*(2-len(mm))+mm\r\n #print((x+y)[::-1])\r\n if x+y==(x+y)[::-1]: print(c);break \r\n mm=str(int(mm)+1)\r\n if int(mm)==60: hh=str(int(hh)+1); mm='0'\r\n if int(hh)==24: hh='0'\r\n c+=1", "def solve(h, m):\r\n ans = 0\r\n while f'{h:02d}:{m:02d}' != ''.join(reversed(f'{h:02d}:{m:02d}')):\r\n ans += 1\r\n m += 1\r\n if m == 60:\r\n m = 0\r\n h += 1\r\n if h == 24:\r\n h = 0\r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n h, m = map(int, input().split(':'))\r\n print(solve(h, m))", "now = list(map(int, input().split(\":\")))\r\nnow = now[0] * 60 + now[1]\r\ni = now\r\nwhile True:\r\n h = str(i // 60).rjust(2, '0')\r\n m = str(i % 60).rjust(2, '0')\r\n if h[::-1] == m:\r\n print((i - now) % (24 * 60))\r\n break\r\n else:\r\n i += 1\r\n i %= (24 * 60)\r\n", "h=input()\r\nk=h.split(\":\")\r\nm=k[0]\r\nn=k[1]\r\nm1=int(m)\r\nn1=int(n)\r\nr=int(m[::-1])\r\nrev=int(n[::-1])\r\n\r\nif m1==rev:\r\n print(\"0\")\r\n\r\nelse:\r\n if n1<r and r<60 :\r\n print(r-n1)\r\n else:\r\n if m1==23:\r\n print(60-n1)\r\n elif m1>=5 and m1<10:\r\n print((10-m1-1)*60+(60-n1)+1)\r\n elif m1>=15 and m1<20:\r\n print((20-m1-1)*60+(60-n1)+2)\r\n else:\r\n n=r+10\r\n print(n+60-n1)", "def reverse(string):\n l = list(string)\n l.reverse()\n return ''.join(l)\n\ndef is_palindrome(string):\n rev = reverse(string)\n for i in range(len(string)):\n if string[i] != rev[i]:\n return False\n return True\n\nstring = input()\nhour, minutes = map(int, string.split(':'))\nc = 0\n\nwhile not is_palindrome(string):\n c += 1\n minutes += 1\n if minutes == 60:\n minutes = 0\n hour += 1\n if hour == 24:\n hour = 0\n minstr = '0' + str(minutes) if minutes < 10 else str(minutes)\n hrstr = '0' + str(hour) if hour < 10 else str(hour)\n string = hrstr + ':' + minstr\n\nprint(c)\n \t \t \t \t\t \t \t \t\t \t", "a=input().split(\":\");i=0\r\nwhile(a[0]!=a[1][::-1]):\r\n i+=1;a[1]=str(int(a[1])+1)\r\n if a[1]==\"60\":a[1]=\"00\";a[0]=str((int(a[0])+1)%24)\r\n a[0]=(\"0\" if len(a[0])==1 else \"\") +a[0];a[1]=(\"0\" if len(a[1])==1 else \"\") +a[1]\r\nprint(i)", "def is_palindrom(x):\r\n xrev = \"\"\r\n for i in range(len(x) - 1, -1, -1):\r\n xrev += x[i]\r\n return x == xrev\r\n\r\n\r\ns = input().split(\":\")\r\ntime = list((map(int, s)))\r\nstring_time = s\r\ncount = 0\r\nfor i in range(5000):\r\n if is_palindrom(string_time[1] + string_time[0]):\r\n print(count)\r\n break\r\n\r\n time[1] += 1\r\n count += 1\r\n\r\n if time[1] % 60 == 0:\r\n time[0] += 1\r\n time[1] = 0\r\n string_time[1] = '00'\r\n if time[0] % 24 == 0:\r\n time[0] = 0\r\n string_time[0] = '00'\r\n\r\n string_time = [str(time[0]), str(time[1])]\r\n if len(string_time[0]) == 1:\r\n string_time[0] = '0' + string_time[0]\r\n if len(string_time[1]) == 1:\r\n string_time[1] = '0' + string_time[1]", "n,k = map(int, input().split(\":\"))\n\nans = 0\n\nwhile (True):\n\t\n\trk = int(str(k)[::-1])\n\n\tif(len(str(k)) == 1):\n\t\trk = int(str(k)+'0')\n\n\tif(rk == n):\n\t\tbreak\n\telif(k < 59):\n\t\tk += 1\n\telif(k == 59):\n\t\tk = 0\n\t\tif(n < 23):\n\t\t\tn += 1\n\t\telse:\n\t\t\tn = 0\n\t\t\t\n\n\tans += 1\n\nprint(ans)", "def c(t):\r\n h = str(t//60)\r\n m = str(t%60)\r\n \r\n return f'{h.rjust(2, \"0\")}:{m.rjust(2, \"0\")}'\r\n\r\ndef ispal(s):\r\n for i in range(len(s)):\r\n if s[i] != s[len(s)-i-1]:\r\n return False\r\n \r\n return True\r\n\r\nini = input().split(':')\r\ntime = int(ini[0])*60 + int(ini[1])\r\ntini = time\r\n\r\nwhile True:\r\n curr = c(time)\r\n \r\n if ispal(curr):\r\n ans = time - tini\r\n \r\n if ans < 0:\r\n ans += 1440\r\n \r\n print(ans)\r\n \r\n break\r\n \r\n time = (time+1)%1440", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\ns=input()\r\nif s[::-1]==s:\r\n\tprint(0)\r\nelse:\r\n\th=int(s[0:2])\r\n\tm=int(s[3:])\r\n\tfor i in range(1,10000):\r\n\t\tm+=1\r\n\t\tif m==60:\r\n\t\t\tm=0\r\n\t\t\th+=1\r\n\t\tif h==24:\r\n\t\t\th=0\r\n\t\ts=str(h).zfill(2)+str(m).zfill(2)\r\n\t\tif s[::-1]==s:\r\n\t\t\tprint(i)\r\n\t\t\tbreak", "def ispal(hh, mm):\r\n if (hh//10 == mm%10) and (hh%10 == mm//10):\r\n return True\r\n else:\r\n return False\r\n\r\ntime = input()\r\nhh, mm = map(int, time.split(sep = ':'))\r\nans = 0\r\n\r\nwhile not ispal(hh,mm):\r\n mm = (mm + 1)%60\r\n if mm==0:\r\n hh = (hh+1)%24\r\n ans = ans + 1\r\nprint(ans)", "tiempo = input()\n\nh1 = int(tiempo[0])\nh2 = int(tiempo[1])\nm1 = int(tiempo[3])\nm2 = int(tiempo[4])\n\nans = 0\n\nif (h1 == m2 and h2 == m1) :\n print(ans)\n \nelse :\n\n while(True) :\n m2 += 1\n \n if (m2 == 10):\n m2 = 0\n m1 += 1\n\n if (m1 == 6) :\n m1 = 0\n h2 += 1\n \n if (h2 == 10) :\n h1 += 1\n h2 = 0\n\n if (h1 == 2) :\n if (h2 == 4) :\n h1 = 0\n h2 = 0\n\n ans += 1\n\n if (h1 == m2 and h2 == m1) :\n break\n \n\n print(ans)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx = list(map(int, input().decode().split(\":\")))\r\nans = 0\r\nwhile True:\r\n if x[0] // 10 == x[1] % 10 and x[1] // 10 == x[0] % 10:\r\n break\r\n ans += 1\r\n x[1] += 1\r\n if x[1] == 60:\r\n x[0] += 1\r\n x[1] = 0\r\n if x[0] == 24:\r\n x[0], x[1] = 0, 0\r\nprint(ans)", "hh, mm = map(int,input().split(':'))\r\nans = 0\r\nwhile (hh%10) != (mm//10) or (hh//10) != (mm%10):\r\n mm +=1\r\n if mm == 60:\r\n mm = 0\r\n hh += 1\r\n if hh == 24:\r\n hh = 0\r\n ans += 1\r\nprint(ans)", "# hrs, mins = [ str(x) for x in str(input()).split(':') ]\r\nhrs, mins = [ int(x) for x in str(input()).split(':') ]\r\n\r\n\r\n# time = list(int(x) for x in time.split(':'))\r\n# print(hrs)\r\n# print(mins)\r\n\r\n\r\n\r\nsleep = 0\r\n\r\ndef tick():\r\n global sleep\r\n global mins\r\n global hrs\r\n # nonlocal sleep\r\n sleep += 1\r\n # mins = int(mins)\r\n mins += 1\r\n if(mins > 59):\r\n mins %= 60\r\n hrs += 1\r\n # mins = \"{:0>2d}\".format(mins)\r\n\r\n # hrs=int(hrs)\r\n if(hrs > 23):\r\n hrs %= 24\r\n # hrs = \"{:0>2d}\".format(hrs)\r\n\r\ndef palindrome_time():\r\n time = '' + '{:0>2d}'.format(hrs) + ':' + '{:0>2d}'.format(mins)\r\n return time == time[::-1] \r\n\r\nwhile(not palindrome_time()):\r\n tick()\r\n\r\n# print(palindrome_time())\r\n# print(hrs)\r\n# print(mins)\r\n\r\nprint(sleep)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# time.remove(':')\r\n\r\n# print(time)\r\n\r\n\r\n# class Time:\r\n# sleep = 0\r\n# def __init__(self,hrs, mins):\r\n# self.hrs = hrs\r\n# self.mins = mins\r\n \r\n# def tick(self):\r\n# self.sleep += 1\r\n# self.mins += 1\r\n# if(self.mins > 59):\r\n# self.mins %= 60\r\n# self.hrs += 1\r\n# if(self.hrs > 23):\r\n# self.hrs %= 24\r\n\r\n# def get_time(self):\r\n# return ''+str(self.hrs)+str(self.mins)\r\n# # return [self.hrs, self.mins]\r\n\r\n\r\n\r\n# moment = Time(time[0], time[1])\r\n\r\n# time = [ str(x) for x in time ]\r\n# target = ''.join(time)\r\n\r\n# target = str(list(target).reverse())\r\n\r\n# print(target)\r\n# while(target != moment.get_time()):\r\n# moment.tick()\r\n\r\n# print(moment.sleep)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# target_hr = abs(time[0] - 12)\r\n# target_min = abs(time[1] - 60)\r\n\r\n# while(time != time.reverse())", "h, m = map(int, input().split(':'))\r\nc = 0\r\nwhile True:\r\n r = (m % 10) * 10 + m // 10\r\n if r == h:\r\n print(c)\r\n break\r\n c += 1\r\n m += 1\r\n if m == 60:\r\n m = 0\r\n h += 1\r\n if h == 24:\r\n h = 0", "\r\n#n=int(input())\r\n#a=list(map(int,input().split()))\r\n\r\ns=input()\r\n\r\nh=int(s[0:2])\r\nm=int(s[3:5])\r\n\r\nmm=h*60+m\r\n\r\nfor i in range(mm,24*60+1):\r\n h2=i//60\r\n m2=i%60\r\n if((h2//10==m2%10 and h2%10==m2//10) or i==24*60):\r\n print(i-mm);\r\n quit()\r\n\r\n\r\n\r\n", "ch=input()\r\nch1=ch[0]+ch[1]\r\nch2=ch[3]+ch[4]\r\na=int(ch1)\r\nb=int(ch2) \r\ns=0\r\ndef pal(a,b):\r\n return (a==(b%10)*10+b//10)\r\nif pal(a,b):\r\n print(0)\r\nelse:\r\n while pal(a,b)==False:\r\n s=s+1\r\n if b!=59 :\r\n b=b+1\r\n else :\r\n b=0\r\n if a!=23:\r\n a=a+1\r\n else :\r\n a=0\r\n \r\n \r\n print(s)", "h,m = map(int, input().split(':'))\n\ndur = True\nans = -1\nwhile (dur == True):\n dur = False if (h//10 == m % 10 and h % 10 == m // 10) else True\n m = 0 if (m + 1) == 60 else m + 1\n h = (h + 1) % 24 if m == 0 else h\n ans += 1\n\nprint (ans)\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(s):\r\n h = int(s[0:2])\r\n m = int(s[3:5])\r\n cnt = 0\r\n while True:\r\n s = str(h).zfill(2) + ':' + str(m).zfill(2)\r\n if s == s[::-1]:\r\n return cnt\r\n m += 1\r\n if m == 60:\r\n m -= 60\r\n h += 1\r\n if h == 24:\r\n h = 0\r\n cnt += 1\r\n return -1\r\n\r\ndef main():\r\n s = input()\r\n print(solve(s))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def f():\r\n global a, b\r\n if a == '23' and b == '59':\r\n a = '00'\r\n b = '00'\r\n return\r\n \r\n if b == '59':\r\n a = str(int(a) + 1)\r\n if len(a) == 1:\r\n a = '0' + a\r\n \r\n b = '00'\r\n return\r\n \r\n b = str(int(b) + 1)\r\n if len(b) == 1:\r\n b = '0' + b\r\n\r\n\r\ndef f1(s):\r\n res = ''\r\n for i in range(len(s)):\r\n res += s[len(s) - i - 1]\r\n \r\n return res\r\n\r\n\r\ns = input()\r\na = s[:2]\r\nb = s[3:]\r\n\r\nans = 0\r\nwhile a + b != f1(b) + f1(a):\r\n f()\r\n ans += 1\r\n \r\nprint(ans)", "\r\ndef process(S):\r\n h, m = S.split(':')\r\n h = int(h)\r\n m = int(m)\r\n t = h*60+m\r\n for i in range(24*60+1):\r\n t2 = (t+i) % (24*60)\r\n h2 = t2//60\r\n m2 = t2 % 60\r\n h2 = str(h2).zfill(2)\r\n m2 = str(m2).zfill(2)\r\n full_time = h2+m2 \r\n if full_time==full_time[::-1]:\r\n return i\r\n \r\nS = input()\r\nprint(process(S))", "from sys import maxsize, stdout, stdin,stderr\r\nmod = 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\nfrom math import log2,sqrt\r\nfrom collections import defaultdict\r\ns = S()\r\nh, m = int(s[:2]) , int(s[3:])\r\nmi =0\r\nb= int(m)\r\nwhile h%10 != m//10 or m%10!=h//10:\r\n m+=1\r\n mi+=1\r\n if m==60:\r\n h+=1\r\n m%=60\r\n h%=24\r\nprint(mi)\r\n\r\n\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 sys\nimport os\nimport math\nimport re\n\n\ns = input()\n\n\ndef palindrome(h,m):\n return h//10 == m % 10 and h % 10 == m//10\n\nh = int(s[:2])\nm = int(s[3:])\n\ncount = 0\n\nwhile palindrome(h,m) is False:\n m += 1\n if (m > 59):\n m = 0\n h += 1\n if h > 23:\n h = 0\n count += 1\n\n\nprint(count)\n \n\n", "time = input().split(\":\");\n#print (time);\ndef palindrome(time):\n\tif time[0] == time[3] and time[1] == time[2] :\n\t\treturn True;\n\telse:\n\t\treturn False;\n\ntime = time[0] + time[1]\n#print(time);\ncounter = 0;\nminutes = int(time[2:])\nhours = int(time[:2])\n#print (minutes,hours)\nwhile (not palindrome(time)):\n\tminutes += 1;\n\tminutes = minutes % 60;\n\tif (minutes == 0):\n\t\thours += 1;\n\thours = hours % 24;\n\tif (hours < 10):\n\t\tif (minutes < 10):\n\t\t\ttime = \"0\"+str(hours) +\"0\"+str(minutes);\n\t\telse:\n\t\t\ttime = \"0\"+str(hours) +str(minutes);\n\telse:\n\t\tif (minutes < 10):\n\t\t\ttime = str(hours) +\"0\"+str(minutes);\n\t\telse:\n\t\t\ttime = str(hours) +str(minutes);\n\tcounter += 1;\n\nprint (counter);", "m,n=map(int,input().split(':'))\ncnt=0\nwhile (m%10!=n//10 or m//10!=n%10):\n\tcnt+=1\n\tn+=1\n\tif(n>=60):\n\t\tm+=1\n\t\tn%=60\n\tif(m>=24):\n\t\tm%=24\nprint(cnt)\n", "h,m=map(int,input().split(':'))\r\nm+=h*60\r\nr=0\r\nwhile f'{m//60:02}'!=f'{m%60:02}'[::-1]:\r\n m=(m+1)%1440\r\n r+=1\r\nprint(r)", "(hours, minutes) = map(str, input().split(':'))\n\nhours_int = int(hours)\nminutes_int = int(minutes)\n\nsleep_additional_minutes = 0\n\nif hours == minutes[::-1]:\n print('0')\nelse:\n while True:\n minutes_int += 1\n str_minutes_int = str(minutes_int)\n sleep_additional_minutes += 1\n str_hours_int = str(hours_int)\n if minutes_int == 60:\n minutes_int = 0\n hours_int += 1\n if hours_int == 24:\n hours_int = 0\n if len(str(minutes_int)) == 1:\n str_minutes_int = '0' + str(minutes_int)\n if len(str(hours_int)) == 1:\n str_hours_int = '0' + str(hours_int)\n\n if str_minutes_int == str_hours_int[::-1]:\n break\n\n\n print(sleep_additional_minutes)\n\n\n", "palindrome = [0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412, 1440]\r\n\r\nH, M = map(int, input().split(':'))\r\nmin = H*60+M\r\nif min in palindrome: print(0)\r\nelse:\r\n\tfor i in range(0, 16):\r\n\t\tif palindrome[i] < min and min < palindrome[i+1]:\r\n\t\t\tprint(palindrome[i+1]-min)\r\n\t\t\tbreak", "from collections import deque\nfrom sys import stdin\nlines = deque(line.strip() for line in stdin.readlines())\n\ndef nextline():\n return lines.popleft()\n\ndef types(cast):\n return tuple(int(x) for x in nextline().split())\n\ndef ints():\n return types(int)\n\ndef strs():\n return nextline().split()\n\ndef main():\n # lines will now contain all of the input's lines in a list\n t = nextline().split(':')\n w = 0\n while True:\n if t[0][::-1] == t[1]:\n print(w)\n return\n m = (int(t[1]) + 1) % 60\n if m == 0:\n h = (int(t[0]) + 1) % 24\n t[0] = '{:02d}'.format(h)\n t[1] = '{:02d}'.format(m)\n w += 1\n\nif __name__ == '__main__':\n main()\n", "s=input()\r\nh=int(s[:2])\r\nm=int(s[3:])\r\nx=0\r\nwhile((h%10)!=(m//10) or (h//10)!=(m%10)):\r\n m+=1\r\n h+=m//60\r\n \r\n m=m%60\r\n h=h%24\r\n x+=1\r\nprint(x)", "s = input()\r\ninput_1 = int(s[0])\r\ninput_2 = int(s[1])\r\ninput_3 = int(s[3])\r\ninput_4 = int(s[4])\r\n\r\nans = 0\r\n\r\nwhile True:\r\n if(input_1 == input_4 and input_2 == input_3):\r\n break\r\n input_4 += 1\r\n if (input_4 > 9):\r\n input_3 += 1\r\n input_4 = 0\r\n if (input_3 > 5):\r\n input_2 += 1\r\n input_3 = 0\r\n input_4 = 0\r\n if (input_1 != 2 and input_2 > 9):\r\n input_1 += 1\r\n input_2 = 0\r\n input_3 = 0\r\n input_4 = 0\r\n if (input_1 == 2 and input_2 > 3):\r\n input_1 = 0\r\n input_2 = 0\r\n input_3 = 0\r\n input_4 = 0\r\n\r\n ans += 1\r\n\r\nprint(ans)", "from bisect import bisect_left \r\nl = [0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412]\r\ns = input().split(':')\r\nt = 60 * int(s[0]) + int(s[1])\r\nj = bisect_left(l, t)\r\nif(j == len(l)):\r\n print(24 * 60 - t)\r\nelse:\r\n print(l[j] - t)", "def f(s):\r\n for i in range(len(s)):\r\n if s[i] != s[len(s)-i-1]:\r\n return False\r\n return True\r\n\r\na,b = list(map(int,input().split(':')))\r\nans = 0\r\nwhile not f((str(a) if len(str(a)) == 2 else '0'+str(a))+(str(b) if len(str(b))==2 else '0'+str(b))):\r\n b += 1\r\n if b == 60:\r\n b = 0\r\n a += 1\r\n if a == 24:\r\n a = 0\r\n ans += 1\r\nprint(ans)\r\n", "rawtime = input()\nhours = int(rawtime[0:2])\nminutes = int(rawtime[3:5])\n\ndef isPal(s):\n\ta = list(s)\n\ta.reverse()\n\treturn list(s) == a\n\ndef formatTime(hours, minutes):\n\ttime = ''\n\tif hours < 10:\n\t\ttime += '0'\n\ttime += str(hours)\n\ttime += ':'\n\tif minutes < 10:\n\t\ttime += '0'\n\ttime += str(minutes)\n\treturn time\n\ncount = 0\n\nwhile not isPal(formatTime(hours, minutes)):\n\tcount += 1\n\tif minutes < 59:\n\t\tminutes += 1\n\telse:\n\t\tif hours < 23:\n\t\t\thours += 1\n\t\t\tminutes = 0\n\t\telse:\n\t\t\thours = 0\n\t\t\tminutes = 0\n\nprint(count)\n \t\t\t\t \t \t\t \t \t \t", "h,m=[int(x) for x in input().split(':')] \r\nif h==23 and m>32:\r\n print(60-m)\r\nelse :\r\n cnt=0\r\n while True:\r\n if ((h//10) ==(m%10)) and ((h%10) == (m//10)):\r\n print(cnt)\r\n break \r\n if m ==59:\r\n h+=1\r\n m=0\r\n else:\r\n m+=1\r\n cnt+=1 ", "# May the Speedforce be with us...\r\n'''\r\nfor _ in range(int(input())):\r\narr=list(map(int,input().split()))\r\nn,k=map(int,input().split())\r\nn=int(input())\r\ns=input()\r\n\r\nfrom collections import defaultdict\r\nd=defaultdict()\r\n\r\nd=dict()\r\ns=set()\r\ns.intersection()\r\ns.union()\r\ns.difference()\r\n\r\n\r\nproblem statement achhe se padhna hai\r\nage se bhi dekhna hai, piche se bhi dekhna hai\r\n'''\r\nfrom math import gcd,ceil\r\nfrom collections import defaultdict as dd\r\ndef lcm(a,b):\r\n\treturn (a*b)//gcd(a,b)\r\ndef inin():\r\n\treturn int(input())\r\ndef inar():\r\n\treturn list(map(int,input().split()))\r\ndef ar(element,size):\r\n\treturn [element for i in range(size)]\r\ndef digitsum(num):\r\n\tsu=0\r\n\twhile(num):\r\n\t\tsu+=num%10\r\n\t\tnum//=10\r\n\treturn su\r\n\r\nhh,mm=input().split(':')\r\nhh=int(hh)\r\nmm=int(mm)\r\ncnt=0\r\nwhile((hh%10)!=(mm//10) or (mm%10)!=(hh//10)):\r\n\tmm+=1\r\n\tcnt+=1\r\n\tif mm==60:\r\n\t\tmm=0\r\n\t\thh+=1\r\n\t\thh%=24\r\n\t#print(hh,mm)\r\nprint(cnt)\r\n", "h,m=(int(x) for x in input().split(\":\"));\r\na=0;\r\nwhile((h//10)!=(m%10) or (h%10)!=(m//10)):\r\n a+=1;\r\n m+=1;\r\n if (m==60):\r\n h=h+1;\r\n m=0;\r\n if(h==24):\r\n h = 0;\r\nprint(a);", "s = input()\nh, m = map(int, s.split(\":\"))\nt = h * 60 + m\n\nfor i in range(t, t + 1440):\n th = (i%1440) // 60\n tm = (i%1440) % 60\n ts = \"{:02d}:{:02d}\".format(th, tm)\n if ts == ts[::-1]:\n print(i - t)\n break", "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\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\ndef convert_to_min(hhmm):\r\n h, m = map(int, hhmm.split(':'))\r\n return 60*h + m\r\n\r\ndef solve():\r\n s = I().strip()\r\n lucky = []\r\n for i in range(25):\r\n hh = '{0:0=2d}'.format(i)\r\n mm = hh[::-1]\r\n if int(mm) <= 59:\r\n lucky.append(convert_to_min(hh + ':' + mm))\r\n\r\n x = convert_to_min(s)\r\n ans = math.inf\r\n for t in lucky:\r\n if t >= x:\r\n ans = min(ans, t-x)\r\n else:\r\n ans = min(ans, 24*60-x + t)\r\n print(ans)\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()", "n = input()\r\ncount = 0\r\nwhile True:\r\n if n[0] == n[4] and n[1] == n[3]:\r\n break\r\n minutes = int(n[3]) * 10 + int(n[4])\r\n hours = int(n[0]) * 10 + int(n[1])\r\n minutes += 1\r\n if minutes == 60:\r\n hours += 1\r\n minutes = 0\r\n if hours == 24:\r\n hours = 0\r\n n = str(hours // 10) + str(hours % 10) + \":\" + str(minutes // 10) + str(minutes % 10)\r\n count += 1\r\n \r\nprint(count)", "a,b=(int(i) for i in input().split(':'))\r\ndef ispal(a,b):\r\n if a<10:\r\n a='0'+str(a)\r\n if b<10:\r\n b='0'+str(b)\r\n a=str(a)\r\n b=str(b)\r\n if a[-1]==b[-2] and a[-2]==b[-1]:\r\n return True\r\nx=0 \r\nwhile True:\r\n if ispal(a,b):\r\n print(x)\r\n quit()\r\n b+=1\r\n x+=1\r\n if b==60:\r\n a+=1\r\n b=0\r\n if a==24:\r\n a=0\r\n \r\n\r\n", "time = input()\nh,m = time.split(sep=':')\nh,m = int(h), int(m)\nreverse_h = (h % 10) * 10 + (h // 10)\n\nif reverse_h < 60 and reverse_h - m >= 0:\n print(reverse_h - m)\nelse:\n result = 60 - m\n h = (h + 1) % 24\n reverse_h = (h % 10) * 10 + (h // 10)\n while reverse_h >= 60:\n result += 60\n h = (h + 1) % 24\n reverse_h = (h % 10) * 10 + (h // 10) \n print(result + reverse_h)\n \t \t\t \t\t\t\t \t \t \t\t", "#problem75\r\nh,m=list(map(int,input().split(':')))\r\na=0\r\nwhile h//10!=m%10 or h%10!=m//10:\r\n a+=1\r\n m+=1\r\n if m>=60:\r\n h+=1\r\n h%=24\r\n m%=60\r\nprint(a)\r\n", "Count = 0\r\nHour, Min = list(map(int, input().split(\":\")))\r\nCount = 0\r\nwhile str(Hour).rjust(2, \"0\") != \"\".join(reversed(str(Min).rjust(2, \"0\"))):\r\n Min += 1\r\n if Min == 60:\r\n Hour += 1\r\n Min = 0\r\n if Hour == 24:\r\n Hour = 0\r\n Count += 1\r\nprint(Count)\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: Preparing for UBCOMP4 and new starting\r\n# CodeNumber: 610\r\n", "def incr(s):\r\n x, y = map(int, s.split(':'))\r\n y += 1\r\n if y == 60:\r\n y = 0\r\n x += 1\r\n x %= 24\r\n return f'{x:02}:{y:02}'\r\n\r\nx = input()\r\nt = 0\r\nwhile x != x[::-1]:\r\n x = incr(x)\r\n t += 1\r\nprint(t)", "def is_palindrome(a, b):\r\n a = str(a).zfill(2)\r\n b = str(b).zfill(2)\r\n return a == b[::-1]\r\n\r\n\r\nh, m = [int(i) for i in input().split(\":\")]\r\nk = 0\r\nwhile not is_palindrome(h, m):\r\n k += 1\r\n m += 1\r\n if m == 60:\r\n m = 0\r\n h = (h + 1) % 24\r\nprint(k)\r\n", "from bisect import bisect\r\nl=[0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881,951, 1202, 1272, 1342, 1412, 1440]\r\ns,k=map(int,input().split(\":\"))\r\np=s*60+k\r\nk=bisect(l,p)\r\nif p==l[k-1]:\r\n print(0)\r\nelse:\r\n print(l[k]-p)\r\n", "\r\nhh,mm=input().split(':')\r\nhh=int(hh)\r\nmm=int(mm)\r\ncnt=0\r\nwhile((hh%10)!=(mm//10) or (mm%10)!=(hh//10)):\r\n\tmm+=1\r\n\tcnt+=1\r\n\tif mm==60:\r\n\t\tmm=0\r\n\t\thh+=1\r\n\t\thh%=24\r\n\t#print(hh,mm)\r\nprint(cnt)\r\n", "def is_palindrome(time):\r\n return time == time[::-1]\r\n\r\n\r\ndef from_ints_to_time(hour, minute):\r\n result = ''\r\n if hour < 10:\r\n result += '0'\r\n result += str(hour)\r\n result += ':'\r\n\r\n if minute < 10:\r\n result += '0'\r\n result += str(minute)\r\n\r\n return result\r\n\r\n\r\ndef advance(hour, minute):\r\n new_minute, new_hour = 0, hour\r\n\r\n new_minute = minute + 1\r\n if new_minute == 60:\r\n new_minute = 0\r\n new_hour = hour + 1\r\n if new_hour == 24:\r\n new_hour = 0\r\n\r\n return new_hour, new_minute\r\n\r\n\r\ndef main():\r\n hour, minute = [int(elem) for elem in input().split(':')]\r\n\r\n counter = 0\r\n while True:\r\n time = from_ints_to_time(hour, minute)\r\n if is_palindrome(time):\r\n break\r\n\r\n hour, minute = advance(hour, minute)\r\n counter += 1\r\n\r\n print(counter)\r\n\r\nmain()\r\n", "def check(h, m):\r\n\tif (h%10)*10+h//10 == m:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\nh, m = map(int, input().split(':'))\r\ntime = 0\r\nwhile check(h, m) == False:\r\n\tm += 1\r\n\tif m == 60:\r\n\t\tm = 0\r\n\t\th += 1\r\n\tif h == 24:\r\n\t\th = 0\r\n\ttime += 1\r\nprint(time)", "s = input()\r\n# s = '05:39'\r\nh = s[:2]\r\nm = s[3:]\r\nhours = int(h)\r\nmins = int(m)\r\ntotal = 0 \r\n\r\n\r\ndef is_pal(h:int, m:int):\r\n hours = str(h)\r\n mins = str(m)\r\n \r\n if len(hours)==1:\r\n hours = '0' + str(h)\r\n if len(mins)==1:\r\n mins = '0' +str(m)\r\n \r\n return hours[0]==mins[1] and hours[1]==mins[0]\r\n\r\nif is_pal(hours, mins):\r\n print(0)\r\nelse:\r\n # print('yolo')\r\n while not is_pal(hours, mins):\r\n mins += 1\r\n total += 1 \r\n if mins == 60:\r\n hours += 1\r\n mins = 0\r\n\r\n if hours == 24:\r\n hours = 0\r\n \r\n print(total)\r\n# print(is_pal(int(h), int(m)))\r\n", "A=input()\r\nh=A[0]+A[1]\r\nm=A[3]+A[4]\r\nz=h+m\r\nif(z==z[::-1]):\r\n\tprint(0)\r\nelse:\r\n\tc=0\r\n\twhile(z!=z[::-1]):\r\n\t\tim=int(m)\r\n\t\tih=int(h)\r\n\t\tif(im<59):\r\n\t\t\tm=str(im+1)\r\n\t\t\tif(int(m)<10):\r\n\t\t\t\tm=\"0\"+m\r\n\t\t\tc=c+1\r\n\t\telif(im>=59):\r\n\t\t\th=str(ih+1)\r\n\t\t\tif(int(h)<10):\r\n\t\t\t\th=\"0\"+h\r\n\t\t\tm=str(0)\r\n\t\t\tif(int(m)<10):\r\n\t\t\t\tm=\"0\"+m\r\n\t\t\tc=c+1\r\n\t\tif(int(h)>23):\r\n\t\t\th=str(0)\r\n\t\t\tif(int(h)<10):\r\n\t\t\t\th=\"0\"+h\r\n\t\tz=str(h)+str(m)\r\n\t# print(\"h&m is \",h,m)\r\n\t\t\r\n\t# print(z)\r\n\tprint(c)\t\r\n", "h, m = map(int, input().split(':'))\r\n\r\nfor i in range(24*60):\r\n\r\n s = str(h).zfill(2)+str(m).zfill(2)\r\n if s == s[::-1]:\r\n print(i)\r\n exit()\r\n\r\n m += 1\r\n h += m // 60\r\n m %= 60\r\n h %= 24\r\n", "def main():\n read = lambda: tuple(map(int, input().split()))\n def to2(v):\n s = str(v)\n if v < 10:\n return \"0\" + s\n return s\n def isPal(h,m):\n if h == 24:\n h = 0\n s1 = to2(h) + to2(m)\n return s1 == s1[::-1]\n \n h, m = map(int, input().split(\":\"))\n t = h * 60 + m\n t1 = t\n k = 0\n while not isPal(t1 // 60, t1 % 60):\n t1 += 1\n print(t1 - t)\nmain()\n", "s=input()\r\nh=int(s[:2])\r\nm=int(s[3:5])\r\n\r\ncount=0\r\nwhile True:\r\n\tif(s==s[::-1]):\r\n\t\tprint(count)\r\n\t\texit()\r\n\tm+=1\r\n\tcount+=1\r\n\tif(m==60):\r\n\t\tm=0\r\n\t\th+=1\r\n\tif(h==24):\r\n\t\th=0\r\n\ta=str(h)\r\n\tif(len(a)==1):\r\n\t\ta='0'+a\r\n\tb=str(m)\r\n\tif(len(b)==1):\r\n\t\tb='0'+b\r\n\ts=a+b", "def nn(k):\r\n if k < 10:\r\n return '0' + str(k)\r\n return str(k)\r\n\r\ntime = input()\r\nh = int(time[0] + time[1])\r\nm = int(time[3] + time[4])\r\nres = 0\r\nwhile nn(h) + nn(m) != (nn(h) + nn(m))[::-1]:\r\n if m == 59:\r\n if h == 23:\r\n h = 0\r\n m = 0\r\n else:\r\n h += 1\r\n m = 0\r\n else:\r\n m += 1\r\n res += 1\r\nprint(res)", "from datetime import datetime\r\n\r\nt = datetime.strptime(input().rstrip(), '%H:%M')\r\n\r\npal = [j + \":\" + j[::-1] for j in [((\"0\" if i < 10 else \"\") + str(i)) for i in [0, 1, 2, 3, 4, 5, 10, 11, 12, 13, 14, 15, 20, 21, 22, 23]]]\r\nmin_diff = 3600 * 24\r\nfor time in pal:\r\n T = datetime.strptime(time, '%H:%M')\r\n diff = (T - t).seconds\r\n min_diff = min(diff, min_diff)\r\n\r\nprint(min_diff // 60)\r\n", "# LUOGU_RID: 121510348\nhour,min=map(int,input().split(':'))\r\nhours=hour%10*10+hour//10\r\ncnt=0\r\nwhile True:\r\n if hours==min:\r\n break\r\n min+=1\r\n cnt+=1\r\n if min==60:\r\n hour+=1\r\n min=0\r\n if hour==24:\r\n hour=0\r\n hours = hour % 10 * 10 + hour // 10\r\nprint(cnt)", "s1=input().split(\":\")\r\ncount=0\r\nhr=int(s1[0])\r\nmint=int(s1[1])\r\ns=s1[0]+\":\"+s1[1]\r\nwhile s!=s[::-1]:\r\n\tcount+=1\r\n\tmint+=1\r\n\tif mint==60:\r\n\t\thr+=1\r\n\t\tmint=0\r\n\tif hr==24:\r\n\t\thr=0\r\n\tif hr<10:\r\n\t\thr1=\"0\"+str(hr)\r\n\telse:\r\n\t\thr1=str(hr)\r\n\tif mint<10:\r\n\t\tmint1=\"0\"+str(mint)\r\n\telse:\r\n\t\tmint1=str(mint)\r\n\ts=hr1+\":\"+mint1\r\nprint(count)", "w = input()\r\nhh, mm = w.split(\":\")\r\nn = 0\r\nwhile True:\r\n hm = 60 * int(hh) + int(mm) + n\r\n h, m = (hm // 60) % 24, hm % 60\r\n sh, sm = f'{h:02}', f'{m:02}'\r\n if sh == sm[::-1]:\r\n print(n)\r\n break\r\n n += 1", "a=input()\r\nb=a[0:2]\r\nc=a[3:5]\r\nx=0\r\nwhile b[0]!=c[1] or b[1]!=c[0]:\r\n\tc=str(int(c)+1)\r\n\tif int(c)<10:\r\n\t\tc=\"0\"+c\r\n\tif int(c)==60:\r\n\t\tc=\"00\"\r\n\t\tb=str(int(b)+1)\r\n\t\tif int(b)<10:\r\n\t\t\tb=\"0\"+b\r\n\tif int(b)==24:\r\n\t\tb=\"00\"\r\n\tx=x+1\r\nprint(x)", "\r\nhh ,mm = input().split(\":\")\r\ndef ispalindrome(H,M):\r\n if(H[0] == M[1] and H[1] == M[0]):\r\n return True\r\n return False\r\n\r\nflag = minute = 0\r\nwhile True:\r\n if(ispalindrome(hh,mm)):\r\n print(minute)\r\n break \r\n if(int(mm[1]) == 9 ):\r\n temp = mm \r\n mm = str(int(temp[0]) + 1) + \"0\"\r\n else:\r\n temp = mm \r\n mm = temp[0] + str(int(temp[1]) + 1)\r\n \r\n minute += 1 \r\n if(int(mm)>59):\r\n mm = \"00\" \r\n if(int(hh)<23):\r\n temp = hh \r\n hh = str(int(temp) + 1)\r\n if(len(hh) < 2):\r\n hh = \"0\" + hh \r\n else:\r\n hh =\"00\"\r\n", "h, m = map(int, input().split(':'))\r\n\r\nans = 0\r\nwhile int((('0' if m < 10 else '') + str(m))[::-1]) != h:\r\n\tans += 1\r\n\tm += 1\r\n\tif m == 60:\r\n\t\tm = 0\r\n\t\th += 1\r\n\t\tif h == 24:\r\n\t\t\th = 0\r\n\r\nprint(ans)", "h,m,a=map(int,input().split(':')+[0])\n\nwhile h%10!=m//10 or h//10!=m%10:\n\n a,m=a+1,m+1\n\n if m==60:h+=1;h%=24;m=0\n\nprint(a)\n\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "import math\r\n\r\ndef main_function():\r\n hh, mm = [int(i) for i in input().split(\":\")]\r\n counter = 0\r\n while True:\r\n if mm == 60:\r\n if hh == 23:\r\n hh = 0\r\n mm = 0\r\n else:\r\n hh += 1\r\n mm = 0\r\n if len(str(hh)) == 2:\r\n if int(str(hh)[1] + str(hh)[0]) == mm:\r\n print(counter)\r\n break\r\n elif len(str(hh)) == 1:\r\n if int(str(hh) + \"0\") == mm:\r\n print(counter)\r\n break\r\n counter += 1\r\n mm += 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "s=list(map(int,input().split(':')))\r\ni=0\r\nwhile s[0]%10*10+s[0]//10!=s[1]:\r\n i+=1\r\n s[1]+=1\r\n s[0]+=s[1]//60\r\n s[1]%=60\r\n s[0]%=24\r\nprint(i)\r\n#print(' '.join([str(i) for i in s]))", "current_time=str(input())\r\nhour=int(current_time[0:2])\r\nminute=int(current_time[3:])\r\ncounter=0\r\ndosao_je_tren=False\r\nwhile dosao_je_tren != True:\r\n a=str(str(hour)+str(minute))\r\n if hour<10:\r\n a=str(\"0\"+str(hour)+str(minute))\r\n if minute<10:\r\n a=str(str(hour)+\"0\"+str(minute))\r\n if hour<10 and minute<10:\r\n a=str(\"0\"+str(hour)+\"0\"+str(minute))\r\n if a==a[::-1]:\r\n dosao_je_tren=True\r\n break\r\n minute+=1\r\n counter+=1\r\n if minute==60:\r\n hour+=1\r\n minute=0\r\n if hour==24:\r\n hour=0\r\nprint(counter)", "h,m=map(int,input().split(\":\"))\r\ni=0\r\nwhile h//10!=m%10 or h%10!=m//10:\r\n m=m+1\r\n i=i+1\r\n if m==60:\r\n m=0\r\n h=h+1\r\n h=h%24\r\nprint(i)", "def is_pal(s):\n return s[0] == s[-1] and s[1] == s[-2]\n\ndef get_pal(h,m):\n if h < 10:\n h = \"0\" + str(h)\n else:\n h = str(h)\n if m < 10:\n m = \"0\" + str(m)\n else:\n m = str(m)\n return h +\":\" + m\n\ns = input()\nif is_pal(s):\n print(0)\nelse:\n h = int(s[:2])\n m = int(s[3:])\n if h == 23 and m > 32:\n print(60 - m)\n else:\n out = 0\n while not is_pal(get_pal(h,m)):\n m+=1\n if m == 60:\n m = 0\n h +=1\n out +=1\n print(out)\n", "h,m=map(int,input().split(':'))\r\nl=0\r\ni=0\r\nwhile m!=((h%10)*10+h//10) and h<=23:\r\n m+=1\r\n if m>=60:\r\n h+=1\r\n m=0\r\n i+=1\r\nprint(i)\r\n ", "def increase_time(h:int,m:int):\n t = h*60+m+1\n return (t//60)%24,t%60\n\ndef stringify(h: int, m:int):\n if m < 10:\n m = f'0{m}'\n if h <10:\n h = f'0{h}'\n return f'{h}:{m}'\n\n\n\ndef solve(s):\n count = 0\n while s != \"\".join(reversed(s)):\n h,m = s.split(\":\")\n h = int(h)\n m = int(m)\n h,m = increase_time(h,m)\n s = stringify(h,m)\n count+=1\n return count\n \n\n\ndef main():\n # vars = list(map(int, input().split(\" \")))\n # n = int(input())\n # arr = []\n # for _ in range(n):\n # l = list(input())\n # arr.append(l)\n s = input()\n\n # s = input()\n # a = list(map(int, input().split(\" \")))\n # b = list(map(int, input().split(\" \")))\n # c = list(map(int, input().split(\" \")))\n # res = []\n # for _ in range(n):\n # arr = list(map(int, input().split(\" \")))\n # res.append(arr)\n print(solve(s))\n # i = 0\n # inputpath = 'input.txt'\n # outPath = 'output.txt'\n # with open(inputpath) as fp:\n # line = fp.readline()\n # cnt = 1\n # while line:\n # if cnt == 1:\n # i = int(line)\n # else:\n # arr = list(map(int, line.split(\" \")))\n # res.append(arr) \n # cnt += 1\n # line = fp.readline()\n # s = solve(res,i)\n # with open(outPath, 'a') as out:\n # out.write(str(s))\n\n\nmain()", "h,m = map(int,input().split(\":\"))\r\ns = [0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412]\r\ntime = h*60+m\r\nres = 1500\r\nif time in s:\r\n res = 0\r\nelse:\r\n for i in s:\r\n if i>=time:\r\n res = (min(res,i-time))\r\n else:\r\n res = (min(res,1440+i-time))\r\nprint(res)", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nimport random\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef check(s):\n a,b=s.split(\":\")\n x=a+b\n y=x[-1::-1]\n return x==y\ns=input().strip()\np,q=s.split(\":\")\nans=0\nwhile(not(check(p+\":\"+q))):\n x=int(q)+1\n x%=60\n y=int(p)\n if(x==0):\n \n y+=1\n y%=24\n if(y<10):\n p=\"0\"+str(y)\n else:\n p=str(y)\n if(x<10):\n q=\"0\"+str(x)\n else:\n q=str(x)\n #print(p,q)\n ans+=1\nprint(ans)\n", "def ispal(h:str, m:str):\r\n global answer\r\n if h.__len__()!=2:\r\n h=\"0\"+h\r\n\r\n if m.__len__() != 2:\r\n m = \"0\" + m\r\n\r\n x = (h==m[::-1])\r\n if x==False:\r\n return False\r\n print(answer)\r\n return True\r\n\r\n\r\nh, m = input().split(':')\r\nanswer = 0\r\nfor i in range(0,24):\r\n for j in range(0,60):\r\n if ispal(str((int(h)+i+ ((int(m)+j)//60>=1))%24),\r\n str((int(m)+j)%60)):\r\n exit()\r\n answer+=1\r\n", "stime = input()\r\nh,m = stime.split(\":\")\r\nt = int(h)*60+int(m)\r\n\r\nfor i in range(24*60):\r\n ti = t+i\r\n ti %= (24*60)\r\n ht = str(ti//60)\r\n mt = str(ti%60)\r\n if len(ht)==1:\r\n ht = \"0\"+ht\r\n if len(mt)==1:\r\n mt= \"0\"+mt\r\n if ht== mt[::-1]:\r\n print(i)\r\n exit()", "\nPAL = ['00:00', '01:10', '02:20', '03:30', '04:40', '05:50', '10:01', '11:11', '12:21',\n'13:31', '14:41', '15:51', '20:02', '21:12', '22:22', '23:32', '24:00']\n\ndef hourToMin(s):\n a = int(s[0])\n b = int(s[1])\n c = int(s[3])\n d = int(s[4])\n return (a*10 + b)*60 + c*10 + d\n\ndef solve(s):\n mS = hourToMin(s)\n for w in PAL:\n mW = hourToMin(w)\n if mS <= mW:\n return mW - mS\n return \n\ns = input()\nx = solve(s)\nprint(x)", "\"\"\"\nIIIIIIIIIIII??IIII??????????????????????????????????????7$$$$$$$$$$$$$$$$ZZZZZZZZZZZZZZZZZ$$$$$$$$$$$7$???????????????????????????????????????????????????????????????????????????????????????????IIIIII\nIIIIIIIIIIIIIIIIII??????I?????????????????????????????7$$Z$$$$$$$$Z$$$ZZZZZZZZZZZZZZZZZZZZ$$$$$$$$$$$$$$$7+???????????????????????????????????????????????????????????????????????????????????IIIIIIIIII\nIIIIIIIIIIIIIIIIIIII?????????????????????????????????$$ZZ$$$$$$$ZZ$$$ZZZZZZZZZZZZZZZZZZ$$$$$$$$$ZZ$$$$$$$$$I??????????????????????????????????????????????????????????????????????????????IIIIIIIIIIIIII\nIIIIIIIIIIIIIIIIIIII??????????????????????????????I7$ZZZ$$$$$ZZZZZ$ZZ$ZZZ$$ZZZZZZZZZZZ$$$$$$ZZZZZZ$$$Z$$$$$$$I????????????????????????????????????????????????????????????????????????IIIIIIIIIIIIIIIIII\n????IIIIIIIIIIIIIIII??????????????????????????????ZZZOZZZZZZZZZ$ZZZ$$ZZ$$ZZZZZZZZZZZ$$$$$$ZZZZZZZ$$Z$ZZ$$$$$$$$???????????????????????????????????????????????????????????????????????IIIIIIIIIIIIIIIIII\n=~=?IIIIIIIIIIIIII?????????III??????????????I???7ZZOOZZZZZZZZZZZZZ$ZZZ$$ZZZZZZZZZZ$77$$77$$$$Z$$77$77$ZZ$Z$$$$$$I???????????????????????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIII\n+??I?IIIIIIIIIII??+===~=????II????????????????I$ZZOOOZZZZZZOZZZZZZZZ$$$$$$$$$$$Z$$$$$$$$$$$$Z$$$77$$77777ZZ$ZZZ$$I??????????????????????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIII\nIIIIIIIIIIIIIIII???+=~~~~+???????????????????I$ZOOOOZZZZZOOZZZZZ$$$$$$$$$$$$$$Z$$$$$$$$$$$7ZZ$$$$7$$$77$$Z$$$ZZZ$ZI???????????????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII\nIIIIIIIIIIIIIIIIIIII?????+????????II????????IZZOOOOOZZZOOO$Z$$$$$$$$$$$$$$$$Z$$$$$$$$$$$$$$Z$$$$$~$$?I7$$$$$Z$ZZZZ$$I?????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII\nIIIIIIIIIIIIIIIIIII?II??????I???IIII????II??7ZOOOOOOZZZ$$$$$$$$$$$$$$$$$$$$Z$$$$$$$$$$$$ZZZZZZZZ=~Z$~~ZZZ$Z$$Z$$$ZZ$$I????????????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII????IIIIZOOOOOZ$$$$$$$$$$$$$$$$$$$$$$$ZZZ$$$ZZOZOOZZZZZZ$ZZ:~~Z$~=ZZZZOZ$O$$$$ZZ$I??????????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZOOOZ$Z$$$$$Z$$$$$$$$$$$$$$$$$ZZOZZZZOOOOOOOOOZ?7ZZ::=~Z+:~+ZZZ7OOOZ$$$O$ZZ??????????????????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??I\nI?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII$OO$$$Z$$$$$Z$$$$$$$$$$$$ZZOOOOOOZZZOOOOOOOOOO$=?Z$::~~=Z,::~OZZ=OOOOO$$$Z$$Z?===++?????????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??????\n??????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII$$$$$$Z$$$$$$$$$$$$$ZZOOOOOOOOOOZZOOOOOOOOOOZ~~=Z7:::~~77:::~$ZZ+OOOOOOO$O$$$I??+???I?????????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??+:\n~::=?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII$$$$$ZZ$$ZZ$ZZZ$$$ZZZZOOOOOOOOOOOZOOOOOOOOOO7===Z=::::=:$::::~=ZZ=?OOOOOOOO$$$$II???I????????IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??=:\n::::=?I?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?$Z$ZZZZZ$$$ZZ$ZZZOOOZOOOOOOOOOOOZOOOOO+OOZZ~=~=Z::::::~:I:::::=OZ==OO$OOOOOZ$$$II??IIII??IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??~:\n::::~+IIII?IIIIIIIIIIIIIIIIIIIIIIIIIIIII$ZZZZZZZZZZZZZOOOOOOOOOOOOOOOOOOOOOOO~IOOZ~=::=:::::::::?::::::=$Z:=ZO=OOOOOOZ$$$IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII???=~::\n::::~=???????IIIIIIIIIIIIIIIIIIIIIIIIIII$ZZZZZ$ZZZZZZZOOOOO8OOOO88OOOOOOOO8+=7ZZ==~::::::::::::::::::::~?Z:=IO=OOOOOOOZ$$?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??=~~::,::\n~~~~~=+?+++++???IIIIIIIIIIIIIIIIIIIIIIII$ZZZZZZOO88OOOOOOO8OO888888OOOOOO?==8O+~=:::::::::::::::::::::::~$:=+Z=$OOOOOOZZ$7IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?IIIIIII??+~::::,:::\n~~~:~~=???+++??IIIIIIIIIIIIIIIIIIIIIIII$ZZZO8888888OOOOOO888O888888888OI===O=~=O+::::::::::::::::::::::::::~=O==OOOOOOZZZZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII???IIIIIII?=:,::,,::::\n~~~~~~~=+?IIIIIIIIIIIIIIIIIIIIIIIIIIIIIZZO88888888OOOOOOO888888888888OZZZOZZ7=:=~ZZ:::::::::::::::::::::::::~O==OOOOOOOOOZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII???I?IIII?+~:,,::::~~\n~~~~~~~~=+++??IIIIIIIIIIIIIIIIIIIIIIIIIZ8888888888OOOOOO88888888888OZ+?7OOOO8OZZZZ7OZ,:~:::::::::::::::::::::7==OOOOOOOOOZIIIIIIIIIIIIIIIIIIIIIIIIIIII????IIIIIIIIIIIIIIIIIIIIIIIII?==+++????=:,::::::~~\n~~~~~~~~~~~==??IIIIIIIIIIIIIIIIIIIIIIIIO8888888888OOOOOO8888888888OZ+=ZOOO+=8OO8OOOZ$$$:::::::::::::::::::::::~=$8OOOOOOOO7IIIIIIIIIIIIIIIIIIIIII?????=~:~=+?IIIIIIIIIIIIIIIIIII??=~:::::~~~~:,,::::::::\n~~~~~~~~==+?IIII??IIIIIIIIIIIIIIIIIIII78888888888OOOOOOO888888888OZZO88+===OZ$ZZZO8O$OZ$+:::::::::::::::::::::~=IOO888OOOO$IIIIIIIIIIIIIIIIIIIII?+~~::,,,::~+IIII???IIIIIIIIIIIII+:,,:::::::::::::::::~~\n+===+???????IIIIII??????IIIIIIIIIIIIII$8888888888OO8OOO8888888888OZZ:8+=~,,O77$O7$O=$O+7ZZ$::::::::::::::::::::++O8888OOOOZIIIIIIIIIIIIIIIIIII??+~,,::::::~~+??+=====+IIIIIIII?+=:,:::::::::::::::::~~~~\nIII?IIIIIIIIIIIIIIII????IIIIIIIIIIIIIIO8888888888OOOOOO8888888887+OO=:Z~,,,Z,$Z8I7O~~~I==ZZOOOZ$:~::::=?$OO?~::=+O8888OOOOZIIIIIIIIIIIIIIIIII?=~::::::::~~~~~~~~=====?IIII?+++=~::::::::::::~~::::~~::::\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII8888888888OOOOOO8888888888==OZ$::::,::,,7I~:7,:::::OOOOOZZZZ7OZZZZZOZZZZ$Z+O8888OOOOZIIIIIIIIIIIIIIIIII?=~:::::::~~~~~~~~=+???IIIIII?~::::::::::~~~~~~~~~:~~~:::~~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII8888888888OOOOOO888888888O=:~OZ::::,:,O?=++O,:::::=ZZOOOZZZZIZ?8888O87:IOZ$88888O8OOOIIIIIIIIIIIIIIIIII??+===~~=++++??++??IIIIIIIIII?+~~~==~~~:~~~~~~~~~~~~~~:::~~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII8888888888OO8OOO888888888I=::OZ7:~:~~,,,??,,::::::OZ+::::~=O$ZI=O$ZZOIOO:~Z88888O8OOOIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??????+==~~~~=======~~::::~~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII8888888888OO8OO8888888O88~::::OZ+::::::~~~~~:::::OZZ:::::::~O=::7OO7O~O~:~88O88888OOOIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII????I???III??====+??+==~~::::::~~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII78888888888OO8OO8888888788=:::::OZZ+::~::::::::~?OOZ::::::::IZ~,?:$7+?,~::888O88888OOOIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?=::~~=~==++==~~==+++==~~:::::::~~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZO888888888O88OO8888888?8O~:::::::ZOOZZZ7~:::::~8O$?::::::::=Z+,?+?:+::~:Z88O888888OOOIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?=,:,::::,:::::::~::~~:::::::::::~~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIO8888888888888OO888888I+8O::::::::::~::IOOOOZOOOOO::~::::::~=OZ=:I$:,:::=8888888888OOZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII+~:,:::,:::,,::::::::::::::::::::::~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII7O8888888888888OO888888+=8Z::::::::::::::::::::::::::::::::::=IZ7:,~+::::88O8888888OOO$IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII???????+~:,,,,,,,,,,,,::,,::,,,,::::::::::::\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIOO88888888D8888OO888888==OZ::::::::::::::::::::::::::::::::::II~OOZ+:~:::OO88888888OOO7IIIIIIIIIIIIIIIIIIIIIIII?+?IIII?=~~::::~~::::,,::,,,,,,,,::::,,:,::::::::::::\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIOOO88888888888888O888888==OZ:::::::::::::::::::::::::::::::::+7::::=8OOOOO8888888888OOOIIIIIIIIIIIIIIIIIIIII??+=::~+?++~::::::::,::::,,,,::::::,::,,:::::::::::~~~~~~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII?++7OO88D888888D88D88O888888==~8::::::::::::::::::::::::::::::::~~::~::::::+O88888888888OOOIIIIIIIIIIIIIIIIII??+=~::,:::::::,,:,,::,,:,,,:::::::::,,,::::::~~~~~~~~~~~~~~\nIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII??I8O88888888888888888888887==~Z::::::::::::::::::::::::::::::::::::::::::O$O8888888888OOO7IIIIIIIIIIIIIIIII?+:::::::::::::::::::::::::::~~~::::::::::::~~~~~~~~~~~~~~~~=\n??IIIIIIIIIIIIIIIIIIIIIIIIIIIIII?8OO888888888888DD88888888?==~~:::::::::::::::::::::::::::::::::::::::::~IO88888888888O8OIIIIIIIIIIIIIIII???~::,:::::::::::::,:::::::~~~~~~~~~::::::::~~~~~~~~~~~~~~~::~\n????IIIIIIIIIIIIIIIIIIIIIIIIII?IZ8O8888888888888DDD8888888=7==::::::::::::::::::::::::::::::::::::::::::OO88888888888O8OOIIIIIIIIIIIII???+++~::,,,,,:::::::::,,,,,:::~~~~~~~~~:::::~~~~~~~~~~~~~~~~~~:::\n???I?????????IIIII????IIIIII??I7OO888888DDDDDDDDDDD8888888I?==:~:::::::::::::::::::::::::::::::::::::~7OO8D888888888888OIIIIIIIIII????+=~::::,,,,,:,,,,,:::::::::::::~~~~~~~~~:::~~~~~~~~~~~~~~~~~~~~:::\n~+????????????????????????II???OOO$88D88DDDDDDDDDDD8888888==I=~:::::::::::::::::::::::::::::::::::::=ZO8$=O888888888OOO$III???????+=~~~:::::::::::::::,,::::~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~=~~==~\n:~=+??????????????????????????8OOO$88DDDDDDDDDDDDDDD888888===I=~:::::::::::::::::::::~:::::::::::::~~:::=+8D88888888OOOI?I$7????+==~~:::::::::::::::::::::::~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~=++??????+\n::::=?++?????????????????????$OO8$888DDDDDDDDDDDDDDD888888======:::::::::::::::::=??II?I$?,~~::::::::::~+8888888888OIO7I~::::~7?++=~~~~:::::~~::::::::~~~~~~~~~~~~~~~~~~~~~~===~~~~~~~~~~~==+???IIIIIIII\n:::::~:~~:::=+??????????????IOO8OI888DDDDDDDDDDDDDDD888888?======:::::::::::::::::~++++??IIZ::::::::::~=88888888D8OIOO:::::::::::::$?+======++++==~~~~~~~~~~~~~~~~~~~~~:~~~=+??++=======~=+??IIIIIIIIIII\n~~~::::::::~+++?+???????????8OO8Z?O88DDDDDDDDDDDDDDD888888I=======:::::::::::::::::~::::,~=:::::::::::?8888888888OI$:~::::~::::::::::7+???++???????++++===~~~~~~~~=+++==++????I???????+++=+????IIIIIIIII\n~~~~~~~~~~=+++++++??++?+????OOOO?7OODDDDDDDDDDDDDDDD888888Z=======?~:::::::::::::::::::::::::::::::::88888888888O?~:::::::I~:::::::::::::$??????????????++===+==++????????????????II?????????????I??II??\n++++++++++++++++++++???++++78888?O88DDDDDDDDDDDDDDDDDD8888O=========I::~::::::::::::::::~I~~?=:~::~IO8888888888O$::::::::+::::::?::::::::::$?????????????????????I???????I???????IIIIIIIIIIII???????????\n??????????+++++++++++++++++ZO88$+O88DDDDDDDDDDDDDDDDDD88888===========~?:~:::::::::~:7IO~~::::::,::::::~~+IZO8$:~~::::::~::::::=+:::::::::::::ZI????????????????????????????????????????????????????????\n+++++++++++++?+++++++++++++OO88I+O88DDDDDDDDDDDDDDDDDDDD8D8+=============?:::~::::II~::~:::$~~::::~~:::::::::::~:::::::==::::::=,:::::::::::::~~????????????????????????????????????????????????????????\n++++++++++++++++++++++++?+?$8O87+O88DDDDDDDDDDDDDDDDDDDD8D8=================?::~~:::::::::::I:::::=::::::::::7:=+~:::~=7:::::::I:::::=+::::::::::???????????????????????????????????????????????????????\n+++++++++++++++++++++++++++I888$?O88DDDDDDDDDDDDDDDDDDDD88D$================+$:~:::::7::::~:~7::~::I~~::::::~7=====7==?::::::::::::::=~::::::::::~?????????????????????????????????????????????+++++?+++\n++++++++++++++++++++++++++++OO8O+ZO88DDDDDDDDDDDDDDDDD88DD8===============7::7~~::::::?:::::::::::~~=888888O??I======+::::::::I::::::=:::::::::::::???????????????????????????????????????++++++++++++++\n++++++++++++++++++++++++++++78O8++888DDDDDDDDDDDDDDDDD88D88?===========+$:::::::::::~::I~:::::::?::~==88888O+++7=====7==+7?::~:::::::7::::::::=::::~????????????????++???????????????????+++++++++++++++\n+++++++++++++++++++++++++++++OO8O+888DDDDDDDDDDDDDDDDD8DD8OZOZOO?+====7:::::::::::::::~:$::::::::7::==~8888O++?+7====+=======7:::::::+:~:::::I=::::::++?++????+???+++++?????????+++??????+++++++++======\n++++++++++++++++++++=====+++++8O8II888DDDDDDDDDDDDDD8888+++7OZZZOZZOO::~:::::::~=~:::::::+::::::::$~==+888OO++++++7===+======~::::::~:::::::~===~:::,:I++++++++++++++++++++++++++++++++++++=============\n++==========++================+OO8?8ODDDDDDDDDDDDD8888O++++++++=IOO:~~::::::~======::::::::+::::======OOOOOO=++++=====I=====+?+==+==7::::::~+=~::::::::$+++++++======+++++++++++++==================+++=\n================================OOD=O8DDDDDDDDDDDD88DD+++++++++++?:~:::::::~======?==:::::::~~====I=+I====++~7+==?====7======?======$=~::~I?+=::::::::::=====~~::::~~===++++++++============++++++++++++\n==========================~~~~~~~O88+8DDDDDDDDDDD888D88=+++++++7::::::::::::~~=?+==II===~===7====++++====++==++++=+==+===??$$$I=====+======7$=::::::::::::=~::::::::~~~~==============++====+++++++++++=\n=====================~=~~~~~~~~~~~O88O88DDDD888O,:O88888I++++?~:~:::::::::::~====I?=I~===++?===?~=+~==+++++==I+===+7=+==I=====+?======+=====+=:::::::::::::+,::::::~~~~~================================\n=================~~~~~~~~~~~~~~~~~=?8D888ZI??+78+:8888888$++7~::::::::::::::~==+=$==+=====?===?=~7+=+++++?I~==========+I+=======+II?$~=I$$??~=::::::::::::::$+~~~~~=====================================\n==============~=~+7$7I?+???????????????????????8O,O8888888Z::::::::::::::::~====I========+==7++===+++?IO+================I==================I+=:::::::::::::7$I===========~~============================\n==========~~~=I++?????????????????????????????I8O,I88888O$:~::::::::::::::~=====?=======I?+====+++++$OO====================I=================+=~::::::::::~:=::?==============~======~~~~~~=~~~~=======~\n====~~~~~~~~I++?I+?????????????????????????????OO::8OOOO=::~::::::::::::::~===+$=+=+==========+++$??$$======~~~~========~~~~=~================+7+~:::::::~:+I::Z7=~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n~~~~~~~~~~?+???????????????????????????????????7OI:OO::~:::::::::::::::::~====?=============++?8+8????I+?++II$$7?~~~~~~~~~~~~~~=I+=========+IZ===++7~:~7~$7$:,,+?7~~~~~~~~~~~~~~~~~~~::::~~~~~~~~~~~~~~~\n~~~~~~~~~+????????+7????????????????????????????8II,::,~::~==~::::::::~=====I===============?OOOO=O??????????????+???7~=~~~~~~~~~~=~?I77?=?===~+======+$I7?,,,:I??+~~~~~~:::~~~~~~~::::::~~~~~~~~~~~~~~~\n~~~~~~~~++??????????$+????????????????????????I???+,::,:~==+==?~:~~=====++I+===============+:88OOO:8???????????????????7~~~~~~~~~~~~~~~~~=$I7I=====~7777I,,,::?+??+~~::::::::::::::::::::~~~~~~::::~~~~~\n~~~~~~==+????????????Z???????????????????????Z????++,,::,+=+====7=====$?===============+I:~::+88OOO~OI????????????????7??$~~~~~~~~~~~~~~~~$$7777==II7777,:,,~=?????$~:::::::::::::,:::::::~~::::::::~~~~\n~~~~~~~++?????????????$????????????????????I???????+?,,:::?============+===========+ZZ$$$:,?:I+OOO8O?8O???????????????+$??I~~~~~~~~:::::::++++======+I~:,,,,=7?+???+7:::,,,:::::,::::::::::::::::::~~~~~\n~~~~~~I????????????????$??????????????????$?????????+?,::::=+7=======?I+=+7?7I?:$Z$$OZOOZ$:$:~,7OO888=8O????????????????$+++~~~::::::::::~++++====$==::::::=$????????+::,,::::,,,:::::::::::::::::~~~~~~\n~~~~~?+?????????????????7????????????????I???????????++,,::::++$=+======$:$::,:::7Z$$$OOO$$,:,,,8888OO:88???????????????????++::::::::::::=+++OI=+++::::::+7$????????+::::,,,,::::::::::::::::~~~~~~~~~~\n~~~~~??????????????????????????????????$??????????????+7:,::=++++$====$7::,=:,,:,:$$$$ZOOZ$$~:,:~8888O8:O8???????????????7????+,::::::::::I+++++++++,::::+I$$I???????+?:,:,,:::::::::::::::~~~~~~~~~~~~~\n\"\"\"\na, b = map(int, input().split(\":\"))\nans = 0\nwhile True:\n\tsa, sb = str(a), str(b)\n\tif a // 10 < 1:\n\t\tsa = '0' + sa\n\tif b // 10 < 1:\n\t\tsb = '0' + sb\n\tif sa[0] == sb[1] and sa[1] == sb[0]:\n\t\tprint(ans)\n\t\texit()\n\tb += 1\n\tans += 1\n\tif b > 59:\n\t\ta += 1\n\t\tb = 0\n\tif a > 23:\n\t\ta = 0\n\t\t\n\t\n", "s = str(input())\r\narr = []\r\nfor i in s:\r\n if i != \":\":\r\n arr.append(int(i))\r\nres = 0\r\n\r\n\r\nwhile True:\r\n if arr == arr[::-1]:\r\n break\r\n\r\n arr[-1] += 1\r\n if arr[-1] == 10:\r\n arr[-1] = 0\r\n arr[-2] += 1\r\n \r\n if arr[-2] == 6:\r\n arr[-2] = 0\r\n arr[1] += 1\r\n\r\n if (arr[1] == 10) or (arr[1] == 4 and arr[0] == 2):\r\n arr[1] = 0\r\n arr[0] += 1\r\n \r\n if arr[0] == 3:\r\n arr[0] = 0\r\n\r\n res += 1\r\n\r\nprint(res)", "from sys import stdin, stdout\nMN = 200005\n\ninp = stdin.readline()\n\nh = int(inp[0]) * 10 + int(inp[1])\nm = int(inp[3]) * 10 + int(inp[4])\n\ndef pal(a, b) :\n return (((a // 10) == (b % 10)) and ((a % 10) == (b // 10)))\n\nres = 0\n\nwhile(True) :\n if(pal(h, m)) :\n stdout.write(str(res))\n exit(0)\n res += 1\n m += 1\n if(m == 60) :\n m = 0\n h += 1\n if(h == 24) :\n h = 0\n \n", "from sys import stdin\r\n\r\n\r\ndef solve(time):\r\n def ispalindrome(t):\r\n s = \"{:0>2d}:{:0>2d}\".format(t//60 % 24, t % 60)\r\n return s == s[::-1]\r\n\r\n h, m = map(int, time.split(\":\"))\r\n time = h * 60 + m\r\n for d in range(24*60):\r\n if ispalindrome(time + d):\r\n return d\r\n\r\ntime = stdin.readline()[:-1]\r\nprint(solve(time))" ]

[ "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\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nS = [int(x) for x in input()]\nA,B = map(int,input().split())\nans1,ans2 = [0]*len(S),[0]*len(S)\n\ncnt,x = 0,0\nfor i in S:\n cnt=cnt*10+i;cnt%=A\n if cnt==0:ans1[x]=1\n x+=1\n\ncnt,x = 0,1\nnum = 1\nfor i in S[::-1]:\n cnt+=i*num;cnt%=B\n if cnt==0 and i!=0:ans2[-x]=1\n num*=10;num%=B\n x+=1\n\n\nfor i in range(len(ans1)-1):\n if ans1[i]==1 and ans2[i+1]==1:\n print(\"YES\")\n print(''.join([str(x) for x in S[:i+1]]))\n print(''.join([str(x) for x in S[i+1:]]))\n exit()\nprint(\"NO\")\n", "s = str(input())\r\na, b = map(int, input().split())\r\nchk = 0\r\n\r\ndp = [0]*(len(s)+1)\r\np = 1\r\nfor i in range(len(s)-1, -1, -1):\r\n dp[i] = (dp[i+1] + int(s[i])*p) % b\r\n p = (p*10) % b\r\n\r\np=0\r\nfor i in range(len(s)-1):\r\n p = (p*10 + int(s[i])) % a\r\n if p==0 and s[i+1]!='0' and dp[i+1]==0:\r\n chk = 1\r\n print('YES')\r\n print(s[:i+1])\r\n print(s[i+1:])\r\n break\r\nif chk == 0:\r\n print('NO')", "import sys\r\nimport math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nfrom heapq import heappop, heappush, heapify\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n \r\ndef inum():\r\n return map(int,input().split())\r\n \r\ndef freq(l):\r\n d = {}\r\n for i in l:\r\n d[i] = d.get(i,0)+1\r\n return d\r\n\r\n\r\nn = input()\r\na,b = inum()\r\n\r\nif len(n) == 1:\r\n print(\"NO\")\r\n\r\nelse:\r\n\r\n pref = [int(n[0])%a]\r\n\r\n for i in range(1,len(n)):\r\n pref.append((pref[-1]*10+int(n[i]))%a)\r\n \r\n suf = [int(n[-1])%b]*len(n)\r\n\r\n f = 10\r\n for i in range((len(n)-2),-1,-1):\r\n suf[i] = (int(n[i])*f+suf[i+1])%b\r\n f *= 10\r\n f %= b\r\n \r\n f = False \r\n # print(pref)\r\n # print(suf)\r\n for i in range(len(n)-1):\r\n if pref[i] == suf[i+1] == 0 and n[i+1] != '0':\r\n f = True \r\n break\r\n if f:\r\n print(\"YES\")\r\n print(n[:i+1])\r\n print(n[i+1:])\r\n else:\r\n print(\"NO\")\r\n\r\n", "def solve(s, a, b):\r\n vec = list(); l = len(s)\r\n n = 0; e = 0; p = 1\r\n\r\n for i in range(l):\r\n n = (n*10 + int(s[i])) % a\r\n vec.append(n)\r\n for i in range(l):\r\n e = (e + int(s[-1-i])*p) % b\r\n p = (p*10) % b\r\n try:\r\n if e == 0 and vec[-2-i] == 0 and s[-1-i] != \"0\":\r\n print(\"YES\\n\" + s[:-1-i] + \"\\n\" + s[-1-i:])\r\n break\r\n except:\r\n continue\r\n else:\r\n print(\"NO\")\r\n\r\n\r\ndef main():\r\n s = input()\r\n a, b = map(int, input().split())\r\n solve(s, a, b)\r\n\r\nif __name__ == \"__main__\":\r\n main()" ]

[ "P = 1000000007\n\ndef subset_zeta_transform(a):\n n = len(a)\n assert((n & (n - 1)) == 0)\n step = 1\n while step < n:\n for i in range(n):\n if (i & step) == 0:\n a[i + step] += a[i]\n a[i + step] %= P\n step <<= 1\n\ndef subset_mobius_transform(a):\n n = len(a)\n assert((n & (n - 1)) == 0)\n step = 1\n while step < n:\n for i in range(n):\n if (i & step) == 0:\n a[i + step] -= a[i]\n a[i + step] %= P\n step <<= 1\n\ndef superset_zeta_transform(a):\n n = len(a)\n assert((n & (n - 1)) == 0)\n step = 1\n while step < n:\n for i in range(n):\n if (i & step) == 0:\n a[i] += a[i + step]\n a[i] %= P\n step <<= 1\n\ndef superset_mobius_transform(a):\n n = len(a)\n assert((n & (n - 1)) == 0)\n step = 1\n while step < n:\n for i in range(n):\n if (i & step) == 0:\n a[i] -= a[i + step]\n a[i] %= P\n step <<= 1\n\ndef walsh_hadamard_transform(a, inverse = False):\n n = len(a)\n assert((n & (n - 1)) == 0)\n step = 1\n while step < n:\n for i in range(n):\n if (i & step) == 0:\n x, y = a[i], a[i + step]\n a[i], a[i + step] = (x + y) % P, (x - y) % P\n step <<= 1\n if inverse:\n inv = pow(n, P - 2, P)\n for i in range(n):\n a[i] = a[i] * inv % P\n\ndef or_convolution(a, b):\n A, B = a[:], b[:]\n subset_zeta_transform(A)\n subset_zeta_transform(B)\n for i in range(len(A)):\n A[i] *= B[i]\n A[i] %= P\n subset_mobius_transform(A)\n return A\n\ndef and_convolution(a, b):\n A, B = a[:], b[:]\n superset_zeta_transform(A)\n superset_zeta_transform(B)\n for i in range(len(A)):\n A[i] = A[i] * B[i] % P\n superset_mobius_transform(A)\n return A\n\ndef xor_convolution(a, b):\n A, B = a[:], b[:]\n walsh_hadamard_transform(A)\n walsh_hadamard_transform(B)\n for i in range(len(A)):\n A[i] *= B[i]\n A[i] %= P\n walsh_hadamard_transform(A, True)\n return A\n\ndef subset_convolution(a, b):\n n = len(a)\n assert((n & (n - 1)) == 0)\n bit = n.bit_length()\n A = [[0] * n for _ in range(bit)]\n B = [[0] * n for _ in range(bit)]\n C = [[0] * n for _ in range(bit)]\n for mask in range(n):\n A[bin(mask).count('1')][mask] = a[mask]\n B[bin(mask).count('1')][mask] = b[mask]\n \n for i in range(bit):\n subset_zeta_transform(A[i])\n subset_zeta_transform(B[i])\n \n for i in range(bit):\n for j in range(bit):\n if i + j >= bit:\n continue\n for mask in range(n):\n C[i + j][mask] += A[i][mask] * B[j][mask] % P\n C[i + j][mask] %= P\n for i in range(bit):\n subset_mobius_transform(C[i])\n\n ans = [0] * n\n for mask in range(n):\n ans[mask] = C[bin(mask).count('1')][mask]\n return ans\n\n\nN = 1 << 17\nf = [0] * N\nf[1] = 1\nfor i in range(2, N):\n f[i] = f[i - 1] + f[i - 2]\n f[i] %= P\n\nn = int(input())\ns = list(map(int, input().split()))\n\nB = [0] * N\nfor x in s:\n B[x] += 1\n\nA = subset_convolution(B, B)\nC = xor_convolution(B, B)\n\nfor mask in range(N):\n A[mask] = A[mask] * f[mask] % P\n B[mask] = B[mask] * f[mask] % P\n C[mask] = C[mask] * f[mask] % P\n\ng = and_convolution(A, and_convolution(B, C))\nans, step = 0, 1\nwhile step < N:\n ans += g[step]\n ans %= P\n step <<= 1\nprint(ans)", "import sys\r\nreadline=sys.stdin.readline\r\n\r\ndef Hadamard(lst,n,mod=0,inverse=False):\r\n lst_=[x for x in lst]+[0]*((1<<n)-len(lst))\r\n for bit in range(n):\r\n for i in range(1<<n):\r\n ii=i^(1<<bit)\r\n if i>ii:\r\n continue\r\n lst_[i],lst_[ii]=lst_[i]+lst_[ii],lst_[i]-lst_[ii]\r\n if mod:\r\n lst_[i]%=mod\r\n lst_[ii]%=mod\r\n if inverse:\r\n if mod:\r\n inve_2=pow((mod+1)//2,n)\r\n for i in range(1<<n):\r\n lst_[i]*=inve_2\r\n lst_[i]%=mod\r\n else:\r\n pow_2=pow(2,n)\r\n for i in range(1<<n):\r\n lst_[i]/=pow_2\r\n return lst_\r\n\r\ndef XOR_Convolution(lst0,lst1,mod=0):\r\n n=(max(len(lst0),len(lst1))-1).bit_length()\r\n Hadamard_lst0=Hadamard(lst0,n,mod=mod)\r\n Hadamard_lst1=Hadamard(lst1,n,mod=mod)\r\n if mod:\r\n convolution=[x*y%mod for x,y in zip(Hadamard_lst0,Hadamard_lst1)]\r\n else:\r\n convolution=[x*y for x,y in zip(Hadamard_lst0,Hadamard_lst1)]\r\n convolution=Hadamard(convolution,n,mod=mod,inverse=True)\r\n return convolution\r\n\r\nN=int(readline())\r\nS=list(map(int,readline().split()))\r\nmod=10**9+7\r\nlst=[0]*(1<<17)\r\ncnt0=[0]*(1<<17)\r\nfor s in S:\r\n lst[s]+=1\r\nfor bit in range(1<<17):\r\n if not lst[bit]:\r\n continue\r\n bit_=((1<<17)-1)^bit\r\n while bit_:\r\n cnt0[bit|bit_]+=lst[bit]*lst[bit_]\r\n cnt0[bit|bit_]%=mod\r\n bit_-=1\r\n bit_&=~bit\r\n cnt0[bit]+=lst[bit]*lst[0]\r\n cnt0[bit]%=mod\r\ncnt1=[0]*(1<<17)\r\nfor s in S:\r\n cnt1[s]+=1\r\ncnt1=XOR_Convolution(cnt1,cnt1,mod=mod)\r\ncnt2=[0]*(1<<17)\r\nfor s in S:\r\n cnt2[s]+=1\r\nfib=[0]*(1<<17)\r\nfib[1]=1\r\nfor i in range(2,1<<17):\r\n fib[i]=(fib[i-2]+fib[i-1])%mod\r\nfor i in range(1<<17):\r\n cnt0[i]*=fib[i]\r\n cnt0[i]%=mod\r\n cnt1[i]*=fib[i]\r\n cnt1[i]%=mod\r\n cnt2[i]*=fib[i]\r\n cnt2[i]%=mod\r\nfor i in range(17):\r\n for bit in range(1<<17):\r\n if not bit>>i&1:\r\n cnt0[bit]+=cnt0[bit^1<<i]\r\n cnt0[bit]%=mod\r\n cnt1[bit]+=cnt1[bit^1<<i]\r\n cnt1[bit]%=mod\r\n cnt2[bit]+=cnt2[bit^1<<i]\r\n cnt2[bit]%=mod\r\ncnt=[cnt0[i]*cnt1[i]*cnt2[i]%mod for i in range(1<<17)]\r\nfor i in range(17):\r\n for bit in range(1<<17):\r\n if not bit>>i&1:\r\n cnt[bit]-=cnt[bit^1<<i]\r\nans=0\r\nfor i in range(17):\r\n ans+=cnt[1<<i]\r\n ans%=mod\r\nprint(ans)" ]

[ "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n):\r\n A = [1, 3, 15, 133, 2025, 37851, 1030367, 36362925, 1606008513, 87656896891, 5778121715415, 452794797220965, 41609568918940625]\r\n if n % 2==0:\r\n sys.stdout.write('0\\n')\r\n else:\r\n p = 10**9+7\r\n A1 = A[n//2] % p \r\n for i in range(1, n+1):\r\n A1 = (A1*i) % p \r\n sys.stdout.write(f'{A1}\\n')\r\n return \r\nn = int(input())\r\nprocess(n)", "import sys\r\nfrom array import array\r\nfrom math import factorial as f\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]\r\ninp_2ds = lambda dtype, n: [inp(dtype) for _ in range(n)]\r\nceil1 = lambda a, b: (a + b - 1) // b\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\n\r\nans = [1, 3, 15, 133, 2025, 37851, 1030367, 36362925]\r\nn = int(input())\r\nif n & 1:\r\n print(ans[n >> 1] * f(n) % 1000000007)\r\nelse:\r\n print(0)\r\n", "import math\nres = [0, 1, 0, 3, 0, 15, 0, 133, 0, 2025, 0, 37851, 0, 1030367, 0, 36362925, 0]\nn = int(input())\nprint(res[n] * math.factorial(n) % (10 ** 9 + 7))\n\n \t \t\t\t\t\t\t \t \t\t\t\t \t \t\t\t\t\t\t", "'''\r\nBeezMinh\r\n22:01 UTC+7\r\n31/08/2023\r\n'''\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip()\r\nans = [0, 1, 0, 18, 0, 1800, 0, 670320, 0, 734832000, 0, 890786230, 0, 695720788, 0, 150347555, 0]\r\nprint(ans[int(input())])", "import math\nans = [1, 3, 15, 133, 2025, 37851, 1030367, 36362925]\nn = int(input())\n\nif (n % 2 == 1):\n\tprint(ans[n // 2] * math.factorial(n) % 1000000007)\nelse:\n\tprint(0)", "p = int(1e9+7)\r\nT = [0,1,0,3,0,15,0,133,0,2025,0,37851,0,1030367,0,0,0]\r\n\r\nn = int(input())\r\nif n==15: print(150347555)\r\nelse:\r\n fact = T[n]\r\n for i in range(2,n+1):\r\n fact = fact*i%p\r\n print(fact)\r\n" ]

[ "from sys import stdin\ninput = stdin.readline\nn = int(input())\nm = []\nfor ni in range(n): m.append([int(x) for x in input().strip().split()])\nq = int(input())\nans = []\nfor qi in range(q):\n s, e, v = [int(x) for x in input().strip().split()]\n s-=1\n e-=1\n for i in range(n):\n for j in range(n):\n nd = m[i][s] + v + m[e][j]\n if(nd<m[i][j]):\n m[i][j] = nd\n m[j][i] = nd\n td = 0\n for i in range(n):\n for j in range(i+1, n):\n td += m[i][j]\n ans.append(td)\n #for mi in m:\n # print(mi)\nprint(*ans)\n\n", "import io, os, sys\r\n\r\nppyin = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ncpyin = sys.stdin.readline\r\ninput = ppyin if 'PyPy' in sys.version else cpyin\r\n\r\n# code starts here\r\n\r\ndef main():\r\n n = int(input())\r\n dis = [[] for x in range(n)]\r\n for i in range(n):\r\n dis[i] = [int(x) for x in input().split()]\r\n k = int(input())\r\n res = []\r\n for q in range(k):\r\n a, b, c = [int(x) for x in input().split()]\r\n a -= 1\r\n b -= 1\r\n dis[a][b] = dis[b][a] = min(dis[a][b], c)\r\n for i in range(n):\r\n dis[a][i] = min(dis[a][i], dis[a][b] + dis[a][i])\r\n dis[b][i] = min(dis[b][i], dis[b][a] + dis[a][i])\r\n for i in range(n):\r\n for j in range(i + 1, n):\r\n pa = dis[i][a] + dis[a][b] + dis[b][j]\r\n pb = dis[i][b] + dis[b][a] + dis[a][j]\r\n dis[i][j] = dis[j][i] = min(dis[i][j], min(pa, pb))\r\n tot = 0\r\n for i in range(n):\r\n for j in range(i + 1, n):\r\n tot += dis[i][j]\r\n res.append(tot)\r\n \r\n print(*res)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nk = int(input())\r\nfor y in range(k):\r\n u,v,d = map(int,input().split())\r\n u = u-1\r\n v = v-1\r\n a[u][v] = min(a[u][v],d)\r\n for i in range(n):\r\n for j in range(n):\r\n s = a[i][u] + a[u][v] + a[v][j]\r\n s2 = a[i][v] + a[u][v] + a[u][j]\r\n s1 = a[i][j]\r\n a[i][j] = min(s,s1,s2)\r\n sum1 = 0\r\n for i in range(n):\r\n sum1 += sum(a[i])\r\n print(sum1//2,end = \" \")\r\nprint()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [list(map(int, input().split())) for _ in range(n)]\r\nk = int(input())\r\nans = []\r\nfor _ in range(k):\r\n a, b, c = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n d[a][b] = min(d[a][b], c)\r\n d[b][a] = min(d[b][a], c)\r\n dab = d[a][b]\r\n db = d[b]\r\n ans0 = 0\r\n for i in range(n):\r\n di = d[i]\r\n for j in range(n):\r\n di[j] = min(di[j], di[a] + dab + db[j])\r\n for i in range(n):\r\n for j in range(i + 1, n):\r\n x = min(d[i][j], d[j][i])\r\n ans0 += x\r\n d[i][j] = x\r\n d[j][i] = x\r\n ans.append(ans0)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "city_cant = int(input())\n\ndistances = []\n\nfor i in range(city_cant):\n distances.append(list(map(int, input().split())))\n\nroads_cant = int(input())\n\nsuma = 0\nfor i in range(city_cant):\n for j in range(i+1, city_cant):\n suma += distances[i][j]\n\nfin = \"\"\n\nfor i in range(roads_cant):\n city_a, city_b, length = map(int, input().split())\n city_a -= 1\n city_b -= 1\n \n for i in range(city_cant):\n for j in range(i+1, city_cant):\n aux = min(distances[i][city_a] + length + distances[city_b][j], distances[i][city_b] + length + distances[city_a][j])\n if distances[i][j] > aux:\n suma += aux - distances[i][j]\n distances[j][i] = aux\n distances[i][j] = aux\n\n fin += str(suma) + \" \"\n\nprint(fin)\n \t \t\t \t \t\t\t \t \t\t \t\t\t \t \t", "def main():\r\n \r\n n = int(input())\r\n\r\n distances = [[float('inf') for _ in range(n)] for __ in range(n)]\r\n\r\n tot = 0\r\n for i in range(n):\r\n row = list(map(int, input().split()))\r\n for j in range(n):\r\n distances[i][j] = row[j]\r\n distances[j][i] = row[j]\r\n tot += row[j]\r\n distances[i][i] = 0\r\n distances[j][j] = 0\r\n\r\n ans = []\r\n tot //= 2\r\n\r\n k = int(input())\r\n\r\n # O(k * )\r\n\r\n for _ in range(k):\r\n a,b,c = map(int, input().split())\r\n\r\n a-=1\r\n b-=1\r\n\r\n if distances[a][b] > c:\r\n tot -= distances[a][b]\r\n tot += c\r\n\r\n distances[a][b] = c\r\n distances[b][a] = c\r\n\r\n \r\n for i in range(n):\r\n for j in range(i):\r\n old = distances[i][j]\r\n new = min(distances[i][a] + distances[a][b] + distances[b][j], distances[i][b] + distances[b][a] + distances[a][j])\r\n\r\n if new < old:\r\n tot -= old\r\n tot += new\r\n\r\n distances[i][j] = new\r\n distances[j][i] = new\r\n \r\n \r\n ans.append(tot)\r\n\r\n print(*ans)\r\n\r\n\r\n\r\nmain()", "import os, sys\r\nfrom io import BytesIO, IOBase\r\n\r\nppyin = BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ncpyin = sys.stdin.readline\r\ninput = ppyin if 'PyPy' in sys.version else cpyin\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]\r\ninp_2ds = lambda dtype, n: [inp(dtype) for _ in range(n)]\r\ninp_enu = lambda dtype: [(i, x) for i, x in enumerate(inp(dtype))]\r\ninp_enus = lambda dtype, n: [[i] + inp(dtype) for i in range(n)]\r\nceil1 = lambda a, b: (a + b - 1) // b\r\n\r\n\r\ndef floyd():\r\n # run floyd\r\n for k in (u, v):\r\n for i in range(n):\r\n for j in range(n):\r\n if mem[i][j] > mem[i][k] + mem[k][j]:\r\n mem[i][j] = mem[i][k] + mem[k][j]\r\n\r\n ans = 0\r\n for i in range(n - 1):\r\n for j in range(i + 1, n):\r\n ans += mem[i][j]\r\n print(ans, end=' ')\r\n\r\n\r\nn = int(input())\r\nmem = inp_2ds(int, n)\r\n\r\nfor _ in range(int(input())):\r\n u, v, w = inp(int)\r\n u -= 1\r\n v -= 1\r\n mem[u][v] = mem[v][u] = min(mem[u][v], w)\r\n floyd()\r\n", "n = int(input())\r\nmatrix = []\r\nfor _ in range(n):\r\n li = list(map(int, input().split()))\r\n matrix.append(li)\r\n\r\nk = int(input())\r\nans = []\r\n\r\ndef floyd(matrix, inter):\r\n\r\n for i in range(len(matrix)):\r\n for j in range(len(matrix)):\r\n matrix[i][j] = min(matrix[i][j], matrix[i][inter] + matrix[inter][j])\r\n\r\n\r\n\r\nans = [] \r\n\r\nfor _ in range(k):\r\n a, b, length = list(map(int, input().split()))\r\n if length < matrix[a - 1][b - 1]:\r\n matrix[a - 1][b - 1] = length\r\n matrix[b - 1][a - 1] = length\r\n \r\n \r\n floyd(matrix, a - 1)\r\n floyd(matrix, b - 1)\r\n\r\n summ = 0\r\n for i in range(len(matrix)):\r\n for j in range(len(matrix[i])):\r\n summ += matrix[i][j]\r\n # print(matrix, \"**\")\r\n summ = summ // 2\r\n ans.append(summ)\r\n \r\nprint(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n", "N = int(input())\r\nM = []\r\nfor n in range(N):\r\n M.append(list(map(int,input().split())))\r\nK = int(input())\r\nret = []\r\nfor k in range(K):\r\n A, B, C = map(int,input().split())\r\n ans = 0\r\n A -= 1\r\n B -= 1\r\n M[A][B] = M[B][A] = min(C,M[A][B])\r\n for i in range(N):\r\n for j in range(N):\r\n a = M[i][j]\r\n b = M[i][A]+M[A][B]+M[B][j]\r\n c = M[i][B]+M[B][A]+M[A][j]\r\n M[i][j] = min(a,b,c)\r\n ans += sum(M[i])\r\n ret.append(ans//2)\r\nprint(*ret)\r\n\r\n\r\n", "from heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef main():\r\n\tn=ri()\r\n\td=[rl() for i in range(n)]\r\n\tk=ri()\r\n\tres=[]\r\n\tfor _ in range(k):\r\n\t\tu,v,c=rl()\r\n\t\tcurr=0\r\n\t\tu-=1;v-=1\r\n\t\td[u][v]=d[v][u]=min(d[u][v],c)\r\n\t\tfor i in range(n):\r\n\t\t\tfor j in range(n):\r\n\t\t\t\td[i][j]=min(d[i][j],d[i][u]+d[u][v]+d[v][j],d[i][v]+d[u][v]+d[u][j])\r\n\t\t\tcurr+=sum(d[i])\r\n\t\tres.append(curr//2)\r\n\tprint(*res)\r\n\tpass\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "n = int(input())\nmatrix = [[] for _ in range(n)]\nfor i in range(n):\n matrix[i] = list(map(int, input().split()))\ns = 0\nfor i in range(n):\n for j in range(i + 1, n):\n s += matrix[i][j]\n\nk = int(input())\n\nsums = []\n\nfor _ in range(k):\n a, b, c = map(int, input().split())\n a -= 1\n b -= 1\n\n for i in range(n):\n for j in range(i + 1, n):\n aux = min(matrix[i][a] + c + matrix[b][j],\n matrix[i][b] + c + matrix[a][j])\n if (matrix[i][j] > aux):\n s += aux - matrix[i][j]\n matrix[i][j] = matrix[j][i] = aux\n sums.append(s)\n\nprint(\" \".join(map(str, sums)))\n\n\t \t \t \t \t\t \t\t \t \t\t\t \t\t" ]

[ "s=input()\nmina=c=0\nfor i in range(len(s)):\n if ord(s[i])>=97:\n mina=min(c+1,mina)\n c+=1\n else:\n mina=min(mina+1,c)\nprint(mina)\n", "def min_count(q: str) -> int:\n w = len(q)\n lower = [0] * (w + 1)\n upper = [0] * (w + 1)\n for n in range(1, w + 1):\n lower[n] = lower[n - 1] + q[n - 1].islower()\n upper[n] = upper[n - 1] + q[n - 1].isupper()\n ans = float('inf')\n for n in range(w + 1):\n ans = min(ans, lower[n] + upper[w] - upper[n])\n return ans\n\n\na = input()\nprint(min_count(a))\n \t \t \t \t\t \t \t \t\t\t\t\t \t \t \t \t", "import string\r\na = input()\r\nif len(a) == 0:\r\n print(0)\r\ndp = [0] * 100000\r\ns = 1 if a[0] not in string.ascii_uppercase else 0\r\nfor i in range(1, len(a)):\r\n dp[i] = (dp[i - 1] if a[i] in string.ascii_lowercase else min(1 + dp[i - 1], s))\r\n s += 1 if a[i] not in string.ascii_uppercase else 0\r\nprint(dp[len(a) - 1])\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\ncnt = [0]\r\nfor i in s:\r\n cnt.append(cnt[-1] + i // 97)\r\nn = len(s)\r\nans = n\r\nfor i in range(n + 1):\r\n u, v = cnt[i], n - i - (cnt[n] - cnt[i])\r\n ans = min(ans, u + v)\r\nprint(ans)", "def solve():\n res = 0;maiusc = 0;numMin = 0;numMax = 0\n linha = input()\n for index in range(len(linha)-1,-1,-1):\n if(linha[index].islower()):\n numMin = numMin + 1\n if(linha[index].isupper()):\n numMax = numMax + 1\n maiusc = maiusc + 1\n elif(maiusc >0):\n maiusc = maiusc - 1\n res = res + 1\n solveAux = min(numMin,numMax)\n solve = min(res,solveAux)\n print(solve)\nsolve()\n\n\t \t\t\t\t \t\t \t\t\t \t\t \t \t\t\t", "import sys\r\ns=input()\r\nn=len(s)\r\nl=0\r\nu=0\r\nfor i in range(n):\r\n if(ord(s[i])>=97):\r\n l=min(l,u)\r\n u+=1\r\n else:\r\n l=min(u,l)+1\r\nprint(min(u,l))", "from sys import stdin,stdout\r\nPi = lambda x: stdout.write(str(x) + '\\n')\r\nPs = lambda x: stdout.write(str(x))\r\nS = lambda x: x*(x+1) // 2\r\nI = lambda x: 1+(2*x)\r\nR = lambda:stdin.readline()\r\nRi = lambda x:map(int,x.split())\r\nRs = lambda x:map(str,x.split())\r\nRf = lambda x:map(float,x.split())\r\n \r\ndef main():\t\r\n\t# t = int(R())\r\n\tfor x in stdin:\r\n\t\ts = x.strip('\\n')\r\n\t\tn = len(s)\r\n\t\tdp = [0]*(n+1)\r\n\t\tfor i in range(n-1,-1,-1):\r\n\t\t\tdp[i] = dp[i+1] + (s[i]<'a')\r\n\t\tans = dp[0]\r\n\t\tminus = 0\r\n\t\tfor i in range(n):\r\n\t\t\tminus += s[i]>'Z'\r\n\t\t\tans = min(ans,minus + dp[i+1])\r\n\t\t\t\r\n\t\tPi(ans)\r\n\r\n\r\nif __name__=='__main__':\r\n\tmain()\r\n\r\n# 60 == 360\r\n", "s=input()\r\na,r=0,0\r\nfor x in s:\r\n\tif x.islower():a+=1\r\n\telif x.isupper() and a>0:a-=1;r+=1\r\nprint(r)", "n = input()\r\ncases = []\r\n\r\ncount = 0\r\nx = 1\r\nfor letter in n:\r\n if x == 1 and letter != letter.upper():\r\n cases.append(count)\r\n count = 0\r\n x *= -1\r\n elif x == -1 and letter != letter.lower():\r\n cases.append(count)\r\n count = 0\r\n x *= -1\r\n count += 1\r\ncases.append(count)\r\n\r\nup_sum = 0\r\nlow_sum = 0\r\ni = 0\r\nlenght = len(cases)\r\nwhile i <= lenght - 1:\r\n up_sum += cases[i]\r\n i += 2\r\ni = 1\r\nwhile i <= lenght - 1:\r\n low_sum += cases[i]\r\n i += 2\r\n\r\nlows_left, lows_right = 0, low_sum\r\nups_right, ups_left = up_sum, 0\r\nbest = up_sum\r\nx = 1\r\nfor j in range(lenght):\r\n if x == 1:\r\n ups_left += cases[j]\r\n ups_right -= cases[j]\r\n x *= -1\r\n else:\r\n lows_left += cases[j]\r\n lows_right -= cases[j]\r\n x *= -1\r\n summ = ups_right + lows_left\r\n best = min(best, summ)\r\n\r\nprint(best)\r\n", "def solve(s):\r\n arr = []\r\n pi = []\r\n numone = 0\r\n for i in range(len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n arr.append(1)\r\n numone+=1\r\n else:\r\n arr.append(0)\r\n \r\n pi.append(numone)\r\n mi = len(arr)\r\n for i in range(len(arr)):\r\n if arr[i] == 1:\r\n pi.append(pi[-1]-1)\r\n else:\r\n pi.append(1+pi[-1])\r\n \r\n #if pi[-1]<mi:\r\n # mi = pi[-1]\r\n return min(pi)\r\n\r\n\r\n#t = int(input())\r\nt = 1\r\nfor i in range(t):\r\n s = input()\r\n #n = int(input())\r\n #arr = input().split(\" \")\r\n #c = int(arr1[2])\r\n #n = int(ns[0])\r\n #k = int(ns[1])\r\n #arr = input().split(\" \") \r\n #arr = [int(a) for a in arr]\r\n \r\n ans = solve(s)\r\n \r\n print(ans)", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport math\r\n \r\nimport sys\r\nimport os\r\nimport threading\r\nimport bisect\r\n \r\nimport operator\r\n \r\nimport heapq\r\n \r\n \r\nfrom atexit import register\r\nfrom io import BytesIO\r\n \r\n#sys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))\r\n#sys.stdout = BytesIO()\r\n#register(lambda: os.write(1, sys.stdout.getvalue()))\r\n \r\n \r\nimport io\r\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n#sys.stdin = open(\"F:\\PY\\\\test.txt\", \"r\")\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n#input = sys.stdin.readline\r\n \r\n\r\n\r\ndef fun1(i, k):\r\n if i<=k:\r\n return i\r\n else:\r\n return k-(i-k)\r\n\r\n#solved by dp\r\n \r\n \r\n \r\ns = ' '+input()\r\n\r\nlenS = len(s)\r\ndpU = [0]*(lenS+1)\r\ndpL = [0]*(lenS+1)\r\n\r\nanswer = 0\r\nfor i in range(1, lenS):\r\n dpU[i]=dpU[i-1]\r\n if s[i].islower():\r\n dpU[i]+=1\r\nanswer = dpU[lenS-1]\r\nfor i in range(lenS-1, 0, -1):\r\n dpL[i]=dpL[i+1]\r\n if s[i].isupper():\r\n dpL[i]+=1\r\n answer = min(answer, dpL[i]+dpU[i-1])\r\nprint(answer)\r\n \r\n\r\nsys.exit(0)\r\n\r\ndef gcs(a, b):\r\n n = len(a)\r\n m = len(b)\r\n f = [[0]*(n+1) for i in range(m+1)]\r\n for i in range(1, n):\r\n for j in range(1, m):\r\n if a[i]==b[j]:\r\n f[i][j]=f[i-1][j-1]+1\r\n else:\r\n f[i][j]=max(f[i-1][j], f[i][j-1])\r\n i, j, l = n-1, m-1, 0\r\n answer = []\r\n while(i!=0):\r\n if f[i][j]==f[i-1][j]+1 and f[i][j]==f[i][j-1]+1:\r\n print(i, j, l)\r\n answer.append(a[i])\r\n i-=1\r\n l = j-1\r\n j-=1\r\n if j==0: \r\n i-=1\r\n j=l \r\n \r\n for i in range(0,n):\r\n for j in range(0,m):\r\n print(f[i][j], end=\" \")\r\n print(\"\\n\", end=\"\")\r\n print(answer)\r\n return f[n-1][m-1]\r\n\r\nprint(gcs('1baccbca', '2abcabaac'))\r\n \r\n\r\nfor t in range(int(input())):\r\n n = int(input())\r\n ar1 = [' ']+list(map(str, input().split()))\r\n #ar1 = [' ']+ar1\r\n ar2 = [' ']+list(map(str, input().split()))\r\n dp = [[0]*(n+1) for i in range(n+1)]\r\n \r\n \r\n for i in range(1, n+1):\r\n for j in range(1, n+1):\r\n dp[i][j]=dp[i-1][j]\r\n if ar1[i]==ar2[j]:\r\n dp[i][j]=dp[i-1][j-1]+1\r\n else:\r\n dp[i][j]=max(dp[i][j-1], dp[i-1][j])\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n'''\r\nsys.exit(0)\r\nlV = [0]*10\r\nlV[1]=1\r\nfor i in range(2, 10):\r\n if i<10:\r\n lV[i]=lV[i-1]+i\r\n else:\r\n lV[i]=lV[i-1]+1+i%10\r\n\r\n\r\n#it's okey\r\ndef findOne(n, k):\r\n for i in range(1, 10):\r\n sumA=i\r\n sumA+=lV[min(i+k, 9)]-lV[i]\r\n sumA+=lV[max(i+k-9, 0)]\r\n print(sumA)\r\n if sumA==n:\r\n return i\r\n return 0\r\n\r\nfindOne(7,9)\r\n\r\nfor t in range(int(input())):\r\n n, k = map(int, input().split())\r\n oneS = findOne(n,k)\r\n if oneS!=0:\r\n print(oneS)\r\n continue\r\n n-=lV[k]\r\n if n<0:\r\n print(-1)\r\n continue\r\n print(lV)\r\n \r\n ''' ", "s = input()\r\nresult = 0\r\ntemp = 0\r\n\r\nfor x in s:\r\n if x.islower():\r\n temp += 1\r\n elif x.isupper() and temp > 0:\r\n temp -= 1\r\n result += 1\r\n\r\nprint(result)\r\n", "s = input()\nn = len(s)\n\nprefix = 0\nsuffix = 0\nans = float('inf')\n\nfor i in range(n):\n if 'a' <= s[i] <= 'z':\n prefix += 1\n\nfor i in range(n - 1, -1, -1):\n if 'A' <= s[i] <= 'Z':\n suffix += 1\n ans = min(ans, prefix + suffix)\n if 'a' <= s[i] <= 'z':\n prefix -= 1\n\nprint(ans - 1)\n\n \t \t \t \t \t\t \t\t\t \t \t \t\t", "\ninput = input()\ncont = 0\n\nfor i in range(len(input)):\n \n if input[i].isupper():\n cont += 1\n\nresult = cont\n \nfor i in range(len(input)):\n\n if input[i].isupper():\n cont -= 1\n else:\n cont += 1\n result = min(cont,result)\n\nprint(result)", "st = input().strip()\nmay = [0]\nfor ch in st:\n\tif ch.isupper():\n\t\tmay.append(may[-1])\n\telse:\n\t\tmay.append(1+may[-1])\nmen = [0]*len(may)\nfor i, c in reversed(list(enumerate(st))):\n\tif c.isupper():\n\t\tmen[i] = men[i+1]+1\n\telse:\n\t\tmen[i] = men[i+1]\nprint(min(x+y for x,y in zip(may, men)))\n", "a = str(input())\r\ny = x = 0 \r\nfor i in range(len(a)):\r\n if a[i] != a[i].upper(): x+=1\r\n else: y = min(y+1,x)\r\nprint(y)\r\n\r\n\r\n", "s = input()\r\nans = k = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n k += 1\r\n else:\r\n ans = min(k, ans + 1)\r\nprint(ans)\r\n", "mensagem = input()\r\nacao = 0\r\n\r\nfor i in range(len(mensagem)):\r\n if mensagem[i].isupper():\r\n acao = acao+ 1\r\n \r\np = acao\r\nfor i in range(len(mensagem)):\r\n if mensagem[i].isupper():\r\n aux = -1\r\n else:\r\n aux = 1\r\n p= p + aux\r\n acao = min(acao,p)\r\n \r\nprint(acao)", "s = input()\r\nn = len(s)\r\nl = [0]*n\r\n\r\nfor i in range(n):\r\n if s[i].islower():\r\n l[i]+=1\r\n if i:\r\n l[i]+=l[i-1]\r\nr = [0]*n\r\n\r\nfor i in range(n-1,-1,-1):\r\n if s[i].isupper():\r\n r[i]+=1\r\n if i!=n-1:\r\n r[i]+=r[i+1]\r\n\r\nm=n+1\r\n#print(l,r)\r\nfor i in range(n):\r\n m=min(m,l[i]+r[i]-1)\r\nprint(m)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nfrom math import inf\r\ns = list(map(str,input().split()))\r\ns = s[0]\r\nup = 0\r\ndown = 0\r\nans = 0\r\nlst1 = []\r\nlst2 = []\r\nfor i in range(len(s)):\r\n # if s[i].islower():\r\n # down = 1\r\n # if down == 1:\r\n if s[i].islower():\r\n down += 1\r\n lst1.append(down)\r\ndown = 0\r\nans = inf\r\nup = 0\r\nfor j in range(len(s)-1,-1,-1):\r\n if s[j].isupper():\r\n up += 1\r\n lst2.append(up)\r\nlst2 = lst2[::-1]\r\nfor y in range(len(s)):\r\n ans = min(ans,lst1[y]+lst2[y]-1)\r\nprint(ans)", "s=input()\r\nupper=0\r\nlower=0\r\narr=[]\r\nfor i in s:\r\n if (i.islower()):\r\n lower=lower+1\r\n elif (i.isupper()):\r\n upper=upper+1\r\n\r\nc=0\r\narr.append([0,upper])\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n c+=1\r\n arr.append([c,upper])\r\n \r\n else:\r\n arr.append([c,upper-1])\r\n upper-=1\r\nmn=10000000 \r\nfor i in range(len(arr)):\r\n mn=min(mn,arr[i][0]+arr[i][1])\r\nprint(mn) \r\n ", "def min_changes_to_upper_lower(s: str) -> int:\n n = len(s)\n upper_count = [0] * (n + 1)\n lower_count = [0] * (n + 1)\n\n # 计算从左到右需要将多少个字符更改为大写\n for i in range(n):\n upper_count[i + 1] = upper_count[i] + (1 if s[i].islower() else 0)\n\n # 计算从右到左需要将多少个字符更改为小写\n for i in range(n - 1, -1, -1):\n lower_count[i] = lower_count[i + 1] + (1 if s[i].isupper() else 0)\n\n # 计算最少需要修改多少个字符的状态\n min_changes = float('inf')\n for i in range(n + 1):\n min_changes = min(min_changes, upper_count[i] + lower_count[i])\n\n return min_changes\n\n\ns = input()\nresult = min_changes_to_upper_lower(s)\nprint(result)\n\n\t \t\t \t \t \t \t \t\t \t\t\t \t\t\t\t", "palavra = input()\r\n \r\ncontMinusculas = 0\r\ncontMudancas = 0\r\n \r\nfor letra in palavra:\r\n \r\n if letra.islower():\r\n contMinusculas += 1\r\n \r\n elif contMinusculas > 0:\r\n contMudancas += 1\r\n contMinusculas -= 1\r\n\r\nprint(contMudancas)", "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\ndp = [0] * len(s)\r\ncount = 0\r\nif ord('a') <= ord(s[0]) <= ord('z'):\r\n count = 1\r\nfor i in range(1, len(s)):\r\n if ord('A') <= ord(s[i]) <= ord('Z'):\r\n dp[i] = min(count, 1 + dp[i - 1])\r\n else:\r\n count += 1\r\n dp[i] = dp[i - 1]\r\nprint(dp[-1])\r\n", "from sys import stdin, stdout\r\nimport math,sys,heapq\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nfrom os import path\r\nimport random\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\nif (path.exists('input.txt')): \r\n #------------------Sublime--------------------------------------#\r\n sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\n def I():return (int(input()))\r\n def In():return(map(int,input().split()))\r\nelse:\r\n #------------------PYPY FAst I/o--------------------------------#\r\n def I():return (int(stdin.readline()))\r\n def In():return(map(int,stdin.readline().split()))\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 l=list(input())\r\n count,n=0,len(l)\r\n for x in l:\r\n if x.islower():\r\n count+=1\r\n up,low=n-count,count\r\n count=0\r\n #print(up,low)\r\n ans=1e8\r\n for x in range(n):\r\n if l[x].islower():\r\n temp=count+(up-x+count)\r\n #print(temp)\r\n ans=min(ans,temp)\r\n count+=1\r\n else:\r\n temp=count+(up-x+count-1)\r\n ans=min(ans,temp)\r\n print(ans)\r\n\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()", "if __name__ == '__main__':\r\n word = input()\r\n l_count, u_count = 0,0\r\n for w in word:\r\n if w.islower():\r\n l_count += 1\r\n elif l_count > 0:\r\n u_count += 1\r\n l_count -= 1\r\n print(u_count)\r\n", "s = input()\r\nbig = 0\r\nsmall = 0\r\nfor x in s:\r\n if 'A' <= x <= 'Z':\r\n big += 1\r\nans = big\r\nfor x in s:\r\n if 'A' <= x <= 'Z':\r\n big -= 1\r\n else:\r\n small += 1\r\n ans = min(ans, big+small)\r\nprint(ans)", "s=input()\r\nans=0\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n k+=1\r\n else:ans=min(k,ans+1)\r\nprint(ans)\r\n", "s = list(input())\r\nn = len(s)\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\ni=low=0\r\nans=min(u,l)\r\nwhile i<n and s[i].isupper():\r\n u-=1\r\n i+=1 \r\nfor j in range(i,n):\r\n if s[j].islower():\r\n ans=min(ans,low+u)\r\n low+=1\r\n else:\r\n u-=1 \r\nprint(ans) \r\n\r\n\r\n\r\n\r\n ", "s = input()\r\nlower = []\r\nupper = []\r\ncount = 0\r\nfor char in s:\r\n if char.islower():\r\n count += 1\r\n upper.append(count)\r\n\r\ncount = 0\r\nfor char in s[::-1]:\r\n if char.isupper():\r\n count += 1\r\n lower.append(count) \r\n\r\nlower = lower[::-1]\r\n\r\nn = len(s)\r\nans = min(lower[0], upper[-1])\r\nfor i in range(len(s) - 1):\r\n ans = min(ans, upper[i] + lower[i + 1])\r\n\r\nprint(ans)", "buoi = input()\r\na, b = 0, 0\r\nfor i in buoi:\r\n if i.islower():\r\n a += 1\r\n elif a > 0:\r\n b += 1\r\n a -= 1\r\nprint(b)\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nn = len(s)\r\n\r\nc = 0\r\nfor i in s:\r\n if i.isupper():\r\n c += 1\r\n\r\nd = c\r\ne = 0\r\nfor i in s:\r\n if i.isupper():\r\n d -= 1\r\n else:\r\n e += 1\r\n c = min(c, d+e)\r\nprint(c)\r\n", "s = input()\na,ans = 0,0\nfor i in range(len(s)):\n\tif ord(s[i])>=97:\n\t\tans = min(a+1,ans)\n\t\ta += 1\n\telse:\n\t\tans = min(a,ans+1)\nprint (ans)", "entrada = input()\naux = 0\nsaida = 0\n\nif(entrada.isupper()):\n print(saida)\nelse:\n for i in range(len(entrada)):\n if(entrada[i].islower()):\n aux += 1\n else:\n if aux > 0:\n aux -= 1\n saida += 1\n print(saida)", "# Wadea #\r\n\r\nn = list(input())\r\nlo = 0\r\nup = 0\r\nfor j in n:\r\n if j.islower():\r\n lo += 1\r\n elif lo > 0:\r\n lo -= 1\r\n up += 1\r\nprint(up)\r\n \r\n ", "s = input()\r\nn = len(s)\r\ndp = [[0,0] for i in range(n)]\r\n# делаем базу\r\nif s[0] <= \"Z\":\r\n dp[0][0] = 0\r\n dp[0][1] = 1\r\nelse:\r\n dp[0][0] = 1\r\n dp[0][1] = 0\r\nfor i in range(1,n):\r\n if s[i] <= \"Z\": # если это так, то это означает, что буква у нас заглавная\r\n dp[i][0] = dp[i - 1][0]\r\n dp[i][1] = dp[i - 1][1] + 1\r\n else:\r\n dp[i][0] = dp[i - 1][0] + 1\r\n dp[i][1] = min(dp[i - 1][1], dp[i - 1][0])\r\nprint(min(dp[n - 1][0], dp[n -1][1]))\r\n\r\n\r\n\r\n", "s = input()\na = 0\nfor i in range(len(s)):\n if s[i].isupper():\n a+=1\nb=a\n\nfor i in range(len(s)):\n if s[i].isupper():\n a-=1\n else:\n a+=1\n b = min(a,b)\nprint(b)\n", "x = str(input())\r\na,grande,pequeno = 0,[0],[0]\r\n\r\nfor i in range(len(x)):\r\n if(ord(x[i])>=97):\r\n if(i>0):\r\n pequeno.append(pequeno[i]+1)\r\n else:\r\n pequeno.append(1)\r\n grande.append(grande[i])\r\n else:\r\n if(i>0):\r\n grande.append(grande[i]+1)\r\n else:\r\n grande.append(1)\r\n pequeno.append(pequeno[i])\r\n \r\nfor i in range(len(x)+1):\r\n if(i==0):\r\n a=pequeno[i]+grande[len(x)]-grande[i]\r\n if(pequeno[i]+grande[len(x)]-grande[i]<a):\r\n a=pequeno[i]+grande[len(x)]-grande[i]\r\nprint(a)", "\nimport sys\nimport threading\ninput = sys.stdin.readline\nfrom collections import defaultdict\ninput = sys.stdin.readline\n\ndef main():\n \n l = 0 \n r = 0 \n s = input().strip()\n s+=('a')\n for c in s:\n if c.isupper():\n r+=1\n ans = float('inf')\n for c in s:\n ans = min(l+r, ans)\n if c.islower():\n l+=1\n else:\n r-=1\n print(ans)\n \n \n \n\n \n\n\n\n\n# Set the stack size\nthreading.stack_size(1 << 27)\n\n# Create and start the main thread\nmain_thread = threading.Thread(target=main)\nmain_thread.start()\n\n# Wait for the main thread to complete\nmain_thread.join()\n", "message=input()\r\na,result=0,0\r\nfor i in message:\r\n if i.islower():\r\n a+=1\r\n elif a>0:\r\n result+=1\r\n a-=1\r\nprint(result)", "import math\r\nimport sys\r\nimport queue\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n s = str(input())\r\n\r\n last_BIG = 0\r\n last_small = 0\r\n\r\n for i in s:\r\n if i == i.upper():\r\n last_BIG += 0\r\n last_small = min(last_BIG, last_small) + 1\r\n else:\r\n last_small = min(last_BIG, last_small)\r\n last_BIG += 1\r\n\r\n print(min(last_BIG, last_small))\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", "st = input()\nl, u = 0, 0\nfor i in st:\n if i.islower():\n l = l + 1\n else:\n if l > 0:\n u = u + 1\n l = l - 1\nprint(u)\n", "def answer(string):\r\n prefix, mini, zeros, ones = [0], float('inf'), [0], [0]\r\n for i in range(len(string)):\r\n if string[i].islower():\r\n zeros.append(zeros[-1] + 1)\r\n else:\r\n zeros.append(zeros[-1])\r\n\r\n for i in range(len(string)-1, -1, -1):\r\n if string[i].isupper():\r\n ones.append(ones[-1] + 1)\r\n else:\r\n ones.append(ones[-1])\r\n ones = ones[::-1]\r\n for i in range(len(string)):\r\n mini = min(mini, zeros[i]+ones[i+1])\r\n return mini\r\n\r\nstring = input()\r\nprint(answer(string))", "def changes(s: str) -> int:\n n = len(s)\n count = [0] * (n + 1)\n for i in range(1, n + 1):\n count[i] = count[i - 1] + s[i - 1].islower()\n ans = float('inf')\n for i in range(n + 1):\n ans = min(ans, count[i] + n - i - (count[n] - count[i]))\n return ans\n\ns = input()\nprint(changes(s))\n\n \t \t\t\t \t \t\t\t\t \t \t \t \t\t \t \t \t", "def min_changes(s: str) -> int:\n n = len(s)\n upper_count = [0] * (n + 1)\n lower_count = [0] * (n + 1)\n for i in range(1, n + 1):\n upper_count[i] = upper_count[i - 1] + (s[i - 1].islower())\n lower_count[i] = lower_count[i - 1] + (s[i - 1].isupper())\n ans = float('inf')\n for i in range(n + 1):\n ans = min(ans, upper_count[i] + lower_count[n] - lower_count[i])\n return ans\n\ns = input()\nprint(min_changes(s))\n\n \t\t \t \t \t \t \t \t", "from functools import lru_cache\r\nimport sys\r\nimport threading\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n\r\n @lru_cache(None)\r\n def dp(idx, upper):\r\n if idx == n:\r\n return 0\r\n\r\n if upper and s[idx].isupper():\r\n return dp(idx + 1, True)\r\n\r\n elif upper:\r\n return min(dp(idx + 1, True) + 1, dp(idx + 1, False))\r\n\r\n elif not upper and s[idx].isupper():\r\n return dp(idx + 1, False) + 1\r\n \r\n else:\r\n return dp(idx + 1, False)\r\n \r\n print(dp(0, True))\r\n\r\nif __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 sys import stdin\r\n\r\n\r\ndef final_fancy(s):\r\n lower = count = 0\r\n for v in s:\r\n if v.islower():\r\n lower += 1\r\n elif lower:\r\n lower -= 1\r\n count += 1\r\n print(count)\r\n\r\n\r\ndef solution():\r\n input = stdin.readline\r\n s = input().rstrip()\r\n final_fancy(s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "s = input()\r\ndp = [[0]*(len(s)+1) for _ in range(2)]\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n dp[0][i+1] = dp[0][i]\r\n dp[1][i+1] = 1+min(dp[0][i], dp[1][i])\r\n else:\r\n dp[0][i+1] = 1+dp[0][i]\r\n dp[1][i+1] = min(dp[0][i], dp[1][i])\r\nprint(min(dp[0][len(s)], dp[1][len(s)]))\r\n", "s = input()\r\np1 = [0]\r\np2 = [0]\r\nfor i in s:\r\n if i.isupper():\r\n p1.append(p1[-1] + 1)\r\n p2.append(p2[-1])\r\n else:\r\n p2.append(p2[-1] + 1)\r\n p1.append(p1[-1])\r\nans = 1e9\r\nfor i in range(0, len(s) + 1):\r\n ans = min(ans, p2[i] + p1[-1] - p1[i])\r\nprint(ans)\r\n", "s=input()\r\n\r\na=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n a+=1\r\n\r\nb=a\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n a-=1\r\n else:\r\n a+=1\r\n b=min(a,b)\r\n\r\nprint(b)", "def AbhiSolveKiya(a):\r\n n = len(a)\r\n pref = [0]\r\n suff = [0]*(n+1)\r\n for i in range(n):\r\n pref.append(pref[-1])\r\n if s[i].islower():\r\n pref[-1] += 1\r\n\r\n j = 0\r\n for i in range(n-1, -1, -1):\r\n suff[i] = suff[i+1]\r\n if s[i].isupper():\r\n suff[i] += 1\r\n\r\n suff = [0]+suff\r\n ans = 100000000000\r\n for i in range(1, n+2):\r\n ans = min(ans, pref[i-1]+suff[i])\r\n return ans\r\n\r\n\r\ns = input()\r\nprint(AbhiSolveKiya(s))\r\n", "a = input()\r\nn = len(a)\r\n\r\nb = [0 for i in range(n)]\r\nc = [0 for i in range(n)]\r\n\r\nif ord(a[0]) >= ord('a') and ord(a[0]) <= ord('z'):\r\n b[0] = 1\r\n c[0] = 0\r\n\r\nelse:\r\n b[0] = 0\r\n c[0] = 1\r\n\r\nfor i in range(1, n):\r\n if ord(a[i]) >= ord('a') and ord(a[i]) <= ord('z'):\r\n b[i] = b[i-1] + 1\r\n c[i] = min(b[i-1], c[i-1])\r\n \r\n else:\r\n b[i] = b[i-1]\r\n c[i] = min(b[i-1] + 1, c[i-1] + 1)\r\n \r\nprint(min(b[n-1], c[n-1]))\r\n", "s=\"*\"+input()\r\nn=len(s)\r\nprefu=[0]*(n+1)\r\nprefl=[0]*(n+1)\r\nfor i in range(1,n):\r\n #print(i)helloworld\r\n\r\n if s[i].isupper():\r\n prefu[i]+=prefu[i-1]+1\r\n else:prefu[i]=prefu[i-1]\r\nfor i in range(n-1,-1,-1):\r\n #print(i)\r\n if s[i].islower():\r\n prefl[i]+=prefl[i+1]+1\r\n else:\r\n prefl[i]=prefl[i+1]\r\n\r\n#print(prefu)\r\n#print(prefl)\r\nans=0\r\nfor i in range(n):\r\n ans=max(prefu[i]+prefl[i+1],ans)\r\nprint(n-ans-1)\r\n", "s = input()\r\nm = 0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n m += 1\r\n \r\np = m\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n cost = -1\r\n else:\r\n cost = 1\r\n p += cost\r\n m = min(m, p)\r\n \r\n \r\nprint(m)", "s=input()\r\nl,u=0,0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n l=min(u,l)\r\n u+=1\r\n else:l=min(u,l)+1\r\nprint(min(u,l))\r\n", "def min_changes(s: str) -> int:\n n = len(s)\n upcou = [0] * (n + 1)\n lowcou = [0] * (n + 1)\n for i in range(1, n + 1):\n upcou[i] = upcou[i - 1] + (s[i - 1].islower())\n lowcou[i] = lowcou[i - 1] + (s[i - 1].isupper())\n ans = float('inf')\n for i in range(n + 1):\n ans = min(ans, upcou[i] + lowcou[n] - lowcou[i])\n return ans\n\ns = input()\nprint(min_changes(s))\n\n \t\t\t\t\t \t \t \t\t \t\t\t\t \t \t", "s=input()\r\nn=len(s)\r\nc1=[0]*n\r\nc2=[0]*n\r\nfor i in range(n):\r\n if s[i]==s[i].upper():\r\n c1[i]+=1\r\n else:\r\n c2[i]+=1\r\nfor i in range(n-1):\r\n c1[i+1]+=c1[i]\r\n c2[i+1]+=c2[i]\r\nans=c1[-1]\r\nfor i in range(n):\r\n ans=min(ans,c1[-1]-c1[i]+c2[i])\r\nprint(ans)", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(number_of_variables):\r\n if number_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if number_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\nmod=10**9+7\r\n# sys.stdin=open('input.txt','r')\r\n# sys.stdout=open('output.txt','w')\r\ns=input()\r\nsmall=0\r\nans=0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n small+=1\r\n elif small>0:\r\n small-=1\r\n ans+=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 \r\n\r\n\r\n \r\n\r\n\r\n\r\n", "a=input().strip()\r\nf=0\r\nc=0\r\nfor i in range(len(a)):\r\n if(a[i].islower()):\r\n f+=1\r\n else:\r\n if(f):\r\n f-=1\r\n c+=1\r\nprint(c)", "a=input()\r\nc=1\r\nc1=0\r\nc2=0\r\np=[]\r\nbl=[]\r\nm=1\r\ndef g(k):\r\n if k==k.lower():\r\n return 'l'\r\n return 'u'\r\nif g(a[0])=='u':\r\n m=0\r\nfor i in range(1,len(a)):\r\n if g(a[i])!=g(a[i-1]):\r\n p.append(c)\r\n m=abs(m-1)\r\n bl.append(m)\r\n c=0\r\n c+=1\r\np.append(c)\r\nbl.append(abs(m-1))\r\nl_s=[0]\r\nr_b=[0]\r\nfor i in range(len(p)):\r\n if bl[i]==0:\r\n l_s.append(p[i]+l_s[-1])\r\n else:\r\n l_s.append(l_s[-1])\r\nfor i in range(len(p)-1,-1,-1):\r\n if bl[i]==1:\r\n r_b.append(p[i]+r_b[-1])\r\n else:\r\n r_b.append(r_b[-1])\r\nr_b=r_b[::-1]\r\nminn=len(a)\r\nfor i in range(len(l_s)):\r\n if minn>r_b[i]+l_s[i]:\r\n minn=r_b[i]+l_s[i]\r\nprint(minn)\r\n \r\n", "inp = input()\r\n\r\nresp = 0\r\nb = 0\r\n\r\nfor i in range(len(inp)):\r\n if inp[i] != inp[i].upper(): \r\n b += 1\r\n else: \r\n resp = min(resp+1,b)\r\n\r\nprint(resp)", "s = input()\r\nn = len(s)\r\n\r\nleft = [0] * n\r\nright = [0] * n\r\n\r\nfor i in range(1,n):\r\n ord_char = ord(s[i-1])\r\n left[i] = left[i-1]\r\n if(ord_char >= 97 and ord_char <= 122):\r\n left[i] += 1\r\n\r\nfor i in range(n-2,-1,-1):\r\n ord_char = ord(s[i+1])\r\n right[i] = right[i+1]\r\n if(ord_char >= 65 and ord_char <= 90):\r\n right[i] += 1 \r\n\r\nres = n\r\nfor i in range(n):\r\n res = min(res,left[i]+right[i])\r\n\r\nprint(res)", "a = [0] * 100005\nb = [0] * 100005\n\ndef main():\n s = input()\n n = len(s)\n a[0] = 0\n b[n+1] = 0\n \n for i in range(1, n+1):\n if s[i-1] >= 'a' and s[i-1] <= 'z':\n a[i] = a[i-1] + 1\n else:\n a[i] = a[i-1]\n \n for i in range(n, 0, -1):\n if s[i-1] >= 'A' and s[i-1] <= 'Z':\n b[i] = b[i+1] + 1\n else:\n b[i] = b[i+1]\n \n minx = n\n for i in range(n+1):\n minx = min(a[i] + b[i+1], minx)\n \n print(minx)\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", "s=input()\r\nmina=c=0\r\nfor i in range(len(s)):\r\n if ord(s[i])>=97:\r\n mina=min(c+1,mina)\r\n c+=1\r\n else:\r\n mina=min(mina+1,c)\r\nprint(mina)", "s = input()\r\nl=0\r\nu=0\r\nfor i in range(len(s)):\r\n if(ord(s[i])>=97):\r\n l=min(l,u)\r\n u+=1\r\n else:\r\n l=min(u,l)+1\r\nprint(min(u,l))", "def resolve(strn):\r\n ma = 0\r\n min = 0\r\n i = len(strn) - 1\r\n while(i >= 0):\r\n if(strn[i].isupper()):\r\n ma += 1\r\n else:\r\n if(ma > 0):\r\n min += 1\r\n ma -= 1\r\n i -= 1\r\n return min\r\ns = input()\r\nprint(resolve(s))", "from collections import deque\r\nfrom math import gcd,sqrt,log\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\ndef ii():return int(input())\r\ns=input()\r\nn=len(s)\r\nupco=[0]*n\r\nc1=0\r\nif(s[n-1].isupper()):\r\n c1+=1\r\nfor i in range(n-2,-1,-1):\r\n upco[i]=c1\r\n if(s[i].isupper()):\r\n c1+=1\r\nlowco=[0]*n\r\nc1=0\r\nif(s[0].islower()):\r\n c1+=1\r\nfor i in range(1,n):\r\n lowco[i]=c1\r\n if(s[i].islower()):\r\n c1+=1\r\nx=1e5\r\nfor i in range(n):\r\n x=min(x,upco[i]+lowco[i])\r\nprint(x)", "def min_actions(message):\r\n n = len(message)\r\n Dplow = [0] * n\r\n Dpsup = [0] * n\r\n\r\n if message[0].islower():\r\n Dplow[0] = 0\r\n Dpsup[0] = 1\r\n else:\r\n Dplow[0] = 1\r\n Dpsup[0] = 0\r\n\r\n for i in range(1, n):\r\n if message[i].islower():\r\n Dplow[i] = min(Dplow[i - 1], Dpsup[i - 1])\r\n Dpsup[i] = Dpsup[i - 1] + 1\r\n else:\r\n Dplow[i] = min(Dplow[i - 1], Dpsup[i - 1]) + 1\r\n Dpsup[i] = Dpsup[i - 1]\r\n\r\n return min(Dplow[-1], Dpsup[-1])\r\n\r\n\r\nmessage = input()\r\nprint(min_actions(message)) \r\n", "l = input()\nlength = len(l)\nu = 0\nd = 0\nfor i in range(length):\n if l[i].islower():\n d= min(d,u+1)\n u+=1\n else:\n d = min(u,d+1)\nprint(d)", "s = input()\r\nn = len(s)\r\nsml = list(map(lambda i: int('a' <= i <= 'z'), s))\r\ncap = list(map(lambda i: int('A' <= i <= 'Z'), s))\r\nprefsml = [0] * (n+1)\r\nfor i in range(n):\r\n prefsml[i+1] = prefsml[i] + sml[i]\r\nsuffcap = [0] * (n+1)\r\nfor i in range(n-1, -1, -1):\r\n suffcap[i] = suffcap[i+1] + cap[i]\r\nres = 2e9\r\nfor i in range(n):\r\n res = min(res, prefsml[i+1] + suffcap[i])\r\nprint(res - 1)\r\n", "str = input()\nn = len(str)\nf = [[0, 0] for i in range(n)]\n\nfor i in range(n):\n if str[i].islower():\n f[i][0] = min(f[i - 1][0], f[i - 1][1])\n f[i][1] = f[i - 1][1] + 1\n else:\n f[i][0] = min(f[i - 1][0], f[i - 1][1]) + 1\n f[i][1] = f[i - 1][1]\n\nprint(min(f[n - 1][0], f[n - 1][1]))\n\n\t\t \t \t \t\t\t \t \t\t\t\t \t \t\t\t\t \t \t", "def minActions(s):\r\n action = float('inf')\r\n counts = [(0, 0)]\r\n for i, char in enumerate(s):\r\n upCount = lrCount = 0 \r\n if 65 <= ord(char) <= 90:\r\n upCount += 1\r\n else:\r\n lrCount += 1\r\n counts.append((upCount+counts[-1][0], counts[-1][1]+lrCount))\r\n \r\n totalUp, totalLr = counts[-1]\r\n \r\n for i in range(1, len(counts)):\r\n upCount = totalUp - counts[i][0]\r\n lrCount = counts[i-1][1]\r\n action = min(action, lrCount + (upCount))\r\n \r\n return action \r\n \r\ns = input()\r\nprint(minActions(s))", "# map(int, input().split(\" \"))\r\n\r\ns = input()\r\nn = len(s)\r\nc = c1 = 0\r\nfor i in s:\r\n if i.islower():\r\n c+=1\r\n elif i.isupper() and c:\r\n c1+=1\r\n c-=1\r\n\r\nprint(c1)\r\n", "\r\ndef solve(str):\r\n d = [0,0]\r\n for i in range(len(str)):\r\n if str[i].islower():\r\n d[1] = min(d[1], d[0]+1)\r\n d[0] +=1\r\n else:\r\n d[1] = min(d[0], d[1]+1)\r\n return d[1]\r\nletter = input()\r\nprint(solve(letter))", "from typing import List\r\n\r\n\r\ndef caclulator(letter: str):\r\n lower_from_base: List[int] = [0] * (len(letter)+1)\r\n upper_from_end: List[int] = [0] * (len(letter)+1)\r\n\r\n for i in range(0, len(letter)):\r\n lower_from_base[i+1] = lower_from_base[i]\r\n if letter[i].islower():\r\n lower_from_base[i+1] += 1\r\n\r\n letter = letter[::-1]\r\n for i in range(0, len(letter)):\r\n upper_from_end[i+1] = upper_from_end[i]\r\n if letter[i].isupper():\r\n upper_from_end[i+1] += 1\r\n\r\n return lower_from_base, upper_from_end\r\n\r\ndef solution(letter: str):\r\n lower_from_base , upper_from_end = caclulator(letter)\r\n ret = len(letter)\r\n for i in range(0, len(letter)+1):\r\n ret = min(ret, lower_from_base[i] + upper_from_end[len(letter)-i])\r\n return ret\r\n\r\nif __name__ == '__main__':\r\n patric_letter = input()\r\n print(solution(patric_letter))", "a = input()\r\nn = len(a)\r\ndp = [[0]*2 for _ in range(n)]\r\nif n == 0:\r\n print(0)\r\nelse:\r\n if ord(a[0]) < 91:\r\n dp[0] = [1, 0]\r\n else:\r\n dp[0] = [0, 1]\r\nfor i in range(1, n):\r\n if ord(a[i]) > 91:\r\n dp[i][0] = min(dp[i-1])\r\n dp[i][1] = dp[i-1][1] + 1\r\n else:\r\n dp[i][0] = min(dp[i - 1]) + 1\r\n dp[i][1] = dp[i - 1][1]\r\nprint(min(dp[-1]))", "while True:\n try:\n s = input().strip()\n n = len(s)\n dp = [[0, 0] for _ in range(n)]\n for i in range(n):\n if s[i].islower():\n dp[i][0] = min(dp[i-1][0], dp[i-1][1])\n dp[i][1] = dp[i-1][1] + 1\n else:\n dp[i][0] = min(dp[i-1][0], dp[i-1][1]) + 1\n dp[i][1] = dp[i-1][1]\n print(min(dp[n-1][0], dp[n-1][1]))\n except:\n break\n \t\t \t \t \t\t \t\t\t \t \t\t \t", "s = input() #1e5\r\nn = len(s)\r\nll = [0]*(n+1) #lower@left\r\nur = [0]*(n+1) #upper@right\r\nfor i in range(n):\r\n ll[i+1] = ll[i]+1 if s[i].islower() else ll[i]\r\nfor i in range(n-1,-1,-1):\r\n ur[i] = ur[i+1]+1 if s[i].isupper() else ur[i+1]\r\nprint(min([ll[i]+ur[i] for i in range(n+1)]))\r\n\r\n", "s = input()\r\ndp_small = [0 for i in range(len(s)+1)]\r\ndp_cap = [0 for i in range(len(s)+1)]\r\n\r\nfor i in range(len(s)):\r\n\r\n\tif ord(s[i]) >= 65 and ord(s[i]) <= 90:\r\n\t\tdp_small[i+1] = dp_small[i] + 1\r\n\telse:\r\n\t\tdp_small[i+1] = dp_small[i]\r\n\r\nfor i in range(len(s)):\r\n\r\n\tif ord(s[i]) >= 97 and ord(s[i]) <= 122:\r\n\t\tdp_cap[i+1] = dp_cap[i] + 1\r\n\telse:\r\n\t\tdp_cap[i+1] = dp_cap[i]\r\n\r\nans = float(\"inf\")\r\nfor i in range(len(s)+1):\r\n\r\n\tans = min(ans,dp_cap[i] + dp_small[len(s)]-dp_small[i])\r\nprint(ans)", "s = list(map(ord, list(input())))\r\nn = len(s)\r\nn1 = 0\r\nn2 = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if s[i] >= ord('A') and s[i] <= ord('Z'):\r\n n1 += 1\r\nans = n1\r\n# print(n1)\r\nfor i in range(n):\r\n if s[i] >= ord('A') and s[i] <= ord('Z'):\r\n n1 -= 1\r\n else:\r\n n2 += 1\r\n\r\n ans = min(n2 + n1, ans)\r\nans = min(n2, ans)\r\nprint(ans)", "s = input()\nls = [0] * (len(s) + 1)\nls[0] = sum(x.isupper() for x in s)\nfor j in range(1, len(s) + 1):\n ls[j] = ls[j - 1] + (1 if s[j - 1].islower() else -1)\nprint(min(ls))", "def min_count(s: str) -> int:\n n = len(s)\n lowercase = [0] * (n + 1)\n uppercase = [0] * (n + 1)\n for i in range(1, n + 1):\n lowercase[i] = lowercase[i - 1] + s[i - 1].islower()\n uppercase[i] = uppercase[i - 1] + s[i - 1].isupper()\n ans = float('inf')\n for i in range(n + 1):\n ans = min(ans, lowercase[i] + uppercase[n] - uppercase[i])\n return ans\n\n\nt = input()\nprint(min_count(t))\n \t\t\t\t\t \t \t\t \t \t \t\t", "#! /usr/bin/env python3\n\ndef main():\n letters = input()\n\n lower_count = 0\n for letter in letters:\n if letter.islower():\n lower_count += 1\n lower_so_far = 0\n length = len(letters)\n min_actions = length // 2\n for i, letter in enumerate(letters):\n actions = lower_so_far\n if letter.islower():\n lower_so_far += 1\n actions += length - i - 1 - (lower_count - lower_so_far)\n min_actions = min(actions, min_actions)\n\n print(min_actions)\n\nmain()\n", "def is_big(s):\r\n return s.upper() == s\r\n\r\ns = input().rstrip()\r\na = [0] * (len(s) + 1)\r\nfor i in range(len(s)):\r\n if not is_big(s[i]):\r\n a[i + 1] = a[i] + 1\r\n else:\r\n a[i + 1] = a[i]\r\n\r\nb = [0] * (len(s) + 1)\r\nfor i in range(len(s) - 1, -1, -1):\r\n if is_big(s[i]):\r\n b[i] = b[i + 1] + 1\r\n else:\r\n b[i] = b[i + 1]\r\n\r\nres = float(\"inf\")\r\nfor i in range(len(s) + 1):\r\n res = min(res, a[i] + b[i])\r\nprint(res)", "class Solution(object):\r\n def __init__(self):\r\n pass\r\n\r\n\r\n def get_input(self):\r\n self.msg = input()\r\n\r\n\r\n def comp_output(self):\r\n n = len(self.msg)\r\n dp = [[0, 0] for _ in range(n+1)]\r\n\r\n for i in range(1, n+1):\r\n dp[i][1] = dp[i-1][1] + int(self.msg[i-1].islower())\r\n dp[i][0] = min(dp[i-1][1], dp[i-1][0]) + int(self.msg[i-1].isupper())\r\n\r\n res = min(dp[n][0], dp[n][1])\r\n print(res)\r\n\r\n\r\nobj = Solution()\r\nobj.get_input()\r\nobj.comp_output()", "s=input()\r\ndp=[]\r\nfor i in range(len(s)):\r\n dp.append([0,0])\r\nif s[0].isupper():\r\n dp[0][1]=1\r\nelse:\r\n dp[0][0]=1\r\n\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n dp[i][0]=dp[i-1][0]\r\n dp[i][1]=min(dp[i-1][0],dp[i-1][1])+1\r\n else:\r\n dp[i][0]=dp[i-1][0]+1\r\n dp[i][1]=min(dp[i-1][0],dp[i-1][1])\r\nprint(min(dp[len(s)-1][0],dp[len(s)-1][1]))", "def main():\r\n lista=input()\r\n czyD=True\r\n wyn1=[0]*(len(lista))\r\n tmp=0\r\n wyn2=[0]*(len(lista))\r\n for i in range(len(lista)):\r\n if (ord(lista[i])>=97):\r\n wyn1[i]=wyn1[max(0,i-1)]+1\r\n else:\r\n wyn1[i]=wyn1[max(0,i-1)]\r\n for i in range(len(lista)-1,-1,-1):\r\n #print(i)\r\n if (ord(lista[i])<97):\r\n wyn2[i]=wyn2[min(len(lista)-1,i+1)]+1\r\n else:\r\n wyn2[i]=wyn2[min(len(lista)-1,i+1)]\r\n #print(wyn1,wyn2)\r\n wyn=10**6\r\n for i in range(len(lista)-1):\r\n wyn=min(wyn,wyn1[i]+wyn2[i+1])\r\n print(min(wyn,wyn2[0],wyn1[-1]))\r\nmain()", "s = input()\r\nl = 0\r\nh = 0\r\nfor i in range(len(s)):\r\n if s[i].islower():\r\n l+=1\r\n elif l>0:\r\n h+=1\r\n l-=1\r\nprint(h) ", "def min_count(s: str) -> int:\n n = len(s)\n lowercase = [0] * (n + 1)\n uppercase = [0] * (n + 1)\n for i in range(1, n + 1):\n lowercase[i] = lowercase[i - 1] + s[i - 1].islower()\n uppercase[i] = uppercase[i - 1] + s[i - 1].isupper()\n x = float('inf')\n j=0\n while j <(n + 1):\n x = min(x, lowercase[j] + uppercase[n] - uppercase[j])\n j=j+1\n return x\nt = input()\nprint(min_count(t))\n \t\t \t \t \t \t\t\t\t\t \t\t \t\t\t \t\t \t", "input_string = input()\nstring_size = len(input_string)\n\nupper_cases = 0\nlower_cases = 0\nmin_num_actions = 10**10\n\nfor i in range(string_size):\n if ord(input_string[i]) < 97:\n upper_cases += 1\n\nif upper_cases == 0:\n print(\"0\")\n exit()\n\nmin_num_actions = min(min_num_actions, upper_cases)\n\nfor i in range(string_size):\n if ord(input_string[i]) >= 97:\n lower_cases += 1\n else :\n upper_cases -= 1\n min_num_actions = min(min_num_actions, upper_cases + lower_cases)\n\nprint(min_num_actions)\n ", "s = input()\nlowers, uppers = 0, 0\nfor item in s:\n if item.islower():\n lowers += 1\n else:\n uppers += 1\nans = min(lowers, uppers)\ncur = 0\nfor i in range(len(s) - 1):\n if s[i].islower():\n cur += 1\n else:\n uppers -= 1\n ans = min(ans, sum([cur, uppers]))\nprint(ans)\n", "s=input()\nm,n=0,0\nfor i in s:\n if i.islower():\n m+=1\n elif i.isupper() and m>0:\n m-=1\n n+=1\nprint(n)\n\n\n\t \t \t \t \t\t \t\t \t \t\t \t \t\t \t", "import sys\n\ns = sys.stdin.readline().split()[0]\nn = len(s)\n\nlowercase = [0] * (n + 1)\nuppercase = [0] * (n + 1)\n\nmin_fancy = n - 1\n\nfor i in range(n):\n if i == 0:\n if s[i].lower() == s[i]:\n lowercase[i + 1] = 1\n\n if s[-i - 1].upper() == s[-i - 1]:\n uppercase[-i - 2] = 1\n else:\n lowercase[i + 1] = lowercase[i]\n uppercase[-i - 2] = uppercase[-i - 1]\n if s[i].lower() == s[i]:\n lowercase[i + 1] += 1\n if s[-i - 1].upper() == s[-i - 1]:\n uppercase[-i - 2] += 1\n\nfor i in range(n + 1):\n if lowercase[i] + uppercase[i] < min_fancy:\n min_fancy = lowercase[i] + uppercase[i]\n\nprint(min_fancy)\n", "\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\ns=input()\r\nn=len(s)\r\n\r\nqz=[0]*n\r\nhz=[0]*n\r\nfor i in range(1,n):\r\n qz[i]=qz[i-1]+1 if \"a\"<=s[i-1]<=\"z\" else qz[i-1]\r\nfor i in range(n-2,-1,-1):\r\n hz[i]=hz[i+1]+1 if \"A\"<=s[i+1]<=\"Z\" else hz[i+1]\r\nres=inf\r\nfor i in range(n):\r\n res=min(res,qz[i]+hz[i])\r\n\r\nprint(res)", "capalpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ns = input()\r\ns = [elem for elem in s]\r\nup, lo = 0, 0\r\nfor i in range(len(s)) :\r\n if s[i] in capalpha :\r\n up += 1\r\nans = up + lo\r\nfor i in range(len(s)) :\r\n if s[i] in capalpha :\r\n up -= 1\r\n else :\r\n lo += 1\r\n ans = min(ans,up + lo)\r\nprint(ans)", "\nimport sys\nfrom collections import Counter\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_chars(): return list(sys.stdin.readline().strip())\nsys.setrecursionlimit(20000)\n\ns = get_chars()\n\nn = len(s)\na = [] # transter uppercase to 1, lowercase to 2\nc1 = 0 # counts of 1\nc2 = 0 # counts of 2\n\nfor i in range(n):\n if s[i].isupper():\n a.append(1)\n c1+= 1\n else:\n a.append(2)\n c2+= 1\n\neach_change = [] # (changes to 1, changes to 2)\ntotal_change = []\n\n\n\nif a[0] == 1:\n each_change.append((0, c1 - 1))\nelse:\n each_change.append((1, c1))\ntotal_change.append(each_change[0][0] + each_change[0][1])\n\nfor i in range(1, n):\n if a[i] == 1:\n each_change.append((each_change[i-1][0], each_change[i-1][1] - 1))\n else:\n each_change.append((each_change[i-1][0] + 1, each_change[i-1][1]))\n total_change.append(each_change[i][0] + each_change[i][1])\n\ntotal_change = [c1] + total_change\n\nprint(min(total_change))\n\n\n\n\n", "s=input()\r\nk,ans=0,0\r\nfor i in range(len(s)):\r\n if s[i]<='z' and s[i]>='a':\r\n k+=1\r\n else:ans=min(ans+1,k)\r\nprint(ans)\r\n", "\r\nstr = input()\r\nst = 0\r\ncond = []\r\n\r\nminimum = 0\r\nfor idx, letter in enumerate(str):\r\n if letter.islower():\r\n minimum += 1\r\n\r\nmedium = minimum\r\nfor idx, letter in enumerate(reversed(str)):\r\n if letter.islower():\r\n medium -= 1\r\n else:\r\n medium += 1\r\n minimum = min(minimum, medium)\r\nprint(minimum)\r\n", "a_ord = ord('a')\ns = input().strip()\n\nright_upper, right_lower = 0, 0\nfor ch in s:\n if ord(ch) >= a_ord:\n right_lower += 1\n else:\n right_upper += 1\nbest = right_upper\n\nleft_upper, left_lower = 0, 0\nfor ch in s:\n if ord(ch) >= a_ord:\n left_lower += 1\n right_lower -= 1\n else:\n left_upper += 1\n right_upper -= 1\n best = min(best, left_lower + right_upper)\n\nprint(best)\n", "l = input()\r\nlength = len(l)\r\nu = 0\r\nd = 0\r\nfor i in range(length):\r\n if l[i].islower():\r\n d= min(d,u+1)\r\n u+=1\r\n else:\r\n d = min(u,d+1)\r\nprint(d)\r\n\r\n\r\n", "def min_modifications(s: str) -> int:\n length = len(s)\n to_upper = [0] * (length + 1)\n to_lower = [0] * (length + 1)\n\n for idx in range(length):\n to_upper[idx + 1] = to_upper[idx] + (1 if s[idx].islower() else 0)\n\n for idx in range(length - 1, -1, -1):\n to_lower[idx] = to_lower[idx + 1] + (1 if s[idx].isupper() else 0)\n\n min_modifications = float('inf')\n for idx in range(length + 1):\n min_modifications = min(min_modifications, to_upper[idx] + to_lower[idx])\n\n return min_modifications\n\n\ninput_str = input()\nresult = min_modifications(input_str)\nprint(result)\n\n \t \t\t\t\t\t\t \t\t\t \t\t\t\t\t \t \t", "s = input()\r\n\r\ndef solve(s):\r\n n = len(s)\r\n upper = lower = 0\r\n x = 0\r\n res = 0\r\n for i in range(n-1, -1, -1):\r\n if s[i].islower():\r\n lower += 1\r\n if s[i].isupper():\r\n upper += 1\r\n x += 1\r\n elif x > 0:\r\n x -= 1\r\n res += 1\r\n return min(res, lower, upper)\r\n\r\nprint(solve(s))", "ALP=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nalp=\"abcdefghijklmnopqrstuvwxyz\"\r\ns=input()\r\nn=len(s)\r\nsmall=[0]*(n+1)\r\ncapital=[0]*(n+1)\r\nfor i in range(len(s)):\r\n\tif s[i] in alp:\r\n\t\tsmall[i+1]=small[i]+1\r\n\telse:\r\n\t\tsmall[i+1] = small[i]\r\nfor i in range(n-1,-1,-1):\r\n\tif s[i] in ALP:\r\n\t\tcapital[i] =capital[i+1]+1\r\n\telse:\r\n\t\tcapital[i] = capital[i+1]\r\n#print(small) \r\n#print(capital) \r\nans=float(\"inf\")\r\nfor i in range(n):\r\n\tans=min(ans, small[i] +capital [i+1])\r\nprint(ans)", "import re\r\nletter = input()\r\nuppercaseGroup = r'[A-Z]+'\r\nlowercaseGroup = r'[a-z]+'\r\nfirstUpperCase = False\r\nlastUpperCase = False\r\n\r\nif re.search(uppercaseGroup, letter[0]):\r\n firstUpperCase = True\r\nif re.search(uppercaseGroup, letter[len(letter)-1]):\r\n lastUpperCase = True\r\n\r\nlower = re.split(uppercaseGroup, letter)\r\nupper = re.split(lowercaseGroup, letter)\r\n\r\nif firstUpperCase:\r\n upper[0] = ''\r\n\r\nlower = list(filter(lambda group: group != '', lower))\r\nupper = list(filter(lambda group: group != '', upper))\r\nlower = list(map(lambda group: len(group), lower))\r\nupper = list(map(lambda group: len(group), upper))\r\n\r\n\r\n\r\nacc = 0\r\nfor group in range(len(upper)-1, -1, -1):\r\n acc += upper[group]\r\n upper[group] = acc\r\nacc = 0\r\nfor group in range(len(lower)):\r\n acc += lower[group]\r\n lower[group] = acc\r\n\r\n\r\n\r\nminOperations = float(\"inf\")\r\n\r\nfor group in range(len(upper)):\r\n leftSum = upper[group] + (lower[group-1] if (group != 0) else 0)\r\n rightSum = lower[group] + (upper[group+1] if (group+1 != len(upper)) else 0)\r\n minOperations = min(leftSum, rightSum, minOperations)\r\n\r\nprint(minOperations if minOperations != float(\"inf\") else 0)\r\n\r\n", "text = input()\r\n\r\ndp = [0 for _ in text] + [0]\r\n\r\ncnt = 0\r\nfor ch in text:\r\n if ch.isupper():\r\n cnt +=1\r\n\r\ndp[0] = cnt\r\n\r\nfor i in range(1, len(text)+1):\r\n if text[i-1].islower():\r\n dp[i] = dp[i-1]+1\r\n elif text[i-1].isupper():\r\n dp[i] = dp[i-1]-1\r\n\r\nprint(min(dp))", "s=input();l=0;u=0\r\nfor i in range(0,len(s)):\r\n if s[i].islower():\r\n l+=1\r\n else:\r\n if l>0:\r\n l-=1;u+=1;\r\nprint(u)", "def a(s: str) -> int:\n length = len(s)\n to_upper = [0] * (length + 1)\n to_lower = [0] * (length + 1)\n for i in range(length):\n to_upper[i + 1] = to_upper[i] + (1 if s[i].islower() else 0)\n for i in range(length - 1, -1, -1):\n to_lower[i] = to_lower[i + 1] + (1 if s[i].isupper() else 0)\n a = float('inf')\n for i in range(length + 1):\n a = min(a, to_upper[i] + to_lower[i])\n return a\n\nstr = input()\nres = a(str)\nprint(res)\n\t\t\t \t\t \t\t \t\t \t \t \t\t \t \t", "letter = list(input())\r\nn = len(letter)\r\nupper = [0] * (n+1)\r\nlower = [0] * (n+1)\r\n\r\nfor i in range(n):\r\n upper[i+1] = upper[i] + int(letter[i].isupper())\r\n lower[i+1] = lower[i] + int(letter[i].islower())\r\n\r\n\r\nans = n\r\nfor i in range(n):\r\n ans = min(ans, lower[i] + upper[-1] - upper[i+1])\r\nprint(ans)", "_string = input()\r\n\r\naux = 0\r\nresult = 0\r\n\r\nfor i in _string:\r\n if i.islower():\r\n aux += 1\r\n elif aux > 0:\r\n result += 1\r\n aux -= 1\r\n\r\nprint(result)", "t = [0] + [i < 'a' for i in input()]\r\nfor i in range(2, len(t)):\r\n t[i] += t[i - 1]\r\ns = t[-1]\r\nprint(min(s - 2 * j + i for i, j in enumerate(t)))", "from math import inf\r\n\r\ns=input().strip()\r\nx=[]\r\nfor i in s:\r\n x.append(1 if i.isupper() else 0)\r\n\r\np=0\r\n\r\nq=sum(x)\r\nm=q\r\nfor i in range(len(x)):\r\n p+=x[i]\r\n q-=x[i]\r\n m=min(m,(i+1-p)+q )\r\n\r\nprint(m)", "s=input().strip()\r\na,r=0,0\r\nfor x in s:\r\n\tif x.islower():a+=1\r\n\telif x.isupper() and a>0:\r\n\t a-=1\r\n\t r+=1\r\nprint(r)", "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(10001)\r\n\r\ns = input()\r\nr = 0\r\nfor i in range(len(s)-1,-1,-1):\r\n r += (1 if s[i] in string.ascii_uppercase else 0)\r\nans = r\r\nl = 0\r\nfor i in range(len(s)):\r\n l+= (1 if s[i] in string.ascii_lowercase else 0)\r\n r -= (1 if s[i] in string.ascii_uppercase else 0)\r\n ans = min(ans,l+r)\r\nprint(ans)\r\n\r\n", "\r\n\r\nfrom collections import deque\r\n\r\n\r\ndef build_lps_table(s):\r\n table = [0] * len(s)\r\n index = 0\r\n for i in range(1, len(s)):\r\n if s[i] == s[index]:\r\n table[i] = index + 1\r\n index += 1\r\n else:\r\n index = table[i-1]\r\n while index > 0 and s[index] != s[i]:\r\n index = table[index-1]\r\n\r\n if s[i] == s[index]:\r\n index += 1\r\n table[i] = index\r\n return table\r\n\r\n\r\n\"\"\"\r\n\r\n[1, 1, 0, 0, 1 1 ]\r\n\r\n\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n s = input()\r\n queue = deque()\r\n count = 0\r\n s = [1 if \"A\" <= c <= \"Z\" else 0 for c in s]\r\n count = 0\r\n for c in s:\r\n if c == 0:\r\n queue.appendleft(c)\r\n else:\r\n if queue:\r\n queue.popleft()\r\n count += 1\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def calculate_min_modifications(s):\n upper_count = 0 # 大写字符计数\n lower_count = 0 # 小写字符计数\n\n # 统计大写字符和小写字符的个数\n for char in s:\n if char.isupper():\n upper_count += 1\n else:\n lower_count += 1\n\n # 遍历字符串，尝试所有可能的分割位置，计算修改次数\n min_modifications = min(upper_count, lower_count) # 初始化最小修改次数为大写字符和小写字符个数的较小值\n current_upper = 0 # 当前大写字符个数\n current_lower = 0 # 当前小写字符个数\n\n for i in range(len(s) - 1):\n if s[i].isupper():\n current_upper += 1\n else:\n current_lower += 1\n\n # 计算修改次数并更新最小修改次数\n modifications = current_lower + (upper_count - current_upper)\n min_modifications = min(min_modifications, modifications)\n\n return min_modifications\n\n# 读取输入\ns = input().strip()\n\n# 计算最少修改次数并输出结果\nmin_modifications = calculate_min_modifications(s)\nprint(min_modifications)\n\n\t\t\t\t\t \t\t \t\t \t\t \t \t \t\t\t \t \t \t", "s = input()\r\nn = len(s)\r\n\r\n#dp: m[i][j] - i represents final index considered, j boolean as to whether it is capital\r\nm = [[0, 0] for i in range(n)]\r\n\r\nm[0][0] = int(s[0].isupper())\r\nm[0][1] = 1 - m[0][0]\r\n\r\nfor i in range(n):\r\n m[i][0] = min(m[i - 1]) + int(s[i].isupper())\r\n m[i][1] = m[i - 1][1] + int(s[i].islower())\r\n\r\nans = min(m[-1])\r\nprint(ans)\r\n\r\n\r\n\r\n", "S = input()\nN = len(S)\nlo = [0]*N\nup = [0]*N\n\nif S[0].islower():\n lo[0] = 1\nfor i in range(1,N):\n if S[i].islower():\n lo[i] = lo[i-1] + 1\n else:\n lo[i] = lo[i-1]\n\nif S[-1].isupper():\n up[-1] = 1\n\nfor i in range(2,N+1):\n if S[-i].isupper():\n up[-i] = up[-i+1] + 1\n else:\n up[-i] = up[-i+1]\n\nans = float(\"inf\")\nfor i in range(N):\n ans = min(ans , lo[i] + up[i] - 1)\nprint(ans)\n\n\n\n", "'''Author- Akshit Monga'''\r\ns=input()\r\nn=len(s)\r\na=0\r\nfor i in s:\r\n if i.isupper():\r\n a+=1\r\nb=n-a\r\nans=min(a,b)\r\nc1=c2=0\r\nfor i in range(n-1):\r\n c1 += s[i].isupper()\r\n c2 += s[i].islower()\r\n ans=min(ans,c2+a-c1)\r\nprint(ans)", "ch = input()\r\nt = 0\r\n\r\nfor i in ch:\r\n if i >= 'A' and i <= 'Z':\r\n t += 1 \r\n\r\nn = len(ch)\r\nL = [t] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n if ch[i - 1] <= 'Z' and ch[i - 1] >= 'A':\r\n L[i] = L[i - 1] - 1\r\n else:\r\n L[i] = L[i - 1] + 1\r\n\r\nprint(min(L))", "def fancialize_message(message):\r\n lowers_finded = 0\r\n operations = 0\r\n for i in range(len(message)):\r\n letter = message[i]\r\n if (letter.islower()):\r\n lowers_finded += 1\r\n elif lowers_finded > 0:\r\n operations += 1\r\n lowers_finded -= 1\r\n return operations\r\n \r\nmessage = input()\r\nprint(fancialize_message(message))", "a=str(input())\r\nma=10**5\r\npre,suf=[0]*len(a),[0]*len(a)\r\nn=len(a)\r\nfor i in range(len(a)):\r\n if i==0:\r\n if ord(a[0])>96:\r\n pre[i]=1\r\n else:\r\n pre[i]=0\r\n continue\r\n if ord(a[i])>96:\r\n pre[i]=pre[i-1]+1\r\n else:\r\n pre[i]=pre[i-1]\r\nfor i in range(len(a)-1,-1,-1):\r\n if i==n-1:\r\n if ord(a[n-1])>96:\r\n suf[i]=0\r\n else:\r\n suf[i]=1\r\n continue\r\n if ord(a[i])<96:\r\n suf[i]=suf[i+1]+1\r\n else:\r\n suf[i]=suf[i+1] \r\nfor i in range(len(a)-1):\r\n if pre[i]+suf[i+1]<ma:\r\n ma=pre[i]+suf[i+1]\r\nans=0\r\nfor hi in range(len(a)):\r\n if ord(a[hi])<97:\r\n ans+=1\r\nma=min(ans,ma)\r\nans=0\r\nfor ii in range(len(a)):\r\n if ord(a[ii])>96:\r\n ans+=1\r\nma=min(ans,ma)\r\nprint(ma)", "str = input()\nn = len(str)\n\n# rec = []\n#\n# for i in range(n+1):\n# c = 0\n# for j in range(i):\n# if (str[j].islower()):\n# c += 1\n# for j in range(i, n):\n# if (str[j].isupper()):\n# c += 1\n# rec.append (c)\n# TIME LIMIT WASN'T MET\n\nres = [0]*(n+1)\nfor i in range (n):\n if (str[i].isupper()):\n res[0] += 1\n\nfor i in range (n):\n if (str[i].isupper()):\n res[i+1] = res[i] - 1\n else:\n res[i+1] = res[i] + 1\n\nprint(min(res))\n\n", "s = input(); l = 0; r = 0\r\nfor i in s:\r\n\tif i.islower():\r\n\t\tl = min(l, r); r += 1\r\n\telse:\r\n\t\tl = min(l+1, r)\r\nprint(l)", "s = input()\r\n\r\nn_lower = 0\r\nn_upper = 0\r\nfor i in s: n_upper += i.isupper()\r\n\r\nans = []\r\nfor i in range(0, len(s)):\r\n ans.append(n_lower+n_upper)\r\n n_lower += s[i].islower()\r\n n_upper -= s[i].isupper()\r\nans.append(n_lower+n_upper)\r\n\r\nprint(min(ans))", "s=input()\r\narr=[]\r\nfor c in s:\r\n if c.isupper():\r\n arr.append(0)\r\n else :\r\n arr.append(1)\r\nans=min(arr.count(1),arr.count(0))\r\nstack=[[0,arr.count(0)]]\r\nfor el in arr:\r\n if el==1:\r\n a,b=stack[-1]\r\n stack.append([a+1,b])\r\n else :\r\n a,b=stack[-1]\r\n stack.append([a,b-1])\r\n ans=min(ans,sum(stack[-1]))\r\nprint(ans)", "# Problem: C. Letter\r\n# Contest: Codeforces - Codeforces Round #116 (Div. 2, ACM-ICPC Rules)\r\n# URL: https://codeforces.com/problemset/problem/180/C\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# \r\n# KAPOOR'S\r\n\r\nfrom sys import stdin, stdout \r\n\r\ndef INI():\r\n\treturn int(stdin.readline())\r\n\t\r\ndef INL():\r\n\treturn [int(_) for _ in stdin.readline().split()]\r\n\t\r\ndef INS():\r\n\treturn stdin.readline()\r\n\r\ndef MOD():\r\n return pow(10,9)+7\r\n\t\r\ndef OPS(ans):\r\n\tstdout.write(str(ans)+\"\\n\")\r\n\t\r\ndef OPL(ans):\r\n\t[stdout.write(str(_)+\" \") for _ in ans]\r\n\tstdout.write(\"\\n\")\r\n\r\n\t\r\nif __name__==\"__main__\":\r\n\tS=INS()\r\n\tn=len(S)\r\n\tpre=[0]\r\n\tpost=[0]\r\n\tfor _ in range(n):\r\n\t\tif _==0:\r\n\t\t\tif S[_].islower():\r\n\t\t\t\tpre.append(1)\r\n\t\t\telse:\r\n\t\t\t\tpre.append(0)\r\n\t\t\tif S[n-_-1].isupper():\r\n\t\t\t\tpost.append(1)\r\n\t\t\telse:\r\n\t\t\t\tpost.append(0)\r\n\t\telse:\r\n\t\t\t\r\n\t\t\tif S[_].islower():\r\n\t\t\t\tpre.append(pre[-1]+1)\r\n\t\t\telse:\r\n\t\t\t\tpre.append(pre[-1])\r\n\t\t\tif S[n-_-1].isupper():\r\n\t\t\t\tpost.append(post[-1]+1)\r\n\t\t\telse:\r\n\t\t\t\tpost.append(post[-1])\r\n\t\r\n\tpost.sort(reverse=True)\r\n\tans=float(\"inf\")\r\n\tfor _ in range(n+1):\r\n\t\tans=min(ans,post[_]+pre[_])\r\n\tOPS(ans)", "def main():\n str = input()\n str_len = len(str)\n\n upper_count = 0\n cur_upper = 0\n \n\n for i in range(str_len):\n if str[i].isupper():\n upper_count += 1\n\n ans = upper_count\n for i in range(str_len):\n cur_upper += str[i].isupper()\n cur_ops = i + 1 - cur_upper + upper_count - cur_upper\n ans = min(ans, cur_ops)\n \n print(ans)\nmain()", "st=input()\nb,l=0,0\nfor i in st:\n if i.islower():\n l+=1\n elif i.isupper() and l>0:\n l-=1\n b+=1\nprint(b)\n \t\t\t \t \t\t \t \t \t \t\t \t", "from sys import stdin\r\n\r\ndef rei():\r\n return list(map(int, stdin.readline().strip().split(' ')))\r\ndef res():\r\n return stdin.readline().rstrip()\r\n\r\ndef prno(): print('NO')\r\n\r\ndef pryes(): print('YES')\r\n\r\ndef solve():\r\n s=res()\r\n n=len(s)\r\n dpl=[0]*(n+1)\r\n dpr=[0]*(n+1)\r\n for i in range(0, n):\r\n if s[i].islower(): \r\n dpl[i+1]=dpl[i]+1\r\n else:\r\n dpl[i+1]=dpl[i]\r\n\r\n for i in range(n-1, -1, -1):\r\n if s[i].isupper():\r\n dpr[i]=dpr[i+1]+1\r\n else:\r\n dpr[i]=dpr[i+1] \r\n\r\n ans=float('inf')\r\n for l,r in list(zip(dpl, dpr)):\r\n ans=min(ans, l+r)\r\n print(ans)\r\nif __name__ == '__main__':\r\n solve()", "s=input()\ndp=[]\nfor _ in range(len(s)):\n dp.append([0,0])\nif s[0].isupper():\n dp[0][1]=1\nelse:\n dp[0][0]=1\n \nfor i in range(len(s)):\n if s[i].isupper():\n dp[i][0]=dp[i-1][0]\n dp[i][1]=min(dp[i-1][0],dp[i-1][1])+1\n else:\n dp[i][0]=dp[i-1][0]+1\n dp[i][1]=min(dp[i-1][0],dp[i-1][1])\nprint(min(dp[len(s)-1][0],dp[len(s)-1][1]))", "R = lambda: map(int, input().split())\r\ns = list(input())\r\nl = len(s)\r\nL = [[] for i in range(l)]\r\nc = 0\r\nfor i in range(l):\r\n L[i].append(c)\r\n if 'a' <= s[i] <= 'z':c += 1\r\nc = 0\r\nfor i in reversed(range(l)):\r\n L[i].append(c)\r\n if 'A' <= s[i] <= 'Z':c += 1\r\nmi = sum(L[0])\r\nfor i in range(1,l):\r\n mi = min(mi, sum(L[i]))\r\nprint(mi)", "s = input()\r\nn = len(s)\r\na = [[0, 0] for _ in range(n)]\r\n \r\na[0][0] = 0\r\na[0][1] = 1\r\n \r\nfor i in range(1, n):\r\n if s[i].islower():\r\n a[i][0] = min(*a[i-1])\r\n if s[i-1].islower():\r\n a[i][1] = a[i-1][1] + 1\r\n else:\r\n a[i][1] = a[i-1][0] + 1\r\n else:\r\n a[i][1] = min(*a[i-1]) + 1\r\n if s[i-1].islower():\r\n a[i][0] = a[i-1][1]\r\n else:\r\n a[i][0] = a[i-1][0]\r\n \r\nprint(min(*a[-1]))", "s = input()\r\na = 0\r\nb = 0\r\nfor c in s:\r\n\tif (c >= 'a' and c <= 'z'):\r\n\t\ta = min(a, b)\r\n\t\tb = b + 1\r\n\telse:\r\n\t\ta = min(a, b) + 1\r\nprint (\"%d\" % min(a, b))", " \r\ns = input()\r\nans = 0\r\na = 0\r\n\r\nfor i in s:\r\n if i.islower():\r\n a += 1\r\n elif i.isupper() and a > 0:\r\n a -= 1\r\n ans += 1\r\nprint (ans)", "def cl(ch):\r\n if(ord(ch)>=97 and ord(ch)<=122):\r\n return True\r\n return False\r\n\r\nif __name__==\"__main__\":\r\n s = input()\r\n n = len(s)\r\n pref = [0]*(n+1)\r\n suff = [0]*(n+1)\r\n for i in range(1,n+1):\r\n pref[i] = pref[i-1]\r\n if(cl(s[i-1])):\r\n pref[i] += 1\r\n \r\n for i in range(n-1,-1, -1):\r\n suff[i] = suff[i+1]\r\n if(not cl(s[i])):\r\n suff[i]+=1\r\n #print(pref)\r\n #print(suff)\r\n\r\n ans = pow(10,5)+1\r\n for i in range(n+1):\r\n ans = min(ans, pref[i]+suff[i])\r\n print(ans)\r\n", "s = list(input())\r\nl,r=0,0\r\nn=0\r\nfor i,x in enumerate(s):\r\n if 'A'<=x<='Z':\r\n r+=1\r\n n+=1\r\nres=r\r\nfor i in range(1,n+1):\r\n if 'a'<=s[i-1]<='z':\r\n l+=1\r\n else:\r\n r-=1\r\n if l+r<res:\r\n res=l+r\r\nprint(res)", "from distutils import dep_util\nfrom re import L\n\n\ns = input()\ndp_upper = [0]\nfor ch in s:\n if (ch.isupper()):\n dp_upper.append(dp_upper[len(dp_upper)-1] + 1)\n else:\n dp_upper.append(dp_upper[len(dp_upper)-1])\nresult = len(s)\nfor i in range(len(s) + 1):\n result = min(result, i - dp_upper[i] + (dp_upper[len(s)] - dp_upper[i]))\nprint(result)\n", "string=input()\r\nn=len(string)\r\nupper=0\r\nlower=0\r\ncount=0\r\ni=0\r\nk=n-1\r\nwhile i<n and ord(string[i])<97:\r\n i+=1\r\n\r\nfor j in range(n-1,i-1,-1):\r\n if ord(string[j])>=97:\r\n lower+=1\r\n else:\r\n upper+=1\r\n if lower>=upper:\r\n count+=upper\r\n lower=0\r\n upper=0\r\n if j==i and lower<upper:\r\n count+=lower\r\nprint(count)", "a=input()\r\nl,u=0,0\r\nfor i in a:\r\n if i.islower():\r\n l=min(u,l)\r\n u+=1\r\n else:\r\n l=min(u,l)+1\r\n#print(u,l)\r\nprint(min(u,l))", "s=input()\r\nx=0\r\nfor j in s:\r\n if j.isupper():\r\n x+=1\r\nres=x\r\ny=0\r\nfor j in s:\r\n if j.isupper():\r\n x-=1\r\n else:\r\n y+=1\r\n res=min(res, x+y)\r\nprint(res)", "def min_changes(str: str) -> int:\n length = len(str)\n upper_count_array = [0] * (length + 1)\n lower_count_array = [0] * (length + 1)\n for i in range(1, length + 1):\n upper_count_array[i] = upper_count_array[i - 1] + (str[i - 1].islower())\n lower_count_array[i] = lower_count_array[i - 1] + (str[i - 1].isupper())\n min_changes = float('inf')\n for i in range(length + 1):\n min_changes = min(min_changes, upper_count_array[i] + lower_count_array[length] - lower_count_array[i])\n return min_changes\n\nstring = input()\nprint(min_changes(string))\n \t\t\t \t\t \t\t \t\t \t\t \t \t \t", "s=input()\na,r=0,0\nfor x in s:\n\tif x.islower():a+=1\n\telif x.isupper() and a>0:a-=1;r+=1\nprint(r)", "'''input\r\nhelloworld\r\nOYPROSTIYAOPECHATALSYAPRIVETSTASYA\r\nPRuvetSTAaYA\r\n'''\r\nfrom sys import stdin,stdout\r\nimport bisect\r\nI = lambda: stdin.readline().strip()\r\nread = lambda: map(int,stdin.readline().split())\r\ns = I()\r\nlen_s = len(s)\r\ntempu,templ = 0,0\r\ndpu,dpl = [0]*(len_s+1), [0]*(len_s+1)\r\nfor ind,i in enumerate(s):\r\n\tif i==i.lower():\r\n\t\ttempu+=1\r\n\tdpu[ind+1] = tempu\r\nfor i in range(len(s)-1,-1,-1):\r\n\tif s[i]==s[i].upper():\r\n\t\ttempl+=1\r\n\tdpl[i] = templ\r\n# print(dpl,dpu)\r\n\r\nprint(min([dpu[x]+dpl[x+1] for x in range(len_s)]))\r\nquit()\r\n#550A\r\ns = I()\r\nx = s.find('AB')\r\nif x>-1:\r\n\tif s[x+2:].find('BA')>-1:\r\n\t\tprint('YES')\r\n\t\tquit()\r\nx = s.find('BA')\r\n# print(x,s[x+2:].find('AB'))\r\nif x>-1:\r\n\tif s[x+2:].find('AB')>-1:\r\n\t\tprint('YES')\r\n\t\tquit()\r\nprint('NO')\r\nquit()\r\n#987C\r\nn = int(I())\r\ns = tuple(read())\r\nc = tuple(read())\r\n\r\nINF = 10**9\r\nmin_so_far = INF\r\nfor j in range(n):\r\n\tm1 = min([INF]+[c[i] for i in range(j) if s[i]<s[j]])\r\n\tm2 = min([INF]+[c[i] for i in range(j+1,n) if s[i]>s[j]])\r\n\tmin_so_far = min(min_so_far,c[j]+m1+m2)\r\nprint(min_so_far if min_so_far<INF else -1)\r\n\r\nquit() \r\n#289B\r\nn,m,d = read()\r\narr = []\r\nfor i in range(n):\r\n\tarr.extend(list(read()))\r\n\r\nbase = arr[0]\r\nfor i in arr:\r\n\tif (i-base)%d:\r\n\t\tprint(-1)\r\n\t\tquit()\r\n\r\narr.sort()\r\ns = n*m\r\nSum = 0\r\ndev1 = dev2 = 0\r\nif s%2:\r\n\tmedian = arr[s//2]\r\n\tfor i in arr:\r\n\t\tSum+=abs(i-median)\r\nelse:\r\n\tm1,m2 = arr[(s//2)-1],arr[s//2]\r\n\tSum2 = 0\r\n\tfor i in arr:\r\n\t\tSum+=abs(i-m1)\r\n\t\tSum2+=abs(i-m2)\r\n\tSum = min(Sum,Sum2)\r\nprint(Sum//d)\r\n", "s = input()\r\nl_min = 0\r\nu_comp = 0\r\nfor i in range(len(s)):\r\n if(ord(s[i]) >= 97):\r\n l_min = min(l_min, u_comp)\r\n u_comp += 1\r\n else:\r\n l_min = min(u_comp, l_min) + 1\r\nprint(min(u_comp, l_min))", "s=input()\nx,y=0,0\nfor i in s:\n if i.islower():\n x+=1\n elif x>0:\n y+=1\n x-=1\nprint(y)\n", "s = input()\nlowerSum = [0]\ndp = [0]\nfor c in s:\n if c.islower():\n dp.append(dp[-1])\n else:\n dp.append(min(dp[-1] + 1, lowerSum[-1]))\n lowerSum.append(c.islower() + lowerSum[-1])\n \nprint(dp[-1])", "s = input()\r\ndp = [[0,0] for _ in range(len(s))]\r\n\r\nif s[0] == s[0].lower():\r\n dp[0][1] = 1\r\nelse:\r\n dp[0][0] = 1\r\n \r\nfor i in range(1, len(s)):\r\n if s[i] == s[i].lower():\r\n dp[i][0] = min(dp[i-1])\r\n dp[i][1] = 1 + dp[i-1][1]\r\n else:\r\n dp[i][0] = 1 + min(dp[i-1])\r\n dp[i][1] = dp[i-1][1]\r\n \r\nprint(min(dp[-1]))\r\n ", "s = input()\r\nn = len(s)\r\nA, B = [0] * n, [0] * n\r\n\r\nfor i in range(n):\r\n A[i] = A[i-1] + s[i].islower()\r\n B[-i-1] = B[-i] + s[-i-1].isupper()\r\n\r\nprint(min(a + b for a, b in zip(A, B)) - 1)", "s = input( )\r\ns1 = 0 \r\ns2 = 0\r\nfor v in s : \r\n if v.islower( ) : \r\n s1 += 1 \r\n elif s1 > 0 : \r\n s1 -= 1 \r\n s2 += 1\r\nprint( s2 ) ", "def insr():\r\n s = input()\r\n return(list(s))\r\ns = insr()\r\n\r\n\r\nupper = [0 for i in range(len(s))]\r\nlower = []\r\nup = 0\r\nlo = 0\r\nfor char in s:\r\n if char.islower():\r\n lo += 1\r\n\r\n lower.append(lo)\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i].isupper():\r\n up += 1\r\n upper[i] = up\r\nans = min(upper[0],lower[-1])\r\nfor i in range(1,len(s)):\r\n ans = min(ans,upper[i]+lower[i-1])\r\n\r\nprint(ans)\r\n\r\n", "#region Header\r\n#!/usr/bin/env python3\r\n# from typing import *\r\n\r\nimport sys\r\nimport io\r\nimport math\r\nimport collections\r\nimport decimal\r\nimport itertools\r\nimport bisect\r\nimport heapq\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline()[:-1]\r\n\r\n\r\n# sys.setrecursionlimit(1000000)\r\n#endregion\r\n\r\n# _INPUT = \"\"\"PRuvetSTAaYA\r\n# \"\"\"\r\n# sys.stdin = io.StringIO(_INPUT)\r\n\r\n\r\ndef main():\r\n S = input()\r\n N = len(S)\r\n\r\n dp = [0] * (N+1)\r\n dp[0] = sum(1 for c in S if c.isupper())\r\n for i in range(N):\r\n if S[i].isupper():\r\n dp[i+1] = dp[i] - 1\r\n else:\r\n dp[i+1] = dp[i] + 1\r\n\r\n ans = min(dp)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s=str(input())\r\nn=len(s);\r\nsum=[0]*(n+1)\r\nfor i in range(n-1, -1, -1):\r\n sum[i]=sum[i+1]+ (0 if ord(s[i])>=ord('a') else 1)\r\ncount, ans=0, sum[0]\r\nfor i in range(n):\r\n count+=(1 if ord(s[i])>=ord('a') else 0)\r\n ans=min(ans,sum[i+1]+count);\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# dp=[[]]*len(s)\r\n# capitalCount=0\r\n# smallCount=0\r\n# firstSmallIndex=1000000\r\n# lastCapitalIndex=-1\r\n# ans=0\r\n# if ord(s[0])>=65 and ord(s[0])<91:\r\n# dp[0]=[0, 1]\r\n# else:\r\n# dp[0]=[1, 0]\r\n# for i in range(1, len(s)):\r\n# if ord(s[i])>=65 and ord(s[i])<91:\r\n# dp[i]=[dp[i-1][0], dp[i-1][1]+1]\r\n# lastCapitalIndex=i\r\n# else:\r\n# dp[i]=[dp[i-1][0]+1, dp[i-1][1]]\r\n# firstSmallIndex=min(firstSmallIndex, i)\r\n# capitalFound=1\r\n# if dp[len(s)-1][0]==len(s) or dp[len(s)-1][1]==len(s):\r\n# print(0)\r\n# else:\r\n# if (dp[lastCapitalIndex][0]-dp[firstSmallIndex][0])+1>(dp[lastCapitalIndex][1]-dp[firstSmallIndex][1]):\r\n# print(dp[lastCapitalIndex][1]-dp[firstSmallIndex][1])\r\n# else:\r\n# for i in range(firstSmallIndex, lastCapitalIndex+1): \r\n# if ord(s[i])>=97:\r\n# if (dp[lastCapitalIndex][0]-dp[i][0])+1>(dp[lastCapitalIndex][1]-dp[i][1]) and capitalFound:\r\n# ans+=(dp[lastCapitalIndex][1]-dp[i][1])\r\n# break\r\n# ans+=1\r\n# capitalFound=0\r\n# else:\r\n# capitalFound=1\r\n# print(ans)\r\n", "#Anuneet Anand\r\n\r\ndef f(x):\r\n\tif ord(x)>96 and ord(x)<123:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\ns = input()\r\na = s.lower()\r\nb = s.upper()\r\nn = len(s)\r\n\r\nif s == a or s == b:\r\n\tprint(0)\r\nelse:\r\n\tL = [0 for i in range(n)]\r\n\tR = [0 for j in range(n)]\r\n\r\n\ta = 0\r\n\tfor i in range(n):\r\n\t\tL[i]=a\r\n\t\tif f(s[i]):\r\n\t\t\ta = a + 1\r\n\r\n\tb = 0\r\n\tfor j in range(n-1,-1,-1):\r\n\t\tR[j]=b\r\n\t\tif not f(s[j]):\r\n\t\t\tb = b + 1\r\n\r\n\tm = n\r\n\tfor k in range(n):\r\n\t\tm = min(m,L[k]+R[k])\r\n\tprint(m)\r\n", "s=input()\n\nl=[0]*(len(s)+1)\n\nfor i in range(1,len(s)+1):\n if s[i-1].isupper():\n l[i]=l[i-1]\n else:\n l[i]=l[i-1]+1\n\nr=[0]*(len(s)+2)\n\nfor i in range(len(s),0,-1):\n if s[i-1].islower():\n r[i]=r[i+1]\n else:\n r[i]=r[i+1]+1\n\nl=l[1:]\nr=r[1:-1]\n\n\nmn=r[0]\nr.pop(0)\n\nmn=min(mn,l[-1])\nl.pop(-1)\n\nfor i in range(len(l)):\n mn=min(mn,l[i]+r[i])\n\nprint(mn)", "import sys\n\ns = sys.stdin.readline().split()[0]\nn = len(s)\n\nlow = [0] * (n + 1)\nupp = [0] * (n + 1)\n\nminc = n - 1\n\nfor i in range(n):\n if i == 0:\n if s[i].lower() == s[i]:\n low[i + 1] = 1\n\n if s[-i-1].upper() == s[-i-1]:\n upp[-i-2] = 1\n else:\n low[i + 1] = low[i]\n upp[-i-2] = upp[-i-1]\n if s[i].lower() == s[i]:\n low[i + 1] += 1\n if s[-i-1].upper() == s[-i-1]:\n upp[-i - 2] += 1\n \nfor i in range(n + 1):\n if low[i] + upp[i] < minc:\n minc = low[i] + upp[i]\n\nprint(minc)\n\n \t \t\t \t\t \t\t\t \t\t \t\t\t", "string = input()\r\n\r\nupper = 0\r\nlower = 0\r\nlength = len(string)\r\n\r\nfor i in string:\r\n if(ord(i)<=122 and ord(i)>=97):\r\n lower += 1\r\n else:\r\n upper += 1\r\n \r\nmn = min(lower,upper)\r\n\r\nfor i in string:\r\n if(i.islower()):\r\n lower -= 1\r\n upper+=1\r\n else:\r\n upper -= 1\r\n mn = min(mn,upper)\r\n \r\nprint(mn)", "st = input()\r\nl, u = 0, 0\r\nfor i in st:\r\n if i.islower():\r\n l = l + 1\r\n else:\r\n if l>0:\r\n u = u + 1\r\n l = l - 1\r\nprint(u)", "a = input().strip()\nn = len(a)\ndp = [[None for _ in range(2)] for _ in range(n)]\nif a[0].isupper():\n dp[0][0] = 1\n dp[0][1] = 0\nelse:\n dp[0][0] = 0\n dp[0][1] = 1\n\nfor i in range(1, n):\n dp[i][0] = min(dp[i - 1][0], dp[i - 1][1])\n if a[i].isupper():\n dp[i][0] += 1\n\n dp[i][1] = dp[i - 1][1]\n if a[i].islower():\n dp[i][1] += 1\n\nprint(min(dp[-1]))\n", "def fancy(s):\n if s.isupper() or s.islower():\n return 0\n else:\n n = len(s)\n # lower = [0] * n\n # upper = [0] * n\n lower = int(s[0].isupper())\n upper = int(s[0].islower())\n for i in range(1, n):\n lower = min(upper, lower) + s[i].isupper()\n upper += s[i].islower()\n # print(lower, upper)\n return min(lower, upper)\n\nif __name__ == '__main__':\n sentence = input()\n res = fancy(sentence)\n print(res)\n\n\t \t\t\t \t \t\t\t \t \t \t\t", "s = input()\r\nans0 = ans = 0\r\nfor i in s:\r\n if i. lower() == i:\r\n ans0 += 1\r\n else:\r\n ans = min(ans0, ans + 1)\r\nprint(ans)\r\n", "s=input()\r\ncapcount=0\r\nsmallcount=0\r\nfor i in s:\r\n if(i.isupper()):\r\n capcount+=1\r\n else:\r\n smallcount+=1\r\nllist=[]\r\na=0\r\nb=0\r\nfor i in s:\r\n if(i.isupper()):\r\n a+=1\r\n l=b\r\n k=(capcount-a)\r\n llist.append(l+k)\r\n else:\r\n l=b\r\n b+=1\r\n k=(capcount-a)\r\n llist.append(l+k)\r\n# print(llist)\r\nprint(min(llist))", "s = input()\r\nc = 0\r\n\r\nfor i in s:\r\n if i.isupper():\r\n c += 1\r\n\r\nc2 = c\r\n\r\nfor i in s:\r\n if i.isupper():\r\n c2 -= 1\r\n else:\r\n c2 += 1\r\n c = min(c, c2)\r\nprint(c)\r\n", "ch=input()\r\nnbmajus=0\r\nfor i in ch:\r\n if i>='A' and i<='Z':\r\n nbmajus+=1 \r\nn=len(ch)\r\nL=[nbmajus]*(n+1)\r\nfor i in range(1,n+1):\r\n if ch[i-1]<='Z' and ch[i-1]>='A':\r\n L[i]=L[i-1]-1\r\n else:\r\n L[i]=L[i-1]+1\r\nprint(min(L))\r\n\r\n", "string = input()\r\n\r\nlmao = []\r\n\r\ntoggle = True\r\ncount = 0\r\ninitL = False\r\nnumL = 0\r\nfor i in range(len(string)):\r\n char = string[i:(i+1)]\r\n if char.isupper():\r\n numL += 1\r\nlU = [0]\r\nrL = [numL]\r\nfor i in range(len(string)):\r\n char = string[i:(i+1)]\r\n if not char.isupper():\r\n count += 1\r\n else:\r\n numL -= 1\r\n lU.append(count)\r\n rL.append(numL)\r\nlol = 999999\r\nfor i in range(len(lU)):\r\n lol = min(lol, lU[i] + rL[i])\r\nprint(lol)\r\n\r\n", "# from collections import *\r\nfrom concurrent.futures import thread\r\nimport sys\r\nfrom threading import main_thread\r\nimport threading\r\n# from heapq import *\r\n\r\ndef inp():\r\n s = input()\r\n print(solution(s))\r\n \r\ndef solution(s):\r\n memo = {}\r\n def dp(i, tocapital):\r\n \r\n if i >= len(s):\r\n return 0\r\n if (i, tocapital) in memo:\r\n return memo[(i, tocapital)]\r\n if tocapital:\r\n if not s[i].isupper():\r\n memo[(i, tocapital)] = min(1 + dp(i+1, tocapital), dp(i+1, not tocapital))\r\n else:\r\n memo[(i, tocapital)] = min(dp(i+1, tocapital), dp(i+1, not tocapital))\r\n else:\r\n if s[i].isupper():\r\n memo[(i, tocapital)] = 1 + dp(i+1, tocapital)\r\n else:\r\n memo[(i, tocapital)] = dp(i+1, tocapital)\r\n \r\n return memo[(i, tocapital)]\r\n \r\n return min(dp(0, True), dp(0, False))\r\n \r\n \r\n \r\n# inp()\r\nthreading.stack_size(1<<27)\r\nsys.setrecursionlimit(200000)\r\nmain_thread = threading.Thread(target=inp)\r\nmain_thread.start()\r\nmain_thread.join()\r\n", "a=input().strip()\nf=0\nc=0\nfor i in range(len(a)):\n if(a[i].islower()):\n f+=1\n else:\n if(f):\n f-=1\n c+=1\nprint(c)\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.readline\r\n\r\ns = input()\r\nn = len(s)\r\nd = [[0]*2 for _ in range(0,2)]\r\n\r\nfor i in range(1,n+1):\r\n d[i%2][0] = min(d[(i-1)%2][0],d[(i-1)%2][1]) + ((ord(s[i-1])>=ord('A') and ((ord(s[i-1])<=ord('Z')))))\r\n d[i%2][1] = d[(i-1)%2][1] + ((ord(s[i-1])>=ord('a') and ((ord(s[i-1])<=ord('z')))))\r\n\r\nprint(min(d[n%2][0],d[n%2][1]))", "letter = str(input())\r\nfancy, upper, lower = 0,[0],[0]\r\n \r\nfor i in range(len(letter)):\r\n if(ord(letter[i])>=97):\r\n if(i>0):\r\n lower.append(lower[i]+1)\r\n else:\r\n lower.append(1)\r\n upper.append(upper[i])\r\n else:\r\n if(i>0):\r\n upper.append(upper[i]+1)\r\n else:\r\n upper.append(1)\r\n lower.append(lower[i])\r\n \r\nfor i in range(len(letter)+1): \r\n if(i==0):\r\n fancy=lower[i]+upper[len(letter)]-upper[i]\r\n \r\n if(lower[i]+upper[len(letter)]-upper[i]<fancy):\r\n fancy=lower[i]+upper[len(letter)]-upper[i] \r\nprint(fancy)", "\r\ns = input()\r\na = [0] * len(s)\r\nbig = 0\r\nsmall = 0\r\nfor x in s:\r\n if 'A' <= x and x <= 'Z':\r\n big += 1\r\nans = big\r\nfor x in s:\r\n if 'A' <= x and x <= 'Z':\r\n big -= 1\r\n else:\r\n small += 1\r\n ans = min(ans, big + small)\r\nprint(ans) \r\n ", "s = input()\r\nup_cnt = 0\r\nlow_cnt = 0\r\nfor i in s:\r\n if i.isupper():\r\n up_cnt += 1\r\n else:\r\n low_cnt += 1\r\ncur_up = 0\r\ncur_low = 0\r\nans = 1000000000\r\ncost = up_cnt\r\nfor i in s:\r\n if i.isupper():\r\n cur_up += 1\r\n else:\r\n cur_low += 1\r\n a = cur_low + up_cnt - cur_up\r\n if a < ans:\r\n ans = a\r\nprint(min(ans, up_cnt))", "\r\nstr = input()\r\nst = 0\r\ncond = []\r\nresults = [0] * len(str)\r\nminimum = len(str)\r\nfor idx, letter in enumerate(str):\r\n if letter.islower():\r\n if idx == 0:\r\n results[idx] = 1\r\n else:\r\n results[idx] = results[idx - 1] + 1\r\n else:\r\n results[idx] = results[idx - 1]\r\n\r\nminimum = results[-1]\r\nmedium = minimum\r\nfor idx, letter in enumerate(reversed(str)):\r\n if letter.islower():\r\n medium -= 1\r\n else:\r\n medium += 1\r\n minimum = min(minimum, medium)\r\nprint(minimum)\r\n", "new_str = input()\nnew_upper_count = sum(1 for c in new_str if c.isupper())\nnew_min_changes = new_changes = new_upper_count\n\nfor new_i in range(len(new_str)):\n if new_str[new_i].isupper():\n new_changes -= 1\n else:\n new_changes += 1\n if new_changes < new_min_changes:\n new_min_changes = new_changes\n\nprint(new_min_changes)\n\n\n\t \t\t \t\t \t \t \t\t \t \t\t", "word = input()\nn = len(word)\nmin_changes = 0\ncount = 0\n\nfor char in word:\n if char.islower():\n count += 1\n elif count > 0:\n count -= 1\n min_changes += 1 #cambios\n\nprint(min_changes)\n\n \t \t\t\t \t \t\t \t\t\t\t\t \t\t\t", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\ndef main():\r\n import bisect\r\n import math\r\n # import itertools\r\n # import heapq\r\n # from queue import PriorityQueue, LifoQueue, SimpleQueue\r\n\r\n # import sys.stdout.flush() use for interactive problems\r\n alpha = 'abcdefghijklmnopqrstuvwxyz'\r\n ALPHA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n inf = 1e17\r\n mod = 10 ** 9 + 7\r\n\r\n # Max = 10**6\r\n # primes = []\r\n # prime = [True for i in range(10**6+1)]\r\n # p = 2\r\n # while (p * p <= Max+1):\r\n #\r\n # # If prime[p] is not\r\n # # changed, then it is a prime\r\n # if (prime[p] == True):\r\n #\r\n # # Update all multiples of p\r\n # for i in range(p * p, Max+1, p):\r\n # prime[i] = False\r\n # p += 1\r\n #\r\n # for p in range(2, Max+1):\r\n # if prime[p]:\r\n # primes.append(p)\r\n\r\n def factorial(n):\r\n f = 1\r\n\r\n for i in range(1, n + 1):\r\n f = (f * i) % mod # Now f never can\r\n # exceed 10^9+7\r\n\r\n return f\r\n\r\n def ncr(n, r):\r\n # initialize numerator\r\n # and denominator\r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % mod\r\n den = (den * (i + 1)) % mod\r\n return (num * pow(den,\r\n mod - 2, mod)) % mod\r\n\r\n def solve(s):\r\n\r\n dp = [0]\r\n lower = 0\r\n for i in range(len(s)):\r\n if s[i].isupper():\r\n dp.append(min(lower,dp[-1]+1))\r\n else:\r\n lower += 1\r\n return dp[-1]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n pass\r\n\r\n t = 1#int(input())\r\n ans = []\r\n for _ in range(1):\r\n # n = int(input())\r\n # n,k = map(int, input().split())\r\n # arr = [int(x) for x in input().split()]\r\n # queries = [int(x) for x in input().split()]\r\n # arr = list(input())\r\n s = input()\r\n # t = input()\r\n # customers = []\r\n # for i in range(n):\r\n # customers.append([int(x) for x in input().split()])\r\n # k = int(input())\r\n # s = [int(x) for x in input().split()]\r\n # qs = []\r\n # for j in range(q):\r\n # r,c = map(int,input().split())\r\n # qs.append((r,c))\r\n\r\n ans.append(solve(s))\r\n\r\n for j in range(len(ans)):\r\n #print('Case #' + str(j + 1) + \": \" + str(ans[j]))\r\n print(ans[j])\r\n\r\n pass\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\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "mensagem = input()\r\ncontagem = [0]\r\ndp = [0]\r\nfor x in range(len(mensagem)):\r\n if mensagem[x].islower():\r\n dp.append(dp[-1])\r\n else:\r\n dp.append(min(dp[-1] + 1, contagem[-1]))\r\n contagem.append(mensagem[x].islower() + contagem[-1])\r\n \r\nprint(dp[-1])", "n = input()\r\n\r\nx,y = 0,0\r\n\r\nfor i in n:\r\n if i.islower():\r\n x+=1\r\n elif x>0:\r\n y+=1\r\n x-=1\r\nprint(y)", "s = input()\na = 0\nb = 0\nfor c in s:\n\tif (c >= 'a' and c <= 'z'):\n\t\ta = min(a, b)\n\t\tb = b + 1\n\telse:\n\t\ta = min(a, b) + 1\nprint (\"%d\" % min(a, b))\n \t\t\t \t\t \t \t \t \t \t \t\t \t\t", "def solve(s, n):\r\n # DP[i] := Costo mínimo de cambiar todas las letras\r\n # de s[1..i] a mayúsculas.\r\n\r\n dp = [0] * (n + 1)\r\n dp[1] = 0 if s[0].isupper() else 1\r\n for i in range(2, n + 1):\r\n c = s[i - 1]\r\n if c.isupper():\r\n dp[i] = dp[i - 1]\r\n else:\r\n dp[i] = 1 + dp[i - 1]\r\n\r\n # Suffix array.\r\n # sf[i] := Número de mayúsculas en A[i..n]\r\n sf = [0] * (n + 1)\r\n sf[n] = 1 if s[n - 1].isupper() else 0\r\n for i in range(n - 1, 0, -1):\r\n if s[i - 1].isupper():\r\n sf[i] = sf[i + 1] + 1\r\n else:\r\n sf[i] = sf[i + 1]\r\n \r\n m = sf[1]\r\n for i in range(1, n + 1):\r\n if i + 1 <= n:\r\n x = dp[i] + sf[i + 1]\r\n else:\r\n x = dp[i]\r\n m = min(m, x)\r\n return m\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n print(solve(s, n))\r\n\r\nmain()", "message = list(input())\r\nn = len(message)\r\nchange_arr = [0] * (n+1)\r\n\r\n# find cost\r\ncost = 0\r\nfor letter in message:\r\n if letter.isupper():\r\n cost += 1\r\nchange_arr[0] = cost\r\nfor i in range(1, n+1):\r\n if message[i - 1].isupper():\r\n change_arr[i] = change_arr[i - 1] - 1\r\n else:\r\n change_arr[i] = change_arr[i - 1] + 1\r\n\r\nprint(min(change_arr))", "s=input()\r\nx,y=0,0\r\nfor i in s:\r\n if i.islower():\r\n x+=1\r\n elif x>0:\r\n y+=1\r\n x-=1\r\nprint(y)", "import sys\r\nfrom collections import deque\r\n# from collections import Counter\r\n# from math import sqrt\r\n# from math import log\r\n# from math import ceil\r\n# from bisect import bisect_left, bisect_right\r\n\r\n# alpha=['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\n# mod=10**9+7\r\n# mod=998244353\r\n\r\n# def BinarySearch(a,x): \r\n# \ti=bisect_left(a,x) \r\n# \tif(i!=len(a) and a[i]==x): \r\n# \t\treturn i \r\n# \telse: \r\n# \t\treturn -1\r\n\r\n# def sieve(n): \r\n# \tprime=[True for i in range(n+1)]\r\n# \tp=2\r\n# \twhile(p*p<=n): \r\n# \t\tif (prime[p]==True): \r\n# \t\t\tfor i in range(p*p,n+1,p): \r\n# \t\t\t\tprime[i]=False\r\n# \t\tp+=1\r\n# \tprime[0]=False\r\n# \tprime[1]=False\r\n# \ts=set()\r\n# \tfor i in range(len(prime)):\r\n# \t\tif(prime[i]):\r\n# \t\ts.add(i)\r\n# \treturn s\r\n\r\n# def gcd(a, b):\r\n# \tif(a==0):\r\n# \t\treturn b \r\n# \treturn gcd(b%a,a)\r\n\r\nfast_reader=sys.stdin.readline\r\nfast_writer=sys.stdout.write\r\n\r\ndef input():\r\n\treturn fast_reader().strip()\r\n\r\ndef print(*argv):\r\n\tfast_writer(' '.join((str(i)) for i in argv))\r\n\tfast_writer('\\n')\r\n\r\n#____________________________________________________________________________________________________________________________________\r\n\r\nfor _ in range(1):\r\n\ts=input()\r\n\tn=len(s)\r\n\tl=[]\r\n\tfor i in range(n):\r\n\t\tif(ord(s[i])<=90):\r\n\t\t\tl.append(0)\r\n\t\telse:\r\n\t\t\tl.append(1)\r\n\tif(l.count(0)==n or l.count(1)==n):\r\n\t\tprint(0)\r\n\t\tbreak\r\n\tfirst_one=-1\r\n\tlast_zero=-1\r\n\tfor i in range(len(l)):\r\n\t\tif(first_one==-1 and l[i]==1):\r\n\t\t\tfirst_one=i\r\n\t\tif(l[i]==0):\r\n\t\t\tlast_zero=i\r\n\tif(first_one>last_zero):\r\n\t\tprint(0)\r\n\t\tbreak\r\n\telse:\r\n\t\tans=min(l.count(0),l.count(1))\r\n\t\too=0\r\n\t\tans3=0\r\n\t\tfor i in range(len(l)):\r\n\t\t\tif(l[i]==1):\r\n\t\t\t\too+=1\r\n\t\t\telse:\r\n\t\t\t\tif(oo>0):\r\n\t\t\t\t\too-=1\r\n\t\t\t\t\tans3+=1\r\n\t\tans=min(ans,ans3)\r\n\t\tprint(ans)", "from sys import stdin, stdout\r\n\r\ns = stdin.readline().strip()\r\nlow, up = [0 for i in range(len(s))], [0 for i in range(len(s))]\r\n\r\nif 'z' >= s[0] >= 'a':\r\n low[0] += 1\r\nelse:\r\n up[0] += 1\r\n \r\nfor i in range(1, len(s)):\r\n low[i], up[i] = low[i - 1], up[i - 1]\r\n \r\n if 'z' >= s[i] >= 'a':\r\n low[i] += 1\r\n else:\r\n up[i] += 1\r\n\r\nans = min(low[-1], up[-1])\r\n\r\nfor i in range(len(s)):\r\n ans = min(ans, low[i] + (up[-1] - up[i]))\r\n\r\nstdout.write(str(ans))", "import sys\n\n\nl = sys.stdin.readlines()\ntext = l[0].replace('\\n','')\nfor i in range(len(text)):\n if text[i].islower():\n break\nfor j in range(len(text)-1, i-1, -1):\n if text[j].isupper():\n break\n\n\n\nupper = len([t for t in text[i:j+1] if t.isupper()])\nlower = len([t for t in text[i:j+1] if t.islower()])\n\n\n\n\nminimo = min(lower,upper)\n\ntexto = text[i:j+1]\nupper = []\nlower = []\nu = 0\nl = 0\n\nfor k in texto:\n if k.isupper():\n u+=1\n else:\n l+=1\n upper.append(u) \n lower.append(l)\nk = 1\n\nwhile k < len(texto):\n \n uf = upper[-1] - upper[-(k+1)]\n li = lower[-(k+1)]\n\n t = uf + li\n minimo = min(t,minimo)\n\n k+=1\n\nprint(minimo)\n\n\n\t \t \t\t \t \t\t\t \t\t \t \t", "\r\ns=input()\r\nl=len(s)\r\n\r\nzz=float('inf')\r\ndp1={}\r\ndp2={}\r\nc=0\r\nfor i in s:\r\n if (ord(i)<95):\r\n c+=1\r\ntc=c\r\nts=l-c\r\ndp1[0]=0\r\ndp2[0]=c\r\nan=c\r\nfor i in range(l):\r\n if(ord(s[i])>95):\r\n dp1[i+1]=dp1[i]+1\r\n dp2[i+1]=dp2[i]\r\n else:\r\n dp2[i+1]=dp2[i]-1\r\n dp1[i+1]=dp1[i]\r\n z=dp1[i+1]+dp2[i+1]\r\n if(zz>z):\r\n zz=z\r\nprint(min(an,zz))\r\n\r\n", "s = input()\r\n\r\ndp = [0] * (len(s)+1)\r\ndp[0] = sum(1 for c in s if c.isupper())\r\nfor i in range(len(s)):\r\n if(s[i].isupper()):\r\n dp[i+1] = dp[i] - 1\r\n else:\r\n dp[i+1] = dp[i] + 1\r\n\r\nprint(min(dp))\r\n\r\n \r\n\r\n", "s = input()\r\nleft = 0 \r\nright = 0\r\nfor i in s:\r\n if 'A' <= i <= 'Z':\r\n right += 1\r\n\r\nans = right\r\nfor i in s:\r\n if 'a' <= i <= 'z':\r\n left +=1\r\n elif 'A' <= i <= \"Z\":\r\n right -=1\r\n ans = min(ans, left+right)\r\nprint(ans)", "import os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\ns = input().strip()\r\nup = [0]*(len(s)+1)\r\nlow = [0]*(len(s)+1)\r\nfor i,v in enumerate(s,1):\r\n if \"a\"<=v<=\"z\":\r\n low[i]+=1\r\n else:\r\n up[i]+=1\r\nres = float(\"inf\")\r\nn = len(s)\r\nfor i in range(1,n+1):\r\n up[i]+=up[i-1]\r\n low[i]+=low[i-1]\r\nfor i in range(n+1):\r\n res = min(res,low[i]+up[n]-up[i])\r\nprint(res)\r\n", "msg = input()\n\nupper = 0\nlower = 0\n\nfor i in msg:\n if i == i.lower():\n lower += 1\n else:\n upper += 1\n\nans = min(upper, lower)\ncst = 0\nfor i in msg:\n if i == i.lower():\n cst += 1\n lower -= 1\n else:\n upper -= 1\n\n ans = min(ans, cst+upper)\n\nprint(ans)\n" ]

[ "import sys\r\nn,m=map(int,input().split())\r\nk=0\r\npos=0\r\nL=[]\r\nL1=[]\r\nd={i:[0,-1] for i in range(1,n+1)}\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n if a==1 :\r\n d[b][0]+=1\r\n \r\n k+=1\r\n L.append(b)\r\n elif a==2 :\r\n k-=d[b][0]\r\n d[b][0]=0\r\n d[b][1]=len(L)\r\n else :\r\n for j in range(pos,b) :\r\n \r\n if d[L[j]][0]>0 and d[L[j]][1]<j+1 :\r\n \r\n k-=1\r\n d[L[j]][0]-=1\r\n \r\n pos=max(pos,b)\r\n L1.append(k)\r\nsys.stdout.write('\\n'.join(map(str,L1)))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "from sqlite3 import collections\r\nn, q = map(int, input().split())\r\nQ = collections.deque()\r\nA = n*[0]\r\nB = A[: ]\r\nL = []\r\ns=n=0\r\nfor _ in range(q):\r\n y, x = map(int, input().split())\r\n if y<2 :\r\n x-=1\r\n Q.append(x)\r\n B[x]+=1\r\n A[x]+=1\r\n s+=1\r\n elif y<3 :\r\n x-=1\r\n s-=A[x]\r\n A[x]=0\r\n else :\r\n while x>n :\r\n n+=1\r\n y=Q.popleft()\r\n B[y]-=1\r\n if B[y]<A[y] :\r\n A[y]-=1\r\n s-=1\r\n L.append(str(s))\r\nprint('\\n'.join(L))", "n,q = map(int,input().split())\r\nxi = [[0]*(n+1) for i in range(2)]\r\nnoti = []\r\nans = \"\"\r\nnum = 0\r\nnum2 = 0\r\nnum3 = 0\r\nwhile q > 0:\r\n typ,xt = map(int,input().split())\r\n if typ == 1:\r\n xi[0][xt] += 1\r\n noti += [xt]\r\n num += 1\r\n num2 += 1\r\n elif typ == 3:\r\n for i in range(num3,xt):\r\n if i+1 > xi[1][noti[i]]:\r\n xi[0][noti[i]] -= 1\r\n num -= 1\r\n num3 = max(num3,xt)\r\n else:\r\n num -= xi[0][xt]\r\n xi[0][xt] = 0\r\n xi[1][xt] = num2\r\n ans += str(num)\r\n ans += \"\\n\"\r\n q -= 1\r\nprint(ans)", "from collections import defaultdict, deque\r\n\r\nq = deque()\r\nidx, total = 0, 0\r\nvis = defaultdict(deque)\r\nnot_valid = set()\r\nmax_x = -1\r\nans = []\r\n\r\nN, Q = map(int, input().split())\r\nfor _ in range(Q):\r\n t, x = map(int, input().split())\r\n\r\n if t == 1:\r\n q.append((idx, x))\r\n vis[x].append(idx)\r\n idx += 1\r\n total += 1\r\n\r\n elif t == 2:\r\n while vis[x]:\r\n # All element in vis[x] should be popped out from q, and It will do it later.\r\n # The index are collected in the not_valid set.\r\n i = vis[x].pop()\r\n not_valid.add(i)\r\n\r\n # If the element is expired, then skip it.\r\n if i <= max_x - 1:\r\n continue\r\n total -= 1\r\n\r\n else:\r\n # Check the element should be expired or popped out.\r\n while q and (q[0][0] <= x - 1 or q[0][0] in not_valid):\r\n j, y = q.popleft()\r\n if j not in not_valid:\r\n total -= 1\r\n vis[y].popleft()\r\n\r\n max_x = max(max_x, x)\r\n ans.append(str(total))\r\n\r\n# Trick: print the answer at the end to avoid TLE\r\n# by keep commnicating with kernel space.\r\nprint(\"\\n\".join(ans))\r\n", "import sys\n#sys.setrecursionlimit(20000)\n#from collections import deque #Counter\n#from itertools import accumulate, product\n#from functools import reduce\n#import math\n\n\ndef rall():\n return [x.strip() for x in sys.stdin.readlines()]\ndef rl():\n return sys.stdin.readline().strip()\ndef rl_types(types):\n str_list = [x for x in sys.stdin.readline().strip().split(' ')]\n return [types[i](str_list[i]) for i in range(len(str_list))]\n\ndef pr( something='' ):\n sys.stdout.write( str(something) + '\\n')\ndef pra( array ):\n sys.stdout.write( ' '.join([str(x) for x in array]) + '\\n')\n\n\n\ndef findMostSigBit(v):\n for s in [1,2,4,8,16,32]:\n v |= (v>>s)\n return (v+1)>>1\n\n\nclass SegTree:\n\n def __init__(self, value_list):\n\n # now initialize the segment tree\n vlen = len(value_list)\n n = findMostSigBit(vlen)<<1;\n self._tree = [0]*(4*n)\n\n for i in range(vlen): # copy original elements\n self._tree[n+i] = value_list[i]\n for i in range(vlen,n): # pad with zeros\n self._tree[n+i] = 0\n\n for i in range(n-1,0,-1): # fill the non-leaf nodes from bottom to top, right to left\n self._tree[i] = self._tree[i*2]+self._tree[2*i+1]\n\n self._size = n\n\n\n def pointIncrement(self, loc, delta):\n loc += self._size\n while loc>0:\n self._tree[loc] += delta\n loc >>= 1 # divide by two to get parent\n\n def pointSet(self, loc, value):\n delta = value - self._tree[loc+self._size]\n self.pointIncrement(loc,delta)\n\n def rangeQuery(self, qleft, qright):\n return self._rq(1,0,self._size-1,qleft,qright)\n\n def _rq(self, loc, nl, nr, qleft, qright):\n if qright<nl or nr<qleft: # no overlap of node and query range\n return 0\n elif (qleft<=nl and nr <= qright): # node fully inside query range\n return self._tree[loc]\n elif (nl<nr): # otherwise partial overlap (unless l==r)\n mid = (nl+nr)//2\n return self._rq(loc*2, nl, mid,qleft,qright) + \\\n self._rq(loc*2+1,mid+1,nr, qleft,qright)\n return 0\n\n def __repr__(self):\n #s = [str(x[2]) for x in self.seg_tree if x]\n s = [str(x) for x in self._tree[self._size:(2*self._size)]]\n return 'SegTree[' + ' '.join(s) + ']'\n\n\n\nif __name__ == '__main__':\n\n #NT = int( rl() )\n N,Q = map(int,rl().split(' '))\n\n status = SegTree([0]*(Q+1))\n\n #apps = {i:[] for i in range(N)}\n apps = {}\n tot_msg = 0\n nread = 0\n for _ in range(Q):\n t,x = map(int, rl().split(' '))\n if t==1:\n if not x in apps:\n apps[x] = []\n tot_msg += 1\n apps[x].append(tot_msg)\n status.pointSet(tot_msg,1)\n elif t==2:\n if x in apps:\n for y in apps[x]:\n status.pointSet(y,0)\n del apps[x]\n else: #t==3:\n nread = max(nread,x)\n unread = status.rangeQuery(nread+1,tot_msg)\n pr(unread)\n #pr(status)\n\n", "from sys import stdout\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nprint = stdout.write\r\n\r\nn, q = map(int, input().split())\r\nd = [[] for i in range(n+1)]\r\nmark = []\r\nans = 0\r\ninde = 0\r\nt = 0\r\nfor i in range(q):\r\n\tevent, x = map(int, input().split())\r\n\tif event == 1:\r\n\t\tans += 1\r\n\t\td[x].append(inde)\r\n\t\tinde += 1\r\n\t\tmark.append(False)\r\n\telif event == 2:\r\n\t\tfor j in d[x]:\r\n\t\t\tif not mark[j]:\r\n\t\t\t\tmark[j] = True\r\n\t\t\t\tans -= 1\r\n\t\td[x] = []\r\n\telse:\r\n\t\tfor j in range(t, x):\r\n\t\t\tif not mark[j]:\r\n\t\t\t\tmark[j] = True\r\n\t\t\t\tans -= 1\r\n\t\tif x > t: t = x\r\n\tprint(str(ans) + '\\n')", "from collections import Counter,deque\r\nfrom sys import stdin,stdout\r\ninput=stdin.buffer.readline\r\nn,q=map(int,input().split())\r\napp={i: [] for i in range(1,n+1)}\r\nb=[]\r\nc=0\r\nst=0\r\nfor i in range(q):\r\n t,x=map(int,input().split())\r\n if(t==1):\r\n app[x].append(len(b))\r\n b.append(False)\r\n elif(t==2):\r\n for j in app[x]:\r\n if(not b[j]):\r\n c+=1\r\n b[j]=True\r\n app[x].clear()\r\n else:\r\n for j in range(st,x):\r\n if(not b[j]):\r\n b[j]=True\r\n c+=1\r\n st=max(st,x)\r\n stdout.write(str(len(b)-c)+\"\\n\")\r\n", "from collections import deque as dq\r\na,b=map(int,input().split())\r\narr=dq()\r\np=[0]*a\r\nq=list(p)\r\ntot=0\r\nno=0\r\nl=dq()\r\nfor i in range(0,b):\r\n x,y=map(int,input().split())\r\n if x==1:\r\n arr.append(y-1)\r\n p[y-1]=p[y-1]+1\r\n q[y-1]=q[y-1]+1\r\n tot=tot+1\r\n l.append(tot)\r\n elif x==2:\r\n tot=tot-p[y-1]\r\n p[y-1]=0\r\n l.append(tot)\r\n else:\r\n while y>no:\r\n w=arr[0]\r\n arr.popleft()\r\n q[w]=q[w]-1\r\n if p[w]>q[w]:\r\n p[w]=p[w]-1\r\n tot =tot-1\r\n no=no+1\r\n l.append(tot)\r\nfor i in l:\r\n print(i)", "n,q = map(int, input().split())\r\na = [[0]*(n+1) for i in range (2)]\r\nb = []\r\nn1 = 0\r\nn2 = 0\r\nn3 = 0\r\nk = \"\"\r\nfor i in range (q):\r\n\top, x = map(int, input().split())\r\n\tif (op == 1):\r\n\t\ta[0][x]+=1\r\n\t\tb+=[x]\r\n\t\tn1+=1\r\n\t\tn2+=1\r\n\telif (op == 3):\r\n\t\tfor i in range (n3,x):\r\n\t\t\tif i+1 > a[1][b[i]]:\r\n\t\t\t\ta[0][b[i]]-=1\r\n\t\t\t\tn1-=1\r\n\t\t\tn3 = max(n3,x)\r\n\telse:\r\n\t\tn1-=a[0][x]\r\n\t\ta[0][x]=0\r\n\t\ta[1][x]=n2\r\n\tk+=str(n1)+'\\n'\r\nprint (k)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, q = map(int, input().split())\r\nl = [[] for _ in range(n)]\r\nis_read = []\r\nis_read_idx = 0\r\nans = 0\r\nprev_t = 0\r\n\r\nfor _ in range(q):\r\n ty, v = map(int, input().split())\r\n \r\n if ty==1:\r\n l[v-1].append(is_read_idx)\r\n is_read_idx += 1\r\n is_read.append(False)\r\n ans += 1\r\n elif ty==2:\r\n for idx in l[v-1]:\r\n if not is_read[idx]:\r\n is_read[idx] = True\r\n ans -= 1\r\n \r\n l[v-1] = []\r\n else:\r\n if v>prev_t:\r\n for idx in range(prev_t, v):\r\n if not is_read[idx]:\r\n is_read[idx] = True\r\n ans -= 1\r\n \r\n prev_t = v\r\n \r\n print(ans)", "import collections\nn, q = map(int ,input().split())\nQ = collections.deque()\nA = [0] * n\nB = A[:]\nL = []\ns = n = 0\nfor k in range(q):\n type1, x = map(int, input().split())\n if type1 == 1:\n x -= 1\n Q.append(x)\n B[x] += 1\n A[x] += 1\n s += 1\n if type1 == 2:\n x -= 1\n s -= A[x]\n A[x] = 0\n if type1 == 3:\n while x > n:\n n += 1\n y = Q.popleft()\n B[y] -= 1\n if B[y] < A[y]:\n A[y] -= 1\n s -= 1\n L.append(str(s))\nprint('\\n'.join(L))\n", "import collections\r\nimport copy\r\n\r\nn, q = map(int, input().split())\r\nQ = collections.deque()\r\nA = n * [0]\r\nB = copy.copy(A)\r\nL = []\r\ns = n = 0\r\nfor _ in range(q):\r\n y, x = map(int, input().split())\r\n if 2 > y:\r\n x -= 1\r\n Q.append(x)\r\n B[x] += 1\r\n A[x] += 1\r\n s += 1\r\n elif 3 > y:\r\n x -= 1\r\n s -= A[x]\r\n A[x] = 0\r\n else:\r\n while x > n:\r\n n += 1\r\n y = Q.popleft()\r\n B[y] -= 1\r\n if B[y] < A[y]:\r\n A[y] -= 1\r\n s -= 1\r\n L.append(str(s))\r\nprint('\\n'.join(L))\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n \r\nn, q, = map(int, input().split())\r\narr = [tuple(map(int, input().split())) for _ in range(q)]\r\nadj = [[] for _ in range(n+1)]\r\ncurr, cnt, res, vis = 0, 0, [], []\r\n \r\nfor t, v in arr:\r\n if t == 1:\r\n adj[v].append(len(vis))\r\n vis.append(0)\r\n cnt += 1\r\n elif t == 2:\r\n for u in adj[v]:\r\n if not vis[u]:\r\n vis[u] = 1\r\n cnt -= 1\r\n adj[v] = []\r\n else:\r\n while v > curr:\r\n if not vis[curr]:\r\n vis[curr] = 1\r\n cnt -= 1\r\n curr += 1\r\n print(cnt)", "n,q = map(int, input().split())\r\nl = []\r\na = [[] for _ in range(n)]\r\ntp = 0\r\nans = 0\r\nanss = []\r\nfor i in range(q):\r\n x,b = map(int, input().split())\r\n if x == 1:\r\n l.append(1)\r\n a[b-1].append(len(l) -1)\r\n ans +=1\r\n elif x == 2:\r\n while len(a[b-1]) > 0:\r\n z = a[b-1].pop()\r\n ans -= l[z]\r\n l[z] = 0\r\n else:\r\n while tp < b:\r\n ans -=l[tp]\r\n l[tp] = 0\r\n tp += 1\r\n anss.append(str(ans))\r\nprint('\\n'.join(anss))", "import sys\r\ninput = sys.stdin.readline \r\nimport collections\r\n\r\nn, q = map(int, input().split())\r\nQ = collections.deque()\r\nA = n * [0]\r\nB = A[:]\r\nL = []\r\ns = n = 0 \r\nfor _ in range(q):\r\n\ty, x = map(int,input().split())\r\n\tif(y == 1):\r\n\t\tx -= 1\r\n\t\tQ.append(x)\r\n\t\tB[x] += 1\r\n\t\tA[x] += 1\r\n\t\ts += 1\r\n\telif(y == 2):\r\n\t\tx -= 1\r\n\t\ts -= A[x]\r\n\t\tA[x] = 0\r\n\telse:\r\n\t\twhile(n < x):\r\n\t\t\tn += 1\r\n\t\t\ty = Q.popleft()\r\n\t\t\tB[y] -= 1\r\n\t\t\tif(B[y] < A[y]):\r\n\t\t\t\tA[y] -= 1\r\n\t\t\t\ts -= 1\r\n\tprint(s)", "from collections import deque\r\nimport sys\r\nn,q = list(map(int,sys.stdin.readline().lstrip().rstrip().split()))\r\nans = 0\r\nQ = deque()\r\nv1 = [0 for i in range(n)]\r\nv2 = v1[::]\r\nnum = 0\r\ntemp = []\r\nfor i in range(q):\r\n a,x = list(map(int,sys.stdin.readline().lstrip().rstrip().split()))\r\n if a==1:\r\n x-=1\r\n ans+=1\r\n Q.append(x)\r\n v1[x]+=1\r\n v2[x]+=1\r\n elif a==2:\r\n x-=1\r\n ans-=v1[x]\r\n v1[x] = 0\r\n else:\r\n while x>num:\r\n num+=1\r\n y = Q.popleft()\r\n v2[y]-=1\r\n if v1[y]>v2[y]:\r\n v1[y]-=1\r\n ans-=1\r\n # print(Q)\r\n temp.append(str(ans))\r\nsys.stdout.write('\\n'.join(temp))", "#!/usr/bin/env\tpython\r\n#-*-coding:utf-8 -*-\r\nimport sys,collections\r\nn,q=map(int,input().split())\r\nM=collections.defaultdict(collections.deque)\r\nQ=collections.deque()\r\nL=[]\r\ns=n=m=0\r\nfor _ in range(q):\r\n\ty,x=map(int,input().split())\r\n\tif 2>y:\r\n\t\ts+=1\r\n\t\tQ.append(x)\r\n\t\tM[x].append(n)\r\n\t\tn+=1\r\n\telif 3>y:\r\n\t\ty=M.get(x)\r\n\t\tif y:\r\n\t\t\ts-=len(y)\r\n\t\t\tdel M[x]\r\n\telse:\r\n\t\twhile x>m:\r\n\t\t\tz=Q.popleft()\r\n\t\t\ty=M.get(z)\r\n\t\t\tif y and y[0]<x:\r\n\t\t\t\ts-=1\r\n\t\t\t\ty.popleft()\r\n\t\t\t\tif not y:del M[z]\r\n\t\t\tm+=1\r\n\tL.append(s)\r\nsys.stdout.write('\\n'.join(map(str,L)))", "from sys import stdin\r\ninput=stdin.readline\r\nfrom collections import deque,defaultdict\r\n\r\nn,q=map(int,input().split())\r\ns=0\r\nn=0\r\ndc=0\r\nm=defaultdict(deque)\r\ndq=deque()\r\nfor _ in range(q):\r\n\ty,x=map(int,input().split())\r\n\tif y==1:\r\n\t\ts+=1\r\n\t\tdq.append(x)\r\n\t\tm[x].append(n)\r\n\t\tn+=1\r\n\telif y==2:\r\n\t\ty=m[x]\r\n\t\tif y:\r\n\t\t\ts-=len(y)\r\n\t\t\tdel m[x]\r\n\telse:\r\n\t\twhile x>dc:\r\n\t\t\tz=dq.popleft()\r\n\t\t\ty=m[z]\r\n\t\t\tif y and y[0]<x:\r\n\t\t\t\ts-=1\r\n\t\t\t\ty.popleft()\r\n\t\t\t\tif not y:del m[z]\r\n\t\t\tdc+=1\r\n\tprint(s)\t", "import sys\r\n\r\nline = sys.stdin.readline().split()\r\nnum_applications, num_events = int(line[0]), int(line[1])\r\nst = set()\r\nb = [[] for i in range(num_applications + 1)]\r\nlast = 0\r\na = []\r\n\r\nfor t in range(num_events):\r\n line = sys.stdin.readline().split()\r\n type, value = int(line[0]), int(line[1])\r\n if type == 1:\r\n a.append(t)\r\n b[value].append(t)\r\n st.add(t)\r\n elif type == 2:\r\n for notif in b[value]:\r\n if notif in st:\r\n st.remove(notif)\r\n b[value].clear()\r\n elif type == 3:\r\n while last < value:\r\n if a[last] in st:\r\n st.remove(a[last])\r\n last += 1\r\n print(len(st))", "def main():\n n, q = map(int, input().split())\n vol, tot, l, res = [0] * (n + 1), [0] * (n + 1), [], []\n z = m = 0\n for _ in range(q):\n t, x = map(int, input().split())\n if t == 1:\n l.append(x)\n tot[x] += 1\n vol[x] += 1\n z += 1\n elif t == 2:\n z -= vol[x]\n vol[x] = 0\n else:\n if m < x:\n r, m = range(m, x), x\n for i in r:\n x = l[i]\n tot[x] -= 1\n if vol[x] > tot[x]:\n vol[x] -= 1\n z -= 1\n res.append(z)\n print('\\n'.join(map(str, res)))\n\n\nif __name__ == '__main__':\n main()\n", "import collections\nn,q=map(int,input().split())\nQ=collections.deque()\nA=n*[0]\nB=A[:]\nL=[]\ns=n=0\nfor _ in range(q):\n\ty,x=map(int,input().split())\n\tif 2>y:\n\t\tx-=1\n\t\tQ.append(x)\n\t\tB[x]+=1\n\t\tA[x]+=1\n\t\ts+=1\n\telif 3>y:\n\t\tx-=1\n\t\ts-=A[x]\n\t\tA[x]=0\n\telse:\n\t\twhile x>n:\n\t\t\tn+=1\n\t\t\ty=Q.popleft()\n\t\t\tB[y]-=1\n\t\t\tif(B[y]<A[y]):\n\t\t\t\tA[y]-=1\n\t\t\t\ts-=1\n\tL.append(str(s))\nprint('\\n'.join(L))\n\t\t \t \t\t\t \t \t \t\t\t\t \t\t \t\t\t" ]

[ "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\ndef hgt(x):\r\n if x == 0: return -1\r\n h = 0\r\n while x&1 != 1:\r\n h += 1\r\n x = x>>1\r\n return h\r\n\r\ndef up(x):\r\n h = hgt(x)\r\n g = x + (1<<h)\r\n if g > 0 and g < N and hgt(g) == h+1:\r\n return g\r\n g = x - (1<<h)\r\n if g > 0 and g < N and hgt(g) == h+1:\r\n return g\r\n return x\r\n\r\ndef left(x):\r\n h = hgt(x)\r\n if h == 0:\r\n return x\r\n g = x - (1<<(h-1))\r\n if g > 0:\r\n return g\r\n return x\r\n\r\ndef right(x):\r\n h = hgt(x)\r\n if h == 0:\r\n return x\r\n g = x + (1<<(h-1))\r\n if g < N:\r\n return g\r\n return x\r\n\r\nN, q = map(int, input().split())\r\nN += 1\r\nfor _ in range(q):\r\n p = int(input())\r\n for c in input():\r\n if c == 'U':\r\n p = up(p)\r\n elif c == 'R':\r\n p = right(p)\r\n else:\r\n p = left(p)\r\n print(p)", "# import sys\r\n# input = sys.stdin.readline\r\n\r\nn, q = map(int, input().split())\r\nfor _ in range(q):\r\n u = int(input())\r\n s = input()\r\n for comm in s:\r\n k = 1\r\n while True:\r\n if k & u:\r\n break\r\n k <<= 1\r\n if comm == 'L':\r\n if k != 1:\r\n u -= k\r\n u += (k>>1)\r\n elif comm == 'R':\r\n if k != 1:\r\n u += (k>>1)\r\n elif comm == 'U':\r\n nu = u - k\r\n nu |= (k<<1)\r\n if nu <= n:\r\n u = nu\r\n print(u)", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nimport sys\r\nfrom heapq import heappush,heappop,heapify\r\nfrom functools import cmp_to_key as ctk\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().rstrip()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\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\n\r\ndef bo(i):\r\n return ord(i)-ord('a')\r\n\r\nfile=1\r\n\r\n\r\ndef solve():\r\n\r\n # for t in range(ii()):\r\n\r\n n,q=mi()\r\n\r\n x=int(log(n+1,2))\r\n root=1<<(x-1)\r\n for i in range(q):\r\n u=ii()\r\n s=si()\r\n pos='U'\r\n if(u<root):\r\n pos='L'\r\n if(u>root):\r\n pos='R'\r\n\r\n s1=bin(u)[2:]\r\n s1='0'*(x-len(s1))+s1\r\n s1=list(s1)\r\n for j in s:\r\n for k in range(x-1,-1,-1):\r\n if s1[k]=='1':\r\n f=k\r\n break\r\n if j=='L':\r\n if(f==x-1):\r\n continue\r\n s1[f]='0'\r\n s1[f+1]='1'\r\n elif(j=='R'):\r\n if(f==x-1):\r\n continue\r\n s1[f+1]='1'\r\n else:\r\n if f==0:\r\n continue\r\n if s1[f-1]=='1':\r\n s1[f]='0'\r\n else:\r\n s1[f-1]='1'\r\n s1[f]='0'\r\n # print(s1)\r\n s1=\"\".join(s1)\r\n print(int(s1,2))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\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\r\n if(file):\r\n\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 else:\r\n input=sys.stdin.readline\r\n solve()", "def maxx(n):\r\n\treturn n&-n\r\nn,q=map(int,input().split())\r\nroot=n//2+1\r\nwhile q>0:\r\n\tx=int(input())\r\n\ts=input()\r\n\r\n\tfor i in s:\r\n\t\tif i=='U' and x!=root:\r\n\t\t\tp=x+maxx(x)\r\n\t\t\tif x==p-maxx(p)//2:\r\n\t\t\t\tx=p\r\n\t\t\telse:\r\n\t\t\t\tx=x-maxx(x)\r\n\t\telif i=='L':\r\n\t\t\tx=x-maxx(x)//2\r\n\t\telif i=='R':\r\n\t\t\tx=x+maxx(x)//2\r\n\tq=q-1\r\n\tprint(x)", "from math import log\r\nn, q = [int(i) for i in input().split()]\r\nmaxlvl = int(log(n + 1, 2)) + 1\r\npows = [2 ** i for i in range(maxlvl)]\r\ndone = dict()\r\n\r\ndef calc_lvl(m):\r\n for lvl in range(1, maxlvl):\r\n if (m - pows[lvl-1]) % pows[lvl] == 0:\r\n return (lvl, ((m - pows[lvl-1]) % (2 * pows[lvl]) == 0))\r\n\r\nfor i in range(q):\r\n start = int(input())\r\n query = input()\r\n lvl, ind = calc_lvl(start)\r\n \r\n for c in query:\r\n if c == 'U': \r\n if start == pows[-2]:\r\n continue\r\n start += (1 if ind else -1) * pows[lvl - 1]\r\n if start not in done.keys():\r\n lvl, ind = calc_lvl(start)\r\n done[start] = (lvl, ind)\r\n else:\r\n (lvl, ind) = done[start]\r\n else:\r\n if start % 2 != 0:\r\n continue\r\n start += (1 if c == 'R' else -1) * pows[lvl - 2]\r\n lvl, ind = lvl - 1, int((c == 'L'))\r\n \r\n print(start)\r\n \r\n \r\n \r\n\r\n \r\n", "def greatest_pow2_divisor(x):\n pow2 = 1\n while x % pow2 == 0:\n pow2 *= 2\n return pow2 // 2\n\ndef parent(x):\n pow2 = greatest_pow2_divisor(x)\n if ((x + pow2) // (pow2 * 2)) % 2 == 1:\n \treturn x + pow2\n return x - pow2\n\ndef left(x):\n if x % 2 == 1:\n \treturn x\n return x - greatest_pow2_divisor(x) // 2\n\ndef right(x):\n if (x % 2 == 1):\n \treturn x;\n return x + greatest_pow2_divisor(x) // 2;\n\nnumbers = list(map(int, input().split()))\nn = numbers[0]\nq = numbers[1]\nroot = (n + 1) / 2\nfor i in range(q):\n\tu = int(input())\n\ts = input()\n\tfor c in s:\n\t\tif c == 'U':\n\t\t\tif u != root:\n\t\t\t\tu = parent(u)\n\t\tif (c == 'L'):\n\t\t\tu = left(u)\n\t\tif (c == 'R'):\n\t\t\tu = right(u)\n\tprint(u)\n", "n, m = map(int, input().split())\r\nfor i in range(m):\r\n k = int(input())\r\n d = k & -k\r\n for q in input():\r\n if q == 'U' and k != n + 1 >> 1:\r\n k += d if (k + d) % (d << 2) else -d\r\n d <<= 1\r\n if q in 'LR' and d > 1:\r\n d >>= 1\r\n k += d if q == 'R' else -d\r\n print(k)", "'''\r\nhttps://codeforces.com/contest/792/problem/D\r\nEducational 18 - D. Paths in a Complete Binary Tree (1900)\r\n'''\r\n\r\ndef solve(r, u, s):\r\n l, n = 1, 1 + r >> 1\r\n # step 1: target to u\r\n a = [(l, n, r)]\r\n while n != u:\r\n if u < n:\r\n r = n - 1\r\n else:\r\n l = n + 1\r\n n = l + r >> 1\r\n a.append((l, n, r))\r\n # step 2: go throught path s\r\n for c in s:\r\n if c == 'L':\r\n if l < n:\r\n r = n - 1\r\n n = l + r >> 1\r\n a.append((l, n, r))\r\n elif c == 'R':\r\n if r > n:\r\n l = n + 1\r\n n = l + r >> 1\r\n a.append((l, n, r))\r\n else: # c == 'U'\r\n if len(a) > 1:\r\n a.pop()\r\n l, n, r = a[-1]\r\n return n\r\n\r\nn, q = map(int, input().split())\r\nfor _ in range(q):\r\n u = int(input())\r\n s = input()\r\n print(solve(n, u, s))", "from math import log\r\nn, q = [int(i) for i in input().split()]\r\nmaxlvl = int(log(n + 1, 2)) + 1\r\nsteps = [2 ** i for i in range(maxlvl)]\r\n\r\ndef calc_lvl(m):\r\n for lvl in range(1, maxlvl):\r\n if (m - steps[lvl-1]) % steps[lvl] == 0:\r\n return (lvl, ((m - steps[lvl-1]) % (2 * steps[lvl]) == 0))\r\n\r\n#print(calc_lvl(1))\r\n#print(calc_lvl(3))\r\n#print(calc_lvl(5))\r\n#print(calc_lvl(7))\r\n#print(calc_lvl(9))\r\n#print(calc_lvl(11))\r\n#print(calc_lvl(13))\r\n#print(calc_lvl(15))\r\n\r\n\r\n \r\nfor i in range(q):\r\n strt = int(input())\r\n qwery = input()\r\n lvl, ind = calc_lvl(strt)\r\n \r\n for c in qwery:\r\n if c == 'U': \r\n if strt == steps[-2]:\r\n continue\r\n if not ind:\r\n strt -= steps[lvl - 1]\r\n lvl, ind = calc_lvl(strt)\r\n else:\r\n strt += steps[lvl - 1]\r\n lvl, ind = calc_lvl(strt)\r\n \r\n elif c == 'L':\r\n if strt % 2 != 0:\r\n continue\r\n strt -= steps[lvl - 2]\r\n lvl, ind = lvl - 1, 1\r\n \r\n else:\r\n if strt % 2 != 0:\r\n continue\r\n strt += steps[lvl - 2]\r\n lvl, ind = lvl - 1, 0\r\n \r\n print(strt)\r\n \r\n \r\n \r\n\r\n \r\n", "n, q = [int(i) for i in input().split()]\r\n\r\ndef identify_row(x):\r\n\tfor i in range(1, 64):\r\n\t\tpower = 1 << i\r\n\t\tif x % power == power >> 1:\r\n\t\t\treturn i\r\n\r\ndef some(x):\r\n\tr = identify_row(x)\r\n\treturn x - (1 << (r - 1)) + 1\r\n\r\ndef left(x):\r\n\tr = identify_row(x)\r\n\tif r == 1: return x\r\n\treturn x - (1 << (r - 2))\r\n\r\ndef right(x):\r\n\tr = identify_row(x)\r\n\tif r == 1: return x\r\n\treturn x + (1 << (r - 2))\r\n\r\ndef parent(x):\r\n\tif x == (n + 1) >> 1:\r\n\t\treturn x\r\n\tr = identify_row(x)\r\n\treturn x + (1<<(r-1) if some(x) % (1 << (r + 1)) == 1 else -1<<(r-1))\r\n\r\nfor _ in range(q):\r\n\tt = int(input())\r\n\tc = input()\r\n\tfor i in c:\r\n\t\tif i == 'U': t = parent(t)\r\n\t\telif i == 'R': t = right(t)\r\n\t\telif i == 'L': t = left(t)\r\n\t\telse: print('error', i)\r\n\tprint(t)", "n, q = map(int, input().split())\ny = n + 1\ndeg = 0\nwhile y % 2 == 0:\n deg += 1\n y = y // 2\nfor i in range(q):\n start = int(input())\n level = 1\n y = start\n while y % 2 == 0:\n level += 1\n y = y // 2\n y = start\n path = input()\n for x in path:\n b = str(bin(y)[2:])\n if len(b) < deg:\n b = '0' * (deg - len(b)) + b\n one = len(b) - 1\n while b[one] == '0':\n one -= 1\n if x == 'U':\n if one > 0:\n b = b[:one - 1] + '10' + '0' * (len(b) - one - 1)\n y = int(b, 2)\n if x == 'R':\n if one < len(b) - 1:\n b = b[:one] + '11' + '0' * (len(b) - one - 2)\n y = int(b, 2)\n if x == 'L':\n if one < len(b) - 1:\n b = b[:one] + '01' + '0' * (len(b) - one - 2)\n y = int(b, 2)\n print(y)", "import sys\r\nimport bisect\r\nfrom bisect import bisect_left as lb\r\ninput_=lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nfrom math import log\r\nfrom math import gcd\r\nfrom math import atan2,acos\r\nfrom random import randint\r\nsa=lambda :input_()\r\nsb=lambda:int(input_())\r\nsc=lambda:input_().split()\r\nsd=lambda:list(map(int,input_().split()))\r\nsflo=lambda:list(map(float,input_().split()))\r\nse=lambda:float(input_())\r\nsf=lambda:list(input_())\r\nflsh=lambda: sys.stdout.flush()\r\n#sys.setrecursionlimit(10**6)\r\nmod=10**9+7\r\nmod1=998244353\r\ngp=[]\r\ncost=[]\r\ndp=[]\r\nmx=[]\r\nans1=[]\r\nans2=[]\r\nspecial=[]\r\nspecnode=[]\r\na=0\r\nkthpar=[]\r\ndef dfs(root,par):\r\n if par!=-1:\r\n dp[root]=dp[par]+1\r\n for i in range(1,20):\r\n if kthpar[root][i-1]!=-1:\r\n kthpar[root][i]=kthpar[kthpar[root][i-1]][i-1]\r\n for child in gp[root]:\r\n if child==par:continue\r\n kthpar[child][0]=root\r\n dfs(child,root)\r\nans=0\r\ndef setting(s):\r\n if s=='0':\r\n return -1\r\n i=len(s)-1\r\n cc=0\r\n while(i>=0 and s[i]=='0'):\r\n cc+=1\r\n i-=1\r\n return cc\r\ndef hnbhai(tc):\r\n n,q=sd()\r\n up=n+1\r\n x=len(bin(n)[2:])-1\r\n for i in range(q):\r\n v=sb()\r\n s=sa()\r\n for j in s:\r\n temp=bin(v)[2:]\r\n abe=setting(temp)\r\n #print(v,abe)\r\n if j==\"U\":\r\n if abe>=x:\r\n continue\r\n p=v+(1<<(abe))\r\n n=v-(1<<(abe))\r\n x1=setting(bin(p)[2:])\r\n #print(p,x1)\r\n x2=setting(bin(n)[2:])\r\n if x1==abe+1:\r\n v=p\r\n else:\r\n v=n\r\n elif j==\"L\":\r\n if abe<=0:\r\n continue\r\n v=v-(1<<(abe-1))\r\n #print(\"v\",v)\r\n else:\r\n if abe<=0:\r\n continue\r\n v=v+(1<<(abe-1))\r\n print(v)\r\nfor _ in range(1):\r\n hnbhai(_+1)\r\n", "from math import *\n\nn, q = list(map(int, input().split()))\ndepth = int(log2(n + 1))\n\n\ndef get_layer(u):\n for layer in range(depth):\n if u % (2 ** (layer + 1)) == 2 ** layer:\n return layer\n\n\ndef is_right_child(layer, u):\n return (u % 2 ** (layer + 1)) % 2 == 0\n\n\nfor x in range(q):\n u = int(input())\n layer = get_layer(u)\n steps = input()\n for s in steps:\n if s == 'U':\n if (layer == depth - 1):\n continue\n k = (u // (2 ** (layer + 1))) // 2\n layer += 1\n u = (2 ** (layer + 1)) * k + 2 ** layer\n elif layer == 0:\n continue\n elif s == 'R':\n k = (u // (2 ** (layer + 1))) * 2 + 1\n layer -= 1\n u = (2 ** (layer + 1)) * k + 2 ** layer\n elif s == 'L':\n k = (u // (2 ** (layer + 1))) * 2\n layer -= 1\n u = (2 ** (layer + 1)) * k + 2 ** layer\n print(u)\n", "import math\r\n\r\nn, q = map(int, input().split())\r\nmaxh = int(math.log(n + 1, 2))\r\nfor i in range (q):\r\n u = int(input())\r\n road = input()\r\n curh = 1\r\n curw = 0\r\n ch = 1\r\n while ch == 1:\r\n if u % curh != 0:\r\n curh //= 2\r\n ch = 0\r\n curh *= 2\r\n curh = int(math.log(curh, 2))\r\n a = 1 << (curh - 1)\r\n b = 1 << curh\r\n curw = (u - a) // b + 1\r\n for move in road:\r\n if move == \"L\":\r\n if curh != 1:\r\n curh -= 1\r\n curw = curw * 2 - 1\r\n u -= 1 << (curh - 1)\r\n elif move == \"R\":\r\n if curh != 1:\r\n curh -= 1\r\n curw *= 2\r\n u += 1 << (curh - 1)\r\n else:\r\n if curh != maxh:\r\n if curw % 2 == 1:\r\n u = (u + u + (1 << curh)) // 2\r\n curh += 1\r\n curw = curw // 2 + 1\r\n else:\r\n u = (u + u - (1 << curh)) // 2\r\n curh += 1\r\n curw = curw // 2\r\n print(u)", "def lvl(val):\r\n tot=1\r\n curr=-1\r\n while(val%tot==0):\r\n curr+=1\r\n tot*=2\r\n return [curr,val*2//(tot),tot//2]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn,q=map(int,input().split())\r\nfor _ in range(q):\r\n curr=int(input())\r\n l,v,pw=lvl(curr)\r\n s=input()\r\n for j in s:\r\n\r\n if j==\"U\":\r\n if v%4==3:\r\n curr=curr-pw\r\n else:\r\n if curr+pw<=n:\r\n curr=curr+pw\r\n\r\n elif j==\"R\":\r\n if l>0:\r\n curr=curr+pw//2\r\n\r\n elif j == \"L\":\r\n if l > 0:\r\n curr = curr - pw // 2\r\n\r\n l, v, pw = lvl(curr)\r\n\r\n print(curr)\r\n\r\n\r\n\r\n", "def mask(n):\r\n if not n: return 0;\r\n m = 1\r\n while not (m & n):\r\n m *= 2\r\n return m\r\n \r\nn, T = map(int, input().split())\r\nfor t in range(T):\r\n cur = int(input())\r\n for ch in input():\r\n m = mask(cur)\r\n #print(ch, \":\", m, cur, \"->\", end = \" \")\r\n if ch == \"U\":\r\n next = (cur - m) | (m * 2)\r\n if next < n: cur = next\r\n elif ch == \"L\" and m > 1:\r\n cur -= m//2\r\n elif ch == \"R\" and m > 1:\r\n cur += m//2\r\n #print(cur)\r\n print(cur) \r\n", "import sys\r\nimport io, os\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n\r\n n, q = map(int, input().split())\r\n maxd = ((n+1)//2).bit_length()-1\r\n\r\n P = [0]*(maxd+1)\r\n P[0] = 1\r\n for i in range(1, maxd+1):\r\n P[i] = P[i-1]*2\r\n\r\n for i in range(q):\r\n u = int(input())\r\n s = str(input().rstrip())\r\n e = 0\r\n x = u\r\n while x%2 == 0:\r\n x //= 2\r\n e += 1\r\n d = maxd-e\r\n for c in s:\r\n if c == 'L':\r\n if d == maxd:\r\n continue\r\n else:\r\n u -= P[maxd-d-1]\r\n d += 1\r\n elif c == 'R':\r\n if d == maxd:\r\n continue\r\n else:\r\n u += P[maxd-d-1]\r\n d += 1\r\n else:\r\n if d == 0:\r\n continue\r\n else:\r\n x = u\r\n while x%2 == 0:\r\n x //= 2\r\n if (x//2)%2 == 0:\r\n u += P[maxd-d]\r\n d -= 1\r\n else:\r\n u -= P[maxd-d]\r\n d -= 1\r\n print(u)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def l(a):\r\n b=bin(a)[2:]\r\n b=\"0\"*(e-len(b))+b\r\n d=len(b)\r\n for i in range(d-1,-1,-1):\r\n if b[i]==\"1\":\r\n c=d-1-i\r\n break\r\n if c==0:\r\n return -1\r\n return (a-2**(c-1))\r\n\r\ndef r(a):\r\n b=bin(a)[2:]\r\n b=\"0\"*(e-len(b))+b\r\n d=len(b)\r\n for i in range(d-1,-1,-1):\r\n if b[i]==\"1\":\r\n c=d-1-i\r\n break\r\n if c==0:\r\n return -1\r\n return (a+2**(c-1))\r\n \r\ndef u(a):\r\n b=bin(a)[2:]\r\n b=\"0\"*(e-len(b))+b\r\n d=len(b)\r\n for i in range(d-1,-1,-1):\r\n if b[i]==\"1\":\r\n c=d-1-i\r\n break\r\n if c==d-1:\r\n return -1\r\n else:\r\n if b[d-1-c-1]==\"0\":\r\n return a+(2**c)\r\n else:\r\n return a-(2**c)\r\n \r\nn,q=list(map(int,input().split()))\r\ne=len(bin(n)[2:])\r\nfor i in range(q):\r\n a=int(input())\r\n b=input()\r\n for i in range(len(b)):\r\n if b[i]==\"U\":\r\n c=u(a)\r\n if c!=-1:\r\n a=c\r\n elif b[i]==\"R\":\r\n c=r(a)\r\n if c!=-1:\r\n a=c\r\n elif b[i]==\"L\":\r\n c=l(a)\r\n if c!=-1:\r\n a=c\r\n print(a)", "def pow2(n):\r\n j=0\r\n while(n%2==0):\r\n n//=2\r\n j+=1\r\n return j \r\nn,q=map(int,input().split())\r\nfor j in range(q):\r\n u=int(input())\r\n s=input()\r\n for k in range(len(s)):\r\n num=pow2(u)\r\n if(s[k]==\"R\" and num!=0):\r\n u=u+2**(num-1)\r\n elif(s[k]==\"L\" and num!=0):\r\n u=u-2**(num-1)\r\n elif(s[k]==\"U\" and u!=(n+1)//2):\r\n m1=u+2**(num)\r\n m2=u-2**(num)\r\n if(pow2(m1)==(num+1)):\r\n u=m1\r\n else:\r\n u=m2\r\n print(u) ", "N, q = map(int, input().split())\r\n\r\n\r\ndef zero_cnt(x):\r\n x = bin(x)\r\n return x.count('0', x.rfind('1'))\r\n\r\n\r\ndef move_l(a):\r\n return a - 2**(zero_cnt(a) - 1) if zero_cnt(a) != 0 else a\r\n\r\n\r\ndef move_r(a):\r\n return a + 2**(zero_cnt(a) - 1) if zero_cnt(a) != 0 else a\r\n\r\n\r\ndef move_u(a):\r\n if a * 2 - 1 == N:\r\n return a\r\n return a + 2**zero_cnt(a) if zero_cnt(a + 2**zero_cnt(a)) - zero_cnt(a) == 1 else a - 2**zero_cnt(a)\r\n\r\n\r\ndict_ = {'L': lambda x : move_l(x), 'R': lambda x: move_r(x), 'U': lambda x: move_u(x)}\r\nfor _ in range(q):\r\n beg = int(input())\r\n for i in input():\r\n beg = dict_[i](beg)\r\n print(beg)\r\n", "import math\r\nimport sys\r\ninput=sys.stdin.readline\r\nn, q = map(int, input().split())\r\nkol_ur = round(math.log2(n + 1))\r\n\r\n\r\ndef get_urov(m):\r\n if m == 0:\r\n return -10\r\n c = 0\r\n while m % 2 == 0:\r\n m //= 2\r\n c += 1\r\n return c\r\n\r\n\r\nns = []\r\nfor _ in range(q):\r\n u = int(input())\r\n urov = get_urov(u)\r\n s = input()\r\n for i in s:\r\n if i == 'U':\r\n if urov + 1 == kol_ur:\r\n continue\r\n if get_urov(u + 2 ** urov) == urov + 1:\r\n u += 2**urov\r\n else:\r\n u -= 2**urov\r\n urov += 1\r\n elif i == 'R':\r\n if urov - 1 < 0:\r\n continue\r\n u += 2**(urov - 1)\r\n urov -= 1\r\n elif i == 'L':\r\n if urov - 1 < 0:\r\n continue\r\n u -= 2**(urov - 1)\r\n urov -= 1\r\n ns.append(str(u))\r\nprint('\\n'.join(ns))\r\n", "# ========== //\\\\ //|| ||====//||\r\n# || // \\\\ || || // ||\r\n# || //====\\\\ || || // ||\r\n# || // \\\\ || || // ||\r\n# ========== // \\\\ ======== ||//====|| \r\n# code\r\n\r\ndef main():\r\n n, q = map(int, input().split())\r\n for _ in range(q):\r\n node = int(input())\r\n s = input()\r\n\r\n for i in s:\r\n if i == 'L':\r\n if node % 2:\r\n continue\r\n k = node & (-node)\r\n node -= k\r\n k //= 2\r\n node += k\r\n\r\n if i == 'R':\r\n if node % 2:\r\n continue\r\n k = node & (-node)\r\n k //= 2\r\n node += k\r\n \r\n if i == 'U':\r\n if node == (n + 1) // 2:\r\n continue\r\n k = node & (-node)\r\n node -= k\r\n k *= 2\r\n node |= k\r\n print(node)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def getHeight(u):\n h = 0\n while u %2 == 0:\n h += 1\n u = u // 2\n return h\n\ndef getIndexId(u, h):\n for _ in range(h):\n u = u // 2\n u = u// 2\n return u\n\ndef solve(n, u, s):\n root = (n+1) // 2\n h = getHeight(u)\n\n for c in s:\n if c == 'L':\n if h == 0: continue\n\n u -= (1 << (h-1))\n h -= 1\n\n elif c == 'R':\n if h == 0: continue\n\n u += (1 << (h-1))\n h -= 1\n \n\n else: # c == 'U'\n indexId = getIndexId(u, h)\n\n if indexId % 2 == 0:\n if u == root: continue\n \n u += (1 << h)\n h += 1\n\n else: # indexId % 2 == 1\n if u == root: continue\n \n u -= (1 << h)\n h += 1\n\n print(u)\n\ndef main():\n n, q = map(int, input().split())\n\n for _ in range(q):\n u = int(input())\n s = input()\n\n solve(n, u, s)\n\n\nif __name__ == \"__main__\":\n main()" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nMOD = 1000000007\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.append(1)\r\nb = list(map(int, input().split()))\r\nm = int(input())\r\ndp = [1]\r\nfor x, y in zip(b, a):\r\n dp.extend([0] * x)\r\n for i in range(len(dp) - 1):\r\n dp[i + 1] += dp[i]\r\n if dp[i + 1] >= MOD:\r\n dp[i + 1] -= MOD\r\n for i in range(len(dp) - 1, x, -1):\r\n dp[i] -= dp[i - x - 1]\r\n if dp[i] < 0:\r\n dp[i] += MOD\r\n if y > 1:\r\n dp = dp[m % y :: y]\r\n m //= y\r\nif len(dp) <= m:\r\n print(0)\r\nelse:\r\n print(dp[m])\r\n" ]

[ "n = int(input())\r\ns = input()\r\nt = input()\r\na = []\r\nx = y = -2\r\nh = 0\r\nfor i in range(26):\r\n\ta.append([])\r\n\tfor j in range(26):\r\n\t\ta[i].append(-1)\r\nfor i in range(n):\r\n\tif(s[i] != t[i]):\r\n\t\th+=1\r\n\t\ta[ord(s[i])-ord('a')][ord(t[i])-ord('a')] = i\r\n\t\tif(a[ord(t[i])-ord('a')][ord(s[i])-ord('a')] != -1):\r\n\t\t\tx = i\r\n\t\t\ty = a[ord(t[i])-ord('a')][ord(s[i])-ord('a')]\r\nif(x == -2):\r\n\tfor i in range(26):\r\n\t\tfor j in range(26):\r\n\t\t\tif(a[i][j] != -1):\r\n\t\t\t\tfor k in range(26):\r\n\t\t\t\t\tif(a[j][k] != -1):\r\n\t\t\t\t\t\tx = a[i][j]\r\n\t\t\t\t\t\ty = a[j][k]\r\nif(x != -2):\r\n\tif(s[x] == t[y]):\r\n\t\th -= 1\r\n\tif(s[y] == t[x]):\r\n\t\th -= 1\r\nprint(h)\r\nprint(x + 1,y + 1)", "n = int(input())\ns = input()\nt = input()\ndiff = {}\ndis = 0\nfor i in range(len(s)):\n if s[i]!=t[i]:\n dis += 1\n diff[s[i]+t[i]] = i+1\nfor d in diff.keys():\n if diff.get(d[::-1],0) > 0:\n print(dis-2)\n print(diff[d], diff[d[::-1]])\n exit()\nfor d in diff.keys():\n for dd in diff.keys():\n if d[0]==dd[1] or d[1]==dd[0]:\n print(dis-1)\n print(diff[d], diff[dd])\n exit()\nprint(dis)\nprint(-1, -1)\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\na = input()[:-1]\r\nb = input()[:-1]\r\nd = defaultdict(list)\r\nc = [-1, -1]\r\nc1 = 0\r\nq1 = defaultdict(list)\r\nq2 = defaultdict(list)\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n x = b[i] + a[i]\r\n if c == [-1, -1]:\r\n if x in d:\r\n c = [d[x][0], i+1]\r\n d[a[i] + b[i]].append(i+1)\r\n q1[a[i]].append(i+1)\r\n q2[b[i]].append(i+1)\r\n c1 += 1\r\n\r\nif c != [-1, -1]:\r\n print(c1 - 2)\r\n print(*c)\r\nelse:\r\n for i in q1:\r\n if i in q2:\r\n print(c1 - 1)\r\n print(q1[i][0], q2[i][0])\r\n break\r\n else:\r\n print(c1)\r\n print(*c)", "def gao():\n\tn = int(input())\n\ta = input()\n\tb = input()\n\tmp = {}\n\tcnt = 0\n\tfor i in range(n):\n\t\tif a[i] != b[i]:\n\t\t\tcnt += 1\n\t\t\tmp[(a[i], b[i])] = i + 1\n\tl = [chr(ord('a') + i) for i in range(26)]\n\tfor i in l:\n\t\tfor j in l:\n\t\t\tif (i, j) in mp and (j, i) in mp:\n\t\t\t\tprint(cnt - 2)\n\t\t\t\tprint(mp[(i, j)], mp[(j, i)])\n\t\t\t\treturn\n\tfor i in l:\n\t\tfor j in l:\n\t\t\tfor k in l:\n\t\t\t\tif (i, j) in mp and (j, k) in mp:\n\t\t\t\t\tprint(cnt - 1)\n\t\t\t\t\tprint(mp[(i, j)], mp[(j, k)])\n\t\t\t\t\treturn\n\tprint(cnt)\n\tprint(-1, -1)\n\n\ngao()\n", "import string\r\n\r\nn, s, t = int(input()), input(), input()\r\nx, i, j = 0, -1, -1\r\nsc_dict = {c: set() for c in string.ascii_lowercase}\r\ntc_dict = {c: set() for c in string.ascii_lowercase}\r\nsti_dict, tsi_dict = dict(), dict()\r\n\r\nfor ci, sc, tc in zip(range(n), s, t):\r\n if sc == tc:\r\n continue\r\n sc_dict[sc].add(tc)\r\n tc_dict[tc].add(sc)\r\n sti_dict[sc + tc] = ci\r\n tsi_dict[tc + sc] = ci\r\n x += 1\r\n\r\nfor c in string.ascii_lowercase:\r\n cs = sc_dict[c] & tc_dict[c]\r\n if not cs:\r\n continue\r\n c2 = cs.pop()\r\n x -= 2\r\n i = sti_dict[c + c2] + 1\r\n j = tsi_dict[c + c2] + 1\r\n break\r\nelse:\r\n for c in string.ascii_lowercase:\r\n if not sc_dict[c] or not tc_dict[c]:\r\n continue\r\n x -= 1\r\n i = sti_dict[c + sc_dict[c].pop()] + 1\r\n j = tsi_dict[c + tc_dict[c].pop()] + 1\r\n break\r\n\r\nprint(x)\r\nprint(i, j)\r\n", "import 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 26 * u + v\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nt = list(input().rstrip())\r\nu = [0] * (26 * 26)\r\nx = 0\r\nfor i in range(n):\r\n if s[i] ^ t[i]:\r\n u[f(s[i] - 97, t[i] - 97)] = i + 1\r\n x += 1\r\nans = [-1, -1]\r\nfor i in range(26):\r\n for j in range(i + 1, 26):\r\n if u[f(i, j)] and u[f(j, i)]:\r\n x -= 2\r\n ans = [u[f(i, j)], u[f(j, i)]]\r\n break\r\n if ans[0] ^ -1:\r\n break\r\nif ans[0] == -1:\r\n for i in range(26):\r\n for j in range(26):\r\n if i == j or not u[f(i, j)]:\r\n continue\r\n for k in range(26):\r\n if u[f(j, k)]:\r\n x -= 1\r\n ans = [u[f(i, j)], u[f(j, k)]]\r\n break\r\n if ans[0] ^ -1:\r\n break\r\n if ans[0] ^ -1:\r\n break\r\nprint(x)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Mar 21 00:34:22 2015\r\n\r\n@author: NEC-PCuser\r\n\"\"\"\r\n\r\ndef solve(n, S, T):\r\n st = dict()\r\n ts = dict()\r\n s = dict()\r\n t = dict()\r\n dist = 0\r\n for i, (si, ti) in enumerate(zip(S, T), 1):\r\n if si != ti:\r\n st[si, ti] = i\r\n ts[ti, si] = i\r\n s[si] = i\r\n t[ti] = i\r\n dist += 1\r\n for key, i in st.items():\r\n if key in ts:\r\n j = ts[key]\r\n return dist - 2, min(i, j), max(i, j)\r\n for si, i in s.items():\r\n if si in t:\r\n j = t[si]\r\n return dist - 1, min(i, j), max(i, j)\r\n return dist, -1, -1\r\n\r\nn = int(input())\r\nS = input()\r\nT = input()\r\ndist, i, j = solve(n, S, T)\r\nprint(dist)\r\nprint(i, j)", "_,s,t=input(),input(),input()\r\nd=0\r\np=[[-1 for _ in range(26)] for _ in range(26)]\r\na,b=[-1 for _ in range(26)],[-1 for _ in range(26)]\r\nfor i in range(len(s)):\r\n if s[i]!=t[i]:\r\n cs=ord(s[i])-97\r\n ct=ord(t[i])-97\r\n d+=1\r\n p[cs][ct]=i+1\r\n a[cs]=i+1\r\n b[ct]=i+1\r\nfor i in range(26*26):\r\n if p[i//26][i%26]>-1 and p[i%26][i//26]>-1:\r\n print(d-2)\r\n print(p[i//26][i%26],p[i%26][i//26])\r\n break\r\nelse:\r\n for i in range(26):\r\n if a[i]>-1 and b[i]>-1:\r\n print(d-1)\r\n print(a[i],b[i]) \r\n break\r\n else:\r\n print(d)\r\n print(-1,-1)", "from sys import stdin,stdout\r\nfrom collections import Counter\r\ndef ai(): return list(map(int, stdin.readline().split()))\r\ndef ei(): return map(int, stdin.readline().split())\r\ndef ip(): return int(stdin.readline().strip())\r\ndef op(ans): return stdout.write(str(ans) + '\\n') \r\n\r\nn = ip()\r\ns = input()\r\nt = input()\r\nvalue = {}\r\nli = []\r\nres1 = 0\r\nres2 =res3 = -1\r\nfor i in range(n):\r\n\tif s[i] != t[i]:\r\n\t\tvalue[t[i]] = i\r\n\t\tres1 += 1\r\n\t\tli.append(i)\r\np = sq = False\r\nfor i in li:\r\n\tif s[i] in value:\r\n\t\tp = True\r\n\t\tres2 = i+1\r\n\t\tf = value[s[i]]\r\n\t\tres3 = f+1\r\n\t\tif s[f] == t[i]:\r\n\t\t\tsq = True\r\n\t\t\tbreak\r\nprint(res1-(2 if sq else 1 if p else 0))\r\nprint(res2,res3)", "def main():\n from collections import defaultdict\n n = int(input())\n flag, res, pairs, pair = True, 0, {}, None\n missa, missb = defaultdict(int), defaultdict(int)\n for i, a, b in zip(range(1, n + 1), input(), input()):\n if a != b:\n res += 1\n if flag:\n if a + b in pairs:\n flag = False\n pair = (pairs[a + b], i)\n else:\n if pair is None:\n j = missb[a] or missa[b]\n if j:\n pair = (j, i)\n else:\n missa[a] = missb[b] = i\n pairs[b + a] = i\n print(res - ((pair is not None) if flag else 2))\n print(*((-1, -1) if pair is None else pair))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\ns = input()\nt = input()\n\ndef ff(ch):\n return ord(ch) - ord('a')\n\ndef answer(a, b, sc):\n print(cans + sc)\n print(a+1, b+1)\n exit()\n\ncans = 0\nmatrix = [[None] * 26 for i in range(26)]\nfor i in range(n):\n matrix[ff(s[i])][ff(t[i])] = i\n if s[i] != t[i]:\n cans += 1\n\nfor i in range(26):\n for j in range(i):\n if matrix[i][j] is not None and matrix[j][i] is not None:\n answer(matrix[i][j], matrix[j][i], -2)\n\nfor i in range(26):\n for h in range(26):\n if h == i:\n continue\n for v in range(26):\n if v == i:\n continue\n if matrix[h][i] is not None and matrix[i][v] is not None:\n answer(matrix[h][i], matrix[i][v], -1)\n\nanswer(-2, -2, 0)\n", "xxx = 0\r\na1=[]\r\na2=[]\r\n\r\na = int(input())\r\nx = input()\r\ny = input()\r\n\r\nof1=[]\r\nof2=[]\r\n\r\na1 = {}\r\na2 = {}\r\n\r\nfor i in 'abcdefghijklmnopqrstuvwxyz':\r\n a1[i] = []\r\n a2[i] = []\r\n \r\nfor i in range(a):\r\n if x[i]!=y[i]:\r\n\r\n a1[x[i]].append(i+1)\r\n a2[y[i]].append(i+1)\r\n else:\r\n xxx += 1\r\n\r\nfor i in 'abcdefghijklmnopqrstuvwxyz':\r\n for j in 'abcdefghijklmnopqrstuvwxyz':\r\n if j != i:\r\n aa1 = a1[i]\r\n bb1 = a2[j]\r\n cc1 = a1[j]\r\n dd1 = a2[i]\r\n ee = set(aa1).intersection(bb1)\r\n ff = set(cc1).intersection(dd1)\r\n if ee!= set() and ff!=set():\r\n print(a-xxx-2)\r\n print(list(ee)[0], list(ff)[0])\r\n quit()\r\n \r\n \r\nfor i in 'abcdefghijklmnopqrstuvwxyz':\r\n for j in 'abcdefghijklmnopqrstuvwxyz':\r\n if j != i:\r\n aa1 = a1[i]\r\n bb1 = a2[j]\r\n cc1 = a1[j]\r\n dd1 = a2[i]\r\n ee = set(aa1).intersection(bb1)\r\n ff = set(cc1).intersection(dd1)\r\n if ee != set():\r\n if cc1 == [] and dd1 == []:\r\n print(a-xxx)\r\n print(-1, -1)\r\n quit()\r\n print(a-xxx-1)\r\n if len(cc1)>0:\r\n print(list(ee)[0], cc1[0])\r\n else:\r\n print(list(ee)[0], dd1[0])\r\n quit()\r\n elif ff != set():\r\n if aa1 == [] and bb1 == []:\r\n print(a-xxx)\r\n print(-1, -1)\r\n quit()\r\n print(a-xxx-1)\r\n if len(aa1)>0:\r\n print(list(ff)[0], aa1[0])\r\n else:\r\n print(list(ff)[0], bb1[0])\r\n quit()\r\n\r\nprint(a-xxx)\r\nprint(-1, -1)\r\n", "num=int(input())\r\na=input()\r\nb=input()\r\ndic={}\r\nlis=[]\r\nham=0\r\nswap1=-1\r\nswap2=-1\r\np=False\r\nq=False\r\nfor i in range(num):\r\n if a[i]!=b[i]:\r\n ham+=1\r\n lis.append(i)\r\n dic[b[i]]=i\r\nfor i in lis:\r\n if a[i] in dic:\r\n p=True\r\n swap1=i+1\r\n f=dic[a[i]]\r\n swap2=f+1\r\n if a[f]==b[i]:\r\n q=True\r\n break\r\nprint(ham-(2 if q else 1 if p else 0))\r\nprint(swap1,swap2)", "def solve():\r\n r = 0\r\n d = {}\r\n\r\n for i in range(n):\r\n if a[i] != b[i]:\r\n r += 1\r\n d[(a[i], b[i])] = i+1\r\n\r\n symbols = [chr(ord('a') + i) for i in range(26)]\r\n\r\n for i in symbols:\r\n for j in symbols:\r\n if (i, j) in d and (j, i) in d:\r\n return(r-2, d[(i, j)], d[(j, i)])\r\n\r\n for i in symbols:\r\n for j in symbols:\r\n for k in symbols:\r\n if (i, j) in d and (j, k) in d:\r\n return(r-1, d[(i, j)], d[(j, k)])\r\n\r\n return(r, -1, -1)\r\n\r\n\r\nn = int(input())\r\na = input()\r\nb = input()\r\nans = solve()\r\nprint(ans[0], '\\n', ans[1], ' ', ans[2], sep = '')", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\ns = input()\nt = input()\n\nk, l = 0, 0\nstate = 0\nhd = 0\n\nm = {}\n\nfor i in range(n):\n if s[i] != t[i]:\n hd += 1\n\n cs = s[i]\n ct = t[i]\n cst = cs + ct\n\n if cst not in m:\n m[cst] = i+1\n\nfor pair in m:\n r = pair[1] + pair[0]\n\n if r in m:\n print(hd-2)\n print(m[pair], m[r])\n exit()\n\nfor pair in m:\n for p in m:\n if pair == p:\n continue\n\n if p[0] == pair[1] or p[1] == pair[0]:\n print(hd-1)\n print(m[pair], m[p])\n exit()\n\n\nprint(hd)\nprint(-1, -1)\n", "from pprint import pprint\nfrom operator import itemgetter\n\ndef main():\n _ = int(input().strip())\n w1 = input().strip()\n w2 = input().strip()\n \n if len(w1) != len(w2):\n return -1\n \n hdis, fpos, lpos = one_replace_hamming(w1, w2)\n print(hdis)\n print(min(fpos + 1, lpos + 1), max(fpos + 1, lpos + 1))\n\ndef ham_wt(w1, w2):\n diff_pairs1 = []\n rev_assoc = dict()\n pos_indicator = dict()\n for i in range(len(w1)):\n if w2[i] != w1[i]:\n diff_pairs1.append((w1[i], w2[i]))\n rev_assoc[w2[i]] = w1[i]\n pos_indicator[w1[i], w2[i]] = i\n return (diff_pairs1, rev_assoc, pos_indicator)\n\ndef one_replace_hamming(w1, w2):\n diff_pairs, rev_assoc, pos_indicator = ham_wt(w1, w2)\n\n for fst, snd in diff_pairs:\n if fst in rev_assoc and rev_assoc[fst] == snd:\n return (len(diff_pairs) - 2, pos_indicator[fst, snd], pos_indicator[snd, fst])\n \n for fst, snd in diff_pairs:\n if fst in rev_assoc:\n return (len(diff_pairs) - 1, pos_indicator[fst, snd], pos_indicator[rev_assoc[fst], fst])\n \n \n return (len(diff_pairs), -2, -2)\n \n \n\nif __name__ == '__main__':\n main()", "import sys\r\nn = int(input())\r\na = input()\r\nb = input()\r\nl = 0\r\nc = [[0 for j in range(26)] for i in range(26)]\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n l += 1\r\n c[ord(a[i]) - ord('a')][ord(b[i]) - ord('a')] = i+1\r\n\r\nfor i in range(26):\r\n for j in range(26):\r\n if i == j or c[i][j] == 0 or c[j][i] == 0:\r\n continue\r\n print(l-2)\r\n print(c[i][j], c[j][i])\r\n sys.exit(0)\r\nfor i in range(26):\r\n for j in range(26):\r\n if i == j or c[i][j] == 0 or max(c[j]) == 0:\r\n continue\r\n print(l-1)\r\n print(c[i][j], end=' ')\r\n for k in range(26):\r\n if c[j][k] > 0:\r\n print(c[j][k])\r\n sys.exit(0)\r\nprint(l)\r\nprint(-1, -1)\r\n", "n = int(input())\r\ns = input()\r\nt = input()\r\ndic, diff = {}, []\r\nres, res1, res2 = 0, -1, -1\r\nfor i in range(n) :\r\n if s[i] != t[i] :\r\n res += 1\r\n diff.append(i)\r\n dic[t[i]] = i\r\nswap1, swap2 = False, False\r\nfor i in diff :\r\n if s[i] in dic:\r\n swap1 = True\r\n res1 = i+1\r\n j = dic[s[i]]\r\n res2 = j+1\r\n if s[j] == t[i] :\r\n swap2 = True\r\n break\r\nprint(res - (2 if swap2 else 1 if swap1 else 0))\r\nprint(res1, res2)\r\n", "import sys\r\nn = int(input())\r\n\r\ns = input()\r\nt = input()\r\n\r\narr = {}\r\nf = 0\r\n\r\nfor idx in range(n):\r\n if s[idx] != t[idx]:\r\n f += 1\r\n arr[ s[idx] + t[idx] ] = idx\r\n\r\nfor k in arr.keys():\r\n if k[1] + k[0] in arr:\r\n print(f - 2)\r\n print(str(arr[k] + 1) + ' ' + str(arr[k[1] + k[0]] + 1))\r\n sys.exit(0)\r\n\r\nfor k in arr.keys():\r\n for l in arr.keys():\r\n if k[0] == l[1] or k[1] == l[0]:\r\n print(f - 1)\r\n print(str(arr[k] + 1) + ' ' + str(arr[l] + 1))\r\n sys.exit(0)\r\n\r\nprint(f)\r\nprint('-1 -1')", "import time\r\n\r\nclass Profiler(object):\r\n def __enter__(self):\r\n self._startTime = time.time()\r\n\r\n def __exit__(self, type, value, traceback):\r\n print(\"Elapsed time: {:.3f} sec\".format(time.time() - self._startTime))\r\n\r\n\r\nn = int(input())\r\na = input()\r\nb = input()\r\n#a= 'x'*200000 +'ab'\r\n#b= 'b'*200000 +'xx'\r\nindexes = list()\r\nd = {}\r\nf1 = False\r\nf2 = False\r\ndf = 0\r\ni1 = 0\r\ni2 = 0\r\n#with Profiler() as p:\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n df += 1\r\n indexes.append(i)\r\n d[b[i]] = i\r\nfor i in indexes:\r\n if a[i] in d:\r\n f1 = True\r\n j = d[a[i]]\r\n i1 = i+1\r\n i2 = j+1\r\n if a[j] == b[i]:\r\n f2 = True\r\n break\r\nif f2:\r\n print(str(df-2))\r\n print(i1.__str__() + ' ' + i2.__str__())\r\nelif f1:\r\n print(str(df-1))\r\n print(i1.__str__() + ' ' + i2.__str__())\r\nelse:\r\n print(str(df))\r\n print('-1 -1')", "n=int(input())\ns=input()\nt=input()\ndis=0\nd=[[False for i in range(30)] for i in range(30)]\nx=[[0 for i in range(30)] for i in range(30)]\nfor i in range(n):\n\tif s[i]!=t[i]:\n\t\tdis+=1\n\t\td[ord(s[i])-ord('a')][ord(t[i])-ord('a')]=True\n\t\tx[ord(s[i])-ord('a')][ord(t[i])-ord('a')]=i+1\ndef progress():\n\tfor i in range(26):\n\t\tfor j in range(26):\n\t\t\tif (d[i][j]) and (d[j][i]):\n\t\t\t\tprint (\"{}\\n{} {}\".format(dis-2,x[i][j],x[j][i]))\n\t\t\t\treturn 0\n\tfor i in range(26):\n\t\tfor j in range(26):\n\t\t\tif d[i][j]:\n\t\t\t\tfor t in range(26):\n\t\t\t\t\tif d[j][t]:\n\t\t\t\t\t\tprint (\"{}\\n{} {}\".format(dis-1,x[i][j],x[j][t]))\n\t\t\t\t\t\treturn 0\n\tprint (\"{}\\n{} {}\".format(dis,-1,-1))\nprogress()\n\n\n", "n=int(input())\r\ns,t=input(),input()\r\nalpha=list('abcdefghijklmnopqrstuvwxyz')\r\nspair,tpair=dict(),dict()\r\nx=[1]*n\r\nk=n\r\nd=0\r\nu,v=-1,-1\r\ndd=dict()\r\nfor i in range(n):\r\n if s[i]==t[i]:\r\n k=k-1\r\n else:\r\n dd[s[i]+t[i]]=str(i+1)\r\n \r\nfor i in alpha:\r\n for j in alpha:\r\n if (i+j in dd) and (j+i in dd):\r\n print(k-2)\r\n print(dd[i+j]+' '+dd[j+i])\r\n raise SystemExit\r\n\r\nfor i in alpha :\r\n for j in alpha:\r\n for l in alpha:\r\n if (i+j in dd) and (j+l in dd):\r\n print(k-1)\r\n print(dd[i+j]+' '+dd[j+l])\r\n raise SystemExit\r\n \r\nprint(k)\r\nprint('-1 -1')\r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n \r\n", "n = input()\r\ns1,s2 = input(),input()\r\nl2,l3 = [],[]\r\nl1 = [[l2.append((s1[x] + s2[x],x)),l3.append((s2[x] + s1[x],x))] for x in range(len(s1)) if s1[x] != s2[x]]\r\nd1,d2 = dict(l2),dict(l3)\r\nins = set(d1.keys()) & set(d2.keys())\r\nif ins:\r\n e = ins.pop()\r\n print (len(l1) - 2)\r\n print (d1[e] + 1,d2[e] + 1)\r\n exit(0)\r\ns1,s2 = {y[0][0]:y[1] for y in l2},{y[0][1]:y[1] for y in l2}\r\nins = set(s1.keys()) & set(s2.keys())\r\nif ins:\r\n e = ins.pop()\r\n print (len(l1) - 1)\r\n print (s1[e] + 1,s2[e] + 1)\r\n exit(0)\r\nprint (len(l1))\r\nprint (-1,-1)", "YNaXbdBeHKpwfIm = int\r\nYNaXbdBeHKpwfIi = input\r\nYNaXbdBeHKpwfIj = range\r\nYNaXbdBeHKpwfIR = len\r\nYNaXbdBeHKpwfID = print\r\nYNaXbdBeHKpwfIl = exit\r\n\r\nYNaXbdBeHKpwfIt = YNaXbdBeHKpwfIm\r\nYNaXbdBeHKpwfIx = YNaXbdBeHKpwfIi\r\nYNaXbdBeHKpwfIz = YNaXbdBeHKpwfIj\r\nYNaXbdBeHKpwfIW = YNaXbdBeHKpwfIR\r\nYNaXbdBeHKpwfIO = YNaXbdBeHKpwfID\r\nYNaXbdBeHKpwfIo = YNaXbdBeHKpwfIl\r\nYNaXbdBeHKpwfIM = YNaXbdBeHKpwfIt\r\nYNaXbdBeHKpwfIn = YNaXbdBeHKpwfIx\r\nYNaXbdBeHKpwfIL = YNaXbdBeHKpwfIz\r\nYNaXbdBeHKpwfIA = YNaXbdBeHKpwfIW\r\nYNaXbdBeHKpwfIq = YNaXbdBeHKpwfIO\r\nYNaXbdBeHKpwfIc = YNaXbdBeHKpwfIo\r\nn = YNaXbdBeHKpwfIM(YNaXbdBeHKpwfIn())\r\ns = YNaXbdBeHKpwfIn()\r\nt = YNaXbdBeHKpwfIn()\r\nYNaXbdBeHKpwfIs = {}\r\nYNaXbdBeHKpwfIT = 0\r\nfor i in YNaXbdBeHKpwfIL(YNaXbdBeHKpwfIA(s)):\r\n if s[i] != t[i]:\r\n YNaXbdBeHKpwfIT += 1\r\n YNaXbdBeHKpwfIs[s[i]+t[i]] = i+1\r\nfor d in YNaXbdBeHKpwfIs.keys():\r\n if YNaXbdBeHKpwfIs.get(d[::-1], 0) > 0:\r\n YNaXbdBeHKpwfIq(YNaXbdBeHKpwfIT-2)\r\n YNaXbdBeHKpwfIq(YNaXbdBeHKpwfIs[d], YNaXbdBeHKpwfIs[d[::-1]])\r\n YNaXbdBeHKpwfIc()\r\nfor d in YNaXbdBeHKpwfIs.keys():\r\n for dd in YNaXbdBeHKpwfIs.keys():\r\n if d[0] == dd[1]or d[1] == dd[0]:\r\n YNaXbdBeHKpwfIq(YNaXbdBeHKpwfIT-1)\r\n YNaXbdBeHKpwfIq(YNaXbdBeHKpwfIs[d], YNaXbdBeHKpwfIs[dd])\r\n YNaXbdBeHKpwfIc()\r\nYNaXbdBeHKpwfIq(YNaXbdBeHKpwfIT)\r\nYNaXbdBeHKpwfIq(-1, -1)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n\nimport sys\nn = int(input())\na, b = input(), input()\nl = 0\nc = [[0 for j in range(26)] for i in range(26)]\nfor i in range(n):\n if a[i] != b[i]:\n l += 1\n c[ord(a[i]) - ord('a')][ord(b[i]) - ord('a')] = i + 1\nfor i in range(26):\n for j in range(26):\n if i == j or c[i][j] == 0 or c[j][i] == 0:\n continue\n print(l - 2)\n print(c[i][j], c[j][i])\n sys.exit(0)\nfor i in range(26):\n for j in range(26):\n if i == j or c[i][j] == 0 or max(c[j]) == 0:\n continue\n print(l - 1)\n print(c[i][j], end = ' ')\n for k in range(26):\n if c[j][k] > 0:\n print(c[j][k])\n sys.exit(0)\nprint(l)\nprint(-1, -1)\n", "n=int(input())\r\ns=input()\r\nt=input()\r\nq={}\r\nosh=[]\r\nrez1=0\r\nrez2=-1\r\nrez3=-1\r\nfor i in range(n):\r\n if s[i]!=t[i]:\r\n rez1+=1\r\n osh.append(i)\r\n q[t[i]]=i\r\np=False\r\nsq=False\r\nfor i in osh:\r\n if s[i] in q:\r\n p=True\r\n rez2=i+1\r\n f=q[s[i]]\r\n rez3=f+1\r\n if s[f]==t[i]:\r\n sq=True\r\n break\r\nprint(rez1-(2 if sq else 1 if p else 0))\r\nprint(rez2,rez3)", "n = int(input())\r\ns = input()\r\nt = input()\r\np = [-1, -1]\r\na = [[-1] * 26 for i in range(26)]\r\nk = 0\r\nfor i in range(n):\r\n if t[i] != s[i]:\r\n k += 1\r\nfor i in range(n):\r\n if t[i] != s[i]:\r\n if a[ord(t[i]) - 97][ord(s[i]) - 97] != -1:\r\n print(k - 2)\r\n print(a[ord(t[i]) - 97][ord(s[i]) - 97] + 1, i + 1)\r\n exit()\r\n a[ord(s[i]) - 97][ord(t[i]) - 97] = i\r\nfor i in range(n):\r\n if t[i] != s[i]:\r\n for j in range(26):\r\n if a[j][ord(s[i]) - 97] != -1:\r\n print(k - 1)\r\n print(a[j][ord(s[i]) - 97] + 1, i + 1)\r\n exit()\r\n a[ord(s[i]) - 97][ord(t[i]) - 97] = i\r\nprint(k)\r\nprint(-1, -1)\r\n" ]

[ "input()\nk=input()\nprint((min(k.count(\"R\"),k.count(\"L\"))+min(k.count(\"D\"),k.count(\"U\")))*2)\n \t \t\t \t \t \t \t \t\t\t \t \t\t", "n=int(input())\r\ns=input()\r\nV=['U','D','L','R']\r\nC=[0,0,0,0]\r\nfor l in s:\r\n C[V.index(l)]+=1\r\nprint(2*min(C[0],C[1])+2*min(C[2],C[3]))\r\n ", "n=int(input())\r\ns=input()\r\na,b,c,d=0,0,0,0\r\nfor i in range(n):\r\n if s[i]=='L':\r\n a+=1\r\n elif s[i]=='R':\r\n b+=1\r\n elif s[i]=='U':\r\n c+=1\r\n else:\r\n d+=1\r\nprint(2*(min(a,b)+min(c,d)))", "n = int(input())\r\ns = list(input())\r\nl = 0\r\nr = 0\r\nu = 0\r\nd = 0\r\nfor i in s:\r\n if i == 'L':\r\n l += 1\r\n if i == 'U':\r\n u += 1\r\n if i == 'R':\r\n r += 1\r\n if i == 'D':\r\n d += 1\r\nm1 = min(l, r) * 2\r\nm2 = min(u, d) * 2\r\nif l > 0 and r > 0 or l == 0 and r == 0:\r\n print(m1 + m2)\r\nelif u > 0 and d > 0 or u == 0 and d == 0:\r\n print(m1 + m2)\r\nelse:\r\n print('0')\r\n ", "n = int(input())\r\ns = input()\r\nnum_R = 0\r\nnum_L = 0\r\nnum_U = 0\r\nnum_D = 0\r\nfor i in range(n):\r\n if s[i] == 'R':\r\n num_R += 1\r\n elif s[i] == 'L':\r\n num_L += 1\r\n elif s[i] == 'U':\r\n num_U += 1\r\n else:\r\n num_D += 1\r\nans = min(num_L,num_R)*2 + min(num_U,num_D)*2\r\nprint(ans)", "input()\r\na=input()\r\nprint((min(a.count('L'),a.count('R'))+min(a.count('U'),a.count('D')))<<1)", "n = int(input())\r\ns = input()\r\n\r\nh, v = 0, 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == 'L':\r\n h -= 1\r\n elif s[i] == 'R':\r\n h += 1\r\n elif s[i] == 'D':\r\n v -= 1\r\n else:\r\n v += 1\r\n \r\nh = abs(h)\r\nv = abs(v)\r\ndelta = len(s) - h - v\r\nprint(delta)", "n = int(input())\r\ns = input()\r\n\r\ncount_l = s.count('L')\r\ncount_r = s.count('R')\r\ncount_u = s.count('U')\r\ncount_d = s.count('D')\r\n\r\nmax_commands = 2 * min(count_l, count_r) + 2 * min(count_u, count_d)\r\nprint(max_commands)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nw = Counter(input()[:-1])\r\nprint((min(w['L'], w['R']) + min(w['U'], w['D']))*2)", "from sys import stdin\nn = int(stdin.readline())\ntrim = lambda s: s[:-1] if s[-1] == \"\\n\" else s\nmoves = trim(stdin.readline())\n\nx = 0\ny = 0\nfor i in moves:\n if i == 'U':\n y += 1\n elif i == 'R':\n x += 1\n elif i == 'L':\n x -= 1\n elif i == 'D':\n y -= 1\n\nprint(len(moves)-abs(x)-abs(y))\n\n\t \t\t \t \t \t \t \t\t\t \t \t \t\t\t\t", "n=int(input())\na=list(input())\nu=0\nd=0\nl=0\nr=0\nfor i in range(n):\n if(a[i]=='L'):\n l=l+1\n if(a[i]=='R'):\n r=r+1\n if(a[i]=='D'):\n d=d+1\n if(a[i]=='U'):\n u=u+1\ncount=0\nwhile(u>0 and d>0 ):\n count=count+2\n u=u-1\n d=d-1\nwhile(l>0 and r>0):\n count=count+2\n l=l-1\n r=r-1\n\nprint(count)\n\n\n\n\t \t \t \t \t\t \t \t \t\t \t\t", "n = int(input())\r\ns = input()\r\nl = s.count('L')\r\nr = s.count('R')\r\nu = s.count('U')\r\nd = s.count('D')\r\nl_r = min(l,r)\r\nu_d = min(u,d)\r\nprint(2*l_r + 2*u_d)\r\n", "n = int(input())\r\ns = input()\r\nl = [0,0]\r\n\r\nfor x in s :\r\n\tif x == 'U' :\r\n\t\tl[1] += 1\r\n\telif x == 'D' :\r\n\t\tl[1] -= 1\r\n\telif x == 'L' :\r\n\t\tl[0] -= 1\r\n\telse :\r\n\t\tl[0] += 1\r\n\r\nprint(n-abs(l[0])-abs(l[1]))", "n=input()\r\ns=input()\r\nprint(min(s.count('U'),s.count('D'))*2 + min(s.count('L'),s.count('R'))*2)", "n = int(input())\nk = input()\n\nhori = min(k.count(\"R\"), k.count(\"L\"))\nvert = min(k.count(\"D\"), k.count(\"U\"))\n\nprint((hori + vert) * 2)\n\n\t \t \t \t \t \t\t\t \t \t \t", "n = int(input())\r\ndata = list(input())\r\nans = min(data.count('L'), data.count('R')) * 2 + min(data.count('U'), data.count('D')) * 2\r\nprint(ans)\r\n", "n=int(input())\r\ns=input()\r\nl=0\r\nr=0\r\nu=0\r\nd=0\r\nfor x in s:\r\n\tif x=='U':\r\n\t\tu+=1\r\n\telif x=='D':\r\n\t\td+=1\r\n\telif x=='L':\r\n\t\tl+=1\r\n\telse:\r\n\t\tr+=1\r\n\r\nprint(min(l,r)*2+min(u,d)*2)\r\n\r\n", "input()\r\ns = input()\r\n\r\nup = s.count('U')\r\ndown = s.count('D')\r\nleft = s.count('L')\r\nright = s.count('R')\r\n\r\nprint(2*(min(up,down) + min(left,right)))\r\n", "# LUOGU_RID: 133200769\ninput()\na=input()\nprint((min(a.count('L'),a.count('R'))+min(a.count('U'),a.count('D')))<<1)", "import sys\n\nn = int(input())\n\ns = input()\nR = L = U = D = 0\nfor ch in s:\n if ch == 'R':\n R += 1\n elif ch == 'L':\n L += 1\n elif ch == 'U':\n U += 1\n else:\n D += 1\nans = 0\nans += min(D, U) * 2\nans += min(R, L) * 2\nprint(ans)\n", "n = int(input())\r\ns = input()\r\nfrom collections import Counter\r\nd = Counter(s)\r\nans = 2*min(d['U'], d['D']) + 2*min(d['R'], d['L'])\r\nprint(ans)", "n=int(input())\r\nent=input()\r\nHoriz=0\r\nVert=0\r\nfor i in range(n):\r\n if ent[i]=='R':\r\n Horiz+=1\r\n elif ent[i]=='L':\r\n Horiz-=1\r\n elif ent[i]=='U':\r\n Vert+=1\r\n else:\r\n Vert-=1\r\ncom=n-abs(Horiz)-abs(Vert)\r\nprint(com)", "n=int(input())\r\ns=input()\r\nl=0\r\nr=0\r\nu=0\r\nd=0\r\nfor i in range(n):\r\n if s[i]=='L':\r\n l+=1\r\n if s[i]=='R':\r\n r+=1\r\n if s[i]=='U':\r\n u+=1\r\n if s[i]=='D':\r\n d+=1\r\nprint(2*(min(l,r)+min(u,d)))", "n = int(input())\r\ns = input()\r\nprint(min(s.count('L'), s.count('R'))*2 + min(s.count('U'), s.count('D'))*2)", "def list_output(s): \r\n print(' '.join(map(str, s)))\r\n \r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\nn = int(input())\r\ns = input()\r\nl, r, u, d = 0, 0, 0, 0\r\nfor i in range(n):\r\n if s[i] == 'L':\r\n l += 1\r\n elif s[i] == 'R':\r\n r += 1\r\n elif s[i] == 'U':\r\n u += 1\r\n elif s[i] == 'D':\r\n d += 1\r\nres = 2*min(l, r)+2*min(u, d)\r\nprint(res)", "n=int(input())\narr=list(input())\nm=0\nx=0\ny=0\ncount=0\ntemp=0\nfor i in range(len(arr)):\n if arr[i]=='U':\n y+=1\n \n elif arr[i]=='D':\n y-=1\n \n elif arr[i]=='L':\n x-=1\n \n elif arr[i]=='R':\n x+=1\n \nprint(n-(abs(x)+abs(y)))\n \n \n\t\t\t\t\t\t\t\t \t \t\t \t \t\t\t\t \t \t \t", "a = int(input())\r\nb = input()\r\nu = d = l = r = 0\r\nfor i in b:\r\n if i == 'U':\r\n u += 1\r\n else:\r\n if i == 'D':\r\n d += 1\r\n else:\r\n if i == 'L':\r\n l += 1\r\n else:\r\n r += 1\r\nprint(min(u,d)*2+min(l,r)*2)\r\n", "n=int(input())\r\nx=0\r\ny=0\r\nfor i in input():\r\n if i==\"L\":\r\n x-=1\r\n elif i==\"R\":\r\n x+=1\r\n elif i==\"U\":\r\n y+=1\r\n elif i==\"D\":\r\n y-=1\r\nprint(n-abs(x)-abs(y))", "num = input()\r\nsequence = input()\r\nright = 0\r\nleft = 0\r\nup = 0\r\ndown = 0\r\nfor i in sequence:\r\n if i == 'R':\r\n right+=1\r\n if i == 'L':\r\n left+=1\r\n if i == 'U':\r\n up+=1\r\n if i == 'D':\r\n down+=1\r\n\r\nprint((min(left,right)+min(up,down))*2)\r\n", "n=int(input())\r\ns=input()\r\nc=lambda i:s.count(i)\r\nprint(min(c('U'),c('D'))*2+min(c('L'),c('R'))*2)", "a=b=c=d=0\nn=int(input())\ndirection=input()\n#print(direction)\nfor dir in direction:\n if dir=='U':\n a+=1\n elif dir=='D':\n b+=1\n elif dir=='L':\n c+=1\n elif dir=='R':\n d+=1\nprint(min(a,b)*2+min(c,d)*2)\n\n\t\t\t \t \t\t \t\t\t\t\t \t \t \t", "n = int(input())\r\ns = input()\r\nans = 2 * (min(s.count(\"L\"), s.count(\"R\")) + min(s.count(\"U\"), s.count(\"D\")))\r\nprint(ans)", "a = int(input())\r\nb = input()\r\nU = b.count('U')\r\nD = b.count('D')\r\nL = b.count('L')\r\nR = b.count('R')\r\ncount = a - (max(U,D) - min(U,D))-(max(L,R) - min(L,R))\r\nprint(count)", "n = int(input())\r\n\r\nc = input()\r\n\r\nL,R,U,D = c.count('L'),c.count('R'),c.count('U'),c.count('D')\r\n\r\nr = 2* min(L,R) + 2*min(U,D)\r\nprint(r)", "n=int(input())\r\ns=input()\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n\tif s[i]==\"L\":\r\n\t\tx-=1\r\n\telif s[i]==\"R\":\r\n\t\tx+=1\r\n\telif s[i]==\"U\":\r\n\t\ty+=1\r\n\telif s[i]==\"D\":\r\n\t\ty-=1\r\nx=abs(x)\r\ny=abs(y)\r\nprint(n-x-y)", "n = int(input())\r\nl = 0\r\nr = 0\r\nu = 0\r\nd = 0\r\na = input()\r\nfor i in range(n):\r\n if a[i] == \"L\":\r\n l += 1\r\n elif a[i] == \"R\":\r\n r += 1\r\n elif a[i] == \"U\":\r\n u += 1\r\n elif a[i] == \"D\":\r\n d += 1\r\nprint(min(l, r) * 2 + min(u, d) * 2)\r\n", "n=int(input())\r\ne=list(input())\r\nl=len(e)\r\nL=e.count('L')\r\nR=e.count('R')\r\nU=e.count('U')\r\nD=e.count('D')\r\nif L>R or L<R:\r\n l=l-abs(L-R)\r\nif U>D or U<D:\r\n l=l-abs(U-D)\r\nprint(l)\r\n", "n=int(input())\r\ns=input()\r\nl,r,d,u=0,0,0,0\r\nfor i in range(n):\r\n if s[i]=='L':\r\n l+=1\r\n elif s[i]=='R':\r\n r+=1\r\n elif s[i]=='U':\r\n u+=1\r\n elif s[i]=='D':\r\n d+=1\r\n\r\nprint(2*min(l,r)+2*min(u,d))", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n s = input()\r\n counter = [0, 0, 0, 0]\r\n for i in s:\r\n if i == \"L\":\r\n counter[0] += 1\r\n elif i == \"R\":\r\n counter[1] += 1\r\n elif i == \"U\":\r\n counter[2] += 1\r\n else:\r\n counter[3] += 1\r\n print(2 * min(counter[0], counter[1]) + 2 * min(counter[2], counter[3]))\r\n\r\n\r\n\r\n\r\nmain_function()", "n = int(input())\r\nx = input()\r\n\r\nnx = 0\r\nny = 0\r\n\r\nfor i in range(len(x)):\r\n if(x[i] == \"R\"):\r\n nx += 1\r\n elif(x[i] == \"L\"):\r\n nx += -1\r\n elif(x[i] == \"U\"):\r\n ny += -1\r\n elif(x[i] == \"D\"):\r\n ny += 1\r\n\r\nny = abs(ny)\r\nnx = abs(nx)\r\n\r\nprint(n - nx - ny)\r\n", "#\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#\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 main():\r\n n = int(input())\r\n com = input().rstrip()\r\n aux = [0]*4 # 0-L, 1-R, 2-U, 3-D\r\n for i in com:\r\n if i == 'L':\r\n aux[0] += 1\r\n elif i == 'R':\r\n aux[1] += 1\r\n elif i == 'U':\r\n aux[2] += 1\r\n else:\r\n aux[3] += 1\r\n sideway = min(aux[0], aux[1])*2\r\n vertical = min(aux[2], aux[3])*2\r\n print(sideway+vertical)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "N = int(input())\r\nS = str(input())\r\nA = [0, 0]\r\nfor i in S:\r\n if i == 'U':\r\n A[1] += 1\r\n elif i == 'D':\r\n A[1] -= 1\r\n elif i == 'L':\r\n A[0] -= 1\r\n elif i == 'R':\r\n A[0] += 1\r\nwhile A != [0, 0]:\r\n if A[0] > 0:\r\n A[0] -= 1\r\n N -= 1\r\n elif A[0] < 0:\r\n A[0] += 1\r\n N -= 1\r\n elif A[1] > 0:\r\n A[1] -= 1\r\n N -= 1\r\n elif A[1] < 0:\r\n A[1] += 1\r\n N -= 1\r\nprint(N)\r\n\r\n\r\n", "m = input()\r\nn = str(input())\r\nl = 0\r\nu = 0\r\nr = 0\r\nd = 0\r\nfor i in range(len(n)):\r\n if n[i] == 'L':\r\n l += 1\r\n elif n[i] == 'U':\r\n u += 1\r\n elif n[i] == 'R':\r\n r += 1\r\n else:\r\n d += 1\r\nprint(2*min(l,r)+2*min(u,d))\r\n", "n=int(input())\r\nl=input()\r\nxs=0\r\nys=0\r\nprint(2*(min(l.count('U'),l.count('D'))+min(l.count('L'),l. count('R'))))\r\n", "n=int(input())\r\nc=input()\r\nx,y=0,0\r\nc_l=0\r\nc_r=0\r\nc_u=0\r\nc_d=0\r\nfor i in range(len(c)):\r\n\tif c[i]=='R':\r\n\t\tc_r+=1\r\n\tif c[i]=='L':\r\n\t\tc_l+=1\r\n\tif c[i]=='U':\r\n\t\tc_u+=1\r\n\tif c[i]=='D':\r\n\t\tc_d+=1\r\n\r\n\t\r\nprint(min(c_r,c_l)*2+min(c_u,c_d)*2)\r\n", "n = int(input())\r\ns = input()\r\nfrom collections import Counter\r\nX = Counter([i for i in s])\r\nprint(2*min(X['U'],X['D'])+2*min(X['L'],X['R']))", "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\nn=inp()\r\ns=input()\r\nx=0\r\ny=0\r\nfor i in s:\r\n if i==\"L\":\r\n x=x-1\r\n if i==\"R\":\r\n x=x+1\r\n if i ==\"D\":\r\n y=y-1\r\n if i ==\"U\":\r\n y=y+1\r\nprint(int(n-((y**2)**0.5)-(x**2)**0.5))\r\n", "a=int(input())\r\nb=input()\r\nl=b.count('L')\r\nr=b.count('R')\r\nu=b.count('U')\r\nd=b.count('D')\r\nprint(a-(abs(r-l)+abs(u-d)))", "from collections import Counter\r\nn = int(input())\r\nx = input()\r\np = Counter(x)\r\nans = 0\r\nif 'L' in p.keys() and 'R' in p.keys():\r\n ans = ans + min(p['L'],p['R'])\r\nif 'U' in p.keys() and 'D' in p.keys():\r\n ans = ans + min(p['D'],p['U'])\r\nprint(ans*2)\r\n", "n = int(input())\r\nlst = list(input())\r\nprint(2*(min(lst.count('U'), lst.count('D')) + min(lst.count('L'),lst.count('R'))))", "n = input() # just taking the input and ignoring it (trashing)\r\nletters = input().upper() # s_task 1 completed(get input)\r\n\r\nsteps_up = steps_down = steps_left = steps_right = 0 # s_task2 completed (Iitialised counter variable)\r\n\r\n# s_task3 iterating over\r\nfor dir in letters:\r\n if dir == \"U\":\r\n steps_up += 1\r\n elif dir == \"D\":\r\n steps_down += 1\r\n elif dir == \"L\":\r\n steps_left += 1\r\n else:\r\n steps_right += 1\r\n\r\n# s_task4 making the pairs with u to down and left to right\r\npairs_ud = min(steps_down, steps_up)*2\r\npairs_lr = min(steps_left, steps_right)*2\r\n\r\nsum = pairs_lr + pairs_ud\r\nprint(sum)", "n = int(input())\r\ns = input()\r\na = s.count('U')\r\nb = s.count('D')\r\nc = s.count('L')\r\nd = s.count('R')\r\n\r\nprint((min(a,b)+ min(c,d))*2)", "n, s = input(), input()\nprint((min(s.count('L'), s.count('R')) + min(s.count('D'), s.count('U'))) * 2)", "a = int(input())\r\nn = input()\r\n\r\nl=n.count('L')\r\nd=n.count('D')\r\nr=n.count('R')\r\nu=n.count('U')\r\nprint( min(l,r)*2+min(u,d)*2)\r\n\r\n", "#!/usr/bin/env python3\r\nU=L=R=D=ans=0\r\nn=int(input())\r\ns=str(input())\r\nfor i in range(len(s)):\r\n if s[i]=='L':\r\n L+=1\r\n elif s[i]=='R':\r\n R+=1\r\n elif s[i]=='U':\r\n U+=1\r\n else:\r\n D+=1\r\n\r\nans+=(min(L,R)*2)\r\nans+=(min(U,D)*2)\r\n\r\nprint(ans) \r\n\r\n ", "n=int(input())\r\na=list(input())\r\nx,y=0,0\r\nfor i in a:\r\n if i=='U':y+=1\r\n elif i=='D':y-=1\r\n elif i=='L':x-=1\r\n else: x+=1\r\nprint(n-abs(x)-abs(y))", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\n\r\n#import os\r\n#import sys\r\nfrom math import *\r\n#import re\r\n#import random\r\n#sys.set_int_max_str_digits(int(1e9))\r\n\r\nfrom collections import Counter\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n n = int(input())\r\n s = input()\r\n freq = Counter(list(s))\r\n print(2*(min(freq[\"L\"], freq[\"R\"]) + min(freq[\"D\"], freq[\"U\"])))\r\n \r\n \r\n\r\n\r\n\r\n\r\nsolve()\r\n\r\n", "n= int(input())\r\ns = input()\r\n\r\nx1 = s.count('L')\r\nx2 = s.count('R')\r\ny1 = s.count('D')\r\ny2 = s.count('U')\r\n\r\nr1 , r2 = 0 , 0\r\nif x1 != x2 :\r\n r1 = max(x1 , x2) - min(x1 , x2)\r\n\r\nif y1 != y2 :\r\n r2 = max(y1 , y2) - min(y1 , y2)\r\n\r\nk = r1 + r2\r\nprint(n - (k))\r\n", "_ = input();temp = input();print(min(temp.count('L'),temp.count('R'))*2+min(temp.count('U'),temp.count('D'))*2)\n\t\t\t \t\t\t \t \t\t \t \t \t \t \t\t\t\t\t\t", "input()\r\ni=input()\r\na=lambda c:i.count(c)\r\nprint(min(a('U'),a('D'))*2+min(a('L'),a('R'))*2)", "n=int(input())\r\nch=input()\r\na=2*(min(ch.count('L'),ch.count('R')))+2*(min(ch.count('U'),ch.count('D')))\r\nprint(a)", "input()\r\na= input()\r\nl=a.count(\"L\")\r\nr=a.count(\"R\")\r\nd=a.count(\"D\")\r\nU=a.count(\"U\")\r\nprint(min(l,r)*2+min(d,U)*2)", "a=int(input())\r\nb=list(input())\r\nl=b.count(\"L\")\r\nr=b.count(\"R\")\r\nu=b.count(\"U\")\r\nd=b.count(\"D\")\r\nprint(2*min(l,r)+2*min(u,d))", "# @name: D - Buggy Robot\n# @author: AbrarShakhi\n# @link: https://vjudge.net/contest/593770#problem/D\n\n\ndef solution():\n n = int(input())\n path = input()\n\n x, y, = 0, 0\n for p in path:\n if p == \"U\":\n y += 1\n elif p == \"D\":\n y -= 1\n elif p == \"L\":\n x += 1\n elif p == \"R\":\n x -= 1\n\n e = 0\n if x > 0:\n e += x\n elif x < 0:\n e += (x * -1)\n\n if y > 0:\n e += y\n elif y < 0:\n e += (y * -1)\n\n print(n - e)\n\n# endef\n\n\nclass Console:\n def asList(self, func=int, sep=\" \"):\n return [func(i) for i in input().split(sep)]\n\n def asIter(self, func=int, sep=\" \"):\n return map(func, input().split(sep))\n\n\ncin = Console()\ntc = 1\n# tc = int(input())\nwhile tc > 0:\n solution()\n tc -= 1\n\n \t \t\t \t \t\t \t\t \t \t", "n = int(input())\r\ns = input()\r\nx, y = 0, 0\r\nfor i in range(n):\r\n if s[i] == 'R':\r\n x+=1\r\n elif s[i] == 'L':\r\n x-=1\r\n elif s[i] == 'U':\r\n y+=1\r\n else:\r\n y-=1\r\nprint(n - abs(0-x) - abs(0-y))", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\ncnt = defaultdict(lambda : 0)\r\nfor i in s:\r\n cnt[i] += 1\r\nans = 2 * (min(cnt[\"R\"], cnt[\"L\"]) + min(cnt[\"U\"], cnt[\"D\"]))\r\nprint(ans)", "n=int(input())\r\nl=list(input())\r\nprint(int(2*(min(l.count(\"R\"),l.count(\"L\"))+min(l.count(\"D\"),l.count(\"U\")))))", "try:\r\n n = int(input())\r\n s = input()\r\n u = s.count(\"U\")\r\n r = s.count(\"R\")\r\n d = s.count(\"D\")\r\n l = s.count(\"L\")\r\n s = 2*min(r,l) + 2*min(u,d)\r\n print(s)\r\nexcept:\r\n pass", "n=int(input())\na = input()\nc = 0\nx=0\ny=0\nt=0\nfor t in range(len(a)):\n i=a[t]\n if i=='U':\n y+=1\n elif i=='D':\n y-=1\n elif i=='R':\n x+=1\n else:\n x-=1\n if x==0 and y==0:\n c = t+1\n \nprint(n-(abs(x)+abs(y)))\n \n \t\t \t \t \t \t \t \t\t\t \t\t\t\t\t\t", "n = int(input())\ns = str(input())\nu, d, l, r = 0, 0, 0, 0\nfor i in range(n):\n if s[i] == 'U':\n u += 1\n elif s[i] == 'D':\n d += 1\n elif s[i] == 'L':\n l += 1\n else:\n r += 1\nans = min(u, d)*2 + min(l, r)*2\nprint(ans)\n", "from sys import stdin\n\nn = int(stdin.readline())\nmoves = stdin.readline()\n\nlr = 0\nud = 0\n\nfor c in moves:\n if c == 'L':\n lr += 1\n if c == 'R':\n lr -=1\n if c == 'U':\n ud += 1\n if c == 'D':\n ud -=1\n\nprint(n - abs(lr) - abs(ud))\n\n \t\t\t\t \t\t\t\t\t \t \t\t\t \t", "n = int(input())\r\n\r\ns = input()\r\nr = 0\r\nu = 0\r\nfor i in s:\r\n if i == \"R\":\r\n r += 1\r\n elif i == \"L\":\r\n r -= 1\r\n elif i == \"U\":\r\n u += 1\r\n else:\r\n u -= 1\r\nprint(n-(abs(r)+abs(u)))\r\n", "import sys\r\nimport math\r\n#from queue import *\r\n#import random\r\n#sys.setrecursionlimit(int(1e6))\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\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############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn=inp()\r\ncommand=insr()\r\n\r\nx=0\r\ny=0\r\n\r\nfor i in range(n):\r\n\tcom=command[i]\r\n\tif com=='L':\r\n\t\tx-=1\r\n\telif com=='R':\r\n\t\tx+=1\r\n\telif com=='U':\r\n\t\ty+=1\r\n\telse:\r\n\t\ty-=1\r\n\r\nans=abs(x)+abs(y)\r\n\r\nprint(n-ans)\r\n", "n = int(input())\ns = input()\ndc = {'U':0,'D':0,'L':0,'R':0}\nfor char in s:\n dc[char] +=1\nprint(min(dc['L'],dc['R'])*2+min(dc['U'],dc['D'])*2)\n \t\t\t \t \t \t \t\t \t \t\t\t", "n = int(input())\ns = input()\nx, y = 0, 0\npos = []\nfor i in range(len(s)):\n\tif s[i] == 'U':\n\t\ty += 1\n\telif s[i] == 'D':\n\t\ty -= 1\n\telif s[i] == 'R':\n\t\tx += 1\n\telif s[i] == 'L':\n\t\tx -= 1\nz = abs(x) + abs(y)\nprint(n - z)\n\n", "n = int(input())\r\nseq = input()\r\nx, y = 0, 0\r\n\r\nfor s in seq:\r\n\tif s == \"U\":\r\n\t\ty += 1\r\n\telif s == \"D\":\r\n\t\ty -= 1\r\n\telif s == \"R\":\r\n\t\tx += 1\r\n\telif s == \"L\":\r\n\t\tx -= 1\r\n\r\nprint(n - (abs(x)+abs(y)))\r\n\t\r\n", "n=int(input())\r\ns=input()\r\na=s.count('L')\r\nb=s.count('R')\r\nc=s.count('U')\r\nd=s.count('D')\r\ne=min(a,b)\r\nf=min(c,d)\r\nprint((e+f)*2)\r\n", "import sys\n\nn = int(sys.stdin.readline())\ns = sys.stdin.readline().rstrip()\nu, r, d, l = s.count(\"U\"), s.count(\"R\"), s.count(\"D\"), s.count(\"L\")\nprint(n - (abs(u - d) + abs(r - l)))\n", "\n\n\nn = int(input())\nst = str(input())\nl,r,u,d= st.count('L'),st.count('R'),st.count('U'),st.count('D')\nans = 0\nif l>0 and r>0:\n if l>r:\n ans += r*2\n else:\n ans += l*2\nif u>0 and d>0:\n if u>d:\n ans += d*2\n else:\n ans += u*2\nprint(ans)\n \n", "input(); a = input()\nprint((min(a.count(\"R\"), a.count(\"L\")) + min(a.count(\"U\"), a.count(\"D\"))) * 2)", "n = int(input())\r\na = input()\r\nans = 0\r\nif a.count('L') >= a.count('R'):\r\n ans += a.count('R')\r\nelif a.count('L') <= a.count('R'):\r\n ans += a.count('L')\r\nif a.count('U') <= a.count('D'):\r\n ans += a.count('U')\r\nelif a.count('U') >= a.count('D'):\r\n ans += a.count('D')\r\nprint(2*ans)", "n=int(input())\r\ns=input()\r\nprint(2*(min(s.count('U'),s.count('D'))+min(s.count('R'),s.count('L'))))\r\n", "n = int(input())\n\n\nd = {}\nfor c in input():\n d.setdefault(c, 0)\n d[c] += 1\n\nans = min(d.get(\"L\", 0), d.get(\"R\", 0)) + min(d.get(\"U\", 0), d.get(\"D\", 0))\nprint(ans * 2)", "n = int(input())\r\ns = input()\r\nu = s.count('U')\r\nd = s.count('D')\r\nl = s.count('L')\r\nr = s.count('R')\r\nvert = min(u, d)\r\nhorz = min(r, l)\r\nprint((vert + horz)*2)\r\n", "I=lambda:map(int,input().split())\r\nn=int(input())\r\ns=input()\r\nf=-1\r\nl=[0,0]\r\nfor i in range(n):\r\n if s[i]=='L':l[0]-=1\r\n elif s[i]=='U':l[1]+=1\r\n elif s[i]=='D':l[1]-=1\r\n else:l[0]+=1\r\nprint(max(0,n-(abs(l[0])+abs(l[1]))))", "a = int(input())\r\nc = input()\r\nx = 0\r\ny = 0\r\nfor l in range(a):\r\n i = c[l]\r\n if i == 'U':\r\n y += 1\r\n elif i == 'L':\r\n x -= 1\r\n elif i == 'R':\r\n x +=1\r\n else:\r\n y -= 1\r\nprint(a-abs(x)-abs(y))", "#author : sanskarXrawat\r\nn=int(input())\r\ns=input() \r\nprint(2*(min(s.count('R'),s.count('L'))+min(s.count('D'),s.count('U'))))", "n=int(input())\r\na=input()\r\nuc=a.count(\"U\")\r\ndc=a.count(\"D\")\r\nlc=a.count(\"L\")\r\nrc=a.count(\"R\")\r\nprint(min(dc,uc)*2+min(lc,rc)*2)\r\n", "\r\nn = int(input())\r\nl = list(input())\r\n\r\nans = abs(l.count('L') - l.count('R')) + abs(l.count('U') - l.count('D'))\r\nprint(n - ans)", "n = int(input())\nst = input()\nans,x,y=0,0,0\nfor i in range(n):\n if st[i] == 'L': x-=1\n if st[i] == 'R': x+=1\n if st[i] == 'U': y+=1\n if st[i] == 'D': y-=1\n\nprint(n-abs(x)-abs(y))", "n = int(input())\nstring = input()\nparis = {'L':0 , 'R':0 , 'U':0 , 'D':0}\n\nfor i in string :\n paris[i] = paris.get(i,0) + 1 \n\nlr = min(paris['R'] , paris['L']) * 2\nud = min(paris['U'] , paris['D']) * 2 \n\nprint(lr+ ud)", "n = int(input())\r\ncommands = input()\r\n\r\ndx, dy = 0, 0\r\nfor command in commands:\r\n if command == 'U':\r\n dy += 1\r\n elif command == 'D':\r\n dy -= 1\r\n elif command == 'L':\r\n dx -= 1\r\n elif command == 'R':\r\n dx += 1\r\n\r\ndx, dy = abs(dx), abs(dy)\r\nprint(n-dx-dy)\r\n", "n = int(input())\r\nd = {'U': 0, 'D': 0, 'L': 0, 'R': 0}\r\ns = input()\r\nfor c in s:\r\n d[c] += 1\r\nprint(n - abs(d['U'] - d['D']) - abs(d['L'] - d['R']))\r\n", "#888B\r\nn = int(input())\r\ns = list(input())\r\ndef horizontal(s):\r\n lcount = s.count('L')\r\n rcount = s.count('R')\r\n if lcount != 0 and rcount != 0:\r\n return min(lcount, rcount)\r\n else:\r\n return 0\r\n\r\ndef vertical(s):\r\n ucount = s.count('U')\r\n dcount = s.count('D')\r\n if ucount != 0 and dcount != 0:\r\n return min(ucount, dcount)\r\n else:\r\n return 0\r\n\r\nif horizontal != 0 and vertical != 0:\r\n print(horizontal(s)*2 +vertical(s)*2)\r\nelse:\r\n print(0)\r\n ", "n = int(input())\r\ns = input()\r\nprint(n - (abs(s.count('R') - s.count('L')) + abs(s.count('U') - s.count('D'))))\r\n", "n = int(input())\ns = input()\nl = [0,0]\n\nfor x in s :\n\tif x == 'U' :\n\t\tl[1] += 1\n\telif x == 'D' :\n\t\tl[1] -= 1\n\telif x == 'L' :\n\t\tl[0] -= 1\n\telse :\n\t\tl[0] += 1\n\nprint(n-abs(l[0])-abs(l[1]))\n# 1513193172282\n", "n = int(input())\ns = input()\npos = [0, 0]\nans = [0, 0, 0, 0]\ns1 = 'UDLR'\nfor i in s:\n ans[s1.index(i)] += 1\n\nprint(2 * (min(ans[:2]) + min(ans[2:])))\n", "f=input()\r\na=[x for x in input()]\r\nl=a.count(\"L\")\r\nr=a.count(\"R\")\r\nu=a.count(\"U\")\r\nd=a.count(\"D\")\r\ndef min(*args):\r\n m=args[0]\r\n for i in args:\r\n if i<m:\r\n m=i\r\n return m\r\nprint(min(l,r)*2+min(u,d)*2)", "'''\r\n map(int,input().split()))\r\n'''\r\nn=int(input())\r\ns=input()\r\nprint(n-(abs(s.count('L')-s.count('R'))+abs(s.count('U')-s.count('D'))))\r\n", "n = int(input())\r\nR=0\r\nD=0\r\ns = input()\r\nfor x in range(n):\r\n if(s[x]=='L'): R-=1\r\n elif(s[x]=='U'): D-=1\r\n elif(s[x]=='R'): R+=1\r\n elif(s[x]=='D'): D+=1\r\n continue\r\n\r\nprint(n-abs(R)-abs(D))", "n = int(input())\ns = input()\nx = 0\ny = 0\nfor i in s:\n if i == 'U':\n x += 1\n if i == 'D':\n x -= 1\n if i == 'L':\n y -= 1\n if i == 'R':\n y += 1\nprint(n - (abs(x) + abs(y)))\n", "n = int(input())\r\na=input()\r\nx = 0\r\ny = 0\r\nfor i in range(n):\r\n if a[i]=='L':\r\n x-=1\r\n elif a[i]=='R':\r\n x+=1\r\n elif a[i]=='D':\r\n y-=1\r\n else:\r\n y+=1\r\nprint(n-abs(x)-abs(y))", "from collections import Counter\r\n_, a = input(), Counter(input())\r\nprint(min(a[\"L\"], a[\"R\"]) * 2 + min(a[\"U\"], a[\"D\"]) * 2)", "n = int(input())\ns = input()\na = 4 * [0]\nfor i in range(n):\n if s[i] == 'U':\n a[0] += 1\n elif s[i] == 'D':\n a[1] += 1\n elif s[i] == 'L':\n a[2] += 1\n elif s[i] == 'R':\n a[3] += 1\nprint(n - abs(a[0] - a[1]) - abs(a[2] - a[3]))\n", "#http://codeforces.com/contest/1157/problem/c2 kokuce\r\n#sad je ovaj http://codeforces.com/contest/888/problem/b\r\nn = int(input())\r\ns = input()\r\nl = s.count('L')\r\nd = s.count('D')\r\nu = s.count('U')\r\nr = s.count('R')\r\nlr = min(l, r)\r\nud = min(u, d)\r\nprint(2 * (lr + ud))\r\n", "from collections import Counter\r\n\r\nn=int(input())\r\ns=input().strip()\r\nz=Counter(s)\r\nprint(2*min(z['L'],z['R'])+2*min(z['U'],z['D']))", "from collections import defaultdict\r\nn = int(input())\r\ns = input()\r\ndd = defaultdict(int)\r\nans = 0\r\nfor x in s:\r\n dd[x] += 1\r\n\r\nif dd['U'] > 0 and dd['D'] > 0:\r\n ans = min(dd['U'], dd['D']) * 2\r\n\r\nif dd['L'] > 0 and dd['R'] > 0:\r\n ans += min(dd['L'], dd['R']) * 2\r\nprint(ans)\r\n", "def main(n,s):\r\n uds=True\r\n lrs=True\r\n s=list(s)\r\n while uds == True or lrs == True:\r\n if \"U\" in s and \"D\" in s:\r\n s.pop(s.index(\"U\"))\r\n s.pop(s.index(\"D\"))\r\n else:\r\n uds = False\r\n if \"L\" in s and \"R\" in s:\r\n s.pop(s.index(\"L\"))\r\n s.pop(s.index(\"R\"))\r\n else:\r\n lrs = False\r\n print(n-len(s))\r\n\r\nnum=int(input())\r\nmain(num,input())\r\n", "n = int(input())\r\ncommands = input()\r\n\r\ncurrent_x, current_y = 0, 0\r\nfor i in range(n):\r\n if commands[i] == \"U\":\r\n current_y += 1\r\n elif commands[i] == \"D\":\r\n current_y -= 1\r\n elif commands[i] == \"L\":\r\n current_x -= 1\r\n else:\r\n current_x += 1\r\n\r\nprint(n - (abs(current_y) + abs(current_x)))", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nc = Counter(s)\r\np = c['L']\r\nq = c['R']\r\nr = c['U']\r\ns = c['D']\r\nx = min(p,q)*2\r\ny = min(r,s)*2\r\nprint(x+y)", "N, X = int(input()), input()\r\nprint(N - (abs(X.count('L') - X.count('R')) + abs(X.count('U') - X.count('D'))))\r\n", "a = int(input())\r\nb = input()\r\n\r\ncount_L = b.count('L')\r\ncount_R = b.count('R')\r\ncount_U = b.count('U')\r\ncount_D = b.count('D')\r\n\r\nmin_horizontal = min(count_L, count_R)\r\nmin_vertical = min(count_U, count_D)\r\n\r\nresult = 2 * (min_horizontal + min_vertical)\r\nprint(result)\r\n", "n = int(input())\r\ns = str(input())\r\ncurr_x = 0\r\ncurr_y = 0\r\n\r\nfor i in s:\r\n if i == \"U\":\r\n curr_y += 1\r\n elif i == \"D\":\r\n curr_y -= 1\r\n elif i == \"L\":\r\n curr_x -= 1\r\n else:\r\n curr_x += 1\r\n\r\n\r\nres = abs(curr_x - 0) + abs(curr_y - 0)\r\nprint(n - res)", "def buggybot(n, commands):\r\n u=0\r\n d=0\r\n l=0\r\n r=0\r\n for i in range(n):\r\n if commands[i]==\"U\":\r\n u+=1\r\n if commands[i]==\"D\":\r\n d+=1\r\n if commands[i]==\"L\":\r\n l+=1\r\n if commands[i]==\"R\":\r\n r+=1\r\n v=abs(l-r)\r\n w=abs(u-d)\r\n return(n-v-w)\r\nprint(buggybot(int(input()),input()))", "n=int(input())\r\nl=input()\r\nc=0\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n if(l[i]=='L'):\r\n x=x-1\r\n elif(l[i]=='R'):\r\n x=x+1\r\n elif(l[i]=='U'):\r\n y=y+1\r\n elif(l[i]=='D'):\r\n y=y-1\r\nprint(n-abs(x)-abs(y))\r\n", "n = int(input())\r\ns = input()\r\ndx = {'L': -1, 'R':1}\r\ndy = {'U': 1, 'D': -1}\r\nx, y = 0, 0\r\nfor i in s:\r\n if i in 'LR':\r\n x += dx.get(i)\r\n else:\r\n y += dy.get(i)\r\nprint(n - abs(x) - abs(y))", "\n\nn = int(input())\n\nA = {\n 'L': 0,\n 'R': 0,\n 'D': 0,\n 'U': 0\n}\n\nfor x in input():\n A[x] += 1\n\nprint(n - abs(A['L'] - A['R']) - abs(A['D'] - A['U']))\n", "n = int(input())\r\na = input()\r\np,q,r,s = a.count(\"L\"),a.count(\"R\"),a.count(\"U\"),a.count(\"D\")\r\nprint(2*(min(p,q)+min(r,s)))\r\n\r\n", "x=int(input())\nst = input()\na=st.count(\"U\")\nb=st.count(\"D\")\nc=st.count(\"L\")\nd=st.count(\"R\")\nm=a-b\nn=c-d\nif m < 0:\n m=-m\nif n <0:\n n=-n\nprint(x-(m+n))\n \t \t \t \t \t\t \t \t\t", "from collections import Counter\n\nn, a = int(input()), Counter(input())\nres = 2 * (min(a[\"L\"], a[\"R\"]) + min(a[\"U\"], a[\"D\"]))\nprint(res)\n", "n=int(input())\r\ns=input()\r\nl=s.count(\"L\")\r\nu=s.count(\"U\")\r\nd=s.count(\"D\")\r\nr=s.count(\"R\")\r\nprint(2*min(l,r)+2*min(u,d))", "\r\nimport math\r\nfrom math import gcd,floor,sqrt,log\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): return x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (a*b)//gcd(a,b)\r\n\r\n\r\n\r\ndef solve():\r\n\tn = iin()\r\n\ts = sin()\r\n\tcount = {'R':0,'L':0,'U':0,'D':0}\r\n\t\r\n\ttemp = [0,0]\r\n\tfor i in s:\r\n\t\tcount[i]+=1\r\n\tdiff = abs(count['R']-count['L'])+abs(count['U']-count['D'])\r\n\tprint(n - diff)\r\n\t\r\n# t = iin()\r\nt = 1\r\nfor hula in range(t):\r\n\tsolve()\r\n\t", "n = int(input())\ns = input()\n\nU_moves = s.count('U')\nD_moves = s.count('D')\nL_moves = s.count('L')\nR_moves = s.count('R')\n\nprint(min(U_moves, D_moves) * 2 + min(L_moves, R_moves) * 2)\n\n", "n = int(input())\r\nc = list(input())\r\npx = 0\r\npy = 0\r\nfor i in c:\r\n if i == \"L\":\r\n px += 1\r\n elif i == \"R\":\r\n px -= 1\r\n elif i == \"U\":\r\n py += 1\r\n else:\r\n py -= 1\r\nprint(n - abs(px) - abs(py))\r\n", "x = int(input())\r\ny = input()\r\n\r\nR = L = U = D = 0\r\n\r\nfor z in y:\r\n if z == 'R':\r\n R += 1\r\n elif z == 'L':\r\n L += 1\r\n elif z == 'U':\r\n U += 1\r\n else:\r\n D += 1\r\nans = 0\r\nans += min(D, U) * 2\r\nans += min(R, L) * 2\r\nprint(ans)", "n = int(input())\r\ncommand = input()\r\nU_count = command.count('U')\r\nD_count = command.count('D')\r\nL_count = command.count('L')\r\nR_count = command.count('R')\r\nprint(2*min(U_count,D_count)+2*min(L_count,R_count))", "n =int(input())\r\ns = input()\r\nl = s.count('L')\r\nr= s.count('R')\r\nu =s.count('U')\r\nd= s.count('D')\r\nans= (2*min(u,d)+2*min(l,r))\r\nprint(ans)\r\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nn = int(input())\r\ns = str(input())\r\nans = min(s.count(\"U\"), s.count(\"D\"))\r\nans += min(s.count(\"L\"), s.count(\"R\"))\r\nprint(2*ans)\r\n", "n = int(input())\r\ns = input()\r\nl = s.count(\"L\")\r\nd = s.count(\"D\")\r\nu = s.count(\"U\")\r\nr = s.count(\"R\")\r\nprint((min(d, u) + min(l, r)) * 2)", "n=int(input())\r\na=input()\r\n\r\nl=0;r=0;u=0;d=0\r\n\r\nfor i in range(n):\r\n if a[i]=='L':\r\n l+=1;\r\n elif a[i]=='R':\r\n r+=1\r\n elif a[i]=='U':\r\n u+=1\r\n else:\r\n d+=1\r\n\r\nprint(min(l,r)*2+min(u,d)*2)", "dic = {\"U\": 0, \"D\": 0, \"L\": 0, \"R\": 0}\r\nn = int(input())\r\ns = input()\r\nfor i in s:\r\n dic[i] += 1\r\n\r\nprint(min(dic[\"U\"], dic[\"D\"]) * 2 + min(dic[\"L\"], dic[\"R\"]) * 2)\r\n", "n=int(input())\r\na=input()\r\nx=0\r\nprint((min(a.count('U'),a.count('D'))+min(a.count('L'),a.count('R')))*2)", "#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\ns = input()\r\nd = {'L': 0, 'R': 0, 'U': 0, 'D': 0}\r\nfor c in s: d[c] += 1\r\nprint(2*min(d['L'], d['R'])+2*min(d['U'], d['D']))", "n=int(input())\r\ns=input()\r\nprint(n-(abs(s.count(\"R\")-s.count(\"L\"))+abs(s.count(\"U\")-s.count(\"D\"))))", "n = int(input())\r\ns = input()\r\ncnt = {}\r\nfor x in s:\r\n cnt[x] = cnt.get(x, 0) + 1\r\nans = min(cnt.get('L', 0), cnt.get('R', 0)) + min(cnt.get('U', 0), cnt.get('D', 0))\r\nprint(ans * 2)", "input()\n\ns=input()\n\n\n\nprint((min(s.count('U'),s.count('D'))+min(s.count('L'),s.count('R')))*2)\n\n\n\n# Made By Mostafa_Khaled", "n=int(input())\ns=input()\ns=s.strip()\na=0\nb=0\n\nl=len(s)\nfor i in range(l):\n if (s[i]=='U'):\n a+=1\n \n if (s[i]=='D'):\n a+=-1\n \n if (s[i]=='L'):\n b-=1\n \n if (s[i]=='R'):\n b+=1\n \nprint(l-abs(b)-abs(a))\n \n", "# |\r\n# _` | __ \\ _` | __| _ \\ __ \\ _` | _` |\r\n# ( | | | ( | ( ( | | | ( | ( |\r\n# \\__,_| _| _| \\__,_| \\___| \\___/ _| _| \\__,_| \\__,_|\r\n\r\nimport sys\r\nimport math\r\nimport operator as op\r\nfrom functools import reduce\r\nfrom sys import maxsize \r\n\r\ndef read_line():\r\n\treturn sys.stdin.readline()[:-1]\r\n \r\ndef read_int():\r\n\treturn int(sys.stdin.readline())\r\n\t\r\ndef read_int_line():\r\n\treturn [int(v) for v in sys.stdin.readline().split()]\r\n\r\ndef read_float_line():\r\n\treturn [float(v) for v in sys.stdin.readline().split()]\r\n\r\ndef ncr(n, r):\r\n\tr = min(r, n-r)\r\n\tnumer = reduce(op.mul, range(n, n-r, -1), 1)\r\n\tdenom = reduce(op.mul, range(1, r+1), 1)\r\n\treturn numer / denom\r\n\r\ndef nc2(n):\r\n\treturn n*(n-1)//2\r\n\r\n# t = read_int()\r\nt = 1\r\nfor i in range(t):\r\n\tn = read_int()\r\n\ts = read_line()\r\n\td = {}\r\n\r\n\tfor i in s:\r\n\t\tif i in d:\r\n\t\t\td[i] += 1\r\n\t\telse:\r\n\t\t\td[i] = 1\r\n\r\n\tans = 0\r\n\tl = \"L\"\r\n\tr = \"R\"\r\n\r\n\ttry:\r\n\t\tlc = d[l]\r\n\t\trc =d[r]\r\n\texcept:\r\n\t\tlc = 0\r\n\t\trc = 0\r\n\r\n\tdiff1 = 2*min(lc,rc)\r\n\r\n\tu = \"U\"\r\n\tdo = \"D\"\r\n\r\n\ttry:\r\n\t\tuc = d[u]\r\n\t\tdc = d[do]\r\n\texcept:\r\n\t\tuc = 0\r\n\t\tdc = 0\r\n\r\n\tdiff2 = 2*min(uc,dc)\r\n\r\n\tans = diff1 + diff2\r\n\r\n\tprint(ans)\r\n\r\n", "from sys import stdin\r\nn = int(stdin.readline())\r\ns = stdin.readline()[:-1]\r\nprint(min(s.count('U'), s.count('D')) * 2 + min(s.count('L'), s.count('R')) * 2)", "i=input()\r\nj=input()\r\nu=j.count('U')\r\nd=j.count('D')\r\nl=j.count('L')\r\nr=j.count('R')\r\nans=2*(min(u,d)+min(l,r))\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nl=s.count('L')\r\nr=s.count('R')\r\nu=s.count('U')\r\nd=s.count('D')\r\nans=n-(abs(l-r)+abs(u-d))\r\nprint(ans)", "n=int(input())\r\nm=list(input())\r\na=m.count('U')\r\nb=m.count('D')\r\nc=m.count('L')\r\nd=m.count('R')\r\ne=min(a,b)*2\r\nf=min(c,d)*2\r\nprint(e+f)\r\n", "a = int(input())\r\nl = 0\r\nr = 0\r\nu = 0\r\nd = 0\r\nstr = input()\r\nfor i in range(len(str)):\r\n if str[i] == 'L':\r\n l+=1 \r\n if str[i] == 'R':\r\n r+=1\r\n if str[i] == 'U':\r\n u+=1\r\n if str[i] == 'D':\r\n d+=1\r\ntemp1 = min(l,r)\r\ntemp2 = min(u,d)\r\nprint(2*temp1 + 2*temp2)\r\n", "n = int(input())\ns = input()\n\ndef abs(x):\n if x >= 0:\n return x\n return -x\n\nl = r = u = d = 0\nfor c in s:\n if c == 'U':\n u += 1\n elif c == 'D':\n d += 1\n elif c == 'L':\n l += 1\n else:\n r += 1\nerr1 = abs(l-r)\nerr2 = abs(u-d)\nprint(n - err1 - err2)\n \t \t\t\t\t \t\t \t\t \t \t \t\t \t \t\t\t\t", "#!/usr/bin/env python3\r\nn=int(input())\r\ns=input()\r\nl=list(s)\r\nL,R,U,D=l.count('L'),l.count('R'),l.count('U'),l.count('D')\r\nprint((min(L,R)*2)+(min(U,D)*2))\r\n \r\n\r\n ", "n = input()\r\narr=input()\r\ndc={'U':0,'D':0,'L':0,'R':0}\r\nfor i in arr:\r\n dc[i]+=1\r\n\r\nprint (2* ( min(dc['U'],dc['D']) + min(dc['L'],dc['R']) ) )\r\n", "n = int(input())\r\ns = input()\r\nprint(2*min(s.count(\"R\"), s.count(\"L\")) + 2*min(s.count(\"U\"), s.count(\"D\")))", "n=input()\r\ns=input()\r\nprint(2*min(s.count('U'),s.count('D'))+2*min(s.count('R'),s.count('L')))", "N, Commands = int(input()), list(input())\r\nprint(2 * (min(Commands.count('L'),Commands.count('R')) + min(Commands.count('U'), Commands.count('D'))))", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nu = s.count('U')\r\nd = s.count('D')\r\nl = s.count('L')\r\nr = s.count('R')\r\n\r\nprint(n - abs(u-d) - abs(l-r))\r\n", "first_line = input()\ncommands = input()\nn = int(first_line)\n\nx_left = 0\nx_right = 0\ny_up = 0\ny_down = 0\n\nfor i in range(n):\n if(commands[i]==\"L\"):\n x_left += 1\n elif(commands[i]==\"R\"):\n x_right += 1\n elif(commands[i] == \"U\"):\n y_up += 1\n elif(commands[i] ==\"D\"):\n y_down += 1\n\nx = 0\ny = 0\nif(x_left < x_right):\n x = x_left * 2\nelif(x_left > x_right):\n x = x_right * 2\nelse:\n x = x_left + x_right\n\nif(y_down < y_up):\n y = y_down * 2\nelif(y_down > y_up):\n y = y_up * 2\nelse:\n y = y_down + y_up\n\n\nprint(x+y)\n \t \t \t \t\t\t\t \t\t\t\t\t\t \t\t", "n=int(input())\r\ntemp=input()\r\nL=temp.count('L')\r\nD=temp.count('D')\r\nU=temp.count('U')\r\nR=temp.count('R')\r\ns=2*min(L,R)+2*min(U,D)\r\nprint(s)\r\n", "n = input()\r\na = input()\r\nx = 0\r\ny = 0\r\nfor i in range(len(a)):\r\n if a[i] == \"U\":\r\n y += 1\r\n elif a[i] == \"D\":\r\n y -= 1\r\n elif a[i] == \"L\":\r\n x -= 1\r\n elif a[i] == \"R\":\r\n x += 1\r\nprint(len(a) - abs(x) - abs(y))\r\n", "x=int(input())\nn=input()\ncount=0\nl=n.count(\"L\")\nr=n.count(\"R\")\nu=n.count(\"U\")\nd=n.count(\"D\")\nif l<r:\n count=count+l*2\nelse:\n count=count+r*2\n\nif u<d:\n count=count+u*2\nelse:\n count=count+d*2\nprint(count) \n\n\n ", "n = int(input())\r\nA = list(input())\r\nu = 0\r\nd = 0\r\nl = 0\r\nr = 0\r\nfor i in range (0,n):\r\n if A[i] == \"U\":\r\n u+=1\r\n elif A[i] == \"D\":\r\n d+=1\r\n elif A[i] == \"L\":\r\n l+=1\r\n elif A[i] == \"R\":\r\n r+=1\r\nprint(2*min(u,d)+2*min(l,r))", "n = int(input())\ns = input()\nU = s.count('U')\nD = s.count('D')\nL = s.count('L')\nR = s.count('R')\nprint(n - abs(U - D) - abs(L - R))\n", "n=int(input())\r\ns=input()\r\nleft = 0\r\nright = 0\r\nup = 0\r\ndown = 0\r\n \r\nfor i in s:\r\n if i == \"U\":\r\n up += 1\r\n elif i == \"D\":\r\n down += 1\r\n elif i == \"L\":\r\n left += 1\r\n else:\r\n right += 1\r\n \r\nprint(2*min(left, right) + 2*min(up, down))", "int(input())\r\na=input()\r\nr,l,u,d=0,0,0,0\r\nfor _ in range(len(a)):\r\n if a[_]==\"R\":\r\n r=r+1\r\n if a[_] ==\"L\":\r\n l=l+1\r\n if a[_] ==\"U\":\r\n u=u+1\r\n if a[_] ==\"D\":\r\n d=d+1\r\n\r\n\r\nprint(len(a)-abs(l-r)- abs(u-d))\r\n", "# link: https://codeforces.com/problemset/problem/888/B\r\nif __name__ == \"__main__\":\r\n moves_count = int(input())\r\n moves = input()\r\n x = 0\r\n y = 0\r\n for direction in moves:\r\n if direction == 'U':\r\n y += 1\r\n elif direction == 'D':\r\n y -= 1\r\n elif direction == 'L':\r\n x -= 1\r\n else:\r\n x += 1\r\n if x==0 and y==0:\r\n print(moves_count)\r\n else:\r\n wrong_moves = abs(x) + abs(y)\r\n print(moves_count - wrong_moves) ", "n=int(input())\r\ns=input()\r\na=0\r\nb=0\r\nfor x in s:\r\n if x=='L':\r\n a+=1\r\n elif x=='R':\r\n a-=1\r\n elif x=='U':\r\n b+=1\r\n else:\r\n b-=1\r\n\r\ns=abs(a)+abs(b)\r\nprint(n-s)", "n = int(input())\r\ns = input()\r\nl,r,ans =0,0,0\r\nfor i in range(n):\r\n if s[i]=='U':\r\n r+=1\r\n elif s[i]=='D':\r\n r-=1\r\n elif s[i]=='L':\r\n l-=1\r\n elif s[i]=='R':\r\n l+=1\r\nprint(n-(abs(l)+abs(r)))", "n = int(input())\r\n\r\na = [c for c in input()]\r\n\r\ncR = sum([1 for i in a if i=='R'])\r\ncL = sum([1 for i in a if i=='L'])\r\ncU = sum([1 for i in a if i=='U'])\r\ncD = sum([1 for i in a if i=='D'])\r\n\r\nprint(min(cR, cL)*2+min(cU, cD)*2)\r\n", "a = int(input())\r\nb = str(input())\r\ncount = 0 \r\nL,R,D,U = b.count(\"L\"),b.count(\"R\"),b.count(\"D\"),b.count(\"U\")\r\n\r\nwhile True:\r\n if L > 0 and R > 0: count += 2; R -= 1; L -= 1 \r\n elif D > 0 and U > 0: count += 2; D -= 1; U -= 1\r\n else: break\r\n \r\nprint(count)\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\nn = int(input())\r\nstring = list(input())\r\nprint(min(string.count(\"U\"), string.count(\"D\")) * 2 + min(string.count(\"L\"), string.count(\"R\")) * 2)\r\n", "from sys import stdin,stdout\r\nfrom collections import Counter\r\ndef ai(): return list(map(int, stdin.readline().split()))\r\ndef ei(): return map(int, stdin.readline().split())\r\ndef ip(): return int(stdin.readline().strip())\r\ndef op(ans): return stdout.write(str(ans) + '\\n')\r\n\r\nn = ip()\r\ns = [i for i in input()]\r\ndx =dy= 0\r\nfor i in s:\r\n\tif i=='R':\r\n\t\tdx+=1\r\n\tif i=='L':\r\n\t\tdx -= 1\r\n\tif i=='U':\r\n\t\tdy += 1\r\n\tif i=='D':\r\n\t\tdy -= 1\r\nprint(n-abs(dx)-abs(dy))", "n = int(input())\r\nopers = list(input())\r\nnR = opers.count(\"R\")\r\nnL = opers.count(\"L\")\r\nnU = opers.count(\"U\")\r\nnD = opers.count(\"D\")\r\nopnum = 2 * (min(nL, nR) + min(nD, nU))\r\nprint(int(opnum))", "input()\ns=input()\nprint(2*(min(s.count(\"L\"),s.count(\"R\"))+min(s.count(\"U\"),s.count(\"D\"))))\n\n\t \t \t \t \t \t \t\t\t \t \t \t", "# reading inpute file\r\n\r\nnum_c = eval(input()) # number of commands\r\nc_arr = input() # sequences of commands\r\nl = 0\r\nr = 0\r\nd = 0\r\nu = 0\r\nfor i in range(0, num_c):\r\n if c_arr[i] == 'U':\r\n u += 1\r\n elif c_arr[i] == 'D':\r\n d += 1\r\n elif c_arr[i] == 'L':\r\n l += 1\r\n else:\r\n r += 1\r\n\r\n\r\nprint(2*((min(l, r)) + min(u, d)))\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\nx,y=0,0\r\nfor i in range (n):\r\n if s[i]=='U':\r\n y=y+1\r\n elif (s[i]=='D'):\r\n y=y-1\r\n elif s[i]=='R':\r\n x=x+1\r\n else:\r\n x=x-1\r\nprint(n-abs(x)-abs(y))\r\n", "n = int(input())\r\ns = str(input())\r\nans = 2*min(s.count(\"L\") , s.count(\"R\")) + 2*min(s.count(\"U\"), s.count(\"D\"))\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nif s.count('L')<=s.count('R'):\r\n if s.count('U')<=s.count('D'):\r\n print(s.count('L')*2+s.count('U')*2)\r\n else:\r\n print(s.count('L')*2+s.count('D')*2)\r\nelse:\r\n if s.count('U')<=s.count('D'):\r\n print(s.count('R')*2+s.count('U')*2)\r\n else:\r\n print(s.count('R')*2+s.count('D')*2)\r\n \r\n \r\n", "\t\t###~~~LOTA~~~###\r\na=int(input())\r\nb=input()\r\nu=0\r\nd=0\r\nr=0\r\nl=0\r\nfor i in range(a):\r\n\tv=b[i]\r\n\tif v=='U':\r\n\t\tu+=1\r\n\telif v=='D':\r\n\t\td+=1\r\n\telif v=='R':\r\n\t\tr+=1\r\n\telse:\r\n\t\tl+=1\r\nprint((2*min(l,r))+(2*min(u,d)))", "n = int(input())\r\nc = list(input())\r\ncmds = 0\r\nwhile True:\r\n f = True\r\n if c.count('L') > 0 and c.count('R') > 0:\r\n c.remove('L')\r\n c.remove('R')\r\n cmds += 2\r\n f = False\r\n if c.count('U') > 0 and c.count('D') > 0:\r\n c.remove('U')\r\n c.remove('D')\r\n cmds += 2 \r\n f = False\r\n if f:\r\n break\r\nprint(cmds)", "n = int(input())\r\ns = input()\r\n\r\nres = 0\r\nf = s.count\r\nres+=2*min(f('R'),f('L'))\r\nres+=2*min(f('U'),f('D'))\r\nprint(res)", "#888B (62No. Problem B)\r\n\r\nn = int(input())\r\nseq = input()\r\nl = seq.count('L')\r\nr = seq.count('R')\r\nu = seq.count('U')\r\nd = seq.count('D')\r\nsteps = 0\r\nif (l == r):\r\n steps+= l * 2\r\nelse:\r\n steps+= min(l,r) * 2\r\n\r\nif (u == d):\r\n steps+= u * 2\r\nelse:\r\n steps+= min(u,d) * 2\r\n\r\nprint(steps)\r\n\r\n", "n=int(input())\r\ninp=lambda:map(int,input().split())\r\ns=input()\r\nl=len(s)\r\nup=0\r\nright=0\r\n\r\nfor i in range(l):\r\n if(s[i]=='U'): \r\n up+=1\r\n if(s[i]=='D'): \r\n up-=1\r\n if(s[i]=='L'): \r\n right-=1\r\n if(s[i]=='R'): \r\n right+=1\r\n\r\nprint(l-abs(up)-abs(right))", "from collections import Counter\r\n\r\ninput()\r\nc = Counter(input())\r\n\r\nprint(2 * (min(c['U'],c['D']) + min(c['L'],c['R'])))", "input()\r\ni=input()\r\nC=lambda c:i.count(c)\r\nprint(min(C('U'),C('D'))*2+min(C('L'),C('R'))*2)", "def main():\n _, d = input(), {'L': 0, 'D': 0, 'U': 0, 'R': 0}\n for c in input():\n d[c] += 1\n print((min(d['L'], d['R']) + min(d['U'], d['D'])) * 2)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\ns=input()\r\na=s.count('L')\r\nb=s.count('R')\r\nc=s.count('U')\r\nd=s.count('D')\r\na=min(a,b)\r\nc=min(c,d)\r\n\r\nans=2*a + 2*c\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nl = 0\r\nr = 0\r\nu = 0\r\nd = 0\r\nfor i in range(n):\r\n if s[i] == 'L':\r\n l += 1\r\n elif s[i] == 'R':\r\n r += 1\r\n elif s[i] == 'U':\r\n u += 1\r\n else:\r\n d += 1\r\nprint((min(l, r) + min(u, d)) * 2)", "n = int(input())\r\ns = input()\r\na=[0]*(4)\r\nfor i in s:\r\n if i=='U':\r\n a[0]+=1\r\n elif i=='D':\r\n a[1]+=1\r\n elif i=='L':\r\n a[2]+=1\r\n else:\r\n a[3]+=1 \r\nans=2*min(a[0],a[1])+2*min(a[2],a[3])\r\nprint(ans) \r\n", "n=int(input())\r\nway=input()\r\nl=way.count('L')\r\nr=way.count('R')\r\nd=way.count('D')\r\nu=way.count('U')\r\nprint((min(l,r)+min(d,u))*2)\r\n", "n=int(input())\r\ns=input()\r\nprint((min(s.count('L'),s.count('R'))+min(s.count('U'),s.count('D')))*2)", "n=input();s=input()\r\nl=s.count(\"L\");r=s.count(\"R\")\r\nu=s.count(\"U\");d=s.count(\"D\")\r\nprint(min(l,r)*2 + min(u,d)*2)", "import sys,math\r\nfrom collections import defaultdict,Counter\r\ndef li(): return list(map(int,sys.stdin.readline().split()))\r\ndef ls(): return list(map(int,list(input())))\r\ndef la(): return list(input())\r\ndef ii(): return int(input())\r\nn = li()\r\ns = Counter(la())\r\nl = min(s[\"L\"],s[\"R\"])\r\nu = min(s[\"U\"],s[\"D\"])\r\nprint(2*l+2*u)", "int(input())\r\na=input()\r\nprint(2*(min(a.count('L'),a.count('R'))+ min(a.count('U'),a.count('D'))))\r\n", "n=int(input())\r\ns=input()\r\nprint(2*min(s.count('L'),s.count('R'))+2*min(s.count('D'),s.count('U')))", "def main():\n input()\n commands = input()\n right = commands.count('R')\n left = commands.count('L')\n up = commands.count('U')\n down = commands.count('D')\n\n result = right + left - abs(right - left) + up + down - abs(up - down)\n print(result)\n\n\nif __name__ == '__main__':\n main()\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, Mapping\r\nsys.setrecursionlimit(999999)\r\n\r\ninput()\r\ns = input()\r\ncs = collections.Counter(s)\r\nprint(2*min(cs['L'],cs['R'])+2*min(cs['U'],cs['D']))", "n = int(input())\nc = input()\n\nprint(2*min(c.count('L'),c.count('R')) + 2*min(c.count('U'),c.count('D')))\n", "n = int(input())\r\ncommands = list(input())\r\nup_count = 0\r\ndown_count = 0\r\nright_count = 0\r\nleft_count = 0\r\n\r\nfor command in commands:\r\n if command == 'U':\r\n up_count += 1\r\n elif command == 'D':\r\n down_count += 1\r\n elif command == 'R':\r\n right_count += 1\r\n else:\r\n left_count += 1\r\n\r\nprint(min(left_count, right_count)*2 + min(up_count, down_count)*2)\r\n\r\n\r\n\"\"\"\r\n4\r\nLDUR\r\n\r\n\"\"\"\r\n", "n = int(input())\r\ns = str(input())\r\nprint(n - abs((s.count('L')-s.count('R'))) - abs((s.count('U') - s.count('D'))))", "n=int(input())\r\nls=list(input())\r\na=[]\r\nb=[]\r\ncnt=0\r\nfor i in ls:\r\n if i=='U' or i=='D':\r\n if len(a)==0:\r\n a.append(i)\r\n else:\r\n if i==a[-1]:\r\n a.append(i)\r\n else:\r\n a.pop()\r\n cnt+=2\r\n if i=='L' or i=='R':\r\n if len(b)==0:\r\n b.append(i)\r\n else:\r\n if i==b[-1]:\r\n b.append(i)\r\n else:\r\n b.pop()\r\n cnt+=2\r\nprint(cnt)", "n = int(input())\r\n\r\ns = input()\r\n\r\nup = 0\r\nrgt = 0\r\n\r\nfor x in s:\r\n if x == 'U':\r\n up +=1\r\n elif x == 'D':\r\n up -= 1\r\n elif x == 'R':\r\n rgt += 1\r\n\r\n else:\r\n rgt -= 1\r\n\r\nprint(n-abs(up)-abs(rgt))\r\n", "from collections import Counter, defaultdict\r\nR = lambda: map(int, input().split())\r\nn, s = int(input()), input()\r\nct = Counter(s)\r\nprint(2 * min(ct.get('U', 0), ct.get('D', 0)) + 2 * min(ct.get('L', 0), ct.get('R', 0)))", "from collections import Counter\r\nn = int(input())\r\ns = input()\r\nmp = Counter()\r\nfor i in s:\r\n\tmp[i] += 1\r\nans = min(mp['R'], mp['L']) + min(mp['U'], mp['D']);\r\nprint(ans*2)", "#buggy robot\r\nimport math\r\nn = int(input())\r\ns = input()\r\ndp = [0,0,0,0]\r\nfor i in s:\r\n\tif i == \"L\":\r\n\t\tdp[0] += 1\r\n\telif i == \"R\":\r\n\t\tdp[1] += 1\r\n\telif i == \"U\":\r\n\t\tdp[2] += 1\r\n\telse:\r\n\t\tdp[3] += 1\r\n\r\nprint(2*(min(dp[0],dp[1])+min(dp[2],dp[3])))", "\r\nn = int(input())\r\na = list(input())\r\nx = y = 0\r\ncount = {}\r\nfor c in a:\r\n if c not in count:\r\n count[c] = 0\r\n count[c] += 1\r\nprint(2*(min(count.get('L', 0), count.get('R', 0)) + min(count.get('U', 0), count.get('D', 0))))\r\n", "def max_correct_commands(n, commands):\r\n count_U = 0\r\n count_D = 0\r\n count_L = 0\r\n count_R = 0\r\n\r\n for command in commands:\r\n if command == \"U\":\r\n count_U += 1\r\n elif command == \"D\":\r\n count_D += 1\r\n elif command == \"L\":\r\n count_L += 1\r\n elif command == \"R\":\r\n count_R += 1\r\n\r\n max_correct_U_D = min(count_U, count_D)\r\n max_correct_L_R = min(count_L, count_R)\r\n\r\n return 2 * (max_correct_U_D + max_correct_L_R)\r\n\r\n# Read input\r\nn = int(input())\r\ncommands = input().strip()\r\n\r\n# Calculate and print the maximum possible number of commands\r\nprint(max_correct_commands(n, commands))", "n = int(input())\r\ns = input()\r\nl_count = 0\r\nr_count = 0\r\nu_count = 0\r\nd_count = 0\r\nfor i in s:\r\n if i == \"L\":\r\n l_count+=1\r\n elif i == \"R\":\r\n r_count+=1\r\n elif i == \"U\":\r\n u_count+=1\r\n else:\r\n d_count+=1\r\ncount = 0\r\ncount+=abs(l_count - r_count)\r\ncount+=abs(u_count - d_count)\r\nprint(n - count)", "n = int(input())\r\ns = input()\r\nl = 0\r\nr = 0\r\nu = 0\r\nd = 0\r\ncount = 0\r\nfor i in s:\r\n if i == 'L':\r\n l = l+1\r\n if i == 'R':\r\n r = r+1\r\n if i == 'U':\r\n u = u+1\r\n if i == 'D':\r\n d = d+1\r\n\r\nif l>=r:\r\n count = 2*r\r\nelse:\r\n count = 2*l\r\nif u>=d:\r\n count = count+2*d\r\nelse:\r\n count = count+2*u\r\n\r\nprint(count)\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nl,r,u,d = 0, 0, 0, 0\r\nfor x in s:\r\n if x=='L': l+=1\r\n if x=='R': r+=1\r\n if x=='U': u+=1\r\n if x=='D': d+=1\r\nprint(min(l,r)*2 + min(u,d)*2)", "n = int(input())\r\n\r\ndaf = input()\r\n\r\ncu = daf.count('U')\r\ncd = daf.count('D')\r\ncl = daf.count('L')\r\ncr = daf.count('R')\r\n\r\nprint((min(cu, cd) + min(cl, cr)) * 2)\r\n", "#888B (62No. Problem B)\r\n\r\nn = int(input())\r\nseq = input()\r\nl = seq.count('L')\r\nr = seq.count('R')\r\nu = seq.count('U')\r\nd = seq.count('D')\r\nsteps = (min(l,r) + min(u,d)) * 2\r\nprint(steps)", "n, s, l, r, u, d = int(input()), input(), 0, 0, 0, 0\r\nfor x in s:\r\n if x == 'L': l += 1\r\n elif x == 'R': r += 1\r\n elif x == 'U': u += 1\r\n else: d += 1\r\nprint(n - abs(l - r) - abs(u - d))", "a = int(input())\r\ns=input()\r\nr,l,u,d=0,0,0,0\r\nres=0\r\nfor i in s:\r\n if i=='R':\r\n r+=1\r\n elif i=='L':\r\n l+=1\r\n elif i=='U':\r\n u+=1 \r\n elif i=='D':\r\n d+=1 \r\nres+=min(r,l)*2\r\nres+=min(u,d)*2\r\nprint(res)", "n = int(input())\r\ns = input()\r\n\r\nx = 0\r\ny = 0\r\nfor c in s:\r\n if (c=='U'):\r\n y -= 1\r\n if (c=='D'):\r\n y += 1\r\n if (c=='L'):\r\n x -= 1\r\n if (c=='R'):\r\n x += 1\r\n\r\nprint(n-abs(x)-abs(y))", "n=int(input())\r\ns=input()\r\nx=y=0 \r\nc=0\r\nmaxi=-1\r\nfor i in s:\r\n c+=1\r\n if i=='U':\r\n y+=1 \r\n elif i=='R':\r\n x+=1\r\n elif i=='D':\r\n y-=1\r\n elif i=='L':\r\n x-=1 \r\n if x==0 and y==0:\r\n maxi=max(maxi,c) \r\nprint(n-abs(x)-abs(y))", "n = int(input())\ns = input()\nans = 0\n\nl=0\nr=0\nu=0\nd=0\n\nfor i in range(0, n):\n\tif s[i] == 'L':\n\t\tl+=1\n\telif s[i] == 'R':\n\t\tr+=1\n\telif s[i] == 'U':\n\t\tu+=1\n\telse:\n\t\td+=1\n\nans = 2*min(l, r)\nans += 2*min(u, d)\nprint(ans)", "import math\r\nfrom sys import stdin\r\nnumber=int(stdin.readline())\r\nstring=stdin.readline()\r\noutput=0\r\nposition=[0,0]\r\ndef direction(d):\r\n global step\r\n global output\r\n if d==\"L\":\r\n position[0]-=1\r\n elif d==\"R\":\r\n position[0]+=1\r\n elif d==\"U\":\r\n position[1]+=1\r\n elif d==\"D\":\r\n position[1]-=1\r\nfor D in string:\r\n direction(D)\r\noutput=number-abs(position[0])-abs(position[1])\r\nprint(output)\r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(input())\r\nx1=a.count('L')\r\nx2=a.count('D')\r\nx3=a.count('U')\r\nx4=a.count('R')\r\nprint(2*min(x4,x1)+2*min(x2,x3))", "def main():\n n = int(input())\n s = input()\n print(2 * min(s.count('L'), s.count('R')) + 2 * min(s.count('U'), s.count('D')))\nmain()\n", "n=int(input())\r\ns=input()\r\nl,r,u,d=0,0,0,0\r\nfor c in s:\r\n if c=='L':\r\n l+=1\r\n elif c=='R':\r\n r+=1\r\n elif c=='U':\r\n u+=1\r\n elif c=='D':\r\n d+=1\r\nprint(2*min(l,r)+2*min(u,d))\r\n ", "n=int(input())\ns=str(input())\nx=min(s.count('R'),s.count('L'))\ny=min(s.count('U'),s.count('D'))\nprint(2*(x+y))\n\t\t\t \t \t\t\t\t \t\t \t\t\t \t \t", "n = int(input())\r\nx = input()\r\nl = x.count('L')\r\nr = x.count('R')\r\nd = x.count('D')\r\nu = x.count('U')\r\nprint(2*(min(l,r)+min(u,d)))", "# cook your dish here\r\n#import sys\r\n#sys.setrecursionlimit(10**9) \r\nll=lambda:map(int,input().split())\r\nt=lambda:int(input())\r\nss=lambda:input()\r\nlx=lambda x:map(int,input().split(x))\r\nyy=lambda:print(\"YES\")\r\nnn=lambda:print(\"NO\")\r\n\r\nfrom math import log10 ,log2,ceil,factorial as fac,gcd,inf,sqrt,log\r\n#from itertools import combinations_with_replacement as cs \r\n#from functools import reduce\r\nfrom bisect import bisect_right as br,bisect_left as bl\r\nfrom collections import Counter\r\n#from math import inf\r\n\r\n\r\nmod=10**9+7\r\n\r\n\r\n \r\n#for _ in range(t()):\r\ndef f():\r\n \r\n \r\n n=t()\r\n s=ss()\r\n\r\n p={'U':0,'D':0,'R':0,'L':0}\r\n\r\n for i in s:\r\n p[i]+=1\r\n\r\n #print(p)\r\n\r\n ans=0\r\n ans=2*(min(p['U'],p['D'])+min(p['R'],p['L']))\r\n print(ans)\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\nf()\r\n \r\n\r\n'''\r\n\r\n\r\n43\r\n \r\n'''\r\n", "n = int(input())\r\ns = input()\r\nU = D = L = R = 0\r\n\r\nfor let in s:\r\n if(let=='U'):\r\n U+=1\r\n elif(let=='D'):\r\n D+=1\r\n elif(let == 'L'):\r\n L+=1\r\n else:\r\n R+=1\r\n\r\nprint(min(L, R)*2 + min(U, D)*2)", "n=int(input())\r\ns=input()\r\nl,r,u,d=0,0,0,0\r\n\r\nfor i in s:\r\n if i==\"L\":\r\n l+=1\r\n elif i==\"R\":\r\n r+=1\r\n elif i==\"U\":\r\n u+=1\r\n else:\r\n d+=1\r\nprint(2*min(u,d)+2*min(l,r))", "n = int(input())\r\nc = input()\r\n\r\nx = 0\r\ny = 0\r\nfor i in c:\r\n\tif i == 'L':\r\n\t\tx -= 1\r\n\telif i == 'R':\r\n\t\tx += 1\r\n\telif i == 'U':\r\n\t\ty += 1\r\n\telse:\r\n\t\ty -= 1\r\n\t\r\nprint(n - (abs(x) + abs(y)))", "from sys import stdin, stdout\n\nn = int(stdin.readline().strip())\nls = stdin.readline().strip()\ncounts = {\n \"L\": 0,\n \"R\": 0,\n \"U\": 0,\n \"D\": 0,\n}\nfor i in range(n):\n counts[ls[i]] += 1\n\nans = 2 * (min(counts[\"L\"], counts[\"R\"]) + min(counts[\"U\"], counts[\"D\"]))\nstdout.write(\"%d\\n\" % ans)\n\n \t \t\t\t\t \t\t\t \t\t\t\t \t \t\t \t", "import math\r\nn = int(input())\r\ns = str(input())\r\nx = 0\r\ny = 0\r\nfor i in s:\r\n if i == 'U':\r\n y += 1\r\n elif i == 'D':\r\n y -= 1\r\n elif i == 'L':\r\n x -= 1\r\n else:\r\n x += 1\r\nprint(n - abs(x) - abs(y))", "n=int(input())\r\nstring=input()\r\nhash_map={\"L\":0,\"R\":0,\"U\":0,\"D\":0}\r\nfor val in string:\r\n hash_map[val]+=1\r\n\r\ndata1=max(0,abs(hash_map[\"L\"]-hash_map[\"R\"]))\r\ndata2=max(0,abs(hash_map[\"U\"]-hash_map[\"D\"]))\r\nprint(n-(data1+data2))\r\n", "n=input()\r\ns=input()\r\nprint((min(s.count('L'),s.count('R'))+min(s.count('D'),s.count('U')))*2)\r\n", "n = int(input())\r\ns = input()\r\nprint(n-(abs(s.count('L')-s.count('R'))+abs(s.count('U')-s.count('D'))))", "input()\r\nS = input()\r\nLDUR = [0] * 4\r\n\r\n\r\nfor c in S:\r\n if c == 'L':\r\n LDUR[0] += 1\r\n elif c == 'D':\r\n LDUR[1] += 1\r\n elif c == 'U':\r\n LDUR[2] += 1\r\n else:\r\n LDUR[3] += 1\r\n\r\nprint(2*min(LDUR[0], LDUR[3]) + 2*min(LDUR[2], LDUR[1]))" ]

[ "import math\r\n\r\nsize = int(input())\r\n\r\nmatrix = []\r\n\r\ndef ncr(x):\r\n if x>=2:\r\n y = math.factorial(x)\r\n y = y/((math.factorial(x-2))*2)\r\n return y\r\n else:\r\n return 0\r\n\r\n\r\nfor i in range(0,size):\r\n array = list(str(input()))\r\n matrix.append(array)\r\n\r\nrows = 0\r\ncols = 0\r\n\r\nfor i in range(0,size):\r\n buffer = 0\r\n for j in range(0,size):\r\n if matrix[i][j] == 'C':\r\n buffer += 1\r\n y = ncr(buffer)\r\n rows += y\r\n\r\n\r\nfor i in range(0,size):\r\n buffer = 0\r\n for j in range(0,size):\r\n if matrix[j][i] == 'C':\r\n buffer += 1\r\n y = ncr(buffer)\r\n cols += y\r\n\r\nprint(int(cols)+int(rows))\r\n\r\n", "n = int(input())\r\nrowCounts = [0] * n\r\ncolCounts = [0] * n\r\n\r\nfor i in range(n):\r\n cakeRow = input()\r\n for j in range(n):\r\n if cakeRow[j] == 'C':\r\n rowCounts[i] += 1\r\n colCounts[j] += 1\r\n\r\ntotalHappiness = 0\r\nfor i in range(n):\r\n totalHappiness += (rowCounts[i] - 1) * rowCounts[i] // 2\r\n totalHappiness += (colCounts[i] - 1) * colCounts[i] // 2\r\n\r\nprint(totalHappiness)", "def paresChocolate(matriz, n):\n res = 0\n for i in range(n):\n count = 0\n for j in range(n):\n if matriz[i][j] == 'C':\n count += 1\n res += (count * (count - 1)) // 2\n count = 0\n for j in range(n):\n if matriz[j][i] == 'C':\n count += 1\n res += (count * (count - 1)) // 2\n return res\n\n\nn = int(input())\nmatriz = []\nfor i in range(n):\n matriz.append(input())\nprint(paresChocolate(matriz, n))\n\n\t \t \t \t \t\t \t \t \t\t\t\t\t\t\t", "from math import factorial\nn = int(input())\na = []\nfor i in range(n):\n\ttemp = input()\n\ta.append(temp)\n\nr = [0]*n\nc = [0]*n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif a[i][j] == 'C':\n\t\t\tr[i] += 1\n\t\t\tc[j] += 1\n\nans = 0\ncomb = lambda x, y: factorial(x)//factorial(y)//factorial(x-y)\nfor (i, j) in zip(r, c):\n\tif i >= 2:\n\t\tans += comb(i, 2)\n\tif j >= 2:\n\t\tans += comb(j, 2)\nprint(ans)", "n = int(input())\r\ng = [None]*n\r\ncnt = 0\r\nfor i in range(n):\r\n g[i] = input()\r\n\r\nfor i in range(n):\r\n c_cnt = 0\r\n r_cnt = 0\r\n for j in range(n):\r\n if g[i][j] == 'C':\r\n r_cnt += 1\r\n if g[j][i] == 'C':\r\n c_cnt += 1\r\n cnt += (r_cnt * (r_cnt-1) // 2 if r_cnt > 1 else 0)\r\n cnt += (c_cnt * (c_cnt-1) // 2 if c_cnt > 1 else 0)\r\n\r\nprint(cnt)\r\n", "n = int(input())\r\ngrid = [input() for i in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n c = grid[i].count('C')\r\n ans += c * (c - 1) // 2\r\n c = 0\r\n for j in range(n):\r\n if grid[j][i] == 'C':\r\n c += 1\r\n ans += c * (c - 1) // 2\r\nprint(ans)", "def checkPosition(posI, posJ, cake):\n cnt = 0\n for j in range(posJ+1, len(cake)):\n if cake[posI][j] == 'C':\n cnt += 1\n for i in range(posI+1, len(cake)):\n if cake[i][posJ] == 'C':\n cnt += 1\n return cnt\n\nif __name__ == \"__main__\":\n n = int(input())\n cake = []\n for i in range(n):\n cake.append(list(input()))\n counter = 0\n for i in range(n):\n for j in range(n):\n if cake[i][j] == 'C':\n counter += checkPosition(i, j, cake)\n print(counter)\n \t\t \t\t \t\t\t\t \t \t \t\t \t", "N=int(input())\r\n \r\ncake=[ input() for x in range(N) ]\r\n \r\nacc=0\r\nfor l in cake:\r\n\tc=l.count('C')\r\n\tacc += c*(c-1)//2\r\n \r\nfor col in range(N):\r\n\tc=0\r\n\tfor l in range(N):\r\n\t\tif cake[l][col] == 'C':\r\n\t\t\tc+=1\r\n \r\n\tacc += c*(c-1)//2\r\n \r\nprint(acc)", "def solution(l1,n):\r\n i=0\r\n pairs=0\r\n while i<len(l1):\r\n j=0\r\n count=0\r\n while j<len(l1[i]):\r\n if l1[i][j]==\"C\":\r\n count+=1\r\n j+=1\r\n pairs+=int(count*(count-1)/2)\r\n i+=1\r\n i=0\r\n while i<len(l1):\r\n j=0\r\n count=0\r\n while j<len(l1[i]):\r\n if l1[j][i]==\"C\":\r\n count+=1\r\n j+=1\r\n pairs+=int(count*(count-1)/2)\r\n i+=1\r\n return pairs\r\n \r\ndef answer():\r\n n=int(input())\r\n \r\n l1=[]\r\n while n:\r\n l1.append(list(input()))\r\n n-=1\r\n print(solution(l1,n))\r\nanswer()", "def nC2(N): return N*(N-1)//2\r\n\r\nN = int(input())\r\nH = list(list(input()) for i in range(N))\r\nhappiness = sum(nC2(H[i].count('C')) for i in range(N))\r\nV = [[H[j][i] for j in range(N)] for i in range(N)]\r\nhappiness += sum(nC2(V[i].count('C')) for i in range(N))\r\nprint(happiness)", "n=int(input())\r\nrow=[0]*n \r\ncol=[0]*n \r\nfor i in range(n):\r\n s=input()\r\n row[i]=s.count('C')\r\n for i in range(n):\r\n if s[i]=='C':\r\n col[i]+=1 \r\nres=0\r\nfor i in row:\r\n if i>=2:\r\n res+=i*(i-1)//2\r\nfor i in col:\r\n if i>=2:\r\n res+=i*(i-1)//2\r\nprint(res)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n\nn = int(input())\na = [ 0 for i in range(n) ]\nans = 0\n\nfor i in range(n):\n str = input()\n m = 0\n\n for j in range(n):\n if str[j] == 'C':\n m += 1\n a[j] += 1\n ans += m*(m-1)\n\nstart = time.time()\n\nfor i in range(n):\n ans += a[i]*(a[i]-1)\n\nprint(ans//2)\nfinish = time.time()\n#print(finish - start)\n", "n = int(input())\r\ns = [\"\"] * n\r\nfor i in range(n):\r\n s[i] = input()\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i][j] == '.':\r\n continue\r\n for k in range(j + 1, n):\r\n if s[i][k] == 'C':\r\n ans += 1\r\n for k in range(i + 1, n):\r\n if s[k][j] == 'C':\r\n ans += 1\r\nprint(ans)", "a=int(input())\r\nc=[]\r\nd=[]\r\nk=0\r\nl=0\r\nfor i in range(a):\r\n c.append(input())\r\n if (c[i]).count('C')>1:\r\n d.append(c[i])\r\n for j in range(a):\r\n if d[0][l]=='C':\r\n d[0]=d[0][:l]+d[0][l+1:]\r\n k+=d[0].count('C')\r\n else:\r\n l+=1\r\n l=0 \r\n d=[] \r\nfor j in range(a):\r\n for i in range(a):\r\n d.append(c[i][j])\r\n for j in range(a):\r\n if d[l]=='C':\r\n d.pop(l)\r\n k+=d.count('C')\r\n else:\r\n l+=1\r\n l=0 \r\n d=[]\r\nprint(k) ", "n=int(input())\r\nvert=[0]*n\r\nttl=0\r\nfor i in range(n):\r\n s=input()\r\n c=s.count('C')\r\n ttl+=c*(c-1)//2\r\n for i in range(n):\r\n if s[i]=='C':\r\n vert[i]+=1\r\nprint(ttl+sum(i*(i-1)//2 for i in vert))", "# Input the side length of the cake\r\nn = int(input())\r\n\r\n# Initialize lists to count chocolates in rows and columns\r\nrow_count = [0] * n\r\ncol_count = [0] * n\r\n\r\n# Read the cake configuration and count chocolates in rows and columns\r\nfor i in range(n):\r\n row = input()\r\n for j in range(n):\r\n if row[j] == 'C':\r\n row_count[i] += 1\r\n col_count[j] += 1\r\n\r\n# Calculate the total happiness by counting pairs in rows and columns\r\nhappiness = 0\r\n\r\nfor i in range(n):\r\n if row_count[i] > 1:\r\n happiness += (row_count[i] * (row_count[i] - 1)) // 2\r\n\r\nfor j in range(n):\r\n if col_count[j] > 1:\r\n happiness += (col_count[j] * (col_count[j] - 1)) // 2\r\n\r\nprint(happiness)\r\n", "#!/usr/bin/env python3\n\nN = int(input())\ngrid = [input() for _ in range(N)]\n\nrows = [0 for _ in range(N)]\ncols = [0 for _ in range(N)]\n\nfor i in range(N):\n for j in range(N):\n if grid[i][j] == 'C':\n rows[i] += 1\n cols[j] += 1\n#\n\ndef blah(n):\n return n*(n-1)//2\n\ntotal = sum(map(blah, rows)) + sum(map(blah, cols))\nprint(total)\n", "n = int(input())\ncol_counter = []\n\nfor i in range(n):\n col_counter.append(0)\n\ntotal = 0\n\nfor row in range(n):\n row_count = 0\n a = input()\n for col in range(n):\n if a[col] == 'C':\n row_count += 1 \n col_counter[col] += 1\n total += row_count*(row_count - 1)/2\n\nfor i in range(n):\n total += col_counter[i]*(col_counter[i] - 1)/2\n\nprint(int(total))\n\n \t\t\t\t \t \t\t\t \t \t \t \t \t", "n=int(input())\r\nmat=[]\r\nrowc=0\r\nfor i in range(n):\r\n l=list(input())\r\n mat.append(l)\r\n z=l.count('C')\r\n rowc+=z*(z-1)//2\r\ncolc=0\r\nfor j in range(n):\r\n z=0\r\n for i in range(n):\r\n \r\n if mat[i][j]=='C':\r\n z+=1\r\n colc+=z*(z-1)//2\r\nprint(rowc+colc)", "from math import comb\r\nn = int(input())\r\na = [0] * 2 * n\r\nfor i in range(n):\r\n s = input()\r\n x = 0\r\n for j in range(n):\r\n if s[j] == 'C':\r\n x += 1\r\n a[j] += 1\r\n a[n + i] = x\r\nans = 0\r\nfor x in a:\r\n ans += comb(x, 2)\r\nprint(ans)", "def combinations(num):\r\n return (num*(num-1))//2\r\nn = int(input())\r\ncount = 0\r\narr = []\r\nfor i in range(n):\r\n s = input()\r\n count += combinations(s.count('C'))\r\n arr.append(s)\r\nfor i in range(n):\r\n counter = 0\r\n for j in range(n):\r\n if arr[j][i]=='C':\r\n counter += 1\r\n count += combinations(counter)\r\nprint(count)", "a= [0]*100; b= [0]*100 # this for solve the error will show list index out of range\r\nn = int(input())\r\nfor i in range(n):\r\n lis = input()\r\n for k in range(n):\r\n if lis[k] == 'C':\r\n a[i] += 1;b[k] += 1\r\ncounter = 0\r\nfor _ in a:\r\n counter +=_*(_ - 1) // 2\r\nfor _ in b:\r\n counter +=_*(_ - 1) // 2\r\nprint(counter)", "lst=[]\r\nb=0\r\nn=0\r\ns=0\r\nv=[100]\r\n\r\nz=int(input())\r\nfor x in range(z):\r\n c=list(map(str,input()))\r\n e=c.count('C')\r\n #s+=1\r\n \r\n lst.append(c)\r\n d=e-1\r\n while d>0:\r\n n+=d\r\n d-=1\r\n#print('n*n*n*n*n*',n)\r\n#print('lst=',lst)\r\n \r\nfor m in range(z):\r\n for a in lst:\r\n \r\n if a[m]=='C':\r\n s+=1\r\n \r\n# print('a',a)\r\n# print('m',m)\r\n# print('a[m]',a[m])\r\n# print('s=',s)\r\n# print('###################')\r\n\r\n \r\n r=s-1\r\n while r>0:\r\n n+=r\r\n r-=1\r\n \r\n # n+=sum(v)\r\n # print('sum(v)',sum(v))\r\n #print('nnnnn=',n)\r\n s=0\r\n\r\nprint(n) \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "import math\r\n\r\ndef c(n):\r\n x = n*(n-1)//2\r\n return x\r\n\r\nn = int(input())\r\na = [[1 for j in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == '.':\r\n a[i][j] = 0\r\nx = 0\r\nfor i in range(n):\r\n k = a[i].count(1)\r\n x += c(k)\r\nfor j in range(n):\r\n k = 0\r\n for i in range(n):\r\n if a[i][j] == 1:\r\n k += 1\r\n x += c(k)\r\nprint(x)", "def fact(n):\r\n res = 1\r\n for i in range(2,n+1):\r\n res *= i\r\n return res\r\n\r\ndef comb(n,r):\r\n if n < r:\r\n return 0\r\n return fact(n)/(fact(n-r)*fact(r))\r\n \r\n \r\nn = int(input())\r\ncop = n\r\ncake = []\r\nfor i in range(n):\r\n cake.append(input())\r\n\r\nrows = []\r\ncols = []\r\n\r\nfor i in range(n):\r\n rows.append(cake[i].count('C'))\r\n \r\nc = 0\r\nwhile cop>0:\r\n col = 0\r\n for i in range(n):\r\n if cake[i][c] == 'C':\r\n col += 1\r\n c += 1\r\n cop -= 1\r\n cols.append(col)\r\n \r\nresult = 0\r\nfor i in range(n):\r\n result += comb(rows[i],2)\r\n result += comb(cols[i],2)\r\nprint(int(result))", "n=int(input());r=[list(input()) for _ in range(n)];t=0\r\nfor i in range(n):\r\n a=r[i].count('C')\r\n b=len([j for j in range(n) if r[j][i]=='C'])\r\n t+=a*(a-1)//2+b*(b-1)//2\r\nprint(t)", "n = int(input())\narr = [list(input()) for i in range(n)]\nans = 0\nfor i in arr:\n\ts = 0\n\tfor j in i:\n\t\tif(j == 'C'):\n\t\t\ts+=1\n\tans += (s * (s-1))//2\nfor i in range(n):\n\ts = 0 \n\tfor j in range(n):\n\t\tif(arr[j][i] == 'C'):\n\t\t\ts+=1\n\tans += (s * (s -1 ))//2\nprint(ans)", "import math\r\nn = int(input())\r\nc = [ input() for i in range(n) ]\r\nans = 0\r\nfor i in range(n):\r\n k = 0\r\n for j in range(n):\r\n if c[i][j] == 'C': k+=1\r\n if k>1: ans += math.factorial(k) / (math.factorial(2) * math.factorial(k-2))\r\n\r\nfor j in range(n):\r\n k = 0\r\n for i in range(n):\r\n if c[i][j] == 'C': k+=1\r\n if k>1: ans += math.factorial(k) / (math.factorial(2) * math.factorial(k-2))\r\n\r\nprint (int(ans))\r\n", "n = int(input())\n\nr = 0\nstlpce = [0 for i in range(n)]\nfor i in range(n):\n line = input()\n riadok = 0\n for j, c in enumerate(line):\n if c == 'C':\n riadok += 1\n stlpce[j] += 1\n r += riadok * (riadok - 1) // 2\n\nfor stlpec in stlpce:\n r += stlpec * (stlpec - 1) // 2\n\nprint(r)\n", "a=int(input())\nb=[]\nfor i in range(a):\n b.append(input())\nsu=0\nfor i in range(a):\n c =0\n for j in range(a):\n if b[i][j]=='C':\n c+=1\n su+=c*(c-1)/2\n\nfor i in range(a):\n c=0\n for j in range(a):\n if b[j][i]=='C':\n c+=1\n su+=c*(c-1)/2\nprint(int(su))\n\n\n\n\t\t\t \t\t \t\t \t\t \t \t\t\t \t\t \t", "from itertools import product, chain\r\n\r\nn = int(input())\r\ncake = [list(input()) for _ in range(n)]\r\nchoc_row, choc_col = [0] * n, [0] * n\r\n\r\nfor r, c in product(range(n), repeat=2):\r\n if cake[r][c] == 'C':\r\n choc_row[r] += 1\r\n choc_col[c] += 1\r\n\r\nans = sum(c * (c - 1) // 2 for c in chain(choc_row, choc_col))\r\nprint(ans)\r\n", "\r\nn = int(input())\r\n\r\n\r\ndef main():\r\n count = 0\r\n t_cells = []\r\n\r\n# input portion\r\n for _ in range(n):\r\n cell = str(input())\r\n t_cells.append(list(cell))\r\n # print(t_cells)\r\n\r\n# number of adjacent 'C's in a row\r\n for j in range (0, n):\r\n pair = 0\r\n pair_1 = 0\r\n for i in range (0,n):\r\n if t_cells[j][i] == 'C':\r\n pair +=1\r\n\r\n# number of adjacent 'C's in a column\r\n if t_cells[i][j] == 'C':\r\n pair_1 +=1\r\n\r\n count += pair*(pair-1)/2 + pair_1*(pair_1-1)/2\r\n print (int(count))\r\n\r\n\r\nmain()", "n=int(input())\r\na=list()\r\nfor i in range(n):\r\n a.append(input())\r\nk=h=0\r\nfor i in range(n):\r\n for j in a[i]:\r\n if(j=='C'):\r\n h+=1\r\n k+=round(h*(h-1)/2)\r\n h=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(a[j][i]=='C'):\r\n h+=1\r\n k+=round(h*(h-1)/2)\r\n h=0\r\nprint(k)", "\n\nn = int(input())\n\nrows = []\n\nfor i in range(n):\n rows.append(input())\n\n\npairs = 0\n\nfor i in range(n):\n c = len([ch for ch in rows[i] if ch == 'C'])\n pairs += c * (c - 1) // 2\n\n\nfor i in range(n):\n c = 0\n for j in range(n):\n if rows[j][i] == 'C':\n c += 1\n pairs += c * (c - 1) // 2\n\nprint(pairs)\n", "def cake(lst):\r\n result = 0\r\n for i in range(len(lst)):\r\n for j in range(len(lst)):\r\n for z in range(j):\r\n if lst[i][j] == \"C\" and lst[i][z] == 'C':\r\n result += 1\r\n if lst[j][i] == \"C\" and lst[z][i] == \"C\":\r\n result += 1\r\n return result\r\n\r\n\r\nn = int(input())\r\na = [input() for x in range(n)]\r\nprint(cake(a))\r\n", "n = int(input())\r\nc = [[*input()] for _ in range(n)]\r\nans = 0\r\n\r\nfor i in c:\r\n\tt = i.count('C')\r\n\tans += (t * (t - 1)) // 2\r\n\r\nfor i in [*zip(*c)]:\r\n\tt = i.count('C')\r\n\tans += (t * (t - 1)) // 2\r\n\r\nprint(ans)", "from math import factorial\r\nhat = int(input())\r\nlst = []\r\nms2ala = []\r\ntotal = 0\r\nfor i in range(hat):\r\n ms2ala.append(list(input()))\r\nfor i in range(hat):\r\n row = 0\r\n column = 0\r\n for j in range(hat):\r\n if ms2ala[i][j] == \"C\":\r\n row += 1\r\n if ms2ala[j][i] == \"C\":\r\n column += 1\r\n lst.append(row)\r\n lst.append(column)\r\n\r\nfor i in lst:\r\n total += (i*(i-1))/2\r\nprint(int(total))\r\n", "from math import factorial\r\nn = int(input())\r\nmatrix_1 = []\r\nmatrix_2 = []\r\nfor i in range(n):\r\n add = list(input())\r\n matrix_1.append(add)\r\n matrix_2.append(add)\r\nmatrix_2 = list(zip(*matrix_2))\r\n\r\nans = 0\r\nfor i in range(n):\r\n n_1 = len(list(filter(lambda x: x == \"C\", matrix_1[i])))\r\n n_2 = len(list(filter(lambda x: x == \"C\", matrix_2[i])))\r\n if n_1 > 1:\r\n ans += factorial(n_1) // (factorial(n_1 - 2) * 2)\r\n if n_2 > 1:\r\n ans += factorial(n_2) // (factorial(n_2 - 2) * 2)\r\n\r\nprint(ans)", "x,n,s=[],0,0\r\nfor i in range(int(input())):\r\n\ttemp=input()\r\n\tx.append(temp)\r\n\tn=temp.count(\"C\")\r\n\tif(n>1):\r\n\t\ts=s+(n*(n-1)//2)\r\nm=0\r\nfor i in range(len(x)):\r\n\tfor j in x:\r\n\t\tif j[i]==\"C\":\r\n\t\t\tm+=1\r\n\tif m>1:\r\n\t\ts=s+(m*(m-1)//2)\r\n\tm=0\r\nprint(s)", "readInts=lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\ng = []\r\nfor i in range(n):\r\n g+=[input()]\r\nret = 0\r\nfor i in range(n):\r\n cnt = g[i].count('C')\r\n ret += cnt*(cnt-1)//2\r\nfor j in range(n):\r\n cnt = 0\r\n for i in range(n):\r\n cnt += g[i][j] == 'C'\r\n ret += cnt*(cnt-1)//2\r\n\r\nprint(ret)\r\n", "from math import factorial as f\n\nn = int(input())\n\ndef bc(x : int, y : int):\n\treturn (f(x)/(f(y)*f(x-y)))\n\nhappiness = 0\ncake = [0] * n\nfor i in range(n):\n\trow = input()\n\tcount = 0\n\tfor j in range(n):\n\t\tif row[j] == 'C':\n\t\t\tcount += 1\n\t\t\tcake[j] += 1\n\tif count >= 2:\n\t\thappiness += bc(count, 2)\n\nfor c in cake:\n\tif c >= 2:\n\t\thappiness += bc(c, 2)\n\nprint(int(happiness))\n", "n = int(input())\r\nres = 0\r\nrow = [0 for i in range(n)]\r\ncol = [0 for i in range(n)]\r\na = [list(input()) for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == \"C\":\r\n row[i] += 1\r\n col[j] += 1\r\n\r\nfor i in range(n):\r\n res += max(0, (row[i])*(row[i]-1)//2)\r\n res += max(0, (col[i])*(col[i]-1)//2)\r\nprint(res)\r\n", "from collections import Counter\r\n\r\n\r\ndef process(chocolates):\r\n rows = Counter(row for row, col in chocolates)\r\n cols = Counter(col for row, col in chocolates)\r\n return (sum((k*(k-1))//2 for k in rows.values())\r\n + sum((k*(k-1))//2 for k in cols.values()))\r\n\r\n\r\ndef get_input():\r\n n = int(input())\r\n return [(r, c) for r in range(n)\r\n for c, ch in enumerate(input())\r\n if ch == 'C']\r\n\r\n\r\nif __name__ == '__main__':\r\n chocolates = get_input()\r\n print(process(chocolates))", "n = int(input())\na = []\nans = 0\nfor _ in range(n):\n s = input().strip()\n a.append(s)\n tmp = sum([1 if i == 'C' else 0 for i in s]) \n ans += (tmp*(tmp-1))//2\nfor i in range(n):\n tmp = sum([1 if a[j][i] == 'C' else 0 for j in range(n)])\n ans += (tmp*(tmp-1))//2\nprint(ans)\n", "n = int(input())\r\nm = [list(input()) for _ in range(n)]\r\nrs = [0 for _ in range(n)]\r\ncs = [0 for _ in range(n)]\r\n\r\nfor r in range(n):\r\n for c in range(n):\r\n if m[r][c] == 'C':\r\n rs[r] += 1\r\n cs[c] += 1\r\n\r\nret = 0\r\n\r\nfor r in rs:\r\n if r > 1:\r\n ret += r * (r - 1)\r\n\r\nfor c in cs:\r\n if c > 1:\r\n ret += c * (c - 1)\r\n\r\nprint(ret >> 1)", "import math\r\n\r\nn = int(input())\r\na = [[c=='C' for c in input()] for i in range(n)]\r\nb = [sum(a[i]) for i in range(n)]\r\nc = [sum(a[i][j] for i in range(n)) for j in range(n)]\r\n\r\nprint(sum((k*(k-1)//2) for k in b)+sum((k*(k-1)//2) for k in c))\r\n\r\n\r\n ", "n = int(input())\n\nc = [list(input()) for i in range(n)]\n\nans = 0\n\nfor i in range(n):\n t = c[i].count('C')\n ans += t*(t-1)//2\n\nc = list(zip(*c))\n\nfor i in range(n):\n t = c[i].count('C')\n ans += t*(t-1)//2\n\nprint(ans)\n", "x=int(input())\r\nsum=0\r\nl=[[*input()] for _ in range(x)]\r\nfor i in range(x):\r\n tmp=l[i].count('C')\r\n sum+=tmp*(tmp-1)//2\r\nl=list(zip(*l))\r\nfor i in range(x):\r\n tmp = l[i].count('C')\r\n sum += tmp * (tmp - 1) // 2\r\nprint(sum)\r\n", "def count(matrix):\n global l\n for i in range(len(matrix)):\n sum=0\n for j in range(len(matrix)):\n if(matrix[j][i]==\"C\"):\n sum+=1\n l.append(sum)\nn=int(input())\nl=[]\ninp=[]\nfor i in range(n):\n a=input().strip()\n inp.append(a)\n x=a.count(\"C\")\n l.append(x)\ncount(inp)\nfinal=0\nfor i in l:\n final+=i*(i-1)//2\nprint(final)\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\ndc, res = defaultdict(int), 0\r\nfor i in range(n):\r\n line = input()\r\n for j, c in enumerate(line):\r\n if c == 'C': dc[j] += 1\r\n x = line.count(\"C\")\r\n res += x*(x-1) // 2\r\n\r\nres += sum(x*(x-1) // 2 for x in dc.values())\r\nprint(res)\r\n", "l=[]\r\nn=int(input())\r\nfor i in range(n):\r\n l.append([0]*n)\r\n \r\nfor i in range(n):\r\n for row,d in enumerate(input()):\r\n l[i][row]=d\r\n \r\ncount=0\r\nfor i in range(n):\r\n x=0\r\n for j in range(n): \r\n if l[i][j] is 'C':\r\n x+=1\r\n x=x*(x-1)/2\r\n count+=x\r\n\r\nfor i in range(n):\r\n x=0\r\n for j in range(n): \r\n if l[j][i] is 'C':\r\n x+=1\r\n x=x*(x-1)/2\r\n count+=x\r\nprint(int(count))", "n = int(input())\r\na = []\r\nfor _ in range(n):\r\n a.append(input())\r\nb = []\r\nfor i in range(n):\r\n b.append(\"\".join(a[j][i] for j in range(n)))\r\nans = sum((a[i].count(\"C\")*(a[i].count(\"C\")-1))//2 for i in range(n))\r\nans += sum((b[i].count(\"C\")*(b[i].count(\"C\")-1))//2 for i in range(n))\r\nprint(ans)\r\n", "from math import factorial\n\ndef comb(n, r): \n if r > n: \n return 0\n return (factorial(n)) // (factorial(r)*factorial(n-r))\n\nn = int(input())\n\ncake = []\n\nfor i in range(n): \n cake.append(input())\n\nrows = [0 for _ in range(n)]\ncols = [0 for _ in range(n)]\n\nfor i in range(n): \n count = 0\n for j in range(n): \n if cake[i][j] == \"C\": \n rows[i] += 1\n cols[j] += 1\nres = 0\n\nfor i in range(n): \n res += comb(rows[i], 2)\n res += comb(cols[i], 2)\nprint(res)\n\n", "n = int(input())\r\nsm = 0\r\nv = [0 for x in range(n)]\r\nfor i in range(n):\r\n a = input()\r\n #a = a.split()\r\n #a = [int(x) for x in a]\r\n # x2, y2 = a\r\n c = a.count('C')\r\n sm += c * (c-1) // 2\r\n for j in range (n):\r\n if a[j] == 'C':\r\n v[j] += 1\r\n\r\n\r\nfor i in v:\r\n sm += i * (i-1) // 2\r\n\r\nprint(sm)", "import math\n\nn = int(input())\nbolo = []\nfor i in range(n):\n row = input()\n bolo.append(row)\n\nrows = [0] * n\ncolumns = [0] * n\n\nfor j in range(n):\n for k in range(n):\n if bolo[j][k] == 'C':\n rows[j] += 1\n columns[k] += 1\n\nacc = 0\nfor i in range(len(rows)):\n acc += math.comb(rows[i], 2)\nfor i in range(len(columns)):\n acc += math.comb(columns[i], 2)\nprint(acc)\n\n \t\t \t \t \t\t\t\t \t \t \t \t \t\t", "n = int(input())\r\nm = []\r\nfor _ in range(n):\r\n m.append(input())\r\nans = 0\r\n# row\r\nfor i in range(n):\r\n cnt = 0\r\n for j in range(n):\r\n if m[i][j] == 'C':\r\n cnt += 1\r\n ans += cnt * (cnt - 1) // 2\r\n# col\r\nfor i in range(n):\r\n cnt = 0\r\n for j in range(n):\r\n if m[j][i] == 'C':\r\n cnt += 1\r\n ans += cnt * (cnt - 1) // 2\r\nprint(ans)", "n = int(input())\r\nm = []\r\nfor _ in range(n):\r\n m.append(input())\r\nans = 0\r\n# row\r\nfor i in range(n):\r\n k = m[i].count('C')\r\n ans += k * (k - 1) // 2\r\n# col\r\nfor j in range(n):\r\n cnt = 0\r\n for i in range(n):\r\n if m[i][j] == 'C':\r\n cnt += 1\r\n ans += cnt * (cnt - 1) // 2\r\nprint(ans)", "n = int(input())\r\nk = [[[(1 if i=='C' else 0) for i in j] for j in input().split()][0] for _ in range(n)]\r\ndef comb(x):\r\n return x * (x-1) // 2\r\nj = [[] for _ in range(n)]\r\nfor i in range(n):\r\n for z in range(n):\r\n j[i].append(k[z][i])\r\nprint(sum([comb(z.count(1)) for z in k]) + sum([comb(z.count(1)) for z in j]))\r\n", "n = int(input())\nM = [[c == 'C' for c in input()] for i in range(n)]\nK = [sum(M[i]) for i in range(n)]\nL = [sum(M[i][j] for i in range(n)) for j in range(n)]\nans = sum(k*(k-1)//2 for k in K) + sum(l*(l-1)//2 for l in L)\nprint(ans)\n", "n = int(input())\r\nm = []\r\nfor _ in range(n):\r\n m.append(input())\r\nans = 0\r\n# row\r\nfor i in range(n):\r\n cnt = m[i].count('C')\r\n ans += cnt * (cnt - 1) // 2\r\n# col\r\nfor i in range(n):\r\n cnt = [row[i] for row in m].count('C')\r\n ans += cnt * (cnt - 1) // 2\r\nprint(ans)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\nt=0\r\nfor i in range(n):\r\n b=a[i].count(\"C\")\r\n t+=(b*(b-1))//2\r\nfor i in range(n):\r\n s=0\r\n for j in range(n):\r\n if a[j][i]==\"C\":\r\n s+=1\r\n t+=(s*(s-1))//2\r\nprint(t)", "n = int(input())\r\n\r\nM = []\r\nfor i in range(n):\r\n M += [input()]\r\n \r\nans = 0\r\nfor i in range(n):\r\n c, r = 0, 0\r\n for j in range(n):\r\n if M[i][j] == 'C':\r\n c += 1\r\n if M[j][i] == 'C':\r\n r += 1\r\n if c > 1:\r\n ans += c * (c - 1) // 2\r\n if r > 1:\r\n ans += r * (r - 1) // 2\r\n \r\nprint(ans)", "from math import factorial\r\nn = int(input())\r\ncake = []\r\nfor _ in range(n):\r\n cakeLine = []\r\n for i in (input().replace('.', '0').replace('C', '1')):\r\n cakeLine.append(int(i))\r\n cake.append(cakeLine)\r\n\r\nlines = []\r\nfor i in range(n):\r\n lines.append(sum(cake[i]))\r\n lines.append(sum(list(zip(*cake))[i]))\r\n\r\na = 0\r\nfor i in lines:\r\n if i > 1:\r\n a += factorial(i) / (factorial(i-2) * 2)\r\n\r\nprint(int(a))\r\n", "from functools import lru_cache\n\nside_length = int(input())\n\nboard = []\n\nfor row_idx in range(side_length):\n row = [cell == 'C' for cell in input()]\n board.append(row)\n\n\n@lru_cache()\ndef factorial(n):\n if n == 0:\n return 1\n else:\n return n * factorial(n - 1)\n\n\ndef num_combinations(n, r):\n if r > n:\n return 0\n return factorial(n) / (factorial(r) * factorial(n - r))\n\nn = side_length\n\nrealsum = 0\nfor i in range(n):\n sum1 = 0\n sum2 = 0\n for j in range(n):\n sum1 += int(board[i][j])\n sum2 += int(board[j][i])\n realsum += num_combinations(sum1, 2) + num_combinations(sum2, 2)\n\nprint(int(realsum))", "n=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n\tl.append(list(input()))\r\nfor i in range(n):\r\n\tfor j in range(n-1):\r\n\t\tfor k in range(j+1,n):\r\n\t\t\tif(l[i][j]==l[i][k]==\"C\"):\r\n\t\t\t\tc+=1\r\nfor i in range(n):\r\n\tfor j in range(n-1):\r\n\t\tfor k in range(j+1,n):\r\n\t\t\tif(l[j][i]==l[k][i]==\"C\"):\r\n\t\t\t\tc+=1\r\nprint(c)", "n = int(input())\n\nmap_ = [[] for i in range(n + 1)]\n\nfor i in range(n):\n\tmap_[i] = list(input())\n\nrow_cnt = [0 for i in range(n + 1)]\ncol_cnt = [0 for i in range(n + 1)]\n\nfor i in range(n):\n\tfor j in range(n):\n\t\trow_cnt[i] += map_[i][j] == 'C'\n\t\tcol_cnt[j] += map_[i][j] == 'C'\n\nans = 0\nfor i in range(n):\n\tans += row_cnt[i] * (row_cnt[i] - 1) // 2\n\tans += col_cnt[i] * (col_cnt[i] - 1) // 2\n\nprint(ans)", "n = int(input())\r\nr = 0\r\nc = 0\r\nrows = [0]*n\r\ncols = [0]*n\r\nfor i in range(n):\r\n st = input()\r\n rows[i] += st.count('C')\r\n for j in range(n):\r\n cols[j] += int(st[j] == 'C')\r\nprint(sum([row*(row-1)//2 for row in rows if row > 0]) + sum([col*(col-1)//2 for col in cols if col > 0]))\r\n", "from math import factorial\r\n\r\n\r\ndef numbers(n):\r\n k = 2\r\n return factorial(n) / (factorial(k) * factorial((n - k)))\r\n\r\n\r\nnum = 0\r\nn = int(input())\r\narray = [0] * n\r\n\r\n\r\nfor enumeration in range(n):\r\n string = input()\r\n counter = string.count('C')\r\n if counter > 1:\r\n num += numbers(counter)\r\n\r\n for i in range(len(string)):\r\n if string[i] == 'C':\r\n array[i] += 1\r\n\r\narray = [numbers(x) for x in array if x > 1]\r\nprint(int(num + sum(array)))\r\n\r\n", "n = int(input())\npares = 0\nbolo = []\n\nfor i in range(n):\n camada = input()\n bolo.append(camada)\n\nfor i in range(n):\n contador = 0\n for j in range(n):\n if bolo[i][j] == 'C':\n contador += 1\n pares += ((contador*(contador-1))//2)\n\nfor j in range(n):\n contador = 0\n for i in range(n):\n if bolo[i][j] == 'C':\n contador += 1\n pares += ((contador*(contador-1))//2)\n\nprint(pares)\n \t \t \t \t\t\t \t \t\t \t\t\t \t\t\t", "import math\r\nn=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n l=list(input())\r\n mat.append(l)\r\nl=[]\r\nfor i in range(n):\r\n if(mat[i].count('C')>=2):\r\n l.append(mat[i].count('C'))\r\nc=0\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if(mat[j][i]=='C'):\r\n c+=1\r\n #print(i,j)\r\n if(c>=2):\r\n l.append(c)\r\nf1=0\r\nf2=0\r\nf3=0\r\nc=0\r\n#print(l)\r\nfor i in range(len(l)):\r\n f1=math.factorial(l[i])\r\n f2=math.factorial(2)\r\n f3=math.factorial(l[i]-2)\r\n c+=f1//(f2*f3)\r\nprint(c)\r\n \r\n \r\n", "n = int(input())\nh = 0\nL = []\nfor x in range(n):\n l = input()\n h += sum(range(l.count('C')))\n L.append(l)\nR = [[row[i] for row in L] for i in range(len(L[0]))]\nfor x in R:\n h += sum(range(x.count('C')))\nprint(h) \n \t\t \t\t\t\t \t\t \t \t\t\t\t\t \t\t\t\t", "s = int(input())\na = [[1 if x == \"C\" else 0 for x in input()] for _ in range(s)]\nt = 0\n\nfor m in (a, zip(*a)):\n for l in m:\n t += sum(range(1, sum(l)))\n\nprint(t)\n \n\n \t \t \t\t \t\t \t\t \t\t\t", "p=lambda x:x*(x-1)//2\r\nn,r=int(input()),0\r\na=[input() for _ in[0]*n]\r\nfor _ in[0,0]:\r\n r+=sum(p(x.count('C')) for x in a)\r\n a=[[a[j][i] for j in range(n)] for i in range(n)]\r\nprint(r)", "import math\n\ndef nCr(n,r):\n if n-r == 0 :\n return 1\n f = math.factorial\n return f(n) // f(r) // f(n-r)\n\ndef solve(arr):\n count = 0\n for i in range(len(arr)):\n #row\n count_row_c = arr[i].count('C')\n if count_row_c >= 2 :\n count += nCr(count_row_c, 2)\n #col\n count_col_c = 0\n for j in range(len(arr)):\n if arr[j][i] == 'C':\n count_col_c += 1\n if count_col_c >= 2:\n count += nCr(count_col_c,2)\n return count\n \n \n\n \ndef main():\n #arr1 =list(map(int,input().split(' ')))\n #arr1 =input().split(' ')\n #arr2 = []\n n = int(input())\n #for j in range(n):\n #i = input()\n # i = input().split(' ')\n #i = int(''.join(input().split(' ')))\n #arr2 = arr2 + i\n #n = input()\n #t = input()\n arr = []\n for i in range(n):\n i = input()\n arr.append(list(i))\n print(solve(arr))\n\nmain()", "n=int(input())\r\nx=[]\r\ny1=[0 for i in range(n)]\r\ny2=[0 for i in range(n)]\r\nfor i in range(n):\r\n x.append(list(input()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j]==\"C\":\r\n y1[i]+=1\r\n y2[j]+=1\r\nans=0\r\nfor i in range(n):\r\n if y1[i]>1:\r\n ans+=y1[i]*(y1[i]-1)//2\r\n if y2[i]>1:\r\n ans+=y2[i]*(y2[i]-1)//2\r\nprint(ans)", "n = int(input())\r\nbcake = [input() for i in range(n)]\r\ncounter = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if bcake[i][j] == 'C':\r\n for k in range(j+1,n):\r\n if bcake[i][k] == 'C':\r\n counter += 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if bcake[j][i] == 'C':\r\n for k in range(j+1,n):\r\n if bcake[k][i] == 'C':\r\n counter += 1\r\nprint(counter)", "def happy():\r\n n = int(input())\r\n cake = [input() for i in range(n)]\r\n\r\n w = 0\r\n for y in range(n):\r\n c = cake[y].count('C')\r\n w += int(c * (c - 1) / 2)\r\n for x in range(n):\r\n c = 0\r\n for y in range(n):\r\n if cake[y][x] == 'C':\r\n c += 1\r\n w += int(c * (c - 1) / 2)\r\n print(w)\r\n\r\nhappy()\r\n", "def f(n):\r\n return (n * (n - 1)) // 2\r\nn = int(input())\r\nver = [0] * n\r\ngor = [0] * n\r\nfor i in range(n):\r\n lst = input()\r\n for j in range(n):\r\n if lst[j] == 'C':\r\n gor[i] += 1\r\n ver[j] += 1\r\nans = 0\r\nfor i in ver:\r\n ans += f(i)\r\nfor i in gor:\r\n ans += f(i)\r\n \r\nprint(ans)\r\n", "# n = int(input())\r\n# (n, k) = list(map(int, input().split()))\r\n# s = list(map(int, input().split()))\r\n\r\n\r\nn = int(input())\r\nf = []\r\n\r\nfor i in range(n):\r\n f.append([ch for ch in input()])\r\n\r\nresult = 0\r\nfor i in range(n):\r\n s1 = ''\r\n s2 = ''\r\n for j in range(n):\r\n s1 += f[i][j]\r\n s2 += f[j][i]\r\n c1 = s1.count('C')\r\n c2 = s2.count('C')\r\n \r\n result += c1 * (c1 - 1) // 2\r\n result += c2 * (c2 - 1) // 2\r\nprint(result)", "n = int(input())\r\nrow = [list(input()) for i in range(n)]\r\ncol = list(zip(*row[::-1]))\r\ncnt = 0\r\n\r\n\r\ndef count_c(x):\r\n if x == 2:\r\n return 1\r\n elif x < 2:\r\n return 0\r\n else:\r\n return x*(x-1)//2\r\n\r\n\r\nfor i in range(n):\r\n r = row[i].count('C')\r\n c = col[i].count('C')\r\n cnt += count_c(r)\r\n cnt += count_c(c)\r\nprint(cnt)\r\n", "n=int(input())\r\na=[]\r\nsum1=0\r\nstore=[0]*n\r\nfor i in range(n):\r\n temp=list(input())\r\n a.append(temp)\r\nfor i in range(n):\r\n row=0\r\n for j in range(n):\r\n if a[i][j]=='C':\r\n row+=1\r\n store[j]+=1 \r\n sum1+=(row*(row-1))//2\r\nfor i in range(n):\r\n # print(store[i])\r\n #print((store[i]*(store[i]-1))//2)\r\n sum1+=(store[i]*(store[i]-1))//2\r\n #print(sum1)\r\nprint(sum1)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solution(n, a):\r\n r, c = [0] * n, [0] * n\r\n for i in range(n):\r\n for j in range(n):\r\n if a[i][j] == \"C\":\r\n r[i] += 1\r\n c[j] += 1\r\n res = 0\r\n for i in range(n):\r\n res += r[i] * (r[i] - 1) // 2\r\n res += c[i] * (c[i] - 1) // 2\r\n return res\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([i for i in input()])\r\nprint(solution(n, a))\r\n", "def factorial(n):\r\n if n < 2:\r\n return 1\r\n return n * factorial(n - 1)\r\n\r\ndef nchoosek(n, k):\r\n return factorial(n) // (factorial(k) * factorial(n - k))\r\n\r\ndef pairCount(arr):\r\n count = 0 \r\n for i in range(len(arr)):\r\n currentCount = 0\r\n for j in range(len(arr[0])):\r\n if arr[i][j] == 'C':\r\n currentCount += 1\r\n count += nchoosek(currentCount, 2)\r\n \r\n for i in range(len(arr)):\r\n currentCount = 0\r\n for j in range(len(arr[0])):\r\n if arr[j][i] == 'C':\r\n currentCount += 1\r\n count += nchoosek(currentCount, 2)\r\n \r\n return count\r\n \r\n \r\nn = int(input())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(input())\r\nprint(pairCount(arr))", "cake = [input() for k in range(int(input()))]\nhappiness = 0\nfor line in range(len(cake)):\n countL = cake[line].count('C')\n countC = [k[line] for k in cake].count('C')\n happiness += sum(range(countL)) + sum(range(countC))\nprint(happiness)\n\t \t \t \t \t\t \t \t\t \t", "n = int(input())\r\ns = []\r\nC = [1] * (n + 1)\r\nK = []\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n K.append(s[i].count('C'))\r\n t = 0\r\n for j in range(n):\r\n if s[j][i] == 'C':\r\n t+= 1\r\n K.append(t)\r\nfor i in range(3, n + 1):\r\n C[i] = i * C[i - 1] // (i - 2)\r\nC[0] = 0\r\nC[1] = 0\r\nR = 0\r\nfor x in K:\r\n R += C[x]\r\nprint(R)\r\n \r\n", "# https://codeforces.com/problemset/problem/629/A\n\ndef nc2(a):\n return (a*(a-1))//2\n\nn = int(input())\ngrid = [input() for x in range(n)]\nans = 0\nfor x in range(n):\n ans += nc2(grid[x].count('C'))\nfor x in range(n):\n ans+=nc2(sum([1 for y in range(n) if grid[y][x]=='C']))\nprint(ans)", "n = int(input())\n\nm = [input() for i in range(n)]\n\nli = [0 for i in range(n)]\nco = [0 for i in range(n)]\n\nfor i in range(n):\n for j in range(n):\n if m[i][j] == 'C':\n li[i] += 1\n co[j] += 1\n\nsoma = 0\nfor i in li:\n soma += i * (i-1) // 2\n\nfor i in co:\n soma += i * (i-1) // 2\n\nprint(soma)\n", "def gkd(x):\n if x == 2:\n return 1\n else:\n return x * (x - 1) / 2\n\n\nn = int(input())\ns = [input() for i in range(n)]\nsum_C = 0\nfor i in range(n):\n row_C = 0 # 行内C\n rank_C = 0 # 列内C\n for j in range(n):\n if s[i][j] == 'C':\n row_C += 1\n if s[j][i] == 'C':\n rank_C += 1\n if row_C >= 2:\n sum_C += gkd(row_C)\n if rank_C >= 2:\n sum_C += gkd(rank_C)\nprint(int(sum_C))\n\n\n \t \t \t\t\t\t \t\t\t \t\t \t\t \t \t", "# Far Relative’s Birthday Cake - codeforces\r\n#\r\n\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n# k taken n combination\r\n# n!/k!(n-k)!\r\n\r\n\r\ndef inp():\r\n return int(input())\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 pair(n):\r\n return math.factorial(n) / (2 * math.factorial(n - 2))\r\n\r\n\r\nn = inp()\r\n\r\nc = 0\r\ncol = [0]*n\r\nfor i in range(n):\r\n cc = 0\r\n r = insr()\r\n for i, e in enumerate(r):\r\n if e == 'C':\r\n cc += 1\r\n col[i] += 1\r\n\r\n c += pair(cc) if cc > 2 else 1 if cc == 2 else 0\r\n\r\n# print(col)\r\nfor e in col:\r\n c += pair(e) if e > 2 else 1 if e == 2 else 0\r\n\r\nprint(int(c))\r\n", "n = int(input())\ncols = [0] * n\nres = 0\n\n\ndef c2n(k):\n return k * (k - 1) // 2\n\n\nfor _ in range(n):\n rows = 0\n for i, c in enumerate(input()):\n if c == \"C\":\n rows += 1\n cols[i] += 1\n res += c2n(rows)\nfor col in cols:\n res += c2n(col)\nprint(res)\n", "def solve(matrix: list, i: int, j: int, s: set):\r\n counter = 0\r\n for x in range(len(matrix)):\r\n if x != i and matrix[x][j] == 'C' and (x,j) not in s:\r\n counter += 1\r\n for x in range(len(matrix)):\r\n if x != j and matrix[i][x] == 'C' and (i,x) not in s:\r\n counter += 1\r\n return counter\r\nx = 0\r\ns = set()\r\nl = [[s.strip('\\n') for s in e[:-1]] for e in [*open(0)][1:]]\r\nfor i in range(len(l)):\r\n for j in range(len(l)):\r\n if l[i][j] == 'C':\r\n s.add((i,j))\r\n x += solve(l,i,j,s)\r\nprint(x)", "import os\r\nimport math\r\nimport time\r\nn = int(input())\r\nar = []\r\nfor i in range(n):\r\n s = input()\r\n ar.append(s)\r\nflag = False\r\ncounter = 0\r\npr = [0,0,1,3,6]\r\nfor i in range(5,101):\r\n pr.append(pr[i-1]+i-1)\r\nfor i in range(n):\r\n j = 0\r\n c = 0\r\n while j < n:\r\n if ar[i][j]=='C':\r\n c+=1\r\n j+=1\r\n counter+=pr[c]\r\n\r\nfor i in range(n):\r\n j = 0\r\n c = 0\r\n while j < n:\r\n if ar[j][i]=='C':\r\n c+=1\r\n j+=1\r\n counter+=pr[c]\r\n\r\nprint(counter)\r\n\r\n\r\n", "n=int(input())\r\na=[]\r\nans=0\r\nfor i in range(n):\r\n s=list(str(input()))\r\n a.append(s)\r\n\r\nfor i in range(n):\r\n c=a[i][:].count('C')\r\n ans += c*(c-1)//2\r\n\r\nfor j in range(n):\r\n c=0\r\n for k in range(n):\r\n c += a[k][j].count('C')\r\n\r\n ans += c*(c-1)//2\r\n \r\nprint(ans)", "inp, ls = int(input()), list()\r\ninp1, val = inp, 0\r\nwhile inp>0:\r\n s = input()\r\n ls.append(s)\r\n _ = s.count('C')\r\n if _>1:\r\n val += int(((_)*(_-1))/2)\r\n inp-=1\r\nnls = list()\r\nfor i in range(inp1):\r\n st = ''\r\n for q in ls:\r\n st += q[i]\r\n _ = st.count('C')\r\n if _>1:\r\n val += int(((_)*(_-1))/2)\r\n nls.append(st)\r\nprint(val)", "n = int(input())\r\nl = []\r\nans = 0\r\n\r\nfor _ in range(n):\r\n l.append(input())\r\n\r\nfor k in l:\r\n c = k.count('C')\r\n ans += (c ** 2 - c)//2\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[j][i] == 'C':\r\n for k in range(j+1,n):\r\n if l[k][i] == 'C':\r\n ans += 1\r\n \r\nprint(ans)", "t = []\r\nn = int(input())\r\nres = 0\r\nfor i in range(n):\r\n t.append(list(input()))\r\n count_C = 0\r\n\r\n for j in range(n):\r\n if t[i][j] == 'C':\r\n count_C += 1\r\n if count_C > 1:\r\n res += (count_C * (count_C - 1) // 2)\r\nfor i in range(n):\r\n count_C = 0\r\n for j in range(n):\r\n if t[j][i] == 'C':\r\n count_C += 1\r\n if count_C > 1:\r\n res += (count_C * (count_C - 1) // 2) \r\n \r\nprint(res)\r\n", "def sumation(num):\r\n\ttotal = 0\r\n\tfor i in range(num):\r\n\t\ttotal += i\r\n\treturn total\r\n\t\r\n\r\ndimention = int(input())\r\nrows = []\r\ncolumns = []\r\ncount = 0\r\n\r\nfor i in range(dimention):\r\n\trows.append(list(input()))\r\n\tcolumns.append([])\r\n\r\nfor i in range(dimention):\r\n\tfor e in range(len(rows[i])):\r\n\t\tcolumns[e].append(rows[i][e])\r\n\r\nfor i in rows:\r\n count += sumation(i.count(\"C\"))\r\n\r\nfor i in columns:\r\n\tcount += sumation(i.count(\"C\"))\r\n\r\nprint(count)", "n=int(input())\r\nlst=[]\r\nm=0\r\ns=0\r\nfor i in range(n):\r\n lst.append(list(input()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if lst[i][j]=='C':\r\n m+=1\r\n s+=int(m*(m-1)/2)\r\n m=0\r\n continue\r\nfor i in range(n):\r\n for j in range(n):\r\n if lst[j][i]=='C':\r\n m+=1\r\n s+=int(m*(m-1)/2)\r\n m=0\r\n continue\r\nprint(s)\r\n", "n = int(input())\nc = []\nfor _ in range(0, n):\n c.append(input())\nt = 0\nfor x in c:\n for i in range(1, x.count('C')):\n t += i\nfor x in zip(*c):\n for i in range(1, x.count('C')):\n t += i\nprint(t)\n", "n=int(input())\r\ns=[]\r\nfor i in range(0,n):\r\n q=input()\r\n s.append(q)\r\nr=[0 for x in range(0,101)]\r\nc=[0 for x in range(0,101)]\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if s[i][j]=='C':\r\n r[i]+=1\r\n c[j]+=1\r\nh=0\r\nfor i in range(0,n):\r\n h+=(r[i]*(r[i]-1))/2\r\nfor i in range(0,n):\r\n h+=(c[i]*(c[i]-1))/2\r\nprint (int(h))\r\n", "n=int(input())\r\ncake=[]\r\nans=0\r\nfor i in range(n):\r\n layers=input()\r\n tmp=((layers.count(\"C\")-1)*(layers.count(\"C\")))//2\r\n ans+=tmp\r\n x=list(layers)\r\n cake.append(x)\r\ncake=list(zip(*cake))\r\nfor i in range(n):\r\n tmp=cake[i].count(\"C\")\r\n ans+=(((tmp-1)*(tmp))//2)\r\nprint(ans)", "def fact(n):\r\n if n == 0:\r\n t =1\r\n else:\r\n t = n\r\n for i in range(1,n):\r\n t = t*i\r\n return t\r\n\r\n\r\ndef comb(n,r):\r\n return fact(n)//(fact(n-r)*fact(r))\r\n\r\n\r\nn = int(input())\r\norder = []\r\nfor i in range(n):\r\n order.append(list(input()))\r\nsum = 0\r\nfor i in range(n):\r\n d = order[i].count('C')\r\n if d>1:\r\n sum = sum+comb(d,2)\r\nfor i in range(n):\r\n d = 0\r\n for j in range(n):\r\n if order[j][i] == 'C':\r\n d =d + 1\r\n if d >1:\r\n sum = sum+ comb(d,2)\r\nprint(sum)", "\r\ndef func(n):\r\n \r\n return n*(n-1)/2\r\n \r\n\r\nn=int(input())\r\narr=[None]*n\r\nfor i in range(n):\r\n arr[i]=input()\r\n\r\nans=0\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if arr[i][j]=='C':\r\n c+=1\r\n ans=ans+func(c)\r\n\r\n\r\nfor j in range(n):\r\n c=0\r\n for i in range(n):\r\n if arr[i][j]=='C':\r\n c+=1\r\n ans=ans+func(c)\r\n\r\nprint(int(ans))\r\n", "n = int(input())\r\nc = 0\r\nw = []\r\n\r\n\r\ndef count(n):\r\n return n*(n-1)//2\r\n\r\n\r\nfor j in range(n):\r\n q = input()\r\n c += count(q.count('C'))\r\n w.append(q)\r\n\r\nfor j in range(n):\r\n s = [i[j] for i in w if i[j] == 'C']\r\n c += count(len(s))\r\n\r\n\r\nprint(c)", "n=int(input())\r\n\r\nr=[0 for i in range(n)]\r\nc=[0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n\ts=str(input())\r\n\tfor j in range(n):\r\n\t\tif s[j]=='C':\r\n\t\t\tr[i]+=1\r\n\t\t\tc[j]+=1\r\n\r\nan=0\r\nfor i in r:\r\n\tan+=i*(i-1)//2\r\nfor i in c:\r\n\tan+=i*(i-1)//2\r\nprint(an)", "def fat(n):\n f = 1\n p = 1\n for i in range(n):\n f *= (i+1)\n if(i<n-2):\n p *= (i+1)\n return f/(p*2)\n \ndef main():\n n = int(input())\n cake = []\n for i in range(n):\n line = input()\n cake.append(line)\n sum = 0\n for i in range(n):\n line = 0\n for j in range(n):\n if(cake[i][j]=='C'):\n line += 1\n if(line>=2):\n sum += fat(line)\n for j in range(n):\n collum = 0\n for i in range(n):\n if(cake[i][j]=='C'):\n collum += 1\n if(collum>=2):\n sum += fat(collum)\n print(int(sum))\n\nmain()\n\t\t \t \t\t \t\t \t\t\t \t \t \t \t", "from sys import stdin as fin\n# fin = open(\"cfr343a.in\", \"r\")\n\nn = int(fin.readline())\ncols = [0] * n\nsum = 0\nfor i in range(n):\n c = j = 0\n for sym in fin.readline().rstrip():\n if sym == 'C':\n c += 1\n cols[j] += 1\n j += 1\n # print(c, (c * (c - 1)) // 2)\n sum += (c * (c - 1)) // 2\n# print()\nfor c in cols:\n # print(c, (c * (c - 1)) // 2)\n sum += (c * (c - 1)) // 2\n\nprint(sum)", "a=int(input())\ns=[]\nn=0\nsum=0\nfor i in range(a):\n m=input()\n s.append(m)\nfor i in range(a):\n b=0\n p=0\n for j in range(a):\n if s[i][j]=='C':\n b=b+1\n if s[j][i]=='C':\n p=p+1\n sum=sum+((b-1)*b)/2\n sum=sum+((p-1)*p)/2\nprint(int(sum))\n\n\n\n\n\n\n\n\n\n\n\n \t \t \t \t\t \t \t \t \t", "n = (int)(input())\r\ns = [ input() for i in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif s[i][j] == 'C':\r\n\t\t\tfor k in range(j+1, n):\r\n\t\t\t\tif s[i][k] == 'C':\r\n\t\t\t\t\tans += 1\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif s[j][i] == 'C':\r\n\t\t\tfor k in range(j+1, n):\r\n\t\t\t\tif s[k][i] == 'C':\r\n\t\t\t\t\tans += 1\r\n\r\nprint(ans)", "n = int(input())\n\nv = []\nfor _ in range(n):\n v.append(input())\n\nr = 0\n\nfor i in range(n):\n t = sum([1 for x in v[i] if x=='C'])\n r += (t*(t-1))//2\n\nfor i in range(n):\n t = sum([1 for j in range(n) if v[j][i]=='C'])\n r += (t*(t-1))//2\n\nprint(r)", "a=[]\r\nfor _ in range(int(input())):\r\n a.append(input().strip())\r\n # n=int(input())\r\n # a=list(map(int,input().split()))\r\nans=0\r\nfor i in a:\r\n c=0\r\n for j in i:\r\n if(j==\"C\"):\r\n c+=1\r\n ans+=c*(c-1)//2\r\n# print(ans)\r\nfor i in range(len(a)):\r\n c=0\r\n for j in range(len(a)):\r\n if(a[j][i]==\"C\"):\r\n c+=1\r\n ans+=c*(c-1)//2\r\nprint(ans)", "n = int(input())\r\nresult = 0\r\narr = [0] * n\r\nfor i in range(n):\r\n s = input()\r\n result += sum(range(s.count('C')))\r\n for j, ch in enumerate(s):\r\n arr[j] += ch == 'C'\r\n\r\nfor i in range(n):\r\n result += sum(range(arr[i]))\r\nprint(result)", "n = int(input())\r\na = [0 for i in range(100)]\r\nans = 0\r\nfor i in range(n):\r\n line = input()\r\n c = line.count(\"C\")\r\n ans += c*(c-1)//2\r\n for j in range(len(line)):\r\n if line[j] == 'C': a[j]+=1\r\nfor i in a: ans += i*(i-1)//2\r\nprint(ans)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\na=[];r=0;v=[]\r\nfor i in range(n):v.append([])\r\nfor i in range(n):\r\n f=list(str(input()))\r\n a.append(f)\r\n for j in range(n):\r\n v[j].append(f[j])\r\nfor i in range(n):\r\n f=a[i].count(\"C\")\r\n p=v[i].count(\"C\")\r\n r+=f*(f-1)//2+p*(p-1)//2\r\nprint(r)", "a = int(input())\r\nk = 0\r\nS = []\r\nfor i in range(a):\r\n S.append(input())\r\n L = S[i].count('C')\r\n if(L > 1):\r\n if(L == 2):\r\n k += 1\r\n else:\r\n for j in range(1, L):\r\n k += j\r\nfor i in range(a):\r\n L =0 \r\n for j in range(a):\r\n if(S[j][i]=='C'):\r\n L += 1\r\n if(L > 1):\r\n if(L == 2):\r\n k += 1\r\n else:\r\n for j in range(1, L):\r\n k += j\r\nprint(k)\r\n", "n = int(input())\r\na = []\r\nq = 0\r\nq1 = 0 \r\nc = 0\r\nc1 = 0\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor i in range(n):\r\n q = 0\r\n for j in range(n):\r\n if a[i][j] == 'C':\r\n q+=1\r\n c = c+(q*(q-1))//2 \r\nfor j in range(n):\r\n q1 = 0\r\n for i in range(n):\r\n if a[i][j] == 'C':\r\n q1+=1\r\n c1 = c1+(q1*(q1-1))//2 \r\nprint(c+c1)\r\n", "from math import factorial as f\r\nn=int(input())\r\na=[]\r\nans=0\r\nfor i in range(n):\r\n a.append(input())\r\n k=0\r\n for j in a[i]:\r\n if j=='C':\r\n k+=1\r\n if k>1:\r\n ans+=f(k)//(2*f(k-2))\r\nfor i in range(n):\r\n k=0\r\n for j in range(n):\r\n if a[j][i]=='C':\r\n k+=1\r\n if k>1:\r\n ans+=f(k)//(2*f(k-2))\r\nprint(ans)", "n = int(input())\ncake=[input() for x in range(n)]\npieces=0\nfor k in cake:\n\tc=k.count('C')\n\tpieces += c*(c-1)//2\n \nfor j in range(n):\n\tc=0\n\tfor k in range(n):\n\t\tif cake[k][j] == 'C':\n\t\t\tc+=1\n \n\tpieces += c*(c-1)//2\n \nprint(pieces)\n \t \t\t\t \t\t\t\t\t\t\t\t\t\t \t\t \t\t \t\t", "p=lambda x:x*(x-1)//2\r\nn,r=int(input()),0\r\na=[input() for _ in[0]*n]\r\nfor _ in[0,0]:r+=sum(p(x.count('C')) for x in a);a=zip(*a)\r\nprint(r)", "n=int(input())\r\nr=[]\r\nfor i in range(n):\r\n l=list(map(str,input()))\r\n r.append(l)\r\nans=0\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if r[i][j]==\"C\":\r\n c+=1\r\n ans+=(c*(c-1))//2\r\nfor j in range(n):\r\n c=0\r\n for i in range(n):\r\n if r[i][j]==\"C\":\r\n c+=1\r\n ans+=(c*(c-1))//2\r\nprint(ans)", "n = int(input())\nc = [[*input()] for _ in range(n)]\nans = 0\n\nfor i in c:\n\tt = i.count('C')\n\tans += (t * (t - 1)) // 2\n\nfor i in [*zip(*c)]:\n\tt = i.count('C')\n\tans += (t * (t - 1)) // 2\n\nprint(ans)", "\r\na=int(input())\r\nc=[[] for i in range(a)]\r\nh=0\r\nfor i in range(a):\r\n\tb=input()\r\n\tfor j in range(a):\r\n\t\tc[i].append(b[j])\r\n\th+=b.count('C')*(b.count('C')-1)//2\r\nfor j in range(a):\r\n\tnum=0\r\n\tfor i in range(a):\r\n\t\tif c[i][j]=='C':num+=1\r\n\th+=num*(num-1)//2\r\nprint(h)\r\n", "n = int(input())\r\ntort = []\r\ncount = 0\r\nfor i in range(n):\r\n a = input()\r\n tort.append(a)\r\nsumm = 0\r\nfor i in tort:\r\n count += i.count('C')\r\n for j in range(count - 1, 0, -1):\r\n summ += j\r\n count = 0\r\nfor i in range(n):\r\n count = 0\r\n for j in tort:\r\n if j[i] == 'C':\r\n count += 1\r\n for x in range(count - 1, 0, -1):\r\n summ += x\r\nprint(summ)", "from math import factorial\r\nn=int(input())\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\ta=s.count(\"C\")\r\n\tif a>1:\r\n\t\tc+=factorial(a)/(2*factorial(a-2))\r\n\tl.append(list(s))\r\nl2=[]\r\nfor i in range(n):\r\n\tlx=[0 for i in range(n)]\r\n\tl2.append(lx)\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tl2[i][j]=l[j][i]\r\nfor i in l2:\r\n\ta=i.count(\"C\")\r\n\tif a>1:\r\n\t\tc+=factorial(a)/(2*factorial(a-2))\r\nprint(int(c))", "n = int(input())\na = []\nres = 0\nfor i in range(n):\n\tinp = list(input())\n\ta.append(inp)\n#print(a)\nfor i in a:\n\tres = res + ((i.count(\"C\") * (i.count(\"C\") - 1)) / 2)\ntra = [*zip(*a)]\n#print(tra)\n\n\n\nfor i in tra:\n\tres = res + (i.count(\"C\") * (i.count(\"C\") - 1)) / 2\nprint (int(res))", "t=int(input())\r\nk2=[0]*t\r\ns=0\r\ns1=0\r\nfor i in range(t):\r\n k=list(map(str,input()))\r\n s=k.count(\"C\")\r\n if s-1>0:\r\n s1+=(s-1)*s//2\r\n for j in range(t):\r\n if k[j]==\"C\":\r\n k2[j]+=1\r\nfor i in range(t):\r\n if k2[i]-1>0:\r\n s1+=(k2[i]-1)*k2[i]//2\r\nprint(s1)\r\n\r\n\r\n\r\n\r\n\r\n", "import collections\r\nimport math\r\n\r\n#n, m = map(int, input().split())\r\nn = int(input())\r\nt = [input() for _ in range(n)]\r\n\r\nans = 0\r\nfor i in range(n):\r\n x = t[i].count('C')\r\n #print(x)\r\n if x >= 2:\r\n ans += (x - 1) * x // 2\r\n#print(ans)\r\nfor i in range(n):\r\n temp = 0\r\n for j in range(n):\r\n if t[j][i] == 'C':\r\n temp += 1\r\n if temp >= 2:\r\n ans += (temp - 1) * temp // 2\r\nprint(ans)\r\n", "n=int(input());a=[0]*n;b=[0]*n;ans=0\r\nfor i in range(n):\r\n s=input()\r\n for j in range(n):\r\n if s[j]=='C':a[i]+=1;b[j]+=1\r\nfor i in range(n):ans+=a[i]*(a[i]-1)//2\r\nfor i in range(n):ans+=b[i]*(b[i]-1)//2\r\nprint(ans)", "__author__ = 'aste'\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n rows = [0] * n\r\n cols = [0] * n\r\n res = 0\r\n for i in range(0, n):\r\n row = input()\r\n for j in range(0, n):\r\n if row[j] == 'C':\r\n res += rows[i] + cols[j]\r\n rows[i] += 1\r\n cols[j] += 1\r\n print(res)\r\n\r\nmain()\r\n", "test = int(input())\r\nl = [0] * test\r\nsumma = 0\r\nfor tests in range(test):\r\n z = input()\r\n for i in range(test):\r\n if z[i] == 'C':\r\n l[i] += 1\r\n summa += sum(range(z.count('C')))\r\nfor i in l:\r\n summa += sum(range(i))\r\nprint(summa)\r\n", "n = int(input())\r\na = []\r\ncounter = 0\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor item in range(n):\r\n for x in range(n):\r\n for y in range(x+1,n):\r\n if a[item][x] == a[item][y] and a[item][x] == 'C':\r\n counter += 1\r\n for i in range(item+1,n):\r\n for j in range(n):\r\n if a[item][j] == a[i][j] and a[item][j] == 'C':\r\n counter += 1\r\nprint(counter)", "def main():\r\n n = int(input())\r\n data = []\r\n for i in range(n):\r\n data.append(input())\r\n res = 0\r\n for i in range(0, n):\r\n s = 0\r\n for j in range(0, n):\r\n for l in range(j+1,n):\r\n if data[i][j]==data[i][l] and data[i][j]=='C':\r\n s+=1\r\n res+=s\r\n\r\n for i in range(0, n):\r\n s = 0\r\n for j in range(0, n):\r\n for l in range(j+1,n):\r\n if data[j][i]==data[l][i] and data[j][i]=='C':\r\n s+=1\r\n res+=s\r\n print(res)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nlst = []\r\ncount1=0\r\ndef jie(p):\r\n c = 0\r\n for i in range(1,p):\r\n c+=i\r\n return c\r\nfor i in range(n):\r\n a = str(input())\r\n lst.append(a)\r\nfor j in range(n):\r\n d=0\r\n for k in range(n):\r\n if lst[k][j] == 'C':\r\n d+=1\r\n if d > 1:\r\n count1 += jie(d)\r\nfor j in range(n):\r\n b=0\r\n for k in range(n):\r\n if lst[j][k] == 'C':\r\n b+=1\r\n if b > 1:\r\n count1 += jie(b)\r\nprint(count1)", "import math\n\nn = int(input())\nc = [list(input()) for i in range(n)]\n\n\nrowN = [0] * n\ncolN = [0] * n\n\nfor i in range(n):\n for j in range(n):\n rowN[i] += c[i][j] == 'C'\n colN[i] += c[j][i] == 'C'\n\nsum_ = 0\nfor i in range(n):\n rr = rowN[i]\n cc = colN[i]\n if rr > 1:\n sum_ += rr * (rr-1) // 2\n if cc > 1:\n sum_ += cc * (cc-1) //2 \n\nprint(sum_)\n", "def fd():\n import math\n n = int(input())\n i = 0\n count = 0\n total = 0\n \n matriz = []\n for i in range(n):\n linha = input()\n matriz.append(linha)\n \n for i in range(n):\n count = 0\n for j in range(n):\n if matriz[i][j] == 'C':\n count += 1\n total += math.comb(count, 2)\n \n for j in range(n):\n count = 0\n for i in range(n):\n if matriz[i][j] == 'C':\n count += 1\n total += math.comb(count, 2)\n \n print(total)\n \nfd()\n\t\t \t\t\t\t\t \t\t\t\t\t \t \t\t\t\t\t\t\t", "\na=int(input())\nc=[[] for i in range(a)]\nh=0\nfor i in range(a):\n\tb=input()\n\tfor j in range(a):\n\t\tc[j].append(b[j])\n\tfor k in range(b.count('C')):\n\t\th+=k\nfor i in range(a):\n\tfor j in range(c[i].count('C')):\n\t\th+=j\nprint(h)\n", "n=int(input())\r\nt=[]\r\nfor i in range(n):\r\n\tt.append(input())\r\nans=0\r\nfor i in range(n):\r\n\ttemp=0\r\n\tfor j in range(n):\r\n\t\tif t[i][j]=='C':\r\n\t\t\ttemp+=1\r\n\tans+=temp*(temp-1)//2\r\nfor i in range(n):\r\n\ttemp=0\r\n\tfor j in range(n):\r\n\t\tif t[j][i]=='C':\r\n\t\t\ttemp+=1\r\n\tans+=temp*(temp-1)//2\r\n\r\nprint(ans)\r\n", "def main():\r\n n = int(input())\r\n cake = []\r\n for _ in range(n):\r\n cake.append(list(input()))\r\n\r\n sol = 0\r\n for i in range(n):\r\n m = 0\r\n p = 0\r\n for j in range(n):\r\n if cake[i][j] == 'C':\r\n m += 1\r\n sol += m * (m - 1) // 2\r\n\r\n for j in range(n):\r\n if cake[j][i] == 'C':\r\n p += 1\r\n sol += p * (p - 1) // 2\r\n\r\n print(sol)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "if __name__ == '__main__':\n n = int(input())\n m = []\n felicidade = 0\n\n for i in range(n):\n m.append(input())\n\n for i in range(n):\n auxLinha = m[i].count('C')\n felicidade += auxLinha * (auxLinha - 1) // 2\n\n for i in range(n):\n auxColuna = 0\n for j in range(n):\n if m[j][i] == 'C':\n auxColuna += 1\n felicidade += auxColuna * (auxColuna - 1) // 2\n\n print(felicidade)\n \t \t\t\t\t\t\t \t\t \t\t \t", "a = [0] * 100\r\nb = [0] * 100\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == 'C':\r\n a[i] += 1\r\n b[j] += 1\r\nans = 0\r\nfor x in a:\r\n ans += x * (x - 1) // 2\r\nfor x in b:\r\n ans += x * (x - 1) // 2\r\nprint(ans)", "def s(k):\n k -= 1\n return int((k + 1) * (k / 2))\n\nn = int(input())\na = []\nfor i in range(n):\n a.append(list(input()))\n\nres = 0\n\nfor item in a:\n res += s(item.count('C'))\n\nfor i in range(n):\n cnt = 0\n for j in range(n):\n if a[j][i] == 'C':\n cnt += 1\n\n res += s(cnt)\n\nprint(res)\n\t\t \t \t \t\t\t\t\t \t\t \t \t \t", "import math\r\nn=int(input())\r\nrow=list()\r\ncol=list()\r\nfor i in range(n):\r\n s=input()\r\n l=list()\r\n for j in s:\r\n l.append(j)\r\n row.append(l)\r\nm=0\r\nwhile m<n:\r\n l=list()\r\n o=0\r\n while o<n:\r\n l.append(row[o][m])\r\n o+=1\r\n m+=1\r\n col.append(l)\r\nsum=0\r\nfor r in row:\r\n a=r.count('C')\r\n sum+= math.comb(a, 2)\r\nfor r in col:\r\n a=r.count('C')\r\n sum+= math.comb(a, 2)\r\nprint(sum)", "n = int(input())\n\ncols = [0 for _ in range(n)]\nrows = [0 for _ in range(n)]\n\nfor i in range(n):\n line = input().strip()\n for j in range(len(line)):\n if line[j] == 'C':\n cols[i] += 1\n rows[j] += 1\n\nansw = 0\n\nfor i in cols + rows:\n answ += (i * (i - 1)) // 2\n\nprint(answ)\n", "n = int(input())\r\nmat = [input() for i in range(n)]\r\nrow = {}\r\ncol = {}\r\nfor i in range(len(mat)):\r\n for j in range(len(mat[0])):\r\n if mat[i][j] == 'C':\r\n row[i] = row.get(i, 0) + 1\r\n col[j] = col.get(j, 0) + 1\r\n\r\nres = 0\r\nfor v in row.values():\r\n res += (v * (v-1)) // 2\r\nfor v in col.values():\r\n res += (v * (v-1)) // 2\r\n\r\nprint(res)\r\n\r\n", "n=int(input())\r\nl=[]\r\nres=0\r\nfor i in range(n):\r\n l.append(list(input()))\r\ny=list(zip(*l))\r\nfor i in range(n):\r\n x=l[i].count('C')\r\n b=y[i].count('C')\r\n res+=((x-1)*x)//2+((b-1)*b)//2\r\nprint(res)\r\n", "n = int(input())\r\nmatrix = []\r\nres = 0\r\nfor i in range(n):\r\n matrix.append(input())\r\n\r\nrowCount, colCount = 0, 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if matrix[i][j] == \"C\":\r\n rowCount += 1\r\n if matrix[j][i] == \"C\":\r\n colCount += 1\r\n res += (rowCount - 1) * rowCount // 2 + (colCount - 1) * colCount // 2\r\n rowCount = colCount = 0\r\nprint(res)\r\n \r\n", "n = int(input())\r\nsumm = 0\r\nc = []\r\nfor j in range(n):\r\n b = list(input())\r\n c.append(b)\r\n\r\nfor i in range(n):\r\n j = 0\r\n for g in range(n):\r\n if c[i][g] == 'C':\r\n j+= 1\r\n summ += ((1 + (j-1)) * (j - 1)) // 2\r\nfor i in range(n):\r\n f = 0\r\n for l in range(n):\r\n if c[l][i] == 'C':\r\n f += 1\r\n summ += ((1 + (f - 1)) * (f - 1)) // 2\r\n\r\n\r\nprint(summ)\r\n", "__author__ = 'Utena'\r\nn=int(input())\r\ns=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n a=input()\r\n for j in range(n):\r\n if a[j]=='C':\r\n s[i][j]=1\r\ns1=[0]*n\r\ns2=[0]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i][j]==1:\r\n s1[i]+=1\r\n s2[j]+=1\r\nt=0\r\nfor b in s1:\r\n t+=b*(b-1)//2\r\nfor c in s2:\r\n t+=c*(c-1)//2\r\nprint(t)", "n=int(input())\r\nmatt=[] \r\ndef factorial(x):\r\n if x<=1:\r\n return 1\r\n return x*factorial(x-1)\r\n\r\n\r\n\r\ndef combinations(num):\r\n if num<=1:\r\n return 0\r\n com = factorial(num)/factorial(num-2)/2 \r\n return com\r\n\r\nhappy=0 \r\n#take input and iterate over all rows \r\nfor i in range(n):\r\n choco=0 \r\n row = list(input())\r\n matt.append(row)\r\n\r\n for i in row:\r\n if i==\"C\":\r\n choco+=1 \r\n happy+=combinations(choco)\r\n\r\n#iterate over columns \r\n\r\nfor u in range(n):\r\n choco=0\r\n for v in range(n):\r\n if matt[v][u]==\"C\":\r\n choco+=1 \r\n\r\n happy+=combinations(choco)\r\n\r\nprint(int(happy))\r\n", "from math import factorial as f\r\nif __name__=='__main__':\r\n n= int(input())\r\n if n==1:\r\n t = input()\r\n if t=='C': print(1)\r\n else: print(0)\r\n else:\r\n hapi = 0\r\n ck = []\r\n for i in range(n):\r\n t = input()\r\n c = t.count('C')\r\n if c > 1:\r\n hapi += int(c*(c-1)/2)\r\n ck+=[t]\r\n vapi = 0\r\n for j in range(n):\r\n c = 0\r\n for x in range(n):\r\n if ck[x][j]=='C':\r\n c+=1\r\n if c>1: vapi += int(c*(c-1)/2)\r\n print (hapi+vapi)\r\n \r\n \r\n", "import math\r\nn=int(input())\r\nmatrix=[]\r\nfor i in range(n):\r\n s=str(input())\r\n a=[]\r\n a.append(s)\r\n matrix.append(a)\r\nc=0\r\nd=0\r\nf=0\r\ncount=0\r\nz=0\r\nb=0\r\nfor i in range(0,len(matrix)):\r\n c=(matrix[i][0].count(\"C\"))\r\n if(c>=2):\r\n d=d+(math.factorial(c)//(math.factorial(2)*math.factorial(c-2)))\r\nwhile(count<(n*n)):\r\n e=0\r\n for j in range(0,len(matrix)):\r\n if(matrix[j][0][b]=='C'):\r\n e=e+1\r\n count=count+1\r\n b=b+1\r\n z=z+1\r\n if(e>=2):\r\n f=f+(math.factorial(e)//(math.factorial(2)*math.factorial(e-2)))\r\n if(count==(n*n)):\r\n break\r\nprint(f+d)\r\n \r\n \r\n", "n = int(input())\r\ninit = []\r\nfor i in range(n):\r\n x = input()\r\n init.append(x)\r\na = []\r\ntotal_sum, i = 1, 2\r\nwhile i < 100:\r\n a.append(total_sum)\r\n total_sum += i\r\n i += 1\r\nans = 0\r\nfor j in range(n):\r\n if init[j].count('C') > 1:\r\n ans += a[init[j].count('C') - 2]\r\n abc = 0\r\n for k in range(n):\r\n if init[k][j] == 'C':\r\n abc += 1\r\n if abc > 1:\r\n ans += a[abc - 2]\r\nprint(ans)\r\n", "n = int(input())\r\n\r\nb = []\r\n\r\nfor i in range(n):\r\n b += [input()]\r\n\r\n\r\nans = 0\r\nfor j in range(n):\r\n s = 0\r\n for i in range(n):\r\n if (b[j][i] == 'C'):\r\n s +=1\r\n ans += s*(s-1)/2\r\n s = 0\r\n for i in range(n):\r\n if (b[i][j] == 'C'):\r\n s +=1\r\n ans += s*(s-1)/2\r\n\r\nprint(int(ans))\r\n\r\n \r\n", "n=int(input())\ncake={}\nfor i in range(n):\n row=input()\n for j in range(n):\n cake[(i,j)]=row[j]\nh=0\nfor i in range(n):\n for j in range(n):\n for k in range(j+1,n):\n '''if cake[(i,j)]=='C' and cake[(i,k)]=='C':\n print((i,j),(i,k))'''\n h += 1 if cake[(i,j)]=='C' and cake[(i,k)]=='C' else 0\n\nfor j in range(n):\n for i in range(n):\n for k in range(i+1,n):\n '''if cake[(i,j)]=='C' and cake[(k,j)]=='C':\n print((i,j),(k,j))'''\n h += 1 if cake[(i,j)]=='C' and cake[(k,j)]=='C' else 0\nprint(h)\n\n", "from sys import *\r\ninp = lambda : stdin.readline()\r\nN = 105\r\ndef main():\r\n n = int(inp())\r\n r = [0 for i in range(N)]\r\n c,ans = r[:],0\r\n for i in range(n):\r\n s = inp()\r\n for j in range(n):\r\n if s[j] == 'C':\r\n ans += r[i] + c[j]\r\n r[i] += 1\r\n c[j] += 1\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\nlist1 = []\nsum = 0\nfor i in range(n):\n temp = str(input())\n list1.append(temp)\nfor i in list1:\n conto = i.count('C')\n temp = (conto*(conto-1))/2\n sum += temp\nfor j in range(n):\n b = 0\n for i in list1:\n if i[j]=='C':\n b += 1\n temp = (b*(b-1))/2\n sum +=temp\nprint(int(sum))\n \t \t\t \t\t \t \t \t \t\t\t\t", "n = int(input())\nl=[]\ndef find(word):\n count=0\n for i in word:\n if i==\"C\":\n count += 1\n return(count)\nz=0\nfor i in range(n):\n l.append(input())\n z += (find(l[i])*(find(l[i])-1))/2\n\nfor i in range(n):\n count=0\n for y in range(n):\n if (l[y])[i]==\"C\":\n count +=1\n z+=(count*(count-1))/2\nz= int(z)\nprint(z)\n\n", "from itertools import combinations\r\nn = int(input())\r\ncnt = 0\r\ncake = []\r\nfor i in range(n):\r\n cake.append(list(input()))\r\nfor i in range(n):\r\n cnt+= len(list(combinations(range(cake[i].count('C')), 2)))\r\nfor i in range(n):\r\n cnt+= len(list(combinations(range([row[i] for row in cake].count('C')), 2)))\r\nprint(cnt)", "import math\r\nn=eval(input())\r\ni=0\r\nans=0\r\ns=''\r\nx=''\r\nwhile(i<n):\r\n s=input()\r\n if(s.count('C')>=2):\r\n ans+=s.count('C')*(s.count('C')-1)//2 \r\n x=x+s\r\n i+=1\r\ni=0\r\nf=''\r\ng=0\r\nwhile(g<n):\r\n i=g\r\n f=''\r\n \r\n while(i<len(x)):\r\n f+=x[i]\r\n i+=n\r\n if(f.count('C')>=2):\r\n ans+=f.count('C')*(f.count('C')-1)//2 \r\n \r\n g+=1\r\nprint(ans) \r\n", "n=int(input())\r\na=list()\r\nres=0\r\nfor i in range(n):\r\n a.append(0)\r\nfor i in range(n):\r\n s=input()\r\n res += int(s.count('C')*(s.count('C')-1)/2)\r\n for j in range(n):\r\n if s[j]=='C':\r\n a[j] += 1\r\nfor i in a:\r\n res += int((i-1)/2*i)\r\nprint(res)\r\n\r\n\r\n", "def combinatoria(num):\n if num == 0:\n return 0 \n sef = num ** 2\n return (sef-num)/2 \n\nnum = int(input())\ntest = [0] * num\ntest2 = [0] * num\nfor i in range(num):\n stri = str(input())\n sefc = 0\n for j, grea in enumerate(stri):\n if grea == 'C':\n test2[j] += 1\n sefc += 1\n test[i] = sefc\n \ncont = 0\nfor k in range(num):\n var1, var2 = 0,0\n if (test[k] > 1):\n var1 = test[k]\n \n if (test2[k] > 1):\n var2 = test2[k]\n cont += combinatoria(var1) + combinatoria(var2)\n \nprint(int(cont))\n \t\t \t\t \t \t \t \t\t \t\t\t\t\t\t\t\t\t", "#!/usr/bin/python3\n\nclass StdReader:\n\tdef read_int(self):\n\t\treturn int(self.read_string())\n\n\tdef read_ints(self, sep = None):\n\t\treturn [int(i) for i in self.read_strings(sep)]\n\n\tdef read_float(self):\n\t\treturn float(self.read_string())\n\n\tdef read_floats(self, sep = None):\n\t\treturn [float(i) for i in self.read_strings(sep)]\n\n\tdef read_string(self):\n\t\treturn input()\n\n\tdef read_strings(self, sep = None):\n\t\treturn self.read_string().split(sep)\n\nreader = StdReader()\n\n\ndef main():\n\tn = reader.read_int()\n\n\trows = [0]*n\n\tcols = [0]*n\n\thappiness = 0\n\n\tfor i in range(n):\n\t\trow = reader.read_string()\n\n\t\tfor j, c in enumerate(row):\n\t\t\tif c == 'C':\n\t\t\t\trows[i] += 1\n\t\t\t\tcols[j] += 1\n\n\t\t\t\thappiness += rows[i] - 1\n\t\t\t\thappiness += cols[j] - 1\n\n\tprint(happiness)\n\nif __name__ == '__main__':\n\tmain()\n", "row = int(input())\r\nmatrix = [\"0\"] * row \r\ncounter_list= []\r\nfor i in range(row) :\r\n data = [i for i in input()]\r\n counter_list.append(data.count(\"C\"))\r\n matrix[i] = data \r\nfor i in (zip(*matrix)): \r\n counter_list.append(i.count(\"C\")) \r\nsumm = 0 \r\nfor i in counter_list: \r\n summ += i*(i-1) //2\r\nprint(summ)", "def C(n):\r\n return n*(n-1)//2\r\n\r\nn = int(input())\r\na = n * [0]\r\nfor i in range(n):\r\n a[i] = input()\r\nans = 0\r\nfor i in range(n):\r\n q, w = 0, 0\r\n for j in range(n):\r\n if a[i][j] == 'C':\r\n q += 1\r\n if a[j][i] == 'C':\r\n w += 1\r\n ans += C(q) + C(w)\r\nprint(ans)\r\n", "N = int(input())\ntable = [input() for i in range(N)]\n\nans = 0\nfor i in range(N):\n cnt = 0\n for j in range(N):\n if table[i][j] == \"C\":\n cnt += 1\n ans += cnt * (cnt - 1) // 2\n\nfor j in range(N):\n cnt = 0\n for i in range(N):\n if table[i][j] == \"C\":\n cnt += 1\n ans += cnt * (cnt - 1) // 2\nprint(ans)\n", "def nC2(i):\r\n return(i*(i-1)//2)\r\n \r\n\r\nn=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n mat.append(list(input()))\r\nans=0\r\nfor i in range(n):\r\n rowCnt=mat[i].count('C')\r\n submat=[]\r\n for j in range(n):\r\n submat.append(mat[j][i])\r\n \r\n colCnt=submat.count('C')\r\n ans+=nC2(rowCnt)+nC2(colCnt)\r\nprint(ans)\r\n", "n = int(input())\r\n\r\nc = [list(input()) for i in range(n)]\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n t = c[i].count('C')\r\n ans += t*(t-1)//2\r\n\r\nc = list(zip(*c))\r\n\r\nfor i in range(n):\r\n t = c[i].count('C')\r\n ans += t*(t-1)//2\r\n\r\nprint(ans)\r\n", "import math\n\ndef comb(n,p):\n C = math.factorial(n)/(math.factorial(p)*math.factorial(n-p))\n return int(C)\n\nn = int(input())\n\nmatrix = []\nsoma = 0\nfor i in range(n):\n row = list(input())\n c = row.count('C')\n if c >= 2:\n pairs = comb(c,2)\n soma += pairs\n\n matrix.append(row)\n\nfor i in range(n):\n col = [row[i] for row in matrix]\n c = col.count('C')\n if c >= 2:\n pairs = comb(c,2)\n soma += pairs\n\nprint(soma)\n \t \t \t \t \t \t \t\t\t\t\t\t\t", "from math import comb\r\nn = int(input())\r\ncake = [input() for _ in range(n)]\r\ncol = [0]*n\r\nrow = [0]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if cake[i][j]=='C':\r\n col[i]+=1\r\n row[j]+=1\r\ncount = 0\r\nfor i in col:\r\n count+=comb(i,2)\r\nfor i in row:\r\n count+=comb(i,2)\r\nprint(count)", "n=100\r\nfact=[1]*(n+1)\r\nfor i in range(1,n+1):\r\n fact[i]=fact[i-1]*i\r\ndef ncr(n,r):\r\n return (fact[n]/(fact[n-r]*fact[r]))\r\n\r\nn=int(input())\r\nz=[]\r\nfor i in range(n):\r\n z.append(input())\r\nc=0\r\nfor i in range(n):\r\n a,b=0,0\r\n for j in range(n):\r\n if z[i][j]=='C':\r\n a+=1\r\n if z[j][i]=='C':\r\n b+=1\r\n c+=ncr(a,2)+ncr(b,2)\r\nprint(int(c))\r\n \r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\nb = [0] * n\r\nc = [0] * n\r\nfor i in range(n):\r\n t = input()\r\n for j in range(n):\r\n if t[j] == 'C':\r\n b[i] += 1\r\n c[j] += 1\r\nans = 0\r\nfor i in range(n):\r\n ans += (b[i] * (b[i]-1))//2\r\n ans += (c[i] * (c[i]-1))//2\r\nprint(ans)", "def factorial(n):\r\n product = 1\r\n for i in range(1, n + 1):\r\n product *= i\r\n return product\r\n\r\n\r\ndef calculate_permutations(n_c):\r\n return factorial(n_c) // factorial(n_c - 2) // 2\r\n\r\n\r\n\r\ndef main_function():\r\n output_list = [input() for i in range(int(input()))]\r\n count = 0\r\n for i in output_list:\r\n intermediate_count = 0\r\n for j in i:\r\n if j == \"C\":\r\n intermediate_count += 1\r\n count += calculate_permutations(intermediate_count)\r\n for k in range(len(output_list[0])):\r\n intermediate_count = 0\r\n for h in output_list:\r\n if h[k] == \"C\":\r\n intermediate_count += 1\r\n count += calculate_permutations(intermediate_count)\r\n return count\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\ncake = []\r\nt = 0\r\nfor i in range(n):\r\n cake.append(list(input()))\r\n x = cake[-1].count(\"C\")\r\n t += ((x * (x - 1)//2))\r\nfor i in zip(*cake):\r\n x =list(i).count(\"C\")\r\n t += ((x * (x - 1)//2))\r\nprint(t)\r\n", "n, = map(int,input().split())\r\nrow = [0]*n\r\ncol = [0]*n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j]=='C':\r\n row[i]+=1\r\n col[j]+=1\r\nans = 0\r\nfor i in range(n):\r\n ans += row[i]*(row[i]-1)//2\r\n ans += col[i]*(col[i]-1)//2\r\nprint(ans)", "def Extract(lst,r):\r\n return [item[r] for item in lst]\r\n\r\na=int(input())\r\nr=0\r\nc=list()\r\nwhile r<a:\r\n c.append([char for char in input()])\r\n r=r+1\r\nr=0\r\ns=0\r\nwhile r<a:\r\n m=c[r].count(\"C\")\r\n n=Extract(c,r).count(\"C\")\r\n s=s+((m*m-m)/2)+((n*n-n)/2)\r\n r=r+1\r\nprint(int(s))\r\n", "n = int(input())\r\ncake = []\r\nres = 0\r\nfor i in range(n):\r\n a = input()\r\n b = a.count(\"C\")\r\n res = res + (b*(b-1)//2)\r\n cake.append(a)\r\nrotated = zip(*cake[::-1])\r\nfor i in rotated:\r\n b = i.count(\"C\")\r\n res = res + (b*(b-1)//2) \r\nprint(res)", "def factorial(n):\r\n if n == 1:\r\n return 1\r\n if n == 0:\r\n return 1\r\n return n * factorial(n - 1)\r\n\r\n\r\ndef cnk(n, k):\r\n if k > n:\r\n return 0\r\n return factorial(n)/(factorial(n - k) * factorial(k))\r\n\r\n\r\ndef main():\r\n result = 0\r\n n = int(input())\r\n data = list()\r\n new_data = list()\r\n for i in range(n):\r\n data.append(list(input()))\r\n result += cnk(data[i].count(\"C\"), 2)\r\n for i in range(len(data[0])):\r\n new_data.append(list())\r\n for j in range(len(data)):\r\n new_data[i].append(data[j][i])\r\n\r\n for i in range(n):\r\n result += cnk(new_data[i].count(\"C\"), 2)\r\n print(int(result))\r\n\r\n\r\nmain()\r\n", "matrix = []\nside = int(input())\n\nfor i in range(0, side):\n line = str(input())\n matrix.append(line)\n\ntotal_line = 0\ntotal_col = 0\nfor i in range(0, side): #linhas\n aux_lin = 0\n aux_col = 0\n for j in range(0, side): #colunas\n p = matrix[i][j]\n q = matrix[j][i]\n if (p == 'C'):\n aux_lin = aux_lin + 1\n if (q == 'C'):\n aux_col = aux_col + 1\n total_line = total_line + (int(aux_lin*(aux_lin-1)/2))\n total_col = total_col + (int(aux_col*(aux_col-1)/2))\n\nprint(total_line+total_col)\n \n\n \n\n\n\n\n\n\n\n\n \t\t \t \t \t \t \t \t \t \t\t", "n = int(input())\r\nans = 0\r\na = [0 for i in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n cnt = 0\r\n for j in range(n):\r\n if s[j] == \"C\":\r\n cnt += 1\r\n a[j] += 1\r\n if cnt > 1:\r\n for j in range(2, cnt + 1):\r\n ans += j\r\n ans -= (cnt - 2 + 1)\r\nfor cnt in a:\r\n if cnt > 1:\r\n for j in range(2, cnt + 1):\r\n ans += j\r\n ans -= (cnt - 2 + 1)\r\nprint(ans)\r\n", "n = int(input())\r\nrows = [0] * n\r\ncols = [0] * n\r\nfor r in range(n):\r\n s = input()\r\n for c in range(n):\r\n if s[c] == \"C\":\r\n rows[r] += 1\r\n cols[c] += 1\r\nans = 0\r\nfor i in range(n):\r\n ans += rows[i] * (rows[i] - 1) // 2\r\n ans += cols[i] * (cols[i] - 1) // 2\r\nprint(ans)", "n = int(input())\r\nG = []\r\nfor i in range(n):\r\n G.append(list(input()))\r\n\r\nrow_cnt = [0 for r in range(n)]\r\ncol_cnt = [0 for c in range(n)]\r\n\r\nfor r in range(n):\r\n for c in range(n):\r\n if G[r][c] == 'C':\r\n row_cnt[r] += 1\r\n col_cnt[c] += 1\r\n\r\npairs = 0\r\nfor i in range(n):\r\n pairs += int((row_cnt[i] * (row_cnt[i] - 1)) / 2)\r\n pairs += int((col_cnt[i] * (col_cnt[i] - 1)) / 2)\r\n\r\nprint(pairs)", "n = int(input()); L = []; c = 0\r\nfor i in range(n): L.append(input())\r\ndef f(x): return x*(x-1)//2\r\nfor i in range(n): c += (f(L[i].count('C')) + f([L[x][i] for x in range(n)].count('C')))\r\nprint(c)\r\n", "n = int(input())\ng = [[c == 'C' for c in input()] for i in range(n)]\nr = [sum(g[i]) for i in range(n)]\nfor i in range(n):\n for j in range(i):\n g[i][j], g[j][i] = g[j][i], g[i][j]\nc = [sum(g[i]) for i in range(n)]\nprint(sum(sum(x*(x-1)//2 for x in l) for l in (r, c)))", "import operator\ndef nC2(n):\n\treturn (n*n - n) // 2\nn = int(input());\nacc, s = [0] * n, 0\nfor i in range(n):\n\txs = [1 if c == 'C' else 0 for c in input()]\n\tacc = map(operator.add, acc, xs)\n\ts += nC2(sum(xs))\ns += sum(map(nC2, acc))\nprint(s)\n", "n = int(input())\n\ncake = []\nhappiness = 0\nchocCount = 0\nnfat = 1\n\nfor i in range(n): #count rows\n line = str(input())\n cake.append(line)\n for j in line:\n if(j=='C'):\n chocCount+=1\n if(chocCount>1):\n for i in range(chocCount, chocCount-2, -1):\n nfat *=i\n happiness += nfat/2\n nfat = 1\n chocCount = 0\n\nposCount = 0\nfor j in range(n):\n for i in range(n):\n if(cake[i][j]=='C'):\n chocCount+=1\n if(chocCount>1):\n for i in range(chocCount, chocCount-2, -1):\n nfat *=i\n happiness += nfat/2\n nfat = 1\n chocCount = 0\nprint(int(happiness))\n \t \t\t\t\t \t\t \t \t\t\t\t\t\t \t\t\t\t", "import math\nmath.factorial(3)\narr=[]\nsum=0\nn=int(input())\nfor _ in range(n):\n s=input()\n s=list(s)\n temp=s.count(\"C\")\n if temp >1:\n\n sum += (math.factorial(temp)/(2 * math.factorial(temp-2)))\n arr.append(s)\n\nfor i in range(n):\n temp=0\n for j in range(n):\n if arr[j][i]==\"C\":\n temp +=1\n if temp>1:\n sum += (math.factorial(temp)/(2 * math.factorial(temp-2)))\nprint(int(sum))\n", "n = int(input())\r\nmat = []\r\ncount = 0\r\n\r\nfor i in range(n):\r\n mat.append(input())\r\n\r\nfor i in range(n):\r\n c = 0\r\n\r\n for j in range(n):\r\n if (mat[i][j] == \"C\"):\r\n c += 1\r\n \r\n if (c > 1):\r\n count += (c * (c - 1)) // 2\r\n \r\nfor i in range(n):\r\n c = 0\r\n\r\n for j in range(n):\r\n if (mat[j][i] == \"C\"):\r\n c += 1\r\n \r\n if (c > 1):\r\n count += (c * (c - 1)) // 2\r\n\r\nprint(count)", "n = int(input())\r\nrows = []\r\nfor x in range(n):\r\n string = input()\r\n row = list(string)\r\n rows.append(row)\r\ncolumns = [[x[y] for x in rows] for y in range(n)]\r\na = 0\r\nfor x in rows:\r\n b = x.count(\"C\")\r\n a += b * (b - 1) // 2\r\nfor x in columns:\r\n b = x.count(\"C\")\r\n a += b * (b - 1) // 2\r\nprint(a)", "from math import factorial\r\n\r\nn = int(input())\r\nc_x = []\r\nc_y = []\r\nres = 0\r\n\r\nfor i in range(n):\r\n row = input()\r\n for j in range(n):\r\n if row[j] == 'C':\r\n c_x.append(i)\r\n c_y.append(j)\r\n\r\nfor i in range(n):\r\n x_equals = c_x.count(i)\r\n res += (factorial(x_equals) // (2 * (factorial(max(0, x_equals - 2)))))\r\n\r\n y_equals = c_y.count(i)\r\n res += (factorial(y_equals) // (2 * (factorial(max(0, y_equals - 2)))))\r\n\r\nprint(res)\r\n", "n = int(input())\r\nmaps = []\r\nans = 0\r\nfor i in range(n):\r\n maps.append(input())\r\n ans += (maps[-1].count('C') - 1) * maps[-1].count('C') // 2\r\n\r\nfor i in range(n):\r\n cnt = 0\r\n for j in range(n):\r\n if maps[j][i] == 'C':\r\n cnt += 1\r\n ans += (cnt - 1) * cnt // 2\r\n\r\nprint(ans)", "n=int(input())\r\nl=['']*n\r\nans=int(0)\r\nfor i in range(n):\r\n s=input()\r\n m=s.count('C')\r\n ans+=(m*(m-1))//2\r\n for j in range(n):\r\n l[j]+=(s[j])\r\nfor j in range(n):\r\n m=l[j].count('C')\r\n ans+=(m*(m-1))//2\r\nprint(ans)\r\n", "n=int(input())\r\nmat=['']*n\r\nr=0\r\nfor k in range(n):\r\n mat[k]=input()\r\n r+=(mat[k].count('C')*(mat[k].count('C')-1)/2)\r\nfor k in range(n):\r\n c=0\r\n for i in range(n):\r\n c+=(mat[i][k]=='C')\r\n r+=(c*(c-1)/2)\r\nprint(int(r))", "n = int(input())\r\nli =[]\r\nfor _ in range(n):\r\n li.append(input())\r\n\r\nans = 0\r\nc = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if li[i][j] == \"C\":\r\n c += 1\r\n ans += (1 if c == 2 else c * (c - 1) // 2)\r\n c = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if li[j][i] == \"C\":\r\n c += 1\r\n ans += (1 if c == 2 else c * (c - 1) // 2)\r\n c = 0\r\nprint(ans)", "n =int(input())\nx=[[i for i in input()] for j in range(0,n)]\nsumm =0\nfor i in range(n):\n\tcur = 0\n\tfor j in range(n):\n\t\tif (x[i][j]=='C'):\n\t\t\tcur+=1\n\tsumm+=cur*(cur-1)//2\nfor j in range(n):\n\tcur = 0\n\tfor i in range(n):\n\t\tif (x[i][j]=='C'):\n\t\t\tcur+=1\n\tsumm+=cur*(cur-1)//2\nprint(summ)", "n = int(input())\na = [[0 for i in range(n)] for i in range(n)]\nanswer = 0\n\nfor i in range(n): \n row = input()\n for j in range(n):\n a[i][j] = row[j]\n\nfor r in range(n):\n row = a[r]\n for i in range(n):\n for j in range(i+1, n):\n if row[i] == 'C' and row[i] == row[j]:\n answer += 1\n\nfor c in range(n):\n for i in range(n):\n for j in range(i+1, n):\n if a[i][c] == \"C\" and a[i][c] == a[j][c]:\n answer += 1\n\nprint (answer)\n \n", "p=lambda x:x*(x-1)//2\r\nn,r=int(input()),0\r\na=[input()for j in[0]*n]\r\nfor i in[0,0]:r+=sum(p(x.count('C'))for x in a);a=zip(*a)\r\nprint(r)", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tface = list()\r\n\tfor i in range(n):\r\n\t\tline = str(input())\r\n\t\tline = line.replace('.', '0')\r\n\t\tline = line.replace('C', '1')\r\n\t\tline = [int(it) for it in line]\r\n\t\tface.append(list(line))\r\n\ttar = 0\r\n\tfor i in range(n):\r\n\t\tline_c = list()\r\n\t\tline_r = list()\r\n\t\tfor j in range(n):\r\n\t\t\tline_c.append(face[i][j])\r\n\t\t\tline_r.append(face[j][i])\r\n\t\tsum_c = sum(line_c)\r\n\t\tsum_r = sum(line_r)\r\n\t\ttar += sum_c * (sum_c - 1) // 2\r\n\t\ttar += sum_r * (sum_r - 1) // 2\r\n\tprint(tar)\r\n", "n = int(input())\r\na = 0\r\nx = []\r\nfor i in range(n):\r\n x.append(list(input()))\r\n s = x[i].count('C')\r\n a += s * (s - 1)\r\nfor i in range(n):\r\n counter = 0\r\n for t in range(n):\r\n if x[t][i] == 'C':\r\n counter += 1\r\n a += counter * (counter - 1)\r\nprint(a // 2)", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn = int(input())\nrow, col = [0] * n, [0] * n\n\nfor r in range(n):\n s = input().rstrip()\n for c, v in enumerate(s):\n if v == \"C\":\n row[r] += 1\n col[c] += 1\n\nres = 0\nfor i in range(n):\n if row[i] > 1:\n res += row[i] * (row[i]-1) // 2\n if col[i] > 1:\n res += col[i] * (col[i]-1) // 2\n\nprint(res)\n", "from itertools import chain\r\n\r\ncount_pairs = lambda n: n * (n - 1) // 2\r\n\r\ncake = [input() for _ in range(int(input()))]\r\nprint(sum(count_pairs(line.count('C')) for line in chain(cake, zip(*cake))))", "n = int(input())\r\ncake = []\r\nfor i in range(n):\r\n s = input()\r\n cake.append(s)\r\n\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if cake[i][j] == '.':\r\n continue\r\n\r\n # row\r\n for k in range(j + 1, n):\r\n if cake[i][k] == 'C':\r\n count += 1\r\n\r\n # column\r\n for k in range(i + 1, n):\r\n if cake[k][j] == 'C':\r\n count += 1\r\n\r\n\r\n\r\nprint(count)", "n = int(input())\r\nans = 0\r\np = []\r\nfor i in range(n):\r\n p.append(list(input()))\r\n s = p[i].count('C')\r\n ans += s * (s - 1)\r\nfor i in range(n):\r\n col = 0\r\n for t in range(n):\r\n if p[t][i] == 'C':\r\n col += 1\r\n ans += col * (col - 1)\r\nprint(ans // 2)\r\n\r\n \r\n", "n = int(input())\r\nx = []\r\nv = []\r\nu = []\r\nfor i in range(n):\r\n x.append(list(input()))\r\n\r\nfor i in range(n):\r\n k = 0\r\n for j in range(n):\r\n k += x[i][j]=='C'\r\n v.append(k)\r\n \r\nfor j in range(n):\r\n k = 0\r\n for i in range(n):\r\n k += x[i][j]=='C'\r\n u.append(k)\r\n \r\nr = 0\r\nfor i in u:\r\n r += i*(i-1)//2\r\nfor i in v:\r\n r += i*(i-1)//2\r\nprint(r)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nc1=c2=0\r\nfor i in range(n):\r\n for j in range(n-1):\r\n for f in range(j+1,n):\r\n if l[i][j]==l[i][f]=='C':\r\n c1+=1\r\n if l[j][i]==l[f][i]=='C':\r\n c2+=1\r\n\r\nprint(c2+c1)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\nans = 0\r\nfor i in range(n):\r\n t = 0\r\n for j in range(n):\r\n if a[i][j] == 'C':\r\n t += 1\r\n ans += t * (t - 1) // 2\r\nfor i in range(n):\r\n t = 0\r\n for j in range(n):\r\n if a[j][i] == 'C':\r\n t += 1\r\n ans += t * (t - 1) // 2\r\nprint(ans)\r\n", "count = 0\r\nn = int(input())\r\na = [[i for i in input()] for _ in range(n)]\r\nfor i in range(n):\r\n c, d = 0, 0\r\n for j in range(n):\r\n if a[i][j] == 'C':\r\n c += 1\r\n if a[j][i] == 'C':\r\n d += 1\r\n count += ((c-1)*c) // 2\r\n count += ((d-1)*d) // 2\r\nprint(count)", "import math\r\n\r\n\r\ndef ncr(n):\r\n f = math.factorial\r\n if(n>1):\r\n return (f(n) / (f(2) * f(n - 2)))\r\n else:\r\n return 0\r\n\r\n\r\nn = int(input())\r\nnum = 0\r\narr = [0 for i in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n count = s.count('C')\r\n num += ncr(count)\r\n for i in range(n):\r\n if (s[i] == 'C'):\r\n arr[i] += 1\r\n\r\narr2=list(map(ncr,arr))\r\nprint(int(num+sum(arr2)))\r\n", "'''input\n3\n.CC\nC..\nC.C\n'''\nfrom math import factorial as f\nn = int(input())\nt = 0\nr = [input() for _ in range(n)]\nfor x in r:\n\tx1 = x.count(\"C\")\n\tif x1 > 1:\n\t\tt += f(x1) // (2*(f(x1-2)))\nfor y in range(n):\n\tc = [r[z][y] for z in range(n)]\n\ty1 = c.count(\"C\")\n\tif y1 > 1:\n\t\tt += f(y1) // (2*(f(y1-2)))\nprint(t)\n\n\n\n\n\n\n\n\n\n", "#Ana Clara Lacaze\n#193858\n \nn = int(input())\narr = [input() for x in range(n)]\nacc = 0\nfor i in arr:\n x = i.count('C')\n acc += x*(x-1)//2\nfor i in range(n):\n x = 0\n for j in range(n):\n if arr[j][i] == 'C':\n x += 1\n acc += x*(x-1)//2\nprint(acc)\n \t\t \t\t \t \t \t \t\t\t \t \t", "def fact(k):\r\n if k==0:return 0\r\n return k+fact(k-1)\r\nn=int(input());arr=[]\r\nfor _ in range(n):\r\n s=[i for i in input()];arr.append(s)\r\nans=0\r\n#row\r\nfor i in range(n):\r\n cnt=0\r\n for j in range(n):\r\n if arr[i][j]=='C':cnt+=1\r\n if cnt>=1:ans+=fact(cnt-1);k1=fact(cnt-1)\r\n\r\n#col\r\nfor i in range(n):\r\n cnt=0\r\n for j in range(n):\r\n if arr[j][i]=='C':cnt+=1\r\n if cnt>=1:ans+=fact(cnt-1)\r\nprint(ans)\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\ns = []\n\nfor i in range(n):\n s.append(input())\n\n\nansw = 0\nfor i in range(n):\n for j in range(n):\n\n if s[i][j] != \"C\":\n continue\n\n for i1 in range(i+1, n):\n if s[i1][j] == \"C\":\n answ += 1\n for j1 in range(j+1, n):\n if s[i][j1] == \"C\":\n answ += 1\n\nprint(answ)\n\n\n", "from math import comb\r\nx = []\r\ny = []\r\ncnt = 0\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n cnt+= comb(s.count('C'),2)\r\n for j in range(n):\r\n if s[j]=='C':\r\n y.append(j)\r\nfor j in range(n):\r\n cnt+=comb(y.count(j),2)\r\nprint(cnt)\r\n", "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\nfrom itertools import combinations\r\n\r\ndef main():\r\n n = I()\r\n c = 0 \r\n cols = [\"\"]*n \r\n for _ in range(n):\r\n s = S()\r\n indexes = [i for i in range(n) if s[i]=='C']\r\n c+=len(list(combinations(indexes, 2)))\r\n for i in range(n):\r\n cols[i] = cols[i]+s[i]\r\n for col in cols:\r\n indexes = [i for i in range(n) if col[i]=='C']\r\n c+=len(list(combinations(indexes, 2)))\r\n return c\r\n\r\nif __name__ == '__main__':\r\n print(main())", "import math\nn = int(input())\na = []\nfor i in range(n):\n a.append(input())\ncnt = 0\nfor i in range(n):\n row, col = 0, 0\n for j in range(n):\n if a[j][i] == 'C':\n col += 1\n if a[i][j] == 'C':\n row += 1\n if row >= 2:\n cnt += math.factorial(row) / (2 * math.factorial(row - 2))\n if col >= 2:\n cnt += math.factorial(col) / (2 * math.factorial(col - 2))\nprint(int(cnt))\n", "# LUOGU_RID: 110661203\na = []\r\nn = int(input())\r\nsum = 0\r\nfor i in range(n):\r\n b = input()\r\n c = b.count('C')\r\n if c >= 2:\r\n sum += c * (c - 1) // 2\r\n a.append(b)\r\nfor i in range(n):\r\n s = 0\r\n for j in range(n):\r\n if a[j][i] == 'C':\r\n s += 1\r\n if s >= 2:\r\n sum += s * (s - 1) // 2\r\nprint(sum)", "n = int(input())\r\ncake = [[False for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n for j, ch in enumerate(s):\r\n if ch == 'C':\r\n cake[i][j] = True\r\n\r\nans = 0\r\nfor i in range(n):\r\n s = sum(1 if cake[i][j] else 0 for j in range(n))\r\n ans += (s * (s-1)) // 2\r\nfor i in range(n):\r\n s = sum(1 if cake[j][i] else 0 for j in range(n))\r\n ans += (s * (s-1)) // 2\r\nprint(ans)\r\n\r\n", "list1 = []\nlist2 = []\nsum1: int = 0\nsum2: int = 0\nsum3: int = 0\nsum4: int = 0\nn = int(input())\nlist1 = [[0]*n]*n\nlist2 = [[0]*n]*n\nresult1: int = 0\nresult2: int = 0\nfor i in range(n):\n list1[i] = list(input())\n result1 = list1[i].count(\"C\")\n # print(result1)\n if result1 >= 2:\n sum1 = result1 * (result1 - 1) / 2\n sum2 += sum1\n sum1 = 0\n result1 = 0\nlist2 = list(map(list, zip(*list1)))\nfor j in range(n):\n result2 = list2[j].count(\"C\")\n # print(list2)\n # print(result2)\n if result2 >= 2:\n sum3 = result2 * (result2 - 1) / 2\n sum4 += sum3\nsum3 = 0\nresult2 = 0\n# print(sum4)\nsum5 = sum2 + sum4\nprint(int(sum5))\n # print(list1)\n\n \t \t \t\t \t \t \t\t \t\t\t\t", "\ndef felicidade_door(comprimento_lado_bolo):\n list_aux = []\n solve_a = 0\n for k in range(comprimento_lado_bolo):\n linha_input = input()\n num_c = linha_input.count('C')\n cont_pos = 0\n tam = len(linha_input)\n while cont_pos < tam:\n if(linha_input[cont_pos] == 'C' or linha_input[cont_pos] == 'c'):\n list_aux.append(cont_pos)\n cont_pos = cont_pos + 1\n solve_a = ((num_c-1)*num_c)//2+ solve_a \n cont_pos = 0\n while cont_pos < tam:\n num_c = list_aux.count(cont_pos)\n solve_a = ((num_c-1)*num_c)//2+ solve_a \n cont_pos = cont_pos + 1\n return solve_a\n\ndef solve_a():\n \n comprimento_lado_bolo = int(input())\n solve_a = felicidade_door(comprimento_lado_bolo)\n print(solve_a)\n \n\nsolve_a()\n\n\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, comb\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 = I()\r\n c = 0 \r\n cols = [\"\"]*n \r\n for _ in range(n):\r\n s = S()\r\n count = s.count('C')\r\n if count > 1:\r\n c+=comb(count, 2)\r\n for i in range(n):\r\n cols[i] = cols[i]+s[i]\r\n for col in cols:\r\n count = col.count('C')\r\n if count > 1:\r\n c+=comb(count, 2)\r\n return int(c)\r\n\r\nif __name__ == '__main__':\r\n print(main())", "import sys\r\n\r\ndef main():\r\n s = sys.stdin.read().strip().split('\\n')[1:]\r\n c = 0\r\n for i in s:\r\n t = i.count('C')\r\n c += t*(t - 1)//2\r\n for i in zip(*s):\r\n t = i.count('C')\r\n c += t*(t - 1)//2\r\n return c\r\n\r\nprint(main())\r\n", "# def fac(num):\r\n# if num>1:\r\n# return num*fac(num-1)\r\n# else:\r\n# return num\r\nimport math\r\ndef comb(num):\r\n f = math.factorial\r\n if num>1:\r\n return int(f(num)/(f(2)*f(num-2)))\r\n else:\r\n return 0\r\nn = int(input())\r\nsum_1 =0\r\narr = [0 for i in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n count=s.count('C')\r\n sum_1+=comb(count)\r\n for i in range(n):\r\n if s[i] == 'C':\r\n arr[i]+=1\r\narr2 = list(map(comb, arr))\r\nprint(int(sum_1+sum(arr2)))", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = [input() for i in range(n)]\r\nf = lambda x: x * (x - 1) // 2\r\ncnt = 0\r\nfor i in range(n):\r\n k1 = a[i].count('C')\r\n k2 = sum(a[j][i] == 'C' for j in range(n))\r\n cnt += f(k1) + f(k2)\r\nprint(cnt)\r\n", "import math\n\nn = int(input())\ncake = []\nfor _ in range(n):\n cake.append(input())\n \nhappiness = 0\n\nfor i in range(n):\n chocs = cake[i].count('C')\n happiness += (chocs > 1)*math.comb(chocs,2)\n chocs = 0\n for j in range(n):\n chocs += (cake[j][i] == 'C')\n happiness += (chocs > 1)*math.comb(chocs,2)\nprint(happiness)\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=int(input())\r\n\r\nt=[]\r\nfor i in range(n):\r\n\tt.append(input())\r\nc=0\r\nfor i in range(n):\r\n\tb=0\r\n\tfor j in range(n):\r\n\t\tif t[i][j]==\"C\":\r\n\t\t\tb+=1\r\n\tc+=b*(b-1)//2\r\n\r\nfor i in range(n):\r\n\tb=0\r\n\tfor j in range(n):\r\n\t\tif t[j][i]==\"C\":\r\n\t\t\tb+=1\r\n\tc+=b*(b-1)//2\r\nprint(c)", "c=0\r\nn=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n a.append(input())\r\n b.append(a[i])\r\n\r\nfor i in range(n):\r\n for k in range(n):\r\n if b[i][k]=='C':\r\n for x in range(k+1,n):\r\n if b[i][x]=='C':\r\n c+=1\r\nfor i in range(n):\r\n for k in range(n):\r\n if a[i][k]=='C':\r\n for x in range(i+1,n):\r\n if a[x][k]=='C':\r\n c+=1\r\nprint(c)", "n=int(input())\r\nh=[0 for i in range(n)]\r\nv=[0 for i in range(n)]\r\nk=n\r\nwhile k>0:\r\n k-=1\r\n s=input()\r\n for i in range(n):\r\n if s[i]=='C':\r\n h[k]+=1\r\n v[i]+=1\r\nsm=0\r\nfor i in range(n):\r\n sm+=h[i]*(h[i]-1)//2 + v[i]*(v[i]-1)//2\r\nprint(sm)", "from math import comb\nn = int(input())\na = [0] * 2 * n\nfor i in range(n):\n s = input()\n x = 0\n for j in range(n):\n if s[j] == 'C':\n x += 1\n a[j] += 1\n a[n + i] = x\nans = 0\nfor x in a:\n ans += comb(x, 2)\nprint(ans)\n", "n=int(input())\r\ns=[]\r\nans=0\r\nfor _ in range(n):\r\n line=input()\r\n s.append(line)\r\n m=line.count('C')\r\n ans+=m*(m-1)//2\r\nfor i in range(n):\r\n m=0\r\n for j in range(n):\r\n if s[j][i]=='C':\r\n m+=1\r\n ans+=m*(m-1)//2\r\nprint(ans)", "def main():\n n = int(input());\n linhas = [0 for i in range(n)];\n colunas = [0 for i in range(n)];\n pares = 0;\n for i in range(n):\n entrada = input();\n for j in range(n):\n if(entrada[j] == 'C'):\n linhas[i] += 1;\n colunas[j] += 1;\n for i in range(n):\n pares += (linhas[i]*(linhas[i] - 1))/2;\n pares += (colunas[i]*(colunas[i] - 1))/2;\n print(int(pares));\nmain();\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\nans = 0\r\ndef fact(n):\r\n ans = 1\r\n for i in range(2, n+1):\r\n ans*=i\r\n return ans\r\ncols = [0 for i in range(n)]\r\nrows = [0 for i in range(n)]\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(list(input()))\r\nfor r in range(n):\r\n for c in range(n):\r\n if(grid[r][c]=='C'):\r\n rows[r]+=1\r\n cols[c]+=1\r\nfor i in range(n):\r\n ans+=(fact(rows[i])//(fact(rows[i]-2)*2))\r\n ans+=(fact(cols[i])//(fact(cols[i]-2)*2))\r\nprint(ans)\r\n", "n = int(input())\r\na = []\r\nb = []\r\nm = 0\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n b.append(s[j])\r\n a.append(b[:])\r\n b.clear()\r\nfor m in range(n):\r\n for i in range(n - 1):\r\n for j in range(i + 1, n, 1):\r\n if a[m][i] == a[m][j] == \"C\":\r\n ans += 1\r\nfor m in range(n):\r\n for i in range(n - 1):\r\n for j in range(i + 1, n, 1):\r\n if a[i][m] == a[j][m] == \"C\":\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nc = list()\r\nkol = 0\r\nfor i in range(n):\r\n\tk = input()\r\n\tc.append(k)\r\nfor i in range(n):\r\n\tko = c[i].count('C')\r\n\tkol += (ko * (ko - 1)) // 2\r\nc = [*zip(*c)]\r\nfor i in range(n):\r\n\tko = c[i].count('C')\r\n\tkol += (ko * (ko - 1)) // 2\r\nprint(kol)\r\n\t\r\n", "n = int(input())\ns = []\nnum = 0\nfor i in range(n):\n zi = input()\n s.append(list(zi))\nfor x in range(n):\n d = s[x].count('C')\n num = num + (d*(d-1))/2\nfor x in range(n):\n m = 0\n for y in range(n):\n if s[y][x] == 'C':\n m = m + 1\n num = num + (m*(m-1))/2\n num = int(num)\nprint(num)\n\t \t\t \t \t\t \t\t \t \t \t \t \t\t\t", "from math import comb\nn = int(input())\n\nmatriz = []\nfor i in range(n):\n matriz.append(input())\n \nchocoRow = 0\nchocoColumn = 0\nhapiness = 0\n\nm = len(matriz[0])\nn = len(matriz)\n\nfor i in range(n):\n chocoRow = matriz[i].count(\"C\")\n hapiness += comb(chocoRow, 2)\n \nfor j in range(m):\n column = []\n for i in range(n):\n column.append(matriz[i][j])\n \n chocoColumn = column.count(\"C\")\n hapiness += comb(chocoColumn, 2)\n \nprint(hapiness)\n \t \t\t \t\t \t\t\t\t \t \t\t\t \t", "n = int(input())\r\nsp = [0 for i in range(n)]\r\nc = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n d = s.count(\"C\")\r\n c += d*(d-1)//2\r\n for j in range(n):\r\n if s[j] == \"C\":\r\n sp[j] = sp[j] + 1\r\n\r\nfor i in sp:\r\n c += i*(i-1)//2\r\n\r\nprint(c)", "n=int(input())\r\nrows=[]\r\ncolumns=[]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(n):\r\n if s[j]=='C':\r\n rows.append(i+1)\r\n columns.append(j+1)\r\nrow=list((dict.fromkeys(rows)).keys())\r\ncolumn=list((dict.fromkeys(columns)).keys())\r\nlist1=[]\r\nfor i in row:\r\n f=rows.count(i)\r\n if f!=1:\r\n list1.append(f)\r\nfor i in column:\r\n f=columns.count(i)\r\n if f!=1:\r\n list1.append(f)\r\ncount=0\r\nfor i in list1:\r\n count+=int(i*(i-1)/2)\r\nprint(count)", "import math\r\ndef sum(a):\r\n s=0\r\n for i in a:\r\n s=s+i\r\n return s\r\ndef tsp(a):\r\n for i in range(len(a)):\r\n for j in range(i):\r\n x=a[i][j]\r\n a[i][j]=a[j][i]\r\n a[j][i]=x\r\n return a\r\nn = int(input())\r\na=[]\r\nfor i in range(n):\r\n b = list(input())\r\n a.append(b)\r\nb = []\r\ns=0\r\nfor i in range(n):\r\n k=0\r\n for j in range(n):\r\n if a[i][j] == 'C':\r\n k += 1\r\n b.append(k*(k-1)//2)\r\ns=s+sum(b)\r\na=tsp(a)\r\nb=[]\r\nfor i in range(n):\r\n k=0\r\n for j in range(n):\r\n if a[i][j] == 'C':\r\n k += 1\r\n b.append(k*(k-1)//2)\r\ns=s+sum(b)\r\n\r\nprint(s)", "n = int(input())\nmatrix = []\n\nfor i in range(n):\n matrix.append(list(input()))\n\nt_matrix = zip(*matrix)\n\ni = 0\ncounter = 0\nfor r in t_matrix:\n row_counter = matrix[i].count('C')\n counter += row_counter * (row_counter - 1) // 2\n i += 1\n\n column_counter = r.count('C')\n counter += column_counter * (column_counter - 1) // 2\n\nprint(counter)\n\n\t\t\t \t\t \t \t \t \t\t \t \t\t\t\t\t \t\t\t", "def factorial(n):\r\n s = 1\r\n if n < 0 :\r\n return -1\r\n elif n == 0 or n == 1:\r\n s *= 1\r\n else :\r\n while n > 0:\r\n s *= n\r\n n -= 1\r\n return s\r\n\r\ndef combination(n,p):\r\n up = factorial(n)\r\n down = factorial(p)*factorial(n-p)\r\n return int(up/down)\r\n\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n l.append(list(input()))\r\n\r\ncount = 0\r\n\r\nfor i in l:\r\n count += combination(i.count('C'),2)\r\n\r\nfor i in range(n):\r\n p = []\r\n for j in range(n):\r\n p.append(l[j][i])\r\n \r\n count += combination(p.count('C'),2)\r\n\r\nprint(count)", "n = int(input())\r\nres = 0\r\nls = []\r\nfor i in range(n):\r\n s = input()\r\n cnt = 0\r\n for ch in s:\r\n if ch == 'C':\r\n cnt += 1\r\n if cnt > 1:\r\n res += cnt * (cnt - 1) // 2\r\n ls.append(s)\r\nfor i in range(n):\r\n cnt = 0\r\n for j in range(n):\r\n if ls[j][i] == 'C':\r\n cnt += 1\r\n if cnt > 1:\r\n res += cnt * (cnt - 1) // 2\r\n\r\nprint(res)\r\n", "n = int(input())\r\ncake = [input() for i in range(n)]\r\ncake2 = [[0]*n for i in range(n)]\r\ncakex = [0]*n\r\ncakey = [0]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if cake[i][j] == \"C\":\r\n cake2[i][j] = 1\r\n cakex[i] += 1\r\n cakey[j] += 1\r\n\r\nnum = 0\r\nfor i in range(n):\r\n num += cakex[i]*(cakex[i]-1) // 2\r\n num += cakey[i]*(cakey[i]-1) // 2\r\nprint(num)\r\n", "def cnt(N):\r\n if N >= 2:\r\n return N * (N - 1) // 2\r\n return 0\r\n\r\nN = int(input())\r\ngrids = [list(input()) for _ in range(N)]\r\n\r\ntotal = 0\r\nfor items in grids:\r\n total += cnt(items.count('C'))\r\nfor index in range(N):\r\n total += cnt([_[index] for _ in grids].count('C'))\r\nprint(total)", "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\nfrom math import comb\r\nans = 0\r\ncake = [input() for _ in range(int(input()))]\r\n\r\nfor r in cake:\r\n ans += comb(r.count('C'),2)\r\nfor c in zip(*cake):\r\n ans += comb(c.count('C'),2)\r\nprint(ans)", "def nCr(n, r): \r\n \r\n return (fact(n) / (fact(r) \r\n * fact(n - r))) \r\n\r\ndef fact(n): \r\n res = 1\r\n for i in range(2, n+1): \r\n res = res * i \r\n return res\r\n\r\ndict = {}\r\nn = int(input())\r\nli = []\r\nres = 0\r\ny = n\r\nfor x in range(n):\r\n dict[x] = 0\r\nwhile n > 0:\r\n li.append(input())\r\n n -= 1\r\nk = 1\r\nfor i in li:\r\n if i.count('C') >= 2:\r\n res += nCr(i.count('C'), 2)\r\n for j in range(y):\r\n if i[j] == 'C':\r\n dict[j] += 1\r\nfor s in dict:\r\n if dict.get(s) >= 2:\r\n res += nCr(dict.get(s), 2)\r\nprint(int(res))", "n = int(input())\r\nl = [input() for i in range(n)]\r\nk = 0\r\nfor i in range(n):\r\n x = y = 0\r\n for j in range(n):\r\n if l[i][j] == \"C\":\r\n x += 1\r\n if l[j][i] == \"C\":\r\n y += 1\r\n k += x * (x - 1) // 2 + y * (y - 1) // 2\r\nprint(k)", "n = int(input())\r\ng = [list(input()) for _ in range(n)]\r\n\r\nret = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if g[i][j] != \"C\":\r\n continue\r\n for x in range(j+1, n):\r\n ret += g[i][x] == \"C\"\r\n for y in range(i+1, n):\r\n ret += g[y][j] == \"C\"\r\n\r\nprint(ret)\r\n", "from math import factorial\r\ndef nCr(n,r):\r\n\treturn int((factorial(n)/(factorial(r)*factorial(n-r))))\r\ncount=0\r\na=int(input())\r\nb=[]\r\nfor x in range(a):\r\n\tb.append(list(input()))\r\nfor x in range(a):\r\n\tc=b[x].count('C')\r\n\tif c>=2:\r\n\t\tcount+=nCr(c,2)\r\nfor x in range(a):\r\n\td=0\r\n\tfor i in range(a):\r\n\t\tif b[i][x]=='C':\r\n\t\t\td+=1\r\n\tif d>=2:\r\n\t\tcount+=nCr(d,2)\r\nprint(count)\t\t\r\n", "def combi(n):\r\n return n * (n - 1) // 2\r\n\r\n\r\ndef run():\r\n n = eval(input())\r\n square = []\r\n for _ in range(n):\r\n square.append(input())\r\n ans = 0\r\n for s in square:\r\n ans += combi(s.count(\"C\"))\r\n transposed = [list(row) for row in zip(*square)]\r\n for s in transposed:\r\n ans += combi(s.count(\"C\"))\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n run()\r\n", "N = int(input())\r\nres = 0\r\nlis = []\r\n\r\nfor _ in range(N):\r\n lis.append(list(input()))\r\n\r\n\r\nl = [0]*N\r\nfor i in range(N):\r\n row = 0\r\n for j in range(N):\r\n if lis[i][j] == 'C':\r\n l[j]+=1\r\n row+=1\r\n res+=row*(row-1)/2\r\nfor i in l:\r\n res+=i*(i-1)/2\r\n\r\nprint(int(res))", "# cf 629 A 800\nimport math\nn = int(input())\n\nM = []\nfor _ in range(n):\n M.append(input())\n\nans = 0\nfor i in range(n):\n row = M[i].count('C')\n if row >= 2:\n ans += math.factorial(row) / (math.factorial(row - 2) * 2)\n c = 0\n for j in range(n):\n if M[j][i] == 'C':\n c += 1\n if c >= 2:\n ans += math.factorial(c) / (math.factorial(c - 2) * 2)\nprint(int(ans))\n", "side=int(input())\r\nrow=[0]*side; col=[0]*side\r\n\r\n#Counts for 'C' in row and col\r\nfor i in range(side):\r\n\ts=input()\r\n\tfor j in range(side):\r\n\t\tif s[j]=='C':\r\n\t\t\trow[i]+=1; col[j]+=1\r\nhappy=0\r\n#Counts happiness\r\nfor i in range(side):\r\n\tif row[i]>=2:\r\n\t\tfor j in range(row[i]-1, 0, -1):\r\n\t\t\thappy+=j\r\n\tif col[i]>=2:\r\n\t\tfor j in range(col[i]-1, 0, -1):\r\n\t\t\thappy+=j\r\n\r\nprint(happy)", "n = int(input())\narr = []\nfor i in range(0,n):\n a1 = input()\n a1 = list(a1)\n arr.append(a1)\n\nans = 0\n#print(arr)\n\ndef fact(n):\n res = 1\n for i in range(2,n+1):\n res=res*i\n\n return res\n\n\ndef ncr(n,r):\n return fact(n)//(fact(r)*fact(n-r))\n\n\nfor i in range(0,n):\n count1 =0\n count2 =0\n for j in range(0,n):\n if arr[i][j]=='C':\n count1+=1\n if arr[j][i]=='C':\n count2+=1\n\n\n ans= ans+ncr(count1,2)+ncr(count2,2)\n\n\nprint(ans)\n\n\n\n\n", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append([x for x in input()])\r\nc,s=0,0\r\nfor i in range(n):\r\n s+=((l[i].count('C')*(l[i].count('C')-1))>>1)\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if l[j][i]=='C':\r\n c+=1 \r\n s+=((c*(c-1))>>1)\r\nprint(s)\r\n", "n=int(input())\r\nw=[]\r\nres=0\r\nfor j in range(n):\r\n x=input()\r\n z=x.count(\"C\")\r\n res+=z*(z-1)//2\r\n w.append(x)\r\nfor j in range(n):\r\n z=0\r\n for k in range(n):\r\n if w[k][j]==\"C\":\r\n z+=1\r\n res+=z*(z-1)//2\r\nprint(res)", "n=int(input())\narr=[input() for t in range(n)]\nnum=0\nfor i in arr:\n m=i.count('C')\n num+=m*(m-1)//2\nfor i in range(n):\n m=0\n for j in range(n):\n if arr[j][i]=='C':\n m+=1\n num+=m*(m-1)//2\nprint(num)\n\t \t\t \t\t \t\t \t \t\t \t \t \t", "n = int(input())\r\nm = []\r\nk = 0\r\nfor _ in range(n):\r\n m.append(input())\r\n k += (m[-1].count('C')-1)*m[-1].count('C')//2\r\nfor i in zip(*m):\r\n k += (i.count('C')-1)*i.count('C')//2\r\nprint(k)", "n = int(input())\n\ncake = [list(input()) for i in range(n)]\n\npairs = 0\nfor row in range(n):\n for col in range(n-1):\n if cake[row][col] == \"C\":\n for second in range(col+1, n):\n if cake[row][second] == \"C\":\n pairs += 1\n\nfor col in range(n):\n for row in range(n-1):\n if cake[row][col] == \"C\":\n for second in range(row+1, n):\n if cake[second][col] == \"C\":\n pairs += 1\n\nprint(pairs)\n\n \t\t\t\t\t\t\t\t \t \t \t \t \t \t \t", "from math import comb\r\n\r\nn = int(input())\r\na = [input() for x in range(n)]\r\ns = 0\r\nfor i in range(n):\r\n c = a[i].count('C')\r\n s += comb(c, 2)\r\n c = 0\r\n for j in range(n):\r\n c += a[j][i] == 'C'\r\n s += comb(c, 2)\r\nprint(s)", "from math import factorial\n\n\nfactorials = {}\n\ndef fact(n):\n if n not in factorials:\n factorials[n] = factorial(n)\n\n return factorials[n]\n\ndef combine_2(n):\n return (int) (fact(n) / (2 * fact(n - 2)))\n\nn = int(input())\n\nlines = {}\ncolumns = {}\n\nfor y in range(n):\n line = input()\n for x, cell in enumerate(line):\n if cell != 'C':\n continue\n\n if y not in lines:\n lines[y] = 0\n\n if x not in columns:\n columns[x] = 0\n\n lines[y] += 1\n columns[x] += 1\n\nsum = 0\nfor _, amount in lines.items():\n sum += combine_2(amount) if amount > 1 else 0\n\nfor _, amount in columns.items():\n sum += combine_2(amount) if amount > 1 else 0\n\nprint(sum)\n\n\t \t\t \t\t \t \t \t \t\t \t\t \t\t", "n = int(input())\n\nrow = [0] * n\ncol = [0] * n\nfor i in range(n):\n line = input()\n for j in range(n):\n if line[j] == 'C':\n row[i] += 1\n col[j] += 1\n\nans = 0\nfor i in range(n):\n if row[i] > 0:\n ans += row[i] * (row[i]-1) // 2\n if col[i] > 0:\n ans += col[i] * (col[i]-1) // 2\n\nprint(ans)\n", "n = int(input())\n\ncake = []\nhapp = 0\n\nfor i in range(n):\n row = input()\n cnt = row.count('C')\n happ += (cnt * (cnt - 1)) / 2\n cake.append(row)\n\nfor col in range(n):\n cnt = 0\n\n for row in range(n):\n if cake[row][col] == 'C':\n cnt += 1\n\n happ += (cnt * (cnt - 1)) / 2\n\nprint(int(happ))\n", "n = int(input())\r\na = []\r\nt = 0\r\nfor i in range(n):\r\n a.append(list(input()))\r\n x = a[-1].count('C')\r\n t +=((x*(x-1)//2))\r\nfor i in zip(*a):\r\n x = list(i).count('C')\r\n t +=((x*(x-1)//2))\r\nprint(t)\r\n", "n=int(input())\r\nd=[]\r\nfor i in range(n):\r\n\tc=list(input())\r\n\td.append(c)\r\ntot_row=0\r\n\r\nfor i in range(len(d)):\r\n\tm=d[i].count('C')\r\n\ttot_row+=m*(m-1)//2\r\n\r\nw=list(zip(*d))\r\nfor i in range(len(w)):\r\n\tw[i]=list(w[i])\r\n\r\n\r\ntot_col=0\r\nfor i in range(len(w)):\r\n\tm=w[i].count('C')\r\n\ttot_col+=m*(m-1)//2\r\n\r\nprint(tot_row+tot_col)\r\n", "\"\"\"\ninstagram : essipoortahmasb2018\ntelegram channel : essi_python\n\n\"\"\"\n# formula : n(n-1)/2 state counter\na=[]\nCount=0\nn=int(input())\ncolumn=[0 for i in range(n)] # number C in each column\nfor i in range(n):\n a.append(input())\nAnswer=0\nfor i in range(n):\n for j in range(n):\n if a[i][j]=='C':\n column[j]+=1\n Count+=1\n if Count>=2:\n Answer+=Count*(Count-1)//2\n Count=0\nfor i in column:\n if i>=2:\n Answer+=i*(i-1)//2\nprint(Answer)\n\n", "import math\r\nfrom collections import Counter, deque\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nfrom heapq import *\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef pair(n):\r\n return (n - 1) * n // 2\r\n\r\n\r\ndef main():\r\n n = II()\r\n p = [0] * n\r\n ans = 0\r\n for i in range(n):\r\n s = IS()\r\n ans += pair(s.count('C'))\r\n for j in range(n):\r\n if s[j] == 'C':\r\n p[j] += 1\r\n for i in range(n):\r\n ans += pair(p[i])\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n # mod = 10 ** 9 + 7\r\n # for _ in range(II()):\r\n # main()\r\n main()\r\n\r\n", "p=lambda x:x*(x-1)//2\r\nn=int(input())\r\na=[input() for _ in[0]*n]\r\nr=sum(p(x.count('C')) for x in a)\r\na=[[a[j][i] for j in range(n)] for i in range(n)]\r\nr+=sum(p(x.count('C')) for x in a)\r\nprint(r)", "s=[]\r\nfrom math import factorial\r\nz=[]\r\np=0\r\n\r\ndef c(a,b):\r\n return factorial(a)/((factorial(b))*factorial(a-b))\r\n\r\nx=int((input()))\r\nv=[0]*x\r\nfor n in range(x):\r\n z=list(input())\r\n if z.count('C')>=2:\r\n p+=c(z.count('C'),2)\r\n for k in range(x):\r\n if z[k]=='C':\r\n v[k]+=1\r\nfor n in range(x):\r\n if v[n]<=1:\r\n v[n]=0\r\n else:\r\n v[n]=c(v[n],2)\r\nj=sum(v)\r\nprint(int(p+j))\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = 0\r\nu = [0] * n\r\nfor i in range(n):\r\n x = list(input().rstrip())\r\n v = 0\r\n for j in range(n):\r\n if x[j] & 1:\r\n u[j] += 1\r\n v += 1\r\n ans += v * (v - 1) // 2\r\nfor i in u:\r\n ans += i * (i - 1) // 2\r\nprint(ans)", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = [input().rstrip() for _ in range(n)]\r\n\r\nans = 0\r\nfor i in range(n):\r\n cnt = data[i].count('C')\r\n tmp = 0\r\n for j in range(n):\r\n tmp += 1 if data[j][i] == 'C' else 0\r\n ans += math.comb(cnt, 2) + math.comb(tmp, 2)\r\n\r\nprint(ans)", "n=int(input(\"\"))\narr=[]\nfor i in range(n):\n\tvalue=str(input(\"\"))\n\tarr.append(value)\ncount=0\nfor i in range(0,n):\n for j in range(0,n-1):\n for k in range(j+1,n):\n if((arr[i])[j]==(arr[i])[k] and (arr[i])[j]=='C'):\n count+=1\n if((arr[j])[i]==(arr[k])[i] and (arr[j])[i]=='C'):\n count+=1\nprint(count)\n \n\n \t \t \t \t\t\t\t\t \t \t\t\t \t \t\t", "count, ans = 0, 0\nn = int(input())\na = []\n\nfor i in range(n):\n a.append(input())\n\nfor i in range(n):\n for j in range(n):\n count = 0\n if (a[i][j] == 'C'):\n for k in range(i+1, n):\n if (a[k][j] == 'C'):\n count += 1\n for k in range(j+1, n):\n if (a[i][k] == 'C'):\n count += 1\n ans += count\n\nprint(ans)\n\t\t\t \t \t\t\t \t\t\t\t\t \t\t\t\t \t", "n=int(input())\nans=0\nmat=[]\nfor i in range(n):\n\tx=input()\n\tyo=x.count('C')\n\tans+=(yo*(yo-1)//2)\n\tmat.append(x)\nfor i in range(n):\n\tcount=0\n\tfor j in range(n):\n\t\tif mat[j][i]=='C':\n\t\t\tcount+=1\n\tans+=(count*(count-1)//2)\nprint(ans)\t\t\t\n", "a=[]\r\nb=[]\r\nfor _ in range(int(input())):\r\n\ta.append(list(input()))\r\nfor i in range(len(a)):\r\n\tp=0\r\n\tb.append(a[i].count('C'))\r\n\tfor t in range(len(a)):\r\n\t\tif a[t][i]=='C':\r\n\t\t\tp+=1\r\n\tb.append(p)\r\nprint(sum([(i*(i-1))//2 for i in b]))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "a=[]\r\ns=0\r\nn=int(input())\r\nfor _ in range(n):\r\n\ta.append(input())\r\nfor i in range(n):\r\n\tr=c=0\r\n\tfor j in range(n):\r\n\t\tif a[i][j]=='C':\r\n\t\t\tr+=1\r\n\t\tif a[j][i]=='C':\r\n\t\t\tc+=1\r\n\ts+=(r*(r-1))//2+(c*(c-1))//2\r\nprint(s)", "def comb(n):\n if n == 0:\n return 0\n\n q = n ** 2\n return (q-n)/2\n\n\nn = int(input())\nl = [0] * n\nc = [0] * n\nfor i in range(n):\n s = str(input())\n qc = 0\n for j, char in enumerate(s):\n if char == 'C':\n c[j] += 1\n qc += 1\n l[i] = qc\n\n\n\nh = 0\nfor k in range(n):\n c1, c2 = 0,0\n if (l[k] > 1):\n c1 = l[k]\n \n if (c[k] > 1):\n c2 = c[k]\n\n h += comb(c1) + comb(c2)\n\nprint(int(h))\n \t\t\t\t\t\t\t\t\t\t \t \t\t\t \t \t\t \t\t\t", "\r\n\r\ndef q_4A():\r\n w = int(input())\r\n if w <= 2: print(\"NO\")\r\n elif (w-2)%2 == 0: print(\"YES\")\r\n else: print(\"NO\")\r\n\r\ndef q_629_A():\r\n n = int(input())\r\n cake = [input() for i in range(n)]\r\n\r\n # cake = ['CC..', 'C..C', '.CC.', '.CC.']\r\n # n = len(cake)\r\n\r\n rows = [0 for i in range(n)]\r\n collumns = [0 for i in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if cake[i][j] == \".\": continue\r\n collumns[j] += 1\r\n rows[i] += 1\r\n total = 0\r\n for r in rows: total+=(r)*(r-1)//2\r\n for c in collumns: total+= (c)*(c-1)//2\r\n print(total)\r\n\r\nq_629_A()", "n = int(input())\ncake = []\n\nfor i in range(n):\n line = list(input())\n cake.append(line)\n\n\n\ndef combination(number):\n x = 0\n for i in range(number):\n x = x + (number-i-1)\n return x\n\n\ncombination_row = 0\ncombination_column = 0\nfor i in range(n):\n chocolate_row = 0\n chocolate_column = 0\n for j in range(n):\n if(cake[i][j] == 'C'):\n chocolate_row = chocolate_row + 1\n if(cake[j][i] == 'C'):\n chocolate_column = chocolate_column + 1\n combination_row = combination_row + combination(chocolate_row)\n combination_column = combination_column + combination(chocolate_column)\n\nprint(combination_column + combination_row)\n\t\t \t\t\t\t \t \t \t\t \t\t\t\t \t\t \t", "import math\nn = int(input())\n\ndef nCr(n, r):\n f=math.factorial\n return int(f(n) / (f(r) * f(n - r)))\ncake=[]\nfor i in range(n):\n cake.append(input())\n\nhappiness=0\nfor row in cake:\n choclates = row.count('C')\n if choclates >= 2:\n happiness += nCr(choclates, 2)\n\nfor row in zip(*cake):\n choclates = row.count('C')\n if choclates >= 2:\n happiness += nCr(choclates, 2)\n\nprint(happiness)\n\n", "matrix = list()\r\nresult = int()\r\nfor i in range(int(input())):\r\n matrix.append(input())\r\nfor row in matrix:\r\n count = row.count('C')\r\n result += (count - 1) * count // 2\r\nfor column in zip(*matrix):\r\n count = column.count('C')\r\n result += (count - 1) * count // 2\r\nprint(result)", "def combin2(n):\n \"\"\"Nombre de combinaisons de n objets pris k a k\"\"\"\n x = 1\n y = 1\n i = n - 1\n while i <= n:\n x = (x * i) // y\n y += 1\n i += 1\n return x\n\n\ndef main():\n n = int(input())\n cake = []\n happiness = 0\n\n for _ in range(n):\n s = input()\n cake += [s]\n happiness += combin2(s.count('C'))\n\n transposed = [''.join([cake[j][i] for j in range(n)]) for i in range(n)]\n\n for i in range(n):\n happiness += combin2(transposed[i].count('C'))\n\n print(happiness)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\n\r\nmatrix = []\r\nfor _ in range(n):\r\n matrix.append([i for i in input()])\r\n\r\n# print(*matrix)\r\n\r\nlevel_of_happiness = 0\r\n\r\nfor row in matrix:\r\n quantity = row.count('C')\r\n level_of_happiness += (quantity - 1) * (quantity / 2)\r\n\r\n# print(level_of_happiness)\r\n\r\nfor column in range(n):\r\n amount_of_chocolate = 0\r\n for row in range(n):\r\n amount_of_chocolate += 1 if matrix[row][column] == 'C' else 0\r\n\r\n level_of_happiness += (amount_of_chocolate - 1) * (amount_of_chocolate / 2)\r\n\r\nprint(int(level_of_happiness))\r\n", "import math\r\ncase= int(input())\r\nll=[]\r\nfor i in range(case):\r\n row=list(input())\r\n ll.append(row)\r\n\r\nr=0\r\nfor i in ll:\r\n if i.count(\"C\")>1:\r\n r+=math.comb(i.count(\"C\"),2)\r\nv=0\r\nfor i in range(case-1):\r\n for t in range(i+1,case):\r\n for a in range(case):\r\n if ll[i][a]==\"C\" and ll[i][a]==ll[t][a]:\r\n v+=1\r\n\r\nprint(v+r)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\n \r\nc=0\r\nfor i in range(n):\r\n w=a[i].count(\"C\")\r\n c+=w*(w-1)//2\r\n \r\nfor i in range(n):\r\n w=0\r\n for j in range(n):\r\n if a[j][i]==\"C\":\r\n w+=1\r\n c+=w*(w-1)//2\r\nprint(c)\r\n", "n = int(input())\ncake = []\n\nfor i in range(n):\n cake.append(input())\n\ncount = 0\nfor i in range(n):\n for k in range(n):\n if cake[i][k] == 'C':\n for j in range(i + 1, n):\n if cake[j][k] == 'C':\n count += 1\n for j in range(k + 1, n):\n if cake[i][j] == 'C':\n count += 1\n\nprint(count)", "n = int(input())\r\nmass = []\r\nfor i in range(n):\r\n mass.append(input())\r\n\r\nrows = [0] * n\r\ncolumns = [0] * n\r\n\r\nfor i in range(n):\r\n rows[i] = mass[i].count('C')\r\nfor i in range(n):\r\n for j in range(n):\r\n if mass[i][j] == \"C\":\r\n columns[j] += 1\r\n\r\ncount = 0\r\nfor elem in rows:\r\n count += (elem * (elem - 1)) // 2\r\nfor elem in columns:\r\n count += (elem * (elem - 1)) // 2\r\nprint(count) \r\n", "def fact(n):\r\n if n <=1 :\r\n return 1\r\n else:\r\n return n * fact(n-1)\r\n\r\ndef c(n,r) :\r\n return fact(n) // (fact(r) * fact(n - r))\r\n\r\nn = int(input())\r\narr = []\r\nh = 0\r\nfor _ in range(n):\r\n arr.append(list(input()))\r\n \r\nfor i in arr:\r\n if i.count(\"C\") >= 2:\r\n h += c(i.count(\"C\") , 2)\r\n \r\narr = list(map(list, zip(*arr)))\r\n\r\nfor i in arr:\r\n if i.count(\"C\") >= 2:\r\n h += c(i.count(\"C\") , 2)\r\n \r\nprint(h)", "# import sys\r\nimport math\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN=int(input())\r\nL=[]\r\nfor i in range(N):\r\n\tL.append(list(input()))\r\nsum=0\r\nfor i in range(N):\r\n\tcount1=0\r\n\tcount2=0\r\n\tfor j in range(N):\r\n\t\tif L[i][j]==\"C\":\r\n\t\t\tcount1+=1\r\n\tif count1>=2:\r\n\t\tsum+=int(math.factorial(count1)/math.factorial(count1-2))\r\n\tfor k in range(N):\r\n\t\tif L[k][i]=='C':\r\n\t\t\tcount2+=1\r\n\tif count2>=2:\r\n\t\tsum+=int(math.factorial(count2)/math.factorial(count2-2))\r\nprint(int(sum/2))", "from math import comb\r\n\r\n# Step 1: Read the input\r\nn = int(input())\r\ncake = [input() for _ in range(n)]\r\n\r\n# Step 2: Initialize counts\r\nrow_count = [0] * n\r\ncol_count = [0] * n\r\n\r\n# Step 3: Count chocolates in each row and column\r\nfor i in range(n):\r\n for j in range(n):\r\n if cake[i][j] == 'C':\r\n row_count[i] += 1\r\n col_count[j] += 1\r\n\r\n# Step 4: Calculate Famil Door's happiness\r\nhappiness = 0\r\nfor count in row_count:\r\n happiness += comb(count, 2)\r\nfor count in col_count:\r\n happiness += comb(count, 2)\r\n\r\n# Step 5: Print the happiness\r\nprint(happiness)\r\n", "n=int(input())\r\nc=[]\r\nh=0\r\nfor i in range(n):\r\n a=input()\r\n c.append(a)\r\n j=a.count('C')\r\n h+=(j*(j-1))//2\r\nfor i in range(n):\r\n b=0\r\n for j in range(n):\r\n if(c[j][i]=='C'):\r\n b+=1\r\n h+=(b*(b-1))//2\r\nprint(h)", "\r\nfrom itertools import combinations \r\n\r\nn = int(input())\r\nl = []\r\ntotal_rows = 0\r\ntotal_col = 0\r\nfor _ in range(n):\r\n\tl1 = list(input())\r\n\tl.append(l1)\r\nfor i in l:\r\n\tlp = []\r\n\tfor j in range(n):\r\n\t\tif i[j] == 'C':\r\n\t\t\tlp.append(j)\r\n\tcomb = combinations(lp,2)\r\n\ttotal_rows += len(list(comb))\r\n\r\nfor i in range(n):\r\n\tlp = []\r\n\tfor j in range(n):\r\n\t\tif l[j][i] == 'C':\r\n\t\t\tlp.append(j)\r\n\tcomb = combinations(lp,2)\r\n\ttotal_col += len(list(comb))\r\n\r\n\r\nprint(total_col + total_rows)\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_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#to read integers\r\nget_int = lambda: int(sys.stdin.readline().strip())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nmatrix = []\r\n\r\ndef nC2(n):\r\n return ( (n-1)*n )//2\r\n\r\nfor _ in range(n):\r\n matrix.append(get_string())\r\n\r\nrowCount = 0 \r\nfor row in matrix:\r\n rowCount += nC2(row.count('C'))\r\n\r\nmatrixTrans = []\r\nfor i in range(n):\r\n matrixTrans.append([ matrix[j][i] for j in range(n) ])\r\n\r\ncolCount = 0 \r\nfor row in matrixTrans:\r\n colCount += nC2(row.count('C'))\r\n\r\nprint(colCount+rowCount)", "from math import factorial as f\r\n\r\nn = int(input())\r\na = []\r\nans = 0\r\nfor i in range(n):\r\n b = input()\r\n a.append(b)\r\n c = b.count('C')\r\n if c > 1:\r\n ans += (f(c) // (2 * f(c - 2)))\r\n\r\n\r\nfor i in range(n):\r\n c = 0\r\n for j in range(n):\r\n if a[j][i] == 'C':\r\n c += 1\r\n if c > 1:\r\n ans += (f(c) // (2 * f(c - 2)))\r\n\r\nprint(ans)\r\n", "import math\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n\ttemp1 = input()\r\n\ta.append(temp1)\r\n#checking row-wise\r\ncount = 0\r\nfor i in range(n):\r\n\ttempCountRow = 0\r\n\ttempCountColumn = 0\r\n\tfor j in range(n):\r\n\t\tif a[i][j] == 'C':\r\n\t\t\ttempCountRow+=1\r\n\t\tif a[j][i] =='C':\r\n\t\t\ttempCountColumn+=1\r\n\t# det tempCountColumn combination 2\r\n\tcount+=math.comb(tempCountRow,2)\r\n\tcount+=math.comb(tempCountColumn,2)\r\n\t#print(tempCountRow)\r\n\t#print(tempCountColumn)\r\nprint(int(count))", "import math\n\nsize = int(input(''))\n\ncake = []\n\nfinalcake = []\n\nfor i in range(size):\n\n\tchocolate = input('')\n\n\tcake.append(chocolate)\n\nfor i in range(size):\n\n\tline = []\n\n\tfor j in cake[i]:\n\t\tline.append(j)\n\n\tfinalcake.append(line)\n\ntotalPairs = 0\n\nfor i in range(size):\n\tx = 0\n\tfor j in range(size):\n\t\tif finalcake[i][j] == 'C':\n\t\t\tx += 1\n\n\tif x >= 2:\n\t\ttotalPairs += (math.factorial(x))//(math.factorial(2) * math.factorial(x-2))\n\nfor i in range(size):\n\tx = 0\n\tfor j in range(size):\n\t\tif finalcake[j][i] == 'C':\n\t\t\tx += 1\n\n\tif x >= 2:\n\t\ttotalPairs += (math.factorial(x))//(math.factorial(2) * math.factorial(x-2))\n\nprint(int(totalPairs))\n \t \t\t \t\t\t\t \t \t \t\t \t\t", "data = []\r\nn = int(input())\r\nfor i in range(n):\r\n\ttemp = input().strip()\r\n\tdata.append(temp)\r\n\r\nans = 0\r\nfor i in range(n):\r\n\ttemp = data[i].count('C')\r\n\tans += (temp*(temp-1))//2\r\nfor i in range(n):\r\n\tcnt = 0\r\n\tfor j in range(n):\r\n\t\tif data[j][i] == 'C':\r\n\t\t\tcnt += 1\r\n\tans += (cnt*(cnt-1))//2\r\nprint(ans)\r\n", "import math\n\ndef combine(n,p):\n return math.factorial(n)/((math.factorial(p))*(math.factorial(n-p)))\n \n\nn = int(input())\n\nmatrix = []\ncounter = 0\n\nfor _ in range(n):\n aux = input()\n\n matrix.append(aux)\n\nfor row in matrix: \n cs = row.count(\"C\")\n \n if(cs >= 2):\n counter += combine(cs,2)\n \n\nfor i in range(n): \n column = []\n for row in matrix:\n column.append(row[i])\n cs = column.count(\"C\")\n if( cs >= 2):\n counter += combine(cs,2)\n\nprint(int(counter))\n\n#n/k = (n-1/(k-1)+n-1/k)\n\n\t \t\t\t \t\t\t\t \t \t \t\t \t\t\t \t \t", "def calc(n):\r\n x = (n*(n-1))\r\n x = x//2\r\n return x\r\n\r\nn = int(input())\r\nmat = []\r\nrow,col = [0 for i in range(n)],[0 for i in range(n)]\r\nfor i in range(n):\r\n l = list(map(str,input()))\r\n mat.append(l)\r\n x = 0\r\n for j in range(n):\r\n if l[j]=='C':\r\n col[j]+=1\r\n x+=1\r\n row[i]+=x\r\nans = 0\r\nfor i in row:\r\n ans+=calc(i)\r\nfor i in col:\r\n ans+=calc(i)\r\nprint(ans)", "a=int(input())\r\ntable=[]\r\nfor i in range(a):\r\n table.append(input())\r\nresult=0\r\nfor i in range(a):\r\n result+=(table[i].count('C')*(table[i].count('C')-1))//2\r\nfor i in range(a):\r\n qwe=0\r\n for j in range(a):\r\n if table[j][i]=='C':\r\n qwe+=1\r\n result+=(qwe*(qwe-1))//2\r\nprint(result)\n# Wed Jul 29 2020 17:36:57 GMT+0300 (Москва, стандартное время)\n", "n = int(input())\r\nl,c,h = [],0,0\r\nfor i in range(n):\r\n\tl.append(list(input()))\r\nfor i in range(n):\r\n\tk=l[i][::].count('C')\r\n\tfor j in range(n):\r\n\t\tif l[j][i]=='C':\r\n\t\t\th+=1\r\n\tc+=((((k-1)*k)//2+((h-1)*h)//2))\r\n\th=0\r\nprint(c)", "# You lost the game.\nn = int(input())\nM = [str(input()) for _ in range(n)]\nR = [0 for _ in range(n)]\nC = [0 for _ in range(n)]\nfor i in range(n):\n for j in range(n):\n if M[i][j] == \"C\":\n R[i] += 1\n C[j] += 1\nr = 0\nfor i in range(n):\n r = r + (R[i]-1)*R[i]//2\n r = r + (C[i]-1)*C[i]//2\nprint(r)\n", "li= []\r\nn = int(input())\r\nfor i in range(n):\r\n a = list(input())\r\n li.append(a)\r\nk = 0\r\nc = 0\r\nfor i in range(n):\r\n k = li[i].count('C')\r\n c += k*(k-1)//2\r\nk= 0\r\nfor j in range(n):\r\n for l in range(n):\r\n if li[l][j]=='C':\r\n k+=1\r\n c += k*(k-1)//2\r\n k = 0\r\nprint(c)", "n = int(input())\ns = []\nfor i in range(n):\n s.append(input())\nsum0 = 0\nsum1 = 0\nfor j in range(n):\n for l in range(n):\n if s[j][l] == 'C':\n sum0 = sum0 + 1\n if sum0 >= 2:\n sum1 = sum0 * (sum0 - 1) // 2 + sum1\n sum0 = 0\nfor l in range(n):\n for j in range(n):\n if s[j][l] == 'C':\n sum0 = sum0 + 1\n if sum0 >= 2:\n sum1 = sum0 * (sum0 - 1) // 2 + sum1\n sum0 = 0\nprint(sum1)\n\t\t\t\t \t\t\t \t\t \t\t\t \t \t \t", "tamanho = int(input())\n\nbolo = [[0 for _ in range(tamanho)] for _ in range(tamanho)]\n\nfor linha in range(tamanho):\n entrada = list(input())\n for coluna in range(tamanho):\n bolo[linha][coluna] = entrada[coluna]\n\nchoco = 0\npares = 0\nfor linha in range(tamanho):\n for coluna in range(tamanho):\n if bolo[linha][coluna] == 'C':\n choco += 1\n pares += choco * (choco - 1) / 2\n choco = 0\n\nfor coluna in range(tamanho):\n for linha in range(tamanho):\n if bolo[linha][coluna] == 'C':\n choco += 1\n pares += choco * (choco - 1) / 2\n choco = 0\n\nprint(int(pares))\n \t\t \t \t\t \t\t\t \t \t \t \t \t", "n = int(input())\n\ncake = []\n\nfor i in range(n):\n cake.append([])\n\ncont = 0\nw = n\n\nwhile n > 0:\n y = str(input())\n \n for k in y:\n cake[cont].append(k)\n\n n = n - 1\n cont = cont + 1\n\naux = 0\nr = 0\n\nfor j in range(0, w, 1):\n \n for l in range(0, w, 1):\n aux = 0\n \n if cake[j][l] == 'C':\n \n for q in range((j + 1), w, 1):\n \n if cake[q][l] == 'C':\n aux = aux + 1 \n \n for q in range((l + 1), w, 1):\n \n if cake[j][q] == 'C':\n aux = aux + 1 \n \n r = r + aux\n\nprint(r)\n \t \t\t\t\t \t \t\t\t \t \t\t\t \t\t \t \t", "__author__ = 'vboldovs'\r\nimport math\r\n\r\ndef combination(n,m):\r\n if n <2:\r\n return 0\r\n return math.factorial(n)/(math.factorial(n-m)*math.factorial(m))\r\n\r\ncake_matrix = []\r\nhappiness = 0\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n cake_matrix.append(input())\r\n\r\n#row calc\r\nfor i in range(n):\r\n temp = 0\r\n for j in range(n):\r\n if cake_matrix[i][j] == 'C':\r\n temp +=1\r\n happiness += combination(temp,2)\r\n\r\n#col calc:\r\nfor i in range(n):\r\n temp = 0\r\n for j in range(n):\r\n if cake_matrix[j][i] == 'C':\r\n temp +=1\r\n happiness += combination(temp,2)\r\n\r\nprint(int(happiness))", "n = int(input())\r\n\r\nrows = [0] * n\r\ncols = [0] * n\r\n\r\ndef fact(num):\r\n res = 1\r\n while num > 1:\r\n res *= num\r\n num -= 1\r\n return res\r\n\r\ndef nC2(count):\r\n if count < 2:\r\n return 0\r\n elif count == 2:\r\n return 1\r\n return fact(count)//(2*fact(count-2))\r\n\r\nfor row in range(n):\r\n for col, ch in enumerate(input()):\r\n if ch == \"C\":\r\n rows[row] += 1\r\n cols[col] += 1\r\n\r\nres = sum((nC2(num) for num in rows)) + sum((nC2(num) for num in cols))\r\nprint(res)\r\n", "n = int(input())\r\na = [input() for i in range(n)]\r\nres = 0\r\nfor i in range(n):\r\n r = a[i].count('C')\r\n res += r * (r-1) // 2\r\nfor i in range(n):\r\n r = 0\r\n for j in range(n):\r\n if a[j][i] == 'C':\r\n r += 1\r\n res += r * (r-1) // 2\r\nprint(res)", "def nCr(n , r):\r\n return (fact(n) // (fact(r)\r\n * fact(n - r)))\r\ndef fact(n):\r\n res = 1\r\n\r\n for i in range(2 , n + 1):\r\n res = res * i\r\n\r\n return res\r\na=[]\r\nn=int(input())\r\nfor i in range(n):\r\n a.append(input())\r\nans=0\r\nfor i in range(n):\r\n aa=0\r\n for j in range(n):\r\n if a[j][i]=='C':\r\n aa+=1\r\n ans+=nCr(aa,2)\r\nans1=0\r\nfor i in range(n):\r\n aa=0\r\n for j in range(n):\r\n if a[i][j]=='C':\r\n aa+=1\r\n ans1+=nCr(aa,2)\r\nprint(ans+ans1)\r\n\r\n\r\n", "n=int(input())\r\ns=[input()for i in range(n)]\r\nr=0\r\nfor i in range(n):\r\n\tx=y=0\r\n\tfor j in range(n):x+=s[i][j]=='C';y+=s[j][i]=='C'\r\n\tr+=x*(x-1)//2+y*(y-1)//2\r\nprint(r)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nans = 0\r\nfor i in range(n):\r\n b = 0\r\n c = 0\r\n for j in range(n):\r\n if a[i][j] == 'C':\r\n b += 1\r\n if a[j][i] == 'C':\r\n c += 1\r\n ans += (b * (b - 1)) // 2\r\n ans += (c * (c - 1)) // 2\r\nprint(ans)", "def twoCx(x):\r\n x = int(x)\r\n if x < 2:\r\n return 0\r\n return int(x * (x - 1) / 2)\r\nn = int(input())\r\ncakes = []\r\nres = 0\r\nfor i in range (n):\r\n count = 0\r\n row = list(input())\r\n cakes.append(row)\r\n for j in range (n):\r\n if row[j] == 'C':\r\n count += 1\r\n res += twoCx(count)\r\nfor j in range (n):\r\n count = 0\r\n for i in range (n):\r\n if cakes[i][j] == 'C':\r\n count += 1\r\n res += twoCx(count)\r\n\r\nprint(res)\r\n", "import math\r\ncase= int(input())\r\nll=[]\r\nfor i in range(case):\r\n row=list(input())\r\n ll.append(row)\r\nr=0\r\nv=0\r\nfor a in range(case):\r\n aa=0\r\n for i in ll:\r\n if i[a]==\"C\":\r\n aa+=1\r\n if i.count(\"C\") > 1:\r\n r += math.comb(i.count(\"C\"), 2)\r\n v+=math.comb(aa,2)\r\nprint((r//case)+v)", "def binom(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\nn = int(input())\r\ncake = [input() for row in range(n)]\r\npairs = sum([binom(row.count('C'), 2) for row in cake])\r\npairs += sum([binom(col.count('C'), 2) for col in [[row[i] for row in cake] for i in range(n)]])\r\nprint(pairs)\r\n", "z=[];s=0;import math;k=0\r\nfor _ in \" \"*int(input()):\r\n k=input();a=[]\r\n for i in range(len(k)):\r\n if k[i]==\"C\":a=a+[i];z=z+[i]\r\n s=s+((math.factorial(len(a)))//(math.factorial(abs(len(a)-2))*2))\r\nfor i in range(len(k)):s=s+(math.factorial(z.count(i))//(math.factorial(abs(z.count(i)-2))*2))\r\nprint(s)", "from collections import defaultdict\r\nimport math\r\nx=int(input())\r\nans=0\r\nmat=[]\r\nfor _ in range(x):\r\n a=input()\r\n mat.append(a)\r\n temp=0\r\n for i in a:\r\n if(i=='C'):\r\n temp+=1\r\n ans+=(temp*(temp-1))//2\r\nfor i in range(x):\r\n temp=0\r\n for j in range(x):\r\n if(mat[j][i]=='C'):\r\n temp+=1\r\n ans+=(temp*(temp-1))//2\r\nprint(ans)\r\n \r\n\r\n", "def f(k):\r\n return (k*(k-1))//2\r\n \r\nn=int(input())\r\nrow=[0 for i in range(n)]\r\ncol=[0 for i in range(n)]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(n):\r\n if s[j]=='C':\r\n row[i]+=1\r\n col[j]+=1\r\nans=0\r\nfor i in range(n):\r\n ans+=(f(row[i])+f(col[i]))\r\nprint(ans)", "n = int(input())\ntext = [list(input()) for i in range(n)]\nrez = 0\nfor i in text:\n a = i.count('C')\n rez += a * (a - 1) // 2\nfor i in range(n):\n a = 0\n for j in range(n):\n if text[j][i] == 'C':\n a += 1\n rez += a * (a - 1) // 2\nprint(rez)", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\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()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\n# nCr(2) -- START --\ndef cmb(n,r):\n if n-r<r: r=n-r\n if r==0: return 1\n if r==1: return n\n\n numerator=[n-r+k+1 for k in range(r)]\n denominator=[k+1 for k in range(r)]\n\n for p in range(2,r+1):\n pivot=denominator[p-1]\n if pivot>1:\n offset=(n-r)%p\n for k in range(p-1,r,p):\n numerator[k-offset]/=pivot\n denominator[k]/=pivot\n\n result=1\n for k in range(r):\n if numerator[k]>1:\n result*=int(numerator[k])\n\n return result\n# nCr(2) --- END ---\n\ndef main():\n n=I()\n l=[S() for _ in range(n)]\n\n a=[]\n for i in range(n):\n cnt=0\n for j in range(n):\n if l[i][j]=='C':\n cnt+=1\n if cnt>=2:\n a.append(cnt)\n\n for i in range(n):\n cnt=0\n for j in range(n):\n if l[j][i]=='C':\n cnt+=1\n if cnt>=2:\n a.append(cnt)\n\n ans=0\n for x in a:\n ans+=cmb(x,2)\n\n return ans\n\n# main()\nprint(main())\n", "n = int(input().strip())\n\nc = [0] * n\nl = [0] * n\n\ns = [0, 0]\nacc = 0\nfor i in range(n):\n acc += i + 1\n s.append(acc)\n\nfor i in range(n):\n line = input().strip()\n for j in range(n):\n if line[j] == 'C':\n c[j] += 1\n l[i] += 1\n\nr = 0\nfor i in range(n):\n r += s[c[i]] + s[l[i]]\nprint(r)\n\n \t\t \t \t\t\t\t \t \t\t \t \t\t\t", "ans=0\nlst = [''] * 105\nn = int(input())\nfor i in range(n):\n lst[i] = input()\nfor i in range(n):\n x = 0\n for j in range(n):\n if lst[i][j]=='C':x+=1\n ans+=x*(x-1)//2\n\nfor i in range(n):\n x = 0\n for j in range(n):\n if lst[j][i]=='C':x+=1\n ans+= x*(x-1)//2\n\nprint(ans)\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\nans=0\r\nj=[0]*n\r\nfor i in range(n):\r\n c=input()\r\n for i in range(n):\r\n if c[i]=='C':j[i]+=1\r\n ans+=sum(range(c.count('C')))\r\nfor i in j:ans+=sum(range(i))\r\nprint(ans)", "from math import comb\r\n\r\ns = 0\r\na = []\r\nfor i in range(int(input())):\r\n st = [c for c in input()]\r\n s += comb(st.count('C'), 2)\r\n a.append(st)\r\n\r\nfor t in zip(*a):\r\n s += comb(t.count('C'), 2)\r\n\r\nprint(s)\r\n\r\n##########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n##########################################", "import math\n\ncache = {0:0, 1:0, 2:1, 3:3, 4:6}\nfac = {0:0, 1:1, 2:2, 3:6, 4:24}\n\ndef f(n):\n fun = math.factorial\n if n in fac:\n return fac[n]\n a = fun(n)\n fac[n] = a\n return fun(n)\n\ndef nCr(n,r):\n if n in cache:\n return cache[n]\n a = f(n) / f(r) / f(n-r)\n cache[n] = a\n return a\n\ndef readList():\n l = ''\n while not l:\n try:\n l = input()\n except:\n pass\n return [char for char in l]\n\nn = int(input())\ncake = [readList() for _ in range(n)]\nrows = [0] *n\ncols = [0] *n\nfor i in range(n):\n for j in range(n):\n if cake[i][j] == 'C':\n rows[i] += 1\n cols[j] += 1\nans = 0\nfor row in rows:\n ans += nCr(row,2) \n\nfor col in cols:\n ans += nCr(col,2) \n\nprint(int(ans)) \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\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n for i in range(n):\r\n A.append(input())\r\n row = [0] * n\r\n col = [0] * n\r\n for i in range(n):\r\n for j in range(n):\r\n if A[i][j] == 'C':\r\n row[i] += 1\r\n col[j] += 1\r\n ans = 0\r\n for a in row:\r\n ans += a * (a - 1) // 2\r\n for a in col:\r\n ans += a * (a - 1) // 2\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nvet= []\niter = n\naux = 0\nwhile(n>0):\n vet.append(list(map(str, input().strip())))\n n-=1\nfor i in range(0,iter):\n for j in range(0,iter):\n if(vet[i][j] == 'C'):\n for w in range(j+1,iter):\n if(vet[i][w] == 'C'):\n aux+=1\n for w in range(i+1,iter):\n if(vet[w][j] == 'C'):\n aux+=1\nprint(aux)\n \t\t\t \t\t \t \t\t \t \t \t\t\t\t \t", "\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\ncounter = 0\r\nfor i in range(n):\r\n x = y = 0\r\n for j in range(n):\r\n x += s[i][j] == 'C'\r\n y += s[j][i] == 'C'\r\n counter += x * (x-1) // 2+y * (y-1)//2\r\nprint(counter)\r\n\r\n#\r\n# CodeForcesian\r\n# ♥\r\n# خیلی وقته دارم رو این سوال کار میکنم\r\n# تا به یک جواب جدید برسم\r\n# اما دیگه خسته شدم\r\n# میخوام سابمیتش کنم\r\n# امروز هر چی زدم غیر یکی همه تو همون سابمیت اول اکسپت شدن\r\n# واسه تک تکتون چنین چیزی رو واسه همه روزاتون اونم از صمیم قلب ارزو میکنم\r\n", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\nl=list()\r\nfor i in range(n):\r\n l.append(input())\r\nm=a=0\r\nfor i in range(n):\r\n for j in l[i]:\r\n if(j=='C'):\r\n a+=1\r\n m+=round(a*(a-1)/2)\r\n a=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(l[j][i]=='C'):\r\n a+=1\r\n m+=round(a*(a-1)/2)\r\n a=0\r\nprint(m)", "# http://codeforces.com/contest/629/problem/A\r\nn = int(input())\r\n\r\ncolumns = dict()\r\ntotal = 0\r\nfor i in range(n):\r\n row = input()\r\n row_count = 0\r\n for j in range(n):\r\n if row[j] == 'C':\r\n row_count += 1\r\n columns[j] = columns.get(j, 0) + 1\r\n if row_count >= 2:\r\n total += (row_count * (row_count - 1)//2)\r\n\r\n\r\nfor v in columns.values():\r\n total += (v * (v - 1) // 2)\r\n\r\nprint(total)\r\n\r\n", "def f(n):\r\n return (n * (n + 1)) >> 1\r\nn, lst, dem1, dem2, res = int(input()), [], 0, 0, 0\r\nfor x in range(n): lst.append(input())\r\nfor i in range(n):\r\n dem1, dem2 = 0, 0\r\n for j in range(n): \r\n if lst[i][j] == 'C': dem1 += 1\r\n if lst[j][i] == 'C': dem2 += 1\r\n res += f(dem1 - 1) + f(dem2 - 1)\r\nprint(res)", "n = int(input())\r\ns = [ input() for i in range(n)]\r\nf = lambda x: x * (x - 1) // 2\r\nans = 0\r\nfor i in range(n):\r\n\tcnt1 = s[i].count('C')\r\n\tcnt2 = sum(s[j][i] == 'C' for j in range(n))\r\n\tif cnt1 > 1:\r\n\t\tans += f(cnt1)\r\n\tif cnt2 > 1:\r\n\t\tans += f(cnt2)\r\n\r\nprint(ans)", "n = int(input())\r\na = list(list(map(str,input()))for i in range(n))\r\ncount = 0\r\nfor i in range (n):\r\n for j in range(n):\r\n if a[i][j] == \"C\":\r\n for k in range (j+1,n):\r\n if a[i][j] == a[i][k]:\r\n count +=1\r\n for d in range (i+1,n):\r\n if a[i][j] == a[d][j]:\r\n count +=1\r\n a[i][j] = \".\"\r\nprint(count)", "n = int(input())\nl = [list(input()) for i in range(n)]\nrows = [0 for i in range(n)]\ncols = [0 for i in range(n)]\nans = 0\nfor i in range(n):\n for j in range(n):\n if l[i][j] == 'C':\n rows[i] += 1\n cols[j] += 1\n\nfor i in range(n):\n ans += max(0, (rows[i])*(rows[i]-1)/2)\n ans += max(0, (cols[i])*(cols[i]-1)/2)\nprint(int(ans))\n", "n = int(input())\r\nli = []\r\nfor _ in range(n):\r\n li.append(input())\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n if li[i][j] == \"C\":\r\n for k in range(i+1, n):\r\n if li[k][j] == \"C\":\r\n cnt += 1\r\n for k in range(j+1, n):\r\n if li[i][k] == \"C\":\r\n cnt += 1\r\n ans += cnt\r\nprint(ans)\r\n", "n = int(input())\n\nmatriz = [[0 for i in range(n)] for j in range(n)]\n\nfor linha in range(n):\n matriz[linha] = input(\"\")\n\nsoma = 0\nfor i in range(n):\n contadorC = 0\n for j in range(n):\n if matriz[i][j] == 'C':\n contadorC += 1\n if contadorC > 1:\n for k in range(contadorC):\n soma += k\n\nfor i in range(n):\n contadorC = 0\n for j in range(n):\n if matriz[j][i] == 'C':\n contadorC += 1\n if contadorC > 1:\n for k in range(contadorC):\n soma += k\n\nprint(soma)\n\t\t\t \t \t\t \t\t \t \t\t \t\t", "n=int(input())\r\nl=[]\r\ns=0\r\nfor i in range (n):\r\n\ta=input()\r\n\tl.append(a)\r\n\ts1=a.count(\"C\")\r\n\ts=s+(s1*(s1-1))//2\r\nfor i in range(n):\r\n\ts1=0\r\n\tfor j in range(n):\r\n\t\tif l[j][i]==\"C\":\r\n\t\t\ts1=s1+1\r\n\ts=s+(s1*(s1-1))//2\r\nprint(s)", "s = int(input())\na = [[1 if x == \"C\" else 0 for x in input()] for _ in range(s)]\nt = 0\nfor l in a:\n t += sum(range(1, sum(l)))\nfor l in zip(*a):\n t += sum(range(1, sum(l)))\n\nprint(t)\n \n\n\t \t \t\t \t\t \t\t\t \t \t \t\t", "n = int(input())\r\narr = [input() for i in range(n)]\r\nres = 0\r\nfor i in range(n):\r\n s = sum([1 for x in arr[i] if x == 'C'])\r\n res += (s * (s-1)) // 2\r\nfor i in range(n):\r\n s = sum([1 for j in range(n) if arr[j][i] == 'C'])\r\n res += (s * (s-1)) // 2\r\nprint(res)\r\n", "n = int(input())\r\n# 1 <= n <= 100\r\nfrom sys import stdin\r\nfrom math import factorial\r\nlines = [stdin.readline() for i in range(n)]\r\ntable = [list(line.strip()) for line in lines]\r\ntable = [[1 if c == \"C\" else 0 for c in line] for line in table]\r\nt_table = list(map(list, zip(*table)))\r\ncount = 0\r\nfor i in range(n):\r\n num = sum(table[i])\r\n if num > 1:\r\n num_pairings = factorial(num) / factorial(2) / factorial(num-2)\r\n count += num_pairings\r\n num = sum(t_table[i])\r\n if num > 1:\r\n num_pairings = factorial(num) / factorial(2) / factorial(num-2)\r\n count += num_pairings\r\nprint(int(count))\r\n", "import math\r\n\r\nnumber = int(input())\r\ncoulmns = [0 for i in range(0 , number) ]\r\nrows = [0 for i in range(0 , number) ]\r\nfor i in range(0 , number) :\r\n x = input()\r\n for j in range(0 , len(x)) :\r\n if x[j] == \"C\" :\r\n rows[i] += 1\r\n coulmns[j] += 1\r\ncount = 0\r\nfor i in [rows , coulmns]:\r\n for j in i :\r\n if j == 1 or j == 0 :\r\n continue\r\n else :\r\n count += ((j*(j - 1)) / 2 )\r\nprint(math.floor(count))", "n=int(input())\nm=[]\ns=0\nfor i in range(n):\n a=input()\n m.append(a)\n s1=a.count(\"C\")\n s+=s1*(s1-1)//2\nfor i in range(n):\n s1=0\n for j in range(n):\n if(m[j][i]==\"C\"):\n s1+=1\n s+=(s1-1)*s1//2\nprint(s)\n\n\n \t\t\t\t \t\t \t\t\t\t \t \t \t \t \t\t\t", "def countc(m):\r\n count=0\r\n for i in range(len(m)):\r\n if m[i]=='C': count+=1\r\n return count/2\r\ndef ncr(count):\r\n if count<=0: return 0\r\n return count*(count-1)/2\r\nn=int(input())\r\ntotal=0\r\nhappy=0\r\nrow=[]\r\n\r\ncol=[]\r\n\r\nfor j in range(n):\r\n y=input()\r\n row.append(y)\r\n total+=countc(row[j])\r\n \r\n happy+=int(ncr(2*countc(row[j])))\r\n\r\nfor m in range(n):\r\n for k in range(n):\r\n \r\n col.append([])\r\n col[m].append(row[k][m])\r\n \r\n total+=countc(col[m])\r\n \r\n #print (countc(col[j]))\r\n happy+=int(ncr(2*countc(col[m])))\r\n\r\nprint (happy)\r\n ", "n=int(input())\r\np_r=0\r\np_c=0\r\narr=[0 for i in range(n)]\r\nfor t in range(n):\r\n c_C=0\r\n column=-1\r\n row=input()\r\n for c in row:\r\n column+=1\r\n if c==\"C\":\r\n c_C+=1\r\n arr[column]+=1\r\n if c_C!=0:\r\n p_r+=sum([i for i in range(c_C)])\r\n\r\nfor m in range(n):\r\n if arr[m] !=0:\r\n arr[m]=sum([i for i in range(arr[m])])\r\np_c=sum(arr)\r\nprint(p_r+p_c)", "def fact(n):\r\n if n == 0:\r\n return 1\r\n return n * fact(n-1)\r\n\r\n\r\ncake = []\r\nchk = 0\r\n\r\nfor _ in range(int(input())):\r\n s = input()\r\n c = s.count('C')\r\n chk += fact(c)//(2 * fact(c-2)) if c > 1 else 0\r\n cake.append(s)\r\n\r\ncake = zip(*cake)\r\n\r\nfor s in cake:\r\n c = s.count('C')\r\n chk += fact(c)//(2 * fact(c - 2)) if c > 1 else 0\r\n\r\nprint(chk)\r\n", "n = int(input())\nrows = [0] * n\ncols = [0] * n\nfor row in range(n):\n s = input()\n for col in range(n):\n if s[col] == \"C\":\n rows[row] += 1\n cols[col] += 1\nans = 0\nfor i in range(n):\n ans += (rows[i] * (rows[i] - 1) // 2) + (cols[i] * (cols[i] - 1) // 2)\n\nprint(ans)\n \t \t \t \t \t \t\t\t \t \t\t\t\t \t", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef calc(a):\r\n return sum([a[i] * (a[i] - 1) // 2 for i in range(n)])\r\n\r\n\r\ndef solution(n, a):\r\n return calc([a[i].count(\"C\") for i in range(n)]) + calc([[a[i][j] for i in range(n)].count(\"C\") for j in range(n)])\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([i for i in input()])\r\nprint(solution(n, a))\r\n", "n = int(input())\r\nmat, counter = [[0] * n for i in range(n)], 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n mat[i][j] = [0, 1][s[j] == 'C']\r\nfor i in range(n):\r\n a, b = sum(mat[i]), sum(j[i] for j in mat)\r\n counter += (a * (a - 1) + b * (b - 1)) // 2\r\nprint(counter)", "n=int(input())\r\nl=[0]*n\r\nsu=0\r\nfor i in range(n):\r\n z=input()\r\n for i in range(n):\r\n if z[i]=='C':l[i]+=1\r\n su+=sum(range(z.count('C')))\r\nfor i in l:su+=sum(range(i))\r\nprint(su)\r\n \r\n\r\n\r\n", "n = int(input())\r\n\r\nx = []\r\nfor i in range(n):\r\n\tx.append([j=='C' for j in input()])\r\n\r\nprint(sum([sum(range(1, sum(i))) for i in x]) + sum([sum(range(1, i)) for i in map(sum, zip(*x))]))", "n=int(input())\r\narr=[]\r\nt=0\r\nfor i in range(n):\r\n arr.append(list(input()))\r\n x = arr[-1].count('C')\r\n t +=((x*(x-1)//2))\r\nfor i in zip(*arr):\r\n x = list(i).count('C')\r\n t +=((x*(x-1)//2))\r\nprint(t)\r\n", "n = int(input())\r\nmatr = []\r\nfor i in range(n):\r\n\ts = input()\r\n\tmatr.append(s)\r\nrow = [0] * n\r\ncol = [0] * n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif matr[i][j] == 'C':\r\n\t\t\trow[i] += 1\r\n\t\t\tcol[j] += 1\r\nans = 0\r\nfor i in range(n):\r\n\tans += row[i] * (row[i] - 1) // 2 + col[i] * (col[i] - 1) // 2\r\nprint(ans)\r\n", "n=int(input())\n\nrc = [0]*n\ncc = [0]*n\n\nfor j in range(n):\n s = input()\n for i in range(n):\n if s[i]=='C':\n cc[i]+=1\n rc[j]+=1\n\ndef getPairs(n):\n if n>1:\n return (n*(n-1))//2\n else:\n return 0\n\nprint(sum(map(lambda x:getPairs(x),rc))+sum(map(lambda x:getPairs(x),cc)))\n", "z=[];s=0;k=0\r\nfor _ in \" \"*int(input()):\r\n k=input();a=k.count(\"C\")\r\n for i in range(len(k)):\r\n if k[i]==\"C\":z=z+[i]\r\n s=s+(a*(a-1))//2\r\nfor i in range(len(k)):a=z.count(i);s+=(a*(a-1))//2\r\nprint(s)\r\n", "\"\"\"\n\thttps://codeforces.com/problemset/problem/629/A\n\"\"\"\n\ndef getPairs(n):\n\tpairs = 0\n\tfor x in range(1, n):\n\t\tpairs += x\n\treturn pairs\n\nn = int(input())\n\n# base cases\npairings = [0, 1]\n\ncols = [0] * n\n\nrows = [0] * n\n\ncake = []\n\nfor i in range(0, n):\n\tcake.append(list(input()))\n\nfor x in range(0, n):\n\tfor y in range(0, n):\n\t\tif cake[x][y] == 'C':\n\t\t\tcols[y] += 1\n\t\t\trows[x] += 1\n\npairs = 0\n\nfor j in range(0, n):\n\tif cols[j] > 1:\n\t\tpairs += getPairs(cols[j])\n\tif rows[j] > 1:\n\t\tpairs += getPairs(rows[j])\n\nprint(pairs)", "n=int(input())\r\nm=[]\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n m+=[list(s)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if m[i][j]=='C':\r\n for x in range(n):\r\n if x!=i:\r\n if m[x][j]=='C':\r\n c+=1\r\n for x in range(n):\r\n if x!=j:\r\n if m[i][x]=='C':\r\n c+=1\r\n \r\nprint(c//2)\r\n\r\n \r\n \r\n", "n = int(input())\r\n\r\nc = [list(input()) for i in range(n)]\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n t = c[i].count('C')\r\n ans += t * (t - 1) // 2\r\n\r\nc = list(zip(*c))\r\n\r\nfor i in range(n):\r\n t = c[i].count('C')\r\n ans += t * (t - 1) // 2\r\n\r\nprint(ans)", "\r\nt=int(input())\r\nl=[]\r\nfor i in range(t):\r\n\tl.append(input())\r\nrow=0\r\nfor i in range(t):\r\n\ta=l[i].count(\"C\")\r\n\trow=row+(a*(a-1))//2\r\n\r\ncol=0\r\nfor i in range(t):\r\n\tcon=0\r\n\tfor j in range(t):\r\n\t\t\r\n\t\tif l[j][i]==\"C\":\r\n\t\t\tcon=con+1\r\n\tcol=col+(con*(con-1))//2\r\nprint(row+col)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nx,y=0,0\r\nfor i in range(n):\r\n s=l[i].count('C')\r\n x=x+(s*(s-1)//2)\r\nd=list(zip(*l))\r\nfor i in range(len(d)):\r\n d[i]=list(d[i])\r\nfor i in range(len(d)):\r\n f=d[i].count('C')\r\n y=y+(f*(f-1)//2)\r\nprint(x+y)\r\n", "import sys\r\n\r\nn = int(input())\r\ns = []\r\nres = 0\r\ncols = [0 for i in range(n)]\r\nfor i in range(n):\r\n t = input()\r\n cnt = 0\r\n for j in range(0, n):\r\n if t[j] == 'C':\r\n cnt += 1\r\n cols[j] += 1\r\n \r\n #print(cnt) \r\n res += (((1 + (cnt - 1)) * (cnt - 1)) // 2)\r\n \r\nfor i in range(n):\r\n cnt = cols[i]\r\n res += (((1 + (cnt - 1)) * (cnt - 1)) // 2)\r\n \r\nprint(res)\r\n\r\n'''\r\nCCCC\r\n1-> 2 3 4\r\n2 -> 3 4\r\n3 -> 4\r\n'''", "N=int(input())\n\ncake=[ input() for x in range(N) ]\n\nacc=0\nfor l in cake:\n\tc=l.count('C')\n\tacc += c*(c-1)//2\n\nfor col in range(N):\n\tc=0\n\tfor l in range(N):\n\t\tif cake[l][col] == 'C':\n\t\t\tc+=1\n\n\tacc += c*(c-1)//2\n\nprint(acc)\n\n", "n=int(input())\r\nd={}\r\nfor z in range(n):\r\n d[z]=0\r\ncnt=0\r\nfor z in range(n):\r\n s=input()\r\n c=0\r\n for y in range(n):\r\n if s[y]==\"C\":\r\n c+=1\r\n d[y]+=1\r\n if c>=2:\r\n cnt+=(int(c*(c-1)*0.5))\r\nfor z in range(n):\r\n if d[z]>=2:\r\n c=d[z]\r\n cnt+=(int(c*(c-1)*0.5))\r\nprint(cnt)", "import math\r\nn = int(input())\r\nc = [ input() for i in range(n) ]\r\n\r\nf = [1]\r\nfor i in range(1,n+1):\r\n f.append(f[i-1]*i)\r\n\r\nans = 0\r\nfor i in range(n):\r\n k = 0\r\n for j in range(n):\r\n if c[i][j] == 'C': k+=1\r\n if k>1: ans += f[k] / (f[2] * f[k-2])\r\n\r\nfor j in range(n):\r\n k = 0\r\n for i in range(n):\r\n if c[i][j] == 'C': k+=1\r\n if k>1: ans += f[k] / (f[2] * f[k-2])\r\n\r\nprint (int(ans))", "n=int(input())\r\nl=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n s=input()\r\n for k in range(n):\r\n if s[k]=='C':l[i][k]+=1\r\nres=0\r\nfor i in range(n):\r\n tmp=sum(l[i])\r\n if tmp!=0:res+=(tmp-1)*tmp//2\r\n tmp=0\r\n for j in range(n):tmp+=l[j][i]\r\n if tmp!=0:res+=(tmp-1)*tmp//2\r\nprint(res)\r\n", "n=int(input())\nlis=[input() for x in range(n)]\nfor i in range(n):\n lis[i]=list(lis[i])\ncnt=0\nfor i in range(n):\n for j in range(n):\n for k in range(j+1,n):\n if lis[i][j]=='C':\n if lis[i][j]==lis[i][k]:\n cnt+=1\nfor j in range(n):\n for i in range(n):\n for k in range(i+1,n):\n if lis[i][j]=='C':\n if lis[i][j]==lis[k][j]:\n cnt+=1\nprint(cnt)\n \t \t\t \t\t\t \t \t\t \t", "## It's just a O(n)\r\nn = int(input())\r\nl = [input() for i in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n S = sum(1 for j in l[i] if j =='C')\r\n ans +=( S*(S-1))//2\r\nfor i in range(n): ## rows\r\n S = sum([1 for j in range(n) if l[j][i] == 'C'])\r\n ans += ( S*(S-1))//2\r\nprint(ans)", "import sys\r\nfrom math import factorial as f\r\n\r\ndef main():\r\n s = sys.stdin.read().strip().split('\\n')[1:]\r\n c = 0\r\n def chk(s):\r\n t = s.count('C')\r\n if t < 2: return 0\r\n if t == 2: return 1\r\n return f(t)//(f(t-2)*2)\r\n for i in s:\r\n c += chk(i)\r\n for i in zip(*s):\r\n t = i.count('C')\r\n c += chk(i)\r\n return c\r\n\r\nprint(main())\r\n", "def f(n):\r\n return n*(n-1) // 2\r\n\r\nn = int(input())\r\nss = []\r\nrx = []\r\nfor i in range(n):\r\n s = input()\r\n x = s.count(\"C\")\r\n rx.append(x)\r\n ss.append(s)\r\n\r\ncx = []\r\nfor j in range(n):\r\n c = 0\r\n for i in range(n):\r\n if ss[i][j] == \"C\":\r\n c += 1\r\n cx.append(c)\r\n\r\nr = 0\r\nfor x in rx:\r\n if x != 0:\r\n r += f(x)\r\nfor x in cx:\r\n if x != 0:\r\n r += f(x)\r\nprint(r)\r\n", "n=int(input())\r\na=[]\r\nsumma=0\r\nfor y in range(n):\r\n s=input()\r\n x=s.count(\"C\")\r\n summa += x*(x-1)//2\r\n a.append(s)\r\nfor x in range(n):\r\n qatordagiClar=0\r\n for y in range(n):\r\n qatordagiClar += a[y][x]==\"C\"\r\n summa += qatordagiClar*(qatordagiClar-1)//2\r\nprint(summa)", "n =input()\r\nn=int(n)\r\nx=[]\r\nfor y in range(n):\r\n t=input()\r\n x.append(t)\r\ni=0\r\nc=0\r\nwhile i<=(n-1):\r\n j=0\r\n while j<=(n-2):\r\n if x[i][j] is'C':\r\n k=j+1\r\n while k<=(n-1):\r\n if x[i][k] is'C':\r\n c+=1\r\n k+=1\r\n j+=1\r\n i+=1\r\ni=0\r\nwhile i<=(n-1):\r\n j=0\r\n while j<=(n-2):\r\n if x[j][i]is'C':\r\n k=j+1\r\n while k<=(n-1):\r\n if x[k][i]is'C':\r\n c+=1\r\n k+=1\r\n j+=1\r\n i+=1\r\nprint(c)", "n = int(input())\r\npole = []\r\nans = 0\r\nfor i in range(n):\r\n s = input()\r\n h = 0\r\n for j in s:\r\n if j == 'C':\r\n h += 1\r\n ans += (h * (h - 1) // 2)\r\n pole.append(s)\r\nfor i in range(n):\r\n h = 0\r\n for j in range(n):\r\n if pole[j][i] == 'C':\r\n h += 1\r\n ans += (h * (h - 1) // 2)\r\nprint(ans)", "# -*- coding: utf-8 -*-\n\nn = int(input())\n\ncake = [[(1 if square == 'C' else 0) for square in input()] for _ in range(n)]\n\nans = 0\n\nfor row in cake:\n for i, square in enumerate(row):\n if square:\n for compare in (row[i+1:]):\n if compare:\n ans += 1\n\nfor column_index in range(n):\n for row_index in range(n):\n if cake[row_index][column_index]:\n for compare_index in range(row_index + 1, n):\n if cake[compare_index][column_index]:\n ans += 1\n\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())\r\na = [list(input()) for i in range(n)]\r\ns = 0\r\nfor i in a:\r\n v = 0\r\n for j in i:\r\n if(j == 'C'):\r\n v+=1\r\n s += (v * (v-1))//2\r\nfor i in range(n):\r\n v = 0 \r\n for j in range(n):\r\n if(a[j][i] == 'C'):\r\n v+=1\r\n s += (v * (v -1 ))//2\r\nprint(s)", "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\nn=int(input()) ; arr=[] ; cloum=[0]*n ; ans=0\r\nfor i in range(n):\r\n a=input()\r\n c=0\r\n for j in range(n):\r\n if a[j]==\"C\":\r\n cloum[j]+=1\r\n c+=1\r\n ans+=c*(c-1)/2\r\n\r\nfor i in cloum:\r\n ans+=i*(i-1)//2\r\nprint(int(ans))\r\n\r\n", "# LUOGU_RID: 101607150\nfrom math import comb\r\na = [input() for _ in range(int(input()))]\r\nprint(sum(comb(x.count('C'), 2) for x in a) + sum(comb(x.count('C'), 2) for x in zip(*a)))\r\n", "D = {'1': 1, '3': 6, '5': 120, '7': 5040, '9': 362880, '31': 8222838654177922817725562880000000,\r\n '30': 265252859812191058636308480000000, '33': 8683317618811886495518194401280000000, '32': 263130836933693530167218012160000000,\r\n '35': 10333147966386144929666651337523200000000, '34': 295232799039604140847618609643520000000,\r\n '37': 13763753091226345046315979581580902400000000, '36': 371993326789901217467999448150835200000000,\r\n '39': 20397882081197443358640281739902897356800000000, '38': 523022617466601111760007224100074291200000000,\r\n '79': 894618213078297528685144171539831652069808216779571907213868063227837990693501860533361810841010176000000000000000000,\r\n '78': 11324281178206297831457521158732046228731749579488251990048962825668835325234200766245086213177344000000000000000000,\r\n '75': 24809140811395398091946477116594033660926243886570122837795894512655842677572867409443815424000000000000000000,\r\n '74': 330788544151938641225953028221253782145683251820934971170611926835411235700971565459250872320000000000000000,\r\n '77': 145183092028285869634070784086308284983740379224208358846781574688061991349156420080065207861248000000000000000000,\r\n '76': 1885494701666050254987932260861146558230394535379329335672487982961844043495537923117729972224000000000000000000,\r\n '71': 850478588567862317521167644239926010288584608120796235886430763388588680378079017697280000000000000000,\r\n '70': 11978571669969891796072783721689098736458938142546425857555362864628009582789845319680000000000000000,\r\n '73': 4470115461512684340891257138125051110076800700282905015819080092370422104067183317016903680000000000000000,\r\n '72': 61234458376886086861524070385274672740778091784697328983823014963978384987221689274204160000000000000000,\r\n '100': 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000,\r\n '22': 1124000727777607680000, '23': 25852016738884976640000, '20': 2432902008176640000, '21': 51090942171709440000,\r\n '26': 403291461126605635584000000, '27': 10888869450418352160768000000, '24': 620448401733239439360000, '25': 15511210043330985984000000,\r\n '28': 304888344611713860501504000000, '29': 8841761993739701954543616000000,\r\n '68': 2480035542436830599600990418569171581047399201355367672371710738018221445712183296000000000000000,\r\n '69': 171122452428141311372468338881272839092270544893520369393648040923257279754140647424000000000000000,\r\n '66': 544344939077443064003729240247842752644293064388798874532860126869671081148416000000000000000,\r\n '67': 36471110918188685288249859096605464427167635314049524593701628500267962436943872000000000000000,\r\n '64': 126886932185884164103433389335161480802865516174545192198801894375214704230400000000000000,\r\n '65': 8247650592082470666723170306785496252186258551345437492922123134388955774976000000000000000,\r\n '62': 31469973260387937525653122354950764088012280797258232192163168247821107200000000000000,\r\n '63': 1982608315404440064116146708361898137544773690227268628106279599612729753600000000000000,\r\n '60': 8320987112741390144276341183223364380754172606361245952449277696409600000000000000,\r\n '61': 507580213877224798800856812176625227226004528988036003099405939480985600000000000000,\r\n '2': 2, '4': 24, '6': 720, '8': 40320,\r\n '99': 933262154439441526816992388562667004907159682643816214685929638952175999932299156089414639761565182862536979208272237582511852109168640000000000000000000000,\r\n '98': 9426890448883247745626185743057242473809693764078951663494238777294707070023223798882976159207729119823605850588608460429412647567360000000000000000000000,\r\n '97': 96192759682482119853328425949563698712343813919172976158104477319333745612481875498805879175589072651261284189679678167647067832320000000000000000000000,\r\n '96': 991677934870949689209571401541893801158183648651267795444376054838492222809091499987689476037000748982075094738965754305639874560000000000000000000000,\r\n '95': 10329978488239059262599702099394727095397746340117372869212250571234293987594703124871765375385424468563282236864226607350415360000000000000000000000,\r\n '94': 108736615665674308027365285256786601004186803580182872307497374434045199869417927630229109214583415458560865651202385340530688000000000000000000000,\r\n '93': 1156772507081641574759205162306240436214753229576413535186142281213246807121467315215203289516844845303838996289387078090752000000000000000000000,\r\n '92': 12438414054641307255475324325873553077577991715875414356840239582938137710983519518443046123837041347353107486982656753664000000000000000000000,\r\n '91': 135200152767840296255166568759495142147586866476906677791741734597153670771559994765685283954750449427751168336768008192000000000000000000000,\r\n '90': 1485715964481761497309522733620825737885569961284688766942216863704985393094065876545992131370884059645617234469978112000000000000000000000,\r\n '17': 355687428096000, '16': 20922789888000, '15': 1307674368000, '14': 87178291200, '13': 6227020800, '12': 479001600, '11': 39916800,\r\n '10': 3628800, '19': 121645100408832000, '18': 6402373705728000, '53': 4274883284060025564298013753389399649690343788366813724672000000000000,\r\n '52': 80658175170943878571660636856403766975289505440883277824000000000000, '51': 1551118753287382280224243016469303211063259720016986112000000000000,\r\n '50': 30414093201713378043612608166064768844377641568960512000000000000, '57': 40526919504877216755680601905432322134980384796226602145184481280000000000000,\r\n '56': 710998587804863451854045647463724949736497978881168458687447040000000000000, '55': 12696403353658275925965100847566516959580321051449436762275840000000000000,\r\n '54': 230843697339241380472092742683027581083278564571807941132288000000000000,\r\n '59': 138683118545689835737939019720389406345902876772687432540821294940160000000000000,\r\n '58': 2350561331282878571829474910515074683828862318181142924420699914240000000000000,\r\n '80': 71569457046263802294811533723186532165584657342365752577109445058227039255480148842668944867280814080000000000000000000,\r\n '81': 5797126020747367985879734231578109105412357244731625958745865049716390179693892056256184534249745940480000000000000000000,\r\n '82': 475364333701284174842138206989404946643813294067993328617160934076743994734899148613007131808479167119360000000000000000000,\r\n '83': 39455239697206586511897471180120610571436503407643446275224357528369751562996629334879591940103770870906880000000000000000000,\r\n '84': 3314240134565353266999387579130131288000666286242049487118846032383059131291716864129885722968716753156177920000000000000000000,\r\n '85': 281710411438055027694947944226061159480056634330574206405101912752560026159795933451040286452340924018275123200000000000000000000,\r\n '86': 24227095383672732381765523203441259715284870552429381750838764496720162249742450276789464634901319465571660595200000000000000000000,\r\n '87': 2107757298379527717213600518699389595229783738061356212322972511214654115727593174080683423236414793504734471782400000000000000000000,\r\n '88': 185482642257398439114796845645546284380220968949399346684421580986889562184028199319100141244804501828416633516851200000000000000000000,\r\n '89': 16507955160908461081216919262453619309839666236496541854913520707833171034378509739399912570787600662729080382999756800000000000000000000,\r\n '44': 2658271574788448768043625811014615890319638528000000000, '45': 119622220865480194561963161495657715064383733760000000000,\r\n '46': 5502622159812088949850305428800254892961651752960000000000,\r\n '47': 258623241511168180642964355153611979969197632389120000000000, '40': 815915283247897734345611269596115894272000000000,\r\n '41': 33452526613163807108170062053440751665152000000000, '42': 1405006117752879898543142606244511569936384000000000,\r\n '43': 60415263063373835637355132068513997507264512000000000, '48': 12413915592536072670862289047373375038521486354677760000000000,\r\n '49': 608281864034267560872252163321295376887552831379210240000000000,\r\n '0' : 1}\r\n\r\n\r\ndef factor(n):\r\n global D\r\n return D[str(n)]\r\n \r\nn = int(input())\r\np = []\r\nres = 0\r\n\r\nfor i in range(n):\r\n p.append(list(input()))\r\n c = p[i].count('C')\r\n res += factor(c)/(2*factor(c-2)) if c > 1 else 0\r\n\r\nfor col in list(zip(*p)):\r\n c = col.count('C')\r\n res += factor(c)/(2*factor(c-2)) if c > 1 else 0\r\n\r\nprint(int(res))\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/629/A\r\n\r\ndef comb(N,k): # from scipy.comb(), but MODIFIED!\r\n if (k > N) or (N < 0) or (k < 0):\r\n return 0\r\n N,k = map(int,(N,k))\r\n top = N\r\n val = 1\r\n while (top > (N-k)):\r\n val *= top\r\n top -= 1\r\n n = 1\r\n while (n < k+1):\r\n val //= n\r\n n += 1\r\n return val\r\n\r\nn = int(input())\r\n\r\na_r = [0] * n\r\na_c = [0] * n\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == \"C\":\r\n a_r[i] += 1\r\n a_c[j] += 1\r\n\r\nprint(sum(comb(a_r[i], 2) + comb(a_c[i], 2) for i in range(n)))", "from sys import stdin\r\n#####################################################################\r\ndef iinput(): return int(stdin.readline())\r\ndef minput(): return map(int, stdin.readline().split())\r\ndef linput(): return list(map(int, stdin.readline().split()))\r\n#####################################################################\r\n\r\nn = iinput()\r\nmat = []\r\nfor _ in range(n):\r\n mat.append(input())\r\npair = 0\r\n\r\nrow, col = [0]*n, [0]*n\r\nfor i in range(n):\r\n for j in range(n):\r\n if mat[i][j]=='C':\r\n col[j] += 1\r\n row[i] += 1\r\n\r\nfor e in row:\r\n pair += (e*(e-1))//2\r\n\r\n\r\nfor e in col:\r\n pair += (e*(e-1))//2\r\n\r\nprint(pair)", "n = int(input())\n \nc = []\nresult = 0\nfor i in range(n):\n line = list(input())\n c.append(line)\n cs = line.count('C')\n result += (cs*(cs - 1))//2\n\nc = list(zip(*c))\n\nfor i in range(n):\n cs = c[i].count('C')\n result += (cs*(cs-1))//2\nprint(result)\n\n \t\t\t \t\t \t \t\t \t\t \t \t \t", "from math import factorial\n\ndef n_pairs(n):\n return factorial(n) // (factorial(n-2) * 2)\n\nn = int(input())\ncake_columns = [0 for i in range(n)]\ntotal_pairs = 0\nfor i in range(n):\n row = list(input())\n\n for j in range(n):\n if row[j] == 'C':\n cake_columns[j] += 1\n\n n_cs = row.count('C')\n if n_cs >= 2:\n total_pairs += n_pairs(n_cs)\n\nfor column in cake_columns:\n if column >= 2:\n total_pairs += n_pairs(column)\n\nprint(total_pairs)\n\n\n \t \t\t\t \t \t \t \t \t \t \t\t \t", "import math\n\nn = int(input())\na = []\nfor i in range(n):\n x = input()\n a.append(x)\n# row count\nr = 0\nfor i in range(n):\n x = a[i].count('C')\n r+=math.comb(x,2)\n# column count\nc = 0\nfor i in range(n):\n x = 0\n for j in range(n):\n if a[j][i]=='C':\n x+=1\n c+=math.comb(x,2)\nprint(r+c)\n\t \t \t\t \t \t \t \t\t\t \t\t\t", "n=int(input())\r\nl=[]\r\nx=0\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if(l[i][j]=='C'):\r\n c+=1\r\n x+=(c*(c-1))//2\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if(l[j][i]=='C'):\r\n c+=1\r\n x+=(c*(c-1))//2\r\nprint(x)", "n=int(input())\r\nl=[]\r\nres=0\r\nfor i in range(n):\r\n l.append(list(input()))\r\ny=list(zip(*l))\r\n#print(y)\r\nfor i in range(n):\r\n x=l[i].count('C')\r\n b=y[i].count('C')\r\n res+=((x-1)*x)//2+((b-1)*b)//2\r\nprint(res)\r\n\r\n\r\n #EXERCISES WITH MATRIX\r\n#See this exercise when you have problems with matrices\r\n#How to red lists vertically(how to read columns of a matrix)\r\n#Make a list of lists if you want to make a matrix", "def pairs(n):\n return n*(n-1)//2\n\nn = int(input())\ntable = []\ncount_col = [0 for i in range(n)]\nfor i in range(n):\n table.append([x for x in input()])\n for j in range(n):\n if table[-1][j] == 'C':\n count_col[j] +=1\ncount_row = [row.count('C') for row in table]\n\nhappiness = [pairs(n) for n in count_row+count_col if n>=2]\nprint(sum(happiness))\n\n\t \t\t\t \t \t \t\t \t\t\t\t\t \t\t \t \t\t\t\t\t\t", "fact = [1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001600, 6227020800, 87178291200, 1307674368000, 20922789888000, 355687428096000, 6402373705728000, 121645100408832000, 2432902008176640000, 51090942171709440000, 1124000727777607680000, 25852016738884976640000, 620448401733239439360000, 15511210043330985984000000, 403291461126605635584000000, 10888869450418352160768000000, 304888344611713860501504000000, 8841761993739701954543616000000, 265252859812191058636308480000000, 8222838654177922817725562880000000, 263130836933693530167218012160000000, 8683317618811886495518194401280000000, 295232799039604140847618609643520000000, 10333147966386144929666651337523200000000, 371993326789901217467999448150835200000000, 13763753091226345046315979581580902400000000, 523022617466601111760007224100074291200000000, 20397882081197443358640281739902897356800000000, 815915283247897734345611269596115894272000000000, 33452526613163807108170062053440751665152000000000, 1405006117752879898543142606244511569936384000000000, 60415263063373835637355132068513997507264512000000000, 2658271574788448768043625811014615890319638528000000000, 119622220865480194561963161495657715064383733760000000000, 5502622159812088949850305428800254892961651752960000000000, 258623241511168180642964355153611979969197632389120000000000, 12413915592536072670862289047373375038521486354677760000000000, 608281864034267560872252163321295376887552831379210240000000000, 30414093201713378043612608166064768844377641568960512000000000000, 1551118753287382280224243016469303211063259720016986112000000000000, 80658175170943878571660636856403766975289505440883277824000000000000, 4274883284060025564298013753389399649690343788366813724672000000000000, 230843697339241380472092742683027581083278564571807941132288000000000000, 12696403353658275925965100847566516959580321051449436762275840000000000000, 710998587804863451854045647463724949736497978881168458687447040000000000000, 40526919504877216755680601905432322134980384796226602145184481280000000000000, 2350561331282878571829474910515074683828862318181142924420699914240000000000000, 138683118545689835737939019720389406345902876772687432540821294940160000000000000, 8320987112741390144276341183223364380754172606361245952449277696409600000000000000, 507580213877224798800856812176625227226004528988036003099405939480985600000000000000, 31469973260387937525653122354950764088012280797258232192163168247821107200000000000000, 1982608315404440064116146708361898137544773690227268628106279599612729753600000000000000, 126886932185884164103433389335161480802865516174545192198801894375214704230400000000000000, 8247650592082470666723170306785496252186258551345437492922123134388955774976000000000000000, 544344939077443064003729240247842752644293064388798874532860126869671081148416000000000000000, 36471110918188685288249859096605464427167635314049524593701628500267962436943872000000000000000, 2480035542436830599600990418569171581047399201355367672371710738018221445712183296000000000000000, 171122452428141311372468338881272839092270544893520369393648040923257279754140647424000000000000000, 11978571669969891796072783721689098736458938142546425857555362864628009582789845319680000000000000000, 850478588567862317521167644239926010288584608120796235886430763388588680378079017697280000000000000000, 61234458376886086861524070385274672740778091784697328983823014963978384987221689274204160000000000000000, 4470115461512684340891257138125051110076800700282905015819080092370422104067183317016903680000000000000000, 330788544151938641225953028221253782145683251820934971170611926835411235700971565459250872320000000000000000, 24809140811395398091946477116594033660926243886570122837795894512655842677572867409443815424000000000000000000, 1885494701666050254987932260861146558230394535379329335672487982961844043495537923117729972224000000000000000000, 145183092028285869634070784086308284983740379224208358846781574688061991349156420080065207861248000000000000000000, 11324281178206297831457521158732046228731749579488251990048962825668835325234200766245086213177344000000000000000000, 894618213078297528685144171539831652069808216779571907213868063227837990693501860533361810841010176000000000000000000, 71569457046263802294811533723186532165584657342365752577109445058227039255480148842668944867280814080000000000000000000, 5797126020747367985879734231578109105412357244731625958745865049716390179693892056256184534249745940480000000000000000000, 475364333701284174842138206989404946643813294067993328617160934076743994734899148613007131808479167119360000000000000000000, 39455239697206586511897471180120610571436503407643446275224357528369751562996629334879591940103770870906880000000000000000000, 3314240134565353266999387579130131288000666286242049487118846032383059131291716864129885722968716753156177920000000000000000000, 281710411438055027694947944226061159480056634330574206405101912752560026159795933451040286452340924018275123200000000000000000000, 24227095383672732381765523203441259715284870552429381750838764496720162249742450276789464634901319465571660595200000000000000000000, 2107757298379527717213600518699389595229783738061356212322972511214654115727593174080683423236414793504734471782400000000000000000000, 185482642257398439114796845645546284380220968949399346684421580986889562184028199319100141244804501828416633516851200000000000000000000, 16507955160908461081216919262453619309839666236496541854913520707833171034378509739399912570787600662729080382999756800000000000000000000, 1485715964481761497309522733620825737885569961284688766942216863704985393094065876545992131370884059645617234469978112000000000000000000000, 135200152767840296255166568759495142147586866476906677791741734597153670771559994765685283954750449427751168336768008192000000000000000000000, 12438414054641307255475324325873553077577991715875414356840239582938137710983519518443046123837041347353107486982656753664000000000000000000000, 1156772507081641574759205162306240436214753229576413535186142281213246807121467315215203289516844845303838996289387078090752000000000000000000000, 108736615665674308027365285256786601004186803580182872307497374434045199869417927630229109214583415458560865651202385340530688000000000000000000000, 10329978488239059262599702099394727095397746340117372869212250571234293987594703124871765375385424468563282236864226607350415360000000000000000000000, 991677934870949689209571401541893801158183648651267795444376054838492222809091499987689476037000748982075094738965754305639874560000000000000000000000, 96192759682482119853328425949563698712343813919172976158104477319333745612481875498805879175589072651261284189679678167647067832320000000000000000000000, 9426890448883247745626185743057242473809693764078951663494238777294707070023223798882976159207729119823605850588608460429412647567360000000000000000000000, 933262154439441526816992388562667004907159682643816214685929638952175999932299156089414639761565182862536979208272237582511852109168640000000000000000000000, 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000]\r\n\r\ndef nCr(n, r):\r\n return fact[n]//(fact[r]*fact[n-r])\r\n\r\nn = int(input().strip())\r\narr = []\r\nfor _ in range(n):\r\n arr += [list(input().strip())]\r\n \r\nhappiness = 0\r\nfor row in arr:\r\n happiness+=nCr(row.count(\"C\"),2)\r\nfor j in range(n):\r\n col = []\r\n for i in range(n):\r\n col += [arr[i][j]]\r\n happiness+=nCr(col.count(\"C\"),2)\r\nprint(happiness)", "n = int(input())\r\ncke=[]\r\nfor i in range(n):\r\n a=[]\r\n s = input()\r\n for j in range(n):\r\n a.append(s[j])\r\n cke.append(a)\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if cke[i][j]=='C':\r\n for k in range(j+1,n):\r\n if cke[i][k]=='C':\r\n c += 1\r\n for k in range(i+1,n):\r\n if cke[k][j]=='C':\r\n c += 1\r\n\r\nprint(c)", "def C(k):\r\n return (k*(k-1))//2\r\n\r\nn=int(input())\r\nr=[0 for i in range(n)]\r\nc=[0 for i in range(n)]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(n):\r\n if s[j]=='C':\r\n r[i]+=1\r\n c[j]+=1\r\nans=0\r\nfor i in range(n):\r\n ans+=(C(r[i])+C(c[i]))\r\nprint(ans)\r\n", "n=int(input());a=[];col=[]\r\nfor i in range(n) :\r\n s=list(input())\r\n a.append(s)\r\ncnt=0\r\nimport math\r\nfor i in range(len(a)) :\r\n z=a[i].count(\"C\")\r\n if z>2 :\r\n cnt+=(math.factorial(z)//(math.factorial(z-2)*2))\r\n elif z==2 :\r\n cnt+=1\r\nfor i in range(len(a)) :\r\n c=0\r\n for j in range(len(a)) :\r\n if a[j][i]==\"C\" :\r\n c+=1\r\n col.append(c)\r\nfor i in col :\r\n if i>2 :\r\n cnt+=(math.factorial(i)//(math.factorial(i-2)*2))\r\n elif i==2 :\r\n cnt+=1\r\nprint(cnt)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n a=[]\r\n for j in s:\r\n a.append(j)\r\n l.append(a)\r\nc=0\r\nfor i in l:\r\n p=i.count('C')\r\n c+=p*(p-1)/2\r\nfor j in range(n):\r\n cm=0\r\n for i in range(n):\r\n \r\n if(l[i][j]=='C'):\r\n cm+=1\r\n p=cm \r\n c+=p*(p-1)/2\r\n \r\nprint(int(c))", "n = int(input())\ndata = []\nfor i in range(n):\n data.append(input())\nresult = 0\nfor i in range(n):\n number_c_in_row = data[i].count('C')\n if number_c_in_row >= 2:\n result += number_c_in_row*(number_c_in_row-1)/2\n\nfor i in range(n):\n count = 0\n for j in range(n):\n if data[j][i] == 'C':\n count += 1\n if count >=2:\n result += count*(count - 1)/2\n\nprint(int(result))", "def c(n):\r\n return (n*(n-1))//2\r\nn = int(input())\r\nk = []\r\nfor i in range (n):\r\n k.append(input())\r\nsum = 0\r\nfor i in range(n):\r\n ns=0\r\n for j in range(n):\r\n ns+=int(k[i][j]=='C')\r\n sum+=c(ns)\r\nfor i in range(n):\r\n ns=0\r\n for j in range(n):\r\n ns+=int(k[j][i]=='C')\r\n sum+=c(ns)\r\nprint(sum)", "n = int(input())\r\n\r\ncols = [0]*n\r\nres = 0\r\nfor x in range(n):\r\n i = input()\r\n count = i.count('C')\r\n if count>=2:\r\n res+=count*(count-1)//2\r\n for j,c in enumerate(i):\r\n if c == 'C': cols[j] += 1\r\nprint (res + sum((x * (x-1))//2 for x in cols if x > 1))", "def countchochor(a,k):\r\n count = 0\r\n for i in range(len(a)):\r\n if Cake[k][i] == 'C':\r\n count += 1\r\n return count*(count-1)//2\r\ndef countchocver(a,k):\r\n count = 0\r\n for i in range(len(a)):\r\n if Cake[i][k] == 'C':\r\n count += 1\r\n return count*(count-1)//2\r\ndef total(a):\r\n total = 0\r\n for j in range(len(a)):\r\n total = total + (countchochor(a,j) + countchocver(a,j))\r\n return total\r\n\r\nn = int(input())\r\nCake = []\r\nfor i in range(n):\r\n Cake.append(input())\r\nprint(total(Cake))", "from math import factorial\nn = int(input())\na = [input() for x in range(n)]\nans = 0\nfor i in range(n):\n p = k = 0\n for j in range(n):\n if a[i][j] == 'C':\n k += 1\n if a[j][i] == 'C':\n p += 1\n if k > 1:\n ans += factorial(k) / (2 * factorial(k - 2))\n if p > 1:\n ans += factorial(p) / (2 * factorial(p - 2))\nprint(int(ans))\n", "import math\r\nn = int(input())\r\nc = []\r\nfor i in range(n):\r\n s = input()\r\n c.append(s)\r\nl = 0\r\nfor i in range(len(c)):\r\n if c[i].count('C')>=1:\r\n k = c[i].count('C')\r\n l+=(k*(k-1))//2\r\nd = {}\r\nfor i in range(n+1):\r\n d[i] = 0\r\nfor i in range(len(c)):\r\n for j in range(len(c[i])):\r\n if c[i][j]=='C':\r\n d[j]+=1\r\nfor key in d:\r\n if d[key]>=1:\r\n l+=((d[key]*(d[key]-1))//2)\r\nprint(l)", "import math\r\n\r\nn=int(input())\r\ncake=[]\r\nfor i in range (n):\r\n line2=input()\r\n line=[]\r\n for x in line2:\r\n if x=='.':\r\n line.append(0)\r\n if x =='C':\r\n line.append(1)\r\n cake.append(line)\r\nline_happy=0\r\nrow_happy=0\r\nfor t in cake:\r\n count=t.count(1)\r\n if count>1:line_happy+=math.factorial(count)/(2*math.factorial(count-2))\r\ncake=zip(*cake)\r\nfor t in cake:\r\n count=t.count(1)\r\n if count>1:row_happy+=math.factorial(count)/(2*math.factorial(count-2))\r\nresult=int(line_happy+row_happy)\r\nprint(result)", "\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n#inp = open(\"lepus.in\", \"r\"); input = inp.readline; out = open(\"lepus.out\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n \r\n \r\ndef solution():\r\n n = int(input())\r\n lst1 = []\r\n lst2 = [[\"\" for j in range(n)] for i in range(n)]\r\n ans = 0\r\n for i in range(n):\r\n lst1.append(list(input()))\r\n for j in range(n):\r\n lst2[j][i] = lst1[i][j]\r\n for i in range(n):\r\n k1 = lst1[i].count(\"C\")\r\n ans += (k1*(k1-1))//2\r\n k2 = lst2[i].count(\"C\")\r\n ans += (k2*(k2-1))//2\r\n print(ans)\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n#inp.close()\r\n#out.close()", "n = int(input())\na = [0]*100\nresult = 0\n\nfor _ in range(n):\n line = input()\n c = line.count(\"C\")\n result += c*(c-1)//2\n for i in range(len(line)):\n a[i] += 1 if line[i] == 'C' else 0\n\nfor e in a:\n result += e*(e-1)//2\n\nprint(result)\n", "n=int(input())\r\nk=[]\r\nans=0\r\nfor i in range(n):\r\n k.append(input())\r\nz=tuple(zip(*k))\r\nfor i in range(n):\r\n x=k[i].count(\"C\")\r\n y=z[i].count(\"C\")\r\n ans+=x*(x-1)//2+y*(y-1)//2\r\nprint(ans)\r\n \r\n\r\n", "n = int(input())\na = [0]*n\nfor i in range(n):\n a[i] = input().strip()\nans = 0\nfor i in range(n):\n s = 0\n for j in range(n):\n if a[i][j]=='C':\n s+=1\n # print(a[i][j])\n ans += s*(s-1)//2\n\nfor i in range(n):\n s = 0\n for j in range(n):\n if a[j][i]=='C':\n s+=1\n ans += s*(s-1)//2\nprint(ans)", "n = int(input())\r\nc = [0] * n\r\na = 0\r\nfor i in range(n):\r\n s = input()\r\n r = 0\r\n for j in range(n):\r\n if s[j] == 'C':\r\n r += 1\r\n c[j] += 1\r\n a += r * (r - 1) >> 1\r\nfor r in c:\r\n a += r * (r - 1) >> 1\r\nprint(a)\r\n", "N = int(input())\n\nmatriz = []\n\nfor i in range(N):\n pos = list(input())\n matriz.append(pos)\n\npares = 0\n\nfor i in range(N):\n for j in range(N):\n if matriz[i][j] == \"C\":\n for char in matriz[i][j+1:]:\n if char == \"C\":\n pares += 1\n for k in range(i+1,N):\n if matriz[k][j] == \"C\":\n pares += 1\nprint(pares)\n \t \t \t\t \t \t\t\t\t \t\t \t \t", "n=int(input())\r\nans=0\r\nl=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(n):\r\n l[i][j]=s[j]\r\nfor i in range(n):\r\n t=0\r\n for j in range(n):\r\n if l[i][j]=='C':\r\n t+=1\r\n\r\n ans+=t*(t-1)//2\r\n\r\nfor j in range(n):\r\n t=0\r\n for i in range(n):\r\n if l[i][j]=='C':\r\n t+=1\r\n\r\n ans+=t*(t-1)//2\r\n \r\nprint(ans)\r\n", "from operator import mul # or mul=lambda x,y:x*y\nfrom fractions import Fraction\nfrom functools import reduce\ndef door_cake():\n n = int(input())\n row_sum, col_sum = [0]*n, [0]*n\n [[0 if x=='.' else summs((row_sum, col_sum), row, col) for col,x in enumerate(input())] for row in range(n)]\n\n soma_total = 0\n for i in zip(row_sum, col_sum):\n soma_total+=comb(i[0],2)+comb(i[1],2)\n print(soma_total)\n\ndef summs(v, r, c):\n v[0][r]+=1\n v[1][c]+=1\n return 0\n\ndef comb(n,k): \n return int( reduce(mul, (Fraction(n-i, i+1) for i in range(k)), 1) )\n\n\ndoor_cake()\n \t\t \t\t \t \t \t \t \t\t\t \t\t\t \t\t\t\t\t", "#!/usr/bin/env python3\nimport collections\n\nif __name__ == '__main__':\n N = int(input())\n grid = [input() for _ in range(N)]\n\n cols = collections.Counter()\n rows = collections.Counter()\n\n for i, r in enumerate(grid):\n for j, c in enumerate(r):\n if c == 'C':\n cols[j] += 1\n rows[i] += 1\n\n res = 0\n for _, c in cols.most_common() + rows.most_common():\n res += c * (c - 1)\n print(res//2)\n\n", "n = int(input())\na = [list(input()) for i in range(n)]\nans = 0 \nfor i in range(len(a)):\n row = 0\n column = 0\n for j in range(len(a)):\n if (a[i][j] == \"C\"):\n row += 1\n if (a[j][i] == \"C\"):\n column += 1\n# ans += 1 + (2*(row-1 + 1)) + ((row-1+1) * (row-2+1)//2)\n# ans += 1 + (2*(column-1 + 1)) + ((column-1+1) * (column-2+1)//2)\n ans += 1 + (2*(row-1-1)) + ((row-1-1) * (row-2-1)//2)\n ans += 1 + (2*(column-1-1)) + ((column-1-1) * (column-2-1)//2)\nprint(ans) \n", "n = int(input())\r\ns = [list(input()) for i in range(n)]\r\ncount = 0\r\nfor i in range(n):\r\n\tcount+=(s[i].count('C')*(s[i].count('C')-1)//2)\r\nfor j in range(n):\r\n\tcount1 = 0\r\n\tfor i in range(n):\r\n\t\tif s[i][j]=='C':\r\n\t\t\tcount1+=1\r\n\tcount+=((count1*(count1-1))//2)\r\nprint(count)", "def total(a):\r\n\tif a==0 or a==1:return(0)\r\n\telse:\r\n\t\treturn(((a-1)*a)//2)\r\nd,c=[],0\r\nn=int(input())\r\nfor x in range(n):\r\n\tl=list(input())\r\n\ta=l.count(\"C\")\r\n\tc+=total(a)\r\n\td.append(l)\r\nfor r in range(n):\r\n\tz=0\r\n\tfor s in range(n):\r\n\t\tif d[s][r]==\"C\":z+=1\r\n\tc+=total(z)\r\nprint(c)\r\n", "b=[]\r\nans=0\r\nn=int(input())\r\nfor i in range(n):\r\n b.append(list(input()))\r\n ss=b[i].count('C')\r\n ans+=(ss*(ss-1))//2\r\nfor i in range(n):\r\n ss=0\r\n for j in range(n):\r\n if b[j][i]==\"C\":\r\n ss+=1\r\n ans+=(ss*(ss-1))//2 \r\nprint(ans)", "n = int(input())\r\nresult = 0\r\nL = [0 for i in range(n)]\r\nfor i in range(n):\r\n r = 0\r\n T = [s for s in input()]\r\n for j in range(n):\r\n if T[j] == \"C\":\r\n r += 1\r\n L[j] += 1\r\n result += (r*(r-1))//2\r\nfor k in L:\r\n result += (k*(k-1))//2\r\nprint(result)", "n=int(input())\r\nl=[]\r\nh=0\r\nfor i in range(0,n):\r\n l.append(input()) \r\nfor i in range(0,n):\r\n c=0\r\n for j in range(0,n):\r\n if l[i][j]=='C':\r\n c=c+1\r\n h=h+ c*(c-1)//2\r\nfor i in range(0,n):\r\n c=0\r\n for j in range(0,n):\r\n if l[j][i]=='C':\r\n c=c+1\r\n h=h+c*(c-1)//2\r\nprint(h)", "n = int(input())\nv = []\nfor i in range(n):\n v.append(input())\ntotal = 0\n\ndef factorial(n):\n total = 1\n for x in range(2, n+1):\n total *= x\n return total\n\nfor i in range(n):\n count = 0;\n for j in range(n):\n if v[i][j] == 'C':\n count += 1\n if count > 1:\n total += factorial(count) / (factorial(2) * factorial(count - 2))\nfor i in range(n):\n count = 0;\n for j in range(n):\n if v[j][i] == 'C':\n count += 1\n if count > 1:\n total += factorial(count) / (factorial(2) * factorial(count - 2))\nprint(int(total))\n", "x=int(input())\r\nsum=0\r\na=[0 for i in range(x)]\r\nb=[0 for i in range(x)]\r\nfor i in range(x):\r\n\tc=input()\r\n\tfor j in range(x):\r\n\t\tif(c[j]=='C'):\r\n\t\t\ta[i]+=1\r\n\t\t\tb[j]+=1\r\nfor i in range(x):\r\n\tsum+=a[i]*(a[i]-1)//2+b[i]*(b[i]-1)//2\r\nprint(sum)", "from math import comb\n\nn = int(input())\na = [input() for x in range(n)]\nans = 0\nfor i in range(n):\n c1 = 0\n c2 = 0\n for j in range(n):\n if a[i][j] == 'C':\n c1 += 1\n if a[j][i] == 'C':\n c2 += 1\n ans += comb(c1, 2) + comb(c2, 2)\nprint(ans)\n", "n = int(input())\r\ncake = [input() for _ in range(n)]\r\n\r\nrow_counts = [sum(1 for c in row if c == 'C') for row in cake]\r\ncol_counts = [sum(1 for row in cake if row[i] == 'C') for i in range(n)]\r\n\r\nhappiness = sum(count*(count-1)//2 for count in row_counts) + sum(count*(count-1)//2 for count in col_counts)\r\n\r\nprint(happiness)\r\n", "n=int(input())\r\nans=0\r\na=[]\r\nfor i in range(n):\r\n a.append([e==\"C\" for e in input()])\r\nfor i in range(n):\r\n c=sum(a[i])\r\n ans+=c*(c-1)//2\r\n c=sum(a[j][i] for j in range(n))\r\n ans+=c*(c-1)//2\r\nprint(ans)", "n = int(input())\nc = [0] * n\nt = 0\n\nfor j in range(n):\n x = 0\n a = input()\n for k in range(n):\n if a[k] == \"C\":\n x += 1\n c[k] += 1\n t += (x - 1) / 2 * x\n\nfor i in range(n):\n t += (c[i] - 1) / 2 * c[i]\n\nprint(int(t))\n\n \t \t \t\t\t\t \t \t \t\t \t\t \t", "n=int(input())\ndef func(num):\n res=num\n for i in range(1,n):\n res=(num*(num-1))//2\n return res\na=0\nl = list([input() for i in range(n)])\nfor i in range(n):\n num=0\n for j in range(n):\n if l[i][j]==\"C\":\n num+=1\n a+=func(num)\nfor j in range(n):\n num=0\n for i in range(n):\n if l[i][j]==\"C\":\n num+=1\n a+=func(num)\nprint(a)\n\n\n\n\n \t \t\t \t\t\t\t\t \t\t \t \t\t\t\t\t\t \t \t", "def solve():\r\n size = int(input())\r\n mat = [input() for _ in range(size)]\r\n total = 0\r\n \r\n for i in range(size):\r\n for j in range(size):\r\n for k in range(j + 1, size):\r\n if mat[i][j] == mat[i][k] == 'C':\r\n total += 1\r\n \r\n for j in range(size):\r\n for k in range(j + 1, size):\r\n if mat[j][i] == mat[k][i] == 'C':\r\n total += 1\r\n \r\n print(total)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "t=int(input())\r\nl1=[]\r\nsum1=0\r\nfor i in range(0,t):\r\n str1=input()\r\n x=str1.count('C')\r\n y=((x)*(x-1))/2\r\n sum1=sum1+y\r\n for i in range(0,t):\r\n l1.append(str1[i])\r\nfor j in range(0,t):\r\n ct=0\r\n for i in range(0,t):\r\n if(l1[(t*i)+j]=='C'):\r\n ct+=1\r\n if(ct>=2):\r\n y1=((ct)*(ct-1))/2\r\n sum1=sum1+y1\r\nsum2=int(sum1)\r\nprint(sum2) ", "#a =[int(i) for i in input().split()]\r\nn=int(input())\r\na=[]\r\nt=0\r\nfor i in range(n):\r\n s=input()\r\n b=[]\r\n z=0\r\n for j in s:\r\n b.append(j)\r\n if j=='C':\r\n z+=1\r\n t+=(z-1)*z//2\r\n a.append(b)\r\nfor j in range(n):\r\n z=0\r\n for i in range(n):\r\n if a[i][j]=='C':\r\n z+=1\r\n t+=(z-1)*z//2\r\nprint(t)", "N=int(input())\n\nB=[]\n\ny1=[0 for i in range(N)]\ny2=[0 for i in range(N)]\n\nfor i in range(N):\n B.append(list(input()))\nfor i in range(N):\n for j in range(N):\n if B[i][j]==\"C\":\n y1[i]+=1\n y2[j]+=1\n \nResp=0\n\nfor i in range(N):\n if y1[i]>1:\n Resp+=y1[i]*(y1[i]-1)//2\n \n if y2[i]>1:\n Resp+=y2[i]*(y2[i]-1)//2\n \nprint(Resp)\n\t \t\t\t \t \t\t \t \t \t\t\t\t \t\t", "n= int(input())\na=[input() for i in range(n)]\n\ncount_of_co =0\nrow_count =[0]*n\ncol_count =[0]*n\n\nfor row in range (n):\n for col in range (n):\n if a[row][col]=='C':\n row_count[row]+=1\n col_count[col]+=1\n\nfor i in range(n):\n if row_count[i]>1:\n count_of_co+=((row_count[i]*(row_count[i]-1))//2)\n if col_count[i]>1:\n count_of_co+=((col_count[i]*(col_count[i]-1))//2)\n\nprint(count_of_co)\n\t\t\t\t \t \t \t \t \t \t \t\t \t", "import math\nn=int(input())\nrow=list()\ncol=list()\nfor i in range(n):\n s=input()\n l=list()\n for j in s:\n l.append(j)\n row.append(l)\nm=0\nwhile m<n:\n l=list()\n o=0\n while o<n:\n l.append(row[o][m])\n o+=1\n m+=1\n col.append(l)\nsum=0\nfor r in row:\n a=r.count('C')\n sum+= math.comb(a, 2)\nfor r in col:\n a=r.count('C')\n sum+= math.comb(a, 2)\nprint(sum)\n\t\t\t\t\t\t\t \t\t\t\t\t\t \t \t\t\t \t \t\t\t \t\t", "def transpose_matrix(matrix):\n t_matrix = [[matrix[j][i] for j in range(len(matrix))] for i in range(len(matrix[0]))]\n return t_matrix\n\nn = int(input())\n\nm = []\nfor i in range(n):\n m.append(list(k for k in input()))\n\ncount = 0\nt_m = transpose_matrix(m)\nfor i in range(n):\n m_c_count = m[i].count('C')\n t_m_c_count = t_m[i].count('C')\n count = count + (int(m_c_count*(m_c_count-1))/2) + (int(t_m_c_count*(t_m_c_count-1))/2)\nprint(int(count))\n\n\t \t\t \t\t\t\t\t\t \t\t \t \t", "n = int(input())\r\nk = []\r\nans = 0\r\n\r\nfor i in range(n):\r\n k.append(input())\r\nz = tuple(zip(*k))\r\n\r\nfor i in range(n):\r\n x = k[i].count(\"C\")\r\n y = z[i].count(\"C\")\r\n ans += x * (x - 1) // 2 + y * (y - 1) // 2\r\n\r\nprint(ans)\r\n", "def solve(n, c):\n s = 0\n for i in range(n):\n k = c[i].count('C')\n s += (k**2 - k)//2\n\n for j in range(n):\n t = 0\n for i in range(n):\n if c[i][j] == 'C':\n t += 1\n s += (t**2 - t)//2\n\n return s\n\n\ndef main():\n n = int(input())\n c = []\n for i in range(n):\n c.append(input())\n print(solve(n, c))\n\n\nmain()\n", "n = int(input())\r\nlist = [\"\" for i in range(n)]\r\nfor i in range(n):\r\n list[i] = input()\r\nsum = 0\r\nfor c in list:\r\n f = 0\r\n for i in range(n):\r\n if c[i] == \"C\":\r\n f += 1\r\n sum = sum + f * (f - 1) / 2\r\nfor i in range(n):\r\n f = 0\r\n for j in range(n):\r\n if list[j][i] == \"C\":\r\n f += 1\r\n sum = sum + f * (f - 1) / 2\r\nprint(int(sum))", "#!/usr/bin/python3\r\nimport math\r\n\r\n\r\ndef combination(n, r):\r\n return math.factorial(n) // (math.factorial(n-r)*math.factorial(r))\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n col = [0 for i in range(n)]\r\n row = [0 for i in range(n)]\r\n res = 0\r\n for i in range(n):\r\n s = input()\r\n for j in range(len(s)):\r\n if s[j] == 'C':\r\n col[j] = col[j] + 1\r\n row[i] = row[i] + 1\r\n\r\n # process row\r\n for i in range(n):\r\n if row[i] > 1:\r\n res = res + combination(row[i], 2)\r\n\r\n # process col\r\n for i in range(n):\r\n if col[i] > 1:\r\n res = res + combination(col[i], 2)\r\n\r\n print(res)\r\n", "n=int(input())\r\nans=0\r\na=['']*(n)\r\nfor i in range(n):\r\n a[i]+=(input())\r\n z=a[i].count('C')\r\n if z>1:\r\n x=1\r\n for i in range(z-1,z+1):\r\n x*=i\r\n ans+=(x/2)\r\n#print(ans)\r\nb=['']*n\r\nfor i in range(n):\r\n for j in range(n):\r\n b[i]+=a[j][i]\r\n z=b[i].count('C')\r\n if z>1:\r\n x=1\r\n for i in range(z-1,z+1):\r\n x*=i\r\n ans+=(x/2)\r\nprint(int(ans))\r\n", "n=int(input());\r\na=[];\r\nfor i in range(n):\r\n a+=list(input().split());\r\nb=[row.count('C')for row in a];\r\nb=[x*(x-1)//2for x in b];\r\nc=[[row[i]for row in a].count('C')for i in range(n)];\r\nc=[x*(x-1)//2for x in c];\r\nprint(sum(c)+sum(b));", "def main():\n n, res = int(input()), 0\n l = [input() for _ in range(n)]\n for src in l, zip(*l):\n for s in src:\n c = s.count(\"C\")\n res += c * (c - 1) // 2\n print(res)\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "n = int(input())\r\nd = []\r\ni = 1\r\nns =str(n)\r\nwhile i*i<=n:\r\n d.append(i*i)\r\n i+=1 \r\nfor j in d[::-1]:\r\n if j==n:\r\n print(0)\r\n exit()\r\n else:\r\n c=0\r\n for k in range(len(ns)):\r\n if ns[k]==str(j)[c]:\r\n c+=1\r\n if c==len(str(j)):\r\n print(len(ns)-c)\r\n exit()\r\nprint(-1) \r\n \r\n \r\n \r\n", "sq=[0]*(50000)\r\nfor i in range(50000):\r\n\tsq[i]=i*i\r\ns=input()\r\nfor k in range(49999,0,-1):\r\n\tt=str(sq[k])\r\n\tif len(t)<=len(s):\r\n\t\tj=0\r\n\t\ti=0\r\n\t\twhile(j<len(s) and i<len(t)):\r\n\t\t\tif t[i]==s[j]:\r\n\t\t\t\ti+=1\r\n\t\t\t\tj+=1\r\n\t\t\telse:\r\n\t\t\t\tj+=1\r\n\t\tif i==len(t):\r\n\t\t\t# print(t)\r\n\t\t\tprint(len(s)-len(t))\r\n\t\t\texit()\r\nprint(\"-1\")", "import itertools\r\nimport math\r\nn=input()\r\nres=[seq for i in range(len(n),0,-1) for seq in itertools.combinations(n,i) if math.sqrt(int(''.join(seq))).is_integer()]\r\nif res==[]:\r\n print(-1)\r\nelse:\r\n flag=0\r\n for i in range(len(res)):\r\n if res[i][0]!='0':\r\n flag=1\r\n print(len(n)-len(res[i]))\r\n break\r\n if(flag==0):\r\n print(-1)\r\n \r\n", "squares = set()\r\nx = 1\r\nwhile x*x <= 2*(10**9):\r\n squares.add(x*x)\r\n x += 1\r\n\r\nn = input()\r\nl = len(n)\r\n\r\n\r\ndef masked(x, mask):\r\n pow10 = 1\r\n y = 0\r\n while x > 0:\r\n if mask % 2 == 1:\r\n y += (x % 10) * pow10\r\n pow10 *= 10\r\n\r\n x //= 10\r\n mask //= 2\r\n return y\r\n\r\nif int(n) in squares:\r\n print(0)\r\nelse:\r\n minOp = len(n)\r\n for mask in range(2 ** l):\r\n x = masked(int(n), mask)\r\n if x in squares:\r\n minOp = min(minOp, len(n) - len(str(x)))\r\n print(minOp if minOp < len(n) else -1)\r\n", "lis=[i*i for i in range(1,50000)]\r\nb = input()\r\nn=len(b)\r\nans=10000000000\r\nflag=0\r\nfor _ in lis:\r\n a = str(_)\r\n i=j=0\r\n while i<n and j<len(a):\r\n if b[i]==a[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\n if j==len(a):\r\n ans=min(ans,n-len(a))\r\n flag=1\r\nif flag:\r\n print(ans)\r\nelse:\r\n print(-1) \r\n\r\n\r\n\r\n", "from math import isqrt\r\nfrom itertools import chain, combinations\r\n\r\ndef powerset(iterable):\r\n s = list(iterable)\r\n return chain.from_iterable(combinations(s, r) for r in range(1,len(s)+1))\r\n\r\nis_sq = lambda n: isqrt(n)**2 == n\r\n\r\nn = [*input()]\r\nmn = 99**99\r\nfor p in powerset(n):\r\n k = ''.join(p)\r\n if k[0] == '0': continue\r\n if is_sq(int(k)):\r\n mn = len(n) - len(p)\r\nprint(mn if mn < 99**99 else -1)", "import math\r\nn=input()\r\nm=len(n)\r\nans=m\r\nfor j in range(1,2**m):\r\n cur=\"\"\r\n for i in range(m):\r\n if (j>>i) &1:\r\n cur+=n[i]\r\n if cur[0]==\"0\":\r\n continue\r\n cur=int(cur)\r\n var=int(math.sqrt(cur))\r\n if var**2==cur:\r\n ans=min(ans,m-len(str(cur)))\r\nif ans==m:\r\n print(-1)\r\nelse:\r\n print(ans)", "\r\ndef Slove():\r\n\r\n n = input()\r\n sq=int(int(n)**(0.5))\r\n while sq:\r\n tmp = str(sq*sq)\r\n idx=0\r\n for i in n:\r\n if(i==tmp[idx]):\r\n idx=idx+1\r\n if(idx==len(tmp)):\r\n return len(n)-idx\r\n sq-=1\r\n return -1\r\n\r\nprint(Slove())", "arr=[];i=1\r\nwhile i**2<=2*(10**9):\r\n arr.append(i**2)\r\n i+=1\r\nn=input();ans=1e10;\r\nfor i in arr:\r\n k=str(i);prev=0;l=0\r\n for j in k:\r\n for m in range(prev,len(n)):\r\n if j==n[m]:prev=m+1;l+=1;break\r\n if len(k)>len(n):break\r\n if l==len(k):ans=min(ans,len(n)-len(k))\r\nif ans==1e10:print(-1)\r\nelse:print(ans)\r\n", "n=int(input())\r\ni=1\r\nl=[]\r\nwhile(i*i<=n):\r\n l.append(str(i*i))\r\n i+=1\r\nl=l[::-1]\r\ncnt=0\r\nflag=0\r\nfor i in l:\r\n s=str(n)\r\n cnt=0\r\n for j in i:\r\n for k in range(len(s)):\r\n if(s[k]==j):\r\n cnt+=1\r\n s=s[k+1:]\r\n break\r\n if(cnt==len(i)):\r\n flag=1\r\n break\r\nif(flag):\r\n print(len(str(n))-cnt)\r\nelse:\r\n print(-1)\r\n\r\n \r\n\r\n\r\n", "n = input()\r\ncount = len(n)\r\nn = (10 - len(n)) * \"0\" + n\r\nmin1 = 10\r\nfor i in range(1, 2 ** 10):\r\n b = bin(i)\r\n b = b[2:]\r\n b = (10 - len(b)) * \"0\" + b\r\n s = \"\"\r\n for i in range(10):\r\n if (b[i] == '1'):\r\n s += n[i]\r\n if (len(s) > 0 and s[0] == '0'):\r\n continue\r\n s = int(s)\r\n if (int(s ** 0.5) ** 2 == s):\r\n min1 = min(b[len(b) - count:].count(\"0\"), min1)\r\nif (min1 == 10):\r\n print(-1)\r\nelse:\r\n print(min1)", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import combinations\r\n\r\ns = input()[:-1]\r\nn = int(len(s))\r\n\r\nx = n\r\nfor u in range(n, 0, -1):\r\n w = list(map(lambda x:''.join(x), combinations(s, u)))\r\n for i in w:\r\n if i[0] != '0':\r\n if int(i)**0.5 == int(int(i)**0.5):\r\n print(x-u)\r\n exit(0)\r\nprint(-1)\r\n", "s= list(input())\r\nans=10**9\r\nfor i in range(1,45001):\r\n sr = str(i*i)\r\n sri=0\r\n for j in range(len(s)):\r\n try:\r\n if s[j]== sr[sri]:sri+=1\r\n except IndexError:\r\n pass\r\n y = len(s)- len(sr)\r\n if sri==len(sr):ans=min(ans, y)\r\nans = [ans,-1][ans==10**9]\r\nprint(ans)", "import math\n\ndef is_perfect_square(num):\n sqrt_num = int(math.sqrt(num))\n return sqrt_num * sqrt_num == num\n\ndef min_operations_to_square(n):\n if is_perfect_square(n):\n return 0\n\n n_str = str(n)\n num_digits = len(n_str)\n min_operations = float('inf')\n\n for mask in range(1, (1 << num_digits)):\n subsequence = ''\n for i in range(num_digits):\n if mask & (1 << i):\n subsequence += n_str[i]\n if subsequence != '' and subsequence[0] != '0':\n modified_num = int(subsequence)\n if is_perfect_square(modified_num):\n remaining_digits = num_digits - len(subsequence)\n min_operations = min(min_operations, remaining_digits)\n\n return min_operations if min_operations != float('inf') else -1\n\n# Input\nn = int(input())\n\n# Output\nresult = min_operations_to_square(n)\nprint(result)\n \t \t\t \t \t \t \t\t \t\t", "import math\ns = input()\n\nn = len(s)\n\nans = -1\n\nnum = ''\n\nfor i in range(1, 1 << n):\n st = ''\n for j in range(n):\n if i >> j & 1:\n st += s[j]\n \n if st[0] != '0':\n temp = int(st)\n \n k = int(math.sqrt(temp))\n\n if k * k == temp:\n if ans < int(len(st)):\n ans = int(len(st))\n num = st\n\nif ans == -1:\n print(ans)\nelse:\n print(n-ans)\n\n", "#autogenerated (:'D)\r\nread_numbers = lambda: list(map(int, input().split()))\r\nINF = 1 << 64\r\n\r\n#main\r\nx, ans = int(input()), INF\r\n\r\nxs = str(x)\r\n\r\nfor y in range(1, int(x**0.5) + 1):\r\n ys = str(y**2) + \"#\"*10\r\n l, r = 0, len(ys) - 10\r\n for i in xs:\r\n if ys[l] == i:\r\n l += 1\r\n if l >= r:\r\n ans = min(10 + len(xs) - len(ys), ans)\r\n\r\nprint(-1 if ans == INF else ans)", "z,zz=input,lambda:list(map(int,z().split()));\r\nszz,dgraphs,mod=lambda:sorted(zz()),{},10**9+7\r\nfrom string import *\r\nfrom collections import *\r\nfrom queue import *\r\nfrom sys import *\r\nfrom collections import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom bisect import *\r\nfrom collections import Counter as cc\r\nfrom math import factorial as f\r\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\r\ndef prime(x):\r\n p=ceil(x**.5)+1\r\n for i in range(2,p):\r\n if x%i==0 and x!=2:return 0\r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=True\r\n for i in graph[u]:\r\n if not visit[i]:\r\n dfs(i,visit,graph)\r\n################################################################################\r\n\r\n\"\"\"\r\n\r\nled=(6,2,5,5,4,5,6,3,7,6)\r\n\r\ncolor4=[\"G\", \"GB\", \"YGB\", \"YGBI\", \"OYGBI\" ,\"OYGBIV\",'ROYGBIV' ]\r\n\r\n\"\"\"\r\n\r\n###########################---START-CODING---####################################\r\n\r\n\r\na,ans,x=input(),-1,[]\r\nfor i in a:\r\n y=x[:]\r\n for t in y:\r\n m=t*10+int(i)\r\n if ceil(m**.5)==int(m**.5):\r\n if ans <m:ans=m\r\n x.append(m)\r\n if i!='0':\r\n i=int(i)\r\n if ceil(i**.5)==int(i**.5):\r\n if ans <i:ans=i\r\n x.append(int(i))\r\n \r\nprint(ans if ans==-1 else len(a)-len(str(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", "n = input()\r\nt = int(int(n) ** 0.5)\r\nwhile t > 0:\r\n m = str(t * t)\r\n j = 0\r\n for i in range(len(n)):\r\n if n[i] == m[j]:\r\n j += 1\r\n if j == len(m):\r\n print(len(n) - j)\r\n exit()\r\n t -= 1\r\nprint('-1')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun May 16 15:21:30 2021\r\n\r\n@author: pleva\r\n\"\"\"\r\n\r\ndef make_square(n):\r\n d = {}\r\n for i in range(1, 3*n):\r\n i2 = i*i\r\n if i2==n:\r\n return 0\r\n if i2 > n:\r\n break\r\n i3 = str(i2)\r\n start = d\r\n for c in i3:\r\n if c not in start:\r\n start[c] = {}\r\n start = start[c]\r\n start['D'] = True\r\n #return d\r\n start = []\r\n answer = 0\r\n n2 = str(n)\r\n for c in n2:\r\n next_s = []\r\n for a, b in start:\r\n if c in b:\r\n next_s.append([a+1, b[c]])\r\n if 'D' in b[c]:\r\n answer = max(answer, a+1)\r\n next_s.append([a, b])\r\n if c in d:\r\n next_s.append([1, d[c]])\r\n if 'D' in d[c]:\r\n answer = max(answer, 1)\r\n start = next_s\r\n if answer==0:\r\n return -1\r\n return len(n2)-answer\r\n \r\nn = int(input())\r\nprint(make_square(n))", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join(map(str, a)) + end)\r\n\r\ndef mul(a, s, k):\r\n t = \"\"\r\n for i in range(k):\r\n if(s[i] == \"1\"):\r\n t += str(a[i])\r\n n = int(t)\r\n if(int(n**0.5)**2 == n and t[0] != \"0\"):\r\n return True\r\n return False\r\n\r\ndef main():\r\n n = int(get())\r\n a = []\r\n k = 1\r\n p = 0\r\n while(n):\r\n a.insert(0, n % 10)\r\n n //= 10\r\n k *= 2\r\n p += 1\r\n ans = 10**9\r\n for i in range(1, k):\r\n s = (\"0000000000\" + bin(i)[2:])[-p:]\r\n if(mul(a, s, p)):\r\n ans = min(ans, s.count(\"0\"))\r\n if(ans != 10**9):\r\n put(ans)\r\n else:\r\n put(-1)\r\nmain()\r\n", "from math import sqrt, floor\r\nfrom collections import deque\r\n\r\n\r\n# All subsequences of in a string\r\n\r\ndef subsequence(s, binary, length):\r\n sub = ''\r\n for j in range(length):\r\n\r\n # check if jth bit in binary is 1\r\n if binary & (1 << j):\r\n # if jth bit is 1, include it\r\n # in subsequence\r\n sub += s[j]\r\n return sub\r\n\r\n\r\nn = input()\r\nlength = len(n)\r\nlimit = 1 << length\r\nres = deque()\r\nfor i in range(1, limit):\r\n ss = subsequence(n, i, length)\r\n a = int(ss)\r\n if ss[0] != '0' and floor(sqrt(a)) == sqrt(a):\r\n res.append(a)\r\nif len(res) != 0:\r\n ans = '{}'.format(max(res))\r\n print(len(n) - len(ans))\r\nelse:\r\n print(-1)\r\n", "arr = []\r\n\r\n\r\ndef m(a, ln):\r\n if len(a) == ln:\r\n arr.append(a)\r\n return\r\n m(a + '0', ln)\r\n m(a + '1', ln)\r\n\r\n\r\ndef main():\r\n a = input()\r\n m(\"\", len(a))\r\n res = \"\"\r\n for i in range(len(arr)):\r\n b = \"\"\r\n for j in range(len(arr[i])):\r\n if arr[i][j] == '1':\r\n b += a[j]\r\n if not b or b[0] == '0':\r\n continue\r\n k = int(b)\r\n if k ** 0.5 == int(k ** 0.5) and len(b) > len(res):\r\n res = b\r\n if res:\r\n print(len(a) - len(res))\r\n else:\r\n print(-1)\r\n\r\n\r\nmain()", "from math import sqrt\r\nn=int(input())\r\nb=[]\r\nmass=[]\r\nfor i in range(int(sqrt(n))):\r\n b.append(str((i+1)**2))\r\nn=list(str(n))\r\nfor i in range(len(b)):\r\n s=0\r\n aaa=0\r\n for l in range(len(b[i])):\r\n try:\r\n s=n.index(b[i][l],s)+1\r\n except:\r\n aaa=1\r\n break\r\n if aaa==0:\r\n mass.append(b[i])\r\nmass.sort(key=len)\r\ntry:\r\n print(len(n)-len(mass[-1]))\r\nexcept:\r\n print(-1)\r\n", "from math import sqrt\r\nn = int(input())\r\nx = sqrt(n)\r\nif x==int(x):\r\n print(0)\r\nelse:\r\n for i in range(int(x),0,-1):\r\n y = str(i**2)\r\n c=0\r\n for j in str(n):\r\n if j==y[c]:\r\n c+=1\r\n if c==len(y):\r\n break\r\n if c==len(y):\r\n print(len(str(n))-(c))\r\n break\r\n else:\r\n print(-1)", "mn=10**10\r\ndef solve(n,a):\r\n if len(n)==0:\r\n return 10**10\r\n if n[0]==\"0\":\r\n return 10**10\r\n global mn\r\n if int(n) in ans:\r\n return a\r\n else:\r\n \r\n for i in range(len(n)):\r\n m=list(n)\r\n m.pop(i)\r\n \r\n if len(m)>0:\r\n m=\"\".join(m)\r\n else:\r\n continue\r\n \r\n \r\n s=solve(m,a+1)\r\n mn=min(s,mn)\r\n return mn \r\n \r\n \r\nfor _ in range(1):\r\n i=1\r\n ans=set()\r\n while(i*i<=2*10**9):\r\n ans.add(i*i)\r\n i+=1\r\n n=input()\r\n x=solve(n,0)\r\n if x==10**10:\r\n print(-1)\r\n continue\r\n \r\n print(x)\r\n \r\n \r\n ", "u = list(map(int, list(input())))\r\nn = len(u)\r\nd = []\r\nfor i in range(1, 100001):\r\n d.append(list(map(int, list(str(i * i)))))\r\nans = []\r\nfor k in d:\r\n if len(k) > n:\r\n break\r\n m = 0\r\n j = 0; i = 0\r\n while i < n and j < len(k):\r\n if u[i] == k[j]:\r\n i += 1; j += 1\r\n else:\r\n i += 1\r\n m += 1\r\n if j == len(k):\r\n ans.append(m + (n - i))\r\nif len(ans) == 0:\r\n print(-1)\r\nelse:\r\n print(min(ans))\r\n \r\n \r\n\r\n", "import math\nfrom collections import deque\n\ndef f(n):\n y = []\n for i in range(len(n)):\n w = n[0:i] + n[i+1:]\n if w != '' and w[0] == '0':\n continue\n y.append(w)\n return y\n \nn = input()\np = len(n)\ny = None\nv = set()\nq = deque([n])\nwhile q:\n n = q.popleft()\n if n == '':\n y = -1\n break\n if n in v:\n continue\n v.add(n)\n s = math.sqrt(int(n))\n if int(s) != s:\n q.extend(f(n))\n else:\n y = p - len(n)\n break\nprint(y)", "q = int(input())\n\npot = []\nb = 1\n\nwhile (42):\n a = b**2\n if(a <= q):\n pot.append((a))\n b += 1\n else:\n break\n\npot.sort(reverse = True)\n\nq = list(str(q))\nj = 0\nl = 0\nflag = 0\n\nfor i in range(len(pot)):\n l = 0\n for j in range(len(q)):\n #print(q[j], pot[i], list(str(pot[i]))[l], l)\n if q[j] == list(str(pot[i]))[l]:\n l += 1 \n if l == len(str(pot[i])):\n flag = 1\n break\n \n if flag == 1:\n print(len(q)-len(str(pot[i])))\n break\n\nif flag == 0:\n print(-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=(input())\r\nm=int(int(n)**0.5)\r\nn=list(n)\r\nwhile m>0:\r\n nm=str(m**2)\r\n j=0\r\n for i in range(len(n)):\r\n if n[i]==nm[j]:\r\n j+=1\r\n if j==len(nm):\r\n exit(print(len(n)-j))\r\n m-=1\r\nprint(-1) ", "# Hydro submission #61ebbf726e37a20d468ca591@1642839922569\nn=str(input())\r\nm=eval(n)\r\nnum1=len(n)\r\nans=6553555555\r\ni=1\r\nwhile(i*i<=m):\r\n p=str(i*i)\r\n k=0\r\n num2=0\r\n for j in range(len(n)):\r\n if(k>=len(p)):\r\n break\r\n if(n[j]==p[k]):\r\n k+=1\r\n num2+=1\r\n i+=1\r\n if(k!=len(p)):\r\n continue\r\n if(k==len(p)):\r\n ans=min(ans,num1-num2)\r\nif(ans==6553555555):\r\n print(-1)\r\nif(ans!=6553555555):\r\n print(ans)", "import sys\r\nfrom itertools import combinations\r\nn = int(input())\r\ns = list(str(n))\r\nx = len(s)\r\nl = []\r\nfor i in range(len(s)):\r\n l.append(i)\r\nans = 10000\r\nfor i in range(1,x+1):\r\n for j in combinations(l,i):\r\n u = []\r\n for k in j:\r\n u.append(s[k])\r\n p = \"\".join(u)\r\n if p[0] == \"0\":\r\n continue\r\n m = int(p)\r\n m = m**0.5\r\n h = int(m)\r\n if h == m:\r\n w = x-i\r\n if w < ans:\r\n ans = w\r\nif ans == 10000:\r\n ans = -1\r\nprint(ans)", "import configparser\r\nimport math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef main():\r\n\r\n per = set()\r\n\r\n for i in range(int(math.sqrt(2000000000) + 5)):\r\n per.add(i**2)\r\n\r\n n = input().strip()\r\n\r\n best = 100\r\n for i in range(2**len(n)):\r\n\r\n res = ''\r\n pos = 0\r\n cnt = 0\r\n while i > 0:\r\n if i%2 == 1:\r\n res += n[pos]\r\n cnt += 1\r\n pos += 1\r\n i = i >> 1\r\n\r\n if len(res) == 0 or res[0] == '0':\r\n continue\r\n\r\n if int(res) in per:\r\n best = min(best, len(n) - cnt)\r\n\r\n print(best if best != 100 else -1)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l=int(input())\r\nl1=str(l)\r\nw=1\r\nma=-1\r\nwhile w*w<=l :\r\n s=str(w*w)\r\n i=0\r\n k=0\r\n for x in s :\r\n for j in range(i,len(l1)) :\r\n if x==l1[j] :\r\n k+=1\r\n \r\n break\r\n i=j+1\r\n if k==len(s) :\r\n ma=len(l1)-len(s)\r\n w+=1\r\nprint(ma)\r\n \r\n \r\n \r\n \r\n", "import math\r\n\r\ndef validate(number):\r\n\tif math.sqrt(number).is_integer():\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\ndef inp_queue(number):\r\n\tglobal queue\r\n\tc = 0\r\n\twhile c < len(number):\r\n\t\tnumber_new = []\r\n\t\tfor i in range(0, len(number)):\r\n\t\t\tif i != c:\r\n\t\t\t\tnumber_new.insert(i, number[i])\r\n\t\tresult = ''.join(number_new)\r\n\t\tif result not in queue:\r\n\t\t\tif int(result) != 0:\r\n\t\t\t\tqueue.append(result)\r\n\t\tc = c + 1\r\n\treturn queue\r\n\r\ndef get_max(array):\r\n\tvalues = []\r\n\tfor i in range(0, len(array)):\r\n\t\tvalues.append(array[i])\r\n\tvalue = max(values)\r\n\treturn value\r\n\r\n#flow of the program\r\nn = input()\r\nqueue = [n]\r\nsquare = []\r\n\r\nwhile len(queue) > 0:\r\n\tn_square = queue.pop(0)\r\n\tvalidation = validate(int(n_square))\r\n\tif validation == False:\r\n\t\tif len(n_square) > 1:\r\n\t\t\tnew_queue = inp_queue(n_square)\r\n\telse:\r\n\t\tsquare.append(int(n_square))\r\n\r\nif square == []:\r\n\tprint('-1')\r\nelse:\r\n\tresult_square = str(get_max(square))\r\n\tif result_square[0] == '0':\r\n\t\toutput = len(n) - len(result_square) + 1\r\n\telse:\r\n\t\toutput = len(n) - len(result_square)\r\n\tprint(output)\r\n\r\n", "import math\r\ndef isPerfectSquare(x):\r\n sr = math.sqrt(x)\r\n return ((sr - math.floor(sr)) == 0)\r\ndef s(arr, n) :\r\n c = []\r\n opsize = math.pow(2, n)\r\n for counter in range( 1, (int)(opsize)) :\r\n l = []\r\n for j in range(0, n) :\r\n if (counter & (1<<j)) :\r\n l.append(arr[j])\r\n c.append(l)\r\n return c\r\nk = list(input())\r\nz = k\r\nk = s(k,len(k))\r\nk = sorted(k)\r\nk.reverse()\r\nfor i in range(len(k)):\r\n k[i] = str(''.join(k[i]))\r\nfor i in range(len(k)):\r\n if(isPerfectSquare(int(k[i])) and k[i][0]!='0'):\r\n k[i] = [len(z)-len(k[i]),1]\r\n else:\r\n k[i] = 0\r\nl = 10000000000000000\r\nfor i in range(len(k)):\r\n try:\r\n if(k[i][1]==1):\r\n if(l>k[i][0]):\r\n l = k[i][0]\r\n except:\r\n pass\r\nif(l==10000000000000000):\r\n print(-1)\r\nelse:\r\n print(l)\r\n", "from math import *\r\ninp=int(input())\r\nli=[]\r\nwhile inp>0:\r\n li.append(inp%10)\r\n inp//=10\r\nli.reverse()\r\nres=len(li)\r\nfor i in range(1,2**len(li)):\r\n cur=0\r\n li_num=[]\r\n for j in range(len(li)):\r\n if i&(1<<j):\r\n li_num.append(str(li[j]))\r\n cur+=1\r\n if len(li_num)>0:\r\n num=int(''.join(li_num))\r\n else:\r\n num=0\r\n if sqrt(num)==int(sqrt(num)) and li_num[0]!='0':\r\n res=min(len(li)-cur,res)\r\nif res==len(li):\r\n print(\"-1\")\r\nelse:\r\n print(res)\r\n", "import math\r\ndef ok(n):\r\n k = int(n)\r\n return k == int(math.sqrt(k)) ** 2\r\ns = input()\r\nmx = -1\r\nfor i in range(0, 1 << len(s)):\r\n tmp = \"\"\r\n for j in range(0, len(s)):\r\n if i & (1 << j):\r\n tmp = tmp + s[j]\r\n if len(tmp) > 0 and tmp[0] != '0' and ok(tmp) == True:\r\n mx = max(mx, len(tmp))\r\nif mx == -1:\r\n print(-1)\r\nelse:\r\n print(len(s)-mx)", "import sys \r\nimport math as mt\r\nimport bisect\r\n#input=sys.stdin.readline\r\n#t=int(input())\r\nt=1 \r\ndef sqt(x):\r\n l1=[]\r\n i=1\r\n while i*i<=n:\r\n l1.append(str(i*i))\r\n i+=1\r\n return l1 \r\ndef solve():\r\n nums=sqt(n)\r\n #print(nums[4],nums[4][1])\r\n d={}\r\n s=str(n)\r\n for i in range(len(s)):\r\n if d.get(int(s[i]),-1)==-1:\r\n d[int(s[i])]=[]\r\n d[int(s[i])].append(i)\r\n #print(d)\r\n mini=100\r\n for i in range(len(nums)):\r\n flag=True\r\n pos=-1\r\n # print(nums[i],len(nums[i]),d,pos)\r\n for j in range(len(nums[i])):\r\n if d.get(int(nums[i][j]),-1)==-1:\r\n flag=False\r\n break\r\n else:\r\n ch=0\r\n \r\n for j1 in range(len(d[int(nums[i][j])])):\r\n if d[int(nums[i][j])][j1]>pos:\r\n pos=d[int(nums[i][j])][j1]\r\n ch=1\r\n break\r\n if ch==0:\r\n flag=False\r\n break\r\n if flag: \r\n mini=min(len(s)-len(nums[i]),mini) \r\n if mini==100:\r\n mini=-1\r\n return mini \r\n \r\n \r\n \r\n \r\n \r\n \r\nfor _ in range(t):\r\n n=int(input())\r\n #a=int(input())\r\n #b=int(input())\r\n #n,a,b=map(int,input().split())\r\n #x,y,k=map(int,input().split())\r\n #n,h=(map(int,input().split()))\r\n #l=list(map(int,input().split()))\r\n #l2=list(map(int,input().split()))\r\n \r\n print(solve())", "import math\nimport functools\n\nn = int(input())\n\ndef is_square(n):\n return int(math.sqrt(n)) ** 2 == n\n\ndef remove_digit(digits, i):\n res = 0\n for j, d in enumerate(digits):\n if j == i:\n continue\n res = 10 * res + d\n return res\n\[email protected]_cache(maxsize=None)\ndef f(n):\n if is_square(n):\n res = 0\n else:\n digits = [ int(c) for c in str(n) ]\n if len(digits) == 1: \n res = float('inf')\n else:\n if digits[1] == 0:\n start = 1\n else:\n start = 0 \n succ = [ remove_digit(digits, i) for i in range(start, len(digits)) ]\n res = min( (f(s) + 1 for s in succ), default = float('inf') )\n return res\n\nres = f(n)\nif res == float('inf'):\n print(-1)\nelse:\n print(res)\n", "n = input()\r\nk= []\r\nfor i in range(1,100000):\r\n k.append(str(i*i))\r\nl=[]\r\nfor i in k:\r\n if(int(i)<=int(n)):\r\n j=0\r\n o=0\r\n while(j<len(n) and o<len(i)):\r\n if(n[j]==i[o]): o+=1\r\n j+=1\r\n if(o==len(i)): l.append(i)\r\n else:\r\n break\r\n\r\nif(len(l)>0):print(len(n)-len(l[-1]))\r\nelse:print(\"-1\") \r\n", "from collections import deque\r\n\r\nd = set()\r\nl = dict()\r\nfor i in range(1, 100000):\r\n d.add(str(i ** 2))\r\n \r\nn = input()\r\nl[n] = 0\r\nq = deque()\r\nq.append(n)\r\nwhile len(q) > 0:\r\n x = q.popleft()\r\n if x in d:\r\n print(l[x])\r\n exit(0)\r\n for i in range(len(x)):\r\n res = x[:i] + x[i + 1:]\r\n if len(res) > 0 and res[0] != '0' and res not in l:\r\n l[res] = l[x] + 1\r\n q.append(res)\r\nprint(-1)", "s = input()\r\nfor i in range(10**5,0,-1):\r\n t,p=str(i * i)+'$',0\r\n for x in s:\r\n if x == t[p]:\r\n p += 1\r\n if p == len(t)-1:\r\n print(len(s)-len(t)+1)\r\n break\r\nelse:\r\n print(-1)", "from math import sqrt\r\n\r\ndef f(n, known):\r\n\tif n not in known:\r\n\t\tif abs(sqrt(n) - round(sqrt(n))) < 0.000001:\r\n\t\t\tknown[n] = 0\r\n\t\telse:\r\n\t\t\tk = str(n)\r\n\t\t\tif len(k) == 1:\r\n\t\t\t\tknown[n] = 1000\r\n\t\t\telse:\r\n\t\t\t\tpos = set()\r\n\t\t\t\tif k[1] != '0':\r\n\t\t\t\t\tpos.add(int(k[1:]))\r\n\t\t\t\tfor i in range(1, len(k)):\r\n\t\t\t\t\tpos.add(int(k[:i] + k[i+1:]))\r\n\t\t\t\tmin_count = float('inf')\r\n\t\t\t\tfor i in pos:\r\n\t\t\t\t\tpart = f(i, known)\r\n\t\t\t\t\tif part + 1 < min_count:\r\n\t\t\t\t\t\tmin_count = part + 1\r\n\t\t\t\tknown[n] = min_count\r\n\treturn known[n]\r\n\r\nn = int(input())\r\nknown = {}\r\nk = f(n, known)\r\nif k > 100:\r\n\tprint(-1)\r\nelse:\r\n\tprint(k)\r\n", "import math as ma\r\nfrom sys import exit\r\ndef li():\r\n\treturn list(map(int,input().split()))\r\ndef num():\r\n\treturn map(int,input().split())\r\ndef nu():\r\n\treturn int(input())\r\n\r\n\r\nimport math\r\ndef perfectSquare(s):\r\n\t# size of the string\r\n\tn = len(s)\r\n\r\n\t# our final answer\r\n\tans = -1\r\n\r\n\t# to store string which is\r\n\t# perfect square.\r\n\tnum = \"\"\r\n\r\n\t# We make all possible subsequences\r\n\tfor i in range(1 , (1 << n)):\r\n\t\tstr = \"\"\r\n\r\n\t\tfor j in range(0 , n):\r\n\r\n\t\t\t# to check jth bit is\r\n\t\t\t# set or not.\r\n\t\t\tif ((i >> j) & 1):\r\n\t\t\t\tstr = str + s[j]\r\n\r\n\t\t# we do not consider a number\r\n\t\t# with leading zeros\r\n\t\tif (str[0] != '0'):\r\n\r\n\t\t\t# convert our temporary\r\n\t\t\t# string into integer\r\n\t\t\ttemp = 0;\r\n\t\t\tfor j in range(0 , len(str)):\r\n\t\t\t\ttemp = (temp * 10 +\r\n\t\t\t\t (ord(str[j]) - ord('0')))\r\n\r\n\t\t\tk = int(math.sqrt(temp))\r\n\r\n\t\t\t# checking temp is perfect\r\n\t\t\t# square or not.\r\n\t\t\tif (k * k == temp):\r\n\r\n\t\t\t\t# taking maximum sized\r\n\t\t\t\t# string\r\n\t\t\t\tif (ans < len(str)):\r\n\t\t\t\t\tans = len(str)\r\n\t\t\t\t\tnum = str\r\n\r\n\tif (ans == -1):\r\n\t\treturn ans\r\n\telse:\r\n\r\n\t\t# print PerfectSquare\r\n\t\t#print(\"{} \".format(num) , end=\"\")\r\n\t\treturn n - ans\r\n\r\nprint(perfectSquare(input()))", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef is_subsequence(s, t):\r\n n = len(s)\r\n m = len(t)\r\n j = 0\r\n for i in range(n):\r\n if s[i] == t[j]:\r\n j += 1\r\n if j == m:\r\n return True\r\n return False\r\n\r\ndef solve(n):\r\n min_val = 10 ** 18\r\n for i in range(1, math.floor(math.sqrt(n)) + 1):\r\n if is_subsequence(str(n), str(i ** 2)):\r\n val = len(str(n)) - len(str(i ** 2))\r\n min_val = min(min_val, val)\r\n if min_val == 10 ** 18:\r\n return -1\r\n return min_val\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", "n = input()\r\na=[]\r\nfor i in range(1,int((2*10**9)**0.5)+1):\r\n a.append(i**2)\r\nm = float('inf')\r\nl = len(n)\r\nfor i in range(1,2**len(n)):\r\n bi = bin(i)[2:]\r\n bi = '0'*(l-len(bi))+bi\r\n ne = ''\r\n for i in range(l):\r\n if bi[i] == '1':\r\n ne += n[i]\r\n if ne[0] == '0':continue\r\n else:\r\n if int(ne) in a:\r\n m = min(m,bi.count('0'))\r\nif m == float('inf'):print(-1)\r\nelse:print(m)\r\n", "from itertools import combinations\r\nfrom functools import reduce\r\nfrom math import sqrt\r\nn = input()\r\nj = len(n)\r\nkey = -1\r\nfor _ in range(j, 0, -1):\r\n for i in combinations(n, _):\r\n ld = reduce(lambda x, y: x + y, i)\r\n if sqrt(int(ld)) == int(sqrt(int(ld))) and ld[0] != str(0):\r\n if len(n) - len(ld) < key or key == -1:\r\n key = len(n) - len(ld)\r\nelse:\r\n if key == -1:\r\n print(-1)\r\n else:\r\n print(key)", "from math import sqrt\r\n\r\na = input()\r\n\r\ni = 0\r\nr = 1e9\r\nwhile True:\r\n i += 1\r\n if i == (1 << len(a)):\r\n break\r\n c = ''\r\n for id, j in enumerate(a):\r\n if i&1<<id:\r\n c += j\r\n if c[0] == '0':\r\n continue\r\n sq = int(sqrt(int(c)))\r\n if sq*sq == int(c):\r\n r = min(r, len(a) - len(c))\r\n\r\nif r == 1e9:\r\n print(-1)\r\nelse:\r\n print(r)", "n=int(input())\r\ns=str(n)\r\nx=int(n**0.5)\r\nb=0\r\nwhile True:\r\n k=str(x*x)\r\n q=0\r\n b=0\r\n for i in k:\r\n if i not in s[q:]:\r\n b=1\r\n break\r\n else:\r\n q=q+s[q:].find(i)+1\r\n if b==0:\r\n print(len(s)-len(k))\r\n b=2\r\n break\r\n x-=1\r\n if x<1:\r\n break\r\nif b<2:\r\n print(-1)", "n = input()\ns = int(int(n)**(0.5))\nwhile s:\n r = str(s*s)\n c = 0\n for i in range(len(n)):\n if n[i] == r[c]:\n c+=1\n if c == len(r):\n exit(print(len(n)-c))\n s-=1\nprint(-1)\n", "import itertools as it\r\nimport functools as fu\r\nimport math\r\n\r\nleftover = []\r\ndef nint(n=1):\r\n global leftover\r\n while len(leftover) < n:\r\n leftover.extend(input().split())\r\n res = tuple(map(int, leftover[:n]))\r\n leftover = leftover[n:]\r\n return res if len(res) > 1 else res[0]\r\ndef nlin():\r\n global leftover\r\n if not leftover: return input()\r\n return ' '.join(leftover)\r\ndef ntok():\r\n global leftover\r\n if not leftover:\r\n leftover.extend(input().split())\r\n return leftover[0]\r\n\r\n##########################################\r\n\r\ns=input()\r\nn=int(s)\r\nmind=999\r\nfor i in range(1,int(math.sqrt(n))+1):\r\n s2=str(i*i)\r\n d=0\r\n p=0\r\n i=-1\r\n for c in s:\r\n i+=1\r\n if c==s2[p]:\r\n p+=1\r\n if p==len(s2):\r\n d+=len(s)-i-1\r\n mind=min(mind,d)\r\n break\r\n else:\r\n d+=1\r\nif mind==999:\r\n mind=-1\r\nprint(mind)\r\n", "def get_list(func=None):\n if not func:\n return input().split()\n return list(map(func, input().split()))\n\n\n\ndef edit_dist(A, a, v=False):\n \"\"\" Calculate the edit distance from A to a. \"\"\"\n if v:\n print(A, a)\n\n if len(A) < len(a):\n return -1\n\n if len(a) == 0:\n return len(A)\n\n mind = float('inf')\n for i, ch in enumerate(A):\n if ch == a[0]:\n d = edit_dist(A[i+1:], a[1:], v)\n if d != -1:\n mind = min(mind, d + i)\n\n if mind < float('inf'):\n return mind\n return -1\n\n\n# print(edit_dist(\"3124\", \"4900\", True))\n\n\nn = input()\nmind = float('inf')\n\nfor i in range(1, 44800):\n s = str(i**2)\n d = edit_dist(n, s)\n if d != -1 and mind > d:\n mind = d\n ansi = s\n\nif mind > 100:\n print(-1)\nelse:\n print(mind)\n # print(ansi)\n\n # print(\"edit distance betwee {} and {}\".format(n, ansi))\n # edit_dist(n, ansi, True)\n\n\n# import sys\n# if 't' in sys.argv:\n# while True:\n# A, a = input(\"enter two numbers: \").split()\n# print(\"edit distance: \", edit_dist(A, a, True))\n", "from math import sqrt\r\n\r\nst = input()\r\nl = int(sqrt(int(st)) + 1)\r\nsqrs = [str(x * x) for x in range(1, l)]\r\nfor sqr in reversed(sqrs):\r\n i = -1\r\n for ch in list(sqr):\r\n i = st.find(ch, i + 1)\r\n if i == -1: break\r\n else:\r\n print(str(len(st) - len(sqr)))\r\n exit()\r\nprint(-1)\r\n", "n=input()\r\nx=1\r\na=[]\r\nwhile x*x<=2*10**9:\r\n\ta.append(str(x*x))\r\n\tx+=1\r\nans=100\r\nfor s in a:\r\n\ti,j=0,0\r\n\tif len(s)>len(n):\r\n\t\tbreak\r\n\twhile i<len(n) and j<len(s):\r\n\t\tif n[i]==s[j]:\r\n\t\t\tj+=1\r\n\t\ti+=1\r\n\tif j == len(s):\r\n\t\tans=min(ans,len(n)-len(s))\r\nif ans==100:\r\n\tprint(-1)\r\nelse:\r\n print(ans)", "import math\n\n\ndef isSubString(str_s, str_t):\n i = 0\n j = 0\n\n while i < len(str_s) and j < len(str_t):\n if (str_s[i] == str_t[j]):\n i += 1\n j += 1\n else:\n i += 1\n if j == len(str_t):\n return True\n return False\n\n\nstr_s = input()\n\nfor i in range(int(math.sqrt(int(str_s))), 0, -1):\n now = i ** 2\n if isSubString(str_s, str(now)):\n print(len(str_s) - len(str(now)))\n exit()\nprint(-1)\n\n", "n = int(input())\ns = str(n)\nlength = len(s)\n\nans = n \nfor i in range(1, 1 << length):\n ns = ''\n for j in range(length):\n if i >> j & 1:\n ns += s[j]\n if len(ns) == 0 or ns[0] == '0':\n continue\n x = int(ns)\n y = int(x ** 0.5)\n if y * y == x:\n ans = min(ans, length - len(ns))\n\nprint(ans if ans != n else -1)\n", "from sys import stdin,stdout\r\nn=stdin.readline().strip()\r\ns=int(int(n)**(0.5))\r\nwhile s:\r\n r=str(s*s)\r\n c=0\r\n for i in range(len(n)):\r\n if n[i]==r[c]:\r\n c+=1\r\n if c==len(r):\r\n exit(print(len(n)-c))\r\n s-=1\r\nprint(-1) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = set()\r\nfor i in range(1, pow(10, 5)):\r\n if i * i > n:\r\n break\r\n s.add(str(i * i))\r\nn = list(str(n))\r\nl = len(n)\r\npow2 = [1]\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1])\r\npl = pow2[l]\r\nans = 114514\r\nfor i in range(pl):\r\n x = []\r\n c = 0\r\n for j in range(l):\r\n if i & pow2[j]:\r\n x.append(n[j])\r\n else:\r\n c += 1\r\n if \"\".join(x) in s:\r\n ans = min(ans, c)\r\nif ans == 114514:\r\n ans = -1\r\nprint(ans)", "n = input()\r\n\r\nINF = 987654321\r\nres = INF\r\nfor i in range(1, 50000):\r\n square = list(str(i * i))\r\n number = list(n)\r\n\r\n while square and number:\r\n # 마지막 숫자만 점검\r\n if square[-1] == number[-1]:\r\n square.pop()\r\n number.pop()\r\n\r\n # square 완성\r\n if not square:\r\n res = min(res, len(n) - len(str(i * i)))\r\n\r\nif res == INF:\r\n print(-1)\r\nelse:\r\n print(res)", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\nimport sys\r\n\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\nimport math\r\n\r\ndef check(a, b):\r\n a=str(a)\r\n b=str(b)\r\n l=len(b)\r\n\r\n t=0\r\n\r\n for k in range(l):\r\n while(True):\r\n if t>len(a)-1:\r\n return False\r\n\r\n if a[t]!=b[k]:\r\n t+=1\r\n else:\r\n t+=1\r\n break\r\n\r\n return True\r\n\r\nn=int(input())\r\n\r\ns=int(n**0.5)\r\nm=10**10\r\n\r\nfor i in range(1,s+1):\r\n if check(n,i*i):\r\n m=min(m,len(str(n))-len(str(i*i)))\r\n\r\n\r\n\r\nprint(m if m<10**10 else \"-1\")\r\n\r\n\r\n\r\n", "import sys\nfrom math import *\nreadints=lambda:map(int, input().strip('\\n').split())\n\nn = input()\n\n\nsquares = []\nx = 1\nwhile True:\n if x*x > 2 * 10**9:\n break\n squares.append(str(x*x))\n x += 1\n\ninf = (2 * 10**9) + 5\nans = inf\n\ndef edits(cur, tobe):\n i = 0\n cnt = 0\n for c in tobe:\n j = cur.find(c,i)\n if j == -1:\n return -1\n cnt += j-i\n i = j+1\n cnt += len(cur) - i\n return cnt\n \n\n\nfor sq in squares:\n e = edits(n, sq)\n if e != -1:\n # print(sq,e)\n ans = min(ans, e)\n\nif ans == inf:\n ans = -1\nprint(ans)\n\n", "import sys\r\n\r\nsquare = set()\r\nfor i in range(1, 44722):\r\n square.add(str(i*i))\r\n\r\ns = input()\r\nn = len(s)\r\ninf = 100\r\nans = inf\r\n\r\nfor bit in range(1, 1 << n):\r\n w = ''.join(s[i] for i in range(n) if (1 << i) & bit)\r\n if w in square:\r\n ans = min(ans, n - bin(bit).count('1'))\r\n\r\nprint(ans if ans != inf else -1)\r\n", "from itertools import combinations\nfrom math import floor, sqrt\n\n\ndef fn(x):\n n = len(x)\n ops = -1\n for i in reversed(range(1, n + 1)):\n for y in filter(lambda o: o[0] != '0', combinations(x, i)):\n y = int(''.join(y))\n if floor(sqrt(y)) ** 2 == y:\n ops = i\n return n - ops\n return ops\n\n\nif __name__ == '__main__':\n print(fn(list(input())))\n", "import copy\r\ndef main():\r\n n = int(input())\r\n m = copy.copy(n)\r\n cnt1 = 0;cnt2 = 0\r\n a = [0 for i in range(10)]\r\n b = [0 for i in range(10)]\r\n while m!=0:\r\n a[cnt1] = m%10;m//=10;cnt1+=1\r\n i = int(n**0.5)\r\n while i>=1 :\r\n x = i*i\r\n cnt2 = 0\r\n k = x\r\n i -= 1\r\n while x!=0:\r\n b[cnt2] = x%10;x//=10;cnt2+=1\r\n l = 0\r\n j = 0\r\n while j<cnt1:\r\n if a[j] == b[l]:\r\n l+=1\r\n if l==cnt2:break\r\n j += 1\r\n if l==cnt2:\r\n print(cnt1-l)\r\n return\r\n print(-1)\r\n return\r\nmain()", "s = input()\nL = len(s)\nr = 0\ndef check(s, b, l):\n t = 0\n for i in range(l):\n ok = 0\n for j in range(t, L):\n if b[i] == s[j]:\n t = j + 1\n ok = 1\n break\n if not ok:\n return 0\n return 1\nfor i in range(1, int(int(s) ** 0.5) + 2):\n b = str(i * i)\n l = len(b)\n if check(s, b, l):\n r = max(l, r)\nprint(L - r if r else -1)\n", "def check(a, b):\r\n k = 0\r\n asize = len(a)\r\n\r\n for j in range(asize):\r\n if a[j] == b[k]:\r\n k += 1\r\n \r\n if k == len(b):\r\n break\r\n\r\n if k == len(b):\r\n return asize - len(b)\r\n\r\n return -1\r\n\r\n\r\ns = input()\r\n\r\nfor i in range(45000, 0, -1):\r\n d = check(s, str(i * i))\r\n\r\n if d != -1:\r\n print(d)\r\n exit()\r\n\r\nprint(-1)", "from sys import stdin, stdout\r\nimport math,sys,heapq\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict\r\nfrom os import path\r\nimport random\r\nimport bisect as bi\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\nif (path.exists('input.txt')): \r\n #------------------Sublime--------------------------------------#\r\n sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\n def I():return (int(input()))\r\n def In():return(map(int,input().split()))\r\nelse:\r\n #------------------PYPY FAst I/o--------------------------------#\r\n def I():return (int(stdin.readline()))\r\n def In():return(map(int,stdin.readline().split()))\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 gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\ndef main():\r\n try:\r\n n=I()\r\n l1=str(n)\r\n d={}\r\n ans=-1\r\n l=[]\r\n i=1\r\n\r\n while i**2<=n:\r\n l.append(i**2)\r\n i+=1\r\n n1=len(l1)\r\n for x in l:\r\n t=str(x)\r\n i=0\r\n count=0\r\n for j in range(len(t)):\r\n while(i<n1):\r\n if l1[i]==t[j]:\r\n count+=1\r\n i+=1\r\n break\r\n else:\r\n i+=1\r\n if count==len(t):\r\n if ans==-1:\r\n ans=len(t)\r\n else:\r\n ans=max(ans,len(t))\r\n if ans==-1:\r\n print(-1)\r\n else:\r\n print(n1-ans)\r\n\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()", "from itertools import combinations as cmb\r\n\r\nsqset = {i * i for i in range(1, 45000)}\r\n\r\ndef f(t): # t is a tuple\r\n s = ''\r\n for c in t: s += c\r\n return s\r\n\r\ns = input()\r\n\r\nans = -1\r\n\r\nfor j in range(len(s), 0, -1):\r\n l = list(cmb(s, j))\r\n for tup in l:\r\n if tup[0] != '0' and int(f(tup)) in sqset:\r\n ans = len(s) - j\r\n break\r\n if ans != -1:\r\n break\r\n\r\nprint(ans)\r\n", "from math import sqrt\r\nnum = int(input())\r\ndef inString(i, num):\r\n i = str(i)\r\n num = str(num)\r\n cur_term = 0\r\n for j in range(len(num)):\r\n if num[j] == i[cur_term]:\r\n cur_term += 1\r\n if cur_term == len (i):\r\n return True\r\n return False \r\nansNotFound = True\r\nfor i in range(int(sqrt(num)) + 1, 0, -1):\r\n if inString(i*i, num):\r\n print(len(str(num)) - len(str(i*i)))\r\n ansNotFound = False\r\n break\r\nif ansNotFound:\r\n print(-1)", "import sys\r\nimport math\r\nwhile True:\r\n\ttry:\r\n\t\tdef solution(n):\r\n\t\t\tnum = [0]*16\r\n\t\t\tmx = maxi = 0\r\n\t\t\tln = len(n)\r\n\t\t\tif math.ceil(math.sqrt(int(n))) == math.floor(math.sqrt(int(n))):\r\n\t\t\t\tprint(0)\r\n\t\t\t\treturn\r\n\t\t\t\t\r\n\t\t\twhile num[0] == 0:\r\n\t\t\t\tnum[len(n)] += 1\r\n\t\t\t\tfor i in range(ln, 0, -1):\r\n\t\t\t\t\tif num[i] == 2:\r\n\t\t\t\t\t\tnum[i-1] += 1\r\n\t\t\t\t\t\tnum[i] = 0\r\n\t\t\t\thas = ans = 0\r\n\t\t\t\r\n\t\t\t\tfor i in range(1,ln+1, 1):\r\n\t\t\t\t\tif num[i] == 1 and n[i-1] == '0' and has == 0:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\telif num[i] == 1 :\r\n\t\t\t\t\t\thas += 1\r\n\t\t\t\t\t\tans = ans*10 + int(n[i-1])\r\n\t\t\t\t\t\t\r\n\t\t\t\tif math.ceil(math.sqrt(ans)) == math.floor(math.sqrt(ans)) and ans > 0:\r\n\t\t\t\t\tif mx < ans:\r\n\t\t\t\t\t\tmx = ans\r\n\t\t\t\t\t\tmaxi = has\r\n\t\t\t\t\t\t#print(ans)\r\n\t\t\t#print(maxi, ln)\r\n\t\t\tif mx > 0:\r\n\t\t\t\tprint(ln -maxi)\r\n\t\t\telse:print(\"-1\") \r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\r\n\t\tdef read():\r\n\t\t\t#sys.stdin = open(\"input.txt\", \"r\")\r\n\t\t\tn = input()\r\n\t\t\tsolution(n)\r\n\t\t\t\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "n = int(input())\r\nS = set()\r\nfor i in range(1, 10**5):\r\n S.add(i**2)\r\n\r\nn = list(str(n))\r\nm = len(n)\r\nans = 10**18\r\nfor i in range(1<<m):\r\n t = []\r\n for j in range(m):\r\n if (i >> j)&1:\r\n t.append(n[j])\r\n if not t:\r\n continue\r\n if t[0] == '0':\r\n continue\r\n t = ''.join(t)\r\n temp = m-len(t)\r\n t = int(t)\r\n if t in S:\r\n ans = min(ans, temp)\r\nif ans == 10**18:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "\n\ndef substring(a, b):\n i, j = 0, 0\n while i < len(a) and j < len(b):\n if a[i] == b[j]:\n i += 1\n j += 1\n return i == len(a)\n\n\nn = input()\n\nk = 1\n\nbest_len = 0\n\nwhile len(str(k * k)) <= len(n):\n tmp = str(k * k)\n\n if substring(tmp, n):\n best_len = max([best_len, len(tmp)])\n\n k += 1\n\nif best_len == 0:\n print(-1)\nelse:\n print(len(n) - best_len)\n", "import math\r\nimport queue\r\n\r\nfrom itertools import permutations\r\n\r\n\r\ndef is_square(l):\r\n x=math.floor(math.sqrt(l))\r\n if x*x==l or (x-1)*(x-1)==l or (x+1)*(x+1)==l:\r\n return True\r\n else:\r\n return False\r\n\r\nmax_len=-1\r\ns=input()\r\nn=len(s)\r\n\r\ndef cal(t,k):\r\n global max_len\r\n \r\n if k>=n:\r\n if len(t)>0 and t[0]!='0' and is_square(int(t)):\r\n max_len=max(max_len,len(t))\r\n \r\n return\r\n else:\r\n cal(t,k+1)\r\n cal(t+s[k],k+1)\r\n \r\n \r\ncal(\"\",0)\r\n \r\n \r\n \r\n\r\n\r\nif max_len==-1:\r\n print(-1)\r\nelse:\r\n print((n-max_len))\r\n\r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 12/07/2023 10:55:20 Hanoi, Vietnam\r\n# **/\r\n\r\ndef substr(s:str, t:str):\r\n # Check if t is a substring of s (not necessarily consecutive)\r\n tofind = 0\r\n for c in t:\r\n try:\r\n tofind = s.index(c, tofind) + 1\r\n except ValueError:\r\n return False\r\n return True\r\n\r\nn = input()\r\nsq = [str(i*i) for i in range(1, int(int(n)**0.5)+1)]\r\nmaxmatch = -1\r\n\r\nfor t in sq:\r\n if substr(n, t):\r\n maxmatch = max(maxmatch, len(t))\r\n\r\nif maxmatch == -1:\r\n print(-1)\r\nelse:\r\n print(len(n) - maxmatch)", "s = input()\na = list()\nfor i in range (1,100000):\n a.append(str(i*i))\nsz = len(s)\nmn = 100000000000\nfor i in range(len(a)):\n k =0\n if(len(a[i])>sz):\n break\n for j in range (sz):\n if(s[j]==a[i][k]):\n k+=1\n if k == len(a[i]):\n mn = min(mn,sz-k)\n break\nif mn == 100000000000:\n print(-1)\nelse:\n print(mn)\n\n \t \t \t \t \t\t\t \t \t \t \t \t\t\t \t\t\t\t", "n = int(input())\nnum1 = 0\nINF = -1\n\nfor k in range(1, int(n**0.5) + 1):\n ans = k * k\n str2 = str(ans)\n str1 = str(n)\n i, j = 0, 0\n flag = 0\n\n while i < len(str2):\n while j < len(str1) and str1[j] != str2[i]:\n j += 1\n if j == len(str1):\n flag = 1\n i += 1\n j += 1\n\n if not flag:\n INF = len(str1) - len(str2)\n\nif INF == -1:\n print(\"-1\")\nelse:\n print(INF)\n\n \t\t \t \t \t\t \t\t \t \t \t \t\t\t\t" ]

[ "n = int(input())\r\na = [int(input()) for i in range(n)]\r\nmod = 10007\r\n\r\na.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += a[i] * a[n - 1 - i] % mod\r\n if ans >= mod:\r\n ans -= mod\r\n \r\nprint(ans)", "n = int(input())\ns = sorted([int(input()) for i in range(n)])\n#print(s)\na = 0\nq = 10007\nfor i in range(n//2):\n a += ((s[i]*s[n-1-i]*2)%q)\nif n%2==1:\n a += ((s[n//2]**2)%q)\nprint(a%q)", "laziness = []\r\nfor i in range(int(input())):\r\n laziness.append(int(input()))\r\n\r\nlaziness.sort()\r\nj = len(laziness) - 1\r\nsum = 0\r\nfor numb in laziness:\r\n sum += numb * laziness[j]\r\n j -= 1\r\n\r\nprint(sum % 10007)\r\n", "n = int(input())\r\n\r\nnum = [int(input()) for _ in range(n)]\r\nnum.sort()\r\n\r\nbegin = 0\r\nend = n-1\r\nans = 0\r\n\r\nwhile begin<=end:\r\n if begin == end:\r\n ans += (num[begin]*num[end])\r\n ans %= 10007\r\n else:\r\n ans += 2*num[begin]*num[end]\r\n ans %= 10007\r\n begin+=1\r\n end-=1\r\n \r\nprint(ans)", "n = int(input())\na = []\n\nfor _ in range(n):\n a.append(int(input()))\n\na.sort()\n\nans = 0\n\nfor x, y in zip(a, reversed(a)):\n ans = (ans + x*y) % 10007\n\nprint(ans)\n", "n = int(input())\r\na = [int(input()) for i in range(n)]\r\na.sort()\r\nprint(sum(map(lambda x,y: x*y, a, reversed(a))) % 10007)\r\n", "n = int(input())\r\nnum = sorted([int(input()) for _ in range(n)])\r\nprint(sum([x*y for x,y in zip(num, reversed(num))])%10007)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(int(input()))\r\na=sorted(a)\r\nsumi=0\r\nfor j in range(n):\r\n sumi = (sumi + (a[j])*(a[n-j-1]))%10007\r\nprint(sumi%10007)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\ta.append(int(input()))\r\n\r\na.sort()\r\np1=0\r\np2=n-1\r\nt=0\r\nwhile p1<p2:\r\n\tt+=a[p1]*a[p2]\r\n\tp1+=1\r\n\tp2-=1\r\nt*=2\r\nif n%2==1:\r\n\tt+=a[n//2]**2\r\nprint(t%10007)", "n,a,ans=int(input()),[],0\r\nfor _ in range(n):a.append(int(input()))\r\na.sort()\r\nfor i in range(n):ans+=a[i]*a[n-i-1]\r\nprint(ans%10007)", "n=int(input())\r\na=sorted(int(input()) for _ in range(n))\r\nprint(sum(a[i]*a[-i-1] for i in range(n))%10007)", "fuck = int(input())\na = sorted(int(input()) for _ in range(fuck))\nprint(sum(a[i]*a[-i-1] for i in range(fuck))%10007)\n# Surprise motherfucker", "n=int(input())\r\nans=0\r\nl=[]\r\nfor i in range(n):\r\n x=int(input())\r\n l.append(x)\r\nl.sort()\r\nl1=l[::-1]\r\nfor i in range(n):\r\n ans+=l[i]*l1[i]\r\nprint(ans%10007)", "n=int(input())\r\nlst=[]\r\napp=lst.append\r\nfrom sys import stdin\r\nfor i in range(n):\r\n x=int(stdin.readline())\r\n app(x)\r\nlst.sort()\r\nres=0\r\nfor i,x in enumerate(lst):\r\n res+=lst[-i-1]*x\r\n res=res%10007\r\nprint(res)", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nk = [int(input()) for i in range(n)]\nk.sort()\nlol = 0\nfor i in range(n):\n lel = k[i] % 10007\n lul = k[-1*(i+1)] % 10007\n\n lol += lel*lul\n\n lol = lol % 10007\nprint(lol)\n \n\n\n \t\t \t \t \t \t\t\t \t \t\t\t \t \t \t", "n = int(input())\r\na = [int(input()) for x in range(n)]\r\na.sort()\r\ns = 0\r\nfor i in range(n):\r\n s += a[i] * a[n-i-1]\r\n s %= 10007\r\nprint(s)", "from operator import mul\nfrom sys import stdin\n\ninput()\nl = sorted(map(int, stdin.read().splitlines()))\nprint(sum(map(mul, l, reversed(l))) % 10007)", "n = int(input())\r\nlazy = []\r\ntasks = []\r\nfor x in range(n):\r\n\tk = int(input())\r\n\tlazy.append(k)\r\n\ttasks.append(k)\r\nlazy.sort()\r\ntasks.sort(reverse = True)\r\nthing = list(zip(lazy, tasks))\r\ntotal = 0\r\nfor x in thing:\r\n\ttotal += x[0] * x[1]\r\n\r\nprint(int(total%10007))", "import sys, math\r\nreadline = sys.stdin.readline\r\n\r\nn = int(readline())\r\na = []\r\nfor _ in range(n):\r\n a.append(int(readline()))\r\na.sort()\r\nb = a.copy()\r\nb.reverse()\r\nans = 0\r\nfor i in range(n):\r\n ans = (ans + a[i] * b[i]) % 10007\r\nprint(ans)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(int(input()))\r\nl.sort()\r\nr=l[:];\r\nr.reverse()\r\nres=0;\r\nfor i in range(n):\r\n res=(res+l[i]*r[i])%10007\r\nprint(res)", "A=[]\r\nfor _ in range(int(input())):\r\n A.append(int(input()))\r\nA=sorted(A)\r\nB=list(reversed(A))\r\ns=0\r\nfor _ in range(len(A)):\r\n s+=A[_]*B[_]\r\nprint(s%10007)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\ta.append(int(input()))\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n\tans+=a[i]*a[n-i-1]\r\nprint(ans%10007)", "n = int(input())\r\nl = []\r\nw = []\r\nc = 0\r\nfor i in range(n):\r\n a = int(input())\r\n l.append(a)\r\n w.append(a)\r\nl.sort()\r\nw.sort(reverse = True)\r\nfor i in range(n):\r\n c += l[i] * w[i]\r\nprint(c % 10007)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\ng = sorted([int(input()) for _ in range(n)])\r\nc = 0\r\nfor i in range(n):\r\n c += g[i] * g[n-1-i] % 10007\r\n if c >= 10007:\r\n c %= 10007\r\nprint(c)", "I=input\r\nn=int(I())\r\nR=list(range(n))\r\na=sorted(int(I())for _ in R)\r\nk=0\r\nfor i in R:k=(k+a[i]*a[n-i-1])%10007\r\nprint(k)", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nn=int(input())\nA=sorted(int(input())for _ in range(n))\nB=10007\ns=0\nfor i in range(n):s=(A[i]*A[-1-i]+s)%B\nprint(s)\n", "n = int(input())\r\na = sorted([int(input()) for i in range(n)])\r\n\r\ntime = 0\r\nfor i in range(n):\r\n time += a[i] * a[n - 1 - i]\r\n \r\nprint(time % 10007)\r\n", "n = int(input())\na = []\nfor _ in range(n):\n a.append(int(input()))\na = sorted(a)\nres = 0\nfor i in range(n):\n res = (res + a[i] * a[n - i - 1]) % 10007\nprint(res)\n", "n = int(input())\r\nA = [0] * n\r\nfor i in range(n):\r\n per = int(input())\r\n A[i] = per\r\nA.sort()\r\nanswer = 0\r\nfor i in range(n):\r\n answer = (answer + A[i] * A[n - i - 1]) % 10007\r\nprint(answer)", "mod = 10**4 + 7\r\nn = int(input())\r\nnn = n\r\nml = []\r\nwhile nn:\r\n nn -= 1\r\n ml.append(int(input()))\r\nml.sort()\r\nc = 0\r\nfor i in range(n):\r\n c += ml[i]*ml[n-1-i]\r\nprint(c % mod)\r\n", "import sys\nstr = sys.stdin.readline\nn = int(str())\ntasks = []\nfor i in range(n):\n tasks.append(int(str()))\n\ntasks.sort()\ntime = 0\nfor i in range(n//2):\n time+=(tasks[i]*tasks[-(i+1)]*2)\nif n%2==1:\n time+=(tasks[n//2]**2)\n\nprint(time%10007)\n\t \t\t \t\t \t \t\t \t\t \t\t \t \t \t", "n = int(input())\na = sorted(int(input()) for _ in range(n))\ns = 0\nfor i in range(n):\n\ts += a[i]*a[-i-1]\nprint(s % 10007)\n", "N = int(input())\r\nA = []\r\nfor i in range(N):\r\n A.append(int(input()))\r\n \r\nA.sort()\r\n\r\nans = 0;\r\nfor i in range(len(A)):\r\n ans += A[i] * A[len(A) - 1 - i]\r\n \r\nprint(ans % 10007)", "# ipnut\r\nn = int(input())\r\na = [int(input()) for i in range(n)]\r\ndivider = 10007\r\na.sort()\r\nres = 0\r\nfor i in range(n):\r\n res += a[i] * a[n - 1 - i]\r\n res %= divider\r\nprint(res)\r\n# sort\r\n# swap and count\r\n", "nums=[]\nfor i in range(int(input())):\n nums.append(int(input()))\nnums.sort()\nrnums=nums[::-1]\nproduct=0\nfor a,b in zip(rnums,nums):\n product+=a*b\nprint(product%10007)\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\nC = []\r\nA = [int(input()) for i in range(n)]\r\nA.sort()\r\nB = A\r\nfor x in range(n):\r\n C.append(A[x]*B[n-x-1])\r\na = sum(C)\r\nprint(a%10007)\r\n", "n = int(input())\narr = sorted([int(input()) for i in range(n)])\ns = 0\nfor i in range(n):\n s += arr[i] * arr[n - 1 - i]\nprint(s % 10007)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(int(input()))\r\na=sorted(a)\r\nsum=0\r\nfor j in range(n):\r\n sum = (sum + (a[j])*(a[n-j-1]))%10007\r\nprint(sum%10007)\r\n \r\n\r\n\r\n\r\n\r\n", "m=10007\r\nn=int(input())\r\nr=[int(input()) for _ in range(n)]\r\nr.sort()\r\nprint(sum(r[i]*r[n-i-1] for i in range(n))%m)", "from sys import stdin\n\ninput()\nl = sorted(map(int, stdin.read().splitlines()))\nprint(sum(a * b for a, b in zip(l, reversed(l))) % 10007)\n", "n = int(input())\r\ns1 = []\r\ns2 = []\r\nfor student in range(n):\r\n ye = int(input())\r\n s1.append(ye)\r\n s2.append(ye)\r\n\r\ns1.sort()\r\ns2.sort(reverse=True)\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n res += s1[i] * s2[i]\r\n\r\nprint(res%10007)", "n=int(input())\na=[0]*n\nfor i in range(0,n):\n a[i]=int(input())\na.sort()\nb=a.copy()\nb.sort(reverse=True)\ns=0\nfor i in range(0,n):\n s=s+a[i]*b[i]\n\nprint(s%10007)\n", "n, lst = int(input()), []\r\nfor i in range(n):lst.append(int(input()))\r\nlst.sort()\r\ndup, ans = list(lst)[::-1], 0\r\nfor i in range(n):ans += dup[i]*lst[i]\r\nprint(ans% 10007)" ]

[ "l = input().split(' ')\nx, y = int(l[0]), int(l[1])\nif y <= 0 and x >= 1 + y and x <= 1 - y:\n print((-y) * 4)\nelif x > 0 and y >= 2 - x and y <= x:\n print(x * 4 - 3)\nelif y > 0 and x >= -y and x <= y - 1:\n print(y * 4 - 2)\nelif x < 0 and y >= x and y <= -1 - x:\n print((-x) * 4 - 1)\nelse:\n print(0)\n \t\t \t \t \t \t \t\t\t\t\t\t \t \t\t\t", "\r\ndef solve():\r\n x,y = map(int, input().split())\r\n start = [0,0]\r\n turns = -1\r\n turn = 'x'\r\n i = 1\r\n while start != [x,y]:\r\n if turn == 'x':\r\n if i%2 == 0:\r\n start[0] -= i\r\n if start[1] == y and start[0] < x < start[0]+i:\r\n turns += 1\r\n break\r\n else:\r\n start[0] += i\r\n if start[1] == y and start[0]-i < x < start[0]:\r\n turns += 1\r\n break\r\n turns += 1\r\n turn = 'y'\r\n else:\r\n if i%2 == 0:\r\n start[1] -= i\r\n if start[0] == x and start[1] < y < start[1]+i:\r\n turns += 1\r\n break\r\n else:\r\n start[1] += i\r\n if start[0] == x and start[1]-i < y < start[1]:\r\n turns += 1\r\n break\r\n i += 1\r\n turns += 1\r\n turn = 'x'\r\n if turns > 0:\r\n print(turns)\r\n else:\r\n print(0)\r\n\r\nsolve()", "a, b = [int(i) for i in input().split()]\r\nx, y = 0, 0\r\nstep = 1\r\ncoords = []\r\nfor i in range(101):\r\n line1 = [(x, y), (x + step, y)]\r\n x += step\r\n line2 = [(x, y), (x, y + step)]\r\n y += step\r\n step += 1\r\n line3 = [(x, y), (x - step, y)]\r\n x -= step\r\n line4 = [(x, y), (x, y-step)]\r\n y -= step\r\n step += 1\r\n coords.append(line1)\r\n coords.append(line2)\r\n coords.append(line3)\r\n coords.append(line4)\r\n\r\nfor i in range(len(coords)):\r\n x = coords[i][0]\r\n y = coords[i][1]\r\n if x == (a, b) or y == (a, b):\r\n print(i)\r\n break\r\n elif x[0] == y[0] == a and max(x[1], y[1]) >= b >= min(x[1], y[1]):\r\n print(i)\r\n break\r\n elif x[1] == y[1] == b and max(x[0], y[0]) >= a >= min(x[0], y[0]):\r\n print(i)\r\n break\r\n", "x,y = map(int,input().strip().split())\r\n\r\nk = -x\r\n\r\nif -k<=y<=k-1:\r\n print(4*k-1)\r\n exit(0)\r\n\r\nk = -y\r\n\r\nif 1-k <= x <= 1+k:\r\n print(4*k)\r\n exit(0)\r\n\r\nk = x-1\r\n\r\nif 1-k <= y <= 1+k:\r\n print(4*k+1)\r\n exit(0)\r\n\r\nk = y-1\r\n\r\nif -(1+k) <= x <= k:\r\n print(4*k+2)\r\n exit(0)\r\n\r\nprint(0)", "x,y = map(int,input().split())\r\nif x==y==0:\r\n print (0)\r\nelif y>x and x >= -y:\r\n print (y*4-2)\r\nelif y>=x and x<-y:\r\n print (-1-4*x)\r\nelif y<x and x<=-y+1:\r\n print(-y*4)\r\nelse:\r\n print(x*4-3)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(1):#int(input())):\r\n x, y = map(int, input().split())\r\n if (x == 0 and y == 0):\r\n print(\"0\")\r\n elif (1 - x < y and y <= x):\r\n print(1+(x-1)*4)\r\n elif (-y <= x and x < y):\r\n print(2+(y-1)*4)\r\n elif (x <= y and y < -x):\r\n print(3+(-1-x)*4)\r\n else:\r\n print((-y)*4)\r\n" ]

[ "from sys import stdin, stdout\r\ninp = stdin.readline\r\npr = stdout.write\r\ndef f(sk, k):\r\n q, m = divmod(sk, k)\r\n for i in range(m):\r\n pr(str(q + 1) + ' ')\r\n for i in range(k - m):\r\n pr(str(q) + ' ')\r\nn, k, l, r, sa, sk = map(int, inp().split())\r\nf(sk, k)\r\nif n != k:\r\n f(sa - sk, n - k)", "def main():\r\n n, k, l, r, s_all, s_k = map(int, input().split())\r\n ans = []\r\n for i in range(k):\r\n if i < s_k % k:\r\n ans.append(s_k // k + 1)\r\n else:\r\n ans.append(s_k // k)\r\n s_r = s_all - s_k\r\n for i in range(n - k):\r\n if i < s_r % (n - k):\r\n ans.append(s_r // (n - k) + 1)\r\n else:\r\n ans.append(s_r // (n - k))\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\n\r\nn , k , l , r , st , sk = map(int,input().split())\r\n\r\nd = [0] * n\r\n\r\nrem_sum = st - sk\r\n\r\nfor i in range(k):\r\n d[i] = sk // k\r\n if (sk % k != 0):\r\n d[i] +=1\r\n sk -=1\r\n\r\nif (k != n):\r\n for i in range(k , n ):\r\n d[i] = rem_sum // (n - k)\r\n if (rem_sum % (n - k) != 0):\r\n d[i] +=1\r\n rem_sum -=1\r\n\r\nfor i in d :\r\n print(i , end = ' ')\r\n\r\n\r\n\r\n", "n , k , r , l , sa , sk = [int(x) for x in input().split()]\r\n\r\ni = 0\r\n\r\nx = int(sk / k)\r\ny = int(sk % k)\r\n\r\nfor i in range(y):\r\n print(x+1)\r\n\r\nfor i in range(k-y):\r\n print(x)\r\n\r\nif n-k != 0:\r\n x = int ((sa-sk)/(n-k))\r\n y = int ((sa-sk)%(n-k))\r\n\r\n for i in range(y):\r\n print(x+1)\r\n\r\n for i in range(n-k-y):\r\n print(x)", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nprint = sys.stdout.write\r\ninp = lambda: map(int, input().split())\r\n\r\n\r\n# ____________________ FUNCTIONS _________________________\r\ndef get_nums(num, total):\r\n return [total // num + 1 if i in range(total % num) else total // num for i in range(num)]\r\n\r\n\r\n# ____________________ START _____________________________\r\nn, k, l, r, sa, sk = inp()\r\nans = get_nums(k, sk) + get_nums(n - k, sa - sk)\r\nprint(' '.join(map(str, ans)))\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 n,k,l,r,s_all,s_k=get_ints()\r\n k_scores = [r] * k\r\n _sum = r * k\r\n i = 0\r\n while _sum != s_k:\r\n k_scores[i % k] -= 1\r\n _sum -= 1\r\n i += 1\r\n n_scores = [l] * (n - k)\r\n _sum = s_k + l * (n - k)\r\n i = 0\r\n while _sum != s_all:\r\n n_scores[i % (n - k)] += 1\r\n _sum += 1\r\n i += 1\r\n print(*k_scores, *n_scores)", "class CodeforcesTask369BSolution:\n def __init__(self):\n self.result = ''\n self.n_k_l_r_sa_sk = []\n\n def read_input(self):\n self.n_k_l_r_sa_sk = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n points = [self.n_k_l_r_sa_sk[2]] * self.n_k_l_r_sa_sk[0]\n score = self.n_k_l_r_sa_sk[2] * self.n_k_l_r_sa_sk[0]\n putin = self.n_k_l_r_sa_sk[5] - self.n_k_l_r_sa_sk[2] * self.n_k_l_r_sa_sk[1]\n pos = 0\n while putin:\n points[pos] += 1\n putin -= 1\n score += 1\n pos += 1\n if pos == self.n_k_l_r_sa_sk[1]:\n pos = 0\n rem = self.n_k_l_r_sa_sk[4] - score\n pos = self.n_k_l_r_sa_sk[1]\n while rem:\n points[pos] += 1\n rem -= 1\n pos += 1\n if pos == self.n_k_l_r_sa_sk[0]:\n pos = self.n_k_l_r_sa_sk[1]\n self.result = \" \".join([str(x) for x in points])\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask369BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def main():\r\n n, k, l, r,sall, sk = list(map(int, input().split())) \r\n sol = []\r\n remainder = sk % k\r\n for i in range(k):\r\n sol.append(sk // k + (remainder > 0))\r\n remainder = remainder - 1\r\n sall -= sk\r\n if (k != n):\r\n remainder = sall % (n - k)\r\n for i in range(n - k):\r\n sol.append(sall // (n - k) + (remainder > 0))\r\n remainder = remainder - 1\r\n print(*sol)\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n,k,l,r,sall,sk=list(map(int,input().split()))\r\n\r\nif r==l:\r\n print(' '.join([str(i) for i in [l]*n]))\r\nelse: \r\n avg=sk//k\r\n scores=[avg]*k+[0]*(n-k)\r\n i=0\r\n sall-=sk\r\n sk=sk%k\r\n while(sk!=0 ):\r\n if sk > r-scores[i]:\r\n sk-=r-scores[i]\r\n scores[i]+=(r-scores[i])\r\n else:\r\n scores[i]+=sk\r\n sk=0\r\n break\r\n i+=1\r\n \r\n for i in range(k,n):\r\n scores[i]=l\r\n sall-=l*(n-k)\r\n\r\n i=k\r\n while(sall!=0):\r\n if sall > scores[k-1]-scores[i]:\r\n sall-=scores[k-1]-scores[i]\r\n scores[i]+=(scores[k-1]-scores[i])\r\n else:\r\n scores[i]+=sall\r\n sall=0\r\n break\r\n i+=1 \r\n\r\n print(' '.join([str(i) for i in scores]))\r\n\r\n", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\nfrom math import ceil\r\n\r\ninput = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\n\r\ndef solve():\r\n n, k, l, r, all, sk = read()\r\n x = sk // k\r\n y = sk % k\r\n lst = [x + 1] * y + [x] * (k - y) + [l] * (n - k)\r\n s = all - sk - l * (n - k)\r\n i = k\r\n while s and i < n:\r\n s += lst[i]\r\n lst[i] = min(x, s)\r\n s -= lst[i]\r\n i += 1\r\n print(*lst)\r\n # for test in range(int(input())):\r\n\r\n\r\n# print(*list(map(\"\".join, solve())), sep='\\n')\r\nsolve()\r\n", "def p(n, s):\r\n if n == 0:\r\n return\r\n for i in range(s % n):\r\n print(s // n + 1, end=' ')\r\n for i in range(n - s % n):\r\n print(s // n, end=' ')\r\nn, k, l, r, sa, sk = map(int, input().split())\r\np(k, sk)\r\np(n - k, sa - sk)", "n,k,l,r,s_all,s_k=[int(i) for i in input().split()]\n# n,k,l,r,sall,sk=[int(i) for i in input().split()]\n# l<=points<=r\n# sum of points = sall\n# sk = total of k high scores\n\n#First k scores\nk_scores=[r]*k\n_sum=r*k\ni=0\nwhile _sum!=s_k:\n\tk_scores[i%k]-=1\n\t_sum-=1\n\ti+=1\n\n#Other scores in n\nn_scores=[l]*(n-k)\n_sum=s_k + l*(n-k)\ni=0\nwhile _sum!=s_all:\n\tn_scores[i%(n-k)]+=1\n\t_sum+=1\n\ti+=1\n\nprint(*k_scores, *n_scores, sep=' ')\n\t\t\t \t \t \t \t\t \t \t\t\t \t", "def get_nums(num, t):\r\n return [t // num + 1 if i in range(t % num) else t // num for i in range(num)]\r\n\r\n\r\nn, k, l, r, sa, sk = map(int, input().split())\r\nans = get_nums(k, sk) + get_nums(n - k, sa - sk)\r\nprint(' '.join(map(str, ans)))\r\n", "l1=list(map(int,input().rstrip().split()))\nn=l1[0]\nk=l1[1]\nl=l1[2]\nr=l1[3]\nsall=l1[4]\nsk=l1[5]\nres=[]\nrem1=sk%k\nq1=sk//k\n# print(rem1)\nfor i in range(k):\n res.append(q1+min(1,max(0,rem1)))\n rem1-=1\nsr=sall-sk\nre=n-k\nif re!=0:\n rem1=sr%re\n q1=sr//re\n\n for i in range(re):\n res.append(q1+min(1,max(0,rem1)))\n rem1-=1\n\n\nfor x in res:\n print(x,end=\" \")\n\n \t\t \t\t \t\t \t \t \t \t\t \t \t", "n, k, le, r, sa, sk = map(int, input().split())\r\ncur = sa - sk\r\nl = [0] * n\r\nfor i in range(k):\r\n l[i] = sk // k\r\n if sk % k != 0:\r\n l[i] += 1\r\n sk -= 1\r\n\r\nif k != n:\r\n for i in range(k, n):\r\n l[i] = cur // (n - k)\r\n if cur % (n - k) != 0:\r\n l[i] += 1\r\n cur -= 1\r\n\r\nd = True\r\n\r\nfor i in range(k):\r\n if l[i] < le or l[i] > r:\r\n d = False\r\n for j in range(k, n):\r\n if l[j] > l[i]:\r\n d = False\r\n if l[j] < le or l[j] > r:\r\n d = False\r\n\r\nfor i in l:\r\n print(i, end = \" \")\r\n", "n,k,l,r,sa,sk = map(int, input().split())\r\na = [sk//k]*k\r\ns = sk%k\r\nfor i in range(1,s+1):\r\n a[i-1] += 1\r\nif n!=k:\r\n a += [(sa-sk)//(n-k)]*(n-k)\r\n s = (sa-sk)%(n-k)\r\n for i in range(1,s+1):\r\n a[i+k-1] += 1\r\nprint(*a)", "import math\r\nn, k, l, r, sall, sk= map(int, input().split())\r\ninitialPoints=math.floor(sk/k)\r\nresidue=sk%k\r\nfinalPoints=0\r\nteam=[]\r\nwhile n>0:\r\n if k>0:\r\n if sk>=initialPoints and residue>0:\r\n team.append(initialPoints+1)\r\n sall-=(initialPoints+1)\r\n residue-=1\r\n k-=1\r\n n-=1\r\n else:\r\n team.append(initialPoints)\r\n sall-=(initialPoints)\r\n k-=1\r\n n-=1\r\n else:\r\n finalPoints=math.floor(sall/n)\r\n if sall>=finalPoints:\r\n team.append(finalPoints)\r\n sall-=finalPoints\r\n n-=1\r\n else:\r\n team.append(sall%n)\r\n sall-=(sall&n)\r\n n-=1\r\nprint(\" \".join(str(i) for i in team))", "def fun(m, t):\r\n return [t // m + 1 if i in range(t % m) else t // m for i in range(m)]\r\n\r\n\r\nn, k, l, r, sa, sk = map(int, input().split())\r\nprint(' '.join(map(str, fun(k, sk) + fun(n - k, sa - sk))))\r\n", "from re import X\r\nfrom sys import stdin\r\nimport math\r\n\r\ndef get_data(n,k,r,l,al,sub):\r\n total_sum = al- sub\r\n fin = k\r\n order = []\r\n for cont in range(fin):\r\n to = math.ceil(sub/k)\r\n sub-=to\r\n k-=1\r\n order.append(to)\r\n fin = n - fin\r\n n = fin\r\n for cont in range(fin):\r\n to = math.ceil(total_sum/n)\r\n total_sum -= to\r\n n -= 1\r\n order.append(to)\r\n return order\r\n\r\n\r\ndef main():\r\n [n,k,r,l,al,sub] = [int(x) for x in stdin.readline().split()]\r\n order = get_data(n,k,r,l,al,sub)\r\n for o in order:\r\n print(o,end= ' ');\r\n\r\nmain()", "def f(n, m):\r\n if not n: \r\n return []\r\n b = [m // n] * n\r\n for i in range(m % n):\r\n b[i] += 1\r\n return b\r\narr = list(map(int, input().split()))\r\nres = f(arr[1], arr[5]) + f(arr[0] - arr[1], arr[4] - arr[5])\r\nprint (*res)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n\r\n\r\ndef solve():\r\n n, k, l, r, s_all, s_k = read_tuple(int)\r\n # first k\r\n a = [r for _ in range(k)]\r\n _sum = r * k\r\n i = 0\r\n while _sum != s_k:\r\n a[i % k] -= 1\r\n _sum -= 1\r\n i += 1\r\n # other\r\n b = [l for _ in range(n - k)]\r\n _sum = s_k + l * (n - k)\r\n i = 0\r\n while _sum != s_all:\r\n b[i % (n - k)] += 1\r\n _sum += 1\r\n i += 1\r\n print(' '.join((str(i) for i in (a + b))))\r\n\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n ", "n,k,l,r,s,sk = input().split()\r\nn=int(n)\r\nk=int(k)\r\nl=int(l)\r\nr=int(r)\r\ns=int(s)\r\nsk=int(sk)\r\na=[]\r\nfor i in range(n):\r\n a.append(0)\r\nq=sk//k\r\np=sk%k\r\ns3=0\r\nfor i in range(k):\r\n a[i]=q\r\n s3+=a[i]\r\ni=0\r\nwhile(p!=0):\r\n if(r-a[i]<=p):\r\n s3+=r-a[i]\r\n p=p-(r-a[i])\r\n a[i]=r\r\n else:\r\n a[i]+=p\r\n s3+=p\r\n break\r\n i+=1\r\nr=a[k-1]\r\ns=s-sk\r\nif(n!=k):\r\n q=s//(n-k)\r\n p=s%(n-k)\r\n for i in range(k,n):\r\n a[i]=q\r\n i=k\r\n while(p!=0):\r\n if(r-a[i]<=p):\r\n p=p-(r-a[i])\r\n a[i]=r\r\n else:\r\n a[i]+=p\r\n break\r\n i+=1\r\nfor i in range(n):\r\n print(a[i])\r\n", "__author__ = 'asmn'\r\nn, k, l, r, sa, sk = tuple(map(int, input().split()))\r\n\r\nsa -= sk\r\nn -= k\r\n\r\n\r\ndef part(s, n):\r\n if n == 0:\r\n return []\r\n return [s // n + 1] * (s % n) + [s // n] * (n - s % n)\r\n\r\n\r\nprint(' '.join(map(str, part(sk, k) + part(sa, n))))", "import math\r\nn,k,l,r,sall,sk = map(int,input().split())\r\nosk,ok = sk,k\r\nlst = []\r\nwhile k:\r\n x = math.ceil(sk/k)\r\n lst.append(x)\r\n k -= 1\r\n sk -= x\r\nv = n-ok\r\nsall -= osk\r\nwhile v:\r\n x = math.ceil(sall/v)\r\n lst.append(x)\r\n v -= 1\r\n sall -= x\r\nprint(*lst)", "# -*- coding: utf-8 -*-\r\n\r\nn, k, l, r, s_all, s_k = map(int, input().split())\r\n\r\nk_avg = s_k // k\r\nk_rem = s_k % k\r\nprint(' '.join([str(k_avg+1)]*k_rem + [str(k_avg)]*(k-k_rem)), end='')\r\n\r\nif k < n:\r\n e_avg = (s_all - s_k) // (n-k)\r\n e_rem = (s_all - s_k) % (n-k)\r\n print('', ' '.join([str(e_avg+1)]*e_rem + [str(e_avg)]*(n-k-e_rem)))\r\n", "n,k,l,r,sa,sk=map(int,input().split())\r\nf=sk//k \r\nz=sk%k \r\nif z!=0:\r\n m=r-f \r\n cnt=(z//m)\r\n rem=(z%m)\r\n li=[r]*cnt \r\n li+=[f+rem]\r\n li+=[f]*(k-(cnt+1))\r\nelse:\r\n li=[f]*k\r\nr=f \r\nlik=[]\r\nki=n-k\r\nif ki!=0:\r\n ski=sa-sk\r\n f=ski//ki\r\n z=ski%ki\r\n if z!=0:\r\n m=r-f\r\n cnt=(z//m)\r\n rem=(z%m)\r\n lik=[r]*cnt \r\n lik+=[f+rem]\r\n lik+=[f]*(ki-(cnt+1))\r\n else:\r\n lik=[f]*ki\r\nprint(*(li+lik))\r\n ", "import math\r\ndef solve(n,k,l,r,s,d):\r\n res=[]\r\n a=k\r\n s=s-d\r\n for i in range(a):\r\n x=math.ceil(d/k)\r\n d-=x\r\n k-=1\r\n res.append(x)\r\n a=n-a\r\n n=a\r\n \r\n for i in range(a):\r\n x=math.ceil(s/n)\r\n s-=x\r\n n-=1\r\n res.append(x)\r\n print(*res)\r\n \r\n \r\nn,k,l,r,s,d=map(int,input().split())\r\n# n,k=map(int,input().split())\r\nsolve(n,k,l,r,s,d)", "n, k, l, r, sa, sk = map(int, input().split())\r\nprint(' '.join(map(str, [sk // k + 1 if i in range(sk % k) else sk // k for i in range(k)] + [(sa - sk) // (n - k) + 1 if i in range((sa - sk) % (n - k)) else (sa - sk) // (n - k) for i in range((n - k))])))\r\n", "n,k,l,r,sa,s=map(int,input().split())\r\nrm=s%k\r\nprint((( (str(s//k)) +' ' )*(k-rm))+((str((s//k)+1)+' ')*rm),end='') \r\nif sa !=s: \r\n re=sa-s\r\n z2=re%(n-k)\r\n print(((str(re//(n-k))+' ')*(n-k-z2))+((str((re//(n-k))+1)+' ')*z2))\r\n", "n, k, l, r, s_all, s_k = map(int, input().split())\r\ngroup = lambda s, n: [(s // n) + 1] * (s % n) + [s // n] * (n - s % n) if n > 0 else []\r\nprint(' '.join(map(str, group(s_k, k) + group(s_all - s_k, n - k))))", "n,k,l,r,sa,sk = map(int,input().split())\r\nans = [0]*n\r\nd,y = divmod(sk,k)\r\nfor i in range(y):\r\n ans[i] = d+1\r\nfor i in range(y,k):\r\n ans[i] = d\r\nsd = sa-sk\r\nif n==k:\r\n print(*ans)\r\n exit()\r\nelse:\r\n d,y = divmod(sd,n-k)\r\n for i in range(k,k+y):\r\n ans[i] = d+1\r\n for i in range(k+y,n):\r\n ans[i]= d\r\n print(*ans)", "import copy\r\nn, k, l, r, sall, sk = map(int, input().split())\r\n\r\n# Step 1: Initialize scores with minimum possible score l\r\nscores = []\r\nfor i in range(n):\r\n scores.append(l)\r\n\r\nremaining_score = sall - sk\r\nif n-k != 0:\r\n smaller = (sall-sk)//(n-k)\r\n remain = (sall-sk)%(n-k)\r\n min_possible = (sall-sk)//(n-k)\r\n if remain:\r\n min_possible += 1\r\n #print(remain)\r\n for i in range(k,n):\r\n scores[i] = smaller\r\n if remain:\r\n remain -=1\r\n scores[i] += 1\r\n #print(sum(scores[k:]),scores[-1])\r\n for i in range(k):\r\n scores[i] = min_possible\r\n present_sum = sum(scores[:k])\r\n remaining = sk - present_sum\r\n distri = remaining//k\r\n remain = remaining%k\r\n #print(scores,distri,remain)\r\n for i in range(k):\r\n scores[i] += distri\r\n if remain:\r\n remain -= 1\r\n scores[i] += 1\r\nelse:\r\n smaller = sall//n\r\n remain = sall%n\r\n for i in range(n):\r\n scores[i] = smaller\r\n if remain:\r\n remain -=1\r\n scores[i] += 1\r\nfor i in range(n):\r\n print(scores[i],end = ' ')\r\n\r\n#print(sum(scores),sum(scores[:k]),sum(scores[k:]))\r\n\r\n", "n,k,l,r,a,b=map(int,input().split())\r\narr=[0]*n\r\np=b%k\r\nfor i in range(k):\r\n arr[i]+=b//k\r\n if p>0:\r\n arr[i]+=1\r\n p-=1\r\na-=b\r\nl=k\r\nif k!=n:\r\n \r\n k=n-k\r\n p=a%k\r\n for i in range(l,n):\r\n arr[i]+=a//k\r\n if p>0:\r\n arr[i]+=1\r\n p-=1\r\nprint(*arr)", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\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\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, 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,k,l,r,sall,sk = ilele()\r\nAns = [l]*n\r\n\r\ndef fun(tempk,ss,a,b):\r\n while True:\r\n for i in range(a,b):\r\n if tempk + 1 <= ss and Ans[i] + 1 <= r:\r\n Ans[i] += 1\r\n tempk +=1\r\n if tempk == ss:\r\n return\r\n\r\nfun(k*l,sk,0,k)\r\nfun(sum(Ans),sall,k,n)\r\nprint(*Ans)\r\n", "n,k,l,r,Sa,Sk = list(map(int,input().split()))\r\n\r\nif n == k :\r\n\tRq = Sa - n*l\r\n\tp = Rq//n\r\n\tr = Rq%n\r\n\tt = [(l+p+1) for i in range(r)] + [l+p for i in range(n-r)]\r\n\tprint(*t,sep = ' ')\r\nelse :\r\n\tSq = Sa -Sk\r\n\tRq = Sq - (n-k)*l\r\n\tp = Rq//(n-k)\r\n\tr = Rq%(n-k)\r\n\tt = [(l+p+1) for i in range(r)] + [l+p for i in range(n-k-r)]\r\n\tMin = t[n-k-1]\r\n\tp2 = ( Sk-(Min*k) )//k\r\n\tr2 = ( Sk-(Min*k) )%k\r\n\r\n\tt2 = [(Min+p2+1) for i in range(r2)] + [Min+p2 for i in range(k-r2)]\r\n\r\n\tprint(*(t2+t) ,sep =' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]

[ "# cook your dish here\r\nn,a,b = input().split()\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\ncount = 0\r\nfor i in range(1,n+1):\r\n if i>a and n-i<=b:\r\n count = count + 1\r\nprint(count)", "def pos(n,f,d):\r\n return n-max(f+1,n-b)+1;\r\nn,f,b=map(int,input().split(' '))\r\nprint(pos(n,f,b))", "x=list(map(int,input().split()))\r\ng=x[0]-x[1]\r\nh=x[2]+1\r\nprint(min(g,h))", "import math\r\nimport collections\r\ncur=0\r\nn,a,b=map(int,input().split())\r\nres=0\r\nfor i in range(n):\r\n if i+1>a and i+1>=(n-b):\r\n res+=1\r\nprint(res)", "n,a,b = list(map(int, input ().split()))\r\ns = set(range(1,n+1))\r\nsa = set(range(a+1,n+1))\r\nsb = set(range(n-b,n+1))\r\nprint(len(sa.intersection(sb)))", "n,a,b = map(int,input().split())\r\nprint(n-a if n-a < b+1 else b+1)\r\n", "n,a,b=map(int,input().split())\r\ns=n-a\r\nif(s>b):\r\n s=b+1\r\nprint(s)", "\nn, a, b=map(int, input().split())\n\nposition=min(n-a, b+1 )\n\nprint(position)", "s=input().split()\r\namount=int(s[0])\r\nfront=int(s[1])\r\nbehind=int(s[2])\r\npos=(amount-front)\r\nif pos>1+behind:\r\n print(behind+1)\r\nelse:\r\n print(pos)\r\n\r\n", "s = input()\r\nx = s.split(' ')\r\nn, a, b = int(x[0]), int(x[1]), int(x[2])\r\nprint(n-a if n-a < b+1 else b+1)\r\n", "(n,a,b) = map(int, input().split())\r\n\r\nn -= a\r\n\r\nif n > b+1:\r\n n = b+1\r\nelif n < 0:\r\n n = 0\r\n\r\nprint(n)", "arr = list(map(int, input().rstrip().split()))\r\nn=arr[0]\r\na=arr[1]\r\nb=arr[2]\r\nprint(min(b+1,n-a))", "n,a,b = [int(x) for x in input().split(\" \")] \r\nl=n-a\r\nm=b+1\r\nif l<m:\r\n print(l)\r\nelse:\r\n print(m)", "n,l,r=map(int,input().split())\r\nprint(min(n-l,r+1))", "n,a,b = input().split()\r\n\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\n\r\nif (a+b<n):\r\n \r\n ans = b+1\r\nelif(a+b==n):\r\n ans = b\r\nelif(a+b>n):\r\n ans = n-a\r\nprint(ans)\r\n", "n, a, b = map(int, input().split())\r\npos = 0\r\nfor i in range(1, n+1):\r\n if (i - 1) >= a and (n - i) <= b:\r\n pos += 1\r\nprint(pos)", "n, a, b = list(map(int, input().split()))\n\nans = min(n - a, b + 1)\n\nprint(ans)\n \t \t \t \t \t \t \t\t\t\t \t", "n,a,b=map(int,input().split())\r\nc=0\r\nfor i in range(1,n+1):\r\n if i>a and n-i<=b:\r\n c+=1\r\n\r\nprint(c)", "# author: violist\n# created: 30.08.2021 14:39:07\n\nimport sys\ninput = sys.stdin.readline\n\nn, a, b = map(int, input().split())\nfront = n - a\nbehind = b + 1\nprint(min(front, behind))\n", "n,a,b = map(int, input().split())\r\nmaxPlaces = n-a\r\nfor i in range(a+1,n+1,1):\r\n if i+b >= n:\r\n print(maxPlaces)\r\n break\r\n else:\r\n maxPlaces = maxPlaces-1\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\n\r\nfor _ in range(1):\r\n n, a, b = map(int, input().split())\r\n print(n - max(a+1, n-b) + 1)", "s = input().split()\r\nn,a,b = int(s[0]), int(s[1]), int(s[2])\r\n\r\nprint(min(n-a,b+1))", "# from sys import stdin, stdout\r\n\r\n# import re\r\n# import string\r\n\r\n# import math\r\n# import statistics\r\n# import itertools\r\n# import collections\r\n# import cmath\r\n# import calendar\r\n# import datetime\r\n\r\n# import operator\r\n\r\n#----------Profiling----------\r\n# import cProfile\r\n# import pstats\r\n\r\nn, a, b = map(int, input().split())\r\nprint(n - max(a+1, n-b) + 1)\r\n\r\n", "n, a, b = map(int, input().split())\r\nt = 0\r\n\r\nf = False\r\nfor i in range(1, n + 1):\r\n if i - a - 1 >= 0 and n - i <= b:\r\n t += 1\r\n f = True\r\n elif f:\r\n break\r\n\r\nprint(t)", "n, a, b = map(int, input().split())\r\natleast = set(range(a + 1, n + 1))\r\natmost = set(range(n - b, n + 1))\r\nprint(len(atleast & atmost))\r\n", "n,a,b=map(int,input().split())\r\nif (a+b+1>n):\r\n print(n-a)\r\nelse:\r\n print(b+1)\r\n", "n,a,b = map(int,input().split())\ncount= 0 \nfor i in range(n):\n front = i\n behind=n-1-i\n if (front>=a) & (behind<=b):\n count+=1\nprint(count)\n", "n,a,b=list(map(int,input().split()))\r\nprint(min(b+1,n-a))", "n, m, k = [int(x) for x in input().split()]\r\nres = 0\r\nfor i in range(n):\r\n if (m <= i) and ((n-i-1) <= k):\r\n res += 1\r\nprint(res)", "n,a,b=map(int,input().split())\r\nif(a+b>=(n-1)):\r\n print(n-a)\r\nelse:\r\n c=n-a-((n-1)-(a+b))\r\n print(c)", "n, a, b = map(int, input().split())\r\nlowerBound = max(a + 1, n - b)\r\nprint(n+1 - lowerBound)", "n, a, b = map(int, input().split(\" \"))\r\nprint(min(b+1,n-a))", "n, x, y = map(int, input().split())\n\nspots = min(n - x, y + 1)\n\nprint(spots)\n\n \t\t\t \t\t \t \t\t\t \t\t\t \t \t\t\t \t\t", "from math import*\r\nn,a,b=list(map(int,input().split()))\r\nif a+b>n-1:print(n-a)\r\nelse:\r\n print(b+1)", "n,a,b=map(int,input().split())\r\ns= n-max(a+1,n-b)+1\r\nprint(s)", "\"\"\"\r\nAlready submitted, writing documentation\r\nLogic:\r\n1. Find out minimum position from a. This means Petyr's position can't be lesser than this.\r\n2. Find out minimum position from b, Petyr's position can also not be lesser than this.\r\n3. Find out maximum of those 2, since Petyr can have more in front of him, but can't have more from back of him.\r\n4. This will give you Petyr's starting position.\r\n5. n - this position will give you number of other positions Petyr can occupy.\r\n6. add one to this, to include initial position and print it out .\r\n\"\"\"\r\n\r\n\r\nn, a, b = list(map(int, input().rstrip().split()))\r\nmin_pos_from_a = a + 1\r\nmin_pos_from_b = n - b\r\nstarting_pos = max(min_pos_from_a, min_pos_from_b)\r\nprint(n - starting_pos + 1)\r\n", "import sys \r\ninput = sys.stdin.readline \r\nfrom collections import Counter\r\ndef instr():\r\n return input()[:-1]\r\nn, a, b = map(int, input().split())\r\nprint(min(n- a, b+1))", "def array(n,a,b):\r\n mn=min(n-a,b+1)\r\n print(mn)\r\nn,a,b=map(int,input().split())\r\narray(n,a,b)", "x=list(map(int,input().split()))\r\nn,m,l=x[0],x[1],x[2]\r\nc=0\r\nfor i in range(n-(n-m),n):\r\n if n-i-1<=l:\r\n c=c+1\r\nprint(c)\r\n", "from sys import stdin\n\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return list(map(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\nMULTIPLE_CASES = 0\n\ndef main():\n N,A,B = rl(int)\n print(N-max(A,N-B-1))\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "n, a, b = map(int, input().split())\r\n\r\nif a + 1 > n - b:\r\n print(n-a)\r\nelse:\r\n print(n-n+b+1)", "n, a, b = (int(i) for i in input().split())\n# -> b- Petr a+\n# [a; n]\n# [0; b]\nres = min(n - a, b + 1)\nprint(res)\n", "def main():\r\n n, a, b = map(int, input().split())\r\n\r\n back = 0\r\n front = n - 1\r\n ans = 0\r\n\r\n while back < n:\r\n if back >= a and front <= b:\r\n ans += 1\r\n back += 1\r\n front -= 1\r\n\r\n print(ans)\r\nmain()", "\nimport sys\n\n\n[n, a, b] = map(int,sys.stdin.readline().strip().split(\" \"))\n# a or more in front of him\n# b or less behind him\n# n people\n\n# n-a spots allowed by a\n# b+1 spots allowed by b\n# min of these is allowed\nprint(min(n-a,b+1))\n\n", "a,b,c=map(int,input().split())\r\nk=0\r\ns=[]\r\nwhile a>b and k<=c:\r\n s.extend([a,k])\r\n k+=1\r\n a-=1\r\nprint(len(s)//2)", "n, a, b = list(map(int, input().split()))\r\nans = 0 \r\nfor i in range(1, n + 1):\r\n front_people = n - i\r\n back_people = i - 1\r\n if back_people <= b and front_people >= a:\r\n ans += 1\r\nprint(ans)\r\n ", "n,a,b = map(int, input().split())\r\nif n-a > b:\r\n while n-a > b:\r\n a+=1\r\n print(n-a+1)\r\nelse:\r\n print(n-a)", "n,a,b = map(int,input().split())\r\nk = max(1+a,n-b)\r\nprint(n-k+1)", "n,a,b = map(int,input().split())\r\n\r\nmaxPos = n - a\r\nmaxPosForB = b+1\r\nprint(min(n-a,b+1))", "n,a,b=map(int, input().split())\r\nx=n-a\r\nif b==0:\r\n print(1)\r\nelif x<=b:\r\n print(x)\r\nelse:\r\n print(b+1)", "n,a,b=[int(i) for i in input().split()]\r\nprint(min([n-a,b+1]))", "A=list(map(int, input().split()))\r\nn=A[0]\r\na=A[1]\r\nb=A[2]\r\ns=a+1\r\nwhile n-s>b:\r\n s+=1\r\nprint(n-s+1)", "\nn = list(map(int,input().split()))\n\n\n\nans=1\n\nwhile n[2] != 0:\n if n[2]+n[1] >= n[0]:\n n[2]-=1\n else:\n n[2] -=1\n ans+=1\nprint(ans)\n", "n,a,b=map(int,input().split())\r\ns=0\r\n\r\nwhile b>=0:\r\n if a+1+b<=n:\r\n s+=1\r\n b-=1\r\n\r\nprint(s)\r\n", "n,a,b = map(int,input().split())\r\n#no more than b behind, no less than a front\r\n#possible positions\r\nres = 0\r\nfor i in range(1,n+1):\r\n if i>a and n-i<=b:\r\n res+=1\r\nprint(res)", "n,a,b = [int(x) for x in input().split()]\r\nprint(n-max(n-b-1,a))\r\n", "def num(m,x,y):\r\n return min(m-x,y+1)\r\n\r\ns=input().strip().split()\r\nn=int(s[0])\r\na=int(s[1])\r\nb=int(s[2])\r\nprint(num(n,a,b))", "n, a, b = map(int,input().split())\r\nprint(min(n-a, b+1))", "if __name__ == '__main__':\r\n n, a, b = map(int, input().split())\r\n count = int(0)\r\n for i in range(1, n + 1):\r\n if i >= a + 1 and i >= n - b:\r\n count += 1\r\n print(count)", "n,a,b=[int(x) for x in input().split()]\r\nl=list(range(1,n+1))\r\nfront=set(l[a:])\r\nres=0\r\nbehind=set(l[n-b-1:])\r\nif front & behind:\r\n res=len(front & behind)\r\n\r\nprint(res)", "def main() -> int:\r\n n, a, b = (int(x) for x in input().split())\r\n left = n - a\r\n right = b + 1\r\n return right if right < left else left\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, a, b = map(int, input().split())\r\nif a+b < n:\r\n print(b+1)\r\nelif a+b == n:\r\n print(b)\r\nelif a+b > n:\r\n print(n-a)\r\nelse:\r\n print(1)\r\n", "a = list(map(int,input().split(\" \")))\r\nprint(min(a[0]-a[1],a[2]+1))\r\n \r\n \r\n\r\n", "n, a, b = map(int, input().split())\n\n# Each position in line can be considered as a potential value of k\n# We iterate over all such values and keep count of the number of valid positions\ncount = 0\nfor k in range(1, n + 1):\n if k - 1 >= a and n - k <= b:\n count += 1\n\nprint(count)\n \t\t \t \t\t\t\t \t\t\t \t \t \t\t \t\t\t\t", "n,a, b = map(int,input().split())\r\nprint(min(n - a, b + 1))", "# The number of positions\r\nn,a,b=map(int,input().split())\r\nif n==a+b:\r\n print(b)\r\nelif n-a>b:\r\n print(b+1)\r\nelif n-a<b:\r\n print(n-a)", "n,a,b = [int(x) for x in input().split()]\r\n\r\narr = [True]*(n+1)\r\nfor i in range(a+1):\r\n arr[i] = True\r\n\r\nfor i in range(a+1,n+1):\r\n if n-i <= b:\r\n arr[i] = False\r\n\r\n# print(arr)\r\n\r\ntotal = arr.count(False)\r\nprint(total)\r\n", "n,a,b=map(int,input().split())\r\nc=0\r\nfor i in range(b+1):\r\n if n-(i+1)>=a:\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "n, a, b = list(map(int, input().split()))\r\nif a + b >= n:\r\n print(n - a)\r\nelse:\r\n print(b + 1)", "a, b, c = map(int, input().split())\r\nprint(min(a-b, c+1))", "n , a ,b = [int(x) for x in input().split()]\r\nprint(min([n-a,b+1]))", "(n,a,b)=map(int,input().split(' '))\r\nif n>a+b and n-a>b:\r\n print(b+1)\r\nelse:\r\n print(n-a)\r\n\r\n", "n, a, b = map(int, input().split())\r\ntotal = 0\r\nfor i in range(n):\r\n if i >= a and n-(i+1) <= b:\r\n total += 1\r\nprint(total)", "# Problem Statement - https://codeforces.com/problemset/problem/124/A\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nvalue = max(a+1, n-b)\r\nvalue = n - value + 1\r\n\r\nprint(value)", "n, a, b = list(map(int, input().split()))\r\nc = n-max(a+1,n-b)+1\r\nprint(c)", "import math\r\n\r\n# t = int(input())\r\n# while(t>0):\r\n# \tt-=1\r\n\r\ninp = input()\r\n\r\nq = list(map(int , inp.split(\" \")))\r\n\r\nn = q[0]\r\na = q[1]\r\nb = q[2]\r\nans = 0\r\nif(b+1>(n-a)):\r\n\tans = n-a\r\nelse:\r\n\tans = b+1\t\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", "n,a,b=[int(x)for x in input().split(' ')]\nprint(min(n-a,b+1))", "n,a,b = map(int,input().split())\r\nprint((n+1) - max(a+1,n-b))\r\n", "n,a,b= map(int,input(\"\").split())\r\ndef findPosition (n,a,b):\r\n return n-max(a+1,n-b)+1\r\nprint(findPosition(n,a,b))", "q, w, e = map(int, input().split())\r\nr = 0\r\nif w + e + 1 < q:\r\n r += q - (w + e + 1)\r\nprint(q - w - r)", "n,a,b=map(int,input().split())\r\ncount=0\r\nfor i in range(a+1,n+1):\r\n if(i+b>=n):\r\n # print(i)\r\n count+=1\r\nprint(count)", "n,a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(b+1):\r\n x=n-i-1\r\n if x>=a:\r\n l.append(x)\r\n else:\r\n continue\r\n \r\nprint(len(l))", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tn, a, b = map(int, input().split())\r\n\r\n\t\tprint(min(n-a, b+1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "n,a,b=input().split()\r\nn,a,b=int(n),int(a),int(b)\r\nlsta=[]\r\nlstb=[]\r\nfor i in range(a,n):\r\n lsta.append(n-1-i)\r\nfor i in range(b,-1,-1):\r\n lstb.append(i)\r\n\r\ncount=0\r\nfor i in lsta :\r\n if i in lstb:\r\n count+=1\r\nprint(count)\r\n", "n,p,k=map(int,input().split(\" \"))\r\na=(n+1)-max(p+1,n-k)\r\nprint(a)\r\n", "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,a,b = get_ints()\r\nprint(min(n-a,b+1))", "n,a,b = map(int,input().split())\r\n\r\nt = n - a\r\n\r\nprint(min(t, b+1))\r\n", "d = [int(i) for i in input().split()]\r\nif d[0]-d[1] < 1+d[2]:\r\n print(d[0]-d[1])\r\nelse:\r\n print(1+ d[2])", "a=[int(i) for i in input().split()]\r\nprint(min(a[0]-a[1],1+a[2]))", "\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 t():\r\n n, a, b = map(int, input().split())\r\n # front -- atleast a people\r\n #mid - me\r\n # back -- atmost b people\r\n if a + b == n:\r\n mid = a + 1\r\n back = n - (a + 1)\r\n else:\r\n mid = n - (a + b)\r\n back = n - mid\r\n ans = 0\r\n\r\n for i in range(mid, n + 1):\r\n front = i - 1\r\n back = n - i\r\n # print(front, i, back)\r\n if front >= a and back <= b:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nt()\r\n", "n,a,b=[int(x) for x in input().split()]\r\nl=[1 for x in range(1,n+1) if a<x and x>=n-b]\r\nprint(len(l))", "n, a, b = map(int, input().split())\r\nx = a + 1\r\ny = n - b\r\nprint(n - max(x, y) + 1)\r\n \r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Dec 30 18:51:19 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\ns = input()\r\ns = s.split()\r\nn = int(s[0])\r\na = int(s[1])\r\nb = int(s[2])\r\n\r\np=0\r\nfor x in range(n):\r\n if (n-x-1)>=0 and (n-x-1)<= b:\r\n if (n-x-1)<=(n-a-1):\r\n p+=1\r\nprint(p)\r\n \r\n", "n,a,b=[int(i) for i in input().split()]\r\nprint(n-max(a+1,n-b)+1)", "c = list(map(int,input().split()))\r\nf = 0\r\nd = c[1]\r\nfor i in range(d+1,c[0]+1):\r\n if i+c[2]>=c[0]:\r\n f = f + 1\r\nprint(f)", "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\ndef solve():\r\n pass\r\n\r\n# for _ in range(int(input())):\r\nn,a,b = get_int()\r\nif a+b < n:\r\n print(n-a-(n-(a+b)-1))\r\nelse:\r\n print(n-a)\r\n", "n,a,b=[int(x) for x in input().split()]\r\nc=n-(a+b)\r\nif c>0:\r\n print(b+1)\r\nif c==0:\r\n print(b)\r\nif c<0:\r\n print(n-a)", "n, a, b = list(map(int, input().split()))\r\n\r\ncount = 0\r\ni = 1\r\nwhile i <= n:\r\n if i-1 >= a and n-i<=b:\r\n count += 1\r\n i += 1\r\n\r\nprint(count)", "x=list(input(\"\").split(\" \"))\r\ny=int(x[0])-int(x[1])\r\nif int(x[2])+1<=y:\r\n print(int(x[2])+1)\r\nelse:\r\n print(y)\r\n", "#Coder_1_neel\r\na,b,c=map(int,input().split())\r\nx=a-b\r\ny=c+1\r\nprint(min(x,y,a))\r\n", "n,a,b=input(\"\").split()\r\nn=int(n)\r\na=int(a)\r\nb=int(b)\r\nprint(min(n-a,b+1))", "N, A, B = map(int, input().split())\nprint(min(N-A, B+1))\n", "x=list(map(int,input().split()))\r\nprint(min(x[2]+1,x[0]-x[1]))", "p, a, b =map(int, input().split())\r\n\r\nif p- a > b:\r\n print(b+ 1)\r\nif p - a == b:\r\n print(b)\r\n\r\nif p - a < b:\r\n print(p-a)", "from math import *\r\n\r\n\r\ndef main():\r\n n, a, b = map(int, input().split())\r\n k = 0\r\n st = a + 1\r\n while st <= n:\r\n if n - st <= b:\r\n k += 1\r\n st += 1\r\n print(k)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, a, b = map(int, input().split())\r\ncounter = 0\r\nfor i in range(n):\r\n if i > a-1 and i >= n - b-1:\r\n counter += 1\r\n\r\nprint(counter)", "n,a,b = map(int,input().split())\r\nprint(n - max(a+1,n-b) + 1)", "n,a,b=[int(x) for x in input().split()]\r\nc=0\r\nfor i in range(0,n-a):\r\n if i<=b:\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "a,b,c = list(map(int,input().split()))\r\nd = a-b-1\r\nif(d>c):\r\n e = c+1\r\nelse:\r\n e = d+1\r\nprint(e)", "n,a,b = map(int,input().split())\r\ncnt = 0\r\nfor i in range(b+1):\r\n for j in range(a,n):\r\n if i+j==n-1:cnt+=1\r\n\r\nprint(cnt)\r\n", "import sys\r\nimport math as mt\r\nimport bisect as bi\r\nimport collections as cc\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\nn , a , b = I()\r\nans = 0\r\nfor i in range(1,n+1):\r\n left = i-1\r\n right = n - i\r\n #print(i,left,right)\r\n if left>=a and right<=b:\r\n ans+=1\r\nprint(ans)", "n,a,b=list(map(int,input().split()))\r\nf,l=1,n\r\nif a+b>=n:\r\n print(n-a)\r\nelse:\r\n print(b+1)\r\n", "def main():\r\n [n, a, b] = list(map(int, input().split()))\r\n print(min(n - a, b + 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n", "N,A,B=list(map(int,input().split()))\r\nRes=N-max(A+1,N-B)+1\r\nprint(Res)\r\n", "n, x, y = input(\"\").split()\npossible_positions = min(int(n) - int(x) - 1, int(y))\nprint(possible_positions+1)\n \t \t\t \t \t \t\t \t\t\t\t\t\t\t\t \t\t", "import sys\r\n\r\ndef file_io():\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\ndef RL():\r\n return [int(x) for x in sys.stdin.readline().split()]\r\n\r\ndef RI():\r\n return int(sys.stdin.readline())\r\n\r\ndef RS():\r\n return sys.stdin.readline()[:-1]\r\n\r\ndef print(*s, end='\\n'):\r\n sys.stdout.write(f'{\" \".join(str(x) for x in s)}{end}')\r\n\r\n# file_io()\r\n\r\ndef solve():\r\n n, a, b = RL()\r\n\r\n res = 0\r\n for i in range(1, n+1):\r\n l = i-1\r\n r = n-i\r\n\r\n if l >= a and r <= b:\r\n res += 1\r\n \r\n print(res)\r\n\r\n# t = RI()\r\nt = 1\r\nwhile t > 0:\r\n solve()\r\n t -= 1", "n, a, b = map(int, input().split(' '))\r\n\r\nfirst = max(n-b-1, a)\r\nlast = n\r\n\r\n#print(first, last)\r\nprint(last-first)", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\n\r\n\r\n# sys.stdin.readline().rstrip()\r\n#n, m = map(int, input().split())\r\n\r\n\r\nn, a, b = map(int, input().split())\r\nans = 0\r\n\r\nfor i in range(b + 1):\r\n xa = n - i - 1\r\n if xa >= a: ans += 1\r\n\r\nprint(ans)\r\n\"\"\"\r\n<-- a X b\r\n\"\"\"", "n,a,b = map(int, input().split())\ncount = 0\n\n\n\nfor i in range(a+1, n+1):\n if n - i <= b:\n count +=1\nprint(count)\n \t\t \t\t \t \t \t \t \t \t \t\t\t", "n, a, b = input().split(\" \")\r\nn, a, b = int(n), int(a), int(b)\r\nprint(len(set(range(a, n)) & set(range(n-b-1, n))))\r\n", "string = input()\r\nn, a, b = string.split()\r\n \r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\n \r\nfront = a\r\nback = b\r\n \r\ni=0 \r\npost = 0\r\n \r\na = n-1\r\nb = 0\r\n \r\nwhile b<=back:\r\n\tif a>=front and b<=back:\r\n\t\tpost += 1\r\n\ta-=1\r\n\tb+=1\r\n \r\nprint(post)\r\n", "n,a,b=map(int,input().split(\" \"))\r\nl=[x for x in range(max(a,n-1-b),n)]\r\nprint(len(l))", "a,b,c=map(int,input().split())\r\ni=a-b\r\nif i>c:\r\n i=c+1\r\nelse:\r\n i=i\r\nprint(i)\r\n \r\n \r\n", "a,b,c = map(int,input().split())\n_from = b + 1\n_to = a - c\nprint(a-max(_from,_to)+1)\n", "lis = list(map(int,input().split()))\r\nn = lis[0]\r\na = lis[1]\r\nb = lis[2]\r\n\r\nans = 1\r\n\r\nwhile ((n-ans)>=a)and((ans-1)<=b):\r\n ans+=1\r\n \r\nprint(ans-1)", "n, a, b = [int(s) for s in input().split()]\n\n\nans = 0\nfor i in range(1, n + 1):\n if i - 1 >= a and n - i <= b:\n ans += 1\n\nprint(ans)", "task = input()\r\nn=0\r\na=0\r\nb=0\r\ntest=\"\"\r\ni=0\r\nspace=0\r\n\r\nfor symbol in task:\r\n if symbol == \" \":\r\n if space ==0:\r\n n=int(test)\r\n if space ==1:\r\n a=int(test)\r\n space =space+1\r\n test=\"\"\r\n \r\n else:\r\n test+=task[i]\r\n if i==len(task)-1:\r\n b = int(test)\r\n i=i+1\r\n\r\nanswer=n-a\r\n\r\nif answer>b:\r\n answer=b+1\r\n\r\nprint(answer)", "n,a,b =map(int , input().split())\r\nprint(min(n-a,b+1))", "# i >= a\r\n# n - 1 - i <= b\r\n# i >= max(a, n - 1 - b)\r\n\r\nn, a, b = map(int, input().split())\r\nans = n - max(a, n - 1 - b)\r\nprint(ans)", "n, x, y = [int(i) for i in input().split()]\nprint( min([(n-x), (y+1)]) )\n \t \t \t\t\t \t\t \t\t\t", "n,a,b = map(int,input().split())\r\n\r\nif n-a<=b:\r\n print(n-a)\r\nelse:\r\n print(b+1)\r\n ", "a, b, c = input().split()\nprint(min(int(a) - int(b), int(c) + 1))\n# Mon Jan 03 2022 13:39:54 GMT+0000 (Coordinated Universal Time)\n", "arr = [int(x) for x in input().split()]\r\nn,a,b = arr[0],arr[1],arr[2]\r\nprint(n - max(a+1,n-b)+1)", "arr = [int(x) for x in input().split()]\r\nn,a,b = arr[0],arr[1],arr[2]\r\ncount = 0\r\nfor i in range(n):\r\n if (n-1)-i<=b and i>=a:\r\n count+=1 \r\n \r\nprint(count)", "lst=['n','a','b']\r\nlst=list(map(int,input().split(\" \")))\r\nn=lst[0]\r\na=lst[1]\r\nb=lst[2]\r\np=0\r\nfor i in range(1,n+1):\r\n if n-i>=a and i-1<=b:\r\n p=p+1\r\nprint(p)", "n,a,b = list(map(int, input().split()))\r\n\r\nprint(n - max(a+1,n-b) + 1)", "n, a, b = map(int, input().split())\r\nc = 0\r\n\r\nfor i in range(a+1, n + 1):\r\n if (n - i) <= b:\r\n c += 1\r\nprint(c)\r\n", "def soughts(n, a, b):\r\n c = n-a-1\r\n r = 0\r\n if c > b:\r\n r = b + 1\r\n else:\r\n r = c + 1\r\n return r\r\nn, a, b = map(int, input().split())\r\nprint(soughts(n, a, b))", "# mixed = [1,2,3,4, 'block', 'six', 1.2, 3.4]\r\n# # print(mixed[6])\r\n# # print(mixed[1:6])\r\n\r\n# mixed[5] = 'Cipher'\r\n# print(mixed)\r\n\r\n# fruits = ['Apple', 'Grapes']\r\n# fruits.append('Mango')\r\n# print(fruits\r\n\r\n\r\n# laptop = []\r\n# laptop.append('ASUS')\r\n# laptop.append('Levona')\r\n# laptop.append('macbook') \r\n\r\n# print(laptop)\r\n\r\n# fruits.insert(1, 'mango')\r\n# print(fruits)\r\n\r\nfruits = ['mango', 'kiwi', 'pineapple','Apple', 'Grapes','Apple', 'Grapes']\r\n# fruits3 = fruits + fruits1\r\n# print(fruits3)\r\n\r\n# fruits.extend(fruits1)\r\n# print(fruits)\r\n# print(fruits1)\r\n# fruits.pop(3)\r\n# del fruits[3]\r\n\r\n# fruits.remove('Apple')\r\n# print(fruits)\r\n# i = fruits\r\n# if 'Grapes' in fruits:\r\n# print(f\"Yes it is {fruits[4]}\")\r\n# else:\r\n# print(\"No\") \r\n\r\n# print(fruits.count('Apple'))\r\n# fruits.sort()\r\n# num = [1,2,3,4,5,5,3,5,2,6]\r\n# num.sort()\r\n# fruits.clear()\r\n# fruits_ = fruits.copy()\r\n# fruits.copy()\r\n# print(fruits)\r\n# print(fruits_)\r\n\r\n# for i in fruits:\r\n# print(i)\r\n\r\n# matrix = [[1,2,3], [4,5,6], [7,8,9]]\r\n# # print(matrix[1])\r\n# # for sublist in matrix:\r\n# # for i in sublist:\r\n# # print(i)\r\n# i = matrix[2][2]\r\n# print(i)\r\n\r\n\r\n# for _ in range(int(input())):\r\narr = list(map(int,input().split()))\r\nprint(min(arr[0]-arr[1], arr[2] + 1))\r\n\r\n\r\n \r\n # if (n)%(b+a)==0:\r\n # print((n)//(b+a))\r\n # else:\r\n # print(3)\r\n\r\n\r\n# for _ in range(int(input())):\r\n# x,y,a,b = map(int,input().split())\r\n# # c=0\r\n# # while(x<y):\r\n# # x+=a\r\n# # y-=b\r\n# # # print(x,y)\r\n# # c+=1\r\n# # if x==y:\r\n# # print(c) \r\n# # else:\r\n# # print(-1)\r\n# if (y-x)%(b+a)==0:\r\n# print((y-x)//(b+a))\r\n# else:\r\n# print(-1)\r\n\r\n", "import sys\nimport bisect\nimport heapq\nimport math\nfrom functools import lru_cache\nfrom collections import defaultdict,Counter\n\n\n#sys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nI = lambda: int(input())\nS = lambda: input()\nL = lambda: list(map(int, input().split()))\n###################################################\n\n\n\n\ndef solution(n, a, b):\n print(min(n-a,b+1))\n\n\nif __name__=='__main__':\n n,a,b = L()\n solution(n, a, b)", "n, a, b = map(int, input().split(\" \"))\r\nb1 = n - 1 - a\r\nif b1 <= b:\r\n print(b1 + 1)\r\nelse:\r\n print(b + 1)", "n,a,b = map(int,input().split())\nprint(n-max(a+1,n-b)+1)\n", "l1=[int(i) for i in input().split()]\r\nn=l1[0]\r\na=l1[1]\r\nb=l1[2]\r\nk=n-a\r\nif k<=b+1:\r\n print(k)\r\nelse :\r\n print(b+1)", "# The number of positions\r\ns = input().split(\" \")\r\ns = [int(i) for i in s]\r\nn,a,b = s[0],s[1],s[2]\r\nn = n - max(a,n-b-1)\r\nprint(n)", "n,a,b=map(int,input().split())\r\ncount=0\r\nfor i in range(a+1,n+1):\r\n if (n-i)<=b:\r\n count+=1\r\nprint(count)", "n,a,b=map(int,input().split())\r\nprint(b+1 if n-b>a else n-a)", "n,a,b=map(int,input().split())\r\nk=0\r\nn=n-1\r\nwhile n>=a and b>=0:\r\n k += 1\r\n b -= 1\r\n n -= 1\r\nprint(k)", "el = input(\"\").split(\" \")\nfor i in range(0, len(el)):\n el[i] = int(el[i])\ntotal = el[0]\nahead = el[1]\nbehind = el[2] \nArr = []\n\nfor i in range(behind+1):\n Arr.append(total-i)\nfor j in range(total-ahead): \n Arr.append(ahead+j+1)\nnSet = set(Arr) \n# print(Arr)\nprint(len(Arr) - len(nSet)) ", "#rough code\r\nn,a,b=map(int,input().split())\r\nf=a+1\r\nb=n-b\r\nans=n-max(f,b)+1\r\nprint(ans)", "N,A,B = map(int, input().split())\r\nprint(min(N-1,A+B)-A+1)", "a, b, c = map(int, input(). split())\r\nprint(a - max(b + 1, a - c) + 1)\r\n", "def main() -> int:\r\n n, a, b = (int(x) for x in input().split())\r\n return b + 1 if b + 1 < n - a else n - a\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, a, b = input().split()\r\nprint(min(int(n)-int(a), int(b) + 1))", "n, a, b = map(int, input().split())\r\nif n - a == b:\r\n print(b)\r\nelif n - a < b:\r\n print(n-a)\r\nelse:\r\n print(b+1)", "n, a, b = map(int, input().split())\r\nprint(min(b + 1, n - a))\r\n", "n,a,b = map(int,input().split())\r\nif n-a-1>b:\r\n print(b+1)\r\nelse:\r\n print(n-a)", "n, a, b = map(int, input().split())\r\n\r\nallowed_a = n-a\r\nallowed_b = b + 1\r\n\r\nprint(min(allowed_a, allowed_b))", "n, a, b = map(int,input().split())\r\nans = 0\r\nfor i in range(1,n+1):\r\n if (i-1>=a and n-i<=b):\r\n ans += 1\r\nprint(ans)", "arr = list(map(int,input().split()))\r\n\r\nn = arr[0]\r\na = arr[1]\r\nb = arr[2]\r\n\r\n#print(arr[0] - arr[1])\r\n\r\ncount = 0\r\nfor minVal in range(a,n):\r\n val =n - (minVal+1)\r\n if val<=b:\r\n if val>=0:\r\n count+=1\r\n\r\n\r\nprint(count)\r\n \r\n \r\n", "n, a, b = [int(i) for i in input().split()]\r\nif n - a > b:\r\n print(b+1)\r\nelse:\r\n print(n-a)", "def The_number_of_positions():\r\n strInput = input().split(' ')\r\n totalPeople = int(strInput[0])\r\n a = int(strInput[1])\r\n b = int(strInput[2])\r\n\r\n #if position is p, then people in front are p -1 , thus p -1 >= a which gives p >= a + 1\r\n #if position is p, then people behind are n - p, thus n - p <= b which gives p >= n - b\r\n\r\n lower_limit_of_position = max(a+1, totalPeople - b)\r\n favorable_positons = totalPeople - lower_limit_of_position + 1\r\n print(favorable_positons)\r\n\r\n\r\nThe_number_of_positions()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\nans = 0\r\nfor i in range(n):\r\n if i >= a and n - i - 1 <= b:\r\n ans += 1\r\nprint(ans)", "n, a, b = map(int,input().split(' '))\r\n# la cantidad máxima de posiciones será \r\n# el mínimo entre:\r\n# los que ve por delante: \r\n # si la fila mide 5\r\n # y hay al menos 3 por delante\r\n # 5-3\r\n# y los que ve por detrás\r\n # si por detrás NO hay más de 4 (b) personas,\r\n # como mucho hay 4, entonces contando desde el principio, independientemente de N\r\n # su posicion máxima es b+1\r\n# min(n-a,b+1)\r\nprint(min(n-a,b+1))", "y,j,k=map(int,input().split())\r\nprint(min([y-j,k+1]))", "n, a, b = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if i >= a and n-1-i <= b:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,a,b=map(int,input().split())\r\nprint(n-(max(a+1,n-b))+1)", "n,a,b = tuple([int(item) for item in input().split()])\r\nfrontallowed = n-a\r\nendallowed = b+1\r\nprint(min(frontallowed,endallowed))", "n , at_least , no_more = map(int , input().split()) \r\ncount = 0 \r\nfor i in range(1 , n +1 ) : \r\n if at_least<= i - 1 and no_more >= n-i :\r\n count += 1 \r\nprint(count)", "a, b, c = input().split()\r\na, b, c = int(a), int(b), int(c)\r\nvector = [0]*a\r\nfor i in range(b):\r\n vector.pop(0)\r\nif vector:\r\n if len(vector) - 1 <= c:\r\n print(len(vector))\r\n else:\r\n while len(vector) - 1 > c:\r\n vector.pop(-1)\r\n print(len(vector))\r\n", "a,b,c = map(int,input().split())\r\nprint(a-max(b+1,a-c)+1)", "n,a,b=tuple(map(int, input().split()))\r\nprint(min(n-a,b+1))", "inputs = [int(num) for num in input().split()]\r\nn = inputs[0]\r\na = inputs[1]\r\nb = inputs[2]\r\nif(a+b>=n-1):\r\n print(n-a)\r\nelse:\r\n diff = n - (a+b+1)\r\n a = a+diff\r\n print(n-a)\r\n ", "def main(n,a,b):\r\n\tres = []\r\n\tfor i in range(1,n+1):\r\n\t\tif ((i-1) >= a) and ((n-i)<= b):\r\n\t\t\tres.append(i)\r\n\r\n\treturn len(res)\r\n\r\n\r\n\t\r\n\t\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tn,a,b = list(map(int,input().split()))\r\n\tprint(main(n,a,b))\r\n", "n,a,b = map(int,input().split())\r\nif n-(a+b) == 0:\r\n print(n-a)\r\nelif n - (a + b) < 0:\r\n print(n-a)\r\nelif n-(a+b)>0:\r\n print(b+1)", "inp = input().split()\r\nn = int(inp[0])\r\na = int(inp[1])\r\nb = int(inp[2])\r\n\r\nprint(min(n-a,b+1))\r\n\r\n", "n,a,b = list(map(int, input().split()))\nremain = n -a -b\nif remain>1:\n print(n- a - remain +1)\nelse:\n print(n-a)", "N=list(input ())\r\ni=0 \r\nwhile i<len(N):\r\n if N[i] == ' ':\r\n N.pop(i)\r\n i=i+1\r\n else:\r\n if i!=0:\r\n N[i-1]=N[i-1]+N[i]\r\n N.pop(i)\r\n else:\r\n i=i+1 \r\nn=int(N[0])\r\na=int(N[1])\r\nb=int(N[2])\r\nif n-a>b+1:\r\n print(b+1)\r\nelse:\r\n print(n-a)", "n, a, b = list(map(int, input().split()))\r\nl = a + 1\r\nr = n - b\r\nif l < r:\r\n print(b + 1)\r\nelse:\r\n print(n - a)", "def main():\r\n l = list(map(int, input().strip().split()))\r\n answer = min(l[0] - l[1], l[2] + 1)\r\n print(answer)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n , a , b = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nfor x in range(a+1, n+1):\r\n if n -x <= b:\r\n count+=1\r\n\r\nprint(count)\r\n\r\n\r\n", "n,a,b=[int(x) for x in input().split()]\r\nprint(min(n-a,b+1))", "def solve():\r\n l=list(map(int,input().split()))\r\n print(min(l[0]-l[1],l[2]+1))\r\nsolve()\r\n", "n, a, b = [int(x) for x in input().split()]\r\n\r\nif n-a >= b+1:\r\n print(b+1)\r\nelse:\r\n print(n-a)\r\n", "n,a,b = map(int,input().split())\r\nif b+1 < 0 or n-a < 0:\r\n print(0)\r\nelse:\r\n print(min(b+1,n-a))", "n, a, b=list(map(int, input().split()))\r\ns=0\r\nprint(n-max(a+1, n-b)+1)", "n,a,b=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n\t\tif (n-(i+1)<=b) and (i+1>a):\r\n\t\t c+=1\r\nprint(c)\r\n\t", "n, a, b = [int(x) for x in input().split()]\r\ncounter = 0\r\nmax_right_pos = n - b\r\nprint(n - max(max_right_pos-1, a))", "n, a, b = [int(x) for x in input().split()]\r\n\r\nprint(min(n-a, b+1))", "x = [int(i) for i in input().split()]\r\nprint(min(x[0]-x[1], x[2]+1))\r\n", "n,a,b = map(int, input().split())\r\nprint(min((b+1),(n-a)))\r\n", "n, a, b = input().split()\r\nans = min(int(n) - int(a), int(b) + 1)\r\nprint(ans)", "x = input().split()\r\na = int(x[0])\r\nb = int(x[1])\r\nc = int(x[2])\r\nsum = 0\r\n\r\nfor i in range(1,a+1):\r\n if i-1>=b and a-i<=c:\r\n sum+=1\r\n\r\nprint(sum)", "l = list(map(int,input().split())) \r\nn,a,b = l[0],l[1],l[2] \r\n\r\nif (n-a <=b) :\r\n print(n-a)\r\nelse:\r\n print(b+1)", "#The number of positions\r\n#Menentukan banyaknya kemungkinan posisi\r\n\r\n#KAMUS\r\n#n, a, b: integer\r\n\r\n#ALGORITMA\r\n#di depan minimum ada a orang dan di belakang maksimum ada b orang\r\nn,a,b=map(int, input().split())\r\ncount=0\r\nfor i in range(0,b+1):\r\n if(i<=n-a-1):\r\n count=count+1\r\nprint(count)\r\n", "\nn,a,b= map(int,input().split())\n\nx = min(b+1,n-a)\nprint(x)", "def main():\r\n n,a,b = map(int,input().split())\r\n if n-a>b+1:\r\n print(b+1)\r\n else:\r\n print(n-a)\r\nmain()", "n,a,b = map(int, input().split())\r\nif (n-a)<=b:\r\n print(n-a)\r\nelse:\r\n print(b+1)", "n,a,b = map(int,input().split())\r\nprint(min((n-a),(b+1)))", "n, a, b = map(int, input().split())\r\n\r\nct = 0\r\nfor i in range(n):\r\n k = i + 1\r\n if k > a and k >= n - b:\r\n ct += 1\r\nprint(ct)\r\n", "def _input(): return map(int, input().split())\r\n\r\nn,a,b = _input()\r\nk = n-a-1-b \r\nif k<=0: print(n-a)\r\nelse: print(n-a-k)", "def f(n,a,b):\r\n if n-b >a :\r\n return b+1\r\n else:\r\n return n-a \r\nn,a,b=map(int,input().split())\r\nprint(f(n,a,b))", "n,a,b = map(int,input().split())\n\npos = 0\n\ndef Many(n,i):\n les = i-1\n mor = n-i\n\n return [les,mor]\n\nfor i in range(1,n+1):\n arr = Many(n,i)\n\n if arr[0]>=a and arr[1]<=b:\n pos+=1\n # print(\"i\",i,\"les\",arr[0],\"mor\",arr[1])\n\nprint(pos)\n", "n,x,y = map(int,input().split())\nnum = min((y+1,n-x))\nprint(num)\n\t \t\t \t \t \t\t \t\t\t\t \t\t \t\t\t\t\t", "n,a,b = map(int,input().split())\r\nx = n-a\r\nwhile (x-1) > b:\r\n x -= 1\r\nprint(x)", "n,a,b = map(int,input().split())\r\nprint(n-max(a+1,n-b)+1)\r\n", "n,a,b=map(int,input().split())\r\nif a+b-n>0:\r\n print(n-a)\r\nelif n==a+b:\r\n print(b)\r\nelse:\r\n print(b+1)", "a,b,c=map(int,input().split())\r\nif b+c>a:\r\n c=a-b\r\nm=0\r\nif b+c==a:\r\n m=0\r\nelse:\r\n m=1\r\nprint(m+c)", "n,a,b = input().split()\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\nif a+b>=(n-1):\r\n print(n-a)\r\nelse:\r\n print((n-a)-((n-1)-(a+b)))", "n,a,b=[int(i) for i in input().split(\" \")]\r\nprint(n-max(a,n-1-b))", " \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, a, b = MII()\r\n\r\nprint(1 + b + min(0, n - a - b - 1))\r\n ", "n, a, b = map(int, input().split())\r\nprint(min(b+1, n-a))\r\n", "n,a,b=map(int,input().strip().split())\r\nprint(n-max(n-b,a+1)+1)", "n,a,b=map(int, input().split())\r\nprint(min(n-a,b+1))\n# Mon Jan 03 2022 12:49:36 GMT+0000 (Coordinated Universal Time)\n", "n, a, b = map(int, input().split())\nans = n-max(a+1, n-b)+1\nprint(ans)\n", "numofppl,frontppl,behindppl=list(map(int,input().split()))\r\nprint(min((numofppl-frontppl),behindppl+1))", "# Ahmed Abdelrazik\r\n\r\nn,a,b=map(int,input().split())\r\nT = 0\r\n\r\nfor i in range(1,n+1):\r\n if n-i <=b and i-1 >=a:\r\n T+=1\r\n\r\nprint(T)", "n, m, k = map(int, input().split())\r\nprint(min(n-m, k+1))", "n , a , b = map(int,input().split())\r\ni = 1\r\npos=[]\r\nwhile i <= n:\r\n if i-1 >= a and n-i <= b:\r\n pos.append(i)\r\n i = i+1\r\nprint(len(pos))", "n,a,b=map(int,input().split())\r\nn = n-a\r\nif n>b+1:\r\n print(b+1)\r\nelse:\r\n print(n)", "T = 1#int(input())\r\nfor _ in range(T):\r\n n,x,y = list(map(int,input().split()))\r\n print(n-max(x+1,n-y)+1)\r\n ", "if __name__ == '__main__':\r\n n, a, b = list(map(int, input().strip().split()))\r\n print(min(n - a, b + 1))", "# ALLAH HO AKBAR\n\n# PROPHET MUHAMMAD S.A.W\n\n# CODE \n# BY\n# HASHIM\n\nn,a,b=map(int,input().split())\nprint(n-max(a+1,n-b)+1)", "n,x,z=map(int,input().split())\r\n\r\n\r\nprint(min(n-x,z+1))", "n,a,b=map(int,input().split())\r\nif b<n-a:\r\n print(b+1)\r\nelif b>=n-a:\r\n print(n-a)", "n,a,b=map(int,input().split())\r\nans=0\r\nfor i in range(1,n+1):\r\n if i>a and n-i<=b:\r\n ans+=1\r\nprint(ans)\r\n", "n,a,b=map(int,input().split())\r\nc=min(n-a,b+1)\r\nprint(c)", "x,a,b=map(int,input().split(\" \"))\r\ninitialpos=a+1\r\nwhile(x-initialpos>b):\r\n\tinitialpos=initialpos+1\r\nprint(x-initialpos+1)", "nums = input().split()\r\nn, a, b = int(nums[0]), int(nums[1]), int(nums[2])\r\n\r\nx = n - 1 - b\r\nif x < 0:\r\n x = 0\r\n\r\nif x >= a:\r\n ans = n - x\r\nelse:\r\n ans = n - a\r\n\r\nprint(ans)", "l=list(map(int,input().split()))\r\nn,a,b=l[0],l[1],l[2]\r\nmn=[i for i in range(a+1,n+1)]\r\nmx=[i for i in range(n-b,n+1)]\r\nres=0\r\nfor i in mn:\r\n if i in mx:\r\n res+=1\r\nprint(res)", "n, a, b = map(int, input().split())\r\npos = 0\r\nfor i in range(1, n+1):\r\n if (n-i) >= a and (i-1) <= b:\r\n pos += 1\r\nprint(pos)", "n, x, y = map(int, input().split())\r\ntemp = 0\r\nf = False\r\n\r\nfor i in range(1, n + 1):\r\n if i - x - 1 >= 0 and n - i <= y:\r\n temp += 1\r\n f = True\r\n elif f:\r\n break\r\n\r\nprint(temp)", "n, a, b = list(map(int, input().split()))\r\nback, front = 0, n-1\r\nans = 0\r\nfor i in range(n):\r\n if front >= a and back <= b:\r\n ans += 1\r\n back += 1; front -= 1\r\nprint (ans)", "n,a,b=map(int,input().split(\" \"))\r\nc=n-a\r\nwhile(c>b+1):\r\n c-=1\r\nprint(c)\r\n", "z, d, e = map(int, input().split())\r\nprint(z - max(d+1, z-e) + 1)", "\r\nint_str = input()\r\ninteger_array = [int(x) for x in int_str.split()]\r\n\r\nt = integer_array[0]-integer_array[1]\r\n\r\nif t>integer_array[2]:\r\n temp = t - (integer_array[0]- integer_array[1] - integer_array[2] - 1) \r\nelse:\r\n temp = t\r\nprint(temp)\r\n", "def main():\r\n n,a,b=map(int,input().split())\r\n print(n-max(a+1,n-b)+1)\r\nif __name__=='__main__':\r\n main()", "n,a,b = map(int,input().split())\r\nprint(min(n-a , b+1))", "def solve():\r\n q,w,e=map(int,input().split())\r\n ans=0\r\n for i in range(w+1,q+1):\r\n if q-i<=e:\r\n ans+=1\r\n print(ans)\r\na=1\r\nfor i in range(a):\r\n solve()\r\n", "l=[int(i) for i in input().split()]\r\nn=l[0]\r\na=l[1]\r\nb=l[2]\r\nx=min(n-a,b+1)\r\nif x<0:\r\n x=0\r\nprint(x)", "n, a, b = map(int, input().split())\n\ncount = 0\nfor i in range(1, n+1):\n if i - 1 >= a and n - i <= b:\n count += 1\n\nprint(count)", "data = [int(x) for x in input().split(' ')]\r\n\r\nn = data[0]\r\na = data[1]\r\nb = data[2]\r\n\r\nstart = a + 1\r\nend = start + b\r\n\r\nif end > n:\r\n end = n\r\n\r\ncount = end - start + 1\r\nprint(count)", "n, a, b = map(int, input().split())\r\nans = n-max(a+1,n-b)+1\r\nprint(ans)", "#from collections import Counter\r\n#import math\r\ncount_time=0\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nn,a,b=map(int,input().split())\r\nprint(n-max(a+1,n-b)+1)\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", "n, a, b = map(int, input().split())\r\npos = 0\r\nfor i in range(0, n):\r\n if(i>=a and (n-i-1)<=b):\r\n pos+=1\r\nprint(pos)\r\n\r\n\"\"\"\r\n\r\na a a a a\r\n\r\n\"\"\"", "n , a , b = map(int,input().split())\r\nif n - a - b ==1:\r\n print(b+1)\r\nelif n-a-b >1:\r\n a+= (n-a-b)-1\r\n print(b+1)\r\nelse:\r\n if b >=n-a-1:\r\n b = n-a-1\r\n print(b+1)", "n,a,b = map(int,input().split())\r\nt=min(n-a,b+1)\r\nprint(t)\r\n", "n, x, y = map(int, input().split())\nspots = []\nfor i in range(1, n+1):\n if i > x and n - i <= y:\n spots.append(i)\nprint(len(spots))\n\t\t \t \t \t \t \t\t \t \t\t \t\t", "l=list(map(int,input().rstrip().split()))\r\nn=l[0]\r\na=l[1]\r\nb=l[2]\r\ncnt=0\r\nd=[o for o in range(n-b-1,n)]\r\nfor i in range(a,n):\r\n if i in d:\r\n cnt+=1\r\nprint(cnt)\r\n", "\r\n\r\nc = 0\r\nl, a, b = [int(x) for x in input().split()]\r\n\r\nfor i in range(1, l+1):\r\n if a < i and b >= (l-i):\r\n c += 1\r\n\r\nprint(c)\r\n", "n,a,b=map(int,input().split())\r\nd=n-a\r\nif d>b:\r\n d=b+1\r\nprint(d)", "n,a,b=map(int,input().split())\r\nc=n-a\r\nif(c<=b):\r\n r=c\r\nelse:\r\n r=b+1\r\nprint(r)", "inp = input().split()\r\nn,a,b = int(inp[0]),int(inp[1]),int(inp[2])\r\nif n-a<=b:\r\n print(n-a)\r\nelse:\r\n print(b+1)\r\n", "n,a,b=map(int,input().split()) \r\na1=n-a \r\nb1=b+1 \r\nprint(min(a1,b1))", "n,a,b=input().split(\" \")\r\nn=int(n)\r\na=int(a)\r\nb=int(b)\r\nc=0\r\nfor i in range(1,n+1):\r\n if a<i and (n-i)<=b:\r\n c=c+1\r\nprint(c)", "n,a,b=map(int,input().split())\r\nn=n-a\r\nif n>b:\r\n print(b+1)\r\n \r\nelse:\r\n print(n)", "n, a, b = [int(i) for i in input().split()]\r\n\r\nif n - b <= a:\r\n b-= a - (n - b) + 1\r\nelif n - a <= b:\r\n b-= b - (n - a) + 1\r\n\r\nprint(b + 1)", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n n, a, b = list(map(int, input().split()))\r\n index1, index2 = a+1, n - b\r\n if index2 > index1:\r\n print(n - index2+1)\r\n else:\r\n print(n - index1+1)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,a,b= input().split(' ')\nn=int(n)\na=int(a)\nb=int(b)\nprint(min((n-a), (b+1)))\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 , a , b = map(int,(input().split()))\r\nmin_front = b + 1\r\nmax_behind = n - a\r\n\r\nans = min(min_front, max_behind)\r\n\r\nprint(ans)\r\n", "n,a,b = [int (x) for x in input().split()]\r\nc=0\r\nfor i in range(a+1,n+1):\r\n if(n-i<=b):\r\n c=c+1 \r\nprint(c)", "#n = people on the line\r\n#a = there are min 'a' people infront of him\r\n#b = there are max 'b' people behind him\r\n#ans = The possible positions he's occupying.\r\n#9 4 3\r\n\r\nt = list(map(int,input().split())) #9 4 3\r\nans = t[0] - t[1] #5\r\nc = t[2] + 1\r\nif(ans > c):#c=4\r\n ans -= ans - c\r\nprint(ans)\r\n", "n, a, b = map(int, input().split())\r\ndostupno = n - a # a + 1, a + 2, ...., n\r\ndostupno_2 = b + 1 # n - b, ..., n - 1, n ### n - (n - b - 1)\r\nprint(min(dostupno, dostupno_2))", "\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 t():\r\n n, a, b = map(int, input().split())\r\n print(sum([1 if i - 1 >= a and (n - i) <=\r\n b else 0 for i in range(a + 1 if (a + b) == n else n - (a + b), n + 1)]))\r\n\r\n\r\nt()\r\n", "n , a , b = map(int,input().split())\r\nGEEK = {10000}\r\n \r\nfor i in range(0,b+1):\r\n if((n-i-1)>=a):\r\n GEEK.add(i)\r\n \r\nprint(len(GEEK)-1)\r\n", "n, a, b = map(int, input().split())\r\n\r\nif n-a-1 <= b:\r\n print(n-a)\r\nelse:\r\n print(b+1)", "# kam se kam 'a' aage aur zyada se zyada 'b' peeche hain\r\nn,a,b=map(int,input().split())\r\nrem=n-a\r\nif rem>(b+1):\r\n print(b+1)\r\nelse:\r\n print(rem)", "n,a,b=list(map(int,input().split()))\r\n#a<=x\r\n#n-1-b<=x\r\nif a>n-b-1:\r\n print(n-a)\r\nelse:\r\n print(b+1)", "n, a, b = map(int , input().split())\n\nres = 0\nfor i in range(1, n + 1):\n if i - 1 >= a and n - i <= b:\n res += 1\n\nprint(res)\n \n\n \t \t\t \t\t\t\t\t\t\t \t \t\t \t \t\t", "n,x,y=map(int,input().split())\r\nprint(min(n-x,y+1))", "n,a,b = list(map(int,input().split()))\r\nprint(min(n - a, b + 1)) \r\n", "n,a,b=map(int,input().split())\r\ncnt=0\r\nwhile a<n:\r\n i=a+1\r\n if n-i<=b : cnt+=1\r\n a+=1\r\nprint(cnt)", "n,a,b=map(int,input().split())\r\n\r\nprint(n-max(a+1,(n-b))+1)", "n,a,b = map(int,input().strip().split())\r\nif (n-a)<b:\r\n\tprint(n-a)\r\nelse:\r\n\tprint(min(n-a,b+1))\r\n", "n, a, b = map(int, input().split())\r\nn -= a\r\ncount = 0\r\nif n <= b:\r\n print(n)\r\nelse:\r\n print(b + 1)", "l = input().split(' ')\r\nn = int(l[0])\r\na = int(l[1])\r\nb = int(l[2])\r\nc = n-a-1\r\nprint(min(c,b)+1)", "def main():\r\n n,a,b=map(int,input().split())\r\n return min(n-a,b+1)\r\n\r\n\r\nprint(main())", "#для код форса\r\n\r\nnab = input().split()\r\nn = int(nab[0])\r\na = int(nab[1])\r\nb = int(nab[2])\r\nif a + b + 1 <= n:\r\n print(b + 1)\r\nelse:\r\n print(b + 1 - (a + b + 1 - n))\r\n", "n,a,b=map(int,input().split())\r\nk1=n-a\r\nk2=b+1\r\nif k1<k2 :\r\n print(k1)\r\nelse:\r\n print(k2)", "n,a,b=map(int,input().split())\r\nx=0\r\nfor q in range(b+1):\r\n if(n-q-1)>a or (n-q-1)==a:\r\n x+=1\r\nprint(x)\r\n\r\n", "N, A, B = map(int, input().split())\n\nnum_positions = min(N - A, B + 1)\n\nprint( num_positions)\n\n\t \t \t\t \t\t\t\t\t\t \t \t\t \t", "def q(n,a,b):\r\n if a+b<=n-1:\r\n return b+1\r\n else:\r\n return n-a\r\n \r\ni=input().split()\r\nl=list(map(int,i))\r\nprint(q(l[0],l[1],l[2]))", "import sys\r\nimport os\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 bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"./code/input.txt\"\r\n OUTPUT_FILE_PATH = \"./code/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\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, A, B):\r\n ans = 0\r\n for i in range(N):\r\n people_on_left = i\r\n people_on_right = N-i-1\r\n\r\n if people_on_left >= A and people_on_right <= B:\r\n ans += 1\r\n\r\n return ans\r\n\r\n\r\nN, A, B = read_numeric_list()\r\n\r\nprint(solve(N, A, B))\r\n", "n, a, b = [int(_) for _ in input().split()]\r\nprint(min(n-a, b+1))", "n, a, b = map(int, input().strip().split())\r\nbb = n-a-1\r\nprint(min(bb, b)+1)", "n,a,b=list(map(int,input().split()))\n\nprint(min(n-a,b+1))", "n,a,b=map(int, input().split())\r\nif a+b<n:\r\n print(b+1)\r\nelif a+b==n:\r\n print(b)\r\nelse:\r\n print(n-a)", "def solve():\r\n n, a, b = map(int, input().split())\r\n print(n + 1 - max(a + 1, n - b))\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "x, a, b = map(int, input().split())\n\nif a + b < x:\n d = b + 1\nelse:\n d = a + b - x + 1\n d = b + 1 - d\n\nprint(d)\n \t \t \t \t \t\t \t \t \t\t\t \t\t\t \t", "\r\ndef dragon(r):\r\n n=r[0]\r\n a=r[1]\r\n b=r[2]\r\n i=0\r\n x=a\r\n y=b\r\n while x<n and y>=0:\r\n if x+y==n-1:\r\n i+=1\r\n x+=1\r\n y-=1\r\n elif x+y<n-1:\r\n x+=1\r\n else:\r\n y-=1\r\n return i\r\nt=[int(po) for po in input().split()]\r\nprint(dragon(t))\r\n\r\n\r\n\r\n", "#124A - The number of positions\r\n[a,b,c]=list(map(int,input().split()))\r\nif b+1>=a-c:\r\n print(a-b)\r\nelse:\r\n print(c+1)", "import os\r\nimport sys\r\nimport time\r\n\r\nDEBUG = os.getenv(\"_DEBUG\")\r\nif DEBUG:\r\n input = open(\"cmake-build-debug/input.txt\", \"r\").readline\r\n # sys.stdout = open(\"output.txt\", 'w')\r\n\r\n\r\ndef main(tc):\r\n n, a, b = map(int, input().split())\r\n ans = 0\r\n for i in range(1, n + 1):\r\n if i-a >= 1 and i+b >= n:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n start_time = time.time()\r\n T = 1\r\n # T = int(input())\r\n for tc in range(T):\r\n main(tc)\r\n if DEBUG:\r\n print(\"\\n--- %s ms ---\" % ((time.time() - start_time) * 1000))\r\n", "x=(input().split())\r\ni=0\r\nnpeople=int(x[0])\r\nanolessthan=int(x[1])\r\nbnogreaterthan=int(x[2])\r\nposition=npeople-max(anolessthan+1,npeople-bnogreaterthan)+1\r\nprint(position)\r\n\r\n \r\n", "from sys import stdin, stdout \r\nn, a, b = map(int, stdin.readline().strip().split())\r\nleft = n - a \r\nif b>=left:\r\n output = left \r\nelse:\r\n output = b+1 \r\nstdout.write(f\"{output}\\n\")", "def res(n,a,b):\n t = a+b\n if t<n:\n return b+1\n elif t==n:\n return b\n else:\n return n-a\n \n#main function\n\nn,a,b = map(int,input().split())\nprint(res(n,a,b))\n \t \t\t \t \t\t\t \t \t\t\t\t \t \t \t \t\t", "i=input().split()\r\nn=int(i[0])\r\na=int(i[1])\r\nb=int(i[2])\r\nif n-(b+1)>=a:\r\n print(b+1)\r\nelse:\r\n print((b+1)-(a-(n-(b+1))))\r\n", "nab=list(map(int,input().split()))\r\nn=nab[0]\r\na=nab[1]\r\nb=nab[2]\r\nn=n-a\r\nb=b+1\r\n\r\nif(n>= b):\r\n print(b)\r\n\r\nelse:\r\n print(n)", "# 6 2 3\n# XXOOO, XXOOOO, XOOOOO, OOOOO\n\nn, a, b = map(int, input().split())\n\nif a + b < n:\n print(b + 1) # ahead -> (n - b)~, choose 0~b people behind\nelse:\n print(n - a) # behind -> ~(n - a), choose a~n people ahead\n", "a,b,c=map(int,input().split())\r\nx=min(a-b,c+1)\r\nprint(x)", "from math import factorial\r\n\r\nn, a, b = list(map(int, input().split(\" \")))\r\n\r\nfront_positions = range(a + 1, n + 1)\r\nback_positions = range(n, n - b - 1, -1)\r\n\r\nans = 0\r\nfor i in front_positions:\r\n if i in back_positions:\r\n ans += 1\r\n\r\nprint(ans)", "n,a,b=map(int,input().split())\r\ncount=0\r\nfor i in range(a+1,n+1):\r\n if((n)-i<=b):\r\n count=count+1\r\nprint(count)\r\n\r\n", "n,a,b = [int(x) for x in input().split()]\n\ncount = 0\nif n-(a+b)>0:\n y = b\n x = n-y-1\n p = x+1\nelse:\n x = a\n y = n-x-1\n p = x+1\n\nwhile x<n:\n if y<0:\n break\n if y<=b:\n count += 1\n x += 1\n y = n-x-1\n p = x+1\n\n\nprint(count)\n\n\t\t \t \t\t\t \t\t \t \t \t\t \t \t \t\t", "# https://codeforces.com/problemset/problem/124/A\n\nn, front, back = [int(num) for num in input().split()]\n\nprint(min((n-front),(back+1)))", "n, min_in_front, max_behind = map(int, input().split())\r\n\r\nmax_in_front = n - 1\r\nmin_in_front = max(min_in_front, n - (1 + max_behind))\r\nprint(max_in_front - min_in_front + 1)\r\n", "n, a, b = map(int, input().split())\r\nans = n - a\r\nif ans >= b + 1:\r\n print(b + 1)\r\nelse:\r\n print(n - a)", "a,b,c=list(map(int,input().split()))\r\nprint(min(a-b,c+1))", "pos = input().split()\r\npos[0] = int(pos[0])\r\npos[1] = int(pos[1])\r\npos[2] = int(pos[2])\r\nk = pos[0] - pos[1]\r\nk2 = pos[2] + 1\r\nprint(min(k, k2))\r\n", "n,a,b=map(int,input().split())\r\nprint(min((n-a),(b+1)))", "n, a, b =map(int,input().split())\r\n#d=dict(input().split() for _ in range(m))\r\n\r\nc = min(n-1-a, b)+1\r\n\r\nprint(c)\r\n\r\n", "import math \r\nn=[int(x) for x in input().split()]\r\nprint(min(n[0]-n[1],n[2]+1))", "n, a, b = map(int, input().split())\nans = 0\nfor i in range(a + 1, n + 1):\n if n - i <= b:\n ans+=1\nprint(ans)\n", "# LUOGU_RID: 97391063\n\r\n\r\nn,a,b = map(int, input().split())\r\n\r\nprint(min(n-a, b+1))\r\n", "a=[int(s) for s in input().split()]\r\nprint(min(a[0]-a[1],a[2]+1))", "n,a,b = map(int,input().split())\r\nnumber = 1\r\nanser = 0\r\nwhile number <= n:\r\n if number - a > 0 and n - number <= b:\r\n anser += 1\r\n number += 1\r\nprint(anser)", "n, a, b = map(int, input().split())\r\ncnt=0\r\nfor i in range(n):\r\n if i>=a and n-i-1<=b:\r\n cnt+=1\r\nprint(cnt)\r\n# print(n-max(a+1 , n-b)+1)\r\n", "n = list(map(int, input().split()))\r\n\r\nnn = n[0]\r\na = n[1]\r\nb = n[2]\r\n\r\nprint(nn-max(a,(nn-b-1)))\r\n\r\n", "n = input()\r\nh = [int(i) for i in n.split() if i.isdigit()]\r\np1 = 1 + h[1]\r\np2 = h[0]-h[2]\r\nprint(h[0] - max(p1,p2)+1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "a, b, c = map(int, input().split())\r\nd = a-b-c\r\nif d <= 1:\r\n print(a-b)\r\nelse:\r\n print(a-b-d+1)\r\n\r\n", "l=list(map(int,input().split()))\r\nprint(l[0]-max(l[1]+1,l[0]-l[2])+1)", "n, a, b = list(map(int, input().split(' ')))\r\ncount = 0\r\ni = a + 1\r\nwhile i <= n:\r\n front = i - a\r\n back = i + b\r\n if back >= n:\r\n count += 1\r\n i += 1\r\n\r\nprint(count)\r\n", "n,a,b=map(int,input().split())\r\nprint(n-max(a+1,n-b)+1)", "n,a,b = input().split()\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\nsol = 0\r\nfor i in range(1,n+1):\r\n if i > a and i >= n-b:\r\n sol += 1\r\nprint(sol)", "n,a,b= map(int,input().split())\r\nprint(min(n-a,b+1))", "n,a,b=[int(x) for x in input().split()]\r\nif a+b<n: print(b+1)\r\nelse: print(n-a)", "# your code goes here\r\nn,a,b=map(int,input().split())\r\n# atleast a in front of him\r\n# atmost b in back of him\r\nprint(n-max(a+1,n-b)+1)", "n , a , b = map(int,input().split())\r\nif a + b >= n:\r\n print(n - a)\r\nelse:\r\n print(b + 1)", "def possible_spots(n, x, y):\n # range of all positions according to people ahead\n people_ahead = range(x+1, n+1)\n # range of positions according to people behind\n people_behind = range(n-y, n+1)\n\n # Intersection of the two ranges \n spots = len(set(people_ahead) & set(people_behind))\n \n return spots\n\ndef main():\n #read input\n n, x, y = map(int, input().split())\n\n print(possible_spots(n, x, y))\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", "n, a, b = map(int, input().split())\r\nprint (n - max(a + 1, n - b) + 1)", "a=input().split()\r\nb=[int(i) for i in a]\r\nc=[i for i in range(b[1],b[0])]\r\nd=[i for i in range(b[0]-b[2]-1,b[0])]\r\nco=0\r\nfor i in c:\r\n if i in d:\r\n co+=1\r\nprint(co)\r\n\r\n \r\n", "n,a,b = map(int, input().split())\r\nif n-a-b>=2:\r\n print (b+1)\r\nelse:\r\n print (n-a)", "n, a, b = list(map(int,input().split()))\r\nnum = 0\r\nfor i in range(1, n + 1):\r\n if i - a - 1 >= 0 and n - i <= b:\r\n num += 1\r\nprint(num)", "(num_people, ahead, behind) = list(map(int, input().split(\" \")))\r\nmin_start = ahead + 1 # ex. positions are if there are 5 people, 2 ahead makes position at 3\r\nmin_end = num_people - behind\r\nif min_start >= min_end:\r\n print(num_people - min_start + 1)\r\nelse:\r\n print(num_people - min_end + 1)", "def solve(n,a,b):\r\n if a+b>=n:return(n-a)\r\n else:return(1+b)\r\nn,a,b=map(int,input().split(\" \"))\r\nprint(solve(n,a,b))", "n, a, b = map(int, input().split())\r\nres = 0\r\nfor x in range(n + 1):\r\n\tfor y in range(b + 1):\r\n\t\tif a + x + 1 + b - y == n:\r\n\t\t\tres += 1\r\nprint(res)", "a,b,c=map(int,input().split())\r\nprint(min((a-b),c+1))", "n,a,b=(int(x) for x in input().split())\r\nc1=n-a\r\nc2=n-a-1-b\r\nif(c2>0):\r\n print(c1-c2)\r\nelse:\r\n print(c1)", "n,a,b = map(int,input().split())\r\nc = min(n-a,b+1)\r\nprint(c)", "n, a, b = map(int, input().split())\nif n - (a + b) > 1:\n a += n - (a + b) - 1\nprint(n - a)\n", "n,a,b=map(int,input().split())\r\nprint(min(n-a,b+1))", "n,a,b = map(int,input().split())\r\ncount = 0\r\nfor i in range(a,n+1):\r\n if n-i-1 <= b and (n-i-1)>=0:\r\n count +=1\r\nprint(count)", "a,b,c = map(int,input().split())\nif(b+c<a and c!=0):\n print((a-(a-b-c))-b+1)\n\nelse: print(a-b)\n\t \t\t\t \t\t\t\t \t \t \t\t \t\t \t \t", "(a,b,c)=[int(x) for x in input().split()]\r\nprint(min(a-b,c+1))", "from sys import stdin, stdout\ninput = stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n\tstdout.write(sep.join(map(str, args)) + end)\ndef int_map():\n\treturn map(int, input().split())\ndef list_int():\n\treturn list(map(int, input().split()))\n\n\n\n\nn, a, b = int_map()\n\nfront = [i for i in range(a, n)]\nback = [i for i in range(b+1)]\ntarget = n - 1\ncnt = 0\nfor i in front:\n\tif target - i in back:\n\t\tcnt += 1\n\nprint(cnt)\n\n\n\n\n\n", "'''\nat least a people in front of him -> No less than a people standing in front of him\nat most b people behind him -> No more than b people standing behind him\n1 - 2 - 3 - 4 - 5\n\n\n'''\n\n\nimport sys\n\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\ndef main():\n\n n, a, b = get_ints()\n counter = 0\n for i in range(n):\n if (i+1 > a) and (n-(i+1) <= b):\n counter += 1\n \n print(counter)\n\n\n\nif __name__ ==\"__main__\":\n main()\n", "n,a,b=map(int,input().split())\r\ndiff=n-b\r\nif diff>a:print(b+1)\r\nelse:print(n-a)", "import os\r\nimport sys\r\nfrom sys import stdin, stdout\r\nfrom io import BytesIO, IOBase\r\n# from itertools import permutations, combinations, accumulate\r\n# from math import sqrt, gcd, floor, ceil, log2\r\nmod = int(1e9)+7\r\n\r\nintn = lambda : int(stdin.readline())\r\nstrs = lambda : stdin.readline()[:-1]\r\nlstr = lambda : list(stdin.readline()[:-1])\r\nmint = lambda : map(int, stdin.readline().split())\r\nlint = lambda : list(map(int, stdin.readline().split()))\r\nout = lambda x: stdout.write(str(x)+\"\\n\")\r\nout_ = lambda x: stdout.write(str(x)+\" \")\r\n\r\ndef main():\r\n n,a,b = mint()\r\n out(min(n-a, b+1))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,a,b=map(int,input().split())\r\nl=[f\"x{i}\" for i in range(n)]\r\ng=set(l[a:])\r\nh=set(l[n-b-1:])\r\nprint(len(g.intersection(h)))\r\n \r\n\r\n\r\n", "a,m,n=map(int,input().split())\r\nif m+n>=a:\r\n print(a-m)\r\nelse:\r\n print(n+1)", "n, a, b = list(map(int,input().split()))\r\nprint(min(n-a,b+1))", "n,a,b=map(int,input().split())\r\ns=0\r\nc=0\r\nfor i in range(a+1,n+1):\r\n if(n-i<=b):\r\n c=c+1\r\nprint(c)\r\n ", "n,a,b=map(int,input().split())\r\nif a+b+1<=n:\r\n print(b+1)\r\nelse:\r\n print(n-a)", "n,a,b=[int(x) for x in input().split()]\r\nres=0\r\nfor i in range(0,n+1):\r\n if i>a and i>=n-b:\r\n res+=1\r\nprint(res)", "a = list(map(int,input().split()))\r\nprint(a[0]-max(a[1]+1,a[0]-a[2])+1)", "def main():\n take = input().split()\n num_people = int(take[0])\n min_before = int(take[1])\n max_after = int(take[2])\n maximum = num_people\n minimum = max(min_before + 1, num_people - max_after)\n print(maximum-minimum + 1)\nmain()\n", "# https://codeforces.com/problemset/problem/124/A\r\n\r\nn, a, b = map(int, input().split())\r\nres = n - max(a + 1, n - b) + 1\r\nprint(res)", "n,a,b = map(int,input().split())\r\n\r\ns1 = { i for i in range(n-b,n+1)}\r\ns2 = {i for i in range(a+1,n+1)}\r\n\r\nprint(len(s1.intersection(s2)))", "n, a, b = map(int, input().split())\r\npos_a = [i for i in range(1, n-a+1)]\r\npos_b = [i for i in range(1, b+1)]\r\nposition = [i for i in pos_a if i not in pos_b]\r\nif len(position) == 0:\r\n print(n-a)\r\nelse:\r\n print(position[0])\r\n", "n,a,b = map(int,input().split())\r\nx = n-a\r\ny = b+1\r\nprint(min(x,y))", "v1,v2,v3=map(int,input().split())\r\nc=min(v1-v2,v3+1);print(c)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-23 23:04:30\nLastEditTime: 2021-11-23 23:05:54\nDescription: The number of positions\nFilePath: CF124A.py\n'''\n\n\ndef func():\n n, a, b = map(int, input().strip().split())\n print(min(n - a, b + 1))\n\n\nif __name__ == '__main__':\n func()\n", "n,a,b=[int(_) for _ in input().split()]\r\nprint(min(n-a,b+1))", "n,a,b=map(int,input().rstrip().split());print(min(n-a,b+1))\r\n", "n, a, b = map(int, input().split())\n\nn -= a\nn = min(n, b + 1)\nprint(f\"{n}\")\n\n# 1 2 3 4 5\n# b b b a a\n\n\t \t\t\t \t \t \t \t\t\t\t \t \t\t\t\t \t \t \t", "n,a,b = map(int,input().split())\r\nx = n+1 - (max(n-b,a+1))\r\nprint(x)", "n, a, b = map(int, input().split())\r\n\r\nres = 0\r\nfor pos in range(n, 0, -1):\r\n if n - pos <= b and pos - 1 >= a:\r\n res += 1\r\nprint(res)", "n, a, b = [int(i) for i in input().split()]\r\n\r\npos = 1\r\n\r\nfor i in range(1, n):\r\n if a + i <= n - 1 and b - i >= 0:\r\n pos += 1\r\n else:\r\n break\r\n\r\nprint(pos)", "l=list(map(int,input().split()))\r\nn,a,b=l[0],l[1],l[2]\r\nprint(n+1-max(a+1,n-b))", "n,a,b = map(int,input().split())\r\nprint (min(n-a,b+1))", "n, x, y = map(int, input().split(\" \"))\nprint(min(n - x, y + 1))\n \t \t\t \t \t\t\t\t\t \t\t \t\t \t\t", "n, a, b = map(int, input().split())\r\nprint(b+1 if b+a<=n-1 else n-a)\r\n", "a,b,c=list(map(int,input().split()))\r\nd=a-b\r\nk=0\r\nfor i in range(1,d+1):\r\n if d-i<=c:\r\n k=k+1\r\nprint(k) \r\n", "n,a,b=map(int,input().split())\r\nans=n-max(a+1,n-b)\r\nans=ans+1\r\nprint(ans)", "from posixpath import split\r\n\r\n\r\nn, a, b = [int(i) for i in input().split()]\r\nprint((n - a) if (n - a) < (b + 1) else (b + 1))\r\n", "def findPosition(n, f, b):\n \n return n - max(f + 1, n - b) + 1;\n \na = input()\nn, f, b = a.split(\" \")\nprint(findPosition(int(n), int(f), int(b)))\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\n\r\n# import re\r\n# import string\r\n\r\n# import math\r\n# import statistics\r\n# import itertools\r\n# import collections\r\n# import cmath\r\n# import calendar\r\n# import datetime\r\n\r\n# import operator\r\n\r\n#----------Profiling----------\r\n# import cProfile\r\n# import pstats\r\n\r\nn, a, b = map(int, input().split())\r\np = set(i for i in range(a+1, n+1))\r\nq = set(i for i in range(n-b, n+1))\r\nprint(len(p.intersection(q)))\r\n", "n,a,b = map(int,input().split())\r\n\r\nminPos = max(a+1,n-b)\r\nmaxPos = n\r\nprint(maxPos-minPos+1)", "n,a,b=list(map(int,input().split()))\r\nprint(n-max(n-b,a+1)+1)", "n,a,b=map(int,input().split());print(min(n-a,b+1))\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", "n,a,b=map(int,input().split())\r\nres=n-a\r\nif res>b:\r\n print(b+1)\r\nelse:\r\n print(res)", "######################################################\n# #\n# LEO's Arena #\n# #\n######################################################\n\n\nimport math\nfrom collections import Counter\nimport random\n\n\ndef isSubSequence(string1, string2, m, n):\n # Base Cases\n if m == 0:\n return True\n if n == 0:\n return False\n\n # strings are matching\n if string1[m - 1] == string2[n - 1]:\n return isSubSequence(string1, string2, m - 1, n - 1)\n\n # If last characters are not matching\n return isSubSequence(string1, string2, m, n - 1)\n\n\ndef Log2(x):\n if x == 0:\n return False\n\n return math.log10(x) / math.log10(2)\n\n\ndef isPowerOfTwo(n):\n return math.ceil(Log2(n)) == math.floor(Log2(n))\n\n\ndef nearest_power_of_two(n):\n power = math.floor(math.log2(n))\n return power\n\n\ndef custom_sort(s, priority_str):\n priority_map = {ch: idx for idx, ch in enumerate(priority_str)}\n return \"\".join(sorted(s, key=lambda x: priority_map.get(x, len(priority_str))))\n\n\ndef get_column(arr, col_index):\n return [row[col_index] if col_index < len(row) else None for row in arr]\n\n\n# chr(96 + int(i))\n\n\n# t = int(input())\nt = 1\n# # n, m = map(int, input().split())\n# # a = list(map(int, input().split()))\n# # a.sort()\nmain_list = []\nflag = False\ntemp_count = 0\n\n\nwhile t != 0:\n n, a, b = map(int, input().split())\n print(min(n - a, b + 1))\n t -= 1\n", "n,a,b=map(int,input().split())\r\ni2=n-1-b\r\ns=max(i2,a)\r\nprint(n-s)", "n=list(map(int,input().split()))\r\nprint(min(n[0]-n[1],n[2]+1))\r\n", "n,a,b=[int(x) for x in input().split()]\r\n#a=n[1:]\r\n#n=n[0]\r\ni=0\r\nwhile b >= 0:\r\n if (n-b-1) >= a:\r\n i=i+1 \r\n a=a+1 \r\n\r\n b=b-1\r\n \r\n \r\nprint(i)\r\n\r\n\r\n", "# Input\r\nn, a, b = map(int, input().split())\r\n\r\n# Calculate the number of valid positions\r\nvalid_positions = n - max(a + 1, n - b) + 1\r\n\r\n# Output the result\r\nprint(valid_positions)\r\n", "n , a , b = map(int, input().split())\r\n\r\nprint(min((n-a),(b+1)))", "def findPosition(n, f, b):\n \n return n - max(f + 1, n - b) + 1;\n\nnums = input()\na,b,c = map(int, nums.split())\nprint(findPosition(a,b,c))\n \t \t\t \t \t \t \t\t \t \t\t\t", "n,a,b=map(int,input().split())\r\nif b+1>n-a:\r\n print(n-a)\r\nelse:\r\n print(b+1)", "a, n, m = [int(i) for i in input().split()]\r\nprint(min(a-n, m+1))\r\n", "n,a,b = list(map(int,input().split()))\r\nprint(min(b + 1,n - a))", "m=input('')\r\nn=int(m.split(' ')[0])\r\na=int(m.split(' ')[1])\r\nb=int(m.split(' ')[2])\r\nif n<=a+b+1:\r\n print(n-a)\r\nelse:\r\n print(b+1)\r\n ", "n, a, b = map(int, input().split())\n\npossibility = min(n - a, b + 1)\nprint(possibility)\n\n \t\t \t\t \t\t\t\t \t \t \t \t \t", "import sys\r\n\r\n\r\ndef main():\r\n n, a, b = map(int, input().split())\r\n if a+b>=n:\r\n print(n-a)\r\n else:\r\n while n != a + b:\r\n a += 1\r\n print(n - a + 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "ls = input().split(\" \")\r\nn = int(ls[0])\r\na = int(ls[1])\r\nb = int(ls[2])\r\n\r\nif(b < (n-a)):\r\n print(b+1)\r\nelse:\r\n print(n-a)\r\n", "\r\n\r\nn, a, b = input().split(\" \")\r\nn, a, b = int(n), int(a), int(b)\r\n\r\nif(n>=a):\r\n if(n-(b+2)>=a):\r\n print(b+1)\r\n else:\r\n print(n-a)\r\nelse:\r\n print(0)\r\n", "n , a , b = map(int , input().split())\r\nprint(n - max(a + 1 , n - b) + 1)", "n,a,b = map(int, input().split())\r\nif n-a-1 > b:\r\n print(n-a-(n-a-1-b))\r\nelse:\r\n print(n-a)", "n, a, b = map(int, input().split())\r\nbase = a + 1\r\nwhile n - base > b:\r\n base += 1\r\nans = n - base + 1\r\nprint(ans)", "\r\n\r\ndata = [int(x) for x in input().split()]\r\n\r\nscope = data[0]-data[1]\r\npositions = 1+data[2]\r\n\r\nif scope > positions:\r\n print(positions)\r\nelse:\r\n print(scope)\r\n\r\n\r\n\r\n", "n = list(map(int,input().split()))\r\n#n = n[0] // a = n[1] // b = n[2]\r\nprint(min(n[0]-n[1],n[2]+1))", "n, l, r = map(int, input().split())\r\nl, r = l, n - r\r\nb = []\r\nfor i in range(1, n + 1):\r\n if i > l and i >= r:\r\n b.append(i)\r\nprint(len(b))\r\n", "n_a_b = input().split()\nn = int(n_a_b[0])\na = int(n_a_b[1])\nb = int(n_a_b[2])\n\nif n - b > a: \n print(b + 1)\nelif n - b == a:\n print(b)\nelse:\n print(n - a)\n", "n,a,b = tuple(map(int,input().split()))\r\nprint(min(n-a, b+1))", "n, a, b= map(int, input().split())\r\nnum = n - max(a + 1, n - b) + 1\r\nprint(num)", "def process():\r\n n, a, b = list(map(int, input().split()))\r\n return min(n - a, b + 1)\r\n \r\nprint(process())", "a,b,c=list(map(int,input().split()))\r\nprint(min(a - b, c + 1))", "n,a,b=map(int,input().split())\r\nif n-a>=b+1:\r\n print(b+1)\r\nelse:\r\n print(n-a)", "n, a, b = input().split()\r\nn, a, b=int(n), int(a), int(b)\r\n\r\nif a +b<n-1:\r\n ans = n-a-((n-a)-(b+1))\r\nelse:\r\n ans = n-a\r\n\r\nprint(ans)\r\n", "def main():\n n, a, b = list(map(int, input().split(' ')))\n print(min(n - a - 1, b) + 1)\n\n\nif __name__ == \"__main__\":\n main()\n", "n, a, b = map(int, input().split())\r\nres = n - a - 1\r\nprint(b + 1) if res > b else print(res + 1)", "n, a, b = tuple(map(int, input().split()))\nc = 0\nfor i in range(1, n + 1):\n if i > a and abs(i - n) <= b:\n c += 1\n\nprint(c)\n", "x, y, z = map(int, input().split())\r\nresult = min(x - y, z + 1)\r\nprint(result)\r\n", "n, a, b = map(int, input().split())\n\nk = (n-a)\nl = (b+1)\n\nif k > l:\n print(l)\nelse:\n print(k)", "n,a,b=map(int,input().split())\r\nout=min(n - a, b + 1)\r\nprint(out)", "n, a, b = list(map(int, input().split()))\r\nprint(n-max([a+1,n-b])+1)", "n,a,b=map(int,input().split())\r\nx=a\r\nif(n-x<=b):\r\n print(n-x)\r\nelse:\r\n print(b+1)", "n, a ,b = map(int, input().split())\r\n\r\n\r\nif(a+b<n):\r\n\tif(n-a>b):\r\n\t\tprint(b+1) \r\n\r\nelse:\r\n\tprint(n-a)", "n, a, b = map(int, input().strip().split())\np = max(a, n-b-1)\nprint(n-p)\n\n\t \t \t \t \t\t \t \t\t\t\t \t \t \t", "n,a,b = map(int,input().split())\r\nc = n-a\r\nprint(min(b+1,c))", "n,a,b=map(int,input().split())\r\n#infront>=a behind<=b\r\n#a+b+1>=n\r\n#a>=n-1-b\r\n#x+y=n-1\r\ncount=0\r\nj=0\r\nfor i in range(b+1):\r\n if n-1-i>=a:\r\n count+=1\r\n else:\r\n j=i-1\r\n break\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\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\nimport math as mt\r\nfrom math import ceil as cl\r\nfrom math import log2 as l2\r\nmod = 10**9 + 7 \r\ndef ii():\r\n return int(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return list(map(str, input().split()))\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nn,a,b = lii()\r\nprint(n-max(a+1,n-b)+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", "# t = int(input())\nt = 1\n\n\n\ndef cp():\n # code here\n n,a,b = tuple(map(int,input().split()))\n if a+b == n:\n print(b)\n elif a+b > n:\n print(n-a)\n else:\n print(b+1)\n\n \n\n\nfor i in range(t):\n cp()\n", "n, a, b = map(int,input().split())\r\n\r\n\r\nlst = [i for i in range(n)]\r\nwhile lst[-1] - lst[a] > b:\r\n a += 1\r\n\r\npos = lst[-1] - lst[a] + 1\r\nprint(pos)\r\n", "n, a, b = map(int, input().split())\r\nresult = min(n-a, b+1)\r\nprint(result)\r\n", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nn, a, b = map(int, inpu().split())\r\nans = min(n - a, b + 1)\r\nprin(f\"{ans}\\n\")", "n, before, after = map(int, input().split())\r\na = n - before\r\nif after > a:\r\n print(a)\r\nelif after == a:\r\n print(after)\r\nelif a > after:\r\n print(after + 1)", "a,b,c=map(int,input().split())\r\nv=a-b\r\nif(v>c):\r\n print(c+1)\r\nelse:\r\n print(v)", "n, a,b = list(map(int, input().split()))\r\nprint(min((n-a),b+1))", "n,a,b=map(int,input().split())\r\ncount = 0\r\nfor i in range(1,n+1):\r\n if a<=i-1 and b>=n-i:\r\n count += 1\r\nprint(count)", "n,a,b=map(int,input().split())\r\nif n-a>b+1:\r\n\tprint(b+1)\r\nelse:\r\n\tprint(n-a)", "n,a,b=map(int,input().split())\r\nif b+1<=n-a:print(b+1)\r\nelse:print(n-a)\r\n", "n,a,b = map(int, input().split()) #no less than a ppl in front, no more than b ppl behind\r\n#constraints = m >= a, p <= b and len(m) + len(p) - 1 == n\r\nprint(n-max(a+1,n-b)+1)", "n,a,b = list(map(int, input().split()))\r\n\r\na = n-a\r\n\r\nprint(min(a,b+1))", "n,a,b = input().split()\r\nc = 0\r\nwhile int(b)>=0:\r\n if (int(n)-int(b))>int(a):\r\n c = c+1\r\n b = int(b)-1\r\nprint(c)\r\n", "n,a,b=map(int,input().split())\r\nprint(min(b+1,n-a))", "def tvs():\r\n\r\n n,a,b = [int(x) for x in input().split()]\r\n print(min(n-a,b+1))\r\n\r\n\r\n\r\ntvs() \r\n", "n,a,b=map(int,input().split())\r\nsayac=0\r\nfor i in range(a+1,n+1):\r\n if n-i<=b:\r\n sayac=sayac+1\r\nprint(sayac)\r\n", "n, a, b = list(map(int, input().split()))\n\nans = 0\nfor x in range(a + 1, n + 1):\n if n - x <= b:\n ans += 1\nprint(ans)\n", "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\nfor _ in range(1):#int(input())):\r\n n, a, b = map(int, input().split())\r\n print(n - max(a+1, n-b) + 1)", "n , a , b = map(int , input().split())\r\nx = min(n - a , b+1)\r\nprint(x)", "n,a,b=map(int,input().split())\r\nif(n>=1+a+b):\r\n print(1+b)\r\nelse:\r\n print(n-a)", "n,a,b=list(map(int,input().split()))\r\nx=max(a+1,n-b)\r\nans = n-x+1\r\nprint(ans)\r\n", "n,a,b=map(int, input().split())\r\ncount=0\r\nfor i in range(n-a):\r\n if n-(a+i+1)<=b:\r\n count+=1\r\nprint(count)\r\n", "x=list(map(int,input().split()))\r\nif x[1]+x[2]>=x[0]:\r\n print(x[0]-x[1])\r\nelse:\r\n print(x[2]+1)\r\n", "nab = input()\r\nnab = nab.split(\" \")\r\nn = int(nab[0])\r\na = int(nab[1])\r\nb = int(nab[2])\r\n\r\nposition = n-a\r\n\r\nif position - b > 1:\r\n position -= ((position - b)-1)\r\nprint(position)", "def main():\n n, a, b = map(int, input().split())\n s = []\n res = 0\n for x in range(n):\n s.append(x)\n for x in range(a, n):\n if x >= n - b - 1:\n res += 1\n print(res)\n\n\nt = 1\n# t = int(input())\nwhile t:\n main()\n t-=1", "\r\nn,a,b=map(int,input().split())\r\nc=max(a+1,n-b)\r\nprint(n-c+1)", "n, a, b = map(int, input().split())\r\nif b == 0 or a == n:\r\n print(1)\r\nelse:\r\n x = n - a - 1\r\n if x > b:\r\n print(b + 1)\r\n else:\r\n print(n - a)", "n,a,b=map(int,input().split())\r\nc=max(a+1,n-b)\r\nprint((n-c)+1)", "lst = input().split(\" \")\r\nlst = [int(elem) for elem in lst]\r\n\r\n\r\ndef fun(a, b, c):\r\n if a - b - c - 1 < 0:\r\n return a - b\r\n else:\r\n return c + 1\r\n\r\n\r\nprint(fun(lst[0], lst[1], lst[2]))\r\n", "n , a , b = map(int, input().split())\r\nans = 0 \r\nfor i in range(1,n+1): \r\n ahead = i-1\r\n behind= n -i \r\n if ahead>= a and behind<=b : \r\n ans +=1 \r\nprint(ans)", "r = input().split(' ')\r\nprint(int(r[0]) - max(int(r[1])+1,int(r[0])-int(r[2])) +1 )", "n,a,b=map(int, input().split())\r\nprint(min(n-a, b+1))\r\n", "i = input()\r\ns = \"\"\r\nli = []\r\nfor l in i:\r\n s += l\r\n if l == \" \":\r\n li.append(s)\r\n s = \"\"\r\nn = int(li[0])\r\na = int(li[1])\r\nb = int(s)\r\n\r\nwhile n - a - b >= 2:\r\n n = n - 1\r\n\r\nprint(n - a)", "lst = input().split(\" \")\r\nlst = [int(elem) for elem in lst]\r\ndef fun(a,b,c):\r\n if a - b -c -1 < 0:\r\n return a - b\r\n else:\r\n return a - b -a + b + c + 1\r\nprint(fun(lst[0], lst[1], lst[2]))\r\n", "import 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\nn, a, b = invr()\r\n\r\n\r\nminP = n - a\r\n\r\n# minP = minP - b\r\n\r\nprint(b + 1 if minP > b else minP)\r\n", "n,a,b = map(int,input().split())\r\nprint(min(n-a,b+1))", "n, a, b = map(int, input().split())\r\nprint(n-(max(a+1, n-b))+1)", "n,a,b=map(int,input().split())\r\nx=[0]*n\r\nfor i in range(1,n+1):\r\n if (i>a) and ((n-i)<=b):\r\n x[i-1]=1\r\nprint(x.count(1))", "n,a,b= map(int,input().split())\r\nways=0\r\nif a+b+1==n:\r\n \r\n while b>=0:\r\n ways+=1\r\n b-=1\r\n a+=1\r\nelif a+b+1<n:\r\n while a+b+1<n:\r\n a+=1\r\n while b>=0:\r\n ways+=1\r\n b-=1\r\n a+=1\r\nelse:\r\n while a+b+1>n:\r\n b-=1\r\n while b>=0:\r\n ways+=1\r\n b-=1\r\n a+=1\r\n \r\nprint(ways)\r\n\r\n", "x,y,z=map(int,input().split())\r\nprint(min((x-y),(z+1)))", "\"\"\"\r\n $$$$$ $$$$$ $$$$$$ $ $\r\n $ $ $ $ $ $$ $$\r\n $ $ $ $ $$$$$ $ $$ $\r\n $$$$$ $$$$$ $ $ $\r\n $ $ $ $ $ $\r\n $ $ $ $$$$$$ $ $\r\n \"\"\"\r\nl = [int(i) for i in input().split()]\r\nans=0\r\nfor i in range(l[0]):\r\n if i>=l[1]:\r\n if l[0]-(i+1)<=l[2]:\r\n ans+=1\r\nprint(ans)", "n,a,b = map(int, input().split())\r\n\r\ndef f(x):\r\n if x > n:\r\n return 0\r\n else:\r\n if x-1 >= a and n-x <= b:\r\n return f(x+1) + 1\r\n else:\r\n return f(x+1)\r\n\r\nprint(f(1))", "n,a,b = map(int,input().split())\r\nj = 0\r\nfor i in range(n-b,n+1):\r\n\tif i >= a+1:\r\n\t\tj+=1\r\nprint(j)", "n,a,b=map(int,input().split())\r\nprint(b+1 if a<n-b-1 else n-a)\r\n", "n,a,b=map(int,input().split())\r\nk=n-a\r\ns=b+1 \r\nprint(min(k,s))", "\r\n\r\n\r\ndef num_positions():\r\n\r\n n,a,b = map(int,input().split())\r\n\r\n\r\n start = 1\r\n end =n\r\n count = 0\r\n for i in range(1,n + 1):\r\n before = i - 1\r\n after = n -i\r\n\r\n if before >= a and after <= b:\r\n count += 1\r\n\r\n print(count)\r\n\r\n\r\n\r\nnum_positions()\r\n", "n, a, b = map(int, input().split())\ncount = 0\nfor i in range(a, n):\n if n-i-1 > b:\n pass\n else:\n count += 1\n\nprint(count)\n" ]

[ "input()\ny = list(map(int, input().split()))\n\n\ndef check(d):\n return len(set(j - d * i for i, j in enumerate(y))) == 2\n\n\nd = (y[2] - y[0]) / 2, y[1] - y[0], y[2] - y[1]\n\nprint('yes' if any(check(dx) for dx in d) else 'no')\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nslope= (l[n-1]-l[0])/(n-1)\r\nf=0\r\nfor j in range(1,n-1):\r\n if (((l[j]-l[0])/(j))!= slope):\r\n f=1\r\n break\r\nif (f==0):\r\n print ('No')\r\nelse:\r\n flag=0\r\n for i in range(1,n-1):\r\n s= (l[i]-l[0])/i\r\n l1=[]\r\n for j in range(n):\r\n l1.append(0)\r\n l1[0]=1\r\n l1[i]=1\r\n l2=[]\r\n for j in range(i+1,n):\r\n if ((l[j]-l[0])/j ==s):\r\n l1[j]=1\r\n if (l1.count(0)==1):\r\n print (\"Yes\")\r\n flag=1\r\n break\r\n else:\r\n for j in range(n):\r\n if (l1[j]==0):\r\n l2.append([l[j],j])\r\n length=len(l2)\r\n s1= (l2[-1][0]-l2[0][0])/(l2[-1][1]-l2[0][1])\r\n if (s1!=s):\r\n continue\r\n else:\r\n check=0\r\n for j in range(1,length-1):\r\n if ( ((l2[j][0]-l2[0][0])/(l2[j][1]-l2[0][1]))!=s1 ):\r\n check=1\r\n break\r\n if (check==1):\r\n continue\r\n else:\r\n print ('Yes')\r\n flag=1\r\n break\r\n if (flag==0):\r\n if (n==3):\r\n print ('Yes')\r\n flag=1\r\n else:\r\n s= (l[-2]-l[1])/ (n-3)\r\n if (s==slope):\r\n check=0\r\n for i in range(2,n-2):\r\n if ( ((l[i]-l[1])/(i-1))!=s):\r\n check=1\r\n break\r\n if (check==0):\r\n print ('Yes')\r\n flag=1\r\n if (flag==0):\r\n s= (l[-1]-l[1])/(n-2)\r\n check=0\r\n for i in range(2,n-1):\r\n if ( ((l[i]-l[1])/(i-1))!=s ):\r\n check=1\r\n break\r\n if (check==0):\r\n print ('Yes')\r\n else:\r\n print ('No')", "n=int(input())\r\na=list(map(int,input().split()))\r\nflag=0\r\nfor i in range(1,n):\r\n k=set()\r\n xdif=i\r\n ydif=a[i]-a[0]\r\n k.add(a[0]*xdif)\r\n for j in range(n):\r\n k.add(a[j]*xdif-(ydif*j))\r\n if len(k)==2:\r\n flag=1\r\n break\r\nxdif=1\r\nydif=a[2]-a[1]\r\nk=set()\r\nk.add(a[1]*xdif-ydif)\r\nfor j in range(n):\r\n k.add(a[j]*xdif-(ydif*j))\r\n\r\nif len(k)==2:\r\n flag=1\r\nif flag:\r\n print('Yes')\r\nelse:\r\n print('No')", "n = eval(input())\na = list(map(eval, input().split()))\n\ndef check(t):\n return len(set(2*y-t*x for x,y in enumerate(a))) == 2\n\nprint('Yes' if any(check(i) for i in [2*(a[1]-a[0]),2*(a[2]-a[1]),a[2]-a[0]]) else 'No')", "import sys\n\nn = int(input())\narr = list(map(int, input().split()))\n\ncom = [(0,1), (0,2), (1,2)]\n\nfor i in com:\n # y = ax + b\n a = (arr[i[0]] - arr[i[1]]) / (i[0] - i[1])\n b1 = arr[i[0]] - a * (i[0] + 1)\n b2 = b1\n flag = True\n for j in range(len(arr)):\n if arr[j] != a * (j+1) + b1 and b2 == b1:\n b2 = arr[j] - a * (j+1)\n elif arr[j] != a * (j+1) + b1 and arr[j] != a * (j+1) + b2:\n flag = False\n break\n if flag == True and b2 != b1:\n print(\"Yes\")\n sys.exit(0)\n\nprint(\"No\")\n \n\n\n\n\n\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\ny=[-1]+list(map(int,input().split()))\r\nfor v in range(2,n+1):\r\n a1=(y[v]-y[1])/(v-1)\r\n b1=y[1]-a1*1\r\n not_on=[]\r\n flag=True\r\n for i in range(1,n+1):\r\n if a1*i+b1!=y[i]:\r\n not_on.append(i)\r\n if len(not_on)==0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if len(not_on)==1:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n ii,jj=not_on[0],not_on[1]\r\n a2=(y[jj]-y[ii])/(jj-ii)\r\n b2=y[ii]-a2*ii\r\n for i in not_on:\r\n if a2*i+b2!=y[i]:\r\n flag=False\r\n if flag and a1==a2 and b1!=b2:\r\n print(\"YES\")\r\n exit()\r\na1=(y[3]-y[2])/(3-2)\r\nb1=y[2]-a1*2\r\nfor i in range(2,n+1):\r\n if a1*i+b1!=y[i]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nslp=[0]*3\r\nslp[0] = (lis[1]-lis[0])\r\nslp[1] = (lis[2]-lis[0])/2\r\nslp[2] = (lis[2]-lis[1])\r\nfor i in range(3):\r\n tmp=[]\r\n for j in range(n):\r\n tmp.append(-slp[i]*(j+1) + lis[j])\r\n if len(set(tmp))==2:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\") \r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl2=[0,0,0]\r\nl2[0]=l[0]-l[1]\r\nl2[1]=l[1]-l[2]\r\nl2[2]=(l[0]-l[2])/2\r\nx=-1\r\n\r\nfor j in range(3) :\r\n l1=[]\r\n for i in range(n) :\r\n l1.append(l[i]+l2[j]*(i+1))\r\n\r\n if len(set(l1))==2 :\r\n print('Yes')\r\n exit()\r\n \r\nprint('No')\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\ndef collinear(x1, y1, x2, y2, x3, y3):\r\n \r\n\t\"\"\" Calculation the area of \r\n\t\ttriangle. We have skipped\r\n\t\tmultiplication with 0.5 to\r\n\t\tavoid floating point computations \"\"\"\r\n\ta = x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)\r\n \r\n\tif (a == 0):\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\ndef deal(x1,y1,x2,y2):\r\n x = x1-x2\r\n y = y1-y2\r\n if y==0:\r\n return float(\"inf\")\r\n return x/y\r\n\r\nlib = defaultdict(int)\r\nseen = {}\r\nfor i in range(N):\r\n for j in range(i+1,N):\r\n x1,y1 = i+1,A[i]\r\n x2,y2 = j+1,A[j]\r\n k = deal(x1,y1,x2,y2)\r\n seen[k] = (x1,y1,x2,y2)\r\n lib[k]+=1\r\n \r\ncur = 0\r\nmk = 0\r\nfor k,v in lib.items():\r\n if v>cur:\r\n cur = v\r\n mk = k\r\n \r\nx1,y1,x2,y2 = seen[mk]\r\ngp = []\r\nfor i in range(N):\r\n if not collinear(x1,y1,x2,y2,i+1,A[i]):\r\n gp.append(i)\r\n \r\nif len(gp)==1:\r\n exit(print('Yes'))\r\nelif len(gp)==0:\r\n exit(print('No'))\r\n\r\nx1,y1,x2,y2 = gp[0]+1,A[gp[0]],gp[1]+1,A[gp[1]]\r\nif deal(x1,y1,x2,y2)!=mk:\r\n exit(print('No'))\r\n \r\nfor i in gp:\r\n if not collinear(x1,y1,x2,y2,i+1,A[i]):\r\n exit(print('No'))\r\n \r\nprint('Yes')\r\n\r\n\r\n\r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\nmarr= [(arr[2]-arr[0])/2,arr[2]-arr[1],arr[1]-arr[0]]\r\nfor m in marr:\r\n\tarr1=[]\r\n\tfor x,y in enumerate(arr):\r\n\t\tarr1.append(y-m*(x+1))\r\n\tif len(set(arr1))==2:\r\n\t\tprint(\"Yes\")\r\n\t\texit()\r\nprint(\"No\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n N = int(input())\r\n A = list(map(int, input().split()))\r\n\r\n x0, y0 = 0, A[0]\r\n\r\n ans = 'No'\r\n for j in range(1, N):\r\n x1, y1 = j, A[j]\r\n dx, dy = x1-x0, y1-y0\r\n px, py = -1, -1\r\n ok = False\r\n for i in range(1, N):\r\n if i == j:\r\n continue\r\n x2, y2 = i, A[i]\r\n if (x2-x0)*dy != (y2-y0)*dx:\r\n ok = True\r\n if px == -1:\r\n px, py = x2, y2\r\n elif (x2-px)*dy != (y2-py)*dx:\r\n ok = False\r\n break\r\n if ok:\r\n ans = 'Yes'\r\n\r\n x3, y3 = 1, A[1]\r\n x4, y4 = 2, A[2]\r\n ok = True\r\n for j in range(2, N):\r\n if (x4-x3)*(A[j]-y3) != (y4-y3)*(j-x3):\r\n ok = False\r\n if (x3-x0)*(y4-y0) != (y3-y0)*(x4-x0) and ok:\r\n ans = 'Yes'\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def run():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n\r\n _s = set(a)\r\n if len(_s) == 1:\r\n print('No')\r\n return\r\n if len(_s) == 2:\r\n print('Yes')\r\n return\r\n\r\n\r\n def check(dy, base):\r\n st = [False] * n\r\n for i in range(n):\r\n if (a[i] - a[base]) * 2 == dy * (i - base):\r\n st[i] = True\r\n\r\n for i, s in enumerate(st):\r\n if not s:\r\n newbase = i\r\n break\r\n else:\r\n return False\r\n\r\n base = newbase\r\n for i in range(n):\r\n if (a[i] - a[base]) * 2 == dy * (i - base):\r\n st[i] = True\r\n\r\n return not (False in st)\r\n\r\n if check((a[1]-a[0])*2, 0) or check((a[2]-a[1])*2, 1) or check((a[2]-a[0]), 0):\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\nrun()\r\n", "from sys import stdin\r\n\r\n\r\ndef slop(xs, ys):\r\n try:\r\n return (ys[1] - ys[0]) / (xs[1] - xs[0])\r\n except:\r\n return float('inf')\r\n\r\n\r\nEps = 10 ** -8\r\nadd_vec = lambda v1, v2, dist: [v1[0] + v2[0] * dist, v1[1] + v2[1] * dist]\r\nsub_vec = lambda v1, v2: [v2[0] - v1[0], v2[1] - v1[1]]\r\nunit_vec = lambda xs, ys, dist: [(xs[1] - xs[0]) / dist, (ys[1] - ys[0]) / dist]\r\n# dot==0 if v1 perpendicular\r\ndot_prod = lambda v1, v2: v1[0] * v2[0] + v1[1] * v2[1]\r\n\r\n# cross==0 if <v1v2=0\r\ncross_prod = lambda v1, v2: v1[0] * v2[1] - v2[0] * v1[1]\r\ncollinear = lambda v1, v2, v3: abs(cross_prod(sub_vec(v1, v2), sub_vec(v1, v3))) < Eps\r\npoint_on_ray = lambda v1, v2, v3: collinear(v1, v2, v3) and dot_prod(sub_vec(v1, v2), sub_vec(v1, v3)) > 0\r\npoint_in_segment = lambda v1, v2, v3: point_on_ray(v1, v2, v3) or point_on_ray(v2, v1, v3)\r\n\r\nrints = lambda: [int(x) for x in stdin.readline().split()]\r\npoint_in_line = lambda a, b, c, p: a * p[0] + b * p[1] + c\r\nn, a = int(input()), rints()\r\n\r\n# point\r\nif not collinear([1, a[0]], [2, a[1]], [3, a[2]]):\r\n tem = 0\r\n for i in range(3, n):\r\n if collinear([2, a[1]], [3, a[2]], [i + 1, a[i]]):\r\n tem += 1\r\n else:\r\n break\r\n if tem == n - 3:\r\n print('YES')\r\n exit()\r\n\r\n# line\r\nfor i in range(1, n):\r\n tem = []\r\n for j in range(1, n):\r\n if j != i:\r\n if not collinear([1, a[0]], [i + 1, a[i]], [j + 1, a[j]]):\r\n if len(tem) < 2:\r\n tem.append([j + 1, a[j]])\r\n elif not collinear(tem[0], tem[1], [j + 1, a[j]]):\r\n tem = []\r\n break\r\n\r\n if len(tem) == 1:\r\n print('YES')\r\n exit()\r\n elif len(tem) == 2 and slop([1, i + 1], [a[0], a[i]]) == slop([tem[0][0], tem[1][0]], [tem[0][1], tem[1][1]]):\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "n=int(input())\r\nd=list(map(int,input().split()))\r\na,b,c=d[:3]\r\nif b-a==c-b:\r\n pr=b-a\r\n ncnt=0\r\n for i in range(3,n):\r\n if (d[i]-c)/(i-2)!=pr:\r\n if ncnt:\r\n if (d[i]-pz)/(i-pind)!=pr:\r\n print('No');exit()\r\n else:\r\n pz,pind=d[i],i\r\n ncnt=1\r\n if ncnt:print('Yes')\r\n else:print('No')\r\nelse:\r\n p1=p2=p3=True\r\n pr1,pz1,pind1=b-a,c,2\r\n pr2,pz2,pind2=c-b,a,0\r\n pr3,pz3,pind3=(c-a)/2,b,1\r\n ncnt = 1\r\n for i in range(3, n):\r\n if (d[i] - b) / (i - 1) != pr1:\r\n if (d[i] - pz1) / (i - pind1) != pr1:\r\n p1=False\r\n if (d[i] - c) / (i - 2) != pr2:\r\n if (d[i] - pz2) / (i - pind2) != pr2:\r\n p2=False\r\n if (d[i] - c) / (i - 2) != pr3:\r\n if (d[i] - pz3) / (i - pind3) != pr3:\r\n p3=False\r\n print('Yes' if p1 or p2 or p3 else 'No')", "n=int(input())\r\nd=list(map(int,input().split()))\r\na,b,c=d[:3]\r\nif b-a==c-b:\r\n e=b-a\r\n f=0\r\n for i in range(3,n):\r\n if (d[i]-c)/(i-2)!=e:\r\n if f and(d[i]-g)/(i-h)!=e:print('No');exit()\r\n else:g,h=d[i],i;f=1\r\n print('Yes'if f else'No')\r\nelse:\r\n p1=p2=p3=1\r\n e,f,g=b-a,c,2\r\n h,j,k=c-b,a,0\r\n l,m,o=(c-a)/2,b,1\r\n for i in range(3,n):\r\n if(d[i]-b)/(i-1)!=e and(d[i]-f)/(i-g)!=e:p1=0\r\n if(d[i]-c)/(i-2)!=h and(d[i]-j)/(i-k)!=h:p2=0\r\n if(d[i]-c)/(i-2)!=l and(d[i]-m)/(i-o)!=l:p3=0\r\n print('Yes'if p1+p2+p3 else'No')", "n = input()\r\ny = list(map(int, input().split()))\r\n\r\ndef chk(limit):\r\n return len(set(2 * yi - limit * i for i, yi in enumerate(y))) == 2\r\n\r\ns = 2 * (y[1] - y[0]), 2 * (y[2] - y[1]), y[2] - y[0]\r\n\r\nprint('Yes' if any(chk(x) for x in s) else 'No')\r\n", "def test(id1,id2,l,n):\r\n\ta = l[id1] - l[id2]\r\n\tb = id2 - id1\r\n\tc = ((id1)*l[id2]) - ((id2)*l[id1])\r\n\td=[]\r\n\tfor i in range(n):\r\n\t\tif a*i+b*l[i]+c!=0:\r\n\t\t\td+=[i]\r\n\tif len(d)==0:return False\r\n\tif len(d)==1:return True\r\n\r\n\taa = l[d[0]] - l[d[1]]\r\n\tbb = d[1] - d[0]\r\n\tcc = ((d[0])*l[d[1]]) - ((d[1])*l[d[0]])\r\n\r\n\tfor i in range(len(d)):\r\n\t\tif aa*d[i]+bb*l[d[i]]+cc!=0:\r\n\t\t\treturn False\r\n\treturn (l[id1]-l[id2])/(id1-id2)==(l[d[1]]-l[d[0]])/(d[1]-d[0]) \t\r\nn=int(input())\r\nl=[int(i)for i in input().split()]\r\nprint(\"Yes\"if test(0,1,l,n) or test(1,2,l,n) or test(0,2,l,n) else \"No\" )", "def read_ints():\r\n\treturn [int(i) for i in input().split()]\r\n\r\nn = int(input())\r\np = [(i, int(k)) for i, k in enumerate(input().split())]\r\n\r\ndist = set()\r\nfor i in range(1, n):\r\n\tdist.add(p[i][1] - p[i - 1][1])\r\n\r\nif len(dist) == 1:\r\n\tprint('No')\r\n\texit(0)\r\n\r\ndist = set()\r\nfor i in range(2, n):\r\n\tdist.add(p[i][1] - p[i - 1][1])\r\n\r\nif len(dist) == 1:\r\n\tprint('Yes')\r\n\texit(0)\r\n\r\nsplited_pnt = dict()\r\n\r\nfor i in range(1, n):\r\n\tl = (p[i][1] - p[0][1]) / p[i][0]\r\n\tif l not in splited_pnt:\r\n\t\tsplited_pnt[l] = []\r\n\tsplited_pnt[l].append(i)\r\n\r\nfor l, pnt in splited_pnt.items():\r\n\tif len(p) - len(pnt) < 3:\r\n\t\tprint('Yes')\r\n\t\texit(0)\r\n\r\n\tother = [i for i in range(n) if i not in set(pnt + [0])]\r\n\r\n\r\n\tif all((p[i][1] - p[other[0]][1]) / (p[i][0] - p[other[0]][0]) == l for i in other[1:]):\r\n\t\tprint('Yes')\r\n\t\texit(0)\r\n\r\nprint('No')", "n = int(input())\r\ny = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n a = []\r\n for j in range(n):\r\n #(y[j]-y[0])/j==(y[i]-y[0])/i\r\n if (y[j]-y[0])*i!=(y[i]-y[0])*j:\r\n a.append(j)\r\n if a:\r\n ok = len(a)<2 or (y[i]-y[0])*(a[1]-a[0])==(y[a[1]]-y[a[0]])*i\r\n for j in range(2, len(a)):\r\n ok &= (y[a[j]]-y[a[0]])*(a[1]-a[0])==(y[a[1]]-y[a[0]])*(a[j]-a[0])\r\n if ok:\r\n print(\"Yes\")\r\n exit()\r\ny = y[::-1]\r\nfor i in range(1, n):\r\n a = []\r\n for j in range(n):\r\n #(y[j]-y[0])/j==(y[i]-y[0])/i\r\n if (y[j]-y[0])*i!=(y[i]-y[0])*j:\r\n a.append(j)\r\n if a:\r\n ok = len(a)<2 or (y[i]-y[0])*(a[1]-a[0])==(y[a[1]]-y[a[0]])*i\r\n for j in range(2, len(a)):\r\n ok &= (y[a[j]]-y[a[0]])*(a[1]-a[0])==(y[a[1]]-y[a[0]])*(a[j]-a[0])\r\n if ok:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "def nobeta(D):\r\n for i in range(len(D)-1):\r\n if D[i]==D[i+1]:\r\n return 'NO'\r\n return 'YES'\r\n\r\ndef solv(L):\r\n D = [L[i+1]-L[i] for i in range(len(L)-1)]\r\n dt = {}\r\n for v in D:\r\n if v not in dt: dt[v]=0\r\n dt[v]+=1\r\n T = [(v,dt[v]) for v in dt]\r\n if len(T)==2:\r\n T.sort(key=lambda x:x[1])\r\n if T[0][1]==1: return 'YES'\r\n if T[0][1]<T[0][1]-1: return 'NO'\r\n return nobeta(D)\r\n if len(T)==3:\r\n T.sort(key=lambda x:x[0])\r\n beta = T[1][0]\r\n if T[0][0]+T[2][0]!=beta*2: return 'NO'\r\n D = [x>beta for x in D if x!=beta]\r\n return nobeta(D)\r\n return 'NO'\r\n\r\n_ = input()\r\nL = list(map(int,input().split()))\r\nprint(solv(L))\r\n\r\n", "def f(m,c1,c2,l,n):\r\n fl=True\r\n for i in range(n):\r\n if (l[i]-(m1*i+m1)!=c1) and (l[i]-(m1*i+m1)!=c2):\r\n fl=False\r\n break\r\n return fl and c1!=c2\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm1=l[1]-l[0]\r\nc1=l[0]-m1\r\nc2=c1\r\nfor i in range(n):\r\n if l[i]-(m1*(i+1))!=c1:\r\n c2=l[i]-(m1*(i+1))\r\nf1=f(m1,c1,c2,l,n)\r\nm1=l[1]-l[0]\r\nc1=l[0]-m1\r\nc2=l[2]-m1*3\r\nf2=f(m1,c1,c2,l,n)\r\nm1=(l[2]-l[0])/2\r\nc1=l[0]-m1\r\nc2=l[1]-m1*2\r\nf3=f(m1,c1,c2,l,n)\r\nm1=l[2]-l[1]\r\nc1=l[0]-m1\r\nc2=l[1]-m1*2\r\nf4=f(m1,c1,c2,l,n)\r\nif f1 or f2 or f3 or f4:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n", "n=int(input())\r\ny=list(map(int,input().split()))\r\nif n==2:\r\n print(\"Yes\")\r\n exit\r\nelif n==1:\r\n print(\"No\")\r\n exit\r\ndef check(a,d):\r\n for i in range(0,n):\r\n a[i]-=i*d\r\n if len(set(a))==2:\r\n return True\r\n else:\r\n return False\r\nif check(y.copy(),y[1]-y[0]):\r\n print(\"Yes\")\r\n exit\r\nelif check(y.copy(),y[2]-y[1]):\r\n print(\"Yes\")\r\n exit\r\nelif check(y.copy(),(y[2]-y[0])/2):\r\n print(\"Yes\")\r\n exit\r\nelse:\r\n print(\"No\")\r\n", "def calculate_line(first_point, second_point):\n first_x = first_point[0]\n first_y = first_point[1]\n second_x = second_point[0]\n second_y = second_point[1]\n\n slope = (second_y-first_y)/(second_x-first_x)\n const = first_y - slope*first_x\n\n return slope, const\n\n\ndef is_on_line(line, current_point):\n point_x = current_point[0]\n point_y = current_point[1]\n slope = line[0]\n const = line[1]\n\n if point_y == (point_x*slope + const):\n return True\n else:\n return False\n\n\ndef parallel_line(line, current_point):\n point_x = current_point[0]\n point_y = current_point[1]\n slope = line[0]\n const = point_y - slope*point_x\n\n return slope, const\n\n\npoints_number = int(input())\n\npointsY = input().split()\n\npoints = []\n\nfor i in range(points_number):\n point = (i+1, int(pointsY[i]), [])\n points.append(point)\n\ntriangle_vertices = [points[0], points[1]]\nfirst_line = calculate_line(triangle_vertices[0], triangle_vertices[1])\nall_on_line = True\n\nfor i in range(2, points_number):\n if not is_on_line(first_line, points[i]):\n triangle_vertices.append(points[i])\n all_on_line = False\n break\n\nif all_on_line:\n print(\"No\")\n exit()\n\nlines = []\n\nfor i in range(3):\n first_point = triangle_vertices[i % 3]\n second_point = triangle_vertices[(i+1) % 3]\n third_point = triangle_vertices[(i+2) % 3]\n\n line = calculate_line(first_point, second_point)\n para_line = parallel_line(line, third_point)\n\n lines.append(line)\n lines.append(para_line)\n\nfor i in range(points_number):\n current_point = points[i]\n for j in range(3):\n if is_on_line(lines[2*j], current_point) or is_on_line(lines[2*j+1], current_point):\n current_point[2].append(j)\n\nline_set = [0, 0, 0]\n\nfor i in range(points_number):\n for e in points[i][2]:\n line_set[int(e)] += 1\n\nif points_number in line_set:\n print(\"Yes\")\nelse:\n print(\"No\")", "n=int(input())\r\nl=[int(i)*2 for i in input().split()]\r\n#vdjfka \r\npzbl=[l[1]-l[0],(l[2]-l[0])//2 ,l[2]-l[1]]\r\nfor slope in pzbl:\r\n z=[l[i]-slope*i for i in range(n)]\r\n if len(set(z))==2:\r\n print('Yes')\r\n exit()\r\nprint('No')", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n if a[1] - a[0] == a[2] - a[1]:\r\n d = a[1] - a[0]\r\n c1 = a[0]\r\n c2 = 'no'\r\n for i in range(3, n):\r\n if i * d + c1 == a[i]:\r\n pass\r\n elif c2 == 'no':\r\n c2 = a[i] - d * i\r\n elif i * d + c2 == a[i]:\r\n pass\r\n else:\r\n print('No')\r\n return\r\n if c2 == 'no':\r\n print('No')\r\n else:\r\n print('Yes')\r\n return\r\n else:\r\n f = True\r\n d = a[1] - a[0]\r\n c1 = a[0]\r\n c2 = a[2] - 2 * d\r\n #print(d, c1, c2)\r\n for i in range(3, n):\r\n if (a[i] == i * d + c1) or (a[i] == i * d + c2):\r\n pass\r\n else:\r\n f = False\r\n break\r\n if f:\r\n print('Yes')\r\n return\r\n f = True\r\n d = a[2] - a[1]\r\n c1 = a[1] - d\r\n c2 = a[0]\r\n #print(d, c1, c2)\r\n for i in range(3, n):\r\n if (a[i] == i * d + c1) or (a[i] == i * d + c2):\r\n pass\r\n else:\r\n f = False\r\n break\r\n if f:\r\n print('Yes')\r\n return\r\n f = True\r\n d = (a[2] - a[0]) / 2\r\n c1 = a[0]\r\n c2 = a[1] - d\r\n #print(d, c1, c2)\r\n for i in range(3, n):\r\n #print(a[i], i * d + c1, i * d + c2)\r\n if (a[i] == i * d + c1) or (a[i] == i * d + c2):\r\n pass\r\n else:\r\n f = False\r\n break\r\n if f:\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\nmain()\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ndef gcd(x, y):\r\n if x < y:\r\n x, y = y, x\r\n if y == 0:\r\n return x\r\n return gcd(y, x%y)\r\n\r\nn = int(input())\r\ny = list(map(int, input().split()))\r\n\r\n## consider all possible slopes\r\ncnt = dict()\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n dx = j-i\r\n dy = y[j]-y[i]\r\n g = gcd(abs(dx), abs(dy))\r\n dx //= g\r\n dy //= g \r\n if (dx, dy) in cnt:\r\n cnt[(dx, dy)] += 1\r\n else:\r\n cnt[(dx, dy)] = 1\r\n\r\n## select the most frequent slope\r\nbest = 0\r\nbest_key = ()\r\nfor key in cnt:\r\n if cnt[key] > best:\r\n best = cnt[key]\r\n best_key = key\r\n\r\ndx = best_key[0]\r\ndy = best_key[1]\r\nxnow = 0\r\nynow = y[0]\r\nused = [0]*n\r\nused[0] = 1\r\ncnt1 = 0\r\ncnt2 = 0\r\nwhile xnow < n:\r\n if y[xnow] == ynow:\r\n used[xnow] = 1\r\n cnt1 += 1\r\n xnow += dx\r\n ynow += dy\r\n\r\nfor i in range(n):\r\n if used[i] == 0:\r\n xnow = i\r\n ynow = y[i]\r\n while xnow < n:\r\n if y[xnow] == ynow and used[xnow] == 0:\r\n used[xnow] = 1\r\n cnt2 +=1\r\n xnow += dx\r\n ynow += dy\r\n break\r\n\r\nif cnt1+cnt2 == n and cnt2 > 0:\r\n print('yes')\r\nelse:\r\n print('no')", "def judge(slope):\r\n global kind\r\n global a\r\n sub=[]\r\n for i,x in enumerate(kind):\r\n if x==1:\r\n sub.append(i)\r\n # print(sub)\r\n # print(slope)\r\n n=len(sub)\r\n if n==0:\r\n return False\r\n elif n==1:\r\n return True\r\n else:\r\n if slope[1]==0:\r\n slope=(a[ sub[1] ]-a[ sub[0] ], sub[1]-sub[0])\r\n for i in range(1,n):\r\n if slope[0]*(sub[i]-sub[0]) != (a[ sub[i] ]-a[ sub[0] ]) * slope[1]:\r\n return False\r\n \r\n return True\r\n\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\nkind=[]\r\nflg=0\r\nfor i in range(1,n):\r\n kind=[1]*n\r\n kind[0]=0\r\n kind[i]=0\r\n for j in range(1,n):\r\n if (a[j]-a[0])*i == (a[i]-a[0])*j:\r\n kind[j]=0\r\n if judge(((a[i]-a[0]),i)):\r\n flg=1\r\n break\r\n\r\nkind=[1]*n\r\nkind[0]=0\r\nif judge((0,0)) and (a[1]-a[0])!=(a[2]-a[1]):\r\n flg=1\r\n\r\n\r\nif flg:\r\n print('Yes')\r\nelse:\r\n print('No')", "n = int(input())\r\ny = list(map(int, input().split()))\r\n\r\ndef check(d):\r\n return len(set(2 * yi - d * i for i, yi in enumerate(y))) == 2 \r\n\r\ns = 2*(y[1]-y[0]), 2*(y[2]-y[1]), y[2] - y[0]\r\nprint('Yes' if any(check(d) for d in s) else 'No')\r\n", "n=int(input())\ny=list(map(int,input().split()))\ndef check(d):\n return len(set(2*yi-d*i for i,yi in enumerate(y)))==2\n\nprint('Yes' if any(check(d) for d in [2*(y[1]-y[0]),2*(y[2]-y[1]),y[2]-y[0]]) else 'No')\n" ]

[ "def Prob(w, b, memo={}):\r\n if w == 0:\r\n return 0\r\n elif b == 0:\r\n return 1\r\n elif (w, b) in memo:\r\n return memo[(w, b)]\r\n else:\r\n k = w / (b + w)\r\n if b == 1:\r\n result = k\r\n elif b == 2:\r\n result = k + (1 - k) * ((b - 1) / (w + b - 1)) * Prob(w - 1, b - 2, memo)\r\n else:\r\n result = k + (1 - k) * ((b - 1) / (w + b - 1)) * (w / (b + w - 2)) * Prob(w - 1, b - 2, memo) + \\\r\n (1 - k) * ((b - 1) / (w + b - 1)) * ((b - 2) / (b + w - 2)) * Prob(w, b - 3, memo)\r\n\r\n memo[(w, b)] = result\r\n return result\r\n\r\n\r\nw, b = map(int, input().split())\r\nprint(\"%.9f\" %Prob(w, b))", "import sys\r\nimport random\r\nfrom math import gcd, lcm, sqrt, isqrt, perm, comb, factorial\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce, cmp_to_key\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush\r\nfrom copy import deepcopy\r\nfrom bisect import bisect_left, bisect_right\r\nfrom string import ascii_lowercase, ascii_uppercase\r\ninf = float('inf')\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\nMOD = 10 ** 9 + 7\r\nRANDOM = random.randint(1217, 2000)\r\n\r\ndef solve():\r\n w, b = MII()\r\n f = [[0] * (b + 1) for _ in range(w + 1)]\r\n for i in range(1, w + 1):\r\n f[i][0] = 1\r\n for i in range(1, w + 1):\r\n for j in range(1, b + 1):\r\n f[i][j] += i / (i + j)\r\n if j >= 3:\r\n f[i][j] += j / (i + j) * (j - 1) / (i + j - 1) * (j - 2) / (i + j - 2) * f[i][j - 3]\r\n if i >= 1 and j >= 2:\r\n f[i][j] += j / (i + j) * (j - 1) / (i + j - 1) * i/ (i + j - 2) * f[i - 1][j - 2]\r\n print(f[w][b])\r\n return\r\n\r\nsolve()\r\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n w,b=rm()\r\n dp=[[[1,0] for i in range(b+1)] for j in range(w+1)]\r\n for i in range(b+1):\r\n dp[0][i]=[0,0]\r\n for i in range(1,w+1):\r\n for j in range(1,b+1):\r\n dp[i][j][0]=i/(i+j)+j/(i+j)*dp[i][j-1][1]\r\n if j>1: dp[i][j][1]=1-(i/(i+j)+i*j/((i+j-1)*(i+j))*(1-dp[i-1][j-1][0])+(j-1)*j/((i+j-1)*(i+j))*(1-dp[i][j-2][0]))\r\n else: dp[i][j][1]=1-(i/(i+j)+j/(i+j)*(1-dp[i-1][j-1][0]))\r\n return dp[w][b][0]\r\n\r\nprint(main())" ]

[ "\"\"\"\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\n██████╗ ██╗██╗ ███████╗██╗ ██╗ ██████╗ ██████╗\n██╔══██╗██║██║ ██╔════╝██║ ██║██╔═══██╗██╔══██╗\n██║ ██║██║██║ ███████╗███████║██║ ██║██║ ██║\n██║ ██║██║██║ ╚════██║██╔══██║██║ ██║██║ ██║\n██████╔╝██║███████╗███████║██║ ██║╚██████╔╝██████╔╝\n╚═════╝ ╚═╝╚══════╝╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝\n\"\"\"\nm, M = -2000000000, 2000000000\nn = int(input())\nfor i in range(n):\n\ta, b, c = map(str, input().split())\n\tb = int(b)\n\tif c == \"Y\":\n\t\tif a == \">\":\n\t\t\tm = max(b + 1, m)\n\t\telif a == \">=\":\n\t\t\tm = max(b, m)\n\t\telif a == \"<\":\n\t\t\tM = min(b - 1, M)\n\t\telif a == \"<=\":\n\t\t\tM = min(M, b)\n\telse:\n\t\tif a == \">\":\n\t\t\tM = min(b, M)\n\t\telif a == \">=\":\n\t\t\tM = min(b - 1, M)\n\t\telif a == \"<\":\n\t\t\tm = max(m, b)\n\t\telse:\n\t\t\tm = max(b + 1, m)\nif m > M:print(\"Impossible\")\nelse:print(m)\n\n\n", "left, right = -2000000000, 2000000000\r\n\r\nfor _ in range(int(input())):\r\n guess, x, answer = input().split()\r\n x = int(x)\r\n\r\n if answer == 'N':\r\n guess = {'>': '<=', '<': '>=', '<=': '>', '>=': '<'}[guess]\r\n\r\n if guess == '>':\r\n if right <= x:\r\n print('Impossible')\r\n break\r\n elif left <= x:\r\n left = x + 1\r\n elif guess == '>=':\r\n if right < x:\r\n print('Impossible')\r\n break\r\n elif left < x:\r\n left = x\r\n elif guess == '<':\r\n if left >= x:\r\n print('Impossible')\r\n break\r\n elif right >= x:\r\n right = x - 1\r\n elif guess == '<=':\r\n if left > x:\r\n print('Impossible')\r\n break\r\n elif right > x:\r\n right = x\r\nelse:\r\n if left <= right:\r\n print(left)\r\n else:\r\n print('Impossible')\r\n", "n = int(input())\r\nlow = -2000000001\r\nhigh = 2000000001\r\ni = 0\r\nflag = 0\r\nwhile i < n:\r\n i = i + 1\r\n lis = input().split()\r\n if(lis[2] == \"N\"):\r\n if(lis[0] == \">\"):\r\n lis[0] = \"<=\"\r\n elif(lis[0] == \"<\"):\r\n lis[0] = \">=\"\r\n elif(lis[0] == \"<=\"):\r\n lis[0] = \">\"\r\n elif(lis[0] == \">=\"):\r\n lis[0] = \"<\"\r\n if(lis[0] == \">\"):\r\n if low < (int(lis[1]) + 1):\r\n low = int(lis[1]) + 1\r\n elif(lis[0] == \">=\"):\r\n if low < int(lis[1]):\r\n low = int(lis[1])\r\n elif(lis[0] == \"<\"):\r\n if high > (int(lis[1]) - 1):\r\n high = int(lis[1]) - 1\r\n elif(lis[0] == \"<=\"):\r\n if high > int(lis[1]):\r\n high = int(lis[1])\r\n if(low > high):\r\n flag = 1\r\n break\r\nif flag == 1:\r\n print(\"Impossible\")\r\nelse:\r\n ans = low + high\r\n ans = ans // 2 \r\n print(ans)", "def revOP(op):\r\n if(op==\"<\"):\r\n return \">=\"\r\n if(op==\"<=\"):\r\n return \">\"\r\n if(op==\">\"):\r\n return \"<=\"\r\n if(op==\">=\"):\r\n return \"<\"\r\n \r\nn=int(input())\r\nleft=(-2)*(10**9)\r\nright=(2)*(10**9)\r\nfor i in range(n):\r\n arr=list(map(str,input().split()))\r\n num=int(arr[1])\r\n oper=arr[0]\r\n \r\n if(arr[2]==\"N\"):\r\n oper=revOP(oper)\r\n \r\n if(oper==\">=\"):\r\n if(left<num):\r\n left=num\r\n elif(oper==\">\"):\r\n if(left<num+1):\r\n left=num+1\r\n elif(oper==\"<=\"):\r\n if(right>num):\r\n right=num\r\n elif(oper==\"<\"):\r\n if(right>num-1):\r\n right=num-1\r\n \r\nif(left<=right):\r\n print(left)\r\nelse:\r\n print(\"Impossible\")", "num = int(input())\nfirst = 0\nresult = 0\npossible = True\nmaxi = 2*(10**9)\nmini = -2*(10**9)\nfor i in range(num):\n str = input()\n str = str.split()\n symbol = str[0]\n number = int(str[1])\n order = str[2]\n if(symbol == \">\"):\n if(order == \"Y\"):\n mini = max(mini, number+1)\n else:\n maxi = min(maxi, number+1)\n elif(symbol == \"<\"):\n if(order == \"Y\"):\n maxi = min(maxi, number-1)\n else:\n mini = max(mini, number)\n elif(symbol == \">=\"):\n if(order == \"Y\"):\n mini = max(mini, number)\n else:\n maxi = min(maxi, number-1)\n elif(symbol == \"<=\"):\n if(order == \"Y\"):\n maxi = min(maxi, number)\n else:\n mini = max(mini, number+1)\nif(mini > maxi):\n print(\"Impossible\")\nelse:\n print(mini)\n \n \n\n\t \t \t \t \t\t\t \t\t\t \t \t\t \t", "n=int(input())\r\nk=0\r\na=[]\r\nr=[]\r\nh=0\r\nfor i in range(n):\r\n a.append(list(map(str,input().split())))\r\nfor i in range(n):\r\n for j in range(1):\r\n if a[i][j]=='>=' and a[i][j+2]=='Y':\r\n if k<int(a[i][j+1]):\r\n k=int(a[i][j+1])\r\n if a[i][j]=='>=' and a[i][j+2]=='N':\r\n if k>=int(a[i][j+1]):\r\n k=int(a[i][j+1])-1\r\n if a[i][j]=='>' and a[i][j+2]=='Y':\r\n if k<=int(a[i][j+1]):\r\n k=int(a[i][j+1])+1\r\n if a[i][j]=='>' and a[i][j+2]=='N':\r\n if k>int(a[i][j+1]):\r\n k=int(a[i][j+1])\r\n if a[i][j]=='<=' and a[i][j+2]=='Y':\r\n if k>int(a[i][j+1]):\r\n k=int(a[i][j+1])\r\n if a[i][j]=='<=' and a[i][j+2]=='N':\r\n if k<=int(a[i][j+1]):\r\n k=int(a[i][j+1])+1\r\n if a[i][j]=='<' and a[i][j+2]=='Y':\r\n if k>=int(a[i][j+1]):\r\n k=int(a[i][j+1])-1\r\n if a[i][j]=='<' and a[i][j+2]=='N':\r\n if k<int(a[i][j+1]):\r\n k=int(a[i][j+1])\r\n\r\nfor i in range(n):\r\n for j in range(1):\r\n if a[i][j]=='>=' and a[i][j+2]=='Y':\r\n if k>=int(a[i][j+1]):\r\n r.append('+')\r\n else:\r\n r.append('-')\r\n if a[i][j]=='>=' and a[i][j+2]=='N':\r\n if k<int(a[i][j+1]):\r\n r.append('+')\r\n else:\r\n r.append('-')\r\n if a[i][j]=='>' and a[i][j+2]=='Y':\r\n if k>int(a[i][j+1]):\r\n r.append('+')\r\n else:\r\n r.append('-')\r\n if a[i][j]=='>' and a[i][j+2]=='N':\r\n if k<=int(a[i][j+1]):\r\n r.append('+')\r\n else:\r\n r.append('-')\r\n if a[i][j]=='<=' and a[i][j+2]=='Y':\r\n if k<=int(a[i][j+1]):\r\n r.append('+')\r\n else:\r\n r.append('-')\r\n if a[i][j]=='<=' and a[i][j+2]=='N':\r\n if k>int(a[i][j+1]):\r\n r.append('+')\r\n else:\r\n r.append('-')\r\n if a[i][j]=='<' and a[i][j+2]=='Y':\r\n if k<int(a[i][j+1]):\r\n r.append('+')\r\n else:\r\n r.append('-')\r\n if a[i][j]=='<' and a[i][j+2]=='N':\r\n if k>=int(a[i][j+1]):\r\n r.append('+')\r\n else:\r\n r.append('-')\r\nfor i in range(len(r)):\r\n if r[i]=='-':\r\n print('Impossible')\r\n h=0\r\n break\r\n else:\r\n h+=1\r\nif h!=0:\r\n print(k)\r\n", "n = int(input())\r\ni, j = -1000000001, 1000000001\r\nfor _ in range(n):\r\n s, v, a = input().split()\r\n v = int(v)\r\n if (s, a) in [(\">=\", \"Y\"), (\"<\", \"N\")]:\r\n i = max(i, v)\r\n elif (s, a) in [(\">\", \"Y\"), (\"<=\", \"N\")]:\r\n i = max(i, v + 1)\r\n elif (s, a) in [(\"<=\", \"Y\"), (\">\", \"N\")]:\r\n j = min(j, v)\r\n elif (s, a) in [(\"<\", \"Y\"), (\">=\", \"N\")]:\r\n j = min(j, v - 1)\r\nprint(\"Impossible\" if i > j else i)\r\n ", "left=-2000000000\r\nright=2000000000\r\n\r\nfor _ in range(int(input())):\r\n temp=input().split()\r\n sign=temp[0]\r\n n=int(temp[1])\r\n tf=temp[2]\r\n if tf=='Y':\r\n if sign=='>' and left<=n:\r\n left=n+1\r\n elif sign=='>=' and left<n:\r\n left=n\r\n elif sign=='<' and right>=n:\r\n right=n-1\r\n elif sign=='<=' and right>n:\r\n right=n\r\n elif tf=='N':\r\n if sign=='>' and right>n:\r\n right=n\r\n elif sign=='>=' and right>=n:\r\n right=n-1\r\n elif sign=='<' and left<n:\r\n left=n\r\n elif sign=='<=' and left<=n:\r\n left=n+1\r\nif left<=right:\r\n print(left)\r\nelse:\r\n print('Impossible')", "n = int(input())\r\ni,j = -1000000001,1000000001\r\nfor k in range(n):\r\n e,x,a = input().split()\r\n x = int(x)\r\n if (e,a) in [('>=','Y'),('<','N')]:\r\n i = max(i,x)\r\n elif (e,a) in [('>','Y'),('<=','N')]:\r\n i = max(i,x+1)\r\n elif (e,a) in [('<=','Y'),('>','N')]:\r\n j = min(j,x)\r\n elif (e,a) in [('<','Y'),('>=','N')]:\r\n j = min(j,x-1)\r\nif i>j:\r\n print('Impossible')\r\nelse:\r\n print(i)\r\n", "n = int(input())\r\na = (2 * 10 ** 9)\r\nb = - (2 * 10 ** 9)\r\nfor i in range(n):\r\n arr = [i for i in input().split()]\r\n arr[1] = int(arr[1])\r\n if '>=' in arr:\r\n if arr[2] == 'Y':\r\n b = max(b, arr[1])\r\n else:\r\n a = min(a, arr[1] - 1)\r\n \r\n if '<=' in arr:\r\n if arr[2] == 'Y':\r\n a = min(a, arr[1])\r\n else:\r\n b = max(b, arr[1] + 1)\r\n \r\n if '<' in arr:\r\n if arr[2] == 'Y':\r\n a = min(a, arr[1] - 1)\r\n else:\r\n b = max(b, arr[1])\r\n \r\n if '>' in arr:\r\n if arr[2] == 'Y':\r\n b = max(b, arr[1] + 1)\r\n else:\r\n a = min(a, arr[1])\r\n \r\nif b > a:\r\n print('Impossible')\r\nelse:\r\n print(b)", "######################################################################\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=-2*1000000000\r\nr=+2*1000000000\r\nf=0\r\nfor i in range(n):\r\n a,b,c=input().strip().split()\r\n b=int(b)\r\n if(a==\">\"):\r\n if(c==\"Y\"):\r\n l=max(l,b+1)\r\n else:\r\n r=min(b,r)\r\n elif(a==\">=\"):\r\n if(c==\"Y\"):\r\n l=max(l,b)\r\n else:\r\n r=min(r,b-1)\r\n elif(a==\"<\"):\r\n if(c==\"Y\"):\r\n r=min(r,b-1)\r\n else:\r\n l=max(l,b)\r\n elif(a==\"<=\"):\r\n if(c==\"Y\"):\r\n r=min(r,b)\r\n else:\r\n l=max(l,b+1)\r\n #print(str(l)+\" \"+str(r))\r\n if(l>r):\r\n print(\"Impossible\")\r\n f=1\r\n break\r\nif(f==0):\r\n print(l)\r\n", "import math\r\nn = int(input())\r\ncriteria = [input().split() for i in range(n)]\r\n\r\ndef adjustCritic(critic):\r\n number = int(critic[1])\r\n final = critic[0][0]\r\n op = 1 - len(critic[0])\r\n\r\n if critic[2] == \"N\":\r\n final = \"<\"\r\n if critic[0][0] == \"<\":\r\n final = \">\"\r\n op = len(critic[0]) - 2\r\n\r\n if final == \"<\":\r\n op = - op\r\n\r\n return [final , number + op , \"Y\"]\r\n\r\nlimitingCriteria = [- math.inf , math.inf]\r\n\r\nfor critic in criteria:\r\n critic = adjustCritic(critic)\r\n limitingCriteriaString = \"limitingCriteria[\"+{\">\" : \"0\" , \"<\" : \"1\"}[critic[0]]+\"] \"\r\n \r\n condition = str(critic[1]) + critic[0] + limitingCriteriaString \r\n equality = limitingCriteriaString + \"=\" + str(critic[1]) \r\n\r\n if eval(condition):\r\n exec(equality)\r\n\r\nif limitingCriteria[0] != -math.inf:\r\n if limitingCriteria[0] + 1 < limitingCriteria[1]:\r\n print(limitingCriteria[0] + 1)\r\n else:\r\n print(\"Impossible\")\r\nelse:\r\n if limitingCriteria[1] - 1 > limitingCriteria[0]:\r\n print(limitingCriteria[1] - 1)\r\n else:\r\n print(\"Impossible\")", "#!/usr/bin/env python3\nimport collections, itertools, fractions, functools, heapq, math, queue\n\ndef solve():\n n = int(input())\n lo = -2*(10**9)\n hi = -lo\n for _ in range(n):\n cond, v, t = input().split()\n v = int(v)\n\n if t == 'N':\n cond = {'>': '<=', '<': '>=',\n '>=': '<', '<=': '>'}[cond]\n\n if cond == '>':\n lo = max(lo, v+1)\n if cond == '>=':\n lo = max(lo, v)\n if cond == '<':\n hi = min(hi, v-1)\n if cond == '<=':\n hi = min(hi, v)\n\n if lo > hi:\n return 'Impossible'\n\n return lo\n\n\nif __name__ == '__main__':\n print(solve())\n\n", "\"\"\"import random\r\n\r\nn=int(input())\r\ns,t = -10000,10000\r\nl,m=[],[]\r\nfor _ in range(n):\r\n a,b,c = input().split()\r\n if a==\">\" and c==\"Y\":\r\n s,t = int(b)+1,t\r\n l.append(s)\r\n m.append(t)\r\n elif a==\">\" and c==\"N\":\r\n s,t = s,int(b)\r\n l.append(s)\r\n m.append(t)\r\n elif a==\"<\" and c==\"Y\":\r\n s,t = s,int(b)-1\r\n l.append(s)\r\n m.append(t)\r\n elif a==\"<\" and c==\"N\":\r\n s,t = int(b),t\r\n l.append(s)\r\n m.append(t)\r\n elif a==\">=\" and c==\"Y\":\r\n s,t = int(b),t\r\n l.append(s)\r\n m.append(t)\r\n elif a==\">=\" and c==\"N\":\r\n s,t = s,int(b)-1\r\n l.append(s)\r\n m.append(t)\r\n elif a==\"<=\" and c==\"Y\":\r\n s,t = s,int(b)\r\n l.append(s)\r\n m.append(t)\r\n elif a==\"<=\" and c==\"N\":\r\n s,t = int(b)+1,t\r\n l.append(s)\r\n m.append(t)\r\nd,e = max(l),min(m)\r\ntry:\r\n r = random.randint(d,e)\r\n print(r)\r\nexcept ValueError:\r\n print(\"Impossible\")\"\"\"\r\n\r\n\r\n\r\n\r\nn = int(input())\r\ni, j = -1000000001, 1000000001\r\nfor _ in range(n):\r\n s, v, a = input().split()\r\n v = int(v)\r\n if (s, a) in [(\">=\", \"Y\"), (\"<\", \"N\")]:\r\n i = max(i, v)\r\n elif (s, a) in [(\">\", \"Y\"), (\"<=\", \"N\")]:\r\n i = max(i, v + 1)\r\n elif (s, a) in [(\"<=\", \"Y\"), (\">\", \"N\")]:\r\n j = min(j, v)\r\n elif (s, a) in [(\"<\", \"Y\"), (\">=\", \"N\")]:\r\n j = min(j, v - 1)\r\nprint(\"Impossible\" if i > j else i)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport math\n\ndef reverse_sign(sign):\n if sign == '>=':\n return '<'\n elif sign == '<=':\n return '>'\n elif sign == '>':\n return '<='\n else:\n return '>='\n\nN = int(input())\nmn = int(-1.5 * math.pow(10,9))\nmx = int(1.5 * math.pow(10,9))\nfor n in range(N):\n (sign, num, flag) = input().split()\n num = int(num)\n if flag == 'N':\n sign = reverse_sign(sign)\n\n if sign == '>':\n num += 1\n sign = '>='\n if sign == '<':\n num -= 1\n sign = '<='\n\n if sign == '>=':\n mn = max(mn, num)\n elif sign == '<=':\n mx = min(mx, num)\n # print(\"mn, mx = \", mn, mx)\n \nif mn > mx:\n print ('Impossible')\nelse:\n print (mn)\n \n \n", "n=int(input())\r\nlis=[]\r\nfor i in range(n):\r\n lis.append(input().split())\r\nlis1=[]\r\nlis2=[]\r\nfor i in range(n):\r\n if lis[i][0]=='>=':\r\n if lis[i][2]=='Y':\r\n lis1.append(int(lis[i][1]))\r\n else:\r\n lis2.append(int(lis[i][1])-1)\r\n if lis[i][0]=='<=':\r\n if lis[i][2]=='Y':\r\n lis2.append(int(lis[i][1]))\r\n else:\r\n lis1.append(int(lis[i][1])+1)\r\n if lis[i][0]=='>':\r\n if lis[i][2]=='Y':\r\n lis1.append(int(lis[i][1])+1)\r\n else:\r\n lis2.append(int(lis[i][1]))\r\n if lis[i][0]=='<':\r\n if lis[i][2]=='Y':\r\n lis2.append(int(lis[i][1])-1)\r\n else:\r\n lis1.append(int(lis[i][1]))\r\nif lis1==[]:\r\n print(min(lis2))\r\nelif lis2==[]:\r\n print(max(lis1))\r\nelse:\r\n a=max(lis1)\r\n b=min(lis2)\r\n if a<=b:\r\n print(a)\r\n else:\r\n print(\"Impossible\")\r\n \r\n", "'''I = lambda: [int(i) for i in input().split()]\r\nimport io, os, sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline'''\r\n\r\n#n,k = map(int,input().split())\r\n#n,m = map(int,input().split())\r\n\r\nminx=-1000000009\r\nmaxx=1000000009\r\nflag = True\r\nansmin = -1000000009\r\nansmax = 1000000009\r\nfor _ in range(int(input())):\r\n s,n,b = map(str,input().split())\r\n n = int(n)\r\n if s=='>':\r\n if b =='Y':\r\n minx = n+1\r\n else:\r\n maxx = n\r\n elif s=='>=':\r\n if b =='Y':\r\n minx = n\r\n else:\r\n maxx = n-1\r\n elif s=='<':\r\n if b =='Y':\r\n maxx = n-1\r\n else:\r\n minx = n\r\n elif s=='<=':\r\n if b =='Y':\r\n maxx = n\r\n else:\r\n minx = n+1\r\n #print(_)\r\n #print(ansmax,ansmin)\r\n if minx>=ansmin:\r\n ansmin = minx\r\n \r\n if maxx<=ansmax:\r\n ansmax = maxx\r\n if minx>ansmax:\r\n flag = False\r\n break\r\n if maxx<ansmin:\r\n flag =False\r\n break\r\n\r\nif flag:\r\n print(ansmin)\r\nelse:\r\n print('Impossible')\r\n \r\n", "n=input()\nn=int(n)\n\nlow=-2000000000\nhigh=2000000000\n\nfor i in range(n):\n a, b, c = input().split()\n b=int(b)\n\n if a==\">=\" and c==\"Y\" :\n low=max(low,b)\n elif a==\">\" and c==\"Y\":\n low=max(low,b+1)\n elif a==\"<=\" and c== \"Y\":\n high=min(high,b)\n elif a==\"<\" and c==\"Y\":\n high=min(high,b-1)\n elif a==\">=\" and c==\"N\":\n high=min(high,b-1)\n elif a==\">\" and c==\"N\":\n high=min(high,b)\n elif a==\"<=\" and c==\"N\":\n low=max(low,b+1)\n elif a==\"<\" and c==\"N\":\n low=max(low,b)\n\nif low>high :\n print(\"Impossible\")\nelse:\n print(low)\n\n\n\n\n\n\n\n\t\t \t\t\t\t \t \t \t \t\t \t\t", "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\nn = int(input())\r\nl, r = -2 * (10 ** 9), 2 * (10 ** 9)\r\n\r\nfor _ in range(n):\r\n sign, k, verdict = input().strip().split()\r\n if (sign == \">=\" and verdict == \"Y\") or (sign == \"<\" and verdict == \"N\"):\r\n l = max(l, int(k))\r\n elif (sign == \"<=\" and verdict == \"Y\") or (sign == \">\" and verdict == \"N\"):\r\n r = min(r, int(k))\r\n elif (sign == \">\" and verdict == \"Y\") or (sign == \"<=\" and verdict == \"N\"):\r\n l = max(l, int(k) + 1)\r\n else:\r\n r = min(r, int(k) - 1)\r\n\r\nif r < l:\r\n print(\"Impossible\")\r\nelse:\r\n print(l)", "n = int(input())\n\nupper = 2*(10**9)\nlower = (-2)*(10**9)\n\n\nfor i in range(n):\n r = input()\n r = r.split()\n if r[0] == '>':\n if r[-1] == 'Y':\n lower = max(lower, int(r[1]) + 1)\n else:\n upper = min(upper, int(r[1]))\n if r[0] == '<':\n if r[-1] == 'Y':\n upper = min(upper, int(r[1]) - 1)\n else:\n lower = max(lower, int(r[1]))\n if r[0] == '<=':\n if r[-1] == 'Y':\n upper = min(upper, int(r[1]))\n else:\n lower = max(lower, int(r[1]) + 1)\n if r[0] == '>=':\n if r[-1] == 'Y':\n lower = max(lower, int(r[1]))\n else:\n upper = min(upper, int(r[1]) - 1)\n\nif upper >= lower:\n print(lower)\nelse:\n print('Impossible')\n \t\t\t\t \t \t \t \t\t\t \t \t\t\t", "n = int(input())\r\nquestions = []\r\n\r\nfor _ in range(n):\r\n questions.append(input())\r\n\r\nlower_bound, upper_bound = None, None\r\n\r\nfor q in questions:\r\n bound = int(q.split()[1])\r\n if (q.startswith('>') and q.endswith('Y')) or (q.startswith('<') and q.endswith('N')):\r\n if ('Y' in q and '=' not in q) or ('N' in q and '=' in q):\r\n bound += 1\r\n lower_bound = bound if lower_bound == None else max(bound, lower_bound)\r\n else:\r\n if ('Y' in q and '=' not in q) or ('N' in q and '=' in q):\r\n bound -= 1\r\n upper_bound = bound if upper_bound == None else min(bound, upper_bound)\r\n\r\nif lower_bound != None and upper_bound != None and lower_bound > upper_bound:\r\n print('Impossible')\r\nelse:\r\n print(lower_bound if lower_bound != None else upper_bound)", "'''\r\n> y is larger than x\r\n< y is smaller than x\r\n>= y is larger or equal to x\r\n<= y is smaller or equal to x\r\n\r\n------------> implementation <------------------\r\n4\r\n>= 1 Y\r\n< 3 N\r\n<= -3 N\r\n> 55 N\r\n=----------=\r\n4\r\n>= 1 Y (1 is larger ot equal to y )\r\n< 3 N not (3 is smaller than y )\r\n<= -3 N not (-3 is smaller or equal to y )\r\n> 55 N not (55 is larger than y )\r\n\r\n=--------------------------=\r\nso number is any number between 4 --> 54\r\nnumber can randomly choose with those conditions.\r\n\r\n'''\r\nfrom random import randint\r\ninf = 2*10**9\r\ndef main():\r\n n = int(input())\r\n lt, rt = -inf, inf\r\n opposite = {'<':'>=', '<=' : '>', '>' : '<=', '>=' : '<'}\r\n for i in range(n):\r\n a, b, c = input().split()\r\n b =int(b)\r\n if c == 'N':\r\n a = opposite[a]\r\n if a == '<':\r\n rt = min(rt,b-1)\r\n elif a == '<=':\r\n rt = min(rt,b)\r\n elif a == '>':\r\n lt = max(lt, b+1)\r\n elif a == '>=':\r\n lt = max(lt, b)\r\n if lt > rt:\r\n print('Impossible')\r\n else:\r\n print(randint(lt,rt))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\nn = int(input())\r\nl = -10**9 -1\r\nr = 10**9 +1\r\n\r\nwhile n>0:\r\n n-=1\r\n s = input().split()\r\n if len(s[0]) == 1:\r\n if s[0] == \">\":\r\n if s[2] == \"Y\":\r\n l = max(l,int(s[1])+1)\r\n else:\r\n r = min(r,int(s[1]))\r\n else:\r\n if s[2] == \"Y\":\r\n r = min(int(s[1])-1,r)\r\n else:\r\n l = max(int(s[1]),l)\r\n else:\r\n if s[0] == \">=\":\r\n if s[2] == \"Y\":\r\n l = max(l,int(s[1]))\r\n else:\r\n r = min(r,int(s[1])-1)\r\n else:\r\n if s[2] == \"Y\":\r\n r = min(int(s[1]),r)\r\n else:\r\n l = max(int(s[1])+1,l)\r\n\r\nif l<=r:\r\n print(l)\r\nelse:\r\n print(\"Impossible\")", "n=int(input())\nl=-(10**9) - 1\nr=10**9 + 1\nfor _ in range(n):\n x,y,z=input().split()\n x=str(x)\n y=int(y)\n z=str(z)\n if z==\"Y\":\n if x==\">=\":\n if y>l:\n l=y\n elif x==\">\":\n if y>=l:\n l=y+1\n elif x==\"<=\":\n if y<r:\n r=y\n else:\n if y<=r:\n r=y-1\n else:\n if x==\"<\":\n if y>l:\n l=y\n elif x==\"<=\":\n if y>=l:\n l=y+1\n elif x==\">\":\n if y<r:\n r=y\n else:\n if y<=r:\n r=y-1 \nif l>r:\n print(\"Impossible\")\nelse:\n print((l+r)//2)\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\nmax = 2 * (10**9)\r\nmin = -2 * (10**9)\r\nfor q in range(n):\r\n sxans = input().split()\r\n s = sxans[0]\r\n val = int(sxans[1])\r\n ans = sxans[2]\r\n \r\n if '>=' in s :\r\n if ans == 'Y':\r\n if int(val) > min:\r\n min = val\r\n else:\r\n if int(val) < max :\r\n max = int(val) - 1\r\n elif '<=' in s:\r\n if ans == 'Y':\r\n if int(val) < max:\r\n max = val\r\n else:\r\n if int(val) > min:\r\n min = int(val) + 1\r\n elif '>' in s:\r\n if ans == 'Y':\r\n if int(val) >= min:\r\n min = val + 1\r\n else:\r\n if int(val) < max:\r\n max = int(val) \r\n elif '<' in s:\r\n if ans == 'Y':\r\n if int(val) <= max:\r\n max = val - 1\r\n else:\r\n if int(val)> min:\r\n min = int(val)\r\n if max - min < 0 :\r\n print('Impossible')\r\n break\r\nelse:\r\n print(min) \r\n", "n = int(input())\r\nl, r = -1000000001, 1000000001\r\nfor i in range(n): \r\n s = input().split()\r\n if s[2] == 'Y':\r\n if s[0] == '>':\r\n l = max(l, int(s[1]) + 1)\r\n elif s[0] == '>=':\r\n l = max(l, int(s[1]))\r\n elif s[0] == '<':\r\n r = min(r, int(s[1]) - 1)\r\n else:\r\n r = min(r, int(s[1]))\r\n else:\r\n if s[0] == '<=':\r\n l = max(l, int(s[1]) + 1)\r\n elif s[0] == '<':\r\n l = max(l, int(s[1]))\r\n elif s[0] == '>=':\r\n r = min(r, int(s[1]) - 1)\r\n else:\r\n r = min(r, int(s[1])) \r\nif r < l:\r\n print(\"Impossible\")\r\nelif r == 1000000001 and l == -1000000001:\r\n print(1)\r\nelif r == 1000000001:\r\n print(l)\r\nelif l == -1000000001:\r\n print(r)\r\nelse:\r\n print(r)", "u, v = -2000000000, 2000000000\r\nfor i in range(int(input())):\r\n a, b, c = input().split()\r\n k = int(b)\r\n if a == '>=':\r\n if c == 'Y': u = max(u, k)\r\n else: v = min(v, k - 1)\r\n elif a == '>':\r\n if c == 'Y': u = max(u, k + 1)\r\n else: v = min(v, k)\r\n elif a == '<=':\r\n if c == 'Y': v = min(v, k)\r\n else: u = max(u, k + 1)\r\n else:\r\n if c == 'Y': v = min(v, k - 1)\r\n else: u = max(u, k)\r\nprint('Impossible' if u > v else u)", "t = int(input())\r\nlower_bound = -2*10**9\r\nupper_bound = 2*10**9\r\nfor iq in range(t):\r\n \r\n X = input().split()\r\n if X[2] == 'Y':\r\n if X[0] == '>=':\r\n lower_bound = max(int(X[1]), lower_bound)\r\n # print('lower bound:', lower_bound)\r\n elif X[0] == '<=':\r\n upper_bound = min(int(X[1]), upper_bound)\r\n elif X[0] == '>':\r\n lower_bound = max(int(X[1])+1, lower_bound)\r\n elif X[0] == '<':\r\n upper_bound = min(int(X[1])-1, upper_bound)\r\n else:\r\n if X[0] == '>=':\r\n upper_bound = min(int(X[1])-1, upper_bound)\r\n elif X[0] == '<=':\r\n lower_bound = max(int(X[1])+1, lower_bound)\r\n elif X[0] == '>':\r\n upper_bound = min(int(X[1]), upper_bound)\r\n elif X[0] == '<':\r\n lower_bound = max(int(X[1]), lower_bound)\r\nif lower_bound > upper_bound:\r\n print(\"Impossible\")\r\nelse:\r\n print(lower_bound)\r\n \r\n\r\n\r\n", "from random import randint\n\ndef shrink_range(l, r, rel, num):\n\tif rel == '<':\n\t\tr = min(r, num-1)\n\telif rel == '<=':\n\t\tr = min(r, num)\n\telif rel == '>':\n\t\tl = max(l, num+1)\n\telif rel == '>=':\n\t\tl = max(l, num)\n\treturn l, r\n\ndef solve():\n\tn = int(input())\n\tl, r = -2*10**9, 2*10**9\n\topposite = {'<': '>=', '<=': '>', '>': '<=', '>=': '<'}\n\t\n\tfor _ in range(n):\n\t\trel, num, ans = input().split()\n\t\tnum = int(num)\n\t\tif ans == 'N':\n\t\t\trel = opposite[rel]\n\t\tl, r = shrink_range(l, r, rel, num)\n\t\n\tif l > r:\n\t\treturn 'Impossible'\n\telse:\n\t\treturn randint(l, r)\n\nif __name__ == '__main__':\n\tprint(solve())\n", "nop = {'<': '>=', '>': '<=', '<=': '>', '>=': '<'}\r\nvmin, vmax = -(10 ** 9 + 1), 10 ** 9 + 1\r\nfor i in range(int(input())):\r\n q = input().split()\r\n op, x = q[0] if q[2] == 'Y' else nop[q[0]], int(q[1])\r\n if op[0] == '<':\r\n if op[-1] != '=':\r\n x -= 1\r\n vmax = min(vmax, x)\r\n elif op[0] == '>':\r\n if op[-1] != '=':\r\n x += 1\r\n vmin = max(vmin, x)\r\nprint(vmin if vmin <= vmax else 'Impossible')", "def inverse( str ):\r\n val = \"\"\r\n if(str == \">\"):\r\n val = \"<=\"\r\n elif(str == \"<\"):\r\n val = \">=\"\r\n elif(str == \">=\"):\r\n val = \"<\"\r\n else:\r\n val = \">\"\r\n return val \r\n\r\n\r\nmin_ = -2000000000\r\nmax_ = 2000000000\r\nn = int(input())#tipo por defecto es cadena\r\nfor i in range(n): \r\n sign, num, yn = input().split() \r\n num = int(num) \r\n if (yn == \"N\"): \r\n sign = inverse(sign) \r\n if(sign == \"<=\"): \r\n max_ = min(max_, num) \r\n elif(sign == \"<\"):\r\n max_ = min(max_, num - 1) \r\n elif(sign == \">=\"):\r\n min_ = max(min_, num) \r\n else:\r\n min_ = max(min_, num + 1) \r\nif(min_ <= max_):\r\n print(min_)\r\nelse:\r\n print(\"Impossible\")\r\n ", "l=-2*10**9\r\nr=2*10**9\r\nfor i in range(int(input())):\r\n\ts,v,f=input().split()\r\n\tv=int(v)\r\n\tif f=='N':\r\n\t\ts={'<':'>','>':'<'}[s[0]]+s[1:]\r\n\t\tif len(s)==1:s+='='\r\n\t\telse:s=s[0]\r\n\tif s[0]=='<':\r\n\t\tif len(s)!=2:v-=1\r\n\t\tr=min(r, v)\r\n\telse:\r\n\t\tif len(s)!=2:v+=1\r\n\t\tl=max(l, v)\r\nif l<=r:print(l)\r\nelse:print('Impossible')", "n=int(input())\r\nk=-2000000000\r\nl=2000000000\r\nfor x in range(n):\r\n\ta,z,b=input().split()\r\n\ta=a\r\n\tz=int(z)\r\n\tb=b\r\n\tif(a=='>'and b=='Y'and k<z+1):\r\n\t\tk=z+1\r\n\telif(a=='>='and b=='Y'and k<z):\r\n\t\tk=z\r\n\telif(a=='>'and b=='N'and l>z):\r\n\t\tl=z\r\n\telif(a=='>='and b=='N'and l>z-1):\r\n\t\tl=z-1\r\n\telif(a=='<'and b=='Y'and l>z-1):\r\n\t\tl=z-1\r\n\telif(a=='<='and b=='Y'and l>z):\r\n\t\tl=z\r\n\telif(a=='<'and b=='N'and k<z):\r\n\t\tk=z\r\n\telif(a=='<='and b=='N'and k<z+1):\r\n\t\tk=z+1\r\n\t\t\r\nif (k<=l):\r\n\tprint(k)\r\nelse:\r\n\tprint('Impossible')", "from math import inf\r\n\r\nn = int(input().strip())\r\nstart = -inf\r\nend = inf\r\nfor i in range(n):\r\n query = list(input().strip().split())\r\n if query[0] == '>':\r\n if query[2] == 'Y':\r\n start = max(start, int(query[1]) + 1)\r\n else:\r\n end = min(end, int(query[1]))\r\n elif query[0] == '>=':\r\n if query[2] == 'Y':\r\n start = max(start, int(query[1]))\r\n else:\r\n end = min(end, int(query[1]) - 1)\r\n elif query[0] == '<':\r\n if query[2] == 'Y':\r\n end = min(end, int(query[1]) - 1)\r\n else:\r\n start = max(start, int(query[1]))\r\n elif query[0] == '<=':\r\n if query[2] == 'Y':\r\n end = min(end, int(query[1]))\r\n else:\r\n start = max(start, int(query[1]) + 1)\r\nif start == -inf:\r\n print(end)\r\nelif end == inf:\r\n print(start)\r\nelif (end - start) >= 0:\r\n print(start)\r\nelse:\r\n print('Impossible')", "n = int(input())\nmaxmin = -2000000000\nminmax = 2000000000\nfor x in range(n):\n query = [str(x) for x in input().split()]\n op = query[0]\n num = int(query[1])\n flag = query[2]\n if op == '>':\n if flag == 'Y':\n maxmin = max(maxmin, num + 1)\n else:\n minmax = min(minmax, num)\n elif op == '<':\n if flag == 'Y':\n minmax = min(minmax, num - 1)\n else:\n maxmin = max(maxmin, num)\n elif op == '>=':\n if flag == 'Y':\n maxmin = max(maxmin, num)\n else:\n minmax = min(minmax, num - 1)\n elif op == '<=':\n if flag == 'Y':\n minmax = min(minmax, num)\n else:\n maxmin = max(maxmin, num + 1)\nif maxmin > minmax:\n print ('Impossible')\nelse:\n print (maxmin)\n \t \t\t \t \t\t\t \t\t \t\t \t \t\t\t\t\t\t", "n = int(input())\n\nupper = 2 * (10**9)\nlower = -2 * (10**9)\n\nfor i in range(0, n):\n\tguess = input().split(' ')\n\tif guess[0] == '>':\n\t\tif guess[2] == 'Y':\n\t\t\tlower = max(lower, int(guess[1]) + 1)\n\t\telse:\n\t\t\tupper = min(upper, int(guess[1]))\n\telif guess[0] == '<':\n\t\tif guess[2] == 'Y':\n\t\t\tupper = min(upper, int(guess[1]) - 1)\n\t\telse:\n\t\t\tlower = max(lower, int(guess[1]))\n\telif guess[0] == '>=':\n\t\tif guess[2] == 'Y':\n\t\t\tlower = max(lower, int(guess[1]))\n\t\telse:\n\t\t\tupper = min(upper, int(guess[1]) - 1)\n\telif guess[0] == '<=':\n\t\tif guess[2] == 'Y':\n\t\t\tupper = min(upper, int(guess[1]))\n\t\telse:\n\t\t\tlower = max(lower, int(guess[1]) + 1)\n\nif lower > upper:\n\tprint('Impossible')\nelse:\n\tprint(int((upper + lower) / 2))\n\t \t \t\t \t \t \t\t \t\t \t\t\t\t", "import sys\r\nimport math\r\n\r\nn = int(input())\r\n\r\nk1 = -2 * (10 ** 9)\r\nk2 = 2 * (10 ** 9)\r\nfor i in range(n):\r\n st = (sys.stdin.readline()).split()\r\n if(st[2] == \"N\"):\r\n if(st[0] == \">\"):\r\n st[0] = \"<=\"\r\n elif(st[0] == \"<\"):\r\n st[0] = \">=\"\r\n elif(st[0] == \"<=\"):\r\n st[0] = \">\"\r\n elif(st[0] == \">=\"):\r\n st[0] = \"<\"\r\n\r\n\r\n if(st[0] == \">=\"):\r\n if(int(st[1]) > k1):\r\n k1 = int(st[1])\r\n elif(st[0] == \">\"):\r\n if(int(st[1]) + 1 > k1):\r\n k1 = int(st[1]) + 1\r\n elif(st[0] == \"<=\"):\r\n if(int(st[1]) < k2):\r\n k2 = int(st[1])\r\n elif(st[0] == \"<\"):\r\n if(int(st[1]) - 1 < k2):\r\n k2 = int(st[1]) - 1\r\n\r\nif(k1 > k2):\r\n print(\"Impossible\")\r\nelse:\r\n print(k1)", "t=int(input())\nm=-2*10**9\nn=2*10**9\nflag=0\nfor i in range(t):\n a,b,c=input().split()\n b=int(b)\n if c==\"Y\" and a==\">=\" or c==\"N\" and a==\"<\":\n m=max(m,b)\n elif c==\"Y\" and a==\">\" or c==\"N\" and a==\"<=\":\n m=max(m,b+1)\n elif c==\"Y\" and a==\"<=\" or c==\"N\" and a==\">\":\n n=min(n,b)\n else:\n n=min(n,b-1)\n if m>n:\n flag=1\n break\nif flag==1:\n print(\"Impossible\")\nelse:\n print(m)\n\n\t \t\t \t\t\t \t\t\t \t\t\t\t\t \t \t", "# Made By Mostafa_Khaled \nbot = True \nfrom random import randint\n\nn = int(input())\n\nl, r = -2*10**9, 2*10**9\nopposite = {'<': '>=', '<=': '>', '>': '<=', '>=': '<'}\n\nfor _ in range(n):\n\trel, num, ans = input().split()\n\tnum = int(num)\n\tif ans == 'N':\n\t\trel = opposite[rel]\n\tif rel == '<':\n\t\tr = min(r, num-1)\n\telif rel == '<=':\n\t\tr = min(r, num)\n\telif rel == '>':\n\t\tl = max(l, num+1)\n\telif rel == '>=':\n\t\tl = max(l, num)\t\n\nif l > r:\n\tprint('Impossible')\nelse:\n\tprint(randint(l, r))\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\n\r\nlow = None\r\nhigh = None\r\n\r\nfor i in range(n):\r\n l = input().split()\r\n if l[0]==\">\" and l[2]==\"Y\" or l[0]==\"<=\" and l[2]==\"N\":\r\n low=max(int(l[1])+1, (low==None and -1e9 or low))\r\n elif l[0]==\"<\" and l[2]==\"Y\" or l[0]==\">=\" and l[2]==\"N\":\r\n high=min(int(l[1])-1, (high==None and 1e9 or high))\r\n elif l[0]==\">=\" and l[2]==\"Y\" or l[0]==\"<\" and l[2]==\"N\":\r\n low=max(int(l[1]), (low==None and -1e9 or low))\r\n elif l[0]==\"<=\" and l[2]==\"Y\" or l[0]==\">\" and l[2]==\"N\":\r\n high=min(int(l[1]), (high==None and 1e9 or high))\r\n\r\nif(high!=None and low!=None):\r\n if(high < low):\r\n print(\"Impossible\")\r\n else:\r\n print(low)\r\nelse:\r\n if(high==None):\r\n print(low)\r\n else:\r\n print(high)", "\r\n\r\nn=int(input())\r\nl=-2*(10**9)\r\nh=2*(10**9)\r\nf=True\r\nfor _ in range(n):\r\n a=input().split()\r\n v=int(a[1])\r\n res=a[2]\r\n if a[0]==\">=\":\r\n if res==\"Y\":\r\n l=max(l,v)\r\n else :\r\n h=min(h,v-1)\r\n elif a[0]==\">\":\r\n if res==\"Y\":\r\n l=max(l,v+1)\r\n else :\r\n h=min(h,v)\r\n elif a[0]==\"<=\":\r\n if res==\"Y\":\r\n h=min(h,v)\r\n else :\r\n l=max(v+1,l)\r\n else :\r\n if res==\"Y\":\r\n h=min(h,v-1)\r\n else :\r\n l=max(l,v)\r\nif not f or (l>h):\r\n print(\"Impossible\")\r\nelse :\r\n print(l) \r\n \r\n ", "n = int(input())\n\noperations = [\">=\", \"<=\", \">\", \"<\"]\nNO = \"N\"\nM = 2*10**9\ngreater = []\nless = []\n\nfor i in range(n):\n\tinp = input().split(\" \")\n\tif inp[0] == operations[0] and inp[2] == NO:\n\t\tinp[0] = operations[3]\n\telif inp[0] == operations[1] and inp[2] == NO:\n\t\tinp[0] = operations[2]\n\telif inp[0] == operations[2] and inp[2] == NO:\n\t\tinp[0] = operations[1]\n\telif inp[0] == operations[3] and inp[2] == NO:\n\t\tinp[0] = operations[0]\n\n\tif inp[0] == operations[0]:\n\t\tgreater.append(int(inp[1]) - 1)\n\telif inp[0] == operations[2]:\n\t\tgreater.append(int(inp[1]))\n\telif inp[0] == operations[1]:\n\t\tless.append(int(inp[1]) + 1)\n\telif inp[0] == operations[3]:\n\t\tless.append(int(inp[1]))\n\nupper = 0\nif len(greater) == 0:\n\tupper = -1 * M\nelse:\n\tupper = greater[0]\n\tfor i in range(1, len(greater)):\n\t\tif greater[i] > upper:\n\t\t\tupper = greater[i]\n\nlower = 0\nif len(less) == 0:\n\tlower = M\nelse:\n\tlower = less[0]\n\tfor i in range(1, len(less)):\n\t\tif less[i] < lower:\n\t\t\tlower = less[i]\n\n\nif upper < -1 * M:\n\tupper = -1 * M\nif lower > M:\n\tlower = M\n\nif upper > lower - 2:\n\tprint(\"Impossible\")\n\nelse:\n\tprint(upper + 1)\n\t\t\n\n \t\t\t\t \t\t \t\t \t \t\t \t \t \t \t", "class Solve:\r\n def __init__(self,x,y,z):\r\n self.x,self.y, self.z = x, y, z\r\n def change(self):\r\n if self.z == \"N\":\r\n if self.x == \"<\": self.x = \">=\"\r\n elif self.x == \"<=\": self.x = \">\"\r\n elif self.x == \">=\": self.x = \"<\"\r\n elif self.x == \">\": self.x = \"<=\"\r\n return self.x\r\n def slv(s,l,r):\r\n if s.x == \">\": l = max(l, s.y + 1)\r\n elif s.x == \">=\": l = max(l, s.y)\r\n elif s.x == \"<\": r = min(r, s.y - 1)\r\n else: r = min(r, s.y)\r\n if l > r: exit(print(\"Impossible\"))\r\n else: return l,r\r\ntc = eval(input()); l, r, ans = -2000000000, 2000000000, 0\r\np = Solve(x = \"\", y = \"\", z = \"\")\r\nfor i in range(tc):\r\n p.x,p.y,p.z = map(str,input().split()); p.y = (int(p.y))\r\n p.change()\r\n l,r = p.slv(l,r)\r\nprint(l)", "import sys \r\nfrom os import path \r\nimport math \r\nimport string \r\nfrom collections import deque\r\nimport array \r\n\r\n\r\ndef main():\r\n\tif path.exists(\"input.txt\"):\r\n\t\tsys.stdin = open(\"input.txt\", \"r\")\r\n\t\tsys.stdout = open(\"output.txt\", \"w\")\r\n\t\"\"\"\r\n\tidea: group in pairs to minimize waste -\r\n\t\r\n\r\n\r\n\t\r\n\t\"\"\"\r\n\tn = int(input())\r\n\tmn = -2*10**9 \r\n\tmx = 2*10**9 \r\n\tfor _ in range(n):\r\n\t\top, x , sign = input().split()\r\n\t\tx = int(x)\r\n\t\t\r\n\t\tif sign == 'Y':\r\n\t\t\tif op == '>=':\r\n\t\t\t\tmn = max(x, mn) \r\n\t\t\telif op == \">\":\r\n\t\t\t\tmn = max(x+1, mn) \r\n\t\t\telif op == \"<=\":\r\n\t\t\t\tmx = min(x, mx) \r\n\t\t\telse:\r\n\t\t\t\tmx = min(x -1, mx) \r\n\t\telse:\r\n\t\t\tif op == \">=\":\r\n\t\t\t\tmx = min(x -1, mx) \r\n\t\t\telif op == \">\": \r\n\t\t\t\tmx = min(x, mx) \r\n\t\t\telif op == \"<=\":\r\n\t\t\t\tmn = max(x+1, mn) \r\n\t\t\telse:\r\n\t\t\t\tmn = max(x, mn) \r\n\t\tif mx < mn:\r\n\t\t\tprint(\"Impossible\")\r\n\t\t\treturn \r\n\tprint(mn)\r\n\r\n\r\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\tmain()", "_List = []\r\nt = int(input())\r\nwhile(t) :\r\n\tt-=1\r\n\ts = []\r\n\ts = input().split()\r\n\tif s[2] == 'N':\r\n\t\tif s[0] == '>=' : \r\n\t\t\ts[0] = '<'\r\n\t\telif s[0] == '<=' :\r\n\t\t\ts[0] = '>'\r\n\t\telif s[0] == '>' :\r\n\t\t\ts[0] = '<='\r\n\t\telse : \r\n\t\t\ts[0] = '>='\r\n\t\t\r\n\t_List.append(s)\r\n\r\nl = -2000000000\r\nr = 2000000000\r\ni = 0\r\nwhile(1) :\r\n\tif (l > r or i == len(_List)) : break\r\n\tif (_List[i][0] == \">=\") :\r\n\t\tl = max(int(_List[i][1]), l)\r\n\tif (_List[i][0] == \">\") :\r\n\t\tl = max(int(_List[i][1]) + 1 , l)\r\n\tif (_List[i][0] == \"<=\") :\r\n\t\tr = min(int(_List[i][1]), r)\r\n\tif (_List[i][0] == \"<\") :\r\n\t\tr = min(int(_List[i][1]) - 1, r)\r\n\ti+=1\r\nif (l<=r) :\r\n\tprint(l)\r\nelse :\r\n\tprint(\"Impossible\")\t\r\n\t", "def ugaday(lst):\r\n l, r = -2000000000, 2000000000\r\n for elem in lst:\r\n if elem[0] == \">\":\r\n if elem[2] == \"N\":\r\n r = min(r, int(elem[1]))\r\n else:\r\n l = max(l, int(elem[1]) + 1)\r\n if elem[0] == \"<\":\r\n if elem[2] == \"N\":\r\n l = max(l, int(elem[1]))\r\n else:\r\n r = min(r, int(elem[1]) - 1)\r\n if elem[0] == \">=\":\r\n if elem[2] == \"Y\":\r\n l = max(l, int(elem[1]))\r\n else:\r\n r = min(r, int(elem[1]) - 1)\r\n if elem[0] == \"<=\":\r\n if elem[2] == \"Y\":\r\n r = min(r, int(elem[1]))\r\n else:\r\n l = max(l, int(elem[1]) + 1)\r\n if l <= r:\r\n return l\r\n return \"Impossible\"\r\n\r\n\r\nn = int(input())\r\na = list()\r\nfor i in range(n):\r\n s, x, ans = [i for i in input().split()]\r\n a.append([s, x, ans])\r\nprint(ugaday(a))\r\n", "n = int(input())\r\n\r\n#a = [False]*((2*(10**9))* +1)\r\nli = -2 * (10**9)\r\nls = 2 * (10**9)\r\noriginales = [\">\" , \"<\", \">=\",\"<=\"]\r\ninversos = [\"<=\",\">=\",\"<\",\">\"]\r\nfor i in range(n):\r\n condi = input().split()\r\n if condi[2] == \"Y\":\r\n if originales.index(condi[0]) %2 == 0:\r\n if condi[0] == \">\":\r\n if li <= int(condi[1]):\r\n li = int(condi[1]) +1 \r\n else:\r\n if li < int(condi[1]):\r\n li = int(condi[1])\r\n else:\r\n if condi[0] == \"<\":\r\n if ls >= int(condi[1]): \r\n ls = int(condi[1]) -1 \r\n else:\r\n if ls > int(condi[1]):\r\n ls = int(condi[1])\r\n else:\r\n if originales.index(condi[0]) %2 == 0:\r\n if condi[0] == \">\":\r\n if ls > int(condi[1]):\r\n ls = int(condi[1])\r\n \r\n else:\r\n if ls >= int(condi[1]): \r\n ls = int(condi[1]) -1\r\n \r\n else:\r\n if condi[0] == \"<\":\r\n if li < int(condi[1]):\r\n li = int(condi[1]) \r\n else:\r\n if li <= int(condi[1]):\r\n li = int(condi[1]) +1 \r\n #print(\"ls: \", ls, \"\\tli: \", li)\r\n \r\n\r\nif ls >= li:\r\n print(li)\r\nelse:\r\n print(\"Impossible\")\r\n \r\n \r\n\r\n \r\n \r\n", "a, b = -(1 << 30), (1 << 30)\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n if (s[0] == '>' and s[2] == 'Y') or (s[0] == '<=' and s[2] == 'N'):\r\n a = max(int(s[1]) + 1, a)\r\n elif (s[0] == '>=' and s[2] == 'Y') or (s[0] == '<' and s[2] == 'N'):\r\n a = max(int(s[1]), a)\r\n elif (s[0] == '<' and s[2] == 'Y') or (s[0] == '>=' and s[2] == 'N'):\r\n b = min(int(s[1]) - 1, b)\r\n else:\r\n b = min(int(s[1]), b)\r\n\r\nif a > b:\r\n print('Impossible')\r\nelse: print(a)", "n=int(input())\r\nl1=[-2*(10**9),2*(10**9)]\r\nfor i in range(n):\r\n inp=list(input().split())\r\n if inp[0]=='>':\r\n x=int(inp[1])\r\n if inp[2]=='Y':\r\n l1[0]=max(l1[0],x+1)\r\n else :\r\n l1[1]=min(l1[1],x)\r\n elif inp[0]=='<':\r\n x=int(inp[1])\r\n if inp[2]=='N':\r\n l1[0]=max(l1[0],x)\r\n else :\r\n l1[1]=min(l1[1],x-1)\r\n elif inp[0]=='<=':\r\n x=int(inp[1])\r\n if inp[2]=='N':\r\n l1[0]=max(l1[0],x+1)\r\n else :\r\n l1[1]=min(l1[1],x)\r\n elif inp[0]=='>=':\r\n x=int(inp[1])\r\n if inp[2]=='Y':\r\n l1[0]=max(l1[0],x)\r\n else :\r\n l1[1]=min(l1[1],x-1)\r\nif l1[0]<=l1[1]:\r\n print(l1[0])\r\nelse :\r\n print(\"Impossible\")\r\n \r\n \r\n ", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n s=list(input().split(\" \"))\r\n li.append(s)\r\nmx=2 * 10**9\r\nmi=-mx\r\nfor i in range(n):\r\n if li[i][2]=='Y':\r\n if li[i][0]=='>':\r\n mi=max(mi,int(li[i][1])+1)\r\n elif li[i][0]=='>=':\r\n mi=max(mi,int(li[i][1]))\r\n elif li[i][0]=='<':\r\n mx=min(mx,int(li[i][1])-1)\r\n else:\r\n mx=min(mx,int(li[i][1]))\r\n else:\r\n if li[i][0]=='>':\r\n mx=min(mx,int(li[i][1]))\r\n elif li[i][0]=='>=':\r\n mx=min(mx,int(li[i][1])-1)\r\n elif li[i][0]=='<':\r\n mi=max(mi,int(li[i][1]))\r\n else:\r\n mi=max(mi,int(li[i][1])+1)\r\nif mi>mx:\r\n print('Impossible')\r\nelse:\r\n print(mx)\r\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\nn = int(input())\r\nhigh = 2 * (10 ** 9)\r\nlow = -high\r\nfor _ in range(n) :\r\n comp, x, ans = input().split()\r\n x = int(x)\r\n if ans == \"N\" :\r\n if comp[0] == \">\" :\r\n high = min(high, x if len(comp) == 1 else x - 1)\r\n else :\r\n low = max(low, x if len(comp) == 1 else x + 1)\r\n else :\r\n if comp[0] == \">\" :\r\n low = max(low, x if len(comp) == 2 else x + 1)\r\n else :\r\n high = min(high, x if len(comp) == 2 else x - 1)\r\nif low > high :\r\n print(\"Impossible\")\r\nelse :\r\n print(low)\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\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 lo, hi = -2000000000, 2000000001\n for _ in range(int(input())):\n s, x, yn = input().split()\n if yn == \"N\":\n s = {\"<\": \">=\", \">\": \"<=\", \"<=\": \">\", \">=\": \"<\"}[s]\n x = int(x) + 1 if s in (\"<=\", \">\") else int(x)\n if s[0] == \"<\":\n if hi > x:\n hi = x\n else:\n if lo < x:\n lo = x\n print((lo + hi) // 2 if lo < hi else \"Impossible\")\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = -2 * (10 ** 9)\r\nb = 2 * (10 ** 9)\r\nfor i in range(n):\r\n s = input().split()\r\n if s[0] == '>=':\r\n if s[2] == 'Y':\r\n a = max(a, int(s[1]))\r\n else:\r\n b = min(b, int(s[1]) - 1)\r\n if s[0] == '>':\r\n if s[2] == 'Y':\r\n a = max(a, int(s[1]) + 1)\r\n else:\r\n b = min(b, int(s[1]))\r\n if s[0] == '<=':\r\n if s[2] == 'Y':\r\n b = min(b, int(s[1]))\r\n else:\r\n a = max(a, int(s[1]) + 1)\r\n if s[0] == '<':\r\n if s[2] == 'Y':\r\n b = min(b, int(s[1]) - 1)\r\n else:\r\n a= max(a, int(s[1]))\r\nif b < a:\r\n print('Impossible')\r\nelse:\r\n print(a)", "n=int(input())\r\nl=-2*10**9\r\nr=2*10**9\r\nfor i in range(n):\r\n s,v,f=input().split()\r\n v=int(v)\r\n if f=='N':\r\n s={'<':'>','>':'<'}[s[0]]+s[1:]\r\n if len(s)==1:\r\n s+='='\r\n else:\r\n s=s[0]\r\n if s[0]=='<':\r\n if len(s)!=2:\r\n v-=1\r\n r=min(r,v)\r\n else:\r\n if len(s)!=2:\r\n v+=1\r\n l=max(l,v)\r\nif l<=r:\r\n print(l)\r\nelse:\r\n print('Impossible')", "n = int(input())\nl = -2 * 10**9\nr = 2 * 10**9\nfor i in range(n):\n\ts, v, f = input().split()\n\tv = int(v)\n\tif f == 'N':\n\t\ts = {'<': '>', '>': '<'}[s[0]] + s[1:]\n\t\tif len(s) == 1:\n\t\t\ts += '='\n\t\telse:\n\t\t\ts = s[0]\n\tif s[0] == '<':\n\t\tif len(s) != 2:\n\t\t\tv -= 1\n\t\tr = min(r, v)\n\telse:\n\t\tif len(s) != 2:\n\t\t\tv += 1\n\t\tl = max(l, v)\nif l <= r:\n\tprint(l)\nelse:\n\tprint('Impossible')\n", "n = int(input())\r\nmn = -2000000000\r\nmx = 2000000000\r\nfor i in range(n):\r\n (sign, ber, ans) = input().split()\r\n num = int(ber)\r\n if ans == 'N':\r\n if sign == '<':\r\n sign = '>='\r\n elif sign == '<=':\r\n sign = '>'\r\n elif sign == '>':\r\n sign = '<='\r\n elif sign == '>=':\r\n sign = '<'\r\n if sign == '<':\r\n sign = '<='\r\n num -= 1\r\n if sign == '>':\r\n sign = '>='\r\n num += 1\r\n if sign == '<=':\r\n mx = min(mx, num)\r\n else:\r\n mn = max(mn, num)\r\nif mx < mn:\r\n print('Impossible')\r\nelse:\r\n print(mn)", "n = int(input())\n\n_min = -2 * 10 ** 9\n_max = 2 * 10 ** 9\n\nfor q in range(n):\n t, n, ans = input().split()\n if t == \">\":\n if ans == \"Y\":\n _min = max(_min, int(n) + 1)\n elif ans == \"N\":\n _max = min(_max, int(n))\n\n elif t == \">=\":\n if ans == \"Y\":\n _min = max(_min, int(n))\n elif ans == \"N\":\n _max = min(_max, int(n) - 1)\n\n elif t == \"<\":\n if ans == \"Y\":\n _max = min(_max, int(n) - 1)\n elif ans == \"N\":\n _min = max(_min, int(n))\n\n elif t == \"<=\":\n if ans == \"Y\":\n _max = min(_max, int(n))\n elif ans == \"N\":\n _min = max(_min, int(n) + 1)\n\nif _min > _max:\n print('Impossible')\n\nelse:\n print(_min)\n", "minimum = -2000000000\nmaximum = 2000000000\n\nn = int(input())\n\nwhile(n > 0):\n n -= 1\n\n entrada = input().split()\n\n q = entrada[0]\n num = int(entrada[1])\n result = entrada[2]\n\n if(q == \">\" and result == \"Y\"):\n minimum = max(minimum, num + 1)\n elif(q == \">\" and result == \"N\"):\n maximum= min(maximum, num)\n elif(q == \">=\" and result == \"Y\"):\n minimum = max(minimum, num)\n elif(q == \">=\" and result == \"N\"):\n maximum= min(maximum, num - 1)\n \n elif(q == \"<\" and result == \"Y\"):\n maximum= min(maximum, num - 1)\n elif(q == \"<\" and result == \"N\"):\n minimum = max(minimum, num)\n elif(q == \"<=\" and result == \"Y\"):\n maximum= min(maximum, num)\n elif(q == \"<=\" and result == \"N\"):\n minimum = max(minimum, num + 1)\n\nif (minimum <= maximum):\n print(minimum)\nelse:\n print(\"Impossible\")\n \t \t\t \t \t \t\t \t \t\t\t\t \t\t\t \t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nmn = -2*10**9\r\nmx = 2*10**9\r\n\r\nfor i in range(int(input())):\r\n guess, x, y = input().strip().split()\r\n x = int(x)\r\n if y == \"Y\":\r\n if guess == '>':\r\n mn = max(mn, x+1)\r\n elif guess == '>=':\r\n mn = max(mn, x)\r\n elif guess == '<':\r\n mx = min(mx, x-1)\r\n else:\r\n mx = min(mx, x)\r\n else:\r\n if guess == '>':\r\n mx = min(mx, x)\r\n elif guess == '>=':\r\n mx = min(mx, x - 1)\r\n elif guess == '<':\r\n mn = max(mn, x)\r\n else:\r\n mn = max(mn, x + 1)\r\n\r\nif mn > mx:\r\n print(\"Impossible\")\r\nelse:\r\n print(mn)\r\n\r\n\"\"\"\r\n4\r\n>= 1 Y\r\n< 3 N\r\n<= -3 N\r\n> 55 N\r\n\r\n3\r\n\"\"\"\r\n", "_List = []\nt = int(input())\nwhile(t) :\n\tt-=1\n\ts = []\n\ts = input().split()\n\tif s[2] == 'N':\n\t\tif s[0] == '>=' : \n\t\t\ts[0] = '<'\n\t\telif s[0] == '<=' :\n\t\t\ts[0] = '>'\n\t\telif s[0] == '>' :\n\t\t\ts[0] = '<='\n\t\telse : \n\t\t\ts[0] = '>='\n\t\t\n\t_List.append(s)\n\nl = -2000000000\nr = 2000000000\ni = 0\nwhile(1) :\n\tif (l > r or i == len(_List)) : break\n\tif (_List[i][0] == \">=\") :\n\t\tl = max(int(_List[i][1]), l)\n\tif (_List[i][0] == \">\") :\n\t\tl = max(int(_List[i][1]) + 1 , l)\n\tif (_List[i][0] == \"<=\") :\n\t\tr = min(int(_List[i][1]), r)\n\tif (_List[i][0] == \"<\") :\n\t\tr = min(int(_List[i][1]) - 1, r)\n\ti+=1\nif (l<=r) :\n\tprint(l)\nelse :\n\tprint(\"Impossible\")\t\n\t\n\t \t\t \t \t\t \t \t \t\t \t\t\t\t", "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\nn = int(input().strip())\r\n\r\ny1, y2 = -2000000000, 2000000000\r\ncomplement = {'>=': '<', '<=': '>', '>': '<=', '<': '>='}\r\nans = True\r\n\r\nfor i in range(n):\r\n query = input().strip().split()\r\n \r\n if query[-1] == 'N':\r\n query[0] = complement[query[0]]\r\n \r\n x = int(query[1])\r\n \r\n if query[0] == '>=':\r\n if y2 < x:\r\n ans = False\r\n y1 = max(y1, x)\r\n elif query[0] == '>':\r\n if y2 <= x:\r\n ans = False\r\n y1 = max(y1, x+1)\r\n elif query[0] == '<=':\r\n if y1 > x:\r\n ans = False\r\n y2 = min(y2, x)\r\n elif query[0] == '<':\r\n if y1 >= x:\r\n ans = False\r\n y2 = min(y2, x-1)\r\n \r\nif not ans:\r\n print(\"Impossible\")\r\nelse:\r\n print(y1)\r\n" ]

[ "mod=10**9+7\r\n\r\nn=int(input())\r\na=[1]+list(map(int,input().split()))+[1]\r\nans=[0]*(2*n)\r\ncnt=[1]\r\nfor i in a[1:]:\r\n cnt.append(cnt[-1]*i%mod)\r\n\r\ndp=[0]*2*n\r\nfor i in range(n):\r\n for j in range(1,2*n):\r\n ans[j]+=cnt[i]*dp[j]\r\n ans[j]%=mod\r\n ndp=[0]*2*n\r\n for j in range(2*n-1):\r\n ndp[j+1]=dp[j]\r\n res=1\r\n c=(a[i+1]-1)*pow(a[i+1],mod-2,mod)%mod\r\n for j in range(i+1,n):\r\n res*=a[j]\r\n res%=mod\r\n ndp[j-i+1]+=res*c\r\n ndp[j-i+1]%=mod\r\n ans[j-i]+=cnt[i]*res\r\n ans[j-i]%=mod\r\n ndp[1]=1\r\n dp=ndp\r\n\r\ninv2=pow(2,mod-2,mod)\r\nans=[i*inv2%mod for i in ans[1:-1]]\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\na = list(map(int, input().split()))\r\nmod = pow(10, 9) + 7\r\nans = [0] * (2 * n - 2)\r\nb = list(a)\r\nfor i in range(1, n - 1):\r\n b[i] *= b[i - 1]\r\n b[i] %= mod\r\ns = 0\r\nfor i in range(n - 2, -1, -1):\r\n s += b[i]\r\n s %= mod\r\n ans[i] = s\r\ndp = [0] * (2 * n - 2)\r\nu = a[0]\r\nfor i in range(1, n):\r\n v = u\r\n for j in range(i, n):\r\n for _ in range(min(1, i ^ j) + 1):\r\n dp[i + j - 1] += u * v % mod\r\n dp[i + j - 1] %= mod\r\n if j < n - 1:\r\n v *= a[j]\r\n v %= mod\r\n if i < n - 1:\r\n u *= a[i]\r\n u %= mod\r\nl = 0\r\nu = a[0]\r\ns = pow(2, mod - 2, mod)\r\nfor i in range(1, n):\r\n inv = pow(a[i - 1], mod - 2, mod)\r\n for _ in range(2):\r\n s *= inv\r\n s %= mod\r\n c = a[i - 1] * (a[i - 1] - 1) % mod * s % mod\r\n s *= a[i - 1]\r\n s %= mod\r\n for j in range(l, 2 * n - 2):\r\n ans[j - l] += c * dp[j] % mod\r\n ans[j - l] %= mod\r\n l += 2\r\n v = u\r\n for j in range(i, n):\r\n for _ in range(min(1, i ^ j) + 1):\r\n dp[i + j - 1] -= u * v % mod\r\n dp[i + j - 1] %= mod\r\n if j < n - 1:\r\n v *= a[j]\r\n v %= mod\r\n if i < n - 1:\r\n u *= a[i]\r\n u %= mod\r\nsys.stdout.write(\" \".join(map(str, ans)))" ]

[ "n = int(input())\r\nl = []\r\nm = []\r\nfor i in range(n):\r\n X1, Y1, X2, Y2 = map(int, input().split())\r\n m1 = (abs(X2 - X1)) ** 3\r\n l.append([X1, Y1, X2, Y2])\r\n m.append(m1)\r\nX1, Y1, X2, Y2 = l[0][0], l[0][1], l[0][2], l[0][3]\r\nif X1 > X2: X2, X1 = X1, X2\r\nif Y1 > Y2: Y1, Y2 = Y2, Y1\r\nans = n\r\nfor i in range(1, n):\r\n for j in range(i, 0, -1):\r\n x1, y1, x2, y2 = l[j - 1][0], l[j - 1][1], l[j - 1][2], l[j - 1][3]\r\n if x1 > x2: x2, x1 = x1, x2\r\n if y1 > y2: y1, y2 = y2, y1\r\n numx, numy, den = 0, 0 , 0\r\n for k in range(i, j - 1, -1):\r\n a = (l[k][0] + l[k][2]) / 2\r\n b = (l[k][1] + l[k][3]) / 2\r\n m = (abs(l[k][2] - l[k][0])) ** 3\r\n numx += m * a\r\n numy += m * b\r\n den += m\r\n xcm = numx / den\r\n ycm = numy / den\r\n if x1 <= xcm <= x2 and y1 <= ycm <= y2: pass\r\n else:\r\n ans = i\r\n break\r\n if ans != n: break\r\nprint(ans)" ]

[ "n,pos,l,r=[int(i) for i in input().split()]\r\nif l==1 and r==n:\r\n print(0)\r\nelif l==1 and r!=n:\r\n print(abs(pos-r)+1)\r\nelif l!=1 and r==n:\r\n print(abs(pos-l)+1)\r\nelse:\r\n print(r-l+min(abs(pos-l),abs(pos-r))+2)\r\n", "n, p, l, r = map(int, input().split())\r\nres = 0\r\nif p <= l:\r\n res += l - p\r\n if l > 1: res += 1\r\n if r < n:\r\n res += r - l\r\n res += 1\r\nelif p >= r:\r\n res += p - r\r\n if r < n: res += 1\r\n if l > 1:\r\n res += r - l\r\n res += 1\r\nelif l != 1 or r != n: \r\n if l == 1:\r\n res = r - p + 1\r\n elif r == n:\r\n res = p - l + 1\r\n else:\r\n d = [r - p, p - l]\r\n res = min(d) * 2 + max(d) + 2\r\nprint(res)", "n, pos, l, r=map(int, input().split())\r\nif l==1 and r==n:\r\n\tprint(0)\r\nelif l==1 and r!=n:\r\n\tprint(abs(pos-r)+1)\r\nelif l!=1 and r==n:\r\n\tprint(abs(pos-l)+1)\r\nelse:\r\n\tprint(r-l+2+min(abs(pos-l), abs(pos-r)))", "'''\r\nРассмотрим такой случай:\r\n6 3 2 5\r\nn pos l r\r\n\r\n1 2 3 4 5 6\r\n ^\r\n ^ ^ ^ ^\r\n\r\nВначале закрываем вкладки слева, т.к. pos - l < r - pos.\r\nДля того, чтобы закрыть все вкладки слева необходимо перейти к позиции l [и затратить при этом abs(pos - l) секунд].\r\nДалее следует перейти к позиции r [и затратить при этом abs(r - pos) секунд].\r\n'''\r\n(n, pos, l, r) = map(int, input().split())\r\nres = 0\r\nif pos - l < r - pos:\r\n if l != 1: # проверяем, а нужно ли вообще закрывать вкладки слева\r\n res += abs(pos - l) + 1\r\n pos = l\r\n if r != n: # проверяем, а нужно ли вообще закрывать вкладки справа\r\n res += abs(r - pos) + 1\r\nelse:\r\n if r != n: # проверяем, а нужно ли вообще закрывать вкладки справа\r\n res += abs(r - pos) + 1\r\n pos = r\r\n if l != 1: # проверяем, а нужно ли вообще закрывать вкладки слева\r\n res += abs(pos - l) + 1\r\nprint(res)", "import math\r\nn,pos,l,r=map(int,input().split())\r\nif l==1 and r==n:\r\n print(0)\r\nelif l==1:\r\n print(int(math.fabs(r-pos))+1)\r\nelif r==n:\r\n print(int(math.fabs(pos-l))+1)\r\nelse:\r\n if pos>=l and pos <=r:\r\n m=max(r-pos,pos-l)\r\n n=min(r-pos,pos-l)\r\n print(n*2+m+2)\r\n elif pos <l:\r\n print(r-pos+2)\r\n else:\r\n print(pos-l+2)", "inp = input().split(\" \")\r\nn = int(inp[0])\r\npos = int(inp[1])\r\nl = int(inp[2])\r\nr = int(inp[3])\r\nt = 0\r\nif r - l + 1 >= n:\r\n t = 0\r\nelse:\r\n if pos < l:\r\n t += l - pos + 1\r\n if r < n:\r\n t += r - l + 1\r\n if pos > r:\r\n t += pos - r + 1\r\n if l > 1:\r\n t += r - l + 1\r\n if pos >= l and pos <= r:\r\n if pos - l <= r - pos and l > 1:\r\n t += pos - l + 1\r\n if r < n:\r\n t += r - l + 1\r\n if pos - l <= r - pos and l == 1:\r\n t += r - pos + 1\r\n if pos - l > r - pos and r < n:\r\n t += r - pos + 1\r\n if l > 1:\r\n t += r - l + 1\r\n if pos - l > r - pos and r == n:\r\n t += pos - l + 1\r\nprint(t)", "n,pos,l,r=map(int,input().split())\r\nif l==1 and r==n:\r\n print(0)\r\nelse:\r\n if l==1 and r!=n:\r\n print(abs(pos-r)+1)\r\n elif r==n and l!=1:\r\n print(abs(pos-l)+1)\r\n else:\r\n res = min(abs(r - pos), abs(l - pos)) + 1\r\n print(res + abs(r - l) + 1)\r\n", "n, pos, l, r = map(int, input().strip().split())\n\n\nres_a = 0\nres_b = 0\n\nright = int(n > r)\nleft = int(l > 1)\n\nif pos < r and pos > l: \n res_a += (r - pos) * right\n pos_r = r\n res_b += (pos - l) * left\n pos_l = l\n\nif pos >= r:\n pos_l = l\n res_b += pos - l\n pos_r = pos\n\nif pos <= l:\n pos_r = r\n res_a += r - pos\n pos_l = pos\n\n\n\n\n# print(pos_l, pos_r, res_a, res_b)\nres_a += (pos_r - r) * int(left or right) + int(right) + (r - l + 1) * int(left)\nres_b += (l - pos_l) * int(left or right) + int(left) + (r - l + 1) * int(right)\n\n# print(pos_l, pos_r, res_a, res_b)\nprint(min(res_a, res_b))", "n,p,i,r=list(map(int,input().split()))\r\nta=0\r\nif i!=1 and r!=n:\r\n op=abs(p-i)\r\n sa=abs(p-r)\r\n ta+=min(op,sa)\r\n ta+=(r-i)\r\n ta+=1\r\n print(ta+1)\r\nelif i==1 and r!=n:\r\n sa=abs(p-r)\r\n ta+=sa\r\n ta+=1\r\n print(ta)\r\nelif i!=1 and r==n:\r\n op=abs(p-i)\r\n ta+=op\r\n ta+=1\r\n print(ta)\r\nelse:\r\n print(\"0\")\r\n ", "n, pos, l, r = map(int, input().split())\r\nif l == 1:\r\n if r == n:\r\n print(0)\r\n else:\r\n print(abs(r - pos) + 1)\r\nelse:\r\n if r == n:\r\n print(abs(l - pos) + 1)\r\n elif abs(l - pos) > abs(r - pos):\r\n print(abs(r - pos) + abs(r - l) + 2)\r\n else:\r\n print(abs(l - pos) + abs(l - r) + 2)\r\n\r\n", "n,pos,l,r=map(int,input().split())\r\ndiff=r-l\r\nif l>1: \r\n lb=1\r\nelse:\r\n lb=0\r\nif r<n:\r\n rb=1\r\nelse:\r\n rb=0\r\n\r\nans=0\r\nif(lb and rb):\r\n ans=min(abs(pos-l),abs(pos-r))+diff\r\n ans+=2\r\nelif(lb):\r\n ans=abs(pos-l)+1\r\nelif(rb):\r\n ans=abs(pos-r)+1\r\nelse: pass\r\nprint(ans)", "import sys\n\nn,pos,l,r=map(int,input().split())\n# n = int(n)\n# pos = int(pos)\n# l = int(l)\n# r = int(r)\ntime = 0\n\nif(pos<l):\n\tif(n>r):\n\t\ttime = r-pos+2\n\telse:\n\t\ttime = l-pos+1\nelif(pos>r):\n\tif(l>1):\n\t\ttime = pos-l+2\n\telse:\n\t\ttime = pos-r+1\nelse:\n\tif(l>1 and r<n):\n\t\ttime = min(pos-l, r-pos)+r-l+2\n\telif(r<n):\n\t\ttime = r-pos+1\n\telif(l>1):\n\t\ttime = pos-l+1\n\telse:\n\t\ttime = 0\n\nprint (time)", "n,pos,l,r=map(int,input().split())\r\nif l==1 and r==n:\r\n print(0)\r\nelif l==1:\r\n print(abs(pos-r)+1)\r\nelif r==n:\r\n print(abs(pos-l)+1)\r\nelse:\r\n print(min(abs(pos-l),abs(pos-r))+abs(l-r)+2)", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n, pos, l, r = map(int, input().split(' '))\n\n if l == 1 and r == n: print(0)\n elif l == 1: print(abs(pos - r) + 1)\n elif r == n: print(abs(pos - l) + 1)\n else: print(r - l + 1 + min(abs(pos - l), abs(pos - r)) + 1)\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", "#!/usr/bin/env python\r\n# coding=utf-8\r\n# 817079\r\n\r\nn,pos,l,r = map(int,input().split())\r\n\r\nif l == 1 and r == n:\r\n print(0)\r\nelif l == 1:\r\n print(abs(r-pos)+1)\r\nelif r == n:\r\n print(abs(l-pos)+1)\r\nelse:\r\n print(min(abs(l-pos),abs(r-pos)) + r-l + 2)\r\n\r\n\r\n", "# ~ T = int(input())\r\nT = 1\r\nfor i in range(1,T + 1):\r\n\tn,pos,l,r = map(int,input().split())\r\n\tif r - l + 1 == n:\r\n\t\tprint(0)\r\n\t\tcontinue\r\n\tif l == 1:\r\n\t\tprint(abs(r - pos) + 1)\r\n\t\tcontinue\r\n\tif r == n:\r\n\t\tprint(abs(pos - l) + 1)\r\n\t\tcontinue\r\n\tmin_res = abs(l - pos) + 1 + (r - l) + 1\r\n\tmin_res = min(min_res,abs(r - pos) + 1 + (r - l) + 1)\r\n\tprint(min_res)\r\n", "n, pos, l, r = [int(inp) for inp in input().split()]\r\n\r\ndef right_clean():\r\n global r, max_value, pos, time\r\n \r\n if r != max_value:\r\n time += (r - pos + 1)\r\n pos = r\r\n\r\ndef left_clean():\r\n global l, min_value, pos, time\r\n \r\n if l != min_value:\r\n time += (pos - l + 1)\r\n pos = l\r\n\r\n\r\nmin_value = 1\r\nmax_value = n\r\n\r\ntime = 0\r\nif pos == l and l != min_value:\r\n time += 1\r\n min_value = l\r\n \r\nif pos == r and r != max_value:\r\n time += 1\r\n max_value = r\r\n\r\nif pos >= l and pos <= r:\r\n \r\n if pos - l < r - pos:\r\n left_clean()\r\n right_clean()\r\n else:\r\n right_clean()\r\n left_clean()\r\n \r\n \r\nelif pos < l:\r\n time += (l - pos + 1)\r\n pos = l\r\n \r\n if r != max_value:\r\n time += (r - pos + 1)\r\n pos = r\r\n\r\nelif pos > r:\r\n time += (pos - r + 1)\r\n pos = r\r\n \r\n if l != min_value:\r\n time += (pos - l + 1)\r\n pos = l\r\n\r\nprint(time)", "n,p,l,r=map(int,input().split())\r\nif l==1 and r==n:print(0)\r\nelif l==1:\r\n print(abs(r-p)+1)\r\nelif r==n:\r\n print(abs(l-p)+1)\r\nelse:\r\n print(min(abs(l-p)+r-l+2,abs(r-p)+r-l+2))", "n, pos, l, r = map(int,input().split())\r\n\r\nif l==1 and r==n:\r\n print(0)\r\nelif l==1:\r\n print(1+abs(pos-r))\r\nelif r==n:\r\n print(1+abs(pos-l))\r\nelse:\r\n print(r-l+2+min(abs(pos-r),abs(pos-l)))\r\n\r\n", "n, pos, l, r = [int(t) for t in input().split()]\nif l == 1 and r == n:\n\tprint(0)\nif l == 1 and r != n:\n\tprint(abs(r - pos) + 1)\nif r == n and l != 1:\n\tprint(abs(l - pos) + 1)\nif r != n and l != 1:\n\tprint(r - l + min(abs(r - pos), abs(l - pos)) + 2)\n", "a,b,c,d = map(int,input().split())\r\nif d == a and c == 1:\r\n print(0)\r\nelif d == a:\r\n print(abs(b-c)+1)\r\nelif c == 1:\r\n print(abs(b-d)+1)\r\nelse:\r\n print(min(abs(b-d)+1+abs(d-c)+1,abs(b-c)+1+abs(c-d)+1))", "n,pos,a,b=map(int,input().split())\r\nif a==1 and b==n:\r\n ans=0\r\nif a==1 and b!=n:\r\n ans=abs(pos-b)+1\r\nif a!=1 and b==n:\r\n ans=abs(pos-a)+1\r\nif a!=1 and b!=n:\r\n ans=b-a+min(abs(pos-a),abs(pos-b))+2\r\nprint(ans)\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n, pos, l, r):\r\n if 1==l and n==r:\r\n answer = 0\r\n elif 1 < l and n==r:\r\n answer = abs(pos-l)+1 \r\n elif r < n and 1==l:\r\n answer = abs(r-pos)+1\r\n else:\r\n answer1 = abs(pos-l)+abs(l-r)+2\r\n answer2 = abs(pos-r)+abs(l-r)+2\r\n answer = min(answer1, answer2)\r\n print(answer)\r\n \r\n \r\nn, pos, l, r = [int(x) for x in input().split()]\r\nprocess(n, pos, l, r)", "from sys import stdin, stdout\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\nfor _ in range(1):#nmbr()):\r\n n, cur, l, r=lst()\r\n if l==1 and r==n:\r\n print(0)\r\n elif l==1 and r!=n:\r\n print(abs(r-cur)+1)\r\n elif r==n and l!=1:\r\n print(abs(cur-l)+1)\r\n else:\r\n disa=abs(l-cur)\r\n disb=abs(r-cur)\r\n ans=min(disa, disb) + (r-l) +2\r\n print(ans)\r\n\r\n", "n, pos, l, r = map(int, input().split())\r\nleft = l - 1\r\nright = n - r\r\nif right == 0 and left == 0:\r\n print(0)\r\nelif left == 0:\r\n if pos <= r:\r\n print(r - pos + 1)\r\n else:\r\n print(pos - r + 1)\r\nelif right == 0:\r\n if pos >= l:\r\n print(pos - l + 1)\r\n else:\r\n print(l - pos + 1)\r\nelse:\r\n to_left = abs(l - pos)\r\n to_right = abs(r - pos)\r\n between = abs(r - l)\r\n print(min(to_left + 1 + between + 1, to_right + 1 + between + 1))", "lis = input().split()\nlis = [int(o) for o in lis]\nn = lis[0]\np = lis[1]\nl = lis[2]\nr = lis[3]\nc = r-l+2\nb = 0\nif p <l:\n if n>r:\n b = l-p+r-l+2\n else:\n b = l-p+1\n\nelif r>=p and p>=l :\n if l>1 and n>r:\n if (p-l) <= (r-p):\n b = p-l+r-l+2\n else:\n b = r-p+r-l+2\n elif l>1 and n == r:\n b = p-l+1\n elif l==1 and n>r:\n b = r-p+1\n else:\n b = 0\n\nelse:\n if l>1:\n b = p-r+r-l+2\n else:\n b = p-r+1\n\nprint(b)\n", "\r\nn,pos,l,r=input('').strip().split(' ')\r\nn,pos,l,r=int(n),int(pos),int(l),int(r)\r\nt=0\r\nif pos<=r and pos>=l:\r\n if l==1 and r==n:\r\n t=0\r\n elif l==1:\r\n t+=(r-pos)\r\n t+=1\r\n elif r==n:\r\n t+=(pos-l)\r\n t+=1\r\n elif l>1 and r<n:\r\n t+=min(abs(pos-l),abs(r-pos))\r\n t+=1\r\n t+=(r-l)\r\n t+=1\r\nelse:\r\n if pos<l:\r\n t+=(l-pos)\r\n t+=1\r\n if r!=n:\r\n t+=(r-l)\r\n t+=1\r\n if pos>r:\r\n t+=(pos-r)\r\n t+=1\r\n if l!=1:\r\n t+=(r-l)\r\n t+=1\r\nprint(t)", "inp=lambda:map(int,input().split())\r\nn,pos,l,r=inp()\r\n\r\na=abs(pos-l)+1+r-l+1;\r\nb=abs(pos-r)+1+r-l+1;\r\nc=1000000\r\nd=1000000\r\nif l==1: c=abs(pos-r)+1\r\nif r==n: d=abs(pos-l)+1\r\nif(l==1 and r==n): c=0\r\n\r\nprint(min(a,b,c,d))", "n, pos, l, r = map(int, input().split())\r\nif l == 1 and r == n:\r\n print(0)\r\nelif l == 1:\r\n print(abs(pos-r) + 1)\r\nelif r == n:\r\n print(abs(pos-l) + 1)\r\nelse:\r\n print(min(abs(pos-r), abs(pos-l)) + r-l + 2)", "n,pos,l,r = map(int,input().split())\r\n\r\ncur = pos\r\n\r\nfs = 0\r\nss = 0\r\n\r\nif l > 1:\r\n\tfs += abs(cur-l)+1\r\n\tcur = l\r\nif r < n:\r\n\tfs += abs(cur-r)+1\r\ncur = pos\r\n\r\nif r < n:\r\n\tss += abs(cur-r)+1\r\n\tcur = r\r\nif l > 1:\r\n\tss += abs(cur-l)+1\r\n\r\nprint(min(fs,ss))", "n,pos,l,r = map(int, input().split())\r\ndl,dr = abs(pos-l) + 1, abs(pos-r) + 1\r\nprint(dr*(r<n) if l==1 else dl if r==n else min(dl,dr)+r-l+1)", "n,p,l,r=map(int,input().split())\r\nll=[0]*n\r\nfor i in range(l-1,r):\r\n ll[i]=1\r\nif 0 not in ll:\r\n print(0)\r\nelse:\r\n if ll[-1]==0 and ll[0]==0:\r\n print(min(abs(l - p), abs(r - p)) + r - l + 2)\r\n elif ll[0]==0:\r\n print(abs(l-p)+1)\r\n elif ll[-1]==0:\r\n print(abs(r-p)+1)", "n,pos,l,r = [int(x) for x in input().split()]\r\n\r\n\r\nleft_closed = (l==1)\r\nright_closed = (r==n)\r\n\r\nmoves = 0\r\nwhile not left_closed or not right_closed:\r\n if r<pos:\r\n pos-=1\r\n elif pos<l:\r\n pos+=1\r\n elif pos<r and not right_closed and (left_closed or r-pos<=pos-l):\r\n pos+=1\r\n elif pos>l and not left_closed and not (not right_closed and pos==r):\r\n pos-=1\r\n #elif not left_closed and pos>l and right_closed:\r\n # pos -= 1\r\n #elif not right_closed and pos<r and left_closed:\r\n # pos+=1\r\n else: \r\n if l==pos and not left_closed:\r\n left_closed = True\r\n elif r==pos:\r\n right_closed = True\r\n moves+=1\r\n\r\nprint(moves)\r\n\r\n#left_closed = (l==1)\r\n#right_closed = (r==n)\r\n#\r\n#moves = 0\r\n#while not left_closed or not right_closed:\r\n# if pos<=r and not right_closed:\r\n# moves += r-pos\r\n# pos = r\r\n# right_closed = True\r\n# moves+=1\r\n# elif l<=pos and not left_closed:\r\n# moves += pos-l\r\n# pos = l\r\n# left_closed = True\r\n# moves+=1\r\n# elif not right_closed and (left_closed or r-pos<=pos-l):\r\n# moves += r-pos\r\n# pos = r\r\n# else:\r\n# moves += pos-l\r\n# pos = l\r\n", "n, pos, l, r = map(int, input().split())\nif (l==1 and r==n):\n print(0)\nelif (l==1):\n print(abs(pos-r)+1)\nelif (r==n):\n print(abs(l-pos)+1)\nelse:\n # both left and right side bt.\n if pos<= l:\n print(r-l+l-pos+2)\n elif pos >= r:\n print(r-l+pos-r+2)\n else:\n print(r-l+min(pos-l, r-pos)+2)\n\n", "n, pos, a, b = map(int,input().split())\r\n\r\nlf, rf = a - 1, n - b\r\nif lf == rf == 0:\r\n\tprint(\"0\")\r\nelif lf == 0:\r\n\tprint(abs(pos-b)+1)\r\nelif rf == 0:\r\n\tprint(abs(pos-a)+1)\r\nelse:\r\n\tcl = abs(a-pos) + 1\r\n\tcr = abs(b-pos) + 1\r\n\txn = abs(a-b) + 1\r\n\tif cl < cr:\r\n\t\tprint(cl+xn)\r\n\telse:\r\n\t\tprint(cr+xn)", "n,p,l,r=map(int,input().split())\r\nif l==1:\r\n if r<n:\r\n print(abs(r-p)+1)\r\n else:\r\n print(0)\r\nelse:\r\n if r<n:\r\n print(min(abs(p-l),abs(p-r))+(r-l)+2)\r\n else:\r\n print(abs(l-p)+1) ", "n, pos, l, r = map(int, input().split())\r\nif r == n and l == 1:\r\n\tprint(0)\r\nelse:\r\n\tans0 = abs(pos - r) + 1\r\n\tans1 = abs(pos - l) + 1\r\n\tif r < n:\r\n\t\tans1 += abs(r - l) + 1\r\n\tif l > 1:\r\n\t\tans0 += abs(r - l) + 1\r\n\tprint(min(ans1, ans0))", "n, pos, l, r = map(int, input().split())\r\nsec = 0\r\nif (r - l + 1 == n):\r\n sec = 0\r\nelif l == 1:\r\n sec += abs(r - pos) + 1\r\nelif r == n:\r\n sec += abs(pos - l) + 1\r\nelse:\r\n if abs(l - pos) < abs(r - pos):\r\n sec += abs(l - pos) + (r - l)+2\r\n\r\n else:\r\n sec += abs(r - pos) + (r - l)+2\r\n\r\nprint(sec)\r\n", "def minimum_action(number_of_tabs, pos, left, right):\n if left > 1 and right < number_of_tabs: # need to close both sides\n return min(abs(pos-left), abs(pos-right)) + (right-left) + 2\n if left > 1:\n return abs(pos-left) + 1\n if right < number_of_tabs:\n return abs(pos-right) + 1\n return 0\n\n\ndef test():\n assert minimum_action(6, 3, 2, 4) == 5\n assert minimum_action(6, 3, 1, 3) == 1\n assert minimum_action(5, 2, 1, 5) == 0\n\n\nif __name__==\"__main__\":\n n, pos, l, r = [int(i) for i in input().split()]\n print(minimum_action(n, pos, l, r))\n", "n,k,l,r = (int(x) for x in input().strip().split())\r\nans = 0\r\nif k<l:\r\n ans+=l-k;\r\n ans+=1\r\n if r<n:\r\n ans+=(r-l)\r\n ans+=1\r\nelif k>r:\r\n ans+=(k-r)+1\r\n if l>1:\r\n ans+=(r-l)\r\n ans+=1\r\nelse:\r\n if l>1:\r\n if r<n:\r\n ans+=min(k-l,r-k)+2+(r-l);\r\n else:\r\n ans+=(k-l)+1;\r\n else:\r\n if r<n:\r\n ans+=(r-k)+1\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n ", "n, pos, l, r = map(int, input().split())\r\nif r == n and l == 1:\r\n print(0)\r\nelif r == n:\r\n print(abs(pos - l) + 1)\r\nelif l == 1:\r\n print(abs(pos - r) + 1)\r\nelse:\r\n if abs(pos - r) < abs(pos - l):\r\n print(abs(pos - r) + r - l + 2)\r\n else:\r\n print(abs(pos - l) + r - l + 2)\r\n ", "n, pos, l, r = map(int, input().split())\r\nans = 0\r\nif pos < l:\r\n\tans += l-pos+1\r\n\tif r != n:\r\n\t\tans += r-l+1\r\nelif pos <= r:\r\n\tif l == 1 and r == n:\r\n\t\tans = 0\r\n\telif l == 1 and r != n:\r\n\t\tans += r-pos+1\r\n\telif l != 1 and r == n:\r\n\t\tans += pos-l+1\r\n\telse:\r\n\t\tans += min(pos-l+1,r-pos+1)\r\n\t\tans += r-l+1\r\nelse:\r\n\tans += pos-r+1\r\n\tif l != 1:\r\n\t\tans += r-l+1\r\nprint (ans)", "a,b,c,d=map(int,input().split())\r\nif c==1 and d==a:print(0)\r\nelif c==1:print(abs(d-b)+1)\r\nelif d==a:print(abs(b-c)+1)\r\nelse:print(2+d-c+min(abs(b-c),abs(d-b)))", "x=list(map(int,input().split()))\r\npos=x[1]\r\nn=x[0]\r\nl=x[2]\r\nr=x[3]\r\nstep=0\r\nif pos<l :\r\n step=l-pos+1\r\n \r\n if r< n :\r\n step+=r-l+1\r\nelif pos>r:\r\n step=pos-r+1\r\n \r\n if l> 1 :\r\n step+=r-l+1\r\nelse:\r\n if l>1 and n>r:\r\n step+=min(pos-l,r-pos)+r-l+2\r\n elif l==1 and n>r:\r\n step=r-pos+1\r\n elif l>1 and n==r:\r\n step+=pos-l+1\r\n else:\r\n step=0\r\n\r\n\r\n\r\nprint(step)", "n, pos, l, r = map(int, input().split())\r\n\r\nif r == n and l != 1:\r\n print(abs(l - pos) + 1)\r\nelif l == 1 and r != n:\r\n print(abs(r - pos) + 1)\r\nelif l == 1 and r == n:\r\n print(0)\r\nelse:\r\n if abs(r - pos) == min(abs(r - pos), abs(l - pos)):\r\n ans = abs(r - pos) + 1\r\n ans += r - l + 1\r\n print(ans)\r\n elif abs(l - pos) == min(abs(r - pos), abs(l - pos)):\r\n ans = abs(l - pos) + 1\r\n ans += r - l + 1\r\n print(ans)\r\n", "n, pos, l, r = map(int, input().split())\r\n\r\nans = 0\r\n\r\na = abs(pos - l)\r\nb = abs(pos - r)\r\n\r\nif l == 1 and r == n:\r\n ans = 0\r\nelif l > 1 and r == n:\r\n ans = a + 1 \r\nelif l == 1 and r < n:\r\n ans = b + 1\r\nelse:\r\n ans = min(a, b) + 2 - l + r\r\n\r\nprint(ans) \r\n", "n, pos, l, r = map(int, input().split(' '))\r\n\r\nif r - l + 1 == n:\r\n sum = 0 \r\nelif l == 1:\r\n sum = abs(r - pos) + 1\r\nelif r == n:\r\n sum = abs(l - pos) + 1\r\nelif abs(pos - r) >= abs(pos - l):\r\n sum = abs(pos - l) + (r-l) + 2\r\nelse:\r\n sum = abs(pos - r) + (r-l) + 2\r\nprint(sum)", "n, pos, l, r = map(int, input().split())\r\n\r\nif l == 1:\r\n ans = 0\r\n if r == n:\r\n print(0)\r\n exit()\r\n else:\r\n ans += abs(r-pos)\r\n ans += 1\r\n print(ans)\r\n exit()\r\n\r\nif r == n:\r\n ans = 0\r\n if l == 1:\r\n print(0)\r\n exit()\r\n else:\r\n ans += abs(l-pos)\r\n ans += 1\r\n print(ans)\r\n exit()\r\n\r\nif pos < l:\r\n ans = 0\r\n ans += l-pos\r\n ans += 1\r\n ans += r-l\r\n ans += 1\r\nelif l <= pos <= r:\r\n temp1 = 0\r\n temp1 += pos-l\r\n temp1 += 1\r\n temp1 += r-l\r\n temp1 += 1\r\n\r\n temp2 = 0\r\n temp2 += r-pos\r\n temp2 += 1\r\n temp2 += r-l\r\n temp2 += 1\r\n ans = min(temp1, temp2)\r\nelse:\r\n ans = 0\r\n ans += pos-r\r\n ans += 1\r\n ans += r-l\r\n ans += 1\r\nprint(ans)\r\n", "n, pos, l, r = map(int, input().split())\r\ntotal = 0\r\nif pos >= l and pos <= r:\r\n if pos-l <= r-pos:\r\n if l != 1:\r\n total += (pos-l+1)\r\n if r != n:\r\n total += (r-l+1)\r\n else:\r\n if r != n:\r\n total += (r-pos+1)\r\n else:\r\n if r != n:\r\n total += (r-pos+1)\r\n if l != 1:\r\n total += (r-l+1)\r\n else:\r\n if l != 1:\r\n total += (pos-l+1)\r\nelse:\r\n if pos < l:\r\n total += (l-pos+1)\r\n if r != n:\r\n total += (r-l+1)\r\n else:\r\n total += (pos-r+1)\r\n if l != 1:\r\n total += (r-l+1)\r\n\r\nprint(total)\r\n", "n,pos,l,r=map(int, input().split())\r\nres=0\r\nif l>1 and r<n:\r\n if pos >= r:\r\n res+=pos-r+1\r\n elif pos <= l:\r\n res+=l-pos+1\r\n else:\r\n if r-pos>=pos-l:\r\n res+=pos-l+1\r\n else:\r\n res+=r-pos+1\r\n res+=r-l+1\r\nelif r==n and l==1:\r\n res=0\r\nelif l==1:\r\n if pos<=r:\r\n res+=r-pos+1\r\n else:\r\n res+=pos-r+1\r\nelif r==n:\r\n if pos>=l:\r\n res+=pos-l+1\r\n else:\r\n res+=l-pos+1\r\nprint(res)", "n,pos,l,r=[*map(int,input().split())]\r\nif(l==1 and r==n):\r\n print(0)\r\nelif(l==1):\r\n print((abs(r-pos))+1)\r\nelif(r==n):\r\n print(abs(pos-l)+1)\r\nelif(pos==r and l==r):\r\n print(1+1)\r\nelif(pos<=l):\r\n print(l-pos+1+(r-l)+1)\r\nelif(pos>=r):\r\n print(pos-r+1+(r-l)+1)\r\nelse:\r\n print(min(abs(pos-l)+r-l+2,abs(r-l)+abs(r-pos)+2))\r\n", "\n\ndef solution():\n if l == 1 and r == n:\n return 0\n elif l == 1:\n return abs(pos - r) + 1\n elif r == n:\n return abs(pos - l) + 1\n else:\n ans = 0\n ans += min(abs(pos - l), abs(pos-r))\n ans += r - l\n return ans + 2\n\n\nif __name__ == '__main__':\n n, pos, l, r = map(int, input().rstrip().split())\n print(solution())", "n, pos, l, r = [int(x) for x in input().split()]\r\ncount = 0\r\nif pos in range(l, r + 1):\r\n if pos - l < r - pos:\r\n if len(range(1, l + 1)) != 1:\r\n count += pos - l + 1\r\n pos = l\r\n if len(range(r, n + 1)) != 1:\r\n count += r - pos + 1\r\n pos = r \r\n else:\r\n if len(range(r, n + 1)) != 1:\r\n count += r - pos + 1\r\n pos = r\r\n if len(range(1, l + 1)) != 1:\r\n count += pos - l + 1\r\n pos = l\r\nelse:\r\n if l == 1 and r == n:\r\n count = 0\r\n elif l == 1 or r == n:\r\n if l > pos:\r\n count += l - pos + 1\r\n elif pos > r:\r\n count += pos - r + 1\r\n else:\r\n if l > pos:\r\n count += l - pos + 1\r\n count += r - l + 1\r\n elif pos > r:\r\n count += pos - r + 1\r\n count += r - l + 1 \r\nprint(count)", "n,pos,l,r=map(int, input().split())\nif l==1 and r==n:\n\tprint(0)\nelif pos<l:\n\tif r==n:\n\t\tprint(l-pos+1)\n\telse:\n\t\tprint(r-pos+2)\nelif pos>r:\n\tif l==1:\n\t\tprint(pos-r+1)\n\telse:\t\n\t\tprint(pos-l+2)\nelif pos>l and pos<r:\n\tif l==1:\n\t\tprint(r-pos+1)\n\telif r==n:\n\t\tprint(pos-l+1)\n\telse:\n\t\tprint(min(pos-l,r-pos)+r-l+2)\nelse:\n\tif l==1 or r==n:\n\t\tif r!=n and pos==r:\n\t\t\tprint(1)\n\t\telif l!=1 and pos==l:\n\t\t\tprint(1)\n\t\telse:\n\t\t\tprint(r-l+1)\n\telse:\n\t\tprint(r-l+2)", "n, pos, l, r = map(int, input().split())\r\nif l==1 and r==n:\r\n print(0)\r\nelif l==1 and r!=n:\r\n print(abs(r-pos)+1)\r\nelif l!=1 and r==n:\r\n print(abs(l-pos)+1)\r\nelse:\r\n print((r-l)+min(abs(l-pos), abs(r-pos))+2)\r\n\r\n", "n,p,l,r = list(map(int,input().split()))\r\nif l==1 and r!=n:\r\n print(abs(r-p)+1)\r\nelif r==n and l!=1:\r\n print(abs(p-l)+1)\r\nelif r==n and l==1:\r\n print(0)\r\nelse:\r\n if p>=l and p<=r:\r\n if (p-l<r-p):\r\n print((p-l)+2+(r-l))\r\n else:\r\n print((r-p)+2+(r-l))\r\n elif p<l:\r\n print((l-p)+2+(r-l))\r\n else:\r\n print((p-r)+2+(r-l))\r\n", "def main():\r\n n, pos, l, r = map(int, input().split())\r\n\r\n if l == 1 and r == n:\r\n return print(0)\r\n\r\n if l == 1:\r\n return print(abs(r - pos) + 1)\r\n\r\n if r == n:\r\n return print(abs(l - pos) + 1)\r\n\r\n print(min(abs(l - pos), abs(r - pos)) + r - l + 2)\r\n\r\n\r\nmain()\r\n", "import sys\r\n\r\n\r\ndef sanvandong():\r\n m, n, a = map(int, input().split())\r\n u = m // a if m % a == 0 else (m // a) + 1\r\n v = n // a if n % a == 0 else (n // a) + 1\r\n print(u * v)\r\n\r\n\r\ndef coccoc():\r\n n, pos, l, r = map(int, input().split())\r\n if (l == 1 and r == n):\r\n print(0)\r\n exit(0)\r\n if l == 1:\r\n print(abs(r - pos) + 1)\r\n exit(0)\r\n if r == n:\r\n print(abs(l - pos) + 1)\r\n exit(0)\r\n if pos < l:\r\n print((l - pos) + 1 + (r - l) + 1)\r\n exit(0)\r\n if pos > r:\r\n print(pos - r + 1 + r - l + 1)\r\n exit(0)\r\n print(2 + min(pos - l, r - pos) * 2 + max(pos - l, r - pos))\r\n\r\n\r\ndef chiavachia():\r\n y = 0\r\n\r\n\r\ndef leftandRight():\r\n z = 0\r\n\r\n\r\nif __name__ == '__main__':\r\n coccoc()\r\n", "n,pos,l,r = list(map(int,input().split()))\r\nanswer = 0\r\nif pos == l:\r\n if pos != 1:\r\n answer += 1\r\n if r != n:\r\n answer += 1+r-l\r\nelif pos == r:\r\n if pos != n:\r\n answer += 1\r\n if l != 1:\r\n answer += r-l+1\r\nelif pos > r:\r\n answer = pos-r+1\r\n if l != 1:\r\n answer += 1+r-l\r\nelif pos < l:\r\n answer = l-pos + 1\r\n if r != n:\r\n answer += 1+r-l\r\nelse:\r\n if l == 1 and r != n:\r\n answer = r-pos+1\r\n elif l != 1 and r == n:\r\n answer = pos-l+1\r\n elif l != 1 and r != n:\r\n answer = min(r-pos+1+r-l+1,pos-l+1+r-l+1)\r\n \r\nprint(answer)\r\n", "# @author Matheus Alves dos Santos\n\nn, pos, l, r = map(int, input().split())\n\nseconds = 0\nif pos < l:\n seconds += (l - pos)\n pos = l\nif pos > r:\n seconds += (pos - r)\n pos = r\n\nleft,right = (l > 1), (r < n)\n\nif (left and right):\n seconds += + (min(pos - l, r - pos) + (r - l) + 2)\nelif (left):\n seconds += (1 + (pos - l))\nelif (right):\n seconds += (1 + (r - pos))\n\nprint(seconds)\n\n\n", "n,pos,l,r=map(int,input().split())\r\nif l==1 and r==n:\r\n ans=0\r\nelif l==1:\r\n ans=abs(r-pos)+1\r\nelif r==n:\r\n ans=abs(l-pos)+1\r\nelse:\r\n ans=min(abs(l-pos),abs(r-pos))+r-l+2\r\nprint(ans)\r\n", "n,pos,l,r=map(int,input().split())\r\nif pos>=l and pos<=r:\r\n if l==1 and r==n:\r\n print(0)\r\n elif l==1:\r\n print(r-pos+1)\r\n elif r==n:\r\n print(pos-l+1)\r\n else:\r\n print(min(r-pos,pos-l)+2+r-l)\r\nelif pos>r:\r\n if l==1:\r\n print(1+pos-r)\r\n else:\r\n print(2+pos-l)\r\nelif pos<l:\r\n if r==n:\r\n print(1+l-pos)\r\n else:\r\n print(2+r-pos)", "n, pos, l, r = map(int, input().split())\r\n\r\nif l == 1 and r == n:\r\n print(0)\r\nelif l == 1:\r\n print(1+abs(r-pos))\r\nelif r == n:\r\n print(1+abs(pos-l))\r\nelse:\r\n print(min(abs(pos-l)+1+(r-l)+1, abs(pos-r)+1+(r-l)+1))\r\n", "n,pos,l,r=map(int,input().split())\r\ns=0\r\nif abs(pos-l)<=abs(pos-r):\r\n if l>=2:\r\n s+=(1+abs(pos-l))\r\n if r<n:\r\n s+=((r-l)+1)\r\n elif r<n:\r\n s+=(abs(pos-r)+1)\r\nelse:\r\n if r<n:\r\n s+=(abs(pos-r)+1)\r\n if l>=2:\r\n s+=(abs(r-l)+1)\r\n elif l>=2:\r\n s+=(abs(pos-l)+1)\r\nprint(s)\r\n", "import sys\r\n\r\n\r\ndef sanvandong():\r\n m, n, a = map(int, input().split())\r\n u = m // a if m % a == 0 else (m // a) + 1\r\n v = n // a if n % a == 0 else (n // a) + 1\r\n print(u * v)\r\n\r\n\r\ndef coccoc():\r\n n, pos, l, r = map(int, input().split())\r\n if (l == 1 and r == n):\r\n print(0)\r\n elif l == 1:\r\n print(abs(r - pos) + 1)\r\n elif r == n:\r\n print(abs(l - pos) + 1)\r\n elif pos < l:\r\n print((l - pos) + 1 + (r - l) + 1)\r\n elif pos > r:\r\n print(pos - r + 1 + r - l + 1)\r\n else:\r\n print(2 + min(pos - l, r - pos) * 2 + max(pos - l, r - pos))\r\n\r\n\r\ndef chiavachia():\r\n for _ in range(int(input())):\r\n n = int(input())\r\n u, cnt = n, 0\r\n while u > 0:\r\n dig = u % 10\r\n u = u // 10\r\n if dig > 0 and (n % dig) == 0:\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\ndef leftandRight():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n if k < min(a):\r\n print(0)\r\n else:\r\n if k >= max(a):\r\n print(n)\r\n else:\r\n i, j = -1, n\r\n while (i < n) and (a[i + 1] <= k): i += 1\r\n while (j > 0) and (a[j - 1] <= k): j -= 1\r\n if i > j:\r\n print(n)\r\n else:\r\n print(max(0, n - (j - i - 1)))\r\n\r\n\r\nif __name__ == '__main__':\r\n coccoc()\r\n", "x = input().split()\r\n\r\nn = int(x[0])\r\npos = int(x[1])\r\nl = int(x[2])\r\nr = int(x[3])\r\n\r\nif l == 1 and r < n:\r\n\tans = abs(r - pos) + 1\r\n\t\r\nelif r == n and l > 1:\r\n\tans = abs(l - pos) + 1\r\n\t\r\nelif l > 1 and r < n:\r\n\tans = min(abs(r - pos), abs(l - pos)) + r - l + 2\r\n\t\r\nelse:\r\n\tans = 0\r\n\r\nprint(ans)", "n, pos, l, r = [int(i) for i in input().split()]\r\n\r\noffl = abs(l - pos)\r\noffr = abs(r - pos)\r\n\r\nif r - l + 1 == n:\r\n print(0)\r\nelif l == 1:\r\n print(abs(r - pos) + 1)\r\nelif r == n:\r\n print(abs(l - pos) + 1)\r\nelse:\r\n print(min(offl, offr) + 2 + (r - l))", "n,pos,l,r=[int(i) for i in input().split()]\r\na=l-1\r\nb=n-r\r\nif a>0 and b>0:\r\n x1=min(abs(l-pos),abs(r-pos))\r\n x2=abs(l-r)\r\n x=x1+x2+2\r\nif a>0 and b==0:\r\n x1=abs(l-pos)\r\n x=x1+1\r\nif a==0 and b>0:\r\n x1=abs(r-pos)\r\n x=x1+1\r\nif a==0 and b==0:\r\n x=0\r\nprint(x)\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\n\r\n\r\nans = 0\r\nn,pos,l,r = na()\r\nif l == 1 and r == n:\r\n print(0)\r\nelif l == 1:\r\n print(abs(r-pos)+1)\r\nelif r == n:\r\n print(abs(l-pos)+1)\r\nelse:\r\n print(2+min(abs(r-pos),abs(l-pos))+r-l)\r\n", "n, p, l, r = map(int, input().split())\r\nif l == 1 and r == n:\r\n print(0)\r\nelif l != 1 and r != n:\r\n print(min(abs(p - l), abs(p - r)) + 2 + r - l)\r\nelif l == 1:\r\n print(abs(p - r) + 1)\r\nelse:\r\n print(abs(p - l) + 1)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Jan 28 17:56:37 2018\n\n@author: pritish\n\"\"\"\n\n\n\ndef mindis(pos,l,r):\n return min(abs(pos-l),abs(pos-r))\n\nif __name__=='__main__':\n \n v = [int(x) for x in input().split(' ')]\n n=v[0]\n pos=v[1]\n l=v[2]\n r=v[3]\n if l!=1 and r!=n:\n print(mindis(pos,l,r)+1+abs(l-r)+1)\n elif l==1 and r!=n:\n print(abs(r-pos)+1)\n elif r==n and l!=1:\n print(abs(l-pos)+1)\n else:\n print(0)\n ", "n,p,l,r = map(int,input().split())\r\n\r\nans = 10000\r\nif l==1 and r==n:\r\n ans = 0\r\nelse:\r\n if l==1:\r\n ans = min(ans, abs(r-p)+1)\r\n if r==n:\r\n ans = min(ans, abs(l-p)+1)\r\n\r\n ans = min(ans, abs(l-p)+r-l+2)\r\n ans = min(ans, abs(r-p)+r-l+2)\r\n\r\nprint(ans)\r\n", "def main():\r\n\tn, pos, l, r=tuple(map(int,input().split()))\r\n\ttime=0\r\n\tif l!=1 and r!=n:\r\n\t\tif abs(pos-l)<abs(pos-r):\r\n\t\t\ttime+=abs(pos-l)+abs(l-r)+2\r\n\t\telse:\r\n\t\t\ttime+=abs(pos-r)+abs(l-r)+2\r\n\telif l==1 and r!=n:\r\n\t\ttime+=abs(pos-r)+1\r\n\telif r==n and l!=1:\r\n\t\ttime+=abs(pos-l)+1\r\n\telse:\r\n\t\ttime+=0\r\n\tprint(time)\r\nif __name__=='__main__':\r\n\tmain()", "n, pos, l, r = map(int,input().split())\nstep, dif = 0, lambda a, b : abs(a - b)\n\nif dif(pos, l) < dif(pos, r):\n\tif l != 1:\n\t\tstep += dif(pos, l) + 1\n\t\tpos = l\n\tif r != n:\n\t\tstep += dif(pos, r) + 1\nelse:\n\tif r != n:\n\t\tstep += dif(pos, r) + 1\n\t\tpos = r\n\tif l != 1:\n\t\tstep += dif(pos, l) + 1\nprint(step)\n", "n,pos,l,r=map(int,input().split())\r\nif l<=pos<=r:\r\n if l!=1 and r!=n:\r\n cnt=(r-l+1)+min(pos-l-1,r-pos-1)+2\r\n elif l==1 and r!=n:\r\n cnt=r-pos+1\r\n elif l!=1 and r==n:\r\n cnt=pos-l+1\r\n else:\r\n cnt=0\r\nelif pos<l:\r\n if r!=n:\r\n cnt=r-pos+2\r\n else:\r\n cnt=l-pos+1\r\nelif pos>r:\r\n if l!=1:\r\n cnt=pos-l+2\r\n else:\r\n cnt=pos-r+1\r\n\r\nprint(cnt)", "def main():\r\n n,pos,l,r = map(int,input().split())\r\n\r\n if l <= pos <= r:\r\n if r < n and l > 1:\r\n ans = min(pos-l,r-pos)+r-l+2\r\n elif l > 1:\r\n ans = pos-l+1\r\n elif r < n:\r\n ans = r-pos+1\r\n else:\r\n ans = 0\r\n elif pos < l:\r\n ans = l-pos+1\r\n if r < n:\r\n ans += r-l+1\r\n elif pos > r:\r\n ans = pos-r+1\r\n if l > 1:\r\n ans += r-l+1\r\n\r\n print(ans)\r\n\r\nmain()\r\n", "n, pos, l, r = map(int, input().split())\r\nresult = abs(pos - l) + r - l + 2\r\nif (l == 1):\r\n if (abs(pos - r) + 1 < result):\r\n result = abs(pos - r) + 1\r\nif (r == n):\r\n if (abs(pos - l) + 1 < result):\r\n result = abs(pos - l) + 1\r\nif (l == 1 and r == n):\r\n result = 0\r\nif (abs(pos - r) + r - l + 2 < result):\r\n result = abs(pos - r) + r - l + 2\r\nprint(result)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, pos, l, r = map(int, input().split())\r\nif 1 < l <= r < n:\r\n ans = min(abs(pos - l), abs(pos - r)) + abs(l - r) + 2\r\nelif l == 1 and r == n:\r\n ans = 0\r\nelif l == 1:\r\n ans = abs(pos - r) + 1\r\nelse:\r\n ans = abs(pos - l) + 1\r\nprint(ans)", "n, p, l, r = map(int, input().split())\r\nif l == 1 and r == n:\r\n print(0)\r\nelif l == 1:\r\n print(abs(r - p) + 1)\r\nelif r == n:\r\n print(abs(l - p) + 1)\r\nelse:\r\n print(min(abs(l - p), abs(r - p)) + r - l + 2)\r\n", "n, pos, l, r = [int(i) for i in input().split()]\r\nif l == 1 and r == n:\r\n print(0)\r\nelif l == 1 or r == n:\r\n print((abs(pos-l) if r == n else abs(pos-r)) + 1)\r\nelse:\r\n print(min(abs(pos-l), abs(pos-r))+abs(l-r)+2)", "n,pos,l,r=map(int,input().split())\r\nlt=0\r\nif(l==1 and r==n):\r\n print(0)\r\nelif(l==1 and not r==n):\r\n print(abs(pos-r)+1)\r\nelif(not l==1 and r==n):\r\n print(abs(pos-l)+1)\r\nelse:\r\n print(min(abs(pos-l),abs(pos-r))+abs(r-l)+2)\r\n ", "n,p,l,r=map(int,input().split())\r\nd,f=abs(p-l)+1,abs(p-r)+1\r\nprint(f*(r<n)if l==1 else d if r==n else min(d,f)+r-l+1)", "def main():\r\n n, pos, l, r = map(int, input().split())\r\n if l == 1:\r\n if r == n:\r\n return 0\r\n else:\r\n count = abs(r - pos) + 1\r\n else:\r\n if r == n:\r\n count = abs(l - pos) + 1\r\n else:\r\n count = 2 + min(abs(l - pos), abs(r - pos)) + abs(l - r)\r\n return count\r\n\r\n\r\nprint(main())", "n, p, l, r = map(int, input().split())\r\nd, f = abs(p-l)+1, abs(p-r)+1\r\nprint(f*(r<n) if l==1 else d if r==n else min(d,f) + r-l+1)", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn,p,l,r=M()\nans=0\nif r-l+1==n:\n print(0)\nelif l==1:\n print(abs(r-p)+1)\nelif r==n:\n print(abs(l-p)+1)\nelse:\n print(min(abs(p-l),abs(r-p))+r-l+2)\n", "R = lambda x: map(x, input().split())\r\n\r\nn, pos, l, r = R(int)\r\n\r\nto_l, to_r = abs(pos - l), abs(pos - r)\r\nl_to_r = r - l\r\n\r\nif l == 1:\r\n to_l = 10E10\r\n\r\nif r == n:\r\n to_r = 10E10\r\n\r\nif to_l < to_r:\r\n print(to_l + 1 + (l_to_r + 1) * (r != n))\r\nelif to_l != 10E10 or to_r != 10E10:\r\n print(to_r + 1 + (l_to_r + 1) * (l != 1))\r\nelse:\r\n print(0)", "n, pos, l, r = map(int, input().split())\r\n\r\nif pos > r:\r\n res = pos - r + 1\r\n if l > 1:\r\n res += r - l + 1\r\nelif pos < l:\r\n res = l - pos + 1\r\n if r < n:\r\n res += r - l + 1\r\nelse:\r\n if l == 1 and r == n:\r\n res = 0\r\n elif l == 1 and r < n:\r\n res = r - pos + 1\r\n elif l > 1 and r == n:\r\n res = pos - l + 1\r\n else:\r\n res = min(2*(pos-l)+(r-pos), (pos-l)+2*(r-pos)) + 2\r\nprint(res)", "n, p, l, r = map(int, input().split())\n\nx, y = abs(p - l) + 1, abs(r - p) + 1\n\nprint(y * (r < n) if l == 1 else x if r == n else min(x, y) + r - l + 1)\n\n\n\n# Made By Mostafa_Khaled", "a = input()\na = a.split(' ')\nn = int(a[0])\npos = int(a[1])\nl = int(a[2])\nr = int(a[3])\nif( l == 1 and r == n ):\n print(0)\nelse:\n if( l == 1 and r != n or l != 1 and r == n ):\n if( l == 1 ):\n print(abs(pos - r) + 1)\n else:\n print(abs(pos - l) + 1)\n\n else:\n print(r - l + min(abs(pos - l) , abs( pos - r)) + 2)\n", "# LUOGU_RID: 133438713\nn,p,l,r=map(int,input().split())\nif l==1 and r==n:\n print(0)\nelif l==1:\n print(abs(r-p)+1)\nelif r==n:\n print(abs(p-l)+1)\nelse:\n print(abs(l-r)+2+min(abs(p-l),abs(p-r)))", "n, pos, l, r = map(int, input().split())\r\nif l==1:\r\n if r==n:\r\n sec=0\r\n else:\r\n sec= abs(r-pos) + 1\r\nelse:\r\n if r==n:\r\n sec = abs(pos-l) + 1\r\n else:\r\n sec = min(abs(pos-l), abs(r-pos)) + r - l + 2\r\n\r\nprint(sec)\r\n\r\n", "n,pos,l,r=list(map(int,input().split()))\r\nif r-l+1==n:print(0)\r\nelif l==1:print(abs(r-pos)+1)\r\nelif r==n:print(abs(l-pos)+1)\r\nelse:print(min(abs(pos-l),abs(r-pos))+r-l+2)", "n,p,l,r = map(int,input().split())\r\nif l == 1 and r == n:\r\n print(0)\r\nelif l==1:\r\n print(abs(p-r)+1)\r\nelif r == n:\r\n print(abs(p - l) + 1)\r\nelse:\r\n print(min(abs(p-r),abs(p - l))+r-l+2)", "n, pos, l, r = map(int, input().split())\r\n\r\ndef dist(x, y): return abs(x - y)\r\n\r\ntasks = []\r\nif l != 1:\r\n tasks.append(l)\r\nif r != n:\r\n tasks.append(r)\r\nif len(tasks) == 2 and dist(pos, r) < dist(pos, l):\r\n tasks = [r, l]\r\n\r\nout = 0\r\nwhile tasks:\r\n t = tasks.pop(0)\r\n out += dist(pos, t) + 1\r\n pos = t\r\nprint(out)" ]

[ "# -*- coding: utf-8 -*-\n\"\"\"Untitled68.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1yvZY7V0Q83TMsZCyMfFGv331MUmhHXMr\n\"\"\"\n\nn0,n1=map(int,input().split())\nif n1==n0:\n str=\"10\"*n0\nelif n1>n0 and n1<=n0*2+2:\n if n1<=n0*2:\n str=\"110\"*(n1-n0)\n str=str+\"10\"*(2*n0-n1)\n else:\n str=\"110\"*n0\n str=str+\"1\"*(n1-2*n0)\nelif n0>n1 and n0<=n1+1:\n str=\"01\"*n1\n str=str+\"0\"\nelse:\n str=\"-1\"\nprint(str)", "from math import ceil\r\nnum0,num1=map(int,input().split())\r\nif num0<(ceil(num1/2)-1) or num0>num1+1:\r\n print(-1)\r\nelse:\r\n b=\"10\"\r\n if num1==num0:\r\n print(b*num0)\r\n elif num1==num0-1:\r\n print(\"0\"+b*num1)\r\n else:\r\n ans=list(b*num0+\"1\")\r\n num1r=num1-num0-1\r\n\r\n i=0\r\n d=0\r\n while d<(num1r):\r\n if ans[i]==\"1\":\r\n ans[i]+=\"1\"\r\n d+=1\r\n i+=1\r\n print(\"\".join(ans))\r\n", "n, m = map(int, input().split())\nn = n + m\nz = n - m\nif m < z - 1 or m > 2 * (z + 1):\n print(-1)\nelif not z:\n print('1' * m)\nelse:\n ls = [0, 1] * z\n m -= z\n if m == -1:\n ls.pop()\n else:\n if m:\n ls.insert(0, 1)\n m -= 1\n p = 0\n while m:\n ls[p] += 1\n p += 2\n m -= 1\n print(''.join(('1' * x if x else '0') for x in ls))", "def main(n, m):\r\n if m / 2 - 1 > n or n - 2 >= m:\r\n return -1\r\n ans = ''\r\n if m / 2 >= n:\r\n ans += '110' * (n) + '1' * (m - (n * 2))\r\n elif n == m or n - 1 == m:\r\n ans += '01' * (m) + '0' * (n - m)\r\n else:\r\n x = 0\r\n n1, m1 = n, m\r\n while n1 != m1 and n1 + 1 != m1 and m1 > 0 and n1 > 0:\r\n x += max((m1 - n1) // 2, 0)\r\n m1, n1 = ((m1 - (m1-n1))if (m1 - n1) % 2 == 0 else (m1 - (m1-n1))+1) , n1 - ((m1 - n1) // 2)\r\n\r\n ans += '110' * (x) + '10' * (n - x) + '1' * (m - ((x * 2) + (n - x)))\r\n return ans\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n print(main(n, m))", "n,m=map(int,input().split())\r\nif m<n-1 or m>2*n+2:\r\n print(-1)\r\nelse:\r\n if m==n-1:\r\n print((n-1)*'01'+'0')\r\n elif m==n:\r\n print(n*'01')\r\n elif m<2*n+2:\r\n print((m-n-1)*'110'+(2*n-m+1)*'10'+'1')\r\n else:\r\n print(n*'110'+'11')\r\n", "m, n = map(int, input().split())\r\nif(n >= m - 1 and n <= (m + 1) * 2):\r\n if(n == m - 1):\r\n s = \"01\" * (m - 1) + \"0\"\r\n elif(n == m):\r\n s = \"01\" * m\r\n elif(n == m + 1):\r\n s = \"10\" * m + \"1\"\r\n else:\r\n s = \"\"\r\n x = n - m - 1\r\n f = 0\r\n c1 = 0\r\n c0 = 0\r\n while(c1 != n or c0 != m):\r\n if(x != 0 and f == 0):\r\n s += \"11\"\r\n c1 += 2\r\n x -= 1\r\n f = 1\r\n continue\r\n elif(f == 0):\r\n s += \"1\"\r\n c1 += 1\r\n f = 1\r\n continue\r\n s += \"0\"\r\n c0 += 1\r\n f = 0\r\n print(s)\r\nelse:\r\n print(-1)\r\n", "# n,m = [int(x) for x in stdin.readline().split()]\r\nn,m = [int(x) for x in input().split()]\r\nif m>(2*n+2):\r\n print(-1)\r\nelif m<(n-1):\r\n print(-1)\r\nelif m==(n-1):\r\n s='01'*(n-1)+'0'\r\n print(s)\r\nelse:\r\n if m==n:\r\n s='10'*n\r\n print(s)\r\n else:\r\n x=n+1\r\n y=m-x\r\n s='110'*y\r\n if y==(n+1):\r\n print('110'*n+'11')\r\n elif y==(n):\r\n print('110'*n+'1')\r\n else:\r\n print(s+'10'*(n-y)+'1')", "a=list(map(int, input().split()))\r\nn=a[0]\r\nm=a[1]\r\nif n==m:\r\n r=[str(10)] * (n)\r\n print(''.join(r))\r\nelif n>m:\r\n if n-m>1:\r\n print(-1)\r\n else:\r\n r=[]\r\n r.append(str(0))\r\n r1=[str(10)] * m\r\n r=r+r1\r\n print(''.join(r))\r\nelse:\r\n if m>(2*n+2):\r\n print(-1)\r\n else:\r\n if m==2*n:\r\n r=[str(110)] * (n)\r\n print(''.join(r))\r\n elif m>2*n:\r\n r=[str(110)] * (n)\r\n r1=[str(1)] * (m-2*n)\r\n r=r+r1\r\n print(''.join(r))\r\n else:\r\n r=[str(110)] * (m-n)\r\n r1=[str(10)] * (2*n-m)\r\n r=r+r1\r\n print(''.join(r))", "\r\nn,m = map(int,input().split())\r\n\r\n\r\n\r\n\r\nif n>m+1:\r\n print(-1)\r\nelse:\r\n\r\n if m+1==n or m==n+1:\r\n if m==n+1:\r\n print('1'+'01'*n)\r\n else:\r\n print('01'*m+'0')\r\n elif n==m:\r\n print('10'*m)\r\n else:\r\n if m>n and 2*n+3>m:\r\n u=[]\r\n for j in range(n):\r\n \r\n u+=['0','1']\r\n if m>0 and n>0:\r\n n-=1\r\n m-=1\r\n else:\r\n break\r\n\r\n if m>0:\r\n for j in range(len(u)):\r\n if u[j]=='1':\r\n if m>0:\r\n u[j]='11'\r\n m-=1\r\n else:\r\n break\r\n \r\n\r\n if m>0:\r\n print('1'*m+''.join(u))\r\n else:\r\n print(''.join(u))\r\n\r\n \r\n \r\n else:\r\n print(-1)\r\n", "n,m=map(int,input().split())\r\nif m>=n-1 and m<= 2*(n+1):\r\n m-=n-1\r\n if(m==0):\r\n print(\"0\"+\"10\"*(n-1))\r\n elif(m<=n+1):\r\n print(\"110\"*(m-1)+\"10\"*(n-m+1))\r\n else:\r\n print(\"110\"*n + \"1\"*(m-n-1))\r\nelse:\r\n print(-1)\r\n ", "#This code is contributed by Siddharth\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n\r\n\r\n\r\n\r\n\r\n# ==========================================Code Starts Here=====================================================================\r\n\r\n\r\nn,m=map(int,input().split())\r\nif (n>m+1) or (m>(n+1)*2):\r\n print(-1)\r\nelse:\r\n if m<=n:\r\n ans=min(n,m)*'01'\r\n n-=min(n,m)\r\n m-=min(n,m)\r\n ans+=n*'0'\r\n else:\r\n temp=[]\r\n while n>0 and m>0:\r\n temp.append('1')\r\n temp.append('0')\r\n n-=1\r\n m-=1\r\n if m:\r\n temp.append('1')\r\n m-=1\r\n for i in range(len(temp)):\r\n if m==0:\r\n break\r\n if temp[i]=='1':\r\n temp[i]='11'\r\n m-=1\r\n ans=''.join(temp)\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", "def main():\n\tn, m = [int(x) for x in input().split()]\n\n\tif m < n - 1:\n\t\tprint(-1)\n\t\treturn None\n\n\tm -= n - 1\n\tstart = min(m, 2)\n\tm -= start\n\n\tend = min(m, 2)\n\tm -= end\n\n\tif m > n - 1:\n\t\tprint(-1)\n\t\treturn None\n\n\tans = []\n\tfor i in range(start):\n\t\tans.append('1')\n\n\tfor i in range(n):\n\t\tans.append('0')\n\t\tif i < n - 1:\n\t\t\tans.append('1')\n\t\tif m > 0:\n\t\t\tans.append('1')\n\t\t\tm -= 1\n\n\tfor i in range(end):\n\t\tans.append('1')\n\n\tprint(''.join(ans))\n\nif __name__ == '__main__':\n\tmain()", "def make(n,m):\r\n string=\"\"\r\n\r\n for i in range(m-n+1):\r\n string+=\"011\"\r\n for i in range(2*n-m-2):\r\n string+=\"01\"\r\n string+=\"0\"\r\n return string\r\n \r\n \r\n\r\nn,m=map(int,input().split())\r\nif m>2*n+2:\r\n print(-1)\r\nelif m<n-1:\r\n print(-1)\r\nelse:\r\n if m<=2*n-2:\r\n print(make(n,m))\r\n elif m==2*n-1:\r\n print(make(n,2*(n-1))+\"1\")\r\n elif m==2*n:\r\n print(make(n,2*(n-1))+\"11\")\r\n elif m==2*n+1:\r\n print(\"1\"+make(n,2*(n-1))+\"11\")\r\n else:\r\n print(\"11\"+make(n,2*(n-1))+\"11\")\r\n", "import sys,os.path\r\nif __name__ == '__main__':\r\n if(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n n,m = map(int,input().split())\r\n ans = \"\"\r\n if m>=n:\r\n if m>2*n+2:\r\n print(-1)\r\n else:\r\n while m-n>1:\r\n ans+=\"1\"\r\n ans+=\"1\"\r\n if n!=0:\r\n ans+=\"0\"\r\n n-=1\r\n m-=2\r\n while n>0:\r\n ans+=\"1\"\r\n ans+=\"0\"\r\n m-=1\r\n n-=1\r\n if m!=0:\r\n ans+=\"1\"\r\n print(ans)\r\n else:\r\n if n>m+1:\r\n print(-1)\r\n else:\r\n while m!=0:\r\n ans+=\"0\"\r\n ans+=\"1\"\r\n m-=1\r\n ans+=\"0\"\r\n print(ans)", "n, m = [int(x) for x in input().split()]\n\ndef find_seq(n,m):\n\n\tif m>(n+1)*2 or n>m+1:\n\t\tprint(-1)\n\t\treturn\n\n\tseq = \"\"\n\twhile m>0 and n>0:\n\t\t\n\t\tif m==n:\n\t\t\tif len(seq)>0:\n\t\t\t\tif seq[-1]==\"1\":\n\t\t\t\t\tseq+=(\"01\"*m)\n\t\t\t\telse:\n\t\t\t\t\tseq+=(\"10\"*m)\n\t\t\telse:\n\t\t\t\tseq = (\"01\"*m)\n\n\t\t\tprint(seq)\n\t\t\treturn\n\n\t\tif m>n:\n\t\t\tif len(seq)>1 and seq[-2:]==\"11\":\n\t\t\t\tseq+=\"0\"\n\t\t\t\tn-=1\n\t\t\telse:\n\t\t\t\tseq+=\"1\"\n\t\t\t\tm-=1\n\t\t\n\t\telse:\n\t\t\tif len(seq)>0 and seq[-1]==\"0\":\n\t\t\t\tseq+=\"1\"\n\t\t\t\tm-=1\n\t\t\telse:\n\t\t\t\tseq+=\"0\"\n\t\t\t\tn-=1\n\n\t\t#print(seq)\n\n\twhile m>0:\n\t\tif seq[-2:]!=\"11\":\n\t\t\tseq+=\"1\"\n\t\t\tm-=1\n\t\telif seq[:2]!=\"11\":\n\t\t\tseq = \"1\"+seq\n\t\t\tm-=1\n\n\t\t#print(seq)\n\n\twhile n>0:\n\t\tif seq[-1]!=\"0\":\n\t\t\tseq+=\"0\"\n\t\t\tn-=1\n\t\telif seq[0]!=\"0\":\n\t\t\tseq = \"0\"+seq\n\t\t\tn-=1\n\n\t\t#print(seq)\n\n\tprint(seq)\n\treturn\n\nfind_seq(n,m)", "n, m = map(int, input().split())\r\n \r\nif n > m + 1 or m > 2 * n + 2:\r\n print(-1)\r\n \r\nelif n == m + 1:\r\n print('01' * m + '0')\r\n \r\nelif n == m:\r\n print('01' * m)\r\n \r\nelif m == 2 * n + 2:\r\n print('110' * n + '11')\r\n \r\nelse:\r\n a = m - n - 1\r\n b = n - a\r\n print('1' + '101' * a + '01' * b)", "c0,c1 = map(int,input().split())\r\nif c1 > (c0+1)*2 or c0 > c1+1 :\r\n print(-1)\r\nelse :\r\n kar = False\r\n if c0 > c1:\r\n print(0,sep=\"\",end=\"\")\r\n for i in range(c1):\r\n print(1,0,sep=\"\",end=\"\")\r\n else :\r\n while(True):\r\n if c1 == 0 and c0 == 0:\r\n break\r\n if(c1 > c0 and c0+1 != c1):\r\n print(11,end=\"\")\r\n c1 -= 2\r\n else:\r\n print(1,end=\"\")\r\n c1 -= 1\r\n if c0 > 0:\r\n print(0,end=\"\")\r\n c0 -= 1", "from sys import stdin ,stdout\r\n\r\nn, m=map(int, stdin.readline().split())\r\nif n-1 <= m <= 2*(n+1):\r\n\tm-=n-1\r\n\tif m==0:\r\n\t\tstring=\"0\"+\"10\"*(n-1)\r\n\telif m-1<=n:\r\n\t\tstring=\"110\"*(m-1)+\"10\"*(n-m+1)\r\n\telse:\r\n\t\tstring=\"110\"*n+\"1\"*(m-1-n)\r\n\tstdout.write(string+\"\\n\")\r\nelse:\r\n\tstdout.write(str(-1)+\"\\n\")", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nif n>m+1:\r\n print(-1)\r\nelif m > 2*n+2:\r\n print(-1)\r\nelse:\r\n ans = []\r\n while(n != 0 and m!=0):\r\n if n>m:\r\n ans.append('0')\r\n n-=1\r\n elif n >= m-1:\r\n ans.append('1')\r\n m-=1\r\n else:\r\n ans.append('1') \r\n ans.append('1')\r\n ans.append('0')\r\n m-=2\r\n n-=1\r\n \r\n if n != 0:\r\n for i in range(n):\r\n ans.append('0')\r\n if m != 0:\r\n for i in range(m):\r\n ans.append('1')\r\n \r\n print(''.join(ans))", "n, m = map(int, input().split())\r\nif m > 2*n + 2 or m < n - 1:\r\n print('-1')\r\nelse:\r\n s = ['' for i in range(3*n - 2)]\r\n for i in range(3*n - 2):\r\n if i % 3 == 1:\r\n s[i] = '1'\r\n elif i % 3 == 0:\r\n s[i] = '0'\r\n m -= (n - 1)\r\n for i in range(min(m, n - 1)):\r\n s[3*i + 2] = '1'\r\n\r\n m -= min(m, n - 1)\r\n if m <= 2:\r\n ans = '1' * m + ''.join(s)\r\n else:\r\n ans = '1' * 2 + ''.join(s) + '1' * (m - 2)\r\n\r\n print(ans)", "n,m=map(int, input().split())\r\nif n-m ==1: print('0'+'10'*m)\r\nelif n-m>1: print(-1)\r\nelse:\r\n if 2*n-m>=0: print('110'*(m-n)+'10'*(2*n-m))\r\n elif -2 <=2*n-m<=-1: print('110'*n + '1' * (m - 2 * n))\r\n else: print(-1)", "n, m = map(int, input().split())\r\nif 2 * (n+ 1) < m or n - m > 1:\r\n print(-1)\r\nelse:\r\n while m - n > 1 and m >0 and n > 0:\r\n print(\"110\", end = \"\")\r\n m -= 2\r\n n -= 1\r\n while (m - n == 1 or n == m) and m > 0 and n > 0:\r\n print(\"10\", end = \"\")\r\n m -= 1\r\n n -= 1\r\n while n - m == 1 and m > 0 and n > 0:\r\n print(\"01\", end= \"\")\r\n m -= 1\r\n n -= 1\r\n while m > 0 :\r\n print(\"1\", end = \"\")\r\n m -= 1\r\n while n > 0 :\r\n print(\"0\", end = \"\")\r\n n -= 1\r\n \r\n\r\n \r\n \r\n \r\n", "# https://codeforces.com/problemset/problem/401/C\r\n\r\nno_of_zeros, no_of_ones = map( int, input().split() )\r\n\r\nif no_of_ones > (2*no_of_zeros)+2 or no_of_zeros > no_of_ones+1:\r\n print(-1)\r\nelse:\r\n if no_of_zeros <= no_of_ones <= 2*no_of_zeros:\r\n print('110' * (no_of_ones - no_of_zeros) + '10' * (2 * no_of_zeros - no_of_ones))\r\n elif no_of_ones > 2 * no_of_zeros:\r\n print('110' * no_of_zeros + '1' * (no_of_ones - 2 * no_of_zeros))\r\n else:\r\n print('01' * no_of_ones + '0')\r\n", "n,m = map(int,input().split())\r\n\r\nif m>n-1 and m<=2*(n+1):\r\n additOnes = m-n\r\n ones = m\r\n zeros = n\r\n while ones > 0 or zeros > 0:\r\n if additOnes > 0 and ones > 0:\r\n print(\"1\", end = \"\")\r\n ones-=1\r\n additOnes-=1\r\n if ones > 0:\r\n print(\"1\", end = \"\")\r\n ones-=1\r\n if zeros > 0:\r\n print(\"0\", end = \"\")\r\n zeros-=1\r\nelif m==n-1:\r\n print(\"0\", end = \"\")\r\n for i in range(m):\r\n print(\"1\", end = \"\")\r\n print(\"0\", end = \"\")\r\nelse:\r\n print(\"-1\")\r\n", "n,m=map(int,input().split())\nif (m<n-1 or m>2*(n+1)):\n print(-1)\nelif m==n-1:\n ans=''\n for i in range(m):\n ans+='01'\n ans+='0'\n print(ans)\nelse:\n k=m//(n+1)\n a=''\n b=''\n ans=''\n for i in range(k):\n a=a+'1'\n b=b+'1'\n b=b+'1'\n b=b+'0'\n a=a+'0'\n m=m%(n+1)\n i=0\n while(i<m):\n ans+=b\n i+=1\n while(i<n):\n ans+=a\n i+=1\n for i in range(k):\n ans+='1'\n print(ans)\n", "n,m=map(int, input().split(\" \"))\r\nif (n>(m+1) or m>2*(n+1)):\r\n print(-1)\r\nelif(m<=n+1):\r\n if(n>=m):\r\n print('01'*((n+m)//2) + '0'*((n+m)%2))\r\n else:\r\n print('10'*((n+m)//2) + '1'*((n+m)%2))\r\nelif(m==2*(n+1)):\r\n x=m-n-1\r\n print('110'*(x-1)+'11') \r\nelse:\r\n x=m-n-1\r\n print('110'*x+ '10'*((m+n-3*x)//2) + '1'*((m+n-3*x)%2)) ", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\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\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, 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\nMOD = 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\n \r\nn,m = ilele()\r\nA = ['']\r\nfor i in range(m):\r\n A.append('1')\r\n A.append('')\r\ni = 4;zero = n\r\nwhile i < len(A)-1 and zero:\r\n A[i] = '0'\r\n zero -= 1\r\n i += 4\r\ni = 2\r\nwhile i < len(A)-1 and zero:\r\n A[i] = '0'\r\n zero -= 1\r\n i+=4\r\nif zero: A[0] = '0';zero -= 1\r\nif zero: A[-1] = '0';zero -= 1\r\nif zero: print(-1);exit(0)\r\nans = \"\".join(A)\r\nif '00' in ans or '111' in ans:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n\r\n \r\n ", "for t in range(1):\r\n # IF 0x0x0x0x0x0x0x\r\n # fill ones at place of x...\r\n # fill greedily fill 1 ones at place of X...\r\n # if number of ones less than N(0) - 1... print(-1)\r\n # if number of ones are more than ... 2*(N(0)+2)... print(-1)\r\n\r\n N, M = map(int, input().split())\r\n\r\n if M < (N - 1) or M > 2*(N + 1):\r\n print(-1)\r\n else:\r\n A = []\r\n\r\n for i in range(2*N - 1):\r\n\r\n if i % 2 == 0:\r\n A.append(\"0\")\r\n else:\r\n A.append(\"1\")\r\n\r\n M -= (N - 1)\r\n\r\n if M > 0:\r\n M -= 1\r\n A.insert(0, \"1\")\r\n\r\n if M > 0:\r\n M -= 1\r\n A.append(\"1\")\r\n\r\n i = 0\r\n\r\n while M > 0:\r\n\r\n A[i] += \"1\"\r\n\r\n i += 2\r\n M -= 1\r\n\r\n print(\"\".join(A))", "'''I = lambda: [int(i) for i in input().split()]\r\nimport io, os, sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline'''\r\nfrom itertools import accumulate\r\nimport bisect\r\n#n = int(input())\r\n#l1 = list(map(int,input().split()))\r\nm,n = map(int,input().split())\r\nif m<=n+1 and m>=((n+1)//2-1):\r\n ans=''\r\n if(m==n+1):\r\n print(\"01\"*(m-1)+\"0\")\r\n\r\n else:\r\n while(m):\r\n if(n>=2*m):\r\n print(\"110\",end=\"\")\r\n n-=2\r\n m-=1\r\n else:\r\n print(\"10\",end=\"\")\r\n n-=1\r\n m-=1\r\n print(\"1\"*n)\r\n\r\nelse:\r\n print(-1)\r\n \r\n \r\n \r\n", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().strip().split())\r\npossible = True\r\npair = min(n, m)\r\nif n-m >= 2:\r\n possible = False\r\nelif (pair*2)+2 < m:\r\n possible = False\r\nelse:\r\n output_str = '0' if n-m == 1 else ''\r\n cnt = 0\r\n req1, req2 = '110', '10'\r\n c_2 = m-pair if m-pair <= pair else pair\r\n c_1 = pair-c_2\r\n output_str += req1*c_2\r\n output_str += req2*c_1\r\n output_str += '1'*(m-((c_2*2)+c_1))\r\nif possible:\r\n stdout.write(output_str)\r\nelse:\r\n stdout.write('-1')", "from collections import Counter,defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn,m=M()\r\nif n > m + 1 or m > 2 * n + 2:\r\n print(-1)\r\nelif n >= m:\r\n print('01' * m + '0' * (n > m))\r\nelse:\r\n print(('10' * n + '1').replace('1', '11', m - n - 1))", "from io import StringIO\r\n\r\nz, o = [int(i) for i in input().split()]\r\n\r\n\r\n\r\ndef printfirst():\r\n return \"10\"\r\n\r\ndef printsecond():\r\n return \"110\"\r\n\r\ndef solve(z, o):\r\n ans = StringIO()\r\n if z > o: \r\n ans.write(\"0\")\r\n z-=1\r\n while z and o:\r\n if o > z: \r\n ans.write(printsecond())\r\n o -=2\r\n else: \r\n ans.write(printfirst())\r\n o -= 1\r\n z -=1\r\n for i in range(o):\r\n ans.write(\"1\")\r\n print(ans.getvalue())\r\n\r\n\r\n\r\n \r\nif __name__ == \"__main__\":\r\n if z > o + 1 or o > 2*z + 2:\r\n print(-1)\r\n else: \r\n solve(z, o)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nx, y = map(int, input().split())\r\nif x>y and y+1<x:\r\n\tprint(-1)\r\n\texit()\r\nif y >x and 2*x +2 <y:\r\n\tprint(-1)\r\n\texit()\r\nif x>y:\r\n\tprint('01'*y + '0')\r\nelse:\r\n\tstr1 = ''\r\n\twhile y >x and x:\r\n\t\tstr1 += '110'\r\n\t\ty-= 2\r\n\t\tx-=1\r\n\tif x==y:\r\n\t\tstr1 += '10'*y\r\n\t\ty-=y\r\n\t\tx-=x\r\n\tif y:\r\n\t\tstr1 += '1'*y\r\n\tprint(str1)\r\n\r\n", "import sys, math, itertools, random, bisect\r\nfrom collections import defaultdict\r\n# sys.setrecursionlimit(999999999)\r\nINF = 10**18\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 = 10**9 + 7\r\n\r\n# MAX = 100001\r\n\r\n# def sieve():\r\n# \tisPrime = [True]*(MAX)\r\n# \tisPrime[0] = False\r\n# \tisPrime[1] = False\r\n\r\n# \tfor i in range(2,MAX):\r\n# \t\tif isPrime[i]:\r\n# \t\t\tfor j in range(i*i, MAX, i):\r\n# \t\t\t\tisPrime[j] = False\r\n \r\n# \tprimes = [2]\r\n# \tfor i in range(3,MAX,2):\r\n# \t\tif isPrime[i]: primes.append(i)\r\n# \treturn primes\r\n \r\ntest = 1\r\n# test = int(input())\r\nfor _ in range(test):\r\n zero,one = get_ints()\r\n # a = get_array()\r\n if zero<(one+zero)//3 or zero>math.ceil((one+zero)/2): print(-1)\r\n else:\r\n ans = \"\"\r\n if zero==one+1:\r\n for i in range(one+zero):\r\n if i&1: ans += \"1\"\r\n else: ans += \"0\"\r\n else:\r\n while one and zero and one-zero>1:\r\n ans += \"110\"\r\n zero-=1\r\n one-=2\r\n while one or zero:\r\n if one: \r\n ans += \"1\"\r\n one -= 1\r\n if zero: \r\n ans += \"0\"\r\n zero -= 1\r\n print(ans)\r\n\r\n", "from itertools import accumulate\r\nimport sys\r\ninput = sys.stdin.readline\r\nn0, n1 = map(int, input().split())\r\nans = -1\r\nif n0 - 1 <= n1 <= 2 * n0 + 2:\r\n if n1 == n0 - 1:\r\n ans = '0' + '10' * n1\r\n elif n1 == 2 * n0 + 1:\r\n ans = '110' * n0 + '1'\r\n elif n1 == 2 * n0 + 2:\r\n ans = '110' * n0 + '11'\r\n else:\r\n ans = '110' * (n1 - n0) + '10' * (n0 - (n1 - n0))\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nif n < m/2 - 1 or n > m+1:\r\n print(-1)\r\nelse:\r\n d = ''\r\n while n != 0:\r\n if m > n:\r\n x = min(n, m-n)\r\n d += '110' *x\r\n m -= 2*x\r\n n -= x\r\n elif n > m:\r\n d += '0'\r\n n -= 1\r\n elif m == n:\r\n d += '10' * n\r\n m -= n\r\n n -= n\r\n break\r\n if m > 0:\r\n d += '1'*m\r\n print(d)", "num1, num2 = map(int, input().split())\r\n\r\nif not (num2 <= 2 * (num1 + 1) and num2 >= (num1 - 1)):\r\n print(-1)\r\n quit()\r\nelse:\r\n ans = max(min(num2 - num1, num1),0)\r\n print(\"1\" * (num2 - num1 * 2) + \"011\" * ans + (min(num1, num2) - ans) * \"01\" + \"0\" * (num1 > num2))", "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())\r\nif 2*(n+1) < m:\r\n print(-1)\r\nelif (n-1)> m:\r\n print(-1)\r\nelse:\r\n t1=m//2\r\n t2=n\r\n pp=min(t1,t2)\r\n k=\"110\"*pp\r\n if pp*2 < m:\r\n k+=\"1\"*(m-2*pp)\r\n if pp < n:\r\n k=k.replace(\"110\",\"1010\",n-pp)\r\n h=k.count(\"0\")\r\n if n-h == 1:\r\n if k[0] == \"0\":\r\n print(k+\"0\")\r\n else:\r\n print(\"0\"+k)\r\n elif n-h == 2:\r\n print(\"0\"+k+\"0\")\r\n else:\r\n print(k)\r\n else:\r\n print(k)\r\n", "zeroes,ones = map(int,input().split())\r\nif zeroes>1+ones or ones>(zeroes+1)*2:\r\n print(-1)\r\nelse:\r\n if zeroes==1+ones:\r\n print('0'+'10'*ones)\r\n else:\r\n ans = '1x0'*zeroes+'xx'\r\n ans = ans.replace('x','1',ones-zeroes)\r\n ans = ans.replace('x','')\r\n print(ans)\r\n \r\n", "n,m=map(int,input().split())\nif n>m+1:\n print(-1)\nelif m>2*n+2:\n print(-1)\nelif n==m+1:\n print(\"01\"*m,0,sep=\"\")\nelse:\n string=[]\n while m>0 and n>0:\n if m>n:\n string.extend([1,1,0])\n m-=2\n n-=1\n else:\n string.extend([1,0])\n m-=1\n n-=1\n string.extend([1]*m)\n print(*string,sep=\"\")", "I=lambda : list(map(int,input().split()))\n\nn,m=I()\nif m<n-1 or n<(m+1)//2-1:\n print(-1)\nelse:\n if m<n:\n print('01'*m+'0')\n else:\n if n==m:\n print('10'*n)\n else:\n d=min(m-n,n)\n print('110'*d+'10'*(n-d)+'1'*(m-d-n))\n\t\t \t \t\t\t \t\t \t\t \t\t \t\t \t\t\t\t\t\t", "\r\ndef answer(n, m): #n zeros, m ones.\r\n if m < n - 1: #not enough ones to space the zeros.\r\n return -1\r\n if m > 2*n + 2: #too many ones\r\n return -1\r\n # solution exists.\r\n if m == n-1:\r\n return '01' * m + '0'\r\n if m == n:\r\n return '01' * m \r\n if m == n+1:\r\n return '1' + ('01' * n)\r\n xm = m - (n+1)\r\n if xm <= n:\r\n return '110' * xm + '10' * (n-xm) + '1'\r\n else:\r\n return '110' * n + '11'\r\n return #null\r\n\r\ndef main():\r\n n, m = [int(i) for i in input().split()]\r\n print(answer(n, m))\r\n\r\n\r\n return\r\nmain()", "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 z,o=lst()\r\n z1,o1=z,o\r\n if o<(z-1) or o>(2*(z-1)+4):print(-1)\r\n else:\r\n ln=2*(z-1)+4+z\r\n ans=[-1]*ln\r\n p=2\r\n while p<ln and z1:\r\n ans[p]=0\r\n p+=3\r\n z1-=1\r\n p=3;ones=z-1\r\n while p<ln and ones:\r\n ans[p]=1\r\n p+=3\r\n ones-=1\r\n o1-=(z-1)\r\n if o1:\r\n ans[0]=1\r\n o1-=1\r\n if o1:\r\n ans[1]=1\r\n o1-=1\r\n if o1:\r\n ans[-1]=1\r\n o1-=1\r\n if o1:\r\n ans[-2]=1\r\n o1-=1\r\n p=4\r\n while p<ln and o1:\r\n ans[p]=1\r\n p+=3\r\n o1-=1\r\n for v in ans:\r\n if v!=-1:stdout.write(str(v))", "n,m=map(int,input().split())\r\nif m-n<-1:print(-1)\r\nelse:\r\n if m>2*n+2:print(-1)\r\n else:\r\n b=n-1;p=max(0,m-n+1)\r\n l=min(n-1,p);b-=l\r\n k=max(0,p-l)\r\n h=min(2,k);k-=h;g=min(2,k)\r\n \r\n print('1'*h+'0'+'10'*b+'110'*l+'1'*g)", "n,m = map(int,input().split())\r\nn+=1\r\nprint(-1 if m<n-2 or 2*n<m else '0'.join('1'*(m//n+(i%n<m%n)) for i in range(-1,n-1)))", "n, m = map(int, input().split())\r\n\r\nif n - 1 <= m <= 2 * (n + 1):\r\n m -= n - 1\r\n if m == 0:\r\n s = '0' + '10' * (n - 1)\r\n elif m - 1 <= n:\r\n s = '110' * (m - 1) + '10' * (n - m + 1)\r\n else:\r\n s = '110' * n + '1' * (m - 1 - n)\r\n print(s)\r\nelse:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = int(1e9) + 7\r\n\r\nn, m = map(int, input().split())\r\nn += 1\r\n\r\nif m < n - 2 or 2 * n < m:\r\n print(-1)\r\nelse:\r\n print('0'.join('1'*(m//n + (i%n < m%n)) for i in range(-1, n-1)))", "import sys, collections, math, itertools, random, bisect\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,m = get_ints()\r\nzeros = n\r\nones = m\r\nans = ''\r\nflag = True if ones > zeros else False\r\nwhile zeros or ones:\r\n if flag:\r\n if ones > zeros and ones > 1:\r\n ans += '11'\r\n ones -= 2\r\n else:\r\n ans += '1'\r\n ones -= 1\r\n if zeros:\r\n ans += '0'\r\n zeros -= 1\r\n else:\r\n ans += '0'\r\n zeros -= 1\r\n if ones:\r\n ans += '1'\r\n ones -= 1\r\nif '111' in ans or '00' in ans:\r\n print('-1')\r\nelse:\r\n print(ans)", "n,m=map(int,input().split())\r\nif m>=2*n+3 or n>m+1:\r\n print(-1)\r\nelif n==m:\r\n print('10'*n)\r\nelif n==m+1:\r\n print('0'+'10'*m)\r\nelif m==2*n:\r\n print('110'*n)\r\n\r\nelse:\r\n ans=''\r\n \r\n while True:\r\n if n==0 or n==m:\r\n break\r\n ans+='110'\r\n n-=1\r\n m-=2\r\n \r\n \r\n if n==m:\r\n ans+='10'*n\r\n elif n==0 and m!=0:\r\n ans+=m*'1'\r\n else:\r\n ans=-1\r\n print(ans)\r\n", "m = list(map(int,(input()).split()))\r\nn = m[0]\r\nm = m[1]\r\nans = ''\r\nif (m+1)>=n and m<=((n+1)*2):\r\n if m==n:\r\n for i in range(m):\r\n ans = ans+'10'\r\n elif m==n-1:\r\n ans = '0'\r\n for i in range(m):\r\n ans = ans+'10'\r\n elif m==((n+1)*2):\r\n for i in range(n):\r\n ans = ans+'110'\r\n ans = ans+'11'\r\n else:\r\n pairs = m-n-1\r\n singles = n-pairs\r\n for i in range(pairs):\r\n ans = ans+'110'\r\n for j in range(singles):\r\n ans = ans+'10'\r\n ans = ans+'1'\r\nelse:\r\n ans = '-1'\r\nprint(ans)", "n, m = (int(x) for x in input().split())\nif m < n - 1 or m > 2 * (n + 1):\n print(-1)\nelse:\n if m == n - 1:\n print('01' * (n - 1) + '0')\n elif m == n:\n print('01' * n)\n else:\n ls = ['11'] * (m - n - 1) + ['1'] * (2 * (n + 1) - m)\n print('0'.join(ls))", "n,m=map(int,input().split(\" \"))\r\nif m>n and m>2*n+2:\r\n print(-1)\r\nelif n>m and n>m+1:\r\n print(-1)\r\nelif m==n:\r\n print(\"01\"*m)\r\nelif m>n:\r\n while(m!=n and m-2>=0 and n-1>=0):\r\n print(\"110\",end=\"\")\r\n m=m-2\r\n n=n-1\r\n if n==m:\r\n print(\"10\"*m)\r\n elif n==0:\r\n print(\"1\"*m)\r\n elif m==0:\r\n print(\"0\")\r\nelif n>m:\r\n while(n!=m and m-1>=0 and n-1>=0 ):\r\n print(\"01\",end=\"\")\r\n m=m-1\r\n n=n-1\r\n if n==m:\r\n print(\"01\"*n)\r\n elif n==0:\r\n print(\"1\"*m)\r\n elif m==0:\r\n print(\"0\"*n)\r\n ", "z,o = list(map(int,input().split()))\r\nif z<=o+1 and (z*2+2)>=o:\r\n\tif o+1 == z:\r\n\t\tprint('01'*o + '0')\r\n\telif o==z:\r\n\t\tprint('10'*z)\r\n\telif z*2+2==o:\r\n\t\tprint('110'*z+'11')\r\n\telif z*2+1==o:\r\n\t\tprint('110'*z + '1')\r\n\telse:\r\n\t\tprint('110'*(o-z) + '10'*(2*z-o))\r\nelse:\r\n\tprint(-1)", "n, m = map(int, input().split())\r\n\r\nif m > (n+1)*2:\r\n print(-1)\r\nelif n > m+1:\r\n print(-1)\r\nelse:\r\n ans = ''\r\n while n > 0 and m > 0:\r\n if m-n >= 3:\r\n ans += '110'\r\n m -= 2\r\n n -= 1\r\n\r\n elif m-n <= 2 and m-n >= 0:\r\n ans += '10'\r\n m -= 1\r\n n -= 1\r\n if n > m:\r\n ans += '01'\r\n m -= 1\r\n n -= 1\r\n\r\n if n > 0:\r\n while n:\r\n ans += '0'\r\n n -= 1\r\n\r\n if m > 0:\r\n while m:\r\n ans += '1'\r\n m -= 1\r\n\r\n print(ans)\r\n", "from sys import stdin,stdout\r\nfrom math import gcd\r\ninput = stdin.readline\r\n \r\ndef main():\r\n #t = int(input())\r\n t=1\r\n for i 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 > m:\r\n if n > m+1:\r\n print(-1)\r\n continue\r\n print(\"01\"*m+\"0\"*(n-m))\r\n continue\r\n else:\r\n if m -2 > n * 2:\r\n print(-1)\r\n continue\r\n while n != m and n != 0:\r\n print(\"110\",end=\"\")\r\n m -= 2\r\n n -= 1\r\n print(\"10\"*n+\"1\"*(m-n))\r\n \r\nmain()\r\n", "n,m = list(map(int,input().split()))\nif m>(n+1)*2 or m<n-1:\n print(-1)\nelse:\n a = '10'*n\n p = m-n\n s = ''\n i = 0\n if p<0:\n print(a[1:])\n elif p==0:\n print(a)\n else:\n v = min(n,p)\n s = '110'*v\n vl = p-v\n vn = n-v\n if vl>0:\n s+='1'*vl\n if vn>0:\n s+='10'*vn\n print(s)\n\n\n\n", "zero,one = map(int,input().split())\r\ns=''\r\nif zero>=one:\r\n if zero - one>1:\r\n s=-1\r\n else:\r\n s = '01'*one\r\n if zero>one: s+='0'\r\nelse:\r\n if one/2>(zero+1):\r\n s=-1\r\n else:\r\n extra_one = one-(zero+1)\r\n if extra_one==zero+1:\r\n s='110'*(zero)\r\n s+='11'\r\n else:\r\n s='110'*extra_one\r\n s+='10'*(zero-extra_one)\r\n s+='1'\r\nprint(s)", "n, m = map(int, input().split())\r\n\r\nif n > m + 1 or m > 2 * (n + 1) : print(-1)\r\nelif n == m + 1 :\r\n for i in range(m) :\r\n print(\"01\", end = \"\")\r\n print(\"0\")\r\nelif n == m :\r\n for i in range(m) :\r\n print(\"01\", end = \"\")\r\nelif m == 2 * (n + 1) or m == 2 * n + 1:\r\n for i in range(n) :\r\n print(\"110\", end = \"\")\r\n if m == 2 * (n + 1) : print(\"11\")\r\n else : print(\"1\")\r\nelse :\r\n for i in range(m - n) :\r\n print(\"110\", end = \"\")\r\n for i in range(2 * n - m) :\r\n print(\"10\", end = \"\")", "n,m=map(int,input().split())\r\ns=\"\"\r\nif((n+1)*2<m or m<n-1):\r\n print(-1)\r\nelif(n>=m):\r\n print(\"01\"*m+\"0\"*(n>m))\r\nelse:\r\n print(((\"10\"*n)+\"1\").replace(\"1\",\"11\",m-n-1))", "n,m=list(map(int,input().split(\" \")))\r\n\r\nanswer='-1'\r\nif m>n:\r\n for k in range(1,n+1):\r\n if n-k in [m-2*k,m-2*k-1,m-2*k-2]:\r\n answer='110'*k+'10'*(n-k)+'1'*(m-k-n)\r\nelif m==n:\r\n answer='10'*n\r\nelif m==n-1:\r\n answer='01'*(n-1)+'0'\r\n\r\nprint(answer)\r\n", "a,b=map(int,input().split())\r\nif a==b:\r\n print(\"10\"*a)\r\nelif b>2*a+2:\r\n print(-1)\r\nelif a>b+1:\r\n print(-1)\r\nelif a-b==1:\r\n print(\"0\"+\"10\"*b)\r\nelse:\r\n s=\"\"\r\n while(1):\r\n if b == a:\r\n if s[-1]=='0':\r\n s+=\"10\"*a\r\n break\r\n else:\r\n s+=\"01\"*a\r\n break\r\n if b-a>=1 and b>1:\r\n s+=\"11\"\r\n b-=2\r\n if a>=1:\r\n s+=\"0\"\r\n a-=1\r\n # if a==1 and b==1:\r\n\r\n if a==1 and b==0:\r\n s=\"0\"+s\r\n break\r\n if a==0 and b==1:\r\n if s[-1]=='0':\r\n s+='1'\r\n b-=1\r\n break\r\n if a==0 and b==0:\r\n break\r\n # print(a, b)\r\n print(s)\r\n", "zero,one=map(int,input().split())\r\nif one>2*(zero+1) or zero>one+1:\r\n print(-1)\r\nelse:\r\n if zero==one+1:\r\n print(\"01\"*(one)+\"0\")\r\n elif zero==one:\r\n print(\"10\" * zero)\r\n elif one==zero+1:\r\n print(\"10\"*(zero)+\"1\")\r\n elif one==2*(zero+1):\r\n print(\"110\"*zero+\"11\")\r\n else:\r\n print((\"110\")*(one-zero-1)+(\"10\")*(2*zero-one+1)+\"1\")", "z,o=map(int,input().split())\r\n\r\nif z>o+1 or o>(z+1)*2:\r\n print(\"-1\")\r\nelse:\r\n if z>o:\r\n for i in range(z-1):\r\n print(\"01\",end=\"\")\r\n print(\"0\")\r\n elif z==o:\r\n for i in range(z):\r\n print(\"10\",end=\"\")\r\n else:\r\n r=o-z-1\r\n for i in range(z):\r\n if r>0:\r\n print(\"110\",end=\"\")\r\n r-=1\r\n else:\r\n print(\"10\",end=\"\")\r\n print(\"11\" if r>0 else \"1\",end=\"\")", "def team(n,m):\r\n if m<n-1 or m>2*(n-1)+4:\r\n return -1\r\n \r\n else:\r\n ans=\"\"\r\n o=m\r\n \r\n z=n\r\n if z>o:\r\n start=\"zero\"\r\n else:\r\n start=\"one\"\r\n while (o>0 or z>0):\r\n if start==\"zero\":\r\n ans+=\"0\"\r\n z-=1\r\n start=\"one\"\r\n\r\n else:\r\n if o>2*z+1:\r\n ans+=\"11\"\r\n o-=2\r\n start=\"zero\"\r\n else:\r\n ans+=\"1\"\r\n o-=1\r\n start=\"zero\"\r\n return ans\r\n\r\n\r\nn,m=list(map(int,input().split()))\r\nprint(team(n,m))\r\n", "n,m=map(int,input().split())\r\nif n>m+1 or 2*n+2<m:\r\n\tprint(-1)\r\nelif n==m+1:\r\n\tprint('01'*m+'0')\r\nelif n==m:\r\n\tprint('01'*n)\r\nelif 2*n+2==m:\r\n\tprint('110'*n+'11')\r\nelse:\r\n\tt=m-n-1\r\n\tprint('110'*t+'10'*(n-t)+'1')", "n_, m_ = map(int, input().split())\nfor d_n, d_m in [(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)]:\n n = n_ - d_n\n m = m_ - d_m\n k1 = m - n\n k2 = 2*n - m\n if k1 < 0 or k2 < 0:\n continue\n p1 = '0' if d_n else ''\n p2 = ''.join(['110']*k1)\n p3 = ''.join(['10']*k2)\n p4 = '' if d_m == 0 else '1' if d_m == 1 else '11'\n # print(d_n, d_m, k1, k2)\n print(''.join([p1, p2, p3, p4]))\n exit(0)\nprint(-1)", "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\nmod = int(1e9)+7\r\n\r\n\r\nn, m = rinput()\r\n \r\nif (m>2*n+2 or n>m+1):\r\n\tprint(-1)\r\nelif n >= m:\r\n\tans = \"01\" * m \r\n\tif (n>m):\r\n\t\tans += \"0\"\r\n\tprint(ans)\r\nelif (m == 2*n + 2):\r\n\tans = \"110\"*n + \"11\"\r\n\tprint(ans) \r\nelse:\r\n\tans = \"10\"*n + \"1\"\r\n\tm-=(n+1);\r\n\tif (m==0):\r\n\t\tprint(ans)\r\n\telse:\r\n\t\tans = ans.replace('1', '11', m) \r\n\t\tprint(ans)", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush, nlargest, nsmallest\r\nfrom math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log\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\n# sys.setrecursionlimit(pow(10, 6))\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\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\n\r\n\r\nn, m = sp()\r\nif (n + 1) * 2 >= m >= n-1:\r\n doubles = min(m//2, m-n+1)\r\n answer = []\r\n if n > m//2:\r\n answer.append(0)\r\n n -= 1\r\n for i in range(doubles):\r\n answer.append(11)\r\n m -= 2\r\n answer.append(0)\r\n n -= 1\r\n if n == -1:\r\n answer.pop()\r\n while True:\r\n if m > 0:\r\n answer.append(1)\r\n m -= 1\r\n if n > 0:\r\n answer.append(0)\r\n n -= 1\r\n if n <= 0 and m <= 0:\r\n break\r\n out(''.join(map(str, answer)))\r\n exit()\r\nout(-1)\r\n", "\t\r\n\r\n\r\nfrom 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\t\r\n# from bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\ndef fun(n,m):\r\n\tif n > m+1:\r\n\t\treturn -1\r\n\tif n < ceil((m-2)/2):\r\n\t\treturn -1\r\n\tv=[]\r\n\twhile m>n and n>0 and m>0:\r\n\t\tv.append('110')\r\n\t\tm -= 2\r\n\t\tn -= 1\r\n\r\n\t# print(n,m)\r\n\r\n\tif n > m:\r\n\t\tv.append('0')\r\n\t\tn -= 1\r\n\telif m>n:\r\n\t\tv.append('1'*m)\r\n\r\n\twhile n>0 and m>0:\r\n\t\tv.append('10')\r\n\t\tn -= 1\r\n\t\tm -= 1\r\n\r\n\treturn ''.join(v)\r\n\r\nn,m = mp()\r\nprint(fun(n,m))\r\n\r\n", "n, m=map(int, input().split())\r\nif (n-1)<=m and m<=2*(n+1):\r\n\tx=min(n, m)\r\n\ts=['10' for x in range(x)]\r\n\tm-=x\r\n\tn-=x;\r\n\tl=[]\r\n\tans=''\r\n\tfor d in s:\r\n\t\tif m>0:\r\n\t\t\tl.append('1')\r\n\t\t\tm-=1\r\n\t\tl.append(d)\r\n\tl.append('1'*m)\r\n\tprint('0'*n, ''.join(x for x in l), sep='')\r\nelse:\r\n\tprint(-1)", "# Uses python3\r\nimport sys\r\nimport math\r\ndef fn(n,m):\r\n l = [str(0)]*(n+m)\r\n if m>2*(n+1) or n>m+1:\r\n print(-1)\r\n return 0\r\n elif n==m:\r\n for i in range(n+m):\r\n if i%2==0:\r\n l[i]=str(1)\r\n elif m>n:\r\n z=0\r\n k=0\r\n for i in range(m-n-1):\r\n l[z]=str(1)\r\n l[z+1]=str(1)\r\n z=z+3\r\n k =z\r\n for j in range(k,n+m):\r\n if j%2==k%2:\r\n l[j]=str(1)\r\n else:\r\n l[j]=str(0)\r\n else:\r\n for i in range(n+m):\r\n if i%2!=0:\r\n l[i]=str(1)\r\n \r\n print(''.join(l))\r\n \r\nif __name__ == '__main__': \r\n input = sys.stdin.read()\r\n data = list(map(int, input.split()))\r\n n = data[0]\r\n m = data[1]\r\n (fn(n,m))", "n, m = map(int, input().split())\r\nif n > m + 1 or m > (n + 1) * 2:\r\n print(-1)\r\nelif n > m:\r\n print('01' * m + '0')\r\nelif m > n * 2:\r\n print('110' * n + '1' * (m - n * 2))\r\nelse:\r\n print('110' * (m - n) + '10' * (n * 2 - m))", "from sys import stdin\r\n\r\nn, m = map(int, stdin.readline().rstrip().split(\" \"))\r\n\r\nif m-2 > 2*n or n - 1 > m:\r\n print(-1)\r\nelse:\r\n g = max(min(m - n, n), 0)\r\n print ('1' * (m - n * 2) + g * '011' + (min(n, m) - g) * '01' + '0' * (n > m))", "n, m=[int(k) for k in input().split()]\r\nif m>2*n+2 or m<n-1:\r\n print(-1)\r\nelse:\r\n res=[]\r\n c=m-n+1\r\n for j in range(n-1):\r\n res.append(0)\r\n res.append(1)\r\n if c>0:\r\n res.append(1)\r\n c-=1\r\n res.append(0)\r\n for j in range(min(2, c)):\r\n res.append(1)\r\n c-=1\r\n q=[]\r\n for j in range(min(2, c)):\r\n q.append(1)\r\n c-=1\r\n print(\"\".join([str(k) for k in q+res]))", "n,m=map(int,input().split())\r\nif (n>m+1) or (m>(n+1)*2):\r\n print(-1)\r\nelse:\r\n if m<=n:\r\n ans=min(n,m)*'01'\r\n n-=min(n,m)\r\n m-=min(n,m)\r\n ans+=n*'0'\r\n else:\r\n temp=[]\r\n while n>0 and m>0:\r\n temp.append('1')\r\n temp.append('0')\r\n n-=1\r\n m-=1\r\n if m:\r\n temp.append('1')\r\n m-=1\r\n for i in range(len(temp)):\r\n if m==0:\r\n break\r\n if temp[i]=='1':\r\n temp[i]='11'\r\n m-=1\r\n ans=''.join(temp)\r\n print(ans)", "n, m = map(int, input().split())\r\nif m < n - 1 or m > 2 * (n + 1):\r\n print(-1)\r\nelse:\r\n s = \"\"\r\n\r\n # We need to insert 1s outside 0s.\r\n if m > 2 * (n - 1):\r\n s = \"011\" * (n - 1) + '0'\r\n r = m - 2 * (n - 1)\r\n s = ('1' * min(r, 2)) + s + ('1' * max(0, r - 2))\r\n \r\n # No need to insert 1s outside 0s.\r\n else: \r\n one_one = 2 * (n - 1) - m\r\n two_ones = m - one_one\r\n s += \"01\" * one_one\r\n s += \"011\" * (two_ones // 2)\r\n s += '0'\r\n print(s)\r\n ", "from math import ceil\r\n\r\nn,m=map(int,input().split())\r\nif n>m+1 or m>2*(n+1):print(-1)\r\nelse:\r\n if n>m:\r\n print(\"01\"*(m)+\"0\")\r\n else:\r\n if m>n:\r\n req=min(ceil((m-n+1)//2),n)\r\n print(\"110\"*(req),end=\"\")\r\n m-=2*req;n-=req\r\n if m-n<=2:\r\n print(\"10\"*n+\"1\"*(m-n))\r\n else:\r\n m-=2\r\n print(\"110\"*(m-n)+\"10\"*(2*n-m)+\"11\")", "z,o = map(int,input().split())\r\nif z-1<=o<=2*(z+1):\r\n x = o-z-1\r\n if z>o:\r\n s = 0\r\n else:\r\n s = 1\r\n z = o+z\r\n ans = []\r\n while(z>0):\r\n if s%2 == 0:\r\n ans.append(\"0\")\r\n s = 1\r\n z-=1\r\n else:\r\n if x <= 0:\r\n ans.append(\"1\")\r\n z-=1\r\n s = 0\r\n else:\r\n ans.append(\"1\")\r\n ans.append(\"1\")\r\n z-=2\r\n x-=1\r\n s = 0\r\n print(\"\".join(ans))\r\nelse:\r\n print(-1)", "zeroes,ones = map(int,input().split())\r\nif zeroes>ones+1 or 2*(zeroes+1)<ones:\r\n print(-1)\r\nelse:\r\n ans=\"\"\r\n if zeroes>=ones: \r\n if zeroes>ones:\r\n print(\"01\"*ones+\"0\")\r\n else:\r\n print(\"01\"*zeroes)\r\n else:\r\n ones-=(zeroes+1)\r\n if ones>zeroes:\r\n print(\"110\"*zeroes+\"11\")\r\n else: \r\n print(\"110\"*ones+\"10\"*(zeroes-ones)+\"1\")", "# Description of the problem can be found at http://codeforces.com/problemset/problem/401/C\r\n\r\nn, m = map(int, input().split())\r\n\r\nif not (m <= 2 * (n + 1) and m >= (n - 1)):\r\n print(-1)\r\n quit()\r\nelse:\r\n ma=max(min(m-n,n),0)\r\n print(\"1\" * (m - n * 2) + \"011\" * ma + (min(n, m) - ma) * \"01\" + \"0\" * (n > m))\r\n ", "def solve():\n zeroes, ones = map(int, input().split())\n max_pairs = (ones+1) // 2\n if (zeroes > ones + 1) or ((zeroes < (ones+1) // 2 - 1)):\n print(-1)\n return\n \n #C1\n if ones + 1 == zeroes:\n # print('C1')\n print('1'.join(['0' for _ in range(zeroes)]))\n \n #C3\n elif max_pairs == zeroes + 1:\n # print('C3')\n res = '0'.join(['11' for _ in range(max_pairs)])\n if ones % 2:\n res = res[:-1]\n print(res)\n \n #C2\n else:\n # print(\"C2\")\n if ones == zeroes * 2:\n tp = zeroes\n elif ones == zeroes:\n tp = 0\n else:\n tp = ones % zeroes\n op = zeroes - tp\n res = ''\n for _ in range(tp):\n res += '011'\n for _ in range(op):\n res += '01'\n print(res) \n\n \n \n \n\nsolve()\n\n\n\n \n\n\n \n \n\n\n\n\n", "n,m=map(int,input().split())\r\nif (n>m+1 or (m-1)//2>n ):\r\n print(-1)\r\nelse:\r\n if m==2*n-1:\r\n m=m-1\r\n print(\"1\",\"011\"*(m-n+1),\"01\"*(2*n-m-2),\"0\",sep=\"\")\r\n elif m==2*n:\r\n m=m-2\r\n print(\"11\",\"011\"*(m-n+1),\"01\"*(2*n-m-2),\"0\",sep=\"\")\r\n elif m==2*n+1:\r\n m=m-3\r\n print(\"11\",\"011\"*(m-n+1),\"01\"*(2*n-m-2),\"01\",sep=\"\")\r\n elif m==2*n+2:\r\n m=m-4\r\n print(\"11\",\"011\"*(m-n+1),\"01\"*(2*n-m-2),\"011\",sep=\"\")\r\n else:\r\n print(\"011\"*(m-n+1),\"01\"*(2*n-m-2),\"0\",sep=\"\")\r\n", "n, m = list(map(int, input().split()))\r\nif m < n - 1 or n * 2 + 2 < m:\r\n print(-1)\r\nelse:\r\n res = ''\r\n if m > n:\r\n d = min(m - n, n)\r\n res += '110'*d\r\n n -= d\r\n m -= 2*d\r\n t = min(m, n)\r\n res += '10'*t\r\n m -= t\r\n n -= t\r\n if m > 0:\r\n res += '1' * m\r\n if n > 0:\r\n res = '0' + res\r\n print(res)\r\n", "y, x = map(int, input().split())\r\n\r\nif(x > 2*(y + 1) or x < (y-1)):\r\n\tprint(-1)\r\n\t\r\nelse:\r\n\tt = (1 + y)\r\n\tl = [0]*t\r\n\t\r\n\tfor i in range(x):\r\n\t\tl[i%t] += 1\r\n\t#print(l)\r\n\tj = 0\r\n\tf = False\r\n\t\r\n\tfor i in range(len(l)):\r\n\t\tif(l[i] == 0):\r\n\t\t\tj = i\r\n\t\t\tf = True\r\n\t\t\tbreak\r\n\t\r\n\tif(f):\r\n\t\tl = l[:j+1]\r\n\t\t\r\n\t#print(l)\r\n\tp = []\r\n\tfor i in l:\r\n\t\tp.append(\"1\"*i)\r\n\t\t\r\n\tans = \"0\".join(p)\r\n\tif(ans.count(\"0\") < y):\r\n\t\tif(y - ans.count(\"0\") == 1):\r\n\t\t\tans = \"0\" + ans\r\n\t\telif(y - ans.count(\"0\") == 2):\r\n\t\t\tans = \"0\" + ans + \"0\"\r\n\t\t\t\r\n\tprint(ans)", "from sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\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\nmod = 1000000007\r\n\r\nn, m = iia()\r\nres = \"\"\r\nif m < n - 1 or 2 * n < m - 2:\r\n print(\"-1\")\r\nelif n > m:\r\n print('01' * m + '0')\r\nelif n == m:\r\n print('01' * m)\r\nelse:\r\n print(('10' * n + '1').replace('1', '11', m - n - 1))\r\n", "z, o = map(int, input().split())\r\nans = []\r\nif(o>(z+1)*2 or o<z-1):\r\n print(-1)\r\nelse:\r\n left = o-(z-1)\r\n for i in range(z):\r\n if(i==z-1):\r\n ans.append('0')\r\n if(left==1):\r\n ans.append('1')\r\n left-=1\r\n elif(left>=2):\r\n ans.append('11')\r\n left-=2\r\n else:\r\n ans.append('01')\r\n if(left>=1):\r\n ans.append('1')\r\n left-=1\r\n print('1'*left, end = \"\")\r\n print(\"\".join(ans))", "z,o=list(map(int,input().split()))\r\nif o+1<z or o>2*(z+1):\r\n print(-1)\r\nelse:\r\n if z==(o+1):\r\n print(\"01\"*(z-1)+\"0\")\r\n elif z==o:\r\n print(\"10\"*z)\r\n elif o==z+1:\r\n print(\"10\"*z+\"1\")\r\n elif o>z+1 and o<2*(z+1):\r\n print((\"110\")*(o-z-1)+(\"10\")*(2*z-o+1)+\"1\")\r\n elif o==2*(z+1):\r\n print(\"110\"*z+\"11\")\r\n ", "def mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\nn,m=mp()\r\nif (n-1)<=m and m<=2*(n+1):\r\n\ta='110'\r\n\tb='10'\r\n\ts=''\r\n\tm-=(n-1)\r\n\tif m==0:\r\n\t\ts+='0'\r\n\t\ts+=b*(n-1)\r\n\telif m-1<=n:\r\n\t\ts=\"110\"*(m-1)+\"10\"*(n-m+1)\r\n\telse:\r\n\t\ts=\"110\"*n+\"1\"*(m-1-n)\r\n\tprint(s)\r\nelse:\r\n\tprint(-1)\r\n", "import sys\ninput=sys.stdin.readline\nf=lambda :map(int, input().split())\nn, m=f()\nif (n-1)<=m<=2*(n+1):\n\tif m==n-1:\n\t\tprint('01'*m+'0')\n\telif m==n:\n\t\tprint('01'*m)\n\telif m>=(2*n):\n\t\tprint('110'*n+'1'*(m-2*n))\n\telse:\n\t\tprint('110'*(m%n)+'10'*(n-m%n))\nelse:\n\tprint(-1)", "n,m=map(int,input().split())\r\nif m>2*(n+1) or m<=n-2:\r\n print(-1)\r\nelse:\r\n s=\"\"\r\n if m==n:\r\n s=\"10\"*m\r\n elif m<n:\r\n s=\"01\"*m+\"0\"*(n-m)\r\n else:\r\n if m<=2*n:\r\n s=\"110\"*(m-n)+\"10\"*(2*n-m)\r\n else:\r\n s=\"110\"*(n)+\"1\"*(m-2*n)\r\n print(s)\r\n\r\n", "n,m=list(map(int,input().split()))\r\nt=''\r\nf=0\r\nif n-m==1:\r\n print('0'+'10'*m)\r\nelif n==m:\r\n print('10'*n)\r\nelse: \r\n while n!=0 or m!=0:\r\n if m<(n+1) or m>((2*n)+2):\r\n f=1\r\n print(\"-1\")\r\n break\r\n elif n>0 and m>=n+2:\r\n t=t+'110'\r\n m=m-2\r\n n=n-1\r\n elif n>0 and m>=n+1:\r\n t=t+'10'\r\n m=m-1\r\n n=n-1\r\n elif n==0 and m==1:\r\n t=t+'1'\r\n m=m-1\r\n elif n==0 and m==2:\r\n t=t+'11'\r\n m=m-2\r\n else:\r\n continue\r\n \r\n if f==0:\r\n print(t)", "n, m = map(int, input().split())\r\nif m >= n and n * 2 + 2 < m or m < n - 1:\r\n print(-1)\r\nelse:\r\n while n or m:\r\n if m and not n:\r\n print('1' * m, end='')\r\n break\r\n elif n and not m:\r\n print('0', end='')\r\n break\r\n\r\n elif m - 2 >= n - 1:\r\n m -= 2\r\n n -= 1\r\n print('110', end='')\r\n\r\n elif m - 1 >= n - 1:\r\n print('10', end='')\r\n m -= 1\r\n n -= 1\r\n else:\r\n print('01', end='')\r\n m -= 1\r\n n -= 1\r\n", "fast=lambda:stdin.readline().strip()\r\nzzz=lambda:[int(i) for i in fast().split()]\r\nz,zz=input,lambda:list(map(int,z().split()))\r\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\r\nfrom re import *\r\nfrom sys import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom queue import *\r\nfrom bisect import *\r\nfrom string import *\r\nfrom itertools import *\r\nfrom collections import *\r\nfrom math import factorial as f\r\nfrom bisect import bisect as bs\r\nfrom bisect import bisect_left as bsl\r\nfrom collections import Counter as cc\r\nfrom itertools import accumulate as ac\r\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\r\ndef output(answer):stdout.write(str(answer))\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n If you Know me , Then you probably don't know me !\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\n\r\nn,m=zzz()\r\n\r\nif n>m+1 or 2*n+2<m:\r\n\tprint(-1)\r\nelif n==m+1:\r\n\tprint('01'*m+'0')\r\nelif n==m:\r\n\tprint('01'*n)\r\nelif 2*n+2==m:\r\n\tprint('110'*n+'11')\r\nelse:\r\n\tt=m-n-1\r\n\tprint('110'*t+'10'*(n-t)+'1')\r\n \r\n\r\n\r\n\r\n\r\n", "from sys import stdin , stdout\r\nx,y=map(int,stdin.readline().split())\r\nif x==y:\r\n print('10'*x)\r\nelif x<y:\r\n if y <= (2*x) +2:\r\n if y >= 2 *x:\r\n double = x\r\n single= y - 2*x\r\n # print(single,double)\r\n res='110'* double + '1'*single\r\n else:\r\n double=y % x\r\n single = x - double\r\n res='110'* double + '10'*single\r\n # print(single,double)\r\n stdout.write(res + '\\n')\r\n else:\r\n print(-1)\r\nelse:\r\n if x > y + 1 or x < y-1:\r\n print(-1)\r\n else:\r\n res= '0'*(x-y) + '10'*y\r\n stdout.write(res + '\\n')", "n, m = map(int, input().split())\r\nif m > 2*n+2 or n > m + 1:\r\n print(-1)\r\nelse:\r\n ans = ''\r\n if n > m:\r\n print('01'*m+'0')\r\n else:\r\n k = m - n\r\n k = min(k, n)\r\n print(\"110\"*k + \"10\"*(n-k) + \"1\"*(m-k-n))\r\n", "n,m=map(int,input().split())\r\nans=chk=0\r\nif n-m>1 or m>n*2+2:\r\n print (-1)\r\nelif n-m>=0:\r\n print ('01'*m+'0'*(n-m))\r\nelif m==n*2:\r\n print ('110'*n)\r\nelif m>n*2:\r\n print ('110'*n+'1'*(m-n*2))\r\nelse:\r\n print ('110'*(m-n)+'10'*(n-(m-n)))\r\n", "import sys\r\n\r\n# sys.stdin, sys.stdout = open(\"input.txt\", \"r\"), open(\"output.txt\", \"w\")\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n if n - m >= 2 or m > 2 * (n + 1):\r\n print(-1)\r\n return\r\n if n >= m:\r\n ans = [\"01\"] * m\r\n if n > m:\r\n ans.append(\"0\")\r\n print(\"\".join(ans))\r\n else:\r\n t = 0\r\n if m - n > 1:\r\n t = m - n - 1\r\n ans = [\"1\", \"0\"] * n + [\"1\"]\r\n for i in range(0, len(ans), 2):\r\n if t == 0:\r\n break\r\n ans[i] = \"11\"\r\n t -= 1\r\n print(\"\".join(ans))\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "import sys\r\n\r\nin_f = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\r\nin_f = in_f.split()\r\n\r\nn_zeros = int(in_f[0])\r\nm_ones = int(in_f[1])\r\n\r\nsequence = \"\"\r\nnums = [\"1\", \"0\"]\r\nif n_zeros > m_ones + 1: # TOO MANY ZEROS\r\n print(-1)\r\nelif m_ones > 2 * (n_zeros + 1): # TOO MANY ONES\r\n print(-1)\r\nelse:\r\n if n_zeros == m_ones + 1:\r\n sequence += \"0\"\r\n n_zeros -= 1\r\n if n_zeros == m_ones:\r\n for i in range(n_zeros + m_ones):\r\n sequence += nums[i % 2]\r\n else:\r\n while m_ones > n_zeros and n_zeros != 0:\r\n sequence += \"11\"\r\n sequence += \"0\"\r\n n_zeros -= 1\r\n m_ones -= 2\r\n if n_zeros == 0:\r\n for i in range(m_ones):\r\n sequence += nums[0]\r\n m_ones -= 1\r\n if m_ones == n_zeros and m_ones != 0:\r\n for i in range(n_zeros + m_ones):\r\n sequence += nums[i % 2]\r\n print(sequence)\r\n", "'''\n10/20/2021\nn:\n no 2 zero\n no 3 one\nt: when is impossible to get such arrangement? \n - 1101, 11011, 101, 01010\n - when num_0 > num_1, should use as much num_0 as possible -> place 0 first, place just 1 in between \n - if num_1 > 2 + num_0*2, then it is impossible\n - if num_0 > num_1+1, then it is impossible\n- if num_1 == num_0, this can be done \ng: priority queue\n'''\n\ninput_arr = [int(n) for n in input().split()]\nnum_0, num_1 = input_arr[0], input_arr[1]\n\nif num_0>num_1+1 or num_1>2+num_0*2:\n print('-1')\nelse:\n ans = []\n place_0 = False if num_1>num_0 else True\n \n while num_0 != num_1:\n if place_0:\n ans.append('0')\n num_0 -= 1\n else:\n to_add_cnt = min(num_1, 2)\n ans.extend(['1']*to_add_cnt)\n num_1 -= to_add_cnt\n\n place_0 = not place_0\n\n if num_0:\n if ans:\n add_zero = True if ans[-1]=='1' else False\n for i in range(num_0+num_1):\n ans.append('0' if add_zero else '1')\n add_zero = not add_zero\n else:\n for i in range(num_0+num_1):\n ans.append('0' if i%2 else '1')\n \n print(''.join(ans))\n \n", "n, m=map(int, input().split())\r\n\r\nif n-1<=m<=2*(n+1):\r\n\tm-=n-1\r\n\tif m==0:\r\n\t\ts=\"0\"+\"10\"*(n-1)\r\n\telif m-1<=n:\r\n\t\ts=\"110\"*(m-1)+\"10\"*(n-m+1)\r\n\telse:\r\n\t\ts=\"110\"*n+\"1\"*(m-1-n)\r\n\tprint(s)\r\nelse:\r\n\tprint(-1)\r\n", "k0, k1 = map(int, input().split())\r\n\r\npossible = True\r\nprint0 = False\r\nprint11 = False\r\n\r\ncnt110 = k1 - k0\r\ncnt10 = k0 - cnt110\r\n\r\nif cnt110 < 0 or cnt10 < 0:\r\n print0 = True\r\n k0 -= 1\r\n cnt110 = k1 - k0\r\n cnt10 = k0 - cnt110\r\n if cnt110 < 0 or cnt10 < 0:\r\n print0 = False\r\n print11 = True\r\n k0 += 1\r\n k1 -= 2\r\n cnt110 = k1 - k0\r\n cnt10 = k0 - cnt110\r\n if cnt110 < 0 or cnt10 < 0:\r\n possible = False\r\n\r\nif not possible:\r\n print(-1)\r\nelse:\r\n if print0:\r\n print(0, end='')\r\n print(\"110\" * cnt110, \"10\" * cnt10, sep='', end='')\r\n if print11:\r\n print(\"11\")\r\n", "def f(n,m):\r\n if m>n+1 or n>2*(m+1):\r\n return -1\r\n elif m==n+1:\r\n return \"01\"*n+str(0)\r\n elif n==2*m+2:\r\n return \"110\"*m+str(11)\r\n elif n==2*m+1:\r\n return \"110\"*m+str(1)\r\n else:\r\n d1=n-m\r\n d2=2*m-n\r\n return \"110\"*d1+\"10\"*d2\r\nnm=list(map(int, input().rstrip().split()))\r\nn=nm[1]\r\nm=nm[0]\r\nprint(f(n,m))", "n, m = map(int, input().split())\n\ns = []\n\n\nif not (n-1 <= m and m <= 2 * (n+1)):\n print(-1)\n exit()\n\nif m == n-1:\n print(\"01\" * m+ \"0\")\n\nelif m == n:\n print(\"01\"*n)\n\nelif 2*n+2 == m:\n print(\"110\"*n + \"11\")\nelse:\n t = m - n -1\n print('110' * t + \"10\"*(n-t) + \"1\")", "\r\nimport random\r\nfrom heapq import heappush, heappop, _heapify_max, heapify\r\nimport operator as op\r\nimport sys\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\nfrom collections import defaultdict, deque\r\nfrom functools import reduce\r\nfrom math import ceil, factorial, gcd, sqrt, log2, log,log10\r\n\r\n\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\nmod = int(1e9)+7\r\n_mod = 998244353\r\n\r\n\r\n###************* Usefull Function *************###\r\n\r\ndef ncr(n, r):\r\n r = min(n, n-r)\r\n nmtr = reduce(op.mul, range(n, n-r, -1), 1)\r\n dnmtr = reduce(op.mul, range(1, r+1), 1)\r\n return nmtr//dnmtr\r\n\r\n\r\ndef fact(n):\r\n return factorial(n)\r\n\r\n\r\ndef digitSum(n):\r\n return sum(map(int,str(n)))\r\n\r\n\r\ndef lcm(a,b):\r\n return (a*b)//gcd(a,b)\r\n\r\n###*************** End Of An Era ***************###\r\n\r\n\r\n\r\n\r\n\r\ndef myyy__answer():\r\n n,m=map(int,input().split())\r\n if(n>=m):\r\n if(n-m<2):\r\n ans=\"01\"*min(n,m)\r\n ans+=\"0\"*(n-m)\r\n print(ans)\r\n else:\r\n print(-1)\r\n else:\r\n if(n<m//2-int(m%2==0)):\r\n print(-1)\r\n else:\r\n if((m//2)==n or n==(m//2)-1):\r\n print(\"110\"*n + \"11\"*((m//2)-n) + \"1\"*(m&1))\r\n else:\r\n print(\"10\"*((n-(m//2))*2) + \"110\"*(n-((n-(m//2))*2)) + \"1\"*(m&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\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\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 def input(): return sys.stdin.readline().rstrip(\"\\r\\n\").strip()\r\n\r\n # for _ in range(int(input())):\r\n myyy__answer()\r\n", "n, m = map(int, input().split())\r\n\r\nif n > m + 1 or m > 2 * (n + 1):\r\n print(-1)\r\nelif m <= n:\r\n print('01' * m + '0' * (n > m))\r\nelse:\r\n print(('10' * n + '1').replace('1', '11', m - n - 1))", "import math\n\nn, m = map(int, input().split())\n\nif n == 0 and m == 1:\n print(1)\n exit()\n\nif math.ceil(m / 2) > n + 1:\n print(-1)\n exit()\n\ncon = \"\"\n\nif n == m + 1:\n con += \"0\"\n n -= 1\nelse:\n if n > m:\n print(-1)\n exit()\n\nif m > n and m > 0 and n > 0:\n rem = min((m - n), m//2, n)\n con += \"110\" * rem\n n -= rem\n m -= 2 * rem\n\nif m == n and n > 0 and m > 0:\n con += \"10\" * m\n m = 0\n n = 0\n\nif m >= 0 and m <= 2:\n con += \"1\" * m\nelse:\n print(-1)\n exit()\n\n\nprint(con)" ]

[ "import sys;input=sys.stdin.readline\r\nn,m=map(int,input().split())\r\na=[*map(int,input().split())]\r\nn=2**n\r\ntree=[0]*4*n\r\n\r\ndef build(v,tl,tr):\r\n if tl==tr:tree[v]=a[tl];return 0\r\n tm=tl+tr>>1\r\n t=build(v*2,tl,tm)^1\r\n build(v*2+1,tm+1,tr)\r\n if t:tree[v]=tree[v*2]|tree[v*2+1]\r\n else:tree[v]=tree[v*2]^tree[v*2+1]\r\n return t\r\nbuild(1,0,n-1)\r\ndef upd(v,val):\r\n tree[v]=val\r\n t=1\r\n while v!=1:\r\n if t:tree[v//2]=tree[v//2*2]|tree[v//2*2+1]\r\n else:tree[v//2]=tree[v//2*2]^tree[v//2*2+1]\r\n v//=2\r\n t^=1\r\n \r\nfor i in range(m):\r\n p,b=map(int,input().split())\r\n upd(n+p-1,b)\r\n print(tree[1])\r\n\r\n", "import sys\r\n\r\ndef buildTree(v, l, r, nh):\r\n q = [(1, v, l, r, nh)]\r\n\r\n while q:\r\n (op, v, l, r, nh) = q.pop()\r\n if op:\r\n if l == r-1:\r\n tree[v] = a[l]\r\n else:\r\n m = (l+r) // 2\r\n next = 2*v+1\r\n\r\n q.append((0, v, l, r, nh))\r\n q.append((1, next, l, m, nh-1))\r\n q.append((1, next+1, m, r, nh-1))\r\n else:\r\n next = 2*v+1\r\n if nh %2 == 0:\r\n tree[v] = (tree[next] ^ tree[next+1])\r\n else:\r\n tree[v] = (tree[next] | tree[next+1])\r\n\r\ndef update(v, l, r, p, b, nh):\r\n q = [(1, v, l, r, nh)]\r\n\r\n while q:\r\n (op, v, l, r, nh) = q.pop()\r\n if op:\r\n if l == r-1:\r\n tree[v] = b\r\n else:\r\n m = (l+r) // 2\r\n\r\n q.append((0, v, l, r, nh))\r\n next = 2*v+1\r\n if p < m:\r\n q.append((1, next, l, m, nh-1))\r\n else:\r\n q.append((1, next+1, m, r, nh-1))\r\n else:\r\n next = 2*v+1\r\n if(nh %2 == 0):\r\n tree[v] = (tree[next] ^ tree[next+1])\r\n else:\r\n tree[v] = (tree[next] | tree[next+1])\r\n \r\n\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsz = len(a)\r\n\r\ntree = [0]*(2**(n+1)-1)\r\nbuildTree(0, 0, sz, n)\r\n\r\nqueries, ans = [], []\r\nfor _ in range(m):\r\n p, b = map(int, input().split())\r\n update(0, 0, sz, p - 1, b, n)\r\n ans.append(str(tree[0]))\r\n \r\nprint(\"\\n\".join(ans))", "n,m = (int(i)for i in input().split())\r\na = [int(i) for i in input().split()]\r\ntree = []\r\nalist=[]\r\ntree.append(a)\r\nwhile(True):\r\n b = []\r\n if(len(tree)%2==1):\r\n for i in range(0,len(tree[-1]),2):\r\n b.append(tree[-1][i]|tree[-1][i+1])\r\n else:\r\n for i in range(0 ,len(tree[-1]),2):\r\n b.append(tree[-1][i]^tree[-1][i+1])\r\n tree.append(b)\r\n if len(b)==1:\r\n break\r\nfor query in range(m):\r\n p,b = (int(i) for i in input().split())\r\n p-=1\r\n ind = 1\r\n tree[0][p]=b\r\n while ind<len(tree):\r\n p=p//2\r\n if ind%2==1:\r\n tree[ind][p]=tree[ind-1][2*p]|tree[ind-1][2*p+1]\r\n else:\r\n tree[ind][p] = tree[ind-1][2*p]^tree[ind-1][2*p+1]\r\n ind+=1\r\n print(tree[-1][0]) \r\n" ]

[ "from collections import defaultdict\r\nimport sys\r\nreadline=sys.stdin.readline\r\nimport random\r\n\r\nclass Rolling_Hash:\r\n def __init__(self,lst,base,mod):\r\n self.len=len(lst)\r\n self.base=base\r\n self.mod=mod\r\n self.rolling_hash=[None]*(self.len+1)\r\n self.rolling_hash[0]=0\r\n x=1\r\n for i in range(1,self.len+1):\r\n self.rolling_hash[i]=self.rolling_hash[i-1]+x*lst[i-1]\r\n self.rolling_hash[i]%=self.mod\r\n x*=self.base\r\n x%=self.mod\r\n\r\n def __getitem__(self,i):\r\n if type(i)==int:\r\n a,b=i,i+1\r\n else:\r\n a,b=i.start,i.stop\r\n if a==None or a<-self.len:\r\n a=0\r\n elif self.len<=a:\r\n a=self.len\r\n elif a<0:\r\n a+=self.len\r\n if b==None or self.len<=b:\r\n b=self.len\r\n elif b<-self.len:\r\n b=0\r\n elif b<0:\r\n b+=self.len\r\n return (self.rolling_hash[b]-self.rolling_hash[a])*self.base_reverse[a]%self.mod\r\n\r\n def __len__(self):\r\n return self.len\r\n\r\nN,K=map(int,readline().split())\r\nbase=random.randint(1<<50,1<<60)\r\nmod=(1<<61)-1\r\nS=[Rolling_Hash([ord(s) for s in readline().rstrip()],base,mod) for i in range(N)]\r\ncnt=defaultdict(int)\r\ngraph=defaultdict(set)\r\ndepth={}\r\nfor s in S:\r\n for i in range(len(s)):\r\n graph[s.rolling_hash[i]].add(s.rolling_hash[i+1])\r\n for i in range(len(s)+1):\r\n depth[s.rolling_hash[i]]=i\r\n cnt[s.rolling_hash[-1]]+=1\r\ntour=[]\r\nqueue=[0]\r\nwhile queue:\r\n x=queue.pop()\r\n tour.append(x)\r\n for y in graph[x]:\r\n queue.append(y)\r\ndp={}\r\nfor x in tour[::-1]:\r\n dp[x]=[0]\r\n for y in graph[x]:\r\n prev=dp[x]\r\n dp[x]=[0]*min(len(prev)+len(dp[y])-1,K+1)\r\n for i in range(len(prev)):\r\n for j in range(min(len(dp[y]),K+1-i)):\r\n dp[x][i+j]=max(dp[x][i+j],prev[i]+dp[y][j]+depth[x]*i*j)\r\n for _ in range(cnt[x]):\r\n if len(dp[x])<=K:\r\n dp[x].append(0)\r\n for i in range(len(dp[x])-1,0,-1):\r\n dp[x][i]=max(dp[x][i],dp[x][i-1]+depth[x]*(i-1))\r\nans=max(dp[0][:K+1])\r\nprint(ans)", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN,K=map(int,readline().split())\r\nmod=61247875826634\r\nrand=[10]\r\nfor _ in range(499):\r\n rand.append((rand[-1]**2+1)%mod)\r\nS=[]\r\nfor _ in range(N):\r\n S.append([0])\r\n s=readline().rstrip()\r\n for i in range(len(s)):\r\n S[-1].append((S[-1][-1]+ord(s[i])*rand[i])%mod)\r\npoints=set()\r\nfor s in S:\r\n for x in s:\r\n points.add(x)\r\nidx={x:i for i,x in enumerate(points)}\r\nfor s in S:\r\n for i in range(len(s)):\r\n s[i]=idx[s[i]]\r\nle=len(idx)\r\ncnt=[0]*le\r\nparents=[None]*le\r\nchild=[[] for x in range(le)]\r\ndepth=[None]*le\r\nfor s in S:\r\n for i in range(len(s)-1):\r\n parents[s[i+1]]=s[i]\r\n for i in range(len(s)):\r\n depth[s[i]]=i\r\n cnt[s[-1]]+=1\r\nchild=[[] for x in range(le)]\r\nfor x in range(le):\r\n if parents[x]!=None:\r\n child[parents[x]].append(x)\r\ntour=[]\r\nqueue=[0]\r\nwhile queue:\r\n x=queue.pop()\r\n tour.append(x)\r\n for y in child[x]:\r\n queue.append(y)\r\ndp=[None]*le\r\nfor x in tour[::-1]:\r\n if len(child[x]):\r\n m=max(len(dp[y]) for y in child[x])\r\n for yy in child[x]:\r\n if len(dp[yy])==m:\r\n dp[x]=dp[yy]\r\n break\r\n for y in child[x]:\r\n if y==yy:\r\n continue\r\n prev=dp[x]\r\n dp[x]=[0]*min(len(prev)+len(dp[y])-1,K+1)\r\n for i in range(len(prev)):\r\n for j in range(min(len(dp[y]),K+1-i)):\r\n dp[x][i+j]=max(dp[x][i+j],prev[i]+dp[y][j]+depth[x]*i*j)\r\n else:\r\n dp[x]=[0]\r\n for _ in range(cnt[x]):\r\n if len(dp[x])<=K:\r\n dp[x].append(0)\r\n for i in range(len(dp[x])-1,0,-1):\r\n dp[x][i]=max(dp[x][i],dp[x][i-1]+depth[x]*(i-1))\r\nans=max(dp[0][:K+1])\r\nprint(ans)" ]

[ "n, m = map(int, input().split())\n\na = ([[0, 1], [0, m], [0, 0], [0, m - 1]], [[1, 0], [n, 0], [0, 0], [n - 1, 0]], \\\n\n [[0, 1], [n, m], [0, 0], [n, m - 1]], [[1, 0], [n, m], [0, 0], [n - 1, m]], \\\n\n [[0, 0], [n, m], [0, m], [n, 0]], [[0, 0], [n, m], [n, 0], [0, m]])\n\nfor x in max(a, key = lambda a: (len(set(map(tuple, a))) == len(a)) * all(map((lambda x: min(x[1], x[0]) >= 0), a)) * sum(((a[i][0] - a[i + 1][0]) ** 2 + (a[i][1] - a[i + 1][1]) ** 2) ** 0.5 for i in range(len(a) - 1))):\n\n print(*x)\n\nprint()\n\n\n\n\n\n# Made By Mostafa_Khaled", "def main():\r\n\ta=input().split()\r\n\tfor i in range(len(a)):\r\n\t\ta[i]=int(a[i])\r\n\tm=a[1]\r\n\tn=a[0]\r\n\tif n==0:\r\n\t\tc1={(0, 0), (0, 1), (0, m-1), (0, m)}\r\n\telif m==0:\r\n\t\tc1={(0, 0), (1, 0), (n-1, 0), (n, 0)}\r\n\telse:\r\n\t\tc1={(0, 0), (0, 1), (1, 0), (1, 1), (0, m-1), (0, m), (1, m-1), (1, m), (n-1, m-1), (n-1, m), (n, m-1), (n, m), (n-1, 0), (n, 0), (n-1, 1), (n, 1)}\r\n\tmaximum=0\r\n\tfor i in c1:\r\n\t\tfor j in c1-{i}:\r\n\t\t\tfor k in c1-{i, j}:\r\n\t\t\t\tfor l in c1-{i, j, k}:\r\n\t\t\t\t\tmaximum=max(polyline(i, j, k, l), maximum)\r\n\tfor i in c1:\r\n\t\tfor j in c1-{i}:\r\n\t\t\tfor k in c1-{i, j}:\r\n\t\t\t\tfor l in c1-{i, j, k}:\r\n\t\t\t\t\tif maximum==polyline(i, j, k, l):\r\n\t\t\t\t\t\tprint(l[0], l[1])\r\n\t\t\t\t\t\tprint(k[0], k[1])\r\n\t\t\t\t\t\tprint(j[0], j[1])\r\n\t\t\t\t\t\tprint(i[0], i[1])\r\n\t\t\t\t\t\treturn\r\ndef dis(i, j):\r\n\treturn ((i[0]-j[0])**2+(i[1]-j[1])**2)**(0.5)\r\ndef polyline(i, j, k, l):\r\n\treturn dis(i, j)+dis(j, k)+dis(k, l)\r\nmain()\r\n", "from math import *\n\ndef main():\n n, m = [int(x) for x in input().split()]\n if n == 0:\n print(0, 1)\n print(0, m)\n print(0, 0)\n print(0, m-1)\n elif m == 0:\n print(1, 0)\n print(n, 0)\n print(0, 0)\n print(n-1, 0)\n else:\n r1 = 2*sqrt(n*n + m*m) + max(n, m)\n r2 = 2*sqrt((n - 1)*(n - 1) + m*m) + sqrt(n*n + m*m)\n r3 = 2*sqrt((m - 1)*(m - 1) + n*n) + sqrt(n*n + m*m)\n \n if r3 > max(r1, r2):\n print(n, 1)\n print(0, m)\n print(n, 0)\n print(0, m-1) \n \n elif r2 > r1:\n print(n-1, m)\n print(0, 0)\n print(n, m)\n print(1, 0)\n\n else: \n # r1\n print(0, 0)\n print(n, m)\n if n < m: # take longest route\n print(n, 0)\n print(0, m)\n else:\n print(0, m)\n print(n, 0)\n \n \n\nmain()", "import math\r\n\r\n\r\nclass Point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\n def dist(self, other):\r\n return math.hypot(self.x - other.x, self.y - other.y)\r\n\r\n\r\nclass L:\r\n def __init__(self, *pts):\r\n self.points = pts\r\n\r\n def length(self):\r\n result = 0\r\n for i in range(len(self.points) - 1):\r\n result += self.points[i].dist(self.points[i + 1])\r\n return result\r\n\r\n def __gt__(self, other):\r\n return self.length() > other.length()\r\n\r\n def __repr__(self):\r\n result = str()\r\n for p in self.points:\r\n result += f\"{p.x} {p.y}\\n\"\r\n return result\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n\r\n if n == 0:\r\n print(0, 1)\r\n print(0, m)\r\n print(0, 0)\r\n print(0, m - 1)\r\n return\r\n\r\n if m == 0:\r\n print(1, 0)\r\n print(n, 0)\r\n print(0, 0)\r\n print(n - 1, 0)\r\n return\r\n\r\n if n == 1 and m == 1:\r\n print(1, 1)\r\n print(0, 0)\r\n print(1, 0)\r\n print(0, 1)\r\n return\r\n\r\n L1 = L(\r\n Point(n, m),\r\n Point(0, 0),\r\n Point(n, 0),\r\n Point(0, m),\r\n )\r\n\r\n L2 = L(\r\n Point(0, 0),\r\n Point(n, m),\r\n Point(n, 0),\r\n Point(0, m),\r\n )\r\n\r\n L3 = L(\r\n Point(0, 1),\r\n Point(n, m),\r\n Point(0, 0),\r\n Point(n, m - 1),\r\n )\r\n\r\n L4 = L(\r\n Point(1, m),\r\n Point(n, 0),\r\n Point(0, m),\r\n Point(n - 1, 0),\r\n )\r\n\r\n print(max(L1, L2, L3, L4))\r\n\r\n\r\nmain()\r\n", "n, m = map(int, input().split())\r\nif n == 0: print('0 1\\n0 ' + str(m) + '\\n0 0\\n0 ' + str(m - 1))\r\nelif m == 0: print('1 0\\n' + str(n) + ' 0\\n0 0\\n' + str(n - 1) + ' 0')\r\nelif n < m:\r\n if (n ** 2 + m ** 2) ** 0.5 + m < 2 * ((n - 1) ** 2 + m ** 2) ** 0.5:\r\n print(str(n - 1) + ' ' + str(m) + '\\n0 0\\n' + str(n) + ' ' + str(m) + '\\n1 0')\r\n else: print('0 0\\n' + str(n) + ' ' + str(m) + '\\n' + str(n) + ' 0\\n0 ' + str(m))\r\nelse:\r\n if (n ** 2 + m ** 2) ** 0.5 + n < 2 * (n ** 2 + (m - 1) ** 2) ** 0.5:\r\n print(str(n) + ' ' + str(m - 1) + '\\n0 0\\n' + str(n) + ' ' + str(m) + '\\n0 1')\r\n else: print('0 0\\n' + str(n) + ' ' + str(m) + '\\n0 ' + str(m) + '\\n' + str(n) + ' 0')", "from itertools import permutations\r\n\r\ndist2d = lambda p1, p2: sum([pow(p1[i] - p2[i], 2) for i in range(len(p1))]) ** .5\r\nn, m = map(int, input().split())\r\n\r\nif n == 0:\r\n print(f'0 1\\n0 {m}\\n0 0\\n0 {m - 1}')\r\nelif m == 0:\r\n print(f'1 0\\n{n} 0\\n0 0\\n{n - 1} 0')\r\nelse:\r\n p = list({(0, 0), (0, 1), (0, m - 1), (0, m), (1, 0), (1, m), (n - 1, 0), (n - 1, m), (n, 0), (n, 1), (n, m - 1),\r\n (n, m)})\r\n cur, ans = 0, []\r\n for per in permutations(p, 4):\r\n d = sum([dist2d(per[i], per[i - 1]) for i in range(1, 4)])\r\n if d > cur:\r\n cur, ans = d, per\r\n\r\n for i in ans:\r\n print(f'{i[0]} {i[1]}')\r\n", "n , m = map(int,input().split())\r\nif n == 0 :\r\n print (0, 1)\r\n print (0, m)\r\n print (0, 0)\r\n print (0, m - 1)\r\nelif m == 0 :\r\n print (1, 0)\r\n print (n, 0)\r\n print (0, 0)\r\n print (n - 1, 0)\r\nelif m >= n :\r\n if 2 * (m ** 2 + (n - 1) ** 2) ** 0.5 >= m + (m ** 2 + n ** 2) ** 0.5 :\r\n print (1, 0)\r\n print (n, m)\r\n print (0, 0)\r\n print (n - 1, m)\r\n else :\r\n print (n, m)\r\n print (0, 0)\r\n print (0, m)\r\n print (n, 0)\r\nelse :\r\n if 2 * ((m - 1) ** 2 + n ** 2) ** 0.5 >= n + (m ** 2 + n ** 2) ** 0.5 :\r\n print (0, 1)\r\n print (n, m)\r\n print (0, 0)\r\n print (n, m - 1)\r\n else :\r\n print (n, m)\r\n print (0, 0)\r\n print (n, 0)\r\n print (0, m)", "n, m = [int(s) for s in input().split()]\n\np = [(i, j) for i in range(4) for j in range(4) if i + j < 4 and (i <= n) and (j <= m)]\nq = [(n - i, m - j) for i, j in p]\n\np = set(p + q)\nfrom math import sqrt\ndef dist(a, b):\n return sqrt((a[0]-b[0])**2. + (a[1]-b[1])**2.)\n\ndef dp(a, b, c, d):\n return dist(a, b) + dist(b, c) + dist(c, d)\n\nt = -1\nr = None\nfor a in p:\n for b in p:\n if b == a:\n continue\n for c in p:\n if c == a or c == b:\n continue\n for d in p:\n if d == a or d == b or d == c:\n continue\n f = dp(a, b, c, d)\n if f > t:\n r = (a, b, c, d)\n t = f\n\nfor i, j in r:\n print(i, j)\n", "import math\r\n\r\nn, m = map(int, input().split())\r\n\r\n\r\ndef check(a):\r\n return 0 <= a[0] <= n and 0 <= a[1] <= m\r\n\r\n\r\ndef dist(a, b):\r\n if not check(a) or not check(b):\r\n return -1324345543\r\n return math.hypot(0.0 + a[0] - b[0], a[1] - b[1] + 0.0)\r\n\r\n\r\npoints = [(0, 0), (n, m), (0, 1), (1, 0), (0, m), (n, 0), (n, 1), (m, 1), (n - 1, m - 1), (n - 2, m - 1), (0, m - 1),\r\n (n - 1, 0),\r\n (n - 2, 0), (n - 1, m - 2), (1, 1), (2, 2), (n - 2, m - 2), (2, 1), (1, 2),\r\n (0, 0), (0, 1), (1, 0), (1, 1), (0, m), (0, m - 1), (0, m - 2), (1, m), (2, m),\r\n (n, 0), (n, 1), (n, 2), (n - 1, 0), (n - 1, 1), (n - 2, 1)]\r\npoints = list(set([q if check(q) else (0, 0) for q in points]))\r\nans = 0\r\nanns = []\r\nfor a in points:\r\n for b in points:\r\n for c in points:\r\n for d in points:\r\n if(len({a,b,c,d}))==4:\r\n les = dist(a, b) + dist(b, c) + dist(c, d)\r\n if les > ans:\r\n ans = les\r\n anns = [a, b, c, d]\r\nfor i in anns:\r\n print(*i)", "n, m = list(map(int, input().split()))\n\nl = [(0, 0), (1, 0), (0, 1), (1, 1), (n, 0), (n - 1, 0), (n, 1), (n - 1, 1), (0, m), (1, m), (0, m - 1), (1, m - 1), (n, m), (n - 1, m), (n, m - 1), (n - 1, m - 1)]\n#print(len(l))\n\no = []\n\nfor p in l:\n\t#print(p, n, m, p[0], p[1])\n\tif 0 <= p[0] <= n and 0 <= p[1] <= m and not [p, False] in o:\n\t\to.append([p, False])\n\n#print(o)\n\n\nmz = [False]\nml = 0\nz = [True for i in range(4)]\ndef r(c):\n\tif c == 4:\n\t\tl = 0\n\t\tfor i in range(1, 4):\n\t\t\tl += ((z[i][0] - z[i - 1][0]) ** 2 + (z[i][1] - z[i - 1][1]) ** 2) ** 0.5\t\n\t\t\t#print(i, l)\n\t\tif l > ml:\n\t\t\t#print(\"lol\")\n\t\t\tglobal ml\n\t\t\tglobal mz\n\t\t\tml = l\n\t\t\tmz = z[:]\n\t\t\t#print(\"mz\", mz)\n\t\treturn\n\tfor i in range(len(o)):\n\t\tif not o[i][1]:\n\t\t\to[i][1] = True\n\t\t\tz[c] = o[i][0]\n\t\t\tr(c + 1)\n\t\t\to[i][1] = False \n\n\t#print(mz)\nr(0)\n#print(mz)\nfor i in mz:\n\tprint(i[0], i[1])\n", "import math\nn, m = map(int, input().split())\n\nswapped = False\nif n > m:\n n, m = m, n\n swapped = True\n\ndef mprint(x, y):\n global swapped\n if swapped:\n print(y, x)\n else:\n print(x, y)\n\ndef mlen(pnt):\n res = 0.0\n for i in range(1, 4):\n val = (pnt[i][0] - pnt[i - 1][0]) ** 2\n val += (pnt[i][1] - pnt[i - 1][1]) ** 2\n val = math.sqrt(val)\n res += val\n return res\n\nif n == 0:\n mprint(0, 1)\n mprint(0, m)\n mprint(0, 0)\n mprint(0, m - 1)\nelse:\n one = [(0, 0), (n, m), (n, 0), (0, m)]\n two = [(1, 0), (n, m), (0, 0), (n - 1, m)]\n if mlen(one) > mlen(two):\n two = one\n for x in two:\n mprint(*x)\n" ]

[ "import bisect\r\nimport heapq\r\nimport sys\r\nfrom types import GeneratorType\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 itertools import accumulate\r\nfrom operator import xor\r\nfrom operator import mul\r\ninf = float(\"inf\")\r\nPLATFORM = \"CF\"\r\nif PLATFORM == \"LUOGU\":\r\n import numpy as np\r\n sys.setrecursionlimit(1000000)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\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 return wrappedfunc\r\n\r\n\r\ndef centroid_finder(to, root=0):\r\n # 模板：将有根数进行质心递归划分\r\n centroids = []\r\n pre_cent = []\r\n subtree_size = []\r\n n = len(to)\r\n roots = [(root, -1, 1)]\r\n size = [1]*n\r\n is_removed = [0]*n\r\n parent = [-1]*n\r\n while roots:\r\n root, pc, update = roots.pop()\r\n parent[root] = -1\r\n if update:\r\n stack = [root]\r\n dfs_order = []\r\n while stack:\r\n u = stack.pop()\r\n size[u] = 1\r\n dfs_order.append(u)\r\n for v in to[u]:\r\n if v == parent[u] or is_removed[v]: continue\r\n parent[v] = u\r\n stack.append(v)\r\n for u in dfs_order[::-1]:\r\n if u == root: break\r\n size[parent[u]] += size[u]\r\n c = root\r\n while 1:\r\n mx, u = size[root]//2, -1\r\n for v in to[c]:\r\n if v == parent[c] or is_removed[v]:\r\n continue\r\n if size[v] > mx: mx, u = size[v], v\r\n if u == -1:\r\n break\r\n c = u\r\n centroids.append(c)\r\n pre_cent.append(pc)\r\n subtree_size.append(size[root])\r\n is_removed[c] = 1\r\n for v in to[c]:\r\n if is_removed[v]:\r\n continue\r\n roots.append((v, c, v == parent[c]))\r\n return centroids, pre_cent, subtree_size\r\n\r\n\r\ndef main(ac=FastIO()):\r\n n = ac.read_int()\r\n to = [[] for _ in range(n)]\r\n for _ in range(n - 1):\r\n u, v = ac.read_list_ints_minus_one()\r\n to[u].append(v)\r\n to[v].append(u)\r\n\r\n cc, pp, ss = centroid_finder(to)\r\n ans = [64] * n\r\n for c, p in zip(cc, pp):\r\n ans[c] = ans[p] + 1\r\n ac.lst([chr(x) for x in ans])\r\n return\r\n\r\n\r\nmain()\r\n", "def centroid_tree_decomposition(graph):\r\n n = len(graph)\r\n graph = [c[:] for c in graph] # copy\r\n bfs = [0]\r\n for node in bfs:\r\n bfs += graph[node]\r\n for nei in graph[node]:\r\n graph[nei].remove(node)\r\n size = [0] * n\r\n for node in reversed(bfs):\r\n size[node] = 1 + sum(size[child] for child in graph[node])\r\n decomposition_tree = [[] for _ in range(n)]\r\n def centroid_reroot(u):\r\n N = size[u]\r\n while True:\r\n for v in graph[u]:\r\n if size[v] > N // 2:\r\n size[u] = N - size[v]\r\n graph[u].remove(v)\r\n graph[v].append(u)\r\n u = v\r\n break\r\n else: # u is the centroid\r\n for v in graph[u]:\r\n decomposition_tree[u].append(centroid_reroot(v))\r\n return u\r\n decomposition_root = centroid_reroot(0)\r\n return decomposition_tree, decomposition_root\r\n \r\nimport sys\r\ninp = [int(x) for x in sys.stdin.buffer.read().split()]; ii = 0\r\n \r\nn = inp[ii]; ii += 1\r\ngraph = [[] for _ in range(n)]\r\nfor _ in range(n - 1):\r\n u = inp[ii] - 1; ii += 1\r\n v = inp[ii] - 1; ii += 1 \r\n graph[u].append(v)\r\n graph[v].append(u)\r\n \r\ndecomposition_tree, root = centroid_tree_decomposition(graph)\r\n \r\nlabels = [0] * n\r\n \r\nbfs = [root]\r\nfor node in bfs:\r\n for child in decomposition_tree[node]:\r\n labels[child] = labels[node] + 1\r\n bfs.append(child)\r\n \r\nalpha = ''.join(chr(ord('A') + i) for i in range(26))\r\nprint(' '.join(alpha[label] for label in labels))", "import sys\r\n\r\n# sys.setrecursionlimit(200005)\r\nint1 = lambda x: int(x)-1\r\npDB = lambda *x: print(*x, end=\"\\n\", file=sys.stderr)\r\np2D = lambda x: print(*x, sep=\"\\n\", end=\"\\n\\n\", file=sys.stderr)\r\ndef II(): return int(sys.stdin.readline())\r\ndef LI(): return list(map(int, sys.stdin.readline().split()))\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\ndef LI1(): return list(map(int1, sys.stdin.readline().split()))\r\ndef LLI1(rows_number): return [LI1() for _ in range(rows_number)]\r\ndef SI(): return sys.stdin.readline().rstrip()\r\n\r\n# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]\r\n# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]\r\ninf = (1 << 63)-1\r\n# inf = (1 << 31)-1\r\nmd = 10**9+7\r\n# md = 998244353\r\n\r\n# 重心を再帰的に求める\r\ndef centroid_finder(to, root=0):\r\n centroids = []\r\n pre_cent = []\r\n subtree_size = []\r\n n = len(to)\r\n roots = [(root, -1, 1)]\r\n size = [1]*n\r\n is_removed = [0]*n\r\n parent = [-1]*n\r\n while roots:\r\n root, pc, update = roots.pop()\r\n parent[root] = -1\r\n if update:\r\n stack = [root]\r\n dfs_order = []\r\n while stack:\r\n u = stack.pop()\r\n size[u] = 1\r\n dfs_order.append(u)\r\n for v in to[u]:\r\n if v == parent[u] or is_removed[v]: continue\r\n parent[v] = u\r\n stack.append(v)\r\n for u in dfs_order[::-1]:\r\n if u == root: break\r\n size[parent[u]] += size[u]\r\n c = root\r\n while 1:\r\n mx, u = size[root]//2, -1\r\n for v in to[c]:\r\n if v == parent[c] or is_removed[v]: continue\r\n if size[v] > mx: mx, u = size[v], v\r\n if u == -1: break\r\n c = u\r\n centroids.append(c)\r\n pre_cent.append(pc)\r\n subtree_size.append(size[root])\r\n is_removed[c] = 1\r\n for v in to[c]:\r\n if is_removed[v]: continue\r\n roots.append((v, c, v == parent[c]))\r\n return centroids, pre_cent, subtree_size\r\n\r\nn=II()\r\nto=[[] for _ in range(n)]\r\nfor _ in range(n-1):\r\n u,v=LI1()\r\n to[u].append(v)\r\n to[v].append(u)\r\n\r\ncc,pp,ss=centroid_finder(to)\r\nans=[64]*n\r\nfor c,p in zip(cc,pp):\r\n ans[c]=ans[p]+1\r\n\r\nprint(\" \".join(chr(a) for a in ans))\r\n" ]

[ "from collections import defaultdict,deque\r\nimport sys\r\nimport bisect\r\ninput=sys.stdin.readline\r\nmod=1000000007\r\n\r\ngraph=defaultdict(list)\r\nn=int(input())\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n graph[x].append(y)\r\n graph[y].append(x)\r\nvis=set()\r\nCHECK,OBSERVE=1,0\r\nstack=[(OBSERVE,1,0)]\r\ntree=[0]*(n+1) #size of subtree for each vertex\r\npossible=[0]*(n+1) # list to contain all the possible value for a \r\n\r\nwhile stack:\r\n state,vertex,parent=stack.pop()\r\n if state==OBSERVE:\r\n stack.append((CHECK,vertex,parent))\r\n for child in graph[vertex]:\r\n if child!=parent:\r\n stack.append((OBSERVE,child,vertex))\r\n else:\r\n if len(graph[vertex])==1:\r\n tree[vertex]=1\r\n else:\r\n tmp,local=[],[0]*(n+1)\r\n count=0\r\n for child in graph[vertex]:\r\n if child!=parent:\r\n count+=tree[child]\r\n tmp.append(tree[child])\r\n tmp.append(n-count-1)\r\n tree[vertex]=count+1\r\n #Knapsack\r\n local[0]=1\r\n for x in tmp:\r\n for i in range(n-x,-1,-1):\r\n if local[i]==1:\r\n local[x+i]=1\r\n possible[x+i]=1\r\n\r\nans=[]\r\nfor i in range(1,n-1):\r\n if possible[i]:\r\n ans.append(i)\r\nprint(len(ans))\r\nfor i in ans:\r\n sys.stdout.write(str(i)+' '+str(n-1-i)+'\\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\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nd = defaultdict(list)\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\nx = set()\r\nu, v = 1, 0\r\nq = [(v, 1, 0)]\r\nw = [0]*(n+1)\r\new = [0]*(n+1)\r\n\r\nwhile q:\r\n\r\n a, b, c = q.pop()\r\n if a == v:\r\n q.append((u, b, c))\r\n for i in d[b]:\r\n if i != c:\r\n q.append((v, i, b))\r\n else:\r\n if len(d[b]) == 1:\r\n w[b] = 1\r\n else:\r\n h, g = [], [0]*(n+1)\r\n k = 0\r\n for i in d[b]:\r\n if i != c:\r\n k += w[i]\r\n h.append(w[i])\r\n h.append(n-k-1)\r\n w[b] = k+1\r\n g[0] = 1\r\n for i in h:\r\n for j in range(n-i, -1, -1):\r\n if g[j] == 1:\r\n g[i+j] = 1\r\n if ew[i+j] == 0:\r\n ew[i+j] = 1\r\ne = [(str(i), str(n-i-1)) for i in range(1, n-1) if ew[i] == 1]\r\nprint(len(e))\r\nfor i in e:\r\n print(*i)", "from os import path\r\nimport sys,time, collections as c , math as m , pprint as p\r\nmaxx , localsys , mod = float('inf'), 0 , int(1e9 + 7) \r\nif (path.exists('input.txt')):\tsys.stdin=open('input.txt','r') ; \tsys.stdout=open('output.txt','w')\r\ninput = sys.stdin.readline\r\ndef dfs(v , p):\r\n\tans = 1\r\n\tfor i in d[v]:\r\n\t\tif i != p:\r\n\t\t\tans+=dfs(i, v)\r\n\treturn ans\r\nn = int(input()) ; d = c.defaultdict(list)\r\nfor _ in range(1 ,n):\r\n\tu , v = map(int , input().split())\r\n\td[u].append(v) ;\td[v].append(u)\r\ncheck , observe = 1 , 0\r\nst , tree , possible = [(observe , 1 , 0)] , [0]*n + [0] , [0]*n+[0]\r\nwhile st:\r\n\tstate , vertex , parent = st.pop()\r\n\tif state == observe:\r\n\t\tst.append((check , vertex , parent))\r\n\t\tfor c in d[vertex]:\r\n\t\t\tif c != parent:\r\n\t\t\t\tst.append((observe , c,vertex))\r\n\telse:\r\n\t\ttmp , loc , cnt=[] , [0]*(n+1) ,0\r\n\t\tfor c in d[vertex]:\r\n\t\t\tif c!= parent:\r\n\t\t\t\tcnt+=tree[c]\r\n\t\t\t\ttmp.append(tree[c])\r\n\t\ttmp.append(n-cnt-1)\r\n\t\ttree[vertex] = cnt + 1\r\n\t\tloc[0] =1\r\n\t\tfor x in tmp:\r\n\t\t\tfor i in range(n-x , -1 ,-1):\r\n\t\t\t\tif loc[i] == 1:\r\n\t\t\t\t\tloc[x+i] = 1\r\n\t\t\t\t\tpossible[x+i] = 1\r\npossible[0] = possible[n-1] = 0\r\nprint(possible.count(1))\r\nfor i in range(1 , n- 1):\r\n\tif possible[i]:\r\n\t\tprint(i , n-1-i)\r\n\r\n\t\r\n\r\n", "\r\n\r\n\r\n\r\n# from sortedcontainers import SortedSet\r\nfrom ast import Mod\r\nfrom collections import OrderedDict\r\nfrom io import BytesIO, IOBase\r\nimport os\r\nimport threading\r\nimport collections\r\nfrom tkinter import E\r\nfrom types import GeneratorType\r\nfrom itertools import combinations, permutations\r\nfrom functools import lru_cache\r\nimport bisect\r\nimport sys\r\nfrom array import array\r\nimport heapq\r\nfrom collections import Counter\r\nimport math\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nfrom copy import deepcopy\r\n\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\n\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\n\r\n\r\n\r\n\r\nneighbourNodes = [[] for i in range(n)]\r\n\r\nfor i in range(n - 1):\r\n path, toPath = map(int, input().split())\r\n neighbourNodes[path - 1].append(toPath - 1)\r\n neighbourNodes[toPath - 1].append(path - 1)\r\n\r\n\r\nans = [False for i in range(n)]\r\n\r\n\r\n\r\n@bootstrap\r\ndef dfs(currentNode, parentNode):\r\n size = 1\r\n currentSet = set()\r\n for node in neighbourNodes[currentNode]:\r\n if node != parentNode:\r\n newSize = (yield dfs(node, currentNode))\r\n size += newSize\r\n \r\n newSet = set()\r\n for sizes in currentSet:\r\n newSet.add(sizes + newSize)\r\n ans[sizes + newSize] = True\r\n ans[n - 1 - (sizes + newSize)] = True\r\n \r\n ans[newSize] = True\r\n ans[n - 1 - newSize] = True\r\n newSet.add(newSize)\r\n for sizes in newSet:\r\n currentSet.add(sizes)\r\n \r\n yield size \r\n \r\n\r\n\r\n\r\nrootNode, currentMin = None, float('inf')\r\n\r\n\r\nfor node in range(n):\r\n if len(neighbourNodes[node]) < currentMin:\r\n currentMin = len(neighbourNodes[node])\r\n rootNode = node\r\n\r\n\r\ndfs(rootNode, None) \r\n\r\n\r\n\r\n\r\n\r\nresult = set()\r\n\r\n\r\nfor i in range(1, n - 1):\r\n if ans[i]:\r\n result.add((i, n - 1 - i))\r\n\r\n\r\n\r\nprint(len(result))\r\n\r\n\r\nfor cntOne, cntTwo in result:\r\n print(cntOne, cntTwo)\r\n\r\n\r\n", "from sys import stdin\nn=int(stdin.readline())\ng=[[] for i in range(n)]\nfor _ in range(n-1):\n x,y=map(int,stdin.readline().split())\n x-=1\n y-=1\n g[x].append(y)\n g[y].append(x)\nsubtree_size=[0]*n\nstack=[[-1,0,0]]\nans=[]\nwhile stack:\n par,ver,state=stack.pop()\n if state==0:\n stack.append([par,ver,1])\n for to in g[ver]:\n if to!=par:\n stack.append([ver,to,0])\n else:\n if len(g[ver])==1:\n subtree_size[ver]=1\n else:\n cnt=0\n tmp=[]\n for to in g[ver]:\n if to!=par:\n cnt+=subtree_size[to]\n tmp.append(subtree_size[to])\n tmp.append(n-cnt-1)\n local=[0]*(n+1)\n local[0]=1\n for x in tmp:\n for i in range(n-x,-1,-1):\n if local[i]==1:\n local[i+x]=1\n if x+i!=0 and n-1-(x+i)!=0:\n ans.append(x+i)\n subtree_size[ver]=cnt+1\nans=sorted(list(set(ans)))\nprint(len(ans))\nfor x in ans:\n print(x,n-1-x)" ]

[ "n, m = map(int, input().split())\r\ntab = []\r\nfor _ in range(m):\r\n l = list(map(int, input().split()))\r\n tab.append(l)\r\n\r\np = 0\r\nfor i in range(1, n+1):\r\n s = 0\r\n t = 1001\r\n for j in range(m):\r\n if i in range(tab[j][0], tab[j][1]+1):\r\n if tab[j][2] < t:\r\n s = tab[j][3]\r\n t = tab[j][2]\r\n p += s\r\nprint(p) ", "n, m = map(int, input().split())\r\nINF = 10**18\r\nX = [INF]*n\r\nID = [-1]*n\r\nC = [0]*m\r\nfor i in range(m):\r\n l, r, t, c = map(int, input().split())\r\n l, r = l-1, r-1\r\n C[i] = c\r\n for j in range(l, r+1):\r\n if t < X[j]:\r\n X[j] = t\r\n ID[j] = i\r\nans = 0\r\nfor i in range(n):\r\n if ID[i] != -1:\r\n ans += C[ID[i]]\r\nprint(ans)\r\n", "n,m=list(map(int,input().split()))\r\na={}\r\nfor i in range(1,n+1):\r\n a[i]=[1001,0]\r\nfor i in range(m):\r\n L,R,T,C=map(int,input().split())\r\n for x in range(L,R+1):\r\n if a[x][0]>T:\r\n a[x]=[T,C]\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=a[i][1]\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nv, w = [None] * n, []\r\nfor i in range(m):\r\n l, r, t, c = map(int, input().split())\r\n w.append(c)\r\n for j in range(l - 1, r):\r\n if not v[j] or t < v[j][0]:\r\n v[j] = (t, i)\r\nprint(sum(w[x[1]] for x in v if x))", "n, k = map(int, input().split())\n\nm = []\nid = [-1] * n\nfor at in range(k):\n li = [int(i) for i in input().split()]\n m.append(li)\n\n for i in range(li[0]-1, li[1]):\n if id[i] == -1 or m[id[i]][2] > li[2]:\n id[i] = at\n\nsoma = 0\nfor i in range(n):\n if id[i] != -1:\n soma += m[id[i]][3]\nprint(soma)\n", "import math\r\n#t=int(input())\r\n#lst = list(map(int, input().strip().split(' ')))\r\nn,m = map(int, input().strip().split(' '))\r\nlst=[0]*n\r\ntime=[10000]*n\r\nfor i in range(m):\r\n l,r,t,c = map(int, input().strip().split(' '))\r\n for j in range(l,r+1):\r\n if t<time[j-1]:\r\n time[j-1]=t\r\n lst[j-1]=c\r\nprint(sum(lst))\r\n \r\n \r\n \r\n \r\n \r\n\r\n", "import sys\r\nimport math\r\n\r\n\r\n# 9, 1 -> 8, 2 -> 6, 1 -> 5, 1 -> 4, 1\r\ndef main():\r\n # fin_t = lambda r, l, t: (r - l + 1) * t\r\n n, m = (int(i) for i in input().split())\r\n sections = {i + 1: (float('inf'), -1) for i in range(n)}\r\n profits = [0 for _ in range(m)]\r\n for runner in range(m):\r\n l, r, t, c = (int(i) for i in input().split())\r\n profits[runner] = c\r\n for i in range(l, r + 1):\r\n # print(t)\r\n sections[i] = min(sections[i], (t, runner))\r\n # print(list(sections.values()))\r\n # print([(t, profits[i]) for t, i in sections.values() if i != -1])\r\n print(sum(profits[i] for _, i in sections.values() if i != -1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=map(int,input().split())\n\nSections=[]\nfor i in range(n):\n Sections.append([])\n\nfor i in range(m):\n l,r,t,c=map(int,input().split())\n for j in range(l-1,r):\n Sections[j].append([t,i,c])\n\nans=0\nfor i in range(n):\n if(len(Sections[i])==0):\n continue\n ans+=min(Sections[i])[2]\nprint(ans)\n", "n, m = map(int, input().split(\" \"))\n\nsection = [[] for i in range(n)]\nfor i in range(m):\n l, r, t, c = map(int, input().split(\" \"))\n\n for a in range(l-1, r):\n section[a].append([t, i, c])\n\nanswer = 0\nfor i in section:\n if(i != []):\n i.sort()\n answer += i[0][2]\n\nprint(answer)\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\ntimes = [float('inf')]*(n+1)\r\nprofits = [0]*(n+1)\r\nfor _ in range(m):\r\n l, r, t, c = map(int, input().split())\r\n for i in range(l, r+1):\r\n if times[i] > t:\r\n times[i] = t\r\n profits[i] = c\r\n\r\nprint(sum(profits))", "m, n = map(int, input().split())\n\np = [(1001, 0, 0)] * m\n\nfor i in range(n):\n\n l, r, t, c = map(int, input().split())\n\n p[l - 1: r] = [min((x, y, z), (t, i, - c)) for x, y, z in p[l - 1: r]]\n\nprint(- sum(z for x, y, z in p))\n\n\n\n# Made By Mostafa_Khaled", "def s():\n di = dict()\n def ad(x):\n if x in di:\n di[x] += 1\n else:\n di[x] = 1\n def de(x):\n di[x] -= 1\n if di[x] == 0:\n del di[x]\n [n,m] = list(map(int,input().split()))\n a = []\n for i in range(m):\n [l,r,t,c] = list(map(int,input().split()))\n a.append(((l,-1),(t,i,c)))\n a.append(((r,1),(t,i,c)))\n a.append(((n+1,0),(0,0,0)))\n a.sort()\n ad((1001,0,0))\n p = 0\n i = 0\n res = 0\n while a[i][0][0] <= n:\n cur = a[i][0][0]-1\n res += (cur-p)*min(di)[2]\n p = cur\n cur += 1\n while a[i][0][1] == -1 and a[i][0][0] == cur:\n ad(a[i][1])\n i += 1\n res += (cur-p)*min(di)[2]\n while a[i][0][1] == 1 and a[i][0][0] == cur:\n de(a[i][1])\n i += 1\n p = cur\n print(res)\ns()\n", "n , m = map(int, input().split())\r\nl = list()\r\nr =list()\r\nt =list()\r\nc =list()\r\nfor i in range(m):\r\n (L, R, T, C) = map(int, input().split())\r\n l.append(L)\r\n r.append(R)\r\n t.append(T)\r\n c.append(C)\r\nprofit = 0\r\nfor i in range(1, n+1):\r\n tt = list()\r\n cc =list()\r\n for j in range(m):\r\n if (i>=l[j] and i<=r[j]):\r\n tt.append(t[j])\r\n cc.append(c[j])\r\n if(len(tt) == 0):\r\n profit += 0\r\n else:\r\n index = tt.index(min(tt))\r\n profit += cc[index]\r\nprint(profit)\r\n\r\n", "n, m = map(int, input().split(' '))\r\n \r\nM = [(10**9, 0)] * (n + 1)\r\n \r\nfor _ in range(m):\r\n l, r, t, c = map(int, input().split(' '))\r\n for i in range(l, r + 1):\r\n if M[i][0] > t:\r\n M[i] = (t, c)\r\n \r\nprint(sum(c for _, c in M))\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = [(-1, 1e5)]*n\r\n\r\np = []\r\nfor i in range(m):\r\n l, r, t, c = map(int, input().split())\r\n p.append(c)\r\n for j in range(l-1, r):\r\n if t < d[j][1]:\r\n d[j] = (i, t)\r\n\r\nc = 0\r\nfor i in range(n):\r\n if d[i][0] != -1:\r\n c += p[d[i][0]]\r\nprint(c)\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\nfrom collections import defaultdict\r\n\r\nn,m = M()\r\nd = defaultdict()\r\n# d[j] = [price,time]\r\nfor i in range(m):\r\n l,r,t,c = M()\r\n for j in range(l,r+1):\r\n if j in d:\r\n if d[j][1]>t:\r\n d[j] = [c,t]\r\n else:\r\n d[j]=[c,t]\r\n\r\nans = 0\r\nfor i in d:\r\n ans+= d[i][0]\r\n\r\nprint(ans)\r\n " ]

[ "a = input()\r\np=[]\r\nfor i in a:\r\n if(i.isalpha()==True):\r\n p.append(i)\r\ns=list(set(p))\r\nprint(len(s))", "s = input()\r\n\r\nif len(s) == 2:\r\n print(0)\r\nelse:\r\n print(len(set(s[1:-1].split(', '))))\r\n", "s = input()\r\nprint(len(set(s.lstrip(\"{\").rstrip(\"}\").split(\", \"))) if s != \"{}\" else 0)\r\n", "input_string = input()\r\n\r\ndistinct_l = set()\r\n\r\nfor char in input_string[1:-1]:\r\n if char.isalpha(): \r\n distinct_l.add(char)\r\nprint(len(distinct_l))", "s = input()\r\nif len(s) == 2:\r\n print('0')\r\nelse:\r\n letter = s[1:-1].split(\", \")\r\n distinct = set(letter)\r\n print(len(distinct))\r\n", "s = input()\r\ns = s.replace(\"{\",'').replace('}','').replace(',','')\r\ns2 = \"\"\r\nfor i in s:\r\n s2+=i\r\ns2 = list(s2.replace(' ',''))\r\nprint(len(set(s2)))\r\n", "xx=input()\r\nxw=xx.replace(\" \",\"\")\r\nppp=xw.replace(\"{\",\"\")\r\nppx=ppp.replace(\"}\",\"\")\r\npxx=ppx.replace(\",\",\"\")\r\npp=set(pxx)\r\n\r\nww=len(pp)\r\nprint(ww)", "input_str = input() \r\ninput_str = input_str[1:-1] \r\n\r\nif input_str: \r\n letters = input_str.split(\", \") \r\n distinct_letters = set(letters) \r\n count = len(distinct_letters) \r\nelse:\r\n count = 0 \r\nprint(count) ", "a=input()\r\na=list(map(str,a))\r\nif len(set(a))==2:\r\n print(0)\r\nelif len(set(a))==3:\r\n print(1)\r\nelse:\r\n \r\n print(len(set(a))-4)\r\n", "list = input()\r\nlist1 = \"\".join(c for c in list if c.isalpha())\r\nset = set(list1)\r\nprint(len(set))", "a=(input(\"\"))\r\na.translate(\"{\")\r\na.translate(\"}\")\r\ngazly=[]\r\nwazly=a.translate( { ord(i): None for i in '{}, '} )\r\n\r\nfor x in wazly:\r\n if x in gazly:\r\n continue\r\n else:\r\n gazly.append(x)\r\nprint(len(gazly))", "s=input()\r\nif s==\"{}\":\r\n print(0)\r\nelse:\r\n s=s[1:-1].split(\", \")\r\n s=set(s)\r\n print(len(s))\r\n", "x=input()+', '\r\nprint(len(set(x))-4)", "n = input()\r\ndistinct_characters = set()\r\n\r\nfor char in n:\r\n if char.isalnum(): # You can adjust this condition to match your requirements\r\n distinct_characters.add(char)\r\n\r\ncount = len(distinct_characters)\r\nprint(count)", "input_str = input().strip()[1:-1]\r\nif input_str:\r\n letters = input_str.split(\", \")\r\n distinct_letters = set(letters)\r\n num_distinct_letters = len(distinct_letters)\r\nelse:\r\n num_distinct_letters = 0 \r\n\r\nprint(num_distinct_letters)\r\n", "s=input()\r\ns=s[1:-1]\r\nif not s:\r\n count=0\r\nelse:\r\n s_l=s.split(\", \")\r\n count=len(set(s_l))\r\nprint(count)", "def countDistinctLetters(s):\r\n s = s[1:-1]\r\n s = s.replace(\" \", \"\")\r\n\r\n if len(s) == 0:\r\n return 0\r\n\r\n letters = s.split(\",\")\r\n\r\n distinct_letters = set()\r\n\r\n for letter in letters:\r\n distinct_letters.add(letter)\r\n\r\n return len(distinct_letters)\r\n\r\nletters_set = input()\r\n\r\ndistinct_count = countDistinctLetters(letters_set)\r\n\r\nprint(distinct_count)\r\n", "n = (set(input()))\r\nif ' ' in n :\r\n n.remove(' ')\r\nif ',' in n :\r\n n.remove(',')\r\nn.remove('{')\r\nn.remove('}')\r\n\r\nprint(len(n))\r\n", "a = input().replace(', ', '')\r\n\r\nb = []\r\nfor i in a:\r\n b.append(i)\r\n \r\nb.pop(0)\r\nb.pop(-1)\r\nn = []\r\n\r\nfor i in b:\r\n if i not in n:\r\n n.append(i)\r\n \r\nprint(len(n))", "# // Problem: A. Anton and Letters\r\n# // Contest: Codeforces - Codeforces Round 253 (Div. 2)\r\n# // URL: https://codeforces.com/problemset/problem/443/A\r\n# // Memory Limit: 256 MB\r\n# // Time Limit: 2000 ms\r\n# // Author: Anisphia (EuphyChanDaisuki)\r\n# // \r\n# // Powered by CP Editor (https://cpeditor.org)\r\n# \r\n\r\ninp = input()\r\n\r\n\r\nelements = inp.replace('{', '').replace('}', '').replace(' ', '').split(',')\r\n\r\n\r\nmy_set = set(elements)\r\nmy_set.discard('')\r\n\r\nprint(len(my_set))\r\n\r\n\r\n\r\n\r\n", "a = input()\r\ns = []\r\nt = 0\r\na = a[1:-1].split(\", \")\r\nfor i in range(len(a)):\r\n if a[i] != \"\":\r\n if a[i] not in s:\r\n s.append(a[i])\r\n t += 1\r\nprint(t)", "# Read the input line\r\nline = input()\r\n\r\n# Remove the opening and closing brackets\r\nline = line[1:-1]\r\n\r\n# Split the line into individual letters\r\nletters = line.split(\", \")\r\n\r\n# Remove leading/trailing whitespace from each letter\r\nletters = [letter.strip() for letter in letters]\r\n\r\n# Convert the list to a set to remove duplicates\r\ndistinct_letters = set(letters)\r\n\r\n# Get the number of distinct letters\r\nnum_distinct = len(distinct_letters)\r\n\r\n# If the set is empty, set the number of distinct letters to 0\r\nif num_distinct == 1 and list(distinct_letters)[0] == '':\r\n num_distinct = 0\r\n\r\n# Print the result\r\nprint(num_distinct)\r\n", "n=input()\r\nl=[]\r\nfor i in n:\r\n if (ord(i)>=65 and ord(i)<=90) or (ord(i)>=97 and ord(i)<=122):\r\n l+=i\r\nprint(len(set(l)))", "s=input()\r\ns=s[1:len(s)-1]\r\ns=s.replace(\",\",\"\",len(s))\r\ns=s.split()\r\nprint(len(set(s)))\r\n", "n=input()\r\nl=[]\r\nfor i in n:\r\n if i!='{' and i!='}' and i!=',' and i!=\" \":\r\n l.append(i)\r\nprint(len(set(l)))", "s = input() \n\nalist = list(s[1: len(s) - 1].split(','))\n\nalist[0] = \" \" + alist[0]\n\nif s == \"{}\": \n print(0)\nelse: \n print(len(set(alist)))", "n=input()\r\nn=list(n)\r\nn.sort()\r\nc=0\r\nfor i in range(len(n)):\r\n if (n[i]!=\"{\" and n[i]!=\"}\" and n[i]!=\",\" and n[i]!=\" \"):\r\n if n[i]!=n[i+1]:\r\n c+=1\r\nprint(c)", "s=input()\r\nres = set()\r\nfor i in s :\r\n if i.isalpha():\r\n res.add(i)\r\nprint(len(res))", "a = input().strip('{').strip('}').replace(',', '').split()\nc = 0\nb = []\nfor elem in a:\n if elem not in b:\n c += 1\n b.append(elem)\nprint(c)", "x = input()\r\nx=set(x)\r\nif ' ' not in x:\r\n print(len(x)-2)\r\nelse:\r\n print(len(x)-4)", "# cook your dish here\r\ns = input()\r\nse = set()\r\nfor i in range(len(s)):\r\n if s[i].isalpha():\r\n se.add(s[i])\r\n\r\nprint(len(se))", "a = list(input())\r\ndel a[0]\r\ndel a[-1]\r\nif ',' in a:\r\n\ta = ''.join(a).split(', ')\r\n\tprint(len(set(a)))\r\nelse:\r\n\tprint(len(a))", "a=input()\r\nw=''\r\nfor i in range(1,len(a)-1):\r\n if a[i] in w or a[i]==' ' or a[i]==',':\r\n i=i\r\n else:\r\n w=w+a[i]\r\nprint(len(w))", "ch = input()\r\ns = set()\r\nfor i in ch:\r\n if i.isalpha(): s.update(i)\r\nprint(len(s))", "str=input()\r\nlst=[]\r\nfor i in str:\r\n if i>='a' and i<='z':\r\n lst.append(i)\r\nSet=set(lst)\r\n\r\nprint(len(Set))", "string = input()\r\nstring = list(string)\r\n\r\n\r\n# Removes characters that are not letters from the list.\r\nn = 0\r\ngoAhead = True\r\nwhile(goAhead):\r\n value = string[n]\r\n \r\n if value == \" \" or value ==\"{\" or value == \"}\" or value == \",\":\r\n del string[n]\r\n else:\r\n n += 1\r\n \r\n if n >= len(string):\r\n n = 0\r\n goAhead = False\r\n \r\n\r\n# Sorts list in alpha order. \r\nstring.sort()\r\n\r\n# Removes duplicate letters from list\r\ngoAhead = True\r\nwhile(goAhead):\r\n\r\n # In situations where we have 0 letters in list, output 0.\r\n if len(string) == 0:\r\n output = 0\r\n break\r\n \r\n # In situations where we have 1 letter in list, output 1.\r\n if len(string) == 1:\r\n output = 1\r\n break\r\n \r\n # In situations where we have multiple letters in list, remove duplicate letters.\r\n if string[n] == string[n+1]:\r\n del string[n+1]\r\n \r\n else:\r\n n += 1\r\n \r\n if n+1 >= len(string):\r\n output = len(string)\r\n n = 0\r\n goAhead = False\r\n\r\n\r\nprint(output)\r\n\r\n ", "n = input()\r\nn = n.lstrip(\"{\")\r\nn = n.rstrip(\"}\")\r\nn = n.split(\", \")\r\n \r\ns = 0\r\nl = []\r\nfor i in n:\r\n if i not in l and i:\r\n \r\n \r\n l.append(i)\r\n s+=1\r\n else:\r\n continue\r\nprint(s)", "x=input()\r\nx=x.replace(\"{\",\"\")\r\nx=x.replace(\"}\",\"\")\r\nx=x.replace(\",\",\"\")\r\nx=x.replace(\" \",\"\")\r\nwords=set([i for i in x])\r\nprint(len(words))\r\n", "l = input().strip('{}')\r\nans = 0\r\nfor i in list(set(l)):\r\n if i.isalpha():\r\n ans+=1\r\nprint(ans)", "temp=\"abcdefghijklmnopqrstuvwxyz\"\n\ns=input()\n\nstr=\"\"\n\nfor i in range(len(s)):\n if s[i] in temp and s[i] not in str:\n str+=s[i]\n\nprint(len(str))\n \n\n\n \t\t\t\t \t \t\t \t\t\t \t\t\t \t\t \t \t", "s = input().strip('{}')\r\nset_s = set(s.split(', '))\r\nif(len(s)):\r\n print(len(set_s))\r\nelse:\r\n print(0)", "x=input() \r\nC=len(set(x)) \r\nif C==2: print(0) \r\nelif C==3: print(1) \r\nelse:print(C-4)", "s = input()\r\nse = set()\r\nfor i in range(len(s)):\r\n if s[i]!='{' and s[i]!='}' and s[i]!=',' and s[i]!=' ':\r\n se.add(s[i])\r\nprint(len(se))", "s = set(input()[1:-1].split(\", \"))\r\nif s == {''}:\r\n print(0)\r\nelse:\r\n print(len(s))", "import math\r\na = input()[1:-1].split(', ')\r\nif a[0] is '': print(0)\r\nelse: print(len(set(a)))\r\n\r\n\r\n", "s = input()\r\ns = s[1:-1]\r\nif not s:\r\n print(\"0\")\r\nelse:\r\n lis = s.split(\", \")\r\n ans = set()\r\n for i in lis:\r\n ans.add(i)\r\n print(len(ans))", "Str=input()\r\nAlp=\"abcdefghijklmnopqrstuvwxyz\"\r\nAns=\"\"\r\nfor i in Str:\r\n\tif i in Alp and i not in Ans:\r\n\t\tAns+=i\r\nprint(len(Ans))", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, OCaml, 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'''\nt=list(set(input()))\nc=0\nfor i in t:\n if i != '{' and i != ' ' and i != '}' and i != ',':\n c+=1\nprint(c) ", "string = input().replace(\"{\",\"\").replace(\"}\", \"\").replace(\",\",\"\").replace(\" \", \"\")\r\n\r\ndistinct_letters = len(set(string))\r\n\r\nprint(distinct_letters)\r\n\r\n", "a=str(input())\r\nk=1\r\nh=[]\r\nl=[]\r\nfor k in range (len (a)) :\r\n if a[k]!=',' and a[k]!='{' and a[k]!='}' and a[k]!=' ' :\r\n h.append(a[k])\r\nfor g in h :\r\n if g not in l : \r\n l.append(g)\r\nprint(len(l))", "def Anton_Letters(set_of_letters):\r\n list_of_letters = [char.strip() for char in set_of_letters[1:-1].split(',') if char.strip()]\r\n\r\n list_of_distinct_letters = list()\r\n for i in list_of_letters:\r\n if i not in list_of_distinct_letters :\r\n list_of_distinct_letters.append(i)\r\n\r\n return len(list_of_distinct_letters)\r\nif __name__ == \"__main__\" :\r\n set_of_letters = input()\r\n print(Anton_Letters(set_of_letters))", "s=input()\r\nx=set()\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n x.add(i)\r\nprint(len(x))", "def main():\r\n s = input()\r\n news = \"\"\r\n if s == '{}':\r\n print(0)\r\n exit()\r\n for i in range(len(s)):\r\n if s[i] != '{' and s[i] != '}' and s[i] != ' ':\r\n news += s[i]\r\n news = news.split(',')\r\n print(len(set(news)))\r\nmain()", "n=input()\r\ns=list(n)\r\nb=[]\r\nfor i in range(1,len(s),3):\r\n b.append(s[i])\r\nd=list(dict.fromkeys(b))\r\nlistToStr = ''.join([str(e) for e in d]) \r\nif ((listToStr.isalpha())!=True):\r\n print(0)\r\nelse:\r\n print(len(d))\r\n ", "s = input()[1:]\r\nif s == \"}\":\r\n print(0)\r\n quit()\r\ns = s[:-1]\r\narr = list(s.split(\", \"))\r\nprint(len(set(arr)))\r\n", "input_string = input() \r\n\r\ndistinct_letters = set() \r\n\r\nfor i in range(1, len(input_string) - 1):\r\n if input_string[i].isalpha():\r\n distinct_letters.add(input_string[i])\r\n\r\nprint(len(distinct_letters)) \r\n", "w = input()\r\n\r\nst = w[1:-1]\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nnew_s = \"\"\r\nfor i in st:\r\n if i in alpha and i not in new_s:\r\n new_s += i\r\n \r\nprint(len(new_s))", "q = input()\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\nprint(len(set([i for i in q if i in a])))", "def main():\n p = input()\n if(p==\"{}\"):\n print(0)\n else:\n p = p.split(\",\")\n p[0] = p[0][1:]\n p[len(p)-1] = p[len(p)-1][:-1]\n p = [i.strip() for i in p]\n print(len(set(p)))\n\n \nif __name__ == '__main__':\n main()\n", "import sys\r\n#file=open(\"C:/Users/MAHAMUD MATIN/Desktop/input.txt\", \"r\").readlines()\r\nfile=sys.stdin.readlines()\r\n#s=\"\".join(sys.stdin.readlines())\r\n#l=list(map(str, f[0]))\r\ns=file[0]\r\ns1=s[1:len(s)-2].replace(\",\", \"\").replace(\" \",\"\")\r\ns1=list(set(s1))\r\nprint(len(s1))", "n=(input())\r\nn = n.replace(\", \",\"\")\r\nn = n.replace(\"{\", \"\")\r\nn = n.replace(\"}\", \"\")\r\nprint(len(set(n)))", "s = str(input())\r\ns = s.replace('{', '')\r\ns = s.replace('}', '')\r\ns = s.replace(',', '')\r\ns = s.replace(' ', '')\r\na = set(str(x) for x in s)\r\nprint(len(a))", "l=input()\r\ns=set()\r\nfor i in l :\r\n if i in 'zxcvbnmlkjhgfdsaqwertyuiop':\r\n s.add(i)\r\nprint(len(s))", "n = set((str(input())[1:-1]).split(', '))\r\nif n != {''}:\r\n print(len(n))\r\nelse: print(0)", "u = input()\r\nif u == '{}':\r\n print(0)\r\nelse:\r\n res = len(set(u[1:-1].split(', ')))\r\n print(res)\r\n ", "new = set(input().strip('{}').split(\", \"))\nif new == {''}:\n print(0)\nelse:\n print(len(new))\n", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\ns = input()\r\ns = s.replace('{',\"\")\r\ns = s.replace('}',\"\")\r\ns = s.replace(' ',\"\")\r\ns = s.replace(',',\"\")\r\n\r\ns = set(s)\r\nprint(len(s))", "s = input()\r\ns = s.replace(\"{\", \"\").replace(\"}\", \"\").replace(\",\", \"\").replace(\" \", \"\")\r\nprint(len(set(s)))\r\n", "k = set(input()[1:-1].split(', '))\r\nprint(len(k) if k != {''} else 0)", "word = input()\r\nword = word.replace('{', '')\r\nword = word.replace('}', '')\r\nword = word.replace(',', '')\r\nword = word.replace(' ', '')\r\nans = set(word)\r\n\r\nprint(len(ans))\r\n\r\n\r\n", "s=input()\r\ns1=\"abcdefghijklmnopqrstuvwxyz\"\r\nl=[]\r\nfor i in s:\r\n if i in s1:\r\n l.append(i)\r\nl=set(l)\r\nprint(len(l))\r\n", "s=(input())\r\nif s==\"{}\":\r\n print(0)\r\nelse:\r\n s=s[1:-1]\r\n s=s.split(\",\")\r\n s[0]=\" \"+s[0]\r\n print(len(set(s)))", "input_str = input()\r\nlet = input_str[1:-1].split(\", \")\r\nif let[0] == '':\r\n count = 0\r\nelse:\r\n distinct_letters = set(let)\r\n count = len(distinct_letters)\r\nprint(count)\r\n", "a=input()[1:-1]\r\na=a.split(', ')\r\na=set(a)\r\nif a=={''}:\r\n print(0)\r\nelse:\r\n print(len(a))", "n = input()\r\nchars = set()\r\nfor i in n:\r\n if i == \"{\" or i == \"}\" or i == \" \" or i == \",\":\r\n pass\r\n else:\r\n chars.update(i)\r\nprint(len(chars))", "a = input()\r\na = a.replace(' ', '')\r\na = a.replace(',', '')\r\na = a[1:len(a) -1]\r\nprint(len(dict.fromkeys(a)))\r\n", "h=input()\r\nh=h[1:len(h)-1:]\r\ns=[]\r\ns=h.split(', ')\r\n\r\n\r\ns=list(set(s))\r\n\r\n\r\nd=0\r\n\r\na='abcdefghijklmnopqrstuvwxyz'\r\nfor i in a:\r\n if s.count(i)>0:\r\n d+=1\r\n\r\n\r\nprint(d)\r\n", "t = []\ncount = 0\nfor i in list(input()):\n if i.isalpha() and i not in t:\n t.append(i)\n count+=1\nprint(count)\n", "s = input()\r\nlst = []\r\nfor i in s:\r\n if i.isalpha() == True:\r\n lst.append(i)\r\n\r\ns1 = set(lst) \r\nprint(len(s1))", "n=set(input().lstrip(\"{\").rstrip(\"}\").split(\", \"))\r\n# print(n)\r\nif n=={\"\"}:\r\n\tprint('0')\r\nelse: \r\n\tprint(len(n))\r\n", "inp = input()\r\nif inp != '{}':\r\n print(len(set(list(map(str, inp.strip('{}').split(', '))))))\r\nelse:\r\n print(0)\r\n", "letters1 = list(input())\r\nans = 0\r\nallletters = list(\"abcdefghijklmnopqrstuvwxyz\")\r\nfor i in range(len(allletters)):\r\n if (allletters[i] in letters1) > 0:\r\n ans+=1\r\n \r\nprint(ans)", "s = input()\r\nletts = []\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i].isalpha() and s[i] not in letts:\r\n letts.append(s[i])\r\n count += 1\r\nprint(count)", "import re;\r\nword = input()\r\nmatch = re.findall(r\"\\w\", word)\r\nprint(len(set(match)))", "a = input()\r\nb = a.replace('{','')\r\nc = b.replace('}','')\r\nd = c.replace(' ','')\r\ne = d.replace(',','')\r\nl = []\r\nfor i in e:\r\n if i not in l:\r\n l.append(i)\r\nprint(len(l))", "a = input()\r\na = a.lstrip('{')\r\na = a.rstrip('}')\r\nl = a.split(', ')\r\nif l == [''] :\r\n print(0)\r\nelse:\r\n s = set(l)\r\n print(len(s))", "SET = set()\r\nchr_set = input()\r\nfor i in chr_set:\r\n if i.isalpha():\r\n SET.add(i)\r\nprint(len(SET))\r\n", "s=\"qwertyuiopasdfghjklzxcvbnm\"\r\nn=input()\r\nc=0\r\nfor i in range(26):\r\n if n.find(s[i])!=-1:\r\n c+=1\r\nprint(c)", "letter = input()\r\n# print(letter)\r\n\r\nstrs = []\r\n\r\nfor i in letter:\r\n if i not in ['{','}',',',' ']:\r\n strs.append(i)\r\n# print(strs)\r\n\r\nstrs = set(strs)\r\nprint(len(strs))", "s=input()\r\nif(len(s)==2):\r\n print(0)\r\nelse:\r\n s=s.replace(\"{\",\"\")\r\n s=s.replace(\"}\",\"\")\r\n ls=s.split(\", \")\r\n print(len(set(ls)))", "n=input()\r\nn=set(n)\r\nn.discard(\",\")\r\nn.discard(\" \")\r\nn.discard(\"{\")\r\nn.discard(\"}\")\r\n\r\nprint(len(n))\r\n", "s = input()\r\nl = s[1:-1].split(', ')\r\ncounting = {}\r\nif l[0] == '':\r\n print(0)\r\n exit()\r\nfor i in l:\r\n counting[i] = 1\r\n\r\nprint(len(counting))", "s=input()\r\nl=[]\r\nfor i in s:\r\n if (ord(i)>=97 and ord(i)<=122):\r\n l.append(i)\r\nprint(len(set(l))) ", "s = input()\n\nletters = set()\nfor char in s:\n if char.isalpha():\n letters.add(char)\n\nprint(len(letters))\n \t \t\t \t \t \t \t \t\t \t", "def Anton_and_Letters(string):\r\n letter = 'abcdefghijklmnopqrstuvwxyz'\r\n distinct_letter = []\r\n for i in string:\r\n if i in letter:\r\n if i not in distinct_letter:\r\n distinct_letter.append(i)\r\n return len(distinct_letter)\r\n \r\nstring = input()\r\nprint(Anton_and_Letters(string))", "a = list(input())\r\nb = []\r\nfor i in range(len(a)):\r\n if a[i].isalpha():\r\n b.append(a[i])\r\nprint(len(set(b)))\r\n\r\n", "input_str = input()\r\ndistinct_letters = set()\r\nfor char in input_str:\r\n if char.isalpha():\r\n distinct_letters.add(char)\r\ndistinct_count = len(distinct_letters)\r\nprint(distinct_count)", "sentence = input()[1:-1].split(\", \")\r\nsentence = sorted(sentence)\r\nnum = 1\r\nfor i in range(len(sentence)-1):\r\n if sentence[i] != sentence[i+1]:\r\n num += 1\r\nif sentence == ['']:\r\n num = 0\r\nprint(num)\r\n", "# Read the input\r\nletters_set = input()\r\n\r\n# Extract the letters from the set\r\nletters = letters_set[1:-1].split(\", \")\r\n\r\n# Count the number of distinct letters\r\ndistinct_letters = len(set(letters)) if letters != [''] else 0\r\n\r\n# Print the result\r\nprint(distinct_letters)\r\n", "input_line = input().strip()\r\nif input_line == \"{}\":\r\n print(0)\r\nelse:\r\n input_line = input_line[1:-1]\r\n letters = input_line.split(\", \")\r\n distinct_letters = set()\r\n for letter in letters:\r\n distinct_letters.add(letter)\r\n print(len(distinct_letters))\r\n", "n = input()\r\nal='abcdefghijklmnopqrstuvwxyz'\r\nc=[]\r\nfor i in n:\r\n if i in al:\r\n c.append(i)\r\nc=set(c)\r\nprint(len(c))", "s = input()\r\nif s != '{}':\r\n print(len(set(s[1:-1].split(', '))))\r\nelse:\r\n print(0)", "s = set(input().replace(\"{\", \"\").replace(\"}\", \"\").replace(\",\", \"\").replace(\" \", \" \").strip())\r\ns.discard(\" \")\r\nprint(len(s))", "a='abcdefghijklmnopqrstuvwxyz'\r\na1=''\r\nfor i in input():\r\n if i in a: a1+=i\r\nprint(len(set(a1)))", "set=set()\ns=input()\n\nfor i in s:\n if i !=\" \" and i !=\"{\" and i!=\"}\" and i!=\",\":\n set.add(i)\n\nprint(len(set))\n \t \t \t\t\t \t \t", "s1 = input()\r\nb = set()\r\nfor char in s1:\r\n if char.islower():\r\n b.add(char)\r\nprint(len(b))", "n =input()\r\nn=n[1:-1]\r\nn=n.replace(\",\",\" \")\r\nn=n.split()\r\na=set()\r\na.update(n)\r\nprint(len(a))", "# Read the input set as a string\r\ns = input()\r\n\r\n# Remove the opening and closing brackets\r\ns = s[1:-1]\r\n\r\n# Check if the string is empty, which means the set is empty, and the output should be 0\r\nif not s:\r\n print(0)\r\nelse:\r\n # Split the string into individual letters using \", \" as the separator\r\n letters = s.split(\", \")\r\n\r\n # Get the number of distinct letters in the set and print the result\r\n print(len(set(letters)))\r\n", "s = input()[1:-1:].split(\", \")\r\n\r\nprint(len(set(s))if not s[0]==\"\" else 0)\r\n", "import sys\r\ns = input()\r\nif len(s) == 2:\r\n print(0)\r\n sys.exit()\r\ns = s[1:-1]\r\ns = len(set(s.split(', ')))\r\nprint(s)\r\n", "a=input()\r\nb=set()\r\nfor i in \"abcdefghijklmnopqrstuvwxyz\":\r\n if i in a:\r\n b.add(i)\r\nprint(len(b))\r\n \r\n\r\n", "line = input()\r\nline = line.replace(\"{\", \"\").replace(\"}\", \"\").replace(\",\", \"\").replace(\" \", \"\")\r\nprint(len(set(line)))", "def count_distinct_letters(s):\r\n letters = set(s[1:-1].replace(', ', ''))\r\n return len(letters)\r\n\r\n\r\ninput_set = input()\r\n\r\n\r\nresult = count_distinct_letters(input_set)\r\nprint(result)\r\n", "a = 'abcdefghijklmnopqrstuvwxyz'\r\nk = input()\r\nn = len(k)\r\nk = [letter for letter in k]\r\nk.pop(0)\r\nk.pop(n-2)\r\np = [letter if letter in a else None for letter in k]\r\nx = len(list(set(p)))-1\r\nif x > 0:\r\n print(x)\r\nelif(len(p) == 1):\r\n print(1)\r\nelse:\r\n print(0)\r\n#print(p)", "s=input()\r\nr=s.strip(\"{}\")\r\nres=r.replace(',','')\r\nres=res.replace(' ','')\r\nans=set(res)\r\nl=len(ans)\r\nprint(l)", "a = input()\r\nq = []\r\nq.extend(a)\r\ndel q[0]\r\ndel q[-1]\r\na = ''.join(q).split(', ')\r\na = ''.join(a)\r\nprint (len(set(a)))", "inp=input()\r\ni=0\r\nli=[\"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\nfor item in li:\r\n if item in inp:\r\n i+=1\r\nprint(i)\r\n", "a,s=str(input()),set()\r\nfor i in a:\r\n if i.isalpha():\r\n s.add(i)\r\nprint(len(s))", "n=input()\r\nn=n.strip(',')\r\na=list(n)\r\na.sort()\r\nd=0\r\nfor i in range(len(a)):\r\n if(a[i]!='{' and a[i]!='}' and a[i]!=' ' and a[i]!=','):\r\n if(a[i]!=a[i+1]):\r\n d+=1\r\nprint(d)", "x=input()\r\ny=[chr(i) for i in range(97,123)]\r\nz=[x[i] for i in range(len(x)) if x[i] in y]\r\nprint(len(set(z)))", "x = input()\r\nl =[]\r\nif len (x) <= 2:\r\n print(0)\r\nelse: \r\n for i in range(1,len(x),3):\r\n l.append(x[i])\r\n print(len(set(l)))", "s=list(input().strip())\r\nk=[]\r\nfor i in s:\r\n if(i.isalpha()):\r\n k.append(i)\r\nprint(len(set(k)))", "str=input()\r\nlst=list(str)\r\nif len(lst)==2:\r\n print(0)\r\nelif len(lst)==3:\r\n print(1)\r\nelse:\r\n lst.remove('{')\r\n lst.remove('}')\r\n lst=set(lst)\r\n lst.remove(',')\r\n lst.remove(' ')\r\n print(len(lst))", "if __name__ == \"__main__\":\r\n letters = input()\r\n if len(letters) == 2:\r\n print(0)\r\n else:\r\n print(len(set(letters[1:-1].split(\", \"))))", "b=input()\r\nc=[]\r\nfor i in range(len(b)):\r\n if b[i] != \" \" and b[i] != \"{\" and b[i]!=\"}\" and b[i] !=\",\":\r\n c.append(b[i])\r\nprint(len(set(c)))\r\n# for i in range(len(d)):\r\n# if i<len(d)-1:\r\n# print(int(d[i])+int(d[i+1]))\r\n", "input_str = input().strip()\nunique_chars = set()\n\nfor char in input_str:\n if char.isalpha() and char.islower():\n unique_chars.add(char)\n\nprint(len(unique_chars))\n\n \t \t\t\t \t \t\t \t\t\t\t\t \t\t\t \t", "x = input()\nv = []\nfor ch in x :\n if ch.isalpha() and ch not in v :\n v.append(ch)\nprint(len(v))\n\t\t\t\t\t\t \t \t \t \t \t \t\t \t \t \t", "import re\r\nl = set(re.sub(r'[{},]', '', input()).split())\r\nprint(len(l))", "s=input()\r\ns=s[1:-1]\r\na=[]\r\nfor i in s:\r\n if i!=\" \" and i!=',':\r\n a.append(i)\r\nprint(len(set(a)))", "a = set(str(input()))\r\na.discard(\",\")\r\na.discard(\"{\")\r\na.discard(\"}\")\r\na.discard(\" \")\r\nprint(len(a))", "s=input()\r\ns=list(s)\r\ns.pop(0)\r\ns.pop(len(s)-1)\r\ns=set(s)-{' '}-{','}\r\nprint(len(set(s)))\r\n", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\n\r\ns=input()\r\nS=set()\r\nfor i in range(len(s)):\r\n if s[i] not in '{} ,':\r\n S.add(s[i])\r\nprint(len(S))", "s = input()\ns = str(s)\nsmall = \"abcdefghijklmnopqrstuvwxyz\"\nc = 0\nfor i in range (26):\n if s.find(small[i]) != -1 :\n c +=1\nprint(c)\n\t \t\t \t\t\t \t \t \t\t\t\t \t\t", "import re\r\n\r\ndef antons_letters(letters):\r\n\treturn len(set(letters))\r\n\r\nprint(antons_letters(re.findall(r'\\w',input())))", "a=input();print(len(set(a.strip('{}').split(', '))) if a!='{}' else 0)", "s = input()\r\narr = [0] * 26\r\nfor c in s:\r\n if c >= 'a' and c <= 'z':\r\n index = ord(c) - ord('a')\r\n arr[index] += 1\r\ntotal = 0\r\nfor n in arr:\r\n if n > 0:\r\n total += 1\r\nprint(total)", "import sys\r\n\r\ns = sys.stdin.readline()\r\ns = s[1:-2]\r\n\r\nelements = s.split(', ')\r\nelements_length = len(elements)\r\n\r\nif elements.__contains__(''):\r\n print(0)\r\nelse:\r\n print(len(set(elements)))", "print(len(set(input()) - set(\"{, }\")))\r\n", "n = input()\r\nchar = []\r\nfor v in n:\r\n if \"a\" <= v <= \"z\":\r\n char.append(v)\r\nprint(len(list(set(char))))", "s = input()\r\na = set()\r\nfor char in s:\r\n if char.islower():\r\n a.add(char)\r\nprint(len(a))", "# https://codeforces.com/problemset/problem/443/A\r\n\r\nword = input()[1:-1]\r\nif len(word) == 0:\r\n print(0)\r\nelse:\r\n print(len(set([e.strip() for e in word.split(',')])))\r\n", "s = input()\nr = 0\nfor i in range(len(s)):\n if \"a\" <= s[i] <= \"z\":\n r += 1\n s = s.replace(s[i], '.')\nprint(r)\n \t\t \t \t \t\t \t\t \t\t \t \t", "s = input()\r\nif s=='{}':\r\n print(0)\r\nelse:\r\n s_=list(s[1:-1].split(\", \"))\r\n print(len(set(s_)))\r\n ", "def solve() :\r\n s = input()\r\n s = s.replace('{', '').replace('}', '').replace(', ', '')\r\n print(len(set(s)))\r\n\r\nsolve()\r\n", "print(len(set([i for i in input() if i.isalpha()])))", "a = input()\r\nprint(len(list(set(''.join(i.split()) for i in a[1:-1].split(',')))) if a != '{}' else 0)\r\n\r\n", "p=input()\r\na=\"qwertyuioplkjhgfdsazxcvbnm\"\r\nm=\"\"\r\nfor i in p :\r\n if i in a and i not in m :\r\n m+=i\r\nprint(len(m))\r\n \r\n", "a = set(input()[1:-1].split(', '))\r\nprint(len(a) - int(a.pop() == ''))\r\n", "import sys\r\na = str(input())\r\n\r\nif a == \"{}\":\r\n print(\"0\")\r\n sys.exit()\r\nelse: \r\n b = a[1:-1].split(\", \")\r\n c = set(b)\r\n e = len(c)\r\n print(e)", "inpSet = input()\r\n\r\nalpList = []\r\ndistinctCount = 0\r\n\r\nfor char in inpSet :\r\n \r\n if char > '`' and char < '{' and char not in alpList :\r\n alpList.append(char)\r\n distinctCount += 1\r\n\r\nprint(distinctCount)\r\n", "Str = input()\nStr2=set(Str)\nnum=0\nfor i in Str2:\n if(i.isalpha()):\n num = num + 1\nprint(num)\n\n\t \t\t \t\t\t \t \t\t \t \t \t\t\t \t\t\t", "a = input()\r\na = a[1: len(a) - 1].split(', ')\r\nb = ''\r\nfor i in range(len(a)):\r\n if a[i] not in b:\r\n b += a[i]\r\nprint(len(b))", "letter=input()\r\nletter=letter[1:-1]\r\nflag=True\r\nif len(letter)==0:\r\n flag=False\r\n print(0)\r\nelif len(letter)==1:\r\n flag=False\r\n print(1)\r\nelif flag:\r\n character=letter.split(\", \")\r\n distinct=[]\r\n for char in character:\r\n if char not in distinct:\r\n distinct.append(char)\r\n print(len(distinct))", "s = str(input())\r\n\r\ns = s.strip(\"{\").strip(\"}\").replace(\",\", \"\").replace(\" \", \"\")\r\n\r\ns = list(s)\r\ndistinct = [ ]\r\n\r\ncount = 0\r\n\r\nfor i in s:\r\n \r\n if i not in distinct:\r\n distinct.append(i)\r\n count += 1\r\n \r\nprint(count)\r\n\r\n", "s = input()\nst = set()\nfor i in range(0 , len(s)):\n if(s[i] !='{' and s[i] != '}' and s[i] != ',' and s[i] != ' '):\n st.add(s[i])\nprint(len(st))\n\t \t \t \t \t\t \t \t \t \t \t", "import re\r\ninp = set(re.sub(r'[ ,]' , '' , input()[1:-1].replace(',', '')))\r\nprint(len(inp))", "s = input()\ns = s.replace(\"{\", \"\").replace(\"}\", \"\").replace(\" \", \"\")\ns = s.split(\",\")\nif(len(set(s))==1 and s[0]==''):\n print(0)\nelse:\n print(len(set(s)))\n\n\n \t\t\t\t \t \t\t\t\t \t \t\t\t \t\t\t \t \t", "s = input()\r\ns= s[1: -1].replace(',','')\r\nresult= set(s.split())\r\nprint(len(result))", "s = input().strip()\ns = s[1:-1] # remove the brackets\nif s:\n s = s.split(', ')\n print(len(set(s))) # print the number of distinct letters\nelse:\n print(0) # if the set is empty, print 0\n\n\n \t\t \t \t \t\t\t \t \t\t\t \t \t\t \t", "s = input()\r\nl = []\r\n\r\nfor c in s:\r\n if c not in l and c.islower():\r\n l.append(c)\r\n\r\nprint(len(l))", "inputString = input();\n\nuniqueChars = set()\n\nfor char in inputString:\n\tif ord(char) >= 97 and ord(char) <= 122:\n\t\tuniqueChars.add(char)\n\nprint(len(uniqueChars))\n\t\t\n", "def main():\n s = input()[1:-1].split(',')\n s = [el.strip() for el in s if el != '']\n print(len(set(s)))\n\nif __name__ == '__main__':\n main()", "n=list(input())\r\nx=[]\r\ncount=0\r\nfor i in set(n):\r\n if i.isalpha():\r\n count+=1\r\n x.append(i)\r\nprint(count)", "from collections import Counter\r\nimport math\r\nimport re\r\ns = input()\r\ns = s[1:- 1]\r\nif len(s) == 0:\r\n print(0)\r\nelse:\r\n print(len(set(s.replace(' ','').split(','))))", "# your code goes here\r\ndef main():\r\n s = input().strip()\r\n a = set()\r\n for char in s:\r\n if 'a' <= char <= 'z':\r\n a.add(char)\r\n print(len(a))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "letters = input()\r\n# Remove the opening and closing brackets\r\nletters = letters[1:-1]\r\ndistinct_letters = set()\r\n\r\nfor char in letters:\r\n if char.isalpha():\r\n distinct_letters.add(char)\r\n\r\nprint(len(distinct_letters))\r\n", "print(len(set([x for x in input() if x.isalpha()])))\n\n", "primarySet = input()\r\nl = [*primarySet]\r\nnewl = set()\r\nfor i in l:\r\n if i.isalpha():\r\n newl.add(i)\r\nprint(len(newl))", "setx=input(\"\")\r\nsetlen=len(setx)\r\nsetx=setx.replace(',','').replace('{','').replace('}','').replace(' ','')\r\n\r\nsetx=set(setx)\r\nleng=len(setx)\r\n\r\nprint(leng)", "s = input()\r\n\r\ns = s.strip('}{')\r\n\r\ns = s.replace(' ', '')\r\ns = s.replace(',', '')\r\n\r\n\r\nprint(len(set(s)))", "n = input()[1:-1]\r\nif len(n) == 0 : \r\n print(0)\r\nelse : \r\n print(len(set(n.split(', ')))) ", "n=input()\r\nif n=='{}':\r\n print(0)\r\nelse:\r\n k=n[1:len(n)-1].split(', ')\r\n se=set(k)\r\n print(len(se))", "if __name__ == \"__main__\":\r\n s = input()\r\n a = set()\r\n for ch in s:\r\n if 'a' <= ch <= 'z':\r\n a.add(ch)\r\n print(len(a))\r\n", "s = input()\r\nl = []\r\nfor i in s:\r\n i = ord(i)\r\n if 97 <= i <= 122 or 65 <= i <= 90:\r\n l.append(chr(i))\r\nprint(len(set(l)))", "import string\r\nb=string.ascii_lowercase\r\na=input()\r\ns=set()\r\nfor i in a:\r\n if i in b:\r\n s.add(i)\r\ns=list(s)\r\nif s==[]:\r\n print(0)\r\nelse:\r\n print(s.index(s[-1])+1)", "x = input()\n\ny = list()\nfor i in x:\n if(i >= 'a' and i <= 'z' ):\n if(i not in y):\n y.append(i)\n\nprint(len(y))\n\t\t\t\t \t\t \t\t \t\t\t \t \t\t \t", "q=input().strip()[1:-1]\r\ns=set()\r\nfor i in q:\r\n if i!=',' and i!=' ':\r\n s.add(i)\r\nprint(len(s))", "x = input()\n\nx = x.replace('{', '')\nx = x.replace('}', '')\nif x == '':\n print(0)\nelse:\n x = set(x.split(', '))\n print(len(x))\n", "n = input()\nsec =set()\nfor i in range(len(n)):\n if n[i] != '{' and n[i] != '}' and n[i] != ',' and n[i] != ' ' :\n sec.add(n[i])\nprint(len(sec))\n \t \t \t\t \t\t\t \t\t \t \t \t \t \t\t", "text = input()\r\ntext = text.strip(\"{}\")\r\n\r\nif len(text) > 0:\r\n txt_lst = list(text.split(\", \"))\r\n txt_set = set(txt_lst)\r\n print(len(txt_set))\r\nelse:\r\n print(\"0\")\r\n", "s=input()\r\nst=set()\r\nfor S in s:\r\n if(S>='a' and S<='z'):\r\n st.add(S)\r\nprint(len(st))", "s = input()\r\ns = s[1:len(s)-1]\r\nalph = []\r\nfor i in range(len(s)):\r\n if s[i] != \" \" and s[i] != \",\":\r\n alph.append(s[i])\r\nprint(len(set(alph)))", "input_set_array = input()[1:-1].replace(', ', '')\r\noutput_set = set()\r\nfor char in input_set_array:\r\n output_set.add(char)\r\nprint(len(output_set))\r\n \r\n \r\n\r\n\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 distinct_letters(letters_set):\r\n if len(letters_set) == 2:\r\n return 0\r\n letters_set = letters_set[1:-1:].split(', ')\r\n distinct = []\r\n for letter in letters_set:\r\n if letter not in distinct:\r\n distinct.append(letter)\r\n return len(distinct)\r\n\r\nprint(distinct_letters(letters_set=input()))", "ls=list(str(input()))\r\nls.remove(\"{\")\r\nls.remove(\"}\")\r\ncn=ls.count(\" \")\r\nfor i in range(cn):\r\n\tls.remove(\" \")\r\ncn=ls.count(\",\")\r\nfor i in range(cn):\r\n\tls.remove(\",\")\r\nprint(len(set(ls)))", "def main():\r\n g = input()\r\n\r\n t = [False] * 26\r\n w = 0\r\n\r\n for char in g:\r\n if 'a' <= char <= 'z' and not t[ord(char) - ord('a')]:\r\n t[ord(char) - ord('a')] = True\r\n w += 1\r\n \r\n print(w)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=input()\ns=str(s)\nsmall=\"abcdefghijklmnopqrstuvwxyz\"\nc=0\nfor i in range(26):\n if s.find(small[i]) != -1:\n c +=1\nprint(c)\n\t\t \t \t \t\t \t\t\t\t\t\t \t \t\t \t\t\t\t\t", "s = list(set(input()))\r\n\r\nif len(s) == 3:\r\n print(1)\r\nelse:\r\n s = sorted(s)[2:-2]\r\n print(len(list(set(s))))", "s=list((input().strip(',')))\r\ns.sort()\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]!='{' and s[i]!='}' and s[i]!=',' and s[i]!=' ':\r\n if s[i]!=s[i-1]:\r\n c=c+1\r\nprint(c)", "a= input()\r\na=a.strip(\"}{\")\r\na=a.split(\", \")\r\nb=[]\r\nfor i in range(len(a)):\r\n if a[i] not in b and a[i] != \"\":\r\n b.append(a[i])\r\nprint(len(b))", "s=list(input().strip())\r\nsb=[]\r\nfor j in s:\r\n if(j.isalpha()):\r\n sb.append(j)\r\nprint(len(set(sb)))", "input_line = input()\r\nif len(input_line) <=2:\r\n print(0)\r\nelse:\r\n distinct_letters = set(input_line[1:-1].replace(\" \", \"\").split(\",\"))\r\n print(len(distinct_letters))", "l = list(input().replace('{',\"\").replace('}',\"\").replace(\" \",\"\").split(','))\r\nif l[0]==\"\":\r\n print(0)\r\nelse:\r\n print(len(set(l)))", "import re\r\n\r\ns = input()\r\ntable = set()\r\nans = 0\r\nfor i in s:\r\n if re.match(\"[a-z]\", i) and i not in table:\r\n ans += 1\r\n table.add(i)\r\nprint(ans)\r\n", "n = input()\r\nt = set()\r\nfor i in n:\r\n if i == \"{\" or i == \"}\" or i ==\",\" or i == \" \":\r\n continue\r\n else:\r\n t.add(i)\r\nprint(len(t))", "\n\nline = input()[1:-1]\nif len(line) == 0:\n print(0)\n exit(0)\ns = set(line.split(', '))\nprint(len(s))", "from re import sub\r\ninp = set(sub(r'[ ,]' , '' , input()[1:-1].replace(',', '')))\r\nprint(len(inp))", "input_str = input()\r\n# Extract the part between curly braces, remove spaces and commas\r\nletters = input_str.split(\"{\")[1].split(\"}\")[0].replace(\" \", \"\").replace(\",\", \"\")\r\n\r\nunique_letters = set(letters)\r\ncount_unique_letters = len(unique_letters)\r\n\r\nprint(count_unique_letters)\r\n", "a=input()\r\nc=''\r\nfor i in range(1,len(a)-1):\r\n if a[i] in 'qwertyuiopasdfghjklzxcvbnm':\r\n c+=a[i]\r\nprint(len(set(c)))", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\nlist1 = []\r\nlist2 = [\"{\" ,\"}\" ,\",\" ,\" \"]\r\nfor x in read_input():\r\n if x not in list1 and x not in list2:\r\n list1.append(x)\r\nprint(len(list1))", "n = str(input())\r\ns = set()\r\nfor i in range(1, len(n)-1, 3):\r\n s.add(n[i])\r\n\r\nprint(len(s))", "def letter(lista):\r\n hashset = set()\r\n for i in range(len(lista)):\r\n if 97<=ord(lista[i])<=122:\r\n hashset.add(lista[i])\r\n return len(hashset)\r\n\r\nn = list(input(\" \"))\r\nprint(letter(n))", "a = input()\r\nk2 = []\r\nfor i in a:\r\n if i == \"{\":\r\n continue\r\n elif i == \"}\":\r\n continue\r\n elif i == \",\":\r\n continue\r\n elif i == \" \":\r\n continue\r\n if i not in k2:\r\n k2 += i\r\nprint(len(k2))", "word = input()\r\nletters = []\r\n\r\nfor i in word:\r\n if ord(i) >= 97 and ord(i) <= 122 and i not in letters:\r\n letters.append(i)\r\n\r\nprint(len(letters))\r\n", "s = input()\r\n\r\nletters = set()\r\n\r\nfor i in range(1, len(s) - 1):\r\n if s[i] != ',' and s[i] != ' ':\r\n letters.add(s[i])\r\n\r\nprint(len(letters))\r\n", "a=input()\r\na=a[1:-1]\r\nl=[]\r\na=list(a)\r\nfor i in a:\r\n if i==\",\" or i==\" \":\r\n pass\r\n else:\r\n l.append(i)\r\nl1=[]\r\ncount=0\r\nfor i in l:\r\n if i not in l1:\r\n l1.append(i)\r\n count+=1\r\nprint(count)", "x=input()\r\ny=len(x)\r\nd=len(set(x))\r\nif(y>5):\r\n print(d-4)\r\nif(y==2):\r\n print(0)\r\nif(y==3):\r\n print(1)", "n=input()\r\nl=[]\r\nfor i in range(len(n)):\r\n if n[i]=='{' or n[i]=='}' or n[i]==',' or n[i]==' ':\r\n continue\r\n else:\r\n l.append(n[i])\r\n\r\ns=set(l)\r\nprint(len(s))", "l=list(input())\r\nl1=[]\r\nfor i in l:\r\n if i.isalpha():\r\n l1.append(i)\r\nl=[]\r\nfor i in l1:\r\n if i not in l:\r\n l.append(i)\r\nprint(len(l))\r\n ", "a=input()\r\ns=0\r\nb=set(list(a))\r\nfor i in b:\r\n\tif i.isalpha()==True:\r\n\t\ts+=1\r\nprint(s)", "inp = set(input().replace(\"{\", \"\").replace(\"}\", \"\").replace(\" \", \"\").split(\",\"))\r\n\r\nif '' in inp:\r\n inp.remove('')\r\n\r\nprint(len(inp))", "st = input()\r\nans = set()\r\nfor val in st:\r\n if val.isalpha():\r\n ans.add(val)\r\n\r\nprint(len(ans))", "s = input();print(len(set(s[1:len(s)-1]+' ,'))-2)", "s=input()\r\nm=list(s)\r\nm=m[1:-1]\r\n\r\nfor i in m:\r\n if ' ' in m or ',' in m :\r\n m.remove(' ')\r\n m.remove(',')\r\narr=[]\r\nfor j in m:\r\n if j not in arr:\r\n arr.append(j)\r\nprint(len(arr))", "x = input()\r\nc = [*set(x)]\r\nv = len(c)\r\nf_count = 0\r\nfor i in c:\r\n if i == '{' or i == '}' or i == ',' or i == ' ':\r\n f_count += 1\r\n \r\nif v - f_count < 0:\r\n print(f_count - v)\r\nelse:\r\n print(v - f_count)\r\n ", "inp = input()\r\nif inp == '{}':\r\n print(0)\r\nelse:\r\n inp = set(inp.rstrip(\"}\").lstrip(\"{\").split(\", \"))\r\n print(len(inp))", "a = input()\r\nif len(a) > 2:\r\n print(len(set(a[1:-1].split(', '))))\r\nelse:\r\n print(0)", "s = input()\r\ns = s[1:-1]\r\nlett = s.split(\", \")\r\nif lett[0] == '':\r\n print(0)\r\nelse:\r\n dis = set(lett)\r\n print(len(dis))", "t=input()\r\na=set()\r\nfor i in t:\r\n if i == '{' or i =='}' or i ==' ' or i==',':\r\n continue\r\n else:\r\n a.add(i)\r\n \r\nprint(len(a)) ", "set_ = set(input().strip('{}').split(', '))\nprint(len({el for el in set_ if el != ''}))", "a=set(input())\nx=[]\nfor i in a:\n if i!='{' and i!=',' and i!='}' and i!=' ' :\n x.append(i)\nprint(len(set(x)))\n\n \t\t \t\t \t\t \t\t \t\t\t\t \t \t\t \t", "letters= input().replace(',', '').replace(' ', '').replace('{','').replace('}','')\r\nlist =[]\r\nfor i in letters:\r\n list.append(i)\r\n\r\nif letters != '{}':\r\n all = set(list)\r\n print(len(all))\r\nelse:\r\n print(0)\r\n", "k = input()\r\nk2 = set(k.replace('{', '').replace('}', '').replace(',', '').replace(' ', ''))\r\nprint(len(k2))", "l = input()\r\na = {i for i in l if i.isalpha()} \r\nprint(len(a))\r\n", "s=input()\r\nli=[]\r\nfor i in s:\r\n if(i>='a' and i<='z'):\r\n if i not in li:\r\n li.append(i)\r\nprint(len(li))\r\n", "s = input()\r\n\r\n# Extract letters between curly brackets and commas\r\nletters = [c for c in s if c.isalpha()]\r\n\r\n# Use a set to count distinct letters\r\ndistinct_letters = set(letters)\r\n\r\n# Print the number of distinct letters\r\nprint(len(distinct_letters))\r\n", "ss = set(input())\n\nans = 0\n\nfor i in ss:\n if i != '}' and i != '{' and i != ',' and i != ' ':\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 \t", "s = input().strip(\"{\").strip(\"}\").split(\",\")\r\n\r\ns = set([a.strip() for a in s])\r\nif s == {''}:\r\n print(0)\r\nelse:\r\n print(len(s))", "x=input()\r\nl=[]\r\nfor i in x:\r\n if i.isalpha():\r\n l.append(i)\r\ns=set(l)\r\nprint(len(s))", "l = input() \nx=[] \nfor c in l:\n if c.isalpha() and c not in x :\n x.append(c)\nprint(len(x))\n\t\t\t\t \t \t\t\t \t \t\t\t \t\t\t \t\t\t", "x=input()\r\nz=\"qazwsxedcrfvtgbyhnujmikolp\"\r\ns=\"\"\r\n\r\nfor i in x:\r\n if i in z:\r\n s+=i\r\nprint(len(set(s)))\r\n\r\n", "print(len(set(filter(None, [_.strip() for _ in input()[1:-1].split(',')]))))", "s = [e for e in input()[1:-1].split(', ') if e != '']\r\nprint(len(set(s)))", "def main():\n s = input()\n s = s.strip(\"{}\")\n if not s:\n print(0)\n return\n letters = s.split(\", \")\n print(len(set(letters)))\n\n\nmain()\n\n \t\t \t\t \t\t \t\t \t \t \t\t\t\t\t \t", "s = input()[1:-1].replace(' ', '')\r\n\r\nif ',' not in s:\r\n if s == '':\r\n print(0)\r\n else:\r\n print(1)\r\nelse:\r\n s = s.split(',')\r\n\r\n print(len(set(s)))", "x=input()\r\nls=list(x)\r\nls.remove(\"{\")\r\nls.remove(\"}\")\r\nlst=ls[::]\r\nfor i in range(len(ls)):\r\n if ls[i] in ls[i+1:]:\r\n lst.remove(ls[i])\r\n\r\nif \",\" in lst:\r\n lst.remove(\",\")\r\nif \" \" in lst:\r\n lst.remove(\" \")\r\n\r\nprint(len(lst))", "t=input()\r\nprint(len(set(t+', '))-4)", "s=input()\r\nl=[]\r\nc=['{',' ','}',',']\r\nfor i in s:\r\n if i not in c:\r\n l.append(i)\r\nl=list(set(l))\r\nprint(len(l))", "answer = set(input()[1:-1].split(', '))\r\n\r\nif '' in answer:\r\n print(0)\r\nelse:\r\n print(len(answer))", "letters = list(map(str, input()))\r\ncount = 0\r\nset_letters = {i for i in letters if i not in ['{', '}', ',', ' ']}\r\nprint(len(set_letters))\r\n", "s = input()\r\ns = s[1:-1]\r\nd = dict()\r\ns = s.split(', ')\r\nfor i in range(len(s)):\r\n if d.get(s[i]) is None:\r\n d[s[i]] = s[i]\r\nif d.get('') is None:\r\n print(len(d))\r\nelse:\r\n print(0)", "x=input()\r\nx=x.replace(\"{\",\" \")\r\nx=x.replace(\"}\",\" \")\r\nx=x.replace(\",\",\" \")\r\nn=x.split()\r\nnn=set(n)\r\nprint(len(nn))", "x=(input(\"\"))\r\ny=[]\r\nfor i in x :\r\n if i.isalpha() :\r\n y.append(i)\r\nprint(len(set(y)))\r\n\r\n", "str = input()\r\nx =[]\r\nfor let in str:\r\n if(let==' ' or let==' ' or let=='{' or let=='}' or let== ','):\r\n continue\r\n else:\r\n if(let in x):\r\n continue\r\n else:\r\n x.append(let)\r\nprint(len(x))", "x=0\r\nt=input()\r\nif t!=\"{}\":\r\n t=t[1:-1]\r\n t=(t.split(\",\"))\r\n\r\n l=[]\r\n\r\n for i in t :\r\n if i.strip() in l:\r\n continue\r\n else:\r\n x+=1\r\n l.append(i.strip())\r\nprint(x)\r\n\r\n", "line= input()\r\ndistinct_letters= set()\r\nfor char in line:\r\n if ('a' <= char) and (char <= 'z'):\r\n distinct_letters.add(char)\r\nprint(len(distinct_letters))", "s=input()\r\nc=[]\r\np=(s.translate({ord('}'): None}))\r\nq=p.translate({ord('{'): None})\r\nr=q.translate({ord(','): None})\r\nl=r.translate({ord(' '): None})\r\nfor i in l:\r\n c.append(i)\r\nprint(len(set(c)))", "st = input()\r\nk = {}\r\nfor i in st:\r\n if i != \" \" and i != \",\" and i != \"{\" and i != \"}\":\r\n k[i] = 1\r\n\r\nprint(len(k))\r\n", "import string\r\nx = str(input())\r\nl = []\r\nfor z in x:\r\n if z in string.ascii_lowercase and z not in l:\r\n l.append(z)\r\nprint(len(l))", "s = input()\r\nA = set()\r\ns = s[1:len(s)-1]\r\ns = s.replace(',','')\r\nx = [a for a in s.split()]\r\nfor i in x:\r\n A.add(i)\r\nprint(len(A))", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n st = input()\r\n st = st[1:len(st)-1].split(',')\r\n for i in range(len(st)):\r\n st[i] = st[i].strip()\r\n if not st[i]:\r\n st.remove(st[i]) \r\n \r\n \r\n print(len(set(st)))\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nsolve()\r\n", "s = input()\r\ns = s.replace('{', \"\")\r\ns = s.replace('}', \"\")\r\nnew_s = s.split(\", \")\r\narr = []\r\nfor i in range(len(new_s)):\r\n if new_s[i] not in arr and new_s[i] != '':\r\n arr.append(new_s[i])\r\nprint(len(arr))", "print(sum(1 for i in set(input().replace('{', '').replace('}', '').split(', ')) if i))\r\n", "s = input()\r\ns = s[1:-1]\r\ns = s.split(\", \")\r\n\r\nif s[0] == \"\":\r\n print(\"0\")\r\nelse:\r\n print(len(set(s)))", "import re\r\na=input()\r\na=re.split(' |,|{|}',a)\r\na=set(a)\r\nprint(len(a)-1)", "s = input()\r\n\r\n# initialize a set to keep track of distinct letters\r\nletters = set()\r\n\r\n# iterate over the characters in the string\r\nfor c in s:\r\n # ignore the opening and closing brackets and the commas and spaces\r\n if c.isalpha():\r\n # add the letter to the set\r\n letters.add(c)\r\n\r\n# output the size of the set\r\nprint(len(letters))\r\n\r\n", "w = input().strip(\"{}\").split(\", \")\r\nl = []\r\nfor i in w:\r\n if l.count(i) == 0 and i != \"\":\r\n l.append(i)\r\nprint(len(l))", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\n\r\nletters_set = input()\r\nlst = []\r\ndistict_lst = []\r\nfor letter in letters_set:\r\n if ord(letter) >= 97 and ord(letter) <= 122:\r\n lst.append(letter)\r\nfor item in lst:\r\n if item not in distict_lst:\r\n distict_lst.append(item)\r\n\r\nprint(len(distict_lst))\r\n", "x=input()\r\nl=[]\r\ng=[]\r\nd=0\r\nfor i in range(len(x)):\r\n if(x[i]!='{' and x[i]!='}' and x[i]!=',' and x[i]!=' '):\r\n l.append(x[i])\r\nfor i in range(len(l)):\r\n if l[i] not in g:\r\n d=d+1\r\n g.append(l[i])\r\nprint(d)", "a=input()\na=a.strip(',')\nb=list(a)\nb.sort()\nc=0\nfor i in range(len(b)):\n\t#counting no. of distinct letters only alphabets that is excluding braces comma and space character.\n\tif(b[i]!='{' and b[i]!='}' and b[i]!=',' and b[i]!=' '):\n\t\tif (b[i]!=b[i-1]):\n\t\t\tc+=1\nprint(c)", "str1 = input().lower()\r\nstr1 = str1.replace(\"{\",\"\")\r\nstr1 = str1.replace(\"}\",\"\")\r\nstr1 = str1.replace(\",\",\"\")\r\nstr1 = str1.replace(\" \",\"\")\r\nset1 = set()\r\nfor i in range(0,len(str1)):\r\n set1.add(str1[i])\r\nprint(len(set1))\r\n", "string = input()\n\ntotal = 0\nduplicate = 0\nvalues = ''\n\nfor char in string:\n if char != '{' and char != '}' and char != ',' and char != ' ':\n if char in values:\n duplicate += 1\n total += 1\n else:\n total += 1\n values += char\n\nprint(total - duplicate)\n", "a = input()\r\ns = set(a)\r\nc = 0\r\nfor i in s:\r\n if i != '{' and i != ',' and i != ' ' and i != '}':\r\n c += 1\r\nprint(c)\r\n", "\r\n\r\nstring = str( input() )\r\n\r\nlist1 = [ ]\r\n\r\nfor letter in string :\r\n if ( letter.isalpha() == True ) :\r\n\r\n list1.append( letter )\r\n\r\nprint( len( set( list1 ) ) )\r\n\r\n \r\n", "# Read input and remove leading/trailing whitespace\r\ns = input().strip()\r\n\r\n# Check if the input is an empty set\r\nif s == \"{}\":\r\n print(0)\r\nelse:\r\n # Convert the input string to a list of characters\r\n l = list(s)\r\n \r\n # Extract every third character starting from the second character (index 1)\r\n # This captures the elements within the set\r\n a = set(l[1:len(l):3])\r\n \r\n # Print the number of distinct elements in the set\r\n print(len(a))\r\n", "a = input()\r\nb = []\r\nfor i in range(1,len(a)-1):\r\n if a[i] == \",\" or a[i] == \" \":\r\n pass\r\n else:\r\n b.append(a[i])\r\nb = set(b)\r\nprint(len(b))", "s=input()\r\ns = s[1:-1]\r\nlength=0\r\nif s=='':\r\n length = 0\r\nelse:\r\n leters = s.split(', ')\r\n length=len(set(leters))\r\n\r\nprint(length)", "nigger= input()\r\nstalin = set(filter(lambda x: x.isalpha(), nigger))\r\nprint(len(stalin))", "import string\r\n\r\ns = input()\r\nS = set(filter(str.isalpha, s))\r\n\r\nprint(len(S))\r\n", "s = input()\r\nl = set(list(s))\r\nif ',' in l:\r\n print(len(l)-4)\r\nelse:\r\n print(len(l)-2)", "a=input().strip()[1:-1]\r\nif a==\"\":\r\n print(0)\r\nelse:\r\n letters=a.split(\", \")\r\n d=set(letters)\r\n print(len(d))", "s = input()\r\ns = s[1:-1].replace(\", \", \"\")\r\nprint(len(set(s)))", "n = str(input())\r\na =[]\r\nb = []\r\n\r\nx = 0\r\nfor i in n:\r\n a.append(i)\r\nfor j in a:\r\n if j not in b:\r\n x+=1\r\n b.append(j)\r\n\r\nif x == 2:\r\n print(0)\r\nelif x == 3:\r\n print(1)\r\nelse: \r\n print(x-4)\r\n", "a=input()\r\nl=[]\r\nfor i in a:\r\n if(i==\"{\" or i==\"}\" or i==\",\" or i==\" \"):\r\n continue\r\n else:\r\n l.append(i)\r\nc=[]\r\ncount=0\r\nfor i in range(len(l)):\r\n if l[i] not in c:\r\n c.append(l[i])\r\n count+=1\r\nprint(count)", "set_letters = input()\r\nif len(set_letters) <= 2:\r\n count = 0\r\nelse:\r\n letters = set_letters[1:-1].split(\", \")\r\n distinct_letters = set(letters)\r\n count = len(distinct_letters)\r\nprint(count)\r\n", "n = input()\r\n\r\nalf = 'abcdefghijklmnopqrstuvwxyz'\r\ncol = 0\r\n\r\nfor i in range(len(n)):\r\n if n[i] in alf:\r\n alf = alf.replace(n[i], '')\r\n col += 1\r\nprint(col)", "list = ['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\nname = input().upper()\r\nk=0\r\ncount=0\r\nfor i in range(0,len(name)):\r\n for j in range(0,len(list)):\r\n if list[j] == name[i]:\r\n count+=1\r\n list.remove(list[j])\r\n break\r\nprint(count) \r\n\r\n", "n = input()\r\na = n.strip(',')\r\nz = list(a)\r\nz.sort()\r\ncount = 0\r\nfor i in range(len(z)):\r\n if z[i] != '{' and z[i] != '}' and z[i] != ',' and z[i] != ' ':\r\n if i == 0 or z[i] != z[i - 1]:\r\n count += 1\r\n\r\nprint(count)", "print(len(set(input()+', '))-4)\r\n#HI CODEFORCES\r\n#", "x=input()\nx=set(x.replace(\" \",\"\").replace(\",\",\"\").replace(\"{\",\"\").replace(\"}\",\"\"))\nprint(len(x))\n\n\t\t\t \t\t \t\t \t \t \t\t\t\t \t\t \t \t", "s = input().strip('{''}').split(', ')\r\nif s == ['']:\r\n print(0)\r\nelse:\r\n print(len(set(s)))\r\n\r\n", "letters=set(input()[1:-1])\r\nletters.discard(' ')\r\nletters.discard(',')\r\nprint(len(letters))", "s = input()\r\nse = set()\r\nfor i in s:\r\n if i.isalpha():\r\n se.add(i)\r\nprint(len(se))", "\r\n\r\ndef solve():\r\n read_set = input()\r\n if read_set == '{}':\r\n return 0\r\n\r\n letters_list = set(read_set[1: -1].split(\", \"))\r\n return len(letters_list)\r\n\r\n\r\nprint(solve())\r\n", "line = input()\ndistinct_letters = set()\nfor char in line:\n if ('a' <= char) and (char <= 'z'):\n distinct_letters.add(char)\nprint(len(distinct_letters))\n\n\t\t\t\t \t\t\t \t \t \t\t\t \t\t \t \t", "s = input()\nli = list(s)\nl = li[1:-1]\nlis = []\nfor i in l:\n if i>=\"a\" and i<=\"z\":\n lis.append(i)\nt = set(lis)\nprint(len(t))\n\t \t \t\t\t\t \t \t \t\t\t\t \t \t \t", "s=input()\r\nd=set()\r\nfor i in range(len(s)):\r\n if 'a'<=s[i]<='z':d.add(s[i])\r\nprint(len(d))", "set_A = input()\r\nc=set_A.strip(\"{ ,}\")\r\n\r\nset_b = set({})\r\nfor i in c :\r\n if i.isalpha():\r\n set_b.add(i)\r\nprint(len(set_b))", "def main():\r\n from sys import stdin, stdout\r\n s = [char for char in stdin.readline().rstrip() if char.isalpha()]\r\n return stdout.write(str(len(set(s))))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=input()\r\nls=[]\r\nfor i in s:\r\n ls.append(i)\r\nlst=ls.copy()\r\nif s=='{}':\r\n print(0)\r\nelse:\r\n for i in range(len(ls)):\r\n if ls[i] in ls[i+1:]:\r\n lst.remove(ls[i])\r\n if '{' in lst:\r\n lst.remove('{')\r\n if '}' in lst:\r\n lst.remove('}')\r\n if ' ' in lst:\r\n lst.remove(\" \")\r\n if ',' in lst:\r\n lst.remove(',')\r\n print(len(lst))", "letters_input = input()\r\n\r\nletters_set = set()\r\n\r\nfor letter in letters_input:\r\n if letter.isalpha():\r\n letters_set.add(letter)\r\n\r\nprint(len(letters_set))", "huerga = input()\r\nnorm_tema = huerga[1:-1]\r\nif len(norm_tema) == 0:\r\n print(0)\r\nelse:\r\n jacker = norm_tema.split(\", \")\r\n final_checklist = []\r\n for i in range(len(jacker)):\r\n if jacker[i] not in final_checklist:\r\n final_checklist.append(jacker[i])\r\n print(len(final_checklist))\r\n", "n = input()\r\nif len(n) == 2:\r\n print(0)\r\nelse:\r\n i = set(n[1:-1].split(\", \"))\r\n print(len(i))\r\n", "s = input()\r\na = []\r\nfor i in s:\r\n if i == \"{\" or i == \"}\" or i == \",\" or i == \" \":\r\n s.replace(i,\"\")\r\n else:\r\n a.append(i)\r\na = set(a)\r\nprint(len(a))", "n =[each for each in input() if each !=\" \" and each !=\"}\" and each !=\"{\" and each !=\",\"]\r\nprint(len(set(n)))", "s=input()\r\nst = set()\r\nfor i in s:\r\n if i>= \"a\" and i <= \"z\":\r\n st.add(i)\r\n\r\nprint(len(st))", "n = [i for i in input()]\r\ndel n[0]\r\ndel n[-1]\r\nwhile ',' in n:\r\n del n[n.index(',')]\r\nif n:\r\n print(len(set([i for i in ''.join(n).split(sep=' ')])))\r\nelse:\r\n print(0)\r\n", "\r\ninp = input()\r\ninp = inp.replace('{','')\r\ninp = inp.replace('}','')\r\ninp = inp.replace(',','')\r\ninp = inp.replace(' ','')\r\ninp = set(inp)\r\nprint(len(inp))\r\n", "s = input()\r\ns = s[1:-1]\r\nif s:\r\n l = s.split(\", \")\r\n d = set(l)\r\n c = len(d)\r\nelse :\r\n c = 0\r\nprint(c)\r\n\r\n\r\n", "a=input()\r\nif(len(a))==2:\r\n print(0)\r\nelse:\r\n list1=[]\r\n l2=[]\r\n b=list(map(str,a.split(\",\")))\r\n for i in range(len(b)):\r\n if(\"{\" in b[i]):\r\n list1.append(b[i][-1])\r\n elif(\"}\" in b[i]):\r\n list1.append(b[i][1])\r\n else:\r\n list1.append(b[i])\r\n for i in list1:\r\n l2.append(ord(i[-1]))\r\n print(len(set(l2))) ", "s=input()\r\ns1=s[1:]\r\ns2=s1[:-1]\r\nl=s2.split(\", \")\r\ndist_list=[]\r\nc=0\r\nif len(s)!=2:\r\n for i in l:\r\n if i not in dist_list:\r\n dist_list.append(i)\r\n c+=1\r\nprint(c)\r\n", "x=input()\r\nm=set(x)\r\nm = [i for i in m if i not in ['}', '{', ',', ' ']]\r\nprint(len(set(m)))", "str5 = input()\r\nstr5 = str5[1:-1:]\r\nstr5 = str5.lower()\r\n\r\nlist2= str5.split(\", \")\r\n\r\nlist1 = []\r\n\r\nfor i in list2:\r\n if i not in list1:\r\n list1.append(i)\r\n\r\nif '' in list1:\r\n print(0)\r\nelse:\r\n print(len(list1))\r\n", "s=input()\r\nse=set()\r\nfor i in s:\r\n if i!='{' and i!='}' and i!=\" \" and i!=',':\r\n se.add(i)\r\n\r\nprint(len(se))", "set_letters = set(input().replace('}', '').replace('{', '').split(', '))\r\nif list(set_letters)[0] != '':\r\n print(len(set_letters))\r\nelse: \r\n print(0)", "string = input()[1:-1].split(\", \")\r\nprint(len(set(string)) if len(string[0]) > 0 else 0)", "s=input()\r\ns=s[1:-1]\r\ns= s.replace(',','')\r\nr={*s.split()}\r\nprint(len(r)) ", "x = input()\r\nif x == '{}':\r\n print(0)\r\nelse:\r\n setabc = set(x[1:-1].split(', '))\r\n print(len(setabc))\r\n\r\n", "s = input().strip()\nif len(s) == 2: # 处理空集合的情况\n print(0)\nelse:\n # 用 set 存储不同的字符\n unique_chars = set(c for c in s if c.islower())\n print(len(unique_chars))\n\n \t\t \t\t \t\t\t \t\t\t \t \t\t \t \t \t \t", "s = input()\r\ns = s[1:-1]\r\ns = s.replace(\",\", \"\")\r\nv = list(map(str, s.split()))\r\nv = set(v)\r\nprint(len(v))", "m=input()\r\ns=[]\r\nfor i in m:\r\n if i != '{' and i != '}' and i!= ' ' and i != ',':\r\n s.append(i)\r\nprint(len(set(s)))", "inputNumbers = list(input().split(\", \"))\r\n\r\nif inputNumbers[0] == '{}':\r\n print('0')\r\n exit()\r\n\r\ninputNumbers[0] = inputNumbers[0][1:]\r\ninputNumbers[-1] = inputNumbers[-1][:-1]\r\n\r\nprint(len(set(inputNumbers)))", "letters = input()\r\n\r\ndistinct_letters = set()\r\nfor char in letters:\r\n if char.isalpha():\r\n distinct_letters.add(char)\r\n\r\ncount = len(distinct_letters)\r\nprint(count)", "import string as st\r\nl1=[]\r\nx=input()\r\nfor i in x:\r\n if i in st.ascii_letters:\r\n l1.append(i)\r\nprint(len(set(l1)))\r\n\r\n ", "def main() -> None :\r\n print(unique_Letter_Count(input_Set_Str()))\r\n\r\n\r\ndef unique_Letter_Count(set_str: str) -> int :\r\n return len(set_From_Set_Str(set_str))\r\n\r\ndef set_From_Set_Str(set_str: str) -> set :\r\n return set(array_From_Set_Str(set_str))\r\n\r\ndef array_From_Set_Str(set_str: str) -> list[str] :\r\n return filter_Exist(set_str[1:-1].split(\", \"))\r\n\r\ndef filter_Exist(array: list[str]) -> list[str] :\r\n return list(filter(len, array))\r\n\r\n\r\ndef input_Set_Str() -> str :\r\n return input()\r\n\r\n\r\nmain()", "letter_set = input()\r\n\r\nif letter_set == \"{}\":\r\n print(0)\r\nelse:\r\n letter_list = letter_set[1:-1].split(\", \")\r\n distinct_letters = len(set(letter_list))\r\n print(distinct_letters)", "lst = list(input())\r\ns = set(lst)\r\nif len(s) >= 4:\r\n print(len(s)-4)\r\nelif 3<=len(s)<4:\r\n print(len(s)-2)\r\nelse:\r\n print(0)", "s= set(input().strip('{}').split(', '))\r\nif s =={''} :\r\n print(0)\r\nelse : \r\n print(len((s)))", "s=input()[1:-1]\r\nif s:\r\n s=s.split(', ')\r\n print(len(set(s)))\r\nelse:\r\n print(0)", "input_str1 = input()\ndistinct_chars = set(filter(str.isalpha, input_str1))\nprint(len(distinct_chars))\n \t \t \t\t\t\t\t\t\t \t \t \t\t\t\t", "a = str(input())\r\nkitu = []\r\nfor i in range(0,len(a)):\r\n if a[i] != ',' and a[i] != ' ' and a[i] != '}' and a[i] != '{':\r\n if a[i] not in kitu:\r\n kitu.append(a[i])\r\n\r\nprint(len(kitu))", "str = input()\r\ns = set()\r\nfor i in str:\r\n if i >= 'a' and i <= 'z':\r\n s.add(i)\r\n\r\nprint(len(s))\r\n", "myset=input()\r\nans=[]\r\nfor i in myset:\r\n if i.isalpha():\r\n ans.append(i)\r\n\r\nprint(len(set(ans)))", "message = input().strip()\r\nletters = [ 0 for x in range(255)]\r\n \r\ncount =0\r\nfor ch in message:\r\n letters[ord(ch)]+=1\r\n \r\nfor idx in range(97,97+26):\r\n if (letters[idx] > 0):\r\n count +=1\r\n \r\nprint(count)\r\n ", "text = input()[1:-1] # استخراج النص بين الأقواس المفتوحة والمغلقة\r\n\r\nif not text: # التحقق إذا كان النص فارغًا\r\n print(0)\r\nelse:\r\n characters = text.split(', ') # تقسيم النص إلى قائمة من الأحرف\r\n distinct_characters = set(characters) # تحويل القائمة إلى مجموعة\r\n count = len(distinct_characters) # حساب عدد الأح\r\n print(count)", "stroka = input().split(\"{}\")\r\n\r\nli=[]\r\nfor item in stroka:\r\n for i in item:\r\n if i.isalpha():\r\n li.append(i)\r\n\r\nprint(len(set(li)))", "S = input()\r\nS = S[1:len(S)-1]\r\nS = S.split(',')\r\nreq = []\r\nfor i in S:\r\n if(i!=''):\r\n req.append(i.strip())\r\nprint(len(set(req)))", "n = set(input())\nans = 0\nfor i in n:\n if i != '{' and i != '}' and i != ',' and i != ' ':\n ans += 1\nprint(ans)\n\n\n\t\t\t \t \t \t\t \t\t\t\t\t\t \t \t \t \t\t", "i = input().replace('{','').replace('}','').split(', ')\r\n\r\nd = list(dict.fromkeys(i))\r\n\r\nprint((len(d) if '' not in d else 0))", "lin = input()\r\nlin = set(lin)\r\n\r\nlin.discard(\"{\")\r\nlin.discard(\"}\")\r\nlin.discard(\",\")\r\nlin.discard(\" \")\r\n\r\nprint(len(lin))", "def count_distinct_letters(s):\r\n letters_set = set()\r\n for char in s:\r\n if char.isalpha():\r\n letters_set.add(char)\r\n return len(letters_set)\r\n\r\ninput_line = input().strip()\r\n\r\nresult = count_distinct_letters(input_line)\r\nprint(result)\r\n", "s = input()\r\nif s and s != '{}':\r\n value = s.strip(\"{}\").split(\",\")\r\n value = [element.strip() for element in value]\r\n Myset = set(value)\r\nelse:\r\n Myset = set()\r\nprint(len(Myset))\r\n", "lst=input()\r\nf=0\r\nst=set(lst)\r\nfor i in st:\r\n if i>='a' and i<='z':\r\n f+=1\r\n\r\nprint(f)\r\n \r\n \r\n ", "myInput = list(map(str, input()))\r\n\r\nfilteredList = set()\r\nfor i in range(len(myInput)):\r\n if not (myInput[i] == '{' or myInput[i] == '}' or myInput[i] ==' ' or myInput[i] ==','):\r\n filteredList.add(myInput[i])\r\n\r\nprint(len(filteredList))\r\n", "a=input()\r\ns=set(a)\r\nc=0\r\nfor i in s:\r\n if i!='{' and i!='}' and i!=',' and i != ' ':\r\n c+=1\r\nprint(c)", "n=str(input())\r\nif n=='{}':\r\n print('0')\r\nelse:\r\n n=n[1:-1]\r\n b=n.split(', ')\r\n m=set(b)\r\n print(len(m))\r\n", "a = input()\r\na = a.strip(',')\r\nb = list(a)\r\nb.sort()\r\nc = 0\r\n\r\nfor i in range(len(b)):\r\n if b[i] != '{' and b[i] != '}' and b[i] != ',' and b[i] != ' ':\r\n if i == 0 or b[i] != b[i - 1]:\r\n c += 1\r\n\r\nprint(c)\r\n", "#https://codeforces.com/problemset/problem/443/A\r\n\r\nset_input = input()\r\ncharacter_list = []\r\n\r\nfor character in set_input:\r\n if character.isalpha() and character not in character_list:\r\n character_list.append(character)\r\n\r\nprint(len(character_list))", "x = str(input())\r\nif len(x) == 2:\r\n print(0)\r\nelse:\r\n x = x[1:-1]\r\n arr = x.split(\", \")\r\n vec = []\r\n for i in arr:\r\n if i not in vec:\r\n vec.append(i)\r\n print(len(vec))", "x = input()\r\nlis = []\r\nfor i in range(len(x)):\r\n if x[i] != \" \" and x[i] != \",\" and x[i] != \"{\" and x[i] !=\"}\":\r\n lis.append(x[i])\r\nlis = list(set(lis))\r\nprint(len(lis))", "s = input()\r\ns = s[1:-1]\r\nd = set(s.split(\", \"))\r\nd.discard('')\r\nc = len(d)\r\nprint(c)", "n = input()\nn1 = n.replace(\"{\",\"\")\nn2 = n1.replace(\",\",\"\")\nn3 = n2.replace(\" \",\"\")\nans = list(set(n3))\nprint(len(ans)-1)", "s=input()\r\nl=[]\r\nq='abcdefghijklmnopqrstuvwxyz'\r\nfor i in s:\r\n if i in q:\r\n l.append(i)\r\nprint(len(set(l)))", "a=input()\nc=[]\nfor i in range(len(a)):\n\tif a[i]!=\"{\" and a[i]!=\"}\" and a[i]!=\",\" and a[i]!=\" \" and a[i] not in c:\n\t\tc.append(a[i])\nprint(len(c))\n \t\t\t\t\t \t\t \t\t\t \t\t\t\t \t\t\t\t \t", "import re\r\ntext = set(list(input()))\r\ncount = 0\r\nfor i in text :\r\n if re.match(\"[A-Za-z]\" , i) : count += 1\r\nprint(count)", "letters=input()\r\nlst=[]\r\nempty=\"\"\r\nfor i in letters:\r\n if ord(i)>=97 and ord(i)<=122:\r\n lst+=i\r\nfor i in lst:\r\n if i not in empty:\r\n empty+=i\r\n \r\nprint(len(empty))\r\n\r\n \r\n\r\n", "my_set=set()\n\ns= input()\n\nalpha=\"abcdefghijklmnopqrstuvwxyz\"\n\nfor i in s:\n if i.isalpha():\n my_set.add(i)\nprint(len(my_set))\n\n\n\n \t \t\t\t\t\t\t \t\t \t\t\t \t\t\t\t \t", "text = input()\r\n\r\ntext = text[1:-1]\r\n\r\ntext = text.split(', ')\r\n\r\ncounter = {\r\n 'a':False,\r\n 'b':False,\r\n 'c':False,\r\n 'd':False,\r\n 'e':False,\r\n 'f':False,\r\n 'g':False,\r\n 'h':False,\r\n 'i':False,\r\n 'j':False,\r\n 'k':False,\r\n 'l':False,\r\n 'm':False,\r\n 'n':False,\r\n 'o':False,\r\n 'p':False,\r\n 'q':False,\r\n 'r':False,\r\n 's':False,\r\n 't':False,\r\n 'u':False,\r\n 'v':False,\r\n 'w':False,\r\n 'x':False,\r\n 'y':False,\r\n 'z':False\r\n}\r\n\r\ncount = 0\r\n\r\nfor i in text:\r\n try:\r\n if counter[i] == False:\r\n counter[i] = True\r\n count = count + 1\r\n except KeyError:\r\n pass\r\n\r\nprint(count)\r\n \r\n \r\n \r\n", "s = set((map(str.strip, input().strip('{}').split(','))))\r\ntemp = s.copy()\r\nfor i in s:\r\n elem = temp.pop()\r\n if elem != '':\r\n temp.add(elem)\r\n\r\nprint(len(temp))", "l=(input())\r\nl=\"\".join(l.split())\r\nl=\"\".join(l.split(','))\r\nl=list(l)\r\nl=[*set(l)]\r\nprint(len(l)-2)", "w=input()[1:-1].split(', ')\r\nv=[]\r\nfor i in w:\r\n if i not in v and i !='': v.append(i)\r\nprint(len(v))", "s=input()\r\nal_set=set(\"\")\r\nfor i in range(1,len(s),3):\r\n al_set.add(s[i])\r\nif s==\"{}\" or s==\"{\" or s==\"}\" or s==\" \":\r\n print(\"0\")\r\nelse:\r\n print(len(al_set))", "a = input()\r\nif ' ' in set(a):\r\n print(len(set(a))-4)\r\nelse:\r\n print(len(set(a))-2)", "s=input()\r\na=set()\r\nb=['{','}',',',' ']\r\nfor i in s:\r\n if i in b:\r\n continue\r\n else:\r\n a.add(i)\r\nprint(len(a))", "print(len([i for i in set(input()) if i.isalpha()]))\r\n", "s=input()\r\nst=s[1:len(s)-1]\r\na=\"\"\r\nfor i in st:\r\n if i==' ' or i==',':\r\n continue\r\n a+=i\r\nprint(len(set(a)))", "arr = [i for i in input()[1:-1].split(\", \")]\r\n\r\n\r\ndef main(arr):\r\n if len(arr) == 1 and not arr[0]:\r\n return 0\r\n return len(set(arr))\r\n\r\nprint(main(arr))", "a=input()\r\nb=a[1:len(a)-1]\r\nb=b.replace(' ','')\r\nc=b.split(',')\r\nif(c==['']):\r\n print(0)\r\nelse:\r\n d=set(c)\r\n print(len(d))", "lst = [i for i in input()]\r\ndel lst[0]\r\ndel lst[-1]\r\ncount = 0\r\na = []\r\nfor i in range(0, len(lst), 3):\r\n if lst[i] not in a:\r\n a.append(lst[i])\r\nprint(len(a))", "n = input()\r\nf = []\r\nfor i in range(len(n)):\r\n if n[i].isalpha() and n[i] not in f:\r\n f.append(n[i])\r\nprint(len(f))", "s = input()\r\nse = set()\r\nfor i in s:\r\n se.add(i)\r\nse.difference_update({' ',',','{','}'})\r\nprint(len(se))", "s = input()\r\nfor i in s:\r\n if i in '{} ,':\r\n s = s.replace(i, '')\r\nprint(len(set(s)))\r\n", "a={*(list(map(str,input()[1:-1:].split(', '))))}\r\nif a=={''}:\r\n print(0)\r\nelse:\r\n print(len(a))", "x=input()\r\nx1=set(x)\r\np=0\r\nfor i in x1:\r\n if i not in \"}{, \":\r\n p+=1\r\nprint(p)", "s=input()\r\nd=[]\r\nfor i in s:\r\n if(i.isalpha()):\r\n d.append(i)\r\n \r\nprint(len(set(d)))", "name = input()\r\nname = \"\".join(name[1:-1].split(\", \"))\r\nname = set(name)\r\nprint(len(name))", "letters = input()[1:-1].split(', ')\r\nif letters == ['']:\r\n print(0)\r\nelse:\r\n print(len(set(letters)))\r\n", "a=input()\r\nif a==\"{}\":\r\n print(0)\r\nelse:\r\n \r\n a=a[1:len(a)-1]\r\n a=a.split(', ')\r\n a=set(a)\r\n\r\n print(len(a))", "l = input()\r\ns = []\r\nfor i in range(1,len(l)-1):\r\n if l[i]!=',' and l[i]!=' ':\r\n s.append(l[i])\r\n\r\nl = set(s)\r\nprint(len(l))", "s = input()\r\ns = s.strip(',')\r\nb = list(s)\r\nb.sort()\r\ncount = 0\r\nfor i in range(len(b)):\r\n if(b[i] != \"{\" and b[i] != \"}\" and b[i] != \",\" and b[i] != \" \"):\r\n if(b[i] != b[i - 1]): count += 1\r\nprint(count)", "a = set(input())\r\nb = ''\r\nfor i in a:\r\n if i=='{' or i=='}' or i==',' or i==' ':\r\n continue\r\n else:\r\n b+=i\r\nprint(len(b))", "a = input()\r\nb = a.split(' ')\r\nc = []\r\nfor i in a:\r\n if i == '{' or i== '}' or i == ',' or i == ' ':\r\n pass\r\n else:\r\n c.append(i)\r\nd = []\r\nfor j in c:\r\n if j not in d:\r\n d.append(j)\r\n else:\r\n pass\r\nprint(len(d))", "s1=input()\r\ns=s1[1:-1].split(\", \")\r\nres=set()\r\nif len(s1)>2:\r\n for i in range(len(s)):\r\n res.add(s[i])\r\nelse:\r\n res=set()\r\nprint(len(res))", "s=input()\r\ns=s[1:-1]\r\ns=s.replace(' ','')\r\ns=s.replace(',','')\r\nc=set()\r\nfor i in range(len(s)):\r\n c.add(s[i])\r\nprint(len(c))\r\n\r\n", "n = input()\r\nl = []\r\nfor i in n:\r\n if i == \"{\" or i == \"}\" or i == \",\" or i == \" \":\r\n pass\r\n else:\r\n l.append(i)\r\nprint(len(list(dict.fromkeys(l))))", "# -*- coding: utf-8 -*-\n\"\"\"443A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1QQlpFn5f2AnJ84k4vgiNqVHxbttipyxU\n\"\"\"\n\ns= input()\nst = set()\nfor i in s:\n\tif i>= \"a\" and i<= \"z\":\n\t\tst.add(i)\nprint( len(st))", "s = input()\r\nlist1 = []\r\nfor x in s:\r\n if x != '{' and x != '}' and x != ' ' and x != ',':\r\n list1.append(x)\r\n\r\ns_et = set(list1)\r\nprint(len(s_et))", "s = set()\r\nantons = input()\r\nfor i in range(len(antons)):\r\n if antons[i].islower():\r\n s.add(antons[i])\r\nprint(len(s))", "word=input()\n\ncnt=0\nmyword=\"\"\n\nfor i in range(0,len(word),1):\n if word[i].isalpha()==True and word[i] not in myword:\n cnt+=1\n myword+=word[i]\n\nprint(cnt)\n \t \t \t \t\t \t\t \t\t \t \t", "s = input().strip()\r\ns = s[1:len(s)-1]\r\nif s == '':\r\n print(0)\r\n exit()\r\ns = s.split(', ')\r\nb = set(s)\r\nprint(len(b))\r\n", "x = input()\r\ny = set()\r\n\r\nfor char in x :\r\n if 'a' <= char <= 'z':\r\n y.add(char)\r\n\r\nprint(len(y))\r\n ", "input_string = input()\r\nletters = input_string[1:-1].replace(\", \", \"\") \r\ndistinct_letters = set(letters) \r\ncount = len(distinct_letters) \r\nprint(count)\r\n", "m=input(\"\")\r\nl=[]\r\nfor i in m:\r\n if i!=\"{\" and i!=\"}\" and i!=\" \" and i!=\",\":\r\n l.append(i)\r\nd={}\r\nfor j in l:\r\n d[j]=l.count(j)\r\nprint(len(d))", "from collections import defaultdict\n\nx = input().replace('{', \"\")\nx = x.replace('}', \"\")\nx = x.replace(',', \"\")\nx = x.split()\n\nres = 0\nd = {}\nfor i in x:\n if i not in d:\n d[i]=0\n res += 1\n\nprint(res)\n\n", "a=input()\r\nl=[]\r\ns=[]\r\nfor i in a:\r\n if 97<=ord(i)<=122:\r\n l.append(i)\r\nfor i in l:\r\n if i not in s:\r\n s.append(i)\r\nprint(len(s))", "s = input()\r\n\r\nmy_set = {1,2}\r\n\r\n\r\nfor c in s :\r\n if c >= 'a' and c <= 'z':\r\n my_set.add(c)\r\nprint(len(my_set)-2)", "def main():\r\n input_str = input().strip()\r\n letters = set()\r\n\r\n for k in range(1, len(input_str), 3):\r\n c = input_str[k]\r\n if 'a' <= c <= 'z':\r\n letters.add(c)\r\n\r\n print(len(letters))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\ns = s.replace(\"{\",\"\")\r\ns = s.replace(\"}\",\"\")\r\ns = s.replace(\",\",\"\")\r\ns = s.replace(\" \",\"\")\r\nq = set(s)\r\nprint(q.__len__())\r\n", "x=(input(\"\"))\r\ny=[]\r\nfor i in x :\r\n if i.isalpha() and i.isalpha() not in y :\r\n y.append(i)\r\nprint(len(set(y)))\r\n\r\n", "my_str=input()\r\na=my_str.split('{')\r\nresult=''.join(a)\r\nb=result.split('}')\r\nresult1=''.join(b)\r\nx=set(result1)\r\ncount=0\r\n\r\nfor item in x:\r\n if item.isalpha():\r\n count +=1\r\n else:\r\n pass\r\n\r\nprint(count)", "letters = input().strip('{}').split(', ')\r\n\r\ndistinct_letters = set()\r\n\r\nfor letter in letters:\r\n if letter.isalpha():\r\n distinct_letters.add(letter)\r\n\r\ncount = len(distinct_letters)\r\n\r\nprint(count)\r\n", "x=input()\r\nl=[]\r\nfor i in x:\r\n if(ord(i)>=97 and ord(i)<=122 and (i not in l)):\r\n l.append(i)\r\nprint(len(l))\r\n ", "l = input()\r\ns = set()\r\nfor i in range(len(l)):\r\n if(l[i].islower()):\r\n s.add(l[i])\r\nprint(len(s))", "print(len({e for e in input()[1:-1].split(\", \") if e!=\"\"}))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 9 13:53:35 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nstr1=input()\r\ncount=0\r\nif 'q' in str1:\r\n count=count+1\r\nif 'w' in str1:\r\n count=count+1\r\nif 'e' in str1:\r\n count=count+1\r\nif 'r' in str1:\r\n count=count+1\r\nif 't' in str1:\r\n count=count+1\r\nif 'y' in str1:\r\n count=count+1 \r\nif 'u' in str1:\r\n count=count+1 \r\nif 'i' in str1:\r\n count=count+1 \r\nif 'o' in str1:\r\n count=count+1\r\nif 'p' in str1:\r\n count=count+1\r\nif 'a' in str1:\r\n count=count+1\r\nif 's' in str1:\r\n count=count+1\r\nif 'd' in str1:\r\n count=count+1\r\nif 'f' in str1:\r\n count=count+1\r\nif 'g' in str1:\r\n count=count+1\r\nif 'h' in str1:\r\n count=count+1\r\nif 'j' in str1:\r\n count=count+1\r\nif 'k' in str1:\r\n count=count+1\r\nif 'l' in str1:\r\n count=count+1\r\nif 'z' in str1:\r\n count=count+1\r\nif 'x' in str1:\r\n count=count+1\r\nif 'c' in str1:\r\n count=count+1\r\nif 'v' in str1:\r\n count=count+1\r\nif 'b' in str1:\r\n count=count+1\r\nif 'n' in str1:\r\n count=count+1\r\nif 'm' in str1:\r\n count=count+1\r\nprint(count)", "# your code goes here\r\nn=input()\r\ns=set()\r\nfor i in range(len(n)):\r\n\tif n[i]>='a' and n[i]<='z':\r\n\t\ts.add(n[i])\r\nprint(len(s))", "s=input()\r\ns=s.replace('{','')\r\ns=s.replace('}','')\r\ns=s.replace(',','')\r\ns=s.replace(' ','')\r\nk=set()\r\nfor i in s:\r\n if i not in k:\r\n k.add(i)\r\nprint(len(k))\r\n", "s = input()\r\nd = \"qwertyuiopasdfghjklzxcvbnm\"\r\na = set()\r\n\r\nfor i in range(len(s)):\r\n\tif s[i] in d:\r\n\t\ta.add(s[i])\r\n\r\nprint(len(a))", "word = input()\r\nword = word.replace(\",\",\"\" )\r\nword = word.replace(\"{\",\"\" )\r\nword = word.replace(\"}\",\"\" )\r\nword2 = set(word.split())\r\nprint(len(word2))", "li=input()\r\ns=set(li)\r\nif len(s)<=3:\r\n print(len(s)-2)\r\nelse:\r\n print(len(s)-4)", "s=input()\r\ns1=set(s[1:-1].replace(',','').replace(' ',''))\r\nprint(len(s1))", "text = input().split(', ')\r\nif len(text) == 1:\r\n if text[0] == '{}':text = []\r\n else:text[0] = text[0][1] \r\nelse:\r\n text[0] = text[0][1]\r\n text[len(text) - 1] = text[len(text) - 1][0]\r\nnewlist = []\r\nfor i in text:\r\n if i not in newlist:\r\n newlist.append(i)\r\nprint(len(newlist))", "letters = input()\r\ndistinct_letters = set(letters[1:-1].replace(', ', ''))\r\n\r\n# Count the number of distinct letters\r\nprint(len(distinct_letters))\r\n", "str = input()\r\ns = set()\r\nfor char in str:\r\n if char.islower():\r\n s.add(char)\r\nprint(len(s))\r\n", "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\ns=fgs()\r\nd=''\r\nfor i in range(1,len(s)-1):\r\n if s[i]!=',' and s[i]!=' ':\r\n d+=s[i]\r\nprint(len(set(d)))", "s = input()\r\nfiltereds = s.replace('{', '').replace('}', '').replace(',', '').replace(' ', '')\r\nprint(len(set(filtereds)))", "a=input()\r\nsett=set()\r\nfor i in a:\r\n if i.isalpha():\r\n sett.add(i)\r\n\r\nprint(len(sett))", "h=input()\r\ns1=\"\".join(c for c in h if c.isalpha())\r\nprint(len(set(s1)))", "s = set(input())\r\ns.discard(\"{\")\r\ns.discard(\"}\")\r\ns.discard(\" \")\r\ns.discard(\",\")\r\nprint(len(s))", "a = input()\r\na = set(a[1:-1].split(\", \"))\r\nif a == {\"\"}:\r\n print(0)\r\nelse:\r\n print(len(a))\r\n", "s = input()\r\nans = set()\r\nfor i in s:\r\n if i not in \"{} ,\":\r\n ans.add(i)\r\nprint(len(ans))", "s = input()\nmy_set = set()\n\nfor i in s:\n if i.isalpha() is True:\n my_set.add(i)\n\nprint(len(my_set))\n\n# Tine Complexity : O(n)\n\t \t \t \t \t\t\t\t \t\t \t \t \t \t \t", "s = input()\nx = s[1:-1].split(\", \")\nx.sort()\ntotal = 0\nanterior = \"\"\n\nfor i in range(len(x)):\n if x[i] != anterior:\n total += 1\n anterior = x[i]\n \nprint(total)", "s=input()\r\na={'{':\"\",\"}\":\"\",\",\":\"\" ,\" \":\"\"}\r\nfor i,j in a.items():\r\n s=s.replace(i,j)\r\n\r\nprint(len(set(s)))", "n = input()\nx = n.replace('{','')\ny = x.replace('}','')\nm = y.split(', ')\nif m[0] != '':\n p = set(m)\n print(len(p))\nelse:\n print(0)", "s = list(input().split(','))\r\ns1 = ''.join(s)\r\ns1 = s1.replace('{','').replace('}','').replace(' ','')\r\nd =set()\r\nfor i in s1:\r\n d.add(i)\r\nprint(len(d))\r\n", "str=input().strip('{}')\r\nif not str:\r\n print(0)\r\nelse:\r\n str1=str.split(', ')\r\n str2=set(str1)\r\n print(len(str2))\r\n", "s = input()\r\n\r\ns = s.replace(\"{\", \"\")\r\ns = s.replace(\"}\", \"\")\r\ns = s.replace(\",\", \"\")\r\n\r\na = set(s.split())\r\n\r\nprint(len(a))\r\n", "print(len({char for char in input() if 97 <= ord(char) <= 122}))\r\n", "string = input().replace('{', '')\r\nstring = string.replace('}', '')\r\nstring = string.split(', ')\r\nset1 = {i for i in string if i != ''}\r\nprint(len(set1))\r\n", "input_str = input().strip()\r\n\r\ninput_str = input_str[1:-1]\r\n\r\nif input_str == \"\":\r\n print(0)\r\nelse:\r\n letters = input_str.split(\", \")\r\n\r\n distinct_letters = set()\r\n\r\n for letter in letters:\r\n distinct_letters.add(letter)\r\n\r\n print(len(distinct_letters))", "import string\r\ns=input()\r\nletters=list(string.ascii_letters)\r\nres=set()\r\nfor i in s:\r\n if i in letters:\r\n res.add(i)\r\nprint(len(res))\r\n \r\n ", "str = input()\nif len(str[1:-1]) == 0:\n print(0)\nelse:\n print(len(set(str[1:-1].split(', '))))\n \t \t\t\t \t\t \t \t\t\t\t\t \t\t \t\t", "characters = input()\r\ncnt=0\r\ndic={}\r\nfor c in characters:\r\n if c.isalpha():\r\n if c not in dic:\r\n cnt+=1\r\n dic[c]=True\r\n \r\nprint(cnt)", "lst = set(map(str, input().strip('{}').split(', ')))\r\nif lst == {''}:\r\n print (0)\r\nelse:\r\n print (len(lst))\r\n", "s = input()\r\nletters = [c for c in s if c.isalpha()]\r\ndistinct_letters = set(letters)\r\nprint(len(distinct_letters))", "n = str(input())\r\nunique = []\r\ncount = 0\r\nfor i in n:\r\n if i == \",\" or i == \"{\" or i == \"}\" or i == \" \":\r\n continue\r\n else:\r\n if i not in unique:\r\n unique.append(i)\r\n count += 1\r\nprint(count)", "l=list(set(input()))\r\ncount=0\r\nfor i in range(len(l)):\r\n if l[i]>='a' and l[i]<='z':\r\n count+=1 \r\nprint(count)", "def A_pra(s):\n count = set()\n for i in s:\n if i == '{' or i == ',' or i == '}' or i == ' ':\n continue\n count.add(i)\n return len(count)\n\nif __name__ == '__main__':\n s = input()\n print(A_pra(s))\n \t\t \t\t\t\t\t\t\t\t\t\t\t\t \t \t\t \t\t\t", "line = input()[1:-1].split(', ')\r\ns = set(line)\r\ntry:\r\n s.remove('')\r\nexcept Exception:\r\n pass\r\nprint(len(s))", "# Input the set of letters\r\ninput_string = input().strip()\r\n\r\n# Check if the input is an empty set\r\nif len(input_string) == 2: # An empty set has length 2 due to '{}'\r\n print(0)\r\nelse:\r\n # Extract the letters between the opening and closing brackets\r\n letters = input_string[1:-1].split(\", \")\r\n\r\n # Create a set to store distinct letters\r\n distinct_letters = set()\r\n\r\n # Iterate through the letters and add them to the set\r\n for letter in letters:\r\n distinct_letters.add(letter)\r\n\r\n # Calculate the number of distinct letters\r\n num_distinct_letters = len(distinct_letters)\r\n\r\n # Output the result\r\n print(num_distinct_letters)\r\n", "def Letters(data):\r\n\r\n unq_lst = []\r\n\r\n for i in range(len(data)):\r\n\r\n if 'a' <= data[i] <= 'z' and data[i] not in unq_lst:\r\n unq_lst += [data[i]]\r\n\r\n return len(unq_lst)\r\n\r\nprint(Letters(input()))", "dictory = input()\r\nlst = []\r\nfor i in dictory:\r\n if i != '{' and i != '}' and i != ',' and i != ' ':\r\n lst.append(i)\r\nprint(len(set(lst)))", "g=input()\r\ng=g.replace(\"{\",\"\")\r\ng=g.replace(\"}\",\"\")\r\ng=g.replace(\", \",\" \")\r\nprint(len(set(g.split())))", "x=input()\r\na=[]\r\nfor i in x:\r\n if i.isalpha() and i not in a:\r\n a.append(i)\r\nprint(len(a))\r\n \r\n\r\n", "# Anton and Letters\r\n\r\nalphabet = list(\"abcdefghijklmnopqrstuvwxyz\")\r\n\r\ndistinct_letters = []\r\n\r\nset = input()\r\n\r\nfor character in set:\r\n if character != \"{\" and character != \",\" and character != \" \" and character != \"}\":\r\n if character not in distinct_letters:\r\n distinct_letters.append(character)\r\n\r\nprint(len(distinct_letters))", "q = []\r\na = input()[1:-1].split(',')\r\nc = ''.join(a)\r\nfor i in c:\r\n if i != ' ':\r\n q.append(i)\r\nprint(len(set(q)))", "s = set(input())\r\nprint (len(s)-2-list(s).count(' ')-list(s).count(','))", "b = []\r\na = input()\r\na = a.replace(\",\",\"\")\r\na = a.replace(\"{\",\"\")\r\na = a.replace(\"}\",\"\")\r\na = a.split()\r\nfor i in range(len(a)):\r\n if a[i] in b:\r\n pass\r\n else:\r\n b += [a[i]]\r\nprint(len(b))", "n = input()\nx = n.strip(\"{}\")\ns = \"\"\nss = \"\"\nl = []\nfor i in x:\n if (i != \" \"):\n s += i\nfor j in s:\n if (j != \",\"):\n ss += j\nfor k in ss:\n if k not in l:\n l.append(k)\nprint(len(l))\n", "f = input()\r\ng = [x for x in f if x in \"abcdefghijklmnopqrstuvwxyz\"]\r\nprint(len(set(g)))", "string = input()[1:-1].split(', ')\r\n\r\nif string[0] == '':\r\n print(0)\r\nelse:\r\n print(len(set(string)))", "s = input().strip('{}')\r\nif s:\r\n s = set(s.split(', '))\r\n print(len(s))\r\nelse:\r\n print(0)", "a=input()\nb=set()\nfor i in range(0, len(a)):\n if a[i] != '{' and a[i] != '}' and a[i] != ',' and a[i] !=' ' :\n b.add(a[i])\nprint(len(b)) \n \t \t\t \t\t \t\t\t\t \t\t \t\t \t \t\t", "x=input()\r\n\r\nx=set(x)\r\ny=['{',\"'\",'}',' ',',']\r\ncon=0\r\nfor i in x:\r\n if i not in y:\r\n con+=1\r\n\r\nprint(con )", "\r\nremove = ['{', ',', ' ', '}']\r\nstring = [x for x in input() if x not in remove]\r\nprint(len(set(string)))\r\n", "import string\r\nli=list(string.ascii_lowercase)\r\nans=set()\r\ns=input()\r\nfor i in s:\r\n for j in li:\r\n if i==j :\r\n ans.add(i)\r\nprint(len(ans))\r\n ", "s = input()\r\ncount = 0\r\nfor i in range(len(s)):\r\n if('a' <= s[i] <= 'z'):\r\n count += 1\r\n s = s.replace(s[i],'0')\r\nprint(count)", "def distinct_characters(s):\r\n return len(set(s.replace(\"{\", \"\").replace(\"}\", \"\").replace(\",\", \"\").replace(\" \", \"\")))\r\n\r\ns = input()\r\n\r\nresult = distinct_characters(s)\r\nprint(result)\r\n", "def check_len(s: set):\n freq = {}\n s1 = \"\".join(c for c in s if c.isalnum())\n for char in s1:\n freq[char] = freq.get(char, 0) + 1\n return len(freq)\n\n\ninput_string = input()\nle = check_len(input_string)\nprint(le)\n\n\t\t\t\t \t\t \t \t\t\t\t\t \t \t\t\t", "s = input()[1:-1].split(', ')\r\nprint(len({char for char in s}) if s[0] != '' else 0)", "anton_set = input()\r\nlst = []\r\nfor i in anton_set:\r\n for j in range(97, 123):\r\n if i == chr(j):\r\n lst.append(i)\r\nnew_set = set(lst)\r\nprint(len(new_set))", "def main(s):\r\n return len(set(s)) if s[0] != \"\" else 0\r\n\r\nif __name__ == \"__main__\":\r\n s = input()[1:-1].split(\", \")\r\n\r\n print(main(s))", "def count_unique_letters(description):\r\n letters = set(description[1:-1].replace(\", \", \"\"))\r\n return len(letters)\r\ndescription = input().strip()\r\nresult = count_unique_letters(description)\r\nprint(result)", "l = input().replace(\",\",\"\").replace(\"{\",\"\").replace(\"}\",\"\").replace(\" \",\"\")\nprint(len(set(l)))\n\t\t \t \t\t\t\t \t \t\t\t\t \t \t \t\t\t\t", "ss=input();ans=set()\r\nfor i in ss:\r\n if i.isalpha():ans.add(i)\r\nprint(len(ans)) ", "string = input().replace('{','').replace('}','').replace(' ','').split(',')\n\nuniqueletters = set()\nfor char in string:\n if char != '':\n uniqueletters.add(char)\n\nprint(len(uniqueletters))\n\n \t\t\t\t\t\t\t \t\t\t\t\t \t \t \t\t \t \t", "l = input() \r\ns = set()\r\nfor i in range(0,len(l)) :\r\n if 65<=ord(l[i])<=122:\r\n s.add(l[i]) \r\nprint(len(s))", "x = set(input())\r\ncount = 0\r\n\r\nfor i in x:\r\n if i.isalpha():\r\n count += 1\r\n\r\nprint(count)\r\n", "s = input()\r\nif s == \"{}\":\r\n print(0)\r\nelse:\r\n s = s.split(\"{\")\r\n s = s[1]\r\n s = s.split(\"}\")\r\n s = s[0]\r\n s = s.split(\", \")\r\n s = set(s)\r\n print(len(s))", "s = list(input())\r\nl = []\r\nfor i in s:\r\n if i not in '{}, ':\r\n l.append(i)\r\ns = set(l)\r\nprint(len(s))", "s=input()\nif(len(s)>2):\n a=s[1::3]\n u=set(a)\n print(len(u))\nelse:\n print(0)\n\t \t\t\t \t \t\t\t\t\t \t\t \t\t \t\t \t", "input_set = input().strip() \r\nletters = input_set[1:-1].split(\", \")\r\nletters = [letter for letter in letters if letter]\r\ndistinct_letters = set(letters) \r\nnum_distinct_letters = len(distinct_letters) \r\nprint(num_distinct_letters)", "s = input()\nl = set(s[1:-1].split(\", \"))\nans = len(l)\nif \"\" in l:\n ans-=1\nprint(ans)\n \t\t\t\t\t\t \t\t \t \t\t \t \t \t\t\t\t", "s = input()\r\n\r\na = s.replace(\"{\",\"\").replace(\"}\",\"\").split(\", \")\r\n\r\nfinal = len(set(a)) if a[0] != \"\" else 0\r\n\r\nprint(final)", "x=set(input().strip(\"{\").strip(\"}\").split(\", \"))\r\nprint(0 if x=={''} else len(x))", "kl=set(input())\r\nnm=str(kl)\r\nco=0\r\nfor i in nm:\r\n if i.isalpha():\r\n co+=1 \r\nprint(co)", "from collections import Counter\r\n\r\ndef getNumberOfDistinctLatins(x: str) -> int:\r\n return len(Counter(filter(str.isalpha, x)))\r\n\r\n\r\nstring = input()\r\nprint(getNumberOfDistinctLatins(string))", "a=set(input())\r\nx=list(a)\r\ns=0\r\nfor i in a:\r\n if i==\"{\" or i==\" \" or i==\",\" or i==\"}\":\r\n continue\r\n else:\r\n s+=1\r\nprint(s)", "s=input()\r\ns=s.replace(' ','')\r\nif(len(s)<=3):\r\n print(len(set(s))-2)\r\nelse:\r\n print(len(set(s))-3)", "x=input()\r\nl=[]\r\nfor i in x:\r\n if i in \"abcdefghijklmnopqrstuvwxyz\":\r\n if i not in l:\r\n l.append(i)\r\nprint(len(l))\r\n", "a=set(input()) ; print(len(a)-2 if \",\" not in a else len(a)-4)", "s = input()\nc = 0\nfor i in range(len(s)):\n if \"a\" <= s[i] <= \"z\":\n c += 1\n s = s.replace(s[i], '.')\nprint(c)\n \t \t \t\t \t\t\t \t \t\t\t \t \t\t", "a = [i for i in input()[1:-1].split(\", \")]\r\n \r\n \r\ndef main(a):\r\n if len(a) == 1 and not a[0]:\r\n return 0\r\n return len(set(a))\r\n \r\nprint(main(a))", "n = input()\r\nletset = set()\r\nfor i in range(1,len(n)-1,3):\r\n letset.add(n[i])\r\nprint(letset.__len__())", "def verificar_elementos(cadena1):\n elementos_eliminar = [\", \", \"}\", \"{\"]\n for elemento in elementos_eliminar:\n cadena1 = cadena1.replace(elemento, \"\")\n cadena1 = list(set(cadena1))\n\n return len(cadena1)\n\nDigitos = input()\nprint(verificar_elementos(Digitos))\n\n\n\n \t \t\t\t \t \t\t \t\t \t \t\t \t", "list_int = input()\r\nlist_string=[]\r\nfor x in list_int:\r\n if x!='{' and x!=',' and x!='}' and x!=' ':\r\n list_string.append(x)\r\nmylist = list(dict.fromkeys(list_string))\r\nprint(len(mylist))", "def count_distinct_letters(s):\r\n letters_set = set()\r\n for char in s:\r\n if char.isalpha():\r\n letters_set.add(char)\r\n return len(letters_set)\r\n\r\n# Input\r\ninput_string = input()\r\n\r\n# Output\r\nprint(count_distinct_letters(input_string))\r\n", "i = input()\r\nword_set = set()\r\nletters = [chr(x) for x in range(97,123)]\r\nfor j in i:\r\n word_set.add(j)\r\ncount =0\r\nfor s in word_set:\r\n if s in letters:\r\n count+=1\r\nprint(count)", "import string\r\n\r\nall_lower_case_letter = string.ascii_lowercase\r\n\r\ncount = 0\r\nlitter = input()\r\nnewLetter = []\r\n\r\nfor ch in litter:\r\n if ch in all_lower_case_letter:\r\n newLetter.append(ch)\r\nlitter = []\r\nfor ch in newLetter:\r\n if ch not in litter:\r\n litter.append(ch)\r\n count += 1\r\n \r\nprint(count)", "s = input()\r\ns = s.strip('{}') \r\nelements = [e.strip() for e in s.split(',')]\r\nunique_elements = set(elements)\r\ncount = len(unique_elements)\r\nif count == 1 and '' in unique_elements:\r\n count = 0\r\nprint(count)\r\n", "a = input()\r\nb = a[1:-1]\r\nc = b.split(', ')\r\nif c[0] == '':\r\n e = 0\r\nelse:\r\n e = len(set(c))\r\n \r\nprint(e)", "anton = input()\r\nanton = anton.replace(\"{\", \"\").replace(\"}\", \"\").replace(\",\", \"\").replace(\" \", \"\")\r\nantonLetters = set()\r\nfor i in anton:\r\n antonLetters.add(i)\r\nprint(len(antonLetters))", "a = (input()[1:-1]).split(', ')\r\n\r\nk = ''\r\nfor x in a:\r\n if x not in k: k+=x\r\nprint(len(k))", "from string import ascii_letters as s\r\ng=set(filter(lambda n:n in s,input()))\r\nprint(len(g))", "value = input()\r\ntarget = []\r\nfor i in range(len(value)):\r\n if value[i] in \"{, }\" or value[i] in target:\r\n continue\r\n target.append(value[i])\r\nprint(len(target))\r\n", "x=input()\r\nif(x==\"{}\"):\r\n print(0)\r\nelse:\r\n if(len(set(x))==3):\r\n print(1)\r\n else:\r\n print(len(set(x))-4)", "s = input()\r\nif s == \"{}\":\r\n print(0)\r\nelse:\r\n s = s[1:-1]\r\n letters = s.split(\", \")\r\n distinct_letters = set(letters)\r\n print(len(distinct_letters))\r\n", "j=input()\r\ny=len(j)\r\nd=len(set(j))\r\nif(y>5):\r\n print(d-4)\r\nif(y==2):\r\n print(0)\r\nif(y==3):\r\n print(1)", "s = input()[1:-1]\r\na = set()\r\nfor c in s:\r\n if c.isalpha():\r\n a.add(c)\r\nprint(len(a))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 24 04:12:55 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\n\r\ns = input()\r\nd=dict()\r\nfor i in s:\r\n if i.isalpha():\r\n d[i] = d.get(i,0) + 1\r\n \r\nprint(len(d))\r\n \r\n\r\n", "s = input()\n\n\nletters = set(s[1:-1].replace(', ', ''))\n#Hi\nprint(len(letters))\n\t\t \t\t \t\t \t\t \t\t \t", "def solve():\r\n # Your code goes here\r\n pass \r\n\r\ndef main():\r\n print(len(set(input().lower()) & set('abcdefghijklmnopqrstuvwxyz')))\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=input()\r\nz=set()\r\nfor i in s:\r\n if i.isalpha():\r\n z.add(i)\r\nprint(len(z))\r\n", "a = input()\r\nb = a[1:len(a)-1].split(', ')\r\nprint(len(set(b)) if a != '{}' else 0)\r\n", "v1=input()\r\nimport string\r\ngg=string.ascii_letters\r\nv1=v1.split(\",\")\r\nb=[]\r\nfor i in v1:\r\n for j in i:\r\n if j in gg:\r\n b.append(j)\r\n\r\nprint(len(set(b)))", "s = str(input())\r\nb = []\r\nfor i in s:\r\n o = ord(i)\r\n if (o in range(97,123)) and (o not in b):\r\n b.append(o)\r\nprint(len(b))", "s=input()\r\nl=[]\r\nm=[]\r\nfor i in s:\r\n if(ord(i)<=90 and ord(i)>=65):\r\n l.append(i)\r\n elif(ord(i)>=97 and ord(i)<=122):\r\n l.append(i)\r\nfor j in l:\r\n if(j not in m):\r\n m.append(j)\r\nprint(len(m))", "input_str = input()\r\nif input_str == '{}':\r\n print(0)\r\nelse:\r\n letters = set(input_str[1:-1].split(', '))\r\n print(len(letters))", "a = input()\r\nb = []\r\nfor i in range(1 , len(a) , 3):\r\n b.append(a[i])\r\nif ord(b[0]) < 96 or ord(b[0]) > 123:\r\n print(\"0\")\r\nelse:\r\n c = [0] * 26\r\n for i in range(len(b)):\r\n c[ord(b[i]) - 97] = 1\r\n sum = 0\r\n for i in range(26):\r\n if c[i] == 1:\r\n sum += 1\r\n print(sum)", "# Read input\r\ns = input()\r\n\r\n# Check if the set is empty\r\nif s == \"{}\":\r\n distinct_letters = 0\r\nelse:\r\n # Extract the letters from the set\r\n letters = set(s[1:-1].split(\", \"))\r\n\r\n # Count the number of distinct letters\r\n distinct_letters = len(letters)\r\n\r\n# Print the result\r\nprint(distinct_letters)", "s = input()\r\ns = s.replace('{','').replace('}','').replace(',','').replace(' ','')\r\nst = set(s)\r\nprint(len(st))", "s=input()\r\ns=s[1:-1]\r\ns=s.replace(',','')\r\ns=s.replace(' ','')\r\ns=set(s)\r\nprint(len(s))\r\n", "s = input()[1:-1].split(', ')\r\nif s[0]=='': print(0)\r\nelse:\r\n ans = set(s)\r\n print(len(ans))", "s = list(input()[1:-1:3].strip())\r\nprint(len({*s}))", "a = input()[1:-1]\r\nans = set()\r\n\r\nfor i in a:\r\n if i.isalpha():\r\n ans.add(i)\r\nprint(len(ans))\r\n\r\n", "# Read the input string\r\ninput_string = input()\r\n\r\n# Extract the letters between the brackets\r\nletters_inside_brackets = input_string[1:-1]\r\n\r\n# Check if the string is empty or not\r\nif letters_inside_brackets:\r\n # Split the letters by comma and space\r\n letters_list = letters_inside_brackets.split(', ')\r\n\r\n # Use a set to store distinct letters\r\n distinct_letters = set(letters_list)\r\n\r\n # Print the number of distinct letters\r\n print(len(distinct_letters))\r\nelse:\r\n print(0)\r\n", "i=input()\r\nif i[1]=='}':\r\n print(0)\r\nelse:\r\n j=''\r\n for jj in i:\r\n if jj==\" \":\r\n pass\r\n else:\r\n j+=jj\r\n v=len(i)\r\n f=j[1:v-1:2]\r\n d=set(f)\r\n p=len(d)\r\n print(p)", "s=input()\r\nl=[]\r\nfor i in range(len(s)):\r\n if s[i]!=\"{\" and s[i]!=\"}\" and s[i]!=\",\" and s[i] not in l and s[i]!=\" \":\r\n l.append(s[i])\r\nprint(len(l))", "s = input()\r\ns = s[1:-1]\r\ns = s.split(', ')\r\ns = set(s)\r\nif(s == {''}):\r\n print(0)\r\nelse:\r\n print(len(set(s)))\r\n", "\r\ns = input()\r\nif s=='{}':\r\n print(0)\r\nelse:\r\n s = s[1:-1]\r\n array = s.split(\", \")\r\n print(len(set(array)))\r\n\r\n", "s = input()\r\nans = set(x for x in s if str.isalpha(x))\r\n\r\nprint(len(ans))", "# Read the input string\r\ninput_string = input().strip()\r\n\r\n# Initialize an empty set to store distinct letters\r\ndistinct_letters = set()\r\n\r\n# Iterate through the input string, skipping the curly brackets and spaces\r\nfor char in input_string:\r\n if char.isalpha(): # Check if the character is a letter\r\n distinct_letters.add(char)\r\n\r\n# Print the number of distinct letters\r\nprint(len(distinct_letters))\r\n", "s = input()\r\ns = s[1:-1]\r\nd = dict()\r\ns = s.split(', ')\r\nfor elem in s:\r\n d[elem] = elem\r\nif d.get('') is None:\r\n print(len(d))\r\nelse:\r\n print(0)", "n = input()\r\na = []\r\nfor i in n:\r\n if i=='{' or i=='}' or i==',' or i==' ':\r\n continue\r\n else:\r\n a.append(i)\r\nn = set(a)\r\nprint(len(n))", "word = input()\n\ncnt = 0\nmyword = \"\"\n\nfor i in range(0, len(word), 1):\n if word[i].isalpha() == True and word[i] not in myword:\n cnt += 1\n myword += word[i]\n\nprint(cnt)\n\n\t \t\t\t\t\t \t \t\t \t\t\t\t\t \t \t", "l=input()\r\nl=[str(i) for i in l]\r\nl.remove('{')\r\nl.remove('}')\r\nk=0\r\nl=set(l)\r\nif len(l)<=1:\r\n print(len(l))\r\nelse:\r\n print(len(l)-2)", "Str=input()\r\nl=set()\r\n\r\nfor i in range(1, len(Str), 3):\r\n if 'a' <= Str[i] <= 'z':\r\n l.add(Str[i])\r\nprint(len(l))", "s=input()\r\no=\"qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM\"\r\nl=set(s)\r\ncounter=0\r\nfor i in l :\r\n if i in o :\r\n counter+=1\r\nprint(counter)", "q=input()\r\nprint(len(set(q+', '))-4)", "string1 = input()\r\nstring=[]\r\nfor i in string1:\r\n if i!=\" \" and i!=\"{\" and i!=\"}\" and i!=\",\":\r\n string.append(i)\r\narr = []\r\nfor i in string:\r\n if i not in arr:\r\n arr.append(i)\r\nprint(len(arr))", "string = input()\r\nstring = string.lstrip('{')\r\nstring = string.rstrip('}')\r\nstring = string.replace(', ', '')\r\nprint(len(set(string)))\r\n", "s =set(input().replace(\"{\",\"\").replace(\"}\",\"\").replace(\", \",\"\"))\r\nprint(len(s))\r\n", "def solution():\r\n st = input()\r\n un = set()\r\n for i in range(1, len(st) - 1):\r\n if st[i].isalpha():\r\n un.add(st[i])\r\n print(len(un))\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n\r\n\r\n", "s = input()\r\nres = set()\r\nfor ch in s:\r\n if ch.isalpha():\r\n res.add(ch)\r\nprint(len(res))", "n=input()\r\nn=n.replace(\",\",\"\")\r\nn=n.replace(\"{\",\"\")\r\nn=n.replace(\"}\",\"\")\r\nn=n.replace(\" \",\"\")\r\nn=set(n)\r\n# print(n)\r\nprint(len(n))\r\n\r\n ", "a = input()\r\na = set(a)\r\nrem_ele = [',', '}', '{', ' ']\r\na = a - set(rem_ele)\r\nprint(len(a))", "txt = input()\r\nif txt == \"{}\": print(\"0\")\r\nelse:\r\n txt = txt.replace(\" \", \"\").split(\",\")\r\n txt[0], txt[len(txt) - 1] = txt[0][1:], txt[len(txt) - 1][0]\r\n ans = []\r\n for _ in txt:\r\n if _ not in ans: ans.append(_)\r\n print(len(ans))", "str1=input()\r\nstr1=str1[1:-1]\r\nstr1=str1.replace(\",\",\"\")\r\nstr1=str1.replace(\" \",\"\")\r\nlist1=[]\r\nfor x in str1:\r\n list1.append(x)\r\nlist1=list(set(list1))\r\nprint(len(list1))", "s = input()\ns1 = []\nlength = len(s)\nnum = 0\ni=0\nwhile (i < length):\n if (s[i] not in s1):\n num += 1\n s1.append(s[i])\n i += 1\nquchu=2\nif(' 'in s):\n quchu+=1\nif(','in s):\n quchu+=1\nprint(num-quchu)\n\t \t \t\t \t\t\t\t\t \t \t \t \t\t\t\t \t \t", "line = input()\r\nletters = set() # empty set\r\nfor ch in line:\r\n if ch != '{' and ch != '}' and ch != ',' and ch != ' ':\r\n letters.add(ch)\r\nprint(len(letters))", "inp = [x for x in input() if x.isalpha()]\r\nprint(len(set(inp)))", "s =input()\r\nb = list(s)\r\nb.sort()\r\nc = 0 \r\nfor i in range(len(b)):\r\n if b[i] != \"{\" and b[i] != \",\" and b[i] != \"}\" and b[i] !=\" \":\r\n if b[i] !=b[i+1]:\r\n c+=1\r\nprint(c)", "s=input()\r\nl=set([])\r\nfor i in s:\r\n if i.isalpha():\r\n l.add(i)\r\nprint(len(l))", "s = input()\r\ns = s.strip('{').strip('}').strip()\r\nif len(s) <= 1:\r\n print(len(s))\r\nelse:\r\n print(len(set(s.split(', '))))", "cnt, s, s1 = 0, input(), set()\r\nfor i in range(len(s)):\r\n if s[i].isalpha(): s1.add(s[i])\r\nprint(len(s1))\r\n", "s = input()\r\nwarning = \" ,{}\"\r\nfor i in s:\r\n if i in warning:\r\n s = s.replace(i, \"\")\r\n\r\nprint(len(set(s)))", "s=\"qwertyuiopasdfghjklzxcvbnm\"\nn=input()\nc=0\nfor i in range(26):\n if n.find(s[i])!=-1:\n c+=1\nprint(c)\n \t\t\t \t\t\t \t\t\t\t \t \t\t \t\t\t \t\t\t", "a = input()\r\ns = 0\r\nch = \"\".join(a[1:len(a)-1].split(\", \"))\r\n\r\nfor i in range(len(ch)):\r\n if ch[i] not in ch[:i]:\r\n s += 1\r\n\r\nprint(s)\r\n", "string = input()\nif string == \"{}\":\n print(0)\n exit()\nstring = string.replace(\"{\", \"\")\nstring = string.replace(\"}\", \"\")\nstring = set(string.split(\", \"))\n\nprint(len(string))", "s=input()\r\nk=set()\r\ns=s.replace('{','')\r\ns=s.replace('}','')\r\ns=s.replace(',','')\r\ns=s.replace(' ','')\r\nfor i in range (0,len(s)):\r\n k.add(s[i])\r\nprint(len(k))", "k = input()\nsa = set()\nfor a in k:\n\n if a >= 'a'and a <= 'z':\n sa.add(a)\nprint(len(sa))\n\t \t\t \t\t\t\t \t\t \t\t \t \t \t\t \t", "a=input()\r\nl=[]\r\nfor i in a:\r\n if i in 'abcdefghijklmnopqrstuvwxyz':\r\n l.append(i)\r\nb=set(l)\r\nprint(len(b))", "n=input()\r\nu=[]\r\ncount=0\r\nfor i in n:\r\n if((i==\",\") or (i==\"{\") or (i==\"}\") or (i==\" \")):\r\n continue\r\n else:\r\n if i not in u:\r\n u.append(i)\r\n count+=1\r\nprint(count)", "a=input()\r\ne=a.strip('{}').split(', ')\r\nif e==['']:\r\n print(\"0\")\r\nelse:\r\n b=set(e)\r\n print(len(b))", "str = input()\r\ns = set(str)\r\n\r\nk = len(s)\r\nif(k>3):\r\n print(int(k-4))\r\nelif(k==3):\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "small = \"abcdefghijklmnopqrstuvwxyz\"\n\ns = input()\n\nc = 0\nfor i in range(26):\n if s.find(small[i]) != -1:\n c += 1\n\nprint(c)\n\n \t\t\t\t \t \t\t\t\t \t\t\t\t \t \t\t \t", "x=set(input())\r\ncount=0\r\nfor i in x:\r\n if i>='a' and i<='z':\r\n count=count+1\r\nprint(count)\r\n", "n=input()\r\nl=[]\r\nk=[]\r\nfor i in n:\r\n if i.isalpha():\r\n l.append(i)\r\nfor i in l:\r\n if i not in k:\r\n k.append(i)\r\nprint(len(k))", "a=input()\r\nb=set()\r\nfor i in a:\r\n if i.isalpha():\r\n b.add(i)\r\nprint(len(b))", "s=set(input())\r\ns0=str(s)\r\nc=0\r\nfor i in s0:\r\n if i.isalpha():\r\n c+=1 \r\nprint(c)", "import re \nmajmunskiunos = input()\nl=[]\nfor slovo in majmunskiunos:\n if re.match(\"[A-Za-z]\", slovo):\n l.append(slovo)\n\n\nprint(len(set(l)))", "inp = set(input()[1:-1].split(', '))\r\nprint(0 if '' in inp else len(inp))\r\n", "s = input()\r\ns = s.lower()\r\ns = \"\".join(char for char in s if char.isalpha())\r\nmy_set = set(s)\r\nle = len(my_set)\r\nprint(le)", "s=input()\r\nif len(s [ 1 :- 1]) == 0:\r\n print(0)\r\nelse:\r\n print(len(set(s[1 :- 1].split(', '))))", "a=input()\r\nb=len(a)\r\n# print(b)\r\nc=list(a)\r\nd=[]\r\ncoun=0\r\n# c.remove(\"{\")\r\n# c.remove(\"}\")\r\n# print(c)\r\nfor i in range(0,b//3):\r\n d.append(c[1+3*i])\r\n# print(d)\r\nd.sort()\r\n# print(d)\r\nd.append(\"0\")\r\nfor i in range(0,b//3):\r\n if d[i]==d[i+1]:\r\n coun=coun+1\r\nprint(b//3-coun)", "s = input() # 读取输入的字符串\n\n# 使用 set 去除字符串中的重复字符，并将结果转换为列表，即可得到不同字母的个数\ndistinct_letters = list(set(s.replace('{', '').replace('}', '').replace(' ', '').replace(',','')))\n\nprint(len(distinct_letters)) # 输出不同字母的个数\n\n \t\t\t\t\t \t \t\t\t\t \t \t \t\t", "i=input()\r\nn=len(i)\r\nv=i[1:n-1]\r\nt=v.replace(\" \",\"\")\r\nr=t.replace(\",\",\"\")\r\na=set(r)\r\nprint(len(a))", "def main():\r\n s =input()\r\n if len(s)==2:\r\n print(0)\r\n else:\r\n s =set(s[1:len(s)-1].split(\", \"))\r\n print(len(s))\r\n\r\n \r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()", "a = \"abcdefghijklmnopqrstuvwxyz\"\nb = input()\nc = {0}\nfor i in range(len(b)):\n if b[i] in a:\n c.add(b[i])\nprint(len(c) - 1)\n\n\t\t\t \t\t \t \t \t\t \t \t \t \t\t\t", "small=\"abcdefghijklmnopqrstuvwxyz\"\ns=input()\nc=0\nfor i in range(26):\n if s.find(small[i])!=-1:\n c+=1\nprint(c)\n\n\t\t \t \t \t\t\t \t \t\t \t \t \t\t\t\t", "s = input()\r\ndat = set()\r\n\r\nfor char in s:\r\n if char.isalnum():\r\n dat.add(char)\r\n\r\nprint(len(dat))", "bad=['{','}',',',' ']\r\n\r\na=input()\r\n\r\nfor i in bad:\r\n a=a.replace(i,'')\r\n \r\nprint(len(set(str(a))))\r\n\r\n\r\n\r\n", "the_set=input()\nthe_set=the_set[1:-1]\nif (len(the_set)==0):\n print(0)\nelse: \n the_set=the_set.split(\", \")\n the_set=set(the_set)\n print(len(the_set))\n\t \t \t\t \t \t\t\t\t\t \t \t \t \t \t\t\t", "#443A\r\ns=input()\r\nif s==\"{}\":\r\n print(0)\r\nelse:\r\n s=s.replace('{','')\r\n s=s.replace('}','')\r\n l1=s.split(\",\")\r\n l=[i.strip() for i in l1]\r\n l=set(l)\r\n new_le=len(l)\r\n print(new_le)", "\r\n\r\n\r\n\r\n\r\n\r\nQ = input()\r\nletter = set()\r\nfor character in Q:\r\n \r\n \r\n if character.isalpha():\r\n letter.add(character)\r\nprint(len(letter))\r\n \t \t\t \t \t \t \t \t\t \t\r\n \t \t \t \t\t \t \t\t\t \t \t\t\t", "import math\nimport sys\nimport collections\n\ns = str(input())\nvisit = set()\n\nfor c in s:\n if c.isalnum():\n visit.add(c)\n\nprint(len(visit))", "def printDistinct():\r\n s=input()\r\n s=s.replace(\"{\",\"\")\r\n s=s.replace(\"}\",\"\")\r\n s=s.replace(\" \",\"\")\r\n numbers=list(s.split(\",\"))\r\n if len(s)==0:\r\n return 0\r\n distinct=set(numbers)\r\n return len(distinct)\r\n\r\nprint(printDistinct())", "a = input()\n\nif a == '{}':\n print(0)\nelse:\n def count(a):\n\n let = a[1:-1].split(', ')\n\n un_letters = set(let)\n\n return len(un_letters)\n\n\n print(count(a))\n\n\n\n\n\t\t \t \t \t \t\t\t \t\t\t \t\t \t\t\t\t \t", "a = str(input())\r\nb = a.replace(\"{\", \"\")\r\nc = b.replace(\"}\", \"\")\r\nd = c.replace(\",\", \"\")\r\nres = d.split()\r\narr1 = []\r\n\r\nfor x in res:\r\n if x not in arr1:\r\n arr1.append(x)\r\n\r\nlength = len(arr1)\r\nprint(length)", "s=input()\nn=len(s)\nif(len(s[1:n-1]) == 0):\n print(0)\nelse:\n st = set(s[1:n-1].split(', ')) # [ 1, 2 ,3 ] { 1,2,3 }\n print(len(st))\n\t\t \t \t \t\t \t \t \t \t\t \t \t\t", "s = input()\nst = set()\nfor i in s :\n if i >='a' and i <= 'z' :\n st.add(i)\nprint(len(st))\n \t \t\t \t\t \t \t\t \t \t \t\t\t", "def count_distinct_letters(s):\r\n letters = set(s[1:-1].replace(\", \", \"\"))\r\n return len(letters)\r\n\r\ns = input()\r\ndistinct_count = count_distinct_letters(s)\r\nprint(distinct_count)", "s = input()\r\nif len(s) == 2:\r\n print(0)\r\nelse:\r\n s = s[1:-1].split(\", \")\r\n print(len(set(s)))\r\n\r\n", "s=input()\r\nl=set()\r\nfor i in s:\r\n if i!='{' and i!=',' and i!=' ' and i!='}':\r\n l.add(i)\r\nprint(len(l))", "s=set(input()[1:-1].split(', '))\r\ns.discard('')\r\nprint(len(s))\r\n", "def count_distinct_letters(s):\r\n distinct_letters = set()\r\n\r\n for char in s:\r\n if char.isalpha():\r\n distinct_letters.add(char)\r\n\r\n return len(distinct_letters)\r\n\r\ndef main():\r\n string = input().strip()\r\n result = count_distinct_letters(string)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=list(input())\r\nk=[]\r\nfor i in n:\r\n if(i!='{' and i!='}' and i!=',' and i!=' ' and (i not in k)):\r\n k.append(i)\r\nprint(len(k))", "import sys\n\ninput = sys.stdin.readline\n\nwords = list(input())\nword_dict = {}\n\nfor w in words:\n if w.isalpha():\n word_dict[w] = None\n\nresult = len(word_dict)\nsys.stdout.write(f\"{result}\")\n", "s=input()\r\nb=\"{,} \"\r\nlist1=[]\r\nfor x in s:\r\n if x in b:\r\n pass\r\n else:\r\n list1.append(x)\r\nlist1=set(list1)\r\nprint(len(list1))", "n = input()\r\nl = []\r\nfor k in n:\r\n if k == \"{\" or k == \"}\" or k == \",\" or k == \" \":\r\n pass\r\n else:\r\n l.append(k)\r\nprint(len(list(dict.fromkeys(l))))", "letters = input()\r\n\r\nstring = letters.replace(\"{\", \"\").replace(\"}\", \"\").replace(\" \", \"\")\r\n\r\nelement_list = string.split(\",\")\r\n\r\nnew_letters = set(element_list)\r\n\r\nif letters == \"{}\":\r\n print(0)\r\n\r\nelse:\r\n print(len(new_letters))", "def l(str1):\r\n l2=[]\r\n if str1==['{','}']:\r\n return 0\r\n for i in str1:\r\n if i>='a' and i<='z':\r\n l2.append(i)\r\n return len(set(l2))\r\nstr1=input()\r\nstr1=list(str1)\r\nprint(l(str1))", "a = (input())\r\nans = 0\r\nf = []\r\nfor i in a:\r\n if i!='}':\r\n if i!='{':\r\n if i!=',':\r\n if i!=' ':\r\n if f.count(i)==0:\r\n f.append(i)\r\n ans += 1\r\nprint(ans)", "i = input()\r\nl = i[1:-1].split(\", \")\r\nd_l = set()\r\nfor letter in l:\r\n if letter and letter != \" \":\r\n d_l.add(letter.strip())\r\nprint(len(d_l))", "s = input().split(\", \")\r\n\r\ns[0] = s[0][1]\r\ns[-1] = s[-1][0]\r\n\r\nif s[0] =='}':\r\n print(0)\r\nelse:\r\n print(len(set(s)))", "#### Решение задач проекта CODEFORSES, Задача 443A\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\nA. Антон и буквы\r\nограничение по времени на тест2 секунды\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nНедавно у Антона появилось множество, состоящие из маленьких латинских букв. Он аккуратно выписал все буквы,\r\nкоторые в него входят в одну строку через запятую. Для красоты он так же добавил в начало этой строки открывающуюся\r\nфигурную скобку, а в конец — закрывающуюся.\r\n\r\nК сожалению, Антон иногда забывал, что уже записал некоторую букву, и выписывал ее снова. Он просит вас посчитать\r\nобщее число различных букв в его множестве.\r\n\r\nВходные данные\r\nВ первой и единственной строке задано описание множества букв. Длина строки не превышает 1000. Гарантируется,\r\nчто строка начинается с открывающейся фигурной скобки, а заканчивается закрывающейся. Между ними через запятую перечислены маленькие латинские буквы. После каждой запятой следует пробел.\r\n\r\nВыходные данные\r\nВыведите единственное число — количество различных букв в множестве Антона.\r\n'''\r\n\r\na1=(input())\r\n#print(a1)\r\n#print(len(a1))\r\n#print(len(set(a1)))\r\nans = len(set(a1)) - 2\r\ns1 = a1.find(' ')\r\nif s1 > 1: ans = ans -2\r\nprint(ans)\r\n \r\n ", "def solve():\r\n s = input().lstrip('{').rstrip('}').split(', ')\r\n st = set(s)\r\n print(0 if s[0] == '' else len(st))\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "my_set = input()\nmy_set = my_set[1:-1].split(', ') \ndistinct_set = [] \n\nfor i in range(len(my_set)):\n if my_set[i] not in distinct_set and my_set[i]!='':\n distinct_set.append(my_set[i])\n \nprint(len(distinct_set))\n \t\t\t\t \t\t\t\t \t \t \t \t\t\t \t\t \t", "s = input()\r\nfound = [False] * 26\r\nfor i in range(1, len(s) - 1, 3):\r\n found[ord(s[i]) - 97] = True\r\nprint(sum(found))\r\n", "inp=set(input())\r\nlis=[]\r\nfor i in inp:\r\n if i ==\"}\" or i==\"{\" or i ==\" \" or i ==\",\":\r\n pass\r\n else:\r\n lis.append(i)\r\nprint(len(set(lis)))", "n=input()\r\nd=[]\r\nfor i in range(1,len(n)):\r\n if(n[i].isalpha()):\r\n d.append(n[i])\r\nd=set(d)\r\nprint(len(d))", "a=input()\r\ns=set()\r\nfor i in a:\r\n if i == '{' or i == '}' or i ==' ' or i==',':\r\n continue\r\n else:\r\n s.add(i)\r\n# print(s)\r\nprint(len(s))\r\n ", "s=input()\r\nl=set() \r\nfor i in range(1,len(s)-1,3):\r\n l.add(s[i])\r\n#print (l)\r\nprint(len(l))", "s = input()\ns_stripped = s[1:-1]\n\nletters = []\nif s_stripped:\n letters = s[1:-1].split(', ')\n\nletters_set = set(letters)\nprint(len(letters_set))\n", "x = input()\r\ns = set(x)\r\nl = len(s)\r\nif l==2:\r\n print(0)\r\nelif l ==3:\r\n print(1)\r\nelse:\r\n print(l-4)", "arr = input()\nif arr == \"{}\":\n print(0)\nelse:\n arr = arr[1:-1]\n print(len(set(arr.split(\", \"))))", "s = input().replace('{', '').replace(',', '').replace('}', '')\r\nx = s.replace(' ', '')\r\nz = set(x)\r\nprint(len(z))", "n = list(input())\r\nn = [x for x in n if x != \"{\" and x != \"}\" and x != \",\" and x != \" \"]\r\nx = set(n)\r\nprint(len(x))", "x = input(\"\")\r\n\r\n#y = set(x)\r\nz = []\r\nfor i in x:\r\n if i ==\"{\" or i ==\"}\" or i== \",\" or i ==\" \":\r\n continue\r\n\r\n else:\r\n z.append(i)\r\nznew= []\r\nfor i in z:\r\n if i not in znew:\r\n znew.append(i)\r\n\r\n\r\nprint(len(znew))\r\n\r\n", "s = input() \ndistinct_chars = set()\n\nfor c in s:\n if c.isalpha():\n distinct_chars.add(c)\n\nprint(len(distinct_chars)) \n\n \t\t\t \t\t \t \t \t \t \t \t", "s=input()\r\nf=set()\r\nfor i in s:\r\n if i.isalpha():\r\n f.add(i)\r\nprint(len(f))", "s=input()\r\nspb=[]\r\nfor i in range(len(s)):\r\n if 97<=(ord(s[i]))<=122:\r\n spb.append(s[i])\r\nspb_new=[]\r\nfor i in range(len(spb)):\r\n if spb[i] not in spb_new:\r\n spb_new.append(spb[i])\r\nprint(len(spb_new))", "s=input()\r\ns=s.replace('{','')\r\ns=s.replace('}','')\r\nwhile ',' in s:\r\n s=s.replace(',','')\r\nd={}\r\nfor i in s:\r\n if i!=' ':\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nprint(len(d))", "s = input()\r\n\r\ns = list(s)\r\n\r\nsc = []\r\n\r\nfor v in s:\r\n if v.isalpha() :\r\n sc.append(v)\r\n\r\nsc = set(sc)\r\n\r\nprint(len(sc))\r\n", "sequence=input()\r\nlast=len(sequence)-1\r\nif(len(sequence)>2):\r\n sequence=sequence[1:last].split(',')\r\n sequence[0]=\" \"+sequence[0]\r\n sequence=set(sequence)\r\n print(len(sequence))\r\nelse:\r\n print(0)", "set_st = {el for el in input()}\r\nset_alp = {chr(el) for el in range(ord('a'), ord('z') + 1)}\r\nset_ans = set_alp & set_st\r\nprint(len(set_ans))\r\n", "import sys\r\n\r\ns = input().strip()\r\na = set(c for c in s if c.islower())\r\n\r\nprint(len(a))\r\n", "import math \r\ndef anton(s):\r\n alist=[f for f in s]\r\n blist=[]\r\n for j in alist:\r\n if j!=\"{\" and j!=\"}\" and j!=\",\" and j!=\" \":\r\n blist.append(j)\r\n return len(set(blist))\r\nf=input()\r\nprint(anton(f))", "a = input()\r\na = a.strip(',')\r\nb = list(a)\r\nb.sort()\r\nc = 0\r\nfor i in range(len(b)):\r\n if b[i] not in {'{', '}', ',', ' '}:\r\n if i == 0 or b[i] != b[i-1]:\r\n c += 1\r\nprint(c)", "def main() -> int:\r\n s = input()\r\n\r\n a = list(map(lambda s: s.lstrip('{').rstrip('}').strip(), s.split(',')))\r\n\r\n if a[0] == '':\r\n return 0\r\n\r\n return len(set(a))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main())\r\n", "s = input()\r\ns = s[1:len(s)-1]\r\ns = s.replace(' ', '')\r\nl = s.split(',')\r\ntemp = []\r\ndistinct = 0\r\nfor i in l:\r\n if i not in temp:\r\n distinct += 1\r\n temp.append(i)\r\nif s != \"\":\r\n print(distinct)\r\nelse:\r\n print(0)\r\n", "n=input()\r\nlst=[]\r\nif n[0]==\"{\" and n[1]==\"}\":\r\n print(0)\r\nelse:\r\n for i in range(1,len(n),3):\r\n if n[i]!=\" \" and n[i]!=\"}\" and n[i]!=\"\":\r\n lst.append(n[i])\r\n lst=set(lst)\r\n print(len(lst))", "s = set(input())\r\ns.remove(\"}\")\r\ns.remove(\"{\")\r\nif \" \" in s:\r\n s.remove(\" \")\r\nif \",\" in s:\r\n s.remove(\",\")\r\nprint(len(s))", "a = input()\r\nnew_string = a[1:-1]\r\n#print(new_string)\r\nmodified_new_String = new_string.split(\", \")\r\nstri = []\r\n\r\n#del new_string[]\r\n#print(new_string)\r\n#new_string = a.split(\",\")\r\nfor s in modified_new_String:\r\n if s not in stri:\r\n stri+=s\r\n#print(stri)\r\nprint(len(stri))\r\n \r\n#print(new_string_wt)", "a = input()\r\nb = a[1:-1]\r\nc = b.split(', ')\r\nif c[0] == '':\r\n d = 0\r\nelse:\r\n d = len(set(c))\r\n\r\nprint(d)\r\n\r\n", "a = input()\r\nans = 0\r\nw = \"qwertyuiopsafdghkjlzxcvbnm\"\r\nfor i in w:\r\n if i in a:\r\n ans += 1 \r\nprint(ans)", "input_line = input()\r\nletters = input_line[1:-1].split(', ')\r\nif letters[0] == '':\r\n num_distinct_letters = 0\r\nelse:\r\n distinct_letters = set(letters)\r\n num_distinct_letters = len(distinct_letters)\r\nprint(num_distinct_letters)\r\n", "s = input()\r\nif (len(s)==2):\r\n print(\"0\")\r\n exit(0)\r\nl=[]\r\nc=0\r\nfor i in range(1,len(s)-1,3):\r\n if (s[i] in l):\r\n c=c\r\n else:\r\n l.append(s[i])\r\n c+=1\r\nprint(c)\r\n", "a = input()\r\nif a == \"{}\":\r\n print(0)\r\n exit()\r\na = a[1:len(a)-1]\r\nst = set()\r\nfor i in range(len(a)):\r\n if a[i] != \" \" and a[i] != ',':\r\n st.add(a[i])\r\nprint(len(st))", "# @name: A. Anton and Letters\r\n# @author: AbrarShakhi\r\n# @link: https://codeforces.com/problemset/problem/443/A\r\n\r\n\r\ndef solution():\r\n _set = input()\r\n _set = _set.replace('{', '')\r\n _set = _set.replace('}', '')\r\n _set = _set.replace(',', '')\r\n\r\n _list = _set.split()\r\n distinct = []\r\n for i in _list:\r\n if i not in distinct:\r\n distinct.append(i)\r\n\r\n print(len(distinct))\r\n\r\n\r\ntc = 1\r\n# tc = int(input())\r\nwhile tc > 0:\r\n solution()\r\n tc -= 1\r\n", "s = input()\nc = 0\nfor i in range(len(s)):\n if s[i] >= 'a' and s[i] <= 'z':\n c += 1\n s = s.replace(s[i],'.')\n \nprint(c)\n\n \t\t\t\t \t \t \t \t\t\t \t \t \t\t\t \t \t \t", "import sys\r\nimport re\r\n\r\nn = input()\r\nn1 = re.sub(\"[{|}|,]\", \"\", n)\r\n\r\nif n == '{}':\r\n print(0)\r\nelse:\r\n print(len(set(n1.split(' '))))\r\n", "a=set(input()+', ')\r\nprint(len(a)-4)", "string = input().strip(\"{}\").split(\", \")\r\nletters = []\r\ncount = 0\r\nfor char in string:\r\n if char not in letters and char != '':\r\n letters.append(char)\r\n count += 1\r\nprint(count)", "ss = input().strip()\r\nif len(ss) == 2:\r\n print(0)\r\n exit()\r\nss = ss[1: -1].split(\", \")\r\n\r\nprint(len(set(ss)))\r\n", "a=input()\r\na=a.strip(',')\r\nb=list(a)\r\nb.sort()\r\ncount=0\r\nfor i in range(len(b)):\r\n if(b[i]!=\"{\" and b[i]!=\"}\" and b[i]!=\",\" and b[i]!=\" \"):\r\n if(b[i]!=b[i+1]):\r\n count+=1\r\nprint(count)", "word = str(input())\r\nword = word.replace(\"{\", \"\")\r\nword = word.replace(\"}\", \"\")\r\nword = word.replace(\",\", \"\")\r\ntab = list(word.split())\r\nnewTab = list(set(tab))\r\nprint(len(newTab))", "word = input()\r\nif len(word) == 2:\r\n print(0)\r\nelse:\r\n word = word[1:len(word) - 1]\r\n objects = word.split(', ')\r\n unique_objects = set(objects)\r\n print(len(unique_objects))", "alphabets = [chr(i) for i in range(ord('a'), ord('z')+1)]\r\nset = str(input())\r\ncount = 0\r\ni = 0\r\nwhile i < len(set):\r\n p = 0\r\n while p < len(alphabets):\r\n if set[i] == alphabets[p]:\r\n count += 1\r\n alphabets.remove(alphabets[p])\r\n p += 1\r\n i += 1\r\nprint(count)\r\n", "n=input()\r\ns=len(n)\r\nans=set()\r\nl=[',' , ' ' , '{','}']\r\nfor i in range(1,s-1):\r\n if n[i] in l:\r\n continue\r\n ans.add(n[i])\r\nprint(len(ans))\r\n ", "s = input()\r\nif len(s) <= 2:\r\n print(0)\r\nelse:\r\n distinct_letters = set(s[1:-1].split(\", \"))\r\n print(len(distinct_letters))\r\n", "a=list(input())\r\na.remove(\"{\")\r\na.remove(\"}\")\r\na=\"\".join(a)\r\na=\" \"+a\r\na=a.split(\",\")\r\nres=[*set(a)]\r\nfor char in res:\r\n if char==\" \":\r\n res.remove(\" \")\r\nprint(len(res))\r\n", "a = input()\r\nb = set(a)\r\nc = list(b)\r\nd=[]\r\nfor i in c:\r\n if i.islower() == True:\r\n d.append(i)\r\nprint(len(d))", "s=input()\r\ns1=s.replace('{','').replace('}','').replace(',','').replace(' ','')\r\nprint(len(set(s1)))", "s = input()\ns = str (s)\nsmall = \"abcdefghijklmnopqrstuvwxyz\"\nc = 0\nfor i in range (26):\n if s.find(small[i]) != -1 :\n c += 1\nprint (c)\n \t\t\t \t\t\t \t \t \t\t\t\t \t \t \t", "input_str = input()\ndistinct_chars = set(filter(str.isalpha, input_str))\nprint(len(distinct_chars))\n\n\t \t \t\t\t \t \t \t \t \t \t \t\t\t\t \t", "s = input()\r\ns = s[1:-1]\r\nif not s:\r\n print(\"0\")\r\nelse:\r\n li = s.split(\", \")\r\n res = set()\r\n for i in li:\r\n res.add(i)\r\n print(len(res)) ", "letters = list(input())\r\nnew_list = []\r\nfor e in letters:\r\n if e not in ('{', ',', ' ', '}'):\r\n new_list.append(e)\r\nletters = new_list\r\nprint(len(set(letters)))", "a = input()\r\na = a.replace(',','')\r\na = a[1:-1]\r\na = a.replace(' ','')\r\na = set(a)\r\nprint(len(a))", "val=input()\r\ncount=[]\r\nfor i in val:\r\n if i not in count and i not in (\"{\",\"}\",\",\",\" \"):count.append(i)\r\nprint(len(count))", "\ninitial_input = input()\ncount = 0\n\nif (initial_input != \"{}\"):\n\n parts = initial_input.split()\n parts[0] = parts[0].replace('{', '')\n parts[-1] = parts[-1].replace('}', '')\n\n\n letters = [0]*26\n for part in parts:\n letter = part.replace(',','')\n letters[ord(letter)-97] += 1\n\n for i in letters:\n if(i != 0):\n count += 1\n\nprint(count)\n \t\t\t\t \t \t\t \t\t\t \t\t\t\t \t\t\t\t\t\t \t", "s = input()\nst = set()\nfor i in range(0, len(s)):\n if (s[i] != '{' and s[i] != '}' and s[i] != ',' and s[i] != ' '):\n st.add(s[i])\nprint(len(st))\n \t \t \t \t\t \t\t\t \t\t \t\t \t", "s = input()\r\ns= s.replace('{', '')\r\ns = s.replace('}', '')\r\ns = s.replace(',', '')\r\ns = s.replace(' ', '')\r\nk = list(set([i for i in s]))\r\nprint(len(k))", "a = input()\r\na = set(a)\r\nif len(a) == 2:\r\n print(0)\r\nelse:\r\n if len(a) == 3:\r\n print(1)\r\n else:\r\n print(len(a) - 4)", "print(len(set(filter((lambda s:s.isalpha()), list(input())))))\n", "a=input()\r\nq=[]\r\nfor x in a:\r\n if x=='a' or x=='b' or x=='c' or x=='d' or x=='e' or x=='f' or x=='g' or x=='h' or x=='i'or x=='j' or x=='k' or x=='l' or x=='m' or x=='n' or x=='o' or x=='p' or x=='q' or x=='r' or x=='s' or x=='t' or x=='u' or x=='v' or x=='w' or x=='x' or x=='y' or x=='z':\r\n q.append(x)\r\na=set(q)\r\nprint(len(a))\r\n ", "s=input()\r\nn=len(s)\r\ns=s[1:len(s)-1].split(\",\")\r\ns[0]=\" \"+s[0]\r\nl=[]\r\n \r\nfor i in s:\r\n if i not in l:\r\n l.append(i)\r\nif l==[' ']:\r\n print(0)\r\nelse:\r\n print(len(l))", "Line = input()\r\nLetters = set()\r\nfor c in Line:\r\n if c.isalpha():\r\n Letters.add(c)\r\nprint(len(Letters))", "set_of_letters = input()\r\n\r\nif set_of_letters == '{}':\r\n\toutput = 0\r\nelse:\r\n\toutput = len(set(set_of_letters[1:-1].split(', ')))\r\n\r\n\r\nprint(output)", "print(len(set(input()[1:-1].replace(',', '').split())))", "s = input()\ndic = {}\nfor i in s :\n if i not in dic and i >= 'a' and i <= 'z' :\n dic[i] =1\nprint(len(dic))\n \t \t\t\t\t \t \t\t\t \t \t\t \t\t", "x=input().strip('{}')\r\nif x:\r\n x=x.split(', ')\r\nx=set(x)\r\nn=len(x)\r\nprint(n)", "import sys\r\nline = sys.stdin.readline().strip()\r\nline2 = line[1:-1]\r\nlist = []\r\nfor i in line2:\r\n if i != ',' and i != ' ':\r\n list.append(i)\r\nprint(len(set(list)))", "st=input()\nlst=[]\nfor i in st:\n if i.isalpha():lst.append(i)\nlst=set(lst)\nprint(len(lst))\n\t\t \t \t\t \t\t \t\t \t \t \t\t \t\t \t", "string=input()\r\nif len(string[1:-1])==0:\r\n print(0)\r\nelse:\r\n print(len(set(string[1:-1].split(', '))))", "s=list(input())\r\ns.remove('{')\r\ns.remove('}')\r\ns=''.join(s)\r\ns=set(s)\r\ns.discard(',')\r\ns.discard(' ')\r\nprint(len(s))", "test=input()\r\ns1=test.replace(\"{\",\"\").replace(\"}\",\"\").replace(\",\",\" \")\r\nlista=set([x for x in s1.split()])\r\nprint(len(lista))\r\n", "s_a = set(input().strip('{}').replace(' ', '').split(','))\r\nprint(len(s_a) if '' not in s_a else 0)", "s=input()\r\na=s[1:-1]\r\nss=list(a.split(', '))\r\nrusik=set()\r\nfor i in ss:\r\n if (len(i)>0):\r\n rusik.add(i)\r\nprint(len(rusik))\r\n", "input = input()\r\narray=set()\r\nfor i in input :\r\n if i != \"{\" and i !=\"}\" and i !=\" \" and i != \",\" :\r\n array.add(i)\r\nprint(len(array))", "s = list(input())\r\nif len(s)==2:\r\n print(0)\r\nelse:\r\n s.pop(0)\r\n s.pop()\r\n if len(s)>2:\r\n s = ''.join(s)\r\n s = set(s.split(', '))\r\n print(len(s))\r\n else:\r\n print(1)", "s = set(filter(lambda y: y,map(lambda x: x.strip(),input()[1:-1].split(\",\"))))\r\nprint(len(s))", "s=input()\nst=set()\nfor ch in s:\n if ch >= 'a' and ch <='z':\n st.add(ch)\nprint(len(st))\n\n\n\t \t\t \t \t \t\t \t\t \t \t \t\t\t\t\t\t", "letters = len(set([i for i in str(input()) if i not in \"{}, \"]))\r\n\r\nprint(letters)", "n=input()\r\nl=list()\r\nl1=list()\r\nfor x in n:\r\n\tif x==\"{\" or x==\"}\" or x==\",\" or x==\" \":\r\n\t\tl.append(x)\r\n\telse:l1.append(x)\r\nprint(len(set(l1)))", "user_set = input()\r\nunique_set = set()\r\nfor i in range(1, len(user_set), 3):\r\n unique_set.add(user_set[i])\r\nif user_set == \"{}\":\r\n print(0)\r\nelse:\r\n print(len(unique_set))\r\n\r\n", "a=(input())\r\nif a=='{}': print(0)\r\nelif len(set(a))<4:print(1)\r\nelse:print(len(set(a))-4)", "# Anton and Letters\r\ns = input(); s = s.replace(\"{\", \"\"); s = s.replace(\"}\", \"\"); s = s.replace(\",\", \"\")\r\nprint(len(set(s.replace(' ', \"\"))));", "from collections import Counter\r\ns = list(input().replace('{', '').replace('}','').replace(',','').split())\r\n\r\nprint(len(Counter(s)))", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\nt = s()\r\nif t == '{}':\r\n print(0)\r\n exit()\r\nt = t[1:-1].split(', ')\r\nt = list(t)\r\nprint(len(set(t)))\r\n", "s = input()\r\ns = s[1:len(s) - 1]\r\nif s == '':\r\n print(0)\r\nelse:\r\n s = s.split(', ')\r\n s = set(s)\r\n print(len(s))", "import re\r\n\r\ninput_str = input().strip()\r\nif not input_str:\r\n distinct_count = 0\r\nelse:\r\n elements = re.findall(r'\\w+', input_str)\r\n distinct_count = len(set(elements))\r\nprint(distinct_count)\r\n", "word = input('')\r\n\r\nword = word.replace(',', '').replace('{', '').replace('}', '').strip()\r\nword_list = word.split(' ')\r\n\r\ndef count_function():\r\n count = 0\r\n for word in word_list:\r\n if(word_list.count(word) > 1):\r\n del word_list[word_list.index(word)]\r\n else:\r\n if word != '':\r\n count += 1\r\n return count\r\n\r\nfor i in range(len(word_list)):\r\n count = count_function()\r\n\r\n\r\nprint(count)", "a = str(input())\r\na = a.replace('{', '')\r\na = a.replace('}', '')\r\na = a.replace(',', '')\r\na = set(list(a.split()))\r\nprint(len(a))\r\n", "import sys\r\n\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\nl = insr()\r\nl = l[1:-1]\r\no = []\r\nfor i in l:\r\n if i not in o and i != ' ' and i != ',':\r\n o.append(i)\r\n\r\nprint(len(o))", "strr = input().strip('{}').split(', ')\r\nstrr = set(strr)\r\nif strr == {''}:\r\n print(0)\r\nelse:\r\n print(len(strr))\r\n", "a=input()\r\nn=set()\r\nfor i in a:\r\n n.add(i)\r\nif len(n)==2:\r\n print(0)\r\nelif len(n)==3:\r\n print(1)\r\nelse:\r\n print(len(n)-4)\r\n", "input_str = input()\r\ndistinct_letters = set()\r\n\r\nif len(input_str) > 2:\r\n letters = input_str[1:-1].split(\", \")\r\n for letter in letters:\r\n distinct_letters.add(letter)\r\n\r\nprint(len(distinct_letters))", "s={*input()}\ns.discard('{')\ns.discard('}')\ns.discard(',')\ns.discard(' ')\nprint(len(s))\n \t\t\t \t \t \t\t \t \t\t \t \t", "entrada = set(input()[1:-1].split(\", \"))\r\nif not list(entrada)[0]:\r\n print(0)\r\nelse:\r\n print(len(entrada))", "c=['{',' ',',','}']\r\nn=input()\r\nl=[]\r\nfor i in n:\r\n if i not in c:\r\n l.append(i)\r\nl=set(l)\r\nprint(len(l))", "input_list = list(input())\r\n\r\ninput_list.remove(\"{\")\r\ninput_list.remove(\"}\")\r\n\r\nwhile True:\r\n try:\r\n input_list.remove(\" \")\r\n except ValueError:\r\n break\r\n\r\nwhile True:\r\n try:\r\n input_list.remove(\",\")\r\n except ValueError:\r\n break\r\n\r\n\r\nprint(len(set(input_list)))\r\n", "# Anton and Letters\r\n\r\nz = input()\r\nz = z[1:len(z) - 1]\r\nletras = z.split(', ')\r\nif letras.count('') != 0:\r\n print(0)\r\nelse:\r\n print(len(set(letras)))\r\n", "s=input()\nletters=[]\nfor i in range(97, 123):\n letters.append(i)\n\nfor i in range(0, len(s)):\n if(ord(s[i])>96 and ord(s[i])<123):\n if(ord(s[i]) in letters):\n letters.remove(ord(s[i]))\n\nprint(26-len(letters))\n", "line = input()\r\ndistinct_letters = set()\r\nfor char in line:\r\n if char.isalpha():\r\n distinct_letters.add(char)\r\nprint(len(distinct_letters))\r\n", "s = input()\nif len(s[1:-1]) == 0:\n print(0)\nelse:\n print(len(set(s[1:-1].split(', '))))\n\t\t\t\t \t \t \t\t\t\t\t\t \t \t\t \t", "l=input()\r\np=set()\r\nfor i in l:\r\n if i == '{' or i == '}' or i ==' ' or i==',':\r\n continue\r\n else:\r\n p.add(i)\r\n\r\nprint(len(p))", "s=input().split(', ')\r\ns[0]=s[0][1:]\r\ns[-1]=s[-1][:-1]\r\nl=set()\r\nfor j in s:\r\n\tif (j!=\"\"):\r\n\t\tl.add(j)\r\nprint(len(set(l)))", "n=input()\r\nc=\"qwertyuiopasdfghjklzxcvbnm\"\r\nd={0}\r\nfor i in n:\r\n if i in c:\r\n d.add(i)\r\nb=len(d)\r\nprint(b-1)", "# Read the input string\r\ninput_string = input().strip()\r\n\r\n# Extract letters and remove brackets and spaces\r\nletters = input_string[1:-1].replace(\", \", \"\")\r\n\r\n# Create a set of distinct letters\r\ndistinct_letters = set(letters)\r\n\r\n# Calculate the number of distinct letters\r\nnum_distinct_letters = len(distinct_letters)\r\n\r\n# Print the result\r\nprint(num_distinct_letters)\r\n", "x=list(input())\r\np=[]\r\nfor i in range(len(x)):\r\n if x[i]==\"{\" or x[i]==\"}\" or x[i]==\",\" or x[i]==\" \":\r\n continue\r\n if x[i] not in p:\r\n p.append(x[i])\r\nprint(len(p))", "x=input()\r\n\r\nif x=='{}':\r\n print(0)\r\nelse:\r\n x=x.replace('{','')\r\n x=x.replace('}','')\r\n newlist=list(x.split(', '))\r\n newset=set(newlist)\r\n newlist=list(newset)\r\n print(len(newlist))", "a=input()\r\nl=[]\r\nfor i in range(len(a)):\r\n if a[i]>='a' and a[i]<='z':\r\n l.append(a[i])\r\nl=set(l)\r\nprint(len(l))", "import sys\r\nimport math\r\nimport datetime\r\n\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 = input()\r\n my_set = set()\r\n for x in t:\r\n if x!=',' and x!='{' and x!='}' and x!=' ':\r\n my_set.add(x)\r\n print(len(my_set))\r\nmain()", "a = input()\r\nif a=='{}':\r\n print(0)\r\nelse:\r\n print(abs(len(set(a))-4))", "print(len(set((x := input()).strip('{}').split(', '))) - (x == '{}'))", "import re\r\n\r\ndef countDistinctCharacters(s):\r\n # Remove non-alphabetic characters and convert to lowercase\r\n s = re.sub('[^a-z]', '', s.lower())\r\n \r\n # Count the number of distinct characters\r\n distinct_chars = set(s)\r\n count = len(distinct_chars)\r\n \r\n return count\r\n\r\n# Read the input string\r\ninput_string = input()\r\n\r\n# Count the number of distinct characters\r\ndistinct_count = countDistinctCharacters(input_string)\r\n\r\n# Print the result\r\nprint(distinct_count)", "n = input()\r\nn1=n[1:-1].split(\", \")\r\ns = set()\r\nfor i in n1:\r\n\tif i!='':\r\n\t\ts.add(i)\r\nlength = len(s)\r\nprint(length)", "s = input()\r\nl = []\r\np = []\r\nfor i in range(len(s)):\r\n if s[i].isalpha():\r\n l.append(s[i])\r\nfor q in range(len(l)):\r\n if l[q] not in p:\r\n p.append(l[q])\r\nprint(len(p))", "s = input()\r\nl = []\r\nfor i in s:\r\n if i != '{' and i != '}' and i != ' ' and i != ',':\r\n l.append(i)\r\nc = 0\r\nprint(len(set(l)))", "test=input()\r\ns1=test.replace(\"{\",\"\").replace(\"}\",\"\").replace(\",\",\" \").replace(\" \",\"\")\r\nlista=set()\r\nfor i in range(len(s1)):\r\n if s1[i] not in lista:\r\n lista.add(s1[i])\r\n\r\nprint(len(lista))\r\n", "import sys\ninput = sys.stdin.readline\n\nletters = set()\ns = input().strip()\nfor c in s:\n if c in \" ,{}\":\n continue\n letters.add(c)\n\nprint(len(letters))", "str = input()\r\nres = 0\r\narr = str[1:-1].split(', ')\r\nlet = [0 for i in range(26)]\r\nfor c in arr:\r\n if(c!= ''):\r\n let[ord(c)-ord('a')] = 1\r\nfor el in let:\r\n if(el==1): res += 1\r\nprint(res)", "inp = input().split(\",\")\r\ninp = [i[1:] for i in inp]\r\ninp[len(inp) - 1] = inp[len(inp) - 1][0]\r\nif inp[0] == \"}\":\r\n print(0)\r\nelse:\r\n print(len(set(inp)))", "n=input()\r\nif n=='{}':\r\n b=0\r\nelse:\r\n x=n.strip('{}')\r\n y=x.split(', ')\r\n a=set(y)\r\n b=len(a)\r\nprint(b)", "import re\nX = str(input().split())\nY = re.sub(r'[^A-Za-z]+', '', X)\nprint(len(set(Y)))\n \t\t\t\t\t\t \t\t\t \t\t \t \t \t\t\t\t", "#https://codeforces.com/problemset/problem/443/A\r\nn=((input()[1:-1]).replace(\" \",\"\")).split(\",\")\r\ndic={}\r\ncount=0\r\nif len(n)==0:\r\n print(0)\r\nelse:\r\n for i in range(len(n)):\r\n if n[i] not in dic and n[i]!=\"\":\r\n count+=1\r\n dic[n[i]]=i\r\nprint(count)", "n =[i for i in str(input()) if i !=\" \" and i !=\"}\" and i !=\"{\" and i !=\",\"]\r\nprint(len(set(n)))", "s = input()\r\nletters = set()\r\nfor i in range(1, len(s)-1):\r\n if s[i].isalpha():\r\n letters.add(s[i])\r\nprint(len(letters))", "s = input()\r\na = []\r\nfor i in s:\r\n if i != '{' and i != '}' and i != ',':\r\n a.append(i)\r\n for z in a:\r\n if a.count(z) != 1:\r\n a.remove(z)\r\n if z == ' ':\r\n a.remove(z)\r\n \r\nprint(len(a))", "l=input()\r\ns=set()\r\nfor i in l:\r\n if i=='{' or i==' ' or i==',' or i=='}':continue\r\n else:s.add(i)\r\nprint(len(s))", "print(len(set(x for x in input().lstrip(\"{\").rstrip(\"}\").split(\", \") if x != '')))", "a=input()\nalpha=[]\nfor i in a:\n s=\"\"\n s += i\n if s.isalpha():\n alpha.append(i)\n \nalpha=set(alpha)\nprint(len(alpha))", "b = input()\r\ncount = 0\r\nif \"a\" in b:\r\n count += 1\r\nif \"b\" in b:\r\n count += 1\r\nif \"c\" in b:\r\n count += 1\r\nif \"d\" in b:\r\n count += 1\r\nif \"e\" in b:\r\n count += 1\r\nif \"f\" in b:\r\n count += 1\r\nif \"g\" in b:\r\n count += 1\r\nif \"h\" in b:\r\n count += 1\r\nif \"i\" in b:\r\n count += 1\r\nif \"j\" in b:\r\n count += 1\r\nif \"k\" in b:\r\n count += 1\r\nif \"l\" in b:\r\n count += 1\r\nif \"m\" in b:\r\n count += 1\r\nif \"n\" in b:\r\n count += 1\r\nif \"o\" in b:\r\n count += 1\r\nif \"p\" in b:\r\n count += 1\r\nif \"q\" in b:\r\n count += 1\r\nif \"r\" in b:\r\n count += 1\r\nif \"s\" in b:\r\n count += 1\r\nif \"t\" in b:\r\n count += 1\r\nif \"u\" in b:\r\n count += 1\r\nif \"v\" in b:\r\n count += 1\r\nif \"w\" in b:\r\n count += 1\r\nif \"x\" in b:\r\n count += 1\r\nif \"y\" in b:\r\n count += 1\r\nif \"z\" in b:\r\n count += 1\r\nprint(count)", "print(len(set(list(input().replace(\" \", \"\").replace(\"{\", \"\").replace(\"}\", \"\").replace(\",\", \"\")))))\n\t\t \t\t \t \t\t \t\t \t \t\t \t\t \t", "print(len(set(input()+', '))-4)", "s = input()\r\nl = ['{','}',',',' ']\r\nl1 =[]\r\nfor i in s:\r\n if (i not in l):\r\n l1.append(i)\r\nprint(len(set(l1)))", "s = input()\r\nresult = []\r\nfor i in s:\r\n if i.isalpha() and i not in result:\r\n result.append(i)\r\nprint(len(result))", "# 443A\r\ns = input()\r\nn = s.count(\",\")\r\ns = list(set(s))\r\n\r\nf = 0\r\nfor i in s:\r\n if i.isalpha():\r\n f = f + 1\r\nprint(f)\r\n \r\n", "# https://codeforces.com/problemset/problem/443/A\r\n\r\ns=input()\r\ns=s[1:-1].split(\", \")\r\nif s==['']:\r\n print(0)\r\nelse:\r\n print(len(set(s)))", "s = str(input())\r\nt = set()\r\nfor i in s:\r\n if ord(i)>=97 and ord(i)<=122:\r\n t.add(i)\r\nprint(len(t))", "s=input()\r\ns1=\"\"\r\nfor i in s:\r\n if i not in [\"{\",\"}\",\",\",\" \"]:\r\n s1+=i\r\nprint(len(set(s1)))", "s = input()\r\na = []\r\nfor i in s:\r\n if i >= 'a' and i <= 'z':\r\n a.append(i)\r\ns = set(a)\r\n\r\nprint (len(s))\r\n\r\n\r\n", "print(len(set([x for x in input()[1:-1] if x != ' ' and x != ','])))", "s=input()\r\ns=str(s)\r\nz=['{','}',',',' ']\r\nfor i in s:\r\n if i not in z:\r\n z.append(i)\r\nprint(len(z)-4)\r\n", "a = input().strip()\r\na_1 = a.index('{')\r\na_2 = a.index('}')\r\nr = a[a_1 + 1:a_2]\r\ns = set()\r\nfor i in r:\r\n if i .isalpha():\r\n s.add(i)\r\nprint(len(s))\r\n", "n = input()\r\na = n.strip(',')\r\nv = list(a)\r\nv.sort()\r\ncount = 0\r\n\r\nfor i in range(len(v)):\r\n if v[i] != '{' and v[i] != '}' and v[i] != ',' and v[i] != ' ':\r\n if i == 0 or v[i] != v[i - 1]:\r\n count += 1\r\n\r\nprint(count)", "a = str(input())\r\nstack = []\r\nfor i in a:\r\n if i >= \"a\" and i <= \"z\":\r\n if i not in stack:\r\n stack.append(i)\r\nprint(len(stack))", "set_as_string = input()\r\nset_as_string = set_as_string.strip('{').strip('}')\r\nif not set_as_string:\r\n print(0)\r\nelse:\r\n antons_set = set(set_as_string.split(', '))\r\n print(len(antons_set))\r\n", "l1=list(input())\r\nl1.pop(0)\r\nl1.pop(-1)\r\n\r\ns=set(l1)\r\nif(len(s)>2):\r\n print(abs(len(s)-2))\r\nelse:\r\n print(len(s))", "string = input().split(', ')\r\nstring[0] = string[0][1::]\r\nstring[len(string) - 1] = string[len(string) - 1][0]\r\nnumbers = []\r\nanswer = 0\r\nif string != ['}']:\r\n for i in range(len(string)):\r\n if string[i] not in numbers:\r\n numbers.append(string[i])\r\n answer += 1\r\n print(answer)\r\nelse:\r\n print(0)", "input_str = input().strip(\"{}\").replace(\", \", \"\")\r\ndistinct_letters = set(input_str)\r\ncount = len(distinct_letters)\r\n\r\nprint(count)\r\n", "string = str(input())\r\nmyList = []\r\nbrac = [\"{\", \"}\"]\r\n\r\nfor i in range(1, len(string), 3):\r\n if string[i] not in myList and string[i] not in brac:\r\n myList.append(string[i])\r\n \r\nprint(len(myList))", "s=input()\r\ns=s.strip(\"{\")\r\ns=s.strip(\"}\")\r\nw=set()\r\nfor i in s:\r\n if i!=\",\" and i!=\" \":\r\n w.add(i)\r\nprint(len(w))", "import sys\r\n\r\ns = sys.stdin.readline()[1:][:-2]\r\n\r\nif len(s) == 0:\r\n print('0')\r\nelse:\r\n print(len(dict.fromkeys(s.split(', '))))", "n=input()\r\nn=n.replace(\" \",\"\")\r\nlist1=list(n)\r\nlist1.remove('{')\r\nlist1.remove('}')\r\nfor i in list1:\r\n if(i==','):\r\n list1.remove(i)\r\nlist2=[]\r\nfor i in list1:\r\n if i not in list2:\r\n list2.append(i)\r\nprint(len(list2))\r\n", "a=input()\nlst=[]\nfor i in range(len(a)):\n if a[i] not in lst and( a[i]!=\"{\" and a[i]!=\",\"and a[i]!=\" \"and a[i]!=\"}\"):\n lst.append(a[i])\nprint(len(lst))\n \t \t\t\t\t\t\t\t \t\t \t \t\t \t \t \t\t\t\t\t", "a = input().replace('{', '')\r\na = a.replace('}', '')\r\na = a.replace(' ', '')\r\na = a.replace(',', '')\r\nprint(len(set(list(a))))", "count=0\r\ns1=str(input())\r\nl1=[]\r\nl2=[]\r\ns1=s1.strip(\"{}\")\r\ns1=s1.replace(\" \",\",\")\r\n# print(s1)\r\ns1=s1.split(\",,\")\r\n# print(s1)\r\nfor i in range(len(s1)):\r\n if s1[i] not in l1:\r\n l1.append(s1[i])\r\n count+=1\r\nif \"\" in l1:\r\n count=0\r\n print(count)\r\nelse:\r\n print(len(l1))", "import os, io\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n \r\ndef main():\r\n\r\n s = input().decode().rstrip(\"\\r\\n\")[1:-1].split(\", \")\r\n print(len(set(s))*bool(s[0]))\r\n\r\n\r\nmain()\r\n", "import sys\r\n\r\ns = input()\r\nif s == \"{}\": print(0); sys.exit()\r\n\r\ns = list(s[1:len(s)-1].split(\",\"))\r\nfor i in range(len(s)):\r\n s[i] = s[i].strip()\r\n\r\ns = set(s)\r\nprint(len(s))", "def count_distinct_letters(string):\r\n letters = string[1:-1].replace(', ', '')\r\n distinct_letters = set(letters)\r\n count = len(distinct_letters)\r\n return count\r\nstring = input()\r\ndistinct_count = count_distinct_letters(string)\r\nprint(distinct_count)\r\n", "s = input()\r\ns = s[1:len(s)-1]\r\ns = s.replace(\", \",\"\")\r\na = set()\r\nfor ch in s:\r\n a.add(ch)\r\nprint(len(a))", "def anton(s):\r\n check = ''\r\n for item in s:\r\n if item not in check:\r\n check += item\r\n return len(check)\r\n\r\nif __name__ == \"__main__\":\r\n s = list(map(str, input()[1:-1].split(', ')))\r\n print(anton(s))", "def count(s):\r\n x = set(s[1:-1].replace(', ', ''))\r\n return len(x)\r\ninput_set = input()\r\nresult = count(input_set)\r\nprint(result)", "set_string = input()\r\nletters = set_string[1:-1].replace(\", \", \"\")\r\ndistinct_count = len(set(letters))\r\nprint(distinct_count)\r\n", "s=input()\ndic={}\nfor ch in s:\n if ch >= 'a' and ch <='z':\n dic[ch]=1\n\nprint(len(dic))\n\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\nletters = s[1:-1].split(\", \")\r\nif len(letters) == 1 and letters[0] == '':\r\n print(0)\r\nelse:\r\n distinct_letters = set(letters)\r\n distinct_count = len(distinct_letters)\r\n print(distinct_count)\r\n", "s=input()\r\nlst=[]\r\nfor i in s:\r\n if i.isalpha():\r\n lst.append(i)\r\n \r\nprint(len(set(lst)))", "s = input()\r\nll = s[1:len(s) - 1]\r\nll = ll.replace(', ', '')\r\nprint(len(set(ll)))", "x = list(input())\r\nx.pop(0)\r\nx.pop(-1)\r\nz = x.count(\",\")\r\ny = x.count(\" \")\r\nfor i in range(z):\r\n\tx.remove(\",\")\r\nfor i in range(y):\r\n\tx.remove(\" \")\r\nx = set(x)\r\nprint(len(x))", "\"\"\"Антон и буквы\"\"\"\r\nimport re\r\n\r\ndef main():\r\n n = input()[1:-1]\r\n if len(n) != 0:\r\n n = n.split(\", \")\r\n print(len(set(n)))\r\n else:\r\n print(0)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x=input()\r\nx=x.strip(',')\r\ny=list(x)\r\ny.sort()\r\nz=0\r\nfor i in range(len(y)):\r\n if(y[i]!='{' and y[i]!='}' and y[i]!=',' and y[i]!=' '):\r\n if(y[i]!=y[i-1]):\r\n z+=1\r\nprint(z) ", "v = input()\r\nv = v.strip(\"{}\")\r\nv = v.replace(\", \", \"\")\r\nv = set(v)\r\nprint(len(v))", "n = set(input())\r\nn1 = list(n)\r\ns =[]\r\nfor i in n1 :\r\n if i == \"}\" or i == \"{\" or i == \",\" or i == \" \":\r\n continue \r\n else :\r\n s.append(i) \r\nprint(len(s)) ", "s = set(input()[1:-1].split(', '))\r\nprint(0) if '' in s else print(len(s))\r\n ", "s = input()\r\nset1 = set(s)\r\nset1.remove(\"{\")\r\nset1.remove(\"}\")\r\nif \" \" in set1:\r\n set1.remove(\" \")\r\nif \",\" in set1:\r\n set1.remove(\",\")\r\nprint(len(set1))", "a = input()\r\na = a[1:len(a)-1:]\r\nv = 0\r\nif len(a)>0:\r\n a = a.split(', ')\r\n c = []\r\n for i in a:\r\n if i not in c:\r\n c.append(i)\r\n v+=1\r\nprint(v)", "s = input()\r\nl = list(s)\r\nwhile \",\" in l :\r\n l.remove(\",\")\r\n l.remove(\" \")\r\nl.remove(\"{\")\r\nl.remove(\"}\")\r\nprint(len(set(l)))\r\n", "x = input()\r\nx = list(x)\r\nnew_list = []\r\nfor i in x:\r\n if i not in [',', '{', '}',' ']:\r\n new_list.append(i)\r\nx_set = set(new_list)\r\nprint(len(x_set))\r\n", "str=input()\r\nrigthStr=\"\"\r\nfor c in str :\r\n if c.isalpha() :\r\n rigthStr+=c\r\n \r\nunfortunatelyStr=\"\"\r\nfor c in rigthStr:\r\n if not unfortunatelyStr.__contains__(c) :\r\n unfortunatelyStr+=c\r\n\r\nlength=len(unfortunatelyStr)\r\nprint(length)\r\n\r\n", "import string\nimport re\n\na = input()\nfor index, letter in enumerate(list(string.ascii_letters)):\n a =re.sub(letter, str(index), a)\n \nprint(len(set(eval(a))))", "s = str(input())\r\ns = s[1:][:-1]; s = s.replace(',','').replace(' ','')\r\ns = sorted(s)\r\ns2 = ''\r\nfor i in range(len(s)):\r\n s2 = s2+s[i]\r\ns = s2\r\nfor j in range(10000,1,-1):\r\n for i in s:\r\n s = s.replace(i*j,i)\r\nprint(len(s))", "s = input()\r\nt = set()\r\n\r\nfor i in s:\r\n if ord(i) > 96 and ord(i)<123:\r\n t.add(i)\r\n\r\nprint(len(t))", "a=set(input())\r\nb=len(a)-3\r\nif b>0:\r\n print(b-1)\r\nelif b==0:\r\n print(1)\r\nelse:\r\n print(0)", "from sys import stdin, stdout\r\nfrom math import *\r\ninput = stdin.readline\r\nprint = lambda s: stdout.write(str(s)+'\\n')\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n st = set()\r\n for c in s:\r\n if c.islower() == True:\r\n st.add(c)\r\n print(len(st))\r\n\r\n", "s = input()\r\nans = set(s)\r\nans.remove('{')\r\nans.remove('}')\r\nif ',' in ans:\r\n ans.remove(',')\r\nif ' ' in ans:\r\n ans.remove(' ')\r\nprint(len(ans))", "l = list(map(str, input()))\r\nt = set()\r\n \r\nfor letter in l:\r\n if letter.isalpha():\r\n t.add(letter)\r\nprint(len(t))", "n = input()\r\n\r\ns = set()\r\nfor i in range(1, len(n), 3):\r\n s.add(n[i])\r\n\r\nif '}' in s:\r\n print(0)\r\nelse:\r\n print(len(s))", "word = input()\r\ntrash=[]\r\nfor i in word:\r\n if i.isalpha():\r\n trash.append(i)\r\ncount_alpha=set()\r\nfor i in trash:\r\n count_alpha.add(i)\r\ncount=0\r\nfor i in count_alpha:\r\n count+=1\r\nprint(count)" ]

[ "n,d,k=map(int,input().strip().split())\r\nans=[]\r\nif (d>n-1):\r\n\tprint (\"NO\")\r\n\texit(0)\r\nif (k<2 and n>2):\r\n\tprint (\"NO\")\r\n\texit(0)\r\nl1=[0 for i in range(d+2)]\r\ncount=d\r\ncnt=d+2\r\ndef insert(par,v,r,e):\r\n\tglobal count\r\n\tglobal cnt\r\n\tif count==n-1:\r\n\t\tprint (\"YES\")\r\n\t\tfor o in ans:\r\n\t\t\tprint (o[0],o[1])\r\n\t\texit(0)\r\n\telse:\r\n\t\tans.append([par,v])\r\n\t\tcnt=cnt+1\r\n\t\tcount=count+1\r\n\tif (e==0):\r\n\t\treturn \r\n\twhile(r!=0):\r\n\t\tinsert(v,cnt,k-1,e-1)\r\n\t\tr=r-1\r\n\treturn \r\nfor i in range(1,d+1):\r\n\tans.append([i,i+1])\r\nfor i in range(1,d+2):\r\n\tl1[i]=min(i-1,d+1-i)\r\nfor i in range(2,d+1):\r\n\tr=k-2\r\n\twhile(r!=0):\r\n\t\tinsert(i,cnt,k-1,l1[i]-1)\r\n\t\tr=r-1\r\nif (count<n-1):\r\n\tprint (\"NO\")\r\nelse:\r\n\tprint (\"YES\")\r\n\tfor o in ans:\r\n\t\tprint (o[0],o[1])\r\n\texit(0)\r\n", "from collections import defaultdict, deque, Counter\r\nfrom heapq import heapify, heappop, heappush\r\nimport math\r\nfrom copy import deepcopy\r\nfrom itertools import combinations, permutations, product, combinations_with_replacement\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nimport sys\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\ndef getN():\r\n return int(input())\r\ndef getNM():\r\n return map(int, input().split())\r\ndef getList():\r\n return list(map(int, input().split()))\r\ndef getListGraph():\r\n return list(map(lambda x:int(x) - 1, input().split()))\r\ndef getArray(intn):\r\n return [int(input()) for i in range(intn)]\r\n\r\nmod = 10 ** 9 + 7\r\nMOD = 998244353\r\n\r\n# import pypyjit\r\n# pypyjit.set_param('max_unroll_recursion=-1')\r\ninf = float('inf')\r\neps = 10 ** (-12)\r\ndy = [0, 1, 0, -1]\r\ndx = [1, 0, -1, 0]\r\n\r\n#############\r\n# Main Code #\r\n#############\r\n\r\nN, D, K = getNM()\r\n# D < Nなので\r\nif D >= N:\r\n print('NO')\r\n exit()\r\nC = N\r\n# 頂点C, 残り深さ0, 残り次数K\r\nq = deque([[C, 0, K]])\r\npar = [-1] * N\r\nC -= 1\r\n# 背骨を作る\r\nfor i in range(1, D + 1):\r\n if q[-1][2]:\r\n q[-1][2] -= 1\r\n par[C] = q[-1][0]\r\n q.append([C, min(i, D - i), K - 1])\r\n C -= 1\r\n\r\n# 残りを作る\r\nwhile C and q:\r\n u, dep, ver = q.popleft()\r\n if dep:\r\n for _ in range(ver):\r\n if not C:\r\n break\r\n par[C] = u\r\n q.append([C, dep - 1, K - 1])\r\n C -= 1\r\n\r\nif C == 0:\r\n print('YES')\r\n for i in range(1, N):\r\n print(i, par[i])\r\nelse:\r\n print('NO')", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n# ----------------------- #\r\n\r\nn, d, k = map(int, input().split())\r\nif d >= n:\r\n exit(print('NO'))\r\n\r\nstack = [[n, 0, k]]\r\npar = [-1] * n\r\nnow = n-1\r\nfor i in range(d):\r\n i += 1\r\n if stack[-1][2] > 0:\r\n stack[-1][2] -= 1\r\n par[now] = stack[-1][0]\r\n stack.append([now, min(i, d-i), k-1])\r\n now -= 1\r\n# print(*stack)\r\n# print(*par)\r\n\r\nwhile now > 0 and stack:\r\n v, dep, deg = stack.pop()\r\n if dep > 0:\r\n for _ in range(deg):\r\n par[now] = v\r\n stack.append([now, dep-1, k-1])\r\n now -= 1\r\n if now == 0:\r\n break\r\n\r\nif now == 0:\r\n print('YES')\r\n for i in range(1, n):\r\n print(i, par[i])\r\nelse:\r\n print('NO')\r\n", "n,d,k=map(int,input().strip().split())\nans=[]\nif (d>n-1):\n\tprint (\"NO\")\n\texit(0)\nif (k<2 and n>2):\n\tprint (\"NO\")\n\texit(0)\nl1=[0 for i in range(d+2)]\ncount=d\ncnt=d+2\ndef insert(par,v,r,e):\n\tglobal count\n\tglobal cnt\n\tif count==n-1:\n\t\tprint (\"YES\")\n\t\tfor o in ans:\n\t\t\tprint (o[0],o[1])\n\t\texit(0)\n\telse:\n\t\tans.append([par,v])\n\t\tcnt=cnt+1\n\t\tcount=count+1\n\tif (e==0):\n\t\treturn \n\twhile(r!=0):\n\t\tinsert(v,cnt,k-1,e-1)\n\t\tr=r-1\n\treturn \nfor i in range(1,d+1):\n\tans.append([i,i+1])\nfor i in range(1,d+2):\n\tl1[i]=min(i-1,d+1-i)\nfor i in range(2,d+1):\n\tr=k-2\n\twhile(r!=0):\n\t\tinsert(i,cnt,k-1,l1[i]-1)\n\t\tr=r-1\nif (count<n-1):\n\tprint (\"NO\")\nelse:\n\tprint (\"YES\")\n\tfor o in ans:\n\t\tprint (o[0],o[1])\n\texit(0)\n\n\t\t\t \t\t \t\t \t \t \t \t\t\t\t\t", "from collections import deque\r\nn, d, k = map(int, input().split())\r\nif n==1:\r\n print('NO')\r\n exit(0)\r\nif n==2:\r\n if d>1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n print(1, 2)\r\n exit(0)\r\nif (not 2<=d<=n-1) or k==1:\r\n print('NO')\r\n exit(0)\r\nans = []\r\nfor i in range(d):\r\n ans.append((i+1, i+2))\r\nnow = d+2\r\nfor i in range(d-1):\r\n q = deque([(i+2, min(i, d-i-2))])\r\n first = True\r\n while q and len(ans)<n-1:\r\n node, depth = q.popleft()\r\n end = now+k-1\r\n if first:\r\n end -= 1\r\n for j in range(now, end):\r\n ans.append((node, j))\r\n if len(ans)==n-1:\r\n break\r\n if depth>0:\r\n q.append((j, depth-1))\r\n now = end\r\n first = False\r\n\r\nif len(ans)==n-1:\r\n print('YES')\r\n for i, j in ans:\r\n print(i, j)\r\nelse:\r\n print('NO')", "n, d, k = map(int, input().split())\r\nif n < d + 1:\r\n exit(print('NO'))\r\nnode = [[] for _ in range(n + 1)]\r\ndeg = [0] * (n + 1)\r\nlengthFromEnd = [0] * (n + 1)\r\nfor i in range(1, d + 1):\r\n node[i].append(i + 1)\r\n deg[i] += 1\r\n deg[i + 1] += 1\r\n lengthFromEnd[i] = min(i - 1, d + 1 - i)\r\nif max(deg[1 : d + 2]) > k:\r\n exit(print('NO'))\r\nx = d + 2\r\nfor i in range(1, n + 1):\r\n if lengthFromEnd[i] > 0:\r\n while deg[i] < k and x <= n:\r\n node[i].append(x)\r\n deg[i] += 1\r\n deg[x] += 1\r\n lengthFromEnd[x] = lengthFromEnd[i] - 1\r\n x += 1\r\nif deg[n] == 0:\r\n exit(print('NO'))\r\nprint('YES')\r\nfor i in range(1, n + 1):\r\n if len(node[i]) > 0:\r\n for x in node[i]:\r\n print(i, x)" ]

[ "import sys\r\nreadline=sys.stdin.readline\r\n\r\nclass Graph:\r\n def __init__(self,V,edges=False,graph=False,directed=False,weighted=False,inf=float(\"inf\")):\r\n self.V=V\r\n self.directed=directed\r\n self.weighted=weighted\r\n self.inf=inf\r\n if graph:\r\n self.graph=graph\r\n self.edges=[]\r\n for i in range(self.V):\r\n if self.weighted:\r\n for j,d in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j,d))\r\n else:\r\n for j in self.graph[i]:\r\n if self.directed or not self.directed and i<=j:\r\n self.edges.append((i,j))\r\n else:\r\n self.edges=edges\r\n self.graph=[[] for i in range(self.V)]\r\n if weighted:\r\n for i,j,d in self.edges:\r\n self.graph[i].append((j,d))\r\n if not self.directed:\r\n self.graph[j].append((i,d))\r\n else:\r\n for i,j in self.edges:\r\n self.graph[i].append(j)\r\n if not self.directed:\r\n self.graph[j].append(i)\r\n\r\n def SIV_DFS(self,s,bipartite_graph=False,cycle_detection=False,directed_acyclic=False,euler_tour=False,linked_components=False,lowlink=False,parents=False,postorder=False,preorder=False,subtree_size=False,topological_sort=False,unweighted_dist=False,weighted_dist=False):\r\n seen=[False]*self.V\r\n finished=[False]*self.V\r\n if directed_acyclic or cycle_detection or topological_sort:\r\n dag=True\r\n if euler_tour:\r\n et=[]\r\n if linked_components:\r\n lc=[]\r\n if lowlink:\r\n order=[None]*self.V\r\n ll=[None]*self.V\r\n idx=0\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps=[None]*self.V\r\n if postorder or topological_sort:\r\n post=[]\r\n if preorder:\r\n pre=[]\r\n if subtree_size:\r\n ss=[1]*self.V\r\n if unweighted_dist or bipartite_graph:\r\n uwd=[self.inf]*self.V\r\n uwd[s]=0\r\n if weighted_dist:\r\n wd=[self.inf]*self.V\r\n wd[s]=0\r\n stack=[(s,0)] if self.weighted else [s]\r\n while stack:\r\n if self.weighted:\r\n x,d=stack.pop()\r\n else:\r\n x=stack.pop()\r\n if not seen[x]:\r\n seen[x]=True\r\n stack.append((x,d) if self.weighted else x)\r\n if euler_tour:\r\n et.append(x)\r\n if linked_components:\r\n lc.append(x)\r\n if lowlink:\r\n order[x]=idx\r\n ll[x]=idx\r\n idx+=1\r\n if preorder:\r\n pre.append(x)\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if not seen[y]:\r\n stack.append((y,d) if self.weighted else y)\r\n if parents or cycle_detection or lowlink or subtree_size:\r\n ps[y]=x\r\n if unweighted_dist or bipartite_graph:\r\n uwd[y]=uwd[x]+1\r\n if weighted_dist:\r\n wd[y]=wd[x]+d\r\n elif not finished[y]:\r\n if (directed_acyclic or cycle_detection or topological_sort) and dag:\r\n dag=False\r\n if cycle_detection:\r\n cd=(y,x)\r\n elif not finished[x]:\r\n finished[x]=True\r\n if euler_tour:\r\n et.append(~x)\r\n if lowlink:\r\n bl=True\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if ps[x]==y and bl:\r\n bl=False\r\n continue\r\n ll[x]=min(ll[x],order[y])\r\n if x!=s:\r\n ll[ps[x]]=min(ll[ps[x]],ll[x])\r\n if postorder or topological_sort:\r\n post.append(x)\r\n if subtree_size:\r\n for y in self.graph[x]:\r\n if self.weighted:\r\n y,d=y\r\n if y==ps[x]:\r\n continue\r\n ss[x]+=ss[y]\r\n if bipartite_graph:\r\n bg=[[],[]]\r\n for tpl in self.edges:\r\n x,y=tpl[:2] if self.weighted else tpl\r\n if uwd[x]==self.inf or uwd[y]==self.inf:\r\n continue\r\n if not uwd[x]%2^uwd[y]%2:\r\n bg=False\r\n break\r\n else:\r\n for x in range(self.V):\r\n if uwd[x]==self.inf:\r\n continue\r\n bg[uwd[x]%2].append(x)\r\n retu=()\r\n if bipartite_graph:\r\n retu+=(bg,)\r\n if cycle_detection:\r\n if dag:\r\n cd=[]\r\n else:\r\n y,x=cd\r\n cd=self.Route_Restoration(y,x,ps)\r\n retu+=(cd,)\r\n if directed_acyclic:\r\n retu+=(dag,)\r\n if euler_tour:\r\n retu+=(et,)\r\n if linked_components:\r\n retu+=(lc,)\r\n if lowlink:\r\n retu=(ll,)\r\n if parents:\r\n retu+=(ps,)\r\n if postorder:\r\n retu+=(post,)\r\n if preorder:\r\n retu+=(pre,)\r\n if subtree_size:\r\n retu+=(ss,)\r\n if topological_sort:\r\n if dag:\r\n tp_sort=post[::-1]\r\n else:\r\n tp_sort=[]\r\n retu+=(tp_sort,)\r\n if unweighted_dist:\r\n retu+=(uwd,)\r\n if weighted_dist:\r\n retu+=(wd,)\r\n if len(retu)==1:\r\n retu=retu[0]\r\n return retu\r\n\r\n def Build_LCA(self,s):\r\n self.lca_euler_tour,self.lca_parents,depth=self.SIV_DFS(s,euler_tour=True,parents=True,unweighted_dist=True)\r\n self.lca_dfs_in_index=[None]*self.V\r\n self.lca_dfs_out_index=[None]*self.V\r\n for i,x in enumerate(self.lca_euler_tour):\r\n if x>=0:\r\n self.lca_dfs_in_index[x]=i\r\n else:\r\n self.lca_dfs_out_index[~x]=i\r\n self.ST=Segment_Tree(2*self.V,lambda x,y:min(x,y),self.V)\r\n lst=[None]*(2*self.V)\r\n for i in range(2*self.V-1):\r\n if self.lca_euler_tour[i]>=0:\r\n lst[i]=depth[self.lca_euler_tour[i]]\r\n else:\r\n lst[i]=depth[self.lca_parents[~self.lca_euler_tour[i]]]\r\n lst[2*self.V-1]=-1\r\n self.ST.Build(lst)\r\n\r\n def LCA(self,a,b):\r\n m=min(self.lca_dfs_in_index[a],self.lca_dfs_in_index[b])\r\n M=max(self.lca_dfs_in_index[a],self.lca_dfs_in_index[b])\r\n x=self.lca_euler_tour[self.ST.Fold_Index(m,M+1)]\r\n if x>=0:\r\n return x\r\n else:\r\n return self.lca_parents[~x]\r\n\r\nclass Lazy_Segment_Tree:\r\n def __init__(self,N,f,e,f_act,e_act,operate,lst=None):\r\n self.N=N\r\n self.f=f\r\n self.e=e\r\n self.f_act=f_act\r\n self.e_act=e_act\r\n self.operate=operate\r\n self.segment_tree=[self.e]*(self.N+self.N)\r\n self.segment_tree_act=[self.e_act]*(self.N+self.N)\r\n if lst!=None:\r\n for i,x in enumerate(lst):\r\n self.segment_tree[i+self.N]=x\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n self.segment_tree_act=[self.e_act]*(self.N+self.N)\r\n\r\n def __getitem__(self,i):\r\n if type(i) is int:\r\n if -self.N<=i<0:\r\n i+=self.N*2\r\n elif 0<=i<self.N:\r\n i+=self.N\r\n else:\r\n raise IndexError('list index out of range')\r\n self.Propagate_Above(i)\r\n self.Recalculate_Above(i)\r\n return self.Operate_At(i)\r\n else:\r\n a,b,c=i.start,i.stop,i.step\r\n if a==None or a<-self.N:\r\n a=self.N\r\n elif self.N<=a:\r\n a=self.N*2\r\n elif a<0:\r\n a+=self.N*2\r\n else:\r\n a+=self.N\r\n if b==None or self.N<=b:\r\n b=self.N*2\r\n elif b<-self.N:\r\n b=self.N\r\n elif b<0:\r\n b+=self.N*2\r\n else:\r\n b+=self.N\r\n return self.segment_tree[slice(a,b,c)]\r\n\r\n def __setitem__(self,i,x):\r\n if -self.N<=i<0:\r\n i+=self.N*2\r\n elif 0<=i<self.N:\r\n i+=self.N\r\n else:\r\n raise IndexError('list index out of range')\r\n self.Propagate_Above(i)\r\n self.segment_tree[i]=x\r\n self.segment_tree_act[i]=self.e_act\r\n self.Recalculate_Above(i)\r\n\r\n def Operate_At(self,i):\r\n return self.operate(self.segment_tree[i],self.segment_tree_act[i])\r\n\r\n def Propagate_At(self,i):\r\n self.segment_tree[i]=self.Operate_At(i)\r\n self.segment_tree_act[i<<1]=self.f_act(self.segment_tree_act[i<<1],self.segment_tree_act[i])\r\n self.segment_tree_act[i<<1|1]=self.f_act(self.segment_tree_act[i<<1|1],self.segment_tree_act[i])\r\n self.segment_tree_act[i]=self.e_act\r\n\r\n def Propagate_Above(self,i):\r\n H=i.bit_length()-1\r\n for h in range(H,0,-1):\r\n self.Propagate_At(i>>h)\r\n\r\n def Recalculate_Above(self,i):\r\n while i>1:\r\n i>>=1\r\n self.segment_tree[i]=self.f(self.Operate_At(i<<1),self.Operate_At(i<<1|1))\r\n\r\n def Build(self,lst):\r\n for i,x in enumerate(lst):\r\n self.segment_tree[i+self.N]=x\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n self.segment_tree_act=[self.e_act]*(self.N+self.N)\r\n\r\n def Fold(self,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n self.Propagate_Above(L//(L&-L))\r\n self.Propagate_Above(R//(R&-R)-1)\r\n vL=self.e\r\n vR=self.e\r\n while L<R:\r\n if L&1:\r\n vL=self.f(vL,self.Operate_At(L))\r\n L+=1\r\n if R&1:\r\n R-=1\r\n vR=self.f(self.Operate_At(R),vR)\r\n L>>=1\r\n R>>=1\r\n return self.f(vL,vR)\r\n\r\n def Fold_Index(self,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n if L==R:\r\n return None\r\n x=self.Fold(L-self.N,R-self.N)\r\n while L<R:\r\n if L&1:\r\n if self.segment_tree[L]==x:\r\n i=L\r\n break\r\n L+=1\r\n if R&1:\r\n R-=1\r\n if self.segment_tree[R]==x:\r\n i=R\r\n break\r\n L>>=1\r\n R>>=1\r\n while i<self.N:\r\n if self.segment_tree[i]==self.segment_tree[i<<1]:\r\n i<<=1\r\n else:\r\n i<<=1\r\n i|=1\r\n i-=self.N\r\n return i\r\n\r\n def Operate_Range(self,a,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n L0=L//(L&-L)\r\n R0=R//(R&-R)-1\r\n self.Propagate_Above(L0)\r\n self.Propagate_Above(R0)\r\n while L<R:\r\n if L&1:\r\n self.segment_tree_act[L]=self.f_act(self.segment_tree_act[L],a)\r\n L+=1\r\n if R&1:\r\n R-=1\r\n self.segment_tree_act[R]=self.f_act(self.segment_tree_act[R],a)\r\n L>>=1\r\n R>>=1\r\n self.Recalculate_Above(L0)\r\n self.Recalculate_Above(R0)\r\n\r\n def Update(self):\r\n for i in range(1,self.N):\r\n self.Propagate_At(i)\r\n for i in range(self.N,self.N*2):\r\n self.segment_tree[i]=self.Operate_At(i)\r\n self.segment_tree_act[i]=self.e_act\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n\r\n def Bisect_Right(self,L=None,f=None):\r\n if L==self.N:\r\n return self.N\r\n if L==None:\r\n L=0\r\n L+=self.N\r\n self.Propagate_Above(L//(L&-L))\r\n self.Propagate_Above(self.N//(self.N&-self.N)-1)\r\n l,r=L,self.N*2\r\n vl=self.e\r\n vr=self.e\r\n while l<r:\r\n if l&1:\r\n vl=self.f(vl,self.Operate_At(l))\r\n l+=1\r\n if r&1:\r\n r-=1\r\n vr=self.f(self.Operate_At(r),vr)\r\n l>>=1\r\n r>>=1\r\n if f(self.f(vl,vr)):\r\n return self.N\r\n v=self.e\r\n while True:\r\n while L%2==0:\r\n L>>=1\r\n self.Propagate_Above(L)\r\n vv=self.f(v,self.Operate_At(L))\r\n if f(vv):\r\n v=vv\r\n L+=1\r\n else:\r\n while L<self.N:\r\n L<<=1\r\n self.Propagate_Above(L)\r\n vv=self.f(v,self.Operate_At(L))\r\n if f(vv):\r\n v=vv\r\n L+=1\r\n return L-self.N\r\n\r\n def Bisect_Left(self,R=None,f=None):\r\n if R==0:\r\n return 0\r\n if R==None:\r\n R=self.N\r\n R+=self.N\r\n self.Propagate_Above(self.N//(self.N&-self.N))\r\n self.Propagate_Above(R//(R&-R)-1)\r\n vl=self.e\r\n vr=self.e\r\n l,r=self.N,R\r\n while l<r:\r\n if l&1:\r\n vl=self.f(vl,self.Operate_At(l))\r\n l+=1\r\n if r&1:\r\n r-=1\r\n vr=self.f(self.Operate_At(r),vr)\r\n l>>=1\r\n r>>=1\r\n if f(self.f(vl,vr)):\r\n return 0\r\n v=self.e\r\n while True:\r\n R-=1\r\n while R>1 and R%2:\r\n R>>=1\r\n self.Propagate_Above(R)\r\n vv=self.f(self.Operate_At(R),v)\r\n if f(vv):\r\n v=vv\r\n else:\r\n while R<self.N:\r\n R=2*R+1\r\n self.Propagate_Above(R)\r\n vv=self.f(self.Operate_At(R),v)\r\n if f(vv):\r\n v=vv\r\n R-=1\r\n return R+1-self.N\r\n\r\n def __str__(self):\r\n import copy\r\n segment_tree=copy.deepcopy(self.segment_tree)\r\n segment_tree_act=copy.deepcopy(self.segment_tree_act)\r\n for i in range(1,self.N):\r\n segment_tree[i]=self.operate(segment_tree[i],segment_tree_act[i])\r\n segment_tree_act[i<<1]=self.f_act(segment_tree_act[i<<1],segment_tree_act[i])\r\n segment_tree_act[i<<1|1]=self.f_act(segment_tree_act[i<<1|1],segment_tree_act[i])\r\n segment_tree_act[i]=self.e_act\r\n for i in range(self.N,self.N*2):\r\n segment_tree[i]=self.operate(segment_tree[i],segment_tree_act[i])\r\n segment_tree_act[i]=self.e_act\r\n for i in range(self.N-1,0,-1):\r\n segment_tree[i]=self.f(segment_tree[i<<1],segment_tree[i<<1|1])\r\n return '['+', '.join(map(str,[self.operate(x,a) for x,a in zip(segment_tree[self.N:],segment_tree_act[self.N:])]))+']'\r\n\r\nclass Segment_Tree:\r\n def __init__(self,N,f,e,lst=None):\r\n self.f=f\r\n self.e=e\r\n self.N=N\r\n if lst==None:\r\n self.segment_tree=[self.e]*2*self.N\r\n else:\r\n assert len(lst)<=self.N\r\n self.segment_tree=[self.e]*self.N+[x for x in lst]+[self.e]*(N-len(lst))\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n\r\n def __getitem__(self,i):\r\n if type(i)==int:\r\n if -self.N<=i<0:\r\n return self.segment_tree[i+self.N*2]\r\n elif 0<=i<self.N:\r\n return self.segment_tree[i+self.N]\r\n else:\r\n raise IndexError('list index out of range')\r\n else:\r\n a,b,c=i.start,i.stop,i.step\r\n if a==None:\r\n a=self.N\r\n else:\r\n a+=self.N\r\n if b==None:\r\n b=self.N*2\r\n else:\r\n b+=self.N\r\n return self.segment_tree[slice(a,b,c)]\r\n\r\n def __setitem__(self,i,x):\r\n if -self.N<=i<0:\r\n i+=self.N*2\r\n elif 0<=i<self.N:\r\n i+=self.N\r\n else:\r\n raise IndexError('list index out of range')\r\n self.segment_tree[i]=x\r\n while i>1:\r\n i>>= 1\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n\r\n def Build(self,lst):\r\n for i,x in enumerate(lst,self.N):\r\n self.segment_tree[i]=x\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n\r\n def Fold(self,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n vL=self.e\r\n vR=self.e\r\n while L<R:\r\n if L&1:\r\n vL=self.f(vL,self.segment_tree[L])\r\n L+=1\r\n if R&1:\r\n R-=1\r\n vR=self.f(self.segment_tree[R],vR)\r\n L>>=1\r\n R>>=1\r\n return self.f(vL,vR)\r\n\r\n def Fold_Index(self,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n if L==R:\r\n return None\r\n x=self.Fold(L-self.N,R-self.N)\r\n while L<R:\r\n if L&1:\r\n if self.segment_tree[L]==x:\r\n i=L\r\n break\r\n L+=1\r\n if R&1:\r\n R-=1\r\n if self.segment_tree[R]==x:\r\n i=R\r\n break\r\n L>>=1\r\n R>>=1\r\n while i<self.N:\r\n if self.segment_tree[i]==self.segment_tree[i<<1]:\r\n i<<=1\r\n else:\r\n i<<=1\r\n i|=1\r\n i-=self.N\r\n return i\r\n\r\n def Bisect_Right(self,L=None,f=None):\r\n if L==self.N:\r\n return self.N\r\n if L==None:\r\n L=0\r\n L+=self.N\r\n vl=self.e\r\n vr=self.e\r\n l,r=L,self.N*2\r\n while l<r:\r\n if l&1:\r\n vl=self.f(vl,self.segment_tree[l])\r\n l+=1\r\n if r&1:\r\n r-=1\r\n vr=self.f(self.segment_tree[r],vr)\r\n l>>=1\r\n r>>=1\r\n if f(self.f(vl,vr)):\r\n return self.N\r\n v=self.e\r\n while True:\r\n while L%2==0:\r\n L>>=1\r\n vv=self.f(v,self.segment_tree[L])\r\n if f(vv):\r\n v=vv\r\n L+=1\r\n else:\r\n while L<self.N:\r\n L<<=1\r\n vv=self.f(v,self.segment_tree[L])\r\n if f(vv):\r\n v=vv\r\n L+=1\r\n return L-self.N\r\n\r\n def Bisect_Left(self,R=None,f=None):\r\n if R==0:\r\n return 0\r\n if R==None:\r\n R=self.N\r\n R+=self.N\r\n vl=self.e\r\n vr=self.e\r\n l,r=self.N,R\r\n while l<r:\r\n if l&1:\r\n vl=self.f(vl,self.segment_tree[l])\r\n l+=1\r\n if r&1:\r\n r-=1\r\n vr=self.f(self.segment_tree[r],vr)\r\n l>>=1\r\n r>>=1\r\n if f(self.f(vl,vr)):\r\n return 0\r\n v=self.e\r\n while True:\r\n R-=1\r\n while R>1 and R%2:\r\n R>>=1\r\n vv=self.f(self.segment_tree[R],v)\r\n if f(vv):\r\n v=vv\r\n else:\r\n while R<self.N:\r\n R=2*R+1\r\n vv=self.f(self.segment_tree[R],v)\r\n if f(vv):\r\n v=vv\r\n R-=1\r\n return R+1-self.N\r\n\r\n def __str__(self):\r\n return '['+', '.join(map(str,self.segment_tree[self.N:]))+']'\r\n\r\ndef Compress(lst):\r\n decomp=sorted(list(set(lst)))\r\n comp={x:i for i,x in enumerate(decomp)}\r\n return comp,decomp\r\n\r\ndef Inversion_Number(lst,weight=False,weakly=False):\r\n compress,decompress=Compress(lst)\r\n compressed_lst=[compress[x] for x in lst]\r\n N=len(compress)\r\n if not weight:\r\n weight=[1]*len(lst)\r\n ST=Segment_Tree(N,lambda x,y:x+y,0)\r\n inversion_number=0\r\n for c,x in zip(weight,lst):\r\n inversion_number+=ST.Fold(x if weakly else x+1,N)*c\r\n ST[x]+=c\r\n return inversion_number\r\n\r\nN,K=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\ncomp,decomp=Compress(A)\r\nfor i in range(N):\r\n A[i]=comp[A[i]]\r\nM=len(comp)\r\nr=0\r\nSTL=Segment_Tree(N,lambda x,y:x+y,0)\r\nSTR=Segment_Tree(N,lambda x,y:x+y,0)\r\nfor a in A:\r\n STR[a]+=1\r\ninve=Inversion_Number(A)\r\nans=0\r\nfor l in range(1,N):\r\n STL[A[l-1]]+=1\r\n inve+=STL.Fold(A[l-1]+1,M)\r\n inve+=STR.Fold(0,A[l-1])\r\n while r<l or inve>K and r<N:\r\n STR[A[r]]-=1\r\n inve-=STL.Fold(A[r]+1,M)\r\n inve-=STR.Fold(0,A[r])\r\n r+=1\r\n ans+=N-r\r\nprint(ans)" ]

[ "from collections import defaultdict\r\nn, x, y = map(int, input().split())\r\ndic = defaultdict(int)\r\ncnt = ok = 0\r\nwhile n:\r\n n -= 1\r\n a, b = map(int, input().split())\r\n if x == a: ok = 1\r\n else: dic[(b - y) / (a - x)] += 1\r\nfor i in dic: \r\n cnt += dic[i] != 0\r\nprint(cnt + ok) \r\n", "import sys\n# sys.stdin = open(\".in\", \"r\")\n# sys.stdout = open(\".out\", \"w\")\ninput = sys.stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n sys.stdout.write(sep.join(map(str, args)) + end)\ndef map_int():\n return map(int, input().split())\ndef list_int():\n return list(map(int, input().split()))\nfrom collections import defaultdict, deque, Counter\nfrom math import sqrt, gcd\nfrom random import shuffle\n\n\nINF = float('inf')\n# NumberOfTestcases = int(input())\n# for _ in range(NumberOfTestcases):\nn, x, y = map_int()\npoints = [tuple(map_int()) for i in range(n)]\nshuffle(points)\n'''\ny = mx + c\nm = (y2-y1)/(x2 - x1)\n\nall that matters is the gradient\n'''\ngradients = defaultdict(int)\nfor point in points:\n xx, yy = point\n if not x - xx:\n m = INF\n else:\n m = (y-yy)/(x-xx)\n if gradients[m]: continue\n gradients[m] = 1\n\nprint(len(gradients))\n\n\n", "def online(x,a,p):\r\n if x[0]*(a[1]-p[1])+x[1]*(p[0]-a[0])+a[0]*p[1]-a[1]*p[0]==0:\r\n return True\r\n return False\r\nn,x,y=map(int,input().split())\r\nc=1\r\nl=[x,y]\r\nlines=[list(map(int,input().split()))]\r\nfor _ in range(n-1):\r\n nl=list(map(int,input().split()))\r\n chk=True\r\n for i in lines:\r\n if online(l,nl,i):\r\n chk=False\r\n break\r\n if chk:\r\n c+=1\r\n lines.append(nl)\r\nprint(c)", "#\n# question: https://codeforces.com/contest/514/problem/B/\n#\n\ndef hanSolo(troopers, x, y):\n result = 0\n aliveTroops = [True for troop in range(len(troopers))]\n for i in range(len(troopers)):\n if aliveTroops[i]:\n aliveTroops[i] = False\n result +=1\n for j in range(len(troopers)):\n if ((troopers[i][0] - x) * (troopers[j][1] - y) == \n (troopers[j][0] - x) * (troopers[i][1] - y)):\n aliveTroops[j] = False\n \n return result\n\nfirstLine = input().split()\n\nn = int(firstLine[0])\nstartX = int(firstLine[1])\nstartY =int(firstLine[2])\n \ntroopers = []\nfor i in range(n):\n troop = [int(x) for x in input().split()]\n troopers.append(troop)\n \n\nprint(hanSolo(troopers, startX, startY))\n", "import 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\nin_bounds = lambda x, y, grid: x >= 0 and x < len(grid) and y >= 0 and y < len(grid[0])\r\n\r\nclass UnionFind:\r\n \r\n def __init__(self, n):\r\n self.parents = [i for i in range(n)]\r\n self.ranks = [0] * n\r\n \r\n def find(self, i):\r\n if self.parents[i] == i:\r\n return i\r\n # path compression\r\n self.parents[i] = self.find(self.parents[i])\r\n return self.parents[i]\r\n \r\n def union(self, i, j):\r\n a = self.find(i)\r\n b = self.find(j)\r\n \r\n if a == b:\r\n return\r\n if self.ranks[a] < self.ranks[b]:\r\n self.parents[a] = b\r\n elif self.ranks[a] > self.ranks[b]:\r\n self.parents[b] = a\r\n else:\r\n self.parents[a] = b\r\n self.ranks[b] += 1\r\n\r\ndef calc_slope(x1, y1, x2, y2):\r\n top = y2 - y1\r\n bottom = x2 - x1\r\n\r\n if bottom == 0:\r\n return math.inf\r\n \r\n return (top / bottom)\r\n\r\ndef solve():\r\n n, gx, gy = mul()\r\n\r\n coords = []\r\n for _ in range(n):\r\n coords.append(seq())\r\n \r\n slopes = set()\r\n for x, y in coords:\r\n slopes.add(calc_slope(gx, gy, x, y))\r\n \r\n print(len(slopes))\r\n\r\ncases = 1\r\nfor _ in range(cases):\r\n solve()", "lst1 = list(map(int,input().split()))\r\nn = lst1[0]\r\nx0 = lst1[1]\r\ny0 = lst1[2]\r\n\r\nlst1 = []\r\nfor i in range(n):\r\n lst2 = list(map(int,input().split()))\r\n lst1.append(lst2)\r\n\r\ndone = [0 for i in range(n)]\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n if done[i] == 1:\r\n continue\r\n done[i] = 1\r\n ans+=1\r\n if lst1[i][0] == x0:\r\n m = float('inf')\r\n else:\r\n m = (lst1[i][1]-y0)/(lst1[i][0] - x0)\r\n for j in range(i+1,n):\r\n if lst1[j][0] == x0:\r\n m1 = float('inf')\r\n else:\r\n m1 = (lst1[j][1]-y0)/(lst1[j][0] - x0)\r\n if m1 == m:\r\n done[j] = 1\r\n\r\nprint(ans)\r\n ", "n, x, y = map(int, input().split())\r\nlines = set()\r\nfor _ in range(n):\r\n x1, y1 = map(int, input().split())\r\n if x1 != x:\r\n k = (y1 - y) / (x1-x)\r\n b = y - k * x\r\n else:\r\n k = None\r\n b = x1\r\n lines.add((k, b))\r\n\r\nprint(len(lines))\r\n", "n, x, y = map(int, input().split())\r\n\r\nvp = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n vp.append([a, b])\r\n\r\nvis = [False] * 200005\r\nans = 0\r\n\r\nfor i in range(n):\r\n if not vis[i]:\r\n vis[i] = True\r\n\r\n for j in range(n):\r\n left = (vp[j][0] - vp[i][0]) * (y - vp[i][1])\r\n right = (vp[j][1] - vp[i][1]) * (x - vp[i][0])\r\n\r\n if left == right:\r\n vis[j] = True\r\n ans += 1\r\n\r\nprint(ans)\r\n", "class Point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\n def __str__(self):\r\n return '(' + str(self.x) + ' ' + str(self.y) + ')'\r\n\r\ndef cross(a, b, c):\r\n return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x)\r\n\r\n\r\nn, x, y = map(int, input().split())\r\n\r\none = Point(x, y)\r\n\r\ntroopers = []\r\nfor j in range(n):\r\n k, d = map(int, input().split())\r\n troopers.append(Point(k, d))\r\n\r\nans = 0\r\nseen = set()\r\nfor i in range(n):\r\n ref = troopers[i]\r\n if ref in seen:\r\n continue\r\n seen.add(ref)\r\n ans += 1\r\n for j in range(i + 1, n):\r\n another = troopers[j]\r\n if cross(one, ref, another) == 0:\r\n seen.add(another)\r\n\r\nprint(ans)", "n, a, b = map(int, input().split())\r\nse = set()\r\nbl = False\r\nfor _ in range(n):\r\n c, d = map(int, input().split())\r\n if b == d:\r\n bl = True\r\n else:\r\n se.add((a - c) / (b - d))\r\nprint(len(se) + bl)\r\n", "import math\r\nimport sys\r\nimport heapq\r\nfrom queue import PriorityQueue\r\nfrom collections import deque\r\ninput = sys.stdin.readline \r\nn, k, j = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if x==k:\r\n d.append((x))\r\n else:\r\n q = ((j-y)/(k-x))\r\n d.append((q,j-q*k))\r\nd = set(d)\r\nprint(len(d))\r\n ", "\r\nn, gun_x, gun_y = map(int, input().split())\r\nshot_angles = set()\r\n\r\nfor i in range(n):\r\n enemy_x, enemy_y = map(int, input().split())\r\n # Avoid divide by 0 error\r\n if gun_x - enemy_x == 0:\r\n # Encode vertical lines as root 2 as the only things that matters is the unique gradient count\r\n # Irrational numbers can't be expressed as a fraction of rational numbers so will never be found normally.\r\n shot_angles.add(2**(1/2))\r\n else:\r\n shot_angles.add((gun_y - enemy_y) / (gun_x - enemy_x))\r\nprint(len(shot_angles))\r\n\r\n\r\n\r\n\r\n\r\n\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, xg, yg = map(int, input().split())\r\nslopes, is_v = set(), False\r\nfor _ in range(n):\r\n xp, yp = map(int, input().split())\r\n if xp == xg:\r\n is_v = True\r\n else: \r\n slopes.add((yg - yp) / (xg - xp))\r\n \r\nprint(len(slopes) + is_v)", "n,x0,y0=[int(i) for i in input().split()]\r\nd={}\r\ncnt=0\r\nz=0\r\nfor j in range(n):\r\n x1,y1=[int(k) for k in input().split()]\r\n if y0!=y1:\r\n m=(x0-x1)/(y0-y1)\r\n if m not in d.keys():\r\n d[m]=1\r\n cnt+=1\r\n else :\r\n z=1\r\nprint(cnt+z)", "from math import gcd as g\r\nn,x0,y0 = (int(x) for x in input().split())\r\nl = []\r\nfor i in range(0,n):\r\n xi, yi = (int(x) for x in input().split())\r\n xi, yi = xi-x0, yi-y0\r\n if xi != 0 and yi !=0:\r\n t = str(abs(yi//g(xi,yi))) +' '+ str(abs(xi//g(xi,yi)))\r\n if xi*yi < 0:\r\n t = \"-\" + t\r\n if t not in l: l.append(t)\r\n elif xi == 0 and yi!=0:\r\n t = 'inf'\r\n if t not in l: l.append(t)\r\n elif yi == 0 and xi!=0:\r\n t = 'zer'\r\n if t not in l: l.append(t)\r\n \r\nprint(len(l))", "import sys\r\nn, x_0, y_0 = map(float, input().strip().split())\r\na = []\r\nfor i in range(int(n)):\r\n x, y = map(float, input().strip().split())\r\n x -= x_0\r\n y -= y_0\r\n if y == 0:\r\n a.append(1e4 + 1)\r\n else:\r\n a.append(x / y)\r\n\r\na = sorted(list(set(a)))\r\nprint(len(a))\r\n", "n, x0, y0 = map(int, input().split())\r\ns = set()\r\nj = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if x == x0:\r\n j = 1\r\n continue\r\n m = (y - y0) / (x - x0)\r\n s.add(m)\r\nprint(len(s) + j)", "n,x,y=map(int,input().split())\r\np=set();flag=False\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n try:\r\n p.add((b-y)/(a-x))\r\n except ZeroDivisionError:\r\n flag=True\r\nprint(len(p)+flag)", "temp = [int(i) for i in input().split()]\nn, xcoord, ycoord = temp[0], temp[1], temp[2]\n\ninfSlope = False\ns = set()\n\n\nfor i in range(n):\n x, y = [int(i) for i in input().split()]\n if(x - xcoord == 0):\n infSlope=True\n #print(\"Got here\")\n else:\n slope = (y-ycoord)/(x-xcoord)\n s.add(slope)\nprint(len(s) + infSlope)\n\n", "import sys \r\n\r\nli = input().strip().split()\r\nn, a, b = [int(i) for i in li]\r\n\r\nset = set()\r\n\r\nfor i in range(n):\r\n li = input().strip().split()\r\n x, y = [int(i) for i in li]\r\n x = x-a\r\n y = y-b\r\n set.add(y/x if x!=0 else sys.maxsize)\r\nprint(len(set))", "from fractions import Fraction\nfrom math import inf\n\nn, x0, y0 = map(int, input().split())\nslopes = set()\nfor _ in range(n):\n x, y = map(int, input().split())\n x, y = x - x0, y - y0\n if x == 0:\n if y != 0:\n slopes.add(inf)\n else:\n slopes.add(Fraction(y, x))\nprint(max(1, len(slopes)))\n", "n,xo,yo = map(int,input().split())\r\n\r\nslopes = {}\r\ndef slope(x1,x2,y1,y2):\r\n \r\n if x1 == x2:\r\n return float('inf')\r\n return (y1-y2)/(x1-x2)\r\n \r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n \r\n m = slope(xo,x,yo,y)\r\n slopes[m] = slopes.setdefault(m,0) + 1\r\n\r\nprint(len(slopes))", "# Read input values\r\nn, x0, y0 = map(int, input().split())\r\n\r\n# Initialize a set to store unique slopes\r\nslopes = set()\r\n\r\n# Loop through the stormtroopers\r\nfor _ in range(n):\r\n xi, yi = map(int, input().split())\r\n\r\n # Calculate the slope (avoid division by zero)\r\n if xi - x0 == 0:\r\n slope = float('inf') # Vertical line\r\n else:\r\n slope = (yi - y0) / (xi - x0)\r\n\r\n slopes.add(slope)\r\n\r\n# Print the minimum number of shots needed\r\nprint(len(slopes))\r\n", "n, xg, yg = map(int, input().split())\r\n\r\ntroops = []\r\nlineX = -1\r\nlineY = -1\r\nslopes = {}\r\n\r\n\r\ndef slope(x2, y2):\r\n m = (y2 - yg) / (x2 - xg)\r\n \r\n if m not in slopes:\r\n slopes[m] = 1\r\n elif m in slopes:\r\n slopes[m] += 1\r\n\r\nwhile n:\r\n xi, yi = map(int, input().split())\r\n \r\n if xi == xg:\r\n lineY = 1\r\n elif yi == yg:\r\n lineX = 1\r\n else:\r\n troops.append([xi, yi])\r\n\r\n n -= 1\r\n\r\nfor troop in troops:\r\n slope(troop[0], troop[1])\r\n\r\nno_lines = len(slopes) + (1 if lineX == 1 else 0) + (1 if lineY == 1 else 0)\r\nprint(no_lines)", "n, a, b = map(int, input().split()) # Read the inputs\r\n\r\nse = set() # Create a set to store slopes\r\n\r\n# Check if any y coordinate as same as b \r\n# -> to avoid condition of b - d == 0 (error)\r\nbl = False \r\n\r\nfor _ in range(n):\r\n c, d = map(int, input().split())\r\n if b == d: # if y coordinate as same as b \r\n bl = True\r\n else:\r\n #Calculate the slope of this point and the first point and add it to the set\r\n se.add((a - c) / (b - d)) \r\n# Print out total different slopes\r\nprint(len(se) + bl) ", "n,x0,y0=map(int,input().split())\r\nset1=set()\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\tif x !=x0:\r\n\t\tm=(y-y0)/(x-x0)\r\n\t\tset1.add(m)\r\n\telse:\r\n\t\tset1.add(\"i\")\t\t\r\n\r\n\r\nprint(len(set1))\r\n# print(set1)\t\t", "n, x, y = map(int, input().split())\r\n\r\ntargets = []\r\nkilled = [False] * n\r\nshots = 0\r\n\r\nfor i in range(n):\r\n targets.append(tuple(map(int, input().split())))\r\n\r\nfor i in range(n):\r\n target = targets[i]\r\n if not killed[i]:\r\n # print('shot' + str(target))\r\n shots += 1\r\n dx = target[0] - x\r\n dy = target[1] - y\r\n\r\n for j in range(n):\r\n collateral = targets[j]\r\n dx_c = collateral[0] - x\r\n dy_c = collateral[1] - y\r\n\r\n if dx_c * dy == dx * dy_c:\r\n # print('killed' + str(collateral))\r\n killed[j] = True\r\n\r\n \r\n\r\nprint(shots)", "n, x, y = map(int,input().split())\r\ns = set()\r\nfor i in range(n):\r\n a, b = map(int,input().split())\r\n s.add((a-x)/(b-y) if b-y!=0 else float(\"INF\"))\r\n\r\nprint(len(s))\r\n", "n, x1, y1 = [int(x) for x in input().split()]\nstorms = []\n\nfor i in range(n):\n storms.append([int(x) for x in input().split()])\n storms[-1][0] -= x1\n storms[-1][1] -= y1\n\nposition = set()\ninf = 0\n\nfor guy in storms:\n if guy[0] == 0:\n inf = 1\n continue\n position.add(guy[1] / guy[0])\n\nprint(len(position) + inf)\n \t \t\t \t\t\t \t\t\t \t \t \t \t \t\t \t", "n, x, y = map(int, input().split())\r\ns = set()\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n\r\n if b - y != 0:\r\n s.add((a - x) / (b - y))\r\n else:\r\n s.add(float(\"INF\"))\r\n\r\nprint(len(s))\r\n", "n,a,b=map(int,input().split())\r\ndata={}\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n m=float(\"inf\") if y==b else (x-a)/(y-b)\r\n data[m]=None\r\nprint(len(data))", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\nn,x0,y0=map(int,input().split())\r\nm=0\r\nd=defaultdict(int)\r\nfor _ in range(n):\r\n xi,yi=map(int,input().split())\r\n if yi==y0:m+=1\r\n else:\r\n s=(x0-xi)/(y0-yi)\r\n d[s]+=1\r\nans=len(d)\r\nif m>0:ans+=1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nn,c,d = ([int(x) for x in input().split()])\r\nl1=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x=c-a\r\n y=d-b\r\n if x==0:\r\n l1.append('a')\r\n else:\r\n l1.append(y/x)\r\nprint(len(set(l1)))", "n, x0, y0 = map(int, input().split())\r\nslopes = set()\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n if x == x0:\r\n slopes.add(float('inf'))\r\n else:\r\n k = (y - y0) / (x - x0)\r\n slopes.add(k)\r\n\r\nprint(len(slopes))", "import sys\r\n\r\nnum_stormtroopers, gun_x, gun_y = [int(x)\r\n for x in sys.stdin.__next__().split()]\r\n\r\nstormtroopers = {}\r\nfor i in range(num_stormtroopers):\r\n stormtrooper_x, stormtrooper_y = [\r\n int(x) for x in sys.stdin.__next__().split()]\r\n\r\n # make the gun always at 0, 0 relative to stormtrooper locations\r\n\r\n slope = float(\"inf\") if (\r\n stormtrooper_y - gun_y) == 0 else (stormtrooper_x - gun_x) / (stormtrooper_y - gun_y)\r\n if slope not in stormtroopers:\r\n stormtroopers[slope] = 1\r\n else:\r\n stormtroopers[slope] += 1\r\n\r\n\r\nprint(len(stormtroopers))\r\n", "t,x,y = map(int,input().split())\r\nmyset = set()\r\nzer0 = 0\r\nfor i in range(t):\r\n a,b = map(int,input().split())\r\n if a-x==0:\r\n zer0=1\r\n else:\r\n eq = (b-y)/(a-x)\r\n if eq not in myset:\r\n myset.add(eq)\r\nprint(len(myset)+zer0)", "def solve():\r\n n, x0, y0 = map(int, input().split())\r\n k = set()\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n if x == x0:\r\n k.add(1010101010101010)\r\n else:\r\n k.add((y - y0) / (x - x0))\r\n print(len(k))\r\nsolve()", "s = set()\nn, x0, y0 = map(int, input().split())\nfor _ in range(n):\n x, y = map(int, input().split())\n if y - y0 == 0:\n s.add('ahahahah')\n else:\n s.add((x - x0) / (y - y0))\nprint(len(s))", "n,x,y=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n lst.append(list(map(int,input().split())))\r\n\r\ndef distance(x1,y1,x2,y2):\r\n return (((x1-x2)**2) + ((y1-y2)**2))**(1/2)\r\nfor i in range(n-1):\r\n flag=False\r\n if(lst[i][0]!='a'):\r\n for j in range(i+1,n):\r\n if(lst[j][0]!='a'):\r\n if(y!=lst[i][1] and y!=lst[j][1]):\r\n if((x-lst[i][0])/(y-lst[i][1])==(x-lst[j][0])/(y-lst[j][1])):\r\n lst[j][0]='a'\r\n if(y==lst[i][1] and y==lst[j][1]):\r\n lst[j][0]='a'\r\n \r\n\r\n \r\n\r\ncount=0\r\nfor i in range(len(lst)):\r\n if(lst[i][0]!='a'):\r\n count +=1\r\nprint(count)", "n,q,w=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n l.append((w-y)/(q-x)if q-x!=0 else \"n\")\r\nprint(len(set(l)))", "n,x,y = map(int,input().split())\r\nslopes = []\r\nans = 0\r\ninf = 100000\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n if a!=x:\r\n slope = (b-y)/(a-x)\r\n if slope not in slopes:\r\n slopes.append(slope)\r\n ans+=1\r\n else:\r\n if inf not in slopes:\r\n slopes.append(inf)\r\n ans+=1\r\nprint(ans)\r\n \r\n", "'''\r\n4 0 0\r\n1 1\r\n2 2\r\n2 0\r\n-1 -1\r\n'''\r\nimport math\r\nn, gx, gy = map(int, input().split())\r\nshots = set()\r\nvertical = 0\r\nfor i in range(n):\r\n ex, ey = map(int, input().split())\r\n ex-=gx\r\n ey-=gy\r\n if ey != 0:\r\n slope = ex/ey\r\n shots.add(slope)\r\n else:\r\n vertical = 1\r\n\r\nprint(len(shots)+vertical)\r\n ", "n,x0,y0 = map(int,input().split())\r\ndic = {}\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n if x == x0:\r\n dic['inf'] = dic.get('inf',0) +1 \r\n elif y == y0:\r\n dic[0] = dic.get(0,0) + 1 \r\n else:\r\n m = (y-y0)/(x-x0)\r\n dic[m] = dic.get(m,0) + 1\r\nans = len(dic.values())\r\nprint(ans)", "n, x0, y0 = map(int, input().split())\r\n\r\nout = 0\r\nd_dict = set()\r\n\r\npoints = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n\r\n points.append((x - x0, y - y0))\r\n\r\n if points[-1] == (0, 0):\r\n out = 1\r\n elif points[-1][0] == 0:\r\n d_dict.add('x')\r\n elif points[-1][1] == 0:\r\n d_dict.add('y')\r\n else:\r\n d = (x - x0) / (y - y0)\r\n d_dict.add(d)\r\n\r\nprint(len(d_dict) + out)\r\n# print(*points, sep='\\n')\r\n", "s = set()\r\nn, x0, y0 = map(int, input().split())\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n if y - y0 == 0:\r\n s.add('aboba')\r\n else:\r\n s.add((x - x0) / (y - y0))\r\nprint(len(s))", "n=input().split()\r\nl=[]\r\ncount=0\r\nfor i in range (int(n[0])):\r\n x=input().split()\r\n if int(x[0])-int(n[1])!=0:\r\n y=(int(x[1])-int(n[2]))/(int(x[0])-int(n[1]))\r\n if y not in l:\r\n l.append(y)\r\n else:\r\n count=1\r\nif count==1:\r\n print(len(l)+1)\r\nelse:\r\n print(len(l))", "from math import gcd\r\n\r\ndef cal(a):\r\n if a<0: return -1,(-1)*a\r\n elif a>0: return 1,a\r\n else: return 0,a\r\n\r\ndef checkgcd(a):\r\n if len(a)==1:\r\n return a[0]\r\n n=len(a)\r\n k=gcd(a[0],a[1])\r\n for i in range(2,n):\r\n k=gcd(k,a[i])\r\n return k\r\n \r\ndef solve(x,y):\r\n x1,y1=x\r\n x2,y2=y\r\n a,b,c=y2-y1,x1-x2,x1*(y2-y1)+y1*(x1-x2)\r\n f,a=cal(a)\r\n g,b=cal(b)\r\n h,c=cal(c)\r\n l=[f,g,h]\r\n j=[a,b,c]\r\n if l.count(0)==0:\r\n if l.count(-1)==3:\r\n l=[1,1,1]\r\n elif l.count(-1)==1:\r\n for i in range(3):\r\n if l[i]==-1: l[i]=1\r\n else: l[i]=-1\r\n g=checkgcd(j)\r\n j=[j[0]//g,j[1]//g,j[2]//g]\r\n elif l.count(0)==1:\r\n if l.count(-1)==2:\r\n for i in range(3):\r\n if l[i]==-1:\r\n l[i]=1\r\n elif l.count(-1)==1:\r\n r=l.index(0)\r\n p=l.index(-1)\r\n if r==0 and p==2:\r\n l=[0,-1,1]\r\n f=[j[1],j[2]]\r\n g=checkgcd(f)\r\n j=[0,j[1]//g,j[2]//g]\r\n elif r==0 and p==1:\r\n l=[0,-1,1]\r\n f=[j[1],j[2]]\r\n g=checkgcd(f)\r\n j=[0,j[1]//g,j[2]//g]\r\n elif r==1 and p==2:\r\n l=[-1,0,1]\r\n f=[j[0],j[2]]\r\n g=checkgcd(f)\r\n j=[j[0]//g,0,j[2]//g]\r\n elif r==1 and p==0:\r\n l=[-1,0,1]\r\n f=[j[0],j[2]]\r\n g=checkgcd(f)\r\n j=[j[0]//g,0,j[2]//g]\r\n elif r==2 and p==1:\r\n l=[-1,1,0]\r\n f=[j[0],j[1]]\r\n g=checkgcd(f)\r\n j=[j[0]//g,j[1]//g,0]\r\n elif r==2 and p==0:\r\n l=[-1,1,0]\r\n f=[j[0],j[1]]\r\n g=checkgcd(f)\r\n j=[j[0]//g,j[1]//g,0]\r\n if l.count(-1)==0:\r\n r=l.index(0)\r\n if r==0:\r\n f=[j[1],j[2]]\r\n g=checkgcd(f)\r\n j=[0,j[1]//g,j[2]//g]\r\n elif r==1:\r\n f=[j[0],j[2]]\r\n g=checkgcd(f)\r\n j=[j[0]//g,0,j[2]//g]\r\n elif r==2:\r\n f=[j[0],j[1]]\r\n g=checkgcd(f)\r\n j=[j[0]//g,j[1]//g,0]\r\n elif l.count(0)==2:\r\n for i in range(3):\r\n if l[i]==-1 or l[i]==1:\r\n l[i],j[i]=1,1\r\n return j[0]*l[0],j[1]*l[1],j[2]*l[2]\r\n \r\nn,j,k=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n x,y=[j,k],[a,b]\r\n s,t,y=solve(x,y)\r\n z=str(s)+str(t)+str(y)\r\n if d.get(z)==None:\r\n d[z]=1\r\n else:\r\n d[z]+=1\r\nprint(len(d))", "def slope(a,b,c,d):\r\n if(c-a)==0:\r\n return 'a'\r\n x=(d-b)/(c-a)\r\n return x\r\nn,x,y=map(int,input().split())\r\nli=[]\r\n\r\nfor i in range(n):\r\n sub=list(map(int,input().split()))\r\n li.append(slope(x,y,sub[0],sub[1]))\r\nd={}\r\nfor i in li:\r\n if(i in d):\r\n continue\r\n else:\r\n d[i]=1\r\nprint(len(d))\r\n\r\n\r\n\r\n", "K=set()\r\nX=[]\r\nn,x0,y0=map(int,input().split())\r\nfor i in range(n):\r\n X.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n if X[i][0]!=x0:\r\n K.add(float((X[i][1]-y0)/(X[i][0]-x0)))\r\n else:\r\n K.add('x')\r\nprint(len(K))\r\n" ]

[ "n,m=map(int,input().split())\nd={}\nfor i in range(n):\n name,ip=input().split()\n d[ip]=name\nfor i in range(m):\n cmd,ip=input().split()\n print(cmd+\" \"+ip+\" \"+\"#\"+d[ip[:len(ip)-1]])\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\nname=[]\r\nip1=[]\r\ncommand=[]\r\nip2=[]\r\n\r\nfor i in range(n):\r\n s=input().split()\r\n name.append(s[0])\r\n ip1.append(s[1])\r\n \r\nfor i in range(m):\r\n s=input().split()\r\n command.append(s[0])\r\n ip2.append(s[1])\r\n \r\nfor i in range(m):\r\n index=ip1.index(ip2[i][0:len(ip2[i])-1])\r\n print(\"{} {} {}\".format(command[i], ip2[i], \"#\"+name[index]))\r\n ", "\r\nnumber = list(map(int,input().split()))\r\n\r\nall_IP = []\r\n\r\nfor i in range(number[0]):\r\n s = list(map(str , input().split()))\r\n s[1] = s[1]+';'\r\n all_IP.append(s)\r\n\r\nfor i in range(number[1]):\r\n x = input()\r\n z = list(map(str , x.split()))\r\n ip = z[1]\r\n for j in range(number[0]):\r\n if all_IP[j][1] == ip:\r\n ans = x +\" #\" + str(all_IP[j][0])\r\n print(ans)\r\n break\r\n\r\n", "n,m=map(int,input().split())\r\nalfa,betta=[],[]\r\nfor i in range(n):\r\n x,y=map(str,input().split())\r\n x=\"#\"+x\r\n alfa.append(x)\r\n betta.append(y)\r\nfor j in range(m):\r\n x1,y1=map(str,input().split())\r\n for j in range(n):\r\n if y1[0:len(y1)-1]==betta[j]:\r\n print(x1,y1,alfa[j])\r\n", "n,m=map(int,input().split())\r\ndicn={}\r\nfor i in range(n):\r\n value,key=input().split()\r\n dicn[key]=value\r\nfor i in range(m):\r\n key,value=input().split()\r\n value=value[0:-1]\r\n print(f'{key} {value}; #{dicn[value]}')", "n,o=map(int,input().split())\nfre={}\nfor i in range(n):\n x,y=map(str,input().split())\n fre[y]=x \nfor j in range(o):\n q,r=map(str,input().split())\n print(q,\" \",r,\" \",\"#\",fre[r[:len(r)-1]],sep=\"\")\n \t \t \t\t\t \t\t\t\t \t \t \t\t\t \t \t\t", "# Write Python code in this online editor and run it.\ni=input\nn,m=map(int,i().split())\nd=dict([i().split()[::-1] for _ in[0]*n])\nfor _ in[0]*m:a=i();print(a,'#'+d[a.split()[1][:-1]])\n\t\t\t \t \t \t \t \t\t\t \t \t \t \t", "tc = 1\r\nwhile tc:\r\n tc-=1\r\n n, m = map(int, input().split())\r\n d = {}\r\n for i in range(n):\r\n l = list(map(str, input().split()))\r\n d[l[1]] = l[0]\r\n for i in range(m):\r\n l = list(map(str, input().split()))\r\n print(l[0], l[1], '#', end = '')\r\n print(d[l[1][:-1]])", "n, m = list(map(int, input().split()))\ndic = {}\nfor i in range(n):\n a, b = input().split()\n dic[b] = a\nfor i in range(m):\n linea = input()\n a, b = linea.split()\n print(\"{} #{}\".format(linea, dic[b[0:-1]]))\n\t\t \t\t\t \t\t\t\t \t\t \t\t \t\t", "n, m = map(int, input().split())\r\nips = {}\r\nfor i in range(n):\r\n name, ip = map(str, input().split())\r\n ips[ip+';'] = name\r\nfor i in range(m):\r\n name1, ip1 = map(str, input().split())\r\n print(name1 +' '+ip1+' ' +'#'+ips[ip1])\r\n \r\n \r\n ", "import sys\r\ninput = sys.stdin.readline\r\nN,M = map(int,input().split())\r\nservers = {}\r\nfor n in range(N):\r\n name, ip = input().split()\r\n servers[ip] = name\r\n \r\nfor m in range(M):\r\n name,ip = input().split()\r\n print(name,ip, \"#\"+servers[ip[:-1]])", "name_ip = {}\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(n):\r\n\tname, ip = input().split()\r\n\tip += ';'\r\n\tname_ip[ip] = name\r\n\r\nfor j in range(m):\r\n\tcommand, Cip = input().split()\r\n\thash_name = '#' + name_ip[Cip]\r\n\tprint(command, Cip, hash_name)\r\n", "n,m = tuple(map(int,input().split()))\r\ndic = dict()\r\nquery =\"\"\r\nfor i in range(n + m):\r\n fun,ip = input().split()\r\n if ip[:-1] in dic:\r\n query += fun + \" \" + ip + \" #\" + dic[ip[:-1]] + \"\\n\"\r\n else:\r\n dic[ip] = fun\r\nprint(query)\r\n", "n,m= map(int,input().split())\r\nname=[]\r\nip=[]\r\nfor _ in range(n):\r\n s= input().split()\r\n name.append(s[0])\r\n ip.append(s[1])\r\nfor _ in range(m):\r\n q= input().split()\r\n q[1]= q[1].replace(\";\",\"\")\r\n for i in ip:\r\n if i in q:\r\n i= ip.index(i)\r\n ans= name[i]\r\n print(q[0]+str(\" \")+q[1]+\";\"+\" \"+\"#\"+ans)\r\n ", "n, m = map(int, input().split())\r\ndt = dict()\r\nfor _ in range(n):\r\n name, ip = input().split()\r\n dt[ip + ';'] = name\r\nfor _ in range(m):\r\n cmd, ip = input().split()\r\n print(cmd, ip, '#' + dt[ip])\r\n", "tmp=input().split(' ')\r\nn = eval(tmp[0])\r\nm = eval(tmp[1])\r\n\r\ndict = {}\r\n\r\nfor i in range(n):\r\n tmp = input().split(' ')\r\n dict[tmp[1]] = tmp[0]\r\n\r\nfor i in range(m):\r\n tmp = input()\r\n print(tmp+' #'+dict[tmp.split(' ')[1][0:-1]])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nmemo = dict()\r\nfor _ in range(n):\r\n data = input().split()\r\n memo[data[1]] = data[0]\r\n\r\nfor _ in range(m):\r\n data = input().split()\r\n print(data[0] + \" \" + data[1] + \" #\" + memo[data[1][:-1]])\r\n", "n, m = list(map(int, input().split()))\r\n\r\nd = {}\r\n\r\nfor i in range(n): \r\n name, ip = input().split()\r\n d[ip] = name\r\n\r\nfor i in range(m):\r\n cmd, ip = input().split()\r\n print(cmd, ip, '#' + d[ip.strip(';')])\r\n", "n,m = [int(x) for x in input().split(' ')]\nd = {}\nfor i in range(n):\n s,i = input().split(' ')\n d[i] = s\nfor i in range(m):\n s,ip = input().split(' ')\n print(s+\" \"+ip+\" #\"+d[ip[:-1]])\n", "n, m = map(int, input().split())\r\ndict = {}\r\nfor i in range(n):\r\n s = input().split()\r\n dict[s[1]] = s[0]\r\nfor i in range(m):\r\n ss = input()\r\n s = ss.split()\r\n ip = s[1][:-1]\r\n print(ss + \" #\" + dict[ip])\r\n", "n,m=[int(x) for x in input().split()]\r\ndic={}\r\nfor i in range(n):\r\n a=input().split()\r\n dic[a[1]]=a[0]\r\nfor i in range(m):\r\n a=input().split()\r\n print(a[0]+' '+a[1]+' '+'#'+dic[a[1][:-1]])\r\n", "n,m=map(int,input().split())\r\n\r\nl=[]\r\nfor i in range(n+m):\r\n\ts=list(map(str,input().split()))\r\n\tl.append(s)\r\nfor i in range(n,m+n):\r\n\tfor j in range(n):\r\n\t\tif l[i][1]==l[j][1]+\";\":\r\n\t\t\tprint(l[i][0]+\" \" +l[i][1] +\" #\"+l[j][0])\r\n", "def RadioStation():\r\n n,m = map(int, input().split(' '))\r\n Ln=[]\r\n Ln1= []\r\n for i in range(0,n):\r\n Ln= input().split(' ')\r\n Ln[1] += ';'\r\n Ln1.append(Ln)\r\n Lm=[]\r\n Lm1= []\r\n for i in range(0,m):\r\n Lm= input().split(' ')\r\n Lm1.append(Lm)\r\n #print(Lm1)\r\n #print(Ln1)\r\n \r\n for i in range (0,m):\r\n for j in range(0,n):\r\n \r\n if Lm1[i][1] == Ln1[j][1]:\r\n Lm1[i].append('#'+ str(Ln1[j][0]))\r\n \r\n comment= \"\"\r\n \r\n for i in Lm1 :\r\n comment = \" \".join(i)\r\n\r\n print(comment)\r\n \r\n\r\n\r\n\r\n \r\nRadioStation()\r\n", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n\tk = input().split()\r\n\tl.append((k[1]+';',k[0]))\r\nfor i in range(m):\r\n\th1 = input()\r\n\th = h1.split()\r\n\tk = ['#'+l[i][1] for i in range(n) if h[1]==l[i][0]]\r\n\tprint(*(h+k))", "\r\n#l = list(map(int, input().split()))\r\nn, m = map(int, input().split())\r\n\r\nservers = {}\r\n\r\nfor i in range(n):\r\n s_name, s_IP = input().split()\r\n servers[s_IP] = s_name \r\n\r\nfor j in range(m):\r\n s_name, s_IP = input().split()\r\n print(f\"{s_name} {s_IP[:-1]}; #{servers[s_IP[:-1]]}\")", "n,m=list(map(int,input().split()))\r\n\r\nsern = []\r\nips =[]\r\n\r\nfor k in range(n):\r\n t= list(input().split())\r\n sern.append(t[0])\r\n ips.append(t[1]+';')\r\nfor w in range(m):\r\n e = input()\r\n u =list(e.split())\r\n print(e+' #'+sern[ips.index(u[1])])\r\n \r\n", "x = input().split()\nn = int(x[0])\nm = int(x[1])\n\ndic = {}\nfor i in range(n):\n a = input().split()\n nombre = a[0]\n ip = a[1]\n dic[ip] = nombre\n\nnom = \" #\"\nc = \"\"\nfor i in range(m):\n b = input()\n listab = b.split()\n ipp = listab[1]\n ippp = ipp.replace(\";\",\"\")\n c = b + nom + dic[ippp]\n print(c)\n\n \t \t \t\t \t\t \t \t \t \t \t\t", "n=list(map(int,input().split()))\r\nl=[]\r\np=[]\r\nfor i in range(n[0]):\r\n m=list(map(str,input().split()))\r\n m[1]=m[1]+';'\r\n l.append(m)\r\nfor o in range(n[1]): \r\n b=list(map(str,input().split()))\r\n p.append(b) \r\nfor u in range(n[1]):\r\n for e in range(n[0]):\r\n \r\n if l[e][1]==p[u][1]: \r\n \r\n print(p[u][0],end=' ')\r\n print(p[u][1],end='') \r\n print(' #',end='') \r\n print(l[e][0])\r\n \r\n\r\n \r\n ", "a, b = map(int, input().split())\r\n\r\nmapping = {}\r\n\r\nwhile a:\r\n a-= 1\r\n s = list(input().split())\r\n mapping[s[1]+\";\"] = \"#\" + s[0]\r\n\r\nwhile b:\r\n b-=1\r\n ss = list(input().split())\r\n print(\" \".join(ss + [mapping[ss[1]]]))\r\n\r\n", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn,m=M()\nd=defaultdict(str)\nfor i in range(n):\n n=input().split()\n d[n[1]]=n[0]\nfor i in range(m):\n n=input().split()\n n.append('#'+d[n[1][:-1]])\n print(*n)\n \n \n", "n, m = map(int, input().split())\r\ndt = dict()\r\nfor i in range(n):\r\n\ta, b = input().split()\r\n\tdt[b+';']=(a)\r\nfor i in range(m):\r\n\tc, d = input().split()\r\n\tprint(c, d, '#'+dt.get(d))", "n, m = map(int, input().split())\r\nmp = {}\r\nfor i in range(n):\r\n\tx, y = map(str, input().split())\r\n\tmp[y] = x\r\nfor i in range(m):\r\n\tx, y = map(str, input().split())\r\n\ty1 = y[:-1]\r\n\tprint(x, y, end = ' ')\r\n\tprint('#', mp[y1], sep = '')", "n, m = [int(i) for i in input().split()]\r\nsites=[]\r\nfor i in range(n):\r\n b=input().split()\r\n sites.append(b)\r\nfor i in range(m):\r\n b=input().split()\r\n for j in sites:\r\n if j[1]==b[1][:-1]:\r\n b.append('#'+j[0])\r\n print(' '.join(i for i in b))\r\n break", "n, m = list(map(int, input().split()))\n\nnames = {}\nfor i in range(n):\n name, ip = input().split(\" \")\n names[ip] = name\n\nfor i in range(m):\n line = input()\n ip = line.split(\" \")[1][:-1]\n print(f\"{line} #{names[ip]}\")\n\n\t\t \t\t \t \t \t\t\t\t \t \t\t \t", "n,m=[*map(int,input().split())]\ndict1={}\nfor i in range(n):\n value1,key1=input().split()\n dict1[key1+';']='#'+value1\n\n# print(dict1)\n\nfor i in range(m):\n x,y=input().split()\n print(x,y,dict1[y])\n", "n, m = map(int, input().split())\n\ndict = {}\n\nfor i in range(n):\n ss = input().split()\n name = ss[0]\n ip = ss[1]\n dict[ip] = name\n\nres = []\n\nfor i in range(m):\n ss2 = input()\n chunks = ss2.split()\n ip2 = chunks[1].rstrip(';')\n res.append(f'{ss2} #{dict[ip2]}')\n\nfor r in res:\n print(r)\n\n\t \t \t\t \t\t \t\t\t\t \t\t\t\t", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,m=map(int,input().split())\r\nnames=[];ips=[]\r\nfor i in range(n):\r\n name,ip=map(str,input().split())\r\n ips.append(ip)\r\n names.append(name)\r\nfor i in range(m):\r\n name,ip=map(str,input().split())\r\n ip=ip[0:len(ip)-1]\r\n print(name,ip+\";\",\"#\"+names[(ips.index(ip))])", "(n,m)= list(map(int, input().split()))\n\na={}\nfor i in range(n): \n x,y=input().split() \n a[y]=x \n\n\nfor i in range(m): \n s=input() \n print(s,'#'+a[s.split()[1][:-1]])\n\n \t\t \t\t \t\t \t \t \t \t\t\t \t", "m,n = map(int,input().split())\r\nd = {}\r\nfor i in range(m):\r\n a,b = input().split()\r\n d[b] = a\r\nfor i in range(n):\r\n a,b = input().split()\r\n print(f'{a} {b} #{d[b[:-1]]}')", "# import sys\r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nN,M=map(int,input().split())\r\nL=[]\r\nX=[]\r\nfor i in range(N):\r\n\tL.append(input().split())\r\nfor i in range(M):\r\n\tX.append(input().split())\r\nfor i in X:\r\n\tfor j in L:\r\n\t\tS=i[1].replace(\";\",\"\")\r\n\t\tif \tS==j[1]:\r\n\t\t\tprint(*i,end=\" \")\r\n\t\t\tprint(\"#\",end=\"\")\r\n\t\t\tprint(j[0])\r\n\r\n", "l=[int(x) for x in input().split()]\r\nl1=[]\r\nfor i in range(l[0]+l[1]):\r\n l1.append([x for x in input().split()])\r\nfor i in range (l[0],l[0]+l[1]):\r\n for j in range(0,l[0]):\r\n if l1[i][1][0:-1]==l1[j][1]:\r\n print(l1[i][0]+\" \"+l1[i][1]+\" #\"+l1[j][0])", "n,t=map(int,input().split())\nd={}\nfor i in range(n):\n s,k=map(str,input().split())\n d[k]=s\nfor i in range(t):\n s,k=map(str,input().split())\n print(s,k,\"#\",end=\"\")\n print(d[k[:len(k)-1]])\n\t\t \t\t \t\t \t \t \t\t\t\t\t\t \t", "def add_comments(n, m, servers, commands):\r\n ip_to_name = {ip: name for name, ip in servers}\r\n\r\n result = []\r\n for command in commands:\r\n command_parts = command.split()\r\n ip = command_parts[1].rstrip(';')\r\n if ip in ip_to_name:\r\n server_name = ip_to_name[ip]\r\n command_parts[1] += f' #{server_name}'\r\n result.append(' '.join(command_parts))\r\n\r\n return result\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\nservers = []\r\nfor _ in range(n):\r\n name, ip = input().split()\r\n servers.append((name, ip))\r\ncommands = [input().rstrip() for _ in range(m)]\r\n\r\n# Add comments to the commands\r\nresult = add_comments(n, m, servers, commands)\r\n\r\n# Print the result\r\nfor line in result:\r\n print(line)\r\n", "n,m=map(int,input().split())\r\nl,d=[],{}\r\nfor i in range(n):\r\n\tl.append(input())\r\nfor i in l:\r\n\tx=i.split()\r\n\td.update({x[1]:x[0]})\r\nfor i in range(m):\r\n\tx=input().split()\r\n\tf=x[1][:len(x[1])-1]\r\n\ts=x[0]+' '+x[1]+' #'+d[f]\r\n\tprint(s)", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(n):\r\n name,ip=map(str,input().split())\r\n d[ip]=name\r\nfor _ in range(m):\r\n string=input()\r\n print(string+' #'+d[string.split()[1][:-1]]) ", "[n, m] = input().split()\r\nn, m = int(n), int(m)\r\nmap = {}\r\nwhile n:\r\n n -= 1\r\n [name, ip] = input().split()\r\n map[ip] = name\r\nwhile m:\r\n m -= 1\r\n [command, ip] = input().split()\r\n print(command, ip, '#' + map[ip[:-1]])", "n,m=(int(x) for x in input().split())\r\ns = []\r\nd = []\r\np = []\r\nq = []\r\nfor i in range(n):\r\n a,b=(x for x in input().split())\r\n s.append(a)\r\n d.append(b)\r\nfor i in range(m):\r\n a,b =(x for x in input().split())\r\n p.append(a)\r\n q.append(b)\r\n#print(s)\r\n#print(p)\r\nfor i in range(m):\r\n for j in range(n):\r\n #print(q[i],d[j])\r\n if q[i] == d[j]+';':\r\n z = p[i]+' '+q[i]+' #'+s[j]\r\n print(z)\r\n", "N,M = map(int, input().split())\nnameserver ={}\nwhile N>0:\n N-=1\n a,b = input().split()\n nameserver[b] = a\nwhile M>0:\n M-=1\n a,b = input().split()\n print(a + ' ' + b + ' ' +'#' +nameserver[b[:-1]])\n", "from collections import defaultdict\nnm = list(map(int, input().split()))\nn = nm[0]\nm = nm[1]\nmydict = defaultdict(str)\nres = []\nwhile n != 0:\n cmndip = str(input())\n cmndip = cmndip.split()\n if cmndip[1] not in mydict:\n mydict[cmndip[1]] = cmndip[0]\n n -= 1\n# print(mydict)\nwhile m != 0:\n inp = str(input())\n inp2 = inp\n inp2 = inp.split()\n # print(inp2)\n temp = inp + \" #\" + mydict[inp2[1][:-1]]\n res.append(temp)\n m -= 1\nfor val in res:\n print(val)\n", "n,m=map(int,input().split())\r\nlis=[]\r\nans=[]\r\nfor i in range(n):\r\n lis.append(input())\r\nfor i in range(m):\r\n m=input()\r\n for j in range(n):\r\n if(lis[j].find(m[m.find(\" \"):len(m)-1])!=-1):\r\n k=lis[j]\r\n print(m,\" #\",k[:k.find(\" \")],sep=\"\")\r\n break\r\n", "\r\n\r\n\r\nw = list(map(int, input().split(' ')))\r\nsv = w[0]\r\nip = w[1] \r\nn = sv+ip\r\n\r\nd = {}\r\narr = []\r\n\r\nfor i in range(sv):\r\n s = input().split(' ')\r\n d[s[1]] = s[0]\r\n\r\nfor i in range(ip):\r\n s = input().split(' ')\r\n h = s[1][:-1]\r\n \r\n if h in d:\r\n print(' '.join(s) + ' #' + d[h])\r\n\r\n\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\narrayStringName = []\r\narrayStringIp = []\r\n\r\nfor _ in range(n):\r\n\tname, ip = input().split()\r\n\tname = str(name)\r\n\tip = str(ip)\r\n\tarrayStringName.append(name)\r\n\tarrayStringIp.append(ip)\r\n\r\nfor i in range(m):\r\n\tip = \"\"\r\n\tcommandIp = str(input())\r\n\tfor j in range(len(commandIp)):\r\n\t\tif commandIp[j].isnumeric() == True or commandIp[j] == \".\":\r\n\t\t\tip += commandIp[j]\r\n\tgetIndexInArray = arrayStringIp.index(ip)\r\n\tprint(commandIp + \" #\" + arrayStringName[getIndexInArray])\r\n", "# cf 918 B 900\nn, m = map(int, input().split())\nrev = {}\nfor _ in range(n):\n name, ip = input().split()\n rev[ip] = name\nfor _ in range(m):\n name, ip = input().replace(';', '').strip().split()\n print(\"{} {}; #{}\".format(name, ip, rev[ip]))\n", "import math\r\nimport sys\r\nimport re\r\n\r\nn , m = map(int , input().rstrip().split())\r\nname = []\r\nip = []\r\nfor x in range(n):\r\n s = input()\r\n s1 = s.split(' ')\r\n name.append(s1[0])\r\n ip.append(s1[1])\r\n\r\nfor y in range(m):\r\n sin = input()\r\n s2 = sin.split(' ')\r\n a = ip.index(s2[1][:-1])\r\n print(sin + ' #{}'.format(name[a]))", "from functools import cmp_to_key as cmp\r\nimport sys\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\ns,t=map(int,input().split())\r\nd={}\r\nfor i in range(s):\r\n a,b=map(str,input().split())\r\n d[b]=a\r\nfor i in range(t):\r\n a,b=map(str,input().split())\r\n print(a,b,end=' ')\r\n print(\"#\",d[b[:-1]],sep='')", "n,m=[int(i) for i in input().split()]\r\na=[]\r\nb=[]\r\nc=[]\r\nd=[]\r\nfor i in range(n):\r\n x=input()\r\n a.append(x)\r\nfor i in a:\r\n x=i.split(\" \")\r\n b.append(x)\r\nfor i in range(m):\r\n x=input()\r\n s=x.split(\" \")\r\n for i in b:\r\n if i[1]==s[1][:-1:]:\r\n print(x,\"#\"+i[0])\r\n \r\n", "a, b = map(int, input().split())\r\n\r\nd = {}\r\n\r\nfor i in range(a):\r\n x, y = input().split()\r\n d[y] = x\r\n# print()\r\n# print(d)\r\n# s=\"harshyadav;\"\r\n# v=s[:len(s)-1] ##just checkin slicing in string\r\n# print(v)\r\n\r\nfor i in range(b):\r\n q, w = input().split()\r\n print(q,w,('#'+d[w[:len(w)-1]]))\r\n# print(d['192.168.0.2']+\"hd\")\r\n\r\n\r\n", "import sys\n\nn, m = map(int, sys.stdin.readline().split())\n\n# Step 2: Create a dictionary for IP-address-to-server-name mapping\nip_to_server = {}\n\n# Step 3: Read server names and IPs, and populate the dictionary\nfor _ in range(n):\n name, ip = sys.stdin.readline().split()\n ip_to_server[ip] = name\n\n# Step 4: Process each command in the configuration file\nfor _ in range(m):\n command = sys.stdin.readline().strip()\n\n # Step 5: Extract the IP address from the command\n ip = command.split()[1].rstrip(';')\n\n # Step 6: Look up the server name from the dictionary\n name = ip_to_server[ip]\n\n # Step 7: Append the server name as a comment at the end of the command line\n modified_command = command + f\" #{name}\"\n\n # Step 8: Print the modified command line\n sys.stdout.write(modified_command + '\\n')\n\n \t\t \t\t\t \t\t\t\t\t\t\t \t\t\t\t\t \t\t \t", "directrices = input()\n\ndirectrices = directrices.strip().split()\n\ndic = {}\nfor i in range(int(directrices[0])):\n server = input()\n server = server.strip().split()\n dic[server[1]] = server[0]\nfor i in range(int(directrices[1])):\n comando = input()\n comando = comando.strip().split()\n comando[1] = comando[1].replace(\";\",\"\")\n print(f\"{comando[0]} {comando[1]}; #{dic[comando[1]]}\")\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())\nl = []\nl2 = []\ns = ''\nfor i in range(n):\n b = input().split()\n l.append(b)\nfor j in range(m):\n s = ''\n a = input(\"\")\n for i in range(len(a)-1):\n if a[i] == ' ':\n for k in range(i+1,len(a)-1):\n s += a[k]\n break\n for i in range(n):\n if s == l[i][1]:\n l2.append(a + ' #')\n l2.append(l[i][0])\nfor i in range(0,m*2-1,2):\n print(l2[i]+l2[i+1])\n", "x=list(map(int,input().split()))\r\na=[]\r\nfor i in range(x[0]):\r\n p=list(map(str,input().split()))\r\n a.append(p)\r\nfor i in range(x[1]):\r\n m=list(map(str,input().split()))\r\n m[1]=m[1][:(len(m[1])-1)]\r\n for j in range(x[0]):\r\n if a[j][1]==m[1]:\r\n # print(a[j][1])\r\n print(m[0]+' '+m[1]+'; #'+a[j][0])\r\n break", "def main():\r\n n, m = list(map(int, input().split()))\r\n\r\n ip_map = {}\r\n for _ in range(n):\r\n temp = input().split()\r\n ip_map[temp[1]] = temp[0]\r\n\r\n for _ in range(m):\r\n temp = input().split()\r\n print(temp[0], temp[1], f\"#{ip_map[temp[1][:-1]]}\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "name=dict()\r\nn,m=[int(x) for x in input().split()]\r\nfor _ in range(n):\r\n na,ip=input().split()\r\n name[ip+';']=na\r\nfor _ in range(m):\r\n l=input()\r\n print(l,'#'+name[l.split()[1]])\r\n", "N,M = [int(i) for i in input().split()]\r\nServers = {}\r\nfor i in range(N):\r\n X = input().split()\r\n Servers[X[1]] = X[0]\r\nCommands = []\r\nfor i in range(M):\r\n Y = input()\r\n tY = Y.split()\r\n Y = Y+' #'+Servers[tY[1][:-1]]\r\n Commands.append(Y)\r\n\r\nfor i in Commands:\r\n print(i)", "n, m = map(int, input().split())\n\n# Step 2: Create a dictionary to store IP-server name mapping\nip_to_name = {}\n\n# Step 3: Read server names and IPs\nfor _ in range(n):\n name, ip = input().split()\n ip_to_name[ip] = name\n\n# Step 4: Process commands\nfor _ in range(m):\n command = input()\n\n # Step 5: Extract IP from command\n ip = command.split()[1].rstrip(';')\n\n # Step 6: Retrieve server name from the dictionary\n name = ip_to_name[ip]\n\n # Step 7: Append server name as a comment\n modified_command = command + \" #\" + name\n\n # Step 8: Print the modified command\n print(modified_command)\n \t \t \t \t\t \t \t \t \t \t \t", "n,m = map(int,input().split())\nd = {}\nfor i in range(n):\n a,b = input().split()\n d[b+\";\"] = a\nfor i in range(m):\n c,k = input().split()\n print(f\"{c} {k} #{d[k]}\") #print\n \t\t\t\t \t \t\t \t\t\t\t \t \t\t \t\t\t\t\t", "MyDict = dict()\r\nX = list(map(int, input().split()))\r\nfor i in range(X[0] + X[1]):\r\n Sentence = input().split()\r\n if Sentence[1][-1] == ';':\r\n print(Sentence[0] + \" \" + Sentence[1] + \" #\" + MyDict[Sentence[1][:-1]])\r\n else:\r\n MyDict[Sentence[1]] = Sentence[0]\r\n", "n,m=map(int,input().split())\nd={}\nfor i in range(n):\n a,b=input().split()\n d[b]=a\nfor i in range(m):\n s=input()\n a,b=s.split()\n b=b[:-1]\n print(s,\"#\"+d[b])\n \t\t \t \t\t\t\t \t\t \t \t \t \t", "a , b = map(int , input().split())\r\n\r\nnames = dict()\r\n\r\nfor i in range(a):\r\n x , y = input().split()\r\n names[y] = x\r\n\r\nfor i in range(b):\r\n com = input()\r\n\r\n h = com.split()[-1][:-1]\r\n print(f\"{com} #{names[h]}\")\r\n", "\n\nn, m = map(int, input().split())\n\nnames = {}\n\n#print(type(names))\n\nfor i in range(n):\n name, ip = input().split()\n names[ip] = name\n\nfor i in range(m):\n comando, ip = input().split()\n ip = ip[0:-1]\n\n print(f\"{comando} {ip}; #{names[ip]}\")\n \t\t\t\t\t\t\t \t \t\t \t \t\t \t \t\t \t", "from math import dist, ceil, floor, sqrt, log\r\nimport itertools\r\nimport math\r\nimport functools\r\nimport operator\r\nimport collections\r\nimport heapq\r\nimport re\r\nimport string\r\nfrom sys import stdin\r\ninp = 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\n\r\ndef main():\r\n n, m = IA()\r\n d = dict()\r\n for _ in range(n):\r\n name, ip = input().split()\r\n d[ip] = name\r\n\r\n for j in range(m):\r\n command = S()\r\n address = command.split()[-1][:-1]\r\n print(command, '#'+d[address], sep=' ')\r\n\r\n return None\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\r\nservers = {}\r\nfor i in range(n):\r\n name, ip = map(str, input().split())\r\n servers[ip] = name\r\nfor i in range(m):\r\n command, ip = map(str, input().split())\r\n name = servers[ip[:-1]]\r\n print('{} {} #{}'.format(command, ip, name))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "if __name__ == \"__main__\":\r\n n,m = list(map(int,input().split()))\r\n d = {}\r\n while n:\r\n s = input().split(\" \")\r\n d[s[-1] + ';'] = s[0]\r\n n = n - 1\r\n while m:\r\n ss = input()\r\n print( ss.split(\" \")[0] + ' '+ss.split(\" \")[-1] + ' #' + d[ss.split(\" \")[-1]] )\r\n m = m - 1 ", "d = {}\r\nn, m = map(int, input().split())\r\nfor _ in range(n):\r\n name, ip = map(str, input().split())\r\n d.__setitem__(ip, name)\r\ncomm = []\r\nip = []\r\nfor _ in range(m):\r\n c, i = map(str, input().split())\r\n i = i.strip(';')\r\n comm.append(c)\r\n ip.append(i)\r\nfor x in range(m):\r\n c = comm[x]\r\n i = ip[x]\r\n print(c, i, sep = \" \", end = \"; #\")\r\n print(d[i])", "n , m = map(int , input().split())\r\n\r\nservers = {}\r\ncommands = {}\r\n\r\nfor _ in range(n):\r\n name , ip = input().split()\r\n servers[ip] = name\r\n \r\nfor i in range(m):\r\n name , ip = input().split()\r\n print(name , ip , \"#\"+servers[ip[:-1]] )", "l=dict()\r\nfor _ in \" \"*(sum(map(int,input().split()))):\r\n z,x=map(str,input().split());x=x.rstrip(\";\")\r\n if x not in l:l[x]=z\r\n else:print(z+\" \"+x+\"; #\"+l.get(x))\r\n", "n, m = list(map(int,input().split()))\n\nservers = {}\nfor i in range(n):\n nombre, ip = input().split()\n servers[ip] = nombre\nfor i in range(m):\n comando, ip = input().strip(\";\").split()\n print(comando+\" \"+ip+\";\"+\" #\"+servers[ip])\n\t \t \t\t\t\t \t \t\t\t \t \t\t\t \t\t", "from sys import stdin\n\nn, m = map(int, stdin.readline().strip().split())\n\nip_to_name = {}\nfor _ in range(n):\n\tname , ip = stdin.readline().strip().split()\n\tip_to_name[ip] = name\n\nfor _ in range(m):\n\tcommand = stdin.readline().strip(';\\n')\n\tip = command.split()[1]\n\tprint(command + f\"; #{ip_to_name[ip]}\")\n\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 fractions import gcd\r\nreadints=lambda:map(int, input().strip('\\n').split())\r\n\r\n\r\nn,m=readints()\r\n\r\nip2name = {}\r\nfor _ in range(n):\r\n name,ip = input().split(' ')\r\n ip2name[ip] = name\r\n\r\nfor _ in range(m):\r\n cmd,ip = input().split(' ')\r\n print('%s %s #%s' % (cmd,ip,ip2name[ip[:-1]]))\r\n \r\n", "\r\nn,m=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n x,y=input().split()\r\n d[y]=x\r\nfor i in range(m):\r\n a,b=input().split()\r\n print(a,b,'#'+d[b[:len(b)-1]])", "nm = input().split(' ')\nfor i in range(2):\n nm[i] = int(nm[i])\nname = {}\nfor i in range(nm[0]):\n ip = input().split(' ')\n name[ip[1]] = ip[0]\n\nlistac = []\nfor i in range(nm[1]):\n comando = input()\n ip = comando.split(' ')[1].replace(';', '')\n listac.append(comando + ' #' + name[ip])\n\nfor i in listac:\n print(i)\n\n \t \t \t \t\t\t\t\t\t\t\t\t \t \t \t \t", "n,m=list(map(int,input().strip().split(\" \")))\ndic={}\nfor i in range(n):\n a,b=input().strip().split(\" \")\n dic[b]=a\nfor i in range(m):\n linea=input()\n a,b=linea.strip().split(\" \")\n print(\"{} #{}\".format(linea,dic[b[0:-1]]))\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\nh={}\r\nfor i in range(n):\r\n a=input()\r\n name,ip=a.split()\r\n h[ip]=name\r\n#print(h) \r\nfor i in range(m):\r\n a=input()\r\n name,ip=a.split()\r\n s=ip.replace(';','')\r\n s1='#'+h[s]\r\n print(a,s1)\r\n ", "n, m = [int(x) for x in input().split()]\r\nservers = []\r\ncommands = []\r\ndictionary = {}\r\n\r\nfor i in range(n):\r\n name, ip = [x for x in input().split()]\r\n # print(name, ip)\r\n servers.append((name, ip))\r\n dictionary.update({ip: name})\r\n\r\nfor i in range(m):\r\n command, ip = [x for x in input().split()]\r\n ip = ip[:len(ip)-1]\r\n commands.append((command, ip))\r\n\r\nfor i in range(m):\r\n print(f\"{commands[i][0]} {commands[i][1]}; #{dictionary[commands[i][1]]}\")\r\n\r\n", "n, m = list(map(int, input().split()))\nvez = {}\nfor i in range(n):\n comm, ip = input().split()\n vez[ip] = comm\nfor j in range(m):\n co, ip = input().split()\n ip = ip[:-1]\n print(co, ip+';', '#'+vez[ip])", "from collections import defaultdict as dd\r\nn,m=map(int,input().split())\r\nd={}\r\nfor i in range(0,n):\r\n b=input().strip()\r\n l=b.split()\r\n if l[1] not in d:\r\n d[l[1]]=l[0]\r\nfor i in range(0,m):\r\n b=input().strip()\r\n l=b.split(\" \")\r\n x=len(l[1])\r\n a=l[1][0:x-1]\r\n print(l[0],l[1],'#'+d[a])\r\n \r\n ", "nstr, mstr = input().split(' ')\r\nn = int(nstr)\r\nm = int(mstr)\r\nservers = {}\r\n\r\nfor i in range(n):\r\n name, ip = input().split(' ')\r\n servers[ip + ';'] = name\r\n\r\nfor i in range(m):\r\n cmd, ip = input().split(' ')\r\n print(cmd, ip, \"#\"+ servers[ip])\r\n", "n, m=input().split()\r\n\r\ndic={}\r\nfor a in range(int(n)):\r\n name, ip=input().split()\r\n dic[ip+\";\"]=name\r\n\r\n\r\nfor a in range(int(m)):\r\n com, ip=input().split()\r\n print(com, ip+\" #\"+dic[ip])", "n, m = map(int, input().split())\r\nd = {}\r\nfor _ in range(n):\r\n name, ip = input().split()\r\n d[ip] = name\r\n\r\nfor i in range(m):\r\n name, ip = input().split()\r\n ip = ip[:len(ip)-1]\r\n print(\"{} {}; #{}\".format(name, ip, d[ip]))\r\n\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n s,t=map(str,input().split())\r\n arr.append([\"#\"+s,t+\";\"])\r\nbrr=[]\r\nfor i in range(m):\r\n s,t=map(str,input().split())\r\n brr.append([s,t])\r\nfor i in range(m):\r\n for j in range(n):\r\n if brr[i][1]==arr[j][1]:\r\n print(brr[i][0]+\" \"+brr[i][1]+\" \"+arr[j][0])", "def main():\n first_in = [int(i) for i in input().split(\" \")]\n num_ip = first_in[0]\n num_config = first_in[1]\n\n ip_name_mapping = {}\n for _ in range(0, num_ip):\n ip = input().split(\" \")\n ip_name_mapping[ip[1]] = ip[0]\n\n for _ in range(0, num_config):\n config = input()\n config_ip = config.split(\" \")[1][:-1]\n name = ip_name_mapping[config_ip]\n print(\"{} #{}\".format(config, name))\n\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,m=list(map(int,input().split()))\r\na={}\r\nfor i in range(n):\r\n name,ip1=list(map(str,input().split()))\r\n a[ip1]=name\r\nfor i in range(m):\r\n command,ip2=list(map(str,input().split()))\r\n print(command,ip2,\"#\"+a[ip2[:-1]])\r\n\r\n", "import sys\nn, m = map(int, sys.stdin.readline().split())\nip_server = {}\nfor _ in range(n):\n name, ip = sys.stdin.readline().split()\n ip_server[ip] = name\nfor _ in range(m):\n command = sys.stdin.readline().strip()\n ip = command.split()[1].rstrip(';')\n name = ip_server[ip] \n modified_command = command + f\" #{name}\"\n sys.stdout.write(modified_command + '\\n')\n\t \t\t \t \t\t \t\t\t\t \t\t\t\t\t \t", "n_servers_names, n_commands = input().split(\" \")\n\nname_dict = {}\nfor n in range(int(n_servers_names)):\n name, ip = input().split(\" \")\n name_dict[ip] = name\ncommand_list = []\nfor _ in range(int(n_commands)):\n command_list.append(input())\n\nfor command in command_list:\n ip_command = command.split(\" \")[1][:-1]\n print(f\"{command} #{name_dict[ip_command]}\")\n\t \t\t\t \t \t \t \t \t\t \t \t\t\t\t", "n, m = map(int, input().split())\n\ndustin = {}\nfor i in range(n):\n nome, ip = input().split()\n dustin[ip + ';'] = nome\n\nfor i in range(m):\n nome, ip = input().split()\n print(nome, ip, '#' + dustin[ip])\n \n \t\t\t\t \t \t \t\t\t\t\t\t\t \t\t", "n,m=map(int,input().split())\nd1={}\nfor _ in range(n):\n ser,ip=map(str,input().split())\n d1[ip]=ser \nfor _ in range(m):\n cmd,ip=map(str,input().split())\n print(cmd+\" \"+ip+\" #\"+d1[ip[:-1]])\n\t \t \t \t \t\t\t \t \t\t \t\t", "n, m = [int(i) for i in input().split(' ')]\nob = {}\nfor i in range(n):\n name, ip = [j for j in input().split(' ')]\n ob[ip] = name\nfor i in range(m):\n cmd, ip = [j for j in input().split(' ')]\n print(f'{cmd} {ip} #{ob[ip[:-1]]}')\n\n\t \t \t\t \t \t\t\t \t \t\t\t \t", "n,m=[int(x) for x in input().split()]\r\nres=[]\r\nM=[]\r\nD=[]\r\nfor i in range(n):\r\n s=[x for x in input().split()]\r\n M.append(s[0])\r\n D.append(s[1])\r\nfor i in range(m):\r\n ch=[x for x in input().split()]\r\n res.append(\" \".join(ch)+ \" #\"+M[D.index(ch[1].strip(\";\"))])\r\nfor k in res:\r\n print(k)", "n,m = map(int,input().split())\r\ns = {}\r\nfor i in range(n):\r\n\ta,b = map(str,input().split())\r\n\ts[b] = a\r\n\r\nfor i in range(m):\r\n\ta,b = map(str,input().split())\r\n\tc = b.replace(b[-1],\"\")\r\n\tprint(a+' '+b+' '+\"#\"+s.get(c))", "db = {}\r\ninp = list(map(int, input().split(' ')[:2]))\r\nn = inp[0]\r\nm = inp[1]\r\n\r\ndef get_ip(command):\r\n ip = \"\"\r\n for x in command:\r\n if x != ';':\r\n ip = ip + x\r\n return ip\r\n\r\nfor i in range(0, n):\r\n inp = list(map(str, input().split(' ')[:2]))\r\n server = inp[0]\r\n ip = inp[1]\r\n db[ip] = server\r\nfor i in range(0, m):\r\n inp = list(map(str, input().split(' ')[:2]))\r\n command = inp[0]\r\n ip = get_ip(inp[1])\r\n server = db[ip]\r\n log = command + \" \" + ip + \"; #\" + server\r\n print(log)", "from sys import *\r\n\r\ndef input():\r\n return stdin.readline().split()\r\n\r\ndef input_i():\r\n return map(int, input())\r\n\r\ndef input_s():\r\n return map(str, input())\r\n\r\ndef main():\r\n n, m = input_i()\r\n r = []\r\n t = []\r\n q = []\r\n w = []\r\n for i in range(n) :\r\n a, b = input_s()\r\n r.append(a)\r\n t.append(b + ';')\r\n \r\n for i in range(m) :\r\n a, b = input_s()\r\n q.append(a)\r\n w.append(b)\r\n \r\n for i in range(m) :\r\n for j in range(n) :\r\n if w[i] == t[j] :\r\n print(q[i] + \" \" + w[i] + \" #\" + r[j])\r\nmain()", "no_of_servers , no_of_commands = map(int , input().split(\" \"))\n\nservers = [input().split(\" \") for i in range(no_of_servers)]\ncommands = [input().split(\" \") for i in range(no_of_commands)]\n\nserver_name = [i[0] for i in servers]\nserver_ip = [i[1] for i in servers]\n\nnew_name = [' '.join(i) + \" #\" + server_name[server_ip.index(i[1][:-1])] for i in commands]\nfor i in new_name :\n print(i)\n\n", "n, m = map(int, input().split())\r\nnl = []\r\nfor i in range(n):\r\n nl.append(input().split())\r\n nl[i][1] += \";\"\r\nfor i in range(m):\r\n cl = input().split()\r\n for q in range(len(nl)):\r\n if nl[q].count(cl[-1]) > 0:\r\n dd = cl[0] + \" \" + cl[1]\r\n print(f'{dd} #{nl[q][0]}')\r\n", "servers = {}\r\nn, m = map(int,input().split())\r\nfor i in range(n):\r\n s = input().split()\r\n servers[s[1]] = s[0]\r\nfor i in range(m):\r\n s = input().split()\r\n print(*s,end = ' ')\r\n print(\"#\" + servers[s[1][:-1]])\r\n ", "n,m=map(int,input().split())\r\nservers={}\r\nfor _ in range(n):\r\n\ttemp=input().split()\r\n\tservers[temp[1]]=temp[0]\r\ncommans=tuple(input().split() for i in range(m))\r\nans=[f'{c} {i} #{servers[i[:-1]]}' for c,i in commans]\r\nprint(*ans,sep=\"\\n\")", "n,m=map(int,input().split())\r\nkol=[]\r\nfor i in range(n):\r\n x=input()\r\n kol.append(x)\r\nfor i in range(m):\r\n a=input().split()\r\n a1=a[1]\r\n for j in range(n):\r\n y=kol[j].split()\r\n y1=y[1]\r\n if(len(y1)==len(a1)-1):\r\n z=True\r\n for k in range(len(y1)):\r\n if(y1[k]!=a1[k]):\r\n z=False\r\n if(z):\r\n for l in a:\r\n print(l,end=' ')\r\n print(\"#\"+y[0])\r\n \r\n \r\n \r\n", "n, m = (int(i) for i in input().split())\nmapping = {}\nfor _ in range(n):\n name, ip = input().split()\n mapping[ip] = name\nfor _ in range(m):\n s = input()\n ip = s[s.index(\" \") + 1 : s.index(\";\")]\n res = f\"{s} #{mapping[ip]}\"\n print(res)\n", "n,m=map(int,input().split())\r\ndct=dict()\r\nfor i in range(n):\r\n a,b=input().split()\r\n dct[b] =a\r\nfor i in range(m):\r\n a,b = input().split()\r\n print(a,b,\"#\"+dct[b[:len(b)-1]])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 26 16:21:10 2020\r\n\r\n@author: user\r\nLink :https://codeforces.com/problemset/problem/918/B\r\n\"\"\"\r\nn,m = map(int,input().split())\r\nd = {}\r\nfor i in range(n):\r\n name,ip = map(str,input().split())\r\n d[ip] = name\r\nfor j in range(m):\r\n a,b = map(str,input().split())\r\n c = b.rstrip(';')\r\n ans = a +' '+ b +' #'+d[c]\r\n print(ans)", "n , m = map(int,input().split())\r\nd = {}\r\nfor i in range(n):\r\n temp = input().split()\r\n d[temp[1]] = temp[0]\r\nfor i in range(m):\r\n temp = input()\r\n data = temp.split()\r\n print(temp,end = \" \")\r\n print(\"#\"+d[data[1][:-1]])", "a = input().split()\nfor i in range(2):\n\ta[i]=int(a[i])\ndic = {}\nfor i in range(a[0]):\n\tls = input().split()\n\tdic[ls[1]]=ls[0]\n\nfor i in range(a[1]):\n\tls1= input().split()\n\tb = \"\"\n\td=\"\"\n\tc= \"\"\n\tb = ls1[1]\n\tc=b[:len(b)-1]\n\td = dic[c]\n\tprint(ls1[0]+\" \" +ls1[1] + \" #\" + d )\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n, m = map(int, input().split())\niptoname = {}\nfor i in range(n):\n name, ip = input().split()\n iptoname[ip] = name\nfor j in range(m):\n command, ip = input().split()\n x = ip.replace(\";\", \"\")\n print(command, ip, \"#\" + iptoname[x])\n###\n \t\t\t \t \t\t \t \t\t \t\t", "import sys\nli = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\nrw = lambda : sys.stdin.readline().strip().split()\nni = lambda : int(sys.stdin.readline().strip())\nnsi = lambda : sys.stdin.readline().strip()\n\nfrom collections import defaultdict as df\nfrom math import *\n\nn,m=map(int,input().split())\n\nd={}\n\nfor i in range(n):\n name,ip=input().split()\n d[ip]=name\n\nfor i in range(m):\n a,b=input().split()\n b=b[:-1]\n print(a,\" \"+b+'; #'+d[b])\n", "def solve():\n for line in lines:\n ip = line[1][:-1]\n print(' '.join(line) + ' #' + d[ip])\n\n\ndef main():\n global n, m, d, lines\n n, m = list(map(int, input().split()))\n d = dict()\n for _ in range(n):\n name, ip = tuple(input().split())\n d[ip] = name\n lines = [input().split() for _ in range(m)]\n solve()\n\n\nmain()\n", "n,m = map(int, input().split())\ndct = {}\nfor _ in range(n):\n name, ip = input().split()\n dct.setdefault(ip,name)\n\nfor _ in range(m):\n cmd,ip = input().split()\n print(cmd,ip, \"#\" + dct[ip[:-1]])\n", "n, m = map(int, input().split())\r\nserver_name = {}\r\n\r\nfor _ in range(n):\r\n name, ip = input().split()\r\n server_name[ip] = name\r\n\r\nfor _ in range(m):\r\n command, ip = input()[:-1].split()\r\n print(' '.join((command, ip + ';', '#' + server_name[ip])))", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out1.out\",'w')\r\nn,m=map(int,input().split())\r\nname=[]\r\nip=[]\r\nfor i in range(n):\r\n\ta,b=input().split()\r\n\tname.append(a)\r\n\tip.append(b+\";\")\r\n\r\nfor i in range(m):\r\n\tc,d=input().split()\t\r\n\tx=ip.index(d)\r\n\tprint(c+\" \"+d+\" #\"+name[x])\r\n\t", "n,m=map(int,input().strip().split())\r\nd={}\r\nfor _ in range(n):\r\n name,ip=map(str,input().strip().split())\r\n d[ip]=name\r\nfor _ in range(m):\r\n com,ip=map(str,input().strip().split())\r\n ips=ip[:len(ip)-1]\r\n print(com,ip,\"#\"+d[ips])", "a, b = [int(x) for x in input().split()]\nname_dict = {}\nfor i in range(a):\n\tc, d = input().split()\n\tname_dict[d] = c\nfor i in range(b):\n\te, f = input().split()\n\tprint(\"%s %s #%s\"%(e, f, name_dict[f[:-1]]))\n\tname_dict[f[:-1]]", "n, m = (int(i) for i in input().split(\" \"))\r\ni = 0\r\n\r\nserver_names = {}\r\n\r\nfor i in range(n):\r\n name, ip = input().split(\" \")\r\n server_names[ip] = name\r\n\r\nfor i in range(m):\r\n command = input()\r\n print(command, end=\"\")\r\n ip = command.split()[1][:-1]\r\n print(\" #\"+server_names[ip])", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(n):\r\n s=list(input().split())\r\n d[s[1]]=s[0]\r\nfor _ in range(m):\r\n x=list(input().split())\r\n print(x[0]+\" \"+x[1]+\" #\"+d[x[1][:-1]])", "n, m = map(int, input().split())\r\nini_ip = []\r\nfor _ in range(n):\r\n ini_ip.append(input().split())\r\nfin_ip = []\r\nfor _ in range(m):\r\n fin_ip.append(input().split())\r\n# print(ini_ip)\r\n# print(fin_ip)\r\nans = []\r\nfor i in range(m):\r\n for arr in ini_ip:\r\n if fin_ip[i][1][:-1] == arr[1]:\r\n ans.append([fin_ip[i][0], fin_ip[i][1], \"#\"+arr[0]])\r\nfor arr in ans:\r\n print(\" \".join(arr))", "n, m = map(int, input().split())\n\nip_to_name = {}\n\nfor _ in range(n):\n name, ip = input().split()\n ip_to_name[ip] = name\n\nfor _ in range(m):\n command = input().strip()\n ip = command.split()[1][:-1] # Extract the IP address from the command\n if ip in ip_to_name:\n updated_command = command + \" #\" + ip_to_name[ip]\n else:\n updated_command = command\n print(updated_command)\n\n\t \t \t \t \t\t \t \t \t \t\t \t \t", "n, m = map(int, input().split())\n\nserver = dict()\n\nfor _ in range(n):\n name, ip = input().split()\n server[ip + ';'] = '#' + name\n\nfor _ in range(m):\n command, ip = input().split()\n print(command, ip, server[ip])\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\n# sys.stdin=open('input.txt', 'r')\n# sys.stdout=open('output.txt', 'w')\n\nn, m=[int(k) for k in input().split()]\nmydict={}\nfor i in range(n):\n name, ip=[k for k in input().split()]\n mydict[ip]=name\nfor i in range(m):\n act, ipid=[k for k in input().split()]\n st=act+' '+ipid\n ipid=\"\".join(list(ipid)[:-1])\n print(st, '#'+mydict[ipid])\n \n\t\t\t\t\t \t\t\t\t \t \t \t \t\t\t\t \t \t", "x, y = map(int, input().split())\r\nz = {}\r\nfor i in range (x):\r\n a = input()\r\n value, key = a.split()\r\n key+=';'\r\n z[key] = value\r\nfor j in range(y):\r\n b = input()\r\n b1, b2 = b.split()\r\n print(f'{b} #{z.get(b2)}')", "z,x=map(int,input().split())\r\nd={}\r\nfor i in range(z):\r\n\ta,b=map(str,input().split())\r\n\td[b]=a\r\nfor i in range(x):\r\n\tc,v=map(str,input().split())\r\n\ty=v[:len(v)-1]\r\n\tif y in d:\r\n\t\tprint(c,v,\"#\"+d[y])", "n,m=map(int,input().split())\nname=[]\nip=[]\nfor i in range(n):\n a,b=input().split()\n b=b+\";\"\n name.append(a)\n ip.append(b)\nfor i in range(m):\n a,b=input().split()\n \n k=ip.index(b)\n print(a,b,\"#\"+name[k])\n\n", "if __name__ == \"__main__\":\n n, m = map(int, input().split())\n s, r = [], []\n for i in range(n):\n x = tuple(input().split())[::-1]\n s.append(x)\n d = dict(s)\n for i in range(m):\n x = tuple(input().split())[::-1]\n r.append(\" \".join(x[::-1]) + \" #{}\".format(d.get(x[0][:-1])))\n \n for i in r:\n print(i)\n \t \t\t\t\t\t \t \t \t \t\t\t\t", "n,m = map(int,input().split())\r\nd = {}\r\nfor i in range(n):\r\n x,y = input().split()\r\n d.update({y:x})\r\nfor i in range(m):\r\n x,y = input()[:-1].split()\r\n print(x+' '+y+'; #'+d.get(y))\r\n", "n,m=map(int,input().split())\n\ndi=dict(reversed(input().split()) for _ in range(n))\n\nfor _ in range(m):\n\n s=input()\n\n print(s+' #'+di[s.split()[1][:-1]])\n\n\n\n# Made By Mostafa_Khaled", "n, m = [int(x) for x in input().split(' ')]\r\nservers = {}\r\nfor server in range(n):\r\n s = input().split(' ')\r\n servers[s[1]] = s[0]\r\nfor command in range(m):\r\n c = input()\r\n out = c + ' #' + servers[c.split(' ')[1][:-1]]\r\n print(out)", "n=list(map(int,input().split()))\r\nlst=[]\r\nfor i in range(n[0]):\r\n n1=input().split()\r\n lst.append(n1)\r\nfor j in range(n[1]):\r\n n2=input().split()\r\n for k in lst:\r\n s=str(n2[1])\r\n w=s[:-1]\r\n if(w==k[1]):\r\n print(n2[0],n2[1],'#'+k[0])\r\n \r\n\r\n", "n,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nc=[]\r\nd=[]\r\ny=[\";\",\" \",\"#\"]\r\nz=[]\r\nfor i in range(n):\r\n e=input()\r\n e=list(e)\r\n for j in range(len(e)):\r\n if ord(e[j])==32:\r\n a.append(e[:j+1])\r\n b.append(e[j+1:])\r\n break\r\nfor i in range(m):\r\n f=input()\r\n f=list(f)\r\n for j in range(len(f)):\r\n if ord(f[j])==32:\r\n c.append(f[:j+1])\r\n d.append(f[j+1:len(f)-1])\r\n break\r\nfor i in range(m):\r\n for j in range(n):\r\n if d[i]==b[j]:\r\n z.append(c[i]+d[i]+y+a[j])\r\nfor i in range(len(z)):\r\n for j in range(len(z[i])):\r\n print(z[i][j],end=\"\")\r\n print(\"\")\r\n", "n,m = map(int, input().split())\r\nname = []\r\nip = []\r\nfor i in range(n):\r\n a, b = map(str, input().split())\r\n name.append(a)\r\n ip.append(b)\r\nfor i in range(m):\r\n a = input()\r\n b = a.split()[1][:-1]\r\n i = ip.index(b)\r\n print(f'{a} #{name[i]}')", "n, m = map(int, input().split())\r\n\r\ndic = {}\r\n\r\nfor i in range(n):\r\n a, b = input().split()\r\n dic[b] = a\r\n\r\nfor i in range(m):\r\n s = input()\r\n a, b = s.split()\r\n b, _ = b.split(';')\r\n print(s, '#' + dic[b])", "a,b=map(int,input().split())\nd={}\nfor i in range(a):\n l=list(map(str,input().split()))\n d[l[1]]=l[0]\nfor i in range(b):\n c1,c2=map(str,input().split())\n fc=c2.replace(';','')\n print(c1,c2,'#'+d[fc])\n \n \t \t \t\t\t \t \t\t\t\t \t\t\t\t", "n,m = [int(x) for x in input().split(' ')]\notrono=[]\nnose = []\nreg = []\nfor i in range(n):\n name, ip = [x for x in input().split(' ')]\n otrono.append(name)\n nose.append(ip)\n\nfor i in range(m):\n name, ip = [x for x in input().split(' ')]\n id = nose.index(ip.replace(';',''))\n reg.append([name,ip,'#'+otrono[id]])\nfor i in reg:\n print(*i)\n\t\t \t\t\t\t \t \t \t\t \t\t\t\t\t \t", "f=lambda:map(int,input().split())\r\nn,m=f()\r\nd=dict()\r\nwhile n:\r\n a,b=input().split()\r\n d[b]=a\r\n n-=1\r\nwhile m:\r\n a,b=input().split()\r\n b=b.replace(b[-1],'')\r\n print(a,b+';','#'+d[b])\r\n m-=1", "l=list(map(int,input().split()))\nn=l[0]\nm=l[1]\nd={}\nfor i in range(n):\n p=input().split()\n d[p[1]]=p[0]\nfor j in range(m):\n k=input().split()\n o=k[1].split(\";\")\n print(k[0]+\" \"+k[1]+\" #\"+d[o[0]])\n \n\t\t\t \t\t\t \t \t \t \t\t \t \t", "n, m = map(int, input().split())\r\n\r\nd = dict()\r\nfor _ in range(n):\r\n x, y = input().split()\r\n d[y] = x\r\n\r\nfor _ in range(m):\r\n s = input()\r\n print(s + ' #' + d[s.split()[1][:-1]])\r\n", "n,m=map(int,input().split())\r\nD={}\r\nfor i in range(n):\r\n L=input()\r\n key,ip=L.split()\r\n ip=ip+\";\"\r\n D[ip]=key\r\nfor j in range(m):\r\n L=input()\r\n key,IP=L.split()\r\n name=D[IP]\r\n print(key+\" \"+IP+\" \"+\"#\"+name)\r\n \r\n\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(n):\r\n name,ide=input().split()\r\n d[ide]=name\r\nfor i in range(m):\r\n comm,ide=input().split()\r\n print(comm,ide,'#'+d[ide[0:-1]])", "n, m = map(int, input().split())\r\nd = {}\r\nfor _ in range(n):\r\n a, b = input().split()\r\n d[b] = a\r\n \r\nfor _ in range(m):\r\n a, b = input().split()\r\n print('{} {} #{}'.format(a, b, d[b[:-1]]))", "n, m = map(int, input().split())\r\ndatubaze = {}\r\nfor i in range(n):\r\n name, ip = input().split()\r\n datubaze[ip + \";\"] = name \r\nfor i in range(m):\r\n comand, ip = input().split()\r\n print(comand, ip, \"#\" + datubaze[ip])", "n,q = map(int,input().split())\nd = {}\nres = []\nfor _ in range(n):\n x,y = input().split()\n d[y] = x\nfor _ in range(q):\n x1,y1 = input().split()\n res.append(x1+\" \"+y1+\" #\"+d[y1[:-1]])\nprint(*res,sep = \"\\n\")\n \t \t\t\t\t \t \t\t\t\t \t \t\t\t\t \t", "d = {}\na,b = map(int,input().split())\nfor i in range(a):\n x,y = input().split()\n d[y+\";\"] = x\n#print(d)\nfor i in range(b):\n ls = list(input().split())\n print(f\"{ls[0]} {ls[1]} #{d[ls[1]]}\")\n\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\nval_dict = {}\r\nfor _ in range(n):\r\n x, y = input().split()\r\n val_dict[y] = x\r\n \r\nfor i in range(m):\r\n val = input()\r\n print(val, \"#\"+val_dict[val.split()[1][:-1]])", "no_ip , no_cmd = input().split()\r\nno_ip = int(no_ip)\r\nno_cmd = int(no_cmd)\r\nlst_ip=[]\r\nlst_cmd = []\r\ni=1\r\nwhile i <= no_ip:\r\n s = input()\r\n lst_ip.append(s)\r\n i+=1\r\ni =1\r\nwhile i <= no_cmd:\r\n s = input()\r\n lst_cmd.append(s)\r\n i+=1\r\nfor i in lst_cmd:\r\n c_ip = i.replace(\";\",\"\").split()\r\n for j in lst_ip:\r\n asd = j.split()\r\n if c_ip[-1] == asd[-1] :\r\n print(i,\"#\"+asd[0])", "n,m = map(int,input().split())\ntmp={}\nfor i in range(n):\n name,ip=input().split()\n ip+=\";\"\n tmp[ip]=name\nfor i in range(m):\n name,ip=input().split()\n print(name,ip,\"#\",end=\"\")\n print(tmp[ip])", "n,m=map(int,input().split())\r\nj={}\r\nfor i in range(n):\r\n k=input().split()\r\n b,v=k[0],k[1]+\";\"\r\n j[v]=b\r\nfor i in range(m):\r\n v=input().split()\r\n b,h=v[0],v[1]\r\n print(f\"{b+' '+h} #{j[h]}\")", "d = dict()\r\nn, m = map(int, input().split())\r\nfor _ in range(n):\r\n name, ip = input().split()\r\n d[ip] = name\r\nfor _ in range(m):\r\n name, ip = input().split()\r\n print(name, ip, \"#\" + d[ip[:len(ip) - 1]])\r\n", "def main():\r\n\tn, m = map(int, input().split())\r\n\tp = {}\r\n\tfor i in range(n + m):\r\n\t\ta, b = input().split()\r\n\t\tif b[:-1] in p:\r\n\t\t\tprint(a, b + ' #' + p[b[:-1]])\r\n\t\telse:\r\n\t\t\tp[b] = a\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nserver, ip = map(list, (zip(*[input().split() for _ in range(n)])))\r\nfor _ in range(m):\r\n a, b = w = input().split()\r\n w.append('#'+server[ip.index(b[:-1])])\r\n print(*w)", "n,m=map(int,input().split())\r\nl=[]\r\nl3=[]\r\nfor i in range(n):\r\n\ta,b=input().split()\r\n\tl3.append(a)\r\n\tl.append(b)\r\nfor i in range(m):\t\r\n\ta,b=input().split()\r\n\tc=b[:-1]\r\n\tnew=a+\" \"+b+\" #\"\r\n\t# print(a,b,\"#\")\r\n\tprint(new,*l3[l.index(c)],sep=\"\")", "n, m = map(int, input().split())\n\ndct = dict()\nfor _ in range(n):\n name, ip = input().split()\n dct[ip] = name\nres = []\nfor _ in range(m):\n command, ip = input().split()\n ip = ip[:-1]\n tmp = '{} {}; #{}'.format(command, ip, dct[ip])\n res.append(tmp)\nprint(*res, sep='\\n')\n", "n,m=map(int,input().split())\r\nd=dict(reversed(input().split()) for _ in range(n))\r\nfor _ in range(m):\r\n s=input()\r\n print(s+' #'+d[s.split()[1][:-1]])", "n,m=map(int,input().split())\r\nserver=[]\r\ncont=[]\r\nfor i in range(n):\r\n s=input()\r\n server.append(s.split())\r\nfor j in range(m):\r\n s=input()\r\n cont.append(s.split())\r\n \r\nfor i in range(m):\r\n st=cont[i][1]\r\n st=st[:len(st)-1]\r\n for j in range(n):\r\n if(server[j][1]==st):\r\n print(cont[i][0],cont[i][1],'#'+server[j][0])\r\n", "n, m = map(int, input().split())\r\nnip, cip = [], []\r\nfor _ in range(n):\r\n nip.append(input())\r\nfor _ in range(m):\r\n cip.append(input())\r\nfor name in nip:\r\n temp = name.split()\r\n for i in range(m):\r\n if cip[i].split()[-1][:-1] == temp[-1]:\r\n cip[i] += f\" #{temp[0]}\"\r\nfor c in cip:\r\n print(c)", "a,b=map(int,input().split())\r\nz=a*[0]\r\nq=b*[0]\r\nfor i in range(len(z)):\r\n z[i]=input().split()\r\nfor i in range(len(q)):\r\n q[i]=input().split()\r\nfor i in range(len(q)):\r\n m=(q[i][1]).split(';')\r\n for j in range(len(z)):\r\n if m[0]==z[j][1]:\r\n w=q[i][0]+' '+q[i][1]+' '+'#'+z[j][0]\r\n print(w)\r\n", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_ls(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef main():\r\n n, m = get_ints()\r\n user = {}\r\n for i in range(n):\r\n k, v = input().split()\r\n user[v] = k\r\n command = {}\r\n for i in range(m):\r\n k, v = input().split()\r\n x = v[:-1]\r\n if x in user:\r\n print(\"{} {} #{}\".format(k, v, user[x]))\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "initline = input().split(\" \")\nn = int(initline[0])\nm = int(initline[1])\nservers = {}\nfor i in range(n):\n line = input().split(\" \")\n value = line[0]\n key = line[1]\n servers[key] = value\n\nfor i in range(m):\n original = input()\n line = original.split(\" \")\n command = line[0]\n command_ip = line[1][:-1]\n print(original + \" #\" + servers[command_ip])\n \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())\nd=dict(reversed(input().split()) for _ in range(n))\nfor _ in range(m):\n t=input()\n print(t+' #'+d[t.split()[1][:-1]])\n \t\t\t \t \t \t\t\t\t \t\t \t \t\t", "i=input\r\nn,m=map(int,i().split())\r\nd=dict([i().split()[::-1] for _ in[0]*n])\r\nfor _ in[0]*m:a=i();print(a,'#'+d[a.split()[1][:-1]])", "n,m = map(int,input().split())\r\nd1 = ['0']*n\r\nd2 = ['0']*n\r\nfor i in range(n):\r\n a = input()\r\n fin = a.find(\" \")\r\n d1[i] = a[:fin]\r\n d2[i] = a[fin+1:]\r\n #print(len(d2[i]))\r\nfor i in range(m):\r\n a = input()\r\n fin = a.find(\" \")\r\n ind = d2.index(a[fin+1:-1])\r\n print(a,\" #\",d1[ind],sep=\"\")\r\n", "\r\na,b=map(int,input().split())\r\n\r\nd={}\r\n\r\nfor i in range(a):\r\n x,y=input().split()\r\n d[y]=x\r\n\r\nfor i in range(b):\r\n q,w=input().split()\r\n\r\n print(q,w,\"#\"+d[w[:len(w)-1]])\r\n\r\n", "n,m=list(map(int,input().split()))\r\ndict={}\r\nfor x in range(n):\r\n a1=input()\r\n a=a1.split()\r\n dict[a[1]]=a[0]\r\n#print(dict)\r\nfor x in range(m):\r\n a1=input()\r\n #print(a1)\r\n a=a1.split()\r\n #print(a[1],\"hoo\")\r\n for y in dict:\r\n #print(y)\r\n if y+';'==a[1]:\r\n print(a1+\" #\"+dict[y])\r\n break\r\n", "n,m=map(int,input().split())\r\nname=[]\r\nip=[]\r\nfor i in range(n):\r\n a,b=input().split()\r\n name.append(a)\r\n ip.append(b)\r\nfor i in range(m):\r\n l=list(input().split())\r\n ind=ip.index(l[1][0:len(l[1])-1])\r\n str=\"#\"\r\n str+=name[ind]\r\n l.append(str)\r\n for j in l:\r\n print(j,end=\" \")\r\n print()", "n, m = map(int, input().split())\n\ndict_ip = {}\n\nfor i in range(n):\n k, v = input().split()\n dict_ip[v+\";\"] = k\n\nfor i in range(m):\n k, v = input().split()\n print(f\"{k} {v} #{dict_ip.get(v)}\")\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())\ndt = {}\n\nfor i in range(n):\n cmd,ip = map(str,input().split())\n dt[ip] = cmd\n \nfor j in range(m):\n cmmd,ipp = map(str,input().split())\n x = ipp.replace(\";\",\"\")\n print(cmmd,ipp,\"#\"+dt[x])\n\t \t\t \t\t \t \t \t \t \t\t\t\t", "n,m = map(int,input().split())\nips = {}\nquery ={}\nfor i in range(n):\n name,ip = input().split()\n ips[ip] = name\nfor i in range(m):\n com,ipp = input().split()\n ipp= ipp[:-1]\n server_name = ips[ipp]\n print(f\"{com} {ipp}; #{server_name}\")\n\t \t\t \t\t\t \t\t\t\t \t \t\t \t \t\t", "a,b = map(int,input().split())\nd = {}\nfor i in range(a):\n n,p = input().split()\n p = p + \";\"\n d[p] = n\n\nfor i in range(b):\n n,p = input().split()\n\n print(n,p,'#'+d[p])\n \t\t \t \t\t \t \t\t\t \t\t\t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nProblem name: Radio station\r\nProblem link: https://codeforces.com/contest/918/problem/B\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\n\r\nlist_of_names = []\r\nlist_of_ips = []\r\n\r\n\r\nfor i in range(n):\r\n name, ip = input().split()\r\n list_of_names.append(name)\r\n list_of_ips.append(ip)\r\n \r\n \r\nfor i in range(m):\r\n command, ip = input().split()\r\n IP = ip[:-1]\r\n #print(ip)\r\n \r\n for j in range(n):\r\n if IP == list_of_ips[j]:\r\n print(command, ip, \"#\", end ='')\r\n print(list_of_names[j])", "n, m= map(int, input().split())\r\na = {}\r\nfor _ in range(n):\r\n x, y = input().split()\r\n a[y]=x\r\nfor _ in range(m):\r\n x, y = input().split()\r\n print(x, y, \"#\" + a[y[:len(y) - 1]])", "n , m = map(int, input().split())\r\nd = dict()\r\nfor i in range(n):\r\n a, b = map(str, input().split())\r\n d[b] = a\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n print(a + ' ' + b + ' #' + d[b[:len(b)-1]])", "n,m=map(int,input().split())\r\nname=list()\r\nip1=list()\r\nfor i in range(n):\r\n a,b=input().split()\r\n name.append(a)\r\n ip1.append(b)\r\ncmd=list()\r\nip2=list()\r\nfor i in range(m):\r\n a,b=input().split()\r\n cmd.append(a)\r\n ip2.append(b)\r\ns=list()\r\nfor i in range(m):\r\n s.append(cmd[i]+' '+ip2[i]+' ''#'+name[ip1.index(ip2[i][:-1])])\r\nfor i in s:\r\n print(i)", "n, m = map(int, input().split())\r\nd = {}\r\nfor i in range(0, n):\r\n x, y = input().split(\" \")\r\n d[y + ';'] = x\r\nfor i in range(0, m):\r\n x, y = input().split(\" \")\r\n print(x, y, \"#\"+d[y])\r\n\r\n", "n, m = map(int, input().split())\r\nd = dict()\r\nfor i in range(n):\r\n cur = list(map(str, input().split()))\r\n d[cur[1]] = cur[0]\r\n\r\nfor i in range(m):\r\n s = input()\r\n cur = s[:-1].split()\r\n print(s, '#' + d[cur[1]])\r\n", "\r\nn, m = list(map(int, input().split()))\r\n\r\nserver_names = {}\r\n\r\n\r\nwhile n:\r\n\r\n name, ip = input().split()\r\n\r\n server_names[ip] = name\r\n\r\n n -= 1\r\n\r\n\r\nwhile m:\r\n\r\n cmnd = input().split()\r\n\r\n s = \" \".join(cmnd) + f\" #{server_names[cmnd[-1][:-1]]}\"\r\n print(s)\r\n\r\n m -= 1\r\n\r\n", "n, q = map(int, input().split(' '))\n\nmp = {}\nfor i in range(n):\n name, ip = map(str, input().split(' '))\n mp[ip+';'] = name\n\nfor i in range(q):\n name, ip = map(str, input().split(' '))\n print(f'{name} {ip} #{mp[ip]}')\n\n \t\t\t\t\t \t \t \t \t \t \t \t", "n,m=map(int, input().split())\r\nd={ip:name for name, ip in (input().split() for i in range(n))}\r\nfor i in range(m):\r\n co, ip=input().split()\r\n print(co, ip, '#'+d[ip[:-1]])\r\n", "n, m = list(map(int, input().split()))\r\nvals = []\r\ndict1 = {}\r\nfor item in range(n):\r\n a = input()\r\n dict1[a[a.index(\" \")+1:]] = a[:a.index(\" \")]\r\nfor item in range(m):\r\n b = input()\r\n vals.append(b)\r\nfor item in range(len(vals)):\r\n print(vals[item] + \" #\" + dict1[vals[item][vals[item].index(\" \")+1:vals[item].index(\";\")]])", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(n):\r\n\ta=input().split()\r\n\td[a[1]]=a[0]\r\nfor i in range(m):\r\n\tb=(input().split())\r\n\tprint(\"{} {} #{}\".format(b[0],b[1],d[b[1][:len(b[1])-1]]))\r\n", "a, b = input().split()\ndicc = {}\ndiccc = []\nfor i in range(int(a)):\n nf, f = input().split()\n dicc[f] = nf\nfor i in range(int(b)):\n n, u = input().split()\n u = u[0:-1]\n diccc.append(n+\" \"+u+\"; #\"+dicc[u])\nfor i in diccc:\n print(i)\n \t\t\t \t \t \t \t \t \t\t\t\t \t\t\t\t", "n,k=map(int,input().split())\nd={}\nfor i in range(n):\n p,q=map(str,input().split())\n q=q+\";\"\n d[q]=p\nfor i in range(k):\n p,q=map(str,input().split())\n print(p,q,\"#\"+d[q])\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=[]\r\nb=[]\r\nfor i in range(n):\r\n a.append(list(input().split()))\r\nfor i in range(n):\r\n a[i][1]+=';'\r\nfor i in range(m):\r\n b.append(list(input().split()))\r\nc=[]\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if b[i][1]==a[j][1]:\r\n c.append(list(b[i]+['#']+[a[j][0]]))\r\nfor item in c:\r\n print(item[0],item[1],item[2]+item[3])\r\n", "n,m=[int(x) for x in input().split()]\r\n# print(n , m)\r\nan=[]\r\nam=[]\r\nfor i in range(n):\r\n a,b=[x for x in input().split()]\r\n # print(a , b)\r\n an.append(a)\r\n an.append(b)\r\n# print(*an)\r\n \r\n# for i in range(n):\r\n# print( an[i])\r\n\r\n# print(\"*\" * 50)\r\n \r\nfor i in range(m):\r\n c,d=[x for x in input().split()]\r\n am.append(c)\r\n am.append(d)\r\n# print(*am)\r\n \r\n# for i in range(m):\r\n# print (am[i])\r\n\r\nfor i in range(2*m):\r\n for j in range(2*n):\r\n # print(i, j)\r\n # print(i % 2, j % 2, '*')\r\n if i%2==1 and j%2==1:\r\n temp = am[i][:len(am[i])-1]\r\n # print(temp)\r\n # print(an[j])\r\n if temp == an[j]:\r\n print(am[i-1]+ \" \" + am[i]+\" #\"+an[j-1])\r\n", "n,m = map(int,input().split())\r\na = {}\r\nb = []\r\nfor _ in range(n):\r\n s = input()\r\n i = s.find(' ')\r\n s1 = s[:i]\r\n s2 = s[i+1:]\r\n a[s2] = s1\r\n\r\nfor _ in range(m):\r\n s3 = input()\r\n j = s3.find(' ')\r\n s4 = s3[j+1:-1]\r\n print(s3 + \" #\" + a[s4])\r\n", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\nimport math\r\nimport re\r\nimport random\r\ndef solve():\r\n #for i in range(int(input())):\r\n for i in range(1):\r\n #n = int(input())\r\n n,m = [int(x) for x in input().split()]\r\n datas = []\r\n commands = []\r\n for i in range(n):\r\n datas.append(input())\r\n \r\n for i in range(m):\r\n commands.append(input().replace(\";\", \"\"))\r\n server = 0\r\n for i in range(m):\r\n for j in range(n):\r\n if(commands[i].split()[1] == datas[j].split()[1]):\r\n server = datas[j].split()[0]\r\n break\r\n print(f\"{commands[i]}; #{server}\")\r\n \r\n \r\n # s = input()\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "\ndef solve():\n a,b = list(map(int,input().split()))\n servidores = dict()\n\n for i in range(a):\n servidor,direccion = input().split()\n if(direccion not in servidores):\n servidores[direccion] = []\n servidores[direccion].append(servidor)\n for i in range(b):\n comando,direccion = input().split()\n direccion = direccion[:-1]\n print(f\"{comando} {direccion}; \",end=\"\")\n \n for servidor in servidores[direccion]:\n print(f\"#{servidor} \",end=\"\")\n print()\ndef main():\n solve()\n\nmain()\n\n\t\t\t\t\t \t\t\t \t \t \t\t \t\t", "n,m=map(int,input().split())\n\nschool={ }\n\nfor i in range(n):\n name,ip=map(str,input().split())\n if name not in school:\n school[ip]=name\n\nfor j in range(m):\n config,cip=map(str,input().split())\n print(config,cip,\"#\"+school[cip[:-1]])\n\n\t \t\t \t \t \t\t \t\t \t\t\t \t \t\t", "n, m = map(int, input().split())\nd1 = {}\nfor i in range(n):\n name, ip = map(str, input().split())\n ip += ';'\n d1[ip] = name\n#print(d1)\nd2 = []\nfor i in range(m):\n command, ip = map(str, input().split())\n d2.append((command, ip))\n\nans = []\nfor command, ip in d2:\n name = d1[ip]\n temp = command+' '+ip+ ' #'+name\n ans.append(temp)\nprint(*ans, sep='\\n')\n", "ip_list = {}\nconfig_file = {}\nn, m = map(int, input().split())\nfor i in range(n):\n name, ip = input().split()\n ip_list[ip] = name\nfor j in range(m):\n name, ip = input().replace(';', '').split()\n print(\"{} {}; #{}\" .format(name, ip, ip_list[ip]))\n# 1538225447742\n", "n, m = map(int, input().split())\r\na, d = [], {}\r\nfor i in range(n):\r\n a.append(list(input().split(\" \")))\r\n d[a[i][1]] = a[i][0]\r\nfor i in range(m):\r\n s = list(input().split(\" \"))\r\n print(s[0], s[1], end=' ')\r\n print(f\"#{d[s[1][:len(s[1]) - 1]]}\")", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\n\r\nnameArr = [None] * n\r\nipArr = [None] * n\r\nfunctionArr = [None] * (2 * m)\r\n\r\nfor i in range(n):\r\n nInput = input().split()\r\n name = nInput[0]\r\n ip = nInput[1] + \";\"\r\n\r\n nameArr[i] = name\r\n ipArr[i] = ip\r\n\r\nc = 0\r\n\r\nfor i in range(m):\r\n mInput = input().split()\r\n\r\n function = mInput[0]\r\n ip = mInput[1]\r\n \r\n functionArr[i + c] = ip\r\n functionArr[i + 1 + c] = function\r\n \r\n c += 1\r\n\r\nfor i in range(0, 2 * m, 2):\r\n ip = functionArr[i]\r\n function = functionArr[i + 1]\r\n \r\n for j in range(n):\r\n if ip == ipArr[j]:\r\n name = nameArr[j]\r\n break\r\n \r\n print(function + \" \" + ip + \" #\" + name)", "if __name__ == '__main__':\n n, m = list(map(int,input().split()))\n table = {}\n for _ in range(n):\n name, ip = input().split()\n table[ip] = name\n for _ in range(m):\n name, ip = input()[:-1].split()\n print('{} {}; #{}'.format(name, ip, table[ip]))\n\t\t \t\t \t\t \t \t \t \t\t\t \t\t", "def solve():\r\n n,m= map(int,input().split())\r\n d={}\r\n for i in range(n):\r\n name,ip=input().split()\r\n d[ip]=name\r\n for i in range(m):\r\n name,ip=map(str,input().split())\r\n print(name+ \" \" +ip +\" #\" +d[ip[:-1]])\r\nsolve()", "n, m = map(int, input().split())\r\nd = {}\r\nfor _ in range(n):\r\n s = input().split()\r\n d[s[1]+';'] = s[0]\r\nfor _ in range(m):\r\n s = input()\r\n ans = s + ' #' + d[s.split()[1]]\r\n print(ans)", "from collections import Counter as co\nimport sys\ndef prin(a):\n sys.stdout.write(str(a)+'\\n')\ndef input():\n return sys.stdin.readline().strip()\nd={}\nn,k=map(int,input().split())\nfor i in range(n):\n a,b=input().split()\n d[b]='#'+a\nfor i in range(k):\n s=input()\n a,b=s.split()\n print(s,d[b[:-1]])\n \n \t \t \t\t\t \t\t \t\t\t\t \t", "n, m = map(int, input().split())\r\na = [input().split() for i in range(n)]\r\nb = [input().split() for i in range(m)]\r\nfor i in b:\r\n for j in a:\r\n if i[1][:-1] == j[1]:\r\n print(i[0], i[1], '#' + j[0])\r\n", "a,b=map(int,input().split())\nx={}\nfor i in range(a):\n l=input().split()\n d=l[1]+\";\"\n x[d]=l[0]\nfor i in range(b):\n l=input().split()\n print(f\"{l[0]} {l[1]} #{x[l[1]]}\")\n\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)\ndict = {}\nfor i in range(n):\n name, ip = input().split()\n dict[ip] = name\nfor i in range(m):\n command, ip = input().split()\n ip = ip[:-1]\n name = dict[ip]\n print(\"{} {}; #{}\".format(command,ip,name))", "\r\ndef mi():\r\n\treturn map(int, input().split())\r\n\r\nn,k = mi()\r\nd = {}\r\nfor i in range(n):\r\n\ta,b = input().split()\r\n\td[b] = a\r\nfor i in range(k):\r\n\ts = input()\r\n\ta,b = s.split()\r\n\tprint (s,\" #\",d[b[:len(b)-1]], sep = '')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nd = dict()\r\nfor _ in range(n):\r\n name, ip = input().rstrip().decode().split()\r\n d[ip + \";\"] = \"#\" + name\r\nans = []\r\nfor _ in range(m):\r\n com, ip = input().rstrip().decode().split()\r\n ans0 = [com, ip, d[ip]]\r\n ans.append(\" \".join(ans0))\r\nsys.stdout.write(\"\\n\".join(ans))", "n,m=input().split()\r\nn=int(n);\r\nm=int(m);\r\ns1=[]\r\ns2=[]\r\ns3=[]\r\ns4=[]\r\nfor i in range(0,n):\r\n x,y=input().split()\r\n s1.append(x)\r\n s2.append(y)\r\nfor i in range(0,m):\r\n a,b=input().split()\r\n s3.append(a)\r\n s4.append(b)\r\nfor i in range(0,m):\r\n print(s3[i],end=\" \")\r\n print(s4[i], end=\" \")\r\n z=s4[i].strip(';')\r\n for j in range(0,n):\r\n if(z==s2[j]):\r\n print('#',end=\"\")\r\n print(s1[j])\r\n\r\n", "Dustin = {}\nn,k = input().rstrip().split()\nfor i in range(int(n)):\n site, ip = input().split()\n if ip not in Dustin:\n Dustin[ip] = site\nfor j in range(int(k)):\n inst, ip1 = input().split()\n for o,m in Dustin.items():\n if ip1==o+\";\":\n print(inst+\" \"+ip1+\" #\"+m);\n break\n \n \t\t\t \t\t \t \t \t \t\t\t \t\t \t \t\t", "\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n ip_name = [[i for i in input().split(\" \")] for j in range(n)]\r\n dict_ip_name = {}\r\n for i in ip_name:\r\n dict_ip_name[i[1]] = i[0]\r\n ip_command = [[i for i in input()[:-1].split(\" \")] for j in range(m)]\r\n # ip_command = [[{i[1]:1[0]} for i in input().split(\" \")] for j in range(m)]\r\n return \"\\n\".join([f\"{i[0]} {i[1]}; #{dict_ip_name[i[1]]}\"for i in ip_command])\r\n\r\n\r\nprint(main_function())", "m,n=input().split(' ')\r\nIP={}\r\nfor i in range(int(m)):\r\n x,y=input().split(' ')\r\n IP[y]=x\r\nfor i in range(int(n)):\r\n s,r=input().split(' ')\r\n f=s+' '+r+' #'+IP[r[:-1]]\r\n print(f)\r\n\r\n", "global lista\ndef binary_search(i,j,busco):\n while(j >= i):\n m = i + (j-i)//2\n if lista[m][0] < busco:\n i = m + 1\n elif lista[m][0] > busco:\n j = m - 1\n else:\n return lista[m][1]\n \nn,k = list(map(int,input().split()))\nlista = []\nfor x in range(0,n) :\n c1,c2 = list(map(str,input().split()))\n lista.append([c2,c1])\n \nlista.sort() \n\nfor i in range(0,k) :\n cad1,cad2 = list(map(str,input().split()))\n cad2 = cad2[:-1]\n res = binary_search(0,n-1,cad2)\n print(cad1,cad2 +\";\",\"#\" +str(res))\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\nd = {}\r\nfor _ in range(n+m):\r\n name, ip = input().split()\r\n if ip[-1] ==';':\r\n print(name, ip, '#'+d[ip[:-1]])\r\n d[ip] = name\r\n", "d=dict()\r\nn,m =map (int, input().split())\r\nfor i in range (n):\r\n listofelemet=input().split()\r\n s1=listofelemet[0]\r\n s2=listofelemet[1]\r\n d[s2+';']=s1;\r\n\r\nfor i in range (m):\r\n listofelemet=input().split()\r\n s1=listofelemet[0]\r\n s2=listofelemet[1]\r\n print (s1,s2,\"#\"+d[s2])\r\n \r\n", "n, m = map(int, input().split())\r\nnames = []\r\ncommands = []\r\ncommands_list = []\r\n\r\nfor i in range(n):\r\n names.append(input().split())\r\n\r\nfor i in range(m):\r\n temp = input()\r\n commands.append(temp)\r\n commands_list.append(temp.replace(\";\", \"\").split()[1])\r\n\r\nfor i in range(m):\r\n current_command_ip = commands_list[i]\r\n for item in names:\r\n if item[1] == current_command_ip:\r\n commands[i] += f\" #{item[0]}\"\r\n\r\nfor item in commands:\r\n print(item)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nnames = {}\r\n\r\nfor i in range(n):\r\n str = input().split()\r\n names[str[1]] = str[0]\r\n\r\nfor i in range(m):\r\n str = input().split()\r\n str.append(names[str[1][:-1]])\r\n print(\"%s %s #%s\" % (str[0], str[1], str[2]))\r\n", "def main():\n n, m = map(int, input().split())\n server = {}\n for _ in range(n):\n s, ip = map(str, input().split())\n server[ip] = s\n \n for _ in range(m):\n c, ip = map(str, input().split())\n print(c, ip, \"#\", end=\"\")\n print(server[ip[:-1]])\n\nif __name__ == \"__main__\":\n main()", "line = input()\nline = [int(x) for x in line.split(' ')]\nn = line[0]\nm = line[1]\nn_dict = {}\nfor i in range(n):\n name_ip = input()\n name_ip = name_ip.split(' ')\n n_dict[name_ip[1] + \";\"] = name_ip[0]\n # n_dict[\"name\"].append(name_ip[0])\n # n_dict[\"ip\"].append(int(name_ip[1]))\nm_list = []\nfor j in range(m):\n command_ip = input().split(\" \")\n m_list.append(command_ip)\n\n# print(\"m_list\", m_list)\n\nfor command_ip in m_list:\n if command_ip[1] in n_dict.keys():\n print(*command_ip, \"#\" + n_dict[command_ip[1]])\n# command_ip = input()\n# command_ip = [command_ip.split(' ')]\n# m_dict['command'].append(\"command_ip[0]\")\n# m_dict['ip'].append(int(command_ip[1]))\n# for k in range(m):\n# value_k = list(m_dict.values())[k]\n# if value_k == n_dict('ip'):\n# print(m_dict.keys(k) + \"\" + m_dict.values(k) + \";\" + \"#\" + n_dict.keys(value_k))\n\n", "def add_comments(n, m, servers, commands):\r\n server_ips = {}\r\n for server in servers:\r\n name, ip = server\r\n server_ips[ip] = name\r\n\r\n for command in commands:\r\n command_parts = command.split()\r\n ip = command_parts[1].rstrip(';')\r\n name = server_ips[ip]\r\n print(command + ' #' + name)\r\n\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\nservers = []\r\nfor _ in range(n):\r\n name, ip = input().split()\r\n servers.append((name, ip))\r\n\r\ncommands = []\r\nfor _ in range(m):\r\n commands.append(input())\r\n\r\n# Add comments to the commands\r\nadd_comments(n, m, servers, commands)\r\n", "n,m=map(int,input().split())\r\nd=dict()\r\nfor i in range(n):\r\n\ts=input().split()\r\n\td[s[1]]=s[0]\r\nfor i in range(m):\r\n\ts=input()[:-1]\r\n\ts=s.split()\r\n\tprint(*s,sep=' ',end='')\r\n\tprint(';',end=' ')\r\n\tprint('#{}'.format(d[s[1]]))", "n,m = map(int, input().split())\nd = {}\nfor i in range(n):\n\ta,b = input().split()\n\td[b] = a\nfor j in range(m):\n\ta,b = input().split()\n\tprint(a, b, \"#\" + d[b.strip(\";\")])\n\t \t\t\t \t\t \t\t \t \t\t\t\t\t\t\t \t\t\t\t", "m={}\r\na,b=map(int,input().split())\r\nfor x in range(a):\r\n\tc,d=input().split()\r\n\tm[d]=c\r\nfor x in range(b):\r\n\tc,d=input().split()\r\n\tprint(c,d,\"#\"+m[d[:len(d)-1]])", "n, m = map(int, input().split())\ndns = dict()\n\nfor _ in range(n):\n name, ip = input().split()\n dns[ip] = name\n\nfor _ in range(m):\n command, ip = input().split()\n print(f\"{ command } { ip } #{ dns.get(ip[:len(ip) - 1]) }\")\n\t \t\t \t\t \t \t \t \t\t \t", "a, b = map(int, input().split())\n\nsrv = {}\n\nfor _ in range(a):\n x, y = input().split()\n srv[f'{y};'] = x\n\nfor _ in range(b):\n x, y = input().split()\n print(f'{x} {y} #{srv[y]}')\n\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\nd={}\r\nfor i in range(n):\r\n a,b=input().split()\r\n d[b]=a\r\nfor j in range(m):\r\n c,d1=input().split()\r\n d1=d1[:len(d1)-1]\r\n print(c+' '+d1+'; '+'#'+d[d1])", "n,m = map(int,input().split())\r\na = []; b = []; ans = []; p = []\r\nfor i in range(n):\r\n c,d = map(str,input().split())\r\n d += \";\"; a.append(c); a.append(d)\r\nfor i in range(m): b.append(list(map(str,input().split())))\r\nfor i in range(m):\r\n p.append(b[i][0])\r\n p.append(b[i][1])\r\n p.append(\"#\"+a[a.index(b[i][1])-1])\r\n ans.append(p); p = []\r\nfor i in range(m): print(*ans[i])", "m, n = map(int, input().split())\nc = {}\nfor i in range(m):\n a = input().split()\n c[a[1]] = a[0]\nfor i in range(n):\n a = input().split()\n print(*a, \"#\"+c[a[1].strip(\";\")])\n\n \t\t \t\t\t\t \t\t \t\t\t\t\t\t \t \t\t\t", "# Program in club session\r\n\r\nn,m= map(int, input().split())\r\nls={}\r\nfor i in range(n):\r\n a,b= map(str, input().split())\r\n ls.update({b:a})\r\n\r\nlc=[]\r\nfor i in range(m):\r\n a,b= map(str, input().split())\r\n lc.append((b[:-1],a))\r\n\r\nfor i, j in lc:\r\n print(f\"{j} {i}; #{ls[i]}\")\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nl=[]\r\ns=[]\r\nfor i in range(n):\r\n x=input()\r\n l.append(x)\r\nfor i in range(m):\r\n x=input()\r\n s.append(x)\r\nfor j in range(m):\r\n a=s[j].index(\" \")\r\n b=s[j]\r\n for k in l:\r\n c=k.index(\" \")\r\n if((b[a+1:len(b)-1])==(k[c+1:len(k)])):\r\n print(b+\" #\"+k[0:c+1])\r\n \r\n", "namelist=[]\r\nn,m=map(int,input().split())\r\nfor x in range(n):\r\n\tnamelist+=[list(input().split())]\r\ncmdlist=[]\r\nfor x in range(m):\r\n\tcmdlist+=[list(input().split())]\r\nfor x in cmdlist:\r\n\tfor y in namelist:\r\n\t\t# print(x[1][:-1]==y[1])\r\n\t\tif x[1][:-1]==y[1]:\r\n\t\t\tprint(x[0],x[1],\"#\"+y[0])", "n, m = map(int, input().split())\r\n\r\ntable = dict()\r\nfor i in range(n):\r\n s = input().split(' ')\r\n table[s[1]] = s[0]\r\nfor i in range(m):\r\n s = input()\r\n s1 = s.split(' ')\r\n ip = s1[1][:-1]\r\n print(s+' #' + table[ip])", "\r\ndef solve():\r\n\tn, m = map(int, input().split())\r\n\r\n\tservers = {}\r\n\tfor _ in range(n):\r\n\t\tname, ip = input().split(' ')\r\n\t\tservers[ip] = name\r\n\r\n\tfor _ in range(m):\r\n\t\tcomm, ip = input().split(' ')\r\n\r\n\t\tprint(comm, ip, \"#\" + servers[ip[:-1]])\r\n\r\nsolve()\r\n", "n, m = map(int, input().split())\r\n\r\nd = {}\r\nfor _ in range(n):\r\n i = input().split()\r\n d[i[1]] = i[0]\r\n\r\nfor _ in range(m):\r\n i = input()\r\n print(\"{} #{}\".format(i, d[i.split()[1].strip(\";\")]))\r\n \r\n \r\n", "n, m = list(map(int, input().split(\" \")))\nall_server = {}\n\nfor i in range(n):\n name, ip = list(map(str, input().split(\" \")))\n all_server[ip] = name\n\nfor j in range(m):\n command, ipdot = list(map(str, input().split(\" \")))\n for each in all_server.keys():\n if each + ';' == ipdot:\n print(command + \" \" + ipdot + \" #\" + all_server[each])\n \n \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\nd={}\r\nfor i in range(n):\r\n\ta,b=input().split()\r\n\td[b]=a\r\nfor i in range(m):\r\n\ta,b=input().split()\r\n\tprint(a,b,\"#\"+d[b[:-1]])", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(n):\r\n x,y=map(str,input().split())\r\n d[y]=x\r\nfor i in range(m):\r\n x,y=map(str,input().split())\r\n print(x,y,'#'+d.get(y.replace(';','')))\r\n", "n, m = map(int, input().split())\r\nar1 = []\r\nar2 = []\r\nfor i in range(n):\r\n name, ip = input().split()\r\n ar1 += [name]\r\n ar2 += [ip + ';']\r\nfor i in range(m):\r\n com, ip = input().split()\r\n print(com, ip, '#' + ar1[ar2.index(ip)])\r\n", "inputs = [int(num) for num in input().split()]\r\nn = inputs[0]\r\nm = inputs[1]\r\ndict1 ={}\r\nfor i in range(0,n):\r\n inputs1 = [word for word in input().split()]\r\n dict1[inputs1[1]]=inputs1[0]\r\nfor i in range(0,m):\r\n inputs1 = [word for word in input().split()]\r\n s = inputs1[0]\r\n s1 = \"\"\r\n for j in range(0,len(inputs1[1])-1):\r\n s1+=(inputs1[1])[j]\r\n s+=\" \"+inputs1[1]+\" #\"+dict1[s1]\r\n print(s)\r\n ", "a=[int(q) for q in input().strip().split()]\r\nb={}\r\nfor k in range(a[0]):\r\n d=input().split()\r\n b[d[1]]=d[0]\r\nfor k in range(a[1]):\r\n d=input().split()\r\n d[1]=d[1][0:len(d[1])-1]\r\n print(d[0]+' '+d[1]+'; #'+b[d[1]])", "n,m = map(int,input().split())\nname ={}\nfor i in range(n):\n s,ip = map(str,input().split())\n name[ip] = s \nfor i in range(m):\n comp,ip = map(str,input().split())\n ip = ip[:len(ip)-1]\n print(comp,(ip+\"; #\"+name[ip]))\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())\nsn={}\nfor _ in range(n):\n a,b=input().split()\n sn[b]=a\nfor _ in range(m):\n a,b=input().split()\n print(a,' ',b+' #',sn[b.rstrip(';')],sep='')", "n, m = map(int, input().split())\r\nslv = dict()\r\nfor a in range (n):\r\n name, ip = input().split()\r\n name = '#' + name\r\n ip = ip + ';'\r\n slv[ip] = name\r\n # print (slv)\r\nfor a in range (m):\r\n name_2, ip_2 = input().split()\r\n if ip_2 in slv:\r\n print (name_2, ip_2, slv [ip_2])", "if __name__==\"__main__\":\r\n n,m=map(int,input().split())\r\n dic={}\r\n for i in range(n):\r\n name,ip=input().split()\r\n dic.setdefault(ip,name)\r\n for j in range(m):\r\n comm,ip2=input().split()\r\n print(comm,ip2+\" #\"+dic[ip2[0:len(ip2)-1]])\r\n", "def add_comments(n, m, servers, commands):\n ip_to_name = {} \n for name, ip in servers:\n ip_to_name[ip] = name\n modified_commands = []\n for command in commands:\n command_parts = command.split()\n ip = command_parts[1][:-1]\n server_name = ip_to_name[ip]\n modified_command = f\"{command} #{server_name}\"\n modified_commands.append(modified_command)\n\n return modified_commands;\nn, m = map(int, input().split());\nservers = [input().split() for _ in range(n)]\ncommands = [input() for _ in range(m)]\nmodified_commands = add_comments(n, m, servers, commands)\nfor command in modified_commands:\n print(command)\n\n\t \t \t\t\t\t \t \t\t \t\t\t\t\t \t", "\r\nn, m = map(int, input().split())\r\ns = {}\r\nfor i in range(n):\r\n name, ip = map(str, input().split())\r\n s[ip] = name\r\nfor j in range(m):\r\n tmp = input()\r\n print(tmp + \" #\" + s[tmp[tmp.index(' ') + 1:-1]])\r\n# CodeForcesian\r\n# ♥\r\n# در خموش های من فریاد هاست\r\n", "n,m=map(int,input().split())\nfreq={}\nfor i in range(n):\n a,b=map(str,input().split())\n freq[b]=a \nfor j in range(m):\n c,d=map(str,input().split())\n print(c,\" \",d,\" \",\"#\",freq[d[:len(d)-1]],sep=\"\")\n\t \t\t \t \t\t \t \t \t\t\t\t \t \t\t", "from collections import Counter\r\nn,m=map(int,input().split())\r\nnames=[]\r\nips=[]\r\nfor i in range(n):\r\n name,ip=input().split()\r\n names.append(name)\r\n ips.append(ip)\r\nfor i in range(m):\r\n name,iip=input().split()\r\n ip=iip[0:len(iip)-1]\r\n indx=ips.index(ip)\r\n s='#'+names[indx]\r\n print(name,iip,s,end=' ')\r\n print()", "def main():\r\n\r\n n, m = [int(x) for x in input().split()]\r\n d = {}\r\n ans = []\r\n for _ in range(n):\r\n v, k = input().split()\r\n d[k] = v\r\n for _ in range(m):\r\n s = input().strip()\r\n k = s.split()[1][:-1]\r\n ans.append(s + \" #\" + d[k])\r\n \r\n print('\\n'.join(ans))\r\n\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()", "n, m = map(int,input().split())\r\ndictionary = {}\r\nfor i in range(n):\r\n name, ip = input().split()\r\n dictionary[ip] = name\r\nfor j in range(m):\r\n service = input()\r\n print(\"{} #{}\".format(service, dictionary[service.split()[1].rstrip(\";\")]))", "import fileinput\r\nf=fileinput.input()\r\nn,m=f.readline().split(\" \")\r\nn=int(n)\r\nm=int(m)\r\nD={}\r\nfor i in range(0,n):\r\n l=f.readline()\r\n l=l.replace('\\n','')\r\n co,ip=l.split(\" \")\r\n D[ip]=co\r\nfor i in range(0,m):\r\n l=f.readline()\r\n l=l.replace('\\n','')\r\n ip=l.split(\" \")[1]\r\n ip=ip.replace(';','')\r\n print(l+' #'+D[ip])", "n, m = map(int, input().split())\nd = {}\nfor i in range(n):\n x = list(input().split())\n d[x[1]] = x[0]\nfor j in range(m):\n y = list(input().split())\n print(*y, '#' + d[y[1][:-1]])\n", "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\nservers = {}\r\nfor i in range(n):\r\n name, server = input().split()\r\n servers[server] = name\r\n\r\nfor i in range(m):\r\n s = input()\r\n name, server = s.split()\r\n server= server[:-1]\r\n print(s,\"#\"+servers[server])\r\n", "n,m=map(int,input().split())\r\ndict1={}\r\nfor i in range(n):\r\n\ta,b=map(str,input().split())\r\n\tdict1[b]=a\r\narr1=[]\r\nfor i in range(m):\r\n\ta,b=map(str,input().split())\r\n\t#print(a,b)\r\n\ts1=\"\"\r\n\ts1+=a+\" \"+b+\" #\"+dict1[b[:-1]]\r\n\tarr1.append(s1)\r\nfor i in arr1:\r\n\tprint(i)", "a=input().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nb={}\r\nc=[]\r\nd=\"\"\r\nfor i in range(n):\r\n c=input().split()\r\n b[c[1]]=c[0]\r\nfor i in range(m):\r\n d=input()\r\n c=d.split()[1][:len(d.split()[1])-1]\r\n print(d+\" #\"+b[c])", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n d = dict()\r\n for i in range(n):\r\n name, ip = input().split()\r\n d[ip] = name\r\n for i in range(m):\r\n cmd, ip = input().split()\r\n ip = ip[:-1]\r\n print('%s %s; #%s' % (cmd, ip, d[ip]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# - CodeForces\r\n# Status: Unsolved\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\ndef inlt():\r\n return list(map(str, input().split()))\r\n\r\n\r\nn, m = invr()\r\n\r\nservers = {}\r\ncommands = {}\r\n\r\nfor i in range(n):\r\n e = inlt()\r\n servers[e[1]] = \"#\" + e[0]\r\n\r\nfor i in range(m):\r\n e = inlt()\r\n ee = e[1].replace(\";\", \"\")\r\n print(e[0], e[1], servers[ee])\r\n", "d=dict()\r\nl=[]\r\n#code\r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n name,ip=input().split()\r\n d[ip]=name\r\nfor i in range(m):\r\n name,ip=input().split()\r\n l.append(name+' '+ip+' #'+d[ip[:-1]])\r\nfor i in l:\r\n print(i)", "a,b=map(int,input().split())\r\ns=[]\r\np=[]\r\nfor _ in range(a):\r\n s.append(list(input().split()))\r\nfor _ in range(b):\r\n p.append(list(input().split()))\r\nfor i in range(b):\r\n for j in range(a):\r\n if p[i][1][:-1]==s[j][1]:\r\n c=s[j][0]\r\n print(*p[i],str('#'+c))", "line = input()\nn, m = map(int, line.split())\n\nname_of_ips = dict()\nfor i in range(n):\n line = input()\n name, ip = line.split()\n name_of_ips[ip] = name\n\nfor i in range(m):\n line = input()\n ip = line.split()[1][:-1]\n print(f\"{line} #{name_of_ips[ip]}\")\n\n \t\t\t \t\t \t\t \t\t \t \t \t\t \t", "n,m=[int(i) for i in input().split()]\r\nserver=[]\r\nser_name=[]\r\nser_ip=[]\r\nip=[]\r\nfor i in range(n):\r\n x=input()\r\n server.append(x)\r\n p=x.split()\r\n ser_name.append(p[0])\r\n ser_ip.append(p[1])\r\nfor i in range(m):\r\n y=input()\r\n s=y[:-1]\r\n ip.append(y)\r\n q=s.split()\r\n ind=ser_ip.index(q[1])\r\n print(y+' '+'#'+ser_name[ind])", "entra=input(\"\")\nreales, alias=entra.split(\" \")\nips={}\nfor i in range(int(reales)):\n linea=input(\"\")\n nombre, ip=linea.split(\" \")\n ips[ip]=nombre\nfor j in range(int(alias)):\n linea = input(\"\")\n alias, ip2 = linea.strip(\";\").split(\" \")\n nombre=ips.get(ip2)\n ip2+=\";\"\n print(alias +\" \"+ ip2 + \" #\"+nombre)\n\n\n \t \t\t \t\t \t\t\t \t\t\t\t\t\t\t\t", "\r\nn, m = map(int, input().split())\r\nli = []\r\nfor _ in range(n):\r\n\tli.append(list(input().split()))\r\n\r\n\r\nfor _ in range(m):\r\n\tlc = list(input().split())\r\n\tfor i in range(n):\r\n\t\tif li[i][1] + ';'== lc[1]:\r\n\t\t\ttxt = '#'\r\n\t\t\tfor i in li[i][0]:\r\n\t\t\t\ttxt += i\r\n\t\t\tlc.append(txt)\r\n\t\t\tbreak\r\n\tprint(*lc, sep = ' ')\r\n\t\t\r\n", "n, m = map(int, input().split())\r\nd = dict()\r\nfor i in range(n):\r\n s = [i for i in input().split()]\r\n s[1] += ';'\r\n s[0] = '#' + s[0]\r\n d[s[1]] = s[0]\r\nfor i in range(m):\r\n s = [i for i in input().split()]\r\n print(s[0], s[1], d[s[1]])", "def add_comments(n, m, servers, commands):\n ip_to_name = {ip: name for name, ip in servers}\n\n modified_commands = []\n for command in commands:\n command_parts = command.split()\n ip = command_parts[1].rstrip(';')\n modified_command = command + f' #{ip_to_name[ip]}'\n modified_commands.append(modified_command)\n\n return modified_commands\n\n\n\nn, m = map(int, input().split())\n\nservers = []\nfor _ in range(n):\n name, ip = input().split()\n servers.append((name, ip))\n\ncommands = []\nfor _ in range(m):\n command = input()\n commands.append(command)\n\n\nmodified_commands = add_comments(n, m, servers, commands)\n\n\nfor modified_command in modified_commands:\n print(modified_command)\n\n\t \t\t\t\t \t \t \t\t\t\t\t \t \t\t\t \t \t\t", "p=input().rstrip().split(' ')\r\nn=int(p[0])\r\nm=int(p[1])\r\nl=[]\r\nq=[]\r\nfor i in range(0,n):\r\n u=input().rstrip().split(' ')\r\n l.append(u[0])\r\n q.append(u[1])\r\nfor i in range(0,m):\r\n u=input().rstrip().split(' ')\r\n x=list(u[1])\r\n del(x[len(x)-1])\r\n u[1]=''.join(x)\r\n R=q.index(u[1])\r\n print(u[0],u[1],end='')\r\n print(\";\",\"#\",end='')\r\n print(l[R])", "n , m =list(map(int,input().split()))\na = [list(map(str, input().split())) for i in range(n)]\nfor i in range(m):\n b = list(map(str, input().split()))\n tmp = b[1]\n ans = tmp[:-1]\n for i in range(len(a)):\n if (ans == a[i][1]):\n print(*b, \"#\" + a[i][0])\n", "n, m = map(int, input().split())\r\ncmd, ip = [], []\r\nfor i in range(n) :\r\n a, b = map(str, input().split())\r\n cmd.append(a), ip.append(b)\r\nfor i in range(m) :\r\n c, d = map(str, input().split())\r\n print(c, d, '#'+cmd[ip.index(d[:len(d)-1])])\r\n\r\n", "from collections import OrderedDict\r\nn,m = map(int,input().split())\r\nt=n\r\nmd1 = OrderedDict()\r\nwhile(n):\r\n s = input().split()\r\n md1[s[1]] = s[0]\r\n n-=1\r\nwhile(m):\r\n s1 = input().split()\r\n s3 = s1[1][:-1]\r\n keys = md1.keys()\r\n #print(s3)\r\n #print(keys)\r\n if(s3 in keys):\r\n #print(\"YES\")\r\n print(s1[0],s1[1]+\" #\"+md1[s1[1][:-1]])\r\n '''else:\r\n print(\"no\")'''\r\n m-=1", "n, m = map(int, input().split())\r\nadict = {}\r\nfor _ in range(n):\r\n a, b = input().split()\r\n adict[b] = a\r\n\r\ncom_dict = []\r\nfor _ in range(m):\r\n com, pro = input().split()\r\n com_dict.append(com + \" \" + pro + \" #\" + adict[pro[:-1]])\r\n \r\nprint(*com_dict, sep = \"\\n\")", "n,m=list(map(int,input().split()))\r\nn1=[]\r\nip=[]\r\nfor _ in range(n):\r\n s,i=input().split()\r\n n1.append(s)\r\n ip.append(i)\r\nfor _ in range(m):\r\n z,ipp=input().split()\r\n x=ip.index(ipp[:-1])\r\n y=n1[x]\r\n print(z+\" \"+ipp+\" #\"+y)", "n,m=map(int,input().split())\r\nd={}\r\nd2={}\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n d[b]=a \r\nfor j in range(m):\r\n a,b=map(str,input().split())\r\n if(b[:len(b)-1] in d.keys()):\r\n print(a,end=\" \")\r\n print(b+\" #\",end=\"\")\r\n print(d[b[:len(b)-1]])\r\n\r\n ", "a,b = map(int,input().split())\nd = {}\nfor _ in range(a):\n x,y = input().split()\n d[y+\";\"] = x\nfor _ in range(b):\n c,e = input().split()\n if e in d:\n print(f\"{c} {e} #{d[e]}\")\n\n \n\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\nd={}\r\nfor i in range(n):\r\n t=input().split()[::-1]\r\n d[t[0]]=t[1]\r\n\r\nfor i in range(m):\r\n t=input()\r\n print(t + ' #' + d[t.split()[1][:-1]])\r\n \r\n", "n, m = map(int, input().split())\r\nD = dict()\r\nfor i in range(n):\r\n name, ip = input().split()\r\n D[ip] = name\r\nfor i in range(m):\r\n cmd, _ip = input().split()\r\n ip = _ip[:len(_ip)-1]\r\n print(cmd, _ip, '#'+D[ip])", "a,b=map(int,input().split())\r\ndeff=[]\r\ndef2=[]\r\nfor i in range(a):\r\n l=list(input().split())\r\n deff.append(l)\r\n def2.append(l[1])\r\nwork=[]\r\nfor i in range(b):\r\n work.append(list(input().split()))\r\nfor i in work:\r\n ind=def2.index(i[1][:-1])\r\n print(*i,'#'+str((deff[ind][0])))\r\n \r\n", "n,m = map(int,input().split())\r\nservers = {}\r\n\r\nfor x in range(n):\r\n name,ip = input().split()\r\n servers[ip] = name\r\nfor i in range(m):\r\n name,ip = input().split()\r\n print(name,ip,'#'+servers[ip[:-1]])\r\n", "a,b = map(int,input().split())\na1 = []\na2 = []\nfor i in range(a + b):\n\tcommand, ip = map(str,input().split())\n\tif ip[-1] == \";\":\n\t\ta2.append([command, ip])\n\telse:\n\t\ta1.append([command , ip])\nfor i in range(len(a2)):\n\tcnt = a2[i][1][0:len(a2[i][1]) - 1]\n\tfor j in range(len(a1)):\n\t\tif cnt == a1[j][1]:\n\t\t\tprint(a2[i][0],a2[i][1],\"#\"+str(a1[j][0]))\n\t\t\tbreak\n", "l1 = [int(x) for x in input().split()]\r\nn,m = l1[0],l1[1]\r\n\r\naddresses =[] \r\nnames = []\r\nfor x in range(n+m):\r\n s = input()\r\n l2 = s.split()\r\n name = l2[0]\r\n address = l2[1]\r\n address1 = l2[1]\r\n if \";\" in address1:\r\n print(s + \" \" + \"#\" + names[addresses.index(address)])\r\n \r\n else:\r\n addresses.append(address1+\";\")\r\n names.append(name)\r\n\r\n \r\n\r\n ", "n,m=map(int,input().split())\nd=dict(reversed(input().split()) for _ in range(n))\nfor _ in range(m):\n k=input()\n print(k+' #'+d[k.split()[1][:-1]])\n \t \t\t\t \t\t\t \t\t \t\t \t\t", "amount = input().split()\r\nlist_of_info = []\r\nlist_of_event = []\r\nfor i in range(int(amount[0])):\r\n info = input().split()\r\n list_of_info.append(info)\r\nfor j in range(int(amount[1])):\r\n event = input().split()\r\n list_of_event.append(event)\r\nfor i in list_of_event:\r\n for j in list_of_info:\r\n if i[1][:-1] == j[1]:\r\n print(i[0] + ' ' + i[1] + ' #' + j[0])", "from collections import *\r\nfor u in range(1):\r\n n,m=map(int,input().split())\r\n d=defaultdict(str)\r\n for i in range(n):\r\n x,y=input().split()\r\n d[y+';']=x\r\n for i in range(m):\r\n x,y=input().split()\r\n print(x,y,'#'+d[y])\r\n", "n, m = [int(x) for x in input().split()]\nd = {}\nwhile (n):\n n -= 1\n s, ip = input().split()\n d[ip] = s\nwhile (m):\n m -= 1\n c, ip = input().split()\n print(c, ip, '#' + d[ip[:-1]])\n \t \t\t \t \t \t \t\t \t", "n, m = map(int, input().split())\r\nserver = []\r\nfor i in range(n):\r\n ls1 = input().split()\r\n server.append(ls1)\r\nmy_dict = {}\r\nfor i in server:\r\n my_dict[i[1]] = i[0]\r\n\r\n\r\ncommand = []\r\nfor j in range(m):\r\n ls1 = input().split()\r\n command.append(ls1)\r\n\r\nfor i in range(len(command)):\r\n k = command[i][1].replace(';', '')\r\n st = '#' + str(my_dict[k])\r\n command[i].append(st)\r\n\r\nfor i in command:\r\n print(' '.join(i))\r\n\r\n", "n, m = map(int, input().split())\n\nus = {}\n\nfor i in range(n):\n name, ip = input().split()\n us[ip] = name\n\nfor j in range(m):\n uname, ip = input().split()\n ip = ip[:len(ip) - 1]\n print(uname, ip + \"; #\" + us[ip])\n\n", "n,m=[int(i) for i in input().split()]\r\nd=dict()\r\nfor i in range(n):\r\n l=input().split()\r\n d[l[1]]=l[0]\r\nfor i in range(m):\r\n l1=input().split()\r\n print(l1[0]+\" \"+l1[1]+\" #\"+d[l1[1][:-1]])\r\n", "n, m = map(int, input().split())\r\nnames = {}\r\noutputs = []\r\nfor i in range(n):\r\n k , v = map(str , input().split())\r\n names[v] = k\r\nfor i in range(m):\r\n com = input()\r\n outputs.append(com + ' #'+ names[com.split()[1].replace(';','')])\r\n print(outputs[i])\r\n", "N,M = map(int,input().split())\r\nservers = {}\r\nfor n in range(N):\r\n name,ip = input().split()\r\n servers[ip] = name\r\n\r\nfor m in range(M):\r\n name,ip = input().split()\r\n for key,value in servers.items():\r\n if ip[:-1] == key:\r\n print(name,ip,\"#\"+servers[key]) ", "a=list(map(int,input().split()))\r\nn,m=a[0],a[1]\r\ndict={}\r\nfor i in range(n):\r\n x=list(input().split())\r\n dict[x[1]]=x[0]\r\nfor i in range(m):\r\n y=list(input().split())\r\n print(y[0]+\" \"+y[1]+\" #\"+dict[y[1][0:-1]])\r\n ", "n, m = map(int, input().split())\r\nd={}\r\nfor i in range(n):\r\n name, ip = input().split()\r\n d[ip] = name\r\nfor i in range(m):\r\n name, ip = input().split()\r\n print(name,ip,\"#\"+d[ip[:-1]])", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(n+m):\r\n k,l=map(str,input().split())\r\n k1=l\r\n l=l.rstrip(\";\")\r\n if d.get(l)==None:\r\n d[l]=k\r\n else:\r\n print(k,l+\";\",\"#\"+d[l])\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n", "n, m = map(lambda x: int(x), input().split())\r\nd = {}\r\nwhile n != 0:\r\n\tn -= 1\r\n\ts = input().split()\r\n\td[s[1]] = s[0]\r\n\r\nwhile m != 0:\r\n\tm -= 1\r\n\tl = input().split()\r\n\tl.append('#' + d[l[1][:-1]])\r\n\tprint(' '.join(l))\r\n", "if __name__ == '__main__':\r\n \r\n n,m = input().split(\" \")\r\n n = int(n)\r\n m = int(m)\r\n d = {}\r\n l2 = []\r\n for i in range(n):\r\n a = input()\r\n name, ip = a.split(\" \")\r\n d.update({ip:name})\r\n \r\n for i in range(m):\r\n a = input()\r\n l2.append(a)\r\n \r\n for i in range(m):\r\n comment,ip = l2[i].split(\" \")\r\n ip = ip[:-1]\r\n name = d[ip]\r\n l2[i] = l2[i] + \" #\" + name\r\n \r\n for i in range(m):\r\n \r\n print(l2[i])", "ln = input().split(' ')\r\nn, m = int(ln[0]), int(ln[1])\r\n\r\nM = dict()\r\nfor i in range(n):\r\n ln = input().split(' ')\r\n M[ln[1]] = ln[0]\r\nfor i in range(m):\r\n cmd = input()\r\n ip = cmd.split(' ')[1]\r\n ip = ip[:len(ip)-1]\r\n print(cmd, ' #', M[ip], sep='')", "import itertools\r\n\r\n\r\n\r\n\r\ndef main():\r\n n,m = [int(v) for v in input().split()]\r\n names = []\r\n names_dict = {}\r\n for i in range(n):\r\n data = input()\r\n v = data.split(\" \")\r\n names_dict[v[1].strip()]=v[0].strip()\r\n names.append(data)\r\n commands = []\r\n for i in range(m):\r\n commands.append(input())\r\n for c in commands:\r\n data = c.split(\" \")\r\n print(c+\" #\"+names_dict[data[1].replace(\";\", \"\")])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env pypy\r\n#for t in range(int(input())):\r\nn,m=[int(x) for x in input().split()]\r\n\r\nd={}\r\nfor _ in range(n):\r\n string,ip=input().split()\r\n d[ip]=string\r\n\r\nfor _ in range(m):\r\n command,ip=input().split()\r\n print(\"{} {} #{}\".format(command,ip,d[ip[:-1]]))\r\n\r\n\r\n\r\n", "def add_comments(n, m, servers, commands):\r\n server_dict = {}\r\n for server in servers:\r\n name, ip = server.split()\r\n server_dict[ip] = name\r\n\r\n result = []\r\n for command in commands:\r\n command_parts = command.split()\r\n ip = command_parts[1][:-1]\r\n name = server_dict[ip]\r\n result.append(f\"{command} #{name}\")\r\n\r\n return result\r\nn, m = map(int, input().split())\r\nservers = [input() for _ in range(n)]\r\ncommands = [input() for _ in range(m)]\r\nresult = add_comments(n, m, servers, commands)\r\nfor line in result:\r\n print(line)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 18 09:54:51 2021\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\n\r\ndef ip(dict1,queries):\r\n for i in range(len(queries)):\r\n print(queries[i][0]+' '+queries[i][1]+' #'+dict1[queries[i][1][:-1]])\r\nm,n=map(int,input().split())\r\ndict1={}\r\nfor i in range(m):\r\n a=input().split()\r\n dict1[a[1]]=a[0]\r\nqueries=[]\r\nfor i in range(n):\r\n q=input().split()\r\n queries.append(q)\r\nip(dict1,queries)\r\n \r\n \r\n \r\n", "_1,_2=map(int,input().split())\r\nname,ip=[],[]\r\n\r\nfor i in range(_1):\r\n x,y=\"\",\"\"\r\n x,y=map(str,input().split())\r\n name.append(x)\r\n ip.append(y)\r\n\r\nnames,ips=[],[]\r\nfor i in range(_2):\r\n x,y=\"\",\"\"\r\n x,y=map(str,input().split())\r\n names.append(x)\r\n ips.append(y)\r\n\r\n\r\nfor i in range(len(names)):\r\n print(names[i] + \" \" + ips[i], end=\" \")\r\n a=0\r\n while (1):\r\n if (ips[i] == (ip[a]+\";\")):\r\n print(\"#\"+name[a])\r\n break\r\n else : \r\n a+=1\r\n \r\n", "maps = {}\r\nN,M=map(int,input().split())\r\nfor n in range(N):\r\n name,ip = input().split()\r\n maps[ip] = name\r\nfor m in range(M):\r\n name, ip=input().split()\r\n print(name + ' ' + ip + ' #',end='')\r\n print(maps[ip[:-1]])", "n, m = map(int, input().split())\r\ncommand, server, ans = [], [], []\r\nfor t in range(n + m):\r\n s = input().split()\r\n if ';' in s[1]:\r\n server.append(s)\r\n else:\r\n command.append(s)\r\nfor i in range(len(server)):\r\n diff = server[i][1].rstrip(';')\r\n for e in range(len(command)):\r\n if command[e][1] == diff:\r\n ans.append(server[i][0] + ' ' + server[i][1] + ' ' + '#' + command[e][0])\r\nfor i in ans:\r\n print(i)\r\n", "N,M = map(int,input().split())\nservers = []\nstr1 = list()\nfor i in range(N):\n ser = list(input().split())\n servers.append(ser)\nfor i in range(M):\n cmd = list(input().split())\n cmd[1] = cmd[1][:-1]\n for k in servers:\n if cmd[1] == k[1]:\n str1.append(\"{} {}; #{}\".format(cmd[0],cmd[1],k[0]))\nfor i in str1:\n print(i)\n\t \t\t \t\t\t \t\t \t \t\t \t \t\t\t\t", "n, m = map(int, input().split())\r\nname = {}\r\nfor i in range(n):\r\n a, b = input().split()\r\n name[b] = a\r\nfor i in range(m):\r\n a, b = input().split()\r\n print(a, b, '#'+name[b[:-1]])\r\n", "\n\nimport sys\ndef get_single_int ():\n return int (sys.stdin.readline ().strip ())\ndef get_string ():\n return sys.stdin.readline ().strip ()\ndef get_ints ():\n return map (int, sys.stdin.readline ().strip ().split ())\ndef get_list ():\n return list (map (int, sys.stdin.readline ().strip ().split ()))\n\n#code starts here\ndef name (ip):\n for i in ar:\n if i [1] == ip [:-1]:\n return i[0]\ndef change (i, ans):\n tmp = arr [i]\n tmp [1] += \" #{}\".format (ans)\nn, m = get_ints ()\nar = []\nfor i in range (n):\n tmp = list (map(str, sys.stdin.readline ().strip ().split (\" \" )))\n ar.append (tmp)\narr = []\nfor i in range (m):\n tmp = list (map(str, sys.stdin.readline ().strip ().split (\" \")))\n arr.append (tmp)\nfor i in range (m):\n tmp = arr [i]\n ans = name (tmp [1])\n change (i, ans)\nfor i in range (m):\n print ( arr [i] [0] + \" \" + arr [i] [1])\n", "n, site = list(map(int, input().split())), dict()\r\nfor i in range(n[0]):\r\n w = input().split()\r\n site[w[1] + ';'] = w[0]\r\nfor i in range(n[-1]):\r\n command = input()\r\n print(command + ' #' + site[command.split()[1]])\r\n", "n, m = map(int, input().split())\nd = {}\nfor _ in range(n):\n\tx = list(input().split())\n\td[x[1]] = x[0]\nfor _ in range(m):\n\ts = list(input().split())\n\tans = s[0] + \" \" + s[1]\n\tx = s[-1]\n\tl = len(x)\n\tx = x[:l-1]\n\tif x in d.keys():\n\t\tans += \" #\"\n\t\tans += d[x]\n\tprint(ans)\n\t\t\t \t \t \t \t \t \t \t\t \t", "# Read input\nn, m = map(int, input().split())\n\n# Create a dictionary to map IPs to names\nip_to_name = {}\n\nfor i in range(n):\n name, ip = input().split()\n ip_to_name[ip] = name\n\n# Process and print the commands\nfor i in range(m):\n command, ip = input().split()\n name = ip_to_name[ip[:-1]] # Remove the trailing semicolon\n print(f\"{command} {ip} #{name}\")\n\n \t\t \t\t\t\t\t \t\t\t\t \t \t\t\t\t\t\t\t \t", "a,b=map(int,input().split())\r\nl,m=[],[]\r\nfor i in range(a):\r\n l.append(input().split())\r\nfor i in range(b):\r\n m.append(input().split())\r\nfor i in range(b):\r\n for j in range(a):\r\n if(m[i][1][:-1]==l[j][1]):\r\n print(\" \".join(m[i])+\" #\"+l[j][0])\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n", "n, m = [int(x) for x in input().split(\" \")]\r\nname = []\r\nip = []\r\nfor i in range(n):\r\n s = input().split(\" \")\r\n name.append(s[0])\r\n ip.append(s[1])\r\n\r\nfor a in range(m):\r\n command = input().split(\" \")\r\n ind_ip = ip.index(command[1][:-1])\r\n command.append(\"#\" + name[ind_ip])\r\n print(\" \".join(command))", "n,m=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\nfor i in range(n):\r\n\ta,b=input().split()\r\n\tl1.append(a)\r\n\tl2.append(b)\r\nfor i in range(m):\r\n\ta,b=input().split()\r\n\tprint(a,b,\"#\"+l1[l2.index(b[:-1])])", "line1 = input()\nn = int(line1.split()[0])\nm = int(line1.split()[1])\ndictionary = {}\n\nfor i in range(0, n):\n line = input()\n # server 138.197.64.57\n dictionary[line.split()[1]] = line.split()[0]\n\nfor i in range(0, m):\n line1 = input()\n # redirect 138.197.64.57;\n name = dictionary[line1.split()[1].split(\";\")[0]]\n print(line1 + \" #\" + name)\n", "n, m = map(int, input().split())\r\nd = {}\r\nfor _ in range(n):\r\n\tx = list(input().split())\r\n\td[x[1]] = x[0]\r\nfor _ in range(m):\r\n\ts = list(input().split())\r\n\tans = s[0] + \" \" + s[1]\r\n\tx = s[-1]\r\n\tl = len(x)\r\n\tx = x[:l-1]\r\n\tif x in d.keys():\r\n\t\tans += \" #\"\r\n\t\tans += d[x]\r\n\tprint(ans)", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in range(n):\r\n name,ip=input().split()\r\n dic[ip]=name\r\nfor j in range(m):\r\n cmd,ipm=input().split()\r\n print(cmd+\" \"+ipm+ \" #\"+dic[ipm[:-1]])", "n, m = map(int, input().split())\nd = dict()\nfor i in range(0, n):\n name, i = input().split()\n d[i] = name\nfor i in range(0, m):\n v = input()\n print(v, \"#\" + d[v.split()[1][:-1]])\n", "n,m = map(int,input().split())\nd = {}\nfor i in range(n):\n x,y = input().split()\n d[y+\";\"] = x\nfor i in range(m):\n c,k = input().split()\n print(f\"{c} {k} #{d[k]}\")\n\n\t\t\t\t \t\t\t \t\t \t\t \t \t\t\t\t\t\t\t\t\t", "import sys\n\ninput = sys.stdin.readline\nprint = sys.stdout.write\n\nN, M = map(int, input().split())\nip_to_name = {}\n\nfor i in range(N):\n name, ip = input().split()\n ip_to_name[ip] = name\n\nfor i in range(M):\n command, ip = input().split()\n print(command + \" \" + ip + \" #\" + ip_to_name[ip[:-1]] + \"\\n\")\n", "n,m=map(int,input().split())\r\nd=dict()\r\nfor y in range(n):\r\n name,ip=input().split()\r\n d[ip]=\"#\"+name\r\nfor z in range(m):\r\n command,ip=input().split()\r\n print(command+\" \"+ip+\" \"+d[ip.replace(\";\",\"\")])\r\n", "n, m = map(int, input().split())\r\nA = {}\r\nfor _ in range(n):\r\n name, ip = input().split()\r\n A[ip] = name\r\nfor _ in range(m):\r\n name, ip = input().split()\r\n print(name + ' ' + ip + ' ' + '#' + A[ip[:-1]])", "n,m=map(int,input().split())\r\nname,ip=[],[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tx=s.index(' ')\r\n\tna=s[0:x]\r\n\tname.append(na)\r\n\tj=s[x+1:len(s)]\r\n\tip.append(j)\r\nfor i in range(m):\r\n\ts=input()\r\n\tx=s.index(' ')\r\n\tj=s[x+1:len(s)-1]\r\n\tx=ip.index(j)\r\n\tans=s+' #'+name[x]\r\n\tprint(ans)\r\n", "n, m = map(int, input().split())\nip2name = {}\n\nfor _ in range(n):\n name, ip = input().split()\n ip2name[ip] = name\n\nfor _ in range(m):\n line = input()\n cmd, ip = line.split()\n ip = ip[:-1]\n print(f\"{cmd} {ip}; #{ip2name[ip]}\")\n \t\t \t\t \t \t \t \t\t \t \t \t \t", "a,b=map(int,input().split())\r\nc={};d={}\r\nfor _ in range(a):\r\n p=input().split()\r\n c[p[-1]] = p[0]\r\nfor _ in range(b):\r\n p=input().split()\r\n print(f\"{p[0]} {p[-1]} #{c[p[-1][:-1]]}\")", "n, m = [int(x) for x in input().split()]\nservers = {}\ncommands = []\nfor i in range(n):\n a, b = input().split()\n servers[b] = a\nfor i in range(m):\n commands.append(input())\n\nfor i, x in enumerate(commands):\n a, b = x.split()\n b = b[:-1]\n print(a + \" \" + b + \"; #\" + servers[b])" ]

[ "import sys\n\n#Library Info(ACL for Python/Pypy) -> https://github.com/not522/ac-library-python\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # L,D,R,Uの順番\n\n\ndef main():\n n, q, m = map(int, input().split())\n a = list(map(int, input().split()))\n query = [tuple(map(int, input().split())) for i in range(q)]\n indices = list(map(int, input().split()))\n \n for t,l,r in query[::-1]:\n if t == 1:\n for i,idx in enumerate(indices):\n if l <= idx <= r:\n if idx > l:\n indices[i] = idx - 1\n else:\n indices[i] = r\n\n else:\n for i,idx in enumerate(indices):\n if l <= idx <= r:\n indices[i] = l + r - idx \n\n ans = [a[idx - 1] for idx in indices]\n print(*ans)\n return 0\n\n\nif __name__ == \"__main__\":\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, q, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntlr = [list(map(int, input().split())) for _ in range(q)]\r\nb = list(map(int, input().split()))\r\nans = []\r\nfor i in b:\r\n x = i\r\n for j in range(q - 1, -1, -1):\r\n t, l, r = tlr[j]\r\n if not l <= x <= r:\r\n continue\r\n if t == 1:\r\n if l < x:\r\n x -= 1\r\n else:\r\n x = r\r\n else:\r\n x = l + r - x\r\n ans.append(a[x - 1])\r\nprint(*ans)", "n,q,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nqq=list(list(map(int,input().split())) for i in range(q))\r\nqq=list(reversed(qq))\r\nb=list(map(int,input().split()))\r\n\r\nfor qt, l, r in qq:\r\n if qt == 1:\r\n for i in range(m):\r\n if l <= b[i] <= r:\r\n b[i] = r if b[i] == l else b[i]-1\r\n else:\r\n for i in range(m):\r\n if l <= b[i] <= r:\r\n b[i] = r - (b[i] - l)\r\n\r\nprint(*(a[i-1] for i in b))\r\n \r\n", "# If you win, you live. You cannot win unless you fight.\r\nfrom sys import stdin,setrecursionlimit\r\ninput=stdin.readline\r\nimport heapq\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict as unsafedict,deque,Counter as unsafeCounter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, floor,log2,factorial,radians,sin,cos\r\n\r\nrandom = randint(1, 10 ** 9)\r\nmod=998244353\r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\nclass myDict:\r\n def __init__(self,func):\r\n self.RANDOM = randint(0,1<<32)\r\n self.default=func\r\n self.dict={}\r\n def __getitem__(self,key):\r\n myKey=self.RANDOM^key\r\n if myKey not in self.dict:\r\n self.dict[myKey]=self.default()\r\n return self.dict[myKey]\r\n def get(self,key,default):\r\n myKey=self.RANDOM^key\r\n if myKey not in self.dict:\r\n return default\r\n return self.dict[myKey]\r\n def __setitem__(self,key,item):\r\n myKey=self.RANDOM^key\r\n self.dict[myKey]=item\r\n def getKeys(self):\r\n return [self.RANDOM^i for i in self.dict]\r\n def __str__(self):\r\n return f'{[(self.RANDOM^i,self.dict[i]) for i in self.dict]}'\r\n\r\n'''\r\nrev=\r\n0 1 2 3\r\n[1,3]->r apparent index= (r-i+ l)\r\ni%(r)+l\r\n'''\r\nn,q,m=rd()\r\na=list(rd())\r\nqr=[]\r\nfor i in range(q):\r\n b=list(rd())\r\n b[1]-=1\r\n b[2]-=1\r\n qr.append(b)\r\ninds=list(rd())\r\ninds=list(map(lambda s:s-1,inds))\r\nfor i in range(m):\r\n for type,l,r in qr[::-1]:\r\n if inds[i]>=l and inds[i]<=r:\r\n if type==1:\r\n if inds[i]==l:\r\n inds[i]=r\r\n else:\r\n inds[i]=inds[i]-1\r\n else:\r\n inds[i]=r-inds[i]+l\r\n\r\nfor i in inds:\r\n print(a[i],end=\" \")\r\n", "import sys\r\n \r\nn, q, m = map(int, sys.stdin.buffer.readline().decode('utf-8').split())\r\na = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\nquery = [list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\n for _ in range(q)]\r\n \r\nb = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\n \r\nfor qt, l, r in reversed(query):\r\n if qt == 1:\r\n for i in range(m):\r\n if l <= b[i] <= r:\r\n b[i] = r if b[i] == l else b[i]-1\r\n else:\r\n for i in range(m):\r\n if l <= b[i] <= r:\r\n b[i] = r - (b[i] - l)\r\n \r\nprint(*(a[i-1] for i in b))\r\n", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, q, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nQ = []\r\nfor i in range(q):\r\n t, l, r = map(int, input().split())\r\n l, r = l-1, r-1\r\n Q.append((t, l, r))\r\nB = list(map(int, input().split()))\r\nB = [b-1 for b in B]\r\nQ.reverse()\r\nans = []\r\nfor i, b in enumerate(B):\r\n for t, l, r in Q:\r\n if l <= b <= r:\r\n if t == 1:\r\n if b != l:\r\n b -= 1\r\n else:\r\n b = r\r\n else:\r\n b = r-(b-l)\r\n ans.append(A[b])\r\nprint(*ans)\r\n" ]

[ "n=int(input());\r\nma=[[] for x in range(n)];\r\nzflag=0;\r\nzindex=[0,0];\r\n\r\n#reading the input\r\nfor i in range(n):\r\n j=0;\r\n inp=input().split();\r\n for x in inp:\r\n if x=='0':\r\n ma[i].append(10);\r\n zflag=1;\r\n zindex=[i,j];\r\n else:\r\n ma[i].append(int(x));\r\n j+=1;\r\n \r\n#counting the number of 2s and 5s of each element\r\nct2=[[0 for x in range(n)] for y in range(n)];\r\nct5=[[0 for x in range(n)] for y in range(n)];\r\nfor i in range(n):\r\n for j in range(n):\r\n tmp=ma[i][j];\r\n while tmp%2==0:\r\n ct2[i][j]+=1;\r\n tmp//=2;\r\n while tmp%5==0:\r\n ct5[i][j]+=1;\r\n tmp//=5;\r\n#dynamic programming for 2s and 5s\r\ndp2=[[0 for x in range(n)] for y in range(n)];\r\ndp5=[[0 for x in range(n)] for y in range(n)];\r\ndp2[0][0]=ct2[0][0];\r\ndp5[0][0]=ct5[0][0];\r\nfor i in range(1,n):\r\n dp2[0][i]=dp2[0][i-1]+ct2[0][i];\r\n dp5[0][i]=dp5[0][i-1]+ct5[0][i];\r\n dp2[i][0]=dp2[i-1][0]+ct2[i][0];\r\n dp5[i][0]=dp5[i-1][0]+ct5[i][0];\r\n\r\nfor i in range(1,n):\r\n for j in range(1,n):\r\n dp2[i][j]=min(dp2[i-1][j]+ct2[i][j],dp2[i][j-1]+ct2[i][j]);\r\n dp5[i][j]=min(dp5[i-1][j]+ct5[i][j],dp5[i][j-1]+ct5[i][j]);\r\nres=min(dp2[n-1][n-1],dp5[n-1][n-1]);\r\n\r\n#path calculation\r\nif dp2[n-1][n-1]<dp5[n-1][n-1]:\r\n path='';\r\n i=n-1;\r\n j=n-1;\r\n while i>0 and j>0:\r\n if dp2[i-1][j]<dp2[i][j-1]:\r\n path='D'+path;\r\n i-=1;\r\n else:\r\n path='R'+path;\r\n j-=1;\r\n while i>0:\r\n path='D'+path;\r\n i-=1;\r\n while j>0:\r\n path='R'+path;\r\n j-=1;\r\nelse:\r\n path='';\r\n i=n-1;\r\n j=n-1;\r\n while i>0 and j>0:\r\n if dp5[i-1][j]<dp5[i][j-1]:\r\n path='D'+path;\r\n i-=1;\r\n else:\r\n path='R'+path;\r\n j-=1;\r\n while i>0:\r\n path='D'+path;\r\n i-=1;\r\n while j>0:\r\n path='R'+path;\r\n j-=1;\r\n\r\n#zero-containing case\r\nif zflag:\r\n if res>0:\r\n res=1;\r\n path='';\r\n for i in range(zindex[0]):\r\n path+='D';\r\n for i in range(zindex[1]):\r\n path+='R';\r\n for i in range(n-zindex[0]-1):\r\n path+='D';\r\n for i in range(n-zindex[1]-1):\r\n path+='R';\r\n\r\nprint(res);\r\nprint(path);\r\n \r\n\r\n \r\n\r\n", "def factors(ele):\r\n power_2, power_5 = 0, 0\r\n while not ele % 2:\r\n ele = ele // 2\r\n power_2 += 1\r\n while not ele % 5:\r\n ele = ele // 5\r\n power_5 += 1\r\n return power_2, power_5\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n matrix = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n contain_zero = False\r\n for i in range(n):\r\n for j in range(n):\r\n if matrix[i][j] == 0:\r\n matrix[i][j] = 10\r\n contain_zero = True\r\n zero_loc = (i, j)\r\n if i == 0:\r\n if j == 0:\r\n matrix[i][j] = factors(matrix[i][j])\r\n else:\r\n power_2, power_5 = factors(matrix[i][j])\r\n matrix[i][j] = (matrix[i][j - 1][0] + power_2, matrix[i][j - 1][1] + power_5)\r\n else:\r\n if j == 0:\r\n power_2, power_5 = factors(matrix[i][j])\r\n matrix[i][j] = (matrix[i - 1][j][0] + power_2, matrix[i - 1][j][1] + power_5)\r\n else:\r\n power_2, power_5 = factors(matrix[i][j])\r\n power_2 += min(matrix[i][j - 1][0], matrix[i - 1][j][0])\r\n power_5 += min(matrix[i][j - 1][1], matrix[i - 1][j][1])\r\n matrix[i][j] = (power_2, power_5)\r\n\r\n if contain_zero:\r\n if min(matrix[-1][-1]) > 1:\r\n print(1)\r\n print(\"D\" * zero_loc[0] + \"R\" * zero_loc[1] + \"D\" * (n - 1 - zero_loc[0]) + \"R\" * (n - 1 - zero_loc[1]))\r\n return\r\n mode = 0 if matrix[-1][-1][0] < matrix[-1][-1][1] else 1\r\n\r\n path = \"\"\r\n i = j = n - 1\r\n while i or j:\r\n if not j:\r\n path = \"D\" * i + path\r\n break\r\n elif not i:\r\n path = \"R\" * j + path\r\n break\r\n else:\r\n if matrix[i][j - 1][mode] <= matrix[i - 1][j][mode]:\r\n path = \"R\" + path\r\n j -= 1\r\n else:\r\n path = \"D\" + path\r\n i -= 1\r\n print(matrix[-1][-1][mode])\r\n print(path)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n \r\nr0 = [i for i in range(n)]\r\nr1 = [i for i in range(1, n)]\r\n\r\ndef pow(n, k):\r\n c = 0 \r\n while(n and n % k == 0):\r\n n = n // k \r\n c += 1 \r\n return c \r\n \r\ndef dp(k):\r\n b = [[pow(i, k) for i in c] for c in a]\r\n \r\n for i in r1:\r\n b[i][0] += b[i - 1][0]\r\n b[0][i] += b[0][i - 1]\r\n \r\n for i in r1:\r\n for j in r1:\r\n b[i][j] += min(b[i - 1][j], b[i][j - 1]) \r\n \r\n ans = ''\r\n i, j = n - 1, n - 1 \r\n while(i + j):\r\n if(i == 0 or (i * j and b[i - 1][j] > b[i][j - 1])):\r\n j -= 1 \r\n ans += 'R'\r\n \r\n else:\r\n i -= 1 \r\n ans += 'D'\r\n\r\n \r\n return (b[n - 1][n - 1], ans[::-1])\r\n \r\n(p, ans) = min(dp(2), dp(5))\r\nif(p > 1):\r\n for i in r0:\r\n for j in r0:\r\n if(a[i][j] == 0):\r\n p = 1 \r\n ans = 'R' * j + 'D' * (n - 1) + 'R' * (n - 1 - j)\r\n \r\nprint(p)\r\nprint(ans)\r\n \r\n ", "import sys\ninput = lambda: sys.stdin.readline().rstrip('\\n\\r')\n\nfrom collections import Counter, defaultdict, deque\nfrom itertools import accumulate, chain, zip_longest, product, repeat\nfrom bisect import bisect_left, bisect_right\nfrom math import gcd\nfrom string import ascii_lowercase\nfrom functools import cmp_to_key\n\nmod = 10 ** 9 + 7\nmod_2 = 998244353\n\n\n\ndef solve():\n n = int(input())\n grid = [list(map(int, input().split())) for _ in range(n)]\n dp2 = [[10 ** 9 for _ in range(n)] for _ in range(n)]\n dp5 = [[10 ** 9 for _ in range(n)] for _ in range(n)]\n p2 = [[\"\" for _ in range(n)] for _ in range(n)]\n p5 = [[\"\" for _ in range(n)] for _ in range(n)]\n zero = any(val == 0 for row in grid for val in row)\n zi, zj = -1, -1\n if zero:\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 0:\n grid[i][j] = 10\n zi, zj = i, j\n for i in range(n):\n for j in range(n):\n c2, c5 = 0, 0\n while (grid[i][j] & 1) == 0:\n c2 += 1\n grid[i][j] >>= 1\n while (grid[i][j] % 5) == 0:\n c5 += 1\n grid[i][j] //= 5\n if i > 0 and dp2[i][j] > c2 + dp2[i - 1][j]:\n dp2[i][j] = c2 + dp2[i - 1][j]\n p2[i][j] = 'D'\n if i > 0 and dp5[i][j] > c5 + dp5[i - 1][j]:\n dp5[i][j] = c5 + dp5[i - 1][j]\n p5[i][j] = 'D'\n if j > 0 and dp2[i][j] > c2 + dp2[i][j - 1]:\n dp2[i][j] = c2 + dp2[i][j - 1]\n p2[i][j] = 'R'\n if j > 0 and dp5[i][j] > c5 + dp5[i][j - 1]:\n dp5[i][j] = c5 + dp5[i][j - 1]\n p5[i][j] = 'R'\n if i == 0 and j == 0:\n dp2[i][j] = c2\n dp5[i][j] = c5\n\n if zero and min(dp2[-1][-1], dp5[-1][-1]) > 1:\n return '1\\n' + zi * 'D' + (n - 1) * 'R' + (n - 1 - zi) * 'D'\n if dp2[-1][-1] > dp5[-1][-1]:\n ps, ds = p5, dp5\n else:\n ps, ds = p2, dp2\n path = []\n i, j = n - 1, n - 1\n while ps[i][j] != '':\n path.append(ps[i][j])\n if path[-1] == 'D':\n i -= 1\n else:\n j -= 1\n return '%d\\n' % (ds[-1][-1]) + \"\".join(path[::-1])\n\nif __name__ == \"__main__\":\n val = solve()\n print(val)\n", "Y=print\r\nX=input\r\nW=int\r\nJ='R'\r\nI='D'\r\nE=range\r\nimport sys\r\nC=W(X())\r\nD=[[W(A)for A in X().split()]for A in E(C)]\r\nF=lambda:[[0]*C for A in E(C)]\r\nG=F()\r\nH=F()\r\nfor A in E(C):\r\n\tfor B in E(C):\r\n\t\tif D[A][B]==0:G[A][B]=100000;H[A][B]=100000;continue\r\n\t\twhile D[A][B]%2==0:D[A][B]//=2;G[A][B]+=1\r\n\t\twhile D[A][B]%5==0:D[A][B]//=5;H[A][B]+=1\r\ndef K(Mp,BTp):\r\n\tD=Mp;F=BTp\r\n\tfor A in E(C):\r\n\t\tfor B in E(C):\r\n\t\t\tif B==0 and A==0:continue\r\n\t\t\telif A==0:F[A][B]=J;D[A][B]+=D[A][B-1]\r\n\t\t\telif B==0:F[A][B]=I;D[A][B]+=D[A-1][B]\r\n\t\t\telif D[A][B-1]<D[A-1][B]:F[A][B]=J;D[A][B]+=D[A][B-1]\r\n\t\t\telse:F[A][B]=I;D[A][B]+=D[A-1][B]\r\nL=F()\r\nM=F()\r\nK(G,L)\r\nK(H,M)\r\ndef N(BT):\r\n\tA=[];B,D=C-1,C-1\r\n\twhile (B,D)!=(0,0):\r\n\t\tA.append(BT[B][D])\r\n\t\tif A[-1]==I:B-=1\r\n\t\telse:D-=1\r\n\treturn ''.join(A[::-1])\r\nQ=N(L)\r\nR=N(M)\r\nO=[(G[-1][-1],Q),(H[-1][-1],R)]\r\nP=False\r\nfor A in E(C):\r\n\tfor B in E(C):\r\n\t\tif D[A][B]==0:P=True;break\r\n\tif P:S=I*A+J*B;T=J*(C-1-B)+I*(C-1-A);O.append((1,S+T));break\r\nU,V=min(O)\r\nY(U)\r\nY(V)", "import bisect\r\nimport heapq\r\nimport sys\r\nfrom types import GeneratorType\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\nimport random\r\ninf = float(\"inf\")\r\nPLATFORM = \"CF\"\r\nif PLATFORM == \"LUOGU\":\r\n import numpy as np\r\n sys.setrecursionlimit(1000000)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\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 return wrappedfunc\r\n\r\n\r\ndef main(ac=FastIO()):\r\n\r\n def f_2(num):\r\n if not num:\r\n return 1\r\n res = 0\r\n while num and num % 2 == 0:\r\n num //= 2\r\n res += 1\r\n return res\r\n\r\n def f_5(num):\r\n if not num:\r\n return 1\r\n res = 0\r\n while num and num % 5 == 0:\r\n num //= 5\r\n res += 1\r\n return res\r\n\r\n n = ac.read_int()\r\n grid = [ac.read_list_ints() for _ in range(n)]\r\n\r\n def check(fun):\r\n dp = [[inf] * n for _ in range(n)]\r\n dp[0][0] = fun(grid[0][0])\r\n f = [[-1] * n for _ in range(n)]\r\n for j in range(1, n):\r\n f[0][j] = j - 1\r\n dp[0][j] = dp[0][j - 1] + fun(grid[0][j]) if grid[0][j] else 1\r\n for i in range(1, n):\r\n f[i][0] = (i - 1) * n\r\n dp[i][0] = dp[i - 1][0] + fun(grid[i][0]) if grid[i][0] else 1\r\n for j in range(1, n):\r\n if grid[i][j] == 0:\r\n dp[i][j] = 1\r\n else:\r\n c = fun(grid[i][j])\r\n dp[i][j] = ac.min(dp[i - 1][j], dp[i][j - 1]) + c\r\n f[i][j] = (i - 1) * n + j if dp[i - 1][j] < dp[i][j - 1] else i * n + j - 1\r\n cnt = dp[-1][-1]\r\n path = \"\"\r\n x = (n - 1) * n + n - 1\r\n while f[x // n][x % n] != -1:\r\n i, j = x // n, x % n\r\n p = f[i][j]\r\n if i == p // n:\r\n path += \"R\"\r\n else:\r\n path += \"D\"\r\n x = p\r\n return cnt, path[::-1]\r\n\r\n c1, path1 = check(f_2)\r\n c2, path2 = check(f_5)\r\n if c1 <= c2:\r\n ans = [c1, path1]\r\n else:\r\n ans = [c2, path2]\r\n\r\n zero = False\r\n for i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == 0:\r\n zero = True\r\n if not zero:\r\n ac.st(ans[0])\r\n ac.st(ans[1])\r\n return\r\n\r\n if ans[0] > 1:\r\n for i in range(n):\r\n for j in range(n):\r\n if grid[i][j] == 0:\r\n cur = \"D\"*i + \"R\"*j + \"D\"*(n-1-i)+\"R\"*(n-1-j)\r\n ac.st(1)\r\n ac.st(cur)\r\n return\r\n ac.st(ans[0])\r\n ac.st(ans[1])\r\n return\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\nm = []\r\nfor i in range(n):\r\n m.append(list(map(int, input().split())))\r\na2 = [[0 for i in range(n)] for j in range(n)]\r\na5 = [[0 for i in range(n)] for j in range(n)]\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if m[i][j] == 0:\r\n ans = 1\r\n path = 'R' * j + 'D' * i + 'R' * (n - 1 - j) + 'D' * (n - 1 - i)\r\n m[i][j] = 10\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n x = m[i][j]\r\n while x % 2 == 0 and x > 0:\r\n a2[i][j] += 1\r\n x //= 2\r\n while x % 5 == 0 and x > 0:\r\n a5[i][j] += 1\r\n x //= 5\r\n\r\nfor i in range(1, n):\r\n a2[i][0] += a2[i - 1][0]\r\n a2[0][i] += a2[0][i - 1]\r\n a5[i][0] += a5[i - 1][0]\r\n a5[0][i] += a5[0][i - 1]\r\n\r\nfor i in range(1, n):\r\n for j in range(1, n):\r\n a2[i][j] += min(a2[i - 1][j], a2[i][j - 1])\r\n a5[i][j] += min(a5[i - 1][j], a5[i][j - 1])\r\n\r\nif a2[-1][-1] < a5[-1][-1]:\r\n dp = a2\r\nelse:\r\n dp = a5\r\nif ans == 1 and dp[-1][-1]:\r\n print(ans)\r\n print(path)\r\n\r\nelse:\r\n i, j = n - 1, n - 1\r\n path = ''\r\n while i or j:\r\n if not i:\r\n path += 'R'\r\n j -= 1\r\n elif not j:\r\n path += 'D'\r\n i -= 1\r\n else:\r\n if dp[i - 1][j] < dp[i][j - 1]:\r\n path += 'D'\r\n i -= 1\r\n else:\r\n path += 'R'\r\n j -= 1\r\n path = path[::-1]\r\n print(dp[-1][-1])\r\n print(path)", "import sys\ninput = lambda: sys.stdin.readline().rstrip('\\n\\r')\n\nfrom collections import Counter, defaultdict, deque\nfrom itertools import accumulate, chain, zip_longest, product, repeat\nfrom bisect import bisect_left, bisect_right\nfrom math import gcd\nfrom string import ascii_lowercase\nfrom functools import cmp_to_key\n\nmod = 10 ** 9 + 7\nmod_2 = 998244353\n\n\n\ndef solve():\n n = int(input())\n grid = [list(map(int, input().split())) for _ in range(n)]\n dp2 = [[0 for _ in range(n)] for _ in range(n)]\n dp5 = [[0 for _ in range(n)] for _ in range(n)]\n p2 = [[\"\" for _ in range(n)] for _ in range(n)]\n p5 = [[\"\" for _ in range(n)] for _ in range(n)]\n\n zi, zj = -1, -1\n for i in range(n):\n for j in range(n):\n if grid[i][j] == 0:\n zi = i\n zj = j\n dp2[i][j] = 10 ** 9\n dp5[i][j] = 10 ** 9\n continue\n while (grid[i][j] & 1) == 0:\n dp2[i][j] += 1\n grid[i][j] >>= 1\n while (grid[i][j] % 5) == 0:\n dp5[i][j] += 1\n grid[i][j] //= 5\n if i > 0 and j > 0:\n x2, y2 = dp2[i - 1][j], dp2[i][j - 1]\n x5, y5 = dp5[i - 1][j], dp5[i][j - 1]\n dp2[i][j] += x2 if x2 < y2 else y2\n p2[i][j] = 'D' if x2 < y2 else 'R'\n dp5[i][j] += x5 if x5 < y5 else y5\n p5[i][j] = 'D' if x5 < y5 else 'R'\n elif i > 0:\n dp2[i][j] = dp2[i][j] + dp2[i - 1][j]\n dp5[i][j] = dp5[i][j] + dp5[i - 1][j]\n p2[i][j] = 'D'\n p5[i][j] = 'D'\n elif j > 0:\n dp5[i][j] = dp5[i][j] + dp5[i][j - 1]\n dp2[i][j] = dp2[i][j] + dp2[i][j - 1]\n p2[i][j] = 'R'\n p5[i][j] = 'R'\n \n if zi != -1:\n if dp2[-1][-1] == 0:\n path = []\n i, j = n - 1, n - 1\n while p2[i][j] != '':\n path.append(p2[i][j])\n if path[-1] == 'D':\n i -= 1\n else:\n j -= 1\n return '0\\n' + \"\".join(path[::-1]) \n if dp5[-1][-1] == 0:\n path = []\n i, j = n - 1, n - 1\n while p5[i][j] != '':\n path.append(p5[i][j])\n if path[-1] == 'D':\n i -= 1\n else:\n j -= 1\n return '0\\n' + \"\".join(path[::-1]) \n return '1\\n' + zi * 'D' + (n - 1) * 'R' + (n - 1 - zi) * 'D'\n\n else:\n if dp2[-1][-1] < dp5[-1][-1]:\n path = []\n i, j = n - 1, n - 1\n while p2[i][j] != '':\n path.append(p2[i][j])\n if path[-1] == 'D':\n i -= 1\n else:\n j -= 1\n return str(dp2[-1][-1]) + '\\n' + \"\".join(path[::-1])\n else:\n path = []\n i, j = n - 1, n - 1\n while p5[i][j] != '':\n path.append(p5[i][j])\n if path[-1] == 'D':\n i -= 1\n else:\n j -= 1\n return str(dp5[-1][-1]) + '\\n' + \"\".join(path[::-1])\n\nif __name__ == \"__main__\":\n val = solve()\n print(val)\n", "n, d1, d2, zero_i = int(input()), [], [], None\r\ndef f(i, x, m):\r\n\tglobal zero_i\r\n\tif not x:\r\n\t\tzero_i = i\r\n\t\treturn 20000\r\n\tr = 0\r\n\twhile not x % m:\r\n\t\tr += 1\r\n\t\tx //= m\r\n\treturn r\r\ndef get_path():\r\n\tfor i in range(1, n):\r\n\t\td1[i][0] += d1[i - 1][0]\r\n\t\td2[i][0] += d2[i - 1][0]\r\n\t\td1[0][i] += d1[0][i - 1]\r\n\t\td2[0][i] += d2[0][i - 1]\r\n\tfor i in range(1, n):\r\n\t\tfor j in range(1, n):\r\n\t\t\td1[i][j] += min(d1[i - 1][j], d1[i][j - 1])\r\n\t\t\td2[i][j] += min(d2[i - 1][j], d2[i][j - 1])\r\n\tif d1[-1][-1] < d2[-1][-1]:\r\n\t\treturn d1[-1][-1], build_path(d1)\r\n\telse:\r\n\t\treturn d2[-1][-1], build_path(d2)\r\ndef build_path(d):\r\n\tpath = []\r\n\ti = j = n - 1\r\n\twhile i + j:\r\n\t\tif not i or j and d[i][j - 1] < d[i - 1][j]:\r\n\t\t\tpath.append('R')\r\n\t\t\tj -= 1\r\n\t\telse:\r\n\t\t\tpath.append('D')\r\n\t\t\ti -= 1\r\n\tpath.reverse()\r\n\treturn ''.join(path)\r\ndef solve():\r\n\tans, path = get_path()\r\n\tif ans < 2 or not zero_i:\r\n\t\treturn ans, path\r\n\telse:\r\n\t\treturn 1, 'D' * zero_i +'R' * (n - 1) +'D' * (n - 1 - zero_i)\r\ndef main():\r\n\tfor i in range(n):\r\n\t\ta = [int(x) for x in input().split()]\r\n\t\td1.append([f(i,el,2) for el in a]) \r\n\t\td2.append([f(i,el,5) for el in a])\r\n \r\n\tans, path=solve()\r\n\tprint(ans)\r\n\tprint(path)\r\nif __name__=='__main__':\r\n\tmain()", "import sys\r\ndef input():\r\n\treturn sys.stdin.buffer.readline()[:-1]\r\n\r\nn = int(input())\r\na = []\r\nz = False\r\nfor i in range(n):\r\n\tl = list(map(int, input().split()))\r\n\ttmp = []\r\n\tfor j in range(n):\r\n\t\tt, f = 0, 0\r\n\t\tif l[j] == 0:\r\n\t\t\tz = True\r\n\t\t\tzi, zj = i, j\r\n\t\t\ttmp.append((0, 0))\r\n\t\t\tcontinue\r\n\t\twhile l[j] % 2 == 0:\r\n\t\t\tt += 1\r\n\t\t\tl[j] //= 2\r\n\t\twhile l[j] % 5 == 0:\r\n\t\t\tf += 1\r\n\t\t\tl[j] //= 5\r\n\t\ttmp.append((t, f))\r\n\ta.append(tmp)\r\n\r\ndp2 = [[10000 for _ in range(n)] for _ in range(n)]\r\ndp5 = [[10000 for _ in range(n)] for _ in range(n)]\r\ndp2[0][0] = a[0][0][0]\r\ndp5[0][0] = a[0][0][1]\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i+j == 0:\r\n\t\t\tcontinue\r\n\t\tif j > 0:\r\n\t\t\tdp2[i][j] = min(dp2[i][j], dp2[i][j-1] + a[i][j][0])\r\n\t\t\tdp5[i][j] = min(dp5[i][j], dp5[i][j-1] + a[i][j][1])\r\n\t\tif i > 0:\r\n\t\t\tdp2[i][j] = min(dp2[i][j], dp2[i-1][j] + a[i][j][0])\r\n\t\t\tdp5[i][j] = min(dp5[i][j], dp5[i-1][j] + a[i][j][1])\r\n\r\nif dp2[n-1][n-1] > 0 and dp5[n-1][n-1] > 0 and z:\r\n\tprint(1)\r\n\tprint(\"D\" * (zi) + \"R\" * (n-1) + \"D\" * (n-1-zi))\r\n\tsys.exit()\r\n\r\nif dp2[n-1][n-1] <= dp5[n-1][n-1]:\r\n\tprint(dp2[n-1][n-1])\r\n\tflg = True\r\nelse:\r\n\tprint(dp5[n-1][n-1])\r\n\tflg = False\r\n\r\ni, j = n-1, n-1\r\nans = \"\"\r\nfor _ in range(2*n-2):\r\n\tif i == 0:\r\n\t\tans += \"R\"\r\n\t\tj -= 1\r\n\t\tcontinue\r\n\telif j == 0:\r\n\t\tans += \"D\"\r\n\t\ti -= 1\r\n\t\tcontinue\r\n\tif flg:\r\n\t\tif dp2[i-1][j] + a[i][j][0] == dp2[i][j]:\r\n\t\t\tans += \"D\"\r\n\t\t\ti -= 1\r\n\t\telse:\r\n\t\t\tans += \"R\"\r\n\t\t\tj -= 1\r\n\telse:\r\n\t\tif dp5[i][j-1] + a[i][j][1] == dp5[i][j]:\r\n\t\t\tans += \"R\"\r\n\t\t\tj -= 1\r\n\t\telse:\r\n\t\t\tans += \"D\"\r\n\t\t\ti -= 1\r\n\r\nprint(ans[::-1])", "n = int(input())\r\nm = []\r\nfor i in range(n):\r\n m.append(list(map(int, input().split())))\r\n#Empty nxn matrix for the divisors of 2\r\ndiv2 = [[0 for i in range(n)] for ii in range(n)]\r\n#Empty nxn matrix for the divisors of 5\r\ndiv5 = [[0 for i in range(n)] for ii in range(n)]\r\n \r\nans = 0\r\n#Loop for cases where we have 0 in input\r\nfor i in range(n):\r\n for ii in range(n):\r\n if m[i][ii] == 0:\r\n ans = 1\r\n #The following variable will store the final path\r\n path = 'R' * ii + 'D' * i + 'R' * (n - 1 - ii) + 'D' * (n - 1 - i)\r\n m[i][ii] = 10\r\n#Loop for rest of the cases\r\n#We try to find cells that decompose in factors of 2 and 5\r\nfor i in range(n):\r\n for ii in range(n):\r\n x = m[i][ii]\r\n while x % 2 == 0 and x > 0:\r\n div2[i][ii] += 1\r\n x //= 2\r\n while x % 5 == 0 and x > 0:\r\n div5[i][ii] += 1\r\n x //= 5\r\n#Now, we start the actual movement \r\n#We add each number we pass to the previous one as we go\r\nfor i in range(1, n):\r\n div2[i][0] += div2[i - 1][0]\r\n div2[0][i] += div2[0][i - 1]\r\n div5[i][0] += div5[i - 1][0]\r\n div5[0][i] += div5[0][i - 1]\r\n#We apply the previous loop procedure to the entire list\r\nfor i in range(1, n):\r\n for ii in range(1, n):\r\n div2[i][ii] += min(div2[i - 1][ii], div2[i][ii - 1])\r\n div5[i][ii] += min(div5[i - 1][ii], div5[i][ii - 1])\r\n#We record the number of zeros resulted from our movement\r\nif div2[-1][-1] < div5[-1][-1]:\r\n dp = div2\r\nelse:\r\n dp = div5\r\nif ans == 1 and dp[-1][-1]:\r\n print(ans)\r\n print(path)\r\n#We start from the top left corner, recording our moves on our\r\n#way to the bottom right corner \r\nelse:\r\n i, ii = n - 1, n - 1\r\n path = ''\r\n #Now, we determine the direction we moved into by comparing our\r\n #current position to the previous one and include the record in path\r\n while i or ii:\r\n if not i:\r\n path += 'R'\r\n ii -= 1\r\n elif not ii:\r\n path += 'D'\r\n i -= 1\r\n else:\r\n if dp[i - 1][ii] < dp[i][ii - 1]:\r\n path += 'D'\r\n i -= 1\r\n else:\r\n path += 'R'\r\n ii -= 1\r\n path = path[::-1]\r\n #Now, we print the least number of trailing zeros, then the full record of the moves\r\n print(dp[-1][-1])\r\n print(path)", "n=int(input())\r\nlis2=[]\r\nlis5=[]\r\nliss=[lis2,lis5]\r\nzero_i=None\r\ndef flis(i,val,m):\r\n\tglobal zero_i\r\n\tif val==0:\r\n\t\tzero_i=i\r\n\t\treturn 20000\r\n\tr=0\r\n\twhile val % m==0:\r\n\t\tr+=1\r\n\t\tval//=m\r\n\treturn r\r\n\r\ndef get_path():\r\n\tfor i in range(1,n):\r\n\t\tlis2[i][0]+=lis2[i-1][0]\r\n\t\tlis5[i][0]+=lis5[i-1][0]\r\n\tfor j in range(1,n):\r\n\t\tlis2[0][j]+=lis2[0][j-1]\r\n\t\tlis5[0][j]+=lis5[0][j-1]\r\n\r\n\tfor i in range(1,n):\r\n\t\tfor j in range(1,n):\r\n\t\t\tlis2[i][j]+=min(lis2[i-1][j],lis2[i][j-1])\r\n\t\t\tlis5[i][j]+=min(lis5[i-1][j],lis5[i][j-1])\r\n\tif lis2[-1][-1] < lis5[-1][-1]:\r\n\t\treturn lis2[-1][-1],build_path(lis2)\r\n\telse:\r\n\t\treturn lis5[-1][-1] , build_path(lis5)\r\ndef build_path(lis):\r\n\tpath=[]\r\n\ti=j=n-1\r\n\twhile i+j:\r\n\t\tif i==0 or not j==0 and lis[i][j-1] < lis[i-1][j]:\r\n\t\t\tpath.append('R')\r\n\t\t\tj-=1\r\n\t\telse:\r\n\t\t\tpath.append('D')\r\n\t\t\ti-=1\r\n\tpath.reverse()\r\n\treturn ''.join(path)\r\ndef solve():\r\n\tzero,path=get_path()\r\n\tif zero < 2:\r\n\t\treturn zero,path\r\n\tif zero_i is None:\r\n\t\treturn zero,path\r\n\telse:\r\n\t\treturn 1,'D'*zero_i +'R'*(n-1) +'D'*(n-1-zero_i)\r\ndef main():\r\n\tfor i in range(n):\r\n\t\tl=[int(x) for x in input().split()]\r\n\t\tlis2.append([flis(i,e,2) for e in l]) \r\n\t\tlis5.append([flis(i,e,5) for e in l])\r\n\r\n\tzero,path=solve()\r\n\tprint(zero)\r\n\tprint(path)\r\nif __name__=='__main__':\r\n\tmain()", "n = int(input())\r\nlis2 = []\r\nlis5 = []\r\nliss = [lis2,lis5]\r\nzero_i = None\r\ndef flis(i,val,m):\r\n\tglobal zero_i\r\n\tif val == 0:\r\n\t\tzero_i = i\r\n\t\treturn 20000\r\n\tr = 0\r\n\twhile val % m == 0:\r\n\t\tr += 1\r\n\t\tval //= m\r\n\treturn r\r\n\r\ndef get_path():\r\n\tfor i in range(1,n):\r\n\t\tlis2[i][0] += lis2[i-1][0]\r\n\t\tlis5[i][0] += lis5[i-1][0]\r\n\tfor j in range(1,n):\r\n\t\tlis2[0][j] += lis2[0][j-1]\r\n\t\tlis5[0][j] += lis5[0][j-1]\r\n\r\n\tfor i in range(1,n):\r\n\t\tfor j in range(1,n):\r\n\t\t\tlis2[i][j] += min(lis2[i-1][j],lis2[i][j-1])\r\n\t\t\tlis5[i][j] += min(lis5[i-1][j],lis5[i][j-1])\r\n\tif lis2[-1][-1] < lis5[-1][-1]:\r\n\t\treturn lis2[-1][-1], build_path(lis2)\r\n\telse:\r\n\t\treturn lis5[-1][-1], build_path(lis5)\r\ndef build_path(lis):\r\n\tpath = []\r\n\ti = j = n - 1\r\n\twhile i + j:\r\n\t\tif i == 0 or not j == 0 and lis[i][j-1] < lis[i-1][j]:\r\n\t\t\tpath.append('R')\r\n\t\t\tj -= 1\r\n\t\telse:\r\n\t\t\tpath.append('D')\r\n\t\t\ti -= 1\r\n\tpath.reverse()\r\n\treturn ''.join(path)\r\n\r\ndef solve():\r\n\tzero, path = get_path()\r\n\tif zero < 2:\r\n\t\treturn zero, path\r\n\tif zero_i is None:\r\n\t\treturn zero, path\r\n\telse:\r\n\t\treturn 1, 'D' * zero_i + 'R' * (n - 1) + 'D' * (n - 1 -zero_i)\r\n\r\ndef ans():\r\n\tfor i in range(n):\r\n\t\tl = [int(x) for x in input().split()]\r\n\t\tlis2.append([flis(i, e, 2) for e in l]) \r\n\t\tlis5.append([flis(i, e, 5) for e in l])\r\n\r\n\tzero,path = solve()\r\n\tprint(zero)\r\n\tprint(path)\r\n\r\nans()" ]

[ "p=int(input())\r\ng=0\r\nfor x in range(1,p):\r\n i=x\r\n u=1\r\n o=0\r\n while u<p-1:\r\n x%=p\r\n if (x-1)%p==0:\r\n break\r\n x*=i\r\n u+=1\r\n else:\r\n if (x-1)%p==0:\r\n g+=1\r\nprint(g)", "p = int(input())\r\ndef gcd(a,b): \r\n \r\n # Everything divides 0 \r\n if (b == 0): \r\n return a \r\n return gcd(b, a%b) \r\n\r\nc = 0\r\nfor i in range(1,p) :\r\n if gcd(p-1,i) == 1 :\r\n \r\n c += 1\r\n \r\nprint(c)", "from math import gcd\r\n\r\nn = int(input().strip())\r\ncount = 0\r\nfor i in range(1, n):\r\n if gcd(i, n - 1) == 1:\r\n count += 1\r\n #print(i)\r\nprint(count)", "def solve(a , b):\r\n if b == 0 :\r\n return a\r\n else:\r\n return solve(b , a % b)\r\n\r\nn = int(input())\r\nn-=1\r\ncnt = 0\r\n\r\nfor i in range(1 , n + 1):\r\n if solve(i , n) == 1 :\r\n cnt+=1\r\n\r\nprint(cnt)\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\nn=int(input())\r\ncount=[]\r\ncount=[ 1 if gcd(i,n-1)==1 else 0 for i in range(1,n)]\r\nprint(sum(count))", "import math\r\nn= int(input())\r\nans=0\r\nfor i in range(1,n):\r\n if math.gcd(i,n-1)==1:\r\n ans+=1\r\n\r\nprint(ans)", "from math import gcd\n\na = int(input()) -1\n\naux = 1\n\nfor i in range(2, a):\n if gcd(i, a) == 1:\n aux = aux + 1\nprint(aux)\n \t \t\t \t\t\t \t \t \t\t \t \t\t\t \t", "def phi(n):\r\n t, i = n, 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n n //= i\r\n while n % i == 0: n //= i\r\n t -= t // i\r\n i += 1\r\n return t - t // n if n > 1 else t\r\nprint(phi(int(input()) - 1))", "from fractions import gcd\r\n\r\ntt=0\r\n\r\n#phi(p-1)\r\n\r\nx=int(input())\r\n\r\nx-=1\r\n\r\nfor i in range(1, x+1):\r\n\r\n if gcd(x,i)==1:\r\n\r\n tt+=1\r\n\r\nprint(tt)", "def phi(n) : \r\n \r\n result = n # Initialize result as n \r\n \r\n # Consider all prime factors \r\n # of n and for every prime \r\n # factor p, multiply result with (1 - 1 / p) \r\n p = 2\r\n while(p * p<= n) : \r\n \r\n # Check if p is a prime factor. \r\n if (n % p == 0) : \r\n \r\n # If yes, then update n and result \r\n while (n % p == 0) : \r\n n = n // p \r\n result = result * (1.0 - (1.0 / (float) (p))) \r\n p = p + 1\r\n \r\n \r\n # If n has a prime factor \r\n # greater than sqrt(n) \r\n # (There can be at-most one \r\n # such prime factor) \r\n if (n > 1) : \r\n result = result * (1.0 - (1.0 / (float)(n))) \r\n \r\n return (int)(result)\r\np=int(input())\r\nans=phi(p-1)\r\nprint(ans)", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\n\r\np = int(input())\r\nc=0\r\nfor i in range(1,p):\r\n if gcd(i,p-1)==1:\r\n c+=1\r\nprint(c)", "import math\r\n\r\np=int(input())\r\n\r\narr=[]\r\nflag1=0\r\nflag2=0\r\ncount=1\r\nfor i in range(2,p-1):\r\n if(math.gcd(i,p-1)==1):\r\n #print(i)\r\n count+=1\r\n \r\n\r\nprint(count)", "from math import gcd\r\na=int(input())\r\nk=0\r\nfor i in range(1,a):\r\n if gcd(a-1,i)==1: k+=1\r\nprint(k)", "n=int(input())\r\nif(n==2):\r\n print(1)\r\n exit()\r\nn-=1\r\nres=0\r\nfor i in range(1,n):\r\n chk=True\r\n for j in range(2,i+1):\r\n if(n%j==0 and i%j==0): \r\n chk=False\r\n if(chk):\r\n res+=1\r\nprint(res)", "import math\r\np=int(input())\r\nc=1\r\nfor i in range(3,p-1):\r\n if math.gcd(i,p-1)==1:\r\n c+=1\r\nprint(c)", "import math\r\np = int(input())\r\nc = 0\r\nfor i in range(1,p):\r\n if math.gcd(i,p-1)==1:\r\n c = c+1\r\nprint(c)\r\n", "from math import gcd\r\nn=int(input())\r\nresult=1\r\nfor i in range(2,n-1):\r\n if(gcd(i,n-1)==1):\r\n #print(i)\r\n result+=1\r\nprint(result)", "from fractions import gcd\r\ntt=0\r\n#phi(p-1)\r\nx=int(input())\r\nx-=1\r\nfor i in range(1, x+1):\r\n if gcd(x,i)==1:\r\n tt+=1\r\nprint(tt)\r\n", "def is_primitive(x, p):\n return (pow(x, p - 1, p) == 1) and all(pow(x, e, p) != 1 for e in range(1, p - 1))\n\np = int(input())\nans = sum(is_primitive(x, p) for x in range(1, p))\nprint(ans)\n", "t=0\r\nfrom fractions import gcd\r\n\r\nx=int(input())-1\r\nfor i in range(1, x+1):\r\n if gcd(x, i)==1:\r\n t+=1\r\nprint(t)\r\n", "from math import gcd \r\np=int(input())-1\r\ncnt=0 \r\nfor i in range(1,p):\r\n if gcd(i,p)==1: cnt+=1 \r\nprint(cnt if p!=1 else 1)", "import math\r\nsol = 0\r\np=int(input())\r\nfor e in range(1, p):\r\n if math.gcd(p-1, e) == 1:\r\n sol+=1\r\nprint(sol)", "from math import *\r\nn=int(input())\r\nc=1\r\nfor i in range(2,n-1):\r\n if(gcd(i,n-1)==1):\r\n c+=1\r\nprint(c)", "p = int(input())\nn = p - 1\n\nprime_factors = {}\n\nwhile n % 2 == 0:\n n >>= 1\n prime_factors[2] = prime_factors.get(2, 0) + 1\n\nfor i in range(3, int(n ** (1 / 2)) + 1, 2):\n if n % i == 0:\n while n % i == 0:\n n //= i\n prime_factors[i] = prime_factors.get(i, 0) + 1\n\nif n > 2:\n prime_factors[n] = 1\nn = p - 1\ntotal = 1\n\nfor i, j in prime_factors.items():\n total *= i ** (j - 1) * (i - 1)\n\nprint(total)", "from math import gcd\nn = int(input())\nans = 0\nfor I in range(n - 1):\n ans = ans + (gcd(I, n - 1) == 1)\nprint(ans)\n ", "p = int(input()) - 1\ndef hcf(a, b):\n if a is 0:\n return b\n else:\n return hcf(b % a, a)\ncnt = 0\nfor i in range(1, p + 1):\n if hcf(i, p) is 1:\n cnt += 1\nprint(cnt)\n", "def phi(n):\r\n ans = n\r\n p = 2\r\n while p*p <=n:\r\n if n % p == 0:\r\n ans //= p\r\n ans *= p-1\r\n while n % p == 0:\r\n n //= p\r\n p += 1\r\n if n!=1:\r\n ans //= n\r\n ans *= n-1\r\n return ans\r\n\r\np = int(input())\r\nprint(phi(p-1))\r\n\r\n", "from math import gcd\r\nn=int(input())-1\r\ncount=1\r\nfor i in range(2,n):\r\n if gcd(i,n)==1:\r\n count+=1\r\nprint(count)", "p = int(input())\n\ndef euler_totient(n):\n phi = n\n i = 2\n while i*i <= n:\n if n % i == 0:\n while n % i == 0:\n n //= i\n phi -= phi // i\n i += 1\n if n > 1:\n phi -= phi // n\n return phi\n\nresult = euler_totient(p - 1)\nprint(result)\n\t \t\t \t \t\t \t\t \t \t \t\t\t\t", "p = int(input())\r\nc = 0\r\nfor i in range(1, p):\r\n x = i\r\n l = 1\r\n for j in range(1, p - 1):\r\n l *= x\r\n l %= p\r\n if (l - 1) % p != 0:\r\n continue\r\n else:\r\n break\r\n else:\r\n if ((l * x) - 1) % p == 0:\r\n c += 1\r\nprint(c)", "def solve() :\n from math import gcd\n c=0\n for x in range(1,p):\n if gcd(x,p-1)==1:\n c+=1\n return c\n\n \n\n\n\n \nfrom sys import stdin\ninput = stdin.readline \n \n \np=int(input())\nprint(solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([x for x in input().strip()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n'''", "import math\r\np=int(input())\r\ncnt=1\r\nfor i in range(3,p-1):\r\n if math.gcd(i , p-1)==1:\r\n cnt+=1\r\nprint (cnt)", "import math\r\nr=1\r\nx=int(input())\r\nfor i in range(2,x-1):\r\n if(math.gcd(i,x-1)==1):\r\n r+=1\r\nprint(r)", "p=int(input())\r\ncount=0\r\nfor i in range(1,p):\r\n\tz,x=1,1\r\n\tfor j in range(1,p-1):\r\n\t\tx*=i\r\n\t\tx%=p\r\n\t\tif x==1:\r\n\t\t\tz=0\r\n\t\t\tbreak\r\n\tif z==1:\r\n\t\tx*=i\r\n\t\tx%=p\r\n\t\tif x==1:\r\n\t\t\tcount+=1\r\nprint(count)\r\n\t\r\n", "import sys\nimport fractions\n\ndef phi(n):\n amount = 0\n\n for k in range(1, n + 1):\n if fractions.gcd(n, k) == 1:\n amount += 1\n\n return amount\n\ndef solve():\n p = int(input())\n return phi(p-1)\n \ndef read(mode=2):\n inputs = input().strip()\n if mode == 0: return inputs # String\n if mode == 1: return inputs.split() # List of strings\n if mode == 2: return list(map(int, inputs.split())) # List of integers\ndef write(s=\"\\n\"):\n if s is None: s = \"\"\n if isinstance(s, list): s = \" \".join(map(str, s))\n if isinstance(s, tuple): s = \" \".join(map(str, s))\n s = str(s)\n print(s, end=\"\")\ndef run():\n # if sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\n res = solve()\n write(res)\nrun()", "def main():\r\n p = int(input())\r\n n = p - 1\r\n count = 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 count = count // i * (i - 1)\r\n i += 1\r\n if n != 1:\r\n count = count // n * (n - 1)\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def Power(a,b,c):\r\n if(b==0):\r\n return 1\r\n x=a%c\r\n u=1\r\n while(b!=0):\r\n if(b%2==1):\r\n u=(u*x)%c\r\n x=(x*x)%c\r\n b=b//2\r\n return u\r\n\r\n\r\n\r\nn=int(input())\r\nans=0\r\nfor i in range(1,n):\r\n ctr=0\r\n for j in range(1,n-1):\r\n if((Power(i,j,n)-1)%n)==0:\r\n ctr=1\r\n break\r\n if ctr!=1 and (Power(i,n-1,n)-1)%n==0:\r\n ans=ans+1\r\nprint(ans)\r\n", "from math import gcd\n\ndef solve(p):\n total = 0\n for i in range(2, p):\n if gcd(i, p) == 1:\n total += 1\n\n print(total+1)\n\n\nn = int(input())\nsolve(n-1)\n \t\t \t \t \t\t\t\t \t\t \t\t \t \t\t\t", "from math import gcd\n\ndef phi(n):\n amount = 0 \n for k in range(1, n + 1):\n if gcd(n, k) == 1:\n amount += 1\n return amount\n\nprint(phi(int(input()) - 1))\n\t\t \t \t\t \t \t \t \t\t \t\t\t\t\t\t \t \t", "n = int(input())\r\nr = 0\r\nfor i in range(1, n):\r\n flg = True\r\n c = 1\r\n for j in range(1, n - 1):\r\n c = c * i % n\r\n if c == 1:\r\n flg = False\r\n break\r\n c = c * i % n\r\n if c != 1:\r\n flg = False\r\n\r\n r += 1 if flg else 0\r\nprint(r)\r\n", "from math import gcd\r\np= int(input())-1\r\nans=0\r\nfor j in range(1,p+1):\r\n if gcd(j,p)==1:\r\n ans+=1\r\nprint(ans)", "from math import *\r\np = int(input())\r\ncnt=0\r\nc=0\r\nd=0\r\nfor i in range(1,p):\r\n if gcd(i,p-1)==1:\r\n cnt+=1\r\nprint(cnt)\r\n", "import math\n\nentrada = int(input())\nresultado = 1\n\nfor i in range(2, entrada-1):\n if math.gcd(i, entrada-1) == 1:\n resultado += 1\n\nprint(resultado)\n\n\t \t \t\t \t \t\t \t\t \t\t \t \t\t \t \t\t", "def __gcd(a,b): \r\n\r\n\tif(b == 0): \r\n\t\treturn a \r\n\telse: \r\n\t\treturn __gcd(b, a % b) \r\n#from math import gcd\r\nn=int(input())\r\nr=1\r\nn=n-1\r\nfor i in range(2, n):\r\n\t\tif (__gcd(i, n) == 1): \r\n\t\t\tr+=1\r\nprint(r)", "import math\r\n\r\np=int(input())\r\np-=1\r\nnum=p\r\nfactors=[]\r\ncount=[]\r\nwhile num % 2 == 0:\r\n if 2 not in factors:\r\n factors.append(2)\r\n count.append(1)\r\n else:\r\n count[0]+=1\r\n num = num / 2\r\nfor i in range(3, int(math.sqrt(num)) + 1, 2):\r\n while num % i == 0:\r\n if i not in factors:\r\n factors.append(i)\r\n count.append(1)\r\n else:\r\n k=factors.index(i)\r\n count[k]+=1\r\n num = num / i\r\nif num > 2:\r\n factors.append(num)\r\n count.append(1)\r\nans=int(p)\r\nfor i in factors:\r\n ans*=(i-1)/i\r\nprint(int(ans))", "# 284a\nimport sys\nfrom math import gcd\ninput = sys.stdin.readline\n\np = int(input())\n\n# prim roots = φ(φ(p)) = φ(p-1) as p is always prime\nans = 0\nfor i in range(1, p):\n if gcd(p-1, i) == 1:\n ans += 1\n\nprint(ans)\n\n", "p=int(input())\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\ncount=1\r\nfor i in range(2,p-1):\r\n if gcd(i,p-1)==1:\r\n count+=1\r\nprint(count)", "from math import gcd\r\nn=int(input())\r\nr=1\r\nn=n-1\r\nfor i in range(2, n):\r\n\t\tif (gcd(i, n) == 1): \r\n\t\t\tr+=1\r\nprint(r)", "def Power(a,b,c):\r\n if(b==0):\r\n return 1\r\n x=a%c\r\n u=1\r\n while(b!=0):\r\n if(b%2==1):\r\n u=(u*x)%c\r\n x=(x*x)%c\r\n b=b//2\r\n return u\r\nn=int(input())\r\na=0\r\nfor i in range(1,n):\r\n c=0\r\n for j in range(1,n-1):\r\n if((Power(i,j,n)-1)%n)==0:\r\n c=1\r\n break\r\n if c!=1 and (Power(i,n-1,n)-1)%n==0:\r\n a=a+1\r\nprint(a)\r\n", "# Cows and Primitive Roots\n\n# pre-calculei\nprs = {\"2\": 1, \"3\": 1, \"5\": 2, \"7\": 2, \"11\": 4, \"13\": 4, \"17\": 8, \"19\": 6, \"23\": 10, \"29\": 12, \"31\": 8, \"37\": 12, \"41\": 16, \"43\": 12, \"47\": 22, \"53\": 24, \"59\": 28, \"61\": 16, \"67\": 20, \"71\": 24, \"73\": 24, \"79\": 24, \"83\": 40, \"89\": 40, \"97\": 32, \"101\": 40, \"103\": 32, \"107\": 52, \"109\": 36, \"113\": 48, \"127\": 36, \"131\": 48, \"137\": 64, \"139\": 44, \"149\": 72, \"151\": 40, \"157\": 48, \"163\": 54, \"167\": 82, \"173\": 84, \"179\": 88, \"181\": 48, \"191\": 72, \"193\": 64, \"197\": 84, \"199\": 60, \"211\": 48, \"223\": 72, \"227\": 112, \"229\": 72, \"233\": 112, \"239\": 96, \"241\": 64, \"251\": 100, \"257\": 128, \"263\": 130, \"269\": 132, \"271\": 72, \"277\": 88, \"281\": 96, \"283\": 92, \"293\": 144, \"307\": 96, \"311\": 120, \"313\": 96, \"317\": 156, \"331\": 80, \"337\": 96, \"347\": 172, \"349\": 112, \"353\": 160, \"359\": 178, \"367\": 120, \"373\": 120, \"379\": 108, \"383\": 190, \"389\": 192, \"397\": 120, \"401\": 160, \"409\": 128, \"419\": 180, \"421\": 96, \"431\": 168, \"433\": 144, \"439\": 144, \"443\": 192, \"449\": 192, \"457\": 144, \"461\": 176, \"463\": 120, \"467\": 232, \"479\": 238, \"487\": 162, \"491\": 168, \"499\": 164, \"503\": 250, \"509\": 252, \"521\": 192, \"523\": 168, \"541\": 144, \"547\": 144, \"557\": 276, \"563\": 280, \"569\": 280, \"571\": 144, \"577\": 192, \"587\": 292, \"593\": 288, \"599\": 264, \"601\": 160, \"607\": 200, \"613\": 192, \"617\": 240, \"619\": 204, \"631\": 144, \"641\": 256, \"643\": 212, \"647\": 288, \"653\": 324, \"659\": 276, \"661\": 160, \"673\": 192, \"677\": 312, \"683\": 300, \"691\": 176, \"701\": 240, \"709\": 232, \"719\": 358, \"727\": 220, \"733\": 240, \"739\": 240, \"743\": 312, \"751\": 200, \"757\": 216, \"761\": 288, \"769\": 256, \"773\": 384, \"787\": 260, \"797\": 396, \"809\": 400, \"811\": 216, \"821\": 320, \"823\": 272, \"827\": 348, \"829\": 264, \"839\": 418, \"853\": 280, \"857\": 424, \"859\": 240, \"863\": 430, \"877\": 288, \"881\": 320, \"883\": 252, \"887\": 442, \"907\": 300, \"911\": 288, \"919\": 288, \"929\": 448, \"937\": 288, \"941\": 368, \"947\": 420, \"953\": 384, \"967\": 264, \"971\": 384, \"977\": 480, \"983\": 490, \"991\": 240, \"997\": 328, \"1009\": 288, \"1013\": 440, \"1019\": 508, \"1021\": 256, \"1031\": 408, \"1033\": 336, \"1039\": 344, \"1049\": 520, \"1051\": 240, \"1061\": 416, \"1063\": 348, \"1069\": 352, \"1087\": 360, \"1091\": 432, \"1093\": 288, \"1097\": 544, \"1103\": 504, \"1109\": 552, \"1117\": 360, \"1123\": 320, \"1129\": 368, \"1151\": 440, \"1153\": 384, \"1163\": 492, \"1171\": 288, \"1181\": 464, \"1187\": 592, \"1193\": 592, \"1201\": 320, \"1213\": 400, \"1217\": 576, \"1223\": 552, \"1229\": 612, \"1231\": 320, \"1237\": 408, \"1249\": 384, \"1259\": 576, \"1277\": 560, \"1279\": 420, \"1283\": 640, \"1289\": 528, \"1291\": 336, \"1297\": 432, \"1301\": 480, \"1303\": 360, \"1307\": 652, \"1319\": 658, \"1321\": 320, \"1327\": 384, \"1361\": 512, \"1367\": 682, \"1373\": 588, \"1381\": 352, \"1399\": 464, \"1409\": 640, \"1423\": 468, \"1427\": 660, \"1429\": 384, \"1433\": 712, \"1439\": 718, \"1447\": 480, \"1451\": 560, \"1453\": 440, \"1459\": 486, \"1471\": 336, \"1481\": 576, \"1483\": 432, \"1487\": 742, \"1489\": 480, \"1493\": 744, \"1499\": 636, \"1511\": 600, \"1523\": 760, \"1531\": 384, \"1543\": 512, \"1549\": 504, \"1553\": 768, \"1559\": 720, \"1567\": 504, \"1571\": 624, \"1579\": 524, \"1583\": 672, \"1597\": 432, \"1601\": 640, \"1607\": 720, \"1609\": 528, \"1613\": 720, \"1619\": 808, \"1621\": 432, \"1627\": 540, \"1637\": 816, \"1657\": 528, \"1663\": 552, \"1667\": 672, \"1669\": 552, \"1693\": 552, \"1697\": 832, \"1699\": 564, \"1709\": 720, \"1721\": 672, \"1723\": 480, \"1733\": 864, \"1741\": 448, \"1747\": 576, \"1753\": 576, \"1759\": 584, \"1777\": 576, \"1783\": 540, \"1787\": 828, \"1789\": 592, \"1801\": 480, \"1811\": 720, \"1823\": 910, \"1831\": 480, \"1847\": 840, \"1861\": 480, \"1867\": 620, \"1871\": 640, \"1873\": 576, \"1877\": 792, \"1879\": 624, \"1889\": 928, \"1901\": 720, \"1907\": 952, \"1913\": 952, \"1931\": 768, \"1933\": 528, \"1949\": 972, \"1951\": 480, \"1973\": 896, \"1979\": 924, \"1987\": 660, \"1993\": 656, \"1997\": 996, \"1999\": 648, \"2003\": 720}\n\ndef main():\n p = input()\n print(prs[p])\n\nif __name__ == '__main__':\n main()\n\n\t \t \t\t \t\t\t\t \t\t \t \t\t\t \t\t", "import math\r\np=int(input())\r\nans=1\r\nfor x in range(3,p-1):\r\n if math.gcd(x,p-1)==1: ans+=1\r\nprint(ans)\r\n" ]

[ "import sys\n\n\ndef main():\n toks = (tok for tok in sys.stdin.read().split())\n names = [\"\"]\n n = int(next(toks))\n\n for _ in range(n): \n names.append([next(toks), next(toks)])\n\n i = int(next(toks))\n prev = min(names[i][0], names[i][1])\n for _ in range(1, n):\n i = int(next(toks))\n if (names[i][0] < names[i][1]):\n curMin = names[i][0]\n curMax = names[i][1]\n else:\n curMin = names[i][1]\n curMax = names[i][0]\n if (curMin > prev):\n prev = curMin\n elif (curMax > prev):\n prev = curMax\n else:\n print(\"NO\")\n return\n print(\"YES\")\n return \n \nmain()\n\n", "n = int(input())\r\nlis=[]\r\nfor i in range(n):\r\n a=list(map(str,input().split()))\r\n lis.append(a)\r\naa=list(map(int,input().split()))\r\ncur=min(lis[aa[0]-1][0],lis[aa[0]-1][1])\r\nfor i in range(1,n):\r\n a,b=sorted(lis[aa[i]-1])\r\n# print(cur,a,b)\r\n if cur<a:\r\n cur=a\r\n elif cur<b:\r\n cur=b\r\n else:\r\n print(\"NO\")\r\n exit() \r\nprint(\"YES\") \r\n", "n=int(input())\r\ns=[0]*n\r\nt=[0]*n\r\nfor i in range(n):\r\n s[i],t[i]=input().split()\r\n if s[i]>t[i]:\r\n s[i],t[i]=t[i],s[i]\r\np=list(map(lambda x: int(x)-1,input().split()))\r\nc=s[p[0]]\r\nfor i in p[1:]:\r\n if c<s[i]:\r\n c=s[i]\r\n elif c<t[i]:\r\n c=t[i]\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "import sys\n\ntoks = (tok for tok in sys.stdin.read().split())\n\nn = int(next(toks))\nnames = [\"\"]\nfor _ in range(n):\n names.append([next(toks), next(toks)])\n\ndef main():\n i = int(next(toks))\n prev = min(names[i][0], names[i][1])\n for i in range(n-1):\n i = int(next(toks))\n curmin = min(names[i][0], names[i][1])\n curmax = max(names[i][0], names[i][1])\n if (prev < curmin):\n prev = curmin\n elif (prev < curmax):\n prev = curmax\n else:\n return \"NO\"\n return \"YES\"\n\nprint(main())\n\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\ng = [sorted(input()[:-1].split()) for _ in range(n)]\r\nw = list(map(int, input().split()))\r\nd = [0] * n\r\nfor i in range(n):\r\n d[i] = g[w[i]-1]\r\n\r\nd[0].pop()\r\nfor i in range(1, n):\r\n if d[i][0] >= d[i-1][0]:\r\n d[i].pop()\r\n elif d[i][1] >= d[i-1][0]:\r\n d[i].pop(0)\r\n else:\r\n print('NO')\r\n exit(0)\r\nelse:\r\n print('YES')", "def main():\r\n args = int(input())\r\n arr = []\r\n for _ in range(args):\r\n f,l = input().split(\" \")\r\n arr.append((f,l))\r\n canSort,status = [],True\r\n order = list(map(int,input().split(\" \")))\r\n order.reverse()\r\n while order:\r\n first,last = arr[order.pop()-1]\r\n if not canSort:\r\n if first > last:\r\n canSort.append(last)\r\n else:\r\n canSort.append(first)\r\n continue\r\n if not (first > canSort[-1] or last > canSort[-1]):\r\n status = False\r\n break\r\n if first > canSort[-1] and last > canSort[-1]:\r\n if first > last:\r\n canSort.append(last)\r\n else:\r\n canSort.append(first)\r\n continue\r\n if first > canSort[-1]:\r\n canSort.append(first)\r\n else:\r\n canSort.append(last)\r\n if status:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\t\r\n \r\nif __name__ == \"__main__\":\r\n\tmain()" ]

[ "n=int(input())\r\na=list(map(int, input().split()))\r\nc=0\r\nt=0\r\nx=[]\r\ny=[]\r\nq=[]\r\nd=0\r\nw=0\r\nfor i in range(n):\r\n if a[i]**0.5==int(a[i]**0.5):\r\n c+=1\r\n x.append(a[i])\r\n else:\r\n t+=1\r\n y.append(a[i])\r\nif c==t:\r\n print(0)\r\nelif t>c:\r\n for i in range(t):\r\n q.append(min(y[i]-int(y[i]**0.5)**2,(int(y[i]**0.5)+1)**2-y[i]))\r\n q=sorted(q)\r\n for i in range(n//2-c):\r\n d+=q[i]\r\n print(d)\r\nelse:\r\n for i in range(c):\r\n if x[i]!=0:\r\n w+=1\r\n if n//2-t<=w:\r\n print(n//2-t)\r\n else:\r\n print(n//2-t+n//2-t-w)", "import math\r\n\r\nn = int(input())\r\nls = list(map(int, input().split()))\r\n\r\ndiff_to_square = []\r\ndiff_to_non_square = []\r\nfor elem in ls:\r\n sqrt = math.floor(math.sqrt(elem))\r\n if sqrt * sqrt != elem:\r\n diff_to_square.append(min(elem - sqrt * sqrt, (sqrt + 1) * (sqrt + 1) - elem))\r\n else:\r\n if elem == 0:\r\n diff_to_non_square.append(2)\r\n else:\r\n diff_to_non_square.append(1)\r\n\r\nif len(diff_to_square) <= n // 2:\r\n diff_to_non_square.sort()\r\n s = 0\r\n for i in range(len(diff_to_non_square) - n // 2):\r\n s += diff_to_non_square[i]\r\n print(s)\r\nelse:\r\n diff_to_square.sort()\r\n s = 0\r\n for i in range(len(diff_to_square) - n // 2):\r\n s += diff_to_square[i]\r\n print(s)\r\n", "import heapq\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nheap=[]\r\ndef IsSqrt(x):\r\n return int(x**0.5)-x**0.5==0\r\ndef getMinDis(x):\r\n num=int(x**0.5)\r\n return min(abs(x-num**2),abs(x-(num+1)**2))\r\ns0,s_,no=0,0,0\r\nfor i in range(n):\r\n if IsSqrt(l[i]):\r\n if l[i]==0:\r\n s0+=1\r\n else:\r\n s_+=1\r\n else:\r\n no+=1\r\n heapq.heappush(heap,getMinDis(l[i]))\r\nif s0+s_==no:print(0)\r\nelif s0+s_<no:\r\n cha=no-n//2\r\n step=0\r\n while cha:\r\n step+=heapq.heappop(heap)\r\n cha-=1\r\n print(step)\r\nelse:\r\n cha=s0+s_-n//2\r\n if s_>=cha:print(cha)\r\n else:print(s_+(cha-s_)*2)", "from sys import stdin, stdout\r\nfrom math import sqrt\r\n\r\n\r\ndef is_square(a):\r\n x = round(sqrt(a))\r\n return x * x == a\r\n\r\n\r\ndef need(a):\r\n x = int(sqrt(a))\r\n d1 = abs(a - x * x)\r\n d2 = abs(a - (x+1) * (x+1))\r\n return min(d1, d2)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, stdin.readline().split()))\r\nsq_cnt = 0\r\nfor x in a:\r\n if is_square(x):\r\n sq_cnt += 1\r\nif sq_cnt > n // 2:\r\n cnt0 = a.count(0)\r\n cnt1 = sq_cnt - cnt0\r\n d = sq_cnt - n // 2\r\n n1 = min(cnt1, d)\r\n n2 = d - n1\r\n ans = n1 + n2 * 2\r\n print(ans)\r\nelse:\r\n oper = []\r\n for x in a:\r\n oper.append(need(x))\r\n oper.sort()\r\n ans = 0\r\n for i in range(n // 2):\r\n ans += oper[i]\r\n print(ans)", "n = int(input())\r\nfunc = lambda x: abs(int(x ** 0.5 + 0.5) ** 2 - x)\r\nl = list(map(lambda x: [func(int(x)), int(x)], input().split()))\r\nl.sort()\r\nans = sum(i[0] for i in l[:n//2]) + sum((i[0] == 0) + (i[1] == 0) for i in l[n//2:])\r\nprint(ans)# 1692302449.8946726", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\n\r\nd = []\r\nfor i in range(33000):\r\n d.append(i**2)\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nf = []\r\nc, g = 0, 0\r\nfor i in w:\r\n a = bisect(d, i)\r\n if d[a-1] == i:\r\n c += 1\r\n else:\r\n f.append(min(d[a]-i, i-d[a-1]))\r\n if i == 0:\r\n g += 1\r\new = 0\r\nif c >= n//2:\r\n x = c-n//2\r\n y = c-g\r\n if x >= y:\r\n ew = y+(x-y)*2\r\n else:\r\n ew = x\r\nelse:\r\n x = n//2 - c\r\n f.sort()\r\n ew = sum(f[:x])\r\nprint(ew)\r\n", "# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\n# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\n# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\nfrom sys import stdin, stdout\r\nfrom math import sqrt\r\nimport math\r\nimport heapq\r\nfrom itertools import accumulate\r\n\r\n\r\ndef near_sq(num):\r\n return round(sqrt(num))**2\r\n\r\nN = int(input())\r\n\r\n#s = input() \r\n#N,M,K = [int(x) for x in stdin.readline().split()]\r\n\r\narr = [int(x) for x in stdin.readline().split()]\r\n\r\nsqr = 0\r\nnon = 0\r\n\r\nsqr_mini = []\r\nnon_mini = []\r\nfor num in arr:\r\n p = near_sq(num)\r\n #print(p)\r\n \r\n if p-num==0:\r\n sqr += 1\r\n if num==0:\r\n sqr_mini.append(2)\r\n else:\r\n sqr_mini.append(1)\r\n else:\r\n non += 1\r\n non_mini.append(abs(p-num))\r\n \r\nif sqr==non:\r\n print(0)\r\n quit()\r\n \r\n# remove sqr\r\nres = 0\r\nhalf = N//2\r\nif sqr>non:\r\n required = sqr-half\r\n \r\n sqr_mini.sort()\r\n res = sum(sqr_mini[:required])\r\n# remove non_sqrt\r\nelif non>sqr:\r\n required = non-half\r\n non_mini.sort()\r\n res = sum(non_mini[:required])\r\n \r\nprint(res)\r\n \r\n \r\n\r\n\r\n \r\n ", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n from math import sqrt\r\n n = int(input())\r\n a = list(map(int ,input().split()))\r\n b = []\r\n ps = 0\r\n ans = 0\r\n for i in a:\r\n k = int(sqrt(i))\r\n m = min( i - k * k , (k + 1)*(k + 1) - i)\r\n if m == 0:\r\n ps += 1\r\n b.append(m)\r\n if ps > n // 2:\r\n b.clear()\r\n for i in a:\r\n k = int(sqrt(i))\r\n if k * k == i:\r\n b.append(i)\r\n b.sort(reverse = True)\r\n for i in b:\r\n if i == 0:\r\n ans += 2\r\n else:\r\n ans += 1\r\n ps -= 1\r\n if ps <= n // 2:\r\n break\r\n print(ans)\r\n return\r\n b.sort()\r\n for i in range(n // 2):\r\n ans += b[i]\r\n print(ans)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "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 def found_neighbors(x):\r\n l, r = 0, len(squares)\r\n while l <= r:\r\n m = (l + r) // 2\r\n if squares[m] == x:\r\n return [squares[m], squares[m + 1]]\r\n elif squares[m] > x:\r\n r = m - 1\r\n else:\r\n l = m + 1\r\n return [squares[r], squares[l]]\r\n\r\n squares = [i * i for i in range(40000)]\r\n\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n Square = []\r\n NSquare = []\r\n count_squares = 0\r\n\r\n for i in range(n):\r\n v, u = found_neighbors(a[i])\r\n if v == a[i]:\r\n if a[i] == 0:\r\n NSquare.append(2)\r\n else:\r\n NSquare.append(1)\r\n count_squares += 1\r\n else:\r\n Square.append(min(abs(a[i] - v), abs(a[i] - u)))\r\n\r\n res = 0\r\n if count_squares < n // 2:\r\n Square.sort()\r\n for i in range(n // 2 - count_squares):\r\n res += Square[i]\r\n else:\r\n NSquare.sort()\r\n for i in range(count_squares - n // 2):\r\n res += NSquare[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())\na=list(map(int,input().split()))\np_s,n_s=0,0\nz=[]\nz_s=[]\nfor i in range(n):\n if a[i]**(1/2)==int(a[i]**(1/2)):\n p_s+=1\n if a[i]==0:\n z_s.append(2)\n else:\n z_s.append(1)\n else:\n n_s+=1\n z.append(min((int(a[i]**(1/2))+1)**2-a[i],a[i]-(int(a[i]**(1/2)))**2))\nz.sort()\nz_s.sort()\nif p_s>n_s:\n print(sum(z_s[:(-p_s-+n_s)//2]))\nelse:\n print(sum(z[:(-p_s-+n_s)//2]))", "import math\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nsquares=0\r\nzeroes=0\r\nans=[]\r\nfor i in l:\r\n if i==0:\r\n zeroes+=1\r\n a=math.floor(i**(1/2))\r\n b=a+1\r\n a*=a\r\n b*=b\r\n if a==i or b==i:\r\n squares+=1\r\n else:\r\n ans.append(min(abs(i-a),abs(i-b)))\r\nif squares==(n//2):\r\n print(0)\r\nelif squares>(n//2):\r\n x=squares-(n//2)\r\n zeroes=max(0,zeroes-n//2)\r\n print(zeroes+x)\r\nelse:\r\n ans.sort()\r\n print(sum(ans[:n//2-squares]))", "import math\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\ndif = []\r\nans = 0\r\ncntsqrt = 0\r\ncntnon = 0\r\nzerocnt = 0\r\nfor i in range(n):\r\n x = arr[i]\r\n if arr[i] == 0: zerocnt += 1\r\n if x ** .5 == int(x**.5):\r\n dif.append(0)\r\n cntsqrt += 1\r\n else:\r\n upper = math.ceil(x**.5)\r\n lower = math.floor(x**.5)\r\n dif.append(min(upper**2 - x, x - lower**2))\r\n cntnon += 1\r\ndif.sort()\r\ni = 0\r\ncnt = cntsqrt - zerocnt\r\nif cntsqrt > cntnon:\r\n while cntsqrt > cntnon:\r\n if ans >= cnt: ans += 2\r\n else: ans += 1 \r\n cntsqrt -= 1\r\n cntnon += 1\r\nelse:\r\n for i in range(n//2):\r\n ans += dif[i]\r\nprint(ans)\r\n", "#OMM NAMH SHIVAY\r\n#JAI SHREE RAM\r\nimport sys,math,heapq,queue\r\nfast_input=sys.stdin.readline \r\nfrom functools import cmp_to_key\r\nn=int(fast_input()) \r\na=list(map(int,fast_input().split())) \r\ntemp=[]\r\nfor i in range(n):\r\n x=math.floor(math.sqrt(a[i]))\r\n y=x+1 \r\n t=0\r\n if x*x==a[i]:\r\n if a[i]<2:\r\n t=2-a[i]\r\n else:\r\n t=1\r\n temp.append([min(abs(a[i]-x*x),abs(a[i]-y*y)),t])\r\ndef compare(a,b):\r\n if a[0]<b[0]:\r\n return -1 \r\n elif a[0]==b[0] and a[1]>b[1]:\r\n return -1 \r\n else:\r\n return 1\r\ntemp.sort(key=cmp_to_key(compare))\r\ns=0\r\nfor i in range(n):\r\n if i*2<n:\r\n s+=temp[i][0]\r\n else:\r\n s+=temp[i][1]\r\nprint(s)\r\n", "import math\r\nn = int(input())\r\na, b = [], []\r\nfor x in map(int, input().split()):\r\n\ty = int(math.sqrt(x))\r\n\tmn = x - y * y\r\n\ty += 1\r\n\tmn = min(mn, (y * y - x))\r\n\ta.append(mn)\r\n\ty -= 1\r\n\tb.append((x == y * y) + (not x))\r\nfor i in range(n):\r\n\tb[i] -= a[i]\r\nprint(sum(a + sorted(b)[:n//2]))", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import *\r\nfrom bisect import *\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nl = []\r\n\r\nfor i in range(10**5):\r\n l.append(i*i)\r\n\r\ns = set(l)\r\ncost1 = []\r\ncost2 = []\r\n\r\nfor ai in a:\r\n if ai in s:\r\n if ai==0:\r\n cost1.append(2)\r\n else:\r\n cost1.append(1)\r\n else:\r\n idx = bisect_right(l, ai)\r\n cost2.append(min(ai-l[idx-1], l[idx]-ai))\r\n\r\ncost1.sort()\r\ncost2.sort()\r\n\r\nif len(cost1)>=len(cost2):\r\n print(sum(cost1[:len(cost1)-n//2]))\r\nelse:\r\n print(sum(cost2[:len(cost2)-n//2]))", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline().strip())\r\n\r\nai = [int(num) for num in sys.stdin.readline().strip().split()]\r\n\r\ndists = []\r\ntypes = []\r\nfor a in ai:\r\n rt = int(math.sqrt(a))\r\n if rt**2 == a:\r\n types.append(1)\r\n if rt==0:\r\n dists.append(2)\r\n else:\r\n dists.append(1)\r\n else:\r\n types.append(0)\r\n dist = min(a-rt**2, (rt+1)**2-a)\r\n dists.append(dist)\r\n\r\nn_sqrt = sum(types)\r\n\r\nif n_sqrt==n//2:\r\n print(0)\r\nelif n_sqrt>n//2:\r\n dists = sorted([dist for dist,typ in zip(dists,types) if typ==1])\r\n num = n_sqrt-n//2\r\n print(sum(dists[:num]))\r\nelse:\r\n dists = sorted([dist for dist,typ in zip(dists,types) if typ==0])\r\n num = n//2-n_sqrt\r\n print(sum(dists[:num]))\r\n", "\r\ndef sqr(x):\r\n a = round(x**0.5)\r\n return a*a == x\r\n\r\n\r\n\r\nN = int(input())\r\nn = list(map(int, input().split()))\r\nk = 0\r\nk2 = 0\r\nn.sort()\r\nans = 0\r\nfor i in range(N):\r\n if sqr(n[i]): \r\n k2 +=1\r\n else:\r\n k +=1\r\n\r\nif k2 > N//2:\r\n td=k2-N//2\r\n nz = k2-n.count(0)\r\n if nz >= td:\r\n ans += td\r\n \r\n else:\r\n ans += nz + (td-nz)*2\r\n \r\nelse:\r\n a=[]\r\n td = k-N//2\r\n for i in range(N):\r\n if not sqr(n[i]):\r\n a.append(n[i])\r\n for i in range(len(a)):\r\n t = int(a[i]**0.5)\r\n s1 = t*t\r\n s2 = (t+1)**2\r\n a[i] = min(a[i] - s1, s2 - a[i])\r\n a.sort()\r\n for i in range(td):\r\n ans += a[i]\r\nprint(ans)\r\n \r\n \r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ncnt1=0\r\ncnt2=0\r\nok=[]\r\nng=[]\r\nfor i in range(n):\r\n b=a[i]\r\n if int(b**0.5)**2==b:\r\n cnt1+=1\r\n if b==0:\r\n ok.append(2)\r\n else:\r\n ok.append(1)\r\n else:\r\n cnt2+=1\r\n c1=int(b**0.5)**2\r\n c2=(int(b**0.5)+1)**2\r\n ng.append(min(abs(b-c1),abs(b-c2)))\r\nok.sort()\r\nng.sort()\r\nif cnt1==cnt2:\r\n print(0)\r\nelif cnt1>cnt2:\r\n res=(cnt1-cnt2)//2\r\n print(sum(ok[:res]))\r\nelse:\r\n res=(cnt2-cnt1)//2\r\n print(sum(ng[:res]))", "import math\n\nn = int(input())\ndifs = []\nnums = [int(x) for x in input().split()]\nzeros = nums.count(0)\nfor num in nums:\n abaixo = math.floor(num**(1/2))**2\n acima = math.ceil(num**(1/2))**2\n difs.append(min(abs(abaixo-num), abs(acima-num)))\ndifs.sort()\nif difs.count(0) < n//2:\n out = 0\n quadrados = difs.count(0)\n for num in difs:\n if num > 0:\n out += num\n quadrados += 1\n if quadrados == n//2:\n break\n print(out)\nelse:\n quadrados = difs.count(0)\n naozeros = quadrados - zeros\n out = 0\n while quadrados > n//2:\n if naozeros > 0:\n out += 1\n naozeros -= 1\n else:\n out += 2\n quadrados -= 1\n print(out)\n\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\na, b = [], []\r\nfor i in l:\r\n c = int(i ** 0.5)\r\n if c * c == i:\r\n a.append(i)\r\n else:\r\n x = i - c * c\r\n y = (c + 1) * (c + 1) - i\r\n b.append(min(x, y))\r\na.sort()\r\nb.sort()\r\nb = b[::-1]\r\nans = 0\r\nif len(a) == len(b):\r\n pass\r\nelif len(a) > len(b):\r\n while len(a) != len(b):\r\n if a[-1] == 0:\r\n ans += 2\r\n else:\r\n ans += 1\r\n b.append(a.pop())\r\nelif len(a) < len(b):\r\n while len(a) != len(b):\r\n ans += b[-1]\r\n a.append(b.pop())\r\nprint(ans)", "from math import sqrt\r\n\r\nn = int(input())\r\ndta = [int(i) for i in input().split()]\r\ndtann = []\r\ndtank = []\r\n\r\nnk = 0\r\nnn = 0\r\n\r\nfor i in dta:\r\n r = sqrt(i)\r\n if r == int(r):\r\n nk += 1\r\n dtank.append(i)\r\n else:\r\n nn += 1\r\n dtann.append(i)\r\nif nk == nn:\r\n print(0)\r\nelif nk > nn:\r\n need = nk - n // 2\r\n dtank.sort(reverse=True)\r\n sm = 0\r\n for i in range(need):\r\n if dtank[i] == 0:\r\n sm += 2\r\n else:\r\n sm += 1\r\n print(sm)\r\nelif nn > nk:\r\n costs = []\r\n for i in dtann:\r\n v1 = abs(pow(int(sqrt(i)), 2) - i)\r\n v2 = abs(pow(int(sqrt(i) + 1), 2) - i)\r\n costs.append(min(v1, v2))\r\n costs.sort()\r\n need = n // 2 - nk\r\n print(sum(costs[:need]))", "d=lambda x:abs(int(x**0.5+0.5)**2-x)\r\nn=int(input())//2\r\na=sorted([[d(int(x)),int(x)]for x in input().split()])\r\nprint(sum(i[0]for i in a[:n])+sum((i[0]==0)+(i[1]==0)for i in a[n:]))", "import bisect\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 = list(map(int, input().split()))\r\nx = [i * i for i in range(4 * pow(10, 4))]\r\ns = set(x)\r\nu = []\r\nans = 0\r\nfor i in a:\r\n if i in s:\r\n u.append(1 + (min(1, i) ^ 1))\r\n else:\r\n j = bisect.bisect_left(x, i)\r\n v = min(x[j] - i, i - x[j - 1])\r\n ans += v\r\n u.append(-v)\r\nu.sort()\r\nm = n // 2\r\nfor i in u[:m]:\r\n ans += i\r\nprint(ans)", "import math\r\ndef closest(n):\r\n f = math.pow(math.floor(math.sqrt(n)), 2)\r\n c = math.pow(math.ceil(math.sqrt(n)), 2)\r\n return [int(f),int(c)]\r\nn = int(input())\r\npiles = [int(x) for x in input().split()]\r\nsquares = []\r\nnotsquares = []\r\nfor p in range(len(piles)):\r\n if piles[p] == 0:\r\n f,c = [0,1]\r\n else:\r\n f,c = closest(piles[p])\r\n if piles[p] in [f,c]:\r\n squares.append(piles[p])\r\n else:\r\n notsquares.append(min(abs(piles[p]) - f, abs(piles[p] - c)))\r\nprice = 0\r\ndif =len(squares) - n//2\r\nif dif == 0:\r\n print(0)\r\n exit()\r\nif dif < 0:\r\n count = -dif\r\n notsquares.sort()\r\n price += sum(notsquares[:count])\r\nif dif > 0:\r\n np = sorted(squares, reverse=True)\r\n for i in range(dif):\r\n if np[i] == 0:\r\n price +=2\r\n else:\r\n price +=1\r\nprint(price)\r\n \r\n \r\n \r\n \r\n \r\n\r\n", "import sys\r\nimport collections\r\nimport heapq\r\nimport math\r\n\r\nR = lambda: sys.stdin.readline().rstrip()\r\nMIS = lambda: map(int, R().split())\r\n\r\nN = int(R())\r\nL = list(MIS())\r\nz = 0\r\na1 = 0\r\na2 = 0\r\nu = []\r\n\r\nfor i in L:\r\n l = 0\r\n r = 1000000000\r\n ll = 0\r\n rr = 0\r\n if i == 0:\r\n z += 1\r\n a = -1\r\n while l <= r:\r\n mid = (l+r)//2\r\n if mid*mid > i:\r\n r = mid-1\r\n rr = mid\r\n elif mid*mid < i:\r\n ll = mid\r\n l = mid+1\r\n else:\r\n a = mid\r\n break\r\n\r\n if a != -1:\r\n a1 += 1\r\n else:\r\n a2 += 1\r\n u.append(min(i-ll*ll, rr*rr-i))\r\nans = 0\r\n\r\nif a1 == a2:\r\n print(ans)\r\nelif a1 > a2:\r\n t = (a1-a2)//2\r\n kk = a1-z\r\n if t > kk:\r\n print(2*t-kk)\r\n else:\r\n print(t)\r\nelse:\r\n u.sort()\r\n t = (a2 - a1) // 2\r\n print(sum(u[:t]))\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\nimport os\r\nfrom math import*\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nsq_count=0\r\nmove=[]\r\nzero=0\r\nfor i in range(n):\r\n\tif arr[i]==0:\r\n\t\tzero+=1\r\n\tc=sqrt(arr[i])\r\n\tif int(c)*int(c)==arr[i]:\r\n\t\tsq_count+=1\r\n\telse:\r\n\t\tc=round(c)\r\n\t\tmove.append(int(fabs(c*c-arr[i])))\r\nnotsq=n-sq_count\r\n#print(sq_count,notsq)\r\nif sq_count==notsq:\r\n\tprint(\"0\")\r\nelif sq_count>notsq:\r\n\trest=(n//2)-notsq\r\n\tif zero<=n//2:\r\n\t\tprint(rest)\r\n\telse:\r\n\t\tcon=zero-(n//2)\r\n\t\tprint(con*2+(rest-con))\r\nelse:\r\n\tcon=(n//2)-sq_count\r\n\tmove.sort()\r\n#\tprint(con)\r\n\tprint(sum(move[0:con]))\r\n\r\n", "from collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\ndef ceil(a, b):\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\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 a=list(map(int, input().split()))\r\n sq=[0]*n\r\n ct=[]\r\n for i in range(n):\r\n g=int(sqrt(a[i]))\r\n if((g-1)*(g-1)==a[i] or (g)*(g)==a[i] or (g+1)*(g+1)==a[i]):\r\n sq[i]=10**18\r\n ct.append(a[i])\r\n else:\r\n x=(g-1)*(g-1)\r\n y=g*g\r\n z=(g+1)*(g+1)\r\n if(abs(x-a[i])==min(abs(x-a[i]),abs(y-a[i]),abs(z-a[i])) and a[i]>=x):\r\n sq[i]=abs(x-a[i])\r\n elif(abs(z-a[i])==min(abs(x-a[i]),abs(y-a[i]),abs(z-a[i]))):\r\n sq[i]=abs(z-a[i])\r\n else:\r\n sq[i]=abs(y-a[i])\r\n if(len(ct)>=n//2):\r\n ct.sort()\r\n ans=0\r\n while(len(ct)!=n//2):\r\n if(ct.pop()==0):\r\n ans+=2\r\n else:\r\n ans+=1\r\n print(ans)\r\n exit()\r\n else:\r\n sq.sort()\r\n ans=0\r\n f=0\r\n ct=len(ct)\r\n while(ct!=n//2):\r\n ans+=sq[f]\r\n ct+=1\r\n f+=1\r\n print(ans)\r\n exit()\r\n \r\n \r\nmain()", "import math\r\ndef get_min(n):\r\n root=math.sqrt(n)\r\n roott=abs(root - int(root))\r\n if roott >= 0.5 :\r\n square=math.ceil(root)\r\n else:\r\n square=math.floor(root)\r\n return square**2\r\nn=int(input())\r\nsquare=[]\r\nnotsquare=[]\r\npiles=[int (x) for x in input().split()]\r\nfor p in piles:\r\n m=get_min(p)\r\n if p == get_min(p):\r\n square+=[p]\r\n # square.append(p)\r\n else:\r\n notsquare+=[abs(p-m)]\r\ndif=n//2-len(square)\r\nprice=0\r\nif dif > 0:\r\n notsquare.sort()\r\n price+=sum(notsquare[:dif])\r\nif dif < 0:\r\n dif= -dif\r\n lst=sorted(square, reverse=True)\r\n for d in range(dif):\r\n if lst[d] == 0:\r\n price+=2\r\n else:\r\n price+=1\r\nprint(price)\r\n \r\n", "sqrs =[-1] + [i*i for i in range(31625)]\nimport sys\ninput = sys.stdin.readline\nfrom bisect import bisect_left\nn = int(input())\nna, nb, A, B = 0, 0, list(), list()\nfor v in map(int, input().split()):\n i = bisect_left(sqrs, v)\n dist = min(v-sqrs[i-1], sqrs[i]-v)\n if dist == 0:\n na += 1\n dist = (2 if v==0 else 1)\n A.append(dist)\n else:\n nb += 1\n B.append(dist)\nans = 0\nif na > nb:\n A.sort()\n ans = sum(A[:(na-nb)//2])\nelif nb > na:\n B.sort()\n ans = sum(B[:(nb-na)//2])\nprint(ans)\n \t \t \t \t\t \t\t\t\t \t \t\t \t\t \t", "\r\nimport sys\r\nfrom sys import stdin\r\nimport bisect\r\n\r\nsquare = [i**2 for i in range(10**5)]\r\n\r\nn = int(stdin.readline())\r\n\r\na = list(map(int,stdin.readline().split()))\r\n\r\nsq = []\r\nnsq = []\r\n\r\nfor i in a:\r\n\r\n idx = bisect.bisect_right(square , i)\r\n \r\n if square[idx-1] == i:\r\n if i == 0:\r\n sq.append(2)\r\n else:\r\n sq.append(1)\r\n else:\r\n\r\n rdiff = abs(square[idx] - i)\r\n ldiff = abs(square[idx-1] - i)\r\n nsq.append(min(rdiff,ldiff))\r\n\r\nnsq.sort()\r\nsq.sort()\r\n\r\nif len(sq) >= n//2:\r\n ans = 0\r\n change = len(sq) - n//2\r\n for i in range(change):\r\n ans += sq[i]\r\n print (ans)\r\n \r\nelse:\r\n\r\n ans = 0\r\n change = len(nsq) - n//2\r\n for i in range(change):\r\n\r\n ans += nsq[i]\r\n\r\n print (ans)\r\n \r\n \r\n \r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A):\r\n n = len(A)\r\n scores = []\r\n for i in range(n):\r\n x = A[i]\r\n X2 = int(x**0.5)\r\n for y2 in range(X2-2, X2+2):\r\n if y2**2 <= x < (y2+1)**2:\r\n x2 = y2\r\n break\r\n if x2*x2==x:\r\n score1 = 0\r\n if x==0:\r\n score2 = 2\r\n else:\r\n score2 = 1\r\n else:\r\n score2 = 0\r\n sq1 = x2**2\r\n sq2 = (x2+1)**2\r\n score1 = min(abs(x-sq1), abs(x-sq2))\r\n scores.append([score1, score2])\r\n scores = sorted(scores, key=lambda a: a[0]-a[1])\r\n A = sum([x[0] for x in scores])\r\n B = sum([x[1] for x in scores])\r\n answer = 0\r\n for s1, s2 in scores[:n//2]:\r\n answer+=s1\r\n B-=s2\r\n return answer+B\r\n #you need to minimize sum over A score1 + sum over B score2\r\n #or uh, sum over A (score1-score2) + sum over everything score2\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nanswer = process(A)\r\nprint(answer)", "arr=[]\nfor i in range(10**5+1):\n arr.append(i*i)\ndef find(k):\n l=0\n r=len(arr)-1\n while l<=r:\n m=(r-l)//2 + l\n if arr[m]==k:\n return 0\n if arr[m]>k:\n r=m-1 \n else:\n l=m+1 \n return min(k-arr[r],arr[l]-k)\nn=int(input())\nl=[int(x) for x in input().split()]\nl1=[]\nfor x in l:\n l1.append([find(x),x])\nl1.sort()\ns1=0\ns2=0\n#print(l1)\nfor i in range(n//2):\n s1+=l1[i][0]\nfor i in range(n//2,n):\n if l1[i][0]==0:\n if l1[i][1]==0:\n s2+=2 \n else:\n s2+=1 \nprint(s1+s2)\n \n \n\n\t \t \t \t\t\t \t \t\t \t \t \t \t\t", "from math import*\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n b.append([min(abs(a[i]-ceil(sqrt(a[i])-0.001)**2),abs(a[i]-floor(sqrt(a[i])+0.001)**2)),a[i]])\r\nb.sort()\r\ns=0\r\nfor i in range(n//2):\r\n s+=b[i][0]\r\nfor i in range(n//2,n):\r\n if b[i][0]==0:\r\n s+=1\r\n if b[i][1]==0:\r\n s+=1\r\nprint(s)", "from math import *\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\n\r\na, b = [], []\r\nfor x in A:\r\n if sqrt(x) == int(sqrt(x)): a.append(x)\r\n else: b.append(x)\r\n \r\nif len(a) >= len(b):\r\n c = []\r\n for x in a:\r\n c.append(1+(x == 0))\r\n print(sum(sorted(c)[:len(a)-n//2]))\r\nelse:\r\n c = []\r\n for x in b:\r\n l, r = floor(sqrt(x))**2, ceil(sqrt(x))**2\r\n cost = min(abs(x-l), abs(r-x))\r\n c.append(cost)\r\n print(sum(sorted(c)[:n//2-len(a)]))", "from sys import stdin\r\n\r\ninput = lambda: stdin.readline()[:-1]\r\n\r\nimport math\r\ndef check(n):\r\n s = int(math.sqrt(n))\r\n return (s * s == n) or ((s - 1) * (s - 1) == n) or ((s + 1) * (s + 1) == n)\r\ndef getsqr(n):\r\n s = int(math.sqrt(n))\r\n return min(abs(s * s - n), abs((s - 1) * (s - 1) - n), abs((s + 1) * (s + 1) - n))\r\ndef getnotsqr(n):\r\n if check(n):\r\n if n == 0:\r\n return 2\r\n return 1\r\n return 0\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\ns = [i for i in lst if check(i)]\r\nd = [j for j in lst if not check(j)]\r\nif (len(d) > len(s)):\r\n k = [getsqr(i) for i in d]\r\n k.sort()\r\n print(sum(k[:(len(d)-len(s))//2]))\r\nelse:\r\n k = [getnotsqr(i) for i in s]\r\n k.sort()\r\n print(sum(k[:(len(s) - len(d)) // 2]))", "from math import sqrt,floor, ceil\r\ndef isSquare(n):\r\n x = sqrt(n)\r\n if(x % 1 == 0):\r\n return True\r\n else:\r\n return False\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nIs = 0\r\nTake = []\r\nSquare = []\r\nfor i in arr:\r\n if(isSquare(i)):\r\n Square.append(i)\r\n Is += 1\r\n else:\r\n niche = floor(sqrt(i))\r\n upar = ceil(sqrt(i))\r\n Take.append(min(abs(i - niche**2), abs(upar**2 - i)))\r\nif(Is >= n/2):\r\n Square.sort(reverse = True)\r\n ans = 0\r\n for i in range(Is - (n>>1)):\r\n if(Square[i]):\r\n ans += 1\r\n else:\r\n ans += 2\r\n print(ans)\r\nelse:\r\n Take.sort()\r\n ans = 0\r\n for i in range((n>>1) - Is):\r\n ans += Take[i]\r\n print(ans)" ]

[ "n = int(input())\r\nif n>36:\r\n print(-1)\r\nelse:\r\n ans = []\r\n i = 0\r\n while n >= 2:\r\n ans.append(\"8\") \r\n n -= 2\r\n if n == 1:\r\n ans.append(\"4\")\r\n n -= 1\r\n x = \"\".join(ans) \r\n print(int(x)) ", "k=int(input())\nif k==1:\n print(6)\nelse:\n x=(k//2)\n y=k%2\n ans=\"\"\n if x+y>18:\n print(-1)\n else:\n for i in range(x):\n ans+=\"8\"\n for i in range(y):\n ans+=\"0\"\n if int(ans)>1e18:\n print(-1)\n else:\n print(ans)\n \n", "k=int(input())\r\nif k>=37:\r\n print(-1)\r\nelse:\r\n print(\"8\"*(k//2) + \"4\"*(k%2))", "n=int(input())\r\n\r\nif n>36:\r\n print(-1)\r\n \r\nelse:\r\n list=[]\r\n while n>0:\r\n if n>=2:\r\n list.append('8')\r\n n-=2\r\n elif n>=1:\r\n list.append('4')\r\n n-=1\r\n elif n==1:\r\n list.append('0')\r\n n-=1\r\n s=''.join(list)\r\n print(s)\r\n \r\n ", "n = int(input())\r\n\r\n\r\ns = n // 2 * '8' + n % 2 * '4'\r\n\r\n\r\nif len(s) > 18:\r\n\tprint(-1)\r\nelse:\r\n\tprint(s)", "n=int(input())\r\nif n>36:\r\n print(-1)\r\nelse:\r\n print(\"8\"*(n//2)+\"9\"*(n%2))", "k=int(input())\r\nif k>36:\r\n print(-1)\r\nelse:\r\n while k>0:\r\n if k>=2:\r\n print(8,end='')\r\n k-=2\r\n else:\r\n print(9,end='')\r\n k-=1\r\n ", "n = int(input())\r\n\r\nnum = ''\r\nif n >= 37:\r\n print(-1)\r\nelse :\r\n if n % 2 == 0:\r\n num += '8'*(n//2)\r\n print(num)\r\n else:\r\n num += '4'\r\n num += '8' * (n // 2)\r\n print(num)\r\n", "#This is the solution from Charlieyan. No matter it is AC or not.\r\n#Coded in Microsoft Visual Studio by Charlieyan\r\nn=int(input())\r\nprint([-1,int(n/2)*'8'+(n%2)*'4'][n<=36])", "def main():\n n = int(input())\n print('4' * (n & 1) + '8' * (n // 2) if n < 37 else '-1')\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nif n>36:\r\n print(-1)\r\nelse:\r\n s=''\r\n for j in range(n//2):\r\n s=s+'8'\r\n if n%2!=0:\r\n s=s+'4'\r\n print(s)", "k = int(input())\r\nif (k > 36):\r\n print(-1)\r\nelse:\r\n res = '8' * (k // 2)\r\n if (k % 2 != 0):\r\n res = res + '9'\r\n print(res)", "n = int(input())\r\nif n == 1:\r\n print(\"9\")\r\nelif n == 2:\r\n print(\"99\")\r\nelif n == 3:\r\n print(\"999\")\r\nelif n == 4:\r\n print(\"9999\")\r\nelif n == 5:\r\n print(\"99999\")\r\nelif n == 6:\r\n print(\"999999\")\r\nelif n == 7:\r\n print(\"8880\")\r\nelif n == 8:\r\n print(\"8888\")\r\nelif n == 9:\r\n print(\"88880\")\r\nelif n == 10:\r\n print(\"88888\")\r\nelif n == 11:\r\n print(\"888880\")\r\nelif n == 12:\r\n print(\"888888\")\r\nelif n == 13:\r\n print(\"8888880\")\r\nelif n == 14:\r\n print(\"8888888\")\r\nelif n == 15:\r\n print(\"88888880\")\r\nelif n == 16:\r\n print(\"88888888\")\r\nelif n == 17:\r\n print(\"888888880\")\r\nelif n == 18:\r\n print(\"888888888\")\r\nelif n == 19:\r\n print(\"8888888880\")\r\nelif n == 20:\r\n print(\"8888888888\")\r\nelif n == 21:\r\n print(\"88888888880\")\r\nelif n == 22:\r\n print(\"88888888888\")\r\nelif n == 23:\r\n print(\"888888888880\")\r\nelif n == 24:\r\n print(\"888888888888\")\r\nelif n == 25:\r\n print(\"8888888888880\")\r\nelif n == 26:\r\n print(\"8888888888888\")\r\nelif n == 27:\r\n print(\"88888888888880\")\r\nelif n == 28:\r\n print(\"88888888888888\")\r\nelif n == 29:\r\n print(\"888888888888880\")\r\nelif n == 30:\r\n print(\"888888888888888\")\r\nelif n == 31:\r\n print(\"8888888888888880\")\r\nelif n == 32:\r\n print(\"8888888888888888\")\r\nelif n == 33:\r\n print(\"88888888888888880\")\r\nelif n == 34:\r\n print(\"88888888888888888\")\r\nelif n == 35:\r\n print(\"888888888888888880\")\r\nelif n == 36:\r\n print(\"888888888888888888\")\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\nif n > 36: print(-1)\r\nelif n > 1: print('8' * (n // 2) if not n % 2 else '8' * (n // 2) + '0')\r\nelse: print(6)\r\n", "\r\nk=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\nif k>36:\r\n print(\"-1\")\r\n quit()\r\n\r\nif(k%2==1):\r\n print(\"4\",end=\"\")\r\n\r\nfor i in range(1,k//2+1):\r\n print(\"8\", end=\"\")", "a = int(input())\r\nl = list()\r\n\r\nif a<=36:\r\n \r\n for x in range(a//2):\r\n l.append(\"8\")\r\n for x in range(a%2): \r\n l.append(\"4\")\r\n print(\"\".join(l))\r\n \r\n \r\nelse:\r\n print(\"-1\")", "n = int(input())\nif n > 36:\n\tprint (-1)\nelif n == 1:\n\tprint (6)\nelse:\n\tprint ('8' * (n // 2) + '0' * (n % 2))", "n = int(input())\n\nif n > 36:\n print(-1)\nelse:\n s = ''\n for i in range(n // 2):\n s += '8'\n if n % 2 == 1:\n s += '4'\n print(s)\n", "k = int(input())\r\nif k>36:print(-1)\r\nelse:\r\n s = '8' * (k//2)\r\n if k%2==1:\r\n s+='4'\r\n print(s)", "k = int(input())\r\nif k > 36:\r\n\tprint(-1)\r\nelse:\r\n\toutput = ''\r\n\tfor i in range(k // 2):\r\n\t\toutput += '8'\r\n\tif k % 2 == 1:\r\n\t\toutput += '4'\r\n\tprint(output)", "a=int(input())\nif a>36:\n print(int(-1))\nelse:\n b=[]\n while a!=0:\n if a%2==0:\n b.append(\"8\")\n a-=2\n elif a%2==1:\n b.append(\"6\")\n a-=1\n print(\"\".join(b))", "a=int(input())\r\nprint(-1 if a>36 else (('8'*(a//2))+('6'*(a%2))))", "p=int(input());print(['8'*(p//2)+'9'*(p%2),-1][p>36])\r\n\r\n", "n=int(input())\r\nif(n>36):\r\n print(-1)\r\nelse:\r\n print(*['8'*(n//2)+'9'*(n%2)])", "k=int(input())\r\nprint(-1 if k>36 else '8'*(k//2)+('9' if k%2==1 else ''))", "k=int(input())\r\nif k==1:\r\n print(4)\r\nelse:\r\n if k>36:\r\n print(-1)\r\n else:\r\n x=k//2\r\n y=k%2\r\n print(int(\"8\"*x+\"0\"*y))\r\n", "n = int(input())\r\nif n == 0:\r\n\tprint(\"1\")\r\n\r\nelse:\r\n\r\n\tif ((n//2) +n%2) < 19:\r\n\t\tprint(\"8\"*(n//2) + \"4\"*(n%2))\r\n\telse:\r\n\t\tprint(-1)\t\t", "k = int(input())\r\nm = k//2 + k%2\r\nres=\"\"\r\nif m>18:\r\n print(-1)\r\nelse:\r\n for i in range(k//2):\r\n res+=\"8\"\r\n if k%2==1:\r\n res+=\"4\"\r\n print(res)\r\n", "from math import ceil\r\nn=int(input())\r\nif(n>36):\r\n print(-1)\r\nelse:\r\n print(\"8\"*(n//2),end=\"\")\r\n if(n%2==1):\r\n print(\"4\")", "n = int(input())\r\nif n <= 36:\r\n if n % 2 == 0:\r\n print(n//2 * '8')\r\n else:\r\n print(n//2 * '8' + '4')\r\nelse:\r\n print(-1)", "# Imports\r\n\r\n\r\n##############################################\r\n# Input\r\n# hint: for standard i/o use input() and print()\r\n# examples:\r\n# a, b = map(lambda x: int(x), input().split())\r\n# print(res)\r\n# hint2: for file i/o use input.txt and output.txt\r\n# examples:\r\n# fin = open('input.txt', 'r')\r\n# line = fin.readline()\r\n# a, b = map(lambda x: int(x), line.split())\r\n#\r\n# fout = open('output.txt', 'w')\r\n# fout.write(str(result))\r\n# fout.close()\r\n\r\n\r\nk = int(input())\r\n\r\n\r\n\r\n##############################################\r\n# Main code\r\n\r\nif k > 18*2:\r\n print(-1)\r\nelse:\r\n res = ''\r\n res += '8' * (k//2)\r\n if k%2:\r\n res += '9'\r\n print(res)\r\n\r\n# FUCK\r\n\r\n\r\n\r\n\r\n", "a = int(input())\r\n\r\nif a>36:\r\n print(-1)\r\nelse:\r\n s = \"\"\r\n b = 1;\r\n c = a//2\r\n while b<=c:\r\n s+='8';\r\n b = b+1\r\n if a%2==1:\r\n s+='9'\r\n print(s)\r\n", "def solve(n):\r\n if(n==1):\r\n return '4'\r\n elif(n==2):\r\n return '8'\r\n else:\r\n return '8' + solve(n-2)\r\nn = int(input())\r\nif(n>36):\r\n print(-1)\r\nelse:\r\n print(solve(n))\r\n", "k=int(input())\r\nif(k>36):\r\n\tprint(-1)\r\nelse:\r\n\tz=k//2\r\n\tif(k&1):\r\n\t\tprint('8'*z+'6')\r\n\telse:\r\n\t\tprint('8'*z)", "def CF934B():\r\n k = int(input(\"\"))\r\n if (k > 36):\r\n print(-1)\r\n else:\r\n while k >= 2:\r\n print(8,end=\"\")\r\n k -= 2\r\n if (k == 1):\r\n print(\"4\")\r\n\r\nCF934B()\r\n", "pet = [1, 0, 0, 0, 1, 0, 1, 0, 2, 1]\n\nn = 0\nk = int(input())\nwhile k >= 2:\n n = n * 10 + 8\n if n > 1e18:\n break\n k -= 2\nif k == 1:\n n = n * 10 + 9\nif n > 1e18:\n print(-1)\nelse:\n print(n)", "k=input()\r\nk=int(k)\r\nif k>36 :\r\n\tprint(\"-1\",end='')\r\nelse :\r\n\twhile k>0 :\r\n\t\tif k>1 :\r\n\t\t\tprint(\"8\",end='')\r\n\t\t\tk=k-2\r\n\t\telse :\r\n\t\t\tprint(\"4\",end='')\r\n\t\t\tk=k-1\r\n", "# n, m = map(int, input().split())\r\n\r\nk = int(input())\r\nx = k // 2 * '8'\r\nif k % 2 == 1:\r\n x += '9'\r\n\r\nif len(x) > 18:\r\n x = -1\r\n\r\nprint(x)\r\n", "def big(n):\r\n s = ''\r\n if n == 1:\r\n return 6\r\n if n > 36:\r\n return -1\r\n while n > 1:\r\n s += '8'\r\n n -= 2\r\n if n == 1:\r\n s += '0'\r\n return s\r\n\r\n\r\nprint(big(int(input())))\r\n", "k = int(input())\r\nif k>36:\r\n\tprint(-1)\r\nelif k%2==0:\r\n\tprint((k//2)*'8')\r\nelse:\r\n\tprint(((k//2)*'8')+'6')", "k=int(input())\nif(k>36):\n print(-1)\n exit(0)\nelif(k==0):\n print(2)\n exit(0)\nelif(k==1):\n print(6)\n exit(0)\nelse:\n for i in range(k//2):\n print(8,end='')\n if(k%2):\n print(4)\n\t\t \t \t \t\t\t\t\t \t\t \t \t \t", "k=int(input())\r\n\r\nif k>36:\r\n print(-1)\r\n \r\nelse:\r\n if k==0:\r\n print(1)\r\n elif k%2==0:\r\n print('8'*(k//2))\r\n else:\r\n print('8'*(k//2)+'6')", "k=int(input())\r\nif k>36:\r\n print(-1)\r\nelse:\r\n print((k//2)*'8' + (k%2)*'6')", "k = int(input())\r\nif k>36:\r\n print(-1)\r\nelse:\r\n if(k<=18):\r\n print('1'+'0'*k)\r\n else:\r\n print('8'*(k-18)+'0'*(36-k))", "k = int(input())\r\nif (k > 36):\r\n print(-1)\r\nelse:\r\n res = 0\r\n while k > 0:\r\n if k >= 2:\r\n res = res * 10 + 8\r\n k -= 2\r\n else:\r\n res = res * 10 + 6\r\n k -= 1\r\n print(res)", "n=int(input())\r\ns=\"\"\r\nflh=0\r\nsz=0\r\nif(n==1000000):\r\n print(-1)\r\n flh=1\r\nif(n%2==0):\r\n m=n//2\r\n for i in range(m):\r\n s+='8'\r\n sz+=1\r\nelse:\r\n m=n//2\r\n for i in range(m):\r\n s+='8'\r\n sz+=1\r\n s+='6'\r\n sz+=1\r\nif(flh==0 and sz<=18):\r\n print(s)\r\nif(flh==0 and sz>18):\r\n print(-1)", "n = int(input())\r\ns = ('4' if n % 2 else '') + '8' * (n // 2)\r\nif len(s) >= 20 or int(s) > 10 ** 18:\r\n print(-1)\r\nelse:\r\n print(s)", "s=int(input())\r\nstring=\"8\"*int(s//2)\r\nif s>36:\r\n print(-1)\r\n exit()\r\nif s%2==0:\r\n pass\r\nelse:\r\n string=(string+\"6\")\r\nprint(string)", "k=int(input())\r\ns=0\r\nif k%2==1:\r\n s=4\r\n k-=1\r\nwhile(k>0):\r\n k-=2\r\n s=s*10+8\r\n if(s>1000000000000000000):\r\n s=-1\r\n k=0\r\nprint(s)", "n = int(input())\r\nif n > 36:\r\n print(-1)\r\nelif n % 2 == 0:\r\n for i in range(int(n / 2)):\r\n print(8, end='')\r\nelif n % 2 == 1:\r\n for i in range(int((n - 1)/ 2)):\r\n print(8, end='')\r\n print(4) \r\n", "p=int(input());print('8'*(p//2)+'9'*(p%2) if p<=36 else -1)\r\n\r\n", "from sys import exit\r\nk = int(input())\r\ninf = 10 ** 18\r\nif k == 1:\r\n print(4)\r\n exit(0)\r\nv = 8\r\nk -= 2\r\nwhile k > 1:\r\n v *= 10\r\n v += 8\r\n k -= 2\r\n if v > inf:\r\n break\r\nif k:\r\n v *= 10\r\nprint(v if v <= inf else -1)\r\n\r\n \r\n", "from sys import stdin\n\nf = stdin\n#f = open(\"be.txt\")\ntext = f.read().splitlines()\n\nk = int(text[0])\nmynum = 0\n# offset = 1\nwhile k>0:\n mynum*=10\n if k>=2:\n mynum+=8\n k-=2\n else:\n mynum+=4\n k-=1\n if mynum >= 10**18:\n # ptiny(-1)\n mynum = -1\n break\n\nprint(mynum)\n\t \t \t\t \t\t\t \t\t\t \t \t \t \t \t\t", "k = int(input())\r\n\r\nif k > 36:\r\n print(-1)\r\n exit()\r\n\r\nres = \"\"\r\n\r\nres = res + \"8\"*(k//2)\r\n\r\nres = res + \"9\"*(k%2)\r\n\r\nprint(res)\r\n\r\n", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n\r\n n = int(input())\r\n\r\n if n > 36:\r\n print(-1)\r\n else:\r\n print('8' * (n // 2), end='')\r\n\r\n if n%2 == 1:\r\n print('4')\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "k=int(input());\r\nif k > 36:\r\n print(-1)\r\nelse:\r\n print(\"8\"*int(k / 2) + \"9\"*(k % 2))", "n = int(input())\r\nif n > 40 : print(-1)\r\nelse:\r\n x = '4' * (n%2) + '8' * (n // 2)\r\n if int(x) < 10**18: print(x)\r\n else : print(-1)\r\n\r\n", "k = int(input())\nif k > 36:\n print(-1)\nelif k == 1:\n print(4)\nelif k % 2 == 0:\n s = \"8\" * (k // 2)\n if len(s) > 10**18:\n print(-1)\n else:\n print(\"8\" * (k // 2))\nelse:\n s = \"8\" * (k // 2) + \"4\"\n if len(s) > 10**18:\n print(-1)\n else:\n print(\"8\" * (k // 2) + \"4\")\n", "n = int(input().strip())\r\nres = list()\r\nwhile n > 0:\r\n if n >= 2:\r\n res.append(8)\r\n n -= 2\r\n elif n == 1:\r\n res.append(6)\r\n n -= 1\r\nif len(res) > 18:\r\n print('-1')\r\nelse:\r\n print(''.join(map(str, res)))\r\n", "k=int(input())\r\nif k>36:\r\n print(-1)\r\nelse:\r\n print('8'*(k//2)+'9'*(k%2))\r\n", "import sys\r\nimport math\r\nfrom collections import OrderedDict\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn=iinput()\r\nif n<=36:print(int('8'*int(n/2)+'4'*(n%2)))\r\nelse:print(-1)", "def test_4():\n k = list(map(int, input().split(\" \")))\n k = k[0]\n if k>36:\n print(\"-1\", end=\"\")\n else:\n num1 = int(k / 2)\n num2 = int(k - num1 * 2)\n for i in range(num1):\n print(\"8\", end=\"\")\n for i in range(num2):\n print(\"4\", end=\"\")\n\n return 0\n\n\n# aa = test_4(x)\naa = test_4()\n\t \t \t\t\t \t\t \t\t \t\t\t\t\t \t \t\t", "n = int(input())\r\nif n==0:\r\n print('1')\r\nelif n>36:\r\n print(-1)\r\nelse:\r\n ans = '8'*(n//2)\r\n if n%2==1:\r\n ans += '9'\r\n print(ans)", "n=(int)(input())\r\nl=list()\r\nif(n>36):\r\n print(-1)\r\nelse:\r\n for i in range(n//2):\r\n l.append(8)\r\n if(n%2==1):\r\n l.append(4)\r\n print(*l,sep='')", "import sys\r\nk = int(sys.stdin.readline())\r\nif k > 36:\r\n print('-1')\r\nelse:\r\n while k > 1:\r\n print('8', end = '')\r\n k -= 2\r\n if k != 0:\r\n print('9');\r\n \r\n", "import sys\r\nfrom math import sqrt,ceil,floor,gcd\r\nfrom collections import Counter\r\n\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef int_arr(): return list(map(int,input().split()))\r\ndef str_arr(): return list(map(str,input().split()))\r\ndef get_str(): return map(str,input().split())\r\ndef get_int(): return map(int,input().split())\r\ndef get_flo(): return map(float,input().split())\r\ndef lcm(a,b): return (a*b) // gcd(a,b)\r\n\r\nmod = 1000000007\r\n\r\ndef solve(n):\r\n if n > 36:\r\n print(-1)\r\n else:\r\n s = \"\"\r\n while n > 0:\r\n if n > 1:\r\n s += \"8\"\r\n n -= 2\r\n else:\r\n s += \"4\" \r\n n -= 1\r\n print(s)\r\n\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\nsolve(n)", "import sys\n\ndef printf(format, *args):\n sys.stdout.write(format % args)\n\nk = int(input())\nif k > 36: print(\"-1\")\nelse:\n while k:\n if k>=2:\n printf(\"%d\",8)\n k -= 2 \n elif k==1:\n printf(\"%d\",6)\n k = 0\n", "k = int(input())\r\nif k <= 40:\r\n li = []\r\n while k >= 2:\r\n li.append(8)\r\n k -= 2\r\n while k >= 1:\r\n li.append(9)\r\n k -= 1\r\n z = int(\"\".join([str(i) for i in li]))\r\n if z > 10 ** 18:\r\n print(-1)\r\n else:\r\n print(z)\r\nelse:\r\n print(-1)\r\n", "k=int(input())\r\ns=\"\"\r\nif k>36:\r\n print(-1)\r\nelse:\r\n while k>0:\r\n if k>=2:\r\n s=s+\"8\"\r\n k=k-2\r\n else:\r\n s=s+\"4\"\r\n k=k-1\r\n print(s)", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn=iinput()\r\nif n>36:\r\n print(-1)\r\nelse:\r\n print(\"8\"*(n//2)+\"4\"*(n%2))", "\"\"\"Codeforces P934B. A Prosperous Lot\r\n (http://codeforces.com/problemset/problem/934/B)\r\n\r\nProblem tags: implementation\r\n\r\nHint: 0 is not valid answer. Print '4', '6' or '9' if k is 1.\r\nTime Complexity: O(1)\r\n\"\"\"\r\n\r\ndef main():\r\n k = int(input())\r\n \r\n if (k > 36):\r\n n = '-1'\r\n else:\r\n n = '8' * (k // 2) + '4' * (k % 2)\r\n print(n)\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "k=int(input())\r\ndef loop(k):\r\n\tif k>36:\r\n\t\treturn -1\r\n\ta=k//2\r\n\tb=k%2\r\n\ts='8'*a\r\n\ts+='4'*b\r\n\treturn int(s)\r\nprint(loop(k))\r\n", "n = int(input())\r\n\r\nif n>36:\r\n print(-1)\r\nelse:\r\n\twhile n>0:\r\n\t if n>=2:\r\n\t print(8, end='')\r\n\t n-=2\r\n\t else:\r\n\t print(9, end='')\r\n\t n-=1\r\n", "k = int(input())\r\n\r\nif k > 50:\r\n print(-1)\r\n exit(0)\r\n \r\nx = '4'*(k%2)+'8'*(k//2)\r\n\r\nif int(x) <= int(1e18):\r\n print(x)\r\nelse:\r\n print(-1)", "k=int(input())\r\nif(k<=36):\r\n if(k%2==0):\r\n print(\"8\"*(k//2))\r\n else:\r\n print((\"8\"*(k//2))+(\"4\"*(k%2)))\r\nelse:\r\n print(\"-1\")", "import sys\n\n#f = open('input', 'r')\nf = sys.stdin\n\nn = int(f.readline())\n\n# 0 1 2 3 4 5 6 7 8 9\nnum_loop = [1,0,0,0,1,0,1,0,2,1]\nif n > 300:\n n = 300\nd = [[-1,] * (n+1) for _ in range(20)]\nd[0][0] = -2\nans = -1\nfor i in range(18):\n if d[i][n] != -1:\n ans = i\n break\n for j in range(n):\n if d[i][j] == -1:\n continue\n for k in range(10):\n if j+num_loop[k] <= n:\n d[i+1][j+num_loop[k]] = k\n\nif d[18][n] != -1:\n ans = 18\nif ans == -1:\n print(-1)\nelse:\n r = []\n tn = n\n while ans > 0:\n k = d[ans][tn]\n r.append(k)\n ans -= 1\n tn -= num_loop[k]\n print(''.join(map(str,r[::-1])))\n", "k = int(input())\r\nif k == 0: print('1')\r\nelif k > 36: print(-1)\r\nelse: print('4'*(k%2) + '8'*(k//2))", "n=int(input())\r\ns=0\r\nif(n>36):\r\n print('-1')\r\nelse:\r\n while(n>0):\r\n if(n%2==0 or n>2):\r\n s=(s*10)+8\r\n n=n-2\r\n else:\r\n s=(s*10)+4\r\n n=n-1\r\n print(s) \r\n ", "#9 - one loop\r\n#8 - two loop\r\nn=int(input())\r\nif(n>36):\r\n print(-1)\r\nelse:\r\n ans=''\r\n while n:\r\n if n%2==1:\r\n ans='9'\r\n n-=1\r\n else:\r\n ans+='8'\r\n n-=2\r\n\r\n print(ans)\r\n \r\n", "k = eval(input())\nans = \"\"\nfor i in range(k//2):\n\tans = ans+\"8\"\nif k%2 == 1:\n\tans = ans + \"4\"\nif k <= 36:\n\tprint(ans)\nelse:\n\tprint(\"-1\")", "n = int(input())\nif n >36:\n print(-1)\n\nelse :\n a=[]\n num1 = n//2\n num2 = n-num1 *2\n for i in range(num1):\n print('8',end='')\n for i in range(num2):\n print('4',end='')\n\n", "k=int(input())\r\nif k>36:\r\n print(-1)\r\nelse:\r\n s=0\r\n while(k!=0):\r\n if k>=2:\r\n s=s*10+8\r\n k-=2\r\n else:\r\n s=s*10+4\r\n k-=1\r\n print(s)\r\n", "n = int(input())\r\nif (n>36):\r\n print(\"-1\")\r\nelse:\r\n if n%2==0:\r\n print('8'*(n//2))\r\n else:\r\n print('8'*(n//2) +'9')", "k = int(input())\r\nif k > 36:\r\n print(-1)\r\nelse:\r\n while k > 0:\r\n if k >=2:\r\n print(8,end=\"\")\r\n k-=2\r\n else:\r\n print(9,end=\"\")\r\n k-=1\r\n print()\r\n ", "k=int(input())\r\nb=\"\"\r\n\r\nif k>36:\r\n print(-1)\r\nelse:\r\n while k>0:\r\n if k>=2:\r\n b+=\"8\"\r\n k-=2\r\n else:\r\n b+=\"4\"\r\n k-=1\r\n \r\nprint(b)", "k=int(input());print(-1 if k>36 else (((k//2)*\"8\")+((k%2)*\"9\")))", "from sys import exit\nloops = [1,4,8]\nn = int(input())\ns = []\nwhile n > 0:\n k = min(2, n)\n s.append(loops[k])\n n -= k\n if len(s) > 18:\n print(\"-1\")\n exit(0)\nif not s:\n s = [1]\nprint(''.join(map(str, s)))\n", "from sys import stdin,stdout\nimport math\ndef isprime(num):\n for i in range(1,int(math.sqrt(num))):\n if(num%i==0):\n return False\n return True\n\nx = int(stdin.readline())\nif(x>36):\n stdout.write(str(-1))\nelse:\n val1 = x//2\n val2 = x%2\n stdout.write(val1*\"8\"+val2*\"9\")\n print()\n", "k = int(input())\nprint(-1 if k > 36 else k // 2 * '8' + k % 2 * '4')\n", "x=int(input())\r\nprint([\"8\"*(x//2)+\"4\"*(x%2),-1][x>36])", "n=int(input())\r\nif(n>36):\r\n print(-1)\r\nelse:\r\n if(n==1):\r\n print(4)\r\n else:\r\n f=''\r\n e=n//2\r\n f='8'*e\r\n if(n%2==0):\r\n pass\r\n else:\r\n f=f+'4'\r\n print(f)", "x, y = divmod(int(input()), 2)\r\n\r\nprint(-1 if 2*x+y>36 else '8'*x+'4'*y)", "import sys\r\n\r\nn=int(input())\r\nk=n//2\r\nif n>36:\r\n\tprint(-1)\r\n\tsys.exit(0)\r\nfor i in range(k):\r\n\tprint('8',end='')\r\nif n%2:\r\n\tprint('6')\r\nelse:\r\n\tprint()", "def main():\n K = int(input())\n\n if K > 36:\n print(-1)\n return\n\n div_, mod_ = divmod(K, 2)\n n = '8' * div_\n if mod_:\n n = n + '9'\n print(n)\n\nmain()\n", "k = int(input())\r\nif (k>36):\r\n print(-1)\r\nelse:\r\n\t\r\n\twhile (k>0):\r\n\t\r\n\t\tif (k>=2):\r\n\t\t\t\r\n\t\t\tprint(8, end=\"\")\r\n\t\t\tk-=2\r\n\t\telse:\r\n\t\t\t\r\n\t\t\tprint(9, end=\"\")\r\n\t\t\tk-=1\r\n\t\t\t\r\n\t\t\r\n\tprint()", "k = int(input())\r\nif(k>36):\r\n print(-1) #at max 888888888888888888....10 power 18 , not more than that...\r\n #in one 8, two loops ,so 36 loop\r\nelse:\r\n print(\"8\"*(k//2) + \"6\"*(k%2))\r\n", "k = int(input())\r\nif k > 36:\r\n print(-1)\r\nelif k%2 == 0:\r\n print('8'*(k//2))\r\nelse:\r\n print('4' + '8'*((k-1)//2))\r\n \r\n", "def build(n):return \"8\"*(n//2) + \"9\"*(n%2)\r\nins = int(input())\r\nprint([build(ins), -1][ins>36])", "k = int(input())\r\ns = ''\r\nd = {9: 1, 8: 2}\r\nif k > 36:\r\n print(-1)\r\nelse:\r\n for i in range(k // 2):\r\n s += '8'\r\n for i in range(k % 2):\r\n s += '9'\r\n if int(s) > 10 ** 18:\r\n print(-1)\r\n print(s)", "n = int(input())\r\nif n>36:\r\n print(-1)\r\nelse:\r\n num = 0\r\n for i in range(n//2):\r\n num = num*10+8\r\n if n%2==1:\r\n num = num*10+6\r\n print(num)", "k = int(input())\r\nprint('1' if k==0 else ('4'*(k%2) + '8'*(k//2)) if k <=36 else '-1')", "n = int(input())\nif n > 36:\n print(-1)\nelse:\n if n % 2 == 0:\n print('8' * (n // 2))\n else:\n print('8' * (n // 2) + '4')\n", "# LUOGU_RID: 114887711\nk=int(input())\r\nif k>36:\r\n print(-1)\r\nelse:\r\n if k%2==0:\r\n print(int(\"8\"*(k//2)))\r\n else:\r\n print(int(\"8\"*((k-1)//2)+\"4\"))" ]

[ "MOD = int(1e9 + 7)\r\nBASE = 32107\r\nN = int(5e5 + 10)\r\npw, ml, mr = [0]*N, [0]*N, [0]*N\r\ns, t = ['']*N, ['']*N\r\n\r\nclass Hash:\r\n def __init__(self):\r\n self.a = [0]*N\r\n def JS(self, s):\r\n lenn = len(s) - 1\r\n for i in range(1, lenn+1):\r\n self.a[i] = (self.a[i - 1] * BASE % MOD + ord(s[i]) - ord('a')) % MOD\r\n def Get(self, l, r):\r\n l -= 1\r\n if l >= 0:\r\n return (self.a[r] - self.a[l] * pw[r - l] % MOD + MOD) % MOD\r\n else:\r\n return self.a[r]\r\n\r\nS = Hash()\r\nT = Hash()\r\n\r\nn, m, k = map(int, input().split())\r\ns_str = \" \" + str(input().strip())\r\nt_str = \" \" + str(input().strip())\r\ns = list(s_str)\r\nt = list(t_str)\r\n\r\npw[0] = 1\r\nfor i in range(1, n+1):\r\n pw[i] = pw[i - 1] * BASE % MOD\r\nS.JS(s)\r\nT.JS(t)\r\n\r\npos = k\r\nfor i in range(1, m+1):\r\n ml[i] = n + 1\r\nfor i in range(1, min(m, k)+1):\r\n while pos <= n and S.Get(pos - i + 1, pos) != T.Get(1, i):\r\n pos += 1\r\n if S.Get(k - i + 1, k) == T.Get(1, i):\r\n pos = k\r\n ml[i] = pos\r\n\r\npos = n - k + 1\r\nfor i in range(1, min(m, k)+1):\r\n while pos > 0 and S.Get(pos, pos + i - 1) != T.Get(m - i + 1, m):\r\n pos -= 1\r\n if S.Get(n - k + 1, n - k + i) == T.Get(m - i + 1, m):\r\n pos = n - k + 1\r\n mr[m - i + 1] = pos\r\n\r\nfor i in range(1, m):\r\n if ml[i] < mr[i + 1] and ml[i] < n + 1 and mr[i + 1] > 0:\r\n print(\"Yes\")\r\n print(ml[i] - k + 1, mr[i + 1])\r\n exit(0)\r\n\r\nfor i in range(1, n - m + 2):\r\n if S.Get(i, i + m - 1) == T.Get(1, m):\r\n print(\"Yes\")\r\n index = min(n - 2 * k + 1, max(1, i - k + 1))\r\n print(index, index + k)\r\n exit(0)\r\n\r\nprint(\"No\")" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = 0\r\np = 1\r\nfor _ in range(n.bit_length() + 2):\r\n x = (n - 1 - p) // (2 * p) + 1\r\n ans += x * p\r\n p *= 2\r\nprint(ans)", "n = int(input())\r\ndp = [[0,0],[0,1],[1,3]]\r\nfor i in range(2,41):\r\n a = sum(dp[-1])\r\n b = 2**i\r\n dp.append([a,a+b])\r\nfinal = [i[1] for i in dp]\r\nans = 0\r\ns = bin(n-1)[2:]\r\nfor i in range(-1,-len(s)-1,-1):\r\n if s[i]=='1':\r\n ans+=sum(final[:-i])\r\n ans+=(2**(-i-1))\r\nprint(ans)", "def process(n):\r\n answer = 0\r\n k = 1 \r\n n-=1\r\n while n > 0:\r\n if n % 2==0:\r\n entry = n//2\r\n else:\r\n entry = (n+1)//2\r\n answer+=(k*entry)\r\n n = n//2\r\n k = k*2\r\n return answer\r\n \r\nn = int(input())\r\nprint(process(n))", "n=int(input())\r\nn-=1\r\ntot=n//2\r\nans=0\r\nans+=(n-tot)\r\nmask=1\r\nwhile(mask<=40):\r\n curr=1<<mask\r\n strt=curr//2\r\n cnt=((tot-strt)//(curr))+1\r\n ans+=curr*cnt\r\n mask+=1\r\n\r\nprint(ans)", "n = int(input())\r\n\r\ndef PotenciaDosMasCercana(n):\r\n if n == 0:\r\n return 0,0\r\n p = 1\r\n i = 0\r\n while p <= n:\r\n p = p << 1\r\n i +=1\r\n return p >> 1, i - 1\r\n\r\n\r\ndef C_Conexas(b):\r\n dp = [int]*2\r\n dp[0] = 0\r\n for i in range(1,b+1): \r\n dp[1] = 2 * dp[0] + 2 ** (i-1)\r\n dp[0] = dp[1]\r\n return dp[0]\r\n\r\n\r\ndef main(n):\r\n a,b = PotenciaDosMasCercana(n)\r\n Ans = 0\r\n if(n == a):\r\n Ans = C_Conexas(b)\r\n else:\r\n c,d = PotenciaDosMasCercana(n-a)\r\n Ans = C_Conexas(b) + main(n-a) + a\r\n return Ans\r\n\r\nprint(main(n))\r\n", "def slow_cal(x):\r\n if x == 0:\r\n return 0\r\n else:\r\n return slow_cal(x - 1) + min(x ^ v for v in range(x))\r\n\r\n\r\ndef med_cal(x):\r\n if x == 0:\r\n return 0\r\n return sum(min(i ^ j for j in range(i)) for i in range(1, x+1))\r\n\r\n\r\ndef fast_cal(x):\r\n res = 0\r\n for bit in range(50):\r\n res += (x//(1 << (bit)) - x//(1 << (bit + 1)))*(1 << bit)\r\n return res\r\n\r\n\"\"\"\r\nfor i in range(700):\r\n assert fast_cal(i) == slow_cal(i) == med_cal(i)\r\nprint(\"ALL_CORRECT\")\r\n\"\"\"\r\nn = int(input()) - 1\r\nprint(fast_cal(n))", "import sys\r\nimport math\r\nimport collections\r\ndy = [1, 0, -1, 0]\r\ndx = [0, 1, 0, -1]\r\n\r\nr = sys.stdin.readline\r\n\r\nN = int(r())\r\nN -= 1\r\ni = 1\r\nans = N\r\nwhile 2**i <= N:\r\n ans += N//(2**i)*(2**(i-1))\r\n i += 1\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nn-=1\r\nans=0\r\nfor i in range(50):\r\n ans+=(n//(1<<i)-n//(1<<(i+1)))*(1<<i)\r\nprint(ans)", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: Jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nfrom io import BytesIO, IOBase\r\nimport sys\r\nfrom heapq import heappush,heappop\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,Counter,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().rstrip()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\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\n\r\ndef bo(i):\r\n return ord(i)-ord('0')\r\n\r\nfile = 1\r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\n\r\n'''\r\n\r\nThe tree will be look like...........\r\n\r\n\r\n 0\r\n\r\n 1 2 4 8 16 32 64 128 ......\r\n 1/ 1/2\\ 1/2|4\\\r\n 3 5 6 9 10 11\r\n 1\\\r\n 7\r\n\r\n\r\n\r\nso, the answer will be number of element having lsb is ith bit * 2^i for all i.\r\nlsb(x) = x&(-x)\r\nlsb(6) = 110 = 1th bit from right\r\n\r\n\r\nNow, count how many number having lsb is 1\r\nlet's take some number havint lsb is 1 -> 2 6 10 14 18 22 .... -> a = 2 & d = 4(in A.P series)\r\n\r\nsimilar for lsb = 2\r\n4 12 20 28 ....-> a = 4 & d = 8\r\n\r\nfor lsb = i the series will be 2^i,(2^i + 2^(i+1)),[2^i + 2^(i+1) + 2^(i+1)].....\r\n\r\nbut stil we don't know in ith series how many number has?\r\n\r\nlet's assume the number will be ...t\r\n\r\nso, n >= a + (t-1)*d \r\n\r\n=> n >= 2^i + (t-1)*2^(i+1) \r\n=> n >= 2^i[1 + 2t - 2] \r\n=> n/x <= 2t+1 (where x = 2^i)\r\n=> (n-x)/x <= 2t\r\n=> (n-x)/2*x <= t\r\n\r\nt = (n-x)/2*x + 1\r\n\r\n'''\r\n\r\n\r\ndef solve():\r\n\r\n \r\n # for _ in range(1,ii()+1):\r\n res = 0\r\n n = ii()\r\n n-=1\r\n for i in range(40):\r\n x = pow(2,i)\r\n t = (n-x)//(2*x) + 1\r\n if t>=0:\r\n res += (t*x)\r\n print(res)\r\n \r\nif __name__ ==\"__main__\":\r\n\r\n if(file):\r\n \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 else:\r\n input=sys.stdin.readline\r\n solve()\r\n" ]

[ "N = int(input())\r\nin_data = {i: [0] * (N + 1) for i in range(3)}\r\nprv = [[0] * (N + 1) for _ in range(3)]\r\nfor i in range(2):\r\n input_line = input().split()\r\n for j in range(1, N + 1):\r\n in_data[i][j] = int(input_line[j - 1])\r\nfor i in range(1, N + 1):\r\n in_data[2][i] = in_data[0][i] + in_data[1][i]\r\nMx = {}\r\ndp = [0] * (N + 1)\r\ndef getc(a, b):\r\n if a < 0 or b < 0:\r\n return -float('inf')\r\n if a == b:\r\n return dp[a]\r\n if (a, b) in Mx:\r\n return Mx[(a, b)]\r\n rv = dp[min(a, b)]\r\n if a > b:\r\n rv = max(rv, getc(prv[0][a], b) + 1)\r\n if a < b:\r\n rv = max(rv, getc(a, prv[1][b]) + 1)\r\n Mx[(a, b)] = rv\r\n return rv\r\nfor i in range(3):\r\n Mu = {}\r\n Mu[0] = 0\r\n s = 0\r\n for j in range(1, N + 1):\r\n if s + in_data[i][j] not in Mu:\r\n prv[i][j] = -1\r\n else:\r\n prv[i][j] = Mu[s + in_data[i][j]]\r\n s += in_data[i][j]\r\n Mu[s] = j\r\n prv[i][0] = -1\r\n for j in range(1, N + 1):\r\n prv[i][j] = max(prv[i][j], prv[i][j - 1])\r\n Mu.clear()\r\nfor i in range(1, N + 1):\r\n dp[i] = dp[i - 1]\r\n if prv[2][i] != -1:\r\n dp[i] = max(dp[i], dp[prv[2][i]] + 1)\r\n dp[i] = max(dp[i], getc(prv[0][i], i) + 1)\r\n dp[i] = max(dp[i], getc(i, prv[1][i]) + 1)\r\nprint(dp[N])# 1693836449.3463616" ]

[ "# ﷽\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\n\r\ndef solve():\r\n s=input()\r\n n=len(s)\r\n \r\n for i in range(n):\r\n for j in range(i+1,n):\r\n for k in range(j+1,n):\r\n if int(s[i]+s[j]+s[k])%8==0:\r\n return int(s[i]+s[j]+s[k])\r\n if int(s[i]+s[j])%8==0:return int(s[i]+s[j])\r\n if int(s[i])%8==0:return int(s[i])\r\n return \"NO\"\r\n \r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n ans=solve()\r\n if ans!='NO':\r\n print('YES')\r\n print(ans)\r\n else:print('NO')\r\n", "def test(x):\r\n global s\r\n x = str(x)\r\n for i in range(len(x)):\r\n if s.count(x[i]) == 0:\r\n return False\r\n s = s[s.find(x[i]) + 1:]\r\n return True\r\ns2 = input()\r\ns = s2\r\nans = -1\r\nfor i in range(0, 1000, 8):\r\n if test(i):\r\n ans = i\r\n break\r\n s = s2\r\nif ans == -1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n print(ans)\r\n", "# LUOGU_RID: 113052501\nn = input()\r\nlens = len(n)\r\nans = list()\r\n\r\n\r\ndef solve(n, lens):\r\n for i in n:\r\n if i == '0' or i == '8':\r\n print(\"YES\")\r\n print(i)\r\n return\r\n for i in range(lens - 1, -1, -1):\r\n if int(n[i]) % 2 == 0:\r\n for j in range(i - 1, -1, -1):\r\n if int(n[j] + n[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(n[j] + n[i])\r\n return\r\n elif int(n[j] + n[i]) % 4 == 0:\r\n for k in range(j - 1, -1, -1):\r\n if int(n[k] + n[j] + n[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(n[k] + n[j] + n[i])\r\n return\r\n print('NO')\r\n return\r\nsolve(n, lens)\r\n", "import re\r\nst = input()\r\nfor i in range(0, 1000, 8):\r\n if re.search(\".*\".join(list(str(i))), st):\r\n print(\"YES\")\r\n print(i)\r\n exit()\r\nprint(\"NO\")", "def find_divisible_by_eight(s):\r\n len_s = len(s)\r\n\r\n \r\n \r\n\r\n flag = 0\r\n res = 0\r\n\r\n for i in range(len_s):\r\n a = int(s[i])\r\n if a == 8:\r\n flag = 1\r\n res = 8\r\n break\r\n elif a == 0:\r\n flag = 1\r\n res = 0\r\n break\r\n\r\n for j in range(i + 1, len_s):\r\n b = int(s[j])\r\n if b == 8:\r\n flag = 1\r\n res = 8\r\n break\r\n elif b == 0:\r\n flag = 1\r\n res = 0\r\n break\r\n elif (a * 10 + b) % 8 == 0:\r\n flag = 1\r\n res = a * 10 + b\r\n break\r\n\r\n for k in range(j + 1, len_s):\r\n c = int(s[k])\r\n if (a * 10 + c) % 8 == 0:\r\n flag = 1\r\n res = a * 10 + c\r\n break\r\n elif (b * 10 + c) % 8 == 0:\r\n flag = 1\r\n res = b * 10 + c\r\n break\r\n elif (a * 100 + b * 10 + c) % 8 == 0:\r\n flag = 1\r\n res = a * 100 + b * 10 + c\r\n break\r\n\r\n if flag:\r\n break\r\n\r\n if flag:\r\n break\r\n\r\n if flag:\r\n return res\r\n else:\r\n return None\r\n\r\n\r\ns = input().strip()\r\nresult = find_divisible_by_eight(s)\r\nif result is not None:\r\n print(\"YES\")\r\n print(result)\r\nelse:\r\n print(\"NO\")", "from math import ceil\nfrom collections import defaultdict, deque\n\ndef digits(m):\n if m == 0:\n return [\"0\"]\n d = []\n while m > 0:\n d.append(str(m % 10))\n m //= 10\n d.reverse()\n return d\n\nn = input()\nD = [digits(8*i) for i in range(125)]\n\nfor d in D:\n f = 0\n for c in n:\n if c == d[f]:\n f += 1\n if f == len(d):\n print(\"YES\")\n print(\"\".join(d))\n break\n else:\n continue\n break\nelse:\n print(\"NO\")", "import re\r\ns=input()\r\nt=0\r\nfor i in range(0,1000,8):\r\n i=str(i)\r\n if re.search('.*'.join(i),s):t=1;break\r\nprint([\"NO\",\"YES\\n\"+i][t])", "s=input()\r\nl=[]\r\nfor j in range (0,1000,8):\r\n l.append(str(j))\r\nchecker = 0\r\nfor i in l:\r\n checker = -1\r\n for d in i:\r\n checker = s.find(d,checker+1)\r\n if checker == -1:\r\n break\r\n if checker!=-1:\r\n print(\"YES\")\r\n print(i)\r\n break\r\nif checker==-1:\r\n print(\"NO\")", "from itertools import combinations\r\nn = [eval(i) for i in list(input())]\r\nlst1 = combinations(n, 3)\r\nboom = 0\r\nfor i in lst1:\r\n p = i[0]*(100)+i[1]*10+i[2]\r\n if p % 8 == 0:\r\n boom = 1\r\n print(\"Yes\")\r\n print(p)\r\n exit()\r\nlst1 = combinations(n, 2)\r\nfor i in lst1:\r\n p = i[0]*10+i[1]\r\n if p % 8 == 0:\r\n boom = 1\r\n print(\"Yes\")\r\n print(p)\r\n exit()\r\nfor i in n:\r\n if i % 8 == 0:\r\n boom = 1\r\n print(\"Yes\")\r\n print(i)\r\n exit()\r\nif not boom:\r\n print(\"No\")", "from itertools import combinations\n\ndef solve():\n n = input()\n\n found = False\n\n for i in range(1,4):\n for tp in combinations(n,i):\n x = int(''.join(tp))\n if x % 8 == 0:\n print(f'YES\\n{x}')\n return\n\n print('NO')\n\nsolve()", "s = input()\r\n\r\na = \"NO\"\r\nnums = [str(i) for i in range(1000) if i % 8 == 0]\r\nfor i in nums:\r\n t = -1\r\n\r\n for c in i:\r\n t = s.find(c, t + 1)\r\n\r\n if t == -1:\r\n break\r\n\r\n if t != -1:\r\n a = 'YES\\n' + i\r\nprint(a)\r\n", "import re\r\ns=input()\r\nfor i in range(0,1000,8):\r\n if re.search('.*'.join(str(i)),s):\r\n print('YES\\n',i)\r\n quit()\r\nprint('NO')", "# https://codeforces.com/problemset/problem/550/C\n\ndef main():\n s = input()\n\n # 856\n\n # dp = {\n # 2: set((0, 5))\n # }\n\n dp = {}\n\n for d in s:\n d = int(d)\n\n if d == 0 or d == 8:\n print(\"YES\")\n print(d)\n return\n\n for k, v in dp.items():\n\n if (k * 10 + d) % 8 == 0:\n print(\"YES\")\n print(k * 10 + d)\n return\n\n for k2 in v:\n if (k * 100 + k2 * 10 + d) % 8 == 0:\n print(\"YES\")\n print(k * 100 + k2 * 10 + d)\n return\n\n if d not in v:\n v.add(d)\n\n if d not in dp:\n dp[d] = set()\n\n print(\"NO\")\n\n\nmain()", "x = input()\r\nn = len(x)\r\ndef fun(x,n):\r\n for i in range(n-1,-1,-1):\r\n num = int(x[i])\r\n if num % 8 == 0:\r\n print('yes')\r\n print(num)\r\n return\r\n for ii in range(i-1, -1, -1):\r\n num = 10* int(x[ii]) + int(x[i])\r\n if num % 8 == 0:\r\n print('yes')\r\n print(num)\r\n return\r\n for iii in range(ii-1, -1, -1):\r\n num = 100*int(x[iii]) + 10*int(x[ii]) + int(x[i])\r\n if num % 8 == 0:\r\n print('yes')\r\n print(num)\r\n return\r\n print('no')\r\nfun(x,n)", "n = input()\r\nd = []\r\nfor i in range(1000):\r\n if i % 8 == 0:\r\n d.append(str(i))\r\nans = None\r\nfor num in d:\r\n i = 0\r\n for c in n:\r\n if c == num[i]:\r\n i += 1\r\n if i == len(num):\r\n ans = num\r\n break\r\nif ans:\r\n print(\"YES\")\r\n print(ans)\r\nelse:\r\n print(\"NO\")", "s = input()\r\nss = \"NO\"\r\nfor i in range(0, len(s), 1):\r\n for j in range(i + 1, len(s), 1):\r\n for k in range(j + 1, len(s), 1):\r\n n = int(s[i]) * 100 + int(s[j]) * 10 + int(s[k])\r\n if (n % 8 == 0):\r\n ss = s[i] + s[j] + s[k]\r\n break\r\nfor i in range(0, len(s), 1):\r\n for j in range(i + 1, len(s), 1):\r\n n = int(s[i]) * 10 + int(s[j])\r\n if (n % 8 == 0):\r\n ss = s[i] + s[j]\r\n break\r\nfor i in range(0, len(s), 1):\r\n if (s[i] == '0' or s[i] == '8'):\r\n ss = s[i]\r\nif (ss != \"NO\"):\r\n print(\"YES\")\r\n print(ss)\r\nelse:\r\n print(\"NO\")", "a=input()\r\nl=[]\r\nc=0\r\nfor i in a:\r\n l.append(int(i))\r\nfor i in range(len(l)):\r\n if l[i]%8==0:\r\n print(\"YES\")\r\n print(l[i])\r\n c=1\r\n break\r\n for j in range(i+1,len(l)):\r\n b=10*l[i]+l[j]\r\n if b%8==0:\r\n print(\"YES\")\r\n print(b)\r\n c=1\r\n break\r\n for k in range(j+1,len(l)):\r\n a=100*l[i]+10*l[j]+l[k]\r\n if a%8==0:\r\n print(\"YES\")\r\n print(a)\r\n c=1\r\n break\r\n if c==1:\r\n break\r\n if c==1:\r\n break\r\nif c==0:\r\n print(\"NO\")", "n = input()\r\ndef ans():\r\n for i in range(len(n)):\r\n if int(n[i])%8==0:\r\n print(\"YES\")\r\n print(n[i])\r\n return\r\n for j in range(i+1, len(n)):\r\n if int(n[i]+n[j])%8==0:\r\n print(\"YES\")\r\n print(n[i]+n[j])\r\n return\r\n for k in range(j+1, len(n)): \r\n if int(n[i]+n[k])%8==0:\r\n print(\"YES\")\r\n print(n[i]+n[k])\r\n return\r\n elif int(n[i]+n[j]+n[k])%8==0:\r\n print(\"YES\")\r\n print(n[i]+n[j]+n[k])\r\n return\r\n print(\"NO\")\r\n return\r\nans()", "s = \"00\" + input()\r\nn = len(s)\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j+1, n):\r\n num = int(s[i] + s[j] + s[k])\r\n if num % 8 == 0:\r\n print('YES')\r\n print(num)\r\n exit()\r\nprint('NO')", "s = str(input())\nn = len(s)\n\nfor i in range(n):\n if int(s[i]) % 8 == 0:\n print(\"YES\")\n print(s[i])\n exit(0)\nfor i in range(n):\n for j in range(i + 1, n):\n if int(s[i] + s[j]) % 8 == 0:\n print(\"YES\")\n print(s[i] + s[j])\n exit(0)\nfor i in range(n):\n for j in range(i + 1, n):\n for k in range(j + 1, n):\n if int(s[i] + s[j] + s[k]) % 8 == 0:\n print(\"YES\")\n print(s[i] + s[j] + s[k])\n exit(0)\nprint(\"NO\")\n", "n=input()\r\nfor i in range(0,1000,8):\r\n k=-1\r\n for c in str(i):\r\n k=n.find(c,k+1)\r\n if k<0:\r\n break\r\n else:\r\n print(\"YES\")\r\n print(i)\r\n break\r\nelse:\r\n print('NO')\r\n", "data=[str(8*i) for i in range(1000//8)]\r\nn=input()\r\nfor i in data:\r\n p=0\r\n j=0\r\n while p<len(i) and j<len(n):\r\n if i[p]==n[j]:\r\n p+=1\r\n j+=1\r\n if p==len(i):\r\n print(\"YES\")\r\n print(i)\r\n break\r\n if p==len(i):\r\n break\r\nelse:\r\n print(\"NO\")", "x=str(input())\r\nres=-1\r\nfor i in range(0,1000,8):\r\n t=str(i)\r\n j=0\r\n for num in x:\r\n if num==t[j]:j+=1\r\n if j==len(t):break\r\n if j==len(t):\r\n res=i\r\n break\r\nif res!=-1:\r\n print(\"YES\")\r\n print(res)\r\nelse:\r\n print(\"NO\")", "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 Divisibility_by_Eight():\r\n number_list = insr()\r\n n = len(number_list)\r\n\r\n for i in range(n):\r\n for j in range(i,n):\r\n for k in range(j,n):\r\n if i == j and j == k:\r\n number_string = number_list[i]\r\n num = int(number_string)\r\n if num % 8 == 0: \r\n print(\"YES\")\r\n print(num)\r\n return\r\n \r\n elif i == j or j == k:\r\n number_string = number_list[i] + number_list[k] \r\n num = int(number_string)\r\n if num % 8 == 0:\r\n print(\"YES\")\r\n print(num)\r\n return \r\n else: \r\n number_string = number_list[i] + number_list[j] + number_list[k]\r\n num = int(number_string)\r\n if num % 8 == 0:\r\n print(\"YES\")\r\n print(num)\r\n return \r\n \r\n print(\"NO\")\r\n return \r\n\r\n\r\nDivisibility_by_Eight()", "n = input()\r\nfor i in range(0, 1000, 8):\r\n a = list(str(i))\r\n fl = False\r\n for j in n:\r\n if j == a[0]:\r\n a.pop(0)\r\n if not a:\r\n print('YES')\r\n print(i)\r\n fl = True\r\n break\r\n if fl:\r\n break\r\nelse:\r\n print('NO')", "import sys\n\ndef combinationUtil(arr, n, r, index, data, i):\n # Current combination is \n # ready to be printed,\n # print it\n if(index == r):\n suma = 0\n string = \"\"\n for j in range(r):\n suma += data[j] * (10 ** (r-j-1))\n string += str(data[j])\n if suma % 8 == 0:\n print(\"YES\")\n print(string)\n sys.exit()\n return\n \n # When no more elements \n # are there to put in data[]\n if(i >= n):\n return\n \n # current is included, \n # put next at next\n # location \n data[index] = arr[i]\n combinationUtil(arr, n, r, index + 1, data, i + 1)\n \n # current is excluded, \n # replace it with\n # next (Note that i+1 \n # is passed, but index \n # is not changed)\n combinationUtil(arr, n, r, index, \n data, i + 1)\n \n \n# The main function that\n# prints all combinations\n# of size r in arr[] of \n# size n. This function \n# mainly uses combinationUtil()\ndef printcombination(arr, n, r):\n \n # A temporary array to\n # store all combination\n # one by one\n data = list(range(r))\n \n # Print all combination \n # using temporary \n # array 'data[]'\n combinationUtil(arr, n, r, \n 0, data, 0)\n \n \narr = list(map(int, list(input()))) \nr = 3\nn = len(arr)\n\nfor i in range(1, 4):\n printcombination(arr, n, i)\n\nprint(\"NO\")\n\t\t \t \t\t\t \t \t\t\t\t\t \t\t \t \t\t", "n = input()\r\ni = 0\r\nj = 1\r\nk = 2\r\n\r\ndef is_divisible_by_8(n):\r\n if \"8\" in n:\r\n return \"8\"\r\n if \"0\" in n:\r\n return \"0\"\r\n elif int(n) % 8 == 0:\r\n return n\r\n elif len(n) > 2:\r\n if int(n[:2]) % 8 == 0:\r\n return n[:2]\r\n elif int(n[1:]) % 8 == 0:\r\n return n[1:]\r\n elif int(n[0]+n[2]) % 8 == 0:\r\n return n[0]+n[2]\r\n return False\r\n\r\nif len(n) < 3:\r\n if is_divisible_by_8(n) != False:\r\n print(\"YES\")\r\n print(is_divisible_by_8(n))\r\n else:\r\n print(\"NO\")\r\n\r\nif len(n) >= 3:\r\n for i in range(len(n)):\r\n for j in range(i+1, len(n)):\r\n for k in range(j+1, len(n)):\r\n if is_divisible_by_8(n[i]+n[j]+n[k]) != False:\r\n print(\"YES\")\r\n print(is_divisible_by_8(n[i]+n[j]+n[k]))\r\n exit()\r\n print(\"NO\")\r\n", "# Brute force is fine. Not very elegant but fine\r\nn = input()\r\nif \"0\" in n:\r\n number = 0\r\n Found = True\r\nelse:\r\n Found = False\r\nsize = len(n)\r\nfor a in range(size):\r\n if Found:\r\n break\r\n number = n[a]\r\n if int(number) % 8 == 0:\r\n Found = True\r\n break\r\n for b in range(a + 1, size):\r\n if Found:\r\n break\r\n number = n[a] + n[b]\r\n if int(number) % 8 == 0:\r\n Found = True\r\n break\r\n for c in range(b + 1, size):\r\n number = n[a] + n[b] + n[c]\r\n if int(number) % 8 == 0:\r\n Found = True\r\n break\r\nif Found:\r\n print(\"YES\")\r\n print(int(number))\r\nelse:\r\n print(\"NO\")", "valid = []\r\n\r\nfor i in range(1001):\r\n if i % 8 == 0:\r\n valid.append(i)\r\n\r\ns = input()\r\n\r\nfor x in valid:\r\n target = str(x)\r\n j = 0\r\n for i in range(len(s)):\r\n if target[j] == s[i]:\r\n j += 1\r\n if j == len(target):\r\n print(\"YES\")\r\n print(target)\r\n quit()\r\n\r\nprint(\"NO\")", "import re\nimport sys\n\nnumber = str(input())\nfor element in range(0, 1000, 8):\n a = '.*'.join(str(element)) # all the .`s can be removed so only the multiple of 8 is left\n if re.search(a, number):\n print(\"YES\")\n print(element)\n sys.exit(0)\nprint(\"NO\")\n", "def f():\r\n a = [int(x) for x in input()]\r\n n = len(a)\r\n p = (1 << 3) - 1\r\n for x in a:\r\n if (x & p) == 0:\r\n print(\"YES\")\r\n print(x)\r\n return\r\n\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n x = a[i] * 10 + a[j]\r\n if (x & p) == 0:\r\n print(\"YES\")\r\n print(x)\r\n return\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j + 1, n):\r\n x = a[i] * 100 + a[j]*10 + a[k]\r\n if (x&p) == 0:\r\n print(\"YES\")\r\n print(x)\r\n return\r\n print(\"NO\")\r\n\r\nf()\r\n ", "def is_subsequence(s1,s2):\r\n n=len(s1)\r\n m=len(s2)\r\n i=j=0\r\n while i<n and j<m:\r\n if s1[i]==s2[j]:\r\n i+=1\r\n j+=1\r\n return i==n\r\n\r\ns=input()\r\nfor i in range(0,1000,8):\r\n if is_subsequence(str(i),s):\r\n print('YES')\r\n print(i)\r\n break\r\nelse:\r\n print('NO')", "s = input()\n\nnums = [[\"0\", \"0\"], [\"8\", \"8\"], [\"16\", \"16\"], [\"24\", \"24\"], [\"32\", \"32\"], [\"40\", \"40\"], [\"48\", \"48\"], [\"56\", \"56\"], [\"64\", \"64\"], [\"72\", \"72\"], [\"80\", \"80\"], [\"88\", \"88\"], [\"96\", \"96\"], [\"104\", \"104\"], [\"112\", \"112\"], [\"120\", \"120\"], [\"128\", \"128\"], [\"136\", \"136\"], [\"144\", \"144\"], [\"152\", \"152\"], [\"160\", \"160\"], [\"168\", \"168\"], [\"176\", \"176\"], [\"184\", \"184\"], [\"192\", \"192\"], [\"200\", \"200\"], [\"208\", \"208\"], [\"216\", \"216\"], [\"224\", \"224\"], [\"232\", \"232\"], [\"240\", \"240\"], [\"248\", \"248\"], [\"256\", \"256\"], [\"264\", \"264\"], [\"272\", \"272\"], [\"280\", \"280\"], [\"288\", \"288\"], [\"296\", \"296\"], [\"304\", \"304\"], [\"312\", \"312\"], [\"320\", \"320\"], [\"328\", \"328\"], [\"336\", \"336\"], [\"344\", \"344\"], [\"352\", \"352\"], [\"360\", \"360\"], [\"368\", \"368\"], [\"376\", \"376\"], [\"384\", \"384\"], [\"392\", \"392\"], [\"400\", \"400\"], [\"408\", \"408\"], [\"16\", \"16\"], [\"424\", \"424\"], [\"432\", \"432\"], [\"440\", \"440\"], [\"448\", \"448\"], [\"456\", \"456\"], [\"464\", \"464\"], [\"472\", \"472\"], [\"480\", \"480\"], [\"488\", \"488\"], [\"496\", \"496\"], [\"504\", \"504\"], [\"512\", \"512\"], [\"520\", \"520\"], [\"528\", \"528\"], [\"536\", \"536\"], [\"544\", \"544\"], [\"552\", \"552\"], [\"560\", \"560\"], [\"568\", \"568\"], [\"576\", \"576\"], [\"584\", \"584\"], [\"592\", \"592\"], [\"600\", \"600\"], [\"608\", \"608\"], [\"616\", \"616\"], [\"624\", \"624\"], [\"632\", \"632\"], [\"640\", \"640\"], [\"648\", \"648\"], [\"656\", \"656\"], [\"664\", \"664\"], [\"672\", \"672\"], [\"680\", \"680\"], [\"688\", \"688\"], [\"696\", \"696\"], [\"704\", \"704\"], [\"712\", \"712\"], [\"720\", \"720\"], [\"728\", \"728\"], [\"736\", \"736\"], [\"744\", \"744\"], [\"752\", \"752\"], [\"760\", \"760\"], [\"768\", \"768\"], [\"776\", \"776\"], [\"784\", \"784\"], [\"792\", \"792\"], [\"800\", \"800\"], [\"808\", \"808\"], [\"816\", \"816\"], [\"824\", \"824\"], [\"832\", \"832\"], [\"840\", \"840\"], [\"848\", \"848\"], [\"856\", \"856\"], [\"864\", \"864\"], [\"872\", \"872\"], [\"880\", \"880\"], [\"888\", \"888\"], [\"896\", \"896\"], [\"904\", \"904\"], [\"912\", \"912\"], [\"920\", \"920\"], [\"928\", \"928\"], [\"936\", \"936\"], [\"944\", \"944\"], [\"952\", \"952\"], [\"960\", \"960\"], [\"968\", \"968\"], [\"976\", \"976\"], [\"984\", \"984\"], [\"992\", \"992\"]]\nres = 0\n\nfor c in s:\n if res:\n break\n for i in range(len(nums)):\n if nums[i][0][0] == c:\n nums[i][0] = nums[i][0][1:]\n if not nums[i][0]:\n res = nums[i][1]\n break\n\nif res:\n print(\"YES\")\n print(res)\nelse:\n print(\"NO\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nlib = set()\r\nfor i in range(125):\r\n lib.add(str(i*8))\r\n \r\ndp = set()\r\nfor c in input():\r\n ndp = set()\r\n if c in lib:\r\n print('YES')\r\n exit(print(c))\r\n ndp.add(c)\r\n \r\n for t in dp:\r\n ndp.add(t)\r\n nt = t+c\r\n if len(nt)>3:\r\n nt = nt[-3:]\r\n ndp.add(nt)\r\n if nt in lib:\r\n print('YES')\r\n exit(print(nt))\r\n dp = ndp\r\n \r\nprint('NO')", "n = input()\r\nlst1 = list(map(int,str(n)))\r\n\r\nans = -1\r\nfor i in range(len(n)):\r\n for j in range(i+1,len(n)):\r\n for k in range(j+1,len(n)):\r\n if int(n[i]+n[j]+n[k])%8 == 0:\r\n ans = int(n[i]+n[j]+n[k])\r\n\r\nfor i in range(len(n)):\r\n for j in range(i+1,len(n)):\r\n if int(n[i]+n[j])%8 == 0:\r\n ans = int(n[i]+n[j])\r\n \r\nfor i in range(len(n)):\r\n if int(n[i])%8 == 0:\r\n ans = int(n[i])\r\n\r\nif ans == -1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(ans)", "s=input()\r\nremainders=[None for i in range(8)]\r\nexist=False\r\nfor char in s:\r\n more=[None for i in range(8)]\r\n for i in range(8):\r\n if remainders[i]:\r\n more[(int(char)+2*i)%8]=remainders[i]+char\r\n for i in range(8):\r\n if more[i]:\r\n remainders[i]=more[i]\r\n remainders[int(char)%8]=char\r\n if remainders[0]:\r\n exist=True\r\n break\r\n\r\nif exist:\r\n print('YES')\r\n print(remainders[0])\r\nelse:\r\n print('NO')\r\n", "import sys\r\n# sys.setrecursionlimit(400000)\r\ninput=lambda:sys.stdin.readline().strip()\r\n# write=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# from decimal import Decimal\r\n# from datetime import datetime,timedelta\r\n# from random import randint\r\n# from copy import deepcopy\r\nfrom collections import deque,Counter\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\nfrom math import inf,sqrt,gcd,pow,ceil,floor,log,log2,log10,pi,sin,cos,tan,asin,acos,atan\r\n# from functools import cmp_to_key,reduce\r\n# from operator import or_,xor,add,mul\r\n# from itertools import permutations,combinations,accumulate\r\n\r\ndef solve():\r\n s=input()\r\n n=len(s)\r\n dp=[[False]*8 for i in range(n)]\r\n prev=[[-1]*8 for i in range(n)]\r\n\r\n dp[0][int(s[0])%8]=True\r\n for i in range(1,n):\r\n for j in range(8):\r\n if dp[i-1][j]:\r\n dp[i][(10*j+int(s[i]))%8]=True\r\n prev[i][(10*j+int(s[i]))%8]=j\r\n\r\n dp[i][j]=True\r\n prev[i][j]=j\r\n dp[i][int(s[i])%8]=True\r\n if dp[n-1][0]:\r\n print('YES')\r\n for i in range(n):\r\n if dp[i][0]:\r\n pi=i;pj=0\r\n ans=[]\r\n while True:\r\n if prev[pi][pj]==-1 or prev[pi][pj]!=pj:\r\n ans.append(s[pi])\r\n if prev[pi][pj]==-1:\r\n break\r\n pj=prev[pi][pj]\r\n pi-=1\r\n ans.reverse()\r\n ans=''.join(ans)\r\n print(ans)\r\n return\r\n print('NO')\r\n return\r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\n# solve()\r\n\r\nsolve()", "def a(num, nums):\r\n if len(num) > 3:\r\n return\r\n \r\n if num and int(num[::-1]) % 8 == 0:\r\n return num[::-1]\r\n\r\n if nums:\r\n out = a(num + nums[0], nums[1:])\r\n\r\n if out:\r\n return out\r\n\r\n return a(num, nums[1:])\r\n \r\n\r\nnum = input()[::-1]\r\n\r\nout = a('', num)\r\n\r\nif out:\r\n print('YES')\r\n print(out)\r\nelse:\r\n print('NO')\r\n\r\n", "n = input()\nans = ''\ni = 0\nwhile i < len(n):\n if int(n[i]) % 8 == 0:\n ans = int(n[i])\n break\n j = i + 1\n while j < len(n):\n if int(n[i] + n[j]) % 8 == 0:\n ans = int(n[i] + n[j])\n i = len(n)\n break\n k = j + 1\n while k < len(n):\n if int(n[i] + n[j] + n[k]) % 8 == 0:\n ans = int(n[i] + n[j] + n[k]) \n i, j = len(n),len(n)\n break\n k += 1\n j += 1\n i += 1\nif ans == '':\n print('NO')\nelse:\n print('YES')\n print(ans)", "s = '00' + input()\r\nfor i in range(len(s) ):\r\n for j in range(i+1, len(s) ):\r\n for k in range(j+1, len(s) ):\r\n x = 100*int(s[i]) + 10*int(s[j]) + int(s[k])\r\n if x % 8 == 0:\r\n print('YES\\n{}'.format(x) )\r\n exit()\r\nprint('NO')\r\n ", "s=input()\r\nt=0\r\nfor i in range(len(s)):\r\n out=s[i]\r\n if int(out)%8==0:\r\n t=1\r\n if t!=1:\r\n for j in range(i+1,len(s)):\r\n out=out+s[j]\r\n if int(out)%8==0:\r\n t=1\r\n if t!=1:\r\n for k in range(j+1,len(s)):\r\n out=out+s[k]\r\n if int(out)%8==0:\r\n t=1\r\n if t==1:\r\n break\r\n out=out[:len(out)-1]\r\n if t==1:\r\n break\r\n out=out[:len(out)-1]\r\n \r\n if t==1:\r\n break\r\nif t==1:\r\n print(\"YES\")\r\n print(out)\r\nelse:\r\n print(\"NO\")\r\n", "v1 = input();n = len(v1)\r\nfor i in range(n):\r\n if v1[i] == '0' or v1[i] == '8':\r\n print(\"YES\")\r\n print(v1[i])\r\n break\r\nelse:\r\n for i in range(n - 1):\r\n for j in range(i + 1, n):\r\n v = int(v1[i] + v1[j])\r\n if v % 8 == 0:print(\"YES\");print(v);break\r\n else:continue\r\n break\r\n else:\r\n for i in range(n - 2):\r\n for j in range(i + 1, n - 1):\r\n for k in range(j + 1, n):\r\n v = int(v1[i] + v1[j] + v1[k])\r\n if v % 8 == 0:print(\"YES\");print(v);break\r\n else:continue\r\n break\r\n else:continue\r\n break\r\n else:print(\"NO\")\r\n", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\ndef y(): print('YES')\r\n\r\nn = input()\r\nl = len(n)\r\n\r\nfor x in n:\r\n if int(x)%8 == 0:\r\n y()\r\n print(x)\r\n exit()\r\nfor i in range(l):\r\n for j in range(i+1,l):\r\n if int(n[i]+n[j])%8 == 0:\r\n y()\r\n print(n[i]+n[j])\r\n exit()\r\nfor i in range(len(n)-2):\r\n for j in range(i+1,len(n)-1):\r\n for k in range(j+1,len(n)):\r\n if int(n[i]+n[j]+n[k])%8 == 0:\r\n print('YES')\r\n print(n[i]+n[j]+n[k])\r\n exit()\r\nprint('NO')", " \r\ninp=input()\r\n\r\nln=len(inp)\r\n\r\na=-8\r\nhobe=0\r\n\r\nfor i in range (0, 130):\r\n a=a+8\r\n string = str(a)\r\n lnstr=len(string)\r\n k=0\r\n for j in range (0, ln):\r\n if (inp[j]== string[k]):\r\n j=j+1\r\n k=k+1\r\n if (k==len(string)):\r\n break\r\n \r\n if (k==len(string)):\r\n hobe=1\r\n print(\"YES\")\r\n print(a)\r\n break\r\n if (a>=int(inp)):\r\n break\r\n \r\nif (hobe==0):\r\n print(\"NO\")\r\n \r\n \r\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\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n'''\r\ndef solve():\r\n s = I().strip()\r\n valid = set(range(0, 1000, 8))\r\n singles = defaultdict(list)\r\n\r\n for i in range(len(s)):\r\n if int(s[i]) in valid:\r\n print('YES')\r\n print(s[i])\r\n return\r\n\r\n for a in singles:\r\n for b in singles[a]:\r\n if int(a + b + s[i]) in valid:\r\n print('YES')\r\n print(a + b + s[i])\r\n return\r\n \r\n for single in singles:\r\n if int(single + s[i]) in valid:\r\n print('YES')\r\n print(single + s[i])\r\n return\r\n \r\n for k in singles:\r\n singles[k].append(s[i])\r\n if s[i] not in singles:\r\n singles[s[i]] = []\r\n print('NO')\r\n\r\nsolve()", "x = input()\r\nans = 'null'\r\nfor a in range(len(x)):\r\n if int(x[a]) % 8 == 0:\r\n ans = x[a]\r\nfor a in range(len(x)):\r\n for b in range(a + 1, len(x)):\r\n if x[a] != '0':\r\n if int(x[a] + x[b]) % 8 == 0:\r\n ans = x[a] + x[b]\r\nfor a in range(len(x)):\r\n for b in range(a + 1, len(x)):\r\n for c in range(b + 1, len(x)):\r\n if x[a] != '0':\r\n if int(x[a] + x[b] + x[c]) % 8 == 0:\r\n ans = x[a] + x[b] + x[c]\r\nif ans == 'null':\r\n print('NO')\r\nelse:\r\n print(f'YES\\n{ans}')\r\n \r\n", "a=input()\r\nfor i in range(1000):\r\n\tif i%8==0:\r\n\t\tj=0\r\n\t\ts=str(i)\r\n\t\tfor k in range(len(a)):\r\n\t\t\tif a[k]==s[j]:\r\n\t\t\t\tj+=1\r\n\t\t\t\t#print(a[k],s[j])\r\n\t\t\tif j==len(s):\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tprint(i)\r\n\t\t\t\tquit()\r\n\t\t#\tprint(k,j)\r\n\t\t#print(i)\r\nprint(\"NO\")", "def main():\r\n s = input()\r\n n = len(s)\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n for k in range(j+1, n):\r\n if (100*int(s[i])+10*int(s[j])+int(s[k])) % 8 == 0:\r\n print(\"YES\")\r\n print(100*int(s[i])+10*int(s[j])+int(s[k]))\r\n return\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if (10*int(s[i]) + int(s[j])) % 8 == 0:\r\n print(\"YES\")\r\n print(10 * int(s[i]) + int(s[j]))\r\n return\r\n for i in range(n):\r\n if int(s[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(s[i])\r\n return\r\n\r\n print(\"NO\")\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def searchSub(num, div):\r\n idx = 0\r\n d = str(div)\r\n for digit in num:\r\n if digit == d[idx]:\r\n idx += 1\r\n if idx >= len(d):\r\n return True\r\n return False\r\n\r\nnum = input()\r\n\r\ndiv = [i for i in range(1000) if i%8 == 0]\r\n\r\nfor divisor in div:\r\n if searchSub(num, divisor):\r\n print(\"YES\")\r\n print(divisor)\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import re\r\n\r\n\r\ndef main():\r\n s = input()\r\n if '0' in s:\r\n print(\"YES\")\r\n print(0)\r\n return\r\n if '8' in s:\r\n print(\"YES\")\r\n print(8)\r\n return\r\n\r\n first_part_numbers = \"13579\"\r\n patterns_first_part = [\"12\", \"36\", \"44\", \"52\", \"76\", \"92\"]\r\n patterns_second_part = [\"16\", \"24\", \"32\", \"56\", \"64\", \"72\", \"96\"]\r\n for el in first_part_numbers:\r\n for patterns in patterns_first_part:\r\n if re.match(f\"\\\\d*{el}+\\\\d*{patterns[0]}+\\\\d*{patterns[1]}+\", s):\r\n print(\"YES\")\r\n print(el + patterns[0] + patterns[1])\r\n return\r\n for patterns in patterns_second_part:\r\n if re.match(f\"\\\\d*{patterns[0]}+\\\\d*{patterns[1]}+\", s):\r\n print(\"YES\")\r\n print(patterns[0] + patterns[1])\r\n return\r\n\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "MAXN = 105\r\n\r\ns = input().strip()\r\nn = len(s)\r\n\r\ndp = [[False] * 8 for _ in range(n)]\r\nprev = [[-1] * 8 for _ in range(n)]\r\n\r\ndp[0][int(s[0]) % 8] = True\r\n\r\nfor i in range(1, n):\r\n dp[i][int(s[i]) % 8] = True\r\n\r\n for j in range(8):\r\n if dp[i - 1][j]:\r\n dp[i][(j * 10 + int(s[i])) % 8] = True\r\n prev[i][(j * 10 + int(s[i])) % 8] = j\r\n\r\n dp[i][j] = True\r\n prev[i][j] = j\r\n\r\nfor i in range(n):\r\n if dp[i][0]:\r\n ans = \"\"\r\n cur_i = i\r\n cur_j = 0\r\n\r\n while True:\r\n if prev[cur_i][cur_j] == -1 or prev[cur_i][cur_j] != cur_j:\r\n ans += s[cur_i]\r\n\r\n if prev[cur_i][cur_j] == -1:\r\n break\r\n\r\n cur_j = prev[cur_i][cur_j]\r\n cur_i -= 1\r\n\r\n print(\"YES\")\r\n print(ans[::-1])\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = list(input().rstrip().decode())\r\nans = [\"NO\"]\r\nfor i in range(0, 1000, 8):\r\n u = list(str(i))\r\n k = 0\r\n for j in n:\r\n if u[k] == j:\r\n k += 1\r\n if k == len(u):\r\n break\r\n if k == len(u):\r\n ans = [\"YES\", str(i)]\r\n break\r\nsys.stdout.write(\"\\n\".join(ans))", "import re\r\ns=input()\r\nfor i in range(0,1000,8):\r\n if re.search('.*'.join(str(i)),s):print('YES\\n',i);quit()\r\nprint('NO')", "from sys import exit\r\ndef f(s, e):\r\n I=0\r\n for i in range(len(s)):\r\n if s[i]==e[I]:\r\n I+=1\r\n if I==len(e):\r\n return 1\r\n return 0\r\ns=input()\r\na=[str(i) for i in range(0, 1000, 8)]\r\nfor e in a:\r\n if f(s, e):\r\n print(\"YES\")\r\n print(e)\r\n exit()\r\nprint(\"NO\")", "t = input()\r\nn=len(t)\r\n\r\ndef find(t,n=len(t)):\r\n even=[]\r\n for i in range(n):\r\n if int(t[i])%2==0:\r\n even.append((t[i], i))\r\n if int(t[i])%8==0:\r\n return t[i]\r\n \r\n pair=[]\r\n for i in even:\r\n j=i[1]-1\r\n while j>=0:\r\n if int(t[j]+i[0])%4==0:\r\n pair.append((t[j]+i[0], j))\r\n if int(t[j]+i[0])%8==0:\r\n return t[j]+i[0]\r\n j-=1\r\n\r\n for i in pair:\r\n j=i[1]-1\r\n while j>=0:\r\n if int(t[j]+i[0])%8==0:\r\n return t[j]+i[0]\r\n j-=1\r\n return 1\r\n\r\ns=find(t)\r\nprint(\"YNEOS\"[s==1::2])\r\nif s!=1:\r\n print(s)", "n = input()\r\ndef div8(n):\r\n return int(n[-3:]) % 8 == 0\r\n\r\ndef two(n):\r\n for i in range(len(n)):\r\n for j in range(i + 1, len(n)):\r\n if div8(n[i] + n[j]):\r\n return n[i] + n[j]\r\n\r\ndef three(n):\r\n for i in range(len(n)):\r\n for j in range(i + 1, len(n)):\r\n for k in range(j + 1, len(n)):\r\n if div8(n[i] + n[j] + n[k]):\r\n return n[i] + n[j] + n[k]\r\n \r\n\r\nif div8(n):\r\n print(\"YES\")\r\n print(n)\r\n \r\nelif '8' in n:\r\n print(\"YES\")\r\n print(8)\r\n\r\nelif '0' in n:\r\n print(\"YES\")\r\n print(0)\r\n\r\nelse:\r\n ans = two(n)\r\n if ans is None:\r\n ans = three(n)\r\n if ans is None:\r\n print('NO')\r\n else:\r\n print('YES')\r\n print(ans)\r\n else:\r\n print('YES')\r\n print(ans)\r\n", "def check():\r\n n=input()\r\n if int(n)%8==0:\r\n print(\"YES\")\r\n print(n)\r\n return\r\n if \"0\" in n:\r\n print(\"YES\")\r\n print(\"0\")\r\n return\r\n if \"8\" in n:\r\n print(\"YES\")\r\n print(\"8\")\r\n return\r\n l = []\r\n for i in range(16,1000,8):\r\n if i%8==0:\r\n l.append(i)\r\n for x in l:\r\n c=0\r\n sx=str(x)\r\n for i in n:\r\n if i == sx[c]:\r\n c+=1\r\n if c == len(sx):\r\n print(\"YES\")\r\n print(x)\r\n return\r\n \r\n print(\"NO\") \r\ncheck()", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\na = [int(x) for x in input().decode().strip()]\r\nn = len(a)\r\n\r\ndp = [[-n] * 8 for _ in range(n + 1)]\r\ndp[0][0] = 0\r\nfor i in range(n) :\r\n for j in range(8) :\r\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\r\n newj = (j * 10 + a[i]) % 8\r\n dp[i + 1][newj] = max(dp[i + 1][newj], dp[i][j] + 1)\r\n\r\nif dp[n][0] == 0 :\r\n print(\"NO\")\r\nelse :\r\n answer = []\r\n i, j = n, 0\r\n while i != 0 :\r\n if dp[i][j] != dp[i - 1][j] :\r\n answer.append(a[i - 1])\r\n for oldj in range(8) :\r\n if j == (oldj * 10 + a[i - 1]) % 8 and dp[i][j] == dp[i - 1][oldj] + 1 :\r\n j = oldj\r\n break\r\n\r\n i -= 1\r\n\r\n while len(answer) > 1 and answer[-1] == 0 :\r\n answer.pop()\r\n\r\n print(\"YES\")\r\n print(''.join(str(x) for x in answer[::-1]))\r\n", "def solve():\n n = input()\n if '8' in n:\n print('YES\\n8')\n return\n if '0' in n:\n print('YES\\n0')\n return\n\n N = len(n)\n pos = {}\n digits = '123456789'\n for d in digits:\n try:\n pos[d] = n.index(d)\n except:\n pass\n\n muls2 = set([8*k for k in range(2, 13)])\n for i in range(N-1):\n for j in range(i+1, N):\n if int(n[i]+n[j]) in muls2:\n print('YES')\n print(n[i]+n[j])\n return\n\n muls = {d: set() for d in digits}\n for k in range(13, 125):\n mul = str(k * 8)\n muls[mul[0]].add(mul[1:])\n\n for d in digits:\n if d not in pos or pos[d]+1 > N-2:\n continue\n for i in range(pos[d]+1, N-1):\n for j in range(i+1, N):\n if n[i]+n[j] in muls[d]:\n print('YES')\n print(d+n[i]+n[j])\n return\n\n print('NO')\n\nsolve()", "s = input()\r\nif len(s) == 1:\r\n if int(s) % 8 == 0:\r\n print(\"YES\")\r\n print(s)\r\n exit(0)\r\nelif len(s) == 2:\r\n if int(s) % 8 == 0:\r\n print(\"YES\")\r\n print(s)\r\n exit(0)\r\n elif s[0] == '0' or s[1] == '0':\r\n print(\"YES\")\r\n print(0)\r\n exit(0)\r\n elif s[0] == '8' or s[1] == '8':\r\n print(\"YES\")\r\n print(8)\r\n exit(0)\r\nfor i in range(len(s) - 1, 1, -1):\r\n for j in range(i - 1, 0, -1):\r\n for k in range(j - 1, -1, -1):\r\n if s[i] == '8' or s[j] == '8' or s[k] == '8':\r\n print(\"YES\")\r\n print(8)\r\n exit(0)\r\n elif s[i] == '0' or s[j] == '0' or s[k] == '0':\r\n print(\"YES\")\r\n print(0)\r\n exit(0)\r\n elif int(s[j] + s[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(s[j] + s[i])\r\n exit(0)\r\n elif int(s[k] + s[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(s[k] + s[i])\r\n exit(0)\r\n elif int(s[k] + s[j]) % 8 == 0:\r\n print(\"YES\")\r\n print(s[k] + s[j])\r\n exit(0)\r\n elif int(s[k] + s[j] + s[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(s[k] + s[j] + s[i])\r\n exit(0)\r\nprint(\"NO\")", "def helper(x):\r\n i,j=0,0\r\n while i<len(n) and j<len(x):\r\n if n[i]==x[j]:\r\n i+=1\r\n j+=1\r\n else:i+=1\r\n if j==len(x):return True\r\n return False\r\ndef solve():\r\n for x in a:\r\n if helper(str(x)):return (\"YES\",x)\r\n return (\"NO\",-1)\r\n \r\nimport sys\r\ninput=sys.stdin.readline\r\n\r\nn=input().rstrip()\r\n\r\na=[x for x in range(1000) if x%8==0]\r\nver,num=solve()\r\nif ver=='YES':\r\n print(ver)\r\n print(num)\r\nelse:print(\"NO\")", "def has_letters_in_order(string1, string2):\r\n \r\n\r\n # Initialize pointers for both strings\r\n ptr1, ptr2 = 0, 0\r\n\r\n # Iterate through the characters of string1\r\n while ptr1 < len(string1) and ptr2 < len(string2):\r\n # If the characters match, move both pointers\r\n if string1[ptr1] == string2[ptr2]:\r\n ptr1 += 1\r\n # Move only the pointer for string2\r\n ptr2 += 1\r\n\r\n # If ptr1 reached the end, it means all letters in string1 appear in order in string2\r\n return ptr1 == len(string1)\r\n\r\n\r\n\r\ns=input()\r\nl=['0', '8', '16', '24', '32', '40', '48', '56', '64', '72', '80', '88', '96', '104', '112', '120', '128', '136', '144', '152', '160', '168', '176', '184', '192', '200', '208', '216', '224', '232', '240', '248', '256', '264', '272', '280', '288', '296', '304', '312', '320', '328', '336', '344', '352', '360', '368', '376', '384', '392', '400', '408', '416', '424', '432', '440', '448', '456', '464', '472', '480', '488', '496', '504', '512', '520', '528', '536', '544', '552', '560', '568', '576', '584', '592', '600', '608', '616', '624', '632', '640', '648', '656', '664', '672', '680', '688', '696', '704', '712', '720', '728', '736', '744', '752', '760', '768', '776', '784', '792', '800', '808', '816', '824', '832', '840', '848', '856', '864', '872', '880', '888', '896', '904', '912', '920', '928', '936', '944', '952', '960', '968', '976', '984', '992', '1000']\r\nfor i in l:\r\n if len(i)<=len(s) and has_letters_in_order(i,s):\r\n print(\"YES\")\r\n print(i)\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "import math\r\n\r\nn = input()\r\n\r\nfn = False\r\nfor i in range(len(n) - 1, -1, -1):\r\n if int(n[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(n[i])\r\n break\r\n for j in range(i - 1, -1, -1):\r\n if int(n[j] + n[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(n[j] + n[i])\r\n fn = True\r\n break\r\n for k in range(j - 1, -1, -1):\r\n if int(n[k] + n[j] + n[i]) % 8 == 0:\r\n print(\"YES\")\r\n print(n[k] + n[j] + n[i])\r\n fn = True\r\n break\r\n if fn:\r\n break\r\n if fn:\r\n break\r\nelse:\r\n print(\"NO\")\r\n ", "def f(w, s):\r\n i = 0\r\n for el in s:\r\n if el == w[i]:\r\n i += 1\r\n if len(w) == i:\r\n return True\r\n return False\r\n\r\ns = input()\r\nans = False\r\nfor i in range(0, 1000, 8):\r\n w = str(i)\r\n if f(w, s):\r\n print(\"YES\")\r\n print(w)\r\n ans = True\r\n break\r\nif not ans:\r\n print(\"NO\")\r\n", "s = \"00\" + input()\r\nl = len(s)\r\nfor i in range(l):\r\n\tfor j in range(i + 1, l):\r\n\t\tfor k in range(j + 1, l):\r\n\t\t\tans = s[i] + s[j] + s[k]\r\n\t\t\tif (int(ans) % 8 == 0):\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tprint(int(ans))\r\n\t\t\t\texit()\r\nprint(\"NO\")", "n = input()\r\ngood_nums = []\r\nfor i in range(16, 100, 8):\r\n good_nums.append(((i // 10) % 10, (i % 10)))\r\nfor i in range(104, 1000, 8):\r\n good_nums.append((((i // 100) % 10), ((i // 10) % 10), (i % 10)))\r\nres = False\r\nfor i in good_nums:\r\n places = []\r\n for k, v in enumerate(i):\r\n places.append(n.find(str(v), (places[k - 1] + 1 if k > 0 else 0)))\r\n if all([j != -1 for j in places]) and all([True] + [places[j + 1] > places[j] for j in range(0, len(places) - 1)]):\r\n print('YES')\r\n print(*i, sep='')\r\n res = True\r\n break\r\nif not res:\r\n if n.count('8') > 0:\r\n print('YES\\n8')\r\n elif n.count('0') > 0:\r\n print('YES\\n0')\r\n else:\r\n print('NO')\r\n", "val = input()\r\nval = \"00\" + val\r\nl = len(val)\r\nfor i in range(l):\r\n\tfor j in range(i + 1, l):\r\n\t\tfor k in range(j + 1, l):\r\n\t\t\tans = val[i] + val[j] + val[k]\r\n\t\t\tif (int(ans) % 8 == 0):\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tprint(int(ans))\r\n\t\t\t\texit()\r\nprint(\"NO\")", "n = list(input())\r\nf = 0\r\ns = len(n)\r\nfor i in range (0, s):\r\n\tif f == 1:\r\n\t\tbreak\r\n\tif (int(n[i])) % 8 == 0:\r\n\t\tprint (\"YES\")\r\n\t\tprint (n[i])\r\n\t\tf = 1\r\n\t\tbreak\r\n\tfor j in range (i + 1, s):\r\n\t\tif f == 1:\r\n\t\t\tbreak\r\n\t\tif (int(n[i]) * 10 + int(n[j])) % 8 == 0:\r\n\t\t\tprint (\"YES\")\r\n\t\t\tprint (n[i], end = \"\")\r\n\t\t\tprint (n[j])\r\n\t\t\tf = 1\r\n\t\t\tbreak\r\n\t\tfor k in range (j + 1, s):\r\n\t\t\tif (int(n[i]) * 100 + int(n[j]) * 10 + int (n[k])) % 8 == 0:\r\n\t\t\t\tprint (\"YES\")\r\n\t\t\t\tprint (n[i], end = \"\")\r\n\t\t\t\tprint (n[j], end = \"\")\r\n\t\t\t\tprint (n[k])\r\n\t\t\t\tf = 1\r\n\t\t\t\tbreak\r\nif f == 0:\r\n\tprint (\"NO\")", "s = input()\r\n\r\nif s.count('0') > 0:\r\n print('YES')\r\n print(0)\r\n exit(0)\r\nif s.count('8') > 0:\r\n print('YES')\r\n print(8)\r\n exit(0)\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s)):\r\n for k in range(j + 1, len(s)):\r\n x = int(s[i] + s[j] + s[k])\r\n if x % 8 == 0:\r\n print('YES')\r\n print(x)\r\n exit(0)\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s)):\r\n x = int(s[i] + s[j])\r\n if x % 8 == 0:\r\n print('YES')\r\n print(x)\r\n exit(0)\r\nprint('NO')", "import re\r\n\r\n\r\ndef d8(s):\r\n if re.search(\"8\", s):\r\n return 8\r\n return 0\r\n\r\n\r\ndef dab(s):\r\n for x in range(10, 100):\r\n if x % 8 != 0:\r\n continue\r\n a, b = x // 10, x % 10\r\n if re.search(f\"{a}.*{b}\", s):\r\n return x\r\n return 0\r\n\r\n\r\ndef dabc(s):\r\n for x in range(100, 1000):\r\n if x % 8 != 0:\r\n continue\r\n a, b, c = x // 100, (x // 10) % 10, x % 10\r\n if re.search(f\"{a}.*{b}.*{c}\", s):\r\n return x\r\n return 0\r\n\r\n\r\ns = input()\r\nif '0' in s:\r\n print(\"YES\")\r\n print(0)\r\nelse:\r\n b = d8(s) or dab(s) or dabc(s)\r\n if b:\r\n print(\"YES\")\r\n print(b)\r\n else:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nn=int(s)\r\n\r\nif len(s)>3:\r\n if n%8==0:\r\n print(\"YES\")\r\n print(n)\r\n else:\r\n v=\"00\" + s +\"77\"\r\n flag=False\r\n\r\n for i in range(len(v)-2):\r\n for j in range(i+1,len(v)-1):\r\n for k in range(j+1,len(v)):\r\n if int(v[i]+ v[j] + v[k])%8==0:\r\n print(\"YES\")\r\n print(int(v[i]+v[j]+v[k]))\r\n \r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n if not flag:\r\n print(\"NO\")\r\nelif len(s)==1:\r\n if n==0 or n==8:\r\n print(\"YES\")\r\n print(n)\r\n else:\r\n print(\"NO\")\r\nelif len(s)==2:\r\n if n%8==0:\r\n print(\"YES\")\r\n print(n)\r\n else:\r\n if s[0]=='8' :\r\n print(\"YES\")\r\n print(s[0])\r\n elif s[0]=='0':\r\n print(\"YES\")\r\n print(s[0])\r\n elif s[1]=='8' :\r\n print(\"YES\")\r\n print(s[1])\r\n elif s[1]=='0':\r\n print(\"YES\")\r\n print(s[1])\r\n else:\r\n print(\"NO\")\r\nelif len(s)==3:\r\n if n%8==0:\r\n print(\"YES\")\r\n print(n)\r\n else:\r\n map=False\r\n s=\"0\"+s\r\n for i in range(len(s)-1):\r\n for j in range(i+1,len(s)):\r\n if int(s[i]+s[j])%8==0:\r\n print(\"YES\")\r\n print(int(s[i]+s[j]))\r\n map=True\r\n break\r\n if map==True:\r\n break\r\n if map==False:\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\t", "s = input()\r\n\r\nf = False\r\n\r\nfor i in range(0, 1000, 8):\r\n si = str(i)\r\n d = 0\r\n\r\n for j in s:\r\n if d == len(si):\r\n break\r\n if si[d] == j:\r\n d += 1\r\n if d == len(si):\r\n f = True\r\n break\r\n\r\nif f:\r\n print(\"YES\")\r\n print(i)\r\nelse:\r\n print(\"NO\")" ]

[ "from collections import Counter\ns1=list(input())\ns2=list(input())\nc1=Counter(s1)\nc2=Counter(s2)\nflag=1\nfor ele in c2.keys():\n if ele==' ':\n continue\n if c2[ele]>c1[ele]:\n print(\"NO\")\n flag=0\n break\nif flag:\n print(\"YES\")", "newsP = input()\r\ns = input()\r\ncountN = [0]*(52)\r\ncountS = [0]*(52)\r\na = ord(\"a\")\r\nA = ord(\"A\")\r\nz = ord(\"z\")\r\nZ = ord(\"Z\")\r\nfor x in newsP:\r\n\tif(x == \" \"):\r\n\t\tcontinue\r\n\tif(ord(x) >= a and ord(x) <= z):\r\n\t\tcountN[ord(x) - a] += 1\r\n\telse:\r\n\t\tcountN[26 + ord(x)-A] += 1\r\n\r\nfor x in s:\r\n\tif(x == \" \"):\r\n\t\tcontinue\r\n\tif(ord(x) >= a and ord(x) <= z):\r\n\t\tcountS[ord(x) - a] += 1\r\n\telse:\r\n\t\tcountS[26 + ord(x)-A] += 1\r\n\r\nf = 1\r\nfor i in range(52):\r\n\tif(countS[i] > countN[i]):\r\n\t\tprint(\"NO\")\r\n\t\tf = 0\r\n\t\tbreak\r\n\r\nif f:\r\n\tprint(\"YES\")", "string = input()\r\ntext = input()\r\ntext = text.replace(\" \", \"\")\r\nstring = string.replace(\" \", \"\")\r\nflag = 0\r\nfor i in text:\r\n if text.count(i) > string.count(i):\r\n flag = 1\r\n break\r\n\r\nif flag == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from collections import defaultdict\n\nd = defaultdict(int)\ns1 = input()\ns2 = input()\n\nfor i in s1:\n d[i] += 1\n\nfor i in s2:\n if i != ' ':\n d[i] -= 1\n if d[i] < 0:\n print(\"NO\")\n exit()\nprint(\"YES\")\n", "text = input()\r\nletter = input()\r\n\r\ntext = text.replace(\" \", \"\")\r\nletter = letter.replace(\" \", \"\")\r\n\r\nnewText = []\r\n\r\nfor i in range(len(text)):\r\n\tnewText.append(text[i])\r\n\r\nout = \"NO\"\r\n\r\nfor i in range(len(letter)):\r\n\tits = \"NO\"\r\n\r\n\tfor x in range(len(newText)):\r\n\t\tif(letter[i] == newText[x]):\r\n\t\t\tnewText[x] = \"0\"\r\n\t\t\tits = \"YES\"\r\n\t\t\tbreak\r\n\r\n\t\tif(x == (len(newText) - 1) and its == \"NO\"):\r\n\t\t\tout = \"YES\"\r\n\t\t\tbreak\r\n\r\n\tif(out == \"YES\"):\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\r\nif(out == \"NO\"):\r\n\tprint(\"YES\")", "a = ''.join(input().split())\r\nb = ''.join(input().split())\r\nc = set(list(b))\r\nq = True\r\nfor _ in c:\r\n if b.count(_) > a.count(_):\r\n q = False\r\nif q:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main():\n dict = {}\n first = input()\n second = input()\n for char in first:\n if char != ' ':\n if char not in dict:\n dict[char] = 1\n else:\n dict[char] += 1\n not_found = False\n for char in second:\n if char != ' ':\n if char not in dict or dict[char] == 0:\n not_found = True\n else:\n dict[char] -= 1\n if not_found:\n print(\"NO\")\n else:\n print(\"YES\")\nmain()\n", "from collections import Counter\n\ns1 = input()\ns2 = input()\n\nd1 = Counter(s1)\nd2 = Counter(s2)\n\nflag = True\n\nfor i in s2:\n\tif(i == ' '):\n\t\tcontinue\n\tif i not in d1:\n\t\tflag = False\n\t\tbreak\n\telse:\n\t\tif(d1[i] <= 0):\n\t\t\tflag = False\n\t\t\tbreak\n\t\telse:\n\t\t\td1[i] -= 1\n\nif(flag == True):\n\tprint('YES')\nelse:\n\tprint('NO')", "def removeSpace(x):\n res = \"\"\n for _ in range(len(x)):\n if x[_] != \" \":\n res += x[_]\n return res\n\nstring1 = sorted(removeSpace(input()))\nstring2 = sorted(removeSpace(input()))\n\ntemp = 0\ncount = len(string2)\nfor i in range(count):\n if string2[i] in string1:\n string1.remove(string2[i])\n temp += 1\n\nif temp == count:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "from collections import Counter\r\n\r\nfirst = Counter(input())\r\nsecond = Counter(input())\r\n\r\nbr = True\r\nfor i in second.keys():\r\n if i == ' ':\r\n continue\r\n\r\n if second[i] > first[i]:\r\n print(\"NO\")\r\n br = False\r\n break\r\n\r\nif br:\r\n print(\"YES\")\r\n", "s1 = str(input())\r\ns2 = str(input())\r\ntmp1 = ''\r\nfor i in s1:\r\n if i != ' ':\r\n tmp1 += i\r\ntmp2 = ''\r\nfor i in s2:\r\n if i != ' ':\r\n tmp2 += i\r\nfor i in tmp2:\r\n if tmp2.count(i) > tmp1.count(i):\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "# @Chukamin ICPC_TRAIN\n\ndef main():\n have = input()\n have_letter = {}\n for letter in have:\n if letter in have_letter:\n have_letter[letter] += 1\n else:\n have_letter[letter] = 1\n aim = input()\n size = len(aim)\n flag = 0\n for i in range(size):\n if aim[i] != ' ':\n if (aim[i] not in have_letter) or (have_letter[aim[i]] == 0):\n flag = 1\n break\n else:\n have_letter[aim[i]] -= 1\n if flag:\n print('NO')\n else:\n print('YES')\nif __name__ == '__main__':\n main()\n\n \t \t \t \t\t \t\t \t\t\t\t\t \t\t\t \t", "def solve():\r\n s = input()\r\n t = input()\r\n\r\n cnt = [0] * 200\r\n for c in s:\r\n if c == ' ':\r\n continue\r\n a = ord(c)\r\n cnt[a] += 1\r\n\r\n for c in t:\r\n if c == ' ':\r\n continue\r\n a = ord(c)\r\n if cnt[a] > 0:\r\n cnt[a] -= 1\r\n else:\r\n print(\"NO\")\r\n return\r\n\r\n print(\"YES\")\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n solve()\r\n", "s1 = input().replace(\" \", \"\")\r\ns2 = input().replace(\" \", \"\")\r\n\r\nval = \"YES\"\r\nfor s2_i in s2:\r\n if s2_i not in s1:\r\n val = \"NO\"\r\n else:\r\n s1 = s1.replace(s2_i, \"\", 1)\r\n\r\nprint(val)", "s1 = input()\r\ns2 = input()\r\n\r\na = [0] * 26\r\nb = [0] * 26\r\n\r\nfor i in s1:\r\n\tif i != \" \":\r\n\t\tif ord(i) < 97:\r\n\t\t\ta[ord(i) - 65] += 1\r\n\t\telse:\r\n\t\t\tb[ord(i) - 97] += 1\r\n\r\nfor i in s2:\r\n\tif i != \" \":\r\n\t\tif ord(i) < 97:\r\n\t\t\ta[ord(i) - 65] -= 1\r\n\t\telse:\r\n\t\t\tb[ord(i) - 97] -= 1\r\n\r\nflag = 0\r\nfor i in range(26):\r\n\tif a[i] < 0 or b[i] < 0:\r\n\t\tflag = 1\r\n\r\nif flag == 1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "s = input() # list(map(str, input().split(' ')))\r\nline = input() # list(map(str, input().split(' ')))\r\nwords = dict()\r\nletters = dict()\r\nans = 'YES'\r\nfor i in s:\r\n if i == ' ':\r\n continue\r\n if i not in words:\r\n words[i] = 1\r\n else:\r\n words[i] += 1\r\nfor i in line:\r\n if i == ' ':\r\n continue\r\n if i not in letters:\r\n letters[i] = 1\r\n else:\r\n letters[i] += 1\r\n\r\nfor i in letters:\r\n if i not in words or words[i] < letters[i]:\r\n ans = 'NO'\r\n\r\nprint(ans)", "m=input()\r\nn=input()\r\nls1=list(m.split(\" \"))\r\nindex3=\"\".join(ls1)\r\nls2=list(n.split(\" \"))\r\nindex4=\"\".join(ls2)\r\nx=0\r\nfor i in index4:\r\n if index3.count(i)>=index4.count(i):\r\n x=x+1\r\nif x==len(index4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\ntext = input()\n\nheaders = {}\nfor char in s:\n try: headers[char] += 1\n except: headers[char] = 0\n\nfor char in text:\n if char == ' ': continue\n\n if char in headers:\n if headers[char] >= 0:\n headers[char] -= 1\n else:\n print('NO')\n exit()\n else:\n print('NO')\n exit()\n\nprint('YES')", "a = input()\nb = input()\nc = [0]*56\nd = [0]*56\nfor i in range(len(a)):\n if a[i] != 32:\n if 'A' <= a[i] <= 'Z':\n c[ord(a[i])-65] = c[ord(a[i])-65] + 1\n if 'a' <= a[i] <= 'z':\n c[ord(a[i])-97+26] = c[ord(a[i])-97+26] + 1\nfor i in range(len(b)):\n if b[i] != 32:\n if 'A' <= b[i] <= 'Z':\n d[ord(b[i])-65] = d[ord(b[i])-65] + 1\n if 'a' <= b[i] <= 'z':\n d[ord(b[i])-97+26] = d[ord(b[i])-97+26] + 1\n\ncheck = True\nfor i in range(len(c)):\n if d[i] != 0 and d[i] > c[i]:\n check = False\nif check is True:\n print('YES')\nelse:\n print('NO')\n\n", "s = input()\r\nd = {}\r\nfor i in s:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\ns2 = input()\r\nres = 'YES'\r\nfor i in s2:\r\n if i == ' ':\r\n continue\r\n if i in d:\r\n d[i] -= 1\r\n if d[i] == 0:\r\n del d[i]\r\n else:\r\n res = 'NO'\r\n break\r\nprint(res)", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n\ts1 = input()\n\ts2 = input()\n\tletters = {}\n\tflag = 1\n\tfor s in s1:\n\t\tif s not in letters:\n\t\t\tletters[s] = 0\n\t\tletters[s] += 1\n\tfor s in s2:\n\t\tif s not in letters:\n\t\t\tflag= 0\n\t\t\tbreak\n\t\telse:\n\t\t\tletters[s] -= 1\n\t\tif letters[s] < 0 and s != \" \":\n\t\t\tflag = 0\n\t\t\tbreak\n\tif flag == 1:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t\t\n", "s1 = input()\r\ns2 = input()\r\nans = \"YES\"\r\n\r\npaperLst = [0] * 52\r\noutLst = [0] * 52\r\nfor ch in s1:\r\n if ord(ch) >= 97:\r\n paperLst[ord(ch) - ord(\"a\")] += 1\r\n elif ord(ch) < 97 and ord(ch) != 32:\r\n paperLst[ord(ch) - ord(\"A\") + 26] += 1\r\n\r\nfor ch in s2:\r\n if ord(ch) >= 97:\r\n outLst[ord(ch) - ord(\"a\")] += 1\r\n elif ord(ch) < 97 and ord(ch) != 32:\r\n outLst[ord(ch) - ord(\"A\") + 26] += 1\r\n\r\nfor i in range (len(paperLst)):\r\n if paperLst[i] - outLst[i] < 0:\r\n ans = \"NO\"\r\n\r\nprint (ans)\r\n", "a = input()\nb = input()\nflag=0\narr,brr =[],[]\nfor i in a:\n if(i!=' '):\n arr.append(i)\nfor j in b:\n if(j!=' '):\n brr.append(j)\ncrr = list(set(brr))\nfor k in crr:\n if(brr.count(k)<=arr.count(k)):\n continue\n else:\n flag =1\n break\nans = \"YES\" if flag ==0 else \"NO\"\nprint(ans)\n\n \n\t \t \t \t \t\t\t \t\t \t \t\t\t\t \t", "from collections import Counter\r\n\r\nH, T = Counter(input().replace(' ', '')), Counter(input().replace(' ', ''))\r\nprint('NO' if T - H else 'YES')", "s1 = str(input())\r\ns2 = str(input())\r\nhash = {}\r\nf = True\r\nfor i in range(len(s2)):\r\n if s2[i] != ' ':\r\n if s2[i] not in s1:\r\n f = False\r\n break\r\n else:\r\n if s2[i] in hash:\r\n hash[s2[i]] += 1\r\n if s1.count(s2[i]) < hash[s2[i]]:\r\n f = False\r\n break\r\n else:\r\n hash[s2[i]] = 1\r\n if s1.count(s2[i]) < hash[s2[i]]:\r\n f = False\r\n break\r\nprint(\"YES\" if f else \"NO\")", "from collections import Counter\r\n\r\ns1 = input().replace(' ', '')\r\ns2 = input().replace(' ', '')\r\nres = 'YES'\r\n\r\nfor l in set(s2):\r\n if s2.count(l) > s1.count(l):\r\n res = 'NO'\r\n\r\nprint(res)", "import sys\r\ns1 = [i for i in ''.join(input().split())]\r\ns2 = [i for i in ''.join(input().split())]\r\n \r\nfor i in s2:\r\n if i in s1:\r\n s1.remove(i)\r\n continue\r\n else:\r\n print('NO')\r\n sys.exit(0)\r\nprint('YES')", "# Read in the newspaper heading and the letter text\ns1 = input().strip()\ns2 = input().strip()\n\n# Count the frequency of each letter in s1\nfreq = {}\nfor c in s1:\n if c.isalpha():\n freq[c] = freq.get(c, 0) + 1\n\n# Check if Vasya can write the letter\nfor c in s2:\n if c.isalpha():\n if c not in freq or freq[c] == 0:\n print(\"NO\")\n break\n freq[c] -= 1\nelse:\n print(\"YES\")\n\n \t\t \t\t \t\t\t\t \t\t\t \t \t\t", "def func():\n nwspr=list(map(str,input().split(' ')))\n txt=list(map(str,input().split(' ')))\n mp={}\n for word in nwspr:\n for e in word:\n mp[e]=mp.setdefault(e,0)+1\n for word in txt:\n for e in word:\n x = mp.setdefault(e,-1)\n if x <= 0: \n print(\"NO\")\n return\n else: mp[e] = mp[e]-1\n print('YES')\n\ndef init(flag=True):\n for _ in range(int(input()) if flag else 1):\n func()\n\nif __name__ == '__main__':\n init(False)", "from collections import defaultdict\r\nstrx=input()\r\ntext=input()\r\ndict1=defaultdict(int)\r\nfor l in strx:\r\n dict1[l]+=1\r\nfor l in text:\r\n if l.isalpha() and l in dict1 and dict1[l]!=0:\r\n dict1[l]-=1\r\n elif l.isalpha() and dict1[l]==0:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n\r\n\r\n", "from collections import Counter\r\ns1 = input()\r\ns2 = input()\r\ns1=s1.replace(\" \",\"\")\r\ns2=s2.replace(\" \",\"\")\r\n\r\ny = Counter(s1)\r\nz = Counter(s2)\r\n# print(s1)\r\n# print(s2)\r\nflag = 0\r\nfor word in z:\r\n x = z.get(word)\r\n a = y.get(word)\r\n if(a == None):\r\n flag=0\r\n break\r\n if a >= x:\r\n flag = 1\r\n else:\r\n flag = 0 \r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "t, s, o, sc, tc = input(), input(), True, {}, {}\nfor i in s:\n if i in sc: sc[i] += 1\n else: sc[i] = 1\nfor i in t:\n if i in tc: tc[i] += 1\n else: tc[i] = 1\nfor c in sc:\n if c == ' ': continue\n if not tc.get(c):\n o = False \n break\n elif sc[c] > tc[c]:\n o = False\n break\nprint('YES' if o else 'NO')\n\t\t \t\t\t\t \t \t \t \t\t\t \t\t \t", "org = list(input())\r\nwant = list(input())\r\nhas = True\r\nwhile \" \" in want:\r\n del(want[want.index(\" \")])\r\n\r\nfor k in want:\r\n if k in org:\r\n del(org[org.index(k)])\r\n else:\r\n has = False\r\n break\r\nif has:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-27 21:42:07\nLastEditTime: 2021-11-27 21:51:09\nDescription: Letter\nFilePath: CF43B.py\n'''\n\n\ndef func():\n s1 = input().strip()\n s2 = input().strip().replace(\" \", \"\")\n key = list(set(s2))\n count = list(map(lambda el: s2.count(el), key))\n for i in range(len(key)):\n if s1.count(key[i]) < count[i]:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n\n\nif __name__ == '__main__':\n func()\n", "from collections import Counter as C\r\ns1, s2 = C(input()), C(input().replace(' ', ''))\r\nfor i in s2:\r\n if s2[i] > s1.get(i, 0):\r\n print('NO'); exit()\r\nprint('YES')", "s1 = input()\r\ns2 = input()\r\n\r\ncounts = dict()\r\n\r\nfor i in s1:\r\n if i != ' ':\r\n if i in counts:\r\n counts[i] += 1\r\n else:\r\n counts[i] = 1\r\n\r\ngood = True\r\n\r\nfor i in s2:\r\n if i == ' ':\r\n continue\r\n if i in counts:\r\n if counts[i] > 0:\r\n counts[i] -= 1\r\n else:\r\n good = False\r\n break\r\n else:\r\n good = False\r\n break\r\n\r\nif good:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = input()\r\ns2 = input()\r\n\r\nfreq = [0]*(130)\r\n\r\nfor i in range(len(s1)):\r\n if s1[i] == ' ':\r\n continue\r\n\r\n freq[ord(s1[i])] += 1\r\n\r\nfor i in range(len(s2)):\r\n if s2[i] == ' ':\r\n continue\r\n if freq[ord(s2[i])] == 0:\r\n print(\"NO\")\r\n break\r\n else:\r\n freq[ord(s2[i])] -= 1\r\nelse:\r\n print(\"YES\") ", "heading = input()\r\ntext = input()\r\nprint('NO' if any(heading.count(letter) < text.count(letter) for letter in text if letter != ' ') else 'YES')", "s = input()\r\nh = input()\r\ncount = {}\r\nans = \"YES\"\r\nfor i in s :\r\n if(i != \" \") :\r\n if(i not in count) :\r\n count[i] = 1\r\n else :\r\n count[i] += 1\r\nfor i in h :\r\n if(i != \" \") :\r\n if(i not in count or count[i] == 0) :\r\n ans = \"NO\"\r\n break\r\n else :\r\n count[i] -= 1\r\nprint(ans)\r\n \r\n\r\n", "s=str(input())\r\nt=str(input())\r\ndict={}\r\ndic={}\r\nfor i in s:\r\n if i in dict and i !=' ':\r\n dict[i]+=1\r\n else:\r\n dict[i]=1\r\n\r\nfor i in t:\r\n if i in dic and i!=' ':\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\ncheck=True\r\nfor i in dic:\r\n if i not in dict:\r\n check=False\r\n elif dic[i]>dict[i]:\r\n check=False\r\nif check:\r\n print('YES')\r\nelse:\r\n print('NO')", "def func():\n from collections import Counter\n a = input()\n b = input()\n c = Counter(a)\n d = Counter(b).most_common()\n \n for char, x in d:\n if char == \" \":\n continue\n if x > c[char]:\n return False\n return True\n\nprint(\"YES\" if func() else \"NO\")", "from collections import Counter\r\n\r\ns1, s2 = input(), input()\r\n\r\nres, c1 = True, Counter(s1)\r\nfor c in s2:\r\n if c == \" \": continue\r\n c1[c] -= 1\r\n if c1[c] < 0: res = False; break\r\nprint(\"YES\" if res else \"NO\")", "a = input()\r\nb = input()\r\n\r\nfrom collections import Counter\r\n\r\ndef letter(a, b):\r\n a_arr = a.split()\r\n c = Counter()\r\n for word in a_arr:\r\n c += Counter(word)\r\n\r\n bc = Counter()\r\n b_arr = b.split()\r\n for word in b_arr:\r\n bc += Counter(word)\r\n\r\n return not bc - c\r\n\r\nres = letter(a, b)\r\n\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = input()\r\ns2 = input()\r\nd = dict()\r\nd[' '] = 2000\r\nflag = 0\r\nfor i in s1:\r\n if i != ' ' and i in d.keys():\r\n d[i] += 1\r\n elif i != ' ':\r\n d[i] = 1\r\nfor i in s2:\r\n if i not in d.keys():\r\n flag = 1\r\n elif d[i] - 1 >= 0:\r\n d[i] -= 1\r\n elif d[i] -1 < 0:\r\n flag = 1\r\n if flag:\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n", "from collections import namedtuple\r\ns=namedtuple(\"s\",\"s1,s2\")\r\nss=s((input()),\"\".join(input().replace(\" \",\"\")));c=0\r\nfor i in ss.s2:\r\n if ss.s2.count(i)<=ss.s1.count(i):c+=1\r\n else:break\r\nprint(\"YES\" if len(ss.s2)==c else \"NO\")", "s1=input();s2=input();r1=set(s1);r2=set(s2);d={}\r\nfor i in list(r2):\r\n\tif i!=' ':\r\n\t\td[i]=s2.count(i)\r\nfor i in d:\r\n\tif s1.count(i)>=d[i]:pass\r\n\telse:print('NO');break\r\nelse:print('YES')", "s = \"\".join(sorted(\"\".join(input().split())))\r\nt = \"\".join(sorted(\"\".join(input().split())))\r\n\r\n# print(s)\r\n# print(t)\r\nok = True\r\n\r\nu = set(t)\r\nfor i in u:\r\n if s.count(i) < t.count(i):\r\n ok = False\r\n\t\t\r\nif ok==True:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=''.join(input().split())\r\nb=''.join(input().split())\r\nc=set(list(b))\r\nq=True\r\nfor i in c:\r\n if b.count(i)>a.count(i):\r\n q=False\r\nif q:\r\n print('YES')\r\nelse:\r\n print('NO')", "string = list(input())\r\nletter = list(input())\r\nstring = list(filter(lambda x: x != ' ', string))\r\nletter = list(filter(lambda x: x != ' ', letter))\r\nd = {}\r\ngood = 0\r\nfor i in range(len(string)):\r\n if string[i] in d:\r\n d[string[i]] += 1\r\n else:\r\n d[string[i]] = 1\r\nfor i in range(len(letter)):\r\n if letter[i] in d and d[letter[i]] > 0:\r\n d[letter[i]] -= 1\r\n good += 1\r\nif good == len(letter):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\na=input()\r\na=a.split()\r\na=\"\".join(a)\r\na=list(a)\r\ns=s.split()\r\ns=\"\".join(s)\r\ns=list(s)\r\n\r\n#print(a)\r\n#print(s)\r\nfor i in range(len(a)):\r\n\tif(a[i] in s):\r\n\t\tp=s.index(a[i])\r\n\t\ts[p]=0\r\n\t\ta[i]=0\r\n#print(a)\t\t\r\nif(len(set(a))==1 and list(set(a))==[0]):\r\n\tprint(\"YES\")\r\nelse:\r\n print(\"NO\")\t", "a = list(input())\r\nb = list(input())\r\n\r\nd = {}\r\nfor i in range(len(a)):\r\n if a[i] == ' ':\r\n continue\r\n elif a[i] in d:\r\n d[a[i]] += 1\r\n else:\r\n d[a[i]] = 1\r\n\r\nc = {}\r\nfor i in range(len(b)): \r\n if b[i] == ' ':\r\n continue\r\n elif b[i] in c:\r\n c[b[i]] += 1\r\n else:\r\n c[b[i]] = 1\r\n\r\nfor elem in c:\r\n if elem == ' ':\r\n continue\r\n if not elem in d:\r\n print('NO')\r\n break\r\n elif c[elem] > d[elem]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "def solve(heading, sendText):\r\n\r\n hashMap = dict()\r\n\r\n for i in range(len(heading)):\r\n if heading[i] in hashMap:\r\n hashMap[heading[i]] += 1\r\n else:\r\n hashMap[heading[i]] = 1\r\n\r\n for i in range(len(sendText)):\r\n if sendText[i] not in hashMap:\r\n return \"NO\"\r\n elif sendText[i] in hashMap and sendText[i] != ' ':\r\n hashMap[sendText[i]] -= 1\r\n if hashMap[sendText[i]] < 0:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nif __name__ == \"__main__\":\r\n heading = input()\r\n sendText = input()\r\n print(solve(heading, sendText))", "S1 = input().strip()\r\nl = len(S1)\r\ntext = input().strip()\r\nct = 0\r\nfor i in text: \r\n if i != ' ': \r\n S1 = S1.replace(i,'',1)\r\n ct += 1\r\nif len(S1) == l-ct:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "from collections import Counter\r\ns1=input()\r\nd=Counter(s1)\r\ns2=input()\r\ns2=s2.replace(' ','')\r\nflag='YES'\r\nfor i in s2:\r\n if d[i]<=0:\r\n flag='NO'\r\n break\r\n else:\r\n d[i]-=1\r\nprint(flag)", "heading = input()\r\ntext = input()\r\nhDict = dict()\r\nfor letter in heading:\r\n if letter != \" \":\r\n if letter in hDict:\r\n hDict[letter] += 1\r\n else:\r\n hDict[letter] = 1\r\ntDict = dict()\r\nfor letter in text:\r\n if letter != \" \":\r\n if letter in tDict:\r\n tDict[letter] += 1\r\n else:\r\n tDict[letter] = 1\r\nans = \"YES\"\r\nfor letter in tDict:\r\n if letter not in hDict or hDict[letter] < tDict[letter]:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "import sys\r\nimport os\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 __perform_setup__():\r\n INPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/input.txt\"\r\n OUTPUT_FILE_PATH = \"/Users/osama/Desktop/Competitive Programming/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\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(s1, s2):\r\n counts_s1 = Counter()\r\n for word1 in s1.split(\" \"):\r\n for ch in word1:\r\n counts_s1[ch] += 1\r\n\r\n for word2 in s2.split(\" \"):\r\n for ch in word2:\r\n if not counts_s1[ch]:\r\n return False\r\n\r\n counts_s1[ch] -= 1\r\n\r\n return True\r\n\r\n\r\ns1 = read()\r\ns2 = read()\r\n\r\nprint(\"YES\" if solve(s1, s2) else \"NO\")\r\n", "from collections import defaultdict as dd\n\nhead_dic = dd(int)\ntext_dic = dd(int)\n\nhead = input()\ntext = input()\n\nfor i in head:\n if i != \" \":\n head_dic[i] += 1\nfor i in text:\n if i != \" \":\n text_dic[i] += 1\n\nflag = True\nfor x in text_dic:\n if head_dic[x] < text_dic[x]:\n flag = False\n break\n\nprint(\"YES\" if flag else \"NO\")\n", "l1 = list(input().replace(' ',''))\r\nl2 = list(input().replace(' ',''))\r\n#print(l1,l2)\r\nc=0\r\nfor i in l2:\r\n if i in l1:\r\n l1.remove(i)\r\n c=c+1\r\nif c==len(l2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import Counter\r\n#n = int(input())\r\n#n,m = map(int,input().split())\r\n#l = list(map(int,input().split()))\r\n#k = int(input())\r\n\r\ns = Counter(input())\r\nt = Counter(input())\r\ndel s[' ']\r\ndel t[' ']\r\n\r\nflag = True\r\nfor i in t:\r\n if s[i] < t[i]:\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n\r\n \r\n", "h=list(input())\r\ns=input()\r\n\r\nfor i in s :\r\n if i==\" \":\r\n continue\r\n s=0\r\n for j in range(len(h)):\r\n if i==h[j]:\r\n s=1\r\n h[j]=\" \"\r\n break\r\n if s==0:\r\n break\r\nif s==1 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1 = list(input())\r\ns2 = list(input())\r\nfor i in s2:\r\n\tif i==\" \":\r\n\t\tcontinue\r\n\tif i in s1:\r\n\t\ts1.remove(i)\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\na=list(input())\r\nb=list(input())\r\nd1=collections.Counter(a)\r\nd2=collections.Counter(b)\r\nc=1\r\nfor i in d2:\r\n if(d1[i]<d2[i] and i!=' '):\r\n c=0\r\n break\r\nif(c==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "mainStr, text, ans = input(), input(), 'YES'\r\ncont = {}\r\nfor item in mainStr:\r\n if item == ' ':\r\n continue\r\n if item in cont:\r\n cont[item] += 1\r\n else:\r\n cont[item] = 1\r\n\r\nfor item in text:\r\n if item == ' ':\r\n continue\r\n if item in cont and cont[item] > 0:\r\n cont[item] -= 1\r\n else:\r\n ans = \"NO\"\r\n break\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "s=input()\r\nt=input().replace(\" \",\"\")\r\nfor i in t:\r\n if i in s:\r\n s=s.replace(i,\"\",1)\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "\r\ndef remove(news, let):\r\n for i in range (len(news)):\r\n if news[i] == let:\r\n return news[0: i] + news[i+1: len(news)]\r\n\r\n\r\n\r\n\r\ndef main():\r\n news = input()\r\n letr = input()\r\n for i in range (len(letr)):\r\n if letr[i] != \" \":\r\n if letr[i] in news:\r\n news = remove(news, letr[i])\r\n else:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nprint(main())\r\n\r\n", "heading = input()\ntext = input()\n\nfor letter in text:\n if letter != ' ':\n if letter in heading:\n heading = heading.replace(letter, '', 1)\n else:\n print(\"NO\")\n exit()\nprint(\"YES\")\n\n", "'''\r\n 01234567\r\n'abcdZefg'\r\n'''\r\n'''\r\nMethod #1\r\n'''\r\n'''\r\ndef removeAt(s : str,i : int) -> str:\r\n return s[0:i] + s[i+1:]\r\n\r\n\r\nmainstr, text, ans = input(), input(), 'YES'\r\ntextlen = len(text)\r\n\r\nfor item in text:\r\n if item == ' ': continue\r\n if item in mainstr:\r\n ind = mainstr.index(item)\r\n mainstr = removeAt(mainstr,ind)\r\n else:\r\n ans = 'NO'\r\n break\r\nprint(ans)\r\n'''\r\n'''Method #2'''\r\n\r\nans ='YES'\r\nmyDict = dict()\r\nfor item in input():\r\n if item == ' ': continue\r\n\r\n if item not in myDict:\r\n myDict[item] = 1\r\n else:\r\n myDict[item] += 1\r\n\r\nfor item in input():\r\n if item == ' ': continue\r\n if item in myDict and myDict[item] > 0 :\r\n myDict[item] -= 1\r\n else:\r\n ans = 'NO'\r\n break\r\nprint(ans)\r\n\r\n\r\n", "import sys\r\nimport math\r\n \r\nst1 = (sys.stdin.readline()).split()\r\nst2 = sys.stdin.readline().split()\r\n\r\nd = dict()\r\nfor i in st1:\r\n for j in i:\r\n if j in d:\r\n d[j] += 1\r\n else:\r\n d[j] = 1\r\n \r\nfor i in st2:\r\n for j in i:\r\n if j in d:\r\n if(d[j] - 1 >= 0):\r\n d[j] -= 1\r\n else:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")\r\n \r\n ", "# https://codeforces.com/problemset/problem/43/B\r\n\r\n\"\"\"\r\nThe first line contains letters we can use\r\nThe second line contains letters we need to use\r\n\r\nDon't need to bother with spaces\r\n\"\"\"\r\n\r\nfrom collections import Counter\r\n\r\n\r\ndef main():\r\n heading = [letter for letter in input().strip().replace(' ', '')]\r\n text = [letter for letter in input().strip().replace(' ', '')]\r\n\r\n heading_letters = Counter(heading)\r\n text_letters = Counter(text)\r\n\r\n for letter, count in text_letters.items():\r\n if count > heading_letters.get(letter, 0):\r\n return False\r\n\r\n return True\r\n\r\n\r\nif __name__ == '__main__':\r\n if main():\r\n print('YES')\r\n else:\r\n print('NO')", "s1=input()\ns2=input()\na=[0 for i in range(256)]\nfor c in s1:\n if(c!=' '):\n a[ord(c)]+=1\nfor c in s2:\n if(c!=' '):\n a[ord(c)]-=1\nf = True\nfor i in a:\n if(i<0):\n f=False\nif(f):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "# import sys\r\n# sys.setrecursionlimit(10**7)\r\n# def input(): return sys.stdin.readline()[:-1]\r\n\r\n#####################################################\r\n###### COMMENT FIRST THREE LINS FOR CODEFORCES ######\r\n#####################################################\r\n\r\nmod = 10**9 + 7\r\ndef readInt():return int(input())\r\ndef readIntList():return list(map(int,input().split()))\r\ndef readStringList():return list(input())\r\ndef readStringListWithSpace():return list(input().split())\r\ndef readString():return input()\r\nfrom heapq import heappop,heappush,heapify\r\n\r\ndef execute():\r\n l1 = readString().split(\" \")\r\n l2 = readString().split(\" \")\r\n hmap,hmap2 = {},{}\r\n for v in l1: \r\n for val in v:\r\n if val in hmap : hmap[val] += 1\r\n else : hmap[val] = 1\r\n for v in l2:\r\n for val in v : \r\n if val in hmap2 : hmap2[val] += 1\r\n else : hmap2[val] = 1\r\n res = True\r\n for v in l2:\r\n for val in v :\r\n if val not in hmap or hmap2[val] > hmap[val]:\r\n res = False\r\n break\r\n if not res : break\r\n print(\"YES\") if res else print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n execute()", "from collections import Counter\r\n \r\n \r\ndef solution():\r\n c1 = Counter(input())\r\n c2 = Counter(input())\r\n for c in c2:\r\n if c != ' ' and c1[c] < c2[c]:\r\n print('NO')\r\n return\r\n print('YES')\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()", "title = input()\r\ncontent = input()\r\n\r\ndef count_char(arr):\r\n temp_array = [0]*128\r\n for i in range(len(arr)):\r\n indx = ord(arr[i])\r\n temp_array[indx] += 1\r\n return temp_array[65:123]\r\n\r\nflag = True\r\ntitle_count = count_char(title)\r\ncontent_count = count_char(content)\r\nfor i in range(len(title_count)):\r\n if title_count[i] < content_count[i]:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\na=input()\r\nb=input()\r\nc=Counter(a)\r\nd=Counter(b)\r\n# print(c,d)\r\nfor i in d.keys():\r\n if i==\" \":\r\n continue\r\n if i not in c.keys():\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if d[i]>c[i]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "s1=str(input())\r\ns2=str(input())\r\ns3=s2.replace(' ','')\r\n\r\ncount=0\r\nfor i in range(len(s3)):\r\n if s3[i] in s1:\r\n j=s1.index(s3[i])\r\n s1=s1[0:j]+s1[j+1:len(s1)]\r\n count+=1\r\n\r\nif count==len(s3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "s1=input()\r\ns2=input()\r\ndic={}\r\nfor i in range(len(s1)):\r\n if s1[i]==\" \":\r\n continue\r\n elif s1[i] not in dic:\r\n dic[s1[i]]=1\r\n else:\r\n dic[s1[i]]+=1\r\n\r\nboo=True\r\nfor i in range(len(s2)):\r\n if s2[i]==\" \":\r\n continue\r\n elif s2[i] not in dic:\r\n boo=False\r\n break\r\n else:\r\n dic[s2[i]]-=1\r\n if dic[s2[i]]==0:\r\n del dic[s2[i]]\r\nif boo:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def transfer(x):\r\n temp = []\r\n for i in range(len(x)):\r\n temp.append(x[i])\r\n return temp\r\ndef check_in(x,k):\r\n flag = False\r\n for i in x:\r\n if k == i:\r\n flag = True\r\n return flag\r\ndef remove_all_space(x):\r\n temp =[]\r\n for k in x:\r\n if k!=' ':\r\n temp.append(k)\r\n return temp\r\n#main\r\nx = input()\r\na = input()\r\nx = transfer(x)\r\na = transfer(a)\r\na = remove_all_space(a)\r\nflag = False\r\nflag = True\r\nfor k in a :\r\n if check_in(x,k) == True:\r\n del x[x.index(k)]\r\n else:\r\n flag = False\r\n break\r\nif flag == True:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s1=input()\r\ns2=input()\r\nd={}\r\nfor i in s1:\r\n if i!=' ':\r\n try:\r\n d[i]+=1\r\n except:\r\n d[i]=1\r\nflag=0\r\nfor i in s2:\r\n if i!=' ':\r\n try:\r\n if d[i]==0:\r\n flag=1\r\n break\r\n d[i]-=1\r\n except:\r\n flag=1\r\n break\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s1 = input()\r\ns2 = input()\r\n\r\nd1, d2 = {}, {}\r\nfor x in s1:\r\n if x != ' ':\r\n if x in d1:\r\n d1[x] += 1\r\n else:\r\n d1[x] = 1\r\nfor x in s2:\r\n if x != ' ':\r\n if x in d2:\r\n d2[x] += 1\r\n else:\r\n d2[x] = 1 \r\nisMatch = True\r\nfor x, c in d2.items():\r\n if x not in d1:\r\n isMatch = False\r\n break\r\n else:\r\n if c > d1[x]:\r\n isMatch = False\r\n break\r\nif isMatch:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n\ts1 = list(map(str, input().split()))\r\n\ts2 = list(map(str, input().split()))\r\n\r\n\ts1 = ''.join(s1)\r\n\ts2 = ''.join(s2)\r\n\r\n\tdic = {}\r\n\tfor i in range(len(s1)):\r\n\t\tif s1[i] not in dic:\r\n\t\t\tdic[s1[i]] = 1\r\n\t\telse:\r\n\t\t\tdic[s1[i]] += 1\r\n\r\n\tflag = True\r\n\tfor i in range(len(s2)):\r\n\t\tif s2[i] in dic:\r\n\t\t\tif dic[s2[i]] >= 1:\r\n\t\t\t\tdic[s2[i]] -= 1\r\n\t\t\telse:\r\n\t\t\t\tflag = False\r\n\t\telse:\r\n\t\t\tflag = False\r\n\r\n\tif flag:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "s1=input()\r\ns2=input()\r\nd1={}\r\nd2={}\r\nfor i in s1:\r\n if(i==' '):\r\n pass\r\n else:\r\n if(i not in d1):\r\n d1[i]=1\r\n else:\r\n d1[i]+=1\r\nfor i in s2:\r\n if(i==' '):\r\n pass\r\n else:\r\n if(i not in d2):\r\n d2[i]=1\r\n else:\r\n d2[i]+=1\r\nf=0\r\nfor i in d2:\r\n if((i not in d1) or (d1[i]<d2[i])):\r\n f=1\r\n break\r\nif(f==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "si=input()\r\nsi1=input()\r\ns=[]\r\ns1=[]\r\nfor i in si:\r\n if(i!=' '):\r\n s.append(i)\r\nfor i in si1:\r\n if(i!=' '):\r\n s1.append(i)\r\nflag=0\r\nf=0\r\nfor i in s1:\r\n for k,j in enumerate(s):\r\n if(i==j):\r\n s[k]='0'\r\n break\r\nfor i in s:\r\n if(i=='0'):\r\n f=f+1\r\nif(f==len(s1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "def break_string(string):\r\n d = {}\r\n for char in string:\r\n if char == \" \": continue\r\n if char not in d: d[char] = 0\r\n d[char] += 1\r\n return d\r\n\r\nd1 = break_string(input())\r\nd2 = break_string(input())\r\nflag = True\r\nfor char in d2:\r\n if char not in d1 or d1[char] < d2[char]:\r\n flag = False\r\n break_string\r\nif flag: print(\"YES\")\r\nelse: print(\"NO\")", "n=input().split()\r\nn1=input().split()\r\ns=0\r\nlst=[]\r\nlst1=[]\r\nfor i in n:\r\n for j in i:\r\n lst.append(j)\r\nfor k in n1:\r\n for l in k:\r\n lst1.append(l)\r\nfor x in lst1:\r\n for y in lst:\r\n if(x==y):\r\n lst.remove(y)\r\n s=s+1\r\n break\r\nif(len(lst1)==s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import Counter\nh = input()\nt = input()\n\nfreq = Counter(h)\nmsg = \"YES\"\nfor c in t:\n if c == ' ':\n continue\n if c in freq:\n freq[c] -= 1\n if freq[c] <= 0:\n del freq[c]\n else:\n msg = \"NO\"\nprint(msg)\n", "s1 = input()\r\ns2 = input()\r\n\r\nvisited = {}\r\nfor c in s1:\r\n if c == ' ':\r\n continue\r\n\r\n if not c in visited:\r\n visited[c] = 0\r\n visited[c] += 1\r\n\r\nfor c in s2:\r\n if c == ' ':\r\n continue\r\n\r\n if not c in visited or visited[c] == 0:\r\n print('NO')\r\n break\r\n visited[c] -= 1\r\nelse:\r\n print('YES')\r\n", "s1 = input()\ns2 = input()\n\nd = dict()\nfor x in s1:\n if x == ' ':\n continue\n\n if x not in d:\n d[x] = 0\n d[x] += 1\n\nfail = 0\n\nc = dict()\nfor x in s2:\n if x == ' ':\n continue\n\n if x not in c:\n c[x] = 0\n c[x] += 1\n\n if x not in d or c[x] > d[x]:\n fail = 1\n\nif fail:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n", "p=input()\r\np=p.replace('',' ')\r\np=p.split()\r\nq=input()\r\nq=q.replace('',' ')\r\nq=q.split()\r\nc=0\r\nfor i in q:\r\n if i not in p:\r\n c=1\r\n else:\r\n if q.count(i)>p.count(i):\r\n c=1\r\n if c==1:\r\n break\r\nif c==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import Counter\r\n\r\nS=input()\r\nT=input()\r\n\r\nC=Counter(S)\r\n\r\nfor t in T:\r\n if t==\" \":\r\n continue\r\n if t in C and C[t]>0:\r\n C[t]-=1\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "n=input()\r\np=input()\r\na=[0]*128\r\nb=[0]*128\r\nfor x in n:\r\n a[ord(x)]+=1\r\nfor y in p:\r\n b[ord(y)]+=1\r\nz=0\r\nf=0\r\nwhile z<128:\r\n if z==32:\r\n pass\r\n else:\r\n if b[z]<=a[z]:\r\n pass\r\n else:\r\n print(\"NO\")\r\n f=1\r\n break\r\n z+=1\r\nif f==0:\r\n print(\"YES\")", "s1 = input().strip()\r\ns2 = input()\r\npossible = []\r\nfor elements in s1:\r\n possible.append(elements)\r\nmarker = True\r\nfor i in s2.strip():\r\n if i == ' ':\r\n continue\r\n if i in possible:\r\n possible.pop(possible.index(i))\r\n else:\r\n marker = False\r\n print('NO')\r\n break\r\nif marker:\r\n print(\"YES\")", "s1 = list(input())\r\ns2 = list(input())\r\nli = [0]*57\r\nfor i in s1:\r\n if i != \" \":\r\n li[122-ord(i)-1] += 1\r\n\r\nfor i in s2:\r\n if i != \" \":\r\n e = li[122 - ord(i) - 1]\r\n if e == 0:\r\n print(\"NO\")\r\n exit(0)\r\n else:\r\n li[122-ord(i)-1] -= 1\r\n\r\nprint(\"YES\")\r\n", "from collections import Counter\r\n\r\nstr1 = input().replace(' ','')\r\nstr2 = input().replace(' ','')\r\nprint('YES' if not Counter(str2) - Counter(str1) else 'NO')", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef string_to_dict(s):\r\n d = dict()\r\n for c in s:\r\n if c.isalpha():\r\n if c not in d:\r\n d[c] = 0\r\n d[c] += 1\r\n return d\r\n\r\ndef solve(s, t):\r\n d1 = string_to_dict(s)\r\n d2 = string_to_dict(t)\r\n for k in d2:\r\n if k not in d1:\r\n return False\r\n if d1[k] < d2[k]:\r\n return False\r\n return True\r\n\r\ndef main():\r\n s = input()\r\n t = input()\r\n if solve(s, t):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s1=list(str(input()))\r\ns2=list(str(input()))\r\nwhile ' ' in s1:\r\n s1.remove(' ')\r\nwhile ' ' in s2:\r\n s2.remove(' ')\r\nactive=True\r\nd1={}\r\nfor a in s1:\r\n if a not in d1:\r\n d1[a]=1\r\n else:\r\n d1[a]+=1\r\nd2={}\r\nfor b in s2:\r\n if b not in d2:\r\n d2[b]=1\r\n else:\r\n d2[b]+=1\r\nfor key in d2.keys():\r\n if key not in d1:\r\n active=False\r\n break\r\n else:\r\n if d2[key]>d1[key]:\r\n active=False\r\n break\r\nif active==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\na = list(input())\r\n\r\n\r\nb =(input())\r\nh=0\r\n\r\nfor k in b:\r\n if k!=' ':\r\n if k in a:\r\n a.remove(k)\r\n else:\r\n print('NO')\r\n h+=1\r\n break\r\n\r\n\r\nif h==0:\r\n print('YES')\r\n", "from collections import Counter\r\n\r\nH, T = Counter(input().replace(' ', '')), Counter(input().replace(' ', ''))\r\nprint('NO' if any(T[ch] > H[ch] for ch in T) else 'YES')", "from collections import Counter\n\n\nclass CodeforcesTask43BSolution:\n def __init__(self):\n self.result = ''\n self.s1 = ''\n self.s2 = ''\n\n def read_input(self):\n self.s1 = input().replace(\" \", \"\")\n self.s2 = input().replace(\" \", \"\")\n\n def process_task(self):\n avail = Counter(self.s1)\n needed = Counter(self.s2)\n can = True\n for key in needed.keys():\n if key in avail:\n if avail[key] < needed[key]:\n can = False\n break\n else:\n can = False\n break\n self.result = \"YES\" if can else \"NO\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask43BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from collections import Counter\nexists = Counter(input())\nneeded = Counter(input())\nneeded[' '] = 0\nflag = True\nfor k in needed:\n\tif exists[k] < needed[k]:\n\t\tflag = False\nprint('YES' if flag else 'NO')\n", "s1=input()\r\ns2=input()\r\ndic1={}\r\ndic2={}\r\nfor i in s1:\r\n if i!=\" \":\r\n if i in list(dic1.keys()):\r\n dic1[i]+=1\r\n else:\r\n dic1[i]=1\r\nfor j in s2:\r\n if j!=\" \":\r\n if j in list(dic2.keys()):\r\n dic2[j]+=1\r\n else:\r\n dic2[j]=1\r\ncount=0\r\nfor k in list(dic2.keys()):\r\n if k in list(dic1.keys()):\r\n if dic2[k]>dic1[k]:\r\n print(\"NO\")\r\n count=1\r\n break\r\n else:\r\n count=1\r\n print(\"NO\")\r\n break\r\nif count==0:\r\n print(\"YES\")", "def ad(s,k):\r\n\t\"\"\"add to dict\"\"\"\r\n\ts.setdefault(k,0)\r\n\ts[k]+=1\r\n\t\r\ndef ip(s,t):\r\n\t\"\"\"is possible\"\"\"\r\n\tsd,td=dict(),dict()\r\n\tfor c in s:\r\n\t\tad(sd,c)\r\n\tfor c in t:\r\n\t\tad(td,c)\r\n\tfor k,v in td.items():\r\n\t\tif k not in sd or sd[k]<v:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\ns=input().replace(' ','')\r\nt=input().replace(' ','')\r\ns='YES' if ip(s,t) else 'NO'\r\nprint(s)", "import collections\r\ns = input()\r\ns1 = input()\r\nc1 = collections.Counter(s)\r\nc2 = collections.Counter(s1)\r\n\r\nfor i in c2:\r\n if i in c1:\r\n if s.count(i) < s1.count(i) and i != ' ' :\r\n \r\n print('NO')\r\n break\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[204]:\n\n\n# # n = int(input())\n# # line = list(map(int, input().split()))\n# # line = list(str(input()))\n\n\n# In[51]:\n\n\nfrom collections import Counter\n\n\n# In[66]:\n\n\nline1 = list(str(input()).replace(\" \", \"\"))\nline2 = list(str(input()).replace(\" \", \"\"))\n\n\n# In[67]:\n\n\nsrc_dict = Counter(line1)\nflag = False\n\n\n# In[68]:\n\n\nfor c in line2:\n if c not in src_dict or src_dict[c] == 0:\n flag = True\n break\n else:\n src_dict[c] -= 1\n \nif flag:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "b=input()\r\nw=input()\r\nv=[]\r\nflag=True\r\nfor i in b:\r\n if i==\"\" or i==\" \":\r\n continue\r\n else:\r\n v+=[i]\r\nfor j in w:\r\n if j==\"\" or j==\" \":\r\n continue\r\n elif j in v:\r\n v.remove(j)\r\n elif j not in v:\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\ngivenLetters = [0] * 55\r\nusedLetters = [0] * 55\r\nflag = 'YES'\r\n\r\n\r\ndef findPos(x):\r\n if 'a' <= x <= 'z':\r\n return ord(x) - ord('a')\r\n else:\r\n return ord(x) - ord('A') + 26\r\n\r\nfor i in a:\r\n if i != ' ':\r\n givenLetters[findPos(i)] += 1\r\n\r\nfor i in b:\r\n if i != ' ':\r\n usedLetters[findPos(i)] += 1\r\n\r\nfor i in range(52):\r\n if givenLetters[i] < usedLetters[i]:\r\n flag = 'NO'\r\n break\r\n\r\nprint(flag)\r\n", "h=''.join(list(map(str,input().split())))\r\ntext=''.join(list(map(str,input().split())))\r\nh_arr=[0]*256\r\n#text_arr=[0]*256\r\nfor i in h:\r\n h_arr[ord(i)]+=1\r\nflag=True\r\nfor i in text:\r\n h_arr[ord(i)]-=1\r\n if(h_arr[ord(i)]<0):\r\n flag=False\r\n break\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nb = list(input())\r\nd = {}\r\ndd = {}\r\nfor i in a:\r\n if i not in d and i!=' ':\r\n d[i] = 1\r\n elif i in d and i!=' ':\r\n d[i]+=1\r\nfor i in b:\r\n if i not in dd and i!=' ':\r\n dd[i] = 1\r\n elif i in dd and i!=' ':\r\n dd[i]+=1\r\n# print(d)\r\n# print(dd)\r\nl = list(d.keys())\r\nm = list(dd.keys())\r\n# print(l)\r\n# print(m)\r\nfor i in m:\r\n # print('w' in l)\r\n if i not in l:\r\n print('NO')\r\n # print(i)\r\n exit()\r\n elif dd[i] > d[i]:\r\n print('NO')\r\n # print(i)\r\n exit()\r\nprint('YES')", "# 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\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 heading = list(str(input.readline().rstrip('\\n')))\r\n spaces = []\r\n for i in range(len(heading)):\r\n if heading[i] == ' ':\r\n spaces.append(i)\r\n for i, x in enumerate(spaces):\r\n del heading[x-i]\r\n dic = {}\r\n for i, x in enumerate(heading):\r\n if x in dic:\r\n dic[x] += 1\r\n else:\r\n dic[x] = 1\r\n\r\n spaces = []\r\n text = list(str(input.readline().rstrip('\\n')))\r\n for i in range(len(text)):\r\n if text[i] == ' ':\r\n spaces.append(i)\r\n for i, x in enumerate(spaces):\r\n del text[x-i]\r\n ans = \"YES\"\r\n for x in text:\r\n if x in dic:\r\n if dic[x] > 0:\r\n dic[x]-=1\r\n else:\r\n ans = \"NO\"\r\n break\r\n else:\r\n ans = \"NO\"\r\n break\r\n\r\n output = ans\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", "'''input\nabcdefg hijk\nk j i h g f e d c b a\n'''\ns1, s2 = input().replace(\" \", \"\"), input().replace(\" \", \"\")\nif all(s1.count(l) >= s2.count(l) for l in set(s2)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def distribute(s):\r\n distribution = [-1]*256\r\n for l in s:\r\n if ord(l) == 32:\r\n continue\r\n if distribution[ord(l)] == -1:\r\n distribution[ord(l)] = 1\r\n else:\r\n distribution[ord(l)] += 1\r\n return distribution\r\n\r\ndef match(s, distribution):\r\n for l in s:\r\n if ord(l) == 32:\r\n continue\r\n if distribution[ord(l)] != -1:\r\n if distribution[ord(l)] == 1:\r\n distribution[ord(l)] = -1\r\n else:\r\n distribution[ord(l)] -= 1\r\n else:\r\n return False\r\n return True\r\ndef main():\r\n# input\r\n s1 = input()\r\n s2 = input()\r\n# proccessing\r\n distribution = distribute(s1)\r\n# output\r\n if match(s2, distribution):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__=='__main__':\r\n main()", "ref ={\"_\" :'_' ,\"a\": 0 , \"z\" :0 , \"e\" :0 , \"r\" : 0 ,\r\n \"t\" : 0 , \"y\" : 0 , \"u\" : 0 , \"i\": 0 , \"o\" : 0 , \"p\":0 ,\r\n \"q\" : 0 , \"s\" : 0 , \"d\" : 0 , \"f\" : 0, \"g\" : 0, \"h\" : 0, \"j\":0 ,\r\n \"k\" : 0 , \"l\" : 0 , \"m\" : 0 ,\"w\" : 0 , \"x\" : 0, \"c\" : 0 ,\"v\" : 0, \"b\" : 0,\"n\" : 0, \r\n \"A\":0 , \"Z\" : 0 , \"E\" :0 , \"R\" : 0,\"T\" : 0, \"Y\" : 0 ,\"U\" : 0, \"I\" : 0, \"O\" :0, \r\n \"P\" : 0 ,\"Q\" : 0 ,\"S\" : 0,\"D\" :0 , \"F\" : 0,\"G\" : 0, \"H\" : 0,\"J\" : 0,\"K\" : 0 , \"L\" : 0,\r\n \"M\" : 0 , \"W\" : 0 ,\"X\" : 0, \"C\" : 0 , \"V\" : 0 , \"B\" : 0 ,\"N\" : 0}\r\ns1 = input().replace(\" \" , \"_\") \r\ns2 = input().replace(\" \" , '_')\r\nflag =\"YES\"\r\nfor i in s1 : \r\n if ref[i] ==\"_\" : \r\n continue\r\n else: \r\n ref[i] += 1 \r\nfor i in s2 : \r\n if ref[i] ==\"_\" :\r\n continue\r\n elif ref[i] >0 : \r\n ref[i] -= 1 \r\n else:\r\n flag =\"NO\"\r\n break\r\nprint(flag)\r\n", "x = iter(sorted(''.join(input().split())))\r\ny = all(i in x for i in sorted(''.join(input().split())))\r\nprint([\"NO\",\"YES\"][y])", "#visited = [False for i in range(27)]\r\n#print(visited)\r\na = input()\r\nb = input()\r\nfor i in b:\r\n if i.isalpha():\r\n if b.count(i) > a.count(i):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "\n\n\n\nh = input()\ns = input()\n\nhfreq = {}\nsfreq = {}\n\nfor i in h:\n if i == \" \" :\n continue\n \n if i in hfreq:\n hfreq[i] += 1\n else:\n hfreq[i] = 1\n\nfor i in s:\n if i == \" \" :\n continue\n if i in sfreq:\n sfreq[i] += 1\n else:\n sfreq[i] = 1\n\n\nfor i in sfreq:\n if i not in hfreq:\n print('NO')\n exit()\n if sfreq[i] > hfreq[i]:\n print('NO')\n exit()\n\nprint('YES')\n\t \t\t \t\t \t \t \t\t \t \t \t\t", "t1 = input()\r\nt2 = input()\r\nt1 = [i for i in t1 if i != ' ']\r\nt2 = [i for i in t2 if i != ' ']\r\nfor i in t2:\r\n if i not in t1:\r\n print(\"NO\")\r\n break\r\n else:\r\n t1.remove(i)\r\nelse:\r\n print(\"YES\")", "s1 = input()\r\ns2 = input()\r\n\r\nfor i in range(len(s2)):\r\n if s2[i] == ' ':\r\n continue\r\n if s1.count(s2[i]) < s2.count(s2[i]):\r\n print('NO')\r\n exit()\r\nprint('YES')", "s1 = input()\r\ns2 = input()\r\na, b, c, d = [[\"\", 0]] * 26, [[\"\", 0] * 2] * 26, [[\"\", 0] * 2] * 26, [[\"\", 0] * 2] * 26\r\nflag=True\r\nfor i in range(65, 91):\r\n p = chr(i)\r\n if s1.count(p)<s2.count(p):\r\n flag=False\r\n if flag==False:\r\n break\r\n# print(flag)\r\nif flag==True:\r\n for i in range(97, 123):\r\n p = chr(i)\r\n if s1.count(p)<s2.count(p):\r\n # print(p,s1.count(p))\r\n # print(p,s2.count(p))\r\n # print(\"-------------------------------------\")\r\n flag=False\r\n if flag==False:\r\n break\r\nif flag==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\n\r\ndef f(s):\r\n m = {}\r\n for c in s:\r\n if c != ' ' and c != '\\n':\r\n if c in m:\r\n m[c] += 1\r\n else:\r\n m[c] = 1\r\n return m\r\n\r\ns1, s2 = sys.stdin.readline(), sys.stdin.readline()\r\nm1, m2, zhi = f(s1), f(s2), True\r\nfor char, quantity in m2.items():\r\n if not char in m1 or m1[char] < quantity:\r\n zhi = False\r\nprint(\"YES\" if zhi else \"NO\")", "s1 = list(input())\r\nletters = [x for x in s1]\r\nfor x in input():\r\n if x == ' ':\r\n continue\r\n if x not in letters:\r\n print('NO')\r\n exit(0)\r\n letters.remove(x)\r\nprint('YES')", "def letter(heading, text):\r\n dict={}\r\n for index, ch in enumerate(text):\r\n found=0\r\n for i, s in enumerate(heading):\r\n if i not in dict and ch==s:\r\n dict[i]=True\r\n found=1\r\n break\r\n if not found and ch!=' ':\r\n return \"NO\"\r\n return \"YES\"\r\nheading = str(input())\r\ntext = str(input())\r\nprint(letter(heading, text))\r\n \r\n \r\n ", "from collections import Counter\r\n\r\n\r\ns1 = input().split()\r\ns2 = input().split()\r\n\r\ncnt1 = Counter(\"\".join(s1))\r\ncnt2 = Counter(\"\".join(s2))\r\n\r\nfor char in cnt2:\r\n if cnt2[char] > cnt1[char]:\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")\r\n\r\n\r\n\r\n \r\n\r\n", "s1 = input()\r\ns2 = input()\r\n\r\ncnt = dict()\r\ncnt[\" \"]=99999999\r\nfor i in s1:\r\n if i not in cnt:\r\n cnt[i]=1\r\n else:\r\n cnt[i]+=1\r\nfor i in s2:\r\n if i not in cnt:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n if cnt[i]<=0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n cnt[i]-=1\r\nprint(\"YES\")\r\n", "def solve():\r\n s = input()\r\n t = input()\r\n st2 = set(t)\r\n dt1 = {-1:-1}\r\n for i in st2:\r\n if s.count(i) < t.count(i) and not i == \" \":\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n return\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "def solve(s1,s2):\r\n cs1 = {}\r\n for c in s1:\r\n if c!=' ':\r\n cs1[c] = cs1.get(c,0)+1\r\n for c in s2:\r\n if c!=' ':\r\n cs1[c] = cs1.get(c,0)-1\r\n #print(cs1)\r\n flg=0\r\n for cs in cs1:\r\n if cs1[cs]<0:\r\n flg=1\r\n break\r\n print('NO' if flg else 'YES')\r\n\r\nt = 1#int(input())\r\nwhile t:\r\n s1=input()\r\n s2=input()\r\n solve(s1,s2)\r\n t-=1\r\n", "heading = input()\r\ntext = input()\r\n\r\ncounts = {}\r\nfor ch in heading:\r\n if ch == ' ':\r\n continue\r\n if ch in counts:\r\n counts[ch]+=1\r\n else:\r\n counts[ch] = 1\r\n\r\n # print(ch)\r\nflag = False\r\nfor ch in text:\r\n if ch == \" \":\r\n continue\r\n if ch not in counts or counts[ch] == 0:\r\n flag = True\r\n break\r\n\r\n counts[ch] -= 1\r\n\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter;s = [Counter(input().replace(' ', '')) for i in range(2)];print('YES' if not s[1] - s[0] else 'NO')\n \t \t\t \t \t\t\t \t \t \t \t \t", "heading=input()\r\ntext=input()\r\nfreq=dict()\r\nl=len(text)\r\nfor i in heading:\r\n if i in freq.keys():\r\n freq[i]+=1\r\n else:\r\n freq[i]=1\r\n#print(freq)\r\noccur='True'\r\nfor i in range(l):\r\n #print(\"s[i]={}\".format(text[i]))\r\n if text[i] in freq.keys() and (freq[text[i]]>0 or text[i]==' '):\r\n freq[text[i]]-=1\r\n else:\r\n #print(\"i={}\".format(i))\r\n occur='False'\r\n break\r\nif(occur=='True'):\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\ns = input().replace(\" \",\"\")\r\ns2 = input().replace(\" \",\"\")\r\nflag = False\r\nfor i in s2:\r\n if s2.count(i)>s.count(i):\r\n flag = True\r\n break\r\nprint(\"NO\" if flag else \"YES\")\r\n", "import re\r\na = input()\r\nb = input()\r\nflag=1;\r\nfor c in b:\r\n if(c in a):\r\n a = re.sub(c,\" \",a ,1)\r\n else:\r\n flag = 0;\r\n break;\r\n\r\nif (flag==0): \r\n print(\"NO\");\r\nelse:\r\n print(\"YES\")\r\n", "n1=input()\r\nn1=list(n1)\r\nn2=input()\r\nn2=n2.replace(\" \",\"\")\r\nl=\"\"\r\nd=1\r\nfor i in range(len(n2)):\r\n if n2[i] in n1:\r\n l=l+n2[i]\r\n n1.remove(n2[i])\r\n else:\r\n d=0\r\nif d==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "h=input()\r\nl=input()\r\na=[0]*26\r\nb=[0]*26\r\nc=[0]*26\r\nd=[0]*26\r\nfor i in h:\r\n if(i.islower()):\r\n a[ord(i)-97]+=1\r\n elif(i.isupper()):\r\n b[ord(i)-65]+=1\r\nfor i in l:\r\n if(i.islower()):\r\n c[ord(i)-97]+=1\r\n elif(i.isupper()):\r\n d[ord(i)-65]+=1\r\nres=0\r\nfor i in range(26):\r\n if(c[i]!=0):\r\n if(c[i]>a[i]): \r\n res=-1\r\n print(\"NO\")\r\n break\r\n if(d[i]!=0):\r\n if(d[i]>b[i]):\r\n res=-1\r\n print(\"NO\")\r\n break\r\n \r\nif(res==0):\r\n print(\"YES\")\r\n\r\n ", "from collections import Counter\ns=input()\nt=input()\ns=s.replace(' ','')\nt=t.replace(' ','')\nsl=[]\ntl=[]\nsl.extend(s)\ntl.extend(t)\n#print(Counter(tl)-Counter(sl))\nif(len(Counter(tl)-Counter(sl))==0):\n\tprint('YES')\nelse:\n\tprint('NO')", "Str = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nStr += 'abcdefghijklmnopqrstuvwxyz'\r\na = input()\r\nn = input()\r\ntest = []\r\nans = []\r\nfor i in Str:\r\n\ttest.append(a.count(i))\r\n\tans.append(n.count(i))\r\ncheck = 'YES'\r\nfor i in range(len(test)):\r\n\tif ans[i] > test[i]:\r\n\t\tcheck = 'NO'\r\n\t\tbreak\r\nprint(check)", "h=input()\r\nt=input()\r\nfor i in (set(t)-set(' ')):\r\n if t.count(i) > h.count(i):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "small=[0]*26;capital=[0]*26;f=1\r\nfor i in input():\r\n if 'a' <= i <= 'z':\r\n small[ord(i)-97]+=1\r\n elif 'A' <= i <= 'Z':\r\n capital[ord(i)-65]+=1 \r\nfor i in input():\r\n if 'a' <= i <= 'z':\r\n if small[ord(i)-97] > 0:\r\n small[ord(i)-97]-=1\r\n else:\r\n f = 0\r\n if 'A' <= i <= 'Z':\r\n if capital[ord(i)-65] > 0:\r\n capital[ord(i)-65]-=1\r\n else:\r\n f = 0 \r\nprint(['YES','NO'][f==0])\r\n", "a=dict.fromkeys(\"qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM\",0)\r\na[\" \"]=200\r\nfor i in input():\r\n a[i]+=1\r\nfor i in input():\r\n a[i]-=1\r\n if a[i]<0:\r\n a=0\r\n break\r\nif a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\n\r\ns1, s2 = input(), input()\r\ncnt1 = Counter(s1)\r\nfor k2, v2 in Counter(s2).most_common():\r\n if k2 != ' ' and cnt1.get(k2, 0) - v2 < 0:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "def solve():\r\n s, t = list(input()), list(input())\r\n for ch in t:\r\n if ch == \" \":\r\n continue\r\n if ch in s:\r\n s.remove(ch)\r\n else:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve()\r\n\r\n", "s1 = input().replace(' ', '')\r\ns2 = input().replace(' ', '')\r\n\r\ngs1 = set(s1)\r\ngs2 = set(s2)\r\nflg = 1\r\nfor i in gs2:\r\n if s2.count(i) > s1.count(i):\r\n flg = 0\r\n break\r\nif flg:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n ", "h =input()\r\ns =input()\r\nc=0\r\nfor i in s:\r\n\tif(i!=\" \"):\r\n\t if(s.count(i)>h.count(i)):\r\n\t c=c+1\r\nprint(\"YES\" if(c==0) else \"NO\")", "h=iter(sorted(''.join(input().split())))\r\nprint(['NO','YES'][all(i in h for i in sorted(''.join(input().split())))])", "a = sorted(str(input()))\r\ns = sorted(str(input()))\r\nd = len (s)\r\ng = len (a)\r\nf = 0\r\nh = 0\r\nj = 0\r\nu=0\r\nwhile s[u]==' ':\r\n f += 1\r\n j += 1\r\n u += 1\r\nu=0\r\nwhile a[u] == ' ':\r\n h += 1\r\n u += 1\r\nwhile f < d :\r\n while h < g :\r\n if (s[f] == a[h]):\r\n j += 1\r\n h += 1\r\n break\r\n h += 1\r\n f += 1\r\nif (j == d ):\r\n print (\"YES\")\r\nelse :\r\n print (\"NO\")", "h = [*map(str, input())]\r\nt = [*map(str, input())]\r\n\r\nfor i in t:\r\n if i != ' ' and i in h:\r\n h.remove(i)\r\n elif i != ' ' and i not in h:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\nexit()\r\n", "s1 = input()\r\ns2 = input()\r\na = True\r\nfor i in s2:\r\n if i == \" \": \r\n continue\r\n if s2.count(i) > s1.count(i):\r\n a = False\r\n break\r\nif a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "input_text = list(input().split(\" \"))\r\nreq_text = list(input().split(\" \"))\r\n\r\nl_inp_freq = [0]*26\r\nu_inp_freq = [0]*26\r\nl_req_freq = [0]*26\r\nu_req_freq = [0]*26\r\n\r\nfor i in range(len(input_text)):\r\n for j in range(len(input_text[i])):\r\n if(ord(input_text[i][j])>90):\r\n l_inp_freq[ord(input_text[i][j])-97]+=1\r\n else:\r\n u_inp_freq[ord(input_text[i][j])-65]+=1\r\n\r\nfor i in range(len(req_text)):\r\n for j in range(len(req_text[i])):\r\n if(ord(req_text[i][j])>90):\r\n l_req_freq[ord(req_text[i][j])-97]+=1\r\n else:\r\n u_req_freq[ord(req_text[i][j])-65]+=1\r\n\r\nflag = 0\r\n\r\nfor i in range(len(l_inp_freq)):\r\n if((l_inp_freq[i]<l_req_freq[i]) or (u_inp_freq[i]<u_req_freq[i])):\r\n flag = 1\r\n break\r\n\r\nif(flag==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n \r\n\r\n\r\n\r\n", "from sys import *\r\nfrom collections import Counter\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\nhead = str(input())[:-1]\r\ntext = str(input())[:-1]\r\n\r\ndic = {}\r\nhead = head.replace(' ','')\r\ntext = text.replace(' ','')\r\nfor char,ct in Counter(head).items():\r\n dic[char] = ct\r\n\r\nfor char,ct in Counter(text).items():\r\n if char not in dic or dic[char] < ct:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "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#################################################\nx=input()\ny=input()\ncnt={}\nfor i in x:\n if i in cnt:\n cnt[i]+=1\n else:\n cnt[i]=1\nfor i in y:\n if i!=' ':\n if i in cnt:\n cnt[i]-=1\n else:\n cnt[i]=-1\nprint(\"NO\" if any(cnt[i]<0 for i in cnt) else \"YES\")\n\n", "s1=input()\r\ns2=input()\r\nd={}\r\na=1\r\nfor i in s1:\r\n d[i]=d.get(i,0)+1 \r\nd[' ']=200\r\nfor i in s2:\r\n if d.get(i,0)==0:\r\n a=0\r\n break\r\n d[i]-=1\r\nif a==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "from collections import Counter\ns1 = input().replace(\" \", \"\")\ns2 = input().replace(\" \", \"\")\nc1 = Counter(s1)\nc2 = Counter(s2)\nfor letter in c2:\n if letter in c1 and c1[letter] >= c2[letter]:\n pass\n else:\n print(\"NO\")\n exit()\nprint(\"YES\")\n", "def main():\r\n s1 = input().replace(' ', '')\r\n s2 = input().replace(' ', '')\r\n\r\n s1_counts = {}\r\n s2_counts = {}\r\n\r\n for x in set(s1):\r\n s1_counts[str(x)] = s1.count(x)\r\n\r\n for x in set(s2):\r\n s2_counts[str(x)] = s2.count(x)\r\n\r\n for key in s2_counts.keys():\r\n if key in s1_counts and s1_counts[key] >= s2_counts[key]:\r\n pass\r\n else: return 'NO'\r\n return 'YES'\r\n\r\nprint(main())", "# your code goes here\r\ns1 = input()\r\ns2 = input()\r\n\r\nflag=0\r\n\r\ns1 = s1.replace(\" \",\"\")\r\ns2 = s2.replace(\" \",\"\")\r\ns1 = \" \".join(s1)\r\ns2 = \" \".join(s2)\r\n\r\nl1 = list(s1.split())\r\nl2=list(s2.split())\r\n\r\n\r\nfor i in range(len(l2)):\r\n\tfor j in range(len(l1)):\r\n\t\tif l2[i]==l1[j]:\r\n\t\t\tflag=1\r\n\t\t\tl1[j]=' '\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tflag=0\r\n\t\t\t\r\n\tif flag!=1:\r\n\t\tbreak\r\n\t\t\r\n\r\nif flag==0:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "s1 = list(input())\r\ns2 = list(input())\r\ncheck = 1\r\nfor x in s2:\r\n if x == \" \":\r\n continue\r\n elif x not in s1:\r\n check = 0\r\n print(\"NO\")\r\n break\r\n else:\r\n s1.remove(x)\r\n #s2.remove(x)\r\nif check:\r\n print(\"YES\")\r\n", "s1 = input().replace(' ','')\ns2 = input().replace(' ','')\nfor i in s2:\n if s2.count(i)>s1.count(i):\n print('NO')\n exit()\nprint('YES')\n", "#n = int(input())\r\n#arr = [int(i) for i in input().split()]\r\n\r\nheading = input()\r\ntext = input()\r\ndone = False\r\n\r\nh_dict = {}\r\ntext_dict = {}\r\nfor c in heading:\r\n if c == ' ':\r\n continue\r\n if c in h_dict:\r\n h_dict[c] += 1\r\n else:\r\n h_dict[c] = 1\r\n \r\nfor c in text:\r\n if c == ' ':\r\n continue\r\n if c in text_dict:\r\n text_dict[c] += 1\r\n else:\r\n text_dict[c] = 1\r\n \r\nfor c in text_dict:\r\n if c not in h_dict or text_dict[c] > h_dict[c]:\r\n print('NO')\r\n done = True\r\n break\r\nif not done:\r\n print('YES')", "s=input()\r\nt=input()\r\nfl=0\r\ns=s.replace(\" \",\"\")\r\nt=t.replace(\" \",\"\")\r\ndic1={}\r\ndic2={}\r\nfor i in s:\r\n if i in dic1:\r\n dic1[i]+=1\r\n else:\r\n dic1[i]=1\r\nfor i in t:\r\n if i in dic2:\r\n dic2[i]+=1\r\n else:\r\n dic2[i]=1\r\n\r\nfor i in t:\r\n if i in s:\r\n if(dic2[i]>dic1[i]):\r\n fl=1\r\n print(\"NO\")\r\n break\r\n if i not in s:\r\n fl=1 \r\n print(\"NO\")\r\n break\r\nif(fl==0):\r\n print(\"YES\")", "header = input().replace(\" \", \"\")\r\ntext = input().replace(\" \", \"\")\r\n\r\nfrom collections import defaultdict, Counter\r\nc = Counter()\r\nd = Counter()\r\nfor i in header:\r\n c[i] += 1\r\n\r\nfor i in text:\r\n d[i] += 1\r\ntry:\r\n\r\n for k, v in d.items():\r\n if v > c[k]:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n\r\nexcept KeyError as e:\r\n print(\"NO\")", "s1 = input().replace(\" \",\"\")\nls = list(input())\nn = len(ls)\nc = 0\nfor i in range(n):\n ind = s1.find(ls[i])\n if ind == -1:\n c = 1\n break\n else:\n s1 = s1[:ind]+\" \"*len(ls[i])+s1[ind+len(ls[i]):]\nif c==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "k=input()\r\np=input()\r\nk=list(k)\r\nfor i in p:\r\n if i==' ':\r\n continue\r\n elif i in k:\r\n k.remove(i)\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "from collections import defaultdict\r\n\r\ns1 = input()\r\ns2 = input()\r\nd = defaultdict(int)\r\nfor c in s1:\r\n d[c] += 1\r\n\r\nok = True\r\nfor c in s2:\r\n if c != ' ':\r\n if d[c] == 0:\r\n ok = False\r\n break\r\n else:\r\n d[c] -= 1\r\nprint('YES' if ok else 'NO')", "from collections import Counter\ns1 = Counter(input().replace(\" \",''))\ns2 = Counter(input().replace(\" \",''))\nf = 0\nfor i in s2:\n val = s2[i]\n if s1.__contains__(i) and s1[i]>0:\n s1[i] = s1[i]-s2[i]\n if s1[i]<0:\n f =1\n break\n else:\n f = 1\n break\n#print(s1,s2)\nif f==1:\n print(\"NO\")\nelse:\n print(\"YES\")", "n=list(input().replace(' ',''))\r\nm=list(input().replace(' ',''))\r\nl=[]\r\nfor _ in m:\r\n if _ in n:\r\n l.append(_)\r\n n.remove(_)\r\nif len(l)==len(m):print('YES')\r\nelse:\r\n print('NO')", "#import sys\r\n#input=sys.stdin.readline\r\na=input().split()\r\nhashi=dict()\r\nfor i in a:\r\n for j in i:\r\n if(j in hashi):\r\n hashi[j]+=1\r\n else:\r\n hashi[j]=1\r\nb=input().split()\r\nfor i in b:\r\n for j in i:\r\n if(j not in hashi or hashi[j]==0):\r\n print(\"NO\")\r\n quit()\r\n hashi[j]-=1\r\nprint(\"YES\")\r\n", "s1 = input()\ns2 = ''.join(input().split())\n\nfrom collections import Counter\n\ncntr = Counter(s1)\n\nfor c in s2:\n if c in cntr and cntr[c] != 0:\n cntr[c] -= 1\n else:\n print('NO')\n break\nelse:\n print('YES')\n", "from collections import Counter\r\nheading = input()\r\nmessage = input()\r\nmessage = message.replace(' ','')\r\nhc = Counter(heading)\r\nmc = Counter(message)\r\nflag = 0\r\nfor i in message:\r\n if mc[i] > hc[i]:\r\n flag = 1\r\n break\r\nif flag :\r\n print('NO')\r\nelse:\r\n print('YES') \r\n# print(heading) \r\n# print(message) ", "s=str(input())\r\ns1=str(input())\r\ns1=s1.replace(' ','')\r\ns=s.replace(' ','')\r\nd=set(s1)\r\nflag=0\r\nfor i in d:\r\n if(s.count(i)<s1.count(i)):\r\n flag=1\r\n break\r\nif(flag==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin as sin\r\ndef gint():return int(sin.readline())\r\ndef gmap():return map(int,sin.readline().split())\r\ndef glist():return list(map(int,sin.readline().split()))\r\ndef gstr():return sin.readline()\r\n\r\nd={}\r\nfor i in range(65,91):\r\n d[chr(i)]=0\r\n\r\nfor i in range(97,123):\r\n d[chr(i)]=0\r\n \r\ns = input()\r\nt = input()\r\n\r\nfor i in s:\r\n if i!=\" \":\r\n d[i]+=1\r\n\r\nf=\"YES\"\r\nfor i in t:\r\n if i!=\" \" :\r\n if d[i]==0:\r\n f=\"NO\"\r\n break\r\n else:\r\n d[i]-=1\r\n \r\n\r\nprint(f) \r\n", "def f(s):\r\n ref = 52 * [0]\r\n for j in range(len(s)):\r\n if ord(s[j]) >= 65 and ord(s[j]) <= 90:\r\n ref[ord(s[j]) - 65] += 1\r\n elif ord(s[j]) >= 97 and ord(s[j]) <= 122:\r\n ref[ord(s[j]) - 97 + 26] += 1\r\n return ref\r\nref1, ref2 = f(str(input())), f(str(input()))\r\noutput = \"YES\"\r\nfor j in range(52):\r\n if ref1[j] < ref2[j]:\r\n output = \"NO\"\r\n break\r\nprint(output)\r\n", "s3=input()\r\ns4=input()\r\n# s2=set(s2)\r\nc=0\r\n# for i in s2:\r\n# if i in s1:\r\n# c+=1\r\ns1=s3.replace(\" \",\"\")\r\ns2=s4.replace(\" \",\"\")\r\n# print(s)\r\nfor i in s2:\r\n # print(i) \r\n # print(s2.count(i))\r\n # if ord(i)==32:\r\n # c-=1\r\n if s2.count(i)<=s1.count(i):\r\n c+=1\r\n# print(c)\r\nif c==len(s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# for i in s2:\r\n# print(ord(i))", "s1 = input()\r\ns2 = input()\r\ns11 = set(s1)\r\ns22 = set(s2)-{\" \"}\r\nflag = 1\r\nfor i in s22:\r\n if s1.count(i)<s2.count(i):\r\n flag = 0\r\n break\r\nif flag == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "\r\nfrom collections import Counter\r\n\r\ns = input()\r\ns1 = input()\r\n\r\n\r\nc = Counter(s)\r\nc1 = Counter(s1)\r\n\r\ntry:\r\n del c[\" \"]\r\nexcept:\r\n pass\r\n\r\ntry:\r\n del c1[\" \"]\r\nexcept:\r\n pass\r\n\r\n\r\nflag = True\r\nfor i in c1:\r\n if c[i] < c1[i]:\r\n flag = False\r\n\r\nprint(\"NO\" if not flag else \"YES\")\r\n", "s1 = input().replace(' ','')\r\ns2 = input().replace(' ','')\r\nfor letter in s2:\r\n found = False\r\n for key in s1:\r\n if letter == key:\r\n s1 = s1.replace(key,'',1)\r\n found = True\r\n break\r\n\r\n if not found:\r\n print('NO')\r\n exit()\r\nprint('YES')", "s1 = input()\r\ns2 = input()\r\nss2 = list(set(s2))\r\nif ss2.count(' ') != 0:\r\n ss2.remove(' ')\r\nlenss2 = len(ss2)\r\nfor i in range(lenss2):\r\n if s1.count(ss2[i]) < s2.count(ss2[i]):\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n \r\n", "s1=input().replace(' ','')\r\ns2=input().replace(' ','')\r\nfor i in set(s2):\r\n if s2.count(i)>s1.count(i):\r\n print('NO')\r\n break\r\nelse:print('YES')\r\n", "import sys \r\ninput = sys.stdin.readline\r\nt = input().split()\r\ns = input().split()\r\nd1 = {chr(i + ord('a')) : 0 for i in range(26)}\r\nd2 = {chr(i + ord('A')) : 0 for i in range(26)}\r\nd2.update(d1)\r\nfor i in t:\r\n for j in i:\r\n d2[j] += 1 \r\nfor i in s:\r\n for j in i:\r\n d2[j] -= 1 \r\nfor i in d2.keys():\r\n if(d2[i] < 0):\r\n print(\"NO\")\r\n break \r\nelse:\r\n print(\"YES\")", "if __name__ == '__main__':\r\n s = input()\r\n t = input()\r\n d, a = dict(), dict()\r\n\r\n for i in s:d[i] = d.get(i, 0) + 1\r\n for i in t:a[i] = a.get(i, 0) + 1\r\n\r\n for k in a.keys():\r\n if k != \" \" and (not k in d.keys() or d[k] < a[k]):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "def solve(dic1,dic2):\r\n for keys in dic2:\r\n req = dic2[keys]\r\n if(keys not in dic1):\r\n return 0\r\n elif dic1[keys] < req:\r\n return 0\r\n\r\n return 1\r\n\r\ns=input()\r\ns2=input()\r\ndic1 = {}\r\ndic2={}\r\nfor i in s:\r\n if(i==' '):\r\n continue\r\n if i in dic1:\r\n dic1[i]+=1\r\n else:\r\n dic1[i]=1\r\nfor i in s2:\r\n if(i==' '):\r\n continue\r\n if i in dic2:\r\n dic2[i]+=1\r\n else:\r\n dic2[i]=1\r\n\r\nf=solve(dic1,dic2)\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = input()\r\ns2 = input()\r\ns2 = s2.replace(' ','')\r\nfor letter in s2:\r\n if letter in s1:\r\n s1 = s1.replace(letter,'',1)\r\n else:\r\n print('NO')\r\n exit()\r\nprint('YES')", "s=input()\r\nt=input()\r\nc=str.count\r\nfor i in t:\r\n if(c(s,i)<c(t,i)) and i!=' ':\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "# Long Contest 1, Problem J\r\nhead = input()\r\ntext = input()\r\n\r\nhm = {}\r\nfor ch in head:\r\n\tif ch == ' ':\r\n\t\tcontinue\r\n\thm[ch] = hm.get(ch, 0)+1\r\ntm = {}\r\nfor ch in text:\r\n\tif ch == ' ':\r\n\t\tcontinue\r\n\ttm[ch] = tm.get(ch, 0)+1\r\n\r\nflag = True\r\nfor ch, tcount in tm.items():\r\n\thcount = hm.get(ch, 0)\r\n\tif hcount == 0 or hcount < tcount:\r\n\t\tflag = False\r\n\t\tbreak\r\nif flag:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\t\t\r\n\t\t", "s1 = input().split(\" \")\r\ns2 = input().split(\" \")\r\ns1 = \"\".join(s1)\r\ns2 = \"\".join(s2)\r\nq = 0\r\nfor i in range(len(s2)):\r\n if s2[i] in s1:\r\n if s2.count(s2[i]) <= s1.count(s2[i]):\r\n q+=1\r\nif q == len(s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# https://codeforces.com/problemset/problem/43/B\r\n\r\nfrom collections import Counter\r\n\r\ns1 = Counter(input())\r\ns2 = Counter(input())\r\n\r\nf = 1\r\nfor i in s2.keys():\r\n if s1[i]<s2[i] and i != ' ':\r\n f = 0\r\n break\r\n\r\nprint('YES' if f else 'NO')", "a = str(input())\r\nb = str(input())\r\nk = 0\r\nfor i in range(0 , len(b)):\r\n if a.count(b[i]) >= b.count(b[i]) or b[i] == ' ':\r\n k += 1\r\nif k == len(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\ns = input()\r\nfor i in s:\r\n if i in a:\r\n a.remove(i)\r\n elif i != ' ':\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "from collections import Counter\r\ns = [Counter(input().replace(' ','')) for i in range(2)]\r\nprint('YES' if not s[1] - s[0] else 'NO')\r\n", "header = list(input())\r\nneed = list(input().split(\" \"))\r\nflag = 0\r\nfor word in need:\r\n\tfor char in word:\r\n\t\tif char in header:\r\n\t\t\theader.remove(char)\r\n\t\telse:\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\nif flag:print(\"NO\")\r\nelse:print(\"YES\")\r\n\r\n", "from collections import Counter\r\n\r\n\r\ndef solve(s1, s2):\r\n c1 = Counter(s1)\r\n c2 = Counter(s2)\r\n for [k, v] in c2.items():\r\n if k == ' ': continue\r\n if c1[k] < v:\r\n return False\r\n return True\r\n\r\n\r\nprint(\"YES\" if solve(input(), input()) else \"NO\")\r\n", "newspaper = input()\n\nd = {}\nfor it in newspaper:\n\tif it != ' ':\n\t\tif it in d:\n\t\t\td[it] +=1\n\t\telse:\n\t\t\td[it] = 1\n\nmsg = input()\n\npassFlag = True\nfor it in msg:\n\tif it != ' ':\n\t\tif it in d:\n\t\t\td[it] = d[it] -1\n\t\t\tif(d[it]<0):\n\t\t\t\tpassFlag = False\n\t\t\t\tbreak\n\t\telse:\n\t\t\tpassFlag = False\n\t\t\tbreak\nprint(\"YES\" if passFlag else \"NO\")\n\n\n\n \t \t \t\t\t\t \t \t \t", "# list_cont_1 = list(input())\r\n# list_cont_2 = list(input())\r\n# cont_1 = {}\r\n# cont_2 = {}\r\n#\r\n# ans = 'YES'\r\n#\r\n# for item in list_cont_1:\r\n# key = item\r\n# if item == ' ':\r\n# continue\r\n# if cont_1.get(key) is not None:\r\n# cont_1[key] += 1\r\n# else:\r\n# cont_1[key] = 1\r\n#\r\n# for item in list_cont_2:\r\n# key = item\r\n# if item == ' ':\r\n# continue\r\n# if cont_2.get(key) is not None:\r\n# cont_2[key] += 1\r\n# else:\r\n# cont_2[key] = 1\r\n#\r\n# for key in list_cont_2:\r\n# if key in cont_2 and cont_1[key] >= cont_2[key]:\r\n# continue\r\n# else:\r\n# ans = 'NO'\r\n# break\r\n#\r\n# print(ans)\r\n\r\n\r\n\r\nmainStr, text, ans = input(), input(), 'YES'\r\ncont = {}\r\nfor item in mainStr:\r\n if item == ' ':\r\n continue\r\n if item in cont:\r\n cont[item] += 1\r\n else:\r\n cont[item] = 1\r\n\r\nfor item in text:\r\n if item == ' ':\r\n continue\r\n if item in cont and cont[item] > 0:\r\n cont[item] -= 1\r\n else:\r\n ans = \"NO\"\r\n break\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "from collections import Counter\nheading = Counter(input())\ntext = Counter(input())\nfor elem in text.elements():\n if elem == ' ':\n continue\n elif elem not in heading.elements() or text[elem] > heading[elem]:\n print(\"NO\")\n exit()\nprint(\"YES\")\n\n\t\t\t \t\t\t\t \t\t \t\t\t\t\t \t\t\t \t\t \t", "heading = input()\ntext = list(map(str, input().split()))\nflag = True\nfor i in range(len(text)): \n n = len(text[i]) \n for j in range(n): \n if text[i][j] not in heading:\n flag = False \n break\n else:\n ind = heading.index(text[i][j])\n heading = heading[:ind] + heading[ind+1:]\n\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t\t\t\t\t\t \t \t\t \t \t \t \t", "newspapper = list(input().replace(' ', ''))\r\nletter = list(input().replace(' ', ''))\r\n\r\n\r\nfor c in letter:\r\n if c in newspapper:\r\n newspapper.remove(c)\r\n else:\r\n print (\"NO\")\r\n break\r\nelse:\r\n print (\"YES\")", "\r\ndef solution():\r\n\tst1=input()\r\n\tst2=input()\r\n\r\n\tdicty1={}\r\n\tdicty2={}\r\n\tLET='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n\tLET+=LET.lower()\r\n\r\n\tfor c in LET:\r\n\t\t\r\n\t\tdicty1[c]=0\r\n\t\tdicty2[c]=0\r\n\r\n\tfor c in st1:\r\n\t\tif c!=' ':\r\n\t\t\tdicty1[c]+=1\r\n\r\n\tfor c in st2:\r\n\t\tif c!=' ':\r\n\t\t\tdicty2[c]+=1\r\n\r\n\r\n\tfor c in dicty2:\r\n\t\tif dicty2[c]>dicty1[c]:\r\n\t\t\tprint('NO')\r\n\t\t\treturn\r\n\tprint('YES')\r\n\t\r\n\r\n\r\n\r\n\r\n\treturn\r\n\r\n\r\n\r\n\r\nsolution()\r\n", "def func(s1,s2):\r\n l1=list(s1)\r\n for i in s2:\r\n if i!=' ':\r\n if i in l1:\r\n l1[l1.index(i)]=' '\r\n else:\r\n return 'NO'\r\n return 'YES'\r\n\r\n\r\ns1=input()\r\ns2=input()\r\nprint(func(s1,s2))", "a = input()\r\nb = input()\r\nflag = 0\r\nfor i in range(0, len(b)):\r\n if b[i] == ' ':\r\n continue\r\n else:\r\n t = a.find(b[i])\r\n if t == -1:\r\n flag=1\r\n break\r\n else :\r\n a = a[:t] + '0' + a[t + 1:]\r\nif flag == 1 :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s1 = input()\ns2 = input()\nfor i in range(len(s2)):\n if s2[i] != ' ' and s1.count(s2[i]) < s2.count(s2[i]):\n print('NO')\n break\n if i == len(s2) - 1:\n print('YES')\n", "l = input().strip()\r\ns2 = input()\r\nfreq1 = {}\r\nfor i in l:\r\n if i in freq1:\r\n freq1[i]+=1\r\n else:\r\n freq1[i] = 1\r\nfor s in s2:\r\n if s == ' ':\r\n continue\r\n elif s in freq1.keys():\r\n if freq1[s]>0:\r\n freq1[s]-=1\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "import sys,math\n'''\nclass node:\n def __init__(self,data,next):\n self.data = data\n self.next= next\n\nx = node(4,None)\nb = node(2,x)\nt = node(3,b)\nhead = node(1,t)\n\np1 = head\np2 = head\nwhile p2 != None:\n p1 = p1.next\n p2=p2.next.next\np2 = head\nwhile p1!=None:\n print(p2.data)\n print(p1.data)\n p2=p2.next\n p1=p1.next\n'''\ndef iss(arr,a):\n for i in range(len(a)):\n if a[i].isalpha():\n if a[i] not in arr or arr[a[i]] == 0:\n return \"NO\"\n else:\n arr[a[i]] -= 1\n return \"YES\"\n\n\ns = input()\narr = {}\nfor i in range(len(s)):\n if s[i].isalpha():\n if s[i] not in arr:\n arr[s[i]] = 1\n else:\n arr[s[i]] += 1\na = input()\nprint(iss(arr,a))\n", "a=input().strip()\r\nb=input().strip()\r\nfor i in b:\r\n if i!=\" \" and i in a:\r\n a=a.replace(i,\"\",1)\r\n elif i!=\" \":\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "s1 = input()\r\ns2 = input()\r\nflag = True\r\nfor c in s2:\r\n if c == ' ':\r\n continue\r\n i = s1.find(c)\r\n if i != -1:\r\n s1 = s1[:i] + s1[i+1:]\r\n else:\r\n flag = False\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "dict1 = {}\r\nfor letter in input():\r\n if letter in dict1: dict1[letter] +=1\r\n else: dict1[letter] = 1\r\nfor letter in input():\r\n if letter in dict1: dict1[letter] -=1\r\n else: dict1[letter] = -1\r\ndict1.pop(\" \", None)\r\nprint(\"NO\") if min(dict1.values()) < 0 else print(\"YES\") ", "def solve():\r\n str1 = input().replace(' ','')\r\n str2 = input().replace(' ','')\r\n for c in str2:\r\n if str1.count(c) < str2.count(c):\r\n print(\"NO\\n\")\r\n return\r\n print(\"YES\\n\")\r\n return\r\n\r\nsolve()", "from collections import Counter\r\n\r\ns1 = dict(Counter(list(input())))\r\ns2 = dict(Counter(list(input())))\r\ncount = 0\r\n\r\nif ' ' in s2:\r\n\tdel s2[' ']\r\n\r\nfor i in s2:\r\n\tif i in s1 and i:\r\n\t\tif s1[i] >= s2[i]:\r\n\t\t\tcount += 1\r\nif count == len(s2):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "A = input()\r\nB = input()\r\nA = A.replace(\" \",\"\")\r\nB = B.replace(\" \",\"\")\r\nC = set(B)\r\nfor k in C:\r\n if(B.count(k)>A.count(k)):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "s = input()\r\ns = s.replace(' ', '')\r\narr = list(s)\r\nj = input()\r\nj = j.replace(\" \", '')\r\narr2 = list(j)\r\nfor k in arr2:\r\n if k in arr:\r\n arr.remove(k)\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "s1=input()\r\ns2=input()\r\nfor i in range(len(s2)):\r\n if s2[i]!=' ':\r\n if s2.count(s2[i])>s1.count(s2[i]):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nflag = True\r\nars1 = []\r\nars2 = []\r\nfor i in range(len(s1)):\r\n if s1[i] != ' ':\r\n ars1.append(s1[i])\r\n\r\nfor k in range(len(s2)):\r\n if s2[k] != ' ':\r\n ars2.append(s2[k])\r\n\r\n\r\nfor i in range(len(ars2)):\r\n if ars2[i] not in ars1:\r\n flag = False\r\n break\r\n else:\r\n t = ars2[i]\r\n ars1.remove(t)\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\r\nhd = list(input())\r\ntxt = list(input())\r\nh = hd.count(' ')\r\nt = txt.count(' ')\r\nfor _ in range(h):\r\n\thd.remove(' ')\r\nfor _ in range(t):\r\n\ttxt.remove(' ')\r\n\r\n\r\nfor i in txt:\r\n\tif i in hd:\r\n\t\thd.remove(i)\r\n\telse:\r\n\t\tprint('NO')\r\n\t\texit()\r\nprint('YES')\r\n", "s1 = input()\r\ns2 = input()\r\ns1 = s1.replace(\" \", \"\")\r\ns2 = s2.replace(\" \", \"\")\r\not = \"YES\"\r\nfor i in range(len(s2)):\r\n if s1.find(s2[i]) == -1:\r\n ot = \"NO\"\r\n break\r\n elif s1.count(s2[i]) < s2.count(s2[i]):\r\n ot = \"NO\"\r\n break \r\n \r\nprint(ot)\r\n", "def main():\r\n from sys import stdin, stdout\r\n import collections\r\n\r\n inp = collections.Counter(stdin.readline().strip())\r\n out = collections.Counter(stdin.readline().strip())\r\n\r\n flag = True\r\n for k in out:\r\n if k!=' ' and inp[k]<out[k]:\r\n flag=False\r\n break\r\n if flag:\r\n stdout.write('YES\\n')\r\n else:\r\n stdout.write('NO\\n')\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "s1 = input()\r\ns2 = input()\r\nisCan = True\r\nfor c in s2:\r\n if c.isalpha():\r\n index = s1.find(c)\r\n if index == -1:\r\n isCan = False\r\n break\r\n else:\r\n s1 = s1[:index] + s1[index + 1:]\r\nif isCan:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nf = input()\r\n\r\narr1 = {}\r\narr2 = {}\r\n\r\nfor i in s:\r\n if i == ' ':\r\n continue\r\n if i in arr1.keys():\r\n arr1[i] += 1\r\n else:\r\n arr1[i] = 1\r\n\r\nfor i in f:\r\n if i == ' ':\r\n continue\r\n if i in arr2.keys():\r\n arr2[i] += 1\r\n else:\r\n arr2[i] = 1\r\n\r\n\r\nfor key in arr2.keys():\r\n if key not in arr1.keys() or arr1[key] < arr2[key]:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "def indexOf(cont, item):\r\n for i in range(len(cont)):\r\n if cont[i]==item:\r\n return i\r\n return -1\r\n\r\nsource=list()\r\nletter=list()\r\nfor item in input():\r\n if item!=' ':\r\n source.append(item)\r\n\r\nfor item in input():\r\n if item!=' ':\r\n letter.append(item)\r\n\r\n\r\ni=0\r\nwhile i<len(letter):\r\n indexOfith = indexOf(source, letter[i])\r\n if indexOfith==-1:\r\n break\r\n else:\r\n del source[indexOfith]\r\n i+=1\r\n\r\nprint(\"YES\" if i==len(letter) else \"NO\")\r\n", "s1 = input()\ns2 = input()\n\nfreq = {}\nfor ch in s1:\n if ch == ' ':\n continue\n if ch in freq:\n freq[ch] += 1\n else:\n freq[ch] = 1\n\nans = True\nfor ch in s2:\n if ch == ' ':\n continue\n if ch not in freq:\n ans = False\n break\n freq[ch] -= 1\n if freq[ch] < 0:\n ans = False\n break\n\nprint('YES' if ans else 'NO')\n", "from collections import Counter\r\ns1,s2=Counter(input().replace(' ','')),Counter(input().replace(' ',''))\r\na=False\r\nfor x in s2:\r\n if x in s1 and s2[x]<=s1[x]:a=True\r\n else:a=False;break\r\nprint('YES' if a else 'NO')", "from collections import Counter,defaultdict\r\ns=input().rstrip()\r\ns=s.replace(' ','')\r\nt=input().rstrip()\r\nt=t.replace(' ','')\r\nd=defaultdict(int)\r\nd=Counter(s)\r\nf=0\r\nfor x in t:\r\n if d[x]>=1:\r\n d[x]-=1\r\n else:\r\n f=1\r\n break\r\n\r\nif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s1 = list(input().replace(' ', ''))\r\ns2 = list(input().replace(' ', ''))\r\ns3 = []\r\nfor i in s2:\r\n if i in s1:\r\n s1.remove(i)\r\n s3.append(i)\r\nif len(s3) == len(s2):\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve():\r\n l = input().replace(' ','')\r\n l1= input().replace(' ','')\r\n s=set(l1)\r\n mp ={}\r\n mp2={}\r\n for i in l:\r\n if mp.get(i)==None:\r\n mp[i]=1\r\n else:\r\n mp[i]+=1\r\n for i in l1:\r\n if mp2.get(i)==None:\r\n mp2[i]=1\r\n else:\r\n mp2[i]+=1\r\n for i in s:\r\n if(mp.get(i)==None):\r\n print('NO')\r\n return\r\n elif(mp[i]<mp2[i]):\r\n print('NO')\r\n return\r\n print('YES')\r\nif __name__ == '__main__':\r\n solve()", "h,m= {},{}\r\nfor x in input().split():\r\n for ch in x:\r\n if ch not in h.keys():\r\n h.update({ch:1})\r\n else:\r\n h[ch] += 1\r\nfor y in input().split(' '):\r\n for ch in y:\r\n if ch not in m.keys():\r\n m.update({ch:1})\r\n else:\r\n m[ch] += 1\r\nfor sec in m.keys():\r\n if sec not in h.keys() or m[sec] > h[sec]:\r\n print('NO'); exit()\r\nprint ('YES')\r\n", "from itertools import permutations\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nmap_s = {}\r\n\r\nfor letter in s1:\r\n if letter in map_s:\r\n map_s[letter] += 1\r\n else:\r\n map_s[letter] = 1\r\n\r\nfor letter in s2:\r\n if letter == ' ':\r\n continue\r\n if letter not in map_s:\r\n print(\"NO\")\r\n exit(0)\r\n else:\r\n if map_s[letter] == 0:\r\n print(\"NO\")\r\n exit(0)\r\n else:\r\n map_s[letter] -= 1\r\nprint(\"YES\")\r\n", "a = input().strip()\r\na = a.replace(\" \",\"\")\r\ns = input().strip()\r\ns = s.replace(\" \",\"\")\r\nd = {}\r\nfor i in a:\r\n d.setdefault(i,0)\r\n d[i]+=1\r\nf = True\r\nfor i in s:\r\n if i in d and d[i]>0:\r\n d[i]-=1\r\n else : f=False\r\nif f:print(\"YES\")\r\nelse:print(\"NO\")", "s=list(input())\r\nstring=list(input())\r\ndic={}\r\nfor i in range(0,len(s)):\r\n if s[i]!=\" \":\r\n if s[i] not in dic:\r\n dic[s[i]]=1\r\n else:\r\n dic[s[i]]+=1\r\nflag=0\r\nfor i in range(0,len(string)):\r\n if string[i]!=\" \":\r\n if string[i] not in dic:\r\n flag=1\r\n break\r\n \r\n else:\r\n if dic[string[i]]>0:\r\n \r\n dic[string[i]]-=1\r\n else:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a,b=input().replace(' ',''),input().replace(' ','')\nfor i in b:\n if b.count(i)>a.count(i):\n print('NO');exit()\nprint('YES')\n#TRASH LUOGU OJ! TRASH LUOGU ADMINS!", "s1 = list(input())\r\nn1 = len(s1)\r\ns2 = list(input())\r\nn2 = len(s2)\r\nfor i in range(n2):\r\n for j in range(n1):\r\n if s2[i] == \" \":\r\n s2[i] = \"0\"\r\n break\r\n if s1[j] == s2[i]:\r\n s1[j] = \"-1\"\r\n s2[i] = \"0\"\r\n break\r\nif s2 == [\"0\"]*n2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\nfrom collections import Counter\r\n\r\nalphabet = sys.stdin.readline().replace(\" \", \"\")\r\ntarget = sys.stdin.readline().replace(\" \", \"\")\r\n\r\naletters = Counter(alphabet)\r\ntletters = Counter(target)\r\n\r\nif all(aletters[L] >= tletters[L] for L in target):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\ndef solve():\r\n s1=input()\r\n s2=input()\r\n d1=Counter(s1)\r\n d2=Counter(s2)\r\n # print(d1)\r\n # print(d2)\r\n for i in d2:\r\n if i!=\" \":\r\n if i not in d1:\r\n print(\"NO\")\r\n return\r\n if d1[i]<d2[i]:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\n\r\nsolve()", "import sys\r\nfrom collections import Counter\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\ndef solve(h,s):\r\n hc = {}\r\n for e,t in Counter(h).items():\r\n hc[e] = t\r\n\r\n for i in s:\r\n if i in hc:\r\n hc[i] -= 1\r\n if hc[i] < 0:\r\n print(\"NO\")\r\n return\r\n else:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nh = str(input())[:-1]\r\ns = str(input())[:-1]\r\nh = ''.join(h.split());s = ''.join(s.split())\r\nsolve(h,s)\r\n\r\n", "s=input()\r\na=input()\r\nfor i in range(len(a)):\r\n\tif a[i]!=' ':\r\n\t\tif a.count(a[i])<=s.count(a[i]):\r\n\t\t\tflag=1\r\n\t\telse:\r\n\t\t\tflag=0\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\t\r\nif flag==1:\r\n\tprint('YES')", "from collections import Counter\r\na=list(input())\r\nb=input()\r\nb=list(b.replace(\" \",\"\"))\r\nx=Counter(a)\r\ny=Counter(b)\r\nk=True\r\nfor i in y:\r\n if y[i]>x[i]:\r\n k=False\r\nif k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def func(enun, titu):\n for letra in enun:\n if letra in titu:\n titu.remove(letra)\n else:\n return \"NO\"\n return \"YES\"\n\ntitulo = input().replace(\" \", \"\")\nlistaLetras = list(titulo)\nenunciado = input().replace(\" \", \"\")\nprint(func(enunciado, listaLetras))\n\t \t\t \t \t\t\t \t\t\t\t \t\t \t \t\t", "# Letter\r\n\r\n# Link : https://codeforces.com/contest/43/problem/B\r\n\r\nheading = input()\r\n\r\n\r\nheading = [i for i in heading if i != ' ']\r\n\r\nletter = input()\r\n\r\nletter = [i for i in letter if i != ' ']\r\n\r\nfor i in letter:\r\n if (i in heading):\r\n heading.pop(heading.index(i))\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "def main_function():\r\n s_1 = input()\r\n s_2 = input()\r\n hash_1 = [0 for i in range(150)]\r\n hash_2 = [0 for i in range(150)]\r\n for i in s_1:\r\n if not i == \" \":\r\n hash_1[ord(i)] += 1\r\n for i in s_2:\r\n if not i == \" \":\r\n hash_2[ord(i)] += 1\r\n is_given = False\r\n for i in range(len(hash_1)):\r\n if hash_1[i] < hash_2[i]:\r\n print(\"NO\")\r\n is_given = True\r\n break\r\n if not is_given:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "s1 = ''.join(input().split())\r\ns2 = ''.join(input().split())\r\n\r\ns1Count = {}\r\ns2Count = {}\r\n\r\nfor c in s1:\r\n s1Count[c] = s1Count.get(c,0)+1\r\n\r\nfor c in s2:\r\n s2Count[c] = s2Count.get(c,0)+1\r\n\r\nfor key,val in s2Count.items():\r\n if val > s1Count.get(key,0):\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "def f():\r\n h = list(input())\r\n s = list(input())\r\n\r\n for i in s:\r\n if i!=\" \":\r\n if i in h:\r\n h.remove(i)\r\n else:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nprint(f())", "heading = input()\r\nif \" \" in heading:\r\n heading = \"\".join(heading.split())\r\nhist = {}\r\nfor char in heading:\r\n hist[char] = hist.get(char,0)+1\r\ntext = input()\r\nif \" \" in text:\r\n text = \"\".join(text.split())\r\nflg = 0\r\nfor char in text:\r\n try:\r\n if hist[char]:\r\n hist[char]-=1\r\n else:\r\n flg = 1\r\n break\r\n except:\r\n flg = 1\r\n break\r\nif flg:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "h = input()\ns = input()\nd = {}\nfor i in h:\n if i not in d:\n d[i] = 1\n else:\n d[i]+=1\nflag= 0\nfor i in s:\n if i==' ':\n continue\n if i in d and d[i]!=0:\n d[i]-=1\n else:\n flag = 1\n break\nif(flag==1):\n print(\"NO\")\nelse:\n print(\"YES\")\n", "str1 = input()\r\nstr2 = input()\r\ns1 = [chars for chars in str1 if chars!=\" \"]\r\ns2 = [chars for chars in str2 if chars!=\" \"]\r\nans = True\r\nfor char in s2:\r\n if(str1.count(char)<s2.count(char)):\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 \r\n\r\n\r\n\r\n", "import sys\r\ns1 = sys.stdin.readline().strip()\r\ns2 = sys.stdin.readline().strip()\r\ns1=s1.replace(' ', \"\")\r\ns2=s2.replace(' ', \"\")\r\nfor i in s2:\r\n if s2.count(i) > s1.count(i):\r\n print(\"NO\");\r\n exit(0)\r\nprint(\"YES\")", "s=input()\r\ns1=input()\r\nd={}\r\nfor x in s1 :\r\n d[x]=d.get(x,0)+1\r\nd[' ']=-100\r\nfor x in s :\r\n d[x]=d.get(x,0)-1\r\nfor x in d :\r\n if d[x]>0 :\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "from collections import defaultdict\r\na = input().split()\r\nb = input().split()\r\n\r\nmymp = {}\r\nmymp = defaultdict(lambda: 0, mymp)\r\nfor word in a:\r\n for letter in word:\r\n mymp[str(letter)] += 1\r\n\r\nans = 1\r\nfor word in b:\r\n for letter in word:\r\n if (mymp[letter] != 0):\r\n mymp[letter] -= 1\r\n else:\r\n ans = 0\r\n break\r\n\r\nprint('YES') if ans else print('NO')", "dict = {}\r\n\r\nfor c in input():\r\n if c == ' ':\r\n continue\r\n if c in dict:\r\n dict[c] += 1\r\n else:\r\n dict[c] = 1\r\n\r\nans = 'YES'\r\nfor c in input():\r\n if c == ' ':\r\n continue\r\n if c in dict and dict[c] > 0:\r\n dict[c] -= 1\r\n else:\r\n ans = 'NO'\r\n break\r\nprint(ans)\r\n", "from collections import Counter\nfrom itertools import permutations\n\ndef main():\n heads = Counter(x for x in input() if x != ' ')\n msg = Counter(x for x in input() if x != ' ')\n\n for char, cnt in msg.items():\n if heads[char] < cnt:\n print('NO')\n break\n else:\n print('YES')\n\n\nmain()\n", "t = input().replace(' ','')\r\ns = input().replace(' ','')\r\na = {}\r\nfor i in t:\r\n\tif i in a:\r\n\t\ta[i] += 1\r\n\telse:\r\n\t\ta[i] = 1\r\nfor i in s:\r\n\tif i not in a or a[i] <=0 :\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\telse:\r\n\t\ta[i] -= 1\r\nprint(\"YES\")", "from collections import Counter\n# n = Counter('Instead of dogging your footsteps it disappears but you dont notice anything')\n# m = Counter('Your dog is upstears')\nn = Counter(input())\nm = Counter(input())\n\nn[' '] = 0\nm[' '] = 0\n#print(n, m, sep='\\n')\nfor i, j in m.items():\n if j > n[i]:\n print('NO')\n break\nelse:\n print('YES')\n", "s=input().replace(\" \", \"\");b=input().replace(\" \", \"\");c=0\r\nd1=dict();d2=dict()\r\nfor i in b:\r\n if i in d2:d2[i]+=1\r\n else:d2[i]=1\r\nfor i in s:\r\n if i in d1:d1[i]+=1\r\n else:d1[i]=1\r\nfor i in d2:\r\n if i in d1:\r\n if d1[i]>=d2[i] :c+=1\r\nif(c==len(d2)) :print(\"YES\")\r\nelse :print(\"NO\")", "import math\r\n\r\ndef input_list_int():\r\n return list(map(int, input().split()))\r\n\r\ns_1 = list(map(list, input().split()))\r\ns_2 = list(map(list, input().split()))\r\n\r\nletters = {}\r\nfor word in s_1:\r\n for letter in word:\r\n if letter in letters.keys():\r\n letters[letter] += 1\r\n else:\r\n letters[letter] = 1\r\n\r\nfor word in s_2:\r\n for letter in word:\r\n if letter in letters.keys():\r\n if letters[letter] > 0:\r\n letters[letter] -= 1\r\n else:\r\n print('NO')\r\n exit()\r\n else:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "def letter(s1, s2):\r\n lista_s1 = []\r\n lista_s2 = []\r\n\r\n for word in s1.split():\r\n for char in word:\r\n lista_s1.append(char)\r\n \r\n for word in s2.split():\r\n for char in word:\r\n lista_s2.append(char)\r\n \r\n lista = lista_s2.copy()\r\n \r\n for s in lista:\r\n for i in range(len(lista_s1)):\r\n if s == lista_s1[i]:\r\n del lista_s1[i]\r\n lista_s2.remove(s)\r\n break\r\n \r\n if not lista_s2:\r\n return 'YES'\r\n return 'NO'\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nprint(letter(s1, s2))", "s1=input()\r\ns2=input()\r\nl1=[]\r\nl2=[]\r\nflag=0\r\nfor i in range(0,len(s1)):\r\n l1.append(s1[i])\r\n\r\nfor i in range(0,len(s2)):\r\n if(s2[i] in l1):\r\n l1.remove(s2[i])\r\n elif(s2[i]==' '):\r\n continue\r\n\r\n else:\r\n flag=1\r\n break\r\nif(flag==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "heading=\"\".join(input().split())\r\ntext=\"\".join(input().split())\r\nans=\"YES\"\r\nfor i in text:\r\n if text.count(i)>heading.count(i):\r\n ans=\"NO\"\r\n break\r\nprint(ans)" ]